/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() 1405 __m2.as_m64 = __B; 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() 1408 : __m2.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() 1410 : __m2.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() 1412 : __m2.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() 1414 : __m2.as_short[3]; in _mm_max_pi16() [all …]
|
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
H A D | find_end.h | 64 _Iter2 __m2 = __first2; in __find_end_impl() local 66 if (++__m2 == __last2) { // Pattern exhaused, record answer and search for another one in __find_end_impl() 75 if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) { in __find_end_impl() 119 _Iter2 __m2 = __l2; in __find_end() local 121 … if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) in __find_end() 127 … if (!std::__invoke(__pred, std::__invoke(__proj1, *--__m1), std::__invoke(__proj2, *--__m2))) { in __find_end() 174 _Iter2 __m2 = __l2; in __find_end() local 176 if (__m2 == __first2) in __find_end() 179 if (!std::__invoke(__pred, std::__invoke(__proj1, *--__m1), std::__invoke(*--__m2))) { in __find_end()
|
H A D | inplace_merge.h | 160 _BidirectionalIterator __m2; // "median" of [__middle, __last) in __inplace_merge() local 166 __m2 = __middle; in __inplace_merge() 167 _Ops::advance(__m2, __len21); in __inplace_merge() 168 __m1 = std::__upper_bound<_AlgPolicy>(__first, __middle, *__m2, __comp, std::__identity()); in __inplace_merge() 180 __m2 = std::lower_bound(__middle, __last, *__m1, __comp); in __inplace_merge() 181 __len21 = _Ops::distance(__middle, __m2); in __inplace_merge() 187 __middle = std::__rotate<_AlgPolicy>(__m1, __middle, __m2).first; in __inplace_merge() 193 __middle = __m2; in __inplace_merge() 197 …std::__inplace_merge<_AlgPolicy>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_… in __inplace_merge()
|
H A D | search.h | 56 _Iter2 __m2 = __first2; in __search_forward_impl() local 58 …if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element patter… in __search_forward_impl() 65 if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) { in __search_forward_impl() 107 _Iter2 __m2 = __first2; in __search_random_access_impl() local 109 if (++__m2 == __last2) 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 | rotate.h | 103 const difference_type __m2 = _Ops::distance(__middle, __last); in __rotate_gcd() local 104 if (__m1 == __m2) { in __rotate_gcd() 108 const difference_type __g = std::__algo_gcd(__m1, __m2); in __rotate_gcd() 124 return __first + __m2; in __rotate_gcd()
|
/freebsd/contrib/llvm-project/libcxx/src/ryu/ |
H A D | d2fixed.cpp | 264 uint64_t __m2; in __d2fixed_buffered_n() local 267 __m2 = __ieeeMantissa; in __d2fixed_buffered_n() 270 __m2 = (1ull << __DOUBLE_MANTISSA_BITS) | __ieeeMantissa; in __d2fixed_buffered_n() 282 const uint32_t __digits = __mulShift_mod1e9(__m2 << 8, __POW10_SPLIT[__POW10_OFFSET[__idx] + __i], in __d2fixed_buffered_n() 350 uint32_t __digits = __mulShift_mod1e9(__m2 << 8, __POW10_SPLIT_2[__p], __j + 8); in __d2fixed_buffered_n() 370 || (__requiredTwos < 60 && __multipleOfPowerOf2(__m2, static_cast<uint32_t>(__requiredTwos))); in __d2fixed_buffered_n() 455 uint64_t __m2; in __d2exp_buffered_n() local 458 __m2 = __ieeeMantissa; in __d2exp_buffered_n() 461 __m2 = (1ull << __DOUBLE_MANTISSA_BITS) | __ieeeMantissa; in __d2exp_buffered_n() 478 __digits = __mulShift_mod1e9(__m2 << in __d2exp_buffered_n() [all...] |
H A D | d2s.cpp | 185 uint64_t __m2; in __d2d() local 189 __m2 = __ieeeMantissa; in __d2d() 192 __m2 = (1ull << __DOUBLE_MANTISSA_BITS) | __ieeeMantissa; in __d2d() 194 const bool __even = (__m2 & 1) == 0; in __d2d() 198 const uint64_t __mv = 4 * __m2; in __d2d() 202 // uint64_t __mp = 4 * __m2 + 2; in __d2d() 217 __vr = __mulShiftAll(__m2, __DOUBLE_POW5_INV_SPLIT[__q], __i, &__vp, &__vm, __mmShift); in __d2d() 242 __vr = __mulShiftAll(__m2, __DOUBLE_POW5_SPLIT[__i], __j, &__vp, &__vm, __mmShift); in __d2d() 245 // __mv = 4 * __m2, so it always has at least two trailing 0 bits. in __d2d() 673 const uint64_t __m2 in __d2d_small_int() local [all...] |
H A D | f2s.cpp | 158 uint32_t __m2; in __f2d() local 162 __m2 = __ieeeMantissa; in __f2d() 165 __m2 = (1u << __FLOAT_MANTISSA_BITS) | __ieeeMantissa; in __f2d() 167 const bool __even = (__m2 & 1) == 0; in __f2d() 171 const uint32_t __mv = 4 * __m2; in __f2d() 172 const uint32_t __mp = 4 * __m2 + 2; in __f2d() 175 const uint32_t __mm = 4 * __m2 - 1 - __mmShift; in __f2d() 225 // __mv = 4 * __m2, so it always has at least two trailing 0 bits. in __f2d()
|
/freebsd/contrib/llvm-project/libcxx/include/__pstl/backends/ |
H A D | libdispatch.h | 168 auto __m2 = std::lower_bound(__first2, __last2, __m1[-1], __comp); 169 return std::make_pair(__m1, __m2); 171 auto __m2 = __first2 + __chunk_size; 172 auto __m1 = std::lower_bound(__first1, __last1, __m2[-1], __comp); 173 return std::make_pair(__m1, __m2);
|
/freebsd/contrib/llvm-project/libcxx/include/ |
H A D | list | 1543 iterator __m2 = std::next(__f2); 1544 for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2, (void)++__ds) 1549 __link_pointer __l = __m2.__ptr_->__prev_; 1550 __f2 = __m2; 1552 __m2 = std::next(__f1); 1554 __f1 = __m2; 1595 iterator __m2 = std::next(__f2); 1596 for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2) 1599 __link_pointer __l = __m2.__ptr_->__prev_; 1601 __e1 = __f2 = __m2; [all …]
|
/freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/ |
H A D | algorithm_impl.h |
|