Searched refs:__m2 (Results 1 – 5 of 5) 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 | 17 %__m2.0.insert.i = insertelement <1 x i64> undef, i64 %1, i32 0 20 %4 = bitcast <1 x i64> %__m2.0.insert.i to <8 x i8> 45 %__m2.0.insert.i = insertelement <1 x i64> undef, i64 %1, i32 0 48 %4 = bitcast <1 x i64> %__m2.0.insert.i to <4 x i16> 74 %__m2.0.insert.i = insertelement <1 x i64> undef, i64 %1, i32 0 77 %4 = bitcast <1 x i64> %__m2.0.insert.i to <2 x i32> 102 %__m2.0.insert.i = insertelement <1 x i64> undef, i64 %1, i32 0 105 %4 = bitcast <1 x i64> %__m2.0.insert.i to <8 x i8> 130 %__m2.0.insert.i = insertelement <1 x i64> undef, i64 %1, i32 0 133 %4 = bitcast <1 x i64> %__m2.0.insert.i to <4 x i16> [all …]
|
/external/libcxx/include/ |
D | list | 2143 iterator __m2 = _VSTD::next(__f2); 2144 for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2, ++__ds) 2149 __node_pointer __l = __m2.__ptr_->__prev_; 2150 __f2 = __m2; 2152 __m2 = _VSTD::next(__f1); 2154 __f1 = __m2; 2225 iterator __m2 = _VSTD::next(__f2); 2226 for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2) 2229 __node_pointer __l = __m2.__ptr_->__prev_; 2231 __e1 = __f2 = __m2; [all …]
|
D | algorithm | 920 _ForwardIterator2 __m2 = __first2; 923 if (++__m2 == __last2) 931 if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 964 _BidirectionalIterator2 __m2 = __l2; 967 … if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 971 if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 1006 _RandomAccessIterator2 __m2 = __l2; 1009 if (__m2 == __first2) 1012 if (!__pred(*--__m1, *--__m2)) 1438 _ForwardIterator2 __m2 = __first2; [all …]
|