Home
last modified time | relevance | path

Searched defs:__l (Results 1 – 10 of 10) sorted by relevance

/external/stlport/stlport/stl/debug/
D_debug.c408 __stl_debug_engine<_Dummy>::_IndexedError(int __error_ind, const char* __f, int __l) { in _IndexedError()
415 …bug_engine<_Dummy>::_VerboseAssert(const char* __expr, int __error_ind, const char* __f, int __l) { in _VerboseAssert()
423 __stl_debug_engine<_Dummy>::_Assert(const char* __expr, const char* __f, int __l) { in _Assert()
451 __stl_debug_engine<_Dummy>::_Invalidate_all(__owned_list* __l) { in _Invalidate_all()
461 __stl_debug_engine<_Dummy>::_Stamp_all(__owned_list* __l, __owned_list* __o) { in _Stamp_all()
474 __stl_debug_engine<_Dummy>::_Verify(const __owned_list* __l) { in _Verify()
534 __stl_debug_engine<_Dummy>::_M_detach(__owned_list* __l, __owned_link* __c_node) { in _M_detach()
558 __stl_debug_engine<_Dummy>::_M_attach(__owned_list* __l, __owned_link* __c_node) { in _M_attach()
573 __stl_debug_engine<_Dummy>::_Get_container_ptr(const __owned_link* __l) { in _Get_container_ptr()
601 __stl_debug_engine<_Dummy>::_Check_if_owner( const __owned_list * __l, const __owned_link& __it) { in _Check_if_owner()
[all …]
D_string.h82 void _Invalidate_iterators(const iterator& __f, const iterator& __l) in _Invalidate_iterators()
135 : _ConstructCheck(__f, __l), in _ConstructCheck() argument
140 : _ConstructCheck(__f, __l), in _ConstructCheck() argument
145 basic_string(_InputIterator __f, _InputIterator __l, in basic_string()
152 basic_string(_InputIterator __f, _InputIterator __l) in basic_string()
255 _Self& append(const _CharT* __f, const _CharT* __l) { in append()
264 _Self& append(const_iterator __f, const_iterator __l) { in append()
373 _Self& assign(const _CharT* __f, const _CharT* __l) { in assign()
380 _Self& assign(const_iterator __f, const_iterator __l) { in assign()
455 void insert(iterator __p, const _CharT* __f, const _CharT* __l) { in insert()
[all …]
D_hashtable.h227 void insert_unique(_InputIterator __f, _InputIterator __l) { in insert_unique()
233 void insert_equal(_InputIterator __f, _InputIterator __l){ in insert_equal()
239 void insert_unique(const value_type* __f, const value_type* __l) { in insert_unique()
244 void insert_equal(const value_type* __f, const value_type* __l) { in insert_equal()
249 void insert_unique(const_iterator __f, const_iterator __l) { in insert_unique()
254 void insert_equal(const_iterator __f, const_iterator __l) { in insert_equal()
D_iterator.h388 __construct_checker(const _InputIter& __f, const _InputIter& __l) { in __construct_checker()
397 …void _M_check_dispatch(const _InputIter& __f, const _InputIter& __l, const __false_type& /*IsInteg… in _M_check_dispatch()
403 __construct_checker(const value_type* __f, const value_type* __l) { in __construct_checker()
408 __construct_checker(const _IteType& __f, const _IteType& __l) { in __construct_checker()
/external/stlport/stlport/stl/
D_string_workaround.h82 basic_string(_InputIterator __f, _InputIterator __l, in basic_string()
90 basic_string(_InputIterator __f, _InputIterator __l) in basic_string()
114 void _M_range_initialize(_InputIter __f, _InputIter __l, in _M_range_initialize()
122 void _M_range_initialize(_ForwardIter __f, _ForwardIter __l, in _M_range_initialize()
131 void _M_range_initializeT(_InputIter __f, _InputIter __l) { in _M_range_initializeT()
143 void _M_initialize_dispatch(_InputIter __f, _InputIter __l, const __false_type& /*_Integral*/) { in _M_initialize_dispatch()
198 _Self& append(const _CharT* __f, const _CharT* __l) { in append()
244 _Self& _M_append_dispatch(_InputIter __f, _InputIter __l, const __false_type& /*Integral*/) in _M_append_dispatch()
283 _Self& _M_assign_dispatch(_InputIter __f, _InputIter __l, const __false_type& /*_Integral*/) { in _M_assign_dispatch()
311 _Self& assign(const _CharT* __f, const _CharT* __l) { in assign()
[all …]
D_string.h261 basic_string(_InputIterator __f, _InputIterator __l, in basic_string()
269 basic_string(_InputIterator __f, _InputIterator __l) in basic_string()
277 basic_string(const _CharT* __f, const _CharT* __l, in basic_string()
284 basic_string(const _CharT* __f, const _CharT* __l) in basic_string()
313 void _M_range_initialize(_InputIter __f, _InputIter __l, in _M_range_initialize()
321 void _M_range_initialize(_ForwardIter __f, _ForwardIter __l, in _M_range_initialize()
330 void _M_range_initializeT(_InputIter __f, _InputIter __l) { in _M_range_initializeT()
342 void _M_initialize_dispatch(_InputIter __f, _InputIter __l, const __false_type& /*_Integral*/) { in _M_initialize_dispatch()
376 void _M_range_initialize(const _CharT* __f, const _CharT* __l) { in _M_range_initialize()
496 _Self& _M_append_dispatch(_InputIter __f, _InputIter __l, const __false_type& /*Integral*/) in _M_append_dispatch()
[all …]
D_rope.c321 _RopeLeaf* __l = __STATIC_CAST(_RopeLeaf*, this); in _M_free_tree() local
663 _RopeLeaf* __l = __STATIC_CAST(_RopeLeaf*, __base); in _S_substring() local
818 _RopeLeaf* __l = __STATIC_CAST(_RopeLeaf*, __r); in _S_apply_to_pieces() local
931 _RopeLeaf* __l = __STATIC_CAST(_RopeLeaf*, __r); in _S_flatten() local
1147 _RopeLeaf* __l = (_RopeLeaf*)__r; in _S_fetch() local
1199 _RopeLeaf* __l = (_RopeLeaf*)__r; in _S_fetch_ptr() local
1237 const _RopeLeaf* __l = __STATIC_CAST(const _RopeLeaf*, __left); in _S_compare() local
D_string.c242 basic_string<_CharT,_Traits,_Alloc>::_M_assign(const _CharT* __f, const _CharT* __l) { in _M_assign()
390 const _CharT* __f, const _CharT* __l, in _M_replace()
D_threads.h66 # 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
D_algo.c450 _Distance __l = __n - __k; in __rotate_aux() local