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
|
/*
* Copyright (c) 2022, Arm Limited. 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.
*/
package compiler.c2;
import compiler.lib.ir_framework.*;
import jdk.test.lib.Asserts;
import jdk.test.lib.Utils;
import java.util.Random;
/*
* @test
* @bug 8294816
* @summary Test Math.min/max vectorization miscompilation for integer subwords
* @library /test/lib /
* @requires vm.compiler2.enabled
* @run driver compiler.c2.TestMinMaxSubword
*/
public class TestMinMaxSubword {
private static final int LENGTH = 256;
private static final Random RANDOM = Utils.getRandomInstance();
private static int val = 65536;
private static short[] sa;
private static short[] sb;
private static byte[] ba;
private static byte[] bb;
static {
sa = new short[LENGTH];
sb = new short[LENGTH];
ba = new byte[LENGTH];
bb = new byte[LENGTH];
for(int i = 0; i < LENGTH; i++) {
sa[i] = (short) (RANDOM.nextInt(999) + 1);
ba[i] = (byte) (RANDOM.nextInt(99) + 1);
}
}
// Ensure vector max/min instructions are not generated for integer subword types
// as Java APIs for Math.min/max do not support integer subword types and superword
// should not generate vectorized Min/Max nodes for them.
@Test
@IR(failOn = {IRNode.MIN_VI, IRNode.MIN_VF, IRNode.MIN_VD})
public static void testMinShort() {
for (int i = 0; i < LENGTH; i++) {
sb[i] = (short) Math.min(sa[i], val);
}
}
@Run(test = "testMinShort")
public static void testMinShort_runner() {
testMinShort();
for (int i = 0; i < LENGTH; i++) {
Asserts.assertEquals(sb[i], sa[i]);
}
}
@Test
@IR(failOn = {IRNode.MAX_VI, IRNode.MAX_VF, IRNode.MAX_VD})
public static void testMaxShort() {
for (int i = 0; i < LENGTH; i++) {
sb[i] = (short) Math.max(sa[i], val);
}
}
@Run(test = "testMaxShort")
public static void testMaxShort_runner() {
testMaxShort();
for (int i = 0; i < LENGTH; i++) {
Asserts.assertEquals(sb[i], (short) 0);
}
}
@Test
@IR(failOn = {IRNode.MIN_VI, IRNode.MIN_VF, IRNode.MIN_VD})
public static void testMinByte() {
for (int i = 0; i < LENGTH; i++) {
bb[i] = (byte) Math.min(ba[i], val);
}
}
@Run(test = "testMinByte")
public static void testMinByte_runner() {
testMinByte();
for (int i = 0; i < LENGTH; i++) {
Asserts.assertEquals(bb[i], ba[i]);
}
}
@Test
@IR(failOn = {IRNode.MAX_VI, IRNode.MAX_VF, IRNode.MAX_VD})
public static void testMaxByte() {
for (int i = 0; i < LENGTH; i++) {
bb[i] = (byte) Math.max(ba[i], val);
}
}
@Run(test = "testMaxByte")
public static void testMaxByte_runner() {
testMaxByte();
for (int i = 0; i < LENGTH; i++) {
Asserts.assertEquals(bb[i], (byte) 0);
}
}
public static void main(String[] args) {
TestFramework.run();
}
}
|
