1 -----------------------------------------------------------------------------
2 -- The purpose of this module is to transform an HsExpr into a CoreExpr which
3 -- when evaluated, returns a (Meta.Q Meta.Exp) computation analogous to the
4 -- input HsExpr. We do this in the DsM monad, which supplies access to
5 -- CoreExpr's of the "smart constructors" of the Meta.Exp datatype.
7 -- It also defines a bunch of knownKeyNames, in the same way as is done
8 -- in prelude/PrelNames. It's much more convenient to do it here, becuase
9 -- otherwise we have to recompile PrelNames whenever we add a Name, which is
10 -- a Royal Pain (triggers other recompilation).
11 -----------------------------------------------------------------------------
14 module DsMeta( dsBracket,
15 templateHaskellNames, qTyConName, nameTyConName,
16 liftName, expQTyConName, decQTyConName, typeQTyConName,
17 decTyConName, typeTyConName, mkNameG_dName, mkNameG_vName, mkNameG_tcName
20 #include "HsVersions.h"
22 import {-# SOURCE #-} DsExpr ( dsExpr )
24 import MatchLit ( dsLit )
25 import DsUtils ( mkListExpr, mkStringLit, mkCoreTup, mkIntExpr )
28 import qualified Language.Haskell.TH as TH
31 import PrelNames ( rationalTyConName, integerTyConName, negateName )
32 import OccName ( isDataOcc, isTvOcc, occNameUserString )
33 -- To avoid clashes with DsMeta.varName we must make a local alias for OccName.varName
34 -- we do this by removing varName from the import of OccName above, making
35 -- a qualified instance of OccName and using OccNameAlias.varName where varName
36 -- ws previously used in this file.
37 import qualified OccName
39 import Module ( Module, mkModule, mkModuleName, moduleUserString )
40 import Id ( Id, mkLocalId )
41 import OccName ( mkOccFS )
42 import Name ( Name, mkExternalName, localiseName, nameOccName, nameModule,
43 isExternalName, getSrcLoc )
45 import Type ( Type, mkGenTyConApp )
46 import TcType ( tcTyConAppArgs )
47 import TyCon ( tyConName )
48 import TysWiredIn ( parrTyCon )
50 import CoreUtils ( exprType )
51 import SrcLoc ( noSrcLoc, unLoc, Located(..), SrcSpan, srcLocSpan )
52 import Maybe ( catMaybes )
53 import Unique ( mkPreludeTyConUnique, mkPreludeMiscIdUnique, getKey, Uniquable(..) )
54 import BasicTypes ( isBoxed )
55 import Packages ( thPackage )
57 import Bag ( bagToList )
58 import FastString ( unpackFS )
59 import ForeignCall ( Safety(..), ForeignCall(..), CCallConv(..),
62 import Monad ( zipWithM )
63 import List ( sortBy )
65 -----------------------------------------------------------------------------
66 dsBracket :: HsBracket Name -> [PendingSplice] -> DsM CoreExpr
67 -- Returns a CoreExpr of type TH.ExpQ
68 -- The quoted thing is parameterised over Name, even though it has
69 -- been type checked. We don't want all those type decorations!
71 dsBracket brack splices
72 = dsExtendMetaEnv new_bit (do_brack brack)
74 new_bit = mkNameEnv [(n, Splice (unLoc e)) | (n,e) <- splices]
76 do_brack (VarBr n) = do { MkC e1 <- lookupOcc n ; return e1 }
77 do_brack (ExpBr e) = do { MkC e1 <- repLE e ; return e1 }
78 do_brack (PatBr p) = do { MkC p1 <- repLP p ; return p1 }
79 do_brack (TypBr t) = do { MkC t1 <- repLTy t ; return t1 }
80 do_brack (DecBr ds) = do { MkC ds1 <- repTopDs ds ; return ds1 }
82 {- -------------- Examples --------------------
86 gensym (unpackString "x"#) `bindQ` \ x1::String ->
87 lam (pvar x1) (var x1)
90 [| \x -> $(f [| x |]) |]
92 gensym (unpackString "x"#) `bindQ` \ x1::String ->
93 lam (pvar x1) (f (var x1))
97 -------------------------------------------------------
99 -------------------------------------------------------
101 repTopDs :: HsGroup Name -> DsM (Core (TH.Q [TH.Dec]))
103 = do { let { bndrs = map unLoc (groupBinders group) } ;
104 ss <- mkGenSyms bndrs ;
106 -- Bind all the names mainly to avoid repeated use of explicit strings.
108 -- do { t :: String <- genSym "T" ;
109 -- return (Data t [] ...more t's... }
110 -- The other important reason is that the output must mention
111 -- only "T", not "Foo:T" where Foo is the current module
114 decls <- addBinds ss (do {
115 val_ds <- mapM rep_bind_group (hs_valds group) ;
116 tycl_ds <- mapM repTyClD (hs_tyclds group) ;
117 inst_ds <- mapM repInstD' (hs_instds group) ;
118 for_ds <- mapM repForD (hs_fords group) ;
120 return (de_loc $ sort_by_loc $ concat val_ds ++ catMaybes tycl_ds ++ inst_ds ++ for_ds) }) ;
122 decl_ty <- lookupType decQTyConName ;
123 let { core_list = coreList' decl_ty decls } ;
125 dec_ty <- lookupType decTyConName ;
126 q_decs <- repSequenceQ dec_ty core_list ;
128 wrapNongenSyms ss q_decs
129 -- Do *not* gensym top-level binders
132 groupBinders (HsGroup { hs_valds = val_decls, hs_tyclds = tycl_decls,
133 hs_fords = foreign_decls })
134 -- Collect the binders of a Group
135 = collectGroupBinders val_decls ++
136 [n | d <- tycl_decls, n <- tyClDeclNames (unLoc d)] ++
137 [n | L _ (ForeignImport n _ _ _) <- foreign_decls]
140 {- Note [Binders and occurrences]
141 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
142 When we desugar [d| data T = MkT |]
144 Data "T" [] [Con "MkT" []] []
146 Data "Foo:T" [] [Con "Foo:MkT" []] []
147 That is, the new data decl should fit into whatever new module it is
148 asked to fit in. We do *not* clone, though; no need for this:
155 then we must desugar to
156 foo = Data "Foo:T" [] [Con "Foo:MkT" []] []
158 So in repTopDs we bring the binders into scope with mkGenSyms and addBinds.
159 And we use lookupOcc, rather than lookupBinder
160 in repTyClD and repC.
164 repTyClD :: LTyClDecl Name -> DsM (Maybe (SrcSpan, Core TH.DecQ))
166 repTyClD (L loc (TyData { tcdND = DataType, tcdCtxt = cxt,
167 tcdLName = tc, tcdTyVars = tvs,
168 tcdCons = cons, tcdDerivs = mb_derivs }))
169 = do { tc1 <- lookupLOcc tc ; -- See note [Binders and occurrences]
170 dec <- addTyVarBinds tvs $ \bndrs -> do {
171 cxt1 <- repLContext cxt ;
172 cons1 <- mapM repC cons ;
173 cons2 <- coreList conQTyConName cons1 ;
174 derivs1 <- repDerivs mb_derivs ;
175 bndrs1 <- coreList nameTyConName bndrs ;
176 repData cxt1 tc1 bndrs1 cons2 derivs1 } ;
177 return $ Just (loc, dec) }
179 repTyClD (L loc (TyData { tcdND = NewType, tcdCtxt = cxt,
180 tcdLName = tc, tcdTyVars = tvs,
181 tcdCons = [con], tcdDerivs = mb_derivs }))
182 = do { tc1 <- lookupLOcc tc ; -- See note [Binders and occurrences]
183 dec <- addTyVarBinds tvs $ \bndrs -> do {
184 cxt1 <- repLContext cxt ;
186 derivs1 <- repDerivs mb_derivs ;
187 bndrs1 <- coreList nameTyConName bndrs ;
188 repNewtype cxt1 tc1 bndrs1 con1 derivs1 } ;
189 return $ Just (loc, dec) }
191 repTyClD (L loc (TySynonym { tcdLName = tc, tcdTyVars = tvs, tcdSynRhs = ty }))
192 = do { tc1 <- lookupLOcc tc ; -- See note [Binders and occurrences]
193 dec <- addTyVarBinds tvs $ \bndrs -> do {
195 bndrs1 <- coreList nameTyConName bndrs ;
196 repTySyn tc1 bndrs1 ty1 } ;
197 return (Just (loc, dec)) }
199 repTyClD (L loc (ClassDecl { tcdCtxt = cxt, tcdLName = cls,
201 tcdFDs = [], -- We don't understand functional dependencies
202 tcdSigs = sigs, tcdMeths = meth_binds }))
203 = do { cls1 <- lookupLOcc cls ; -- See note [Binders and occurrences]
204 dec <- addTyVarBinds tvs $ \bndrs -> do {
205 cxt1 <- repLContext cxt ;
206 sigs1 <- rep_sigs sigs ;
207 binds1 <- rep_binds meth_binds ;
208 decls1 <- coreList decQTyConName (sigs1 ++ binds1) ;
209 bndrs1 <- coreList nameTyConName bndrs ;
210 repClass cxt1 cls1 bndrs1 decls1 } ;
211 return $ Just (loc, dec) }
214 repTyClD (L loc d) = do { dsWarn (loc, hang msg 4 (ppr d)) ;
218 msg = ptext SLIT("Cannot desugar this Template Haskell declaration:")
220 repInstD' (L loc (InstDecl ty binds _)) -- Ignore user pragmas for now
221 = do { i <- addTyVarBinds tvs $ \tv_bndrs ->
222 -- We must bring the type variables into scope, so their occurrences
223 -- don't fail, even though the binders don't appear in the resulting
225 do { cxt1 <- repContext cxt
226 ; inst_ty1 <- repPred (HsClassP cls tys)
227 ; ss <- mkGenSyms (collectHsBindBinders binds)
228 ; binds1 <- addBinds ss (rep_binds binds)
229 ; decls1 <- coreList decQTyConName binds1
230 ; decls2 <- wrapNongenSyms ss decls1
231 -- wrapNonGenSyms: do not clone the class op names!
232 -- They must be called 'op' etc, not 'op34'
233 ; repInst cxt1 inst_ty1 decls2 }
237 (tvs, cxt, cls, tys) = splitHsInstDeclTy (unLoc ty)
239 repForD :: Located (ForeignDecl Name) -> DsM (SrcSpan, Core TH.DecQ)
240 repForD (L loc (ForeignImport name typ (CImport cc s ch cn cis) _))
241 = do MkC name' <- lookupLOcc name
242 MkC typ' <- repLTy typ
243 MkC cc' <- repCCallConv cc
244 MkC s' <- repSafety s
245 MkC str <- coreStringLit $ static
246 ++ unpackFS ch ++ " "
247 ++ unpackFS cn ++ " "
248 ++ conv_cimportspec cis
249 dec <- rep2 forImpDName [cc', s', str, name', typ']
252 conv_cimportspec (CLabel cls) = panic "repForD': CLabel Not handled"
253 conv_cimportspec (CFunction DynamicTarget) = "dynamic"
254 conv_cimportspec (CFunction (StaticTarget fs)) = unpackFS fs
255 conv_cimportspec CWrapper = "wrapper"
257 CFunction (StaticTarget _) -> "static "
260 repCCallConv :: CCallConv -> DsM (Core TH.Callconv)
261 repCCallConv CCallConv = rep2 cCallName []
262 repCCallConv StdCallConv = rep2 stdCallName []
264 repSafety :: Safety -> DsM (Core TH.Safety)
265 repSafety PlayRisky = rep2 unsafeName []
266 repSafety (PlaySafe False) = rep2 safeName []
267 repSafety (PlaySafe True) = rep2 threadsafeName []
269 -------------------------------------------------------
271 -------------------------------------------------------
273 repC :: LConDecl Name -> DsM (Core TH.ConQ)
274 repC (L loc (ConDecl con [] (L _ []) details))
275 = do { con1 <- lookupLOcc con ; -- See note [Binders and occurrences]
276 repConstr con1 details }
278 repBangTy :: LBangType Name -> DsM (Core (TH.StrictTypeQ))
279 repBangTy (L _ (BangType str ty)) = do
280 MkC s <- rep2 strName []
282 rep2 strictTypeName [s, t]
283 where strName = case str of
284 HsNoBang -> notStrictName
285 other -> isStrictName
287 -------------------------------------------------------
289 -------------------------------------------------------
291 repDerivs :: Maybe [LHsType Name] -> DsM (Core [TH.Name])
292 repDerivs Nothing = coreList nameTyConName []
293 repDerivs (Just ctxt)
294 = do { strs <- mapM rep_deriv ctxt ;
295 coreList nameTyConName strs }
297 rep_deriv :: LHsType Name -> DsM (Core TH.Name)
298 -- Deriving clauses must have the simple H98 form
299 rep_deriv (L _ (HsPredTy (L _ (HsClassP cls [])))) = lookupOcc cls
300 rep_deriv other = panic "rep_deriv"
303 -------------------------------------------------------
304 -- Signatures in a class decl, or a group of bindings
305 -------------------------------------------------------
307 rep_sigs :: [LSig Name] -> DsM [Core TH.DecQ]
308 rep_sigs sigs = do locs_cores <- rep_sigs' sigs
309 return $ de_loc $ sort_by_loc locs_cores
311 rep_sigs' :: [LSig Name] -> DsM [(SrcSpan, Core TH.DecQ)]
312 -- We silently ignore ones we don't recognise
313 rep_sigs' sigs = do { sigs1 <- mapM rep_sig sigs ;
314 return (concat sigs1) }
316 rep_sig :: LSig Name -> DsM [(SrcSpan, Core TH.DecQ)]
318 -- Empty => Too hard, signature ignored
319 rep_sig (L loc (Sig nm ty)) = rep_proto nm ty loc
320 rep_sig other = return []
322 rep_proto :: Located Name -> LHsType Name -> SrcSpan -> DsM [(SrcSpan, Core TH.DecQ)]
323 rep_proto nm ty loc = do { nm1 <- lookupLOcc nm ;
325 sig <- repProto nm1 ty1 ;
326 return [(loc, sig)] }
329 -------------------------------------------------------
331 -------------------------------------------------------
333 -- gensym a list of type variables and enter them into the meta environment;
334 -- the computations passed as the second argument is executed in that extended
335 -- meta environment and gets the *new* names on Core-level as an argument
337 addTyVarBinds :: [LHsTyVarBndr Name] -- the binders to be added
338 -> ([Core TH.Name] -> DsM (Core (TH.Q a))) -- action in the ext env
339 -> DsM (Core (TH.Q a))
340 addTyVarBinds tvs m =
342 let names = map (hsTyVarName.unLoc) tvs
343 freshNames <- mkGenSyms names
344 term <- addBinds freshNames $ do
345 bndrs <- mapM lookupBinder names
347 wrapGenSyns freshNames term
349 -- represent a type context
351 repLContext :: LHsContext Name -> DsM (Core TH.CxtQ)
352 repLContext (L _ ctxt) = repContext ctxt
354 repContext :: HsContext Name -> DsM (Core TH.CxtQ)
356 preds <- mapM repLPred ctxt
357 predList <- coreList typeQTyConName preds
360 -- represent a type predicate
362 repLPred :: LHsPred Name -> DsM (Core TH.TypeQ)
363 repLPred (L _ p) = repPred p
365 repPred :: HsPred Name -> DsM (Core TH.TypeQ)
366 repPred (HsClassP cls tys) = do
367 tcon <- repTy (HsTyVar cls)
370 repPred (HsIParam _ _) =
371 panic "DsMeta.repTy: Can't represent predicates with implicit parameters"
373 -- yield the representation of a list of types
375 repLTys :: [LHsType Name] -> DsM [Core TH.TypeQ]
376 repLTys tys = mapM repLTy tys
380 repLTy :: LHsType Name -> DsM (Core TH.TypeQ)
381 repLTy (L _ ty) = repTy ty
383 repTy :: HsType Name -> DsM (Core TH.TypeQ)
384 repTy (HsForAllTy _ tvs ctxt ty) =
385 addTyVarBinds tvs $ \bndrs -> do
386 ctxt1 <- repLContext ctxt
388 bndrs1 <- coreList nameTyConName bndrs
389 repTForall bndrs1 ctxt1 ty1
392 | isTvOcc (nameOccName n) = do
393 tv1 <- lookupBinder n
398 repTy (HsAppTy f a) = do
402 repTy (HsFunTy f a) = do
405 tcon <- repArrowTyCon
406 repTapps tcon [f1, a1]
407 repTy (HsListTy t) = do
411 repTy (HsPArrTy t) = do
413 tcon <- repTy (HsTyVar (tyConName parrTyCon))
415 repTy (HsTupleTy tc tys) = do
417 tcon <- repTupleTyCon (length tys)
419 repTy (HsOpTy ty1 n ty2) = repLTy ((nlHsTyVar (unLoc n) `nlHsAppTy` ty1)
421 repTy (HsParTy t) = repLTy t
423 panic "DsMeta.repTy: Can't represent number types (for generics)"
424 repTy (HsPredTy pred) = repLPred pred
425 repTy (HsKindSig ty kind) =
426 panic "DsMeta.repTy: Can't represent explicit kind signatures yet"
429 -----------------------------------------------------------------------------
431 -----------------------------------------------------------------------------
433 repLEs :: [LHsExpr Name] -> DsM (Core [TH.ExpQ])
434 repLEs es = do { es' <- mapM repLE es ;
435 coreList expQTyConName es' }
437 -- FIXME: some of these panics should be converted into proper error messages
438 -- unless we can make sure that constructs, which are plainly not
439 -- supported in TH already lead to error messages at an earlier stage
440 repLE :: LHsExpr Name -> DsM (Core TH.ExpQ)
441 repLE (L _ e) = repE e
443 repE :: HsExpr Name -> DsM (Core TH.ExpQ)
445 do { mb_val <- dsLookupMetaEnv x
447 Nothing -> do { str <- globalVar x
448 ; repVarOrCon x str }
449 Just (Bound y) -> repVarOrCon x (coreVar y)
450 Just (Splice e) -> do { e' <- dsExpr e
451 ; return (MkC e') } }
452 repE (HsIPVar x) = panic "DsMeta.repE: Can't represent implicit parameters"
454 -- Remember, we're desugaring renamer output here, so
455 -- HsOverlit can definitely occur
456 repE (HsOverLit l) = do { a <- repOverloadedLiteral l; repLit a }
457 repE (HsLit l) = do { a <- repLiteral l; repLit a }
458 repE (HsLam m) = repLambda m
459 repE (HsApp x y) = do {a <- repLE x; b <- repLE y; repApp a b}
461 repE (OpApp e1 op fix e2) =
462 do { arg1 <- repLE e1;
465 repInfixApp arg1 the_op arg2 }
466 repE (NegApp x nm) = do
468 negateVar <- lookupOcc negateName >>= repVar
470 repE (HsPar x) = repLE x
471 repE (SectionL x y) = do { a <- repLE x; b <- repLE y; repSectionL a b }
472 repE (SectionR x y) = do { a <- repLE x; b <- repLE y; repSectionR a b }
473 repE (HsCase e ms) = do { arg <- repLE e
474 ; ms2 <- mapM repMatchTup ms
475 ; repCaseE arg (nonEmptyCoreList ms2) }
476 repE (HsIf x y z) = do
481 repE (HsLet bs e) = do { (ss,ds) <- repBinds bs
482 ; e2 <- addBinds ss (repLE e)
485 -- FIXME: I haven't got the types here right yet
486 repE (HsDo DoExpr sts _ ty)
487 = do { (ss,zs) <- repLSts sts;
488 e <- repDoE (nonEmptyCoreList zs);
490 repE (HsDo ListComp sts _ ty)
491 = do { (ss,zs) <- repLSts sts;
492 e <- repComp (nonEmptyCoreList zs);
494 repE (HsDo _ _ _ _) = panic "DsMeta.repE: Can't represent mdo and [: :] yet"
495 repE (ExplicitList ty es) = do { xs <- repLEs es; repListExp xs }
496 repE (ExplicitPArr ty es) =
497 panic "DsMeta.repE: No explicit parallel arrays yet"
498 repE (ExplicitTuple es boxed)
499 | isBoxed boxed = do { xs <- repLEs es; repTup xs }
500 | otherwise = panic "DsMeta.repE: Can't represent unboxed tuples"
501 repE (RecordCon c flds)
502 = do { x <- lookupLOcc c;
503 fs <- repFields flds;
505 repE (RecordUpd e flds)
507 fs <- repFields flds;
510 repE (ExprWithTySig e ty) = do { e1 <- repLE e; t1 <- repLTy ty; repSigExp e1 t1 }
511 repE (ArithSeqIn aseq) =
513 From e -> do { ds1 <- repLE e; repFrom ds1 }
522 FromThenTo e1 e2 e3 -> do
526 repFromThenTo ds1 ds2 ds3
527 repE (PArrSeqOut _ aseq) = panic "DsMeta.repE: parallel array seq.s missing"
528 repE (HsCoreAnn _ _) = panic "DsMeta.repE: Can't represent CoreAnn" -- hdaume: core annotations
529 repE (HsSCC _ _) = panic "DsMeta.repE: Can't represent SCC"
530 repE (HsBracketOut _ _) = panic "DsMeta.repE: Can't represent Oxford brackets"
531 repE (HsSpliceE (HsSplice n _))
532 = do { mb_val <- dsLookupMetaEnv n
534 Just (Splice e) -> do { e' <- dsExpr e
536 other -> pprPanic "HsSplice" (ppr n) }
538 repE e = pprPanic "DsMeta.repE: Illegal expression form" (ppr e)
540 -----------------------------------------------------------------------------
541 -- Building representations of auxillary structures like Match, Clause, Stmt,
543 repMatchTup :: LMatch Name -> DsM (Core TH.MatchQ)
544 repMatchTup (L _ (Match [p] ty (GRHSs guards wheres ty2))) =
545 do { ss1 <- mkGenSyms (collectPatBinders p)
546 ; addBinds ss1 $ do {
548 ; (ss2,ds) <- repBinds wheres
549 ; addBinds ss2 $ do {
550 ; gs <- repGuards guards
551 ; match <- repMatch p1 gs ds
552 ; wrapGenSyns (ss1++ss2) match }}}
554 repClauseTup :: LMatch Name -> DsM (Core TH.ClauseQ)
555 repClauseTup (L _ (Match ps ty (GRHSs guards wheres ty2))) =
556 do { ss1 <- mkGenSyms (collectPatsBinders ps)
557 ; addBinds ss1 $ do {
559 ; (ss2,ds) <- repBinds wheres
560 ; addBinds ss2 $ do {
561 gs <- repGuards guards
562 ; clause <- repClause ps1 gs ds
563 ; wrapGenSyns (ss1++ss2) clause }}}
565 repGuards :: [LGRHS Name] -> DsM (Core TH.BodyQ)
566 repGuards [L _ (GRHS [L _ (ResultStmt e)])]
567 = do {a <- repLE e; repNormal a }
569 = do { zs <- mapM process other;
570 repGuarded (nonEmptyCoreList (map corePair zs)) }
572 process (L _ (GRHS [L _ (ExprStmt e1 ty),
573 L _ (ResultStmt e2)]))
574 = do { x <- repLE e1; y <- repLE e2; return (x, y) }
575 process other = panic "Non Haskell 98 guarded body"
577 repFields :: [(Located Name, LHsExpr Name)] -> DsM (Core [TH.FieldExp])
579 fnames <- mapM lookupLOcc (map fst flds)
580 es <- mapM repLE (map snd flds)
581 fs <- zipWithM (\n x -> rep2 fieldExpName [unC n, unC x]) fnames es
582 coreList fieldExpTyConName fs
585 -----------------------------------------------------------------------------
586 -- Representing Stmt's is tricky, especially if bound variables
587 -- shadow each other. Consider: [| do { x <- f 1; x <- f x; g x } |]
588 -- First gensym new names for every variable in any of the patterns.
589 -- both static (x'1 and x'2), and dynamic ((gensym "x") and (gensym "y"))
590 -- if variables didn't shaddow, the static gensym wouldn't be necessary
591 -- and we could reuse the original names (x and x).
593 -- do { x'1 <- gensym "x"
594 -- ; x'2 <- gensym "x"
595 -- ; doE [ BindSt (pvar x'1) [| f 1 |]
596 -- , BindSt (pvar x'2) [| f x |]
597 -- , NoBindSt [| g x |]
601 -- The strategy is to translate a whole list of do-bindings by building a
602 -- bigger environment, and a bigger set of meta bindings
603 -- (like: x'1 <- gensym "x" ) and then combining these with the translations
604 -- of the expressions within the Do
606 -----------------------------------------------------------------------------
607 -- The helper function repSts computes the translation of each sub expression
608 -- and a bunch of prefix bindings denoting the dynamic renaming.
610 repLSts :: [LStmt Name] -> DsM ([GenSymBind], [Core TH.StmtQ])
611 repLSts stmts = repSts (map unLoc stmts)
613 repSts :: [Stmt Name] -> DsM ([GenSymBind], [Core TH.StmtQ])
614 repSts [ResultStmt e] =
616 ; e1 <- repNoBindSt a
617 ; return ([], [e1]) }
618 repSts (BindStmt p e : ss) =
620 ; ss1 <- mkGenSyms (collectPatBinders p)
621 ; addBinds ss1 $ do {
623 ; (ss2,zs) <- repSts ss
624 ; z <- repBindSt p1 e2
625 ; return (ss1++ss2, z : zs) }}
626 repSts (LetStmt bs : ss) =
627 do { (ss1,ds) <- repBinds bs
629 ; (ss2,zs) <- addBinds ss1 (repSts ss)
630 ; return (ss1++ss2, z : zs) }
631 repSts (ExprStmt e ty : ss) =
633 ; z <- repNoBindSt e2
634 ; (ss2,zs) <- repSts ss
635 ; return (ss2, z : zs) }
636 repSts other = panic "Exotic Stmt in meta brackets"
639 -----------------------------------------------------------
641 -----------------------------------------------------------
643 repBinds :: [HsBindGroup Name] -> DsM ([GenSymBind], Core [TH.DecQ])
645 = do { let { bndrs = map unLoc (collectGroupBinders decs) }
646 -- No need to worrry about detailed scopes within
647 -- the binding group, because we are talking Names
648 -- here, so we can safely treat it as a mutually
650 ; ss <- mkGenSyms bndrs
651 ; core <- addBinds ss (rep_bind_groups decs)
652 ; core_list <- coreList decQTyConName core
653 ; return (ss, core_list) }
655 rep_bind_groups :: [HsBindGroup Name] -> DsM [Core TH.DecQ]
656 -- Assumes: all the binders of the binding are alrady in the meta-env
657 rep_bind_groups binds = do
658 locs_cores_s <- mapM rep_bind_group binds
659 return $ de_loc $ sort_by_loc (concat locs_cores_s)
661 rep_bind_group :: HsBindGroup Name -> DsM [(SrcSpan, Core TH.DecQ)]
662 -- Assumes: all the binders of the binding are alrady in the meta-env
663 rep_bind_group (HsBindGroup bs sigs _)
664 = do { core1 <- mapM rep_bind (bagToList bs)
665 ; core2 <- rep_sigs' sigs
666 ; return (core1 ++ core2) }
667 rep_bind_group (HsIPBinds _)
668 = panic "DsMeta:repBinds: can't do implicit parameters"
670 rep_binds :: LHsBinds Name -> DsM [Core TH.DecQ]
671 -- Assumes: all the binders of the binding are alrady in the meta-env
673 locs_cores <- mapM rep_bind (bagToList binds)
674 return $ de_loc $ sort_by_loc locs_cores
676 rep_bind :: LHsBind Name -> DsM (SrcSpan, Core TH.DecQ)
677 -- Assumes: all the binders of the binding are alrady in the meta-env
679 -- Note GHC treats declarations of a variable (not a pattern)
680 -- e.g. x = g 5 as a Fun MonoBinds. This is indicated by a single match
681 -- with an empty list of patterns
682 rep_bind (L loc (FunBind fn infx [L _ (Match [] ty (GRHSs guards wheres ty2))]))
683 = do { (ss,wherecore) <- repBinds wheres
684 ; guardcore <- addBinds ss (repGuards guards)
685 ; fn' <- lookupLBinder fn
687 ; ans <- repVal p guardcore wherecore
688 ; return (loc, ans) }
690 rep_bind (L loc (FunBind fn infx ms))
691 = do { ms1 <- mapM repClauseTup ms
692 ; fn' <- lookupLBinder fn
693 ; ans <- repFun fn' (nonEmptyCoreList ms1)
694 ; return (loc, ans) }
696 rep_bind (L loc (PatBind pat (GRHSs guards wheres ty2)))
697 = do { patcore <- repLP pat
698 ; (ss,wherecore) <- repBinds wheres
699 ; guardcore <- addBinds ss (repGuards guards)
700 ; ans <- repVal patcore guardcore wherecore
701 ; return (loc, ans) }
703 rep_bind (L loc (VarBind v e))
704 = do { v' <- lookupBinder v
707 ; patcore <- repPvar v'
708 ; empty_decls <- coreList decQTyConName []
709 ; ans <- repVal patcore x empty_decls
710 ; return (srcLocSpan (getSrcLoc v), ans) }
712 -----------------------------------------------------------------------------
713 -- Since everything in a Bind is mutually recursive we need rename all
714 -- all the variables simultaneously. For example:
715 -- [| AndMonoBinds (f x = x + g 2) (g x = f 1 + 2) |] would translate to
716 -- do { f'1 <- gensym "f"
717 -- ; g'2 <- gensym "g"
718 -- ; [ do { x'3 <- gensym "x"; fun f'1 [pvar x'3] [| x + g2 |]},
719 -- do { x'4 <- gensym "x"; fun g'2 [pvar x'4] [| f 1 + 2 |]}
721 -- This requires collecting the bindings (f'1 <- gensym "f"), and the
722 -- environment ( f |-> f'1 ) from each binding, and then unioning them
723 -- together. As we do this we collect GenSymBinds's which represent the renamed
724 -- variables bound by the Bindings. In order not to lose track of these
725 -- representations we build a shadow datatype MB with the same structure as
726 -- MonoBinds, but which has slots for the representations
729 -----------------------------------------------------------------------------
730 -- GHC allows a more general form of lambda abstraction than specified
731 -- by Haskell 98. In particular it allows guarded lambda's like :
732 -- (\ x | even x -> 0 | odd x -> 1) at the moment we can't represent this in
733 -- Haskell Template's Meta.Exp type so we punt if it isn't a simple thing like
734 -- (\ p1 .. pn -> exp) by causing an error.
736 repLambda :: LMatch Name -> DsM (Core TH.ExpQ)
737 repLambda (L _ (Match ps _ (GRHSs [L _ (GRHS [L _ (ResultStmt e)])] [] _)))
738 = do { let bndrs = collectPatsBinders ps ;
739 ; ss <- mkGenSyms bndrs
740 ; lam <- addBinds ss (
741 do { xs <- repLPs ps; body <- repLE e; repLam xs body })
742 ; wrapGenSyns ss lam }
744 repLambda z = panic "Can't represent a guarded lambda in Template Haskell"
747 -----------------------------------------------------------------------------
749 -- repP deals with patterns. It assumes that we have already
750 -- walked over the pattern(s) once to collect the binders, and
751 -- have extended the environment. So every pattern-bound
752 -- variable should already appear in the environment.
754 -- Process a list of patterns
755 repLPs :: [LPat Name] -> DsM (Core [TH.Pat])
756 repLPs ps = do { ps' <- mapM repLP ps ;
757 coreList patTyConName ps' }
759 repLP :: LPat Name -> DsM (Core TH.Pat)
760 repLP (L _ p) = repP p
762 repP :: Pat Name -> DsM (Core TH.Pat)
763 repP (WildPat _) = repPwild
764 repP (LitPat l) = do { l2 <- repLiteral l; repPlit l2 }
765 repP (VarPat x) = do { x' <- lookupBinder x; repPvar x' }
766 repP (LazyPat p) = do { p1 <- repLP p; repPtilde p1 }
767 repP (AsPat x p) = do { x' <- lookupLBinder x; p1 <- repLP p; repPaspat x' p1 }
768 repP (ParPat p) = repLP p
769 repP (ListPat ps _) = do { qs <- repLPs ps; repPlist qs }
770 repP (TuplePat ps _) = do { qs <- repLPs ps; repPtup qs }
771 repP (ConPatIn dc details)
772 = do { con_str <- lookupLOcc dc
774 PrefixCon ps -> do { qs <- repLPs ps; repPcon con_str qs }
775 RecCon pairs -> do { vs <- sequence $ map lookupLOcc (map fst pairs)
776 ; ps <- sequence $ map repLP (map snd pairs)
777 ; fps <- zipWithM (\x y -> rep2 fieldPatName [unC x,unC y]) vs ps
778 ; fps' <- coreList fieldPatTyConName fps
779 ; repPrec con_str fps' }
780 InfixCon p1 p2 -> do { qs <- repLPs [p1,p2]; repPcon con_str qs }
782 repP (NPatIn l (Just _)) = panic "Can't cope with negative overloaded patterns yet (repP (NPatIn _ (Just _)))"
783 repP (NPatIn l Nothing) = do { a <- repOverloadedLiteral l; repPlit a }
784 repP other = panic "Exotic pattern inside meta brackets"
786 ----------------------------------------------------------
787 -- Declaration ordering helpers
789 sort_by_loc :: [(SrcSpan, a)] -> [(SrcSpan, a)]
790 sort_by_loc xs = sortBy comp xs
791 where comp x y = compare (fst x) (fst y)
793 de_loc :: [(a, b)] -> [b]
796 ----------------------------------------------------------
797 -- The meta-environment
799 -- A name/identifier association for fresh names of locally bound entities
800 type GenSymBind = (Name, Id) -- Gensym the string and bind it to the Id
801 -- I.e. (x, x_id) means
802 -- let x_id = gensym "x" in ...
804 -- Generate a fresh name for a locally bound entity
806 mkGenSyms :: [Name] -> DsM [GenSymBind]
807 -- We can use the existing name. For example:
808 -- [| \x_77 -> x_77 + x_77 |]
810 -- do { x_77 <- genSym "x"; .... }
811 -- We use the same x_77 in the desugared program, but with the type Bndr
814 -- We do make it an Internal name, though (hence localiseName)
816 -- Nevertheless, it's monadic because we have to generate nameTy
817 mkGenSyms ns = do { var_ty <- lookupType nameTyConName
818 ; return [(nm, mkLocalId (localiseName nm) var_ty) | nm <- ns] }
821 addBinds :: [GenSymBind] -> DsM a -> DsM a
822 -- Add a list of fresh names for locally bound entities to the
823 -- meta environment (which is part of the state carried around
824 -- by the desugarer monad)
825 addBinds bs m = dsExtendMetaEnv (mkNameEnv [(n,Bound id) | (n,id) <- bs]) m
827 -- Look up a locally bound name
829 lookupLBinder :: Located Name -> DsM (Core TH.Name)
830 lookupLBinder (L _ n) = lookupBinder n
832 lookupBinder :: Name -> DsM (Core TH.Name)
834 = do { mb_val <- dsLookupMetaEnv n;
836 Just (Bound x) -> return (coreVar x)
837 other -> pprPanic "Failed binder lookup:" (ppr n) }
839 -- Look up a name that is either locally bound or a global name
841 -- * If it is a global name, generate the "original name" representation (ie,
842 -- the <module>:<name> form) for the associated entity
844 lookupLOcc :: Located Name -> DsM (Core TH.Name)
845 -- Lookup an occurrence; it can't be a splice.
846 -- Use the in-scope bindings if they exist
847 lookupLOcc (L _ n) = lookupOcc n
849 lookupOcc :: Name -> DsM (Core TH.Name)
851 = do { mb_val <- dsLookupMetaEnv n ;
853 Nothing -> globalVar n
854 Just (Bound x) -> return (coreVar x)
855 Just (Splice _) -> pprPanic "repE:lookupOcc" (ppr n)
858 globalVar :: Name -> DsM (Core TH.Name)
859 -- Not bound by the meta-env
860 -- Could be top-level; or could be local
861 -- f x = $(g [| x |])
862 -- Here the x will be local
864 | isExternalName name
865 = do { MkC mod <- coreStringLit name_mod
866 ; MkC occ <- occNameLit name
867 ; rep2 mk_varg [mod,occ] }
869 = do { MkC occ <- occNameLit name
870 ; MkC uni <- coreIntLit (getKey (getUnique name))
871 ; rep2 mkNameUName [occ,uni] }
873 name_mod = moduleUserString (nameModule name)
874 name_occ = nameOccName name
875 mk_varg | OccName.isDataOcc name_occ = mkNameG_dName
876 | OccName.isVarOcc name_occ = mkNameG_vName
877 | OccName.isTcOcc name_occ = mkNameG_tcName
878 | otherwise = pprPanic "DsMeta.globalVar" (ppr name)
880 lookupType :: Name -- Name of type constructor (e.g. TH.ExpQ)
881 -> DsM Type -- The type
882 lookupType tc_name = do { tc <- dsLookupTyCon tc_name ;
883 return (mkGenTyConApp tc []) }
885 wrapGenSyns :: [GenSymBind]
886 -> Core (TH.Q a) -> DsM (Core (TH.Q a))
887 -- wrapGenSyns [(nm1,id1), (nm2,id2)] y
888 -- --> bindQ (gensym nm1) (\ id1 ->
889 -- bindQ (gensym nm2 (\ id2 ->
892 wrapGenSyns binds body@(MkC b)
893 = do { var_ty <- lookupType nameTyConName
896 [elt_ty] = tcTyConAppArgs (exprType b)
897 -- b :: Q a, so we can get the type 'a' by looking at the
898 -- argument type. NB: this relies on Q being a data/newtype,
899 -- not a type synonym
901 go var_ty [] = return body
902 go var_ty ((name,id) : binds)
903 = do { MkC body' <- go var_ty binds
904 ; lit_str <- occNameLit name
905 ; gensym_app <- repGensym lit_str
906 ; repBindQ var_ty elt_ty
907 gensym_app (MkC (Lam id body')) }
909 -- Just like wrapGenSym, but don't actually do the gensym
910 -- Instead use the existing name:
911 -- let x = "x" in ...
912 -- Only used for [Decl], and for the class ops in class
913 -- and instance decls
914 wrapNongenSyms :: [GenSymBind] -> Core a -> DsM (Core a)
915 wrapNongenSyms binds (MkC body)
916 = do { binds' <- mapM do_one binds ;
917 return (MkC (mkLets binds' body)) }
920 = do { MkC lit_str <- occNameLit name
921 ; MkC var <- rep2 mkNameName [lit_str]
922 ; return (NonRec id var) }
924 occNameLit :: Name -> DsM (Core String)
925 occNameLit n = coreStringLit (occNameUserString (nameOccName n))
928 -- %*********************************************************************
932 -- %*********************************************************************
934 -----------------------------------------------------------------------------
935 -- PHANTOM TYPES for consistency. In order to make sure we do this correct
936 -- we invent a new datatype which uses phantom types.
938 newtype Core a = MkC CoreExpr
941 rep2 :: Name -> [ CoreExpr ] -> DsM (Core a)
942 rep2 n xs = do { id <- dsLookupGlobalId n
943 ; return (MkC (foldl App (Var id) xs)) }
945 -- Then we make "repConstructors" which use the phantom types for each of the
946 -- smart constructors of the Meta.Meta datatypes.
949 -- %*********************************************************************
951 -- The 'smart constructors'
953 -- %*********************************************************************
955 --------------- Patterns -----------------
956 repPlit :: Core TH.Lit -> DsM (Core TH.Pat)
957 repPlit (MkC l) = rep2 litPName [l]
959 repPvar :: Core TH.Name -> DsM (Core TH.Pat)
960 repPvar (MkC s) = rep2 varPName [s]
962 repPtup :: Core [TH.Pat] -> DsM (Core TH.Pat)
963 repPtup (MkC ps) = rep2 tupPName [ps]
965 repPcon :: Core TH.Name -> Core [TH.Pat] -> DsM (Core TH.Pat)
966 repPcon (MkC s) (MkC ps) = rep2 conPName [s, ps]
968 repPrec :: Core TH.Name -> Core [(TH.Name,TH.Pat)] -> DsM (Core TH.Pat)
969 repPrec (MkC c) (MkC rps) = rep2 recPName [c,rps]
971 repPtilde :: Core TH.Pat -> DsM (Core TH.Pat)
972 repPtilde (MkC p) = rep2 tildePName [p]
974 repPaspat :: Core TH.Name -> Core TH.Pat -> DsM (Core TH.Pat)
975 repPaspat (MkC s) (MkC p) = rep2 asPName [s, p]
977 repPwild :: DsM (Core TH.Pat)
978 repPwild = rep2 wildPName []
980 repPlist :: Core [TH.Pat] -> DsM (Core TH.Pat)
981 repPlist (MkC ps) = rep2 listPName [ps]
983 --------------- Expressions -----------------
984 repVarOrCon :: Name -> Core TH.Name -> DsM (Core TH.ExpQ)
985 repVarOrCon vc str | isDataOcc (nameOccName vc) = repCon str
986 | otherwise = repVar str
988 repVar :: Core TH.Name -> DsM (Core TH.ExpQ)
989 repVar (MkC s) = rep2 varEName [s]
991 repCon :: Core TH.Name -> DsM (Core TH.ExpQ)
992 repCon (MkC s) = rep2 conEName [s]
994 repLit :: Core TH.Lit -> DsM (Core TH.ExpQ)
995 repLit (MkC c) = rep2 litEName [c]
997 repApp :: Core TH.ExpQ -> Core TH.ExpQ -> DsM (Core TH.ExpQ)
998 repApp (MkC x) (MkC y) = rep2 appEName [x,y]
1000 repLam :: Core [TH.Pat] -> Core TH.ExpQ -> DsM (Core TH.ExpQ)
1001 repLam (MkC ps) (MkC e) = rep2 lamEName [ps, e]
1003 repTup :: Core [TH.ExpQ] -> DsM (Core TH.ExpQ)
1004 repTup (MkC es) = rep2 tupEName [es]
1006 repCond :: Core TH.ExpQ -> Core TH.ExpQ -> Core TH.ExpQ -> DsM (Core TH.ExpQ)
1007 repCond (MkC x) (MkC y) (MkC z) = rep2 condEName [x,y,z]
1009 repLetE :: Core [TH.DecQ] -> Core TH.ExpQ -> DsM (Core TH.ExpQ)
1010 repLetE (MkC ds) (MkC e) = rep2 letEName [ds, e]
1012 repCaseE :: Core TH.ExpQ -> Core [TH.MatchQ] -> DsM( Core TH.ExpQ)
1013 repCaseE (MkC e) (MkC ms) = rep2 caseEName [e, ms]
1015 repDoE :: Core [TH.StmtQ] -> DsM (Core TH.ExpQ)
1016 repDoE (MkC ss) = rep2 doEName [ss]
1018 repComp :: Core [TH.StmtQ] -> DsM (Core TH.ExpQ)
1019 repComp (MkC ss) = rep2 compEName [ss]
1021 repListExp :: Core [TH.ExpQ] -> DsM (Core TH.ExpQ)
1022 repListExp (MkC es) = rep2 listEName [es]
1024 repSigExp :: Core TH.ExpQ -> Core TH.TypeQ -> DsM (Core TH.ExpQ)
1025 repSigExp (MkC e) (MkC t) = rep2 sigEName [e,t]
1027 repRecCon :: Core TH.Name -> Core [TH.FieldExp]-> DsM (Core TH.ExpQ)
1028 repRecCon (MkC c) (MkC fs) = rep2 recCName [c,fs]
1030 repRecUpd :: Core TH.ExpQ -> Core [TH.FieldExp] -> DsM (Core TH.ExpQ)
1031 repRecUpd (MkC e) (MkC fs) = rep2 recUpdEName [e,fs]
1033 repInfixApp :: Core TH.ExpQ -> Core TH.ExpQ -> Core TH.ExpQ -> DsM (Core TH.ExpQ)
1034 repInfixApp (MkC x) (MkC y) (MkC z) = rep2 infixAppName [x,y,z]
1036 repSectionL :: Core TH.ExpQ -> Core TH.ExpQ -> DsM (Core TH.ExpQ)
1037 repSectionL (MkC x) (MkC y) = rep2 sectionLName [x,y]
1039 repSectionR :: Core TH.ExpQ -> Core TH.ExpQ -> DsM (Core TH.ExpQ)
1040 repSectionR (MkC x) (MkC y) = rep2 sectionRName [x,y]
1042 ------------ Right hand sides (guarded expressions) ----
1043 repGuarded :: Core [(TH.ExpQ, TH.ExpQ)] -> DsM (Core TH.BodyQ)
1044 repGuarded (MkC pairs) = rep2 guardedBName [pairs]
1046 repNormal :: Core TH.ExpQ -> DsM (Core TH.BodyQ)
1047 repNormal (MkC e) = rep2 normalBName [e]
1049 ------------- Stmts -------------------
1050 repBindSt :: Core TH.Pat -> Core TH.ExpQ -> DsM (Core TH.StmtQ)
1051 repBindSt (MkC p) (MkC e) = rep2 bindSName [p,e]
1053 repLetSt :: Core [TH.DecQ] -> DsM (Core TH.StmtQ)
1054 repLetSt (MkC ds) = rep2 letSName [ds]
1056 repNoBindSt :: Core TH.ExpQ -> DsM (Core TH.StmtQ)
1057 repNoBindSt (MkC e) = rep2 noBindSName [e]
1059 -------------- Range (Arithmetic sequences) -----------
1060 repFrom :: Core TH.ExpQ -> DsM (Core TH.ExpQ)
1061 repFrom (MkC x) = rep2 fromEName [x]
1063 repFromThen :: Core TH.ExpQ -> Core TH.ExpQ -> DsM (Core TH.ExpQ)
1064 repFromThen (MkC x) (MkC y) = rep2 fromThenEName [x,y]
1066 repFromTo :: Core TH.ExpQ -> Core TH.ExpQ -> DsM (Core TH.ExpQ)
1067 repFromTo (MkC x) (MkC y) = rep2 fromToEName [x,y]
1069 repFromThenTo :: Core TH.ExpQ -> Core TH.ExpQ -> Core TH.ExpQ -> DsM (Core TH.ExpQ)
1070 repFromThenTo (MkC x) (MkC y) (MkC z) = rep2 fromThenToEName [x,y,z]
1072 ------------ Match and Clause Tuples -----------
1073 repMatch :: Core TH.Pat -> Core TH.BodyQ -> Core [TH.DecQ] -> DsM (Core TH.MatchQ)
1074 repMatch (MkC p) (MkC bod) (MkC ds) = rep2 matchName [p, bod, ds]
1076 repClause :: Core [TH.Pat] -> Core TH.BodyQ -> Core [TH.DecQ] -> DsM (Core TH.ClauseQ)
1077 repClause (MkC ps) (MkC bod) (MkC ds) = rep2 clauseName [ps, bod, ds]
1079 -------------- Dec -----------------------------
1080 repVal :: Core TH.Pat -> Core TH.BodyQ -> Core [TH.DecQ] -> DsM (Core TH.DecQ)
1081 repVal (MkC p) (MkC b) (MkC ds) = rep2 valDName [p, b, ds]
1083 repFun :: Core TH.Name -> Core [TH.ClauseQ] -> DsM (Core TH.DecQ)
1084 repFun (MkC nm) (MkC b) = rep2 funDName [nm, b]
1086 repData :: Core TH.CxtQ -> Core TH.Name -> Core [TH.Name] -> Core [TH.ConQ] -> Core [TH.Name] -> DsM (Core TH.DecQ)
1087 repData (MkC cxt) (MkC nm) (MkC tvs) (MkC cons) (MkC derivs)
1088 = rep2 dataDName [cxt, nm, tvs, cons, derivs]
1090 repNewtype :: Core TH.CxtQ -> Core TH.Name -> Core [TH.Name] -> Core TH.ConQ -> Core [TH.Name] -> DsM (Core TH.DecQ)
1091 repNewtype (MkC cxt) (MkC nm) (MkC tvs) (MkC con) (MkC derivs)
1092 = rep2 newtypeDName [cxt, nm, tvs, con, derivs]
1094 repTySyn :: Core TH.Name -> Core [TH.Name] -> Core TH.TypeQ -> DsM (Core TH.DecQ)
1095 repTySyn (MkC nm) (MkC tvs) (MkC rhs) = rep2 tySynDName [nm, tvs, rhs]
1097 repInst :: Core TH.CxtQ -> Core TH.TypeQ -> Core [TH.DecQ] -> DsM (Core TH.DecQ)
1098 repInst (MkC cxt) (MkC ty) (MkC ds) = rep2 instanceDName [cxt, ty, ds]
1100 repClass :: Core TH.CxtQ -> Core TH.Name -> Core [TH.Name] -> Core [TH.DecQ] -> DsM (Core TH.DecQ)
1101 repClass (MkC cxt) (MkC cls) (MkC tvs) (MkC ds) = rep2 classDName [cxt, cls, tvs, ds]
1103 repProto :: Core TH.Name -> Core TH.TypeQ -> DsM (Core TH.DecQ)
1104 repProto (MkC s) (MkC ty) = rep2 sigDName [s, ty]
1106 repCtxt :: Core [TH.TypeQ] -> DsM (Core TH.CxtQ)
1107 repCtxt (MkC tys) = rep2 cxtName [tys]
1109 repConstr :: Core TH.Name -> HsConDetails Name (LBangType Name)
1110 -> DsM (Core TH.ConQ)
1111 repConstr con (PrefixCon ps)
1112 = do arg_tys <- mapM repBangTy ps
1113 arg_tys1 <- coreList strictTypeQTyConName arg_tys
1114 rep2 normalCName [unC con, unC arg_tys1]
1115 repConstr con (RecCon ips)
1116 = do arg_vs <- mapM lookupLOcc (map fst ips)
1117 arg_tys <- mapM repBangTy (map snd ips)
1118 arg_vtys <- zipWithM (\x y -> rep2 varStrictTypeName [unC x, unC y])
1120 arg_vtys' <- coreList varStrictTypeQTyConName arg_vtys
1121 rep2 recCName [unC con, unC arg_vtys']
1122 repConstr con (InfixCon st1 st2)
1123 = do arg1 <- repBangTy st1
1124 arg2 <- repBangTy st2
1125 rep2 infixCName [unC arg1, unC con, unC arg2]
1127 ------------ Types -------------------
1129 repTForall :: Core [TH.Name] -> Core TH.CxtQ -> Core TH.TypeQ -> DsM (Core TH.TypeQ)
1130 repTForall (MkC tvars) (MkC ctxt) (MkC ty)
1131 = rep2 forallTName [tvars, ctxt, ty]
1133 repTvar :: Core TH.Name -> DsM (Core TH.TypeQ)
1134 repTvar (MkC s) = rep2 varTName [s]
1136 repTapp :: Core TH.TypeQ -> Core TH.TypeQ -> DsM (Core TH.TypeQ)
1137 repTapp (MkC t1) (MkC t2) = rep2 appTName [t1,t2]
1139 repTapps :: Core TH.TypeQ -> [Core TH.TypeQ] -> DsM (Core TH.TypeQ)
1140 repTapps f [] = return f
1141 repTapps f (t:ts) = do { f1 <- repTapp f t; repTapps f1 ts }
1143 --------- Type constructors --------------
1145 repNamedTyCon :: Core TH.Name -> DsM (Core TH.TypeQ)
1146 repNamedTyCon (MkC s) = rep2 conTName [s]
1148 repTupleTyCon :: Int -> DsM (Core TH.TypeQ)
1149 -- Note: not Core Int; it's easier to be direct here
1150 repTupleTyCon i = rep2 tupleTName [mkIntExpr (fromIntegral i)]
1152 repArrowTyCon :: DsM (Core TH.TypeQ)
1153 repArrowTyCon = rep2 arrowTName []
1155 repListTyCon :: DsM (Core TH.TypeQ)
1156 repListTyCon = rep2 listTName []
1159 ----------------------------------------------------------
1162 repLiteral :: HsLit -> DsM (Core TH.Lit)
1164 = do lit' <- case lit of
1165 HsIntPrim i -> mk_integer i
1166 HsInt i -> mk_integer i
1167 HsFloatPrim r -> mk_rational r
1168 HsDoublePrim r -> mk_rational r
1170 lit_expr <- dsLit lit'
1171 rep2 lit_name [lit_expr]
1173 lit_name = case lit of
1174 HsInteger _ _ -> integerLName
1175 HsInt _ -> integerLName
1176 HsIntPrim _ -> intPrimLName
1177 HsFloatPrim _ -> floatPrimLName
1178 HsDoublePrim _ -> doublePrimLName
1179 HsChar _ -> charLName
1180 HsString _ -> stringLName
1181 HsRat _ _ -> rationalLName
1183 uh_oh = pprPanic "DsMeta.repLiteral: trying to represent exotic literal"
1186 mk_integer i = do integer_ty <- lookupType integerTyConName
1187 return $ HsInteger i integer_ty
1188 mk_rational r = do rat_ty <- lookupType rationalTyConName
1189 return $ HsRat r rat_ty
1191 repOverloadedLiteral :: HsOverLit -> DsM (Core TH.Lit)
1192 repOverloadedLiteral (HsIntegral i _) = do { lit <- mk_integer i; repLiteral lit }
1193 repOverloadedLiteral (HsFractional f _) = do { lit <- mk_rational f; repLiteral lit }
1194 -- The type Rational will be in the environment, becuase
1195 -- the smart constructor 'TH.Syntax.rationalL' uses it in its type,
1196 -- and rationalL is sucked in when any TH stuff is used
1198 --------------- Miscellaneous -------------------
1200 repGensym :: Core String -> DsM (Core (TH.Q TH.Name))
1201 repGensym (MkC lit_str) = rep2 newNameName [lit_str]
1203 repBindQ :: Type -> Type -- a and b
1204 -> Core (TH.Q a) -> Core (a -> TH.Q b) -> DsM (Core (TH.Q b))
1205 repBindQ ty_a ty_b (MkC x) (MkC y)
1206 = rep2 bindQName [Type ty_a, Type ty_b, x, y]
1208 repSequenceQ :: Type -> Core [TH.Q a] -> DsM (Core (TH.Q [a]))
1209 repSequenceQ ty_a (MkC list)
1210 = rep2 sequenceQName [Type ty_a, list]
1212 ------------ Lists and Tuples -------------------
1213 -- turn a list of patterns into a single pattern matching a list
1215 coreList :: Name -- Of the TyCon of the element type
1216 -> [Core a] -> DsM (Core [a])
1218 = do { elt_ty <- lookupType tc_name; return (coreList' elt_ty es) }
1220 coreList' :: Type -- The element type
1221 -> [Core a] -> Core [a]
1222 coreList' elt_ty es = MkC (mkListExpr elt_ty (map unC es ))
1224 nonEmptyCoreList :: [Core a] -> Core [a]
1225 -- The list must be non-empty so we can get the element type
1226 -- Otherwise use coreList
1227 nonEmptyCoreList [] = panic "coreList: empty argument"
1228 nonEmptyCoreList xs@(MkC x:_) = MkC (mkListExpr (exprType x) (map unC xs))
1230 corePair :: (Core a, Core b) -> Core (a,b)
1231 corePair (MkC x, MkC y) = MkC (mkCoreTup [x,y])
1233 coreStringLit :: String -> DsM (Core String)
1234 coreStringLit s = do { z <- mkStringLit s; return(MkC z) }
1236 coreIntLit :: Int -> DsM (Core Int)
1237 coreIntLit i = return (MkC (mkIntExpr (fromIntegral i)))
1239 coreVar :: Id -> Core TH.Name -- The Id has type Name
1240 coreVar id = MkC (Var id)
1244 -- %************************************************************************
1246 -- The known-key names for Template Haskell
1248 -- %************************************************************************
1250 -- To add a name, do three things
1252 -- 1) Allocate a key
1254 -- 3) Add the name to knownKeyNames
1256 templateHaskellNames :: [Name]
1257 -- The names that are implicitly mentioned by ``bracket''
1258 -- Should stay in sync with the import list of DsMeta
1260 templateHaskellNames = [
1261 returnQName, bindQName, sequenceQName, newNameName, liftName,
1262 mkNameName, mkNameG_vName, mkNameG_dName, mkNameG_tcName, mkNameUName,
1265 charLName, stringLName, integerLName, intPrimLName,
1266 floatPrimLName, doublePrimLName, rationalLName,
1268 litPName, varPName, tupPName, conPName, tildePName,
1269 asPName, wildPName, recPName, listPName,
1277 varEName, conEName, litEName, appEName, infixEName,
1278 infixAppName, sectionLName, sectionRName, lamEName, tupEName,
1279 condEName, letEName, caseEName, doEName, compEName,
1280 fromEName, fromThenEName, fromToEName, fromThenToEName,
1281 listEName, sigEName, recConEName, recUpdEName,
1285 guardedBName, normalBName,
1287 bindSName, letSName, noBindSName, parSName,
1289 funDName, valDName, dataDName, newtypeDName, tySynDName,
1290 classDName, instanceDName, sigDName, forImpDName,
1294 isStrictName, notStrictName,
1296 normalCName, recCName, infixCName,
1302 forallTName, varTName, conTName, appTName,
1303 tupleTName, arrowTName, listTName,
1305 cCallName, stdCallName,
1312 qTyConName, nameTyConName, patTyConName, fieldPatTyConName, matchQTyConName,
1313 clauseQTyConName, expQTyConName, fieldExpTyConName, stmtQTyConName,
1314 decQTyConName, conQTyConName, strictTypeQTyConName,
1315 varStrictTypeQTyConName, typeQTyConName, expTyConName, decTyConName,
1316 typeTyConName, matchTyConName, clauseTyConName]
1318 tH_SYN_Name = mkModuleName "Language.Haskell.TH.Syntax"
1319 tH_LIB_Name = mkModuleName "Language.Haskell.TH.Lib"
1322 -- NB: the TH.Syntax module comes from the "template-haskell" package
1323 thSyn = mkModule thPackage tH_SYN_Name
1324 thLib = mkModule thPackage tH_LIB_Name
1326 mk_known_key_name mod space str uniq
1327 = mkExternalName uniq mod (mkOccFS space str)
1330 libFun = mk_known_key_name thLib OccName.varName
1331 libTc = mk_known_key_name thLib OccName.tcName
1332 thFun = mk_known_key_name thSyn OccName.varName
1333 thTc = mk_known_key_name thSyn OccName.tcName
1335 -------------------- TH.Syntax -----------------------
1336 qTyConName = thTc FSLIT("Q") qTyConKey
1337 nameTyConName = thTc FSLIT("Name") nameTyConKey
1338 fieldExpTyConName = thTc FSLIT("FieldExp") fieldExpTyConKey
1339 patTyConName = thTc FSLIT("Pat") patTyConKey
1340 fieldPatTyConName = thTc FSLIT("FieldPat") fieldPatTyConKey
1341 expTyConName = thTc FSLIT("Exp") expTyConKey
1342 decTyConName = thTc FSLIT("Dec") decTyConKey
1343 typeTyConName = thTc FSLIT("Type") typeTyConKey
1344 matchTyConName = thTc FSLIT("Match") matchTyConKey
1345 clauseTyConName = thTc FSLIT("Clause") clauseTyConKey
1347 returnQName = thFun FSLIT("returnQ") returnQIdKey
1348 bindQName = thFun FSLIT("bindQ") bindQIdKey
1349 sequenceQName = thFun FSLIT("sequenceQ") sequenceQIdKey
1350 newNameName = thFun FSLIT("newName") newNameIdKey
1351 liftName = thFun FSLIT("lift") liftIdKey
1352 mkNameName = thFun FSLIT("mkName") mkNameIdKey
1353 mkNameG_vName = thFun FSLIT("mkNameG_v") mkNameG_vIdKey
1354 mkNameG_dName = thFun FSLIT("mkNameG_d") mkNameG_dIdKey
1355 mkNameG_tcName = thFun FSLIT("mkNameG_tc") mkNameG_tcIdKey
1356 mkNameUName = thFun FSLIT("mkNameU") mkNameUIdKey
1359 -------------------- TH.Lib -----------------------
1361 charLName = libFun FSLIT("charL") charLIdKey
1362 stringLName = libFun FSLIT("stringL") stringLIdKey
1363 integerLName = libFun FSLIT("integerL") integerLIdKey
1364 intPrimLName = libFun FSLIT("intPrimL") intPrimLIdKey
1365 floatPrimLName = libFun FSLIT("floatPrimL") floatPrimLIdKey
1366 doublePrimLName = libFun FSLIT("doublePrimL") doublePrimLIdKey
1367 rationalLName = libFun FSLIT("rationalL") rationalLIdKey
1370 litPName = libFun FSLIT("litP") litPIdKey
1371 varPName = libFun FSLIT("varP") varPIdKey
1372 tupPName = libFun FSLIT("tupP") tupPIdKey
1373 conPName = libFun FSLIT("conP") conPIdKey
1374 tildePName = libFun FSLIT("tildeP") tildePIdKey
1375 asPName = libFun FSLIT("asP") asPIdKey
1376 wildPName = libFun FSLIT("wildP") wildPIdKey
1377 recPName = libFun FSLIT("recP") recPIdKey
1378 listPName = libFun FSLIT("listP") listPIdKey
1380 -- type FieldPat = ...
1381 fieldPatName = libFun FSLIT("fieldPat") fieldPatIdKey
1384 matchName = libFun FSLIT("match") matchIdKey
1386 -- data Clause = ...
1387 clauseName = libFun FSLIT("clause") clauseIdKey
1390 varEName = libFun FSLIT("varE") varEIdKey
1391 conEName = libFun FSLIT("conE") conEIdKey
1392 litEName = libFun FSLIT("litE") litEIdKey
1393 appEName = libFun FSLIT("appE") appEIdKey
1394 infixEName = libFun FSLIT("infixE") infixEIdKey
1395 infixAppName = libFun FSLIT("infixApp") infixAppIdKey
1396 sectionLName = libFun FSLIT("sectionL") sectionLIdKey
1397 sectionRName = libFun FSLIT("sectionR") sectionRIdKey
1398 lamEName = libFun FSLIT("lamE") lamEIdKey
1399 tupEName = libFun FSLIT("tupE") tupEIdKey
1400 condEName = libFun FSLIT("condE") condEIdKey
1401 letEName = libFun FSLIT("letE") letEIdKey
1402 caseEName = libFun FSLIT("caseE") caseEIdKey
1403 doEName = libFun FSLIT("doE") doEIdKey
1404 compEName = libFun FSLIT("compE") compEIdKey
1405 -- ArithSeq skips a level
1406 fromEName = libFun FSLIT("fromE") fromEIdKey
1407 fromThenEName = libFun FSLIT("fromThenE") fromThenEIdKey
1408 fromToEName = libFun FSLIT("fromToE") fromToEIdKey
1409 fromThenToEName = libFun FSLIT("fromThenToE") fromThenToEIdKey
1411 listEName = libFun FSLIT("listE") listEIdKey
1412 sigEName = libFun FSLIT("sigE") sigEIdKey
1413 recConEName = libFun FSLIT("recConE") recConEIdKey
1414 recUpdEName = libFun FSLIT("recUpdE") recUpdEIdKey
1416 -- type FieldExp = ...
1417 fieldExpName = libFun FSLIT("fieldExp") fieldExpIdKey
1420 guardedBName = libFun FSLIT("guardedB") guardedBIdKey
1421 normalBName = libFun FSLIT("normalB") normalBIdKey
1424 bindSName = libFun FSLIT("bindS") bindSIdKey
1425 letSName = libFun FSLIT("letS") letSIdKey
1426 noBindSName = libFun FSLIT("noBindS") noBindSIdKey
1427 parSName = libFun FSLIT("parS") parSIdKey
1430 funDName = libFun FSLIT("funD") funDIdKey
1431 valDName = libFun FSLIT("valD") valDIdKey
1432 dataDName = libFun FSLIT("dataD") dataDIdKey
1433 newtypeDName = libFun FSLIT("newtypeD") newtypeDIdKey
1434 tySynDName = libFun FSLIT("tySynD") tySynDIdKey
1435 classDName = libFun FSLIT("classD") classDIdKey
1436 instanceDName = libFun FSLIT("instanceD") instanceDIdKey
1437 sigDName = libFun FSLIT("sigD") sigDIdKey
1438 forImpDName = libFun FSLIT("forImpD") forImpDIdKey
1441 cxtName = libFun FSLIT("cxt") cxtIdKey
1443 -- data Strict = ...
1444 isStrictName = libFun FSLIT("isStrict") isStrictKey
1445 notStrictName = libFun FSLIT("notStrict") notStrictKey
1448 normalCName = libFun FSLIT("normalC") normalCIdKey
1449 recCName = libFun FSLIT("recC") recCIdKey
1450 infixCName = libFun FSLIT("infixC") infixCIdKey
1452 -- type StrictType = ...
1453 strictTypeName = libFun FSLIT("strictType") strictTKey
1455 -- type VarStrictType = ...
1456 varStrictTypeName = libFun FSLIT("varStrictType") varStrictTKey
1459 forallTName = libFun FSLIT("forallT") forallTIdKey
1460 varTName = libFun FSLIT("varT") varTIdKey
1461 conTName = libFun FSLIT("conT") conTIdKey
1462 tupleTName = libFun FSLIT("tupleT") tupleTIdKey
1463 arrowTName = libFun FSLIT("arrowT") arrowTIdKey
1464 listTName = libFun FSLIT("listT") listTIdKey
1465 appTName = libFun FSLIT("appT") appTIdKey
1467 -- data Callconv = ...
1468 cCallName = libFun FSLIT("cCall") cCallIdKey
1469 stdCallName = libFun FSLIT("stdCall") stdCallIdKey
1471 -- data Safety = ...
1472 unsafeName = libFun FSLIT("unsafe") unsafeIdKey
1473 safeName = libFun FSLIT("safe") safeIdKey
1474 threadsafeName = libFun FSLIT("threadsafe") threadsafeIdKey
1476 matchQTyConName = libTc FSLIT("MatchQ") matchQTyConKey
1477 clauseQTyConName = libTc FSLIT("ClauseQ") clauseQTyConKey
1478 expQTyConName = libTc FSLIT("ExpQ") expQTyConKey
1479 stmtQTyConName = libTc FSLIT("StmtQ") stmtQTyConKey
1480 decQTyConName = libTc FSLIT("DecQ") decQTyConKey
1481 conQTyConName = libTc FSLIT("ConQ") conQTyConKey
1482 strictTypeQTyConName = libTc FSLIT("StrictTypeQ") strictTypeQTyConKey
1483 varStrictTypeQTyConName = libTc FSLIT("VarStrictTypeQ") varStrictTypeQTyConKey
1484 typeQTyConName = libTc FSLIT("TypeQ") typeQTyConKey
1486 -- TyConUniques available: 100-119
1487 -- Check in PrelNames if you want to change this
1489 expTyConKey = mkPreludeTyConUnique 100
1490 matchTyConKey = mkPreludeTyConUnique 101
1491 clauseTyConKey = mkPreludeTyConUnique 102
1492 qTyConKey = mkPreludeTyConUnique 103
1493 expQTyConKey = mkPreludeTyConUnique 104
1494 decQTyConKey = mkPreludeTyConUnique 105
1495 patTyConKey = mkPreludeTyConUnique 106
1496 matchQTyConKey = mkPreludeTyConUnique 107
1497 clauseQTyConKey = mkPreludeTyConUnique 108
1498 stmtQTyConKey = mkPreludeTyConUnique 109
1499 conQTyConKey = mkPreludeTyConUnique 110
1500 typeQTyConKey = mkPreludeTyConUnique 111
1501 typeTyConKey = mkPreludeTyConUnique 112
1502 decTyConKey = mkPreludeTyConUnique 113
1503 varStrictTypeQTyConKey = mkPreludeTyConUnique 114
1504 strictTypeQTyConKey = mkPreludeTyConUnique 115
1505 fieldExpTyConKey = mkPreludeTyConUnique 116
1506 fieldPatTyConKey = mkPreludeTyConUnique 117
1507 nameTyConKey = mkPreludeTyConUnique 118
1509 -- IdUniques available: 200-399
1510 -- If you want to change this, make sure you check in PrelNames
1512 returnQIdKey = mkPreludeMiscIdUnique 200
1513 bindQIdKey = mkPreludeMiscIdUnique 201
1514 sequenceQIdKey = mkPreludeMiscIdUnique 202
1515 liftIdKey = mkPreludeMiscIdUnique 203
1516 newNameIdKey = mkPreludeMiscIdUnique 204
1517 mkNameIdKey = mkPreludeMiscIdUnique 205
1518 mkNameG_vIdKey = mkPreludeMiscIdUnique 206
1519 mkNameG_dIdKey = mkPreludeMiscIdUnique 207
1520 mkNameG_tcIdKey = mkPreludeMiscIdUnique 208
1521 mkNameUIdKey = mkPreludeMiscIdUnique 209
1525 charLIdKey = mkPreludeMiscIdUnique 210
1526 stringLIdKey = mkPreludeMiscIdUnique 211
1527 integerLIdKey = mkPreludeMiscIdUnique 212
1528 intPrimLIdKey = mkPreludeMiscIdUnique 213
1529 floatPrimLIdKey = mkPreludeMiscIdUnique 214
1530 doublePrimLIdKey = mkPreludeMiscIdUnique 215
1531 rationalLIdKey = mkPreludeMiscIdUnique 216
1534 litPIdKey = mkPreludeMiscIdUnique 220
1535 varPIdKey = mkPreludeMiscIdUnique 221
1536 tupPIdKey = mkPreludeMiscIdUnique 222
1537 conPIdKey = mkPreludeMiscIdUnique 223
1538 tildePIdKey = mkPreludeMiscIdUnique 224
1539 asPIdKey = mkPreludeMiscIdUnique 225
1540 wildPIdKey = mkPreludeMiscIdUnique 226
1541 recPIdKey = mkPreludeMiscIdUnique 227
1542 listPIdKey = mkPreludeMiscIdUnique 228
1544 -- type FieldPat = ...
1545 fieldPatIdKey = mkPreludeMiscIdUnique 230
1548 matchIdKey = mkPreludeMiscIdUnique 231
1550 -- data Clause = ...
1551 clauseIdKey = mkPreludeMiscIdUnique 232
1554 varEIdKey = mkPreludeMiscIdUnique 240
1555 conEIdKey = mkPreludeMiscIdUnique 241
1556 litEIdKey = mkPreludeMiscIdUnique 242
1557 appEIdKey = mkPreludeMiscIdUnique 243
1558 infixEIdKey = mkPreludeMiscIdUnique 244
1559 infixAppIdKey = mkPreludeMiscIdUnique 245
1560 sectionLIdKey = mkPreludeMiscIdUnique 246
1561 sectionRIdKey = mkPreludeMiscIdUnique 247
1562 lamEIdKey = mkPreludeMiscIdUnique 248
1563 tupEIdKey = mkPreludeMiscIdUnique 249
1564 condEIdKey = mkPreludeMiscIdUnique 250
1565 letEIdKey = mkPreludeMiscIdUnique 251
1566 caseEIdKey = mkPreludeMiscIdUnique 252
1567 doEIdKey = mkPreludeMiscIdUnique 253
1568 compEIdKey = mkPreludeMiscIdUnique 254
1569 fromEIdKey = mkPreludeMiscIdUnique 255
1570 fromThenEIdKey = mkPreludeMiscIdUnique 256
1571 fromToEIdKey = mkPreludeMiscIdUnique 257
1572 fromThenToEIdKey = mkPreludeMiscIdUnique 258
1573 listEIdKey = mkPreludeMiscIdUnique 259
1574 sigEIdKey = mkPreludeMiscIdUnique 260
1575 recConEIdKey = mkPreludeMiscIdUnique 261
1576 recUpdEIdKey = mkPreludeMiscIdUnique 262
1578 -- type FieldExp = ...
1579 fieldExpIdKey = mkPreludeMiscIdUnique 265
1582 guardedBIdKey = mkPreludeMiscIdUnique 266
1583 normalBIdKey = mkPreludeMiscIdUnique 267
1586 bindSIdKey = mkPreludeMiscIdUnique 268
1587 letSIdKey = mkPreludeMiscIdUnique 269
1588 noBindSIdKey = mkPreludeMiscIdUnique 270
1589 parSIdKey = mkPreludeMiscIdUnique 271
1592 funDIdKey = mkPreludeMiscIdUnique 272
1593 valDIdKey = mkPreludeMiscIdUnique 273
1594 dataDIdKey = mkPreludeMiscIdUnique 274
1595 newtypeDIdKey = mkPreludeMiscIdUnique 275
1596 tySynDIdKey = mkPreludeMiscIdUnique 276
1597 classDIdKey = mkPreludeMiscIdUnique 277
1598 instanceDIdKey = mkPreludeMiscIdUnique 278
1599 sigDIdKey = mkPreludeMiscIdUnique 279
1600 forImpDIdKey = mkPreludeMiscIdUnique 297
1603 cxtIdKey = mkPreludeMiscIdUnique 280
1605 -- data Strict = ...
1606 isStrictKey = mkPreludeMiscIdUnique 281
1607 notStrictKey = mkPreludeMiscIdUnique 282
1610 normalCIdKey = mkPreludeMiscIdUnique 283
1611 recCIdKey = mkPreludeMiscIdUnique 284
1612 infixCIdKey = mkPreludeMiscIdUnique 285
1614 -- type StrictType = ...
1615 strictTKey = mkPreludeMiscIdUnique 286
1617 -- type VarStrictType = ...
1618 varStrictTKey = mkPreludeMiscIdUnique 287
1621 forallTIdKey = mkPreludeMiscIdUnique 290
1622 varTIdKey = mkPreludeMiscIdUnique 291
1623 conTIdKey = mkPreludeMiscIdUnique 292
1624 tupleTIdKey = mkPreludeMiscIdUnique 294
1625 arrowTIdKey = mkPreludeMiscIdUnique 295
1626 listTIdKey = mkPreludeMiscIdUnique 296
1627 appTIdKey = mkPreludeMiscIdUnique 293
1629 -- data Callconv = ...
1630 cCallIdKey = mkPreludeMiscIdUnique 300
1631 stdCallIdKey = mkPreludeMiscIdUnique 301
1633 -- data Safety = ...
1634 unsafeIdKey = mkPreludeMiscIdUnique 305
1635 safeIdKey = mkPreludeMiscIdUnique 306
1636 threadsafeIdKey = mkPreludeMiscIdUnique 307