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: 1999/10/19 23:51:58 $
14 * ------------------------------------------------------------------------*/
23 /*#define DEBUG_SHOWUSE*/
25 /* --------------------------------------------------------------------------
26 * local function prototypes:
27 * ------------------------------------------------------------------------*/
29 static Int local hash Args((String));
30 static Int local saveText Args((Text));
31 static Module local findQualifier Args((Text));
32 static Void local hashTycon Args((Tycon));
33 static List local insertTycon Args((Tycon,List));
34 static Void local hashName Args((Name));
35 static List local insertName Args((Name,List));
36 static Void local patternError Args((String));
37 static Bool local stringMatch Args((String,String));
38 static Bool local typeInvolves Args((Type,Type));
39 static Cell local markCell Args((Cell));
40 static Void local markSnd Args((Cell));
41 static Cell local lowLevelLastIn Args((Cell));
42 static Cell local lowLevelLastOut Args((Cell));
43 Module local moduleOfScript Args((Script));
44 Script local scriptThisFile Args((Text));
46 /* --------------------------------------------------------------------------
49 * provides storage for the characters making up identifier and symbol
50 * names, string literals, character constants etc...
52 * All character strings are stored in a large character array, with textHw
53 * pointing to the next free position. Lookup in the array is improved using
54 * a hash table. Internally, text strings are represented by integer offsets
55 * from the beginning of the array to the string in question.
57 * Where memory permits, the use of multiple hashtables gives a significant
58 * increase in performance, particularly when large source files are used.
60 * Each string in the array is terminated by a zero byte. No string is
61 * stored more than once, so that it is safe to test equality of strings by
62 * comparing the corresponding offsets.
64 * Special text values (beyond the range of the text array table) are used
65 * to generate unique `new variable names' as required.
67 * The same text storage is also used to hold text values stored in a saved
68 * expression. This grows downwards from the top of the text table (and is
69 * not included in the hash table).
70 * ------------------------------------------------------------------------*/
72 #define TEXTHSZ 512 /* Size of Text hash table */
73 #define NOTEXT ((Text)(~0)) /* Empty bucket in Text hash table */
74 static Text textHw; /* Next unused position */
75 static Text savedText = NUM_TEXT; /* Start of saved portion of text */
76 static Text nextNewText; /* Next new text value */
77 static Text nextNewDText; /* Next new dict text value */
78 static char DEFTABLE(text,NUM_TEXT);/* Storage of character strings */
79 static Text textHash[TEXTHSZ][NUM_TEXTH]; /* Hash table storage */
81 String textToStr(t) /* find string corresp to given Text*/
83 static char newVar[16];
85 if (0<=t && t<NUM_TEXT) /* standard char string */
88 sprintf(newVar,"d%d",-t); /* dictionary variable */
90 sprintf(newVar,"v%d",t-NUM_TEXT); /* normal variable */
94 String identToStr(v) /*find string corresp to given ident or qualified name*/
97 internal("identToStr");
103 case CONOPCELL : return text+textOf(v);
105 case QUALIDENT : { Text pos = textHw;
107 while (pos+1 < savedText && text[t]!=0) {
108 text[pos++] = text[t++];
110 if (pos+1 < savedText) {
114 while (pos+1 < savedText && text[t]!=0) {
115 text[pos++] = text[t++];
121 internal("identToStr2");
122 return 0; /* NOTREACHED */
125 Text inventText() { /* return new unused variable name */
126 return nextNewText++;
129 Text inventDictText() { /* return new unused dictvar name */
130 return nextNewDText--;
133 Bool inventedText(t) /* Signal TRUE if text has been */
134 Text t; { /* generated internally */
135 return (t<0 || t>=NUM_TEXT);
138 #define MAX_FIXLIT 100
139 Text fixLitText(t) /* fix literal text that might include \ */
141 String s = textToStr(t);
144 for(i = 0;i < MAX_FIXLIT-2 && *s;s++) {
150 if (i < MAX_FIXLIT-2) {
153 ERRMSG(0) "storage space exhausted for internal literal string"
156 return (findText(p));
160 static Int local hash(s) /* Simple hash function on strings */
164 for (v=((int)(*s))*8; *s; s++)
165 v += ((int)(*s))*(j++);
171 Text findText(s) /* Locate string in Text array */
175 Text textPos = textHash[h][hashno];
177 #define TryMatch { Text originalTextPos = textPos; \
179 for (t=s; *t==text[textPos]; textPos++,t++) \
181 return originalTextPos; \
183 #define Skip while (text[textPos++]) ;
185 while (textPos!=NOTEXT) {
187 if (++hashno<NUM_TEXTH) /* look in next hashtable entry */
188 textPos = textHash[h][hashno];
191 while (textPos < textHw) {
202 textPos = textHw; /* if not found, save in array */
203 if (textHw + (Int)strlen(s) + 1 > savedText) {
204 ERRMSG(0) "Character string storage space exhausted"
207 while ((text[textHw++] = *s++) != 0) {
209 if (hashno<NUM_TEXTH) { /* updating hash table as necessary */
210 textHash[h][hashno] = textPos;
211 if (hashno<NUM_TEXTH-1)
212 textHash[h][hashno+1] = NOTEXT;
218 static Int local saveText(t) /* Save text value in buffer */
219 Text t; { /* at top of text table */
220 String s = textToStr(t);
223 if (textHw + l + 1 > savedText) {
224 ERRMSG(0) "Character string storage space exhausted"
228 strcpy(text+savedText,s);
233 /* --------------------------------------------------------------------------
236 * Currently, the only attributes that we store for each Ext value is the
237 * corresponding Text label. At some later stage, we may decide to cache
238 * types, predicates, etc. here as a space saving gesture. Given that Text
239 * comparison is cheap, and that this is an experimental implementation, we
240 * will use a straightforward linear search to locate Ext values from their
241 * corresponding Text labels; a hashing scheme can be introduced later if
242 * this turns out to be a problem.
243 * ------------------------------------------------------------------------*/
246 Text DEFTABLE(tabExt,NUM_EXT); /* Storage for Ext names */
249 Ext mkExt(t) /* Allocate or find an Ext value */
255 if (extHw-EXTMIN >= NUM_EXT) {
256 ERRMSG(0) "Ext storage space exhausted"
264 /* --------------------------------------------------------------------------
267 * A Tycon represents a user defined type constructor. Tycons are indexed
268 * by Text values ... a very simple hash function is used to improve lookup
269 * times. Tycon entries with the same hash code are chained together, with
270 * the most recent entry at the front of the list.
271 * ------------------------------------------------------------------------*/
273 #define TYCONHSZ 256 /* Size of Tycon hash table*/
274 #define tHash(x) ((x)%TYCONHSZ) /* Tycon hash function */
275 static Tycon tyconHw; /* next unused Tycon */
276 static Tycon DEFTABLE(tyconHash,TYCONHSZ); /* Hash table storage */
277 struct strTycon DEFTABLE(tabTycon,NUM_TYCON); /* Tycon storage */
279 Tycon newTycon(t) /* add new tycon to tycon table */
282 if (tyconHw-TYCMIN >= NUM_TYCON) {
283 ERRMSG(0) "Type constructor storage space exhausted"
286 tycon(tyconHw).text = t; /* clear new tycon record */
287 tycon(tyconHw).kind = NIL;
288 tycon(tyconHw).defn = NIL;
289 tycon(tyconHw).what = NIL;
290 tycon(tyconHw).conToTag = NIL;
291 tycon(tyconHw).tagToCon = NIL;
292 tycon(tyconHw).mod = currentModule;
293 module(currentModule).tycons = cons(tyconHw,module(currentModule).tycons);
294 tycon(tyconHw).nextTyconHash = tyconHash[h];
295 tyconHash[h] = tyconHw;
300 Tycon findTycon(t) /* locate Tycon in tycon table */
302 Tycon tc = tyconHash[tHash(t)];
304 while (nonNull(tc) && tycon(tc).text!=t)
305 tc = tycon(tc).nextTyconHash;
309 Tycon addTycon(tc) /* Insert Tycon in tycon table - if no clash is caused */
311 Tycon oldtc = findTycon(tycon(tc).text);
314 module(currentModule).tycons=cons(tc,module(currentModule).tycons);
320 static Void local hashTycon(tc) /* Insert Tycon into hash table */
324 Text t = tycon(tc).text;
326 tycon(tc).nextTyconHash = tyconHash[h];
331 Tycon findQualTycon(id) /*locate (possibly qualified) Tycon in tycon table */
333 if (!isPair(id)) internal("findQualTycon");
337 return findTycon(textOf(id));
339 Text t = qtextOf(id);
340 Module m = findQualifier(qmodOf(id));
342 if (isNull(m)) return NIL;
343 for(es=module(m).exports; nonNull(es); es=tl(es)) {
345 if (isPair(e) && isTycon(fst(e)) && tycon(fst(e)).text==t)
350 default : internal("findQualTycon2");
352 return 0; /* NOTREACHED */
355 Tycon addPrimTycon(t,kind,ar,what,defn) /* add new primitive type constr */
361 Tycon tc = newTycon(t);
363 tycon(tc).kind = kind;
364 tycon(tc).what = what;
365 tycon(tc).defn = defn;
366 tycon(tc).arity = ar;
370 static List local insertTycon(tc,ts) /* insert tycon tc into sorted list*/
375 String s = textToStr(tycon(tc).text);
377 while (nonNull(curr) && strCompare(s,textToStr(tycon(hd(curr)).text))>=0) {
378 if (hd(curr)==tc) /* just in case we get duplicates! */
384 tl(prev) = cons(tc,curr);
388 return cons(tc,curr);
391 List addTyconsMatching(pat,ts) /* Add tycons matching pattern pat */
392 String pat; /* to list of Tycons ts */
393 List ts; { /* Null pattern matches every tycon*/
394 Tycon tc; /* (Tycons with NIL kind excluded) */
395 for (tc=TYCMIN; tc<tyconHw; ++tc)
396 if (!pat || stringMatch(pat,textToStr(tycon(tc).text)))
397 if (nonNull(tycon(tc).kind))
398 ts = insertTycon(tc,ts);
402 /* --------------------------------------------------------------------------
405 * A Name represents a top level binding of a value to an identifier.
406 * Such values may be a constructor function, a member function in a
407 * class, a user-defined or primitive value/function.
409 * Names are indexed by Text values ... a very simple hash functions speeds
410 * access to the table of Names and Name entries with the same hash value
411 * are chained together, with the most recent entry at the front of the
413 * ------------------------------------------------------------------------*/
415 #define NAMEHSZ 256 /* Size of Name hash table */
416 #define nHash(x) ((x)%NAMEHSZ) /* hash fn :: Text->Int */
417 Name nameHw; /* next unused name */
418 static Name DEFTABLE(nameHash,NAMEHSZ); /* Hash table storage */
419 struct strName DEFTABLE(tabName,NUM_NAME); /* Name table storage */
421 Name newName(t,parent) /* Add new name to name table */
425 if (nameHw-NAMEMIN >= NUM_NAME) {
426 ERRMSG(0) "Name storage space exhausted"
429 name(nameHw).text = t; /* clear new name record */
430 name(nameHw).line = 0;
431 name(nameHw).syntax = NO_SYNTAX;
432 name(nameHw).parent = parent;
433 name(nameHw).arity = 0;
434 name(nameHw).number = EXECNAME;
435 name(nameHw).defn = NIL;
436 name(nameHw).stgVar = NIL;
437 name(nameHw).stgSize = 0;
438 name(nameHw).inlineMe = FALSE;
439 name(nameHw).simplified = FALSE;
440 name(nameHw).isDBuilder = FALSE;
441 name(nameHw).type = NIL;
442 name(nameHw).primop = 0;
443 name(nameHw).mod = currentModule;
444 module(currentModule).names=cons(nameHw,module(currentModule).names);
445 name(nameHw).nextNameHash = nameHash[h];
446 nameHash[h] = nameHw;
450 Name findName(t) /* Locate name in name table */
452 Name n = nameHash[nHash(t)];
454 while (nonNull(n) && name(n).text!=t)
455 n = name(n).nextNameHash;
459 Name addName(nm) /* Insert Name in name table - if */
460 Name nm; { /* no clash is caused */
461 Name oldnm = findName(name(nm).text);
464 module(currentModule).names=cons(nm,module(currentModule).names);
470 static Void local hashName(nm) /* Insert Name into hash table */
477 name(nm).nextNameHash = nameHash[h];
481 Name findQualName(id) /* Locate (possibly qualified) name*/
482 Cell id; { /* in name table */
484 internal("findQualName");
490 return findName(textOf(id));
492 Text t = qtextOf(id);
493 Module m = findQualifier(qmodOf(id));
495 if (isNull(m)) return NIL;
496 for(es=module(m).exports; nonNull(es); es=tl(es)) {
498 if (isName(e) && name(e).text==t)
500 else if (isPair(e) && DOTDOT==snd(e)) {
501 List subentities = NIL;
504 && (tycon(c).what==DATATYPE || tycon(c).what==NEWTYPE))
505 subentities = tycon(c).defn;
507 subentities = cclass(c).members;
508 for(; nonNull(subentities); subentities=tl(subentities)) {
509 if (!isName(hd(subentities)))
510 internal("findQualName3");
511 if (name(hd(subentities)).text == t)
512 return hd(subentities);
518 default : internal("findQualName2");
520 return 0; /* NOTREACHED */
524 Name nameFromStgVar ( StgVar v )
527 for (n = NAMEMIN; n < nameHw; n++)
528 if (name(n).stgVar == v) return n;
532 void* getHugs_AsmObject_for ( char* s )
535 Name n = findName(findText(s));
536 if (isNull(n)) internal("getHugs_AsmObject_for(1)");
538 if (!isStgVar(v) || !isPtr(stgVarInfo(v)))
539 internal("getHugs_AsmObject_for(2)");
540 return ptrOf(stgVarInfo(v));
543 /* --------------------------------------------------------------------------
544 * Primitive functions:
545 * ------------------------------------------------------------------------*/
547 Name addPrimCfunREP(t,arity,no,rep) /* add primitive constructor func */
548 Text t; /* sets rep, not type */
551 Int rep; { /* Really AsmRep */
552 Name n = newName(t,NIL);
553 name(n).arity = arity;
554 name(n).number = cfunNo(no);
556 name(n).primop = (void*)rep;
561 Name addPrimCfun(t,arity,no,type) /* add primitive constructor func */
566 Name n = newName(t,NIL);
567 name(n).arity = arity;
568 name(n).number = cfunNo(no);
574 Int sfunPos(s,c) /* Find position of field with */
575 Name s; /* selector s in constructor c. */
579 for (; nonNull(cns); cns=tl(cns))
581 return intOf(snd(hd(cns)));
583 return 0;/* NOTREACHED */
586 static List local insertName(nm,ns) /* insert name nm into sorted list */
591 String s = textToStr(name(nm).text);
593 while (nonNull(curr) && strCompare(s,textToStr(name(hd(curr)).text))>=0) {
594 if (hd(curr)==nm) /* just in case we get duplicates! */
600 tl(prev) = cons(nm,curr);
604 return cons(nm,curr);
607 List addNamesMatching(pat,ns) /* Add names matching pattern pat */
608 String pat; /* to list of names ns */
609 List ns; { /* Null pattern matches every name */
610 Name nm; /* (Names with NIL type, or hidden */
612 for (nm=NAMEMIN; nm<nameHw; ++nm) /* or invented names are excluded) */
613 if (!inventedText(name(nm).text) && nonNull(name(nm).type)) {
614 String str = textToStr(name(nm).text);
615 if (str[0]!='_' && (!pat || stringMatch(pat,str)))
616 ns = insertName(nm,ns);
620 List mns = module(currentModule).names;
621 for(; nonNull(mns); mns=tl(mns)) {
623 if (!inventedText(name(nm).text)) {
624 String str = textToStr(name(nm).text);
625 if (str[0]!='_' && (!pat || stringMatch(pat,str)))
626 ns = insertName(nm,ns);
633 /* --------------------------------------------------------------------------
634 * A simple string matching routine
635 * `*' matches any sequence of zero or more characters
636 * `?' matches any single character exactly
637 * `@str' matches the string str exactly (ignoring any special chars)
638 * `\c' matches the character c only (ignoring special chars)
639 * c matches the character c only
640 * ------------------------------------------------------------------------*/
642 static Void local patternError(s) /* report error in pattern */
644 ERRMSG(0) "%s in pattern", s
648 static Bool local stringMatch(pat,str) /* match string against pattern */
654 case '\0' : return (*str=='\0');
657 if (stringMatch(pat+1,str))
662 case '?' : if (*str++=='\0')
667 case '[' : { Bool found = FALSE;
668 while (*++pat!='\0' && *pat!=']')
669 if (!found && ( pat[0] == *str ||
678 patternError("missing `]'");
686 case '\\' : if (*++pat == '\0')
687 patternError("extra trailing `\\'");
689 default : if (*pat++ != *str++)
695 /* --------------------------------------------------------------------------
696 * Storage of type classes, instances etc...:
697 * ------------------------------------------------------------------------*/
699 static Class classHw; /* next unused class */
700 static List classes; /* list of classes in current scope */
701 static Inst instHw; /* next unused instance record */
703 struct strClass DEFTABLE(tabClass,NUM_CLASSES); /* table of class records */
704 struct strInst far *tabInst; /* (pointer to) table of instances */
706 Class newClass(t) /* add new class to class table */
708 if (classHw-CLASSMIN >= NUM_CLASSES) {
709 ERRMSG(0) "Class storage space exhausted"
712 cclass(classHw).text = t;
713 cclass(classHw).arity = 0;
714 cclass(classHw).kinds = NIL;
715 cclass(classHw).head = NIL;
716 cclass(classHw).dcon = NIL;
717 cclass(classHw).supers = NIL;
718 cclass(classHw).dsels = NIL;
719 cclass(classHw).members = NIL;
720 cclass(classHw).defaults = NIL;
721 cclass(classHw).instances = NIL;
722 classes=cons(classHw,classes);
723 cclass(classHw).mod = currentModule;
724 module(currentModule).classes=cons(classHw,module(currentModule).classes);
728 Class classMax() { /* Return max Class in use ... */
729 return classHw; /* This is a bit ugly, but it's not*/
730 } /* worth a lot of effort right now */
732 Class findClass(t) /* look for named class in table */
736 for (cs=classes; nonNull(cs); cs=tl(cs)) {
738 if (cclass(cl).text==t)
744 Class addClass(c) /* Insert Class in class list */
745 Class c; { /* - if no clash caused */
746 Class oldc = findClass(cclass(c).text);
748 classes=cons(c,classes);
749 module(currentModule).classes=cons(c,module(currentModule).classes);
756 Class findQualClass(c) /* Look for (possibly qualified) */
757 Cell c; { /* class in class list */
758 if (!isQualIdent(c)) {
759 return findClass(textOf(c));
762 Module m = findQualifier(qmodOf(c));
766 for (es=module(m).exports; nonNull(es); es=tl(es)) {
768 if (isPair(e) && isClass(fst(e)) && cclass(fst(e)).text==t)
775 Inst newInst() { /* Add new instance to table */
776 if (instHw-INSTMIN >= NUM_INSTS) {
777 ERRMSG(0) "Instance storage space exhausted"
780 inst(instHw).kinds = NIL;
781 inst(instHw).head = NIL;
782 inst(instHw).specifics = NIL;
783 inst(instHw).implements = NIL;
784 inst(instHw).builder = NIL;
785 inst(instHw).mod = currentModule;
791 extern Void printInst Args((Inst));
795 Class cl = inst(in).c;
796 Printf("%s-", textToStr(cclass(cl).text));
797 printType(stdout,inst(in).t);
799 #endif /* DEBUG_DICTS */
801 Inst findFirstInst(tc) /* look for 1st instance involving */
802 Tycon tc; { /* the type constructor tc */
803 return findNextInst(tc,INSTMIN-1);
806 Inst findNextInst(tc,in) /* look for next instance involving*/
807 Tycon tc; /* the type constructor tc */
808 Inst in; { /* starting after instance in */
809 while (++in < instHw) {
810 Cell pi = inst(in).head;
811 for (; isAp(pi); pi=fun(pi))
812 if (typeInvolves(arg(pi),tc))
818 static Bool local typeInvolves(ty,tc) /* Test to see if type ty involves */
819 Type ty; /* type constructor/tuple tc. */
822 || (isAp(ty) && (typeInvolves(fun(ty),tc)
823 || typeInvolves(arg(ty),tc)));
826 /* --------------------------------------------------------------------------
829 * Various parts of the system use a stack of cells. Most of the stack
830 * operations are defined as macros, expanded inline.
831 * ------------------------------------------------------------------------*/
833 Cell DEFTABLE(cellStack,NUM_STACK); /* Storage for cells on stack */
834 StackPtr sp; /* stack pointer */
836 #if GIMME_STACK_DUMPS
838 #define UPPER_DISP 5 /* # display entries on top of stack */
839 #define LOWER_DISP 5 /* # display entries on bottom of stack*/
841 Void hugsStackOverflow() { /* Report stack overflow */
843 extern Cell evalRoots[];
845 ERRMSG(0) "Control stack overflow" ETHEN
848 if (rootsp>=UPPER_DISP+LOWER_DISP) {
849 for (i=0; i<UPPER_DISP; i++) {
850 ERRTEXT "\nwhile evaluating: " ETHEN
851 ERREXPR(evalRoots[rootsp-i]);
853 ERRTEXT "\n..." ETHEN
854 for (i=LOWER_DISP-1; i>=0; i--) {
855 ERRTEXT "\nwhile evaluating: " ETHEN
856 ERREXPR(evalRoots[i]);
860 for (i=rootsp; i>=0; i--) {
861 ERRTEXT "\nwhile evaluating: " ETHEN
862 ERREXPR(evalRoots[i]);
870 #else /* !GIMME_STACK_DUMPS */
872 Void hugsStackOverflow() { /* Report stack overflow */
873 ERRMSG(0) "Control stack overflow"
877 #endif /* !GIMME_STACK_DUMPS */
879 /* --------------------------------------------------------------------------
882 * A Module represents a user defined module.
884 * Note: there are now two lookup mechanisms in the system:
886 * 1) The exports from a module are stored in a big list.
887 * We resolve qualified names, and import lists by linearly scanning
890 * 2) Unqualified imports and local definitions for the current module
891 * are stored in hash tables (tyconHash and nameHash) or linear lists
894 * ------------------------------------------------------------------------*/
896 static Module moduleHw; /* next unused Module */
897 struct Module DEFTABLE(tabModule,NUM_MODULE); /* Module storage */
898 Module currentModule; /* Module currently being processed*/
900 Bool isValidModule(m) /* is m a legitimate module id? */
902 return (MODMIN <= m && m < moduleHw);
905 Module newModule(t) /* add new module to module table */
907 if (moduleHw-MODMIN >= NUM_MODULE) {
908 ERRMSG(0) "Module storage space exhausted"
911 module(moduleHw).text = t; /* clear new module record */
912 module(moduleHw).qualImports = NIL;
913 module(moduleHw).exports = NIL;
914 module(moduleHw).tycons = NIL;
915 module(moduleHw).names = NIL;
916 module(moduleHw).classes = NIL;
917 module(moduleHw).oImage = NULL;
918 module(moduleHw).oTab = NULL;
919 module(moduleHw).sizeoTab = 0;
920 module(moduleHw).usedoTab = 0;
921 module(moduleHw).dlTab = NULL;
922 module(moduleHw).sizedlTab = 0;
923 module(moduleHw).useddlTab = 0;
927 void ppModules ( void )
930 fflush(stderr); fflush(stdout);
931 printf ( "begin MODULES\n" );
932 for (i = moduleHw-1; i >= MODMIN; i--)
933 printf ( " %2d: %16s\n",
934 i-MODMIN, textToStr(module(i).text)
936 printf ( "end MODULES\n" );
937 fflush(stderr); fflush(stdout);
941 Module findModule(t) /* locate Module in module table */
944 for(m=MODMIN; m<moduleHw; ++m) {
945 if (module(m).text==t)
951 Module findModid(c) /* Find module by name or filename */
954 case STRCELL : { Script s = scriptThisFile(snd(c));
955 return (s==-1) ? NIL : moduleOfScript(s);
957 case CONIDCELL : return findModule(textOf(c));
958 default : internal("findModid");
960 assert(0); return 0; /* NOTREACHED */
963 static local Module findQualifier(t) /* locate Module in import list */
966 printf ( "findQualifier %s\n", textToStr(t));
967 for (ms=module(currentModule).qualImports; nonNull(ms); ms=tl(ms)) {
968 if (textOf(fst(hd(ms)))==t)
972 if (module(currentModule).text==t)
973 return currentModule;
978 Void setCurrModule(m) /* set lookup tables for current module */
982 if (m!=currentModule) {
983 currentModule = m; /* This is the only assignment to currentModule */
984 for (i=0; i<TYCONHSZ; ++i)
986 mapProc(hashTycon,module(m).tycons);
987 for (i=0; i<NAMEHSZ; ++i)
989 mapProc(hashName,module(m).names);
990 classes = module(m).classes;
994 Name jrsFindQualName ( Text mn, Text sn )
999 for (m=MODMIN; m<moduleHw; m++)
1000 if (module(m).text == mn) break;
1001 if (m == moduleHw) return NIL;
1003 for (ns = module(m).names; nonNull(ns); ns=tl(ns))
1004 if (name(hd(ns)).text == sn) return hd(ns);
1010 /* A bit tricky. Assumes that if tab==NULL, then
1011 currUsed and *currSize must be zero.
1014 void* genericExpand ( void* tab,
1015 int* currSize, int currUsed,
1016 int initSize, int elemSize )
1020 if (currUsed < *currSize)
1022 size2 = (*currSize == 0) ? initSize : (2 * *currSize);
1023 tab2 = malloc ( size2 * elemSize );
1025 ERRMSG(0) "Can't allocate enough memory to resize a table"
1029 memcpy ( tab2, tab, elemSize * *currSize );
1031 if (tab) free ( tab );
1035 void addOTabName ( Module m, char* nm, void* ad )
1038 = genericExpand ( module(m).oTab,
1039 &module(m).sizeoTab,
1043 module(m).oTab[ module(m).usedoTab ].nm = nm;
1044 module(m).oTab[ module(m).usedoTab ].ad = ad;
1045 module(m).usedoTab++;
1049 void addDLSect ( Module m, void* start, void* end, DLSect sect )
1052 = genericExpand ( module(m).dlTab,
1053 &module(m).sizedlTab,
1054 module(m).useddlTab,
1055 4, sizeof(DLTabEnt) );
1056 module(m).dlTab[ module(m).useddlTab ].start = start;
1057 module(m).dlTab[ module(m).useddlTab ].end = end;
1058 module(m).dlTab[ module(m).useddlTab ].sect = sect;
1059 module(m).useddlTab++;
1063 void* lookupOTabName ( Module m, char* nm )
1066 for (i = 0; i < module(m).usedoTab; i++)
1067 if (0==strcmp(nm,module(m).oTab[i].nm))
1068 return module(m).oTab[i].ad;
1073 char* nameFromOPtr ( void* p )
1077 for (m=MODMIN; m<moduleHw; m++)
1078 for (i = 0; i < module(m).usedoTab; i++)
1079 if (p == module(m).oTab[i].ad)
1080 return module(m).oTab[i].nm;
1085 DLSect lookupDLSect ( void* ad )
1089 for (m=MODMIN; m<moduleHw; m++)
1090 for (i = 0; i < module(m).useddlTab; i++)
1091 if (module(m).dlTab[i].start <= ad &&
1092 ad <= module(m).dlTab[i].end)
1093 return module(m).dlTab[i].sect;
1094 return HUGS_DL_SECTION_OTHER;
1098 /* --------------------------------------------------------------------------
1099 * Script file storage:
1101 * script files are read into the system one after another. The state of
1102 * the stored data structures (except the garbage-collected heap) is recorded
1103 * before reading a new script. In the event of being unable to read the
1104 * script, or if otherwise requested, the system can be restored to its
1105 * original state immediately before the file was read.
1106 * ------------------------------------------------------------------------*/
1108 typedef struct { /* record of storage state prior to */
1109 Text file; /* reading script/module */
1123 #ifdef DEBUG_SHOWUSE
1124 static Void local showUse(msg,val,mx)
1127 Printf("%6s : %5d of %5d (%2d%%)\n",msg,val,mx,(100*val)/mx);
1131 static Script scriptHw; /* next unused script number */
1132 static script scripts[NUM_SCRIPTS]; /* storage for script records */
1135 void ppScripts ( void )
1138 fflush(stderr); fflush(stdout);
1139 printf ( "begin SCRIPTS\n" );
1140 for (i = scriptHw-1; i >= 0; i--)
1141 printf ( " %2d: %16s tH=%d mH=%d yH=%d "
1142 "nH=%d cH=%d iH=%d nnS=%d,%d\n",
1143 i, textToStr(scripts[i].file),
1144 scripts[i].textHw, scripts[i].moduleHw,
1145 scripts[i].tyconHw, scripts[i].nameHw,
1146 scripts[i].classHw, scripts[i].instHw,
1147 scripts[i].nextNewText, scripts[i].nextNewDText
1149 printf ( "end SCRIPTS\n" );
1150 fflush(stderr); fflush(stdout);
1153 Script startNewScript(f) /* start new script, keeping record */
1154 String f; { /* of status for later restoration */
1155 if (scriptHw >= NUM_SCRIPTS) {
1156 ERRMSG(0) "Too many script files in use"
1159 #ifdef DEBUG_SHOWUSE
1160 showUse("Text", textHw, NUM_TEXT);
1161 showUse("Module", moduleHw-MODMIN, NUM_MODULE);
1162 showUse("Tycon", tyconHw-TYCMIN, NUM_TYCON);
1163 showUse("Name", nameHw-NAMEMIN, NUM_NAME);
1164 showUse("Class", classHw-CLASSMIN, NUM_CLASSES);
1165 showUse("Inst", instHw-INSTMIN, NUM_INSTS);
1167 showUse("Ext", extHw-EXTMIN, NUM_EXT);
1170 scripts[scriptHw].file = findText( f ? f : "<nofile>" );
1171 scripts[scriptHw].textHw = textHw;
1172 scripts[scriptHw].nextNewText = nextNewText;
1173 scripts[scriptHw].nextNewDText = nextNewDText;
1174 scripts[scriptHw].moduleHw = moduleHw;
1175 scripts[scriptHw].tyconHw = tyconHw;
1176 scripts[scriptHw].nameHw = nameHw;
1177 scripts[scriptHw].classHw = classHw;
1178 scripts[scriptHw].instHw = instHw;
1180 scripts[scriptHw].extHw = extHw;
1185 Bool isPreludeScript() { /* Test whether this is the Prelude*/
1186 return (scriptHw==0);
1189 Bool moduleThisScript(m) /* Test if given module is defined */
1190 Module m; { /* in current script file */
1191 return scriptHw<1 || m>=scripts[scriptHw-1].moduleHw;
1194 Module lastModule() { /* Return module in current script file */
1195 return (moduleHw>MODMIN ? moduleHw-1 : modulePrelude);
1198 #define scriptThis(nm,t,tag) Script nm(x) \
1202 && x>=scripts[s].tag) \
1206 scriptThis(scriptThisName,Name,nameHw)
1207 scriptThis(scriptThisTycon,Tycon,tyconHw)
1208 scriptThis(scriptThisInst,Inst,instHw)
1209 scriptThis(scriptThisClass,Class,classHw)
1212 Module moduleOfScript(s)
1214 return (s==0) ? modulePrelude : scripts[s-1].moduleHw;
1217 String fileOfModule(m)
1220 if (m == modulePrelude) {
1223 for(s=0; s<scriptHw; ++s) {
1224 if (scripts[s].moduleHw == m) {
1225 return textToStr(scripts[s].file);
1231 Script scriptThisFile(f)
1234 for (s=0; s < scriptHw; ++s) {
1235 if (scripts[s].file == f) {
1239 if (f == findText(STD_PRELUDE)) {
1245 Void dropScriptsFrom(sno) /* Restore storage to state prior */
1246 Script sno; { /* to reading script sno */
1247 if (sno<scriptHw) { /* is there anything to restore? */
1249 textHw = scripts[sno].textHw;
1250 nextNewText = scripts[sno].nextNewText;
1251 nextNewDText = scripts[sno].nextNewDText;
1252 moduleHw = scripts[sno].moduleHw;
1253 tyconHw = scripts[sno].tyconHw;
1254 nameHw = scripts[sno].nameHw;
1255 classHw = scripts[sno].classHw;
1256 instHw = scripts[sno].instHw;
1258 dictHw = scripts[sno].dictHw;
1261 extHw = scripts[sno].extHw;
1265 for (i=moduleHw; i >= scripts[sno].moduleHw; --i) {
1266 if (module(i).objectFile) {
1267 printf("[bogus] closing objectFile for module %d\n",i);
1268 /*dlclose(module(i).objectFile);*/
1271 moduleHw = scripts[sno].moduleHw;
1273 for (i=0; i<TEXTHSZ; ++i) {
1275 while (j<NUM_TEXTH && textHash[i][j]!=NOTEXT
1276 && textHash[i][j]<textHw)
1279 textHash[i][j] = NOTEXT;
1283 for (i=0; i<TYCONHSZ; ++i) {
1286 for (i=0; i<NAMEHSZ; ++i) {
1290 for (i=CLASSMIN; i<classHw; i++) {
1291 List ins = cclass(i).instances;
1294 while (nonNull(ins)) {
1295 List temp = tl(ins);
1296 if (hd(ins)<instHw) {
1302 cclass(i).instances = rev(is);
1309 /* --------------------------------------------------------------------------
1312 * Provides a garbage collectable heap for storage of expressions etc.
1314 * Now incorporates a flat resource: A two-space collected extension of
1315 * the heap that provides storage for contiguous arrays of Cell storage,
1316 * cooperating with the garbage collection mechanisms for the main heap.
1317 * ------------------------------------------------------------------------*/
1319 Int heapSize = DEFAULTHEAP; /* number of cells in heap */
1320 Heap heapFst; /* array of fst component of pairs */
1321 Heap heapSnd; /* array of snd component of pairs */
1328 Bool consGC = TRUE; /* Set to FALSE to turn off gc from*/
1329 /* C stack; use with extreme care! */
1331 Int numGcs; /* number of garbage collections */
1332 Int cellsRecovered; /* number of cells recovered */
1334 static Cell freeList; /* free list of unused cells */
1335 static Cell lsave, rsave; /* save components of pair */
1339 static Int markCount, stackRoots;
1341 #define initStackRoots() stackRoots = 0
1342 #define recordStackRoot() stackRoots++
1355 #define start() markCount = 0
1356 #define end(thing,rs) \
1358 Printf("GC: %-18s: %4d cells, %4d roots.\n", thing, markCount, rs); \
1361 #define recordMark() markCount++
1363 #else /* !GC_STATISTICS */
1368 #define initStackRoots()
1369 #define recordStackRoot()
1372 #define end(thing,root)
1373 #define recordMark()
1375 #endif /* !GC_STATISTICS */
1377 Cell pair(l,r) /* Allocate pair (l, r) from */
1378 Cell l, r; { /* heap, garbage collecting first */
1379 Cell c = freeList; /* if necessary ... */
1391 freeList = snd(freeList);
1398 Void overwrite(dst,src) /* overwrite dst cell with src cell*/
1399 Cell dst, src; { /* both *MUST* be pairs */
1400 if (isPair(dst) && isPair(src)) {
1401 fst(dst) = fst(src);
1402 snd(dst) = snd(src);
1405 internal("overwrite");
1409 static Int marksSize;
1411 Cell markExpr(c) /* External interface to markCell */
1413 return isGenPair(c) ? markCell(c) : c;
1416 static Cell local markCell(c) /* Traverse part of graph marking */
1417 Cell c; { /* cells reachable from given root */
1418 /* markCell(c) is only called if c */
1420 { register int place = placeInSet(c);
1421 register int mask = maskInSet(c);
1422 if (marks[place]&mask)
1425 marks[place] |= mask;
1430 if (isGenPair(fst(c))) {
1431 fst(c) = markCell(fst(c));
1434 else if (isNull(fst(c)) || fst(c)>=BCSTAG) {
1441 static Void local markSnd(c) /* Variant of markCell used to */
1442 Cell c; { /* update snd component of cell */
1443 Cell t; /* using tail recursion */
1445 ma: t = c; /* Keep pointer to original pair */
1450 { register int place = placeInSet(c);
1451 register int mask = maskInSet(c);
1452 if (marks[place]&mask)
1455 marks[place] |= mask;
1460 if (isGenPair(fst(c))) {
1461 fst(c) = markCell(fst(c));
1464 else if (isNull(fst(c)) || fst(c)>=BCSTAG)
1469 Void markWithoutMove(n) /* Garbage collect cell at n, as if*/
1470 Cell n; { /* it was a cell ref, but don't */
1471 /* move cell so we don't have */
1472 /* to modify the stored value of n */
1479 Void garbageCollect() { /* Run garbage collector ... */
1480 Bool breakStat = breakOn(FALSE); /* disable break checking */
1486 jmp_buf regs; /* save registers on stack */
1490 for (i=0; i<marksSize; ++i) /* initialise mark set to empty */
1493 everybody(MARK); /* Mark all components of system */
1495 gcScanning(); /* scan mark set */
1502 for (i=1; i<=heapSize; i++) {
1503 if ((marks[place] & mask) == 0) {
1510 if (++j == bitsPerWord) {
1517 gcRecovered(recovered);
1518 breakOn(breakStat); /* restore break trapping if nec. */
1522 /* can only return if freeList is nonempty on return. */
1523 if (recovered<minRecovery || isNull(freeList)) {
1524 ERRMSG(0) "Garbage collection fails to reclaim sufficient space"
1527 cellsRecovered = recovered;
1530 /* --------------------------------------------------------------------------
1531 * Code for saving last expression entered:
1533 * This is a little tricky because some text values (e.g. strings or variable
1534 * names) may not be defined or have the same value when the expression is
1535 * recalled. These text values are therefore saved in the top portion of
1537 * ------------------------------------------------------------------------*/
1539 static Cell lastExprSaved; /* last expression to be saved */
1541 Void setLastExpr(e) /* save expression for later recall*/
1543 lastExprSaved = NIL; /* in case attempt to save fails */
1544 savedText = NUM_TEXT;
1545 lastExprSaved = lowLevelLastIn(e);
1548 static Cell local lowLevelLastIn(c) /* Duplicate expression tree (i.e. */
1549 Cell c; { /* acyclic graph) for later recall */
1550 if (isPair(c)) { /* Duplicating any text strings */
1551 if (isBoxTag(fst(c))) /* in case these are lost at some */
1552 switch (fst(c)) { /* point before the expr is reused */
1558 case STRCELL : return pair(fst(c),saveText(textOf(c)));
1559 default : return pair(fst(c),snd(c));
1562 return pair(lowLevelLastIn(fst(c)),lowLevelLastIn(snd(c)));
1566 return pair(EXTCOPY,saveText(extText(c)));
1572 Cell getLastExpr() { /* recover previously saved expr */
1573 return lowLevelLastOut(lastExprSaved);
1576 static Cell local lowLevelLastOut(c) /* As with lowLevelLastIn() above */
1577 Cell c; { /* except that Cells refering to */
1578 if (isPair(c)) { /* Text values are restored to */
1579 if (isBoxTag(fst(c))) /* appropriate values */
1586 case STRCELL : return pair(fst(c),
1587 findText(text+intValOf(c)));
1589 case EXTCOPY : return mkExt(findText(text+intValOf(c)));
1591 default : return pair(fst(c),snd(c));
1594 return pair(lowLevelLastOut(fst(c)),lowLevelLastOut(snd(c)));
1600 /* --------------------------------------------------------------------------
1601 * Miscellaneous operations on heap cells:
1602 * ------------------------------------------------------------------------*/
1604 /* Profiling suggests that the number of calls to whatIs() is typically */
1605 /* rather high. The recoded version below attempts to improve the average */
1606 /* performance for whatIs() using a binary search for part of the analysis */
1608 Cell whatIs(c) /* identify type of cell */
1611 register Cell fstc = fst(c);
1612 return isTag(fstc) ? fstc : AP;
1614 if (c<TUPMIN) return c;
1615 if (c>=INTMIN) return INTCELL;
1617 if (c>=NAMEMIN){if (c>=CLASSMIN) {if (c>=CHARMIN) return CHARCELL;
1619 else if (c>=INSTMIN) return INSTANCE;
1621 else if (c>=MODMIN) {if (c>=TYCMIN) return TYCON;
1622 else return MODULE;}
1623 else if (c>=OFFMIN) return OFFSET;
1625 else return (c>=EXTMIN) ?
1632 register Cell fstc = fst(c);
1633 return isTag(fstc) ? fstc : AP;
1635 if (c>=INTMIN) return INTCELL;
1636 if (c>=CHARMIN) return CHARCELL;
1637 if (c>=CLASSMIN) return CLASS;
1638 if (c>=INSTMIN) return INSTANCE;
1639 if (c>=NAMEMIN) return NAME;
1640 if (c>=TYCMIN) return TYCON;
1641 if (c>=MODMIN) return MODULE;
1642 if (c>=OFFMIN) return OFFSET;
1644 if (c>=EXTMIN) return EXT;
1646 if (c>=TUPMIN) return TUPLE;
1651 /* A very, very simple printer.
1652 * Output is uglier than from printExp - but the printer is more
1653 * robust and can be used on any data structure irrespective of
1656 Void print Args((Cell, Int));
1657 Void print(c, depth)
1662 #if 0 /* Not in this version of Hugs */
1663 } else if (isPair(c) && !isGenPair(c)) {
1664 extern Void printEvalCell Args((Cell, Int));
1665 printEvalCell(c,depth);
1668 Int tag = whatIs(c);
1672 print(fst(c), depth-1);
1674 print(snd(c), depth-1);
1678 Printf("free(%d)", c);
1681 Printf("int(%d)", intOf(c));
1684 Printf("bignum(%s)", bignumToString(c));
1687 Printf("char('%c')", charOf(c));
1690 Printf("ptr(%p)",ptrOf(c));
1693 Printf("class(%d)", c-CLASSMIN);
1694 if (CLASSMIN <= c && c < classHw) {
1695 Printf("=\"%s\"", textToStr(cclass(c).text));
1699 Printf("instance(%d)", c - INSTMIN);
1702 Printf("name(%d)", c-NAMEMIN);
1703 if (NAMEMIN <= c && c < nameHw) {
1704 Printf("=\"%s\"", textToStr(name(c).text));
1708 Printf("tycon(%d)", c-TYCMIN);
1709 if (TYCMIN <= c && c < tyconHw)
1710 Printf("=\"%s\"", textToStr(tycon(c).text));
1713 Printf("module(%d)", c - MODMIN);
1716 Printf("Offset %d", offsetOf(c));
1719 Printf("Tuple %d", tupleOf(c));
1723 print(snd(c),depth-1);
1727 print(snd(c),depth-1);
1731 if (isPair(snd(c)) && isInt(fst(snd(c)))) {
1732 Printf("%d ", intOf(fst(snd(c))));
1733 print(snd(snd(c)),depth-1);
1735 print(snd(c),depth-1);
1752 Printf("{dict %d}",textOf(c));
1758 Printf("{id %s}",textToStr(textOf(c)));
1761 Printf("{qid %s.%s}",textToStr(qmodOf(c)),textToStr(qtextOf(c)));
1765 print(fst(snd(c)),depth-1);
1767 print(snd(snd(c)),depth-1);
1772 print(snd(c),depth-1);
1777 print(snd(c),depth-1);
1782 print(fst(snd(c)),depth-1);
1784 print(snd(snd(c)),depth-1);
1789 print(fst(snd(c)),depth-1);
1791 print(snd(snd(c)),depth-1);
1795 Printf("FromQual(");
1796 print(fst(snd(c)),depth-1);
1798 print(snd(snd(c)),depth-1);
1802 Printf("StgVar%d=",-c);
1803 print(snd(c), depth-1);
1807 print(fst(snd(c)),depth-1);
1809 print(snd(snd(c)),depth-1);
1814 print(fst(snd(c)),depth-1);
1816 print(snd(snd(c)),depth-1);
1821 print(fst(snd(c)),depth-1);
1823 print(snd(snd(c)),depth-1);
1827 Printf("PrimCase(");
1828 print(fst(snd(c)),depth-1);
1830 print(snd(snd(c)),depth-1);
1834 if (isBoxTag(tag)) {
1835 Printf("Tag(%d)=%d", c, tag);
1836 } else if (isConTag(tag)) {
1837 Printf("%d@(%d,",c,tag);
1838 print(snd(c), depth-1);
1841 } else if (c == tag) {
1842 Printf("Tag(%d)", c);
1844 Printf("Tag(%d)=%d", c, tag);
1853 Bool isVar(c) /* is cell a VARIDCELL/VAROPCELL ? */
1854 Cell c; { /* also recognises DICTVAR cells */
1856 (fst(c)==VARIDCELL || fst(c)==VAROPCELL || fst(c)==DICTVAR);
1859 Bool isCon(c) /* is cell a CONIDCELL/CONOPCELL ? */
1861 return isPair(c) && (fst(c)==CONIDCELL || fst(c)==CONOPCELL);
1864 Bool isQVar(c) /* is cell a [un]qualified varop/id? */
1866 if (!isPair(c)) return FALSE;
1869 case VAROPCELL : return TRUE;
1871 case QUALIDENT : return isVar(snd(snd(c)));
1873 default : return FALSE;
1877 Bool isQCon(c) /*is cell a [un]qualified conop/id? */
1879 if (!isPair(c)) return FALSE;
1882 case CONOPCELL : return TRUE;
1884 case QUALIDENT : return isCon(snd(snd(c)));
1886 default : return FALSE;
1890 Bool isQualIdent(c) /* is cell a qualified identifier? */
1892 return isPair(c) && (fst(c)==QUALIDENT);
1895 Bool isIdent(c) /* is cell an identifier? */
1897 if (!isPair(c)) return FALSE;
1902 case CONOPCELL : return TRUE;
1904 case QUALIDENT : return TRUE;
1906 default : return FALSE;
1910 Bool isInt(c) /* cell holds integer value? */
1912 return isSmall(c) || (isPair(c) && fst(c)==INTCELL);
1915 Int intOf(c) /* find integer value of cell? */
1919 return isPair(c) ? (Int)(snd(c)) : (Int)(c-INTZERO);
1922 Cell mkInt(n) /* make cell representing integer */
1924 return (MINSMALLINT <= n && n <= MAXSMALLINT)
1929 #if SIZEOF_INTP == SIZEOF_INT
1930 typedef union {Int i; Ptr p;} IntOrPtr;
1936 return pair(PTRCELL,x.i);
1943 assert(fst(c) == PTRCELL);
1952 return pair(CPTRCELL,x.i);
1959 assert(fst(c) == CPTRCELL);
1963 #elif SIZEOF_INTP == 2*SIZEOF_INT
1964 typedef union {struct {Int i1; Int i2;} i; Ptr p;} IntOrPtr;
1970 return pair(PTRCELL,pair(mkInt(x.i.i1),mkInt(x.i.i2)));
1977 assert(fst(c) == PTRCELL);
1978 x.i.i1 = intOf(fst(snd(c)));
1979 x.i.i2 = intOf(snd(snd(c)));
1983 #warning "type Addr not supported on this architecture - don't use it"
1987 ERRMSG(0) "mkPtr: type Addr not supported on this architecture"
1994 ERRMSG(0) "ptrOf: type Addr not supported on this architecture"
1999 String stringNegate( s )
2007 strcpy(&t[1],s); /* ToDo: use strncpy instead */
2012 /* --------------------------------------------------------------------------
2014 * ------------------------------------------------------------------------*/
2016 Int length(xs) /* calculate length of list xs */
2019 for (; nonNull(xs); ++n)
2024 List appendOnto(xs,ys) /* Destructively prepend xs onto */
2025 List xs, ys; { /* ys by modifying xs ... */
2030 while (nonNull(tl(zs)))
2037 List dupOnto(xs,ys) /* non-destructively prepend xs backwards onto ys */
2040 for (; nonNull(xs); xs=tl(xs))
2041 ys = cons(hd(xs),ys);
2045 List dupListOnto(xs,ys) /* Duplicate spine of list xs onto ys */
2048 return revOnto(dupOnto(xs,NIL),ys);
2051 List dupList(xs) /* Duplicate spine of list xs */
2054 for (; nonNull(xs); xs=tl(xs))
2055 ys = cons(hd(xs),ys);
2059 List revOnto(xs,ys) /* Destructively reverse elements of*/
2060 List xs, ys; { /* list xs onto list ys... */
2063 while (nonNull(xs)) {
2072 Cell varIsMember(t,xs) /* Test if variable is a member of */
2073 Text t; /* given list of variables */
2075 for (; nonNull(xs); xs=tl(xs))
2076 if (t==textOf(hd(xs)))
2081 Name nameIsMember(t,ns) /* Test if name with text t is a */
2082 Text t; /* member of list of names xs */
2084 for (; nonNull(ns); ns=tl(ns))
2085 if (t==name(hd(ns)).text)
2090 Cell intIsMember(n,xs) /* Test if integer n is member of */
2091 Int n; /* given list of integers */
2093 for (; nonNull(xs); xs=tl(xs))
2094 if (n==intOf(hd(xs)))
2099 Cell cellIsMember(x,xs) /* Test for membership of specific */
2100 Cell x; /* cell x in list xs */
2102 for (; nonNull(xs); xs=tl(xs))
2108 Cell cellAssoc(c,xs) /* Lookup cell in association list */
2111 for (; nonNull(xs); xs=tl(xs))
2117 Cell cellRevAssoc(c,xs) /* Lookup cell in range of */
2118 Cell c; /* association lists */
2120 for (; nonNull(xs); xs=tl(xs))
2126 List replicate(n,x) /* create list of n copies of x */
2135 List diffList(from,take) /* list difference: from\take */
2136 List from, take; { /* result contains all elements of */
2137 List result = NIL; /* `from' not appearing in `take' */
2139 while (nonNull(from)) {
2140 List next = tl(from);
2141 if (!cellIsMember(hd(from),take)) {
2150 List deleteCell(xs, y) /* copy xs deleting pointers to y */
2154 for(;nonNull(xs);xs=tl(xs)) {
2157 result=cons(x,result);
2163 List take(n,xs) /* destructively truncate list to */
2164 Int n; /* specified length */
2170 while (1<n-- && nonNull(xs))
2177 List splitAt(n,xs) /* drop n things from front of list*/
2186 Cell nth(n,xs) /* extract n'th element of list */
2189 for(; n>0 && nonNull(xs); --n, xs=tl(xs)) {
2196 List removeCell(x,xs) /* destructively remove cell from */
2201 return tl(xs); /* element at front of list */
2205 for (; nonNull(curr); prev=curr, curr=tl(prev))
2207 tl(prev) = tl(curr);
2208 return xs; /* element in middle of list */
2212 return xs; /* here if element not found */
2215 List nubList(xs) /* nuke dups in list */
2216 List xs; { /* non destructive */
2218 for (; nonNull(xs); xs=tl(xs))
2219 if (isNull(cellIsMember(hd(xs),outs)))
2220 outs = cons(hd(xs),outs);
2225 /* --------------------------------------------------------------------------
2226 * Operations on applications:
2227 * ------------------------------------------------------------------------*/
2229 Int argCount; /* number of args in application */
2231 Cell getHead(e) /* get head cell of application */
2232 Cell e; { /* set number of args in argCount */
2233 for (argCount=0; isAp(e); e=fun(e))
2238 List getArgs(e) /* get list of arguments in function*/
2239 Cell e; { /* application: */
2240 List as; /* getArgs(f e1 .. en) = [e1,..,en] */
2242 for (as=NIL; isAp(e); e=fun(e))
2243 as = cons(arg(e),as);
2247 Cell nthArg(n,e) /* return nth arg in application */
2248 Int n; /* of function to m args (m>=n) */
2249 Cell e; { /* nthArg n (f x0 x1 ... xm) = xn */
2250 for (n=numArgs(e)-n-1; n>0; n--)
2255 Int numArgs(e) /* find number of arguments to expr */
2258 for (n=0; isAp(e); e=fun(e))
2263 Cell applyToArgs(f,args) /* destructively apply list of args */
2264 Cell f; /* to function f */
2266 while (nonNull(args)) {
2267 Cell temp = tl(args);
2268 tl(args) = hd(args);
2277 /* --------------------------------------------------------------------------
2279 * ------------------------------------------------------------------------*/
2281 /*---------------------------------------------------------------------------
2282 * GreenCard entry points
2284 * GreenCard generated code accesses Hugs data structures and functions
2285 * (only) via these functions (which are stored in the virtual function
2287 *-------------------------------------------------------------------------*/
2291 static Cell makeTuple Args((Int));
2292 static Cell makeInt Args((Int));
2293 static Cell makeChar Args((Char));
2294 static Char CharOf Args((Cell));
2295 static Cell makeFloat Args((FloatPro));
2296 static Void* derefMallocPtr Args((Cell));
2297 static Cell* Fst Args((Cell));
2298 static Cell* Snd Args((Cell));
2300 static Cell makeTuple(n) Int n; { return mkTuple(n); }
2301 static Cell makeInt(n) Int n; { return mkInt(n); }
2302 static Cell makeChar(n) Char n; { return mkChar(n); }
2303 static Char CharOf(n) Cell n; { return charOf(n); }
2304 static Cell makeFloat(n) FloatPro n; { return mkFloat(n); }
2305 static Void* derefMallocPtr(n) Cell n; { return derefMP(n); }
2306 static Cell* Fst(n) Cell n; { return (Cell*)&fst(n); }
2307 static Cell* Snd(n) Cell n; { return (Cell*)&snd(n); }
2309 HugsAPI1* hugsAPI1() {
2310 static HugsAPI1 api;
2311 static Bool initialised = FALSE;
2313 api.nameTrue = nameTrue;
2314 api.nameFalse = nameFalse;
2315 api.nameNil = nameNil;
2316 api.nameCons = nameCons;
2317 api.nameJust = nameJust;
2318 api.nameNothing = nameNothing;
2319 api.nameLeft = nameLeft;
2320 api.nameRight = nameRight;
2321 api.nameUnit = nameUnit;
2322 api.nameIORun = nameIORun;
2323 api.makeInt = makeInt;
2324 api.makeChar = makeChar;
2325 api.CharOf = CharOf;
2326 api.makeFloat = makeFloat;
2327 api.makeTuple = makeTuple;
2329 api.mkMallocPtr = mkMallocPtr;
2330 api.derefMallocPtr = derefMallocPtr;
2331 api.mkStablePtr = mkStablePtr;
2332 api.derefStablePtr = derefStablePtr;
2333 api.freeStablePtr = freeStablePtr;
2335 api.evalWithNoError = evalWithNoError;
2336 api.evalFails = evalFails;
2337 api.whnfArgs = &whnfArgs;
2338 api.whnfHead = &whnfHead;
2339 api.whnfInt = &whnfInt;
2340 api.whnfFloat = &whnfFloat;
2341 api.garbageCollect = garbageCollect;
2342 api.stackOverflow = hugsStackOverflow;
2343 api.internal = internal;
2344 api.registerPrims = registerPrims;
2345 api.addPrimCfun = addPrimCfun;
2346 api.inventText = inventText;
2349 api.cellStack = cellStack;
2355 #endif /* GREENCARD */
2358 /* --------------------------------------------------------------------------
2360 * ------------------------------------------------------------------------*/
2363 static void far* safeFarCalloc Args((Int,Int));
2364 static void far* safeFarCalloc(n,s) /* allocate table storage and check*/
2365 Int n, s; { /* for non-null return */
2366 void far* tab = farCalloc(n,s);
2368 ERRMSG(0) "Cannot allocate run-time tables"
2373 #define TABALLOC(v,t,n) v=(t far*)safeFarCalloc(n,sizeof(t));
2375 #define TABALLOC(v,t,n)
2383 case RESET : clearStack();
2385 /* the next 2 statements are particularly important
2386 * if you are using GLOBALfst or GLOBALsnd since the
2387 * corresponding registers may be reset to their
2388 * uninitialised initial values by a longjump.
2390 heapTopFst = heapFst + heapSize;
2391 heapTopSnd = heapSnd + heapSize;
2395 if (isNull(lastExprSaved))
2396 savedText = NUM_TEXT;
2401 for (i=NAMEMIN; i<nameHw; ++i) {
2402 mark(name(i).parent);
2404 mark(name(i).stgVar);
2407 end("Names", nameHw-NAMEMIN);
2410 for (i=MODMIN; i<moduleHw; ++i) {
2411 mark(module(i).tycons);
2412 mark(module(i).names);
2413 mark(module(i).classes);
2414 mark(module(i).exports);
2415 mark(module(i).qualImports);
2417 end("Modules", moduleHw-MODMIN);
2420 for (i=TYCMIN; i<tyconHw; ++i) {
2421 mark(tycon(i).defn);
2422 mark(tycon(i).kind);
2423 mark(tycon(i).what);
2425 end("Type constructors", tyconHw-TYCMIN);
2428 for (i=CLASSMIN; i<classHw; ++i) {
2429 mark(cclass(i).head);
2430 mark(cclass(i).kinds);
2431 mark(cclass(i).dsels);
2432 mark(cclass(i).supers);
2433 mark(cclass(i).members);
2434 mark(cclass(i).defaults);
2435 mark(cclass(i).instances);
2438 end("Classes", classHw-CLASSMIN);
2441 for (i=INSTMIN; i<instHw; ++i) {
2443 mark(inst(i).kinds);
2444 mark(inst(i).specifics);
2445 mark(inst(i).implements);
2447 end("Instances", instHw-INSTMIN);
2450 for (i=0; i<=sp; ++i)
2455 mark(lastExprSaved);
2458 end("Last expression", 3);
2463 end("C stack", stackRoots);
2468 case INSTALL : heapFst = heapAlloc(heapSize);
2469 heapSnd = heapAlloc(heapSize);
2471 if (heapFst==(Heap)0 || heapSnd==(Heap)0) {
2472 ERRMSG(0) "Cannot allocate heap storage (%d cells)",
2477 heapTopFst = heapFst + heapSize;
2478 heapTopSnd = heapSnd + heapSize;
2479 for (i=1; i<heapSize; ++i) {
2483 snd(-heapSize) = NIL;
2490 marksSize = bitArraySize(heapSize);
2491 if ((marks=(Int *)calloc(marksSize, sizeof(Int)))==0) {
2492 ERRMSG(0) "Unable to allocate gc markspace"
2496 TABALLOC(text, char, NUM_TEXT)
2497 TABALLOC(tyconHash, Tycon, TYCONHSZ)
2498 TABALLOC(tabTycon, struct strTycon, NUM_TYCON)
2499 TABALLOC(nameHash, Name, NAMEHSZ)
2500 TABALLOC(tabName, struct strName, NUM_NAME)
2501 TABALLOC(tabClass, struct strClass, NUM_CLASSES)
2502 TABALLOC(cellStack, Cell, NUM_STACK)
2503 TABALLOC(tabModule, struct Module, NUM_SCRIPTS)
2505 TABALLOC(tabExt, Text, NUM_EXT)
2510 nextNewText = NUM_TEXT;
2511 nextNewDText = (-1);
2512 lastExprSaved = NIL;
2513 savedText = NUM_TEXT;
2514 for (i=0; i<TEXTHSZ; ++i)
2515 textHash[i][0] = NOTEXT;
2521 for (i=0; i<TYCONHSZ; ++i)
2528 for (i=0; i<NAMEHSZ; ++i)
2539 tabInst = (struct strInst far *)
2540 farCalloc(NUM_INSTS,sizeof(struct strInst));
2543 ERRMSG(0) "Cannot allocate instance tables"
2553 /*-------------------------------------------------------------------------*/