| /external/stlport/stlport/stl/debug/ |
| _debug.c | 408 __stl_debug_engine<_Dummy>::_IndexedError(int __error_ind, const char* __f, int __l) {
410 __f, __l, _Message_table[__error_ind]);
415 __stl_debug_engine<_Dummy>::_VerboseAssert(const char* __expr, int __error_ind, const char* __f, int __l) {
417 __f, __l, _Message_table[__error_ind], __f, __l, __expr);
423 __stl_debug_engine<_Dummy>::_Assert(const char* __expr, const char* __f, int __l) {
424 __stl_debug_message(_Message_table[_StlFormat_ASSERTION_FAILURE],__f, __l, __expr);
451 __stl_debug_engine<_Dummy>::_Invalidate_all(__owned_list* __l) {
452 _STLP_ACQUIRE_LOCK(__l->_M_lock);
453 _Stamp_all(__l, 0)
[all...] |
| _string.h | 82 void _Invalidate_iterators(const iterator& __f, const iterator& __l)
83 { _STLP_PRIV __invalidate_range(&_M_iter_list, __f, __l); }
133 basic_string(const _CharT* __f, const _CharT* __l,
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,
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,
147 : _ConstructCheck(__f, __l),
[all...] |
| _hashtable.h | 227 void insert_unique(_InputIterator __f, _InputIterator __l) {
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){
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) {
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) {
[all...] |
| _iterator.h | 388 __construct_checker(const _InputIter& __f, const _InputIter& __l) {
390 _M_check_dispatch(__f, __l, _Integral());
397 void _M_check_dispatch(const _InputIter& __f, const _InputIter& __l, const __false_type& /*IsIntegral*/) {
398 _STLP_DEBUG_CHECK(__check_range(__f,__l))
403 __construct_checker(const value_type* __f, const value_type* __l) {
404 _STLP_DEBUG_CHECK(__check_ptr_range(__f,__l))
408 __construct_checker(const _IteType& __f, const _IteType& __l) {
409 _STLP_DEBUG_CHECK(__check_range(__f,__l))
|
| _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 static void _STLP_CALL _VerboseAssert(const char* __expr, int __error_ind, const char* __f, int __l);
|
| /external/stlport/stlport/stl/ |
| _hash_map.h | 105 hash_map(_InputIterator __f, _InputIterator __l)
107 { _M_ht.insert_unique(__f, __l); }
109 hash_map(_InputIterator __f, _InputIterator __l, size_type __n)
111 { _M_ht.insert_unique(__f, __l); }
113 hash_map(_InputIterator __f, _InputIterator __l, size_type __n,
116 { _M_ht.insert_unique(__f, __l); }
119 hash_map(_InputIterator __f, _InputIterator __l, size_type __n,
122 { _M_ht.insert_unique(__f, __l); }
125 hash_map(_InputIterator __f, _InputIterator __l, size_type __n,
129 { _M_ht.insert_unique(__f, __l); }
[all...] |
| _hash_set.h | 107 hash_set(_InputIterator __f, _InputIterator __l)
109 { _M_ht.insert_unique(__f, __l); }
111 hash_set(_InputIterator __f, _InputIterator __l, size_type __n)
113 { _M_ht.insert_unique(__f, __l); }
115 hash_set(_InputIterator __f, _InputIterator __l, size_type __n,
118 { _M_ht.insert_unique(__f, __l); }
120 hash_set(_InputIterator __f, _InputIterator __l, size_type __n,
124 { _M_ht.insert_unique(__f, __l); }
127 hash_set(_InputIterator __f, _InputIterator __l, size_type __n,
130 { _M_ht.insert_unique(__f, __l); }
[all...] |
| _string_workaround.h | 82 basic_string(_InputIterator __f, _InputIterator __l,
86 _M_initialize_dispatch(__f, __l, _Integral());
90 basic_string(_InputIterator __f, _InputIterator __l)
93 _M_initialize_dispatch(__f, __l, _Integral());
114 void _M_range_initialize(_InputIter __f, _InputIter __l,
118 _M_appendT(__f, __l, __tag);
122 void _M_range_initialize(_ForwardIter __f, _ForwardIter __l,
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) {
[all...] |
| _unordered_map.h | 95 unordered_map(_InputIterator __f, _InputIterator __l,
100 { _M_ht.insert_unique(__f, __l); }
102 unordered_map(const value_type* __f, const value_type* __l,
107 { _M_ht.insert_unique(__f, __l); }
109 unordered_map(const_iterator __f, const_iterator __l,
114 { _M_ht.insert_unique(__f, __l); }
139 void insert(_InputIterator __f, _InputIterator __l)
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)
[all...] |
| _unordered_set.h | 89 unordered_set(_InputIterator __f, _InputIterator __l,
94 { _M_ht.insert_unique(__f, __l); }
96 unordered_set(const value_type* __f, const value_type* __l,
101 { _M_ht.insert_unique(__f, __l); }
103 unordered_set(const_iterator __f, const_iterator __l,
108 { _M_ht.insert_unique(__f, __l); }
133 void insert(_InputIterator __f, _InputIterator __l)
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)
[all...] |
| _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...] |
| _string.h | 261 basic_string(_InputIterator __f, _InputIterator __l,
265 _M_initialize_dispatch(__f, __l, _Integral());
269 basic_string(_InputIterator __f, _InputIterator __l)
272 _M_initialize_dispatch(__f, __l, _Integral());
277 basic_string(const _CharT* __f, const _CharT* __l,
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)
286 _STLP_FIX_LITERAL_BUG(__f) _STLP_FIX_LITERAL_BUG(__l)
287 _M_range_initialize(__f, __l);
[all...] |
| _string.c | 64 _Not_within_traits(const _CharT* __f, const _CharT* __l)
65 : _M_first(__f), _M_last(__l) {}
242 basic_string<_CharT,_Traits,_Alloc>::_M_assign(const _CharT* __f, const _CharT* __l) {
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, __first)
[all...] |
| _rope.c | 321 _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
1147 _RopeLeaf* __l = (_RopeLeaf*)__r; local
1199 _RopeLeaf* __l = (_RopeLeaf*)__r; local
1237 const _RopeLeaf* __l = __STATIC_CAST(const _RopeLeaf*, __left); local
[all...] |
| _threads.h | 66 # 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)
|
| _rope.h | 503 _Rope_RopeConcatenation(_RopeRep* __l, _RopeRep* __r, allocator_type __a)
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)
602 : _Rope_RopeFunction<_CharT,_Alloc>(this, __l, false, __a),
604 _STLP_ASSERT(__l > 0)
605 _STLP_ASSERT(__s + __l <= __b->_M_size._M_data)
[all...] |
| _algo.c | 450 _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;
[all...] |
| /external/bluetooth/glib/glib/ |
| gtypes.h | 203 guint32 __l[2]; } __w, __r; \
209 __r.__l[0] = GUINT32_SWAP_LE_BE (__w.__l[1]); \
210 __r.__l[1] = GUINT32_SWAP_LE_BE (__w.__l[0]); \
|
