2 % (c) The GRASP/AQUA Project, Glasgow University, 1992-1996
4 \section[PrelInfo]{The @PrelInfo@ interface to the compiler's prelude knowledge}
7 #include "HsVersions.h"
11 -- finite maps for built-in things (for the renamer and typechecker):
12 builtinNameInfo, BuiltinNames(..),
13 BuiltinKeys(..), BuiltinIdInfos(..),
15 maybeCharLikeTyCon, maybeIntLikeTyCon
19 IMPORT_DELOOPER(PrelLoop) ( primOpNameInfo )
22 import PrelMods -- Prelude module names
23 import PrelVals -- VALUES
24 import PrimOp ( PrimOp(..), allThePrimOps )
25 import PrimRep ( PrimRep(..) )
26 import TysPrim -- TYPES
30 import CmdLineOpts ( opt_HideBuiltinNames,
31 opt_HideMostBuiltinNames,
34 import FiniteMap ( FiniteMap, emptyFM, listToFM )
35 import Id ( mkTupleCon, GenId, Id(..) )
36 import Maybes ( catMaybes )
37 import Name ( moduleNamePair )
38 import RnHsSyn ( RnName(..) )
39 import TyCon ( tyConDataCons, mkFunTyCon, mkTupleTyCon, TyCon )
41 import UniqFM ( UniqFM, emptyUFM, listToUFM )
42 import Unique -- *Key stuff
43 import Util ( nOfThem, panic )
46 %************************************************************************
48 \subsection[builtinNameInfo]{Lookup built-in names}
50 %************************************************************************
52 We have two ``builtin name funs,'' one to look up @TyCons@ and
53 @Classes@, the other to look up values.
56 builtinNameInfo :: ( BuiltinNames, BuiltinKeys, BuiltinIdInfos )
58 type BuiltinNames = (FiniteMap (FAST_STRING,Module) RnName, -- WiredIn Ids
59 FiniteMap (FAST_STRING,Module) RnName) -- WiredIn TyCons
60 -- Two maps because "[]" is in both...
62 type BuiltinKeys = FiniteMap (FAST_STRING,Module) (Unique, Name -> RnName)
63 -- Names with known uniques
65 type BuiltinIdInfos = UniqFM IdInfo -- Info for known unique Ids
68 = if opt_HideBuiltinNames then
74 else if opt_HideMostBuiltinNames then
76 (listToFM min_assoc_val_wired, listToFM min_assoc_tc_wired),
82 (listToFM assoc_val_wired, listToFM assoc_tc_wired),
84 listToUFM assoc_id_infos
88 min_assoc_val_wired -- min needed when compiling bits of Prelude
91 concat (map pcDataConWiredInInfo g_con_tycons),
92 concat (map pcDataConWiredInInfo min_nonprim_tycon_list),
95 map pcIdWiredInInfo wired_in_ids,
101 map pcTyConWiredInInfo prim_tycons,
102 map pcTyConWiredInInfo g_tycons,
103 map pcTyConWiredInInfo min_nonprim_tycon_list
109 concat (map pcDataConWiredInInfo g_con_tycons),
110 concat (map pcDataConWiredInInfo data_tycons),
113 map pcIdWiredInInfo wired_in_ids,
114 map pcIdWiredInInfo parallel_ids,
120 map pcTyConWiredInInfo prim_tycons,
121 map pcTyConWiredInInfo g_tycons,
122 map pcTyConWiredInInfo data_tycons
134 id_keys = map id_key id_keys_infos
135 id_key (str_mod, uniq, info) = (str_mod, (uniq, RnImplicit))
137 assoc_id_infos = catMaybes (map assoc_info id_keys_infos)
138 assoc_info (str_mod, uniq, Just info) = Just (uniq, info)
139 assoc_info (str_mod, uniq, Nothing) = Nothing
143 We let a lot of "non-standard" values be visible, so that we can make
144 sense of them in interface pragmas. It's cool, though they all have
145 "non-standard" names, so they won't get past the parser in user code.
147 The WiredIn TyCons and DataCons ...
158 , foreignObjPrimTyCon
159 , mutableArrayPrimTyCon
160 , mutableByteArrayPrimTyCon
169 = mkFunTyCon : g_con_tycons
172 = listTyCon : mkTupleTyCon 0 : [mkTupleTyCon i | i <- [2..32] ]
174 min_nonprim_tycon_list -- used w/ HideMostBuiltinNames
182 , return2GMPsTyCon -- ADR asked for these last two (WDP 94/11)
183 , returnIntAndGMPTyCon
199 , returnIntAndGMPTyCon
202 , stateAndAddrPrimTyCon
203 , stateAndArrayPrimTyCon
204 , stateAndByteArrayPrimTyCon
205 , stateAndCharPrimTyCon
206 , stateAndDoublePrimTyCon
207 , stateAndFloatPrimTyCon
208 , stateAndForeignObjPrimTyCon
209 , stateAndIntPrimTyCon
210 , stateAndMutableArrayPrimTyCon
211 , stateAndMutableByteArrayPrimTyCon
212 , stateAndPtrPrimTyCon
213 , stateAndStablePtrPrimTyCon
214 , stateAndSynchVarPrimTyCon
215 , stateAndWordPrimTyCon
222 ToDo: Some of these should be moved to id_keys_infos!
226 , pAT_ERROR_ID -- occurs in i/faces
227 , pAR_ERROR_ID -- ditto
234 -- foldr/build Ids have magic unfoldings
239 , unpackCStringAppendId
240 , unpackCStringFoldrId
244 = if not opt_ForConcurrent then
260 pcTyConWiredInInfo :: TyCon -> ((FAST_STRING,Module), RnName)
261 pcTyConWiredInInfo tc = (swap (moduleNamePair tc), WiredInTyCon tc)
263 pcDataConWiredInInfo :: TyCon -> [((FAST_STRING,Module), RnName)]
264 pcDataConWiredInInfo tycon
265 = [ (swap (moduleNamePair con), WiredInId con) | con <- tyConDataCons tycon ]
267 pcIdWiredInInfo :: Id -> ((FAST_STRING,Module), RnName)
268 pcIdWiredInInfo id = (swap (moduleNamePair id), WiredInId id)
273 WiredIn primitive numeric operations ...
276 = map prim_fn allThePrimOps ++ map funny_fn funny_name_primops
278 prim_fn op = case (primOpNameInfo op) of (s,n) -> ((s,pRELUDE),n)
279 funny_fn (op,s) = case (primOpNameInfo op) of (_,n) -> ((s,pRELUDE),n)
282 = [ (IntAddOp, SLIT("+#"))
283 , (IntSubOp, SLIT("-#"))
284 , (IntMulOp, SLIT("*#"))
285 , (IntGtOp, SLIT(">#"))
286 , (IntGeOp, SLIT(">=#"))
287 , (IntEqOp, SLIT("==#"))
288 , (IntNeOp, SLIT("/=#"))
289 , (IntLtOp, SLIT("<#"))
290 , (IntLeOp, SLIT("<=#"))
291 , (DoubleAddOp, SLIT("+##"))
292 , (DoubleSubOp, SLIT("-##"))
293 , (DoubleMulOp, SLIT("*##"))
294 , (DoubleDivOp, SLIT("/##"))
295 , (DoublePowerOp, SLIT("**##"))
296 , (DoubleGtOp, SLIT(">##"))
297 , (DoubleGeOp, SLIT(">=##"))
298 , (DoubleEqOp, SLIT("==##"))
299 , (DoubleNeOp, SLIT("/=##"))
300 , (DoubleLtOp, SLIT("<##"))
301 , (DoubleLeOp, SLIT("<=##"))
306 Ids, Synonyms, Classes and ClassOps with builtin keys.
307 For the Ids we may also have some builtin IdInfo.
309 id_keys_infos :: [((FAST_STRING,Module), Unique, Maybe IdInfo)]
311 = [ -- here so we can check the type of main/mainPrimIO
312 ((SLIT("main"),SLIT("Main")), mainIdKey, Nothing)
313 , ((SLIT("mainPrimIO"),SLIT("Main")), mainPrimIOIdKey, Nothing)
315 -- here because we use them in derived instances
316 , ((SLIT("&&"), pRELUDE), andandIdKey, Nothing)
317 , ((SLIT("."), pRELUDE), composeIdKey, Nothing)
318 , ((SLIT("lex"), pRELUDE), lexIdKey, Nothing)
319 , ((SLIT("not"), pRELUDE), notIdKey, Nothing)
320 , ((SLIT("readParen"), pRELUDE), readParenIdKey, Nothing)
321 , ((SLIT("showParen"), pRELUDE), showParenIdKey, Nothing)
322 , ((SLIT("showString"), pRELUDE), showStringIdKey,Nothing)
323 , ((SLIT("__readList"), pRELUDE), ureadListIdKey, Nothing)
324 , ((SLIT("__showList"), pRELUDE), ushowListIdKey, Nothing)
325 , ((SLIT("__showSpace"), pRELUDE), showSpaceIdKey, Nothing)
329 = [ ((SLIT("IO"),pRELUDE), (iOTyConKey, RnImplicitTyCon))
330 , ((SLIT("Rational"),rATIO), (rationalTyConKey, RnImplicitTyCon))
331 , ((SLIT("Ratio"),rATIO), (ratioTyConKey, RnImplicitTyCon))
332 , ((SLIT("Ordering"),pRELUDE), (orderingTyConKey, RnImplicitTyCon))
335 -- this "class_keys" list *must* include:
336 -- classes that are grabbed by key (e.g., eqClassKey)
337 -- classes in "Class.standardClassKeys" (quite a few)
340 = [ (str_mod, (k, RnImplicitClass)) | (str_mod,k) <-
341 [ ((SLIT("Eq"),pRELUDE), eqClassKey) -- mentioned, derivable
342 , ((SLIT("Eval"),pRELUDE), evalClassKey) -- mentioned
343 , ((SLIT("Ord"),pRELUDE), ordClassKey) -- derivable
344 , ((SLIT("Num"),pRELUDE), numClassKey) -- mentioned, numeric
345 , ((SLIT("Real"),pRELUDE), realClassKey) -- numeric
346 , ((SLIT("Integral"),pRELUDE), integralClassKey) -- numeric
347 , ((SLIT("Fractional"),pRELUDE), fractionalClassKey) -- numeric
348 , ((SLIT("Floating"),pRELUDE), floatingClassKey) -- numeric
349 , ((SLIT("RealFrac"),pRELUDE), realFracClassKey) -- numeric
350 , ((SLIT("RealFloat"),pRELUDE), realFloatClassKey) -- numeric
351 , ((SLIT("Ix"),iX), ixClassKey) -- derivable (but it isn't Prelude.Ix; hmmm)
352 , ((SLIT("Bounded"),pRELUDE), boundedClassKey) -- derivable
353 , ((SLIT("Enum"),pRELUDE), enumClassKey) -- derivable
354 , ((SLIT("Show"),pRELUDE), showClassKey) -- derivable
355 , ((SLIT("Read"),pRELUDE), readClassKey) -- derivable
356 , ((SLIT("Monad"),pRELUDE), monadClassKey)
357 , ((SLIT("MonadZero"),pRELUDE), monadZeroClassKey)
358 , ((SLIT("MonadPlus"),pRELUDE), monadPlusClassKey)
359 , ((SLIT("Functor"),pRELUDE), functorClassKey)
360 , ((SLIT("_CCallable"),pRELUDE), cCallableClassKey) -- mentioned, ccallish
361 , ((SLIT("_CReturnable"),pRELUDE), cReturnableClassKey) -- mentioned, ccallish
365 = [ (str_mod, (k, RnImplicit)) | (str_mod,k) <-
366 [ ((SLIT("fromInt"),pRELUDE), fromIntClassOpKey)
367 , ((SLIT("fromInteger"),pRELUDE), fromIntegerClassOpKey)
368 , ((SLIT("fromRational"),pRELUDE), fromRationalClassOpKey)
369 , ((SLIT("enumFrom"),pRELUDE), enumFromClassOpKey)
370 , ((SLIT("enumFromThen"),pRELUDE), enumFromThenClassOpKey)
371 , ((SLIT("enumFromTo"),pRELUDE), enumFromToClassOpKey)
372 , ((SLIT("enumFromThenTo"),pRELUDE),enumFromThenToClassOpKey)
373 , ((SLIT("=="),pRELUDE), eqClassOpKey)
374 , ((SLIT(">>="),pRELUDE), thenMClassOpKey)
375 , ((SLIT("zero"),pRELUDE), zeroClassOpKey)
379 ToDo: make it do the ``like'' part properly (as in 0.26 and before).
381 maybeCharLikeTyCon tc = if (uniqueOf tc == charDataConKey) then Just charDataCon else Nothing
382 maybeIntLikeTyCon tc = if (uniqueOf tc == intDataConKey) then Just intDataCon else Nothing