1 /* 2 * Copyright (c) 2014, 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 * @summary Add C2 x86 Superword support for scalar product reduction optimizations : int test 28 * 29 * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:+SuperWordReductions -XX:LoopUnrollLimit=250 -XX:LoopMaxUnroll=2 ProdRed_Int 30 * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:-SuperWordReductions -XX:LoopUnrollLimit=250 -XX:LoopMaxUnroll=2 ProdRed_Int 31 * 32 * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:+SuperWordReductions -XX:LoopUnrollLimit=250 -XX:LoopMaxUnroll=4 ProdRed_Int 33 * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:-SuperWordReductions -XX:LoopUnrollLimit=250 -XX:LoopMaxUnroll=4 ProdRed_Int 34 * 35 * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:+SuperWordReductions -XX:LoopUnrollLimit=250 -XX:LoopMaxUnroll=8 ProdRed_Int 36 * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:-SuperWordReductions -XX:LoopUnrollLimit=250 -XX:LoopMaxUnroll=8 ProdRed_Int 37 * 38 * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:+SuperWordReductions -XX:LoopUnrollLimit=250 -XX:LoopMaxUnroll=16 ProdRed_Int 39 * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:-SuperWordReductions -XX:LoopUnrollLimit=250 -XX:LoopMaxUnroll=16 ProdRed_Int 40 */ 41 42 public class ProdRed_Int 43 { 44 public static void main(String[] args) throws Exception { 45 int[] a = new int[256*1024]; 46 int[] b = new int[256*1024]; 47 prodReductionInit(a,b); 48 int valid = -100663295; 49 int total = 1; 50 for(int j = 0; j < 20000; j++) { 51 total = prodReductionImplement(a,b,total); 52 } 53 if(total == valid) { 54 System.out.println("Success"); 55 } else { 56 System.out.println("Invalid sum of elements variable in total: " + total); 57 System.out.println("Expected value = " + valid); 58 throw new Exception("Failed"); 59 } 60 } 61 62 public static void prodReductionInit(int[] a, int[] b) 63 { 64 for(int i = 0; i < a.length; i++) 65 { 66 a[i] = i + 2; 67 b[i] = i + 1; 68 } 69 } 70 71 public static int prodReductionImplement(int[] a, int[] b, int total) 72 { 73 for(int i = 0; i < a.length; i++) 74 { 75 total *= a[i] + b[i]; 76 } 77 return total; 78 } 79 80 }