/ndk/tests/device/test-stlport_shared-exception/jni/ |
alias2.cpp | 9 int* _M_node; 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;
|
/ndk/tests/device/test-stlport_static-exception/jni/ |
alias2.cpp | 9 int* _M_node; 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;
|
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
forward_list.h | 132 : _M_node() { } 136 : _M_node(__n) { } 140 { return *static_cast<_Node*>(this->_M_node)->_M_valptr(); } 144 { return static_cast<_Node*>(this->_M_node)->_M_valptr(); } 149 _M_node = _M_node->_M_next; 157 _M_node = _M_node->_M_next; 163 { return _M_node == __x._M_node; } [all...] |
stl_list.h | 137 : _M_node() { } 141 : _M_node(__x) { } 150 { return static_cast<_Node*>(_M_node)->_M_data; } 154 { return std::__addressof(static_cast<_Node*>(_M_node)->_M_data); } 159 _M_node = _M_node->_M_next; 167 _M_node = _M_node->_M_next; 174 _M_node = _M_node->_M_prev [all...] |
stl_tree.h | 186 : _M_node() { } 190 : _M_node(__x) { } 194 { return *static_cast<_Link_type>(_M_node)->_M_valptr(); } 198 { return static_cast<_Link_type> (_M_node)->_M_valptr(); } 203 _M_node = _Rb_tree_increment(_M_node); 211 _M_node = _Rb_tree_increment(_M_node); 218 _M_node = _Rb_tree_decrement(_M_node); [all...] |
/external/stlport/stlport/stl/debug/ |
_debug.h | 343 _M_node._M_owner = __REINTERPRET_CAST(__owned_list*,__o); 344 _M_node._M_next = 0; 350 _M_node._Invalidate(); 352 const void* _Owner() const { return (const void*)_M_node._M_owner; } 353 void* _Owner() { return (void*)_M_node._M_owner; } 354 bool _Valid() const { return _M_node._M_owner != 0; } 355 void _Invalidate() { _M_node._M_owner = 0; } 357 __owned_link* _First() { return _M_node._Next(); } 360 const __owned_link* _First() const { return (__owned_link*)_M_node._M_next; } 368 mutable __owned_link _M_node; [all...] |
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
_debug.h | 343 _M_node._M_owner = __REINTERPRET_CAST(__owned_list*,__o); 344 _M_node._M_next = 0; 350 _M_node._Invalidate(); 352 const void* _Owner() const { return (const void*)_M_node._M_owner; } 353 void* _Owner() { return (void*)_M_node._M_owner; } 354 bool _Valid() const { return _M_node._M_owner != 0; } 355 void _Invalidate() { _M_node._M_owner = 0; } 357 __owned_link* _First() { return _M_node._Next(); } 360 const __owned_link* _First() const { return (__owned_link*)_M_node._M_next; } 368 mutable __owned_link _M_node; [all...] |
/prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/debug/ |
_debug.h | 343 _M_node._M_owner = __REINTERPRET_CAST(__owned_list*,__o); 344 _M_node._M_next = 0; 350 _M_node._Invalidate(); 352 const void* _Owner() const { return (const void*)_M_node._M_owner; } 353 void* _Owner() { return (void*)_M_node._M_owner; } 354 bool _Valid() const { return _M_node._M_owner != 0; } 355 void _Invalidate() { _M_node._M_owner = 0; } 357 __owned_link* _First() { return _M_node._Next(); } 360 const __owned_link* _First() const { return (__owned_link*)_M_node._M_next; } 368 mutable __owned_link _M_node; [all...] |
/prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/debug/ |
_debug.h | 343 _M_node._M_owner = __REINTERPRET_CAST(__owned_list*,__o); 344 _M_node._M_next = 0; 350 _M_node._Invalidate(); 352 const void* _Owner() const { return (const void*)_M_node._M_owner; } 353 void* _Owner() { return (void*)_M_node._M_owner; } 354 bool _Valid() const { return _M_node._M_owner != 0; } 355 void _Invalidate() { _M_node._M_owner = 0; } 357 __owned_link* _First() { return _M_node._Next(); } 360 const __owned_link* _First() const { return (__owned_link*)_M_node._M_next; } 368 mutable __owned_link _M_node; [all...] |
/prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/debug/ |
_debug.h | 343 _M_node._M_owner = __REINTERPRET_CAST(__owned_list*,__o); 344 _M_node._M_next = 0; 350 _M_node._Invalidate(); 352 const void* _Owner() const { return (const void*)_M_node._M_owner; } 353 void* _Owner() { return (void*)_M_node._M_owner; } 354 bool _Valid() const { return _M_node._M_owner != 0; } 355 void _Invalidate() { _M_node._M_owner = 0; } 357 __owned_link* _First() { return _M_node._Next(); } 360 const __owned_link* _First() const { return (__owned_link*)_M_node._M_next; } 368 mutable __owned_link _M_node; [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
forward_list.h | 122 : _M_node() { } 126 : _M_node(__n) { } 130 { return static_cast<_Node*>(this->_M_node)->_M_value; } 135 (this->_M_node)->_M_value); } 140 _M_node = _M_node->_M_next; 148 _M_node = _M_node->_M_next; 154 { return _M_node == __x._M_node; } [all...] |
/prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/debug/ |
_debug.h | 343 _M_node._M_owner = __REINTERPRET_CAST(__owned_list*,__o); 344 _M_node._M_next = 0; 350 _M_node._Invalidate(); 352 const void* _Owner() const { return (const void*)_M_node._M_owner; } 353 void* _Owner() { return (void*)_M_node._M_owner; } 354 bool _Valid() const { return _M_node._M_owner != 0; } 355 void _Invalidate() { _M_node._M_owner = 0; } 357 __owned_link* _First() { return _M_node._Next(); } 360 const __owned_link* _First() const { return (__owned_link*)_M_node._M_next; } 368 mutable __owned_link _M_node; [all...] |
/prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/debug/ |
_debug.h | 343 _M_node._M_owner = __REINTERPRET_CAST(__owned_list*,__o); 344 _M_node._M_next = 0; 350 _M_node._Invalidate(); 352 const void* _Owner() const { return (const void*)_M_node._M_owner; } 353 void* _Owner() { return (void*)_M_node._M_owner; } 354 bool _Valid() const { return _M_node._M_owner != 0; } 355 void _Invalidate() { _M_node._M_owner = 0; } 357 __owned_link* _First() { return _M_node._Next(); } 360 const __owned_link* _First() const { return (__owned_link*)_M_node._M_next; } 368 mutable __owned_link _M_node; [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
forward_list.h | 122 : _M_node() { } 126 : _M_node(__n) { } 130 { return static_cast<_Node*>(this->_M_node)->_M_value; } 135 (this->_M_node)->_M_value); } 140 _M_node = _M_node->_M_next; 148 _M_node = _M_node->_M_next; 154 { return _M_node == __x._M_node; } [all...] |
/external/stlport/stlport/stl/ |
_list.h | 87 _List_node_base* _M_node; 89 _List_iterator_base(_List_node_base* __x) : _M_node(__x) {} 91 void _M_incr() { _M_node = _M_node->_M_next; } 92 void _M_decr() { _M_node = _M_node->_M_prev; } 116 _List_iterator(const iterator& __x) : _List_iterator_base(__x._M_node) {} 118 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; } 141 return this->_M_node == __y._M_node; [all...] |
_slist.h | 70 _Slist_node_base *_M_node; 72 _Slist_iterator_base(_Slist_node_base *__x) : _M_node(__x) {} 75 _M_node = _M_node->_M_next; 100 _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x._M_node) {} 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; [all...] |
_tree.h | 140 _Base_ptr _M_node; 141 _Rb_tree_base_iterator() : _M_node(0) {} 142 _Rb_tree_base_iterator(_Base_ptr __x) : _M_node(__x) {} 168 _Rb_tree_iterator(const iterator& __it) : _Rb_tree_base_iterator(__it._M_node) {} 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 [all...] |
/ndk/sources/cxx-stl/stlport/stlport/stl/ |
_list.h | 87 _List_node_base* _M_node; 89 _List_iterator_base(_List_node_base* __x) : _M_node(__x) {} 91 void _M_incr() { _M_node = _M_node->_M_next; } 92 void _M_decr() { _M_node = _M_node->_M_prev; } 116 _List_iterator(const iterator& __x) : _List_iterator_base(__x._M_node) {} 118 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; } 141 return this->_M_node == __y._M_node; [all...] |
_slist.h | 70 _Slist_node_base *_M_node; 72 _Slist_iterator_base(_Slist_node_base *__x) : _M_node(__x) {} 75 _M_node = _M_node->_M_next; 100 _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x._M_node) {} 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; [all...] |
_tree.h | 140 _Base_ptr _M_node; 141 _Rb_tree_base_iterator() : _M_node(0) {} 142 _Rb_tree_base_iterator(_Base_ptr __x) : _M_node(__x) {} 168 _Rb_tree_iterator(const iterator& __it) : _Rb_tree_base_iterator(__it._M_node) {} 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 [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/bits/ |
forward_list.h | 129 : _M_node() { } 133 : _M_node(__n) { } 137 { return static_cast<_Node*>(this->_M_node)->_M_value; } 142 (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; } [all...] |
stl_list.h | 136 : _M_node() { } 140 : _M_node(__x) { } 145 { return static_cast<_Node*>(_M_node)->_M_data; } 149 { return std::__addressof(static_cast<_Node*>(_M_node)->_M_data); } 154 _M_node = _M_node->_M_next; 162 _M_node = _M_node->_M_next; 169 _M_node = _M_node->_M_prev [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
forward_list.h | 133 : _M_node() { } 137 : _M_node(__n) { } 141 { return *static_cast<_Node*>(this->_M_node)->_M_valptr(); } 145 { return static_cast<_Node*>(this->_M_node)->_M_valptr(); } 150 _M_node = _M_node->_M_next; 158 _M_node = _M_node->_M_next; 164 { return _M_node == __x._M_node; } [all...] |
hashtable_policy.h | [all...] |
stl_deque.h | 126 _Map_pointer _M_node; 130 _M_last(*__y + _S_buffer_size()), _M_node(__y) { } 133 : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) { } 137 _M_last(__x._M_last), _M_node(__x._M_node) { } 153 _M_set_node(_M_node + 1); 172 _M_set_node(_M_node - 1); 199 _M_set_node(_M_node + __node_offset); 236 _M_node = __new_node; 275 { return (__x._M_node == __y._M_node) ? (__x._M_cur < __y._M_cur [all...] |