/external/webrtc/src/modules/audio_coding/codecs/isac/fix/source/ |
arith_routins.h | 139 * iterations.
|
/frameworks/base/core/java/android/os/ |
PerformanceCollector.java | 145 public static final String METRIC_KEY_ITERATIONS = "iterations"; 407 * @return Runtime metrics stored in a bundle, including all iterations 408 * between calls to startTiming and stopTiming. List of iterations 409 * is keyed by {@link #METRIC_KEY_ITERATIONS iterations}.
|
/frameworks/base/core/tests/coretests/src/android/os/ |
PerformanceCollectorTest.java | 467 ArrayList<Parcelable> iterations = timing.getParcelableArrayList( local 469 assertNotNull(iterations); 470 assertEquals(labels.size(), iterations.size()); 472 Bundle iteration = (Bundle)iterations.get(i);
|
/frameworks/testing/uiautomator_test_libraries/src/com/android/uiautomator/platform/ |
JankTestBase.java | 66 // File that hold test status, e.g successful test iterations 354 * Process data from all test iterations, and save to disk 360 mStatusWriter.write(String.format("%s: %d success runs out of %d iterations\n", 368 log(String.format("In %s, # of successful test runs out of %s iterations: %d ",
|
/libcore/benchmarks/src/benchmarks/regression/ |
URLConnectionBenchmark.java | 50 // keep serving the same response for all iterations
|
/external/blktrace/doc/ |
btreplay.8 | 117 \-\-iterations=<\fInum\fR> 119 Set number of iterations to run.
|
/external/ceres-solver/internal/ceres/ |
solver.cc | 111 internal::StringAppendF(&report, "Iterations: %d", 220 internal::StringAppendF(&report, "\nNumber of iterations:\n");
|
/external/chromium/base/ |
time_win_unittest.cc | 78 // It takes a lot of iterations to reproduce the bug! 229 // the number of iterations we do. However, if the QPC is disabled, this
|
/external/clang/include/clang/Analysis/Analyses/ |
ThreadSafety.h | 55 /// loop iterations. 94 /// 2, or a mutex is only held at the start of some loop iterations,
|
/external/icu4c/tools/ctestfw/unicode/ |
utimer.h | 255 * taken and number of iterations of the loop 257 * @param loopCount output param to recieve the number of iterations
|
/external/llvm/docs/HistoricalNotes/ |
2003-06-25-Reoptimizer1.txt | 52 number of iterations and the number of paths. We only run this 61 iterations.
|
/external/openfst/src/test/ |
weight-tester.h | 39 void Test(int iterations, bool test_division = true) { 40 for (int i = 0; i < iterations; ++i) {
|
/system/core/toolbox/ |
top.c | 88 static int max_procs, delay, iterations, threads; variable 118 iterations = -1; 136 iterations = atoi(argv[++i]); 183 while ((iterations == -1) || (iterations-- > 0)) { 563 fprintf(stderr, "Usage: %s [ -m max_procs ] [ -n iterations ] [ -d delay ] [ -s sort_column ] [ -t ] [ -h ]\n"
|
/system/extras/tests/sdcard/ |
sdcard_perf_test.cpp | 65 // get a meaningful average/min/max (--iterations flag) 74 // adb shell /system/bin/sdcard_perf_test --test=read --size=1000 --chunk-size=100 --procnb=1 --iterations=10 --dump > /tmp/data.txt 75 // adb shell /system/bin/sdcard_perf_test --test=write --size=1000 --chunk-size=100 --procnb=1 --iterations=100 --dump > /tmp/data.txt 114 {"iterations", required_argument, 0, 'i'}, 136 " -i --iterations: Number of time a process should carry its task.\n" 233 printf("# Iterations: %d\n", testCase->iter());
|
/external/llvm/lib/Transforms/Utils/ |
LoopUnroll.cpp | 126 /// iterations via an early branch, but control may not exit the loop from the 127 /// LatchBlock's terminator prior to TripCount iterations. 182 // Effectively "DCE" unrolled iterations that are beyond the tripcount 350 // Now that all the basic blocks for the unrolled iterations are in place, 373 // unconditional branch for some iterations.
|
/external/netperf/ |
netcpu_looper.c | 480 /* Loop a number of iterations, sleeping interval seconds each and */ 485 calibrate_idle_rate (int iterations, int interval) 509 if (iterations > MAXTIMES) { 510 iterations = MAXTIMES; 515 for(i = 0; i < iterations; i++) {
|
/external/smack/src/org/xbill/DNS/ |
Lookup.java | 43 private int iterations; field in class:Lookup 184 iterations = 0; 392 iterations++; 393 if (iterations >= 6 || name.equals(oldname)) { 425 if (iterations > 0) {
|
/external/llvm/docs/ |
Vectorizers.rst | 14 to operate on multiple consecutive loop iterations. 72 the vectorizer has to execute the last few iterations as scalar code. Keeping 107 In this example the ``sum`` variable is used by consecutive iterations of
|
/sdk/eclipse/plugins/com.android.ide.eclipse.tests/src/com/android/ide/eclipse/adt/internal/editors/layout/refactoring/ |
AdtProjectTest.java | 118 int iterations = 0; local 120 if (iterations == 100) { 131 iterations++;
|
/external/aac/libAACenc/src/ |
qc_data.h | 151 INT maxIterations; /* Maximum number of allowed iterations before FDKaacEnc_crashRecovery() is applied. */ 258 INT maxIterations; /* Maximum number of allowed iterations before FDKaacEnc_crashRecovery() is applied. */
|
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
dfa.rb | 226 | The prediction loop has exceeded a maximum limit of 50000 iterations 290 | The prediction loop has exceeded a maximum limit of 50000 iterations
|
/external/ceres-solver/docs/ |
powell.tex | 96 Ceres Solver Report: Iterations: 12, Initial cost: 1.075000e+02, \ 100 It is easy to see that the optimal solution to this problem is at $x_1=0, x_2=0, x_3=0, x_4=0$ with an objective function value of $0$. In 10 iterations, Ceres finds a solution with an objective function value of $4\times 10^{-12}$.
|
/external/ceres-solver/include/ceres/ |
types.h | 138 // Solver is stuck and further iterations will not result in any 203 // The solver ran for maximum number of iterations specified by the
|
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
lmpar.h | 124 /* is zero or the number of iterations has reached 10. */ 261 /* is zero or the number of iterations has reached 10. */
|
/external/opencv/cv/src/ |
cvcamshift.cpp | 55 // itersUsed - Returns number of iterations CAMSHIFT took to converge 159 // itersUsed - Returns number of iterations CAMSHIFT took to converge
|