/external/eigen/bench/ |
H A D | spmv.cpp | 11 #define SPMV_BENCH(CODE) BENCH(t,tries,repeats,CODE); 44 int repeats = 2; local 67 repeats = atoi(argv[i]+1); 76 std::cout << argv[0] << " r<nb rows> c<nb columns> n<non zeros per column> t<nb tries> p<nb repeats>\n"; 80 std::cout << "SpMV " << rows << " x " << cols << " with " << nnzPerCol << " non zeros per column. (" << repeats << " repeats, and " << tries << " tries)\n\n"; 100 std::cout << "Dense " << t.value()/repeats << "\t"; 103 std::cout << t.value()/repeats << endl; 110 std::cout << "Eigen " << t.value()/repeats << "\t"; 113 std::cout << t.value()/repeats << end [all...] |
H A D | benchCholesky.cpp | 41 int repeats = (REPEAT*1000)/(rows*rows); local 57 for (int k=0; k<repeats; ++k) 68 for (int k=0; k<repeats; ++k) 81 << (timerNoSqrt.value() * REPEAT) / repeats << "s " 82 << "(" << 1e-6 * cost*repeats/timerNoSqrt.value() << " MFLOPS)\t" 83 << (timerSqrt.value() * REPEAT) / repeats << "s " 84 << "(" << 1e-6 * cost*repeats/timerSqrt.value() << " MFLOPS)\n"; 99 for (int k=0; k<repeats; ++k) 109 << timerSqrt.value() * REPEAT / repeats << "s"; local
|
H A D | bench_reverse.cpp | 24 int repeats = (REPEAT*1000)/size; local 36 for (int k=0; k<repeats; ++k) 51 << (timerB.value() * REPEAT) / repeats << "s " 52 << "(" << 1e-6 * size*repeats/timerB.value() << " MFLOPS)\t";
|
/external/skia/tools/ |
H A D | PictureBenchmark.h | 34 void setRepeats(int repeats) { argument 35 fRepeats = repeats;
|
/external/pixman/test/ |
H A D | scaling-crash-test.c | 123 static const repeat_info_t repeats[] = variable 140 for (j = 0; j < ARRAY_LENGTH (repeats); ++j) 148 repeats[j].value) != 0) 151 filters[i].name, repeats[j].name); 162 repeats[j].value) != 0) 165 filters[i].name, repeats[j].name);
|
H A D | stress-test.c | 390 static pixman_repeat_t repeats[] = variable 412 repeat = repeats[prng_rand_n (ARRAY_LENGTH (repeats))];
|
/external/guava/guava-tests/test/com/google/common/hash/ |
H A D | BloomFilterTest.java | 52 for (int repeats = 0; repeats < 10000; repeats++) {
|
/external/chromium_org/third_party/sqlite/src/test/ |
H A D | fuzz_malloc.test | 41 # -repeats 44 set ::fuzzyopts(-repeats) $::REPEATS 55 for {set ii 0} {$ii < $::fuzzyopts(-repeats)} {incr ii} {
|
H A D | fuzz_common.tcl | 355 # -repeats 359 set ::fuzzyopts(-repeats) $::REPEATS 367 for {set ii 0} {$ii < $::fuzzyopts(-repeats)} {incr ii} {
|
/external/chromium/chrome/browser/sync/util/ |
H A D | extensions_activity_monitor_unittest.cc | 43 BookmarkAPIEventTask(FunctionType* t, Extension* e, size_t repeats, argument 45 extension_(e), function_(t), repeats_(repeats), done_(done) {} 70 T* bookmarks_function, size_t repeats) { 82 repeats, &done_event)); 69 NewEvent(const FilePath::StringType& extension_path, T* bookmarks_function, size_t repeats) argument
|
/external/chromium_org/third_party/libjingle/source/talk/base/ |
H A D | maccocoasocketserver.mm | 94 repeats:NO];
|
/external/libvpx/libvpx/examples/includes/geshi/geshi/ |
H A D | java.php | 32 * and eliminate repeats
|
/external/pixman/demos/ |
H A D | scale.c | 122 static const named_int_t repeats[] = variable 246 app->original, get_value (app, repeats, "repeat_combo_box")); 391 app, "repeat_combo_box", G_N_ELEMENTS (repeats), repeats);
|
/external/v8/src/ |
H A D | serialize.h | 268 static int CodeForRepeats(int repeats) { 269 ASSERT(repeats >= 1 && repeats <= kMaxRepeats); 270 return 0x73 + repeats;
|
H A D | serialize.cc | 960 int repeats = source_->GetInt(); local 963 for (int i = 0; i < repeats; i++) current[i] = object; 964 current += repeats; 974 int repeats = RepeatsForCode(data); local 977 for (int i = 0; i < repeats; i++) current[i] = object; 978 current += repeats;
|
/external/chromium_org/chrome/browser/sync/glue/ |
H A D | extensions_activity_monitor_unittest.cc | 51 const scoped_refptr<Extension>& extension, int repeats) { 54 for (int i = 0; i < repeats; i++) { 50 FireBookmarksApiEvent( const scoped_refptr<Extension>& extension, int repeats) argument
|
/external/chromium_org/v8/src/ |
H A D | serialize.h | 276 static int CodeForRepeats(int repeats) { 277 ASSERT(repeats >= 1 && repeats <= kMaxRepeats); 278 return 0x72 + repeats;
|
H A D | serialize.cc | 1137 int repeats = source_->GetInt(); local 1140 for (int i = 0; i < repeats; i++) current[i] = object; 1141 current += repeats; 1152 int repeats = RepeatsForCode(data); local 1155 for (int i = 0; i < repeats; i++) current[i] = object; 1156 current += repeats;
|
/external/valgrind/main/perf/ |
H A D | vg_perf.in | 59 --reps=<n> number of repeats for each program [1]
|
/external/libvorbis/doc/ |
H A D | 07-floor1.tex | 41 \item the induction step repeats, using a list of x values specified in
|