| /external/chromium/net/base/ |
| cert_verifier.cc | 54 // The origin loop could go away while we are trying to post to it, so we
|
| listen_socket.h | 8 // happen in that loop's thread always and that all other methods (including
|
| test_completion_callback_unittest.cc | 68 // The origin loop could go away while we are trying to post to it, so we
|
| /external/chromium/net/disk_cache/ |
| mem_entry_impl.cc | 224 // This loop walks through child entries continuously starting from |offset|
287 // This loop scan for continuous bytes.
300 // If the next child is discontinuous, break the loop.
456 // This loop tries to find the first existing child.
|
| /external/chromium/sdch/open-vcdiff/src/ |
| decodetable.cc | 89 // This do-while loop is necessary in case inst1 == VCD_NOOP for an opcode
|
| /external/chromium/third_party/icu/source/i18n/ |
| strrepl.h | 32 * StringReplacer has a slower processing loop than a non-complex one.
|
| /external/chromium/third_party/icu/source/test/cintltst/ |
| cg7coll.c | 116 /* new table collation with rules "& Z < p, P" loop to FIXEDTESTSET */
118 /* new table collation with rules "& C < ch , cH, Ch, CH " loop to TOTALTESTSET */
120 /* new table collation with rules "& Question-mark ; ? & Hash-mark ; # & Ampersand ; '&' " loop to TOTALTESTSET */
122 /* analogous to Japanese rules " & aa ; a- & ee ; e- & ii ; i- & oo ; o- & uu ; u- " */ /* loop to TOTALTESTSET */
|
| /external/chromium/third_party/icu/source/test/intltest/ |
| g7coll.cpp | 68 /* new table collation with rules "& Z < p, P" loop to FIXEDTESTSET */
70 /* new table collation with rules "& C < ch , cH, Ch, CH " loop to TOTALTESTSET */
72 /* new table collation with rules "& Question-mark ; ? & Hash-mark ; # & Ampersand ; '&' " loop to TOTALTESTSET */
74 /* analogous to Japanese rules " & aa ; a- & ee ; e- & ii ; i- & oo ; o- & uu ; u- " */ /* loop to TOTALTESTSET */
|
| itformat.cpp | 125 default: name = ""; break; //needed to end loop
|
| /external/chromium/third_party/icu/source/test/perf/collationperf/ |
| collperf.cpp | 38 "-loop nnnn Loopcount for test. Adjust for reasonable total running time.\n"
39 "-iloop n Inner Loop Count. Default = 1. Number of calls to function\n"
170 {"-loop", OptSpec::NUM, &opt_loopCount},
376 // Adjust loop count to compensate for file size. Should be order n
472 // Adjust loop count to compensate for file size. Should be order n (lookups) * log n (compares/lookup)
475 // manually adjust the loop count for every different file size.
482 for (;;) { // not really a loop, just allows "break" to work, to simplify
681 printf("binary search: compares per loop = %d\n", gCount / loops);
701 // Adjust loop count to compensate for file size. QSort should be n log(n)
856 // empty loop recalculatio
[all...] |
| /external/chromium/third_party/icu/source/tools/ctestfw/unicode/ |
| uperf.h | 94 * Call call() n times in a tight loop and return the elapsed
|
| /external/chromium/third_party/icu/source/tools/toolutil/ |
| toolutil.h | 37 * by a batch file for loop, which yields short pathnames on Win9x.
|
| /external/dbus/dbus/ |
| dbus-watch.c | 56 * by a main loop.
466 * a file descriptor that the main loop needs to monitor,
561 * enabled, it should not be polled by the main loop.
581 * application may spin in a busy loop on the file descriptor until
|
| /external/dnsmasq/src/ |
| util.c | 70 int r; int i; int loop; local
75 for (loop = 0;loop < 2;++loop) {
|
| /external/dropbear/libtomcrypt/notes/ |
| tech0002.txt | 47 significantly in the loop after the operation. However, this type of fix is more important to secure the user of the
|
| /external/dropbear/libtommath/ |
| bn_mp_exteuclid.c | 38 /* loop while v3 != 0 */
|
| /external/grub/netboot/ |
| timer.c | 40 * output busy loop as low as possible. We avoid reading the CTC registers
|
| /external/guava/src/com/google/common/util/concurrent/ |
| AbstractExecutionThreadService.java | 79 * changes in a work loop:
|
| /external/icu4c/i18n/ |
| strrepl.h | 32 * StringReplacer has a slower processing loop than a non-complex one.
|
| /external/icu4c/test/cintltst/ |
| cg7coll.c | 116 /* new table collation with rules "& Z < p, P" loop to FIXEDTESTSET */
118 /* new table collation with rules "& C < ch , cH, Ch, CH " loop to TOTALTESTSET */
120 /* new table collation with rules "& Question-mark ; ? & Hash-mark ; # & Ampersand ; '&' " loop to TOTALTESTSET */
122 /* analogous to Japanese rules " & aa ; a- & ee ; e- & ii ; i- & oo ; o- & uu ; u- " */ /* loop to TOTALTESTSET */
|
| /external/icu4c/test/intltest/ |
| g7coll.cpp | 68 /* new table collation with rules "& Z < p, P" loop to FIXEDTESTSET */
70 /* new table collation with rules "& C < ch , cH, Ch, CH " loop to TOTALTESTSET */
72 /* new table collation with rules "& Question-mark ; ? & Hash-mark ; # & Ampersand ; '&' " loop to TOTALTESTSET */
74 /* analogous to Japanese rules " & aa ; a- & ee ; e- & ii ; i- & oo ; o- & uu ; u- " */ /* loop to TOTALTESTSET */
|
| itformat.cpp | 133 default: name = ""; break; //needed to end loop
|
| /external/icu4c/test/perf/collationperf/ |
| collperf.cpp | 38 "-loop nnnn Loopcount for test. Adjust for reasonable total running time.\n"
39 "-iloop n Inner Loop Count. Default = 1. Number of calls to function\n"
170 {"-loop", OptSpec::NUM, &opt_loopCount},
376 // Adjust loop count to compensate for file size. Should be order n
472 // Adjust loop count to compensate for file size. Should be order n (lookups) * log n (compares/lookup)
475 // manually adjust the loop count for every different file size.
482 for (;;) { // not really a loop, just allows "break" to work, to simplify
681 printf("binary search: compares per loop = %d\n", gCount / loops);
701 // Adjust loop count to compensate for file size. QSort should be n log(n)
858 // empty loop recalculatio
[all...] |
| /external/icu4c/tools/ctestfw/unicode/ |
| uperf.h | 94 * Call call() n times in a tight loop and return the elapsed
|
| /external/jpeg/ |
| jccolor.c | 15 // this enables unrolling null_convert's loop, and reading/write ints for speed
50 * For even more speed, we avoid doing any multiplications in the inner loop
57 * in the tables to save adding them separately in the inner loop.
377 /* fall through to while-loop */
|
