import Module ( Module, mkModule )
import RdrHsSyn ( mkClassDecl, mkTyData )
import qualified OccName
-import SrcLoc ( unLoc, Located(..), SrcSpan )
+import SrcLoc ( Located(..), SrcSpan )
import Type ( Type )
import TysWiredIn ( unitTyCon, tupleTyCon, trueDataCon )
import BasicTypes( Boxity(..) )
import Char ( isAscii, isAlphaNum, isAlpha )
import List ( partition )
import Unique ( Unique, mkUniqueGrimily )
-import ErrUtils (Message)
+import ErrUtils ( Message )
import GLAEXTS ( Int(..), Int# )
import SrcLoc ( noSrcLoc )
-import Bag ( emptyBag, consBag )
+import Bag ( listToBag )
import FastString
import Outputable
+
+-------------------------------------------------------------------
+-- The external interface
+
+convertToHsDecls :: SrcSpan -> [TH.Dec] -> Either Message [LHsDecl RdrName]
+convertToHsDecls loc ds = initCvt loc (mapM cvtTop ds)
+
+convertToHsExpr :: SrcSpan -> TH.Exp -> Either Message (LHsExpr RdrName)
+convertToHsExpr loc e = initCvt loc (cvtl e)
+
+convertToHsType :: SrcSpan -> TH.Type -> Either Message (LHsType RdrName)
+convertToHsType loc t = initCvt loc (cvtType t)
+
+
-------------------------------------------------------------------
-convertToHsDecls :: SrcSpan -> [TH.Dec] -> [Either (LHsDecl RdrName) Message]
+newtype CvtM a = CvtM { unCvtM :: SrcSpan -> Either Message a }
+ -- Push down the source location;
+ -- Can fail, with a single error message
+
+-- NB: If the conversion succeeds with (Right x), there should
+-- be no exception values hiding in x
+-- Reason: so a (head []) in TH code doesn't subsequently
+-- make GHC crash when it tries to walk the generated tree
+
-- Use the loc everywhere, for lack of anything better
-- In particular, we want it on binding locations, so that variables bound in
-- the spliced-in declarations get a location that at least relates to the splice point
-convertToHsDecls loc ds = map (cvt_top loc) ds
-
-cvt_top :: SrcSpan -> TH.Dec -> Either (LHsDecl RdrName) Message
-cvt_top loc d@(TH.ValD _ _ _) = Left $ L loc $ Hs.ValD (unLoc (cvtd loc d))
-cvt_top loc d@(TH.FunD _ _) = Left $ L loc $ Hs.ValD (unLoc (cvtd loc d))
-cvt_top loc (TH.SigD nm typ) = Left $ L loc $ Hs.SigD (TypeSig (L loc (vName nm)) (cvtType loc typ))
-
-cvt_top loc (TySynD tc tvs rhs)
- = Left $ L loc $ TyClD (TySynonym (L loc (tconName tc)) (cvt_tvs loc tvs) (cvtType loc rhs))
-
-cvt_top loc (DataD ctxt tc tvs constrs derivs)
- = Left $ L loc $ TyClD (mkTyData DataType
- (L loc (cvt_context loc ctxt, L loc (tconName tc), cvt_tvs loc tvs))
- Nothing (map (mk_con loc) constrs)
- (mk_derivs loc derivs))
-
-cvt_top loc (NewtypeD ctxt tc tvs constr derivs)
- = Left $ L loc $ TyClD (mkTyData NewType
- (L loc (cvt_context loc ctxt, L loc (tconName tc), cvt_tvs loc tvs))
- Nothing [mk_con loc constr]
- (mk_derivs loc derivs))
-
-cvt_top loc (ClassD ctxt cl tvs fds decs)
- = Left $ L loc $ TyClD $ mkClassDecl (cvt_context loc ctxt,
- L loc (tconName cl),
- cvt_tvs loc tvs)
- (map (L loc . cvt_fundep) fds)
- sigs
- binds
- where
- (binds,sigs) = cvtBindsAndSigs loc decs
-cvt_top loc (InstanceD tys ty decs)
- = Left $ L loc $ InstD (InstDecl (L loc inst_ty) binds sigs)
- where
- (binds, sigs) = cvtBindsAndSigs loc decs
- inst_ty = mkImplicitHsForAllTy (cvt_context loc tys) (L loc (HsPredTy (cvt_pred loc ty)))
-
-cvt_top loc (ForeignD (ImportF callconv safety from nm typ))
- = case parsed of
- Just (c_header, cis) ->
- let i = CImport callconv' safety' c_header nilFS cis
- in Left $ L loc $ ForD (ForeignImport (L loc (vName nm)) (cvtType loc typ) i False)
- Nothing -> Right $ text (show from)
- <+> ptext SLIT("is not a valid ccall impent")
- where callconv' = case callconv of
- CCall -> CCallConv
- StdCall -> StdCallConv
- safety' = case safety of
- Unsafe -> PlayRisky
- Safe -> PlaySafe False
- Threadsafe -> PlaySafe True
- parsed = parse_ccall_impent (TH.nameBase nm) from
-
-cvt_top loc (ForeignD (ExportF callconv as nm typ))
- = let e = CExport (CExportStatic (mkFastString as) callconv')
- in Left $ L loc $ ForD (ForeignExport (L loc (vName nm)) (cvtType loc typ) e False)
- where callconv' = case callconv of
- CCall -> CCallConv
- StdCall -> StdCallConv
-
-mk_con loc con = L loc $ mk_nlcon con
- where
- -- Can't handle GADTs yet
- mk_nlcon con = case con of
- NormalC c strtys
- -> ConDecl (L loc (cName c)) Explicit noExistentials (noContext loc)
- (PrefixCon (map mk_arg strtys)) ResTyH98
- RecC c varstrtys
- -> ConDecl (L loc (cName c)) Explicit noExistentials (noContext loc)
- (RecCon (map mk_id_arg varstrtys)) ResTyH98
- InfixC st1 c st2
- -> ConDecl (L loc (cName c)) Explicit noExistentials (noContext loc)
- (InfixCon (mk_arg st1) (mk_arg st2)) ResTyH98
- ForallC tvs ctxt (ForallC tvs' ctxt' con')
- -> mk_nlcon (ForallC (tvs ++ tvs') (ctxt ++ ctxt') con')
- ForallC tvs ctxt con' -> case mk_nlcon con' of
- ConDecl l _ [] (L _ []) x ResTyH98 ->
- ConDecl l Explicit (cvt_tvs loc tvs) (cvt_context loc ctxt) x ResTyH98
- c -> panic "ForallC: Can't happen"
- mk_arg (IsStrict, ty) = L loc $ HsBangTy HsStrict (cvtType loc ty)
- mk_arg (NotStrict, ty) = cvtType loc ty
-
- mk_id_arg (i, IsStrict, ty)
- = (L loc (vName i), L loc $ HsBangTy HsStrict (cvtType loc ty))
- mk_id_arg (i, NotStrict, ty)
- = (L loc (vName i), cvtType loc ty)
-
-mk_derivs loc [] = Nothing
-mk_derivs loc cs = Just [L loc $ HsPredTy $ HsClassP (tconName c) [] | c <- cs]
-
-cvt_fundep :: FunDep -> Class.FunDep RdrName
-cvt_fundep (FunDep xs ys) = (map tName xs, map tName ys)
+instance Monad CvtM where
+ return x = CvtM $ \loc -> Right x
+ (CvtM m) >>= k = CvtM $ \loc -> case m loc of
+ Left err -> Left err
+ Right v -> unCvtM (k v) loc
+
+initCvt :: SrcSpan -> CvtM a -> Either Message a
+initCvt loc (CvtM m) = m loc
+
+force :: a -> CvtM a
+force a = a `seq` return a
+
+failWith :: Message -> CvtM a
+failWith m = CvtM (\loc -> Left full_msg)
+ where
+ full_msg = m $$ ptext SLIT("When splicing generated code into the program")
+
+returnL :: a -> CvtM (Located a)
+returnL x = CvtM (\loc -> Right (L loc x))
+
+wrapL :: CvtM a -> CvtM (Located a)
+wrapL (CvtM m) = CvtM (\loc -> case m loc of
+ Left err -> Left err
+ Right v -> Right (L loc v))
+
+-------------------------------------------------------------------
+cvtTop :: TH.Dec -> CvtM (LHsDecl RdrName)
+cvtTop d@(TH.ValD _ _ _) = do { L loc d' <- cvtBind d; return (L loc $ Hs.ValD d') }
+cvtTop d@(TH.FunD _ _) = do { L loc d' <- cvtBind d; return (L loc $ Hs.ValD d') }
+cvtTop (TH.SigD nm typ) = do { nm' <- vNameL nm
+ ; ty' <- cvtType typ
+ ; returnL $ Hs.SigD (TypeSig nm' ty') }
+
+cvtTop (TySynD tc tvs rhs)
+ = do { tc' <- tconNameL tc
+ ; tvs' <- cvtTvs tvs
+ ; rhs' <- cvtType rhs
+ ; returnL $ TyClD (TySynonym tc' tvs' rhs') }
+
+cvtTop (DataD ctxt tc tvs constrs derivs)
+ = do { stuff <- cvt_tycl_hdr ctxt tc tvs
+ ; cons' <- mapM cvtConstr constrs
+ ; derivs' <- cvtDerivs derivs
+ ; returnL $ TyClD (mkTyData DataType stuff Nothing cons' derivs') }
+
+
+cvtTop (NewtypeD ctxt tc tvs constr derivs)
+ = do { stuff <- cvt_tycl_hdr ctxt tc tvs
+ ; con' <- cvtConstr constr
+ ; derivs' <- cvtDerivs derivs
+ ; returnL $ TyClD (mkTyData NewType stuff Nothing [con'] derivs') }
+
+cvtTop (ClassD ctxt cl tvs fds decs)
+ = do { stuff <- cvt_tycl_hdr ctxt cl tvs
+ ; fds' <- mapM cvt_fundep fds
+ ; (binds', sigs') <- cvtBindsAndSigs decs
+ ; returnL $ TyClD $ mkClassDecl stuff fds' sigs' binds' }
+
+cvtTop (InstanceD tys ty decs)
+ = do { (binds', sigs') <- cvtBindsAndSigs decs
+ ; ctxt' <- cvtContext tys
+ ; L loc pred' <- cvtPred ty
+ ; inst_ty' <- returnL $ mkImplicitHsForAllTy ctxt' (L loc (HsPredTy pred'))
+ ; returnL $ InstD (InstDecl inst_ty' binds' sigs') }
+
+cvtTop (ForeignD ford) = do { ford' <- cvtForD ford; returnL $ ForD ford' }
+
+cvt_tycl_hdr cxt tc tvs
+ = do { cxt' <- cvtContext cxt
+ ; tc' <- tconNameL tc
+ ; tvs' <- cvtTvs tvs
+ ; return (cxt', tc', tvs') }
+
+---------------------------------------------------
+-- Data types
+-- Can't handle GADTs yet
+---------------------------------------------------
+
+cvtConstr (NormalC c strtys)
+ = do { c' <- cNameL c
+ ; cxt' <- returnL []
+ ; tys' <- mapM cvt_arg strtys
+ ; returnL $ ConDecl c' Explicit noExistentials cxt' (PrefixCon tys') ResTyH98 }
+
+cvtConstr (RecC c varstrtys)
+ = do { c' <- cNameL c
+ ; cxt' <- returnL []
+ ; args' <- mapM cvt_id_arg varstrtys
+ ; returnL $ ConDecl c' Explicit noExistentials cxt' (RecCon args') ResTyH98 }
+
+cvtConstr (InfixC st1 c st2)
+ = do { c' <- cNameL c
+ ; cxt' <- returnL []
+ ; st1' <- cvt_arg st1
+ ; st2' <- cvt_arg st2
+ ; returnL $ ConDecl c' Explicit noExistentials cxt' (InfixCon st1' st2') ResTyH98 }
+
+cvtConstr (ForallC tvs ctxt (ForallC tvs' ctxt' con'))
+ = cvtConstr (ForallC (tvs ++ tvs') (ctxt ++ ctxt') con')
+
+cvtConstr (ForallC tvs ctxt con)
+ = do { L _ con' <- cvtConstr con
+ ; tvs' <- cvtTvs tvs
+ ; ctxt' <- cvtContext ctxt
+ ; case con' of
+ ConDecl l _ [] (L _ []) x ResTyH98
+ -> returnL $ ConDecl l Explicit tvs' ctxt' x ResTyH98
+ c -> panic "ForallC: Can't happen" }
+
+cvt_arg (IsStrict, ty) = do { ty' <- cvtType ty; returnL $ HsBangTy HsStrict ty' }
+cvt_arg (NotStrict, ty) = cvtType ty
+
+cvt_id_arg (i, str, ty) = do { i' <- vNameL i
+ ; ty' <- cvt_arg (str,ty)
+ ; return (i', ty') }
+
+cvtDerivs [] = return Nothing
+cvtDerivs cs = do { cs' <- mapM cvt_one cs
+ ; return (Just cs') }
+ where
+ cvt_one c = do { c' <- tconName c
+ ; returnL $ HsPredTy $ HsClassP c' [] }
+
+cvt_fundep :: FunDep -> CvtM (Located (Class.FunDep RdrName))
+cvt_fundep (FunDep xs ys) = do { xs' <- mapM tName xs; ys' <- mapM tName ys; returnL (xs', ys') }
+
+noExistentials = []
+
+------------------------------------------
+-- Foreign declarations
+------------------------------------------
+
+cvtForD :: Foreign -> CvtM (ForeignDecl RdrName)
+cvtForD (ImportF callconv safety from nm ty)
+ | Just (c_header, cis) <- parse_ccall_impent (TH.nameBase nm) from
+ = do { nm' <- vNameL nm
+ ; ty' <- cvtType ty
+ ; let i = CImport (cvt_conv callconv) safety' c_header nilFS cis
+ ; return $ ForeignImport nm' ty' i False }
+
+ | otherwise
+ = failWith $ text (show from)<+> ptext SLIT("is not a valid ccall impent")
+ where
+ safety' = case safety of
+ Unsafe -> PlayRisky
+ Safe -> PlaySafe False
+ Threadsafe -> PlaySafe True
+
+cvtForD (ExportF callconv as nm ty)
+ = do { nm' <- vNameL nm
+ ; ty' <- cvtType ty
+ ; let e = CExport (CExportStatic (mkFastString as) (cvt_conv callconv))
+ ; return $ ForeignExport nm' ty' e False }
+
+cvt_conv CCall = CCallConv
+cvt_conv StdCall = StdCallConv
parse_ccall_impent :: String -> String -> Maybe (FastString, CImportSpec)
parse_ccall_impent nm s
where is_valid :: Char -> Bool
is_valid c = isAscii c && (isAlphaNum c || c `elem` "._")
-noContext loc = L loc []
-noExistentials = []
-
--------------------------------------------------------------------
-convertToHsExpr :: SrcSpan -> TH.Exp -> LHsExpr RdrName
-convertToHsExpr loc e = cvtl loc e
-cvtl loc e = cvt_l e
- where
- cvt_l e = L loc (cvt e)
+---------------------------------------------------
+-- Declarations
+---------------------------------------------------
- cvt (VarE s) = HsVar (vName s)
- cvt (ConE s) = HsVar (cName s)
- cvt (LitE l)
- | overloadedLit l = HsOverLit (cvtOverLit l)
- | otherwise = HsLit (cvtLit l)
+cvtDecs :: [TH.Dec] -> CvtM (HsLocalBinds RdrName)
+cvtDecs [] = return EmptyLocalBinds
+cvtDecs ds = do { (binds,sigs) <- cvtBindsAndSigs ds
+ ; return (HsValBinds (ValBindsIn binds sigs)) }
- cvt (AppE x y) = HsApp (cvt_l x) (cvt_l y)
- cvt (LamE ps e) = HsLam (mkMatchGroup [mkSimpleMatch (map (cvtlp loc) ps) (cvtl loc e)])
- cvt (TupE [e]) = cvt e
- cvt (TupE es) = ExplicitTuple(map cvt_l es) Boxed
- cvt (CondE x y z) = HsIf (cvt_l x) (cvt_l y) (cvt_l z)
- cvt (LetE ds e) = HsLet (cvtdecs loc ds) (cvt_l e)
- cvt (CaseE e ms) = HsCase (cvt_l e) (mkMatchGroup (map (cvtm loc) ms))
- cvt (DoE ss) = cvtHsDo loc DoExpr ss
- cvt (CompE ss) = cvtHsDo loc ListComp ss
- cvt (ArithSeqE dd) = ArithSeq noPostTcExpr (cvtdd loc dd)
- cvt (ListE xs) = ExplicitList void (map cvt_l xs)
- cvt (InfixE (Just x) s (Just y))
- = HsPar (L loc $ OpApp (cvt_l x) (cvt_l s) undefined (cvt_l y))
- cvt (InfixE Nothing s (Just y)) = SectionR (cvt_l s) (cvt_l y)
- cvt (InfixE (Just x) s Nothing ) = SectionL (cvt_l x) (cvt_l s)
- cvt (InfixE Nothing s Nothing ) = cvt s -- Can I indicate this is an infix thing?
- cvt (SigE e t) = ExprWithTySig (cvt_l e) (cvtType loc t)
- cvt (RecConE c flds) = RecordCon (L loc (cName c)) noPostTcExpr
- (map (\(x,y) -> (L loc (vName x), cvt_l y)) flds)
- cvt (RecUpdE e flds) = RecordUpd (cvt_l e) (map (\(x,y) -> (L loc (vName x), cvt_l y)) flds)
- placeHolderType placeHolderType
-
-cvtHsDo loc do_or_lc stmts
- = HsDo do_or_lc (init stmts') body void
- where
- stmts' = cvtstmts loc stmts
- body = case last stmts' of
- L _ (ExprStmt body _ _) -> body
-
-cvtdecs :: SrcSpan -> [TH.Dec] -> HsLocalBinds RdrName
-cvtdecs loc [] = EmptyLocalBinds
-cvtdecs loc ds = HsValBinds (ValBindsIn binds sigs)
- where
- (binds, sigs) = cvtBindsAndSigs loc ds
-
-cvtBindsAndSigs loc ds
- = (cvtds loc non_sigs, map (cvtSig loc) sigs)
+cvtBindsAndSigs ds
+ = do { binds' <- mapM cvtBind binds; sigs' <- mapM cvtSig sigs
+ ; return (listToBag binds', sigs') }
where
- (sigs, non_sigs) = partition sigP ds
+ (sigs, binds) = partition is_sig ds
-cvtSig loc (TH.SigD nm typ) = L loc (Hs.TypeSig (L loc (vName nm)) (cvtType loc typ))
+ is_sig (TH.SigD _ _) = True
+ is_sig other = False
-cvtds :: SrcSpan -> [TH.Dec] -> LHsBinds RdrName
-cvtds loc [] = emptyBag
-cvtds loc (d:ds) = cvtd loc d `consBag` cvtds loc ds
+cvtSig (TH.SigD nm ty)
+ = do { nm' <- vNameL nm; ty' <- cvtType ty; returnL (Hs.TypeSig nm' ty') }
-cvtd :: SrcSpan -> TH.Dec -> LHsBind RdrName
+cvtBind :: TH.Dec -> CvtM (LHsBind RdrName)
-- Used only for declarations in a 'let/where' clause,
-- not for top level decls
-cvtd loc (TH.ValD (TH.VarP s) body ds)
- = L loc $ FunBind (L loc (vName s)) False
- (mkMatchGroup [cvtclause loc (Clause [] body ds)])
- placeHolderNames
-cvtd loc (FunD nm cls)
- = L loc $ FunBind (L loc (vName nm)) False
- (mkMatchGroup (map (cvtclause loc) cls))
- placeHolderNames
-cvtd loc (TH.ValD p body ds)
- = L loc $ PatBind (cvtlp loc p) (GRHSs (cvtguard loc body) (cvtdecs loc ds))
- void placeHolderNames
-
-cvtd loc d = cvtPanic "Illegal kind of declaration in where clause"
- (text (TH.pprint d))
-
-
-cvtclause :: SrcSpan -> TH.Clause -> Hs.LMatch RdrName
-cvtclause loc (Clause ps body wheres)
- = L loc $ Hs.Match (map (cvtlp loc) ps) Nothing (GRHSs (cvtguard loc body) (cvtdecs loc wheres))
-
-
-
-cvtdd :: SrcSpan -> Range -> ArithSeqInfo RdrName
-cvtdd loc (FromR x) = (From (cvtl loc x))
-cvtdd loc (FromThenR x y) = (FromThen (cvtl loc x) (cvtl loc y))
-cvtdd loc (FromToR x y) = (FromTo (cvtl loc x) (cvtl loc y))
-cvtdd loc (FromThenToR x y z) = (FromThenTo (cvtl loc x) (cvtl loc y) (cvtl loc z))
-
-
-cvtstmts :: SrcSpan -> [TH.Stmt] -> [Hs.LStmt RdrName]
-cvtstmts loc [] = []
-cvtstmts loc (NoBindS e : ss) = L loc (mkExprStmt (cvtl loc e)) : cvtstmts loc ss
-cvtstmts loc (TH.BindS p e : ss) = L loc (mkBindStmt (cvtlp loc p) (cvtl loc e)) : cvtstmts loc ss
-cvtstmts loc (TH.LetS ds : ss) = L loc (LetStmt (cvtdecs loc ds)) : cvtstmts loc ss
-cvtstmts loc (TH.ParS dss : ss) = L loc (ParStmt [(cvtstmts loc ds, undefined) | ds <- dss]) : cvtstmts loc ss
-
-cvtm :: SrcSpan -> TH.Match -> Hs.LMatch RdrName
-cvtm loc (TH.Match p body wheres)
- = L loc (Hs.Match [cvtlp loc p] Nothing (GRHSs (cvtguard loc body) (cvtdecs loc wheres)))
-
-cvtguard :: SrcSpan -> TH.Body -> [LGRHS RdrName]
-cvtguard loc (GuardedB pairs) = map (cvtpair loc) pairs
-cvtguard loc (NormalB e) = [L loc (GRHS [] (cvtl loc e))]
-
-cvtpair :: SrcSpan -> (TH.Guard,TH.Exp) -> LGRHS RdrName
-cvtpair loc (NormalG x,y) = L loc (GRHS [L loc $ mkBindStmt truePat (cvtl loc x)]
- (cvtl loc y))
-cvtpair loc (PatG x,y) = L loc (GRHS (cvtstmts loc x) (cvtl loc y))
-
-cvtOverLit :: Lit -> HsOverLit RdrName
-cvtOverLit (IntegerL i) = mkHsIntegral i
-cvtOverLit (RationalL r) = mkHsFractional r
--- An Integer is like an an (overloaded) '3' in a Haskell source program
--- Similarly 3.5 for fractionals
+cvtBind (TH.ValD (TH.VarP s) body ds)
+ = do { s' <- vNameL s
+ ; cl' <- cvtClause (Clause [] body ds)
+ ; returnL $ FunBind s' False (mkMatchGroup [cl']) placeHolderNames }
-cvtLit :: Lit -> HsLit
-cvtLit (IntPrimL i) = HsIntPrim i
-cvtLit (FloatPrimL f) = HsFloatPrim f
-cvtLit (DoublePrimL f) = HsDoublePrim f
-cvtLit (CharL c) = HsChar c
-cvtLit (StringL s) = HsString (mkFastString s)
-
-cvtlp :: SrcSpan -> TH.Pat -> Hs.LPat RdrName
-cvtlp loc pat = L loc (cvtp loc pat)
-
-cvtp :: SrcSpan -> TH.Pat -> Hs.Pat RdrName
-cvtp loc (TH.LitP l)
- | overloadedLit l = mkNPat (cvtOverLit l) Nothing -- Not right for negative
- -- patterns; need to think
- -- about that!
- | otherwise = Hs.LitPat (cvtLit l)
-cvtp loc (TH.VarP s) = Hs.VarPat(vName s)
-cvtp loc (TupP [p]) = cvtp loc p
-cvtp loc (TupP ps) = TuplePat (map (cvtlp loc) ps) Boxed
-cvtp loc (ConP s ps) = ConPatIn (L loc (cName s)) (PrefixCon (map (cvtlp loc) ps))
-cvtp loc (InfixP p1 s p2)
- = ConPatIn (L loc (cName s)) (InfixCon (cvtlp loc p1) (cvtlp loc p2))
-cvtp loc (TildeP p) = LazyPat (cvtlp loc p)
-cvtp loc (TH.AsP s p) = AsPat (L loc (vName s)) (cvtlp loc p)
-cvtp loc TH.WildP = WildPat void
-cvtp loc (RecP c fs) = ConPatIn (L loc (cName c)) $ Hs.RecCon (map (\(s,p) -> (L loc (vName s),cvtlp loc p)) fs)
-cvtp loc (ListP ps) = ListPat (map (cvtlp loc) ps) void
-cvtp loc (SigP p t) = SigPatIn (cvtlp loc p) (cvtType loc t)
+cvtBind (TH.FunD nm cls)
+ = do { nm' <- vNameL nm
+ ; cls' <- mapM cvtClause cls
+ ; returnL $ FunBind nm' False (mkMatchGroup cls') placeHolderNames }
------------------------------------------------------------
--- Types and type variables
+cvtBind (TH.ValD p body ds)
+ = do { p' <- cvtPat p
+ ; g' <- cvtGuard body
+ ; ds' <- cvtDecs ds
+ ; returnL $ PatBind p' (GRHSs g' ds') void placeHolderNames }
+
+cvtBind d
+ = failWith (sep [ptext SLIT("Illegal kind of declaration in where clause"),
+ nest 2 (text (TH.pprint d))])
+
+
+cvtClause :: TH.Clause -> CvtM (Hs.LMatch RdrName)
+cvtClause (Clause ps body wheres)
+ = do { ps' <- cvtPats ps
+ ; g' <- cvtGuard body
+ ; ds' <- cvtDecs wheres
+ ; returnL $ Hs.Match ps' Nothing (GRHSs g' ds') }
-cvt_tvs :: SrcSpan -> [TH.Name] -> [LHsTyVarBndr RdrName]
-cvt_tvs loc tvs = map (L loc . UserTyVar . tName) tvs
-cvt_context :: SrcSpan -> Cxt -> LHsContext RdrName
-cvt_context loc tys = L loc (map (L loc . cvt_pred loc) tys)
+-------------------------------------------------------------------
+-- Expressions
+-------------------------------------------------------------------
-cvt_pred :: SrcSpan -> TH.Type -> HsPred RdrName
-cvt_pred loc ty
- = case split_ty_app ty of
- (ConT tc, tys) -> HsClassP (tconName tc) (map (cvtType loc) tys)
- (VarT tv, tys) -> HsClassP (tName tv) (map (cvtType loc) tys)
- other -> cvtPanic "Malformed predicate" (text (TH.pprint ty))
+cvtl :: TH.Exp -> CvtM (LHsExpr RdrName)
+cvtl e = wrapL (cvt e)
+ where
+ cvt (VarE s) = do { s' <- vName s; return $ HsVar s' }
+ cvt (ConE s) = do { s' <- cName s; return $ HsVar s' }
+ cvt (LitE l)
+ | overloadedLit l = do { l' <- cvtOverLit l; return $ HsOverLit l' }
+ | otherwise = do { l' <- cvtLit l; return $ HsLit l' }
-convertToHsType = cvtType
+ cvt (AppE x y) = do { x' <- cvtl x; y' <- cvtl y; return $ HsApp x' y' }
+ cvt (LamE ps e) = do { ps' <- cvtPats ps; e' <- cvtl e
+ ; return $ HsLam (mkMatchGroup [mkSimpleMatch ps' e']) }
+ cvt (TupE [e]) = cvt e
+ cvt (TupE es) = do { es' <- mapM cvtl es; return $ ExplicitTuple es' Boxed }
+ cvt (CondE x y z) = do { x' <- cvtl x; y' <- cvtl y; z' <- cvtl z
+ ; return $ HsIf x' y' z' }
+ cvt (LetE ds e) = do { ds' <- cvtDecs ds; e' <- cvtl e; return $ HsLet ds' e' }
+ cvt (CaseE e ms) = do { e' <- cvtl e; ms' <- mapM cvtMatch ms
+ ; return $ HsCase e' (mkMatchGroup ms') }
+ cvt (DoE ss) = cvtHsDo DoExpr ss
+ cvt (CompE ss) = cvtHsDo ListComp ss
+ cvt (ArithSeqE dd) = do { dd' <- cvtDD dd; return $ ArithSeq noPostTcExpr dd' }
+ cvt (ListE xs) = do { xs' <- mapM cvtl xs; return $ ExplicitList void xs' }
+ cvt (InfixE (Just x) s (Just y)) = do { x' <- cvtl x; s' <- cvtl s; y' <- cvtl y
+ ; e' <- returnL $ OpApp x' s' undefined y'
+ ; return $ HsPar e' }
+ cvt (InfixE Nothing s (Just y)) = do { s' <- cvtl s; y' <- cvtl y
+ ; return $ SectionR s' y' }
+ cvt (InfixE (Just x) s Nothing ) = do { x' <- cvtl x; s' <- cvtl s
+ ; return $ SectionL x' s' }
+ cvt (InfixE Nothing s Nothing ) = cvt s -- Can I indicate this is an infix thing?
-cvtType :: SrcSpan -> TH.Type -> LHsType RdrName
-cvtType loc ty = trans (root ty [])
- where root (AppT a b) zs = root a (cvtType loc b : zs)
- root t zs = (t,zs)
+ cvt (SigE e t) = do { e' <- cvtl e; t' <- cvtType t
+ ; return $ ExprWithTySig e' t' }
+ cvt (RecConE c flds) = do { c' <- cNameL c
+ ; flds' <- mapM cvtFld flds
+ ; return $ RecordCon c' noPostTcExpr flds' }
+ cvt (RecUpdE e flds) = do { e' <- cvtl e
+ ; flds' <- mapM cvtFld flds
+ ; return $ RecordUpd e' flds' placeHolderType placeHolderType }
+
+cvtFld (v,e) = do { v' <- vNameL v; e' <- cvtl e; return (v',e') }
+
+cvtDD :: Range -> CvtM (ArithSeqInfo RdrName)
+cvtDD (FromR x) = do { x' <- cvtl x; return $ From x' }
+cvtDD (FromThenR x y) = do { x' <- cvtl x; y' <- cvtl y; return $ FromThen x' y' }
+cvtDD (FromToR x y) = do { x' <- cvtl x; y' <- cvtl y; return $ FromTo x' y' }
+cvtDD (FromThenToR x y z) = do { x' <- cvtl x; y' <- cvtl y; z' <- cvtl z; return $ FromThenTo x' y' z' }
+
+-------------------------------------
+-- Do notation and statements
+-------------------------------------
+
+cvtHsDo do_or_lc stmts
+ = do { stmts' <- cvtStmts stmts
+ ; let body = case last stmts' of
+ L _ (ExprStmt body _ _) -> body
+ ; return $ HsDo do_or_lc (init stmts') body void }
+
+cvtStmts = mapM cvtStmt
+
+cvtStmt :: TH.Stmt -> CvtM (Hs.LStmt RdrName)
+cvtStmt (NoBindS e) = do { e' <- cvtl e; returnL $ mkExprStmt e' }
+cvtStmt (TH.BindS p e) = do { p' <- cvtPat p; e' <- cvtl e; returnL $ mkBindStmt p' e' }
+cvtStmt (TH.LetS ds) = do { ds' <- cvtDecs ds; returnL $ LetStmt ds' }
+cvtStmt (TH.ParS dss) = do { dss' <- mapM cvt_one dss; returnL $ ParStmt dss' }
+ where
+ cvt_one ds = do { ds' <- cvtStmts ds; return (ds', undefined) }
+
+cvtMatch :: TH.Match -> CvtM (Hs.LMatch RdrName)
+cvtMatch (TH.Match p body decs)
+ = do { p' <- cvtPat p
+ ; g' <- cvtGuard body
+ ; decs' <- cvtDecs decs
+ ; returnL $ Hs.Match [p'] Nothing (GRHSs g' decs') }
+
+cvtGuard :: TH.Body -> CvtM [LGRHS RdrName]
+cvtGuard (GuardedB pairs) = mapM cvtpair pairs
+cvtGuard (NormalB e) = do { e' <- cvtl e; g' <- returnL $ GRHS [] e'; return [g'] }
+
+cvtpair :: (TH.Guard, TH.Exp) -> CvtM (LGRHS RdrName)
+cvtpair (NormalG ge,rhs) = do { ge' <- cvtl ge; rhs' <- cvtl rhs
+ ; g' <- returnL $ mkBindStmt truePat ge'
+ ; returnL $ GRHS [g'] rhs' }
+cvtpair (PatG gs,rhs) = do { gs' <- cvtStmts gs; rhs' <- cvtl rhs
+ ; returnL $ GRHS gs' rhs' }
+
+cvtOverLit :: Lit -> CvtM (HsOverLit RdrName)
+cvtOverLit (IntegerL i) = do { force i; return $ mkHsIntegral i }
+cvtOverLit (RationalL r) = do { force r; return $ mkHsFractional r }
+-- An Integer is like an an (overloaded) '3' in a Haskell source program
+-- Similarly 3.5 for fractionals
- trans (TupleT n,args)
- | length args == n = L loc (HsTupleTy Boxed args)
- | n == 0 = foldl nlHsAppTy (nlHsTyVar (getRdrName unitTyCon)) args
- | otherwise = foldl nlHsAppTy (nlHsTyVar (getRdrName (tupleTyCon Boxed n))) args
- trans (ArrowT, [x,y]) = nlHsFunTy x y
- trans (ListT, [x]) = L loc (HsListTy x)
+cvtLit :: Lit -> CvtM HsLit
+cvtLit (IntPrimL i) = do { force i; return $ HsIntPrim i }
+cvtLit (FloatPrimL f) = do { force f; return $ HsFloatPrim f }
+cvtLit (DoublePrimL f) = do { force f; return $ HsDoublePrim f }
+cvtLit (CharL c) = do { force c; return $ HsChar c }
+cvtLit (StringL s) = do { let { s' = mkFastString s }; force s'; return $ HsString s' }
+
+cvtPats :: [TH.Pat] -> CvtM [Hs.LPat RdrName]
+cvtPats pats = mapM cvtPat pats
+
+cvtPat :: TH.Pat -> CvtM (Hs.LPat RdrName)
+cvtPat pat = wrapL (cvtp pat)
+
+cvtp :: TH.Pat -> CvtM (Hs.Pat RdrName)
+cvtp (TH.LitP l)
+ | overloadedLit l = do { l' <- cvtOverLit l
+ ; return (mkNPat l' Nothing) }
+ -- Not right for negative patterns;
+ -- need to think about that!
+ | otherwise = do { l' <- cvtLit l; return $ Hs.LitPat l' }
+cvtp (TH.VarP s) = do { s' <- vName s; return $ Hs.VarPat s' }
+cvtp (TupP [p]) = cvtp p
+cvtp (TupP ps) = do { ps' <- cvtPats ps; return $ TuplePat ps' Boxed }
+cvtp (ConP s ps) = do { s' <- cNameL s; ps' <- cvtPats ps; return $ ConPatIn s' (PrefixCon ps') }
+cvtp (InfixP p1 s p2) = do { s' <- cNameL s; p1' <- cvtPat p1; p2' <- cvtPat p2
+ ; return $ ConPatIn s' (InfixCon p1' p2') }
+cvtp (TildeP p) = do { p' <- cvtPat p; return $ LazyPat p' }
+cvtp (TH.AsP s p) = do { s' <- vNameL s; p' <- cvtPat p; return $ AsPat s' p' }
+cvtp TH.WildP = return $ WildPat void
+cvtp (RecP c fs) = do { c' <- cNameL c; fs' <- mapM cvtPatFld fs
+ ; return $ ConPatIn c' $ Hs.RecCon fs' }
+cvtp (ListP ps) = do { ps' <- cvtPats ps; return $ ListPat ps' void }
+cvtp (SigP p t) = do { p' <- cvtPat p; t' <- cvtType t; return $ SigPatIn p' t' }
+
+cvtPatFld (s,p) = do { s' <- vNameL s; p' <- cvtPat p; return (s',p') }
- trans (VarT nm, args) = foldl nlHsAppTy (nlHsTyVar (tName nm)) args
- trans (ConT tc, args) = foldl nlHsAppTy (nlHsTyVar (tconName tc)) args
+-----------------------------------------------------------
+-- Types and type variables
- trans (ForallT tvs cxt ty, []) = L loc $ mkExplicitHsForAllTy
- (cvt_tvs loc tvs) (cvt_context loc cxt) (cvtType loc ty)
+cvtTvs :: [TH.Name] -> CvtM [LHsTyVarBndr RdrName]
+cvtTvs tvs = mapM cvt_tv tvs
+
+cvt_tv tv = do { tv' <- tName tv; returnL $ UserTyVar tv' }
+
+cvtContext :: Cxt -> CvtM (LHsContext RdrName)
+cvtContext tys = do { preds' <- mapM cvtPred tys; returnL preds' }
+
+cvtPred :: TH.Type -> CvtM (LHsPred RdrName)
+cvtPred ty
+ = do { (head, tys') <- split_ty_app ty
+ ; case head of
+ ConT tc -> do { tc' <- tconName tc; returnL $ HsClassP tc' tys' }
+ VarT tv -> do { tv' <- tName tv; returnL $ HsClassP tv' tys' }
+ other -> failWith (ptext SLIT("Malformed predicate") <+> text (TH.pprint ty)) }
+
+cvtType :: TH.Type -> CvtM (LHsType RdrName)
+cvtType ty = do { (head, tys') <- split_ty_app ty
+ ; case head of
+ TupleT n | length tys' == n -> returnL (HsTupleTy Boxed tys')
+ | n == 0 -> mk_apps (HsTyVar (getRdrName unitTyCon)) tys'
+ | otherwise -> mk_apps (HsTyVar (getRdrName (tupleTyCon Boxed n))) tys'
+ ArrowT | [x',y'] <- tys' -> returnL (HsFunTy x' y')
+ ListT | [x'] <- tys' -> returnL (HsListTy x')
+ VarT nm -> do { nm' <- tName nm; mk_apps (HsTyVar nm') tys' }
+ ConT nm -> do { nm' <- tconName nm; mk_apps (HsTyVar nm') tys' }
+
+ ForallT tvs cxt ty | null tys' -> do { tvs' <- cvtTvs tvs
+ ; cxt' <- cvtContext cxt
+ ; ty' <- cvtType ty
+ ; returnL $ mkExplicitHsForAllTy tvs' cxt' ty' }
+ otherwise -> failWith (ptext SLIT("Malformed type") <+> text (show ty))
+ }
+ where
+ mk_apps head [] = returnL head
+ mk_apps head (ty:tys) = do { head' <- returnL head; mk_apps (HsAppTy head' ty) tys }
-split_ty_app :: TH.Type -> (TH.Type, [TH.Type])
+split_ty_app :: TH.Type -> CvtM (TH.Type, [LHsType RdrName])
split_ty_app ty = go ty []
where
- go (AppT f a) as = go f (a:as)
- go f as = (f,as)
+ go (AppT f a) as' = do { a' <- cvtType a; go f (a':as') }
+ go f as = return (f,as)
-----------------------------------------------------------
-sigP :: Dec -> Bool
-sigP (TH.SigD _ _) = True
-sigP other = False
-----------------------------------------------------------
-cvtPanic :: String -> SDoc -> b
-cvtPanic herald thing
- = pprPanic herald (thing $$ ptext SLIT("When splicing generated code into the program"))
-
------------------------------------------------------------
-- some useful things
truePat = nlConPat (getRdrName trueDataCon) []
--------------------------------------------------------------------
-- variable names
-vName :: TH.Name -> RdrName
-vName = thRdrName OccName.varName
+vNameL, cNameL, tconNameL :: TH.Name -> CvtM (Located RdrName)
+vName, cName, tName, tconName :: TH.Name -> CvtM RdrName
+
+vNameL n = wrapL (vName n)
+vName n = force (thRdrName OccName.varName n)
-- Constructor function names; this is Haskell source, hence srcDataName
-cName :: TH.Name -> RdrName
-cName = thRdrName OccName.srcDataName
+cNameL n = wrapL (cName n)
+cName n = force (thRdrName OccName.srcDataName n)
-- Type variable names
-tName :: TH.Name -> RdrName
-tName = thRdrName OccName.tvName
+tName n = force (thRdrName OccName.tvName n)
-- Type Constructor names
-tconName = thRdrName OccName.tcName
+tconNameL n = wrapL (tconName n)
+tconName n = force (thRdrName OccName.tcName n)
thRdrName :: OccName.NameSpace -> TH.Name -> RdrName
-- This turns a Name into a RdrName
-- The passed-in name space tells what the context is expecting;
-- use it unless the TH name knows what name-space it comes
-- from, in which case use the latter
-thRdrName ctxt_ns (TH.Name occ (TH.NameG th_ns mod)) = mkOrig (mk_mod mod) (mk_occ (mk_ghc_ns th_ns) occ)
-thRdrName ctxt_ns (TH.Name occ (TH.NameL uniq)) = nameRdrName (mkInternalName (mk_uniq uniq) (mk_occ ctxt_ns occ) noSrcLoc)
-thRdrName ctxt_ns (TH.Name occ (TH.NameQ mod)) = mkRdrQual (mk_mod mod) (mk_occ ctxt_ns occ)
-thRdrName ctxt_ns (TH.Name occ TH.NameS) = mkRdrUnqual (mk_occ ctxt_ns occ)
-thRdrName ctxt_ns (TH.Name occ (TH.NameU uniq)) = mkRdrUnqual (mk_uniq_occ ctxt_ns occ uniq)
+--
+-- The strict applications ensure that any buried exceptions get forced
+thRdrName ctxt_ns (TH.Name occ (TH.NameG th_ns mod)) = (mkOrig $! (mk_mod mod)) $! (mk_occ (mk_ghc_ns th_ns) occ)
+thRdrName ctxt_ns (TH.Name occ (TH.NameL uniq)) = nameRdrName $! (((mkInternalName $! (mk_uniq uniq)) $! (mk_occ ctxt_ns occ)) noSrcLoc)
+thRdrName ctxt_ns (TH.Name occ (TH.NameQ mod)) = (mkRdrQual $! (mk_mod mod)) $! (mk_occ ctxt_ns occ)
+thRdrName ctxt_ns (TH.Name occ TH.NameS) = mkRdrUnqual $! (mk_occ ctxt_ns occ)
+thRdrName ctxt_ns (TH.Name occ (TH.NameU uniq)) = mkRdrUnqual $! (mk_uniq_occ ctxt_ns occ uniq)
mk_uniq_occ :: OccName.NameSpace -> TH.OccName -> Int# -> OccName.OccName
mk_uniq_occ ns occ uniq
projects / ghc-hetmet.git / commitdiff