| /external/eigen/test/eigen2/ |
| main.h | 90 VERIFY(Eigen::should_raise_an_assert && # a); \
92 Eigen::ei_push_assert = false; VERIFY(true); \
110 try { a; VERIFY(Eigen::should_raise_an_assert && # a); } \
111 catch (Eigen::eigen_assert_exception e) { VERIFY(true); } \
130 #define VERIFY(a) do { if (!(a)) { \
136 #define VERIFY_IS_APPROX(a, b) VERIFY(test_ei_isApprox(a, b))
137 #define VERIFY_IS_NOT_APPROX(a, b) VERIFY(!test_ei_isApprox(a, b))
138 #define VERIFY_IS_MUCH_SMALLER_THAN(a, b) VERIFY(test_ei_isMuchSmallerThan(a, b))
139 #define VERIFY_IS_NOT_MUCH_SMALLER_THAN(a, b) VERIFY(!test_ei_isMuchSmallerThan(a, b))
140 #define VERIFY_IS_APPROX_OR_LESS_THAN(a, b) VERIFY(test_ei_isApproxOrLessThan(a, b)
[all...] |
| eigen2_newstdvector.cpp | 38 VERIFY((std::size_t)&(v[22]) == (std::size_t)&(v[21]) + sizeof(MatrixType));
47 VERIFY(v[i]==w[(i-23)%w.size()]);
73 VERIFY((std::size_t)&(v[22]) == (std::size_t)&(v[21]) + sizeof(TransformType));
82 VERIFY(v[i].matrix()==w[(i-23)%w.size()].matrix());
108 VERIFY((std::size_t)&(v[22]) == (std::size_t)&(v[21]) + sizeof(QuaternionType));
117 VERIFY(v[i].coeffs()==w[(i-23)%w.size()].coeffs());
|
| eigen2_qtvector.cpp | 47 VERIFY((size_t)&(v[22]) == (size_t)&(v[21]) + sizeof(MatrixType));
56 VERIFY(v[i]==w[(i-23)%w.size()]);
82 VERIFY((size_t)&(v[22]) == (size_t)&(v[21]) + sizeof(TransformType));
91 VERIFY(v[i].matrix()==w[(i-23)%w.size()].matrix());
117 VERIFY((size_t)&(v[22]) == (size_t)&(v[21]) + sizeof(QuaternionType));
126 VERIFY(v[i].coeffs()==w[(i-23)%w.size()].coeffs());
|
| eigen2_stdvector.cpp | 37 VERIFY((std::size_t)&(v[22]) == (std::size_t)&(v[21]) + sizeof(MatrixType));
46 VERIFY(v[i]==w[(i-23)%w.size()]);
72 VERIFY((std::size_t)&(v[22]) == (std::size_t)&(v[21]) + sizeof(TransformType));
81 VERIFY(v[i].matrix()==w[(i-23)%w.size()].matrix());
107 VERIFY((std::size_t)&(v[22]) == (std::size_t)&(v[21]) + sizeof(QuaternionType));
116 VERIFY(v[i].coeffs()==w[(i-23)%w.size()].coeffs());
|
| eigen2_adjoint.cpp | 51 VERIFY(ei_isApprox((s1 * v1 + s2 * v2).eigen2_dot(v3), s1 * v1.eigen2_dot(v3) + s2 * v2.eigen2_dot(v3), largerEps));
52 VERIFY(ei_isApprox(v3.eigen2_dot(s1 * v1 + s2 * v2), ei_conj(s1)*v3.eigen2_dot(v1)+ei_conj(s2)*v3.eigen2_dot(v2), largerEps));
62 VERIFY(ei_isApprox(v1.eigen2_dot(square * v2), (square.adjoint() * v1).eigen2_dot(v2), largerEps));
|
| eigen2_sparse_basic.cpp | 154 VERIFY(( test_random_setter<RandomSetter<SparseMatrixType, StdMapTraits> >(m,refMat,nonzeroCoords) ));
156 VERIFY(( test_random_setter<RandomSetter<SparseMatrixType, StdUnorderedMapTraits> >(m,refMat,nonzeroCoords) ));
159 VERIFY(( test_random_setter<RandomSetter<SparseMatrixType, GoogleDenseHashMapTraits> >(m,refMat,nonzeroCoords) ));
162 VERIFY(( test_random_setter<RandomSetter<SparseMatrixType, GoogleSparseHashMapTraits> >(m,refMat,nonzeroCoords) ));
300 VERIFY(countFalseNonZero+countTrueNonZero == m2.nonZeros());
303 VERIFY(countTrueNonZero==m2.nonZeros());
|
| eigen2_svd.cpp | 62 for(int i = 0; i < rows; i++) VERIFY(positive.diagonal()[i] >= 0); // cheap necessary (not sufficient) condition for positivity
68 for(int i = 0; i < rows; i++) VERIFY(positive.diagonal()[i] >= 0); // cheap necessary (not sufficient) condition for positivity
|
| /external/mesa3d/src/mesa/drivers/windows/gdi/ |
| wgl.c | 375 #define VERIFY(a) (void)(a)
383 VERIFY(GetTextMetrics(fontDevice, &metric));
399 VERIFY(SetTextAlign(bitDevice, TA_BASELINE) != GDI_ERROR ? 1 : 0);
412 VERIFY(GetTextExtentPoint32(bitDevice, &curChar, 1, &size));
423 /* VERIFY(bitObject); */
427 (void) VERIFY(origBmap);
429 VERIFY( PatBlt( bitDevice, 0, 0, bmapWidth, bmapHeight,BLACKNESS ) );
432 VERIFY(SelectObject(bitDevice, GetCurrentObject(fontDevice,OBJ_FONT)));
435 VERIFY(TextOut(bitDevice, 0, metric.tmAscent, &curChar, 1));
438 VERIFY(SelectObject(bitDevice, origBmap))
[all...] |
| /external/eigen/test/ |
| product_large.cpp | 44 VERIFY(l1==l1CacheSize());
45 VERIFY(l2==l2CacheSize());
|
| qtvector.cpp | 47 VERIFY((size_t)&(v[22]) == (size_t)&(v[21]) + sizeof(MatrixType));
56 VERIFY(v[i]==w[(i-23)%w.size()]);
82 VERIFY((size_t)&(v[22]) == (size_t)&(v[21]) + sizeof(TransformType));
91 VERIFY(v[i].matrix()==w[(i-23)%w.size()].matrix());
117 VERIFY((size_t)&(v[22]) == (size_t)&(v[21]) + sizeof(QuaternionType));
126 VERIFY(v[i].coeffs()==w[(i-23)%w.size()].coeffs());
|
| stdvector.cpp | 37 VERIFY((size_t)&(v[22]) == (size_t)&(v[21]) + sizeof(MatrixType));
46 VERIFY(v[i]==w[(i-23)%w.size()]);
72 VERIFY((size_t)&(v[22]) == (size_t)&(v[21]) + sizeof(TransformType));
81 VERIFY(v[i].matrix()==w[(i-23)%w.size()].matrix());
107 VERIFY((size_t)&(v[22]) == (size_t)&(v[21]) + sizeof(QuaternionType));
116 VERIFY(v[i].coeffs()==w[(i-23)%w.size()].coeffs());
|
| stdvector_overload.cpp | 51 VERIFY((size_t)&(v[22]) == (size_t)&(v[21]) + sizeof(MatrixType));
60 VERIFY(v[i]==w[(i-23)%w.size()]);
86 VERIFY((size_t)&(v[22]) == (size_t)&(v[21]) + sizeof(TransformType));
95 VERIFY(v[i].matrix()==w[(i-23)%w.size()].matrix());
121 VERIFY((size_t)&(v[22]) == (size_t)&(v[21]) + sizeof(QuaternionType));
130 VERIFY(v[i].coeffs()==w[(i-23)%w.size()].coeffs());
|
| array_for_matrix.cpp | 64 // verify the const accessors exist
69 VERIFY(&ref_a1 == &ref_m1);
70 VERIFY(&ref_a2 == &ref_m2);
90 VERIFY(((m1.array() + Scalar(1)) > m1.array()).all());
91 VERIFY(((m1.array() - Scalar(1)) < m1.array()).all());
96 VERIFY(! (m1.array() < m3.array()).all() );
97 VERIFY(! (m1.array() > m3.array()).all() );
101 VERIFY( (m1.array() != (m1(r,c)+1) ).any() );
102 VERIFY( (m1.array() > (m1(r,c)-1) ).any() );
103 VERIFY( (m1.array() < (m1(r,c)+1) ).any() )
[all...] |
| main.h | 156 VERIFY(Eigen::should_raise_an_assert && # a); \
158 Eigen::internal::push_assert = false; VERIFY(true); \
180 VERIFY(Eigen::should_raise_an_assert && # a); \
182 catch (Eigen::eigen_assert_exception&) { VERIFY(true); } \
215 #define VERIFY(a) ::verify_impl(a, g_test_stack.back().c_str(), __FILE__, __LINE__, EI_PP_MAKE_STRING(a))
217 #define VERIFY_IS_EQUAL(a, b) VERIFY(test_is_equal(a, b))
218 #define VERIFY_IS_APPROX(a, b) VERIFY(test_isApprox(a, b))
219 #define VERIFY_IS_NOT_APPROX(a, b) VERIFY(!test_isApprox(a, b))
220 #define VERIFY_IS_MUCH_SMALLER_THAN(a, b) VERIFY(test_isMuchSmallerThan(a, b))
221 #define VERIFY_IS_NOT_MUCH_SMALLER_THAN(a, b) VERIFY(!test_isMuchSmallerThan(a, b)
[all...] |
| eigensolver_selfadjoint.cpp | 60 VERIFY((symmA.template selfadjointView<Lower>() * eiSymm.eigenvectors()).isApprox(
65 VERIFY((symmA.template selfadjointView<Lower>() * eiDirect.eigenvectors()).isApprox(
76 VERIFY((symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors()).isApprox(
82 VERIFY((symmB.template selfadjointView<Lower>() * (symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox(
88 VERIFY((symmC.template selfadjointView<Lower>() * (symmB.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox(
|
| stable_norm.cpp | 45 VERIFY( (!(iemin > 1 - 2*it || 1+it>iemax || (it==2 && ibeta<5) || (it<=4 && ibeta <= 3 ) || it<2))
80 VERIFY(!isFinite( std::numeric_limits<RealScalar>::infinity()));
81 VERIFY(!isFinite(sqrt(-abs(big))));
84 VERIFY(isFinite(sqrt(size)*abs(big)));
91 VERIFY(isFinite(sqrt(size)*abs(small)));
|
| cholesky.cpp | 26 VERIFY( (#XPR) && nb_temporaries==N ); \
111 VERIFY(chollo.info()==NumericalIssue);
328 VERIFY(!ldlt.isNegative());
329 VERIFY(!ldlt.isPositive());
334 VERIFY(!ldlt.isNegative());
335 VERIFY(!ldlt.isPositive());
340 VERIFY(ldlt.isNegative());
341 VERIFY(ldlt.isPositive());
346 VERIFY(!ldlt.isNegative());
347 VERIFY(ldlt.isPositive())
[all...] |
| schur_real.cpp | 24 VERIFY(T(row,col) == Scalar(0));
32 VERIFY(row == size-1 || T(row+1,row) == 0);
35 VERIFY(4 * det > tr * tr);
|
| adjoint.cpp | 19 VERIFY(test_isApproxWithRef((s1 * v1 + s2 * v2).dot(v3), numext::conj(s1) * v1.dot(v3) + numext::conj(s2) * v2.dot(v3), 0));
20 VERIFY(test_isApproxWithRef(v3.dot(s1 * v1 + s2 * v2), s1*v3.dot(v1)+s2*v3.dot(v2), 0));
23 VERIFY(test_isApproxWithRef(v1.dot(square * v2), (square.adjoint() * v1).dot(v2), 0));
34 VERIFY(test_isApproxWithRef((s1 * v1 + s2 * v2).dot(v3), numext::conj(s1) * v1.dot(v3) + numext::conj(s2) * v2.dot(v3), ref));
35 VERIFY(test_isApproxWithRef(v3.dot(s1 * v1 + s2 * v2), s1*v3.dot(v1)+s2*v3.dot(v2), ref));
48 VERIFY(internal::isMuchSmallerThan(abs(v1.dot(square * v2) - (square.adjoint() * v1).dot(v2)), ref, test_precision<Scalar>()));
|
| geo_quaternion.cpp | 39 VERIFY(abs(q.norm() - 1) < largeEps);
40 if(theta_tot==0) VERIFY(theta_tot==0);
41 else VERIFY(abs(theta - t * theta_tot) < largeEps);
98 VERIFY( (q2*q1).isApprox(q1*q2, largeEps)
262 // verify that map-to-const don't have LvalueBit
264 VERIFY( !(internal::traits<Map<ConstPlainObjectType> >::Flags & LvalueBit) );
265 VERIFY( !(internal::traits<Map<ConstPlainObjectType, Aligned> >::Flags & LvalueBit) );
266 VERIFY( !(Map<ConstPlainObjectType>::Flags & LvalueBit) );
267 VERIFY( !(Map<ConstPlainObjectType, Aligned>::Flags & LvalueBit) );
|
| /external/eigen/unsupported/test/ |
| mpreal_support.cpp | 30 VERIFY(Eigen::internal::isApprox(A.array().abs2().sum(), A.squaredNorm()));
48 VERIFY( (S.selfadjointView<Lower>() * eig.eigenvectors()).isApprox(eig.eigenvectors() * eig.eigenvalues().asDiagonal(), NumTraits<mpreal>::dummy_precision()*1e3) );
|
| matrix_power.cpp | 56 VERIFY(C.isApprox(B, static_cast<T>(tol)));
78 VERIFY(C.isApprox(B, static_cast<T>(tol)));
100 VERIFY(m4.isApprox(m5, static_cast<RealScalar>(tol)));
104 VERIFY(m4.isApprox(m5, static_cast<RealScalar>(tol)));
108 VERIFY(m4.isApprox(m5, static_cast<RealScalar>(tol)));
|
| polynomialutils.cpp | 46 VERIFY( evalToZero );
87 VERIFY( eval );
|
| /art/test/etc/ |
| run-test-jar | 45 VERIFY="y"
149 elif [ "x$1" = "x--no-verify" ]; then
150 VERIFY="n"
190 if [ "$VERIFY" = "y" ]; then
201 if [ "$VERIFY" = "y" ]; then
264 if [ "$VERIFY" = "y" ] ; then
267 COMPILE_FLAGS="${COMPILE_FLAGS} --compiler-filter=verify-none"
274 if [ "$VERIFY" = "y" ] ; then
275 COMPILE_FLAGS="${COMPILE_FLAGS} --compiler-filter=verify-at-runtime"
277 COMPILE_FLAGS="${COMPILE_FLAGS} --compiler-filter=verify-none
[all...] |
| /libcore/luni/src/main/java/java/security/ |
| Signature.java | 67 protected static final int VERIFY = 3;
72 * {@link #VERIFY}.
296 state = VERIFY;
309 * the certificate used to verify a signature.
343 state = VERIFY;
437 * initialization for verifying and thus can be used to verify another
441 * the signature to verify.
448 public final boolean verify(byte[] signature) throws SignatureException { method in class:Signature
449 if (state != VERIFY) {
461 * initialization for verifying and thus can be used to verify anothe
479 public final boolean verify(byte[] signature, int offset, int length) method in class:Signature
[all...] |
