Lines Matching refs:i
36 for (int i = 0; i < x.length; i++) { in linear()
37 result += x[i]; in linear()
50 for (int i = x.length - 1; i >= 0; i--) { in linearDown()
51 result += x[i]; in linearDown()
64 for (int i = x.length - 1; i >= 0; i--) { in linearObscure()
65 int k = i + 5; in linearObscure()
79 for (int i = 0; i < x.length; i++) { in linearVeryObscure()
80 int k = (-i) + (i << 5) + i - (32 * i) + 5 + (int) i; in linearVeryObscure()
94 for (int i = 1; i <= 1; i++) { in hiddenStride()
96 for (int j = 0; j < a.length; j += i) { in hiddenStride()
110 int i = 0; in linearWhile() local
112 while (i < x.length) { in linearWhile()
113 result += x[i++]; in linearWhile()
126 for (int i = 0; i < x.length; ) { in linearThreeWayPhi()
127 if (x[i] == 5) { in linearThreeWayPhi()
128 i++; in linearThreeWayPhi()
131 result += x[i++]; in linearThreeWayPhi()
144 for (int i = 0; i < x.length; ) { in linearFourWayPhi()
145 if (x[i] == 5) { in linearFourWayPhi()
146 i++; in linearFourWayPhi()
148 } else if (x[i] == 6) { in linearFourWayPhi()
149 i++; in linearFourWayPhi()
153 result += x[i++]; in linearFourWayPhi()
168 for (int i = 0; i < x.length; i++) { in wrapAroundThenLinear()
170 w = i; in wrapAroundThenLinear()
185 for (int i = 0; i < x.length; ) { in wrapAroundThenLinearThreeWayPhi()
187 w = i++; in wrapAroundThenLinearThreeWayPhi()
191 w = i++; in wrapAroundThenLinearThreeWayPhi()
204 for (int i = 0; i < n; i++) { in linearWithParameter()
205 x[i] = i; in linearWithParameter()
219 for (int i = 0; i < n; i++) { in linearCopy()
220 y[i] = x[i]; in linearCopy()
235 for (int i = 0; i < n; i++) { in linearByTwo()
236 int ii = i << 1; in linearByTwo()
251 for (int i = 0; i < x.length / 2; i++) { in linearByTwoSkip1()
252 result += x[2 * i]; in linearByTwoSkip1()
268 for (int i = 0; i < x.length; i+=2) { in linearByTwoSkip2()
269 result += x[i]; in linearByTwoSkip2()
283 for (int i = 0; i <= 12; ) { in linearWithCompoundStride()
284 i++; in linearWithCompoundStride()
285 result += x[i]; in linearWithCompoundStride()
286 i++; in linearWithCompoundStride()
303 for (int i = 1; i <= 10 * 10000000 + 1; i += 10000000) { in linearWithLargePositiveStride()
323 for (int i = 1; i < Integer.MAX_VALUE; i += 195225786) { in linearWithVeryLargePositiveStride()
341 for (int i = -1; i >= -10 * 10000000 - 1; i -= 10000000) { in linearWithLargeNegativeStride()
361 for (int i = -2; i > Integer.MIN_VALUE; i -= 195225786) { in linearWithVeryLargeNegativeStride()
376 for (int i = 0; i != 10; i++) { in linearForNEUp()
377 result += x[i]; in linearForNEUp()
391 for (int i = 9; i != -1; i--) { in linearForNEDown()
392 result += x[i]; in linearForNEDown()
405 for (int i = 0; i != x.length; i++) { in linearForNEArrayLengthUp()
406 result += x[i]; in linearForNEArrayLengthUp()
419 for (int i = x.length - 1; i != -1; i--) { in linearForNEArrayLengthDown()
420 result += x[i]; in linearForNEArrayLengthDown()
434 int i = 0; in linearDoWhileUp() local
436 result += x[i++]; in linearDoWhileUp()
437 } while (i < 10); in linearDoWhileUp()
450 int i = 9; in linearDoWhileDown() local
452 result += x[i--]; in linearDoWhileDown()
453 } while (0 <= i); in linearDoWhileDown()
468 for (long i = 0; i < 10; i++) { in linearLong()
469 result += x[(int)i]; in linearLong()
484 for (long i = 0; i < x.length; i++) { in linearLongAlt()
485 result += x[(int)i]; in linearLongAlt()
500 for (short i = 0; i < 10; i++) { in linearShort()
501 result += x[i]; in linearShort()
516 for (char i = 0; i < 10; i++) { in linearChar()
517 result += x[i]; in linearChar()
532 for (byte i = 0; i < 10; i++) { in linearByte()
533 result += x[i]; in linearByte()
553 for (int i = 0; i < hi; i++) { in invariantFromPreLoop()
554 result += x[i]; in invariantFromPreLoop()
568 for (int i = 0; i < a.length; i++) { in linearTriangularOnTwoArrayLengths()
569 int[] b = new int[i]; in linearTriangularOnTwoArrayLengths()
576 verifyTriangular(a, b, i, n); in linearTriangularOnTwoArrayLengths()
589 for (int i = 0; i < a.length; i++) { in linearTriangularOnOneArrayLength()
590 int[] b = new int[i]; in linearTriangularOnOneArrayLength()
591 for (int j = 0; j < i; j++) { in linearTriangularOnOneArrayLength()
597 verifyTriangular(a, b, i, n); in linearTriangularOnOneArrayLength()
610 for (int i = 0; i < n; i++) { in linearTriangularOnParameter()
611 int[] b = new int[i]; in linearTriangularOnParameter()
612 for (int j = 0; j < i; j++) { in linearTriangularOnParameter()
618 verifyTriangular(a, b, i, n); in linearTriangularOnParameter()
633 for (int i = 0; i < n; i++) { in linearTriangularStrictLower()
634 for (int j = 0; j < i; j++) { in linearTriangularStrictLower()
637 for (int j = i - 1; j >= 0; j--) { in linearTriangularStrictLower()
640 for (int j = i; j < n; j++) { in linearTriangularStrictLower()
643 for (int j = n - 1; j >= i; j--) { in linearTriangularStrictLower()
661 for (int i = 0; i < n; i++) { in linearTriangularStrictUpper()
662 for (int j = 0; j <= i; j++) { in linearTriangularStrictUpper()
665 for (int j = i; j >= 0; j--) { in linearTriangularStrictUpper()
668 for (int j = i + 1; j < n; j++) { in linearTriangularStrictUpper()
671 for (int j = n - 1; j >= i + 1; j--) { in linearTriangularStrictUpper()
681 for (int i = 0, k = m; i < n; i++) { in verifyTriangular()
682 expectEquals(a[i], k); in verifyTriangular()
686 for (int i = 0; i < m; i++) { in verifyTriangular()
687 expectEquals(b[i], 1); in verifyTriangular()
694 for (int i = 0; i < n; i++) { in verifyTriangular()
695 expectEquals(a[i], n + n); in verifyTriangular()
710 for (int i = 0; i < 200; i++) { in linearTriangularOOB()
713 for (int j = (byte) i; j < 200; j++) { in linearTriangularOOB()
764 for (int i = 0; i < n; i++) { in main()
765 expectEquals(i, r[i]); in main()
774 for (int i = 0; i < x.length; i++) { in main()
775 expectEquals(x[i], r[i]); in main()
809 for (int i = 0; i < 200; i++) { in main()
810 expectEquals(i <= 127 ? i + 1 : 128, t[i]); in main()