| /external/stlport/src/ |
| 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._M_sequence +
[all...] |
| /external/stlport/stlport/stl/ |
| _move_construct_fwk.h | 37 explicit __move_source (_Tp &_src) : _M_data(_src)
41 { return _M_data; }
43 _Tp &_M_data;
|
| _alloc.h | 478 _Value _M_data;
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);
|
| _list.h | 78 _Tp _M_data;
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._M_prev = _M_node._M_data._M_next
[all...] |
| _slist.h | 61 _Tp _M_data;
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, __n, __x);
[all...] |
| _rope.h | 453 _CharT* _M_data; /* Not necessarily 0 terminated. */
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 <= _M_base->_M_size._M_data
[all...] |
| /ndk/sources/cxx-stl/stlport/src/ |
| 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._M_sequence +
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _move_construct_fwk.h | 37 explicit __move_source (_Tp &_src) : _M_data(_src)
41 { return _M_data; }
43 _Tp &_M_data;
|
| _alloc.h | 478 _Value _M_data;
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);
|
| _list.h | 78 _Tp _M_data;
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._M_prev = _M_node._M_data._M_next
[all...] |
| _slist.h | 61 _Tp _M_data;
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, __n, __x);
[all...] |
| _rope.h | 453 _CharT* _M_data; /* Not necessarily 0 terminated. */
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 <= _M_base->_M_size._M_data
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| valarray_array.h | 419 _Tp* const __restrict__ _M_data;
428 { std::__valarray_copy_construct(__a._M_data, __i._M_data,
429 __b._M_data, __n); }
436 { std::__valarray_copy_construct(__a._M_data, __n, __s, __b._M_data); }
441 { std::__valarray_fill(__a._M_data, __n, __t); }
446 { std::__valarray_fill(__a._M_data, __n, __s, __t); }
452 { std::__valarray_fill(__a._M_data, __i._M_data, __n, __t);
[all...] |
| stl_list.h | 98 _Tp _M_data;
103 : _List_node_base(), _M_data(std::forward<_Args>(__args)...) { }
131 // Must downcast from List_node_base to _List_node to get to _M_data.
134 { return static_cast<_Node*>(_M_node)->_M_data; }
138 { return &static_cast<_Node*>(_M_node)->_M_data; }
211 // _M_data.
214 { return static_cast<_Node*>(_M_node)->_M_data; }
218 { return &static_cast<_Node*>(_M_node)->_M_data; }
464 _M_get_Tp_allocator().construct(&__p->_M_data, __x);
[all...] |
| basic_string.h | 82 * a single "add" instruction: _Rep::_M_data(), and
87 * The reason you want _M_data pointing to the character array and
272 _M_data() const
276 _M_data(_CharT* __p)
281 { return &((reinterpret_cast<_Rep*> (_M_data()))[-1]); }
287 { return iterator(_M_data()); }
291 { return iterator(_M_data() + this->size()); }
327 return (less<const _CharT*>()(__s, _M_data())
328 || less<const _CharT*>()(_M_data() + this->size(), __s));
552 return iterator(_M_data());
[all...] |
| locale_facets.h | [all...] |
| locale_facets_nonio.h | 183 __cache_type* _M_data;
220 __date[0] = _M_data->_M_date_format;
221 __date[1] = _M_data->_M_date_era_format;
228 __time[0] = _M_data->_M_time_format;
229 __time[1] = _M_data->_M_time_era_format;
236 __dt[0] = _M_data->_M_date_time_format;
237 __dt[1] = _M_data->_M_date_time_era_format;
242 { __ampm = _M_data->_M_am_pm_format; }
247 __ampm[0] = _M_data->_M_am;
248 __ampm[1] = _M_data->_M_pm
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/ |
| sso_string_base.h | 63 _M_data(_CharT* __p)
76 { return _M_data() == _M_local_data; }
98 { _M_get_allocator().deallocate(_M_data(), __size + 1); }
148 _M_data() const
176 traits_type::assign(_M_data()[__n], _CharT());
278 _M_data(__rcs._M_data());
279 __rcs._M_data(__rcs._M_local_data);
289 __rcs._M_data(_M_data());
[all...] |
| rc_string_base.h | 65 * The reason you want _M_data pointing to the character array and
184 _M_data(_CharT* __p)
189 { return &((reinterpret_cast<_Rep*>(_M_data()))[-1]); }
266 _M_data() const
305 : _M_dataplus(__rcs._M_get_allocator(), __rcs._M_data())
306 { __rcs._M_data(_S_empty_rep._M_refcopy()); }
595 _CharT* __tmp = _M_data();
596 _M_data(__rcs._M_data());
597 __rcs._M_data(__tmp)
[all...] |
