X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=ghc%2Fcompiler%2FhsSyn%2FConvert.lhs;h=a012cd14bee8004ab8c69514b9513c7999fbc6df;hb=958924a2b338aebbcc8a88ba2cab511517762a19;hp=7601848f91f3fae0574ab59dd44951cfcb313043;hpb=063123a0a1b51609108aa4487894b78492411fb1;p=ghc-hetmet.git diff --git a/ghc/compiler/hsSyn/Convert.lhs b/ghc/compiler/hsSyn/Convert.lhs index 7601848..a012cd1 100644 --- a/ghc/compiler/hsSyn/Convert.lhs +++ b/ghc/compiler/hsSyn/Convert.lhs @@ -6,317 +6,448 @@ This module converts Template Haskell syntax into HsSyn \begin{code} -module Convert( convertToHsExpr, convertToHsDecls ) where +module Convert( convertToHsExpr, convertToHsDecls, convertToHsType, thRdrName ) where #include "HsVersions.h" -import Language.Haskell.THSyntax as Meta +import Language.Haskell.TH as TH hiding (sigP) +import Language.Haskell.TH.Syntax as TH import HsSyn as Hs - ( HsExpr(..), HsLit(..), ArithSeqInfo(..), - HsStmtContext(..), - Match(..), GRHSs(..), GRHS(..), HsPred(..), - HsDecl(..), TyClDecl(..), InstDecl(..), ConDecl(..), - Stmt(..), HsBinds(..), MonoBinds(..), Sig(..), - Pat(..), HsConDetails(..), HsOverLit, BangType(..), - placeHolderType, HsType(..), HsTupCon(..), - HsTyVarBndr(..), HsContext, - mkSimpleMatch - ) - -import RdrName ( RdrName, mkRdrUnqual, mkRdrQual, mkOrig ) -import Module ( mkModuleName ) -import RdrHsSyn ( mkHsIntegral, mkHsFractional, mkClassDecl, mkTyData ) -import OccName -import SrcLoc ( SrcLoc, generatedSrcLoc ) -import TyCon ( DataConDetails(..) ) +import qualified Class (FunDep) +import RdrName ( RdrName, mkRdrUnqual, mkRdrQual, mkOrig, getRdrName, nameRdrName ) +import Name ( mkInternalName ) +import Module ( Module, mkModule ) +import RdrHsSyn ( mkClassDecl, mkTyData ) +import qualified OccName +import SrcLoc ( unLoc, Located(..), SrcSpan ) import Type ( Type ) -import BasicTypes( Boxity(..), RecFlag(Recursive), - NewOrData(..), StrictnessMark(..) ) -import ForeignCall ( Safety(..), CCallConv(..), CCallTarget(..) ) -import HsDecls ( CImportSpec(..), ForeignImport(..), ForeignDecl(..) ) -import FastString( mkFastString, nilFS ) -import Char ( ord, isAlphaNum ) +import TysWiredIn ( unitTyCon, tupleTyCon, trueDataCon ) +import BasicTypes( Boxity(..) ) +import ForeignCall ( Safety(..), CCallConv(..), CCallTarget(..), + CExportSpec(..)) +import Char ( isAscii, isAlphaNum, isAlpha ) import List ( partition ) +import Unique ( Unique, mkUniqueGrimily ) +import ErrUtils (Message) +import GLAEXTS ( Int(..), Int# ) +import SrcLoc ( noSrcLoc ) +import Bag ( emptyBag, consBag ) +import FastString import Outputable ------------------------------------------------------------------- -convertToHsDecls :: [Meta.Dec] -> [HsDecl RdrName] -convertToHsDecls ds = map cvt_top ds - - -cvt_top d@(Val _ _ _) = ValD (cvtd d) -cvt_top d@(Fun _ _) = ValD (cvtd d) +convertToHsDecls :: SrcSpan -> [TH.Dec] -> [Either (LHsDecl RdrName) Message] +-- 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 (TySyn tc tvs rhs) - = TyClD (TySynonym (tconName tc) (cvt_tvs tvs) (cvtType rhs) loc0) - -cvt_top (Data tc tvs constrs derivs) - = TyClD (mkTyData DataType - (noContext, tconName tc, cvt_tvs tvs) - (DataCons (map mk_con constrs)) - (mk_derivs derivs) loc0) +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 - mk_con (Constr c tys) - = ConDecl (cName c) noExistentials noContext - (PrefixCon (map mk_arg tys)) loc0 - - mk_arg ty = BangType NotMarkedStrict (cvtType ty) + (binds,sigs) = cvtBindsAndSigs loc decs - mk_derivs [] = Nothing - mk_derivs cs = Just [HsClassP (tconName c) [] | c <- cs] - -cvt_top (Class ctxt cl tvs decs) - = TyClD (mkClassDecl (cvt_context ctxt, tconName cl, cvt_tvs tvs) - noFunDeps - sigs (Just binds) loc0) +cvt_top loc (InstanceD tys ty decs) + = Left $ L loc $ InstD (InstDecl (L loc inst_ty) binds sigs) where - (binds,sigs) = cvtBindsAndSigs decs - -cvt_top (Instance tys ty decs) - = InstD (InstDecl inst_ty binds sigs Nothing loc0) - where - (binds, sigs) = cvtBindsAndSigs decs - inst_ty = HsForAllTy Nothing - (cvt_context tys) - (HsPredTy (cvt_pred ty)) - -cvt_top (Proto nm typ) = SigD (Sig (vName nm) (cvtType typ) loc0) - -cvt_top (Foreign (Import callconv safety from nm typ)) - = ForD (ForeignImport (vName nm) (cvtType typ) fi False loc0) - where fi = CImport callconv' safety' c_header nilFS cis - callconv' = case callconv of + (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 - (c_header', c_func') = break (== ' ') from - c_header = mkFastString c_header' - c_func = tail c_func' - cis = CFunction (StaticTarget (mkFastString c_func)) + 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 -noContext = [] +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) + +parse_ccall_impent :: String -> String -> Maybe (FastString, CImportSpec) +parse_ccall_impent nm s + = case lex_ccall_impent s of + Just ["dynamic"] -> Just (nilFS, CFunction DynamicTarget) + Just ["wrapper"] -> Just (nilFS, CWrapper) + Just ("static":ts) -> parse_ccall_impent_static nm ts + Just ts -> parse_ccall_impent_static nm ts + Nothing -> Nothing + +parse_ccall_impent_static :: String + -> [String] + -> Maybe (FastString, CImportSpec) +parse_ccall_impent_static nm ts + = let ts' = case ts of + [ "&", cid] -> [ cid] + [fname, "&" ] -> [fname ] + [fname, "&", cid] -> [fname, cid] + _ -> ts + in case ts' of + [ cid] | is_cid cid -> Just (nilFS, mk_cid cid) + [fname, cid] | is_cid cid -> Just (mkFastString fname, mk_cid cid) + [ ] -> Just (nilFS, mk_cid nm) + [fname ] -> Just (mkFastString fname, mk_cid nm) + _ -> Nothing + where is_cid :: String -> Bool + is_cid x = all (/= '.') x && (isAlpha (head x) || head x == '_') + mk_cid :: String -> CImportSpec + mk_cid = CFunction . StaticTarget . mkFastString + +lex_ccall_impent :: String -> Maybe [String] +lex_ccall_impent "" = Just [] +lex_ccall_impent ('&':xs) = fmap ("&":) $ lex_ccall_impent xs +lex_ccall_impent (' ':xs) = lex_ccall_impent xs +lex_ccall_impent ('\t':xs) = lex_ccall_impent xs +lex_ccall_impent xs = case span is_valid xs of + ("", _) -> Nothing + (t, xs') -> fmap (t:) $ lex_ccall_impent xs' + where is_valid :: Char -> Bool + is_valid c = isAscii c && (isAlphaNum c || c `elem` "._") + +noContext loc = L loc [] noExistentials = [] -noFunDeps = [] ------------------------------------------------------------------- -convertToHsExpr :: Meta.Exp -> HsExpr RdrName -convertToHsExpr = cvt - -cvt (Var s) = HsVar(vName s) -cvt (Con s) = HsVar(cName s) -cvt (Lit l) - | overloadedLit l = HsOverLit (cvtOverLit l) - | otherwise = HsLit (cvtLit l) - -cvt (App x y) = HsApp (cvt x) (cvt y) -cvt (Lam ps e) = HsLam (mkSimpleMatch (map cvtp ps) (cvt e) void loc0) -cvt (Tup es) = ExplicitTuple(map cvt es) Boxed -cvt (Cond x y z) = HsIf (cvt x) (cvt y) (cvt z) loc0 -cvt (Let ds e) = HsLet (cvtdecs ds) (cvt e) -cvt (Case e ms) = HsCase (cvt e) (map cvtm ms) loc0 -cvt (Do ss) = HsDo DoExpr (cvtstmts ss) [] void loc0 -cvt (Comp ss) = HsDo ListComp (cvtstmts ss) [] void loc0 -cvt (ArithSeq dd) = ArithSeqIn (cvtdd dd) -cvt (ListExp xs) = ExplicitList void (map cvt xs) -cvt (Infix (Just x) s (Just y)) = OpApp (cvt x) (HsVar(vName s)) undefined (cvt y) -cvt (Infix Nothing s (Just y)) = SectionR (HsVar(vName s)) (cvt y) -cvt (Infix (Just x) s Nothing ) = SectionL (cvt x) (HsVar(vName s)) -cvt (Infix Nothing s Nothing ) = HsVar(vName s) -- Can I indicate this is an infix thing? -cvt (SigExp e t) = ExprWithTySig (cvt e) (cvtType t) - -cvtdecs :: [Meta.Dec] -> HsBinds RdrName -cvtdecs [] = EmptyBinds -cvtdecs ds = MonoBind binds sigs Recursive +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) + + cvt (VarE s) = HsVar (vName s) + cvt (ConE s) = HsVar (cName s) + cvt (LitE l) + | overloadedLit l = HsOverLit (cvtOverLit l) + | otherwise = HsLit (cvtLit l) + + 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 ds + (binds, sigs) = cvtBindsAndSigs loc ds -cvtBindsAndSigs ds - = (cvtds non_sigs, map cvtSig sigs) +cvtBindsAndSigs loc ds + = (cvtds loc non_sigs, map (cvtSig loc) sigs) where (sigs, non_sigs) = partition sigP ds -cvtSig (Proto nm typ) = Sig (vName nm) (cvtType typ) loc0 +cvtSig loc (TH.SigD nm typ) = L loc (Hs.TypeSig (L loc (vName nm)) (cvtType loc typ)) -cvtds :: [Meta.Dec] -> MonoBinds RdrName -cvtds [] = EmptyMonoBinds -cvtds (d:ds) = AndMonoBinds (cvtd d) (cvtds ds) +cvtds :: SrcSpan -> [TH.Dec] -> LHsBinds RdrName +cvtds loc [] = emptyBag +cvtds loc (d:ds) = cvtd loc d `consBag` cvtds loc ds -cvtd :: Meta.Dec -> MonoBinds RdrName +cvtd :: SrcSpan -> TH.Dec -> LHsBind RdrName -- Used only for declarations in a 'let/where' clause, -- not for top level decls -cvtd (Val (Pvar s) body ds) = FunMonoBind (vName s) False - (panic "what now?") loc0 -cvtd (Fun nm cls) = FunMonoBind (vName nm) False (map cvtclause cls) loc0 -cvtd (Val p body ds) = PatMonoBind (cvtp p) (GRHSs (cvtguard body) - (cvtdecs ds) - void) loc0 -cvtd x = panic "Illegal kind of declaration in where clause" - - -cvtclause :: Meta.Clause (Meta.Pat) (Meta.Exp) (Meta.Dec) -> Hs.Match RdrName -cvtclause (ps,body,wheres) = Match (map cvtp ps) Nothing - (GRHSs (cvtguard body) (cvtdecs wheres) void) - - - -cvtdd :: Meta.DDt -> ArithSeqInfo RdrName -cvtdd (Meta.From x) = (Hs.From (cvt x)) -cvtdd (Meta.FromThen x y) = (Hs.FromThen (cvt x) (cvt y)) -cvtdd (Meta.FromTo x y) = (Hs.FromTo (cvt x) (cvt y)) -cvtdd (Meta.FromThenTo x y z) = (Hs.FromThenTo (cvt x) (cvt y) (cvt z)) - - -cvtstmts :: [Meta.Stm] -> [Hs.Stmt RdrName] -cvtstmts [] = [] -- this is probably an error as every [stmt] should end with ResultStmt -cvtstmts [NoBindSt e] = [ResultStmt (cvt e) loc0] -- when its the last element use ResultStmt -cvtstmts (NoBindSt e : ss) = ExprStmt (cvt e) void loc0 : cvtstmts ss -cvtstmts (BindSt p e : ss) = BindStmt (cvtp p) (cvt e) loc0 : cvtstmts ss -cvtstmts (LetSt ds : ss) = LetStmt (cvtdecs ds) : cvtstmts ss -cvtstmts (ParSt dss : ss) = ParStmt(map cvtstmts dss) : cvtstmts ss - - -cvtm :: Meta.Mat -> Hs.Match RdrName -cvtm (p,body,wheres) = Match [cvtp p] Nothing - (GRHSs (cvtguard body) (cvtdecs wheres) void) - -cvtguard :: Meta.Rhs -> [GRHS RdrName] -cvtguard (Guarded pairs) = map cvtpair pairs -cvtguard (Normal e) = [GRHS [ ResultStmt (cvt e) loc0 ] loc0] - -cvtpair :: (Meta.Exp,Meta.Exp) -> GRHS RdrName -cvtpair (x,y) = GRHS [BindStmt truePat (cvt x) loc0, - ResultStmt (cvt y) loc0] loc0 - -cvtOverLit :: Lit -> HsOverLit -cvtOverLit (Integer i) = mkHsIntegral i -cvtOverLit (Rational r) = mkHsFractional r +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 cvtLit :: Lit -> HsLit -cvtLit (Char c) = HsChar (ord c) -cvtLit (String s) = HsString (mkFastString s) - -cvtp :: Meta.Pat -> Hs.Pat RdrName -cvtp (Plit l) - | overloadedLit l = NPatIn (cvtOverLit l) Nothing -- Not right for negative +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 = LitPat (cvtLit l) -cvtp (Pvar s) = VarPat(vName s) -cvtp (Ptup ps) = TuplePat (map cvtp ps) Boxed -cvtp (Pcon s ps) = ConPatIn (cName s) (PrefixCon (map cvtp ps)) -cvtp (Ptilde p) = LazyPat (cvtp p) -cvtp (Paspat s p) = AsPat (vName s) (cvtp p) -cvtp Pwild = WildPat void + | 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) ----------------------------------------------------------- -- Types and type variables -cvt_tvs :: [String] -> [HsTyVarBndr RdrName] -cvt_tvs tvs = map (UserTyVar . tName) tvs +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) -cvt_context :: Cxt -> HsContext RdrName -cvt_context tys = map cvt_pred tys +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)) -cvt_pred :: Typ -> HsPred RdrName -cvt_pred ty = case split_ty_app ty of - (Tvar tc, tys) -> HsClassP (tconName tc) (map cvtType tys) - other -> panic "Malformed predicate" +convertToHsType = cvtType -cvtType :: Meta.Typ -> HsType RdrName -cvtType ty = trans (root ty []) - where root (Tapp a b) zs = root a (cvtType b : zs) +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) - trans (Tcon (Tuple n),args) | length args == n - = HsTupleTy (HsTupCon Boxed n) args - trans (Tcon Arrow, [x,y]) = HsFunTy x y - trans (Tcon List, [x]) = HsListTy x + 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) - trans (Tvar nm, args) = foldl HsAppTy (HsTyVar (tName nm)) args - trans (Tcon tc, args) = foldl HsAppTy (HsTyVar (tc_name tc)) args + trans (VarT nm, args) = foldl nlHsAppTy (nlHsTyVar (tName nm)) args + trans (ConT tc, args) = foldl nlHsAppTy (nlHsTyVar (tconName tc)) args - tc_name (TconName nm) = tconName nm - tc_name Arrow = tconName "->" - tc_name List = tconName "[]" - tc_name (Tuple 0) = tconName "()" - tc_name (Tuple n) = tconName ("(" ++ replicate (n-1) ',' ++ ")") + trans (ForallT tvs cxt ty, []) = L loc $ mkExplicitHsForAllTy + (cvt_tvs loc tvs) (cvt_context loc cxt) (cvtType loc ty) -split_ty_app :: Typ -> (Typ, [Typ]) +split_ty_app :: TH.Type -> (TH.Type, [TH.Type]) split_ty_app ty = go ty [] where - go (Tapp f a) as = go f (a:as) + go (AppT f a) as = go f (a:as) go f as = (f,as) ----------------------------------------------------------- sigP :: Dec -> Bool -sigP (Proto _ _) = True +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 = ConPatIn (cName "True") (PrefixCon []) -falsePat = ConPatIn (cName "False") (PrefixCon []) +truePat = nlConPat (getRdrName trueDataCon) [] overloadedLit :: Lit -> Bool -- True for literals that Haskell treats as overloaded -overloadedLit (Integer l) = True -overloadedLit (Rational l) = True -overloadedLit l = False +overloadedLit (IntegerL l) = True +overloadedLit (RationalL l) = True +overloadedLit l = False void :: Type.Type void = placeHolderType -loc0 :: SrcLoc -loc0 = generatedSrcLoc +-------------------------------------------------------------------- +-- Turning Name back into RdrName +-------------------------------------------------------------------- -- variable names -vName :: String -> RdrName -vName = mkName varName +vName :: TH.Name -> RdrName +vName = thRdrName OccName.varName --- Constructor function names -cName :: String -> RdrName -cName = mkName dataName +-- Constructor function names; this is Haskell source, hence srcDataName +cName :: TH.Name -> RdrName +cName = thRdrName OccName.srcDataName -- Type variable names -tName :: String -> RdrName -tName = mkName tvName +tName :: TH.Name -> RdrName +tName = thRdrName OccName.tvName -- Type Constructor names -tconName = mkName tcName - -mkName :: NameSpace -> String -> RdrName --- Parse the string to see if it has a "." or ":" in it --- so we know whether to generate a qualified or original name --- It's a bit tricky because we need to parse --- Foo.Baz.x as Qual Foo.Baz x --- So we parse it from back to front - -mkName ns str - = split [] (reverse str) - where - split occ [] = mkRdrUnqual (mk_occ occ) - split occ (c:d:rev) -- 'd' is the last char before the separator - | is_sep c -- E.g. Fo.x d='o' - && isAlphaNum d -- Fo.+: d='+' perhaps - = mk_qual (reverse (d:rev)) c occ - split occ (c:rev) = split (c:occ) rev - - mk_qual mod '.' occ = mkRdrQual (mk_mod mod) (mk_occ occ) - mk_qual mod ':' occ = mkOrig (mk_mod mod) (mk_occ occ) - - mk_occ occ = mkOccFS ns (mkFastString occ) - mk_mod mod = mkModuleName mod - - is_sep '.' = True - is_sep ':' = True - is_sep other = False +tconName = thRdrName OccName.tcName + +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) + +mk_uniq_occ :: OccName.NameSpace -> TH.OccName -> Int# -> OccName.OccName +mk_uniq_occ ns occ uniq + = OccName.mkOccName ns (TH.occString occ ++ '[' : shows (mk_uniq uniq) "]") + -- The idea here is to make a name that + -- a) the user could not possibly write, and + -- b) cannot clash with another NameU + -- Previously I generated an Exact RdrName with mkInternalName. + -- This works fine for local binders, but does not work at all for + -- top-level binders, which must have External Names, since they are + -- rapidly baked into data constructors and the like. Baling out + -- and generating an unqualified RdrName here is the simple solution + +mk_ghc_ns :: TH.NameSpace -> OccName.NameSpace +mk_ghc_ns DataName = OccName.dataName +mk_ghc_ns TH.TcClsName = OccName.tcClsName +mk_ghc_ns TH.VarName = OccName.varName + +-- The packing and unpacking is rather turgid :-( +mk_occ :: OccName.NameSpace -> TH.OccName -> OccName.OccName +mk_occ ns occ = OccName.mkOccFS ns (mkFastString (TH.occString occ)) + +mk_mod :: TH.ModName -> Module +mk_mod mod = mkModule (TH.modString mod) + +mk_uniq :: Int# -> Unique +mk_uniq u = mkUniqueGrimily (I# u) \end{code} +