/external/stlport/stlport/stl/ |
H A D | _carray.h | 39 _Copy_Construct(__REINTERPRET_CAST(_Tp*, _M_data + __i * sizeof(_Tp)), __val); 44 _Destroy_Range(__REINTERPRET_CAST(_Tp*, _M_data + 0), 45 __REINTERPRET_CAST(_Tp*, _M_data + _Nb * sizeof(_Tp))); 50 return *__REINTERPRET_CAST(_Tp*, _M_data + __i * sizeof(_Tp)); 54 char _M_data[sizeof(_Tp) * _Nb];
|
H A D | _string_base.h | 34 // allocator and whose size is _M_end_of_storage - _M_start_of_storage._M_data. 64 { return (_M_start_of_storage._M_data == _M_buffers._M_static_buf); } 65 _Tp const* _M_Start() const { return _M_start_of_storage._M_data; } 66 _Tp* _M_Start() { return _M_start_of_storage._M_data; } 72 { return _M_using_static_buf() ? static_cast<size_type>(_DEFAULT_SIZE) : _M_buffers._M_end_of_storage - _M_start_of_storage._M_data; } 76 _Tp const* _M_Start() const { return _M_start_of_storage._M_data; } 77 _Tp* _M_Start() { return _M_start_of_storage._M_data; } 81 { return _M_end_of_storage - _M_start_of_storage._M_data; } 96 if (!_M_using_static_buf() && (_M_start_of_storage._M_data != 0)) 97 _M_start_of_storage.deallocate(_M_start_of_storage._M_data, _M_buffer [all...] |
H A D | _slist.c | 50 _STLP_STD::_Destroy(&__tmp->_M_data); 65 /* When building STLport lib Digital Mars Compiler complains on the _M_data assignment 72 _Node_base* __p1 = &this->_M_head._M_data; 73 _Node_base* __n1 = this->_M_head._M_data._M_next; 74 const _Node_base* __n2 = __x._M_head._M_data._M_next; 76 __STATIC_CAST(_Node*, __n1)->_M_data = __STATIC_CAST(const _Node*, __n2)->_M_data; 92 _Node_base* __prev = &this->_M_head._M_data; 93 _Node_base* __node = this->_M_head._M_data._M_next; 95 __STATIC_CAST(_Node*, __node)->_M_data [all...] |
H A D | _rope.c | 60 : _Rope_iterator_base<_CharT,_Alloc>(__r->_M_tree_ptr._M_data, __pos), 65 _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr._M_data, __pos), 79 size_t _p_size = _M_size._M_data + 1; 92 const _RopeRep* __leaf = __x._M_path_end._M_data[__x._M_leaf_index]; 99 __x._M_buf_start = __STATIC_CAST(const _RopeLeaf*, __leaf)->_M_data; 101 __x._M_buf_end = __x._M_buf_start + __leaf->_M_size._M_data; 108 size_t __leaf_end = __leaf_pos + __leaf->_M_size._M_data; 121 (*__fn)(__buf_start_pos - __leaf_pos, __len, __x._M_tmp_buf._M_data); 122 __x._M_buf_ptr = __x._M_tmp_buf._M_data + (__pos - __buf_start_pos); 123 __x._M_buf_start = __x._M_tmp_buf._M_data; [all...] |
H A D | _slist.h | 61 _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 | _tree.h | 257 _M_rebind(&src.get()._M_header._M_data); 263 _M_header._M_data._M_color = _S_rb_tree_red; // used to distinguish header from 265 _M_header._M_data._M_parent = 0; 266 _M_header._M_data._M_left = &_M_header._M_data; 267 _M_header._M_data._M_right = &_M_header._M_data; 271 if (_M_header._M_data._M_parent != 0) { 272 _M_header._M_data._M_parent->_M_parent = &_M_header._M_data; [all...] |
H A D | _rope.h | 453 _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...] |
H A D | _list.c | 67 _Node* __cur = __STATIC_CAST(_Node*, _M_node._M_data._M_next); 72 __cur != &(_M_node._M_data)) { 75 _STLP_STD::_Destroy(&__tmp->_M_data); 78 _M_node._M_data._M_next = &_M_node._M_data; 79 _M_node._M_data._M_prev = &_M_node._M_data; 208 if (__that._M_node._M_data._M_next == &__that._M_node._M_data || 209 __that._M_node._M_data [all...] |
H A D | _list.h | 78 _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 | _move_construct_fwk.h | 37 explicit __move_source (_Tp &_src) : _M_data(_src) 41 { return _M_data; } 43 _Tp &_M_data; member in class:__move_source
|
H A D | _bvector.h | 306 _M_end_of_storage._M_data - _M_start._M_p); 392 this->_M_end_of_storage._M_data = __q + _Base::_M_bits_to_chunks(__n); 397 if (this->_M_finish._M_p != this->_M_end_of_storage._M_data) { 410 this->_M_end_of_storage._M_data = __q + _Base::_M_bits_to_chunks(__len); 421 this->_M_end_of_storage._M_data = 0; 463 this->_M_end_of_storage._M_data = __q + _Base::_M_bits_to_chunks(__len); 489 return size_type(const_iterator(this->_M_end_of_storage._M_data, 0) - begin()); 514 fill(this->_M_start._M_p, (__chunk_type*)(this->_M_end_of_storage._M_data), __val ? ~0 : 0); 520 fill(this->_M_start._M_p, (__chunk_type*)(this->_M_end_of_storage._M_data), 0); 533 fill(this->_M_start._M_p, this->_M_end_of_storage._M_data, __ [all...] |
H A D | _tree.c | 330 _M_leftmost() = &this->_M_header._M_data; 331 _M_rightmost() = &this->_M_header._M_data; 334 _M_root() = _M_copy(__x._M_root(), &this->_M_header._M_data); 358 if ( __parent == &this->_M_header._M_data ) { 379 _Rb_global_inst::_Rebalance(__new_node, this->_M_header._M_data._M_parent); 388 _Base_ptr __y = &this->_M_header._M_data; 406 _Base_ptr __y = &this->_M_header._M_data; 434 if (__position._M_node == this->_M_header._M_data._M_left) { // begin() 458 if (__after._M_node == &this->_M_header._M_data) 479 else if (__position._M_node == &this->_M_header._M_data) { // en [all...] |
H A D | _deque.c | 41 if (_M_map._M_data) { 43 _M_map.deallocate(_M_map._M_data, _M_map_size._M_data); 51 _M_map_size._M_data = (max)((size_t) _S_initial_map_size, __num_nodes + 2); 52 _M_map._M_data = _M_map.allocate(_M_map_size._M_data); 54 _Tp** __nstart = _M_map._M_data + (_M_map_size._M_data - __num_nodes) / 2; 60 _STLP_UNWIND((_M_map.deallocate(_M_map._M_data, _M_map_size._M_data), [all...] |
H A D | _alloc.h | 478 _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 | _vector.h | 73 _M_end_of_storage._M_data = _M_start + __n; 82 src.get()._M_finish = src.get()._M_end_of_storage._M_data = src.get()._M_start = 0; 88 _M_end_of_storage.deallocate(_M_start, _M_end_of_storage._M_data - _M_start); 199 size_type capacity() const { return size_type(this->_M_end_of_storage._M_data - this->_M_start); } 265 this->_M_end_of_storage._M_data = this->_M_start + __real_n; 380 if (this->_M_finish != this->_M_end_of_storage._M_data) { 549 if (size_type(this->_M_end_of_storage._M_data - this->_M_finish) >= __n) { 657 this->_M_end_of_storage.deallocate(this->_M_start, this->_M_end_of_storage._M_data - this->_M_start); 662 this->_M_end_of_storage.deallocate(this->_M_start, this->_M_end_of_storage._M_data - this->_M_start); 668 this->_M_end_of_storage._M_data [all...] |
H A D | _vector.c | 172 if (size_type(this->_M_end_of_storage._M_data - this->_M_finish) >= __n) { 193 this->_M_end_of_storage._M_data = this->_M_start + __len;
|
H A D | _string.c | 611 this->_M_start_of_storage._M_data = _M_start_of_storage.allocate(__n, __n); 612 this->_M_finish = this->_M_start_of_storage._M_data; 613 this->_M_buffers._M_end_of_storage = this->_M_start_of_storage._M_data + __n; 616 this->_M_start_of_storage._M_data = _M_start_of_storage.allocate(__n, __n); 617 this->_M_finish = this->_M_start_of_storage._M_data; 618 this->_M_end_of_storage = this->_M_start_of_storage._M_data + __n;
|
H A D | _deque.h | 370 src.get()._M_map._M_data = 0; 371 src.get()._M_map_size._M_data = 0; 1061 if (__nodes_to_add + 1 > this->_M_map_size._M_data - (this->_M_finish._M_node - this->_M_map._M_data)) 1066 if (__nodes_to_add > size_type(this->_M_start._M_node - this->_M_map._M_data))
|
/external/stlport/src/ |
H A D | lock_free_slist.h | 46 _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...] |