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

Comparing microscheme/scheme.c (file contents):
Revision 1.17 by root, Thu Nov 26 10:15:51 2015 UTC vs.
Revision 1.69 by root, Mon Dec 7 22:12:53 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
35#include "ecb.h"
36
33#include <sys/types.h> 37#include <sys/types.h>
34#include <sys/stat.h> 38#include <sys/stat.h>
35#include <fcntl.h> 39#include <fcntl.h>
36 40
41#if !USE_ERROR_CHECKING
42# define NDEBUG
43#endif
44
45#include <assert.h>
46#include <stdlib.h>
37#include <string.h> 47#include <string.h>
38#include <stdlib.h>
39 48
40#include <limits.h> 49#include <limits.h>
41#include <inttypes.h> 50#include <inttypes.h>
42#include <float.h> 51#include <float.h>
43//#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
60
61#if '1' != '0' + 1 \
62 || '2' != '0' + 2 || '3' != '0' + 3 || '4' != '0' + 4 || '5' != '0' + 5 \
63 || '6' != '0' + 6 || '7' != '0' + 7 || '8' != '0' + 8 || '9' != '0' + 9 \
64 || 'b' != 'a' + 1 || 'c' != 'a' + 2 || 'd' != 'a' + 3 || 'e' != 'a' + 4 \
65 || 'f' != 'a' + 5
66# error "execution character set digits not consecutive"
67#endif
44 68
45enum { 69enum {
46 TOK_EOF, 70 TOK_EOF,
47 TOK_LPAREN, 71 TOK_LPAREN,
48 TOK_RPAREN, 72 TOK_RPAREN,
49 TOK_DOT, 73 TOK_DOT,
50 TOK_ATOM, 74 TOK_ATOM,
75 TOK_DOTATOM, /* atom name starting with '.' */
76 TOK_STRATOM, /* atom name enclosed in | */
51 TOK_QUOTE, 77 TOK_QUOTE,
52 TOK_DQUOTE, 78 TOK_DQUOTE,
53 TOK_BQUOTE, 79 TOK_BQUOTE,
54 TOK_COMMA, 80 TOK_COMMA,
55 TOK_ATMARK, 81 TOK_ATMARK,
… …
57 TOK_SHARP_CONST, 83 TOK_SHARP_CONST,
58 TOK_VEC 84 TOK_VEC
59}; 85};
60 86
61#define BACKQUOTE '`' 87#define BACKQUOTE '`'
62#define DELIMITERS "()\";\f\t\v\n\r " 88#define WHITESPACE " \t\r\n\v\f"
89#define DELIMITERS "()\";" WHITESPACE
63 90
64#define NIL (&SCHEME_V->xNIL) //TODO: make this 0? 91#define NIL POINTER (&SCHEME_V->xNIL)
65#define S_T (&SCHEME_V->xT) //TODO: magic ptr value? 92#define S_T POINTER (&SCHEME_V->xT)
66#define S_F (&SCHEME_V->xF) //TODO: magic ptr value? 93#define S_F POINTER (&SCHEME_V->xF)
67#define S_SINK (&SCHEME_V->xsink) 94#define S_SINK POINTER (&SCHEME_V->xsink)
68#define S_EOF (&SCHEME_V->xEOF_OBJ) 95#define S_EOF POINTER (&SCHEME_V->xEOF_OBJ)
69
70/* should use libecb */
71#if __GNUC__ >= 4
72# define ecb_expect(expr,value) __builtin_expect ((expr),(value))
73# define ecb_expect_false(expr) ecb_expect (!!(expr), 0)
74# define ecb_expect_true(expr) ecb_expect (!!(expr), 1)
75#else
76# define ecb_expect_false(expr) !!(expr)
77# define ecb_expect_true(expr) !!(expr)
78#endif
79 96
80#if !USE_MULTIPLICITY 97#if !USE_MULTIPLICITY
81static scheme sc; 98static scheme sc;
82#endif 99#endif
83 100
84static void 101ecb_cold static void
85xbase (char *s, long n, int base) 102xbase (char *s, long n, int base)
86{ 103{
87 if (n < 0) 104 if (n < 0)
88 { 105 {
89 *s++ = '-'; 106 *s++ = '-';
… …
91 } 108 }
92 109
93 char *p = s; 110 char *p = s;
94 111
95 do { 112 do {
96 *p++ = '0' + n % base; 113 *p++ = "0123456789abcdef"[n % base];
97 n /= base; 114 n /= base;
98 } while (n); 115 } while (n);
99 116
100 *p-- = 0; 117 *p-- = 0;
101 118
… …
104 char x = *s; *s = *p; *p = x; 121 char x = *s; *s = *p; *p = x;
105 --p; ++s; 122 --p; ++s;
106 } 123 }
107} 124}
108 125
109static void 126ecb_cold static void
110xnum (char *s, long n) 127xnum (char *s, long n)
111{ 128{
112 xbase (s, n, 10); 129 xbase (s, n, 10);
113} 130}
114 131
115static void 132ecb_cold static void
116xwrstr (const char *s) 133putnum (SCHEME_P_ long n)
117{
118 write (1, s, strlen (s));
119}
120
121static void
122xwrnum (long n)
123{ 134{
124 char buf[64]; 135 char buf[64];
125 136
126 xnum (buf, n); 137 xnum (buf, n);
127 xwrstr (buf); 138 putstr (SCHEME_A_ buf);
128} 139}
140
141#if USE_CHAR_CLASSIFIERS
142#include <ctype.h>
143#else
129 144
130static char 145static char
131xtoupper (char c) 146xtoupper (char c)
132{ 147{
133 if (c >= 'a' && c <= 'z') 148 if (c >= 'a' && c <= 'z')
… …
153 168
154#define toupper(c) xtoupper (c) 169#define toupper(c) xtoupper (c)
155#define tolower(c) xtolower (c) 170#define tolower(c) xtolower (c)
156#define isdigit(c) xisdigit (c) 171#define isdigit(c) xisdigit (c)
157 172
158#if USE_STRLWR 173#endif
174
175#if USE_IGNORECASE
159static const char * 176ecb_cold static const char *
160strlwr (char *s) 177xstrlwr (char *s)
161{ 178{
162 const char *p = s; 179 const char *p = s;
163 180
164 while (*s) 181 while (*s)
165 { 182 {
… …
167 s++; 184 s++;
168 } 185 }
169 186
170 return p; 187 return p;
171} 188}
172#endif
173 189
190#define stricmp(a,b) strcasecmp (a, b)
191#define strlwr(s) xstrlwr (s)
192
193#else
174#define stricmp(a,b) strcmp (a, b) 194# define stricmp(a,b) strcmp (a, b)
175#define strlwr(s) (s) 195# define strlwr(s) (s)
196#endif
176 197
177#ifndef prompt 198#ifndef prompt
178# define prompt "ts> " 199# define prompt "ms> "
179#endif 200#endif
180 201
181#ifndef InitFile 202#ifndef InitFile
182# define InitFile "init.scm" 203# define InitFile "init.scm"
183#endif 204#endif
184 205
185#ifndef FIRST_CELLSEGS
186# define FIRST_CELLSEGS 3
187#endif
188
189enum scheme_types 206enum scheme_types
190{ 207{
208 T_INTEGER,
209 T_CHARACTER,
191 T_FREE, 210 T_REAL,
192 T_STRING, 211 T_STRING,
193 T_NUMBER,
194 T_SYMBOL, 212 T_SYMBOL,
195 T_PROC, 213 T_PROC,
196 T_PAIR, 214 T_PAIR, /* also used for free cells */
197 T_CLOSURE, 215 T_CLOSURE,
216 T_BYTECODE, // temp
217 T_MACRO,
198 T_CONTINUATION, 218 T_CONTINUATION,
199 T_FOREIGN, 219 T_FOREIGN,
200 T_CHARACTER,
201 T_PORT, 220 T_PORT,
202 T_VECTOR, 221 T_VECTOR,
203 T_MACRO,
204 T_PROMISE, 222 T_PROMISE,
205 T_ENVIRONMENT, 223 T_ENVIRONMENT,
206 /* one more... */ 224 T_SPECIAL, // #t, #f, '(), eof-object
225
207 T_NUM_SYSTEM_TYPES 226 T_NUM_SYSTEM_TYPES
208}; 227};
209 228
210#define T_MASKTYPE 0x000f 229#define T_MASKTYPE 0x001f
211#define T_SYNTAX 0x0010 230#define T_SYNTAX 0x0020
212#define T_IMMUTABLE 0x0020 231#define T_IMMUTABLE 0x0040
213#define T_ATOM 0x0040 /* only for gc */ 232#define T_ATOM 0x0080 /* only for gc */
214#define T_MARK 0x0080 /* only for gc */ 233//#define T_MARK 0x0080 /* only for gc */
234
235/* num, for generic arithmetic */
236struct num
237{
238 IVALUE ivalue;
239#if USE_REAL
240 RVALUE rvalue;
241 char is_fixnum;
242#endif
243};
244
245#if USE_REAL
246# define num_is_fixnum(n) (n).is_fixnum
247# define num_set_fixnum(n,f) (n).is_fixnum = (f)
248# define num_ivalue(n) (n).ivalue
249# define num_rvalue(n) (n).rvalue
250# define num_set_ivalue(n,i) (n).rvalue = (n).ivalue = (i)
251# define num_set_rvalue(n,r) (n).rvalue = (r)
252#else
253# define num_is_fixnum(n) 1
254# define num_set_fixnum(n,f) 0
255# define num_ivalue(n) (n).ivalue
256# define num_rvalue(n) (n).ivalue
257# define num_set_ivalue(n,i) (n).ivalue = (i)
258# define num_set_rvalue(n,r) (n).ivalue = (r)
259#endif
215 260
216enum num_op { NUM_ADD, NUM_SUB, NUM_MUL, NUM_INTDIV }; 261enum num_op { NUM_ADD, NUM_SUB, NUM_MUL, NUM_INTDIV };
217 262
218static num num_op (enum num_op op, num a, num b); 263static num num_op (enum num_op op, num a, num b);
219static num num_intdiv (num a, num b); 264static num num_intdiv (num a, num b);
220static num num_rem (num a, num b); 265static num num_rem (num a, num b);
221static num num_mod (num a, num b); 266static num num_mod (num a, num b);
222 267
223#if USE_MATH
224static double round_per_R5RS (double x);
225#endif
226static int is_zero_rvalue (RVALUE x); 268static int is_zero_rvalue (RVALUE x);
227
228static INLINE int
229num_is_integer (pointer p)
230{
231 return num_is_fixnum (p->object.number);
232}
233 269
234static num num_zero; 270static num num_zero;
235static num num_one; 271static num num_one;
236 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
237/* macros for cell operations */ 277/* macros for cell operations */
238#define typeflag(p) ((p)->flag + 0) 278#define typeflag(p) (CELL(p)->flag + 0)
239#define set_typeflag(p,v) ((p)->flag = (v)) 279#define set_typeflag(p,v) (CELL(p)->flag = (v))
240#define type(p) (typeflag (p) & T_MASKTYPE) 280#define type(p) (typeflag (p) & T_MASKTYPE)
241 281
242INTERFACE INLINE int 282INTERFACE int
243is_string (pointer p) 283is_string (pointer p)
244{ 284{
245 return type (p) == T_STRING; 285 return type (p) == T_STRING;
246} 286}
247 287
248#define strvalue(p) ((p)->object.string.svalue) 288#define strvalue(p) (CELL(p)->object.string.svalue)
249#define strlength(p) ((p)->object.string.length) 289#define strlength(p) (CELL(p)->object.string.length)
250 290
251INTERFACE int is_list (SCHEME_P_ pointer p);
252INTERFACE INLINE int 291INTERFACE int
253is_vector (pointer p) 292is_vector (pointer p)
254{ 293{
255 return type (p) == T_VECTOR; 294 return type (p) == T_VECTOR;
256} 295}
257 296
258#define vecvalue(p) ((p)->object.vector.vvalue) 297#define vecvalue(p) (CELL(p)->object.vector.vvalue)
259#define veclength(p) ((p)->object.vector.length) 298#define veclength(p) (CELL(p)->object.vector.length)
260INTERFACE void fill_vector (pointer vec, pointer obj); 299INTERFACE void fill_vector (pointer vec, uint32_t start, pointer obj);
261INTERFACE uint32_t vector_length (pointer vec);
262INTERFACE pointer vector_elem (pointer vec, uint32_t ielem); 300INTERFACE pointer vector_get (pointer vec, uint32_t ielem);
263INTERFACE void set_vector_elem (pointer vec, uint32_t ielem, pointer a); 301INTERFACE void vector_set (pointer vec, uint32_t ielem, pointer a);
264 302
265INTERFACE uint32_t 303INTERFACE int
266vector_length (pointer vec) 304is_integer (pointer p)
267{ 305{
268 return vec->object.vector.length; 306 return type (p) == T_INTEGER;
269} 307}
270 308
309/* not the same as in scheme, where integers are (correctly :) reals */
271INTERFACE INLINE int 310INTERFACE int
311is_real (pointer p)
312{
313 return type (p) == T_REAL;
314}
315
316INTERFACE int
272is_number (pointer p) 317is_number (pointer p)
273{ 318{
274 return type (p) == T_NUMBER; 319 return is_integer (p) || is_real (p);
275} 320}
276 321
277INTERFACE INLINE int 322INTERFACE int
278is_integer (pointer p)
279{
280 if (!is_number (p))
281 return 0;
282
283 if (num_is_integer (p) || ivalue (p) == rvalue (p))
284 return 1;
285
286 return 0;
287}
288
289INTERFACE INLINE int
290is_real (pointer p)
291{
292 return is_number (p) && !num_is_fixnum (p->object.number);
293}
294
295INTERFACE INLINE int
296is_character (pointer p) 323is_character (pointer p)
297{ 324{
298 return type (p) == T_CHARACTER; 325 return type (p) == T_CHARACTER;
299} 326}
300 327
301INTERFACE INLINE char * 328INTERFACE char *
302string_value (pointer p) 329string_value (pointer p)
303{ 330{
304 return strvalue (p); 331 return strvalue (p);
305} 332}
306 333
307INLINE num
308nvalue (pointer p)
309{
310 return (p)->object.number;
311}
312
313static IVALUE
314num_get_ivalue (const num n)
315{
316 return num_is_fixnum (n) ? num_ivalue (n) : (IVALUE)num_rvalue (n);
317}
318
319static RVALUE
320num_get_rvalue (const num n)
321{
322 return num_is_fixnum (n) ? (RVALUE)num_ivalue (n) : num_rvalue (n);
323}
324
325INTERFACE IVALUE
326ivalue (pointer p)
327{
328 return num_get_ivalue (p->object.number);
329}
330
331INTERFACE RVALUE
332rvalue (pointer p)
333{
334 return num_get_rvalue (p->object.number);
335}
336
337#define ivalue_unchecked(p) ((p)->object.number.value.ivalue) 334#define ivalue_unchecked(p) (CELL(p)->object.ivalue + 0)
335#define set_ivalue(p,v) CELL(p)->object.ivalue = (v)
336
338#if USE_REAL 337#if USE_REAL
339# define rvalue_unchecked(p) ((p)->object.number.value.rvalue) 338#define rvalue_unchecked(p) CELL(p)->object.rvalue
340# define set_num_integer(p) (p)->object.number.is_fixnum=1; 339#define set_rvalue(p,v) CELL(p)->object.rvalue = (v)
341# define set_num_real(p) (p)->object.number.is_fixnum=0;
342#else 340#else
343# define rvalue_unchecked(p) ((p)->object.number.value.ivalue) 341#define rvalue_unchecked(p) CELL(p)->object.ivalue
344# define set_num_integer(p) 0 342#define set_rvalue(p,v) CELL(p)->object.ivalue = (v)
345# define set_num_real(p) 0
346#endif 343#endif
344
347INTERFACE long 345INTERFACE long
348charvalue (pointer p) 346charvalue (pointer p)
349{ 347{
350 return ivalue_unchecked (p); 348 return ivalue_unchecked (p);
351} 349}
352 350
351#define port(p) CELL(p)->object.port
352#define set_port(p,v) port(p) = (v)
353INTERFACE INLINE int 353INTERFACE int
354is_port (pointer p) 354is_port (pointer p)
355{ 355{
356 return type (p) == T_PORT; 356 return type (p) == T_PORT;
357} 357}
358 358
359INTERFACE INLINE int 359INTERFACE int
360is_inport (pointer p) 360is_inport (pointer p)
361{ 361{
362 return is_port (p) && p->object.port->kind & port_input; 362 return is_port (p) && port (p)->kind & port_input;
363} 363}
364 364
365INTERFACE INLINE int 365INTERFACE int
366is_outport (pointer p) 366is_outport (pointer p)
367{ 367{
368 return is_port (p) && p->object.port->kind & port_output; 368 return is_port (p) && port (p)->kind & port_output;
369} 369}
370 370
371INTERFACE INLINE int 371INTERFACE int
372is_pair (pointer p) 372is_pair (pointer p)
373{ 373{
374 return type (p) == T_PAIR; 374 return type (p) == T_PAIR;
375} 375}
376 376
377#define car(p) ((p)->object.cons.car + 0) 377#define car(p) (POINTER (CELL(p)->object.cons.car))
378#define cdr(p) ((p)->object.cons.cdr + 0) 378#define cdr(p) (POINTER (CELL(p)->object.cons.cdr))
379 379
380static pointer caar (pointer p) { return car (car (p)); } 380static pointer caar (pointer p) { return car (car (p)); }
381static pointer cadr (pointer p) { return car (cdr (p)); } 381static pointer cadr (pointer p) { return car (cdr (p)); }
382static pointer cdar (pointer p) { return cdr (car (p)); } 382static pointer cdar (pointer p) { return cdr (car (p)); }
383static pointer cddr (pointer p) { return cdr (cdr (p)); } 383static pointer cddr (pointer p) { return cdr (cdr (p)); }
384 384
385static pointer cadar (pointer p) { return car (cdr (car (p))); } 385static pointer cadar (pointer p) { return car (cdr (car (p))); }
386static pointer caddr (pointer p) { return car (cdr (cdr (p))); } 386static pointer caddr (pointer p) { return car (cdr (cdr (p))); }
387static pointer cdaar (pointer p) { return cdr (car (car (p))); } 387static pointer cdaar (pointer p) { return cdr (car (car (p))); }
388 388
389static pointer cadddr (pointer p) { return car (car (car (cdr (p)))); }
390
389INTERFACE void 391INTERFACE void
390set_car (pointer p, pointer q) 392set_car (pointer p, pointer q)
391{ 393{
392 p->object.cons.car = q; 394 CELL(p)->object.cons.car = CELL (q);
393} 395}
394 396
395INTERFACE void 397INTERFACE void
396set_cdr (pointer p, pointer q) 398set_cdr (pointer p, pointer q)
397{ 399{
398 p->object.cons.cdr = q; 400 CELL(p)->object.cons.cdr = CELL (q);
399} 401}
400 402
401INTERFACE pointer 403INTERFACE pointer
402pair_car (pointer p) 404pair_car (pointer p)
403{ 405{
… …
408pair_cdr (pointer p) 410pair_cdr (pointer p)
409{ 411{
410 return cdr (p); 412 return cdr (p);
411} 413}
412 414
413INTERFACE INLINE int 415INTERFACE int
414is_symbol (pointer p) 416is_symbol (pointer p)
415{ 417{
416 return type (p) == T_SYMBOL; 418 return type (p) == T_SYMBOL;
417} 419}
418 420
419INTERFACE INLINE char * 421INTERFACE char *
420symname (pointer p) 422symname (pointer p)
421{ 423{
422 return strvalue (car (p)); 424 return strvalue (p);
423} 425}
424 426
425#if USE_PLIST 427#if USE_PLIST
428#error plists are broken because symbols are no longer pairs
429#define symprop(p) cdr(p)
426SCHEME_EXPORT INLINE int 430SCHEME_EXPORT int
427hasprop (pointer p) 431hasprop (pointer p)
428{ 432{
429 return typeflag (p) & T_SYMBOL; 433 return typeflag (p) & T_SYMBOL;
430} 434}
431
432# define symprop(p) cdr(p)
433#endif 435#endif
434 436
435INTERFACE INLINE int 437INTERFACE int
436is_syntax (pointer p) 438is_syntax (pointer p)
437{ 439{
438 return typeflag (p) & T_SYNTAX; 440 return typeflag (p) & T_SYNTAX;
439} 441}
440 442
441INTERFACE INLINE int 443INTERFACE int
442is_proc (pointer p) 444is_proc (pointer p)
443{ 445{
444 return type (p) == T_PROC; 446 return type (p) == T_PROC;
445} 447}
446 448
447INTERFACE INLINE int 449INTERFACE int
448is_foreign (pointer p) 450is_foreign (pointer p)
449{ 451{
450 return type (p) == T_FOREIGN; 452 return type (p) == T_FOREIGN;
451} 453}
452 454
453INTERFACE INLINE char * 455INTERFACE char *
454syntaxname (pointer p) 456syntaxname (pointer p)
455{ 457{
456 return strvalue (car (p)); 458 return strvalue (p);
457} 459}
458 460
459#define procnum(p) ivalue (p) 461#define procnum(p) ivalue_unchecked (p)
460static const char *procname (pointer x); 462static const char *procname (pointer x);
461 463
462INTERFACE INLINE int 464INTERFACE int
463is_closure (pointer p) 465is_closure (pointer p)
464{ 466{
465 return type (p) == T_CLOSURE; 467 return type (p) == T_CLOSURE;
466} 468}
467 469
468INTERFACE INLINE int 470INTERFACE int
469is_macro (pointer p) 471is_macro (pointer p)
470{ 472{
471 return type (p) == T_MACRO; 473 return type (p) == T_MACRO;
472} 474}
473 475
474INTERFACE INLINE pointer 476INTERFACE pointer
475closure_code (pointer p) 477closure_code (pointer p)
476{ 478{
477 return car (p); 479 return car (p);
478} 480}
479 481
480INTERFACE INLINE pointer 482INTERFACE pointer
481closure_env (pointer p) 483closure_env (pointer p)
482{ 484{
483 return cdr (p); 485 return cdr (p);
484} 486}
485 487
486INTERFACE INLINE int 488INTERFACE int
487is_continuation (pointer p) 489is_continuation (pointer p)
488{ 490{
489 return type (p) == T_CONTINUATION; 491 return type (p) == T_CONTINUATION;
490} 492}
491 493
492#define cont_dump(p) cdr (p) 494#define cont_dump(p) cdr (p)
493#define set_cont_dump(p,v) set_cdr ((p), (v)) 495#define set_cont_dump(p,v) set_cdr ((p), (v))
494 496
495/* To do: promise should be forced ONCE only */ 497/* To do: promise should be forced ONCE only */
496INTERFACE INLINE int 498INTERFACE int
497is_promise (pointer p) 499is_promise (pointer p)
498{ 500{
499 return type (p) == T_PROMISE; 501 return type (p) == T_PROMISE;
500} 502}
501 503
502INTERFACE INLINE int 504INTERFACE int
503is_environment (pointer p) 505is_environment (pointer p)
504{ 506{
505 return type (p) == T_ENVIRONMENT; 507 return type (p) == T_ENVIRONMENT;
506} 508}
507 509
… …
509 511
510#define is_atom(p) (typeflag (p) & T_ATOM) 512#define is_atom(p) (typeflag (p) & T_ATOM)
511#define setatom(p) set_typeflag ((p), typeflag (p) | T_ATOM) 513#define setatom(p) set_typeflag ((p), typeflag (p) | T_ATOM)
512#define clratom(p) set_typeflag ((p), typeflag (p) & ~T_ATOM) 514#define clratom(p) set_typeflag ((p), typeflag (p) & ~T_ATOM)
513 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
514#define is_mark(p) (typeflag (p) & T_MARK) 521#define is_mark(p) (typeflag (p) & T_MARK)
515#define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK) 522#define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK)
516#define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK) 523#define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK)
524#endif
517 525
518INTERFACE INLINE int 526INTERFACE int
519is_immutable (pointer p) 527is_immutable (pointer p)
520{ 528{
521 return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING; 529 return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING;
522} 530}
523 531
524INTERFACE INLINE void 532INTERFACE void
525setimmutable (pointer p) 533setimmutable (pointer p)
526{ 534{
527#if USE_ERROR_CHECKING 535#if USE_ERROR_CHECKING
528 set_typeflag (p, typeflag (p) | T_IMMUTABLE); 536 set_typeflag (p, typeflag (p) | T_IMMUTABLE);
529#endif 537#endif
530} 538}
531 539
540/* Result is:
541 proper list: length
542 circular list: -1
543 not even a pair: -2
544 dotted list: -2 minus length before dot
545*/
546ecb_hot INTERFACE int
547list_length (SCHEME_P_ pointer a)
548{
549 int i = 0;
550 pointer slow, fast;
551
552 slow = fast = a;
553
554 while (1)
555 {
556 if (fast == NIL)
557 return i;
558
559 if (!is_pair (fast))
560 return -2 - i;
561
562 fast = cdr (fast);
563 ++i;
564
565 if (fast == NIL)
566 return i;
567
568 if (!is_pair (fast))
569 return -2 - i;
570
571 ++i;
572 fast = cdr (fast);
573
574 /* Safe because we would have already returned if `fast'
575 encountered a non-pair. */
576 slow = cdr (slow);
577
578 if (fast == slow)
579 {
580 /* the fast pointer has looped back around and caught up
581 with the slow pointer, hence the structure is circular,
582 not of finite length, and therefore not a list */
583 return -1;
584 }
585 }
586}
587
588INTERFACE int
589is_list (SCHEME_P_ pointer a)
590{
591 return list_length (SCHEME_A_ a) >= 0;
592}
593
532#if USE_CHAR_CLASSIFIERS 594#if USE_CHAR_CLASSIFIERS
533static INLINE int 595
596ecb_inline int
534Cisalpha (int c) 597Cisalpha (int c)
535{ 598{
536 return isascii (c) && isalpha (c); 599 return isascii (c) && isalpha (c);
537} 600}
538 601
539static INLINE int 602ecb_inline int
540Cisdigit (int c) 603Cisdigit (int c)
541{ 604{
542 return isascii (c) && isdigit (c); 605 return isascii (c) && isdigit (c);
543} 606}
544 607
545static INLINE int 608ecb_inline int
546Cisspace (int c) 609Cisspace (int c)
547{ 610{
548 return isascii (c) && isspace (c); 611 return isascii (c) && isspace (c);
549} 612}
550 613
551static INLINE int 614ecb_inline int
552Cisupper (int c) 615Cisupper (int c)
553{ 616{
554 return isascii (c) && isupper (c); 617 return isascii (c) && isupper (c);
555} 618}
556 619
557static INLINE int 620ecb_inline int
558Cislower (int c) 621Cislower (int c)
559{ 622{
560 return isascii (c) && islower (c); 623 return isascii (c) && islower (c);
561} 624}
562#endif 625#endif
… …
595 "gs", 658 "gs",
596 "rs", 659 "rs",
597 "us" 660 "us"
598}; 661};
599 662
600static int 663ecb_cold static int
601is_ascii_name (const char *name, int *pc) 664is_ascii_name (const char *name, int *pc)
602{ 665{
603 int i; 666 int i;
604 667
605 for (i = 0; i < 32; i++) 668 for (i = 0; i < 32; i++)
… …
623#endif 686#endif
624 687
625static int file_push (SCHEME_P_ const char *fname); 688static int file_push (SCHEME_P_ const char *fname);
626static void file_pop (SCHEME_P); 689static void file_pop (SCHEME_P);
627static int file_interactive (SCHEME_P); 690static int file_interactive (SCHEME_P);
628static INLINE int is_one_of (char *s, int c); 691ecb_inline int is_one_of (const char *s, int c);
629static int alloc_cellseg (SCHEME_P_ int n); 692static int alloc_cellseg (SCHEME_P);
630static INLINE pointer get_cell (SCHEME_P_ pointer a, pointer b); 693ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b);
631static void finalize_cell (SCHEME_P_ pointer a); 694static void finalize_cell (SCHEME_P_ pointer a);
632static int count_consecutive_cells (pointer x, int needed);
633static 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);
634static pointer mk_number (SCHEME_P_ const num n); 696static pointer mk_number (SCHEME_P_ const num n);
635static 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);
636static pointer mk_vector (SCHEME_P_ uint32_t len); 698static pointer mk_vector (SCHEME_P_ uint32_t len);
637static pointer mk_atom (SCHEME_P_ char *q); 699static pointer mk_atom (SCHEME_P_ char *q);
638static pointer mk_sharp_const (SCHEME_P_ char *name); 700static pointer mk_sharp_const (SCHEME_P_ char *name);
639 701
702static pointer mk_port (SCHEME_P_ port *p);
703
640#if USE_PORTS 704#if USE_PORTS
641static pointer mk_port (SCHEME_P_ port *p);
642static pointer port_from_filename (SCHEME_P_ const char *fn, int prop); 705static pointer port_from_filename (SCHEME_P_ const char *fn, int prop);
643static pointer port_from_file (SCHEME_P_ int, int prop); 706static pointer port_from_file (SCHEME_P_ int, int prop);
644static 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);
645static 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);
646static port *port_rep_from_file (SCHEME_P_ int, int prop); 709static port *port_rep_from_file (SCHEME_P_ int, int prop);
647static 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);
648static void port_close (SCHEME_P_ pointer p, int flag); 711static void port_close (SCHEME_P_ pointer p, int flag);
649#endif 712#endif
713
650static void mark (pointer a); 714static void mark (pointer a);
651static void gc (SCHEME_P_ pointer a, pointer b); 715static void gc (SCHEME_P_ pointer a, pointer b);
652static int basic_inchar (port *pt); 716static int basic_inchar (port *pt);
653static int inchar (SCHEME_P); 717static int inchar (SCHEME_P);
654static void backchar (SCHEME_P_ int c); 718static void backchar (SCHEME_P_ int c);
655static char *readstr_upto (SCHEME_P_ char *delim); 719static char *readstr_upto (SCHEME_P_ int skip, const char *delim);
656static pointer readstrexp (SCHEME_P); 720static pointer readstrexp (SCHEME_P_ char delim);
657static INLINE int skipspace (SCHEME_P); 721static int skipspace (SCHEME_P);
658static int token (SCHEME_P); 722static int token (SCHEME_P);
659static void printslashstring (SCHEME_P_ char *s, int len); 723static void printslashstring (SCHEME_P_ char *s, int len);
660static 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);
661static void printatom (SCHEME_P_ pointer l, int f); 725static void printatom (SCHEME_P_ pointer l, int f);
662static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op); 726static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op);
… …
666static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list); 730static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list);
667static pointer revappend (SCHEME_P_ pointer a, pointer b); 731static pointer revappend (SCHEME_P_ pointer a, pointer b);
668static pointer ss_get_cont (SCHEME_P); 732static pointer ss_get_cont (SCHEME_P);
669static void ss_set_cont (SCHEME_P_ pointer cont); 733static void ss_set_cont (SCHEME_P_ pointer cont);
670static void dump_stack_mark (SCHEME_P); 734static void dump_stack_mark (SCHEME_P);
671static pointer opexe_0 (SCHEME_P_ enum scheme_opcodes op); 735static int opexe_0 (SCHEME_P_ enum scheme_opcodes op);
736static int opexe_1 (SCHEME_P_ enum scheme_opcodes op);
672static pointer opexe_2 (SCHEME_P_ enum scheme_opcodes op); 737static int opexe_2 (SCHEME_P_ enum scheme_opcodes op);
673static pointer opexe_r (SCHEME_P_ enum scheme_opcodes op);
674static pointer opexe_3 (SCHEME_P_ enum scheme_opcodes op); 738static int opexe_3 (SCHEME_P_ enum scheme_opcodes op);
675static pointer opexe_4 (SCHEME_P_ enum scheme_opcodes op); 739static int opexe_4 (SCHEME_P_ enum scheme_opcodes op);
676static pointer opexe_5 (SCHEME_P_ enum scheme_opcodes op); 740static int opexe_5 (SCHEME_P_ enum scheme_opcodes op);
677static pointer opexe_6 (SCHEME_P_ enum scheme_opcodes op); 741static int opexe_6 (SCHEME_P_ enum scheme_opcodes op);
678static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op); 742static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op);
679static void assign_syntax (SCHEME_P_ const char *name); 743static void assign_syntax (SCHEME_P_ const char *name);
680static int syntaxnum (pointer p); 744static int syntaxnum (pointer p);
681static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name); 745static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name);
682 746
747static IVALUE
748ivalue (pointer x)
749{
750 return is_integer (x) ? ivalue_unchecked (x) : rvalue_unchecked (x);
751}
752
753static RVALUE
754rvalue (pointer x)
755{
756 return is_integer (x) ? ivalue_unchecked (x) : rvalue_unchecked (x);
757}
758
759INTERFACE num
760nvalue (pointer x)
761{
762 num n;
763
764 num_set_fixnum (n, is_integer (x));
765
766 if (num_is_fixnum (n))
767 num_set_ivalue (n, ivalue_unchecked (x));
768 else
769 num_set_rvalue (n, rvalue_unchecked (x));
770
771 return n;
772}
773
683static num 774static num
684num_op (enum num_op op, num a, num b) 775num_op (enum num_op op, num a, num b)
685{ 776{
686 num ret; 777 num ret;
687 778
688 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 779 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
689 780
690 if (num_is_fixnum (ret)) 781 if (num_is_fixnum (ret))
691 { 782 {
692 IVALUE av = num_get_ivalue (a);
693 IVALUE bv = num_get_ivalue (b);
694
695 switch (op) 783 switch (op)
696 { 784 {
697 case NUM_ADD: av += bv; break; 785 case NUM_ADD: a.ivalue += b.ivalue; break;
698 case NUM_SUB: av -= bv; break; 786 case NUM_SUB: a.ivalue -= b.ivalue; break;
699 case NUM_MUL: av *= bv; break; 787 case NUM_MUL: a.ivalue *= b.ivalue; break;
700 case NUM_INTDIV: av /= bv; break; 788 case NUM_INTDIV: a.ivalue /= b.ivalue; break;
701 } 789 }
702 790
703 num_set_ivalue (ret, av); 791 num_set_ivalue (ret, a.ivalue);
704 } 792 }
793#if USE_REAL
705 else 794 else
706 { 795 {
707 RVALUE av = num_get_rvalue (a);
708 RVALUE bv = num_get_rvalue (b);
709
710 switch (op) 796 switch (op)
711 { 797 {
712 case NUM_ADD: av += bv; break; 798 case NUM_ADD: a.rvalue += b.rvalue; break;
713 case NUM_SUB: av -= bv; break; 799 case NUM_SUB: a.rvalue -= b.rvalue; break;
714 case NUM_MUL: av *= bv; break; 800 case NUM_MUL: a.rvalue *= b.rvalue; break;
715 case NUM_INTDIV: av /= bv; break; 801 case NUM_INTDIV: a.rvalue /= b.rvalue; break;
716 } 802 }
717 803
718 num_set_rvalue (ret, av); 804 num_set_rvalue (ret, a.rvalue);
719 } 805 }
806#endif
720 807
721 return ret; 808 return ret;
722} 809}
723 810
724static num 811static num
725num_div (num a, num b) 812num_div (num a, num b)
726{ 813{
727 num ret; 814 num ret;
728 815
729 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_get_ivalue (a) % num_get_ivalue (b) == 0); 816 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_ivalue (a) % num_ivalue (b) == 0);
730 817
731 if (num_is_fixnum (ret)) 818 if (num_is_fixnum (ret))
732 num_set_ivalue (ret, num_get_ivalue (a) / num_get_ivalue (b)); 819 num_set_ivalue (ret, num_ivalue (a) / num_ivalue (b));
733 else 820 else
734 num_set_rvalue (ret, num_get_rvalue (a) / num_get_rvalue (b)); 821 num_set_rvalue (ret, num_rvalue (a) / num_rvalue (b));
735 822
736 return ret; 823 return ret;
737} 824}
738 825
739static num 826static num
… …
741{ 828{
742 num ret; 829 num ret;
743 long e1, e2, res; 830 long e1, e2, res;
744 831
745 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 832 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
746 e1 = num_get_ivalue (a); 833 e1 = num_ivalue (a);
747 e2 = num_get_ivalue (b); 834 e2 = num_ivalue (b);
748 res = e1 % e2; 835 res = e1 % e2;
749 836
750 /* remainder should have same sign as second operand */ 837 /* remainder should have same sign as second operand */
751 if (res > 0) 838 if (res > 0)
752 { 839 {
… …
768{ 855{
769 num ret; 856 num ret;
770 long e1, e2, res; 857 long e1, e2, res;
771 858
772 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 859 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
773 e1 = num_get_ivalue (a); 860 e1 = num_ivalue (a);
774 e2 = num_get_ivalue (b); 861 e2 = num_ivalue (b);
775 res = e1 % e2; 862 res = e1 % e2;
776 863
777 /* modulo should have same sign as second operand */ 864 /* modulo should have same sign as second operand */
778 if (res * e2 < 0) 865 if (res * e2 < 0)
779 res += e2; 866 res += e2;
780 867
781 num_set_ivalue (ret, res); 868 num_set_ivalue (ret, res);
782 return ret; 869 return ret;
783} 870}
784 871
785/* this completely disrespects NaNs */ 872/* this completely disrespects NaNs, but r5rs doesn't even allow NaNs */
786static int 873static int
787num_cmp (num a, num b) 874num_cmp (num a, num b)
788{ 875{
789 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b); 876 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
790 int ret; 877 int ret;
791 878
792 if (is_fixnum) 879 if (is_fixnum)
793 { 880 {
794 IVALUE av = num_get_ivalue (a); 881 IVALUE av = num_ivalue (a);
795 IVALUE bv = num_get_ivalue (b); 882 IVALUE bv = num_ivalue (b);
796 883
797 ret = av == bv ? 0 : av < bv ? -1 : +1; 884 ret = av == bv ? 0 : av < bv ? -1 : +1;
798 } 885 }
799 else 886 else
800 { 887 {
801 RVALUE av = num_get_rvalue (a); 888 RVALUE av = num_rvalue (a);
802 RVALUE bv = num_get_rvalue (b); 889 RVALUE bv = num_rvalue (b);
803 890
804 ret = av == bv ? 0 : av < bv ? -1 : +1; 891 ret = av == bv ? 0 : av < bv ? -1 : +1;
805 } 892 }
806 893
807 return ret; 894 return ret;
808} 895}
809
810#if USE_MATH
811
812/* Round to nearest. Round to even if midway */
813static double
814round_per_R5RS (double x)
815{
816 double fl = floor (x);
817 double ce = ceil (x);
818 double dfl = x - fl;
819 double dce = ce - x;
820
821 if (dfl > dce)
822 return ce;
823 else if (dfl < dce)
824 return fl;
825 else
826 {
827 if (fmod (fl, 2) == 0) /* I imagine this holds */
828 return fl;
829 else
830 return ce;
831 }
832}
833#endif
834 896
835static int 897static int
836is_zero_rvalue (RVALUE x) 898is_zero_rvalue (RVALUE x)
837{ 899{
900 return x == 0;
901#if 0
838#if USE_REAL 902#if USE_REAL
839 return x < DBL_MIN && x > -DBL_MIN; /* why the hate of denormals? this should be == 0. */ 903 return x < DBL_MIN && x > -DBL_MIN; /* why the hate of denormals? this should be == 0. */
840#else 904#else
841 return x == 0; 905 return x == 0;
842#endif 906#endif
907#endif
843} 908}
844 909
845/* allocate new cell segment */ 910/* allocate new cell segment */
846static int 911ecb_cold static int
847alloc_cellseg (SCHEME_P_ int n) 912alloc_cellseg (SCHEME_P)
848{ 913{
849 pointer newp; 914 struct cell *newp;
850 pointer last; 915 struct cell *last;
851 pointer p; 916 struct cell *p;
852 char *cp; 917 char *cp;
853 long i; 918 long i;
854 int k; 919 int k;
855 920
856 static int segsize = CELL_SEGSIZE >> 1; 921 static int segsize = CELL_SEGSIZE >> 1;
857 segsize <<= 1; 922 segsize <<= 1;
858 923
859 for (k = 0; k < n; k++)
860 {
861 if (SCHEME_V->last_cell_seg >= CELL_NSEGMENT - 1)
862 return k;
863
864 cp = malloc (segsize * sizeof (struct cell)); 924 cp = malloc (segsize * sizeof (struct cell));
865 925
866 if (!cp && USE_ERROR_CHECKING) 926 if (!cp && USE_ERROR_CHECKING)
867 return k; 927 return k;
868 928
869 i = ++SCHEME_V->last_cell_seg; 929 i = ++SCHEME_V->last_cell_seg;
870 SCHEME_V->alloc_seg[i] = cp;
871 930
872 /* insert new segment in address order */ 931 newp = (struct cell *)cp;
873 newp = (pointer)cp;
874 SCHEME_V->cell_seg[i] = newp; 932 SCHEME_V->cell_seg[i] = newp;
875 SCHEME_V->cell_segsize[i] = segsize; 933 SCHEME_V->cell_segsize[i] = segsize;
876
877 //TODO: insert, not swap
878 while (i > 0 && SCHEME_V->cell_seg[i - 1] > SCHEME_V->cell_seg[i])
879 {
880 p = SCHEME_V->cell_seg[i];
881 SCHEME_V->cell_seg[i] = SCHEME_V->cell_seg[i - 1];
882 SCHEME_V->cell_seg[i - 1] = p;
883
884 k = SCHEME_V->cell_segsize[i];
885 SCHEME_V->cell_segsize[i] = SCHEME_V->cell_segsize[i - 1];
886 SCHEME_V->cell_segsize[i - 1] = k;
887
888 --i;
889 }
890
891 SCHEME_V->fcells += segsize; 934 SCHEME_V->fcells += segsize;
892 last = newp + segsize - 1; 935 last = newp + segsize - 1;
893 936
894 for (p = newp; p <= last; p++) 937 for (p = newp; p <= last; p++)
895 { 938 {
939 pointer cp = POINTER (p);
940 clrmark (cp);
896 set_typeflag (p, T_FREE); 941 set_typeflag (cp, T_PAIR);
897 set_car (p, NIL); 942 set_car (cp, NIL);
898 set_cdr (p, p + 1); 943 set_cdr (cp, POINTER (p + 1));
899 } 944 }
900 945
901 /* insert new cells in address order on free list */
902 if (SCHEME_V->free_cell == NIL || p < SCHEME_V->free_cell)
903 {
904 set_cdr (last, SCHEME_V->free_cell); 946 set_cdr (POINTER (last), SCHEME_V->free_cell);
905 SCHEME_V->free_cell = newp; 947 SCHEME_V->free_cell = POINTER (newp);
906 }
907 else
908 {
909 p = SCHEME_V->free_cell;
910 948
911 while (cdr (p) != NIL && newp > cdr (p))
912 p = cdr (p);
913
914 set_cdr (last, cdr (p));
915 set_cdr (p, newp);
916 }
917 }
918
919 return n; 949 return 1;
920} 950}
921 951
922/* get new cell. parameter a, b is marked by gc. */ 952/* get new cell. parameter a, b is marked by gc. */
923static INLINE pointer 953ecb_inline pointer
924get_cell_x (SCHEME_P_ pointer a, pointer b) 954get_cell_x (SCHEME_P_ pointer a, pointer b)
925{ 955{
926 if (ecb_expect_false (SCHEME_V->free_cell == NIL)) 956 if (ecb_expect_false (SCHEME_V->free_cell == NIL))
927 { 957 {
928 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 958 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
929 return S_SINK; 959 return S_SINK;
930 960
931 if (SCHEME_V->free_cell == NIL) 961 if (SCHEME_V->free_cell == NIL)
932 { 962 {
933 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;
934 964
935 gc (SCHEME_A_ a, b); 965 gc (SCHEME_A_ a, b);
936 966
937 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)
938 { 968 {
939 /* 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 */
940 if (!alloc_cellseg (SCHEME_A_ 1) && SCHEME_V->free_cell == NIL) 970 if (!alloc_cellseg (SCHEME_A) && SCHEME_V->free_cell == NIL)
941 { 971 {
942#if USE_ERROR_CHECKING 972#if USE_ERROR_CHECKING
943 SCHEME_V->no_memory = 1; 973 SCHEME_V->no_memory = 1;
944 return S_SINK; 974 return S_SINK;
945#endif 975#endif
… …
957 } 987 }
958} 988}
959 989
960/* To retain recent allocs before interpreter knows about them - 990/* To retain recent allocs before interpreter knows about them -
961 Tehom */ 991 Tehom */
962 992ecb_hot static void
963static void
964push_recent_alloc (SCHEME_P_ pointer recent, pointer extra) 993push_recent_alloc (SCHEME_P_ pointer recent, pointer extra)
965{ 994{
966 pointer holder = get_cell_x (SCHEME_A_ recent, extra); 995 pointer holder = get_cell_x (SCHEME_A_ recent, extra);
967 996
968 set_typeflag (holder, T_PAIR); 997 set_typeflag (holder, T_PAIR);
… …
970 set_car (holder, recent); 999 set_car (holder, recent);
971 set_cdr (holder, car (S_SINK)); 1000 set_cdr (holder, car (S_SINK));
972 set_car (S_SINK, holder); 1001 set_car (S_SINK, holder);
973} 1002}
974 1003
975static pointer 1004ecb_hot static pointer
976get_cell (SCHEME_P_ pointer a, pointer b) 1005get_cell (SCHEME_P_ pointer a, pointer b)
977{ 1006{
978 pointer cell = get_cell_x (SCHEME_A_ a, b); 1007 pointer cell = get_cell_x (SCHEME_A_ a, b);
979 1008
980 /* 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
… …
989} 1018}
990 1019
991static pointer 1020static pointer
992get_vector_object (SCHEME_P_ uint32_t len, pointer init) 1021get_vector_object (SCHEME_P_ uint32_t len, pointer init)
993{ 1022{
994 pointer v = get_cell_x (SCHEME_A_ 0, 0); 1023 pointer v = get_cell_x (SCHEME_A_ NIL, NIL);
995 pointer *e = malloc (len * sizeof (pointer)); 1024 pointer *e = malloc (len * sizeof (pointer));
996 1025
997 if (!e && USE_ERROR_CHECKING) 1026 if (!e && USE_ERROR_CHECKING)
998 return S_SINK; 1027 return S_SINK;
999 1028
1000 /* Record it as a vector so that gc understands it. */ 1029 /* Record it as a vector so that gc understands it. */
1001 set_typeflag (v, T_VECTOR | T_ATOM); 1030 set_typeflag (v, T_VECTOR | T_ATOM);
1002 1031
1003 v->object.vector.vvalue = e; 1032 CELL(v)->object.vector.vvalue = e;
1004 v->object.vector.length = len; 1033 CELL(v)->object.vector.length = len;
1005 fill_vector (v, init); 1034 fill_vector (v, 0, init);
1006 push_recent_alloc (SCHEME_A_ v, NIL); 1035 push_recent_alloc (SCHEME_A_ v, NIL);
1007 1036
1008 return v; 1037 return v;
1009} 1038}
1010 1039
1011static INLINE void 1040ecb_inline void
1012ok_to_freely_gc (SCHEME_P) 1041ok_to_freely_gc (SCHEME_P)
1013{ 1042{
1014 set_car (S_SINK, NIL); 1043 set_car (S_SINK, NIL);
1015} 1044}
1016 1045
… …
1018static void 1047static void
1019check_cell_alloced (pointer p, int expect_alloced) 1048check_cell_alloced (pointer p, int expect_alloced)
1020{ 1049{
1021 /* 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. */
1022 if (typeflag (p) & !expect_alloced) 1051 if (typeflag (p) & !expect_alloced)
1023 xwrstr ("Cell is already allocated!\n"); 1052 putstr (SCHEME_A_ "Cell is already allocated!\n");
1024 1053
1025 if (!(typeflag (p)) & expect_alloced) 1054 if (!(typeflag (p)) & expect_alloced)
1026 xwrstr ("Cell is not allocated!\n"); 1055 putstr (SCHEME_A_ "Cell is not allocated!\n");
1027} 1056}
1028 1057
1029static void 1058static void
1030check_range_alloced (pointer p, int n, int expect_alloced) 1059check_range_alloced (pointer p, int n, int expect_alloced)
1031{ 1060{
… …
1037#endif 1066#endif
1038 1067
1039/* Medium level cell allocation */ 1068/* Medium level cell allocation */
1040 1069
1041/* get new cons cell */ 1070/* get new cons cell */
1042pointer 1071ecb_hot static pointer
1043xcons (SCHEME_P_ pointer a, pointer b, int immutable) 1072xcons (SCHEME_P_ pointer a, pointer b)
1044{ 1073{
1045 pointer x = get_cell (SCHEME_A_ a, b); 1074 pointer x = get_cell (SCHEME_A_ a, b);
1046 1075
1047 set_typeflag (x, T_PAIR); 1076 set_typeflag (x, T_PAIR);
1048
1049 if (immutable)
1050 setimmutable (x);
1051 1077
1052 set_car (x, a); 1078 set_car (x, a);
1053 set_cdr (x, b); 1079 set_cdr (x, b);
1054 1080
1055 return x; 1081 return x;
1056} 1082}
1057 1083
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
1096generate_symbol (SCHEME_P_ const char *name)
1097{
1098 pointer x = mk_string (SCHEME_A_ name);
1099 setimmutable (x);
1100 set_typeflag (x, T_SYMBOL | T_ATOM);
1101 return x;
1102}
1103
1058/* ========== oblist implementation ========== */ 1104/* ========== oblist implementation ========== */
1059 1105
1060#ifndef USE_OBJECT_LIST 1106#ifndef USE_OBJECT_LIST
1061 1107
1108static int
1062static int hash_fn (const char *key, int table_size); 1109hash_fn (const char *key, int table_size)
1110{
1111 const unsigned char *p = (unsigned char *)key;
1112 uint32_t hash = 2166136261U;
1063 1113
1114 while (*p)
1115 hash = (hash ^ *p++) * 16777619;
1116
1117 return hash % table_size;
1118}
1119
1064static pointer 1120ecb_cold static pointer
1065oblist_initial_value (SCHEME_P) 1121oblist_initial_value (SCHEME_P)
1066{ 1122{
1067 return mk_vector (SCHEME_A_ 461); /* probably should be bigger */ 1123 return mk_vector (SCHEME_A_ 461); /* probably should be bigger */
1068} 1124}
1069 1125
1070/* returns the new symbol */ 1126/* returns the new symbol */
1071static pointer 1127ecb_cold static pointer
1072oblist_add_by_name (SCHEME_P_ const char *name) 1128oblist_add_by_name (SCHEME_P_ const char *name)
1073{ 1129{
1074 int location; 1130 pointer x = generate_symbol (SCHEME_A_ name);
1075
1076 pointer x = immutable_cons (mk_string (SCHEME_A_ name), NIL);
1077 set_typeflag (x, T_SYMBOL);
1078 setimmutable (car (x));
1079
1080 location = hash_fn (name, veclength (SCHEME_V->oblist)); 1131 int location = hash_fn (name, veclength (SCHEME_V->oblist));
1081 set_vector_elem (SCHEME_V->oblist, location, immutable_cons (x, vector_elem (SCHEME_V->oblist, location))); 1132 vector_set (SCHEME_V->oblist, location, immutable_cons (x, vector_get (SCHEME_V->oblist, location)));
1082 return x; 1133 return x;
1083} 1134}
1084 1135
1085static INLINE pointer 1136ecb_cold static pointer
1086oblist_find_by_name (SCHEME_P_ const char *name) 1137oblist_find_by_name (SCHEME_P_ const char *name)
1087{ 1138{
1088 int location; 1139 int location;
1089 pointer x; 1140 pointer x;
1090 char *s; 1141 char *s;
1091 1142
1092 location = hash_fn (name, veclength (SCHEME_V->oblist)); 1143 location = hash_fn (name, veclength (SCHEME_V->oblist));
1093 1144
1094 for (x = vector_elem (SCHEME_V->oblist, location); x != NIL; x = cdr (x)) 1145 for (x = vector_get (SCHEME_V->oblist, location); x != NIL; x = cdr (x))
1095 { 1146 {
1096 s = symname (car (x)); 1147 s = symname (car (x));
1097 1148
1098 /* case-insensitive, per R5RS section 2 */ 1149 /* case-insensitive, per R5RS section 2 */
1099 if (stricmp (name, s) == 0) 1150 if (stricmp (name, s) == 0)
… …
1101 } 1152 }
1102 1153
1103 return NIL; 1154 return NIL;
1104} 1155}
1105 1156
1106static pointer 1157ecb_cold static pointer
1107oblist_all_symbols (SCHEME_P) 1158oblist_all_symbols (SCHEME_P)
1108{ 1159{
1109 int i; 1160 int i;
1110 pointer x; 1161 pointer x;
1111 pointer ob_list = NIL; 1162 pointer ob_list = NIL;
1112 1163
1113 for (i = 0; i < veclength (SCHEME_V->oblist); i++) 1164 for (i = 0; i < veclength (SCHEME_V->oblist); i++)
1114 for (x = vector_elem (SCHEME_V->oblist, i); x != NIL; x = cdr (x)) 1165 for (x = vector_get (SCHEME_V->oblist, i); x != NIL; x = cdr (x))
1115 ob_list = cons (x, ob_list); 1166 ob_list = cons (x, ob_list);
1116 1167
1117 return ob_list; 1168 return ob_list;
1118} 1169}
1119 1170
1120#else 1171#else
1121 1172
1122static pointer 1173ecb_cold static pointer
1123oblist_initial_value (SCHEME_P) 1174oblist_initial_value (SCHEME_P)
1124{ 1175{
1125 return NIL; 1176 return NIL;
1126} 1177}
1127 1178
1128static INLINE pointer 1179ecb_cold static pointer
1129oblist_find_by_name (SCHEME_P_ const char *name) 1180oblist_find_by_name (SCHEME_P_ const char *name)
1130{ 1181{
1131 pointer x; 1182 pointer x;
1132 char *s; 1183 char *s;
1133 1184
… …
1142 1193
1143 return NIL; 1194 return NIL;
1144} 1195}
1145 1196
1146/* returns the new symbol */ 1197/* returns the new symbol */
1147static pointer 1198ecb_cold static pointer
1148oblist_add_by_name (SCHEME_P_ const char *name) 1199oblist_add_by_name (SCHEME_P_ const char *name)
1149{ 1200{
1150 pointer x; 1201 pointer x = generate_symbol (SCHEME_A_ name);
1151
1152 x = immutable_cons (mk_string (SCHEME_A_ name), NIL);
1153 set_typeflag (x, T_SYMBOL);
1154 setimmutable (car (x));
1155 SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist); 1202 SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist);
1156 return x; 1203 return x;
1157} 1204}
1158 1205
1159static pointer 1206ecb_cold static pointer
1160oblist_all_symbols (SCHEME_P) 1207oblist_all_symbols (SCHEME_P)
1161{ 1208{
1162 return SCHEME_V->oblist; 1209 return SCHEME_V->oblist;
1163} 1210}
1164 1211
1165#endif 1212#endif
1166 1213
1167#if USE_PORTS
1168static pointer 1214ecb_cold static pointer
1169mk_port (SCHEME_P_ port *p) 1215mk_port (SCHEME_P_ port *p)
1170{ 1216{
1171 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1217 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1172 1218
1173 set_typeflag (x, T_PORT | T_ATOM); 1219 set_typeflag (x, T_PORT | T_ATOM);
1174 x->object.port = p; 1220 set_port (x, p);
1175 1221
1176 return x; 1222 return x;
1177} 1223}
1178#endif
1179 1224
1180pointer 1225ecb_cold pointer
1181mk_foreign_func (SCHEME_P_ foreign_func f) 1226mk_foreign_func (SCHEME_P_ foreign_func f)
1182{ 1227{
1183 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1228 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1184 1229
1185 set_typeflag (x, (T_FOREIGN | T_ATOM)); 1230 set_typeflag (x, T_FOREIGN | T_ATOM);
1186 x->object.ff = f; 1231 CELL(x)->object.ff = f;
1187 1232
1188 return x; 1233 return x;
1189} 1234}
1190 1235
1191INTERFACE pointer 1236INTERFACE pointer
1192mk_character (SCHEME_P_ int c) 1237mk_character (SCHEME_P_ int c)
1193{ 1238{
1194 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1239 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1195 1240
1196 set_typeflag (x, (T_CHARACTER | T_ATOM)); 1241 set_typeflag (x, T_CHARACTER | T_ATOM);
1197 ivalue_unchecked (x) = c & 0xff; 1242 set_ivalue (x, c & 0xff);
1198 set_num_integer (x); 1243
1199 return x; 1244 return x;
1200} 1245}
1201 1246
1202/* get number atom (integer) */ 1247/* get number atom (integer) */
1203INTERFACE pointer 1248INTERFACE pointer
1204mk_integer (SCHEME_P_ long num) 1249mk_integer (SCHEME_P_ long n)
1205{ 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 {
1206 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1261 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1207 1262
1208 set_typeflag (x, (T_NUMBER | T_ATOM)); 1263 set_typeflag (x, T_INTEGER | T_ATOM);
1209 ivalue_unchecked (x) = num; 1264 setimmutable (x); /* shouldn't do anything, doesn't cost anything */
1210 set_num_integer (x); 1265 set_ivalue (x, n);
1266
1267 *pp = x;
1268 }
1269
1211 return x; 1270 return *pp;
1212} 1271}
1213 1272
1214INTERFACE pointer 1273INTERFACE pointer
1215mk_real (SCHEME_P_ RVALUE n) 1274mk_real (SCHEME_P_ RVALUE n)
1216{ 1275{
1276#if USE_REAL
1217 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1277 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1218 1278
1219 set_typeflag (x, (T_NUMBER | T_ATOM)); 1279 set_typeflag (x, T_REAL | T_ATOM);
1220 rvalue_unchecked (x) = n; 1280 set_rvalue (x, n);
1221 set_num_real (x); 1281
1222 return x; 1282 return x;
1283#else
1284 return mk_integer (SCHEME_A_ n);
1285#endif
1223} 1286}
1224 1287
1225static pointer 1288static pointer
1226mk_number (SCHEME_P_ const num n) 1289mk_number (SCHEME_P_ const num n)
1227{ 1290{
1291#if USE_REAL
1228 if (num_is_fixnum (n)) 1292 return num_is_fixnum (n)
1293 ? mk_integer (SCHEME_A_ num_ivalue (n))
1294 : mk_real (SCHEME_A_ num_rvalue (n));
1295#else
1229 return mk_integer (SCHEME_A_ num_get_ivalue (n)); 1296 return mk_integer (SCHEME_A_ num_ivalue (n));
1230 else 1297#endif
1231 return mk_real (SCHEME_A_ num_get_rvalue (n));
1232} 1298}
1233 1299
1234/* allocate name to string area */ 1300/* allocate name to string area */
1235static char * 1301static char *
1236store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill) 1302store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill)
… …
1242 SCHEME_V->no_memory = 1; 1308 SCHEME_V->no_memory = 1;
1243 return SCHEME_V->strbuff; 1309 return SCHEME_V->strbuff;
1244 } 1310 }
1245 1311
1246 if (str) 1312 if (str)
1247 { 1313 memcpy (q, str , len_str); /* caller must ensure that *str has length len_str */
1248 int l = strlen (str);
1249
1250 if (l > len_str)
1251 l = len_str;
1252
1253 memcpy (q, str, l);
1254 q[l] = 0;
1255 }
1256 else 1314 else
1257 {
1258 memset (q, fill, len_str); 1315 memset (q, fill, len_str);
1316
1259 q[len_str] = 0; 1317 q[len_str] = 0;
1260 }
1261 1318
1262 return q; 1319 return q;
1263} 1320}
1264 1321
1265INTERFACE pointer 1322INTERFACE pointer
… …
1279 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1336 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1280 1337
1281 set_typeflag (x, T_STRING | T_ATOM); 1338 set_typeflag (x, T_STRING | T_ATOM);
1282 strvalue (x) = store_string (SCHEME_A_ len, str, 0); 1339 strvalue (x) = store_string (SCHEME_A_ len, str, 0);
1283 strlength (x) = len; 1340 strlength (x) = len;
1341
1284 return x; 1342 return x;
1285} 1343}
1286 1344
1287INTERFACE pointer 1345INTERFACE pointer
1288mk_string (SCHEME_P_ const char *str) 1346mk_string (SCHEME_P_ const char *str)
… …
1295{ 1353{
1296 return get_vector_object (SCHEME_A_ len, NIL); 1354 return get_vector_object (SCHEME_A_ len, NIL);
1297} 1355}
1298 1356
1299INTERFACE void 1357INTERFACE void
1300fill_vector (pointer vec, pointer obj) 1358fill_vector (pointer vec, uint32_t start, pointer obj)
1301{ 1359{
1302 int i; 1360 int i;
1303 1361
1304 for (i = 0; i < vec->object.vector.length; i++) 1362 for (i = start; i < veclength (vec); i++)
1305 vecvalue (vec)[i] = obj; 1363 vecvalue (vec)[i] = obj;
1306} 1364}
1307 1365
1366INTERFACE void
1367vector_resize (pointer vec, uint32_t newsize, pointer fill)
1368{
1369 uint32_t oldsize = veclength (vec);
1370 vecvalue (vec) = realloc (vecvalue (vec), newsize * sizeof (pointer));
1371 veclength (vec) = newsize;
1372 fill_vector (vec, oldsize, fill);
1373}
1374
1308INTERFACE pointer 1375INTERFACE pointer
1309vector_elem (pointer vec, uint32_t ielem) 1376vector_get (pointer vec, uint32_t ielem)
1310{ 1377{
1311 return vecvalue(vec)[ielem]; 1378 return vecvalue(vec)[ielem];
1312} 1379}
1313 1380
1314INTERFACE void 1381INTERFACE void
1315set_vector_elem (pointer vec, uint32_t ielem, pointer a) 1382vector_set (pointer vec, uint32_t ielem, pointer a)
1316{ 1383{
1317 vecvalue(vec)[ielem] = a; 1384 vecvalue(vec)[ielem] = a;
1318} 1385}
1319 1386
1320/* get new symbol */ 1387/* get new symbol */
… …
1328 x = oblist_add_by_name (SCHEME_A_ name); 1395 x = oblist_add_by_name (SCHEME_A_ name);
1329 1396
1330 return x; 1397 return x;
1331} 1398}
1332 1399
1333INTERFACE pointer 1400ecb_cold INTERFACE pointer
1334gensym (SCHEME_P) 1401gensym (SCHEME_P)
1335{ 1402{
1336 pointer x; 1403 pointer x;
1337
1338 for (; SCHEME_V->gensym_cnt < LONG_MAX; SCHEME_V->gensym_cnt++)
1339 {
1340 char name[40] = "gensym-"; 1404 char name[40] = "gensym-";
1341 xnum (name + 7, SCHEME_V->gensym_cnt); 1405 xnum (name + 7, ++SCHEME_V->gensym_cnt);
1342 1406
1343 /* first check oblist */ 1407 return generate_symbol (SCHEME_A_ name);
1344 x = oblist_find_by_name (SCHEME_A_ name); 1408}
1345 1409
1346 if (x == NIL) 1410static int
1347 { 1411is_gensym (SCHEME_P_ pointer x)
1348 x = oblist_add_by_name (SCHEME_A_ name); 1412{
1349 return x; 1413 return is_symbol (x) && oblist_find_by_name (SCHEME_A_ strvalue (x)) != x;
1350 }
1351 }
1352
1353 return NIL;
1354} 1414}
1355 1415
1356/* make symbol or number atom from string */ 1416/* make symbol or number atom from string */
1357static pointer 1417ecb_cold static pointer
1358mk_atom (SCHEME_P_ char *q) 1418mk_atom (SCHEME_P_ char *q)
1359{ 1419{
1360 char c, *p; 1420 char c, *p;
1361 int has_dec_point = 0; 1421 int has_dec_point = 0;
1362 int has_fp_exp = 0; 1422 int has_fp_exp = 0;
… …
1412 } 1472 }
1413 else if ((c == 'e') || (c == 'E')) 1473 else if ((c == 'e') || (c == 'E'))
1414 { 1474 {
1415 if (!has_fp_exp) 1475 if (!has_fp_exp)
1416 { 1476 {
1417 has_dec_point = 1; /* decimal point illegal 1477 has_dec_point = 1; /* decimal point illegal from now on */
1418 from now on */
1419 p++; 1478 p++;
1420 1479
1421 if ((*p == '-') || (*p == '+') || isdigit (*p)) 1480 if ((*p == '-') || (*p == '+') || isdigit (*p))
1422 continue; 1481 continue;
1423 } 1482 }
… …
1434 1493
1435 return mk_integer (SCHEME_A_ strtol (q, 0, 10)); 1494 return mk_integer (SCHEME_A_ strtol (q, 0, 10));
1436} 1495}
1437 1496
1438/* make constant */ 1497/* make constant */
1439static pointer 1498ecb_cold static pointer
1440mk_sharp_const (SCHEME_P_ char *name) 1499mk_sharp_const (SCHEME_P_ char *name)
1441{ 1500{
1442 if (!strcmp (name, "t")) 1501 if (!strcmp (name, "t"))
1443 return S_T; 1502 return S_T;
1444 else if (!strcmp (name, "f")) 1503 else if (!strcmp (name, "f"))
1445 return S_F; 1504 return S_F;
1446 else if (*name == '\\') /* #\w (character) */ 1505 else if (*name == '\\') /* #\w (character) */
1447 { 1506 {
1448 int c; 1507 int c;
1449 1508
1509 // TODO: optimise
1450 if (stricmp (name + 1, "space") == 0) 1510 if (stricmp (name + 1, "space") == 0)
1451 c = ' '; 1511 c = ' ';
1452 else if (stricmp (name + 1, "newline") == 0) 1512 else if (stricmp (name + 1, "newline") == 0)
1453 c = '\n'; 1513 c = '\n';
1454 else if (stricmp (name + 1, "return") == 0) 1514 else if (stricmp (name + 1, "return") == 0)
1455 c = '\r'; 1515 c = '\r';
1456 else if (stricmp (name + 1, "tab") == 0) 1516 else if (stricmp (name + 1, "tab") == 0)
1457 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;
1458 else if (name[1] == 'x' && name[2] != 0) 1528 else if (name[1] == 'x' && name[2] != 0)
1459 { 1529 {
1460 long c1 = strtol (name + 2, 0, 16); 1530 long c1 = strtol (name + 2, 0, 16);
1461 1531
1462 if (0 <= c1 && c1 <= UCHAR_MAX) 1532 if (0 <= c1 && c1 <= UCHAR_MAX)
… …
1476 return mk_character (SCHEME_A_ c); 1546 return mk_character (SCHEME_A_ c);
1477 } 1547 }
1478 else 1548 else
1479 { 1549 {
1480 /* identify base by string index */ 1550 /* identify base by string index */
1481 const char baseidx[17] = "ffbf" "ffff" "ofdf" "ffff" "x"; 1551 const char baseidx[18] = "ffbf" "ffff" "ofdf" "ffff" "x";
1482 char *base = strchr (baseidx, *name); 1552 char *base = strchr (baseidx, *name);
1483 1553
1484 if (base) 1554 if (base && *base)
1485 return mk_integer (SCHEME_A_ strtol (name + 1, 0, base - baseidx)); 1555 return mk_integer (SCHEME_A_ strtol (name + 1, 0, base - baseidx));
1486 1556
1487 return NIL; 1557 return NIL;
1488 } 1558 }
1489} 1559}
1490 1560
1491/* ========== 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}
1492 1581
1493/*-- 1582/*--
1494 * 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,
1495 * sec. 2.3.5), the Schorr-Deutsch-Waite link-inversion algorithm, 1584 * sec. 2.3.5), the Schorr-Deutsch-Waite link-inversion algorithm,
1496 * for marking. 1585 * for marking.
1497 * 1586 *
1498 * The exception is vectors - vectors are currently marked recursively, 1587 * The exception is vectors - vectors are currently marked recursively,
1499 * 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
1500 * word of context in the vector 1589 * word of context in the vector
1501 */ 1590 */
1502static void 1591ecb_hot static void
1503mark (pointer a) 1592mark (pointer a)
1504{ 1593{
1505 pointer t, q, p; 1594 pointer t, q, p;
1506 1595
1507 t = 0; 1596 t = 0;
… …
1511 1600
1512 if (ecb_expect_false (is_vector (p))) 1601 if (ecb_expect_false (is_vector (p)))
1513 { 1602 {
1514 int i; 1603 int i;
1515 1604
1516 for (i = 0; i < p->object.vector.length; i++) 1605 for (i = 0; i < veclength (p); i++)
1517 mark (vecvalue (p)[i]); 1606 mark (vecvalue (p)[i]);
1518 } 1607 }
1519 1608
1520 if (is_atom (p)) 1609 if (is_atom (p))
1521 goto E6; 1610 goto E6;
… …
1564 p = q; 1653 p = q;
1565 goto E6; 1654 goto E6;
1566 } 1655 }
1567} 1656}
1568 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
1569/* garbage collection. parameter a, b is marked. */ 1700/* garbage collection. parameter a, b is marked. */
1570static void 1701ecb_cold static void
1571gc (SCHEME_P_ pointer a, pointer b) 1702gc (SCHEME_P_ pointer a, pointer b)
1572{ 1703{
1573 pointer p;
1574 int i; 1704 int i;
1575 1705
1576 if (SCHEME_V->gc_verbose) 1706 if (SCHEME_V->gc_verbose)
1577 putstr (SCHEME_A_ "gc..."); 1707 putstr (SCHEME_A_ "gc...");
1578 1708
… …
1594 /* Mark recent objects the interpreter doesn't know about yet. */ 1724 /* Mark recent objects the interpreter doesn't know about yet. */
1595 mark (car (S_SINK)); 1725 mark (car (S_SINK));
1596 /* Mark any older stuff above nested C calls */ 1726 /* Mark any older stuff above nested C calls */
1597 mark (SCHEME_V->c_nest); 1727 mark (SCHEME_V->c_nest);
1598 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
1599 /* mark variables a, b */ 1736 /* mark variables a, b */
1600 mark (a); 1737 mark (a);
1601 mark (b); 1738 mark (b);
1602 1739
1603 /* garbage collect */ 1740 /* garbage collect */
1604 clrmark (NIL); 1741 clrmark (NIL);
1605 SCHEME_V->fcells = 0; 1742 SCHEME_V->fcells = 0;
1606 SCHEME_V->free_cell = NIL; 1743 SCHEME_V->free_cell = NIL;
1607 1744
1608 /* free-list is kept sorted by address so as to maintain consecutive
1609 ranges, if possible, for use with vectors. Here we scan the cells
1610 (which are also kept sorted by address) downwards to build the
1611 free-list in sorted order.
1612 */
1613 for (i = SCHEME_V->last_cell_seg; i >= 0; i--)
1614 {
1615 p = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i];
1616
1617 while (--p >= SCHEME_V->cell_seg[i])
1618 {
1619 if (is_mark (p))
1620 clrmark (p);
1621 else
1622 {
1623 /* reclaim cell */
1624 if (typeflag (p) != T_FREE)
1625 {
1626 finalize_cell (SCHEME_A_ p);
1627 set_typeflag (p, T_FREE);
1628 set_car (p, NIL);
1629 }
1630
1631 ++SCHEME_V->fcells;
1632 set_cdr (p, SCHEME_V->free_cell);
1633 SCHEME_V->free_cell = p;
1634 }
1635 }
1636 }
1637
1638 if (SCHEME_V->gc_verbose) 1745 if (SCHEME_V->gc_verbose)
1639 xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" cells were recovered.\n"); 1746 putstr (SCHEME_A_ "freeing...");
1640}
1641 1747
1642static void 1748 gc_free (SCHEME_A);
1643finalize_cell (SCHEME_P_ pointer a)
1644{
1645 /* TODO, fast bitmap check? */
1646 if (is_string (a))
1647 free (strvalue (a));
1648 else if (is_vector (a))
1649 free (vecvalue (a));
1650#if USE_PORTS
1651 else if (is_port (a))
1652 {
1653 if (a->object.port->kind & port_file && a->object.port->rep.stdio.closeit)
1654 port_close (SCHEME_A_ a, port_input | port_output);
1655
1656 free (a->object.port);
1657 }
1658#endif
1659} 1749}
1660 1750
1661/* ========== Routines for Reading ========== */ 1751/* ========== Routines for Reading ========== */
1662 1752
1663static int 1753ecb_cold static int
1664file_push (SCHEME_P_ const char *fname) 1754file_push (SCHEME_P_ const char *fname)
1665{ 1755{
1666#if USE_PORTS
1667 int fin; 1756 int fin;
1668 1757
1669 if (SCHEME_V->file_i == MAXFIL - 1) 1758 if (SCHEME_V->file_i == MAXFIL - 1)
1670 return 0; 1759 return 0;
1671 1760
… …
1677 SCHEME_V->load_stack[SCHEME_V->file_i].unget = -1; 1766 SCHEME_V->load_stack[SCHEME_V->file_i].unget = -1;
1678 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;
1679 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;
1680 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;
1681 SCHEME_V->nesting_stack[SCHEME_V->file_i] = 0; 1770 SCHEME_V->nesting_stack[SCHEME_V->file_i] = 0;
1682 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);
1683 1772
1684#if SHOW_ERROR_LINE 1773#if SHOW_ERROR_LINE
1685 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;
1686 1775
1687 if (fname) 1776 if (fname)
1688 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);
1689#endif 1778#endif
1690 } 1779 }
1691 1780
1692 return fin >= 0; 1781 return fin >= 0;
1693
1694#else
1695 return 1;
1696#endif
1697} 1782}
1698 1783
1699static void 1784ecb_cold static void
1700file_pop (SCHEME_P) 1785file_pop (SCHEME_P)
1701{ 1786{
1702 if (SCHEME_V->file_i != 0) 1787 if (SCHEME_V->file_i != 0)
1703 { 1788 {
1704 SCHEME_V->nesting = SCHEME_V->nesting_stack[SCHEME_V->file_i]; 1789 SCHEME_V->nesting = SCHEME_V->nesting_stack[SCHEME_V->file_i];
1705#if USE_PORTS 1790#if USE_PORTS
1706 port_close (SCHEME_A_ SCHEME_V->loadport, port_input); 1791 port_close (SCHEME_A_ SCHEME_V->loadport, port_input);
1707#endif 1792#endif
1708 SCHEME_V->file_i--; 1793 SCHEME_V->file_i--;
1709 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);
1710 } 1795 }
1711} 1796}
1712 1797
1713static int 1798ecb_cold static int
1714file_interactive (SCHEME_P) 1799file_interactive (SCHEME_P)
1715{ 1800{
1716#if USE_PORTS 1801#if USE_PORTS
1717 return SCHEME_V->file_i == 0 1802 return SCHEME_V->file_i == 0
1718 && SCHEME_V->load_stack[0].rep.stdio.file == STDIN_FILENO 1803 && SCHEME_V->load_stack[0].rep.stdio.file == STDIN_FILENO
1719 && (SCHEME_V->inport->object.port->kind & port_file); 1804 && (port (SCHEME_V->inport)->kind & port_file);
1720#else 1805#else
1721 return 0; 1806 return 0;
1722#endif 1807#endif
1723} 1808}
1724 1809
1725#if USE_PORTS 1810#if USE_PORTS
1726static port * 1811ecb_cold static port *
1727port_rep_from_filename (SCHEME_P_ const char *fn, int prop) 1812port_rep_from_filename (SCHEME_P_ const char *fn, int prop)
1728{ 1813{
1729 int fd; 1814 int fd;
1730 int flags; 1815 int flags;
1731 char *rw; 1816 char *rw;
… …
1754# endif 1839# endif
1755 1840
1756 return pt; 1841 return pt;
1757} 1842}
1758 1843
1759static pointer 1844ecb_cold static pointer
1760port_from_filename (SCHEME_P_ const char *fn, int prop) 1845port_from_filename (SCHEME_P_ const char *fn, int prop)
1761{ 1846{
1762 port *pt = port_rep_from_filename (SCHEME_A_ fn, prop); 1847 port *pt = port_rep_from_filename (SCHEME_A_ fn, prop);
1763 1848
1764 if (!pt && USE_ERROR_CHECKING) 1849 if (!pt && USE_ERROR_CHECKING)
1765 return NIL; 1850 return NIL;
1766 1851
1767 return mk_port (SCHEME_A_ pt); 1852 return mk_port (SCHEME_A_ pt);
1768} 1853}
1769 1854
1770static port * 1855ecb_cold static port *
1771port_rep_from_file (SCHEME_P_ int f, int prop) 1856port_rep_from_file (SCHEME_P_ int f, int prop)
1772{ 1857{
1773 port *pt = malloc (sizeof *pt); 1858 port *pt = malloc (sizeof *pt);
1774 1859
1775 if (!pt && USE_ERROR_CHECKING) 1860 if (!pt && USE_ERROR_CHECKING)
… …
1780 pt->rep.stdio.file = f; 1865 pt->rep.stdio.file = f;
1781 pt->rep.stdio.closeit = 0; 1866 pt->rep.stdio.closeit = 0;
1782 return pt; 1867 return pt;
1783} 1868}
1784 1869
1785static pointer 1870ecb_cold static pointer
1786port_from_file (SCHEME_P_ int f, int prop) 1871port_from_file (SCHEME_P_ int f, int prop)
1787{ 1872{
1788 port *pt = port_rep_from_file (SCHEME_A_ f, prop); 1873 port *pt = port_rep_from_file (SCHEME_A_ f, prop);
1789 1874
1790 if (!pt && USE_ERROR_CHECKING) 1875 if (!pt && USE_ERROR_CHECKING)
1791 return NIL; 1876 return NIL;
1792 1877
1793 return mk_port (SCHEME_A_ pt); 1878 return mk_port (SCHEME_A_ pt);
1794} 1879}
1795 1880
1796static port * 1881ecb_cold static port *
1797port_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)
1798{ 1883{
1799 port *pt = malloc (sizeof (port)); 1884 port *pt = malloc (sizeof (port));
1800 1885
1801 if (!pt && USE_ERROR_CHECKING) 1886 if (!pt && USE_ERROR_CHECKING)
… …
1807 pt->rep.string.curr = start; 1892 pt->rep.string.curr = start;
1808 pt->rep.string.past_the_end = past_the_end; 1893 pt->rep.string.past_the_end = past_the_end;
1809 return pt; 1894 return pt;
1810} 1895}
1811 1896
1812static pointer 1897ecb_cold static pointer
1813port_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)
1814{ 1899{
1815 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);
1816 1901
1817 if (!pt && USE_ERROR_CHECKING) 1902 if (!pt && USE_ERROR_CHECKING)
… …
1820 return mk_port (SCHEME_A_ pt); 1905 return mk_port (SCHEME_A_ pt);
1821} 1906}
1822 1907
1823# define BLOCK_SIZE 256 1908# define BLOCK_SIZE 256
1824 1909
1825static port * 1910ecb_cold static port *
1826port_rep_from_scratch (SCHEME_P) 1911port_rep_from_scratch (SCHEME_P)
1827{ 1912{
1828 char *start; 1913 char *start;
1829 port *pt = malloc (sizeof (port)); 1914 port *pt = malloc (sizeof (port));
1830 1915
… …
1844 pt->rep.string.curr = start; 1929 pt->rep.string.curr = start;
1845 pt->rep.string.past_the_end = start + BLOCK_SIZE - 1; 1930 pt->rep.string.past_the_end = start + BLOCK_SIZE - 1;
1846 return pt; 1931 return pt;
1847} 1932}
1848 1933
1849static pointer 1934ecb_cold static pointer
1850port_from_scratch (SCHEME_P) 1935port_from_scratch (SCHEME_P)
1851{ 1936{
1852 port *pt = port_rep_from_scratch (SCHEME_A); 1937 port *pt = port_rep_from_scratch (SCHEME_A);
1853 1938
1854 if (!pt && USE_ERROR_CHECKING) 1939 if (!pt && USE_ERROR_CHECKING)
1855 return NIL; 1940 return NIL;
1856 1941
1857 return mk_port (SCHEME_A_ pt); 1942 return mk_port (SCHEME_A_ pt);
1858} 1943}
1859 1944
1860static void 1945ecb_cold static void
1861port_close (SCHEME_P_ pointer p, int flag) 1946port_close (SCHEME_P_ pointer p, int flag)
1862{ 1947{
1863 port *pt = p->object.port; 1948 port *pt = port (p);
1864 1949
1865 pt->kind &= ~flag; 1950 pt->kind &= ~flag;
1866 1951
1867 if ((pt->kind & (port_input | port_output)) == 0) 1952 if ((pt->kind & (port_input | port_output)) == 0)
1868 { 1953 {
… …
1885 } 1970 }
1886} 1971}
1887#endif 1972#endif
1888 1973
1889/* get new character from input file */ 1974/* get new character from input file */
1890static int 1975ecb_cold static int
1891inchar (SCHEME_P) 1976inchar (SCHEME_P)
1892{ 1977{
1893 int c; 1978 int c;
1894 port *pt; 1979 port *pt = port (SCHEME_V->inport);
1895
1896 pt = SCHEME_V->inport->object.port;
1897 1980
1898 if (pt->kind & port_saw_EOF) 1981 if (pt->kind & port_saw_EOF)
1899 return EOF; 1982 return EOF;
1900 1983
1901 c = basic_inchar (pt); 1984 c = basic_inchar (pt);
… …
1911 } 1994 }
1912 1995
1913 return c; 1996 return c;
1914} 1997}
1915 1998
1916static int ungot = -1; 1999ecb_cold static int
1917
1918static int
1919basic_inchar (port *pt) 2000basic_inchar (port *pt)
1920{ 2001{
1921#if USE_PORTS
1922 if (pt->unget != -1) 2002 if (pt->unget != -1)
1923 { 2003 {
1924 int r = pt->unget; 2004 int r = pt->unget;
1925 pt->unget = -1; 2005 pt->unget = -1;
1926 return r; 2006 return r;
1927 } 2007 }
1928 2008
2009#if USE_PORTS
1929 if (pt->kind & port_file) 2010 if (pt->kind & port_file)
1930 { 2011 {
1931 char c; 2012 char c;
1932 2013
1933 if (!read (pt->rep.stdio.file, &c, 1)) 2014 if (!read (pt->rep.stdio.file, &c, 1))
… …
1941 return EOF; 2022 return EOF;
1942 else 2023 else
1943 return *pt->rep.string.curr++; 2024 return *pt->rep.string.curr++;
1944 } 2025 }
1945#else 2026#else
1946 if (ungot == -1)
1947 {
1948 char c; 2027 char c;
1949 if (!read (0, &c, 1)) 2028
2029 if (!read (pt->rep.stdio.file, &c, 1))
1950 return EOF; 2030 return EOF;
1951 2031
1952 ungot = c;
1953 }
1954
1955 {
1956 int r = ungot;
1957 ungot = -1;
1958 return r; 2032 return c;
1959 }
1960#endif 2033#endif
1961} 2034}
1962 2035
1963/* back character to input buffer */ 2036/* back character to input buffer */
1964static void 2037ecb_cold static void
1965backchar (SCHEME_P_ int c) 2038backchar (SCHEME_P_ int c)
1966{ 2039{
1967#if USE_PORTS 2040 port *pt = port (SCHEME_V->inport);
1968 port *pt;
1969 2041
1970 if (c == EOF) 2042 if (c == EOF)
1971 return; 2043 return;
1972 2044
1973 pt = SCHEME_V->inport->object.port;
1974 pt->unget = c; 2045 pt->unget = c;
1975#else
1976 if (c == EOF)
1977 return;
1978
1979 ungot = c;
1980#endif
1981} 2046}
1982 2047
1983#if USE_PORTS 2048#if USE_PORTS
1984static int 2049ecb_cold static int
1985realloc_port_string (SCHEME_P_ port *p) 2050realloc_port_string (SCHEME_P_ port *p)
1986{ 2051{
1987 char *start = p->rep.string.start; 2052 char *start = p->rep.string.start;
1988 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;
1989 char *str = malloc (new_size); 2054 char *str = malloc (new_size);
… …
2002 else 2067 else
2003 return 0; 2068 return 0;
2004} 2069}
2005#endif 2070#endif
2006 2071
2007INTERFACE void 2072ecb_cold static void
2008putstr (SCHEME_P_ const char *s) 2073putchars (SCHEME_P_ const char *s, int len)
2009{ 2074{
2075 port *pt = port (SCHEME_V->outport);
2076
2010#if USE_PORTS 2077#if USE_PORTS
2011 port *pt = SCHEME_V->outport->object.port;
2012
2013 if (pt->kind & port_file)
2014 write (pt->rep.stdio.file, s, strlen (s));
2015 else
2016 for (; *s; s++)
2017 if (pt->rep.string.curr != pt->rep.string.past_the_end)
2018 *pt->rep.string.curr++ = *s;
2019 else if (pt->kind & port_srfi6 && realloc_port_string (SCHEME_A_ pt))
2020 *pt->rep.string.curr++ = *s;
2021
2022#else
2023 xwrstr (s);
2024#endif
2025}
2026
2027static void
2028putchars (SCHEME_P_ const char *s, int len)
2029{
2030#if USE_PORTS
2031 port *pt = SCHEME_V->outport->object.port;
2032
2033 if (pt->kind & port_file) 2078 if (pt->kind & port_file)
2034 write (pt->rep.stdio.file, s, len); 2079 write (pt->rep.stdio.file, s, len);
2035 else 2080 else
2036 { 2081 {
2037 for (; len; len--) 2082 for (; len; len--)
… …
2042 *pt->rep.string.curr++ = *s++; 2087 *pt->rep.string.curr++ = *s++;
2043 } 2088 }
2044 } 2089 }
2045 2090
2046#else 2091#else
2047 write (1, s, len); 2092 write (1, s, len); // output not initialised
2048#endif 2093#endif
2094}
2095
2096INTERFACE void
2097putstr (SCHEME_P_ const char *s)
2098{
2099 putchars (SCHEME_A_ s, strlen (s));
2049} 2100}
2050 2101
2051INTERFACE void 2102INTERFACE void
2052putcharacter (SCHEME_P_ int c) 2103putcharacter (SCHEME_P_ int c)
2053{ 2104{
2054#if USE_PORTS
2055 port *pt = SCHEME_V->outport->object.port;
2056
2057 if (pt->kind & port_file)
2058 {
2059 char cc = c;
2060 write (pt->rep.stdio.file, &cc, 1);
2061 }
2062 else
2063 {
2064 if (pt->rep.string.curr != pt->rep.string.past_the_end)
2065 *pt->rep.string.curr++ = c;
2066 else if (pt->kind & port_srfi6 && realloc_port_string (SCHEME_A_ pt))
2067 *pt->rep.string.curr++ = c;
2068 }
2069
2070#else
2071 char cc = c; 2105 char cc = c;
2072 write (1, &c, 1); 2106
2073#endif 2107 putchars (SCHEME_A_ &cc, 1);
2074} 2108}
2075 2109
2076/* read characters up to delimiter, but cater to character constants */ 2110/* read characters up to delimiter, but cater to character constants */
2077static char * 2111ecb_cold static char *
2078readstr_upto (SCHEME_P_ char *delim) 2112readstr_upto (SCHEME_P_ int skip, const char *delim)
2079{ 2113{
2080 char *p = SCHEME_V->strbuff; 2114 char *p = SCHEME_V->strbuff + skip;
2081 2115
2082 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))));
2083 2117
2084 if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\') 2118 if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\')
2085 *p = 0; 2119 *p = 0;
… …
2091 2125
2092 return SCHEME_V->strbuff; 2126 return SCHEME_V->strbuff;
2093} 2127}
2094 2128
2095/* read string expression "xxx...xxx" */ 2129/* read string expression "xxx...xxx" */
2096static pointer 2130ecb_cold static pointer
2097readstrexp (SCHEME_P) 2131readstrexp (SCHEME_P_ char delim)
2098{ 2132{
2099 char *p = SCHEME_V->strbuff; 2133 char *p = SCHEME_V->strbuff;
2100 int c; 2134 int c;
2101 int c1 = 0; 2135 int c1 = 0;
2102 enum
2103 { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok; 2136 enum { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok;
2104 2137
2105 for (;;) 2138 for (;;)
2106 { 2139 {
2107 c = inchar (SCHEME_A); 2140 c = inchar (SCHEME_A);
2108 2141
… …
2110 return S_F; 2143 return S_F;
2111 2144
2112 switch (state) 2145 switch (state)
2113 { 2146 {
2114 case st_ok: 2147 case st_ok:
2115 switch (c) 2148 if (ecb_expect_false (c == delim))
2116 {
2117 case '\\':
2118 state = st_bsl;
2119 break;
2120
2121 case '"':
2122 *p = 0;
2123 return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff); 2149 return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff);
2124 2150
2125 default: 2151 if (ecb_expect_false (c == '\\'))
2152 state = st_bsl;
2153 else
2126 *p++ = c; 2154 *p++ = c;
2127 break;
2128 }
2129 2155
2130 break; 2156 break;
2131 2157
2132 case st_bsl: 2158 case st_bsl:
2133 switch (c) 2159 switch (c)
… …
2142 case '7': 2168 case '7':
2143 state = st_oct1; 2169 state = st_oct1;
2144 c1 = c - '0'; 2170 c1 = c - '0';
2145 break; 2171 break;
2146 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
2147 case 'x': 2188 case 'x':
2148 case 'X': 2189 case 'X':
2149 state = st_x1; 2190 state = st_x1;
2150 c1 = 0; 2191 c1 = 0;
2151 break; 2192 break;
2152 2193
2153 case 'n':
2154 *p++ = '\n';
2155 state = st_ok;
2156 break;
2157
2158 case 't':
2159 *p++ = '\t';
2160 state = st_ok;
2161 break;
2162
2163 case 'r':
2164 *p++ = '\r';
2165 state = st_ok;
2166 break;
2167
2168 case '"':
2169 *p++ = '"';
2170 state = st_ok;
2171 break;
2172
2173 default: 2194 default:
2174 *p++ = c; 2195 *p++ = c;
2175 state = st_ok; 2196 state = st_ok;
2176 break; 2197 break;
2177 } 2198 }
2178 2199
2179 break; 2200 break;
2180 2201
2181 case st_x1: 2202 case st_x1:
2182 case st_x2: 2203 case st_x2:
2183 c = toupper (c); 2204 c = tolower (c);
2184 2205
2185 if (c >= '0' && c <= 'F') 2206 if (c >= '0' && c <= '9')
2186 {
2187 if (c <= '9')
2188 c1 = (c1 << 4) + c - '0'; 2207 c1 = (c1 << 4) + c - '0';
2189 else 2208 else if (c >= 'a' && c <= 'f')
2190 c1 = (c1 << 4) + c - 'A' + 10; 2209 c1 = (c1 << 4) + c - 'a' + 10;
2191
2192 if (state == st_x1)
2193 state = st_x2;
2194 else
2195 {
2196 *p++ = c1;
2197 state = st_ok;
2198 }
2199 }
2200 else 2210 else
2201 return S_F; 2211 return S_F;
2212
2213 if (state == st_x1)
2214 state = st_x2;
2215 else
2216 {
2217 *p++ = c1;
2218 state = st_ok;
2219 }
2202 2220
2203 break; 2221 break;
2204 2222
2205 case st_oct1: 2223 case st_oct1:
2206 case st_oct2: 2224 case st_oct2:
… …
2210 backchar (SCHEME_A_ c); 2228 backchar (SCHEME_A_ c);
2211 state = st_ok; 2229 state = st_ok;
2212 } 2230 }
2213 else 2231 else
2214 { 2232 {
2215 if (state == st_oct2 && c1 >= 32) 2233 if (state == st_oct2 && c1 >= ' ')
2216 return S_F; 2234 return S_F;
2217 2235
2218 c1 = (c1 << 3) + (c - '0'); 2236 c1 = (c1 << 3) + (c - '0');
2219 2237
2220 if (state == st_oct1) 2238 if (state == st_oct1)
… …
2225 state = st_ok; 2243 state = st_ok;
2226 } 2244 }
2227 } 2245 }
2228 2246
2229 break; 2247 break;
2230
2231 } 2248 }
2232 } 2249 }
2233} 2250}
2234 2251
2235/* check c is in chars */ 2252/* check c is in chars */
2236static INLINE int 2253ecb_cold int
2237is_one_of (char *s, int c) 2254is_one_of (const char *s, int c)
2238{ 2255{
2239 if (c == EOF)
2240 return 1;
2241
2242 return !!strchr (s, c); 2256 return c == EOF || !!strchr (s, c);
2243} 2257}
2244 2258
2245/* skip white characters */ 2259/* skip white characters */
2246static INLINE int 2260ecb_cold int
2247skipspace (SCHEME_P) 2261skipspace (SCHEME_P)
2248{ 2262{
2249 int c, curr_line = 0; 2263 int c, curr_line = 0;
2250 2264
2251 do 2265 do
2252 { 2266 {
2253 c = inchar (SCHEME_A); 2267 c = inchar (SCHEME_A);
2268
2254#if SHOW_ERROR_LINE 2269#if SHOW_ERROR_LINE
2255 if (c == '\n') 2270 if (ecb_expect_false (c == '\n'))
2256 curr_line++; 2271 curr_line++;
2257#endif 2272#endif
2273
2274 if (ecb_expect_false (c == EOF))
2275 return c;
2258 } 2276 }
2259 while (c == ' ' || c == '\n' || c == '\r' || c == '\t'); 2277 while (is_one_of (WHITESPACE, c));
2260 2278
2261 /* record it */ 2279 /* record it */
2262#if SHOW_ERROR_LINE 2280#if SHOW_ERROR_LINE
2263 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)
2264 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;
2265#endif 2283#endif
2266 2284
2267 if (c != EOF)
2268 {
2269 backchar (SCHEME_A_ c); 2285 backchar (SCHEME_A_ c);
2270 return 1; 2286 return 1;
2271 }
2272 else
2273 return EOF;
2274} 2287}
2275 2288
2276/* get token */ 2289/* get token */
2277static int 2290ecb_cold static int
2278token (SCHEME_P) 2291token (SCHEME_P)
2279{ 2292{
2280 int c = skipspace (SCHEME_A); 2293 int c = skipspace (SCHEME_A);
2281 2294
2282 if (c == EOF) 2295 if (c == EOF)
… …
2294 return TOK_RPAREN; 2307 return TOK_RPAREN;
2295 2308
2296 case '.': 2309 case '.':
2297 c = inchar (SCHEME_A); 2310 c = inchar (SCHEME_A);
2298 2311
2299 if (is_one_of (" \n\t", c)) 2312 if (is_one_of (WHITESPACE, c))
2300 return TOK_DOT; 2313 return TOK_DOT;
2301 else 2314 else
2302 { 2315 {
2303 //TODO: ungetc twice in a row is not supported in C
2304 backchar (SCHEME_A_ c); 2316 backchar (SCHEME_A_ c);
2305 backchar (SCHEME_A_ '.');
2306 return TOK_ATOM; 2317 return TOK_DOTATOM;
2307 } 2318 }
2319
2320 case '|':
2321 return TOK_STRATOM;
2308 2322
2309 case '\'': 2323 case '\'':
2310 return TOK_QUOTE; 2324 return TOK_QUOTE;
2311 2325
2312 case ';': 2326 case ';':
… …
2379} 2393}
2380 2394
2381/* ========== Routines for Printing ========== */ 2395/* ========== Routines for Printing ========== */
2382#define ok_abbrev(x) (is_pair(x) && cdr(x) == NIL) 2396#define ok_abbrev(x) (is_pair(x) && cdr(x) == NIL)
2383 2397
2384static void 2398ecb_cold static void
2385printslashstring (SCHEME_P_ char *p, int len) 2399printslashstring (SCHEME_P_ char *p, int len)
2386{ 2400{
2387 int i; 2401 int i;
2388 unsigned char *s = (unsigned char *) p; 2402 unsigned char *s = (unsigned char *) p;
2389 2403
… …
2444 } 2458 }
2445 2459
2446 putcharacter (SCHEME_A_ '"'); 2460 putcharacter (SCHEME_A_ '"');
2447} 2461}
2448 2462
2449
2450/* print atoms */ 2463/* print atoms */
2451static void 2464ecb_cold static void
2452printatom (SCHEME_P_ pointer l, int f) 2465printatom (SCHEME_P_ pointer l, int f)
2453{ 2466{
2454 char *p; 2467 char *p;
2455 int len; 2468 int len;
2456 2469
2457 atom2str (SCHEME_A_ l, f, &p, &len); 2470 atom2str (SCHEME_A_ l, f, &p, &len);
2458 putchars (SCHEME_A_ p, len); 2471 putchars (SCHEME_A_ p, len);
2459} 2472}
2460 2473
2461
2462/* Uses internal buffer unless string pointer is already available */ 2474/* Uses internal buffer unless string pointer is already available */
2463static void 2475ecb_cold static void
2464atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen) 2476atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen)
2465{ 2477{
2466 char *p; 2478 char *p;
2467 2479
2468 if (l == NIL) 2480 if (l == NIL)
… …
2479 { 2491 {
2480 p = SCHEME_V->strbuff; 2492 p = SCHEME_V->strbuff;
2481 2493
2482 if (f <= 1 || f == 10) /* f is the base for numbers if > 1 */ 2494 if (f <= 1 || f == 10) /* f is the base for numbers if > 1 */
2483 { 2495 {
2484 if (num_is_integer (l)) 2496 if (is_integer (l))
2485 xnum (p, ivalue_unchecked (l)); 2497 xnum (p, ivalue_unchecked (l));
2486#if USE_REAL 2498#if USE_REAL
2487 else 2499 else
2488 { 2500 {
2489 snprintf (p, STRBUFFSIZE, "%.10g", rvalue_unchecked (l)); 2501 snprintf (p, STRBUFFSIZE, "%.10g", rvalue_unchecked (l));
… …
2601 } 2613 }
2602 else if (is_symbol (l)) 2614 else if (is_symbol (l))
2603 p = symname (l); 2615 p = symname (l);
2604 else if (is_proc (l)) 2616 else if (is_proc (l))
2605 { 2617 {
2618 p = (char *)procname (l); // ok with r7rs display, but not r7rs write
2619#if 0
2606#if USE_PRINTF 2620#if USE_PRINTF
2607 p = SCHEME_V->strbuff; 2621 p = SCHEME_V->strbuff;
2608 snprintf (p, STRBUFFSIZE, "#<%s PROCEDURE %ld>", procname (l), procnum (l)); 2622 snprintf (p, STRBUFFSIZE, " PROCEDURE %ld>", procname (l), procnum (l));
2609#else 2623#else
2610 p = "#<PROCEDURE>"; 2624 p = "#<PROCEDURE>";
2625#endif
2611#endif 2626#endif
2612 } 2627 }
2613 else if (is_macro (l)) 2628 else if (is_macro (l))
2614 p = "#<MACRO>"; 2629 p = "#<MACRO>";
2615 else if (is_closure (l)) 2630 else if (is_closure (l))
… …
2626#endif 2641#endif
2627 } 2642 }
2628 else if (is_continuation (l)) 2643 else if (is_continuation (l))
2629 p = "#<CONTINUATION>"; 2644 p = "#<CONTINUATION>";
2630 else 2645 else
2646 {
2647#if USE_PRINTF
2648 p = SCHEME_V->strbuff;
2649 snprintf (p, STRBUFFSIZE, "#<ERROR %x>", (int)typeflag (l));
2650#else
2631 p = "#<ERROR>"; 2651 p = "#<ERROR>";
2652#endif
2653 }
2632 2654
2633 *pp = p; 2655 *pp = p;
2634 *plen = strlen (p); 2656 *plen = strlen (p);
2635} 2657}
2636 2658
… …
2668 return car (d); 2690 return car (d);
2669 2691
2670 p = cons (car (d), cdr (d)); 2692 p = cons (car (d), cdr (d));
2671 q = p; 2693 q = p;
2672 2694
2673 while (cdr (cdr (p)) != NIL) 2695 while (cddr (p) != NIL)
2674 { 2696 {
2675 d = cons (car (p), cdr (p)); 2697 d = cons (car (p), cdr (p));
2676 2698
2677 if (cdr (cdr (p)) != NIL) 2699 if (cddr (p) != NIL)
2678 p = cdr (d); 2700 p = cdr (d);
2679 } 2701 }
2680 2702
2681 set_cdr (p, car (cdr (p))); 2703 set_cdr (p, cadr (p));
2682 return q; 2704 return q;
2683} 2705}
2684 2706
2685/* reverse list -- produce new list */ 2707/* reverse list -- produce new list */
2686static pointer 2708ecb_hot static pointer
2687reverse (SCHEME_P_ pointer a) 2709reverse (SCHEME_P_ pointer a)
2688{ 2710{
2689 /* a must be checked by gc */ 2711 /* a must be checked by gc */
2690 pointer p = NIL; 2712 pointer p = NIL;
2691 2713
… …
2694 2716
2695 return p; 2717 return p;
2696} 2718}
2697 2719
2698/* reverse list --- in-place */ 2720/* reverse list --- in-place */
2699static pointer 2721ecb_hot static pointer
2700reverse_in_place (SCHEME_P_ pointer term, pointer list) 2722reverse_in_place (SCHEME_P_ pointer term, pointer list)
2701{ 2723{
2702 pointer result = term; 2724 pointer result = term;
2703 pointer p = list; 2725 pointer p = list;
2704 2726
… …
2712 2734
2713 return result; 2735 return result;
2714} 2736}
2715 2737
2716/* append list -- produce new list (in reverse order) */ 2738/* append list -- produce new list (in reverse order) */
2717static pointer 2739ecb_hot static pointer
2718revappend (SCHEME_P_ pointer a, pointer b) 2740revappend (SCHEME_P_ pointer a, pointer b)
2719{ 2741{
2720 pointer result = a; 2742 pointer result = a;
2721 pointer p = b; 2743 pointer p = b;
2722 2744
… …
2731 2753
2732 return S_F; /* signal an error */ 2754 return S_F; /* signal an error */
2733} 2755}
2734 2756
2735/* equivalence of atoms */ 2757/* equivalence of atoms */
2736int 2758ecb_hot int
2737eqv (pointer a, pointer b) 2759eqv (pointer a, pointer b)
2738{ 2760{
2739 if (is_string (a)) 2761 if (is_string (a))
2740 { 2762 {
2741 if (is_string (b)) 2763 if (is_string (b))
… …
2744 return 0; 2766 return 0;
2745 } 2767 }
2746 else if (is_number (a)) 2768 else if (is_number (a))
2747 { 2769 {
2748 if (is_number (b)) 2770 if (is_number (b))
2749 if (num_is_integer (a) == num_is_integer (b))
2750 return num_cmp (nvalue (a), nvalue (b)) == 0; 2771 return num_cmp (nvalue (a), nvalue (b)) == 0;
2751 2772
2752 return 0; 2773 return 0;
2753 } 2774 }
2754 else if (is_character (a)) 2775 else if (is_character (a))
2755 { 2776 {
… …
2781/* () is #t in R5RS */ 2802/* () is #t in R5RS */
2782#define is_true(p) ((p) != S_F) 2803#define is_true(p) ((p) != S_F)
2783#define is_false(p) ((p) == S_F) 2804#define is_false(p) ((p) == S_F)
2784 2805
2785/* ========== Environment implementation ========== */ 2806/* ========== Environment implementation ========== */
2786
2787#if !defined(USE_ALIST_ENV) || !defined(USE_OBJECT_LIST)
2788
2789static int
2790hash_fn (const char *key, int table_size)
2791{
2792 const unsigned char *p = key;
2793 uint32_t hash = 2166136261;
2794
2795 while (*p)
2796 hash = (hash ^ *p++) * 16777619;
2797
2798 return hash % table_size;
2799}
2800#endif
2801 2807
2802#ifndef USE_ALIST_ENV 2808#ifndef USE_ALIST_ENV
2803 2809
2804/* 2810/*
2805 * In this implementation, each frame of the environment may be 2811 * In this implementation, each frame of the environment may be
… …
2814{ 2820{
2815 pointer new_frame; 2821 pointer new_frame;
2816 2822
2817 /* The interaction-environment has about 300 variables in it. */ 2823 /* The interaction-environment has about 300 variables in it. */
2818 if (old_env == NIL) 2824 if (old_env == NIL)
2819 new_frame = mk_vector (SCHEME_A_ 461); 2825 new_frame = mk_vector (SCHEME_A_ 29); // was 461
2820 else 2826 else
2821 new_frame = NIL; 2827 new_frame = NIL;
2822 2828
2823 SCHEME_V->envir = immutable_cons (new_frame, old_env); 2829 SCHEME_V->envir = immutable_cons (new_frame, old_env);
2824 setenvironment (SCHEME_V->envir); 2830 setenvironment (SCHEME_V->envir);
2825} 2831}
2826 2832
2827static INLINE void 2833static uint32_t
2834sym_hash (pointer sym, uint32_t size)
2835{
2836 uintptr_t ptr = (uintptr_t)sym;
2837
2838#if 0
2839 /* table size is prime, so why mix */
2840 ptr += ptr >> 32;
2841 ptr += ptr >> 16;
2842 ptr += ptr >> 8;
2843#endif
2844
2845 return ptr % size;
2846}
2847
2848ecb_inline void
2828new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) 2849new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
2829{ 2850{
2830 pointer slot = immutable_cons (variable, value); 2851 pointer slot = immutable_cons (variable, value);
2831 2852
2832 if (is_vector (car (env))) 2853 if (is_vector (car (env)))
2833 { 2854 {
2834 int location = hash_fn (symname (variable), veclength (car (env))); 2855 int location = sym_hash (variable, veclength (car (env)));
2835
2836 set_vector_elem (car (env), location, immutable_cons (slot, vector_elem (car (env), location))); 2856 vector_set (car (env), location, immutable_cons (slot, vector_get (car (env), location)));
2837 } 2857 }
2838 else 2858 else
2839 set_car (env, immutable_cons (slot, car (env))); 2859 set_car (env, immutable_cons (slot, car (env)));
2840} 2860}
2841 2861
2842static pointer 2862ecb_hot static pointer
2843find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all) 2863find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all)
2844{ 2864{
2845 pointer x, y; 2865 pointer x, y;
2846 int location;
2847 2866
2848 for (x = env; x != NIL; x = cdr (x)) 2867 for (x = env; x != NIL; x = cdr (x))
2849 { 2868 {
2850 if (is_vector (car (x))) 2869 if (is_vector (car (x)))
2851 { 2870 {
2852 location = hash_fn (symname (hdl), veclength (car (x))); 2871 int location = sym_hash (hdl, veclength (car (x)));
2853 y = vector_elem (car (x), location); 2872 y = vector_get (car (x), location);
2854 } 2873 }
2855 else 2874 else
2856 y = car (x); 2875 y = car (x);
2857 2876
2858 for (; y != NIL; y = cdr (y)) 2877 for (; y != NIL; y = cdr (y))
2859 if (caar (y) == hdl) 2878 if (caar (y) == hdl)
2860 break; 2879 break;
2861 2880
2862 if (y != NIL) 2881 if (y != NIL)
2882 return car (y);
2883
2884 if (!all)
2863 break; 2885 break;
2864
2865 if (!all)
2866 return NIL;
2867 } 2886 }
2868
2869 if (x != NIL)
2870 return car (y);
2871 2887
2872 return NIL; 2888 return NIL;
2873} 2889}
2874 2890
2875#else /* USE_ALIST_ENV */ 2891#else /* USE_ALIST_ENV */
2876 2892
2877static INLINE void 2893static void
2878new_frame_in_env (SCHEME_P_ pointer old_env) 2894new_frame_in_env (SCHEME_P_ pointer old_env)
2879{ 2895{
2880 SCHEME_V->envir = immutable_cons (NIL, old_env); 2896 SCHEME_V->envir = immutable_cons (NIL, old_env);
2881 setenvironment (SCHEME_V->envir); 2897 setenvironment (SCHEME_V->envir);
2882} 2898}
2883 2899
2884static INLINE void 2900static void
2885new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) 2901new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
2886{ 2902{
2887 set_car (env, immutable_cons (immutable_cons (variable, value), car (env))); 2903 set_car (env, immutable_cons (immutable_cons (variable, value), car (env)));
2888} 2904}
2889 2905
2890static pointer 2906ecb_hot static pointer
2891find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all) 2907find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all)
2892{ 2908{
2893 pointer x, y; 2909 pointer x, y;
2894 2910
2895 for (x = env; x != NIL; x = cdr (x)) 2911 for (x = env; x != NIL; x = cdr (x))
… …
2897 for (y = car (x); y != NIL; y = cdr (y)) 2913 for (y = car (x); y != NIL; y = cdr (y))
2898 if (caar (y) == hdl) 2914 if (caar (y) == hdl)
2899 break; 2915 break;
2900 2916
2901 if (y != NIL) 2917 if (y != NIL)
2918 return car (y);
2902 break; 2919 break;
2903 2920
2904 if (!all) 2921 if (!all)
2905 return NIL; 2922 break;
2906 } 2923 }
2907
2908 if (x != NIL)
2909 return car (y);
2910 2924
2911 return NIL; 2925 return NIL;
2912} 2926}
2913 2927
2914#endif /* USE_ALIST_ENV else */ 2928#endif /* USE_ALIST_ENV else */
2915 2929
2916static INLINE void 2930static void
2917new_slot_in_env (SCHEME_P_ pointer variable, pointer value) 2931new_slot_in_env (SCHEME_P_ pointer variable, pointer value)
2918{ 2932{
2933 assert (is_symbol (variable));//TODO: bug in current-ws/OP_LET2
2919 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value); 2934 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value);
2920} 2935}
2921 2936
2922static INLINE void 2937static void
2923set_slot_in_env (SCHEME_P_ pointer slot, pointer value) 2938set_slot_in_env (SCHEME_P_ pointer slot, pointer value)
2924{ 2939{
2925 set_cdr (slot, value); 2940 set_cdr (slot, value);
2926} 2941}
2927 2942
2928static INLINE pointer 2943static pointer
2929slot_value_in_env (pointer slot) 2944slot_value_in_env (pointer slot)
2930{ 2945{
2931 return cdr (slot); 2946 return cdr (slot);
2932} 2947}
2933 2948
2934/* ========== Evaluation Cycle ========== */ 2949/* ========== Evaluation Cycle ========== */
2935 2950
2936static pointer 2951ecb_cold static int
2937xError_1 (SCHEME_P_ const char *s, pointer a) 2952xError_1 (SCHEME_P_ const char *s, pointer a)
2938{ 2953{
2939#if USE_ERROR_HOOK
2940 pointer x;
2941 pointer hdl = SCHEME_V->ERROR_HOOK;
2942#endif
2943
2944#if USE_PRINTF 2954#if USE_PRINTF
2945#if SHOW_ERROR_LINE 2955#if SHOW_ERROR_LINE
2946 char sbuf[STRBUFFSIZE]; 2956 char sbuf[STRBUFFSIZE];
2947 2957
2948 /* make sure error is not in REPL */ 2958 /* make sure error is not in REPL */
… …
2963 } 2973 }
2964#endif 2974#endif
2965#endif 2975#endif
2966 2976
2967#if USE_ERROR_HOOK 2977#if USE_ERROR_HOOK
2968 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, hdl, 1); 2978 pointer x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->ERROR_HOOK, 1);
2969 2979
2970 if (x != NIL) 2980 if (x != NIL)
2971 { 2981 {
2972 pointer code = a 2982 pointer code = a
2973 ? cons (cons (SCHEME_V->QUOTE, cons (a, NIL)), NIL) 2983 ? cons (cons (SCHEME_V->QUOTE, cons (a, NIL)), NIL)
… …
2976 code = cons (mk_string (SCHEME_A_ s), code); 2986 code = cons (mk_string (SCHEME_A_ s), code);
2977 setimmutable (car (code)); 2987 setimmutable (car (code));
2978 SCHEME_V->code = cons (slot_value_in_env (x), code); 2988 SCHEME_V->code = cons (slot_value_in_env (x), code);
2979 SCHEME_V->op = OP_EVAL; 2989 SCHEME_V->op = OP_EVAL;
2980 2990
2981 return S_T; 2991 return 0;
2982 } 2992 }
2983#endif 2993#endif
2984 2994
2985 if (a) 2995 if (a)
2986 SCHEME_V->args = cons (a, NIL); 2996 SCHEME_V->args = cons (a, NIL);
… …
2988 SCHEME_V->args = NIL; 2998 SCHEME_V->args = NIL;
2989 2999
2990 SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args); 3000 SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args);
2991 setimmutable (car (SCHEME_V->args)); 3001 setimmutable (car (SCHEME_V->args));
2992 SCHEME_V->op = OP_ERR0; 3002 SCHEME_V->op = OP_ERR0;
3003
2993 return S_T; 3004 return 0;
2994} 3005}
2995 3006
2996#define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a) 3007#define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a)
2997#define Error_0(s) Error_1 (s, 0) 3008#define Error_0(s) Error_1 (s, 0)
2998 3009
2999/* Too small to turn into function */ 3010/* Too small to turn into function */
3000#define BEGIN do { 3011#define BEGIN do {
3001#define END } while (0) 3012#define END } while (0)
3002#define s_goto(a) BEGIN \ 3013#define s_goto(a) BEGIN \
3003 SCHEME_V->op = a; \ 3014 SCHEME_V->op = a; \
3004 return S_T; END 3015 return 0; END
3005 3016
3006#define s_return(a) return xs_return (SCHEME_A_ a) 3017#define s_return(a) return xs_return (SCHEME_A_ a)
3007 3018
3008#ifndef USE_SCHEME_STACK 3019#ifndef USE_SCHEME_STACK
3009 3020
… …
3016 pointer code; 3027 pointer code;
3017}; 3028};
3018 3029
3019# define STACK_GROWTH 3 3030# define STACK_GROWTH 3
3020 3031
3021static void 3032ecb_hot static void
3022s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code) 3033s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code)
3023{ 3034{
3024 int nframes = (uintptr_t)SCHEME_V->dump; 3035 int nframes = (uintptr_t)SCHEME_V->dump;
3025 struct dump_stack_frame *next_frame; 3036 struct dump_stack_frame *next_frame;
3026 3037
3027 /* enough room for the next frame? */ 3038 /* enough room for the next frame? */
3028 if (nframes >= SCHEME_V->dump_size) 3039 if (ecb_expect_false (nframes >= SCHEME_V->dump_size))
3029 { 3040 {
3030 SCHEME_V->dump_size += STACK_GROWTH; 3041 SCHEME_V->dump_size += STACK_GROWTH;
3031 SCHEME_V->dump_base = realloc (SCHEME_V->dump_base, sizeof (struct dump_stack_frame) * SCHEME_V->dump_size); 3042 SCHEME_V->dump_base = realloc (SCHEME_V->dump_base, sizeof (struct dump_stack_frame) * SCHEME_V->dump_size);
3032 } 3043 }
3033 3044
… …
3039 next_frame->code = code; 3050 next_frame->code = code;
3040 3051
3041 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1); 3052 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1);
3042} 3053}
3043 3054
3044static pointer 3055static ecb_hot int
3045xs_return (SCHEME_P_ pointer a) 3056xs_return (SCHEME_P_ pointer a)
3046{ 3057{
3047 int nframes = (uintptr_t)SCHEME_V->dump; 3058 int nframes = (uintptr_t)SCHEME_V->dump;
3048 struct dump_stack_frame *frame; 3059 struct dump_stack_frame *frame;
3049 3060
3050 SCHEME_V->value = a; 3061 SCHEME_V->value = a;
3051 3062
3052 if (nframes <= 0) 3063 if (nframes <= 0)
3053 return NIL; 3064 return -1;
3054 3065
3055 frame = &SCHEME_V->dump_base[--nframes]; 3066 frame = &SCHEME_V->dump_base[--nframes];
3056 SCHEME_V->op = frame->op; 3067 SCHEME_V->op = frame->op;
3057 SCHEME_V->args = frame->args; 3068 SCHEME_V->args = frame->args;
3058 SCHEME_V->envir = frame->envir; 3069 SCHEME_V->envir = frame->envir;
3059 SCHEME_V->code = frame->code; 3070 SCHEME_V->code = frame->code;
3060 SCHEME_V->dump = (pointer)(uintptr_t)nframes; 3071 SCHEME_V->dump = (pointer)(uintptr_t)nframes;
3061 3072
3062 return S_T; 3073 return 0;
3063} 3074}
3064 3075
3065static INLINE void 3076ecb_cold void
3066dump_stack_reset (SCHEME_P) 3077dump_stack_reset (SCHEME_P)
3067{ 3078{
3068 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */ 3079 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */
3069 SCHEME_V->dump = (pointer)+0; 3080 SCHEME_V->dump = (pointer)+0;
3070} 3081}
3071 3082
3072static INLINE void 3083ecb_cold void
3073dump_stack_initialize (SCHEME_P) 3084dump_stack_initialize (SCHEME_P)
3074{ 3085{
3075 SCHEME_V->dump_size = 0; 3086 SCHEME_V->dump_size = 0;
3076 SCHEME_V->dump_base = 0; 3087 SCHEME_V->dump_base = 0;
3077 dump_stack_reset (SCHEME_A); 3088 dump_stack_reset (SCHEME_A);
3078} 3089}
3079 3090
3080static void 3091ecb_cold static void
3081dump_stack_free (SCHEME_P) 3092dump_stack_free (SCHEME_P)
3082{ 3093{
3083 free (SCHEME_V->dump_base); 3094 free (SCHEME_V->dump_base);
3084 SCHEME_V->dump_base = 0; 3095 SCHEME_V->dump_base = 0;
3085 SCHEME_V->dump = (pointer)0; 3096 SCHEME_V->dump = (pointer)0;
3086 SCHEME_V->dump_size = 0; 3097 SCHEME_V->dump_size = 0;
3087} 3098}
3088 3099
3089static void 3100ecb_cold static void
3090dump_stack_mark (SCHEME_P) 3101dump_stack_mark (SCHEME_P)
3091{ 3102{
3092 int nframes = (uintptr_t)SCHEME_V->dump; 3103 int nframes = (uintptr_t)SCHEME_V->dump;
3093 int i; 3104 int i;
3094 3105
… …
3100 mark (frame->envir); 3111 mark (frame->envir);
3101 mark (frame->code); 3112 mark (frame->code);
3102 } 3113 }
3103} 3114}
3104 3115
3105static pointer 3116ecb_cold static pointer
3106ss_get_cont (SCHEME_P) 3117ss_get_cont (SCHEME_P)
3107{ 3118{
3108 int nframes = (uintptr_t)SCHEME_V->dump; 3119 int nframes = (uintptr_t)SCHEME_V->dump;
3109 int i; 3120 int i;
3110 3121
… …
3122 } 3133 }
3123 3134
3124 return cont; 3135 return cont;
3125} 3136}
3126 3137
3127static void 3138ecb_cold static void
3128ss_set_cont (SCHEME_P_ pointer cont) 3139ss_set_cont (SCHEME_P_ pointer cont)
3129{ 3140{
3130 int i = 0; 3141 int i = 0;
3131 struct dump_stack_frame *frame = SCHEME_V->dump_base; 3142 struct dump_stack_frame *frame = SCHEME_V->dump_base;
3132 3143
3133 while (cont != NIL) 3144 while (cont != NIL)
3134 { 3145 {
3135 frame->op = ivalue (car (cont)); cont = cdr (cont); 3146 frame->op = ivalue_unchecked (car (cont)); cont = cdr (cont);
3136 frame->args = car (cont) ; cont = cdr (cont); 3147 frame->args = car (cont) ; cont = cdr (cont);
3137 frame->envir = car (cont) ; cont = cdr (cont); 3148 frame->envir = car (cont) ; cont = cdr (cont);
3138 frame->code = car (cont) ; cont = cdr (cont); 3149 frame->code = car (cont) ; cont = cdr (cont);
3139 3150
3140 ++frame; 3151 ++frame;
3141 ++i; 3152 ++i;
3142 } 3153 }
3143 3154
3144 SCHEME_V->dump = (pointer)(uintptr_t)i; 3155 SCHEME_V->dump = (pointer)(uintptr_t)i;
3145} 3156}
3146 3157
3147#else 3158#else
3148 3159
3149static INLINE void 3160ecb_cold void
3150dump_stack_reset (SCHEME_P) 3161dump_stack_reset (SCHEME_P)
3151{ 3162{
3152 SCHEME_V->dump = NIL; 3163 SCHEME_V->dump = NIL;
3153} 3164}
3154 3165
3155static INLINE void 3166ecb_cold void
3156dump_stack_initialize (SCHEME_P) 3167dump_stack_initialize (SCHEME_P)
3157{ 3168{
3158 dump_stack_reset (SCHEME_A); 3169 dump_stack_reset (SCHEME_A);
3159} 3170}
3160 3171
3161static void 3172ecb_cold static void
3162dump_stack_free (SCHEME_P) 3173dump_stack_free (SCHEME_P)
3163{ 3174{
3164 SCHEME_V->dump = NIL; 3175 SCHEME_V->dump = NIL;
3165} 3176}
3166 3177
3167static pointer 3178ecb_hot static int
3168xs_return (SCHEME_P_ pointer a) 3179xs_return (SCHEME_P_ pointer a)
3169{ 3180{
3170 pointer dump = SCHEME_V->dump; 3181 pointer dump = SCHEME_V->dump;
3171 3182
3172 SCHEME_V->value = a; 3183 SCHEME_V->value = a;
3173 3184
3174 if (dump == NIL) 3185 if (dump == NIL)
3175 return NIL; 3186 return -1;
3176 3187
3177 SCHEME_V->op = ivalue (car (dump)); dump = cdr (dump); 3188 SCHEME_V->op = ivalue_unchecked (car (dump)); dump = cdr (dump);
3178 SCHEME_V->args = car (dump) ; dump = cdr (dump); 3189 SCHEME_V->args = car (dump) ; dump = cdr (dump);
3179 SCHEME_V->envir = car (dump) ; dump = cdr (dump); 3190 SCHEME_V->envir = car (dump) ; dump = cdr (dump);
3180 SCHEME_V->code = car (dump) ; dump = cdr (dump); 3191 SCHEME_V->code = car (dump) ; dump = cdr (dump);
3181 3192
3182 SCHEME_V->dump = dump; 3193 SCHEME_V->dump = dump;
3183 3194
3184 return S_T; 3195 return 0;
3185} 3196}
3186 3197
3187static void 3198ecb_hot static void
3188s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code) 3199s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code)
3189{ 3200{
3190 SCHEME_V->dump = cons (mk_integer (SCHEME_A_ op), 3201 SCHEME_V->dump = cons (mk_integer (SCHEME_A_ op),
3191 cons (args, 3202 cons (args,
3192 cons (SCHEME_V->envir, 3203 cons (SCHEME_V->envir,
3193 cons (code, 3204 cons (code,
3194 SCHEME_V->dump)))); 3205 SCHEME_V->dump))));
3195} 3206}
3196 3207
3208ecb_cold static void
3209dump_stack_mark (SCHEME_P)
3210{
3211 mark (SCHEME_V->dump);
3212}
3213
3214ecb_cold static pointer
3215ss_get_cont (SCHEME_P)
3216{
3217 return SCHEME_V->dump;
3218}
3219
3220ecb_cold static void
3221ss_set_cont (SCHEME_P_ pointer cont)
3222{
3223 SCHEME_V->dump = cont;
3224}
3225
3226#endif
3227
3228#define s_retbool(tf) s_return ((tf) ? S_T : S_F)
3229
3230#if EXPERIMENT
3231
3232static int
3233dtree (SCHEME_P_ int indent, pointer x)
3234{
3235 int c;
3236
3237 if (is_syntax (x))
3238 {
3239 printf ("%*ssyntax<%s,%d>\n", indent, "", syntaxname(x),syntaxnum(x));
3240 return 8 + 8;
3241 }
3242
3243 if (x == NIL)
3244 {
3245 printf ("%*sNIL\n", indent, "");
3246 return 3;
3247 }
3248
3249 switch (type (x))
3250 {
3251 case T_INTEGER:
3252 printf ("%*sI<%d>%p\n", indent, "", (int)ivalue_unchecked (x), x);
3253 return 32+8;
3254
3255 case T_SYMBOL:
3256 printf ("%*sS<%s>\n", indent, "", symname (x));
3257 return 24+8;
3258
3259 case T_CLOSURE:
3260 printf ("%*sS<%s>\n", indent, "", "closure");
3261 dtree (SCHEME_A_ indent + 3, cdr(x));
3262 return 32 + dtree (SCHEME_A_ indent + 3, car (x));
3263
3264 case T_PAIR:
3265 printf ("%*spair %p %p\n", indent, "", car(x),cdr(x));
3266 c = dtree (SCHEME_A_ indent + 3, car (x));
3267 c += dtree (SCHEME_A_ indent + 3, cdr (x));
3268 return c + 1;
3269
3270 case T_PORT:
3271 printf ("%*sS<%s>\n", indent, "", "port");
3272 return 24+8;
3273
3274 case T_VECTOR:
3275 printf ("%*sS<%s>\n", indent, "", "vector");
3276 return 24+8;
3277
3278 case T_ENVIRONMENT:
3279 printf ("%*sS<%s>\n", indent, "", "environment");
3280 return 0 + dtree (SCHEME_A_ indent + 3, car (x));
3281
3282 default:
3283 printf ("unhandled type %d\n", type (x));
3284 break;
3285 }
3286}
3287
3288#define DUMP(t) do { printf ("DUMP %s:%d\n", __FILE__, __LINE__); dtree (SCHEME_A_ 0, (t)); } while (0)
3289
3290typedef void *stream[1];
3291
3292#define stream_init() { 0 }
3293#define stream_data(s) ((char *)(s)[0] + sizeof (uint32_t) * 2)
3294#define stream_size(s) (((uint32_t *)(s)[0])[0] - sizeof (uint32_t) * 2)
3295#define stream_free(s) free (s[0])
3296
3297ecb_cold static void
3298stream_put (stream s, uint8_t byte)
3299{
3300 uint32_t *sp = *s;
3301 uint32_t size = sizeof (uint32_t) * 2;
3302 uint32_t offs = size;
3303
3304 if (ecb_expect_true (sp))
3305 {
3306 offs = sp[0];
3307 size = sp[1];
3308 }
3309
3310 if (ecb_expect_false (offs == size))
3311 {
3312 size *= 2;
3313 sp = realloc (sp, size);
3314 *s = sp;
3315 sp[1] = size;
3316
3317 }
3318
3319 ((uint8_t *)sp)[offs++] = byte;
3320 sp[0] = offs;
3321}
3322
3323ecb_cold static void
3324stream_put_v (stream s, uint32_t v)
3325{
3326 while (v > 0x7f)
3327 {
3328 stream_put (s, v | 0x80);
3329 v >>= 7;
3330 }
3331
3332 stream_put (s, v);
3333}
3334
3335ecb_cold static void
3336stream_put_tv (stream s, int bop, uint32_t v)
3337{
3338 printf ("put tv %d %d\n", bop, v);//D
3339 stream_put (s, bop);
3340 stream_put_v (s, v);
3341}
3342
3343ecb_cold static void
3344stream_put_stream (stream s, stream o)
3345{
3346 uint32_t i;
3347
3348 for (i = 0; i < stream_size (o); ++i)
3349 stream_put (s, stream_data (o)[i]);
3350
3351 stream_free (o);
3352}
3353
3354ecb_cold static uint32_t
3355cell_id (SCHEME_P_ pointer x)
3356{
3357 struct cell *p = CELL (x);
3358 int i;
3359
3360 for (i = SCHEME_V->last_cell_seg; i >= 0; --i)
3361 if (SCHEME_V->cell_seg[i] <= p && p < SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize[i])
3362 return i | ((p - SCHEME_V->cell_seg[i]) << CELL_NSEGMENT_LOG);
3363
3364 abort ();
3365}
3366
3367// calculates a (preferably small) integer that makes it possible to find
3368// the symbol again. if pointers were offsets into a memory area... until
3369// then, we return segment number in the low bits, and offset in the high
3370// bits.
3371// also, this function must never return 0.
3372ecb_cold static uint32_t
3373symbol_id (SCHEME_P_ pointer sym)
3374{
3375 return cell_id (SCHEME_A_ sym);
3376}
3377
3378enum byteop
3379{
3380 BOP_NIL,
3381 BOP_INTEGER,
3382 BOP_SYMBOL,
3383 BOP_DATUM,
3384 BOP_LIST_BEG,
3385 BOP_LIST_END,
3386 BOP_IF,
3387 BOP_AND,
3388 BOP_OR,
3389 BOP_CASE,
3390 BOP_COND,
3391 BOP_LET,
3392 BOP_LETAST,
3393 BOP_LETREC,
3394 BOP_DEFINE,
3395 BOP_MACRO,
3396 BOP_SET,
3397 BOP_BEGIN,
3398 BOP_LAMBDA,
3399 BOP_DELAY,
3400 BOP_OP,
3401};
3402
3403ecb_cold static void compile_expr (SCHEME_P_ stream s, pointer x);
3404
3405ecb_cold static void
3406compile_list (SCHEME_P_ stream s, pointer x)
3407{
3408 // TODO: improper list
3409
3410 for (; x != NIL; x = cdr (x))
3411 {
3412 stream t = stream_init ();
3413 compile_expr (SCHEME_A_ t, car (x));
3414 stream_put_v (s, stream_size (t));
3415 stream_put_stream (s, t);
3416 }
3417
3418 stream_put_v (s, 0);
3419}
3420
3197static void 3421static void
3198dump_stack_mark (SCHEME_P) 3422compile_if (SCHEME_P_ stream s, pointer cond, pointer ift, pointer iff)
3199{ 3423{
3200 mark (SCHEME_V->dump); 3424 stream sift = stream_init (); compile_expr (SCHEME_A_ sift, ift);
3425
3426 stream_put (s, BOP_IF);
3427 compile_expr (SCHEME_A_ s, cond);
3428 stream_put_v (s, stream_size (sift));
3429 stream_put_stream (s, sift);
3430 compile_expr (SCHEME_A_ s, iff);
3431}
3432
3433typedef uint32_t stream_fixup;
3434
3435static stream_fixup
3436stream_put_fixup (stream s)
3437{
3438 stream_put (s, 0);
3439 stream_put (s, 0);
3440
3441 return stream_size (s);
3442}
3443
3444static void
3445stream_fix_fixup (stream s, stream_fixup fixup, uint32_t target)
3446{
3447 target -= fixup;
3448 assert (target < (1 << 14));
3449 stream_data (s)[fixup - 2] = target | 0x80;
3450 stream_data (s)[fixup - 1] = target >> 7;
3451}
3452
3453static void
3454compile_and_or (SCHEME_P_ stream s, int and, pointer x)
3455{
3456 for (; cdr (x) != NIL; x = cdr (x))
3457 {
3458 stream t = stream_init ();
3459 compile_expr (SCHEME_A_ t, car (x));
3460 stream_put_v (s, stream_size (t));
3461 stream_put_stream (s, t);
3462 }
3463
3464 stream_put_v (s, 0);
3465}
3466
3467static void
3468compile_case (SCHEME_P_ stream s, pointer x)
3469{
3470 compile_expr (SCHEME_A_ s, caar (x));
3471
3472 for (;;)
3473 {
3474 x = cdr (x);
3475
3476 if (x == NIL)
3477 break;
3478
3479 compile_expr (SCHEME_A_ s, caar (x));
3480 stream t = stream_init (); compile_expr (SCHEME_A_ t, cdar (x));
3481 stream_put_v (s, stream_size (t));
3482 stream_put_stream (s, t);
3483 }
3484
3485 stream_put_v (s, 0);
3486}
3487
3488static void
3489compile_cond (SCHEME_P_ stream s, pointer x)
3490{
3491 for ( ; x != NIL; x = cdr (x))
3492 {
3493 compile_expr (SCHEME_A_ s, caar (x));
3494 stream t = stream_init (); compile_expr (SCHEME_A_ t, cdar (x));
3495 stream_put_v (s, stream_size (t));
3496 stream_put_stream (s, t);
3497 }
3498
3499 stream_put_v (s, 0);
3201} 3500}
3202 3501
3203static pointer 3502static pointer
3204ss_get_cont (SCHEME_P) 3503lookup (SCHEME_P_ pointer x)
3205{ 3504{
3206 return SCHEME_V->dump; 3505 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, x, 1);
3207}
3208 3506
3209static void 3507 if (x != NIL)
3210ss_set_cont (SCHEME_P_ pointer cont) 3508 x = slot_value_in_env (x);
3211{
3212 SCHEME_V->dump = cont;
3213}
3214 3509
3215#endif 3510 return x;
3511}
3216 3512
3217#define s_retbool(tf) s_return ((tf) ? S_T : S_F) 3513ecb_cold static void
3514compile_expr (SCHEME_P_ stream s, pointer x)
3515{
3516 if (x == NIL)
3517 {
3518 stream_put (s, BOP_NIL);
3519 return;
3520 }
3218 3521
3219static pointer 3522 if (is_pair (x))
3523 {
3524 pointer head = car (x);
3525
3526 if (is_syntax (head))
3527 {
3528 int syn = syntaxnum (head);
3529 x = cdr (x);
3530
3531 switch (syntaxnum (head))
3532 {
3533 case OP_IF0: /* if */
3534 stream_put_v (s, BOP_IF);
3535 compile_if (SCHEME_A_ s, car (x), cadr (x), caddr (x));
3536 break;
3537
3538 case OP_OR0: /* or */
3539 stream_put_v (s, BOP_OR);
3540 compile_and_or (SCHEME_A_ s, 0, x);
3541 break;
3542
3543 case OP_AND0: /* and */
3544 stream_put_v (s, BOP_AND);
3545 compile_and_or (SCHEME_A_ s, 1, x);
3546 break;
3547
3548 case OP_CASE0: /* case */
3549 stream_put_v (s, BOP_CASE);
3550 compile_case (SCHEME_A_ s, x);
3551 break;
3552
3553 case OP_COND0: /* cond */
3554 stream_put_v (s, BOP_COND);
3555 compile_cond (SCHEME_A_ s, x);
3556 break;
3557
3558 case OP_LET0: /* let */
3559 case OP_LET0AST: /* let* */
3560 case OP_LET0REC: /* letrec */
3561 switch (syn)
3562 {
3563 case OP_LET0: stream_put (s, BOP_LET ); break;
3564 case OP_LET0AST: stream_put (s, BOP_LETAST); break;
3565 case OP_LET0REC: stream_put (s, BOP_LETREC); break;
3566 }
3567
3568 {
3569 pointer bindings = car (x);
3570 pointer body = cadr (x);
3571
3572 for (x = bindings; x != NIL; x = cdr (x))
3573 {
3574 pointer init = NIL;
3575 pointer var = car (x);
3576
3577 if (is_pair (var))
3578 {
3579 init = cdr (var);
3580 var = car (var);
3581 }
3582
3583 stream_put_v (s, symbol_id (SCHEME_A_ var));
3584 compile_expr (SCHEME_A_ s, init);
3585 }
3586
3587 stream_put_v (s, 0);
3588 compile_expr (SCHEME_A_ s, body);
3589 }
3590 break;
3591
3592 case OP_DEF0: /* define */
3593 case OP_MACRO0: /* macro */
3594 stream_put (s, syntaxnum (head) == OP_DEF0 ? BOP_DEFINE : BOP_MACRO);
3595 stream_put_v (s, cell_id (SCHEME_A_ car (x)));
3596 compile_expr (SCHEME_A_ s, cadr (x));
3597 break;
3598
3599 case OP_SET0: /* set! */
3600 stream_put (s, BOP_SET);
3601 stream_put_v (s, symbol_id (SCHEME_A_ car (x)));
3602 compile_expr (SCHEME_A_ s, cadr (x));
3603 break;
3604
3605 case OP_BEGIN: /* begin */
3606 stream_put (s, BOP_BEGIN);
3607 compile_list (SCHEME_A_ s, x);
3608 return;
3609
3610 case OP_QUOTE: /* quote */
3611 stream_put_tv (s, BOP_DATUM, cell_id (SCHEME_A_ x));
3612 break;
3613
3614 case OP_DELAY: /* delay */
3615 stream_put (s, BOP_DELAY);
3616 compile_expr (SCHEME_A_ s, x);
3617 break;
3618
3619 case OP_LAMBDA: /* lambda */
3620 {
3621 pointer formals = car (x);
3622 pointer body = cadr (x);
3623
3624 stream_put (s, BOP_LAMBDA);
3625
3626 for (; is_pair (formals); formals = cdr (formals))
3627 stream_put_v (s, symbol_id (SCHEME_A_ car (formals)));
3628
3629 stream_put_v (s, 0);
3630 stream_put_v (s, formals == NIL ? 0 : symbol_id (SCHEME_A_ formals));
3631
3632 compile_expr (SCHEME_A_ s, body);
3633 }
3634 break;
3635
3636 case OP_C0STREAM:/* cons-stream */
3637 abort ();
3638 break;
3639 }
3640
3641 return;
3642 }
3643
3644 pointer m = lookup (SCHEME_A_ head);
3645
3646 if (is_macro (m))
3647 {
3648 s_save (SCHEME_A_ OP_DEBUG2, SCHEME_V->args, SCHEME_V->code);
3649 SCHEME_V->code = m;
3650 SCHEME_V->args = cons (x, NIL);
3651 Eval_Cycle (SCHEME_A_ OP_APPLY);
3652 x = SCHEME_V->value;
3653 compile_expr (SCHEME_A_ s, SCHEME_V->value);
3654 return;
3655 }
3656
3657 stream_put (s, BOP_LIST_BEG);
3658
3659 for (; x != NIL; x = cdr (x))
3660 compile_expr (SCHEME_A_ s, car (x));
3661
3662 stream_put (s, BOP_LIST_END);
3663 return;
3664 }
3665
3666 switch (type (x))
3667 {
3668 case T_INTEGER:
3669 {
3670 IVALUE iv = ivalue_unchecked (x);
3671 iv = iv < 0 ? ((~(uint32_t)iv) << 1) | 1 : (uint32_t)iv << 1;
3672 stream_put_tv (s, BOP_INTEGER, iv);
3673 }
3674 return;
3675
3676 case T_SYMBOL:
3677 if (0)
3678 {
3679 // no can do without more analysis
3680 pointer m = lookup (SCHEME_A_ x);
3681
3682 if (is_proc (m))
3683 {
3684 printf ("compile proc %s %d\n", procname(m), procnum(m));
3685 stream_put_tv (s, BOP_SYMBOL, BOP_OP + procnum (m));
3686 }
3687 else
3688 stream_put_tv (s, BOP_SYMBOL, symbol_id (SCHEME_A_ x));
3689 }
3690
3691 stream_put_tv (s, BOP_SYMBOL, symbol_id (SCHEME_A_ x));
3692 return;
3693
3694 default:
3695 stream_put_tv (s, BOP_DATUM, cell_id (SCHEME_A_ x));
3696 break;
3697 }
3698}
3699
3700ecb_cold static int
3701compile_closure (SCHEME_P_ pointer p)
3702{
3703 stream s = stream_init ();
3704
3705 compile_list (SCHEME_A_ s, cdar (p));
3706
3707 FILE *xxd = popen ("xxd", "we");
3708 fwrite (stream_data (s), 1, stream_size (s), xxd);
3709 fclose (xxd);
3710
3711 return stream_size (s);
3712}
3713
3714#endif
3715
3716/* syntax, eval, core, ... */
3717ecb_hot static int
3220opexe_0 (SCHEME_P_ enum scheme_opcodes op) 3718opexe_0 (SCHEME_P_ enum scheme_opcodes op)
3221{ 3719{
3222 pointer args = SCHEME_V->args; 3720 pointer args = SCHEME_V->args;
3223 pointer x, y; 3721 pointer x, y;
3224 3722
3225 switch (op) 3723 switch (op)
3226 { 3724 {
3725#if EXPERIMENT //D
3726 case OP_DEBUG:
3727 {
3728 uint32_t len = compile_closure (SCHEME_A_ car (args));
3729 printf ("len = %d\n", len);
3730 printf ("\n");
3731 s_return (S_T);
3732 }
3733
3734 case OP_DEBUG2:
3735 return -1;
3736#endif
3737
3227 case OP_LOAD: /* load */ 3738 case OP_LOAD: /* load */
3228 if (file_interactive (SCHEME_A)) 3739 if (file_interactive (SCHEME_A))
3229 { 3740 {
3230 xwrstr ("Loading "); xwrstr (strvalue (car (args))); xwrstr ("\n"); 3741 putstr (SCHEME_A_ "Loading ");
3231 //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args))); 3742 putstr (SCHEME_A_ strvalue (car (args)));
3743 putcharacter (SCHEME_A_ '\n');
3232 } 3744 }
3233 3745
3234 if (!file_push (SCHEME_A_ strvalue (car (args)))) 3746 if (!file_push (SCHEME_A_ strvalue (car (args))))
3235 Error_1 ("unable to open", car (args)); 3747 Error_1 ("unable to open", car (args));
3236 else 3748
3237 {
3238 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i); 3749 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i);
3239 s_goto (OP_T0LVL); 3750 s_goto (OP_T0LVL);
3240 }
3241 3751
3242 case OP_T0LVL: /* top level */ 3752 case OP_T0LVL: /* top level */
3243 3753
3244 /* If we reached the end of file, this loop is done. */ 3754 /* If we reached the end of file, this loop is done. */
3245 if (SCHEME_V->loadport->object.port->kind & port_saw_EOF) 3755 if (port (SCHEME_V->loadport)->kind & port_saw_EOF)
3246 { 3756 {
3247 if (SCHEME_V->file_i == 0) 3757 if (SCHEME_V->file_i == 0)
3248 { 3758 {
3249 SCHEME_V->args = NIL; 3759 SCHEME_V->args = NIL;
3250 s_goto (OP_QUIT); 3760 s_goto (OP_QUIT);
… …
3261 /* If interactive, be nice to user. */ 3771 /* If interactive, be nice to user. */
3262 if (file_interactive (SCHEME_A)) 3772 if (file_interactive (SCHEME_A))
3263 { 3773 {
3264 SCHEME_V->envir = SCHEME_V->global_env; 3774 SCHEME_V->envir = SCHEME_V->global_env;
3265 dump_stack_reset (SCHEME_A); 3775 dump_stack_reset (SCHEME_A);
3266 putstr (SCHEME_A_ "\n"); 3776 putcharacter (SCHEME_A_ '\n');
3777#if EXPERIMENT
3778 system ("ps v $PPID");
3779#endif
3267 putstr (SCHEME_A_ prompt); 3780 putstr (SCHEME_A_ prompt);
3268 } 3781 }
3269 3782
3270 /* Set up another iteration of REPL */ 3783 /* Set up another iteration of REPL */
3271 SCHEME_V->nesting = 0; 3784 SCHEME_V->nesting = 0;
… …
3306 { 3819 {
3307 SCHEME_V->print_flag = 1; 3820 SCHEME_V->print_flag = 1;
3308 SCHEME_V->args = SCHEME_V->value; 3821 SCHEME_V->args = SCHEME_V->value;
3309 s_goto (OP_P0LIST); 3822 s_goto (OP_P0LIST);
3310 } 3823 }
3311 else 3824
3312 s_return (SCHEME_V->value); 3825 s_return (SCHEME_V->value);
3313 3826
3314 case OP_EVAL: /* main part of evaluation */ 3827 case OP_EVAL: /* main part of evaluation */
3315#if USE_TRACING 3828#if USE_TRACING
3316 if (SCHEME_V->tracing) 3829 if (SCHEME_V->tracing)
3317 { 3830 {
… …
3328#endif 3841#endif
3329 if (is_symbol (SCHEME_V->code)) /* symbol */ 3842 if (is_symbol (SCHEME_V->code)) /* symbol */
3330 { 3843 {
3331 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 1); 3844 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 1);
3332 3845
3333 if (x != NIL) 3846 if (x == NIL)
3334 s_return (slot_value_in_env (x));
3335 else
3336 Error_1 ("eval: unbound variable:", SCHEME_V->code); 3847 Error_1 ("eval: unbound variable:", SCHEME_V->code);
3848
3849 s_return (slot_value_in_env (x));
3337 } 3850 }
3338 else if (is_pair (SCHEME_V->code)) 3851 else if (is_pair (SCHEME_V->code))
3339 { 3852 {
3340 x = car (SCHEME_V->code); 3853 x = car (SCHEME_V->code);
3341 3854
… …
3350 /* If no macros => s_save(SCHEME_A_ OP_E1ARGS, NIL, cdr(SCHEME_V->code)); */ 3863 /* If no macros => s_save(SCHEME_A_ OP_E1ARGS, NIL, cdr(SCHEME_V->code)); */
3351 SCHEME_V->code = x; 3864 SCHEME_V->code = x;
3352 s_goto (OP_EVAL); 3865 s_goto (OP_EVAL);
3353 } 3866 }
3354 } 3867 }
3355 else 3868
3356 s_return (SCHEME_V->code); 3869 s_return (SCHEME_V->code);
3357 3870
3358 case OP_E0ARGS: /* eval arguments */ 3871 case OP_E0ARGS: /* eval arguments */
3359 if (is_macro (SCHEME_V->value)) /* macro expansion */ 3872 if (ecb_expect_false (is_macro (SCHEME_V->value))) /* macro expansion */
3360 { 3873 {
3361 s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL); 3874 s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL);
3362 SCHEME_V->args = cons (SCHEME_V->code, NIL); 3875 SCHEME_V->args = cons (SCHEME_V->code, NIL);
3363 SCHEME_V->code = SCHEME_V->value; 3876 SCHEME_V->code = SCHEME_V->value;
3364 s_goto (OP_APPLY); 3877 s_goto (OP_APPLY);
3365 } 3878 }
3366 else 3879
3367 {
3368 SCHEME_V->code = cdr (SCHEME_V->code); 3880 SCHEME_V->code = cdr (SCHEME_V->code);
3369 s_goto (OP_E1ARGS); 3881 s_goto (OP_E1ARGS);
3370 }
3371 3882
3372 case OP_E1ARGS: /* eval arguments */ 3883 case OP_E1ARGS: /* eval arguments */
3373 args = cons (SCHEME_V->value, args); 3884 args = cons (SCHEME_V->value, args);
3374 3885
3375 if (is_pair (SCHEME_V->code)) /* continue */ 3886 if (is_pair (SCHEME_V->code)) /* continue */
… …
3386 SCHEME_V->args = cdr (args); 3897 SCHEME_V->args = cdr (args);
3387 s_goto (OP_APPLY); 3898 s_goto (OP_APPLY);
3388 } 3899 }
3389 3900
3390#if USE_TRACING 3901#if USE_TRACING
3391
3392 case OP_TRACING: 3902 case OP_TRACING:
3393 { 3903 {
3394 int tr = SCHEME_V->tracing; 3904 int tr = SCHEME_V->tracing;
3395 3905
3396 SCHEME_V->tracing = ivalue (car (args)); 3906 SCHEME_V->tracing = ivalue_unchecked (car (args));
3397 s_return (mk_integer (SCHEME_A_ tr)); 3907 s_return (mk_integer (SCHEME_A_ tr));
3398 } 3908 }
3399
3400#endif 3909#endif
3401 3910
3402 case OP_APPLY: /* apply 'code' to 'args' */ 3911 case OP_APPLY: /* apply 'code' to 'args' */
3403#if USE_TRACING 3912#if USE_TRACING
3404 if (SCHEME_V->tracing) 3913 if (SCHEME_V->tracing)
… …
3413 /* fall through */ 3922 /* fall through */
3414 3923
3415 case OP_REAL_APPLY: 3924 case OP_REAL_APPLY:
3416#endif 3925#endif
3417 if (is_proc (SCHEME_V->code)) 3926 if (is_proc (SCHEME_V->code))
3418 {
3419 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */ 3927 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */
3420 }
3421 else if (is_foreign (SCHEME_V->code)) 3928 else if (is_foreign (SCHEME_V->code))
3422 { 3929 {
3423 /* Keep nested calls from GC'ing the arglist */ 3930 /* Keep nested calls from GC'ing the arglist */
3424 push_recent_alloc (SCHEME_A_ args, NIL); 3931 push_recent_alloc (SCHEME_A_ args, NIL);
3425 x = SCHEME_V->code->object.ff (SCHEME_A_ args); 3932 x = CELL(SCHEME_V->code)->object.ff (SCHEME_A_ args);
3426 3933
3427 s_return (x); 3934 s_return (x);
3428 } 3935 }
3429 else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */ 3936 else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */
3430 { 3937 {
… …
3460 else if (is_continuation (SCHEME_V->code)) /* CONTINUATION */ 3967 else if (is_continuation (SCHEME_V->code)) /* CONTINUATION */
3461 { 3968 {
3462 ss_set_cont (SCHEME_A_ cont_dump (SCHEME_V->code)); 3969 ss_set_cont (SCHEME_A_ cont_dump (SCHEME_V->code));
3463 s_return (args != NIL ? car (args) : NIL); 3970 s_return (args != NIL ? car (args) : NIL);
3464 } 3971 }
3465 else 3972
3466 Error_0 ("illegal function"); 3973 Error_0 ("illegal function");
3467 3974
3468 case OP_DOMACRO: /* do macro */ 3975 case OP_DOMACRO: /* do macro */
3469 SCHEME_V->code = SCHEME_V->value; 3976 SCHEME_V->code = SCHEME_V->value;
3470 s_goto (OP_EVAL); 3977 s_goto (OP_EVAL);
3471
3472#if 1
3473 3978
3474 case OP_LAMBDA: /* lambda */ 3979 case OP_LAMBDA: /* lambda */
3475 /* If the hook is defined, apply it to SCHEME_V->code, otherwise 3980 /* If the hook is defined, apply it to SCHEME_V->code, otherwise
3476 set SCHEME_V->value fall thru */ 3981 set SCHEME_V->value fall thru */
3477 { 3982 {
… …
3484 SCHEME_V->code = slot_value_in_env (f); 3989 SCHEME_V->code = slot_value_in_env (f);
3485 s_goto (OP_APPLY); 3990 s_goto (OP_APPLY);
3486 } 3991 }
3487 3992
3488 SCHEME_V->value = SCHEME_V->code; 3993 SCHEME_V->value = SCHEME_V->code;
3489 /* Fallthru */
3490 } 3994 }
3995 /* Fallthru */
3491 3996
3492 case OP_LAMBDA1: 3997 case OP_LAMBDA1:
3493 s_return (mk_closure (SCHEME_A_ SCHEME_V->value, SCHEME_V->envir)); 3998 s_return (mk_closure (SCHEME_A_ SCHEME_V->value, SCHEME_V->envir));
3494
3495#else
3496
3497 case OP_LAMBDA: /* lambda */
3498 s_return (mk_closure (SCHEME_A_ SCHEME_V->code, SCHEME_V->envir));
3499
3500#endif
3501 3999
3502 case OP_MKCLOSURE: /* make-closure */ 4000 case OP_MKCLOSURE: /* make-closure */
3503 x = car (args); 4001 x = car (args);
3504 4002
3505 if (car (x) == SCHEME_V->LAMBDA) 4003 if (car (x) == SCHEME_V->LAMBDA)
… …
3544 else 4042 else
3545 new_slot_in_env (SCHEME_A_ SCHEME_V->code, SCHEME_V->value); 4043 new_slot_in_env (SCHEME_A_ SCHEME_V->code, SCHEME_V->value);
3546 4044
3547 s_return (SCHEME_V->code); 4045 s_return (SCHEME_V->code);
3548 4046
3549
3550 case OP_DEFP: /* defined? */ 4047 case OP_DEFP: /* defined? */
3551 x = SCHEME_V->envir; 4048 x = SCHEME_V->envir;
3552 4049
3553 if (cdr (args) != NIL) 4050 if (cdr (args) != NIL)
3554 x = cadr (args); 4051 x = cadr (args);
… …
3572 s_return (SCHEME_V->value); 4069 s_return (SCHEME_V->value);
3573 } 4070 }
3574 else 4071 else
3575 Error_1 ("set!: unbound variable:", SCHEME_V->code); 4072 Error_1 ("set!: unbound variable:", SCHEME_V->code);
3576 4073
3577
3578 case OP_BEGIN: /* begin */ 4074 case OP_BEGIN: /* begin */
3579 if (!is_pair (SCHEME_V->code)) 4075 if (!is_pair (SCHEME_V->code))
3580 s_return (SCHEME_V->code); 4076 s_return (SCHEME_V->code);
3581 4077
3582 if (cdr (SCHEME_V->code) != NIL) 4078 if (cdr (SCHEME_V->code) != NIL)
… …
3592 4088
3593 case OP_IF1: /* if */ 4089 case OP_IF1: /* if */
3594 if (is_true (SCHEME_V->value)) 4090 if (is_true (SCHEME_V->value))
3595 SCHEME_V->code = car (SCHEME_V->code); 4091 SCHEME_V->code = car (SCHEME_V->code);
3596 else 4092 else
3597 SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because 4093 SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because * car(NIL) = NIL */
3598 4094
3599 * car(NIL) = NIL */
3600 s_goto (OP_EVAL); 4095 s_goto (OP_EVAL);
3601 4096
3602 case OP_LET0: /* let */ 4097 case OP_LET0: /* let */
3603 SCHEME_V->args = NIL; 4098 SCHEME_V->args = NIL;
3604 SCHEME_V->value = SCHEME_V->code; 4099 SCHEME_V->value = SCHEME_V->code;
3605 SCHEME_V->code = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code); 4100 SCHEME_V->code = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code);
3606 s_goto (OP_LET1); 4101 s_goto (OP_LET1);
3607 4102
3608 case OP_LET1: /* let (calculate parameters) */ 4103 case OP_LET1: /* let (calculate parameters) */
4104 case OP_LET1REC: /* letrec (calculate parameters) */
3609 args = cons (SCHEME_V->value, args); 4105 args = cons (SCHEME_V->value, args);
3610 4106
3611 if (is_pair (SCHEME_V->code)) /* continue */ 4107 if (is_pair (SCHEME_V->code)) /* continue */
3612 { 4108 {
3613 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code))) 4109 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code)))
3614 Error_1 ("Bad syntax of binding spec in let :", car (SCHEME_V->code)); 4110 Error_1 ("Bad syntax of binding spec in let/letrec:", car (SCHEME_V->code));
3615 4111
3616 s_save (SCHEME_A_ OP_LET1, args, cdr (SCHEME_V->code)); 4112 s_save (SCHEME_A_ op, args, cdr (SCHEME_V->code));
3617 SCHEME_V->code = cadar (SCHEME_V->code); 4113 SCHEME_V->code = cadar (SCHEME_V->code);
3618 SCHEME_V->args = NIL; 4114 SCHEME_V->args = NIL;
3619 s_goto (OP_EVAL); 4115 s_goto (OP_EVAL);
3620 } 4116 }
3621 else /* end */ 4117
3622 { 4118 /* end */
3623 args = reverse_in_place (SCHEME_A_ NIL, args); 4119 args = reverse_in_place (SCHEME_A_ NIL, args);
3624 SCHEME_V->code = car (args); 4120 SCHEME_V->code = car (args);
3625 SCHEME_V->args = cdr (args); 4121 SCHEME_V->args = cdr (args);
3626 s_goto (OP_LET2); 4122 s_goto (op == OP_LET1 ? OP_LET2 : OP_LET2REC);
3627 }
3628 4123
3629 case OP_LET2: /* let */ 4124 case OP_LET2: /* let */
3630 new_frame_in_env (SCHEME_A_ SCHEME_V->envir); 4125 new_frame_in_env (SCHEME_A_ SCHEME_V->envir);
3631 4126
3632 for (x = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code), y = args; 4127 for (x = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code), y = args;
… …
3636 if (is_symbol (car (SCHEME_V->code))) /* named let */ 4131 if (is_symbol (car (SCHEME_V->code))) /* named let */
3637 { 4132 {
3638 for (x = cadr (SCHEME_V->code), args = NIL; x != NIL; x = cdr (x)) 4133 for (x = cadr (SCHEME_V->code), args = NIL; x != NIL; x = cdr (x))
3639 { 4134 {
3640 if (!is_pair (x)) 4135 if (!is_pair (x))
3641 Error_1 ("Bad syntax of binding in let :", x); 4136 Error_1 ("Bad syntax of binding in let:", x);
3642 4137
3643 if (!is_list (SCHEME_A_ car (x))) 4138 if (!is_list (SCHEME_A_ car (x)))
3644 Error_1 ("Bad syntax of binding in let :", car (x)); 4139 Error_1 ("Bad syntax of binding in let:", car (x));
3645 4140
3646 args = cons (caar (x), args); 4141 args = cons (caar (x), args);
3647 } 4142 }
3648 4143
3649 x = mk_closure (SCHEME_A_ cons (reverse_in_place (SCHEME_A_ NIL, args), cddr (SCHEME_V->code)), 4144 x = mk_closure (SCHEME_A_ cons (reverse_in_place (SCHEME_A_ NIL, args), cddr (SCHEME_V->code)),
… …
3666 SCHEME_V->code = cdr (SCHEME_V->code); 4161 SCHEME_V->code = cdr (SCHEME_V->code);
3667 s_goto (OP_BEGIN); 4162 s_goto (OP_BEGIN);
3668 } 4163 }
3669 4164
3670 if (!is_pair (car (SCHEME_V->code)) || !is_pair (caar (SCHEME_V->code)) || !is_pair (cdaar (SCHEME_V->code))) 4165 if (!is_pair (car (SCHEME_V->code)) || !is_pair (caar (SCHEME_V->code)) || !is_pair (cdaar (SCHEME_V->code)))
3671 Error_1 ("Bad syntax of binding spec in let* :", car (SCHEME_V->code)); 4166 Error_1 ("Bad syntax of binding spec in let*:", car (SCHEME_V->code));
3672 4167
3673 s_save (SCHEME_A_ OP_LET1AST, cdr (SCHEME_V->code), car (SCHEME_V->code)); 4168 s_save (SCHEME_A_ OP_LET1AST, cdr (SCHEME_V->code), car (SCHEME_V->code));
3674 SCHEME_V->code = car (cdaar (SCHEME_V->code)); 4169 SCHEME_V->code = car (cdaar (SCHEME_V->code));
3675 s_goto (OP_EVAL); 4170 s_goto (OP_EVAL);
3676 4171
… …
3687 s_save (SCHEME_A_ OP_LET2AST, args, SCHEME_V->code); 4182 s_save (SCHEME_A_ OP_LET2AST, args, SCHEME_V->code);
3688 SCHEME_V->code = cadar (SCHEME_V->code); 4183 SCHEME_V->code = cadar (SCHEME_V->code);
3689 SCHEME_V->args = NIL; 4184 SCHEME_V->args = NIL;
3690 s_goto (OP_EVAL); 4185 s_goto (OP_EVAL);
3691 } 4186 }
3692 else /* end */ 4187
4188 /* end */
3693 { 4189
3694 SCHEME_V->code = args; 4190 SCHEME_V->code = args;
3695 SCHEME_V->args = NIL; 4191 SCHEME_V->args = NIL;
3696 s_goto (OP_BEGIN); 4192 s_goto (OP_BEGIN);
3697 }
3698 4193
3699 case OP_LET0REC: /* letrec */ 4194 case OP_LET0REC: /* letrec */
3700 new_frame_in_env (SCHEME_A_ SCHEME_V->envir); 4195 new_frame_in_env (SCHEME_A_ SCHEME_V->envir);
3701 SCHEME_V->args = NIL; 4196 SCHEME_V->args = NIL;
3702 SCHEME_V->value = SCHEME_V->code; 4197 SCHEME_V->value = SCHEME_V->code;
3703 SCHEME_V->code = car (SCHEME_V->code); 4198 SCHEME_V->code = car (SCHEME_V->code);
3704 s_goto (OP_LET1REC); 4199 s_goto (OP_LET1REC);
3705 4200
3706 case OP_LET1REC: /* letrec (calculate parameters) */ 4201 /* OP_LET1REC handled by OP_LET1 */
3707 args = cons (SCHEME_V->value, args);
3708
3709 if (is_pair (SCHEME_V->code)) /* continue */
3710 {
3711 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code)))
3712 Error_1 ("Bad syntax of binding spec in letrec :", car (SCHEME_V->code));
3713
3714 s_save (SCHEME_A_ OP_LET1REC, args, cdr (SCHEME_V->code));
3715 SCHEME_V->code = cadar (SCHEME_V->code);
3716 SCHEME_V->args = NIL;
3717 s_goto (OP_EVAL);
3718 }
3719 else /* end */
3720 {
3721 args = reverse_in_place (SCHEME_A_ NIL, args);
3722 SCHEME_V->code = car (args);
3723 SCHEME_V->args = cdr (args);
3724 s_goto (OP_LET2REC);
3725 }
3726 4202
3727 case OP_LET2REC: /* letrec */ 4203 case OP_LET2REC: /* letrec */
3728 for (x = car (SCHEME_V->code), y = args; y != NIL; x = cdr (x), y = cdr (y)) 4204 for (x = car (SCHEME_V->code), y = args; y != NIL; x = cdr (x), y = cdr (y))
3729 new_slot_in_env (SCHEME_A_ caar (x), car (y)); 4205 new_slot_in_env (SCHEME_A_ caar (x), car (y));
3730 4206
… …
3760 } 4236 }
3761 else 4237 else
3762 { 4238 {
3763 if ((SCHEME_V->code = cdr (SCHEME_V->code)) == NIL) 4239 if ((SCHEME_V->code = cdr (SCHEME_V->code)) == NIL)
3764 s_return (NIL); 4240 s_return (NIL);
3765 else 4241
3766 {
3767 s_save (SCHEME_A_ OP_COND1, NIL, SCHEME_V->code); 4242 s_save (SCHEME_A_ OP_COND1, NIL, SCHEME_V->code);
3768 SCHEME_V->code = caar (SCHEME_V->code); 4243 SCHEME_V->code = caar (SCHEME_V->code);
3769 s_goto (OP_EVAL); 4244 s_goto (OP_EVAL);
3770 }
3771 } 4245 }
3772 4246
3773 case OP_DELAY: /* delay */ 4247 case OP_DELAY: /* delay */
3774 x = mk_closure (SCHEME_A_ cons (NIL, SCHEME_V->code), SCHEME_V->envir); 4248 x = mk_closure (SCHEME_A_ cons (NIL, SCHEME_V->code), SCHEME_V->envir);
3775 set_typeflag (x, T_PROMISE); 4249 set_typeflag (x, T_PROMISE);
… …
3786 case OP_AND1: /* and */ 4260 case OP_AND1: /* and */
3787 if (is_false (SCHEME_V->value)) 4261 if (is_false (SCHEME_V->value))
3788 s_return (SCHEME_V->value); 4262 s_return (SCHEME_V->value);
3789 else if (SCHEME_V->code == NIL) 4263 else if (SCHEME_V->code == NIL)
3790 s_return (SCHEME_V->value); 4264 s_return (SCHEME_V->value);
3791 else 4265
3792 {
3793 s_save (SCHEME_A_ OP_AND1, NIL, cdr (SCHEME_V->code)); 4266 s_save (SCHEME_A_ OP_AND1, NIL, cdr (SCHEME_V->code));
3794 SCHEME_V->code = car (SCHEME_V->code); 4267 SCHEME_V->code = car (SCHEME_V->code);
3795 s_goto (OP_EVAL); 4268 s_goto (OP_EVAL);
3796 }
3797 4269
3798 case OP_OR0: /* or */ 4270 case OP_OR0: /* or */
3799 if (SCHEME_V->code == NIL) 4271 if (SCHEME_V->code == NIL)
3800 s_return (S_F); 4272 s_return (S_F);
3801 4273
… …
3806 case OP_OR1: /* or */ 4278 case OP_OR1: /* or */
3807 if (is_true (SCHEME_V->value)) 4279 if (is_true (SCHEME_V->value))
3808 s_return (SCHEME_V->value); 4280 s_return (SCHEME_V->value);
3809 else if (SCHEME_V->code == NIL) 4281 else if (SCHEME_V->code == NIL)
3810 s_return (SCHEME_V->value); 4282 s_return (SCHEME_V->value);
3811 else 4283
3812 {
3813 s_save (SCHEME_A_ OP_OR1, NIL, cdr (SCHEME_V->code)); 4284 s_save (SCHEME_A_ OP_OR1, NIL, cdr (SCHEME_V->code));
3814 SCHEME_V->code = car (SCHEME_V->code); 4285 SCHEME_V->code = car (SCHEME_V->code);
3815 s_goto (OP_EVAL); 4286 s_goto (OP_EVAL);
3816 }
3817 4287
3818 case OP_C0STREAM: /* cons-stream */ 4288 case OP_C0STREAM: /* cons-stream */
3819 s_save (SCHEME_A_ OP_C1STREAM, NIL, cdr (SCHEME_V->code)); 4289 s_save (SCHEME_A_ OP_C1STREAM, NIL, cdr (SCHEME_V->code));
3820 SCHEME_V->code = car (SCHEME_V->code); 4290 SCHEME_V->code = car (SCHEME_V->code);
3821 s_goto (OP_EVAL); 4291 s_goto (OP_EVAL);
… …
3886 s_save (SCHEME_A_ OP_CASE2, NIL, cdar (x)); 4356 s_save (SCHEME_A_ OP_CASE2, NIL, cdar (x));
3887 SCHEME_V->code = caar (x); 4357 SCHEME_V->code = caar (x);
3888 s_goto (OP_EVAL); 4358 s_goto (OP_EVAL);
3889 } 4359 }
3890 } 4360 }
3891 else 4361
3892 s_return (NIL); 4362 s_return (NIL);
3893 4363
3894 case OP_CASE2: /* case */ 4364 case OP_CASE2: /* case */
3895 if (is_true (SCHEME_V->value)) 4365 if (is_true (SCHEME_V->value))
3896 s_goto (OP_BEGIN); 4366 s_goto (OP_BEGIN);
3897 else 4367
3898 s_return (NIL); 4368 s_return (NIL);
3899 4369
3900 case OP_PAPPLY: /* apply */ 4370 case OP_PAPPLY: /* apply */
3901 SCHEME_V->code = car (args); 4371 SCHEME_V->code = car (args);
3902 SCHEME_V->args = list_star (SCHEME_A_ cdr (args)); 4372 SCHEME_V->args = list_star (SCHEME_A_ cdr (args));
3903 /*SCHEME_V->args = cadr(args); */ 4373 /*SCHEME_V->args = cadr(args); */
… …
3914 SCHEME_V->code = car (args); 4384 SCHEME_V->code = car (args);
3915 SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL); 4385 SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL);
3916 s_goto (OP_APPLY); 4386 s_goto (OP_APPLY);
3917 } 4387 }
3918 4388
3919 abort (); 4389 if (USE_ERROR_CHECKING) abort ();
3920} 4390}
3921 4391
3922static pointer 4392/* math, cxr */
4393ecb_hot static int
3923opexe_2 (SCHEME_P_ enum scheme_opcodes op) 4394opexe_1 (SCHEME_P_ enum scheme_opcodes op)
3924{ 4395{
3925 pointer args = SCHEME_V->args; 4396 pointer args = SCHEME_V->args;
3926 pointer x = car (args); 4397 pointer x = car (args);
3927 num v; 4398 num v;
3928 4399
3929#if USE_MATH
3930 RVALUE dd;
3931#endif
3932
3933 switch (op) 4400 switch (op)
3934 { 4401 {
3935#if USE_MATH 4402#if USE_MATH
3936 case OP_INEX2EX: /* inexact->exact */ 4403 case OP_INEX2EX: /* inexact->exact */
3937 if (num_is_integer (x)) 4404 if (!is_integer (x))
3938 s_return (x); 4405 {
3939 else if (modf (rvalue_unchecked (x), &dd) == 0) 4406 RVALUE r = rvalue_unchecked (x);
3940 s_return (mk_integer (SCHEME_A_ ivalue (x))); 4407
4408 if (r == (RVALUE)(IVALUE)r)
4409 x = mk_integer (SCHEME_A_ rvalue_unchecked (x));
3941 else 4410 else
3942 Error_1 ("inexact->exact: not integral:", x); 4411 Error_1 ("inexact->exact: not integral:", x);
4412 }
3943 4413
4414 s_return (x);
4415
4416 case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x))));
4417 case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x))));
4418 case OP_TRUNCATE: s_return (mk_real (SCHEME_A_ trunc (rvalue (x))));
4419 case OP_ROUND: s_return (mk_real (SCHEME_A_ nearbyint (rvalue (x))));
4420
4421 case OP_SQRT: s_return (mk_real (SCHEME_A_ sqrt (rvalue (x))));
3944 case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x)))); 4422 case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x))));
3945 case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x)))); 4423 case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x))
4424 / (cadr (args) == NIL ? 1 : log (rvalue (cadr (args))))));
3946 case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x)))); 4425 case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x))));
3947 case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x)))); 4426 case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x))));
3948 case OP_TAN: s_return (mk_real (SCHEME_A_ tan (rvalue (x)))); 4427 case OP_TAN: s_return (mk_real (SCHEME_A_ tan (rvalue (x))));
3949 case OP_ASIN: s_return (mk_real (SCHEME_A_ asin (rvalue (x)))); 4428 case OP_ASIN: s_return (mk_real (SCHEME_A_ asin (rvalue (x))));
3950 case OP_ACOS: s_return (mk_real (SCHEME_A_ acos (rvalue (x)))); 4429 case OP_ACOS: s_return (mk_real (SCHEME_A_ acos (rvalue (x))));
3951 4430
3952 case OP_ATAN: 4431 case OP_ATAN:
4432 s_return (mk_real (SCHEME_A_
3953 if (cdr (args) == NIL) 4433 cdr (args) == NIL
3954 s_return (mk_real (SCHEME_A_ atan (rvalue (x)))); 4434 ? atan (rvalue (x))
3955 else 4435 : atan2 (rvalue (x), rvalue (cadr (args)))));
3956 {
3957 pointer y = cadr (args);
3958 s_return (mk_real (SCHEME_A_ atan2 (rvalue (x), rvalue (y))));
3959 }
3960
3961 case OP_SQRT:
3962 s_return (mk_real (SCHEME_A_ sqrt (rvalue (x))));
3963 4436
3964 case OP_EXPT: 4437 case OP_EXPT:
3965 { 4438 {
3966 RVALUE result; 4439 RVALUE result;
3967 int real_result = 1; 4440 int real_result = 1;
3968 pointer y = cadr (args); 4441 pointer y = cadr (args);
3969 4442
3970 if (num_is_integer (x) && num_is_integer (y)) 4443 if (is_integer (x) && is_integer (y))
3971 real_result = 0; 4444 real_result = 0;
3972 4445
3973 /* This 'if' is an R5RS compatibility fix. */ 4446 /* This 'if' is an R5RS compatibility fix. */
3974 /* NOTE: Remove this 'if' fix for R6RS. */ 4447 /* NOTE: Remove this 'if' fix for R6RS. */
3975 if (rvalue (x) == 0 && rvalue (y) < 0) 4448 if (rvalue (x) == 0 && rvalue (y) < 0)
… …
3981 /* If the test fails, result is too big for integer. */ 4454 /* If the test fails, result is too big for integer. */
3982 if (!real_result) 4455 if (!real_result)
3983 { 4456 {
3984 long result_as_long = result; 4457 long result_as_long = result;
3985 4458
3986 if (result != (RVALUE) result_as_long) 4459 if (result != result_as_long)
3987 real_result = 1; 4460 real_result = 1;
3988 } 4461 }
3989 4462
3990 if (real_result) 4463 if (real_result)
3991 s_return (mk_real (SCHEME_A_ result)); 4464 s_return (mk_real (SCHEME_A_ result));
3992 else 4465 else
3993 s_return (mk_integer (SCHEME_A_ result)); 4466 s_return (mk_integer (SCHEME_A_ result));
3994 } 4467 }
3995
3996 case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x))));
3997 case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x))));
3998
3999 case OP_TRUNCATE:
4000 {
4001 RVALUE rvalue_of_x;
4002
4003 rvalue_of_x = rvalue (x);
4004
4005 if (rvalue_of_x > 0)
4006 s_return (mk_real (SCHEME_A_ floor (rvalue_of_x)));
4007 else
4008 s_return (mk_real (SCHEME_A_ ceil (rvalue_of_x)));
4009 }
4010
4011 case OP_ROUND:
4012 if (num_is_integer (x))
4013 s_return (x);
4014
4015 s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x))));
4016#endif 4468#endif
4017 4469
4018 case OP_ADD: /* + */ 4470 case OP_ADD: /* + */
4019 v = num_zero; 4471 v = num_zero;
4020 4472
4021 for (x = args; x != NIL; x = cdr (x)) 4473 for (x = args; x != NIL; x = cdr (x))
4022 v = num_op ('+', v, nvalue (car (x))); 4474 v = num_op (NUM_ADD, v, nvalue (car (x)));
4023 4475
4024 s_return (mk_number (SCHEME_A_ v)); 4476 s_return (mk_number (SCHEME_A_ v));
4025 4477
4026 case OP_MUL: /* * */ 4478 case OP_MUL: /* * */
4027 v = num_one; 4479 v = num_one;
4028 4480
4029 for (x = args; x != NIL; x = cdr (x)) 4481 for (x = args; x != NIL; x = cdr (x))
4030 v = num_op ('+', v, nvalue (car (x))); 4482 v = num_op (NUM_MUL, v, nvalue (car (x)));
4031 4483
4032 s_return (mk_number (SCHEME_A_ v)); 4484 s_return (mk_number (SCHEME_A_ v));
4033 4485
4034 case OP_SUB: /* - */ 4486 case OP_SUB: /* - */
4035 if (cdr (args) == NIL) 4487 if (cdr (args) == NIL)
… …
4042 x = cdr (args); 4494 x = cdr (args);
4043 v = nvalue (car (args)); 4495 v = nvalue (car (args));
4044 } 4496 }
4045 4497
4046 for (; x != NIL; x = cdr (x)) 4498 for (; x != NIL; x = cdr (x))
4047 v = num_op ('+', v, nvalue (car (x))); 4499 v = num_op (NUM_SUB, v, nvalue (car (x)));
4048 4500
4049 s_return (mk_number (SCHEME_A_ v)); 4501 s_return (mk_number (SCHEME_A_ v));
4050 4502
4051 case OP_DIV: /* / */ 4503 case OP_DIV: /* / */
4052 if (cdr (args) == NIL) 4504 if (cdr (args) == NIL)
… …
4059 x = cdr (args); 4511 x = cdr (args);
4060 v = nvalue (car (args)); 4512 v = nvalue (car (args));
4061 } 4513 }
4062 4514
4063 for (; x != NIL; x = cdr (x)) 4515 for (; x != NIL; x = cdr (x))
4064 {
4065 if (!is_zero_rvalue (rvalue (car (x)))) 4516 if (!is_zero_rvalue (rvalue (car (x))))
4066 v = num_div (v, nvalue (car (x))); 4517 v = num_div (v, nvalue (car (x)));
4067 else 4518 else
4068 Error_0 ("/: division by zero"); 4519 Error_0 ("/: division by zero");
4069 }
4070 4520
4071 s_return (mk_number (SCHEME_A_ v)); 4521 s_return (mk_number (SCHEME_A_ v));
4072 4522
4073 case OP_INTDIV: /* quotient */ 4523 case OP_INTDIV: /* quotient */
4074 if (cdr (args) == NIL) 4524 if (cdr (args) == NIL)
… …
4083 } 4533 }
4084 4534
4085 for (; x != NIL; x = cdr (x)) 4535 for (; x != NIL; x = cdr (x))
4086 { 4536 {
4087 if (ivalue (car (x)) != 0) 4537 if (ivalue (car (x)) != 0)
4088 v = num_op ('/', v, nvalue (car (x))); 4538 v = num_op (NUM_INTDIV, v, nvalue (car (x)));
4089 else 4539 else
4090 Error_0 ("quotient: division by zero"); 4540 Error_0 ("quotient: division by zero");
4091 } 4541 }
4092 4542
4093 s_return (mk_number (SCHEME_A_ v)); 4543 s_return (mk_number (SCHEME_A_ v));
… …
4110 else 4560 else
4111 Error_0 ("modulo: division by zero"); 4561 Error_0 ("modulo: division by zero");
4112 4562
4113 s_return (mk_number (SCHEME_A_ v)); 4563 s_return (mk_number (SCHEME_A_ v));
4114 4564
4115 case OP_CAR: /* car */ 4565 /* the compiler will optimize this mess... */
4116 s_return (caar (args)); 4566 case OP_CAR: op_car: s_return (car (x));
4117 4567 case OP_CDR: op_cdr: s_return (cdr (x));
4118 case OP_CDR: /* cdr */ 4568 case OP_CAAR: op_caar: x = car (x); goto op_car;
4119 s_return (cdar (args)); 4569 case OP_CADR: op_cadr: x = cdr (x); goto op_car;
4570 case OP_CDAR: op_cdar: x = car (x); goto op_cdr;
4571 case OP_CDDR: op_cddr: x = cdr (x); goto op_cdr;
4572 case OP_CAAAR: op_caaar: x = car (x); goto op_caar;
4573 case OP_CAADR: op_caadr: x = cdr (x); goto op_caar;
4574 case OP_CADAR: op_cadar: x = car (x); goto op_cadr;
4575 case OP_CADDR: op_caddr: x = cdr (x); goto op_cadr;
4576 case OP_CDAAR: op_cdaar: x = car (x); goto op_cdar;
4577 case OP_CDADR: op_cdadr: x = cdr (x); goto op_cdar;
4578 case OP_CDDAR: op_cddar: x = car (x); goto op_cddr;
4579 case OP_CDDDR: op_cdddr: x = cdr (x); goto op_cddr;
4580 case OP_CAAAAR: x = car (x); goto op_caaar;
4581 case OP_CAAADR: x = cdr (x); goto op_caaar;
4582 case OP_CAADAR: x = car (x); goto op_caadr;
4583 case OP_CAADDR: x = cdr (x); goto op_caadr;
4584 case OP_CADAAR: x = car (x); goto op_cadar;
4585 case OP_CADADR: x = cdr (x); goto op_cadar;
4586 case OP_CADDAR: x = car (x); goto op_caddr;
4587 case OP_CADDDR: x = cdr (x); goto op_caddr;
4588 case OP_CDAAAR: x = car (x); goto op_cdaar;
4589 case OP_CDAADR: x = cdr (x); goto op_cdaar;
4590 case OP_CDADAR: x = car (x); goto op_cdadr;
4591 case OP_CDADDR: x = cdr (x); goto op_cdadr;
4592 case OP_CDDAAR: x = car (x); goto op_cddar;
4593 case OP_CDDADR: x = cdr (x); goto op_cddar;
4594 case OP_CDDDAR: x = car (x); goto op_cdddr;
4595 case OP_CDDDDR: x = cdr (x); goto op_cdddr;
4120 4596
4121 case OP_CONS: /* cons */ 4597 case OP_CONS: /* cons */
4122 set_cdr (args, cadr (args)); 4598 set_cdr (args, cadr (args));
4123 s_return (args); 4599 s_return (args);
4124 4600
… …
4139 } 4615 }
4140 else 4616 else
4141 Error_0 ("set-cdr!: unable to alter immutable pair"); 4617 Error_0 ("set-cdr!: unable to alter immutable pair");
4142 4618
4143 case OP_CHAR2INT: /* char->integer */ 4619 case OP_CHAR2INT: /* char->integer */
4144 s_return (mk_integer (SCHEME_A_ ivalue (x))); 4620 s_return (mk_integer (SCHEME_A_ ivalue_unchecked (x)));
4145 4621
4146 case OP_INT2CHAR: /* integer->char */ 4622 case OP_INT2CHAR: /* integer->char */
4147 s_return (mk_character (SCHEME_A_ ivalue (x))); 4623 s_return (mk_character (SCHEME_A_ ivalue_unchecked (x)));
4148 4624
4149 case OP_CHARUPCASE: 4625 case OP_CHARUPCASE:
4150 { 4626 {
4151 unsigned char c = ivalue (x); 4627 unsigned char c = ivalue_unchecked (x);
4152 c = toupper (c); 4628 c = toupper (c);
4153 s_return (mk_character (SCHEME_A_ c)); 4629 s_return (mk_character (SCHEME_A_ c));
4154 } 4630 }
4155 4631
4156 case OP_CHARDNCASE: 4632 case OP_CHARDNCASE:
4157 { 4633 {
4158 unsigned char c = ivalue (x); 4634 unsigned char c = ivalue_unchecked (x);
4159 c = tolower (c); 4635 c = tolower (c);
4160 s_return (mk_character (SCHEME_A_ c)); 4636 s_return (mk_character (SCHEME_A_ c));
4161 } 4637 }
4162 4638
4163 case OP_STR2SYM: /* string->symbol */ 4639 case OP_STR2SYM: /* string->symbol */
… …
4240 Error_1 ("atom->string: not an atom:", x); 4716 Error_1 ("atom->string: not an atom:", x);
4241 } 4717 }
4242 4718
4243 case OP_MKSTRING: /* make-string */ 4719 case OP_MKSTRING: /* make-string */
4244 { 4720 {
4245 int fill = ' '; 4721 int fill = cdr (args) != NIL ? charvalue (cadr (args)) : ' ';
4246 int len;
4247
4248 len = ivalue (x); 4722 int len = ivalue_unchecked (x);
4249
4250 if (cdr (args) != NIL)
4251 fill = charvalue (cadr (args));
4252 4723
4253 s_return (mk_empty_string (SCHEME_A_ len, fill)); 4724 s_return (mk_empty_string (SCHEME_A_ len, fill));
4254 } 4725 }
4255 4726
4256 case OP_STRLEN: /* string-length */ 4727 case OP_STRLEN: /* string-length */
4257 s_return (mk_integer (SCHEME_A_ strlength (x))); 4728 s_return (mk_integer (SCHEME_A_ strlength (x)));
4258 4729
4259 case OP_STRREF: /* string-ref */ 4730 case OP_STRREF: /* string-ref */
4260 { 4731 {
4261 char *str;
4262 int index;
4263
4264 str = strvalue (x); 4732 char *str = strvalue (x);
4265
4266 index = ivalue (cadr (args)); 4733 int index = ivalue_unchecked (cadr (args));
4267 4734
4268 if (index >= strlength (x)) 4735 if (index >= strlength (x))
4269 Error_1 ("string-ref: out of bounds:", cadr (args)); 4736 Error_1 ("string-ref: out of bounds:", cadr (args));
4270 4737
4271 s_return (mk_character (SCHEME_A_ ((unsigned char *)str)[index])); 4738 s_return (mk_character (SCHEME_A_ ((unsigned char *)str)[index]));
4272 } 4739 }
4273 4740
4274 case OP_STRSET: /* string-set! */ 4741 case OP_STRSET: /* string-set! */
4275 { 4742 {
4276 char *str; 4743 char *str = strvalue (x);
4277 int index; 4744 int index = ivalue_unchecked (cadr (args));
4278 int c; 4745 int c;
4279 4746
4280 if (is_immutable (x)) 4747 if (is_immutable (x))
4281 Error_1 ("string-set!: unable to alter immutable string:", x); 4748 Error_1 ("string-set!: unable to alter immutable string:", x);
4282
4283 str = strvalue (x);
4284
4285 index = ivalue (cadr (args));
4286 4749
4287 if (index >= strlength (x)) 4750 if (index >= strlength (x))
4288 Error_1 ("string-set!: out of bounds:", cadr (args)); 4751 Error_1 ("string-set!: out of bounds:", cadr (args));
4289 4752
4290 c = charvalue (caddr (args)); 4753 c = charvalue (caddr (args));
… …
4311 memcpy (pos, strvalue (car (x)), strlength (car (x))); 4774 memcpy (pos, strvalue (car (x)), strlength (car (x)));
4312 4775
4313 s_return (newstr); 4776 s_return (newstr);
4314 } 4777 }
4315 4778
4316 case OP_SUBSTR: /* substring */ 4779 case OP_STRING_COPY: /* substring/string-copy */
4317 { 4780 {
4318 char *str; 4781 char *str = strvalue (x);
4319 int index0; 4782 int index0 = cadr (args) == NIL ? 0 : ivalue_unchecked (cadr (args));
4320 int index1; 4783 int index1;
4321 int len; 4784 int len;
4322 4785
4323 str = strvalue (x);
4324
4325 index0 = ivalue (cadr (args));
4326
4327 if (index0 > strlength (x)) 4786 if (index0 > strlength (x))
4328 Error_1 ("substring: start out of bounds:", cadr (args)); 4787 Error_1 ("string->copy: start out of bounds:", cadr (args));
4329 4788
4330 if (cddr (args) != NIL) 4789 if (cddr (args) != NIL)
4331 { 4790 {
4332 index1 = ivalue (caddr (args)); 4791 index1 = ivalue_unchecked (caddr (args));
4333 4792
4334 if (index1 > strlength (x) || index1 < index0) 4793 if (index1 > strlength (x) || index1 < index0)
4335 Error_1 ("substring: end out of bounds:", caddr (args)); 4794 Error_1 ("string->copy: end out of bounds:", caddr (args));
4336 } 4795 }
4337 else 4796 else
4338 index1 = strlength (x); 4797 index1 = strlength (x);
4339 4798
4340 len = index1 - index0; 4799 len = index1 - index0;
4341 x = mk_empty_string (SCHEME_A_ len, ' '); 4800 x = mk_counted_string (SCHEME_A_ str + index0, len);
4342 memcpy (strvalue (x), str + index0, len);
4343 strvalue (x)[len] = 0;
4344 4801
4345 s_return (x); 4802 s_return (x);
4346 } 4803 }
4347 4804
4348 case OP_VECTOR: /* vector */ 4805 case OP_VECTOR: /* vector */
… …
4360 if (SCHEME_V->no_memory) 4817 if (SCHEME_V->no_memory)
4361 s_return (S_SINK); 4818 s_return (S_SINK);
4362#endif 4819#endif
4363 4820
4364 for (x = args, i = 0; is_pair (x); x = cdr (x), i++) 4821 for (x = args, i = 0; is_pair (x); x = cdr (x), i++)
4365 set_vector_elem (vec, i, car (x)); 4822 vector_set (vec, i, car (x));
4366 4823
4367 s_return (vec); 4824 s_return (vec);
4368 } 4825 }
4369 4826
4370 case OP_MKVECTOR: /* make-vector */ 4827 case OP_MKVECTOR: /* make-vector */
4371 { 4828 {
4372 pointer fill = NIL; 4829 pointer fill = NIL;
4373 int len;
4374 pointer vec; 4830 pointer vec;
4375
4376 len = ivalue (x); 4831 int len = ivalue_unchecked (x);
4377 4832
4378 if (cdr (args) != NIL) 4833 if (cdr (args) != NIL)
4379 fill = cadr (args); 4834 fill = cadr (args);
4380 4835
4381 vec = mk_vector (SCHEME_A_ len); 4836 vec = mk_vector (SCHEME_A_ len);
… …
4384 if (SCHEME_V->no_memory) 4839 if (SCHEME_V->no_memory)
4385 s_return (S_SINK); 4840 s_return (S_SINK);
4386#endif 4841#endif
4387 4842
4388 if (fill != NIL) 4843 if (fill != NIL)
4389 fill_vector (vec, fill); 4844 fill_vector (vec, 0, fill);
4390 4845
4391 s_return (vec); 4846 s_return (vec);
4392 } 4847 }
4393 4848
4394 case OP_VECLEN: /* vector-length */ 4849 case OP_VECLEN: /* vector-length */
4395 s_return (mk_integer (SCHEME_A_ veclength (x))); 4850 s_return (mk_integer (SCHEME_A_ veclength (x)));
4396 4851
4852 case OP_VECRESIZE:
4853 vector_resize (x, ivalue_unchecked (cadr (args)), caddr (args));
4854 s_return (x);
4855
4397 case OP_VECREF: /* vector-ref */ 4856 case OP_VECREF: /* vector-ref */
4398 { 4857 {
4399 int index;
4400
4401 index = ivalue (cadr (args)); 4858 int index = ivalue_unchecked (cadr (args));
4402 4859
4403 if (index >= veclength (car (args)) && USE_ERROR_CHECKING) 4860 if (index >= veclength (car (args)) && USE_ERROR_CHECKING)
4404 Error_1 ("vector-ref: out of bounds:", cadr (args)); 4861 Error_1 ("vector-ref: out of bounds:", cadr (args));
4405 4862
4406 s_return (vector_elem (x, index)); 4863 s_return (vector_get (x, index));
4407 } 4864 }
4408 4865
4409 case OP_VECSET: /* vector-set! */ 4866 case OP_VECSET: /* vector-set! */
4410 { 4867 {
4411 int index; 4868 int index = ivalue_unchecked (cadr (args));
4412 4869
4413 if (is_immutable (x)) 4870 if (is_immutable (x))
4414 Error_1 ("vector-set!: unable to alter immutable vector:", x); 4871 Error_1 ("vector-set!: unable to alter immutable vector:", x);
4415 4872
4416 index = ivalue (cadr (args));
4417
4418 if (index >= veclength (car (args)) && USE_ERROR_CHECKING) 4873 if (index >= veclength (car (args)) && USE_ERROR_CHECKING)
4419 Error_1 ("vector-set!: out of bounds:", cadr (args)); 4874 Error_1 ("vector-set!: out of bounds:", cadr (args));
4420 4875
4421 set_vector_elem (x, index, caddr (args)); 4876 vector_set (x, index, caddr (args));
4422 s_return (x); 4877 s_return (x);
4423 } 4878 }
4424 } 4879 }
4425 4880
4426 return S_T; 4881 if (USE_ERROR_CHECKING) abort ();
4427} 4882}
4428 4883
4429INTERFACE int 4884/* relational ops */
4430is_list (SCHEME_P_ pointer a) 4885ecb_hot static int
4431{
4432 return list_length (SCHEME_A_ a) >= 0;
4433}
4434
4435/* Result is:
4436 proper list: length
4437 circular list: -1
4438 not even a pair: -2
4439 dotted list: -2 minus length before dot
4440*/
4441INTERFACE int
4442list_length (SCHEME_P_ pointer a)
4443{
4444 int i = 0;
4445 pointer slow, fast;
4446
4447 slow = fast = a;
4448
4449 while (1)
4450 {
4451 if (fast == NIL)
4452 return i;
4453
4454 if (!is_pair (fast))
4455 return -2 - i;
4456
4457 fast = cdr (fast);
4458 ++i;
4459
4460 if (fast == NIL)
4461 return i;
4462
4463 if (!is_pair (fast))
4464 return -2 - i;
4465
4466 ++i;
4467 fast = cdr (fast);
4468
4469 /* Safe because we would have already returned if `fast'
4470 encountered a non-pair. */
4471 slow = cdr (slow);
4472
4473 if (fast == slow)
4474 {
4475 /* the fast pointer has looped back around and caught up
4476 with the slow pointer, hence the structure is circular,
4477 not of finite length, and therefore not a list */
4478 return -1;
4479 }
4480 }
4481}
4482
4483static pointer
4484opexe_r (SCHEME_P_ enum scheme_opcodes op) 4886opexe_2 (SCHEME_P_ enum scheme_opcodes op)
4485{ 4887{
4486 pointer x = SCHEME_V->args; 4888 pointer x = SCHEME_V->args;
4487 4889
4488 for (;;) 4890 for (;;)
4489 { 4891 {
… …
4509 } 4911 }
4510 4912
4511 s_return (S_T); 4913 s_return (S_T);
4512} 4914}
4513 4915
4514static pointer 4916/* predicates */
4917ecb_hot static int
4515opexe_3 (SCHEME_P_ enum scheme_opcodes op) 4918opexe_3 (SCHEME_P_ enum scheme_opcodes op)
4516{ 4919{
4517 pointer args = SCHEME_V->args; 4920 pointer args = SCHEME_V->args;
4518 pointer a = car (args); 4921 pointer a = car (args);
4519 pointer d = cdr (args); 4922 pointer d = cdr (args);
4520 int r; 4923 int r;
4521 4924
4522 switch (op) 4925 switch (op)
4523 { 4926 {
4524 case OP_NOT: /* not */ r = is_false (a) ; break; 4927 case OP_NOT: /* not */ r = is_false (a) ; break;
4525 case OP_BOOLP: /* boolean? */ r = a == S_F || a == S_T; break; 4928 case OP_BOOLP: /* boolean? */ r = a == S_F || a == S_T ; break;
4526 case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break; 4929 case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break;
4527 case OP_NULLP: /* null? */ r = a == NIL ; break; 4930 case OP_NULLP: /* null? */ r = a == NIL ; break;
4528 case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break; 4931 case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break;
4932 case OP_GENSYMP: /* gensym? */ r = is_gensym (SCHEME_A_ a); break;
4529 case OP_NUMBERP: /* number? */ r = is_number (a) ; break; 4933 case OP_NUMBERP: /* number? */ r = is_number (a) ; break;
4530 case OP_STRINGP: /* string? */ r = is_string (a) ; break; 4934 case OP_STRINGP: /* string? */ r = is_string (a) ; break;
4531 case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break; 4935 case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break;
4532 case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */ 4936 case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */
4533 case OP_CHARP: /* char? */ r = is_character (a) ; break; 4937 case OP_CHARP: /* char? */ r = is_character (a) ; break;
4534 4938
4535#if USE_CHAR_CLASSIFIERS 4939#if USE_CHAR_CLASSIFIERS
4536 case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue (a)); break; 4940 case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue_unchecked (a)); break;
4537 case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue (a)); break; 4941 case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue_unchecked (a)); break;
4538 case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue (a)); break; 4942 case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue_unchecked (a)); break;
4539 case OP_CHARUP: /* char-upper-case? */ r = Cisupper (ivalue (a)); break; 4943 case OP_CHARUP: /* char-upper-case? */ r = Cisupper (ivalue_unchecked (a)); break;
4540 case OP_CHARLP: /* char-lower-case? */ r = Cislower (ivalue (a)); break; 4944 case OP_CHARLP: /* char-lower-case? */ r = Cislower (ivalue_unchecked (a)); break;
4541#endif 4945#endif
4542 4946
4543#if USE_PORTS 4947#if USE_PORTS
4544 case OP_PORTP: /* port? */ r = is_port (a) ; break; 4948 case OP_PORTP: /* port? */ r = is_port (a) ; break;
4545 case OP_INPORTP: /* input-port? */ r = is_inport (a) ; break; 4949 case OP_INPORTP: /* input-port? */ r = is_inport (a) ; break;
… …
4565 } 4969 }
4566 4970
4567 s_retbool (r); 4971 s_retbool (r);
4568} 4972}
4569 4973
4570static pointer 4974/* promises, list ops, ports */
4975ecb_hot static int
4571opexe_4 (SCHEME_P_ enum scheme_opcodes op) 4976opexe_4 (SCHEME_P_ enum scheme_opcodes op)
4572{ 4977{
4573 pointer args = SCHEME_V->args; 4978 pointer args = SCHEME_V->args;
4574 pointer a = car (args); 4979 pointer a = car (args);
4575 pointer x, y; 4980 pointer x, y;
… …
4588 } 4993 }
4589 else 4994 else
4590 s_return (SCHEME_V->code); 4995 s_return (SCHEME_V->code);
4591 4996
4592 case OP_SAVE_FORCED: /* Save forced value replacing promise */ 4997 case OP_SAVE_FORCED: /* Save forced value replacing promise */
4593 memcpy (SCHEME_V->code, SCHEME_V->value, sizeof (struct cell)); 4998 *CELL (SCHEME_V->code) = *CELL (SCHEME_V->value);
4594 s_return (SCHEME_V->value); 4999 s_return (SCHEME_V->value);
4595 5000
4596#if USE_PORTS 5001#if USE_PORTS
5002
5003 case OP_EOF_OBJECT: /* eof-object */
5004 s_return (S_EOF);
4597 5005
4598 case OP_WRITE: /* write */ 5006 case OP_WRITE: /* write */
4599 case OP_DISPLAY: /* display */ 5007 case OP_DISPLAY: /* display */
4600 case OP_WRITE_CHAR: /* write-char */ 5008 case OP_WRITE_CHAR: /* write-char */
4601 if (is_pair (cdr (SCHEME_V->args))) 5009 if (is_pair (cdr (SCHEME_V->args)))
… …
4615 else 5023 else
4616 SCHEME_V->print_flag = 0; 5024 SCHEME_V->print_flag = 0;
4617 5025
4618 s_goto (OP_P0LIST); 5026 s_goto (OP_P0LIST);
4619 5027
5028 //TODO: move to scheme
4620 case OP_NEWLINE: /* newline */ 5029 case OP_NEWLINE: /* newline */
4621 if (is_pair (args)) 5030 if (is_pair (args))
4622 { 5031 {
4623 if (a != SCHEME_V->outport) 5032 if (a != SCHEME_V->outport)
4624 { 5033 {
… …
4626 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL); 5035 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL);
4627 SCHEME_V->outport = a; 5036 SCHEME_V->outport = a;
4628 } 5037 }
4629 } 5038 }
4630 5039
4631 putstr (SCHEME_A_ "\n"); 5040 putcharacter (SCHEME_A_ '\n');
4632 s_return (S_T); 5041 s_return (S_T);
4633#endif 5042#endif
4634 5043
4635 case OP_ERR0: /* error */ 5044 case OP_ERR0: /* error */
4636 SCHEME_V->retcode = -1; 5045 SCHEME_V->retcode = -1;
… …
4645 putstr (SCHEME_A_ strvalue (car (args))); 5054 putstr (SCHEME_A_ strvalue (car (args)));
4646 SCHEME_V->args = cdr (args); 5055 SCHEME_V->args = cdr (args);
4647 s_goto (OP_ERR1); 5056 s_goto (OP_ERR1);
4648 5057
4649 case OP_ERR1: /* error */ 5058 case OP_ERR1: /* error */
4650 putstr (SCHEME_A_ " "); 5059 putcharacter (SCHEME_A_ ' ');
4651 5060
4652 if (args != NIL) 5061 if (args != NIL)
4653 { 5062 {
4654 s_save (SCHEME_A_ OP_ERR1, cdr (args), NIL); 5063 s_save (SCHEME_A_ OP_ERR1, cdr (args), NIL);
4655 SCHEME_V->args = a; 5064 SCHEME_V->args = a;
4656 SCHEME_V->print_flag = 1; 5065 SCHEME_V->print_flag = 1;
4657 s_goto (OP_P0LIST); 5066 s_goto (OP_P0LIST);
4658 } 5067 }
4659 else 5068 else
4660 { 5069 {
4661 putstr (SCHEME_A_ "\n"); 5070 putcharacter (SCHEME_A_ '\n');
4662 5071
4663 if (SCHEME_V->interactive_repl) 5072 if (SCHEME_V->interactive_repl)
4664 s_goto (OP_T0LVL); 5073 s_goto (OP_T0LVL);
4665 else 5074 else
4666 return NIL; 5075 return -1;
4667 } 5076 }
4668 5077
4669 case OP_REVERSE: /* reverse */ 5078 case OP_REVERSE: /* reverse */
4670 s_return (reverse (SCHEME_A_ a)); 5079 s_return (reverse (SCHEME_A_ a));
4671 5080
… …
4728 5137
4729 case OP_QUIT: /* quit */ 5138 case OP_QUIT: /* quit */
4730 if (is_pair (args)) 5139 if (is_pair (args))
4731 SCHEME_V->retcode = ivalue (a); 5140 SCHEME_V->retcode = ivalue (a);
4732 5141
4733 return NIL; 5142 return -1;
4734 5143
4735 case OP_GC: /* gc */ 5144 case OP_GC: /* gc */
4736 gc (SCHEME_A_ NIL, NIL); 5145 gc (SCHEME_A_ NIL, NIL);
4737 s_return (S_T); 5146 s_return (S_T);
4738 5147
… …
4743 SCHEME_V->gc_verbose = (a != S_F); 5152 SCHEME_V->gc_verbose = (a != S_F);
4744 s_retbool (was); 5153 s_retbool (was);
4745 } 5154 }
4746 5155
4747 case OP_NEWSEGMENT: /* new-segment */ 5156 case OP_NEWSEGMENT: /* new-segment */
5157#if 0
4748 if (!is_pair (args) || !is_number (a)) 5158 if (!is_pair (args) || !is_number (a))
4749 Error_0 ("new-segment: argument must be a number"); 5159 Error_0 ("new-segment: argument must be a number");
4750 5160#endif
4751 alloc_cellseg (SCHEME_A_ (int)ivalue (a)); 5161 s_retbool (alloc_cellseg (SCHEME_A));
4752
4753 s_return (S_T);
4754 5162
4755 case OP_OBLIST: /* oblist */ 5163 case OP_OBLIST: /* oblist */
4756 s_return (oblist_all_symbols (SCHEME_A)); 5164 s_return (oblist_all_symbols (SCHEME_A));
4757 5165
4758#if USE_PORTS 5166#if USE_PORTS
… …
4785 break; 5193 break;
4786 } 5194 }
4787 5195
4788 p = port_from_filename (SCHEME_A_ strvalue (a), prop); 5196 p = port_from_filename (SCHEME_A_ strvalue (a), prop);
4789 5197
4790 if (p == NIL) 5198 s_return (p == NIL ? S_F : p);
4791 s_return (S_F);
4792
4793 s_return (p);
4794 } 5199 }
4795 5200
4796# if USE_STRING_PORTS 5201# if USE_STRING_PORTS
4797 5202
4798 case OP_OPEN_INSTRING: /* open-input-string */ 5203 case OP_OPEN_INSTRING: /* open-input-string */
… …
4813 } 5218 }
4814 5219
4815 p = port_from_string (SCHEME_A_ strvalue (a), 5220 p = port_from_string (SCHEME_A_ strvalue (a),
4816 strvalue (a) + strlength (a), prop); 5221 strvalue (a) + strlength (a), prop);
4817 5222
4818 if (p == NIL) 5223 s_return (p == NIL ? S_F : p);
4819 s_return (S_F);
4820
4821 s_return (p);
4822 } 5224 }
4823 5225
4824 case OP_OPEN_OUTSTRING: /* open-output-string */ 5226 case OP_OPEN_OUTSTRING: /* open-output-string */
4825 { 5227 {
4826 pointer p; 5228 pointer p;
4827 5229
4828 if (a == NIL) 5230 if (a == NIL)
4829 {
4830 p = port_from_scratch (SCHEME_A); 5231 p = port_from_scratch (SCHEME_A);
4831
4832 if (p == NIL)
4833 s_return (S_F);
4834 }
4835 else 5232 else
4836 {
4837 p = port_from_string (SCHEME_A_ strvalue (a), 5233 p = port_from_string (SCHEME_A_ strvalue (a),
4838 strvalue (a) + strlength (a), port_output); 5234 strvalue (a) + strlength (a), port_output);
4839 5235
4840 if (p == NIL) 5236 s_return (p == NIL ? S_F : p);
4841 s_return (S_F);
4842 }
4843
4844 s_return (p);
4845 } 5237 }
4846 5238
4847 case OP_GET_OUTSTRING: /* get-output-string */ 5239 case OP_GET_OUTSTRING: /* get-output-string */
4848 { 5240 {
4849 port *p; 5241 port *p = port (a);
4850 5242
4851 if ((p = a->object.port)->kind & port_string) 5243 if (p->kind & port_string)
4852 { 5244 {
4853 off_t size; 5245 off_t size;
4854 char *str; 5246 char *str;
4855 5247
4856 size = p->rep.string.curr - p->rep.string.start + 1; 5248 size = p->rep.string.curr - p->rep.string.start + 1;
… …
4888 case OP_CURR_ENV: /* current-environment */ 5280 case OP_CURR_ENV: /* current-environment */
4889 s_return (SCHEME_V->envir); 5281 s_return (SCHEME_V->envir);
4890 5282
4891 } 5283 }
4892 5284
4893 abort (); 5285 if (USE_ERROR_CHECKING) abort ();
4894} 5286}
4895 5287
4896static pointer 5288/* reading */
5289ecb_cold static int
4897opexe_5 (SCHEME_P_ enum scheme_opcodes op) 5290opexe_5 (SCHEME_P_ enum scheme_opcodes op)
4898{ 5291{
5292 pointer args = SCHEME_V->args;
4899 pointer x; 5293 pointer x;
4900 5294
4901 if (SCHEME_V->nesting != 0) 5295 if (SCHEME_V->nesting != 0)
4902 { 5296 {
4903 int n = SCHEME_V->nesting; 5297 int n = SCHEME_V->nesting;
… …
4910 switch (op) 5304 switch (op)
4911 { 5305 {
4912 /* ========== reading part ========== */ 5306 /* ========== reading part ========== */
4913#if USE_PORTS 5307#if USE_PORTS
4914 case OP_READ: 5308 case OP_READ:
4915 if (!is_pair (SCHEME_V->args)) 5309 if (!is_pair (args))
4916 s_goto (OP_READ_INTERNAL); 5310 s_goto (OP_READ_INTERNAL);
4917 5311
4918 if (!is_inport (car (SCHEME_V->args))) 5312 if (!is_inport (car (args)))
4919 Error_1 ("read: not an input port:", car (SCHEME_V->args)); 5313 Error_1 ("read: not an input port:", car (args));
4920 5314
4921 if (car (SCHEME_V->args) == SCHEME_V->inport) 5315 if (car (args) == SCHEME_V->inport)
4922 s_goto (OP_READ_INTERNAL); 5316 s_goto (OP_READ_INTERNAL);
4923 5317
4924 x = SCHEME_V->inport; 5318 x = SCHEME_V->inport;
4925 SCHEME_V->inport = car (SCHEME_V->args); 5319 SCHEME_V->inport = car (args);
4926 x = cons (x, NIL); 5320 x = cons (x, NIL);
4927 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); 5321 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL);
4928 s_goto (OP_READ_INTERNAL); 5322 s_goto (OP_READ_INTERNAL);
4929 5323
4930 case OP_READ_CHAR: /* read-char */ 5324 case OP_READ_CHAR: /* read-char */
4931 case OP_PEEK_CHAR: /* peek-char */ 5325 case OP_PEEK_CHAR: /* peek-char */
4932 { 5326 {
4933 int c; 5327 int c;
4934 5328
4935 if (is_pair (SCHEME_V->args)) 5329 if (is_pair (args))
4936 { 5330 {
4937 if (car (SCHEME_V->args) != SCHEME_V->inport) 5331 if (car (args) != SCHEME_V->inport)
4938 { 5332 {
4939 x = SCHEME_V->inport; 5333 x = SCHEME_V->inport;
4940 x = cons (x, NIL); 5334 x = cons (x, NIL);
4941 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); 5335 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL);
4942 SCHEME_V->inport = car (SCHEME_V->args); 5336 SCHEME_V->inport = car (args);
4943 } 5337 }
4944 } 5338 }
4945 5339
4946 c = inchar (SCHEME_A); 5340 c = inchar (SCHEME_A);
4947 5341
… …
4957 case OP_CHAR_READY: /* char-ready? */ 5351 case OP_CHAR_READY: /* char-ready? */
4958 { 5352 {
4959 pointer p = SCHEME_V->inport; 5353 pointer p = SCHEME_V->inport;
4960 int res; 5354 int res;
4961 5355
4962 if (is_pair (SCHEME_V->args)) 5356 if (is_pair (args))
4963 p = car (SCHEME_V->args); 5357 p = car (args);
4964 5358
4965 res = p->object.port->kind & port_string; 5359 res = port (p)->kind & port_string;
4966 5360
4967 s_retbool (res); 5361 s_retbool (res);
4968 } 5362 }
4969 5363
4970 case OP_SET_INPORT: /* set-input-port */ 5364 case OP_SET_INPORT: /* set-input-port */
4971 SCHEME_V->inport = car (SCHEME_V->args); 5365 SCHEME_V->inport = car (args);
4972 s_return (SCHEME_V->value); 5366 s_return (SCHEME_V->value);
4973 5367
4974 case OP_SET_OUTPORT: /* set-output-port */ 5368 case OP_SET_OUTPORT: /* set-output-port */
4975 SCHEME_V->outport = car (SCHEME_V->args); 5369 SCHEME_V->outport = car (args);
4976 s_return (SCHEME_V->value); 5370 s_return (SCHEME_V->value);
4977#endif 5371#endif
4978 5372
4979 case OP_RDSEXPR: 5373 case OP_RDSEXPR:
4980 switch (SCHEME_V->tok) 5374 switch (SCHEME_V->tok)
4981 { 5375 {
4982 case TOK_EOF: 5376 case TOK_EOF:
4983 s_return (S_EOF); 5377 s_return (S_EOF);
4984 /* NOTREACHED */
4985 5378
4986 case TOK_VEC: 5379 case TOK_VEC:
4987 s_save (SCHEME_A_ OP_RDVEC, NIL, NIL); 5380 s_save (SCHEME_A_ OP_RDVEC, NIL, NIL);
4988 /* fall through */ 5381 /* fall through */
4989 5382
… …
4992 5385
4993 if (SCHEME_V->tok == TOK_RPAREN) 5386 if (SCHEME_V->tok == TOK_RPAREN)
4994 s_return (NIL); 5387 s_return (NIL);
4995 else if (SCHEME_V->tok == TOK_DOT) 5388 else if (SCHEME_V->tok == TOK_DOT)
4996 Error_0 ("syntax error: illegal dot expression"); 5389 Error_0 ("syntax error: illegal dot expression");
4997 else 5390
4998 {
4999 SCHEME_V->nesting_stack[SCHEME_V->file_i]++; 5391 SCHEME_V->nesting_stack[SCHEME_V->file_i]++;
5000 s_save (SCHEME_A_ OP_RDLIST, NIL, NIL); 5392 s_save (SCHEME_A_ OP_RDLIST, NIL, NIL);
5001 s_goto (OP_RDSEXPR); 5393 s_goto (OP_RDSEXPR);
5002 }
5003 5394
5004 case TOK_QUOTE: 5395 case TOK_QUOTE:
5005 s_save (SCHEME_A_ OP_RDQUOTE, NIL, NIL); 5396 s_save (SCHEME_A_ OP_RDQUOTE, NIL, NIL);
5006 SCHEME_V->tok = token (SCHEME_A); 5397 SCHEME_V->tok = token (SCHEME_A);
5007 s_goto (OP_RDSEXPR); 5398 s_goto (OP_RDSEXPR);
… …
5013 { 5404 {
5014 s_save (SCHEME_A_ OP_RDQQUOTEVEC, NIL, NIL); 5405 s_save (SCHEME_A_ OP_RDQQUOTEVEC, NIL, NIL);
5015 SCHEME_V->tok = TOK_LPAREN; 5406 SCHEME_V->tok = TOK_LPAREN;
5016 s_goto (OP_RDSEXPR); 5407 s_goto (OP_RDSEXPR);
5017 } 5408 }
5018 else 5409
5019 s_save (SCHEME_A_ OP_RDQQUOTE, NIL, NIL); 5410 s_save (SCHEME_A_ OP_RDQQUOTE, NIL, NIL);
5020
5021 s_goto (OP_RDSEXPR); 5411 s_goto (OP_RDSEXPR);
5022 5412
5023 case TOK_COMMA: 5413 case TOK_COMMA:
5024 s_save (SCHEME_A_ OP_RDUNQUOTE, NIL, NIL); 5414 s_save (SCHEME_A_ OP_RDUNQUOTE, NIL, NIL);
5025 SCHEME_V->tok = token (SCHEME_A); 5415 SCHEME_V->tok = token (SCHEME_A);
… …
5029 s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL); 5419 s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL);
5030 SCHEME_V->tok = token (SCHEME_A); 5420 SCHEME_V->tok = token (SCHEME_A);
5031 s_goto (OP_RDSEXPR); 5421 s_goto (OP_RDSEXPR);
5032 5422
5033 case TOK_ATOM: 5423 case TOK_ATOM:
5034 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))); 5424 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS)));
5425
5426 case TOK_DOTATOM:
5427 SCHEME_V->strbuff[0] = '.';
5428 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 1, DELIMITERS)));
5429
5430 case TOK_STRATOM:
5431 //TODO: haven't checked whether the garbage collector could interfere and free x
5432 gc (SCHEME_A_ NIL, NIL); //TODO: superheavyhanded
5433 x = readstrexp (SCHEME_A_ '|');
5434 s_return (mk_atom (SCHEME_A_ strvalue (x)));
5035 5435
5036 case TOK_DQUOTE: 5436 case TOK_DQUOTE:
5037 x = readstrexp (SCHEME_A); 5437 x = readstrexp (SCHEME_A_ '"');
5038 5438
5039 if (x == S_F) 5439 if (x == S_F)
5040 Error_0 ("Error reading string"); 5440 Error_0 ("Error reading string");
5041 5441
5042 setimmutable (x); 5442 setimmutable (x);
… …
5046 { 5446 {
5047 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->SHARP_HOOK, 1); 5447 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->SHARP_HOOK, 1);
5048 5448
5049 if (f == NIL) 5449 if (f == NIL)
5050 Error_0 ("undefined sharp expression"); 5450 Error_0 ("undefined sharp expression");
5051 else 5451
5052 {
5053 SCHEME_V->code = cons (slot_value_in_env (f), NIL); 5452 SCHEME_V->code = cons (slot_value_in_env (f), NIL);
5054 s_goto (OP_EVAL); 5453 s_goto (OP_EVAL);
5055 }
5056 } 5454 }
5057 5455
5058 case TOK_SHARP_CONST: 5456 case TOK_SHARP_CONST:
5059 if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))) == NIL) 5457 if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS))) == NIL)
5060 Error_0 ("undefined sharp expression"); 5458 Error_0 ("undefined sharp expression");
5061 else 5459
5062 s_return (x); 5460 s_return (x);
5063 5461
5064 default: 5462 default:
5065 Error_0 ("syntax error: illegal token"); 5463 Error_0 ("syntax error: illegal token");
5066 } 5464 }
5067 5465
5068 break; 5466 break;
5069 5467
5070 case OP_RDLIST: 5468 case OP_RDLIST:
5071 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 5469 SCHEME_V->args = cons (SCHEME_V->value, args);
5072 SCHEME_V->tok = token (SCHEME_A); 5470 SCHEME_V->tok = token (SCHEME_A);
5073 5471
5074 switch (SCHEME_V->tok) 5472 switch (SCHEME_V->tok)
5075 { 5473 {
5076 case TOK_EOF: 5474 case TOK_EOF:
… …
5104 case OP_RDDOT: 5502 case OP_RDDOT:
5105 if (token (SCHEME_A) != TOK_RPAREN) 5503 if (token (SCHEME_A) != TOK_RPAREN)
5106 Error_0 ("syntax error: illegal dot expression"); 5504 Error_0 ("syntax error: illegal dot expression");
5107 5505
5108 SCHEME_V->nesting_stack[SCHEME_V->file_i]--; 5506 SCHEME_V->nesting_stack[SCHEME_V->file_i]--;
5109 s_return (reverse_in_place (SCHEME_A_ SCHEME_V->value, SCHEME_V->args)); 5507 s_return (reverse_in_place (SCHEME_A_ SCHEME_V->value, args));
5110 5508
5111 case OP_RDQUOTE: 5509 case OP_RDQUOTE:
5112 s_return (cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL))); 5510 s_return (cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL)));
5113 5511
5114 case OP_RDQQUOTE: 5512 case OP_RDQQUOTE:
… …
5136 SCHEME_V->args = SCHEME_V->value; 5534 SCHEME_V->args = SCHEME_V->value;
5137 s_goto (OP_VECTOR); 5535 s_goto (OP_VECTOR);
5138 5536
5139 /* ========== printing part ========== */ 5537 /* ========== printing part ========== */
5140 case OP_P0LIST: 5538 case OP_P0LIST:
5141 if (is_vector (SCHEME_V->args)) 5539 if (is_vector (args))
5142 { 5540 {
5143 putstr (SCHEME_A_ "#("); 5541 putstr (SCHEME_A_ "#(");
5144 SCHEME_V->args = cons (SCHEME_V->args, mk_integer (SCHEME_A_ 0)); 5542 SCHEME_V->args = cons (args, mk_integer (SCHEME_A_ 0));
5145 s_goto (OP_PVECFROM); 5543 s_goto (OP_PVECFROM);
5146 } 5544 }
5147 else if (is_environment (SCHEME_V->args)) 5545 else if (is_environment (args))
5148 { 5546 {
5149 putstr (SCHEME_A_ "#<ENVIRONMENT>"); 5547 putstr (SCHEME_A_ "#<ENVIRONMENT>");
5150 s_return (S_T); 5548 s_return (S_T);
5151 } 5549 }
5152 else if (!is_pair (SCHEME_V->args)) 5550 else if (!is_pair (args))
5153 { 5551 {
5154 printatom (SCHEME_A_ SCHEME_V->args, SCHEME_V->print_flag); 5552 printatom (SCHEME_A_ args, SCHEME_V->print_flag);
5155 s_return (S_T); 5553 s_return (S_T);
5156 }
5157 else if (car (SCHEME_V->args) == SCHEME_V->QUOTE && ok_abbrev (cdr (SCHEME_V->args)))
5158 {
5159 putstr (SCHEME_A_ "'");
5160 SCHEME_V->args = cadr (SCHEME_V->args);
5161 s_goto (OP_P0LIST);
5162 }
5163 else if (car (SCHEME_V->args) == SCHEME_V->QQUOTE && ok_abbrev (cdr (SCHEME_V->args)))
5164 {
5165 putstr (SCHEME_A_ "`");
5166 SCHEME_V->args = cadr (SCHEME_V->args);
5167 s_goto (OP_P0LIST);
5168 }
5169 else if (car (SCHEME_V->args) == SCHEME_V->UNQUOTE && ok_abbrev (cdr (SCHEME_V->args)))
5170 {
5171 putstr (SCHEME_A_ ",");
5172 SCHEME_V->args = cadr (SCHEME_V->args);
5173 s_goto (OP_P0LIST);
5174 }
5175 else if (car (SCHEME_V->args) == SCHEME_V->UNQUOTESP && ok_abbrev (cdr (SCHEME_V->args)))
5176 {
5177 putstr (SCHEME_A_ ",@");
5178 SCHEME_V->args = cadr (SCHEME_V->args);
5179 s_goto (OP_P0LIST);
5180 } 5554 }
5181 else 5555 else
5182 { 5556 {
5557 pointer a = car (args);
5558 pointer b = cdr (args);
5559 int ok_abbr = ok_abbrev (b);
5560 SCHEME_V->args = car (b);
5561
5562 if (a == SCHEME_V->QUOTE && ok_abbr)
5563 putcharacter (SCHEME_A_ '\'');
5564 else if (a == SCHEME_V->QQUOTE && ok_abbr)
5565 putcharacter (SCHEME_A_ '`');
5566 else if (a == SCHEME_V->UNQUOTE && ok_abbr)
5567 putcharacter (SCHEME_A_ ',');
5568 else if (a == SCHEME_V->UNQUOTESP && ok_abbr)
5183 putstr (SCHEME_A_ "("); 5569 putstr (SCHEME_A_ ",@");
5570 else
5571 {
5572 putcharacter (SCHEME_A_ '(');
5184 s_save (SCHEME_A_ OP_P1LIST, cdr (SCHEME_V->args), NIL); 5573 s_save (SCHEME_A_ OP_P1LIST, b, NIL);
5185 SCHEME_V->args = car (SCHEME_V->args); 5574 SCHEME_V->args = a;
5575 }
5576
5186 s_goto (OP_P0LIST); 5577 s_goto (OP_P0LIST);
5187 } 5578 }
5188 5579
5189 case OP_P1LIST: 5580 case OP_P1LIST:
5190 if (is_pair (SCHEME_V->args)) 5581 if (is_pair (args))
5191 { 5582 {
5192 s_save (SCHEME_A_ OP_P1LIST, cdr (SCHEME_V->args), NIL); 5583 s_save (SCHEME_A_ OP_P1LIST, cdr (args), NIL);
5193 putstr (SCHEME_A_ " "); 5584 putcharacter (SCHEME_A_ ' ');
5194 SCHEME_V->args = car (SCHEME_V->args); 5585 SCHEME_V->args = car (args);
5195 s_goto (OP_P0LIST); 5586 s_goto (OP_P0LIST);
5196 } 5587 }
5197 else if (is_vector (SCHEME_V->args)) 5588 else if (is_vector (args))
5198 { 5589 {
5199 s_save (SCHEME_A_ OP_P1LIST, NIL, NIL); 5590 s_save (SCHEME_A_ OP_P1LIST, NIL, NIL);
5200 putstr (SCHEME_A_ " . "); 5591 putstr (SCHEME_A_ " . ");
5201 s_goto (OP_P0LIST); 5592 s_goto (OP_P0LIST);
5202 } 5593 }
5203 else 5594 else
5204 { 5595 {
5205 if (SCHEME_V->args != NIL) 5596 if (args != NIL)
5206 { 5597 {
5207 putstr (SCHEME_A_ " . "); 5598 putstr (SCHEME_A_ " . ");
5208 printatom (SCHEME_A_ SCHEME_V->args, SCHEME_V->print_flag); 5599 printatom (SCHEME_A_ args, SCHEME_V->print_flag);
5209 } 5600 }
5210 5601
5211 putstr (SCHEME_A_ ")"); 5602 putcharacter (SCHEME_A_ ')');
5212 s_return (S_T); 5603 s_return (S_T);
5213 } 5604 }
5214 5605
5215 case OP_PVECFROM: 5606 case OP_PVECFROM:
5216 { 5607 {
5217 int i = ivalue_unchecked (cdr (SCHEME_V->args)); 5608 IVALUE i = ivalue_unchecked (cdr (args));
5218 pointer vec = car (SCHEME_V->args); 5609 pointer vec = car (args);
5219 int len = veclength (vec); 5610 uint32_t len = veclength (vec);
5220 5611
5221 if (i == len) 5612 if (i == len)
5222 { 5613 {
5223 putstr (SCHEME_A_ ")"); 5614 putcharacter (SCHEME_A_ ')');
5224 s_return (S_T); 5615 s_return (S_T);
5225 } 5616 }
5226 else 5617 else
5227 { 5618 {
5228 pointer elem = vector_elem (vec, i); 5619 pointer elem = vector_get (vec, i);
5229 5620
5230 ivalue_unchecked (cdr (SCHEME_V->args)) = i + 1; 5621 set_cdr (args, mk_integer (SCHEME_A_ i + 1));
5231 s_save (SCHEME_A_ OP_PVECFROM, SCHEME_V->args, NIL); 5622 s_save (SCHEME_A_ OP_PVECFROM, args, NIL);
5232 SCHEME_V->args = elem; 5623 SCHEME_V->args = elem;
5233 5624
5234 if (i > 0) 5625 if (i > 0)
5235 putstr (SCHEME_A_ " "); 5626 putcharacter (SCHEME_A_ ' ');
5236 5627
5237 s_goto (OP_P0LIST); 5628 s_goto (OP_P0LIST);
5238 } 5629 }
5239 } 5630 }
5240 } 5631 }
5241 5632
5242 abort (); 5633 if (USE_ERROR_CHECKING) abort ();
5243} 5634}
5244 5635
5245static pointer 5636/* list ops */
5637ecb_hot static int
5246opexe_6 (SCHEME_P_ enum scheme_opcodes op) 5638opexe_6 (SCHEME_P_ enum scheme_opcodes op)
5247{ 5639{
5640 pointer args = SCHEME_V->args;
5641 pointer a = car (args);
5248 pointer x, y; 5642 pointer x, y;
5249 5643
5250 switch (op) 5644 switch (op)
5251 { 5645 {
5252 case OP_LIST_LENGTH: /* length *//* a.k */ 5646 case OP_LIST_LENGTH: /* length *//* a.k */
5253 { 5647 {
5254 long v = list_length (SCHEME_A_ car (SCHEME_V->args)); 5648 long v = list_length (SCHEME_A_ a);
5255 5649
5256 if (v < 0) 5650 if (v < 0)
5257 Error_1 ("length: not a list:", car (SCHEME_V->args)); 5651 Error_1 ("length: not a list:", a);
5258 5652
5259 s_return (mk_integer (SCHEME_A_ v)); 5653 s_return (mk_integer (SCHEME_A_ v));
5260 } 5654 }
5261 5655
5262 case OP_ASSQ: /* assq *//* a.k */ 5656 case OP_ASSQ: /* assq *//* a.k */
5263 x = car (SCHEME_V->args); 5657 x = a;
5264 5658
5265 for (y = cadr (SCHEME_V->args); is_pair (y); y = cdr (y)) 5659 for (y = cadr (args); is_pair (y); y = cdr (y))
5266 { 5660 {
5267 if (!is_pair (car (y))) 5661 if (!is_pair (car (y)))
5268 Error_0 ("unable to handle non pair element"); 5662 Error_0 ("unable to handle non pair element");
5269 5663
5270 if (x == caar (y)) 5664 if (x == caar (y))
5271 break; 5665 break;
5272 } 5666 }
5273 5667
5274 if (is_pair (y)) 5668 if (is_pair (y))
5275 s_return (car (y)); 5669 s_return (car (y));
5276 else 5670
5277 s_return (S_F); 5671 s_return (S_F);
5278
5279 5672
5280 case OP_GET_CLOSURE: /* get-closure-code *//* a.k */ 5673 case OP_GET_CLOSURE: /* get-closure-code *//* a.k */
5281 SCHEME_V->args = car (SCHEME_V->args); 5674 SCHEME_V->args = a;
5282 5675
5283 if (SCHEME_V->args == NIL) 5676 if (SCHEME_V->args == NIL)
5284 s_return (S_F); 5677 s_return (S_F);
5285 else if (is_closure (SCHEME_V->args)) 5678 else if (is_closure (SCHEME_V->args) || is_macro (SCHEME_V->args))
5286 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value))); 5679 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value)));
5287 else if (is_macro (SCHEME_V->args)) 5680
5288 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value)));
5289 else
5290 s_return (S_F); 5681 s_return (S_F);
5291 5682
5292 case OP_CLOSUREP: /* closure? */ 5683 case OP_CLOSUREP: /* closure? */
5293 /* 5684 /*
5294 * Note, macro object is also a closure. 5685 * Note, macro object is also a closure.
5295 * Therefore, (closure? <#MACRO>) ==> #t 5686 * Therefore, (closure? <#MACRO>) ==> #t
5687 * (schmorp) well, obviously not, fix? TODO
5296 */ 5688 */
5297 s_retbool (is_closure (car (SCHEME_V->args))); 5689 s_retbool (is_closure (a));
5298 5690
5299 case OP_MACROP: /* macro? */ 5691 case OP_MACROP: /* macro? */
5300 s_retbool (is_macro (car (SCHEME_V->args))); 5692 s_retbool (is_macro (a));
5301 } 5693 }
5302 5694
5303 abort (); 5695 if (USE_ERROR_CHECKING) abort ();
5304} 5696}
5305 5697
5698/* dispatch functions (opexe_x) return new opcode, or 0 for same opcode, or -1 to stop */
5306typedef pointer (*dispatch_func) (SCHEME_P_ enum scheme_opcodes); 5699typedef int (*dispatch_func)(SCHEME_P_ enum scheme_opcodes);
5307 5700
5308typedef int (*test_predicate) (pointer); 5701typedef int (*test_predicate)(pointer);
5309static int 5702
5703ecb_hot static int
5310is_any (pointer p) 5704tst_any (pointer p)
5311{ 5705{
5312 return 1; 5706 return 1;
5313} 5707}
5314 5708
5315static int 5709ecb_hot static int
5316is_nonneg (pointer p) 5710tst_inonneg (pointer p)
5317{ 5711{
5318 return ivalue (p) >= 0 && is_integer (p); 5712 return is_integer (p) && ivalue_unchecked (p) >= 0;
5713}
5714
5715ecb_hot static int
5716tst_is_list (SCHEME_P_ pointer p)
5717{
5718 return p == NIL || is_pair (p);
5319} 5719}
5320 5720
5321/* Correspond carefully with following defines! */ 5721/* Correspond carefully with following defines! */
5322static struct 5722static struct
5323{ 5723{
5324 test_predicate fct; 5724 test_predicate fct;
5325 const char *kind; 5725 const char *kind;
5326} tests[] = 5726} tests[] = {
5327{ 5727 { tst_any , 0 },
5328 { 0, 0}, /* unused */ 5728 { is_string , "string" },
5329 { is_any, 0}, 5729 { is_symbol , "symbol" },
5330 { is_string, "string" }, 5730 { is_port , "port" },
5331 { is_symbol, "symbol" },
5332 { is_port, "port" },
5333 { is_inport, "input port" }, 5731 { is_inport , "input port" },
5334 { is_outport, "output port" }, 5732 { is_outport , "output port" },
5335 { is_environment, "environment" }, 5733 { is_environment, "environment" },
5336 { is_pair, "pair" }, 5734 { is_pair , "pair" },
5337 { 0, "pair or '()" }, 5735 { 0 , "pair or '()" },
5338 { is_character, "character" }, 5736 { is_character , "character" },
5339 { is_vector, "vector" }, 5737 { is_vector , "vector" },
5340 { is_number, "number" }, 5738 { is_number , "number" },
5341 { is_integer, "integer" }, 5739 { is_integer , "integer" },
5342 { is_nonneg, "non-negative integer" } 5740 { tst_inonneg , "non-negative integer" }
5343}; 5741};
5344 5742
5345#define TST_NONE 0 5743#define TST_NONE 0 /* TST_NONE used for built-ins, 0 for internal ops */
5346#define TST_ANY "\001" 5744#define TST_ANY "\001"
5347#define TST_STRING "\002" 5745#define TST_STRING "\002"
5348#define TST_SYMBOL "\003" 5746#define TST_SYMBOL "\003"
5349#define TST_PORT "\004" 5747#define TST_PORT "\004"
5350#define TST_INPORT "\005" 5748#define TST_INPORT "\005"
5351#define TST_OUTPORT "\006" 5749#define TST_OUTPORT "\006"
5352#define TST_ENVIRONMENT "\007" 5750#define TST_ENVIRONMENT "\007"
5353#define TST_PAIR "\010" 5751#define TST_PAIR "\010"
5354#define TST_LIST "\011" 5752#define TST_LIST "\011"
5355#define TST_CHAR "\012" 5753#define TST_CHAR "\012"
5356#define TST_VECTOR "\013" 5754#define TST_VECTOR "\013"
5357#define TST_NUMBER "\014" 5755#define TST_NUMBER "\014"
5358#define TST_INTEGER "\015" 5756#define TST_INTEGER "\015"
5359#define TST_NATURAL "\016" 5757#define TST_NATURAL "\016"
5758
5759#define INF_ARG 0xff
5760#define UNNAMED_OP ""
5761
5762static const char opnames[] =
5763#define OP_DEF(func,name,minarity,maxarity,argtest,op) name "\x00"
5764#include "opdefines.h"
5765#undef OP_DEF
5766;
5767
5768ecb_cold static const char *
5769opname (int idx)
5770{
5771 const char *name = opnames;
5772
5773 /* should do this at compile time, but would require external program, right? */
5774 while (idx--)
5775 name += strlen (name) + 1;
5776
5777 return *name ? name : "ILLEGAL";
5778}
5779
5780ecb_cold static const char *
5781procname (pointer x)
5782{
5783 return opname (procnum (x));
5784}
5360 5785
5361typedef struct 5786typedef struct
5362{ 5787{
5363 dispatch_func func; 5788 uint8_t func;
5364 char *name; 5789 /*dispatch_func func;*//*TODO: maybe optionally keep the pointer, for speed? */
5790 uint8_t builtin;
5791#if USE_ERROR_CHECKING
5365 int min_arity; 5792 uint8_t min_arity;
5366 int max_arity; 5793 uint8_t max_arity;
5367 char *arg_tests_encoding; 5794 char arg_tests_encoding[3];
5795#endif
5368} op_code_info; 5796} op_code_info;
5369 5797
5370#define INF_ARG 0xffff
5371
5372static op_code_info dispatch_table[] = { 5798static const op_code_info dispatch_table[] = {
5373#define OP_DEF(A,B,C,D,E,OP) {A,B,C,D,E}, 5799#if USE_ERROR_CHECKING
5800#define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1, minarity, maxarity, argtest },
5801#else
5802#define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1 },
5803#endif
5374#include "opdefines.h" 5804#include "opdefines.h"
5805#undef OP_DEF
5375 {0} 5806 {0}
5376}; 5807};
5377 5808
5378static const char *
5379procname (pointer x)
5380{
5381 int n = procnum (x);
5382 const char *name = dispatch_table[n].name;
5383
5384 if (name == 0)
5385 name = "ILLEGAL!";
5386
5387 return name;
5388}
5389
5390/* kernel of this interpreter */ 5809/* kernel of this interpreter */
5391static void 5810ecb_hot static void
5392Eval_Cycle (SCHEME_P_ enum scheme_opcodes op) 5811Eval_Cycle (SCHEME_P_ enum scheme_opcodes op)
5393{ 5812{
5394 SCHEME_V->op = op; 5813 SCHEME_V->op = op;
5395 5814
5396 for (;;) 5815 for (;;)
5397 { 5816 {
5398 op_code_info *pcd = dispatch_table + SCHEME_V->op; 5817 const op_code_info *pcd = dispatch_table + SCHEME_V->op;
5399 5818
5400#if USE_ERROR_CHECKING 5819#if USE_ERROR_CHECKING
5401 if (pcd->name) /* if built-in function, check arguments */ 5820 if (pcd->builtin) /* if built-in function, check arguments */
5402 { 5821 {
5403 int ok = 1;
5404 char msg[STRBUFFSIZE]; 5822 char msg[STRBUFFSIZE];
5405 int n = list_length (SCHEME_A_ SCHEME_V->args); 5823 int n = list_length (SCHEME_A_ SCHEME_V->args);
5406 5824
5407 /* Check number of arguments */ 5825 /* Check number of arguments */
5408 if (ecb_expect_false (n < pcd->min_arity)) 5826 if (ecb_expect_false (n < pcd->min_arity))
5409 { 5827 {
5410 ok = 0;
5411 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", 5828 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)",
5412 pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity); 5829 opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity);
5830 xError_1 (SCHEME_A_ msg, 0);
5831 continue;
5413 } 5832 }
5414 else if (ecb_expect_false (n > pcd->max_arity)) 5833 else if (ecb_expect_false (n > pcd->max_arity && pcd->max_arity != INF_ARG))
5415 { 5834 {
5416 ok = 0;
5417 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", 5835 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)",
5418 pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity); 5836 opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity);
5837 xError_1 (SCHEME_A_ msg, 0);
5838 continue;
5419 } 5839 }
5420 5840 else
5421 if (ecb_expect_false (ok))
5422 { 5841 {
5423 if (pcd->arg_tests_encoding) 5842 if (*pcd->arg_tests_encoding) /* literal 0 and TST_NONE treated the same */
5424 { 5843 {
5425 int i = 0; 5844 int i = 0;
5426 int j; 5845 int j;
5427 const char *t = pcd->arg_tests_encoding; 5846 const char *t = pcd->arg_tests_encoding;
5428 pointer arglist = SCHEME_V->args; 5847 pointer arglist = SCHEME_V->args;
5429 5848
5430 do 5849 do
5431 { 5850 {
5432 pointer arg = car (arglist); 5851 pointer arg = car (arglist);
5433 5852
5434 j = (int) t[0]; 5853 j = t[0];
5435 5854
5855 /*TODO: tst_is_list has different prototype - fix if other tests acquire same prototype */
5436 if (j == TST_LIST[0]) 5856 if (j == TST_LIST[0])
5437 { 5857 {
5438 if (arg != NIL && !is_pair (arg)) 5858 if (!tst_is_list (SCHEME_A_ arg))
5439 break; 5859 break;
5440 } 5860 }
5441 else 5861 else
5442 { 5862 {
5443 if (!tests[j].fct (arg)) 5863 if (!tests[j - 1].fct (arg))
5444 break; 5864 break;
5445 } 5865 }
5446 5866
5447 if (t[1] != 0) /* last test is replicated as necessary */ 5867 if (t < pcd->arg_tests_encoding + sizeof (pcd->arg_tests_encoding) - 1 && t[1]) /* last test is replicated as necessary */
5448 t++; 5868 t++;
5449 5869
5450 arglist = cdr (arglist); 5870 arglist = cdr (arglist);
5451 i++; 5871 i++;
5452 } 5872 }
5453 while (i < n); 5873 while (i < n);
5454 5874
5455 if (i < n) 5875 if (i < n)
5456 { 5876 {
5457 ok = 0;
5458 snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", pcd->name, i + 1, tests[j].kind); 5877 snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", opname (SCHEME_V->op), i + 1, tests[j].kind);
5878 xError_1 (SCHEME_A_ msg, 0);
5879 continue;
5459 } 5880 }
5460 } 5881 }
5461 } 5882 }
5462
5463 if (!ok)
5464 {
5465 if (xError_1 (SCHEME_A_ msg, 0) == NIL)
5466 return;
5467
5468 pcd = dispatch_table + SCHEME_V->op;
5469 }
5470 } 5883 }
5471#endif 5884#endif
5472 5885
5473 ok_to_freely_gc (SCHEME_A); 5886 ok_to_freely_gc (SCHEME_A);
5474 5887
5888 static const dispatch_func dispatch_funcs[] = {
5889 opexe_0,
5890 opexe_1,
5891 opexe_2,
5892 opexe_3,
5893 opexe_4,
5894 opexe_5,
5895 opexe_6,
5896 };
5897
5475 if (ecb_expect_false (pcd->func (SCHEME_A_ SCHEME_V->op) == NIL)) 5898 if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0))
5476 return; 5899 return;
5477 5900
5478 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 5901 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
5479 { 5902 {
5480 xwrstr ("No memory!\n"); 5903 putstr (SCHEME_A_ "No memory!\n");
5481 return; 5904 return;
5482 } 5905 }
5483 } 5906 }
5484} 5907}
5485 5908
5486/* ========== Initialization of internal keywords ========== */ 5909/* ========== Initialization of internal keywords ========== */
5487 5910
5488static void 5911ecb_cold static void
5489assign_syntax (SCHEME_P_ const char *name) 5912assign_syntax (SCHEME_P_ const char *name)
5490{ 5913{
5491 pointer x = oblist_add_by_name (SCHEME_A_ name); 5914 pointer x = oblist_add_by_name (SCHEME_A_ name);
5492 set_typeflag (x, typeflag (x) | T_SYNTAX); 5915 set_typeflag (x, typeflag (x) | T_SYNTAX);
5493} 5916}
5494 5917
5495static void 5918ecb_cold static void
5496assign_proc (SCHEME_P_ enum scheme_opcodes op, const char *name) 5919assign_proc (SCHEME_P_ enum scheme_opcodes op, const char *name)
5497{ 5920{
5498 pointer x = mk_symbol (SCHEME_A_ name); 5921 pointer x = mk_symbol (SCHEME_A_ name);
5499 pointer y = mk_proc (SCHEME_A_ op); 5922 pointer y = mk_proc (SCHEME_A_ op);
5500 new_slot_in_env (SCHEME_A_ x, y); 5923 new_slot_in_env (SCHEME_A_ x, y);
… …
5503static pointer 5926static pointer
5504mk_proc (SCHEME_P_ enum scheme_opcodes op) 5927mk_proc (SCHEME_P_ enum scheme_opcodes op)
5505{ 5928{
5506 pointer y = get_cell (SCHEME_A_ NIL, NIL); 5929 pointer y = get_cell (SCHEME_A_ NIL, NIL);
5507 set_typeflag (y, (T_PROC | T_ATOM)); 5930 set_typeflag (y, (T_PROC | T_ATOM));
5508 ivalue_unchecked (y) = op; 5931 set_ivalue (y, op);
5509 set_num_integer (y);
5510 return y; 5932 return y;
5511} 5933}
5512 5934
5513/* Hard-coded for the given keywords. Remember to rewrite if more are added! */ 5935/* Hard-coded for the given keywords. Remember to rewrite if more are added! */
5514static int 5936ecb_hot static int
5515syntaxnum (pointer p) 5937syntaxnum (pointer p)
5516{ 5938{
5517 const char *s = strvalue (car (p)); 5939 const char *s = strvalue (p);
5518 5940
5519 switch (strlength (car (p))) 5941 switch (strlength (p))
5520 { 5942 {
5521 case 2: 5943 case 2:
5522 if (s[0] == 'i') 5944 if (s[0] == 'i')
5523 return OP_IF0; /* if */ 5945 return OP_IF0; /* if */
5524 else 5946 else
… …
5579 return OP_C0STREAM; /* cons-stream */ 6001 return OP_C0STREAM; /* cons-stream */
5580 } 6002 }
5581} 6003}
5582 6004
5583#if USE_MULTIPLICITY 6005#if USE_MULTIPLICITY
5584scheme * 6006ecb_cold scheme *
5585scheme_init_new () 6007scheme_init_new ()
5586{ 6008{
5587 scheme *sc = malloc (sizeof (scheme)); 6009 scheme *sc = malloc (sizeof (scheme));
5588 6010
5589 if (!scheme_init (SCHEME_A)) 6011 if (!scheme_init (SCHEME_A))
… …
5594 else 6016 else
5595 return sc; 6017 return sc;
5596} 6018}
5597#endif 6019#endif
5598 6020
5599int 6021ecb_cold int
5600scheme_init (SCHEME_P) 6022scheme_init (SCHEME_P)
5601{ 6023{
5602 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]); 6024 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]);
5603 pointer x; 6025
6026 /* this memset is not strictly correct, as we assume (intcache)
6027 * that memset 0 will also set pointers to 0, but memset does
6028 * of course not guarantee that. screw such systems.
6029 */
6030 memset (SCHEME_V, 0, sizeof (*SCHEME_V));
5604 6031
5605 num_set_fixnum (num_zero, 1); 6032 num_set_fixnum (num_zero, 1);
5606 num_set_ivalue (num_zero, 0); 6033 num_set_ivalue (num_zero, 0);
5607 num_set_fixnum (num_one, 1); 6034 num_set_fixnum (num_one, 1);
5608 num_set_ivalue (num_one, 1); 6035 num_set_ivalue (num_one, 1);
… …
5620 SCHEME_V->save_inport = NIL; 6047 SCHEME_V->save_inport = NIL;
5621 SCHEME_V->loadport = NIL; 6048 SCHEME_V->loadport = NIL;
5622 SCHEME_V->nesting = 0; 6049 SCHEME_V->nesting = 0;
5623 SCHEME_V->interactive_repl = 0; 6050 SCHEME_V->interactive_repl = 0;
5624 6051
5625 if (alloc_cellseg (SCHEME_A_ FIRST_CELLSEGS) != FIRST_CELLSEGS) 6052 if (!alloc_cellseg (SCHEME_A))
5626 { 6053 {
5627#if USE_ERROR_CHECKING 6054#if USE_ERROR_CHECKING
5628 SCHEME_V->no_memory = 1; 6055 SCHEME_V->no_memory = 1;
5629 return 0; 6056 return 0;
5630#endif 6057#endif
5631 } 6058 }
5632 6059
5633 SCHEME_V->gc_verbose = 0; 6060 SCHEME_V->gc_verbose = 0;
5634 dump_stack_initialize (SCHEME_A); 6061 dump_stack_initialize (SCHEME_A);
5635 SCHEME_V->code = NIL; 6062 SCHEME_V->code = NIL;
5636 SCHEME_V->args = NIL; 6063 SCHEME_V->args = NIL;
5637 SCHEME_V->envir = NIL; 6064 SCHEME_V->envir = NIL;
6065 SCHEME_V->value = NIL;
5638 SCHEME_V->tracing = 0; 6066 SCHEME_V->tracing = 0;
5639 6067
5640 /* init NIL */ 6068 /* init NIL */
5641 set_typeflag (NIL, T_ATOM | T_MARK); 6069 set_typeflag (NIL, T_SPECIAL | T_ATOM);
5642 set_car (NIL, NIL); 6070 set_car (NIL, NIL);
5643 set_cdr (NIL, NIL); 6071 set_cdr (NIL, NIL);
5644 /* init T */ 6072 /* init T */
5645 set_typeflag (S_T, T_ATOM | T_MARK); 6073 set_typeflag (S_T, T_SPECIAL | T_ATOM);
5646 set_car (S_T, S_T); 6074 set_car (S_T, S_T);
5647 set_cdr (S_T, S_T); 6075 set_cdr (S_T, S_T);
5648 /* init F */ 6076 /* init F */
5649 set_typeflag (S_F, T_ATOM | T_MARK); 6077 set_typeflag (S_F, T_SPECIAL | T_ATOM);
5650 set_car (S_F, S_F); 6078 set_car (S_F, S_F);
5651 set_cdr (S_F, S_F); 6079 set_cdr (S_F, S_F);
5652 /* init EOF_OBJ */ 6080 /* init EOF_OBJ */
5653 set_typeflag (S_EOF, T_ATOM | T_MARK); 6081 set_typeflag (S_EOF, T_SPECIAL | T_ATOM);
5654 set_car (S_EOF, S_EOF); 6082 set_car (S_EOF, S_EOF);
5655 set_cdr (S_EOF, S_EOF); 6083 set_cdr (S_EOF, S_EOF);
5656 /* init sink */ 6084 /* init sink */
5657 set_typeflag (S_SINK, T_PAIR | T_MARK); 6085 set_typeflag (S_SINK, T_PAIR);
5658 set_car (S_SINK, NIL); 6086 set_car (S_SINK, NIL);
5659 6087
5660 /* init c_nest */ 6088 /* init c_nest */
5661 SCHEME_V->c_nest = NIL; 6089 SCHEME_V->c_nest = NIL;
5662 6090
5663 SCHEME_V->oblist = oblist_initial_value (SCHEME_A); 6091 SCHEME_V->oblist = oblist_initial_value (SCHEME_A);
5664 /* init global_env */ 6092 /* init global_env */
5665 new_frame_in_env (SCHEME_A_ NIL); 6093 new_frame_in_env (SCHEME_A_ NIL);
5666 SCHEME_V->global_env = SCHEME_V->envir; 6094 SCHEME_V->global_env = SCHEME_V->envir;
5667 /* init else */ 6095 /* init else */
5668 x = mk_symbol (SCHEME_A_ "else"); 6096 new_slot_in_env (SCHEME_A_ mk_symbol (SCHEME_A_ "else"), S_T);
5669 new_slot_in_env (SCHEME_A_ x, S_T);
5670 6097
5671 { 6098 {
5672 static const char *syntax_names[] = { 6099 static const char *syntax_names[] = {
5673 "lambda", "quote", "define", "if", "begin", "set!", 6100 "lambda", "quote", "define", "if", "begin", "set!",
5674 "let", "let*", "letrec", "cond", "delay", "and", 6101 "let", "let*", "letrec", "cond", "delay", "and",
… …
5677 6104
5678 for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i) 6105 for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i)
5679 assign_syntax (SCHEME_A_ syntax_names[i]); 6106 assign_syntax (SCHEME_A_ syntax_names[i]);
5680 } 6107 }
5681 6108
6109 // TODO: should iterate via strlen, to avoid n² complexity
5682 for (i = 0; i < n; i++) 6110 for (i = 0; i < n; i++)
5683 if (dispatch_table[i].name != 0) 6111 if (dispatch_table[i].builtin)
5684 assign_proc (SCHEME_A_ i, dispatch_table[i].name); 6112 assign_proc (SCHEME_A_ i, opname (i));
5685 6113
5686 /* initialization of global pointers to special symbols */ 6114 /* initialization of global pointers to special symbols */
5687 SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda"); 6115 SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda");
5688 SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote"); 6116 SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote");
5689 SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote"); 6117 SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote");
… …
5697 6125
5698 return !SCHEME_V->no_memory; 6126 return !SCHEME_V->no_memory;
5699} 6127}
5700 6128
5701#if USE_PORTS 6129#if USE_PORTS
5702void 6130ecb_cold void
5703scheme_set_input_port_file (SCHEME_P_ int fin) 6131scheme_set_input_port_file (SCHEME_P_ int fin)
5704{ 6132{
5705 SCHEME_V->inport = port_from_file (SCHEME_A_ fin, port_input); 6133 SCHEME_V->inport = port_from_file (SCHEME_A_ fin, port_input);
5706} 6134}
5707 6135
5708void 6136ecb_cold void
5709scheme_set_input_port_string (SCHEME_P_ char *start, char *past_the_end) 6137scheme_set_input_port_string (SCHEME_P_ char *start, char *past_the_end)
5710{ 6138{
5711 SCHEME_V->inport = port_from_string (SCHEME_A_ start, past_the_end, port_input); 6139 SCHEME_V->inport = port_from_string (SCHEME_A_ start, past_the_end, port_input);
5712} 6140}
5713 6141
5714void 6142ecb_cold void
5715scheme_set_output_port_file (SCHEME_P_ int fout) 6143scheme_set_output_port_file (SCHEME_P_ int fout)
5716{ 6144{
5717 SCHEME_V->outport = port_from_file (SCHEME_A_ fout, port_output); 6145 SCHEME_V->outport = port_from_file (SCHEME_A_ fout, port_output);
5718} 6146}
5719 6147
5720void 6148ecb_cold void
5721scheme_set_output_port_string (SCHEME_P_ char *start, char *past_the_end) 6149scheme_set_output_port_string (SCHEME_P_ char *start, char *past_the_end)
5722{ 6150{
5723 SCHEME_V->outport = port_from_string (SCHEME_A_ start, past_the_end, port_output); 6151 SCHEME_V->outport = port_from_string (SCHEME_A_ start, past_the_end, port_output);
5724} 6152}
5725#endif 6153#endif
5726 6154
5727void 6155ecb_cold void
5728scheme_set_external_data (SCHEME_P_ void *p) 6156scheme_set_external_data (SCHEME_P_ void *p)
5729{ 6157{
5730 SCHEME_V->ext_data = p; 6158 SCHEME_V->ext_data = p;
5731} 6159}
5732 6160
5733void 6161ecb_cold void
5734scheme_deinit (SCHEME_P) 6162scheme_deinit (SCHEME_P)
5735{ 6163{
5736 int i; 6164 int i;
5737 6165
5738#if SHOW_ERROR_LINE 6166#if SHOW_ERROR_LINE
… …
5764 SCHEME_V->loadport = NIL; 6192 SCHEME_V->loadport = NIL;
5765 SCHEME_V->gc_verbose = 0; 6193 SCHEME_V->gc_verbose = 0;
5766 gc (SCHEME_A_ NIL, NIL); 6194 gc (SCHEME_A_ NIL, NIL);
5767 6195
5768 for (i = 0; i <= SCHEME_V->last_cell_seg; i++) 6196 for (i = 0; i <= SCHEME_V->last_cell_seg; i++)
5769 free (SCHEME_V->alloc_seg[i]); 6197 free (SCHEME_V->cell_seg[i]);
5770 6198
5771#if SHOW_ERROR_LINE 6199#if SHOW_ERROR_LINE
5772 for (i = 0; i <= SCHEME_V->file_i; i++) 6200 for (i = 0; i <= SCHEME_V->file_i; i++)
5773 {
5774 if (SCHEME_V->load_stack[i].kind & port_file) 6201 if (SCHEME_V->load_stack[i].kind & port_file)
5775 { 6202 {
5776 fname = SCHEME_V->load_stack[i].rep.stdio.filename; 6203 fname = SCHEME_V->load_stack[i].rep.stdio.filename;
5777 6204
5778 if (fname) 6205 if (fname)
5779 free (fname); 6206 free (fname);
5780 } 6207 }
5781 }
5782#endif 6208#endif
5783} 6209}
5784 6210
5785void 6211ecb_cold void
5786scheme_load_file (SCHEME_P_ int fin) 6212scheme_load_file (SCHEME_P_ int fin)
5787{ 6213{
5788 scheme_load_named_file (SCHEME_A_ fin, 0); 6214 scheme_load_named_file (SCHEME_A_ fin, 0);
5789} 6215}
5790 6216
5791void 6217ecb_cold void
5792scheme_load_named_file (SCHEME_P_ int fin, const char *filename) 6218scheme_load_named_file (SCHEME_P_ int fin, const char *filename)
5793{ 6219{
5794 dump_stack_reset (SCHEME_A); 6220 dump_stack_reset (SCHEME_A);
5795 SCHEME_V->envir = SCHEME_V->global_env; 6221 SCHEME_V->envir = SCHEME_V->global_env;
5796 SCHEME_V->file_i = 0; 6222 SCHEME_V->file_i = 0;
5797 SCHEME_V->load_stack[0].unget = -1; 6223 SCHEME_V->load_stack[0].unget = -1;
5798 SCHEME_V->load_stack[0].kind = port_input | port_file; 6224 SCHEME_V->load_stack[0].kind = port_input | port_file;
5799 SCHEME_V->load_stack[0].rep.stdio.file = fin; 6225 SCHEME_V->load_stack[0].rep.stdio.file = fin;
5800#if USE_PORTS
5801 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack); 6226 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack);
5802#endif
5803 SCHEME_V->retcode = 0; 6227 SCHEME_V->retcode = 0;
5804 6228
5805#if USE_PORTS
5806 if (fin == STDIN_FILENO) 6229 if (fin == STDIN_FILENO)
5807 SCHEME_V->interactive_repl = 1; 6230 SCHEME_V->interactive_repl = 1;
5808#endif
5809 6231
5810#if USE_PORTS 6232#if USE_PORTS
5811#if SHOW_ERROR_LINE 6233#if SHOW_ERROR_LINE
5812 SCHEME_V->load_stack[0].rep.stdio.curr_line = 0; 6234 SCHEME_V->load_stack[0].rep.stdio.curr_line = 0;
5813 6235
… …
5817#endif 6239#endif
5818 6240
5819 SCHEME_V->inport = SCHEME_V->loadport; 6241 SCHEME_V->inport = SCHEME_V->loadport;
5820 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i); 6242 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i);
5821 Eval_Cycle (SCHEME_A_ OP_T0LVL); 6243 Eval_Cycle (SCHEME_A_ OP_T0LVL);
6244
5822 set_typeflag (SCHEME_V->loadport, T_ATOM); 6245 set_typeflag (SCHEME_V->loadport, T_ATOM);
5823 6246
5824 if (SCHEME_V->retcode == 0) 6247 if (SCHEME_V->retcode == 0)
5825 SCHEME_V->retcode = SCHEME_V->nesting != 0; 6248 SCHEME_V->retcode = SCHEME_V->nesting != 0;
5826} 6249}
5827 6250
5828void 6251ecb_cold void
5829scheme_load_string (SCHEME_P_ const char *cmd) 6252scheme_load_string (SCHEME_P_ const char *cmd)
5830{ 6253{
6254#if USE_PORTs
5831 dump_stack_reset (SCHEME_A); 6255 dump_stack_reset (SCHEME_A);
5832 SCHEME_V->envir = SCHEME_V->global_env; 6256 SCHEME_V->envir = SCHEME_V->global_env;
5833 SCHEME_V->file_i = 0; 6257 SCHEME_V->file_i = 0;
5834 SCHEME_V->load_stack[0].kind = port_input | port_string; 6258 SCHEME_V->load_stack[0].kind = port_input | port_string;
5835 SCHEME_V->load_stack[0].rep.string.start = (char *)cmd; /* This func respects const */ 6259 SCHEME_V->load_stack[0].rep.string.start = (char *)cmd; /* This func respects const */
5836 SCHEME_V->load_stack[0].rep.string.past_the_end = (char *)cmd + strlen (cmd); 6260 SCHEME_V->load_stack[0].rep.string.past_the_end = (char *)cmd + strlen (cmd);
5837 SCHEME_V->load_stack[0].rep.string.curr = (char *)cmd; 6261 SCHEME_V->load_stack[0].rep.string.curr = (char *)cmd;
5838#if USE_PORTS
5839 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack); 6262 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack);
5840#endif
5841 SCHEME_V->retcode = 0; 6263 SCHEME_V->retcode = 0;
5842 SCHEME_V->interactive_repl = 0; 6264 SCHEME_V->interactive_repl = 0;
5843 SCHEME_V->inport = SCHEME_V->loadport; 6265 SCHEME_V->inport = SCHEME_V->loadport;
5844 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i); 6266 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i);
5845 Eval_Cycle (SCHEME_A_ OP_T0LVL); 6267 Eval_Cycle (SCHEME_A_ OP_T0LVL);
5846 set_typeflag (SCHEME_V->loadport, T_ATOM); 6268 set_typeflag (SCHEME_V->loadport, T_ATOM);
5847 6269
5848 if (SCHEME_V->retcode == 0) 6270 if (SCHEME_V->retcode == 0)
5849 SCHEME_V->retcode = SCHEME_V->nesting != 0; 6271 SCHEME_V->retcode = SCHEME_V->nesting != 0;
6272#else
6273 abort ();
6274#endif
5850} 6275}
5851 6276
5852void 6277ecb_cold void
5853scheme_define (SCHEME_P_ pointer envir, pointer symbol, pointer value) 6278scheme_define (SCHEME_P_ pointer envir, pointer symbol, pointer value)
5854{ 6279{
5855 pointer x; 6280 pointer x;
5856 6281
5857 x = find_slot_in_env (SCHEME_A_ envir, symbol, 0); 6282 x = find_slot_in_env (SCHEME_A_ envir, symbol, 0);
… …
5862 new_slot_spec_in_env (SCHEME_A_ envir, symbol, value); 6287 new_slot_spec_in_env (SCHEME_A_ envir, symbol, value);
5863} 6288}
5864 6289
5865#if !STANDALONE 6290#if !STANDALONE
5866 6291
5867void 6292ecb_cold void
5868scheme_register_foreign_func (scheme * sc, scheme_registerable * sr) 6293scheme_register_foreign_func (scheme * sc, scheme_registerable * sr)
5869{ 6294{
5870 scheme_define (SCHEME_A_ SCHEME_V->global_env, mk_symbol (SCHEME_A_ sr->name), mk_foreign_func (SCHEME_A_ sr->f)); 6295 scheme_define (SCHEME_A_ SCHEME_V->global_env, mk_symbol (SCHEME_A_ sr->name), mk_foreign_func (SCHEME_A_ sr->f));
5871} 6296}
5872 6297
5873void 6298ecb_cold void
5874scheme_register_foreign_func_list (scheme * sc, scheme_registerable * list, int count) 6299scheme_register_foreign_func_list (scheme * sc, scheme_registerable * list, int count)
5875{ 6300{
5876 int i; 6301 int i;
5877 6302
5878 for (i = 0; i < count; i++) 6303 for (i = 0; i < count; i++)
5879 scheme_register_foreign_func (SCHEME_A_ list + i); 6304 scheme_register_foreign_func (SCHEME_A_ list + i);
5880} 6305}
5881 6306
5882pointer 6307ecb_cold pointer
5883scheme_apply0 (SCHEME_P_ const char *procname) 6308scheme_apply0 (SCHEME_P_ const char *procname)
5884{ 6309{
5885 return scheme_eval (SCHEME_A_ cons (mk_symbol (SCHEME_A_ procname), NIL)); 6310 return scheme_eval (SCHEME_A_ cons (mk_symbol (SCHEME_A_ procname), NIL));
5886} 6311}
5887 6312
5888void 6313ecb_cold void
5889save_from_C_call (SCHEME_P) 6314save_from_C_call (SCHEME_P)
5890{ 6315{
5891 pointer saved_data = cons (car (S_SINK), 6316 pointer saved_data = cons (car (S_SINK),
5892 cons (SCHEME_V->envir, 6317 cons (SCHEME_V->envir,
5893 SCHEME_V->dump)); 6318 SCHEME_V->dump));
… …
5897 /* Truncate the dump stack so TS will return here when done, not 6322 /* Truncate the dump stack so TS will return here when done, not
5898 directly resume pre-C-call operations. */ 6323 directly resume pre-C-call operations. */
5899 dump_stack_reset (SCHEME_A); 6324 dump_stack_reset (SCHEME_A);
5900} 6325}
5901 6326
5902void 6327ecb_cold void
5903restore_from_C_call (SCHEME_P) 6328restore_from_C_call (SCHEME_P)
5904{ 6329{
5905 set_car (S_SINK, caar (SCHEME_V->c_nest)); 6330 set_car (S_SINK, caar (SCHEME_V->c_nest));
5906 SCHEME_V->envir = cadar (SCHEME_V->c_nest); 6331 SCHEME_V->envir = cadar (SCHEME_V->c_nest);
5907 SCHEME_V->dump = cdr (cdar (SCHEME_V->c_nest)); 6332 SCHEME_V->dump = cdr (cdar (SCHEME_V->c_nest));
5908 /* Pop */ 6333 /* Pop */
5909 SCHEME_V->c_nest = cdr (SCHEME_V->c_nest); 6334 SCHEME_V->c_nest = cdr (SCHEME_V->c_nest);
5910} 6335}
5911 6336
5912/* "func" and "args" are assumed to be already eval'ed. */ 6337/* "func" and "args" are assumed to be already eval'ed. */
5913pointer 6338ecb_cold pointer
5914scheme_call (SCHEME_P_ pointer func, pointer args) 6339scheme_call (SCHEME_P_ pointer func, pointer args)
5915{ 6340{
5916 int old_repl = SCHEME_V->interactive_repl; 6341 int old_repl = SCHEME_V->interactive_repl;
5917 6342
5918 SCHEME_V->interactive_repl = 0; 6343 SCHEME_V->interactive_repl = 0;
… …
5925 SCHEME_V->interactive_repl = old_repl; 6350 SCHEME_V->interactive_repl = old_repl;
5926 restore_from_C_call (SCHEME_A); 6351 restore_from_C_call (SCHEME_A);
5927 return SCHEME_V->value; 6352 return SCHEME_V->value;
5928} 6353}
5929 6354
5930pointer 6355ecb_cold pointer
5931scheme_eval (SCHEME_P_ pointer obj) 6356scheme_eval (SCHEME_P_ pointer obj)
5932{ 6357{
5933 int old_repl = SCHEME_V->interactive_repl; 6358 int old_repl = SCHEME_V->interactive_repl;
5934 6359
5935 SCHEME_V->interactive_repl = 0; 6360 SCHEME_V->interactive_repl = 0;
… …
5947 6372
5948/* ========== Main ========== */ 6373/* ========== Main ========== */
5949 6374
5950#if STANDALONE 6375#if STANDALONE
5951 6376
5952int 6377ecb_cold int
5953main (int argc, char **argv) 6378main (int argc, char **argv)
5954{ 6379{
5955# if USE_MULTIPLICITY 6380# if USE_MULTIPLICITY
5956 scheme ssc; 6381 scheme ssc;
5957 scheme *const SCHEME_V = &ssc; 6382 scheme *const SCHEME_V = &ssc;
… …
5959# endif 6384# endif
5960 int fin; 6385 int fin;
5961 char *file_name = InitFile; 6386 char *file_name = InitFile;
5962 int retcode; 6387 int retcode;
5963 int isfile = 1; 6388 int isfile = 1;
6389#if EXPERIMENT
6390 system ("ps v $PPID");
6391#endif
5964 6392
5965 if (argc == 2 && strcmp (argv[1], "-?") == 0) 6393 if (argc == 2 && strcmp (argv[1], "-?") == 0)
5966 { 6394 {
5967 xwrstr ("Usage: tinyscheme -?\n"); 6395 putstr (SCHEME_A_ "Usage: tinyscheme -?\n");
5968 xwrstr ("or: tinyscheme [<file1> <file2> ...]\n"); 6396 putstr (SCHEME_A_ "or: tinyscheme [<file1> <file2> ...]\n");
5969 xwrstr ("followed by\n"); 6397 putstr (SCHEME_A_ "followed by\n");
5970 xwrstr (" -1 <file> [<arg1> <arg2> ...]\n"); 6398 putstr (SCHEME_A_ " -1 <file> [<arg1> <arg2> ...]\n");
5971 xwrstr (" -c <Scheme commands> [<arg1> <arg2> ...]\n"); 6399 putstr (SCHEME_A_ " -c <Scheme commands> [<arg1> <arg2> ...]\n");
5972 xwrstr ("assuming that the executable is named tinyscheme.\n"); 6400 putstr (SCHEME_A_ "assuming that the executable is named tinyscheme.\n");
5973 xwrstr ("Use - as filename for stdin.\n"); 6401 putstr (SCHEME_A_ "Use - as filename for stdin.\n");
5974 return 1; 6402 return 1;
5975 } 6403 }
5976 6404
5977 if (!scheme_init (SCHEME_A)) 6405 if (!scheme_init (SCHEME_A))
5978 { 6406 {
5979 xwrstr ("Could not initialize!\n"); 6407 putstr (SCHEME_A_ "Could not initialize!\n");
5980 return 2; 6408 return 2;
5981 } 6409 }
5982 6410
5983# if USE_PORTS 6411# if USE_PORTS
5984 scheme_set_input_port_file (SCHEME_A_ STDIN_FILENO); 6412 scheme_set_input_port_file (SCHEME_A_ STDIN_FILENO);
… …
5997 } 6425 }
5998#endif 6426#endif
5999 6427
6000 do 6428 do
6001 { 6429 {
6002#if USE_PORTS
6003 if (strcmp (file_name, "-") == 0) 6430 if (strcmp (file_name, "-") == 0)
6004 fin = STDIN_FILENO; 6431 fin = STDIN_FILENO;
6005 else if (strcmp (file_name, "-1") == 0 || strcmp (file_name, "-c") == 0) 6432 else if (strcmp (file_name, "-1") == 0 || strcmp (file_name, "-c") == 0)
6006 { 6433 {
6007 pointer args = NIL; 6434 pointer args = NIL;
… …
6025 scheme_define (SCHEME_A_ SCHEME_V->global_env, mk_symbol (SCHEME_A_ "*args*"), args); 6452 scheme_define (SCHEME_A_ SCHEME_V->global_env, mk_symbol (SCHEME_A_ "*args*"), args);
6026 6453
6027 } 6454 }
6028 else 6455 else
6029 fin = open (file_name, O_RDONLY); 6456 fin = open (file_name, O_RDONLY);
6030#endif
6031 6457
6032 if (isfile && fin < 0) 6458 if (isfile && fin < 0)
6033 { 6459 {
6034 xwrstr ("Could not open file "); xwrstr (file_name); xwrstr ("\n"); 6460 putstr (SCHEME_A_ "Could not open file ");
6461 putstr (SCHEME_A_ file_name);
6462 putcharacter (SCHEME_A_ '\n');
6035 } 6463 }
6036 else 6464 else
6037 { 6465 {
6038 if (isfile) 6466 if (isfile)
6039 scheme_load_named_file (SCHEME_A_ fin, file_name); 6467 scheme_load_named_file (SCHEME_A_ fin, file_name);
6040 else 6468 else
6041 scheme_load_string (SCHEME_A_ file_name); 6469 scheme_load_string (SCHEME_A_ file_name);
6042 6470
6043#if USE_PORTS
6044 if (!isfile || fin != STDIN_FILENO) 6471 if (!isfile || fin != STDIN_FILENO)
6045 { 6472 {
6046 if (SCHEME_V->retcode != 0) 6473 if (SCHEME_V->retcode != 0)
6047 { 6474 {
6048 xwrstr ("Errors encountered reading "); xwrstr (file_name); xwrstr ("\n"); 6475 putstr (SCHEME_A_ "Errors encountered reading ");
6476 putstr (SCHEME_A_ file_name);
6477 putcharacter (SCHEME_A_ '\n');
6049 } 6478 }
6050 6479
6051 if (isfile) 6480 if (isfile)
6052 close (fin); 6481 close (fin);
6053 } 6482 }
6054#endif
6055 } 6483 }
6056 6484
6057 file_name = *argv++; 6485 file_name = *argv++;
6058 } 6486 }
6059 while (file_name != 0); 6487 while (file_name != 0);

Diff Legend

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