2 % (c) The GRASP/AQUA Project, Glasgow University, 1992-1998
4 \section[PrelInfo]{The @PrelInfo@ interface to the compiler's prelude knowledge}
11 wiredInThings, basicKnownKeyNames,
14 -- Random other things
15 maybeCharLikeCon, maybeIntLikeCon,
18 isNumericClass, isStandardClass
22 #include "HsVersions.h"
24 import PrelNames ( basicKnownKeyNames,
25 hasKey, charDataConKey, intDataConKey,
26 numericClassKeys, standardClassKeys )
28 import PrimOp ( PrimOp, allThePrimOps, primOpOcc, primOpTag, maxPrimOpTag )
29 import DataCon ( DataCon )
30 import Id ( Id, idName )
31 import MkId ( mkPrimOpId, wiredInIds )
32 import MkId -- All of it, for re-export
33 import Name ( nameOccName )
34 import TysPrim ( primTyCons )
35 import TysWiredIn ( wiredInTyCons )
36 import HscTypes ( TyThing(..), implicitTyThings, GenAvailInfo(..), RdrAvailInfo )
37 import Class ( Class, classKey )
38 import Type ( funTyCon )
39 import TyCon ( tyConName )
42 import Array ( Array, array, (!) )
45 %************************************************************************
47 \subsection[builtinNameInfo]{Lookup built-in names}
49 %************************************************************************
51 We have two ``builtin name funs,'' one to look up @TyCons@ and
52 @Classes@, the other to look up values.
55 wiredInThings :: [TyThing]
58 [ -- Wired in TyCons and their implicit Ids
60 , concatMap implicitTyThings tycon_things
66 , map (AnId . mkPrimOpId) allThePrimOps
69 tycon_things = map ATyCon ([funTyCon] ++ primTyCons ++ wiredInTyCons)
72 We let a lot of "non-standard" values be visible, so that we can make
73 sense of them in interface pragmas. It's cool, though they all have
74 "non-standard" names, so they won't get past the parser in user code.
76 %************************************************************************
80 %************************************************************************
83 primOpIds :: Array Int Id -- Indexed by PrimOp tag
84 primOpIds = array (1,maxPrimOpTag) [ (primOpTag op, mkPrimOpId op)
85 | op <- allThePrimOps]
87 primOpId :: PrimOp -> Id
88 primOpId op = primOpIds ! primOpTag op
92 %************************************************************************
94 \subsection{Export lists for pseudo-modules (GHC.Prim)}
96 %************************************************************************
98 GHC.Prim "exports" all the primops and primitive types, some
102 ghcPrimExports :: [RdrAvailInfo]
104 = map (Avail . nameOccName . idName) ghcPrimIds ++
105 map (Avail . primOpOcc) allThePrimOps ++
106 [ AvailTC occ [occ] |
107 n <- funTyCon : primTyCons, let occ = nameOccName (tyConName n)
112 %************************************************************************
114 \subsection{Built-in keys}
116 %************************************************************************
118 ToDo: make it do the ``like'' part properly (as in 0.26 and before).
121 maybeCharLikeCon, maybeIntLikeCon :: DataCon -> Bool
122 maybeCharLikeCon con = con `hasKey` charDataConKey
123 maybeIntLikeCon con = con `hasKey` intDataConKey
127 %************************************************************************
129 \subsection{Class predicates}
131 %************************************************************************
134 isNumericClass, isStandardClass :: Class -> Bool
136 isNumericClass clas = classKey clas `is_elem` numericClassKeys
137 isStandardClass clas = classKey clas `is_elem` standardClassKeys
138 is_elem = isIn "is_X_Class"