Home
last modified time | relevance | path

Searched refs:_M_node (Results 1 – 18 of 18) sorted by relevance

/external/stlport/stlport/stl/
D_tree.c278 _Rb_global<_Dummy>::_M_decrement(_Rb_tree_node_base* _M_node) { in _M_decrement() argument
279 if (_M_node->_M_color == _S_rb_tree_red && _M_node->_M_parent->_M_parent == _M_node) in _M_decrement()
280 _M_node = _M_node->_M_right; in _M_decrement()
281 else if (_M_node->_M_left != 0) { in _M_decrement()
282 _M_node = _Rb_tree_node_base::_S_maximum(_M_node->_M_left); in _M_decrement()
285 _Base_ptr __y = _M_node->_M_parent; in _M_decrement()
286 while (_M_node == __y->_M_left) { in _M_decrement()
287 _M_node = __y; in _M_decrement()
290 _M_node = __y; in _M_decrement()
292 return _M_node; in _M_decrement()
[all …]
D_list.h87 _List_node_base* _M_node; member
89 _List_iterator_base(_List_node_base* __x) : _M_node(__x) {} in _List_iterator_base()
91 void _M_incr() { _M_node = _M_node->_M_next; } in _M_incr()
92 void _M_decr() { _M_node = _M_node->_M_prev; } in _M_decr()
116 _List_iterator(const iterator& __x) : _List_iterator_base(__x._M_node) {} in _List_iterator()
118 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; }
141 return this->_M_node == __y._M_node;
144 return this->_M_node != __y._M_node;
186 { return _STLP_CONVERT_ALLOCATOR((const _Node_allocator_type&)_M_node, _Tp); }
188 _List_base(const allocator_type& __a) : _M_node(_STLP_CONVERT_ALLOCATOR(__a, _Node), _Node_base())
[all …]
D_deque.c42 _M_destroy_nodes(_M_start._M_node, this->_M_finish._M_node + 1); in ~_Deque_base()
132 _STLP_UNWIND(this->_M_destroy_nodes(__new_start._M_node, this->_M_start._M_node)) in _M_fill_insert()
140 _STLP_UNWIND(this->_M_destroy_nodes(this->_M_finish._M_node+1, __new_finish._M_node+1)) in _M_fill_insert()
161 _STLP_UNWIND(this->_M_destroy_nodes(__new_start._M_node, this->_M_start._M_node)) in insert()
169 _STLP_UNWIND(this->_M_destroy_nodes(this->_M_finish._M_node + 1, in insert()
170 __new_finish._M_node + 1)) in insert()
189 _STLP_UNWIND(this->_M_destroy_nodes(__new_start._M_node, this->_M_start._M_node)) in insert()
197 _STLP_UNWIND(this->_M_destroy_nodes(this->_M_finish._M_node + 1, in insert()
198 __new_finish._M_node + 1)) in insert()
289 this->_M_destroy_nodes(this->_M_start._M_node, __new_start._M_node); in _M_erase()
[all …]
D_list.c67 _Node* __cur = __STATIC_CAST(_Node*, _M_node._M_data._M_next); in clear()
72 __cur != &(_M_node._M_data)) { in clear()
76 this->_M_node.deallocate(__tmp, 1); in clear()
78 _M_node._M_data._M_next = &_M_node._M_data; in clear()
79 _M_node._M_data._M_prev = &_M_node._M_data; in clear()
180 _List_global_inst::_Transfer(__first1._M_node, __first2._M_node, (++__next)._M_node); in _S_merge()
187 _List_global_inst::_Transfer(__last1._M_node, __first2._M_node, __last2._M_node); in _S_merge()
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.h70 _Slist_node_base *_M_node; member
72 _Slist_iterator_base(_Slist_node_base *__x) : _M_node(__x) {} in _Slist_iterator_base()
75 _M_node = _M_node->_M_next; in _M_incr()
100 _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x._M_node) {} in _Slist_iterator()
102 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; }
117 return this->_M_node == __y._M_node;
120 return this->_M_node != __y._M_node;
459 return iterator(_STLP_PRIV _Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node));
464 __pos._M_node)));
605 return iterator(_M_insert_after(__pos._M_node, __x));
[all …]
D_slist.c138 while (__ite._M_node->_M_next) { in _Slist_unique()
139 if (__pred(*__ite, __STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data)) in _Slist_unique()
154 while (__ite._M_node->_M_next && !__x.empty()) { in _Slist_merge()
155 if (__comp(__x.front(), __STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data)) { in _Slist_merge()
156 … _STLP_VERBOSE_ASSERT(!__comp(__STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data, __x.front()), in _Slist_merge()
168 while (__i1._M_node->_M_next && __i2._M_node) { in _Slist_merge()
169 if (__comp(__STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data, *__i2)) { in _Slist_merge()
170 _STLP_VERBOSE_ASSERT(!__comp(*__i2, __STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data), in _Slist_merge()
185 if (!__that.begin()._M_node || !__that.begin()._M_node->_M_next) in _Slist_sort()
D_deque.h104 _Map_pointer _M_node; member
108 _M_last(*__y + _S_buffer_size()), _M_node(__y) {} in _Deque_iterator_base()
110 _Deque_iterator_base() : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) {} in _Deque_iterator_base()
116 _M_last(__other._M_last), _M_node(__other._M_node) {} in _Deque_iterator_base()
120 return difference_type(_S_buffer_size()) * (_M_node - __x._M_node - 1) + in _M_subtract()
126 _M_set_node(_M_node + 1); in _M_increment()
133 _M_set_node(_M_node - 1); in _M_decrement()
148 _M_set_node(_M_node + __node_offset); in _M_advance()
156 _M_last = (_M_first = *(_M_node = __new_node)) + difference_type(_S_buffer_size()); in _M_set_node()
241 return (__x._M_node == __y._M_node) ?
[all …]
D_tree.h140 _Base_ptr _M_node; member
141 _Rb_tree_base_iterator() : _M_node(0) {} in _Rb_tree_base_iterator()
142 _Rb_tree_base_iterator(_Base_ptr __x) : _M_node(__x) {} in _Rb_tree_base_iterator()
168 _Rb_tree_iterator(const iterator& __it) : _Rb_tree_base_iterator(__it._M_node) {} in _Rb_tree_iterator()
171 return __STATIC_CAST(_Link_type, _M_node)->_M_value_field;
177 _M_node = _Rb_global_inst::_M_increment(_M_node);
187 _M_node = _Rb_global_inst::_M_decrement(_M_node);
197 return _M_node == __rhs._M_node;
200 return _M_node != __rhs._M_node;
493 _Base_ptr __x = _Rb_global_inst::_Rebalance_for_erase(__pos._M_node,
[all …]
D_hashtable.c168 _BucketType *__pos_node = __pos._M_node; in _S_before_begin()
190 _M_elems.insert_after(__pos, __obj)._M_node); in _M_insert_noresize()
280 fill(_M_buckets.begin() + __prev_b, _M_buckets.begin() + __n + 1, __cur._M_node); in erase()
312 _M_elems.erase_after(__prev)._M_node); in erase()
357 fill(_M_buckets.begin() + __f_bucket, _M_buckets.begin() + __l_bucket + 1, __cur._M_node); in erase()
471 fill(__tmp.begin() + __prev_bucket, __tmp.begin() + __new_bucket + 1, __cur._M_node); in _M_rehash()
521 if (*__src_b == __src._M_node) { in _M_copy_from()
522 *__dst_b = __dst._M_node; in _M_copy_from()
/external/stlport/stlport/stl/pointers/
D_slist.h128 : _M_impl(_BaseConstIte(__first._M_node), _BaseConstIte(__last._M_node),
181 _M_impl.assign(_BaseConstIte(__first._M_node), in assign()
182 _BaseConstIte(__last._M_node)); in assign()
186 iterator before_begin() { return iterator(_M_impl.before_begin()._M_node); } in before_begin()
187 …e_begin() const { return const_iterator(const_cast<_Node_base*>(_M_impl.before_begin()._M_node)); } in before_begin()
189 iterator begin() { return iterator(_M_impl.begin()._M_node); } in begin()
190 …or begin() const { return const_iterator(const_cast<_Node_base*>(_M_impl.begin()._M_node));} in begin()
192 iterator end() { return iterator(_M_impl.end()._M_node); } in end()
193 const_iterator end() const { return iterator(_M_impl.end()._M_node); } in end()
221 { return iterator(_M_impl.previous(_BaseConstIte(__pos._M_node))._M_node); } in previous()
[all …]
D_list.h140 : _M_impl(_BaseConstIte(__first._M_node), _BaseConstIte(__last._M_node),
152 iterator begin() { return iterator(_M_impl.begin()._M_node); } in begin()
153 const_iterator begin() const { return const_iterator(_M_impl.begin()._M_node); } in begin()
155 iterator end() { return iterator(_M_impl.end()._M_node); } in end()
156 const_iterator end() const { return const_iterator(_M_impl.end()._M_node); } in end()
184 { return iterator(_M_impl.insert(_BaseIte(__pos._M_node),
185 cast_traits::to_storage_type_cref(__x))._M_node); }
193 { _M_impl.insert(_BaseIte(__pos._M_node), __n, __val); } in _M_insert_dispatch()
199 _M_impl.insert(_BaseIte(__pos._M_node), in _M_insert_dispatch()
214 _M_impl.insert(_BaseIte(__pos._M_node), __first, __last); in insert()
[all …]
D_deque.h46 tmp._M_node = cast_traits::to_value_type_pptr(__ite._M_node); in to_value_type_ite()
54 tmp._M_node = cast_traits::to_storage_type_pptr(__ite._M_node); in to_storage_type_ite()
63 tmp._M_node = cast_traits::to_value_type_pptr(__ite._M_node); in to_value_type_cite()
72 tmp._M_node = cast_traits::to_storage_type_pptr(__ite._M_node); in to_storage_type_cite()
D_set.h118 { return iterator(__ite._Owner(), __ite._M_iterator._M_node); }
120 { return base_iterator(__ite._Owner(), __ite._M_iterator._M_node); }
123 { return iterator(__ite._M_node); }
125 { return base_iterator(__ite._M_node); }
365 { return iterator(__ite._Owner(), __ite._M_iterator._M_node); }
367 { return base_iterator(__ite._Owner(), __ite._M_iterator._M_node); }
370 { return iterator(__ite._M_node); }
372 { return base_iterator(__ite._M_node); }
/external/stlport/etc/
Dautoexp.dat211 …(($c._M_finish._M_node - $c._M_start._M_node + 1) * (_MAX_BYTES / sizeof($T1))) - ($c._M_start._M_…
213 ($c._M_finish._M_node - $c._M_start._M_node + 1) * (_MAX_BYTES / sizeof($T1)) - 1,
217 …expr : *(*($c._M_start._M_node + (($i + ($c._M_start._M_cur - $c._M_start._M_first)) / (_MAX_BYTES…
218 …size : (($c._M_finish._M_node - $c._M_start._M_node + 1) * (_MAX_BYTES / sizeof($T1))) - ($c._M_st…
227 $c._M_finish._M_node - $c._M_start._M_node,
229 $c._M_finish._M_node - $c._M_start._M_node,
233 expr : **($c._M_start._M_node + $i),
234 size : $c._M_finish._M_node - $c._M_start._M_node
246 …size : (($c._M_finish._M_node - $c._M_start._M_node + 1) * (_MAX_BYTES / sizeof($T1))) - ($c._M_st…
247 capacity : ($c._M_finish._M_node - $c._M_start._M_node + 1) * (_MAX_BYTES / sizeof($T1)) - 1,
[all …]
DChangeLog-4.0143 …* _tree.h : made _Rb_tree_base_iterator::_M_node initialized in default constructor (thanks to Dea…
DChangeLog-5.16694 * stlport/stl/_slist.h: fix of an invalid reference to a _M_node member data
/external/stlport/stlport/stl/debug/
D_debug.c126 _L_type* __prev = __CONST_CAST(_L_type*, &__base->_M_node); in __invalidate_range()
150 _L_type* __prev = __CONST_CAST(_L_type*, &__base->_M_node); in __invalidate_iterator()
178 _L_type* __src_prev = &__base->_M_node; in __change_range_owner()
180 _L_type* __dst_prev = __CONST_CAST(_L_type*, &__dst->_M_node); in __change_range_owner()
223 _L_type* __prev = &__base->_M_node; in __change_ite_owner()
225 _L_type* __dst_prev = __CONST_CAST(_L_type*, &__dst->_M_node); in __change_ite_owner()
454 __l->_M_node._M_next =0; in _Invalidate_all()
463 if (__l->_M_node._M_owner) { in _Stamp_all()
464 for (__owned_link* __pos = (__owned_link*)__l->_M_node._M_next; in _Stamp_all()
477 _STLP_ASSERT(__l->_M_node._Owner() != 0) in _Verify()
[all …]
D_debug.h343 _M_node._M_owner = __REINTERPRET_CAST(__owned_list*,__o); in __owned_list()
344 _M_node._M_next = 0; in __owned_list()
350 _M_node._Invalidate(); in ~__owned_list()
352 const void* _Owner() const { return (const void*)_M_node._M_owner; } in _Owner()
353 void* _Owner() { return (void*)_M_node._M_owner; } in _Owner()
354 bool _Valid() const { return _M_node._M_owner != 0; } in _Valid()
355 void _Invalidate() { _M_node._M_owner = 0; } in _Invalidate()
357 __owned_link* _First() { return _M_node._Next(); } in _First()
360 const __owned_link* _First() const { return (__owned_link*)_M_node._M_next; } in _First()
368 mutable __owned_link _M_node; variable