Home
last modified time | relevance | path

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

/external/libcxx/include/
Dany188 constexpr any() _NOEXCEPT : __h(nullptr) {}
191 any(any const & __other) : __h(nullptr)
193 if (__other.__h) __other.__call(_Action::_Copy, this);
197 any(any && __other) _NOEXCEPT : __h(nullptr)
199 if (__other.__h) __other.__call(_Action::_Move, this);
278 void reset() _NOEXCEPT { if (__h) this->__call(_Action::_Destroy); }
285 bool has_value() const _NOEXCEPT { return __h != nullptr; }
290 if (__h) {
314 return __h(__a, this, __other, __info, __fallback_info);
322 return __h(__a, this, __other, __info, __fallback_info);
[all …]
Dforward_list896 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
900 __h.reset(__node_traits::allocate(__a, 1));
901 __node_traits::construct(__a, _VSTD::addressof(__h->__value_));
902 __h->__next_ = nullptr;
903 __p->__next_ = __h.release();
918 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
922 __h.reset(__node_traits::allocate(__a, 1));
923 __node_traits::construct(__a, _VSTD::addressof(__h->__value_));
924 __h->__next_ = nullptr;
925 __p->__next_ = __h.release();
[all …]
D__hash_table116 __constrain_hash(size_t __h, size_t __bc)
118 return !(__bc & (__bc - 1)) ? __h & (__bc - 1) :
119 (__h < __bc ? __h : __h % __bc);
1694 __node_holder __h = __construct_node(_NodeTypes::__move(__u.remove(__i++)->__value_));
1695 __node_insert_multi(__h.get());
1696 __h.release();
2126 __node_holder __h = __construct_node_hash(__hash, _VSTD::forward<_Args>(__args)...);
2128 __node_holder __h = __construct_node_hash(__hash, __args);
2142 __h->__next_ = __pn->__next_;
2143 __pn->__next_ = __h.get()->__ptr();
[all …]
D__tree105 unsigned __h = __tree_sub_invariant(__x->__left_);
106 if (__h == 0)
108 if (__h != __tree_sub_invariant(__x->__right_))
110 return __h + __x->__is_black_; // return black height of this node
2157 __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
2159 __node_holder __h = __construct_node(__args);
2161 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2162 __r = __h.release();
2190 __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
2192 __node_holder __h = __construct_node(__args);
[all …]
Dutility1002 _Size __h = __len;
1010 __h *= __m;
1011 __h ^= __k;
1016 __h ^= __data[2] << 16;
1019 __h ^= __data[1] << 8;
1022 __h ^= __data[0];
1023 __h *= __m;
1025 __h ^= __h >> 13;
1026 __h *= __m;
1027 __h ^= __h >> 15;
[all …]
Dmap1223 iterator try_emplace(const_iterator __h, const key_type& __k, _Args&&... __args)
1225 return __tree_.__emplace_hint_unique_key_args(__h.__i_, __k,
1233 iterator try_emplace(const_iterator __h, key_type&& __k, _Args&&... __args)
1235 return __tree_.__emplace_hint_unique_key_args(__h.__i_, __k,
1269 iterator insert_or_assign(const_iterator __h, const key_type& __k, _Vp&& __v)
1277 return emplace_hint(__h, __k, _VSTD::forward<_Vp>(__v));
1282 iterator insert_or_assign(const_iterator __h, key_type&& __k, _Vp&& __v)
1290 return emplace_hint(__h, _VSTD::move(__k), _VSTD::forward<_Vp>(__v));
1507 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
1508 __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__get_value().first), __k);
[all …]
Dunordered_map434 __unordered_map_hasher(const _Hash& __h)
436 : _Hash(__h) {}
463 __unordered_map_hasher(const _Hash& __h)
465 : __hash_(__h) {}
1119 iterator try_emplace(const_iterator __h, const key_type& __k, _Args&&... __args)
1122 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__h) == this,
1126 ((void)__h);
1133 iterator try_emplace(const_iterator __h, key_type&& __k, _Args&&... __args)
1136 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__h) == this,
1140 ((void)__h);
[all …]
D__locale307 size_t __h = 0;
312 __h = (__h << 4) + static_cast<size_t>(*__p);
313 size_t __g = __h & __mask;
314 __h ^= __g | (__g >> __sr);
316 return static_cast<long>(__h);
Dlocale1885 void __get_12_hour(int& __h,
1889 void __get_am_pm(int& __h,
2005 time_get<_CharT, _InputIterator>::__get_hour(int& __h,
2012 __h = __t;
2019 time_get<_CharT, _InputIterator>::__get_12_hour(int& __h,
2026 __h = __t;
2101 time_get<_CharT, _InputIterator>::__get_am_pm(int& __h,
2113 if (__i == 0 && __h == 12)
2114 __h = 0;
2115 else if (__i == 1 && __h < 12)
[all …]
Dalgorithm3270 unique_ptr<value_type, __destruct_n&> __h(__p.first, __d);
3297 // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer
3360 unique_ptr<value_type, __return_temporary_buffer> __h;
3364 __h.reset(__p.first);
3400 unique_ptr<value_type, __destruct_n&> __h(__p.first, __d);
3429 // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer
3508 unique_ptr<value_type, __return_temporary_buffer> __h;
3512 __h.reset(__p.first);
3787 unique_ptr<value_type, __destruct_n&> __h(__first2, __d);
3809 __h.release();
[all …]
Dbitset434 size_t __h = 0;
436 __h ^= __first_[__i];
437 return __h;
Dfuture2282 __h(new __deferred_assoc_state<_Rp, _Fp>(_VSTD::forward<_Fp>(__f)));
2283 return future<_Rp>(__h.get());
2295 __h(new __async_assoc_state<_Rp, _Fp>(_VSTD::forward<_Fp>(__f)));
2296 _VSTD::thread(&__async_assoc_state<_Rp, _Fp>::__execute, __h.get()).detach();
2297 return future<_Rp>(__h.get());
Dostream831 unique_ptr<_CharT, void(*)(void*)> __h(0, free);
837 __h.reset(__wb);
Dvector3334 size_t __h = 0;
3339 __h ^= *__p;
3344 __h ^= *__p & __m;
3346 return __h;
Dfstream698 unique_ptr<FILE, int(*)(FILE*)> __h(__file_, fclose);
701 if (fclose(__h.release()) == 0)
Dunordered_set610 iterator insert(const_iterator __h, node_type&& __nh)
615 __h, _VSTD::move(__nh));
Dchrono2743 constexpr chrono::hours operator""h(unsigned long long __h)
2745 return chrono::hours(static_cast<chrono::hours::rep>(__h));
2748 constexpr chrono::duration<long double, ratio<3600,1>> operator""h(long double __h)
2750 return chrono::duration<long double, ratio<3600,1>>(__h);
Dregex3048 unique_ptr<__node> __h(new __end_state<_CharT>);
3049 __start_.reset(new __empty_state<_CharT>(__h.get()));
3050 __h.release();
/external/libcxx/benchmarks/
Dunordered_set_operations.bench.cpp85 uint32_t __h = 4; in operator ()() local
90 __h *= __m; in operator ()()
91 __h ^= __k; in operator ()()
92 __h ^= __h >> 13; in operator ()()
93 __h *= __m; in operator ()()
94 __h ^= __h >> 15; in operator ()()
95 return __h; in operator ()()
/external/swiftshader/third_party/llvm-7.0/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/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/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()