summaryrefslogtreecommitdiff
path: root/compiler/cmm/Hoopl/Dataflow.hs
diff options
context:
space:
mode:
authorSimon Peyton Jones <simonpj@microsoft.com>2015-01-05 16:57:01 +0000
committerSimon Peyton Jones <simonpj@microsoft.com>2015-01-05 17:00:05 +0000
commit0b3f53fb8d86278ead96ea08bedd8990d3256dc4 (patch)
treed3ae62380f95ab44b711a4d4a7b8eb9630746069 /compiler/cmm/Hoopl/Dataflow.hs
parentd6c8da69ed75f0a046bfcf779e71a4ecd2dab106 (diff)
downloadhaskell-wip/redundant-constraints.tar.gz
Remove redundant constraints in the compiler itself, found by -fwarn-redundant-constraintswip/redundant-constraints
Diffstat (limited to 'compiler/cmm/Hoopl/Dataflow.hs')
-rw-r--r--compiler/cmm/Hoopl/Dataflow.hs2
1 files changed, 1 insertions, 1 deletions
diff --git a/compiler/cmm/Hoopl/Dataflow.hs b/compiler/cmm/Hoopl/Dataflow.hs
index 4fbf42e607..29c7afedb4 100644
--- a/compiler/cmm/Hoopl/Dataflow.hs
+++ b/compiler/cmm/Hoopl/Dataflow.hs
@@ -763,7 +763,7 @@ normalizeGraph g = (mapGraphBlocks dropFact g, facts g)
exitFacts (JustO (DBlock f b)) = mapSingleton (entryLabel b) f
bodyFacts :: LabelMap (DBlock f n C C) -> FactBase f
bodyFacts body = mapFoldWithKey f noFacts body
- where f :: forall t a x. (NonLocal t) => Label -> DBlock a t C x -> LabelMap a -> LabelMap a
+ where f :: forall t a x. Label -> DBlock a t C x -> LabelMap a -> LabelMap a
f lbl (DBlock f _) fb = mapInsert lbl f fb
--- implementation of the constructors (boring)