| /src/external/apache2/llvm/dist/libcxx/include/__memory/ |
| allocator.h | 87 void deallocate(_Tp* __p, size_t __n) _NOEXCEPT {
89 ::operator delete(__p); variable
91 _VSTD::__libcpp_deallocate((void*)__p, __n * sizeof(_Tp), _LIBCPP_ALIGNOF(_Tp));
127 void construct(_Up* __p, _Args&&... __args) {
128 ::new ((void*)__p) _Up(_VSTD::forward<_Args>(__args)...);
132 void destroy(pointer __p) {
133 __p->~_Tp();
168 void deallocate(const _Tp* __p, size_t __n) {
170 ::operator delete(const_cast<_Tp*>(__p));
172 _VSTD::__libcpp_deallocate((void*) const_cast<_Tp *>(__p), __n * sizeof(_Tp), _LIBCPP_ALIGNOF(_Tp))
[all...] |
| shared_ptr.h | 61 void operator()(pointer __p) _NOEXCEPT
62 {__alloc_traits::deallocate(__alloc_, __p, __s_);}
235 __shared_ptr_pointer(_Tp __p, _Dp __d, _Alloc __a)
236 : __data_(__compressed_pair<_Tp, _Dp>(__p, _VSTD::move(__d)), _VSTD::move(__a)) {}
449 explicit shared_ptr(_Yp* __p) : __ptr_(__p) {
450 unique_ptr<_Yp> __hold(__p);
453 __cntrl_ = new _CntrlBlk(__p, __shared_ptr_default_delete<_Tp, _Yp>(), _AllocT());
455 __enable_weak_this(__p, __p);
1287 _ET* __p = dynamic_cast<_ET*>(__r.get()); variable
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/config/rs6000/ |
| bmi2intrin.h | 48 _mulx_u32 (unsigned int __X, unsigned int __Y, unsigned int *__P)
51 *__P = (unsigned int) (__res >> 32);
67 unsigned long long *__P)
70 *__P = (unsigned long long) (__res >> 64);
84 unsigned long __p; local
89 __p = 64 - __builtin_popcountl (__M);
96 __t = __X << (__p - __c);
99 __p++;
108 unsigned long __p = 0x4040404040404040UL; // initial bit permute control local
125 __p = (__p << 8) | __c
[all...] |
| /src/external/apache2/llvm/dist/libcxx/src/ |
| thread.cpp | 117 static __thread_specific_ptr<__thread_struct> __p; local
118 return __p;
131 void deallocate(T* __p, size_t) {::operator delete(static_cast<void*>(__p));}
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++98/ |
| istream-string.cc | 156 const __char_type* __p = __traits_type::find(__sb->gptr(), local
159 if (__p)
160 __size = __p - __sb->gptr();
241 const __char_type* __p = __traits_type::find(__sb->gptr(), local
244 if (__p)
245 __size = __p - __sb->gptr();
|
| istream.cc | 62 const char_type* __p = traits_type::find(__sb->gptr(), local
65 if (__p)
66 __size = __p - __sb->gptr();
151 const char_type* __p = traits_type::find(__sb->gptr(), local
154 if (__p)
155 __size = __p - __sb->gptr();
324 const char_type* __p = traits_type::find(__sb->gptr(), local
327 if (__p)
328 __size = __p - __sb->gptr();
404 const char_type* __p = traits_type::find(__sb->gptr() local
[all...] |
| pool_allocator.cc | 108 _Obj* __p = *__free_list; local
109 if (__p != 0)
111 *__free_list = __p->_M_free_list_link;
112 _S_start_free = (char*)__p;
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
| unique_ptr.h | 175 __uniq_ptr_impl(pointer __p) : _M_t() { _M_ptr() = __p; }
179 __uniq_ptr_impl(pointer __p, _Del&& __d)
180 : _M_t(__p, std::forward<_Del>(__d)) { }
205 void reset(pointer __p) noexcept
208 _M_ptr() = __p;
216 pointer __p = _M_ptr(); local
218 return __p;
309 * @param __p A pointer to an object of @c element_type
316 unique_ptr(pointer __p) noexcep
[all...] |
| stl_set.h | 513 std::pair<typename _Rep_type::iterator, bool> __p = local
515 return std::pair<iterator, bool>(__p.first, __p.second);
522 std::pair<typename _Rep_type::iterator, bool> __p = local
524 return std::pair<iterator, bool>(__p.first, __p.second);
|
| streambuf_iterator.h | 454 const _CharT* __p = traits_type::find(__sb->gptr(), local
456 if (__p)
457 __n = __p - __sb->gptr();
|
| fs_path.h | 317 path(const path& __p) = default;
319 path(path&& __p) noexcept
320 : _M_pathname(std::move(__p._M_pathname)),
321 _M_cmpts(std::move(__p._M_cmpts))
322 { __p.clear(); }
381 path& operator/=(const path& __p);
495 int compare(const path& __p) const noexcept;
540 operator<<(std::basic_ostream<_CharT, _Traits>& __os, const path& __p)
542 __os << std::quoted(__p.string<_CharT, _Traits>());
549 operator>>(std::basic_istream<_CharT, _Traits>& __is, path& __p)
802 const auto __p = __str.data(); local
[all...] |
| random.h | 884 * 0 <= @p __r <= @p __p
886 template<typename _RandomNumberEngine, size_t __p, size_t __r>
889 static_assert(1 <= __r && __r <= __p,
901 static constexpr size_t block_size = __p;
1094 template<typename _RandomNumberEngine, size_t __p, size_t __r>
1096 operator!=(const std::discard_block_engine<_RandomNumberEngine, __p,
1098 const std::discard_block_engine<_RandomNumberEngine, __p,
1809 uniform_real_distribution(const param_type& __p)
1810 : _M_param(__p)
1869 const param_type& __p)
3728 double __p; local
[all...] |
| hashtable.h | 1919 for (__node_ptr __p = static_cast<__node_ptr>(__prev_p->_M_nxt);
1920 __p != nullptr;
1921 __p = __p->_M_next())
1923 if (this->_M_key_equals(__k, *__p))
1926 __prev_p = __p;
1949 for (__node_ptr __p = static_cast<__node_ptr>(__prev_p->_M_nxt);;
1950 __p = __p->_M_next())
1952 if (this->_M_equals(__k, __code, *__p))
2443 __node_ptr __p = __n->_M_next(); local
2578 __node_ptr __p = _M_begin(); local
2621 __node_ptr __p = _M_begin(); local
[all...] |
| shared_ptr_base.h | 423 _Sp_counted_ptr(_Ptr __p) noexcept
424 : _M_ptr(__p) { }
502 _Impl(_Ptr __p, _Deleter __d, const _Alloc& __a) noexcept
503 : _Del_base(std::move(__d)), _Alloc_base(__a), _M_ptr(__p)
515 // __d(__p) must not throw.
516 _Sp_counted_deleter(_Ptr __p, _Deleter __d) noexcept
517 : _M_impl(__p, std::move(__d), _Alloc()) { }
519 // __d(__p) must not throw.
520 _Sp_counted_deleter(_Ptr __p, _Deleter __d, const _Alloc& __a) noexcept
521 : _M_impl(__p, std::move(__d), __a) {
706 auto __p = pointer_traits<pointer>::pointer_to(*this); local
856 pointer __p = _M_alloc_ptr; local
[all...] |
| basic_string.h | 104 pointer __p = _Base::allocate(__a, __n); local
108 std::construct_at(__builtin_addressof(__p[__i]));
109 return __p;
225 _M_data(pointer __p)
226 { _M_dataplus._M_p = __p; }
461 _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)
463 for (; __k1 != __k2; ++__k1, (void)++__p)
464 traits_type::assign(*__p, *__k1); // These types are off.
469 _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2) _GLIBCXX_NOEXCEPT
470 { _S_copy_chars(__p, __k1.base(), __k2.base());
[all...] |
| cow_string.h | 202 void* __p = reinterpret_cast<void*>(&_S_empty_rep_storage); local
203 return *reinterpret_cast<_Rep*>(__p);
341 _M_data(_CharT* __p) _GLIBCXX_NOEXCEPT
342 { return (_M_dataplus._M_p = __p); }
431 _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)
433 for (; __k1 != __k2; ++__k1, (void)++__p)
434 traits_type::assign(*__p, *__k1); // These types are off.
438 _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2) _GLIBCXX_NOEXCEPT
439 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
442 _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2
3299 _CharT* __p = _M_data() + __pos; local
3547 _Rep *__p = new (__place) _Rep; local
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/ |
| pod_char_traits.h | 129 const char_type* __p = __s; local
130 while (__p->value)
131 ++__p;
132 return (__p - __s);
138 for (const char_type* __p = __s; size_t(__p - __s) < __n; ++__p)
139 if (*__p == __a)
140 return __p;
|
| rc_string_base.h | 187 _M_data(_CharT* __p)
188 { _M_dataplus._M_p = __p; }
443 _Rep* __p = new (__place) _Rep; local
444 __p->_M_info._M_capacity = __capacity;
445 return __p;
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++17/ |
| memory_resource.cc | 57 do_deallocate(void* __p, size_t __bytes, size_t __alignment) noexcept
59 { ::operator delete(__p, __bytes, std::align_val_t(__alignment)); }
252 void* __p = __r->allocate(__size, __align); local
254 // Add a chunk defined by (__p, __size, __align) to linked list __head.
257 void* const __back = (char*)__p + __size - sizeof(_Chunk);
259 return { __p, __size - sizeof(_Chunk) };
719 void* __p = __r->allocate(__bytes, __alignment);
723 void* __pwords = static_cast<char*>(__p) + __n;
724 _M_chunks.insert(chunk(__p, __bytes, __pwords, __blocks), __r);
728 __r->deallocate(__p, __bytes, __alignment)
[all...] |
| /src/sys/crypto/arch/arm/ |
| arm_neon.h | 252 const __builtin_aarch64_simd_si *__p = local
255 return (uint32x4_t)__builtin_aarch64_ld1v4si(__p);
257 const __builtin_neon_si *__p = (const __builtin_neon_si *)__p32;
259 return (uint32x4_t)__builtin_neon_vld1v4si(__p);
276 const __builtin_aarch64_simd_qi *__p = local
279 return (uint8x16_t)__builtin_aarch64_ld1v16qi(__p);
281 const __builtin_neon_qi *__p = (const __builtin_neon_qi *)__p8;
283 return (uint8x16_t)__builtin_neon_vld1v16qi(__p);
632 __builtin_aarch64_simd_si *__p = (__builtin_aarch64_simd_si *)__p32; local
634 __builtin_aarch64_st1v4si(__p, (int32x4_t)__v)
654 __builtin_aarch64_simd_qi *__p = (__builtin_aarch64_simd_qi *)__p8; local
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/libsupc++/ |
| guard.cc | 119 unsigned char *__p = reinterpret_cast<unsigned char *>(g); local
120 __atomic_load (__p, &__c, __ATOMIC_ACQUIRE);
121 (void) __p;
134 unsigned char *__p = reinterpret_cast<unsigned char *>(g); local
136 __atomic_store (__p, &val, __ATOMIC_RELEASE);
137 (void) __p;
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++11/ |
| ios.cc | 164 _Callback_list* __p = _M_callbacks; local
165 while (__p)
168 { (*__p->_M_fn) (__e, *this, __p->_M_index); }
171 __p = __p->_M_next;
178 _Callback_list* __p = _M_callbacks; local
179 while (__p && __p->_M_remove_reference() == 0)
181 _Callback_list* __next = __p->_M_next
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/tr1/ |
| hashtable_policy.h | 91 _Node_iterator_base(_Hash_node<_Value, __cache>* __p)
92 : _M_cur(__p) { }
133 _Node_iterator(_Hash_node<_Value, __cache>* __p)
134 : _Node_iterator_base<_Value, __cache>(__p) { }
174 _Node_const_iterator(_Hash_node<_Value, __cache>* __p)
175 : _Node_iterator_base<_Value, __cache>(__p) { }
273 _Hashtable_iterator(_Hash_node<_Value, __cache>* __p,
275 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
318 _Hashtable_const_iterator(_Hash_node<_Value, __cache>* __p,
320 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) {
426 const unsigned long* __p local
522 typename _Hashtable::_Node* __p = local
[all...] |
| hashtable.h | 477 _Node* __p = __array[__i]; local
478 while (__p)
480 _Node* __tmp = __p;
481 __p = __p->_M_next;
503 _Node** __p = __alloc.allocate(__n + 1); local
504 std::fill(__p, __p + __n, (_Node*) 0);
505 __p[__n] = reinterpret_cast<_Node*>(0x1000);
506 return __p;
708 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); local
725 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); local
768 _Node* __p = _M_find_node(*__head, __k, __code); local
806 _Node* __p = _M_find_node(*__head, __k, __code); local
1062 _Node* __p = *__slot; local
1077 _Node* __p = *__saved_slot; local
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/backward/ |
| hashtable.h | 306 _M_put_node(_Node* __p)
307 { _M_node_allocator.deallocate(__p, 1); }
941 _Node* __p = __it._M_cur; local
942 if (__p)
944 const size_type __n = _M_bkt_num(__p->_M_val);
947 if (__cur == __p)
958 if (__next == __p)
|
