001/*
002 * Copyright (c) 2011, 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.compiler.test;
024
025import java.util.*;
026
027import org.junit.*;
028
029import com.oracle.graal.graph.*;
030import com.oracle.graal.nodes.*;
031import com.oracle.graal.nodes.cfg.*;
032import com.oracle.graal.phases.schedule.*;
033
034public class GraphScheduleTest extends GraalCompilerTest {
035
036    protected void assertOrderedAfterSchedule(StructuredGraph graph, Node a, Node b) {
037        SchedulePhase ibp = new SchedulePhase(SchedulePhase.SchedulingStrategy.LATEST);
038        ibp.apply(graph);
039        assertOrderedAfterSchedule(ibp, a, b);
040    }
041
042    protected void assertOrderedAfterSchedule(SchedulePhase ibp, Node a, Node b) {
043        NodeMap<Block> nodeToBlock = ibp.getCFG().getNodeToBlock();
044        Block bBlock = nodeToBlock.get(b);
045        Block aBlock = nodeToBlock.get(a);
046
047        if (bBlock == aBlock) {
048            List<Node> instructions = ibp.nodesFor(bBlock);
049            Assert.assertTrue(instructions.indexOf(b) > instructions.indexOf(a));
050        } else {
051            Block block = bBlock;
052            while (block != null) {
053                if (block == aBlock) {
054                    return;
055                }
056                block = block.getDominator();
057            }
058            Assert.fail("block of A doesn't dominate the block of B");
059        }
060    }
061}