Home
last modified time | relevance | path

Searched refs:__m1 (Results 1 – 6 of 6) sorted by relevance

/external/clang/lib/Headers/
Dmmintrin.h141 _mm_packs_pi16(__m64 __m1, __m64 __m2) in _mm_packs_pi16() argument
143 return (__m64)__builtin_ia32_packsswb((__v4hi)__m1, (__v4hi)__m2); in _mm_packs_pi16()
171 _mm_packs_pi32(__m64 __m1, __m64 __m2) in _mm_packs_pi32() argument
173 return (__m64)__builtin_ia32_packssdw((__v2si)__m1, (__v2si)__m2); in _mm_packs_pi32()
201 _mm_packs_pu16(__m64 __m1, __m64 __m2) in _mm_packs_pu16() argument
203 return (__m64)__builtin_ia32_packuswb((__v4hi)__m1, (__v4hi)__m2); in _mm_packs_pu16()
228 _mm_unpackhi_pi8(__m64 __m1, __m64 __m2) in _mm_unpackhi_pi8() argument
230 return (__m64)__builtin_ia32_punpckhbw((__v8qi)__m1, (__v8qi)__m2); in _mm_unpackhi_pi8()
251 _mm_unpackhi_pi16(__m64 __m1, __m64 __m2) in _mm_unpackhi_pi16() argument
253 return (__m64)__builtin_ia32_punpckhwd((__v4hi)__m1, (__v4hi)__m2); in _mm_unpackhi_pi16()
[all …]
Dmm3dnow.h41 _m_pavgusb(__m64 __m1, __m64 __m2) { in _m_pavgusb() argument
42 return (__m64)__builtin_ia32_pavgusb((__v8qi)__m1, (__v8qi)__m2); in _m_pavgusb()
51 _m_pfacc(__m64 __m1, __m64 __m2) { in _m_pfacc() argument
52 return (__m64)__builtin_ia32_pfacc((__v2sf)__m1, (__v2sf)__m2); in _m_pfacc()
56 _m_pfadd(__m64 __m1, __m64 __m2) { in _m_pfadd() argument
57 return (__m64)__builtin_ia32_pfadd((__v2sf)__m1, (__v2sf)__m2); in _m_pfadd()
61 _m_pfcmpeq(__m64 __m1, __m64 __m2) { in _m_pfcmpeq() argument
62 return (__m64)__builtin_ia32_pfcmpeq((__v2sf)__m1, (__v2sf)__m2); in _m_pfcmpeq()
66 _m_pfcmpge(__m64 __m1, __m64 __m2) { in _m_pfcmpge() argument
67 return (__m64)__builtin_ia32_pfcmpge((__v2sf)__m1, (__v2sf)__m2); in _m_pfcmpge()
[all …]
/external/llvm/test/CodeGen/X86/
Dx86-64-psub.ll16 %__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/syslinux/dos/
Dstring.h16 static inline int memcmp(const void *__m1, const void *__m2, unsigned int __n) in memcmp() argument
19 asm volatile ("cld ; repe ; cmpsb ; setne %0":"=abd" (rv), "+D"(__m1), in memcmp()
/external/libcxx/include/
Dalgorithm1053 _ForwardIterator1 __m1 = __first1;
1063 if (++__m1 == __last1) // Source exhausted, return last answer
1065 if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first
1097 _BidirectionalIterator1 __m1 = __l1;
1101 … if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern)
1102 return __m1;
1103 if (__m1 == __first1) // Otherwise if source exhaused, pattern not found
1105 if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1
1139 _RandomAccessIterator1 __m1 = __l1;
1144 return __m1;
[all …]
Dfunctional2434 _ForwardIterator1 __m1 = __first1;
2439 return make_pair(__first1, __m1);
2440 if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found
2442 if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1
2480 _RandomAccessIterator1 __m1 = __first1;
2486 … ++__m1; // no need to check range on __m1 because __s guarantees we have enough source
2487 if (!__pred(*__m1, *__m2))