Searched refs:__p (Results 26 - 50 of 71) sorted by relevance

123

/freebsd-10.2-release/contrib/libstdc++/include/tr1/
H A Dhashtable_policy.h200 _Node_iterator_base(_Hash_node<_Value, __cache>* __p) argument
201 : _M_cur(__p) { }
242 _Node_iterator(_Hash_node<_Value, __cache>* __p) argument
243 : _Node_iterator_base<_Value, __cache>(__p) { }
283 _Node_const_iterator(_Hash_node<_Value, __cache>* __p) argument
284 : _Node_iterator_base<_Value, __cache>(__p) { }
382 _Hashtable_iterator(_Hash_node<_Value, __cache>* __p, argument
384 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
427 _Hashtable_const_iterator(_Hash_node<_Value, __cache>* __p, argument
429 : _Hashtable_iterator_base<_Value, __cache>(__p, __
536 const unsigned long* __p = std::lower_bound(_Primes<>::__primes, __last, local
552 const unsigned long* __p = std::lower_bound(_Primes<>::__primes, __last, local
582 const unsigned long* __p = std::lower_bound(_Primes<>::__primes, local
645 typename _Hashtable::_Node* __p = local
719 _M_bucket_index(const _Hash_node<_Value, false>* __p, std::size_t __n) const argument
798 _M_bucket_index(const _Hash_node<_Value, false>* __p, std::size_t __n) const argument
865 _M_bucket_index(const _Hash_node<_Value, true>* __p, std::size_t __n) const argument
[all...]
H A Dfunctional_hash.h81 operator()(_Tp* __p) const
82 { return reinterpret_cast<std::size_t>(__p); }
/freebsd-10.2-release/contrib/libstdc++/include/bits/
H A Dstl_pair.h89 pair(const pair<_U1, _U2>& __p) argument
90 : first(__p.first), second(__p.second) { }
H A Dbasic_string.h185 void* __p = reinterpret_cast<void*>(&_S_empty_rep_storage); local
186 return *reinterpret_cast<_Rep*>(__p);
283 _M_data(_CharT* __p) argument
284 { return (_M_dataplus._M_p = __p); }
371 _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2) argument
373 for (; __k1 != __k2; ++__k1, ++__p)
374 traits_type::assign(*__p, *__k1); // These types are off.
378 _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2) argument
379 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
382 _S_copy_chars(_CharT* __p, const_iterato argument
386 _S_copy_chars(_CharT* __p, _CharT* __k1, _CharT* __k2) argument
390 _S_copy_chars(_CharT* __p, const _CharT* __k1, const _CharT* __k2) argument
972 insert(iterator __p, size_type __n, _CharT __c) argument
988 insert(iterator __p, _InputIterator __beg, _InputIterator __end) argument
1106 insert(iterator __p, _CharT __c) argument
[all...]
H A Dstl_tree.h321 _Rb_tree_node_base* __p,
372 _M_put_node(_Rb_tree_node* __p) argument
373 { _M_impl._Node_allocator::deallocate(__p, 1); }
400 _M_destroy_node(_Link_type __p) argument
402 get_allocator().destroy(&__p->_M_value_field);
403 _M_put_node(__p);
581 _M_copy(_Const_Link_type __x, _Link_type __p);
849 _M_insert(_Base_ptr __x, _Base_ptr __p, const _Val& __v) argument
851 bool __insert_left = (__x != 0 || __p == _M_end()
853 _S_key(__p)));
867 _M_insert_lower(_Base_ptr __x, _Base_ptr __p, const _Val& __v) argument
885 _M_insert(_Const_Base_ptr __x, _Const_Base_ptr __p, const _Val& __v) argument
1291 pair<iterator, iterator> __p = equal_range(__x); local
1301 _M_copy(_Const_Link_type __x, _Link_type __p) argument
1434 pair<const_iterator, const_iterator> __p = equal_range(__k); local
[all...]
H A Dstl_function.h591 operator()(_Tp* __p) const
592 { return (__p->*_M_f)(); }
607 operator()(const _Tp* __p) const
608 { return (__p->*_M_f)(); }
655 operator()(_Tp* __p, _Arg __x) const argument
656 { return (__p->*_M_f)(__x); }
671 operator()(const _Tp* __p, _Arg __x) const argument
672 { return (__p->*_M_f)(__x); }
H A Dboost_concept_check.h734 __c.insert(__p, __t);
735 __c.insert(__p, __n, __t);
736 __c.insert(__p, __first, __last);
738 __c.erase(__p);
739 __c.erase(__p, __q);
751 typename _Sequence::iterator __p, __q;
896 __p = __c.upper_bound(__k);
897 __p = __c.lower_bound(__k);
900 __c.insert(__p, __t);
918 _Iterator __p;
[all...]
H A Dstl_list.h324 _M_put_node(_List_node<_Tp>* __p) argument
325 { _M_impl._Node_alloc_type::deallocate(__p, 1); }
460 _Node* __p = this->_M_get_node(); local
463 _M_get_Tp_allocator().construct(&__p->_M_data, __x);
467 _M_put_node(__p);
470 return __p;
H A Dstl_set.h306 std::pair<typename _Rep_type::iterator, bool> __p = local
308 return std::pair<iterator, bool>(__p.first, __p.second);
H A Dstreambuf_iterator.h379 const _CharT* __p = traits_type::find(__sb->gptr(), local
381 if (__p)
382 __n = __p - __sb->gptr();
/freebsd-10.2-release/contrib/libstdc++/config/locale/generic/
H A Dc_locale.cc122 int __p = sscanf(__s, "%Lf", &__ld); local
123 if (__p && static_cast<int_type>(__p) != char_traits<char>::eof()
/freebsd-10.2-release/contrib/libstdc++/include/backward/
H A Diterator.h165 construct(_T1* __p, const _T2& __value) argument
166 { std::_Construct(__p, __value); }
170 construct(_T1* __p) argument
171 { std::_Construct(__p); }
/freebsd-10.2-release/contrib/libc++/src/
H A Dthread.cpp138 static __thread_specific_ptr<__thread_struct> __p; local
139 return __p;
152 void deallocate(T* __p, size_t) {::operator delete(static_cast<void*>(__p));} argument
H A Dstrstream.cpp231 off_type __p(-1);
280 __p = newoff;
283 return pos_type(__p);
289 off_type __p(-1);
310 __p = newoff;
314 return pos_type(__p);
/freebsd-10.2-release/contrib/llvm/tools/clang/lib/Headers/
H A Davxintrin.h757 _mm256_load_pd(double const *__p) argument
759 return *(__m256d *)__p;
763 _mm256_load_ps(float const *__p) argument
765 return *(__m256 *)__p;
769 _mm256_loadu_pd(double const *__p) argument
774 return ((struct __loadu_pd*)__p)->__v;
778 _mm256_loadu_ps(float const *__p) argument
783 return ((struct __loadu_ps*)__p)->__v;
787 _mm256_load_si256(__m256i const *__p) argument
789 return *__p;
793 _mm256_loadu_si256(__m256i const *__p) argument
802 _mm256_lddqu_si256(__m256i const *__p) argument
809 _mm256_store_pd(double *__p, __m256d __a) argument
815 _mm256_store_ps(float *__p, __m256 __a) argument
821 _mm256_storeu_pd(double *__p, __m256d __a) argument
827 _mm256_storeu_ps(float *__p, __m256 __a) argument
833 _mm256_store_si256(__m256i *__p, __m256i __a) argument
839 _mm256_storeu_si256(__m256i *__p, __m256i __a) argument
846 _mm_maskload_pd(double const *__p, __m128d __m) argument
852 _mm256_maskload_pd(double const *__p, __m256d __m) argument
859 _mm_maskload_ps(float const *__p, __m128 __m) argument
865 _mm256_maskload_ps(float const *__p, __m256 __m) argument
872 _mm256_maskstore_ps(float *__p, __m256 __m, __m256 __a) argument
878 _mm_maskstore_pd(double *__p, __m128d __m, __m128d __a) argument
884 _mm256_maskstore_pd(double *__p, __m256d __m, __m256d __a) argument
890 _mm_maskstore_ps(float *__p, __m128 __m, __m128 __a) argument
909 _mm256_stream_ps(float *__p, __m256 __a) argument
[all...]
H A Demmintrin.h1063 _mm_load_si128(__m128i const *__p) argument
1065 return *__p;
1069 _mm_loadu_si128(__m128i const *__p) argument
1074 return ((struct __loadu_si128*)__p)->__v;
1078 _mm_loadl_epi64(__m128i const *__p) argument
1083 return (__m128i) { ((struct __mm_loadl_epi64_struct*)__p)->__u, 0};
1177 _mm_store_si128(__m128i *__p, __m128i __b) argument
1179 *__p = __b;
1183 _mm_storeu_si128(__m128i *__p, __m128i __b) argument
1185 __builtin_ia32_storedqu((char *)__p, (__v16q
1189 _mm_maskmoveu_si128(__m128i __d, __m128i __n, char *__p) argument
1195 _mm_storel_epi64(__m128i *__p, __m128i __a) argument
1204 _mm_stream_pd(double *__p, __m128d __a) argument
1210 _mm_stream_si128(__m128i *__p, __m128i __a) argument
1216 _mm_stream_si32(int *__p, int __a) argument
1223 _mm_stream_si64(long long *__p, long long __a) argument
1230 _mm_clflush(void const *__p) argument
[all...]
/freebsd-10.2-release/contrib/libstdc++/include/ext/
H A Dmt_allocator.h227 _M_reclaim_block(char* __p, size_t __bytes);
338 _M_reclaim_block(char* __p, size_t __bytes);
595 construct(pointer __p, const _Tp& __val) argument
596 { ::new(__p) _Tp(__val); }
599 destroy(pointer __p) { __p->~_Tp(); } argument
653 deallocate(pointer __p, size_type __n);
717 deallocate(pointer __p, size_type __n) argument
719 if (__builtin_expect(__p != 0, true))
726 ::operator delete(__p);
[all...]
H A Dbitmap_allocator.h103 deallocate(pointer __p, size_type) argument
104 { ::operator delete(__p); }
285 __find_if(_InputIterator __first, _InputIterator __last, _Predicate __p) argument
287 while (__first != __last && !__p(*__first))
946 _M_deallocate_single_object(pointer __p) throw() argument
951 _Alloc_block* __real_p = reinterpret_cast<_Alloc_block*>(__p);
1069 deallocate(pointer __p, size_type __n) throw() argument
1071 if (__builtin_expect(__p != 0, true))
1074 this->_M_deallocate_single_object(__p);
1076 ::operator delete(__p);
1093 construct(pointer __p, const_reference __data) argument
1097 destroy(pointer __p) argument
[all...]
/freebsd-10.2-release/contrib/libstdc++/include/c_std/
H A Dstd_cstring.h101 memchr(void* __p, int __c, size_t __n) argument
102 { return memchr(const_cast<const void*>(__p), __c, __n); }
H A Dstd_cwchar.h211 wcschr(wchar_t* __p, wchar_t __c) argument
212 { return wcschr(const_cast<const wchar_t*>(__p), __c); }
223 wcsrchr(wchar_t* __p, wchar_t __c) argument
224 { return wcsrchr(const_cast<const wchar_t*>(__p), __c); }
235 wmemchr(wchar_t* __p, wchar_t __c, size_t __n) argument
236 { return wmemchr(const_cast<const wchar_t*>(__p), __c, __n); }
/freebsd-10.2-release/sys/dev/hpt27xx/
H A Dosm.h229 char *__p = fmt;\
231 if (__p[0]=='<' && __p[2]=='>') {\
232 __level = __p[1] - '0';\
233 __p += 3;\
237 os_printk(__p, ##args);\
/freebsd-10.2-release/contrib/libstdc++/src/
H A Dtree.cc168 _Rb_tree_node_base* __p,
174 __x->_M_parent = __p;
185 __p->_M_left = __x; // also makes leftmost = __x when __p == &__header
187 if (__p == &__header)
192 else if (__p == __header._M_left)
197 __p->_M_right = __x;
199 if (__p == __header._M_right)
166 _Rb_tree_insert_and_rebalance(const bool __insert_left, _Rb_tree_node_base* __x, _Rb_tree_node_base* __p, _Rb_tree_node_base& __header) argument
/freebsd-10.2-release/sys/i386/include/
H A Dpcpu.h121 __pcpu_type(name) *__p; \
124 : "=r" (__p) \
128 __p; \
/freebsd-10.2-release/sys/amd64/include/
H A Dpcpu.h102 __pcpu_type(name) *__p; \
105 : "=r" (__p) \
109 __p; \
/freebsd-10.2-release/sys/sys/
H A Dlinker.h220 type *__p; \
221 __p = (type *)preload_search_info((mdp), MODINFO_METADATA | (info)); \
222 __p ? *__p : 0; \

Completed in 140 milliseconds

123