Safe Haskell	Safe-Inferred
Language	Haskell2010

GHC.Cmm.Dataflow

Synopsis

type C = 'Closed
type O = 'Open
data Block n e x
lastNode :: Block n x C -> n O C
entryLabel :: NonLocal thing => thing C x -> Label
foldNodesBwdOO :: (CmmNode O O -> f -> f) -> Block CmmNode O O -> f -> f
foldRewriteNodesBwdOO :: forall f. (CmmNode O O -> f -> UniqSM (Block CmmNode O O, f)) -> Block CmmNode O O -> f -> UniqSM (Block CmmNode O O, f)
data DataflowLattice a = DataflowLattice {
- fact_bot :: a
- fact_join :: JoinFun a
}
newtype OldFact a = OldFact a
newtype NewFact a = NewFact a
data JoinedFact a
- = Changed !a
- | NotChanged !a
type TransferFun f = CmmBlock -> FactBase f -> FactBase f
type RewriteFun f = CmmBlock -> FactBase f -> UniqSM (CmmBlock, FactBase f)
type family Fact (x :: Extensibility) f :: Type
type FactBase f = LabelMap f
getFact :: DataflowLattice f -> Label -> FactBase f -> f
mkFactBase :: DataflowLattice f -> [(Label, f)] -> FactBase f
analyzeCmmFwd :: DataflowLattice f -> TransferFun f -> CmmGraph -> FactBase f -> FactBase f
analyzeCmmBwd :: DataflowLattice f -> TransferFun f -> CmmGraph -> FactBase f -> FactBase f
rewriteCmmBwd :: DataflowLattice f -> RewriteFun f -> CmmGraph -> FactBase f -> UniqSM (CmmGraph, FactBase f)
changedIf :: Bool -> a -> JoinedFact a
joinOutFacts :: NonLocal n => DataflowLattice f -> n e C -> FactBase f -> f
joinFacts :: DataflowLattice f -> [f] -> f

Documentation

type C = 'Closed Source #

type O = 'Open Source #

data Block n e x Source #

A sequence of nodes. May be any of four shapes (OO, OC, CO, CC). Open at the entry means single entry, mutatis mutandis for exit. A closedclosed block is a basic/ block and can't be extended further. Clients should avoid manipulating blocks and should stick to either nodes or graphs.

Instances

Instances details

NonLocal n => NonLocal (Block n) Source #
Instance details Defined in GHC.Cmm.Dataflow.Graph Methods entryLabel :: forall (x :: Extensibility). Block n C x -> Label Source # successors :: forall (e :: Extensibility). Block n e C -> [Label] Source #
Outputable (Block CmmNode C C) Source #
Instance details Defined in GHC.Cmm.Ppr Methods ppr :: Block CmmNode C C -> SDoc Source # pprPrec :: Rational -> Block CmmNode C C -> SDoc Source #
Outputable (Block CmmNode C O) Source #
Instance details Defined in GHC.Cmm.Ppr Methods ppr :: Block CmmNode C O -> SDoc Source # pprPrec :: Rational -> Block CmmNode C O -> SDoc Source #
Outputable (Block CmmNode O C) Source #
Instance details Defined in GHC.Cmm.Ppr Methods ppr :: Block CmmNode O C -> SDoc Source # pprPrec :: Rational -> Block CmmNode O C -> SDoc Source #
Outputable (Block CmmNode O O) Source #
Instance details Defined in GHC.Cmm.Ppr Methods ppr :: Block CmmNode O O -> SDoc Source # pprPrec :: Rational -> Block CmmNode O O -> SDoc Source #
Outputable (Graph CmmNode e x) Source #
Instance details Defined in GHC.Cmm.Ppr Methods ppr :: Graph CmmNode e x -> SDoc Source # pprPrec :: Rational -> Graph CmmNode e x -> SDoc Source #

lastNode :: Block n x C -> n O C Source #

entryLabel Source #

Arguments

:: NonLocal thing
=> thing C x
-> Label	The label of a first node or block

foldNodesBwdOO :: (CmmNode O O -> f -> f) -> Block CmmNode O O -> f -> f Source #

Folds backward over all nodes of an open-open block. Strict in the accumulator.

foldRewriteNodesBwdOO :: forall f. (CmmNode O O -> f -> UniqSM (Block CmmNode O O, f)) -> Block CmmNode O O -> f -> UniqSM (Block CmmNode O O, f) Source #

Folds backward over all the nodes of an open-open block and allows rewriting them. The accumulator is both the block of nodes and f (usually dataflow facts). Strict in both accumulated parts.

data DataflowLattice a Source #

Constructors

DataflowLattice
Fields fact_bot :: a fact_join :: JoinFun a

newtype OldFact a Source #

Constructors

OldFact a

newtype NewFact a Source #

Constructors

NewFact a

data JoinedFact a Source #

The result of joining OldFact and NewFact.

Constructors

Changed !a	Result is different than OldFact.
NotChanged !a	Result is the same as OldFact.

type TransferFun f = CmmBlock -> FactBase f -> FactBase f Source #

type RewriteFun f = CmmBlock -> FactBase f -> UniqSM (CmmBlock, FactBase f) Source #

Function for rewrtiting and analysis combined. To be used with rewriteCmm.

Currently set to work with UniqSM monad, but we could probably abstract that away (if we do that, we might want to specialize the fixpoint algorithms to the particular monads through SPECIALIZE).

type family Fact (x :: Extensibility) f :: Type Source #

Instances

Instances details

type Fact C f Source #
Instance details Defined in GHC.Cmm.Dataflow type Fact C f = FactBase f
type Fact O f Source #
Instance details Defined in GHC.Cmm.Dataflow type Fact O f = f

type FactBase f = LabelMap f Source #

getFact :: DataflowLattice f -> Label -> FactBase f -> f Source #

mkFactBase :: DataflowLattice f -> [(Label, f)] -> FactBase f Source #

Returns the joined facts for each label.

analyzeCmmFwd :: DataflowLattice f -> TransferFun f -> CmmGraph -> FactBase f -> FactBase f Source #

analyzeCmmBwd :: DataflowLattice f -> TransferFun f -> CmmGraph -> FactBase f -> FactBase f Source #

rewriteCmmBwd :: DataflowLattice f -> RewriteFun f -> CmmGraph -> FactBase f -> UniqSM (CmmGraph, FactBase f) Source #

changedIf :: Bool -> a -> JoinedFact a Source #

joinOutFacts :: NonLocal n => DataflowLattice f -> n e C -> FactBase f -> f Source #

Returns the result of joining the facts from all the successors of the provided node or block.

joinFacts :: DataflowLattice f -> [f] -> f Source #