Lines Matching refs:i

38     for (int i = 1; i < size; i++) flags[i] = true; // Can eliminate.  in sieve()
39 for (int i = 2; i < size; i++) { in sieve()
40 if (flags[i]) { // Can eliminate. in sieve()
42 for (int k = i + 1; k <= size; k += i) in sieve()
285 for (int i = 0; i < array.length; i++) { in loopPattern1()
286 array[i] = 1; // Bounds check can be eliminated. in loopPattern1()
289 for (int i = 1; i < array.length; i++) { in loopPattern1()
290 array[i] = 1; // Bounds check can be eliminated. in loopPattern1()
293 for (int i = 1; i < array.length - 1; i++) { in loopPattern1()
294 array[i] = 1; // Bounds check can be eliminated. in loopPattern1()
297 for (int i = -1; i < array.length; i++) { in loopPattern1()
298 array[i] = 1; // Bounds check can't be eliminated. in loopPattern1()
301 for (int i = 0; i <= array.length; i++) { in loopPattern1()
302 array[i] = 1; // Bounds check can't be eliminated. in loopPattern1()
305 for (int i = 0; i < array.length; i += 2) { in loopPattern1()
308 array[i] = 1; in loopPattern1()
311 for (int i = 1; i < array.length; i += 2) { in loopPattern1()
314 array[i] = 1; in loopPattern1()
348 for (int i = array.length - 1; i >= 0; i--) { in loopPattern2()
349 array[i] = 1; // Bounds check can be eliminated. in loopPattern2()
352 for (int i = array.length; i > 0; i--) { in loopPattern2()
353 array[i - 1] = 1; // Bounds check can be eliminated. in loopPattern2()
356 for (int i = array.length - 1; i > 0; i--) { in loopPattern2()
357 array[i] = 1; // Bounds check can be eliminated. in loopPattern2()
360 for (int i = array.length; i >= 0; i--) { in loopPattern2()
361 array[i] = 1; // Bounds check can't be eliminated. in loopPattern2()
364 for (int i = array.length; i >= 0; i--) { in loopPattern2()
365 array[i - 1] = 1; // Bounds check can't be eliminated. in loopPattern2()
368 for (int i = array.length; i > 0; i -= 20) { in loopPattern2()
370 array[i - 1] = 1; // Bounds check can be eliminated. in loopPattern2()
385 for (int i = 0; ; i++) { in loopPattern3()
386 if (random.nextInt() % 1000 == 0 && i < array.length) { in loopPattern3()
390 array[i] = 1; in loopPattern3()
422 for (int i = 0; i < 10; i++) { in constantNewArray()
423 array[i] = 1; // Bounds check can be eliminated. in constantNewArray()
426 for (int i = 0; i <= 10; i++) { in constantNewArray()
427 array[i] = 1; // Bounds check can't be eliminated. in constantNewArray()
450 int i = 0; in circularBufferProducer() local
452 array[i & (array.length - 1)] = readData(); in circularBufferProducer()
453 i++; in circularBufferProducer()
472 for (int i = 0; i < (array.length + 1) / 2; i++) { in pyramid1()
473 array[i] = i; in pyramid1()
474 array[array.length - 1 - i] = i; in pyramid1()
493 for (int i = 0; i < (array.length + 1) >> 1; i++) { in pyramid2()
494 array[i] = i; in pyramid2()
495 array[array.length - 1 - i] = i; in pyramid2()
514 for (int i = 0; i < (array.length + 1) >>> 1; i++) { in pyramid3()
515 array[i] = i; in pyramid3()
516 array[array.length - 1 - i] = i; in pyramid3()
534 int i = 0; in isPyramid() local
536 while (i <= j) { in isPyramid()
537 if (array[i] != i) { in isPyramid()
540 if (array[j] != i) { in isPyramid()
543 i++; j--; in isPyramid()
588 for (int i = 0; i < array.length - 1; i++) { in bubbleSort()
589 for (int j = 0; j < array.length - i - 1; j++) { in bubbleSort()
641 for (int i = start ; i < end; i++) { in foo1()
642 array[i] = 1; in foo1()
643 sum += array[i]; in foo1()
676 for (int i = start ; i <= end; i++) { in foo2()
677 array[i] = 1; in foo2()
678 sum += array[i]; in foo2()
709 for (int i = 3 ; i <= end; i++) { in foo3()
710 array[i] = 1; in foo3()
711 sum += array[i]; in foo3()
742 for (int i = end ; i > 0; i--) { in foo4()
743 array[i - 1] = 1; in foo4()
744 sum += array[i - 1]; in foo4()
781 for (int i = array.length - 1 ; i >= 0; i--) { in foo5()
782 array[i] = 1; in foo5()
786 for (int i = end - 2 ; i > 0; i--) { in foo5()
787 sum += array[i - 1]; in foo5()
788 sum += array[i]; in foo5()
789 sum += array[i + 1]; in foo5()
839 for (int i = end; i >= start; i--) { in foo6()
840 array[i] = (array[i-2] + array[i-1] + array[i] + array[i+1] + array[i+2]) / 5; in foo6()
873 for (int i = start ; i < end; i++) { in foo7()
878 sum += array[i + 1000]; in foo7()
880 sum += array[i]; in foo7()
918 for (int i = start; i < end; i++) { in foo8()
919 int[] row = matrix[i]; in foo8()
946 for (int i = 0 ; i < 10; i++) { in foo9()
947 sum += array[i]; in foo9()
966 for (int i = start; i < end; i++) { in partialLooping()
967 if (i == 2) { in partialLooping()
970 array[i] = 1; in partialLooping()
1121 for (int i = start; i <= finish; i++) { in testExceptionMessage1()
1122 a2[j - 1] = a1[i + 1]; in testExceptionMessage1()
1135 for (int i = 0; i < 8; i++) { in main()
1136 if (array[i] != i) { in main()
1160 int i = 1; in main() local
1161 if (foo() + i != 100) { in main()