| /external/skia/bench/ |
| MemcpyBench.cpp | 54 static Memcpy32Bench<Memcpy32>* Bench(int count, Memcpy32 memcpy32, const char* name) {
57 #define BENCH(memcpy32, count) DEF_BENCH(return Bench(count, memcpy32, #memcpy32); )
64 BENCH(memcpy32_memcpy, 10)
65 BENCH(memcpy32_memcpy, 100)
66 BENCH(memcpy32_memcpy, 1000)
67 BENCH(memcpy32_memcpy, 10000)
68 BENCH(memcpy32_memcpy, 100000)
71 BENCH(sk_memcpy32, 10)
72 BENCH(sk_memcpy32, 100
[all...] |
| 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...] |
| /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_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);
|
| 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 | 7 #include <bench/BenchTimer.h>
201 BENCH(tblas, tries, rep, blas_gemm(a,b,c));
208 BENCH(tmt, tries, rep, gemm(a,b,c));
219 BENCH(tmono, tries, rep, gemm(a,b,c));
237 BENCH(t, tries, rep, matlab_cplx_cplx(ar,ai,br,bi,cr,ci));
250 BENCH(t, tries, rep, matlab_real_cplx(a,br,bi,cr,ci));
263 BENCH(t, tries, rep, matlab_cplx_real(ar,ai,b,cr,ci));
|
| BenchTimer.h | 163 #define BENCH(TIMER,TRIES,REP,CODE) { \
|
| sparse_lu.cpp | 33 #define BENCH(X) \
|
| sparse_randomsetter.cpp | 32 #define BENCH(X) \
|
| eig33.cpp | 43 #include <bench/BenchTimer.h>
182 BENCH(t, tries, rep, eig.compute(A));
187 BENCH(t, tries, rep, eigen33(A,evecs,evals));
|
| 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 | 190 #define MAINLOOP(cmd_data, BENCH, COMPUTE_AVG, PRINT_ITER, PRINT_AVG) \
199 BENCH; \
220 #define MAINLOOP_DATA(name, cmd_data, size, BENCH) \
225 BENCH; \
233 #define MAINLOOP_COLD(name, cmd_data, size, num_incrs, BENCH) \
251 BENCH; \
261 // be used by the BENCH code.
264 // BENCH - The actual code to benchmark and is timed.
265 #define BENCH_ONE_BUF(name, cmd_data, INIT, BENCH) \
271 MAINLOOP_DATA(name, cmd_data, size, BENCH);
[all...] |
