/ndk/sources/cxx-stl/llvm-libc++/src/support/solaris/ |
D | xlocale.c | 21 size_t __mb_cur_max(locale_t __l) { in __mb_cur_max() argument 22 FIX_LOCALE(__l); in __mb_cur_max() 23 return (__l->lc_ctype->cmapp->cm_mb_cur_max); in __mb_cur_max() 26 wint_t btowc_l(int __c, locale_t __l) { in btowc_l() argument 27 FIX_LOCALE(__l); in btowc_l() 28 return __l->lc_ctype->cmapp->core.user_api->btowc(__l->lc_ctype->cmapp, __c); in btowc_l() 31 int wctob_l(wint_t __c, locale_t __l) { in wctob_l() argument 32 FIX_LOCALE(__l); in wctob_l() 33 return __l->lc_ctype->cmapp->core.user_api->wctob(__l->lc_ctype->cmapp, __c); in wctob_l() 36 size_t wcrtomb_l(char *__s, wchar_t __wc, mbstate_t *__ps, locale_t __l) { in wcrtomb_l() argument [all …]
|
/ndk/sources/cxx-stl/llvm-libc++/include/support/solaris/ |
D | xlocale.h | 32 wint_t btowc_l(int __c, locale_t __l); 34 int wctob_l(wint_t __c, locale_t __l); 36 size_t wcrtomb_l(char *__s, wchar_t __wc, mbstate_t *__ps, locale_t __l); 39 mbstate_t *__ps, locale_t __l); 41 int mbtowc_l(wchar_t *__pwc, const char *__pmb, size_t __max, locale_t __l); 43 size_t mbrlen_l(const char *__s, size_t __n, mbstate_t *__ps, locale_t __l); 45 struct lconv *localeconv_l(locale_t __l); 48 mbstate_t *__ps, locale_t __l); 50 int sprintf_l(char *__s, locale_t __l, const char *__format, ...); 52 int snprintf_l(char *__s, size_t __n, locale_t __l, const char *__format, ...); [all …]
|
/ndk/sources/cxx-stl/stlport/stlport/stl/ |
D | _hash_map.h | 105 hash_map(_InputIterator __f, _InputIterator __l) in _STLP_CREATE_HASH_ITERATOR_TRAITS() 107 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS() 109 hash_map(_InputIterator __f, _InputIterator __l, size_type __n) in _STLP_CREATE_HASH_ITERATOR_TRAITS() 111 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS() 113 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, in _STLP_CREATE_HASH_ITERATOR_TRAITS() 116 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS() 119 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, in _STLP_CREATE_HASH_ITERATOR_TRAITS() 122 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS() 125 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, in _STLP_CREATE_HASH_ITERATOR_TRAITS() 129 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS() [all …]
|
D | _hash_set.h | 107 hash_set(_InputIterator __f, _InputIterator __l) in _STLP_CREATE_HASH_ITERATOR_TRAITS() 109 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS() 111 hash_set(_InputIterator __f, _InputIterator __l, size_type __n) in _STLP_CREATE_HASH_ITERATOR_TRAITS() 113 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS() 115 hash_set(_InputIterator __f, _InputIterator __l, size_type __n, in _STLP_CREATE_HASH_ITERATOR_TRAITS() 118 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS() 120 hash_set(_InputIterator __f, _InputIterator __l, size_type __n, in _STLP_CREATE_HASH_ITERATOR_TRAITS() 124 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS() 127 hash_set(_InputIterator __f, _InputIterator __l, size_type __n, in _STLP_CREATE_HASH_ITERATOR_TRAITS() 130 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS() [all …]
|
D | _string_workaround.h | 82 basic_string(_InputIterator __f, _InputIterator __l, in basic_string() argument 86 _M_initialize_dispatch(__f, __l, _Integral()); in basic_string() 90 basic_string(_InputIterator __f, _InputIterator __l) in basic_string() argument 93 _M_initialize_dispatch(__f, __l, _Integral()); in basic_string() 114 void _M_range_initialize(_InputIter __f, _InputIter __l, in _M_range_initialize() argument 118 _M_appendT(__f, __l, __tag); in _M_range_initialize() 122 void _M_range_initialize(_ForwardIter __f, _ForwardIter __l, in _M_range_initialize() argument 124 difference_type __n = _STLP_STD::distance(__f, __l); in _M_range_initialize() 126 this->_M_finish = uninitialized_copy(__f, __l, this->_M_Start()); in _M_range_initialize() 131 void _M_range_initializeT(_InputIter __f, _InputIter __l) { in _M_range_initializeT() argument [all …]
|
D | _unordered_set.h | 89 unordered_set(_InputIterator __f, _InputIterator __l, in _STLP_CREATE_HASH_ITERATOR_TRAITS() 94 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS() 96 unordered_set(const value_type* __f, const value_type* __l, in _STLP_CREATE_HASH_ITERATOR_TRAITS() 101 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS() 103 unordered_set(const_iterator __f, const_iterator __l, in _STLP_CREATE_HASH_ITERATOR_TRAITS() 108 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS() 133 void insert(_InputIterator __f, _InputIterator __l) in _STLP_CREATE_HASH_ITERATOR_TRAITS() 135 void insert(const_iterator __f, const_iterator __l) in _STLP_CREATE_HASH_ITERATOR_TRAITS() 136 {_M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS() 137 void insert(const value_type* __f, const value_type* __l) in _STLP_CREATE_HASH_ITERATOR_TRAITS() [all …]
|
D | _unordered_map.h | 95 unordered_map(_InputIterator __f, _InputIterator __l, in _STLP_CREATE_HASH_ITERATOR_TRAITS() 100 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS() 102 unordered_map(const value_type* __f, const value_type* __l, in _STLP_CREATE_HASH_ITERATOR_TRAITS() 107 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS() 109 unordered_map(const_iterator __f, const_iterator __l, in _STLP_CREATE_HASH_ITERATOR_TRAITS() 114 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS() 139 void insert(_InputIterator __f, _InputIterator __l) in _STLP_CREATE_HASH_ITERATOR_TRAITS() 141 void insert(const value_type* __f, const value_type* __l) in _STLP_CREATE_HASH_ITERATOR_TRAITS() 142 { _M_ht.insert_unique(__f,__l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS() 143 void insert(const_iterator __f, const_iterator __l) in _STLP_CREATE_HASH_ITERATOR_TRAITS() [all …]
|
D | _string.h | 261 basic_string(_InputIterator __f, _InputIterator __l, in basic_string() argument 265 _M_initialize_dispatch(__f, __l, _Integral()); in basic_string() 269 basic_string(_InputIterator __f, _InputIterator __l) in basic_string() argument 272 _M_initialize_dispatch(__f, __l, _Integral()); in basic_string() 277 basic_string(const _CharT* __f, const _CharT* __l, in basic_string() argument 280 _STLP_FIX_LITERAL_BUG(__f) _STLP_FIX_LITERAL_BUG(__l) in basic_string() 281 _M_range_initialize(__f, __l); in basic_string() 284 basic_string(const _CharT* __f, const _CharT* __l) in basic_string() argument 286 _STLP_FIX_LITERAL_BUG(__f) _STLP_FIX_LITERAL_BUG(__l) in basic_string() 287 _M_range_initialize(__f, __l); in basic_string() [all …]
|
D | _hashtable.h | 425 void insert_unique(_InputIterator __f, _InputIterator __l) 426 { insert_unique(__f, __l, _STLP_ITERATOR_CATEGORY(__f, _InputIterator)); } 429 void insert_equal(_InputIterator __f, _InputIterator __l) 430 { insert_equal(__f, __l, _STLP_ITERATOR_CATEGORY(__f, _InputIterator)); } 433 void insert_unique(_InputIterator __f, _InputIterator __l, 435 for ( ; __f != __l; ++__f) 440 void insert_equal(_InputIterator __f, _InputIterator __l, 442 for ( ; __f != __l; ++__f) 447 void insert_unique(_ForwardIterator __f, _ForwardIterator __l, 449 size_type __n = _STLP_STD::distance(__f, __l); [all …]
|
D | _rope.c | 321 _RopeLeaf* __l = __STATIC_CAST(_RopeLeaf*, this); in _M_free_tree() local 322 _STLP_STD::_Destroy(__l); // ->_Rope_RopeLeaf<_CharT,_Alloc>::~_Rope_RopeLeaf(); in _M_free_tree() 324 _RopeLeaf).deallocate(__l, 1); in _M_free_tree() 663 _RopeLeaf* __l = __STATIC_CAST(_RopeLeaf*, __base); in _S_substring() local 669 const _CharT* __section = __l->_M_data + __start; in _S_substring() 818 _RopeLeaf* __l = __STATIC_CAST(_RopeLeaf*, __r); in _S_apply_to_pieces() local 819 return __c(__l->_M_data + __begin, __end - __begin); in _S_apply_to_pieces() 931 _RopeLeaf* __l = __STATIC_CAST(_RopeLeaf*, __r); in _S_flatten() local 932 return _STLP_PRIV __ucopy_n(__l->_M_data, __l->_M_size._M_data, __buffer).second; in _S_flatten() 1147 _RopeLeaf* __l = (_RopeLeaf*)__r; in _S_fetch() local [all …]
|
D | _string.c | 64 _Not_within_traits(const _CharT* __f, const _CharT* __l) in _Not_within_traits() 65 : _M_first(__f), _M_last(__l) {} in _Not_within_traits() 242 basic_string<_CharT,_Traits,_Alloc>::_M_assign(const _CharT* __f, const _CharT* __l) { in _M_assign() argument 243 ptrdiff_t __n = __l - __f; in _M_assign() 250 _M_append(__f + size(), __l); in _M_assign() 390 const _CharT* __f, const _CharT* __l, in _M_replace() argument 392 const ptrdiff_t __n = __l - __f; in _M_replace() 395 if (!__self_ref || __l < __first || __f >= __last) in _M_replace() 396 _M_copy(__f, __l, __first); in _M_replace() 398 _M_move(__f, __l, __first); in _M_replace() [all …]
|
D | _threads.h | 66 # define __add_and_fetch(__l,__v) add_then_test((unsigned long*)__l,__v) argument 67 # define __test_and_set(__l,__v) test_and_set(__l,__v) argument
|
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
D | _debug.c | 408 __stl_debug_engine<_Dummy>::_IndexedError(int __error_ind, const char* __f, int __l) { in _IndexedError() argument 410 __f, __l, _Message_table[__error_ind]); in _IndexedError() 415 …bug_engine<_Dummy>::_VerboseAssert(const char* __expr, int __error_ind, const char* __f, int __l) { in _VerboseAssert() argument 417 __f, __l, _Message_table[__error_ind], __f, __l, __expr); in _VerboseAssert() 423 __stl_debug_engine<_Dummy>::_Assert(const char* __expr, const char* __f, int __l) { in _Assert() argument 424 __stl_debug_message(_Message_table[_StlFormat_ASSERTION_FAILURE],__f, __l, __expr); in _Assert() 451 __stl_debug_engine<_Dummy>::_Invalidate_all(__owned_list* __l) { in _Invalidate_all() argument 452 _STLP_ACQUIRE_LOCK(__l->_M_lock); in _Invalidate_all() 453 _Stamp_all(__l, 0); in _Invalidate_all() 454 __l->_M_node._M_next =0; in _Invalidate_all() [all …]
|
D | _string.h | 82 void _Invalidate_iterators(const iterator& __f, const iterator& __l) in _Invalidate_iterators() argument 83 { _STLP_PRIV __invalidate_range(&_M_iter_list, __f, __l); } in _Invalidate_iterators() 133 basic_string(const _CharT* __f, const _CharT* __l, 135 : _ConstructCheck(__f, __l), in _ConstructCheck() argument 136 _M_non_dbg_impl(__f, __l, __a), _M_iter_list(&_M_non_dbg_impl) { in _ConstructCheck() 138 basic_string(const_iterator __f, const_iterator __l, 140 : _ConstructCheck(__f, __l), in _ConstructCheck() argument 141 _M_non_dbg_impl(__f._M_iterator, __l._M_iterator, __a), _M_iter_list(&_M_non_dbg_impl) { in _ConstructCheck() 145 basic_string(_InputIterator __f, _InputIterator __l, in basic_string() argument 147 : _ConstructCheck(__f, __l), in basic_string() [all …]
|
D | _hashtable.h | 227 void insert_unique(_InputIterator __f, _InputIterator __l) { in insert_unique() argument 228 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__f, __l)) in insert_unique() 229 _M_non_dbg_impl.insert_unique(_STLP_PRIV _Non_Dbg_iter(__f), _STLP_PRIV _Non_Dbg_iter(__l)); in insert_unique() 233 void insert_equal(_InputIterator __f, _InputIterator __l){ in insert_equal() argument 234 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__f, __l)) in insert_equal() 235 _M_non_dbg_impl.insert_equal(_STLP_PRIV _Non_Dbg_iter(__f), _STLP_PRIV _Non_Dbg_iter(__l)); in insert_equal() 239 void insert_unique(const value_type* __f, const value_type* __l) { in insert_unique() argument 240 _STLP_DEBUG_CHECK(_STLP_PRIV __check_ptr_range(__f, __l)) in insert_unique() 241 _M_non_dbg_impl.insert_unique(__f, __l); in insert_unique() 244 void insert_equal(const value_type* __f, const value_type* __l) { in insert_equal() argument [all …]
|
D | _iterator.h | 388 __construct_checker(const _InputIter& __f, const _InputIter& __l) { in __construct_checker() argument 390 _M_check_dispatch(__f, __l, _Integral()); in __construct_checker() 397 …void _M_check_dispatch(const _InputIter& __f, const _InputIter& __l, const __false_type& /*IsInteg… in _M_check_dispatch() argument 398 _STLP_DEBUG_CHECK(__check_range(__f,__l)) in _M_check_dispatch() 403 __construct_checker(const value_type* __f, const value_type* __l) { in __construct_checker() argument 404 _STLP_DEBUG_CHECK(__check_ptr_range(__f,__l)) in __construct_checker() 408 __construct_checker(const _IteType& __f, const _IteType& __l) { in __construct_checker() argument 409 _STLP_DEBUG_CHECK(__check_range(__f,__l)) in __construct_checker()
|
D | _debug.h | 99 static void _STLP_CALL _IndexedError(int __ind, const char* __f, int __l); 104 static void _STLP_CALL _Assert(const char* __expr, const char* __f, int __l); 107 …tic void _STLP_CALL _VerboseAssert(const char* __expr, int __error_ind, const char* __f, int __l);
|
/ndk/sources/cxx-stl/llvm-libc++/include/support/win32/ |
D | locale_win32.h | 55 decltype(MB_CUR_MAX) MB_CUR_MAX_L( locale_t __l ) in decltype() 57 __locale_raii __current( uselocale(__l), uselocale ); in decltype() 90 #define sscanf_l( __s, __l, __f, ...) _sscanf_l( __s, __f, __l, __VA_ARGS__ ) argument 91 #define vsscanf_l( __s, __l, __f, ...) _sscanf_l( __s, __f, __l, __VA_ARGS__ ) argument 92 #define sprintf_l( __s, __l, __f, ... ) _sprintf_l( __s, __f, __l, __VA_ARGS__ ) argument 93 #define snprintf_l( __s, __n, __l, __f, ... ) _snprintf_l( __s, __n, __f, __l, __VA_ARGS__ ) argument 94 #define vsprintf_l( __s, __l, __f, ... ) _vsprintf_l( __s, __f, __l, __VA_ARGS__ ) argument 95 #define vsnprintf_l( __s, __n, __l, __f, ... ) _vsnprintf_l( __s, __n, __f, __l, __VA_ARGS__ ) argument
|
/ndk/sources/cxx-stl/llvm-libc++/include/ |
D | deque | 179 _RAIter __l, 187 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l, 194 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l, 201 _RAIter __l, 209 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l, 216 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l, 223 _RAIter __l, 231 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l, 238 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l, 245 _RAIter __l, [all …]
|
D | list | 528 static void __unlink_nodes(__node_base& __f, __node_base& __l) _NOEXCEPT; 636 // Unlink nodes [__f, __l] 640 __list_imp<_Tp, _Alloc>::__unlink_nodes(__node_base& __f, __node_base& __l) 643 __f.__prev_->__next_ = __l.__next_; 644 __l.__next_->__prev_ = __f.__prev_; 679 __node_pointer __l = static_cast<__node_pointer>(&__end_); 680 __unlink_nodes(*__f, *__l->__prev_); 682 while (__f != __l) 695 if (__i->__ptr_ != __l) 814 list(_InpIter __f, _InpIter __l, [all …]
|
D | forward_list | 568 forward_list(_InputIterator __f, _InputIterator __l, 573 forward_list(_InputIterator __f, _InputIterator __l, 611 assign(_InputIterator __f, _InputIterator __l); 689 insert_after(const_iterator __p, _InputIterator __f, _InputIterator __l); 696 iterator erase_after(const_iterator __f, const_iterator __l); 716 const_iterator __f, const_iterator __l); 721 const_iterator __f, const_iterator __l); 804 forward_list<_Tp, _Alloc>::forward_list(_InputIterator __f, _InputIterator __l, 809 insert_after(cbefore_begin(), __f, __l); 814 forward_list<_Tp, _Alloc>::forward_list(_InputIterator __f, _InputIterator __l, [all …]
|
D | set | 390 set(_InputIterator __f, _InputIterator __l, 394 insert(__f, __l); 399 set(_InputIterator __f, _InputIterator __l, const value_compare& __comp, 403 insert(__f, __l); 543 void insert(_InputIterator __f, _InputIterator __l) 545 for (const_iterator __e = cend(); __f != __l; ++__f) 561 iterator erase(const_iterator __f, const_iterator __l) 562 {return __tree_.erase(__f, __l);} 730 multiset(_InputIterator __f, _InputIterator __l, 734 insert(__f, __l); [all …]
|
D | queue | 438 priority_queue(_InputIter __f, _InputIter __l, 441 priority_queue(_InputIter __f, _InputIter __l, 445 priority_queue(_InputIter __f, _InputIter __l, 525 priority_queue<_Tp, _Container, _Compare>::priority_queue(_InputIter __f, _InputIter __l, 527 : c(__f, __l), 536 priority_queue<_Tp, _Container, _Compare>::priority_queue(_InputIter __f, _InputIter __l, 542 c.insert(c.end(), __f, __l); 551 priority_queue<_Tp, _Container, _Compare>::priority_queue(_InputIter __f, _InputIter __l, 557 c.insert(c.end(), __f, __l);
|
D | locale | 230 __mb_cur_max_l(locale_t __l) 232 return MB_CUR_MAX_L(__l); 236 decltype(MB_CUR_MAX) __mb_cur_max_l(locale_t __l) 238 __locale_raii __current(uselocale(__l), uselocale); 244 wint_t __btowc_l(int __c, locale_t __l) 247 return btowc_l(__c, __l); 249 __locale_raii __current(uselocale(__l), uselocale); 255 int __wctob_l(wint_t __c, locale_t __l) 258 return wctob_l(__c, __l); 260 __locale_raii __current(uselocale(__l), uselocale); [all …]
|
/ndk/sources/cxx-stl/llvm-libc++/src/ |
D | locale.cpp | 626 __l(newlocale(LC_ALL_MASK, n, 0)) in collate_byname() 629 if (__l == 0) in collate_byname() 637 __l(newlocale(LC_ALL_MASK, name.c_str(), 0)) in collate_byname() 640 if (__l == 0) in collate_byname() 648 freelocale(__l); in ~collate_byname() 657 int r = strcoll_l(lhs.c_str(), rhs.c_str(), __l); in do_compare() 669 string_type out(strxfrm_l(0, in.c_str(), 0, __l), char()); in do_transform() 670 strxfrm_l(const_cast<char*>(out.c_str()), in.c_str(), out.size()+1, __l); in do_transform() 678 __l(newlocale(LC_ALL_MASK, n, 0)) in collate_byname() 681 if (__l == 0) in collate_byname() [all …]
|