Home
last modified time | relevance | path

Searched refs:_M_next (Results 1 – 11 of 11) sorted by relevance

/external/stlport/stlport/stl/
D_slist_base.c41 while (__head && __head->_M_next != __node) in __previous()
42 __head = __head->_M_next; in __previous()
51 _Slist_node_base* __after = __pos->_M_next; in __splice_after()
52 __pos->_M_next = __head->_M_next; in __splice_after()
53 __head->_M_next = 0; in __splice_after()
54 __before_last->_M_next = __after; in __splice_after()
64 _Slist_node_base* __first = __before_first->_M_next; in __splice_after()
65 _Slist_node_base* __after = __pos->_M_next; in __splice_after()
66 __before_first->_M_next = __before_last->_M_next; in __splice_after()
67 __pos->_M_next = __first; in __splice_after()
[all …]
D_slist.c46 _Slist_node_base* __cur = __before_first->_M_next; in _M_erase_after()
49 __cur = __cur->_M_next; in _M_erase_after()
53 __before_first->_M_next = __last_node; in _M_erase_after()
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; in _M_fill_assign()
97 __node = __node->_M_next; in _M_fill_assign()
108 while (__cur->_M_next != 0 && __len > 0) { in resize()
[all …]
D_slist.h75 _M_node = _M_node->_M_next; in _M_incr()
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 …]
D_list.h58 _List_node_base* _M_next; member
91 void _M_incr() { _M_node = _M_node->_M_next; } in _M_incr()
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;
394 __x._M_node._M_data._M_next->_M_prev = &__x._M_node._M_data;
[all …]
D_list.c52 __last->_M_prev->_M_next = __position; in _Transfer()
53 __first->_M_prev->_M_next = __last; in _Transfer()
54 __position->_M_prev->_M_next = __first; in _Transfer()
67 _Node* __cur = __STATIC_CAST(_Node*, _M_node._M_data._M_next); in clear()
74 __cur = __STATIC_CAST(_Node*, __cur->_M_next); in clear()
78 _M_node._M_data._M_next = &_M_node._M_data; in clear()
208 if (__that._M_node._M_data._M_next == &__that._M_node._M_data || in _S_sort()
209 __that._M_node._M_data._M_next->_M_next == &__that._M_node._M_data) in _S_sort()
D_slist_base.h39 _Slist_node_base* _M_next; member
45 __new_node->_M_next = __prev_node->_M_next; in __slist_make_link()
46 __prev_node->_M_next = __new_node; in __slist_make_link()
/external/stlport/stlport/stl/debug/
D_debug.c127 _L_type* __pos = __prev->_M_next; in __invalidate_range()
135 __prev->_M_next = __pos->_M_next; in __invalidate_range()
140 __pos = __prev->_M_next; in __invalidate_range()
151 _L_type* __pos = __prev->_M_next; in __invalidate_iterator()
157 __prev->_M_next = __pos->_M_next; in __invalidate_iterator()
162 __pos = __prev->_M_next; in __invalidate_iterator()
179 _L_type* __pos = __src_prev->_M_next; in __change_range_owner()
189 __src_prev->_M_next = __pos->_M_next; in __change_range_owner()
191 __pos->_M_next = __dst_prev->_M_next; in __change_range_owner()
192 __dst_prev->_M_next = __pos; in __change_range_owner()
[all …]
D_debug.h287 __owned_link(const __owned_list* __c) : _M_self(this), _M_owner(0), _M_next(0) in __owned_link()
293 __owned_link(const __owned_list* __c) : _M_owner(0), _M_next(0)
323 void _Invalidate() { _M_owner = 0; _M_next = 0; } in _Invalidate()
324 void _Link_to_self() { _M_next = 0; } in _Link_to_self()
326 __owned_link* _Next() { return _M_next; } in _Next()
327 const __owned_link* _Next() const { return _M_next; } in _Next()
335 __owned_link* _M_next; variable
344 _M_node._M_next = 0; in __owned_list()
360 const __owned_link* _First() const { return (__owned_link*)_M_node._M_next; } in _First()
/external/stlport/src/
Dallocators.cpp242 _Node_alloc_obj * _M_next; member
329 *__my_free_list = __r->_M_next; in _M_allocate()
346 __pobj->_M_next = *__my_free_list; in _M_deallocate()
387 __REINTERPRET_CAST(_Obj*, _S_start_free)->_M_next = *__my_free_list; in _S_chunk_alloc()
408 *__my_free_list = __p -> _M_next; in _S_chunk_alloc()
423 __REINTERPRET_CAST(_Obj*, _S_start_free)->_M_next = _S_chunks; in _S_chunk_alloc()
451 __current_obj->_M_next = __next_obj; in _S_refill()
453 __next_obj->_M_next = 0; in _S_refill()
471 __pnext = __pcur->_M_next; in _S_chunk_dealloc()
683 _Obj* __next = __chunk->_M_next; in _S_chunk_dealloc()
Dlock_free_slist.h40 item* _M_next; member
187 item* _M_next; member
/external/stlport/etc/
Dautoexp.dat314 head : $c._M_node._M_data._M_next,
316 next : _M_next,
327 head : $c._M_node._M_data._M_next,
329 next : _M_next,
374 head : $c._M_head._M_data._M_next,
376 next : _M_next,
387 head : $c._M_head._M_data._M_next,
389 next : _M_next,