com.oracle.graal.phases.common

Class LoweringPhase

java.lang.Object

com.oracle.graal.phases.BasePhase<PhaseContext>

com.oracle.graal.phases.common.LoweringPhase

public class LoweringPhase
extends BasePhase<PhaseContext>

Processes all Lowerable nodes to do their lowering.

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
(package private) static class	LoweringPhase.DummyGuardHandle
static class	LoweringPhase.Frame<T extends LoweringPhase.Frame<?>>
(package private) class	LoweringPhase.LoweringToolImpl
(package private) static class	LoweringPhase.ProcessBlockState
private class	LoweringPhase.Round

Field Summary

Fields

Modifier and Type	Field and Description
private CanonicalizerPhase	canonicalizer
private LoweringTool.LoweringStage	loweringStage

Fields inherited from class com.oracle.graal.phases.BasePhase

BEFORE_PHASE_DUMP_LEVEL, PHASE_DUMP_LEVEL

Constructor Summary

Constructors

Constructor and Description
LoweringPhase(CanonicalizerPhase canonicalizer, LoweringTool.LoweringStage loweringStage)

Method Summary

Modifier and Type	Method and Description
private boolean	checkPostLowering(StructuredGraph graph, PhaseContext context) Checks that second lowering of a given graph did not introduce any new nodes.
private static boolean	checkPostNodeLowering(Node node, LoweringPhase.LoweringToolImpl loweringTool, Graph.Mark preLoweringMark, Collection<Node> unscheduledUsages) Checks that lowering of a given node did not introduce any new Lowerable nodes that could be lowered in the current LoweringPhase.
private void	lower(StructuredGraph graph, PhaseContext context, int i)
static void	processBlock(LoweringPhase.Frame<?> rootFrame) This state-machine resembles the following recursion:
protected void	run(StructuredGraph graph, PhaseContext context)

Methods inherited from class com.oracle.graal.phases.BasePhase

apply, apply, createName, getName

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

canonicalizer

private final CanonicalizerPhase canonicalizer

loweringStage

private final LoweringTool.LoweringStage loweringStage

Constructor Detail

LoweringPhase

public LoweringPhase(CanonicalizerPhase canonicalizer,
                     LoweringTool.LoweringStage loweringStage)

Method Detail

checkPostLowering

private boolean checkPostLowering(StructuredGraph graph,
                                  PhaseContext context)

Checks that second lowering of a given graph did not introduce any new nodes.

Parameters:

graph - a graph that was just lowered

Throws:

AssertionError - if the check fails

run

protected void run(StructuredGraph graph,
                   PhaseContext context)

Specified by:

run in class BasePhase<PhaseContext>

lower

private void lower(StructuredGraph graph,
                   PhaseContext context,
                   int i)

checkPostNodeLowering

private static boolean checkPostNodeLowering(Node node,
                                             LoweringPhase.LoweringToolImpl loweringTool,
                                             Graph.Mark preLoweringMark,
                                             Collection<Node> unscheduledUsages)

Checks that lowering of a given node did not introduce any new Lowerable nodes that could be lowered in the current LoweringPhase. Such nodes must be recursively lowered as part of lowering node.

Parameters:

node - a node that was just lowered

preLoweringMark - the graph mark before node was lowered

unscheduledUsages - set of node's usages that were unscheduled before it was lowered

Throws:

AssertionError - if the check fails

processBlock

public static void processBlock(LoweringPhase.Frame<?> rootFrame)

This state-machine resembles the following recursion:

 void processBlock(Block block) {
     preprocess();
     // Process always reached block first.
     Block alwaysReachedBlock = block.getPostdominator();
     if (alwaysReachedBlock != null && alwaysReachedBlock.getDominator() == block) {
         processBlock(alwaysReachedBlock);
     }
 
     // Now go for the other dominators.
     for (Block dominated : block.getDominated()) {
         if (dominated != alwaysReachedBlock) {
             assert dominated.getDominator() == block;
             processBlock(dominated);
         }
     }
     postprocess();
 }
 

This is necessary, as the recursive implementation quickly exceed the stack depth on SPARC.

Parameters:

rootFrame - contains the starting block.