1 /* 2 * Copyright (c) 2011, 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.core.test; 24 25 import java.util.List; 26 27 import org.junit.Assert; 28 29 import org.graalvm.compiler.graph.Node; 30 import org.graalvm.compiler.graph.NodeMap; 31 import org.graalvm.compiler.nodes.StructuredGraph; 32 import org.graalvm.compiler.nodes.StructuredGraph.ScheduleResult; 33 import org.graalvm.compiler.nodes.cfg.Block; 34 import org.graalvm.compiler.phases.schedule.SchedulePhase; 35 36 public class GraphScheduleTest extends GraalCompilerTest { 37 38 protected void assertOrderedAfterSchedule(StructuredGraph graph, Node a, Node b) { 39 SchedulePhase ibp = new SchedulePhase(SchedulePhase.SchedulingStrategy.LATEST); 40 ibp.apply(graph); 41 assertOrderedAfterSchedule(graph.getLastSchedule(), a, b); 42 } 43 44 protected void assertOrderedAfterSchedule(ScheduleResult ibp, Node a, Node b) { 45 NodeMap<Block> nodeToBlock = ibp.getCFG().getNodeToBlock(); 46 Block bBlock = nodeToBlock.get(b); 47 Block aBlock = nodeToBlock.get(a); 48 49 if (bBlock == aBlock) { 50 List<Node> instructions = ibp.nodesFor(bBlock); 51 Assert.assertTrue(instructions.indexOf(b) > instructions.indexOf(a)); 52 } else { 53 Block block = bBlock; 54 while (block != null) { 55 if (block == aBlock) { 56 return; 57 } 58 block = block.getDominator(); 59 } 60 Assert.fail("block of A doesn't dominate the block of B"); 61 } 62 } 63 }