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) 2019, 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 8229496
* @summary Verify that zero check is executed before division/modulo operation.
* @requires vm.compiler2.enabled
* @run main/othervm -Xbatch -XX:LoopUnrollLimit=0
* -XX:CompileCommand=dontinline,compiler.loopopts.TestDivZeroCheckControl::test*
* compiler.loopopts.TestDivZeroCheckControl
*/
/*
* @test
* @summary Verify that zero check is executed before division/modulo operation.
* @requires vm.graal.enabled
* @run main/othervm -Xbatch
* -XX:CompileCommand=dontinline,compiler.loopopts.TestDivZeroCheckControl::test*
* compiler.loopopts.TestDivZeroCheckControl
*/
package compiler.loopopts;
public class TestDivZeroCheckControl {
public static int test1(int div, int array[]) {
int res = 0;
for (int i = 0; i < 256; i++) {
int j = 0;
do {
array[i] = i;
try {
res = 1 % div;
} catch (ArithmeticException ex) { }
} while (++j < 9);
}
return res;
}
// Same as test1 but with division instead of modulo
public static int test2(int div, int array[]) {
int res = 0;
for (int i = 0; i < 256; i++) {
int j = 0;
do {
array[i] = i;
try {
res = 1 / div;
} catch (ArithmeticException ex) { }
} while (++j < 9);
}
return res;
}
// Same as test1 but with long
public static long test3(long div, int array[]) {
long res = 0;
for (int i = 0; i < 256; i++) {
int j = 0;
do {
array[i] = i;
try {
res = 1L % div;
} catch (ArithmeticException ex) { }
} while (++j < 9);
}
return res;
}
// Same as test2 but with long
public static long test4(long div, int array[]) {
long res = 0;
for (int i = 0; i < 256; i++) {
int j = 0;
do {
array[i] = i;
try {
res = 1L / div;
} catch (ArithmeticException ex) { }
} while (++j < 9);
}
return res;
}
public static void main(String[] args) {
int array[] = new int[256];
for (int i = 0; i < 50_000; ++i) {
test1(0, array);
test2(0, array);
test3(0, array);
test4(0, array);
}
}
}
|
