Home
last modified time | relevance | path

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

12

/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/include/
H A Dmmintrin.h80 _mm_packs_pi16 (__m64 __m1, __m64 __m2) in _mm_packs_pi16() argument
82 return (__m64) __builtin_arm_wpackhss ((__v4hi)__m1, (__v4hi)__m2); in _mm_packs_pi16()
89 _mm_packs_pi32 (__m64 __m1, __m64 __m2) in _mm_packs_pi32() argument
91 return (__m64) __builtin_arm_wpackwss ((__v2si)__m1, (__v2si)__m2); in _mm_packs_pi32()
98 _mm_packs_pi64 (__m64 __m1, __m64 __m2) in _mm_packs_pi64() argument
100 return (__m64) __builtin_arm_wpackdss ((long long)__m1, (long long)__m2); in _mm_packs_pi64()
107 _mm_packs_pu16 (__m64 __m1, __m64 __m2) in _mm_packs_pu16() argument
109 return (__m64) __builtin_arm_wpackhus ((__v4hi)__m1, (__v4hi)__m2); in _mm_packs_pu16()
116 _mm_packs_pu32 (__m64 __m1, __m64 __m2) in _mm_packs_pu32() argument
118 return (__m64) __builtin_arm_wpackwus ((__v2si)__m1, (__v2si)__m2); in _mm_packs_pu32()
[all …]
/OK3568_Linux_fs/kernel/lib/mpi/
H A Dlonglong.h134 USItype __m0 = (m0), __m1 = (m1); \
138 "r" (__m1)); \
142 "r" (__m1)); \
156 UDItype __m0 = (m0), __m1 = (m1); \
157 (ph) = __builtin_alpha_umulh(__m0, __m1); \
158 (pl) = __m0 * __m1; \
357 USItype __m0 = (m0), __m1 = (m1); \
362 "r" (__m1)); \
364 (xh) += ((((SItype) __m0 >> 31) & __m1) \
365 + (((SItype) __m1 >> 31) & __m0)); \
[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/
H A Datomic128 compare_exchange_weak(bool& __i1, bool __i2, memory_order __m1,
130 { return _M_base.compare_exchange_weak(__i1, __i2, __m1, __m2); }
133 compare_exchange_weak(bool& __i1, bool __i2, memory_order __m1,
135 { return _M_base.compare_exchange_weak(__i1, __i2, __m1, __m2); }
148 compare_exchange_strong(bool& __i1, bool __i2, memory_order __m1,
150 { return _M_base.compare_exchange_strong(__i1, __i2, __m1, __m2); }
153 compare_exchange_strong(bool& __i1, bool __i2, memory_order __m1,
155 { return _M_base.compare_exchange_strong(__i1, __i2, __m1, __m2); }
548 memory_order __m1, memory_order __m2) noexcept
549 { return _M_b.compare_exchange_strong(__p1, __p2, __m1, __m2); }
[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/
H A Datomic128 compare_exchange_weak(bool& __i1, bool __i2, memory_order __m1,
130 { return _M_base.compare_exchange_weak(__i1, __i2, __m1, __m2); }
133 compare_exchange_weak(bool& __i1, bool __i2, memory_order __m1,
135 { return _M_base.compare_exchange_weak(__i1, __i2, __m1, __m2); }
148 compare_exchange_strong(bool& __i1, bool __i2, memory_order __m1,
150 { return _M_base.compare_exchange_strong(__i1, __i2, __m1, __m2); }
153 compare_exchange_strong(bool& __i1, bool __i2, memory_order __m1,
155 { return _M_base.compare_exchange_strong(__i1, __i2, __m1, __m2); }
548 memory_order __m1, memory_order __m2) noexcept
549 { return _M_b.compare_exchange_strong(__p1, __p2, __m1, __m2); }
[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 Datomic_base.h456 memory_order __m1, memory_order __m2) noexcept in _GLIBCXX_VISIBILITY()
459 memory_order __b1 = __m1 & __memory_order_mask; in _GLIBCXX_VISIBILITY()
465 int(__m1), int(__m2)); in _GLIBCXX_VISIBILITY()
470 memory_order __m1, in _GLIBCXX_VISIBILITY()
474 memory_order __b1 = __m1 & __memory_order_mask; in _GLIBCXX_VISIBILITY()
480 int(__m1), int(__m2)); in _GLIBCXX_VISIBILITY()
501 memory_order __m1, memory_order __m2) noexcept in _GLIBCXX_VISIBILITY()
504 memory_order __b1 = __m1 & __memory_order_mask; in _GLIBCXX_VISIBILITY()
510 int(__m1), int(__m2)); in _GLIBCXX_VISIBILITY()
515 memory_order __m1, in _GLIBCXX_VISIBILITY()
[all …]
H A Dregex.h2101 operator==(const match_results<_Bi_iter, _Alloc>& __m1, in _GLIBCXX_VISIBILITY()
2104 if (__m1.ready() != __m2.ready()) in _GLIBCXX_VISIBILITY()
2106 if (!__m1.ready()) // both are not ready in _GLIBCXX_VISIBILITY()
2108 if (__m1.empty() != __m2.empty()) in _GLIBCXX_VISIBILITY()
2110 if (__m1.empty()) // both are empty in _GLIBCXX_VISIBILITY()
2112 return __m1.prefix() == __m2.prefix() in _GLIBCXX_VISIBILITY()
2113 && __m1.size() == __m2.size() in _GLIBCXX_VISIBILITY()
2114 && std::equal(__m1.begin(), __m1.end(), __m2.begin()) in _GLIBCXX_VISIBILITY()
2115 && __m1.suffix() == __m2.suffix(); in _GLIBCXX_VISIBILITY()
2126 operator!=(const match_results<_Bi_iter, _Alloc>& __m1, in _GLIBCXX_VISIBILITY()
[all …]
H A Drandom.h389 _UIntType1 __m1, typename _CharT, typename _Traits> in _GLIBCXX_VISIBILITY()
393 __a1, __c1, __m1>& __lcr); in _GLIBCXX_VISIBILITY()
409 _UIntType1 __m1, typename _CharT, typename _Traits> in _GLIBCXX_VISIBILITY()
413 __c1, __m1>& __lcr); in _GLIBCXX_VISIBILITY()
606 size_t __m1, size_t __r1, in _GLIBCXX_VISIBILITY()
615 __m1, __r1, __a1, __u1, __d1, __s1, __b1, __t1, __c1, in _GLIBCXX_VISIBILITY()
632 size_t __m1, size_t __r1, in _GLIBCXX_VISIBILITY()
640 std::mersenne_twister_engine<_UIntType1, __w1, __n1, __m1, 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/bits/
H A Datomic_base.h456 memory_order __m1, memory_order __m2) noexcept in _GLIBCXX_VISIBILITY()
459 memory_order __b1 = __m1 & __memory_order_mask; in _GLIBCXX_VISIBILITY()
465 int(__m1), int(__m2)); in _GLIBCXX_VISIBILITY()
470 memory_order __m1, in _GLIBCXX_VISIBILITY()
474 memory_order __b1 = __m1 & __memory_order_mask; in _GLIBCXX_VISIBILITY()
480 int(__m1), int(__m2)); in _GLIBCXX_VISIBILITY()
501 memory_order __m1, memory_order __m2) noexcept in _GLIBCXX_VISIBILITY()
504 memory_order __b1 = __m1 & __memory_order_mask; in _GLIBCXX_VISIBILITY()
510 int(__m1), int(__m2)); in _GLIBCXX_VISIBILITY()
515 memory_order __m1, in _GLIBCXX_VISIBILITY()
[all …]
H A Dregex.h2101 operator==(const match_results<_Bi_iter, _Alloc>& __m1, in _GLIBCXX_VISIBILITY()
2104 if (__m1.ready() != __m2.ready()) in _GLIBCXX_VISIBILITY()
2106 if (!__m1.ready()) // both are not ready in _GLIBCXX_VISIBILITY()
2108 if (__m1.empty() != __m2.empty()) in _GLIBCXX_VISIBILITY()
2110 if (__m1.empty()) // both are empty in _GLIBCXX_VISIBILITY()
2112 return __m1.prefix() == __m2.prefix() in _GLIBCXX_VISIBILITY()
2113 && __m1.size() == __m2.size() in _GLIBCXX_VISIBILITY()
2114 && std::equal(__m1.begin(), __m1.end(), __m2.begin()) in _GLIBCXX_VISIBILITY()
2115 && __m1.suffix() == __m2.suffix(); in _GLIBCXX_VISIBILITY()
2126 operator!=(const match_results<_Bi_iter, _Alloc>& __m1, in _GLIBCXX_VISIBILITY()
[all …]
H A Drandom.h389 _UIntType1 __m1, typename _CharT, typename _Traits> in _GLIBCXX_VISIBILITY()
393 __a1, __c1, __m1>& __lcr); in _GLIBCXX_VISIBILITY()
409 _UIntType1 __m1, typename _CharT, typename _Traits> in _GLIBCXX_VISIBILITY()
413 __c1, __m1>& __lcr); in _GLIBCXX_VISIBILITY()
606 size_t __m1, size_t __r1, in _GLIBCXX_VISIBILITY()
615 __m1, __r1, __a1, __u1, __d1, __s1, __b1, __t1, __c1, in _GLIBCXX_VISIBILITY()
632 size_t __m1, size_t __r1, in _GLIBCXX_VISIBILITY()
640 std::mersenne_twister_engine<_UIntType1, __w1, __n1, __m1, 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 Drandom.h467 _UIntType1 __m1, in _GLIBCXX_VISIBILITY()
472 __m1>& __lcr); in _GLIBCXX_VISIBILITY()
488 _UIntType1 __m1, in _GLIBCXX_VISIBILITY()
492 linear_congruential<_UIntType1, __a1, __c1, __m1>& __lcr); in _GLIBCXX_VISIBILITY()
642 template<class _UIntType1, int __w1, int __n1, int __m1, int __r1, in _GLIBCXX_VISIBILITY()
648 const mersenne_twister<_UIntType1, __w1, __n1, __m1, __r1, in _GLIBCXX_VISIBILITY()
661 template<class _UIntType1, int __w1, int __n1, int __m1, int __r1, in _GLIBCXX_VISIBILITY()
667 mersenne_twister<_UIntType1, __w1, __n1, __m1, __r1, in _GLIBCXX_VISIBILITY()
844 template<typename _IntType1, _IntType1 __m1, int __s1, int __r1, in _GLIBCXX_VISIBILITY()
848 const subtract_with_carry<_IntType1, __m1, __s1, in _GLIBCXX_VISIBILITY()
[all …]
H A Drandom.tcc788 const result_type __m1 = in _M_initialize_max() local
798 _M_max = _M_initialize_max_aux(__m2, __m1, __s2 - __s1) << __s1; in _M_initialize_max()
800 _M_max = _M_initialize_max_aux(__m1, __m2, __s1 - __s2) << __s2; in _M_initialize_max()
H A Dregex2076 operator==(const match_results<_Bi_iter, _Allocator>& __m1,
2086 operator!=(const match_results<_Bi_iter, _Allocator>& __m1,
2088 { return !(__m1 == __m2); }
/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 Drandom.h467 _UIntType1 __m1, in _GLIBCXX_VISIBILITY()
472 __m1>& __lcr); in _GLIBCXX_VISIBILITY()
488 _UIntType1 __m1, in _GLIBCXX_VISIBILITY()
492 linear_congruential<_UIntType1, __a1, __c1, __m1>& __lcr); in _GLIBCXX_VISIBILITY()
642 template<class _UIntType1, int __w1, int __n1, int __m1, int __r1, in _GLIBCXX_VISIBILITY()
648 const mersenne_twister<_UIntType1, __w1, __n1, __m1, __r1, in _GLIBCXX_VISIBILITY()
661 template<class _UIntType1, int __w1, int __n1, int __m1, int __r1, in _GLIBCXX_VISIBILITY()
667 mersenne_twister<_UIntType1, __w1, __n1, __m1, __r1, in _GLIBCXX_VISIBILITY()
844 template<typename _IntType1, _IntType1 __m1, int __s1, int __r1, in _GLIBCXX_VISIBILITY()
848 const subtract_with_carry<_IntType1, __m1, __s1, in _GLIBCXX_VISIBILITY()
[all …]
H A Drandom.tcc788 const result_type __m1 = in _M_initialize_max() local
798 _M_max = _M_initialize_max_aux(__m2, __m1, __s2 - __s1) << __s1; in _M_initialize_max()
800 _M_max = _M_initialize_max_aux(__m1, __m2, __s1 - __s2) << __s2; in _M_initialize_max()
H A Dregex2076 operator==(const match_results<_Bi_iter, _Allocator>& __m1,
2086 operator!=(const match_results<_Bi_iter, _Allocator>& __m1,
2088 { return !(__m1 == __m2); }
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/libcxx/include/
H A Dalgorithm945 _ForwardIterator1 __m1 = __first1;
955 if (++__m1 == __last1) // Source exhausted, return last answer
957 if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first
989 _BidirectionalIterator1 __m1 = __l1;
993 … if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern)
994 return __m1;
995 if (__m1 == __first1) // Otherwise if source exhaused, pattern not found
997 if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1
1031 _RandomAccessIterator1 __m1 = __l1;
1036 return __m1;
[all …]
H A Dfunctional2857 _ForwardIterator1 __m1 = __first1;
2862 return make_pair(__first1, __m1);
2863 if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found
2865 if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1
2903 _RandomAccessIterator1 __m1 = __first1;
2909 … ++__m1; // no need to check range on __m1 because __s guarantees we have enough source
2910 if (!__pred(*__m1, *__m2))
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/libcxx/include/
H A Dalgorithm945 _ForwardIterator1 __m1 = __first1;
955 if (++__m1 == __last1) // Source exhausted, return last answer
957 if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first
989 _BidirectionalIterator1 __m1 = __l1;
993 … if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern)
994 return __m1;
995 if (__m1 == __first1) // Otherwise if source exhaused, pattern not found
997 if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1
1031 _RandomAccessIterator1 __m1 = __l1;
1036 return __m1;
[all …]
H A Dfunctional2857 _ForwardIterator1 __m1 = __first1;
2862 return make_pair(__first1, __m1);
2863 if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found
2865 if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1
2903 _RandomAccessIterator1 __m1 = __first1;
2909 … ++__m1; // no need to check range on __m1 because __s guarantees we have enough source
2910 if (!__pred(*__m1, *__m2))
/OK3568_Linux_fs/kernel/arch/powerpc/include/asm/
H A Dsfp-machine.h267 USItype __m0 = (m0), __m1 = (m1); \
269 (pl) = __m0 * __m1; \
/OK3568_Linux_fs/buildroot/boot/syslinux/
H A D0017-Replace-builtin-strlen-that-appears-to-get-optimized.patch39 static inline int memcmp(const void *__m1, const void *__m2, unsigned int __n)
/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/pstl/
H A Dalgorithm_impl.h2913 const auto __m1 = __left_bound_seq_1 - __first1; in __parallel_set_union_op() local
2914 if (__m1 > __set_algo_cut_off) in __parallel_set_union_op()
2917 … __result += __m1; //we know proper offset due to [first1; left_bound_seq_1) < [first2; last2) in __parallel_set_union_op()
2935 _PSTL_ASSERT(__m1 == 0 || __m2 == 0); in __parallel_set_union_op()
3081 const auto __m1 = __last1 - __left_bound_seq_1 + __n2; in __pattern_set_intersection() local
3082 if (__m1 > __set_algo_cut_off) in __pattern_set_intersection()
/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/pstl/
H A Dalgorithm_impl.h2913 const auto __m1 = __left_bound_seq_1 - __first1; in __parallel_set_union_op() local
2914 if (__m1 > __set_algo_cut_off) in __parallel_set_union_op()
2917 … __result += __m1; //we know proper offset due to [first1; left_bound_seq_1) < [first2; last2) in __parallel_set_union_op()
2935 _PSTL_ASSERT(__m1 == 0 || __m2 == 0); in __parallel_set_union_op()
3081 const auto __m1 = __last1 - __left_bound_seq_1 + __n2; in __pattern_set_intersection() local
3082 if (__m1 > __set_algo_cut_off) in __pattern_set_intersection()
/OK3568_Linux_fs/kernel/kernel/
H A Dsys.c1940 #define __prctl_check_order(__m1, __op, __m2) \ in validate_prctl_map_addr() argument
1941 ((unsigned long)prctl_map->__m1 __op \ in validate_prctl_map_addr()

12