/external/valgrind/main/none/tests/s390x/ |
D | mul.h | 3 #define MUL_REG_MEM(insn, m1, m2) \ argument 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) \ argument 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) \ argument 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) \ argument [all …]
|
D | mul.c | 18 static void do_regmem_insns(unsigned long m2) in do_regmem_insns() argument 20 memsweep(m, m2); in do_regmem_insns() 21 regsweep(mr, m2); in do_regmem_insns() 22 memsweep(mh, m2); in do_regmem_insns() 23 memsweep(mlg, m2); in do_regmem_insns() 24 regsweep(mlgr, m2); in do_regmem_insns() 25 memsweep(ml, m2); in do_regmem_insns() 26 regsweep(mlr, m2); in do_regmem_insns() 27 memsweep(ms, m2); in do_regmem_insns() 28 regsweep(msr, m2); in do_regmem_insns() [all …]
|
D | div.c | 4 static void do_regmem_insns(unsigned long m2) in do_regmem_insns() argument 6 memsweep(d, m2); in do_regmem_insns() 7 regsweep(dr, m2); in do_regmem_insns() 8 memsweep(dl, m2); in do_regmem_insns() 9 regsweep(dlr, m2); in do_regmem_insns() 10 memsweep(dlg, m2); in do_regmem_insns() 11 regsweep(dlgr, m2); in do_regmem_insns() 12 memsweep(dsg, m2); in do_regmem_insns() 13 regsweep(dsgr, m2); in do_regmem_insns() 14 memsweep(dsgf, m2); in do_regmem_insns() [all …]
|
/external/eigen/test/ |
D | vectorwiseop.cpp | 28 m2(rows, cols), in vectorwiseop_array() local 36 m2 = m1; in vectorwiseop_array() 37 m2.colwise() += colvec; in vectorwiseop_array() 38 VERIFY_IS_APPROX(m2, m1.colwise() + colvec); in vectorwiseop_array() 39 VERIFY_IS_APPROX(m2.col(c), m1.col(c) + colvec); in vectorwiseop_array() 41 VERIFY_RAISES_ASSERT(m2.colwise() += colvec.transpose()); in vectorwiseop_array() 44 m2 = m1; in vectorwiseop_array() 45 m2.rowwise() += rowvec; in vectorwiseop_array() 46 VERIFY_IS_APPROX(m2, m1.rowwise() + rowvec); in vectorwiseop_array() 47 VERIFY_IS_APPROX(m2.row(r), m1.row(r) + rowvec); in vectorwiseop_array() [all …]
|
D | sparse_basic.cpp | 97 SparseMatrixType m2(rows,cols); in sparse_basic() local 99 m2.reserve(VectorXi::Constant(m2.outerSize(), 2)); in sparse_basic() 106 m2.insert(i,j) = m1(i,j) = internal::random<Scalar>(); in sparse_basic() 109 m2.finalize(); in sparse_basic() 110 VERIFY_IS_APPROX(m2,m1); in sparse_basic() 117 SparseMatrixType m2(rows,cols); in sparse_basic() local 119 m2.reserve(VectorXi::Constant(m2.outerSize(), 2)); in sparse_basic() 125 m2.insert(i,j) = m1(i,j) = internal::random<Scalar>(); in sparse_basic() 129 m2.coeffRef(i,j) += v; in sparse_basic() 133 VERIFY_IS_APPROX(m2,m1); in sparse_basic() [all …]
|
D | determinant.cpp | 22 MatrixType m1(size, size), m2(size, size); in determinant() local 24 m2.setRandom(); in determinant() 28 VERIFY_IS_APPROX((m1*m2).eval().determinant(), m1.determinant() * m2.determinant()); in determinant() 35 m2 = m1; in determinant() 36 m2.row(i).swap(m2.row(j)); in determinant() 37 VERIFY_IS_APPROX(m2.determinant(), -m1.determinant()); in determinant() 38 m2 = m1; in determinant() 39 m2.col(i).swap(m2.col(j)); in determinant() 40 VERIFY_IS_APPROX(m2.determinant(), -m1.determinant()); in determinant() 41 VERIFY_IS_APPROX(m2.determinant(), m2.transpose().determinant()); in determinant() [all …]
|
D | triangular.cpp | 26 m2 = MatrixType::Random(rows, cols), in triangular_square() local 34 MatrixType m2up = m2.template triangularView<Upper>(); in triangular_square() 40 VERIFY(!m2.isLowerTriangular()); in triangular_square() 54 m1.template triangularView<Upper>() = m2.transpose() + m2; in triangular_square() 55 m3 = m2.transpose() + m2; in triangular_square() 60 m1.template triangularView<Lower>() = m2.transpose() + m2; in triangular_square() 83 …VERIFY(m2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(m2)), large… in triangular_square() 85 …VERIFY(m2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(m2)), l… in triangular_square() 87 VERIFY(m2.isApprox(m3 * (m1.template triangularView<Upper>().solve(m2)), largerEps)); in triangular_square() 89 …VERIFY(m2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(m2)), l… in triangular_square() [all …]
|
D | nomalloc.cpp | 39 m2 = MatrixType::Random(rows, cols), in nomalloc() local 47 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2); in nomalloc() 48 VERIFY_IS_APPROX((m1+m2)(r,c), (m1(r,c))+(m2(r,c))); in nomalloc() 50 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2)); in nomalloc() 52 m2.col(0).noalias() = m1 * m1.col(0); in nomalloc() 53 m2.col(0).noalias() -= m1.adjoint() * m1.col(0); in nomalloc() 54 m2.col(0).noalias() -= m1 * m1.row(0).adjoint(); in nomalloc() 55 m2.col(0).noalias() -= m1.adjoint() * m1.row(0).adjoint(); in nomalloc() 57 m2.row(0).noalias() = m1.row(0) * m1; in nomalloc() 58 m2.row(0).noalias() -= m1.row(0) * m1.adjoint(); in nomalloc() [all …]
|
D | integer_types.cpp | 31 m2 = MatrixType::Random(rows, cols), in signed_integer_type_tests() local 36 } while(m1 == mzero || m1 == m2); in signed_integer_type_tests() 46 VERIFY_IS_EQUAL(-m2+m1+m2, m1); in signed_integer_type_tests() 47 VERIFY_IS_EQUAL((-m1+m2)*s1, -s1*m1+s1*m2); in signed_integer_type_tests() 67 m2 = MatrixType::Random(rows, cols), in integer_type_tests() local 80 } while(m1 == mzero || m1 == m2); in integer_type_tests() 103 VERIFY(m1!=m2); in integer_type_tests() 104 VERIFY(!(m1==m2)); in integer_type_tests() 106 m1 = m2; in integer_type_tests() 107 VERIFY(m1==m2); in integer_type_tests() [all …]
|
D | linearstructure.cpp | 26 m2 = MatrixType::Random(rows, cols), in linearStructure() local 37 VERIFY_IS_APPROX(m1+m2-m1, m2); in linearStructure() 38 VERIFY_IS_APPROX(-m2+m1+m2, m1); in linearStructure() 40 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2); in linearStructure() 41 VERIFY_IS_APPROX((-m1+m2)*s1, -s1*m1+s1*m2); in linearStructure() 42 m3 = m2; m3 += m1; in linearStructure() 43 VERIFY_IS_APPROX(m3, m1+m2); in linearStructure() 44 m3 = m2; m3 -= m1; in linearStructure() 45 VERIFY_IS_APPROX(m3, m2-m1); in linearStructure() 46 m3 = m2; m3 *= s1; in linearStructure() [all …]
|
D | product_syrk.cpp | 25 m2 = MatrixType::Random(rows, cols); in syrk() local 35 m2.setZero(); in syrk() 36 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()), in syrk() 39 m2.setZero(); in syrk() 40 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs2,s1)._expression(), in syrk() 43 m2.setZero(); in syrk() 44 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs1.adjoint(),s1)._expression(), in syrk() 47 m2.setZero(); in syrk() 48 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs1.adjoint(),s1)._expression(), in syrk() 51 m2.setZero(); in syrk() [all …]
|
D | product.h | 14 bool areNotApprox(const MatrixBase<Derived1>& m1, const MatrixBase<Derived2>& m2, typename Derived1… 16 return !((m1-m2).cwiseAbs2().maxCoeff() < epsilon * epsilon 17 * (std::max)(m1.cwiseAbs2().maxCoeff(), m2.cwiseAbs2().maxCoeff())); 41 m2 = MatrixType::Random(rows, cols), in product() local 62 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2)); in product() 64 m3 *= m1.transpose() * m2; in product() 65 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2)); in product() 66 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2)); in product() 69 VERIFY_IS_APPROX(square*(m1 + m2), square*m1+square*m2); in product() 70 VERIFY_IS_APPROX(square*(m1 - m2), square*m1-square*m2); in product() [all …]
|
D | diagonal.cpp | 24 m2 = MatrixType::Random(rows, cols); in diagonal() local 28 m2.diagonal() = 2 * m1.diagonal(); in diagonal() 29 m2.diagonal()[0] *= 3; in diagonal() 48 m2.template diagonal<N1>() = 2 * m1.template diagonal<N1>(); in diagonal() 49 VERIFY_IS_APPROX(m2.template diagonal<N1>(), static_cast<Scalar>(2) * m1.diagonal(N1)); in diagonal() 50 m2.template diagonal<N1>()[0] *= 3; in diagonal() 51 …VERIFY_IS_APPROX(m2.template diagonal<N1>()[0], static_cast<Scalar>(6) * m1.template diagonal<N1>(… in diagonal() 54 m2.template diagonal<N2>() = 2 * m1.template diagonal<N2>(); in diagonal() 55 m2.template diagonal<N2>()[0] *= 3; in diagonal() 56 …VERIFY_IS_APPROX(m2.template diagonal<N2>()[0], static_cast<Scalar>(6) * m1.template diagonal<N2>(… in diagonal() [all …]
|
D | product_notemporary.cpp | 45 m2 = MatrixType::Random(rows, cols), in product_notemporary() local 60 VERIFY_EVALUATION_COUNT( m3 = (m1 * m2.adjoint()), 1); in product_notemporary() 61 VERIFY_EVALUATION_COUNT( m3.noalias() = m1 * m2.adjoint(), 0); in product_notemporary() 63 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * (m1 * m2.transpose()), 0); in product_notemporary() 65 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * m2.adjoint(), 0); in product_notemporary() 66 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * (m1*s3+m2*s2).adjoint(), 1); in product_notemporary() 67 VERIFY_EVALUATION_COUNT( m3.noalias() = (s1 * m1).adjoint() * s2 * m2, 0); in product_notemporary() 68 VERIFY_EVALUATION_COUNT( m3.noalias() += s1 * (-m1*s3).adjoint() * (s2 * m2 * s3), 0); in product_notemporary() 69 VERIFY_EVALUATION_COUNT( m3.noalias() -= s1 * (m1.transpose() * m2), 0); in product_notemporary() 71 …VERIFY_EVALUATION_COUNT(( m3.block(r0,r0,r1,r1).noalias() += -m1.block(r0,c0,r1,c1) * (s2*m2.block… in product_notemporary() [all …]
|
D | product_symm.cpp | 27 m2 = MatrixType::Random(rows, cols), m3; in symm() local 38 m2 = m1.template triangularView<Lower>(); in symm() 39 m3 = m2.template selfadjointView<Lower>(); in symm() 41 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1), in symm() 44 m2 = m1.template triangularView<Upper>(); rhs12.setRandom(); rhs13 = rhs12; in symm() 45 m3 = m2.template selfadjointView<Upper>(); in symm() 47 VERIFY_IS_APPROX(rhs12 += (s1*m2).template selfadjointView<Upper>() * (s2*rhs1), in symm() 50 m2 = m1.template triangularView<Lower>(); in symm() 51 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm() 54 m2 = m1.template triangularView<Upper>(); in symm() [all …]
|
D | sparse_product.cpp | 15 …static void run(SparseMatrixType& m2, SparseMatrixType& m4, DenseMatrix& refMat2, DenseMatrix& ref… in run() 16 int c = internal::random(0,m2.cols()-1); in run() 17 int c1 = internal::random(0,m2.cols()-1); in run() 18 …VERIFY_IS_APPROX(m4=m2.col(c)*refMat2.col(c1).transpose(), refMat4=refMat2.col(c)*refMat2.col(c1).… in run() 19 …VERIFY_IS_APPROX(m4=refMat2.col(c1)*m2.col(c).transpose(), refMat4=refMat2.col(c1)*refMat2.col(c).… in run() 24 …static void run(SparseMatrixType& m2, SparseMatrixType& m4, DenseMatrix& refMat2, DenseMatrix& ref… in run() 25 int r = internal::random(0,m2.rows()-1); in run() 26 int c1 = internal::random(0,m2.cols()-1); in run() 27 …VERIFY_IS_APPROX(m4=m2.row(r).transpose()*refMat2.col(c1).transpose(), refMat4=refMat2.row(r).tran… in run() 28 VERIFY_IS_APPROX(m4=refMat2.col(c1)*m2.row(r), refMat4=refMat2.col(c1)*refMat2.row(r)); in run() [all …]
|
D | cwiseop.cpp | 42 m2 = MatrixType::Random(rows, cols), in cwiseops() local 84 m2 = m2.template binaryExpr<AddIfNull<Scalar> >(mones); in cwiseops() 97 VERIFY_IS_APPROX(m2, m2.cwise() * mones); in cwiseops() 98 VERIFY_IS_APPROX(m1.cwise() * m2, m2.cwise() * m1); in cwiseops() 100 m3.cwise() *= m2; in cwiseops() 101 VERIFY_IS_APPROX(m3, m1.cwise() * m2); in cwiseops() 103 VERIFY_IS_APPROX(mones, m2.cwise()/m2); in cwiseops() 106 VERIFY_IS_APPROX(m1.cwise() / m2, m1.cwise() * (m2.cwise().inverse())); in cwiseops() 121 m3.cwise() /= m2; in cwiseops() 122 VERIFY_IS_APPROX(m3, m1.cwise() / m2); in cwiseops() [all …]
|
D | sparse_solvers.cpp | 48 SparseMatrix<Scalar> m2(rows, cols); in sparse_solvers() local 52 …initSparse<Scalar>(density, refMat2, m2, ForceNonZeroDiag|MakeLowerTriangular, &zeroCoords, &nonze… in sparse_solvers() 54 m2.template triangularView<Lower>().solve(vec3)); in sparse_solvers() 57 …initSparse<Scalar>(density, refMat2, m2, ForceNonZeroDiag|MakeUpperTriangular, &zeroCoords, &nonze… in sparse_solvers() 59 m2.template triangularView<Upper>().solve(vec3)); in sparse_solvers() 61 m2.conjugate().template triangularView<Upper>().solve(vec3)); in sparse_solvers() 63 SparseMatrix<Scalar> cm2(m2); in sparse_solvers() 71 …initSparse<Scalar>(density, refMat2, m2, ForceNonZeroDiag|MakeLowerTriangular, &zeroCoords, &nonze… in sparse_solvers() 73 m2.transpose().template triangularView<Upper>().solve(vec3)); in sparse_solvers() 76 …initSparse<Scalar>(density, refMat2, m2, ForceNonZeroDiag|MakeUpperTriangular, &zeroCoords, &nonze… in sparse_solvers() [all …]
|
/external/clang/test/CodeGen/ |
D | 3dnow-builtins.c | 8 __m64 test_m_pavgusb(__m64 m1, __m64 m2) { in test_m_pavgusb() argument 11 return _m_pavgusb(m1, m2); in test_m_pavgusb() 20 __m64 test_m_pfacc(__m64 m1, __m64 m2) { in test_m_pfacc() argument 23 return _m_pfacc(m1, m2); in test_m_pfacc() 26 __m64 test_m_pfadd(__m64 m1, __m64 m2) { in test_m_pfadd() argument 29 return _m_pfadd(m1, m2); in test_m_pfadd() 32 __m64 test_m_pfcmpeq(__m64 m1, __m64 m2) { in test_m_pfcmpeq() argument 35 return _m_pfcmpeq(m1, m2); in test_m_pfcmpeq() 38 __m64 test_m_pfcmpge(__m64 m1, __m64 m2) { in test_m_pfcmpge() argument 41 return _m_pfcmpge(m1, m2); in test_m_pfcmpge() [all …]
|
/external/eigen/test/eigen2/ |
D | eigen2_determinant.cpp | 21 MatrixType m1(size, size), m2(size, size); in determinant() local 23 m2.setRandom(); in determinant() 27 VERIFY_IS_APPROX((m1*m2).determinant(), m1.determinant() * m2.determinant()); in determinant() 34 m2 = m1; in determinant() 35 m2.row(i).swap(m2.row(j)); in determinant() 36 VERIFY_IS_APPROX(m2.determinant(), -m1.determinant()); in determinant() 37 m2 = m1; in determinant() 38 m2.col(i).swap(m2.col(j)); in determinant() 39 VERIFY_IS_APPROX(m2.determinant(), -m1.determinant()); in determinant() 40 VERIFY_IS_APPROX(m2.determinant(), m2.transpose().determinant()); in determinant() [all …]
|
D | eigen2_sparse_basic.cpp | 169 SparseMatrixType m2(rows,cols); in sparse_basic() local 170 m2.startFill(); in sparse_basic() 177 m2.fillrand(i,j) = m1(i,j) = ei_random<Scalar>(); in sparse_basic() 180 m2.endFill(); in sparse_basic() 181 VERIFY_IS_APPROX(m2,m1); in sparse_basic() 207 SparseMatrixType m2(rows, rows); in sparse_basic() local 211 initSparse<Scalar>(density, refM2, m2); in sparse_basic() 215 VERIFY_IS_APPROX(m1+m2, refM1+refM2); in sparse_basic() 216 VERIFY_IS_APPROX(m1+m2+m3, refM1+refM2+refM3); in sparse_basic() 217 VERIFY_IS_APPROX(m3.cwise()*(m1+m2), refM3.cwise()*(refM1+refM2)); in sparse_basic() [all …]
|
D | eigen2_linearstructure.cpp | 27 m2 = MatrixType::Random(rows, cols), in linearStructure() local 39 VERIFY_IS_APPROX(m1+m2-m1, m2); in linearStructure() 40 VERIFY_IS_APPROX(-m2+m1+m2, m1); in linearStructure() 42 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2); in linearStructure() 43 VERIFY_IS_APPROX((-m1+m2)*s1, -s1*m1+s1*m2); in linearStructure() 44 m3 = m2; m3 += m1; in linearStructure() 45 VERIFY_IS_APPROX(m3, m1+m2); in linearStructure() 46 m3 = m2; m3 -= m1; in linearStructure() 47 VERIFY_IS_APPROX(m3, m2-m1); in linearStructure() 48 m3 = m2; m3 *= s1; in linearStructure() [all …]
|
D | product.h | 15 bool areNotApprox(const MatrixBase<Derived1>& m1, const MatrixBase<Derived2>& m2, typename Derived1… 17 return !((m1-m2).cwise().abs2().maxCoeff() < epsilon * epsilon 18 * std::max(m1.cwise().abs2().maxCoeff(), m2.cwise().abs2().maxCoeff())); 42 m2 = MatrixType::Random(rows, cols), in product() local 66 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2)); in product() 68 m3 *= m1.transpose() * m2; in product() 69 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2)); in product() 70 VERIFY_IS_APPROX(m3, m1.lazy() * (m1.transpose()*m2)); in product() 73 VERIFY_IS_APPROX(square*(m1 + m2), square*m1+square*m2); in product() 74 VERIFY_IS_APPROX(square*(m1 - m2), square*m1-square*m2); in product() [all …]
|
D | eigen2_cwiseop.cpp | 32 m2 = MatrixType::Random(rows, cols), in cwiseops() local 77 m2 = m2.template binaryExpr<AddIfNull<Scalar> >(mones); in cwiseops() 90 VERIFY_IS_APPROX(m2, m2.cwise() * mones); in cwiseops() 91 VERIFY_IS_APPROX(m1.cwise() * m2, m2.cwise() * m1); in cwiseops() 93 m3.cwise() *= m2; in cwiseops() 94 VERIFY_IS_APPROX(m3, m1.cwise() * m2); in cwiseops() 96 VERIFY_IS_APPROX(mones, m2.cwise()/m2); in cwiseops() 99 VERIFY_IS_APPROX(m1.cwise() / m2, m1.cwise() * (m2.cwise().inverse())); in cwiseops() 114 m3.cwise() /= m2; in cwiseops() 115 VERIFY_IS_APPROX(m3, m1.cwise() / m2); in cwiseops() [all …]
|
D | eigen2_sparse_solvers.cpp | 48 SparseMatrix<Scalar> m2(rows, cols); in sparse_solvers() local 52 …initSparse<Scalar>(density, refMat2, m2, ForceNonZeroDiag|MakeLowerTriangular, &zeroCoords, &nonze… in sparse_solvers() 54 m2.template marked<LowerTriangular>().solveTriangular(vec3)); in sparse_solvers() 57 …initSparse<Scalar>(density, refMat2, m2, ForceNonZeroDiag|MakeLowerTriangular, &zeroCoords, &nonze… in sparse_solvers() 59 m2.template marked<LowerTriangular>().transpose().solveTriangular(vec3)); in sparse_solvers() 62 …initSparse<Scalar>(density, refMat2, m2, ForceNonZeroDiag|MakeUpperTriangular, &zeroCoords, &nonze… in sparse_solvers() 64 m2.template marked<UpperTriangular>().solveTriangular(vec3)); in sparse_solvers() 67 …initSparse<Scalar>(density, refMat2, m2, ForceNonZeroDiag|MakeUpperTriangular, &zeroCoords, &nonze… in sparse_solvers() 69 m2.template marked<UpperTriangular>().transpose().solveTriangular(vec3)); in sparse_solvers() 75 SparseMatrix<Scalar> m2(rows, cols); in sparse_solvers() local [all …]
|