Package jadx.core.dex.visitors.blocks

Class DominatorTree

java.lang.Object

jadx.core.dex.visitors.blocks.DominatorTree

public class DominatorTree
extends Object

Build dominator tree based on the algorithm described in paper: Cooper, Keith D.; Harvey, Timothy J; Kennedy, Ken (2001). "A Simple, Fast Dominance Algorithm" http://www.hipersoft.rice.edu/grads/publications/dom14.pdf

Constructor Summary

Constructors

Constructor	Description
DominatorTree()

Method Summary

Modifier and Type	Method	Description
private static void	addToDF(BlockNode block, BlockNode dfBlock, int blocksCount)
private static void	apply(List<BlockNode> sorted, BlockNode[] doms)
(package private) static BlockNode[]	build(List<BlockNode> sorted, Function<BlockNode,List<BlockNode>> predFunc)
(package private) static BitSet	collectDoms(BlockNode[] doms, BlockNode idom)
static void	compute(MethodNode mth)
static void	computeDominanceFrontier(MethodNode mth)
private static BlockNode	intersect(List<BlockNode> sorted, BlockNode[] doms, BlockNode b1, BlockNode b2)
private static List<BlockNode>	sortBlocks(MethodNode mth)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

DominatorTree

public DominatorTree()

Method Details

compute

public static void compute(MethodNode mth)

sortBlocks

private static List<BlockNode> sortBlocks(MethodNode mth)

build

static BlockNode[] build(List<BlockNode> sorted,
 Function<BlockNode,List<BlockNode>> predFunc)

intersect

private static BlockNode intersect(List<BlockNode> sorted,
 BlockNode[] doms,
 BlockNode b1,
 BlockNode b2)

apply

private static void apply(List<BlockNode> sorted,
 BlockNode[] doms)

collectDoms

static BitSet collectDoms(BlockNode[] doms,
 BlockNode idom)

computeDominanceFrontier

public static void computeDominanceFrontier(MethodNode mth)

addToDF

private static void addToDF(BlockNode block,
 BlockNode dfBlock,
 int blocksCount)