public abstract class DataFlowProblem
extends java.lang.Object
Modifier and Type | Class and Description |
---|---|
static class |
DataFlowProblem.DF_Direction |
Modifier and Type | Field and Description |
---|---|
DataFlowProblem.DF_Direction |
direction |
protected java.util.List<FlowGraphNode> |
flowGraphNodes |
protected IRScope |
scope |
Constructor and Description |
---|
DataFlowProblem(DataFlowProblem.DF_Direction d) |
Modifier and Type | Method and Description |
---|---|
abstract FlowGraphNode |
buildFlowGraphNode(BasicBlock bb) |
void |
compute_MOP_Solution() |
java.lang.String |
getDataFlowVarsForOutput() |
int |
getDFVarsCount() |
DataFlowProblem.DF_Direction |
getFlowDirection() |
protected FlowGraphNode |
getFlowGraphNode(BasicBlock b) |
java.lang.Iterable<BasicBlock> |
getIncomingSourcesOf(BasicBlock bb) |
abstract java.lang.String |
getName() |
java.lang.Iterable<BasicBlock> |
getOutgoingDestinationsOf(BasicBlock bb) |
IRScope |
getScope() |
boolean |
isEmpty()
Are there are available data flow facts to run this problem? SSS FIXME: Silly optimization?
|
void |
setup(IRScope scope) |
java.lang.String |
toString() |
public final DataFlowProblem.DF_Direction direction
protected java.util.List<FlowGraphNode> flowGraphNodes
protected IRScope scope
public DataFlowProblem(DataFlowProblem.DF_Direction d)
public abstract FlowGraphNode buildFlowGraphNode(BasicBlock bb)
public abstract java.lang.String getName()
public boolean isEmpty()
public DataFlowProblem.DF_Direction getFlowDirection()
public void setup(IRScope scope)
public IRScope getScope()
public void compute_MOP_Solution()
public int getDFVarsCount()
public java.lang.Iterable<BasicBlock> getIncomingSourcesOf(BasicBlock bb)
public java.lang.Iterable<BasicBlock> getOutgoingDestinationsOf(BasicBlock bb)
public java.lang.String getDataFlowVarsForOutput()
public java.lang.String toString()
toString
in class java.lang.Object
protected FlowGraphNode getFlowGraphNode(BasicBlock b)
Copyright © 2002-2009 JRuby Team. All Rights Reserved.