Searched defs:_M_data (Results 1 - 6 of 6) sorted by relevance

/external/stlport/src/
H A Dlock_free_slist.h46 _M._M_data._M_top = 0;
47 _M._M_data._M_sequence = 0;
64 // it relative to ebx). Instead, we're using esi for the address of _M_data.
72 "L1_%=: movl %%eax, (%%ebx)\n\t" // __item._M_next = _M._M_data._M_top
73 " leal 1(%%edx),%%ecx\n\t" // new sequence = _M._M_data._M_sequence + 1
78 :"a" (_M._M_data._M_top), "d" (_M._M_data._M_sequence), "c" (__item), "S" (&_M._M_data)
95 " movl (%%eax), %%ebx\n\t" // new top = _M._M_data._M_top->_M_next
96 " leal 1(%%edx),%%ecx\n\t" // new sequence = _M._M_data
137 } _M_data; member in union:_STLP_atomic_freelist::__anon31243
287 } _M_data; member in union:_STLP_atomic_freelist::__anon31245
[all...]
/external/stlport/stlport/stl/
H A D_move_construct_fwk.h37 explicit __move_source (_Tp &_src) : _M_data(_src)
41 { return _M_data; }
43 _Tp &_M_data; member in class:__move_source
H A D_alloc.h478 _Value _M_data; member in class:_STLP_alloc_proxy
481 _MaybeReboundAlloc(__a), _M_data(__p) {}
486 _M_data(_STLP_PRIV _AsMoveSource(src.get()._M_data)) {}
522 _STLP_STD::swap(_M_data, __x._M_data);
H A D_list.h78 _Tp _M_data; member in class:_List_node
118 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; }
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
[all...]
H A D_slist.h61 _Tp _M_data; member in class:_Slist_node
102 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; }
162 { _M_head._M_data._M_next = 0; }
167 { src.get()._M_head._M_data._M_next = 0; }
170 ~_Slist_base() { _M_erase_after(&_M_head._M_data, 0); }
177 _STLP_STD::_Destroy(&__next->_M_data);
256 _Copy_Construct(&__node->_M_data, __x);
267 _STLP_STD::_Construct(&__node->_M_data);
294 { _M_insert_after_fill(&this->_M_head._M_data, __n, _STLP_DEFAULT_CONSTRUCTED(_Tp)); }
297 { _M_insert_after_fill(&this->_M_head._M_data, __
[all...]
H A D_rope.h453 _CharT* _M_data; /* Not necessarily 0 terminated. */ member in struct:_Rope_RopeLeaf
462 this->_M_c_string = _M_data;
472 _M_data(__d) {
486 if (_M_data != this->_M_c_string) {
489 _RopeRep::_S_free_string(_M_data, this->_M_size._M_data, this->get_allocator());
506 __l->_M_size._M_data + __r->_M_size._M_data, __a), _M_left(__l), _M_right(__r)
580 _STLP_ASSERT(__start_pos + __req_len <= this->_M_size._M_data)
581 _STLP_ASSERT(_M_start + this->_M_size._M_data <
782 _RopeRep const*_M_data[4]; member in struct:_Rope_iterator_base::__anon31265
805 _CharT _M_data[15]; member in struct:_Rope_iterator_base::__anon31266
[all...]

Completed in 2043 milliseconds