/external/eigen/doc/snippets/ |
H A D | MatrixBase_set.cpp | 6 Matrix3i m2 = Matrix3i::Identity(); variable 7 m2.block(0,0, 2,2) << 10, 11, 12, 13; 8 cout << m2 << endl << endl; 11 m2 << v1.transpose(), 16, 13 cout << m2 << endl;
|
/external/valgrind/main/none/tests/s390x/ |
H A D | div.c | 4 static void do_regmem_insns(unsigned long m2) argument 6 memsweep(d, m2); 7 regsweep(dr, m2); 8 memsweep(dl, m2); 9 regsweep(dlr, m2); 10 memsweep(dlg, m2); 11 regsweep(dlgr, m2); 12 memsweep(dsg, m2); 13 regsweep(dsgr, m2); 14 memsweep(dsgf, m2); [all...] |
H A D | mul.c | 18 static void do_regmem_insns(unsigned long m2) argument 20 memsweep(m, m2); 21 regsweep(mr, m2); 22 memsweep(mh, m2); 23 memsweep(mlg, m2); 24 regsweep(mlgr, m2); 25 memsweep(ml, m2); 26 regsweep(mlr, m2); 27 memsweep(ms, m2); 28 regsweep(msr, m2); [all...] |
H A D | mul_GE.c | 27 static void do_regmem_insns(unsigned long m2) argument 29 mhysweep(m2); 30 mfysweep(m2);
|
/external/eigen/doc/examples/ |
H A D | TemplateKeyword_flexible.cpp | 16 MatrixXi m2 = MatrixXi::Random(4,4); local 17 std::cout << "m2 before copy:" << std::endl; 18 std::cout << m2 << std::endl << std::endl; 19 copyUpperTriangularPart(m2, m1.topLeftCorner(4,4)); 20 std::cout << "m2 after copy:" << std::endl; 21 std::cout << m2 << std::endl << std::endl;
|
H A D | TemplateKeyword_simple.cpp | 14 MatrixXf m2 = MatrixXf::Random(4,4); local 15 std::cout << "m2 before copy:" << std::endl; 16 std::cout << m2 << std::endl << std::endl; 17 copyUpperTriangularPart(m2, m1); 18 std::cout << "m2 after copy:" << std::endl; 19 std::cout << m2 << std::endl << std::endl;
|
H A D | class_CwiseBinaryOp.cpp | 15 Matrix4d m1 = Matrix4d::Random(), m2 = Matrix4d::Random(); local 16 cout << m1.binaryExpr(m2, MakeComplexOp<double>()) << endl;
|
/external/clang/test/SemaCXX/ |
H A D | function-type-qual.cpp | 20 void m2() const { function in class:C
|
H A D | borland-extensions.cpp | 19 void m2() { function
|
/external/valgrind/main/helgrind/tests/ |
H A D | hg02_deadlock.c | 5 static pthread_mutex_t m2 = PTHREAD_MUTEX_INITIALIZER; variable 10 pthread_mutex_lock(&m2); 12 pthread_mutex_unlock(&m2); 19 pthread_mutex_lock(&m2); 22 pthread_mutex_unlock(&m2);
|
/external/clang/test/Lexer/ |
H A D | constants.c | 30 int m2 = '\\\\'; // expected-warning {{multi-character character constant}} variable
|
/external/eigen/test/ |
H A D | diagonal.cpp | 24 m2 = MatrixType::Random(rows, cols); local 28 m2.diagonal() = 2 * m1.diagonal(); 29 m2.diagonal()[0] *= 3; 48 m2.template diagonal<N1>() = 2 * m1.template diagonal<N1>(); 49 VERIFY_IS_APPROX(m2.template diagonal<N1>(), static_cast<Scalar>(2) * m1.diagonal(N1)); 50 m2.template diagonal<N1>()[0] *= 3; 51 VERIFY_IS_APPROX(m2.template diagonal<N1>()[0], static_cast<Scalar>(6) * m1.template diagonal<N1>()[0]); 54 m2.template diagonal<N2>() = 2 * m1.template diagonal<N2>(); 55 m2.template diagonal<N2>()[0] *= 3; 56 VERIFY_IS_APPROX(m2 [all...] |
H A D | linearstructure.cpp | 26 m2 = MatrixType::Random(rows, cols), local 37 VERIFY_IS_APPROX(m1+m2-m1, m2); 38 VERIFY_IS_APPROX(-m2+m1+m2, m1); 40 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2); 41 VERIFY_IS_APPROX((-m1+m2)*s1, -s1*m1+s1*m2); 42 m3 = m2; m [all...] |
H A D | swap.cpp | 36 MatrixType m2 = MatrixType::Random(rows,cols) + Scalar(100) * MatrixType::Identity(rows,cols); local 40 MatrixType m2_copy = m2; 44 m1.swap(m2); 46 VERIFY_IS_APPROX(m2,m1_copy); 48 m2 = m2_copy; 58 m1.swap(m2.block(0,0,rows,cols)); 60 VERIFY_IS_APPROX(m2,m1_copy); 62 m2 = m2_copy;
|
H A D | array_replicate.cpp | 28 m2 = MatrixType::Random(rows, cols); local 45 x2 << m2, m2, m2, local 46 m2, m2, m2; local 47 VERIFY_IS_APPROX(x2, (m2.template replicate<2,3>()));
|
H A D | product_syrk.cpp | 25 m2 = MatrixType::Random(rows, cols); local 35 m2.setZero(); 36 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()), 39 m2.setZero(); 40 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs2,s1)._expression(), 43 m2.setZero(); 44 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs1.adjoint(),s1)._expression(), 47 m2.setZero(); 48 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs1.adjoint(),s1)._expression(), 51 m2 [all...] |
/external/eigen/test/eigen2/ |
H A D | eigen2_linearstructure.cpp | 27 m2 = MatrixType::Random(rows, cols), local 39 VERIFY_IS_APPROX(m1+m2-m1, m2); 40 VERIFY_IS_APPROX(-m2+m1+m2, m1); 42 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2); 43 VERIFY_IS_APPROX((-m1+m2)*s1, -s1*m1+s1*m2); 44 m3 = m2; m [all...] |
H A D | eigen2_swap.cpp | 36 MatrixType m2 = MatrixType::Random(rows,cols) + Scalar(100) * MatrixType::Identity(rows,cols); local 40 MatrixType m2_copy = m2; 44 m1.swap(m2); 46 VERIFY_IS_APPROX(m2,m1_copy); 48 m2 = m2_copy; 58 m1.swap(m2.block(0,0,rows,cols)); 60 VERIFY_IS_APPROX(m2,m1_copy); 62 m2 = m2_copy;
|
H A D | eigen2_array.cpp | 27 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...] |
H A D | eigen2_basicstuff.cpp | 23 m2 = MatrixType::Random(rows, cols), local 80 VERIFY_RAISES_ASSERT(m1 = (m2.block(0,0, rows-1, cols-1))); 89 m1.swap(m2); 90 VERIFY_IS_APPROX(m3, m2);
|
/external/valgrind/main/VEX/test/ |
H A D | rounderr.c | 4 m2 = 1.19999999999998885, exp = 1.19999999999999996 9 m2 = 1.19999999999998885, exp = 1.19999999999999996 14 m2 = 1.19999999999999996, exp = 1.19999999999999996 19 m2 = 1.19999999999999996, exp = 1.19999999999999996 24 m2 = 1.19999999999999440, exp = 1.19999999999999996 29 m2 = 1.19999999999998885, exp = 1.19999999999999996 88 double m2 = my_mean2 (numacc2, 1, nacc2); local 91 printf("m2 = %19.17f, exp = %19.17f\n", m2, expected_mean);
|
/external/valgrind/main/none/tests/ |
H A D | map_unmap.c | 60 void *m1, *m2; local 69 m2 = domap(); 70 if (m2 != expect2) { 71 printf("FAIL i=%d: m2=%p expect2=%p\n", 72 i, m2, expect2); 76 nibblemap(m2);
|
/external/clang/test/Preprocessor/ |
H A D | pragma_diagnostic_sections.cpp | 9 void m2() { int b; while (b==b); } function in struct:S
|
/external/skia/tests/ |
H A D | ColorFilterTest.cpp | 91 SkXfermode::Mode m2 = ILLEGAL_MODE; local 92 REPORTER_ASSERT(reporter, cf2->asColorMode(&c2, &m2)); 94 REPORTER_ASSERT(reporter, m2 == expectedMode);
|
/external/bison/src/ |
H A D | uniqstr.c | 98 hash_compare_uniqstr (void const *m1, void const *m2) 100 return strcmp (m1, m2) == 0; 97 hash_compare_uniqstr(void const *m1, void const *m2) argument
|