001/*
002 * Copyright (c) 2013, 2014, Oracle and/or its affiliates. All rights reserved.
003 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
004 *
005 * This code is free software; you can redistribute it and/or modify it
006 * under the terms of the GNU General Public License version 2 only, as
007 * published by the Free Software Foundation.
008 *
009 * This code is distributed in the hope that it will be useful, but WITHOUT
010 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
011 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
012 * version 2 for more details (a copy is included in the LICENSE file that
013 * accompanied this code).
014 *
015 * You should have received a copy of the GNU General Public License version
016 * 2 along with this work; if not, write to the Free Software Foundation,
017 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
018 *
019 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
020 * or visit www.oracle.com if you need additional information or have any
021 * questions.
022 */
023package com.oracle.graal.nodes.test;
024
025import org.junit.*;
026
027import com.oracle.graal.compiler.test.*;
028import com.oracle.graal.graph.iterators.*;
029import com.oracle.graal.nodes.*;
030import com.oracle.graal.nodes.StructuredGraph.AllowAssumptions;
031import com.oracle.graal.phases.common.*;
032import com.oracle.graal.phases.tiers.*;
033
034public class LoopPhiCanonicalizerTest extends GraalCompilerTest {
035
036    private static int[] array = new int[1000];
037
038    @BeforeClass
039    public static void before() {
040        for (int i = 0; i < array.length; i++) {
041            array[i] = i;
042        }
043    }
044
045    public static long loopSnippet() {
046        int a = 0;
047        int b = 0;
048        int c = 0;
049        int d = 0;
050
051        long sum = 0;
052        while (d < 1000) {
053            sum += array[a++] + array[b++] + array[c++] + array[d++];
054        }
055        return sum;
056    }
057
058    @Test
059    public void test() {
060        StructuredGraph graph = parseEager("loopSnippet", AllowAssumptions.YES);
061        NodePredicate loopPhis = node -> node instanceof PhiNode && ((PhiNode) node).merge() instanceof LoopBeginNode;
062
063        PhaseContext context = new PhaseContext(getProviders());
064        Assert.assertEquals(5, graph.getNodes().filter(loopPhis).count());
065        new CanonicalizerPhase().apply(graph, context);
066        Assert.assertEquals(2, graph.getNodes().filter(loopPhis).count());
067
068        test("loopSnippet");
069    }
070}