Package ghidra.graph.algo

Class ChkPostDominanceAlgorithm<V,E extends GEdge<V>>

java.lang.Object

ghidra.graph.algo.ChkDominanceAlgorithm<V,E>

ghidra.graph.algo.ChkPostDominanceAlgorithm<V,E>

Type Parameters:

V - the vertex type

E - the edge type

public class ChkPostDominanceAlgorithm<V,E extends GEdge<V>>
extends ChkDominanceAlgorithm<V,E>

This is ChkDominanceAlgorithm with reverse graph traversal, which allows the algorithm to calculate post dominance.

Constructor Summary

Constructors

Constructor	Description
ChkPostDominanceAlgorithm(GDirectedGraph<V,E> g, TaskMonitor monitor)	Constructor.

Method Summary

Modifier and Type	Method	Description
protected static <V, E extends GEdge<V>> V	unifySinks(MutableGDirectedGraphWrapper<V,E> graph, GraphNavigator<V,E> graphNavigator)	Converts multiple sink/exit nodes in a graph into a single sink of which those become parents.
protected static <V, E extends GEdge<V>> V	unifySources(MutableGDirectedGraphWrapper<V,E> graph, GraphNavigator<V,E> graphNavigator)	Converts multiple source/root nodes in a graph into a single source of which those become children.

Methods inherited from class ghidra.graph.algo.ChkDominanceAlgorithm

clear, getDominanceTree, getDominated, getDominators

Methods inherited from class java.lang.Object

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

Constructor Details

ChkPostDominanceAlgorithm

public ChkPostDominanceAlgorithm(GDirectedGraph<V,E> g,
 TaskMonitor monitor)
                          throws CancelledException

Constructor.

Parameters:

g - the graph

monitor - the monitor

Throws:

CancelledException - if the algorithm is cancelled

Method Details

unifySources

protected static <V,
E extends GEdge<V>> V unifySources(MutableGDirectedGraphWrapper<V,E> graph,
 GraphNavigator<V,E> graphNavigator)

Converts multiple source/root nodes in a graph into a single source of which those become children.

Parameters:

graph - the graph

graphNavigator - the navigator to determine graph direction

Returns:

the new single source

Throws:

IllegalArgumentException - if there is not at least one source node in the graph

unifySinks

protected static <V,
E extends GEdge<V>> V unifySinks(MutableGDirectedGraphWrapper<V,E> graph,
 GraphNavigator<V,E> graphNavigator)

Converts multiple sink/exit nodes in a graph into a single sink of which those become parents.

Parameters:

graph - the graph

graphNavigator - the navigator to determine graph direction

Returns:

the new single sink

Throws:

IllegalArgumentException - if there is not at least one sink node in the graph