2 % (c) The GRASP/AQUA Project, Glasgow University, 1992-1996
4 \section[Id]{@Ids@: Value and constructor identifiers}
7 #include "HsVersions.h"
11 GenId(..), -- *naughtily* used in some places (e.g., TcHsSyn)
12 SYN_IE(Id), IdDetails,
14 SYN_IE(ConTag), fIRST_TAG,
15 SYN_IE(DataCon), SYN_IE(DictFun), SYN_IE(DictVar),
22 mkIdWithNewUniq, mkIdWithNewName,
37 -- DESTRUCTION (excluding pragmatic info)
52 recordSelectorFieldLabel,
58 cmpId_withSpecDataCon,
61 idWantsToBeINLINEd, getInlinePragma,
62 idMustBeINLINEd, idMustNotBeINLINEd,
65 isConstMethodId_maybe,
68 isDefaultMethodId_maybe,
75 isSuperDictSelId_maybe,
82 unfoldingUnfriendlyId,
88 -- PRINTING and RENUMBERING
99 -- UNFOLDING, ARITY, UPDATE, AND STRICTNESS STUFF (etc)
113 addInlinePragma, nukeNoInlinePragma, addNoInlinePragma,
116 SYN_IE(IdEnv), SYN_IE(GenIdSet), SYN_IE(IdSet),
137 modifyIdEnv_Directly,
148 IMPORT_DELOOPER(IdLoop) -- for paranoia checking
149 IMPORT_DELOOPER(TyLoop) -- for paranoia checking
153 import Class ( classOpString, SYN_IE(Class), GenClass, SYN_IE(ClassOp), GenClassOp )
155 import Maybes ( maybeToBool )
156 import Name {- ( nameUnique, mkLocalName, mkSysLocalName, isLocalName,
157 mkCompoundName, mkInstDeclName,
158 isLocallyDefinedName, occNameString, modAndOcc,
159 isLocallyDefined, changeUnique, isWiredInName,
160 nameString, getOccString, setNameVisibility,
161 isExported, ExportFlag(..), DefnInfo, Provenance,
164 import PrelMods ( pREL_TUP, pREL_BASE )
165 import Lex ( mkTupNameStr )
166 import FieldLabel ( fieldLabelName, FieldLabel(..){-instances-} )
167 import PragmaInfo ( PragmaInfo(..) )
168 #if __GLASGOW_HASKELL__ >= 202
169 import PrimOp ( PrimOp )
171 import PprEnv -- ( SYN_IE(NmbrM), NmbrEnv(..) )
172 import PprType ( getTypeString, specMaybeTysSuffix,
178 import MatchEnv ( MatchEnv )
179 import SrcLoc --( mkBuiltinSrcLoc )
180 import TysWiredIn ( tupleTyCon )
181 import TyCon --( TyCon, tyConDataCons )
182 import Type {- ( mkSigmaTy, mkTyVarTys, mkFunTys, mkDictTy,
183 applyTyCon, instantiateTy, mkForAllTys,
184 tyVarsOfType, applyTypeEnvToTy, typePrimRep,
185 GenType, SYN_IE(ThetaType), SYN_IE(TauType), SYN_IE(Type)
187 import TyVar --( alphaTyVars, isEmptyTyVarSet, SYN_IE(TyVarEnv) )
188 import Usage ( SYN_IE(UVar) )
190 import UniqSet -- practically all of it
191 import Unique ( getBuiltinUniques, pprUnique, showUnique,
193 Unique{-instance Ord3-}
195 import Outputable ( ifPprDebug, Outputable(..) )
196 import Util {- ( mapAccumL, nOfThem, zipEqual, assoc,
197 panic, panic#, pprPanic, assertPanic
201 Here are the @Id@ and @IdDetails@ datatypes; also see the notes that
204 Every @Id@ has a @Unique@, to uniquify it and for fast comparison, a
205 @Type@, and an @IdInfo@ (non-essential info about it, e.g.,
206 strictness). The essential info about different kinds of @Ids@ is
209 ToDo: possibly cache other stuff in the single-constructor @Id@ type.
213 Unique -- Key for fast comparison
215 ty -- Id's type; used all the time;
216 IdDetails -- Stuff about individual kinds of Ids.
217 PragmaInfo -- Properties of this Id requested by programmer
218 -- eg specialise-me, inline-me
219 IdInfo -- Properties of this Id deduced by compiler
223 data StrictnessMark = MarkedStrict | NotMarkedStrict
227 ---------------- Local values
229 = LocalId Bool -- Local name; mentioned by the user
230 -- True <=> no free type vars
232 | SysLocalId Bool -- Local name; made up by the compiler
235 | PrimitiveId PrimOp -- The Id for a primitive operation
237 | SpecPragmaId -- Local name; introduced by the compiler
238 (Maybe Id) -- for explicit specid in pragma
239 Bool -- as for LocalId
241 ---------------- Global values
243 | ImportedId -- Global name (Imported or Implicit); Id imported from an interface
245 ---------------- Data constructors
248 [StrictnessMark] -- Strict args; length = arity
249 [FieldLabel] -- Field labels for this constructor;
250 --length = 0 (not a record) or arity
252 [TyVar] [(Class,Type)] -- Type vars and context for the data type decl
253 [TyVar] [(Class,Type)] -- Ditto for the context of the constructor,
254 -- the existentially quantified stuff
255 [Type] TyCon -- Args and result tycon
257 -- forall tyvars1 ++ tyvars2. theta1 ++ theta2 =>
258 -- unitype_1 -> ... -> unitype_n -> tycon tyvars
260 | TupleConId Int -- Its arity
262 | RecordSelId FieldLabel
264 ---------------- Things to do with overloading
266 | SuperDictSelId -- Selector for superclass dictionary
267 Class -- The class (input dict)
268 Class -- The superclass (result dict)
270 | MethodSelId Class -- An overloaded class operation, with
271 -- a fully polymorphic type. Its code
272 -- just selects a method from the
273 -- dictionary. The class.
274 ClassOp -- The operation
276 -- NB: The IdInfo for a MethodSelId has all the info about its
277 -- related "constant method Ids", which are just
278 -- specialisations of this general one.
280 | DefaultMethodId -- Default method for a particular class op
281 Class -- same class, <blah-blah> info as MethodSelId
282 ClassOp -- (surprise, surprise)
283 Bool -- True <=> I *know* this default method Id
284 -- is a generated one that just says
285 -- `error "No default method for <op>"'.
288 | DictFunId Class -- A DictFun is uniquely identified
289 Type -- by its class and type; this type has free type vars,
290 -- whose identity is irrelevant. Eg Class = Eq
292 -- The "a" is irrelevant. As it is too painful to
293 -- actually do comparisons that way, we kindly supply
294 -- a Unique for that purpose.
297 | ConstMethodId -- A method which depends only on the type of the
298 -- instance, and not on any further dictionaries etc.
299 Class -- Uniquely identified by:
300 Type -- (class, type, classop) triple
302 Module -- module where instance came from
304 | InstId -- An instance of a dictionary, class operation,
305 -- or overloaded value (Local name)
306 Bool -- as for LocalId
308 | SpecId -- A specialisation of another Id
309 Id -- Id of which this is a specialisation
310 [Maybe Type] -- Types at which it is specialised;
311 -- A "Nothing" says this type ain't relevant.
312 Bool -- True <=> no free type vars; it's not enough
313 -- to know about the unspec version, because
314 -- we may specialise to a type w/ free tyvars
315 -- (i.e., in one of the "Maybe Type" dudes).
317 -- Scheduled for deletion: SLPJ Nov 96
318 -- Nobody seems to depend on knowing this.
319 | WorkerId -- A "worker" for some other Id
320 Id -- Id for which this is a worker
328 DictFunIds are generated from instance decls.
333 instance Foo a => Foo [a] where
336 generates the dict fun id decl
338 dfun.Foo.[*] = \d -> ...
340 The dfun id is uniquely named by the (class, type) pair. Notice, it
341 isn't a (class,tycon) pair any more, because we may get manually or
342 automatically generated specialisations of the instance decl:
344 instance Foo [Int] where
351 The type variables in the name are irrelevant; we print them as stars.
354 Constant method ids are generated from instance decls where
355 there is no context; that is, no dictionaries are needed to
356 construct the method. Example
358 instance Foo Int where
361 Then we get a constant method
366 It is possible, albeit unusual, to have a constant method
367 for an instance decl which has type vars:
369 instance Foo [a] where
373 We get the constant method
377 So a constant method is identified by a class/op/type triple.
378 The type variables in the type are irrelevant.
381 For Ids whose names must be known/deducible in other modules, we have
382 to conjure up their worker's names (and their worker's worker's
383 names... etc) in a known systematic way.
386 %************************************************************************
388 \subsection[Id-documentation]{Documentation}
390 %************************************************************************
394 The @Id@ datatype describes {\em values}. The basic things we want to
395 know: (1)~a value's {\em type} (@idType@ is a very common
396 operation in the compiler); and (2)~what ``flavour'' of value it might
397 be---for example, it can be terribly useful to know that a value is a
401 %----------------------------------------------------------------------
402 \item[@DataConId@:] For the data constructors declared by a @data@
403 declaration. Their type is kept in {\em two} forms---as a regular
404 @Type@ (in the usual place), and also in its constituent pieces (in
405 the ``details''). We are frequently interested in those pieces.
407 %----------------------------------------------------------------------
408 \item[@TupleConId@:] This is just a special shorthand for @DataCons@ for
409 the infinite family of tuples.
411 %----------------------------------------------------------------------
412 \item[@ImportedId@:] These are values defined outside this module.
413 {\em Everything} we want to know about them must be stored here (or in
416 %----------------------------------------------------------------------
417 \item[@MethodSelId@:] A selector from a dictionary; it may select either
418 a method or a dictionary for one of the class's superclasses.
420 %----------------------------------------------------------------------
423 @mkDictFunId [a,b..] theta C T@ is the function derived from the
426 instance theta => C (T a b ..) where
429 It builds function @Id@ which maps dictionaries for theta,
430 to a dictionary for C (T a b ..).
432 *Note* that with the ``Mark Jones optimisation'', the theta may
433 include dictionaries for the immediate superclasses of C at the type
436 %----------------------------------------------------------------------
439 %----------------------------------------------------------------------
442 %----------------------------------------------------------------------
445 %----------------------------------------------------------------------
446 \item[@LocalId@:] A purely-local value, e.g., a function argument,
447 something defined in a @where@ clauses, ... --- but which appears in
448 the original program text.
450 %----------------------------------------------------------------------
451 \item[@SysLocalId@:] Same as a @LocalId@, except does {\em not} appear in
452 the original program text; these are introduced by the compiler in
455 %----------------------------------------------------------------------
456 \item[@SpecPragmaId@:] Introduced by the compiler to record
457 Specialisation pragmas. It is dead code which MUST NOT be removed
458 before specialisation.
463 %----------------------------------------------------------------------
466 @DataCons@ @TupleCons@, @Importeds@, @SuperDictSelIds@,
467 @MethodSelIds@, @DictFunIds@, and @DefaultMethodIds@ have the following
471 They have no free type variables, so if you are making a
472 type-variable substitution you don't need to look inside them.
474 They are constants, so they are not free variables. (When the STG
475 machine makes a closure, it puts all the free variables in the
476 closure; the above are not required.)
478 Note that @InstIds@, @Locals@ and @SysLocals@ {\em may} have the above
479 properties, but they may not.
482 %************************************************************************
484 \subsection[Id-general-funs]{General @Id@-related functions}
486 %************************************************************************
489 isDataCon (Id _ _ _ (DataConId _ __ _ _ _ _ _ _) _ _) = True
490 isDataCon (Id _ _ _ (TupleConId _) _ _) = True
491 isDataCon (Id _ _ _ (SpecId unspec _ _) _ _) = isDataCon unspec
492 isDataCon other = False
494 isTupleCon (Id _ _ _ (TupleConId _) _ _) = True
495 isTupleCon (Id _ _ _ (SpecId unspec _ _) _ _) = isTupleCon unspec
496 isTupleCon other = False
499 isSpecId_maybe (Id _ _ _ (SpecId unspec ty_maybes _) _ _)
500 = ASSERT(not (maybeToBool (isSpecId_maybe unspec)))
501 Just (unspec, ty_maybes)
502 isSpecId_maybe other_id
505 isSpecPragmaId_maybe (Id _ _ _ (SpecPragmaId specid _) _ _)
507 isSpecPragmaId_maybe other_id
512 @toplevelishId@ tells whether an @Id@ {\em may} be defined in a nested
513 @let(rec)@ (returns @False@), or whether it is {\em sure} to be
514 defined at top level (returns @True@). This is used to decide whether
515 the @Id@ is a candidate free variable. NB: you are only {\em sure}
516 about something if it returns @True@!
519 toplevelishId :: Id -> Bool
520 idHasNoFreeTyVars :: Id -> Bool
522 toplevelishId (Id _ _ _ details _ _)
525 chk (DataConId _ __ _ _ _ _ _ _) = True
526 chk (TupleConId _) = True
527 chk (RecordSelId _) = True
528 chk ImportedId = True
529 chk (SuperDictSelId _ _) = True
530 chk (MethodSelId _ _) = True
531 chk (DefaultMethodId _ _ _) = True
532 chk (DictFunId _ _) = True
533 chk (ConstMethodId _ _ _ _) = True
534 chk (SpecId unspec _ _) = toplevelishId unspec
535 -- depends what the unspecialised thing is
536 chk (WorkerId unwrkr) = toplevelishId unwrkr
537 chk (InstId _) = False -- these are local
538 chk (LocalId _) = False
539 chk (SysLocalId _) = False
540 chk (SpecPragmaId _ _) = False
541 chk (PrimitiveId _) = True
543 idHasNoFreeTyVars (Id _ _ _ details _ info)
546 chk (DataConId _ _ _ _ _ _ _ _ _) = True
547 chk (TupleConId _) = True
548 chk (RecordSelId _) = True
549 chk ImportedId = True
550 chk (SuperDictSelId _ _) = True
551 chk (MethodSelId _ _) = True
552 chk (DefaultMethodId _ _ _) = True
553 chk (DictFunId _ _) = True
554 chk (ConstMethodId _ _ _ _) = True
555 chk (WorkerId unwrkr) = idHasNoFreeTyVars unwrkr
556 chk (SpecId _ _ no_free_tvs) = no_free_tvs
557 chk (InstId no_free_tvs) = no_free_tvs
558 chk (LocalId no_free_tvs) = no_free_tvs
559 chk (SysLocalId no_free_tvs) = no_free_tvs
560 chk (SpecPragmaId _ no_free_tvs) = no_free_tvs
561 chk (PrimitiveId _) = True
563 -- omitIfaceSigForId tells whether an Id's info is implied by other declarations,
564 -- so we don't need to put its signature in an interface file, even if it's mentioned
565 -- in some other interface unfolding.
571 omitIfaceSigForId (Id _ name _ details _ _)
577 ImportedId -> True -- Never put imports in interface file
578 (PrimitiveId _) -> True -- Ditto, for primitives
580 -- This group is Ids that are implied by their type or class decl;
581 -- remember that all type and class decls appear in the interface file.
582 -- The dfun id must *not* be omitted, because it carries version info for
584 (DataConId _ _ _ _ _ _ _ _ _) -> True
585 (TupleConId _) -> True
586 (RecordSelId _) -> True
587 (SuperDictSelId _ _) -> True
588 (MethodSelId _ _) -> True
590 other -> False -- Don't omit!
591 -- NB DefaultMethodIds are not omitted
595 isImportedId (Id _ _ _ ImportedId _ _) = True
596 isImportedId other = False
598 isBottomingId (Id _ _ _ _ _ info) = bottomIsGuaranteed (strictnessInfo info)
600 isSysLocalId (Id _ _ _ (SysLocalId _) _ _) = True
601 isSysLocalId other = False
603 isSpecPragmaId (Id _ _ _ (SpecPragmaId _ _) _ _) = True
604 isSpecPragmaId other = False
606 isMethodSelId_maybe (Id _ _ _ (MethodSelId cls op) _ _) = Just (cls,op)
607 isMethodSelId_maybe _ = Nothing
609 isDefaultMethodId (Id _ _ _ (DefaultMethodId _ _ _) _ _) = True
610 isDefaultMethodId other = False
612 isDefaultMethodId_maybe (Id _ _ _ (DefaultMethodId cls clsop err) _ _)
613 = Just (cls, clsop, err)
614 isDefaultMethodId_maybe other = Nothing
616 isDictFunId (Id _ _ _ (DictFunId _ _) _ _) = True
617 isDictFunId other = False
619 isConstMethodId (Id _ _ _ (ConstMethodId _ _ _ _) _ _) = True
620 isConstMethodId other = False
622 isConstMethodId_maybe (Id _ _ _ (ConstMethodId cls ty clsop _) _ _)
623 = Just (cls, ty, clsop)
624 isConstMethodId_maybe other = Nothing
626 isSuperDictSelId_maybe (Id _ _ _ (SuperDictSelId c sc) _ _) = Just (c, sc)
627 isSuperDictSelId_maybe other_id = Nothing
629 isWorkerId (Id _ _ _ (WorkerId _) _ _) = True
630 isWorkerId other = False
632 isWrapperId id = workerExists (getIdStrictness id)
634 isPrimitiveId_maybe (Id _ _ _ (PrimitiveId primop) _ _) = Just primop
635 isPrimitiveId_maybe other = Nothing
638 Tell them who my wrapper function is.
641 myWrapperMaybe :: Id -> Maybe Id
643 myWrapperMaybe (Id _ _ _ (WorkerId my_wrapper) _ _) = Just my_wrapper
644 myWrapperMaybe other_id = Nothing
649 unfoldingUnfriendlyId -- return True iff it is definitely a bad
650 :: Id -- idea to export an unfolding that
651 -> Bool -- mentions this Id. Reason: it cannot
652 -- possibly be seen in another module.
654 unfoldingUnfriendlyId id = not (externallyVisibleId id)
657 @externallyVisibleId@: is it true that another module might be
658 able to ``see'' this Id in a code generation sense. That
659 is, another .o file might refer to this Id.
661 In tidyCorePgm (SimplCore.lhs) we carefully set each top level thing's
662 local-ness precisely so that the test here would be easy
665 externallyVisibleId :: Id -> Bool
666 externallyVisibleId id@(Id _ name _ _ _ _) = not (isLocalName name)
667 -- not local => global => externally visible
670 CLAIM (not ASSERTed) for @applyTypeEnvToId@ and @applySubstToId@:
671 `Top-levelish Ids'' cannot have any free type variables, so applying
672 the type-env cannot have any effect. (NB: checked in CoreLint?)
674 The special casing is in @applyTypeEnvToId@, not @apply_to_Id@, as the
675 former ``should be'' the usual crunch point.
678 type TypeEnv = TyVarEnv Type
680 applyTypeEnvToId :: TypeEnv -> Id -> Id
682 applyTypeEnvToId type_env id@(Id _ _ ty _ _ _)
683 | idHasNoFreeTyVars id
686 = apply_to_Id ( \ ty ->
687 applyTypeEnvToTy type_env ty
692 apply_to_Id :: (Type -> Type) -> Id -> Id
694 apply_to_Id ty_fn (Id u n ty details prag info)
698 Id u n new_ty (apply_to_details details) prag (apply_to_IdInfo ty_fn info)
700 apply_to_details (SpecId unspec ty_maybes no_ftvs)
702 new_unspec = apply_to_Id ty_fn unspec
703 new_maybes = map apply_to_maybe ty_maybes
705 SpecId new_unspec new_maybes (no_free_tvs ty)
706 -- ToDo: gratuitous recalc no_ftvs???? (also InstId)
708 apply_to_maybe Nothing = Nothing
709 apply_to_maybe (Just ty) = Just (ty_fn ty)
711 apply_to_details (WorkerId unwrkr)
713 new_unwrkr = apply_to_Id ty_fn unwrkr
717 apply_to_details other = other
720 Sadly, I don't think the one using the magic typechecker substitution
721 can be done with @apply_to_Id@. Here we go....
723 Strictness is very important here. We can't leave behind thunks
724 with pointers to the substitution: it {\em must} be single-threaded.
728 applySubstToId :: Subst -> Id -> (Subst, Id)
730 applySubstToId subst id@(Id u n ty info details)
731 -- *cannot* have a "idHasNoFreeTyVars" get-out clause
732 -- because, in the typechecker, we are still
733 -- *concocting* the types.
734 = case (applySubstToTy subst ty) of { (s2, new_ty) ->
735 case (applySubstToIdInfo s2 info) of { (s3, new_info) ->
736 case (apply_to_details s3 new_ty details) of { (s4, new_details) ->
737 (s4, Id u n new_ty new_info new_details) }}}
739 apply_to_details subst _ (InstId inst no_ftvs)
740 = case (applySubstToInst subst inst) of { (s2, new_inst) ->
741 (s2, InstId new_inst no_ftvs{-ToDo:right???-}) }
743 apply_to_details subst new_ty (SpecId unspec ty_maybes _)
744 = case (applySubstToId subst unspec) of { (s2, new_unspec) ->
745 case (mapAccumL apply_to_maybe s2 ty_maybes) of { (s3, new_maybes) ->
746 (s3, SpecId new_unspec new_maybes (no_free_tvs new_ty)) }}
747 -- NB: recalc no_ftvs (I think it's necessary (?) WDP 95/04)
749 apply_to_maybe subst Nothing = (subst, Nothing)
750 apply_to_maybe subst (Just ty)
751 = case (applySubstToTy subst ty) of { (s2, new_ty) ->
754 apply_to_details subst _ (WorkerId unwrkr)
755 = case (applySubstToId subst unwrkr) of { (s2, new_unwrkr) ->
756 (s2, WorkerId new_unwrkr) }
758 apply_to_details subst _ other = (subst, other)
762 %************************************************************************
764 \subsection[Id-type-funs]{Type-related @Id@ functions}
766 %************************************************************************
769 idType :: GenId ty -> ty
771 idType (Id _ _ ty _ _ _) = ty
776 getMentionedTyConsAndClassesFromId :: Id -> (Bag TyCon, Bag Class)
778 getMentionedTyConsAndClassesFromId id
779 = getMentionedTyConsAndClassesFromType (idType id)
784 idPrimRep i = typePrimRep (idType i)
787 %************************************************************************
789 \subsection[Id-overloading]{Functions related to overloading}
791 %************************************************************************
794 mkSuperDictSelId u clas sc ty
795 = addStandardIdInfo $
796 Id u name ty details NoPragmaInfo noIdInfo
798 name = mkCompoundName name_fn u (getName clas)
799 details = SuperDictSelId clas sc
800 name_fn clas_str = SLIT("scsel_") _APPEND_ clas_str _APPEND_ mod _APPEND_ occNameString occ
801 (mod,occ) = modAndOcc sc
803 -- For method selectors the clean thing to do is
804 -- to give the method selector the same name as the class op itself.
805 mkMethodSelId op_name rec_c op ty
806 = addStandardIdInfo $
807 Id (uniqueOf op_name) op_name ty (MethodSelId rec_c op) NoPragmaInfo noIdInfo
809 mkDefaultMethodId dm_name rec_c op gen ty
810 = Id (uniqueOf dm_name) dm_name ty (DefaultMethodId rec_c op gen) NoPragmaInfo noIdInfo
812 mkDictFunId dfun_name full_ty clas ity
813 = Id (nameUnique dfun_name) dfun_name full_ty details NoPragmaInfo noIdInfo
815 details = DictFunId clas ity
817 mkConstMethodId uniq clas op ity full_ty from_here locn mod info
818 = Id uniq name full_ty details NoPragmaInfo info
820 name = mkInstDeclName uniq mod (VarOcc occ_name) locn from_here
821 details = ConstMethodId clas ity op mod
822 occ_name = classOpString op _APPEND_
823 SLIT("_cm_") _APPEND_ renum_type_string full_ty ity
825 mkWorkerId u unwrkr ty info
826 = Id u name ty details NoPragmaInfo info
828 name = mkCompoundName name_fn u (getName unwrkr)
829 details = WorkerId unwrkr
830 name_fn wkr_str = SLIT("$w") _APPEND_ wkr_str
833 = Id u name ty (InstId (no_free_tvs ty)) NoPragmaInfo noIdInfo
836 getConstMethodId clas op ty
837 = -- constant-method info is hidden in the IdInfo of
838 -- the class-op id (as mentioned up above).
840 sel_id = getMethodSelId clas op
842 case (lookupConstMethodId (getIdSpecialisation sel_id) ty) of
844 Nothing -> pprError "ERROR: getConstMethodId:" (vcat [
845 hsep [ppr PprDebug ty, ppr PprDebug ops, ppr PprDebug op_ids,
846 ppr PprDebug sel_id],
847 text "(This can arise if an interface pragma refers to an instance",
848 text "but there is no imported interface which *defines* that instance.",
849 text "The info above, however ugly, should indicate what else you need to import."
854 renum_type_string full_ty ity
856 nmbrType full_ty `thenNmbr` \ _ -> -- so all the tyvars get added to renumbering...
857 nmbrType ity `thenNmbr` \ rn_ity ->
858 returnNmbr (getTypeString rn_ity)
862 %************************************************************************
864 \subsection[local-funs]{@LocalId@-related functions}
866 %************************************************************************
869 mkImported n ty info = Id (nameUnique n) n ty ImportedId NoPragmaInfo info
871 mkPrimitiveId n ty primop
872 = addStandardIdInfo $
873 Id (nameUnique n) n ty (PrimitiveId primop) IMustBeINLINEd noIdInfo
874 -- The pragma @IMustBeINLINEd@ says that this Id absolutely must be inlined.
875 -- It's only true for primitives, because we don't want to make a closure for each of them.
880 type MyTy a b = GenType (GenTyVar a) b
881 type MyId a b = GenId (MyTy a b)
883 no_free_tvs ty = isEmptyTyVarSet (tyVarsOfType ty)
885 -- SysLocal: for an Id being created by the compiler out of thin air...
886 -- UserLocal: an Id with a name the user might recognize...
887 mkSysLocal :: FAST_STRING -> Unique -> MyTy a b -> SrcLoc -> MyId a b
888 mkUserLocal :: OccName -> Unique -> MyTy a b -> SrcLoc -> MyId a b
890 mkSysLocal str uniq ty loc
891 = Id uniq (mkSysLocalName uniq str loc) ty (SysLocalId (no_free_tvs ty)) NoPragmaInfo noIdInfo
893 mkUserLocal occ uniq ty loc
894 = Id uniq (mkLocalName uniq occ loc) ty (LocalId (no_free_tvs ty)) NoPragmaInfo noIdInfo
896 mkUserId :: Name -> MyTy a b -> PragmaInfo -> MyId a b
897 mkUserId name ty pragma_info
898 = Id (nameUnique name) name ty (LocalId (no_free_tvs ty)) pragma_info noIdInfo
905 -- for a SpecPragmaId being created by the compiler out of thin air...
906 mkSpecPragmaId :: OccName -> Unique -> Type -> Maybe Id -> SrcLoc -> Id
907 mkSpecPragmaId str uniq ty specid loc
908 = Id uniq (mkShortName str loc) ty noIdInfo (SpecPragmaId specid (no_free_tvs ty))
911 mkSpecId u unspec ty_maybes ty info
912 = ASSERT(not (maybeToBool (isSpecId_maybe unspec)))
913 Id u n ty info (SpecId unspec ty_maybes (no_free_tvs ty))
915 -- Specialised version of constructor: only used in STG and code generation
916 -- Note: The specialsied Id has the same unique as the unspeced Id
918 mkSameSpecCon ty_maybes unspec@(Id u n ty info details)
919 = ASSERT(isDataCon unspec)
920 ASSERT(not (maybeToBool (isSpecId_maybe unspec)))
921 Id u n new_ty info (SpecId unspec ty_maybes (no_free_tvs new_ty))
923 new_ty = specialiseTy ty ty_maybes 0
925 localiseId :: Id -> Id
926 localiseId id@(Id u n ty info details)
927 = Id u (mkShortName name loc) ty info (LocalId (no_free_tvs ty))
933 -- See notes with setNameVisibility (Name.lhs)
934 setIdVisibility :: Module -> Id -> Id
935 setIdVisibility mod (Id uniq name ty details prag info)
936 = Id uniq (setNameVisibility mod name) ty details prag info
938 mkIdWithNewUniq :: Id -> Unique -> Id
939 mkIdWithNewUniq (Id _ n ty details prag info) u
940 = Id u (changeUnique n u) ty details prag info
942 mkIdWithNewName :: Id -> Name -> Id
943 mkIdWithNewName (Id _ _ ty details prag info) new_name
944 = Id (uniqueOf new_name) new_name ty details prag info
947 Make some local @Ids@ for a template @CoreExpr@. These have bogus
948 @Uniques@, but that's OK because the templates are supposed to be
949 instantiated before use.
951 mkTemplateLocals :: [Type] -> [Id]
953 = zipWith (\ u -> \ ty -> mkSysLocal SLIT("tpl") u ty mkBuiltinSrcLoc)
954 (getBuiltinUniques (length tys))
959 getIdInfo :: GenId ty -> IdInfo
960 getPragmaInfo :: GenId ty -> PragmaInfo
962 getIdInfo (Id _ _ _ _ _ info) = info
963 getPragmaInfo (Id _ _ _ _ info _) = info
965 replaceIdInfo :: Id -> IdInfo -> Id
967 replaceIdInfo (Id u n ty details pinfo _) info = Id u n ty details pinfo info
970 selectIdInfoForSpecId :: Id -> IdInfo
971 selectIdInfoForSpecId unspec
972 = ASSERT(not (maybeToBool (isSpecId_maybe unspec)))
973 noIdInfo `addUnfoldInfo` getIdUnfolding unspec
977 %************************************************************************
979 \subsection[Id-arities]{Arity-related functions}
981 %************************************************************************
983 For locally-defined Ids, the code generator maintains its own notion
984 of their arities; so it should not be asking... (but other things
985 besides the code-generator need arity info!)
988 getIdArity :: Id -> ArityInfo
989 getIdArity id@(Id _ _ _ _ _ id_info)
990 = --ASSERT( not (isDataCon id))
993 addIdArity :: Id -> ArityInfo -> Id
994 addIdArity (Id u n ty details pinfo info) arity
995 = Id u n ty details pinfo (info `addArityInfo` arity)
998 %************************************************************************
1000 \subsection[constructor-funs]{@DataCon@-related functions (incl.~tuples)}
1002 %************************************************************************
1006 -> [StrictnessMark] -> [FieldLabel]
1007 -> [TyVar] -> ThetaType
1008 -> [TyVar] -> ThetaType
1009 -> [TauType] -> TyCon
1011 -- can get the tag and all the pieces of the type from the Type
1013 mkDataCon n stricts fields tvs ctxt con_tvs con_ctxt args_tys tycon
1014 = ASSERT(length stricts == length args_tys)
1015 addStandardIdInfo data_con
1017 -- NB: data_con self-recursion; should be OK as tags are not
1018 -- looked at until late in the game.
1023 (DataConId data_con_tag stricts fields tvs ctxt con_tvs con_ctxt args_tys tycon)
1024 IWantToBeINLINEd -- Always inline constructors if possible
1027 data_con_tag = assoc "mkDataCon" (data_con_family `zip` [fIRST_TAG..]) data_con
1028 data_con_family = tyConDataCons tycon
1031 = mkSigmaTy (tvs++con_tvs) (ctxt++con_ctxt)
1032 (mkFunTys args_tys (applyTyCon tycon (mkTyVarTys tvs)))
1035 mkTupleCon :: Arity -> Name -> Type -> Id
1036 mkTupleCon arity name ty
1037 = addStandardIdInfo tuple_id
1039 tuple_id = Id (nameUnique name) name ty
1041 IWantToBeINLINEd -- Always inline constructors if possible
1045 fIRST_TAG = 1 -- Tags allocated from here for real constructors
1048 dataConNumFields gives the number of actual fields in the
1049 {\em representation} of the data constructor. This may be more than appear
1050 in the source code; the extra ones are the existentially quantified
1055 = ASSERT(isDataCon id)
1056 case (dataConSig id) of { (_, _, _, con_theta, arg_tys, _) ->
1057 length con_theta + length arg_tys }
1059 isNullaryDataCon con = dataConNumFields con == 0 -- function of convenience
1064 dataConTag :: DataCon -> ConTag -- will panic if not a DataCon
1065 dataConTag (Id _ _ _ (DataConId tag _ _ _ _ _ _ _ _) _ _) = tag
1066 dataConTag (Id _ _ _ (TupleConId _) _ _) = fIRST_TAG
1067 dataConTag (Id _ _ _ (SpecId unspec _ _) _ _) = dataConTag unspec
1069 dataConTyCon :: DataCon -> TyCon -- will panic if not a DataCon
1070 dataConTyCon (Id _ _ _ (DataConId _ _ _ _ _ _ _ _ tycon) _ _) = tycon
1071 dataConTyCon (Id _ _ _ (TupleConId a) _ _) = tupleTyCon a
1073 dataConSig :: DataCon -> ([TyVar], ThetaType, [TyVar], ThetaType, [TauType], TyCon)
1074 -- will panic if not a DataCon
1076 dataConSig (Id _ _ _ (DataConId _ _ _ tyvars theta con_tyvars con_theta arg_tys tycon) _ _)
1077 = (tyvars, theta, con_tyvars, con_theta, arg_tys, tycon)
1079 dataConSig (Id _ _ _ (TupleConId arity) _ _)
1080 = (tyvars, [], [], [], tyvar_tys, tupleTyCon arity)
1082 tyvars = take arity alphaTyVars
1083 tyvar_tys = mkTyVarTys tyvars
1086 -- dataConRepType returns the type of the representation of a contructor
1087 -- This may differ from the type of the contructor Id itself for two reasons:
1088 -- a) the constructor Id may be overloaded, but the dictionary isn't stored
1089 -- b) the constructor may store an unboxed version of a strict field.
1090 -- Here's an example illustrating both:
1091 -- data Ord a => T a = MkT Int! a
1093 -- T :: Ord a => Int -> a -> T a
1094 -- but the rep type is
1095 -- Trep :: Int# -> a -> T a
1096 -- Actually, the unboxed part isn't implemented yet!
1098 dataConRepType :: GenId (GenType tv u) -> GenType tv u
1100 = mkForAllTys tyvars tau
1102 (tyvars, theta, tau) = splitSigmaTy (idType con)
1104 dataConFieldLabels :: DataCon -> [FieldLabel]
1105 dataConFieldLabels (Id _ _ _ (DataConId _ _ fields _ _ _ _ _ _) _ _) = fields
1106 dataConFieldLabels (Id _ _ _ (TupleConId _) _ _) = []
1108 dataConStrictMarks :: DataCon -> [StrictnessMark]
1109 dataConStrictMarks (Id _ _ _ (DataConId _ stricts _ _ _ _ _ _ _) _ _) = stricts
1110 dataConStrictMarks (Id _ _ _ (TupleConId arity) _ _)
1111 = nOfThem arity NotMarkedStrict
1113 dataConRawArgTys :: DataCon -> [TauType] -- a function of convenience
1114 dataConRawArgTys con = case (dataConSig con) of { (_,_, _, _, arg_tys,_) -> arg_tys }
1116 dataConArgTys :: DataCon
1117 -> [Type] -- Instantiated at these types
1118 -> [Type] -- Needs arguments of these types
1119 dataConArgTys con_id inst_tys
1120 = map (instantiateTy tenv) arg_tys
1122 (tyvars, _, _, _, arg_tys, _) = dataConSig con_id
1123 tenv = zipEqual "dataConArgTys" tyvars inst_tys
1127 mkRecordSelId field_label selector_ty
1128 = addStandardIdInfo $ -- Record selectors have a standard unfolding
1129 Id (nameUnique name)
1132 (RecordSelId field_label)
1136 name = fieldLabelName field_label
1138 recordSelectorFieldLabel :: Id -> FieldLabel
1139 recordSelectorFieldLabel (Id _ _ _ (RecordSelId lbl) _ _) = lbl
1141 isRecordSelector (Id _ _ _ (RecordSelId lbl) _ _) = True
1142 isRecordSelector other = False
1146 Data type declarations are of the form:
1148 data Foo a b = C1 ... | C2 ... | ... | Cn ...
1150 For each constructor @Ci@, we want to generate a curried function; so, e.g., for
1151 @C1 x y z@, we want a function binding:
1153 fun_C1 = /\ a -> /\ b -> \ [x, y, z] -> Con C1 [a, b] [x, y, z]
1155 Notice the ``big lambdas'' and type arguments to @Con@---we are producing
1156 2nd-order polymorphic lambda calculus with explicit types.
1158 %************************************************************************
1160 \subsection[unfolding-Ids]{Functions related to @Ids@' unfoldings}
1162 %************************************************************************
1165 getIdUnfolding :: Id -> Unfolding
1167 getIdUnfolding (Id _ _ _ _ _ info) = unfoldInfo info
1169 addIdUnfolding :: Id -> Unfolding -> Id
1170 addIdUnfolding id@(Id u n ty details prag info) unfolding
1171 = Id u n ty details prag (info `addUnfoldInfo` unfolding)
1174 The inline pragma tells us to be very keen to inline this Id, but it's still
1175 OK not to if optimisation is switched off.
1178 getInlinePragma :: Id -> PragmaInfo
1179 getInlinePragma (Id _ _ _ _ prag _) = prag
1181 idWantsToBeINLINEd :: Id -> Bool
1183 idWantsToBeINLINEd (Id _ _ _ _ IWantToBeINLINEd _) = True
1184 idWantsToBeINLINEd (Id _ _ _ _ IMustBeINLINEd _) = True
1185 idWantsToBeINLINEd _ = False
1187 idMustNotBeINLINEd (Id _ _ _ _ IMustNotBeINLINEd _) = True
1188 idMustNotBeINLINEd _ = False
1190 idMustBeINLINEd (Id _ _ _ _ IMustBeINLINEd _) = True
1191 idMustBeINLINEd _ = False
1193 addInlinePragma :: Id -> Id
1194 addInlinePragma (Id u sn ty details _ info)
1195 = Id u sn ty details IWantToBeINLINEd info
1197 nukeNoInlinePragma :: Id -> Id
1198 nukeNoInlinePragma id@(Id u sn ty details IMustNotBeINLINEd info)
1199 = Id u sn ty details NoPragmaInfo info
1200 nukeNoInlinePragma id@(Id u sn ty details _ info) = id -- Otherwise no-op
1202 addNoInlinePragma :: Id -> Id
1203 addNoInlinePragma id@(Id u sn ty details _ info)
1204 = Id u sn ty details IMustNotBeINLINEd info
1209 %************************************************************************
1211 \subsection[IdInfo-funs]{Functions related to @Ids@' @IdInfos@}
1213 %************************************************************************
1216 getIdDemandInfo :: Id -> DemandInfo
1217 getIdDemandInfo (Id _ _ _ _ _ info) = demandInfo info
1219 addIdDemandInfo :: Id -> DemandInfo -> Id
1220 addIdDemandInfo (Id u n ty details prags info) demand_info
1221 = Id u n ty details prags (info `addDemandInfo` demand_info)
1225 getIdUpdateInfo :: Id -> UpdateInfo
1226 getIdUpdateInfo (Id _ _ _ _ _ info) = updateInfo info
1228 addIdUpdateInfo :: Id -> UpdateInfo -> Id
1229 addIdUpdateInfo (Id u n ty details prags info) upd_info
1230 = Id u n ty details prags (info `addUpdateInfo` upd_info)
1235 getIdArgUsageInfo :: Id -> ArgUsageInfo
1236 getIdArgUsageInfo (Id u n ty info details) = argUsageInfo info
1238 addIdArgUsageInfo :: Id -> ArgUsageInfo -> Id
1239 addIdArgUsageInfo (Id u n ty info details) au_info
1240 = Id u n ty (info `addArgusageInfo` au_info) details
1246 getIdFBTypeInfo :: Id -> FBTypeInfo
1247 getIdFBTypeInfo (Id u n ty info details) = fbTypeInfo info
1249 addIdFBTypeInfo :: Id -> FBTypeInfo -> Id
1250 addIdFBTypeInfo (Id u n ty info details) upd_info
1251 = Id u n ty (info `addFBTypeInfo` upd_info) details
1256 getIdSpecialisation :: Id -> SpecEnv
1257 getIdSpecialisation (Id _ _ _ _ _ info) = specInfo info
1259 addIdSpecialisation :: Id -> SpecEnv -> Id
1260 addIdSpecialisation (Id u n ty details prags info) spec_info
1261 = Id u n ty details prags (info `addSpecInfo` spec_info)
1264 Strictness: we snaffle the info out of the IdInfo.
1267 getIdStrictness :: Id -> StrictnessInfo Id
1269 getIdStrictness (Id _ _ _ _ _ info) = strictnessInfo info
1271 addIdStrictness :: Id -> StrictnessInfo Id -> Id
1272 addIdStrictness (Id u n ty details prags info) strict_info
1273 = Id u n ty details prags (info `addStrictnessInfo` strict_info)
1276 %************************************************************************
1278 \subsection[Id-comparison]{Comparison functions for @Id@s}
1280 %************************************************************************
1282 Comparison: equality and ordering---this stuff gets {\em hammered}.
1285 cmpId (Id u1 _ _ _ _ _) (Id u2 _ _ _ _ _) = cmp u1 u2
1286 -- short and very sweet
1290 instance Ord3 (GenId ty) where
1293 instance Eq (GenId ty) where
1294 a == b = case (a `cmp` b) of { EQ_ -> True; _ -> False }
1295 a /= b = case (a `cmp` b) of { EQ_ -> False; _ -> True }
1297 instance Ord (GenId ty) where
1298 a <= b = case (a `cmp` b) of { LT_ -> True; EQ_ -> True; GT__ -> False }
1299 a < b = case (a `cmp` b) of { LT_ -> True; EQ_ -> False; GT__ -> False }
1300 a >= b = case (a `cmp` b) of { LT_ -> False; EQ_ -> True; GT__ -> True }
1301 a > b = case (a `cmp` b) of { LT_ -> False; EQ_ -> False; GT__ -> True }
1302 _tagCmp a b = case (a `cmp` b) of { LT_ -> _LT; EQ_ -> _EQ; GT__ -> _GT }
1305 @cmpId_withSpecDataCon@ ensures that any spectys are taken into
1306 account when comparing two data constructors. We need to do this
1307 because a specialised data constructor has the same Unique as its
1308 unspecialised counterpart.
1311 cmpId_withSpecDataCon :: Id -> Id -> TAG_
1313 cmpId_withSpecDataCon id1 id2
1314 | eq_ids && isDataCon id1 && isDataCon id2
1315 = cmpEqDataCon id1 id2
1320 cmp_ids = cmpId id1 id2
1321 eq_ids = case cmp_ids of { EQ_ -> True; other -> False }
1323 cmpEqDataCon (Id _ _ _ (SpecId _ mtys1 _) _ _) (Id _ _ _ (SpecId _ mtys2 _) _ _)
1324 = panic# "Id.cmpEqDataCon:cmpUniTypeMaybeList mtys1 mtys2"
1326 cmpEqDataCon _ (Id _ _ _ (SpecId _ _ _) _ _) = LT_
1327 cmpEqDataCon (Id _ _ _ (SpecId _ _ _) _ _) _ = GT_
1328 cmpEqDataCon _ _ = EQ_
1331 %************************************************************************
1333 \subsection[Id-other-instances]{Other instance declarations for @Id@s}
1335 %************************************************************************
1338 instance Outputable ty => Outputable (GenId ty) where
1339 ppr sty id = pprId sty id
1341 -- and a SPECIALIZEd one:
1342 instance Outputable {-Id, i.e.:-}(GenId Type) where
1343 ppr sty id = pprId sty id
1345 showId :: PprStyle -> Id -> String
1346 showId sty id = show (pprId sty id)
1349 Default printing code (not used for interfaces):
1351 pprId :: Outputable ty => PprStyle -> GenId ty -> Doc
1353 pprId sty (Id u n _ _ prags _)
1354 = hcat [ppr sty n, pp_prags]
1356 pp_prags = ifPprDebug sty (case prags of
1357 IMustNotBeINLINEd -> text "{n}"
1358 IWantToBeINLINEd -> text "{i}"
1359 IMustBeINLINEd -> text "{I}"
1362 -- WDP 96/05/06: We can re-elaborate this as we go along...
1366 idUnique (Id u _ _ _ _ _) = u
1368 instance Uniquable (GenId ty) where
1371 instance NamedThing (GenId ty) where
1372 getName this_id@(Id u n _ details _ _) = n
1375 Note: The code generator doesn't carry a @UniqueSupply@, so it uses
1376 the @Uniques@ out of local @Ids@ given to it.
1378 %************************************************************************
1380 \subsection{@IdEnv@s and @IdSet@s}
1382 %************************************************************************
1385 type IdEnv elt = UniqFM elt
1387 nullIdEnv :: IdEnv a
1389 mkIdEnv :: [(GenId ty, a)] -> IdEnv a
1390 unitIdEnv :: GenId ty -> a -> IdEnv a
1391 addOneToIdEnv :: IdEnv a -> GenId ty -> a -> IdEnv a
1392 growIdEnv :: IdEnv a -> IdEnv a -> IdEnv a
1393 growIdEnvList :: IdEnv a -> [(GenId ty, a)] -> IdEnv a
1395 delManyFromIdEnv :: IdEnv a -> [GenId ty] -> IdEnv a
1396 delOneFromIdEnv :: IdEnv a -> GenId ty -> IdEnv a
1397 combineIdEnvs :: (a -> a -> a) -> IdEnv a -> IdEnv a -> IdEnv a
1398 mapIdEnv :: (a -> b) -> IdEnv a -> IdEnv b
1399 modifyIdEnv :: (a -> a) -> IdEnv a -> GenId ty -> IdEnv a
1400 rngIdEnv :: IdEnv a -> [a]
1402 isNullIdEnv :: IdEnv a -> Bool
1403 lookupIdEnv :: IdEnv a -> GenId ty -> Maybe a
1404 lookupNoFailIdEnv :: IdEnv a -> GenId ty -> a
1408 addOneToIdEnv = addToUFM
1409 combineIdEnvs = plusUFM_C
1410 delManyFromIdEnv = delListFromUFM
1411 delOneFromIdEnv = delFromUFM
1413 lookupIdEnv = lookupUFM
1416 nullIdEnv = emptyUFM
1420 growIdEnvList env pairs = plusUFM env (listToUFM pairs)
1421 isNullIdEnv env = sizeUFM env == 0
1422 lookupNoFailIdEnv env id = case (lookupIdEnv env id) of { Just xx -> xx }
1424 -- modifyIdEnv: Look up a thing in the IdEnv, then mash it with the
1425 -- modify function, and put it back.
1427 modifyIdEnv mangle_fn env key
1428 = case (lookupIdEnv env key) of
1430 Just xx -> addOneToIdEnv env key (mangle_fn xx)
1432 modifyIdEnv_Directly mangle_fn env key
1433 = case (lookupUFM_Directly env key) of
1435 Just xx -> addToUFM_Directly env key (mangle_fn xx)
1439 type GenIdSet ty = UniqSet (GenId ty)
1440 type IdSet = UniqSet (GenId Type)
1442 emptyIdSet :: GenIdSet ty
1443 intersectIdSets :: GenIdSet ty -> GenIdSet ty -> GenIdSet ty
1444 unionIdSets :: GenIdSet ty -> GenIdSet ty -> GenIdSet ty
1445 unionManyIdSets :: [GenIdSet ty] -> GenIdSet ty
1446 idSetToList :: GenIdSet ty -> [GenId ty]
1447 unitIdSet :: GenId ty -> GenIdSet ty
1448 addOneToIdSet :: GenIdSet ty -> GenId ty -> GenIdSet ty
1449 elementOfIdSet :: GenId ty -> GenIdSet ty -> Bool
1450 minusIdSet :: GenIdSet ty -> GenIdSet ty -> GenIdSet ty
1451 isEmptyIdSet :: GenIdSet ty -> Bool
1452 mkIdSet :: [GenId ty] -> GenIdSet ty
1454 emptyIdSet = emptyUniqSet
1455 unitIdSet = unitUniqSet
1456 addOneToIdSet = addOneToUniqSet
1457 intersectIdSets = intersectUniqSets
1458 unionIdSets = unionUniqSets
1459 unionManyIdSets = unionManyUniqSets
1460 idSetToList = uniqSetToList
1461 elementOfIdSet = elementOfUniqSet
1462 minusIdSet = minusUniqSet
1463 isEmptyIdSet = isEmptyUniqSet
1468 addId, nmbrId, nmbrDataCon :: Id -> NmbrM Id
1470 addId id@(Id u n ty det prag info) nenv@(NmbrEnv ui ut uu idenv tvenv uvenv)
1471 = case (lookupUFM_Directly idenv u) of
1472 Just xx -> trace "addId: already in map!" $
1475 if toplevelishId id then
1476 trace "addId: can't add toplevelish!" $
1478 else -- alloc a new unique for this guy
1479 -- and add an entry in the idenv
1480 -- NB: *** KNOT-TYING ***
1482 nenv_plus_id = NmbrEnv (incrUnique ui) ut uu
1483 (addToUFM_Directly idenv u new_id)
1486 (nenv2, new_ty) = nmbrType ty nenv_plus_id
1487 (nenv3, new_det) = nmbr_details det nenv2
1489 new_id = Id ui n new_ty new_det prag info
1493 nmbrId id@(Id u n ty det prag info) nenv@(NmbrEnv ui ut uu idenv tvenv uvenv)
1494 = case (lookupUFM_Directly idenv u) of
1495 Just xx -> (nenv, xx)
1497 if not (toplevelishId id) then
1498 trace "nmbrId: lookup failed" $
1502 (nenv2, new_ty) = nmbrType ty nenv
1503 (nenv3, new_det) = nmbr_details det nenv2
1505 new_id = Id u n new_ty new_det prag info
1509 -- used when renumbering TyCons to produce data decls...
1510 nmbrDataCon id@(Id _ _ _ (TupleConId _) _ _) nenv
1511 = (nenv, id) -- nothing to do for tuples
1513 nmbrDataCon id@(Id u n ty (DataConId tag marks fields tvs theta con_tvs con_theta arg_tys tc) prag info)
1514 nenv@(NmbrEnv ui ut uu idenv tvenv uvenv)
1515 = case (lookupUFM_Directly idenv u) of
1516 Just xx -> trace "nmbrDataCon: in env???\n" (nenv, xx)
1519 (nenv2, new_fields) = (mapNmbr nmbrField fields) nenv
1520 (nenv3, new_arg_tys) = (mapNmbr nmbrType arg_tys) nenv2
1522 new_det = DataConId tag marks new_fields (bottom "tvs") (bottom "theta") (bottom "tvs") (bottom "theta") new_arg_tys tc
1523 new_id = Id u n (bottom "ty") new_det prag info
1527 bottom msg = panic ("nmbrDataCon"++msg)
1530 nmbr_details :: IdDetails -> NmbrM IdDetails
1532 nmbr_details (DataConId tag marks fields tvs theta con_tvs con_theta arg_tys tc)
1533 = mapNmbr nmbrTyVar tvs `thenNmbr` \ new_tvs ->
1534 mapNmbr nmbrTyVar con_tvs `thenNmbr` \ new_con_tvs ->
1535 mapNmbr nmbrField fields `thenNmbr` \ new_fields ->
1536 mapNmbr nmbr_theta theta `thenNmbr` \ new_theta ->
1537 mapNmbr nmbr_theta con_theta `thenNmbr` \ new_con_theta ->
1538 mapNmbr nmbrType arg_tys `thenNmbr` \ new_arg_tys ->
1539 returnNmbr (DataConId tag marks new_fields new_tvs new_theta new_con_tvs new_con_theta new_arg_tys tc)
1542 = --nmbrClass c `thenNmbr` \ new_c ->
1543 nmbrType t `thenNmbr` \ new_t ->
1544 returnNmbr (c, new_t)
1546 -- ToDo:add more cases as needed
1547 nmbr_details other_details = returnNmbr other_details
1550 nmbrField (FieldLabel n ty tag)
1551 = nmbrType ty `thenNmbr` \ new_ty ->
1552 returnNmbr (FieldLabel n new_ty tag)