| /* |
| * Copyright (c) 2011, Oracle and/or its affiliates. All rights reserved. |
| * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| * |
| * This code is free software; you can redistribute it and/or modify it |
| * under the terms of the GNU General Public License version 2 only, as |
| * published by the Free Software Foundation. |
| * |
| * This code is distributed in the hope that it will be useful, but WITHOUT |
| * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| * version 2 for more details (a copy is included in the LICENSE file that |
| * accompanied this code). |
| * |
| * You should have received a copy of the GNU General Public License version |
| * 2 along with this work; if not, write to the Free Software Foundation, |
| * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| * |
| * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| * or visit www.oracle.com if you need additional information or have any |
| * questions. |
| */ |
| package org.graalvm.compiler.phases.common.inlining.walker; |
| |
| import java.util.ArrayDeque; |
| import java.util.Deque; |
| import java.util.Iterator; |
| import java.util.LinkedList; |
| |
| import org.graalvm.compiler.graph.Node; |
| import org.graalvm.compiler.graph.NodeBitMap; |
| import org.graalvm.compiler.nodes.AbstractEndNode; |
| import org.graalvm.compiler.nodes.AbstractMergeNode; |
| import org.graalvm.compiler.nodes.ControlSinkNode; |
| import org.graalvm.compiler.nodes.ControlSplitNode; |
| import org.graalvm.compiler.nodes.EndNode; |
| import org.graalvm.compiler.nodes.FixedNode; |
| import org.graalvm.compiler.nodes.FixedWithNextNode; |
| import org.graalvm.compiler.nodes.Invoke; |
| import org.graalvm.compiler.nodes.LoopBeginNode; |
| import org.graalvm.compiler.nodes.LoopEndNode; |
| import org.graalvm.compiler.nodes.StartNode; |
| import org.graalvm.compiler.nodes.StructuredGraph; |
| import org.graalvm.compiler.nodes.java.MethodCallTargetNode; |
| |
| /** |
| * Given a graph, visit all fixed nodes in dominator-based order, collecting in the process the |
| * {@link Invoke} nodes with {@link MethodCallTargetNode}. Such list of callsites is returned by |
| * {@link #apply()} |
| */ |
| public class InliningIterator { |
| |
| private final StartNode start; |
| private final Deque<FixedNode> nodeQueue; |
| private final NodeBitMap queuedNodes; |
| |
| public InliningIterator(StructuredGraph graph) { |
| this.start = graph.start(); |
| this.nodeQueue = new ArrayDeque<>(); |
| this.queuedNodes = graph.createNodeBitMap(); |
| assert start.isAlive(); |
| } |
| |
| public LinkedList<Invoke> apply() { |
| LinkedList<Invoke> invokes = new LinkedList<>(); |
| FixedNode current; |
| forcedQueue(start); |
| |
| while ((current = nextQueuedNode()) != null) { |
| assert current.isAlive(); |
| |
| if (current instanceof Invoke && ((Invoke) current).callTarget() instanceof MethodCallTargetNode) { |
| if (current != start) { |
| invokes.addLast((Invoke) current); |
| } |
| queueSuccessors(current); |
| } else if (current instanceof LoopBeginNode) { |
| queueSuccessors(current); |
| } else if (current instanceof LoopEndNode) { |
| // nothing to do |
| } else if (current instanceof AbstractMergeNode) { |
| queueSuccessors(current); |
| } else if (current instanceof FixedWithNextNode) { |
| queueSuccessors(current); |
| } else if (current instanceof EndNode) { |
| queueMerge((EndNode) current); |
| } else if (current instanceof ControlSinkNode) { |
| // nothing to do |
| } else if (current instanceof ControlSplitNode) { |
| queueSuccessors(current); |
| } else { |
| assert false : current; |
| } |
| } |
| |
| assert invokes.size() == count(start.graph().getInvokes()); |
| return invokes; |
| } |
| |
| private void queueSuccessors(FixedNode x) { |
| for (Node node : x.successors()) { |
| queue(node); |
| } |
| } |
| |
| private void queue(Node node) { |
| if (node != null && !queuedNodes.isMarked(node)) { |
| forcedQueue(node); |
| } |
| } |
| |
| private void forcedQueue(Node node) { |
| queuedNodes.mark(node); |
| nodeQueue.addFirst((FixedNode) node); |
| } |
| |
| private FixedNode nextQueuedNode() { |
| if (nodeQueue.isEmpty()) { |
| return null; |
| } |
| |
| FixedNode result = nodeQueue.removeFirst(); |
| assert queuedNodes.isMarked(result); |
| return result; |
| } |
| |
| private void queueMerge(AbstractEndNode end) { |
| AbstractMergeNode merge = end.merge(); |
| if (!queuedNodes.isMarked(merge) && visitedAllEnds(merge)) { |
| queuedNodes.mark(merge); |
| nodeQueue.add(merge); |
| } |
| } |
| |
| private boolean visitedAllEnds(AbstractMergeNode merge) { |
| for (int i = 0; i < merge.forwardEndCount(); i++) { |
| if (!queuedNodes.isMarked(merge.forwardEndAt(i))) { |
| return false; |
| } |
| } |
| return true; |
| } |
| |
| private static int count(Iterable<Invoke> invokes) { |
| int count = 0; |
| Iterator<Invoke> iterator = invokes.iterator(); |
| while (iterator.hasNext()) { |
| iterator.next(); |
| count++; |
| } |
| return count; |
| } |
| } |