| /external/eigen/bench/ |
| 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 << endl
[all...] |
| 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
|
| 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/ |
| PictureBenchmark.h | 34 void setRepeats(int repeats) {
35 fRepeats = repeats;
|
| /external/pixman/test/ |
| 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);
|
| 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/ |
| BloomFilterTest.java | 52 for (int repeats = 0; repeats < 10000; repeats++) {
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| fuzz_malloc.test | 29 set ::REPEATS 20
31 set ::REPEATS 100
33 set ::REPEATS 40
41 # -repeats
44 set ::fuzzyopts(-repeats) $::REPEATS
55 for {set ii 0} {$ii < $::fuzzyopts(-repeats)} {incr ii} {
|
| 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/ |
| extensions_activity_monitor_unittest.cc | 43 BookmarkAPIEventTask(FunctionType* t, Extension* e, size_t repeats,
45 extension_(e), function_(t), repeats_(repeats), done_(done) {}
70 T* bookmarks_function, size_t repeats) {
82 repeats, &done_event));
|
| /external/chromium_org/third_party/libjingle/source/talk/base/ |
| maccocoasocketserver.mm | 94 repeats:NO];
|
| /external/chromium_org/third_party/WebKit/Tools/TestResultServer/handlers/ |
| buildershandler.py | 192 logging.warning('No buildbot data in memcache. If this message repeats, something is probably wrong with memcache.')
|
| /external/chromium_org/v8/src/ |
| serialize.h | 276 static int CodeForRepeats(int repeats) {
277 ASSERT(repeats >= 1 && repeats <= kMaxRepeats);
278 return 0x72 + repeats;
|
| serialize.cc | 1137 int repeats = source_->GetInt(); local
1152 int repeats = RepeatsForCode(data); local
[all...] |
| /external/pixman/demos/ |
| 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/ |
| serialize.h | 268 static int CodeForRepeats(int repeats) {
269 ASSERT(repeats >= 1 && repeats <= kMaxRepeats);
270 return 0x73 + repeats;
|
| serialize.cc | 960 int repeats = source_->GetInt(); local
974 int repeats = RepeatsForCode(data); local
[all...] |
| /external/chromium_org/chrome/browser/sync/glue/ |
| extensions_activity_monitor_unittest.cc | 51 const scoped_refptr<Extension>& extension, int repeats) {
54 for (int i = 0; i < repeats; i++) {
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_bigmem.py | 218 repeats = size // len(chars) + 2
219 s = chars * repeats
227 repeats = size // len(whitespace) + 2
228 s = whitespace * repeats
246 repeats = size // len(chars) + 2
247 s = chars * repeats
422 repeats = size // sublen + 2
423 s = SUBSTR * repeats
425 self.assertEqual(len(s), sublen * repeats)
442 repeats = size // sublen +
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_bigmem.py | 218 repeats = size // len(chars) + 2
219 s = chars * repeats
227 repeats = size // len(whitespace) + 2
228 s = whitespace * repeats
246 repeats = size // len(chars) + 2
247 s = chars * repeats
422 repeats = size // sublen + 2
423 s = SUBSTR * repeats
425 self.assertEqual(len(s), sublen * repeats)
442 repeats = size // sublen +
[all...] |
| /external/valgrind/main/perf/ |
| vg_perf.in | 59 --reps=<n> number of repeats for each program [1]
|
| /external/libvorbis/doc/ |
| 07-floor1.tex | 41 \item the induction step repeats, using a list of x values specified in
|
| /frameworks/base/services/java/com/android/server/wm/ |
| WindowManagerService.java | 8969 int repeats = 0; local
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/pydoc_data/ |
| topics.py | [all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/pydoc_data/ |
| topics.py | [all...] |
