GHC.Cmm.Reducibility

Test a Cmm control-flow graph for reducibility. And provide a function that, when given an arbitrary control-flow graph, returns an equivalent, reducible control-flow graph. The equivalent graph is obtained by "splitting" (copying) nodes of the original graph. The resulting equivalent graph has the same dynamic behavior as the original, but it is larger.

Documentation uses the language of control-flow analysis, in which a basic block is called a "node." These "nodes" are CmmLits or equivalent; they have nothing to do with a CmmNode.

For more on reducibility and related analyses and algorithms, see Note [Reducibility resources]

Documentation

data Reducibility

Represents the result of a reducibility analysis.

Constructors

Reducible

Irreducible

Instances

Show Reducibility

Defined in GHC.Cmm.Reducibility

Methods

showsPrec :: Int -> Reducibility -> ShowS

show :: Reducibility -> String

showList :: [Reducibility] -> ShowS

Eq Reducibility

Defined in GHC.Cmm.Reducibility

Methods

(==) :: Reducibility -> Reducibility -> Bool

(/=) :: Reducibility -> Reducibility -> Bool

reducibility :: NonLocal node => GraphWithDominators node -> Reducibility

Given a graph, say whether the graph is reducible. The graph must be bundled with a dominator analysis and a reverse postorder numbering, as these results are needed to perform the test.

asReducible :: GraphWithDominators CmmNode -> UniqSM (GraphWithDominators CmmNode)

Given a graph, return an equivalent reducible graph, by "splitting" (copying) nodes if necessary. The input graph must be bundled with a dominator analysis and a reverse postorder numbering. The computation is monadic because when a node is split, the new copy needs a fresh label.

Use this function whenever a downstream algorithm needs a reducible control-flow graph.