author | chegar |
Tue, 22 Mar 2016 15:26:07 +0000 | |
changeset 36694 | 182a5e7a519e |
parent 36057 | 867e857daf84 |
child 40059 | c2304140ed64 |
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 product reduction optimizations : float 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 |
* |
31 |
* @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:+SuperWordReductions -XX:LoopUnrollLimit=250 -XX:LoopMaxUnroll=2 -XX:CompileThresholdScaling=0.1 ProdRed_Double |
|
32 |
* @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:-SuperWordReductions -XX:LoopUnrollLimit=250 -XX:LoopMaxUnroll=2 -XX:CompileThresholdScaling=0.1 ProdRed_Double |
|
33 |
* |
|
34 |
* @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:+SuperWordReductions -XX:LoopUnrollLimit=250 -XX:LoopMaxUnroll=4 -XX:CompileThresholdScaling=0.1 ProdRed_Double |
|
35 |
* @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:-SuperWordReductions -XX:LoopUnrollLimit=250 -XX:LoopMaxUnroll=4 -XX:CompileThresholdScaling=0.1 ProdRed_Double |
|
36 |
* |
|
37 |
* @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:+SuperWordReductions -XX:LoopUnrollLimit=250 -XX:LoopMaxUnroll=8 -XX:CompileThresholdScaling=0.1 ProdRed_Double |
|
38 |
* @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:-SuperWordReductions -XX:LoopUnrollLimit=250 -XX:LoopMaxUnroll=8 -XX:CompileThresholdScaling=0.1 ProdRed_Double |
|
39 |
* |
|
40 |
* @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:+SuperWordReductions -XX:LoopUnrollLimit=250 -XX:LoopMaxUnroll=16 -XX:CompileThresholdScaling=0.1 ProdRed_Double |
|
41 |
* @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:-SuperWordReductions -XX:LoopUnrollLimit=250 -XX:LoopMaxUnroll=16 -XX:CompileThresholdScaling=0.1 ProdRed_Double |
|
42 |
*/ |
|
43 |
||
44 |
public class ProdRed_Double |
|
45 |
{ |
|
46 |
public static void main(String[] args) throws Exception { |
|
47 |
double[] a = new double[256*1024]; |
|
48 |
double[] b = new double[256*1024]; |
|
49 |
prodReductionInit(a,b); |
|
50 |
double valid = 2000; |
|
51 |
double total = 0; |
|
52 |
for(int j = 0; j < 2000; j++) { |
|
53 |
total = j + 1; |
|
54 |
total = prodReductionImplement(a,b, total); |
|
55 |
} |
|
56 |
if(total == valid) { |
|
57 |
System.out.println("Success"); |
|
58 |
} else { |
|
59 |
System.out.println("Invalid sum of elements variable in total: " + total); |
|
60 |
System.out.println("Expected value = " + valid); |
|
61 |
throw new Exception("Failed"); |
|
62 |
} |
|
63 |
} |
|
64 |
||
65 |
public static void prodReductionInit(double[] a, double[] b) |
|
66 |
{ |
|
67 |
for(int i = 0; i < a.length; i++) |
|
68 |
{ |
|
69 |
a[i] = i + 2; |
|
70 |
b[i] = i + 1; |
|
71 |
} |
|
72 |
} |
|
73 |
||
74 |
public static double prodReductionImplement(double[] a, double[] b, double total) |
|
75 |
{ |
|
76 |
for(int i = 0; i < a.length; i++) |
|
77 |
{ |
|
78 |
total *= a[i] - b[i]; |
|
79 |
} |
|
80 |
return total; |
|
81 |
} |
|
82 |
||
83 |
} |