Home
last modified time | relevance | path

Searched refs:__h (Results 1 – 25 of 25) sorted by relevance

/external/libcxx/include/experimental/
Dany171 any() _NOEXCEPT : __h(nullptr) {}
174 any(any const & __other) : __h(nullptr)
176 if (__other.__h) __other.__call(_Action::_Copy, this);
180 any(any && __other) _NOEXCEPT : __h(nullptr)
182 if (__other.__h) __other.__call(_Action::_Move, this);
224 if (__h) this->__call(_Action::_Destroy);
234 return __h == nullptr;
241 if (__h) {
264 return __h(__a, this, __other, __info);
271 return __h(__a, this, __other, __info);
[all …]
/external/libcxx/include/
Dany184 constexpr any() _NOEXCEPT : __h(nullptr) {}
187 any(any const & __other) : __h(nullptr)
189 if (__other.__h) __other.__call(_Action::_Copy, this);
193 any(any && __other) _NOEXCEPT : __h(nullptr)
195 if (__other.__h) __other.__call(_Action::_Move, this);
274 void reset() _NOEXCEPT { if (__h) this->__call(_Action::_Destroy); }
281 bool has_value() const _NOEXCEPT { return __h != nullptr; }
286 if (__h) {
310 return __h(__a, this, __other, __info, __fallback_info);
318 return __h(__a, this, __other, __info, __fallback_info);
[all …]
Dforward_list869 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
873 __h.reset(__node_traits::allocate(__a, 1));
874 __node_traits::construct(__a, _VSTD::addressof(__h->__value_));
875 __h->__next_ = nullptr;
876 __p->__next_ = __h.release();
891 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
895 __h.reset(__node_traits::allocate(__a, 1));
896 __node_traits::construct(__a, _VSTD::addressof(__h->__value_));
897 __h->__next_ = nullptr;
898 __p->__next_ = __h.release();
[all …]
D__hash_table129 __constrain_hash(size_t __h, size_t __bc)
131 return !(__bc & (__bc - 1)) ? __h & (__bc - 1) :
132 (__h < __bc ? __h : __h % __bc);
1658 __node_holder __h = __construct_node(_NodeTypes::__move(__u.remove(__i++)->__value_));
1659 __node_insert_multi(__h.get());
1660 __h.release();
2022 __node_holder __h = __construct_node_hash(__hash, _VSTD::forward<_Args>(__args)...);
2024 __node_holder __h = __construct_node_hash(__hash, __args);
2038 __h->__next_ = __pn->__next_;
2039 __pn->__next_ = __h.get()->__ptr();
[all …]
D__tree112 unsigned __h = __tree_sub_invariant(__x->__left_);
113 if (__h == 0)
115 if (__h != __tree_sub_invariant(__x->__right_))
117 return __h + __x->__is_black_; // return black height of this node
2135 __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
2137 __node_holder __h = __construct_node(__args);
2139 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2140 __r = __h.release();
2168 __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
2170 __node_holder __h = __construct_node(__args);
[all …]
Dunordered_map392 __unordered_map_hasher(const _Hash& __h)
394 : _Hash(__h) {}
421 __unordered_map_hasher(const _Hash& __h)
423 : __hash_(__h) {}
1016 iterator try_emplace(const_iterator __h, const key_type& __k, _Args&&... __args)
1019 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__h) == this,
1023 ((void)__h);
1030 iterator try_emplace(const_iterator __h, key_type&& __k, _Args&&... __args)
1033 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__h) == this,
1037 ((void)__h);
[all …]
Dutility973 _Size __h = __len;
981 __h *= __m;
982 __h ^= __k;
987 __h ^= __data[2] << 16;
989 __h ^= __data[1] << 8;
991 __h ^= __data[0];
992 __h *= __m;
994 __h ^= __h >> 13;
995 __h *= __m;
996 __h ^= __h >> 15;
[all …]
Dmap1127 iterator try_emplace(const_iterator __h, const key_type& __k, _Args&&... __args)
1129 return __tree_.__emplace_hint_unique_key_args(__h.__i_, __k,
1137 iterator try_emplace(const_iterator __h, key_type&& __k, _Args&&... __args)
1139 return __tree_.__emplace_hint_unique_key_args(__h.__i_, __k,
1173 iterator insert_or_assign(const_iterator __h, const key_type& __k, _Vp&& __v)
1181 return emplace_hint(__h, __k, _VSTD::forward<_Vp>(__v));
1186 iterator insert_or_assign(const_iterator __h, key_type&& __k, _Vp&& __v)
1194 return emplace_hint(__h, _VSTD::move(__k), _VSTD::forward<_Vp>(__v));
1334 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
1335 __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__cc.first), __k);
[all …]
Dlocale1811 void __get_12_hour(int& __h,
1815 void __get_am_pm(int& __h,
1931 time_get<_CharT, _InputIterator>::__get_hour(int& __h,
1938 __h = __t;
1945 time_get<_CharT, _InputIterator>::__get_12_hour(int& __h,
1952 __h = __t;
2027 time_get<_CharT, _InputIterator>::__get_am_pm(int& __h,
2039 if (__i == 0 && __h == 12)
2040 __h = 0;
2041 else if (__i == 1 && __h < 12)
[all …]
D__locale263 size_t __h = 0;
268 __h = (__h << 4) + static_cast<size_t>(*__p);
269 size_t __g = __h & __mask;
270 __h ^= __g | (__g >> __sr);
272 return static_cast<long>(__h);
Dchrono1088 constexpr chrono::hours operator"" h(unsigned long long __h)
1090 return chrono::hours(static_cast<chrono::hours::rep>(__h));
1093 constexpr chrono::duration<long double, ratio<3600,1>> operator"" h(long double __h)
1095 return chrono::duration<long double, ratio<3600,1>>(__h);
Dalgorithm3344 unique_ptr<value_type, __destruct_n&> __h(__p.first, __d);
3371 // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer
3434 unique_ptr<value_type, __return_temporary_buffer> __h;
3438 __h.reset(__p.first);
3474 unique_ptr<value_type, __destruct_n&> __h(__p.first, __d);
3503 // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer
3582 unique_ptr<value_type, __return_temporary_buffer> __h;
3586 __h.reset(__p.first);
3860 unique_ptr<value_type, __destruct_n&> __h(__first2, __d);
3882 __h.release();
[all …]
Dbitset422 size_t __h = 0;
424 __h ^= __first_[__i];
425 return __h;
Dfuture2283 __h(new __deferred_assoc_state<_Rp, _Fp>(_VSTD::forward<_Fp>(__f)));
2284 return future<_Rp>(__h.get());
2296 __h(new __async_assoc_state<_Rp, _Fp>(_VSTD::forward<_Fp>(__f)));
2297 _VSTD::thread(&__async_assoc_state<_Rp, _Fp>::__execute, __h.get()).detach();
2298 return future<_Rp>(__h.get());
Dostream832 unique_ptr<_CharT, void(*)(void*)> __h(0, free);
838 __h.reset(__wb);
Dfstream569 unique_ptr<FILE, int(*)(FILE*)> __h(__file_, fclose);
572 if (fclose(__h.release()) == 0)
Dvector3279 size_t __h = 0;
3284 __h ^= *__p;
3289 __h ^= *__p & __m;
3291 return __h;
Dregex3022 unique_ptr<__node> __h(new __end_state<_CharT>);
3023 __start_.reset(new __empty_state<_CharT>(__h.get()));
3024 __h.release();
/external/libcxx/benchmarks/
Dunordered_set_operations.bench.cpp84 uint32_t __h = 4; in operator ()() local
89 __h *= __m; in operator ()()
90 __h ^= __k; in operator ()()
91 __h ^= __h >> 13; in operator ()()
92 __h *= __m; in operator ()()
93 __h ^= __h >> 15; in operator ()()
94 return __h; in operator ()()
/external/bison/lib/
Dobstack.h367 ({ struct obstack *__h = (OBSTACK); \
368 obstack_blank (__h, (length)); \
369 obstack_finish (__h); })
373 ({ struct obstack *__h = (OBSTACK); \
374 obstack_grow (__h, (where), (length)); \
375 obstack_finish (__h); })
379 ({ struct obstack *__h = (OBSTACK); \
380 obstack_grow0 (__h, (where), (length)); \
381 obstack_finish (__h); })
/external/llvm/test/CodeGen/X86/
D2006-05-02-InstrSched2.ll13 %__h.2.4.i = phi i32 [ %tmp449.i, %cond_true456.i ], [ 0, %newFuncRoot ] ; <i32> [#uses=1]
14 %tmp446.i = mul i32 %__h.2.4.i, 5 ; <i32> [#uses=1]
/external/swiftshader/third_party/LLVM/test/CodeGen/X86/
D2006-05-02-InstrSched2.ll12 %__h.2.4.i = phi i32 [ %tmp449.i, %cond_true456.i ], [ 0, %newFuncRoot ] ; <i32> [#uses=1]
13 %tmp446.i = mul i32 %__h.2.4.i, 5 ; <i32> [#uses=1]
/external/libcxx/include/ext/
Dhash_map233 _LIBCPP_INLINE_VISIBILITY __hash_map_hasher(const _Hash& __h) : _Hash(__h) {}
249 _LIBCPP_INLINE_VISIBILITY __hash_map_hasher(const _Hash& __h) : __hash_(__h) {}
668 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
669 __node_traits::construct(__na, _VSTD::addressof(__h->__value_.first), __k);
670 __h.get_deleter().__first_constructed = true;
671 __node_traits::construct(__na, _VSTD::addressof(__h->__value_.second));
672 __h.get_deleter().__second_constructed = true;
673 return _LIBCPP_EXPLICIT_MOVE(__h); // explicitly moved for C++03
694 __node_holder __h = __construct_node(__k);
695 pair<iterator, bool> __r = __table_.__node_insert_unique(__h.get());
[all …]
/external/clang/www/
Dlibstdc++4.4-clang0x.patch559 - _M_swap_impl(_Head&& __h)
560 + _M_swap_impl(_Head& __h)
563 swap(__h, _M_head_impl);
/external/clang/lib/Headers/
Davxintrin.h2544 float __e, float __f, float __g, float __h) in _mm256_set_ps() argument
2546 return (__m256){ __h, __g, __f, __e, __d, __c, __b, __a }; in _mm256_set_ps()
2599 float __e, float __f, float __g, float __h) in _mm256_setr_ps() argument
2601 return (__m256){ __a, __b, __c, __d, __e, __f, __g, __h }; in _mm256_setr_ps()