HomeSort by relevance Sort by last modified time
    Searched defs:REPEAT (Results 1 - 25 of 76) sorted by null

1 2 3 4

  /external/eigen/bench/
benchmarkX.cpp 18 #ifndef REPEAT
19 #define REPEAT 100
30 for(int a = 0; a < REPEAT; a++)
benchmark.cpp 14 #ifndef REPEAT
15 #define REPEAT 40000000
32 for(int a = 0; a < REPEAT; a++)
benchmarkXcwise.cpp 17 #ifndef REPEAT
18 #define REPEAT 1000
29 for(int a = 0; a < REPEAT; a++)
benchmarkSlice.cpp 10 #ifndef REPEAT
11 #define REPEAT 10000
24 for(int a = 0; a < REPEAT; a++)
vdw_new.cpp 14 #ifndef REPEAT
15 #define REPEAT 10000
51 for (unsigned int i = 0; i<REPEAT; ++i) {
benchGeometry.cpp 10 #ifndef REPEAT
11 #define REPEAT 1000000
70 for (int k=0; k<REPEAT; ++k)
sparse_transpose.cpp 14 #ifndef REPEAT
15 #define REPEAT 1
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);)
bench_reverse.cpp 7 #ifndef REPEAT
8 #define REPEAT 100000
24 int repeats = (REPEAT*1000)/size;
51 << (timerB.value() * REPEAT) / repeats << "s "
sparse_dense_product.cpp 14 #ifndef REPEAT
15 #define REPEAT 1
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; ++k) v2 = m1 * v1;
    [all...]
benchCholesky.cpp 18 #ifndef REPEAT
19 #define REPEAT 10000
41 int repeats = (REPEAT*1000)/(rows*rows);
109 << timerSqrt.value() * REPEAT / repeats << "s";
benchEigenSolver.cpp 19 #ifndef REPEAT
20 #define REPEAT 1000
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";
benchVecAdd.cpp 11 #ifndef REPEAT
12 #define REPEAT 10000
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)
sparse_cholesky.cpp 19 #ifndef REPEAT
20 #define REPEAT 1
37 for (int _k=0; _k<REPEAT; ++_k) { \
sparse_lu.cpp 19 #ifndef REPEAT
20 #define REPEAT 1
37 for (int _k=0; _k<REPEAT; ++_k) { \
sparse_product.cpp 17 #ifndef REPEAT
18 #define REPEAT 1
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; ++k) m3 = m1.transpose() * m2.transpose();
    [all...]
sparse_randomsetter.cpp 18 #ifndef REPEAT
19 #define REPEAT 1
36 for (int _k=0; _k<REPEAT; ++_k) { \
sparse_trisolver.cpp 15 #ifndef REPEAT
16 #define REPEAT 1
33 for (int _k=0; _k<REPEAT; ++_k) { \
  /external/eigen/unsupported/bench/
bench_svd.cpp 24 #ifndef REPEAT
25 #define REPEAT 10
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 ";
  /device/linaro/bootloader/edk2/UefiCpuPkg/Library/CpuExceptionHandlerLib/X64/
ExceptionHandlerAsm.asm 38 REPEAT 32
  /cts/tests/sample/src/android/sample/cts/
SampleDeviceResultTest.java 44 * The number of times to repeat the test.
46 private static final int REPEAT = 5;
65 double[] result = MeasureTime.measure(REPEAT, new MeasureRun() {
  /device/linaro/bootloader/edk2/UefiCpuPkg/Library/CpuExceptionHandlerLib/Ia32/
ExceptionHandlerAsm.asm 44 REPEAT 32
  /cts/hostsidetests/sample/src/android/sample/cts/
SampleHostResultTest.java 52 * The number of times to repeat the test.
54 private static final int REPEAT = 5;
114 double[] result = MeasureTime.measure(REPEAT, new MeasureRun() {
  /device/linaro/bootloader/edk2/UefiCpuPkg/PiSmmCpuDxeSmm/X64/
SmiException.asm 157 REPEAT 32
  /frameworks/base/graphics/java/android/graphics/
Shader.java 63 * repeat the shader's image horizontally and vertically
65 REPEAT (1),
67 * repeat the shader's image horizontally and vertically, alternating
  /bionic/libc/bionic/
getentropy_linux.c 61 #define REPEAT 5
345 int save_errno = errno, e, pgs = getpagesize(), faster = 0, repeat; local
361 repeat = 2;
365 repeat = REPEAT;
370 for (j = 0; j < repeat; j++) {

Completed in 2350 milliseconds

1 2 3 4