HomeSort by relevance Sort by last modified time
    Searched defs:BENCH (Results 1 - 11 of 11) sorted by null

  /external/eigen/bench/
sparse_transpose.cpp 28 #define BENCH(X) \
54 BENCH(for (int k=0; k<REPEAT; ++k) m3 = m1.transpose();)
63 BENCH(for (int k=0; k<REPEAT; ++k) sm3 = sm1.transpose();)
73 BENCH(for (int k=0; k<REPEAT; ++k) { m3 = cs_transpose(m1,1); cs_spfree(m3);})
84 BENCH(for (int k=0; k<REPEAT; ++k) gmm::copy(gmm::transposed(m1),m3);)
94 BENCH(for (int k=0; k<REPEAT; ++k) m3 = trans(m1);)
sparse_dense_product.cpp 28 #define BENCH(X) \
95 BENCH(asm("#myc"); v2 = sm1 * v1; asm("#myd");)
99 BENCH( { asm("#mya"); v2 = sm1.transpose() * v1; asm("#myb"); })
108 // BENCH(for (int k=0; k<REPEAT; ++k) v2 = m1 * v1;)
111 // BENCH(for (int k=0; k<REPEAT; ++k) v2 = m1.transpose() * v1;)
127 BENCH( asm("#myx"); gmm::mult(m1, gmmV1, gmmV2); asm("#myy"); )
130 BENCH( gmm::mult(gmm::transposed(m1), gmmV1, gmmV2); )
149 BENCH( uv2 = boost::numeric::ublas::prod(m1, uv1); )
152 // BENCH( boost::ublas::prod(gmm::transposed(m1), gmmV1, gmmV2); )
sparse_cholesky.cpp 33 #define BENCH(X) \
108 // BENCH(LLT<DenseMatrix> chol(m1);)
142 //BENCH(taucs_ccs_matrix* chol = taucs_ccs_factor_llt(&A, 0, 0);)
143 // BENCH(taucs_supernodal_factor_to_ccs(taucs_ccs_factor_llt_ll(&A));)
sparse_lu.cpp 33 #define BENCH(X) \
sparse_product.cpp 30 #define BENCH(X) \
158 BENCH(sm3 = sm1 * sm2; )
161 // BENCH(sm3 = sm1.transpose() * sm2; )
164 // BENCH(sm3 = sm1.transpose() * sm2.transpose(); )
167 // BENCH(sm3 = sm1 * sm2.transpose(); )
173 // BENCH( sm3._experimentalNewProduct(sm1, sm2); )
176 // BENCH(sm3._experimentalNewProduct(sm1.transpose(),sm2); )
179 // BENCH(sm3._experimentalNewProduct(sm1.transpose(),sm2.transpose()); )
182 // BENCH(sm3._experimentalNewProduct(sm1, sm2.transpose());)
194 BENCH(for (int k=0; k<REPEAT; ++k) m3 = m1 * m2;
    [all...]
sparse_randomsetter.cpp 32 #define BENCH(X) \
sparse_trisolver.cpp 29 #define BENCH(X) \
86 BENCH(x = m1.marked<UpperTriangular>().solveTriangular(b);)
90 BENCH(x = m2.marked<UpperTriangular>().solveTriangular(b);)
101 BENCH(x = sm1.solveTriangular(b);)
105 BENCH(x = sm2.solveTriangular(b);)
110 // BENCH(sm1.inverseProductInPlace(x);)
115 // BENCH(sm2.inverseProductInPlace(x);)
129 BENCH(x = b; if (!cs_lsolve (m1, x.data())){std::cerr << "cs_lsolve failed\n"; break;}; )
147 BENCH(gmm::upper_tri_solve(m1, gmmX, false);)
152 BENCH(gmm::upper_tri_solve(m2, gmmX, false);
    [all...]
BenchTimer.h 163 #define BENCH(TIMER,TRIES,REP,CODE) { \
quat_slerp.cpp 4 #include <bench/BenchTimer.h>
219 // perf bench
228 #define BENCH(FUNC) {\
240 BENCH(nlerp);
241 BENCH(slerp_eigen);
242 BENCH(slerp_legacy);
243 BENCH(slerp_legacy_nlerp);
244 BENCH(slerp_rw);
245 BENCH(slerp_gael);
sparse_setter.cpp 36 #define BENCH(X) \
113 BENCH(setrand_eigen_dense(coords,values);)
121 // BENCH(setinnerrand_eigen(coords,values);)
125 BENCH(setrand_eigen_dynamic(coords,values);)
129 // BENCH(setrand_eigen_compact(coords,values);)
133 BENCH(setrand_eigen_sumeq(coords,values);)
137 // BENCH(setrand_eigen_gnu_hash(coords,values);)
141 BENCH(setrand_scipy(coords,values);)
146 BENCH(setrand_eigen_google_dense(coords,values);)
150 BENCH(setrand_eigen_google_sparse(coords,values);
    [all...]
  /external/skia/bench/
XfermodeBench.cpp 103 #define BENCH(...) \
107 BENCH(SkXfermode::kClear_Mode)
108 BENCH(SkXfermode::kSrc_Mode)
109 BENCH(SkXfermode::kDst_Mode)
110 BENCH(SkXfermode::kSrcOver_Mode)
111 BENCH(SkXfermode::kDstOver_Mode)
112 BENCH(SkXfermode::kSrcIn_Mode)
113 BENCH(SkXfermode::kDstIn_Mode)
114 BENCH(SkXfermode::kSrcOut_Mode)
115 BENCH(SkXfermode::kDstOut_Mode
    [all...]

Completed in 128 milliseconds