/external/chromium_org/third_party/libyuv/source/ |
H A D | row_x86.asm | 34 mov%2 m1, [src_yuy2q + mmsize] 38 pand m1, m1, m2 41 psrlw m1, m1, 8 43 packuswb m0, m0, m1 80 mov%1 m1, [src_uvq + mmsize] 83 psrlw m3, m1, 8 85 pand m1, m1, m [all...] |
/external/clang/test/CodeGenCXX/ |
H A D | constructor-for-array-members.cpp | 37 M m1; local 38 m1.pr();
|
/external/clang/test/SemaCXX/ |
H A D | composite-pointer-type.cpp | 50 bool f(Matrix4 m1, const Matrix4 m2) { argument 51 return m1 != m2;
|
/external/eigen/demos/mix_eigen_and_c/ |
H A D | binary_library.cpp | 122 void MatrixXd_multiply(const C_MatrixXd *m1, const C_MatrixXd *m2, C_MatrixXd *result) argument 124 c_to_eigen(result) = c_to_eigen(m1) * c_to_eigen(m2); 127 void MatrixXd_add(const C_MatrixXd *m1, const C_MatrixXd *m2, C_MatrixXd *result) argument 129 c_to_eigen(result) = c_to_eigen(m1) + c_to_eigen(m2); 177 void Map_MatrixXd_multiply(const C_Map_MatrixXd *m1, const C_Map_MatrixXd *m2, C_Map_MatrixXd *result) argument 179 c_to_eigen(result) = c_to_eigen(m1) * c_to_eigen(m2); 182 void Map_MatrixXd_add(const C_Map_MatrixXd *m1, const C_Map_MatrixXd *m2, C_Map_MatrixXd *result) argument 184 c_to_eigen(result) = c_to_eigen(m1) + c_to_eigen(m2);
|
/external/eigen/test/ |
H A D | sparse_basic.cpp | 103 DenseMatrix m1(rows,cols); 104 m1.setZero(); 113 if (m1.coeff(i,j)==Scalar(0)) 114 m2.insert(i,j) = m1(i,j) = internal::random<Scalar>(); 118 VERIFY_IS_APPROX(m2,m1); 123 DenseMatrix m1(rows,cols); 124 m1.setZero(); 132 if ((m1.coeff(i,j)==Scalar(0)) && (internal::random<int>()%2)) 133 m2.insert(i,j) = m1(i,j) = internal::random<Scalar>(); 138 m1( [all...] |
H A D | array_replicate.cpp | 26 MatrixType m1 = MatrixType::Random(rows, cols), local 40 x1.block(i*rows,j*cols,rows,cols) = m1; 41 VERIFY_IS_APPROX(x1, m1.replicate(f1,f2));
|
/external/valgrind/main/VEX/test/ |
H A D | rounderr.c | 3 m1 = 1.20000000000000018, exp = 1.19999999999999996 8 m1 = 1.20000000000000018, exp = 1.19999999999999996 13 m1 = 1.19999999999999996, exp = 1.19999999999999996 18 m1 = 1.19999999999999996, exp = 1.19999999999999996 23 m1 = 1.20000000000000040, exp = 1.19999999999999996 28 m1 = 1.20000000000000018, exp = 1.19999999999999996 87 double m1 = my_mean1 (numacc2, 1, nacc2); local 90 printf("m1 = %19.17f, exp = %19.17f\n", m1, expected_mean);
|
/external/eigen/test/eigen2/ |
H A D | eigen2_sparse_basic.cpp | 167 DenseMatrix m1(rows,cols); 168 m1.setZero(); 176 if (m1.coeff(i,j)==Scalar(0)) 177 m2.fillrand(i,j) = m1(i,j) = ei_random<Scalar>(); 181 VERIFY_IS_APPROX(m2,m1); 186 SparseMatrixType m1(rows,cols), m2(rows,cols); 188 initSparse<Scalar>(density, refM1, m1); 191 for (int j=0; j<m1.outerSize(); ++j) 192 for (typename SparseMatrixType::InnerIterator i(m1,j); i; ++i) 195 VERIFY_IS_APPROX(m1, m [all...] |
/external/valgrind/main/VEX/priv/ |
H A D | s390_disasm.c | 179 bcr_operand(UInt m1) argument 181 if (m1 == 0) return "nopr"; 182 if (m1 == 15) return "br"; 184 return construct_mnemonic("b", "r", m1); 190 bc_operand(UInt m1) argument 192 if (m1 == 0) return "nop"; 193 if (m1 == 15) return "b"; 195 return construct_mnemonic("b", "", m1); 201 brc_operand(UInt m1) argument 203 if (m1 212 brcl_operand(UInt m1) argument [all...] |
/external/opencv/cv/src/ |
H A D | cvfundam.cpp | 63 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 176 int count = m1 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 693 const CvPoint2D64f* m1 = (const CvPoint2D64f*)_m1->data.ptr; local 802 const CvPoint2D64f* m1 = (const CvPoint2D64f*)_m1->data.ptr; local 917 const CvPoint2D64f* m1 = (const CvPoint2D64f*)_m1->data.ptr; local 951 CvMat *m1 = 0, *m2 = 0, *tempMask = 0; local [all...] |
/external/libcxx/test/containers/associative/map/map.cons/ |
H A D | move_alloc.pass.cpp | 46 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 60 M m3(std::move(m1), A(7)); 64 assert(m1.empty()); 85 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 99 M m3(std::move(m1), A(5)); 103 assert(m1.empty()); 124 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 138 M m3(std::move(m1), A(5)); 142 assert(m1.empty()); 164 M m1( [all...] |
H A D | move_assign.pass.cpp | 46 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 61 m3 = std::move(m1); 65 assert(m1.empty()); 86 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 101 m3 = std::move(m1); 105 assert(m1.empty()); 126 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 141 m3 = std::move(m1); 145 assert(m1.empty()); 167 M m1( [all...] |
/external/libcxx/test/containers/associative/multimap/multimap.cons/ |
H A D | move_alloc.pass.cpp | 46 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 60 M m3(std::move(m1), A(7)); 64 assert(m1.empty()); 85 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 99 M m3(std::move(m1), A(5)); 103 assert(m1.empty()); 124 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 138 M m3(std::move(m1), A(5)); 142 assert(m1.empty()); 164 M m1( [all...] |
H A D | move_assign.pass.cpp | 46 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 61 m3 = std::move(m1); 65 assert(m1.empty()); 86 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 101 m3 = std::move(m1); 105 assert(m1.empty()); 126 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 141 m3 = std::move(m1); 145 assert(m1.empty()); 167 M m1( [all...] |
/external/libcxx/test/containers/associative/multiset/multiset.cons/ |
H A D | move_assign.pass.cpp | 45 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 60 m3 = std::move(m1); 64 assert(m1.empty()); 84 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 99 m3 = std::move(m1); 103 assert(m1.empty()); 123 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 138 m3 = std::move(m1); 142 assert(m1.empty()); 164 M m1( [all...] |
/external/libcxx/test/containers/associative/set/set.cons/ |
H A D | move_assign.pass.cpp | 45 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 60 m3 = std::move(m1); 64 assert(m1.empty()); 84 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 99 m3 = std::move(m1); 103 assert(m1.empty()); 123 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); 138 m3 = std::move(m1); 142 assert(m1.empty()); 163 M m1( [all...] |
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/x86/ |
H A D | vp9_copy_sse2.asm | 32 movu m1, [srcq+16] 38 pavgb m1, [dstq+16] 43 mova [dstq+16], m1 55 movu m1, [srcq+16] 61 pavgb m1, [dstq +16] 66 mova [dstq +16], m1 80 movu m1, [srcq+src_strideq] 86 pavgb m1, [dstq+dst_strideq] 91 mova [dstq+dst_strideq ], m1 106 movu m1, [src [all...] |
H A D | vp9_idct_ssse3_x86_64.asm | 163 mova m1, [inputq + 16] 196 mova m1, [inputq + 16] 200 punpcklwd m0, m1 207 ; m1 -> [1], [1] 219 pmulhrsw m1, [dpw_6392_32138] 232 punpckhqdq m9, m1, m5 233 punpcklqdq m1, m5 240 punpckhqdq m4, m1, m1 246 punpcklwd m1, m [all...] |
/external/chromium_org/components/omnibox/ |
H A D | autocomplete_match_unittest.cc | 24 AutocompleteMatch m1(NULL, 0, false, 30 m1.relevance = cases[i].r1; 33 AutocompleteMatch::MoreRelevant(m1, m2)); 114 AutocompleteMatch m1(NULL, 0, true, 116 EXPECT_TRUE(m1.SupportsDeletion());
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/x86/ |
H A D | vp9_subtract_sse2.asm | 38 mova m1, [predq+%3] 41 punpckhbw m3, m1, m7 43 punpcklbw m1, m7 45 psubw m0, m1 46 punpckhbw m1, m4, m7 50 psubw m1, m3 55 mova [diffq+mmsize*1+%6], m1 94 movh m1, [predq] 97 punpcklbw m1, m7 100 psubw m0, m1 [all...] |
H A D | vp9_error_sse2.asm | 30 mova m1, [dqcq+sizeq*2+mmsize] 32 psubw m1, m3 36 pmaddwd m1, m1 43 punpckldq m7, m1, m5 45 punpckhdq m1, m5 48 paddq m4, m1
|
/external/eigen/unsupported/test/ |
H A D | alignedvector3.cpp | 24 Mat33 m1(Mat33::Random()); 38 VERIFY_IS_APPROX(m1*f4,m1*r4); 39 VERIFY_IS_APPROX(f4.transpose()*m1,r4.transpose()*m1);
|
/external/libvpx/libvpx/vp9/encoder/x86/ |
H A D | vp9_subtract_sse2.asm | 38 mova m1, [predq+%3] 41 punpckhbw m3, m1, m7 43 punpcklbw m1, m7 45 psubw m0, m1 46 punpckhbw m1, m4, m7 50 psubw m1, m3 55 mova [diffq+mmsize*1+%6], m1 94 movh m1, [predq] 97 punpcklbw m1, m7 100 psubw m0, m1 [all...] |
H A D | vp9_error_sse2.asm | 30 mova m1, [dqcq+sizeq*2+mmsize] 32 psubw m1, m3 36 pmaddwd m1, m1 43 punpckldq m7, m1, m5 45 punpckhdq m1, m5 48 paddq m4, m1
|
/external/chromium_org/chrome/browser/ui/app_list/test/ |
H A D | fast_show_pickler_unittest.cc | 20 void CheckIsSame(AppListModel* m1, AppListModel* m2) { argument 21 ASSERT_EQ(m1->top_level_item_list()->item_count(), 23 for (size_t i = 0; i < m1->top_level_item_list()->item_count(); i++) { 24 ASSERT_EQ(m1->top_level_item_list()->item_at(i)->id(), 26 ASSERT_EQ(m1->top_level_item_list()->item_at(i)->name(), 28 ASSERT_EQ(m1->top_level_item_list()->item_at(i)->short_name(), 30 CompareImages(m1->top_level_item_list()->item_at(i)->icon(),
|