Compiler.Hoopl.Internals

Contents

• Shapes
• Blocks
  • Predicates on Blocks
  • Constructing blocks
  • Deconstructing blocks
  • Modifying blocks
  • Converting to and from lists
  • Maps and folds
  • Biasing
• Body
• Graph
  • Constructing graphs
  • Splicing graphs
  • Maps
  • Folds
  • Extracting Labels
  • Depth-first traversals
• Respecting Fuel

Synopsis

• data O
• data C
• data MaybeO ex t where
  • JustO :: t -> MaybeO O t
  • NothingO :: MaybeO C t
• data MaybeC ex t where
  • JustC :: t -> MaybeC C t
  • NothingC :: MaybeC O t
• type family IndexedCO ex a b :: *
• data Shape ex where
  • Closed :: Shape C
  • Open :: Shape O
• data Block n e x where
  • BlockCO :: n C O -> Block n O O -> Block n C O
  • BlockCC :: n C O -> Block n O O -> n O C -> Block n C C
  • BlockOC :: Block n O O -> n O C -> Block n O C
  • BNil :: Block n O O
  • BMiddle :: n O O -> Block n O O
  • BCat :: Block n O O -> Block n O O -> Block n O O
  • BSnoc :: Block n O O -> n O O -> Block n O O
  • BCons :: n O O -> Block n O O -> Block n O O
