ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/cvsroot/microscheme/scheme.c
(Generate patch)

Comparing cvsroot/microscheme/scheme.c (file contents):
Revision 1.44 by root, Mon Nov 30 06:49:11 2015 UTC vs.
Revision 1.65 by root, Wed Dec 2 17:01:51 2015 UTC

… …
16 * (MINISCM) This is a revised and modified version by Akira KIDA. 16 * (MINISCM) This is a revised and modified version by Akira KIDA.
17 * (MINISCM) current version is 0.85k4 (15 May 1994) 17 * (MINISCM) current version is 0.85k4 (15 May 1994)
18 * 18 *
19 */ 19 */
20 20
21#define EXPERIMENT 1 21#define _POSIX_C_SOURCE 200201
22 22#define _XOPEN_SOURCE 600
23#define PAGE_SIZE 4096 /* does not work on sparc/alpha */ 23#define _GNU_SOURCE 1 /* for malloc mremap */
24#include "malloc.c"
25 24
26#define SCHEME_SOURCE 25#define SCHEME_SOURCE
27#include "scheme-private.h" 26#include "scheme-private.h"
28#ifndef WIN32 27#ifndef WIN32
29# include <unistd.h> 28# include <unistd.h>
30#endif 29#endif
31#if USE_MATH 30#if USE_MATH
32# include <math.h> 31# include <math.h>
33#endif 32#endif
34 33
34#define ECB_NO_THREADS 1
35#include "ecb.h" 35#include "ecb.h"
36 36
37#include <sys/types.h> 37#include <sys/types.h>
38#include <sys/stat.h> 38#include <sys/stat.h>
39#include <fcntl.h> 39#include <fcntl.h>
… …
47#include <string.h> 47#include <string.h>
48 48
49#include <limits.h> 49#include <limits.h>
50#include <inttypes.h> 50#include <inttypes.h>
51#include <float.h> 51#include <float.h>
52//#include <ctype.h> 52
53#if !USE_SYSTEM_MALLOC
54# define PAGE_SIZE 4096 /* does not work on sparc/alpha */
55# include "malloc.c"
56# define malloc(n) tiny_malloc (n)
57# define realloc(p,n) tiny_realloc (p, n)
58# define free(p) tiny_free (p)
59#endif
53 60
54#if '1' != '0' + 1 \ 61#if '1' != '0' + 1 \
55 || '2' != '0' + 2 || '3' != '0' + 3 || '4' != '0' + 4 || '5' != '0' + 5 \ 62 || '2' != '0' + 2 || '3' != '0' + 3 || '4' != '0' + 4 || '5' != '0' + 5 \
56 || '6' != '0' + 6 || '7' != '0' + 7 || '8' != '0' + 8 || '9' != '0' + 9 \ 63 || '6' != '0' + 6 || '7' != '0' + 7 || '8' != '0' + 8 || '9' != '0' + 9 \
57 || 'b' != 'a' + 1 || 'c' != 'a' + 2 || 'd' != 'a' + 3 || 'e' != 'a' + 4 \ 64 || 'b' != 'a' + 1 || 'c' != 'a' + 2 || 'd' != 'a' + 3 || 'e' != 'a' + 4 \
… …
79 86
80#define BACKQUOTE '`' 87#define BACKQUOTE '`'
81#define WHITESPACE " \t\r\n\v\f" 88#define WHITESPACE " \t\r\n\v\f"
82#define DELIMITERS "()\";" WHITESPACE 89#define DELIMITERS "()\";" WHITESPACE
83 90
84#define NIL (&SCHEME_V->xNIL) //TODO: make this 0? 91#define NIL POINTER (&SCHEME_V->xNIL)
85#define S_T (&SCHEME_V->xT) //TODO: magic ptr value? 92#define S_T POINTER (&SCHEME_V->xT)
86#define S_F (&SCHEME_V->xF) //TODO: magic ptr value? 93#define S_F POINTER (&SCHEME_V->xF)
87#define S_SINK (&SCHEME_V->xsink) 94#define S_SINK POINTER (&SCHEME_V->xsink)
88#define S_EOF (&SCHEME_V->xEOF_OBJ) 95#define S_EOF POINTER (&SCHEME_V->xEOF_OBJ)
89 96
90#if !USE_MULTIPLICITY 97#if !USE_MULTIPLICITY
91static scheme sc; 98static scheme sc;
92#endif 99#endif
93 100
94static void 101ecb_cold static void
95xbase (char *s, long n, int base) 102xbase (char *s, long n, int base)
96{ 103{
97 if (n < 0) 104 if (n < 0)
98 { 105 {
99 *s++ = '-'; 106 *s++ = '-';
… …
101 } 108 }
102 109
103 char *p = s; 110 char *p = s;
104 111
105 do { 112 do {
106 *p++ = '0' + n % base; 113 *p++ = "0123456789abcdef"[n % base];
107 n /= base; 114 n /= base;
108 } while (n); 115 } while (n);
109 116
110 *p-- = 0; 117 *p-- = 0;
111 118
… …
114 char x = *s; *s = *p; *p = x; 121 char x = *s; *s = *p; *p = x;
115 --p; ++s; 122 --p; ++s;
116 } 123 }
117} 124}
118 125
119static void 126ecb_cold static void
120xnum (char *s, long n) 127xnum (char *s, long n)
121{ 128{
122 xbase (s, n, 10); 129 xbase (s, n, 10);
123} 130}
124 131
125static void 132ecb_cold static void
126xwrstr (const char *s) 133putnum (SCHEME_P_ long n)
127{
128 write (1, s, strlen (s));
129}
130
131static void
132xwrnum (long n)
133{ 134{
134 char buf[64]; 135 char buf[64];
135 136
136 xnum (buf, n); 137 xnum (buf, n);
137 xwrstr (buf); 138 putstr (SCHEME_A_ buf);
138} 139}
140
141#if USE_CHAR_CLASSIFIERS
142#include <ctype.h>
143#else
139 144
140static char 145static char
141xtoupper (char c) 146xtoupper (char c)
142{ 147{
143 if (c >= 'a' && c <= 'z') 148 if (c >= 'a' && c <= 'z')
… …
163 168
164#define toupper(c) xtoupper (c) 169#define toupper(c) xtoupper (c)
165#define tolower(c) xtolower (c) 170#define tolower(c) xtolower (c)
166#define isdigit(c) xisdigit (c) 171#define isdigit(c) xisdigit (c)
167 172
173#endif
174
168#if USE_IGNORECASE 175#if USE_IGNORECASE
169static const char * 176ecb_cold static const char *
170xstrlwr (char *s) 177xstrlwr (char *s)
171{ 178{
172 const char *p = s; 179 const char *p = s;
173 180
174 while (*s) 181 while (*s)
… …
187# define stricmp(a,b) strcmp (a, b) 194# define stricmp(a,b) strcmp (a, b)
188# define strlwr(s) (s) 195# define strlwr(s) (s)
189#endif 196#endif
190 197
191#ifndef prompt 198#ifndef prompt
192# define prompt "ts> " 199# define prompt "ms> "
193#endif 200#endif
194 201
195#ifndef InitFile 202#ifndef InitFile
196# define InitFile "init.scm" 203# define InitFile "init.scm"
197#endif 204#endif
198 205
199#ifndef FIRST_CELLSEGS
200# define FIRST_CELLSEGS 3
201#endif
202
203enum scheme_types 206enum scheme_types
204{ 207{
205 T_INTEGER, 208 T_INTEGER,
209 T_CHARACTER,
206 T_REAL, 210 T_REAL,
207 T_STRING, 211 T_STRING,
208 T_SYMBOL, 212 T_SYMBOL,
209 T_PROC, 213 T_PROC,
210 T_PAIR, /* also used for free cells */ 214 T_PAIR, /* also used for free cells */
211 T_CLOSURE, 215 T_CLOSURE,
216 T_BYTECODE, // temp
217 T_MACRO,
212 T_CONTINUATION, 218 T_CONTINUATION,
213 T_FOREIGN, 219 T_FOREIGN,
214 T_CHARACTER,
215 T_PORT, 220 T_PORT,
216 T_VECTOR, 221 T_VECTOR,
217 T_MACRO,
218 T_PROMISE, 222 T_PROMISE,
219 T_ENVIRONMENT, 223 T_ENVIRONMENT,
220 /* one more... */ 224
221 T_NUM_SYSTEM_TYPES 225 T_NUM_SYSTEM_TYPES
222}; 226};
223 227
224#define T_MASKTYPE 0x000f 228#define T_MASKTYPE 0x000f
225#define T_SYNTAX 0x0010 229#define T_SYNTAX 0x0010
… …
258static num num_op (enum num_op op, num a, num b); 262static num num_op (enum num_op op, num a, num b);
259static num num_intdiv (num a, num b); 263static num num_intdiv (num a, num b);
260static num num_rem (num a, num b); 264static num num_rem (num a, num b);
261static num num_mod (num a, num b); 265static num num_mod (num a, num b);
262 266
263#if USE_MATH
264static double round_per_R5RS (double x);
265#endif
266static int is_zero_rvalue (RVALUE x); 267static int is_zero_rvalue (RVALUE x);
267 268
268static num num_zero; 269static num num_zero;
269static num num_one; 270static num num_one;
270 271
272/* convert "pointer" to cell* / cell* to pointer */
273#define CELL(p) ((struct cell *)(p) + 0)
274#define POINTER(c) ((void *)((c) - 0))
275
271/* macros for cell operations */ 276/* macros for cell operations */
272#define typeflag(p) ((p)->flag + 0) 277#define typeflag(p) (CELL(p)->flag + 0)
273#define set_typeflag(p,v) ((p)->flag = (v)) 278#define set_typeflag(p,v) (CELL(p)->flag = (v))
274#define type(p) (typeflag (p) & T_MASKTYPE) 279#define type(p) (typeflag (p) & T_MASKTYPE)
275 280
276INTERFACE int 281INTERFACE int
277is_string (pointer p) 282is_string (pointer p)
278{ 283{
279 return type (p) == T_STRING; 284 return type (p) == T_STRING;
280} 285}
281 286
282#define strvalue(p) ((p)->object.string.svalue) 287#define strvalue(p) (CELL(p)->object.string.svalue)
283#define strlength(p) ((p)->object.string.length) 288#define strlength(p) (CELL(p)->object.string.length)
284 289
285INTERFACE int 290INTERFACE int
286is_vector (pointer p) 291is_vector (pointer p)
287{ 292{
288 return type (p) == T_VECTOR; 293 return type (p) == T_VECTOR;
289} 294}
290 295
291#define vecvalue(p) ((p)->object.vector.vvalue) 296#define vecvalue(p) (CELL(p)->object.vector.vvalue)
292#define veclength(p) ((p)->object.vector.length) 297#define veclength(p) (CELL(p)->object.vector.length)
293INTERFACE void fill_vector (pointer vec, uint32_t start, pointer obj); 298INTERFACE void fill_vector (pointer vec, uint32_t start, pointer obj);
294INTERFACE pointer vector_get (pointer vec, uint32_t ielem); 299INTERFACE pointer vector_get (pointer vec, uint32_t ielem);
295INTERFACE void vector_set (pointer vec, uint32_t ielem, pointer a); 300INTERFACE void vector_set (pointer vec, uint32_t ielem, pointer a);
296 301
297INTERFACE int 302INTERFACE int
… …
323string_value (pointer p) 328string_value (pointer p)
324{ 329{
325 return strvalue (p); 330 return strvalue (p);
326} 331}
327 332
328#define ivalue_unchecked(p) (p)->object.ivalue 333#define ivalue_unchecked(p) CELL(p)->object.ivalue
329#define set_ivalue(p,v) (p)->object.ivalue = (v) 334#define set_ivalue(p,v) CELL(p)->object.ivalue = (v)
330 335
331#if USE_REAL 336#if USE_REAL
332#define rvalue_unchecked(p) (p)->object.rvalue 337#define rvalue_unchecked(p) CELL(p)->object.rvalue
333#define set_rvalue(p,v) (p)->object.rvalue = (v) 338#define set_rvalue(p,v) CELL(p)->object.rvalue = (v)
334#else 339#else
335#define rvalue_unchecked(p) (p)->object.ivalue 340#define rvalue_unchecked(p) CELL(p)->object.ivalue
336#define set_rvalue(p,v) (p)->object.ivalue = (v) 341#define set_rvalue(p,v) CELL(p)->object.ivalue = (v)
337#endif 342#endif
338 343
339INTERFACE long 344INTERFACE long
340charvalue (pointer p) 345charvalue (pointer p)
341{ 346{
342 return ivalue_unchecked (p); 347 return ivalue_unchecked (p);
343} 348}
344 349
350#define port(p) CELL(p)->object.port
351#define set_port(p,v) port(p) = (v)
345INTERFACE int 352INTERFACE int
346is_port (pointer p) 353is_port (pointer p)
347{ 354{
348 return type (p) == T_PORT; 355 return type (p) == T_PORT;
349} 356}
350 357
351INTERFACE int 358INTERFACE int
352is_inport (pointer p) 359is_inport (pointer p)
353{ 360{
354 return is_port (p) && p->object.port->kind & port_input; 361 return is_port (p) && port (p)->kind & port_input;
355} 362}
356 363
357INTERFACE int 364INTERFACE int
358is_outport (pointer p) 365is_outport (pointer p)
359{ 366{
360 return is_port (p) && p->object.port->kind & port_output; 367 return is_port (p) && port (p)->kind & port_output;
361} 368}
362 369
363INTERFACE int 370INTERFACE int
364is_pair (pointer p) 371is_pair (pointer p)
365{ 372{
366 return type (p) == T_PAIR; 373 return type (p) == T_PAIR;
367} 374}
368 375
369#define car(p) ((p)->object.cons.car + 0) 376#define car(p) (POINTER (CELL(p)->object.cons.car))
370#define cdr(p) ((p)->object.cons.cdr + 0) 377#define cdr(p) (POINTER (CELL(p)->object.cons.cdr))
371 378
372static pointer caar (pointer p) { return car (car (p)); } 379static pointer caar (pointer p) { return car (car (p)); }
373static pointer cadr (pointer p) { return car (cdr (p)); } 380static pointer cadr (pointer p) { return car (cdr (p)); }
374static pointer cdar (pointer p) { return cdr (car (p)); } 381static pointer cdar (pointer p) { return cdr (car (p)); }
375static pointer cddr (pointer p) { return cdr (cdr (p)); } 382static pointer cddr (pointer p) { return cdr (cdr (p)); }
376 383
377static pointer cadar (pointer p) { return car (cdr (car (p))); } 384static pointer cadar (pointer p) { return car (cdr (car (p))); }
378static pointer caddr (pointer p) { return car (cdr (cdr (p))); } 385static pointer caddr (pointer p) { return car (cdr (cdr (p))); }
379static pointer cdaar (pointer p) { return cdr (car (car (p))); } 386static pointer cdaar (pointer p) { return cdr (car (car (p))); }
380 387
388static pointer cadddr (pointer p) { return car (car (car (cdr (p)))); }
389
381INTERFACE void 390INTERFACE void
382set_car (pointer p, pointer q) 391set_car (pointer p, pointer q)
383{ 392{
384 p->object.cons.car = q; 393 CELL(p)->object.cons.car = CELL (q);
385} 394}
386 395
387INTERFACE void 396INTERFACE void
388set_cdr (pointer p, pointer q) 397set_cdr (pointer p, pointer q)
389{ 398{
390 p->object.cons.cdr = q; 399 CELL(p)->object.cons.cdr = CELL (q);
391} 400}
392 401
393INTERFACE pointer 402INTERFACE pointer
394pair_car (pointer p) 403pair_car (pointer p)
395{ 404{
… …
413{ 422{
414 return strvalue (p); 423 return strvalue (p);
415} 424}
416 425
417#if USE_PLIST 426#if USE_PLIST
427#error plists are broken because symbols are no longer pairs
418#define symprop(p) cdr(p) 428#define symprop(p) cdr(p)
419SCHEME_EXPORT int 429SCHEME_EXPORT int
420hasprop (pointer p) 430hasprop (pointer p)
421{ 431{
422 return typeflag (p) & T_SYMBOL; 432 return typeflag (p) & T_SYMBOL;
… …
524 proper list: length 534 proper list: length
525 circular list: -1 535 circular list: -1
526 not even a pair: -2 536 not even a pair: -2
527 dotted list: -2 minus length before dot 537 dotted list: -2 minus length before dot
528*/ 538*/
529INTERFACE int 539ecb_hot INTERFACE int
530list_length (SCHEME_P_ pointer a) 540list_length (SCHEME_P_ pointer a)
531{ 541{
532 int i = 0; 542 int i = 0;
533 pointer slow, fast; 543 pointer slow, fast;
534 544
… …
573{ 583{
574 return list_length (SCHEME_A_ a) >= 0; 584 return list_length (SCHEME_A_ a) >= 0;
575} 585}
576 586
577#if USE_CHAR_CLASSIFIERS 587#if USE_CHAR_CLASSIFIERS
588
578ecb_inline int 589ecb_inline int
579Cisalpha (int c) 590Cisalpha (int c)
580{ 591{
581 return isascii (c) && isalpha (c); 592 return isascii (c) && isalpha (c);
582} 593}
… …
640 "gs", 651 "gs",
641 "rs", 652 "rs",
642 "us" 653 "us"
643}; 654};
644 655
645static int 656ecb_cold static int
646is_ascii_name (const char *name, int *pc) 657is_ascii_name (const char *name, int *pc)
647{ 658{
648 int i; 659 int i;
649 660
650 for (i = 0; i < 32; i++) 661 for (i = 0; i < 32; i++)
… …
669 680
670static int file_push (SCHEME_P_ const char *fname); 681static int file_push (SCHEME_P_ const char *fname);
671static void file_pop (SCHEME_P); 682static void file_pop (SCHEME_P);
672static int file_interactive (SCHEME_P); 683static int file_interactive (SCHEME_P);
673ecb_inline int is_one_of (const char *s, int c); 684ecb_inline int is_one_of (const char *s, int c);
674static int alloc_cellseg (SCHEME_P_ int n); 685static int alloc_cellseg (SCHEME_P);
675ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b); 686ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b);
676static void finalize_cell (SCHEME_P_ pointer a); 687static void finalize_cell (SCHEME_P_ pointer a);
677static int count_consecutive_cells (pointer x, int needed);
678static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all); 688static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all);
679static pointer mk_number (SCHEME_P_ const num n); 689static pointer mk_number (SCHEME_P_ const num n);
680static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill); 690static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill);
681static pointer mk_vector (SCHEME_P_ uint32_t len); 691static pointer mk_vector (SCHEME_P_ uint32_t len);
682static pointer mk_atom (SCHEME_P_ char *q); 692static pointer mk_atom (SCHEME_P_ char *q);
683static pointer mk_sharp_const (SCHEME_P_ char *name); 693static pointer mk_sharp_const (SCHEME_P_ char *name);
684 694
695static pointer mk_port (SCHEME_P_ port *p);
696
685#if USE_PORTS 697#if USE_PORTS
686static pointer mk_port (SCHEME_P_ port *p);
687static pointer port_from_filename (SCHEME_P_ const char *fn, int prop); 698static pointer port_from_filename (SCHEME_P_ const char *fn, int prop);
688static pointer port_from_file (SCHEME_P_ int, int prop); 699static pointer port_from_file (SCHEME_P_ int, int prop);
689static pointer port_from_string (SCHEME_P_ char *start, char *past_the_end, int prop); 700static pointer port_from_string (SCHEME_P_ char *start, char *past_the_end, int prop);
690static port *port_rep_from_filename (SCHEME_P_ const char *fn, int prop); 701static port *port_rep_from_filename (SCHEME_P_ const char *fn, int prop);
691static port *port_rep_from_file (SCHEME_P_ int, int prop); 702static port *port_rep_from_file (SCHEME_P_ int, int prop);
692static port *port_rep_from_string (SCHEME_P_ char *start, char *past_the_end, int prop); 703static port *port_rep_from_string (SCHEME_P_ char *start, char *past_the_end, int prop);
693static void port_close (SCHEME_P_ pointer p, int flag); 704static void port_close (SCHEME_P_ pointer p, int flag);
694#endif 705#endif
706
695static void mark (pointer a); 707static void mark (pointer a);
696static void gc (SCHEME_P_ pointer a, pointer b); 708static void gc (SCHEME_P_ pointer a, pointer b);
697static int basic_inchar (port *pt); 709static int basic_inchar (port *pt);
698static int inchar (SCHEME_P); 710static int inchar (SCHEME_P);
699static void backchar (SCHEME_P_ int c); 711static void backchar (SCHEME_P_ int c);
700static char *readstr_upto (SCHEME_P_ int skip, const char *delim); 712static char *readstr_upto (SCHEME_P_ int skip, const char *delim);
701static pointer readstrexp (SCHEME_P_ char delim); 713static pointer readstrexp (SCHEME_P_ char delim);
702ecb_inline int skipspace (SCHEME_P); 714static int skipspace (SCHEME_P);
703static int token (SCHEME_P); 715static int token (SCHEME_P);
704static void printslashstring (SCHEME_P_ char *s, int len); 716static void printslashstring (SCHEME_P_ char *s, int len);
705static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen); 717static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen);
706static void printatom (SCHEME_P_ pointer l, int f); 718static void printatom (SCHEME_P_ pointer l, int f);
707static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op); 719static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op);
… …
873 } 885 }
874 886
875 return ret; 887 return ret;
876} 888}
877 889
878#if USE_MATH
879
880/* Round to nearest. Round to even if midway */
881static double
882round_per_R5RS (double x)
883{
884 double fl = floor (x);
885 double ce = ceil (x);
886 double dfl = x - fl;
887 double dce = ce - x;
888
889 if (dfl > dce)
890 return ce;
891 else if (dfl < dce)
892 return fl;
893 else
894 {
895 if (fmod (fl, 2) == 0) /* I imagine this holds */
896 return fl;
897 else
898 return ce;
899 }
900}
901#endif
902
903static int 890static int
904is_zero_rvalue (RVALUE x) 891is_zero_rvalue (RVALUE x)
905{ 892{
906 return x == 0; 893 return x == 0;
907#if 0 894#if 0
… …
912#endif 899#endif
913#endif 900#endif
914} 901}
915 902
916/* allocate new cell segment */ 903/* allocate new cell segment */
917static int 904ecb_cold static int
918alloc_cellseg (SCHEME_P_ int n) 905alloc_cellseg (SCHEME_P)
919{ 906{
920 pointer newp; 907 struct cell *newp;
921 pointer last; 908 struct cell *last;
922 pointer p; 909 struct cell *p;
923 char *cp; 910 char *cp;
924 long i; 911 long i;
925 int k; 912 int k;
926 913
927 static int segsize = CELL_SEGSIZE >> 1; 914 static int segsize = CELL_SEGSIZE >> 1;
928 segsize <<= 1; 915 segsize <<= 1;
929 916
930 for (k = 0; k < n; k++)
931 {
932 if (SCHEME_V->last_cell_seg >= CELL_NSEGMENT - 1)
933 return k;
934
935 cp = malloc (segsize * sizeof (struct cell)); 917 cp = malloc (segsize * sizeof (struct cell));
936 918
937 if (!cp && USE_ERROR_CHECKING) 919 if (!cp && USE_ERROR_CHECKING)
938 return k; 920 return k;
939 921
940 i = ++SCHEME_V->last_cell_seg; 922 i = ++SCHEME_V->last_cell_seg;
941 SCHEME_V->alloc_seg[i] = cp;
942 923
943 newp = (pointer)cp; 924 newp = (struct cell *)cp;
944 SCHEME_V->cell_seg[i] = newp; 925 SCHEME_V->cell_seg[i] = newp;
945 SCHEME_V->cell_segsize[i] = segsize; 926 SCHEME_V->cell_segsize[i] = segsize;
946 SCHEME_V->fcells += segsize; 927 SCHEME_V->fcells += segsize;
947 last = newp + segsize - 1; 928 last = newp + segsize - 1;
948 929
949 for (p = newp; p <= last; p++) 930 for (p = newp; p <= last; p++)
950 { 931 {
932 pointer cp = POINTER (p);
951 set_typeflag (p, T_PAIR); 933 set_typeflag (cp, T_PAIR);
952 set_car (p, NIL); 934 set_car (cp, NIL);
953 set_cdr (p, p + 1); 935 set_cdr (cp, POINTER (p + 1));
954 } 936 }
955 937
956 set_cdr (last, SCHEME_V->free_cell); 938 set_cdr (POINTER (last), SCHEME_V->free_cell);
957 SCHEME_V->free_cell = newp; 939 SCHEME_V->free_cell = POINTER (newp);
958 }
959 940
960 return n; 941 return 1;
961} 942}
962 943
963/* get new cell. parameter a, b is marked by gc. */ 944/* get new cell. parameter a, b is marked by gc. */
964ecb_inline pointer 945ecb_inline pointer
965get_cell_x (SCHEME_P_ pointer a, pointer b) 946get_cell_x (SCHEME_P_ pointer a, pointer b)
… …
969 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 950 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
970 return S_SINK; 951 return S_SINK;
971 952
972 if (SCHEME_V->free_cell == NIL) 953 if (SCHEME_V->free_cell == NIL)
973 { 954 {
974 const int min_to_be_recovered = SCHEME_V->last_cell_seg < 128 ? 128 * 8 : SCHEME_V->last_cell_seg * 8; 955 const int min_to_be_recovered = SCHEME_V->cell_segsize [SCHEME_V->last_cell_seg] >> 2;
975 956
976 gc (SCHEME_A_ a, b); 957 gc (SCHEME_A_ a, b);
977 958
978 if (SCHEME_V->fcells < min_to_be_recovered || SCHEME_V->free_cell == NIL) 959 if (SCHEME_V->fcells < min_to_be_recovered || SCHEME_V->free_cell == NIL)
979 { 960 {
980 /* if only a few recovered, get more to avoid fruitless gc's */ 961 /* if only a few recovered, get more to avoid fruitless gc's */
981 if (!alloc_cellseg (SCHEME_A_ 1) && SCHEME_V->free_cell == NIL) 962 if (!alloc_cellseg (SCHEME_A) && SCHEME_V->free_cell == NIL)
982 { 963 {
983#if USE_ERROR_CHECKING 964#if USE_ERROR_CHECKING
984 SCHEME_V->no_memory = 1; 965 SCHEME_V->no_memory = 1;
985 return S_SINK; 966 return S_SINK;
986#endif 967#endif
… …
998 } 979 }
999} 980}
1000 981
1001/* To retain recent allocs before interpreter knows about them - 982/* To retain recent allocs before interpreter knows about them -
1002 Tehom */ 983 Tehom */
1003 984ecb_hot static void
1004static void
1005push_recent_alloc (SCHEME_P_ pointer recent, pointer extra) 985push_recent_alloc (SCHEME_P_ pointer recent, pointer extra)
1006{ 986{
1007 pointer holder = get_cell_x (SCHEME_A_ recent, extra); 987 pointer holder = get_cell_x (SCHEME_A_ recent, extra);
1008 988
1009 set_typeflag (holder, T_PAIR); 989 set_typeflag (holder, T_PAIR);
… …
1011 set_car (holder, recent); 991 set_car (holder, recent);
1012 set_cdr (holder, car (S_SINK)); 992 set_cdr (holder, car (S_SINK));
1013 set_car (S_SINK, holder); 993 set_car (S_SINK, holder);
1014} 994}
1015 995
1016static pointer 996ecb_hot static pointer
1017get_cell (SCHEME_P_ pointer a, pointer b) 997get_cell (SCHEME_P_ pointer a, pointer b)
1018{ 998{
1019 pointer cell = get_cell_x (SCHEME_A_ a, b); 999 pointer cell = get_cell_x (SCHEME_A_ a, b);
1020 1000
1021 /* For right now, include "a" and "b" in "cell" so that gc doesn't 1001 /* For right now, include "a" and "b" in "cell" so that gc doesn't
… …
1030} 1010}
1031 1011
1032static pointer 1012static pointer
1033get_vector_object (SCHEME_P_ uint32_t len, pointer init) 1013get_vector_object (SCHEME_P_ uint32_t len, pointer init)
1034{ 1014{
1035 pointer v = get_cell_x (SCHEME_A_ 0, 0); 1015 pointer v = get_cell_x (SCHEME_A_ NIL, NIL);
1036 pointer *e = malloc (len * sizeof (pointer)); 1016 pointer *e = malloc (len * sizeof (pointer));
1037 1017
1038 if (!e && USE_ERROR_CHECKING) 1018 if (!e && USE_ERROR_CHECKING)
1039 return S_SINK; 1019 return S_SINK;
1040 1020
1041 /* Record it as a vector so that gc understands it. */ 1021 /* Record it as a vector so that gc understands it. */
1042 set_typeflag (v, T_VECTOR | T_ATOM); 1022 set_typeflag (v, T_VECTOR | T_ATOM);
1043 1023
1044 v->object.vector.vvalue = e; 1024 CELL(v)->object.vector.vvalue = e;
1045 v->object.vector.length = len; 1025 CELL(v)->object.vector.length = len;
1046 fill_vector (v, 0, init); 1026 fill_vector (v, 0, init);
1047 push_recent_alloc (SCHEME_A_ v, NIL); 1027 push_recent_alloc (SCHEME_A_ v, NIL);
1048 1028
1049 return v; 1029 return v;
1050} 1030}
… …
1059static void 1039static void
1060check_cell_alloced (pointer p, int expect_alloced) 1040check_cell_alloced (pointer p, int expect_alloced)
1061{ 1041{
1062 /* Can't use putstr(SCHEME_A_ str) because callers have no access to sc. */ 1042 /* Can't use putstr(SCHEME_A_ str) because callers have no access to sc. */
1063 if (typeflag (p) & !expect_alloced) 1043 if (typeflag (p) & !expect_alloced)
1064 xwrstr ("Cell is already allocated!\n"); 1044 putstr (SCHEME_A_ "Cell is already allocated!\n");
1065 1045
1066 if (!(typeflag (p)) & expect_alloced) 1046 if (!(typeflag (p)) & expect_alloced)
1067 xwrstr ("Cell is not allocated!\n"); 1047 putstr (SCHEME_A_ "Cell is not allocated!\n");
1068} 1048}
1069 1049
1070static void 1050static void
1071check_range_alloced (pointer p, int n, int expect_alloced) 1051check_range_alloced (pointer p, int n, int expect_alloced)
1072{ 1052{
… …
1078#endif 1058#endif
1079 1059
1080/* Medium level cell allocation */ 1060/* Medium level cell allocation */
1081 1061
1082/* get new cons cell */ 1062/* get new cons cell */
1083pointer 1063ecb_hot static pointer
1084xcons (SCHEME_P_ pointer a, pointer b, int immutable) 1064xcons (SCHEME_P_ pointer a, pointer b)
1085{ 1065{
1086 pointer x = get_cell (SCHEME_A_ a, b); 1066 pointer x = get_cell (SCHEME_A_ a, b);
1087 1067
1088 set_typeflag (x, T_PAIR); 1068 set_typeflag (x, T_PAIR);
1089
1090 if (immutable)
1091 setimmutable (x);
1092 1069
1093 set_car (x, a); 1070 set_car (x, a);
1094 set_cdr (x, b); 1071 set_cdr (x, b);
1095 1072
1096 return x; 1073 return x;
1097} 1074}
1098 1075
1099static pointer 1076ecb_hot static pointer
1077ximmutable_cons (SCHEME_P_ pointer a, pointer b)
1078{
1079 pointer x = xcons (SCHEME_A_ a, b);
1080 setimmutable (x);
1081 return x;
1082}
1083
1084#define cons(a,b) xcons (SCHEME_A_ a, b)
1085#define immutable_cons(a,b) ximmutable_cons (SCHEME_A_ a, b)
1086
1087ecb_cold static pointer
1100generate_symbol (SCHEME_P_ const char *name) 1088generate_symbol (SCHEME_P_ const char *name)
1101{ 1089{
1102 pointer x = mk_string (SCHEME_A_ name); 1090 pointer x = mk_string (SCHEME_A_ name);
1103 setimmutable (x); 1091 setimmutable (x);
1104 set_typeflag (x, T_SYMBOL | T_ATOM); 1092 set_typeflag (x, T_SYMBOL | T_ATOM);
… …
1110#ifndef USE_OBJECT_LIST 1098#ifndef USE_OBJECT_LIST
1111 1099
1112static int 1100static int
1113hash_fn (const char *key, int table_size) 1101hash_fn (const char *key, int table_size)
1114{ 1102{
1115 const unsigned char *p = key; 1103 const unsigned char *p = (unsigned char *)key;
1116 uint32_t hash = 2166136261; 1104 uint32_t hash = 2166136261U;
1117 1105
1118 while (*p) 1106 while (*p)
1119 hash = (hash ^ *p++) * 16777619; 1107 hash = (hash ^ *p++) * 16777619;
1120 1108
1121 return hash % table_size; 1109 return hash % table_size;
1122} 1110}
1123 1111
1124static pointer 1112ecb_cold static pointer
1125oblist_initial_value (SCHEME_P) 1113oblist_initial_value (SCHEME_P)
1126{ 1114{
1127 return mk_vector (SCHEME_A_ 461); /* probably should be bigger */ 1115 return mk_vector (SCHEME_A_ 461); /* probably should be bigger */
1128} 1116}
1129 1117
1130/* returns the new symbol */ 1118/* returns the new symbol */
1131static pointer 1119ecb_cold static pointer
1132oblist_add_by_name (SCHEME_P_ const char *name) 1120oblist_add_by_name (SCHEME_P_ const char *name)
1133{ 1121{
1134 pointer x = generate_symbol (SCHEME_A_ name); 1122 pointer x = generate_symbol (SCHEME_A_ name);
1135 int location = hash_fn (name, veclength (SCHEME_V->oblist)); 1123 int location = hash_fn (name, veclength (SCHEME_V->oblist));
1136 vector_set (SCHEME_V->oblist, location, immutable_cons (x, vector_get (SCHEME_V->oblist, location))); 1124 vector_set (SCHEME_V->oblist, location, immutable_cons (x, vector_get (SCHEME_V->oblist, location)));
1137 return x; 1125 return x;
1138} 1126}
1139 1127
1140ecb_inline pointer 1128ecb_cold static pointer
1141oblist_find_by_name (SCHEME_P_ const char *name) 1129oblist_find_by_name (SCHEME_P_ const char *name)
1142{ 1130{
1143 int location; 1131 int location;
1144 pointer x; 1132 pointer x;
1145 char *s; 1133 char *s;
… …
1156 } 1144 }
1157 1145
1158 return NIL; 1146 return NIL;
1159} 1147}
1160 1148
1161static pointer 1149ecb_cold static pointer
1162oblist_all_symbols (SCHEME_P) 1150oblist_all_symbols (SCHEME_P)
1163{ 1151{
1164 int i; 1152 int i;
1165 pointer x; 1153 pointer x;
1166 pointer ob_list = NIL; 1154 pointer ob_list = NIL;
… …
1172 return ob_list; 1160 return ob_list;
1173} 1161}
1174 1162
1175#else 1163#else
1176 1164
1177static pointer 1165ecb_cold static pointer
1178oblist_initial_value (SCHEME_P) 1166oblist_initial_value (SCHEME_P)
1179{ 1167{
1180 return NIL; 1168 return NIL;
1181} 1169}
1182 1170
1183ecb_inline pointer 1171ecb_cold static pointer
1184oblist_find_by_name (SCHEME_P_ const char *name) 1172oblist_find_by_name (SCHEME_P_ const char *name)
1185{ 1173{
1186 pointer x; 1174 pointer x;
1187 char *s; 1175 char *s;
1188 1176
… …
1197 1185
1198 return NIL; 1186 return NIL;
1199} 1187}
1200 1188
1201/* returns the new symbol */ 1189/* returns the new symbol */
1202static pointer 1190ecb_cold static pointer
1203oblist_add_by_name (SCHEME_P_ const char *name) 1191oblist_add_by_name (SCHEME_P_ const char *name)
1204{ 1192{
1205 pointer x = mk_string (SCHEME_A_ name); 1193 pointer x = generate_symbol (SCHEME_A_ name);
1206 set_typeflag (x, T_SYMBOL);
1207 setimmutable (x);
1208 SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist); 1194 SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist);
1209 return x; 1195 return x;
1210} 1196}
1211 1197
1212static pointer 1198ecb_cold static pointer
1213oblist_all_symbols (SCHEME_P) 1199oblist_all_symbols (SCHEME_P)
1214{ 1200{
1215 return SCHEME_V->oblist; 1201 return SCHEME_V->oblist;
1216} 1202}
1217 1203
1218#endif 1204#endif
1219 1205
1220#if USE_PORTS
1221static pointer 1206ecb_cold static pointer
1222mk_port (SCHEME_P_ port *p) 1207mk_port (SCHEME_P_ port *p)
1223{ 1208{
1224 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1209 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1225 1210
1226 set_typeflag (x, T_PORT | T_ATOM); 1211 set_typeflag (x, T_PORT | T_ATOM);
1227 x->object.port = p; 1212 set_port (x, p);
1228 1213
1229 return x; 1214 return x;
1230} 1215}
1231#endif
1232 1216
1233pointer 1217ecb_cold pointer
1234mk_foreign_func (SCHEME_P_ foreign_func f) 1218mk_foreign_func (SCHEME_P_ foreign_func f)
1235{ 1219{
1236 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1220 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1237 1221
1238 set_typeflag (x, (T_FOREIGN | T_ATOM)); 1222 set_typeflag (x, T_FOREIGN | T_ATOM);
1239 x->object.ff = f; 1223 CELL(x)->object.ff = f;
1240 1224
1241 return x; 1225 return x;
1242} 1226}
1243 1227
1244INTERFACE pointer 1228INTERFACE pointer
1245mk_character (SCHEME_P_ int c) 1229mk_character (SCHEME_P_ int c)
1246{ 1230{
1247 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1231 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1248 1232
1249 set_typeflag (x, (T_CHARACTER | T_ATOM)); 1233 set_typeflag (x, T_CHARACTER | T_ATOM);
1250 set_ivalue (x, c & 0xff); 1234 set_ivalue (x, c & 0xff);
1251 1235
1252 return x; 1236 return x;
1253} 1237}
1254 1238
1255/* get number atom (integer) */ 1239/* get number atom (integer) */
1256INTERFACE pointer 1240INTERFACE pointer
1257mk_integer (SCHEME_P_ long n) 1241mk_integer (SCHEME_P_ long n)
1258{ 1242{
1243 pointer p = 0;
1244 pointer *pp = &p;
1245
1246#if USE_INTCACHE
1247 if (n >= INTCACHE_MIN && n <= INTCACHE_MAX)
1248 pp = &SCHEME_V->intcache[n - INTCACHE_MIN];
1249#endif
1250
1251 if (!*pp)
1252 {
1259 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1253 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1260 1254
1261 set_typeflag (x, (T_INTEGER | T_ATOM)); 1255 set_typeflag (x, T_INTEGER | T_ATOM);
1256 setimmutable (x); /* shouldn't do anythi9ng, doesn't cost anything */
1262 set_ivalue (x, n); 1257 set_ivalue (x, n);
1263 1258
1259 *pp = x;
1260 }
1261
1264 return x; 1262 return *pp;
1265} 1263}
1266 1264
1267INTERFACE pointer 1265INTERFACE pointer
1268mk_real (SCHEME_P_ RVALUE n) 1266mk_real (SCHEME_P_ RVALUE n)
1269{ 1267{
1270#if USE_REAL 1268#if USE_REAL
1271 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1269 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1272 1270
1273 set_typeflag (x, (T_REAL | T_ATOM)); 1271 set_typeflag (x, T_REAL | T_ATOM);
1274 set_rvalue (x, n); 1272 set_rvalue (x, n);
1275 1273
1276 return x; 1274 return x;
1277#else 1275#else
1278 return mk_integer (SCHEME_A_ n); 1276 return mk_integer (SCHEME_A_ n);
… …
1389 x = oblist_add_by_name (SCHEME_A_ name); 1387 x = oblist_add_by_name (SCHEME_A_ name);
1390 1388
1391 return x; 1389 return x;
1392} 1390}
1393 1391
1394INTERFACE pointer 1392ecb_cold INTERFACE pointer
1395gensym (SCHEME_P) 1393gensym (SCHEME_P)
1396{ 1394{
1397 pointer x; 1395 pointer x;
1398 char name[40] = "gensym-"; 1396 char name[40] = "gensym-";
1399 xnum (name + 7, ++SCHEME_V->gensym_cnt); 1397 xnum (name + 7, ++SCHEME_V->gensym_cnt);
… …
1406{ 1404{
1407 return is_symbol (x) && oblist_find_by_name (SCHEME_A_ strvalue (x)) != x; 1405 return is_symbol (x) && oblist_find_by_name (SCHEME_A_ strvalue (x)) != x;
1408} 1406}
1409 1407
1410/* make symbol or number atom from string */ 1408/* make symbol or number atom from string */
1411static pointer 1409ecb_cold static pointer
1412mk_atom (SCHEME_P_ char *q) 1410mk_atom (SCHEME_P_ char *q)
1413{ 1411{
1414 char c, *p; 1412 char c, *p;
1415 int has_dec_point = 0; 1413 int has_dec_point = 0;
1416 int has_fp_exp = 0; 1414 int has_fp_exp = 0;
… …
1487 1485
1488 return mk_integer (SCHEME_A_ strtol (q, 0, 10)); 1486 return mk_integer (SCHEME_A_ strtol (q, 0, 10));
1489} 1487}
1490 1488
1491/* make constant */ 1489/* make constant */
1492static pointer 1490ecb_cold static pointer
1493mk_sharp_const (SCHEME_P_ char *name) 1491mk_sharp_const (SCHEME_P_ char *name)
1494{ 1492{
1495 if (!strcmp (name, "t")) 1493 if (!strcmp (name, "t"))
1496 return S_T; 1494 return S_T;
1497 else if (!strcmp (name, "f")) 1495 else if (!strcmp (name, "f"))
1498 return S_F; 1496 return S_F;
1499 else if (*name == '\\') /* #\w (character) */ 1497 else if (*name == '\\') /* #\w (character) */
1500 { 1498 {
1501 int c; 1499 int c;
1502 1500
1501 // TODO: optimise
1503 if (stricmp (name + 1, "space") == 0) 1502 if (stricmp (name + 1, "space") == 0)
1504 c = ' '; 1503 c = ' ';
1505 else if (stricmp (name + 1, "newline") == 0) 1504 else if (stricmp (name + 1, "newline") == 0)
1506 c = '\n'; 1505 c = '\n';
1507 else if (stricmp (name + 1, "return") == 0) 1506 else if (stricmp (name + 1, "return") == 0)
1508 c = '\r'; 1507 c = '\r';
1509 else if (stricmp (name + 1, "tab") == 0) 1508 else if (stricmp (name + 1, "tab") == 0)
1510 c = '\t'; 1509 c = '\t';
1510 else if (stricmp (name + 1, "alarm") == 0)
1511 c = 0x07;
1512 else if (stricmp (name + 1, "backspace") == 0)
1513 c = 0x08;
1514 else if (stricmp (name + 1, "escape") == 0)
1515 c = 0x1b;
1516 else if (stricmp (name + 1, "delete") == 0)
1517 c = 0x7f;
1518 else if (stricmp (name + 1, "null") == 0)
1519 c = 0;
1511 else if (name[1] == 'x' && name[2] != 0) 1520 else if (name[1] == 'x' && name[2] != 0)
1512 { 1521 {
1513 long c1 = strtol (name + 2, 0, 16); 1522 long c1 = strtol (name + 2, 0, 16);
1514 1523
1515 if (0 <= c1 && c1 <= UCHAR_MAX) 1524 if (0 <= c1 && c1 <= UCHAR_MAX)
… …
1540 return NIL; 1549 return NIL;
1541 } 1550 }
1542} 1551}
1543 1552
1544/* ========== garbage collector ========== */ 1553/* ========== garbage collector ========== */
1554
1555static void
1556finalize_cell (SCHEME_P_ pointer a)
1557{
1558 /* TODO, fast bitmap check? */
1559 if (is_string (a) || is_symbol (a))
1560 free (strvalue (a));
1561 else if (is_vector (a))
1562 free (vecvalue (a));
1563#if USE_PORTS
1564 else if (is_port (a))
1565 {
1566 if (port(a)->kind & port_file && port (a)->rep.stdio.closeit)
1567 port_close (SCHEME_A_ a, port_input | port_output);
1568
1569 free (port (a));
1570 }
1571#endif
1572}
1545 1573
1546/*-- 1574/*--
1547 * We use algorithm E (Knuth, The Art of Computer Programming Vol.1, 1575 * We use algorithm E (Knuth, The Art of Computer Programming Vol.1,
1548 * sec. 2.3.5), the Schorr-Deutsch-Waite link-inversion algorithm, 1576 * sec. 2.3.5), the Schorr-Deutsch-Waite link-inversion algorithm,
1549 * for marking. 1577 * for marking.
1550 * 1578 *
1551 * The exception is vectors - vectors are currently marked recursively, 1579 * The exception is vectors - vectors are currently marked recursively,
1552 * which is inherited form tinyscheme and could be fixed by having another 1580 * which is inherited form tinyscheme and could be fixed by having another
1553 * word of context in the vector 1581 * word of context in the vector
1554 */ 1582 */
1555static void 1583ecb_hot static void
1556mark (pointer a) 1584mark (pointer a)
1557{ 1585{
1558 pointer t, q, p; 1586 pointer t, q, p;
1559 1587
1560 t = 0; 1588 t = 0;
… …
1617 p = q; 1645 p = q;
1618 goto E6; 1646 goto E6;
1619 } 1647 }
1620} 1648}
1621 1649
1650ecb_hot static void
1651gc_free (SCHEME_P)
1652{
1653 int i;
1654 uint32_t total = 0;
1655
1656 /* Here we scan the cells to build the free-list. */
1657 for (i = SCHEME_V->last_cell_seg; i >= 0; i--)
1658 {
1659 struct cell *end = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i];
1660 struct cell *p;
1661 total += SCHEME_V->cell_segsize [i];
1662
1663 for (p = SCHEME_V->cell_seg[i]; p < end; ++p)
1664 {
1665 pointer c = POINTER (p);
1666
1667 if (is_mark (c))
1668 clrmark (c);
1669 else
1670 {
1671 /* reclaim cell */
1672 if (typeflag (c) != T_PAIR)
1673 {
1674 finalize_cell (SCHEME_A_ c);
1675 set_typeflag (c, T_PAIR);
1676 set_car (c, NIL);
1677 }
1678
1679 ++SCHEME_V->fcells;
1680 set_cdr (c, SCHEME_V->free_cell);
1681 SCHEME_V->free_cell = c;
1682 }
1683 }
1684 }
1685
1686 if (SCHEME_V->gc_verbose)
1687 {
1688 putstr (SCHEME_A_ "done: "); putnum (SCHEME_A_ SCHEME_V->fcells); putstr (SCHEME_A_ " out of "); putnum (SCHEME_A_ total); putstr (SCHEME_A_ " cells were recovered.\n");
1689 }
1690}
1691
1622/* garbage collection. parameter a, b is marked. */ 1692/* garbage collection. parameter a, b is marked. */
1623static void 1693ecb_cold static void
1624gc (SCHEME_P_ pointer a, pointer b) 1694gc (SCHEME_P_ pointer a, pointer b)
1625{ 1695{
1626 pointer p;
1627 int i; 1696 int i;
1628 1697
1629 if (SCHEME_V->gc_verbose) 1698 if (SCHEME_V->gc_verbose)
1630 putstr (SCHEME_A_ "gc..."); 1699 putstr (SCHEME_A_ "gc...");
1631 1700
… …
1647 /* Mark recent objects the interpreter doesn't know about yet. */ 1716 /* Mark recent objects the interpreter doesn't know about yet. */
1648 mark (car (S_SINK)); 1717 mark (car (S_SINK));
1649 /* Mark any older stuff above nested C calls */ 1718 /* Mark any older stuff above nested C calls */
1650 mark (SCHEME_V->c_nest); 1719 mark (SCHEME_V->c_nest);
1651 1720
1721#if USE_INTCACHE
1722 /* mark intcache */
1723 for (i = INTCACHE_MIN; i <= INTCACHE_MAX; ++i)
1724 if (SCHEME_V->intcache[i - INTCACHE_MIN])
1725 mark (SCHEME_V->intcache[i - INTCACHE_MIN]);
1726#endif
1727
1652 /* mark variables a, b */ 1728 /* mark variables a, b */
1653 mark (a); 1729 mark (a);
1654 mark (b); 1730 mark (b);
1655 1731
1656 /* garbage collect */ 1732 /* garbage collect */
1657 clrmark (NIL); 1733 clrmark (NIL);
1658 SCHEME_V->fcells = 0; 1734 SCHEME_V->fcells = 0;
1659 SCHEME_V->free_cell = NIL; 1735 SCHEME_V->free_cell = NIL;
1660 1736
1661 uint32_t total = 0;
1662
1663 /* Here we scan the cells to build the free-list. */
1664 for (i = SCHEME_V->last_cell_seg; i >= 0; i--)
1665 {
1666 pointer end = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i];
1667 total += SCHEME_V->cell_segsize [i];
1668
1669 for (p = SCHEME_V->cell_seg[i]; p < end; ++p)
1670 {
1671 if (is_mark (p))
1672 clrmark (p);
1673 else
1674 {
1675 /* reclaim cell */
1676 if (typeflag (p) != T_PAIR)
1677 {
1678 finalize_cell (SCHEME_A_ p);
1679 set_typeflag (p, T_PAIR);
1680 set_car (p, NIL);
1681 }
1682
1683 ++SCHEME_V->fcells;
1684 set_cdr (p, SCHEME_V->free_cell);
1685 SCHEME_V->free_cell = p;
1686 }
1687 }
1688 }
1689
1690 if (SCHEME_V->gc_verbose) 1737 if (SCHEME_V->gc_verbose)
1691 { 1738 putstr (SCHEME_A_ "freeing...");
1692 xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" out of "); xwrnum (total); xwrstr (" cells were recovered.\n");
1693 }
1694}
1695 1739
1696static void 1740 gc_free (SCHEME_A);
1697finalize_cell (SCHEME_P_ pointer a)
1698{
1699 /* TODO, fast bitmap check? */
1700 if (is_string (a) || is_symbol (a))
1701 free (strvalue (a));
1702 else if (is_vector (a))
1703 free (vecvalue (a));
1704#if USE_PORTS
1705 else if (is_port (a))
1706 {
1707 if (a->object.port->kind & port_file && a->object.port->rep.stdio.closeit)
1708 port_close (SCHEME_A_ a, port_input | port_output);
1709
1710 free (a->object.port);
1711 }
1712#endif
1713} 1741}
1714 1742
1715/* ========== Routines for Reading ========== */ 1743/* ========== Routines for Reading ========== */
1716 1744
1717static int 1745ecb_cold static int
1718file_push (SCHEME_P_ const char *fname) 1746file_push (SCHEME_P_ const char *fname)
1719{ 1747{
1720#if USE_PORTS
1721 int fin; 1748 int fin;
1722 1749
1723 if (SCHEME_V->file_i == MAXFIL - 1) 1750 if (SCHEME_V->file_i == MAXFIL - 1)
1724 return 0; 1751 return 0;
1725 1752
… …
1731 SCHEME_V->load_stack[SCHEME_V->file_i].unget = -1; 1758 SCHEME_V->load_stack[SCHEME_V->file_i].unget = -1;
1732 SCHEME_V->load_stack[SCHEME_V->file_i].kind = port_file | port_input; 1759 SCHEME_V->load_stack[SCHEME_V->file_i].kind = port_file | port_input;
1733 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.file = fin; 1760 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.file = fin;
1734 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.closeit = 1; 1761 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.closeit = 1;
1735 SCHEME_V->nesting_stack[SCHEME_V->file_i] = 0; 1762 SCHEME_V->nesting_stack[SCHEME_V->file_i] = 0;
1736 SCHEME_V->loadport->object.port = SCHEME_V->load_stack + SCHEME_V->file_i; 1763 set_port (SCHEME_V->loadport, SCHEME_V->load_stack + SCHEME_V->file_i);
1737 1764
1738#if SHOW_ERROR_LINE 1765#if SHOW_ERROR_LINE
1739 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line = 0; 1766 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line = 0;
1740 1767
1741 if (fname) 1768 if (fname)
1742 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.filename = store_string (SCHEME_A_ strlen (fname), fname, 0); 1769 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.filename = store_string (SCHEME_A_ strlen (fname), fname, 0);
1743#endif 1770#endif
1744 } 1771 }
1745 1772
1746 return fin >= 0; 1773 return fin >= 0;
1747
1748#else
1749 return 1;
1750#endif
1751} 1774}
1752 1775
1753static void 1776ecb_cold static void
1754file_pop (SCHEME_P) 1777file_pop (SCHEME_P)
1755{ 1778{
1756 if (SCHEME_V->file_i != 0) 1779 if (SCHEME_V->file_i != 0)
1757 { 1780 {
1758 SCHEME_V->nesting = SCHEME_V->nesting_stack[SCHEME_V->file_i]; 1781 SCHEME_V->nesting = SCHEME_V->nesting_stack[SCHEME_V->file_i];
1759#if USE_PORTS 1782#if USE_PORTS
1760 port_close (SCHEME_A_ SCHEME_V->loadport, port_input); 1783 port_close (SCHEME_A_ SCHEME_V->loadport, port_input);
1761#endif 1784#endif
1762 SCHEME_V->file_i--; 1785 SCHEME_V->file_i--;
1763 SCHEME_V->loadport->object.port = SCHEME_V->load_stack + SCHEME_V->file_i; 1786 set_port (SCHEME_V->loadport, SCHEME_V->load_stack + SCHEME_V->file_i);
1764 } 1787 }
1765} 1788}
1766 1789
1767static int 1790ecb_cold static int
1768file_interactive (SCHEME_P) 1791file_interactive (SCHEME_P)
1769{ 1792{
1770#if USE_PORTS 1793#if USE_PORTS
1771 return SCHEME_V->file_i == 0 1794 return SCHEME_V->file_i == 0
1772 && SCHEME_V->load_stack[0].rep.stdio.file == STDIN_FILENO 1795 && SCHEME_V->load_stack[0].rep.stdio.file == STDIN_FILENO
1773 && (SCHEME_V->inport->object.port->kind & port_file); 1796 && (port (SCHEME_V->inport)->kind & port_file);
1774#else 1797#else
1775 return 0; 1798 return 0;
1776#endif 1799#endif
1777} 1800}
1778 1801
1779#if USE_PORTS 1802#if USE_PORTS
1780static port * 1803ecb_cold static port *
1781port_rep_from_filename (SCHEME_P_ const char *fn, int prop) 1804port_rep_from_filename (SCHEME_P_ const char *fn, int prop)
1782{ 1805{
1783 int fd; 1806 int fd;
1784 int flags; 1807 int flags;
1785 char *rw; 1808 char *rw;
… …
1808# endif 1831# endif
1809 1832
1810 return pt; 1833 return pt;
1811} 1834}
1812 1835
1813static pointer 1836ecb_cold static pointer
1814port_from_filename (SCHEME_P_ const char *fn, int prop) 1837port_from_filename (SCHEME_P_ const char *fn, int prop)
1815{ 1838{
1816 port *pt = port_rep_from_filename (SCHEME_A_ fn, prop); 1839 port *pt = port_rep_from_filename (SCHEME_A_ fn, prop);
1817 1840
1818 if (!pt && USE_ERROR_CHECKING) 1841 if (!pt && USE_ERROR_CHECKING)
1819 return NIL; 1842 return NIL;
1820 1843
1821 return mk_port (SCHEME_A_ pt); 1844 return mk_port (SCHEME_A_ pt);
1822} 1845}
1823 1846
1824static port * 1847ecb_cold static port *
1825port_rep_from_file (SCHEME_P_ int f, int prop) 1848port_rep_from_file (SCHEME_P_ int f, int prop)
1826{ 1849{
1827 port *pt = malloc (sizeof *pt); 1850 port *pt = malloc (sizeof *pt);
1828 1851
1829 if (!pt && USE_ERROR_CHECKING) 1852 if (!pt && USE_ERROR_CHECKING)
… …
1834 pt->rep.stdio.file = f; 1857 pt->rep.stdio.file = f;
1835 pt->rep.stdio.closeit = 0; 1858 pt->rep.stdio.closeit = 0;
1836 return pt; 1859 return pt;
1837} 1860}
1838 1861
1839static pointer 1862ecb_cold static pointer
1840port_from_file (SCHEME_P_ int f, int prop) 1863port_from_file (SCHEME_P_ int f, int prop)
1841{ 1864{
1842 port *pt = port_rep_from_file (SCHEME_A_ f, prop); 1865 port *pt = port_rep_from_file (SCHEME_A_ f, prop);
1843 1866
1844 if (!pt && USE_ERROR_CHECKING) 1867 if (!pt && USE_ERROR_CHECKING)
1845 return NIL; 1868 return NIL;
1846 1869
1847 return mk_port (SCHEME_A_ pt); 1870 return mk_port (SCHEME_A_ pt);
1848} 1871}
1849 1872
1850static port * 1873ecb_cold static port *
1851port_rep_from_string (SCHEME_P_ char *start, char *past_the_end, int prop) 1874port_rep_from_string (SCHEME_P_ char *start, char *past_the_end, int prop)
1852{ 1875{
1853 port *pt = malloc (sizeof (port)); 1876 port *pt = malloc (sizeof (port));
1854 1877
1855 if (!pt && USE_ERROR_CHECKING) 1878 if (!pt && USE_ERROR_CHECKING)
… …
1861 pt->rep.string.curr = start; 1884 pt->rep.string.curr = start;
1862 pt->rep.string.past_the_end = past_the_end; 1885 pt->rep.string.past_the_end = past_the_end;
1863 return pt; 1886 return pt;
1864} 1887}
1865 1888
1866static pointer 1889ecb_cold static pointer
1867port_from_string (SCHEME_P_ char *start, char *past_the_end, int prop) 1890port_from_string (SCHEME_P_ char *start, char *past_the_end, int prop)
1868{ 1891{
1869 port *pt = port_rep_from_string (SCHEME_A_ start, past_the_end, prop); 1892 port *pt = port_rep_from_string (SCHEME_A_ start, past_the_end, prop);
1870 1893
1871 if (!pt && USE_ERROR_CHECKING) 1894 if (!pt && USE_ERROR_CHECKING)
… …
1874 return mk_port (SCHEME_A_ pt); 1897 return mk_port (SCHEME_A_ pt);
1875} 1898}
1876 1899
1877# define BLOCK_SIZE 256 1900# define BLOCK_SIZE 256
1878 1901
1879static port * 1902ecb_cold static port *
1880port_rep_from_scratch (SCHEME_P) 1903port_rep_from_scratch (SCHEME_P)
1881{ 1904{
1882 char *start; 1905 char *start;
1883 port *pt = malloc (sizeof (port)); 1906 port *pt = malloc (sizeof (port));
1884 1907
… …
1898 pt->rep.string.curr = start; 1921 pt->rep.string.curr = start;
1899 pt->rep.string.past_the_end = start + BLOCK_SIZE - 1; 1922 pt->rep.string.past_the_end = start + BLOCK_SIZE - 1;
1900 return pt; 1923 return pt;
1901} 1924}
1902 1925
1903static pointer 1926ecb_cold static pointer
1904port_from_scratch (SCHEME_P) 1927port_from_scratch (SCHEME_P)
1905{ 1928{
1906 port *pt = port_rep_from_scratch (SCHEME_A); 1929 port *pt = port_rep_from_scratch (SCHEME_A);
1907 1930
1908 if (!pt && USE_ERROR_CHECKING) 1931 if (!pt && USE_ERROR_CHECKING)
1909 return NIL; 1932 return NIL;
1910 1933
1911 return mk_port (SCHEME_A_ pt); 1934 return mk_port (SCHEME_A_ pt);
1912} 1935}
1913 1936
1914static void 1937ecb_cold static void
1915port_close (SCHEME_P_ pointer p, int flag) 1938port_close (SCHEME_P_ pointer p, int flag)
1916{ 1939{
1917 port *pt = p->object.port; 1940 port *pt = port (p);
1918 1941
1919 pt->kind &= ~flag; 1942 pt->kind &= ~flag;
1920 1943
1921 if ((pt->kind & (port_input | port_output)) == 0) 1944 if ((pt->kind & (port_input | port_output)) == 0)
1922 { 1945 {
… …
1939 } 1962 }
1940} 1963}
1941#endif 1964#endif
1942 1965
1943/* get new character from input file */ 1966/* get new character from input file */
1944static int 1967ecb_cold static int
1945inchar (SCHEME_P) 1968inchar (SCHEME_P)
1946{ 1969{
1947 int c; 1970 int c;
1948 port *pt; 1971 port *pt = port (SCHEME_V->inport);
1949
1950 pt = SCHEME_V->inport->object.port;
1951 1972
1952 if (pt->kind & port_saw_EOF) 1973 if (pt->kind & port_saw_EOF)
1953 return EOF; 1974 return EOF;
1954 1975
1955 c = basic_inchar (pt); 1976 c = basic_inchar (pt);
… …
1965 } 1986 }
1966 1987
1967 return c; 1988 return c;
1968} 1989}
1969 1990
1970static int ungot = -1; 1991ecb_cold static int
1971
1972static int
1973basic_inchar (port *pt) 1992basic_inchar (port *pt)
1974{ 1993{
1975#if USE_PORTS
1976 if (pt->unget != -1) 1994 if (pt->unget != -1)
1977 { 1995 {
1978 int r = pt->unget; 1996 int r = pt->unget;
1979 pt->unget = -1; 1997 pt->unget = -1;
1980 return r; 1998 return r;
1981 } 1999 }
1982 2000
2001#if USE_PORTS
1983 if (pt->kind & port_file) 2002 if (pt->kind & port_file)
1984 { 2003 {
1985 char c; 2004 char c;
1986 2005
1987 if (!read (pt->rep.stdio.file, &c, 1)) 2006 if (!read (pt->rep.stdio.file, &c, 1))
… …
1995 return EOF; 2014 return EOF;
1996 else 2015 else
1997 return *pt->rep.string.curr++; 2016 return *pt->rep.string.curr++;
1998 } 2017 }
1999#else 2018#else
2000 if (ungot == -1)
2001 {
2002 char c; 2019 char c;
2003 if (!read (0, &c, 1)) 2020
2021 if (!read (pt->rep.stdio.file, &c, 1))
2004 return EOF; 2022 return EOF;
2005 2023
2006 ungot = c;
2007 }
2008
2009 {
2010 int r = ungot;
2011 ungot = -1;
2012 return r; 2024 return c;
2013 }
2014#endif 2025#endif
2015} 2026}
2016 2027
2017/* back character to input buffer */ 2028/* back character to input buffer */
2018static void 2029ecb_cold static void
2019backchar (SCHEME_P_ int c) 2030backchar (SCHEME_P_ int c)
2020{ 2031{
2021#if USE_PORTS 2032 port *pt = port (SCHEME_V->inport);
2022 port *pt;
2023 2033
2024 if (c == EOF) 2034 if (c == EOF)
2025 return; 2035 return;
2026 2036
2027 pt = SCHEME_V->inport->object.port;
2028 pt->unget = c; 2037 pt->unget = c;
2029#else
2030 if (c == EOF)
2031 return;
2032
2033 ungot = c;
2034#endif
2035} 2038}
2036 2039
2037#if USE_PORTS 2040#if USE_PORTS
2038static int 2041ecb_cold static int
2039realloc_port_string (SCHEME_P_ port *p) 2042realloc_port_string (SCHEME_P_ port *p)
2040{ 2043{
2041 char *start = p->rep.string.start; 2044 char *start = p->rep.string.start;
2042 size_t new_size = p->rep.string.past_the_end - start + 1 + BLOCK_SIZE; 2045 size_t new_size = p->rep.string.past_the_end - start + 1 + BLOCK_SIZE;
2043 char *str = malloc (new_size); 2046 char *str = malloc (new_size);
… …
2056 else 2059 else
2057 return 0; 2060 return 0;
2058} 2061}
2059#endif 2062#endif
2060 2063
2061INTERFACE void 2064ecb_cold static void
2062putstr (SCHEME_P_ const char *s) 2065putchars (SCHEME_P_ const char *s, int len)
2063{ 2066{
2067 port *pt = port (SCHEME_V->outport);
2068
2064#if USE_PORTS 2069#if USE_PORTS
2065 port *pt = SCHEME_V->outport->object.port;
2066
2067 if (pt->kind & port_file)
2068 write (pt->rep.stdio.file, s, strlen (s));
2069 else
2070 for (; *s; s++)
2071 if (pt->rep.string.curr != pt->rep.string.past_the_end)
2072 *pt->rep.string.curr++ = *s;
2073 else if (pt->kind & port_srfi6 && realloc_port_string (SCHEME_A_ pt))
2074 *pt->rep.string.curr++ = *s;
2075
2076#else
2077 xwrstr (s);
2078#endif
2079}
2080
2081static void
2082putchars (SCHEME_P_ const char *s, int len)
2083{
2084#if USE_PORTS
2085 port *pt = SCHEME_V->outport->object.port;
2086
2087 if (pt->kind & port_file) 2070 if (pt->kind & port_file)
2088 write (pt->rep.stdio.file, s, len); 2071 write (pt->rep.stdio.file, s, len);
2089 else 2072 else
2090 { 2073 {
2091 for (; len; len--) 2074 for (; len; len--)
… …
2096 *pt->rep.string.curr++ = *s++; 2079 *pt->rep.string.curr++ = *s++;
2097 } 2080 }
2098 } 2081 }
2099 2082
2100#else 2083#else
2101 write (1, s, len); 2084 write (1, s, len); // output not initialised
2102#endif 2085#endif
2086}
2087
2088INTERFACE void
2089putstr (SCHEME_P_ const char *s)
2090{
2091 putchars (SCHEME_A_ s, strlen (s));
2103} 2092}
2104 2093
2105INTERFACE void 2094INTERFACE void
2106putcharacter (SCHEME_P_ int c) 2095putcharacter (SCHEME_P_ int c)
2107{ 2096{
2108#if USE_PORTS
2109 port *pt = SCHEME_V->outport->object.port;
2110
2111 if (pt->kind & port_file)
2112 {
2113 char cc = c;
2114 write (pt->rep.stdio.file, &cc, 1);
2115 }
2116 else
2117 {
2118 if (pt->rep.string.curr != pt->rep.string.past_the_end)
2119 *pt->rep.string.curr++ = c;
2120 else if (pt->kind & port_srfi6 && realloc_port_string (SCHEME_A_ pt))
2121 *pt->rep.string.curr++ = c;
2122 }
2123
2124#else
2125 char cc = c; 2097 char cc = c;
2126 write (1, &c, 1); 2098
2127#endif 2099 putchars (SCHEME_A_ &cc, 1);
2128} 2100}
2129 2101
2130/* read characters up to delimiter, but cater to character constants */ 2102/* read characters up to delimiter, but cater to character constants */
2131static char * 2103ecb_cold static char *
2132readstr_upto (SCHEME_P_ int skip, const char *delim) 2104readstr_upto (SCHEME_P_ int skip, const char *delim)
2133{ 2105{
2134 char *p = SCHEME_V->strbuff + skip; 2106 char *p = SCHEME_V->strbuff + skip;
2135 2107
2136 while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A)))); 2108 while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A))));
… …
2145 2117
2146 return SCHEME_V->strbuff; 2118 return SCHEME_V->strbuff;
2147} 2119}
2148 2120
2149/* read string expression "xxx...xxx" */ 2121/* read string expression "xxx...xxx" */
2150static pointer 2122ecb_cold static pointer
2151readstrexp (SCHEME_P_ char delim) 2123readstrexp (SCHEME_P_ char delim)
2152{ 2124{
2153 char *p = SCHEME_V->strbuff; 2125 char *p = SCHEME_V->strbuff;
2154 int c; 2126 int c;
2155 int c1 = 0; 2127 int c1 = 0;
… …
2188 case '7': 2160 case '7':
2189 state = st_oct1; 2161 state = st_oct1;
2190 c1 = c - '0'; 2162 c1 = c - '0';
2191 break; 2163 break;
2192 2164
2165 case 'a': *p++ = '\a'; state = st_ok; break;
2166 case 'n': *p++ = '\n'; state = st_ok; break;
2167 case 'r': *p++ = '\r'; state = st_ok; break;
2168 case 't': *p++ = '\t'; state = st_ok; break;
2169
2170 // this overshoots the minimum requirements of r7rs
2171 case ' ':
2172 case '\t':
2173 case '\r':
2174 case '\n':
2175 skipspace (SCHEME_A);
2176 state = st_ok;
2177 break;
2178
2179 //TODO: x should end in ;, not two-digit hex
2193 case 'x': 2180 case 'x':
2194 case 'X': 2181 case 'X':
2195 state = st_x1; 2182 state = st_x1;
2196 c1 = 0; 2183 c1 = 0;
2197 break;
2198
2199 case 'n':
2200 *p++ = '\n';
2201 state = st_ok;
2202 break;
2203
2204 case 't':
2205 *p++ = '\t';
2206 state = st_ok;
2207 break;
2208
2209 case 'r':
2210 *p++ = '\r';
2211 state = st_ok;
2212 break; 2184 break;
2213 2185
2214 default: 2186 default:
2215 *p++ = c; 2187 *p++ = c;
2216 state = st_ok; 2188 state = st_ok;
… …
2268 } 2240 }
2269 } 2241 }
2270} 2242}
2271 2243
2272/* check c is in chars */ 2244/* check c is in chars */
2273ecb_inline int 2245ecb_cold int
2274is_one_of (const char *s, int c) 2246is_one_of (const char *s, int c)
2275{ 2247{
2276 return c == EOF || !!strchr (s, c); 2248 return c == EOF || !!strchr (s, c);
2277} 2249}
2278 2250
2279/* skip white characters */ 2251/* skip white characters */
2280ecb_inline int 2252ecb_cold int
2281skipspace (SCHEME_P) 2253skipspace (SCHEME_P)
2282{ 2254{
2283 int c, curr_line = 0; 2255 int c, curr_line = 0;
2284 2256
2285 do 2257 do
… …
2305 backchar (SCHEME_A_ c); 2277 backchar (SCHEME_A_ c);
2306 return 1; 2278 return 1;
2307} 2279}
2308 2280
2309/* get token */ 2281/* get token */
2310static int 2282ecb_cold static int
2311token (SCHEME_P) 2283token (SCHEME_P)
2312{ 2284{
2313 int c = skipspace (SCHEME_A); 2285 int c = skipspace (SCHEME_A);
2314 2286
2315 if (c == EOF) 2287 if (c == EOF)
… …
2413} 2385}
2414 2386
2415/* ========== Routines for Printing ========== */ 2387/* ========== Routines for Printing ========== */
2416#define ok_abbrev(x) (is_pair(x) && cdr(x) == NIL) 2388#define ok_abbrev(x) (is_pair(x) && cdr(x) == NIL)
2417 2389
2418static void 2390ecb_cold static void
2419printslashstring (SCHEME_P_ char *p, int len) 2391printslashstring (SCHEME_P_ char *p, int len)
2420{ 2392{
2421 int i; 2393 int i;
2422 unsigned char *s = (unsigned char *) p; 2394 unsigned char *s = (unsigned char *) p;
2423 2395
… …
2479 2451
2480 putcharacter (SCHEME_A_ '"'); 2452 putcharacter (SCHEME_A_ '"');
2481} 2453}
2482 2454
2483/* print atoms */ 2455/* print atoms */
2484static void 2456ecb_cold static void
2485printatom (SCHEME_P_ pointer l, int f) 2457printatom (SCHEME_P_ pointer l, int f)
2486{ 2458{
2487 char *p; 2459 char *p;
2488 int len; 2460 int len;
2489 2461
2490 atom2str (SCHEME_A_ l, f, &p, &len); 2462 atom2str (SCHEME_A_ l, f, &p, &len);
2491 putchars (SCHEME_A_ p, len); 2463 putchars (SCHEME_A_ p, len);
2492} 2464}
2493 2465
2494/* Uses internal buffer unless string pointer is already available */ 2466/* Uses internal buffer unless string pointer is already available */
2495static void 2467ecb_cold static void
2496atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen) 2468atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen)
2497{ 2469{
2498 char *p; 2470 char *p;
2499 2471
2500 if (l == NIL) 2472 if (l == NIL)
… …
2707 return car (d); 2679 return car (d);
2708 2680
2709 p = cons (car (d), cdr (d)); 2681 p = cons (car (d), cdr (d));
2710 q = p; 2682 q = p;
2711 2683
2712 while (cdr (cdr (p)) != NIL) 2684 while (cddr (p) != NIL)
2713 { 2685 {
2714 d = cons (car (p), cdr (p)); 2686 d = cons (car (p), cdr (p));
2715 2687
2716 if (cdr (cdr (p)) != NIL) 2688 if (cddr (p) != NIL)
2717 p = cdr (d); 2689 p = cdr (d);
2718 } 2690 }
2719 2691
2720 set_cdr (p, car (cdr (p))); 2692 set_cdr (p, cadr (p));
2721 return q; 2693 return q;
2722} 2694}
2723 2695
2724/* reverse list -- produce new list */ 2696/* reverse list -- produce new list */
2725static pointer 2697ecb_hot static pointer
2726reverse (SCHEME_P_ pointer a) 2698reverse (SCHEME_P_ pointer a)
2727{ 2699{
2728 /* a must be checked by gc */ 2700 /* a must be checked by gc */
2729 pointer p = NIL; 2701 pointer p = NIL;
2730 2702
… …
2733 2705
2734 return p; 2706 return p;
2735} 2707}
2736 2708
2737/* reverse list --- in-place */ 2709/* reverse list --- in-place */
2738static pointer 2710ecb_hot static pointer
2739reverse_in_place (SCHEME_P_ pointer term, pointer list) 2711reverse_in_place (SCHEME_P_ pointer term, pointer list)
2740{ 2712{
2741 pointer result = term; 2713 pointer result = term;
2742 pointer p = list; 2714 pointer p = list;
2743 2715
… …
2751 2723
2752 return result; 2724 return result;
2753} 2725}
2754 2726
2755/* append list -- produce new list (in reverse order) */ 2727/* append list -- produce new list (in reverse order) */
2756static pointer 2728ecb_hot static pointer
2757revappend (SCHEME_P_ pointer a, pointer b) 2729revappend (SCHEME_P_ pointer a, pointer b)
2758{ 2730{
2759 pointer result = a; 2731 pointer result = a;
2760 pointer p = b; 2732 pointer p = b;
2761 2733
… …
2770 2742
2771 return S_F; /* signal an error */ 2743 return S_F; /* signal an error */
2772} 2744}
2773 2745
2774/* equivalence of atoms */ 2746/* equivalence of atoms */
2775int 2747ecb_hot int
2776eqv (pointer a, pointer b) 2748eqv (pointer a, pointer b)
2777{ 2749{
2778 if (is_string (a)) 2750 if (is_string (a))
2779 { 2751 {
2780 if (is_string (b)) 2752 if (is_string (b))
… …
2874 } 2846 }
2875 else 2847 else
2876 set_car (env, immutable_cons (slot, car (env))); 2848 set_car (env, immutable_cons (slot, car (env)));
2877} 2849}
2878 2850
2879static pointer 2851ecb_hot static pointer
2880find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all) 2852find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all)
2881{ 2853{
2882 pointer x, y; 2854 pointer x, y;
2883 2855
2884 for (x = env; x != NIL; x = cdr (x)) 2856 for (x = env; x != NIL; x = cdr (x))
… …
2905 return NIL; 2877 return NIL;
2906} 2878}
2907 2879
2908#else /* USE_ALIST_ENV */ 2880#else /* USE_ALIST_ENV */
2909 2881
2910ecb_inline void 2882static void
2911new_frame_in_env (SCHEME_P_ pointer old_env) 2883new_frame_in_env (SCHEME_P_ pointer old_env)
2912{ 2884{
2913 SCHEME_V->envir = immutable_cons (NIL, old_env); 2885 SCHEME_V->envir = immutable_cons (NIL, old_env);
2914 setenvironment (SCHEME_V->envir); 2886 setenvironment (SCHEME_V->envir);
2915} 2887}
2916 2888
2917ecb_inline void 2889static void
2918new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) 2890new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
2919{ 2891{
2920 set_car (env, immutable_cons (immutable_cons (variable, value), car (env))); 2892 set_car (env, immutable_cons (immutable_cons (variable, value), car (env)));
2921} 2893}
2922 2894
2923static pointer 2895ecb_hot static pointer
2924find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all) 2896find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all)
2925{ 2897{
2926 pointer x, y; 2898 pointer x, y;
2927 2899
2928 for (x = env; x != NIL; x = cdr (x)) 2900 for (x = env; x != NIL; x = cdr (x))
… …
2942 return NIL; 2914 return NIL;
2943} 2915}
2944 2916
2945#endif /* USE_ALIST_ENV else */ 2917#endif /* USE_ALIST_ENV else */
2946 2918
2947ecb_inline void 2919static void
2948new_slot_in_env (SCHEME_P_ pointer variable, pointer value) 2920new_slot_in_env (SCHEME_P_ pointer variable, pointer value)
2949{ 2921{
2950 assert (is_symbol (variable));//TODO: bug in current-ws/OP_LET2 2922 assert (is_symbol (variable));//TODO: bug in current-ws/OP_LET2
2951 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value); 2923 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value);
2952} 2924}
2953 2925
2954ecb_inline void 2926static void
2955set_slot_in_env (SCHEME_P_ pointer slot, pointer value) 2927set_slot_in_env (SCHEME_P_ pointer slot, pointer value)
2956{ 2928{
2957 set_cdr (slot, value); 2929 set_cdr (slot, value);
2958} 2930}
2959 2931
2960ecb_inline pointer 2932static pointer
2961slot_value_in_env (pointer slot) 2933slot_value_in_env (pointer slot)
2962{ 2934{
2963 return cdr (slot); 2935 return cdr (slot);
2964} 2936}
2965 2937
2966/* ========== Evaluation Cycle ========== */ 2938/* ========== Evaluation Cycle ========== */
2967 2939
2968static int 2940ecb_cold static int
2969xError_1 (SCHEME_P_ const char *s, pointer a) 2941xError_1 (SCHEME_P_ const char *s, pointer a)
2970{ 2942{
2971#if USE_ERROR_HOOK
2972 pointer x;
2973 pointer hdl = SCHEME_V->ERROR_HOOK;
2974#endif
2975
2976#if USE_PRINTF 2943#if USE_PRINTF
2977#if SHOW_ERROR_LINE 2944#if SHOW_ERROR_LINE
2978 char sbuf[STRBUFFSIZE]; 2945 char sbuf[STRBUFFSIZE];
2979 2946
2980 /* make sure error is not in REPL */ 2947 /* make sure error is not in REPL */
… …
2995 } 2962 }
2996#endif 2963#endif
2997#endif 2964#endif
2998 2965
2999#if USE_ERROR_HOOK 2966#if USE_ERROR_HOOK
3000 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, hdl, 1); 2967 pointer x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->ERROR_HOOK, 1);
3001 2968
3002 if (x != NIL) 2969 if (x != NIL)
3003 { 2970 {
3004 pointer code = a 2971 pointer code = a
3005 ? cons (cons (SCHEME_V->QUOTE, cons (a, NIL)), NIL) 2972 ? cons (cons (SCHEME_V->QUOTE, cons (a, NIL)), NIL)
… …
3049 pointer code; 3016 pointer code;
3050}; 3017};
3051 3018
3052# define STACK_GROWTH 3 3019# define STACK_GROWTH 3
3053 3020
3054static void 3021ecb_hot static void
3055s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code) 3022s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code)
3056{ 3023{
3057 int nframes = (uintptr_t)SCHEME_V->dump; 3024 int nframes = (uintptr_t)SCHEME_V->dump;
3058 struct dump_stack_frame *next_frame; 3025 struct dump_stack_frame *next_frame;
3059 3026
3060 /* enough room for the next frame? */ 3027 /* enough room for the next frame? */
3061 if (nframes >= SCHEME_V->dump_size) 3028 if (ecb_expect_false (nframes >= SCHEME_V->dump_size))
3062 { 3029 {
3063 SCHEME_V->dump_size += STACK_GROWTH; 3030 SCHEME_V->dump_size += STACK_GROWTH;
3064 SCHEME_V->dump_base = realloc (SCHEME_V->dump_base, sizeof (struct dump_stack_frame) * SCHEME_V->dump_size); 3031 SCHEME_V->dump_base = realloc (SCHEME_V->dump_base, sizeof (struct dump_stack_frame) * SCHEME_V->dump_size);
3065 } 3032 }
3066 3033
… …
3072 next_frame->code = code; 3039 next_frame->code = code;
3073 3040
3074 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1); 3041 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1);
3075} 3042}
3076 3043
3077static int 3044static ecb_hot int
3078xs_return (SCHEME_P_ pointer a) 3045xs_return (SCHEME_P_ pointer a)
3079{ 3046{
3080 int nframes = (uintptr_t)SCHEME_V->dump; 3047 int nframes = (uintptr_t)SCHEME_V->dump;
3081 struct dump_stack_frame *frame; 3048 struct dump_stack_frame *frame;
3082 3049
… …
3093 SCHEME_V->dump = (pointer)(uintptr_t)nframes; 3060 SCHEME_V->dump = (pointer)(uintptr_t)nframes;
3094 3061
3095 return 0; 3062 return 0;
3096} 3063}
3097 3064
3098ecb_inline void 3065ecb_cold void
3099dump_stack_reset (SCHEME_P) 3066dump_stack_reset (SCHEME_P)
3100{ 3067{
3101 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */ 3068 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */
3102 SCHEME_V->dump = (pointer)+0; 3069 SCHEME_V->dump = (pointer)+0;
3103} 3070}
3104 3071
3105ecb_inline void 3072ecb_cold void
3106dump_stack_initialize (SCHEME_P) 3073dump_stack_initialize (SCHEME_P)
3107{ 3074{
3108 SCHEME_V->dump_size = 0; 3075 SCHEME_V->dump_size = 0;
3109 SCHEME_V->dump_base = 0; 3076 SCHEME_V->dump_base = 0;
3110 dump_stack_reset (SCHEME_A); 3077 dump_stack_reset (SCHEME_A);
3111} 3078}
3112 3079
3113static void 3080ecb_cold static void
3114dump_stack_free (SCHEME_P) 3081dump_stack_free (SCHEME_P)
3115{ 3082{
3116 free (SCHEME_V->dump_base); 3083 free (SCHEME_V->dump_base);
3117 SCHEME_V->dump_base = 0; 3084 SCHEME_V->dump_base = 0;
3118 SCHEME_V->dump = (pointer)0; 3085 SCHEME_V->dump = (pointer)0;
3119 SCHEME_V->dump_size = 0; 3086 SCHEME_V->dump_size = 0;
3120} 3087}
3121 3088
3122static void 3089ecb_cold static void
3123dump_stack_mark (SCHEME_P) 3090dump_stack_mark (SCHEME_P)
3124{ 3091{
3125 int nframes = (uintptr_t)SCHEME_V->dump; 3092 int nframes = (uintptr_t)SCHEME_V->dump;
3126 int i; 3093 int i;
3127 3094
… …
3133 mark (frame->envir); 3100 mark (frame->envir);
3134 mark (frame->code); 3101 mark (frame->code);
3135 } 3102 }
3136} 3103}
3137 3104
3138static pointer 3105ecb_cold static pointer
3139ss_get_cont (SCHEME_P) 3106ss_get_cont (SCHEME_P)
3140{ 3107{
3141 int nframes = (uintptr_t)SCHEME_V->dump; 3108 int nframes = (uintptr_t)SCHEME_V->dump;
3142 int i; 3109 int i;
3143 3110
… …
3155 } 3122 }
3156 3123
3157 return cont; 3124 return cont;
3158} 3125}
3159 3126
3160static void 3127ecb_cold static void
3161ss_set_cont (SCHEME_P_ pointer cont) 3128ss_set_cont (SCHEME_P_ pointer cont)
3162{ 3129{
3163 int i = 0; 3130 int i = 0;
3164 struct dump_stack_frame *frame = SCHEME_V->dump_base; 3131 struct dump_stack_frame *frame = SCHEME_V->dump_base;
3165 3132
… …
3177 SCHEME_V->dump = (pointer)(uintptr_t)i; 3144 SCHEME_V->dump = (pointer)(uintptr_t)i;
3178} 3145}
3179 3146
3180#else 3147#else
3181 3148
3182ecb_inline void 3149ecb_cold void
3183dump_stack_reset (SCHEME_P) 3150dump_stack_reset (SCHEME_P)
3184{ 3151{
3185 SCHEME_V->dump = NIL; 3152 SCHEME_V->dump = NIL;
3186} 3153}
3187 3154
3188ecb_inline void 3155ecb_cold void
3189dump_stack_initialize (SCHEME_P) 3156dump_stack_initialize (SCHEME_P)
3190{ 3157{
3191 dump_stack_reset (SCHEME_A); 3158 dump_stack_reset (SCHEME_A);
3192} 3159}
3193 3160
3194static void 3161ecb_cold static void
3195dump_stack_free (SCHEME_P) 3162dump_stack_free (SCHEME_P)
3196{ 3163{
3197 SCHEME_V->dump = NIL; 3164 SCHEME_V->dump = NIL;
3198} 3165}
3199 3166
3200static int 3167ecb_hot static int
3201xs_return (SCHEME_P_ pointer a) 3168xs_return (SCHEME_P_ pointer a)
3202{ 3169{
3203 pointer dump = SCHEME_V->dump; 3170 pointer dump = SCHEME_V->dump;
3204 3171
3205 SCHEME_V->value = a; 3172 SCHEME_V->value = a;
… …
3215 SCHEME_V->dump = dump; 3182 SCHEME_V->dump = dump;
3216 3183
3217 return 0; 3184 return 0;
3218} 3185}
3219 3186
3220static void 3187ecb_hot static void
3221s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code) 3188s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code)
3222{ 3189{
3223 SCHEME_V->dump = cons (mk_integer (SCHEME_A_ op), 3190 SCHEME_V->dump = cons (mk_integer (SCHEME_A_ op),
3224 cons (args, 3191 cons (args,
3225 cons (SCHEME_V->envir, 3192 cons (SCHEME_V->envir,
3226 cons (code, 3193 cons (code,
3227 SCHEME_V->dump)))); 3194 SCHEME_V->dump))));
3228} 3195}
3229 3196
3230static void 3197ecb_cold static void
3231dump_stack_mark (SCHEME_P) 3198dump_stack_mark (SCHEME_P)
3232{ 3199{
3233 mark (SCHEME_V->dump); 3200 mark (SCHEME_V->dump);
3234} 3201}
3235 3202
3236static pointer 3203ecb_cold static pointer
3237ss_get_cont (SCHEME_P) 3204ss_get_cont (SCHEME_P)
3238{ 3205{
3239 return SCHEME_V->dump; 3206 return SCHEME_V->dump;
3240} 3207}
3241 3208
3242static void 3209ecb_cold static void
3243ss_set_cont (SCHEME_P_ pointer cont) 3210ss_set_cont (SCHEME_P_ pointer cont)
3244{ 3211{
3245 SCHEME_V->dump = cont; 3212 SCHEME_V->dump = cont;
3246} 3213}
3247 3214
3248#endif 3215#endif
3249 3216
3250#define s_retbool(tf) s_return ((tf) ? S_T : S_F) 3217#define s_retbool(tf) s_return ((tf) ? S_T : S_F)
3251 3218
3252#if EXPERIMENT 3219#if EXPERIMENT
3220
3253static int 3221static int
3254debug (SCHEME_P_ int indent, pointer x) 3222dtree (SCHEME_P_ int indent, pointer x)
3255{ 3223{
3256 int c; 3224 int c;
3257 3225
3258 if (is_syntax (x)) 3226 if (is_syntax (x))
3259 { 3227 {
… …
3277 printf ("%*sS<%s>\n", indent, "", symname (x)); 3245 printf ("%*sS<%s>\n", indent, "", symname (x));
3278 return 24+8; 3246 return 24+8;
3279 3247
3280 case T_CLOSURE: 3248 case T_CLOSURE:
3281 printf ("%*sS<%s>\n", indent, "", "closure"); 3249 printf ("%*sS<%s>\n", indent, "", "closure");
3282 debug (SCHEME_A_ indent + 3, cdr(x)); 3250 dtree (SCHEME_A_ indent + 3, cdr(x));
3283 return 32 + debug (SCHEME_A_ indent + 3, car (x)); 3251 return 32 + dtree (SCHEME_A_ indent + 3, car (x));
3284 3252
3285 case T_PAIR: 3253 case T_PAIR:
3286 printf ("%*spair %p %p\n", indent, "", car(x),cdr(x)); 3254 printf ("%*spair %p %p\n", indent, "", car(x),cdr(x));
3287 c = debug (SCHEME_A_ indent + 3, car (x)); 3255 c = dtree (SCHEME_A_ indent + 3, car (x));
3288 c += debug (SCHEME_A_ indent + 3, cdr (x)); 3256 c += dtree (SCHEME_A_ indent + 3, cdr (x));
3289 return c + 1; 3257 return c + 1;
3290 3258
3291 case T_PORT: 3259 case T_PORT:
3292 printf ("%*sS<%s>\n", indent, "", "port"); 3260 printf ("%*sS<%s>\n", indent, "", "port");
3293 return 24+8; 3261 return 24+8;
… …
3296 printf ("%*sS<%s>\n", indent, "", "vector"); 3264 printf ("%*sS<%s>\n", indent, "", "vector");
3297 return 24+8; 3265 return 24+8;
3298 3266
3299 case T_ENVIRONMENT: 3267 case T_ENVIRONMENT:
3300 printf ("%*sS<%s>\n", indent, "", "environment"); 3268 printf ("%*sS<%s>\n", indent, "", "environment");
3301 return 0 + debug (SCHEME_A_ indent + 3, car (x)); 3269 return 0 + dtree (SCHEME_A_ indent + 3, car (x));
3302 3270
3303 default: 3271 default:
3304 printf ("unhandled type %d\n", type (x)); 3272 printf ("unhandled type %d\n", type (x));
3305 break; 3273 break;
3306 } 3274 }
3307} 3275}
3308#endif
3309 3276
3277#define DUMP(t) do { printf ("DUMP %s:%d\n", __FILE__, __LINE__); dtree (SCHEME_A_ 0, (t)); } while (0)
3278
3279typedef void *stream[1];
3280
3281#define stream_init() { 0 }
3282#define stream_data(s) ((char *)(s)[0] + sizeof (uint32_t) * 2)
3283#define stream_size(s) (((uint32_t *)(s)[0])[0] - sizeof (uint32_t) * 2)
3284#define stream_free(s) free (s[0])
3285
3286ecb_cold static void
3287stream_put (stream s, uint8_t byte)
3288{
3289 uint32_t *sp = *s;
3290 uint32_t size = sizeof (uint32_t) * 2;
3291 uint32_t offs = size;
3292
3293 if (ecb_expect_true (sp))
3294 {
3295 offs = sp[0];
3296 size = sp[1];
3297 }
3298
3299 if (ecb_expect_false (offs == size))
3300 {
3301 size *= 2;
3302 sp = realloc (sp, size);
3303 *s = sp;
3304 sp[1] = size;
3305
3306 }
3307
3308 ((uint8_t *)sp)[offs++] = byte;
3309 sp[0] = offs;
3310}
3311
3312ecb_cold static void
3313stream_put_v (stream s, uint32_t v)
3314{
3315 while (v > 0x7f)
3316 {
3317 stream_put (s, v | 0x80);
3318 v >>= 7;
3319 }
3320
3321 stream_put (s, v);
3322}
3323
3324ecb_cold static void
3325stream_put_tv (stream s, int bop, uint32_t v)
3326{
3327 printf ("put tv %d %d\n", bop, v);//D
3328 stream_put (s, bop);
3329 stream_put_v (s, v);
3330}
3331
3332ecb_cold static void
3333stream_put_stream (stream s, stream o)
3334{
3335 uint32_t i;
3336
3337 for (i = 0; i < stream_size (o); ++i)
3338 stream_put (s, stream_data (o)[i]);
3339
3340 stream_free (o);
3341}
3342
3343// calculates a (preferably small) integer that makes it possible to find
3344// the symbol again. if pointers were offsets into a memory area... until
3345// then, we return segment number in the low bits, and offset in the high
3346// bits.
3347// also, this function must never return 0.
3348ecb_cold static uint32_t
3349symbol_id (SCHEME_P_ pointer sym)
3350{
3351 struct cell *p = CELL (sym);
3352 int i;
3353
3354 for (i = SCHEME_V->last_cell_seg; i >= 0; --i)
3355 if (SCHEME_V->cell_seg[i] <= p && p < SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize[i])
3356 return i | ((p - SCHEME_V->cell_seg[i]) << CELL_NSEGMENT_LOG);
3357
3358 abort ();
3359}
3360
3361ecb_cold static uint32_t
3362cell_id (SCHEME_P_ pointer p)
3363{
3364 return symbol_id (SCHEME_A_ p);
3365}
3366
3367enum byteop
3368{
3369 BOP_NIL,
3370 BOP_SYNTAX,
3371 BOP_INTEGER,
3372 BOP_SYMBOL,
3373 BOP_LIST_BEG,
3374 BOP_LIST_END,
3375 BOP_BIFT, // branch if true
3376 BOP_BIFF, // branch if false
3377 BOP_BIFNE, // branch if not eqv?
3378 BOP_BRA, // "short" branch
3379 BOP_JMP, // "long" jump
3380 BOP_DATUM,
3381 BOP_LET,
3382 BOP_LETAST,
3383 BOP_LETREC,
3384 BOP_DEFINE,
3385 BOP_MACRO,
3386 BOP_SET,
3387 BOP_BEGIN,
3388 BOP_LAMBDA,
3389};
3390
3391ecb_cold static void compile_expr (SCHEME_P_ stream s, pointer x);
3392
3393ecb_cold static void
3394compile_list (SCHEME_P_ stream s, pointer x)
3395{
3396 for (; x != NIL; x = cdr (x))
3397 compile_expr (SCHEME_A_ s, car (x));
3398}
3399
3310static int 3400static void
3401compile_if (SCHEME_P_ stream s, pointer cond, pointer ift, pointer iff)
3402{
3403 //TODO: borked
3404 stream sift = stream_init (); compile_expr (SCHEME_A_ sift, ift);
3405
3406 stream_put (s, BOP_BIFF);
3407 compile_expr (SCHEME_A_ s, cond);
3408 stream_put_v (s, stream_size (sift));
3409 stream_put_stream (s, sift);
3410
3411 if (iff != NIL)
3412 {
3413 stream siff = stream_init (); compile_expr (SCHEME_A_ siff, iff);
3414 stream_put_tv (s, BOP_BRA, stream_size (siff));
3415 stream_put_stream (s, siff);
3416 }
3417}
3418
3419typedef uint32_t stream_fixup;
3420
3421static stream_fixup
3422stream_put_fixup (stream s)
3423{
3424 stream_put (s, 0);
3425 stream_put (s, 0);
3426
3427 return stream_size (s);
3428}
3429
3430static void
3431stream_fix_fixup (stream s, stream_fixup fixup, uint32_t target)
3432{
3433 target -= fixup;
3434 assert (target < (1 << 14));
3435 stream_data (s)[fixup - 2] = target | 0x80;
3436 stream_data (s)[fixup - 1] = target >> 7;
3437}
3438
3439static void
3440compile_and_or (SCHEME_P_ stream s, int and, pointer x)
3441{
3442 if (cdr (x) == NIL)
3443 compile_expr (SCHEME_A_ s, car (x));
3444 else
3445 {
3446 stream_put (s, and ? BOP_BIFF : BOP_BIFT);
3447 compile_expr (SCHEME_A_ s, car (x));
3448 stream_fixup end = stream_put_fixup (s);
3449
3450 compile_and_or (SCHEME_A_ s, and, cdr (x));
3451 stream_fix_fixup (s, end, stream_size (s));
3452 }
3453}
3454
3455ecb_cold static void
3456compile_expr (SCHEME_P_ stream s, pointer x)
3457{
3458 if (x == NIL)
3459 {
3460 stream_put (s, BOP_NIL);
3461 return;
3462 }
3463
3464 if (is_pair (x))
3465 {
3466 pointer head = car (x);
3467
3468 if (is_syntax (head))
3469 {
3470 x = cdr (x);
3471
3472 switch (syntaxnum (head))
3473 {
3474 case OP_IF0: /* if */
3475 compile_if (SCHEME_A_ s, car (x), cadr (x), caddr (x));
3476 break;
3477
3478 case OP_OR0: /* or */
3479 compile_and_or (SCHEME_A_ s, 0, x);
3480 break;
3481
3482 case OP_AND0: /* and */
3483 compile_and_or (SCHEME_A_ s, 1, x);
3484 break;
3485
3486 case OP_CASE0: /* case */
3487 abort ();
3488 break;
3489
3490 case OP_COND0: /* cond */
3491 abort ();
3492 break;
3493
3494 case OP_LET0: /* let */
3495 case OP_LET0AST: /* let* */
3496 case OP_LET0REC: /* letrec */
3497 switch (syntaxnum (head))
3498 {
3499 case OP_LET0: stream_put (s, BOP_LET ); break;
3500 case OP_LET0AST: stream_put (s, BOP_LETAST); break;
3501 case OP_LET0REC: stream_put (s, BOP_LETREC); break;
3502 }
3503
3504 {
3505 pointer bindings = car (x);
3506 pointer body = cadr (x);
3507
3508 for (x = bindings; x != NIL; x = cdr (x))
3509 {
3510 pointer init = NIL;
3511 pointer var = car (x);
3512
3513 if (is_pair (var))
3514 {
3515 init = cdr (var);
3516 var = car (var);
3517 }
3518
3519 stream_put_v (s, symbol_id (SCHEME_A_ var));
3520 compile_expr (SCHEME_A_ s, init);
3521 }
3522
3523 stream_put_v (s, 0);
3524 compile_expr (SCHEME_A_ s, body);
3525 }
3526 break;
3527
3528 case OP_DEF0: /* define */
3529 case OP_MACRO0: /* macro */
3530 stream_put (s, syntaxnum (head) == OP_DEF0 ? BOP_DEFINE : BOP_MACRO);
3531 stream_put_v (s, cell_id (SCHEME_A_ car (x)));
3532 compile_expr (SCHEME_A_ s, cadr (x));
3533 break;
3534
3535 case OP_SET0: /* set! */
3536 stream_put (s, BOP_SET);
3537 stream_put_v (s, symbol_id (SCHEME_A_ car (x)));
3538 compile_expr (SCHEME_A_ s, cadr (x));
3539 break;
3540
3541 case OP_BEGIN: /* begin */
3542 stream_put (s, BOP_BEGIN);
3543 compile_list (SCHEME_A_ s, x);
3544 return;
3545
3546 case OP_DELAY: /* delay */
3547 abort ();
3548 break;
3549
3550 case OP_QUOTE: /* quote */
3551 stream_put_tv (s, BOP_DATUM, cell_id (SCHEME_A_ x));
3552 break;
3553
3554 case OP_LAMBDA: /* lambda */
3555 {
3556 pointer formals = car (x);
3557 pointer body = cadr (x);
3558
3559 stream_put (s, BOP_LAMBDA);
3560
3561 for (; is_pair (formals); formals = cdr (formals))
3562 stream_put_v (s, symbol_id (SCHEME_A_ car (formals)));
3563
3564 stream_put_v (s, 0);
3565 stream_put_v (s, formals == NIL ? 0 : symbol_id (SCHEME_A_ formals));
3566
3567 compile_expr (SCHEME_A_ s, body);
3568 }
3569 break;
3570
3571 case OP_C0STREAM:/* cons-stream */
3572 abort ();
3573 break;
3574 }
3575
3576 return;
3577 }
3578
3579 pointer m = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, head, 1);
3580
3581 if (m != NIL)
3582 {
3583 m = slot_value_in_env (m);
3584
3585 if (is_macro (m))
3586 {
3587 s_save (SCHEME_A_ OP_DEBUG2, SCHEME_V->args, SCHEME_V->code);
3588 SCHEME_V->code = m;
3589 SCHEME_V->args = cons (x, NIL);
3590 Eval_Cycle (SCHEME_A_ OP_APPLY);
3591 x = SCHEME_V->value;
3592 compile_expr (SCHEME_A_ s, SCHEME_V->value);
3593 return;
3594 }
3595 }
3596 }
3597
3598 switch (type (x))
3599 {
3600 case T_INTEGER:
3601 {
3602 IVALUE iv = ivalue_unchecked (x);
3603 iv = iv < 0 ? ((uint32_t)-iv << 1) | 1 : (uint32_t)iv << 1;
3604 stream_put_tv (s, BOP_INTEGER, iv);
3605 }
3606 return;
3607
3608 case T_SYMBOL:
3609 stream_put_tv (s, BOP_SYMBOL, symbol_id (SCHEME_A_ x));
3610 return;
3611
3612 case T_PAIR:
3613 stream_put (s, BOP_LIST_BEG);
3614
3615 for (; x != NIL; x = cdr (x))
3616 compile_expr (SCHEME_A_ s, car (x));
3617
3618 stream_put (s, BOP_LIST_END);
3619 return;
3620
3621 default:
3622 stream_put_tv (s, BOP_DATUM, cell_id (SCHEME_A_ x));
3623 break;
3624 }
3625}
3626
3627ecb_cold static int
3628compile_closure (SCHEME_P_ pointer p)
3629{
3630 stream s = stream_init ();
3631
3632 compile_list (SCHEME_A_ s, cdar (p));
3633
3634 FILE *xxd = popen ("xxd", "we");
3635 fwrite (stream_data (s), 1, stream_size (s), xxd);
3636 fclose (xxd);
3637
3638 return stream_size (s);
3639}
3640
3641#endif
3642
3643/* syntax, eval, core, ... */
3644ecb_hot static int
3311opexe_0 (SCHEME_P_ enum scheme_opcodes op) 3645opexe_0 (SCHEME_P_ enum scheme_opcodes op)
3312{ 3646{
3313 pointer args = SCHEME_V->args; 3647 pointer args = SCHEME_V->args;
3314 pointer x, y; 3648 pointer x, y;
3315 3649
3316 switch (op) 3650 switch (op)
3317 { 3651 {
3318#if EXPERIMENT //D 3652#if EXPERIMENT //D
3319 case OP_DEBUG: 3653 case OP_DEBUG:
3320 printf ("len = %d\n", debug (SCHEME_A_ 0, args) / 8); 3654 {
3655 uint32_t len = compile_closure (SCHEME_A_ car (args));
3656 printf ("len = %d\n", len);
3321 printf ("\n"); 3657 printf ("\n");
3322 s_return (S_T); 3658 s_return (S_T);
3659 }
3660
3661 case OP_DEBUG2:
3662 return -1;
3323#endif 3663#endif
3664
3324 case OP_LOAD: /* load */ 3665 case OP_LOAD: /* load */
3325 if (file_interactive (SCHEME_A)) 3666 if (file_interactive (SCHEME_A))
3326 { 3667 {
3327 xwrstr ("Loading "); xwrstr (strvalue (car (args))); xwrstr ("\n"); 3668 putstr (SCHEME_A_ "Loading ");
3328 //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args))); 3669 putstr (SCHEME_A_ strvalue (car (args)));
3670 putcharacter (SCHEME_A_ '\n');
3329 } 3671 }
3330 3672
3331 if (!file_push (SCHEME_A_ strvalue (car (args)))) 3673 if (!file_push (SCHEME_A_ strvalue (car (args))))
3332 Error_1 ("unable to open", car (args)); 3674 Error_1 ("unable to open", car (args));
3333 else 3675
3334 {
3335 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i); 3676 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i);
3336 s_goto (OP_T0LVL); 3677 s_goto (OP_T0LVL);
3337 }
3338 3678
3339 case OP_T0LVL: /* top level */ 3679 case OP_T0LVL: /* top level */
3340 3680
3341 /* If we reached the end of file, this loop is done. */ 3681 /* If we reached the end of file, this loop is done. */
3342 if (SCHEME_V->loadport->object.port->kind & port_saw_EOF) 3682 if (port (SCHEME_V->loadport)->kind & port_saw_EOF)
3343 { 3683 {
3344 if (SCHEME_V->file_i == 0) 3684 if (SCHEME_V->file_i == 0)
3345 { 3685 {
3346 SCHEME_V->args = NIL; 3686 SCHEME_V->args = NIL;
3347 s_goto (OP_QUIT); 3687 s_goto (OP_QUIT);
… …
3358 /* If interactive, be nice to user. */ 3698 /* If interactive, be nice to user. */
3359 if (file_interactive (SCHEME_A)) 3699 if (file_interactive (SCHEME_A))
3360 { 3700 {
3361 SCHEME_V->envir = SCHEME_V->global_env; 3701 SCHEME_V->envir = SCHEME_V->global_env;
3362 dump_stack_reset (SCHEME_A); 3702 dump_stack_reset (SCHEME_A);
3363 putstr (SCHEME_A_ "\n"); 3703 putcharacter (SCHEME_A_ '\n');
3704#if EXPERIMENT
3705 system ("ps v $PPID");
3706#endif
3364 putstr (SCHEME_A_ prompt); 3707 putstr (SCHEME_A_ prompt);
3365 } 3708 }
3366 3709
3367 /* Set up another iteration of REPL */ 3710 /* Set up another iteration of REPL */
3368 SCHEME_V->nesting = 0; 3711 SCHEME_V->nesting = 0;
… …
3403 { 3746 {
3404 SCHEME_V->print_flag = 1; 3747 SCHEME_V->print_flag = 1;
3405 SCHEME_V->args = SCHEME_V->value; 3748 SCHEME_V->args = SCHEME_V->value;
3406 s_goto (OP_P0LIST); 3749 s_goto (OP_P0LIST);
3407 } 3750 }
3408 else 3751
3409 s_return (SCHEME_V->value); 3752 s_return (SCHEME_V->value);
3410 3753
3411 case OP_EVAL: /* main part of evaluation */ 3754 case OP_EVAL: /* main part of evaluation */
3412#if USE_TRACING 3755#if USE_TRACING
3413 if (SCHEME_V->tracing) 3756 if (SCHEME_V->tracing)
3414 { 3757 {
… …
3425#endif 3768#endif
3426 if (is_symbol (SCHEME_V->code)) /* symbol */ 3769 if (is_symbol (SCHEME_V->code)) /* symbol */
3427 { 3770 {
3428 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 1); 3771 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 1);
3429 3772
3430 if (x != NIL) 3773 if (x == NIL)
3431 s_return (slot_value_in_env (x));
3432 else
3433 Error_1 ("eval: unbound variable:", SCHEME_V->code); 3774 Error_1 ("eval: unbound variable:", SCHEME_V->code);
3775
3776 s_return (slot_value_in_env (x));
3434 } 3777 }
3435 else if (is_pair (SCHEME_V->code)) 3778 else if (is_pair (SCHEME_V->code))
3436 { 3779 {
3437 x = car (SCHEME_V->code); 3780 x = car (SCHEME_V->code);
3438 3781
… …
3447 /* If no macros => s_save(SCHEME_A_ OP_E1ARGS, NIL, cdr(SCHEME_V->code)); */ 3790 /* If no macros => s_save(SCHEME_A_ OP_E1ARGS, NIL, cdr(SCHEME_V->code)); */
3448 SCHEME_V->code = x; 3791 SCHEME_V->code = x;
3449 s_goto (OP_EVAL); 3792 s_goto (OP_EVAL);
3450 } 3793 }
3451 } 3794 }
3452 else 3795
3453 s_return (SCHEME_V->code); 3796 s_return (SCHEME_V->code);
3454 3797
3455 case OP_E0ARGS: /* eval arguments */ 3798 case OP_E0ARGS: /* eval arguments */
3456 if (ecb_expect_false (is_macro (SCHEME_V->value))) /* macro expansion */ 3799 if (ecb_expect_false (is_macro (SCHEME_V->value))) /* macro expansion */
3457 { 3800 {
3458 s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL); 3801 s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL);
3459 SCHEME_V->args = cons (SCHEME_V->code, NIL); 3802 SCHEME_V->args = cons (SCHEME_V->code, NIL);
3460 SCHEME_V->code = SCHEME_V->value; 3803 SCHEME_V->code = SCHEME_V->value;
3461 s_goto (OP_APPLY); 3804 s_goto (OP_APPLY);
3462 } 3805 }
3463 else 3806
3464 {
3465 SCHEME_V->code = cdr (SCHEME_V->code); 3807 SCHEME_V->code = cdr (SCHEME_V->code);
3466 s_goto (OP_E1ARGS); 3808 s_goto (OP_E1ARGS);
3467 }
3468 3809
3469 case OP_E1ARGS: /* eval arguments */ 3810 case OP_E1ARGS: /* eval arguments */
3470 args = cons (SCHEME_V->value, args); 3811 args = cons (SCHEME_V->value, args);
3471 3812
3472 if (is_pair (SCHEME_V->code)) /* continue */ 3813 if (is_pair (SCHEME_V->code)) /* continue */
… …
3483 SCHEME_V->args = cdr (args); 3824 SCHEME_V->args = cdr (args);
3484 s_goto (OP_APPLY); 3825 s_goto (OP_APPLY);
3485 } 3826 }
3486 3827
3487#if USE_TRACING 3828#if USE_TRACING
3488
3489 case OP_TRACING: 3829 case OP_TRACING:
3490 { 3830 {
3491 int tr = SCHEME_V->tracing; 3831 int tr = SCHEME_V->tracing;
3492 3832
3493 SCHEME_V->tracing = ivalue_unchecked (car (args)); 3833 SCHEME_V->tracing = ivalue_unchecked (car (args));
3494 s_return (mk_integer (SCHEME_A_ tr)); 3834 s_return (mk_integer (SCHEME_A_ tr));
3495 } 3835 }
3496
3497#endif 3836#endif
3498 3837
3499 case OP_APPLY: /* apply 'code' to 'args' */ 3838 case OP_APPLY: /* apply 'code' to 'args' */
3500#if USE_TRACING 3839#if USE_TRACING
3501 if (SCHEME_V->tracing) 3840 if (SCHEME_V->tracing)
… …
3515 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */ 3854 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */
3516 else if (is_foreign (SCHEME_V->code)) 3855 else if (is_foreign (SCHEME_V->code))
3517 { 3856 {
3518 /* Keep nested calls from GC'ing the arglist */ 3857 /* Keep nested calls from GC'ing the arglist */
3519 push_recent_alloc (SCHEME_A_ args, NIL); 3858 push_recent_alloc (SCHEME_A_ args, NIL);
3520 x = SCHEME_V->code->object.ff (SCHEME_A_ args); 3859 x = CELL(SCHEME_V->code)->object.ff (SCHEME_A_ args);
3521 3860
3522 s_return (x); 3861 s_return (x);
3523 } 3862 }
3524 else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */ 3863 else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */
3525 { 3864 {
… …
3555 else if (is_continuation (SCHEME_V->code)) /* CONTINUATION */ 3894 else if (is_continuation (SCHEME_V->code)) /* CONTINUATION */
3556 { 3895 {
3557 ss_set_cont (SCHEME_A_ cont_dump (SCHEME_V->code)); 3896 ss_set_cont (SCHEME_A_ cont_dump (SCHEME_V->code));
3558 s_return (args != NIL ? car (args) : NIL); 3897 s_return (args != NIL ? car (args) : NIL);
3559 } 3898 }
3560 else 3899
3561 Error_0 ("illegal function"); 3900 Error_0 ("illegal function");
3562 3901
3563 case OP_DOMACRO: /* do macro */ 3902 case OP_DOMACRO: /* do macro */
3564 SCHEME_V->code = SCHEME_V->value; 3903 SCHEME_V->code = SCHEME_V->value;
3565 s_goto (OP_EVAL); 3904 s_goto (OP_EVAL);
3566
3567#if 1
3568 3905
3569 case OP_LAMBDA: /* lambda */ 3906 case OP_LAMBDA: /* lambda */
3570 /* If the hook is defined, apply it to SCHEME_V->code, otherwise 3907 /* If the hook is defined, apply it to SCHEME_V->code, otherwise
3571 set SCHEME_V->value fall thru */ 3908 set SCHEME_V->value fall thru */
3572 { 3909 {
… …
3579 SCHEME_V->code = slot_value_in_env (f); 3916 SCHEME_V->code = slot_value_in_env (f);
3580 s_goto (OP_APPLY); 3917 s_goto (OP_APPLY);
3581 } 3918 }
3582 3919
3583 SCHEME_V->value = SCHEME_V->code; 3920 SCHEME_V->value = SCHEME_V->code;
3584 /* Fallthru */
3585 } 3921 }
3922 /* Fallthru */
3586 3923
3587 case OP_LAMBDA1: 3924 case OP_LAMBDA1:
3588 s_return (mk_closure (SCHEME_A_ SCHEME_V->value, SCHEME_V->envir)); 3925 s_return (mk_closure (SCHEME_A_ SCHEME_V->value, SCHEME_V->envir));
3589
3590#else
3591
3592 case OP_LAMBDA: /* lambda */
3593 s_return (mk_closure (SCHEME_A_ SCHEME_V->code, SCHEME_V->envir));
3594
3595#endif
3596 3926
3597 case OP_MKCLOSURE: /* make-closure */ 3927 case OP_MKCLOSURE: /* make-closure */
3598 x = car (args); 3928 x = car (args);
3599 3929
3600 if (car (x) == SCHEME_V->LAMBDA) 3930 if (car (x) == SCHEME_V->LAMBDA)
… …
3639 else 3969 else
3640 new_slot_in_env (SCHEME_A_ SCHEME_V->code, SCHEME_V->value); 3970 new_slot_in_env (SCHEME_A_ SCHEME_V->code, SCHEME_V->value);
3641 3971
3642 s_return (SCHEME_V->code); 3972 s_return (SCHEME_V->code);
3643 3973
3644
3645 case OP_DEFP: /* defined? */ 3974 case OP_DEFP: /* defined? */
3646 x = SCHEME_V->envir; 3975 x = SCHEME_V->envir;
3647 3976
3648 if (cdr (args) != NIL) 3977 if (cdr (args) != NIL)
3649 x = cadr (args); 3978 x = cadr (args);
… …
3667 s_return (SCHEME_V->value); 3996 s_return (SCHEME_V->value);
3668 } 3997 }
3669 else 3998 else
3670 Error_1 ("set!: unbound variable:", SCHEME_V->code); 3999 Error_1 ("set!: unbound variable:", SCHEME_V->code);
3671 4000
3672
3673 case OP_BEGIN: /* begin */ 4001 case OP_BEGIN: /* begin */
3674 if (!is_pair (SCHEME_V->code)) 4002 if (!is_pair (SCHEME_V->code))
3675 s_return (SCHEME_V->code); 4003 s_return (SCHEME_V->code);
3676 4004
3677 if (cdr (SCHEME_V->code) != NIL) 4005 if (cdr (SCHEME_V->code) != NIL)
… …
3688 case OP_IF1: /* if */ 4016 case OP_IF1: /* if */
3689 if (is_true (SCHEME_V->value)) 4017 if (is_true (SCHEME_V->value))
3690 SCHEME_V->code = car (SCHEME_V->code); 4018 SCHEME_V->code = car (SCHEME_V->code);
3691 else 4019 else
3692 SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because * car(NIL) = NIL */ 4020 SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because * car(NIL) = NIL */
4021
3693 s_goto (OP_EVAL); 4022 s_goto (OP_EVAL);
3694 4023
3695 case OP_LET0: /* let */ 4024 case OP_LET0: /* let */
3696 SCHEME_V->args = NIL; 4025 SCHEME_V->args = NIL;
3697 SCHEME_V->value = SCHEME_V->code; 4026 SCHEME_V->value = SCHEME_V->code;
3698 SCHEME_V->code = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code); 4027 SCHEME_V->code = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code);
3699 s_goto (OP_LET1); 4028 s_goto (OP_LET1);
3700 4029
3701 case OP_LET1: /* let (calculate parameters) */ 4030 case OP_LET1: /* let (calculate parameters) */
4031 case OP_LET1REC: /* letrec (calculate parameters) */
3702 args = cons (SCHEME_V->value, args); 4032 args = cons (SCHEME_V->value, args);
3703 4033
3704 if (is_pair (SCHEME_V->code)) /* continue */ 4034 if (is_pair (SCHEME_V->code)) /* continue */
3705 { 4035 {
3706 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code))) 4036 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code)))
3707 Error_1 ("Bad syntax of binding spec in let :", car (SCHEME_V->code)); 4037 Error_1 ("Bad syntax of binding spec in let/letrec:", car (SCHEME_V->code));
3708 4038
3709 s_save (SCHEME_A_ OP_LET1, args, cdr (SCHEME_V->code)); 4039 s_save (SCHEME_A_ op, args, cdr (SCHEME_V->code));
3710 SCHEME_V->code = cadar (SCHEME_V->code); 4040 SCHEME_V->code = cadar (SCHEME_V->code);
3711 SCHEME_V->args = NIL; 4041 SCHEME_V->args = NIL;
3712 s_goto (OP_EVAL); 4042 s_goto (OP_EVAL);
3713 } 4043 }
3714 else /* end */ 4044
3715 { 4045 /* end */
3716 args = reverse_in_place (SCHEME_A_ NIL, args); 4046 args = reverse_in_place (SCHEME_A_ NIL, args);
3717 SCHEME_V->code = car (args); 4047 SCHEME_V->code = car (args);
3718 SCHEME_V->args = cdr (args); 4048 SCHEME_V->args = cdr (args);
3719 s_goto (OP_LET2); 4049 s_goto (op == OP_LET1 ? OP_LET2 : OP_LET2REC);
3720 }
3721 4050
3722 case OP_LET2: /* let */ 4051 case OP_LET2: /* let */
3723 new_frame_in_env (SCHEME_A_ SCHEME_V->envir); 4052 new_frame_in_env (SCHEME_A_ SCHEME_V->envir);
3724 4053
3725 for (x = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code), y = args; 4054 for (x = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code), y = args;
… …
3729 if (is_symbol (car (SCHEME_V->code))) /* named let */ 4058 if (is_symbol (car (SCHEME_V->code))) /* named let */
3730 { 4059 {
3731 for (x = cadr (SCHEME_V->code), args = NIL; x != NIL; x = cdr (x)) 4060 for (x = cadr (SCHEME_V->code), args = NIL; x != NIL; x = cdr (x))
3732 { 4061 {
3733 if (!is_pair (x)) 4062 if (!is_pair (x))
3734 Error_1 ("Bad syntax of binding in let :", x); 4063 Error_1 ("Bad syntax of binding in let:", x);
3735 4064
3736 if (!is_list (SCHEME_A_ car (x))) 4065 if (!is_list (SCHEME_A_ car (x)))
3737 Error_1 ("Bad syntax of binding in let :", car (x)); 4066 Error_1 ("Bad syntax of binding in let:", car (x));
3738 4067
3739 args = cons (caar (x), args); 4068 args = cons (caar (x), args);
3740 } 4069 }
3741 4070
3742 x = mk_closure (SCHEME_A_ cons (reverse_in_place (SCHEME_A_ NIL, args), cddr (SCHEME_V->code)), 4071 x = mk_closure (SCHEME_A_ cons (reverse_in_place (SCHEME_A_ NIL, args), cddr (SCHEME_V->code)),
… …
3759 SCHEME_V->code = cdr (SCHEME_V->code); 4088 SCHEME_V->code = cdr (SCHEME_V->code);
3760 s_goto (OP_BEGIN); 4089 s_goto (OP_BEGIN);
3761 } 4090 }
3762 4091
3763 if (!is_pair (car (SCHEME_V->code)) || !is_pair (caar (SCHEME_V->code)) || !is_pair (cdaar (SCHEME_V->code))) 4092 if (!is_pair (car (SCHEME_V->code)) || !is_pair (caar (SCHEME_V->code)) || !is_pair (cdaar (SCHEME_V->code)))
3764 Error_1 ("Bad syntax of binding spec in let* :", car (SCHEME_V->code)); 4093 Error_1 ("Bad syntax of binding spec in let*:", car (SCHEME_V->code));
3765 4094
3766 s_save (SCHEME_A_ OP_LET1AST, cdr (SCHEME_V->code), car (SCHEME_V->code)); 4095 s_save (SCHEME_A_ OP_LET1AST, cdr (SCHEME_V->code), car (SCHEME_V->code));
3767 SCHEME_V->code = car (cdaar (SCHEME_V->code)); 4096 SCHEME_V->code = car (cdaar (SCHEME_V->code));
3768 s_goto (OP_EVAL); 4097 s_goto (OP_EVAL);
3769 4098
… …
3780 s_save (SCHEME_A_ OP_LET2AST, args, SCHEME_V->code); 4109 s_save (SCHEME_A_ OP_LET2AST, args, SCHEME_V->code);
3781 SCHEME_V->code = cadar (SCHEME_V->code); 4110 SCHEME_V->code = cadar (SCHEME_V->code);
3782 SCHEME_V->args = NIL; 4111 SCHEME_V->args = NIL;
3783 s_goto (OP_EVAL); 4112 s_goto (OP_EVAL);
3784 } 4113 }
3785 else /* end */ 4114
4115 /* end */
3786 { 4116
3787 SCHEME_V->code = args; 4117 SCHEME_V->code = args;
3788 SCHEME_V->args = NIL; 4118 SCHEME_V->args = NIL;
3789 s_goto (OP_BEGIN); 4119 s_goto (OP_BEGIN);
3790 }
3791 4120
3792 case OP_LET0REC: /* letrec */ 4121 case OP_LET0REC: /* letrec */
3793 new_frame_in_env (SCHEME_A_ SCHEME_V->envir); 4122 new_frame_in_env (SCHEME_A_ SCHEME_V->envir);
3794 SCHEME_V->args = NIL; 4123 SCHEME_V->args = NIL;
3795 SCHEME_V->value = SCHEME_V->code; 4124 SCHEME_V->value = SCHEME_V->code;
3796 SCHEME_V->code = car (SCHEME_V->code); 4125 SCHEME_V->code = car (SCHEME_V->code);
3797 s_goto (OP_LET1REC); 4126 s_goto (OP_LET1REC);
3798 4127
3799 case OP_LET1REC: /* letrec (calculate parameters) */ 4128 /* OP_LET1REC handled by OP_LET1 */
3800 args = cons (SCHEME_V->value, args);
3801
3802 if (is_pair (SCHEME_V->code)) /* continue */
3803 {
3804 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code)))
3805 Error_1 ("Bad syntax of binding spec in letrec :", car (SCHEME_V->code));
3806
3807 s_save (SCHEME_A_ OP_LET1REC, args, cdr (SCHEME_V->code));
3808 SCHEME_V->code = cadar (SCHEME_V->code);
3809 SCHEME_V->args = NIL;
3810 s_goto (OP_EVAL);
3811 }
3812 else /* end */
3813 {
3814 args = reverse_in_place (SCHEME_A_ NIL, args);
3815 SCHEME_V->code = car (args);
3816 SCHEME_V->args = cdr (args);
3817 s_goto (OP_LET2REC);
3818 }
3819 4129
3820 case OP_LET2REC: /* letrec */ 4130 case OP_LET2REC: /* letrec */
3821 for (x = car (SCHEME_V->code), y = args; y != NIL; x = cdr (x), y = cdr (y)) 4131 for (x = car (SCHEME_V->code), y = args; y != NIL; x = cdr (x), y = cdr (y))
3822 new_slot_in_env (SCHEME_A_ caar (x), car (y)); 4132 new_slot_in_env (SCHEME_A_ caar (x), car (y));
3823 4133
… …
3853 } 4163 }
3854 else 4164 else
3855 { 4165 {
3856 if ((SCHEME_V->code = cdr (SCHEME_V->code)) == NIL) 4166 if ((SCHEME_V->code = cdr (SCHEME_V->code)) == NIL)
3857 s_return (NIL); 4167 s_return (NIL);
3858 else 4168
3859 {
3860 s_save (SCHEME_A_ OP_COND1, NIL, SCHEME_V->code); 4169 s_save (SCHEME_A_ OP_COND1, NIL, SCHEME_V->code);
3861 SCHEME_V->code = caar (SCHEME_V->code); 4170 SCHEME_V->code = caar (SCHEME_V->code);
3862 s_goto (OP_EVAL); 4171 s_goto (OP_EVAL);
3863 }
3864 } 4172 }
3865 4173
3866 case OP_DELAY: /* delay */ 4174 case OP_DELAY: /* delay */
3867 x = mk_closure (SCHEME_A_ cons (NIL, SCHEME_V->code), SCHEME_V->envir); 4175 x = mk_closure (SCHEME_A_ cons (NIL, SCHEME_V->code), SCHEME_V->envir);
3868 set_typeflag (x, T_PROMISE); 4176 set_typeflag (x, T_PROMISE);
… …
3879 case OP_AND1: /* and */ 4187 case OP_AND1: /* and */
3880 if (is_false (SCHEME_V->value)) 4188 if (is_false (SCHEME_V->value))
3881 s_return (SCHEME_V->value); 4189 s_return (SCHEME_V->value);
3882 else if (SCHEME_V->code == NIL) 4190 else if (SCHEME_V->code == NIL)
3883 s_return (SCHEME_V->value); 4191 s_return (SCHEME_V->value);
3884 else 4192
3885 {
3886 s_save (SCHEME_A_ OP_AND1, NIL, cdr (SCHEME_V->code)); 4193 s_save (SCHEME_A_ OP_AND1, NIL, cdr (SCHEME_V->code));
3887 SCHEME_V->code = car (SCHEME_V->code); 4194 SCHEME_V->code = car (SCHEME_V->code);
3888 s_goto (OP_EVAL); 4195 s_goto (OP_EVAL);
3889 }
3890 4196
3891 case OP_OR0: /* or */ 4197 case OP_OR0: /* or */
3892 if (SCHEME_V->code == NIL) 4198 if (SCHEME_V->code == NIL)
3893 s_return (S_F); 4199 s_return (S_F);
3894 4200
… …
3899 case OP_OR1: /* or */ 4205 case OP_OR1: /* or */
3900 if (is_true (SCHEME_V->value)) 4206 if (is_true (SCHEME_V->value))
3901 s_return (SCHEME_V->value); 4207 s_return (SCHEME_V->value);
3902 else if (SCHEME_V->code == NIL) 4208 else if (SCHEME_V->code == NIL)
3903 s_return (SCHEME_V->value); 4209 s_return (SCHEME_V->value);
3904 else 4210
3905 {
3906 s_save (SCHEME_A_ OP_OR1, NIL, cdr (SCHEME_V->code)); 4211 s_save (SCHEME_A_ OP_OR1, NIL, cdr (SCHEME_V->code));
3907 SCHEME_V->code = car (SCHEME_V->code); 4212 SCHEME_V->code = car (SCHEME_V->code);
3908 s_goto (OP_EVAL); 4213 s_goto (OP_EVAL);
3909 }
3910 4214
3911 case OP_C0STREAM: /* cons-stream */ 4215 case OP_C0STREAM: /* cons-stream */
3912 s_save (SCHEME_A_ OP_C1STREAM, NIL, cdr (SCHEME_V->code)); 4216 s_save (SCHEME_A_ OP_C1STREAM, NIL, cdr (SCHEME_V->code));
3913 SCHEME_V->code = car (SCHEME_V->code); 4217 SCHEME_V->code = car (SCHEME_V->code);
3914 s_goto (OP_EVAL); 4218 s_goto (OP_EVAL);
… …
3979 s_save (SCHEME_A_ OP_CASE2, NIL, cdar (x)); 4283 s_save (SCHEME_A_ OP_CASE2, NIL, cdar (x));
3980 SCHEME_V->code = caar (x); 4284 SCHEME_V->code = caar (x);
3981 s_goto (OP_EVAL); 4285 s_goto (OP_EVAL);
3982 } 4286 }
3983 } 4287 }
3984 else 4288
3985 s_return (NIL); 4289 s_return (NIL);
3986 4290
3987 case OP_CASE2: /* case */ 4291 case OP_CASE2: /* case */
3988 if (is_true (SCHEME_V->value)) 4292 if (is_true (SCHEME_V->value))
3989 s_goto (OP_BEGIN); 4293 s_goto (OP_BEGIN);
3990 else 4294
3991 s_return (NIL); 4295 s_return (NIL);
3992 4296
3993 case OP_PAPPLY: /* apply */ 4297 case OP_PAPPLY: /* apply */
3994 SCHEME_V->code = car (args); 4298 SCHEME_V->code = car (args);
3995 SCHEME_V->args = list_star (SCHEME_A_ cdr (args)); 4299 SCHEME_V->args = list_star (SCHEME_A_ cdr (args));
3996 /*SCHEME_V->args = cadr(args); */ 4300 /*SCHEME_V->args = cadr(args); */
… …
4010 } 4314 }
4011 4315
4012 if (USE_ERROR_CHECKING) abort (); 4316 if (USE_ERROR_CHECKING) abort ();
4013} 4317}
4014 4318
4015static int 4319/* math, cxr */
4320ecb_hot static int
4016opexe_1 (SCHEME_P_ enum scheme_opcodes op) 4321opexe_1 (SCHEME_P_ enum scheme_opcodes op)
4017{ 4322{
4018 pointer args = SCHEME_V->args; 4323 pointer args = SCHEME_V->args;
4019 pointer x = car (args); 4324 pointer x = car (args);
4020 num v; 4325 num v;
4021 4326
4022 switch (op) 4327 switch (op)
4023 { 4328 {
4024#if USE_MATH 4329#if USE_MATH
4025 case OP_INEX2EX: /* inexact->exact */ 4330 case OP_INEX2EX: /* inexact->exact */
4026 {
4027 if (is_integer (x)) 4331 if (!is_integer (x))
4028 s_return (x); 4332 {
4029
4030 RVALUE r = rvalue_unchecked (x); 4333 RVALUE r = rvalue_unchecked (x);
4031 4334
4032 if (r == (RVALUE)(IVALUE)r) 4335 if (r == (RVALUE)(IVALUE)r)
4033 s_return (mk_integer (SCHEME_A_ rvalue_unchecked (x))); 4336 x = mk_integer (SCHEME_A_ rvalue_unchecked (x));
4034 else 4337 else
4035 Error_1 ("inexact->exact: not integral:", x); 4338 Error_1 ("inexact->exact: not integral:", x);
4036 } 4339 }
4037 4340
4341 s_return (x);
4342
4343 case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x))));
4344 case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x))));
4345 case OP_TRUNCATE: s_return (mk_real (SCHEME_A_ trunc (rvalue (x))));
4346 case OP_ROUND: s_return (mk_real (SCHEME_A_ nearbyint (rvalue (x))));
4347
4348 case OP_SQRT: s_return (mk_real (SCHEME_A_ sqrt (rvalue (x))));
4038 case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x)))); 4349 case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x))));
4039 case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x)))); 4350 case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x))
4351 / (cadr (args) == NIL ? 1 : log (rvalue (cadr (args))))));
4040 case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x)))); 4352 case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x))));
4041 case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x)))); 4353 case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x))));
4042 case OP_TAN: s_return (mk_real (SCHEME_A_ tan (rvalue (x)))); 4354 case OP_TAN: s_return (mk_real (SCHEME_A_ tan (rvalue (x))));
4043 case OP_ASIN: s_return (mk_real (SCHEME_A_ asin (rvalue (x)))); 4355 case OP_ASIN: s_return (mk_real (SCHEME_A_ asin (rvalue (x))));
4044 case OP_ACOS: s_return (mk_real (SCHEME_A_ acos (rvalue (x)))); 4356 case OP_ACOS: s_return (mk_real (SCHEME_A_ acos (rvalue (x))));
4045 4357
4046 case OP_ATAN: 4358 case OP_ATAN:
4359 s_return (mk_real (SCHEME_A_
4047 if (cdr (args) == NIL) 4360 cdr (args) == NIL
4048 s_return (mk_real (SCHEME_A_ atan (rvalue (x)))); 4361 ? atan (rvalue (x))
4049 else 4362 : atan2 (rvalue (x), rvalue (cadr (args)))));
4050 {
4051 pointer y = cadr (args);
4052 s_return (mk_real (SCHEME_A_ atan2 (rvalue (x), rvalue (y))));
4053 }
4054
4055 case OP_SQRT:
4056 s_return (mk_real (SCHEME_A_ sqrt (rvalue (x))));
4057 4363
4058 case OP_EXPT: 4364 case OP_EXPT:
4059 { 4365 {
4060 RVALUE result; 4366 RVALUE result;
4061 int real_result = 1; 4367 int real_result = 1;
… …
4084 if (real_result) 4390 if (real_result)
4085 s_return (mk_real (SCHEME_A_ result)); 4391 s_return (mk_real (SCHEME_A_ result));
4086 else 4392 else
4087 s_return (mk_integer (SCHEME_A_ result)); 4393 s_return (mk_integer (SCHEME_A_ result));
4088 } 4394 }
4089
4090 case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x))));
4091 case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x))));
4092
4093 case OP_TRUNCATE:
4094 {
4095 RVALUE n = rvalue (x);
4096 s_return (mk_real (SCHEME_A_ n > 0 ? floor (n) : ceil (n)));
4097 }
4098
4099 case OP_ROUND:
4100 if (is_integer (x))
4101 s_return (x);
4102
4103 s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x))));
4104#endif 4395#endif
4105 4396
4106 case OP_ADD: /* + */ 4397 case OP_ADD: /* + */
4107 v = num_zero; 4398 v = num_zero;
4108 4399
… …
4196 else 4487 else
4197 Error_0 ("modulo: division by zero"); 4488 Error_0 ("modulo: division by zero");
4198 4489
4199 s_return (mk_number (SCHEME_A_ v)); 4490 s_return (mk_number (SCHEME_A_ v));
4200 4491
4201 case OP_CAR: /* car */ 4492 /* the compiler will optimize this mess... */
4202 s_return (caar (args)); 4493 case OP_CAR: op_car: s_return (car (x));
4203 4494 case OP_CDR: op_cdr: s_return (cdr (x));
4204 case OP_CDR: /* cdr */ 4495 case OP_CAAR: op_caar: x = car (x); goto op_car;
4205 s_return (cdar (args)); 4496 case OP_CADR: op_cadr: x = cdr (x); goto op_car;
4497 case OP_CDAR: op_cdar: x = car (x); goto op_cdr;
4498 case OP_CDDR: op_cddr: x = cdr (x); goto op_cdr;
4499 case OP_CAAAR: op_caaar: x = car (x); goto op_caar;
4500 case OP_CAADR: op_caadr: x = cdr (x); goto op_caar;
4501 case OP_CADAR: op_cadar: x = car (x); goto op_cadr;
4502 case OP_CADDR: op_caddr: x = cdr (x); goto op_cadr;
4503 case OP_CDAAR: op_cdaar: x = car (x); goto op_cdar;
4504 case OP_CDADR: op_cdadr: x = cdr (x); goto op_cdar;
4505 case OP_CDDAR: op_cddar: x = car (x); goto op_cddr;
4506 case OP_CDDDR: op_cdddr: x = cdr (x); goto op_cddr;
4507 case OP_CAAAAR: x = car (x); goto op_caaar;
4508 case OP_CAAADR: x = cdr (x); goto op_caaar;
4509 case OP_CAADAR: x = car (x); goto op_caadr;
4510 case OP_CAADDR: x = cdr (x); goto op_caadr;
4511 case OP_CADAAR: x = car (x); goto op_cadar;
4512 case OP_CADADR: x = cdr (x); goto op_cadar;
4513 case OP_CADDAR: x = car (x); goto op_caddr;
4514 case OP_CADDDR: x = cdr (x); goto op_caddr;
4515 case OP_CDAAAR: x = car (x); goto op_cdaar;
4516 case OP_CDAADR: x = cdr (x); goto op_cdaar;
4517 case OP_CDADAR: x = car (x); goto op_cdadr;
4518 case OP_CDADDR: x = cdr (x); goto op_cdadr;
4519 case OP_CDDAAR: x = car (x); goto op_cddar;
4520 case OP_CDDADR: x = cdr (x); goto op_cddar;
4521 case OP_CDDDAR: x = car (x); goto op_cdddr;
4522 case OP_CDDDDR: x = cdr (x); goto op_cdddr;
4206 4523
4207 case OP_CONS: /* cons */ 4524 case OP_CONS: /* cons */
4208 set_cdr (args, cadr (args)); 4525 set_cdr (args, cadr (args));
4209 s_return (args); 4526 s_return (args);
4210 4527
… …
4384 memcpy (pos, strvalue (car (x)), strlength (car (x))); 4701 memcpy (pos, strvalue (car (x)), strlength (car (x)));
4385 4702
4386 s_return (newstr); 4703 s_return (newstr);
4387 } 4704 }
4388 4705
4389 case OP_SUBSTR: /* substring */ 4706 case OP_STRING_COPY: /* substring/string-copy */
4390 { 4707 {
4391 char *str = strvalue (x); 4708 char *str = strvalue (x);
4392 int index0 = ivalue_unchecked (cadr (args)); 4709 int index0 = cadr (args) == NIL ? 0 : ivalue_unchecked (cadr (args));
4393 int index1; 4710 int index1;
4394 int len; 4711 int len;
4395 4712
4396 if (index0 > strlength (x)) 4713 if (index0 > strlength (x))
4397 Error_1 ("substring: start out of bounds:", cadr (args)); 4714 Error_1 ("string->copy: start out of bounds:", cadr (args));
4398 4715
4399 if (cddr (args) != NIL) 4716 if (cddr (args) != NIL)
4400 { 4717 {
4401 index1 = ivalue_unchecked (caddr (args)); 4718 index1 = ivalue_unchecked (caddr (args));
4402 4719
4403 if (index1 > strlength (x) || index1 < index0) 4720 if (index1 > strlength (x) || index1 < index0)
4404 Error_1 ("substring: end out of bounds:", caddr (args)); 4721 Error_1 ("string->copy: end out of bounds:", caddr (args));
4405 } 4722 }
4406 else 4723 else
4407 index1 = strlength (x); 4724 index1 = strlength (x);
4408 4725
4409 len = index1 - index0; 4726 len = index1 - index0;
4410 x = mk_empty_string (SCHEME_A_ len, ' '); 4727 x = mk_counted_string (SCHEME_A_ str + index0, len);
4411 memcpy (strvalue (x), str + index0, len);
4412 strvalue (x)[len] = 0;
4413 4728
4414 s_return (x); 4729 s_return (x);
4415 } 4730 }
4416 4731
4417 case OP_VECTOR: /* vector */ 4732 case OP_VECTOR: /* vector */
… …
4491 } 4806 }
4492 4807
4493 if (USE_ERROR_CHECKING) abort (); 4808 if (USE_ERROR_CHECKING) abort ();
4494} 4809}
4495 4810
4496static int 4811/* relational ops */
4812ecb_hot static int
4497opexe_2 (SCHEME_P_ enum scheme_opcodes op) 4813opexe_2 (SCHEME_P_ enum scheme_opcodes op)
4498{ 4814{
4499 pointer x = SCHEME_V->args; 4815 pointer x = SCHEME_V->args;
4500 4816
4501 for (;;) 4817 for (;;)
… …
4522 } 4838 }
4523 4839
4524 s_return (S_T); 4840 s_return (S_T);
4525} 4841}
4526 4842
4527static int 4843/* predicates */
4844ecb_hot static int
4528opexe_3 (SCHEME_P_ enum scheme_opcodes op) 4845opexe_3 (SCHEME_P_ enum scheme_opcodes op)
4529{ 4846{
4530 pointer args = SCHEME_V->args; 4847 pointer args = SCHEME_V->args;
4531 pointer a = car (args); 4848 pointer a = car (args);
4532 pointer d = cdr (args); 4849 pointer d = cdr (args);
… …
4579 } 4896 }
4580 4897
4581 s_retbool (r); 4898 s_retbool (r);
4582} 4899}
4583 4900
4584static int 4901/* promises, list ops, ports */
4902ecb_hot static int
4585opexe_4 (SCHEME_P_ enum scheme_opcodes op) 4903opexe_4 (SCHEME_P_ enum scheme_opcodes op)
4586{ 4904{
4587 pointer args = SCHEME_V->args; 4905 pointer args = SCHEME_V->args;
4588 pointer a = car (args); 4906 pointer a = car (args);
4589 pointer x, y; 4907 pointer x, y;
… …
4602 } 4920 }
4603 else 4921 else
4604 s_return (SCHEME_V->code); 4922 s_return (SCHEME_V->code);
4605 4923
4606 case OP_SAVE_FORCED: /* Save forced value replacing promise */ 4924 case OP_SAVE_FORCED: /* Save forced value replacing promise */
4607 memcpy (SCHEME_V->code, SCHEME_V->value, sizeof (struct cell)); 4925 *CELL (SCHEME_V->code) = *CELL (SCHEME_V->value);
4608 s_return (SCHEME_V->value); 4926 s_return (SCHEME_V->value);
4609 4927
4610#if USE_PORTS 4928#if USE_PORTS
4929
4930 case OP_EOF_OBJECT: /* eof-object */
4931 s_return (S_EOF);
4611 4932
4612 case OP_WRITE: /* write */ 4933 case OP_WRITE: /* write */
4613 case OP_DISPLAY: /* display */ 4934 case OP_DISPLAY: /* display */
4614 case OP_WRITE_CHAR: /* write-char */ 4935 case OP_WRITE_CHAR: /* write-char */
4615 if (is_pair (cdr (SCHEME_V->args))) 4936 if (is_pair (cdr (SCHEME_V->args)))
… …
4629 else 4950 else
4630 SCHEME_V->print_flag = 0; 4951 SCHEME_V->print_flag = 0;
4631 4952
4632 s_goto (OP_P0LIST); 4953 s_goto (OP_P0LIST);
4633 4954
4955 //TODO: move to scheme
4634 case OP_NEWLINE: /* newline */ 4956 case OP_NEWLINE: /* newline */
4635 if (is_pair (args)) 4957 if (is_pair (args))
4636 { 4958 {
4637 if (a != SCHEME_V->outport) 4959 if (a != SCHEME_V->outport)
4638 { 4960 {
… …
4640 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL); 4962 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL);
4641 SCHEME_V->outport = a; 4963 SCHEME_V->outport = a;
4642 } 4964 }
4643 } 4965 }
4644 4966
4645 putstr (SCHEME_A_ "\n"); 4967 putcharacter (SCHEME_A_ '\n');
4646 s_return (S_T); 4968 s_return (S_T);
4647#endif 4969#endif
4648 4970
4649 case OP_ERR0: /* error */ 4971 case OP_ERR0: /* error */
4650 SCHEME_V->retcode = -1; 4972 SCHEME_V->retcode = -1;
… …
4659 putstr (SCHEME_A_ strvalue (car (args))); 4981 putstr (SCHEME_A_ strvalue (car (args)));
4660 SCHEME_V->args = cdr (args); 4982 SCHEME_V->args = cdr (args);
4661 s_goto (OP_ERR1); 4983 s_goto (OP_ERR1);
4662 4984
4663 case OP_ERR1: /* error */ 4985 case OP_ERR1: /* error */
4664 putstr (SCHEME_A_ " "); 4986 putcharacter (SCHEME_A_ ' ');
4665 4987
4666 if (args != NIL) 4988 if (args != NIL)
4667 { 4989 {
4668 s_save (SCHEME_A_ OP_ERR1, cdr (args), NIL); 4990 s_save (SCHEME_A_ OP_ERR1, cdr (args), NIL);
4669 SCHEME_V->args = a; 4991 SCHEME_V->args = a;
4670 SCHEME_V->print_flag = 1; 4992 SCHEME_V->print_flag = 1;
4671 s_goto (OP_P0LIST); 4993 s_goto (OP_P0LIST);
4672 } 4994 }
4673 else 4995 else
4674 { 4996 {
4675 putstr (SCHEME_A_ "\n"); 4997 putcharacter (SCHEME_A_ '\n');
4676 4998
4677 if (SCHEME_V->interactive_repl) 4999 if (SCHEME_V->interactive_repl)
4678 s_goto (OP_T0LVL); 5000 s_goto (OP_T0LVL);
4679 else 5001 else
4680 return -1; 5002 return -1;
… …
4757 SCHEME_V->gc_verbose = (a != S_F); 5079 SCHEME_V->gc_verbose = (a != S_F);
4758 s_retbool (was); 5080 s_retbool (was);
4759 } 5081 }
4760 5082
4761 case OP_NEWSEGMENT: /* new-segment */ 5083 case OP_NEWSEGMENT: /* new-segment */
5084#if 0
4762 if (!is_pair (args) || !is_number (a)) 5085 if (!is_pair (args) || !is_number (a))
4763 Error_0 ("new-segment: argument must be a number"); 5086 Error_0 ("new-segment: argument must be a number");
4764 5087#endif
4765 alloc_cellseg (SCHEME_A_ ivalue (a)); 5088 s_retbool (alloc_cellseg (SCHEME_A));
4766
4767 s_return (S_T);
4768 5089
4769 case OP_OBLIST: /* oblist */ 5090 case OP_OBLIST: /* oblist */
4770 s_return (oblist_all_symbols (SCHEME_A)); 5091 s_return (oblist_all_symbols (SCHEME_A));
4771 5092
4772#if USE_PORTS 5093#if USE_PORTS
… …
4842 s_return (p == NIL ? S_F : p); 5163 s_return (p == NIL ? S_F : p);
4843 } 5164 }
4844 5165
4845 case OP_GET_OUTSTRING: /* get-output-string */ 5166 case OP_GET_OUTSTRING: /* get-output-string */
4846 { 5167 {
4847 port *p; 5168 port *p = port (a);
4848 5169
4849 if ((p = a->object.port)->kind & port_string) 5170 if (p->kind & port_string)
4850 { 5171 {
4851 off_t size; 5172 off_t size;
4852 char *str; 5173 char *str;
4853 5174
4854 size = p->rep.string.curr - p->rep.string.start + 1; 5175 size = p->rep.string.curr - p->rep.string.start + 1;
… …
4889 } 5210 }
4890 5211
4891 if (USE_ERROR_CHECKING) abort (); 5212 if (USE_ERROR_CHECKING) abort ();
4892} 5213}
4893 5214
4894static int 5215/* reading */
5216ecb_cold static int
4895opexe_5 (SCHEME_P_ enum scheme_opcodes op) 5217opexe_5 (SCHEME_P_ enum scheme_opcodes op)
4896{ 5218{
4897 pointer args = SCHEME_V->args; 5219 pointer args = SCHEME_V->args;
4898 pointer x; 5220 pointer x;
4899 5221
… …
4959 int res; 5281 int res;
4960 5282
4961 if (is_pair (args)) 5283 if (is_pair (args))
4962 p = car (args); 5284 p = car (args);
4963 5285
4964 res = p->object.port->kind & port_string; 5286 res = port (p)->kind & port_string;
4965 5287
4966 s_retbool (res); 5288 s_retbool (res);
4967 } 5289 }
4968 5290
4969 case OP_SET_INPORT: /* set-input-port */ 5291 case OP_SET_INPORT: /* set-input-port */
… …
4978 case OP_RDSEXPR: 5300 case OP_RDSEXPR:
4979 switch (SCHEME_V->tok) 5301 switch (SCHEME_V->tok)
4980 { 5302 {
4981 case TOK_EOF: 5303 case TOK_EOF:
4982 s_return (S_EOF); 5304 s_return (S_EOF);
4983 /* NOTREACHED */
4984 5305
4985 case TOK_VEC: 5306 case TOK_VEC:
4986 s_save (SCHEME_A_ OP_RDVEC, NIL, NIL); 5307 s_save (SCHEME_A_ OP_RDVEC, NIL, NIL);
4987 /* fall through */ 5308 /* fall through */
4988 5309
… …
4991 5312
4992 if (SCHEME_V->tok == TOK_RPAREN) 5313 if (SCHEME_V->tok == TOK_RPAREN)
4993 s_return (NIL); 5314 s_return (NIL);
4994 else if (SCHEME_V->tok == TOK_DOT) 5315 else if (SCHEME_V->tok == TOK_DOT)
4995 Error_0 ("syntax error: illegal dot expression"); 5316 Error_0 ("syntax error: illegal dot expression");
4996 else 5317
4997 {
4998 SCHEME_V->nesting_stack[SCHEME_V->file_i]++; 5318 SCHEME_V->nesting_stack[SCHEME_V->file_i]++;
4999 s_save (SCHEME_A_ OP_RDLIST, NIL, NIL); 5319 s_save (SCHEME_A_ OP_RDLIST, NIL, NIL);
5000 s_goto (OP_RDSEXPR); 5320 s_goto (OP_RDSEXPR);
5001 }
5002 5321
5003 case TOK_QUOTE: 5322 case TOK_QUOTE:
5004 s_save (SCHEME_A_ OP_RDQUOTE, NIL, NIL); 5323 s_save (SCHEME_A_ OP_RDQUOTE, NIL, NIL);
5005 SCHEME_V->tok = token (SCHEME_A); 5324 SCHEME_V->tok = token (SCHEME_A);
5006 s_goto (OP_RDSEXPR); 5325 s_goto (OP_RDSEXPR);
… …
5012 { 5331 {
5013 s_save (SCHEME_A_ OP_RDQQUOTEVEC, NIL, NIL); 5332 s_save (SCHEME_A_ OP_RDQQUOTEVEC, NIL, NIL);
5014 SCHEME_V->tok = TOK_LPAREN; 5333 SCHEME_V->tok = TOK_LPAREN;
5015 s_goto (OP_RDSEXPR); 5334 s_goto (OP_RDSEXPR);
5016 } 5335 }
5017 else 5336
5018 s_save (SCHEME_A_ OP_RDQQUOTE, NIL, NIL); 5337 s_save (SCHEME_A_ OP_RDQQUOTE, NIL, NIL);
5019
5020 s_goto (OP_RDSEXPR); 5338 s_goto (OP_RDSEXPR);
5021 5339
5022 case TOK_COMMA: 5340 case TOK_COMMA:
5023 s_save (SCHEME_A_ OP_RDUNQUOTE, NIL, NIL); 5341 s_save (SCHEME_A_ OP_RDUNQUOTE, NIL, NIL);
5024 SCHEME_V->tok = token (SCHEME_A); 5342 SCHEME_V->tok = token (SCHEME_A);
… …
5035 case TOK_DOTATOM: 5353 case TOK_DOTATOM:
5036 SCHEME_V->strbuff[0] = '.'; 5354 SCHEME_V->strbuff[0] = '.';
5037 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 1, DELIMITERS))); 5355 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 1, DELIMITERS)));
5038 5356
5039 case TOK_STRATOM: 5357 case TOK_STRATOM:
5358 //TODO: haven't checked whether the garbage collector could interfere and free x
5359 gc (SCHEME_A_ NIL, NIL); //TODO: superheavyhanded
5040 x = readstrexp (SCHEME_A_ '|'); 5360 x = readstrexp (SCHEME_A_ '|');
5041 //TODO: haven't checked whether the garbage collector could interfere
5042 s_return (mk_atom (SCHEME_A_ strvalue (x))); 5361 s_return (mk_atom (SCHEME_A_ strvalue (x)));
5043 5362
5044 case TOK_DQUOTE: 5363 case TOK_DQUOTE:
5045 x = readstrexp (SCHEME_A_ '"'); 5364 x = readstrexp (SCHEME_A_ '"');
5046 5365
… …
5054 { 5373 {
5055 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->SHARP_HOOK, 1); 5374 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->SHARP_HOOK, 1);
5056 5375
5057 if (f == NIL) 5376 if (f == NIL)
5058 Error_0 ("undefined sharp expression"); 5377 Error_0 ("undefined sharp expression");
5059 else 5378
5060 {
5061 SCHEME_V->code = cons (slot_value_in_env (f), NIL); 5379 SCHEME_V->code = cons (slot_value_in_env (f), NIL);
5062 s_goto (OP_EVAL); 5380 s_goto (OP_EVAL);
5063 }
5064 } 5381 }
5065 5382
5066 case TOK_SHARP_CONST: 5383 case TOK_SHARP_CONST:
5067 if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS))) == NIL) 5384 if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS))) == NIL)
5068 Error_0 ("undefined sharp expression"); 5385 Error_0 ("undefined sharp expression");
5069 else 5386
5070 s_return (x); 5387 s_return (x);
5071 5388
5072 default: 5389 default:
5073 Error_0 ("syntax error: illegal token"); 5390 Error_0 ("syntax error: illegal token");
5074 } 5391 }
5075 5392
… …
5168 pointer b = cdr (args); 5485 pointer b = cdr (args);
5169 int ok_abbr = ok_abbrev (b); 5486 int ok_abbr = ok_abbrev (b);
5170 SCHEME_V->args = car (b); 5487 SCHEME_V->args = car (b);
5171 5488
5172 if (a == SCHEME_V->QUOTE && ok_abbr) 5489 if (a == SCHEME_V->QUOTE && ok_abbr)
5173 putstr (SCHEME_A_ "'"); 5490 putcharacter (SCHEME_A_ '\'');
5174 else if (a == SCHEME_V->QQUOTE && ok_abbr) 5491 else if (a == SCHEME_V->QQUOTE && ok_abbr)
5175 putstr (SCHEME_A_ "`"); 5492 putcharacter (SCHEME_A_ '`');
5176 else if (a == SCHEME_V->UNQUOTE && ok_abbr) 5493 else if (a == SCHEME_V->UNQUOTE && ok_abbr)
5177 putstr (SCHEME_A_ ","); 5494 putcharacter (SCHEME_A_ ',');
5178 else if (a == SCHEME_V->UNQUOTESP && ok_abbr) 5495 else if (a == SCHEME_V->UNQUOTESP && ok_abbr)
5179 putstr (SCHEME_A_ ",@"); 5496 putstr (SCHEME_A_ ",@");
5180 else 5497 else
5181 { 5498 {
5182 putstr (SCHEME_A_ "("); 5499 putcharacter (SCHEME_A_ '(');
5183 s_save (SCHEME_A_ OP_P1LIST, b, NIL); 5500 s_save (SCHEME_A_ OP_P1LIST, b, NIL);
5184 SCHEME_V->args = a; 5501 SCHEME_V->args = a;
5185 } 5502 }
5186 5503
5187 s_goto (OP_P0LIST); 5504 s_goto (OP_P0LIST);
… …
5189 5506
5190 case OP_P1LIST: 5507 case OP_P1LIST:
5191 if (is_pair (args)) 5508 if (is_pair (args))
5192 { 5509 {
5193 s_save (SCHEME_A_ OP_P1LIST, cdr (args), NIL); 5510 s_save (SCHEME_A_ OP_P1LIST, cdr (args), NIL);
5194 putstr (SCHEME_A_ " "); 5511 putcharacter (SCHEME_A_ ' ');
5195 SCHEME_V->args = car (args); 5512 SCHEME_V->args = car (args);
5196 s_goto (OP_P0LIST); 5513 s_goto (OP_P0LIST);
5197 } 5514 }
5198 else if (is_vector (args)) 5515 else if (is_vector (args))
5199 { 5516 {
… …
5207 { 5524 {
5208 putstr (SCHEME_A_ " . "); 5525 putstr (SCHEME_A_ " . ");
5209 printatom (SCHEME_A_ args, SCHEME_V->print_flag); 5526 printatom (SCHEME_A_ args, SCHEME_V->print_flag);
5210 } 5527 }
5211 5528
5212 putstr (SCHEME_A_ ")"); 5529 putcharacter (SCHEME_A_ ')');
5213 s_return (S_T); 5530 s_return (S_T);
5214 } 5531 }
5215 5532
5216 case OP_PVECFROM: 5533 case OP_PVECFROM:
5217 { 5534 {
… …
5219 pointer vec = car (args); 5536 pointer vec = car (args);
5220 int len = veclength (vec); 5537 int len = veclength (vec);
5221 5538
5222 if (i == len) 5539 if (i == len)
5223 { 5540 {
5224 putstr (SCHEME_A_ ")"); 5541 putcharacter (SCHEME_A_ ')');
5225 s_return (S_T); 5542 s_return (S_T);
5226 } 5543 }
5227 else 5544 else
5228 { 5545 {
5229 pointer elem = vector_get (vec, i); 5546 pointer elem = vector_get (vec, i);
… …
5231 ivalue_unchecked (cdr (args)) = i + 1; 5548 ivalue_unchecked (cdr (args)) = i + 1;
5232 s_save (SCHEME_A_ OP_PVECFROM, args, NIL); 5549 s_save (SCHEME_A_ OP_PVECFROM, args, NIL);
5233 SCHEME_V->args = elem; 5550 SCHEME_V->args = elem;
5234 5551
5235 if (i > 0) 5552 if (i > 0)
5236 putstr (SCHEME_A_ " "); 5553 putcharacter (SCHEME_A_ ' ');
5237 5554
5238 s_goto (OP_P0LIST); 5555 s_goto (OP_P0LIST);
5239 } 5556 }
5240 } 5557 }
5241 } 5558 }
5242 5559
5243 if (USE_ERROR_CHECKING) abort (); 5560 if (USE_ERROR_CHECKING) abort ();
5244} 5561}
5245 5562
5246static int 5563/* list ops */
5564ecb_hot static int
5247opexe_6 (SCHEME_P_ enum scheme_opcodes op) 5565opexe_6 (SCHEME_P_ enum scheme_opcodes op)
5248{ 5566{
5249 pointer args = SCHEME_V->args; 5567 pointer args = SCHEME_V->args;
5250 pointer a = car (args); 5568 pointer a = car (args);
5251 pointer x, y; 5569 pointer x, y;
… …
5274 break; 5592 break;
5275 } 5593 }
5276 5594
5277 if (is_pair (y)) 5595 if (is_pair (y))
5278 s_return (car (y)); 5596 s_return (car (y));
5279 else 5597
5280 s_return (S_F); 5598 s_return (S_F);
5281
5282 5599
5283 case OP_GET_CLOSURE: /* get-closure-code *//* a.k */ 5600 case OP_GET_CLOSURE: /* get-closure-code *//* a.k */
5284 SCHEME_V->args = a; 5601 SCHEME_V->args = a;
5285 5602
5286 if (SCHEME_V->args == NIL) 5603 if (SCHEME_V->args == NIL)
5287 s_return (S_F); 5604 s_return (S_F);
5288 else if (is_closure (SCHEME_V->args)) 5605 else if (is_closure (SCHEME_V->args) || is_macro (SCHEME_V->args))
5289 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value))); 5606 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value)));
5290 else if (is_macro (SCHEME_V->args)) 5607
5291 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value)));
5292 else
5293 s_return (S_F); 5608 s_return (S_F);
5294 5609
5295 case OP_CLOSUREP: /* closure? */ 5610 case OP_CLOSUREP: /* closure? */
5296 /* 5611 /*
5297 * Note, macro object is also a closure. 5612 * Note, macro object is also a closure.
5298 * Therefore, (closure? <#MACRO>) ==> #t 5613 * Therefore, (closure? <#MACRO>) ==> #t
… …
5309 5624
5310/* dispatch functions (opexe_x) return new opcode, or 0 for same opcode, or -1 to stop */ 5625/* dispatch functions (opexe_x) return new opcode, or 0 for same opcode, or -1 to stop */
5311typedef int (*dispatch_func)(SCHEME_P_ enum scheme_opcodes); 5626typedef int (*dispatch_func)(SCHEME_P_ enum scheme_opcodes);
5312 5627
5313typedef int (*test_predicate)(pointer); 5628typedef int (*test_predicate)(pointer);
5314static int 5629
5630ecb_hot static int
5315tst_any (pointer p) 5631tst_any (pointer p)
5316{ 5632{
5317 return 1; 5633 return 1;
5318} 5634}
5319 5635
5320static int 5636ecb_hot static int
5321tst_inonneg (pointer p) 5637tst_inonneg (pointer p)
5322{ 5638{
5323 return is_integer (p) && ivalue_unchecked (p) >= 0; 5639 return is_integer (p) && ivalue_unchecked (p) >= 0;
5324} 5640}
5325 5641
5326static int 5642ecb_hot static int
5327tst_is_list (SCHEME_P_ pointer p) 5643tst_is_list (SCHEME_P_ pointer p)
5328{ 5644{
5329 return p == NIL || is_pair (p); 5645 return p == NIL || is_pair (p);
5330} 5646}
5331 5647
… …
5374#define OP_DEF(func,name,minarity,maxarity,argtest,op) name "\x00" 5690#define OP_DEF(func,name,minarity,maxarity,argtest,op) name "\x00"
5375#include "opdefines.h" 5691#include "opdefines.h"
5376#undef OP_DEF 5692#undef OP_DEF
5377; 5693;
5378 5694
5379static const char * 5695ecb_cold static const char *
5380opname (int idx) 5696opname (int idx)
5381{ 5697{
5382 const char *name = opnames; 5698 const char *name = opnames;
5383 5699
5384 /* should do this at compile time, but would require external program, right? */ 5700 /* should do this at compile time, but would require external program, right? */
… …
5386 name += strlen (name) + 1; 5702 name += strlen (name) + 1;
5387 5703
5388 return *name ? name : "ILLEGAL"; 5704 return *name ? name : "ILLEGAL";
5389} 5705}
5390 5706
5391static const char * 5707ecb_cold static const char *
5392procname (pointer x) 5708procname (pointer x)
5393{ 5709{
5394 return opname (procnum (x)); 5710 return opname (procnum (x));
5395} 5711}
5396 5712
… …
5416#undef OP_DEF 5732#undef OP_DEF
5417 {0} 5733 {0}
5418}; 5734};
5419 5735
5420/* kernel of this interpreter */ 5736/* kernel of this interpreter */
5421static void ecb_hot 5737ecb_hot static void
5422Eval_Cycle (SCHEME_P_ enum scheme_opcodes op) 5738Eval_Cycle (SCHEME_P_ enum scheme_opcodes op)
5423{ 5739{
5424 SCHEME_V->op = op; 5740 SCHEME_V->op = op;
5425 5741
5426 for (;;) 5742 for (;;)
… …
5509 if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0)) 5825 if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0))
5510 return; 5826 return;
5511 5827
5512 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 5828 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
5513 { 5829 {
5514 xwrstr ("No memory!\n"); 5830 putstr (SCHEME_A_ "No memory!\n");
5515 return; 5831 return;
5516 } 5832 }
5517 } 5833 }
5518} 5834}
5519 5835
5520/* ========== Initialization of internal keywords ========== */ 5836/* ========== Initialization of internal keywords ========== */
5521 5837
5522static void 5838ecb_cold static void
5523assign_syntax (SCHEME_P_ const char *name) 5839assign_syntax (SCHEME_P_ const char *name)
5524{ 5840{
5525 pointer x = oblist_add_by_name (SCHEME_A_ name); 5841 pointer x = oblist_add_by_name (SCHEME_A_ name);
5526 set_typeflag (x, typeflag (x) | T_SYNTAX); 5842 set_typeflag (x, typeflag (x) | T_SYNTAX);
5527} 5843}
5528 5844
5529static void 5845ecb_cold static void
5530assign_proc (SCHEME_P_ enum scheme_opcodes op, const char *name) 5846assign_proc (SCHEME_P_ enum scheme_opcodes op, const char *name)
5531{ 5847{
5532 pointer x = mk_symbol (SCHEME_A_ name); 5848 pointer x = mk_symbol (SCHEME_A_ name);
5533 pointer y = mk_proc (SCHEME_A_ op); 5849 pointer y = mk_proc (SCHEME_A_ op);
5534 new_slot_in_env (SCHEME_A_ x, y); 5850 new_slot_in_env (SCHEME_A_ x, y);
… …
5542 ivalue_unchecked (y) = op; 5858 ivalue_unchecked (y) = op;
5543 return y; 5859 return y;
5544} 5860}
5545 5861
5546/* Hard-coded for the given keywords. Remember to rewrite if more are added! */ 5862/* Hard-coded for the given keywords. Remember to rewrite if more are added! */
5547static int 5863ecb_hot static int
5548syntaxnum (pointer p) 5864syntaxnum (pointer p)
5549{ 5865{
5550 const char *s = strvalue (p); 5866 const char *s = strvalue (p);
5551 5867
5552 switch (strlength (p)) 5868 switch (strlength (p))
… …
5632ecb_cold int 5948ecb_cold int
5633scheme_init (SCHEME_P) 5949scheme_init (SCHEME_P)
5634{ 5950{
5635 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]); 5951 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]);
5636 pointer x; 5952 pointer x;
5953
5954 /* this memset is not strictly correct, as we assume (intcache)
5955 * that memset 0 will also set pointers to 0, but memset does
5956 * of course not guarantee that. screw such systems.
5957 */
5958 memset (SCHEME_V, 0, sizeof (*SCHEME_V));
5637 5959
5638 num_set_fixnum (num_zero, 1); 5960 num_set_fixnum (num_zero, 1);
5639 num_set_ivalue (num_zero, 0); 5961 num_set_ivalue (num_zero, 0);
5640 num_set_fixnum (num_one, 1); 5962 num_set_fixnum (num_one, 1);
5641 num_set_ivalue (num_one, 1); 5963 num_set_ivalue (num_one, 1);
… …
5653 SCHEME_V->save_inport = NIL; 5975 SCHEME_V->save_inport = NIL;
5654 SCHEME_V->loadport = NIL; 5976 SCHEME_V->loadport = NIL;
5655 SCHEME_V->nesting = 0; 5977 SCHEME_V->nesting = 0;
5656 SCHEME_V->interactive_repl = 0; 5978 SCHEME_V->interactive_repl = 0;
5657 5979
5658 if (alloc_cellseg (SCHEME_A_ FIRST_CELLSEGS) != FIRST_CELLSEGS) 5980 if (!alloc_cellseg (SCHEME_A))
5659 { 5981 {
5660#if USE_ERROR_CHECKING 5982#if USE_ERROR_CHECKING
5661 SCHEME_V->no_memory = 1; 5983 SCHEME_V->no_memory = 1;
5662 return 0; 5984 return 0;
5663#endif 5985#endif
5664 } 5986 }
5665 5987
5666 SCHEME_V->gc_verbose = 0; 5988 SCHEME_V->gc_verbose = 0;
5667 dump_stack_initialize (SCHEME_A); 5989 dump_stack_initialize (SCHEME_A);
5668 SCHEME_V->code = NIL; 5990 SCHEME_V->code = NIL;
5669 SCHEME_V->args = NIL; 5991 SCHEME_V->args = NIL;
5670 SCHEME_V->envir = NIL; 5992 SCHEME_V->envir = NIL;
5993 SCHEME_V->value = NIL;
5671 SCHEME_V->tracing = 0; 5994 SCHEME_V->tracing = 0;
5672 5995
5673 /* init NIL */ 5996 /* init NIL */
5674 set_typeflag (NIL, T_ATOM | T_MARK); 5997 set_typeflag (NIL, T_ATOM | T_MARK);
5675 set_car (NIL, NIL); 5998 set_car (NIL, NIL);
… …
5731 6054
5732 return !SCHEME_V->no_memory; 6055 return !SCHEME_V->no_memory;
5733} 6056}
5734 6057
5735#if USE_PORTS 6058#if USE_PORTS
5736void 6059ecb_cold void
5737scheme_set_input_port_file (SCHEME_P_ int fin) 6060scheme_set_input_port_file (SCHEME_P_ int fin)
5738{ 6061{
5739 SCHEME_V->inport = port_from_file (SCHEME_A_ fin, port_input); 6062 SCHEME_V->inport = port_from_file (SCHEME_A_ fin, port_input);
5740} 6063}
5741 6064
5742void 6065ecb_cold void
5743scheme_set_input_port_string (SCHEME_P_ char *start, char *past_the_end) 6066scheme_set_input_port_string (SCHEME_P_ char *start, char *past_the_end)
5744{ 6067{
5745 SCHEME_V->inport = port_from_string (SCHEME_A_ start, past_the_end, port_input); 6068 SCHEME_V->inport = port_from_string (SCHEME_A_ start, past_the_end, port_input);
5746} 6069}
5747 6070
5748void 6071ecb_cold void
5749scheme_set_output_port_file (SCHEME_P_ int fout) 6072scheme_set_output_port_file (SCHEME_P_ int fout)
5750{ 6073{
5751 SCHEME_V->outport = port_from_file (SCHEME_A_ fout, port_output); 6074 SCHEME_V->outport = port_from_file (SCHEME_A_ fout, port_output);
5752} 6075}
5753 6076
5754void 6077ecb_cold void
5755scheme_set_output_port_string (SCHEME_P_ char *start, char *past_the_end) 6078scheme_set_output_port_string (SCHEME_P_ char *start, char *past_the_end)
5756{ 6079{
5757 SCHEME_V->outport = port_from_string (SCHEME_A_ start, past_the_end, port_output); 6080 SCHEME_V->outport = port_from_string (SCHEME_A_ start, past_the_end, port_output);
5758} 6081}
5759#endif 6082#endif
5760 6083
5761void 6084ecb_cold void
5762scheme_set_external_data (SCHEME_P_ void *p) 6085scheme_set_external_data (SCHEME_P_ void *p)
5763{ 6086{
5764 SCHEME_V->ext_data = p; 6087 SCHEME_V->ext_data = p;
5765} 6088}
5766 6089
… …
5798 SCHEME_V->loadport = NIL; 6121 SCHEME_V->loadport = NIL;
5799 SCHEME_V->gc_verbose = 0; 6122 SCHEME_V->gc_verbose = 0;
5800 gc (SCHEME_A_ NIL, NIL); 6123 gc (SCHEME_A_ NIL, NIL);
5801 6124
5802 for (i = 0; i <= SCHEME_V->last_cell_seg; i++) 6125 for (i = 0; i <= SCHEME_V->last_cell_seg; i++)
5803 free (SCHEME_V->alloc_seg[i]); 6126 free (SCHEME_V->cell_seg[i]);
5804 6127
5805#if SHOW_ERROR_LINE 6128#if SHOW_ERROR_LINE
5806 for (i = 0; i <= SCHEME_V->file_i; i++) 6129 for (i = 0; i <= SCHEME_V->file_i; i++)
5807 {
5808 if (SCHEME_V->load_stack[i].kind & port_file) 6130 if (SCHEME_V->load_stack[i].kind & port_file)
5809 { 6131 {
5810 fname = SCHEME_V->load_stack[i].rep.stdio.filename; 6132 fname = SCHEME_V->load_stack[i].rep.stdio.filename;
5811 6133
5812 if (fname) 6134 if (fname)
5813 free (fname); 6135 free (fname);
5814 } 6136 }
5815 }
5816#endif 6137#endif
5817} 6138}
5818 6139
5819void 6140ecb_cold void
5820scheme_load_file (SCHEME_P_ int fin) 6141scheme_load_file (SCHEME_P_ int fin)
5821{ 6142{
5822 scheme_load_named_file (SCHEME_A_ fin, 0); 6143 scheme_load_named_file (SCHEME_A_ fin, 0);
5823} 6144}
5824 6145
5825void 6146ecb_cold void
5826scheme_load_named_file (SCHEME_P_ int fin, const char *filename) 6147scheme_load_named_file (SCHEME_P_ int fin, const char *filename)
5827{ 6148{
5828 dump_stack_reset (SCHEME_A); 6149 dump_stack_reset (SCHEME_A);
5829 SCHEME_V->envir = SCHEME_V->global_env; 6150 SCHEME_V->envir = SCHEME_V->global_env;
5830 SCHEME_V->file_i = 0; 6151 SCHEME_V->file_i = 0;
5831 SCHEME_V->load_stack[0].unget = -1; 6152 SCHEME_V->load_stack[0].unget = -1;
5832 SCHEME_V->load_stack[0].kind = port_input | port_file; 6153 SCHEME_V->load_stack[0].kind = port_input | port_file;
5833 SCHEME_V->load_stack[0].rep.stdio.file = fin; 6154 SCHEME_V->load_stack[0].rep.stdio.file = fin;
5834#if USE_PORTS
5835 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack); 6155 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack);
5836#endif
5837 SCHEME_V->retcode = 0; 6156 SCHEME_V->retcode = 0;
5838 6157
5839#if USE_PORTS
5840 if (fin == STDIN_FILENO) 6158 if (fin == STDIN_FILENO)
5841 SCHEME_V->interactive_repl = 1; 6159 SCHEME_V->interactive_repl = 1;
5842#endif
5843 6160
5844#if USE_PORTS 6161#if USE_PORTS
5845#if SHOW_ERROR_LINE 6162#if SHOW_ERROR_LINE
5846 SCHEME_V->load_stack[0].rep.stdio.curr_line = 0; 6163 SCHEME_V->load_stack[0].rep.stdio.curr_line = 0;
5847 6164
… …
5851#endif 6168#endif
5852 6169
5853 SCHEME_V->inport = SCHEME_V->loadport; 6170 SCHEME_V->inport = SCHEME_V->loadport;
5854 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i); 6171 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i);
5855 Eval_Cycle (SCHEME_A_ OP_T0LVL); 6172 Eval_Cycle (SCHEME_A_ OP_T0LVL);
6173
5856 set_typeflag (SCHEME_V->loadport, T_ATOM); 6174 set_typeflag (SCHEME_V->loadport, T_ATOM);
5857 6175
5858 if (SCHEME_V->retcode == 0) 6176 if (SCHEME_V->retcode == 0)
5859 SCHEME_V->retcode = SCHEME_V->nesting != 0; 6177 SCHEME_V->retcode = SCHEME_V->nesting != 0;
5860} 6178}
5861 6179
5862void 6180ecb_cold void
5863scheme_load_string (SCHEME_P_ const char *cmd) 6181scheme_load_string (SCHEME_P_ const char *cmd)
5864{ 6182{
6183#if USE_PORTs
5865 dump_stack_reset (SCHEME_A); 6184 dump_stack_reset (SCHEME_A);
5866 SCHEME_V->envir = SCHEME_V->global_env; 6185 SCHEME_V->envir = SCHEME_V->global_env;
5867 SCHEME_V->file_i = 0; 6186 SCHEME_V->file_i = 0;
5868 SCHEME_V->load_stack[0].kind = port_input | port_string; 6187 SCHEME_V->load_stack[0].kind = port_input | port_string;
5869 SCHEME_V->load_stack[0].rep.string.start = (char *)cmd; /* This func respects const */ 6188 SCHEME_V->load_stack[0].rep.string.start = (char *)cmd; /* This func respects const */
5870 SCHEME_V->load_stack[0].rep.string.past_the_end = (char *)cmd + strlen (cmd); 6189 SCHEME_V->load_stack[0].rep.string.past_the_end = (char *)cmd + strlen (cmd);
5871 SCHEME_V->load_stack[0].rep.string.curr = (char *)cmd; 6190 SCHEME_V->load_stack[0].rep.string.curr = (char *)cmd;
5872#if USE_PORTS
5873 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack); 6191 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack);
5874#endif
5875 SCHEME_V->retcode = 0; 6192 SCHEME_V->retcode = 0;
5876 SCHEME_V->interactive_repl = 0; 6193 SCHEME_V->interactive_repl = 0;
5877 SCHEME_V->inport = SCHEME_V->loadport; 6194 SCHEME_V->inport = SCHEME_V->loadport;
5878 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i); 6195 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i);
5879 Eval_Cycle (SCHEME_A_ OP_T0LVL); 6196 Eval_Cycle (SCHEME_A_ OP_T0LVL);
5880 set_typeflag (SCHEME_V->loadport, T_ATOM); 6197 set_typeflag (SCHEME_V->loadport, T_ATOM);
5881 6198
5882 if (SCHEME_V->retcode == 0) 6199 if (SCHEME_V->retcode == 0)
5883 SCHEME_V->retcode = SCHEME_V->nesting != 0; 6200 SCHEME_V->retcode = SCHEME_V->nesting != 0;
6201#else
6202 abort ();
6203#endif
5884} 6204}
5885 6205
5886void 6206ecb_cold void
5887scheme_define (SCHEME_P_ pointer envir, pointer symbol, pointer value) 6207scheme_define (SCHEME_P_ pointer envir, pointer symbol, pointer value)
5888{ 6208{
5889 pointer x; 6209 pointer x;
5890 6210
5891 x = find_slot_in_env (SCHEME_A_ envir, symbol, 0); 6211 x = find_slot_in_env (SCHEME_A_ envir, symbol, 0);
… …
5896 new_slot_spec_in_env (SCHEME_A_ envir, symbol, value); 6216 new_slot_spec_in_env (SCHEME_A_ envir, symbol, value);
5897} 6217}
5898 6218
5899#if !STANDALONE 6219#if !STANDALONE
5900 6220
5901void 6221ecb_cold void
5902scheme_register_foreign_func (scheme * sc, scheme_registerable * sr) 6222scheme_register_foreign_func (scheme * sc, scheme_registerable * sr)
5903{ 6223{
5904 scheme_define (SCHEME_A_ SCHEME_V->global_env, mk_symbol (SCHEME_A_ sr->name), mk_foreign_func (SCHEME_A_ sr->f)); 6224 scheme_define (SCHEME_A_ SCHEME_V->global_env, mk_symbol (SCHEME_A_ sr->name), mk_foreign_func (SCHEME_A_ sr->f));
5905} 6225}
5906 6226
5907void 6227ecb_cold void
5908scheme_register_foreign_func_list (scheme * sc, scheme_registerable * list, int count) 6228scheme_register_foreign_func_list (scheme * sc, scheme_registerable * list, int count)
5909{ 6229{
5910 int i; 6230 int i;
5911 6231
5912 for (i = 0; i < count; i++) 6232 for (i = 0; i < count; i++)
5913 scheme_register_foreign_func (SCHEME_A_ list + i); 6233 scheme_register_foreign_func (SCHEME_A_ list + i);
5914} 6234}
5915 6235
5916pointer 6236ecb_cold pointer
5917scheme_apply0 (SCHEME_P_ const char *procname) 6237scheme_apply0 (SCHEME_P_ const char *procname)
5918{ 6238{
5919 return scheme_eval (SCHEME_A_ cons (mk_symbol (SCHEME_A_ procname), NIL)); 6239 return scheme_eval (SCHEME_A_ cons (mk_symbol (SCHEME_A_ procname), NIL));
5920} 6240}
5921 6241
5922void 6242ecb_cold void
5923save_from_C_call (SCHEME_P) 6243save_from_C_call (SCHEME_P)
5924{ 6244{
5925 pointer saved_data = cons (car (S_SINK), 6245 pointer saved_data = cons (car (S_SINK),
5926 cons (SCHEME_V->envir, 6246 cons (SCHEME_V->envir,
5927 SCHEME_V->dump)); 6247 SCHEME_V->dump));
… …
5931 /* Truncate the dump stack so TS will return here when done, not 6251 /* Truncate the dump stack so TS will return here when done, not
5932 directly resume pre-C-call operations. */ 6252 directly resume pre-C-call operations. */
5933 dump_stack_reset (SCHEME_A); 6253 dump_stack_reset (SCHEME_A);
5934} 6254}
5935 6255
5936void 6256ecb_cold void
5937restore_from_C_call (SCHEME_P) 6257restore_from_C_call (SCHEME_P)
5938{ 6258{
5939 set_car (S_SINK, caar (SCHEME_V->c_nest)); 6259 set_car (S_SINK, caar (SCHEME_V->c_nest));
5940 SCHEME_V->envir = cadar (SCHEME_V->c_nest); 6260 SCHEME_V->envir = cadar (SCHEME_V->c_nest);
5941 SCHEME_V->dump = cdr (cdar (SCHEME_V->c_nest)); 6261 SCHEME_V->dump = cdr (cdar (SCHEME_V->c_nest));
5942 /* Pop */ 6262 /* Pop */
5943 SCHEME_V->c_nest = cdr (SCHEME_V->c_nest); 6263 SCHEME_V->c_nest = cdr (SCHEME_V->c_nest);
5944} 6264}
5945 6265
5946/* "func" and "args" are assumed to be already eval'ed. */ 6266/* "func" and "args" are assumed to be already eval'ed. */
5947pointer 6267ecb_cold pointer
5948scheme_call (SCHEME_P_ pointer func, pointer args) 6268scheme_call (SCHEME_P_ pointer func, pointer args)
5949{ 6269{
5950 int old_repl = SCHEME_V->interactive_repl; 6270 int old_repl = SCHEME_V->interactive_repl;
5951 6271
5952 SCHEME_V->interactive_repl = 0; 6272 SCHEME_V->interactive_repl = 0;
… …
5959 SCHEME_V->interactive_repl = old_repl; 6279 SCHEME_V->interactive_repl = old_repl;
5960 restore_from_C_call (SCHEME_A); 6280 restore_from_C_call (SCHEME_A);
5961 return SCHEME_V->value; 6281 return SCHEME_V->value;
5962} 6282}
5963 6283
5964pointer 6284ecb_cold pointer
5965scheme_eval (SCHEME_P_ pointer obj) 6285scheme_eval (SCHEME_P_ pointer obj)
5966{ 6286{
5967 int old_repl = SCHEME_V->interactive_repl; 6287 int old_repl = SCHEME_V->interactive_repl;
5968 6288
5969 SCHEME_V->interactive_repl = 0; 6289 SCHEME_V->interactive_repl = 0;
… …
5981 6301
5982/* ========== Main ========== */ 6302/* ========== Main ========== */
5983 6303
5984#if STANDALONE 6304#if STANDALONE
5985 6305
5986int 6306ecb_cold int
5987main (int argc, char **argv) 6307main (int argc, char **argv)
5988{ 6308{
5989# if USE_MULTIPLICITY 6309# if USE_MULTIPLICITY
5990 scheme ssc; 6310 scheme ssc;
5991 scheme *const SCHEME_V = &ssc; 6311 scheme *const SCHEME_V = &ssc;
… …
5993# endif 6313# endif
5994 int fin; 6314 int fin;
5995 char *file_name = InitFile; 6315 char *file_name = InitFile;
5996 int retcode; 6316 int retcode;
5997 int isfile = 1; 6317 int isfile = 1;
6318#if EXPERIMENT
5998 system ("ps v $PPID");//D 6319 system ("ps v $PPID");
6320#endif
5999 6321
6000 if (argc == 2 && strcmp (argv[1], "-?") == 0) 6322 if (argc == 2 && strcmp (argv[1], "-?") == 0)
6001 { 6323 {
6002 xwrstr ("Usage: tinyscheme -?\n"); 6324 putstr (SCHEME_A_ "Usage: tinyscheme -?\n");
6003 xwrstr ("or: tinyscheme [<file1> <file2> ...]\n"); 6325 putstr (SCHEME_A_ "or: tinyscheme [<file1> <file2> ...]\n");
6004 xwrstr ("followed by\n"); 6326 putstr (SCHEME_A_ "followed by\n");
6005 xwrstr (" -1 <file> [<arg1> <arg2> ...]\n"); 6327 putstr (SCHEME_A_ " -1 <file> [<arg1> <arg2> ...]\n");
6006 xwrstr (" -c <Scheme commands> [<arg1> <arg2> ...]\n"); 6328 putstr (SCHEME_A_ " -c <Scheme commands> [<arg1> <arg2> ...]\n");
6007 xwrstr ("assuming that the executable is named tinyscheme.\n"); 6329 putstr (SCHEME_A_ "assuming that the executable is named tinyscheme.\n");
6008 xwrstr ("Use - as filename for stdin.\n"); 6330 putstr (SCHEME_A_ "Use - as filename for stdin.\n");
6009 return 1; 6331 return 1;
6010 } 6332 }
6011 6333
6012 if (!scheme_init (SCHEME_A)) 6334 if (!scheme_init (SCHEME_A))
6013 { 6335 {
6014 xwrstr ("Could not initialize!\n"); 6336 putstr (SCHEME_A_ "Could not initialize!\n");
6015 return 2; 6337 return 2;
6016 } 6338 }
6017 6339
6018# if USE_PORTS 6340# if USE_PORTS
6019 scheme_set_input_port_file (SCHEME_A_ STDIN_FILENO); 6341 scheme_set_input_port_file (SCHEME_A_ STDIN_FILENO);
… …
6032 } 6354 }
6033#endif 6355#endif
6034 6356
6035 do 6357 do
6036 { 6358 {
6037#if USE_PORTS
6038 if (strcmp (file_name, "-") == 0) 6359 if (strcmp (file_name, "-") == 0)
6039 fin = STDIN_FILENO; 6360 fin = STDIN_FILENO;
6040 else if (strcmp (file_name, "-1") == 0 || strcmp (file_name, "-c") == 0) 6361 else if (strcmp (file_name, "-1") == 0 || strcmp (file_name, "-c") == 0)
6041 { 6362 {
6042 pointer args = NIL; 6363 pointer args = NIL;
… …
6060 scheme_define (SCHEME_A_ SCHEME_V->global_env, mk_symbol (SCHEME_A_ "*args*"), args); 6381 scheme_define (SCHEME_A_ SCHEME_V->global_env, mk_symbol (SCHEME_A_ "*args*"), args);
6061 6382
6062 } 6383 }
6063 else 6384 else
6064 fin = open (file_name, O_RDONLY); 6385 fin = open (file_name, O_RDONLY);
6065#endif
6066 6386
6067 if (isfile && fin < 0) 6387 if (isfile && fin < 0)
6068 { 6388 {
6069 xwrstr ("Could not open file "); xwrstr (file_name); xwrstr ("\n"); 6389 putstr (SCHEME_A_ "Could not open file ");
6390 putstr (SCHEME_A_ file_name);
6391 putcharacter (SCHEME_A_ '\n');
6070 } 6392 }
6071 else 6393 else
6072 { 6394 {
6073 if (isfile) 6395 if (isfile)
6074 scheme_load_named_file (SCHEME_A_ fin, file_name); 6396 scheme_load_named_file (SCHEME_A_ fin, file_name);
6075 else 6397 else
6076 scheme_load_string (SCHEME_A_ file_name); 6398 scheme_load_string (SCHEME_A_ file_name);
6077 6399
6078#if USE_PORTS
6079 if (!isfile || fin != STDIN_FILENO) 6400 if (!isfile || fin != STDIN_FILENO)
6080 { 6401 {
6081 if (SCHEME_V->retcode != 0) 6402 if (SCHEME_V->retcode != 0)
6082 { 6403 {
6083 xwrstr ("Errors encountered reading "); xwrstr (file_name); xwrstr ("\n"); 6404 putstr (SCHEME_A_ "Errors encountered reading ");
6405 putstr (SCHEME_A_ file_name);
6406 putcharacter (SCHEME_A_ '\n');
6084 } 6407 }
6085 6408
6086 if (isfile) 6409 if (isfile)
6087 close (fin); 6410 close (fin);
6088 } 6411 }
6089#endif
6090 } 6412 }
6091 6413
6092 file_name = *argv++; 6414 file_name = *argv++;
6093 } 6415 }
6094 while (file_name != 0); 6416 while (file_name != 0);

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines