Package javassist.bytecode.analysis
Class ControlFlow.Node
java.lang.Object
javassist.bytecode.analysis.ControlFlow.Node
- Enclosing class:
- ControlFlow
A node of (post) dominator trees.
-
Field Summary
FieldsModifier and TypeFieldDescriptionprivate ControlFlow.Blockprivate ControlFlow.Node[]private ControlFlow.Node -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionblock()Returns the basic block indicated by this node.child(int n) Returns the n-th child of this node.intchildren()Returns the number of the children of this node.private static ControlFlow.NodegetAncestor(ControlFlow.Node n1, ControlFlow.Node n2, int[] distance) (package private) intmakeDepth1stTree(ControlFlow.Node caller, boolean[] visited, int counter, int[] distance, ControlFlow.Access access) (package private) booleanmakeDominatorTree(boolean[] visited, int[] distance, ControlFlow.Access access) parent()Returns the parent of this node.private static voidsetChildren(ControlFlow.Node[] all) toString()Returns aStringrepresentation.
-
Field Details
-
block
-
parent
-
children
-
-
Constructor Details
-
Node
Node(ControlFlow.Block b)
-
-
Method Details
-
toString
Returns aStringrepresentation. -
block
Returns the basic block indicated by this node. -
parent
Returns the parent of this node. -
children
public int children()Returns the number of the children of this node. -
child
Returns the n-th child of this node.- Parameters:
n- an index in the array of children.
-
makeDepth1stTree
int makeDepth1stTree(ControlFlow.Node caller, boolean[] visited, int counter, int[] distance, ControlFlow.Access access) -
makeDominatorTree
-
getAncestor
private static ControlFlow.Node getAncestor(ControlFlow.Node n1, ControlFlow.Node n2, int[] distance) -
setChildren
-