DepthBasedSearchDominance (B2R2) | B2R2

DepthBasedSearchDominance Module

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

Provides Georgiadis et al.'s algorithm for dynamic dominance computation presented in "An Experimental Study of Dynamic Dominators", ESA 2012.

Types

Type	Description
DBSDomInfo<'V, 'E>
StaticAlgo	Static dominator algorithm used for sub dominator tree construction.

Functions and values

Function or value	Description
`creatFromInfo g fwInfo bwInfo dfp` Full Usage: `creatFromInfo g fwInfo bwInfo dfp` Parameters: g : `IDiGraphAccessible<'a, 'b>` fwInfo : `DBSDomInfo<'c, 'd>` bwInfo : `Lazy<DBSDomInfo<'e, 'f>>` dfp : `IDominanceFrontierProvider<'a, 'b>` Returns: `IDominance<'a, 'b>` Type parameters: 'a, 'b, 'c, 'd, 'e, 'f (requires equality and equality and equality and equality and equality and equality)	g : `IDiGraphAccessible<'a, 'b>` fwInfo : `DBSDomInfo<'c, 'd>` bwInfo : `Lazy<DBSDomInfo<'e, 'f>>` dfp : `IDominanceFrontierProvider<'a, 'b>` Returns: `IDominance<'a, 'b>`
`create g dfp staticAlgo` Full Usage: `create g dfp staticAlgo` Parameters: g : `IDiGraphAccessible<'a, 'b>` dfp : `IDominanceFrontierProvider<'a, 'b>` staticAlgo : `StaticAlgo` Returns: `IDominance<'a, 'b>` Type parameters: 'a, 'b (requires equality and equality)	g : `IDiGraphAccessible<'a, 'b>` dfp : `IDominanceFrontierProvider<'a, 'b>` staticAlgo : `StaticAlgo` Returns: `IDominance<'a, 'b>`
`createInfoFromDom g dom dfp staticAlgo fw` Full Usage: `createInfoFromDom g dom dfp staticAlgo fw` Parameters: g : `IDiGraphAccessible<'a, 'b>` dom : `IDominance<'a, 'c>` dfp : `IDominanceFrontierProvider<'d, 'e>` staticAlgo : `StaticAlgo` fw : `bool` Returns: `DBSDomInfo<'d, 'e>` Type parameters: 'a, 'b, 'c, 'd, 'e (requires equality and equality and equality and equality and equality)	g : `IDiGraphAccessible<'a, 'b>` dom : `IDominance<'a, 'c>` dfp : `IDominanceFrontierProvider<'d, 'e>` staticAlgo : `StaticAlgo` fw : `bool` Returns: `DBSDomInfo<'d, 'e>`
`createWithInfo g dfp staticAlgo` Full Usage: `createWithInfo g dfp staticAlgo` Parameters: g : `IDiGraphAccessible<'a, 'b>` dfp : `IDominanceFrontierProvider<'a, 'b>` staticAlgo : `StaticAlgo` Returns: `IDominance<'a, 'b> * DBSDomInfo<'a, 'b> * Lazy<DBSDomInfo<'a, 'b>>` Type parameters: 'a, 'b (requires equality and equality)	g : `IDiGraphAccessible<'a, 'b>` dfp : `IDominanceFrontierProvider<'a, 'b>` staticAlgo : `StaticAlgo` Returns: `IDominance<'a, 'b> * DBSDomInfo<'a, 'b> * Lazy<DBSDomInfo<'a, 'b>>`
`updateInfo g info edge` Full Usage: `updateInfo g info edge` Parameters: g : `IDiGraphAccessible<'a, 'b>` info : `DBSDomInfo<'a, 'b>` edge : `Edge<'a, 'c>` Returns: `DBSDomInfo<'a, 'b>` Type parameters: 'a, 'b, 'c (requires equality and equality and equality)	g : `IDiGraphAccessible<'a, 'b>` info : `DBSDomInfo<'a, 'b>` edge : `Edge<'a, 'c>` Returns: `DBSDomInfo<'a, 'b>`