Mercurial > hg > graal-compiler
view graal/com.oracle.max.graal.compiler/src/com/oracle/graal/compiler/types/ScheduledNodeIterator.java @ 5060:4ed4295ce15f
Update import statements.
author | Thomas Wuerthinger <thomas.wuerthinger@oracle.com> |
---|---|
date | Thu, 08 Mar 2012 19:11:12 +0100 |
parents | ed559a528128 |
children |
line wrap: on
line source
/* * Copyright (c) 2011, 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 com.oracle.graal.compiler.types; import java.util.*; import com.oracle.graal.compiler.graph.*; import com.oracle.graal.graph.*; import com.oracle.graal.nodes.*; public abstract class ScheduledNodeIterator<T extends MergeableState<T>> { private final NodeBitMap visitedEnds; private final Deque<ScheduledNode> nodeQueue; private final IdentityHashMap<ScheduledNode, T> nodeStates; private final FixedNode start; protected T state; public ScheduledNodeIterator(FixedNode start, T initialState) { visitedEnds = start.graph().createNodeBitMap(); nodeQueue = new ArrayDeque<>(); nodeStates = new IdentityHashMap<>(); this.start = start; this.state = initialState; } public void apply() { ScheduledNode current = start; do { if (current instanceof LoopBeginNode) { state.loopBegin((LoopBeginNode) current); nodeStates.put(current, state); state = state.clone(); loopBegin((LoopBeginNode) current); current = current.scheduledNext(); assert current != null; } else if (current instanceof LoopEndNode) { loopEnd((LoopEndNode) current); finishLoopEnds((LoopEndNode) current); current = nextQueuedNode(); } else if (current instanceof MergeNode) { merge((MergeNode) current); current = current.scheduledNext(); assert current != null; } else if (current instanceof EndNode) { end((EndNode) current); queueMerge((EndNode) current); current = nextQueuedNode(); } else if (current instanceof ControlSplitNode) { controlSplit((ControlSplitNode) current); queueSuccessors(current); current = nextQueuedNode(); } else { ScheduledNode next = current.scheduledNext(); node(current); if (next == null) { current = nextQueuedNode(); } else { current = next; } } } while(current != null); } private void queueSuccessors(ScheduledNode x) { nodeStates.put(x, state); for (Node node : x.successors()) { if (node != null) { nodeQueue.addFirst((FixedNode) node); } } } private ScheduledNode nextQueuedNode() { int maxIterations = nodeQueue.size(); while (maxIterations-- > 0) { ScheduledNode node = nodeQueue.removeFirst(); if (node instanceof MergeNode) { MergeNode merge = (MergeNode) node; state = nodeStates.get(merge.forwardEndAt(0)).clone(); ArrayList<T> states = new ArrayList<>(merge.forwardEndCount() - 1); for (int i = 1; i < merge.forwardEndCount(); i++) { T other = nodeStates.get(merge.forwardEndAt(i)); assert other != null; states.add(other); } boolean ready = state.merge(merge, states); if (ready) { return merge; } else { nodeQueue.addLast(merge); } } else { assert node.predecessor() != null; state = nodeStates.get(node.predecessor()).clone(); state.afterSplit((FixedNode) node); return node; } } return null; } private void queueMerge(EndNode end) { assert !visitedEnds.isMarked(end); assert !nodeStates.containsKey(end); nodeStates.put(end, state); visitedEnds.mark(end); MergeNode merge = end.merge(); boolean endsVisited = true; for (int i = 0; i < merge.forwardEndCount(); i++) { if (!visitedEnds.isMarked(merge.forwardEndAt(i))) { endsVisited = false; break; } } if (endsVisited) { nodeQueue.add(merge); } } private void finishLoopEnds(LoopEndNode end) { assert !visitedEnds.isMarked(end); assert !nodeStates.containsKey(end); nodeStates.put(end, state); visitedEnds.mark(end); LoopBeginNode begin = end.loopBegin(); boolean endsVisited = true; for (LoopEndNode le : begin.loopEnds()) { if (!visitedEnds.isMarked(le)) { endsVisited = false; break; } } if (endsVisited) { ArrayList<T> states = new ArrayList<>(begin.loopEnds().count()); for (LoopEndNode le : begin.orderedLoopEnds()) { states.add(nodeStates.get(le)); } T loopBeginState = nodeStates.get(begin); if (loopBeginState != null) { loopBeginState.loopEnds(begin, states); } } } protected abstract void node(ScheduledNode node); protected void end(EndNode endNode) { node(endNode); } protected void merge(MergeNode merge) { node(merge); } protected void loopBegin(LoopBeginNode loopBegin) { node(loopBegin); } protected void loopEnd(LoopEndNode loopEnd) { node(loopEnd); } protected void controlSplit(ControlSplitNode controlSplit) { node(controlSplit); } }