| /external/skqp/bench/ |
| D | BlendmodeBench.cpp | 74 #define BENCH(...) \ macro
78 BENCH(SkBlendMode::kClear)
79 BENCH(SkBlendMode::kSrc)
80 BENCH(SkBlendMode::kDst)
81 BENCH(SkBlendMode::kSrcOver)
82 BENCH(SkBlendMode::kDstOver)
83 BENCH(SkBlendMode::kSrcIn)
84 BENCH(SkBlendMode::kDstIn)
85 BENCH(SkBlendMode::kSrcOut)
86 BENCH(SkBlendMode::kDstOut)
[all …]
|
| /external/skia/bench/ |
| D | BlendmodeBench.cpp | 74 #define BENCH(...) \ macro
78 BENCH(SkBlendMode::kClear)
79 BENCH(SkBlendMode::kSrc)
80 BENCH(SkBlendMode::kDst)
81 BENCH(SkBlendMode::kSrcOver)
82 BENCH(SkBlendMode::kDstOver)
83 BENCH(SkBlendMode::kSrcIn)
84 BENCH(SkBlendMode::kDstIn)
85 BENCH(SkBlendMode::kSrcOut)
86 BENCH(SkBlendMode::kDstOut)
[all …]
|
| /external/eigen/bench/ |
| D | sparse_trisolver.cpp | 29 #define BENCH(X) \ macro
86 BENCH(x = m1.marked<UpperTriangular>().solveTriangular(b);) in main()
90 BENCH(x = m2.marked<UpperTriangular>().solveTriangular(b);) in main()
101 BENCH(x = sm1.solveTriangular(b);) in main()
105 BENCH(x = sm2.solveTriangular(b);) in main()
129 BENCH(x = b; if (!cs_lsolve (m1, x.data())){std::cerr << "cs_lsolve failed\n"; break;}; ) in main()
147 BENCH(gmm::upper_tri_solve(m1, gmmX, false);) in main()
152 BENCH(gmm::upper_tri_solve(m2, gmmX, false);) in main()
170 BENCH(x = mtl::upper_trisolve(m1,b);) in main()
174 BENCH(x = mtl::upper_trisolve(m2,b);) in main()
|
| D | sparse_transpose.cpp | 28 #define BENCH(X) \ macro
54 BENCH(for (int k=0; k<REPEAT; ++k) m3 = m1.transpose();) in main()
63 BENCH(for (int k=0; k<REPEAT; ++k) sm3 = sm1.transpose();) in main()
73 BENCH(for (int k=0; k<REPEAT; ++k) { m3 = cs_transpose(m1,1); cs_spfree(m3);}) in main()
84 BENCH(for (int k=0; k<REPEAT; ++k) gmm::copy(gmm::transposed(m1),m3);) in main()
94 BENCH(for (int k=0; k<REPEAT; ++k) m3 = trans(m1);) in main()
|
| D | dense_solvers.cpp | 59 BENCH(t_llt, tries, rep, compute_norm_equation(llt,A)); in bench()
60 BENCH(t_ldlt, tries, rep, compute_norm_equation(ldlt,A)); in bench()
61 BENCH(t_lu, tries, rep, compute_norm_equation(lu,A)); in bench()
63 BENCH(t_fplu, tries, rep, compute_norm_equation(fplu,A)); in bench()
64 BENCH(t_qr, tries, rep, compute(qr,A)); in bench()
65 BENCH(t_cpqr, tries, rep, compute(cpqr,A)); in bench()
66 BENCH(t_cod, tries, rep, compute(cod,A)); in bench()
68 BENCH(t_fpqr, tries, rep, compute(fpqr,A)); in bench()
70 BENCH(t_jsvd, tries, rep, jsvd.compute(A,svd_opt)); in bench()
72 BENCH(t_bdcsvd, tries, rep, bdcsvd.compute(A,svd_opt)); in bench()
|
| D | sparse_dense_product.cpp | 28 #define BENCH(X) \ macro
95 BENCH(asm("#myc"); v2 = sm1 * v1; asm("#myd");) in main()
99 BENCH( { asm("#mya"); v2 = sm1.transpose() * v1; asm("#myb"); }) in main()
127 BENCH( asm("#myx"); gmm::mult(m1, gmmV1, gmmV2); asm("#myy"); ) in main()
130 BENCH( gmm::mult(gmm::transposed(m1), gmmV1, gmmV2); ) in main()
149 BENCH( uv2 = boost::numeric::ublas::prod(m1, uv1); ) in main()
|
| D | sparse_product.cpp | 30 #define BENCH(X) \ macro
158 BENCH(sm3 = sm1 * sm2; ) in main()
232 BENCH( in main()
258 BENCH(boost::numeric::ublas::prod(m1, m2, m3);); in main()
272 BENCH(gmm::mult(m1, m2, gmmT3);); in main()
302 BENCH(m3 = m1 * m2;); in main()
|
| D | quat_slerp.cpp | 228 #define BENCH(FUNC) {\ in main() macro
240 BENCH(nlerp); in main()
241 BENCH(slerp_eigen); in main()
242 BENCH(slerp_legacy); in main()
243 BENCH(slerp_legacy_nlerp); in main()
244 BENCH(slerp_rw); in main()
245 BENCH(slerp_gael); in main()
|
| D | sparse_setter.cpp | 36 #define BENCH(X) \ macro
113 BENCH(setrand_eigen_dense(coords,values);) in main()
125 BENCH(setrand_eigen_dynamic(coords,values);) in main()
133 BENCH(setrand_eigen_sumeq(coords,values);) in main()
141 BENCH(setrand_scipy(coords,values);) in main()
146 BENCH(setrand_eigen_google_dense(coords,values);) in main()
150 BENCH(setrand_eigen_google_sparse(coords,values);) in main()
161 BENCH(setrand_ublas_genvec(coords,values);) in main()
186 BENCH(setrand_mtl(coords,values)); in main()
|
| D | bench_gemm.cpp | 261 BENCH(tblas, tries, rep, blas_gemm(a,b,c)); in main()
268 BENCH(tmt, tries, rep, gemm(a,b,c)); in main()
279 BENCH(tmono, tries, rep, gemm(a,b,c)); in main()
290 BENCH(tmt, tries, rep, c.noalias()+=a.lazyProduct(b)); in main()
306 BENCH(t, tries, rep, matlab_cplx_cplx(ar,ai,br,bi,cr,ci)); in main()
319 BENCH(t, tries, rep, matlab_real_cplx(a,br,bi,cr,ci)); in main()
332 BENCH(t, tries, rep, matlab_cplx_real(ar,ai,b,cr,ci)); in main()
|
| D | quatmul.cpp | 32 BENCH(t, tries, rep, quatmul_default(a,b,c)); in bench()
35 BENCH(t, tries, rep, quatmul_novec(a,b,c)); in bench()
|
| D | eig33.cpp | 178 BENCH(t, tries, rep, eig.compute(A)); in main()
181 BENCH(t, tries, rep, eig.computeDirect(A)); in main()
186 BENCH(t, tries, rep, eigen33(A,evecs,evals)); in main()
|
| D | product_threshold.cpp | 59 BENCH(t,1,rep,prod<CoeffBasedProductMode>(a,b,c)); in bench_prod()
63 BENCH(t,5,rep,prod<Mode>(a,b,c)); in bench_prod()
|
| D | sparse_randomsetter.cpp | 32 #define BENCH(X) \ macro
|
| D | sparse_lu.cpp | 33 #define BENCH(X) \ macro
|
| D | BenchTimer.h | 170 #define BENCH(TIMER,TRIES,REP,CODE) { \ macro
|
| D | geometry.cpp | 76 BENCH(timer,10,100000,transform(t,data)); in run()
|
| D | sparse_cholesky.cpp | 33 #define BENCH(X) \ macro
|
| D | spmv.cpp | 11 #define SPMV_BENCH(CODE) BENCH(t,tries,repeats,CODE);
|
| /external/eigen/bench/perf_monitoring/gemm/ |
| D | gemm.cpp | 47 BENCH(t, tries, rep, gemm(A,B,C)); in bench()
|
| D | lazy_gemm.cpp | 48 BENCH(t, tries, rep, lazy_gemm(A,B,C)); in bench()
|
| /external/autotest/client/tests/unixbench/ |
| D | unixbench.patch | 23 ############ THE BENCH IS TIMED ##############
|
| /external/eigen/bench/spbench/ |
| D | spbench.dtd | 1 <!ELEMENT BENCH (AVAILSOLVER+,LINEARSYSTEM+)> element
|
| /external/toolchain-utils/android_bench_suite/ |
| D | autotest.diff | 977 + parser.add_argument('-b', '--bench', metavar='BENCH', required=True,
|