Mercurial > hg > graal-jvmci-8
view graal/GraalCompiler/src/com/sun/c1x/graph/IR.java @ 2778:2ac7b30b7290
Enabled new block finding algorithm.
author | Thomas Wuerthinger <thomas@wuerthinger.net> |
---|---|
date | Tue, 24 May 2011 21:39:45 +0200 |
parents | 3e4d992fd312 |
children | 93ec3f067420 |
line wrap: on
line source
/* * Copyright (c) 2009, 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.sun.c1x.graph; import java.util.*; import com.oracle.graal.graph.*; import com.oracle.max.graal.schedule.*; import com.sun.c1x.*; import com.sun.c1x.debug.*; import com.sun.c1x.ir.*; import com.sun.c1x.lir.*; import com.sun.c1x.observer.*; /** * This class implements the overall container for the HIR (high-level IR) graph * and directs its construction, optimization, and finalization. */ public class IR { /** * The compilation associated with this IR. */ public final C1XCompilation compilation; /** * The start block of this IR. */ public LIRBlock startBlock; private int maxLocks; /** * The linear-scan ordered list of blocks. */ private List<LIRBlock> orderedBlocks; /** * Creates a new IR instance for the specified compilation. * @param compilation the compilation */ public IR(C1XCompilation compilation) { this.compilation = compilation; } public Map<Value, LIRBlock> valueToBlock; /** * Builds the graph, optimizes it, and computes the linear scan block order. */ public void build() { if (C1XOptions.PrintTimers) { C1XTimers.HIR_CREATE.start(); } buildGraph(); if (C1XOptions.PrintTimers) { C1XTimers.HIR_CREATE.stop(); C1XTimers.HIR_OPTIMIZE.start(); } CriticalEdgeFinder finder = new CriticalEdgeFinder(this); getHIRStartBlock().iteratePreOrder(finder); finder.splitCriticalEdges(); Schedule schedule = new Schedule(this.compilation.graph); List<Block> blocks = schedule.getBlocks(); List<LIRBlock> lirBlocks = new ArrayList<LIRBlock>(); Map<Block, LIRBlock> map = new HashMap<Block, LIRBlock>(); for (Block b : blocks) { LIRBlock block = new LIRBlock(b.blockID()); block.setExceptionEntry(b.isExceptionEntry()); map.put(b, block); block.setInstructions(b.getInstructions()); block.setLinearScanNumber(b.blockID()); lirBlocks.add(block); } for (Block b : blocks) { for (Block succ : b.getSuccessors()) { if (succ.isExceptionEntry()) { map.get(b).getExceptionHandlerSuccessors().add(map.get(succ)); } else { map.get(b).blockSuccessors().add(map.get(succ)); } } for (Block pred : b.getPredecessors()) { map.get(b).blockPredecessors().add(map.get(pred)); } } // TODO(tw): Schedule nodes within a block. //computeLinearScanOrder(); // assert orderedBlocks.size() == lirBlocks.size(); orderedBlocks = lirBlocks; valueToBlock = new HashMap<Value, LIRBlock>(); for (LIRBlock b : orderedBlocks) { for (Instruction i : b.getInstructions()) { valueToBlock.put(i, b); } } startBlock = valueToBlock.get(getHIRStartBlock()); assert startBlock != null; verifyAndPrint("After linear scan order"); ComputeLinearScanOrder clso = new ComputeLinearScanOrder(lirBlocks.size(), startBlock); orderedBlocks = clso.linearScanOrder(); this.compilation.stats.loopCount = clso.numLoops(); int z = 0; for (LIRBlock b : orderedBlocks) { b.setLinearScanNumber(z++); /* TTY.println(); for (Instruction i : b.getInstructions()) { if (i instanceof BlockBegin) { TTY.println("BlockBegin #" + ((BlockBegin) i).blockID); TTY.print(" => succs: "); for (LIRBlock succBlock : b.blockSuccessors()) { TTY.print("B#" + ((BlockBegin) succBlock.getInstructions().get(0)).blockID); } TTY.print(" => ex: "); for (LIRBlock succBlock : b.getExceptionHandlerSuccessors()) { TTY.print("B#" + ((BlockBegin) succBlock.getInstructions().get(0)).blockID); } TTY.println(); } else { TTY.println(i.getClass().getSimpleName() + " #" + i.id()); } }*/ } if (C1XOptions.PrintTimers) { C1XTimers.HIR_OPTIMIZE.stop(); } } private void buildGraph() { // Graph builder must set the startBlock and the osrEntryBlock new GraphBuilder(compilation, this, compilation.graph).build(); verifyAndPrint("After graph building"); if (C1XOptions.PrintCompilation) { TTY.print(String.format("%3d blocks | ", this.numberOfBlocks())); } } private Map<Value, LIRBlock> computeLinearScanOrder() { return makeLinearScanOrder(); } private Map<Value, LIRBlock> makeLinearScanOrder() { /* if (orderedBlocks == null) { Map<Value, LIRBlock> valueToBlock = new HashMap<Value, LIRBlock>(); ComputeLinearScanOrder computeLinearScanOrder = new ComputeLinearScanOrder(compilation.stats.blockCount, getHIRStartBlock()); List<BlockBegin> blocks = computeLinearScanOrder.linearScanOrder(); orderedBlocks = new ArrayList<LIRBlock>(); int z = 0; for (BlockBegin bb : blocks) { LIRBlock lirBlock = new LIRBlock(z); lirBlock.getInstructions().add(bb); valueToBlock.put(bb, lirBlock); lirBlock.setLinearScanNumber(bb.linearScanNumber()); // TODO(tw): Initialize LIRBlock.linearScanLoopHeader and LIRBlock.linearScanLoopEnd orderedBlocks.add(lirBlock); ++z; } z = 0; for (BlockBegin bb : blocks) { LIRBlock lirBlock = orderedBlocks.get(z); for (int i = 0; i < bb.numberOfPreds(); ++i) { lirBlock.blockPredecessors().add(valueToBlock.get(bb.predAt(i).block())); } BlockEnd end = bb.end(); for (int i = 0; i < end.blockSuccessorCount(); ++i) { lirBlock.blockSuccessors().add(valueToBlock.get(end.blockSuccessor(i))); } Instruction first = bb; while (first != null) { lirBlock.getInstructions().add(first); first = first.next(); } ++z; } }*/ return null; //return valueToBlock; } /** * Gets the linear scan ordering of blocks as a list. * @return the blocks in linear scan order */ public List<LIRBlock> linearScanOrder() { return orderedBlocks; } private void print(boolean cfgOnly) { if (!TTY.isSuppressed()) { TTY.println("IR for " + compilation.method); final InstructionPrinter ip = new InstructionPrinter(TTY.out()); final BlockPrinter bp = new BlockPrinter(this, ip, cfgOnly); getHIRStartBlock().iteratePreOrder(bp); } } /** * Verifies the IR and prints it out if the relevant options are set. * @param phase the name of the phase for printing */ public void verifyAndPrint(String phase) { if (C1XOptions.PrintHIR && !TTY.isSuppressed()) { TTY.println(phase); print(false); } if (compilation.compiler.isObserved()) { compilation.compiler.fireCompilationEvent(new CompilationEvent(compilation, phase, getHIRStartBlock(), true, false)); } } /** * Creates and inserts a new block between this block and the specified successor, * altering the successor and predecessor lists of involved blocks appropriately. * @param source the source of the edge * @param target the successor before which to insert a block * @return the new block inserted */ public BlockBegin splitEdge(BlockBegin source, BlockBegin target) { int bci = -2; int backEdgeIndex = target.predecessors().indexOf(source.end()); // create new successor and mark it for special block order treatment BlockBegin newSucc = new BlockBegin(bci, nextBlockNumber(), false, compilation.graph); List<Integer> removePhiInputs = null; for (int i = backEdgeIndex + 1; i < target.predecessors().size(); ++i) { if (target.predecessors().get(i) == source.end()) { if (removePhiInputs == null) { removePhiInputs = new ArrayList<Integer>(); } removePhiInputs.add(i); } } // This goto is not a safepoint. Goto e = new Goto(target, compilation.graph); newSucc.appendNext(e); e.reorderSuccessor(0, backEdgeIndex); // link predecessor to new block source.end().substituteSuccessor(target, newSucc); if (removePhiInputs != null && removePhiInputs.size() > 0) { for (Node n : target.usages()) { if (n instanceof Phi) { Phi phi = (Phi) n; int correction = 0; for (int index : removePhiInputs) { phi.removeInput(index - correction); correction++; } } } } return newSucc; } public int nextBlockNumber() { return compilation.stats.blockCount++; } public int numberOfBlocks() { return compilation.stats.blockCount; } public int numLoops() { return compilation.stats.loopCount; } /** * Updates the maximum number of locks held at any one time. * * @param locks a lock count that will replace the current {@linkplain #maxLocks() max locks} if it is greater */ public void updateMaxLocks(int locks) { if (locks > maxLocks) { maxLocks = locks; } } /** * Gets the number of locks. * @return the number of locks */ public final int maxLocks() { return maxLocks; } public BlockBegin getHIRStartBlock() { return (BlockBegin) compilation.graph.start().successors().get(0); } }