diff options
author | Norman Ramsey <nr@cs.tufts.edu> | 2021-11-23 14:45:52 -0500 |
---|---|---|
committer | Andreas Klebinger <klebinger.andreas@gmx.at> | 2021-12-07 15:54:19 +0000 |
commit | 9cb7a17584942570db8a277a6cc0ef393684847c (patch) | |
tree | 03f56f893453eb0b2c5e712ad220f82088ef4da6 | |
parent | 7eb5606441bf11ba2ebd5f8904918dc82a2a3126 (diff) | |
download | haskell-wip/nr/polymorphic-dataflow.tar.gz |
generalize GHC.Cmm.Dataflow to work over any node typewip/nr/polymorphic-dataflow
See #20725.
The commit includes source-code changes and a test case.
-rw-r--r-- | compiler/GHC/Cmm/Dataflow.hs | 77 | ||||
-rw-r--r-- | testsuite/tests/cmm/should_compile/T20725.hs | 25 | ||||
-rw-r--r-- | testsuite/tests/cmm/should_compile/all.T | 1 |
3 files changed, 72 insertions, 31 deletions
diff --git a/compiler/GHC/Cmm/Dataflow.hs b/compiler/GHC/Cmm/Dataflow.hs index 05a91fe649..3e310fefcb 100644 --- a/compiler/GHC/Cmm/Dataflow.hs +++ b/compiler/GHC/Cmm/Dataflow.hs @@ -82,6 +82,11 @@ data Direction = Fwd | Bwd type TransferFun f = CmmBlock -> FactBase f -> FactBase f +-- | `TransferFun` abstracted over `n` (the node type) +type TransferFun' (n :: Extensibility -> Extensibility -> Type) f = + Block n C C -> FactBase f -> FactBase f + + -- | Function for rewrtiting and analysis combined. To be used with -- @rewriteCmm@. -- @@ -90,20 +95,26 @@ type TransferFun f = CmmBlock -> FactBase f -> FactBase f -- to the particular monads through SPECIALIZE). type RewriteFun f = CmmBlock -> FactBase f -> UniqSM (CmmBlock, FactBase f) +-- | `RewriteFun` abstracted over `n` (the node type) +type RewriteFun' (n :: Extensibility -> Extensibility -> Type) f = + Block n C C -> FactBase f -> UniqSM (Block n C C, FactBase f) + analyzeCmmBwd, analyzeCmmFwd - :: DataflowLattice f - -> TransferFun f - -> CmmGraph + :: (NonLocal node) + => DataflowLattice f + -> TransferFun' node f + -> GenCmmGraph node -> FactBase f -> FactBase f analyzeCmmBwd = analyzeCmm Bwd analyzeCmmFwd = analyzeCmm Fwd analyzeCmm - :: Direction + :: (NonLocal node) + => Direction -> DataflowLattice f - -> TransferFun f - -> CmmGraph + -> TransferFun' node f + -> GenCmmGraph node -> FactBase f -> FactBase f analyzeCmm dir lattice transfer cmmGraph initFact = @@ -117,12 +128,13 @@ analyzeCmm dir lattice transfer cmmGraph initFact = -- Fixpoint algorithm. fixpointAnalysis - :: forall f. - Direction + :: forall f node. + (NonLocal node) + => Direction -> DataflowLattice f - -> TransferFun f + -> TransferFun' node f -> Label - -> LabelMap CmmBlock + -> LabelMap (Block node C C) -> FactBase f -> FactBase f fixpointAnalysis direction lattice do_block entry blockmap = loop start @@ -155,20 +167,22 @@ fixpointAnalysis direction lattice do_block entry blockmap = loop start loop _ !fbase1 = fbase1 rewriteCmmBwd - :: DataflowLattice f - -> RewriteFun f - -> CmmGraph + :: (NonLocal node) + => DataflowLattice f + -> RewriteFun' node f + -> GenCmmGraph node -> FactBase f - -> UniqSM (CmmGraph, FactBase f) + -> UniqSM (GenCmmGraph node, FactBase f) rewriteCmmBwd = rewriteCmm Bwd rewriteCmm - :: Direction + :: (NonLocal node) + => Direction -> DataflowLattice f - -> RewriteFun f - -> CmmGraph + -> RewriteFun' node f + -> GenCmmGraph node -> FactBase f - -> UniqSM (CmmGraph, FactBase f) + -> UniqSM (GenCmmGraph node, FactBase f) rewriteCmm dir lattice rwFun cmmGraph initFact = {-# SCC rewriteCmm #-} do let entry = g_entry cmmGraph hooplGraph = g_graph cmmGraph @@ -180,14 +194,15 @@ rewriteCmm dir lattice rwFun cmmGraph initFact = {-# SCC rewriteCmm #-} do return (cmmGraph {g_graph = GMany NothingO blockMap2 NothingO}, facts) fixpointRewrite - :: forall f. - Direction + :: forall f node. + NonLocal node + => Direction -> DataflowLattice f - -> RewriteFun f + -> RewriteFun' node f -> Label - -> LabelMap CmmBlock + -> LabelMap (Block node C C) -> FactBase f - -> UniqSM (LabelMap CmmBlock, FactBase f) + -> UniqSM (LabelMap (Block node C C), FactBase f) fixpointRewrite dir lattice do_block entry blockmap = loop start blockmap where -- Sorting the blocks helps to minimize the number of times we need to @@ -204,9 +219,9 @@ fixpointRewrite dir lattice do_block entry blockmap = loop start blockmap loop :: IntHeap -- ^ Worklist, i.e., blocks to process - -> LabelMap CmmBlock -- ^ Rewritten blocks. + -> LabelMap (Block node C C) -- ^ Rewritten blocks. -> FactBase f -- ^ Current facts. - -> UniqSM (LabelMap CmmBlock, FactBase f) + -> UniqSM (LabelMap (Block node C C), FactBase f) loop todo !blocks1 !fbase1 | Just (index, todo1) <- IntSet.minView todo = do -- Note that we use the *original* block here. This is important. @@ -309,7 +324,7 @@ sortBlocks direction entry blockmap = -- * for a backward analysis we need to re-analyze all the predecessors, but -- * for a forward analysis, we only need to re-analyze the current block -- (and that will in turn propagate facts into its successors). -mkDepBlocks :: Direction -> [CmmBlock] -> LabelMap IntSet +mkDepBlocks :: NonLocal node => Direction -> [Block node C C] -> LabelMap IntSet mkDepBlocks Fwd blocks = go blocks 0 mapEmpty where go [] !_ !dep_map = dep_map @@ -396,7 +411,7 @@ mkFactBase lattice = foldl' add mapEmpty -- | Folds backward over all nodes of an open-open block. -- Strict in the accumulator. -foldNodesBwdOO :: (CmmNode O O -> f -> f) -> Block CmmNode O O -> f -> f +foldNodesBwdOO :: (node O O -> f -> f) -> Block node O O -> f -> f foldNodesBwdOO funOO = go where go (BCat b1 b2) f = go b1 $! go b2 f @@ -411,11 +426,11 @@ foldNodesBwdOO funOO = go -- dataflow facts). -- Strict in both accumulated parts. foldRewriteNodesBwdOO - :: forall f. - (CmmNode O O -> f -> UniqSM (Block CmmNode O O, f)) - -> Block CmmNode O O + :: forall f node. + (node O O -> f -> UniqSM (Block node O O, f)) + -> Block node O O -> f - -> UniqSM (Block CmmNode O O, f) + -> UniqSM (Block node O O, f) foldRewriteNodesBwdOO rewriteOO initBlock initFacts = go initBlock initFacts where go (BCons node1 block1) !fact1 = (rewriteOO node1 `comp` go block1) fact1 diff --git a/testsuite/tests/cmm/should_compile/T20725.hs b/testsuite/tests/cmm/should_compile/T20725.hs new file mode 100644 index 0000000000..f5f355a74e --- /dev/null +++ b/testsuite/tests/cmm/should_compile/T20725.hs @@ -0,0 +1,25 @@ +module T20725 where + +import GHC.Cmm +import GHC.Cmm.Dataflow +import GHC.Cmm.Dataflow.Block +import GHC.Cmm.Dataflow.Collections +import GHC.Cmm.Dataflow.Graph +import GHC.Cmm.Dataflow.Label + +data TrivialFact = TrivialFact + +trivialLattice :: DataflowLattice TrivialFact +trivialLattice = DataflowLattice TrivialFact (\_ _ -> NotChanged TrivialFact) + +-- | ensures that analysis is possible independent of node type +trivialMap :: forall node . + (NonLocal node) + => GenCmmGraph node + -> LabelMap TrivialFact +trivialMap g = + analyzeCmmFwd trivialLattice transfer g startFacts + where startFacts = mkFactBase trivialLattice [] + transfer block facts = + asBase [(successor, TrivialFact) | successor <- successors block] + where asBase = mkFactBase trivialLattice diff --git a/testsuite/tests/cmm/should_compile/all.T b/testsuite/tests/cmm/should_compile/all.T index 9fc5479634..40813f01ec 100644 --- a/testsuite/tests/cmm/should_compile/all.T +++ b/testsuite/tests/cmm/should_compile/all.T @@ -4,3 +4,4 @@ test('cmm_sink_sp', [ only_ways(['optasm']), grep_errmsg('(\[Sp.*\]).*(=).*(\[.* test('T16930', normal, makefile_test, ['T16930']) test('T17442', normal, compile, ['']) +test('T20725', normal, compile, ['-package ghc']) |