LengauerTarjanDominance (B2R2)

LengauerTarjanDominance Module

Namespace: B2R2.MiddleEnd.BinGraph.Dominance
Assembly: B2R2.MiddleEnd.BinGraph.dll

Provides the original (balanced) Lengauer-Tarjan dominance algorithm for dominator computation presented in "A fast algorithm for finding dominators in a flow graph", TOPLAS 1979. This sophisticated version balances when constructing the ancestor forest.

Functions and values

Function or value	Description
`create g dfp` Full Usage: `create g dfp` Parameters: g : `IDiGraphAccessible<'a, 'b>` dfp : `IDominanceFrontierProvider<'a, 'b>` Returns: `IDominance<'a, 'b>` Type parameters: 'a, 'b (requires equality and equality)	g : `IDiGraphAccessible<'a, 'b>` dfp : `IDominanceFrontierProvider<'a, 'b>` Returns: `IDominance<'a, 'b>`