Mercurial > hg > graal-jvmci-8
view graal/GraalCompiler/src/com/oracle/max/graal/schedule/Block.java @ 2805:c3f64b66fc78
Towards removing the next pointer from Constant and ArithmeticOp
author | Thomas Wuerthinger <thomas@wuerthinger.net> |
---|---|
date | Fri, 27 May 2011 19:57:56 +0200 |
parents | 2af109bec0c0 |
children | 1cd59ca9ac86 |
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.max.graal.schedule; import java.util.*; import com.oracle.graal.graph.*; import com.sun.c1x.ir.*; public class Block { private int blockID; private final List<Block> successors = new ArrayList<Block>(); private final List<Block> predecessors = new ArrayList<Block>(); private List<Node> instructions = new ArrayList<Node>(); private boolean exceptionEntry; private Block dominator; private final List<Block> dominators = new ArrayList<Block>(); private Node firstNode; private Node lastNode; public Node firstNode() { return firstNode; } public void setFirstNode(Node node) { this.firstNode = node; } public Node lastNode() { return lastNode; } public void setLastNode(Node node) { this.lastNode = node; } public List<Block> getSuccessors() { return Collections.unmodifiableList(successors); } public void setDominator(Block dominator) { assert this.dominator == null; assert dominator != null; this.dominator = dominator; dominator.dominators.add(this); } public List<Block> getDominators() { return Collections.unmodifiableList(dominators); } public List<Node> getInstructions() { return instructions; } public List<Block> getPredecessors() { return Collections.unmodifiableList(predecessors); } public Block(int blockID) { this.blockID = blockID; } public void addSuccessor(Block other) { successors.add(other); other.predecessors.add(this); } public int blockID() { return blockID; } public void setExceptionEntry(boolean b) { exceptionEntry = b; } public boolean isExceptionEntry() { return exceptionEntry; } /** * Iterate over this block, its exception handlers, and its successors, in that order. * * @param closure the closure to apply to each block */ public void iteratePreOrder(BlockClosure closure) { // XXX: identity hash map might be too slow, consider a boolean array or a mark field iterate(new IdentityHashMap<Block, Block>(), closure); } private void iterate(IdentityHashMap<Block, Block> mark, BlockClosure closure) { if (!mark.containsKey(this)) { mark.put(this, this); closure.apply(this); iterateReverse(mark, closure, this.successors); } } private void iterateReverse(IdentityHashMap<Block, Block> mark, BlockClosure closure, List<Block> list) { for (int i = list.size() - 1; i >= 0; i--) { list.get(i).iterate(mark, closure); } } @Override public String toString() { return "B" + blockID; } public Block dominator() { return dominator; } public void setInstructions(List<Node> instructions) { this.instructions = instructions; } }