%
-% (c) The AQUA Project, Glasgow University, 1994-1995
+% (c) The AQUA Project, Glasgow University, 1994-1996
%
-\section[CoreUnfold]{Core-syntax functions to do with unfoldings}
+\section[CoreUnfold]{Core-syntax unfoldings}
+
+Unfoldings (which can travel across module boundaries) are in Core
+syntax (namely @CoreExpr@s).
+
+The type @Unfolding@ sits ``above'' simply-Core-expressions
+unfoldings, capturing ``higher-level'' things we know about a binding,
+usually things that the simplifier found out (e.g., ``it's a
+literal''). In the corner of a @SimpleUnfolding@ unfolding, you will
+find, unsurprisingly, a Core expression.
\begin{code}
#include "HsVersions.h"
module CoreUnfold (
- calcUnfoldingGuidance,
+ SimpleUnfolding(..), Unfolding(..), UnfoldingGuidance(..), -- types
- pprCoreUnfolding,
- mentionedInUnfolding
+ FormSummary(..), mkFormSummary, whnfOrBottom, exprSmallEnoughToDup,
+
+ smallEnoughToInline, couldBeSmallEnoughToInline,
+ mkSimpleUnfolding,
+ mkMagicUnfolding,
+ calcUnfoldingGuidance,
+ mentionedInUnfolding
) where
-import AbsPrel ( primOpCanTriggerGC, PrimOp(..), PrimKind
- IF_ATTACK_PRAGMAS(COMMA tagOf_PrimOp)
- IF_ATTACK_PRAGMAS(COMMA pprPrimOp)
- )
-import AbsUniType ( getMentionedTyConsAndClassesFromUniType,
- getUniDataTyCon, getTyConFamilySize,
- pprParendUniType, Class, TyCon, TyVar,
- UniType, TauType(..)
- IF_ATTACK_PRAGMAS(COMMA cmpTyCon COMMA cmpClass)
- IF_ATTACK_PRAGMAS(COMMA cmpTyVar)
- IF_ATTACK_PRAGMAS(COMMA cmpUniType)
- )
-import Bag
-import BasicLit ( isNoRepLit, isLitLitLit, BasicLit(..){-.. is for pragmas-} )
+IMP_Ubiq()
+IMPORT_DELOOPER(IdLoop) -- for paranoia checking;
+ -- and also to get mkMagicUnfoldingFun
+IMPORT_DELOOPER(PrelLoop) -- for paranoia checking
+
+import Bag ( emptyBag, unitBag, unionBags, Bag )
import CgCompInfo ( uNFOLDING_CHEAP_OP_COST,
uNFOLDING_DEAR_OP_COST,
uNFOLDING_NOREP_LIT_COST
)
-import CoreFuns ( digForLambdas, typeOfCoreExpr )
-import CoreSyn -- mostly re-exporting this stuff
-import CostCentre ( showCostCentre, noCostCentreAttached,
- currentOrSubsumedCosts, ccMentionsId, CostCentre
- )
-import Id ( pprIdInUnfolding, getIdUniType,
- whatsMentionedInId, Id, DataCon(..)
- )
-import IdInfo
-import Maybes
-import Outputable
-import PlainCore ( instCoreExpr )
+import CoreSyn
+import CoreUtils ( coreExprType )
+import CostCentre ( ccMentionsId )
+import Id ( idType, getIdArity, isBottomingId,
+ SYN_IE(IdSet), GenId{-instances-} )
+import PrimOp ( primOpCanTriggerGC, fragilePrimOp, PrimOp(..) )
+import IdInfo ( arityMaybe, bottomIsGuaranteed )
+import Literal ( isNoRepLit, isLitLitLit )
import Pretty
-import SimplEnv ( UnfoldingGuidance(..) )
-import UniqSet
-import Unique ( uniqSupply_u, UniqueSupply )
-import Util
+import TyCon ( tyConFamilySize )
+import Type ( maybeAppDataTyConExpandingDicts )
+import UniqSet ( emptyUniqSet, unitUniqSet, mkUniqSet,
+ addOneToUniqSet, unionUniqSets
+ )
+import Usage ( SYN_IE(UVar) )
+import Util ( isIn, panic, assertPanic )
+
+whatsMentionedInId = panic "whatsMentionedInId (CoreUnfold)"
+getMentionedTyConsAndClassesFromType = panic "getMentionedTyConsAndClassesFromType (CoreUnfold)"
+\end{code}
+
+%************************************************************************
+%* *
+\subsection{@Unfolding@ and @UnfoldingGuidance@ types}
+%* *
+%************************************************************************
+
+\begin{code}
+data Unfolding
+ = NoUnfolding
+ | CoreUnfolding SimpleUnfolding
+ | MagicUnfolding
+ Unique -- of the Id whose magic unfolding this is
+ MagicUnfoldingFun
+
+
+data SimpleUnfolding
+ = SimpleUnfolding FormSummary -- Tells whether the template is a WHNF or bottom
+ UnfoldingGuidance -- Tells about the *size* of the template.
+ TemplateOutExpr -- The template
+
+type TemplateOutExpr = GenCoreExpr (Id, BinderInfo) Id TyVar UVar
+ -- An OutExpr with occurrence info attached. This is used as
+ -- a template in GeneralForms.
+
+
+mkSimpleUnfolding form guidance template
+ = SimpleUnfolding form guidance template
+
+mkMagicUnfolding :: Unique -> Unfolding
+mkMagicUnfolding tag = MagicUnfolding tag (mkMagicUnfoldingFun tag)
+
+
+data UnfoldingGuidance
+ = UnfoldNever
+ | UnfoldAlways -- There is no "original" definition,
+ -- so you'd better unfold. Or: something
+ -- so cheap to unfold (e.g., 1#) that
+ -- you should do it absolutely always.
+
+ | UnfoldIfGoodArgs Int -- if "m" type args
+ Int -- and "n" value args
+ [Int] -- Discount if the argument is evaluated.
+ -- (i.e., a simplification will definitely
+ -- be possible). One elt of the list per *value* arg.
+ Int -- The "size" of the unfolding; to be elaborated
+ -- later. ToDo
+\end{code}
+
+\begin{code}
+instance Outputable UnfoldingGuidance where
+ ppr sty UnfoldAlways = ppStr "_ALWAYS_"
+-- ppr sty EssentialUnfolding = ppStr "_ESSENTIAL_" -- shouldn't appear in an iface
+ ppr sty (UnfoldIfGoodArgs t v cs size)
+ = ppCat [ppStr "_IF_ARGS_", ppInt t, ppInt v,
+ if null cs -- always print *something*
+ then ppChar 'X'
+ else ppBesides (map (ppStr . show) cs),
+ ppInt size ]
+\end{code}
+
+
+%************************************************************************
+%* *
+\subsection{Figuring out things about expressions}
+%* *
+%************************************************************************
+
+\begin{code}
+data FormSummary
+ = VarForm -- Expression is a variable (or scc var, etc)
+ | ValueForm -- Expression is a value: i.e. a value-lambda,constructor, or literal
+ | BottomForm -- Expression is guaranteed to be bottom. We're more gung
+ -- ho about inlining such things, because it can't waste work
+ | OtherForm -- Anything else
+
+instance Outputable FormSummary where
+ ppr sty VarForm = ppStr "Var"
+ ppr sty ValueForm = ppStr "Value"
+ ppr sty BottomForm = ppStr "Bot"
+ ppr sty OtherForm = ppStr "Other"
+
+mkFormSummary ::GenCoreExpr bndr Id tyvar uvar -> FormSummary
+
+mkFormSummary expr
+ = go (0::Int) expr -- The "n" is the number of (value) arguments so far
+ where
+ go n (Lit _) = ASSERT(n==0) ValueForm
+ go n (Con _ _) = ASSERT(n==0) ValueForm
+ go n (Prim _ _) = OtherForm
+ go n (SCC _ e) = go n e
+ go n (Coerce _ _ e) = go n e
+ go n (Let _ e) = OtherForm
+ go n (Case _ _) = OtherForm
+
+ go 0 (Lam (ValBinder x) e) = ValueForm -- NB: \x.bottom /= bottom!
+ go n (Lam (ValBinder x) e) = go (n-1) e -- Applied lambda
+ go n (Lam other_binder e) = go n e
+
+ go n (App fun arg) | isValArg arg = go (n+1) fun
+ go n (App fun other_arg) = go n fun
+
+ go n (Var f) | isBottomingId f = BottomForm
+ go 0 (Var f) = VarForm
+ go n (Var f) = case (arityMaybe (getIdArity f)) of
+ Just arity | n < arity -> ValueForm
+ other -> OtherForm
+
+whnfOrBottom :: GenCoreExpr bndr Id tyvar uvar -> Bool
+whnfOrBottom e = case mkFormSummary e of
+ VarForm -> True
+ ValueForm -> True
+ BottomForm -> True
+ OtherForm -> False
\end{code}
+
+\begin{code}
+exprSmallEnoughToDup (Con _ _) = True -- Could check # of args
+exprSmallEnoughToDup (Prim op _) = not (fragilePrimOp op) -- Could check # of args
+exprSmallEnoughToDup (Lit lit) = not (isNoRepLit lit)
+exprSmallEnoughToDup expr
+ = case (collectArgs expr) of { (fun, _, _, vargs) ->
+ case fun of
+ Var v | length vargs == 0 -> True
+ _ -> False
+ }
+
+{- LATER:
+WAS: MORE CLEVER:
+exprSmallEnoughToDup expr -- for now, just: <var> applied to <args>
+ = case (collectArgs expr) of { (fun, _, _, vargs) ->
+ case fun of
+ Var v -> v /= buildId
+ && v /= augmentId
+ && length vargs <= 6 -- or 10 or 1 or 4 or anything smallish.
+ _ -> False
+ }
+-}
+\end{code}
+Question (ADR): What is the above used for? Is a _ccall_ really small
+enough?
+
%************************************************************************
%* *
\subsection[calcUnfoldingGuidance]{Calculate ``unfolding guidance'' for an expression}
\begin{code}
calcUnfoldingGuidance
- :: Bool -- True <=> OK if _scc_s appear in expr
- -> Int -- bomb out if size gets bigger than this
- -> PlainCoreExpr -- expression to look at
+ :: Bool -- True <=> OK if _scc_s appear in expr
+ -> Int -- bomb out if size gets bigger than this
+ -> CoreExpr -- expression to look at
-> UnfoldingGuidance
calcUnfoldingGuidance scc_s_OK bOMB_OUT_SIZE expr
= let
- (ty_binders, val_binders, body) = digForLambdas expr
+ (use_binders, ty_binders, val_binders, body) = collectBinders expr
in
case (sizeExpr scc_s_OK bOMB_OUT_SIZE val_binders body) of
Nothing -> UnfoldNever
Just (size, cased_args)
- -> let
+ -> let
uf = UnfoldIfGoodArgs
(length ty_binders)
(length val_binders)
- [ b `is_elem` cased_args | b <- val_binders ]
+ (map discount_for val_binders)
size
+
+ discount_for b
+ | is_data && b `is_elem` cased_args = tyConFamilySize tycon
+ | otherwise = 0
+ where
+ (is_data, tycon)
+ = --trace "CoreUnfold.getAppDataTyConExpandingDicts:1" $
+ case (maybeAppDataTyConExpandingDicts (idType b)) of
+ Nothing -> (False, panic "discount")
+ Just (tc,_,_) -> (True, tc)
in
-- pprTrace "calcUnfold:" (ppAbove (ppr PprDebug uf) (ppr PprDebug expr))
uf
-> Int -- Bomb out if it gets bigger than this
-> [Id] -- Arguments; we're interested in which of these
-- get case'd
- -> PlainCoreExpr
+ -> CoreExpr
-> Maybe (Int, -- Size
[Id] -- Subset of args which are cased
)
sizeExpr scc_s_OK bOMB_OUT_SIZE args expr
= size_up expr
where
- size_up (CoVar v) = sizeOne
- size_up (CoApp fun arg) = size_up fun `addSizeN` 1
- size_up (CoTyApp fun ty) = size_up fun -- They're free
- size_up (CoLit lit) = if isNoRepLit lit
+ size_up (Var v) = sizeOne
+ size_up (App fun arg) = size_up fun `addSize` size_up_arg arg
+ size_up (Lit lit) = if isNoRepLit lit
then sizeN uNFOLDING_NOREP_LIT_COST
else sizeOne
- size_up (CoSCC _ (CoCon _ _ _)) = Nothing -- **** HACK *****
- size_up (CoSCC lbl body)
+ size_up (SCC _ (Con _ _)) = Nothing -- **** HACK *****
+ size_up (SCC lbl body)
= if scc_s_OK then size_up body else Nothing
- size_up (CoCon con tys args) = sizeN (length args + 1)
- size_up (CoPrim op tys args) = sizeN op_cost -- NB: no charge for PrimOp args
+ size_up (Coerce _ _ body) = size_up body -- Coercions cost nothing
+
+ size_up (Con con args) = -- 1 + # of val args
+ sizeN (1 + numValArgs args)
+ size_up (Prim op args) = sizeN op_cost -- NB: no charge for PrimOp args
where
op_cost = if primOpCanTriggerGC op
then uNFOLDING_DEAR_OP_COST
-- number chosen to avoid unfolding (HACK)
else uNFOLDING_CHEAP_OP_COST
- size_up (CoLam binders body) = size_up body `addSizeN` length binders
- size_up (CoTyLam tyvar body) = size_up body
+ size_up expr@(Lam _ _)
+ = let
+ (uvars, tyvars, args, body) = collectBinders expr
+ in
+ size_up body `addSizeN` length args
- size_up (CoLet (CoNonRec binder rhs) body)
+ size_up (Let (NonRec binder rhs) body)
= size_up rhs
`addSize`
size_up body
`addSizeN`
1
- size_up (CoLet (CoRec pairs) body)
+ size_up (Let (Rec pairs) body)
= foldr addSize sizeZero [size_up rhs | (_,rhs) <- pairs]
`addSize`
size_up body
`addSizeN`
length pairs
-
- size_up (CoCase scrut alts)
- = size_up_scrut scrut
+
+ size_up (Case scrut alts)
+ = size_up_scrut scrut
`addSize`
- size_up_alts (typeOfCoreExpr scrut) alts
+ size_up_alts (coreExprType scrut) alts
-- We charge for the "case" itself in "size_up_alts"
------------
- size_up_alts scrut_ty (CoAlgAlts alts deflt)
+ size_up_arg arg = if isValArg arg then sizeOne else sizeZero{-it's free-}
+
+ ------------
+ size_up_alts scrut_ty (AlgAlts alts deflt)
= foldr (addSize . size_alg_alt) (size_up_deflt deflt) alts
- `addSizeN`
- (case (getTyConFamilySize tycon) of { Just n -> n })
+ `addSizeN` (if is_data then tyConFamilySize tycon else 1{-??-})
-- NB: we charge N for an alg. "case", where N is
-- the number of constructors in the thing being eval'd.
-- (You'll eventually get a "discount" of N if you
size_alg_alt (con,args,rhs) = size_up rhs
-- Don't charge for args, so that wrappers look cheap
- (tycon, _, _) = getUniDataTyCon scrut_ty
+ (is_data,tycon)
+ = --trace "CoreUnfold.getAppDataTyConExpandingDicts:2" $
+ case (maybeAppDataTyConExpandingDicts scrut_ty) of
+ Nothing -> (False, panic "size_up_alts")
+ Just (tc,_,_) -> (True, tc)
-
- size_up_alts _ (CoPrimAlts alts deflt)
- = foldr (addSize . size_prim_alt) (size_up_deflt deflt) alts
+ size_up_alts _ (PrimAlts alts deflt)
+ = foldr (addSize . size_prim_alt) (size_up_deflt deflt) alts
-- *no charge* for a primitive "case"!
where
size_prim_alt (lit,rhs) = size_up rhs
------------
- size_up_deflt CoNoDefault = sizeZero
- size_up_deflt (CoBindDefault binder rhs) = size_up rhs
+ size_up_deflt NoDefault = sizeZero
+ size_up_deflt (BindDefault binder rhs) = size_up rhs
------------
-- Scrutinees. There are two things going on here.
-- First, we want to record if we're case'ing an argument
-- Second, we want to charge nothing for the srutinee if it's just
-- a variable. That way wrapper-like things look cheap.
- size_up_scrut (CoVar v) | v `is_elem` args = Just (0, [v])
+ size_up_scrut (Var v) | v `is_elem` args = Just (0, [v])
| otherwise = Just (0, [])
size_up_scrut other = size_up other
+ is_elem :: Id -> [Id] -> Bool
is_elem = isIn "size_up_scrut"
------------
sizeZero = Just (0, [])
sizeOne = Just (1, [])
sizeN n = Just (n, [])
- sizeVar v = Just (0, [v])
addSizeN Nothing _ = Nothing
addSizeN (Just (n, xs)) m
| tot < bOMB_OUT_SIZE = Just (tot, xs)
- | otherwise = -- pprTrace "bomb1:" (ppCat [ppInt tot, ppInt bOMB_OUT_SIZE, ppr PprDebug expr])
- Nothing
+ | otherwise = Nothing
where
tot = n+m
addSize _ Nothing = Nothing
addSize (Just (n, xs)) (Just (m, ys))
| tot < bOMB_OUT_SIZE = Just (tot, xys)
- | otherwise = -- pprTrace "bomb2:" (ppCat [ppInt tot, ppInt bOMB_OUT_SIZE, ppr PprDebug expr])
- Nothing
+ | otherwise = Nothing
where
tot = n+m
xys = xs ++ ys
%************************************************************************
%* *
+\subsection[considerUnfolding]{Given all the info, do (not) do the unfolding}
+%* *
+%************************************************************************
+
+We have very limited information about an unfolding expression: (1)~so
+many type arguments and so many value arguments expected---for our
+purposes here, we assume we've got those. (2)~A ``size'' or ``cost,''
+a single integer. (3)~An ``argument info'' vector. For this, what we
+have at the moment is a Boolean per argument position that says, ``I
+will look with great favour on an explicit constructor in this
+position.''
+
+Assuming we have enough type- and value arguments (if not, we give up
+immediately), then we see if the ``discounted size'' is below some
+(semi-arbitrary) threshold. It works like this: for every argument
+position where we're looking for a constructor AND WE HAVE ONE in our
+hands, we get a (again, semi-arbitrary) discount [proportion to the
+number of constructors in the type being scrutinized].
+
+\begin{code}
+smallEnoughToInline :: Int -> Int -- Constructor discount and size threshold
+ -> [Bool] -- Evaluated-ness of value arguments
+ -> UnfoldingGuidance
+ -> Bool -- True => unfold it
+
+smallEnoughToInline con_discount size_threshold _ UnfoldAlways = True
+smallEnoughToInline con_discount size_threshold _ UnfoldNever = False
+smallEnoughToInline con_discount size_threshold arg_is_evald_s
+ (UnfoldIfGoodArgs m_tys_wanted n_vals_wanted discount_vec size)
+ = n_vals_wanted <= length arg_is_evald_s &&
+ discounted_size <= size_threshold
+
+ where
+ discounted_size = size - sum (zipWith arg_discount discount_vec arg_is_evald_s)
+
+ arg_discount no_of_constrs is_evald
+ | is_evald = 1 + no_of_constrs * con_discount
+ | otherwise = 1
+\end{code}
+
+We use this one to avoid exporting inlinings that we ``couldn't possibly
+use'' on the other side. Can be overridden w/ flaggery.
+Just the same as smallEnoughToInline, except that it has no actual arguments.
+
+\begin{code}
+couldBeSmallEnoughToInline :: Int -> Int -- Constructor discount and size threshold
+ -> UnfoldingGuidance
+ -> Bool -- True => unfold it
+
+couldBeSmallEnoughToInline con_discount size_threshold guidance
+ = smallEnoughToInline con_discount size_threshold (repeat True) guidance
+\end{code}
+
+%************************************************************************
+%* *
\subsection[unfoldings-for-ifaces]{Processing unfoldings for interfaces}
%* *
%************************************************************************
add_some :: IdSet -> [Id] -> IdSet
no_in_scopes = emptyUniqSet
-in_scopes `add1` x = in_scopes `unionUniqSets` singletonUniqSet x
+in_scopes `add1` x = addOneToUniqSet in_scopes x
in_scopes `add_some` xs = in_scopes `unionUniqSets` mkUniqSet xs
\end{code}
%************************************************************************
\begin{code}
+{-
mentionedInUnfolding
:: (bndr -> Id) -- so we can get Ids out of binders
- -> CoreExpr bndr Id -- input expression
- -> ([Id], [TyCon], [Class],
+ -> GenCoreExpr bndr Id -- input expression
+ -> (Bag Id, Bag TyCon, Bag Class,
-- what we found mentioned in the expr
Bool -- True <=> mentions a ``litlit''-ish thing
-- (the guy on the other side of an interface
-- may not be able to handle it)
)
+-}
mentionedInUnfolding get_id expr
= case (ment_expr expr no_in_scopes get_id (emptyBag, emptyBag, emptyBag, False)) of
(_, (ids_bag, tcs_bag, clss_bag, has_litlit)) ->
- (bagToList ids_bag, bagToList tcs_bag, bagToList clss_bag, has_litlit)
+ (ids_bag, tcs_bag, clss_bag, has_litlit)
\end{code}
\begin{code}
-ment_expr :: CoreExpr bndr Id -> UnfoldM bndr ()
+--ment_expr :: GenCoreExpr bndr Id -> UnfoldM bndr ()
-ment_expr (CoVar v) = consider_Id v
-ment_expr (CoLit l) = consider_lit l
+ment_expr (Var v) = consider_Id v
+ment_expr (Lit l) = consider_lit l
-ment_expr (CoLam bs body)
- = extractIdsUf bs `thenUf` \ bs_ids ->
+ment_expr expr@(Lam _ _)
+ = let
+ (uvars, tyvars, args, body) = collectBinders expr
+ in
+ extractIdsUf args `thenUf` \ bs_ids ->
addInScopesUf bs_ids (
-- this considering is just to extract any mentioned types/classes
mapUf consider_Id bs_ids `thenUf_`
ment_expr body
)
-ment_expr (CoTyLam _ body) = ment_expr body
-
-ment_expr (CoApp fun arg)
+ment_expr (App fun arg)
= ment_expr fun `thenUf_`
- ment_atom arg
-
-ment_expr (CoTyApp expr ty)
- = ment_ty ty `thenUf_`
- ment_expr expr
+ ment_arg arg
-ment_expr (CoCon c ts as)
+ment_expr (Con c as)
= consider_Id c `thenUf_`
- mapUf ment_ty ts `thenUf_`
- mapUf ment_atom as `thenUf_`
+ mapUf ment_arg as `thenUf_`
returnUf ()
-ment_expr (CoPrim op ts as)
+ment_expr (Prim op as)
= ment_op op `thenUf_`
- mapUf ment_ty ts `thenUf_`
- mapUf ment_atom as `thenUf_`
+ mapUf ment_arg as `thenUf_`
returnUf ()
where
ment_op (CCallOp str is_asm may_gc arg_tys res_ty)
ment_ty res_ty
ment_op other_op = returnUf ()
-ment_expr (CoCase scrutinee alts)
+ment_expr (Case scrutinee alts)
= ment_expr scrutinee `thenUf_`
ment_alts alts
-ment_expr (CoLet (CoNonRec bind rhs) body)
+ment_expr (Let (NonRec bind rhs) body)
= ment_expr rhs `thenUf_`
extractIdsUf [bind] `thenUf` \ bi@[bind_id] ->
addInScopesUf bi (
ment_expr body `thenUf_`
consider_Id bind_id )
-ment_expr (CoLet (CoRec pairs) body)
+ment_expr (Let (Rec pairs) body)
= let
binders = map fst pairs
rhss = map snd pairs
in
extractIdsUf binders `thenUf` \ binder_ids ->
addInScopesUf binder_ids (
- mapUf ment_expr rhss `thenUf_`
+ mapUf ment_expr rhss `thenUf_`
mapUf consider_Id binder_ids `thenUf_`
- ment_expr body )
+ ment_expr body )
-ment_expr (CoSCC cc expr)
+ment_expr (SCC cc expr)
= (case (ccMentionsId cc) of
Just id -> consider_Id id
Nothing -> returnUf ()
)
`thenUf_` ment_expr expr
+ment_expr (Coerce _ _ _) = panic "ment_expr:Coerce"
+
-------------
ment_ty ty
= let
- (tycons, clss) = getMentionedTyConsAndClassesFromUniType ty
+ (tycons, clss) = getMentionedTyConsAndClassesFromType ty
in
addToMentionedTyConsUf tycons `thenUf_`
addToMentionedClassesUf clss
-------------
-ment_alts alg_alts@(CoAlgAlts alts deflt)
+ment_alts alg_alts@(AlgAlts alts deflt)
= mapUf ment_alt alts `thenUf_`
ment_deflt deflt
where
mapUf consider_Id param_ids `thenUf_`
ment_expr rhs )
-ment_alts (CoPrimAlts alts deflt)
+ment_alts (PrimAlts alts deflt)
= mapUf ment_alt alts `thenUf_`
ment_deflt deflt
where
ment_alt alt@(lit, rhs) = ment_expr rhs
----------------
-ment_deflt CoNoDefault
+ment_deflt NoDefault
= returnUf ()
-ment_deflt d@(CoBindDefault b rhs)
+ment_deflt d@(BindDefault b rhs)
= extractIdsUf [b] `thenUf` \ bi@[b_id] ->
addInScopesUf bi (
consider_Id b_id `thenUf_`
ment_expr rhs )
-----------
-ment_atom (CoVarAtom v) = consider_Id v
-ment_atom (CoLitAtom l) = consider_lit l
+ment_arg (VarArg v) = consider_Id v
+ment_arg (LitArg l) = consider_lit l
+ment_arg (TyArg ty) = ment_ty ty
+ment_arg (UsageArg _) = returnUf ()
-----------
consider_lit lit
Printing Core-expression unfoldings is sufficiently delicate that we
give it its own function.
\begin{code}
+{- OLD:
pprCoreUnfolding
- :: PlainCoreExpr
+ :: CoreExpr
-> Pretty
pprCoreUnfolding expr
\end{code}
\begin{code}
-ppr_uf_Expr in_scopes (CoVar v) = pprIdInUnfolding in_scopes v
-ppr_uf_Expr in_scopes (CoLit l) = ppr ppr_Unfolding l
+ppr_uf_Expr in_scopes (Var v) = pprIdInUnfolding in_scopes v
+ppr_uf_Expr in_scopes (Lit l) = ppr ppr_Unfolding l
-ppr_uf_Expr in_scopes (CoCon c ts as)
+ppr_uf_Expr in_scopes (Con c as)
= ppBesides [ppPStr SLIT("_!_ "), pprIdInUnfolding no_in_scopes c, ppSP,
ppLbrack, ppIntersperse pp'SP{-'-} (map (pprParendUniType ppr_Unfolding) ts), ppRbrack,
ppSP, ppLbrack, ppIntersperse pp'SP{-'-} (map (ppr_uf_Atom in_scopes) as), ppRbrack]
-ppr_uf_Expr in_scopes (CoPrim op ts as)
+ppr_uf_Expr in_scopes (Prim op as)
= ppBesides [ppPStr SLIT("_#_ "), ppr ppr_Unfolding op, ppSP,
ppLbrack, ppIntersperse pp'SP{-'-} (map (pprParendUniType ppr_Unfolding) ts), ppRbrack,
ppSP, ppLbrack, ppIntersperse pp'SP{-'-} (map (ppr_uf_Atom in_scopes) as), ppRbrack]
-ppr_uf_Expr in_scopes (CoLam binders body)
- = ppCat [ppChar '\\', ppIntersperse ppSP (map ppr_uf_Binder binders),
- ppPStr SLIT("->"), ppr_uf_Expr (in_scopes `add_some` binders) body]
+ppr_uf_Expr in_scopes (Lam binder body)
+ = ppCat [ppChar '\\', ppr_uf_Binder binder,
+ ppPStr SLIT("->"), ppr_uf_Expr (in_scopes `add1` binder) body]
ppr_uf_Expr in_scopes (CoTyLam tyvar expr)
= ppCat [ppPStr SLIT("_/\\_"), interppSP ppr_Unfolding (tyvar:tyvars), ppStr "->",
where (tyvs, e_after) = collect_tyvars e
collect_tyvars other_e = ( [], other_e )
-ppr_uf_Expr in_scopes expr@(CoApp fun_expr atom)
+ppr_uf_Expr in_scopes expr@(App fun_expr atom)
= let
(fun, args) = collect_args expr []
in
ppCat [ppPStr SLIT("_APP_ "), ppr_uf_Expr in_scopes fun, ppLbrack,
ppIntersperse pp'SP{-'-} (map (ppr_uf_Atom in_scopes) args), ppRbrack]
where
- collect_args (CoApp fun arg) args = collect_args fun (arg:args)
+ collect_args (App fun arg) args = collect_args fun (arg:args)
collect_args fun args = (fun, args)
ppr_uf_Expr in_scopes (CoTyApp expr ty)
= ppCat [ppPStr SLIT("_TYAPP_ "), ppr_uf_Expr in_scopes expr,
ppChar '{', pprParendUniType ppr_Unfolding ty, ppChar '}']
-ppr_uf_Expr in_scopes (CoCase scrutinee alts)
+ppr_uf_Expr in_scopes (Case scrutinee alts)
= ppCat [ppPStr SLIT("case"), ppr_uf_Expr in_scopes scrutinee, ppStr "of {",
pp_alts alts, ppChar '}']
where
- pp_alts (CoAlgAlts alts deflt)
+ pp_alts (AlgAlts alts deflt)
= ppCat [ppPStr SLIT("_ALG_"), ppCat (map pp_alg alts), pp_deflt deflt]
- pp_alts (CoPrimAlts alts deflt)
+ pp_alts (PrimAlts alts deflt)
= ppCat [ppPStr SLIT("_PRIM_"), ppCat (map pp_prim alts), pp_deflt deflt]
pp_alg (con, params, rhs)
= ppBesides [ppr ppr_Unfolding lit,
ppPStr SLIT(" -> "), ppr_uf_Expr in_scopes rhs, ppSemi]
- pp_deflt CoNoDefault = ppPStr SLIT("_NO_DEFLT_")
- pp_deflt (CoBindDefault binder rhs)
+ pp_deflt NoDefault = ppPStr SLIT("_NO_DEFLT_")
+ pp_deflt (BindDefault binder rhs)
= ppBesides [ppr_uf_Binder binder, ppPStr SLIT(" -> "),
ppr_uf_Expr (in_scopes `add1` binder) rhs]
-ppr_uf_Expr in_scopes (CoLet (CoNonRec binder rhs) body)
+ppr_uf_Expr in_scopes (Let (NonRec binder rhs) body)
= ppBesides [ppStr "let {", ppr_uf_Binder binder, ppPStr SLIT(" = "), ppr_uf_Expr in_scopes rhs,
ppStr "} in ", ppr_uf_Expr (in_scopes `add1` binder) body]
-ppr_uf_Expr in_scopes (CoLet (CoRec pairs) body)
+ppr_uf_Expr in_scopes (Let (Rec pairs) body)
= ppBesides [ppStr "_LETREC_ {", ppIntersperse sep (map pp_pair pairs),
ppStr "} in ", ppr_uf_Expr new_in_scopes body]
where
pp_pair (b, rhs) = ppCat [ppr_uf_Binder b, ppEquals, ppr_uf_Expr new_in_scopes rhs]
-ppr_uf_Expr in_scopes (CoSCC cc body)
+ppr_uf_Expr in_scopes (SCC cc body)
= ASSERT(not (noCostCentreAttached cc))
ASSERT(not (currentOrSubsumedCosts cc))
ppBesides [ppStr "_scc_ { ", ppStr (showCostCentre ppr_Unfolding False{-not as string-} cc), ppStr " } ", ppr_uf_Expr in_scopes body]
+
+ppr_uf_Expr in_scopes (Coerce _ _ _) = panic "ppr_uf_Expr:Coerce"
\end{code}
\begin{code}
ppr_uf_Binder :: Id -> Pretty
ppr_uf_Binder v
- = ppBesides [ppLparen, pprIdInUnfolding (singletonUniqSet v) v, ppPStr SLIT(" :: "),
- ppr ppr_Unfolding (getIdUniType v), ppRparen]
+ = ppBesides [ppLparen, pprIdInUnfolding (unitUniqSet v) v, ppPStr SLIT(" :: "),
+ ppr ppr_Unfolding (idType v), ppRparen]
-ppr_uf_Atom in_scopes (CoLitAtom l) = ppr ppr_Unfolding l
-ppr_uf_Atom in_scopes (CoVarAtom v) = pprIdInUnfolding in_scopes v
+ppr_uf_Atom in_scopes (LitArg l) = ppr ppr_Unfolding l
+ppr_uf_Atom in_scopes (VarArg v) = pprIdInUnfolding in_scopes v
+END OLD -}
\end{code}
projects / ghc-hetmet.git / blobdiff