Searched refs:__p (Results 51 - 64 of 64) sorted by relevance

123

/external/stlport/stlport/stl/
H A D_string.h367 void _M_construct_null(_CharT* __p) const
368 { _STLP_STD::_Construct(__p); }
658 iterator insert(iterator __p, _CharT __c) { argument
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, argument
705 __p
741 _M_insert_dispatch(iterator __p, _Integer __n, _Integer __x, const __true_type& ) argument
746 _M_insert_dispatch(iterator __p, _InputIter __first, _InputIter __last, const __false_type& ) argument
772 insert(iterator __p, _InputIter __first, _InputIter __last) argument
781 insert(iterator __p, const _CharT* __f, const _CharT* __l) argument
[all...]
H A D_string.c256 _CharT* basic_string<_CharT,_Traits,_Alloc> ::_M_insert_aux(_CharT* __p, argument
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);
H A D_algo.c133 _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
[all...]
H A D_istream.c654 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.
1042 const _CharT* __p = __scan_delim(__buf->_M_gptr(), __last);
1043 ptrdiff_t __chunk = __p - __buf->_M_gptr();
1047 if (__extract_delim && __p !
[all...]
H A D_tree.c625 _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;
624 _M_copy(_Rb_tree_node_base* __x, _Rb_tree_node_base* __p) argument
H A D_bvector.h807 for (__chunk_type* __p = this->_M_start._M_p; __p != this->_M_end_of_storage._M_data; ++__p)
808 *__p = ~*__p;
H A D_algobase.c255 _ForwardIter2 __p = __p1; local
259 while (__pred(*__current, *__p)) {
260 if (++__p == __last2)
H A D_num_get.h159 ios_base::iostate& __err, void*& __p) const;
H A D_num_get.c589 void*& __p) const {
597 __p = __REINTERPRET_CAST(void*, __val);
H A D_valarray.h104 valarray(const value_type* __p, size_t __n) : _Valarray_base<_Tp>(__n) argument
105 { uninitialized_copy(__p, __p + __n, this->_M_first); }
H A D_rope.c740 _Rope_find_char_char_consumer(_CharT __p) argument
741 : _M_pattern(__p), _M_count(0) {}
/external/clang/test/Analysis/
H A Dinline.cpp10 inline void* operator new(size_t, void* __p) throw() argument
12 return __p;
/external/stlport/stlport/stl/debug/
H A D_iterator.h382 __construct_checker(const value_type* __p) { argument
383 _STLP_VERBOSE_ASSERT((__p != 0), _StlMsg_INVALID_ARGUMENT)
/external/tcpdump/
H A Dprint-802_11.c1135 #define IS_EXTENDED(__p) \
1136 (EXTRACT_LE_32BITS(__p) & BIT(IEEE80211_RADIOTAP_EXT)) != 0

Completed in 226 milliseconds

123