1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
|
{-
(c) The GRASP/AQUA Project, Glasgow University, 1992-1998
\section[PrelInfo]{The @PrelInfo@ interface to the compiler's prelude knowledge}
-}
{-# LANGUAGE CPP #-}
module PrelInfo (
wiredInIds, ghcPrimIds,
primOpRules, builtinRules,
ghcPrimExports,
knownKeyNames,
primOpId,
-- Random other things
maybeCharLikeCon, maybeIntLikeCon,
-- Class categories
isNumericClass, isStandardClass
) where
#include "HsVersions.h"
import Constants ( mAX_TUPLE_SIZE )
import BasicTypes ( Boxity(..) )
import ConLike ( ConLike(..) )
import PrelNames
import PrelRules
import Avail
import PrimOp
import DataCon
import Id
import Name
import MkId
import NameEnv
import TysPrim
import TysWiredIn
import HscTypes
import UniqFM
import Class
import TyCon
import Util
import Panic ( panic )
import {-# SOURCE #-} TcTypeNats ( typeNatTyCons )
import Data.List ( intercalate )
import Data.Array
{-
************************************************************************
* *
\subsection[builtinNameInfo]{Lookup built-in names}
* *
************************************************************************
Notes about wired in things
~~~~~~~~~~~~~~~~~~~~~~~~~~~
* Wired-in things are Ids\/TyCons that are completely known to the compiler.
They are global values in GHC, (e.g. listTyCon :: TyCon).
* A wired in Name contains the thing itself inside the Name:
see Name.wiredInNameTyThing_maybe
(E.g. listTyConName contains listTyCon.
* The name cache is initialised with (the names of) all wired-in things
* The type environment itself contains no wired in things. The type
checker sees if the Name is wired in before looking up the name in
the type environment.
* MkIface prunes out wired-in things before putting them in an interface file.
So interface files never contain wired-in things.
-}
knownKeyNames :: [Name]
-- This list is used to ensure that when you say "Prelude.map"
-- in your source code, or in an interface file,
-- you get a Name with the correct known key
-- (See Note [Known-key names] in PrelNames)
knownKeyNames
| debugIsOn
, not (isNullUFM badNamesEnv)
= panic ("badKnownKeyNames:\n" ++ badNamesStr)
-- NB: We can't use ppr here, because this is sometimes evaluated in a
-- context where there are no DynFlags available, leading to a cryptic
-- "<<details unavailable>>" error. (This seems to happen only in the
-- stage 2 compiler, for reasons I [Richard] have no clue of.)
| otherwise
= names
where
names =
concat [ tycon_kk_names funTyCon
, concatMap tycon_kk_names primTyCons
, concatMap tycon_kk_names wiredInTyCons
-- Does not include tuples
, concatMap tycon_kk_names typeNatTyCons
, concatMap (rep_names . tupleTyCon Boxed) [2..mAX_TUPLE_SIZE] -- Yuk
, cTupleTyConNames
-- Constraint tuples are known-key but not wired-in
-- They can't show up in source code, but can appear
-- in intreface files
, map idName wiredInIds
, map (idName . primOpId) allThePrimOps
, basicKnownKeyNames ]
-- "kk" short for "known-key"
tycon_kk_names :: TyCon -> [Name]
tycon_kk_names tc = tyConName tc : (rep_names tc ++ concatMap thing_kk_names (implicitTyConThings tc))
datacon_kk_names dc
= dataConName dc : rep_names (promoteDataCon dc)
thing_kk_names :: TyThing -> [Name]
thing_kk_names (ATyCon tc) = tycon_kk_names tc
thing_kk_names (AConLike (RealDataCon dc)) = datacon_kk_names dc
thing_kk_names thing = [getName thing]
-- The TyConRepName for a known-key TyCon has a known key,
-- but isn't itself an implicit thing. Yurgh.
-- NB: if any of the wired-in TyCons had record fields, the record
-- field names would be in a similar situation. Ditto class ops.
-- But it happens that there aren't any
rep_names tc = case tyConRepName_maybe tc of
Just n -> [n]
Nothing -> []
namesEnv = foldl (\m n -> extendNameEnv_Acc (:) singleton m n n)
emptyUFM names
badNamesEnv = filterNameEnv (\ns -> length ns > 1) namesEnv
badNamesPairs = nameEnvUniqueElts badNamesEnv
badNamesStrs = map pairToStr badNamesPairs
badNamesStr = unlines badNamesStrs
pairToStr (uniq, ns) = " " ++
show uniq ++
": [" ++
intercalate ", " (map (occNameString . nameOccName) ns) ++
"]"
{-
We let a lot of "non-standard" values be visible, so that we can make
sense of them in interface pragmas. It's cool, though they all have
"non-standard" names, so they won't get past the parser in user code.
************************************************************************
* *
PrimOpIds
* *
************************************************************************
-}
primOpIds :: Array Int Id
-- A cache of the PrimOp Ids, indexed by PrimOp tag
primOpIds = array (1,maxPrimOpTag) [ (primOpTag op, mkPrimOpId op)
| op <- allThePrimOps ]
primOpId :: PrimOp -> Id
primOpId op = primOpIds ! primOpTag op
{-
************************************************************************
* *
\subsection{Export lists for pseudo-modules (GHC.Prim)}
* *
************************************************************************
GHC.Prim "exports" all the primops and primitive types, some
wired-in Ids.
-}
ghcPrimExports :: [IfaceExport]
ghcPrimExports
= map (avail . idName) ghcPrimIds ++
map (avail . idName . primOpId) allThePrimOps ++
[ AvailTC n [n] []
| tc <- funTyCon : primTyCons, let n = tyConName tc ]
{-
************************************************************************
* *
\subsection{Built-in keys}
* *
************************************************************************
ToDo: make it do the ``like'' part properly (as in 0.26 and before).
-}
maybeCharLikeCon, maybeIntLikeCon :: DataCon -> Bool
maybeCharLikeCon con = con `hasKey` charDataConKey
maybeIntLikeCon con = con `hasKey` intDataConKey
{-
************************************************************************
* *
\subsection{Class predicates}
* *
************************************************************************
-}
isNumericClass, isStandardClass :: Class -> Bool
isNumericClass clas = classKey clas `is_elem` numericClassKeys
isStandardClass clas = classKey clas `is_elem` standardClassKeys
is_elem :: Eq a => a -> [a] -> Bool
is_elem = isIn "is_X_Class"
|
