Searched refs:__m1 (Results 1 – 4 of 4) sorted by relevance
/external/clang/lib/Headers/ |
D | mmintrin.h | 68 _mm_packs_pi16(__m64 __m1, __m64 __m2) in _mm_packs_pi16() argument 70 return (__m64)__builtin_ia32_packsswb((__v4hi)__m1, (__v4hi)__m2); in _mm_packs_pi16() 74 _mm_packs_pi32(__m64 __m1, __m64 __m2) in _mm_packs_pi32() argument 76 return (__m64)__builtin_ia32_packssdw((__v2si)__m1, (__v2si)__m2); in _mm_packs_pi32() 80 _mm_packs_pu16(__m64 __m1, __m64 __m2) in _mm_packs_pu16() argument 82 return (__m64)__builtin_ia32_packuswb((__v4hi)__m1, (__v4hi)__m2); in _mm_packs_pu16() 86 _mm_unpackhi_pi8(__m64 __m1, __m64 __m2) in _mm_unpackhi_pi8() argument 88 return (__m64)__builtin_ia32_punpckhbw((__v8qi)__m1, (__v8qi)__m2); in _mm_unpackhi_pi8() 92 _mm_unpackhi_pi16(__m64 __m1, __m64 __m2) in _mm_unpackhi_pi16() argument 94 return (__m64)__builtin_ia32_punpckhwd((__v4hi)__m1, (__v4hi)__m2); in _mm_unpackhi_pi16() [all …]
|
D | mm3dnow.h | 38 _m_pavgusb(__m64 __m1, __m64 __m2) { in _m_pavgusb() argument 39 return (__m64)__builtin_ia32_pavgusb((__v8qi)__m1, (__v8qi)__m2); in _m_pavgusb() 48 _m_pfacc(__m64 __m1, __m64 __m2) { in _m_pfacc() argument 49 return (__m64)__builtin_ia32_pfacc((__v2sf)__m1, (__v2sf)__m2); in _m_pfacc() 53 _m_pfadd(__m64 __m1, __m64 __m2) { in _m_pfadd() argument 54 return (__m64)__builtin_ia32_pfadd((__v2sf)__m1, (__v2sf)__m2); in _m_pfadd() 58 _m_pfcmpeq(__m64 __m1, __m64 __m2) { in _m_pfcmpeq() argument 59 return (__m64)__builtin_ia32_pfcmpeq((__v2sf)__m1, (__v2sf)__m2); in _m_pfcmpeq() 63 _m_pfcmpge(__m64 __m1, __m64 __m2) { in _m_pfcmpge() argument 64 return (__m64)__builtin_ia32_pfcmpge((__v2sf)__m1, (__v2sf)__m2); in _m_pfcmpge() [all …]
|
/external/llvm/test/CodeGen/X86/ |
D | x86-64-psub.ll | 16 %__m1.0.insert.i = insertelement <1 x i64> undef, i64 %0, i32 0 18 %2 = bitcast <1 x i64> %__m1.0.insert.i to <8 x i8> 44 %__m1.0.insert.i = insertelement <1 x i64> undef, i64 %0, i32 0 46 %2 = bitcast <1 x i64> %__m1.0.insert.i to <4 x i16> 73 %__m1.0.insert.i = insertelement <1 x i64> undef, i64 %0, i32 0 75 %2 = bitcast <1 x i64> %__m1.0.insert.i to <2 x i32> 101 %__m1.0.insert.i = insertelement <1 x i64> undef, i64 %0, i32 0 103 %2 = bitcast <1 x i64> %__m1.0.insert.i to <8 x i8> 129 %__m1.0.insert.i = insertelement <1 x i64> undef, i64 %0, i32 0 131 %2 = bitcast <1 x i64> %__m1.0.insert.i to <4 x i16> [all …]
|
/external/libcxx/include/ |
D | algorithm | 919 _ForwardIterator1 __m1 = __first1; 929 if (++__m1 == __last1) // Source exhausted, return last answer 931 if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 963 _BidirectionalIterator1 __m1 = __l1; 967 … if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 968 return __m1; 969 if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 971 if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 1005 _RandomAccessIterator1 __m1 = __l1; 1010 return __m1; [all …]
|