Lines Matching refs:array
72 static void narrow(int[] array, int offset) { in narrow() argument
76 if (offset < array.length) { in narrow()
79 array[offset] = 1; in narrow()
83 if (biased_offset1 < array.length) { in narrow()
86 array[biased_offset1] = 1; in narrow()
92 if (biased_offset2 < array.length) { in narrow()
95 array[biased_offset2] = 1; in narrow()
101 array[offset_sub1] = 1; // Bounds check can be eliminated. in narrow()
107 array[offset_sub2] = 1; // Bounds check can't be eliminated. in narrow()
126 static void constantIndexing1(int[] array) { in constantIndexing1() argument
128 array[5] = 11; in constantIndexing1()
129 array[4] = 11; in constantIndexing1()
154 static void $opt$noinline$constantIndexing2(int[] array) { in $opt$noinline$constantIndexing2() argument
155 array[1] = 1; in $opt$noinline$constantIndexing2()
156 array[2] = 1; in $opt$noinline$constantIndexing2()
157 array[3] = 1; in $opt$noinline$constantIndexing2()
158 array[4] = 1; in $opt$noinline$constantIndexing2()
159 if (array[1] != 1) { in $opt$noinline$constantIndexing2()
189 static void constantIndexing2b(int[] array) { in constantIndexing2b() argument
190 array[0] = 6; in constantIndexing2b()
191 array[1] = 6; in constantIndexing2b()
192 array[2] = 6; in constantIndexing2b()
193 array[3] = 6; in constantIndexing2b()
194 array[-1] = 1; // prevents the whole opt on [-1:4] in constantIndexing2b()
218 static void constantIndexing2c(int[] array) { in constantIndexing2c() argument
219 array[0] = 7; in constantIndexing2c()
220 array[1] = 7; in constantIndexing2c()
221 array[2] = 7; in constantIndexing2c()
222 array[3] = 7; in constantIndexing2c()
286 static void constantIndexing4(int[] array) { in constantIndexing4() argument
287 array[0] = -1; in constantIndexing4()
304 static void constantIndexing5(int[] array) { in constantIndexing5() argument
307 array[Integer.MAX_VALUE - 1000] = 1; in constantIndexing5()
308 array[Integer.MAX_VALUE - 999] = 1; in constantIndexing5()
309 array[Integer.MAX_VALUE - 998] = 1; in constantIndexing5()
325 static void constantIndexing6(int[] array) { in constantIndexing6() argument
326 array[3] = 111; in constantIndexing6()
327 array[4] = 111; in constantIndexing6()
352 static void constantIndexing7(int[] array, int base) { in constantIndexing7() argument
354 array[base] = 10; in constantIndexing7()
355 array[base + 1] = 20; in constantIndexing7()
356 array[base + 2] = 30; in constantIndexing7()
357 array[base + 3] = 40; in constantIndexing7()
382 static void constantIndexing8(int[] array, int base) { in constantIndexing8() argument
384 array[base - 1] = 100; in constantIndexing8()
385 array[base] = 200; in constantIndexing8()
386 array[base + 1] = 300; in constantIndexing8()
387 array[base + 2] = 400; in constantIndexing8()
413 static void constantIndexing9(int[] array, int base) { in constantIndexing9() argument
416 array[base] = 0; in constantIndexing9()
418 array[base + 2] = 2; in constantIndexing9()
419 array[base + 3] = 3; in constantIndexing9()
421 array[base + 1] = 1; in constantIndexing9()
446 static void constantIndexing10(int[] array, int base) { in constantIndexing10() argument
448 array[base] = 1; in constantIndexing10()
449 array[++base] = 2; in constantIndexing10()
450 array[++base] = 3; in constantIndexing10()
451 array[++base] = 4; in constantIndexing10()
580 static void constantIndexingForward6(int[] array) { in constantIndexingForward6() argument
582 constantIndexing6(array); in constantIndexingForward6()
617 static void loopPattern1(int[] array) { in loopPattern1() argument
618 for (int i = 0; i < array.length; i++) { in loopPattern1()
619 array[i] = 1; // Bounds check can be eliminated. in loopPattern1()
622 for (int i = 1; i < array.length; i++) { in loopPattern1()
623 array[i] = 1; // Bounds check can be eliminated. in loopPattern1()
626 for (int i = 1; i < array.length - 1; i++) { in loopPattern1()
627 array[i] = 1; // Bounds check can be eliminated. in loopPattern1()
630 for (int i = -1; i < array.length; i++) { in loopPattern1()
631 array[i] = 1; // Bounds check can't be eliminated. in loopPattern1()
634 for (int i = 0; i <= array.length; i++) { in loopPattern1()
635 array[i] = 1; // Bounds check can't be eliminated. in loopPattern1()
638 for (int i = 0; i < array.length; i += 2) { in loopPattern1()
641 array[i] = 1; in loopPattern1()
644 for (int i = 1; i < array.length; i += 2) { in loopPattern1()
647 array[i] = 1; in loopPattern1()
680 static void loopPattern2(int[] array) { in loopPattern2() argument
681 for (int i = array.length - 1; i >= 0; i--) { in loopPattern2()
682 array[i] = 1; // Bounds check can be eliminated. in loopPattern2()
685 for (int i = array.length; i > 0; i--) { in loopPattern2()
686 array[i - 1] = 1; // Bounds check can be eliminated. in loopPattern2()
689 for (int i = array.length - 1; i > 0; i--) { in loopPattern2()
690 array[i] = 1; // Bounds check can be eliminated. in loopPattern2()
693 for (int i = array.length; i >= 0; i--) { in loopPattern2()
694 array[i] = 1; // Bounds check can't be eliminated. in loopPattern2()
697 for (int i = array.length; i >= 0; i--) { in loopPattern2()
698 array[i - 1] = 1; // Bounds check can't be eliminated. in loopPattern2()
701 for (int i = array.length; i > 0; i -= 20) { in loopPattern2()
703 array[i - 1] = 1; // Bounds check can be eliminated. in loopPattern2()
716 static void loopPattern3(int[] array) { in loopPattern3() argument
719 if (random.nextInt() % 1000 == 0 && i < array.length) { in loopPattern3()
723 array[i] = 1; in loopPattern3()
754 int[] array = new int[10]; in constantNewArray() local
756 array[i] = 1; // Bounds check can be eliminated. in constantNewArray()
760 array[i] = 1; // Bounds check can't be eliminated. in constantNewArray()
763 array[0] = 1; // Bounds check can be eliminated. in constantNewArray()
764 array[9] = 1; // Bounds check can be eliminated. in constantNewArray()
765 array[10] = 1; // Bounds check can't be eliminated. in constantNewArray()
782 byte[] array = new byte[4096]; in circularBufferProducer()
785 array[i & (array.length - 1)] = readData(); in circularBufferProducer()
804 static void pyramid1(int[] array) { in pyramid1() argument
805 for (int i = 0; i < (array.length + 1) / 2; i++) { in pyramid1()
806 array[i] = i; in pyramid1()
807 array[array.length - 1 - i] = i; in pyramid1()
825 static void pyramid2(int[] array) { in pyramid2() argument
826 for (int i = 0; i < (array.length + 1) >> 1; i++) { in pyramid2()
827 array[i] = i; in pyramid2()
828 array[array.length - 1 - i] = i; in pyramid2()
846 static void pyramid3(int[] array) { in pyramid3() argument
847 for (int i = 0; i < (array.length + 1) >>> 1; i++) { in pyramid3()
848 array[i] = i; in pyramid3()
849 array[array.length - 1 - i] = i; in pyramid3()
866 static boolean isPyramid(int[] array) { in isPyramid() argument
868 int j = array.length - 1; in isPyramid()
870 if (array[i] != i) { in isPyramid()
873 if (array[j] != i) { in isPyramid()
893 public static void modArrayIndex1(int[] array) { in modArrayIndex1() argument
897 array[i % 10] = i; in modArrayIndex1()
899 array[i % array.length] = i; in modArrayIndex1()
915 public static void modArrayIndex2(int array[], int index) { in modArrayIndex2() argument
919 array[(index+i) % 10] = i; in modArrayIndex2()
920 array[(index+i) % array.length] = i; in modArrayIndex2()
959 int[] array = new int[20]; in modArrayIndex4() local
962 array[i % 10] = i; in modArrayIndex4()
963 array[i % array.length] = i; in modArrayIndex4()
1024 static void bubbleSort(int[] array) { in bubbleSort() argument
1025 for (int i = 0; i < array.length - 1; i++) { in bubbleSort()
1026 for (int j = 0; j < array.length - i - 1; j++) { in bubbleSort()
1027 if (array[j] > array[j + 1]) { in bubbleSort()
1028 int temp = array[j + 1]; in bubbleSort()
1029 array[j + 1] = array[j]; in bubbleSort()
1030 array[j] = temp; in bubbleSort()
1236 void foo1(int[] array, int start, int end, boolean expectInterpreter) { in foo1() argument
1248 array[i] = 1; in foo1()
1249 sum += array[i]; in foo1()
1276 void foo2(int[] array, int start, int end, boolean expectInterpreter) { in foo2() argument
1288 array[i] = 1; in foo2()
1289 sum += array[i]; in foo2()
1316 void foo3(int[] array, int end, boolean expectInterpreter) { in foo3() argument
1328 array[i] = 1; in foo3()
1329 sum += array[i]; in foo3()
1357 void foo4(int[] array, int end, boolean expectInterpreter) { in foo4() argument
1369 array[i - 1] = 1; in foo4()
1370 sum += array[i - 1]; in foo4()
1406 void foo5(int[] array, int end, boolean expectInterpreter) { in foo5() argument
1410 for (int i = array.length - 1 ; i >= 0; i--) { in foo5()
1411 array[i] = 1; in foo5()
1421 sum += array[i - 1]; in foo5()
1422 sum += array[i]; in foo5()
1423 sum += array[i + 1]; in foo5()
1467 void foo6(int[] array, int start, int end, boolean expectInterpreter) { in foo6() argument
1476 array[i] = (array[i-2] + array[i-1] + array[i] + array[i+1] + array[i+2]) / 5; in foo6()
1504 void foo7(int[] array, int start, int end, boolean lowEnd) { in foo7() argument
1513 sum += array[i + 1000]; in foo7()
1515 sum += array[i]; in foo7()
1587 void foo9(int[] array, boolean expectInterpreter) { in foo9() argument
1596 sum += array[i]; in foo9()
1610 void partialLooping(int[] array, int start, int end) { in partialLooping() argument
1619 array[i] = 1; in partialLooping()
1725 int[] array = new int[4]; in testUnknownBounds() local
1727 if ((array[0] != 1) && (array[1] != 1) && in testUnknownBounds()
1728 (array[2] != 0) && (array[3] != 0)) { in testUnknownBounds()
1783 int[] array = {1, 2, 3, 4, 5}; in $noinline$testSetZeroToRange() local
1792 (lower < 0) || (lower >= array.length) || (upper >= array.length); in $noinline$testSetZeroToRange()
1794 $noinline$setZeroToRange(array, start, len); in $noinline$testSetZeroToRange()
1799 $noinline$checkZerosForSetZeroToRange(array, start, len); in $noinline$testSetZeroToRange()
1890 int[] array = {5, 2, 3, 7, 0, 1, 6, 4}; in main()
1891 bubbleSort(array); in main()
1893 if (array[i] != i) { in main()
1898 nonzeroLength(array); in main()
1899 if (array[0] != 112) { in main()
1903 knownLength(array); in main()
1904 if (array[0] != 112 || array[1] != 1) { in main()
1907 array = new int[2]; in main()
1908 knownLength(array); in main()
1909 if (array[0] != -1 || array[1] != -2) { in main()
1913 array = new int[8]; in main()
1914 lengthAlias1(array, 8); in main()
1916 if (array[i] != 1) { in main()
1920 lengthAlias2(array, 8); in main()
1922 if (array[i] != 2) { in main()
1926 lengthAlias3(array, 8); in main()
1928 if (array[i] != 3) { in main()
1932 lengthAlias4(array); in main()
1934 if (array[i] != 4) { in main()
1939 array = new int[10]; in main()
1940 lengthAlias1(array, /*mismatched value*/ 8); in main()
1941 lengthAlias2(array, /*mismatched value*/ 8); in main()
1942 lengthAlias3(array, /*mismatched value*/ 8); in main()
1943 lengthAlias4(array); // implicit mismatch in main()
1945 if (array[i] != 0) { in main()
1951 array = new int[0]; in main()
1952 nonzeroLength(array); in main()
1953 knownLength(array); in main()
1954 lengthAlias1(array, 0); in main()
1955 lengthAlias2(array, 0); in main()
1956 lengthAlias3(array, 0); in main()
1973 array = new int[7]; in main()
1974 pyramid1(array); in main()
1975 if (!isPyramid(array)) { in main()
1979 array = new int[8]; in main()
1980 pyramid2(array); in main()
1981 if (!isPyramid(array)) { in main()
1985 java.util.Arrays.fill(array, -1); in main()
1986 pyramid3(array); in main()
1987 if (!isPyramid(array)) { in main()