• isEmptyBlock :: Block n e x -> Bool
• emptyBlock :: Block n O O
• blockCons :: n O O -> Block n O x -> Block n O x
• blockSnoc :: Block n e O -> n O O -> Block n e O
• blockJoinHead :: n C O -> Block n O x -> Block n C x
• blockJoinTail :: Block n e O -> n O C -> Block n e C
• blockJoin :: n C O -> Block n O O -> n O C -> Block n C C
• blockJoinAny :: (MaybeC e (n C O), Block n O O, MaybeC x (n O C)) -> Block n e x
• blockAppend :: Block n e O -> Block n O x -> Block n e x
• firstNode :: Block n C x -> n C O
• lastNode :: Block n x C -> n O C
• endNodes :: Block n C C -> (n C O, n O C)
• blockSplitHead :: Block n C x -> (n C O, Block n O x)
• blockSplitTail :: Block n e C -> (Block n e O, n O C)
• blockSplit :: Block n C C -> (n C O, Block n O O, n O C)
• blockSplitAny :: Block n e x -> (MaybeC e (n C O), Block n O O, MaybeC x (n O C))
• replaceFirstNode :: Block n C x -> n C O -> Block n C x
• replaceLastNode :: Block n x C -> n O C -> Block n x C
• blockToList :: Block n O O -> [n O O]
• blockFromList :: [n O O] -> Block n O O
• mapBlock :: (forall e x. n e x -> n' e x) -> Block n e x -> Block n' e x
• mapBlock' :: (forall e x. n e x -> n' e x) -> Block n e x -> Block n' e x
• mapBlock3' :: forall n n' e x. (n C O -> n' C O, n O O -> n' O O, n O C -> n' O C) -> Block n e x -> Block n' e x
• foldBlockNodesF :: forall n a. (forall e x. n e x -> a -> a) -> forall e x. Block n e x -> IndexedCO e a a -> IndexedCO x a a
• foldBlockNodesF3 :: forall n a b c. (n C O -> a -> b, n O O -> b -> b, n O C -> b -> c) -> forall e x. Block n e x -> IndexedCO e a b -> IndexedCO x c b
• foldBlockNodesB :: forall n a. (forall e x. n e x -> a -> a) -> forall e x. Block n e x -> IndexedCO x a a -> IndexedCO e a a
• foldBlockNodesB3 :: forall n a b c. (n C O -> b -> c, n O O -> b -> b, n O C -> a -> b) -> forall e x. Block n e x -> IndexedCO x a b -> IndexedCO e c b
• frontBiasBlock :: Block n e x -> Block n e x
• backBiasBlock :: Block n e x -> Block n e x
• type Body n = LabelMap (Block n C C)
• type Body' block n = LabelMap (block n C C)
• emptyBody :: Body' block n
• bodyList :: NonLocal (block n) => Body' block n -> [(Label, block n C C)]
• addBlock :: NonLocal thing => thing C C -> LabelMap (thing C C) -> LabelMap (thing C C)
• bodyUnion :: forall a. LabelMap a -> LabelMap a -> LabelMap a
• type Graph = Graph' Block
• data Graph' block n e x where
  • GNil :: Graph' block n O O
  • GUnit :: block n O O -> Graph' block n O O
  • GMany :: MaybeO e (block n O C) -> Body' block n -> MaybeO x (block n C O) -> Graph' block n e x
• class NonLocal thing where
  • entryLabel :: thing C x -> Label
  • successors :: thing e C -> [Label]
• bodyGraph :: Body n -> Graph n C C
• blockGraph :: NonLocal n => Block n e x -> Graph n e x
• gUnitOO :: block n O O -> Graph' block n O O
• gUnitOC :: block n O C -> Graph' block n O C
• gUnitCO :: block n C O -> Graph' block n C O
• gUnitCC :: NonLocal (block n) => block n C C -> Graph' block n C C
• catGraphNodeOC :: NonLocal n => Graph n e O -> n O C -> Graph n e C
• catGraphNodeOO :: Graph n e O -> n O O -> Graph n e O
• catNodeCOGraph :: NonLocal n => n C O -> Graph n O x -> Graph n C x
• catNodeOOGraph :: n O O -> Graph n O x -> Graph n O x
• splice :: forall block n e a x. NonLocal (block n) => (forall e x. block n e O -> block n O x -> block n e x) -> Graph' block n e a -> Graph' block n a x -> Graph' block n e x
• gSplice :: NonLocal n => Graph n e a -> Graph n a x -> Graph n e x
• mapGraph :: (forall e x. n e x -> n' e x) -> Graph n e x -> Graph n' e x
• mapGraphBlocks :: forall block n block' n' e x. (forall e x. block n e x -> block' n' e x) -> Graph' block n e x -> Graph' block' n' e x
• foldGraphNodes :: forall n a. (forall e x. n e x -> a -> a) -> forall e x. Graph n e x -> a -> a
• labelsDefined :: forall block n e x. NonLocal (block n) => Graph' block n e x -> LabelSet
• labelsUsed :: forall block n e x. NonLocal (block n) => Graph' block n e x -> LabelSet
• externalEntryLabels :: forall n. NonLocal n => LabelMap (Block n C C) -> LabelSet
• postorder_dfs :: NonLocal (block n) => Graph' block n O x -> [block n C C]
• postorder_dfs_from :: (NonLocal block, LabelsPtr b) => LabelMap (block C C) -> b -> [block C C]
• postorder_dfs_from_except :: forall block e. (NonLocal block, LabelsPtr e) => LabelMap (block C C) -> e -> LabelSet -> [block C C]
• preorder_dfs :: NonLocal (block n) => Graph' block n O x -> [block n C C]
• preorder_dfs_from_except :: forall block e. (NonLocal block, LabelsPtr e) => LabelMap (block C C) -> e -> LabelSet -> [block C C]
• class LabelsPtr l where
  • targetLabels :: l -> [Label]
• data Label
• freshLabel :: UniqueMonad m => m Label
• data LabelSet
• data LabelMap v
• type FactBase f = LabelMap f
• noFacts :: FactBase f
• lookupFact :: Label -> FactBase f -> Maybe f
• uniqueToLbl :: Unique -> Label
• lblToUnique :: Label -> Unique
• data DataflowLattice a = DataflowLattice {
  • fact_name :: String
  • fact_bot :: a
  • fact_join :: JoinFun a
  }
• type JoinFun a = Label -> OldFact a -> NewFact a -> (ChangeFlag, a)
• newtype OldFact a = OldFact a
• newtype NewFact a = NewFact a
• type family Fact x f :: *
• mkFactBase :: forall f. DataflowLattice f -> [(Label, f)] -> FactBase f
• data ChangeFlag
  • = NoChange
  • | SomeChange
• changeIf :: Bool -> ChangeFlag
• data FwdPass m n f = FwdPass {
  • fp_lattice :: DataflowLattice f
  • fp_transfer :: FwdTransfer n f
  • fp_rewrite :: FwdRewrite m n f
  }
• newtype FwdTransfer n f = FwdTransfer3 {
  • getFTransfer3 :: (n C O -> f -> f, n O O -> f -> f, n O C -> f -> FactBase f)
  }
• mkFTransfer :: (forall e x. n e x -> f -> Fact x f) -> FwdTransfer n f
• mkFTransfer3 :: (n C O -> f -> f) -> (n O O -> f -> f) -> (n O C -> f -> FactBase f) -> FwdTransfer n f
• newtype FwdRewrite m n f = FwdRewrite3 {
  • getFRewrite3 :: (n C O -> f -> m (Maybe (Graph n C O, FwdRewrite m n f)), n O O -> f -> m (Maybe (Graph n O O, FwdRewrite m n f)), n O C -> f -> m (Maybe (Graph n O C, FwdRewrite m n f)))
  }
• mkFRewrite :: FuelMonad m => (forall e x. n e x -> f -> m (Maybe (Graph n e x))) -> FwdRewrite m n f
• mkFRewrite3 :: forall m n f. FuelMonad m => (n C O -> f -> m (Maybe (Graph n C O))) -> (n O O -> f -> m (Maybe (Graph n O O))) -> (n O C -> f -> m (Maybe (Graph n O C))) -> FwdRewrite m n f
• noFwdRewrite :: Monad m => FwdRewrite m n f
• wrapFR :: (forall e x. (n e x -> f -> m (Maybe (Graph n e x, FwdRewrite m n f))) -> n' e x -> f' -> m' (Maybe (Graph n' e x, FwdRewrite m' n' f'))) -> FwdRewrite m n f -> FwdRewrite m' n' f'
• wrapFR2 :: (forall e x. (n1 e x -> f1 -> m1 (Maybe (Graph n1 e x, FwdRewrite m1 n1 f1))) -> (n2 e x -> f2 -> m2 (Maybe (Graph n2 e x, FwdRewrite m2 n2 f2))) -> n3 e x -> f3 -> m3 (Maybe (Graph n3 e x, FwdRewrite m3 n3 f3))) -> FwdRewrite m1 n1 f1 -> FwdRewrite m2 n2 f2 -> FwdRewrite m3 n3 f3
• data BwdPass m n f = BwdPass {
  • bp_lattice :: DataflowLattice f
  • bp_transfer :: BwdTransfer n f
  • bp_rewrite :: BwdRewrite m n f
  }
• newtype BwdTransfer n f = BwdTransfer3 {
  • getBTransfer3 :: (n C O -> f -> f, n O O -> f -> f, n O C -> FactBase f -> f)
  }
• mkBTransfer :: (forall e x. n e x -> Fact x f -> f) -> BwdTransfer n f
• mkBTransfer3 :: (n C O -> f -> f) -> (n O O -> f -> f) -> (n O C -> FactBase f -> f) -> BwdTransfer n f
• wrapBR :: (forall e x. Shape x -> (n e x -> Fact x f -> m (Maybe (Graph n e x, BwdRewrite m n f))) -> n' e x -> Fact x f' -> m' (Maybe (Graph n' e x, BwdRewrite m' n' f'))) -> BwdRewrite m n f -> BwdRewrite m' n' f'
• wrapBR2 :: (forall e x. Shape x -> (n1 e x -> Fact x f1 -> m1 (Maybe (Graph n1 e x, BwdRewrite m1 n1 f1))) -> (n2 e x -> Fact x f2 -> m2 (Maybe (Graph n2 e x, BwdRewrite m2 n2 f2))) -> n3 e x -> Fact x f3 -> m3 (Maybe (Graph n3 e x, BwdRewrite m3 n3 f3))) -> BwdRewrite m1 n1 f1 -> BwdRewrite m2 n2 f2 -> BwdRewrite m3 n3 f3
• newtype BwdRewrite m n f = BwdRewrite3 {
  • getBRewrite3 :: (n C O -> f -> m (Maybe (Graph n C O, BwdRewrite m n f)), n O O -> f -> m (Maybe (Graph n O O, BwdRewrite m n f)), n O C -> FactBase f -> m (Maybe (Graph n O C, BwdRewrite m n f)))
  }
• mkBRewrite :: FuelMonad m => (forall e x. n e x -> Fact x f -> m (Maybe (Graph n e x))) -> BwdRewrite m n f
• mkBRewrite3 :: forall m n f. FuelMonad m => (n C O -> f -> m (Maybe (Graph n C O))) -> (n O O -> f -> m (Maybe (Graph n O O))) -> (n O C -> FactBase f -> m (Maybe (Graph n O C))) -> BwdRewrite m n f
• noBwdRewrite :: Monad m => BwdRewrite m n f
• analyzeAndRewriteFwd :: forall m n f e x entries. (CheckpointMonad m, NonLocal n, LabelsPtr entries) => FwdPass m n f -> MaybeC e entries -> Graph n e x -> Fact e f -> m (Graph n e x, FactBase f, MaybeO x f)
• analyzeAndRewriteBwd :: (CheckpointMonad m, NonLocal n, LabelsPtr entries) => BwdPass m n f -> MaybeC e entries -> Graph n e x -> Fact x f -> m (Graph n e x, FactBase f, MaybeO e f)

Shapes

Blocks

Predicates on Blocks

Constructing blocks

Deconstructing blocks

Modifying blocks

Converting to and from lists

Maps and folds

Biasing

Body

Graph

Constructing graphs

Splicing graphs

Maps

Folds

Extracting Labels

Depth-first traversals

Respecting Fuel