2 /* --------------------------------------------------------------------------
3 * Load symbols required from the Prelude
5 * The Hugs 98 system is Copyright (c) Mark P Jones, Alastair Reid, the
6 * Yale Haskell Group, and the Oregon Graduate Institute of Science and
7 * Technology, 1994-1999, All rights reserved. It is distributed as
8 * free software under the license in the file "License", which is
9 * included in the distribution.
11 * $RCSfile: link.c,v $
13 * $Date: 2000/02/08 15:32:30 $
14 * ------------------------------------------------------------------------*/
21 #include "Assembler.h" /* for asmPrimOps and AsmReps */
26 Type typeArrow; /* Function spaces */
34 Type typePrimByteArray;
36 Type typePrimMutableArray;
37 Type typePrimMutableByteArray;
46 #ifdef PROVIDE_FOREIGN
58 Class classEq; /* `standard' classes */
66 Class classReal; /* `numeric' classes */
70 Class classFractional;
73 Class classMonad; /* Monads and monads with a zero */
75 List stdDefaults; /* standard default values */
78 Name nameFalse; /* primitive boolean constructors */
80 Name nameCons; /* primitive list constructors */
81 Name nameUnit; /* primitive Unit type constructor */
85 Name nameFromDouble; /* coercion of numerics */
88 Name nameBind; /* for translating monad comps */
89 Name nameZero; /* for monads with a zero */
94 Name nameRunIO_toplevel;
98 Name nameUndefined; /* generic undefined value */
109 Name namePmFromInteger;
111 Name nameUnpackString;
114 Name nameCreateAdjThunk;
131 Name namePrimTakeMVar;
139 /* these names are required before we've had a chance to do the right thing */
141 Name nameUnsafeUnpackCString;
143 /* constructors used during translation and codegen */
144 Name nameMkC; /* Char# -> Char */
145 Name nameMkI; /* Int# -> Int */
146 Name nameMkInteger; /* Integer# -> Integer */
147 Name nameMkW; /* Word# -> Word */
148 Name nameMkA; /* Addr# -> Addr */
149 Name nameMkF; /* Float# -> Float */
150 Name nameMkD; /* Double# -> Double */
151 Name nameMkPrimArray;
152 Name nameMkPrimByteArray;
154 Name nameMkPrimMutableArray;
155 Name nameMkPrimMutableByteArray;
156 Name nameMkStable; /* StablePtr# a -> StablePtr a */
157 Name nameMkThreadId; /* ThreadId# -> ThreadId */
158 Name nameMkPrimMVar; /* MVar# a -> MVar a */
160 Name nameMkWeak; /* Weak# a -> Weak a */
162 #ifdef PROVIDE_FOREIGN
163 Name nameMkForeign; /* ForeignObj# -> ForeignObj */
183 Module modulePrelude;
188 /* --------------------------------------------------------------------------
189 * Frequently used type skeletons:
190 * ------------------------------------------------------------------------*/
192 Type arrow; /* mkOffset(0) -> mkOffset(1) */
193 Type boundPair; /* (mkOffset(0),mkOffset(0)) */
194 Type listof; /* [ mkOffset(0) ] */
195 Type typeVarToVar; /* mkOffset(0) -> mkOffset(0) */
197 Cell predNum; /* Num (mkOffset(0)) */
198 Cell predFractional; /* Fractional (mkOffset(0)) */
199 Cell predIntegral; /* Integral (mkOffset(0)) */
200 Kind starToStar; /* Type -> Type */
201 Cell predMonad; /* Monad (mkOffset(0)) */
202 Type typeProgIO; /* IO a */
205 /* --------------------------------------------------------------------------
207 * ------------------------------------------------------------------------*/
209 static Tycon linkTycon ( String s );
210 static Tycon linkClass ( String s );
211 static Name linkName ( String s );
212 static Name predefinePrim ( String s );
215 static Tycon linkTycon( String s )
217 Tycon tc = findTycon(findText(s));
218 if (nonNull(tc)) return tc;
220 tc = findTyconInAnyModule(findText(s));
221 if (nonNull(tc)) return tc;
223 fprintf(stderr, "frambozenvla! unknown tycon %s\n", s );
225 ERRMSG(0) "Prelude does not define standard type \"%s\"", s
229 static Class linkClass( String s )
231 Class cc = findClass(findText(s));
232 if (nonNull(cc)) return cc;
234 cc = findClassInAnyModule(findText(s));
235 if (nonNull(cc)) return cc;
237 fprintf(stderr, "frambozenvla! unknown class %s\n", s );
239 ERRMSG(0) "Prelude does not define standard class \"%s\"", s
243 static Name linkName( String s )
245 Name n = findName(findText(s));
246 if (nonNull(n)) return n;
248 n = findNameInAnyModule(findText(s));
249 if (nonNull(n)) return n;
251 fprintf(stderr, "frambozenvla! unknown name %s\n", s );
253 ERRMSG(0) "Prelude does not define standard name \"%s\"", s
257 static Name predefinePrim ( String s )
260 Text t = findText(s);
263 //fprintf(stderr, "predefinePrim: %s already exists\n", s );
266 name(nm).defn=PREDEFINED;
272 /* --------------------------------------------------------------------------
274 * ------------------------------------------------------------------------*/
276 /* In standalone mode, linkPreludeTC, linkPreludeCM and linkPreludeNames
277 are called, in that order, during static analysis of Prelude.hs.
278 In combined mode such an analysis does not happen. Instead these
279 calls will be made as a result of a call link(POSTPREL).
281 linkPreludeTC, linkPreludeCM and linkPreludeNames are needed in both
282 standalone and combined modes.
286 Void linkPreludeTC(void) { /* Hook to tycons and classes in */
287 static Bool initialised = FALSE; /* prelude when first loaded */
291 setCurrModule(modulePrelude);
293 typeChar = linkTycon("Char");
294 typeInt = linkTycon("Int");
295 typeInteger = linkTycon("Integer");
296 typeWord = linkTycon("Word");
297 typeAddr = linkTycon("Addr");
298 typePrimArray = linkTycon("PrimArray");
299 typePrimByteArray = linkTycon("PrimByteArray");
300 typeRef = linkTycon("STRef");
301 typePrimMutableArray = linkTycon("PrimMutableArray");
302 typePrimMutableByteArray = linkTycon("PrimMutableByteArray");
303 typeFloat = linkTycon("Float");
304 typeDouble = linkTycon("Double");
305 typeStable = linkTycon("StablePtr");
307 typeWeak = linkTycon("Weak");
309 # ifdef PROVIDE_FOREIGN
310 typeForeign = linkTycon("ForeignObj");
312 typeThreadId = linkTycon("ThreadId");
313 typeMVar = linkTycon("MVar");
314 typeBool = linkTycon("Bool");
315 typeST = linkTycon("ST");
316 typeIO = linkTycon("IO");
317 typeException = linkTycon("Exception");
318 typeString = linkTycon("String");
319 typeOrdering = linkTycon("Ordering");
321 classEq = linkClass("Eq");
322 classOrd = linkClass("Ord");
323 classIx = linkClass("Ix");
324 classEnum = linkClass("Enum");
325 classShow = linkClass("Show");
326 classRead = linkClass("Read");
327 classBounded = linkClass("Bounded");
328 classReal = linkClass("Real");
329 classIntegral = linkClass("Integral");
330 classRealFrac = linkClass("RealFrac");
331 classRealFloat = linkClass("RealFloat");
332 classFractional = linkClass("Fractional");
333 classFloating = linkClass("Floating");
334 classNum = linkClass("Num");
335 classMonad = linkClass("Monad");
338 stdDefaults = cons(typeDouble,stdDefaults);
340 stdDefaults = cons(typeInteger,stdDefaults);
342 stdDefaults = cons(typeInt,stdDefaults);
345 predNum = ap(classNum,aVar);
346 predFractional = ap(classFractional,aVar);
347 predIntegral = ap(classIntegral,aVar);
348 predMonad = ap(classMonad,aVar);
349 typeProgIO = ap(typeIO,aVar);
351 nameMkC = addPrimCfunREP(findText("C#"),1,0,CHAR_REP);
352 nameMkI = addPrimCfunREP(findText("I#"),1,0,INT_REP);
353 nameMkW = addPrimCfunREP(findText("W#"),1,0,WORD_REP);
354 nameMkA = addPrimCfunREP(findText("A#"),1,0,ADDR_REP);
355 nameMkF = addPrimCfunREP(findText("F#"),1,0,FLOAT_REP);
356 nameMkD = addPrimCfunREP(findText("D#"),1,0,DOUBLE_REP);
357 nameMkStable = addPrimCfunREP(findText("Stable#"),1,0,STABLE_REP);
358 nameMkThreadId = addPrimCfunREP(findText("ThreadId#"),1,0,THREADID_REP);
360 # ifdef PROVIDE_FOREIGN
361 nameMkForeign = addPrimCfunREP(findText("Foreign#"),1,0,0);
364 nameMkWeak = addPrimCfunREP(findText("Weak#"),1,0,0);
366 nameMkPrimArray = addPrimCfunREP(findText("PrimArray#"),1,0,0);
367 nameMkPrimByteArray = addPrimCfunREP(findText("PrimByteArray#"),1,0,0);
368 nameMkRef = addPrimCfunREP(findText("STRef#"),1,0,0);
369 nameMkPrimMutableArray = addPrimCfunREP(findText("PrimMutableArray#"),1,0,0);
370 nameMkPrimMutableByteArray = addPrimCfunREP(findText("PrimMutableByteArray#"),1,0,0);
371 nameMkPrimMVar = addPrimCfunREP(findText("MVar#"),1,0,0);
372 nameMkInteger = addPrimCfunREP(findText("Integer#"),1,0,0);
374 name(namePrimSeq).type = primType(MONAD_Id, "ab", "b");
375 name(namePrimCatch).type = primType(MONAD_Id, "aH", "a");
376 name(namePrimRaise).type = primType(MONAD_Id, "E", "a");
378 /* This is a lie. For a more accurate type of primTakeMVar
379 see ghc/interpreter/lib/Prelude.hs.
381 name(namePrimTakeMVar).type = primType(MONAD_Id, "rbc", "d");
384 for (i=2; i<=NUM_DTUPLES; i++) {/* Add derived instances of tuples */
385 addTupInst(classEq,i);
386 addTupInst(classOrd,i);
387 addTupInst(classIx,i);
388 addTupInst(classShow,i);
389 addTupInst(classRead,i);
390 addTupInst(classBounded,i);
396 Void linkPreludeCM(void) { /* Hook to cfuns and mfuns in */
397 static Bool initialised = FALSE; /* prelude when first loaded */
402 setCurrModule(modulePrelude);
405 nameFalse = linkName("False");
406 nameTrue = linkName("True");
409 nameEq = linkName("==");
410 nameFromInt = linkName("fromInt");
411 nameFromInteger = linkName("fromInteger");
412 nameFromDouble = linkName("fromDouble");
413 nameReturn = linkName("return");
414 nameBind = linkName(">>=");
415 nameLe = linkName("<=");
416 nameGt = linkName(">");
417 nameShowsPrec = linkName("showsPrec");
418 nameReadsPrec = linkName("readsPrec");
419 nameEQ = linkName("EQ");
420 nameCompare = linkName("compare");
421 nameMinBnd = linkName("minBound");
422 nameMaxBnd = linkName("maxBound");
423 nameRange = linkName("range");
424 nameIndex = linkName("index");
425 namePlus = linkName("+");
426 nameMult = linkName("*");
427 nameRangeSize = linkName("rangeSize");
428 nameInRange = linkName("inRange");
429 nameMinus = linkName("-");
430 /* These come before calls to implementPrim */
432 for(i=0; i<NUM_TUPLES; ++i) {
433 if (i != 1) implementTuple(i);
439 Void linkPreludeNames(void) { /* Hook to names defined in Prelude */
440 static Bool initialised = FALSE;
445 setCurrModule(modulePrelude);
448 nameMkIO = linkName("hugsprimMkIO");
451 for (i=0; asmPrimOps[i].name; ++i) {
452 Text t = findText(asmPrimOps[i].name);
453 Name n = findName(t);
459 name(n).type = primType(asmPrimOps[i].monad,
461 asmPrimOps[i].results);
462 name(n).arity = strlen(asmPrimOps[i].args);
463 name(n).primop = &(asmPrimOps[i]);
467 /* static(tidyInfix) */
468 nameNegate = linkName("negate");
470 nameRunIO_toplevel = linkName("hugsprimRunIO_toplevel");
471 nameShow = linkName("show");
472 namePutStr = linkName("putStr");
473 namePrint = linkName("print");
475 nameOtherwise = linkName("otherwise");
476 nameUndefined = linkName("undefined");
479 namePmSub = linkName("hugsprimPmSub");
482 nameEqChar = linkName("hugsprimEqChar");
483 nameCreateAdjThunk = linkName("hugsprimCreateAdjThunk");
484 namePmInt = linkName("hugsprimPmInt");
485 namePmInteger = linkName("hugsprimPmInteger");
486 namePmDouble = linkName("hugsprimPmDouble");
488 namePmFromInteger = linkName("hugsprimPmFromInteger");
489 namePmSubtract = linkName("hugsprimPmSubtract");
490 namePmLe = linkName("hugsprimPmLe");
493 implementCfun ( nameCons, NIL );
494 implementCfun ( nameNil, NIL );
495 implementCfun ( nameUnit, NIL );
501 /* --------------------------------------------------------------------------
503 * ------------------------------------------------------------------------*/
505 /* ToDo: fix pFun (or eliminate its use) */
506 #define pFun(n,s) n = predefinePrim(s)
508 Void linkControl(what)
512 //case EXIT : fooble();break;
518 Module modulePrelBase = findModule(findText("PrelBase"));
519 assert(nonNull(modulePrelBase));
520 fprintf(stderr, "linkControl(POSTPREL)\n");
521 setCurrModule(modulePrelude);
526 nameUnpackString = linkName("hugsprimUnpackString");
527 namePMFail = linkName("hugsprimPmFail");
528 assert(nonNull(namePMFail));
529 #define xyzzy(aaa,bbb) aaa = linkName(bbb)
533 xyzzy(nameSel, "_SEL");
535 /* strict constructors */
536 xyzzy(nameFlip, "flip" );
539 xyzzy(nameFromTo, "enumFromTo");
540 xyzzy(nameFromThenTo, "enumFromThenTo");
541 xyzzy(nameFrom, "enumFrom");
542 xyzzy(nameFromThen, "enumFromThen");
545 xyzzy(nameApp, "++");
546 xyzzy(nameReadField, "readField");
547 xyzzy(nameReadParen, "readParen");
548 xyzzy(nameShowField, "showField");
549 xyzzy(nameShowParen, "showParen");
550 xyzzy(nameLex, "lex");
551 xyzzy(nameComp, ".");
552 xyzzy(nameAnd, "&&");
553 xyzzy(nameCompAux, "hugsprimCompAux");
554 xyzzy(nameMap, "map");
556 /* implementTagToCon */
557 xyzzy(nameError, "hugsprimError");
559 typeStable = linkTycon("Stable");
560 typeRef = linkTycon("IORef");
561 // {Prim,PrimByte,PrimMutable,PrimMutableByte}Array ?
563 ifLinkConstrItbl ( nameFalse );
564 ifLinkConstrItbl ( nameTrue );
565 ifLinkConstrItbl ( nameNil );
566 ifLinkConstrItbl ( nameCons );
572 Module modulePrelBase;
574 modulePrelude = findFakeModule(textPrelude);
575 module(modulePrelude).objectExtraNames
576 = singleton(findText("libHS_cbits"));
578 nameMkC = addWiredInBoxingTycon("PrelBase", "Char", "C#",CHAR_REP, STAR );
579 nameMkI = addWiredInBoxingTycon("PrelBase", "Int", "I#",INT_REP, STAR );
580 nameMkW = addWiredInBoxingTycon("PrelAddr", "Word", "W#",WORD_REP, STAR );
581 nameMkA = addWiredInBoxingTycon("PrelAddr", "Addr", "A#",ADDR_REP, STAR );
582 nameMkF = addWiredInBoxingTycon("PrelFloat","Float", "F#",FLOAT_REP, STAR );
583 nameMkD = addWiredInBoxingTycon("PrelFloat","Double","D#",DOUBLE_REP, STAR );
585 = addWiredInBoxingTycon("PrelNum","Integer","Integer#",0 ,STAR );
587 = addWiredInBoxingTycon("PrelGHC","ByteArray","PrimByteArray#",0 ,STAR );
589 for (i=0; i<NUM_TUPLES; ++i) {
590 if (i != 1) addTupleTycon(i);
592 addWiredInEnumTycon("PrelBase","Bool",
593 doubleton(findText("False"),findText("True")));
596 // = addWiredInBoxingTycon("PrelConc","ThreadId","ThreadId#"
597 // ,1,0,THREADID_REP);
599 setCurrModule(modulePrelude);
601 typeArrow = addPrimTycon(findText("(->)"),
602 pair(STAR,pair(STAR,STAR)),
606 pFun(nameInd, "_indirect");
607 name(nameInd).number = DFUNNAME;
609 /* newtype and USE_NEWTYPE_FOR_DICTS */
610 /* make a name entry for PrelBase.id _before_ loading Prelude
611 since ifSetClassDefaultsAndDCon() may need to refer to
614 modulePrelBase = findModule(findText("PrelBase"));
615 setCurrModule(modulePrelBase);
617 setCurrModule(modulePrelude);
621 modulePrelude = newModule(textPrelude);
622 setCurrModule(modulePrelude);
624 for (i=0; i<NUM_TUPLES; ++i) {
625 if (i != 1) addTupleTycon(i);
627 setCurrModule(modulePrelude);
629 typeArrow = addPrimTycon(findText("(->)"),
630 pair(STAR,pair(STAR,STAR)),
633 /* newtype and USE_NEWTYPE_FOR_DICTS */
637 pFun(nameInd, "_indirect");
638 name(nameInd).number = DFUNNAME;
641 pFun(nameSel, "_SEL");
643 /* strict constructors */
644 pFun(nameFlip, "flip" );
647 pFun(nameFromTo, "enumFromTo");
648 pFun(nameFromThenTo, "enumFromThenTo");
649 pFun(nameFrom, "enumFrom");
650 pFun(nameFromThen, "enumFromThen");
654 pFun(nameReadField, "readField");
655 pFun(nameReadParen, "readParen");
656 pFun(nameShowField, "showField");
657 pFun(nameShowParen, "showParen");
658 pFun(nameLex, "lex");
661 pFun(nameCompAux, "hugsprimCompAux");
662 pFun(nameMap, "map");
664 /* implementTagToCon */
665 pFun(namePMFail, "hugsprimPmFail");
666 pFun(nameError, "error");
667 pFun(nameUnpackString, "hugsprimUnpackString");
669 /* hooks for handwritten bytecode */
670 pFun(namePrimSeq, "primSeq");
671 pFun(namePrimCatch, "primCatch");
672 pFun(namePrimRaise, "primRaise");
673 pFun(namePrimTakeMVar, "primTakeMVar");
675 StgVar vv = mkStgVar(NIL,NIL);
676 Name n = namePrimSeq;
680 vv = mkStgVar(NIL,NIL);
681 stgVarInfo(vv) = mkPtr ( asm_BCO_seq() );
683 stgGlobals=cons(pair(n,vv),stgGlobals);
687 StgVar vv = mkStgVar(NIL,NIL);
688 Name n = namePrimCatch;
692 stgVarInfo(vv) = mkPtr ( asm_BCO_catch() );
694 stgGlobals=cons(pair(n,vv),stgGlobals);
697 StgVar vv = mkStgVar(NIL,NIL);
698 Name n = namePrimRaise;
702 stgVarInfo(vv) = mkPtr ( asm_BCO_raise() );
704 stgGlobals=cons(pair(n,vv),stgGlobals);
707 StgVar vv = mkStgVar(NIL,NIL);
708 Name n = namePrimTakeMVar;
712 stgVarInfo(vv) = mkPtr ( asm_BCO_takeMVar() );
714 stgGlobals=cons(pair(n,vv),stgGlobals);
723 /*-------------------------------------------------------------------------*/