Home
last modified time | relevance | path

Searched refs:__m2 (Results 1 – 13 of 13) sorted by relevance

/freebsd/contrib/llvm-project/clang/lib/Headers/
H A Dmmintrin.h133 _mm_packs_pi16(__m64 __m1, __m64 __m2) in _mm_packs_pi16() argument
163 _mm_packs_pi32(__m64 __m1, __m64 __m2) in _mm_packs_pi32() argument
356 _mm_add_pi8(__m64 __m1, __m64 __m2) in _mm_add_pi8() argument
377 _mm_add_pi16(__m64 __m1, __m64 __m2) in _mm_add_pi16() argument
398 _mm_add_pi32(__m64 __m1, __m64 __m2) in _mm_add_pi32() argument
420 _mm_adds_pi8(__m64 __m1, __m64 __m2) in _mm_adds_pi8() argument
465 _mm_adds_pu8(__m64 __m1, __m64 __m2) in _mm_adds_pu8() argument
508 _mm_sub_pi8(__m64 __m1, __m64 __m2) in _mm_sub_pi8() argument
529 _mm_sub_pi16(__m64 __m1, __m64 __m2) in _mm_sub_pi16() argument
550 _mm_sub_pi32(__m64 __m1, __m64 __m2) in _mm_sub_pi32() argument
[all …]
H A Dmm3dnow.h27 _m_pavgusb(__m64 __m1, __m64 __m2) { in _m_pavgusb() argument
37 _m_pfacc(__m64 __m1, __m64 __m2) { in _m_pfacc() argument
42 _m_pfadd(__m64 __m1, __m64 __m2) { in _m_pfadd() argument
47 _m_pfcmpeq(__m64 __m1, __m64 __m2) { in _m_pfcmpeq() argument
52 _m_pfcmpge(__m64 __m1, __m64 __m2) { in _m_pfcmpge() argument
57 _m_pfcmpgt(__m64 __m1, __m64 __m2) { in _m_pfcmpgt() argument
62 _m_pfmax(__m64 __m1, __m64 __m2) { in _m_pfmax() argument
67 _m_pfmin(__m64 __m1, __m64 __m2) { in _m_pfmin() argument
72 _m_pfmul(__m64 __m1, __m64 __m2) { in _m_pfmul() argument
102 _m_pfsub(__m64 __m1, __m64 __m2) { in _m_pfsub() argument
[all …]
/freebsd/contrib/llvm-project/clang/lib/Headers/ppc_wrappers/
H A Dmmintrin.h158 {__m1, __m2}; in _mm_packs_pi16()
160 {__m2, __m1}; in _mm_packs_pi16()
183 {__m1, __m2}; in _mm_packs_pi32()
185 {__m2, __m1}; in _mm_packs_pi32()
206 {__m1, __m2}; in _mm_packs_pu16()
208 {__m2, __m1}; in _mm_packs_pu16()
242 __mu2.as_m64 = __m2; in _mm_unpackhi_pi8()
271 __mu2.as_m64 = __m2; in _mm_unpackhi_pi16()
294 __mu2.as_m64 = __m2; in _mm_unpackhi_pi32()
323 __mu2.as_m64 = __m2; in _mm_unpacklo_pi8()
[all …]
H A Dxmmintrin.h1402 __m64_union __m1, __m2, __res; in _mm_max_pi16()
1405 __m2.as_m64 = __B; in _mm_max_pi16()
1440 __m64_union __m1, __m2, __res; in _mm_max_pu8()
1444 __m2.as_m64 = __B; in _mm_max_pu8()
1448 ((unsigned char)__m1.as_char[__i] > (unsigned char)__m2.as_char[__i]) in _mm_max_pu8()
1450 : __m2.as_char[__i]; in _mm_max_pu8()
1476 __m64_union __m1, __m2, __res; in _mm_min_pi16()
1479 __m2.as_m64 = __B; in _mm_min_pi16()
1514 __m64_union __m1, __m2, __res; in _mm_min_pu8()
1518 __m2.as_m64 = __B; in _mm_min_pu8()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dfind_end.h64 _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 Dinplace_merge.h160 _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 Dsearch.h56 _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 Drotate.h103 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 Dd2fixed.cpp264 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 << 8, __POW10_SPLIT[__POW10_OFFSET[__idx] + __i], in __d2exp_buffered_n()
[all …]
H A Dd2s.cpp185 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()
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()
673 const uint64_t __m2 = (1ull << __DOUBLE_MANTISSA_BITS) | __ieeeMantissa; in __d2d_small_int() local
690 const uint64_t __fraction = __m2 & __mask; in __d2d_small_int()
698 __v->__mantissa = __m2 >> -__e2; in __d2d_small_int()
H A Df2s.cpp158 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()
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/pstl_backends/cpu_backends/
H A Dlibdispatch.h158 auto __m2 = std::lower_bound(__first2, __last2, __m1[-1], __comp); in __parallel_merge() local
159 return std::make_pair(__m1, __m2); in __parallel_merge()
161 auto __m2 = __first2 + __chunk_size; in __parallel_merge() local
162 auto __m1 = std::lower_bound(__first1, __last1, __m2[-1], __comp); in __parallel_merge()
163 return std::make_pair(__m1, __m2); in __parallel_merge()
/freebsd/contrib/llvm-project/libcxx/include/
H A Dlist1566 for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2, (void)++__ds)
1576 __f1 = __m2;
1618 for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2)
1623 __e1 = __f2 = __m2;
1625 __m2 = std::next(__f1);
1627 __f1 = __m2;
1633 for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2)
1638 __e1 = __m2;
1639 __f2 = __m2;
1641 __m2 = std::next(__f1);
[all …]