diff options
| author |  Gael Guennebaud <g.gael@free.fr> | 2015-06-26 16:14:23 +0200 |
|---|---|---|
| committer | Gael Guennebaud <g.gael@free.fr> | 2015-06-26 16:14:23 +0200 |
| commit | c911fc8dee71809c7b6a3e60e4a582ac6da37815 (patch) | |
| tree | 7745ff04da336a6da46cfc38abdd15e5d8dc5a5f | |
| parent | 98ff17eb9e70ad62a2dad2eaee2900eb2f110720 (diff) | |
split compiler intensive bdcsvd_1 unit test
| -rw-r--r-- | Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h | 3 | ||||
| -rw-r--r-- | test/bdcsvd.cpp | 4 |
2 files changed, 4 insertions, 3 deletions
diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h index e46c16391..872866850 100644 --- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h +++ b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h @@ -486,10 +486,11 @@ ComputationInfo computeFromTridiagonal_impl(DiagType& diag, SubDiagType& subdiag while (end>0) { + EIGEN_ASM_COMMENT("beginabs"); for (Index i = start; i<end; ++i) if (internal::isMuchSmallerThan(abs(subdiag[i]),(abs(diag[i])+abs(diag[i+1]))) || abs(subdiag[i]) <= considerAsZero) subdiag[i] = 0; - + EIGEN_ASM_COMMENT("endabs"); // find the largest unreduced block while (end>0 && subdiag[end-1]==0) { diff --git a/test/bdcsvd.cpp b/test/bdcsvd.cpp index c77b7c519..f9f687aac 100644 --- a/test/bdcsvd.cpp +++ b/test/bdcsvd.cpp @@ -69,8 +69,8 @@ void test_bdcsvd() CALL_SUBTEST_7(( svd_verify_assert<BDCSVD<MatrixXf> >(MatrixXf(10,12)) )); CALL_SUBTEST_8(( svd_verify_assert<BDCSVD<MatrixXcd> >(MatrixXcd(7,5)) )); - CALL_SUBTEST_1(( svd_all_trivial_2x2(bdcsvd<Matrix2cd>) )); - CALL_SUBTEST_1(( svd_all_trivial_2x2(bdcsvd<Matrix2d>) )); + CALL_SUBTEST_101(( svd_all_trivial_2x2(bdcsvd<Matrix2cd>) )); + CALL_SUBTEST_102(( svd_all_trivial_2x2(bdcsvd<Matrix2d>) )); for(int i = 0; i < g_repeat; i++) { CALL_SUBTEST_3(( bdcsvd<Matrix3f>() )); |