| author | tpivovarova |
| Tue, 12 Jul 2016 18:24:48 +0300 | |
| changeset 40059 | c2304140ed64 |
| parent 36057 | 867e857daf84 |
| child 41705 | 332239c052cc |
| permissions | -rw-r--r-- |
| 30211 | 1 |
/* |
2 |
* Copyright (c) 2015, Oracle and/or its affiliates. All rights reserved. |
|
3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
|
4 |
* |
|
5 |
* This code is free software; you can redistribute it and/or modify it |
|
6 |
* under the terms of the GNU General Public License version 2 only, as |
|
7 |
* published by the Free Software Foundation. |
|
8 |
* |
|
9 |
* This code is distributed in the hope that it will be useful, but WITHOUT |
|
10 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
11 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
12 |
* version 2 for more details (a copy is included in the LICENSE file that |
|
13 |
* accompanied this code). |
|
14 |
* |
|
15 |
* You should have received a copy of the GNU General Public License version |
|
16 |
* 2 along with this work; if not, write to the Free Software Foundation, |
|
17 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
|
18 |
* |
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
20 |
* or visit www.oracle.com if you need additional information or have any |
|
21 |
* questions. |
|
22 |
* |
|
23 |
*/ |
|
24 |
||
25 |
/** |
|
26 |
* @test |
|
27 |
* @bug 8074981 |
|
28 |
* @summary Add C2 x86 Superword support for scalar sum reduction optimizations : int test |
|
|
36057
867e857daf84
8149123: [TESTBUG] compiler/loopopts/superword/SumRed* tests running on non-x86 platforms
thartmann
parents:
30211
diff
changeset
|
29 |
* @requires os.arch=="x86" | os.arch=="i386" | os.arch=="amd64" | os.arch=="x86_64" | os.arch=="aarch64" |
| 30211 | 30 |
* |
| 40059 | 31 |
* @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:LoopUnrollLimit=250 |
32 |
* -XX:CompileThresholdScaling=0.1 |
|
33 |
* -XX:+SuperWordReductions |
|
34 |
* -XX:LoopMaxUnroll=2 |
|
35 |
* compiler.loopopts.superword.SumRed_Int |
|
36 |
* @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:LoopUnrollLimit=250 |
|
37 |
* -XX:CompileThresholdScaling=0.1 |
|
38 |
* -XX:-SuperWordReductions |
|
39 |
* -XX:LoopMaxUnroll=2 |
|
40 |
* compiler.loopopts.superword.SumRed_Int |
|
| 30211 | 41 |
* |
| 40059 | 42 |
* @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:LoopUnrollLimit=250 |
43 |
* -XX:CompileThresholdScaling=0.1 |
|
44 |
* -XX:+SuperWordReductions |
|
45 |
* -XX:LoopMaxUnroll=4 |
|
46 |
* compiler.loopopts.superword.SumRed_Int |
|
47 |
* @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:LoopUnrollLimit=250 |
|
48 |
* -XX:CompileThresholdScaling=0.1 |
|
49 |
* -XX:-SuperWordReductions |
|
50 |
* -XX:LoopMaxUnroll=4 |
|
51 |
* compiler.loopopts.superword.SumRed_Int |
|
| 30211 | 52 |
* |
| 40059 | 53 |
* @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:LoopUnrollLimit=250 |
54 |
* -XX:CompileThresholdScaling=0.1 |
|
55 |
* -XX:+SuperWordReductions |
|
56 |
* -XX:LoopMaxUnroll=8 |
|
57 |
* compiler.loopopts.superword.SumRed_Int |
|
58 |
* @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:LoopUnrollLimit=250 |
|
59 |
* -XX:CompileThresholdScaling=0.1 |
|
60 |
* -XX:-SuperWordReductions |
|
61 |
* -XX:LoopMaxUnroll=8 |
|
62 |
* compiler.loopopts.superword.SumRed_Int |
|
| 30211 | 63 |
* |
| 40059 | 64 |
* @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:LoopUnrollLimit=250 |
65 |
* -XX:CompileThresholdScaling=0.1 |
|
66 |
* -XX:+SuperWordReductions |
|
67 |
* -XX:LoopMaxUnroll=16 |
|
68 |
* compiler.loopopts.superword.SumRed_Int |
|
69 |
* @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:LoopUnrollLimit=250 |
|
70 |
* -XX:CompileThresholdScaling=0.1 |
|
71 |
* -XX:-SuperWordReductions |
|
72 |
* -XX:LoopMaxUnroll=16 |
|
73 |
* compiler.loopopts.superword.SumRed_Int |
|
| 30211 | 74 |
*/ |
75 |
||
| 40059 | 76 |
package compiler.loopopts.superword; |
77 |
||
78 |
public class SumRed_Int {
|
|
79 |
public static void main(String[] args) throws Exception {
|
|
80 |
int[] a = new int[256 * 1024]; |
|
81 |
int[] b = new int[256 * 1024]; |
|
82 |
int[] c = new int[256 * 1024]; |
|
83 |
int[] d = new int[256 * 1024]; |
|
84 |
sumReductionInit(a, b, c); |
|
85 |
int total = 0; |
|
86 |
int valid = 262144000; |
|
87 |
for (int j = 0; j < 2000; j++) {
|
|
88 |
total = sumReductionImplement(a, b, c, d, total); |
|
89 |
} |
|
90 |
if (total == valid) {
|
|
91 |
System.out.println("Success");
|
|
92 |
} else {
|
|
93 |
System.out.println("Invalid sum of elements variable in total: " + total);
|
|
94 |
System.out.println("Expected value = " + valid);
|
|
95 |
throw new Exception("Failed");
|
|
96 |
} |
|
| 30211 | 97 |
} |
98 |
||
| 40059 | 99 |
public static void sumReductionInit( |
100 |
int[] a, |
|
101 |
int[] b, |
|
102 |
int[] c) {
|
|
103 |
for (int j = 0; j < 1; j++) {
|
|
104 |
for (int i = 0; i < a.length; i++) {
|
|
105 |
a[i] = i * 1 + j; |
|
106 |
b[i] = i * 1 - j; |
|
107 |
c[i] = i + j; |
|
108 |
} |
|
109 |
} |
|
| 30211 | 110 |
} |
111 |
||
| 40059 | 112 |
public static int sumReductionImplement( |
113 |
int[] a, |
|
114 |
int[] b, |
|
115 |
int[] c, |
|
116 |
int[] d, |
|
117 |
int total) {
|
|
118 |
for (int i = 0; i < a.length; i++) {
|
|
119 |
d[i] = (a[i] * b[i]) + (a[i] * c[i]) + (b[i] * c[i]); |
|
120 |
total += d[i]; |
|
121 |
} |
|
122 |
return total; |
|
| 30211 | 123 |
} |
124 |
||
125 |
} |