| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/ |
| pointer.h | 546 const _Pointer_adapter<_StoreT>& __p)
547 { return (__os << __p.get()); }
|
| sso_string_base.h | 63 _M_data(_CharT* __p)
64 { _M_dataplus._M_p = __p; }
|
| ropeimpl.h | 326 const _CharT* __p = __s; local
328 while (!_S_is0(*__p))
329 ++__p;
330 return (__p - __s);
868 _Rope_find_char_char_consumer(_CharT __p)
869 : _M_pattern(__p), _M_count(0) {}
[all...] |
| /external/stlport/stlport/stl/ |
| _tree.c | 625 _Rb_tree_node_base* __p) {
626 // structural copy. __x and __p must be non-null.
628 _S_parent(__top) = __p;
633 __p = __top;
638 _S_left(__p) = __y;
639 _S_parent(__y) = __p;
642 __p = __y;
|
| _bvector.h | 807 for (__chunk_type* __p = this->_M_start._M_p; __p != this->_M_end_of_storage._M_data; ++__p)
808 *__p = ~*__p;
|
| _num_get.c | 589 void*& __p) const {
597 __p = __REINTERPRET_CAST(void*, __val);
|
| _num_get.h | 159 ios_base::iostate& __err, void*& __p) const;
|
| _valarray.h | 104 valarray(const value_type* __p, size_t __n) : _Valarray_base<_Tp>(__n)
105 { uninitialized_copy(__p, __p + __n, this->_M_first); }
[all...] |
| _rope.c | 740 _Rope_find_char_char_consumer(_CharT __p)
741 : _M_pattern(__p), _M_count(0) {}
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 625 _Rb_tree_node_base* __p) {
626 // structural copy. __x and __p must be non-null.
628 _S_parent(__top) = __p;
633 __p = __top;
638 _S_left(__p) = __y;
639 _S_parent(__y) = __p;
642 __p = __y;
|
| _bvector.h | 807 for (__chunk_type* __p = this->_M_start._M_p; __p != this->_M_end_of_storage._M_data; ++__p)
808 *__p = ~*__p;
|
| _num_get.c | 589 void*& __p) const {
597 __p = __REINTERPRET_CAST(void*, __val);
|
| _num_get.h | 159 ios_base::iostate& __err, void*& __p) const;
|
| _valarray.h | 104 valarray(const value_type* __p, size_t __n) : _Valarray_base<_Tp>(__n)
105 { uninitialized_copy(__p, __p + __n, this->_M_first); }
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_algo.h | 1652 _RandomAccessIterator __p = __first; local
4204 pair<const _Tp*, const _Tp*> __p = local
4213 pair<const _Tp*, const _Tp*> __p = local
4611 _ForwardIterator2 __p; local
[all...] |
| stl_vector.h | 143 _M_deallocate(typename _Tp_alloc_type::pointer __p, size_t __n)
145 if (__p)
146 _M_impl.deallocate(__p, __n);
[all...] |
| stl_deque.h | 448 _M_deallocate_node(_Tp* __p)
450 _M_impl._Tp_alloc_type::deallocate(__p, __deque_buf_size(sizeof(_Tp)));
458 _M_deallocate_map(_Tp** __p, size_t __n)
459 { _M_get_map_allocator().deallocate(__p, __n); }
[all...] |
| char_traits.h | 165 length(const char_type* __p)
168 while (!eq(__p[__i], char_type()))
|
| forward_list.h | 354 _M_put_node(typename _Node::_Pointer __p)
355 { _M_get_Node_allocator().deallocate(__p, 1); }
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/backward/ |
| hashtable.h | 294 _M_put_node(_Node* __p)
295 { _M_node_allocator.deallocate(__p, 1); }
922 _Node* __p = __it._M_cur; local
923 if (__p)
925 const size_type __n = _M_bkt_num(__p->_M_val);
928 if (__cur == __p)
939 if (__next == __p)
[all...] |
| /external/stlport/stlport/stl/debug/ |
| _iterator.h | 382 __construct_checker(const value_type* __p) {
383 _STLP_VERBOSE_ASSERT((__p != 0), _StlMsg_INVALID_ARGUMENT)
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _iterator.h | 382 __construct_checker(const value_type* __p) {
383 _STLP_VERBOSE_ASSERT((__p != 0), _StlMsg_INVALID_ARGUMENT)
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/ |
| thread_db.h | 339 void *__p);
|
| wchar.h | 314 mbstate_t *__p) __THROW;
|
| /external/tcpdump/ |
| print-802_11.c | 1135 #define IS_EXTENDED(__p) \
1136 (EXTRACT_LE_32BITS(__p) & BIT(IEEE80211_RADIOTAP_EXT)) != 0
|
