Lines Matching refs:array
70 static void narrow(int[] array, int offset) { in narrow() argument
74 if (offset < array.length) { in narrow()
77 array[offset] = 1; in narrow()
81 if (biased_offset1 < array.length) { in narrow()
84 array[biased_offset1] = 1; in narrow()
90 if (biased_offset2 < array.length) { in narrow()
93 array[biased_offset2] = 1; in narrow()
99 array[offset_sub1] = 1; // Bounds check can be eliminated. in narrow()
105 array[offset_sub2] = 1; // Bounds check can't be eliminated. in narrow()
124 static void constantIndexing1(int[] array) { in constantIndexing1() argument
126 array[5] = 11; in constantIndexing1()
127 array[4] = 11; in constantIndexing1()
152 static void $opt$noinline$constantIndexing2(int[] array) { in $opt$noinline$constantIndexing2() argument
153 array[1] = 1; in $opt$noinline$constantIndexing2()
154 array[2] = 1; in $opt$noinline$constantIndexing2()
155 array[3] = 1; in $opt$noinline$constantIndexing2()
156 array[4] = 1; in $opt$noinline$constantIndexing2()
157 if (array[1] != 1) { in $opt$noinline$constantIndexing2()
187 static void constantIndexing2b(int[] array) { in constantIndexing2b() argument
188 array[0] = 6; in constantIndexing2b()
189 array[1] = 6; in constantIndexing2b()
190 array[2] = 6; in constantIndexing2b()
191 array[3] = 6; in constantIndexing2b()
192 array[-1] = 1; // prevents the whole opt on [-1:4] in constantIndexing2b()
216 static void constantIndexing2c(int[] array) { in constantIndexing2c() argument
217 array[0] = 7; in constantIndexing2c()
218 array[1] = 7; in constantIndexing2c()
219 array[2] = 7; in constantIndexing2c()
220 array[3] = 7; in constantIndexing2c()
284 static void constantIndexing4(int[] array) { in constantIndexing4() argument
285 array[0] = -1; in constantIndexing4()
302 static void constantIndexing5(int[] array) { in constantIndexing5() argument
305 array[Integer.MAX_VALUE - 1000] = 1; in constantIndexing5()
306 array[Integer.MAX_VALUE - 999] = 1; in constantIndexing5()
307 array[Integer.MAX_VALUE - 998] = 1; in constantIndexing5()
323 static void constantIndexing6(int[] array) { in constantIndexing6() argument
324 array[3] = 111; in constantIndexing6()
325 array[4] = 111; in constantIndexing6()
350 static void constantIndexing7(int[] array, int base) { in constantIndexing7() argument
352 array[base] = 10; in constantIndexing7()
353 array[base + 1] = 20; in constantIndexing7()
354 array[base + 2] = 30; in constantIndexing7()
355 array[base + 3] = 40; in constantIndexing7()
380 static void constantIndexing8(int[] array, int base) { in constantIndexing8() argument
382 array[base - 1] = 100; in constantIndexing8()
383 array[base] = 200; in constantIndexing8()
384 array[base + 1] = 300; in constantIndexing8()
385 array[base + 2] = 400; in constantIndexing8()
411 static void constantIndexing9(int[] array, int base) { in constantIndexing9() argument
414 array[base] = 0; in constantIndexing9()
416 array[base + 2] = 2; in constantIndexing9()
417 array[base + 3] = 3; in constantIndexing9()
419 array[base + 1] = 1; in constantIndexing9()
444 static void constantIndexing10(int[] array, int base) { in constantIndexing10() argument
446 array[base] = 1; in constantIndexing10()
447 array[++base] = 2; in constantIndexing10()
448 array[++base] = 3; in constantIndexing10()
449 array[++base] = 4; in constantIndexing10()
578 static void constantIndexingForward6(int[] array) { in constantIndexingForward6() argument
580 constantIndexing6(array); in constantIndexingForward6()
615 static void loopPattern1(int[] array) { in loopPattern1() argument
616 for (int i = 0; i < array.length; i++) { in loopPattern1()
617 array[i] = 1; // Bounds check can be eliminated. in loopPattern1()
620 for (int i = 1; i < array.length; i++) { in loopPattern1()
621 array[i] = 1; // Bounds check can be eliminated. in loopPattern1()
624 for (int i = 1; i < array.length - 1; i++) { in loopPattern1()
625 array[i] = 1; // Bounds check can be eliminated. in loopPattern1()
628 for (int i = -1; i < array.length; i++) { in loopPattern1()
629 array[i] = 1; // Bounds check can't be eliminated. in loopPattern1()
632 for (int i = 0; i <= array.length; i++) { in loopPattern1()
633 array[i] = 1; // Bounds check can't be eliminated. in loopPattern1()
636 for (int i = 0; i < array.length; i += 2) { in loopPattern1()
639 array[i] = 1; in loopPattern1()
642 for (int i = 1; i < array.length; i += 2) { in loopPattern1()
645 array[i] = 1; in loopPattern1()
678 static void loopPattern2(int[] array) { in loopPattern2() argument
679 for (int i = array.length - 1; i >= 0; i--) { in loopPattern2()
680 array[i] = 1; // Bounds check can be eliminated. in loopPattern2()
683 for (int i = array.length; i > 0; i--) { in loopPattern2()
684 array[i - 1] = 1; // Bounds check can be eliminated. in loopPattern2()
687 for (int i = array.length - 1; i > 0; i--) { in loopPattern2()
688 array[i] = 1; // Bounds check can be eliminated. in loopPattern2()
691 for (int i = array.length; i >= 0; i--) { in loopPattern2()
692 array[i] = 1; // Bounds check can't be eliminated. in loopPattern2()
695 for (int i = array.length; i >= 0; i--) { in loopPattern2()
696 array[i - 1] = 1; // Bounds check can't be eliminated. in loopPattern2()
699 for (int i = array.length; i > 0; i -= 20) { in loopPattern2()
701 array[i - 1] = 1; // Bounds check can be eliminated. in loopPattern2()
714 static void loopPattern3(int[] array) { in loopPattern3() argument
717 if (random.nextInt() % 1000 == 0 && i < array.length) { in loopPattern3()
721 array[i] = 1; in loopPattern3()
752 int[] array = new int[10]; in constantNewArray() local
754 array[i] = 1; // Bounds check can be eliminated. in constantNewArray()
758 array[i] = 1; // Bounds check can't be eliminated. in constantNewArray()
761 array[0] = 1; // Bounds check can be eliminated. in constantNewArray()
762 array[9] = 1; // Bounds check can be eliminated. in constantNewArray()
763 array[10] = 1; // Bounds check can't be eliminated. in constantNewArray()
780 byte[] array = new byte[4096]; in circularBufferProducer()
783 array[i & (array.length - 1)] = readData(); in circularBufferProducer()
802 static void pyramid1(int[] array) { in pyramid1() argument
803 for (int i = 0; i < (array.length + 1) / 2; i++) { in pyramid1()
804 array[i] = i; in pyramid1()
805 array[array.length - 1 - i] = i; in pyramid1()
823 static void pyramid2(int[] array) { in pyramid2() argument
824 for (int i = 0; i < (array.length + 1) >> 1; i++) { in pyramid2()
825 array[i] = i; in pyramid2()
826 array[array.length - 1 - i] = i; in pyramid2()
844 static void pyramid3(int[] array) { in pyramid3() argument
845 for (int i = 0; i < (array.length + 1) >>> 1; i++) { in pyramid3()
846 array[i] = i; in pyramid3()
847 array[array.length - 1 - i] = i; in pyramid3()
864 static boolean isPyramid(int[] array) { in isPyramid() argument
866 int j = array.length - 1; in isPyramid()
868 if (array[i] != i) { in isPyramid()
871 if (array[j] != i) { in isPyramid()
891 public static void modArrayIndex1(int[] array) { in modArrayIndex1() argument
895 array[i % 10] = i; in modArrayIndex1()
897 array[i % array.length] = i; in modArrayIndex1()
913 public static void modArrayIndex2(int array[], int index) { in modArrayIndex2() argument
917 array[(index+i) % 10] = i; in modArrayIndex2()
918 array[(index+i) % array.length] = i; in modArrayIndex2()
957 int[] array = new int[20]; in modArrayIndex4() local
960 array[i % 10] = i; in modArrayIndex4()
961 array[i % array.length] = i; in modArrayIndex4()
1022 static void bubbleSort(int[] array) { in bubbleSort() argument
1023 for (int i = 0; i < array.length - 1; i++) { in bubbleSort()
1024 for (int j = 0; j < array.length - i - 1; j++) { in bubbleSort()
1025 if (array[j] > array[j + 1]) { in bubbleSort()
1026 int temp = array[j + 1]; in bubbleSort()
1027 array[j + 1] = array[j]; in bubbleSort()
1028 array[j] = temp; in bubbleSort()
1234 void foo1(int[] array, int start, int end, boolean expectInterpreter) { in foo1() argument
1246 array[i] = 1; in foo1()
1247 sum += array[i]; in foo1()
1274 void foo2(int[] array, int start, int end, boolean expectInterpreter) { in foo2() argument
1286 array[i] = 1; in foo2()
1287 sum += array[i]; in foo2()
1314 void foo3(int[] array, int end, boolean expectInterpreter) { in foo3() argument
1326 array[i] = 1; in foo3()
1327 sum += array[i]; in foo3()
1355 void foo4(int[] array, int end, boolean expectInterpreter) { in foo4() argument
1367 array[i - 1] = 1; in foo4()
1368 sum += array[i - 1]; in foo4()
1404 void foo5(int[] array, int end, boolean expectInterpreter) { in foo5() argument
1408 for (int i = array.length - 1 ; i >= 0; i--) { in foo5()
1409 array[i] = 1; in foo5()
1419 sum += array[i - 1]; in foo5()
1420 sum += array[i]; in foo5()
1421 sum += array[i + 1]; in foo5()
1465 void foo6(int[] array, int start, int end, boolean expectInterpreter) { in foo6() argument
1474 array[i] = (array[i-2] + array[i-1] + array[i] + array[i+1] + array[i+2]) / 5; in foo6()
1502 void foo7(int[] array, int start, int end, boolean lowEnd) { in foo7() argument
1511 sum += array[i + 1000]; in foo7()
1513 sum += array[i]; in foo7()
1585 void foo9(int[] array, boolean expectInterpreter) { in foo9() argument
1594 sum += array[i]; in foo9()
1608 void partialLooping(int[] array, int start, int end) { in partialLooping() argument
1617 array[i] = 1; in partialLooping()
1723 int[] array = new int[4]; in testUnknownBounds() local
1725 if ((array[0] != 1) && (array[1] != 1) && in testUnknownBounds()
1726 (array[2] != 0) && (array[3] != 0)) { in testUnknownBounds()
1807 int[] array = {5, 2, 3, 7, 0, 1, 6, 4}; in main()
1808 bubbleSort(array); in main()
1810 if (array[i] != i) { in main()
1815 nonzeroLength(array); in main()
1816 if (array[0] != 112) { in main()
1820 knownLength(array); in main()
1821 if (array[0] != 112 || array[1] != 1) { in main()
1824 array = new int[2]; in main()
1825 knownLength(array); in main()
1826 if (array[0] != -1 || array[1] != -2) { in main()
1830 array = new int[8]; in main()
1831 lengthAlias1(array, 8); in main()
1833 if (array[i] != 1) { in main()
1837 lengthAlias2(array, 8); in main()
1839 if (array[i] != 2) { in main()
1843 lengthAlias3(array, 8); in main()
1845 if (array[i] != 3) { in main()
1849 lengthAlias4(array); in main()
1851 if (array[i] != 4) { in main()
1856 array = new int[10]; in main()
1857 lengthAlias1(array, /*mismatched value*/ 8); in main()
1858 lengthAlias2(array, /*mismatched value*/ 8); in main()
1859 lengthAlias3(array, /*mismatched value*/ 8); in main()
1860 lengthAlias4(array); // implicit mismatch in main()
1862 if (array[i] != 0) { in main()
1868 array = new int[0]; in main()
1869 nonzeroLength(array); in main()
1870 knownLength(array); in main()
1871 lengthAlias1(array, 0); in main()
1872 lengthAlias2(array, 0); in main()
1873 lengthAlias3(array, 0); in main()
1890 array = new int[7]; in main()
1891 pyramid1(array); in main()
1892 if (!isPyramid(array)) { in main()
1896 array = new int[8]; in main()
1897 pyramid2(array); in main()
1898 if (!isPyramid(array)) { in main()
1902 java.util.Arrays.fill(array, -1); in main()
1903 pyramid3(array); in main()
1904 if (!isPyramid(array)) { in main()