Home
last modified time | relevance | path

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

/openbsd/src/gnu/gcc/libstdc++-v3/include/bits/
Dstl_list.h124 : _M_node() { } in _List_iterator()
128 : _M_node(__x) { } in _List_iterator()
133 { return static_cast<_Node*>(_M_node)->_M_data; }
137 { return &static_cast<_Node*>(_M_node)->_M_data; }
142 _M_node = _M_node->_M_next;
150 _M_node = _M_node->_M_next;
157 _M_node = _M_node->_M_prev;
165 _M_node = _M_node->_M_prev;
171 { return _M_node == __x._M_node; }
175 { return _M_node != __x._M_node; }
[all …]
Ddeque.tcc194 _M_destroy_nodes(__new_start._M_node, in _M_fill_insert()
195 this->_M_impl._M_start._M_node); in _M_fill_insert()
211 _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1, in _M_fill_insert()
212 __new_finish._M_node + 1); in _M_fill_insert()
228 for (__cur = this->_M_impl._M_start._M_node; in _M_fill_initialize()
229 __cur < this->_M_impl._M_finish._M_node; in _M_fill_initialize()
278 for (__cur_node = this->_M_impl._M_start._M_node; in _M_range_initialize()
279 __cur_node < this->_M_impl._M_finish._M_node; in _M_range_initialize()
309 *(this->_M_impl._M_finish._M_node + 1) = this->_M_allocate_node(); in _M_push_back_aux()
313 this->_M_impl._M_finish._M_set_node(this->_M_impl._M_finish._M_node in _M_push_back_aux()
[all …]
Dstl_tree.h166 : _M_node() { } in _Rb_tree_iterator()
170 : _M_node(__x) { } in _Rb_tree_iterator()
174 { return static_cast<_Link_type>(_M_node)->_M_value_field; }
178 { return &static_cast<_Link_type>(_M_node)->_M_value_field; }
183 _M_node = _Rb_tree_increment(_M_node);
191 _M_node = _Rb_tree_increment(_M_node);
198 _M_node = _Rb_tree_decrement(_M_node);
206 _M_node = _Rb_tree_decrement(_M_node);
212 { return _M_node == __x._M_node; }
216 { return _M_node != __x._M_node; }
[all …]
Dlist.tcc73 _Node* __cur = static_cast<_Node*>(this->_M_impl._M_node._M_next); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
74 while (__cur != &this->_M_impl._M_node) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
89 __tmp->hook(__position._M_node); in insert()
98 iterator __ret = iterator(__position._M_node->_M_next); in erase()
274 if (this->_M_impl._M_node._M_next != &this->_M_impl._M_node in sort()
275 && this->_M_impl._M_node._M_next->_M_next != &this->_M_impl._M_node) in sort()
351 if (this->_M_impl._M_node._M_next != &this->_M_impl._M_node in sort()
352 && this->_M_impl._M_node._M_next->_M_next != &this->_M_impl._M_node) in sort()
Dstl_deque.h122 _Map_pointer _M_node; member
126 _M_last(*__y + _S_buffer_size()), _M_node(__y) {} in _Deque_iterator()
128 _Deque_iterator() : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) {} in _Deque_iterator()
132 _M_last(__x._M_last), _M_node(__x._M_node) {} in _Deque_iterator()
148 _M_set_node(_M_node + 1);
167 _M_set_node(_M_node - 1);
194 _M_set_node(_M_node + __node_offset);
232 _M_node = __new_node; in _M_set_node()
271 { return (__x._M_node == __y._M_node) ? (__x._M_cur < __y._M_cur)
272 : (__x._M_node < __y._M_node); }
[all …]
/openbsd/src/gnu/lib/libstdc++/libstdc++/include/bits/
Ddeque.tcc147 _M_destroy_nodes(_M_start._M_node, __new_start._M_node); in erase()
155 _M_destroy_nodes(__new_finish._M_node + 1, _M_finish._M_node + 1); in erase()
167 for (_Map_pointer __node = _M_start._M_node + 1; in clear()
168 __node < _M_finish._M_node; in clear()
175 if (_M_start._M_node != _M_finish._M_node) in clear()
217 _M_destroy_nodes(__new_start._M_node, _M_start._M_node); in _M_fill_insert()
231 _M_destroy_nodes(_M_finish._M_node + 1, __new_finish._M_node + 1); in _M_fill_insert()
247 for (__cur = _M_start._M_node; __cur < _M_finish._M_node; ++__cur) in _M_fill_initialize()
291 for (__cur_node = _M_start._M_node; in _M_range_initialize()
292 __cur_node < _M_finish._M_node; in _M_range_initialize()
[all …]
Dstl_list.h104 _List_node_base* _M_node; member
107 : _M_node(__x) in _List_iterator_base()
116 { _M_node = _M_node->_M_next; } in _M_incr()
121 { _M_node = _M_node->_M_prev; } in _M_decr()
125 { return _M_node == __x._M_node; }
129 { return _M_node != __x._M_node; }
162 : _List_iterator_base(__x._M_node) in _List_iterator()
167 { return static_cast<_Node*>(_M_node)->_M_data; }
250 _List_node<_Tp>* _M_node; variable
281 _List_node<_Tp>* _M_node; variable
[all …]
Dlist.tcc72 _Node* __cur = static_cast<_Node*>(_M_node->_M_next); in __clear()
73 while (__cur != _M_node) in __clear()
80 _M_node->_M_next = _M_node; in __clear()
81 _M_node->_M_prev = _M_node; in __clear()
90 __tmp->_M_next = __position._M_node; in insert()
91 __tmp->_M_prev = __position._M_node->_M_prev; in insert()
92 __position._M_node->_M_prev->_M_next = __tmp; in insert()
93 __position._M_node->_M_prev = __tmp; in insert()
102 _List_node_base* __next_node = __position._M_node->_M_next; in erase()
103 _List_node_base* __prev_node = __position._M_node->_M_prev; in erase()
[all …]
Dstl_tree.h132 _Base_ptr _M_node; member
137 if (_M_node->_M_right != 0) in _M_increment()
139 _M_node = _M_node->_M_right; in _M_increment()
140 while (_M_node->_M_left != 0) in _M_increment()
141 _M_node = _M_node->_M_left; in _M_increment()
145 _Base_ptr __y = _M_node->_M_parent; in _M_increment()
146 while (_M_node == __y->_M_right) in _M_increment()
148 _M_node = __y; in _M_increment()
151 if (_M_node->_M_right != __y) in _M_increment()
152 _M_node = __y; in _M_increment()
[all …]
Dstl_deque.h118 _Map_pointer _M_node; member
122 _M_last(*__y + _S_buffer_size()), _M_node(__y) {} in _Deque_iterator()
123 _Deque_iterator() : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) {} in _Deque_iterator()
126 _M_last(__x._M_last), _M_node(__x._M_node) {} in _Deque_iterator()
134 _M_set_node(_M_node + 1);
147 _M_set_node(_M_node - 1);
168 _M_set_node(_M_node + __node_offset);
199 _M_node = __new_node; in _M_set_node()
247 return (__x._M_node == __y._M_node) ?
248 (__x._M_cur < __y._M_cur) : (__x._M_node < __y._M_node);
[all …]
/openbsd/src/gnu/usr.bin/gcc/gcc/testsuite/g++.dg/opt/
Dalias2.C9 int* _M_node; member
11 _Deque_iterator() : _M_cur(0), _M_node(0) {} in _Deque_iterator()
14 _M_node(__x._M_node) {} in _Deque_iterator()
33 printf ("bb %x %x\n", this, *_M_start._M_node); in ~_Deque_base()
42 _M_start._M_node = &yy; in _M_initialize_map()
/openbsd/src/gnu/lib/libstdc++/libstdc++/include/ext/
Dslist159 _Slist_node_base* _M_node;
161 _Slist_iterator_base(_Slist_node_base* __x) : _M_node(__x) {}
162 void _M_incr() { _M_node = _M_node->_M_next; }
165 return _M_node == __x._M_node;
168 return _M_node != __x._M_node;
186 _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x._M_node) {}
188 reference operator*() const { return ((_Node*) _M_node)->_M_data; }
454 return iterator((_Node*) __slist_previous(&this->_M_head, __pos._M_node));
458 __pos._M_node));
503 return iterator(_M_insert_after(__pos._M_node, __x));
[all …]
/openbsd/src/gnu/gcc/libstdc++-v3/include/ext/
Dslist165 _Slist_node_base* _M_node;
168 : _M_node(__x) {}
172 { _M_node = _M_node->_M_next; }
176 { return _M_node == __x._M_node; }
180 { return _M_node != __x._M_node; }
203 : _Slist_iterator_base(__x._M_node) {}
207 { return ((_Node*) _M_node)->_M_data; }
502 __pos._M_node)); }
507 __pos._M_node)); }
558 { return iterator(_M_insert_after(__pos._M_node, __x)); }
[all …]
/openbsd/src/gnu/llvm/clang/www/
Dlibstdc++4.4-clang0x.patch162 _List_node_base::swap(this->_M_impl._M_node, __x._M_impl._M_node);
/openbsd/src/gnu/llvm/lldb/docs/use/
Dvariable.rst54 _M_node = 0x000000000062cec8
60 _M_node = 0x000000000062ced0