HomeSort by relevance Sort by last modified time
    Searched full:loop (Results 526 - 550 of 3512) sorted by null

<<21222324252627282930>>

  /external/webkit/WebCore/workers/
WorkerThread.cpp 211 // Ensure that tasks are being handled by thread event loop. If script execution weren't forbidden, a while(1) loop in JS could keep the thread alive forever.
  /external/yaffs2/yaffs2/
yaffs_qsort.c 85 loop: SWAPINIT(a, es);
153 goto loop;
  /frameworks/base/libs/rs/
rsLocklessFifo.cpp 89 // Add space for command header and loop token;
172 // Need to loop regardless of where get is.
  /frameworks/base/media/libmedia/
Metadata.cpp 133 // Loop over all the exiting ones in the Parcel to check for duplicate
143 // Loop over the keys to check if it has been used already.
  /frameworks/base/media/libstagefright/codecs/amrwbenc/src/asm/ARMV5E/
convolve_opt.s 38 LOOP:
177 BLT LOOP
  /frameworks/base/media/libstagefright/codecs/amrwbenc/src/asm/ARMV7/
convolve_neon.s 38 LOOP:
170 BLT LOOP
  /frameworks/base/opengl/tests/tritex/
tritex.cpp 267 printf("loop %d / 10 (%d quads / loop)\n", j, quads);
  /frameworks/base/services/audioflinger/
AudioResampler.cpp 226 maxOutPt = out + (outputSampleCount - 2); // 2 because 2 frames per loop
241 // LOGE("loop done - outputIndex=%d, inputIndex=%d\n", outputIndex, inputIndex);
336 // LOGE("loop done - outputIndex=%d, inputIndex=%d\n", outputIndex, inputIndex);
365 * asm optimized monotonic loop version; one loop is 2 frames
425 // the following loop works on 2 frames
475 * asm optimized stereo loop version; one loop is 2 frames
  /hardware/ti/wlan/wl1271/stad/src/Connection_Managment/
smeSelect.c 118 /* get the next site and continue the loop */
130 /* get the next site and continue the loop */
141 /* get the next site and continue the loop */
152 /* get the next site and continue the loop */
180 /* get the next site and continue the loop */
196 /* get the next site and continue the loop */
208 /* get the next site and continue the loop */
217 /* get the next site and continue the loop */
  /libcore/luni/src/main/java/org/apache/harmony/xnet/provider/jsse/
