2 /* --------------------------------------------------------------------------
3 * Primitives for manipulating global data structures
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: storage.c,v $
13 * $Date: 2000/03/10 17:30:36 $
14 * ------------------------------------------------------------------------*/
24 /*#define DEBUG_SHOWUSE*/
26 /* --------------------------------------------------------------------------
27 * local function prototypes:
28 * ------------------------------------------------------------------------*/
30 static Int local hash Args((String));
31 static Int local saveText Args((Text));
32 static Module local findQualifier Args((Text));
33 static Void local hashTycon Args((Tycon));
34 static List local insertTycon Args((Tycon,List));
35 static Void local hashName Args((Name));
36 static List local insertName Args((Name,List));
37 static Void local patternError Args((String));
38 static Bool local stringMatch Args((String,String));
39 static Bool local typeInvolves Args((Type,Type));
40 static Cell local markCell Args((Cell));
41 static Void local markSnd Args((Cell));
42 static Cell local lowLevelLastIn Args((Cell));
43 static Cell local lowLevelLastOut Args((Cell));
44 Module local moduleOfScript Args((Script));
45 Script local scriptThisFile Args((Text));
47 /* --------------------------------------------------------------------------
50 * provides storage for the characters making up identifier and symbol
51 * names, string literals, character constants etc...
53 * All character strings are stored in a large character array, with textHw
54 * pointing to the next free position. Lookup in the array is improved using
55 * a hash table. Internally, text strings are represented by integer offsets
56 * from the beginning of the array to the string in question.
58 * Where memory permits, the use of multiple hashtables gives a significant
59 * increase in performance, particularly when large source files are used.
61 * Each string in the array is terminated by a zero byte. No string is
62 * stored more than once, so that it is safe to test equality of strings by
63 * comparing the corresponding offsets.
65 * Special text values (beyond the range of the text array table) are used
66 * to generate unique `new variable names' as required.
68 * The same text storage is also used to hold text values stored in a saved
69 * expression. This grows downwards from the top of the text table (and is
70 * not included in the hash table).
71 * ------------------------------------------------------------------------*/
73 #define TEXTHSZ 512 /* Size of Text hash table */
74 #define NOTEXT ((Text)(~0)) /* Empty bucket in Text hash table */
75 static Text textHw; /* Next unused position */
76 static Text savedText = NUM_TEXT; /* Start of saved portion of text */
77 static Text nextNewText; /* Next new text value */
78 static Text nextNewDText; /* Next new dict text value */
79 static char DEFTABLE(text,NUM_TEXT);/* Storage of character strings */
80 static Text textHash[TEXTHSZ][NUM_TEXTH]; /* Hash table storage */
82 String textToStr(t) /* find string corresp to given Text*/
84 static char newVar[16];
86 if (0<=t && t<NUM_TEXT) /* standard char string */
89 sprintf(newVar,"d%d",-t); /* dictionary variable */
91 sprintf(newVar,"v%d",t-NUM_TEXT); /* normal variable */
95 String identToStr(v) /*find string corresp to given ident or qualified name*/
98 internal("identToStr");
104 case CONOPCELL : return text+textOf(v);
106 case QUALIDENT : { Text pos = textHw;
108 while (pos+1 < savedText && text[t]!=0) {
109 text[pos++] = text[t++];
111 if (pos+1 < savedText) {
115 while (pos+1 < savedText && text[t]!=0) {
116 text[pos++] = text[t++];
122 internal("identToStr2");
123 return 0; /* NOTREACHED */
126 Text inventText() { /* return new unused variable name */
127 return nextNewText++;
130 Text inventDictText() { /* return new unused dictvar name */
131 return nextNewDText--;
134 Bool inventedText(t) /* Signal TRUE if text has been */
135 Text t; { /* generated internally */
136 return (t<0 || t>=NUM_TEXT);
139 #define MAX_FIXLIT 100
140 Text fixLitText(t) /* fix literal text that might include \ */
142 String s = textToStr(t);
145 for(i = 0;i < MAX_FIXLIT-2 && *s;s++) {
151 if (i < MAX_FIXLIT-2) {
154 ERRMSG(0) "storage space exhausted for internal literal string"
157 return (findText(p));
161 static Int local hash(s) /* Simple hash function on strings */
165 for (v=((int)(*s))*8; *s; s++)
166 v += ((int)(*s))*(j++);
172 Text findText(s) /* Locate string in Text array */
176 Text textPos = textHash[h][hashno];
178 #define TryMatch { Text originalTextPos = textPos; \
180 for (t=s; *t==text[textPos]; textPos++,t++) \
182 return originalTextPos; \
184 #define Skip while (text[textPos++]) ;
186 while (textPos!=NOTEXT) {
188 if (++hashno<NUM_TEXTH) /* look in next hashtable entry */
189 textPos = textHash[h][hashno];
192 while (textPos < textHw) {
203 textPos = textHw; /* if not found, save in array */
204 if (textHw + (Int)strlen(s) + 1 > savedText) {
205 ERRMSG(0) "Character string storage space exhausted"
208 while ((text[textHw++] = *s++) != 0) {
210 if (hashno<NUM_TEXTH) { /* updating hash table as necessary */
211 textHash[h][hashno] = textPos;
212 if (hashno<NUM_TEXTH-1)
213 textHash[h][hashno+1] = NOTEXT;
219 static Int local saveText(t) /* Save text value in buffer */
220 Text t; { /* at top of text table */
221 String s = textToStr(t);
224 if (textHw + l + 1 > savedText) {
225 ERRMSG(0) "Character string storage space exhausted"
229 strcpy(text+savedText,s);
234 static int fromHexDigit ( char c )
237 case '0': case '1': case '2': case '3': case '4':
238 case '5': case '6': case '7': case '8': case '9':
240 case 'a': case 'A': return 10;
241 case 'b': case 'B': return 11;
242 case 'c': case 'C': return 12;
243 case 'd': case 'D': return 13;
244 case 'e': case 'E': return 14;
245 case 'f': case 'F': return 15;
251 /* returns findText (unZencode s) */
252 Text unZcodeThenFindText ( String s )
259 nn = 100 + 10 * strlen(s);
261 if (!p) internal ("unZcodeThenFindText: malloc failed");
266 if (n > nn-90) internal ("unZcodeThenFindText: result is too big");
267 if (*s != 'z' && *s != 'Z') {
272 if (!(*s)) goto parse_error;
274 case 'Z': p[n++] = 'Z'; break;
275 case 'C': p[n++] = ':'; break;
276 case 'L': p[n++] = '('; break;
277 case 'R': p[n++] = ')'; break;
278 case 'M': p[n++] = '['; break;
279 case 'N': p[n++] = ']'; break;
280 case 'z': p[n++] = 'z'; break;
281 case 'a': p[n++] = '&'; break;
282 case 'b': p[n++] = '|'; break;
283 case 'd': p[n++] = '$'; break;
284 case 'e': p[n++] = '='; break;
285 case 'g': p[n++] = '>'; break;
286 case 'h': p[n++] = '#'; break;
287 case 'i': p[n++] = '.'; break;
288 case 'l': p[n++] = '<'; break;
289 case 'm': p[n++] = '-'; break;
290 case 'n': p[n++] = '!'; break;
291 case 'p': p[n++] = '+'; break;
292 case 'q': p[n++] = '\\'; break;
293 case 'r': p[n++] = '\''; break;
294 case 's': p[n++] = '/'; break;
295 case 't': p[n++] = '*'; break;
296 case 'u': p[n++] = '^'; break;
297 case 'v': p[n++] = '%'; break;
299 if (!s[0] || !s[1]) goto parse_error;
300 if (fromHexDigit(s[0]) < 0 || fromHexDigit(s[1]) < 0) goto parse_error;
301 p[n++] = 16 * fromHexDigit(s[0]) + fromHexDigit(s[1]);
304 case '0': case '1': case '2': case '3': case '4':
305 case '5': case '6': case '7': case '8': case '9':
308 while (*s && isdigit((int)(*s))) {
309 i = 10 * i + (*s - '0');
312 if (*s != 'T') goto parse_error;
315 while (i > 0) { p[n++] = ','; i--; };
329 fprintf ( stderr, "\nstring = `%s'\n", s );
330 internal ( "unZcodeThenFindText: parse error on above string");
331 return NIL; /*notreached*/
335 Text enZcodeThenFindText ( String s )
340 char toHex[16] = "0123456789ABCDEF";
343 nn = 100 + 10 * strlen(s);
345 if (!p) internal ("enZcodeThenFindText: malloc failed");
349 if (n > nn-90) internal ("enZcodeThenFindText: result is too big");
352 && (isalnum((int)(*s)) || *s == '_')) {
360 while (*s && *s==',') { s++; tup++; };
361 if (*s != ')') internal("enZcodeThenFindText: invalid tuple type");
364 sprintf(num,"%d",tup);
365 p[n] = 0; strcat ( &(p[n]), num ); n += strlen(num);
370 case '(': p[n++] = 'Z'; p[n++] = 'L'; break;
371 case ')': p[n++] = 'Z'; p[n++] = 'R'; break;
372 case '[': p[n++] = 'Z'; p[n++] = 'M'; break;
373 case ']': p[n++] = 'Z'; p[n++] = 'N'; break;
374 case ':': p[n++] = 'Z'; p[n++] = 'C'; break;
375 case 'Z': p[n++] = 'Z'; p[n++] = 'Z'; break;
376 case 'z': p[n++] = 'z'; p[n++] = 'z'; break;
377 case '&': p[n++] = 'z'; p[n++] = 'a'; break;
378 case '|': p[n++] = 'z'; p[n++] = 'b'; break;
379 case '$': p[n++] = 'z'; p[n++] = 'd'; break;
380 case '=': p[n++] = 'z'; p[n++] = 'e'; break;
381 case '>': p[n++] = 'z'; p[n++] = 'g'; break;
382 case '#': p[n++] = 'z'; p[n++] = 'h'; break;
383 case '.': p[n++] = 'z'; p[n++] = 'i'; break;
384 case '<': p[n++] = 'z'; p[n++] = 'l'; break;
385 case '-': p[n++] = 'z'; p[n++] = 'm'; break;
386 case '!': p[n++] = 'z'; p[n++] = 'n'; break;
387 case '+': p[n++] = 'z'; p[n++] = 'p'; break;
388 case '\'': p[n++] = 'z'; p[n++] = 'q'; break;
389 case '\\': p[n++] = 'z'; p[n++] = 'r'; break;
390 case '/': p[n++] = 'z'; p[n++] = 's'; break;
391 case '*': p[n++] = 'z'; p[n++] = 't'; break;
392 case '^': p[n++] = 'z'; p[n++] = 'u'; break;
393 case '%': p[n++] = 'z'; p[n++] = 'v'; break;
394 default: s--; p[n++] = 'z'; p[n++] = 'x';
395 p[n++] = toHex[(int)(*s)/16];
396 p[n++] = toHex[(int)(*s)%16];
407 Text textOf ( Cell c )
410 (whatIs(c)==VARIDCELL
411 || whatIs(c)==CONIDCELL
412 || whatIs(c)==VAROPCELL
413 || whatIs(c)==CONOPCELL
414 || whatIs(c)==STRCELL
415 || whatIs(c)==DICTVAR
420 fprintf(stderr, "\ntextOf: bad tag %d\n",whatIs(c) );
421 internal("textOf: bad tag");
426 /* --------------------------------------------------------------------------
429 * Currently, the only attributes that we store for each Ext value is the
430 * corresponding Text label. At some later stage, we may decide to cache
431 * types, predicates, etc. here as a space saving gesture. Given that Text
432 * comparison is cheap, and that this is an experimental implementation, we
433 * will use a straightforward linear search to locate Ext values from their
434 * corresponding Text labels; a hashing scheme can be introduced later if
435 * this turns out to be a problem.
436 * ------------------------------------------------------------------------*/
439 Text DEFTABLE(tabExt,NUM_EXT); /* Storage for Ext names */
442 Ext mkExt(t) /* Allocate or find an Ext value */
448 if (extHw-EXTMIN >= NUM_EXT) {
449 ERRMSG(0) "Ext storage space exhausted"
457 /* --------------------------------------------------------------------------
460 * A Tycon represents a user defined type constructor. Tycons are indexed
461 * by Text values ... a very simple hash function is used to improve lookup
462 * times. Tycon entries with the same hash code are chained together, with
463 * the most recent entry at the front of the list.
464 * ------------------------------------------------------------------------*/
466 #define TYCONHSZ 256 /* Size of Tycon hash table*/
467 #define tHash(x) ((x)%TYCONHSZ) /* Tycon hash function */
468 static Tycon tyconHw; /* next unused Tycon */
469 static Tycon DEFTABLE(tyconHash,TYCONHSZ); /* Hash table storage */
470 struct strTycon DEFTABLE(tabTycon,NUM_TYCON); /* Tycon storage */
472 Tycon newTycon(t) /* add new tycon to tycon table */
475 if (tyconHw-TYCMIN >= NUM_TYCON) {
476 ERRMSG(0) "Type constructor storage space exhausted"
479 tycon(tyconHw).text = t; /* clear new tycon record */
480 tycon(tyconHw).kind = NIL;
481 tycon(tyconHw).defn = NIL;
482 tycon(tyconHw).what = NIL;
483 tycon(tyconHw).conToTag = NIL;
484 tycon(tyconHw).tagToCon = NIL;
485 tycon(tyconHw).tuple = -1;
486 tycon(tyconHw).mod = currentModule;
487 tycon(tyconHw).itbl = NULL;
488 module(currentModule).tycons = cons(tyconHw,module(currentModule).tycons);
489 tycon(tyconHw).nextTyconHash = tyconHash[h];
490 tyconHash[h] = tyconHw;
495 Tycon findTycon(t) /* locate Tycon in tycon table */
497 Tycon tc = tyconHash[tHash(t)];
499 while (nonNull(tc) && tycon(tc).text!=t)
500 tc = tycon(tc).nextTyconHash;
504 Tycon addTycon(tc) /* Insert Tycon in tycon table - if no clash is caused */
507 assert(whatIs(tc)==TYCON || whatIs(tc)==TUPLE);
508 oldtc = findTycon(tycon(tc).text);
511 module(currentModule).tycons=cons(tc,module(currentModule).tycons);
517 static Void local hashTycon(tc) /* Insert Tycon into hash table */
519 if (!(isTycon(tc) || isTuple(tc))) {
520 printf("\nbad stuff: " ); print(tc,10); printf("\n");
521 assert(isTycon(tc) || isTuple(tc));
524 Text t = tycon(tc).text;
526 tycon(tc).nextTyconHash = tyconHash[h];
531 Tycon findQualTycon(id) /*locate (possibly qualified) Tycon in tycon table */
533 if (!isPair(id)) internal("findQualTycon");
537 return findTycon(textOf(id));
539 Text t = qtextOf(id);
540 Module m = findQualifier(qmodOf(id));
542 if (isNull(m)) return NIL;
543 for(es=module(m).exports; nonNull(es); es=tl(es)) {
545 if (isPair(e) && isTycon(fst(e)) && tycon(fst(e)).text==t)
550 default : internal("findQualTycon2");
552 return NIL; /* NOTREACHED */
555 Tycon addPrimTycon(t,kind,ar,what,defn) /* add new primitive type constr */
561 Tycon tc = newTycon(t);
563 tycon(tc).kind = kind;
564 tycon(tc).what = what;
565 tycon(tc).defn = defn;
566 tycon(tc).arity = ar;
570 static List local insertTycon(tc,ts) /* insert tycon tc into sorted list*/
575 String s = textToStr(tycon(tc).text);
577 while (nonNull(curr) && strCompare(s,textToStr(tycon(hd(curr)).text))>=0) {
578 if (hd(curr)==tc) /* just in case we get duplicates! */
584 tl(prev) = cons(tc,curr);
588 return cons(tc,curr);
591 List addTyconsMatching(pat,ts) /* Add tycons matching pattern pat */
592 String pat; /* to list of Tycons ts */
593 List ts; { /* Null pattern matches every tycon*/
594 Tycon tc; /* (Tycons with NIL kind excluded) */
595 for (tc=TYCMIN; tc<tyconHw; ++tc)
596 if (!pat || stringMatch(pat,textToStr(tycon(tc).text)))
597 if (nonNull(tycon(tc).kind))
598 ts = insertTycon(tc,ts);
602 Text ghcTupleText_n ( Int n )
607 if (n < 0 || n >= 100) internal("ghcTupleText_n");
608 if (n == 1) internal("ghcTupleText_n==1");
610 for (i = 1; i <= n-1; i++) buf[x++] = ',';
613 return findText(buf);
616 Text ghcTupleText(tup)
619 assert(isTuple(tup));
621 return ghcTupleText_n ( tupleOf(tup) );
625 Tycon mkTuple ( Int n )
629 internal("mkTuple: request for tuple of unsupported size");
630 for (i = TYCMIN; i < tyconHw; i++)
631 if (tycon(i).tuple == n) return i;
632 internal("mkTuple: request for non-existent tuple");
636 /* --------------------------------------------------------------------------
639 * A Name represents a top level binding of a value to an identifier.
640 * Such values may be a constructor function, a member function in a
641 * class, a user-defined or primitive value/function.
643 * Names are indexed by Text values ... a very simple hash functions speeds
644 * access to the table of Names and Name entries with the same hash value
645 * are chained together, with the most recent entry at the front of the
647 * ------------------------------------------------------------------------*/
649 #define NAMEHSZ 256 /* Size of Name hash table */
650 #define nHash(x) ((x)%NAMEHSZ) /* hash fn :: Text->Int */
651 Name nameHw; /* next unused name */
652 static Name DEFTABLE(nameHash,NAMEHSZ); /* Hash table storage */
653 struct strName DEFTABLE(tabName,NUM_NAME); /* Name table storage */
655 Name newName(t,parent) /* Add new name to name table */
659 if (nameHw-NAMEMIN >= NUM_NAME) {
660 ERRMSG(0) "Name storage space exhausted"
663 name(nameHw).text = t; /* clear new name record */
664 name(nameHw).line = 0;
665 name(nameHw).syntax = NO_SYNTAX;
666 name(nameHw).parent = parent;
667 name(nameHw).arity = 0;
668 name(nameHw).number = EXECNAME;
669 name(nameHw).defn = NIL;
670 name(nameHw).stgVar = NIL;
671 name(nameHw).callconv = NIL;
672 name(nameHw).type = NIL;
673 name(nameHw).primop = 0;
674 name(nameHw).mod = currentModule;
675 name(nameHw).itbl = NULL;
676 module(currentModule).names=cons(nameHw,module(currentModule).names);
677 name(nameHw).nextNameHash = nameHash[h];
678 nameHash[h] = nameHw;
682 Name findName(t) /* Locate name in name table */
684 Name n = nameHash[nHash(t)];
686 while (nonNull(n) && name(n).text!=t)
687 n = name(n).nextNameHash;
691 Name addName(nm) /* Insert Name in name table - if */
692 Name nm; { /* no clash is caused */
694 assert(whatIs(nm)==NAME);
695 oldnm = findName(name(nm).text);
698 module(currentModule).names=cons(nm,module(currentModule).names);
704 static Void local hashName(nm) /* Insert Name into hash table */
711 name(nm).nextNameHash = nameHash[h];
715 Name findQualName(id) /* Locate (possibly qualified) name*/
716 Cell id; { /* in name table */
718 internal("findQualName");
724 return findName(textOf(id));
726 Text t = qtextOf(id);
727 Module m = findQualifier(qmodOf(id));
729 if (isNull(m)) return NIL;
730 for(es=module(m).exports; nonNull(es); es=tl(es)) {
732 if (isName(e) && name(e).text==t)
734 else if (isPair(e) && DOTDOT==snd(e)) {
735 List subentities = NIL;
738 && (tycon(c).what==DATATYPE || tycon(c).what==NEWTYPE))
739 subentities = tycon(c).defn;
741 subentities = cclass(c).members;
742 for(; nonNull(subentities); subentities=tl(subentities)) {
743 if (!isName(hd(subentities)))
744 internal("findQualName3");
745 if (name(hd(subentities)).text == t)
746 return hd(subentities);
752 default : internal("findQualName2");
754 return 0; /* NOTREACHED */
758 Name nameFromStgVar ( StgVar v )
761 for (n = NAMEMIN; n < nameHw; n++)
762 if (name(n).stgVar == v) return n;
766 void* getHugs_AsmObject_for ( char* s )
769 Text t = findText(s);
771 for (n = NAMEMIN; n < nameHw; n++)
772 if (name(n).text == t) break;
774 fprintf ( stderr, "can't find `%s' in ...\n", s );
775 internal("getHugs_AsmObject_for(1)");
778 if (!isStgVar(v) || !isPtr(stgVarInfo(v)))
779 internal("getHugs_AsmObject_for(2)");
780 return ptrOf(stgVarInfo(v));
783 /* --------------------------------------------------------------------------
784 * Primitive functions:
785 * ------------------------------------------------------------------------*/
787 Module findFakeModule ( Text t )
789 Module m = findModule(t);
791 if (!module(m).fake) internal("findFakeModule");
794 module(m).fake = TRUE;
800 Name addWiredInBoxingTycon
801 ( String modNm, String typeNm, String constrNm,
806 Text modT = findText(modNm);
807 Text typeT = findText(typeNm);
808 Text conT = findText(constrNm);
809 Module m = findFakeModule(modT);
812 n = newName(conT,NIL);
814 name(n).number = cfunNo(0);
816 name(n).primop = (void*)rep;
819 tycon(t).what = DATATYPE;
820 tycon(t).kind = kind;
825 Tycon addTupleTycon ( Int n )
833 for (i = TYCMIN; i < tyconHw; i++)
834 if (tycon(i).tuple == n) return i;
837 m = findFakeModule(findText(n==0 ? "PrelBase" : "PrelTup")); else
838 m = findModule(findText("Prelude"));
842 for (i = 0; i < n; i++) k = ap(STAR,k);
843 t = newTycon(ghcTupleText_n(n));
846 tycon(t).what = DATATYPE;
849 /* maybe we want to do this for all n ? */
850 nm = newName(ghcTupleText_n(n), t);
851 name(nm).type = t; /* ummm ... for n > 0 */
858 Tycon addWiredInEnumTycon ( String modNm, String typeNm,
859 List /*of Text*/ constrs )
863 Text modT = findText(modNm);
864 Text typeT = findText(typeNm);
865 Module m = findFakeModule(modT);
869 tycon(t).kind = STAR;
870 tycon(t).what = DATATYPE;
872 constrs = reverse(constrs);
874 for (; nonNull(constrs); constrs=tl(constrs),i--) {
875 Text conT = hd(constrs);
876 Name con = newName(conT,t);
877 name(con).number = cfunNo(i);
879 name(con).parent = t;
880 tycon(t).defn = cons(con, tycon(t).defn);
886 Name addPrimCfunREP(t,arity,no,rep) /* add primitive constructor func */
887 Text t; /* sets rep, not type */
890 Int rep; { /* Really AsmRep */
891 Name n = newName(t,NIL);
892 name(n).arity = arity;
893 name(n).number = cfunNo(no);
895 name(n).primop = (void*)rep;
900 Name addPrimCfun(t,arity,no,type) /* add primitive constructor func */
905 Name n = newName(t,NIL);
906 name(n).arity = arity;
907 name(n).number = cfunNo(no);
913 Int sfunPos(s,c) /* Find position of field with */
914 Name s; /* selector s in constructor c. */
918 for (; nonNull(cns); cns=tl(cns))
920 return intOf(snd(hd(cns)));
922 return 0;/* NOTREACHED */
925 static List local insertName(nm,ns) /* insert name nm into sorted list */
930 String s = textToStr(name(nm).text);
932 while (nonNull(curr) && strCompare(s,textToStr(name(hd(curr)).text))>=0) {
933 if (hd(curr)==nm) /* just in case we get duplicates! */
939 tl(prev) = cons(nm,curr);
943 return cons(nm,curr);
946 List addNamesMatching(pat,ns) /* Add names matching pattern pat */
947 String pat; /* to list of names ns */
948 List ns; { /* Null pattern matches every name */
949 Name nm; /* (Names with NIL type, or hidden */
951 for (nm=NAMEMIN; nm<nameHw; ++nm) /* or invented names are excluded) */
952 if (!inventedText(name(nm).text) && nonNull(name(nm).type)) {
953 String str = textToStr(name(nm).text);
954 if (str[0]!='_' && (!pat || stringMatch(pat,str)))
955 ns = insertName(nm,ns);
959 List mns = module(currentModule).names;
960 for(; nonNull(mns); mns=tl(mns)) {
962 if (!inventedText(name(nm).text)) {
963 String str = textToStr(name(nm).text);
964 if (str[0]!='_' && (!pat || stringMatch(pat,str)))
965 ns = insertName(nm,ns);
972 /* --------------------------------------------------------------------------
973 * A simple string matching routine
974 * `*' matches any sequence of zero or more characters
975 * `?' matches any single character exactly
976 * `@str' matches the string str exactly (ignoring any special chars)
977 * `\c' matches the character c only (ignoring special chars)
978 * c matches the character c only
979 * ------------------------------------------------------------------------*/
981 static Void local patternError(s) /* report error in pattern */
983 ERRMSG(0) "%s in pattern", s
987 static Bool local stringMatch(pat,str) /* match string against pattern */
993 case '\0' : return (*str=='\0');
996 if (stringMatch(pat+1,str))
1001 case '?' : if (*str++=='\0')
1006 case '[' : { Bool found = FALSE;
1007 while (*++pat!='\0' && *pat!=']')
1008 if (!found && ( pat[0] == *str ||
1017 patternError("missing `]'");
1025 case '\\' : if (*++pat == '\0')
1026 patternError("extra trailing `\\'");
1028 default : if (*pat++ != *str++)
1034 /* --------------------------------------------------------------------------
1035 * Storage of type classes, instances etc...:
1036 * ------------------------------------------------------------------------*/
1038 static Class classHw; /* next unused class */
1039 static List classes; /* list of classes in current scope */
1040 static Inst instHw; /* next unused instance record */
1042 struct strClass DEFTABLE(tabClass,NUM_CLASSES); /* table of class records */
1043 struct strInst far *tabInst; /* (pointer to) table of instances */
1045 Class newClass(t) /* add new class to class table */
1047 if (classHw-CLASSMIN >= NUM_CLASSES) {
1048 ERRMSG(0) "Class storage space exhausted"
1051 cclass(classHw).text = t;
1052 cclass(classHw).arity = 0;
1053 cclass(classHw).kinds = NIL;
1054 cclass(classHw).head = NIL;
1055 cclass(classHw).fds = NIL;
1056 cclass(classHw).xfds = NIL;
1057 cclass(classHw).dcon = NIL;
1058 cclass(classHw).supers = NIL;
1059 cclass(classHw).dsels = NIL;
1060 cclass(classHw).members = NIL;
1061 cclass(classHw).defaults = NIL;
1062 cclass(classHw).instances = NIL;
1063 classes=cons(classHw,classes);
1064 cclass(classHw).mod = currentModule;
1065 module(currentModule).classes=cons(classHw,module(currentModule).classes);
1069 Class classMax() { /* Return max Class in use ... */
1070 return classHw; /* This is a bit ugly, but it's not*/
1071 } /* worth a lot of effort right now */
1073 Class findClass(t) /* look for named class in table */
1077 for (cs=classes; nonNull(cs); cs=tl(cs)) {
1079 if (cclass(cl).text==t)
1085 Class addClass(c) /* Insert Class in class list */
1086 Class c; { /* - if no clash caused */
1088 assert(whatIs(c)==CLASS);
1089 oldc = findClass(cclass(c).text);
1091 classes=cons(c,classes);
1092 module(currentModule).classes=cons(c,module(currentModule).classes);
1099 Class findQualClass(c) /* Look for (possibly qualified) */
1100 Cell c; { /* class in class list */
1101 if (!isQualIdent(c)) {
1102 return findClass(textOf(c));
1104 Text t = qtextOf(c);
1105 Module m = findQualifier(qmodOf(c));
1109 for (es=module(m).exports; nonNull(es); es=tl(es)) {
1111 if (isPair(e) && isClass(fst(e)) && cclass(fst(e)).text==t)
1118 Inst newInst() { /* Add new instance to table */
1119 if (instHw-INSTMIN >= NUM_INSTS) {
1120 ERRMSG(0) "Instance storage space exhausted"
1123 inst(instHw).kinds = NIL;
1124 inst(instHw).head = NIL;
1125 inst(instHw).specifics = NIL;
1126 inst(instHw).implements = NIL;
1127 inst(instHw).builder = NIL;
1128 inst(instHw).mod = currentModule;
1134 extern Void printInst Args((Inst));
1138 Class cl = inst(in).c;
1139 Printf("%s-", textToStr(cclass(cl).text));
1140 printType(stdout,inst(in).t);
1142 #endif /* DEBUG_DICTS */
1144 Inst findFirstInst(tc) /* look for 1st instance involving */
1145 Tycon tc; { /* the type constructor tc */
1146 return findNextInst(tc,INSTMIN-1);
1149 Inst findNextInst(tc,in) /* look for next instance involving*/
1150 Tycon tc; /* the type constructor tc */
1151 Inst in; { /* starting after instance in */
1152 while (++in < instHw) {
1153 Cell pi = inst(in).head;
1154 for (; isAp(pi); pi=fun(pi))
1155 if (typeInvolves(arg(pi),tc))
1161 static Bool local typeInvolves(ty,tc) /* Test to see if type ty involves */
1162 Type ty; /* type constructor/tuple tc. */
1165 || (isAp(ty) && (typeInvolves(fun(ty),tc)
1166 || typeInvolves(arg(ty),tc)));
1170 /* Needed by finishGHCInstance to find classes, before the
1171 export list has been built -- so we can't use
1174 Class findQualClassWithoutConsultingExportList ( QualId q )
1184 t_class = textOf(q);
1187 t_class = qtextOf(q);
1190 for (cl = CLASSMIN; cl < classHw; cl++) {
1191 if (cclass(cl).text == t_class) {
1192 /* Class name is ok, but is this the right module? */
1193 if (isNull(t_mod) /* no module name specified */
1195 && t_mod == module(cclass(cl).mod).text)
1204 /* Same deal, except for Tycons. */
1205 Tycon findQualTyconWithoutConsultingExportList ( QualId q )
1215 t_tycon = textOf(q);
1218 t_tycon = qtextOf(q);
1221 for (tc = TYCMIN; tc < tyconHw; tc++) {
1222 if (tycon(tc).text == t_tycon) {
1223 /* Tycon name is ok, but is this the right module? */
1224 if (isNull(t_mod) /* no module name specified */
1226 && t_mod == module(tycon(tc).mod).text)
1234 Tycon findTyconInAnyModule ( Text t )
1237 for (tc = TYCMIN; tc < tyconHw; tc++)
1238 if (tycon(tc).text == t) return tc;
1242 Class findClassInAnyModule ( Text t )
1245 for (cc = CLASSMIN; cc < classHw; cc++)
1246 if (cclass(cc).text == t) return cc;
1250 Name findNameInAnyModule ( Text t )
1253 for (nm = NAMEMIN; nm < nameHw; nm++)
1254 if (name(nm).text == t) return nm;
1258 /* Same deal, except for Names. */
1259 Name findQualNameWithoutConsultingExportList ( QualId q )
1265 assert(isQVar(q) || isQCon(q));
1267 if (isCon(q) || isVar(q)) {
1272 t_name = qtextOf(q);
1275 for (nm = NAMEMIN; nm < nameHw; nm++) {
1276 if (name(nm).text == t_name) {
1277 /* Name is ok, but is this the right module? */
1278 if (isNull(t_mod) /* no module name specified */
1280 && t_mod == module(name(nm).mod).text)
1289 /* returns List of QualId */
1290 List getAllKnownTyconsAndClasses ( void )
1295 for (tc = TYCMIN; tc < tyconHw; tc++) {
1296 /* almost certainly undue paranoia about duplicate avoidance, but .. */
1297 QualId q = mkQCon( module(tycon(tc).mod).text, tycon(tc).text );
1298 if (!qualidIsMember(q,xs))
1299 xs = cons ( q, xs );
1301 for (nw = CLASSMIN; nw < classHw; nw++) {
1302 QualId q = mkQCon( module(cclass(nw).mod).text, cclass(nw).text );
1303 if (!qualidIsMember(q,xs))
1304 xs = cons ( q, xs );
1309 /* Purely for debugging. */
1310 void locateSymbolByName ( Text t )
1313 for (i = NAMEMIN; i < nameHw; i++)
1314 if (name(i).text == t)
1315 fprintf ( stderr, "name(%d)\n", i-NAMEMIN);
1316 for (i = TYCMIN; i < tyconHw; i++)
1317 if (tycon(i).text == t)
1318 fprintf ( stderr, "tycon(%d)\n", i-TYCMIN);
1319 for (i = CLASSMIN; i < classHw; i++)
1320 if (cclass(i).text == t)
1321 fprintf ( stderr, "class(%d)\n", i-CLASSMIN);
1324 /* --------------------------------------------------------------------------
1327 * Various parts of the system use a stack of cells. Most of the stack
1328 * operations are defined as macros, expanded inline.
1329 * ------------------------------------------------------------------------*/
1331 Cell DEFTABLE(cellStack,NUM_STACK); /* Storage for cells on stack */
1332 StackPtr sp; /* stack pointer */
1334 #if GIMME_STACK_DUMPS
1336 #define UPPER_DISP 5 /* # display entries on top of stack */
1337 #define LOWER_DISP 5 /* # display entries on bottom of stack*/
1339 Void hugsStackOverflow() { /* Report stack overflow */
1341 extern Cell evalRoots[];
1343 ERRMSG(0) "Control stack overflow" ETHEN
1346 if (rootsp>=UPPER_DISP+LOWER_DISP) {
1347 for (i=0; i<UPPER_DISP; i++) {
1348 ERRTEXT "\nwhile evaluating: " ETHEN
1349 ERREXPR(evalRoots[rootsp-i]);
1351 ERRTEXT "\n..." ETHEN
1352 for (i=LOWER_DISP-1; i>=0; i--) {
1353 ERRTEXT "\nwhile evaluating: " ETHEN
1354 ERREXPR(evalRoots[i]);
1358 for (i=rootsp; i>=0; i--) {
1359 ERRTEXT "\nwhile evaluating: " ETHEN
1360 ERREXPR(evalRoots[i]);
1368 #else /* !GIMME_STACK_DUMPS */
1370 Void hugsStackOverflow() { /* Report stack overflow */
1371 ERRMSG(0) "Control stack overflow"
1375 #endif /* !GIMME_STACK_DUMPS */
1377 /* --------------------------------------------------------------------------
1380 * A Module represents a user defined module.
1382 * Note: there are now two lookup mechanisms in the system:
1384 * 1) The exports from a module are stored in a big list.
1385 * We resolve qualified names, and import lists by linearly scanning
1386 * through this list.
1388 * 2) Unqualified imports and local definitions for the current module
1389 * are stored in hash tables (tyconHash and nameHash) or linear lists
1392 * ------------------------------------------------------------------------*/
1394 static Module moduleHw; /* next unused Module */
1395 struct Module DEFTABLE(tabModule,NUM_MODULE); /* Module storage */
1396 Module currentModule; /* Module currently being processed*/
1398 Bool isValidModule(m) /* is m a legitimate module id? */
1400 return (MODMIN <= m && m < moduleHw);
1403 Module newModule(t) /* add new module to module table */
1405 if (moduleHw-MODMIN >= NUM_MODULE) {
1406 ERRMSG(0) "Module storage space exhausted"
1409 module(moduleHw).text = t; /* clear new module record */
1410 module(moduleHw).qualImports = NIL;
1411 module(moduleHw).fake = FALSE;
1412 module(moduleHw).exports = NIL;
1413 module(moduleHw).tycons = NIL;
1414 module(moduleHw).names = NIL;
1415 module(moduleHw).classes = NIL;
1416 module(moduleHw).object = NULL;
1417 module(moduleHw).objectExtras = NULL;
1418 module(moduleHw).objectExtraNames = NIL;
1422 void ppModules ( void )
1425 fflush(stderr); fflush(stdout);
1426 printf ( "begin MODULES\n" );
1427 for (i = moduleHw-1; i >= MODMIN; i--)
1428 printf ( " %2d: %16s\n",
1429 i-MODMIN, textToStr(module(i).text)
1431 printf ( "end MODULES\n" );
1432 fflush(stderr); fflush(stdout);
1436 Module findModule(t) /* locate Module in module table */
1439 for(m=MODMIN; m<moduleHw; ++m) {
1440 if (module(m).text==t)
1446 Module findModid(c) /* Find module by name or filename */
1448 switch (whatIs(c)) {
1449 case STRCELL : { Script s = scriptThisFile(snd(c));
1450 return (s==-1) ? NIL : moduleOfScript(s);
1452 case CONIDCELL : return findModule(textOf(c));
1453 default : internal("findModid");
1455 return NIL;/*NOTUSED*/
1458 static local Module findQualifier(t) /* locate Module in import list */
1461 for (ms=module(currentModule).qualImports; nonNull(ms); ms=tl(ms)) {
1462 if (textOf(fst(hd(ms)))==t)
1466 if (module(currentModule).text==t)
1467 return currentModule;
1472 Void setCurrModule(m) /* set lookup tables for current module */
1475 assert(isModule(m));
1476 if (m!=currentModule) {
1477 currentModule = m; /* This is the only assignment to currentModule */
1478 for (i=0; i<TYCONHSZ; ++i)
1480 mapProc(hashTycon,module(m).tycons);
1481 for (i=0; i<NAMEHSZ; ++i)
1483 mapProc(hashName,module(m).names);
1484 classes = module(m).classes;
1488 Name jrsFindQualName ( Text mn, Text sn )
1493 for (m=MODMIN; m<moduleHw; m++)
1494 if (module(m).text == mn) break;
1495 if (m == moduleHw) return NIL;
1497 for (ns = module(m).names; nonNull(ns); ns=tl(ns))
1498 if (name(hd(ns)).text == sn) return hd(ns);
1504 char* nameFromOPtr ( void* p )
1508 for (m=MODMIN; m<moduleHw; m++) {
1509 if (module(m).object) {
1510 char* nm = ocLookupAddr ( module(m).object, p );
1515 /* A kludge to assist Win32 debugging; not actually necessary. */
1516 { char* nm = nameFromStaticOPtr(p);
1524 void* lookupOTabName ( Module m, char* sym )
1526 if (module(m).object)
1527 return ocLookupSym ( module(m).object, sym );
1532 void* lookupOExtraTabName ( char* sym )
1536 for (m = MODMIN; m < moduleHw; m++) {
1537 for (oc = module(m).objectExtras; oc; oc=oc->next) {
1538 void* ad = ocLookupSym ( oc, sym );
1546 OSectionKind lookupSection ( void* ad )
1553 for (m=MODMIN; m<moduleHw; m++) {
1554 if (module(m).object) {
1555 sect = ocLookupSection ( module(m).object, ad );
1556 if (sect != HUGS_SECTIONKIND_NOINFOAVAIL)
1559 for (oc = module(m).objectExtras; oc; oc=oc->next) {
1560 sect = ocLookupSection ( oc, ad );
1561 if (sect != HUGS_SECTIONKIND_NOINFOAVAIL)
1565 return HUGS_SECTIONKIND_OTHER;
1569 /* --------------------------------------------------------------------------
1570 * Script file storage:
1572 * script files are read into the system one after another. The state of
1573 * the stored data structures (except the garbage-collected heap) is recorded
1574 * before reading a new script. In the event of being unable to read the
1575 * script, or if otherwise requested, the system can be restored to its
1576 * original state immediately before the file was read.
1577 * ------------------------------------------------------------------------*/
1579 typedef struct { /* record of storage state prior to */
1580 Text file; /* reading script/module */
1594 #ifdef DEBUG_SHOWUSE
1595 static Void local showUse(msg,val,mx)
1598 Printf("%6s : %5d of %5d (%2d%%)\n",msg,val,mx,(100*val)/mx);
1602 static Script scriptHw; /* next unused script number */
1603 static script scripts[NUM_SCRIPTS]; /* storage for script records */
1606 void ppScripts ( void )
1609 fflush(stderr); fflush(stdout);
1610 printf ( "begin SCRIPTS\n" );
1611 for (i = scriptHw-1; i >= 0; i--)
1612 printf ( " %2d: %16s tH=%d mH=%d yH=%d "
1613 "nH=%d cH=%d iH=%d nnS=%d,%d\n",
1614 i, textToStr(scripts[i].file),
1615 scripts[i].textHw, scripts[i].moduleHw,
1616 scripts[i].tyconHw, scripts[i].nameHw,
1617 scripts[i].classHw, scripts[i].instHw,
1618 scripts[i].nextNewText, scripts[i].nextNewDText
1620 printf ( "end SCRIPTS\n" );
1621 fflush(stderr); fflush(stdout);
1624 Script startNewScript(f) /* start new script, keeping record */
1625 String f; { /* of status for later restoration */
1626 if (scriptHw >= NUM_SCRIPTS) {
1627 ERRMSG(0) "Too many script files in use"
1630 #ifdef DEBUG_SHOWUSE
1631 showUse("Text", textHw, NUM_TEXT);
1632 showUse("Module", moduleHw-MODMIN, NUM_MODULE);
1633 showUse("Tycon", tyconHw-TYCMIN, NUM_TYCON);
1634 showUse("Name", nameHw-NAMEMIN, NUM_NAME);
1635 showUse("Class", classHw-CLASSMIN, NUM_CLASSES);
1636 showUse("Inst", instHw-INSTMIN, NUM_INSTS);
1638 showUse("Ext", extHw-EXTMIN, NUM_EXT);
1641 scripts[scriptHw].file = findText( f ? f : "<nofile>" );
1642 scripts[scriptHw].textHw = textHw;
1643 scripts[scriptHw].nextNewText = nextNewText;
1644 scripts[scriptHw].nextNewDText = nextNewDText;
1645 scripts[scriptHw].moduleHw = moduleHw;
1646 scripts[scriptHw].tyconHw = tyconHw;
1647 scripts[scriptHw].nameHw = nameHw;
1648 scripts[scriptHw].classHw = classHw;
1649 scripts[scriptHw].instHw = instHw;
1651 scripts[scriptHw].extHw = extHw;
1656 Bool isPreludeScript() { /* Test whether this is the Prelude*/
1657 return (scriptHw < N_PRELUDE_SCRIPTS /*==0*/ );
1660 Bool moduleThisScript(m) /* Test if given module is defined */
1661 Module m; { /* in current script file */
1663 || m>=scripts[scriptHw-1].moduleHw;
1666 Module lastModule() { /* Return module in current script file */
1667 return (moduleHw>MODMIN ? moduleHw-1 : modulePrelude);
1670 #define scriptThis(nm,t,tag) Script nm(x) \
1674 && x>=scripts[s].tag) \
1678 scriptThis(scriptThisName,Name,nameHw)
1679 scriptThis(scriptThisTycon,Tycon,tyconHw)
1680 scriptThis(scriptThisInst,Inst,instHw)
1681 scriptThis(scriptThisClass,Class,classHw)
1684 Module moduleOfScript(s)
1686 return (s==0) ? modulePrelude : scripts[s-1].moduleHw;
1689 String fileOfModule(m)
1692 if (m == modulePrelude) {
1695 for(s=0; s<scriptHw; ++s) {
1696 if (scripts[s].moduleHw == m) {
1697 return textToStr(scripts[s].file);
1703 Script scriptThisFile(f)
1706 for (s=0; s < scriptHw; ++s) {
1707 if (scripts[s].file == f) {
1711 if (f == findText(STD_PRELUDE)) {
1717 Void dropScriptsFrom(sno) /* Restore storage to state prior */
1718 Script sno; { /* to reading script sno */
1719 if (sno<scriptHw) { /* is there anything to restore? */
1721 textHw = scripts[sno].textHw;
1722 nextNewText = scripts[sno].nextNewText;
1723 nextNewDText = scripts[sno].nextNewDText;
1724 moduleHw = scripts[sno].moduleHw;
1725 tyconHw = scripts[sno].tyconHw;
1726 nameHw = scripts[sno].nameHw;
1727 classHw = scripts[sno].classHw;
1728 instHw = scripts[sno].instHw;
1730 dictHw = scripts[sno].dictHw;
1733 extHw = scripts[sno].extHw;
1737 for (i=moduleHw; i >= scripts[sno].moduleHw; --i) {
1738 if (module(i).objectFile) {
1739 printf("[bogus] closing objectFile for module %d\n",i);
1740 /*dlclose(module(i).objectFile);*/
1743 moduleHw = scripts[sno].moduleHw;
1745 for (i=0; i<TEXTHSZ; ++i) {
1747 while (j<NUM_TEXTH && textHash[i][j]!=NOTEXT
1748 && textHash[i][j]<textHw)
1751 textHash[i][j] = NOTEXT;
1755 for (i=0; i<TYCONHSZ; ++i) {
1758 for (i=0; i<NAMEHSZ; ++i) {
1762 for (i=CLASSMIN; i<classHw; i++) {
1763 List ins = cclass(i).instances;
1766 while (nonNull(ins)) {
1767 List temp = tl(ins);
1768 if (hd(ins)<instHw) {
1774 cclass(i).instances = rev(is);
1781 /* --------------------------------------------------------------------------
1784 * Provides a garbage collectable heap for storage of expressions etc.
1786 * Now incorporates a flat resource: A two-space collected extension of
1787 * the heap that provides storage for contiguous arrays of Cell storage,
1788 * cooperating with the garbage collection mechanisms for the main heap.
1789 * ------------------------------------------------------------------------*/
1791 Int heapSize = DEFAULTHEAP; /* number of cells in heap */
1792 Heap heapFst; /* array of fst component of pairs */
1793 Heap heapSnd; /* array of snd component of pairs */
1800 Bool consGC = TRUE; /* Set to FALSE to turn off gc from*/
1801 /* C stack; use with extreme care! */
1803 Int numGcs; /* number of garbage collections */
1804 Int cellsRecovered; /* number of cells recovered */
1806 static Cell freeList; /* free list of unused cells */
1807 static Cell lsave, rsave; /* save components of pair */
1811 static Int markCount, stackRoots;
1813 #define initStackRoots() stackRoots = 0
1814 #define recordStackRoot() stackRoots++
1827 #define start() markCount = 0
1828 #define end(thing,rs) \
1830 Printf("GC: %-18s: %4d cells, %4d roots.\n", thing, markCount, rs); \
1833 #define recordMark() markCount++
1835 #else /* !GC_STATISTICS */
1840 #define initStackRoots()
1841 #define recordStackRoot()
1844 #define end(thing,root)
1845 #define recordMark()
1847 #endif /* !GC_STATISTICS */
1849 Cell pair(l,r) /* Allocate pair (l, r) from */
1850 Cell l, r; { /* heap, garbage collecting first */
1851 Cell c = freeList; /* if necessary ... */
1863 freeList = snd(freeList);
1870 Void overwrite(dst,src) /* overwrite dst cell with src cell*/
1871 Cell dst, src; { /* both *MUST* be pairs */
1872 if (isPair(dst) && isPair(src)) {
1873 fst(dst) = fst(src);
1874 snd(dst) = snd(src);
1877 internal("overwrite");
1881 static Int marksSize;
1883 Cell markExpr(c) /* External interface to markCell */
1885 return isGenPair(c) ? markCell(c) : c;
1888 static Cell local markCell(c) /* Traverse part of graph marking */
1889 Cell c; { /* cells reachable from given root */
1890 /* markCell(c) is only called if c */
1892 { register int place = placeInSet(c);
1893 register int mask = maskInSet(c);
1894 if (marks[place]&mask)
1897 marks[place] |= mask;
1902 /* STACK_CHECK: Avoid stack overflows during recursive marking. */
1903 if (isGenPair(fst(c))) {
1905 fst(c) = markCell(fst(c));
1908 else if (isNull(fst(c)) || fst(c)>=BCSTAG) {
1916 static Void local markSnd(c) /* Variant of markCell used to */
1917 Cell c; { /* update snd component of cell */
1918 Cell t; /* using tail recursion */
1920 ma: t = c; /* Keep pointer to original pair */
1925 { register int place = placeInSet(c);
1926 register int mask = maskInSet(c);
1927 if (marks[place]&mask)
1930 marks[place] |= mask;
1935 if (isGenPair(fst(c))) {
1936 fst(c) = markCell(fst(c));
1939 else if (isNull(fst(c)) || fst(c)>=BCSTAG)
1944 Void markWithoutMove(n) /* Garbage collect cell at n, as if*/
1945 Cell n; { /* it was a cell ref, but don't */
1946 /* move cell so we don't have */
1947 /* to modify the stored value of n */
1954 Void garbageCollect() { /* Run garbage collector ... */
1955 Bool breakStat = breakOn(FALSE); /* disable break checking */
1961 jmp_buf regs; /* save registers on stack */
1965 for (i=0; i<marksSize; ++i) /* initialise mark set to empty */
1968 everybody(MARK); /* Mark all components of system */
1970 gcScanning(); /* scan mark set */
1977 for (i=1; i<=heapSize; i++) {
1978 if ((marks[place] & mask) == 0) {
1985 if (++j == bitsPerWord) {
1992 gcRecovered(recovered);
1993 breakOn(breakStat); /* restore break trapping if nec. */
1997 /* can only return if freeList is nonempty on return. */
1998 if (recovered<minRecovery || isNull(freeList)) {
1999 ERRMSG(0) "Garbage collection fails to reclaim sufficient space"
2002 cellsRecovered = recovered;
2005 /* --------------------------------------------------------------------------
2006 * Code for saving last expression entered:
2008 * This is a little tricky because some text values (e.g. strings or variable
2009 * names) may not be defined or have the same value when the expression is
2010 * recalled. These text values are therefore saved in the top portion of
2012 * ------------------------------------------------------------------------*/
2014 static Cell lastExprSaved; /* last expression to be saved */
2016 Void setLastExpr(e) /* save expression for later recall*/
2018 lastExprSaved = NIL; /* in case attempt to save fails */
2019 savedText = NUM_TEXT;
2020 lastExprSaved = lowLevelLastIn(e);
2023 static Cell local lowLevelLastIn(c) /* Duplicate expression tree (i.e. */
2024 Cell c; { /* acyclic graph) for later recall */
2025 if (isPair(c)) { /* Duplicating any text strings */
2026 if (isBoxTag(fst(c))) /* in case these are lost at some */
2027 switch (fst(c)) { /* point before the expr is reused */
2033 case STRCELL : return pair(fst(c),saveText(textOf(c)));
2034 default : return pair(fst(c),snd(c));
2037 return pair(lowLevelLastIn(fst(c)),lowLevelLastIn(snd(c)));
2041 return pair(EXTCOPY,saveText(extText(c)));
2047 Cell getLastExpr() { /* recover previously saved expr */
2048 return lowLevelLastOut(lastExprSaved);
2051 static Cell local lowLevelLastOut(c) /* As with lowLevelLastIn() above */
2052 Cell c; { /* except that Cells refering to */
2053 if (isPair(c)) { /* Text values are restored to */
2054 if (isBoxTag(fst(c))) /* appropriate values */
2061 case STRCELL : return pair(fst(c),
2062 findText(text+intValOf(c)));
2064 case EXTCOPY : return mkExt(findText(text+intValOf(c)));
2066 default : return pair(fst(c),snd(c));
2069 return pair(lowLevelLastOut(fst(c)),lowLevelLastOut(snd(c)));
2075 /* --------------------------------------------------------------------------
2076 * Miscellaneous operations on heap cells:
2077 * ------------------------------------------------------------------------*/
2079 /* Profiling suggests that the number of calls to whatIs() is typically */
2080 /* rather high. The recoded version below attempts to improve the average */
2081 /* performance for whatIs() using a binary search for part of the analysis */
2083 Cell whatIs(c) /* identify type of cell */
2086 register Cell fstc = fst(c);
2087 return isTag(fstc) ? fstc : AP;
2089 if (c<OFFMIN) return c;
2091 if (isExt(c)) return EXT;
2093 if (c>=INTMIN) return INTCELL;
2095 if (c>=NAMEMIN){if (c>=CLASSMIN) {if (c>=CHARMIN) return CHARCELL;
2097 else if (c>=INSTMIN) return INSTANCE;
2099 else if (c>=MODMIN) {if (c>=TYCMIN) return isTuple(c) ? TUPLE : TYCON;
2100 else return MODULE;}
2101 else if (c>=OFFMIN) return OFFSET;
2103 else return (c>=EXTMIN) ?
2110 register Cell fstc = fst(c);
2111 return isTag(fstc) ? fstc : AP;
2113 if (c>=INTMIN) return INTCELL;
2114 if (c>=CHARMIN) return CHARCELL;
2115 if (c>=CLASSMIN) return CLASS;
2116 if (c>=INSTMIN) return INSTANCE;
2117 if (c>=NAMEMIN) return NAME;
2118 if (c>=TYCMIN) return TYCON;
2119 if (c>=MODMIN) return MODULE;
2120 if (c>=OFFMIN) return OFFSET;
2122 if (c>=EXTMIN) return EXT;
2124 if (c>=TUPMIN) return TUPLE;
2128 /* A very, very simple printer.
2129 * Output is uglier than from printExp - but the printer is more
2130 * robust and can be used on any data structure irrespective of
2133 Void print Args((Cell, Int));
2134 Void print(c, depth)
2140 Int tag = whatIs(c);
2144 print(fst(c), depth-1);
2146 print(snd(c), depth-1);
2150 Printf("free(%d)", c);
2153 Printf("int(%d)", intOf(c));
2156 Printf("bignum(%s)", bignumToString(c));
2159 Printf("char('%c')", charOf(c));
2162 Printf("ptr(%p)",ptrOf(c));
2165 Printf("class(%d)", c-CLASSMIN);
2166 if (CLASSMIN <= c && c < classHw) {
2167 Printf("=\"%s\"", textToStr(cclass(c).text));
2171 Printf("instance(%d)", c - INSTMIN);
2174 Printf("name(%d)", c-NAMEMIN);
2175 if (NAMEMIN <= c && c < nameHw) {
2176 Printf("=\"%s\"", textToStr(name(c).text));
2180 Printf("tycon(%d)", c-TYCMIN);
2181 if (TYCMIN <= c && c < tyconHw)
2182 Printf("=\"%s\"", textToStr(tycon(c).text));
2185 Printf("module(%d)", c - MODMIN);
2188 Printf("Offset %d", offsetOf(c));
2191 Printf("%s", textToStr(ghcTupleText(c)));
2195 print(snd(c),depth-1);
2199 print(snd(c),depth-1);
2203 if (isPair(snd(c)) && isInt(fst(snd(c)))) {
2204 Printf("%d ", intOf(fst(snd(c))));
2205 print(snd(snd(c)),depth-1);
2207 print(snd(c),depth-1);
2224 Printf("{dict %d}",textOf(c));
2230 Printf("{id %s}",textToStr(textOf(c)));
2234 Printf("{ip %s}",textToStr(textOf(c)));
2237 Printf("?%s",textToStr(textOf(c)));
2241 Printf("{qid %s.%s}",textToStr(qmodOf(c)),textToStr(qtextOf(c)));
2245 print(fst(snd(c)),depth-1);
2247 print(snd(snd(c)),depth-1);
2252 print(snd(c),depth-1);
2257 print(snd(c),depth-1);
2262 print(fst(snd(c)),depth-1);
2264 print(snd(snd(c)),depth-1);
2269 print(fst(snd(c)),depth-1);
2271 print(snd(snd(c)),depth-1);
2275 Printf("FromQual(");
2276 print(fst(snd(c)),depth-1);
2278 print(snd(snd(c)),depth-1);
2282 Printf("StgVar%d=",-c);
2283 print(snd(c), depth-1);
2287 print(fst(snd(c)),depth-1);
2289 print(snd(snd(c)),depth-1);
2294 print(fst(snd(c)),depth-1);
2296 print(snd(snd(c)),depth-1);
2301 print(fst(snd(c)),depth-1);
2303 print(snd(snd(c)),depth-1);
2307 Printf("PrimCase(");
2308 print(fst(snd(c)),depth-1);
2310 print(snd(snd(c)),depth-1);
2315 print(snd(c),depth-1);
2319 Printf("(UNBOXEDTUP,");
2320 print(snd(c),depth-1);
2325 print(zfst(c),depth-1);
2327 print(zsnd(c),depth-1);
2331 Printf("<ZTriple ");
2332 print(zfst3(c),depth-1);
2334 print(zsnd3(c),depth-1);
2336 print(zthd3(c),depth-1);
2341 print(snd(c),depth-1);
2345 if (isBoxTag(tag)) {
2346 Printf("Tag(%d)=%d", c, tag);
2347 } else if (isConTag(tag)) {
2348 Printf("%d@(%d,",c,tag);
2349 print(snd(c), depth-1);
2352 } else if (c == tag) {
2353 Printf("Tag(%d)", c);
2355 Printf("Tag(%d)=%d", c, tag);
2364 Bool isVar(c) /* is cell a VARIDCELL/VAROPCELL ? */
2365 Cell c; { /* also recognises DICTVAR cells */
2367 (fst(c)==VARIDCELL || fst(c)==VAROPCELL || fst(c)==DICTVAR);
2370 Bool isCon(c) /* is cell a CONIDCELL/CONOPCELL ? */
2372 return isPair(c) && (fst(c)==CONIDCELL || fst(c)==CONOPCELL);
2375 Bool isQVar(c) /* is cell a [un]qualified varop/id? */
2377 if (!isPair(c)) return FALSE;
2380 case VAROPCELL : return TRUE;
2382 case QUALIDENT : return isVar(snd(snd(c)));
2384 default : return FALSE;
2388 Bool isQCon(c) /*is cell a [un]qualified conop/id? */
2390 if (!isPair(c)) return FALSE;
2393 case CONOPCELL : return TRUE;
2395 case QUALIDENT : return isCon(snd(snd(c)));
2397 default : return FALSE;
2401 Bool isQualIdent(c) /* is cell a qualified identifier? */
2403 return isPair(c) && (fst(c)==QUALIDENT);
2406 Bool eqQualIdent ( QualId c1, QualId c2 )
2408 assert(isQualIdent(c1));
2409 if (!isQualIdent(c2)) {
2410 assert(isQualIdent(c2));
2412 return qmodOf(c1)==qmodOf(c2) &&
2413 qtextOf(c1)==qtextOf(c2);
2416 Bool isIdent(c) /* is cell an identifier? */
2418 if (!isPair(c)) return FALSE;
2423 case CONOPCELL : return TRUE;
2425 case QUALIDENT : return TRUE;
2427 default : return FALSE;
2431 Bool isInt(c) /* cell holds integer value? */
2433 return isSmall(c) || (isPair(c) && fst(c)==INTCELL);
2436 Int intOf(c) /* find integer value of cell? */
2439 return isPair(c) ? (Int)(snd(c)) : (Int)(c-INTZERO);
2442 Cell mkInt(n) /* make cell representing integer */
2444 return (MINSMALLINT <= n && n <= MAXSMALLINT)
2449 #if SIZEOF_VOID_P == SIZEOF_INT
2451 typedef union {Int i; Ptr p;} IntOrPtr;
2458 return pair(PTRCELL,x.i);
2465 assert(fst(c) == PTRCELL);
2475 return pair(CPTRCELL,x.i);
2482 assert(fst(c) == CPTRCELL);
2487 #elif SIZEOF_VOID_P == 2*SIZEOF_INT
2489 typedef union {struct {Int i1; Int i2;} i; Ptr p;} IntOrPtr;
2496 return pair(PTRCELL,pair(mkInt(x.i.i1),mkInt(x.i.i2)));
2503 assert(fst(c) == PTRCELL);
2504 x.i.i1 = intOf(fst(snd(c)));
2505 x.i.i2 = intOf(snd(snd(c)));
2514 return pair(CPTRCELL,pair(mkInt(x.i.i1),mkInt(x.i.i2)));
2521 assert(fst(c) == CPTRCELL);
2522 x.i.i1 = intOf(fst(snd(c)));
2523 x.i.i2 = intOf(snd(snd(c)));
2529 #error "Can't implement mkPtr/ptrOf on this architecture."
2534 String stringNegate( s )
2542 strcpy(&t[1],s); /* ToDo: use strncpy instead */
2547 /* --------------------------------------------------------------------------
2549 * ------------------------------------------------------------------------*/
2551 Int length(xs) /* calculate length of list xs */
2554 for (; nonNull(xs); ++n)
2559 List appendOnto(xs,ys) /* Destructively prepend xs onto */
2560 List xs, ys; { /* ys by modifying xs ... */
2565 while (nonNull(tl(zs)))
2572 List dupOnto(xs,ys) /* non-destructively prepend xs backwards onto ys */
2575 for (; nonNull(xs); xs=tl(xs))
2576 ys = cons(hd(xs),ys);
2580 List dupListOnto(xs,ys) /* Duplicate spine of list xs onto ys */
2583 return revOnto(dupOnto(xs,NIL),ys);
2586 List dupList(xs) /* Duplicate spine of list xs */
2589 for (; nonNull(xs); xs=tl(xs))
2590 ys = cons(hd(xs),ys);
2594 List revOnto(xs,ys) /* Destructively reverse elements of*/
2595 List xs, ys; { /* list xs onto list ys... */
2598 while (nonNull(xs)) {
2607 QualId qualidIsMember ( QualId q, List xs )
2609 for (; nonNull(xs); xs=tl(xs)) {
2610 if (eqQualIdent(q, hd(xs)))
2616 Cell varIsMember(t,xs) /* Test if variable is a member of */
2617 Text t; /* given list of variables */
2619 for (; nonNull(xs); xs=tl(xs))
2620 if (t==textOf(hd(xs)))
2625 Name nameIsMember(t,ns) /* Test if name with text t is a */
2626 Text t; /* member of list of names xs */
2628 for (; nonNull(ns); ns=tl(ns))
2629 if (t==name(hd(ns)).text)
2634 Cell intIsMember(n,xs) /* Test if integer n is member of */
2635 Int n; /* given list of integers */
2637 for (; nonNull(xs); xs=tl(xs))
2638 if (n==intOf(hd(xs)))
2643 Cell cellIsMember(x,xs) /* Test for membership of specific */
2644 Cell x; /* cell x in list xs */
2646 for (; nonNull(xs); xs=tl(xs))
2652 Cell cellAssoc(c,xs) /* Lookup cell in association list */
2655 for (; nonNull(xs); xs=tl(xs))
2661 Cell cellRevAssoc(c,xs) /* Lookup cell in range of */
2662 Cell c; /* association lists */
2664 for (; nonNull(xs); xs=tl(xs))
2670 List replicate(n,x) /* create list of n copies of x */
2679 List diffList(from,take) /* list difference: from\take */
2680 List from, take; { /* result contains all elements of */
2681 List result = NIL; /* `from' not appearing in `take' */
2683 while (nonNull(from)) {
2684 List next = tl(from);
2685 if (!cellIsMember(hd(from),take)) {
2694 List deleteCell(xs, y) /* copy xs deleting pointers to y */
2698 for(;nonNull(xs);xs=tl(xs)) {
2701 result=cons(x,result);
2707 List take(n,xs) /* destructively truncate list to */
2708 Int n; /* specified length */
2714 while (1<n-- && nonNull(xs))
2721 List splitAt(n,xs) /* drop n things from front of list*/
2730 Cell nth(n,xs) /* extract n'th element of list */
2733 for(; n>0 && nonNull(xs); --n, xs=tl(xs)) {
2740 List removeCell(x,xs) /* destructively remove cell from */
2745 return tl(xs); /* element at front of list */
2749 for (; nonNull(curr); prev=curr, curr=tl(prev))
2751 tl(prev) = tl(curr);
2752 return xs; /* element in middle of list */
2756 return xs; /* here if element not found */
2759 List nubList(xs) /* nuke dups in list */
2760 List xs; { /* non destructive */
2762 for (; nonNull(xs); xs=tl(xs))
2763 if (isNull(cellIsMember(hd(xs),outs)))
2764 outs = cons(hd(xs),outs);
2770 /* --------------------------------------------------------------------------
2771 * Strongly-typed lists (z-lists) and tuples (experimental)
2772 * ------------------------------------------------------------------------*/
2774 static void z_tag_check ( Cell x, int tag, char* caller )
2778 sprintf(buf,"z_tag_check(%s): null\n", caller);
2781 if (whatIs(x) != tag) {
2783 "z_tag_check(%s): tag was %d, expected %d\n",
2784 caller, whatIs(x), tag );
2790 Cell zcons ( Cell x, Cell xs )
2792 if (!(isNull(xs) || whatIs(xs)==ZCONS))
2793 internal("zcons: ill typed tail");
2794 return ap(ZCONS,ap(x,xs));
2797 Cell zhd ( Cell xs )
2799 if (isNull(xs)) internal("zhd: empty list");
2800 z_tag_check(xs,ZCONS,"zhd");
2801 return fst( snd(xs) );
2804 Cell ztl ( Cell xs )
2806 if (isNull(xs)) internal("ztl: empty list");
2807 z_tag_check(xs,ZCONS,"zhd");
2808 return snd( snd(xs) );
2811 Int zlength ( ZList xs )
2814 while (nonNull(xs)) {
2815 z_tag_check(xs,ZCONS,"zlength");
2817 xs = snd( snd(xs) );
2822 ZList zreverse ( ZList xs )
2825 while (nonNull(xs)) {
2826 z_tag_check(xs,ZCONS,"zreverse");
2827 rev = zcons(zhd(xs),rev);
2833 Cell zsingleton ( Cell x )
2835 return zcons (x,NIL);
2838 Cell zdoubleton ( Cell x, Cell y )
2840 return zcons(x,zcons(y,NIL));
2844 Cell zpair ( Cell x1, Cell x2 )
2845 { return ap(ZTUP2,ap(x1,x2)); }
2846 Cell zfst ( Cell zpair )
2847 { z_tag_check(zpair,ZTUP2,"zfst"); return fst( snd(zpair) ); }
2848 Cell zsnd ( Cell zpair )
2849 { z_tag_check(zpair,ZTUP2,"zsnd"); return snd( snd(zpair) ); }
2851 Cell ztriple ( Cell x1, Cell x2, Cell x3 )
2852 { return ap(ZTUP3,ap(x1,ap(x2,x3))); }
2853 Cell zfst3 ( Cell zpair )
2854 { z_tag_check(zpair,ZTUP3,"zfst3"); return fst( snd(zpair) ); }
2855 Cell zsnd3 ( Cell zpair )
2856 { z_tag_check(zpair,ZTUP3,"zsnd3"); return fst(snd( snd(zpair) )); }
2857 Cell zthd3 ( Cell zpair )
2858 { z_tag_check(zpair,ZTUP3,"zthd3"); return snd(snd( snd(zpair) )); }
2860 Cell z4ble ( Cell x1, Cell x2, Cell x3, Cell x4 )
2861 { return ap(ZTUP4,ap(x1,ap(x2,ap(x3,x4)))); }
2862 Cell zsel14 ( Cell zpair )
2863 { z_tag_check(zpair,ZTUP4,"zsel14"); return fst( snd(zpair) ); }
2864 Cell zsel24 ( Cell zpair )
2865 { z_tag_check(zpair,ZTUP4,"zsel24"); return fst(snd( snd(zpair) )); }
2866 Cell zsel34 ( Cell zpair )
2867 { z_tag_check(zpair,ZTUP4,"zsel34"); return fst(snd(snd( snd(zpair) ))); }
2868 Cell zsel44 ( Cell zpair )
2869 { z_tag_check(zpair,ZTUP4,"zsel44"); return snd(snd(snd( snd(zpair) ))); }
2871 Cell z5ble ( Cell x1, Cell x2, Cell x3, Cell x4, Cell x5 )
2872 { return ap(ZTUP5,ap(x1,ap(x2,ap(x3,ap(x4,x5))))); }
2873 Cell zsel15 ( Cell zpair )
2874 { z_tag_check(zpair,ZTUP5,"zsel15"); return fst( snd(zpair) ); }
2875 Cell zsel25 ( Cell zpair )
2876 { z_tag_check(zpair,ZTUP5,"zsel25"); return fst(snd( snd(zpair) )); }
2877 Cell zsel35 ( Cell zpair )
2878 { z_tag_check(zpair,ZTUP5,"zsel35"); return fst(snd(snd( snd(zpair) ))); }
2879 Cell zsel45 ( Cell zpair )
2880 { z_tag_check(zpair,ZTUP5,"zsel45"); return fst(snd(snd(snd( snd(zpair) )))); }
2881 Cell zsel55 ( Cell zpair )
2882 { z_tag_check(zpair,ZTUP5,"zsel55"); return snd(snd(snd(snd( snd(zpair) )))); }
2885 Cell unap ( int tag, Cell c )
2888 if (whatIs(c) != tag) {
2889 sprintf(buf, "unap: specified %d, actual %d\n",
2896 /* --------------------------------------------------------------------------
2897 * Operations on applications:
2898 * ------------------------------------------------------------------------*/
2900 Int argCount; /* number of args in application */
2902 Cell getHead(e) /* get head cell of application */
2903 Cell e; { /* set number of args in argCount */
2904 for (argCount=0; isAp(e); e=fun(e))
2909 List getArgs(e) /* get list of arguments in function*/
2910 Cell e; { /* application: */
2911 List as; /* getArgs(f e1 .. en) = [e1,..,en] */
2913 for (as=NIL; isAp(e); e=fun(e))
2914 as = cons(arg(e),as);
2918 Cell nthArg(n,e) /* return nth arg in application */
2919 Int n; /* of function to m args (m>=n) */
2920 Cell e; { /* nthArg n (f x0 x1 ... xm) = xn */
2921 for (n=numArgs(e)-n-1; n>0; n--)
2926 Int numArgs(e) /* find number of arguments to expr */
2929 for (n=0; isAp(e); e=fun(e))
2934 Cell applyToArgs(f,args) /* destructively apply list of args */
2935 Cell f; /* to function f */
2937 while (nonNull(args)) {
2938 Cell temp = tl(args);
2939 tl(args) = hd(args);
2947 /* --------------------------------------------------------------------------
2949 * ------------------------------------------------------------------------*/
2951 static String maybeModuleStr ( Module m )
2953 if (isModule(m)) return textToStr(module(m).text); else return "??";
2956 static String maybeNameStr ( Name n )
2958 if (isName(n)) return textToStr(name(n).text); else return "??";
2961 static String maybeTyconStr ( Tycon t )
2963 if (isTycon(t)) return textToStr(tycon(t).text); else return "??";
2966 static String maybeClassStr ( Class c )
2968 if (isClass(c)) return textToStr(cclass(c).text); else return "??";
2971 static String maybeText ( Text t )
2973 if (isNull(t)) return "(nil)";
2974 return textToStr(t);
2977 static void print100 ( Int x )
2979 print ( x, 100); printf("\n");
2982 void dumpTycon ( Int t )
2984 if (isTycon(TYCMIN+t) && !isTycon(t)) t += TYCMIN;
2986 printf ( "dumpTycon %d: not a tycon\n", t);
2990 printf ( " text: %s\n", textToStr(tycon(t).text) );
2991 printf ( " line: %d\n", tycon(t).line );
2992 printf ( " mod: %s\n", maybeModuleStr(tycon(t).mod));
2993 printf ( " tuple: %d\n", tycon(t).tuple);
2994 printf ( " arity: %d\n", tycon(t).arity);
2995 printf ( " kind: "); print100(tycon(t).kind);
2996 printf ( " what: %d\n", tycon(t).what);
2997 printf ( " defn: "); print100(tycon(t).defn);
2998 printf ( " cToT: %d %s\n", tycon(t).conToTag,
2999 maybeNameStr(tycon(t).conToTag));
3000 printf ( " tToC: %d %s\n", tycon(t).tagToCon,
3001 maybeNameStr(tycon(t).tagToCon));
3002 printf ( " itbl: %p\n", tycon(t).itbl);
3003 printf ( " nextTH: %d %s\n", tycon(t).nextTyconHash,
3004 maybeTyconStr(tycon(t).nextTyconHash));
3008 void dumpName ( Int n )
3010 if (isName(NAMEMIN+n) && !isName(n)) n += NAMEMIN;
3012 printf ( "dumpName %d: not a name\n", n);
3016 printf ( " text: %s\n", textToStr(name(n).text) );
3017 printf ( " line: %d\n", name(n).line );
3018 printf ( " mod: %s\n", maybeModuleStr(name(n).mod));
3019 printf ( " syntax: %d\n", name(n).syntax );
3020 printf ( " parent: %d\n", name(n).parent );
3021 printf ( " arity: %d\n", name(n).arity );
3022 printf ( " number: %d\n", name(n).number );
3023 printf ( " type: "); print100(name(n).type);
3024 printf ( " defn: %d\n", name(n).defn );
3025 printf ( " stgVar: "); print100(name(n).stgVar);
3026 printf ( " cconv: %d\n", name(n).callconv );
3027 printf ( " primop: %p\n", name(n).primop );
3028 printf ( " itbl: %p\n", name(n).itbl );
3029 printf ( " nextNH: %d\n", name(n).nextNameHash );
3034 void dumpClass ( Int c )
3036 if (isClass(CLASSMIN+c) && !isClass(c)) c += CLASSMIN;
3038 printf ( "dumpClass %d: not a class\n", c);
3042 printf ( " text: %s\n", textToStr(cclass(c).text) );
3043 printf ( " line: %d\n", cclass(c).line );
3044 printf ( " mod: %s\n", maybeModuleStr(cclass(c).mod));
3045 printf ( " arity: %d\n", cclass(c).arity );
3046 printf ( " level: %d\n", cclass(c).level );
3047 printf ( " kinds: "); print100( cclass(c).kinds );
3048 printf ( " fds: %d\n", cclass(c).fds );
3049 printf ( " xfds: %d\n", cclass(c).xfds );
3050 printf ( " head: "); print100( cclass(c).head );
3051 printf ( " dcon: "); print100( cclass(c).dcon );
3052 printf ( " supers: "); print100( cclass(c).supers );
3053 printf ( " #supers: %d\n", cclass(c).numSupers );
3054 printf ( " dsels: "); print100( cclass(c).dsels );
3055 printf ( " members: "); print100( cclass(c).members );
3056 printf ( "#members: %d\n", cclass(c).numMembers );
3057 printf ( "defaults: "); print100( cclass(c).defaults );
3058 printf ( " insts: "); print100( cclass(c).instances );
3063 void dumpInst ( Int i )
3065 if (isInst(INSTMIN+i) && !isInst(i)) i += INSTMIN;
3067 printf ( "dumpInst %d: not an instance\n", i);
3071 printf ( " class: %s\n", maybeClassStr(inst(i).c) );
3072 printf ( " line: %d\n", inst(i).line );
3073 printf ( " mod: %s\n", maybeModuleStr(inst(i).mod));
3074 printf ( " kinds: "); print100( inst(i).kinds );
3075 printf ( " head: "); print100( inst(i).head );
3076 printf ( " specs: "); print100( inst(i).specifics );
3077 printf ( " #specs: %d\n", inst(i).numSpecifics );
3078 printf ( " impls: "); print100( inst(i).implements );
3079 printf ( " builder: %s\n", maybeNameStr( inst(i).builder ) );
3084 /* --------------------------------------------------------------------------
3086 * ------------------------------------------------------------------------*/
3088 /*---------------------------------------------------------------------------
3089 * GreenCard entry points
3091 * GreenCard generated code accesses Hugs data structures and functions
3092 * (only) via these functions (which are stored in the virtual function
3094 *-------------------------------------------------------------------------*/
3098 static Cell makeTuple Args((Int));
3099 static Cell makeInt Args((Int));
3100 static Cell makeChar Args((Char));
3101 static Char CharOf Args((Cell));
3102 static Cell makeFloat Args((FloatPro));
3103 static Void* derefMallocPtr Args((Cell));
3104 static Cell* Fst Args((Cell));
3105 static Cell* Snd Args((Cell));
3107 static Cell makeTuple(n) Int n; { return mkTuple(n); }
3108 static Cell makeInt(n) Int n; { return mkInt(n); }
3109 static Cell makeChar(n) Char n; { return mkChar(n); }
3110 static Char CharOf(n) Cell n; { return charOf(n); }
3111 static Cell makeFloat(n) FloatPro n; { return mkFloat(n); }
3112 static Void* derefMallocPtr(n) Cell n; { return derefMP(n); }
3113 static Cell* Fst(n) Cell n; { return (Cell*)&fst(n); }
3114 static Cell* Snd(n) Cell n; { return (Cell*)&snd(n); }
3116 HugsAPI1* hugsAPI1() {
3117 static HugsAPI1 api;
3118 static Bool initialised = FALSE;
3120 api.nameTrue = nameTrue;
3121 api.nameFalse = nameFalse;
3122 api.nameNil = nameNil;
3123 api.nameCons = nameCons;
3124 api.nameJust = nameJust;
3125 api.nameNothing = nameNothing;
3126 api.nameLeft = nameLeft;
3127 api.nameRight = nameRight;
3128 api.nameUnit = nameUnit;
3129 api.nameIORun = nameIORun;
3130 api.makeInt = makeInt;
3131 api.makeChar = makeChar;
3132 api.CharOf = CharOf;
3133 api.makeFloat = makeFloat;
3134 api.makeTuple = makeTuple;
3136 api.mkMallocPtr = mkMallocPtr;
3137 api.derefMallocPtr = derefMallocPtr;
3138 api.mkStablePtr = mkStablePtr;
3139 api.derefStablePtr = derefStablePtr;
3140 api.freeStablePtr = freeStablePtr;
3142 api.evalWithNoError = evalWithNoError;
3143 api.evalFails = evalFails;
3144 api.whnfArgs = &whnfArgs;
3145 api.whnfHead = &whnfHead;
3146 api.whnfInt = &whnfInt;
3147 api.whnfFloat = &whnfFloat;
3148 api.garbageCollect = garbageCollect;
3149 api.stackOverflow = hugsStackOverflow;
3150 api.internal = internal;
3151 api.registerPrims = registerPrims;
3152 api.addPrimCfun = addPrimCfun;
3153 api.inventText = inventText;
3156 api.cellStack = cellStack;
3162 #endif /* GREENCARD */
3165 /* --------------------------------------------------------------------------
3167 * ------------------------------------------------------------------------*/
3170 static void far* safeFarCalloc Args((Int,Int));
3171 static void far* safeFarCalloc(n,s) /* allocate table storage and check*/
3172 Int n, s; { /* for non-null return */
3173 void far* tab = farCalloc(n,s);
3175 ERRMSG(0) "Cannot allocate run-time tables"
3180 #define TABALLOC(v,t,n) v=(t far*)safeFarCalloc(n,sizeof(t));
3182 #define TABALLOC(v,t,n)
3190 case POSTPREL: break;
3192 case RESET : clearStack();
3194 /* the next 2 statements are particularly important
3195 * if you are using GLOBALfst or GLOBALsnd since the
3196 * corresponding registers may be reset to their
3197 * uninitialised initial values by a longjump.
3199 heapTopFst = heapFst + heapSize;
3200 heapTopSnd = heapSnd + heapSize;
3204 if (isNull(lastExprSaved))
3205 savedText = NUM_TEXT;
3210 for (i=NAMEMIN; i<nameHw; ++i) {
3211 mark(name(i).parent);
3213 mark(name(i).stgVar);
3216 end("Names", nameHw-NAMEMIN);
3219 for (i=MODMIN; i<moduleHw; ++i) {
3220 mark(module(i).tycons);
3221 mark(module(i).names);
3222 mark(module(i).classes);
3223 mark(module(i).exports);
3224 mark(module(i).qualImports);
3225 mark(module(i).objectExtraNames);
3227 end("Modules", moduleHw-MODMIN);
3230 for (i=TYCMIN; i<tyconHw; ++i) {
3231 mark(tycon(i).defn);
3232 mark(tycon(i).kind);
3233 mark(tycon(i).what);
3235 end("Type constructors", tyconHw-TYCMIN);
3238 for (i=CLASSMIN; i<classHw; ++i) {
3239 mark(cclass(i).head);
3240 mark(cclass(i).kinds);
3241 mark(cclass(i).fds);
3242 mark(cclass(i).xfds);
3243 mark(cclass(i).dsels);
3244 mark(cclass(i).supers);
3245 mark(cclass(i).members);
3246 mark(cclass(i).defaults);
3247 mark(cclass(i).instances);
3250 end("Classes", classHw-CLASSMIN);
3253 for (i=INSTMIN; i<instHw; ++i) {
3255 mark(inst(i).kinds);
3256 mark(inst(i).specifics);
3257 mark(inst(i).implements);
3259 end("Instances", instHw-INSTMIN);
3262 for (i=0; i<=sp; ++i)
3267 mark(lastExprSaved);
3270 end("Last expression", 3);
3275 end("C stack", stackRoots);
3280 case PREPREL : heapFst = heapAlloc(heapSize);
3281 heapSnd = heapAlloc(heapSize);
3283 if (heapFst==(Heap)0 || heapSnd==(Heap)0) {
3284 ERRMSG(0) "Cannot allocate heap storage (%d cells)",
3289 heapTopFst = heapFst + heapSize;
3290 heapTopSnd = heapSnd + heapSize;
3291 for (i=1; i<heapSize; ++i) {
3295 snd(-heapSize) = NIL;
3302 marksSize = bitArraySize(heapSize);
3303 if ((marks=(Int *)calloc(marksSize, sizeof(Int)))==0) {
3304 ERRMSG(0) "Unable to allocate gc markspace"
3308 TABALLOC(text, char, NUM_TEXT)
3309 TABALLOC(tyconHash, Tycon, TYCONHSZ)
3310 TABALLOC(tabTycon, struct strTycon, NUM_TYCON)
3311 TABALLOC(nameHash, Name, NAMEHSZ)
3312 TABALLOC(tabName, struct strName, NUM_NAME)
3313 TABALLOC(tabClass, struct strClass, NUM_CLASSES)
3314 TABALLOC(cellStack, Cell, NUM_STACK)
3315 TABALLOC(tabModule, struct Module, NUM_SCRIPTS)
3317 TABALLOC(tabExt, Text, NUM_EXT)
3322 nextNewText = NUM_TEXT;
3323 nextNewDText = (-1);
3324 lastExprSaved = NIL;
3325 savedText = NUM_TEXT;
3326 for (i=0; i<TEXTHSZ; ++i)
3327 textHash[i][0] = NOTEXT;
3333 for (i=0; i<TYCONHSZ; ++i)
3340 for (i=0; i<NAMEHSZ; ++i)
3351 tabInst = (struct strInst far *)
3352 farCalloc(NUM_INSTS,sizeof(struct strInst));
3355 ERRMSG(0) "Cannot allocate instance tables"
3365 /*-------------------------------------------------------------------------*/