/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/g++.dg/opt/ |
H A D | alias2.C | 9 int* _M_node; member in struct:_Deque_iterator 11 _Deque_iterator() : _M_cur(0), _M_node(0) {} 14 _M_node(__x._M_node) {} 33 printf ("bb %x %x\n", this, *_M_start._M_node); 42 _M_start._M_node = &yy;
|
H A D | pr44919.C | 18 template<typename _Tp> struct _List_iterator { typedef _List_iterator<_Tp> _Self; typedef _Tp& reference; explicit _List_iterator(_List_node_base* __x) : _M_node(__x) { } reference operator*() const { } _Self& operator++() { } bool operator!=(const _Self& __x) const { return _M_node != __x._M_node; } _List_node_base* _M_node; }; member in struct:std::_List_iterator 19 template<typename _Tp, typename _Alloc> class _List_base { protected: typedef typename _Alloc::template rebind<_List_node >::other _Node_alloc_type; struct _List_impl : public _Node_alloc_type { _List_node_base _M_node; }; _List_impl _M_impl; }; member in struct:std::_List_base::_List_impl 20 template<typename _Tp, typename _Alloc = std::allocator<_Tp> > class list : protected _List_base<_Tp, _Alloc> { public: typedef _Tp value_type; typedef _List_iterator<_Tp> iterator; iterator begin() { } iterator end() { return iterator(&this->_M_impl._M_node); } };
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/g++.dg/opt/ |
H A D | alias2.C | 9 int* _M_node; member in struct:_Deque_iterator 11 _Deque_iterator() : _M_cur(0), _M_node(0) {} 14 _M_node(__x._M_node) {} 33 printf ("bb %x %x\n", this, *_M_start._M_node); 42 _M_start._M_node = &yy;
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/include/bits/ |
H A D | stl_list.h | 123 : _M_node() { } 127 : _M_node(__x) { } 132 { return static_cast<_Node*>(_M_node)->_M_data; } 136 { return &static_cast<_Node*>(_M_node)->_M_data; } 141 _M_node = _M_node->_M_next; 149 _M_node = _M_node->_M_next; 156 _M_node = _M_node 177 _List_node_base* _M_node; member in struct:_GLIBCXX_STD::_List_iterator 259 const _List_node_base* _M_node; member in struct:_GLIBCXX_STD::_List_const_iterator 305 _List_node_base _M_node; member in struct:_GLIBCXX_STD::_List_base::_List_impl [all...] |
H A D | stl_tree.h | 165 : _M_node() { } 169 : _M_node(__x) { } 173 { return static_cast<_Link_type>(_M_node)->_M_value_field; } 177 { return &static_cast<_Link_type>(_M_node)->_M_value_field; } 182 _M_node = _Rb_tree_increment(_M_node); 190 _M_node = _Rb_tree_increment(_M_node); 197 _M_node = _Rb_tree_decrement(_M_node); 217 _Base_ptr _M_node; member in struct:std::_Rb_tree_iterator 292 _Base_ptr _M_node; member in struct:std::_Rb_tree_const_iterator [all...] |
H A D | stl_deque.h | 121 _Map_pointer _M_node; member in struct:_GLIBCXX_STD::_Deque_iterator 125 _M_last(*__y + _S_buffer_size()), _M_node(__y) {} 127 _Deque_iterator() : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) {} 131 _M_last(__x._M_last), _M_node(__x._M_node) {} 147 _M_set_node(_M_node + 1); 166 _M_set_node(_M_node - 1); 193 _M_set_node(_M_node + __node_offset); 231 _M_node = __new_node; 270 { return (__x._M_node [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
H A D | stl_list.h | 125 : _M_node() { } 129 : _M_node(__x) { } 134 { return static_cast<_Node*>(_M_node)->_M_data; } 138 { return &static_cast<_Node*>(_M_node)->_M_data; } 143 _M_node = _M_node->_M_next; 151 _M_node = _M_node->_M_next; 158 _M_node = _M_node 179 _List_node_base* _M_node; member in struct:_List_iterator 259 const _List_node_base* _M_node; member in struct:_List_const_iterator 301 _List_node_base _M_node; member in struct:_List_base::_List_impl [all...] |
H A D | forward_list.h | 130 : _M_node() { } 134 : _M_node(__n) { } 138 { return static_cast<_Node*>(this->_M_node)->_M_value; } 142 { return &static_cast<_Node*>(this->_M_node)->_M_value; } 147 _M_node = _M_node->_M_next; 155 _M_node = _M_node->_M_next; 161 { return _M_node == __x._M_node; } 176 _Fwd_list_node_base* _M_node; member in struct:_Fwd_list_iterator 247 const _Fwd_list_node_base* _M_node; member in struct:_Fwd_list_const_iterator [all...] |
H A D | stl_tree.h | 167 : _M_node() { } 171 : _M_node(__x) { } 175 { return static_cast<_Link_type>(_M_node)->_M_value_field; } 179 { return &static_cast<_Link_type>(_M_node)->_M_value_field; } 184 _M_node = _Rb_tree_increment(_M_node); 192 _M_node = _Rb_tree_increment(_M_node); 199 _M_node = _Rb_tree_decrement(_M_node); 219 _Base_ptr _M_node; member in struct:_Rb_tree_iterator 294 _Base_ptr _M_node; member in struct:_Rb_tree_const_iterator [all...] |
H A D | stl_deque.h | 123 _Map_pointer _M_node; member in struct:_Deque_iterator 127 _M_last(*__y + _S_buffer_size()), _M_node(__y) { } 130 : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) { } 134 _M_last(__x._M_last), _M_node(__x._M_node) { } 150 _M_set_node(_M_node + 1); 169 _M_set_node(_M_node - 1); 196 _M_set_node(_M_node + __node_offset); 233 _M_node = __new_node; 272 { return (__x._M_node [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr22444.C | 94 _Base_ptr _M_node; member in struct:std::_Rb_tree_iterator 101 _Rb_tree_const_iterator(const iterator& __it) : _M_node(__it._M_node) { } 102 _Base_ptr _M_node; member in struct:std::_Rb_tree_const_iterator
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr22444.C | 94 _Base_ptr _M_node; member in struct:std::_Rb_tree_iterator 101 _Rb_tree_const_iterator(const iterator& __it) : _M_node(__it._M_node) { } 102 _Base_ptr _M_node; member in struct:std::_Rb_tree_const_iterator
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/g++.dg/cpp0x/ |
H A D | variadic98.C | 206 _Base_ptr _M_node; member in struct:std::_Rb_tree_iterator 218 explicit _Rb_tree_const_iterator(_Link_type __x) : _M_node(__x) { 220 _Rb_tree_const_iterator(const iterator& __it) : _M_node(__it._M_node) { 222 _Base_ptr _M_node; member in struct:std::_Rb_tree_const_iterator 324 if (__position._M_node == _M_end()) { 325 if (__position._M_node == _M_rightmost()) return _M_insert_(0, _M_rightmost(), __v);
|