| Package | Description |
|---|---|
| soot.toolkits.graph |
Toolkit to produce and manipulate various types of control flow
graphs.
|
| soot.toolkits.graph.pdg |
| Modifier and Type | Field and Description |
|---|---|
protected DominatorNode |
DominatorTree.head |
protected DominatorNode |
DominatorNode.parent |
| Modifier and Type | Field and Description |
|---|---|
protected java.util.Map<DominatorNode,java.util.List<DominatorNode>> |
CytronDominanceFrontier.nodeToFrontier |
protected java.util.Map<DominatorNode,java.util.List<DominatorNode>> |
CytronDominanceFrontier.nodeToFrontier |
| Modifier and Type | Method and Description |
|---|---|
protected DominatorNode |
DominatorTree.fetchDode(java.lang.Object gode)
Convenience method, ensures we don't create more than one
DominatorNode for a given block.
|
protected DominatorNode |
DominatorTree.fetchParent(java.lang.Object gode) |
DominatorNode |
DominatorTree.getDode(java.lang.Object gode)
Returns the DominatorNode for a given node in the original
DirectedGraph.
|
DominatorNode |
DominatorTree.getHead()
Returns the root of the dominator tree.
|
DominatorNode |
DominatorNode.getParent()
Returns the parent of the node in the DominatorTree.
|
DominatorNode |
DominatorTree.getParentOf(DominatorNode node)
Returns the parent of node in the tree, null if the node is at
the root.
|
| Modifier and Type | Method and Description |
|---|---|
java.util.List<DominatorNode> |
DominatorTree.getPredsOf(DominatorNode node)
Finds all the predecessors of node in the original
DirectedGraph and returns a list of the corresponding
DominatorNodes.
|
java.util.List<DominatorNode> |
DominatorTree.getSuccsOf(DominatorNode node)
Finds all the successors of node in the original DirectedGraph
and returns a list of the corresponding DominatorNodes.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
DominatorNode.addChild(DominatorNode child)
Adds a child to the internal list of children of this node in
tree.
|
protected void |
CytronDominanceFrontier.bottomUpDispatch(DominatorNode node)
Make sure we visit children first.
|
java.util.List |
DominatorTree.getChildrenOf(DominatorNode node)
Returns the children of node in the tree.
|
java.util.List |
DominanceFrontier.getDominanceFrontierOf(DominatorNode node) |
java.util.List |
CytronDominanceFrontier.getDominanceFrontierOf(DominatorNode node) |
DominatorNode |
DominatorTree.getParentOf(DominatorNode node)
Returns the parent of node in the tree, null if the node is at
the root.
|
java.util.List<DominatorNode> |
DominatorTree.getPredsOf(DominatorNode node)
Finds all the predecessors of node in the original
DirectedGraph and returns a list of the corresponding
DominatorNodes.
|
java.util.List<DominatorNode> |
DominatorTree.getSuccsOf(DominatorNode node)
Finds all the successors of node in the original DirectedGraph
and returns a list of the corresponding DominatorNodes.
|
boolean |
DominatorTree.isDominatorOf(DominatorNode dom,
DominatorNode node)
Returns true if dom dominates node.
|
protected boolean |
CytronDominanceFrontier.isFrontierKnown(DominatorNode node) |
boolean |
DominatorTree.isImmediateDominatorOf(DominatorNode idom,
DominatorNode node)
Returns true if idom immediately dominates node.
|
protected void |
CytronDominanceFrontier.processNode(DominatorNode node)
Calculate dominance frontier for a set of basic blocks.
|
void |
DominatorNode.setParent(DominatorNode parent)
Sets the parent of this node in the DominatorTree.
|
| Modifier and Type | Field and Description |
|---|---|
protected java.util.ArrayList<DominatorNode> |
MHGDominatorTree.heads |
| Modifier and Type | Method and Description |
|---|---|
java.util.List<DominatorNode> |
MHGDominatorTree.getHeads()
Returns the root(s)!!! of the dominator tree.
|
Copyright © 2012-2019 RoboVM AB. All Rights Reserved.