HomeSort by relevance Sort by last modified time
    Searched refs:REPEAT (Results 1 - 25 of 86) 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++)
benchmarkXcwise.cpp 17 #ifndef REPEAT
18 #define REPEAT 1000
29 for(int a = 0; a < REPEAT; a++)
benchmark.cpp 14 #ifndef REPEAT
15 #define REPEAT 40000000
32 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) {
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 "
benchmarkSlice.cpp 10 #ifndef REPEAT
11 #define REPEAT 10000
24 for(int a = 0; a < REPEAT; a++)
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);
81 << (timerNoSqrt.value() * REPEAT) / repeats << "s "
83 << (timerSqrt.value() * REPEAT) / repeats << "s "
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_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_lu.cpp 19 #ifndef REPEAT
20 #define REPEAT 1
37 for (int _k=0; _k<REPEAT; ++_k) { \
sparse_randomsetter.cpp 18 #ifndef REPEAT
19 #define REPEAT 1
36 for (int _k=0; _k<REPEAT; ++_k) { \
  /cts/tests/tests/graphics/src/android/graphics/cts/
Shader_TileModeTest.java 28 assertEquals(TileMode.REPEAT, TileMode.valueOf("REPEAT"));
35 assertEquals(TileMode.REPEAT, tileMode[1]);
ShaderTest.java 36 Shader shader = new BitmapShader(bitmap, Shader.TileMode.REPEAT, Shader.TileMode.REPEAT);
  /cts/suite/audio_quality/test/
TaskProcessTest.cpp 35 const android::String8 REPEAT("repeat");
39 ASSERT_TRUE(mSequential->parseAttribute(REPEAT, N_10));
TaskSequentialTest.cpp 42 const android::String8 REPEAT("repeat");
48 ASSERT_TRUE(mSequential->parseAttribute(REPEAT, N_10));
  /development/samples/ApiDemos/src/com/example/android/apis/graphics/
Patterns.java 74 mShader1 = new BitmapShader(makeBitmap1(), Shader.TileMode.REPEAT,
75 Shader.TileMode.REPEAT);
76 mShader2 = new BitmapShader(makeBitmap2(), Shader.TileMode.REPEAT,
77 Shader.TileMode.REPEAT);
  /cts/tests/tests/security/src/android/security/cts/
SqliteJournalLeakTest.java 35 private static final int REPEAT = 5;
94 for(int i=REPEAT; i > 0; i--) {
  /external/chromium_org/cc/resources/
ui_resource_bitmap.h 34 REPEAT
  /frameworks/base/graphics/java/android/graphics/
Shader.java 46 * repeat the shader's image horizontally and vertically
48 REPEAT (1),
50 * repeat the shader's image horizontally and vertically, alternating
  /frameworks/base/tests/CanvasCompare/src/com/android/test/hwuicompare/
ResourceModifiers.java 63 mRepeatShader = new BitmapShader(mBitmap, Shader.TileMode.REPEAT,
64 Shader.TileMode.REPEAT);
66 mTranslatedShader = new BitmapShader(mBitmap, Shader.TileMode.REPEAT,
67 Shader.TileMode.REPEAT);
  /frameworks/base/tests/HwAccelerationTest/src/com/android/test/hwui/
ShadersActivity.java 68 mRepeatShader = new BitmapShader(mTexture, Shader.TileMode.REPEAT,
69 Shader.TileMode.REPEAT);
71 mTranslatedShader = new BitmapShader(mTexture, Shader.TileMode.REPEAT,
72 Shader.TileMode.REPEAT);
  /cts/tests/sample/src/android/sample/cts/
SampleDeviceResultTest.java 35 * The number of times to repeat the test.
37 private static final int REPEAT = 5;
111 double[] result = MeasureTime.measure(REPEAT, workload);

Completed in 756 milliseconds

1 2 3 4