Searched refs:BENCH (Results 1 - 21 of 21) sorted by relevance

/external/skia/bench/
H A DBlendmodeBench.cpp71 #define BENCH(...) \ macro
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(SkBlendMod
[all...]
/external/skqp/bench/
H A DBlendmodeBench.cpp71 #define BENCH(...) \ macro
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(SkBlendMod
[all...]
/external/eigen/bench/
H A Dsparse_transpose.cpp28 #define BENCH(X) \ macro
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);)
H A Ddense_solvers.cpp59 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));
72 BENCH(t_bdcsv
[all...]
H A Dsparse_trisolver.cpp29 #define BENCH(X) \ macro
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(gm
[all...]
H A Dquatmul.cpp32 BENCH(t, tries, rep, quatmul_default(a,b,c));
35 BENCH(t, tries, rep, quatmul_novec(a,b,c));
H A Dsparse_dense_product.cpp28 #define BENCH(X) \ macro
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); )
H A Dsparse_product.cpp30 #define BENCH(X) \ macro
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(fo
[all...]
H A Dquat_slerp.cpp228 #define BENCH(FUNC) {\ macro
240 BENCH(nlerp);
241 BENCH(slerp_eigen);
242 BENCH(slerp_legacy);
243 BENCH(slerp_legacy_nlerp);
244 BENCH(slerp_rw);
245 BENCH(slerp_gael);
H A Deig33.cpp178 BENCH(t, tries, rep, eig.compute(A));
181 BENCH(t, tries, rep, eig.computeDirect(A));
186 BENCH(t, tries, rep, eigen33(A,evecs,evals));
H A Dsparse_setter.cpp36 #define BENCH(X) \ macro
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_spars
[all...]
H A Dproduct_threshold.cpp59 BENCH(t,1,rep,prod<CoeffBasedProductMode>(a,b,c));
63 BENCH(t,5,rep,prod<Mode>(a,b,c));
H A Dbench_gemm.cpp261 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));
H A DBenchTimer.h170 #define BENCH(TIMER,TRIES,REP,CODE) { \ macro
H A Dsparse_lu.cpp33 #define BENCH(X) \ macro
H A Dsparse_randomsetter.cpp32 #define BENCH(X) \ macro
H A Dgeometry.cpp76 BENCH(timer,10,100000,transform(t,data));
H A Dsparse_cholesky.cpp33 #define BENCH(X) \ macro
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));)
H A Dspmv.cpp11 #define SPMV_BENCH(CODE) BENCH(t,tries,repeats,CODE);
123 // BENCH();
127 // BENCH( { m3 = cs_sorted_multiply2(m1, m2); cs_spfree(m3); } );
/external/eigen/bench/perf_monitoring/gemm/
H A Dgemm.cpp47 BENCH(t, tries, rep, gemm(A,B,C));
H A Dlazy_gemm.cpp48 BENCH(t, tries, rep, lazy_gemm(A,B,C));

Completed in 773 milliseconds