| /frameworks/base/core/tests/bluetoothtests/src/android/bluetooth/ |
| BluetoothStressTest.java | 68 mTestUtils.writeOutput("enable iteration " + (i + 1) + " of " + iterations);
89 mTestUtils.writeOutput("discoverable iteration " + (i + 1) + " of " + iterations);
112 mTestUtils.writeOutput("scan iteration " + (i + 1) + " of " + iterations);
134 mTestUtils.writeOutput("testEnablePan iteration " + (i + 1) + " of "
162 mTestUtils.writeOutput("pair iteration " + (i + 1) + " of " + iterations);
188 mTestUtils.writeOutput("acceptPair iteration " + (i + 1) + " of " + iterations);
218 mTestUtils.writeOutput("connectA2dp iteration " + (i + 1) + " of " + iterations);
251 mTestUtils.writeOutput("connectHeadset iteration " + (i + 1) + " of " + iterations);
284 mTestUtils.writeOutput("connectInput iteration " + (i + 1) + " of " + iterations);
316 mTestUtils.writeOutput("connectPan iteration " + (i + 1) + " of " + iterations)
[all...] |
| /art/compiler/dex/ |
| dataflow_iterator.h | 28 * The order itself will not change during the iteration. However, for some uses,
29 * auxiliary data associated with the basic blocks may be changed during the iteration,
32 * To support this usage, we have is_iterative_. If false, the iteration is a one-shot
38 * the iteration order or short-curcuit the current pass - it simply tells the iterator
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
| PKCS5S2ParametersGenerator.java | 53 throw new IllegalArgumentException("iteration count must be at least 1.");
108 * Generate a key parameter derived from the password, salt, and iteration
126 * the password, salt, and iteration count we are currently initialised
147 * salt, and iteration count we are currently initialised with.
|
| /external/chromium/chrome/browser/resources/chromeos/ |
| choose_mobile_network.css | 17 -webkit-animation-iteration-count: infinite;
|
| /external/chromium_org/chrome/browser/resources/chromeos/ |
| choose_mobile_network.css | 12 -webkit-animation-iteration-count: infinite;
|
| /external/chromium_org/third_party/angle/src/compiler/ |
| ForLoopUnroll.h | 27 // Update the info.currentValue for the next loop iteration.
|
| /external/chromium_org/third_party/skia/src/effects/gradients/ |
| SkClampRange.h | 16 * Iteration fixed fx by dx, clamping as you go to [0..0xFFFF], this class
|
| /external/chromium_org/v8/tools/ |
| fuzz-harness.sh | 74 iteration = 0
76 + while iteration < 100:
77 iteration += 1
78 logfilename = "w%d" % iteration
|
| /external/llvm/test/Transforms/LoopDeletion/ |
| multiple-exit-conditions.ll | 3 ; ScalarEvolution can prove the loop iteration is finite, even though
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| dont_reverse.ll | 4 ; Don't reverse the iteration if the rhs of the compare is defined
|
| quadradic-exit-value.ll | 3 ; The value of %r is dependent on a polynomial iteration expression.
|
| /external/skia/src/effects/gradients/ |
| SkClampRange.h | 16 * Iteration fixed fx by dx, clamping as you go to [0..0xFFFF], this class
|
| /libcore/luni/src/main/java/java/text/ |
| CharacterIterator.java | 21 * An interface for the bidirectional iteration over a group of characters. The
22 * iteration starts at the begin index in the group of characters and continues
61 * @return the index of the first character of the iteration.
68 * @return the index one past the last character of the iteration.
|
| /libcore/luni/src/main/java/java/util/ |
| ListIterator.java | 60 * Returns the next object in the iteration.
70 * Returns the index of the next object in the iteration.
81 * Returns the previous object in the iteration.
91 * Returns the index of the previous object in the iteration.
|
| /external/chromium_org/base/test/launcher/ |
| test_launcher.h | 44 // Called at the start of each test iteration.
116 // Runs all tests in current iteration. Uses callbacks to communicate success.
154 // Number of tests started in this iteration.
157 // Number of tests finished in this iteration.
160 // Number of tests successfully finished in this iteration.
167 // Number of retries in this iteration.
170 // Maximum number of retries per iteration.
173 // Tests to retry in this iteration.
|
| /external/chromium_org/native_client_sdk/src/examples/api/core/ |
| index.html | 21 iteration will send a message to the NaCl module containing the number of
28 average iteration including other JS overhead (Total). </p>
|
| /external/dropbear/libtommath/ |
| bn_mp_div_2.c | 44 /* get the carry for the next iteration */
50 /* forward carry to next iteration */
|
| /external/oprofile/daemon/liblegacy/ |
| opd_24_stats.c | 45 printf("Average depth of iteration through mapping array: %f\n",
50 printf("Average depth of iteration through image hash array: %f\n",
|
| /external/chromium_org/cc/animation/ |
| animation.cc | 188 // If less than an iteration duration, just return trimmed.
192 // If greater than or equal to the total duration, return iteration duration.
199 // We need to know the current iteration if we're alternating.
200 int iteration = static_cast<int>(trimmed / curve_->Duration()); local
206 // If we're alternating and on an odd iteration, reverse the direction.
207 if (alternates_direction_ && iteration % 2 == 1)
|
| /external/xmp_toolkit/XMPCore/src/com/adobe/xmp/ |
| XMPIterator.java | 16 * Interface for the <code>XMPMeta</code> iteration services.
20 * The iteration over the schema and properties within an XMP object is very
35 * defines a starting point for the iteration and options that control how it
36 * proceeds. By default the iteration starts at the root and visits all nodes
47 * The options to control the iteration are:
58 * <li>INCLUDE_ALIASES - Adds known alias properties to the properties in the iteration.
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/pulse/ |
| mainloop.h | 47 * \section iter_sec Iteration
49 * The main loop is designed around the concept of iterations. Each iteration
59 * iteration, one at a time, using pa_mainloop_iterate(), or let the library
87 /** Prepare for a single iteration of the main loop. Returns a negative value
102 /** Run a single iteration of the main loop. This is a convenience function
107 to. On success returns the number of sources dispatched in this iteration. */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/pulse/ |
| mainloop.h | 47 * \section iter_sec Iteration
49 * The main loop is designed around the concept of iterations. Each iteration
59 * iteration, one at a time, using pa_mainloop_iterate(), or let the library
87 /** Prepare for a single iteration of the main loop. Returns a negative value
102 /** Run a single iteration of the main loop. This is a convenience function
107 to. On success returns the number of sources dispatched in this iteration. */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/pulse/ |
| mainloop.h | 47 * \section iter_sec Iteration
49 * The main loop is designed around the concept of iterations. Each iteration
59 * iteration, one at a time, using pa_mainloop_iterate(), or let the library
87 /** Prepare for a single iteration of the main loop. Returns a negative value
102 /** Run a single iteration of the main loop. This is a convenience function
107 to. On success returns the number of sources dispatched in this iteration. */
|
| /external/ceres-solver/internal/ceres/ |
| line_search_minimizer.cc | 113 iteration_summary.iteration = 0;
208 if (iteration_summary.iteration >= options.max_num_iterations) {
223 iteration_summary.iteration = summary->iterations.back().iteration + 1;
228 if (iteration_summary.iteration == 1) {
252 // Restart line search direction with gradient descent on first iteration
261 << ", failed to produce a valid new direction at iteration: "
262 << iteration_summary.iteration << ". Restarting, number of "
279 // iteration.
281 (iteration_summary.iteration == 1 || !line_search_status
[all...] |
| /external/chromium_org/third_party/skia/src/opts/ |
| SkBitmapProcState_arm_neon.cpp | 214 // Output four pixels per iteration (16 bytes).
220 // Convolve with one filter coefficient per iteration.
399 // Output one pixel each iteration, calculating all channels (RGBA) together.
405 // four pixels in a column per iteration.
413 // We will load and accumulate with four coefficients per iteration.
428 #define ITERATION(src, accum) \
441 ITERATION(srcData[0] + start, accum0);
442 ITERATION(srcData[1] + start, accum1);
443 ITERATION(srcData[2] + start, accum2);
444 ITERATION(srcData[3] + start, accum3)
[all...] |
