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.40 by root, Mon Nov 30 05:19:01 2015 UTC vs.
Revision 1.66 by root, Mon Dec 7 18:10:57 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 PAGE_SIZE 4096 /* does not work on sparc/alpha */ 21#define _POSIX_C_SOURCE 200201
22#include "malloc.c" 22#define _XOPEN_SOURCE 600
23#define _GNU_SOURCE 1 /* for malloc mremap */
23 24
24#define SCHEME_SOURCE 25#define SCHEME_SOURCE
25#include "scheme-private.h" 26#include "scheme-private.h"
26#ifndef WIN32 27#ifndef WIN32
27# include <unistd.h> 28# include <unistd.h>
28#endif 29#endif
29#if USE_MATH 30#if USE_MATH
30# include <math.h> 31# include <math.h>
31#endif 32#endif
32 33
34#define ECB_NO_THREADS 1
33#include "ecb.h" 35#include "ecb.h"
34 36
35#include <sys/types.h> 37#include <sys/types.h>
36#include <sys/stat.h> 38#include <sys/stat.h>
37#include <fcntl.h> 39#include <fcntl.h>
… …
45#include <string.h> 47#include <string.h>
46 48
47#include <limits.h> 49#include <limits.h>
48#include <inttypes.h> 50#include <inttypes.h>
49#include <float.h> 51#include <float.h>
50//#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
51 60
52#if '1' != '0' + 1 \ 61#if '1' != '0' + 1 \
53 || '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 \
54 || '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 \
55 || '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 \
… …
77 86
78#define BACKQUOTE '`' 87#define BACKQUOTE '`'
79#define WHITESPACE " \t\r\n\v\f" 88#define WHITESPACE " \t\r\n\v\f"
80#define DELIMITERS "()\";" WHITESPACE 89#define DELIMITERS "()\";" WHITESPACE
81 90
82#define NIL (&SCHEME_V->xNIL) //TODO: make this 0? 91#define NIL POINTER (&SCHEME_V->xNIL)
83#define S_T (&SCHEME_V->xT) //TODO: magic ptr value? 92#define S_T POINTER (&SCHEME_V->xT)
84#define S_F (&SCHEME_V->xF) //TODO: magic ptr value? 93#define S_F POINTER (&SCHEME_V->xF)
85#define S_SINK (&SCHEME_V->xsink) 94#define S_SINK POINTER (&SCHEME_V->xsink)
86#define S_EOF (&SCHEME_V->xEOF_OBJ) 95#define S_EOF POINTER (&SCHEME_V->xEOF_OBJ)
87 96
88#if !USE_MULTIPLICITY 97#if !USE_MULTIPLICITY
89static scheme sc; 98static scheme sc;
90#endif 99#endif
91 100
92static void 101ecb_cold static void
93xbase (char *s, long n, int base) 102xbase (char *s, long n, int base)
94{ 103{
95 if (n < 0) 104 if (n < 0)
96 { 105 {
97 *s++ = '-'; 106 *s++ = '-';
… …
99 } 108 }
100 109
101 char *p = s; 110 char *p = s;
102 111
103 do { 112 do {
104 *p++ = '0' + n % base; 113 *p++ = "0123456789abcdef"[n % base];
105 n /= base; 114 n /= base;
106 } while (n); 115 } while (n);
107 116
108 *p-- = 0; 117 *p-- = 0;
109 118
… …
112 char x = *s; *s = *p; *p = x; 121 char x = *s; *s = *p; *p = x;
113 --p; ++s; 122 --p; ++s;
114 } 123 }
115} 124}
116 125
117static void 126ecb_cold static void
118xnum (char *s, long n) 127xnum (char *s, long n)
119{ 128{
120 xbase (s, n, 10); 129 xbase (s, n, 10);
121} 130}
122 131
123static void 132ecb_cold static void
124xwrstr (const char *s) 133putnum (SCHEME_P_ long n)
125{
126 write (1, s, strlen (s));
127}
128
129static void
130xwrnum (long n)
131{ 134{
132 char buf[64]; 135 char buf[64];
133 136
134 xnum (buf, n); 137 xnum (buf, n);
135 xwrstr (buf); 138 putstr (SCHEME_A_ buf);
136} 139}
140
141#if USE_CHAR_CLASSIFIERS
142#include <ctype.h>
143#else
137 144
138static char 145static char
139xtoupper (char c) 146xtoupper (char c)
140{ 147{
141 if (c >= 'a' && c <= 'z') 148 if (c >= 'a' && c <= 'z')
… …
161 168
162#define toupper(c) xtoupper (c) 169#define toupper(c) xtoupper (c)
163#define tolower(c) xtolower (c) 170#define tolower(c) xtolower (c)
164#define isdigit(c) xisdigit (c) 171#define isdigit(c) xisdigit (c)
165 172
173#endif
174
166#if USE_IGNORECASE 175#if USE_IGNORECASE
167static const char * 176ecb_cold static const char *
168xstrlwr (char *s) 177xstrlwr (char *s)
169{ 178{
170 const char *p = s; 179 const char *p = s;
171 180
172 while (*s) 181 while (*s)
… …
185# define stricmp(a,b) strcmp (a, b) 194# define stricmp(a,b) strcmp (a, b)
186# define strlwr(s) (s) 195# define strlwr(s) (s)
187#endif 196#endif
188 197
189#ifndef prompt 198#ifndef prompt
190# define prompt "ts> " 199# define prompt "ms> "
191#endif 200#endif
192 201
193#ifndef InitFile 202#ifndef InitFile
194# define InitFile "init.scm" 203# define InitFile "init.scm"
195#endif 204#endif
196 205
197#ifndef FIRST_CELLSEGS
198# define FIRST_CELLSEGS 3
199#endif
200
201enum scheme_types 206enum scheme_types
202{ 207{
203 T_INTEGER, 208 T_INTEGER,
209 T_CHARACTER,
204 T_REAL, 210 T_REAL,
205 T_STRING, 211 T_STRING,
206 T_SYMBOL, 212 T_SYMBOL,
207 T_PROC, 213 T_PROC,
208 T_PAIR, /* also used for free cells */ 214 T_PAIR, /* also used for free cells */
209 T_CLOSURE, 215 T_CLOSURE,
216 T_BYTECODE, // temp
217 T_MACRO,
210 T_CONTINUATION, 218 T_CONTINUATION,
211 T_FOREIGN, 219 T_FOREIGN,
212 T_CHARACTER,
213 T_PORT, 220 T_PORT,
214 T_VECTOR, 221 T_VECTOR,
215 T_MACRO,
216 T_PROMISE, 222 T_PROMISE,
217 T_ENVIRONMENT, 223 T_ENVIRONMENT,
218 /* one more... */ 224 T_SPECIAL, // #t, #f, '(), eof-object
225
219 T_NUM_SYSTEM_TYPES 226 T_NUM_SYSTEM_TYPES
220}; 227};
221 228
222#define T_MASKTYPE 0x000f 229#define T_MASKTYPE 0x001f
223#define T_SYNTAX 0x0010 230#define T_SYNTAX 0x0020
224#define T_IMMUTABLE 0x0020 231#define T_IMMUTABLE 0x0040
225#define T_ATOM 0x0040 /* only for gc */ 232#define T_ATOM 0x0080 /* only for gc */
226#define T_MARK 0x0080 /* only for gc */ 233//#define T_MARK 0x0080 /* only for gc */
227 234
228/* num, for generic arithmetic */ 235/* num, for generic arithmetic */
229struct num 236struct num
230{ 237{
231 IVALUE ivalue; 238 IVALUE ivalue;
… …
256static num num_op (enum num_op op, num a, num b); 263static num num_op (enum num_op op, num a, num b);
257static num num_intdiv (num a, num b); 264static num num_intdiv (num a, num b);
258static num num_rem (num a, num b); 265static num num_rem (num a, num b);
259static num num_mod (num a, num b); 266static num num_mod (num a, num b);
260 267
261#if USE_MATH
262static double round_per_R5RS (double x);
263#endif
264static int is_zero_rvalue (RVALUE x); 268static int is_zero_rvalue (RVALUE x);
265 269
266static num num_zero; 270static num num_zero;
267static num num_one; 271static num num_one;
268 272
273/* convert "pointer" to cell* / cell* to pointer */
274#define CELL(p) ((struct cell *)(p) + 0)
275#define POINTER(c) ((void *)((c) - 0))
276
269/* macros for cell operations */ 277/* macros for cell operations */
270#define typeflag(p) ((p)->flag + 0) 278#define typeflag(p) (CELL(p)->flag + 0)
271#define set_typeflag(p,v) ((p)->flag = (v)) 279#define set_typeflag(p,v) (CELL(p)->flag = (v))
272#define type(p) (typeflag (p) & T_MASKTYPE) 280#define type(p) (typeflag (p) & T_MASKTYPE)
273 281
274INTERFACE int 282INTERFACE int
275is_string (pointer p) 283is_string (pointer p)
276{ 284{
277 return type (p) == T_STRING; 285 return type (p) == T_STRING;
278} 286}
279 287
280#define strvalue(p) ((p)->object.string.svalue) 288#define strvalue(p) (CELL(p)->object.string.svalue)
281#define strlength(p) ((p)->object.string.length) 289#define strlength(p) (CELL(p)->object.string.length)
282 290
283INTERFACE int 291INTERFACE int
284is_vector (pointer p) 292is_vector (pointer p)
285{ 293{
286 return type (p) == T_VECTOR; 294 return type (p) == T_VECTOR;
287} 295}
288 296
289#define vecvalue(p) ((p)->object.vector.vvalue) 297#define vecvalue(p) (CELL(p)->object.vector.vvalue)
290#define veclength(p) ((p)->object.vector.length) 298#define veclength(p) (CELL(p)->object.vector.length)
291INTERFACE void fill_vector (pointer vec, uint32_t start, pointer obj); 299INTERFACE void fill_vector (pointer vec, uint32_t start, pointer obj);
292INTERFACE pointer vector_get (pointer vec, uint32_t ielem); 300INTERFACE pointer vector_get (pointer vec, uint32_t ielem);
293INTERFACE void vector_set (pointer vec, uint32_t ielem, pointer a); 301INTERFACE void vector_set (pointer vec, uint32_t ielem, pointer a);
294 302
295INTERFACE int 303INTERFACE int
… …
321string_value (pointer p) 329string_value (pointer p)
322{ 330{
323 return strvalue (p); 331 return strvalue (p);
324} 332}
325 333
326#define ivalue_unchecked(p) (p)->object.ivalue 334#define ivalue_unchecked(p) CELL(p)->object.ivalue
327#define set_ivalue(p,v) (p)->object.ivalue = (v) 335#define set_ivalue(p,v) CELL(p)->object.ivalue = (v)
328 336
329#if USE_REAL 337#if USE_REAL
330#define rvalue_unchecked(p) (p)->object.rvalue 338#define rvalue_unchecked(p) CELL(p)->object.rvalue
331#define set_rvalue(p,v) (p)->object.rvalue = (v) 339#define set_rvalue(p,v) CELL(p)->object.rvalue = (v)
332#else 340#else
333#define rvalue_unchecked(p) (p)->object.ivalue 341#define rvalue_unchecked(p) CELL(p)->object.ivalue
334#define set_rvalue(p,v) (p)->object.ivalue = (v) 342#define set_rvalue(p,v) CELL(p)->object.ivalue = (v)
335#endif 343#endif
336 344
337INTERFACE long 345INTERFACE long
338charvalue (pointer p) 346charvalue (pointer p)
339{ 347{
340 return ivalue_unchecked (p); 348 return ivalue_unchecked (p);
341} 349}
342 350
351#define port(p) CELL(p)->object.port
352#define set_port(p,v) port(p) = (v)
343INTERFACE int 353INTERFACE int
344is_port (pointer p) 354is_port (pointer p)
345{ 355{
346 return type (p) == T_PORT; 356 return type (p) == T_PORT;
347} 357}
348 358
349INTERFACE int 359INTERFACE int
350is_inport (pointer p) 360is_inport (pointer p)
351{ 361{
352 return is_port (p) && p->object.port->kind & port_input; 362 return is_port (p) && port (p)->kind & port_input;
353} 363}
354 364
355INTERFACE int 365INTERFACE int
356is_outport (pointer p) 366is_outport (pointer p)
357{ 367{
358 return is_port (p) && p->object.port->kind & port_output; 368 return is_port (p) && port (p)->kind & port_output;
359} 369}
360 370
361INTERFACE int 371INTERFACE int
362is_pair (pointer p) 372is_pair (pointer p)
363{ 373{
364 return type (p) == T_PAIR; 374 return type (p) == T_PAIR;
365} 375}
366 376
367#define car(p) ((p)->object.cons.car + 0) 377#define car(p) (POINTER (CELL(p)->object.cons.car))
368#define cdr(p) ((p)->object.cons.cdr + 0) 378#define cdr(p) (POINTER (CELL(p)->object.cons.cdr))
369 379
370static pointer caar (pointer p) { return car (car (p)); } 380static pointer caar (pointer p) { return car (car (p)); }
371static pointer cadr (pointer p) { return car (cdr (p)); } 381static pointer cadr (pointer p) { return car (cdr (p)); }
372static pointer cdar (pointer p) { return cdr (car (p)); } 382static pointer cdar (pointer p) { return cdr (car (p)); }
373static pointer cddr (pointer p) { return cdr (cdr (p)); } 383static pointer cddr (pointer p) { return cdr (cdr (p)); }
374 384
375static pointer cadar (pointer p) { return car (cdr (car (p))); } 385static pointer cadar (pointer p) { return car (cdr (car (p))); }
376static pointer caddr (pointer p) { return car (cdr (cdr (p))); } 386static pointer caddr (pointer p) { return car (cdr (cdr (p))); }
377static pointer cdaar (pointer p) { return cdr (car (car (p))); } 387static pointer cdaar (pointer p) { return cdr (car (car (p))); }
378 388
389static pointer cadddr (pointer p) { return car (car (car (cdr (p)))); }
390
379INTERFACE void 391INTERFACE void
380set_car (pointer p, pointer q) 392set_car (pointer p, pointer q)
381{ 393{
382 p->object.cons.car = q; 394 CELL(p)->object.cons.car = CELL (q);
383} 395}
384 396
385INTERFACE void 397INTERFACE void
386set_cdr (pointer p, pointer q) 398set_cdr (pointer p, pointer q)
387{ 399{
388 p->object.cons.cdr = q; 400 CELL(p)->object.cons.cdr = CELL (q);
389} 401}
390 402
391INTERFACE pointer 403INTERFACE pointer
392pair_car (pointer p) 404pair_car (pointer p)
393{ 405{
… …
411{ 423{
412 return strvalue (p); 424 return strvalue (p);
413} 425}
414 426
415#if USE_PLIST 427#if USE_PLIST
428#error plists are broken because symbols are no longer pairs
429#define symprop(p) cdr(p)
416SCHEME_EXPORT int 430SCHEME_EXPORT int
417hasprop (pointer p) 431hasprop (pointer p)
418{ 432{
419 return typeflag (p) & T_SYMBOL; 433 return typeflag (p) & T_SYMBOL;
420} 434}
421
422# define symprop(p) cdr(p)
423#endif 435#endif
424 436
425INTERFACE int 437INTERFACE int
426is_syntax (pointer p) 438is_syntax (pointer p)
427{ 439{
… …
499 511
500#define is_atom(p) (typeflag (p) & T_ATOM) 512#define is_atom(p) (typeflag (p) & T_ATOM)
501#define setatom(p) set_typeflag ((p), typeflag (p) | T_ATOM) 513#define setatom(p) set_typeflag ((p), typeflag (p) | T_ATOM)
502#define clratom(p) set_typeflag ((p), typeflag (p) & ~T_ATOM) 514#define clratom(p) set_typeflag ((p), typeflag (p) & ~T_ATOM)
503 515
516#if 1
517#define is_mark(p) (CELL(p)->mark)
518#define setmark(p) (CELL(p)->mark = 1)
519#define clrmark(p) (CELL(p)->mark = 0)
520#else
504#define is_mark(p) (typeflag (p) & T_MARK) 521#define is_mark(p) (typeflag (p) & T_MARK)
505#define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK) 522#define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK)
506#define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK) 523#define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK)
524#endif
507 525
508INTERFACE int 526INTERFACE int
509is_immutable (pointer p) 527is_immutable (pointer p)
510{ 528{
511 return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING; 529 return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING;
… …
523 proper list: length 541 proper list: length
524 circular list: -1 542 circular list: -1
525 not even a pair: -2 543 not even a pair: -2
526 dotted list: -2 minus length before dot 544 dotted list: -2 minus length before dot
527*/ 545*/
528INTERFACE int 546ecb_hot INTERFACE int
529list_length (SCHEME_P_ pointer a) 547list_length (SCHEME_P_ pointer a)
530{ 548{
531 int i = 0; 549 int i = 0;
532 pointer slow, fast; 550 pointer slow, fast;
533 551
… …
572{ 590{
573 return list_length (SCHEME_A_ a) >= 0; 591 return list_length (SCHEME_A_ a) >= 0;
574} 592}
575 593
576#if USE_CHAR_CLASSIFIERS 594#if USE_CHAR_CLASSIFIERS
595
577ecb_inline int 596ecb_inline int
578Cisalpha (int c) 597Cisalpha (int c)
579{ 598{
580 return isascii (c) && isalpha (c); 599 return isascii (c) && isalpha (c);
581} 600}
… …
639 "gs", 658 "gs",
640 "rs", 659 "rs",
641 "us" 660 "us"
642}; 661};
643 662
644static int 663ecb_cold static int
645is_ascii_name (const char *name, int *pc) 664is_ascii_name (const char *name, int *pc)
646{ 665{
647 int i; 666 int i;
648 667
649 for (i = 0; i < 32; i++) 668 for (i = 0; i < 32; i++)
… …
668 687
669static int file_push (SCHEME_P_ const char *fname); 688static int file_push (SCHEME_P_ const char *fname);
670static void file_pop (SCHEME_P); 689static void file_pop (SCHEME_P);
671static int file_interactive (SCHEME_P); 690static int file_interactive (SCHEME_P);
672ecb_inline int is_one_of (const char *s, int c); 691ecb_inline int is_one_of (const char *s, int c);
673static int alloc_cellseg (SCHEME_P_ int n); 692static int alloc_cellseg (SCHEME_P);
674ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b); 693ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b);
675static void finalize_cell (SCHEME_P_ pointer a); 694static void finalize_cell (SCHEME_P_ pointer a);
676static int count_consecutive_cells (pointer x, int needed);
677static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all); 695static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all);
678static pointer mk_number (SCHEME_P_ const num n); 696static pointer mk_number (SCHEME_P_ const num n);
679static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill); 697static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill);
680static pointer mk_vector (SCHEME_P_ uint32_t len); 698static pointer mk_vector (SCHEME_P_ uint32_t len);
681static pointer mk_atom (SCHEME_P_ char *q); 699static pointer mk_atom (SCHEME_P_ char *q);
682static pointer mk_sharp_const (SCHEME_P_ char *name); 700static pointer mk_sharp_const (SCHEME_P_ char *name);
683 701
702static pointer mk_port (SCHEME_P_ port *p);
703
684#if USE_PORTS 704#if USE_PORTS
685static pointer mk_port (SCHEME_P_ port *p);
686static pointer port_from_filename (SCHEME_P_ const char *fn, int prop); 705static pointer port_from_filename (SCHEME_P_ const char *fn, int prop);
687static pointer port_from_file (SCHEME_P_ int, int prop); 706static pointer port_from_file (SCHEME_P_ int, int prop);
688static pointer port_from_string (SCHEME_P_ char *start, char *past_the_end, int prop); 707static pointer port_from_string (SCHEME_P_ char *start, char *past_the_end, int prop);
689static port *port_rep_from_filename (SCHEME_P_ const char *fn, int prop); 708static port *port_rep_from_filename (SCHEME_P_ const char *fn, int prop);
690static port *port_rep_from_file (SCHEME_P_ int, int prop); 709static port *port_rep_from_file (SCHEME_P_ int, int prop);
691static port *port_rep_from_string (SCHEME_P_ char *start, char *past_the_end, int prop); 710static port *port_rep_from_string (SCHEME_P_ char *start, char *past_the_end, int prop);
692static void port_close (SCHEME_P_ pointer p, int flag); 711static void port_close (SCHEME_P_ pointer p, int flag);
693#endif 712#endif
713
694static void mark (pointer a); 714static void mark (pointer a);
695static void gc (SCHEME_P_ pointer a, pointer b); 715static void gc (SCHEME_P_ pointer a, pointer b);
696static int basic_inchar (port *pt); 716static int basic_inchar (port *pt);
697static int inchar (SCHEME_P); 717static int inchar (SCHEME_P);
698static void backchar (SCHEME_P_ int c); 718static void backchar (SCHEME_P_ int c);
699static char *readstr_upto (SCHEME_P_ int skip, const char *delim); 719static char *readstr_upto (SCHEME_P_ int skip, const char *delim);
700static pointer readstrexp (SCHEME_P_ char delim); 720static pointer readstrexp (SCHEME_P_ char delim);
701ecb_inline int skipspace (SCHEME_P); 721static int skipspace (SCHEME_P);
702static int token (SCHEME_P); 722static int token (SCHEME_P);
703static void printslashstring (SCHEME_P_ char *s, int len); 723static void printslashstring (SCHEME_P_ char *s, int len);
704static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen); 724static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen);
705static void printatom (SCHEME_P_ pointer l, int f); 725static void printatom (SCHEME_P_ pointer l, int f);
706static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op); 726static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op);
… …
872 } 892 }
873 893
874 return ret; 894 return ret;
875} 895}
876 896
877#if USE_MATH
878
879/* Round to nearest. Round to even if midway */
880static double
881round_per_R5RS (double x)
882{
883 double fl = floor (x);
884 double ce = ceil (x);
885 double dfl = x - fl;
886 double dce = ce - x;
887
888 if (dfl > dce)
889 return ce;
890 else if (dfl < dce)
891 return fl;
892 else
893 {
894 if (fmod (fl, 2) == 0) /* I imagine this holds */
895 return fl;
896 else
897 return ce;
898 }
899}
900#endif
901
902static int 897static int
903is_zero_rvalue (RVALUE x) 898is_zero_rvalue (RVALUE x)
904{ 899{
905 return x == 0; 900 return x == 0;
906#if 0 901#if 0
… …
911#endif 906#endif
912#endif 907#endif
913} 908}
914 909
915/* allocate new cell segment */ 910/* allocate new cell segment */
916static int 911ecb_cold static int
917alloc_cellseg (SCHEME_P_ int n) 912alloc_cellseg (SCHEME_P)
918{ 913{
919 pointer newp; 914 struct cell *newp;
920 pointer last; 915 struct cell *last;
921 pointer p; 916 struct cell *p;
922 char *cp; 917 char *cp;
923 long i; 918 long i;
924 int k; 919 int k;
925 920
926 static int segsize = CELL_SEGSIZE >> 1; 921 static int segsize = CELL_SEGSIZE >> 1;
927 segsize <<= 1; 922 segsize <<= 1;
928 923
929 for (k = 0; k < n; k++)
930 {
931 if (SCHEME_V->last_cell_seg >= CELL_NSEGMENT - 1)
932 return k;
933
934 cp = malloc (segsize * sizeof (struct cell)); 924 cp = malloc (segsize * sizeof (struct cell));
935 925
936 if (!cp && USE_ERROR_CHECKING) 926 if (!cp && USE_ERROR_CHECKING)
937 return k; 927 return k;
938 928
939 i = ++SCHEME_V->last_cell_seg; 929 i = ++SCHEME_V->last_cell_seg;
940 SCHEME_V->alloc_seg[i] = cp;
941 930
942 newp = (pointer)cp; 931 newp = (struct cell *)cp;
943 SCHEME_V->cell_seg[i] = newp; 932 SCHEME_V->cell_seg[i] = newp;
944 SCHEME_V->cell_segsize[i] = segsize; 933 SCHEME_V->cell_segsize[i] = segsize;
945 SCHEME_V->fcells += segsize; 934 SCHEME_V->fcells += segsize;
946 last = newp + segsize - 1; 935 last = newp + segsize - 1;
947 936
948 for (p = newp; p <= last; p++) 937 for (p = newp; p <= last; p++)
949 { 938 {
939 pointer cp = POINTER (p);
940 clrmark (cp);
950 set_typeflag (p, T_PAIR); 941 set_typeflag (cp, T_PAIR);
951 set_car (p, NIL); 942 set_car (cp, NIL);
952 set_cdr (p, p + 1); 943 set_cdr (cp, POINTER (p + 1));
953 } 944 }
954 945
955 set_cdr (last, SCHEME_V->free_cell); 946 set_cdr (POINTER (last), SCHEME_V->free_cell);
956 SCHEME_V->free_cell = newp; 947 SCHEME_V->free_cell = POINTER (newp);
957 }
958 948
959 return n; 949 return 1;
960} 950}
961 951
962/* get new cell. parameter a, b is marked by gc. */ 952/* get new cell. parameter a, b is marked by gc. */
963ecb_inline pointer 953ecb_inline pointer
964get_cell_x (SCHEME_P_ pointer a, pointer b) 954get_cell_x (SCHEME_P_ pointer a, pointer b)
… …
968 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 958 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
969 return S_SINK; 959 return S_SINK;
970 960
971 if (SCHEME_V->free_cell == NIL) 961 if (SCHEME_V->free_cell == NIL)
972 { 962 {
973 const int min_to_be_recovered = SCHEME_V->last_cell_seg < 128 ? 128 * 8 : SCHEME_V->last_cell_seg * 8; 963 const int min_to_be_recovered = SCHEME_V->cell_segsize [SCHEME_V->last_cell_seg] >> 2;
974 964
975 gc (SCHEME_A_ a, b); 965 gc (SCHEME_A_ a, b);
976 966
977 if (SCHEME_V->fcells < min_to_be_recovered || SCHEME_V->free_cell == NIL) 967 if (SCHEME_V->fcells < min_to_be_recovered || SCHEME_V->free_cell == NIL)
978 { 968 {
979 /* if only a few recovered, get more to avoid fruitless gc's */ 969 /* if only a few recovered, get more to avoid fruitless gc's */
980 if (!alloc_cellseg (SCHEME_A_ 1) && SCHEME_V->free_cell == NIL) 970 if (!alloc_cellseg (SCHEME_A) && SCHEME_V->free_cell == NIL)
981 { 971 {
982#if USE_ERROR_CHECKING 972#if USE_ERROR_CHECKING
983 SCHEME_V->no_memory = 1; 973 SCHEME_V->no_memory = 1;
984 return S_SINK; 974 return S_SINK;
985#endif 975#endif
… …
997 } 987 }
998} 988}
999 989
1000/* To retain recent allocs before interpreter knows about them - 990/* To retain recent allocs before interpreter knows about them -
1001 Tehom */ 991 Tehom */
1002 992ecb_hot static void
1003static void
1004push_recent_alloc (SCHEME_P_ pointer recent, pointer extra) 993push_recent_alloc (SCHEME_P_ pointer recent, pointer extra)
1005{ 994{
1006 pointer holder = get_cell_x (SCHEME_A_ recent, extra); 995 pointer holder = get_cell_x (SCHEME_A_ recent, extra);
1007 996
1008 set_typeflag (holder, T_PAIR); 997 set_typeflag (holder, T_PAIR);
… …
1010 set_car (holder, recent); 999 set_car (holder, recent);
1011 set_cdr (holder, car (S_SINK)); 1000 set_cdr (holder, car (S_SINK));
1012 set_car (S_SINK, holder); 1001 set_car (S_SINK, holder);
1013} 1002}
1014 1003
1015static pointer 1004ecb_hot static pointer
1016get_cell (SCHEME_P_ pointer a, pointer b) 1005get_cell (SCHEME_P_ pointer a, pointer b)
1017{ 1006{
1018 pointer cell = get_cell_x (SCHEME_A_ a, b); 1007 pointer cell = get_cell_x (SCHEME_A_ a, b);
1019 1008
1020 /* For right now, include "a" and "b" in "cell" so that gc doesn't 1009 /* For right now, include "a" and "b" in "cell" so that gc doesn't
… …
1029} 1018}
1030 1019
1031static pointer 1020static pointer
1032get_vector_object (SCHEME_P_ uint32_t len, pointer init) 1021get_vector_object (SCHEME_P_ uint32_t len, pointer init)
1033{ 1022{
1034 pointer v = get_cell_x (SCHEME_A_ 0, 0); 1023 pointer v = get_cell_x (SCHEME_A_ NIL, NIL);
1035 pointer *e = malloc (len * sizeof (pointer)); 1024 pointer *e = malloc (len * sizeof (pointer));
1036 1025
1037 if (!e && USE_ERROR_CHECKING) 1026 if (!e && USE_ERROR_CHECKING)
1038 return S_SINK; 1027 return S_SINK;
1039 1028
1040 /* Record it as a vector so that gc understands it. */ 1029 /* Record it as a vector so that gc understands it. */
1041 set_typeflag (v, T_VECTOR | T_ATOM); 1030 set_typeflag (v, T_VECTOR | T_ATOM);
1042 1031
1043 v->object.vector.vvalue = e; 1032 CELL(v)->object.vector.vvalue = e;
1044 v->object.vector.length = len; 1033 CELL(v)->object.vector.length = len;
1045 fill_vector (v, 0, init); 1034 fill_vector (v, 0, init);
1046 push_recent_alloc (SCHEME_A_ v, NIL); 1035 push_recent_alloc (SCHEME_A_ v, NIL);
1047 1036
1048 return v; 1037 return v;
1049} 1038}
… …
1058static void 1047static void
1059check_cell_alloced (pointer p, int expect_alloced) 1048check_cell_alloced (pointer p, int expect_alloced)
1060{ 1049{
1061 /* Can't use putstr(SCHEME_A_ str) because callers have no access to sc. */ 1050 /* Can't use putstr(SCHEME_A_ str) because callers have no access to sc. */
1062 if (typeflag (p) & !expect_alloced) 1051 if (typeflag (p) & !expect_alloced)
1063 xwrstr ("Cell is already allocated!\n"); 1052 putstr (SCHEME_A_ "Cell is already allocated!\n");
1064 1053
1065 if (!(typeflag (p)) & expect_alloced) 1054 if (!(typeflag (p)) & expect_alloced)
1066 xwrstr ("Cell is not allocated!\n"); 1055 putstr (SCHEME_A_ "Cell is not allocated!\n");
1067} 1056}
1068 1057
1069static void 1058static void
1070check_range_alloced (pointer p, int n, int expect_alloced) 1059check_range_alloced (pointer p, int n, int expect_alloced)
1071{ 1060{
… …
1077#endif 1066#endif
1078 1067
1079/* Medium level cell allocation */ 1068/* Medium level cell allocation */
1080 1069
1081/* get new cons cell */ 1070/* get new cons cell */
1082pointer 1071ecb_hot static pointer
1083xcons (SCHEME_P_ pointer a, pointer b, int immutable) 1072xcons (SCHEME_P_ pointer a, pointer b)
1084{ 1073{
1085 pointer x = get_cell (SCHEME_A_ a, b); 1074 pointer x = get_cell (SCHEME_A_ a, b);
1086 1075
1087 set_typeflag (x, T_PAIR); 1076 set_typeflag (x, T_PAIR);
1088
1089 if (immutable)
1090 setimmutable (x);
1091 1077
1092 set_car (x, a); 1078 set_car (x, a);
1093 set_cdr (x, b); 1079 set_cdr (x, b);
1094 1080
1095 return x; 1081 return x;
1096} 1082}
1097 1083
1098/* ========== oblist implementation ========== */
1099
1100static pointer 1084ecb_hot static pointer
1085ximmutable_cons (SCHEME_P_ pointer a, pointer b)
1086{
1087 pointer x = xcons (SCHEME_A_ a, b);
1088 setimmutable (x);
1089 return x;
1090}
1091
1092#define cons(a,b) xcons (SCHEME_A_ a, b)
1093#define immutable_cons(a,b) ximmutable_cons (SCHEME_A_ a, b)
1094
1095ecb_cold static pointer
1101generate_symbol (SCHEME_P_ const char *name) 1096generate_symbol (SCHEME_P_ const char *name)
1102{ 1097{
1103 pointer x = mk_string (SCHEME_A_ name); 1098 pointer x = mk_string (SCHEME_A_ name);
1104 setimmutable (x); 1099 setimmutable (x);
1105 set_typeflag (x, T_SYMBOL | T_ATOM); 1100 set_typeflag (x, T_SYMBOL | T_ATOM);
1106 return x; 1101 return x;
1107} 1102}
1108 1103
1104/* ========== oblist implementation ========== */
1105
1109#ifndef USE_OBJECT_LIST 1106#ifndef USE_OBJECT_LIST
1110 1107
1111static int 1108static int
1112hash_fn (const char *key, int table_size) 1109hash_fn (const char *key, int table_size)
1113{ 1110{
1114 const unsigned char *p = key; 1111 const unsigned char *p = (unsigned char *)key;
1115 uint32_t hash = 2166136261; 1112 uint32_t hash = 2166136261U;
1116 1113
1117 while (*p) 1114 while (*p)
1118 hash = (hash ^ *p++) * 16777619; 1115 hash = (hash ^ *p++) * 16777619;
1119 1116
1120 return hash % table_size; 1117 return hash % table_size;
1121} 1118}
1122 1119
1123static pointer 1120ecb_cold static pointer
1124oblist_initial_value (SCHEME_P) 1121oblist_initial_value (SCHEME_P)
1125{ 1122{
1126 return mk_vector (SCHEME_A_ 461); /* probably should be bigger */ 1123 return mk_vector (SCHEME_A_ 461); /* probably should be bigger */
1127} 1124}
1128 1125
1129/* returns the new symbol */ 1126/* returns the new symbol */
1130static pointer 1127ecb_cold static pointer
1131oblist_add_by_name (SCHEME_P_ const char *name) 1128oblist_add_by_name (SCHEME_P_ const char *name)
1132{ 1129{
1133 pointer x = generate_symbol (SCHEME_A_ name); 1130 pointer x = generate_symbol (SCHEME_A_ name);
1134 int location = hash_fn (name, veclength (SCHEME_V->oblist)); 1131 int location = hash_fn (name, veclength (SCHEME_V->oblist));
1135 vector_set (SCHEME_V->oblist, location, immutable_cons (x, vector_get (SCHEME_V->oblist, location))); 1132 vector_set (SCHEME_V->oblist, location, immutable_cons (x, vector_get (SCHEME_V->oblist, location)));
1136 return x; 1133 return x;
1137} 1134}
1138 1135
1139ecb_inline pointer 1136ecb_cold static pointer
1140oblist_find_by_name (SCHEME_P_ const char *name) 1137oblist_find_by_name (SCHEME_P_ const char *name)
1141{ 1138{
1142 int location; 1139 int location;
1143 pointer x; 1140 pointer x;
1144 char *s; 1141 char *s;
… …
1155 } 1152 }
1156 1153
1157 return NIL; 1154 return NIL;
1158} 1155}
1159 1156
1160static pointer 1157ecb_cold static pointer
1161oblist_all_symbols (SCHEME_P) 1158oblist_all_symbols (SCHEME_P)
1162{ 1159{
1163 int i; 1160 int i;
1164 pointer x; 1161 pointer x;
1165 pointer ob_list = NIL; 1162 pointer ob_list = NIL;
… …
1171 return ob_list; 1168 return ob_list;
1172} 1169}
1173 1170
1174#else 1171#else
1175 1172
1176static pointer 1173ecb_cold static pointer
1177oblist_initial_value (SCHEME_P) 1174oblist_initial_value (SCHEME_P)
1178{ 1175{
1179 return NIL; 1176 return NIL;
1180} 1177}
1181 1178
1182ecb_inline pointer 1179ecb_cold static pointer
1183oblist_find_by_name (SCHEME_P_ const char *name) 1180oblist_find_by_name (SCHEME_P_ const char *name)
1184{ 1181{
1185 pointer x; 1182 pointer x;
1186 char *s; 1183 char *s;
1187 1184
… …
1196 1193
1197 return NIL; 1194 return NIL;
1198} 1195}
1199 1196
1200/* returns the new symbol */ 1197/* returns the new symbol */
1201static pointer 1198ecb_cold static pointer
1202oblist_add_by_name (SCHEME_P_ const char *name) 1199oblist_add_by_name (SCHEME_P_ const char *name)
1203{ 1200{
1204 pointer x = mk_string (SCHEME_A_ name); 1201 pointer x = generate_symbol (SCHEME_A_ name);
1205 set_typeflag (x, T_SYMBOL);
1206 setimmutable (x);
1207 SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist); 1202 SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist);
1208 return x; 1203 return x;
1209} 1204}
1210 1205
1211static pointer 1206ecb_cold static pointer
1212oblist_all_symbols (SCHEME_P) 1207oblist_all_symbols (SCHEME_P)
1213{ 1208{
1214 return SCHEME_V->oblist; 1209 return SCHEME_V->oblist;
1215} 1210}
1216 1211
1217#endif 1212#endif
1218 1213
1219#if USE_PORTS
1220static pointer 1214ecb_cold static pointer
1221mk_port (SCHEME_P_ port *p) 1215mk_port (SCHEME_P_ port *p)
1222{ 1216{
1223 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1217 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1224 1218
1225 set_typeflag (x, T_PORT | T_ATOM); 1219 set_typeflag (x, T_PORT | T_ATOM);
1226 x->object.port = p; 1220 set_port (x, p);
1227 1221
1228 return x; 1222 return x;
1229} 1223}
1230#endif
1231 1224
1232pointer 1225ecb_cold pointer
1233mk_foreign_func (SCHEME_P_ foreign_func f) 1226mk_foreign_func (SCHEME_P_ foreign_func f)
1234{ 1227{
1235 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1228 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1236 1229
1237 set_typeflag (x, (T_FOREIGN | T_ATOM)); 1230 set_typeflag (x, T_FOREIGN | T_ATOM);
1238 x->object.ff = f; 1231 CELL(x)->object.ff = f;
1239 1232
1240 return x; 1233 return x;
1241} 1234}
1242 1235
1243INTERFACE pointer 1236INTERFACE pointer
1244mk_character (SCHEME_P_ int c) 1237mk_character (SCHEME_P_ int c)
1245{ 1238{
1246 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1239 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1247 1240
1248 set_typeflag (x, (T_CHARACTER | T_ATOM)); 1241 set_typeflag (x, T_CHARACTER | T_ATOM);
1249 set_ivalue (x, c & 0xff); 1242 set_ivalue (x, c & 0xff);
1250 1243
1251 return x; 1244 return x;
1252} 1245}
1253 1246
1254/* get number atom (integer) */ 1247/* get number atom (integer) */
1255INTERFACE pointer 1248INTERFACE pointer
1256mk_integer (SCHEME_P_ long n) 1249mk_integer (SCHEME_P_ long n)
1257{ 1250{
1251 pointer p = 0;
1252 pointer *pp = &p;
1253
1254#if USE_INTCACHE
1255 if (n >= INTCACHE_MIN && n <= INTCACHE_MAX)
1256 pp = &SCHEME_V->intcache[n - INTCACHE_MIN];
1257#endif
1258
1259 if (!*pp)
1260 {
1258 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1261 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1259 1262
1260 set_typeflag (x, (T_INTEGER | T_ATOM)); 1263 set_typeflag (x, T_INTEGER | T_ATOM);
1264 setimmutable (x); /* shouldn't do anythi9ng, doesn't cost anything */
1261 set_ivalue (x, n); 1265 set_ivalue (x, n);
1262 1266
1267 *pp = x;
1268 }
1269
1263 return x; 1270 return *pp;
1264} 1271}
1265 1272
1266INTERFACE pointer 1273INTERFACE pointer
1267mk_real (SCHEME_P_ RVALUE n) 1274mk_real (SCHEME_P_ RVALUE n)
1268{ 1275{
1269#if USE_REAL 1276#if USE_REAL
1270 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1277 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1271 1278
1272 set_typeflag (x, (T_REAL | T_ATOM)); 1279 set_typeflag (x, T_REAL | T_ATOM);
1273 set_rvalue (x, n); 1280 set_rvalue (x, n);
1274 1281
1275 return x; 1282 return x;
1276#else 1283#else
1277 return mk_integer (SCHEME_A_ n); 1284 return mk_integer (SCHEME_A_ n);
… …
1388 x = oblist_add_by_name (SCHEME_A_ name); 1395 x = oblist_add_by_name (SCHEME_A_ name);
1389 1396
1390 return x; 1397 return x;
1391} 1398}
1392 1399
1393INTERFACE pointer 1400ecb_cold INTERFACE pointer
1394gensym (SCHEME_P) 1401gensym (SCHEME_P)
1395{ 1402{
1396 pointer x; 1403 pointer x;
1397 char name[40] = "gensym-"; 1404 char name[40] = "gensym-";
1398 xnum (name + 7, SCHEME_V->gensym_cnt); 1405 xnum (name + 7, ++SCHEME_V->gensym_cnt);
1399 1406
1400 return generate_symbol (SCHEME_A_ name); 1407 return generate_symbol (SCHEME_A_ name);
1401} 1408}
1402 1409
1410static int
1411is_gensym (SCHEME_P_ pointer x)
1412{
1413 return is_symbol (x) && oblist_find_by_name (SCHEME_A_ strvalue (x)) != x;
1414}
1415
1403/* make symbol or number atom from string */ 1416/* make symbol or number atom from string */
1404static pointer 1417ecb_cold static pointer
1405mk_atom (SCHEME_P_ char *q) 1418mk_atom (SCHEME_P_ char *q)
1406{ 1419{
1407 char c, *p; 1420 char c, *p;
1408 int has_dec_point = 0; 1421 int has_dec_point = 0;
1409 int has_fp_exp = 0; 1422 int has_fp_exp = 0;
… …
1480 1493
1481 return mk_integer (SCHEME_A_ strtol (q, 0, 10)); 1494 return mk_integer (SCHEME_A_ strtol (q, 0, 10));
1482} 1495}
1483 1496
1484/* make constant */ 1497/* make constant */
1485static pointer 1498ecb_cold static pointer
1486mk_sharp_const (SCHEME_P_ char *name) 1499mk_sharp_const (SCHEME_P_ char *name)
1487{ 1500{
1488 if (!strcmp (name, "t")) 1501 if (!strcmp (name, "t"))
1489 return S_T; 1502 return S_T;
1490 else if (!strcmp (name, "f")) 1503 else if (!strcmp (name, "f"))
1491 return S_F; 1504 return S_F;
1492 else if (*name == '\\') /* #\w (character) */ 1505 else if (*name == '\\') /* #\w (character) */
1493 { 1506 {
1494 int c; 1507 int c;
1495 1508
1509 // TODO: optimise
1496 if (stricmp (name + 1, "space") == 0) 1510 if (stricmp (name + 1, "space") == 0)
1497 c = ' '; 1511 c = ' ';
1498 else if (stricmp (name + 1, "newline") == 0) 1512 else if (stricmp (name + 1, "newline") == 0)
1499 c = '\n'; 1513 c = '\n';
1500 else if (stricmp (name + 1, "return") == 0) 1514 else if (stricmp (name + 1, "return") == 0)
1501 c = '\r'; 1515 c = '\r';
1502 else if (stricmp (name + 1, "tab") == 0) 1516 else if (stricmp (name + 1, "tab") == 0)
1503 c = '\t'; 1517 c = '\t';
1518 else if (stricmp (name + 1, "alarm") == 0)
1519 c = 0x07;
1520 else if (stricmp (name + 1, "backspace") == 0)
1521 c = 0x08;
1522 else if (stricmp (name + 1, "escape") == 0)
1523 c = 0x1b;
1524 else if (stricmp (name + 1, "delete") == 0)
1525 c = 0x7f;
1526 else if (stricmp (name + 1, "null") == 0)
1527 c = 0;
1504 else if (name[1] == 'x' && name[2] != 0) 1528 else if (name[1] == 'x' && name[2] != 0)
1505 { 1529 {
1506 long c1 = strtol (name + 2, 0, 16); 1530 long c1 = strtol (name + 2, 0, 16);
1507 1531
1508 if (0 <= c1 && c1 <= UCHAR_MAX) 1532 if (0 <= c1 && c1 <= UCHAR_MAX)
… …
1533 return NIL; 1557 return NIL;
1534 } 1558 }
1535} 1559}
1536 1560
1537/* ========== garbage collector ========== */ 1561/* ========== garbage collector ========== */
1562
1563static void
1564finalize_cell (SCHEME_P_ pointer a)
1565{
1566 /* TODO, fast bitmap check? */
1567 if (is_string (a) || is_symbol (a))
1568 free (strvalue (a));
1569 else if (is_vector (a))
1570 free (vecvalue (a));
1571#if USE_PORTS
1572 else if (is_port (a))
1573 {
1574 if (port(a)->kind & port_file && port (a)->rep.stdio.closeit)
1575 port_close (SCHEME_A_ a, port_input | port_output);
1576
1577 free (port (a));
1578 }
1579#endif
1580}
1538 1581
1539/*-- 1582/*--
1540 * We use algorithm E (Knuth, The Art of Computer Programming Vol.1, 1583 * We use algorithm E (Knuth, The Art of Computer Programming Vol.1,
1541 * sec. 2.3.5), the Schorr-Deutsch-Waite link-inversion algorithm, 1584 * sec. 2.3.5), the Schorr-Deutsch-Waite link-inversion algorithm,
1542 * for marking. 1585 * for marking.
1543 * 1586 *
1544 * The exception is vectors - vectors are currently marked recursively, 1587 * The exception is vectors - vectors are currently marked recursively,
1545 * which is inherited form tinyscheme and could be fixed by having another 1588 * which is inherited form tinyscheme and could be fixed by having another
1546 * word of context in the vector 1589 * word of context in the vector
1547 */ 1590 */
1548static void 1591ecb_hot static void
1549mark (pointer a) 1592mark (pointer a)
1550{ 1593{
1551 pointer t, q, p; 1594 pointer t, q, p;
1552 1595
1553 t = 0; 1596 t = 0;
… …
1610 p = q; 1653 p = q;
1611 goto E6; 1654 goto E6;
1612 } 1655 }
1613} 1656}
1614 1657
1658ecb_hot static void
1659gc_free (SCHEME_P)
1660{
1661 int i;
1662 uint32_t total = 0;
1663
1664 /* Here we scan the cells to build the free-list. */
1665 for (i = SCHEME_V->last_cell_seg; i >= 0; i--)
1666 {
1667 struct cell *end = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i];
1668 struct cell *p;
1669 total += SCHEME_V->cell_segsize [i];
1670
1671 for (p = SCHEME_V->cell_seg[i]; p < end; ++p)
1672 {
1673 pointer c = POINTER (p);
1674
1675 if (is_mark (c))
1676 clrmark (c);
1677 else
1678 {
1679 /* reclaim cell */
1680 if (typeflag (c) != T_PAIR)
1681 {
1682 finalize_cell (SCHEME_A_ c);
1683 set_typeflag (c, T_PAIR);
1684 set_car (c, NIL);
1685 }
1686
1687 ++SCHEME_V->fcells;
1688 set_cdr (c, SCHEME_V->free_cell);
1689 SCHEME_V->free_cell = c;
1690 }
1691 }
1692 }
1693
1694 if (SCHEME_V->gc_verbose)
1695 {
1696 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");
1697 }
1698}
1699
1615/* garbage collection. parameter a, b is marked. */ 1700/* garbage collection. parameter a, b is marked. */
1616static void 1701ecb_cold static void
1617gc (SCHEME_P_ pointer a, pointer b) 1702gc (SCHEME_P_ pointer a, pointer b)
1618{ 1703{
1619 pointer p;
1620 int i; 1704 int i;
1621 1705
1622 if (SCHEME_V->gc_verbose) 1706 if (SCHEME_V->gc_verbose)
1623 putstr (SCHEME_A_ "gc..."); 1707 putstr (SCHEME_A_ "gc...");
1624 1708
… …
1640 /* Mark recent objects the interpreter doesn't know about yet. */ 1724 /* Mark recent objects the interpreter doesn't know about yet. */
1641 mark (car (S_SINK)); 1725 mark (car (S_SINK));
1642 /* Mark any older stuff above nested C calls */ 1726 /* Mark any older stuff above nested C calls */
1643 mark (SCHEME_V->c_nest); 1727 mark (SCHEME_V->c_nest);
1644 1728
1729#if USE_INTCACHE
1730 /* mark intcache */
1731 for (i = INTCACHE_MIN; i <= INTCACHE_MAX; ++i)
1732 if (SCHEME_V->intcache[i - INTCACHE_MIN])
1733 mark (SCHEME_V->intcache[i - INTCACHE_MIN]);
1734#endif
1735
1645 /* mark variables a, b */ 1736 /* mark variables a, b */
1646 mark (a); 1737 mark (a);
1647 mark (b); 1738 mark (b);
1648 1739
1649 /* garbage collect */ 1740 /* garbage collect */
1650 clrmark (NIL); 1741 clrmark (NIL);
1651 SCHEME_V->fcells = 0; 1742 SCHEME_V->fcells = 0;
1652 SCHEME_V->free_cell = NIL; 1743 SCHEME_V->free_cell = NIL;
1653 1744
1654 /* free-list is kept sorted by address so as to maintain consecutive
1655 ranges, if possible, for use with vectors. Here we scan the cells
1656 (which are also kept sorted by address) downwards to build the
1657 free-list in sorted order.
1658 */
1659 for (i = SCHEME_V->last_cell_seg; i >= 0; i--)
1660 {
1661 p = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i];
1662
1663 while (--p >= SCHEME_V->cell_seg[i])
1664 {
1665 if (is_mark (p))
1666 clrmark (p);
1667 else
1668 {
1669 /* reclaim cell */
1670 if (typeflag (p) != T_PAIR)
1671 {
1672 finalize_cell (SCHEME_A_ p);
1673 set_typeflag (p, T_PAIR);
1674 set_car (p, NIL);
1675 }
1676
1677 ++SCHEME_V->fcells;
1678 set_cdr (p, SCHEME_V->free_cell);
1679 SCHEME_V->free_cell = p;
1680 }
1681 }
1682 }
1683
1684 if (SCHEME_V->gc_verbose) 1745 if (SCHEME_V->gc_verbose)
1685 { 1746 putstr (SCHEME_A_ "freeing...");
1686 xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" cells were recovered.\n");
1687 }
1688}
1689 1747
1690static void 1748 gc_free (SCHEME_A);
1691finalize_cell (SCHEME_P_ pointer a)
1692{
1693 /* TODO, fast bitmap check? */
1694 if (is_string (a) || is_symbol (a))
1695 free (strvalue (a));
1696 else if (is_vector (a))
1697 free (vecvalue (a));
1698#if USE_PORTS
1699 else if (is_port (a))
1700 {
1701 if (a->object.port->kind & port_file && a->object.port->rep.stdio.closeit)
1702 port_close (SCHEME_A_ a, port_input | port_output);
1703
1704 free (a->object.port);
1705 }
1706#endif
1707} 1749}
1708 1750
1709/* ========== Routines for Reading ========== */ 1751/* ========== Routines for Reading ========== */
1710 1752
1711static int 1753ecb_cold static int
1712file_push (SCHEME_P_ const char *fname) 1754file_push (SCHEME_P_ const char *fname)
1713{ 1755{
1714#if USE_PORTS
1715 int fin; 1756 int fin;
1716 1757
1717 if (SCHEME_V->file_i == MAXFIL - 1) 1758 if (SCHEME_V->file_i == MAXFIL - 1)
1718 return 0; 1759 return 0;
1719 1760
… …
1725 SCHEME_V->load_stack[SCHEME_V->file_i].unget = -1; 1766 SCHEME_V->load_stack[SCHEME_V->file_i].unget = -1;
1726 SCHEME_V->load_stack[SCHEME_V->file_i].kind = port_file | port_input; 1767 SCHEME_V->load_stack[SCHEME_V->file_i].kind = port_file | port_input;
1727 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.file = fin; 1768 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.file = fin;
1728 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.closeit = 1; 1769 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.closeit = 1;
1729 SCHEME_V->nesting_stack[SCHEME_V->file_i] = 0; 1770 SCHEME_V->nesting_stack[SCHEME_V->file_i] = 0;
1730 SCHEME_V->loadport->object.port = SCHEME_V->load_stack + SCHEME_V->file_i; 1771 set_port (SCHEME_V->loadport, SCHEME_V->load_stack + SCHEME_V->file_i);
1731 1772
1732#if SHOW_ERROR_LINE 1773#if SHOW_ERROR_LINE
1733 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line = 0; 1774 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line = 0;
1734 1775
1735 if (fname) 1776 if (fname)
1736 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.filename = store_string (SCHEME_A_ strlen (fname), fname, 0); 1777 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.filename = store_string (SCHEME_A_ strlen (fname), fname, 0);
1737#endif 1778#endif
1738 } 1779 }
1739 1780
1740 return fin >= 0; 1781 return fin >= 0;
1741
1742#else
1743 return 1;
1744#endif
1745} 1782}
1746 1783
1747static void 1784ecb_cold static void
1748file_pop (SCHEME_P) 1785file_pop (SCHEME_P)
1749{ 1786{
1750 if (SCHEME_V->file_i != 0) 1787 if (SCHEME_V->file_i != 0)
1751 { 1788 {
1752 SCHEME_V->nesting = SCHEME_V->nesting_stack[SCHEME_V->file_i]; 1789 SCHEME_V->nesting = SCHEME_V->nesting_stack[SCHEME_V->file_i];
1753#if USE_PORTS 1790#if USE_PORTS
1754 port_close (SCHEME_A_ SCHEME_V->loadport, port_input); 1791 port_close (SCHEME_A_ SCHEME_V->loadport, port_input);
1755#endif 1792#endif
1756 SCHEME_V->file_i--; 1793 SCHEME_V->file_i--;
1757 SCHEME_V->loadport->object.port = SCHEME_V->load_stack + SCHEME_V->file_i; 1794 set_port (SCHEME_V->loadport, SCHEME_V->load_stack + SCHEME_V->file_i);
1758 } 1795 }
1759} 1796}
1760 1797
1761static int 1798ecb_cold static int
1762file_interactive (SCHEME_P) 1799file_interactive (SCHEME_P)
1763{ 1800{
1764#if USE_PORTS 1801#if USE_PORTS
1765 return SCHEME_V->file_i == 0 1802 return SCHEME_V->file_i == 0
1766 && SCHEME_V->load_stack[0].rep.stdio.file == STDIN_FILENO 1803 && SCHEME_V->load_stack[0].rep.stdio.file == STDIN_FILENO
1767 && (SCHEME_V->inport->object.port->kind & port_file); 1804 && (port (SCHEME_V->inport)->kind & port_file);
1768#else 1805#else
1769 return 0; 1806 return 0;
1770#endif 1807#endif
1771} 1808}
1772 1809
1773#if USE_PORTS 1810#if USE_PORTS
1774static port * 1811ecb_cold static port *
1775port_rep_from_filename (SCHEME_P_ const char *fn, int prop) 1812port_rep_from_filename (SCHEME_P_ const char *fn, int prop)
1776{ 1813{
1777 int fd; 1814 int fd;
1778 int flags; 1815 int flags;
1779 char *rw; 1816 char *rw;
… …
1802# endif 1839# endif
1803 1840
1804 return pt; 1841 return pt;
1805} 1842}
1806 1843
1807static pointer 1844ecb_cold static pointer
1808port_from_filename (SCHEME_P_ const char *fn, int prop) 1845port_from_filename (SCHEME_P_ const char *fn, int prop)
1809{ 1846{
1810 port *pt = port_rep_from_filename (SCHEME_A_ fn, prop); 1847 port *pt = port_rep_from_filename (SCHEME_A_ fn, prop);
1811 1848
1812 if (!pt && USE_ERROR_CHECKING) 1849 if (!pt && USE_ERROR_CHECKING)
1813 return NIL; 1850 return NIL;
1814 1851
1815 return mk_port (SCHEME_A_ pt); 1852 return mk_port (SCHEME_A_ pt);
1816} 1853}
1817 1854
1818static port * 1855ecb_cold static port *
1819port_rep_from_file (SCHEME_P_ int f, int prop) 1856port_rep_from_file (SCHEME_P_ int f, int prop)
1820{ 1857{
1821 port *pt = malloc (sizeof *pt); 1858 port *pt = malloc (sizeof *pt);
1822 1859
1823 if (!pt && USE_ERROR_CHECKING) 1860 if (!pt && USE_ERROR_CHECKING)
… …
1828 pt->rep.stdio.file = f; 1865 pt->rep.stdio.file = f;
1829 pt->rep.stdio.closeit = 0; 1866 pt->rep.stdio.closeit = 0;
1830 return pt; 1867 return pt;
1831} 1868}
1832 1869
1833static pointer 1870ecb_cold static pointer
1834port_from_file (SCHEME_P_ int f, int prop) 1871port_from_file (SCHEME_P_ int f, int prop)
1835{ 1872{
1836 port *pt = port_rep_from_file (SCHEME_A_ f, prop); 1873 port *pt = port_rep_from_file (SCHEME_A_ f, prop);
1837 1874
1838 if (!pt && USE_ERROR_CHECKING) 1875 if (!pt && USE_ERROR_CHECKING)
1839 return NIL; 1876 return NIL;
1840 1877
1841 return mk_port (SCHEME_A_ pt); 1878 return mk_port (SCHEME_A_ pt);
1842} 1879}
1843 1880
1844static port * 1881ecb_cold static port *
1845port_rep_from_string (SCHEME_P_ char *start, char *past_the_end, int prop) 1882port_rep_from_string (SCHEME_P_ char *start, char *past_the_end, int prop)
1846{ 1883{
1847 port *pt = malloc (sizeof (port)); 1884 port *pt = malloc (sizeof (port));
1848 1885
1849 if (!pt && USE_ERROR_CHECKING) 1886 if (!pt && USE_ERROR_CHECKING)
… …
1855 pt->rep.string.curr = start; 1892 pt->rep.string.curr = start;
1856 pt->rep.string.past_the_end = past_the_end; 1893 pt->rep.string.past_the_end = past_the_end;
1857 return pt; 1894 return pt;
1858} 1895}
1859 1896
1860static pointer 1897ecb_cold static pointer
1861port_from_string (SCHEME_P_ char *start, char *past_the_end, int prop) 1898port_from_string (SCHEME_P_ char *start, char *past_the_end, int prop)
1862{ 1899{
1863 port *pt = port_rep_from_string (SCHEME_A_ start, past_the_end, prop); 1900 port *pt = port_rep_from_string (SCHEME_A_ start, past_the_end, prop);
1864 1901
1865 if (!pt && USE_ERROR_CHECKING) 1902 if (!pt && USE_ERROR_CHECKING)
… …
1868 return mk_port (SCHEME_A_ pt); 1905 return mk_port (SCHEME_A_ pt);
1869} 1906}
1870 1907
1871# define BLOCK_SIZE 256 1908# define BLOCK_SIZE 256
1872 1909
1873static port * 1910ecb_cold static port *
1874port_rep_from_scratch (SCHEME_P) 1911port_rep_from_scratch (SCHEME_P)
1875{ 1912{
1876 char *start; 1913 char *start;
1877 port *pt = malloc (sizeof (port)); 1914 port *pt = malloc (sizeof (port));
1878 1915
… …
1892 pt->rep.string.curr = start; 1929 pt->rep.string.curr = start;
1893 pt->rep.string.past_the_end = start + BLOCK_SIZE - 1; 1930 pt->rep.string.past_the_end = start + BLOCK_SIZE - 1;
1894 return pt; 1931 return pt;
1895} 1932}
1896 1933
1897static pointer 1934ecb_cold static pointer
1898port_from_scratch (SCHEME_P) 1935port_from_scratch (SCHEME_P)
1899{ 1936{
1900 port *pt = port_rep_from_scratch (SCHEME_A); 1937 port *pt = port_rep_from_scratch (SCHEME_A);
1901 1938
1902 if (!pt && USE_ERROR_CHECKING) 1939 if (!pt && USE_ERROR_CHECKING)
1903 return NIL; 1940 return NIL;
1904 1941
1905 return mk_port (SCHEME_A_ pt); 1942 return mk_port (SCHEME_A_ pt);
1906} 1943}
1907 1944
1908static void 1945ecb_cold static void
1909port_close (SCHEME_P_ pointer p, int flag) 1946port_close (SCHEME_P_ pointer p, int flag)
1910{ 1947{
1911 port *pt = p->object.port; 1948 port *pt = port (p);
1912 1949
1913 pt->kind &= ~flag; 1950 pt->kind &= ~flag;
1914 1951
1915 if ((pt->kind & (port_input | port_output)) == 0) 1952 if ((pt->kind & (port_input | port_output)) == 0)
1916 { 1953 {
… …
1933 } 1970 }
1934} 1971}
1935#endif 1972#endif
1936 1973
1937/* get new character from input file */ 1974/* get new character from input file */
1938static int 1975ecb_cold static int
1939inchar (SCHEME_P) 1976inchar (SCHEME_P)
1940{ 1977{
1941 int c; 1978 int c;
1942 port *pt; 1979 port *pt = port (SCHEME_V->inport);
1943
1944 pt = SCHEME_V->inport->object.port;
1945 1980
1946 if (pt->kind & port_saw_EOF) 1981 if (pt->kind & port_saw_EOF)
1947 return EOF; 1982 return EOF;
1948 1983
1949 c = basic_inchar (pt); 1984 c = basic_inchar (pt);
… …
1959 } 1994 }
1960 1995
1961 return c; 1996 return c;
1962} 1997}
1963 1998
1964static int ungot = -1; 1999ecb_cold static int
1965
1966static int
1967basic_inchar (port *pt) 2000basic_inchar (port *pt)
1968{ 2001{
1969#if USE_PORTS
1970 if (pt->unget != -1) 2002 if (pt->unget != -1)
1971 { 2003 {
1972 int r = pt->unget; 2004 int r = pt->unget;
1973 pt->unget = -1; 2005 pt->unget = -1;
1974 return r; 2006 return r;
1975 } 2007 }
1976 2008
2009#if USE_PORTS
1977 if (pt->kind & port_file) 2010 if (pt->kind & port_file)
1978 { 2011 {
1979 char c; 2012 char c;
1980 2013
1981 if (!read (pt->rep.stdio.file, &c, 1)) 2014 if (!read (pt->rep.stdio.file, &c, 1))
… …
1989 return EOF; 2022 return EOF;
1990 else 2023 else
1991 return *pt->rep.string.curr++; 2024 return *pt->rep.string.curr++;
1992 } 2025 }
1993#else 2026#else
1994 if (ungot == -1)
1995 {
1996 char c; 2027 char c;
1997 if (!read (0, &c, 1)) 2028
2029 if (!read (pt->rep.stdio.file, &c, 1))
1998 return EOF; 2030 return EOF;
1999 2031
2000 ungot = c;
2001 }
2002
2003 {
2004 int r = ungot;
2005 ungot = -1;
2006 return r; 2032 return c;
2007 }
2008#endif 2033#endif
2009} 2034}
2010 2035
2011/* back character to input buffer */ 2036/* back character to input buffer */
2012static void 2037ecb_cold static void
2013backchar (SCHEME_P_ int c) 2038backchar (SCHEME_P_ int c)
2014{ 2039{
2015#if USE_PORTS 2040 port *pt = port (SCHEME_V->inport);
2016 port *pt;
2017 2041
2018 if (c == EOF) 2042 if (c == EOF)
2019 return; 2043 return;
2020 2044
2021 pt = SCHEME_V->inport->object.port;
2022 pt->unget = c; 2045 pt->unget = c;
2023#else
2024 if (c == EOF)
2025 return;
2026
2027 ungot = c;
2028#endif
2029} 2046}
2030 2047
2031#if USE_PORTS 2048#if USE_PORTS
2032static int 2049ecb_cold static int
2033realloc_port_string (SCHEME_P_ port *p) 2050realloc_port_string (SCHEME_P_ port *p)
2034{ 2051{
2035 char *start = p->rep.string.start; 2052 char *start = p->rep.string.start;
2036 size_t new_size = p->rep.string.past_the_end - start + 1 + BLOCK_SIZE; 2053 size_t new_size = p->rep.string.past_the_end - start + 1 + BLOCK_SIZE;
2037 char *str = malloc (new_size); 2054 char *str = malloc (new_size);
… …
2050 else 2067 else
2051 return 0; 2068 return 0;
2052} 2069}
2053#endif 2070#endif
2054 2071
2055INTERFACE void 2072ecb_cold static void
2056putstr (SCHEME_P_ const char *s) 2073putchars (SCHEME_P_ const char *s, int len)
2057{ 2074{
2075 port *pt = port (SCHEME_V->outport);
2076
2058#if USE_PORTS 2077#if USE_PORTS
2059 port *pt = SCHEME_V->outport->object.port;
2060
2061 if (pt->kind & port_file)
2062 write (pt->rep.stdio.file, s, strlen (s));
2063 else
2064 for (; *s; s++)
2065 if (pt->rep.string.curr != pt->rep.string.past_the_end)
2066 *pt->rep.string.curr++ = *s;
2067 else if (pt->kind & port_srfi6 && realloc_port_string (SCHEME_A_ pt))
2068 *pt->rep.string.curr++ = *s;
2069
2070#else
2071 xwrstr (s);
2072#endif
2073}
2074
2075static void
2076putchars (SCHEME_P_ const char *s, int len)
2077{
2078#if USE_PORTS
2079 port *pt = SCHEME_V->outport->object.port;
2080
2081 if (pt->kind & port_file) 2078 if (pt->kind & port_file)
2082 write (pt->rep.stdio.file, s, len); 2079 write (pt->rep.stdio.file, s, len);
2083 else 2080 else
2084 { 2081 {
2085 for (; len; len--) 2082 for (; len; len--)
… …
2090 *pt->rep.string.curr++ = *s++; 2087 *pt->rep.string.curr++ = *s++;
2091 } 2088 }
2092 } 2089 }
2093 2090
2094#else 2091#else
2095 write (1, s, len); 2092 write (1, s, len); // output not initialised
2096#endif 2093#endif
2094}
2095
2096INTERFACE void
2097putstr (SCHEME_P_ const char *s)
2098{
2099 putchars (SCHEME_A_ s, strlen (s));
2097} 2100}
2098 2101
2099INTERFACE void 2102INTERFACE void
2100putcharacter (SCHEME_P_ int c) 2103putcharacter (SCHEME_P_ int c)
2101{ 2104{
2102#if USE_PORTS
2103 port *pt = SCHEME_V->outport->object.port;
2104
2105 if (pt->kind & port_file)
2106 {
2107 char cc = c;
2108 write (pt->rep.stdio.file, &cc, 1);
2109 }
2110 else
2111 {
2112 if (pt->rep.string.curr != pt->rep.string.past_the_end)
2113 *pt->rep.string.curr++ = c;
2114 else if (pt->kind & port_srfi6 && realloc_port_string (SCHEME_A_ pt))
2115 *pt->rep.string.curr++ = c;
2116 }
2117
2118#else
2119 char cc = c; 2105 char cc = c;
2120 write (1, &c, 1); 2106
2121#endif 2107 putchars (SCHEME_A_ &cc, 1);
2122} 2108}
2123 2109
2124/* read characters up to delimiter, but cater to character constants */ 2110/* read characters up to delimiter, but cater to character constants */
2125static char * 2111ecb_cold static char *
2126readstr_upto (SCHEME_P_ int skip, const char *delim) 2112readstr_upto (SCHEME_P_ int skip, const char *delim)
2127{ 2113{
2128 char *p = SCHEME_V->strbuff + skip; 2114 char *p = SCHEME_V->strbuff + skip;
2129 2115
2130 while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A)))); 2116 while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A))));
… …
2139 2125
2140 return SCHEME_V->strbuff; 2126 return SCHEME_V->strbuff;
2141} 2127}
2142 2128
2143/* read string expression "xxx...xxx" */ 2129/* read string expression "xxx...xxx" */
2144static pointer 2130ecb_cold static pointer
2145readstrexp (SCHEME_P_ char delim) 2131readstrexp (SCHEME_P_ char delim)
2146{ 2132{
2147 char *p = SCHEME_V->strbuff; 2133 char *p = SCHEME_V->strbuff;
2148 int c; 2134 int c;
2149 int c1 = 0; 2135 int c1 = 0;
… …
2182 case '7': 2168 case '7':
2183 state = st_oct1; 2169 state = st_oct1;
2184 c1 = c - '0'; 2170 c1 = c - '0';
2185 break; 2171 break;
2186 2172
2173 case 'a': *p++ = '\a'; state = st_ok; break;
2174 case 'n': *p++ = '\n'; state = st_ok; break;
2175 case 'r': *p++ = '\r'; state = st_ok; break;
2176 case 't': *p++ = '\t'; state = st_ok; break;
2177
2178 // this overshoots the minimum requirements of r7rs
2179 case ' ':
2180 case '\t':
2181 case '\r':
2182 case '\n':
2183 skipspace (SCHEME_A);
2184 state = st_ok;
2185 break;
2186
2187 //TODO: x should end in ;, not two-digit hex
2187 case 'x': 2188 case 'x':
2188 case 'X': 2189 case 'X':
2189 state = st_x1; 2190 state = st_x1;
2190 c1 = 0; 2191 c1 = 0;
2191 break;
2192
2193 case 'n':
2194 *p++ = '\n';
2195 state = st_ok;
2196 break;
2197
2198 case 't':
2199 *p++ = '\t';
2200 state = st_ok;
2201 break;
2202
2203 case 'r':
2204 *p++ = '\r';
2205 state = st_ok;
2206 break; 2192 break;
2207 2193
2208 default: 2194 default:
2209 *p++ = c; 2195 *p++ = c;
2210 state = st_ok; 2196 state = st_ok;
… …
2262 } 2248 }
2263 } 2249 }
2264} 2250}
2265 2251
2266/* check c is in chars */ 2252/* check c is in chars */
2267ecb_inline int 2253ecb_cold int
2268is_one_of (const char *s, int c) 2254is_one_of (const char *s, int c)
2269{ 2255{
2270 return c == EOF || !!strchr (s, c); 2256 return c == EOF || !!strchr (s, c);
2271} 2257}
2272 2258
2273/* skip white characters */ 2259/* skip white characters */
2274ecb_inline int 2260ecb_cold int
2275skipspace (SCHEME_P) 2261skipspace (SCHEME_P)
2276{ 2262{
2277 int c, curr_line = 0; 2263 int c, curr_line = 0;
2278 2264
2279 do 2265 do
2280 { 2266 {
2281 c = inchar (SCHEME_A); 2267 c = inchar (SCHEME_A);
2268
2282#if SHOW_ERROR_LINE 2269#if SHOW_ERROR_LINE
2283 if (c == '\n') 2270 if (ecb_expect_false (c == '\n'))
2284 curr_line++; 2271 curr_line++;
2285#endif 2272#endif
2273
2274 if (ecb_expect_false (c == EOF))
2275 return c;
2286 } 2276 }
2287 while (is_one_of (WHITESPACE, c)); 2277 while (is_one_of (WHITESPACE, c));
2288 2278
2289 /* record it */ 2279 /* record it */
2290#if SHOW_ERROR_LINE 2280#if SHOW_ERROR_LINE
2291 if (SCHEME_V->load_stack[SCHEME_V->file_i].kind & port_file) 2281 if (SCHEME_V->load_stack[SCHEME_V->file_i].kind & port_file)
2292 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line += curr_line; 2282 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line += curr_line;
2293#endif 2283#endif
2294 2284
2295 if (c != EOF)
2296 {
2297 backchar (SCHEME_A_ c); 2285 backchar (SCHEME_A_ c);
2298 return 1; 2286 return 1;
2299 }
2300 else
2301 return EOF;
2302} 2287}
2303 2288
2304/* get token */ 2289/* get token */
2305static int 2290ecb_cold static int
2306token (SCHEME_P) 2291token (SCHEME_P)
2307{ 2292{
2308 int c = skipspace (SCHEME_A); 2293 int c = skipspace (SCHEME_A);
2309 2294
2310 if (c == EOF) 2295 if (c == EOF)
… …
2408} 2393}
2409 2394
2410/* ========== Routines for Printing ========== */ 2395/* ========== Routines for Printing ========== */
2411#define ok_abbrev(x) (is_pair(x) && cdr(x) == NIL) 2396#define ok_abbrev(x) (is_pair(x) && cdr(x) == NIL)
2412 2397
2413static void 2398ecb_cold static void
2414printslashstring (SCHEME_P_ char *p, int len) 2399printslashstring (SCHEME_P_ char *p, int len)
2415{ 2400{
2416 int i; 2401 int i;
2417 unsigned char *s = (unsigned char *) p; 2402 unsigned char *s = (unsigned char *) p;
2418 2403
… …
2474 2459
2475 putcharacter (SCHEME_A_ '"'); 2460 putcharacter (SCHEME_A_ '"');
2476} 2461}
2477 2462
2478/* print atoms */ 2463/* print atoms */
2479static void 2464ecb_cold static void
2480printatom (SCHEME_P_ pointer l, int f) 2465printatom (SCHEME_P_ pointer l, int f)
2481{ 2466{
2482 char *p; 2467 char *p;
2483 int len; 2468 int len;
2484 2469
2485 atom2str (SCHEME_A_ l, f, &p, &len); 2470 atom2str (SCHEME_A_ l, f, &p, &len);
2486 putchars (SCHEME_A_ p, len); 2471 putchars (SCHEME_A_ p, len);
2487} 2472}
2488 2473
2489/* Uses internal buffer unless string pointer is already available */ 2474/* Uses internal buffer unless string pointer is already available */
2490static void 2475ecb_cold static void
2491atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen) 2476atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen)
2492{ 2477{
2493 char *p; 2478 char *p;
2494 2479
2495 if (l == NIL) 2480 if (l == NIL)
… …
2702 return car (d); 2687 return car (d);
2703 2688
2704 p = cons (car (d), cdr (d)); 2689 p = cons (car (d), cdr (d));
2705 q = p; 2690 q = p;
2706 2691
2707 while (cdr (cdr (p)) != NIL) 2692 while (cddr (p) != NIL)
2708 { 2693 {
2709 d = cons (car (p), cdr (p)); 2694 d = cons (car (p), cdr (p));
2710 2695
2711 if (cdr (cdr (p)) != NIL) 2696 if (cddr (p) != NIL)
2712 p = cdr (d); 2697 p = cdr (d);
2713 } 2698 }
2714 2699
2715 set_cdr (p, car (cdr (p))); 2700 set_cdr (p, cadr (p));
2716 return q; 2701 return q;
2717} 2702}
2718 2703
2719/* reverse list -- produce new list */ 2704/* reverse list -- produce new list */
2720static pointer 2705ecb_hot static pointer
2721reverse (SCHEME_P_ pointer a) 2706reverse (SCHEME_P_ pointer a)
2722{ 2707{
2723 /* a must be checked by gc */ 2708 /* a must be checked by gc */
2724 pointer p = NIL; 2709 pointer p = NIL;
2725 2710
… …
2728 2713
2729 return p; 2714 return p;
2730} 2715}
2731 2716
2732/* reverse list --- in-place */ 2717/* reverse list --- in-place */
2733static pointer 2718ecb_hot static pointer
2734reverse_in_place (SCHEME_P_ pointer term, pointer list) 2719reverse_in_place (SCHEME_P_ pointer term, pointer list)
2735{ 2720{
2736 pointer result = term; 2721 pointer result = term;
2737 pointer p = list; 2722 pointer p = list;
2738 2723
… …
2746 2731
2747 return result; 2732 return result;
2748} 2733}
2749 2734
2750/* append list -- produce new list (in reverse order) */ 2735/* append list -- produce new list (in reverse order) */
2751static pointer 2736ecb_hot static pointer
2752revappend (SCHEME_P_ pointer a, pointer b) 2737revappend (SCHEME_P_ pointer a, pointer b)
2753{ 2738{
2754 pointer result = a; 2739 pointer result = a;
2755 pointer p = b; 2740 pointer p = b;
2756 2741
… …
2765 2750
2766 return S_F; /* signal an error */ 2751 return S_F; /* signal an error */
2767} 2752}
2768 2753
2769/* equivalence of atoms */ 2754/* equivalence of atoms */
2770int 2755ecb_hot int
2771eqv (pointer a, pointer b) 2756eqv (pointer a, pointer b)
2772{ 2757{
2773 if (is_string (a)) 2758 if (is_string (a))
2774 { 2759 {
2775 if (is_string (b)) 2760 if (is_string (b))
… …
2869 } 2854 }
2870 else 2855 else
2871 set_car (env, immutable_cons (slot, car (env))); 2856 set_car (env, immutable_cons (slot, car (env)));
2872} 2857}
2873 2858
2874static pointer 2859ecb_hot static pointer
2875find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all) 2860find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all)
2876{ 2861{
2877 pointer x, y; 2862 pointer x, y;
2878 2863
2879 for (x = env; x != NIL; x = cdr (x)) 2864 for (x = env; x != NIL; x = cdr (x))
… …
2900 return NIL; 2885 return NIL;
2901} 2886}
2902 2887
2903#else /* USE_ALIST_ENV */ 2888#else /* USE_ALIST_ENV */
2904 2889
2905ecb_inline void 2890static void
2906new_frame_in_env (SCHEME_P_ pointer old_env) 2891new_frame_in_env (SCHEME_P_ pointer old_env)
2907{ 2892{
2908 SCHEME_V->envir = immutable_cons (NIL, old_env); 2893 SCHEME_V->envir = immutable_cons (NIL, old_env);
2909 setenvironment (SCHEME_V->envir); 2894 setenvironment (SCHEME_V->envir);
2910} 2895}
2911 2896
2912ecb_inline void 2897static void
2913new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) 2898new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
2914{ 2899{
2915 set_car (env, immutable_cons (immutable_cons (variable, value), car (env))); 2900 set_car (env, immutable_cons (immutable_cons (variable, value), car (env)));
2916} 2901}
2917 2902
2918static pointer 2903ecb_hot static pointer
2919find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all) 2904find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all)
2920{ 2905{
2921 pointer x, y; 2906 pointer x, y;
2922 2907
2923 for (x = env; x != NIL; x = cdr (x)) 2908 for (x = env; x != NIL; x = cdr (x))
… …
2937 return NIL; 2922 return NIL;
2938} 2923}
2939 2924
2940#endif /* USE_ALIST_ENV else */ 2925#endif /* USE_ALIST_ENV else */
2941 2926
2942ecb_inline void 2927static void
2943new_slot_in_env (SCHEME_P_ pointer variable, pointer value) 2928new_slot_in_env (SCHEME_P_ pointer variable, pointer value)
2944{ 2929{
2945 assert (is_symbol (variable));//TODO: bug in current-ws/OP_LET2 2930 assert (is_symbol (variable));//TODO: bug in current-ws/OP_LET2
2946 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value); 2931 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value);
2947} 2932}
2948 2933
2949ecb_inline void 2934static void
2950set_slot_in_env (SCHEME_P_ pointer slot, pointer value) 2935set_slot_in_env (SCHEME_P_ pointer slot, pointer value)
2951{ 2936{
2952 set_cdr (slot, value); 2937 set_cdr (slot, value);
2953} 2938}
2954 2939
2955ecb_inline pointer 2940static pointer
2956slot_value_in_env (pointer slot) 2941slot_value_in_env (pointer slot)
2957{ 2942{
2958 return cdr (slot); 2943 return cdr (slot);
2959} 2944}
2960 2945
2961/* ========== Evaluation Cycle ========== */ 2946/* ========== Evaluation Cycle ========== */
2962 2947
2963static int 2948ecb_cold static int
2964xError_1 (SCHEME_P_ const char *s, pointer a) 2949xError_1 (SCHEME_P_ const char *s, pointer a)
2965{ 2950{
2966#if USE_ERROR_HOOK
2967 pointer x;
2968 pointer hdl = SCHEME_V->ERROR_HOOK;
2969#endif
2970
2971#if USE_PRINTF 2951#if USE_PRINTF
2972#if SHOW_ERROR_LINE 2952#if SHOW_ERROR_LINE
2973 char sbuf[STRBUFFSIZE]; 2953 char sbuf[STRBUFFSIZE];
2974 2954
2975 /* make sure error is not in REPL */ 2955 /* make sure error is not in REPL */
… …
2990 } 2970 }
2991#endif 2971#endif
2992#endif 2972#endif
2993 2973
2994#if USE_ERROR_HOOK 2974#if USE_ERROR_HOOK
2995 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, hdl, 1); 2975 pointer x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->ERROR_HOOK, 1);
2996 2976
2997 if (x != NIL) 2977 if (x != NIL)
2998 { 2978 {
2999 pointer code = a 2979 pointer code = a
3000 ? cons (cons (SCHEME_V->QUOTE, cons (a, NIL)), NIL) 2980 ? cons (cons (SCHEME_V->QUOTE, cons (a, NIL)), NIL)
… …
3044 pointer code; 3024 pointer code;
3045}; 3025};
3046 3026
3047# define STACK_GROWTH 3 3027# define STACK_GROWTH 3
3048 3028
3049static void 3029ecb_hot static void
3050s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code) 3030s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code)
3051{ 3031{
3052 int nframes = (uintptr_t)SCHEME_V->dump; 3032 int nframes = (uintptr_t)SCHEME_V->dump;
3053 struct dump_stack_frame *next_frame; 3033 struct dump_stack_frame *next_frame;
3054 3034
3055 /* enough room for the next frame? */ 3035 /* enough room for the next frame? */
3056 if (nframes >= SCHEME_V->dump_size) 3036 if (ecb_expect_false (nframes >= SCHEME_V->dump_size))
3057 { 3037 {
3058 SCHEME_V->dump_size += STACK_GROWTH; 3038 SCHEME_V->dump_size += STACK_GROWTH;
3059 SCHEME_V->dump_base = realloc (SCHEME_V->dump_base, sizeof (struct dump_stack_frame) * SCHEME_V->dump_size); 3039 SCHEME_V->dump_base = realloc (SCHEME_V->dump_base, sizeof (struct dump_stack_frame) * SCHEME_V->dump_size);
3060 } 3040 }
3061 3041
… …
3067 next_frame->code = code; 3047 next_frame->code = code;
3068 3048
3069 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1); 3049 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1);
3070} 3050}
3071 3051
3072static int 3052static ecb_hot int
3073xs_return (SCHEME_P_ pointer a) 3053xs_return (SCHEME_P_ pointer a)
3074{ 3054{
3075 int nframes = (uintptr_t)SCHEME_V->dump; 3055 int nframes = (uintptr_t)SCHEME_V->dump;
3076 struct dump_stack_frame *frame; 3056 struct dump_stack_frame *frame;
3077 3057
… …
3088 SCHEME_V->dump = (pointer)(uintptr_t)nframes; 3068 SCHEME_V->dump = (pointer)(uintptr_t)nframes;
3089 3069
3090 return 0; 3070 return 0;
3091} 3071}
3092 3072
3093ecb_inline void 3073ecb_cold void
3094dump_stack_reset (SCHEME_P) 3074dump_stack_reset (SCHEME_P)
3095{ 3075{
3096 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */ 3076 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */
3097 SCHEME_V->dump = (pointer)+0; 3077 SCHEME_V->dump = (pointer)+0;
3098} 3078}
3099 3079
3100ecb_inline void 3080ecb_cold void
3101dump_stack_initialize (SCHEME_P) 3081dump_stack_initialize (SCHEME_P)
3102{ 3082{
3103 SCHEME_V->dump_size = 0; 3083 SCHEME_V->dump_size = 0;
3104 SCHEME_V->dump_base = 0; 3084 SCHEME_V->dump_base = 0;
3105 dump_stack_reset (SCHEME_A); 3085 dump_stack_reset (SCHEME_A);
3106} 3086}
3107 3087
3108static void 3088ecb_cold static void
3109dump_stack_free (SCHEME_P) 3089dump_stack_free (SCHEME_P)
3110{ 3090{
3111 free (SCHEME_V->dump_base); 3091 free (SCHEME_V->dump_base);
3112 SCHEME_V->dump_base = 0; 3092 SCHEME_V->dump_base = 0;
3113 SCHEME_V->dump = (pointer)0; 3093 SCHEME_V->dump = (pointer)0;
3114 SCHEME_V->dump_size = 0; 3094 SCHEME_V->dump_size = 0;
3115} 3095}
3116 3096
3117static void 3097ecb_cold static void
3118dump_stack_mark (SCHEME_P) 3098dump_stack_mark (SCHEME_P)
3119{ 3099{
3120 int nframes = (uintptr_t)SCHEME_V->dump; 3100 int nframes = (uintptr_t)SCHEME_V->dump;
3121 int i; 3101 int i;
3122 3102
… …
3128 mark (frame->envir); 3108 mark (frame->envir);
3129 mark (frame->code); 3109 mark (frame->code);
3130 } 3110 }
3131} 3111}
3132 3112
3133static pointer 3113ecb_cold static pointer
3134ss_get_cont (SCHEME_P) 3114ss_get_cont (SCHEME_P)
3135{ 3115{
3136 int nframes = (uintptr_t)SCHEME_V->dump; 3116 int nframes = (uintptr_t)SCHEME_V->dump;
3137 int i; 3117 int i;
3138 3118
… …
3150 } 3130 }
3151 3131
3152 return cont; 3132 return cont;
3153} 3133}
3154 3134
3155static void 3135ecb_cold static void
3156ss_set_cont (SCHEME_P_ pointer cont) 3136ss_set_cont (SCHEME_P_ pointer cont)
3157{ 3137{
3158 int i = 0; 3138 int i = 0;
3159 struct dump_stack_frame *frame = SCHEME_V->dump_base; 3139 struct dump_stack_frame *frame = SCHEME_V->dump_base;
3160 3140
… …
3172 SCHEME_V->dump = (pointer)(uintptr_t)i; 3152 SCHEME_V->dump = (pointer)(uintptr_t)i;
3173} 3153}
3174 3154
3175#else 3155#else
3176 3156
3177ecb_inline void 3157ecb_cold void
3178dump_stack_reset (SCHEME_P) 3158dump_stack_reset (SCHEME_P)
3179{ 3159{
3180 SCHEME_V->dump = NIL; 3160 SCHEME_V->dump = NIL;
3181} 3161}
3182 3162
3183ecb_inline void 3163ecb_cold void
3184dump_stack_initialize (SCHEME_P) 3164dump_stack_initialize (SCHEME_P)
3185{ 3165{
3186 dump_stack_reset (SCHEME_A); 3166 dump_stack_reset (SCHEME_A);
3187} 3167}
3188 3168
3189static void 3169ecb_cold static void
3190dump_stack_free (SCHEME_P) 3170dump_stack_free (SCHEME_P)
3191{ 3171{
3192 SCHEME_V->dump = NIL; 3172 SCHEME_V->dump = NIL;
3193} 3173}
3194 3174
3195static int 3175ecb_hot static int
3196xs_return (SCHEME_P_ pointer a) 3176xs_return (SCHEME_P_ pointer a)
3197{ 3177{
3198 pointer dump = SCHEME_V->dump; 3178 pointer dump = SCHEME_V->dump;
3199 3179
3200 SCHEME_V->value = a; 3180 SCHEME_V->value = a;
… …
3210 SCHEME_V->dump = dump; 3190 SCHEME_V->dump = dump;
3211 3191
3212 return 0; 3192 return 0;
3213} 3193}
3214 3194
3215static void 3195ecb_hot static void
3216s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code) 3196s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code)
3217{ 3197{
3218 SCHEME_V->dump = cons (mk_integer (SCHEME_A_ op), 3198 SCHEME_V->dump = cons (mk_integer (SCHEME_A_ op),
3219 cons (args, 3199 cons (args,
3220 cons (SCHEME_V->envir, 3200 cons (SCHEME_V->envir,
3221 cons (code, 3201 cons (code,
3222 SCHEME_V->dump)))); 3202 SCHEME_V->dump))));
3223} 3203}
3224 3204
3225static void 3205ecb_cold static void
3226dump_stack_mark (SCHEME_P) 3206dump_stack_mark (SCHEME_P)
3227{ 3207{
3228 mark (SCHEME_V->dump); 3208 mark (SCHEME_V->dump);
3229} 3209}
3230 3210
3231static pointer 3211ecb_cold static pointer
3232ss_get_cont (SCHEME_P) 3212ss_get_cont (SCHEME_P)
3233{ 3213{
3234 return SCHEME_V->dump; 3214 return SCHEME_V->dump;
3235} 3215}
3236 3216
3237static void 3217ecb_cold static void
3238ss_set_cont (SCHEME_P_ pointer cont) 3218ss_set_cont (SCHEME_P_ pointer cont)
3239{ 3219{
3240 SCHEME_V->dump = cont; 3220 SCHEME_V->dump = cont;
3241} 3221}
3242 3222
3243#endif 3223#endif
3244 3224
3245#define s_retbool(tf) s_return ((tf) ? S_T : S_F) 3225#define s_retbool(tf) s_return ((tf) ? S_T : S_F)
3246 3226
3247#if 1 3227#if EXPERIMENT
3228
3248static int 3229static int
3249debug (SCHEME_P_ int indent, pointer x) 3230dtree (SCHEME_P_ int indent, pointer x)
3250{ 3231{
3251 int c; 3232 int c;
3252 3233
3253 if (is_syntax (x)) 3234 if (is_syntax (x))
3254 { 3235 {
… …
3272 printf ("%*sS<%s>\n", indent, "", symname (x)); 3253 printf ("%*sS<%s>\n", indent, "", symname (x));
3273 return 24+8; 3254 return 24+8;
3274 3255
3275 case T_CLOSURE: 3256 case T_CLOSURE:
3276 printf ("%*sS<%s>\n", indent, "", "closure"); 3257 printf ("%*sS<%s>\n", indent, "", "closure");
3277 debug (SCHEME_A_ indent + 3, cdr(x)); 3258 dtree (SCHEME_A_ indent + 3, cdr(x));
3278 return 32 + debug (SCHEME_A_ indent + 3, car (x)); 3259 return 32 + dtree (SCHEME_A_ indent + 3, car (x));
3279 3260
3280 case T_PAIR: 3261 case T_PAIR:
3281 printf ("%*spair %p %p\n", indent, "", car(x),cdr(x)); 3262 printf ("%*spair %p %p\n", indent, "", car(x),cdr(x));
3282 c = debug (SCHEME_A_ indent + 3, car (x)); 3263 c = dtree (SCHEME_A_ indent + 3, car (x));
3283 c += debug (SCHEME_A_ indent + 3, cdr (x)); 3264 c += dtree (SCHEME_A_ indent + 3, cdr (x));
3284 return c + 1; 3265 return c + 1;
3285 3266
3286 case T_PORT: 3267 case T_PORT:
3287 printf ("%*sS<%s>\n", indent, "", "port"); 3268 printf ("%*sS<%s>\n", indent, "", "port");
3288 return 24+8; 3269 return 24+8;
… …
3291 printf ("%*sS<%s>\n", indent, "", "vector"); 3272 printf ("%*sS<%s>\n", indent, "", "vector");
3292 return 24+8; 3273 return 24+8;
3293 3274
3294 case T_ENVIRONMENT: 3275 case T_ENVIRONMENT:
3295 printf ("%*sS<%s>\n", indent, "", "environment"); 3276 printf ("%*sS<%s>\n", indent, "", "environment");
3296 return 0 + debug (SCHEME_A_ indent + 3, car (x)); 3277 return 0 + dtree (SCHEME_A_ indent + 3, car (x));
3297 3278
3298 default: 3279 default:
3299 printf ("unhandled type %d\n", type (x)); 3280 printf ("unhandled type %d\n", type (x));
3300 break; 3281 break;
3301 } 3282 }
3302} 3283}
3303#endif
3304 3284
3285#define DUMP(t) do { printf ("DUMP %s:%d\n", __FILE__, __LINE__); dtree (SCHEME_A_ 0, (t)); } while (0)
3286
3287typedef void *stream[1];
3288
3289#define stream_init() { 0 }
3290#define stream_data(s) ((char *)(s)[0] + sizeof (uint32_t) * 2)
3291#define stream_size(s) (((uint32_t *)(s)[0])[0] - sizeof (uint32_t) * 2)
3292#define stream_free(s) free (s[0])
3293
3294ecb_cold static void
3295stream_put (stream s, uint8_t byte)
3296{
3297 uint32_t *sp = *s;
3298 uint32_t size = sizeof (uint32_t) * 2;
3299 uint32_t offs = size;
3300
3301 if (ecb_expect_true (sp))
3302 {
3303 offs = sp[0];
3304 size = sp[1];
3305 }
3306
3307 if (ecb_expect_false (offs == size))
3308 {
3309 size *= 2;
3310 sp = realloc (sp, size);
3311 *s = sp;
3312 sp[1] = size;
3313
3314 }
3315
3316 ((uint8_t *)sp)[offs++] = byte;
3317 sp[0] = offs;
3318}
3319
3320ecb_cold static void
3321stream_put_v (stream s, uint32_t v)
3322{
3323 while (v > 0x7f)
3324 {
3325 stream_put (s, v | 0x80);
3326 v >>= 7;
3327 }
3328
3329 stream_put (s, v);
3330}
3331
3332ecb_cold static void
3333stream_put_tv (stream s, int bop, uint32_t v)
3334{
3335 printf ("put tv %d %d\n", bop, v);//D
3336 stream_put (s, bop);
3337 stream_put_v (s, v);
3338}
3339
3340ecb_cold static void
3341stream_put_stream (stream s, stream o)
3342{
3343 uint32_t i;
3344
3345 for (i = 0; i < stream_size (o); ++i)
3346 stream_put (s, stream_data (o)[i]);
3347
3348 stream_free (o);
3349}
3350
3351ecb_cold static uint32_t
3352cell_id (SCHEME_P_ pointer x)
3353{
3354 struct cell *p = CELL (x);
3355 int i;
3356
3357 for (i = SCHEME_V->last_cell_seg; i >= 0; --i)
3358 if (SCHEME_V->cell_seg[i] <= p && p < SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize[i])
3359 return i | ((p - SCHEME_V->cell_seg[i]) << CELL_NSEGMENT_LOG);
3360
3361 abort ();
3362}
3363
3364// calculates a (preferably small) integer that makes it possible to find
3365// the symbol again. if pointers were offsets into a memory area... until
3366// then, we return segment number in the low bits, and offset in the high
3367// bits.
3368// also, this function must never return 0.
3369ecb_cold static uint32_t
3370symbol_id (SCHEME_P_ pointer sym)
3371{
3372 return cell_id (SCHEME_A_ sym);
3373}
3374
3375enum byteop
3376{
3377 BOP_NIL,
3378 BOP_INTEGER,
3379 BOP_SYMBOL,
3380 BOP_DATUM,
3381 BOP_LIST_BEG,
3382 BOP_LIST_END,
3383 BOP_IF,
3384 BOP_AND,
3385 BOP_OR,
3386 BOP_CASE,
3387 BOP_COND,
3388 BOP_LET,
3389 BOP_LETAST,
3390 BOP_LETREC,
3391 BOP_DEFINE,
3392 BOP_MACRO,
3393 BOP_SET,
3394 BOP_BEGIN,
3395 BOP_LAMBDA,
3396 BOP_OP,
3397};
3398
3399ecb_cold static void compile_expr (SCHEME_P_ stream s, pointer x);
3400
3401ecb_cold static void
3402compile_list (SCHEME_P_ stream s, pointer x)
3403{
3404 // TODO: improper list
3405
3406 for (; x != NIL; x = cdr (x))
3407 {
3408 stream t = stream_init ();
3409 compile_expr (SCHEME_A_ t, car (x));
3410 stream_put_v (s, stream_size (t));
3411 stream_put_stream (s, t);
3412 }
3413
3414 stream_put_v (s, 0);
3415}
3416
3417static void
3418compile_if (SCHEME_P_ stream s, pointer cond, pointer ift, pointer iff)
3419{
3420 stream sift = stream_init (); compile_expr (SCHEME_A_ sift, ift);
3421
3422 stream_put (s, BOP_IF);
3423 compile_expr (SCHEME_A_ s, cond);
3424 stream_put_v (s, stream_size (sift));
3425 stream_put_stream (s, sift);
3426 compile_expr (SCHEME_A_ s, iff);
3427}
3428
3429typedef uint32_t stream_fixup;
3430
3431static stream_fixup
3432stream_put_fixup (stream s)
3433{
3434 stream_put (s, 0);
3435 stream_put (s, 0);
3436
3437 return stream_size (s);
3438}
3439
3440static void
3441stream_fix_fixup (stream s, stream_fixup fixup, uint32_t target)
3442{
3443 target -= fixup;
3444 assert (target < (1 << 14));
3445 stream_data (s)[fixup - 2] = target | 0x80;
3446 stream_data (s)[fixup - 1] = target >> 7;
3447}
3448
3449static void
3450compile_and_or (SCHEME_P_ stream s, int and, pointer x)
3451{
3452 for (; cdr (x) != NIL; x = cdr (x))
3453 {
3454 stream t = stream_init ();
3455 compile_expr (SCHEME_A_ t, car (x));
3456 stream_put_v (s, stream_size (t));
3457 stream_put_stream (s, t);
3458 }
3459
3460 stream_put_v (s, 0);
3461}
3462
3463static void
3464compile_case (SCHEME_P_ stream s, pointer x)
3465{
3466 compile_expr (SCHEME_A_ s, caar (x));
3467
3468 for (;;)
3469 {
3470 x = cdr (x);
3471
3472 if (x == NIL)
3473 break;
3474
3475 compile_expr (SCHEME_A_ s, caar (x));
3476 stream t = stream_init (); compile_expr (SCHEME_A_ t, cdar (x));
3477 stream_put_v (s, stream_size (t));
3478 stream_put_stream (s, t);
3479 }
3480
3481 stream_put_v (s, 0);
3482}
3483
3484static void
3485compile_cond (SCHEME_P_ stream s, pointer x)
3486{
3487 for ( ; x != NIL; x = cdr (x))
3488 {
3489 compile_expr (SCHEME_A_ s, caar (x));
3490 stream t = stream_init (); compile_expr (SCHEME_A_ t, cdar (x));
3491 stream_put_v (s, stream_size (t));
3492 stream_put_stream (s, t);
3493 }
3494
3495 stream_put_v (s, 0);
3496}
3497
3305static int 3498static pointer
3499lookup (SCHEME_P_ pointer x)
3500{
3501 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, x, 1);
3502
3503 if (x != NIL)
3504 x = slot_value_in_env (x);
3505
3506 return x;
3507}
3508
3509ecb_cold static void
3510compile_expr (SCHEME_P_ stream s, pointer x)
3511{
3512 if (x == NIL)
3513 {
3514 stream_put (s, BOP_NIL);
3515 return;
3516 }
3517
3518 if (is_pair (x))
3519 {
3520 pointer head = car (x);
3521
3522 if (is_syntax (head))
3523 {
3524 x = cdr (x);
3525
3526 switch (syntaxnum (head))
3527 {
3528 case OP_IF0: /* if */
3529 stream_put_v (s, BOP_IF);
3530 compile_if (SCHEME_A_ s, car (x), cadr (x), caddr (x));
3531 break;
3532
3533 case OP_OR0: /* or */
3534 stream_put_v (s, BOP_OR);
3535 compile_and_or (SCHEME_A_ s, 0, x);
3536 break;
3537
3538 case OP_AND0: /* and */
3539 stream_put_v (s, BOP_AND);
3540 compile_and_or (SCHEME_A_ s, 1, x);
3541 break;
3542
3543 case OP_CASE0: /* case */
3544 stream_put_v (s, BOP_CASE);
3545 compile_case (SCHEME_A_ s, x);
3546 break;
3547
3548 case OP_COND0: /* cond */
3549 stream_put_v (s, BOP_COND);
3550 compile_cond (SCHEME_A_ s, x);
3551 break;
3552
3553 case OP_LET0: /* let */
3554 case OP_LET0AST: /* let* */
3555 case OP_LET0REC: /* letrec */
3556 switch (syntaxnum (head))
3557 {
3558 case OP_LET0: stream_put (s, BOP_LET ); break;
3559 case OP_LET0AST: stream_put (s, BOP_LETAST); break;
3560 case OP_LET0REC: stream_put (s, BOP_LETREC); break;
3561 }
3562
3563 {
3564 pointer bindings = car (x);
3565 pointer body = cadr (x);
3566
3567 for (x = bindings; x != NIL; x = cdr (x))
3568 {
3569 pointer init = NIL;
3570 pointer var = car (x);
3571
3572 if (is_pair (var))
3573 {
3574 init = cdr (var);
3575 var = car (var);
3576 }
3577
3578 stream_put_v (s, symbol_id (SCHEME_A_ var));
3579 compile_expr (SCHEME_A_ s, init);
3580 }
3581
3582 stream_put_v (s, 0);
3583 compile_expr (SCHEME_A_ s, body);
3584 }
3585 break;
3586
3587 case OP_DEF0: /* define */
3588 case OP_MACRO0: /* macro */
3589 stream_put (s, syntaxnum (head) == OP_DEF0 ? BOP_DEFINE : BOP_MACRO);
3590 stream_put_v (s, cell_id (SCHEME_A_ car (x)));
3591 compile_expr (SCHEME_A_ s, cadr (x));
3592 break;
3593
3594 case OP_SET0: /* set! */
3595 stream_put (s, BOP_SET);
3596 stream_put_v (s, symbol_id (SCHEME_A_ car (x)));
3597 compile_expr (SCHEME_A_ s, cadr (x));
3598 break;
3599
3600 case OP_BEGIN: /* begin */
3601 stream_put (s, BOP_BEGIN);
3602 compile_list (SCHEME_A_ s, x);
3603 return;
3604
3605 case OP_DELAY: /* delay */
3606 abort ();
3607 break;
3608
3609 case OP_QUOTE: /* quote */
3610 stream_put_tv (s, BOP_DATUM, cell_id (SCHEME_A_ x));
3611 break;
3612
3613 case OP_LAMBDA: /* lambda */
3614 {
3615 pointer formals = car (x);
3616 pointer body = cadr (x);
3617
3618 stream_put (s, BOP_LAMBDA);
3619
3620 for (; is_pair (formals); formals = cdr (formals))
3621 stream_put_v (s, symbol_id (SCHEME_A_ car (formals)));
3622
3623 stream_put_v (s, 0);
3624 stream_put_v (s, formals == NIL ? 0 : symbol_id (SCHEME_A_ formals));
3625
3626 compile_expr (SCHEME_A_ s, body);
3627 }
3628 break;
3629
3630 case OP_C0STREAM:/* cons-stream */
3631 abort ();
3632 break;
3633 }
3634
3635 return;
3636 }
3637
3638 pointer m = lookup (SCHEME_A_ head);
3639
3640 if (is_macro (m))
3641 {
3642 s_save (SCHEME_A_ OP_DEBUG2, SCHEME_V->args, SCHEME_V->code);
3643 SCHEME_V->code = m;
3644 SCHEME_V->args = cons (x, NIL);
3645 Eval_Cycle (SCHEME_A_ OP_APPLY);
3646 x = SCHEME_V->value;
3647 compile_expr (SCHEME_A_ s, SCHEME_V->value);
3648 return;
3649 }
3650
3651 stream_put (s, BOP_LIST_BEG);
3652
3653 for (; x != NIL; x = cdr (x))
3654 compile_expr (SCHEME_A_ s, car (x));
3655
3656 stream_put (s, BOP_LIST_END);
3657 return;
3658 }
3659
3660 switch (type (x))
3661 {
3662 case T_INTEGER:
3663 {
3664 IVALUE iv = ivalue_unchecked (x);
3665 iv = iv < 0 ? ((~(uint32_t)iv) << 1) | 1 : (uint32_t)iv << 1;
3666 stream_put_tv (s, BOP_INTEGER, iv);
3667 }
3668 return;
3669
3670 case T_SYMBOL:
3671 if (0)
3672 {
3673 // no can do without more analysis
3674 pointer m = lookup (SCHEME_A_ x);
3675
3676 if (is_proc (m))
3677 {
3678 printf ("compile proc %s %d\n", procname(m), procnum(m));
3679 stream_put_tv (s, BOP_SYMBOL, BOP_OP + procnum (m));
3680 }
3681 else
3682 stream_put_tv (s, BOP_SYMBOL, symbol_id (SCHEME_A_ x));
3683 }
3684
3685 stream_put_tv (s, BOP_SYMBOL, symbol_id (SCHEME_A_ x));
3686 return;
3687
3688 default:
3689 stream_put_tv (s, BOP_DATUM, cell_id (SCHEME_A_ x));
3690 break;
3691 }
3692}
3693
3694ecb_cold static int
3695compile_closure (SCHEME_P_ pointer p)
3696{
3697 stream s = stream_init ();
3698
3699 compile_list (SCHEME_A_ s, cdar (p));
3700
3701 FILE *xxd = popen ("xxd", "we");
3702 fwrite (stream_data (s), 1, stream_size (s), xxd);
3703 fclose (xxd);
3704
3705 return stream_size (s);
3706}
3707
3708#endif
3709
3710/* syntax, eval, core, ... */
3711ecb_hot static int
3306opexe_0 (SCHEME_P_ enum scheme_opcodes op) 3712opexe_0 (SCHEME_P_ enum scheme_opcodes op)
3307{ 3713{
3308 pointer args = SCHEME_V->args; 3714 pointer args = SCHEME_V->args;
3309 pointer x, y; 3715 pointer x, y;
3310 3716
3311 switch (op) 3717 switch (op)
3312 { 3718 {
3313#if 1 //D 3719#if EXPERIMENT //D
3314 case OP_DEBUG: 3720 case OP_DEBUG:
3315 printf ("len = %d\n", debug (SCHEME_A_ 0, args) / 8); 3721 {
3722 uint32_t len = compile_closure (SCHEME_A_ car (args));
3723 printf ("len = %d\n", len);
3316 printf ("\n"); 3724 printf ("\n");
3317 s_return (S_T); 3725 s_return (S_T);
3726 }
3727
3728 case OP_DEBUG2:
3729 return -1;
3318#endif 3730#endif
3731
3319 case OP_LOAD: /* load */ 3732 case OP_LOAD: /* load */
3320 if (file_interactive (SCHEME_A)) 3733 if (file_interactive (SCHEME_A))
3321 { 3734 {
3322 xwrstr ("Loading "); xwrstr (strvalue (car (args))); xwrstr ("\n"); 3735 putstr (SCHEME_A_ "Loading ");
3323 //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args))); 3736 putstr (SCHEME_A_ strvalue (car (args)));
3737 putcharacter (SCHEME_A_ '\n');
3324 } 3738 }
3325 3739
3326 if (!file_push (SCHEME_A_ strvalue (car (args)))) 3740 if (!file_push (SCHEME_A_ strvalue (car (args))))
3327 Error_1 ("unable to open", car (args)); 3741 Error_1 ("unable to open", car (args));
3328 else 3742
3329 {
3330 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i); 3743 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i);
3331 s_goto (OP_T0LVL); 3744 s_goto (OP_T0LVL);
3332 }
3333 3745
3334 case OP_T0LVL: /* top level */ 3746 case OP_T0LVL: /* top level */
3335 3747
3336 /* If we reached the end of file, this loop is done. */ 3748 /* If we reached the end of file, this loop is done. */
3337 if (SCHEME_V->loadport->object.port->kind & port_saw_EOF) 3749 if (port (SCHEME_V->loadport)->kind & port_saw_EOF)
3338 { 3750 {
3339 if (SCHEME_V->file_i == 0) 3751 if (SCHEME_V->file_i == 0)
3340 { 3752 {
3341 SCHEME_V->args = NIL; 3753 SCHEME_V->args = NIL;
3342 s_goto (OP_QUIT); 3754 s_goto (OP_QUIT);
… …
3353 /* If interactive, be nice to user. */ 3765 /* If interactive, be nice to user. */
3354 if (file_interactive (SCHEME_A)) 3766 if (file_interactive (SCHEME_A))
3355 { 3767 {
3356 SCHEME_V->envir = SCHEME_V->global_env; 3768 SCHEME_V->envir = SCHEME_V->global_env;
3357 dump_stack_reset (SCHEME_A); 3769 dump_stack_reset (SCHEME_A);
3358 putstr (SCHEME_A_ "\n"); 3770 putcharacter (SCHEME_A_ '\n');
3771#if EXPERIMENT
3772 system ("ps v $PPID");
3773#endif
3359 putstr (SCHEME_A_ prompt); 3774 putstr (SCHEME_A_ prompt);
3360 } 3775 }
3361 3776
3362 /* Set up another iteration of REPL */ 3777 /* Set up another iteration of REPL */
3363 SCHEME_V->nesting = 0; 3778 SCHEME_V->nesting = 0;
… …
3398 { 3813 {
3399 SCHEME_V->print_flag = 1; 3814 SCHEME_V->print_flag = 1;
3400 SCHEME_V->args = SCHEME_V->value; 3815 SCHEME_V->args = SCHEME_V->value;
3401 s_goto (OP_P0LIST); 3816 s_goto (OP_P0LIST);
3402 } 3817 }
3403 else 3818
3404 s_return (SCHEME_V->value); 3819 s_return (SCHEME_V->value);
3405 3820
3406 case OP_EVAL: /* main part of evaluation */ 3821 case OP_EVAL: /* main part of evaluation */
3407#if USE_TRACING 3822#if USE_TRACING
3408 if (SCHEME_V->tracing) 3823 if (SCHEME_V->tracing)
3409 { 3824 {
… …
3420#endif 3835#endif
3421 if (is_symbol (SCHEME_V->code)) /* symbol */ 3836 if (is_symbol (SCHEME_V->code)) /* symbol */
3422 { 3837 {
3423 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 1); 3838 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 1);
3424 3839
3425 if (x != NIL) 3840 if (x == NIL)
3426 s_return (slot_value_in_env (x));
3427 else
3428 Error_1 ("eval: unbound variable:", SCHEME_V->code); 3841 Error_1 ("eval: unbound variable:", SCHEME_V->code);
3842
3843 s_return (slot_value_in_env (x));
3429 } 3844 }
3430 else if (is_pair (SCHEME_V->code)) 3845 else if (is_pair (SCHEME_V->code))
3431 { 3846 {
3432 x = car (SCHEME_V->code); 3847 x = car (SCHEME_V->code);
3433 3848
… …
3442 /* If no macros => s_save(SCHEME_A_ OP_E1ARGS, NIL, cdr(SCHEME_V->code)); */ 3857 /* If no macros => s_save(SCHEME_A_ OP_E1ARGS, NIL, cdr(SCHEME_V->code)); */
3443 SCHEME_V->code = x; 3858 SCHEME_V->code = x;
3444 s_goto (OP_EVAL); 3859 s_goto (OP_EVAL);
3445 } 3860 }
3446 } 3861 }
3447 else 3862
3448 s_return (SCHEME_V->code); 3863 s_return (SCHEME_V->code);
3449 3864
3450 case OP_E0ARGS: /* eval arguments */ 3865 case OP_E0ARGS: /* eval arguments */
3451 if (ecb_expect_false (is_macro (SCHEME_V->value))) /* macro expansion */ 3866 if (ecb_expect_false (is_macro (SCHEME_V->value))) /* macro expansion */
3452 { 3867 {
3453 s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL); 3868 s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL);
3454 SCHEME_V->args = cons (SCHEME_V->code, NIL); 3869 SCHEME_V->args = cons (SCHEME_V->code, NIL);
3455 SCHEME_V->code = SCHEME_V->value; 3870 SCHEME_V->code = SCHEME_V->value;
3456 s_goto (OP_APPLY); 3871 s_goto (OP_APPLY);
3457 } 3872 }
3458 else 3873
3459 {
3460 SCHEME_V->code = cdr (SCHEME_V->code); 3874 SCHEME_V->code = cdr (SCHEME_V->code);
3461 s_goto (OP_E1ARGS); 3875 s_goto (OP_E1ARGS);
3462 }
3463 3876
3464 case OP_E1ARGS: /* eval arguments */ 3877 case OP_E1ARGS: /* eval arguments */
3465 args = cons (SCHEME_V->value, args); 3878 args = cons (SCHEME_V->value, args);
3466 3879
3467 if (is_pair (SCHEME_V->code)) /* continue */ 3880 if (is_pair (SCHEME_V->code)) /* continue */
… …
3478 SCHEME_V->args = cdr (args); 3891 SCHEME_V->args = cdr (args);
3479 s_goto (OP_APPLY); 3892 s_goto (OP_APPLY);
3480 } 3893 }
3481 3894
3482#if USE_TRACING 3895#if USE_TRACING
3483
3484 case OP_TRACING: 3896 case OP_TRACING:
3485 { 3897 {
3486 int tr = SCHEME_V->tracing; 3898 int tr = SCHEME_V->tracing;
3487 3899
3488 SCHEME_V->tracing = ivalue_unchecked (car (args)); 3900 SCHEME_V->tracing = ivalue_unchecked (car (args));
3489 s_return (mk_integer (SCHEME_A_ tr)); 3901 s_return (mk_integer (SCHEME_A_ tr));
3490 } 3902 }
3491
3492#endif 3903#endif
3493 3904
3494 case OP_APPLY: /* apply 'code' to 'args' */ 3905 case OP_APPLY: /* apply 'code' to 'args' */
3495#if USE_TRACING 3906#if USE_TRACING
3496 if (SCHEME_V->tracing) 3907 if (SCHEME_V->tracing)
… …
3510 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */ 3921 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */
3511 else if (is_foreign (SCHEME_V->code)) 3922 else if (is_foreign (SCHEME_V->code))
3512 { 3923 {
3513 /* Keep nested calls from GC'ing the arglist */ 3924 /* Keep nested calls from GC'ing the arglist */
3514 push_recent_alloc (SCHEME_A_ args, NIL); 3925 push_recent_alloc (SCHEME_A_ args, NIL);
3515 x = SCHEME_V->code->object.ff (SCHEME_A_ args); 3926 x = CELL(SCHEME_V->code)->object.ff (SCHEME_A_ args);
3516 3927
3517 s_return (x); 3928 s_return (x);
3518 } 3929 }
3519 else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */ 3930 else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */
3520 { 3931 {
… …
3550 else if (is_continuation (SCHEME_V->code)) /* CONTINUATION */ 3961 else if (is_continuation (SCHEME_V->code)) /* CONTINUATION */
3551 { 3962 {
3552 ss_set_cont (SCHEME_A_ cont_dump (SCHEME_V->code)); 3963 ss_set_cont (SCHEME_A_ cont_dump (SCHEME_V->code));
3553 s_return (args != NIL ? car (args) : NIL); 3964 s_return (args != NIL ? car (args) : NIL);
3554 } 3965 }
3555 else 3966
3556 Error_0 ("illegal function"); 3967 Error_0 ("illegal function");
3557 3968
3558 case OP_DOMACRO: /* do macro */ 3969 case OP_DOMACRO: /* do macro */
3559 SCHEME_V->code = SCHEME_V->value; 3970 SCHEME_V->code = SCHEME_V->value;
3560 s_goto (OP_EVAL); 3971 s_goto (OP_EVAL);
3561
3562#if 1
3563 3972
3564 case OP_LAMBDA: /* lambda */ 3973 case OP_LAMBDA: /* lambda */
3565 /* If the hook is defined, apply it to SCHEME_V->code, otherwise 3974 /* If the hook is defined, apply it to SCHEME_V->code, otherwise
3566 set SCHEME_V->value fall thru */ 3975 set SCHEME_V->value fall thru */
3567 { 3976 {
… …
3574 SCHEME_V->code = slot_value_in_env (f); 3983 SCHEME_V->code = slot_value_in_env (f);
3575 s_goto (OP_APPLY); 3984 s_goto (OP_APPLY);
3576 } 3985 }
3577 3986
3578 SCHEME_V->value = SCHEME_V->code; 3987 SCHEME_V->value = SCHEME_V->code;
3579 /* Fallthru */
3580 } 3988 }
3989 /* Fallthru */
3581 3990
3582 case OP_LAMBDA1: 3991 case OP_LAMBDA1:
3583 s_return (mk_closure (SCHEME_A_ SCHEME_V->value, SCHEME_V->envir)); 3992 s_return (mk_closure (SCHEME_A_ SCHEME_V->value, SCHEME_V->envir));
3584
3585#else
3586
3587 case OP_LAMBDA: /* lambda */
3588 s_return (mk_closure (SCHEME_A_ SCHEME_V->code, SCHEME_V->envir));
3589
3590#endif
3591 3993
3592 case OP_MKCLOSURE: /* make-closure */ 3994 case OP_MKCLOSURE: /* make-closure */
3593 x = car (args); 3995 x = car (args);
3594 3996
3595 if (car (x) == SCHEME_V->LAMBDA) 3997 if (car (x) == SCHEME_V->LAMBDA)
… …
3634 else 4036 else
3635 new_slot_in_env (SCHEME_A_ SCHEME_V->code, SCHEME_V->value); 4037 new_slot_in_env (SCHEME_A_ SCHEME_V->code, SCHEME_V->value);
3636 4038
3637 s_return (SCHEME_V->code); 4039 s_return (SCHEME_V->code);
3638 4040
3639
3640 case OP_DEFP: /* defined? */ 4041 case OP_DEFP: /* defined? */
3641 x = SCHEME_V->envir; 4042 x = SCHEME_V->envir;
3642 4043
3643 if (cdr (args) != NIL) 4044 if (cdr (args) != NIL)
3644 x = cadr (args); 4045 x = cadr (args);
… …
3662 s_return (SCHEME_V->value); 4063 s_return (SCHEME_V->value);
3663 } 4064 }
3664 else 4065 else
3665 Error_1 ("set!: unbound variable:", SCHEME_V->code); 4066 Error_1 ("set!: unbound variable:", SCHEME_V->code);
3666 4067
3667
3668 case OP_BEGIN: /* begin */ 4068 case OP_BEGIN: /* begin */
3669 if (!is_pair (SCHEME_V->code)) 4069 if (!is_pair (SCHEME_V->code))
3670 s_return (SCHEME_V->code); 4070 s_return (SCHEME_V->code);
3671 4071
3672 if (cdr (SCHEME_V->code) != NIL) 4072 if (cdr (SCHEME_V->code) != NIL)
… …
3683 case OP_IF1: /* if */ 4083 case OP_IF1: /* if */
3684 if (is_true (SCHEME_V->value)) 4084 if (is_true (SCHEME_V->value))
3685 SCHEME_V->code = car (SCHEME_V->code); 4085 SCHEME_V->code = car (SCHEME_V->code);
3686 else 4086 else
3687 SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because * car(NIL) = NIL */ 4087 SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because * car(NIL) = NIL */
4088
3688 s_goto (OP_EVAL); 4089 s_goto (OP_EVAL);
3689 4090
3690 case OP_LET0: /* let */ 4091 case OP_LET0: /* let */
3691 SCHEME_V->args = NIL; 4092 SCHEME_V->args = NIL;
3692 SCHEME_V->value = SCHEME_V->code; 4093 SCHEME_V->value = SCHEME_V->code;
3693 SCHEME_V->code = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code); 4094 SCHEME_V->code = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code);
3694 s_goto (OP_LET1); 4095 s_goto (OP_LET1);
3695 4096
3696 case OP_LET1: /* let (calculate parameters) */ 4097 case OP_LET1: /* let (calculate parameters) */
4098 case OP_LET1REC: /* letrec (calculate parameters) */
3697 args = cons (SCHEME_V->value, args); 4099 args = cons (SCHEME_V->value, args);
3698 4100
3699 if (is_pair (SCHEME_V->code)) /* continue */ 4101 if (is_pair (SCHEME_V->code)) /* continue */
3700 { 4102 {
3701 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code))) 4103 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code)))
3702 Error_1 ("Bad syntax of binding spec in let :", car (SCHEME_V->code)); 4104 Error_1 ("Bad syntax of binding spec in let/letrec:", car (SCHEME_V->code));
3703 4105
3704 s_save (SCHEME_A_ OP_LET1, args, cdr (SCHEME_V->code)); 4106 s_save (SCHEME_A_ op, args, cdr (SCHEME_V->code));
3705 SCHEME_V->code = cadar (SCHEME_V->code); 4107 SCHEME_V->code = cadar (SCHEME_V->code);
3706 SCHEME_V->args = NIL; 4108 SCHEME_V->args = NIL;
3707 s_goto (OP_EVAL); 4109 s_goto (OP_EVAL);
3708 } 4110 }
3709 else /* end */ 4111
3710 { 4112 /* end */
3711 args = reverse_in_place (SCHEME_A_ NIL, args); 4113 args = reverse_in_place (SCHEME_A_ NIL, args);
3712 SCHEME_V->code = car (args); 4114 SCHEME_V->code = car (args);
3713 SCHEME_V->args = cdr (args); 4115 SCHEME_V->args = cdr (args);
3714 s_goto (OP_LET2); 4116 s_goto (op == OP_LET1 ? OP_LET2 : OP_LET2REC);
3715 }
3716 4117
3717 case OP_LET2: /* let */ 4118 case OP_LET2: /* let */
3718 new_frame_in_env (SCHEME_A_ SCHEME_V->envir); 4119 new_frame_in_env (SCHEME_A_ SCHEME_V->envir);
3719 4120
3720 for (x = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code), y = args; 4121 for (x = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code), y = args;
… …
3724 if (is_symbol (car (SCHEME_V->code))) /* named let */ 4125 if (is_symbol (car (SCHEME_V->code))) /* named let */
3725 { 4126 {
3726 for (x = cadr (SCHEME_V->code), args = NIL; x != NIL; x = cdr (x)) 4127 for (x = cadr (SCHEME_V->code), args = NIL; x != NIL; x = cdr (x))
3727 { 4128 {
3728 if (!is_pair (x)) 4129 if (!is_pair (x))
3729 Error_1 ("Bad syntax of binding in let :", x); 4130 Error_1 ("Bad syntax of binding in let:", x);
3730 4131
3731 if (!is_list (SCHEME_A_ car (x))) 4132 if (!is_list (SCHEME_A_ car (x)))
3732 Error_1 ("Bad syntax of binding in let :", car (x)); 4133 Error_1 ("Bad syntax of binding in let:", car (x));
3733 4134
3734 args = cons (caar (x), args); 4135 args = cons (caar (x), args);
3735 } 4136 }
3736 4137
3737 x = mk_closure (SCHEME_A_ cons (reverse_in_place (SCHEME_A_ NIL, args), cddr (SCHEME_V->code)), 4138 x = mk_closure (SCHEME_A_ cons (reverse_in_place (SCHEME_A_ NIL, args), cddr (SCHEME_V->code)),
… …
3754 SCHEME_V->code = cdr (SCHEME_V->code); 4155 SCHEME_V->code = cdr (SCHEME_V->code);
3755 s_goto (OP_BEGIN); 4156 s_goto (OP_BEGIN);
3756 } 4157 }
3757 4158
3758 if (!is_pair (car (SCHEME_V->code)) || !is_pair (caar (SCHEME_V->code)) || !is_pair (cdaar (SCHEME_V->code))) 4159 if (!is_pair (car (SCHEME_V->code)) || !is_pair (caar (SCHEME_V->code)) || !is_pair (cdaar (SCHEME_V->code)))
3759 Error_1 ("Bad syntax of binding spec in let* :", car (SCHEME_V->code)); 4160 Error_1 ("Bad syntax of binding spec in let*:", car (SCHEME_V->code));
3760 4161
3761 s_save (SCHEME_A_ OP_LET1AST, cdr (SCHEME_V->code), car (SCHEME_V->code)); 4162 s_save (SCHEME_A_ OP_LET1AST, cdr (SCHEME_V->code), car (SCHEME_V->code));
3762 SCHEME_V->code = car (cdaar (SCHEME_V->code)); 4163 SCHEME_V->code = car (cdaar (SCHEME_V->code));
3763 s_goto (OP_EVAL); 4164 s_goto (OP_EVAL);
3764 4165
… …
3775 s_save (SCHEME_A_ OP_LET2AST, args, SCHEME_V->code); 4176 s_save (SCHEME_A_ OP_LET2AST, args, SCHEME_V->code);
3776 SCHEME_V->code = cadar (SCHEME_V->code); 4177 SCHEME_V->code = cadar (SCHEME_V->code);
3777 SCHEME_V->args = NIL; 4178 SCHEME_V->args = NIL;
3778 s_goto (OP_EVAL); 4179 s_goto (OP_EVAL);
3779 } 4180 }
3780 else /* end */ 4181
4182 /* end */
3781 { 4183
3782 SCHEME_V->code = args; 4184 SCHEME_V->code = args;
3783 SCHEME_V->args = NIL; 4185 SCHEME_V->args = NIL;
3784 s_goto (OP_BEGIN); 4186 s_goto (OP_BEGIN);
3785 }
3786 4187
3787 case OP_LET0REC: /* letrec */ 4188 case OP_LET0REC: /* letrec */
3788 new_frame_in_env (SCHEME_A_ SCHEME_V->envir); 4189 new_frame_in_env (SCHEME_A_ SCHEME_V->envir);
3789 SCHEME_V->args = NIL; 4190 SCHEME_V->args = NIL;
3790 SCHEME_V->value = SCHEME_V->code; 4191 SCHEME_V->value = SCHEME_V->code;
3791 SCHEME_V->code = car (SCHEME_V->code); 4192 SCHEME_V->code = car (SCHEME_V->code);
3792 s_goto (OP_LET1REC); 4193 s_goto (OP_LET1REC);
3793 4194
3794 case OP_LET1REC: /* letrec (calculate parameters) */ 4195 /* OP_LET1REC handled by OP_LET1 */
3795 args = cons (SCHEME_V->value, args);
3796
3797 if (is_pair (SCHEME_V->code)) /* continue */
3798 {
3799 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code)))
3800 Error_1 ("Bad syntax of binding spec in letrec :", car (SCHEME_V->code));
3801
3802 s_save (SCHEME_A_ OP_LET1REC, args, cdr (SCHEME_V->code));
3803 SCHEME_V->code = cadar (SCHEME_V->code);
3804 SCHEME_V->args = NIL;
3805 s_goto (OP_EVAL);
3806 }
3807 else /* end */
3808 {
3809 args = reverse_in_place (SCHEME_A_ NIL, args);
3810 SCHEME_V->code = car (args);
3811 SCHEME_V->args = cdr (args);
3812 s_goto (OP_LET2REC);
3813 }
3814 4196
3815 case OP_LET2REC: /* letrec */ 4197 case OP_LET2REC: /* letrec */
3816 for (x = car (SCHEME_V->code), y = args; y != NIL; x = cdr (x), y = cdr (y)) 4198 for (x = car (SCHEME_V->code), y = args; y != NIL; x = cdr (x), y = cdr (y))
3817 new_slot_in_env (SCHEME_A_ caar (x), car (y)); 4199 new_slot_in_env (SCHEME_A_ caar (x), car (y));
3818 4200
… …
3848 } 4230 }
3849 else 4231 else
3850 { 4232 {
3851 if ((SCHEME_V->code = cdr (SCHEME_V->code)) == NIL) 4233 if ((SCHEME_V->code = cdr (SCHEME_V->code)) == NIL)
3852 s_return (NIL); 4234 s_return (NIL);
3853 else 4235
3854 {
3855 s_save (SCHEME_A_ OP_COND1, NIL, SCHEME_V->code); 4236 s_save (SCHEME_A_ OP_COND1, NIL, SCHEME_V->code);
3856 SCHEME_V->code = caar (SCHEME_V->code); 4237 SCHEME_V->code = caar (SCHEME_V->code);
3857 s_goto (OP_EVAL); 4238 s_goto (OP_EVAL);
3858 }
3859 } 4239 }
3860 4240
3861 case OP_DELAY: /* delay */ 4241 case OP_DELAY: /* delay */
3862 x = mk_closure (SCHEME_A_ cons (NIL, SCHEME_V->code), SCHEME_V->envir); 4242 x = mk_closure (SCHEME_A_ cons (NIL, SCHEME_V->code), SCHEME_V->envir);
3863 set_typeflag (x, T_PROMISE); 4243 set_typeflag (x, T_PROMISE);
… …
3874 case OP_AND1: /* and */ 4254 case OP_AND1: /* and */
3875 if (is_false (SCHEME_V->value)) 4255 if (is_false (SCHEME_V->value))
3876 s_return (SCHEME_V->value); 4256 s_return (SCHEME_V->value);
3877 else if (SCHEME_V->code == NIL) 4257 else if (SCHEME_V->code == NIL)
3878 s_return (SCHEME_V->value); 4258 s_return (SCHEME_V->value);
3879 else 4259
3880 {
3881 s_save (SCHEME_A_ OP_AND1, NIL, cdr (SCHEME_V->code)); 4260 s_save (SCHEME_A_ OP_AND1, NIL, cdr (SCHEME_V->code));
3882 SCHEME_V->code = car (SCHEME_V->code); 4261 SCHEME_V->code = car (SCHEME_V->code);
3883 s_goto (OP_EVAL); 4262 s_goto (OP_EVAL);
3884 }
3885 4263
3886 case OP_OR0: /* or */ 4264 case OP_OR0: /* or */
3887 if (SCHEME_V->code == NIL) 4265 if (SCHEME_V->code == NIL)
3888 s_return (S_F); 4266 s_return (S_F);
3889 4267
… …
3894 case OP_OR1: /* or */ 4272 case OP_OR1: /* or */
3895 if (is_true (SCHEME_V->value)) 4273 if (is_true (SCHEME_V->value))
3896 s_return (SCHEME_V->value); 4274 s_return (SCHEME_V->value);
3897 else if (SCHEME_V->code == NIL) 4275 else if (SCHEME_V->code == NIL)
3898 s_return (SCHEME_V->value); 4276 s_return (SCHEME_V->value);
3899 else 4277
3900 {
3901 s_save (SCHEME_A_ OP_OR1, NIL, cdr (SCHEME_V->code)); 4278 s_save (SCHEME_A_ OP_OR1, NIL, cdr (SCHEME_V->code));
3902 SCHEME_V->code = car (SCHEME_V->code); 4279 SCHEME_V->code = car (SCHEME_V->code);
3903 s_goto (OP_EVAL); 4280 s_goto (OP_EVAL);
3904 }
3905 4281
3906 case OP_C0STREAM: /* cons-stream */ 4282 case OP_C0STREAM: /* cons-stream */
3907 s_save (SCHEME_A_ OP_C1STREAM, NIL, cdr (SCHEME_V->code)); 4283 s_save (SCHEME_A_ OP_C1STREAM, NIL, cdr (SCHEME_V->code));
3908 SCHEME_V->code = car (SCHEME_V->code); 4284 SCHEME_V->code = car (SCHEME_V->code);
3909 s_goto (OP_EVAL); 4285 s_goto (OP_EVAL);
… …
3974 s_save (SCHEME_A_ OP_CASE2, NIL, cdar (x)); 4350 s_save (SCHEME_A_ OP_CASE2, NIL, cdar (x));
3975 SCHEME_V->code = caar (x); 4351 SCHEME_V->code = caar (x);
3976 s_goto (OP_EVAL); 4352 s_goto (OP_EVAL);
3977 } 4353 }
3978 } 4354 }
3979 else 4355
3980 s_return (NIL); 4356 s_return (NIL);
3981 4357
3982 case OP_CASE2: /* case */ 4358 case OP_CASE2: /* case */
3983 if (is_true (SCHEME_V->value)) 4359 if (is_true (SCHEME_V->value))
3984 s_goto (OP_BEGIN); 4360 s_goto (OP_BEGIN);
3985 else 4361
3986 s_return (NIL); 4362 s_return (NIL);
3987 4363
3988 case OP_PAPPLY: /* apply */ 4364 case OP_PAPPLY: /* apply */
3989 SCHEME_V->code = car (args); 4365 SCHEME_V->code = car (args);
3990 SCHEME_V->args = list_star (SCHEME_A_ cdr (args)); 4366 SCHEME_V->args = list_star (SCHEME_A_ cdr (args));
3991 /*SCHEME_V->args = cadr(args); */ 4367 /*SCHEME_V->args = cadr(args); */
… …
4005 } 4381 }
4006 4382
4007 if (USE_ERROR_CHECKING) abort (); 4383 if (USE_ERROR_CHECKING) abort ();
4008} 4384}
4009 4385
4010static int 4386/* math, cxr */
4387ecb_hot static int
4011opexe_1 (SCHEME_P_ enum scheme_opcodes op) 4388opexe_1 (SCHEME_P_ enum scheme_opcodes op)
4012{ 4389{
4013 pointer args = SCHEME_V->args; 4390 pointer args = SCHEME_V->args;
4014 pointer x = car (args); 4391 pointer x = car (args);
4015 num v; 4392 num v;
4016 4393
4017 switch (op) 4394 switch (op)
4018 { 4395 {
4019#if USE_MATH 4396#if USE_MATH
4020 case OP_INEX2EX: /* inexact->exact */ 4397 case OP_INEX2EX: /* inexact->exact */
4021 {
4022 if (is_integer (x)) 4398 if (!is_integer (x))
4023 s_return (x); 4399 {
4024
4025 RVALUE r = rvalue_unchecked (x); 4400 RVALUE r = rvalue_unchecked (x);
4026 4401
4027 if (r == (RVALUE)(IVALUE)r) 4402 if (r == (RVALUE)(IVALUE)r)
4028 s_return (mk_integer (SCHEME_A_ rvalue_unchecked (x))); 4403 x = mk_integer (SCHEME_A_ rvalue_unchecked (x));
4029 else 4404 else
4030 Error_1 ("inexact->exact: not integral:", x); 4405 Error_1 ("inexact->exact: not integral:", x);
4031 } 4406 }
4032 4407
4408 s_return (x);
4409
4410 case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x))));
4411 case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x))));
4412 case OP_TRUNCATE: s_return (mk_real (SCHEME_A_ trunc (rvalue (x))));
4413 case OP_ROUND: s_return (mk_real (SCHEME_A_ nearbyint (rvalue (x))));
4414
4415 case OP_SQRT: s_return (mk_real (SCHEME_A_ sqrt (rvalue (x))));
4033 case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x)))); 4416 case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x))));
4034 case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x)))); 4417 case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x))
4418 / (cadr (args) == NIL ? 1 : log (rvalue (cadr (args))))));
4035 case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x)))); 4419 case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x))));
4036 case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x)))); 4420 case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x))));
4037 case OP_TAN: s_return (mk_real (SCHEME_A_ tan (rvalue (x)))); 4421 case OP_TAN: s_return (mk_real (SCHEME_A_ tan (rvalue (x))));
4038 case OP_ASIN: s_return (mk_real (SCHEME_A_ asin (rvalue (x)))); 4422 case OP_ASIN: s_return (mk_real (SCHEME_A_ asin (rvalue (x))));
4039 case OP_ACOS: s_return (mk_real (SCHEME_A_ acos (rvalue (x)))); 4423 case OP_ACOS: s_return (mk_real (SCHEME_A_ acos (rvalue (x))));
4040 4424
4041 case OP_ATAN: 4425 case OP_ATAN:
4426 s_return (mk_real (SCHEME_A_
4042 if (cdr (args) == NIL) 4427 cdr (args) == NIL
4043 s_return (mk_real (SCHEME_A_ atan (rvalue (x)))); 4428 ? atan (rvalue (x))
4044 else 4429 : atan2 (rvalue (x), rvalue (cadr (args)))));
4045 {
4046 pointer y = cadr (args);
4047 s_return (mk_real (SCHEME_A_ atan2 (rvalue (x), rvalue (y))));
4048 }
4049
4050 case OP_SQRT:
4051 s_return (mk_real (SCHEME_A_ sqrt (rvalue (x))));
4052 4430
4053 case OP_EXPT: 4431 case OP_EXPT:
4054 { 4432 {
4055 RVALUE result; 4433 RVALUE result;
4056 int real_result = 1; 4434 int real_result = 1;
… …
4079 if (real_result) 4457 if (real_result)
4080 s_return (mk_real (SCHEME_A_ result)); 4458 s_return (mk_real (SCHEME_A_ result));
4081 else 4459 else
4082 s_return (mk_integer (SCHEME_A_ result)); 4460 s_return (mk_integer (SCHEME_A_ result));
4083 } 4461 }
4084
4085 case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x))));
4086 case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x))));
4087
4088 case OP_TRUNCATE:
4089 {
4090 RVALUE n = rvalue (x);
4091 s_return (mk_real (SCHEME_A_ n > 0 ? floor (n) : ceil (n)));
4092 }
4093
4094 case OP_ROUND:
4095 if (is_integer (x))
4096 s_return (x);
4097
4098 s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x))));
4099#endif 4462#endif
4100 4463
4101 case OP_ADD: /* + */ 4464 case OP_ADD: /* + */
4102 v = num_zero; 4465 v = num_zero;
4103 4466
… …
4191 else 4554 else
4192 Error_0 ("modulo: division by zero"); 4555 Error_0 ("modulo: division by zero");
4193 4556
4194 s_return (mk_number (SCHEME_A_ v)); 4557 s_return (mk_number (SCHEME_A_ v));
4195 4558
4196 case OP_CAR: /* car */ 4559 /* the compiler will optimize this mess... */
4197 s_return (caar (args)); 4560 case OP_CAR: op_car: s_return (car (x));
4198 4561 case OP_CDR: op_cdr: s_return (cdr (x));
4199 case OP_CDR: /* cdr */ 4562 case OP_CAAR: op_caar: x = car (x); goto op_car;
4200 s_return (cdar (args)); 4563 case OP_CADR: op_cadr: x = cdr (x); goto op_car;
4564 case OP_CDAR: op_cdar: x = car (x); goto op_cdr;
4565 case OP_CDDR: op_cddr: x = cdr (x); goto op_cdr;
4566 case OP_CAAAR: op_caaar: x = car (x); goto op_caar;
4567 case OP_CAADR: op_caadr: x = cdr (x); goto op_caar;
4568 case OP_CADAR: op_cadar: x = car (x); goto op_cadr;
4569 case OP_CADDR: op_caddr: x = cdr (x); goto op_cadr;
4570 case OP_CDAAR: op_cdaar: x = car (x); goto op_cdar;
4571 case OP_CDADR: op_cdadr: x = cdr (x); goto op_cdar;
4572 case OP_CDDAR: op_cddar: x = car (x); goto op_cddr;
4573 case OP_CDDDR: op_cdddr: x = cdr (x); goto op_cddr;
4574 case OP_CAAAAR: x = car (x); goto op_caaar;
4575 case OP_CAAADR: x = cdr (x); goto op_caaar;
4576 case OP_CAADAR: x = car (x); goto op_caadr;
4577 case OP_CAADDR: x = cdr (x); goto op_caadr;
4578 case OP_CADAAR: x = car (x); goto op_cadar;
4579 case OP_CADADR: x = cdr (x); goto op_cadar;
4580 case OP_CADDAR: x = car (x); goto op_caddr;
4581 case OP_CADDDR: x = cdr (x); goto op_caddr;
4582 case OP_CDAAAR: x = car (x); goto op_cdaar;
4583 case OP_CDAADR: x = cdr (x); goto op_cdaar;
4584 case OP_CDADAR: x = car (x); goto op_cdadr;
4585 case OP_CDADDR: x = cdr (x); goto op_cdadr;
4586 case OP_CDDAAR: x = car (x); goto op_cddar;
4587 case OP_CDDADR: x = cdr (x); goto op_cddar;
4588 case OP_CDDDAR: x = car (x); goto op_cdddr;
4589 case OP_CDDDDR: x = cdr (x); goto op_cdddr;
4201 4590
4202 case OP_CONS: /* cons */ 4591 case OP_CONS: /* cons */
4203 set_cdr (args, cadr (args)); 4592 set_cdr (args, cadr (args));
4204 s_return (args); 4593 s_return (args);
4205 4594
… …
4379 memcpy (pos, strvalue (car (x)), strlength (car (x))); 4768 memcpy (pos, strvalue (car (x)), strlength (car (x)));
4380 4769
4381 s_return (newstr); 4770 s_return (newstr);
4382 } 4771 }
4383 4772
4384 case OP_SUBSTR: /* substring */ 4773 case OP_STRING_COPY: /* substring/string-copy */
4385 { 4774 {
4386 char *str = strvalue (x); 4775 char *str = strvalue (x);
4387 int index0 = ivalue_unchecked (cadr (args)); 4776 int index0 = cadr (args) == NIL ? 0 : ivalue_unchecked (cadr (args));
4388 int index1; 4777 int index1;
4389 int len; 4778 int len;
4390 4779
4391 if (index0 > strlength (x)) 4780 if (index0 > strlength (x))
4392 Error_1 ("substring: start out of bounds:", cadr (args)); 4781 Error_1 ("string->copy: start out of bounds:", cadr (args));
4393 4782
4394 if (cddr (args) != NIL) 4783 if (cddr (args) != NIL)
4395 { 4784 {
4396 index1 = ivalue_unchecked (caddr (args)); 4785 index1 = ivalue_unchecked (caddr (args));
4397 4786
4398 if (index1 > strlength (x) || index1 < index0) 4787 if (index1 > strlength (x) || index1 < index0)
4399 Error_1 ("substring: end out of bounds:", caddr (args)); 4788 Error_1 ("string->copy: end out of bounds:", caddr (args));
4400 } 4789 }
4401 else 4790 else
4402 index1 = strlength (x); 4791 index1 = strlength (x);
4403 4792
4404 len = index1 - index0; 4793 len = index1 - index0;
4405 x = mk_empty_string (SCHEME_A_ len, ' '); 4794 x = mk_counted_string (SCHEME_A_ str + index0, len);
4406 memcpy (strvalue (x), str + index0, len);
4407 strvalue (x)[len] = 0;
4408 4795
4409 s_return (x); 4796 s_return (x);
4410 } 4797 }
4411 4798
4412 case OP_VECTOR: /* vector */ 4799 case OP_VECTOR: /* vector */
… …
4486 } 4873 }
4487 4874
4488 if (USE_ERROR_CHECKING) abort (); 4875 if (USE_ERROR_CHECKING) abort ();
4489} 4876}
4490 4877
4491static int 4878/* relational ops */
4879ecb_hot static int
4492opexe_2 (SCHEME_P_ enum scheme_opcodes op) 4880opexe_2 (SCHEME_P_ enum scheme_opcodes op)
4493{ 4881{
4494 pointer x = SCHEME_V->args; 4882 pointer x = SCHEME_V->args;
4495 4883
4496 for (;;) 4884 for (;;)
… …
4517 } 4905 }
4518 4906
4519 s_return (S_T); 4907 s_return (S_T);
4520} 4908}
4521 4909
4522static int 4910/* predicates */
4911ecb_hot static int
4523opexe_3 (SCHEME_P_ enum scheme_opcodes op) 4912opexe_3 (SCHEME_P_ enum scheme_opcodes op)
4524{ 4913{
4525 pointer args = SCHEME_V->args; 4914 pointer args = SCHEME_V->args;
4526 pointer a = car (args); 4915 pointer a = car (args);
4527 pointer d = cdr (args); 4916 pointer d = cdr (args);
4528 int r; 4917 int r;
4529 4918
4530 switch (op) 4919 switch (op)
4531 { 4920 {
4532 case OP_NOT: /* not */ r = is_false (a) ; break; 4921 case OP_NOT: /* not */ r = is_false (a) ; break;
4533 case OP_BOOLP: /* boolean? */ r = a == S_F || a == S_T; break; 4922 case OP_BOOLP: /* boolean? */ r = a == S_F || a == S_T ; break;
4534 case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break; 4923 case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break;
4535 case OP_NULLP: /* null? */ r = a == NIL ; break; 4924 case OP_NULLP: /* null? */ r = a == NIL ; break;
4536 case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break; 4925 case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break;
4926 case OP_GENSYMP: /* gensym? */ r = is_gensym (SCHEME_A_ a); break;
4537 case OP_NUMBERP: /* number? */ r = is_number (a) ; break; 4927 case OP_NUMBERP: /* number? */ r = is_number (a) ; break;
4538 case OP_STRINGP: /* string? */ r = is_string (a) ; break; 4928 case OP_STRINGP: /* string? */ r = is_string (a) ; break;
4539 case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break; 4929 case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break;
4540 case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */ 4930 case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */
4541 case OP_CHARP: /* char? */ r = is_character (a) ; break; 4931 case OP_CHARP: /* char? */ r = is_character (a) ; break;
4542 4932
4543#if USE_CHAR_CLASSIFIERS 4933#if USE_CHAR_CLASSIFIERS
4544 case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue_unchecked (a)); break; 4934 case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue_unchecked (a)); break;
4545 case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue_unchecked (a)); break; 4935 case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue_unchecked (a)); break;
4546 case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue_unchecked (a)); break; 4936 case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue_unchecked (a)); break;
… …
4573 } 4963 }
4574 4964
4575 s_retbool (r); 4965 s_retbool (r);
4576} 4966}
4577 4967
4578static int 4968/* promises, list ops, ports */
4969ecb_hot static int
4579opexe_4 (SCHEME_P_ enum scheme_opcodes op) 4970opexe_4 (SCHEME_P_ enum scheme_opcodes op)
4580{ 4971{
4581 pointer args = SCHEME_V->args; 4972 pointer args = SCHEME_V->args;
4582 pointer a = car (args); 4973 pointer a = car (args);
4583 pointer x, y; 4974 pointer x, y;
… …
4596 } 4987 }
4597 else 4988 else
4598 s_return (SCHEME_V->code); 4989 s_return (SCHEME_V->code);
4599 4990
4600 case OP_SAVE_FORCED: /* Save forced value replacing promise */ 4991 case OP_SAVE_FORCED: /* Save forced value replacing promise */
4601 memcpy (SCHEME_V->code, SCHEME_V->value, sizeof (struct cell)); 4992 *CELL (SCHEME_V->code) = *CELL (SCHEME_V->value);
4602 s_return (SCHEME_V->value); 4993 s_return (SCHEME_V->value);
4603 4994
4604#if USE_PORTS 4995#if USE_PORTS
4996
4997 case OP_EOF_OBJECT: /* eof-object */
4998 s_return (S_EOF);
4605 4999
4606 case OP_WRITE: /* write */ 5000 case OP_WRITE: /* write */
4607 case OP_DISPLAY: /* display */ 5001 case OP_DISPLAY: /* display */
4608 case OP_WRITE_CHAR: /* write-char */ 5002 case OP_WRITE_CHAR: /* write-char */
4609 if (is_pair (cdr (SCHEME_V->args))) 5003 if (is_pair (cdr (SCHEME_V->args)))
… …
4623 else 5017 else
4624 SCHEME_V->print_flag = 0; 5018 SCHEME_V->print_flag = 0;
4625 5019
4626 s_goto (OP_P0LIST); 5020 s_goto (OP_P0LIST);
4627 5021
5022 //TODO: move to scheme
4628 case OP_NEWLINE: /* newline */ 5023 case OP_NEWLINE: /* newline */
4629 if (is_pair (args)) 5024 if (is_pair (args))
4630 { 5025 {
4631 if (a != SCHEME_V->outport) 5026 if (a != SCHEME_V->outport)
4632 { 5027 {
… …
4634 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL); 5029 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL);
4635 SCHEME_V->outport = a; 5030 SCHEME_V->outport = a;
4636 } 5031 }
4637 } 5032 }
4638 5033
4639 putstr (SCHEME_A_ "\n"); 5034 putcharacter (SCHEME_A_ '\n');
4640 s_return (S_T); 5035 s_return (S_T);
4641#endif 5036#endif
4642 5037
4643 case OP_ERR0: /* error */ 5038 case OP_ERR0: /* error */
4644 SCHEME_V->retcode = -1; 5039 SCHEME_V->retcode = -1;
… …
4653 putstr (SCHEME_A_ strvalue (car (args))); 5048 putstr (SCHEME_A_ strvalue (car (args)));
4654 SCHEME_V->args = cdr (args); 5049 SCHEME_V->args = cdr (args);
4655 s_goto (OP_ERR1); 5050 s_goto (OP_ERR1);
4656 5051
4657 case OP_ERR1: /* error */ 5052 case OP_ERR1: /* error */
4658 putstr (SCHEME_A_ " "); 5053 putcharacter (SCHEME_A_ ' ');
4659 5054
4660 if (args != NIL) 5055 if (args != NIL)
4661 { 5056 {
4662 s_save (SCHEME_A_ OP_ERR1, cdr (args), NIL); 5057 s_save (SCHEME_A_ OP_ERR1, cdr (args), NIL);
4663 SCHEME_V->args = a; 5058 SCHEME_V->args = a;
4664 SCHEME_V->print_flag = 1; 5059 SCHEME_V->print_flag = 1;
4665 s_goto (OP_P0LIST); 5060 s_goto (OP_P0LIST);
4666 } 5061 }
4667 else 5062 else
4668 { 5063 {
4669 putstr (SCHEME_A_ "\n"); 5064 putcharacter (SCHEME_A_ '\n');
4670 5065
4671 if (SCHEME_V->interactive_repl) 5066 if (SCHEME_V->interactive_repl)
4672 s_goto (OP_T0LVL); 5067 s_goto (OP_T0LVL);
4673 else 5068 else
4674 return -1; 5069 return -1;
… …
4751 SCHEME_V->gc_verbose = (a != S_F); 5146 SCHEME_V->gc_verbose = (a != S_F);
4752 s_retbool (was); 5147 s_retbool (was);
4753 } 5148 }
4754 5149
4755 case OP_NEWSEGMENT: /* new-segment */ 5150 case OP_NEWSEGMENT: /* new-segment */
5151#if 0
4756 if (!is_pair (args) || !is_number (a)) 5152 if (!is_pair (args) || !is_number (a))
4757 Error_0 ("new-segment: argument must be a number"); 5153 Error_0 ("new-segment: argument must be a number");
4758 5154#endif
4759 alloc_cellseg (SCHEME_A_ ivalue (a)); 5155 s_retbool (alloc_cellseg (SCHEME_A));
4760
4761 s_return (S_T);
4762 5156
4763 case OP_OBLIST: /* oblist */ 5157 case OP_OBLIST: /* oblist */
4764 s_return (oblist_all_symbols (SCHEME_A)); 5158 s_return (oblist_all_symbols (SCHEME_A));
4765 5159
4766#if USE_PORTS 5160#if USE_PORTS
… …
4836 s_return (p == NIL ? S_F : p); 5230 s_return (p == NIL ? S_F : p);
4837 } 5231 }
4838 5232
4839 case OP_GET_OUTSTRING: /* get-output-string */ 5233 case OP_GET_OUTSTRING: /* get-output-string */
4840 { 5234 {
4841 port *p; 5235 port *p = port (a);
4842 5236
4843 if ((p = a->object.port)->kind & port_string) 5237 if (p->kind & port_string)
4844 { 5238 {
4845 off_t size; 5239 off_t size;
4846 char *str; 5240 char *str;
4847 5241
4848 size = p->rep.string.curr - p->rep.string.start + 1; 5242 size = p->rep.string.curr - p->rep.string.start + 1;
… …
4883 } 5277 }
4884 5278
4885 if (USE_ERROR_CHECKING) abort (); 5279 if (USE_ERROR_CHECKING) abort ();
4886} 5280}
4887 5281
4888static int 5282/* reading */
5283ecb_cold static int
4889opexe_5 (SCHEME_P_ enum scheme_opcodes op) 5284opexe_5 (SCHEME_P_ enum scheme_opcodes op)
4890{ 5285{
4891 pointer args = SCHEME_V->args; 5286 pointer args = SCHEME_V->args;
4892 pointer x; 5287 pointer x;
4893 5288
… …
4953 int res; 5348 int res;
4954 5349
4955 if (is_pair (args)) 5350 if (is_pair (args))
4956 p = car (args); 5351 p = car (args);
4957 5352
4958 res = p->object.port->kind & port_string; 5353 res = port (p)->kind & port_string;
4959 5354
4960 s_retbool (res); 5355 s_retbool (res);
4961 } 5356 }
4962 5357
4963 case OP_SET_INPORT: /* set-input-port */ 5358 case OP_SET_INPORT: /* set-input-port */
… …
4972 case OP_RDSEXPR: 5367 case OP_RDSEXPR:
4973 switch (SCHEME_V->tok) 5368 switch (SCHEME_V->tok)
4974 { 5369 {
4975 case TOK_EOF: 5370 case TOK_EOF:
4976 s_return (S_EOF); 5371 s_return (S_EOF);
4977 /* NOTREACHED */
4978 5372
4979 case TOK_VEC: 5373 case TOK_VEC:
4980 s_save (SCHEME_A_ OP_RDVEC, NIL, NIL); 5374 s_save (SCHEME_A_ OP_RDVEC, NIL, NIL);
4981 /* fall through */ 5375 /* fall through */
4982 5376
… …
4985 5379
4986 if (SCHEME_V->tok == TOK_RPAREN) 5380 if (SCHEME_V->tok == TOK_RPAREN)
4987 s_return (NIL); 5381 s_return (NIL);
4988 else if (SCHEME_V->tok == TOK_DOT) 5382 else if (SCHEME_V->tok == TOK_DOT)
4989 Error_0 ("syntax error: illegal dot expression"); 5383 Error_0 ("syntax error: illegal dot expression");
4990 else 5384
4991 {
4992 SCHEME_V->nesting_stack[SCHEME_V->file_i]++; 5385 SCHEME_V->nesting_stack[SCHEME_V->file_i]++;
4993 s_save (SCHEME_A_ OP_RDLIST, NIL, NIL); 5386 s_save (SCHEME_A_ OP_RDLIST, NIL, NIL);
4994 s_goto (OP_RDSEXPR); 5387 s_goto (OP_RDSEXPR);
4995 }
4996 5388
4997 case TOK_QUOTE: 5389 case TOK_QUOTE:
4998 s_save (SCHEME_A_ OP_RDQUOTE, NIL, NIL); 5390 s_save (SCHEME_A_ OP_RDQUOTE, NIL, NIL);
4999 SCHEME_V->tok = token (SCHEME_A); 5391 SCHEME_V->tok = token (SCHEME_A);
5000 s_goto (OP_RDSEXPR); 5392 s_goto (OP_RDSEXPR);
… …
5006 { 5398 {
5007 s_save (SCHEME_A_ OP_RDQQUOTEVEC, NIL, NIL); 5399 s_save (SCHEME_A_ OP_RDQQUOTEVEC, NIL, NIL);
5008 SCHEME_V->tok = TOK_LPAREN; 5400 SCHEME_V->tok = TOK_LPAREN;
5009 s_goto (OP_RDSEXPR); 5401 s_goto (OP_RDSEXPR);
5010 } 5402 }
5011 else 5403
5012 s_save (SCHEME_A_ OP_RDQQUOTE, NIL, NIL); 5404 s_save (SCHEME_A_ OP_RDQQUOTE, NIL, NIL);
5013
5014 s_goto (OP_RDSEXPR); 5405 s_goto (OP_RDSEXPR);
5015 5406
5016 case TOK_COMMA: 5407 case TOK_COMMA:
5017 s_save (SCHEME_A_ OP_RDUNQUOTE, NIL, NIL); 5408 s_save (SCHEME_A_ OP_RDUNQUOTE, NIL, NIL);
5018 SCHEME_V->tok = token (SCHEME_A); 5409 SCHEME_V->tok = token (SCHEME_A);
… …
5029 case TOK_DOTATOM: 5420 case TOK_DOTATOM:
5030 SCHEME_V->strbuff[0] = '.'; 5421 SCHEME_V->strbuff[0] = '.';
5031 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 1, DELIMITERS))); 5422 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 1, DELIMITERS)));
5032 5423
5033 case TOK_STRATOM: 5424 case TOK_STRATOM:
5425 //TODO: haven't checked whether the garbage collector could interfere and free x
5426 gc (SCHEME_A_ NIL, NIL); //TODO: superheavyhanded
5034 x = readstrexp (SCHEME_A_ '|'); 5427 x = readstrexp (SCHEME_A_ '|');
5035 //TODO: haven't checked whether the garbage collector could interfere
5036 s_return (mk_atom (SCHEME_A_ strvalue (x))); 5428 s_return (mk_atom (SCHEME_A_ strvalue (x)));
5037 5429
5038 case TOK_DQUOTE: 5430 case TOK_DQUOTE:
5039 x = readstrexp (SCHEME_A_ '"'); 5431 x = readstrexp (SCHEME_A_ '"');
5040 5432
… …
5048 { 5440 {
5049 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->SHARP_HOOK, 1); 5441 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->SHARP_HOOK, 1);
5050 5442
5051 if (f == NIL) 5443 if (f == NIL)
5052 Error_0 ("undefined sharp expression"); 5444 Error_0 ("undefined sharp expression");
5053 else 5445
5054 {
5055 SCHEME_V->code = cons (slot_value_in_env (f), NIL); 5446 SCHEME_V->code = cons (slot_value_in_env (f), NIL);
5056 s_goto (OP_EVAL); 5447 s_goto (OP_EVAL);
5057 }
5058 } 5448 }
5059 5449
5060 case TOK_SHARP_CONST: 5450 case TOK_SHARP_CONST:
5061 if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS))) == NIL) 5451 if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS))) == NIL)
5062 Error_0 ("undefined sharp expression"); 5452 Error_0 ("undefined sharp expression");
5063 else 5453
5064 s_return (x); 5454 s_return (x);
5065 5455
5066 default: 5456 default:
5067 Error_0 ("syntax error: illegal token"); 5457 Error_0 ("syntax error: illegal token");
5068 } 5458 }
5069 5459
… …
5162 pointer b = cdr (args); 5552 pointer b = cdr (args);
5163 int ok_abbr = ok_abbrev (b); 5553 int ok_abbr = ok_abbrev (b);
5164 SCHEME_V->args = car (b); 5554 SCHEME_V->args = car (b);
5165 5555
5166 if (a == SCHEME_V->QUOTE && ok_abbr) 5556 if (a == SCHEME_V->QUOTE && ok_abbr)
5167 putstr (SCHEME_A_ "'"); 5557 putcharacter (SCHEME_A_ '\'');
5168 else if (a == SCHEME_V->QQUOTE && ok_abbr) 5558 else if (a == SCHEME_V->QQUOTE && ok_abbr)
5169 putstr (SCHEME_A_ "`"); 5559 putcharacter (SCHEME_A_ '`');
5170 else if (a == SCHEME_V->UNQUOTE && ok_abbr) 5560 else if (a == SCHEME_V->UNQUOTE && ok_abbr)
5171 putstr (SCHEME_A_ ","); 5561 putcharacter (SCHEME_A_ ',');
5172 else if (a == SCHEME_V->UNQUOTESP && ok_abbr) 5562 else if (a == SCHEME_V->UNQUOTESP && ok_abbr)
5173 putstr (SCHEME_A_ ",@"); 5563 putstr (SCHEME_A_ ",@");
5174 else 5564 else
5175 { 5565 {
5176 putstr (SCHEME_A_ "("); 5566 putcharacter (SCHEME_A_ '(');
5177 s_save (SCHEME_A_ OP_P1LIST, b, NIL); 5567 s_save (SCHEME_A_ OP_P1LIST, b, NIL);
5178 SCHEME_V->args = a; 5568 SCHEME_V->args = a;
5179 } 5569 }
5180 5570
5181 s_goto (OP_P0LIST); 5571 s_goto (OP_P0LIST);
… …
5183 5573
5184 case OP_P1LIST: 5574 case OP_P1LIST:
5185 if (is_pair (args)) 5575 if (is_pair (args))
5186 { 5576 {
5187 s_save (SCHEME_A_ OP_P1LIST, cdr (args), NIL); 5577 s_save (SCHEME_A_ OP_P1LIST, cdr (args), NIL);
5188 putstr (SCHEME_A_ " "); 5578 putcharacter (SCHEME_A_ ' ');
5189 SCHEME_V->args = car (args); 5579 SCHEME_V->args = car (args);
5190 s_goto (OP_P0LIST); 5580 s_goto (OP_P0LIST);
5191 } 5581 }
5192 else if (is_vector (args)) 5582 else if (is_vector (args))
5193 { 5583 {
… …
5201 { 5591 {
5202 putstr (SCHEME_A_ " . "); 5592 putstr (SCHEME_A_ " . ");
5203 printatom (SCHEME_A_ args, SCHEME_V->print_flag); 5593 printatom (SCHEME_A_ args, SCHEME_V->print_flag);
5204 } 5594 }
5205 5595
5206 putstr (SCHEME_A_ ")"); 5596 putcharacter (SCHEME_A_ ')');
5207 s_return (S_T); 5597 s_return (S_T);
5208 } 5598 }
5209 5599
5210 case OP_PVECFROM: 5600 case OP_PVECFROM:
5211 { 5601 {
… …
5213 pointer vec = car (args); 5603 pointer vec = car (args);
5214 int len = veclength (vec); 5604 int len = veclength (vec);
5215 5605
5216 if (i == len) 5606 if (i == len)
5217 { 5607 {
5218 putstr (SCHEME_A_ ")"); 5608 putcharacter (SCHEME_A_ ')');
5219 s_return (S_T); 5609 s_return (S_T);
5220 } 5610 }
5221 else 5611 else
5222 { 5612 {
5223 pointer elem = vector_get (vec, i); 5613 pointer elem = vector_get (vec, i);
… …
5225 ivalue_unchecked (cdr (args)) = i + 1; 5615 ivalue_unchecked (cdr (args)) = i + 1;
5226 s_save (SCHEME_A_ OP_PVECFROM, args, NIL); 5616 s_save (SCHEME_A_ OP_PVECFROM, args, NIL);
5227 SCHEME_V->args = elem; 5617 SCHEME_V->args = elem;
5228 5618
5229 if (i > 0) 5619 if (i > 0)
5230 putstr (SCHEME_A_ " "); 5620 putcharacter (SCHEME_A_ ' ');
5231 5621
5232 s_goto (OP_P0LIST); 5622 s_goto (OP_P0LIST);
5233 } 5623 }
5234 } 5624 }
5235 } 5625 }
5236 5626
5237 if (USE_ERROR_CHECKING) abort (); 5627 if (USE_ERROR_CHECKING) abort ();
5238} 5628}
5239 5629
5240static int 5630/* list ops */
5631ecb_hot static int
5241opexe_6 (SCHEME_P_ enum scheme_opcodes op) 5632opexe_6 (SCHEME_P_ enum scheme_opcodes op)
5242{ 5633{
5243 pointer args = SCHEME_V->args; 5634 pointer args = SCHEME_V->args;
5244 pointer a = car (args); 5635 pointer a = car (args);
5245 pointer x, y; 5636 pointer x, y;
… …
5268 break; 5659 break;
5269 } 5660 }
5270 5661
5271 if (is_pair (y)) 5662 if (is_pair (y))
5272 s_return (car (y)); 5663 s_return (car (y));
5273 else 5664
5274 s_return (S_F); 5665 s_return (S_F);
5275
5276 5666
5277 case OP_GET_CLOSURE: /* get-closure-code *//* a.k */ 5667 case OP_GET_CLOSURE: /* get-closure-code *//* a.k */
5278 SCHEME_V->args = a; 5668 SCHEME_V->args = a;
5279 5669
5280 if (SCHEME_V->args == NIL) 5670 if (SCHEME_V->args == NIL)
5281 s_return (S_F); 5671 s_return (S_F);
5282 else if (is_closure (SCHEME_V->args)) 5672 else if (is_closure (SCHEME_V->args) || is_macro (SCHEME_V->args))
5283 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value))); 5673 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value)));
5284 else if (is_macro (SCHEME_V->args)) 5674
5285 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value)));
5286 else
5287 s_return (S_F); 5675 s_return (S_F);
5288 5676
5289 case OP_CLOSUREP: /* closure? */ 5677 case OP_CLOSUREP: /* closure? */
5290 /* 5678 /*
5291 * Note, macro object is also a closure. 5679 * Note, macro object is also a closure.
5292 * Therefore, (closure? <#MACRO>) ==> #t 5680 * Therefore, (closure? <#MACRO>) ==> #t
… …
5303 5691
5304/* dispatch functions (opexe_x) return new opcode, or 0 for same opcode, or -1 to stop */ 5692/* dispatch functions (opexe_x) return new opcode, or 0 for same opcode, or -1 to stop */
5305typedef int (*dispatch_func)(SCHEME_P_ enum scheme_opcodes); 5693typedef int (*dispatch_func)(SCHEME_P_ enum scheme_opcodes);
5306 5694
5307typedef int (*test_predicate)(pointer); 5695typedef int (*test_predicate)(pointer);
5308static int 5696
5697ecb_hot static int
5309tst_any (pointer p) 5698tst_any (pointer p)
5310{ 5699{
5311 return 1; 5700 return 1;
5312} 5701}
5313 5702
5314static int 5703ecb_hot static int
5315tst_inonneg (pointer p) 5704tst_inonneg (pointer p)
5316{ 5705{
5317 return is_integer (p) && ivalue_unchecked (p) >= 0; 5706 return is_integer (p) && ivalue_unchecked (p) >= 0;
5318} 5707}
5319 5708
5320static int 5709ecb_hot static int
5321tst_is_list (SCHEME_P_ pointer p) 5710tst_is_list (SCHEME_P_ pointer p)
5322{ 5711{
5323 return p == NIL || is_pair (p); 5712 return p == NIL || is_pair (p);
5324} 5713}
5325 5714
… …
5368#define OP_DEF(func,name,minarity,maxarity,argtest,op) name "\x00" 5757#define OP_DEF(func,name,minarity,maxarity,argtest,op) name "\x00"
5369#include "opdefines.h" 5758#include "opdefines.h"
5370#undef OP_DEF 5759#undef OP_DEF
5371; 5760;
5372 5761
5373static const char * 5762ecb_cold static const char *
5374opname (int idx) 5763opname (int idx)
5375{ 5764{
5376 const char *name = opnames; 5765 const char *name = opnames;
5377 5766
5378 /* should do this at compile time, but would require external program, right? */ 5767 /* should do this at compile time, but would require external program, right? */
… …
5380 name += strlen (name) + 1; 5769 name += strlen (name) + 1;
5381 5770
5382 return *name ? name : "ILLEGAL"; 5771 return *name ? name : "ILLEGAL";
5383} 5772}
5384 5773
5385static const char * 5774ecb_cold static const char *
5386procname (pointer x) 5775procname (pointer x)
5387{ 5776{
5388 return opname (procnum (x)); 5777 return opname (procnum (x));
5389} 5778}
5390 5779
… …
5410#undef OP_DEF 5799#undef OP_DEF
5411 {0} 5800 {0}
5412}; 5801};
5413 5802
5414/* kernel of this interpreter */ 5803/* kernel of this interpreter */
5415static void ecb_hot 5804ecb_hot static void
5416Eval_Cycle (SCHEME_P_ enum scheme_opcodes op) 5805Eval_Cycle (SCHEME_P_ enum scheme_opcodes op)
5417{ 5806{
5418 SCHEME_V->op = op; 5807 SCHEME_V->op = op;
5419 5808
5420 for (;;) 5809 for (;;)
… …
5503 if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0)) 5892 if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0))
5504 return; 5893 return;
5505 5894
5506 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 5895 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
5507 { 5896 {
5508 xwrstr ("No memory!\n"); 5897 putstr (SCHEME_A_ "No memory!\n");
5509 return; 5898 return;
5510 } 5899 }
5511 } 5900 }
5512} 5901}
5513 5902
5514/* ========== Initialization of internal keywords ========== */ 5903/* ========== Initialization of internal keywords ========== */
5515 5904
5516static void 5905ecb_cold static void
5517assign_syntax (SCHEME_P_ const char *name) 5906assign_syntax (SCHEME_P_ const char *name)
5518{ 5907{
5519 pointer x = oblist_add_by_name (SCHEME_A_ name); 5908 pointer x = oblist_add_by_name (SCHEME_A_ name);
5520 set_typeflag (x, typeflag (x) | T_SYNTAX); 5909 set_typeflag (x, typeflag (x) | T_SYNTAX);
5521} 5910}
5522 5911
5523static void 5912ecb_cold static void
5524assign_proc (SCHEME_P_ enum scheme_opcodes op, const char *name) 5913assign_proc (SCHEME_P_ enum scheme_opcodes op, const char *name)
5525{ 5914{
5526 pointer x = mk_symbol (SCHEME_A_ name); 5915 pointer x = mk_symbol (SCHEME_A_ name);
5527 pointer y = mk_proc (SCHEME_A_ op); 5916 pointer y = mk_proc (SCHEME_A_ op);
5528 new_slot_in_env (SCHEME_A_ x, y); 5917 new_slot_in_env (SCHEME_A_ x, y);
… …
5536 ivalue_unchecked (y) = op; 5925 ivalue_unchecked (y) = op;
5537 return y; 5926 return y;
5538} 5927}
5539 5928
5540/* Hard-coded for the given keywords. Remember to rewrite if more are added! */ 5929/* Hard-coded for the given keywords. Remember to rewrite if more are added! */
5541static int 5930ecb_hot static int
5542syntaxnum (pointer p) 5931syntaxnum (pointer p)
5543{ 5932{
5544 const char *s = strvalue (p); 5933 const char *s = strvalue (p);
5545 5934
5546 switch (strlength (p)) 5935 switch (strlength (p))
… …
5625 6014
5626ecb_cold int 6015ecb_cold int
5627scheme_init (SCHEME_P) 6016scheme_init (SCHEME_P)
5628{ 6017{
5629 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]); 6018 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]);
5630 pointer x; 6019
6020 /* this memset is not strictly correct, as we assume (intcache)
6021 * that memset 0 will also set pointers to 0, but memset does
6022 * of course not guarantee that. screw such systems.
6023 */
6024 memset (SCHEME_V, 0, sizeof (*SCHEME_V));
5631 6025
5632 num_set_fixnum (num_zero, 1); 6026 num_set_fixnum (num_zero, 1);
5633 num_set_ivalue (num_zero, 0); 6027 num_set_ivalue (num_zero, 0);
5634 num_set_fixnum (num_one, 1); 6028 num_set_fixnum (num_one, 1);
5635 num_set_ivalue (num_one, 1); 6029 num_set_ivalue (num_one, 1);
… …
5647 SCHEME_V->save_inport = NIL; 6041 SCHEME_V->save_inport = NIL;
5648 SCHEME_V->loadport = NIL; 6042 SCHEME_V->loadport = NIL;
5649 SCHEME_V->nesting = 0; 6043 SCHEME_V->nesting = 0;
5650 SCHEME_V->interactive_repl = 0; 6044 SCHEME_V->interactive_repl = 0;
5651 6045
5652 if (alloc_cellseg (SCHEME_A_ FIRST_CELLSEGS) != FIRST_CELLSEGS) 6046 if (!alloc_cellseg (SCHEME_A))
5653 { 6047 {
5654#if USE_ERROR_CHECKING 6048#if USE_ERROR_CHECKING
5655 SCHEME_V->no_memory = 1; 6049 SCHEME_V->no_memory = 1;
5656 return 0; 6050 return 0;
5657#endif 6051#endif
5658 } 6052 }
5659 6053
5660 SCHEME_V->gc_verbose = 0; 6054 SCHEME_V->gc_verbose = 0;
5661 dump_stack_initialize (SCHEME_A); 6055 dump_stack_initialize (SCHEME_A);
5662 SCHEME_V->code = NIL; 6056 SCHEME_V->code = NIL;
5663 SCHEME_V->args = NIL; 6057 SCHEME_V->args = NIL;
5664 SCHEME_V->envir = NIL; 6058 SCHEME_V->envir = NIL;
6059 SCHEME_V->value = NIL;
5665 SCHEME_V->tracing = 0; 6060 SCHEME_V->tracing = 0;
5666 6061
5667 /* init NIL */ 6062 /* init NIL */
5668 set_typeflag (NIL, T_ATOM | T_MARK); 6063 set_typeflag (NIL, T_SPECIAL | T_ATOM);
5669 set_car (NIL, NIL); 6064 set_car (NIL, NIL);
5670 set_cdr (NIL, NIL); 6065 set_cdr (NIL, NIL);
5671 /* init T */ 6066 /* init T */
5672 set_typeflag (S_T, T_ATOM | T_MARK); 6067 set_typeflag (S_T, T_SPECIAL | T_ATOM);
5673 set_car (S_T, S_T); 6068 set_car (S_T, S_T);
5674 set_cdr (S_T, S_T); 6069 set_cdr (S_T, S_T);
5675 /* init F */ 6070 /* init F */
5676 set_typeflag (S_F, T_ATOM | T_MARK); 6071 set_typeflag (S_F, T_SPECIAL | T_ATOM);
5677 set_car (S_F, S_F); 6072 set_car (S_F, S_F);
5678 set_cdr (S_F, S_F); 6073 set_cdr (S_F, S_F);
5679 /* init EOF_OBJ */ 6074 /* init EOF_OBJ */
5680 set_typeflag (S_EOF, T_ATOM | T_MARK); 6075 set_typeflag (S_EOF, T_SPECIAL | T_ATOM);
5681 set_car (S_EOF, S_EOF); 6076 set_car (S_EOF, S_EOF);
5682 set_cdr (S_EOF, S_EOF); 6077 set_cdr (S_EOF, S_EOF);
5683 /* init sink */ 6078 /* init sink */
5684 set_typeflag (S_SINK, T_PAIR | T_MARK); 6079 set_typeflag (S_SINK, T_PAIR);
5685 set_car (S_SINK, NIL); 6080 set_car (S_SINK, NIL);
5686 6081
5687 /* init c_nest */ 6082 /* init c_nest */
5688 SCHEME_V->c_nest = NIL; 6083 SCHEME_V->c_nest = NIL;
5689 6084
5690 SCHEME_V->oblist = oblist_initial_value (SCHEME_A); 6085 SCHEME_V->oblist = oblist_initial_value (SCHEME_A);
5691 /* init global_env */ 6086 /* init global_env */
5692 new_frame_in_env (SCHEME_A_ NIL); 6087 new_frame_in_env (SCHEME_A_ NIL);
5693 SCHEME_V->global_env = SCHEME_V->envir; 6088 SCHEME_V->global_env = SCHEME_V->envir;
5694 /* init else */ 6089 /* init else */
5695 x = mk_symbol (SCHEME_A_ "else"); 6090 new_slot_in_env (SCHEME_A_ mk_symbol (SCHEME_A_ "else"), S_T);
5696 new_slot_in_env (SCHEME_A_ x, S_T);
5697 6091
5698 { 6092 {
5699 static const char *syntax_names[] = { 6093 static const char *syntax_names[] = {
5700 "lambda", "quote", "define", "if", "begin", "set!", 6094 "lambda", "quote", "define", "if", "begin", "set!",
5701 "let", "let*", "letrec", "cond", "delay", "and", 6095 "let", "let*", "letrec", "cond", "delay", "and",
… …
5725 6119
5726 return !SCHEME_V->no_memory; 6120 return !SCHEME_V->no_memory;
5727} 6121}
5728 6122
5729#if USE_PORTS 6123#if USE_PORTS
5730void 6124ecb_cold void
5731scheme_set_input_port_file (SCHEME_P_ int fin) 6125scheme_set_input_port_file (SCHEME_P_ int fin)
5732{ 6126{
5733 SCHEME_V->inport = port_from_file (SCHEME_A_ fin, port_input); 6127 SCHEME_V->inport = port_from_file (SCHEME_A_ fin, port_input);
5734} 6128}
5735 6129
5736void 6130ecb_cold void
5737scheme_set_input_port_string (SCHEME_P_ char *start, char *past_the_end) 6131scheme_set_input_port_string (SCHEME_P_ char *start, char *past_the_end)
5738{ 6132{
5739 SCHEME_V->inport = port_from_string (SCHEME_A_ start, past_the_end, port_input); 6133 SCHEME_V->inport = port_from_string (SCHEME_A_ start, past_the_end, port_input);
5740} 6134}
5741 6135
5742void 6136ecb_cold void
5743scheme_set_output_port_file (SCHEME_P_ int fout) 6137scheme_set_output_port_file (SCHEME_P_ int fout)
5744{ 6138{
5745 SCHEME_V->outport = port_from_file (SCHEME_A_ fout, port_output); 6139 SCHEME_V->outport = port_from_file (SCHEME_A_ fout, port_output);
5746} 6140}
5747 6141
5748void 6142ecb_cold void
5749scheme_set_output_port_string (SCHEME_P_ char *start, char *past_the_end) 6143scheme_set_output_port_string (SCHEME_P_ char *start, char *past_the_end)
5750{ 6144{
5751 SCHEME_V->outport = port_from_string (SCHEME_A_ start, past_the_end, port_output); 6145 SCHEME_V->outport = port_from_string (SCHEME_A_ start, past_the_end, port_output);
5752} 6146}
5753#endif 6147#endif
5754 6148
5755void 6149ecb_cold void
5756scheme_set_external_data (SCHEME_P_ void *p) 6150scheme_set_external_data (SCHEME_P_ void *p)
5757{ 6151{
5758 SCHEME_V->ext_data = p; 6152 SCHEME_V->ext_data = p;
5759} 6153}
5760 6154
… …
5792 SCHEME_V->loadport = NIL; 6186 SCHEME_V->loadport = NIL;
5793 SCHEME_V->gc_verbose = 0; 6187 SCHEME_V->gc_verbose = 0;
5794 gc (SCHEME_A_ NIL, NIL); 6188 gc (SCHEME_A_ NIL, NIL);
5795 6189
5796 for (i = 0; i <= SCHEME_V->last_cell_seg; i++) 6190 for (i = 0; i <= SCHEME_V->last_cell_seg; i++)
5797 free (SCHEME_V->alloc_seg[i]); 6191 free (SCHEME_V->cell_seg[i]);
5798 6192
5799#if SHOW_ERROR_LINE 6193#if SHOW_ERROR_LINE
5800 for (i = 0; i <= SCHEME_V->file_i; i++) 6194 for (i = 0; i <= SCHEME_V->file_i; i++)
5801 {
5802 if (SCHEME_V->load_stack[i].kind & port_file) 6195 if (SCHEME_V->load_stack[i].kind & port_file)
5803 { 6196 {
5804 fname = SCHEME_V->load_stack[i].rep.stdio.filename; 6197 fname = SCHEME_V->load_stack[i].rep.stdio.filename;
5805 6198
5806 if (fname) 6199 if (fname)
5807 free (fname); 6200 free (fname);
5808 } 6201 }
5809 }
5810#endif 6202#endif
5811} 6203}
5812 6204
5813void 6205ecb_cold void
5814scheme_load_file (SCHEME_P_ int fin) 6206scheme_load_file (SCHEME_P_ int fin)
5815{ 6207{
5816 scheme_load_named_file (SCHEME_A_ fin, 0); 6208 scheme_load_named_file (SCHEME_A_ fin, 0);
5817} 6209}
5818 6210
5819void 6211ecb_cold void
5820scheme_load_named_file (SCHEME_P_ int fin, const char *filename) 6212scheme_load_named_file (SCHEME_P_ int fin, const char *filename)
5821{ 6213{
5822 dump_stack_reset (SCHEME_A); 6214 dump_stack_reset (SCHEME_A);
5823 SCHEME_V->envir = SCHEME_V->global_env; 6215 SCHEME_V->envir = SCHEME_V->global_env;
5824 SCHEME_V->file_i = 0; 6216 SCHEME_V->file_i = 0;
5825 SCHEME_V->load_stack[0].unget = -1; 6217 SCHEME_V->load_stack[0].unget = -1;
5826 SCHEME_V->load_stack[0].kind = port_input | port_file; 6218 SCHEME_V->load_stack[0].kind = port_input | port_file;
5827 SCHEME_V->load_stack[0].rep.stdio.file = fin; 6219 SCHEME_V->load_stack[0].rep.stdio.file = fin;
5828#if USE_PORTS
5829 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack); 6220 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack);
5830#endif
5831 SCHEME_V->retcode = 0; 6221 SCHEME_V->retcode = 0;
5832 6222
5833#if USE_PORTS
5834 if (fin == STDIN_FILENO) 6223 if (fin == STDIN_FILENO)
5835 SCHEME_V->interactive_repl = 1; 6224 SCHEME_V->interactive_repl = 1;
5836#endif
5837 6225
5838#if USE_PORTS 6226#if USE_PORTS
5839#if SHOW_ERROR_LINE 6227#if SHOW_ERROR_LINE
5840 SCHEME_V->load_stack[0].rep.stdio.curr_line = 0; 6228 SCHEME_V->load_stack[0].rep.stdio.curr_line = 0;
5841 6229
… …
5845#endif 6233#endif
5846 6234
5847 SCHEME_V->inport = SCHEME_V->loadport; 6235 SCHEME_V->inport = SCHEME_V->loadport;
5848 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i); 6236 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i);
5849 Eval_Cycle (SCHEME_A_ OP_T0LVL); 6237 Eval_Cycle (SCHEME_A_ OP_T0LVL);
6238
5850 set_typeflag (SCHEME_V->loadport, T_ATOM); 6239 set_typeflag (SCHEME_V->loadport, T_ATOM);
5851 6240
5852 if (SCHEME_V->retcode == 0) 6241 if (SCHEME_V->retcode == 0)
5853 SCHEME_V->retcode = SCHEME_V->nesting != 0; 6242 SCHEME_V->retcode = SCHEME_V->nesting != 0;
5854} 6243}
5855 6244
5856void 6245ecb_cold void
5857scheme_load_string (SCHEME_P_ const char *cmd) 6246scheme_load_string (SCHEME_P_ const char *cmd)
5858{ 6247{
6248#if USE_PORTs
5859 dump_stack_reset (SCHEME_A); 6249 dump_stack_reset (SCHEME_A);
5860 SCHEME_V->envir = SCHEME_V->global_env; 6250 SCHEME_V->envir = SCHEME_V->global_env;
5861 SCHEME_V->file_i = 0; 6251 SCHEME_V->file_i = 0;
5862 SCHEME_V->load_stack[0].kind = port_input | port_string; 6252 SCHEME_V->load_stack[0].kind = port_input | port_string;
5863 SCHEME_V->load_stack[0].rep.string.start = (char *)cmd; /* This func respects const */ 6253 SCHEME_V->load_stack[0].rep.string.start = (char *)cmd; /* This func respects const */
5864 SCHEME_V->load_stack[0].rep.string.past_the_end = (char *)cmd + strlen (cmd); 6254 SCHEME_V->load_stack[0].rep.string.past_the_end = (char *)cmd + strlen (cmd);
5865 SCHEME_V->load_stack[0].rep.string.curr = (char *)cmd; 6255 SCHEME_V->load_stack[0].rep.string.curr = (char *)cmd;
5866#if USE_PORTS
5867 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack); 6256 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack);
5868#endif
5869 SCHEME_V->retcode = 0; 6257 SCHEME_V->retcode = 0;
5870 SCHEME_V->interactive_repl = 0; 6258 SCHEME_V->interactive_repl = 0;
5871 SCHEME_V->inport = SCHEME_V->loadport; 6259 SCHEME_V->inport = SCHEME_V->loadport;
5872 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i); 6260 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i);
5873 Eval_Cycle (SCHEME_A_ OP_T0LVL); 6261 Eval_Cycle (SCHEME_A_ OP_T0LVL);
5874 set_typeflag (SCHEME_V->loadport, T_ATOM); 6262 set_typeflag (SCHEME_V->loadport, T_ATOM);
5875 6263
5876 if (SCHEME_V->retcode == 0) 6264 if (SCHEME_V->retcode == 0)
5877 SCHEME_V->retcode = SCHEME_V->nesting != 0; 6265 SCHEME_V->retcode = SCHEME_V->nesting != 0;
6266#else
6267 abort ();
6268#endif
5878} 6269}
5879 6270
5880void 6271ecb_cold void
5881scheme_define (SCHEME_P_ pointer envir, pointer symbol, pointer value) 6272scheme_define (SCHEME_P_ pointer envir, pointer symbol, pointer value)
5882{ 6273{
5883 pointer x; 6274 pointer x;
5884 6275
5885 x = find_slot_in_env (SCHEME_A_ envir, symbol, 0); 6276 x = find_slot_in_env (SCHEME_A_ envir, symbol, 0);
… …
5890 new_slot_spec_in_env (SCHEME_A_ envir, symbol, value); 6281 new_slot_spec_in_env (SCHEME_A_ envir, symbol, value);
5891} 6282}
5892 6283
5893#if !STANDALONE 6284#if !STANDALONE
5894 6285
5895void 6286ecb_cold void
5896scheme_register_foreign_func (scheme * sc, scheme_registerable * sr) 6287scheme_register_foreign_func (scheme * sc, scheme_registerable * sr)
5897{ 6288{
5898 scheme_define (SCHEME_A_ SCHEME_V->global_env, mk_symbol (SCHEME_A_ sr->name), mk_foreign_func (SCHEME_A_ sr->f)); 6289 scheme_define (SCHEME_A_ SCHEME_V->global_env, mk_symbol (SCHEME_A_ sr->name), mk_foreign_func (SCHEME_A_ sr->f));
5899} 6290}
5900 6291
5901void 6292ecb_cold void
5902scheme_register_foreign_func_list (scheme * sc, scheme_registerable * list, int count) 6293scheme_register_foreign_func_list (scheme * sc, scheme_registerable * list, int count)
5903{ 6294{
5904 int i; 6295 int i;
5905 6296
5906 for (i = 0; i < count; i++) 6297 for (i = 0; i < count; i++)
5907 scheme_register_foreign_func (SCHEME_A_ list + i); 6298 scheme_register_foreign_func (SCHEME_A_ list + i);
5908} 6299}
5909 6300
5910pointer 6301ecb_cold pointer
5911scheme_apply0 (SCHEME_P_ const char *procname) 6302scheme_apply0 (SCHEME_P_ const char *procname)
5912{ 6303{
5913 return scheme_eval (SCHEME_A_ cons (mk_symbol (SCHEME_A_ procname), NIL)); 6304 return scheme_eval (SCHEME_A_ cons (mk_symbol (SCHEME_A_ procname), NIL));
5914} 6305}
5915 6306
5916void 6307ecb_cold void
5917save_from_C_call (SCHEME_P) 6308save_from_C_call (SCHEME_P)
5918{ 6309{
5919 pointer saved_data = cons (car (S_SINK), 6310 pointer saved_data = cons (car (S_SINK),
5920 cons (SCHEME_V->envir, 6311 cons (SCHEME_V->envir,
5921 SCHEME_V->dump)); 6312 SCHEME_V->dump));
… …
5925 /* Truncate the dump stack so TS will return here when done, not 6316 /* Truncate the dump stack so TS will return here when done, not
5926 directly resume pre-C-call operations. */ 6317 directly resume pre-C-call operations. */
5927 dump_stack_reset (SCHEME_A); 6318 dump_stack_reset (SCHEME_A);
5928} 6319}
5929 6320
5930void 6321ecb_cold void
5931restore_from_C_call (SCHEME_P) 6322restore_from_C_call (SCHEME_P)
5932{ 6323{
5933 set_car (S_SINK, caar (SCHEME_V->c_nest)); 6324 set_car (S_SINK, caar (SCHEME_V->c_nest));
5934 SCHEME_V->envir = cadar (SCHEME_V->c_nest); 6325 SCHEME_V->envir = cadar (SCHEME_V->c_nest);
5935 SCHEME_V->dump = cdr (cdar (SCHEME_V->c_nest)); 6326 SCHEME_V->dump = cdr (cdar (SCHEME_V->c_nest));
5936 /* Pop */ 6327 /* Pop */
5937 SCHEME_V->c_nest = cdr (SCHEME_V->c_nest); 6328 SCHEME_V->c_nest = cdr (SCHEME_V->c_nest);
5938} 6329}
5939 6330
5940/* "func" and "args" are assumed to be already eval'ed. */ 6331/* "func" and "args" are assumed to be already eval'ed. */
5941pointer 6332ecb_cold pointer
5942scheme_call (SCHEME_P_ pointer func, pointer args) 6333scheme_call (SCHEME_P_ pointer func, pointer args)
5943{ 6334{
5944 int old_repl = SCHEME_V->interactive_repl; 6335 int old_repl = SCHEME_V->interactive_repl;
5945 6336
5946 SCHEME_V->interactive_repl = 0; 6337 SCHEME_V->interactive_repl = 0;
… …
5953 SCHEME_V->interactive_repl = old_repl; 6344 SCHEME_V->interactive_repl = old_repl;
5954 restore_from_C_call (SCHEME_A); 6345 restore_from_C_call (SCHEME_A);
5955 return SCHEME_V->value; 6346 return SCHEME_V->value;
5956} 6347}
5957 6348
5958pointer 6349ecb_cold pointer
5959scheme_eval (SCHEME_P_ pointer obj) 6350scheme_eval (SCHEME_P_ pointer obj)
5960{ 6351{
5961 int old_repl = SCHEME_V->interactive_repl; 6352 int old_repl = SCHEME_V->interactive_repl;
5962 6353
5963 SCHEME_V->interactive_repl = 0; 6354 SCHEME_V->interactive_repl = 0;
… …
5975 6366
5976/* ========== Main ========== */ 6367/* ========== Main ========== */
5977 6368
5978#if STANDALONE 6369#if STANDALONE
5979 6370
5980int 6371ecb_cold int
5981main (int argc, char **argv) 6372main (int argc, char **argv)
5982{ 6373{
5983# if USE_MULTIPLICITY 6374# if USE_MULTIPLICITY
5984 scheme ssc; 6375 scheme ssc;
5985 scheme *const SCHEME_V = &ssc; 6376 scheme *const SCHEME_V = &ssc;
… …
5987# endif 6378# endif
5988 int fin; 6379 int fin;
5989 char *file_name = InitFile; 6380 char *file_name = InitFile;
5990 int retcode; 6381 int retcode;
5991 int isfile = 1; 6382 int isfile = 1;
6383#if EXPERIMENT
5992 system ("ps v $PPID");//D 6384 system ("ps v $PPID");
6385#endif
5993 6386
5994 if (argc == 2 && strcmp (argv[1], "-?") == 0) 6387 if (argc == 2 && strcmp (argv[1], "-?") == 0)
5995 { 6388 {
5996 xwrstr ("Usage: tinyscheme -?\n"); 6389 putstr (SCHEME_A_ "Usage: tinyscheme -?\n");
5997 xwrstr ("or: tinyscheme [<file1> <file2> ...]\n"); 6390 putstr (SCHEME_A_ "or: tinyscheme [<file1> <file2> ...]\n");
5998 xwrstr ("followed by\n"); 6391 putstr (SCHEME_A_ "followed by\n");
5999 xwrstr (" -1 <file> [<arg1> <arg2> ...]\n"); 6392 putstr (SCHEME_A_ " -1 <file> [<arg1> <arg2> ...]\n");
6000 xwrstr (" -c <Scheme commands> [<arg1> <arg2> ...]\n"); 6393 putstr (SCHEME_A_ " -c <Scheme commands> [<arg1> <arg2> ...]\n");
6001 xwrstr ("assuming that the executable is named tinyscheme.\n"); 6394 putstr (SCHEME_A_ "assuming that the executable is named tinyscheme.\n");
6002 xwrstr ("Use - as filename for stdin.\n"); 6395 putstr (SCHEME_A_ "Use - as filename for stdin.\n");
6003 return 1; 6396 return 1;
6004 } 6397 }
6005 6398
6006 if (!scheme_init (SCHEME_A)) 6399 if (!scheme_init (SCHEME_A))
6007 { 6400 {
6008 xwrstr ("Could not initialize!\n"); 6401 putstr (SCHEME_A_ "Could not initialize!\n");
6009 return 2; 6402 return 2;
6010 } 6403 }
6011 6404
6012# if USE_PORTS 6405# if USE_PORTS
6013 scheme_set_input_port_file (SCHEME_A_ STDIN_FILENO); 6406 scheme_set_input_port_file (SCHEME_A_ STDIN_FILENO);
… …
6026 } 6419 }
6027#endif 6420#endif
6028 6421
6029 do 6422 do
6030 { 6423 {
6031#if USE_PORTS
6032 if (strcmp (file_name, "-") == 0) 6424 if (strcmp (file_name, "-") == 0)
6033 fin = STDIN_FILENO; 6425 fin = STDIN_FILENO;
6034 else if (strcmp (file_name, "-1") == 0 || strcmp (file_name, "-c") == 0) 6426 else if (strcmp (file_name, "-1") == 0 || strcmp (file_name, "-c") == 0)
6035 { 6427 {
6036 pointer args = NIL; 6428 pointer args = NIL;
… …
6054 scheme_define (SCHEME_A_ SCHEME_V->global_env, mk_symbol (SCHEME_A_ "*args*"), args); 6446 scheme_define (SCHEME_A_ SCHEME_V->global_env, mk_symbol (SCHEME_A_ "*args*"), args);
6055 6447
6056 } 6448 }
6057 else 6449 else
6058 fin = open (file_name, O_RDONLY); 6450 fin = open (file_name, O_RDONLY);
6059#endif
6060 6451
6061 if (isfile && fin < 0) 6452 if (isfile && fin < 0)
6062 { 6453 {
6063 xwrstr ("Could not open file "); xwrstr (file_name); xwrstr ("\n"); 6454 putstr (SCHEME_A_ "Could not open file ");
6455 putstr (SCHEME_A_ file_name);
6456 putcharacter (SCHEME_A_ '\n');
6064 } 6457 }
6065 else 6458 else
6066 { 6459 {
6067 if (isfile) 6460 if (isfile)
6068 scheme_load_named_file (SCHEME_A_ fin, file_name); 6461 scheme_load_named_file (SCHEME_A_ fin, file_name);
6069 else 6462 else
6070 scheme_load_string (SCHEME_A_ file_name); 6463 scheme_load_string (SCHEME_A_ file_name);
6071 6464
6072#if USE_PORTS
6073 if (!isfile || fin != STDIN_FILENO) 6465 if (!isfile || fin != STDIN_FILENO)
6074 { 6466 {
6075 if (SCHEME_V->retcode != 0) 6467 if (SCHEME_V->retcode != 0)
6076 { 6468 {
6077 xwrstr ("Errors encountered reading "); xwrstr (file_name); xwrstr ("\n"); 6469 putstr (SCHEME_A_ "Errors encountered reading ");
6470 putstr (SCHEME_A_ file_name);
6471 putcharacter (SCHEME_A_ '\n');
6078 } 6472 }
6079 6473
6080 if (isfile) 6474 if (isfile)
6081 close (fin); 6475 close (fin);
6082 } 6476 }
6083#endif
6084 } 6477 }
6085 6478
6086 file_name = *argv++; 6479 file_name = *argv++;
6087 } 6480 }
6088 while (file_name != 0); 6481 while (file_name != 0);

Diff Legend

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