| /external/eigen/bench/ |
| D | spmv.cpp | 11 #define SPMV_BENCH(CODE) BENCH(t,tries,repeats,CODE);
44 int repeats = 2; in main() local
67 repeats = atoi(argv[i]+1); in main()
80 … " x " << cols << " with " << nnzPerCol << " non zeros per column. (" << repeats << " repeats, and… in main()
100 std::cout << "Dense " << t.value()/repeats << "\t"; in main()
103 std::cout << t.value()/repeats << endl; in main()
110 std::cout << "Eigen " << t.value()/repeats << "\t"; in main()
113 std::cout << t.value()/repeats << endl; in main()
143 std::cout << "OSKI " << t.value()/repeats << "\t"; in main()
146 std::cout << t.value()/repeats << "\n"; in main()
[all …]
|
| D | benchCholesky.cpp | 41 int repeats = (REPEAT*1000)/(rows*rows); in benchLLT() local
57 for (int k=0; k<repeats; ++k) in benchLLT()
68 for (int k=0; k<repeats; ++k) in benchLLT()
81 << (timerNoSqrt.value() * REPEAT) / repeats << "s " in benchLLT()
82 << "(" << 1e-6 * cost*repeats/timerNoSqrt.value() << " MFLOPS)\t" in benchLLT()
83 << (timerSqrt.value() * REPEAT) / repeats << "s " in benchLLT()
84 << "(" << 1e-6 * cost*repeats/timerSqrt.value() << " MFLOPS)\n"; in benchLLT()
99 for (int k=0; k<repeats; ++k) in benchLLT()
109 << timerSqrt.value() * REPEAT / repeats << "s"; in benchLLT()
|
| D | bench_reverse.cpp | 24 int repeats = (REPEAT*1000)/size; in bench_reverse() local
36 for (int k=0; k<repeats; ++k) in bench_reverse()
51 << (timerB.value() * REPEAT) / repeats << "s " in bench_reverse()
52 << "(" << 1e-6 * size*repeats/timerB.value() << " MFLOPS)\t"; in bench_reverse()
|
| /external/toybox/toys/posix/ |
| D | uniq.c | 34 long repeats;
55 if (toys.optflags & (TT.repeats ? FLAG_u : FLAG_d)) return; in print_line()
56 if (toys.optflags & FLAG_c) fprintf(f, "%7lu ", TT.repeats + 1); in print_line()
97 TT.repeats++; in uniq_main()
101 TT.repeats = 0; in uniq_main()
|
| /external/skia/tools/ |
| D | PictureBenchmark.h | 33 void setRepeats(int repeats) { in setRepeats() argument
34 fRepeats = repeats; in setRepeats()
|
| /external/v8/src/ |
| D | serialize.h | 213 static int CodeForRepeats(int repeats) { in CodeForRepeats() argument
214 DCHECK(repeats >= 1 && repeats <= kMaxRepeats); in CodeForRepeats()
215 return 0x72 + repeats; in CodeForRepeats()
|
| D | serialize.cc | 1028 int repeats = source_->GetInt(); in ReadChunk() local
1031 for (int i = 0; i < repeats; i++) current[i] = object; in ReadChunk()
1032 current += repeats; in ReadChunk()
1043 int repeats = RepeatsForCode(data); in ReadChunk() local
1046 for (int i = 0; i < repeats; i++) current[i] = object; in ReadChunk()
1047 current += repeats; in ReadChunk()
|
| /external/skia/experimental/FileReaderApp/ |
| D | FileReaderWindow.mm | 29 repeats:YES];
|
| /external/guava/guava-tests/test/com/google/common/hash/ |
| D | BloomFilterTest.java | 204 for (int repeats = 0; repeats < 10000; repeats++) { in testOptimalSize()
|
| /external/skia/src/views/mac/ |
| D | SkEventNotifier.mm | 44 userInfo:nil repeats:NO];
|
| /external/skia/debugger/QT/ |
| D | SkDebuggerGUI.h | 344 int repeats);
|
| D | SkDebuggerGUI.cpp | 138 int repeats) { in run() argument
155 for (int i = 0; i < repeats; ++i) { in run()
|
| /external/valgrind/perf/ |
| D | vg_perf.in | 64 --reps=<n> number of repeats for each program [1]
|
| /external/sonivox/jet_tools/JetCreator/ |
| D | JetCreatorhlp.dat | 58 repeat = Sets the number of repeats for the segment.
|
| /external/toybox/generated/ |
| D | globals.h | 1151 long repeats; member
|
| /external/pcre/dist/ |
| D | HACKING | 236 The common repeats (*, +, ?), when applied to a single character, use the
254 Other repeats make use of these opcodes:
|
| D | ChangeLog | 1030 maximum number of forward references (including repeats) was limited by the
3148 repeats to use when timing. The default is 50000; this gives better
3497 specifying a regex that has nested indefinite repeats, for instance).
4387 saves time in cases of nested unlimited repeats that are never going to match.
4398 unlimited repeats, but isn't used for simple anchored patterns such as /^abc/.
5158 1. For parenthesized subpatterns with repeats whose minimum was zero, the
5370 curly-bracketed repeats.
5568 1. PCRE was failing to diagnose unlimited repeats of subpatterns that could
|
| /external/libvorbis/doc/ |
| D | 07-floor1.tex | 41 \item the induction step repeats, using a list of x values specified in
|
| /external/google-breakpad/src/client/mac/sender/ |
| D | crash_report_sender.m | 366 repeats:YES];
|
| /external/pcre/dist/doc/ |
| D | pcregrep.txt | 457 uses nested unlimited repeats. Internally, PCRE uses a func-
704 nested indefinite repeats, for example: (a+)*\d when matched against a
|
| D | pcre.txt | 123 Nested unlimited repeats in a pattern are a common example. PCRE pro-
1463 ter repeats at the end of a pattern (as well as internally). For exam-
3132 ited repeats.
4198 character repeats at the end of a pattern (as well as internally). For
4858 a pattern with nested unlimited repeats) and to avoid running out of
6363 to be re-evaluated to see if a different number of repeats allows the
7001 nested unlimited repeats, and so the use of a possessive quantifier for
7010 so many different ways the + and * repeats can carve up the subject,
9437 Beware of patterns that contain nested indefinite repeats. These can
9446 repeats can match different numbers of times.) When the remainder of
|
| /external/dnsmasq/ |
| D | FAQ | 219 starts and repeats the DHCP process, but it it does send a
|
| /external/owasp/sanitizer/lib/htmlparser-1.3/doc/ |
| D | tokenization.txt | 19 character), or repeats the same state (to consume the next character).
|
| /external/llvm/lib/Target/ |
| D | README.txt | 1355 This pattern repeats several times, basically doing:
|
| /external/elfutils/src/libdwfl/ |
| D | ChangeLog | 1993 repeats the first thing dwfl_standard_find_debuginfo will try.
|