| /external/eigen/test/ |
| D | diagonalmatrices.cpp | 31 RowVectorType rv1 = RowVectorType::Random(cols), in diagonalmatrices() local
34 RightDiagonalMatrix rdm1(rv1), rdm2(rv2); in diagonalmatrices()
63 VERIFY_IS_APPROX( ((m1 * rv1.asDiagonal())(i,j)) , rv1(j) * m1(i,j) ); in diagonalmatrices()
66 VERIFY_IS_APPROX( ((m1 * (rv1+rv2).asDiagonal())(i,j)) , (rv1+rv2)(j) * m1(i,j) ); in diagonalmatrices()
67 VERIFY_IS_APPROX( (((m1+m2) * (rv1+rv2).asDiagonal())(i,j)) , (rv1+rv2)(j) * (m1+m2)(i,j) ); in diagonalmatrices()
72 VERIFY_IS_APPROX( (res = m1.topRows(rows/2) * rv1.asDiagonal()), tmp * rv1.asDiagonal() ); in diagonalmatrices()
85 big.block(i,j,rows,cols) = big.block(i,j,rows,cols) * rv1.asDiagonal(); in diagonalmatrices()
86 VERIFY_IS_APPROX((big.block(i,j,rows,cols)) , m1 * rv1.asDiagonal() ); in diagonalmatrices()
|
| D | product_notemporary.cpp | 32 RowVectorType rv1 = RowVectorType::Random(rows), rvres(rows); in product_notemporary() local
122 VERIFY_EVALUATION_COUNT( cvres.noalias() -= m1 * rv1.adjoint(), 0 ); in product_notemporary()
131 m3 = cv1 * rv1; in product_notemporary()
132 VERIFY_EVALUATION_COUNT( m3.noalias() = cv1 * rv1, 0 ); in product_notemporary()
133 VERIFY_EVALUATION_COUNT( m3.noalias() = (cv1+cv1) * (rv1+rv1), 1 ); in product_notemporary()
134 VERIFY_EVALUATION_COUNT( m3.noalias() = (m1*cv1) * (rv1), 1 ); in product_notemporary()
135 VERIFY_EVALUATION_COUNT( m3.noalias() += (m1*cv1) * (rv1), 1 ); in product_notemporary()
136 VERIFY_EVALUATION_COUNT( rm3.noalias() = (cv1) * (rv1 * m1), 1 ); in product_notemporary()
137 VERIFY_EVALUATION_COUNT( rm3.noalias() -= (cv1) * (rv1 * m1), 1 ); in product_notemporary()
138 VERIFY_EVALUATION_COUNT( rm3.noalias() = (m1*cv1) * (rv1 * m1), 2 ); in product_notemporary()
[all …]
|
| D | geo_orthomethods.cpp | 75 RealVector3 rv1 = RealVector3::Random(); in orthomethods_3() local
76 VERIFY_IS_APPROX(v1.cross(rv1.template cast<Scalar>()), v1.cross(rv1)); in orthomethods_3()
77 VERIFY_IS_APPROX(rv1.template cast<Scalar>().cross(v1), rv1.cross(v1)); in orthomethods_3()
|
| D | adjoint.cpp | 144 RealVectorType rv1 = RealVectorType::Random(rows); in adjoint() local
145 VERIFY_IS_APPROX(v1.dot(rv1.template cast<Scalar>()), v1.dot(rv1)); in adjoint()
146 VERIFY_IS_APPROX(rv1.template cast<Scalar>().dot(v1), rv1.dot(v1)); in adjoint()
|
| D | array_for_matrix.cpp | 27 RowVectorType rv1 = RowVectorType::Random(cols); in array_for_matrix() local
56 VERIFY_IS_APPROX(m3.rowwise() += rv1, m1.rowwise() + rv1); in array_for_matrix()
58 VERIFY_IS_APPROX(m3.rowwise() -= rv1, m1.rowwise() - rv1); in array_for_matrix()
|
| D | array.cpp | 30 RowVectorType rv1 = RowVectorType::Random(cols); in array() local
84 VERIFY_IS_APPROX(m3.rowwise() += rv1, m1.rowwise() + rv1); in array()
86 VERIFY_IS_APPROX(m3.rowwise() -= rv1, m1.rowwise() - rv1); in array()
|
| D | sparse_product.cpp | 214 RowSpVector rv0(depth), rv1; in sparse_product() local
215 RowDenseVector drv0(depth), drv1(rv1); in sparse_product()
219 VERIFY_IS_APPROX(rv1=rv0*m3, drv1=drv0*refMat3); in sparse_product()
222 VERIFY_IS_APPROX(rv1=m3*cv0, drv1=refMat3*dcv0); in sparse_product()
|
| D | ref.cpp | 109 RefDynMat rv1 = v1; in ref_vector() local
110 VERIFY_IS_EQUAL(rv1, v1); in ref_vector()
|
| /external/libaom/libaom/av1/encoder/ |
| D | mathutils.h | 139 double *rv1 = (double *)aom_malloc(sizeof(*rv1) * (n + 1)); in svdcmp() local
143 rv1[i] = scale * g; in svdcmp()
177 for (k = l; k < n; k++) rv1[k] = u[i][k] / h; in svdcmp()
180 for (k = l; k < n; k++) u[j][k] += s * rv1[k]; in svdcmp()
185 anorm = fmax(anorm, (fabs(w[i]) + fabs(rv1[i]))); in svdcmp()
200 g = rv1[i]; in svdcmp()
225 if ((double)(fabs(rv1[l]) + anorm) == anorm || nm < 0) { in svdcmp()
235 f = s * rv1[i]; in svdcmp()
236 rv1[i] = c * rv1[i]; in svdcmp()
261 aom_free(rv1); in svdcmp()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/ARM/ |
| D | cortex-a57-misched-stm-wrback.ll | 30 %rv1 = mul i32 %val, %v0
31 %rv2 = mul i32 %rv1, %v1
|
| /external/swiftshader/third_party/LLVM/test/CodeGen/CellSPU/ |
| D | loads.ll | 30 %rv1 = call <4 x i32>* @getv4f32ptr()
32 %rv3 = load <4 x i32>* %rv1
|
| D | crash.ll | 5 %rv1 = call i8 @return_i8()
|
| /external/llvm/test/CodeGen/SPARC/ |
| D | 64abi.ll | 304 %rv1 = insertvalue { i64, i64 } undef, i64 %r1, 0
307 %rv2 = insertvalue { i64, i64 } %rv1, i64 %r2, 1
333 %rv1 = insertvalue { i32, float } undef, i32 %r1, 0
336 %rv2 = insertvalue { i32, float } %rv1, float %r2, 1
364 %rv1 = insertvalue { i32, float } undef, i32 %r1, 0
367 %rv2 = insertvalue { i32, float } %rv1, float %r2, 1
397 %rv1 = insertvalue { i32, i32 } undef, i32 %r1, 1
400 %rv2 = insertvalue { i32, i32 } %rv1, i32 %r2, 0
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/SPARC/ |
| D | 64abi.ll | 302 %rv1 = insertvalue { i64, i64 } undef, i64 %r1, 0
305 %rv2 = insertvalue { i64, i64 } %rv1, i64 %r2, 1
331 %rv1 = insertvalue { i32, float } undef, i32 %r1, 0
334 %rv2 = insertvalue { i32, float } %rv1, float %r2, 1
362 %rv1 = insertvalue { i32, float } undef, i32 %r1, 0
365 %rv2 = insertvalue { i32, float } %rv1, float %r2, 1
395 %rv1 = insertvalue { i32, i32 } undef, i32 %r1, 1
398 %rv2 = insertvalue { i32, i32 } %rv1, i32 %r2, 0
|
| /external/toolchain-utils/ |
| D | build_tool.py | 786 rv1 = Bootstrapper.ResetToolEbuildFile(options.chromeos_root, 'binutils')
787 return 0 if (rv and rv1) else 1
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/SLPVectorizer/X86/ |
| D | hadd.ll | 511 %rv1 = insertelement <16 x i16> %rv0 , i16 %r1 , i32 1
512 %rv2 = insertelement <16 x i16> %rv1 , i16 %r2 , i32 2
|
| D | hsub.ll | 511 %rv1 = insertelement <16 x i16> %rv0 , i16 %r1 , i32 1
512 %rv2 = insertelement <16 x i16> %rv1 , i16 %r2 , i32 2
|
| /external/hyphenation-patterns/hu/ |
| D | hyph-hu.pat.txt | 48680 rv1állv
48688 rv1á2rú
48720 rv1éke
48721 rv1ékk
48722 rv1ékn
48723 rv1ékü
48724 rv1é2lel
48767 rv1öss
48768 rv1ős
|