| Trees | Indices | Help |
|
|---|
|
|
|
|||
|
__init__(self,
imm,
addr,
blocks=False,
recursion=False) This class takes a function start address and calculate all Dominator Tree related tables: - Predecessors - Iterated Predecessors - Dominators - Immediate Dominators - Post Dominators - Immediate Post Dominators @type imm: Debbuger OBJECT @param imm: Debbuger @type addr: DWORD @param addr: function start address @type blocks: DICTIONARY|False @param blocks: Optionally you can provide a dictionary with the node address as key and a list of edges (mainly for testing purposes). |
||
| Initializate(self) | ||
| CalculatePredecessors(self) | ||
| CalculateIterativePredecessors(self) | ||
| __iterative_predecessors_helper(self, base, newbase) | ||
|
CalculateDominators(self) Based in algorithm from "Advanced COMPILER DESIGN IMPLEMENTATION" |
||
| CalculateImmediateDominators(self) | ||
| CalculatePostAndImmediatePostDominators(self) | ||
| getDominators(self) | ||
| getImmediateDominators(self) | ||
| getPostDominators(self) | ||
| getImmediatePostDominators(self) | ||
| getPredecessors(self) | ||
| getIteratedPredecessors(self) | ||
| getControlFlowGraph(self) | ||
|
|||
This class takes a function start address and calculate all Dominator Tree related tables: - Predecessors - Iterated Predecessors - Dominators - Immediate Dominators - Post Dominators - Immediate Post Dominators @type imm: Debbuger OBJECT @param imm: Debbuger @type addr: DWORD @param addr: function start address @type blocks: DICTIONARY|False @param blocks: Optionally you can provide a dictionary with the node address as key and a list of edges (mainly for testing purposes). |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0alpha3 on Thu May 29 13:03:08 2008 | http://epydoc.sourceforge.net |