Home
last modified time | relevance | path

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

12

/external/llvm-project/clang/lib/Headers/
Dkeylockerintrin.h134 _mm_encodekey128_u32(unsigned int __htype, __m128i __key, void *__h) { in _mm_encodekey128_u32() argument
135 return __builtin_ia32_encodekey128_u32(__htype, (__v2di)__key, __h); in _mm_encodekey128_u32()
175 void *__h) { in _mm_encodekey256_u32() argument
177 (__v2di)__key_hi, __h); in _mm_encodekey256_u32()
213 _mm_aesenc128kl_u8(__m128i* __odata, __m128i __idata, const void *__h) { in _mm_aesenc128kl_u8() argument
214 return __builtin_ia32_aesenc128kl_u8((__v2di *)__odata, (__v2di)__idata, __h); in _mm_aesenc128kl_u8()
250 _mm_aesenc256kl_u8(__m128i* __odata, __m128i __idata, const void *__h) { in _mm_aesenc256kl_u8() argument
251 return __builtin_ia32_aesenc256kl_u8((__v2di *)__odata, (__v2di)__idata, __h); in _mm_aesenc256kl_u8()
287 _mm_aesdec128kl_u8(__m128i* __odata, __m128i __idata, const void *__h) { in _mm_aesdec128kl_u8() argument
288 return __builtin_ia32_aesdec128kl_u8((__v2di *)__odata, (__v2di)__idata, __h); in _mm_aesdec128kl_u8()
[all …]
/external/llvm-project/libcxx/include/
Dany187 constexpr any() _NOEXCEPT : __h(nullptr) {}
190 any(any const & __other) : __h(nullptr)
192 if (__other.__h) __other.__call(_Action::_Copy, this);
196 any(any && __other) _NOEXCEPT : __h(nullptr)
198 if (__other.__h) __other.__call(_Action::_Move, this);
277 void reset() _NOEXCEPT { if (__h) this->__call(_Action::_Destroy); }
284 bool has_value() const _NOEXCEPT { return __h != nullptr; }
289 if (__h) {
313 return __h(__a, this, __other, __info, __fallback_info);
321 return __h(__a, this, __other, __info, __fallback_info);
[all …]
Dforward_list902 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
906 __h.reset(__node_traits::allocate(__a, 1));
907 __node_traits::construct(__a, _VSTD::addressof(__h->__value_));
908 __h->__next_ = nullptr;
909 __p->__next_ = __h.release();
924 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
928 __h.reset(__node_traits::allocate(__a, 1));
929 __node_traits::construct(__a, _VSTD::addressof(__h->__value_));
930 __h->__next_ = nullptr;
931 __p->__next_ = __h.release();
[all …]
D__hash_table113 __constrain_hash(size_t __h, size_t __bc)
115 return !(__bc & (__bc - 1)) ? __h & (__bc - 1) :
116 (__h < __bc ? __h : __h % __bc);
1671 __node_holder __h = __construct_node(_NodeTypes::__move(__u.remove(__i++)->__value_));
1672 __node_insert_multi(__h.get());
1673 __h.release();
2093 __node_holder __h = __construct_node_hash(__hash, _VSTD::forward<_Args>(__args)...);
2106 __h->__next_ = __pn->__next_;
2107 __pn->__next_ = __h.get()->__ptr();
2110 if (__h->__next_ != nullptr)
[all …]
D__tree111 unsigned __h = __tree_sub_invariant(__x->__left_);
112 if (__h == 0)
114 if (__h != __tree_sub_invariant(__x->__right_))
116 return __h + __x->__is_black_; // return black height of this node
2096 __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
2097 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2098 __r = __h.release();
2117 __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
2118 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2119 __r = __h.release();
[all …]
Dutility997 _Size __h = __len;
1005 __h *= __m;
1006 __h ^= __k;
1011 __h ^= __data[2] << 16;
1014 __h ^= __data[1] << 8;
1017 __h ^= __data[0];
1018 __h *= __m;
1020 __h ^= __h >> 13;
1021 __h *= __m;
1022 __h ^= __h >> 15;
[all …]
Dmap1228 iterator try_emplace(const_iterator __h, const key_type& __k, _Args&&... __args)
1230 return __tree_.__emplace_hint_unique_key_args(__h.__i_, __k,
1238 iterator try_emplace(const_iterator __h, key_type&& __k, _Args&&... __args)
1240 return __tree_.__emplace_hint_unique_key_args(__h.__i_, __k,
1273 _LIBCPP_INLINE_VISIBILITY iterator insert_or_assign(const_iterator __h,
1277 __h.__i_, __k, __k, _VSTD::forward<_Vp>(__v));
1286 _LIBCPP_INLINE_VISIBILITY iterator insert_or_assign(const_iterator __h,
1290 __h.__i_, __k, _VSTD::move(__k), _VSTD::forward<_Vp>(__v));
1544 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
1545 __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__get_value().first), __k);
[all …]
Dchrono2788 __h(duration_cast<chrono::hours> (abs(__d))),
2795 constexpr chrono::hours hours() const noexcept { return __h; }
2802 auto __dur = __h + __m + __s + __f;
2810 chrono::hours __h;
2816 constexpr bool is_am(const hours& __h) noexcept { return __h >= hours( 0) && __h < hours(12); }
2817 constexpr bool is_pm(const hours& __h) noexcept { return __h >= hours(12) && __h < hours(24); }
2819 constexpr hours make12(const hours& __h) noexcept
2821 if (__h == hours( 0)) return hours(12);
2822 else if (__h <= hours(12)) return __h;
2823 else return __h - hours(12);
[all …]
Dunordered_map461 __unordered_map_hasher(const _Hash& __h)
463 : _Hash(__h) {}
496 __unordered_map_hasher(const _Hash& __h)
498 : __hash_(__h) {}
1197 iterator try_emplace(const_iterator __h, const key_type& __k, _Args&&... __args)
1200 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__h) == this,
1204 ((void)__h);
1211 iterator try_emplace(const_iterator __h, key_type&& __k, _Args&&... __args)
1214 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__h) == this,
1218 ((void)__h);
[all …]
/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 …]
/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/libabigail/tests/data/test-diff-dwarf/
Dtest42-PR21296-clanggcc.cc101 constexpr _Head_base(const _Head& __h) in _Head_base()
102 : _M_head_impl(__h) { } in _Head_base()
105 constexpr _Head_base(_UHead&& __h) in _Head_base()
106 : _M_head_impl(std::forward<_UHead>(__h)) { } in _Head_base()
/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/llvm-project/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/llvm-project/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) {}
669 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
670 __node_traits::construct(__na, _VSTD::addressof(__h->__value_.first), __k);
671 __h.get_deleter().__first_constructed = true;
672 __node_traits::construct(__na, _VSTD::addressof(__h->__value_.second));
673 __h.get_deleter().__second_constructed = true;
674 return __h;
695 __node_holder __h = __construct_node(__k);
696 std::pair<iterator, bool> __r = __table_.__node_insert_unique(__h.get());
[all …]
/external/llvm-project/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/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()

12