Home
last modified time | relevance | path

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

/external/clang/lib/Headers/
Dmmintrin.h67 _mm_packs_pi16(__m64 __m1, __m64 __m2) in _mm_packs_pi16() argument
69 return (__m64)__builtin_ia32_packsswb((__v4hi)__m1, (__v4hi)__m2); in _mm_packs_pi16()
73 _mm_packs_pi32(__m64 __m1, __m64 __m2) in _mm_packs_pi32() argument
75 return (__m64)__builtin_ia32_packssdw((__v2si)__m1, (__v2si)__m2); in _mm_packs_pi32()
79 _mm_packs_pu16(__m64 __m1, __m64 __m2) in _mm_packs_pu16() argument
81 return (__m64)__builtin_ia32_packuswb((__v4hi)__m1, (__v4hi)__m2); in _mm_packs_pu16()
85 _mm_unpackhi_pi8(__m64 __m1, __m64 __m2) in _mm_unpackhi_pi8() argument
87 return (__m64)__builtin_ia32_punpckhbw((__v8qi)__m1, (__v8qi)__m2); in _mm_unpackhi_pi8()
91 _mm_unpackhi_pi16(__m64 __m1, __m64 __m2) in _mm_unpackhi_pi16() argument
93 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.ll17 %__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/
Dlist2124 iterator __m2 = _VSTD::next(__f2);
2125 for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2, ++__ds)
2130 __node_pointer __l = __m2.__ptr_->__prev_;
2131 __f2 = __m2;
2133 __m2 = _VSTD::next(__f1);
2135 __f1 = __m2;
2206 iterator __m2 = _VSTD::next(__f2);
2207 for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2)
2210 __node_pointer __l = __m2.__ptr_->__prev_;
2212 __e1 = __f2 = __m2;
[all …]
Dalgorithm920 _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 …]
/external/opencv3/modules/calib3d/src/
Dfundam.cpp693 Mat __m1 = _m1.getMat(), __m2 = _m2.getMat(), __model = _model.getMat(); in computeError() local
696 const Point2f* m2 = __m2.ptr<Point2f>(); in computeError()