Searched refs:__l (Results 1 - 21 of 21) sorted by relevance

/external/libcxx/src/support/solaris/
H A Dxlocale.c29 size_t __mb_cur_max(locale_t __l) { argument
30 FIX_LOCALE(__l);
31 return (__l->lc_ctype->cmapp->cm_mb_cur_max);
34 wint_t btowc_l(int __c, locale_t __l) { argument
35 FIX_LOCALE(__l);
36 return __l->lc_ctype->cmapp->core.user_api->btowc(__l->lc_ctype->cmapp, __c);
39 int wctob_l(wint_t __c, locale_t __l) { argument
40 FIX_LOCALE(__l);
41 return __l
44 wcrtomb_l(char *__s, wchar_t __wc, mbstate_t *__ps, locale_t __l) argument
50 mbrtowc_l(wchar_t *__pwc, const char *__s, size_t __n, mbstate_t *__ps, locale_t __l) argument
57 mbtowc_l(wchar_t *__pwc, const char *__pmb, size_t __max, locale_t __l) argument
63 mbrlen_l(const char *__s, size_t __n, mbstate_t *__ps, locale_t __l) argument
69 localeconv_l(locale_t __l) argument
74 mbsrtowcs_l(wchar_t *__dest, const char **__src, size_t __len, mbstate_t *__ps, locale_t __l) argument
81 wcscoll_l(const wchar_t *__s1, const wchar_t *__s2, locale_t __l) argument
87 strcoll_l(const char *__s1, const char *__s2, locale_t __l) argument
93 strxfrm_l(char *__s1, const char *__s2, size_t __n, locale_t __l) argument
98 strftime_l(char *__s, size_t __size, const char *__fmt, const struct tm *__tm, locale_t __l) argument
105 wcsxfrm_l(wchar_t *__ws1, const wchar_t *__ws2, size_t __n, locale_t __l) argument
141 toupper_l(int __c, locale_t __l) argument
146 tolower_l(int __c, locale_t __l) argument
151 towupper_l(wint_t __c, locale_t __l) argument
155 towlower_l(wint_t __c, locale_t __l) argument
164 sprintf_l(char *__s, locale_t __l, const char *__format, ...) argument
172 snprintf_l(char *__s, size_t __n, locale_t __l, const char *__format, ...) argument
181 asprintf_l(char **__s, locale_t __l, const char *__format, ...) argument
190 sscanf_l(const char *__s, locale_t __l, const char *__format, ...) argument
[all...]
/external/libcxx/include/support/solaris/
H A Dxlocale.h41 wint_t btowc_l(int __c, locale_t __l);
43 int wctob_l(wint_t __c, locale_t __l);
45 size_t wcrtomb_l(char *__s, wchar_t __wc, mbstate_t *__ps, locale_t __l);
48 mbstate_t *__ps, locale_t __l);
50 int mbtowc_l(wchar_t *__pwc, const char *__pmb, size_t __max, locale_t __l);
52 size_t mbrlen_l(const char *__s, size_t __n, mbstate_t *__ps, locale_t __l);
54 struct lconv *localeconv_l(locale_t __l);
57 mbstate_t *__ps, locale_t __l);
59 int sprintf_l(char *__s, locale_t __l, const char *__format, ...);
61 int snprintf_l(char *__s, size_t __n, locale_t __l, cons
[all...]
/external/libcxx/include/support/win32/
H A Dlocale_win32.h56 decltype(MB_CUR_MAX) MB_CUR_MAX_L( locale_t __l )
58 __locale_raii __current( uselocale(__l), uselocale );
103 #define sscanf_l( __s, __l, __f, ...) _sscanf_l( __s, __f, __l, __VA_ARGS__ )
104 #define vsscanf_l( __s, __l, __f, ...) _sscanf_l( __s, __f, __l, __VA_ARGS__ )
105 #define sprintf_l( __s, __l, __f, ... ) _sprintf_l( __s, __f, __l, __VA_ARGS__ )
106 #define vsprintf_l( __s, __l, __f, ... ) _vsprintf_l( __s, __f, __l, __VA_ARGS_
[all...]
/external/stlport/stlport/stl/debug/
H A D_debug.c408 __stl_debug_engine<_Dummy>::_IndexedError(int __error_ind, const char* __f, int __l) { argument
410 __f, __l, _Message_table[__error_ind]);
415 __stl_debug_engine<_Dummy>::_VerboseAssert(const char* __expr, int __error_ind, const char* __f, int __l) { argument
417 __f, __l, _Message_table[__error_ind], __f, __l, __expr);
423 __stl_debug_engine<_Dummy>::_Assert(const char* __expr, const char* __f, int __l) { argument
424 __stl_debug_message(_Message_table[_StlFormat_ASSERTION_FAILURE],__f, __l, __expr);
451 __stl_debug_engine<_Dummy>::_Invalidate_all(__owned_list* __l) { argument
452 _STLP_ACQUIRE_LOCK(__l->_M_lock);
453 _Stamp_all(__l,
461 _Stamp_all(__owned_list* __l, __owned_list* __o) argument
474 _Verify(const __owned_list* __l) argument
534 _M_detach(__owned_list* __l, __owned_link* __c_node) argument
558 _M_attach(__owned_list* __l, __owned_link* __c_node) argument
573 _Get_container_ptr(const __owned_link* __l) argument
601 _Check_if_owner( const __owned_list * __l, const __owned_link& __it) argument
610 _Check_if_not_owner( const __owned_list * __l, const __owned_link& __it) argument
[all...]
H A D_string.h82 void _Invalidate_iterators(const iterator& __f, const iterator& __l) argument
83 { _STLP_PRIV __invalidate_range(&_M_iter_list, __f, __l); }
133 basic_string(const _CharT* __f, const _CharT* __l, argument
135 : _ConstructCheck(__f, __l),
136 _M_non_dbg_impl(__f, __l, __a), _M_iter_list(&_M_non_dbg_impl) {
138 basic_string(const_iterator __f, const_iterator __l, argument
140 : _ConstructCheck(__f, __l),
141 _M_non_dbg_impl(__f._M_iterator, __l._M_iterator, __a), _M_iter_list(&_M_non_dbg_impl) {
145 basic_string(_InputIterator __f, _InputIterator __l, argument
147 : _ConstructCheck(__f, __l),
152 basic_string(_InputIterator __f, _InputIterator __l) argument
255 append(const _CharT* __f, const _CharT* __l) argument
264 append(const_iterator __f, const_iterator __l) argument
373 assign(const _CharT* __f, const _CharT* __l) argument
380 assign(const_iterator __f, const_iterator __l) argument
455 insert(iterator __p, const _CharT* __f, const _CharT* __l) argument
468 insert(iterator __p, const_iterator __f, const_iterator __l) argument
478 insert(iterator __p, iterator __f, iterator __l) argument
504 erase(iterator __f, iterator __l) argument
555 replace(iterator __f, iterator __l, const _Self& __s) argument
563 replace(iterator __f, iterator __l, const _CharT* __s, size_type __n) argument
573 replace(iterator __f, iterator __l, const _CharT* __s) argument
583 replace(iterator __f, iterator __l, size_type __n, _CharT __c) argument
593 replace(iterator __first, iterator __last, _InputIter __f, _InputIter __l) argument
607 replace(iterator __first, iterator __last, const _CharT* __f, const _CharT* __l) argument
620 replace(iterator __first, iterator __last, const_iterator __f, const_iterator __l) argument
630 replace(iterator __first, iterator __last, iterator __f, iterator __l) argument
[all...]
H A D_hashtable.h227 void insert_unique(_InputIterator __f, _InputIterator __l) { argument
228 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__f, __l))
229 _M_non_dbg_impl.insert_unique(_STLP_PRIV _Non_Dbg_iter(__f), _STLP_PRIV _Non_Dbg_iter(__l));
233 void insert_equal(_InputIterator __f, _InputIterator __l){ argument
234 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__f, __l))
235 _M_non_dbg_impl.insert_equal(_STLP_PRIV _Non_Dbg_iter(__f), _STLP_PRIV _Non_Dbg_iter(__l));
239 void insert_unique(const value_type* __f, const value_type* __l) { argument
240 _STLP_DEBUG_CHECK(_STLP_PRIV __check_ptr_range(__f, __l))
241 _M_non_dbg_impl.insert_unique(__f, __l);
244 void insert_equal(const value_type* __f, const value_type* __l) { argument
249 insert_unique(const_iterator __f, const_iterator __l) argument
254 insert_equal(const_iterator __f, const_iterator __l) argument
[all...]
H A D_iterator.h388 __construct_checker(const _InputIter& __f, const _InputIter& __l) { argument
390 _M_check_dispatch(__f, __l, _Integral());
397 void _M_check_dispatch(const _InputIter& __f, const _InputIter& __l, const __false_type& /*IsIntegral*/) { argument
398 _STLP_DEBUG_CHECK(__check_range(__f,__l))
403 __construct_checker(const value_type* __f, const value_type* __l) { argument
404 _STLP_DEBUG_CHECK(__check_ptr_range(__f,__l))
408 __construct_checker(const _IteType& __f, const _IteType& __l) { argument
409 _STLP_DEBUG_CHECK(__check_range(__f,__l))
H A D_debug.h99 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 static void _STLP_CALL _VerboseAssert(const char* __expr, int __error_ind, const char* __f, int __l);
/external/stlport/stlport/stl/
H A D_hash_map.h105 hash_map(_InputIterator __f, _InputIterator __l) argument
107 { _M_ht.insert_unique(__f, __l); }
109 hash_map(_InputIterator __f, _InputIterator __l, size_type __n) argument
111 { _M_ht.insert_unique(__f, __l); }
113 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, argument
116 { _M_ht.insert_unique(__f, __l); }
119 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, argument
122 { _M_ht.insert_unique(__f, __l); }
125 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, argument
129 { _M_ht.insert_unique(__f, __l); }
132 hash_map(const value_type* __f, const value_type* __l) argument
135 hash_map(const value_type* __f, const value_type* __l, size_type __n) argument
138 hash_map(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf) argument
142 hash_map(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument
148 hash_map(const_iterator __f, const_iterator __l) argument
151 hash_map(const_iterator __f, const_iterator __l, size_type __n) argument
154 hash_map(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf) argument
158 hash_map(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument
183 insert(_InputIterator __f, _InputIterator __l) argument
186 insert(const value_type* __f, const value_type* __l) argument
188 insert(const_iterator __f, const_iterator __l) argument
220 erase(iterator __f, iterator __l) argument
296 hash_multimap(_InputIterator __f, _InputIterator __l) argument
300 hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n) argument
304 hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf) argument
310 hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf, const key_equal& __eql) argument
316 hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL) argument
323 hash_multimap(const value_type* __f, const value_type* __l) argument
326 hash_multimap(const value_type* __f, const value_type* __l, size_type __n) argument
329 hash_multimap(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf) argument
333 hash_multimap(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument
339 hash_multimap(const_iterator __f, const_iterator __l) argument
342 hash_multimap(const_iterator __f, const_iterator __l, size_type __n) argument
345 hash_multimap(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf) argument
349 hash_multimap(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument
375 insert(_InputIterator __f, _InputIterator __l) argument
378 insert(const value_type* __f, const value_type* __l) argument
381 insert(const_iterator __f, const_iterator __l) argument
405 erase(iterator __f, iterator __l) argument
[all...]
H A D_hash_set.h107 hash_set(_InputIterator __f, _InputIterator __l) argument
109 { _M_ht.insert_unique(__f, __l); }
111 hash_set(_InputIterator __f, _InputIterator __l, size_type __n) argument
113 { _M_ht.insert_unique(__f, __l); }
115 hash_set(_InputIterator __f, _InputIterator __l, size_type __n, argument
118 { _M_ht.insert_unique(__f, __l); }
120 hash_set(_InputIterator __f, _InputIterator __l, size_type __n, argument
124 { _M_ht.insert_unique(__f, __l); }
127 hash_set(_InputIterator __f, _InputIterator __l, size_type __n, argument
130 { _M_ht.insert_unique(__f, __l); }
133 hash_set(const value_type* __f, const value_type* __l) argument
136 hash_set(const value_type* __f, const value_type* __l, size_type __n) argument
139 hash_set(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf) argument
143 hash_set(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument
149 hash_set(const_iterator __f, const_iterator __l) argument
152 hash_set(const_iterator __f, const_iterator __l, size_type __n) argument
155 hash_set(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf) argument
159 hash_set(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument
185 insert(_InputIterator __f, _InputIterator __l) argument
214 erase(iterator __f, iterator __l) argument
288 hash_multiset(_InputIterator __f, _InputIterator __l) argument
292 hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n) argument
296 hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf) argument
302 hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL) argument
309 hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf, const key_equal& __eql) argument
315 hash_multiset(const value_type* __f, const value_type* __l) argument
318 hash_multiset(const value_type* __f, const value_type* __l, size_type __n) argument
321 hash_multiset(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf) argument
325 hash_multiset(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument
331 hash_multiset(const_iterator __f, const_iterator __l) argument
334 hash_multiset(const_iterator __f, const_iterator __l, size_type __n) argument
337 hash_multiset(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf) argument
341 hash_multiset(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument
366 insert(_InputIterator __f, _InputIterator __l) argument
369 insert(const value_type* __f, const value_type* __l) argument
371 insert(const_iterator __f, const_iterator __l) argument
396 erase(iterator __f, iterator __l) argument
[all...]
H A D_string_workaround.h82 basic_string(_InputIterator __f, _InputIterator __l, argument
86 _M_initialize_dispatch(__f, __l, _Integral());
90 basic_string(_InputIterator __f, _InputIterator __l) argument
93 _M_initialize_dispatch(__f, __l, _Integral());
114 void _M_range_initialize(_InputIter __f, _InputIter __l, argument
118 _M_appendT(__f, __l, __tag);
122 void _M_range_initialize(_ForwardIter __f, _ForwardIter __l, argument
124 difference_type __n = _STLP_STD::distance(__f, __l);
126 this->_M_finish = uninitialized_copy(__f, __l, this->_M_Start());
131 void _M_range_initializeT(_InputIter __f, _InputIter __l) { argument
143 _M_initialize_dispatch(_InputIter __f, _InputIter __l, const __false_type& ) argument
198 append(const _CharT* __f, const _CharT* __l) argument
244 _M_append_dispatch(_InputIter __f, _InputIter __l, const __false_type& ) argument
283 _M_assign_dispatch(_InputIter __f, _InputIter __l, const __false_type& ) argument
311 assign(const _CharT* __f, const _CharT* __l) argument
362 insert(iterator __p, const _CharT* __f, const _CharT* __l) argument
369 _M_insert(iterator __p, const _CharT* __f, const _CharT* __l, bool __self_ref) argument
448 _M_copyT(const _CharT* __f, const _CharT* __l, _CharT* __res) argument
534 replace(iterator __first, iterator __last, _InputIter __f, _InputIter __l) argument
542 replace(iterator __first, iterator __last, const _CharT* __f, const _CharT* __l) argument
551 _M_replace(iterator __first, iterator __last, const _CharT* __f, const _CharT* __l, bool __self_ref) argument
567 _M_replace_dispatch(iterator __first, iterator __last, _InputIter __f, _InputIter __l, const __false_type& ) argument
[all...]
H A D_unordered_map.h95 unordered_map(_InputIterator __f, _InputIterator __l, argument
100 { _M_ht.insert_unique(__f, __l); }
102 unordered_map(const value_type* __f, const value_type* __l, argument
107 { _M_ht.insert_unique(__f, __l); }
109 unordered_map(const_iterator __f, const_iterator __l, argument
114 { _M_ht.insert_unique(__f, __l); }
139 void insert(_InputIterator __f, _InputIterator __l) argument
141 void insert(const value_type* __f, const value_type* __l)
142 { _M_ht.insert_unique(__f,__l); }
143 void insert(const_iterator __f, const_iterator __l)
172 erase(const_iterator __f, const_iterator __l) argument
263 unordered_multimap(_InputIterator __f, _InputIterator __l, size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
270 unordered_multimap(const value_type* __f, const value_type* __l, size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
277 unordered_multimap(const_iterator __f, const_iterator __l, size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
307 insert(_InputIterator __f, _InputIterator __l) argument
332 erase(const_iterator __f, const_iterator __l) argument
[all...]
H A D_unordered_set.h89 unordered_set(_InputIterator __f, _InputIterator __l, argument
94 { _M_ht.insert_unique(__f, __l); }
96 unordered_set(const value_type* __f, const value_type* __l, argument
101 { _M_ht.insert_unique(__f, __l); }
103 unordered_set(const_iterator __f, const_iterator __l, argument
108 { _M_ht.insert_unique(__f, __l); }
133 void insert(_InputIterator __f, _InputIterator __l) argument
135 void insert(const_iterator __f, const_iterator __l)
136 {_M_ht.insert_unique(__f, __l); }
137 void insert(const value_type* __f, const value_type* __l)
158 erase(const_iterator __f, const_iterator __l) argument
239 unordered_multiset(_InputIterator __f, _InputIterator __l, size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
246 unordered_multiset(const value_type* __f, const value_type* __l, size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
253 unordered_multiset(const_iterator __f, const_iterator __l, size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
283 insert(_InputIterator __f, _InputIterator __l) argument
308 erase(const_iterator __f, const_iterator __l) argument
[all...]
H A D_hashtable.h425 void insert_unique(_InputIterator __f, _InputIterator __l) argument
426 { insert_unique(__f, __l, _STLP_ITERATOR_CATEGORY(__f, _InputIterator)); }
429 void insert_equal(_InputIterator __f, _InputIterator __l) argument
430 { insert_equal(__f, __l, _STLP_ITERATOR_CATEGORY(__f, _InputIterator)); }
433 void insert_unique(_InputIterator __f, _InputIterator __l, argument
435 for ( ; __f != __l; ++__f)
440 void insert_equal(_InputIterator __f, _InputIterator __l, argument
442 for ( ; __f != __l; ++__f)
447 void insert_unique(_ForwardIterator __f, _ForwardIterator __l, argument
449 size_type __n = _STLP_STD::distance(__f, __l);
456 insert_equal(_ForwardIterator __f, _ForwardIterator __l, const forward_iterator_tag &) argument
465 insert_unique(const value_type* __f, const value_type* __l) argument
472 insert_equal(const value_type* __f, const value_type* __l) argument
479 insert_unique(const_iterator __f, const_iterator __l) argument
486 insert_equal(const_iterator __f, const_iterator __l) argument
[all...]
H A D_string.h261 basic_string(_InputIterator __f, _InputIterator __l, argument
265 _M_initialize_dispatch(__f, __l, _Integral());
269 basic_string(_InputIterator __f, _InputIterator __l) argument
272 _M_initialize_dispatch(__f, __l, _Integral());
277 basic_string(const _CharT* __f, const _CharT* __l, argument
280 _STLP_FIX_LITERAL_BUG(__f) _STLP_FIX_LITERAL_BUG(__l)
281 _M_range_initialize(__f, __l);
284 basic_string(const _CharT* __f, const _CharT* __l) argument
286 _STLP_FIX_LITERAL_BUG(__f) _STLP_FIX_LITERAL_BUG(__l)
287 _M_range_initialize(__f, __l);
313 _M_range_initialize(_InputIter __f, _InputIter __l, const input_iterator_tag &__tag) argument
321 _M_range_initialize(_ForwardIter __f, _ForwardIter __l, const forward_iterator_tag &) argument
330 _M_range_initializeT(_InputIter __f, _InputIter __l) argument
342 _M_initialize_dispatch(_InputIter __f, _InputIter __l, const __false_type& ) argument
376 _M_range_initialize(const _CharT* __f, const _CharT* __l) argument
496 _M_append_dispatch(_InputIter __f, _InputIter __l, const __false_type& ) argument
577 _M_assign_dispatch(_InputIter __f, _InputIter __l, const __false_type& ) argument
601 assign(const _CharT* __f, const _CharT* __l) argument
675 _M_copy(const _CharT* __f, const _CharT* __l, _CharT* __res) argument
681 _M_move(const _CharT* __f, const _CharT* __l, _CharT* __res) argument
762 _M_copyT(const _CharT* __f, const _CharT* __l, _CharT* __res) argument
781 insert(iterator __p, const _CharT* __f, const _CharT* __l) argument
901 _M_replace_dispatch(iterator __first, iterator __last, _InputIter __f, _InputIter __l, const __false_type& ) argument
913 replace(iterator __first, iterator __last, _InputIter __f, _InputIter __l) argument
923 replace(iterator __first, iterator __last, const _CharT* __f, const _CharT* __l) argument
[all...]
H A D_string.c64 _Not_within_traits(const _CharT* __f, const _CharT* __l) argument
65 : _M_first(__f), _M_last(__l) {}
242 basic_string<_CharT,_Traits,_Alloc>::_M_assign(const _CharT* __f, const _CharT* __l) { argument
243 ptrdiff_t __n = __l - __f;
250 _M_append(__f + size(), __l);
390 const _CharT* __f, const _CharT* __l,
392 const ptrdiff_t __n = __l - __f;
395 if (!__self_ref || __l < __first || __f >= __last)
396 _M_copy(__f, __l, __first);
398 _M_move(__f, __l, __firs
389 _M_replace(iterator __first, iterator __last, const _CharT* __f, const _CharT* __l, bool __self_ref) argument
[all...]
H A D_rope.c321 _RopeLeaf* __l = __STATIC_CAST(_RopeLeaf*, this); local
322 _STLP_STD::_Destroy(__l); // ->_Rope_RopeLeaf<_CharT,_Alloc>::~_Rope_RopeLeaf();
324 _RopeLeaf).deallocate(__l, 1);
663 _RopeLeaf* __l = __STATIC_CAST(_RopeLeaf*, __base); local
669 const _CharT* __section = __l->_M_data + __start;
818 _RopeLeaf* __l = __STATIC_CAST(_RopeLeaf*, __r); local
819 return __c(__l->_M_data + __begin, __end - __begin);
931 _RopeLeaf* __l = __STATIC_CAST(_RopeLeaf*, __r); local
932 return _STLP_PRIV __ucopy_n(__l->_M_data, __l
1147 _RopeLeaf* __l = (_RopeLeaf*)__r; local
1199 _RopeLeaf* __l = (_RopeLeaf*)__r; local
1237 const _RopeLeaf* __l = __STATIC_CAST(const _RopeLeaf*, __left); local
[all...]
H A D_threads.h66 # define __add_and_fetch(__l,__v) add_then_test((unsigned long*)__l,__v)
67 # define __test_and_set(__l,__v) test_and_set(__l,__v)
H A D_rope.h503 _Rope_RopeConcatenation(_RopeRep* __l, _RopeRep* __r, allocator_type __a) argument
505 (max)(__l->_M_depth, __r->_M_depth) + 1, false,
506 __l->_M_size._M_data + __r->_M_size._M_data, __a), _M_left(__l), _M_right(__r)
601 _Rope_RopeSubstring(_RopeRep* __b, size_t __s, size_t __l, allocator_type __a) argument
602 : _Rope_RopeFunction<_CharT,_Alloc>(this, __l, false, __a),
604 _STLP_ASSERT(__l > 0)
605 _STLP_ASSERT(__s + __l <= __b->_M_size._M_data)
1224 size_t __l, allocator_type __a) {
1227 return new(__space) _RopeSubstring(__b, __s, __l, __
1223 _S_new_RopeSubstring(_Rope_RopeRep<_CharT,_Alloc>* __b, size_t __s, size_t __l, allocator_type __a) argument
[all...]
H A D_algo.c450 _Distance __l = __n - __k; local
456 if (__k == __l) {
467 if (__k < __l) {
468 for (_Distance __j = 0; __j < __l/__d; __j++) {
469 if (__p > __first + __l) {
470 *__p = *(__p - __l);
471 __p -= __l;
486 *__p = * (__p - __l);
487 __p -= __l;
/external/libcxx/src/
H A Dlocale.cpp656 __l(newlocale(LC_ALL_MASK, n, 0))
659 if (__l == 0)
667 __l(newlocale(LC_ALL_MASK, name.c_str(), 0))
670 if (__l == 0)
678 freelocale(__l);
687 int r = strcoll_l(lhs.c_str(), rhs.c_str(), __l);
699 string_type out(strxfrm_l(0, in.c_str(), 0, __l), char());
700 strxfrm_l(const_cast<char*>(out.c_str()), in.c_str(), out.size()+1, __l);
708 __l(newlocale(LC_ALL_MASK, n, 0))
711 if (__l
[all...]

Completed in 5860 milliseconds