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
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
|
/*
* Copyright (c) 2021, 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 8271954
* @requires vm.compiler2.enabled
* @summary A pinned Cast node on the UCT projection of a predicate is as input for the UCT phi node for the original
* loop, the fast and slow loop resulting in a dominance failure. These data nodes need to be updated while
* unswitching a loop.
* @run main/othervm -Xcomp -XX:-TieredCompilation -XX:CompileCommand=compileonly,compiler.loopopts.TestUnswitchWithSunkNodes::test*
* compiler.loopopts.TestUnswitchWithSunkNodes
*/
package compiler.loopopts;
public class TestUnswitchWithSunkNodes {
static int iFld, iFld2, iFld3 = 1, iFld4 = 1;
static long instanceCount;
static double dFld;
static boolean bFld;
static int iArrFld[] = new int[10];
static {
init(iArrFld);
}
public static void main(String[] strArr) {
// The testcases with Divisions have additional control inputs which need to be taken care of
testNoDiamond();
testNoDiamondDiv();
testWithDiamond();
testWithDiamondDiv1();
testWithDiamondDiv2();
testWithDiamondOneLongOneShortPath();
testWithDiamondComplex();
testWithDiamondComplexDiv();
}
static void testNoDiamond() {
int i, i2 = 10, i21, i22, i24, i26 = 41724, iArr2[] = new int[10];
double d;
float f2;
init(iArr2);
i = 1;
while (++i < 219) {
for (d = 15; 305 > d; ++d) {
if (bFld) {
instanceCount = i2;
i2 = (((i2 + 3) + iFld2) + iFld3) - iFld4;
}
for (f2 = 5; 87 > f2; ++f2) {
i2 = (int) instanceCount;
for (i22 = 1; 2 > i22; i22++) {
if (bFld) {
iArr2[1] += 190L;
}
}
for (i24 = 1; 2 > i24; i24++) {
switch (i) {
case 88:
i26 += (i24);
}
}
}
}
}
}
static void testNoDiamondDiv() {
int i, i2 = 10, i21, i22, i24, i26 = 41724, iArr2[] = new int[10];
double d;
float f2;
init(iArr2);
i = 1;
while (++i < 219) {
for (d = 15; 305 > d; ++d) {
if (bFld) {
instanceCount = i2;
i2 = (((i2 + 3) + iFld2) + iFld3) / iFld4;
}
for (f2 = 5; 87 > f2; ++f2) {
i2 = (int) instanceCount;
for (i22 = 1; 2 > i22; i22++) {
if (bFld) {
iArr2[1] += 190L;
}
}
for (i24 = 1; 2 > i24; i24++) {
switch (i) {
case 88:
i26 += (i24);
}
}
}
}
}
}
static void testWithDiamond() {
int i, i2 = 10, i21, i22, i24, i26 = 41724, iArr2[] = new int[10];
double d;
float f2;
init(iArr2);
i = 1;
while (++i < 219) {
for (d = 15; 305 > d; ++d) {
if (bFld) {
instanceCount = i2;
double d1 = (double) i2;
i2 = (int)((d1 + iFld4) - (d1 + iFld));
}
for (f2 = 5; 87 > f2; ++f2) {
i2 = (int) instanceCount;
for (i22 = 1; 2 > i22; i22++) {
if (bFld) {
iArr2[1] += 190L;
}
}
for (i24 = 1; 2 > i24; i24++) {
switch (i) {
case 88:
i26 += (i24);
}
}
}
}
}
}
static void testWithDiamondDiv1() {
int i, i2 = 10, i21, i22, i24, i26 = 41724, iArr2[] = new int[10];
double d;
float f2;
init(iArr2);
i = 1;
while (++i < 219) {
for (d = 15; 305 > d; ++d) {
if (bFld) {
i2 = (i2 / iFld4) - (i2 / iFld3);
}
for (f2 = 5; 87 > f2; ++f2) {
i2 = (int) instanceCount;
for (i22 = 1; 2 > i22; i22++) {
if (bFld) {
iArr2[1] += 190L;
}
}
for (i24 = 1; 2 > i24; i24++) {
switch (i) {
case 88:
i26 += (i24);
}
}
}
}
}
}
static void testWithDiamondDiv2() {
int i, i2 = 10, i21, i22, i24, i26 = 41724, iArr2[] = new int[10];
double d;
float f2;
init(iArr2);
i = 1;
while (++i < 219) {
for (d = 15; 305 > d; ++d) {
if (bFld) {
instanceCount = i2;
int i3 = (int)d;
i2 = (i3 / iFld4) - (i3 / iFld3);
}
for (f2 = 5; 87 > f2; ++f2) {
i2 = (int) instanceCount;
for (i22 = 1; 2 > i22; i22++) {
if (bFld) {
iArr2[1] += 190L;
}
}
for (i24 = 1; 2 > i24; i24++) {
switch (i) {
case 88:
i26 += (i24);
}
}
}
}
}
}
static void testWithDiamondOneLongOneShortPath() {
int i, i2 = 10, i21, i22, i24, i26 = 41724, iArr2[] = new int[10];
double d;
float f2;
init(iArr2);
i = 1;
while (++i < 219) {
for (d = 15; 305 > d; ++d) {
if (bFld) {
instanceCount = i2;
double d1 = (double)i2;
i2 = (int)((d1 + 3 + iFld2 + iFld3 + iFld4) - (d1 + iFld));
}
for (f2 = 5; 87 > f2; ++f2) {
i2 = (int) instanceCount;
for (i22 = 1; 2 > i22; i22++) {
if (bFld) {
iArr2[1] += 190L;
}
}
for (i24 = 1; 2 > i24; i24++) {
switch (i) {
case 88:
i26 += (i24);
}
}
}
}
}
}
static void testWithDiamondComplex() {
int i, i2 = 10, i21, i22, i24, i26 = 41724, iArr2[] = new int[10];
double d;
float f2;
init(iArr2);
i = 1;
while (++i < 219) {
for (d = 15; 305 > d; ++d) {
if (bFld) {
instanceCount = i2;
i2 += 4;
float l = (float)i2;
i2 = (int)((l + 3) - (l + iFld));
double d1 = (double)i2;
i2 = (int)((d1 + 3) - (d1 + iFld) - (d1 * iFld2));
i2 = (int)((l + 3) - (l + iFld) - (l * iFld2) + (d1 - iFld2) + (d1 / iFld3));
d1 = (double)i2;
i2 = (int)((d1 + 3) - (d1 + iFld) - (d1 * iFld2) + (d1 - iFld2) + (d1 / iFld3));
i2 += dFld;
l = (float)i2;
i2 = (int)((l + 3) - (l + iFld) - (l * iFld2) + (d1 - iFld2) + (d1 / iFld3) - (d1 + iFld) - (d1 * iFld2) + (d1 - iFld2) + (d1 / iFld3));
d1 = (double)i2;
i2 = (int)((d1 + 3) - (d1 + iFld) - (d1 * iFld2) + (d1 - iFld2) + (d1 / iFld3) + (d1 + 3) - (d1 + iFld) - (d1 * iFld2) + (d1 - iFld2) + (d1 / iFld3));
d1 = (double) i2;
i2 = (int) ((d1 + 3 + iFld2 + iFld3 + iFld4) - (d1 + iFld));
}
for (f2 = 5; 87 > f2; ++f2) {
i2 = (int) instanceCount;
for (i22 = 1; 2 > i22; i22++) {
if (bFld) {
iArr2[1] += 190L;
}
}
for (i24 = 1; 2 > i24; i24++) {
switch (i) {
case 88:
i26 += (i24);
}
}
}
}
}
}
static void testWithDiamondComplexDiv() {
int i, i2 = 10, i21, i22, i24, i26 = 41724, iArr2[] = new int[10];
double d;
float f2;
init(iArr2);
i = 1;
while (++i < 219) {
for (d = 15; 305 > d; ++d) {
if (bFld) {
instanceCount = i2;
int i3 = (int)d;
i2 = (i3 / iFld4) - (i3 / iFld3);
double d1 = (double) i2;
i3 = (int)((d1 + iFld4) - (d1 + iFld));
i2 = (i3 / iFld4) - (i3 / iFld3);
}
for (f2 = 5; 87 > f2; ++f2) {
i2 = (int) instanceCount;
for (i22 = 1; 2 > i22; i22++) {
if (bFld) {
iArr2[1] += 190L;
}
}
for (i24 = 1; 2 > i24; i24++) {
switch (i) {
case 88:
i26 += (i24);
}
}
}
}
}
}
public static void init(int[] a) {
for (int j = 0; j < a.length; j++) {
a[j] = j;
}
}
}
|
