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/16 02:17:32 $
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 */
322 Text t = tycon(tc).text;
324 tycon(tc).nextTyconHash = tyconHash[h];
328 Tycon findQualTycon(id) /*locate (possibly qualified) Tycon in tycon table */
330 if (!isPair(id)) internal("findQualTycon");
334 return findTycon(textOf(id));
336 Text t = qtextOf(id);
337 Module m = findQualifier(qmodOf(id));
339 if (isNull(m)) return NIL;
340 for(es=module(m).exports; nonNull(es); es=tl(es)) {
342 if (isPair(e) && isTycon(fst(e)) && tycon(fst(e)).text==t)
347 default : internal("findQualTycon2");
349 return 0; /* NOTREACHED */
352 Tycon addPrimTycon(t,kind,ar,what,defn) /* add new primitive type constr */
358 Tycon tc = newTycon(t);
360 tycon(tc).kind = kind;
361 tycon(tc).what = what;
362 tycon(tc).defn = defn;
363 tycon(tc).arity = ar;
367 static List local insertTycon(tc,ts) /* insert tycon tc into sorted list*/
372 String s = textToStr(tycon(tc).text);
374 while (nonNull(curr) && strCompare(s,textToStr(tycon(hd(curr)).text))>=0) {
375 if (hd(curr)==tc) /* just in case we get duplicates! */
381 tl(prev) = cons(tc,curr);
385 return cons(tc,curr);
388 List addTyconsMatching(pat,ts) /* Add tycons matching pattern pat */
389 String pat; /* to list of Tycons ts */
390 List ts; { /* Null pattern matches every tycon*/
391 Tycon tc; /* (Tycons with NIL kind excluded) */
392 for (tc=TYCMIN; tc<tyconHw; ++tc)
393 if (!pat || stringMatch(pat,textToStr(tycon(tc).text)))
394 if (nonNull(tycon(tc).kind))
395 ts = insertTycon(tc,ts);
399 /* --------------------------------------------------------------------------
402 * A Name represents a top level binding of a value to an identifier.
403 * Such values may be a constructor function, a member function in a
404 * class, a user-defined or primitive value/function.
406 * Names are indexed by Text values ... a very simple hash functions speeds
407 * access to the table of Names and Name entries with the same hash value
408 * are chained together, with the most recent entry at the front of the
410 * ------------------------------------------------------------------------*/
412 #define NAMEHSZ 256 /* Size of Name hash table */
413 #define nHash(x) ((x)%NAMEHSZ) /* hash fn :: Text->Int */
414 Name nameHw; /* next unused name */
415 static Name DEFTABLE(nameHash,NAMEHSZ); /* Hash table storage */
416 struct strName DEFTABLE(tabName,NUM_NAME); /* Name table storage */
418 Name newName(t,parent) /* Add new name to name table */
422 if (nameHw-NAMEMIN >= NUM_NAME) {
423 ERRMSG(0) "Name storage space exhausted"
426 name(nameHw).text = t; /* clear new name record */
427 name(nameHw).line = 0;
428 name(nameHw).syntax = NO_SYNTAX;
429 name(nameHw).parent = parent;
430 name(nameHw).arity = 0;
431 name(nameHw).number = EXECNAME;
432 name(nameHw).defn = NIL;
433 name(nameHw).stgVar = NIL;
434 name(nameHw).stgSize = 0;
435 name(nameHw).inlineMe = FALSE;
436 name(nameHw).simplified = FALSE;
437 name(nameHw).isDBuilder = FALSE;
438 name(nameHw).type = NIL;
439 name(nameHw).primop = 0;
440 name(nameHw).mod = currentModule;
441 module(currentModule).names=cons(nameHw,module(currentModule).names);
442 name(nameHw).nextNameHash = nameHash[h];
443 nameHash[h] = nameHw;
447 Name findName(t) /* Locate name in name table */
449 Name n = nameHash[nHash(t)];
451 while (nonNull(n) && name(n).text!=t)
452 n = name(n).nextNameHash;
456 Name addName(nm) /* Insert Name in name table - if */
457 Name nm; { /* no clash is caused */
458 Name oldnm = findName(name(nm).text);
461 module(currentModule).names=cons(nm,module(currentModule).names);
467 static Void local hashName(nm) /* Insert Name into hash table */
474 name(nm).nextNameHash = nameHash[h];
478 Name findQualName(id) /* Locate (possibly qualified) name*/
479 Cell id; { /* in name table */
481 internal("findQualName");
487 return findName(textOf(id));
489 Text t = qtextOf(id);
490 Module m = findQualifier(qmodOf(id));
492 if (isNull(m)) return NIL;
493 for(es=module(m).exports; nonNull(es); es=tl(es)) {
495 if (isName(e) && name(e).text==t)
497 else if (isPair(e) && DOTDOT==snd(e)) {
498 List subentities = NIL;
501 && (tycon(c).what==DATATYPE || tycon(c).what==NEWTYPE))
502 subentities = tycon(c).defn;
504 subentities = cclass(c).members;
505 for(; nonNull(subentities); subentities=tl(subentities)) {
506 if (!isName(hd(subentities)))
507 internal("findQualName3");
508 if (name(hd(subentities)).text == t)
509 return hd(subentities);
515 default : internal("findQualName2");
517 return 0; /* NOTREACHED */
521 Name nameFromStgVar ( StgVar v )
524 for (n = NAMEMIN; n < nameHw; n++)
525 if (name(n).stgVar == v) return n;
529 void* getHugs_AsmObject_for ( char* s )
532 Name n = findName(findText(s));
533 if (isNull(n)) internal("getHugs_AsmObject_for(1)");
535 if (!isStgVar(v) || !isPtr(stgVarInfo(v)))
536 internal("getHugs_AsmObject_for(2)");
537 return ptrOf(stgVarInfo(v));
540 /* --------------------------------------------------------------------------
541 * Primitive functions:
542 * ------------------------------------------------------------------------*/
544 Name addPrimCfunREP(t,arity,no,rep) /* add primitive constructor func */
545 Text t; /* sets rep, not type */
548 Int rep; { /* Really AsmRep */
549 Name n = newName(t,NIL);
550 name(n).arity = arity;
551 name(n).number = cfunNo(no);
553 name(n).primop = (void*)rep;
558 Name addPrimCfun(t,arity,no,type) /* add primitive constructor func */
563 Name n = newName(t,NIL);
564 name(n).arity = arity;
565 name(n).number = cfunNo(no);
571 Int sfunPos(s,c) /* Find position of field with */
572 Name s; /* selector s in constructor c. */
576 for (; nonNull(cns); cns=tl(cns))
578 return intOf(snd(hd(cns)));
580 return 0;/* NOTREACHED */
583 static List local insertName(nm,ns) /* insert name nm into sorted list */
588 String s = textToStr(name(nm).text);
590 while (nonNull(curr) && strCompare(s,textToStr(name(hd(curr)).text))>=0) {
591 if (hd(curr)==nm) /* just in case we get duplicates! */
597 tl(prev) = cons(nm,curr);
601 return cons(nm,curr);
604 List addNamesMatching(pat,ns) /* Add names matching pattern pat */
605 String pat; /* to list of names ns */
606 List ns; { /* Null pattern matches every name */
607 Name nm; /* (Names with NIL type, or hidden */
609 for (nm=NAMEMIN; nm<nameHw; ++nm) /* or invented names are excluded) */
610 if (!inventedText(name(nm).text) && nonNull(name(nm).type)) {
611 String str = textToStr(name(nm).text);
612 if (str[0]!='_' && (!pat || stringMatch(pat,str)))
613 ns = insertName(nm,ns);
617 List mns = module(currentModule).names;
618 for(; nonNull(mns); mns=tl(mns)) {
620 if (!inventedText(name(nm).text)) {
621 String str = textToStr(name(nm).text);
622 if (str[0]!='_' && (!pat || stringMatch(pat,str)))
623 ns = insertName(nm,ns);
630 /* --------------------------------------------------------------------------
631 * A simple string matching routine
632 * `*' matches any sequence of zero or more characters
633 * `?' matches any single character exactly
634 * `@str' matches the string str exactly (ignoring any special chars)
635 * `\c' matches the character c only (ignoring special chars)
636 * c matches the character c only
637 * ------------------------------------------------------------------------*/
639 static Void local patternError(s) /* report error in pattern */
641 ERRMSG(0) "%s in pattern", s
645 static Bool local stringMatch(pat,str) /* match string against pattern */
651 case '\0' : return (*str=='\0');
654 if (stringMatch(pat+1,str))
659 case '?' : if (*str++=='\0')
664 case '[' : { Bool found = FALSE;
665 while (*++pat!='\0' && *pat!=']')
666 if (!found && ( pat[0] == *str ||
675 patternError("missing `]'");
683 case '\\' : if (*++pat == '\0')
684 patternError("extra trailing `\\'");
686 default : if (*pat++ != *str++)
692 /* --------------------------------------------------------------------------
693 * Storage of type classes, instances etc...:
694 * ------------------------------------------------------------------------*/
696 static Class classHw; /* next unused class */
697 static List classes; /* list of classes in current scope */
698 static Inst instHw; /* next unused instance record */
700 struct strClass DEFTABLE(tabClass,NUM_CLASSES); /* table of class records */
701 struct strInst far *tabInst; /* (pointer to) table of instances */
703 Class newClass(t) /* add new class to class table */
705 if (classHw-CLASSMIN >= NUM_CLASSES) {
706 ERRMSG(0) "Class storage space exhausted"
709 cclass(classHw).text = t;
710 cclass(classHw).arity = 0;
711 cclass(classHw).kinds = NIL;
712 cclass(classHw).head = NIL;
713 cclass(classHw).dcon = NIL;
714 cclass(classHw).supers = NIL;
715 cclass(classHw).dsels = NIL;
716 cclass(classHw).members = NIL;
717 cclass(classHw).defaults = NIL;
718 cclass(classHw).instances = NIL;
719 classes=cons(classHw,classes);
720 cclass(classHw).mod = currentModule;
721 module(currentModule).classes=cons(classHw,module(currentModule).classes);
725 Class classMax() { /* Return max Class in use ... */
726 return classHw; /* This is a bit ugly, but it's not*/
727 } /* worth a lot of effort right now */
729 Class findClass(t) /* look for named class in table */
733 for (cs=classes; nonNull(cs); cs=tl(cs)) {
735 if (cclass(cl).text==t)
741 Class addClass(c) /* Insert Class in class list */
742 Class c; { /* - if no clash caused */
743 Class oldc = findClass(cclass(c).text);
745 classes=cons(c,classes);
746 module(currentModule).classes=cons(c,module(currentModule).classes);
753 Class findQualClass(c) /* Look for (possibly qualified) */
754 Cell c; { /* class in class list */
755 if (!isQualIdent(c)) {
756 return findClass(textOf(c));
759 Module m = findQualifier(qmodOf(c));
763 for (es=module(m).exports; nonNull(es); es=tl(es)) {
765 if (isPair(e) && isClass(fst(e)) && cclass(fst(e)).text==t)
772 Inst newInst() { /* Add new instance to table */
773 if (instHw-INSTMIN >= NUM_INSTS) {
774 ERRMSG(0) "Instance storage space exhausted"
777 inst(instHw).kinds = NIL;
778 inst(instHw).head = NIL;
779 inst(instHw).specifics = NIL;
780 inst(instHw).implements = NIL;
781 inst(instHw).builder = NIL;
782 inst(instHw).mod = currentModule;
788 extern Void printInst Args((Inst));
792 Class cl = inst(in).c;
793 Printf("%s-", textToStr(cclass(cl).text));
794 printType(stdout,inst(in).t);
796 #endif /* DEBUG_DICTS */
798 Inst findFirstInst(tc) /* look for 1st instance involving */
799 Tycon tc; { /* the type constructor tc */
800 return findNextInst(tc,INSTMIN-1);
803 Inst findNextInst(tc,in) /* look for next instance involving*/
804 Tycon tc; /* the type constructor tc */
805 Inst in; { /* starting after instance in */
806 while (++in < instHw) {
807 Cell pi = inst(in).head;
808 for (; isAp(pi); pi=fun(pi))
809 if (typeInvolves(arg(pi),tc))
815 static Bool local typeInvolves(ty,tc) /* Test to see if type ty involves */
816 Type ty; /* type constructor/tuple tc. */
819 || (isAp(ty) && (typeInvolves(fun(ty),tc)
820 || typeInvolves(arg(ty),tc)));
823 /* --------------------------------------------------------------------------
826 * Various parts of the system use a stack of cells. Most of the stack
827 * operations are defined as macros, expanded inline.
828 * ------------------------------------------------------------------------*/
830 Cell DEFTABLE(cellStack,NUM_STACK); /* Storage for cells on stack */
831 StackPtr sp; /* stack pointer */
833 #if GIMME_STACK_DUMPS
835 #define UPPER_DISP 5 /* # display entries on top of stack */
836 #define LOWER_DISP 5 /* # display entries on bottom of stack*/
838 Void hugsStackOverflow() { /* Report stack overflow */
840 extern Cell evalRoots[];
842 ERRMSG(0) "Control stack overflow" ETHEN
845 if (rootsp>=UPPER_DISP+LOWER_DISP) {
846 for (i=0; i<UPPER_DISP; i++) {
847 ERRTEXT "\nwhile evaluating: " ETHEN
848 ERREXPR(evalRoots[rootsp-i]);
850 ERRTEXT "\n..." ETHEN
851 for (i=LOWER_DISP-1; i>=0; i--) {
852 ERRTEXT "\nwhile evaluating: " ETHEN
853 ERREXPR(evalRoots[i]);
857 for (i=rootsp; i>=0; i--) {
858 ERRTEXT "\nwhile evaluating: " ETHEN
859 ERREXPR(evalRoots[i]);
867 #else /* !GIMME_STACK_DUMPS */
869 Void hugsStackOverflow() { /* Report stack overflow */
870 ERRMSG(0) "Control stack overflow"
874 #endif /* !GIMME_STACK_DUMPS */
876 /* --------------------------------------------------------------------------
879 * A Module represents a user defined module.
881 * Note: there are now two lookup mechanisms in the system:
883 * 1) The exports from a module are stored in a big list.
884 * We resolve qualified names, and import lists by linearly scanning
887 * 2) Unqualified imports and local definitions for the current module
888 * are stored in hash tables (tyconHash and nameHash) or linear lists
891 * ------------------------------------------------------------------------*/
893 static Module moduleHw; /* next unused Module */
894 struct Module DEFTABLE(tabModule,NUM_MODULE); /* Module storage */
895 Module currentModule; /* Module currently being processed*/
897 Bool isValidModule(m) /* is m a legitimate module id? */
899 return (MODMIN <= m && m < moduleHw);
902 Module newModule(t) /* add new module to module table */
904 if (moduleHw-MODMIN >= NUM_MODULE) {
905 ERRMSG(0) "Module storage space exhausted"
908 module(moduleHw).text = t; /* clear new module record */
909 module(moduleHw).qualImports = NIL;
910 module(moduleHw).exports = NIL;
911 module(moduleHw).tycons = NIL;
912 module(moduleHw).names = NIL;
913 module(moduleHw).classes = NIL;
914 module(moduleHw).oImage = NULL;
915 module(moduleHw).oTab = NULL;
916 module(moduleHw).sizeoTab = 0;
917 module(moduleHw).usedoTab = 0;
918 module(moduleHw).dlTab = NULL;
919 module(moduleHw).sizedlTab = 0;
920 module(moduleHw).useddlTab = 0;
924 void ppModules ( void )
927 fflush(stderr); fflush(stdout);
928 printf ( "begin MODULES\n" );
929 for (i = moduleHw-1; i >= MODMIN; i--)
930 printf ( " %2d: %16s\n",
931 i-MODMIN, textToStr(module(i).text)
933 printf ( "end MODULES\n" );
934 fflush(stderr); fflush(stdout);
938 Module findModule(t) /* locate Module in module table */
941 for(m=MODMIN; m<moduleHw; ++m) {
942 if (module(m).text==t)
948 Module findModid(c) /* Find module by name or filename */
951 case STRCELL : { Script s = scriptThisFile(snd(c));
952 return (s==-1) ? NIL : moduleOfScript(s);
954 case CONIDCELL : return findModule(textOf(c));
955 default : internal("findModid");
957 assert(0); return 0; /* NOTREACHED */
960 static local Module findQualifier(t) /* locate Module in import list */
963 printf ( "findQualifier %s\n", textToStr(t));
964 for (ms=module(currentModule).qualImports; nonNull(ms); ms=tl(ms)) {
965 if (textOf(fst(hd(ms)))==t)
969 if (module(currentModule).text==t)
970 return currentModule;
975 Void setCurrModule(m) /* set lookup tables for current module */
978 if (m!=currentModule) {
979 currentModule = m; /* This is the only assignment to currentModule */
980 for (i=0; i<TYCONHSZ; ++i)
982 mapProc(hashTycon,module(m).tycons);
983 for (i=0; i<NAMEHSZ; ++i)
985 mapProc(hashName,module(m).names);
986 classes = module(m).classes;
990 Name jrsFindQualName ( Text mn, Text sn )
995 for (m=MODMIN; m<moduleHw; m++)
996 if (module(m).text == mn) break;
997 if (m == moduleHw) return NIL;
999 for (ns = module(m).names; nonNull(ns); ns=tl(ns))
1000 if (name(hd(ns)).text == sn) return hd(ns);
1006 /* A bit tricky. Assumes that if tab==NULL, then
1007 currUsed and *currSize must be zero.
1010 void* genericExpand ( void* tab,
1011 int* currSize, int currUsed,
1012 int initSize, int elemSize )
1016 if (currUsed < *currSize)
1018 size2 = (*currSize == 0) ? initSize : (2 * *currSize);
1019 tab2 = malloc ( size2 * elemSize );
1021 ERRMSG(0) "Can't allocate enough memory to resize a table"
1025 memcpy ( tab2, tab, elemSize * *currSize );
1027 if (tab) free ( tab );
1031 void addOTabName ( Module m, char* nm, void* ad )
1034 = genericExpand ( module(m).oTab,
1035 &module(m).sizeoTab,
1039 module(m).oTab[ module(m).usedoTab ].nm = nm;
1040 module(m).oTab[ module(m).usedoTab ].ad = ad;
1041 module(m).usedoTab++;
1045 void addDLSect ( Module m, void* start, void* end, DLSect sect )
1048 = genericExpand ( module(m).dlTab,
1049 &module(m).sizedlTab,
1050 module(m).useddlTab,
1051 4, sizeof(DLTabEnt) );
1052 module(m).dlTab[ module(m).useddlTab ].start = start;
1053 module(m).dlTab[ module(m).useddlTab ].end = end;
1054 module(m).dlTab[ module(m).useddlTab ].sect = sect;
1055 module(m).useddlTab++;
1059 void* lookupOTabName ( Module m, char* nm )
1062 for (i = 0; i < module(m).usedoTab; i++)
1063 if (0==strcmp(nm,module(m).oTab[i].nm))
1064 return module(m).oTab[i].ad;
1069 char* nameFromOPtr ( void* p )
1073 for (m=MODMIN; m<moduleHw; m++)
1074 for (i = 0; i < module(m).usedoTab; i++)
1075 if (p == module(m).oTab[i].ad)
1076 return module(m).oTab[i].nm;
1081 DLSect lookupDLSect ( void* ad )
1085 for (m=MODMIN; m<moduleHw; m++)
1086 for (i = 0; i < module(m).useddlTab; i++)
1087 if (module(m).dlTab[i].start <= ad &&
1088 ad <= module(m).dlTab[i].end)
1089 return module(m).dlTab[i].sect;
1090 return HUGS_DL_SECTION_OTHER;
1094 /* --------------------------------------------------------------------------
1095 * Script file storage:
1097 * script files are read into the system one after another. The state of
1098 * the stored data structures (except the garbage-collected heap) is recorded
1099 * before reading a new script. In the event of being unable to read the
1100 * script, or if otherwise requested, the system can be restored to its
1101 * original state immediately before the file was read.
1102 * ------------------------------------------------------------------------*/
1104 typedef struct { /* record of storage state prior to */
1105 Text file; /* reading script/module */
1119 #ifdef DEBUG_SHOWUSE
1120 static Void local showUse(msg,val,mx)
1123 Printf("%6s : %5d of %5d (%2d%%)\n",msg,val,mx,(100*val)/mx);
1127 static Script scriptHw; /* next unused script number */
1128 static script scripts[NUM_SCRIPTS]; /* storage for script records */
1131 void ppScripts ( void )
1134 fflush(stderr); fflush(stdout);
1135 printf ( "begin SCRIPTS\n" );
1136 for (i = scriptHw-1; i >= 0; i--)
1137 printf ( " %2d: %16s tH=%d mH=%d yH=%d "
1138 "nH=%d cH=%d iH=%d nnS=%d,%d\n",
1139 i, textToStr(scripts[i].file),
1140 scripts[i].textHw, scripts[i].moduleHw,
1141 scripts[i].tyconHw, scripts[i].nameHw,
1142 scripts[i].classHw, scripts[i].instHw,
1143 scripts[i].nextNewText, scripts[i].nextNewDText
1145 printf ( "end SCRIPTS\n" );
1146 fflush(stderr); fflush(stdout);
1149 Script startNewScript(f) /* start new script, keeping record */
1150 String f; { /* of status for later restoration */
1151 if (scriptHw >= NUM_SCRIPTS) {
1152 ERRMSG(0) "Too many script files in use"
1155 #ifdef DEBUG_SHOWUSE
1156 showUse("Text", textHw, NUM_TEXT);
1157 showUse("Module", moduleHw-MODMIN, NUM_MODULE);
1158 showUse("Tycon", tyconHw-TYCMIN, NUM_TYCON);
1159 showUse("Name", nameHw-NAMEMIN, NUM_NAME);
1160 showUse("Class", classHw-CLASSMIN, NUM_CLASSES);
1161 showUse("Inst", instHw-INSTMIN, NUM_INSTS);
1163 showUse("Ext", extHw-EXTMIN, NUM_EXT);
1166 scripts[scriptHw].file = findText( f ? f : "<nofile>" );
1167 scripts[scriptHw].textHw = textHw;
1168 scripts[scriptHw].nextNewText = nextNewText;
1169 scripts[scriptHw].nextNewDText = nextNewDText;
1170 scripts[scriptHw].moduleHw = moduleHw;
1171 scripts[scriptHw].tyconHw = tyconHw;
1172 scripts[scriptHw].nameHw = nameHw;
1173 scripts[scriptHw].classHw = classHw;
1174 scripts[scriptHw].instHw = instHw;
1176 scripts[scriptHw].extHw = extHw;
1181 Bool isPreludeScript() { /* Test whether this is the Prelude*/
1182 return (scriptHw==0);
1185 Bool moduleThisScript(m) /* Test if given module is defined */
1186 Module m; { /* in current script file */
1187 return scriptHw<1 || m>=scripts[scriptHw-1].moduleHw;
1190 Module lastModule() { /* Return module in current script file */
1191 return (moduleHw>MODMIN ? moduleHw-1 : modulePrelude);
1194 #define scriptThis(nm,t,tag) Script nm(x) \
1198 && x>=scripts[s].tag) \
1202 scriptThis(scriptThisName,Name,nameHw)
1203 scriptThis(scriptThisTycon,Tycon,tyconHw)
1204 scriptThis(scriptThisInst,Inst,instHw)
1205 scriptThis(scriptThisClass,Class,classHw)
1208 Module moduleOfScript(s)
1210 return (s==0) ? modulePrelude : scripts[s-1].moduleHw;
1213 String fileOfModule(m)
1216 if (m == modulePrelude) {
1219 for(s=0; s<scriptHw; ++s) {
1220 if (scripts[s].moduleHw == m) {
1221 return textToStr(scripts[s].file);
1227 Script scriptThisFile(f)
1230 for (s=0; s < scriptHw; ++s) {
1231 if (scripts[s].file == f) {
1235 if (f == findText(STD_PRELUDE)) {
1241 Void dropScriptsFrom(sno) /* Restore storage to state prior */
1242 Script sno; { /* to reading script sno */
1243 if (sno<scriptHw) { /* is there anything to restore? */
1245 textHw = scripts[sno].textHw;
1246 nextNewText = scripts[sno].nextNewText;
1247 nextNewDText = scripts[sno].nextNewDText;
1248 moduleHw = scripts[sno].moduleHw;
1249 tyconHw = scripts[sno].tyconHw;
1250 nameHw = scripts[sno].nameHw;
1251 classHw = scripts[sno].classHw;
1252 instHw = scripts[sno].instHw;
1254 dictHw = scripts[sno].dictHw;
1257 extHw = scripts[sno].extHw;
1261 for (i=moduleHw; i >= scripts[sno].moduleHw; --i) {
1262 if (module(i).objectFile) {
1263 printf("[bogus] closing objectFile for module %d\n",i);
1264 /*dlclose(module(i).objectFile);*/
1267 moduleHw = scripts[sno].moduleHw;
1269 for (i=0; i<TEXTHSZ; ++i) {
1271 while (j<NUM_TEXTH && textHash[i][j]!=NOTEXT
1272 && textHash[i][j]<textHw)
1275 textHash[i][j] = NOTEXT;
1279 for (i=0; i<TYCONHSZ; ++i) {
1282 for (i=0; i<NAMEHSZ; ++i) {
1286 for (i=CLASSMIN; i<classHw; i++) {
1287 List ins = cclass(i).instances;
1290 while (nonNull(ins)) {
1291 List temp = tl(ins);
1292 if (hd(ins)<instHw) {
1298 cclass(i).instances = rev(is);
1305 /* --------------------------------------------------------------------------
1308 * Provides a garbage collectable heap for storage of expressions etc.
1310 * Now incorporates a flat resource: A two-space collected extension of
1311 * the heap that provides storage for contiguous arrays of Cell storage,
1312 * cooperating with the garbage collection mechanisms for the main heap.
1313 * ------------------------------------------------------------------------*/
1315 Int heapSize = DEFAULTHEAP; /* number of cells in heap */
1316 Heap heapFst; /* array of fst component of pairs */
1317 Heap heapSnd; /* array of snd component of pairs */
1324 Bool consGC = TRUE; /* Set to FALSE to turn off gc from*/
1325 /* C stack; use with extreme care! */
1327 Int numGcs; /* number of garbage collections */
1328 Int cellsRecovered; /* number of cells recovered */
1330 static Cell freeList; /* free list of unused cells */
1331 static Cell lsave, rsave; /* save components of pair */
1335 static Int markCount, stackRoots;
1337 #define initStackRoots() stackRoots = 0
1338 #define recordStackRoot() stackRoots++
1351 #define start() markCount = 0
1352 #define end(thing,rs) \
1354 Printf("GC: %-18s: %4d cells, %4d roots.\n", thing, markCount, rs); \
1357 #define recordMark() markCount++
1359 #else /* !GC_STATISTICS */
1364 #define initStackRoots()
1365 #define recordStackRoot()
1368 #define end(thing,root)
1369 #define recordMark()
1371 #endif /* !GC_STATISTICS */
1373 Cell pair(l,r) /* Allocate pair (l, r) from */
1374 Cell l, r; { /* heap, garbage collecting first */
1375 Cell c = freeList; /* if necessary ... */
1387 freeList = snd(freeList);
1394 Void overwrite(dst,src) /* overwrite dst cell with src cell*/
1395 Cell dst, src; { /* both *MUST* be pairs */
1396 if (isPair(dst) && isPair(src)) {
1397 fst(dst) = fst(src);
1398 snd(dst) = snd(src);
1401 internal("overwrite");
1405 static Int marksSize;
1407 Cell markExpr(c) /* External interface to markCell */
1409 return isGenPair(c) ? markCell(c) : c;
1412 static Cell local markCell(c) /* Traverse part of graph marking */
1413 Cell c; { /* cells reachable from given root */
1414 /* markCell(c) is only called if c */
1416 { register int place = placeInSet(c);
1417 register int mask = maskInSet(c);
1418 if (marks[place]&mask)
1421 marks[place] |= mask;
1426 if (isGenPair(fst(c))) {
1427 fst(c) = markCell(fst(c));
1430 else if (isNull(fst(c)) || fst(c)>=BCSTAG) {
1437 static Void local markSnd(c) /* Variant of markCell used to */
1438 Cell c; { /* update snd component of cell */
1439 Cell t; /* using tail recursion */
1441 ma: t = c; /* Keep pointer to original pair */
1446 { register int place = placeInSet(c);
1447 register int mask = maskInSet(c);
1448 if (marks[place]&mask)
1451 marks[place] |= mask;
1456 if (isGenPair(fst(c))) {
1457 fst(c) = markCell(fst(c));
1460 else if (isNull(fst(c)) || fst(c)>=BCSTAG)
1465 Void markWithoutMove(n) /* Garbage collect cell at n, as if*/
1466 Cell n; { /* it was a cell ref, but don't */
1467 /* move cell so we don't have */
1468 /* to modify the stored value of n */
1475 Void garbageCollect() { /* Run garbage collector ... */
1476 Bool breakStat = breakOn(FALSE); /* disable break checking */
1482 jmp_buf regs; /* save registers on stack */
1486 for (i=0; i<marksSize; ++i) /* initialise mark set to empty */
1489 everybody(MARK); /* Mark all components of system */
1491 gcScanning(); /* scan mark set */
1498 for (i=1; i<=heapSize; i++) {
1499 if ((marks[place] & mask) == 0) {
1506 if (++j == bitsPerWord) {
1513 gcRecovered(recovered);
1514 breakOn(breakStat); /* restore break trapping if nec. */
1518 /* can only return if freeList is nonempty on return. */
1519 if (recovered<minRecovery || isNull(freeList)) {
1520 ERRMSG(0) "Garbage collection fails to reclaim sufficient space"
1523 cellsRecovered = recovered;
1526 /* --------------------------------------------------------------------------
1527 * Code for saving last expression entered:
1529 * This is a little tricky because some text values (e.g. strings or variable
1530 * names) may not be defined or have the same value when the expression is
1531 * recalled. These text values are therefore saved in the top portion of
1533 * ------------------------------------------------------------------------*/
1535 static Cell lastExprSaved; /* last expression to be saved */
1537 Void setLastExpr(e) /* save expression for later recall*/
1539 lastExprSaved = NIL; /* in case attempt to save fails */
1540 savedText = NUM_TEXT;
1541 lastExprSaved = lowLevelLastIn(e);
1544 static Cell local lowLevelLastIn(c) /* Duplicate expression tree (i.e. */
1545 Cell c; { /* acyclic graph) for later recall */
1546 if (isPair(c)) { /* Duplicating any text strings */
1547 if (isBoxTag(fst(c))) /* in case these are lost at some */
1548 switch (fst(c)) { /* point before the expr is reused */
1554 case STRCELL : return pair(fst(c),saveText(textOf(c)));
1555 default : return pair(fst(c),snd(c));
1558 return pair(lowLevelLastIn(fst(c)),lowLevelLastIn(snd(c)));
1562 return pair(EXTCOPY,saveText(extText(c)));
1568 Cell getLastExpr() { /* recover previously saved expr */
1569 return lowLevelLastOut(lastExprSaved);
1572 static Cell local lowLevelLastOut(c) /* As with lowLevelLastIn() above */
1573 Cell c; { /* except that Cells refering to */
1574 if (isPair(c)) { /* Text values are restored to */
1575 if (isBoxTag(fst(c))) /* appropriate values */
1582 case STRCELL : return pair(fst(c),
1583 findText(text+intValOf(c)));
1585 case EXTCOPY : return mkExt(findText(text+intValOf(c)));
1587 default : return pair(fst(c),snd(c));
1590 return pair(lowLevelLastOut(fst(c)),lowLevelLastOut(snd(c)));
1596 /* --------------------------------------------------------------------------
1597 * Miscellaneous operations on heap cells:
1598 * ------------------------------------------------------------------------*/
1600 /* Profiling suggests that the number of calls to whatIs() is typically */
1601 /* rather high. The recoded version below attempts to improve the average */
1602 /* performance for whatIs() using a binary search for part of the analysis */
1604 Cell whatIs(c) /* identify type of cell */
1607 register Cell fstc = fst(c);
1608 return isTag(fstc) ? fstc : AP;
1610 if (c<TUPMIN) return c;
1611 if (c>=INTMIN) return INTCELL;
1613 if (c>=NAMEMIN){if (c>=CLASSMIN) {if (c>=CHARMIN) return CHARCELL;
1615 else if (c>=INSTMIN) return INSTANCE;
1617 else if (c>=MODMIN) {if (c>=TYCMIN) return TYCON;
1618 else return MODULE;}
1619 else if (c>=OFFMIN) return OFFSET;
1621 else return (c>=EXTMIN) ?
1628 register Cell fstc = fst(c);
1629 return isTag(fstc) ? fstc : AP;
1631 if (c>=INTMIN) return INTCELL;
1632 if (c>=CHARMIN) return CHARCELL;
1633 if (c>=CLASSMIN) return CLASS;
1634 if (c>=INSTMIN) return INSTANCE;
1635 if (c>=NAMEMIN) return NAME;
1636 if (c>=TYCMIN) return TYCON;
1637 if (c>=MODMIN) return MODULE;
1638 if (c>=OFFMIN) return OFFSET;
1640 if (c>=EXTMIN) return EXT;
1642 if (c>=TUPMIN) return TUPLE;
1647 /* A very, very simple printer.
1648 * Output is uglier than from printExp - but the printer is more
1649 * robust and can be used on any data structure irrespective of
1652 Void print Args((Cell, Int));
1653 Void print(c, depth)
1658 #if 0 /* Not in this version of Hugs */
1659 } else if (isPair(c) && !isGenPair(c)) {
1660 extern Void printEvalCell Args((Cell, Int));
1661 printEvalCell(c,depth);
1664 Int tag = whatIs(c);
1668 print(fst(c), depth-1);
1670 print(snd(c), depth-1);
1674 Printf("free(%d)", c);
1677 Printf("int(%d)", intOf(c));
1680 Printf("bignum(%s)", bignumToString(c));
1683 Printf("char('%c')", charOf(c));
1686 Printf("ptr(%p)",ptrOf(c));
1689 Printf("class(%d)", c-CLASSMIN);
1690 if (CLASSMIN <= c && c < classHw) {
1691 Printf("=\"%s\"", textToStr(cclass(c).text));
1695 Printf("instance(%d)", c - INSTMIN);
1698 Printf("name(%d)", c-NAMEMIN);
1699 if (NAMEMIN <= c && c < nameHw) {
1700 Printf("=\"%s\"", textToStr(name(c).text));
1704 Printf("tycon(%d)", c-TYCMIN);
1705 if (TYCMIN <= c && c < tyconHw)
1706 Printf("=\"%s\"", textToStr(tycon(c).text));
1709 Printf("module(%d)", c - MODMIN);
1712 Printf("Offset %d", offsetOf(c));
1715 Printf("Tuple %d", tupleOf(c));
1719 print(snd(c),depth-1);
1723 print(snd(c),depth-1);
1727 if (isPair(snd(c)) && isInt(fst(snd(c)))) {
1728 Printf("%d ", intOf(fst(snd(c))));
1729 print(snd(snd(c)),depth-1);
1731 print(snd(c),depth-1);
1748 Printf("{dict %d}",textOf(c));
1754 Printf("{id %s}",textToStr(textOf(c)));
1757 Printf("{qid %s.%s}",textToStr(qmodOf(c)),textToStr(qtextOf(c)));
1761 print(fst(snd(c)),depth-1);
1763 print(snd(snd(c)),depth-1);
1768 print(snd(c),depth-1);
1773 print(snd(c),depth-1);
1778 print(fst(snd(c)),depth-1);
1780 print(snd(snd(c)),depth-1);
1785 print(fst(snd(c)),depth-1);
1787 print(snd(snd(c)),depth-1);
1791 Printf("FromQual(");
1792 print(fst(snd(c)),depth-1);
1794 print(snd(snd(c)),depth-1);
1798 Printf("StgVar%d=",-c);
1799 print(snd(c), depth-1);
1803 print(fst(snd(c)),depth-1);
1805 print(snd(snd(c)),depth-1);
1810 print(fst(snd(c)),depth-1);
1812 print(snd(snd(c)),depth-1);
1817 print(fst(snd(c)),depth-1);
1819 print(snd(snd(c)),depth-1);
1823 Printf("PrimCase(");
1824 print(fst(snd(c)),depth-1);
1826 print(snd(snd(c)),depth-1);
1830 if (isBoxTag(tag)) {
1831 Printf("Tag(%d)=%d", c, tag);
1832 } else if (isConTag(tag)) {
1833 Printf("%d@(%d,",c,tag);
1834 print(snd(c), depth-1);
1837 } else if (c == tag) {
1838 Printf("Tag(%d)", c);
1840 Printf("Tag(%d)=%d", c, tag);
1849 Bool isVar(c) /* is cell a VARIDCELL/VAROPCELL ? */
1850 Cell c; { /* also recognises DICTVAR cells */
1852 (fst(c)==VARIDCELL || fst(c)==VAROPCELL || fst(c)==DICTVAR);
1855 Bool isCon(c) /* is cell a CONIDCELL/CONOPCELL ? */
1857 return isPair(c) && (fst(c)==CONIDCELL || fst(c)==CONOPCELL);
1860 Bool isQVar(c) /* is cell a [un]qualified varop/id? */
1862 if (!isPair(c)) return FALSE;
1865 case VAROPCELL : return TRUE;
1867 case QUALIDENT : return isVar(snd(snd(c)));
1869 default : return FALSE;
1873 Bool isQCon(c) /*is cell a [un]qualified conop/id? */
1875 if (!isPair(c)) return FALSE;
1878 case CONOPCELL : return TRUE;
1880 case QUALIDENT : return isCon(snd(snd(c)));
1882 default : return FALSE;
1886 Bool isQualIdent(c) /* is cell a qualified identifier? */
1888 return isPair(c) && (fst(c)==QUALIDENT);
1891 Bool isIdent(c) /* is cell an identifier? */
1893 if (!isPair(c)) return FALSE;
1898 case CONOPCELL : return TRUE;
1900 case QUALIDENT : return TRUE;
1902 default : return FALSE;
1906 Bool isInt(c) /* cell holds integer value? */
1908 return isSmall(c) || (isPair(c) && fst(c)==INTCELL);
1911 Int intOf(c) /* find integer value of cell? */
1915 return isPair(c) ? (Int)(snd(c)) : (Int)(c-INTZERO);
1918 Cell mkInt(n) /* make cell representing integer */
1920 return (MINSMALLINT <= n && n <= MAXSMALLINT)
1925 #if SIZEOF_INTP == SIZEOF_INT
1926 typedef union {Int i; Ptr p;} IntOrPtr;
1932 return pair(PTRCELL,x.i);
1939 assert(fst(c) == PTRCELL);
1948 return pair(CPTRCELL,x.i);
1955 assert(fst(c) == CPTRCELL);
1959 #elif SIZEOF_INTP == 2*SIZEOF_INT
1960 typedef union {struct {Int i1; Int i2;} i; Ptr p;} IntOrPtr;
1966 return pair(PTRCELL,pair(mkInt(x.i.i1),mkInt(x.i.i2)));
1973 assert(fst(c) == PTRCELL);
1974 x.i.i1 = intOf(fst(snd(c)));
1975 x.i.i2 = intOf(snd(snd(c)));
1979 #warning "type Addr not supported on this architecture - don't use it"
1983 ERRMSG(0) "mkPtr: type Addr not supported on this architecture"
1990 ERRMSG(0) "ptrOf: type Addr not supported on this architecture"
1995 String stringNegate( s )
2003 strcpy(&t[1],s); /* ToDo: use strncpy instead */
2008 /* --------------------------------------------------------------------------
2010 * ------------------------------------------------------------------------*/
2012 Int length(xs) /* calculate length of list xs */
2015 for (; nonNull(xs); ++n)
2020 List appendOnto(xs,ys) /* Destructively prepend xs onto */
2021 List xs, ys; { /* ys by modifying xs ... */
2026 while (nonNull(tl(zs)))
2033 List dupOnto(xs,ys) /* non-destructively prepend xs backwards onto ys */
2036 for (; nonNull(xs); xs=tl(xs))
2037 ys = cons(hd(xs),ys);
2041 List dupListOnto(xs,ys) /* Duplicate spine of list xs onto ys */
2044 return revOnto(dupOnto(xs,NIL),ys);
2047 List dupList(xs) /* Duplicate spine of list xs */
2050 for (; nonNull(xs); xs=tl(xs))
2051 ys = cons(hd(xs),ys);
2055 List revOnto(xs,ys) /* Destructively reverse elements of*/
2056 List xs, ys; { /* list xs onto list ys... */
2059 while (nonNull(xs)) {
2068 Cell varIsMember(t,xs) /* Test if variable is a member of */
2069 Text t; /* given list of variables */
2071 for (; nonNull(xs); xs=tl(xs))
2072 if (t==textOf(hd(xs)))
2077 Name nameIsMember(t,ns) /* Test if name with text t is a */
2078 Text t; /* member of list of names xs */
2080 for (; nonNull(ns); ns=tl(ns))
2081 if (t==name(hd(ns)).text)
2086 Cell intIsMember(n,xs) /* Test if integer n is member of */
2087 Int n; /* given list of integers */
2089 for (; nonNull(xs); xs=tl(xs))
2090 if (n==intOf(hd(xs)))
2095 Cell cellIsMember(x,xs) /* Test for membership of specific */
2096 Cell x; /* cell x in list xs */
2098 for (; nonNull(xs); xs=tl(xs))
2104 Cell cellAssoc(c,xs) /* Lookup cell in association list */
2107 for (; nonNull(xs); xs=tl(xs))
2113 Cell cellRevAssoc(c,xs) /* Lookup cell in range of */
2114 Cell c; /* association lists */
2116 for (; nonNull(xs); xs=tl(xs))
2122 List replicate(n,x) /* create list of n copies of x */
2131 List diffList(from,take) /* list difference: from\take */
2132 List from, take; { /* result contains all elements of */
2133 List result = NIL; /* `from' not appearing in `take' */
2135 while (nonNull(from)) {
2136 List next = tl(from);
2137 if (!cellIsMember(hd(from),take)) {
2146 List deleteCell(xs, y) /* copy xs deleting pointers to y */
2150 for(;nonNull(xs);xs=tl(xs)) {
2153 result=cons(x,result);
2159 List take(n,xs) /* destructively truncate list to */
2160 Int n; /* specified length */
2166 while (1<n-- && nonNull(xs))
2173 List splitAt(n,xs) /* drop n things from front of list*/
2182 Cell nth(n,xs) /* extract n'th element of list */
2185 for(; n>0 && nonNull(xs); --n, xs=tl(xs)) {
2192 List removeCell(x,xs) /* destructively remove cell from */
2197 return tl(xs); /* element at front of list */
2201 for (; nonNull(curr); prev=curr, curr=tl(prev))
2203 tl(prev) = tl(curr);
2204 return xs; /* element in middle of list */
2208 return xs; /* here if element not found */
2211 List nubList(xs) /* nuke dups in list */
2212 List xs; { /* non destructive */
2214 for (; nonNull(xs); xs=tl(xs))
2215 if (isNull(cellIsMember(hd(xs),outs)))
2216 outs = cons(hd(xs),outs);
2221 /* --------------------------------------------------------------------------
2222 * Operations on applications:
2223 * ------------------------------------------------------------------------*/
2225 Int argCount; /* number of args in application */
2227 Cell getHead(e) /* get head cell of application */
2228 Cell e; { /* set number of args in argCount */
2229 for (argCount=0; isAp(e); e=fun(e))
2234 List getArgs(e) /* get list of arguments in function*/
2235 Cell e; { /* application: */
2236 List as; /* getArgs(f e1 .. en) = [e1,..,en] */
2238 for (as=NIL; isAp(e); e=fun(e))
2239 as = cons(arg(e),as);
2243 Cell nthArg(n,e) /* return nth arg in application */
2244 Int n; /* of function to m args (m>=n) */
2245 Cell e; { /* nthArg n (f x0 x1 ... xm) = xn */
2246 for (n=numArgs(e)-n-1; n>0; n--)
2251 Int numArgs(e) /* find number of arguments to expr */
2254 for (n=0; isAp(e); e=fun(e))
2259 Cell applyToArgs(f,args) /* destructively apply list of args */
2260 Cell f; /* to function f */
2262 while (nonNull(args)) {
2263 Cell temp = tl(args);
2264 tl(args) = hd(args);
2273 /* --------------------------------------------------------------------------
2275 * ------------------------------------------------------------------------*/
2277 /*---------------------------------------------------------------------------
2278 * GreenCard entry points
2280 * GreenCard generated code accesses Hugs data structures and functions
2281 * (only) via these functions (which are stored in the virtual function
2283 *-------------------------------------------------------------------------*/
2287 static Cell makeTuple Args((Int));
2288 static Cell makeInt Args((Int));
2289 static Cell makeChar Args((Char));
2290 static Char CharOf Args((Cell));
2291 static Cell makeFloat Args((FloatPro));
2292 static Void* derefMallocPtr Args((Cell));
2293 static Cell* Fst Args((Cell));
2294 static Cell* Snd Args((Cell));
2296 static Cell makeTuple(n) Int n; { return mkTuple(n); }
2297 static Cell makeInt(n) Int n; { return mkInt(n); }
2298 static Cell makeChar(n) Char n; { return mkChar(n); }
2299 static Char CharOf(n) Cell n; { return charOf(n); }
2300 static Cell makeFloat(n) FloatPro n; { return mkFloat(n); }
2301 static Void* derefMallocPtr(n) Cell n; { return derefMP(n); }
2302 static Cell* Fst(n) Cell n; { return (Cell*)&fst(n); }
2303 static Cell* Snd(n) Cell n; { return (Cell*)&snd(n); }
2305 HugsAPI1* hugsAPI1() {
2306 static HugsAPI1 api;
2307 static Bool initialised = FALSE;
2309 api.nameTrue = nameTrue;
2310 api.nameFalse = nameFalse;
2311 api.nameNil = nameNil;
2312 api.nameCons = nameCons;
2313 api.nameJust = nameJust;
2314 api.nameNothing = nameNothing;
2315 api.nameLeft = nameLeft;
2316 api.nameRight = nameRight;
2317 api.nameUnit = nameUnit;
2318 api.nameIORun = nameIORun;
2319 api.makeInt = makeInt;
2320 api.makeChar = makeChar;
2321 api.CharOf = CharOf;
2322 api.makeFloat = makeFloat;
2323 api.makeTuple = makeTuple;
2325 api.mkMallocPtr = mkMallocPtr;
2326 api.derefMallocPtr = derefMallocPtr;
2327 api.mkStablePtr = mkStablePtr;
2328 api.derefStablePtr = derefStablePtr;
2329 api.freeStablePtr = freeStablePtr;
2331 api.evalWithNoError = evalWithNoError;
2332 api.evalFails = evalFails;
2333 api.whnfArgs = &whnfArgs;
2334 api.whnfHead = &whnfHead;
2335 api.whnfInt = &whnfInt;
2336 api.whnfFloat = &whnfFloat;
2337 api.garbageCollect = garbageCollect;
2338 api.stackOverflow = hugsStackOverflow;
2339 api.internal = internal;
2340 api.registerPrims = registerPrims;
2341 api.addPrimCfun = addPrimCfun;
2342 api.inventText = inventText;
2345 api.cellStack = cellStack;
2351 #endif /* GREENCARD */
2354 /* --------------------------------------------------------------------------
2356 * ------------------------------------------------------------------------*/
2359 static void far* safeFarCalloc Args((Int,Int));
2360 static void far* safeFarCalloc(n,s) /* allocate table storage and check*/
2361 Int n, s; { /* for non-null return */
2362 void far* tab = farCalloc(n,s);
2364 ERRMSG(0) "Cannot allocate run-time tables"
2369 #define TABALLOC(v,t,n) v=(t far*)safeFarCalloc(n,sizeof(t));
2371 #define TABALLOC(v,t,n)
2379 case RESET : clearStack();
2381 /* the next 2 statements are particularly important
2382 * if you are using GLOBALfst or GLOBALsnd since the
2383 * corresponding registers may be reset to their
2384 * uninitialised initial values by a longjump.
2386 heapTopFst = heapFst + heapSize;
2387 heapTopSnd = heapSnd + heapSize;
2391 if (isNull(lastExprSaved))
2392 savedText = NUM_TEXT;
2397 for (i=NAMEMIN; i<nameHw; ++i) {
2398 mark(name(i).parent);
2400 mark(name(i).stgVar);
2403 end("Names", nameHw-NAMEMIN);
2406 for (i=MODMIN; i<moduleHw; ++i) {
2407 mark(module(i).tycons);
2408 mark(module(i).names);
2409 mark(module(i).classes);
2410 mark(module(i).exports);
2411 mark(module(i).qualImports);
2413 end("Modules", moduleHw-MODMIN);
2416 for (i=TYCMIN; i<tyconHw; ++i) {
2417 mark(tycon(i).defn);
2418 mark(tycon(i).kind);
2419 mark(tycon(i).what);
2421 end("Type constructors", tyconHw-TYCMIN);
2424 for (i=CLASSMIN; i<classHw; ++i) {
2425 mark(cclass(i).head);
2426 mark(cclass(i).kinds);
2427 mark(cclass(i).dsels);
2428 mark(cclass(i).supers);
2429 mark(cclass(i).members);
2430 mark(cclass(i).defaults);
2431 mark(cclass(i).instances);
2434 end("Classes", classHw-CLASSMIN);
2437 for (i=INSTMIN; i<instHw; ++i) {
2439 mark(inst(i).kinds);
2440 mark(inst(i).specifics);
2441 mark(inst(i).implements);
2443 end("Instances", instHw-INSTMIN);
2446 for (i=0; i<=sp; ++i)
2451 mark(lastExprSaved);
2454 end("Last expression", 3);
2459 end("C stack", stackRoots);
2464 case INSTALL : heapFst = heapAlloc(heapSize);
2465 heapSnd = heapAlloc(heapSize);
2467 if (heapFst==(Heap)0 || heapSnd==(Heap)0) {
2468 ERRMSG(0) "Cannot allocate heap storage (%d cells)",
2473 heapTopFst = heapFst + heapSize;
2474 heapTopSnd = heapSnd + heapSize;
2475 for (i=1; i<heapSize; ++i) {
2479 snd(-heapSize) = NIL;
2486 marksSize = bitArraySize(heapSize);
2487 if ((marks=(Int *)calloc(marksSize, sizeof(Int)))==0) {
2488 ERRMSG(0) "Unable to allocate gc markspace"
2492 TABALLOC(text, char, NUM_TEXT)
2493 TABALLOC(tyconHash, Tycon, TYCONHSZ)
2494 TABALLOC(tabTycon, struct strTycon, NUM_TYCON)
2495 TABALLOC(nameHash, Name, NAMEHSZ)
2496 TABALLOC(tabName, struct strName, NUM_NAME)
2497 TABALLOC(tabClass, struct strClass, NUM_CLASSES)
2498 TABALLOC(cellStack, Cell, NUM_STACK)
2499 TABALLOC(tabModule, struct Module, NUM_SCRIPTS)
2501 TABALLOC(tabExt, Text, NUM_EXT)
2506 nextNewText = NUM_TEXT;
2507 nextNewDText = (-1);
2508 lastExprSaved = NIL;
2509 savedText = NUM_TEXT;
2510 for (i=0; i<TEXTHSZ; ++i)
2511 textHash[i][0] = NOTEXT;
2517 for (i=0; i<TYCONHSZ; ++i)
2524 for (i=0; i<NAMEHSZ; ++i)
2535 tabInst = (struct strInst far *)
2536 farCalloc(NUM_INSTS,sizeof(struct strInst));
2539 ERRMSG(0) "Cannot allocate instance tables"
2549 /*-------------------------------------------------------------------------*/