| /external/icu4c/tools/ctestfw/unicode/ |
| uperf.h | 88 * e.g: Number of breaks / iterations for break iterator
164 int32_t iterations; member in class:UPerfTest
|
| /frameworks/base/test-runner/src/android/test/ |
| TestPrinter.java | 61 long itemTimeNS, int iterations,
64 + iterations + " times)");
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/pkcs/ |
| MacData.java | 86 * iterations INTEGER DEFAULT 1
|
| /external/eigen/Eigen/src/Core/arch/Default/ |
| Settings.h | 21 * it does not correspond to the number of iterations or the number of instructions
|
| /external/netperf/ |
| netcpu_kstat.c | 249 calibrate_idle_rate(int iterations, int interval)
280 if (iterations > MAXTIMES) {
281 iterations = MAXTIMES;
286 for(i = 0; i < iterations; i++) {
|
| netcpu_perfstat.c | 116 calibrate_idle_rate(int iterations, int interval)
149 if (iterations > MAXTIMES) {
150 iterations = MAXTIMES;
165 for(i = 0; i < iterations; i++) {
|
| netcpu_sysctl.c | 94 calibrate_idle_rate(int iterations, int interval)
|
| /external/webrtc/src/modules/audio_coding/codecs/isac/main/source/ |
| arith_routines_logist.c | 121 // increment only once per 4 iterations for SWB-16kHz or WB
122 // increment only once per 2 iterations for SWB-12kHz
266 // increment only once per 4 iterations for SWB-16kHz or WB
267 // increment only once per 2 iterations for SWB-12kHz
|
| /external/skia/legacy/src/core/ |
| SkCubicClipper.cpp | 28 #ifdef NEWTON_RAPHSON // Quadratic convergence, typically <= 3 iterations.
38 // Newton's iterations.
70 #else // BISECTION // Linear convergence, typically 16 iterations.
|
| /external/skia/src/core/ |
| SkCubicClipper.cpp | 30 #ifdef NEWTON_RAPHSON // Quadratic convergence, typically <= 3 iterations.
40 // Newton's iterations.
72 #else // BISECTION // Linear convergence, typically 16 iterations.
|
| /external/v8/test/mjsunit/ |
| sparse-array-reverse.js | 71 for (var iterations = 0; iterations < 20; iterations++) {
|
| /external/webkit/Tools/iExploder/iexploder-1.7.2/src/ |
| scanner.rb | 148 puts "Seq avg iterations=#{avg(seq_iterations).to_i} length=#{avg(seq_size).to_i}"
149 puts "combine avg iterations=#{avg(combine_iterations).to_i} length=#{avg(combine_size).to_i}"
152 puts "Diff iterations: #{diff_iter}%"
|
| /frameworks/base/core/tests/utillib/src/android/test/ |
| BandwidthTestCase.java | 135 Bundle iterations = new Bundle(); local
136 iterations.putInt("currentiterations", runCount);
137 getInstrumentation().sendStatus(2, iterations);
|
| /frameworks/base/tests/DumpRenderTree/assets/ |
| run_page_cycler.py | 9 run_page_cycler.py "file:///sdcard/webkit/page_cycler/moz/start.html\?auto=1\&iterations=10"
35 print "need a URL, e.g. file:///sdcard/webkit/page_cycler/moz/start.html\?auto=1\&iterations=10"
159 help="(for network mode) specify how many iterations"
|
| /frameworks/native/opengl/tests/tritex/ |
| tritex.cpp | 2 // ITERATIONS. Should draw a checkerboard on the screen after
26 #define ITERATIONS 50
113 render(argc==2 ? atoi(argv[1]) : ITERATIONS);
|
| /external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/ |
| KeyFactory2Test.java | 48 int sleepTime, iterations; field in class:KeyFactory2Test.KeepAlive
50 public KeepAlive(int sleepTime, int iterations) {
52 this.iterations = iterations;
59 for (int i = 0; i < iterations; i++) {
|
| /libcore/luni/src/test/java/org/apache/harmony/security/tests/java/security/ |
| KeyFactory2Test.java | 51 int sleepTime, iterations; field in class:KeyFactory2Test.KeepAlive
53 public KeepAlive(int sleepTime, int iterations) {
55 this.iterations = iterations;
62 for (int i = 0; i < iterations; i++) {
|
| /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| params.def | 118 /* Limit of iterations of early inliner. This basically bounds number of
122 "max-early-inliner-iterations",
370 /* The maximum number of iterations of a loop the brute force algorithm
371 for analysis of # of iterations of the loop tries to evaluate. */
373 "max-iterations-to-track",
374 "Bound on the number of iterations the brute force # of iterations analysis algorithm evaluates",
376 /* A cutoff to avoid costly computations of the number of iterations in
379 "max-iterations-computation-cost",
380 "Bound on the cost of an expression to compute the number of iterations",
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| params.def | 118 /* Limit of iterations of early inliner. This basically bounds number of
122 "max-early-inliner-iterations",
370 /* The maximum number of iterations of a loop the brute force algorithm
371 for analysis of # of iterations of the loop tries to evaluate. */
373 "max-iterations-to-track",
374 "Bound on the number of iterations the brute force # of iterations analysis algorithm evaluates",
376 /* A cutoff to avoid costly computations of the number of iterations in
379 "max-iterations-computation-cost",
380 "Bound on the cost of an expression to compute the number of iterations",
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| params.def | 118 /* Limit of iterations of early inliner. This basically bounds number of
122 "max-early-inliner-iterations",
370 /* The maximum number of iterations of a loop the brute force algorithm
371 for analysis of # of iterations of the loop tries to evaluate. */
373 "max-iterations-to-track",
374 "Bound on the number of iterations the brute force # of iterations analysis algorithm evaluates",
376 /* A cutoff to avoid costly computations of the number of iterations in
379 "max-iterations-computation-cost",
380 "Bound on the cost of an expression to compute the number of iterations",
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| params.def | 118 /* Limit of iterations of early inliner. This basically bounds number of
122 "max-early-inliner-iterations",
370 /* The maximum number of iterations of a loop the brute force algorithm
371 for analysis of # of iterations of the loop tries to evaluate. */
373 "max-iterations-to-track",
374 "Bound on the number of iterations the brute force # of iterations analysis algorithm evaluates",
376 /* A cutoff to avoid costly computations of the number of iterations in
379 "max-iterations-computation-cost",
380 "Bound on the cost of an expression to compute the number of iterations",
[all...] |
| /external/icu4c/test/perf/howExpensiveIs/ |
| howExpensiveIs.cpp | 27 #ifndef ITERATIONS
28 #define ITERATIONS 5
59 fprintf(stderr, "** Standard sieve time: %.9fs +/- %.9fs (%d iterations)\n", s,m, (int)U_LOTS_OF_TIMES);
150 * @return number of iterations
168 double times[ITERATIONS];
170 for(int i=0;i<ITERATIONS;i++) {
173 fprintf(stderr, "trial: %d/%d = %.9fs\n", i, ITERATIONS,times[i]);
177 uint32_t iterations = ITERATIONS; local
178 *subTime = uprv_getMeanTime(times,&iterations,marginOfError)
[all...] |
| /external/eigen/Eigen/src/Eigenvalues/ |
| ComplexSchur.h | 174 * to triangular form by performing QR iterations with a single
176 * on the number of iterations; as a rough guide, it may be taken
177 * on the number of iterations; as a rough guide, it may be taken
196 /** \brief Maximum number of iterations.
198 * Maximum number of iterations allowed for an eigenvalue to converge.
338 Index iter = 0; // number of iterations we are working on the (iu,iu) element
353 // if we spent too many iterations on the current element, we give up
|
| /external/llvm/lib/CodeGen/ |
| ShrinkWrapping.cpp | 73 None, BasicInfo, Iterations, Details
82 clEnumVal(Iterations, "print SR sets for each iteration"),
130 // Initialize shrink wrapping DFA sets, called before iterations.
282 unsigned iterations = 0; local
285 ++iterations;
306 << "iterations = " << iterations << "\n"
604 DEBUG(if (ShrinkWrapDebugging >= Iterations)
620 DEBUG(if (ShrinkWrapDebugging >= Iterations)
658 DEBUG(if (ShrinkWrapDebugging >= Iterations)
801 unsigned iterations = 0; local
[all...] |
| /external/ceres-solver/internal/ceres/ |
| trust_region_minimizer.cc | 204 summary->iterations.push_back(iteration_summary);
227 VLOG(1) << "Terminating: Maximum number of iterations reached.";
240 iteration_summary = summary->iterations.back();
241 iteration_summary.iteration = summary->iterations.back().iteration + 1;
314 summary->iterations.back().gradient_max_norm;
536 summary->iterations.push_back(iteration_summary);
|
