Home
last modified time | relevance | path

Searched refs:__t (Results 1 – 25 of 53) sorted by relevance

123

/external/stlport/stlport/stl/
D_time_facets.c152 const ios_base& __s, ios_base::iostate& __err, tm* __t) { in _STLP_WEAK() argument
174 __t->tm_wday = __STATIC_CAST(int, __index); in _STLP_WEAK()
185 __t->tm_mon = __STATIC_CAST(int, __index); in _STLP_WEAK()
190 bool __pr = __get_decimal_integer(__first, __last, __t->tm_mday, __STATIC_CAST(_Ch*, 0)); in _STLP_WEAK()
191 if (!__pr || __t->tm_mday < 1 || __t->tm_mday > 31) { in _STLP_WEAK()
199 bool __pr = __get_decimal_integer(__first, __last, __t->tm_hour, __STATIC_CAST(_Ch*, 0)); in _STLP_WEAK()
206 bool __pr = __get_decimal_integer(__first, __last, __t->tm_yday, __STATIC_CAST(_Ch*, 0)); in _STLP_WEAK()
213 bool __pr = __get_decimal_integer(__first, __last, __t->tm_mon, __STATIC_CAST(_Ch*, 0)); in _STLP_WEAK()
214 --__t->tm_mon; in _STLP_WEAK()
215 if (!__pr || __t->tm_mon < 0 || __t->tm_mon > 11) { in _STLP_WEAK()
[all …]
D_time_facets.h141 ios_base::iostate& __err, tm* __t) const in get_time() argument
142 { return do_get_time(__s, __end, __str, __err, __t); } in get_time()
144 ios_base::iostate& __err, tm* __t) const in get_date() argument
145 { return do_get_date(__s, __end, __str, __err, __t); } in get_date()
147 ios_base::iostate& __err, tm* __t) const in get_weekday() argument
148 { return do_get_weekday(__s, __end, __str, __err, __t); } in get_weekday()
150 ios_base::iostate& __err, tm* __t) const in get_monthname() argument
151 { return do_get_monthname(__s, __end, __str, __err, __t); } in get_monthname()
153 ios_base::iostate& __err, tm* __t) const in get_year() argument
154 { return do_get_year(__s, __end, __str, __err, __t); } in get_year()
[all …]
D_tree.h436 void swap(_Self& __t) {
437 if (__t.empty()) {
439 __t._M_header.swap(this->_M_header);
440 __t._M_rebind(&this->_M_header._M_data);
444 __t.swap(*this);
448 this->_M_header.swap(__t._M_header);
449 this->_M_rebind(&__t._M_header._M_data);
450 __t._M_rebind(&this->_M_header._M_data);
452 _STLP_STD::swap(_M_node_count, __t._M_node_count);
453 _STLP_STD::swap(_M_key_compare, __t._M_key_compare);
/external/libcxx/include/
D__split_buffer443 __split_buffer<value_type, __alloc_rr&> __t(__n, 0, __alloc());
444 __t.__construct_at_end(move_iterator<pointer>(__begin_),
446 _VSTD::swap(__first_, __t.__first_);
447 _VSTD::swap(__begin_, __t.__begin_);
448 _VSTD::swap(__end_, __t.__end_);
449 _VSTD::swap(__end_cap(), __t.__end_cap());
463 __split_buffer<value_type, __alloc_rr&> __t(size(), 0, __alloc());
464 __t.__construct_at_end(move_iterator<pointer>(__begin_),
466 __t.__end_ = __t.__begin_ + (__end_ - __begin_);
467 _VSTD::swap(__first_, __t.__first_);
[all …]
Dtuple215 explicit __tuple_leaf(_Tp&& __t) _NOEXCEPT_((is_nothrow_constructible<_Hp, _Tp>::value))
216 : value(_VSTD::forward<_Tp>(__t))
231 explicit __tuple_leaf(integral_constant<int, 0>, const _Alloc&, _Tp&& __t)
232 : value(_VSTD::forward<_Tp>(__t))
245 explicit __tuple_leaf(integral_constant<int, 1>, const _Alloc& __a, _Tp&& __t)
246 : value(allocator_arg_t(), __a, _VSTD::forward<_Tp>(__t))
259 explicit __tuple_leaf(integral_constant<int, 2>, const _Alloc& __a, _Tp&& __t)
260 : value(_VSTD::forward<_Tp>(__t), __a)
273 __tuple_leaf(const __tuple_leaf& __t) _NOEXCEPT_(is_nothrow_copy_constructible<_Hp>::value)
274 : value(__t.get())
[all …]
Dnumeric117 typename iterator_traits<_InputIterator>::value_type __t(*__first);
118 *__result = __t;
121 __t = __t + *__first;
122 *__result = __t;
136 typename iterator_traits<_InputIterator>::value_type __t(*__first);
137 *__result = __t;
140 __t = __binary_op(__t, *__first);
141 *__result = __t;
Dthread286 thread(thread&& __t) _NOEXCEPT : __t_(__t.__t_) {__t.__t_ = 0;}
287 thread& operator=(thread&& __t) _NOEXCEPT;
291 void swap(thread& __t) _NOEXCEPT {_VSTD::swap(__t_, __t.__t_);}
330 __thread_execute(tuple<_Fp, _Args...>& __t, __tuple_indices<_Indices...>)
332 __invoke(_VSTD::move(_VSTD::get<0>(__t)), _VSTD::move(_VSTD::get<_Indices>(__t))...);
390 thread::operator=(thread&& __t) _NOEXCEPT
394 __t_ = __t.__t_;
395 __t.__t_ = 0;
432 sleep_until(const chrono::time_point<_Clock, _Duration>& __t)
438 while (_Clock::now() < __t)
[all …]
D__tree660 {__tree_iterator __t(*this); ++(*this); return __t;}
668 {__tree_iterator __t(*this); --(*this); return __t;}
751 {__tree_const_iterator __t(*this); ++(*this); return __t;}
759 {__tree_const_iterator __t(*this); --(*this); return __t;}
889 __tree(const __tree& __t);
890 __tree& operator=(const __tree& __t);
896 __tree(__tree&& __t)
900 __tree(__tree&& __t, const allocator_type& __a);
901 __tree& operator=(__tree&& __t)
925 void swap(__tree& __t)
[all …]
Dexception186 _LIBCPP_INLINE_VISIBILITY explicit __nested(const _Tp& __t) : _Tp(__t) {}
193 throw_with_nested(_Tp&& __t, typename enable_if<
198 throw_with_nested (_Tp& __t, typename enable_if<
204 throw __nested<typename remove_reference<_Tp>::type>(_VSTD::forward<_Tp>(__t));
212 throw_with_nested(_Tp&& __t, typename enable_if<
217 throw_with_nested (_Tp& __t, typename enable_if<
223 throw _VSTD::forward<_Tp>(__t);
D__mutex_base120 unique_lock(mutex_type& __m, const chrono::time_point<_Clock, _Duration>& __t)
121 : __m_(&__m), __owns_(__m.try_lock_until(__t)) {}
163 bool try_lock_until(const chrono::time_point<_Clock, _Duration>& __t);
231 unique_lock<_Mutex>::try_lock_until(const chrono::time_point<_Clock, _Duration>& __t)
237 __owns_ = __m_->try_lock_until(__t);
292 const chrono::time_point<_Clock, _Duration>& __t);
297 const chrono::time_point<_Clock, _Duration>& __t,
346 const chrono::time_point<_Clock, _Duration>& __t)
349 wait_for(__lk, __t - _Clock::now());
350 return _Clock::now() < __t ? cv_status::no_timeout : cv_status::timeout;
[all …]
Dcondition_variable138 const chrono::time_point<_Clock, _Duration>& __t);
143 const chrono::time_point<_Clock, _Duration>& __t,
208 const chrono::time_point<_Clock, _Duration>& __t)
215 return __cv_.wait_until(__lk, __t);
222 const chrono::time_point<_Clock, _Duration>& __t,
226 if (wait_until(__lock, __t) == cv_status::timeout)
Dvalarray461 explicit __scalar_expr(const value_type& __t, size_t __s) : __t_(__t), __s_(__s) {}
1218 value_type* __t = __vp_;
1220 for (size_t __n = __size_; __n; --__n, __t += __stride_, __s += __sa.__stride_)
1221 *__t = *__s;
1234 value_type* __t = __vp_;
1235 for (size_t __i = 0; __i < __size_; ++__i, __t += __stride_)
1236 *__t = __v[__i];
1249 value_type* __t = __vp_;
1250 for (size_t __i = 0; __i < __size_; ++__i, __t += __stride_)
1251 *__t *= __v[__i];
[all …]
Dfunctional506 auto operator()(_T1&& __t, _T2&& __u) const
507 { return _VSTD::forward<_T1>(__t) + _VSTD::forward<_T2>(__u); }
531 auto operator()(_T1&& __t, _T2&& __u) const
532 { return _VSTD::forward<_T1>(__t) - _VSTD::forward<_T2>(__u); }
556 auto operator()(_T1&& __t, _T2&& __u) const
557 { return _VSTD::forward<_T1>(__t) * _VSTD::forward<_T2>(__u); }
581 auto operator()(_T1&& __t, _T2&& __u) const
582 { return _VSTD::forward<_T1>(__t) / _VSTD::forward<_T2>(__u); }
606 auto operator()(_T1&& __t, _T2&& __u) const
607 { return _VSTD::forward<_T1>(__t) % _VSTD::forward<_T2>(__u); }
[all …]
Dmutex233 bool try_lock_until(const chrono::time_point<_Clock, _Duration>& __t);
239 timed_mutex::try_lock_until(const chrono::time_point<_Clock, _Duration>& __t)
243 bool no_timeout = _Clock::now() < __t;
245 no_timeout = __cv_.wait_until(__lk, __t) == cv_status::no_timeout;
276 bool try_lock_until(const chrono::time_point<_Clock, _Duration>& __t);
282 recursive_timed_mutex::try_lock_until(const chrono::time_point<_Clock, _Duration>& __t)
294 bool no_timeout = _Clock::now() < __t;
296 no_timeout = __cv_.wait_until(lk, __t) == cv_status::no_timeout;
D__functional_base72 auto operator()(_T1&& __t, _T2&& __u) const
73 { return _VSTD::forward<_T1>(__t) < _VSTD::forward<_T2>(__u); }
462 ref(_Tp& __t) _NOEXCEPT
464 return reference_wrapper<_Tp>(__t);
470 ref(reference_wrapper<_Tp> __t) _NOEXCEPT
472 return ref(__t.get());
478 cref(const _Tp& __t) _NOEXCEPT
480 return reference_wrapper<const _Tp>(__t);
486 cref(reference_wrapper<_Tp> __t) _NOEXCEPT
488 return cref(__t.get());
Dcomplex530 complex<_Tp> __t(__x);
531 __t += __y;
532 return __t;
540 complex<_Tp> __t(__x);
541 __t += __y;
542 return __t;
550 complex<_Tp> __t(__y);
551 __t += __x;
552 return __t;
560 complex<_Tp> __t(__x);
[all …]
Dforward_list269 __forward_list_iterator __t(*this);
271 return __t;
343 __forward_list_const_iterator __t(*this);
345 return __t;
1508 __node_pointer __t = __f2;
1509 while (__t->__next_ != nullptr &&
1510 __comp(__t->__next_->__value_, __f1->__value_))
1511 __t = __t->__next_;
1513 __f2 = __t->__next_;
1514 __t->__next_ = __f1;
[all …]
Drandom1997 _UIntType __t;
1998 __is >> __t;
2000 __x.__x_ = __t;
2013 _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
2055 _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
2074 static_assert(__t <= __w, "mersenne_twister_engine invalid parameters");
2097 static _LIBCPP_CONSTEXPR const size_t tempering_t = __t;
2221 _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
2223 …mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f…
2227 _UIntType __b, size_t __t, _UIntType __c, size_t __l, _UIntType __f>
[all …]
Dalgorithm2219 typename iterator_traits<_InputIterator>::value_type __t(*__first);
2220 *__result = __t;
2224 if (!__pred(__t, *__first))
2226 __t = *__first;
2227 *__result = __t;
2407 _Integral __t = __x % __y;
2409 __y = __t;
2431 value_type __t(_VSTD::move(*--__p));
2444 *__p1 = _VSTD::move(__t);
2579 min(initializer_list<_Tp> __t, _Compare __comp)
[all …]
D__bit_reference89 bool __t = __x;
91 __y = __t;
99 bool __t = __x;
101 __y = __t;
109 bool __t = __x;
111 __y = __t;
119 bool __t = __x;
121 __y = __t;
1181 __bit_iterator __t(*this);
1182 __t += __n;
[all …]
/external/clang/test/CodeGen/
Dmips-constraint-regs.c14 int __t; in main() local
17 : "=c" (__t) in main()
/external/clang/www/
Dlibstdc++4.4-clang0x.patch28 - forward(typename std::identity<_Tp>::type&& __t)
29 + forward(typename std::remove_reference<_Tp>::type& __t)
31 + { return static_cast<_Tp&&>(__t); }
33 { return __t; }
38 + forward(typename std::remove_reference<_Tp>::type&& __t)
44 + return static_cast<_Tp&&>(__t);
46 + return __t;
52 move(_Tp&& __t)
54 + { return static_cast<typename std::remove_reference<_Tp>::type&&>(__t); }
56 { return __t; }
[all …]
/external/stlport/stlport/stl/debug/
D_deque.h240 void push_back(const value_type& __t = _Tp()) {
242 void push_back(const value_type& __t) {
245 _M_non_dbg_impl.push_back(__t);
256 void push_front(const value_type& __t = _Tp()) {
258 void push_front(const value_type& __t) {
261 _M_non_dbg_impl.push_front(__t);
/external/blktrace/
Dblkparse.c801 struct trace *__t; in trace_rb_insert() local
806 __t = rb_entry(parent, struct trace, rb_node); in trace_rb_insert()
808 if (t->bit->time < __t->bit->time) in trace_rb_insert()
810 else if (t->bit->time > __t->bit->time) in trace_rb_insert()
812 else if (t->bit->device < __t->bit->device) in trace_rb_insert()
814 else if (t->bit->device > __t->bit->device) in trace_rb_insert()
816 else if (t->bit->sequence < __t->bit->sequence) in trace_rb_insert()
861 struct trace *__t; in trace_rb_find() local
864 __t = rb_entry(n, struct trace, rb_node); in trace_rb_find()
867 if (device < __t->bit->device) in trace_rb_find()
[all …]
/external/stlport/stlport/stl/pointers/
D_deque.h267 void push_back(const value_type& __t = _STLP_DEFAULT_CONSTRUCTED(value_type))
269 void push_back(const value_type& __t)
271 { _M_impl.push_back(cast_traits::to_storage_type_cref(__t)); }
274 void push_front(const value_type& __t = _STLP_DEFAULT_CONSTRUCTED(value_type))
276 void push_front(const value_type& __t)
278 { _M_impl.push_front(cast_traits::to_storage_type_cref(__t)); }

123