| /external/stlport/stlport/stl/ |
| _slist_base.c | 41 while (__head && __head->_M_next != __node)
42 __head = __head->_M_next;
51 _Slist_node_base* __after = __pos->_M_next;
52 __pos->_M_next = __head->_M_next;
53 __head->_M_next = 0;
54 __before_last->_M_next = __after;
64 _Slist_node_base* __first = __before_first->_M_next;
65 _Slist_node_base* __after = __pos->_M_next;
66 __before_first->_M_next = __before_last->_M_next
[all...] |
| _slist.c | 46 _Slist_node_base* __cur = __before_first->_M_next;
49 __cur = __cur->_M_next;
53 __before_first->_M_next = __last_node;
73 _Node_base* __n1 = this->_M_head._M_data._M_next;
74 const _Node_base* __n2 = __x._M_head._M_data._M_next;
78 __n1 = __n1->_M_next;
79 __n2 = __n2->_M_next;
93 _Node_base* __node = this->_M_head._M_data._M_next;
97 __node = __node->_M_next;
108 while (__cur->_M_next != 0 && __len > 0)
[all...] |
| _slist_base.h | 39 _Slist_node_base* _M_next;
45 __new_node->_M_next = __prev_node->_M_next;
46 __prev_node->_M_next = __new_node;
|
| _list.c | 52 __last->_M_prev->_M_next = __position;
53 __first->_M_prev->_M_next = __last;
54 __position->_M_prev->_M_next = __first;
67 _Node* __cur = __STATIC_CAST(_Node*, _M_node._M_data._M_next);
74 __cur = __STATIC_CAST(_Node*, __cur->_M_next);
78 _M_node._M_data._M_next = &_M_node._M_data;
208 if (__that._M_node._M_data._M_next == &__that._M_node._M_data ||
209 __that._M_node._M_data._M_next->_M_next == &__that._M_node._M_data)
|
| _slist.h | 75 _M_node = _M_node->_M_next;
162 { _M_head._M_data._M_next = 0; }
167 { src.get()._M_head._M_data._M_next = 0; }
174 _Node* __next = __STATIC_CAST(_Node*, __pos->_M_next);
175 _Slist_node_base* __next_next = __next->_M_next;
176 __pos->_M_next = __next_next;
257 __node->_M_next = 0;
268 __node->_M_next = 0;
375 _Node_base* __node = this->_M_head._M_data._M_next;
379 __node = __node->_M_next;
[all...] |
| _list.h | 58 _List_node_base* _M_next;
91 void _M_incr() { _M_node = _M_node->_M_next; }
199 _M_node._M_data._M_prev->_M_next = _M_node._M_data._M_next->_M_prev = &_M_node._M_data;
208 bool empty() const { return _M_node._M_data._M_next == &_M_node._M_data; }
211 _M_node._M_data._M_next = &_M_node._M_data;
212 _M_node._M_data._M_prev = _M_node._M_data._M_next;
367 iterator begin() { return iterator(this->_M_node._M_data._M_next); }
368 const_iterator begin() const { return const_iterator(this->_M_node._M_data._M_next); }
393 __x._M_node._M_data._M_next = this->_M_node._M_data._M_next
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _slist_base.c | 41 while (__head && __head->_M_next != __node)
42 __head = __head->_M_next;
51 _Slist_node_base* __after = __pos->_M_next;
52 __pos->_M_next = __head->_M_next;
53 __head->_M_next = 0;
54 __before_last->_M_next = __after;
64 _Slist_node_base* __first = __before_first->_M_next;
65 _Slist_node_base* __after = __pos->_M_next;
66 __before_first->_M_next = __before_last->_M_next
[all...] |
| _slist.c | 46 _Slist_node_base* __cur = __before_first->_M_next;
49 __cur = __cur->_M_next;
53 __before_first->_M_next = __last_node;
73 _Node_base* __n1 = this->_M_head._M_data._M_next;
74 const _Node_base* __n2 = __x._M_head._M_data._M_next;
78 __n1 = __n1->_M_next;
79 __n2 = __n2->_M_next;
93 _Node_base* __node = this->_M_head._M_data._M_next;
97 __node = __node->_M_next;
108 while (__cur->_M_next != 0 && __len > 0)
[all...] |
| _slist_base.h | 39 _Slist_node_base* _M_next;
45 __new_node->_M_next = __prev_node->_M_next;
46 __prev_node->_M_next = __new_node;
|
| _list.c | 52 __last->_M_prev->_M_next = __position;
53 __first->_M_prev->_M_next = __last;
54 __position->_M_prev->_M_next = __first;
67 _Node* __cur = __STATIC_CAST(_Node*, _M_node._M_data._M_next);
74 __cur = __STATIC_CAST(_Node*, __cur->_M_next);
78 _M_node._M_data._M_next = &_M_node._M_data;
208 if (__that._M_node._M_data._M_next == &__that._M_node._M_data ||
209 __that._M_node._M_data._M_next->_M_next == &__that._M_node._M_data)
|
| _slist.h | 75 _M_node = _M_node->_M_next;
162 { _M_head._M_data._M_next = 0; }
167 { src.get()._M_head._M_data._M_next = 0; }
174 _Node* __next = __STATIC_CAST(_Node*, __pos->_M_next);
175 _Slist_node_base* __next_next = __next->_M_next;
176 __pos->_M_next = __next_next;
257 __node->_M_next = 0;
268 __node->_M_next = 0;
375 _Node_base* __node = this->_M_head._M_data._M_next;
379 __node = __node->_M_next;
[all...] |
| _list.h | 58 _List_node_base* _M_next;
91 void _M_incr() { _M_node = _M_node->_M_next; }
199 _M_node._M_data._M_prev->_M_next = _M_node._M_data._M_next->_M_prev = &_M_node._M_data;
208 bool empty() const { return _M_node._M_data._M_next == &_M_node._M_data; }
211 _M_node._M_data._M_next = &_M_node._M_data;
212 _M_node._M_data._M_prev = _M_node._M_data._M_next;
367 iterator begin() { return iterator(this->_M_node._M_data._M_next); }
368 const_iterator begin() const { return const_iterator(this->_M_node._M_data._M_next); }
393 __x._M_node._M_data._M_next = this->_M_node._M_data._M_next
[all...] |
| /external/stlport/stlport/stl/debug/ |
| _debug.c | 127 _L_type* __pos = __prev->_M_next;
135 __prev->_M_next = __pos->_M_next;
140 __pos = __prev->_M_next;
151 _L_type* __pos = __prev->_M_next;
157 __prev->_M_next = __pos->_M_next;
162 __pos = __prev->_M_next;
179 _L_type* __pos = __src_prev->_M_next;
189 __src_prev->_M_next = __pos->_M_next
[all...] |
| _debug.h | 287 __owned_link(const __owned_list* __c) : _M_self(this), _M_owner(0), _M_next(0)
293 __owned_link(const __owned_list* __c) : _M_owner(0), _M_next(0)
323 void _Invalidate() { _M_owner = 0; _M_next = 0; }
324 void _Link_to_self() { _M_next = 0; }
326 __owned_link* _Next() { return _M_next; }
327 const __owned_link* _Next() const { return _M_next; }
335 __owned_link* _M_next;
344 _M_node._M_next = 0;
360 const __owned_link* _First() const { return (__owned_link*)_M_node._M_next; }
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _debug.c | 127 _L_type* __pos = __prev->_M_next;
135 __prev->_M_next = __pos->_M_next;
140 __pos = __prev->_M_next;
151 _L_type* __pos = __prev->_M_next;
157 __prev->_M_next = __pos->_M_next;
162 __pos = __prev->_M_next;
179 _L_type* __pos = __src_prev->_M_next;
189 __src_prev->_M_next = __pos->_M_next
[all...] |
| _debug.h | 287 __owned_link(const __owned_list* __c) : _M_self(this), _M_owner(0), _M_next(0)
293 __owned_link(const __owned_list* __c) : _M_owner(0), _M_next(0)
323 void _Invalidate() { _M_owner = 0; _M_next = 0; }
324 void _Link_to_self() { _M_next = 0; }
326 __owned_link* _Next() { return _M_next; }
327 const __owned_link* _Next() const { return _M_next; }
335 __owned_link* _M_next;
344 _M_node._M_next = 0;
360 const __owned_link* _First() const { return (__owned_link*)_M_node._M_next; }
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/debug/ |
| safe_base.h | 73 _Safe_iterator_base* _M_next;
78 : _M_sequence(0), _M_version(0), _M_prior(0), _M_next(0)
89 : _M_sequence(0), _M_version(0), _M_prior(0), _M_next(0)
96 : _M_sequence(0), _M_version(0), _M_prior(0), _M_next(0)
|
| safe_sequence.h | 130 __iter = __iter->_M_next;
141 __iter2 = __iter2->_M_next;
167 __iter = __iter->_M_next;
176 __iter2 = __iter2->_M_next;
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/backward/ |
| hashtable.h | 85 _Hashtable_node* _M_next;
424 for (_Node* __n = _M_buckets[__bucket]; __n; __n = __n->_M_next)
509 __first = __first->_M_next)
521 __first = __first->_M_next)
533 __cur = __cur->_M_next)
600 __n->_M_next = 0;
637 _M_cur = _M_cur->_M_next;
665 _M_cur = _M_cur->_M_next;
702 __cur1 = __cur1->_M_next, __cur2 = __cur2->_M_next)
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| forward_list.h | 61 _Pointer _M_next;
63 _Fwd_list_node_base() : _M_next(0) { }
67 { std::swap(__x._M_next, __y._M_next); }
137 _M_node = _M_node->_M_next;
145 _M_node = _M_node->_M_next;
158 _M_next() const
161 return _Fwd_list_iterator(_M_node->_M_next);
208 _M_node = _M_node->_M_next;
216 _M_node = _M_node->_M_next;
[all...] |
| stl_list.h | 73 _List_node_base* _M_next;
143 _M_node = _M_node->_M_next;
151 _M_node = _M_node->_M_next;
223 _M_node = _M_node->_M_next;
231 _M_node = _M_node->_M_next;
368 this->_M_impl._M_node._M_next = &this->_M_impl._M_node;
690 { return iterator(this->_M_impl._M_node._M_next); }
699 { return const_iterator(this->_M_impl._M_node._M_next); }
763 { return const_iterator(this->_M_impl._M_node._M_next); }
800 { return this->_M_impl._M_node._M_next == &this->_M_impl._M_node;
[all...] |
| /external/stlport/src/ |
| lock_free_slist.h | 40 item* _M_next;
72 "L1_%=: movl %%eax, (%%ebx)\n\t" // __item._M_next = _M._M_data._M_top
95 " movl (%%eax), %%ebx\n\t" // new top = _M._M_data._M_top->_M_next
187 item* _M_next;
217 L1: mov [ebx], eax // __item._M_next = _M._M_data._M_top
242 mov ebx, [eax] // new top = _M._M_data._M_top->_M_next
|
| allocators.cpp | 242 _Node_alloc_obj * _M_next;
329 *__my_free_list = __r->_M_next;
346 __pobj->_M_next = *__my_free_list;
387 __REINTERPRET_CAST(_Obj*, _S_start_free)->_M_next = *__my_free_list;
408 *__my_free_list = __p -> _M_next;
423 __REINTERPRET_CAST(_Obj*, _S_start_free)->_M_next = _S_chunks;
451 __current_obj->_M_next = __next_obj;
453 __next_obj->_M_next = 0;
471 __pnext = __pcur->_M_next;
683 _Obj* __next = __chunk->_M_next;
[all...] |
| /ndk/sources/cxx-stl/stlport/src/ |
| lock_free_slist.h | 40 item* _M_next;
72 "L1_%=: movl %%eax, (%%ebx)\n\t" // __item._M_next = _M._M_data._M_top
95 " movl (%%eax), %%ebx\n\t" // new top = _M._M_data._M_top->_M_next
187 item* _M_next;
217 L1: mov [ebx], eax // __item._M_next = _M._M_data._M_top
242 mov ebx, [eax] // new top = _M._M_data._M_top->_M_next
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/ |
| mt_allocator.h | 129 _Block_address* _M_next;
198 _Block_record* _M_next;
274 _Thread_record* _M_next;
283 _Block_record* _M_next;
706 __bin._M_first[__thread_id] = __block->_M_next;
|
