2 % (c) The GRASP/AQUA Project, Glasgow University, 1998
4 \section[UsageSPUtils]{UsageSP Utilities}
6 This code is (based on) PhD work of Keith Wansbrough <kw217@cl.cam.ac.uk>,
7 September 1998 .. May 1999.
9 Keith Wansbrough 1998-09-04..1999-07-07
12 module UsageSPUtils ( AnnotM(AnnotM), initAnnotM,
14 MungeFlags(isSigma,isLocal,isExp,hasUsg,mfLoc),
16 doAnnotBinds, doUnAnnotBinds,
17 annotTy, annotTyN, annotMany, annotManyN, unannotTy, freshannotTy,
20 UniqSMM, usToUniqSMM, uniqSMMToUs,
25 #include "HsVersions.h"
28 import CoreFVs ( mustHaveLocalBinding )
29 import Var ( Var, varName, varType, setVarType, mkUVar )
30 import Id ( isExportedId )
31 import Name ( isLocallyDefined )
32 import TypeRep ( Type(..), TyNote(..) ) -- friend
33 import Type ( UsageAnn(..), isUsgTy, splitFunTys )
34 import Subst ( substTy, mkTyVarSubst )
35 import TyCon ( isAlgTyCon, isPrimTyCon, isSynTyCon, isFunTyCon )
37 import PrimOp ( PrimOp, primOpUsg )
38 import UniqSupply ( UniqSupply, UniqSM, initUs, getUniqueUs, thenUs, returnUs )
42 ======================================================================
44 Walking over (and altering) types
45 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
47 We often need to fiddle with (i.e., add or remove) usage annotations
48 on a type. We define here a general framework to do this. Usage
49 annotations come from any monad with a function @getAnnM@ which yields
50 a new annotation. We use two mutually recursive functions, one for
51 sigma types and one for tau types.
54 genAnnotTy :: Monad m =>
55 (m UsageAnn) -- get new annotation
59 genAnnotTy getAnnM ty = do { u <- getAnnM
60 ; ty' <- genAnnotTyN getAnnM ty
61 ; return (NoteTy (UsgNote u) ty')
64 genAnnotTyN :: Monad m =>
70 (NoteTy (UsgNote _) ty) = panic "genAnnotTyN: unexpected UsgNote"
72 (NoteTy (SynNote sty) ty) = do { sty' <- genAnnotTyN getAnnM sty
73 -- is this right? shouldn't there be some
74 -- correlation between sty' and ty'?
75 -- But sty is a TyConApp; does this make it safer?
76 ; ty' <- genAnnotTyN getAnnM ty
77 ; return (NoteTy (SynNote sty') ty')
80 (NoteTy fvn@(FTVNote _) ty) = do { ty' <- genAnnotTyN getAnnM ty
81 ; return (NoteTy fvn ty')
85 ty0@(TyVarTy _) = do { return ty0 }
88 (AppTy ty1 ty2) = do { ty1' <- genAnnotTyN getAnnM ty1
89 ; ty2' <- genAnnotTyN getAnnM ty2
90 ; return (AppTy ty1' ty2')
94 (TyConApp tc tys) = ASSERT( isFunTyCon tc || isAlgTyCon tc || isPrimTyCon tc || isSynTyCon tc )
95 do { let gAT = if isFunTyCon tc
96 then genAnnotTy -- sigma for partial apps of (->)
97 else genAnnotTyN -- tau otherwise
98 ; tys' <- mapM (gAT getAnnM) tys
99 ; return (TyConApp tc tys')
103 (FunTy ty1 ty2) = do { ty1' <- genAnnotTy getAnnM ty1
104 ; ty2' <- genAnnotTy getAnnM ty2
105 ; return (FunTy ty1' ty2')
109 (ForAllTy v ty) = do { ty' <- genAnnotTyN getAnnM ty
110 ; return (ForAllTy v ty')
116 Walking over (and retyping) terms
117 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
119 We also often need to play with the types in a term. This is slightly
120 tricky because of redundancy: we want to change binder types, and keep
121 the bound types matching these; then there's a special case also with
122 non-locally-defined bound variables. We generalise over all this
125 The name `annot' is a bit of a misnomer, as the code is parameterised
126 over exactly what it does to the types (and certain terms). Notice
127 also that it is possible for this parameter to use
128 monadically-threaded state: here called `flexi'. For genuine
129 annotation, this state will be a UniqSupply.
131 We may add annotations to the outside of a (term, not type) lambda; a
132 function passed to @genAnnotBinds@ does this, taking the lambda and
133 returning the annotated lambda. It is inside the @AnnotM@ monad.
134 This term-munging function is applied when we see either a term lambda
135 or a usage annotation; *IMPORTANT:* it is applied *before* we recurse
136 down into the term, and it is expected to work only at the top level.
137 Recursion will subsequently be done by genAnnotBinds. It may
138 optionally remove a Note TermUsg, or optionally add one if it is not
139 already present, but it may perform NO OTHER MODIFICATIONS to the
140 structure of the term.
142 We do different things to types of variables bound locally and of
143 variables bound in other modules, in certain cases: the former get
144 uvars and the latter keep their existing annotations when we annotate,
145 for example. To control this, @MungeFlags@ describes what kind of a
146 type this is that we're about to munge.
149 data MungeFlags = MungeFlags { isSigma :: Bool, -- want annotated on top (sigma type)
150 isLocal :: Bool, -- is locally-defined type
151 hasUsg :: Bool, -- has fixed usage info, don't touch
152 isExp :: Bool, -- is exported (and must be pessimised)
153 mfLoc :: SDoc -- location info
156 tauTyMF loc = MungeFlags { isSigma = False, isLocal = True,
157 hasUsg = False, isExp = False, mfLoc = loc }
158 sigVarTyMF v = MungeFlags { isSigma = True, isLocal = hasLocalDef v,
159 hasUsg = hasUsgInfo v, isExp = isExportedId v,
160 mfLoc = ptext SLIT("type of binder") <+> ppr v }
163 The helper functions @tauTyMF@ and @sigVarTyMF@ create @MungeFlags@
164 for us. @sigVarTyMF@ checks the variable to see how to set the flags.
166 @hasLocalDef@ tells us if the given variable has an actual local
167 definition that we can play with. This is not quite the same as
168 @isLocallyDefined@, since @mayHaveNoBindingId@ things (usually) don't have
169 a local definition - the simplifier will inline whatever their
170 unfolding is anyway. We treat these as if they were externally
171 defined, since we don't have access to their definition (at least not
172 easily). This doesn't hurt much, since after the simplifier has run
173 the unfolding will have been inlined and we can access the unfolding
176 @hasUsgInfo@, on the other hand, says if the variable already has
177 usage info in its type that must at all costs be preserved. This is
178 assumed true (exactly) of all imported ids.
181 hasLocalDef :: Var -> Bool
182 hasLocalDef var = mustHaveLocalBinding var
184 hasUsgInfo :: Var -> Bool
185 hasUsgInfo var = (not . isLocallyDefined) var
188 Here's the walk itself.
191 genAnnotBinds :: (MungeFlags -> Type -> AnnotM flexi Type)
192 -> (CoreExpr -> AnnotM flexi CoreExpr) -- see caveats above
194 -> AnnotM flexi [CoreBind]
196 genAnnotBinds _ _ [] = return []
198 genAnnotBinds f g (b:bs) = do { (b',vs,vs') <- genAnnotBind f g b
199 ; bs' <- withAnnVars vs vs' $
204 genAnnotBind :: (MungeFlags -> Type -> AnnotM flexi Type) -- type-altering function
205 -> (CoreExpr -> AnnotM flexi CoreExpr) -- term-altering function
206 -> CoreBind -- original CoreBind
208 (CoreBind, -- annotated CoreBind
209 [Var], -- old variables, to be mapped to...
210 [Var]) -- ... new variables
212 genAnnotBind f g (NonRec v1 e1) = do { v1' <- genAnnotVar f v1
213 ; e1' <- genAnnotCE f g e1
214 ; return (NonRec v1' e1', [v1], [v1'])
217 genAnnotBind f g (Rec ves) = do { let (vs,es) = unzip ves
218 ; vs' <- mapM (genAnnotVar f) vs
219 ; es' <- withAnnVars vs vs' $
220 mapM (genAnnotCE f g) es
221 ; return (Rec (zip vs' es'), vs, vs')
224 genAnnotCE :: (MungeFlags -> Type -> AnnotM flexi Type) -- type-altering function
225 -> (CoreExpr -> AnnotM flexi CoreExpr) -- term-altering function
226 -> CoreExpr -- original expression
227 -> AnnotM flexi CoreExpr -- yields new expression
229 genAnnotCE mungeType mungeTerm = go
230 where go e0@(Var v) | isTyVar v = return e0 -- arises, e.g., as tyargs of constructor
231 -- (no it doesn't: (Type (TyVar tyvar))
232 | otherwise = do { mv' <- lookupAnnVar v
234 Just var -> return var
235 Nothing -> fixedVar v
239 go (Lit l) = -- we know it's saturated
242 go (App e arg) = do { e' <- go e
244 ; return (App e' arg')
247 go e0@(Lam v0 _) = do { e1 <- (if isTyVar v0 then return else mungeTerm) e0
249 = case e1 of -- munge may have added note
250 Note tu@(TermUsg _) (Lam v e2)
252 Lam v e2 -> (v,e2,id)
253 ; v' <- genAnnotVar mungeType v
254 ; e' <- withAnnVar v v' $ go e2
255 ; return (wrap (Lam v' e'))
258 go (Let bind e) = do { (bind',vs,vs') <- genAnnotBind mungeType mungeTerm bind
259 ; e' <- withAnnVars vs vs' $ go e
260 ; return (Let bind' e')
263 go (Case e v alts) = do { e' <- go e
264 ; v' <- genAnnotVar mungeType v
265 ; alts' <- withAnnVar v v' $ mapM genAnnotAlt alts
266 ; return (Case e' v' alts')
269 go (Note scc@(SCC _) e) = do { e' <- go e
270 ; return (Note scc e')
272 go e0@(Note (Coerce ty1 ty0)
273 e) = do { ty1' <- mungeType
274 (tauTyMF (ptext SLIT("coercer of")
277 (tauTyMF (ptext SLIT("coercee of")
279 -- (Better to specify ty0'
280 -- identical to the type of e, including
281 -- annotations, right at the beginning, but
282 -- not possible at this point.)
284 ; return (Note (Coerce ty1' ty0') e')
286 go (Note InlineCall e) = do { e' <- go e
287 ; return (Note InlineCall e')
289 go (Note InlineMe e) = do { e' <- go e
290 ; return (Note InlineMe e')
292 go e0@(Note (TermUsg _) _) = do { e1 <- mungeTerm e0
293 ; case e1 of -- munge may have removed note
294 Note tu@(TermUsg _) e2 -> do { e3 <- go e2
295 ; return (Note tu e3)
300 go e0@(Type ty) = -- should only occur at toplevel of Arg,
302 do { ty' <- mungeType
303 (tauTyMF (ptext SLIT("tyarg")
308 fixedVar v = ASSERT2( not (hasLocalDef v), text "genAnnotCE: locally defined var" <+> ppr v <+> text "not in varenv" )
309 genAnnotVar mungeType v
311 genAnnotAlt (c,vs,e) = do { vs' <- mapM (genAnnotVar mungeType) vs
312 ; e' <- withAnnVars vs vs' $ go e
313 ; return (c, vs', e')
317 genAnnotVar :: (MungeFlags -> Type -> AnnotM flexi Type)
321 genAnnotVar mungeType v | isTyVar v = return v
322 | otherwise = do { vty' <- mungeType (sigVarTyMF v) (varType v)
323 ; return (setVarType v vty')
327 pprTrace "genAnnotVar" (ppr (tyUsg vty') <+> ppr v) $
333 ======================================================================
335 Some specific things to do to types inside terms
336 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
338 @annotTyM@ annotates a type with fresh uvars everywhere the inference
339 is allowed to go, and leaves alone annotations where it may not go.
341 We assume there are no annotations already.
344 annotTyM :: MungeFlags -> Type -> AnnotM UniqSupply Type
346 annotTyM mf ty = uniqSMtoAnnotM . uniqSMMToUs $
347 case (hasUsg mf, isLocal mf, isSigma mf) of
348 (True ,_ ,_ ) -> ASSERT( isUsgTy ty )
350 (False,True ,True ) -> if isExp mf then
351 annotTyP (tag 'p') ty
354 (False,True ,False) -> annotTyN (tag 't') ty
355 (False,False,True ) -> return $ annotMany ty -- assume worst
356 (False,False,False) -> return $ annotManyN ty
357 where tag c = Right $ "annotTyM:" ++ [c] ++ ": " ++ showSDoc (ppr ty)
359 -- specific functions for annotating tau and sigma types
362 annotTy tag = genAnnotTy (newVarUSMM tag)
363 annotTyN tag = genAnnotTyN (newVarUSMM tag)
365 -- ...with uvars and pessimal Manys (for exported ids)
366 annotTyP tag ty = do { ty' <- annotTy tag ty ; return (pessimise True ty') }
369 annotMany, annotManyN :: Type -> Type
374 annotMany ty = unId (genAnnotTy (return UsMany) ty)
375 annotManyN ty = unId (genAnnotTyN (return UsMany) ty)
378 -- monad required for the above
379 newtype Id a = Id a ; unId (Id a) = a
380 instance Monad Id where { a >>= f = f (unId a) ; return a = Id a }
382 -- lambda-annotating function for use along with the above
383 annotLam e0@(Lam v e) = do { uv <- uniqSMtoAnnotM $ newVarUs (Left e0)
384 ; return (Note (TermUsg uv) (Lam v e))
386 annotLam (Note (TermUsg _) _) = panic "annotLam: unexpected term usage annot"
389 The above requires a `pessimising' translation. This is applied to
390 types of exported ids, and ensures that they have a fully general
391 type (since we don't know how they will be used in other modules).
394 pessimise :: Bool -> Type -> Type
397 pessimise co ty0@(NoteTy usg@(UsgNote u ) ty)
399 then case u of UsMany -> pty
400 UsVar _ -> pty -- force to UsMany
401 UsOnce -> pprPanic "pessimise:" (ppr ty0)
403 where pty = pessimiseN co ty
405 pessimise co ty0 = pessimiseN co ty0 -- assume UsMany
407 pessimise co ty0@(NoteTy usg@(UsgNote u ) ty)
409 then case u of UsMany -> NoteTy usg pty
410 UsVar _ -> NoteTy (UsgNote UsMany) pty
411 UsOnce -> pprPanic "pessimise:" (ppr ty0)
413 where pty = pessimiseN co ty
415 pessimise co ty0 = pprPanic "pessimise: missing usage note:" $
419 pessimiseN co ty0@(NoteTy usg@(UsgNote _ ) ty) = pprPanic "pessimiseN: unexpected usage note:" $
421 pessimiseN co (NoteTy (SynNote sty) ty) = NoteTy (SynNote (pessimiseN co sty))
423 pessimiseN co (NoteTy note@(FTVNote _ ) ty) = NoteTy note (pessimiseN co ty)
424 pessimiseN co ty0@(TyVarTy _) = ty0
425 pessimiseN co ty0@(AppTy _ _) = ty0
426 pessimiseN co ty0@(TyConApp tc tys) = ASSERT( not ((isFunTyCon tc) && (length tys > 1)) )
428 pessimiseN co (FunTy ty1 ty2) = FunTy (pessimise (not co) ty1)
430 pessimiseN co (ForAllTy tyv ty) = ForAllTy tyv (pessimiseN co ty)
434 @unAnnotTyM@ strips annotations (that the inference is allowed to
435 touch) from a term, and `fixes' those it isn't permitted to touch (by
436 putting @Many@ annotations where they are missing, but leaving
437 existing annotations in the type).
439 @unTermUsg@ removes from a term any term usage annotations it finds.
442 unAnnotTyM :: MungeFlags -> Type -> AnnotM a Type
444 unAnnotTyM mf ty = if hasUsg mf then
446 return (fixAnnotTy ty)
447 else return (unannotTy ty)
450 unTermUsg :: CoreExpr -> AnnotM a CoreExpr
451 -- strip all term annotations
452 unTermUsg e@(Lam _ _) = return e
453 unTermUsg (Note (TermUsg _) e) = return e
454 unTermUsg _ = panic "unTermUsg"
456 unannotTy :: Type -> Type
457 -- strip all annotations
458 unannotTy (NoteTy (UsgForAll uv) ty) = unannotTy ty
459 unannotTy (NoteTy (UsgNote _ ) ty) = unannotTy ty
460 unannotTy (NoteTy (SynNote sty) ty) = NoteTy (SynNote (unannotTy sty)) (unannotTy ty)
461 unannotTy (NoteTy note@(FTVNote _ ) ty) = NoteTy note (unannotTy ty)
462 -- IP notes need to be preserved
463 unannotTy ty@(NoteTy (IPNote _) _) = ty
464 unannotTy ty@(TyVarTy _) = ty
465 unannotTy (AppTy ty1 ty2) = AppTy (unannotTy ty1) (unannotTy ty2)
466 unannotTy (TyConApp tc tys) = TyConApp tc (map unannotTy tys)
467 unannotTy (FunTy ty1 ty2) = FunTy (unannotTy ty1) (unannotTy ty2)
468 unannotTy (ForAllTy tyv ty) = ForAllTy tyv (unannotTy ty)
471 fixAnnotTy :: Type -> Type
472 -- put Manys where they are missing
476 fixAnnotTy (NoteTy note@(UsgForAll uv) ty) = NoteTy note (fixAnnotTy ty)
477 fixAnnotTy (NoteTy note@(UsgNote _ ) ty) = NoteTy note (fixAnnotTyN ty)
478 fixAnnotTy ty0 = NoteTy (UsgNote UsMany) (fixAnnotTyN ty0)
480 fixAnnotTyN ty0@(NoteTy note@(UsgNote _ ) ty) = pprPanic "fixAnnotTyN: unexpected usage note:" $
482 fixAnnotTyN (NoteTy (SynNote sty) ty) = NoteTy (SynNote (fixAnnotTyN sty))
484 fixAnnotTyN (NoteTy note@(FTVNote _ ) ty) = NoteTy note (fixAnnotTyN ty)
485 fixAnnotTyN ty0@(TyVarTy _) = ty0
486 fixAnnotTyN (AppTy ty1 ty2) = AppTy (fixAnnotTyN ty1) (fixAnnotTyN ty2)
487 fixAnnotTyN (TyConApp tc tys) = ASSERT( isFunTyCon tc || isAlgTyCon tc || isPrimTyCon tc || isSynTyCon tc )
488 TyConApp tc (map (if isFunTyCon tc then
492 fixAnnotTyN (FunTy ty1 ty2) = FunTy (fixAnnotTy ty1) (fixAnnotTy ty2)
493 fixAnnotTyN (ForAllTy tyv ty) = ForAllTy tyv (fixAnnotTyN ty)
497 The composition (reannotating a type with fresh uvars but the same
498 structure) is useful elsewhere:
501 freshannotTy :: Type -> UniqSMM Type
502 freshannotTy = annotTy (Right "freshannotTy") . unannotTy
506 Wrappers apply these functions to sets of bindings.
509 doAnnotBinds :: UniqSupply
511 -> ([CoreBind],UniqSupply)
513 doAnnotBinds us binds = initAnnotM us (genAnnotBinds annotTyM annotLam binds)
516 doUnAnnotBinds :: [CoreBind]
519 doUnAnnotBinds binds = fst $ initAnnotM () $
520 genAnnotBinds unAnnotTyM unTermUsg binds
523 ======================================================================
528 The @UniqSM@ type is not an instance of @Monad@, and cannot be made so
529 since it is merely a synonym rather than a newtype. Here we define
530 @UniqSMM@, which *is* an instance of @Monad@.
533 newtype UniqSMM a = UsToUniqSMM (UniqSM a)
534 uniqSMMToUs (UsToUniqSMM us) = us
535 usToUniqSMM = UsToUniqSMM
537 instance Monad UniqSMM where
538 m >>= f = UsToUniqSMM $ uniqSMMToUs m `thenUs` \ a ->
540 return = UsToUniqSMM . returnUs
544 For annotation, the monad @AnnotM@, we need to carry around our
545 variable mapping, along with some general state.
548 newtype AnnotM flexi a = AnnotM ( flexi -- UniqSupply etc
549 -> VarEnv Var -- unannotated to annotated variables
550 -> (a,flexi,VarEnv Var))
551 unAnnotM (AnnotM f) = f
553 instance Monad (AnnotM flexi) where
554 a >>= f = AnnotM (\ us ve -> let (r,us',ve') = unAnnotM a us ve
555 in unAnnotM (f r) us' ve')
556 return a = AnnotM (\ us ve -> (a,us,ve))
558 initAnnotM :: fl -> AnnotM fl a -> (a,fl)
559 initAnnotM fl m = case (unAnnotM m) fl emptyVarEnv of { (r,fl',_) -> (r,fl') }
561 withAnnVar :: Var -> Var -> AnnotM fl a -> AnnotM fl a
562 withAnnVar v v' m = AnnotM (\ us ve -> let ve' = extendVarEnv ve v v'
563 (r,us',_) = (unAnnotM m) us ve'
566 withAnnVars :: [Var] -> [Var] -> AnnotM fl a -> AnnotM fl a
567 withAnnVars vs vs' m = AnnotM (\ us ve -> let ve' = plusVarEnv ve (zipVarEnv vs vs')
568 (r,us',_) = (unAnnotM m) us ve'
571 lookupAnnVar :: Var -> AnnotM fl (Maybe Var)
572 lookupAnnVar var = AnnotM (\ us ve -> (lookupVarEnv ve var,
577 A useful helper allows us to turn a computation in the unique supply
578 monad into one in the annotation monad parameterised by a unique
582 uniqSMtoAnnotM :: UniqSM a -> AnnotM UniqSupply a
584 uniqSMtoAnnotM m = AnnotM (\ us ve -> let (r,us') = initUs us m
588 @newVarUs@ and @newVarUSMM@ generate a new usage variable. They take
589 an argument which is used for debugging only, describing what the
590 variable is to annotate.
593 newVarUs :: (Either CoreExpr String) -> UniqSM UsageAnn
594 -- the first arg is for debugging use only
595 newVarUs e = getUniqueUs `thenUs` \ u ->
600 Left (Lit _) -> "literal"
601 Left (Lam v e) -> "lambda: " ++ showSDoc (ppr v)
604 in pprTrace "newVarUs:" (ppr uv <+> text src) $
608 newVarUSMM :: (Either CoreExpr String) -> UniqSMM UsageAnn
609 newVarUSMM = usToUniqSMM . newVarUs
612 ======================================================================
614 PrimOps and usage information.
616 Analagously to @DataCon.dataConArgTys@, we determine the argtys and
617 result ty of a primop, *after* substition (which may reveal more args,
618 notably for @CCall@s).
621 primOpUsgTys :: PrimOp -- this primop
622 -> [Type] -- instantiated at these (tau) types
623 -> ([Type],Type) -- requires args of these (sigma) types,
624 -- and returns this (sigma) type
626 primOpUsgTys p tys = let (tyvs,ty0us,rtyu) = primOpUsg p
627 s = mkTyVarSubst tyvs tys
628 (ty1us,rty1u) = splitFunTys (substTy s rtyu)
629 -- substitution may reveal more args
630 in ((map (substTy s) ty0us) ++ ty1us,
634 ======================================================================