| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _list.h | 285 _Node* __p = this->_M_node.allocate(1); local
287 _Copy_Construct(&__p->_M_data, __x);
289 _STLP_UNWIND(this->_M_node.deallocate(__p, 1))
290 return __p;
295 _Node* __p = this->_M_node.allocate(1); local
297 _STLP_STD::_Construct(&__p->_M_data);
299 _STLP_UNWIND(this->_M_node.deallocate(__p, 1))
300 return __p;
427 _Node_base* __p = __n->_M_prev; local
429 __tmp->_M_prev = __p;
652 _Node_base* __p = &this->_M_node._M_data; local
[all...] |
| _pair.h | 66 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
|
| _string.h | 367 void _M_construct_null(_CharT* __p) const
368 { _STLP_STD::_Construct(__p); }
658 iterator insert(iterator __p, _CharT __c) {
659 _STLP_FIX_LITERAL_BUG(__p)
660 if (__p == end()) {
665 return _M_insert_aux(__p, __c);
668 void insert(iterator __p, size_t __n, _CharT __c);
671 void _M_insert(iterator __p, const _CharT* __first, const _CharT* __last, bool __self_ref);
702 void _M_insertT(iterator __p, _InputIter __first, _InputIter __last,
705 __p = insert(__p, *__first)
[all...] |
| _istream.c | 654 const _CharT* __p = __scan_delim(__first, __last);
655 ptrdiff_t __chunk = (min) (ptrdiff_t(__p - __first), __request);
662 if (__p != __last && __p - __first <= __request) {
937 const _CharT* __p = __scan_delim(__buf->_M_gptr(), __buf->_M_egptr());
938 __buf->_M_gbump((int)(__p - __buf->_M_gptr()));
940 if (__p != __buf->_M_egptr()) { // We found delim, so we're done.
[all...] |
| _string.c | 256 _CharT* basic_string<_CharT,_Traits,_Alloc> ::_M_insert_aux(_CharT* __p,
258 pointer __new_pos = __p;
261 _Traits::move(__p + 1, __p, this->_M_finish - __p);
262 _Traits::assign(*__p, __c);
268 __new_pos = _STLP_PRIV __ucopy(this->_M_Start(), __p, __new_start);
271 __new_finish = _STLP_PRIV __ucopy(__p, this->_M_finish, __new_finish);
|
| _algo.c | 133 _ForwardIter2 __p = __p1;
138 while (*__current == *__p) {
139 if (++__p == __last2)
465 _RandomAccessIter __p = __first; local
469 if (__p > __first + __l) {
470 *__p = *(__p - __l);
471 __p -= __l;
474 *__p = *(__p + __k)
[all...] |
| _algobase.c | 255 _ForwardIter2 __p = __p1; local
259 while (__pred(*__current, *__p)) {
260 if (++__p == __last2)
|
| /external/stlport/stlport/stl/debug/ |
| _string.h | 426 iterator insert(iterator __p, _CharT __c) {
427 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list,__p))
429 typename _Base::iterator __ret = _M_non_dbg_impl.insert(__p._M_iterator, __c);
434 void insert(iterator __p, size_t __n, _CharT __c) {
435 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list,__p))
437 _M_non_dbg_impl.insert(__p._M_iterator, __n, __c);
443 void insert(iterator __p, _InputIter __first, _InputIter __last) {
444 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list,__p))
448 _M_non_dbg_impl.insert(__p._M_iterator,
455 void insert(iterator __p, const _CharT* __f, const _CharT* __l)
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _string.h | 426 iterator insert(iterator __p, _CharT __c) {
427 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list,__p))
429 typename _Base::iterator __ret = _M_non_dbg_impl.insert(__p._M_iterator, __c);
434 void insert(iterator __p, size_t __n, _CharT __c) {
435 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list,__p))
437 _M_non_dbg_impl.insert(__p._M_iterator, __n, __c);
443 void insert(iterator __p, _InputIter __first, _InputIter __last) {
444 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list,__p))
448 _M_non_dbg_impl.insert(__p._M_iterator,
455 void insert(iterator __p, const _CharT* __f, const _CharT* __l)
[all...] |
| /external/kernel-headers/original/asm-x86/ |
| system_32.h | 164 static inline void clflush(volatile void *__p)
166 asm volatile("clflush %0" : "+m" (*(char __force *)__p));
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/ |
| grp.h | 95 extern int putgrent (__const struct group *__restrict __p,
|
| pwd.h | 103 extern int putpwent (__const struct passwd *__restrict __p,
|
| /external/stlport/stlport/stl/ |
| _pair.h | 66 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
|
| _string.h | 367 void _M_construct_null(_CharT* __p) const
368 { _STLP_STD::_Construct(__p); }
658 iterator insert(iterator __p, _CharT __c) {
659 _STLP_FIX_LITERAL_BUG(__p)
660 if (__p == end()) {
665 return _M_insert_aux(__p, __c);
668 void insert(iterator __p, size_t __n, _CharT __c);
671 void _M_insert(iterator __p, const _CharT* __first, const _CharT* __last, bool __self_ref);
702 void _M_insertT(iterator __p, _InputIter __first, _InputIter __last,
705 __p = insert(__p, *__first)
[all...] |
| _istream.c | 654 const _CharT* __p = __scan_delim(__first, __last);
655 ptrdiff_t __chunk = (min) (ptrdiff_t(__p - __first), __request);
662 if (__p != __last && __p - __first <= __request) {
937 const _CharT* __p = __scan_delim(__buf->_M_gptr(), __buf->_M_egptr());
938 __buf->_M_gbump((int)(__p - __buf->_M_gptr()));
940 if (__p != __buf->_M_egptr()) { // We found delim, so we're done.
[all...] |
| _string.c | 256 _CharT* basic_string<_CharT,_Traits,_Alloc> ::_M_insert_aux(_CharT* __p,
258 pointer __new_pos = __p;
261 _Traits::move(__p + 1, __p, this->_M_finish - __p);
262 _Traits::assign(*__p, __c);
268 __new_pos = _STLP_PRIV __ucopy(this->_M_Start(), __p, __new_start);
271 __new_finish = _STLP_PRIV __ucopy(__p, this->_M_finish, __new_finish);
|
| _algo.c | 133 _ForwardIter2 __p = __p1;
138 while (*__current == *__p) {
139 if (++__p == __last2)
465 _RandomAccessIter __p = __first; local
469 if (__p > __first + __l) {
470 *__p = *(__p - __l);
471 __p -= __l;
474 *__p = *(__p + __k)
[all...] |
| _algobase.c | 255 _ForwardIter2 __p = __p1; local
259 while (__pred(*__current, *__p)) {
260 if (++__p == __last2)
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| boost_concept_check.h | 728 __c.insert(__p, __t);
729 __c.insert(__p, __n, __t);
730 __c.insert(__p, __first, __last);
732 __c.erase(__p);
733 __c.erase(__p, __q);
745 typename _Sequence::iterator __p, __q;
|
| stl_set.h | 410 std::pair<typename _Rep_type::iterator, bool> __p = local
412 return std::pair<iterator, bool>(__p.first, __p.second);
|
| streambuf_iterator.h | 371 const _CharT* __p = traits_type::find(__sb->gptr(), local
373 if (__p)
374 __n = __p - __sb->gptr();
|
| stl_bvector.h | 798 void insert(iterator __p, initializer_list<bool> __l)
799 { this->insert(__p, __l.begin(), __l.end()); }
834 for (_Bit_type * __p = this->_M_impl._M_start._M_p;
835 __p != this->_M_impl._M_end_of_storage; ++__p)
836 *__p = ~*__p;
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| base.h | 93 is_parallel(const _Parallelism __p) { return __p != sequential; }
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/ |
| rc_string_base.h | 184 _M_data(_CharT* __p)
185 { _M_dataplus._M_p = __p; }
424 _Rep* __p = new (__place) _Rep; local
425 __p->_M_info._M_capacity = __capacity;
426 return __p;
|
| vstring.h | 881 * @param __p Iterator referencing location in string to insert at.
887 * position referenced by iterator @a __p. If adding
893 insert(iterator __p, size_type __n, _CharT __c)
894 { this->replace(__p, __p, __n, __c); }
898 * @param __p Iterator referencing location in string to insert at.
910 insert(iterator __p, _InputIterator __beg, _InputIterator __end)
911 { this->replace(__p, __p, __beg, __end); }
916 * @param __p Iterator referencing location in string to insert at
[all...] |
