Top Fields Constructors Methods

org.jruby.ir.dataflow

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

Class Inheritance

extends Object

java.lang.Object
org.jruby.ir.dataflow.FlowGraphNode

Known Direct Subclasses

org.jruby.ir.dataflow.analyses.DefinedVariableNode, org.jruby.ir.dataflow.analyses.LiveVariableNode, org.jruby.ir.dataflow.analyses.LoadLocalVarPlacementNode, org.jruby.ir.dataflow.analyses.StoreLocalVarPlacementNode, org.jruby.ir.dataflow.analyses.UnboxableOpsAnalysisNode

Imports

org.jruby.dirgra.Edge, org.jruby.ir.instructions.Instr, org.jruby.ir.representations.BasicBlock, .CFG, java.util.BitSet, .List, .ListIterator

Field Summary

Modifier and Type	Field and Description
protected final BasicBlock	basicBlock
protected final T	problem
private final BasicBlock	rescuer

Constructor Summary

Access	Constructor and Description
public	FlowGraphNode(T problem, BasicBlock basicBlock)

Method Summary

Modifier and Type	Method and Description
public abstract void	applyPreMeetHandler() Initialize this data flow node to compute the new solution This is done before iteratively calling the MEET operator.
public abstract void	applyTransferFunction(Instr i) Apply transfer function to the instruction
public abstract void	buildDataFlowVars(Instr i) Builds the data-flow variables (or facts) for a particular instruction.
public void	buildDataFlowVars() Builds the data-flow variables (or facts) for a particular node.
public abstract void	compute_MEET(Edge<BasicBlock, CFG.EdgeType> e, U pred) "MEET" current solution of "IN/OUT" with "OUT/IN(pred)", where "pred" is a predecessor of the current node!
public void	computeDataFlowInfo(List<U> workList, BitSet bbSet)
public void	computeDataFlowInfoBackward(List<U> workList, BitSet bbSet)
public void	computeDataFlowInfoForward(List<U> workList, BitSet bbSet)
public void	finalizeSolution() Any required cleanup of state after applying transfer function
public BasicBlock	getBB()
public CFG	getCFG() Get the control flow graph
public U	getExceptionTargetNode()
public boolean	hasExceptionsRescued()
public void	init() Initialize this data flow node for solving the current problem This is done after building dataflow variables for the problem.
public void	initSolution() Any setting up of state/initialization before applying transfer function
private void	processDestBB(List<U> workList, BitSet bbSet, BasicBlock d)
public abstract boolean	solutionChanged() Did dataflow solution for this node change from last time?

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

basicBlock	back to summary
protected final BasicBlock basicBlock

problem	back to summary
protected final T problem

rescuer	back to summary
private final BasicBlock rescuer

Constructor Detail

FlowGraphNode	back to summary
public FlowGraphNode(T problem, BasicBlock basicBlock)

Method Detail

applyPreMeetHandler	back to summary
public abstract void applyPreMeetHandler() Initialize this data flow node to compute the new solution This is done before iteratively calling the MEET operator.

applyTransferFunction	back to summary
public abstract void applyTransferFunction(Instr i) Apply transfer function to the instruction

buildDataFlowVars	back to summary
public abstract void buildDataFlowVars(Instr i) Builds the data-flow variables (or facts) for a particular instruction.

buildDataFlowVars	back to summary
public void buildDataFlowVars() Builds the data-flow variables (or facts) for a particular node. Need only create the DF_Var for them to be added to the problem. Goes over the instructions in this basic block and collect all relevant LOCAL data flow vars for this problem!

compute_MEET	back to summary
public abstract void compute_MEET(Edge<BasicBlock, CFG.EdgeType> e, U pred) "MEET" current solution of "IN/OUT" with "OUT/IN(pred)", where "pred" is a predecessor of the current node! The choice of "IN/OUT" is determined by the direction of data flow.

computeDataFlowInfo	back to summary
public void computeDataFlowInfo(List<U> workList, BitSet bbSet)

computeDataFlowInfoBackward	back to summary
public void computeDataFlowInfoBackward(List<U> workList, BitSet bbSet)

computeDataFlowInfoForward	back to summary
public void computeDataFlowInfoForward(List<U> workList, BitSet bbSet)

finalizeSolution	back to summary
public void finalizeSolution() Any required cleanup of state after applying transfer function

getBB	back to summary
public BasicBlock getBB()

getCFG	back to summary
public CFG getCFG() Get the control flow graph

getExceptionTargetNode	back to summary
public U getExceptionTargetNode()

hasExceptionsRescued	back to summary
public boolean hasExceptionsRescued()

init	back to summary
public void init() Initialize this data flow node for solving the current problem This is done after building dataflow variables for the problem.

initSolution	back to summary
public void initSolution() Any setting up of state/initialization before applying transfer function

processDestBB	back to summary
private void processDestBB(List<U> workList, BitSet bbSet, BasicBlock d)

solutionChanged	back to summary
public abstract boolean solutionChanged() Did dataflow solution for this node change from last time?