Package pascal.taie.util.graph

Class DominatorFinder<N>

java.lang.Object

pascal.taie.util.graph.DominatorFinder<N>

public class DominatorFinder<N>
extends Object

Finds dominators for the nodes in given Graph.

Constructor Summary

Constructors

Constructor	Description
DominatorFinder(Graph<N> graph)
DominatorFinder(Graph<N> graph, boolean isSparse)
DominatorFinder(Graph<N> graph, Indexer<N> indexer, boolean isSparse)	Constructs a dominator finder with a graph and given indexer.

Method Summary

Modifier and Type	Method	Description
Set<N>	getDominatorsOf(N node)
Set<N>	getNodesDominatedBy(N dominator)
boolean	isDominatedBy(N node, N dominator)

Methods inherited from class java.lang.Object

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

Constructor Details

DominatorFinder

public DominatorFinder(Graph<N> graph)

DominatorFinder

public DominatorFinder(Graph<N> graph,
 boolean isSparse)

DominatorFinder

public DominatorFinder(Graph<N> graph,
 Indexer<N> indexer,
 boolean isSparse)

Constructs a dominator finder with a graph and given indexer. Note that indexer must assign continuous indexes for nodes in graph, starting from 0, otherwise the finder may throw exception.

Method Details

getDominatorsOf

public Set<N> getDominatorsOf(N node)

Returns:

the dominators of node.

getNodesDominatedBy

public Set<N> getNodesDominatedBy(N dominator)

Returns:

the nodes dominated by the dominator.

isDominatedBy

public boolean isDominatedBy(N node,
 N dominator)

Returns:

true if dominator is a dominator of node.