| /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 D | mmintrin.h | 80 _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/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 D | atomic | 129 memory_order __m2) noexcept
130 { return _M_base.compare_exchange_weak(__i1, __i2, __m1, __m2); }
134 memory_order __m2) volatile noexcept
135 { return _M_base.compare_exchange_weak(__i1, __i2, __m1, __m2); }
149 memory_order __m2) noexcept
150 { return _M_base.compare_exchange_strong(__i1, __i2, __m1, __m2); }
154 memory_order __m2) volatile noexcept
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 D | atomic | 129 memory_order __m2) noexcept
130 { return _M_base.compare_exchange_weak(__i1, __i2, __m1, __m2); }
134 memory_order __m2) volatile noexcept
135 { return _M_base.compare_exchange_weak(__i1, __i2, __m1, __m2); }
149 memory_order __m2) noexcept
150 { return _M_base.compare_exchange_strong(__i1, __i2, __m1, __m2); }
154 memory_order __m2) volatile noexcept
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 D | atomic_base.h | 456 memory_order __m1, memory_order __m2) noexcept in _GLIBCXX_VISIBILITY()
458 memory_order __b2 = __m2 & __memory_order_mask; in _GLIBCXX_VISIBILITY()
465 int(__m1), int(__m2)); in _GLIBCXX_VISIBILITY()
471 memory_order __m2) volatile noexcept in _GLIBCXX_VISIBILITY()
473 memory_order __b2 = __m2 & __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()
503 memory_order __b2 = __m2 & __memory_order_mask; in _GLIBCXX_VISIBILITY()
510 int(__m1), int(__m2)); in _GLIBCXX_VISIBILITY()
516 memory_order __m2) volatile noexcept in _GLIBCXX_VISIBILITY()
[all …]
|
| H A D | regex.h | 2102 const match_results<_Bi_iter, _Alloc>& __m2) in _GLIBCXX_VISIBILITY()
2104 if (__m1.ready() != __m2.ready()) in _GLIBCXX_VISIBILITY()
2108 if (__m1.empty() != __m2.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()
2127 const match_results<_Bi_iter, _Alloc>& __m2) in _GLIBCXX_VISIBILITY()
2128 { return !(__m1 == __m2); } 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 D | atomic_base.h | 456 memory_order __m1, memory_order __m2) noexcept in _GLIBCXX_VISIBILITY()
458 memory_order __b2 = __m2 & __memory_order_mask; in _GLIBCXX_VISIBILITY()
465 int(__m1), int(__m2)); in _GLIBCXX_VISIBILITY()
471 memory_order __m2) volatile noexcept in _GLIBCXX_VISIBILITY()
473 memory_order __b2 = __m2 & __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()
503 memory_order __b2 = __m2 & __memory_order_mask; in _GLIBCXX_VISIBILITY()
510 int(__m1), int(__m2)); in _GLIBCXX_VISIBILITY()
516 memory_order __m2) volatile noexcept in _GLIBCXX_VISIBILITY()
[all …]
|
| H A D | regex.h | 2102 const match_results<_Bi_iter, _Alloc>& __m2) in _GLIBCXX_VISIBILITY()
2104 if (__m1.ready() != __m2.ready()) in _GLIBCXX_VISIBILITY()
2108 if (__m1.empty() != __m2.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()
2127 const match_results<_Bi_iter, _Alloc>& __m2) in _GLIBCXX_VISIBILITY()
2128 { return !(__m1 == __m2); } in _GLIBCXX_VISIBILITY()
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/libcxx/include/ |
| H A D | list | 2228 iterator __m2 = _VSTD::next(__f2);
2229 for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2, ++__ds)
2234 __link_pointer __l = __m2.__ptr_->__prev_;
2235 __f2 = __m2;
2237 __m2 = _VSTD::next(__f1);
2239 __f1 = __m2;
2309 iterator __m2 = _VSTD::next(__f2);
2310 for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2)
2313 __link_pointer __l = __m2.__ptr_->__prev_;
2315 __e1 = __f2 = __m2;
[all …]
|
| H A D | algorithm | 946 _ForwardIterator2 __m2 = __first2;
949 if (++__m2 == __last2)
957 if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first
990 _BidirectionalIterator2 __m2 = __l2;
993 … if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern)
997 if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1
1032 _RandomAccessIterator2 __m2 = __l2;
1035 if (__m2 == __first2)
1038 if (!__pred(*--__m1, *--__m2))
2321 const difference_type __m2 = __last - __middle;
[all …]
|
| H A D | functional | 2858 _ForwardIterator2 __m2 = __first2;
2861 …if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element patte…
2865 if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1
2904 _RandomAccessIterator2 __m2 = __first2;
2907 if (++__m2 == __last2)
2910 if (!__pred(*__m1, *__m2))
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/libcxx/include/ |
| H A D | list | 2228 iterator __m2 = _VSTD::next(__f2);
2229 for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2, ++__ds)
2234 __link_pointer __l = __m2.__ptr_->__prev_;
2235 __f2 = __m2;
2237 __m2 = _VSTD::next(__f1);
2239 __f1 = __m2;
2309 iterator __m2 = _VSTD::next(__f2);
2310 for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2)
2313 __link_pointer __l = __m2.__ptr_->__prev_;
2315 __e1 = __f2 = __m2;
[all …]
|
| H A D | algorithm | 946 _ForwardIterator2 __m2 = __first2;
949 if (++__m2 == __last2)
957 if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first
990 _BidirectionalIterator2 __m2 = __l2;
993 … if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern)
997 if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1
1032 _RandomAccessIterator2 __m2 = __l2;
1035 if (__m2 == __first2)
1038 if (!__pred(*--__m1, *--__m2))
2321 const difference_type __m2 = __last - __middle;
[all …]
|
| H A D | functional | 2858 _ForwardIterator2 __m2 = __first2;
2861 …if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element patte…
2865 if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1
2904 _RandomAccessIterator2 __m2 = __first2;
2907 if (++__m2 == __last2)
2910 if (!__pred(*__m1, *__m2))
|
| /OK3568_Linux_fs/buildroot/boot/syslinux/ |
| H A D | 0017-Replace-builtin-strlen-that-appears-to-get-optimized.patch | 39 static inline int memcmp(const void *__m1, const void *__m2, unsigned int __n)
|
| /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 D | random.tcc | 792 const result_type __m2 = 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 D | regex | 2077 const match_results<_Bi_iter, _Allocator>& __m2);
2087 const match_results<_Bi_iter, _Allocator>& __m2)
2088 { return !(__m1 == __m2); }
|
| /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 D | random.tcc | 792 const result_type __m2 = 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 D | regex | 2077 const match_results<_Bi_iter, _Allocator>& __m2);
2087 const match_results<_Bi_iter, _Allocator>& __m2)
2088 { return !(__m1 == __m2); }
|
| /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 D | algorithm_impl.h | 2934 const auto __m2 = __left_bound_seq_2 - __first2; in __parallel_set_union_op() local
2935 _PSTL_ASSERT(__m1 == 0 || __m2 == 0); in __parallel_set_union_op()
2936 if (__m2 > __set_algo_cut_off) in __parallel_set_union_op()
2939 … __result += __m2; //we know proper offset due to [first2; left_bound_seq_2) < [first1; last1) in __parallel_set_union_op()
3095 const auto __m2 = __last2 - __left_bound_seq_2 + __n1; in __pattern_set_intersection() local
3096 if (__m2 > __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 D | algorithm_impl.h | 2934 const auto __m2 = __left_bound_seq_2 - __first2; in __parallel_set_union_op() local
2935 _PSTL_ASSERT(__m1 == 0 || __m2 == 0); in __parallel_set_union_op()
2936 if (__m2 > __set_algo_cut_off) in __parallel_set_union_op()
2939 … __result += __m2; //we know proper offset due to [first2; left_bound_seq_2) < [first1; last1) in __parallel_set_union_op()
3095 const auto __m2 = __last2 - __left_bound_seq_2 + __n1; in __pattern_set_intersection() local
3096 if (__m2 > __set_algo_cut_off) in __pattern_set_intersection()
|
| /OK3568_Linux_fs/kernel/kernel/ |
| H A D | sys.c | 1940 #define __prctl_check_order(__m1, __op, __m2) \ in validate_prctl_map_addr() argument
1942 (unsigned long)prctl_map->__m2) ? 0 : -EINVAL in validate_prctl_map_addr()
|