| /external/chromium/third_party/zlib/ |
| inftrees.c | 85 decoding tables are built in the large loop below, the integer codes
150 Create and fill in decoding tables. In this loop, the table being
175 sym increments through all symbols, and the loop terminates when
177 routine permits incomplete codes, so another loop after this one fills
200 /* initialize state for loop */
292 Fill in rest of table for incomplete codes. This loop is similar to the
293 loop above in incrementing huff for table indices. It is assumed that
294 len is equal to curr + drop, so there is no loop needed to increment
295 through high index bits. When the current sub-table is filled, the loop
|
| /external/kernel-headers/original/linux/ |
| atmdev.h | 119 * Loopback modes for ATM_{PHY,SAR}_{GET,SET}LOOP
123 #define __ATM_LM_NONE 0 /* no loop back ^ ^ ^ ^ */
124 #define __ATM_LM_AAL 1 /* loop back PDUs --' | | | */
125 #define __ATM_LM_ATM 2 /* loop back ATM cells ---' | | */
126 /* RESERVED 4 loop back on PHY side ---' */
127 #define __ATM_LM_PHY 8 /* loop back bits (digital) ----' | */
128 #define __ATM_LM_ANALOG 16 /* loop back the analog signal --------' */
131 #define __ATM_LM_MKLOC(n) ((n)) /* Local (i.e. loop TX to RX) */
132 #define __ATM_LM_MKRMT(n) ((n) << 8) /* Remote (i.e. loop RX to TX) */
|
| /external/openssl/crypto/bn/ |
| bn_ctx.c | 242 unsigned loop = 0; local
243 while(loop < BN_CTX_POOL_SIZE)
244 fprintf(stderr,"%02x ", pool->vals[loop++].dmax);
370 unsigned int loop = 0; local
372 while(loop++ < BN_CTX_POOL_SIZE)
389 unsigned int loop = 0; local
391 while(loop++ < BN_CTX_POOL_SIZE)
408 unsigned int loop = 0; local
413 while(loop++ < BN_CTX_POOL_SIZE)
|
| /external/qemu/distrib/zlib-1.2.3/ |
| inftrees.c | 85 decoding tables are built in the large loop below, the integer codes
150 Create and fill in decoding tables. In this loop, the table being
175 sym increments through all symbols, and the loop terminates when
177 routine permits incomplete codes, so another loop after this one fills
200 /* initialize state for loop */
292 Fill in rest of table for incomplete codes. This loop is similar to the
293 loop above in incrementing huff for table indices. It is assumed that
294 len is equal to curr + drop, so there is no loop needed to increment
295 through high index bits. When the current sub-table is filled, the loop
|
| /external/zlib/contrib/infback9/ |
| inftree9.c | 87 decoding tables are built in the large loop below, the integer codes
144 Create and fill in decoding tables. In this loop, the table being
168 sym increments through all symbols, and the loop terminates when
170 routine permits incomplete codes, so another loop after this one fills
193 /* initialize state for loop */
286 Fill in rest of table for incomplete codes. This loop is similar to the
287 loop above in incrementing huff for table indices. It is assumed that
288 len is equal to curr + drop, so there is no loop needed to increment
289 through high index bits. When the current sub-table is filled, the loop
|
| /external/zlib/ |
| inftrees.c | 85 decoding tables are built in the large loop below, the integer codes
150 Create and fill in decoding tables. In this loop, the table being
174 sym increments through all symbols, and the loop terminates when
176 routine permits incomplete codes, so another loop after this one fills
199 /* initialize state for loop */
293 Fill in rest of table for incomplete codes. This loop is similar to the
294 loop above in incrementing huff for table indices. It is assumed that
295 len is equal to curr + drop, so there is no loop needed to increment
296 through high index bits. When the current sub-table is filled, the loop
|
| /external/openssl/crypto/rc4/asm/ |
| rc4-ia64.pl | 47 # Pipelining this loop isn't easy, because the stores to the S[] array
48 # need to be observed in the right order. The loop generated by the
80 # The core-loop that can be pipelined then looks like this (annotated
125 # phases of the loop are strangly mingled together. In
129 # - Pipelined, the loop can execute in 3 cycles/iteration and
138 # reason we can't use module-loop support in IA-64 and have
139 # to do a traditional, purely software-pipelined loop.
142 # and would push the loop to the point where more bypasses
144 # - The above loop runs at around 3.26 cycles/byte, or roughly
147 # "lfetch" this loop can run at (almost) peak speed even whe
[all...] |
| /cts/tests/tests/media/src/android/media/cts/ |
| SoundPoolTest.java | 220 int loop = 0; local
222 int streamID = mSoundPool.play(sampleID, leftVolume, rightVolume, priority, loop, rate);
236 streamID = mSoundPool.play(sampleID, leftVolume, rightVolume, priority, loop, rate);
238 loop = -1;// loop forever
239 mSoundPool.setLoop(streamID, loop);
|
| /external/chromium/third_party/icu/source/i18n/ |
| regeximp.h | 80 // Used in (x)+, breaks loop on zero length match.
95 // at the end of the loop.
101 URX_CTR_LOOP = 28, // Loop Ops for {interval} loops.
163 URX_LOOP_SR_I = 50, // Init a [set]* loop.
165 URX_LOOP_C = 51, // Continue a [set]* or OneChar* loop.
168 URX_LOOP_DOT_I = 52, // .*, initialization of the optimized loop.
|
| /external/icu4c/i18n/ |
| regeximp.h | 80 // Used in (x)+, breaks loop on zero length match.
95 // at the end of the loop.
101 URX_CTR_LOOP = 28, // Loop Ops for {interval} loops.
163 URX_LOOP_SR_I = 50, // Init a [set]* loop.
165 URX_LOOP_C = 51, // Continue a [set]* or OneChar* loop.
168 URX_LOOP_DOT_I = 52, // .*, initialization of the optimized loop.
|
| /external/chromium/third_party/icu/source/common/ |
| ucnvlat1.c | 62 /* This loop is unrolled for speed and improved pipelining. */
95 /* conversion loop */
174 /* conversion loop */
180 /* unroll the loop with the most common case */
256 /* conversion loop */
360 * In the conversion loop compare source with sourceLimit only once
363 * the conversion loop handles at most 2-byte sequences.
369 /* conversion loop */
399 * The sourceLimit may have been adjusted before the conversion loop
501 /* This loop is unrolled for speed and improved pipelining. *
[all...] |
| /external/icu4c/common/ |
| ucnvlat1.c | 62 /* This loop is unrolled for speed and improved pipelining. */
95 /* conversion loop */
174 /* conversion loop */
180 /* unroll the loop with the most common case */
256 /* conversion loop */
360 * In the conversion loop compare source with sourceLimit only once
363 * the conversion loop handles at most 2-byte sequences.
369 /* conversion loop */
399 * The sourceLimit may have been adjusted before the conversion loop
501 /* This loop is unrolled for speed and improved pipelining. *
[all...] |
| /prebuilt/darwin-x86/toolchain/arm-eabi-4.2.1/info/ |
| gccint.info | 92 * Loop Analysis and Representation:: Analysis and representation of loops
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.2.1/info/ |
| gccint.info | 92 * Loop Analysis and Representation:: Analysis and representation of loops
[all...] |
| /prebuilt/linux-x86/toolchain/i686-unknown-linux-gnu-4.2.1/info/ |
| gccint.info | 92 * Loop Analysis and Representation:: Analysis and representation of loops
[all...] |
| /dalvik/vm/mterp/portable/ |
| entry.c | 2 * Main interpreter loop.
103 /* just fall through to instruction loop or threaded kickstart */
|
| /external/chromium/base/ |
| thread.cc | 15 // This task is used to trigger the message loop to exit.
137 // The message loop for this thread.
|
| /external/chromium/net/disk_cache/ |
| disk_cache_test_util.h | 72 // Simple helper to deal with the message loop on a test.
77 // Run the message loop and wait for num_callbacks before returning. Returns
|
| /external/chromium/third_party/icu/source/test/perf/collationperf/ |
| readme.html | 45 -loop nnnn Loopcount for test. Adjust for reasonable total running time.
70 <TD WIDTH="100%"><TT>C:\>collperf -loop 200 -file latin.txt -keygen -shifted -level 4<BR>
|
| /external/chromium/third_party/libevent/ |
| event-internal.h | 55 int event_gotterm; /* Set to terminate loop */
56 int event_break; /* Set to terminate loop immediately */
|
| /external/dropbear/ |
| filelist.txt | 11 session.c Contains the main select() loop, and handles setting
25 Called from session.c's main select loop.
|
| /external/dropbear/libtommath/ |
| bn_fast_s_mp_mul_digs.c | 65 /* this is the number of times the loop will iterrate, essentially
70 /* execute loop */
|
| bn_mp_montgomery_reduce.c | 29 * are fixed up in the inner loop.
52 * following inner loop to reduce the
|
| /external/icu4c/test/perf/collationperf/ |
| readme.html | 45 -loop nnnn Loopcount for test. Adjust for reasonable total running time.
70 <TD WIDTH="100%"><TT>C:\>collperf -loop 200 -file latin.txt -keygen -shifted -level 4<BR>
|
| /external/libpng/contrib/pngminus/ |
| makevms.com | 63 $Loop:
82 $ If arg .Le. 8 Then Goto Loop
|
