1 /*
   2  * Copyright (c) 2019, Loongson Technology Co. Ltd. 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 package compiler.loopopts.superword;
  25 
  26 public class TestSuperWordOverunrolling {
  27     public static void main(String[] args) {
  28         double sum = 0.0;
  29         long start = System.currentTimeMillis();
  30         for (int i = 0; i < 5; i++) {
  31             sum += execute(128);
  32         }
  33         long end = System.currentTimeMillis();
  34         System.out.println("sum = " + sum + "; time = " + (end - start) + "ms");
  35     }
  36 
  37     public static double execute(int num_iterations) {
  38         int M = 63;
  39         byte[][] G = new byte[M][M];
  40 
  41         int Mm1 = M-1;
  42         for (int p = 0; p < num_iterations; p++) {
  43             for (int i = 1; i < Mm1; i++) {
  44                 for (int j = 1; j < Mm1; j++)
  45                     G[i][j] = G[i-1][j];
  46             }
  47         }
  48 
  49         return G[3][2];
  50     }
  51 }