/external/skia/bench/ |
BlendmodeBench.cpp | 71 #define BENCH(...) \ 75 BENCH(SkBlendMode::kClear) 76 BENCH(SkBlendMode::kSrc) 77 BENCH(SkBlendMode::kDst) 78 BENCH(SkBlendMode::kSrcOver) 79 BENCH(SkBlendMode::kDstOver) 80 BENCH(SkBlendMode::kSrcIn) 81 BENCH(SkBlendMode::kDstIn) 82 BENCH(SkBlendMode::kSrcOut) 83 BENCH(SkBlendMode::kDstOut [all...] |
/external/skqp/bench/ |
BlendmodeBench.cpp | 71 #define BENCH(...) \ 75 BENCH(SkBlendMode::kClear) 76 BENCH(SkBlendMode::kSrc) 77 BENCH(SkBlendMode::kDst) 78 BENCH(SkBlendMode::kSrcOver) 79 BENCH(SkBlendMode::kDstOver) 80 BENCH(SkBlendMode::kSrcIn) 81 BENCH(SkBlendMode::kDstIn) 82 BENCH(SkBlendMode::kSrcOut) 83 BENCH(SkBlendMode::kDstOut [all...] |
/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);)
|
dense_solvers.cpp | 30 void bench(int id, int rows, int size = Size) function 59 BENCH(t_llt, tries, rep, compute_norm_equation(llt,A)); 60 BENCH(t_ldlt, tries, rep, compute_norm_equation(ldlt,A)); 61 BENCH(t_lu, tries, rep, compute_norm_equation(lu,A)); 63 BENCH(t_fplu, tries, rep, compute_norm_equation(fplu,A)); 64 BENCH(t_qr, tries, rep, compute(qr,A)); 65 BENCH(t_cpqr, tries, rep, compute(cpqr,A)); 66 BENCH(t_cod, tries, rep, compute(cod,A)); 68 BENCH(t_fpqr, tries, rep, compute(fpqr,A)); 70 BENCH(t_jsvd, tries, rep, jsvd.compute(A,svd_opt)) [all...] |
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...] |
quatmul.cpp | 4 #include <bench/BenchTimer.h> 20 template<typename Quat> void bench(const std::string& label) function 32 BENCH(t, tries, rep, quatmul_default(a,b,c)); 35 BENCH(t, tries, rep, quatmul_novec(a,b,c)); 41 bench<Quaternionf>("float "); 42 bench<Quaterniond>("double");
|
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_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...] |
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);
|
eig33.cpp | 43 #include <bench/BenchTimer.h> 178 BENCH(t, tries, rep, eig.compute(A)); 181 BENCH(t, tries, rep, eig.computeDirect(A)); 186 BENCH(t, tries, rep, eigen33(A,evecs,evals));
|
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...] |
product_threshold.cpp | 4 #include <bench/BenchTimer.h> 59 BENCH(t,1,rep,prod<CoeffBasedProductMode>(a,b,c)); 63 BENCH(t,5,rep,prod<Mode>(a,b,c));
|
bench_gemm.cpp | 15 #include <bench/BenchTimer.h> 261 BENCH(tblas, tries, rep, blas_gemm(a,b,c)); 268 BENCH(tmt, tries, rep, gemm(a,b,c)); 279 BENCH(tmono, tries, rep, gemm(a,b,c)); 290 BENCH(tmt, tries, rep, c.noalias()+=a.lazyProduct(b)); 306 BENCH(t, tries, rep, matlab_cplx_cplx(ar,ai,br,bi,cr,ci)); 319 BENCH(t, tries, rep, matlab_real_cplx(a,br,bi,cr,ci)); 332 BENCH(t, tries, rep, matlab_cplx_real(ar,ai,b,cr,ci));
|
BenchTimer.h | 170 #define BENCH(TIMER,TRIES,REP,CODE) { \
|
sparse_lu.cpp | 33 #define BENCH(X) \
|
sparse_randomsetter.cpp | 32 #define BENCH(X) \
|
geometry.cpp | 4 #include <bench/BenchTimer.h> 76 BENCH(timer,10,100000,transform(t,data)); 90 EIGEN_DONT_INLINE void bench(const std::string& msg, const Transformation& t) function 118 bench("matrix 3x3", mat33); 119 bench("quaternion", quat); 120 bench("quat-mat ", quatmat); 121 bench("isometry3 ", iso3); 122 bench("affine3 ", aff3); 123 bench("c affine3 ", caff3); 124 bench("proj3 ", proj3) [all...] |
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));)
|
spmv.cpp | 11 #define SPMV_BENCH(CODE) BENCH(t,tries,repeats,CODE); 123 // BENCH(); 127 // BENCH( { m3 = cs_sorted_multiply2(m1, m2); cs_spfree(m3); } );
|
/system/extras/micro_bench/ |
micro_bench.cpp | 198 #define MAINLOOP(cmd_data, BENCH, COMPUTE_AVG, PRINT_ITER, PRINT_AVG) \ 207 BENCH; \ 228 #define MAINLOOP_DATA(name, cmd_data, size, BENCH) \ 233 BENCH; \ 241 #define MAINLOOP_COLD(name, cmd_data, size, num_incrs, BENCH) \ 259 BENCH; \ 269 // be used by the BENCH code. 272 // BENCH - The actual code to benchmark and is timed. 273 #define BENCH_ONE_BUF(name, cmd_data, INIT, BENCH) \ 279 MAINLOOP_DATA(name, cmd_data, size, BENCH); [all...] |
/external/eigen/bench/perf_monitoring/gemm/ |
gemm.cpp | 23 double bench(long m, long n, long k) function 47 BENCH(t, tries, rep, gemm(A,B,C)); 61 results.push_back( bench(m, n, k) );
|
lazy_gemm.cpp | 26 double bench() function 48 BENCH(t, tries, rep, lazy_gemm(A,B,C)); 57 return bench<m,n,k,RowMajor>(); 59 return bench<m,n,k,0>();
|
/prebuilts/go/darwin-x86/src/cmd/internal/test2json/ |
test2json.go | 144 []byte("--- BENCH: "), 191 // "--- BENCH: "
|
/prebuilts/go/linux-x86/src/cmd/internal/test2json/ |
test2json.go | 144 []byte("--- BENCH: "), 191 // "--- BENCH: "
|
/prebuilts/go/darwin-x86/src/go/doc/testdata/ |
benchmark.go | 15 var matchBenchmarks = flag.String("test.bench", "", "regular expression to select benchmarks to run") 225 fmt.Fprintf(os.Stderr, "testing: invalid regexp for -test.bench: %s\n", err) 257 fmt.Printf("--- BENCH: %s\n%s", benchName, b.output)
|