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