| /prebuilt/ndk/android-ndk-r4/platforms/android-8/arch-x86/usr/include/sys/ |
| stat.h | 95 static __inline__ int mkfifo(const char *__p, mode_t __m)
97 return mknod(__p, (__m & ~S_IFMT) | S_IFIFO, (dev_t)0);
|
| /external/stlport/stlport/stl/ |
| _istreambuf_iterator.h | 62 istreambuf_iterator(streambuf_type* __p = 0) { this->_M_init(__p); }
83 void _M_init(streambuf_type* __p) {
84 _M_buf = __p;
85 _M_eof = (__p == 0);
|
| _string_workaround.h | 346 iterator insert(iterator __p, _CharT __c)
347 { return _Base::insert(__p, __c); }
349 void insert(iterator __p, size_t __n, _CharT __c)
350 { _Base::insert(__p, __n, __c); }
355 void insert(iterator __p, _InputIter __first, _InputIter __last) {
357 _M_insert_dispatch(__p, __first, __last, _Integral());
362 void insert(iterator __p, const _CharT* __f, const _CharT* __l) {
364 _M_insert(__p, __f, __l, this->_M_inside(__f));
369 void _M_insert(iterator __p, const _CharT* __f, const _CharT* __l, bool __self_ref) {
371 _Base::_M_insert(__p, __f, __l, __self_ref)
[all...] |
| _auto_ptr.h | 37 auto_ptr_ref(__ptr_base& __r, _Tp* __p) : _M_r(__r), _M_p(__p) { }
|
| _tempbuf.h | 73 inline void _STLP_CALL return_temporary_buffer(_Tp* __p) {
75 free((char*)__p);
|
| _ctype.h | 82 for (const char* __p = __low;__p != __high; ++__p, ++__vec) {
83 *__vec = _M_ctype_table[(unsigned char)*__p];
|
| _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...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _istreambuf_iterator.h | 62 istreambuf_iterator(streambuf_type* __p = 0) { this->_M_init(__p); }
83 void _M_init(streambuf_type* __p) {
84 _M_buf = __p;
85 _M_eof = (__p == 0);
|
| _string_workaround.h | 346 iterator insert(iterator __p, _CharT __c)
347 { return _Base::insert(__p, __c); }
349 void insert(iterator __p, size_t __n, _CharT __c)
350 { _Base::insert(__p, __n, __c); }
355 void insert(iterator __p, _InputIter __first, _InputIter __last) {
357 _M_insert_dispatch(__p, __first, __last, _Integral());
362 void insert(iterator __p, const _CharT* __f, const _CharT* __l) {
364 _M_insert(__p, __f, __l, this->_M_inside(__f));
369 void _M_insert(iterator __p, const _CharT* __f, const _CharT* __l, bool __self_ref) {
371 _Base::_M_insert(__p, __f, __l, __self_ref)
[all...] |
| _auto_ptr.h | 37 auto_ptr_ref(__ptr_base& __r, _Tp* __p) : _M_r(__r), _M_p(__p) { }
|
| _tempbuf.h | 73 inline void _STLP_CALL return_temporary_buffer(_Tp* __p) {
75 free((char*)__p);
|
| _ctype.h | 82 for (const char* __p = __low;__p != __high; ++__p, ++__vec) {
83 *__vec = _M_ctype_table[(unsigned char)*__p];
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/ |
| mt_allocator.h | 224 _M_reclaim_block(char* __p, size_t __bytes);
335 _M_reclaim_block(char* __p, size_t __bytes);
592 construct(pointer __p, const _Tp& __val)
593 { ::new((void *)__p) _Tp(__val); }
598 construct(pointer __p, _Args&&... __args)
599 { ::new((void *)__p) _Tp(std::forward<_Args>(__args)...); }
603 destroy(pointer __p) { __p->~_Tp(); }
658 deallocate(pointer __p, size_type __n);
722 deallocate(pointer __p, size_type __n
[all...] |
| bitmap_allocator.h | 99 deallocate(pointer __p, size_type)
100 { ::operator delete(__p); }
281 __find_if(_InputIterator __first, _InputIterator __last, _Predicate __p)
283 while (__first != __last && !__p(*__first))
944 _M_deallocate_single_object(pointer __p) throw()
949 _Alloc_block* __real_p = reinterpret_cast<_Alloc_block*>(__p);
1067 deallocate(pointer __p, size_type __n) throw()
1069 if (__builtin_expect(__p != 0, true))
1072 this->_M_deallocate_single_object(__p);
1074 ::operator delete(__p);
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1_impl/ |
| functional_hash.h | 49 operator()(_Tp* __p) const
50 { return reinterpret_cast<size_t>(__p); }
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_list.h | 319 _M_put_node(_List_node<_Tp>* __p)
320 { _M_impl._Node_alloc_type::deallocate(__p, 1); }
461 _Node* __p = this->_M_get_node(); local
464 _M_get_Tp_allocator().construct(&__p->_M_data, __x);
468 _M_put_node(__p);
471 return __p;
478 _Node* __p = this->_M_get_node();
481 _M_get_Node_allocator().construct(__p,
486 _M_put_node(__p);
489 return __p;
[all...] |
| stl_function.h | 532 operator()(_Tp* __p) const
533 { return (__p->*_M_f)(); }
550 operator()(const _Tp* __p) const
551 { return (__p->*_M_f)(); }
604 operator()(_Tp* __p, _Arg __x) const
605 { return (__p->*_M_f)(__x); }
622 operator()(const _Tp* __p, _Arg __x) const
623 { return (__p->*_M_f)(__x); }
|
| stl_tree.h | 312 _Rb_tree_node_base* __p,
362 _M_put_node(_Link_type __p)
363 { _M_impl._Node_allocator::deallocate(__p, 1); }
381 _M_destroy_node(_Link_type __p)
383 get_allocator().destroy(&__p->_M_value_field);
384 _M_put_node(__p);
406 _M_destroy_node(_Link_type __p)
408 _M_get_Node_allocator().destroy(__p);
409 _M_put_node(__p);
596 _M_copy(_Const_Link_type __x, _Link_type __p);
1400 pair<iterator, iterator> __p = equal_range(__x); local
1474 pair<const_iterator, const_iterator> __p = equal_range(__k); local
[all...] |
| basic_string.h | 178 void* __p = reinterpret_cast<void*>(&_S_empty_rep_storage); local
179 return *reinterpret_cast<_Rep*>(__p);
276 _M_data(_CharT* __p)
277 { return (_M_dataplus._M_p = __p); }
364 _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)
366 for (; __k1 != __k2; ++__k1, ++__p)
367 traits_type::assign(*__p, *__k1); // These types are off.
371 _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2)
372 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
375 _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2
[all...] |
| /external/stlport/test/unit/ |
| stack_allocator.h | 138 void construct(pointer __p, const_reference __val) { new(__p) _Tp(__val); }
139 void destroy(pointer __p) { __p->~_Tp(); }
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| stack_allocator.h | 138 void construct(pointer __p, const_reference __val) { new(__p) _Tp(__val); }
139 void destroy(pointer __p) { __p->~_Tp(); }
|
| /ndk/tests/device/test-stlport/unit/ |
| stack_allocator.h | 138 void construct(pointer __p, const_reference __val) { new(__p) _Tp(__val); }
139 void destroy(pointer __p) { __p->~_Tp(); }
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/ |
| shadow.h | 111 extern int putspent (__const struct spwd *__p, FILE *__stream);
|
| /external/stlport/stlport/stl/debug/ |
| _hashtable.h | 285 pair<iterator, iterator> __p = equal_range(__key); local
286 size_type __n = _STLP_STD::distance(__p.first, __p.second);
287 _Invalidate_iterators(__p.first, __p.second);
288 _M_non_dbg_impl.erase(__p.first._M_iterator, __p.second._M_iterator);
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _hashtable.h | 285 pair<iterator, iterator> __p = equal_range(__key); local
286 size_type __n = _STLP_STD::distance(__p.first, __p.second);
287 _Invalidate_iterators(__p.first, __p.second);
288 _M_non_dbg_impl.erase(__p.first._M_iterator, __p.second._M_iterator);
|
