org.jruby.ir.dataflow

Class DataFlowProblem<T extends DataFlowProblem<T,U>,U extends FlowGraphNode<T,U>>

java.lang.Object

org.jruby.ir.dataflow.DataFlowProblem<T,U>

Direct Known Subclasses:

LiveVariablesProblem, LoadLocalVarPlacementProblem, StoreLocalVarPlacementProblem, UnboxableOpsAnalysisProblem

public abstract class DataFlowProblem<T extends DataFlowProblem<T,U>,U extends FlowGraphNode<T,U>>
extends Object

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	DataFlowProblem.DF_Direction

Field Summary

Fields

Modifier and Type	Field and Description
DataFlowProblem.DF_Direction	direction
protected List<U>	flowGraphNodes
protected IRScope	scope

Constructor Summary

Constructors

Constructor and Description
DataFlowProblem(DataFlowProblem.DF_Direction direction)

Method Summary

Methods

Modifier and Type	Method and Description
int	addDataFlowVar()
abstract U	buildFlowGraphNode(BasicBlock bb)
void	compute_MOP_Solution()
protected LinkedList<U>	generateWorkList() Generate an ordered list of flow graph nodes in a forward or backward order depending on direction.
String	getDataFlowVarsForOutput()
int	getDFVarsCount()
U	getEntryNode()
U	getExitNode()
DataFlowProblem.DF_Direction	getFlowDirection()
U	getFlowGraphNode(BasicBlock bb)
abstract String	getName()
IRScope	getScope()
boolean	isEmpty() Are there are available data flow facts to run this problem? SSS FIXME: Silly optimization?
void	setup(IRScope scope)
String	toString()

Methods inherited from class java.lang.Object

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

Field Detail

direction

public final DataFlowProblem.DF_Direction direction

flowGraphNodes

protected List<U extends FlowGraphNode<T,U>> flowGraphNodes

scope

protected IRScope scope

Constructor Detail

DataFlowProblem

public DataFlowProblem(DataFlowProblem.DF_Direction direction)

Method Detail

buildFlowGraphNode

public abstract U buildFlowGraphNode(BasicBlock bb)

getName

public abstract String getName()

isEmpty

public boolean isEmpty()

Are there are available data flow facts to run this problem? SSS FIXME: Silly optimization?

getFlowDirection

public DataFlowProblem.DF_Direction getFlowDirection()

setup

public void setup(IRScope scope)

getScope

public IRScope getScope()

compute_MOP_Solution

public void compute_MOP_Solution()

generateWorkList

protected LinkedList<U> generateWorkList()

Generate an ordered list of flow graph nodes in a forward or backward order depending on direction.

getDFVarsCount

public int getDFVarsCount()

getDataFlowVarsForOutput

public String getDataFlowVarsForOutput()

toString

public String toString()

Overrides:

toString in class Object

getFlowGraphNode

public U getFlowGraphNode(BasicBlock bb)

getEntryNode

public U getEntryNode()

getExitNode

public U getExitNode()

addDataFlowVar

public int addDataFlowVar()