Searched refs:m2 (Results 101 - 125 of 324) sorted by relevance

1234567891011>>

/external/libvpx/libvpx/vp9/encoder/x86/
H A Dvp9_sad_sse2.asm55 movu m2, [refq+16]
60 pavgb m2, [second_predq+mmsize*1]
66 psadbw m2, [srcq+16]
69 paddd m1, m2
98 movu m2, [refq+16]
103 pavgb m2, [second_predq+mmsize*1]
109 psadbw m2, [srcq+16]
112 paddd m1, m2
144 movu m2, [refq+ref_strideq]
149 pavgb m2, [second_pred
[all...]
H A Dvp9_sad4d_sse2.asm36 movd m2, [ref2q+%3]
41 punpckldq m2, [ref2q+%5]
45 psadbw m2, m0
48 punpckldq m1, m2
81 movh m2, [ref2q+%3]
85 movhps m2, [ref2q+%5]
88 psadbw m2, m0
93 paddd m5, m2
122 movu m2, [ref2q+%3]
125 psadbw m2, m
[all...]
H A Dvp9_error_sse2.asm27 mova m2, [uqcq+sizeq*2]
31 psubw m0, m2
37 pmaddwd m2, m2
47 punpckldq m7, m2, m5
49 punpckhdq m2, m5
52 paddq m6, m2
/external/chromium_org/third_party/WebKit/Source/platform/transforms/
H A DAffineTransform.h128 bool operator== (const AffineTransform& m2) const
130 return (m_transform[0] == m2.m_transform[0]
131 && m_transform[1] == m2.m_transform[1]
132 && m_transform[2] == m2.m_transform[2]
133 && m_transform[3] == m2.m_transform[3]
134 && m_transform[4] == m2.m_transform[4]
135 && m_transform[5] == m2.m_transform[5]);
H A DTransformationMatrix.h273 bool operator==(const TransformationMatrix& m2) const
275 return (m_matrix[0][0] == m2.m_matrix[0][0] &&
276 m_matrix[0][1] == m2.m_matrix[0][1] &&
277 m_matrix[0][2] == m2.m_matrix[0][2] &&
278 m_matrix[0][3] == m2.m_matrix[0][3] &&
279 m_matrix[1][0] == m2.m_matrix[1][0] &&
280 m_matrix[1][1] == m2.m_matrix[1][1] &&
281 m_matrix[1][2] == m2.m_matrix[1][2] &&
282 m_matrix[1][3] == m2.m_matrix[1][3] &&
283 m_matrix[2][0] == m2
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/x86/
H A Dvp9_sad4d_sse2.asm36 movd m2, [ref2q+%3]
41 punpckldq m2, [ref2q+%5]
45 psadbw m2, m0
48 punpckldq m1, m2
81 movh m2, [ref2q+%3]
85 movhps m2, [ref2q+%5]
88 psadbw m2, m0
93 paddd m5, m2
122 movu m2, [ref2q+%3]
125 psadbw m2, m
[all...]
H A Dvp9_error_sse2.asm27 mova m2, [uqcq+sizeq*2]
31 psubw m0, m2
37 pmaddwd m2, m2
47 punpckldq m7, m2, m5
49 punpckhdq m2, m5
52 paddq m6, m2
/external/libcxx/test/containers/unord/unord.multiset/
H A Derase_key.pass.cpp158 C m, m2; local
161 m2.insert(i); m2.insert(i);
164 C::iterator i = m2.begin();
166 while (i != m2.end()) {
168 m2.erase(i++);
173 assert (only_deletions (m, m2));
/external/opencv/cv/src/
H A Dcvfundam.cpp63 virtual int runKernel( const CvMat* m1, const CvMat* m2, CvMat* model )=0;
64 virtual bool runLMeDS( const CvMat* m1, const CvMat* m2, CvMat* model,
66 virtual bool runRANSAC( const CvMat* m1, const CvMat* m2, CvMat* model,
73 virtual void computeReprojError( const CvMat* m1, const CvMat* m2,
75 virtual int findInliers( const CvMat* m1, const CvMat* m2,
78 virtual bool getSubset( const CvMat* m1, const CvMat* m2,
109 int CvModelEstimator2::findInliers( const CvMat* m1, const CvMat* m2, argument
117 computeReprojError( m1, m2, model, _err );
162 bool CvModelEstimator2::runRANSAC( const CvMat* m1, const CvMat* m2, CvMat* model, argument
177 CV_ASSERT( CV_ARE_SIZES_EQ(m1, m2)
257 runLMeDS( const CvMat* m1, const CvMat* m2, CvMat* model, CvMat* mask, double confidence, int maxIters ) argument
353 getSubset( const CvMat* m1, const CvMat* m2, CvMat* ms1, CvMat* ms2, int maxAttempts ) argument
444 runKernel( const CvMat* m1, const CvMat* m2, CvMat* H ) argument
506 computeReprojError( const CvMat* m1, const CvMat* m2, const CvMat* model, CvMat* _err ) argument
524 refine( const CvMat* m1, const CvMat* m2, CvMat* model, int maxIters ) argument
678 runKernel( const CvMat* m1, const CvMat* m2, CvMat* model ) argument
694 const CvPoint2D64f* m2 = (const CvPoint2D64f*)_m2->data.ptr; local
803 const CvPoint2D64f* m2 = (const CvPoint2D64f*)_m2->data.ptr; local
918 const CvPoint2D64f* m2 = (const CvPoint2D64f*)_m2->data.ptr; local
951 CvMat *m1 = 0, *m2 = 0, *tempMask = 0; local
[all...]
/external/eigen/test/eigen2/
H A Deigen2_array.cpp27 m2 = MatrixType::Random(rows, cols), local
47 if (!ei_isApprox(m1.sum(), (m1+m2).sum()))
48 VERIFY_IS_NOT_APPROX(((m1+m2).rowwise().sum()).sum(), m1.sum());
65 m2 = MatrixType::Random(rows, cols), local
85 VERIFY_IS_APPROX( (m1.cwise()<m2).select(m1,m2), m1.cwise().min(m2) );
86 VERIFY_IS_APPROX( (m1.cwise()>m2).select(m1,m2), m1.cwise().max(m2) );
[all...]
/external/chromium_org/chrome/browser/ui/app_list/test/
H A Dfast_show_pickler_unittest.cc20 void CheckIsSame(AppListModel* m1, AppListModel* m2) { argument
22 m2->top_level_item_list()->item_count());
25 m2->top_level_item_list()->item_at(i)->id());
27 m2->top_level_item_list()->item_at(i)->name());
29 m2->top_level_item_list()->item_at(i)->short_name());
31 m2->top_level_item_list()->item_at(i)->icon());
/external/libcxx/include/support/win32/
H A Dsupport.h81 static const unsigned int m2 = 0x33333333; local
89 x = (x & m2) + ((x >> 2) & m2);
106 static const unsigned long long m2 = 0x3333333333333333; local
114 x = (x & m2) + ((x >> 2) & m2);
/external/libcxx/test/containers/associative/multiset/multiset.cons/
H A Dmove_alloc.pass.cpp57 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
59 assert(m3 == m2);
95 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
97 assert(m3 == m2);
133 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
135 assert(m3 == m2);
/external/libcxx/test/containers/associative/set/set.cons/
H A Dmove_alloc.pass.cpp57 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
59 assert(m3 == m2);
95 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
97 assert(m3 == m2);
133 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
135 assert(m3 == m2);
/external/libcxx/test/containers/unord/unord.set/
H A Derase_key.pass.cpp157 C m, m2; local
160 m2.insert(i);
163 C::iterator i = m2.begin();
165 while (i != m2.end()) {
167 m2.erase(i++);
172 assert (only_deletions (m, m2));
/external/eigen/test/
H A Dexceptions.cpp100 MatrixType m0(n,n), m1(n,n), m2(n,n);
102 m0.setOnes(); m1.setOnes(); m2.setOnes();
104 CHECK_MEMLEAK(m2 = m0 * m1 * m2);
H A Dhouseholder.cpp53 m2(rows, cols);
58 m2 = m1;
61 VERIFY_IS_APPROX(m1.norm(), m2.norm());
85 m2 = m1;
86 m2.block(shift,0,brows,cols) = qr.matrixQR();
88 HouseholderSequence<MatrixType, HCoeffsVectorType> hseq(m2, hc);
93 MatrixType m5 = m2;
118 TMatrixType tm2 = m2.transpose();
H A Dqr.cpp46 Matrix<Scalar,Cols,Cols2> m2 = Matrix<Scalar,Cols,Cols2>::Random(Cols,Cols2); local
47 Matrix<Scalar,Rows,Cols2> m3 = m1*m2;
48 m2 = Matrix<Scalar,Cols,Cols2>::Random(Cols,Cols2);
49 m2 = qr.solve(m3);
50 VERIFY_IS_APPROX(m3, m1*m2);
62 MatrixType m1(size, size), m2(size, size), m3(size, size);
74 m2 = qr.solve(m3);
75 VERIFY_IS_APPROX(m3, m1*m2);
H A Dqr_fullpivoting.cpp44 MatrixType m2 = MatrixType::Random(cols,cols2); local
45 MatrixType m3 = m1*m2;
46 m2 = MatrixType::Random(cols,cols2);
47 m2 = qr.solve(m3);
48 VERIFY_IS_APPROX(m3, m1*m2);
60 MatrixType m1(size, size), m2(size, size), m3(size, size);
76 m2 = qr.solve(m3);
77 VERIFY_IS_APPROX(m3, m1*m2);
/external/eigen/bench/
H A Dsparse_trisolver.cpp82 Matrix<Scalar,Dynamic,Dynamic,Dynamic,Dynamic,RowMajorBit> m2(rows,cols);
84 m2 = m1;
90 BENCH(x = m2.marked<UpperTriangular>().solveTriangular(b);)
139 gmm::csr_matrix<Scalar> m2; local
141 gmm::copy(m1,m2);
152 BENCH(gmm::upper_tri_solve(m2, gmmX, false);)
164 MtlSparseRowMajor m2(rows,cols);
166 m2 = m1;
174 BENCH(x = mtl::upper_trisolve(m2,b);)
/external/bison/src/
H A Duniqstr.c113 hash_compare_uniqstr (void const *m1, void const *m2)
115 return strcmp (m1, m2) == 0;
112 hash_compare_uniqstr(void const *m1, void const *m2) argument
/external/chromium_org/third_party/skia/tests/
H A DMessageBusTest.cpp23 const TestMessage m2 = { 6, 4.3f }; local
25 SkMessageBus<TestMessage>::Post(m2);
/external/libcxx/test/containers/associative/map/map.cons/
H A Dmove_alloc.pass.cpp59 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
61 assert(m3 == m2);
98 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
100 assert(m3 == m2);
137 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
139 assert(m3 == m2);
177 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A());
179 assert(m3 == m2);
H A Dmove_assign.pass.cpp59 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
62 assert(m3 == m2);
99 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
102 assert(m3 == m2);
139 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
142 assert(m3 == m2);
180 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A());
183 assert(m3 == m2);
/external/libcxx/test/containers/associative/multimap/multimap.cons/
H A Dmove_alloc.pass.cpp59 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
61 assert(m3 == m2);
98 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
100 assert(m3 == m2);
137 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
139 assert(m3 == m2);
177 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A());
179 assert(m3 == m2);

Completed in 5024 milliseconds

1234567891011>>