Mercurial > hg > graal-jvmci-8
view graal/com.oracle.graal.phases/src/com/oracle/graal/phases/graph/ReentrantNodeIterator.java @ 15145:df2ef5204f2b
Remove AbstractBeginNode, move the framestate from AbstractBeginNode to BeginStateSplitNode.
This required some changes to loop transformations: when peeling don't create duplicates for the exit proxies.
author | Gilles Duboscq <duboscq@ssw.jku.at> |
---|---|
date | Mon, 14 Apr 2014 15:21:27 +0200 |
parents | 46e708738717 |
children | 4e3c2247daf4 |
line wrap: on
line source
/* * Copyright (c) 2011, 2012, 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 com.oracle.graal.phases.graph; import java.util.*; import com.oracle.graal.graph.NodeClass.NodeClassIterator; import com.oracle.graal.nodes.*; public final class ReentrantNodeIterator { public static class LoopInfo<StateT> { public final Map<LoopEndNode, StateT> endStates = new IdentityHashMap<>(4); public final Map<LoopExitNode, StateT> exitStates = new IdentityHashMap<>(2); } public abstract static class NodeIteratorClosure<StateT> { protected abstract StateT processNode(FixedNode node, StateT currentState); protected abstract StateT merge(MergeNode merge, List<StateT> states); protected abstract StateT afterSplit(BeginNode node, StateT oldState); protected abstract Map<LoopExitNode, StateT> processLoop(LoopBeginNode loop, StateT initialState); /** * Determine whether iteration should continue in the current state. * * @param currentState */ protected boolean continueIteration(StateT currentState) { return true; } } private ReentrantNodeIterator() { // no instances allowed } public static <StateT> LoopInfo<StateT> processLoop(NodeIteratorClosure<StateT> closure, LoopBeginNode loop, StateT initialState) { HashSet<FixedNode> boundary = new HashSet<>(); for (LoopExitNode exit : loop.loopExits()) { boundary.add(exit); } Map<FixedNode, StateT> blockEndStates = apply(closure, loop, initialState, boundary); LoopInfo<StateT> info = new LoopInfo<>(); for (LoopEndNode end : loop.loopEnds()) { if (blockEndStates.containsKey(end)) { info.endStates.put(end, blockEndStates.get(end)); } } for (LoopExitNode exit : loop.loopExits()) { if (blockEndStates.containsKey(exit)) { info.exitStates.put(exit, blockEndStates.get(exit)); } } return info; } public static <StateT> Map<FixedNode, StateT> apply(NodeIteratorClosure<StateT> closure, FixedNode start, StateT initialState, Set<FixedNode> boundary) { Deque<BeginNode> nodeQueue = new ArrayDeque<>(); IdentityHashMap<FixedNode, StateT> blockEndStates = new IdentityHashMap<>(); StateT state = initialState; FixedNode current = start; do { while (current instanceof FixedWithNextNode) { if (boundary != null && boundary.contains(current)) { blockEndStates.put(current, state); current = null; } else { FixedNode next = ((FixedWithNextNode) current).next(); state = closure.processNode(current, state); current = closure.continueIteration(state) ? next : null; } } if (current != null) { state = closure.processNode(current, state); if (closure.continueIteration(state)) { NodeClassIterator successors = current.successors().iterator(); if (!successors.hasNext()) { if (current instanceof LoopEndNode) { blockEndStates.put(current, state); } else if (current instanceof EndNode) { // add the end node and see if the merge is ready for processing MergeNode merge = ((EndNode) current).merge(); if (merge instanceof LoopBeginNode) { Map<LoopExitNode, StateT> loopExitState = closure.processLoop((LoopBeginNode) merge, state); for (Map.Entry<LoopExitNode, StateT> entry : loopExitState.entrySet()) { blockEndStates.put(entry.getKey(), entry.getValue()); nodeQueue.add(entry.getKey()); } } else { assert !blockEndStates.containsKey(current); blockEndStates.put(current, state); boolean endsVisited = true; for (AbstractEndNode forwardEnd : merge.forwardEnds()) { if (!blockEndStates.containsKey(forwardEnd)) { endsVisited = false; break; } } if (endsVisited) { ArrayList<StateT> states = new ArrayList<>(merge.forwardEndCount()); for (int i = 0; i < merge.forwardEndCount(); i++) { AbstractEndNode forwardEnd = merge.forwardEndAt(i); assert blockEndStates.containsKey(forwardEnd); StateT other = blockEndStates.get(forwardEnd); states.add(other); } state = closure.merge(merge, states); current = closure.continueIteration(state) ? merge : null; continue; } } } } else { FixedNode firstSuccessor = (FixedNode) successors.next(); if (!successors.hasNext()) { current = firstSuccessor; continue; } else { while (successors.hasNext()) { BeginNode successor = (BeginNode) successors.next(); StateT successorState = closure.afterSplit(successor, state); if (closure.continueIteration(successorState)) { blockEndStates.put(successor, successorState); nodeQueue.add(successor); } } state = closure.afterSplit((BeginNode) firstSuccessor, state); current = closure.continueIteration(state) ? firstSuccessor : null; continue; } } } } // get next queued block if (nodeQueue.isEmpty()) { return blockEndStates; } else { current = nodeQueue.removeFirst(); state = blockEndStates.get(current); assert !(current instanceof MergeNode) && current instanceof BeginNode; } } while (true); } }