1 /*
   2  * Copyright (c) 2013, 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 package org.graalvm.compiler.nodes.test;
  24 
  25 import org.junit.Assert;
  26 import org.junit.BeforeClass;
  27 import org.junit.Test;
  28 
  29 import org.graalvm.compiler.core.test.GraalCompilerTest;
  30 import org.graalvm.compiler.graph.iterators.NodePredicate;
  31 import org.graalvm.compiler.nodes.LoopBeginNode;
  32 import org.graalvm.compiler.nodes.PhiNode;
  33 import org.graalvm.compiler.nodes.StructuredGraph;
  34 import org.graalvm.compiler.nodes.StructuredGraph.AllowAssumptions;
  35 import org.graalvm.compiler.phases.common.CanonicalizerPhase;
  36 import org.graalvm.compiler.phases.tiers.PhaseContext;
  37 
  38 public class LoopPhiCanonicalizerTest extends GraalCompilerTest {
  39 
  40     private static int[] array = new int[1000];
  41 
  42     @BeforeClass
  43     public static void before() {
  44         for (int i = 0; i < array.length; i++) {
  45             array[i] = i;
  46         }
  47     }
  48 
  49     public static long loopSnippet() {
  50         int a = 0;
  51         int b = 0;
  52         int c = 0;
  53         int d = 0;
  54 
  55         long sum = 0;
  56         while (d < 1000) {
  57             sum += array[a++] + array[b++] + array[c++] + array[d++];
  58         }
  59         return sum;
  60     }
  61 
  62     @Test
  63     public void test() {
  64         StructuredGraph graph = parseEager("loopSnippet", AllowAssumptions.YES);
  65         NodePredicate loopPhis = node -> node instanceof PhiNode && ((PhiNode) node).merge() instanceof LoopBeginNode;
  66 
  67         PhaseContext context = new PhaseContext(getProviders());
  68         Assert.assertEquals(5, graph.getNodes().filter(loopPhis).count());
  69         new CanonicalizerPhase().apply(graph, context);
  70         Assert.assertEquals(2, graph.getNodes().filter(loopPhis).count());
  71 
  72         test("loopSnippet");
  73     }
  74 }