| /external/llvm/lib/Transforms/Scalar/ |
| LoopInstSimplify.cpp | 166 // Place the list of instructions to simplify on the next loop iteration
|
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyInstructions.cpp | 78 // Place the list of instructions to simplify on the next loop iteration
|
| /external/llvm/test/Transforms/Inline/ |
| noinline-recursive-fn.ll | 2 ; This effectively is just peeling off the first iteration of a loop, and the
|
| /external/llvm/unittests/ADT/ |
| IntervalMapTest.cpp | 350 // Forward iteration.
362 // Backwards iteration.
489 // Forward iteration.
501 // Backwards iteration.
|
| SparseSetTest.cpp | 91 // Without deletions, iteration order == insertion order.
|
| StringMapTest.cpp | 159 // A more complex iteration test.
|
| /external/llvm/utils/TableGen/ |
| SequenceToOffsetTable.h | 89 // Lay out the table in Seqs iteration order.
|
| /external/mesa3d/src/gallium/state_trackers/d3d1x/docs/ |
| coding_style.txt | 73 Otherwise, you risk the compiler evaluating end() for each loop iteration.
|
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_fs_cse.cpp | 147 /* Continue iteration with copy->next */
|
| /external/mesa3d/src/mesa/main/ |
| texcompress_cpal.c | 92 /* two pixels per iteration */
|
| /external/open-vcdiff/src/ |
| testing.h | 167 // value is multiplied by (RAND_MAX + 1) each iteration. This factor will be
|
| /external/opencv/cvaux/src/ |
| extendededges.cpp | 92 //iteration through tree
|
| /external/oprofile/module/ |
| op_dname.c | 185 * iteration: value = (value + incr) % N covers the range [0-N[
|
| /external/pixman/pixman/ |
| pixman-arm-simd-asm-scaled.S | 118 1: /* main loop, process 8 pixels per iteration with prefetch */
|
| /external/protobuf/gtest/test/ |
| gtest_stress_test.cc | 85 SCOPED_TRACE(Message() << "Iteration #" << i);
|
| /external/qemu/distrib/sdl-1.2.15/src/video/ |
| e_sqrt.h | 256 A. sqrt(x) by Newton Iteration
362 B. sqrt(x) by Reciproot Iteration
393 Apply Reciproot iteration three times to y and multiply the
406 (a) the term z*y in the final iteration is always less than 1;
|
| /external/speex/libspeex/ |
| lpc.c | 92 /* Sum up this iteration's reflection coefficient */
|
| /external/tcpdump/ |
| print-pppoe.c | 149 * tag_type is previous tag or 0xffff for first iteration
|
| /external/v8/benchmarks/ |
| README.txt | 22 are reset for each iteration of the benchmark. In addition, the size
|
| revisions.html | 83 are reset for each iteration of the benchmark. In addition, the size
|
| /external/v8/test/mjsunit/ |
| array-pop.js | 121 assertEquals(99 - i, x.pop(), i + 'th iteration');
|
| array-push.js | 113 assertEquals(i + 1, x.length, i + 'th iteration');
|
| /external/valgrind/main/include/ |
| pub_tool_sparsewa.h | 80 // Set up 'swa' for iteration.
|
| /external/valgrind/main/memcheck/tests/ |
| vcpu_fbench.c | 300 int itercount; /* The iteration counter for the main loop
309 int niter = ITERATIONS; /* Iteration counter */
733 printf("with the iteration count set so that roughly five\n");
757 printf("adjust iteration count so the benchmark runs about five minutes.\n\n");
|
| /external/valgrind/main/perf/ |
| fbench.c | 296 int itercount; /* The iteration counter for the main loop
305 int niter = ITERATIONS; /* Iteration counter */
729 printf("with the iteration count set so that roughly five\n");
753 printf("adjust iteration count so the benchmark runs about five minutes.\n\n");
|
