Home
last modified time | relevance | path

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

1234

/OK3568_Linux_fs/kernel/arch/mips/include/asm/
H A Delf.h285 struct elfhdr *__h = (hdr); \
287 if (!mips_elf_check_machine(__h)) \
289 if (__h->e_ident[EI_CLASS] != ELFCLASS32) \
291 if ((__h->e_flags & EF_MIPS_ABI2) != 0) \
293 if (((__h->e_flags & EF_MIPS_ABI) != 0) && \
294 ((__h->e_flags & EF_MIPS_ABI) != EF_MIPS_ABI_O32)) \
296 if (__h->e_flags & __MIPS_O32_FP64_MUST_BE_ZERO) \
308 struct elfhdr *__h = (hdr); \
310 if (!mips_elf_check_machine(__h)) \
312 if (__h->e_ident[EI_CLASS] != ELFCLASS64) \
[all …]
/OK3568_Linux_fs/kernel/lib/mpi/
H A Dlonglong.h234 struct {USItype __l, __h; } __i; \
240 (w1) = __xx.__i.__h; (w0) = __xx.__i.__l; })
243 struct {SItype __l, __h; } __i; \
249 (w1) = __xx.__i.__h; (w0) = __xx.__i.__l; })
323 struct {USItype __h, __l; } __i; \
329 (wh) = __xx.__i.__h; \
355 struct {USItype __h, __l; } __i; \
359 : "=r" (__xx.__i.__h), \
363 (xh) = __xx.__i.__h; (xl) = __xx.__i.__l; \
370 struct {USItype __h, __l; } __i; \
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/bits/
H A Dhashtable_policy.h113 _ReuseOrAllocNode(__node_type* __nodes, __hashtable_alloc& __h) in _GLIBCXX_VISIBILITY()
114 : _M_nodes(__nodes), _M_h(__h) { } in _GLIBCXX_VISIBILITY()
161 _AllocNode(__hashtable_alloc& __h) in _GLIBCXX_VISIBILITY()
162 : _M_h(__h) { } in _GLIBCXX_VISIBILITY()
706 __hashtable* __h = static_cast<__hashtable*>(this); in _GLIBCXX_VISIBILITY()
707 __hash_code __code = __h->_M_hash_code(__k); in _GLIBCXX_VISIBILITY()
708 std::size_t __bkt = __h->_M_bucket_index(__k, __code); in _GLIBCXX_VISIBILITY()
709 if (__node_type* __node = __h->_M_find_node(__bkt, __k, __code)) in _GLIBCXX_VISIBILITY()
713 __h, in _GLIBCXX_VISIBILITY()
719 = __h->_M_insert_unique_node(__k, __bkt, __code, __node._M_node); in _GLIBCXX_VISIBILITY()
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/bits/
H A Dhashtable_policy.h113 _ReuseOrAllocNode(__node_type* __nodes, __hashtable_alloc& __h) in _GLIBCXX_VISIBILITY()
114 : _M_nodes(__nodes), _M_h(__h) { } in _GLIBCXX_VISIBILITY()
161 _AllocNode(__hashtable_alloc& __h) in _GLIBCXX_VISIBILITY()
162 : _M_h(__h) { } in _GLIBCXX_VISIBILITY()
706 __hashtable* __h = static_cast<__hashtable*>(this); in _GLIBCXX_VISIBILITY()
707 __hash_code __code = __h->_M_hash_code(__k); in _GLIBCXX_VISIBILITY()
708 std::size_t __bkt = __h->_M_bucket_index(__k, __code); in _GLIBCXX_VISIBILITY()
709 if (__node_type* __node = __h->_M_find_node(__bkt, __k, __code)) in _GLIBCXX_VISIBILITY()
713 __h, in _GLIBCXX_VISIBILITY()
719 = __h->_M_insert_unique_node(__k, __bkt, __code, __node._M_node); in _GLIBCXX_VISIBILITY()
[all …]
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/libcxx/include/
H A 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 …]
H A 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 …]
H A 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 …]
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/libcxx/include/
H A 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 …]
H A 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 …]
H A 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 …]
H A 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 …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/backward/
H A Dhash_fun.h73 unsigned long __h = 0; in _GLIBCXX_VISIBILITY() local
75 __h = 5 * __h + *__s; in _GLIBCXX_VISIBILITY()
76 return size_t(__h); in _GLIBCXX_VISIBILITY()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/backward/
H A Dhash_fun.h73 unsigned long __h = 0; in _GLIBCXX_VISIBILITY() local
75 __h = 5 * __h + *__s; in _GLIBCXX_VISIBILITY()
76 return size_t(__h); in _GLIBCXX_VISIBILITY()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/tr1/
H A Dmodified_bessel_func.tcc121 _Tp __h = __nu * __xi; in __bessel_ik() local
122 if ( __h < __fp_min ) in __bessel_ik()
123 __h = __fp_min; in __bessel_ik()
126 _Tp __c = __h; in __bessel_ik()
134 __h *= __del; in __bessel_ik()
143 _Tp __Ipnul = __h * __Inul; in __bessel_ik()
202 _Tp __h = __delh; in __bessel_ik() local
221 __h += __delh; in __bessel_ik()
230 __h = __a1 * __h; in __bessel_ik()
233 __Knu1 = __Kmu * (__mu + __x + _Tp(0.5L) - __h) * __xi; in __bessel_ik()
H A Dhashtable_policy.h517 _Hashtable* __h = static_cast<_Hashtable*>(this); in _GLIBCXX_VISIBILITY()
518 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k); in _GLIBCXX_VISIBILITY()
519 std::size_t __n = __h->_M_bucket_index(__k, __code, in _GLIBCXX_VISIBILITY()
520 __h->_M_bucket_count); in _GLIBCXX_VISIBILITY()
523 __h->_M_find_node(__h->_M_buckets[__n], __k, __code); in _GLIBCXX_VISIBILITY()
525 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()), in _GLIBCXX_VISIBILITY()
581 const _H1&, const _H2&, const _Hash& __h) in _GLIBCXX_VISIBILITY()
582 : _M_extract(__ex), _M_eq(__eq), _M_ranged_hash(__h) { } in _GLIBCXX_VISIBILITY()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/tr1/
H A Dmodified_bessel_func.tcc121 _Tp __h = __nu * __xi; in __bessel_ik() local
122 if ( __h < __fp_min ) in __bessel_ik()
123 __h = __fp_min; in __bessel_ik()
126 _Tp __c = __h; in __bessel_ik()
134 __h *= __del; in __bessel_ik()
143 _Tp __Ipnul = __h * __Inul; in __bessel_ik()
202 _Tp __h = __delh; in __bessel_ik() local
221 __h += __delh; in __bessel_ik()
230 __h = __a1 * __h; in __bessel_ik()
233 __Knu1 = __Kmu * (__mu + __x + _Tp(0.5L) - __h) * __xi; in __bessel_ik()
H A Dhashtable_policy.h517 _Hashtable* __h = static_cast<_Hashtable*>(this); in _GLIBCXX_VISIBILITY()
518 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k); in _GLIBCXX_VISIBILITY()
519 std::size_t __n = __h->_M_bucket_index(__k, __code, in _GLIBCXX_VISIBILITY()
520 __h->_M_bucket_count); in _GLIBCXX_VISIBILITY()
523 __h->_M_find_node(__h->_M_buckets[__n], __k, __code); in _GLIBCXX_VISIBILITY()
525 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()), in _GLIBCXX_VISIBILITY()
581 const _H1&, const _H2&, const _Hash& __h) in _GLIBCXX_VISIBILITY()
582 : _M_extract(__ex), _M_eq(__eq), _M_ranged_hash(__h) { } in _GLIBCXX_VISIBILITY()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/libc/usr/include/
H A Dobstack.h370 ({ struct obstack *__h = (OBSTACK); \
371 obstack_blank (__h, (length)); \
372 obstack_finish (__h); })
376 ({ struct obstack *__h = (OBSTACK); \
377 obstack_grow (__h, (where), (length)); \
378 obstack_finish (__h); })
382 ({ struct obstack *__h = (OBSTACK); \
383 obstack_grow0 (__h, (where), (length)); \
384 obstack_finish (__h); })
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/
H A Dobstack.h385 ({ struct obstack *__h = (OBSTACK); \
386 obstack_blank (__h, (length)); \
387 obstack_finish (__h); })
391 ({ struct obstack *__h = (OBSTACK); \
392 obstack_grow (__h, (where), (length)); \
393 obstack_finish (__h); })
397 ({ struct obstack *__h = (OBSTACK); \
398 obstack_grow0 (__h, (where), (length)); \
399 obstack_finish (__h); })
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/
H A Dobstack.h385 ({ struct obstack *__h = (OBSTACK); \
386 obstack_blank (__h, (length)); \
387 obstack_finish (__h); })
391 ({ struct obstack *__h = (OBSTACK); \
392 obstack_grow (__h, (where), (length)); \
393 obstack_finish (__h); })
397 ({ struct obstack *__h = (OBSTACK); \
398 obstack_grow0 (__h, (where), (length)); \
399 obstack_finish (__h); })
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/libc/usr/include/
H A Dobstack.h370 ({ struct obstack *__h = (OBSTACK); \
371 obstack_blank (__h, (length)); \
372 obstack_finish (__h); })
376 ({ struct obstack *__h = (OBSTACK); \
377 obstack_grow (__h, (where), (length)); \
378 obstack_finish (__h); })
382 ({ struct obstack *__h = (OBSTACK); \
383 obstack_grow0 (__h, (where), (length)); \
384 obstack_finish (__h); })
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/experimental/
H A Dsocket973 [__h = std::move(__init.completion_handler), __ec]
975 { __h(__ec); }, __a);
982 [__h = std::move(__init.completion_handler),
993 __h(__ec);
1026 [__h = std::move(__init.completion_handler)]
1028 __h(__ec);
1193 [__h = std::move(__init.completion_handler),
1199 __h(__ec);
1212 __h(__ec, __result);
1214 __h(std::make_error_code(errc::operation_not_supported), 0);
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/experimental/
H A Dsocket973 [__h = std::move(__init.completion_handler), __ec]
975 { __h(__ec); }, __a);
982 [__h = std::move(__init.completion_handler),
993 __h(__ec);
1026 [__h = std::move(__init.completion_handler)]
1028 __h(__ec);
1193 [__h = std::move(__init.completion_handler),
1199 __h(__ec);
1212 __h(__ec, __result);
1214 __h(std::make_error_code(errc::operation_not_supported), 0);
[all …]
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/
H A Dspeculation_barrier.h111 [__h] "r" (__high), \
234 [__h] "r" (__high), \
311 [__h] "r" (__high), \
375 [__h] "r" (__high), \
441 [__h] "r" (__high), \
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/
H A Dspeculation_barrier.h111 [__h] "r" (__high), \
234 [__h] "r" (__high), \
311 [__h] "r" (__high), \
375 [__h] "r" (__high), \
441 [__h] "r" (__high), \

1234