Searched refs:REPEAT (Results 1 - 25 of 38) sorted by relevance

12

/external/eigen/bench/
H A D	benchmarkX.cpp	18 #ifndef REPEAT 19 #define REPEAT 100 macro 30 for(int a = 0; a < REPEAT; a++)
H A D	benchmarkXcwise.cpp	17 #ifndef REPEAT 18 #define REPEAT 1000 macro 29 for(int a = 0; a < REPEAT; a++)
H A D	benchmark.cpp	14 #ifndef REPEAT 15 #define REPEAT 40000000 macro 32 for(int a = 0; a < REPEAT; a++)
H A D	vdw_new.cpp	14 #ifndef REPEAT 15 #define REPEAT 10000 macro 51 for (unsigned int i = 0; i<REPEAT; ++i) {
H A D	sparse_transpose.cpp	14 #ifndef REPEAT 15 #define REPEAT 1 macro 32 for (int _k=0; _k<REPEAT; ++_k) { \ 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 D	bench_reverse.cpp	7 #ifndef REPEAT 8 #define REPEAT 100000 macro 24 int repeats = (REPEAT*1000)/size; 51 << (timerB.value() * REPEAT) / repeats << "s "
H A D	benchmarkSlice.cpp	10 #ifndef REPEAT 11 #define REPEAT 10000 macro 24 for(int a = 0; a < REPEAT; a++)
H A D	sparse_dense_product.cpp	14 #ifndef REPEAT 15 #define REPEAT 1 macro 32 for (int _k=0; _k<REPEAT; ++_k) { \ 77 for (int k=0; k<REPEAT; ++k) 80 std::cout << " a * v:\t" << timer.best() << " " << double(REPEAT)/timer.best() << " * / sec " << endl; 84 for (int k=0; k<REPEAT; ++k) 96 std::cout << " a * v:\t" << timer.best()/REPEAT << " " << double(REPEAT)/timer.best(REAL_TIMER) << " * / sec " << endl; 101 std::cout << " a' * v:\t" << timer.best()/REPEAT << endl; 108 // BENCH(for (int k=0; k<REPEAT; [all...]
H A D	benchEigenSolver.cpp	19 #ifndef REPEAT 20 #define REPEAT 1000 macro 39 int stdRepeats = std::max(1,int((REPEAT*1000)/(rows*rows*sqrt(rows)))); 86 << timerSa.value() * REPEAT / saRepeats << "s \t" 87 << timerStd.value() * REPEAT / stdRepeats << "s"; 122 << timerSa.value() * REPEAT / saRepeats << "s" 123 << /*timerStd.value() * REPEAT / stdRepeats << "s"*/ " na "; 168 << timerSa.value() * REPEAT / saRepeats << "s \t" 169 << timerStd.value() * REPEAT / stdRepeats << "s";
H A D	benchVecAdd.cpp	11 #ifndef REPEAT 12 #define REPEAT 10000 macro 43 std::cout << timer.value() << "s " << (double(size2*REPEAT)/timer.value())/(1024.*1024.*1024.) << " GFlops\n"; 60 std::cout << innersize << " x " << outersize << " " << timer.value() << "s " << (double(size2*REPEAT)/timer.value())/(1024.*1024.*1024.) << " GFlops\n"; 74 std::cout << timer.value() << "s " << (double(size2*REPEAT)/timer.value())/(1024.*1024.*1024.) << " GFlops\n"; 81 for (int k=0; k<REPEAT; ++k) 87 for (int k=0; k<REPEAT; ++k) 96 for (int k=0; k<REPEAT; ++k)
H A D	sparse_product.cpp	17 #ifndef REPEAT 18 #define REPEAT 1 macro 34 for (int _k=0; _k<REPEAT; ++_k) { \ 125 for (int k=0; k<REPEAT; ++k) 132 for (int k=0; k<REPEAT; ++k) 139 for (int k=0; k<REPEAT; ++k) 146 for (int k=0; k<REPEAT; ++k) 194 BENCH(for (int k=0; k<REPEAT; ++k) m3 = m1 * m2;) 207 BENCH(for (int k=0; k<REPEAT; ++k) m3 = m1.transpose() * m2;) 213 BENCH( for (int k=0; k<REPEAT; [all...]
H A D	sparse_lu.cpp	19 #ifndef REPEAT 20 #define REPEAT 1 macro 37 for (int _k=0; _k<REPEAT; ++_k) { \
H A D	sparse_randomsetter.cpp	18 #ifndef REPEAT 19 #define REPEAT 1 macro 36 for (int _k=0; _k<REPEAT; ++_k) { \
H A D	benchCholesky.cpp	18 #ifndef REPEAT 19 #define REPEAT 10000 macro 41 int repeats = (REPEAT*1000)/(rows*rows); 109 << timerSqrt.value() * REPEAT / repeats << "s";
H A D	benchGeometry.cpp	10 #ifndef REPEAT 11 #define REPEAT 1000000 macro 70 for (int k=0; k<REPEAT; ++k)
H A D	sparse_cholesky.cpp	19 #ifndef REPEAT 20 #define REPEAT 1 macro 37 for (int _k=0; _k<REPEAT; ++_k) { \
H A D	sparse_trisolver.cpp	15 #ifndef REPEAT 16 #define REPEAT 1 macro 33 for (int _k=0; _k<REPEAT; ++_k) { \
H A D	sparse_setter.cpp	14 #ifndef REPEAT 15 #define REPEAT 2 macro 40 for (int _k=0; _k<REPEAT; ++_k) { \ 167 for (int k=0; k<REPEAT; ++k) 175 for (int k=0; k<REPEAT; ++k)
/external/eigen/unsupported/bench/
H A D	bench_svd.cpp	24 #ifndef REPEAT 25 #define REPEAT 10 macro 46 for (int i=0; i<REPEAT; ++i) 53 for (int i=0; i<REPEAT; ++i) 60 cout << "Sample " << k << " : " << REPEAT << " computations : Jacobi : " << fixed << timerJacobi.value() << "s "; 77 for (int i=0; i<REPEAT; ++i) 84 for (int i=0; i<REPEAT; ++i) 91 cout << "Sample " << k << " : " << REPEAT << " computations : Jacobi : " << fixed << timerJacobi.value() << "s ";
/external/androidplot/Examples/DemoApp/src/com/androidplot/demos/
H A D	XYPlotWithBgImgActivity.java	17 private Shader WHITE_SHADER = new LinearGradient(1, 1, 1, 1, Color.WHITE, Color.WHITE, Shader.TileMode.REPEAT); 104 Shader.TileMode.REPEAT 117 Shader.TileMode.REPEAT, 118 Shader.TileMode.REPEAT);
/external/robolectric/v1/src/test/java/com/xtremelabs/robolectric/shadows/
H A D	BitmapDrawableTest.java	99 drawable.setTileModeXY(Shader.TileMode.REPEAT, Shader.TileMode.MIRROR); 100 assertEquals(Shader.TileMode.REPEAT, drawable.getTileModeX());
/external/pdfium/third_party/libtiff/
H A D	tif_pixarlog.c	111 #define REPEAT(n, op) { int i; i=n; do { i--; op; } while (i>0); } macro 165 REPEAT(stride, *op = ToLinearF[*wp&mask]; wp++; op++) 168 REPEAT(stride, 231 REPEAT(stride, t0 = ToLinearF[*wp&mask] * SCALE12; 235 REPEAT(stride, 281 REPEAT(stride, *op = ToLinear16[*wp&mask]; wp++; op++) 284 REPEAT(stride, 328 REPEAT(stride, *op = *wp&mask; wp++; op++) 331 REPEAT(stride, 376 REPEAT(strid [all...]
/external/libxml2/os400/
H A D	xmllint.cmd	113 (*REPEAT '--repeat') +
/external/mesa3d/src/gallium/drivers/nv30/
H A D	nv30_texture.c	46 NV30_WRAP(REPEAT);
/external/mesa3d/src/gallium/drivers/nv50/
H A D	nv50_state.c	440 NV50_TSC_WRAP_CASE(REPEAT);

Completed in 1300 milliseconds

12

Indexes created Sun Sep 10 09:05:34 CEST 2017