/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.h | 3 #define MUL_REG_MEM(insn, m1, m2) \ 13 : "Q" (m2) \ 15 printf(#insn " %16.16lX * %16.16lX = %16.16lX%16.16lX\n", m1, m2, tmp1, tmp2); \ 18 #define MUL_REG_REG(insn, m1, m2) \ 28 : "d" (m2) \ 30 printf(#insn " %16.16lX * %16.16lX = %16.16lX%16.16lX\n", m1, m2, tmp1, tmp2); \ 33 #define MUL_REG_IMM(insn, m1, m2) \ 39 #insn " 2, " #m2 "\n" \ 44 printf(#insn " %16.16lX * %16.16lX = %16.16lX%16.16lX\n", m1, (unsigned long) m2, tmp1, tmp2); \ 47 #define MUL_REG_XIMM(insn, m1, um2, 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...] |
/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;
|
H A D | Tutorial_Map_using.cpp | 6 MatrixType m1(n_dims), m2(n_dims); 8 m2.setRandom(); 9 float *p = &m2(0); // get the address storing the data for m2 10 MapType m2map(p,m2.size()); // m2map shares data with m2 11 MapTypeConst m2mapconst(p,m2.size()); // a read-only accessor for m2 14 cout << "m2: " << m2 << end [all...] |
/external/clang/test/CodeGen/ |
H A D | 3dnow-builtins.c | 8 __m64 test_m_pavgusb(__m64 m1, __m64 m2) { argument 11 return _m_pavgusb(m1, m2); 20 __m64 test_m_pfacc(__m64 m1, __m64 m2) { argument 23 return _m_pfacc(m1, m2); 26 __m64 test_m_pfadd(__m64 m1, __m64 m2) { argument 29 return _m_pfadd(m1, m2); 32 __m64 test_m_pfcmpeq(__m64 m1, __m64 m2) { argument 35 return _m_pfcmpeq(m1, m2); 38 __m64 test_m_pfcmpge(__m64 m1, __m64 m2) { argument 41 return _m_pfcmpge(m1, m2); 44 test_m_pfcmpgt(__m64 m1, __m64 m2) argument 50 test_m_pfmax(__m64 m1, __m64 m2) argument 56 test_m_pfmin(__m64 m1, __m64 m2) argument 62 test_m_pfmul(__m64 m1, __m64 m2) argument 74 test_m_pfrcpit1(__m64 m1, __m64 m2) argument 80 test_m_pfrcpit2(__m64 m1, __m64 m2) argument 92 test_m_pfrsqrtit1(__m64 m1, __m64 m2) argument 98 test_m_pfsub(__m64 m1, __m64 m2) argument 104 test_m_pfsubr(__m64 m1, __m64 m2) argument 116 test_m_pmulhrw(__m64 m1, __m64 m2) argument 128 test_m_pfnacc(__m64 m1, __m64 m2) argument 134 test_m_pfpnacc(__m64 m1, __m64 m2) argument [all...] |
/external/eigen/test/eigen2/ |
H A D | eigen2_determinant.cpp | 21 MatrixType m1(size, size), m2(size, size); 23 m2.setRandom(); 27 VERIFY_IS_APPROX((m1*m2).determinant(), m1.determinant() * m2.determinant()); 34 m2 = m1; 35 m2.row(i).swap(m2.row(j)); 36 VERIFY_IS_APPROX(m2.determinant(), -m1.determinant()); 37 m2 = m1; 38 m2 [all...] |
/external/libcxx/test/re/re.results/re.results.nonmember/ |
H A D | equal.pass.cpp | 17 // const match_results<BidirectionalIterator, Allocator>& m2); 22 // const match_results<BidirectionalIterator, Allocator>& m2); 33 std::match_results<const char*> m2; local 36 assert(m1 != m2); 38 m2 = m1; 40 assert(m1 == m2);
|
/external/eigen/test/ |
H A D | vectorwiseop.cpp | 27 m2(rows, cols), 35 m2 = m1; 36 m2.colwise() += colvec; 37 VERIFY_IS_APPROX(m2, m1.colwise() + colvec); 38 VERIFY_IS_APPROX(m2.col(c), m1.col(c) + colvec); 40 VERIFY_RAISES_ASSERT(m2.colwise() += colvec.transpose()); 43 m2 = m1; 44 m2.rowwise() += rowvec; 45 VERIFY_IS_APPROX(m2, m1.rowwise() + rowvec); 46 VERIFY_IS_APPROX(m2 [all...] |
H A D | determinant.cpp | 22 MatrixType m1(size, size), m2(size, size); 24 m2.setRandom(); 28 VERIFY_IS_APPROX((m1*m2).eval().determinant(), m1.determinant() * m2.determinant()); 35 m2 = m1; 36 m2.row(i).swap(m2.row(j)); 37 VERIFY_IS_APPROX(m2.determinant(), -m1.determinant()); 38 m2 = m1; 39 m2 [all...] |
H A D | diagonal.cpp | 21 m2 = MatrixType::Random(rows, cols); local 25 m2.diagonal() = 2 * m1.diagonal(); 26 m2.diagonal()[0] *= 3; 42 m2.template diagonal<N1>() = 2 * m1.template diagonal<N1>(); 43 VERIFY_IS_APPROX(m2.template diagonal<N1>(), static_cast<Scalar>(2) * m1.diagonal(N1)); 44 m2.template diagonal<N1>()[0] *= 3; 45 VERIFY_IS_APPROX(m2.template diagonal<N1>()[0], static_cast<Scalar>(6) * m1.template diagonal<N1>()[0]); 48 m2.template diagonal<N2>() = 2 * m1.template diagonal<N2>(); 49 m2.template diagonal<N2>()[0] *= 3; 50 VERIFY_IS_APPROX(m2 [all...] |
/external/libcxx/test/containers/associative/map/map.special/ |
H A D | member_swap.pass.cpp | 34 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 36 M m2_save = m2; 37 m1.swap(m2); 39 assert(m2 == m1_save); 57 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 59 M m2_save = m2; 60 m1.swap(m2); 62 assert(m2 == m1_save); 76 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 78 M m2_save = m2; [all...] |
H A D | non_member_swap.pass.cpp | 37 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 39 M m2_save = m2; 40 swap(m1, m2); 42 assert(m2 == m1_save); 60 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 62 M m2_save = m2; 63 swap(m1, m2); 65 assert(m2 == m1_save); 79 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 81 M m2_save = m2; [all...] |
/external/libcxx/test/containers/associative/multimap/multimap.special/ |
H A D | member_swap.pass.cpp | 34 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 36 M m2_save = m2; 37 m1.swap(m2); 39 assert(m2 == m1_save); 57 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 59 M m2_save = m2; 60 m1.swap(m2); 62 assert(m2 == m1_save); 76 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 78 M m2_save = m2; [all...] |
H A D | non_member_swap.pass.cpp | 37 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 39 M m2_save = m2; 40 swap(m1, m2); 42 assert(m2 == m1_save); 60 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 62 M m2_save = m2; 63 swap(m1, m2); 65 assert(m2 == m1_save); 79 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 81 M m2_save = m2; [all...] |
/external/libcxx/test/containers/associative/multiset/multiset.special/ |
H A D | member_swap.pass.cpp | 34 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 36 M m2_save = m2; 37 m1.swap(m2); 39 assert(m2 == m1_save); 57 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 59 M m2_save = m2; 60 m1.swap(m2); 62 assert(m2 == m1_save); 76 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 78 M m2_save = m2; [all...] |
H A D | non_member_swap.pass.cpp | 33 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 35 M m2_save = m2; 36 swap(m1, m2); 38 assert(m2 == m1_save); 56 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 58 M m2_save = m2; 59 swap(m1, m2); 61 assert(m2 == m1_save); 75 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 77 M m2_save = m2; [all...] |
/external/libcxx/test/containers/associative/set/set.special/ |
H A D | member_swap.pass.cpp | 34 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 36 M m2_save = m2; 37 m1.swap(m2); 39 assert(m2 == m1_save); 57 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 59 M m2_save = m2; 60 m1.swap(m2); 62 assert(m2 == m1_save); 76 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 78 M m2_save = m2; [all...] |
H A D | non_member_swap.pass.cpp | 33 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 35 M m2_save = m2; 36 swap(m1, m2); 38 assert(m2 == m1_save); 56 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 58 M m2_save = m2; 59 swap(m1, m2); 61 assert(m2 == m1_save); 75 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 77 M m2_save = m2; [all...] |
/external/libcxx/test/re/re.results/re.results.swap/ |
H A D | member_swap.pass.cpp | 25 std::match_results<const char*> m2; local 28 std::match_results<const char*> m2_save = m2; 30 m1.swap(m2); 33 assert(m2 == m1_save);
|
H A D | non_member_swap.pass.cpp | 16 // match_results<BidirectionalIterator, Allocator>& m2); 27 std::match_results<const char*> m2; local 30 std::match_results<const char*> m2_save = m2; 32 swap(m1, m2); 35 assert(m2 == m1_save);
|
/external/libcxx/test/utilities/time/time.duration/time.duration.arithmetic/ |
H A D | op_+.pass.cpp | 23 std::chrono::minutes m2 = +m; local 24 assert(m.count() == m2.count()); 29 constexpr std::chrono::minutes m2 = +m; local 30 static_assert(m.count() == m2.count(), "");
|
H A D | op_-.pass.cpp | 23 std::chrono::minutes m2 = -m; local 24 assert(m2.count() == -m.count()); 29 constexpr std::chrono::minutes m2 = -m; local 30 static_assert(m2.count() == -m.count(), "");
|
/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/chromium_org/third_party/tlslite/tlslite/utils/ |
H A D | openssl_rsakey.py | 11 #copied from M2Crypto.util.py, so when we load the local copy of m2 38 self.rsa = m2.rsa_new() 39 m2.rsa_set_n(self.rsa, numberToMPI(n)) 40 m2.rsa_set_e(self.rsa, numberToMPI(e)) 44 m2.rsa_free(self.rsa) 50 return mpiToNumber(m2.rsa_get_e(self.rsa)) 54 return mpiToNumber(m2.rsa_get_n(self.rsa)) 63 s = m2.rsa_private_encrypt(self.rsa, bytes(b), m2.no_padding) 69 s = m2 [all...] |