2 /* --------------------------------------------------------------------------
3 * Defines storage datatypes: Text, Name, Module, Tycon, Cell, List, Pair,
6 * The Hugs 98 system is Copyright (c) Mark P Jones, Alastair Reid, the
7 * Yale Haskell Group, and the Oregon Graduate Institute of Science and
8 * Technology, 1994-1999, All rights reserved. It is distributed as
9 * free software under the license in the file "License", which is
10 * included in the distribution.
12 * $RCSfile: storage.h,v $
14 * $Date: 1999/11/12 17:32:47 $
15 * ------------------------------------------------------------------------*/
17 /* --------------------------------------------------------------------------
18 * Typedefs for main data types:
19 * Many of these type names are used to indicate the intended us of a data
20 * item, rather than for type checking purposes. Sadly (although sometimes,
21 * fortunately), the C compiler cannot distinguish between the use of two
22 * different names defined to be synonyms for the same types.
23 * ------------------------------------------------------------------------*/
25 typedef Int Text; /* text string */
26 typedef Unsigned Syntax; /* syntax (assoc,preced) */
27 typedef Int Cell; /* general cell value */
28 typedef Cell far *Heap; /* storage of heap */
29 typedef Cell Pair; /* pair cell */
30 typedef Int StackPtr; /* stack pointer */
31 typedef Cell Offset; /* offset/generic variable*/
32 typedef Int Script; /* script file number */
33 typedef Int Module; /* module */
34 typedef Cell Tycon; /* type constructor */
35 typedef Cell Type; /* type expression */
36 typedef Cell Kind; /* kind expression */
37 typedef Cell Kinds; /* list of kinds */
38 typedef Cell Constr; /* constructor expression */
39 typedef Cell Name; /* named value */
40 typedef Cell Class; /* type class */
41 typedef Cell Inst; /* instance of type class */
42 typedef Cell Triple; /* triple of cell values */
43 typedef Cell List; /* list of cells */
44 typedef Cell Bignum; /* bignum integer */
45 typedef Cell Float; /* floating pt literal */
47 typedef Cell Ext; /* extension label */
50 /* --------------------------------------------------------------------------
52 * provides storage for the characters making up identifier and symbol
53 * names, string literals, character constants etc...
54 * ------------------------------------------------------------------------*/
56 extern String textToStr Args((Text));
57 extern Text findText Args((String));
58 extern Text inventText Args((Void));
59 extern Text inventDictText Args((Void));
60 extern Bool inventedText Args((Text));
62 /* Variants of textToStr and syntaxOf which work for idents, ops whether
63 * qualified or unqualified.
65 extern String identToStr Args((Cell));
66 extern Text fixLitText Args((Text));
67 extern Syntax identSyntax Args((Cell));
68 extern Syntax defaultSyntax Args((Text));
70 /* --------------------------------------------------------------------------
71 * Specification of syntax (i.e. default written form of application)
72 * ------------------------------------------------------------------------*/
74 #define MIN_PREC 0 /* weakest binding operator */
75 #define MAX_PREC 9 /* strongest binding operator */
76 #define FUN_PREC (MAX_PREC+2) /* binding of function symbols */
77 #define DEF_PREC MAX_PREC
78 #define APPLIC 0 /* written applicatively */
79 #define LEFT_ASS 1 /* left associative infix */
80 #define RIGHT_ASS 2 /* right associative infix */
81 #define NON_ASS 3 /* non associative infix */
82 #define DEF_ASS LEFT_ASS
84 #define UMINUS_PREC 6 /* Change these settings at your */
85 #define UMINUS_ASSOC LEFT_ASS /* own risk; they may not work! */
87 #define assocOf(x) ((x)&NON_ASS)
88 #define precOf(x) ((x)>>2)
89 #define mkSyntax(a,p) ((a)|((p)<<2))
90 #define DEF_OPSYNTAX mkSyntax(DEF_ASS,DEF_PREC)
91 #define NO_SYNTAX (-1)
93 extern Void addSyntax Args((Int,Text,Syntax));
94 extern Syntax syntaxOf Args((Text));
96 /* --------------------------------------------------------------------------
98 * Provides a garbage collectable heap for storage of expressions etc.
99 * ------------------------------------------------------------------------*/
101 #define heapAlloc(s) (Heap)(farCalloc(s,sizeof(Cell)))
102 #define heapBuilt() (heapFst)
104 extern Heap heapFst, heapSnd;
105 extern Heap heapTopFst;
106 extern Heap heapTopSnd;
107 extern Bool consGC; /* Set to FALSE to turn off gc from*/
108 /* C stack; use with extreme care! */
109 extern Int cellsRecovered; /* cells recovered by last gc */
111 #define fst(c) heapTopFst[c]
112 #define snd(c) heapTopSnd[c]
114 extern Pair pair Args((Cell,Cell));
115 extern Void garbageCollect Args((Void));
117 extern Void overwrite Args((Pair,Pair));
118 extern Void overwrite2 Args((Pair,Cell,Cell));
119 extern Cell markExpr Args((Cell));
120 extern Void markWithoutMove Args((Cell));
122 #define mark(v) v=markExpr(v)
124 #define isPair(c) ((c)<0)
125 #define isGenPair(c) ((c)<0 && -heapSize<=(c))
127 extern Cell whatIs Args((Cell));
129 /* --------------------------------------------------------------------------
130 * Box cell tags are used as the fst element of a pair to indicate that
131 * the snd element of the pair is to be treated in some special way, other
132 * than as a Cell. Examples include holding integer values, variable name
133 * and string text etc.
134 * ------------------------------------------------------------------------*/
136 #define TAGMIN 1 /* Box and constructor cell tag values */
137 #define BCSTAG 30 /* Box=TAGMIN..BCSTAG-1 */
138 #define isTag(c) (TAGMIN<=(c) && (c)<SPECMIN) /* Tag cell values */
139 #define isBoxTag(c) (TAGMIN<=(c) && (c)<BCSTAG) /* Box cell tag values */
140 #define isConTag(c) (BCSTAG<=(c) && (c)<SPECMIN) /* Constr cell tag values*/
142 #define FREECELL 3 /* Free list cell: snd :: Cell */
143 #define VARIDCELL 4 /* Identifier variable: snd :: Text */
144 #define VAROPCELL 5 /* Operator variable: snd :: Text */
145 #define DICTVAR 6 /* Dictionary variable: snd :: Text */
146 #define CONIDCELL 7 /* Identifier constructor: snd :: Text */
147 #define CONOPCELL 8 /* Operator constructor: snd :: Text */
148 #define STRCELL 9 /* String literal: snd :: Text */
149 #define INTCELL 10 /* Int literal: snd :: Int */
150 #define ADDPAT 11 /* (_+k) pattern discr: snd :: Int */
151 #define FLOATCELL 15 /* Floating Pt literal: snd :: Text */
152 #define BIGCELL 16 /* Integer literal: snd :: Text */
154 #define PTRCELL 17 /* C Heap Pointer snd :: Ptr */
156 #define IPCELL 19 /* Imp Param Cell: snd :: Text */
157 #define IPVAR 20 /* ?x: snd :: Text */
159 #define CPTRCELL 21 /* Native code pointer snd :: Ptr */
162 #define EXTCOPY 22 /* Copy of an Ext: snd :: Text */
165 //#define textOf(c) ((Text)(snd(c))) /* c :: (VAR|CON)(ID|OP) */
168 static Text textOf( Cell c )
171 (whatIs(c)==VARIDCELL
172 || whatIs(c)==CONIDCELL
173 || whatIs(c)==VAROPCELL
174 || whatIs(c)==CONOPCELL
175 || whatIs(c)==STRCELL
176 || whatIs(c)==DICTVAR
179 fprintf(stderr, "\ntextOf -- tag %d\n",whatIs(c) );
186 #define qmodOf(c) (textOf(fst(snd(c)))) /* c :: QUALIDENT */
187 #define qtextOf(c) (textOf(snd(snd(c)))) /* c :: QUALIDENT */
188 #define mkVar(t) ap(VARIDCELL,t)
189 #define mkVarop(t) ap(VAROPCELL,t)
190 #define mkCon(t) ap(CONIDCELL,t)
191 #define mkConop(t) ap(CONOPCELL,t)
192 #define mkQVar(m,t) ap(QUALIDENT,pair(mkCon(m),mkVar(t)))
193 #define mkQCon(m,t) ap(QUALIDENT,pair(mkCon(m),mkCon(t)))
194 #define mkQVarOp(m,t) ap(QUALIDENT,pair(mkCon(m),mkVarop(t)))
195 #define mkQConOp(m,t) ap(QUALIDENT,pair(mkCon(m),mkConop(t)))
196 #define intValOf(c) (snd(c))
197 #define inventVar() mkVar(inventText())
198 #define mkDictVar(t) ap(DICTVAR,t)
199 #define inventDictVar() mkDictVar(inventDictText())
200 #define mkStr(t) ap(STRCELL,t)
202 #define mkIParam(c) ap(IPCELL,snd(c))
203 #define isIP(p) (whatIs(p) == IPCELL)
204 #define ipMatch(pi, t) (isIP(fun(pi)) && textOf(fun(pi)) == t)
205 #define ipVar(pi) textOf(fun(pi))
207 #define isIP(p) FALSE
209 extern Bool isVar Args((Cell));
210 extern Bool isCon Args((Cell));
211 extern Bool isQVar Args((Cell));
212 extern Bool isQCon Args((Cell));
213 extern Bool isQualIdent Args((Cell));
214 extern Bool isIdent Args((Cell));
216 extern String stringNegate Args((String));
218 #define isFloat(c) (isPair(c) && fst(c)==FLOATCELL)
219 #define stringToFloat(s) pair(FLOATCELL,findText(s))
220 #define floatToString(f) textToStr(snd(f))
221 #define floatOf(f) atof(floatToString(f))
222 #define mkFloat(f) (f) /* ToDo: is this right? */
223 #define floatNegate(f) stringToFloat(stringNegate(floatToString(f)))
225 #define stringToBignum(s) pair(BIGCELL,findText(s))
226 #define bignumToString(b) textToStr(snd(b))
230 #define isPtr(c) (isPair(c) && fst(c)==PTRCELL)
231 extern Cell mkPtr Args((Ptr));
232 extern Ptr ptrOf Args((Cell));
233 #define isCPtr(c) (isPair(c) && fst(c)==CPTRCELL)
234 extern Cell mkCPtr Args((Ptr));
235 extern Ptr cptrOf Args((Cell));
238 /* --------------------------------------------------------------------------
239 * Constructor cell tags are used as the fst element of a pair to indicate
240 * a particular syntactic construct described by the snd element of the
242 * Note that a cell c will not be treated as an application (AP/isAp) node
243 * if its first element is a constructor cell tag, whereas a cell whose fst
244 * element is a special cell will be treated as an application node.
245 * ------------------------------------------------------------------------*/
247 #define LETREC 30 /* LETREC snd :: ([Decl],Exp) */
248 #define COND 31 /* COND snd :: (Exp,Exp,Exp) */
249 #define LAMBDA 32 /* LAMBDA snd :: Alt */
250 #define FINLIST 33 /* FINLIST snd :: [Exp] */
251 #define DOCOMP 34 /* DOCOMP snd :: (Exp,[Qual]) */
252 #define BANG 35 /* BANG snd :: Type */
253 #define COMP 36 /* COMP snd :: (Exp,[Qual]) */
254 #define ASPAT 37 /* ASPAT snd :: (Var,Exp) */
255 #define ESIGN 38 /* ESIGN snd :: (Exp,Type) */
256 #define RSIGN 39 /* RSIGN snd :: (Rhs,Type) */
257 #define CASE 40 /* CASE snd :: (Exp,[Alt]) */
258 #define NUMCASE 41 /* NUMCASE snd :: (Exp,Disc,Rhs) */
259 #define FATBAR 42 /* FATBAR snd :: (Exp,Exp) */
260 #define LAZYPAT 43 /* LAZYPAT snd :: Exp */
261 #define DERIVE 45 /* DERIVE snd :: Cell */
263 #define FLOATCELL 46 /* FLOATCELL snd :: (Int,Int) */
266 #define BOOLQUAL 49 /* BOOLQUAL snd :: Exp */
267 #define QWHERE 50 /* QWHERE snd :: [Decl] */
268 #define FROMQUAL 51 /* FROMQUAL snd :: (Exp,Exp) */
269 #define DOQUAL 52 /* DOQUAL snd :: Exp */
270 #define MONADCOMP 53 /* MONADCOMP snd :: ((m,m0),(Exp,[Qual])*/
272 #define GUARDED 54 /* GUARDED snd :: [guarded exprs] */
274 #define ARRAY 55 /* Array snd :: (Bounds,[Values]) */
275 #define MUTVAR 56 /* Mutvar snd :: Cell */
277 #define HUGSOBJECT 57 /* HUGSOBJECT snd :: Cell */
281 #define WITHEXP 58 /* WITHEXP snd :: [(Var,Exp)] */
285 #define POLYTYPE 60 /* POLYTYPE snd :: (Kind,Type) */
286 #define QUAL 61 /* QUAL snd :: ([Classes],Type) */
287 #define RANK2 62 /* RANK2 snd :: (Int,Type) */
288 #define EXIST 63 /* EXIST snd :: (Int,Type) */
289 #define POLYREC 64 /* POLYREC snd :: (Int,Type) */
290 #define BIGLAM 65 /* BIGLAM snd :: (vars,patterns) */
291 #define CDICTS 66 /* CDICTS snd :: ([Pred],Type) */
293 #define LABC 67 /* LABC snd :: (con,[(Vars,Type)]) */
294 #define CONFLDS 68 /* CONFLDS snd :: (con,[Field]) */
295 #define UPDFLDS 69 /* UPDFLDS snd :: (Exp,[con],[Field]) */
297 #define RECORD 70 /* RECORD snd :: [Val] */
298 #define EXTCASE 71 /* EXTCASE snd :: (Exp,Disc,Rhs) */
299 #define RECSEL 72 /* RECSEL snd :: Ext */
301 #define IMPDEPS 73 /* IMPDEPS snd :: [Binding] */
303 #define QUALIDENT 74 /* Qualified identifier snd :: (Id,Id) */
304 #define HIDDEN 75 /* hiding import list snd :: [Entity] */
305 #define MODULEENT 76 /* module in export list snd :: con */
307 #define INFIX 77 /* INFIX snd :: (see tidyInfix) */
308 #define ONLY 78 /* ONLY snd :: Exp */
309 #define NEG 79 /* NEG snd :: Exp */
311 /* Used when parsing GHC interface files */
312 #define DICTAP 80 /* DICTTYPE snd :: (QClassId,[Type]) */
314 #if SIZEOF_INTP != SIZEOF_INT
315 #define PTRCELL 81 /* C Heap Pointer snd :: (Int,Int) */
318 #define STGVAR 92 /* STGVAR snd :: (StgRhs,info) */
319 #define STGAPP 93 /* STGAPP snd :: (StgVar,[Arg]) */
320 #define STGPRIM 94 /* STGPRIM snd :: (PrimOp,[Arg]) */
321 #define STGCON 95 /* STGCON snd :: (StgCon,[Arg]) */
322 #define PRIMCASE 96 /* PRIMCASE snd :: (Expr,[PrimAlt]) */
323 #define DEEFALT 97 /* DEEFALT snd :: (Var,Expr) */
324 #define CASEALT 98 /* CASEALT snd :: (Con,[Var],Expr) */
325 #define PRIMALT 99 /* PRIMALT snd :: ([Var],Expr) */
326 /* Last constructor tag must be less than SPECMIN */
328 /* --------------------------------------------------------------------------
329 * Special cell values:
330 * ------------------------------------------------------------------------*/
333 #define isSpec(c) (SPECMIN<=(c) && (c)<TUPMIN)/* Special cell values */
335 #define NONE 101 /* Dummy stub */
336 #define STAR 102 /* Representing the kind of types */
338 #define ROW 103 /* Representing the kind of rows */
340 #define WILDCARD 104 /* Wildcard pattern */
341 #define SKOLEM 105 /* Skolem constant */
343 #define DOTDOT 106 /* ".." in import/export list */
345 #define NAME 110 /* whatIs code for isName */
346 #define TYCON 111 /* whatIs code for isTycon */
347 #define CLASS 112 /* whatIs code for isClass */
348 #define MODULE 113 /* whatIs code for isModule */
349 #define INSTANCE 114 /* whatIs code for isInst */
350 #define TUPLE 115 /* whatIs code for tuple constructor */
351 #define OFFSET 116 /* whatis code for offset */
352 #define AP 117 /* whatIs code for application node */
353 #define CHARCELL 118 /* whatIs code for isChar */
355 #define EXT 119 /* whatIs code for isExt */
358 #define SIGDECL 120 /* Signature declaration */
359 #define FIXDECL 121 /* Fixity declaration */
360 #define FUNBIND 122 /* Function binding */
361 #define PATBIND 123 /* Pattern binding */
363 #define DATATYPE 130 /* Datatype type constructor */
364 #define NEWTYPE 131 /* Newtype type constructor */
365 #define SYNONYM 132 /* Synonym type constructor */
366 #define RESTRICTSYN 133 /* Synonym with restricted scope */
368 #define NODEPENDS 135 /* Stop calculation of deps in type check*/
369 #define PREDEFINED 136 /* Predefined name, not yet filled */
371 /* --------------------------------------------------------------------------
372 * Tuple data/type constructors:
373 * ------------------------------------------------------------------------*/
377 #define isTuple(c) (TUPMIN<=(c) && (c)<EXTMIN)
379 #define isTuple(c) (TUPMIN<=(c) && (c)<OFFMIN)
381 #define mkTuple(n) (TUPMIN+(n))
382 #define tupleOf(n) ((Int)((n)-TUPMIN))
385 #define EXTMIN (TUPMIN+NUM_TUPLES)
386 #define isExt(c) (EXTMIN<=(c) && (c)<OFFMIN)
387 #define extText(e) tabExt[(e)-EXTMIN]
388 #define extField(c) arg(fun(c))
389 #define extRow(c) arg(c)
391 extern Text DECTABLE(tabExt);
392 extern Ext mkExt Args((Text));
397 /* --------------------------------------------------------------------------
398 * Offsets: (generic types/stack offsets)
399 * ------------------------------------------------------------------------*/
402 #define OFFMIN (EXTMIN+NUM_EXT)
404 #define OFFMIN (TUPMIN+NUM_TUPLES)
406 #define isOffset(c) (OFFMIN<=(c) && (c)<MODMIN)
407 #define offsetOf(c) ((c)-OFFMIN)
408 #define mkOffset(o) (OFFMIN+(o))
410 /* --------------------------------------------------------------------------
412 * ------------------------------------------------------------------------*/
414 /* An entry in a very crude object symbol table */
415 typedef struct { char* nm; void* ad; }
418 /* Indication of section kinds for loaded objects. Needed by
419 the GC for deciding whether or not a pointer on the stack
422 typedef enum { HUGS_DL_SECTION_CODE_OR_RODATA,
423 HUGS_DL_SECTION_RWDATA,
424 HUGS_DL_SECTION_OTHER }
427 typedef struct { void* start; void* end; DLSect sect; }
430 /* --------------------------------------------------------------------------
432 * ------------------------------------------------------------------------*/
434 #define MODMIN (OFFMIN+NUM_OFFSETS)
436 #define isModule(c) (MODMIN<=(c) && (c)<TYCMIN)
437 #define mkModule(n) (MODMIN+(n))
438 #define module(n) tabModule[(n)-MODMIN]
440 /* Under Haskell 1.3, the list of qualified imports is always a subset
441 * of the list of unqualified imports. For simplicity and flexibility,
442 * we do not attempt to exploit this fact - when a module is imported
443 * unqualified, it is added to both the qualified and unqualified
445 * Similarily, Haskell 1.3 does not allow a constructor to be imported
446 * or exported without exporting the type it belongs to but the export
447 * list is just a flat list of Texts (before static analysis) or
448 * Tycons, Names and Classes (after static analysis).
452 /* Lists of top level objects (local defns + imports) */
456 List exports; /* [ Entity | (Entity, NIL|DOTDOT) ] */
457 /* List of qualified imports. Used both during compilation and when
458 * evaluating an expression in the context of the current module.
462 /* ptr to malloc'd lump of memory holding the obj file */
465 /* ptr to object symbol table; lives in mallocville.
466 Dynamically expands. */
471 /* The section-kind entries for this object module. Dynamically expands. */
477 extern Module currentModule; /* Module currently being processed */
478 extern struct Module DECTABLE(tabModule);
480 extern Bool isValidModule Args((Module));
481 extern Module newModule Args((Text));
482 extern Module findModule Args((Text));
483 extern Module findModid Args((Cell));
484 extern Void setCurrModule Args((Module));
486 extern void addOTabName Args((Module,char*,void*));
487 extern void* lookupOTabName Args((Module,char*));
488 extern char* nameFromOPtr Args((void*));
490 extern void addDLSect Args((Module,void*,void*,DLSect));
491 extern DLSect lookupDLSect Args((void*));
494 #define isPrelude(m) (m==modulePrelude)
496 /* --------------------------------------------------------------------------
497 * Type constructor names:
498 * ------------------------------------------------------------------------*/
500 #define TYCMIN (MODMIN+NUM_MODULE)
501 #define isTycon(c) (TYCMIN<=(c) && (c)<NAMEMIN)
502 #define mkTycon(n) (TCMIN+(n))
503 #define tycon(n) tabTycon[(n)-TYCMIN]
508 Module mod; /* module that defines it */
510 Kind kind; /* kind (includes arity) of Tycon */
511 Cell what; /* DATATYPE/SYNONYM/RESTRICTSYN... */
513 Name conToTag; /* used in derived code */
518 extern struct strTycon DECTABLE(tabTycon);
520 extern Tycon newTycon Args((Text));
521 extern Tycon findTycon Args((Text));
522 extern Tycon addTycon Args((Tycon));
523 extern Tycon findQualTycon Args((Cell));
524 extern Tycon addPrimTycon Args((Text,Kind,Int,Cell,Cell));
526 #define isSynonym(h) (isTycon(h) && tycon(h).what==SYNONYM)
527 #define isQualType(t) (isPair(t) && fst(t)==QUAL)
528 #define mkPolyType(n,t) pair(POLYTYPE,pair(n,t))
529 #define isPolyType(t) (isPair(t) && fst(t)==POLYTYPE)
530 #define isPolyOrQualType(t) (isPair(t) && (fst(t)==POLYTYPE || fst(t)==QUAL))
531 #define polySigOf(t) fst(snd(t))
532 #define monotypeOf(t) snd(snd(t))
534 /* --------------------------------------------------------------------------
535 * Globally defined name values:
536 * ------------------------------------------------------------------------*/
538 #define NAMEMIN (TYCMIN+NUM_TYCON)
539 #define isName(c) (NAMEMIN<=(c) && (c)<INSTMIN)
540 #define mkName(n) (NAMEMIN+(n))
541 #define name(n) tabName[(n)-NAMEMIN]
546 Module mod; /* module that defines it */
553 Cell stgVar; /* really StgVar */
554 Text callconv; /* for foreign import/export */
555 const void* primop; /* really StgPrim* */
559 extern int numNames Args(( Void ));
561 extern struct strName DECTABLE(tabName);
563 /* The number field in a name is used to distinguish various kinds of name:
564 * mfunNo(i) = code for member function, offset i
565 * members that are sole elements of dict use mfunNo(0)
566 * members of dicts with more than one elem use mfunNo(n), n>=1
567 * EXECNAME = code for executable name (bytecodes or primitive)
568 * SELNAME = code for selector function
569 * DFUNNAME = code for dictionary builder or selector
570 * cfunNo(i) = code for data constructor
571 * datatypes with only one constructor uses cfunNo(0)
572 * datatypes with multiple constructors use cfunNo(n), n>=1
580 #define isSfun(n) (name(n).number==SELNAME)
581 #define isDfun(n) (name(n).number==DFUNNAME)
583 #define isCfun(n) (name(n).number>=CFUNNAME)
584 #define cfunOf(n) (name(n).number-CFUNNAME)
585 #define cfunNo(i) ((i)+CFUNNAME)
586 #define hasCfun(cs) (nonNull(cs) && isCfun(hd(cs)))
588 #define isMfun(n) (name(n).number<0)
589 #define mfunOf(n) ((-1)-name(n).number)
590 #define mfunNo(i) ((-1)-(i))
592 extern Name newName Args((Text,Cell));
593 extern Name findName Args((Text));
594 extern Name addName Args((Name));
595 extern Name findQualName Args((Cell));
596 extern Name addPrimCfun Args((Text,Int,Int,Cell));
597 extern Name addPrimCfunREP Args((Text,Int,Int,Int));
598 extern Int sfunPos Args((Name,Name));
599 extern Name nameFromStgVar Args((Cell));
600 extern Name jrsFindQualName Args((Text,Text));
602 /* --------------------------------------------------------------------------
604 * ------------------------------------------------------------------------*/
606 #define INSTMIN (NAMEMIN+NUM_NAME) /* instances */
607 #define isInst(c) (INSTMIN<=(c) && (c)<CLASSMIN)
608 #define mkInst(n) (INSTMIN+(n))
609 #define instOf(c) ((Int)((c)-INSTMIN))
610 #define inst(in) tabInst[(in)-INSTMIN]
613 Class c; /* class C */
615 Module mod; /* module that defines it */
616 Kinds kinds; /* Kinds of variables in head */
617 Cell head; /* :: Pred */
618 List specifics; /* :: [Pred] */
619 Int numSpecifics; /* length(specifics) */
621 Name builder; /* Dictionary constructor function */
624 /* a predicate (an element :: Pred) is an application of a Class to one or
625 * more type expressions
628 #define CLASSMIN (INSTMIN+NUM_INSTS)
629 #define isClass(c) (CLASSMIN<=(c) && (c)<CHARMIN)
630 #define mkClass(n) (CLASSMIN+(n))
631 #define cclass(n) tabClass[(n)-CLASSMIN]
634 Text text; /* Name of class */
635 Int line; /* Line where declaration begins */
636 Module mod; /* module that declares it */
637 Int level; /* Level in class hierarchy */
638 Int arity; /* Number of arguments */
639 Kinds kinds; /* Kinds of constructors in class */
640 List fds; /* Functional Dependencies */
641 Cell head; /* Head of class */
642 Name dcon; /* Dictionary constructor function */
643 List supers; /* :: [Pred] */
644 Int numSupers; /* length(supers) */
645 List dsels; /* Superclass dictionary selectors */
646 List members; /* :: [Name] */
647 Int numMembers; /* length(members) */
648 List defaults; /* :: [Name] */
649 List instances; /* :: [Inst] */
652 extern struct strClass DECTABLE(tabClass);
653 extern struct strInst far *tabInst;
655 extern Class newClass Args((Text));
656 extern Class classMax Args((Void));
657 extern Class findClass Args((Text));
658 extern Class addClass Args((Class));
659 extern Class findQualClass Args((Cell));
660 extern Inst newInst Args((Void));
661 extern Inst findFirstInst Args((Tycon));
662 extern Inst findNextInst Args((Tycon,Inst));
664 /* --------------------------------------------------------------------------
666 * ------------------------------------------------------------------------*/
668 #define CHARMIN (CLASSMIN+NUM_CLASSES)
669 #define MAXCHARVAL (NUM_CHARS-1)
670 #define isChar(c) (CHARMIN<=(c) && (c)<INTMIN)
671 #define charOf(c) ((Char)(c-CHARMIN))
672 #define mkChar(c) ((Cell)(CHARMIN+(((unsigned)(c))%NUM_CHARS)))
674 /* --------------------------------------------------------------------------
675 * Small Integer values:
676 * ------------------------------------------------------------------------*/
678 #define INTMIN (CHARMIN+NUM_CHARS)
679 #define INTMAX (MAXPOSINT)
680 #define isSmall(c) (INTMIN<=(c))
681 #define INTZERO (INTMIN/2 + INTMAX/2)
682 #define MINSMALLINT (INTMIN - INTZERO)
683 #define MAXSMALLINT (INTMAX - INTZERO)
684 #define mkDigit(c) ((Cell)((c)+INTMIN))
685 #define digitOf(c) ((Int)((c)-INTMIN))
687 extern Bool isInt Args((Cell));
688 extern Int intOf Args((Cell));
689 extern Cell mkInt Args((Int));
691 /* --------------------------------------------------------------------------
692 * Implementation of triples:
693 * ------------------------------------------------------------------------*/
695 #define triple(x,y,z) pair(x,pair(y,z))
696 #define fst3(c) fst(c)
697 #define snd3(c) fst(snd(c))
698 #define thd3(c) snd(snd(c))
700 /* --------------------------------------------------------------------------
701 * Implementation of lists:
702 * ------------------------------------------------------------------------*/
705 #define isNull(c) ((c)==NIL)
706 #define nonNull(c) (c)
707 #define cons(x,xs) pair(x,xs)
708 #define singleton(x) cons(x,NIL)
709 #define doubleton(x,y) cons(x,cons(y,NIL))
710 #define tripleton(x,y,z) cons(x,cons(y,cons(z,NIL)))
714 extern Int length Args((List));
715 extern List appendOnto Args((List,List)); /* destructive */
716 extern List dupOnto Args((List,List));
717 extern List dupList Args((List));
718 extern List revOnto Args((List, List)); /* destructive */
719 #define rev(xs) revOnto((xs),NIL) /* destructive */
720 #define reverse(xs) revOnto(dupList(xs),NIL) /* non-destructive */
721 extern Cell cellIsMember Args((Cell,List));
722 extern Cell cellAssoc Args((Cell,List));
723 extern Cell cellRevAssoc Args((Cell,List));
724 extern Bool eqList Args((List,List));
725 extern Cell varIsMember Args((Text,List));
726 extern Name nameIsMember Args((Text,List));
727 extern Cell intIsMember Args((Int,List));
728 extern List replicate Args((Int,Cell));
729 extern List diffList Args((List,List)); /* destructive */
730 extern List deleteCell Args((List,Cell)); /* non-destructive */
731 extern List take Args((Int,List)); /* destructive */
732 extern List splitAt Args((Int,List)); /* non-destructive */
733 extern Cell nth Args((Int,List));
734 extern List removeCell Args((Cell,List)); /* destructive */
735 extern List dupListOnto Args((List,List)); /* non-destructive */
736 extern List nubList Args((List)); /* non-destructive */
738 /* The following macros provide `inline expansion' of some common ways of
739 * traversing, using and modifying lists:
741 * N.B. We use the names _f, _a, _xs, Zs, in an attempt to avoid clashes
742 * with identifiers used elsewhere.
745 #define mapBasic(_init,_step) {List Zs=(_init);\
746 for(;nonNull(Zs);Zs=tl(Zs)) \
748 #define mapModify(_init,_step) mapBasic(_init,hd(Zs)=_step)
750 #define mapProc(_f,_xs) mapBasic(_xs,_f(hd(Zs)))
751 #define map1Proc(_f,_a,_xs) mapBasic(_xs,_f(_a,hd(Zs)))
752 #define map2Proc(_f,_a,_b,_xs) mapBasic(_xs,_f(_a,_b,hd(Zs)))
753 #define map3Proc(_f,_a,_b,_c,_xs) mapBasic(_xs,_f(_a,_b,_c,hd(Zs)))
754 #define map4Proc(_f,_a,_b,_c,_d,_xs) mapBasic(_xs,_f(_a,_b,_c,_d,hd(Zs)))
756 #define mapOver(_f,_xs) mapModify(_xs,_f(hd(Zs)))
757 #define map1Over(_f,_a,_xs) mapModify(_xs,_f(_a,hd(Zs)))
758 #define map2Over(_f,_a,_b,_xs) mapModify(_xs,_f(_a,_b,hd(Zs)))
759 #define map3Over(_f,_a,_b,_c,_xs) mapModify(_xs,_f(_a,_b,_c,hd(Zs)))
760 #define map4Over(_f,_a,_b,_c,_d,_xs) mapModify(_xs,_f(_a,_b,_c,_d,hd(Zs)))
762 /* This is just what you want for functions with accumulating parameters */
763 #define mapAccum(_f,_acc,_xs) mapBasic(_xs,_acc=_f(_acc,hd(Zs)))
764 #define map1Accum(_f,_acc,_a,_xs) mapBasic(_xs,_acc=_f(_acc,_a,hd(Zs)))
765 #define map2Accum(_f,_acc,_a,_b,_xs) mapBasic(_xs,_acc=_f(_acc,_a,_b,hd(Zs)))
766 #define map3Accum(_f,_acc,_a,_b,_c,_xs) mapBasic(_xs,_acc=_f(_acc,_a,_b,_c,hd(Zs)))
768 /* --------------------------------------------------------------------------
769 * Implementation of function application nodes:
770 * ------------------------------------------------------------------------*/
772 #define ap(f,x) pair(f,x)
773 #define ap1(f,x) ap(f,x)
774 #define ap2(f,x,y) ap(ap(f,x),y)
775 #define ap3(f,x,y,z) ap(ap(ap(f,x),y),z)
776 #define fun(c) fst(c)
777 #define arg(c) snd(c)
778 #define isAp(c) (isPair(c) && !isTag(fst(c)))
779 extern Cell getHead Args((Cell));
780 extern List getArgs Args((Cell));
782 extern Cell nthArg Args((Int,Cell));
783 extern Int numArgs Args((Cell));
784 extern Cell applyToArgs Args((Cell,List));
786 /* --------------------------------------------------------------------------
787 * Stack implementation:
789 * NB: Use of macros makes order of evaluation hard to predict.
790 * For example, "push(1+pop());" doesn't increment TOS.
791 * ------------------------------------------------------------------------*/
793 extern Cell DECTABLE(cellStack);
796 #define clearStack() sp=(-1)
797 #define stackEmpty() (sp==(-1))
798 #define stack(p) cellStack[p]
799 #define chkStack(n) if (sp>=NUM_STACK-(n)) hugsStackOverflow()
805 #define onto(c) stack(++sp)=(c);
806 #define pop() stack(sp--)
808 #define top() stack(sp)
809 #define pushed(n) stack(sp-(n))
810 #define topfun(f) top()=ap((f),top())
811 #define toparg(x) top()=ap(top(),(x))
813 extern Void hugsStackOverflow Args((Void));
817 #define STACK_HEADROOM 16384
818 #define STACK_CHECK if (StackSpace() <= STACK_HEADROOM) \
819 internal("Macintosh function parameter stack overflow.");
824 /* --------------------------------------------------------------------------
825 * Script file control:
826 * The implementation of script file storage is hidden.
827 * ------------------------------------------------------------------------*/
829 extern Script startNewScript Args((String));
830 extern Bool moduleThisScript Args((Module));
831 extern Module moduleOfScript Args((Script));
832 extern Bool isPreludeScript Args((Void));
833 extern Module lastModule Args((Void));
834 extern Script scriptThisFile Args((Text));
835 extern Script scriptThisName Args((Name));
836 extern Script scriptThisTycon Args((Tycon));
837 extern Script scriptThisInst Args((Inst));
838 extern Script scriptThisClass Args((Class));
839 extern String fileOfModule Args((Module));
840 extern Void dropScriptsFrom Args((Script));
843 /* --------------------------------------------------------------------------
845 * ------------------------------------------------------------------------*/
848 /* This is an exact copy of the declaration found in GreenCard.h */
850 typedef int HugsStackPtr;
851 typedef int HugsStablePtr;
852 typedef Pointer HugsForeign;
856 /* evaluate next argument */
857 int (*getInt ) Args(());
858 unsigned int (*getWord ) Args(());
859 void* (*getAddr ) Args(());
860 float (*getFloat ) Args(());
861 double (*getDouble) Args(());
862 char (*getChar ) Args(());
863 HugsForeign (*getForeign) Args(());
864 HugsStablePtr (*getStablePtr) Args(());
866 /* push part of result */
867 void (*putInt ) Args((int));
868 void (*putWord ) Args((unsigned int));
869 void (*putAddr ) Args((void*));
870 void (*putFloat ) Args((double));
871 void (*putDouble) Args((double));
872 void (*putChar ) Args((char));
873 void (*putForeign) Args((HugsForeign, void (*)(HugsForeign)));
874 void (*putStablePtr) Args((HugsStablePtr));
876 /* return n values in IO monad or Id monad */
877 void (*returnIO) Args((HugsStackPtr, int));
878 void (*returnId) Args((HugsStackPtr, int));
879 int (*runIO) Args((int));
881 /* free a stable pointer */
882 void (*freeStablePtr) Args((HugsStablePtr));
884 /* register the prim table */
885 void (*registerPrims) Args((struct primInfo*));
887 /* garbage collect */
888 void (*garbageCollect) Args(());
892 extern HugsAPI2* hugsAPI2 Args((Void));
893 typedef Void (*InitModuleFun2) Args((HugsAPI2*));
896 Name nameTrue, nameFalse;
897 Name nameNil, nameCons;
898 Name nameJust, nameNothing;
899 Name nameLeft, nameRight;
903 Cell (*makeInt) Args((Int));
905 Cell (*makeChar) Args((Char));
906 Char (*CharOf) Args((Cell));
908 Cell (*makeFloat) Args((FloatPro));
909 Cell (*makeTuple) Args((Int));
910 Pair (*pair) Args((Cell,Cell));
912 Cell (*mkMallocPtr) Args((Void *, Void (*)(Void *)));
913 Void *(*derefMallocPtr) Args((Cell));
915 Int (*mkStablePtr) Args((Cell));
916 Cell (*derefStablePtr) Args((Int));
917 Void (*freeStablePtr) Args((Int));
919 Void (*eval) Args((Cell));
920 Cell (*evalWithNoError) Args((Cell));
921 Void (*evalFails) Args((StackPtr));
927 Void (*garbageCollect) Args(());
928 Void (*stackOverflow) Args(());
929 Void (*internal) Args((String)) HUGS_noreturn;
931 Void (*registerPrims) Args((struct primInfo*));
932 Name (*addPrimCfun) Args((Text,Int,Int,Cell));
933 Text (*inventText) Args(());
935 Cell *(*Fst) Args((Cell));
936 Cell *(*Snd) Args((Cell));
942 extern HugsAPI1* hugsAPI1 Args((Void));
943 typedef Void (*InitModuleFun1) Args((HugsAPI1*));
947 /* --------------------------------------------------------------------------
949 * ------------------------------------------------------------------------*/
951 extern Void setLastExpr Args((Cell));
952 extern Cell getLastExpr Args((Void));
953 extern List addTyconsMatching Args((String,List));
954 extern List addNamesMatching Args((String,List));
956 /*-------------------------------------------------------------------------*/