public class SlicingTools
extends java.lang.Object
| Constructor and Description |
|---|
SlicingTools() |
| Modifier and Type | Method and Description |
|---|---|
static DFAGraph |
buildImmediateDominanceTree(DFAGraph reversedCFG,
java.util.BitSet[] immediateDom,
DFANode[] nodeArray,
java.util.List<DFANode> nodeList) |
static java.util.BitSet[] |
getDominators(DFAGraph graph,
java.util.ArrayList<DFANode> nodeList) |
static java.util.Set<java.lang.Integer> |
getEntryIdxSet(DFAGraph graph,
java.util.List<DFANode> nodeList) |
static java.util.BitSet[] |
getImmediateDominator(java.util.BitSet[] dominator,
java.util.Set<java.lang.Integer> entryIdxSet,
java.util.List<DFANode> entryNodeList,
DFANode[] nodeArray) |
static int |
longestSubstr(java.lang.String first,
java.lang.String second) |
static void |
printDominanceTree(DFAGraph postDomTree,
Procedure proc) |
static void |
printDominator(java.util.BitSet[] dominator,
DFANode[] nodeArray,
Procedure proc) |
static DFAGraph |
reverseCFGraph(CFGraph cfg) |
public static java.util.BitSet[] getDominators(DFAGraph graph, java.util.ArrayList<DFANode> nodeList)
public static java.util.Set<java.lang.Integer> getEntryIdxSet(DFAGraph graph, java.util.List<DFANode> nodeList)
public static java.util.BitSet[] getImmediateDominator(java.util.BitSet[] dominator,
java.util.Set<java.lang.Integer> entryIdxSet,
java.util.List<DFANode> entryNodeList,
DFANode[] nodeArray)
public static DFAGraph buildImmediateDominanceTree(DFAGraph reversedCFG, java.util.BitSet[] immediateDom, DFANode[] nodeArray, java.util.List<DFANode> nodeList)
public static void printDominator(java.util.BitSet[] dominator,
DFANode[] nodeArray,
Procedure proc)
public static int longestSubstr(java.lang.String first,
java.lang.String second)