import TysPrim ( realWorldStatePrimTy )
import UniqFM ( plusUFM_C, addToUFM_Directly, lookupUFM_Directly,
keysUFM, minusUFM, ufmToList, filterUFM )
-import Type ( isUnLiftedType, coreEqType )
+import Type ( isUnLiftedType, coreEqType, splitTyConApp_maybe )
+import Coercion ( coercionKind )
import CoreLint ( showPass, endPass )
import Util ( mapAndUnzip, mapAccumL, mapAccumR, lengthIs )
import BasicTypes ( Arity, TopLevelFlag(..), isTopLevel, isNeverActive,
dmdAnal sigs dmd (Var var)
= (dmdTransform sigs var dmd, Var var)
+dmdAnal sigs dmd (Cast e co)
+ = (dmd_ty, Cast e' co)
+ where
+ (dmd_ty, e') = dmdAnal sigs dmd' e
+ to_co = snd (coercionKind co)
+ dmd'
+ | Just (tc, args) <- splitTyConApp_maybe to_co
+ , isRecursiveTyCon tc = evalDmd
+ | otherwise = dmd
+ -- This coerce usually arises from a recursive
+ -- newtype, and we don't want to look inside them
+ -- for exactly the same reason that we don't look
+ -- inside recursive products -- we might not reach
+ -- a fixpoint. So revert to a vanilla Eval demand
+
dmdAnal sigs dmd (Note n e)
= (dmd_ty, Note n e')
where
- (dmd_ty, e') = dmdAnal sigs dmd' e
- dmd' = case n of
- Coerce _ _ -> evalDmd -- This coerce usually arises from a recursive
- other -> dmd -- newtype, and we don't want to look inside them
- -- for exactly the same reason that we don't look
- -- inside recursive products -- we might not reach
- -- a fixpoint. So revert to a vanilla Eval demand
+ (dmd_ty, e') = dmdAnal sigs dmd e
dmdAnal sigs dmd (App fun (Type ty))
= (fun_ty, App fun' (Type ty))
import Type ( Type, isUnLiftedType, mkFunTys,
splitForAllTys, splitFunTys, splitRecNewType_maybe, isAlgType
)
+import Coercion ( Coercion, mkSymCoercion, splitRecNewTypeCo_maybe )
import BasicTypes ( Boxity(..) )
import Var ( Var, isId )
import UniqSupply ( returnUs, thenUs, getUniquesUs, UniqSM )
Type) -- Type of wrapper body
mkWWargs fun_ty demands one_shots
- | Just rep_ty <- splitRecNewType_maybe fun_ty
+ | Just (rep_ty, co) <- splitRecNewTypeCo_maybe fun_ty
-- The newtype case is for when the function has
-- a recursive newtype after the arrow (rare)
-- We check for arity >= 0 to avoid looping in the case
-- simply coerces.
= mkWWargs rep_ty demands one_shots `thenUs` \ (wrap_args, wrap_fn_args, work_fn_args, res_ty) ->
returnUs (wrap_args,
- Note (Coerce fun_ty rep_ty) . wrap_fn_args,
- work_fn_args . Note (Coerce rep_ty fun_ty),
+ \ e -> Cast (wrap_fn_args e) co,
+ \ e -> work_fn_args (Cast e (mkSymCoercion co)),
res_ty)
| notNull demands