1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
|
/*
* Copyright (c) 2023, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/*
* @test
* @bug 8301489
* @summary ShortLoopOptimizer might lift instructions before their inputs
* @requires vm.compiler1.enabled
* @run main/othervm -Xcomp -XX:TieredStopAtLevel=1
* -XX:CompileOnly=compiler.c1.Test8301489::*
* compiler.c1.Test8301489
*/
package compiler.c1;
public class Test8301489 {
static int c = 0;
static int[] arr = {};
static void op2Test(int a, int b) {
// Implicit edges created during dom calculation to exception handler
if (a < 0) {
b = 0;
}
// Create two branches into next loop header block
try {
int l = arr.length;
for (int i = 0; i < l; i++) {
int d = arr[i] + arr[i];
}
}
// Exception handler as predecessor of the next loop header block
catch (ArithmeticException e) {}
// op2(a, b) as candidate for hoisting: operands are loop invariant
while (a + b < b) {}
// op2(a, b) should not be hoisted above 'if (a < 0) {...}' block
}
static void arrayLengthTest() {
float [] newArr = new float[c];
try {
for (float f : newArr) {}
}
catch (ArrayIndexOutOfBoundsException e) {}
while (54321 < newArr.length) {
newArr[c] = 123.45f;
}
}
static void negateTest(int a) {
if (a <= 111) {
a = -111;
}
int f = 0;
try {
int l = arr.length;
f--;
}
catch (NegativeArraySizeException e) {}
while (-a < f) {
f--;
}
}
static void convertTest(int a) {
if (c == 0) {
a = 0;
}
long tgt = 10;
try {
String s = String.valueOf(c);
}
catch (NumberFormatException e) {}
while ((long)a != tgt) {
tgt--;
}
}
public static void main(String[] args) {
for (int i = 0; i < 3; i++) {
op2Test(12, 34);
arrayLengthTest();
negateTest(-778);
convertTest(4812);
}
}
}
|
