1 {-# LANGUAGE PackageImports #-}
3 -- Functions to bring a Core expression in normal form. This module provides a
4 -- top level function "normalize", and defines the actual transformation passes that
7 module CLasH.Normalize (getNormalized, normalizeExpr, splitNormalized) where
11 import qualified Maybe
13 import qualified "transformers" Control.Monad.Trans as Trans
14 import qualified Control.Monad as Monad
15 import qualified Control.Monad.Trans.Writer as Writer
16 import qualified Data.Map as Map
17 import qualified Data.Monoid as Monoid
22 import qualified UniqSupply
23 import qualified CoreUtils
25 import qualified TcType
29 import qualified VarSet
30 import qualified NameSet
31 import qualified CoreFVs
32 import qualified CoreUtils
33 import qualified MkCore
34 import qualified HscTypes
35 import Outputable ( showSDoc, ppr, nest )
38 import CLasH.Normalize.NormalizeTypes
39 import CLasH.Translator.TranslatorTypes
40 import CLasH.Normalize.NormalizeTools
41 import CLasH.VHDL.VHDLTypes
42 import qualified CLasH.Utils as Utils
43 import CLasH.Utils.Core.CoreTools
44 import CLasH.Utils.Core.BinderTools
45 import CLasH.Utils.Pretty
47 --------------------------------
48 -- Start of transformations
49 --------------------------------
51 --------------------------------
53 --------------------------------
54 eta, etatop :: Transform
55 eta expr | is_fun expr && not (is_lam expr) = do
56 let arg_ty = (fst . Type.splitFunTy . CoreUtils.exprType) expr
57 id <- Trans.lift $ mkInternalVar "param" arg_ty
58 change (Lam id (App expr (Var id)))
59 -- Leave all other expressions unchanged
61 etatop = notappargs ("eta", eta)
63 --------------------------------
65 --------------------------------
66 beta, betatop :: Transform
67 -- Substitute arg for x in expr. For value lambda's, also clone before
69 beta (App (Lam x expr) arg) | CoreSyn.isTyVar x = setChanged >> substitute x arg expr
70 | otherwise = setChanged >> substitute_clone x arg expr
71 -- Propagate the application into the let
72 beta (App (Let binds expr) arg) = change $ Let binds (App expr arg)
73 -- Propagate the application into each of the alternatives
74 beta (App (Case scrut b ty alts) arg) = change $ Case scrut b ty' alts'
76 alts' = map (\(con, bndrs, expr) -> (con, bndrs, (App expr arg))) alts
77 ty' = CoreUtils.applyTypeToArg ty arg
78 -- Leave all other expressions unchanged
79 beta expr = return expr
80 -- Perform this transform everywhere
81 betatop = everywhere ("beta", beta)
83 --------------------------------
85 --------------------------------
86 -- Try to move casts as much downward as possible.
87 castprop, castproptop :: Transform
88 castprop (Cast (Let binds expr) ty) = change $ Let binds (Cast expr ty)
89 castprop expr@(Cast (Case scrut b _ alts) ty) = change (Case scrut b ty alts')
91 alts' = map (\(con, bndrs, expr) -> (con, bndrs, (Cast expr ty))) alts
92 -- Leave all other expressions unchanged
93 castprop expr = return expr
94 -- Perform this transform everywhere
95 castproptop = everywhere ("castprop", castprop)
97 --------------------------------
98 -- Cast simplification. Mostly useful for state packing and unpacking, but
99 -- perhaps for others as well.
100 --------------------------------
101 castsimpl, castsimpltop :: Transform
102 castsimpl expr@(Cast val ty) = do
103 -- Don't extract values that are already simpl
104 local_var <- Trans.lift $ is_local_var val
105 -- Don't extract values that are not representable, to prevent loops with
108 if (not local_var) && repr
110 -- Generate a binder for the expression
111 id <- Trans.lift $ mkBinderFor val "castval"
112 -- Extract the expression
113 change $ Let (NonRec id val) (Cast (Var id) ty)
116 -- Leave all other expressions unchanged
117 castsimpl expr = return expr
118 -- Perform this transform everywhere
119 castsimpltop = everywhere ("castsimpl", castsimpl)
122 --------------------------------
123 -- Lambda simplication
124 --------------------------------
125 -- Ensure that a lambda always evaluates to a let expressions or a simple
126 -- variable reference.
127 lambdasimpl, lambdasimpltop :: Transform
128 -- Don't simplify a lambda that evaluates to let, since this is already
129 -- normal form (and would cause infinite loops).
130 lambdasimpl expr@(Lam _ (Let _ _)) = return expr
131 -- Put the of a lambda in its own binding, but not when the expression is
132 -- already a local variable, or not representable (to prevent loops with
134 lambdasimpl expr@(Lam bndr res) = do
136 local_var <- Trans.lift $ is_local_var res
137 if not local_var && repr
139 id <- Trans.lift $ mkBinderFor res "res"
140 change $ Lam bndr (Let (NonRec id res) (Var id))
142 -- If the result is already a local var or not representable, don't
146 -- Leave all other expressions unchanged
147 lambdasimpl expr = return expr
148 -- Perform this transform everywhere
149 lambdasimpltop = everywhere ("lambdasimpl", lambdasimpl)
151 --------------------------------
152 -- let derecursification
153 --------------------------------
154 letderec, letderectop :: Transform
155 letderec expr@(Let (Rec binds) res) = case liftable of
156 -- Nothing is liftable, just return
158 -- Something can be lifted, generate a new let expression
159 _ -> change $ mkNonRecLets liftable (Let (Rec nonliftable) res)
161 -- Make a list of all the binders bound in this recursive let
162 bndrs = map fst binds
163 -- See which bindings are liftable
164 (liftable, nonliftable) = List.partition canlift binds
165 -- Any expression that does not use any of the binders in this recursive let
166 -- can be lifted into a nonrec let. It can't use its own binder either,
167 -- since that would mean the binding is self-recursive and should be in a
168 -- single bind recursive let.
169 canlift (bndr, e) = not $ expr_uses_binders bndrs e
170 -- Leave all other expressions unchanged
171 letderec expr = return expr
172 -- Perform this transform everywhere
173 letderectop = everywhere ("letderec", letderec)
175 --------------------------------
176 -- let simplification
177 --------------------------------
178 letsimpl, letsimpltop :: Transform
179 -- Don't simplify a let that evaluates to another let, since this is already
180 -- normal form (and would cause infinite loops with letflat below).
181 letsimpl expr@(Let _ (Let _ _)) = return expr
182 -- Put the "in ..." value of a let in its own binding, but not when the
183 -- expression is already a local variable, or not representable (to prevent loops with inlinenonrep).
184 letsimpl expr@(Let binds res) = do
186 local_var <- Trans.lift $ is_local_var res
187 if not local_var && repr
189 -- If the result is not a local var already (to prevent loops with
190 -- ourselves), extract it.
191 id <- Trans.lift $ mkBinderFor res "foo"
192 change $ Let binds (Let (NonRec id res) (Var id))
194 -- If the result is already a local var, don't extract it.
197 -- Leave all other expressions unchanged
198 letsimpl expr = return expr
199 -- Perform this transform everywhere
200 letsimpltop = everywhere ("letsimpl", letsimpl)
202 --------------------------------
204 --------------------------------
205 -- Takes a let that binds another let, and turns that into two nested lets.
207 -- let b = (let b' = expr' in res') in res
209 -- let b' = expr' in (let b = res' in res)
210 letflat, letflattop :: Transform
211 -- Turn a nonrec let that binds a let into two nested lets.
212 letflat (Let (NonRec b (Let binds res')) res) =
213 change $ Let binds (Let (NonRec b res') res)
214 letflat (Let (Rec binds) expr) = do
215 -- Flatten each binding.
216 binds' <- Utils.concatM $ Monad.mapM flatbind binds
217 -- Return the new let. We don't use change here, since possibly nothing has
218 -- changed. If anything has changed, flatbind has already flagged that
220 return $ Let (Rec binds') expr
222 -- Turns a binding of a let into a multiple bindings, or any other binding
223 -- into a list with just that binding
224 flatbind :: (CoreBndr, CoreExpr) -> TransformMonad [(CoreBndr, CoreExpr)]
225 flatbind (b, Let (Rec binds) expr) = change ((b, expr):binds)
226 flatbind (b, Let (NonRec b' expr') expr) = change [(b, expr), (b', expr')]
227 flatbind (b, expr) = return [(b, expr)]
228 -- Leave all other expressions unchanged
229 letflat expr = return expr
230 -- Perform this transform everywhere
231 letflattop = everywhere ("letflat", letflat)
233 --------------------------------
235 --------------------------------
236 -- Remove empty (recursive) lets
237 letremove, letremovetop :: Transform
238 letremove (Let (Rec []) res) = change $ res
239 -- Leave all other expressions unchanged
240 letremove expr = return expr
241 -- Perform this transform everywhere
242 letremovetop = everywhere ("letremove", letremove)
244 --------------------------------
245 -- Simple let binding removal
246 --------------------------------
247 -- Remove a = b bindings from let expressions everywhere
248 letremovesimpletop :: Transform
249 letremovesimpletop = everywhere ("letremovesimple", inlinebind (\(b, e) -> Trans.lift $ is_local_var e))
251 --------------------------------
252 -- Unused let binding removal
253 --------------------------------
254 letremoveunused, letremoveunusedtop :: Transform
255 letremoveunused expr@(Let (NonRec b bound) res) = do
256 let used = expr_uses_binders [b] res
260 letremoveunused expr@(Let (Rec binds) res) = do
261 -- Filter out all unused binds.
262 let binds' = filter dobind binds
263 -- Only set the changed flag if binds got removed
264 changeif (length binds' /= length binds) (Let (Rec binds') res)
266 bound_exprs = map snd binds
267 -- For each bind check if the bind is used by res or any of the bound
269 dobind (bndr, _) = any (expr_uses_binders [bndr]) (res:bound_exprs)
270 -- Leave all other expressions unchanged
271 letremoveunused expr = return expr
272 letremoveunusedtop = everywhere ("letremoveunused", letremoveunused)
275 --------------------------------
276 -- Identical let binding merging
277 --------------------------------
278 -- Merge two bindings in a let if they are identical
279 -- TODO: We would very much like to use GHC's CSE module for this, but that
280 -- doesn't track if something changed or not, so we can't use it properly.
281 letmerge, letmergetop :: Transform
282 letmerge expr@(Let _ _) = do
283 let (binds, res) = flattenLets expr
284 binds' <- domerge binds
285 return $ mkNonRecLets binds' res
287 domerge :: [(CoreBndr, CoreExpr)] -> TransformMonad [(CoreBndr, CoreExpr)]
288 domerge [] = return []
290 es' <- mapM (mergebinds e) es
294 -- Uses the second bind to simplify the second bind, if applicable.
295 mergebinds :: (CoreBndr, CoreExpr) -> (CoreBndr, CoreExpr) -> TransformMonad (CoreBndr, CoreExpr)
296 mergebinds (b1, e1) (b2, e2)
297 -- Identical expressions? Replace the second binding with a reference to
299 | CoreUtils.cheapEqExpr e1 e2 = change $ (b2, Var b1)
300 -- Different expressions? Don't change
301 | otherwise = return (b2, e2)
302 -- Leave all other expressions unchanged
303 letmerge expr = return expr
304 letmergetop = everywhere ("letmerge", letmerge)
307 --------------------------------
308 -- Non-representable binding inlining
309 --------------------------------
310 -- Remove a = B bindings, with B of a non-representable type, from let
311 -- expressions everywhere. This means that any value that we can't generate a
312 -- signal for, will be inlined and hopefully turned into something we can
315 -- This is a tricky function, which is prone to create loops in the
316 -- transformations. To fix this, we make sure that no transformation will
317 -- create a new let binding with a non-representable type. These other
318 -- transformations will just not work on those function-typed values at first,
319 -- but the other transformations (in particular β-reduction) should make sure
320 -- that the type of those values eventually becomes representable.
321 inlinenonreptop :: Transform
322 inlinenonreptop = everywhere ("inlinenonrep", inlinebind ((Monad.liftM not) . isRepr . snd))
324 --------------------------------
325 -- Top level function inlining
326 --------------------------------
327 -- This transformation inlines top level bindings that have been generated by
328 -- the compiler and are really simple. Really simple currently means that the
329 -- normalized form only contains a single binding, which catches most of the
330 -- cases where a top level function is created that simply calls a type class
331 -- method with a type and dictionary argument, e.g.
332 -- fromInteger = GHC.Num.fromInteger (SizedWord D8) $dNum
333 -- which is later called using simply
334 -- fromInteger (smallInteger 10)
335 -- By inlining such calls to simple, compiler generated functions, we prevent
336 -- huge amounts of trivial components in the VHDL output, which the user never
337 -- wanted. We never inline user-defined functions, since we want to preserve
338 -- all structure defined by the user. Currently this includes all functions
339 -- that were created by funextract, since we would get loops otherwise.
341 -- Note that "defined by the compiler" isn't completely watertight, since GHC
342 -- doesn't seem to set all those names as "system names", we apply some
344 inlinetoplevel, inlinetopleveltop :: Transform
345 -- Any system name is candidate for inlining. Never inline user-defined
346 -- functions, to preserve structure.
347 inlinetoplevel expr@(Var f) | not $ isUserDefined f = do
348 norm <- isNormalizeable f
349 -- See if this is a top level binding for which we have a body
350 body_maybe <- Trans.lift $ getGlobalBind f
351 if norm && Maybe.isJust body_maybe
353 -- Get the normalized version
354 norm <- Trans.lift $ getNormalized f
357 -- Regenerate all uniques in the to-be-inlined expression
358 norm_uniqued <- Trans.lift $ genUniques norm
363 -- No body or not normalizeable.
365 -- Leave all other expressions unchanged
366 inlinetoplevel expr = return expr
367 inlinetopleveltop = everywhere ("inlinetoplevel", inlinetoplevel)
369 needsInline :: CoreExpr -> Bool
370 needsInline expr = case splitNormalized expr of
371 -- Inline any function that only has a single definition, it is probably
372 -- simple enough. This might inline some stuff that it shouldn't though it
373 -- will never inline user-defined functions (inlinetoplevel only tries
374 -- system names) and inlining should never break things.
375 (args, [bind], res) -> True
378 --------------------------------
379 -- Scrutinee simplification
380 --------------------------------
381 scrutsimpl,scrutsimpltop :: Transform
382 -- Don't touch scrutinees that are already simple
383 scrutsimpl expr@(Case (Var _) _ _ _) = return expr
384 -- Replace all other cases with a let that binds the scrutinee and a new
385 -- simple scrutinee, but only when the scrutinee is representable (to prevent
386 -- loops with inlinenonrep, though I don't think a non-representable scrutinee
387 -- will be supported anyway...)
388 scrutsimpl expr@(Case scrut b ty alts) = do
392 id <- Trans.lift $ mkBinderFor scrut "scrut"
393 change $ Let (NonRec id scrut) (Case (Var id) b ty alts)
396 -- Leave all other expressions unchanged
397 scrutsimpl expr = return expr
398 -- Perform this transform everywhere
399 scrutsimpltop = everywhere ("scrutsimpl", scrutsimpl)
401 --------------------------------
402 -- Case binder wildening
403 --------------------------------
404 casesimpl, casesimpltop :: Transform
405 -- This is already a selector case (or, if x does not appear in bndrs, a very
406 -- simple case statement that will be removed by caseremove below). Just leave
408 casesimpl expr@(Case scrut b ty [(con, bndrs, Var x)]) = return expr
409 -- Make sure that all case alternatives have only wild binders and simple
411 -- This is done by creating a new let binding for each non-wild binder, which
412 -- is bound to a new simple selector case statement and for each complex
413 -- expression. We do this only for representable types, to prevent loops with
415 casesimpl expr@(Case scrut b ty alts) = do
416 (bindingss, alts') <- (Monad.liftM unzip) $ mapM doalt alts
417 let bindings = concat bindingss
418 -- Replace the case with a let with bindings and a case
419 let newlet = mkNonRecLets bindings (Case scrut b ty alts')
420 -- If there are no non-wild binders, or this case is already a simple
421 -- selector (i.e., a single alt with exactly one binding), already a simple
422 -- selector altan no bindings (i.e., no wild binders in the original case),
423 -- don't change anything, otherwise, replace the case.
424 if null bindings then return expr else change newlet
426 -- Generate a single wild binder, since they are all the same
427 wild = MkCore.mkWildBinder
428 -- Wilden the binders of one alt, producing a list of bindings as a
430 doalt :: CoreAlt -> TransformMonad ([(CoreBndr, CoreExpr)], CoreAlt)
431 doalt (con, bndrs, expr) = do
432 -- Make each binder wild, if possible
433 bndrs_res <- Monad.zipWithM dobndr bndrs [0..]
434 let (newbndrs, bindings_maybe) = unzip bndrs_res
435 -- Extract a complex expression, if possible. For this we check if any of
436 -- the new list of bndrs are used by expr. We can't use free_vars here,
437 -- since that looks at the old bndrs.
438 let uses_bndrs = not $ VarSet.isEmptyVarSet $ CoreFVs.exprSomeFreeVars (`elem` newbndrs) $ expr
439 (exprbinding_maybe, expr') <- doexpr expr uses_bndrs
440 -- Create a new alternative
441 let newalt = (con, newbndrs, expr')
442 let bindings = Maybe.catMaybes (bindings_maybe ++ [exprbinding_maybe])
443 return (bindings, newalt)
445 -- Make wild alternatives for each binder
446 wildbndrs = map (\bndr -> MkCore.mkWildBinder (Id.idType bndr)) bndrs
447 -- A set of all the binders that are used by the expression
448 free_vars = CoreFVs.exprSomeFreeVars (`elem` bndrs) expr
449 -- Look at the ith binder in the case alternative. Return a new binder
450 -- for it (either the same one, or a wild one) and optionally a let
451 -- binding containing a case expression.
452 dobndr :: CoreBndr -> Int -> TransformMonad (CoreBndr, Maybe (CoreBndr, CoreExpr))
455 -- Is b wild (e.g., not a free var of expr. Since b is only in scope
456 -- in expr, this means that b is unused if expr does not use it.)
457 let wild = not (VarSet.elemVarSet b free_vars)
458 -- Create a new binding for any representable binder that is not
459 -- already wild and is representable (to prevent loops with
461 if (not wild) && repr
463 -- Create on new binder that will actually capture a value in this
464 -- case statement, and return it.
465 let bty = (Id.idType b)
466 id <- Trans.lift $ mkInternalVar "sel" bty
467 let binders = take i wildbndrs ++ [id] ++ drop (i+1) wildbndrs
468 let caseexpr = Case scrut b bty [(con, binders, Var id)]
469 return (wildbndrs!!i, Just (b, caseexpr))
471 -- Just leave the original binder in place, and don't generate an
472 -- extra selector case.
474 -- Process the expression of a case alternative. Accepts an expression
475 -- and whether this expression uses any of the binders in the
476 -- alternative. Returns an optional new binding and a new expression.
477 doexpr :: CoreExpr -> Bool -> TransformMonad (Maybe (CoreBndr, CoreExpr), CoreExpr)
478 doexpr expr uses_bndrs = do
479 local_var <- Trans.lift $ is_local_var expr
481 -- Extract any expressions that do not use any binders from this
482 -- alternative, is not a local var already and is representable (to
483 -- prevent loops with inlinenonrep).
484 if (not uses_bndrs) && (not local_var) && repr
486 id <- Trans.lift $ mkBinderFor expr "caseval"
487 -- We don't flag a change here, since casevalsimpl will do that above
488 -- based on Just we return here.
489 return $ (Just (id, expr), Var id)
491 -- Don't simplify anything else
492 return (Nothing, expr)
493 -- Leave all other expressions unchanged
494 casesimpl expr = return expr
495 -- Perform this transform everywhere
496 casesimpltop = everywhere ("casesimpl", casesimpl)
498 --------------------------------
500 --------------------------------
501 -- Remove case statements that have only a single alternative and only wild
503 caseremove, caseremovetop :: Transform
504 -- Replace a useless case by the value of its single alternative
505 caseremove (Case scrut b ty [(con, bndrs, expr)]) | not usesvars = change expr
506 -- Find if any of the binders are used by expr
507 where usesvars = (not . VarSet.isEmptyVarSet . (CoreFVs.exprSomeFreeVars (`elem` bndrs))) expr
508 -- Leave all other expressions unchanged
509 caseremove expr = return expr
510 -- Perform this transform everywhere
511 caseremovetop = everywhere ("caseremove", caseremove)
513 --------------------------------
514 -- Argument extraction
515 --------------------------------
516 -- Make sure that all arguments of a representable type are simple variables.
517 appsimpl, appsimpltop :: Transform
518 -- Simplify all representable arguments. Do this by introducing a new Let
519 -- that binds the argument and passing the new binder in the application.
520 appsimpl expr@(App f arg) = do
521 -- Check runtime representability
523 local_var <- Trans.lift $ is_local_var arg
524 if repr && not local_var
525 then do -- Extract representable arguments
526 id <- Trans.lift $ mkBinderFor arg "arg"
527 change $ Let (NonRec id arg) (App f (Var id))
528 else -- Leave non-representable arguments unchanged
530 -- Leave all other expressions unchanged
531 appsimpl expr = return expr
532 -- Perform this transform everywhere
533 appsimpltop = everywhere ("appsimpl", appsimpl)
535 --------------------------------
536 -- Function-typed argument propagation
537 --------------------------------
538 -- Remove all applications to function-typed arguments, by duplication the
539 -- function called with the function-typed parameter replaced by the free
540 -- variables of the argument passed in.
541 argprop, argproptop :: Transform
542 -- Transform any application of a named function (i.e., skip applications of
543 -- lambda's). Also skip applications that have arguments with free type
544 -- variables, since we can't inline those.
545 argprop expr@(App _ _) | is_var fexpr = do
546 -- Find the body of the function called
547 body_maybe <- Trans.lift $ getGlobalBind f
550 -- Process each of the arguments in turn
551 (args', changed) <- Writer.listen $ mapM doarg args
552 -- See if any of the arguments changed
553 case Monoid.getAny changed of
555 let (newargs', newparams', oldargs) = unzip3 args'
556 let newargs = concat newargs'
557 let newparams = concat newparams'
558 -- Create a new body that consists of a lambda for all new arguments and
559 -- the old body applied to some arguments.
560 let newbody = MkCore.mkCoreLams newparams (MkCore.mkCoreApps body oldargs)
561 -- Create a new function with the same name but a new body
562 newf <- Trans.lift $ mkFunction f newbody
563 -- Replace the original application with one of the new function to the
565 change $ MkCore.mkCoreApps (Var newf) newargs
567 -- Don't change the expression if none of the arguments changed
570 -- If we don't have a body for the function called, leave it unchanged (it
571 -- should be a primitive function then).
572 Nothing -> return expr
574 -- Find the function called and the arguments
575 (fexpr, args) = collectArgs expr
578 -- Process a single argument and return (args, bndrs, arg), where args are
579 -- the arguments to replace the given argument in the original
580 -- application, bndrs are the binders to include in the top-level lambda
581 -- in the new function body, and arg is the argument to apply to the old
583 doarg :: CoreExpr -> TransformMonad ([CoreExpr], [CoreBndr], CoreExpr)
586 bndrs <- Trans.lift getGlobalBinders
587 let interesting var = Var.isLocalVar var && (not $ var `elem` bndrs)
588 if not repr && not (is_var arg && interesting (exprToVar arg)) && not (has_free_tyvars arg)
590 -- Propagate all complex arguments that are not representable, but not
591 -- arguments with free type variables (since those would require types
592 -- not known yet, which will always be known eventually).
593 -- Find interesting free variables, each of which should be passed to
594 -- the new function instead of the original function argument.
596 -- Interesting vars are those that are local, but not available from the
597 -- top level scope (functions from this module are defined as local, but
598 -- they're not local to this function, so we can freely move references
599 -- to them into another function).
600 let free_vars = VarSet.varSetElems $ CoreFVs.exprSomeFreeVars interesting arg
601 -- Mark the current expression as changed
603 return (map Var free_vars, free_vars, arg)
605 -- Representable types will not be propagated, and arguments with free
606 -- type variables will be propagated later.
607 -- TODO: preserve original naming?
608 id <- Trans.lift $ mkBinderFor arg "param"
609 -- Just pass the original argument to the new function, which binds it
610 -- to a new id and just pass that new id to the old function body.
611 return ([arg], [id], mkReferenceTo id)
612 -- Leave all other expressions unchanged
613 argprop expr = return expr
614 -- Perform this transform everywhere
615 argproptop = everywhere ("argprop", argprop)
617 --------------------------------
618 -- Function-typed argument extraction
619 --------------------------------
620 -- This transform takes any function-typed argument that cannot be propagated
621 -- (because the function that is applied to it is a builtin function), and
622 -- puts it in a brand new top level binder. This allows us to for example
623 -- apply map to a lambda expression This will not conflict with inlinenonrep,
624 -- since that only inlines local let bindings, not top level bindings.
625 funextract, funextracttop :: Transform
626 funextract expr@(App _ _) | is_var fexpr = do
627 body_maybe <- Trans.lift $ getGlobalBind f
629 -- We don't have a function body for f, so we can perform this transform.
631 -- Find the new arguments
632 args' <- mapM doarg args
633 -- And update the arguments. We use return instead of changed, so the
634 -- changed flag doesn't get set if none of the args got changed.
635 return $ MkCore.mkCoreApps fexpr args'
636 -- We have a function body for f, leave this application to funprop
637 Just _ -> return expr
639 -- Find the function called and the arguments
640 (fexpr, args) = collectArgs expr
642 -- Change any arguments that have a function type, but are not simple yet
643 -- (ie, a variable or application). This means to create a new function
644 -- for map (\f -> ...) b, but not for map (foo a) b.
646 -- We could use is_applicable here instead of is_fun, but I think
647 -- arguments to functions could only have forall typing when existential
648 -- typing is enabled. Not sure, though.
649 doarg arg | not (is_simple arg) && is_fun arg = do
650 -- Create a new top level binding that binds the argument. Its body will
651 -- be extended with lambda expressions, to take any free variables used
652 -- by the argument expression.
653 let free_vars = VarSet.varSetElems $ CoreFVs.exprFreeVars arg
654 let body = MkCore.mkCoreLams free_vars arg
655 id <- Trans.lift $ mkBinderFor body "fun"
656 Trans.lift $ addGlobalBind id body
657 -- Replace the argument with a reference to the new function, applied to
659 change $ MkCore.mkCoreApps (Var id) (map Var free_vars)
660 -- Leave all other arguments untouched
661 doarg arg = return arg
663 -- Leave all other expressions unchanged
664 funextract expr = return expr
665 -- Perform this transform everywhere
666 funextracttop = everywhere ("funextract", funextract)
668 --------------------------------
669 -- Ensure that a function that just returns another function (or rather,
670 -- another top-level binder) is still properly normalized. This is a temporary
671 -- solution, we should probably integrate this pass with lambdasimpl and
673 --------------------------------
674 simplrestop expr@(Lam _ _) = return expr
675 simplrestop expr@(Let _ _) = return expr
676 simplrestop expr = do
677 local_var <- Trans.lift $ is_local_var expr
678 -- Don't extract values that are not representable, to prevent loops with
681 if local_var || not repr
685 id <- Trans.lift $ mkBinderFor expr "res"
686 change $ Let (NonRec id expr) (Var id)
687 --------------------------------
688 -- End of transformations
689 --------------------------------
694 -- What transforms to run?
695 transforms = [inlinetopleveltop, argproptop, funextracttop, etatop, betatop, castproptop, letremovesimpletop, letderectop, letremovetop, letsimpltop, letflattop, scrutsimpltop, casesimpltop, caseremovetop, inlinenonreptop, appsimpltop, letremoveunusedtop, castsimpltop, lambdasimpltop, simplrestop]
697 -- | Returns the normalized version of the given function.
699 CoreBndr -- ^ The function to get
700 -> TranslatorSession CoreExpr -- The normalized function body
702 getNormalized bndr = Utils.makeCached bndr tsNormalized $ do
703 if is_poly (Var bndr)
705 -- This should really only happen at the top level... TODO: Give
706 -- a different error if this happens down in the recursion.
707 error $ "\nNormalize.normalizeBind: Function " ++ show bndr ++ " is polymorphic, can't normalize"
709 expr <- getBinding bndr
710 normalizeExpr (show bndr) expr
712 -- | Normalize an expression
714 String -- ^ What are we normalizing? For debug output only.
715 -> CoreSyn.CoreExpr -- ^ The expression to normalize
716 -> TranslatorSession CoreSyn.CoreExpr -- ^ The normalized expression
718 normalizeExpr what expr = do
719 expr_uniqued <- genUniques expr
720 -- Normalize this expression
721 trace (what ++ " before normalization:\n\n" ++ showSDoc ( ppr expr_uniqued ) ++ "\n") $ return ()
722 expr' <- dotransforms transforms expr_uniqued
723 trace ("\n" ++ what ++ " after normalization:\n\n" ++ showSDoc ( ppr expr')) $ return ()
726 -- | Get the value that is bound to the given binder at top level. Fails when
727 -- there is no such binding.
729 CoreBndr -- ^ The binder to get the expression for
730 -> TranslatorSession CoreExpr -- ^ The value bound to the binder
732 getBinding bndr = Utils.makeCached bndr tsBindings $ do
733 -- If the binding isn't in the "cache" (bindings map), then we can't create
734 -- it out of thin air, so return an error.
735 error $ "Normalize.getBinding: Unknown function requested: " ++ show bndr
737 -- | Split a normalized expression into the argument binders, top level
738 -- bindings and the result binder.
740 CoreExpr -- ^ The normalized expression
741 -> ([CoreBndr], [Binding], CoreBndr)
742 splitNormalized expr = (args, binds, res)
744 (args, letexpr) = CoreSyn.collectBinders expr
745 (binds, resexpr) = flattenLets letexpr
746 res = case resexpr of
748 _ -> error $ "Normalize.splitNormalized: Not in normal form: " ++ pprString expr ++ "\n"