KeyManagerImpl.java 161 loop: for (int ii = 0; ii < certs.length; ii++) {
168 break loop; local
  /libcore/luni/src/main/java/org/apache/xml/dtm/
DTMAxisTraverser.java 49 * returned or the iteration will go into an infinate loop. So to traverse
66 * returned or the iteration will go into an infinate loop. So to traverse
  /libcore/luni/src/main/native/
org_apache_harmony_luni_util_FloatingPointParser.cpp 71 * incrementing. It is possible for us to be stuck in the loop when
74 * the loop if we toggle between incrementing and decrementing for more
201 /* We've broken out of the parse loop either because we've reached
327 * loop if the given approximating floating-point number (a very small
555 * incrementing. It is possible for us to be stuck in the loop when
558 * the loop if we toggle between incrementing and decrementing for more
644 /* We've broken out of the parse loop either because we've reached
804 * loop if the given approximating floating-point number (a very small
  /packages/apps/Mms/src/org/w3c/dom/smil/
ElementTime.java 89 * (loop) for the specified number of times. A negative value repeat the
99 * The repeatDur causes the element to play repeatedly (loop) for the
  /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/libexec/gcc/arm-eabi/4.4.0/
cc1 
  /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/libexec/gcc/arm-eabi/4.4.3/
cc1 
  /system/core/libpixelflinger/
t32cb16blend.S 162 // The main loop is unrolled twice and processes 4 pixels
181 // 2nd iterration of the loop, don't stream anything
  /external/chromium/third_party/icu/source/common/
ubidiln.c 419 * will be all runs, and we don't need the elaborate loop to search for them.
421 * by an extra reorder-all after the reorder-some loop.
430 * This means that for the main reordering loop we don't need to consider
447 * and reorder at an odd minLevel in a separate, simpler loop.
456 /* do not include the WS run at paraLevel<=old minLevel except in the simple loop */
464 /* loop for all sequences of runs */
663 /* this loop will also handle the trailing WS run */
765 /* loop maxLevel..minLevel */
769 /* loop for all sequences of levels to reorder at the current maxLevel */
828 /* loop maxLevel..minLevel *
    [all...]
  /external/icu4c/common/
ubidiln.c 419 * will be all runs, and we don't need the elaborate loop to search for them.
421 * by an extra reorder-all after the reorder-some loop.
430 * This means that for the main reordering loop we don't need to consider
447 * and reorder at an odd minLevel in a separate, simpler loop.
456 /* do not include the WS run at paraLevel<=old minLevel except in the simple loop */
464 /* loop for all sequences of runs */
663 /* this loop will also handle the trailing WS run */
765 /* loop maxLevel..minLevel */
769 /* loop for all sequences of levels to reorder at the current maxLevel */
828 /* loop maxLevel..minLevel *
    [all...]
  /external/webkit/JavaScriptCore/yarr/
RegexJIT.cpp 139 // shuffle along & loop around if there are any more matches to handle.
569 Label loop(this);
579 branch32(NotEqual, countRegister, index).linkTo(loop, this);
592 Label loop(this);
604 branch32(NotEqual, countRegister, Imm32(term.quantityCount)).linkTo(loop, this);
684 Label loop(this);
697 branch32(NotEqual, countRegister, index).linkTo(loop, this);
709 Label loop(this);
725 branch32(NotEqual, countRegister, Imm32(term.quantityCount)).linkTo(loop, this);
    [all...]
  /bionic/libc/include/net/
if_types.h 138 #define IFT_ADSL 0x5e /* Asymmetric Digital Subscriber Loop */
139 #define IFT_RADSL 0x5f /* Rate-Adapt. Digital Subscriber Loop*/
140 #define IFT_SDSL 0x60 /* Symmetric Digital Subscriber Loop */
141 #define IFT_VDSL 0x61 /* Very H-Speed Digital Subscrib. Loop*/
198 #define IFT_IDSL 0x9a /* Digital Subscriber Loop over ISDN */
  /development/ndk/platforms/android-3/include/net/
if_types.h 138 #define IFT_ADSL 0x5e /* Asymmetric Digital Subscriber Loop */
139 #define IFT_RADSL 0x5f /* Rate-Adapt. Digital Subscriber Loop*/
140 #define IFT_SDSL 0x60 /* Symmetric Digital Subscriber Loop */
141 #define IFT_VDSL 0x61 /* Very H-Speed Digital Subscrib. Loop*/
198 #define IFT_IDSL 0x9a /* Digital Subscriber Loop over ISDN */
  /external/chromium/base/
message_pump_win.h 49 // The nested loop is exited by either posting a quit, or returning false
55 // normal. If false is returned, the nested loop exits immediately.
70 // message loop observers that another message has been processed.
115 // a nearly infinite loop that peeks out messages, and then dispatches them.
194 // deal with Windows mesagges, and instead has a Run loop based on Completion
  /external/chromium/sdch/open-vcdiff/src/
blockhash.cc 120 // Guard against an infinite loop
137 // The loop above tries to find the smallest power of 2 that is >= min_size.
387 // The vast majority of calls to FindBestMatch enter the loop *zero* times,
390 // loop and the code within the loop conditions. Keep this to a minimum.
  /external/clearsilver/cs/
cs.h 26 * CMD_LOOP := CS_OPEN LOOP CS_CLOSE
27 * LOOP := loop:VAR = EXPR, EXPR, EXPR
154 int first; /* This local is the "first" item in an each/loop */
155 int last; /* This local is the "last" item in an loop, each is calculated
  /external/icu4c/test/intltest/
bidiconf.cpp 76 break; // needed to end the loop
344 // Loop over the bitset.
359 // so just break out of the inner loop.
364 // so just break out of the inner loop.
442 // and loop over each run's indexes, but that seems unnecessary for this test code.

Completed in 2192 milliseconds

<<21222324252627282930>>