| /external/sonivox/arm-hybrid-22k/lib_src/ |
| eas_fmengine.h | 59 /* sine table is always a power of 2 - saves cycles in inner loop */
74 EAS_I16 op1Out; /* op1 output for feedback loop */
75 EAS_I16 op3Out; /* op3 output for feedback loop */
|
| /external/speex/libspeex/ |
| cb_search_bfin.h | 53 "LOOP outter%= LC0;\n\t"
59 "LOOP inner%= LC1 = P0;\n\t"
99 "LOOP tupdate%= LC0 = %3;\n\t"
|
| vq_bfin.h | 51 "LOOP entries_loop%= LC0;\n\t"
57 "LOOP vq_loop%= LC1 = %5;\n\t"
85 "LOOP vq_loop%= LC0 = %2;\n\t"
|
| /external/webkit/JavaScriptCore/wtf/ |
| StringHashFunctions.h | 40 // Main loop
80 // Main loop
118 // Main loop
|
| /frameworks/base/docs/html/guide/practices/design/ |
| performance.jd | 16 <li><a href="#foreach">Use Enhanced For Loop Syntax</a></li>
92 <p>If you allocate objects in a user interface loop, you will force a periodic
209 <h2>Use Enhanced For Loop Syntax</h2>
211 <p>The enhanced for loop (also sometimes known as "for-each" loop) can be used
214 to hasNext() and next(). With an ArrayList, a hand-written counted loop is
216 for loop syntax will be exactly equivalent to explicit iterator usage.</p>
252 loop.</p>
260 It uses the enhanced for loop syntax introduced in version 1.5 of the Java
263 <p>To summarize: use the enhanced for loop by default, but consider
[all...] |
| /system/media/opensles/libopensles/ |
| android_SfPlayer.h | 113 void loop(bool loop);
147 kWhatLoop = 'loop',
|
| /external/zlib/examples/ |
| zlib_how.html | 147 With the pleasantries out of the way, now we can get down to business. The outer <tt>do</tt>-loop
148 reads all of the input file and exits at the bottom of the loop once end-of-file is reached.
149 This loop contains the only call of <tt>deflate()</tt>. So we must make sure that all of the
151 before we fall out of the loop at the bottom.
183 The inner <tt>do</tt>-loop passes our chunk of input data to <tt>deflate()</tt>, and then
203 Hence the inner loop to make sure that
261 The inner <tt>do</tt>-loop is repeated until the last <tt>deflate()</tt> call fails to fill the
264 loop and reuse the input buffer.
276 and so we drop out of the inner loop to provide more input to <tt>deflate()</tt>.
284 instead of the single inner loop we have here. The first loop would cal
[all...] |
| /external/chromium/base/ |
| directory_watcher_unittest.cc | 29 // Implementation of DirectoryWatcher on Mac requires UI loop.
55 // Make sure there are no tasks in the loop.
118 // The number of notified test delegates after which we quit the message loop.
264 Deleter(DirectoryWatcher* watcher, MessageLoop* loop)
266 loop_(loop) {
|
| message_pump_win.cc | 110 // To provide sub-10ms timers, we process timers directly from our run loop.
111 // For the common case, timers will be processed there as the run loop does
116 // run loop itself.
142 // WM_PAINT messages. Don't provide an infinite loop, but do enough peeking
162 DHISTOGRAM_COUNTS("Loop.PumpOutPendingPaintMessages Peeks", peek_count);
183 // IF this was just a simple PeekMessage() loop (servicing all possible work
272 // causing us to enter a tight loop at times.
327 // case to ensure that the message loop peeks again instead of calling
344 // GetMessage() loop.
481 DCHECK(state_->run_depth == 1) << "Cannot nest an IO message loop!";
[all...] |
| /external/dropbear/libtommath/etc/ |
| pprime.c | 69 /* loop if divisible by 3,5,7,11,13,17,19,23,29 */
230 /* now loop making the single digit */
272 /* if y == 1 loop */
289 /* if y == 1 loop */
306 /* if y == 1 loop */
|
| /external/proguard/src/proguard/optimize/evaluation/ |
| LivenessAnalyzer.java | 212 // Loop over all traced instructions, backward.
242 // Do we have to check again after this loop?
253 // Loop over all instructions, to mark variables that take up two entries.
258 // Loop over all variables.
296 // Loop over all instructions.
|
| /external/webkit/WebCore/page/ |
| Chrome.cpp | 255 // Defer loads in case the client method runs a new event loop that would
269 // Defer loads in case the client method runs a new event loop that would
279 // Defer loads in case the client method runs a new event loop that would
289 // Defer loads in case the client method runs a new event loop that would
310 // Defer loads in case the client method runs a new event loop that would
|
| /external/webkit/WebCore/rendering/ |
| RenderMarquee.cpp | 215 m_currentLoop = 0; // When direction changes or our loopCount is a smaller number than our current loop, reset our loop.
221 // Hack for WinIE. In WinIE, a value of 0 or lower for the loop count for SLIDE means to only do
222 // one loop.
253 // Check the loop count to see if we should now stop.
|
| /frameworks/base/media/tests/MediaFrameworkTest/src/com/android/mediaframeworktest/stress/ |
| MediaRecorderStressTest.java | 81 Looper.loop();
155 output.write("No of loop: ");
192 output.write("No of loop: ");
244 output.write("No of loop: ");
338 output.write("No of loop: ");
|
| /external/dbus/bus/ |
| bus.c | 48 DBusLoop *loop; member in struct:BusContext
114 return _dbus_loop_add_watch (context->loop,
128 _dbus_loop_remove_watch (context->loop,
150 return _dbus_loop_add_timeout (context->loop,
163 _dbus_loop_remove_timeout (context->loop,
565 context->loop = _dbus_loop_new ();
566 if (context->loop == NULL)
936 if (context->loop)
938 _dbus_loop_unref (context->loop);
939 context->loop = NULL
[all...] |
| /external/iproute2/man/man8/ |
| tc-cbq-details.8 | 155 Classification is a loop, which terminates when a leaf class is found. At any
156 point the loop may jump to the fallback algorithm.
158 The loop consists of the following steps:
168 a class which is not a leaf class, restart loop from the class returned.
177 restart the loop at the found class. If it is a leaf node, terminate.
191 leaf node, restart the loop at this class. If it is a leaf, choose it and
197 The fallback algorithm resides outside of the loop and is as follows.
|
| /external/libvpx/vp8/encoder/ |
| picklpf.c | 88 // Loop through the Y plane raw and reconstruction data summing (square differences)
202 // Apply the loop filter
216 // Update the best case record or exit loop.
239 // Apply the loop filter
251 // Update the best case record or exit loop.
305 int Bias = 0; // Bias against raising loop filter and in favour of lowering it
380 // If value is close to the best so far then bias towards a lower loop filter value.
|
| /external/zlib/contrib/amd64/ |
| amd64-match.S | 230 /* Jump into the main loop. */
245 * Here is the inner loop of the function. The function will spend the
246 * majority of its time in this loop, and majority of that time will
282 * It should be confessed that this loop usually does not represent
312 /* this is the only iteration of the loop with a possibility of having
313 incremented rdx by 0x108 (each loop iteration add 16*4 = 0x40
398 /* have so far, then forget it and return to the lookup loop. */
|
| /libcore/luni/src/main/java/org/apache/harmony/nio/internal/ |
| DatagramChannelImpl.java | 207 boolean loop = isBlocking();
209 retAddr = receiveImpl(target, loop);
211 retAddr = receiveDirectImpl(target, loop);
223 private SocketAddress receiveImpl(ByteBuffer target, boolean loop) throws IOException {
265 } while (loop);
269 private SocketAddress receiveDirectImpl(ByteBuffer target, boolean loop) throws IOException {
298 } while (loop);
|
| /system/wlan/ti/wilink_6_1/stad/src/Connection_Managment/ |
| smeSelect.c | 115 /* get the next site and continue the loop */
127 /* get the next site and continue the loop */
138 /* get the next site and continue the loop */
149 /* get the next site and continue the loop */
177 /* get the next site and continue the loop */
188 /* get the next site and continue the loop */
199 /* get the next site and continue the loop */
|
| /external/chromium/third_party/icu/source/common/ |
| ucnvscsu.c | 267 * conversion "loop"
269 * For performance, this is not a normal C loop.
275 * - a fast-path loop for the most common codes in the mode
276 * - a loop for all other codes in the mode
277 * When the fast-path runs into a code that it cannot handle, its loop ends and it
278 * runs into the following loop to handle the other codes.
279 * The end of the input or output buffer is also handled by the slower loop.
280 * The slow loop jumps (goto) to the fast-path loop again as soon as possible.
613 * conversion "loop"
[all...] |
| /external/icu4c/common/ |
| ucnvscsu.c | 267 * conversion "loop"
269 * For performance, this is not a normal C loop.
275 * - a fast-path loop for the most common codes in the mode
276 * - a loop for all other codes in the mode
277 * When the fast-path runs into a code that it cannot handle, its loop ends and it
278 * runs into the following loop to handle the other codes.
279 * The end of the input or output buffer is also handled by the slower loop.
280 * The slow loop jumps (goto) to the fast-path loop again as soon as possible.
613 * conversion "loop"
[all...] |
| ustrtrns.c | 70 /* simple loop for conversion of a NUL-terminated BMP string */
185 /* simple loop for conversion of a NUL-terminated BMP string */
534 /* Faster loop without ongoing checking for pSrcLimit and pDestLimit. */
537 * Each iteration of the inner loop progresses by at most 3 UTF-8
550 * continue with the next loop.
848 * destination buffer overflow in the loop.
861 /* in this loop, we can always access at least 4 bytes, up to pSrc+3 */
[all...] |
| /prebuilt/linux-x86/toolchain/sh-4.3.3/libexec/gcc/sh-linux-gnu/4.3.3/ |
| cc1 | |
| /external/e2fsprogs/e2fsck/ |
| pass3.c | 24 * twice, then it has detected a filesystem loop, and it will again
26 * filesystem loop.
77 * Allocate some bitmaps to do loop detection.
260 * the lost+found. We have to do loop detection; if we ever discover
261 * a loop, we treat that as a disconnected directory and offer to
264 * However, loop detection is expensive, because for very large
268 * the algorithm. The first time, we ignore loop detection and merely
270 * then we try again with the loop detection bitmap enabled.
326 * loop bitmap turned on and start from the
333 pctx->errcode = ext2fs_allocate_inode_bitmap(fs, _("inode loop detection bitmap"), &inode_loop_detect)
[all...] |
