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