Home
last modified time | relevance | path

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

/llvm-project-15.0.7/clang/lib/Headers/
H A Dmmintrin.h131 _mm_packs_pi16(__m64 __m1, __m64 __m2) in _mm_packs_pi16() argument
161 _mm_packs_pi32(__m64 __m1, __m64 __m2) in _mm_packs_pi32() argument
354 _mm_add_pi8(__m64 __m1, __m64 __m2) in _mm_add_pi8() argument
375 _mm_add_pi16(__m64 __m1, __m64 __m2) in _mm_add_pi16() argument
396 _mm_add_pi32(__m64 __m1, __m64 __m2) in _mm_add_pi32() argument
418 _mm_adds_pi8(__m64 __m1, __m64 __m2) in _mm_adds_pi8() argument
463 _mm_adds_pu8(__m64 __m1, __m64 __m2) in _mm_adds_pu8() argument
506 _mm_sub_pi8(__m64 __m1, __m64 __m2) in _mm_sub_pi8() argument
527 _mm_sub_pi16(__m64 __m1, __m64 __m2) in _mm_sub_pi16() argument
548 _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 …]
/llvm-project-15.0.7/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 …]
/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dfind_end.h65 _Iter2 __m2 = __first2; in __find_end_impl() local
67 if (++__m2 == __last2) { // Pattern exhaused, record answer and search for another one in __find_end_impl()
76 if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) in __find_end_impl()
122 _Iter2 __m2 = __l2; in __find_end() local
124 … if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) in __find_end()
130 if (!std::__invoke(__pred, std::__invoke(__proj1, *--__m1), std::__invoke(__proj2, *--__m2))) in __find_end()
179 _Iter2 __m2 = __l2; in __find_end() local
181 if (__m2 == __first2) in __find_end()
184 if (!std::__invoke(__pred, std::__invoke(__proj1, *--__m1), std::__invoke(*--__m2))) { in __find_end()
H A Dinplace_merge.h156 _BidirectionalIterator __m2; // "median" of [__middle, __last) in __inplace_merge() local
163 __m2 = __middle; in __inplace_merge()
164 _Ops::advance(__m2, __len21); in __inplace_merge()
165 … __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()
195 __middle = __m2; in __inplace_merge()
202 __middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); in __inplace_merge()
H A Dsearch.h57 _Iter2 __m2 = __first2; in __search_forward_impl() local
59 …if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element patter… in __search_forward_impl()
66 if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) in __search_forward_impl()
105 _Iter2 __m2 = __first2; in __search_random_access_impl() local
107 if (++__m2 == __last2) in __search_random_access_impl()
110 if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) { in __search_random_access_impl()
H A Drotate.h114 const difference_type __m2 = _Ops::distance(__middle, __last); in __rotate_gcd() local
115 if (__m1 == __m2) in __rotate_gcd()
120 const difference_type __g = _VSTD::__algo_gcd(__m1, __m2); in __rotate_gcd()
138 return __first + __m2; in __rotate_gcd()
/llvm-project-15.0.7/libcxx/src/ryu/
H A Dd2fixed.cpp265 uint64_t __m2; in __d2fixed_buffered_n() local
268 __m2 = __ieeeMantissa; in __d2fixed_buffered_n()
271 __m2 = (1ull << __DOUBLE_MANTISSA_BITS) | __ieeeMantissa; in __d2fixed_buffered_n()
283 … const uint32_t __digits = __mulShift_mod1e9(__m2 << 8, __POW10_SPLIT[__POW10_OFFSET[__idx] + __i], in __d2fixed_buffered_n()
351 uint32_t __digits = __mulShift_mod1e9(__m2 << 8, __POW10_SPLIT_2[__p], __j + 8); in __d2fixed_buffered_n()
371 … || (__requiredTwos < 60 && __multipleOfPowerOf2(__m2, static_cast<uint32_t>(__requiredTwos))); in __d2fixed_buffered_n()
456 uint64_t __m2; in __d2exp_buffered_n() local
459 __m2 = __ieeeMantissa; in __d2exp_buffered_n()
462 __m2 = (1ull << __DOUBLE_MANTISSA_BITS) | __ieeeMantissa; in __d2exp_buffered_n()
479 __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()
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A Dx86-64-psub.ll33 %__m2.0.insert.i = insertelement <1 x i64> undef, i64 %1, i32 0
36 %4 = bitcast <1 x i64> %__m2.0.insert.i to <8 x i8>
67 %__m2.0.insert.i = insertelement <1 x i64> undef, i64 %1, i32 0
70 %4 = bitcast <1 x i64> %__m2.0.insert.i to <4 x i16>
101 %__m2.0.insert.i = insertelement <1 x i64> undef, i64 %1, i32 0
104 %4 = bitcast <1 x i64> %__m2.0.insert.i to <2 x i32>
135 %__m2.0.insert.i = insertelement <1 x i64> undef, i64 %1, i32 0
138 %4 = bitcast <1 x i64> %__m2.0.insert.i to <8 x i8>
172 %4 = bitcast <1 x i64> %__m2.0.insert.i to <4 x i16>
206 %4 = bitcast <1 x i64> %__m2.0.insert.i to <8 x i8>
[all …]
/llvm-project-15.0.7/libcxx/include/
H A Dlist2112 for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2, (void) ++__ds)
2118 __f2 = __m2;
2122 __f1 = __m2;
2193 for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2)
2198 __e1 = __f2 = __m2;
2200 __m2 = _VSTD::next(__f1);
2202 __f1 = __m2;
2211 for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2)
2216 __e1 = __m2;
2217 __f2 = __m2;
[all …]
/llvm-project-15.0.7/pstl/include/pstl/internal/
H A Dalgorithm_impl.h3084 const auto __m2 = __left_bound_seq_2 - __first2; in __parallel_set_union_op() local
3085 _PSTL_ASSERT(__m1 == 0 || __m2 == 0); in __parallel_set_union_op()
3086 if (__m2 > __set_algo_cut_off) in __parallel_set_union_op()
3089 … __result += __m2; //we know proper offset due to [first2; left_bound_seq_2) < [first1; last1) in __parallel_set_union_op()
3262 const auto __m2 = __last2 - __left_bound_seq_2 + __n1; in __pattern_set_intersection() local
3263 if (__m2 > __set_algo_cut_off) in __pattern_set_intersection()