/external/eigen/bench/ |
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) in main() 80 …std::cout << " a * v:\t" << timer.best() << " " << double(REPEAT)/timer.best() << " * / sec " <… in main() 84 for (int k=0; k<REPEAT; ++k) in main() 96 …std::cout << " a * v:\t" << timer.best()/REPEAT << " " << double(REPEAT)/timer.best(REAL_TIMER)… in main() 101 std::cout << " a' * v:\t" << timer.best()/REPEAT << endl; in main() 168 for (int k=0; k<REPEAT; ++k) in main() 175 for (int k=0; k<REPEAT; ++k) in main()
|
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();) in main() 63 BENCH(for (int k=0; k<REPEAT; ++k) sm3 = sm1.transpose();) in main() 73 BENCH(for (int k=0; k<REPEAT; ++k) { m3 = cs_transpose(m1,1); cs_spfree(m3);}) in main() 84 BENCH(for (int k=0; k<REPEAT; ++k) gmm::copy(gmm::transposed(m1),m3);) in main() 94 BENCH(for (int k=0; k<REPEAT; ++k) m3 = trans(m1);) in main()
|
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.) <<… in main() 60 …< " x " << outersize << " " << timer.value() << "s " << (double(size2*REPEAT)/timer.value())/(1… in main() 74 …std::cout << timer.value() << "s " << (double(size2*REPEAT)/timer.value())/(1024.*1024.*1024.) <… in main() 81 for (int k=0; k<REPEAT; ++k) in benchVec() 87 for (int k=0; k<REPEAT; ++k) in benchVec() 96 for (int k=0; k<REPEAT; ++k) in benchVec()
|
D | benchEigenSolver.cpp | 19 #ifndef REPEAT 20 #define REPEAT 1000 macro 39 int stdRepeats = std::max(1,int((REPEAT*1000)/(rows*rows*sqrt(rows)))); in benchEigenSolver() 86 << timerSa.value() * REPEAT / saRepeats << "s \t" in benchEigenSolver() 87 << timerStd.value() * REPEAT / stdRepeats << "s"; in benchEigenSolver() 122 << timerSa.value() * REPEAT / saRepeats << "s" in benchEigenSolver() 168 << timerSa.value() * REPEAT / saRepeats << "s \t" in benchEigenSolver() 169 << timerStd.value() * REPEAT / stdRepeats << "s"; in benchEigenSolver()
|
D | benchCholesky.cpp | 18 #ifndef REPEAT 19 #define REPEAT 10000 macro 41 int repeats = (REPEAT*1000)/(rows*rows); in benchLLT() 81 << (timerNoSqrt.value() * REPEAT) / repeats << "s " in benchLLT() 83 << (timerSqrt.value() * REPEAT) / repeats << "s " in benchLLT() 109 << timerSqrt.value() * REPEAT / repeats << "s"; in benchLLT()
|
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) in main() 132 for (int k=0; k<REPEAT; ++k) in main() 139 for (int k=0; k<REPEAT; ++k) in main() 146 for (int k=0; k<REPEAT; ++k) in main()
|
D | bench_reverse.cpp | 7 #ifndef REPEAT 8 #define REPEAT 100000 macro 24 int repeats = (REPEAT*1000)/size; in bench_reverse() 51 << (timerB.value() * REPEAT) / repeats << "s " in bench_reverse()
|
D | benchmarkXcwise.cpp | 17 #ifndef REPEAT 18 #define REPEAT 1000 macro 29 for(int a = 0; a < REPEAT; a++) in main()
|
D | benchmarkX.cpp | 18 #ifndef REPEAT 19 #define REPEAT 100 macro 30 for(int a = 0; a < REPEAT; a++) in main()
|
D | benchmark.cpp | 14 #ifndef REPEAT 15 #define REPEAT 40000000 macro 32 for(int a = 0; a < REPEAT; a++) in main()
|
D | vdw_new.cpp | 14 #ifndef REPEAT 15 #define REPEAT 10000 macro 51 for (unsigned int i = 0; i<REPEAT; ++i) { in main()
|
D | benchmarkSlice.cpp | 10 #ifndef REPEAT 11 #define REPEAT 10000 macro 24 for(int a = 0; a < REPEAT; a++) in main()
|
D | sparse_randomsetter.cpp | 18 #ifndef REPEAT 19 #define REPEAT 1 macro 36 for (int _k=0; _k<REPEAT; ++_k) { \
|
D | sparse_lu.cpp | 19 #ifndef REPEAT 20 #define REPEAT 1 macro 37 for (int _k=0; _k<REPEAT; ++_k) { \
|
D | benchGeometry.cpp | 10 #ifndef REPEAT 11 #define REPEAT 1000000 macro 70 for (int k=0; k<REPEAT; ++k) in run()
|
D | sparse_cholesky.cpp | 19 #ifndef REPEAT 20 #define REPEAT 1 macro 37 for (int _k=0; _k<REPEAT; ++_k) { \
|
D | sparse_trisolver.cpp | 15 #ifndef REPEAT 16 #define REPEAT 1 macro 33 for (int _k=0; _k<REPEAT; ++_k) { \
|
D | sparse_setter.cpp | 14 #ifndef REPEAT 15 #define REPEAT 2 macro 40 for (int _k=0; _k<REPEAT; ++_k) { \
|
/external/eigen/unsupported/bench/ |
D | bench_svd.cpp | 24 #ifndef REPEAT 25 #define REPEAT 10 macro 46 for (int i=0; i<REPEAT; ++i) in bench_svd() 53 for (int i=0; i<REPEAT; ++i) in bench_svd() 60 …cout << "Sample " << k << " : " << REPEAT << " computations : Jacobi : " << fixed << timerJacobi.… in bench_svd() 77 for (int i=0; i<REPEAT; ++i) in bench_svd() 84 for (int i=0; i<REPEAT; ++i) in bench_svd() 91 …cout << "Sample " << k << " : " << REPEAT << " computations : Jacobi : " << fixed << timerJacobi.… in bench_svd()
|
/external/pdfium/third_party/libtiff/ |
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++) in horizontalAccumulateF() 168 REPEAT(stride, in horizontalAccumulateF() 231 REPEAT(stride, t0 = ToLinearF[*wp&mask] * SCALE12; in horizontalAccumulate12() 235 REPEAT(stride, in horizontalAccumulate12() 281 REPEAT(stride, *op = ToLinear16[*wp&mask]; wp++; op++) in horizontalAccumulate16() 284 REPEAT(stride, in horizontalAccumulate16() 328 REPEAT(stride, *op = *wp&mask; wp++; op++) in horizontalAccumulate11() 331 REPEAT(stride, in horizontalAccumulate11() 376 REPEAT(stride, *op = ToLinear8[*wp&mask]; wp++; op++) in horizontalAccumulate8() [all …]
|
/external/opencv3/3rdparty/libtiff/ |
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++) in horizontalAccumulateF() 168 REPEAT(stride, in horizontalAccumulateF() 231 REPEAT(stride, t0 = ToLinearF[*wp&mask] * SCALE12; in horizontalAccumulate12() 235 REPEAT(stride, in horizontalAccumulate12() 281 REPEAT(stride, *op = ToLinear16[*wp&mask]; wp++; op++) in horizontalAccumulate16() 284 REPEAT(stride, in horizontalAccumulate16() 328 REPEAT(stride, *op = *wp&mask; wp++; op++) in horizontalAccumulate11() 331 REPEAT(stride, in horizontalAccumulate11() 376 REPEAT(stride, *op = ToLinear8[*wp&mask]; wp++; op++) in horizontalAccumulate8() [all …]
|
/external/androidplot/Examples/DemoApp/src/com/androidplot/demos/ |
D | XYPlotWithBgImgActivity.java | 17 …er WHITE_SHADER = new LinearGradient(1, 1, 1, 1, Color.WHITE, Color.WHITE, Shader.TileMode.REPEAT); 117 Shader.TileMode.REPEAT, in onGraphStyleToggle() 118 Shader.TileMode.REPEAT); in onGraphStyleToggle()
|
/external/llvm/test/FileCheck/ |
D | validate-check-prefix.txt | 3 // RUN: not FileCheck -check-prefix=REPEAT -check-prefix=REPEAT -input-file %s %s 2>&1 | FileCheck …
|
/external/icu/icu4c/source/test/testdata/ |
D | WordBreakTest.txt | 31 ÷ 0001 ÷ 3031 ÷ # ÷ [0.2] <START OF HEADING> (Other) ÷ [999.0] VERTICAL KANA REPEAT MARK (Katakana… 32 … (Other) × [4.0] COMBINING DIAERESIS (Extend_FE) ÷ [999.0] VERTICAL KANA REPEAT MARK (Katakana) ÷ … 83 ÷ 000D ÷ 3031 ÷ # ÷ [0.2] <CARRIAGE RETURN (CR)> (CR) ÷ [3.1] VERTICAL KANA REPEAT MARK (Katakana)… 84 …R)> (CR) ÷ [3.1] COMBINING DIAERESIS (Extend_FE) ÷ [999.0] VERTICAL KANA REPEAT MARK (Katakana) ÷ … 135 ÷ 000A ÷ 3031 ÷ # ÷ [0.2] <LINE FEED (LF)> (LF) ÷ [3.1] VERTICAL KANA REPEAT MARK (Katakana) ÷ [0.… 136 …F)> (LF) ÷ [3.1] COMBINING DIAERESIS (Extend_FE) ÷ [999.0] VERTICAL KANA REPEAT MARK (Katakana) ÷ … 187 ÷ 000B ÷ 3031 ÷ # ÷ [0.2] <LINE TABULATION> (Newline) ÷ [3.1] VERTICAL KANA REPEAT MARK (Katakana)… 188 …Newline) ÷ [3.1] COMBINING DIAERESIS (Extend_FE) ÷ [999.0] VERTICAL KANA REPEAT MARK (Katakana) ÷ … 231 ÷ 3031 ÷ 0001 ÷ # ÷ [0.2] VERTICAL KANA REPEAT MARK (Katakana) ÷ [999.0] <START OF HEADING> (Other… 232 ÷ 3031 × 0308 ÷ 0001 ÷ # ÷ [0.2] VERTICAL KANA REPEAT MARK (Katakana) × [4.0] COMBINING DIAERESIS … [all …]
|
/external/robolectric/v1/src/test/java/com/xtremelabs/robolectric/shadows/ |
D | BitmapDrawableTest.java | 99 drawable.setTileModeXY(Shader.TileMode.REPEAT, Shader.TileMode.MIRROR); in shouldSetTileModeXY() 100 assertEquals(Shader.TileMode.REPEAT, drawable.getTileModeX()); in shouldSetTileModeXY()
|