| /freebsd/contrib/llvm-project/clang/lib/Headers/ |
| H A D | mmintrin.h | 128 _mm_packs_pi16(__m64 __m1, __m64 __m2) in _mm_packs_pi16() argument
130 return (__m64)__builtin_ia32_packsswb((__v4hi)__m1, (__v4hi)__m2); in _mm_packs_pi16()
153 _mm_packs_pi32(__m64 __m1, __m64 __m2) in _mm_packs_pi32() argument
155 return (__m64)__builtin_ia32_packssdw((__v2si)__m1, (__v2si)__m2); in _mm_packs_pi32()
178 _mm_packs_pu16(__m64 __m1, __m64 __m2) in _mm_packs_pu16() argument
180 return (__m64)__builtin_ia32_packuswb((__v4hi)__m1, (__v4hi)__m2); in _mm_packs_pu16()
205 _mm_unpackhi_pi8(__m64 __m1, __m64 __m2) in _mm_unpackhi_pi8() argument
207 return (__m64)__builtin_ia32_punpckhbw((__v8qi)__m1, (__v8qi)__m2); in _mm_unpackhi_pi8()
228 _mm_unpackhi_pi16(__m64 __m1, __m64 __m2) in _mm_unpackhi_pi16() argument
230 return (__m64)__builtin_ia32_punpckhwd((__v4hi)__m1, (__v4hi)__m2); in _mm_unpackhi_pi16()
[all …]
|
| /freebsd/contrib/llvm-project/clang/lib/Headers/ppc_wrappers/ |
| H A D | mmintrin.h | 152 _mm_packs_pi16(__m64 __m1, __m64 __m2) { in _mm_packs_pi16() argument
158 {__m1, __m2}; in _mm_packs_pi16()
160 {__m2, __m1}; in _mm_packs_pi16()
168 _m_packsswb(__m64 __m1, __m64 __m2) { in _m_packsswb() argument
169 return _mm_packs_pi16(__m1, __m2); in _m_packsswb()
177 _mm_packs_pi32(__m64 __m1, __m64 __m2) { in _mm_packs_pi32() argument
183 {__m1, __m2}; in _mm_packs_pi32()
185 {__m2, __m1}; in _mm_packs_pi32()
193 _m_packssdw(__m64 __m1, __m64 __m2) { in _m_packssdw() argument
194 return _mm_packs_pi32(__m1, __m2); in _m_packssdw()
[all …]
|
| H A D | xmmintrin.h | 1402 __m64_union __m1, __m2, __res; in _mm_max_pi16()
1404 __m1.as_m64 = __A; in _mm_max_pi16()
1407 __res.as_short[0] = (__m1.as_short[0] > __m2.as_short[0]) ? __m1.as_short[0] in _mm_max_pi16()
1409 __res.as_short[1] = (__m1.as_short[1] > __m2.as_short[1]) ? __m1.as_short[1] in _mm_max_pi16()
1411 __res.as_short[2] = (__m1.as_short[2] > __m2.as_short[2]) ? __m1.as_short[2] in _mm_max_pi16()
1413 __res.as_short[3] = (__m1.as_short[3] > __m2.as_short[3]) ? __m1.as_short[3] in _mm_max_pi16()
1440 __m64_union __m1, __m2, __res; in _mm_max_pu8()
1443 __m1.as_m64 = __A; in _mm_max_pu8()
1448 ((unsigned char)__m1.as_char[__i] > (unsigned char)__m2.as_char[__i]) in _mm_max_pu8()
1449 ? __m1.as_char[__i] in _mm_max_pu8()
[all …]
|
| /freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | find_end.h | 63 _Iter1 __m1 = __first1; in __find_end_impl() local
68 __match_last = ++__m1; in __find_end_impl()
72 if (++__m1 == __last1) // Source exhausted, return last answer in __find_end_impl()
75 if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) { in __find_end_impl()
118 _Iter1 __m1 = __l1; in __find_end() local
122 return __m1; in __find_end()
123 if (__m1 == __first1) // Otherwise if source exhaused, pattern not found in __find_end()
127 … if (!std::__invoke(__pred, std::__invoke(__proj1, *--__m1), std::__invoke(__proj2, *--__m2))) { in __find_end()
173 _Iter1 __m1 = __l1; in __find_end() local
177 return __m1; in __find_end()
[all …]
|
| H A D | stable_partition.h | 98 _ForwardIterator __m1 = __m; in __stable_partition_impl()
101 while (__pred(*__m1)) { in __stable_partition_impl()
102 if (++__m1 == __last) in __stable_partition_impl()
108 __second_false = std::__stable_partition_impl<_AlgPolicy, _Predicate&>(__m1, __last, __pred, __len_half, __p, __fit); in __stable_partition_impl()
215 _BidirectionalIterator __m1 = __m; in __stable_partition_impl()
218 while (!__pred(*--__m1)) { in __stable_partition_impl()
219 if (__m1 == __first) in __stable_partition_impl()
225 __first_false = std::__stable_partition_impl<_AlgPolicy, _Predicate&>(__first, __m1, __pred, __len_half, __p, __bit); in __stable_partition_impl()
230 __m1 = __m; in __stable_partition_impl()
234 while (__pred(*__m1)) { in __stable_partition_impl()
99 _ForwardIterator __m1 = __m; __stable_partition_impl() local
227 _BidirectionalIterator __m1 = __m; __stable_partition_impl() local
[all...] |
| H A D | search.h | 55 _Iter1 __m1 = __first1; in __search_forward_impl() local
59 return std::make_pair(__first1, ++__m1); in __search_forward_impl()
60 if (++__m1 == __last1) { // Otherwise if source exhaused, pattern not found in __search_forward_impl()
61 return std::make_pair(__m1, __m1); in __search_forward_impl()
65 if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) { in __search_forward_impl()
106 _Iter1 __m1 = __first1; in __search_random_access_impl() local
111 ++__m1; // no need to check range on __m1 because __s guarantees we have enough source in __search_random_access_impl()
112 if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) { in __search_random_access_impl()
|
| H A D | inplace_merge.h | 159 _BidirectionalIterator __m1; // "median" of [__first, __middle) in __inplace_merge() local
168 __m1 = std::__upper_bound<_AlgPolicy>(__first, __middle, *__m2, __comp, std::__identity()); in __inplace_merge()
169 __len11 = _Ops::distance(__first, __m1); in __inplace_merge()
178 __m1 = __first; in __inplace_merge()
179 _Ops::advance(__m1, __len11); in __inplace_merge()
180 __m2 = std::lower_bound(__middle, __last, *__m1, __comp); in __inplace_merge()
187 __middle = std::__rotate<_AlgPolicy>(__m1, __middle, __m2).first; in __inplace_merge()
191 …std::__inplace_merge<_AlgPolicy>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff… in __inplace_merge()
199 __middle = __m1; in __inplace_merge()
|
| H A D | rotate.h | 102 const difference_type __m1 = __middle - __first; in __rotate_gcd() local
104 if (__m1 == __m2) { in __rotate_gcd()
108 const difference_type __g = std::__algo_gcd(__m1, __m2); in __rotate_gcd()
112 _RandomAccessIterator __p2 = __p1 + __m1; in __rotate_gcd()
117 if (__m1 < __d) in __rotate_gcd()
118 __p2 += __m1; in __rotate_gcd()
120 __p2 = __first + (__m1 - __d); in __rotate_gcd()
|
| /freebsd/contrib/llvm-project/libcxx/include/__pstl/backends/ |
| H A D | libdispatch.h | 167 auto __m1 = __first1 + __chunk_size;
168 auto __m2 = std::lower_bound(__first2, __last2, __m1[-1], __comp);
169 return std::make_pair(__m1, __m2);
172 auto __m1 = std::lower_bound(__first1, __last1, __m2[-1], __comp);
173 return std::make_pair(__m1, __m2);
|
| /freebsd/contrib/llvm-project/libcxx/include/__chrono/ |
| H A D | month.h | 53 _LIBCPP_HIDE_FROM_ABI constexpr month& operator+=(const months& __m1) noexcept;
54 _LIBCPP_HIDE_FROM_ABI constexpr month& operator-=(const months& __m1) noexcept;
|
| /freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/ |
| H A D | algorithm_impl.h | |