| /external/libvpx/libvpx/vp9/encoder/x86/ |
| vp9_subpel_variance.asm | 249 punpckhbw m2, m0, m5
255 SUM_SSE m0, m1, m2, m3, m6, m7
268 movh m2, [srcq+src_strideq]
276 punpckhbw m2, m0, m5
280 punpcklbw m2, m5
284 SUM_SSE m0, m1, m2, m3, m6, m7
312 punpckhbw m2, m0, m5
314 SUM_SSE m0, m1, m2, m3, m6, m7
320 movh m2, [srcq+src_strideq]
323 movhps m2, [srcq+src_strideq*2
[all...] |
| /external/chromium_org/third_party/tlslite/tlslite/utils/ |
| OpenSSL_RSAKey.py | 8 #copied from M2Crypto.util.py, so when we load the local copy of m2
35 self.rsa = m2.rsa_new()
36 m2.rsa_set_n(self.rsa, numberToMPI(n))
37 m2.rsa_set_e(self.rsa, numberToMPI(e))
41 m2.rsa_free(self.rsa)
47 return mpiToNumber(m2.rsa_get_e(self.rsa))
51 return mpiToNumber(m2.rsa_get_n(self.rsa))
70 c = stringToNumber(m2.rsa_private_encrypt(self.rsa, s,
71 m2.no_padding))
83 m = stringToNumber(m2.rsa_public_decrypt(self.rsa, s
[all...] |
| /art/test/CreateMethodSignature/ |
| CreateMethodSignature.java | 19 CreateMethodSignature m2(boolean x, short y, char z) { return null; } method in class:CreateMethodSignature
|
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| CameraTest.java | 47 Matrix m2 = new Matrix(); local
48 mCamera.getMatrix(m2);
49 assertFalse(m1.equals(m2));
52 m2.getValues(f);
69 Matrix m2 = new Matrix(); local
70 mCamera.getMatrix(m2);
71 assertFalse(m1.equals(m2));
74 m2.getValues(f);
91 Matrix m2 = new Matrix(); local
92 mCamera.getMatrix(m2);
113 Matrix m2 = new Matrix(); local
[all...] |
| /external/clang/test/Analysis/diagnostics/ |
| report-issues-within-main-file.cpp | 35 int m2 = 0; local
36 m2 = in/m2;
37 m2++;
[all...] |
| /external/eigen/test/eigen2/ |
| product.h | 15 bool areNotApprox(const MatrixBase<Derived1>& m1, const MatrixBase<Derived2>& m2, typename Derived1::RealScalar epsilon = precision<typename Derived1::RealScalar>())
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), local
66 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2));
68 m3 *= m1.transpose() * m2;
69 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2));
70 VERIFY_IS_APPROX(m3, m1.lazy() * (m1.transpose()*m2));
73 VERIFY_IS_APPROX(square*(m1 + m2), square*m1+square*m2)
[all...] |
| eigen2_sparse_solvers.cpp | 48 SparseMatrix<Scalar> m2(rows, cols);
52 initSparse<Scalar>(density, refMat2, m2, ForceNonZeroDiag|MakeLowerTriangular, &zeroCoords, &nonzeroCoords);
54 m2.template marked<LowerTriangular>().solveTriangular(vec3));
57 initSparse<Scalar>(density, refMat2, m2, ForceNonZeroDiag|MakeLowerTriangular, &zeroCoords, &nonzeroCoords);
59 m2.template marked<LowerTriangular>().transpose().solveTriangular(vec3));
62 initSparse<Scalar>(density, refMat2, m2, ForceNonZeroDiag|MakeUpperTriangular, &zeroCoords, &nonzeroCoords);
64 m2.template marked<UpperTriangular>().solveTriangular(vec3));
67 initSparse<Scalar>(density, refMat2, m2, ForceNonZeroDiag|MakeUpperTriangular, &zeroCoords, &nonzeroCoords);
69 m2.template marked<UpperTriangular>().transpose().solveTriangular(vec3));
75 SparseMatrix<Scalar> m2(rows, cols)
[all...] |
| eigen2_nomalloc.cpp | 34 m2 = MatrixType::Random(rows, cols), local
50 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2);
51 VERIFY_IS_APPROX((m1+m2)(r,c), (m1(r,c))+(m2(r,c)));
53 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2));
|
| eigen2_triangular.cpp | 24 m2 = MatrixType::Random(rows, cols), local
40 MatrixType m2up = m2.template part<Eigen::UpperTriangular>();
46 VERIFY(!m2.isLowerTriangular());
49 // VERIFY_IS_APPROX(m1up.transpose() * m2, m1.upper().transpose().lower() * m2);
60 m1.template part<Eigen::UpperTriangular>() = (m2.transpose() * m2).lazy();
61 m3 = m2.transpose() * m2;
66 m1.template part<Eigen::LowerTriangular>() = (m2.transpose() * m2).lazy()
125 Matrix2i m2 = Matrix2i::Zero(); local
[all...] |
| eigen2_cwiseop.cpp | 32 m2 = MatrixType::Random(rows, cols), local
77 m2 = m2.template binaryExpr<AddIfNull<Scalar> >(mones);
90 VERIFY_IS_APPROX(m2, m2.cwise() * mones);
91 VERIFY_IS_APPROX(m1.cwise() * m2, m2.cwise() * m1);
93 m3.cwise() *= m2;
94 VERIFY_IS_APPROX(m3, m1.cwise() * m2);
96 VERIFY_IS_APPROX(mones, m2.cwise()/m2)
[all...] |
| 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;
|
| /external/eigen/test/ |
| 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.setZero()
[all...] |
| product_notemporary.cpp | 45 m2 = MatrixType::Random(rows, cols), local
60 VERIFY_EVALUATION_COUNT( m3 = (m1 * m2.adjoint()), 1);
61 VERIFY_EVALUATION_COUNT( m3.noalias() = m1 * m2.adjoint(), 0);
63 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * (m1 * m2.transpose()), 0);
65 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * m2.adjoint(), 0);
66 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * (m1*s3+m2*s2).adjoint(), 1);
67 VERIFY_EVALUATION_COUNT( m3.noalias() = (s1 * m1).adjoint() * s2 * m2, 0);
68 VERIFY_EVALUATION_COUNT( m3.noalias() += s1 * (-m1*s3).adjoint() * (s2 * m2 * s3), 0);
69 VERIFY_EVALUATION_COUNT( m3.noalias() -= s1 * (m1.transpose() * m2), 0);
71 VERIFY_EVALUATION_COUNT(( m3.block(r0,r0,r1,r1).noalias() += -m1.block(r0,c0,r1,c1) * (s2*m2.block(r0,c0,r1,c1)).adjoint() ), 0)
[all...] |
| product_symm.cpp | 27 m2 = MatrixType::Random(rows, cols), m3; local
38 m2 = m1.template triangularView<Lower>();
39 m3 = m2.template selfadjointView<Lower>();
41 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1),
44 m2 = m1.template triangularView<Upper>(); rhs12.setRandom(); rhs13 = rhs12;
45 m3 = m2.template selfadjointView<Upper>();
47 VERIFY_IS_APPROX(rhs12 += (s1*m2).template selfadjointView<Upper>() * (s2*rhs1),
50 m2 = m1.template triangularView<Lower>();
51 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()),
54 m2 = m1.template triangularView<Upper>()
[all...] |
| product_selfadjoint.cpp | 26 m2 = MatrixType::Random(rows, cols), local
42 m2 = m1.template triangularView<Lower>();
43 m2.template selfadjointView<Lower>().rankUpdate(v1,v2);
44 VERIFY_IS_APPROX(m2, (m1 + v1 * v2.adjoint()+ v2 * v1.adjoint()).template triangularView<Lower>().toDenseMatrix());
46 m2 = m1.template triangularView<Upper>();
47 m2.template selfadjointView<Upper>().rankUpdate(-v1,s2*v2,s3);
48 VERIFY_IS_APPROX(m2, (m1 + (s3*(-v1)*(s2*v2).adjoint()+internal::conj(s3)*(s2*v2)*(-v1).adjoint())).template triangularView<Upper>().toDenseMatrix());
50 m2 = m1.template triangularView<Upper>();
51 m2.template selfadjointView<Upper>().rankUpdate(-s2*r1.adjoint(),r2.adjoint()*s3,s1);
52 VERIFY_IS_APPROX(m2, (m1 + s1*(-s2*r1.adjoint())*(r2.adjoint()*s3).adjoint() + internal::conj(s1)*(r2.adjoint()*s3) * (…)
[all...] |
| cwiseop.cpp | 42 m2 = MatrixType::Random(rows, cols), local
84 m2 = m2.template binaryExpr<AddIfNull<Scalar> >(mones);
97 VERIFY_IS_APPROX(m2, m2.cwise() * mones);
98 VERIFY_IS_APPROX(m1.cwise() * m2, m2.cwise() * m1);
100 m3.cwise() *= m2;
101 VERIFY_IS_APPROX(m3, m1.cwise() * m2);
103 VERIFY_IS_APPROX(mones, m2.cwise()/m2)
[all...] |
| sparse_product.cpp | 15 static void run(SparseMatrixType& m2, SparseMatrixType& m4, DenseMatrix& refMat2, DenseMatrix& refMat4) {
16 int c = internal::random(0,m2.cols()-1);
17 int c1 = internal::random(0,m2.cols()-1);
18 VERIFY_IS_APPROX(m4=m2.col(c)*refMat2.col(c1).transpose(), refMat4=refMat2.col(c)*refMat2.col(c1).transpose());
19 VERIFY_IS_APPROX(m4=refMat2.col(c1)*m2.col(c).transpose(), refMat4=refMat2.col(c1)*refMat2.col(c).transpose());
24 static void run(SparseMatrixType& m2, SparseMatrixType& m4, DenseMatrix& refMat2, DenseMatrix& refMat4) {
25 int r = internal::random(0,m2.rows()-1);
26 int c1 = internal::random(0,m2.cols()-1);
27 VERIFY_IS_APPROX(m4=m2.row(r).transpose()*refMat2.col(c1).transpose(), refMat4=refMat2.row(r).transpose()*refMat2.col(c1).transpose());
28 VERIFY_IS_APPROX(m4=refMat2.col(c1)*m2.row(r), refMat4=refMat2.col(c1)*refMat2.row(r))
[all...] |
| 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>()));
|
| 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;
|
| /external/eigen/doc/examples/ |
| class_CwiseBinaryOp.cpp | 15 Matrix4d m1 = Matrix4d::Random(), m2 = Matrix4d::Random(); local
16 cout << m1.binaryExpr(m2, MakeComplexOp<double>()) << endl;
|
| /cts/suite/cts/deviceTests/opengl/test/ |
| MatrixTest.cpp | 36 Matrix m2; local
39 m2.mData[4] = 9;
41 ASSERT_TRUE(m1.equals(m2));
73 Matrix m2; local
76 m2.loadWith(m1);
79 checkValues(m2.mData, data, Matrix::MATRIX_SIZE);
85 Matrix* m2 = Matrix::newTranslate(10, 5, 6); local
86 ASSERT_TRUE(m2 != NULL);
87 ASSERT_TRUE(m1.equals(*m2));
88 delete m2;
94 Matrix* m2 = Matrix::newScale(10, 5, 6); local
103 Matrix* m2 = Matrix::newRotate(180, 1, 0, 1); local
112 Matrix m2; local
[all...] |
| /external/valgrind/main/none/tests/ |
| 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/CXX/expr/expr.prim/expr.prim.lambda/ |
| p12.cpp | 54 auto m2 = [i]{
60 (void)m2;
|
| /external/eigen/bench/ |
| sparse_product.cpp | 119 DenseMatrix m1(rows,cols), m2(rows,cols), m3(rows,cols);
121 eiToDense(sm2, m2);
126 m3 = m1 * m2;
133 m3 = m1.transpose() * m2;
140 m3 = m1.transpose() * m2.transpose();
147 m3 = m1 * m2.transpose();
188 DynamicSparseMatrix<Scalar> m1(sm1), m2(sm2), m3(sm3);
190 << m2.nonZeros()/(float(m2.rows())*float(m2.cols()))*100 << "%\n"
228 cs *m1, *m2, *m3; local
[all...] |
| /frameworks/base/tools/layoutlib/bridge/tests/src/android/graphics/ |
| Matrix_DelegateTest.java | 47 Matrix m2 = new Matrix(m1); local
52 m2.getValues(v2);
|
