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

Comparing cvsroot/microscheme/scheme.c (file contents):
Revision 1.19 by root, Thu Nov 26 21:36:11 2015 UTC vs.
Revision 1.54 by root, Tue Dec 1 02:42:35 2015 UTC

… …
16 * (MINISCM) This is a revised and modified version by Akira KIDA. 16 * (MINISCM) This is a revised and modified version by Akira KIDA.
17 * (MINISCM) current version is 0.85k4 (15 May 1994) 17 * (MINISCM) current version is 0.85k4 (15 May 1994)
18 * 18 *
19 */ 19 */
20 20
21#define EXPERIMENT 1
22
23#if 1
21#define PAGE_SIZE 4096 /* does not work on sparc/alpha */ 24#define PAGE_SIZE 4096 /* does not work on sparc/alpha */
22#include "malloc.c" 25#include "malloc.c"
26#endif
23 27
24#define SCHEME_SOURCE 28#define SCHEME_SOURCE
25#include "scheme-private.h" 29#include "scheme-private.h"
26#ifndef WIN32 30#ifndef WIN32
27# include <unistd.h> 31# include <unistd.h>
28#endif 32#endif
29#if USE_MATH 33#if USE_MATH
30# include <math.h> 34# include <math.h>
31#endif 35#endif
32 36
37#include "ecb.h"
38
33#include <sys/types.h> 39#include <sys/types.h>
34#include <sys/stat.h> 40#include <sys/stat.h>
35#include <fcntl.h> 41#include <fcntl.h>
36 42
43#if !USE_ERROR_CHECKING
44# define NDEBUG
45#endif
46
47#include <assert.h>
48#include <stdlib.h>
37#include <string.h> 49#include <string.h>
38#include <stdlib.h>
39 50
40#include <limits.h> 51#include <limits.h>
41#include <inttypes.h> 52#include <inttypes.h>
42#include <float.h> 53#include <float.h>
43//#include <ctype.h> 54//#include <ctype.h>
55
56#if '1' != '0' + 1 \
57 || '2' != '0' + 2 || '3' != '0' + 3 || '4' != '0' + 4 || '5' != '0' + 5 \
58 || '6' != '0' + 6 || '7' != '0' + 7 || '8' != '0' + 8 || '9' != '0' + 9 \
59 || 'b' != 'a' + 1 || 'c' != 'a' + 2 || 'd' != 'a' + 3 || 'e' != 'a' + 4 \
60 || 'f' != 'a' + 5
61# error "execution character set digits not consecutive"
62#endif
44 63
45enum { 64enum {
46 TOK_EOF, 65 TOK_EOF,
47 TOK_LPAREN, 66 TOK_LPAREN,
48 TOK_RPAREN, 67 TOK_RPAREN,
49 TOK_DOT, 68 TOK_DOT,
50 TOK_ATOM, 69 TOK_ATOM,
70 TOK_DOTATOM, /* atom name starting with '.' */
71 TOK_STRATOM, /* atom name enclosed in | */
51 TOK_QUOTE, 72 TOK_QUOTE,
52 TOK_DQUOTE, 73 TOK_DQUOTE,
53 TOK_BQUOTE, 74 TOK_BQUOTE,
54 TOK_COMMA, 75 TOK_COMMA,
55 TOK_ATMARK, 76 TOK_ATMARK,
… …
57 TOK_SHARP_CONST, 78 TOK_SHARP_CONST,
58 TOK_VEC 79 TOK_VEC
59}; 80};
60 81
61#define BACKQUOTE '`' 82#define BACKQUOTE '`'
62#define DELIMITERS "()\";\f\t\v\n\r " 83#define WHITESPACE " \t\r\n\v\f"
84#define DELIMITERS "()\";" WHITESPACE
63 85
64#define NIL (&SCHEME_V->xNIL) //TODO: make this 0? 86#define NIL POINTER (&SCHEME_V->xNIL)
65#define S_T (&SCHEME_V->xT) //TODO: magic ptr value? 87#define S_T POINTER (&SCHEME_V->xT)
66#define S_F (&SCHEME_V->xF) //TODO: magic ptr value? 88#define S_F POINTER (&SCHEME_V->xF)
67#define S_SINK (&SCHEME_V->xsink) 89#define S_SINK POINTER (&SCHEME_V->xsink)
68#define S_EOF (&SCHEME_V->xEOF_OBJ) 90#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 91
80#if !USE_MULTIPLICITY 92#if !USE_MULTIPLICITY
81static scheme sc; 93static scheme sc;
82#endif 94#endif
83 95
… …
91 } 103 }
92 104
93 char *p = s; 105 char *p = s;
94 106
95 do { 107 do {
96 *p++ = '0' + n % base; 108 *p++ = "0123456789abcdef"[n % base];
97 n /= base; 109 n /= base;
98 } while (n); 110 } while (n);
99 111
100 *p-- = 0; 112 *p-- = 0;
101 113
… …
111{ 123{
112 xbase (s, n, 10); 124 xbase (s, n, 10);
113} 125}
114 126
115static void 127static void
116xwrstr (const char *s) 128putnum (SCHEME_P_ long n)
117{
118 write (1, s, strlen (s));
119}
120
121static void
122xwrnum (long n)
123{ 129{
124 char buf[64]; 130 char buf[64];
125 131
126 xnum (buf, n); 132 xnum (buf, n);
127 xwrstr (buf); 133 putstr (SCHEME_A_ buf);
128} 134}
129 135
130static char 136static char
131xtoupper (char c) 137xtoupper (char c)
132{ 138{
… …
153 159
154#define toupper(c) xtoupper (c) 160#define toupper(c) xtoupper (c)
155#define tolower(c) xtolower (c) 161#define tolower(c) xtolower (c)
156#define isdigit(c) xisdigit (c) 162#define isdigit(c) xisdigit (c)
157 163
158#if USE_STRLWR 164#if USE_IGNORECASE
159static const char * 165static const char *
160strlwr (char *s) 166xstrlwr (char *s)
161{ 167{
162 const char *p = s; 168 const char *p = s;
163 169
164 while (*s) 170 while (*s)
165 { 171 {
… …
167 s++; 173 s++;
168 } 174 }
169 175
170 return p; 176 return p;
171} 177}
172#endif
173 178
179#define stricmp(a,b) strcasecmp (a, b)
180#define strlwr(s) xstrlwr (s)
181
182#else
174#define stricmp(a,b) strcmp (a, b) 183# define stricmp(a,b) strcmp (a, b)
175#define strlwr(s) (s) 184# define strlwr(s) (s)
185#endif
176 186
177#ifndef prompt 187#ifndef prompt
178# define prompt "ts> " 188# define prompt "ts> "
179#endif 189#endif
180 190
181#ifndef InitFile 191#ifndef InitFile
182# define InitFile "init.scm" 192# define InitFile "init.scm"
183#endif 193#endif
184 194
185#ifndef FIRST_CELLSEGS
186# define FIRST_CELLSEGS 3
187#endif
188
189enum scheme_types 195enum scheme_types
190{ 196{
197 T_INTEGER,
191 T_FREE, 198 T_REAL,
192 T_STRING, 199 T_STRING,
193 T_NUMBER,
194 T_SYMBOL, 200 T_SYMBOL,
195 T_PROC, 201 T_PROC,
196 T_PAIR, 202 T_PAIR, /* also used for free cells */
197 T_CLOSURE, 203 T_CLOSURE,
198 T_CONTINUATION, 204 T_CONTINUATION,
199 T_FOREIGN, 205 T_FOREIGN,
200 T_CHARACTER, 206 T_CHARACTER,
201 T_PORT, 207 T_PORT,
… …
211#define T_SYNTAX 0x0010 217#define T_SYNTAX 0x0010
212#define T_IMMUTABLE 0x0020 218#define T_IMMUTABLE 0x0020
213#define T_ATOM 0x0040 /* only for gc */ 219#define T_ATOM 0x0040 /* only for gc */
214#define T_MARK 0x0080 /* only for gc */ 220#define T_MARK 0x0080 /* only for gc */
215 221
222/* num, for generic arithmetic */
223struct num
224{
225 IVALUE ivalue;
226#if USE_REAL
227 RVALUE rvalue;
228 char is_fixnum;
229#endif
230};
231
232#if USE_REAL
233# define num_is_fixnum(n) (n).is_fixnum
234# define num_set_fixnum(n,f) (n).is_fixnum = (f)
235# define num_ivalue(n) (n).ivalue
236# define num_rvalue(n) (n).rvalue
237# define num_set_ivalue(n,i) (n).rvalue = (n).ivalue = (i)
238# define num_set_rvalue(n,r) (n).rvalue = (r)
239#else
240# define num_is_fixnum(n) 1
241# define num_set_fixnum(n,f) 0
242# define num_ivalue(n) (n).ivalue
243# define num_rvalue(n) (n).ivalue
244# define num_set_ivalue(n,i) (n).ivalue = (i)
245# define num_set_rvalue(n,r) (n).ivalue = (r)
246#endif
247
216enum num_op { NUM_ADD, NUM_SUB, NUM_MUL, NUM_INTDIV }; 248enum num_op { NUM_ADD, NUM_SUB, NUM_MUL, NUM_INTDIV };
217 249
218static num num_op (enum num_op op, num a, num b); 250static num num_op (enum num_op op, num a, num b);
219static num num_intdiv (num a, num b); 251static num num_intdiv (num a, num b);
220static num num_rem (num a, num b); 252static num num_rem (num a, num b);
221static num num_mod (num a, num b); 253static num num_mod (num a, num b);
222 254
223#if USE_MATH
224static double round_per_R5RS (double x);
225#endif
226static int is_zero_rvalue (RVALUE x); 255static 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 256
234static num num_zero; 257static num num_zero;
235static num num_one; 258static num num_one;
236 259
260/* convert "pointer" to cell* / cell* to pointer */
261#define CELL(p) ((struct cell *)(p) + 0)
262#define POINTER(c) ((void *)((c) - 0))
263
237/* macros for cell operations */ 264/* macros for cell operations */
238#define typeflag(p) ((p)->flag + 0) 265#define typeflag(p) (CELL(p)->flag + 0)
239#define set_typeflag(p,v) ((p)->flag = (v)) 266#define set_typeflag(p,v) (CELL(p)->flag = (v))
240#define type(p) (typeflag (p) & T_MASKTYPE) 267#define type(p) (typeflag (p) & T_MASKTYPE)
241 268
242INTERFACE INLINE int 269INTERFACE int
243is_string (pointer p) 270is_string (pointer p)
244{ 271{
245 return type (p) == T_STRING; 272 return type (p) == T_STRING;
246} 273}
247 274
248#define strvalue(p) ((p)->object.string.svalue) 275#define strvalue(p) (CELL(p)->object.string.svalue)
249#define strlength(p) ((p)->object.string.length) 276#define strlength(p) (CELL(p)->object.string.length)
250 277
251INTERFACE int is_list (SCHEME_P_ pointer p);
252
253INTERFACE INLINE int 278INTERFACE int
254is_vector (pointer p) 279is_vector (pointer p)
255{ 280{
256 return type (p) == T_VECTOR; 281 return type (p) == T_VECTOR;
257} 282}
258 283
259#define vecvalue(p) ((p)->object.vector.vvalue) 284#define vecvalue(p) (CELL(p)->object.vector.vvalue)
260#define veclength(p) ((p)->object.vector.length) 285#define veclength(p) (CELL(p)->object.vector.length)
261INTERFACE void fill_vector (pointer vec, pointer obj); 286INTERFACE void fill_vector (pointer vec, uint32_t start, pointer obj);
262INTERFACE uint32_t vector_length (pointer vec);
263INTERFACE pointer vector_elem (pointer vec, uint32_t ielem); 287INTERFACE pointer vector_get (pointer vec, uint32_t ielem);
264INTERFACE void set_vector_elem (pointer vec, uint32_t ielem, pointer a); 288INTERFACE void vector_set (pointer vec, uint32_t ielem, pointer a);
265 289
266INTERFACE uint32_t 290INTERFACE int
267vector_length (pointer vec) 291is_integer (pointer p)
268{ 292{
269 return vec->object.vector.length; 293 return type (p) == T_INTEGER;
270} 294}
271 295
296/* not the same as in scheme, where integers are (correctly :) reals */
272INTERFACE INLINE int 297INTERFACE int
298is_real (pointer p)
299{
300 return type (p) == T_REAL;
301}
302
303INTERFACE int
273is_number (pointer p) 304is_number (pointer p)
274{ 305{
275 return type (p) == T_NUMBER; 306 return is_integer (p) || is_real (p);
276} 307}
277 308
278INTERFACE INLINE int 309INTERFACE int
279is_integer (pointer p)
280{
281 if (!is_number (p))
282 return 0;
283
284 if (num_is_integer (p) || ivalue (p) == rvalue (p))
285 return 1;
286
287 return 0;
288}
289
290INTERFACE INLINE int
291is_real (pointer p)
292{
293 return is_number (p) && !num_is_fixnum (p->object.number);
294}
295
296INTERFACE INLINE int
297is_character (pointer p) 310is_character (pointer p)
298{ 311{
299 return type (p) == T_CHARACTER; 312 return type (p) == T_CHARACTER;
300} 313}
301 314
302INTERFACE INLINE char * 315INTERFACE char *
303string_value (pointer p) 316string_value (pointer p)
304{ 317{
305 return strvalue (p); 318 return strvalue (p);
306} 319}
307 320
308INLINE num
309nvalue (pointer p)
310{
311 return (p)->object.number;
312}
313
314static IVALUE
315num_get_ivalue (const num n)
316{
317 return num_is_fixnum (n) ? num_ivalue (n) : (IVALUE)num_rvalue (n);
318}
319
320static RVALUE
321num_get_rvalue (const num n)
322{
323 return num_is_fixnum (n) ? (RVALUE)num_ivalue (n) : num_rvalue (n);
324}
325
326INTERFACE IVALUE
327ivalue (pointer p)
328{
329 return num_get_ivalue (p->object.number);
330}
331
332INTERFACE RVALUE
333rvalue (pointer p)
334{
335 return num_get_rvalue (p->object.number);
336}
337
338#define ivalue_unchecked(p) ((p)->object.number.value.ivalue) 321#define ivalue_unchecked(p) CELL(p)->object.ivalue
322#define set_ivalue(p,v) CELL(p)->object.ivalue = (v)
323
339#if USE_REAL 324#if USE_REAL
340# define rvalue_unchecked(p) ((p)->object.number.value.rvalue) 325#define rvalue_unchecked(p) CELL(p)->object.rvalue
341# define set_num_integer(p) (p)->object.number.is_fixnum=1; 326#define set_rvalue(p,v) CELL(p)->object.rvalue = (v)
342# define set_num_real(p) (p)->object.number.is_fixnum=0;
343#else 327#else
344# define rvalue_unchecked(p) ((p)->object.number.value.ivalue) 328#define rvalue_unchecked(p) CELL(p)->object.ivalue
345# define set_num_integer(p) 0 329#define set_rvalue(p,v) CELL(p)->object.ivalue = (v)
346# define set_num_real(p) 0
347#endif 330#endif
331
348INTERFACE long 332INTERFACE long
349charvalue (pointer p) 333charvalue (pointer p)
350{ 334{
351 return ivalue_unchecked (p); 335 return ivalue_unchecked (p);
352} 336}
353 337
338#define port(p) CELL(p)->object.port
339#define set_port(p,v) port(p) = (v)
354INTERFACE INLINE int 340INTERFACE int
355is_port (pointer p) 341is_port (pointer p)
356{ 342{
357 return type (p) == T_PORT; 343 return type (p) == T_PORT;
358} 344}
359 345
360INTERFACE INLINE int 346INTERFACE int
361is_inport (pointer p) 347is_inport (pointer p)
362{ 348{
363 return is_port (p) && p->object.port->kind & port_input; 349 return is_port (p) && port (p)->kind & port_input;
364} 350}
365 351
366INTERFACE INLINE int 352INTERFACE int
367is_outport (pointer p) 353is_outport (pointer p)
368{ 354{
369 return is_port (p) && p->object.port->kind & port_output; 355 return is_port (p) && port (p)->kind & port_output;
370} 356}
371 357
372INTERFACE INLINE int 358INTERFACE int
373is_pair (pointer p) 359is_pair (pointer p)
374{ 360{
375 return type (p) == T_PAIR; 361 return type (p) == T_PAIR;
376} 362}
377 363
378#define car(p) ((p)->object.cons.car + 0) 364#define car(p) (POINTER (CELL(p)->object.cons.car))
379#define cdr(p) ((p)->object.cons.cdr + 0) 365#define cdr(p) (POINTER (CELL(p)->object.cons.cdr))
380 366
381static pointer caar (pointer p) { return car (car (p)); } 367static pointer caar (pointer p) { return car (car (p)); }
382static pointer cadr (pointer p) { return car (cdr (p)); } 368static pointer cadr (pointer p) { return car (cdr (p)); }
383static pointer cdar (pointer p) { return cdr (car (p)); } 369static pointer cdar (pointer p) { return cdr (car (p)); }
384static pointer cddr (pointer p) { return cdr (cdr (p)); } 370static pointer cddr (pointer p) { return cdr (cdr (p)); }
… …
388static pointer cdaar (pointer p) { return cdr (car (car (p))); } 374static pointer cdaar (pointer p) { return cdr (car (car (p))); }
389 375
390INTERFACE void 376INTERFACE void
391set_car (pointer p, pointer q) 377set_car (pointer p, pointer q)
392{ 378{
393 p->object.cons.car = q; 379 CELL(p)->object.cons.car = CELL (q);
394} 380}
395 381
396INTERFACE void 382INTERFACE void
397set_cdr (pointer p, pointer q) 383set_cdr (pointer p, pointer q)
398{ 384{
399 p->object.cons.cdr = q; 385 CELL(p)->object.cons.cdr = CELL (q);
400} 386}
401 387
402INTERFACE pointer 388INTERFACE pointer
403pair_car (pointer p) 389pair_car (pointer p)
404{ 390{
… …
409pair_cdr (pointer p) 395pair_cdr (pointer p)
410{ 396{
411 return cdr (p); 397 return cdr (p);
412} 398}
413 399
414INTERFACE INLINE int 400INTERFACE int
415is_symbol (pointer p) 401is_symbol (pointer p)
416{ 402{
417 return type (p) == T_SYMBOL; 403 return type (p) == T_SYMBOL;
418} 404}
419 405
420INTERFACE INLINE char * 406INTERFACE char *
421symname (pointer p) 407symname (pointer p)
422{ 408{
423 return strvalue (car (p)); 409 return strvalue (p);
424} 410}
425 411
426#if USE_PLIST 412#if USE_PLIST
413#error plists are broken because symbols are no longer pairs
414#define symprop(p) cdr(p)
427SCHEME_EXPORT INLINE int 415SCHEME_EXPORT int
428hasprop (pointer p) 416hasprop (pointer p)
429{ 417{
430 return typeflag (p) & T_SYMBOL; 418 return typeflag (p) & T_SYMBOL;
431} 419}
432
433# define symprop(p) cdr(p)
434#endif 420#endif
435 421
436INTERFACE INLINE int 422INTERFACE int
437is_syntax (pointer p) 423is_syntax (pointer p)
438{ 424{
439 return typeflag (p) & T_SYNTAX; 425 return typeflag (p) & T_SYNTAX;
440} 426}
441 427
442INTERFACE INLINE int 428INTERFACE int
443is_proc (pointer p) 429is_proc (pointer p)
444{ 430{
445 return type (p) == T_PROC; 431 return type (p) == T_PROC;
446} 432}
447 433
448INTERFACE INLINE int 434INTERFACE int
449is_foreign (pointer p) 435is_foreign (pointer p)
450{ 436{
451 return type (p) == T_FOREIGN; 437 return type (p) == T_FOREIGN;
452} 438}
453 439
454INTERFACE INLINE char * 440INTERFACE char *
455syntaxname (pointer p) 441syntaxname (pointer p)
456{ 442{
457 return strvalue (car (p)); 443 return strvalue (p);
458} 444}
459 445
460#define procnum(p) ivalue (p) 446#define procnum(p) ivalue_unchecked (p)
461static const char *procname (pointer x); 447static const char *procname (pointer x);
462 448
463INTERFACE INLINE int 449INTERFACE int
464is_closure (pointer p) 450is_closure (pointer p)
465{ 451{
466 return type (p) == T_CLOSURE; 452 return type (p) == T_CLOSURE;
467} 453}
468 454
469INTERFACE INLINE int 455INTERFACE int
470is_macro (pointer p) 456is_macro (pointer p)
471{ 457{
472 return type (p) == T_MACRO; 458 return type (p) == T_MACRO;
473} 459}
474 460
475INTERFACE INLINE pointer 461INTERFACE pointer
476closure_code (pointer p) 462closure_code (pointer p)
477{ 463{
478 return car (p); 464 return car (p);
479} 465}
480 466
481INTERFACE INLINE pointer 467INTERFACE pointer
482closure_env (pointer p) 468closure_env (pointer p)
483{ 469{
484 return cdr (p); 470 return cdr (p);
485} 471}
486 472
487INTERFACE INLINE int 473INTERFACE int
488is_continuation (pointer p) 474is_continuation (pointer p)
489{ 475{
490 return type (p) == T_CONTINUATION; 476 return type (p) == T_CONTINUATION;
491} 477}
492 478
493#define cont_dump(p) cdr (p) 479#define cont_dump(p) cdr (p)
494#define set_cont_dump(p,v) set_cdr ((p), (v)) 480#define set_cont_dump(p,v) set_cdr ((p), (v))
495 481
496/* To do: promise should be forced ONCE only */ 482/* To do: promise should be forced ONCE only */
497INTERFACE INLINE int 483INTERFACE int
498is_promise (pointer p) 484is_promise (pointer p)
499{ 485{
500 return type (p) == T_PROMISE; 486 return type (p) == T_PROMISE;
501} 487}
502 488
503INTERFACE INLINE int 489INTERFACE int
504is_environment (pointer p) 490is_environment (pointer p)
505{ 491{
506 return type (p) == T_ENVIRONMENT; 492 return type (p) == T_ENVIRONMENT;
507} 493}
508 494
… …
514 500
515#define is_mark(p) (typeflag (p) & T_MARK) 501#define is_mark(p) (typeflag (p) & T_MARK)
516#define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK) 502#define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK)
517#define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK) 503#define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK)
518 504
519INTERFACE INLINE int 505INTERFACE int
520is_immutable (pointer p) 506is_immutable (pointer p)
521{ 507{
522 return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING; 508 return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING;
523} 509}
524 510
525INTERFACE INLINE void 511INTERFACE void
526setimmutable (pointer p) 512setimmutable (pointer p)
527{ 513{
528#if USE_ERROR_CHECKING 514#if USE_ERROR_CHECKING
529 set_typeflag (p, typeflag (p) | T_IMMUTABLE); 515 set_typeflag (p, typeflag (p) | T_IMMUTABLE);
530#endif 516#endif
531} 517}
532 518
519/* Result is:
520 proper list: length
521 circular list: -1
522 not even a pair: -2
523 dotted list: -2 minus length before dot
524*/
525INTERFACE int
526list_length (SCHEME_P_ pointer a)
527{
528 int i = 0;
529 pointer slow, fast;
530
531 slow = fast = a;
532
533 while (1)
534 {
535 if (fast == NIL)
536 return i;
537
538 if (!is_pair (fast))
539 return -2 - i;
540
541 fast = cdr (fast);
542 ++i;
543
544 if (fast == NIL)
545 return i;
546
547 if (!is_pair (fast))
548 return -2 - i;
549
550 ++i;
551 fast = cdr (fast);
552
553 /* Safe because we would have already returned if `fast'
554 encountered a non-pair. */
555 slow = cdr (slow);
556
557 if (fast == slow)
558 {
559 /* the fast pointer has looped back around and caught up
560 with the slow pointer, hence the structure is circular,
561 not of finite length, and therefore not a list */
562 return -1;
563 }
564 }
565}
566
567INTERFACE int
568is_list (SCHEME_P_ pointer a)
569{
570 return list_length (SCHEME_A_ a) >= 0;
571}
572
533#if USE_CHAR_CLASSIFIERS 573#if USE_CHAR_CLASSIFIERS
534static INLINE int 574ecb_inline int
535Cisalpha (int c) 575Cisalpha (int c)
536{ 576{
537 return isascii (c) && isalpha (c); 577 return isascii (c) && isalpha (c);
538} 578}
539 579
540static INLINE int 580ecb_inline int
541Cisdigit (int c) 581Cisdigit (int c)
542{ 582{
543 return isascii (c) && isdigit (c); 583 return isascii (c) && isdigit (c);
544} 584}
545 585
546static INLINE int 586ecb_inline int
547Cisspace (int c) 587Cisspace (int c)
548{ 588{
549 return isascii (c) && isspace (c); 589 return isascii (c) && isspace (c);
550} 590}
551 591
552static INLINE int 592ecb_inline int
553Cisupper (int c) 593Cisupper (int c)
554{ 594{
555 return isascii (c) && isupper (c); 595 return isascii (c) && isupper (c);
556} 596}
557 597
558static INLINE int 598ecb_inline int
559Cislower (int c) 599Cislower (int c)
560{ 600{
561 return isascii (c) && islower (c); 601 return isascii (c) && islower (c);
562} 602}
563#endif 603#endif
… …
624#endif 664#endif
625 665
626static int file_push (SCHEME_P_ const char *fname); 666static int file_push (SCHEME_P_ const char *fname);
627static void file_pop (SCHEME_P); 667static void file_pop (SCHEME_P);
628static int file_interactive (SCHEME_P); 668static int file_interactive (SCHEME_P);
629static INLINE int is_one_of (char *s, int c); 669ecb_inline int is_one_of (const char *s, int c);
630static int alloc_cellseg (SCHEME_P_ int n); 670static int alloc_cellseg (SCHEME_P);
631static INLINE pointer get_cell (SCHEME_P_ pointer a, pointer b); 671ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b);
632static void finalize_cell (SCHEME_P_ pointer a); 672static void finalize_cell (SCHEME_P_ pointer a);
633static int count_consecutive_cells (pointer x, int needed); 673static int count_consecutive_cells (pointer x, int needed);
634static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all); 674static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all);
635static pointer mk_number (SCHEME_P_ const num n); 675static pointer mk_number (SCHEME_P_ const num n);
636static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill); 676static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill);
… …
651static void mark (pointer a); 691static void mark (pointer a);
652static void gc (SCHEME_P_ pointer a, pointer b); 692static void gc (SCHEME_P_ pointer a, pointer b);
653static int basic_inchar (port *pt); 693static int basic_inchar (port *pt);
654static int inchar (SCHEME_P); 694static int inchar (SCHEME_P);
655static void backchar (SCHEME_P_ int c); 695static void backchar (SCHEME_P_ int c);
656static char *readstr_upto (SCHEME_P_ char *delim); 696static char *readstr_upto (SCHEME_P_ int skip, const char *delim);
657static pointer readstrexp (SCHEME_P); 697static pointer readstrexp (SCHEME_P_ char delim);
658static INLINE int skipspace (SCHEME_P); 698ecb_inline int skipspace (SCHEME_P);
659static int token (SCHEME_P); 699static int token (SCHEME_P);
660static void printslashstring (SCHEME_P_ char *s, int len); 700static void printslashstring (SCHEME_P_ char *s, int len);
661static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen); 701static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen);
662static void printatom (SCHEME_P_ pointer l, int f); 702static void printatom (SCHEME_P_ pointer l, int f);
663static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op); 703static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op);
… …
667static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list); 707static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list);
668static pointer revappend (SCHEME_P_ pointer a, pointer b); 708static pointer revappend (SCHEME_P_ pointer a, pointer b);
669static pointer ss_get_cont (SCHEME_P); 709static pointer ss_get_cont (SCHEME_P);
670static void ss_set_cont (SCHEME_P_ pointer cont); 710static void ss_set_cont (SCHEME_P_ pointer cont);
671static void dump_stack_mark (SCHEME_P); 711static void dump_stack_mark (SCHEME_P);
672static pointer opexe_0 (SCHEME_P_ enum scheme_opcodes op); 712static int opexe_0 (SCHEME_P_ enum scheme_opcodes op);
713static int opexe_1 (SCHEME_P_ enum scheme_opcodes op);
673static pointer opexe_2 (SCHEME_P_ enum scheme_opcodes op); 714static int opexe_2 (SCHEME_P_ enum scheme_opcodes op);
674static pointer opexe_r (SCHEME_P_ enum scheme_opcodes op);
675static pointer opexe_3 (SCHEME_P_ enum scheme_opcodes op); 715static int opexe_3 (SCHEME_P_ enum scheme_opcodes op);
676static pointer opexe_4 (SCHEME_P_ enum scheme_opcodes op); 716static int opexe_4 (SCHEME_P_ enum scheme_opcodes op);
677static pointer opexe_5 (SCHEME_P_ enum scheme_opcodes op); 717static int opexe_5 (SCHEME_P_ enum scheme_opcodes op);
678static pointer opexe_6 (SCHEME_P_ enum scheme_opcodes op); 718static int opexe_6 (SCHEME_P_ enum scheme_opcodes op);
679static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op); 719static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op);
680static void assign_syntax (SCHEME_P_ const char *name); 720static void assign_syntax (SCHEME_P_ const char *name);
681static int syntaxnum (pointer p); 721static int syntaxnum (pointer p);
682static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name); 722static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name);
683 723
724static IVALUE
725ivalue (pointer x)
726{
727 return is_integer (x) ? ivalue_unchecked (x) : rvalue_unchecked (x);
728}
729
730static RVALUE
731rvalue (pointer x)
732{
733 return is_integer (x) ? ivalue_unchecked (x) : rvalue_unchecked (x);
734}
735
736INTERFACE num
737nvalue (pointer x)
738{
739 num n;
740
741 num_set_fixnum (n, is_integer (x));
742
743 if (num_is_fixnum (n))
744 num_set_ivalue (n, ivalue_unchecked (x));
745 else
746 num_set_rvalue (n, rvalue_unchecked (x));
747
748 return n;
749}
750
684static num 751static num
685num_op (enum num_op op, num a, num b) 752num_op (enum num_op op, num a, num b)
686{ 753{
687 num ret; 754 num ret;
688 755
689 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 756 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
690 757
691 if (num_is_fixnum (ret)) 758 if (num_is_fixnum (ret))
692 { 759 {
693 IVALUE av = num_get_ivalue (a);
694 IVALUE bv = num_get_ivalue (b);
695
696 switch (op) 760 switch (op)
697 { 761 {
698 case NUM_ADD: av += bv; break; 762 case NUM_ADD: a.ivalue += b.ivalue; break;
699 case NUM_SUB: av -= bv; break; 763 case NUM_SUB: a.ivalue -= b.ivalue; break;
700 case NUM_MUL: av *= bv; break; 764 case NUM_MUL: a.ivalue *= b.ivalue; break;
701 case NUM_INTDIV: av /= bv; break; 765 case NUM_INTDIV: a.ivalue /= b.ivalue; break;
702 } 766 }
703 767
704 num_set_ivalue (ret, av); 768 num_set_ivalue (ret, a.ivalue);
705 } 769 }
770#if USE_REAL
706 else 771 else
707 { 772 {
708 RVALUE av = num_get_rvalue (a);
709 RVALUE bv = num_get_rvalue (b);
710
711 switch (op) 773 switch (op)
712 { 774 {
713 case NUM_ADD: av += bv; break; 775 case NUM_ADD: a.rvalue += b.rvalue; break;
714 case NUM_SUB: av -= bv; break; 776 case NUM_SUB: a.rvalue -= b.rvalue; break;
715 case NUM_MUL: av *= bv; break; 777 case NUM_MUL: a.rvalue *= b.rvalue; break;
716 case NUM_INTDIV: av /= bv; break; 778 case NUM_INTDIV: a.rvalue /= b.rvalue; break;
717 } 779 }
718 780
719 num_set_rvalue (ret, av); 781 num_set_rvalue (ret, a.rvalue);
720 } 782 }
783#endif
721 784
722 return ret; 785 return ret;
723} 786}
724 787
725static num 788static num
726num_div (num a, num b) 789num_div (num a, num b)
727{ 790{
728 num ret; 791 num ret;
729 792
730 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_get_ivalue (a) % num_get_ivalue (b) == 0); 793 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_ivalue (a) % num_ivalue (b) == 0);
731 794
732 if (num_is_fixnum (ret)) 795 if (num_is_fixnum (ret))
733 num_set_ivalue (ret, num_get_ivalue (a) / num_get_ivalue (b)); 796 num_set_ivalue (ret, num_ivalue (a) / num_ivalue (b));
734 else 797 else
735 num_set_rvalue (ret, num_get_rvalue (a) / num_get_rvalue (b)); 798 num_set_rvalue (ret, num_rvalue (a) / num_rvalue (b));
736 799
737 return ret; 800 return ret;
738} 801}
739 802
740static num 803static num
… …
742{ 805{
743 num ret; 806 num ret;
744 long e1, e2, res; 807 long e1, e2, res;
745 808
746 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 809 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
747 e1 = num_get_ivalue (a); 810 e1 = num_ivalue (a);
748 e2 = num_get_ivalue (b); 811 e2 = num_ivalue (b);
749 res = e1 % e2; 812 res = e1 % e2;
750 813
751 /* remainder should have same sign as second operand */ 814 /* remainder should have same sign as second operand */
752 if (res > 0) 815 if (res > 0)
753 { 816 {
… …
769{ 832{
770 num ret; 833 num ret;
771 long e1, e2, res; 834 long e1, e2, res;
772 835
773 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 836 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
774 e1 = num_get_ivalue (a); 837 e1 = num_ivalue (a);
775 e2 = num_get_ivalue (b); 838 e2 = num_ivalue (b);
776 res = e1 % e2; 839 res = e1 % e2;
777 840
778 /* modulo should have same sign as second operand */ 841 /* modulo should have same sign as second operand */
779 if (res * e2 < 0) 842 if (res * e2 < 0)
780 res += e2; 843 res += e2;
781 844
782 num_set_ivalue (ret, res); 845 num_set_ivalue (ret, res);
783 return ret; 846 return ret;
784} 847}
785 848
786/* this completely disrespects NaNs */ 849/* this completely disrespects NaNs, but r5rs doesn't even allow NaNs */
787static int 850static int
788num_cmp (num a, num b) 851num_cmp (num a, num b)
789{ 852{
790 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b); 853 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
791 int ret; 854 int ret;
792 855
793 if (is_fixnum) 856 if (is_fixnum)
794 { 857 {
795 IVALUE av = num_get_ivalue (a); 858 IVALUE av = num_ivalue (a);
796 IVALUE bv = num_get_ivalue (b); 859 IVALUE bv = num_ivalue (b);
797 860
798 ret = av == bv ? 0 : av < bv ? -1 : +1; 861 ret = av == bv ? 0 : av < bv ? -1 : +1;
799 } 862 }
800 else 863 else
801 { 864 {
802 RVALUE av = num_get_rvalue (a); 865 RVALUE av = num_rvalue (a);
803 RVALUE bv = num_get_rvalue (b); 866 RVALUE bv = num_rvalue (b);
804 867
805 ret = av == bv ? 0 : av < bv ? -1 : +1; 868 ret = av == bv ? 0 : av < bv ? -1 : +1;
806 } 869 }
807 870
808 return ret; 871 return ret;
809} 872}
810
811#if USE_MATH
812
813/* Round to nearest. Round to even if midway */
814static double
815round_per_R5RS (double x)
816{
817 double fl = floor (x);
818 double ce = ceil (x);
819 double dfl = x - fl;
820 double dce = ce - x;
821
822 if (dfl > dce)
823 return ce;
824 else if (dfl < dce)
825 return fl;
826 else
827 {
828 if (fmod (fl, 2) == 0) /* I imagine this holds */
829 return fl;
830 else
831 return ce;
832 }
833}
834#endif
835 873
836static int 874static int
837is_zero_rvalue (RVALUE x) 875is_zero_rvalue (RVALUE x)
838{ 876{
877 return x == 0;
878#if 0
839#if USE_REAL 879#if USE_REAL
840 return x < DBL_MIN && x > -DBL_MIN; /* why the hate of denormals? this should be == 0. */ 880 return x < DBL_MIN && x > -DBL_MIN; /* why the hate of denormals? this should be == 0. */
841#else 881#else
842 return x == 0; 882 return x == 0;
843#endif 883#endif
884#endif
844} 885}
845 886
846/* allocate new cell segment */ 887/* allocate new cell segment */
847static int 888static int
848alloc_cellseg (SCHEME_P_ int n) 889alloc_cellseg (SCHEME_P)
849{ 890{
850 pointer newp; 891 struct cell *newp;
851 pointer last; 892 struct cell *last;
852 pointer p; 893 struct cell *p;
853 char *cp; 894 char *cp;
854 long i; 895 long i;
855 int k; 896 int k;
856 897
857 static int segsize = CELL_SEGSIZE >> 1; 898 static int segsize = CELL_SEGSIZE >> 1;
858 segsize <<= 1; 899 segsize <<= 1;
859 900
860 for (k = 0; k < n; k++)
861 {
862 if (SCHEME_V->last_cell_seg >= CELL_NSEGMENT - 1)
863 return k;
864
865 cp = malloc (segsize * sizeof (struct cell)); 901 cp = malloc (segsize * sizeof (struct cell));
866 902
867 if (!cp && USE_ERROR_CHECKING) 903 if (!cp && USE_ERROR_CHECKING)
868 return k; 904 return k;
869 905
870 i = ++SCHEME_V->last_cell_seg; 906 i = ++SCHEME_V->last_cell_seg;
871 SCHEME_V->alloc_seg[i] = cp; 907 SCHEME_V->alloc_seg[i] = cp;
872 908
873 /* insert new segment in address order */ 909 newp = (struct cell *)cp;
874 newp = (pointer)cp;
875 SCHEME_V->cell_seg[i] = newp; 910 SCHEME_V->cell_seg[i] = newp;
876 SCHEME_V->cell_segsize[i] = segsize; 911 SCHEME_V->cell_segsize[i] = segsize;
877
878 //TODO: insert, not swap
879 while (i > 0 && SCHEME_V->cell_seg[i - 1] > SCHEME_V->cell_seg[i])
880 {
881 p = SCHEME_V->cell_seg[i];
882 SCHEME_V->cell_seg[i] = SCHEME_V->cell_seg[i - 1];
883 SCHEME_V->cell_seg[i - 1] = p;
884
885 k = SCHEME_V->cell_segsize[i];
886 SCHEME_V->cell_segsize[i] = SCHEME_V->cell_segsize[i - 1];
887 SCHEME_V->cell_segsize[i - 1] = k;
888
889 --i;
890 }
891
892 SCHEME_V->fcells += segsize; 912 SCHEME_V->fcells += segsize;
893 last = newp + segsize - 1; 913 last = newp + segsize - 1;
894 914
895 for (p = newp; p <= last; p++) 915 for (p = newp; p <= last; p++)
896 { 916 {
917 pointer cp = POINTER (p);
897 set_typeflag (p, T_FREE); 918 set_typeflag (cp, T_PAIR);
898 set_car (p, NIL); 919 set_car (cp, NIL);
899 set_cdr (p, p + 1); 920 set_cdr (cp, POINTER (p + 1));
900 } 921 }
901 922
902 /* insert new cells in address order on free list */
903 if (SCHEME_V->free_cell == NIL || p < SCHEME_V->free_cell)
904 {
905 set_cdr (last, SCHEME_V->free_cell); 923 set_cdr (POINTER (last), SCHEME_V->free_cell);
906 SCHEME_V->free_cell = newp; 924 SCHEME_V->free_cell = POINTER (newp);
907 }
908 else
909 {
910 p = SCHEME_V->free_cell;
911 925
912 while (cdr (p) != NIL && newp > cdr (p))
913 p = cdr (p);
914
915 set_cdr (last, cdr (p));
916 set_cdr (p, newp);
917 }
918 }
919
920 return n; 926 return 1;
921} 927}
922 928
923/* get new cell. parameter a, b is marked by gc. */ 929/* get new cell. parameter a, b is marked by gc. */
924static INLINE pointer 930ecb_inline pointer
925get_cell_x (SCHEME_P_ pointer a, pointer b) 931get_cell_x (SCHEME_P_ pointer a, pointer b)
926{ 932{
927 if (ecb_expect_false (SCHEME_V->free_cell == NIL)) 933 if (ecb_expect_false (SCHEME_V->free_cell == NIL))
928 { 934 {
929 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 935 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
930 return S_SINK; 936 return S_SINK;
931 937
932 if (SCHEME_V->free_cell == NIL) 938 if (SCHEME_V->free_cell == NIL)
933 { 939 {
934 const int min_to_be_recovered = SCHEME_V->last_cell_seg < 128 ? 128 * 8 : SCHEME_V->last_cell_seg * 8; 940 const int min_to_be_recovered = SCHEME_V->cell_segsize [SCHEME_V->last_cell_seg] >> 1;
935 941
936 gc (SCHEME_A_ a, b); 942 gc (SCHEME_A_ a, b);
937 943
938 if (SCHEME_V->fcells < min_to_be_recovered || SCHEME_V->free_cell == NIL) 944 if (SCHEME_V->fcells < min_to_be_recovered || SCHEME_V->free_cell == NIL)
939 { 945 {
940 /* if only a few recovered, get more to avoid fruitless gc's */ 946 /* if only a few recovered, get more to avoid fruitless gc's */
941 if (!alloc_cellseg (SCHEME_A_ 1) && SCHEME_V->free_cell == NIL) 947 if (!alloc_cellseg (SCHEME_A) && SCHEME_V->free_cell == NIL)
942 { 948 {
943#if USE_ERROR_CHECKING 949#if USE_ERROR_CHECKING
944 SCHEME_V->no_memory = 1; 950 SCHEME_V->no_memory = 1;
945 return S_SINK; 951 return S_SINK;
946#endif 952#endif
… …
958 } 964 }
959} 965}
960 966
961/* To retain recent allocs before interpreter knows about them - 967/* To retain recent allocs before interpreter knows about them -
962 Tehom */ 968 Tehom */
963
964static void 969static void
965push_recent_alloc (SCHEME_P_ pointer recent, pointer extra) 970push_recent_alloc (SCHEME_P_ pointer recent, pointer extra)
966{ 971{
967 pointer holder = get_cell_x (SCHEME_A_ recent, extra); 972 pointer holder = get_cell_x (SCHEME_A_ recent, extra);
968 973
… …
990} 995}
991 996
992static pointer 997static pointer
993get_vector_object (SCHEME_P_ uint32_t len, pointer init) 998get_vector_object (SCHEME_P_ uint32_t len, pointer init)
994{ 999{
995 pointer v = get_cell_x (SCHEME_A_ 0, 0); 1000 pointer v = get_cell_x (SCHEME_A_ NIL, NIL);
996 pointer *e = malloc (len * sizeof (pointer)); 1001 pointer *e = malloc (len * sizeof (pointer));
997 1002
998 if (!e && USE_ERROR_CHECKING) 1003 if (!e && USE_ERROR_CHECKING)
999 return S_SINK; 1004 return S_SINK;
1000 1005
1001 /* Record it as a vector so that gc understands it. */ 1006 /* Record it as a vector so that gc understands it. */
1002 set_typeflag (v, T_VECTOR | T_ATOM); 1007 set_typeflag (v, T_VECTOR | T_ATOM);
1003 1008
1004 v->object.vector.vvalue = e; 1009 CELL(v)->object.vector.vvalue = e;
1005 v->object.vector.length = len; 1010 CELL(v)->object.vector.length = len;
1006 fill_vector (v, init); 1011 fill_vector (v, 0, init);
1007 push_recent_alloc (SCHEME_A_ v, NIL); 1012 push_recent_alloc (SCHEME_A_ v, NIL);
1008 1013
1009 return v; 1014 return v;
1010} 1015}
1011 1016
1012static INLINE void 1017ecb_inline void
1013ok_to_freely_gc (SCHEME_P) 1018ok_to_freely_gc (SCHEME_P)
1014{ 1019{
1015 set_car (S_SINK, NIL); 1020 set_car (S_SINK, NIL);
1016} 1021}
1017 1022
… …
1019static void 1024static void
1020check_cell_alloced (pointer p, int expect_alloced) 1025check_cell_alloced (pointer p, int expect_alloced)
1021{ 1026{
1022 /* Can't use putstr(SCHEME_A_ str) because callers have no access to sc. */ 1027 /* Can't use putstr(SCHEME_A_ str) because callers have no access to sc. */
1023 if (typeflag (p) & !expect_alloced) 1028 if (typeflag (p) & !expect_alloced)
1024 xwrstr ("Cell is already allocated!\n"); 1029 putstr (SCHEME_A_ "Cell is already allocated!\n");
1025 1030
1026 if (!(typeflag (p)) & expect_alloced) 1031 if (!(typeflag (p)) & expect_alloced)
1027 xwrstr ("Cell is not allocated!\n"); 1032 putstr (SCHEME_A_ "Cell is not allocated!\n");
1028} 1033}
1029 1034
1030static void 1035static void
1031check_range_alloced (pointer p, int n, int expect_alloced) 1036check_range_alloced (pointer p, int n, int expect_alloced)
1032{ 1037{
… …
1054 set_cdr (x, b); 1059 set_cdr (x, b);
1055 1060
1056 return x; 1061 return x;
1057} 1062}
1058 1063
1064static pointer
1065generate_symbol (SCHEME_P_ const char *name)
1066{
1067 pointer x = mk_string (SCHEME_A_ name);
1068 setimmutable (x);
1069 set_typeflag (x, T_SYMBOL | T_ATOM);
1070 return x;
1071}
1072
1059/* ========== oblist implementation ========== */ 1073/* ========== oblist implementation ========== */
1060 1074
1061#ifndef USE_OBJECT_LIST 1075#ifndef USE_OBJECT_LIST
1062 1076
1077static int
1063static int hash_fn (const char *key, int table_size); 1078hash_fn (const char *key, int table_size)
1079{
1080 const unsigned char *p = key;
1081 uint32_t hash = 2166136261;
1082
1083 while (*p)
1084 hash = (hash ^ *p++) * 16777619;
1085
1086 return hash % table_size;
1087}
1064 1088
1065static pointer 1089static pointer
1066oblist_initial_value (SCHEME_P) 1090oblist_initial_value (SCHEME_P)
1067{ 1091{
1068 return mk_vector (SCHEME_A_ 461); /* probably should be bigger */ 1092 return mk_vector (SCHEME_A_ 461); /* probably should be bigger */
… …
1070 1094
1071/* returns the new symbol */ 1095/* returns the new symbol */
1072static pointer 1096static pointer
1073oblist_add_by_name (SCHEME_P_ const char *name) 1097oblist_add_by_name (SCHEME_P_ const char *name)
1074{ 1098{
1075 int location; 1099 pointer x = generate_symbol (SCHEME_A_ name);
1076
1077 pointer x = immutable_cons (mk_string (SCHEME_A_ name), NIL);
1078 set_typeflag (x, T_SYMBOL);
1079 setimmutable (car (x));
1080
1081 location = hash_fn (name, veclength (SCHEME_V->oblist)); 1100 int location = hash_fn (name, veclength (SCHEME_V->oblist));
1082 set_vector_elem (SCHEME_V->oblist, location, immutable_cons (x, vector_elem (SCHEME_V->oblist, location))); 1101 vector_set (SCHEME_V->oblist, location, immutable_cons (x, vector_get (SCHEME_V->oblist, location)));
1083 return x; 1102 return x;
1084} 1103}
1085 1104
1086static INLINE pointer 1105ecb_inline pointer
1087oblist_find_by_name (SCHEME_P_ const char *name) 1106oblist_find_by_name (SCHEME_P_ const char *name)
1088{ 1107{
1089 int location; 1108 int location;
1090 pointer x; 1109 pointer x;
1091 char *s; 1110 char *s;
1092 1111
1093 location = hash_fn (name, veclength (SCHEME_V->oblist)); 1112 location = hash_fn (name, veclength (SCHEME_V->oblist));
1094 1113
1095 for (x = vector_elem (SCHEME_V->oblist, location); x != NIL; x = cdr (x)) 1114 for (x = vector_get (SCHEME_V->oblist, location); x != NIL; x = cdr (x))
1096 { 1115 {
1097 s = symname (car (x)); 1116 s = symname (car (x));
1098 1117
1099 /* case-insensitive, per R5RS section 2 */ 1118 /* case-insensitive, per R5RS section 2 */
1100 if (stricmp (name, s) == 0) 1119 if (stricmp (name, s) == 0)
… …
1110 int i; 1129 int i;
1111 pointer x; 1130 pointer x;
1112 pointer ob_list = NIL; 1131 pointer ob_list = NIL;
1113 1132
1114 for (i = 0; i < veclength (SCHEME_V->oblist); i++) 1133 for (i = 0; i < veclength (SCHEME_V->oblist); i++)
1115 for (x = vector_elem (SCHEME_V->oblist, i); x != NIL; x = cdr (x)) 1134 for (x = vector_get (SCHEME_V->oblist, i); x != NIL; x = cdr (x))
1116 ob_list = cons (x, ob_list); 1135 ob_list = cons (x, ob_list);
1117 1136
1118 return ob_list; 1137 return ob_list;
1119} 1138}
1120 1139
… …
1124oblist_initial_value (SCHEME_P) 1143oblist_initial_value (SCHEME_P)
1125{ 1144{
1126 return NIL; 1145 return NIL;
1127} 1146}
1128 1147
1129static INLINE pointer 1148ecb_inline pointer
1130oblist_find_by_name (SCHEME_P_ const char *name) 1149oblist_find_by_name (SCHEME_P_ const char *name)
1131{ 1150{
1132 pointer x; 1151 pointer x;
1133 char *s; 1152 char *s;
1134 1153
… …
1146 1165
1147/* returns the new symbol */ 1166/* returns the new symbol */
1148static pointer 1167static pointer
1149oblist_add_by_name (SCHEME_P_ const char *name) 1168oblist_add_by_name (SCHEME_P_ const char *name)
1150{ 1169{
1151 pointer x; 1170 pointer x = generate_symbol (SCHEME_A_ name);
1152
1153 x = immutable_cons (mk_string (SCHEME_A_ name), NIL);
1154 set_typeflag (x, T_SYMBOL);
1155 setimmutable (car (x));
1156 SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist); 1171 SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist);
1157 return x; 1172 return x;
1158} 1173}
1159 1174
1160static pointer 1175static pointer
… …
1170mk_port (SCHEME_P_ port *p) 1185mk_port (SCHEME_P_ port *p)
1171{ 1186{
1172 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1187 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1173 1188
1174 set_typeflag (x, T_PORT | T_ATOM); 1189 set_typeflag (x, T_PORT | T_ATOM);
1175 x->object.port = p; 1190 set_port (x, p);
1176 1191
1177 return x; 1192 return x;
1178} 1193}
1179#endif 1194#endif
1180 1195
1181pointer 1196pointer
1182mk_foreign_func (SCHEME_P_ foreign_func f) 1197mk_foreign_func (SCHEME_P_ foreign_func f)
1183{ 1198{
1184 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1199 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1185 1200
1186 set_typeflag (x, (T_FOREIGN | T_ATOM)); 1201 set_typeflag (x, T_FOREIGN | T_ATOM);
1187 x->object.ff = f; 1202 CELL(x)->object.ff = f;
1188 1203
1189 return x; 1204 return x;
1190} 1205}
1191 1206
1192INTERFACE pointer 1207INTERFACE pointer
1193mk_character (SCHEME_P_ int c) 1208mk_character (SCHEME_P_ int c)
1194{ 1209{
1195 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1210 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1196 1211
1197 set_typeflag (x, (T_CHARACTER | T_ATOM)); 1212 set_typeflag (x, T_CHARACTER | T_ATOM);
1198 ivalue_unchecked (x) = c & 0xff; 1213 set_ivalue (x, c & 0xff);
1199 set_num_integer (x); 1214
1200 return x; 1215 return x;
1201} 1216}
1202 1217
1203/* get number atom (integer) */ 1218/* get number atom (integer) */
1204INTERFACE pointer 1219INTERFACE pointer
1205mk_integer (SCHEME_P_ long num) 1220mk_integer (SCHEME_P_ long n)
1206{ 1221{
1222 pointer p = 0;
1223 pointer *pp = &p;
1224
1225#if USE_INTCACHE
1226 if (n >= INTCACHE_MIN && n <= INTCACHE_MAX)
1227 pp = &SCHEME_V->intcache[n - INTCACHE_MIN];
1228#endif
1229
1230 if (!*pp)
1231 {
1207 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1232 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1208 1233
1209 set_typeflag (x, (T_NUMBER | T_ATOM)); 1234 set_typeflag (x, T_INTEGER | T_ATOM);
1210 ivalue_unchecked (x) = num; 1235 setimmutable (x); /* shouldn't do anythi9ng, doesn't cost anything */
1211 set_num_integer (x); 1236 set_ivalue (x, n);
1237
1238 *pp = x;
1239 }
1240
1212 return x; 1241 return *pp;
1213} 1242}
1214 1243
1215INTERFACE pointer 1244INTERFACE pointer
1216mk_real (SCHEME_P_ RVALUE n) 1245mk_real (SCHEME_P_ RVALUE n)
1217{ 1246{
1247#if USE_REAL
1218 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1248 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1219 1249
1220 set_typeflag (x, (T_NUMBER | T_ATOM)); 1250 set_typeflag (x, T_REAL | T_ATOM);
1221 rvalue_unchecked (x) = n; 1251 set_rvalue (x, n);
1222 set_num_real (x); 1252
1223 return x; 1253 return x;
1254#else
1255 return mk_integer (SCHEME_A_ n);
1256#endif
1224} 1257}
1225 1258
1226static pointer 1259static pointer
1227mk_number (SCHEME_P_ const num n) 1260mk_number (SCHEME_P_ const num n)
1228{ 1261{
1262#if USE_REAL
1229 if (num_is_fixnum (n)) 1263 return num_is_fixnum (n)
1264 ? mk_integer (SCHEME_A_ num_ivalue (n))
1265 : mk_real (SCHEME_A_ num_rvalue (n));
1266#else
1230 return mk_integer (SCHEME_A_ num_get_ivalue (n)); 1267 return mk_integer (SCHEME_A_ num_ivalue (n));
1231 else 1268#endif
1232 return mk_real (SCHEME_A_ num_get_rvalue (n));
1233} 1269}
1234 1270
1235/* allocate name to string area */ 1271/* allocate name to string area */
1236static char * 1272static char *
1237store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill) 1273store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill)
… …
1243 SCHEME_V->no_memory = 1; 1279 SCHEME_V->no_memory = 1;
1244 return SCHEME_V->strbuff; 1280 return SCHEME_V->strbuff;
1245 } 1281 }
1246 1282
1247 if (str) 1283 if (str)
1248 { 1284 memcpy (q, str , len_str); /* caller must ensure that *str has length len_str */
1249 int l = strlen (str);
1250
1251 if (l > len_str)
1252 l = len_str;
1253
1254 memcpy (q, str, l);
1255 q[l] = 0;
1256 }
1257 else 1285 else
1258 {
1259 memset (q, fill, len_str); 1286 memset (q, fill, len_str);
1287
1260 q[len_str] = 0; 1288 q[len_str] = 0;
1261 }
1262 1289
1263 return q; 1290 return q;
1264} 1291}
1265 1292
1266INTERFACE pointer 1293INTERFACE pointer
… …
1280 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1307 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1281 1308
1282 set_typeflag (x, T_STRING | T_ATOM); 1309 set_typeflag (x, T_STRING | T_ATOM);
1283 strvalue (x) = store_string (SCHEME_A_ len, str, 0); 1310 strvalue (x) = store_string (SCHEME_A_ len, str, 0);
1284 strlength (x) = len; 1311 strlength (x) = len;
1312
1285 return x; 1313 return x;
1286} 1314}
1287 1315
1288INTERFACE pointer 1316INTERFACE pointer
1289mk_string (SCHEME_P_ const char *str) 1317mk_string (SCHEME_P_ const char *str)
… …
1296{ 1324{
1297 return get_vector_object (SCHEME_A_ len, NIL); 1325 return get_vector_object (SCHEME_A_ len, NIL);
1298} 1326}
1299 1327
1300INTERFACE void 1328INTERFACE void
1301fill_vector (pointer vec, pointer obj) 1329fill_vector (pointer vec, uint32_t start, pointer obj)
1302{ 1330{
1303 int i; 1331 int i;
1304 1332
1305 for (i = 0; i < vec->object.vector.length; i++) 1333 for (i = start; i < veclength (vec); i++)
1306 vecvalue (vec)[i] = obj; 1334 vecvalue (vec)[i] = obj;
1307} 1335}
1308 1336
1337INTERFACE void
1338vector_resize (pointer vec, uint32_t newsize, pointer fill)
1339{
1340 uint32_t oldsize = veclength (vec);
1341 vecvalue (vec) = realloc (vecvalue (vec), newsize * sizeof (pointer));
1342 veclength (vec) = newsize;
1343 fill_vector (vec, oldsize, fill);
1344}
1345
1309INTERFACE pointer 1346INTERFACE pointer
1310vector_elem (pointer vec, uint32_t ielem) 1347vector_get (pointer vec, uint32_t ielem)
1311{ 1348{
1312 return vecvalue(vec)[ielem]; 1349 return vecvalue(vec)[ielem];
1313} 1350}
1314 1351
1315INTERFACE void 1352INTERFACE void
1316set_vector_elem (pointer vec, uint32_t ielem, pointer a) 1353vector_set (pointer vec, uint32_t ielem, pointer a)
1317{ 1354{
1318 vecvalue(vec)[ielem] = a; 1355 vecvalue(vec)[ielem] = a;
1319} 1356}
1320 1357
1321/* get new symbol */ 1358/* get new symbol */
… …
1333 1370
1334INTERFACE pointer 1371INTERFACE pointer
1335gensym (SCHEME_P) 1372gensym (SCHEME_P)
1336{ 1373{
1337 pointer x; 1374 pointer x;
1338
1339 for (; SCHEME_V->gensym_cnt < LONG_MAX; SCHEME_V->gensym_cnt++)
1340 {
1341 char name[40] = "gensym-"; 1375 char name[40] = "gensym-";
1342 xnum (name + 7, SCHEME_V->gensym_cnt); 1376 xnum (name + 7, ++SCHEME_V->gensym_cnt);
1343 1377
1344 /* first check oblist */ 1378 return generate_symbol (SCHEME_A_ name);
1345 x = oblist_find_by_name (SCHEME_A_ name); 1379}
1346 1380
1347 if (x == NIL) 1381static int
1348 { 1382is_gensym (SCHEME_P_ pointer x)
1349 x = oblist_add_by_name (SCHEME_A_ name); 1383{
1350 return x; 1384 return is_symbol (x) && oblist_find_by_name (SCHEME_A_ strvalue (x)) != x;
1351 }
1352 }
1353
1354 return NIL;
1355} 1385}
1356 1386
1357/* make symbol or number atom from string */ 1387/* make symbol or number atom from string */
1358static pointer 1388static pointer
1359mk_atom (SCHEME_P_ char *q) 1389mk_atom (SCHEME_P_ char *q)
… …
1413 } 1443 }
1414 else if ((c == 'e') || (c == 'E')) 1444 else if ((c == 'e') || (c == 'E'))
1415 { 1445 {
1416 if (!has_fp_exp) 1446 if (!has_fp_exp)
1417 { 1447 {
1418 has_dec_point = 1; /* decimal point illegal 1448 has_dec_point = 1; /* decimal point illegal from now on */
1419 from now on */
1420 p++; 1449 p++;
1421 1450
1422 if ((*p == '-') || (*p == '+') || isdigit (*p)) 1451 if ((*p == '-') || (*p == '+') || isdigit (*p))
1423 continue; 1452 continue;
1424 } 1453 }
… …
1512 1541
1513 if (ecb_expect_false (is_vector (p))) 1542 if (ecb_expect_false (is_vector (p)))
1514 { 1543 {
1515 int i; 1544 int i;
1516 1545
1517 for (i = 0; i < p->object.vector.length; i++) 1546 for (i = 0; i < veclength (p); i++)
1518 mark (vecvalue (p)[i]); 1547 mark (vecvalue (p)[i]);
1519 } 1548 }
1520 1549
1521 if (is_atom (p)) 1550 if (is_atom (p))
1522 goto E6; 1551 goto E6;
… …
1569 1598
1570/* garbage collection. parameter a, b is marked. */ 1599/* garbage collection. parameter a, b is marked. */
1571static void 1600static void
1572gc (SCHEME_P_ pointer a, pointer b) 1601gc (SCHEME_P_ pointer a, pointer b)
1573{ 1602{
1574 pointer p;
1575 int i; 1603 int i;
1576 1604
1577 if (SCHEME_V->gc_verbose) 1605 if (SCHEME_V->gc_verbose)
1578 putstr (SCHEME_A_ "gc..."); 1606 putstr (SCHEME_A_ "gc...");
1579 1607
… …
1595 /* Mark recent objects the interpreter doesn't know about yet. */ 1623 /* Mark recent objects the interpreter doesn't know about yet. */
1596 mark (car (S_SINK)); 1624 mark (car (S_SINK));
1597 /* Mark any older stuff above nested C calls */ 1625 /* Mark any older stuff above nested C calls */
1598 mark (SCHEME_V->c_nest); 1626 mark (SCHEME_V->c_nest);
1599 1627
1628#if USE_INTCACHE
1629 /* mark intcache */
1630 for (i = INTCACHE_MIN; i <= INTCACHE_MAX; ++i)
1631 if (SCHEME_V->intcache[i - INTCACHE_MIN])
1632 mark (SCHEME_V->intcache[i - INTCACHE_MIN]);
1633#endif
1634
1600 /* mark variables a, b */ 1635 /* mark variables a, b */
1601 mark (a); 1636 mark (a);
1602 mark (b); 1637 mark (b);
1603 1638
1604 /* garbage collect */ 1639 /* garbage collect */
1605 clrmark (NIL); 1640 clrmark (NIL);
1606 SCHEME_V->fcells = 0; 1641 SCHEME_V->fcells = 0;
1607 SCHEME_V->free_cell = NIL; 1642 SCHEME_V->free_cell = NIL;
1608 1643
1609 /* free-list is kept sorted by address so as to maintain consecutive 1644 if (SCHEME_V->gc_verbose)
1610 ranges, if possible, for use with vectors. Here we scan the cells 1645 putstr (SCHEME_A_ "freeing...");
1611 (which are also kept sorted by address) downwards to build the 1646
1612 free-list in sorted order. 1647 uint32_t total = 0;
1613 */ 1648
1649 /* Here we scan the cells to build the free-list. */
1614 for (i = SCHEME_V->last_cell_seg; i >= 0; i--) 1650 for (i = SCHEME_V->last_cell_seg; i >= 0; i--)
1615 { 1651 {
1616 p = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i]; 1652 struct cell *end = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i];
1653 struct cell *p;
1654 total += SCHEME_V->cell_segsize [i];
1617 1655
1618 while (--p >= SCHEME_V->cell_seg[i]) 1656 for (p = SCHEME_V->cell_seg[i]; p < end; ++p)
1619 { 1657 {
1658 pointer c = POINTER (p);
1659
1620 if (is_mark (p)) 1660 if (is_mark (c))
1621 clrmark (p); 1661 clrmark (c);
1622 else 1662 else
1623 { 1663 {
1624 /* reclaim cell */ 1664 /* reclaim cell */
1625 if (typeflag (p) != T_FREE) 1665 if (typeflag (c) != T_PAIR)
1626 { 1666 {
1627 finalize_cell (SCHEME_A_ p); 1667 finalize_cell (SCHEME_A_ c);
1628 set_typeflag (p, T_FREE); 1668 set_typeflag (c, T_PAIR);
1629 set_car (p, NIL); 1669 set_car (c, NIL);
1630 } 1670 }
1631 1671
1632 ++SCHEME_V->fcells; 1672 ++SCHEME_V->fcells;
1633 set_cdr (p, SCHEME_V->free_cell); 1673 set_cdr (c, SCHEME_V->free_cell);
1634 SCHEME_V->free_cell = p; 1674 SCHEME_V->free_cell = c;
1635 } 1675 }
1636 } 1676 }
1637 } 1677 }
1638 1678
1639 if (SCHEME_V->gc_verbose) 1679 if (SCHEME_V->gc_verbose)
1640 xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" cells were recovered.\n"); 1680 {
1681 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");
1682 }
1641} 1683}
1642 1684
1643static void 1685static void
1644finalize_cell (SCHEME_P_ pointer a) 1686finalize_cell (SCHEME_P_ pointer a)
1645{ 1687{
1646 /* TODO, fast bitmap check? */ 1688 /* TODO, fast bitmap check? */
1647 if (is_string (a)) 1689 if (is_string (a) || is_symbol (a))
1648 free (strvalue (a)); 1690 free (strvalue (a));
1649 else if (is_vector (a)) 1691 else if (is_vector (a))
1650 free (vecvalue (a)); 1692 free (vecvalue (a));
1651#if USE_PORTS 1693#if USE_PORTS
1652 else if (is_port (a)) 1694 else if (is_port (a))
1653 { 1695 {
1654 if (a->object.port->kind & port_file && a->object.port->rep.stdio.closeit) 1696 if (port(a)->kind & port_file && port (a)->rep.stdio.closeit)
1655 port_close (SCHEME_A_ a, port_input | port_output); 1697 port_close (SCHEME_A_ a, port_input | port_output);
1656 1698
1657 free (a->object.port); 1699 free (port (a));
1658 } 1700 }
1659#endif 1701#endif
1660} 1702}
1661 1703
1662/* ========== Routines for Reading ========== */ 1704/* ========== Routines for Reading ========== */
… …
1678 SCHEME_V->load_stack[SCHEME_V->file_i].unget = -1; 1720 SCHEME_V->load_stack[SCHEME_V->file_i].unget = -1;
1679 SCHEME_V->load_stack[SCHEME_V->file_i].kind = port_file | port_input; 1721 SCHEME_V->load_stack[SCHEME_V->file_i].kind = port_file | port_input;
1680 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.file = fin; 1722 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.file = fin;
1681 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.closeit = 1; 1723 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.closeit = 1;
1682 SCHEME_V->nesting_stack[SCHEME_V->file_i] = 0; 1724 SCHEME_V->nesting_stack[SCHEME_V->file_i] = 0;
1683 SCHEME_V->loadport->object.port = SCHEME_V->load_stack + SCHEME_V->file_i; 1725 set_port (SCHEME_V->loadport, SCHEME_V->load_stack + SCHEME_V->file_i);
1684 1726
1685#if SHOW_ERROR_LINE 1727#if SHOW_ERROR_LINE
1686 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line = 0; 1728 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line = 0;
1687 1729
1688 if (fname) 1730 if (fname)
… …
1705 SCHEME_V->nesting = SCHEME_V->nesting_stack[SCHEME_V->file_i]; 1747 SCHEME_V->nesting = SCHEME_V->nesting_stack[SCHEME_V->file_i];
1706#if USE_PORTS 1748#if USE_PORTS
1707 port_close (SCHEME_A_ SCHEME_V->loadport, port_input); 1749 port_close (SCHEME_A_ SCHEME_V->loadport, port_input);
1708#endif 1750#endif
1709 SCHEME_V->file_i--; 1751 SCHEME_V->file_i--;
1710 SCHEME_V->loadport->object.port = SCHEME_V->load_stack + SCHEME_V->file_i; 1752 set_port (SCHEME_V->loadport, SCHEME_V->load_stack + SCHEME_V->file_i);
1711 } 1753 }
1712} 1754}
1713 1755
1714static int 1756static int
1715file_interactive (SCHEME_P) 1757file_interactive (SCHEME_P)
1716{ 1758{
1717#if USE_PORTS 1759#if USE_PORTS
1718 return SCHEME_V->file_i == 0 1760 return SCHEME_V->file_i == 0
1719 && SCHEME_V->load_stack[0].rep.stdio.file == STDIN_FILENO 1761 && SCHEME_V->load_stack[0].rep.stdio.file == STDIN_FILENO
1720 && (SCHEME_V->inport->object.port->kind & port_file); 1762 && (port (SCHEME_V->inport)->kind & port_file);
1721#else 1763#else
1722 return 0; 1764 return 0;
1723#endif 1765#endif
1724} 1766}
1725 1767
… …
1859} 1901}
1860 1902
1861static void 1903static void
1862port_close (SCHEME_P_ pointer p, int flag) 1904port_close (SCHEME_P_ pointer p, int flag)
1863{ 1905{
1864 port *pt = p->object.port; 1906 port *pt = port (p);
1865 1907
1866 pt->kind &= ~flag; 1908 pt->kind &= ~flag;
1867 1909
1868 if ((pt->kind & (port_input | port_output)) == 0) 1910 if ((pt->kind & (port_input | port_output)) == 0)
1869 { 1911 {
… …
1890/* get new character from input file */ 1932/* get new character from input file */
1891static int 1933static int
1892inchar (SCHEME_P) 1934inchar (SCHEME_P)
1893{ 1935{
1894 int c; 1936 int c;
1895 port *pt; 1937 port *pt = port (SCHEME_V->inport);
1896
1897 pt = SCHEME_V->inport->object.port;
1898 1938
1899 if (pt->kind & port_saw_EOF) 1939 if (pt->kind & port_saw_EOF)
1900 return EOF; 1940 return EOF;
1901 1941
1902 c = basic_inchar (pt); 1942 c = basic_inchar (pt);
… …
1969 port *pt; 2009 port *pt;
1970 2010
1971 if (c == EOF) 2011 if (c == EOF)
1972 return; 2012 return;
1973 2013
1974 pt = SCHEME_V->inport->object.port; 2014 pt = port (SCHEME_V->inport);
1975 pt->unget = c; 2015 pt->unget = c;
1976#else 2016#else
1977 if (c == EOF) 2017 if (c == EOF)
1978 return; 2018 return;
1979 2019
… …
2007 2047
2008INTERFACE void 2048INTERFACE void
2009putstr (SCHEME_P_ const char *s) 2049putstr (SCHEME_P_ const char *s)
2010{ 2050{
2011#if USE_PORTS 2051#if USE_PORTS
2012 port *pt = SCHEME_V->outport->object.port; 2052 port *pt = port (SCHEME_V->outport);
2013 2053
2014 if (pt->kind & port_file) 2054 if (pt->kind & port_file)
2015 write (pt->rep.stdio.file, s, strlen (s)); 2055 write (pt->rep.stdio.file, s, strlen (s));
2016 else 2056 else
2017 for (; *s; s++) 2057 for (; *s; s++)
… …
2019 *pt->rep.string.curr++ = *s; 2059 *pt->rep.string.curr++ = *s;
2020 else if (pt->kind & port_srfi6 && realloc_port_string (SCHEME_A_ pt)) 2060 else if (pt->kind & port_srfi6 && realloc_port_string (SCHEME_A_ pt))
2021 *pt->rep.string.curr++ = *s; 2061 *pt->rep.string.curr++ = *s;
2022 2062
2023#else 2063#else
2024 xwrstr (s); 2064 write (pt->rep.stdio.file, s, strlen (s));
2025#endif 2065#endif
2026} 2066}
2027 2067
2028static void 2068static void
2029putchars (SCHEME_P_ const char *s, int len) 2069putchars (SCHEME_P_ const char *s, int len)
2030{ 2070{
2031#if USE_PORTS 2071#if USE_PORTS
2032 port *pt = SCHEME_V->outport->object.port; 2072 port *pt = port (SCHEME_V->outport);
2033 2073
2034 if (pt->kind & port_file) 2074 if (pt->kind & port_file)
2035 write (pt->rep.stdio.file, s, len); 2075 write (pt->rep.stdio.file, s, len);
2036 else 2076 else
2037 { 2077 {
… …
2051 2091
2052INTERFACE void 2092INTERFACE void
2053putcharacter (SCHEME_P_ int c) 2093putcharacter (SCHEME_P_ int c)
2054{ 2094{
2055#if USE_PORTS 2095#if USE_PORTS
2056 port *pt = SCHEME_V->outport->object.port; 2096 port *pt = port (SCHEME_V->outport);
2057 2097
2058 if (pt->kind & port_file) 2098 if (pt->kind & port_file)
2059 { 2099 {
2060 char cc = c; 2100 char cc = c;
2061 write (pt->rep.stdio.file, &cc, 1); 2101 write (pt->rep.stdio.file, &cc, 1);
… …
2074#endif 2114#endif
2075} 2115}
2076 2116
2077/* read characters up to delimiter, but cater to character constants */ 2117/* read characters up to delimiter, but cater to character constants */
2078static char * 2118static char *
2079readstr_upto (SCHEME_P_ char *delim) 2119readstr_upto (SCHEME_P_ int skip, const char *delim)
2080{ 2120{
2081 char *p = SCHEME_V->strbuff; 2121 char *p = SCHEME_V->strbuff + skip;
2082 2122
2083 while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A)))); 2123 while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A))));
2084 2124
2085 if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\') 2125 if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\')
2086 *p = 0; 2126 *p = 0;
… …
2093 return SCHEME_V->strbuff; 2133 return SCHEME_V->strbuff;
2094} 2134}
2095 2135
2096/* read string expression "xxx...xxx" */ 2136/* read string expression "xxx...xxx" */
2097static pointer 2137static pointer
2098readstrexp (SCHEME_P) 2138readstrexp (SCHEME_P_ char delim)
2099{ 2139{
2100 char *p = SCHEME_V->strbuff; 2140 char *p = SCHEME_V->strbuff;
2101 int c; 2141 int c;
2102 int c1 = 0; 2142 int c1 = 0;
2103 enum
2104 { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok; 2143 enum { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok;
2105 2144
2106 for (;;) 2145 for (;;)
2107 { 2146 {
2108 c = inchar (SCHEME_A); 2147 c = inchar (SCHEME_A);
2109 2148
… …
2111 return S_F; 2150 return S_F;
2112 2151
2113 switch (state) 2152 switch (state)
2114 { 2153 {
2115 case st_ok: 2154 case st_ok:
2116 switch (c) 2155 if (ecb_expect_false (c == delim))
2117 {
2118 case '\\':
2119 state = st_bsl;
2120 break;
2121
2122 case '"':
2123 *p = 0;
2124 return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff); 2156 return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff);
2125 2157
2126 default: 2158 if (ecb_expect_false (c == '\\'))
2159 state = st_bsl;
2160 else
2127 *p++ = c; 2161 *p++ = c;
2128 break;
2129 }
2130 2162
2131 break; 2163 break;
2132 2164
2133 case st_bsl: 2165 case st_bsl:
2134 switch (c) 2166 switch (c)
… …
2164 case 'r': 2196 case 'r':
2165 *p++ = '\r'; 2197 *p++ = '\r';
2166 state = st_ok; 2198 state = st_ok;
2167 break; 2199 break;
2168 2200
2169 case '"':
2170 *p++ = '"';
2171 state = st_ok;
2172 break;
2173
2174 default: 2201 default:
2175 *p++ = c; 2202 *p++ = c;
2176 state = st_ok; 2203 state = st_ok;
2177 break; 2204 break;
2178 } 2205 }
2179 2206
2180 break; 2207 break;
2181 2208
2182 case st_x1: 2209 case st_x1:
2183 case st_x2: 2210 case st_x2:
2184 c = toupper (c); 2211 c = tolower (c);
2185 2212
2186 if (c >= '0' && c <= 'F') 2213 if (c >= '0' && c <= '9')
2187 {
2188 if (c <= '9')
2189 c1 = (c1 << 4) + c - '0'; 2214 c1 = (c1 << 4) + c - '0';
2190 else 2215 else if (c >= 'a' && c <= 'f')
2191 c1 = (c1 << 4) + c - 'A' + 10; 2216 c1 = (c1 << 4) + c - 'a' + 10;
2192
2193 if (state == st_x1)
2194 state = st_x2;
2195 else
2196 {
2197 *p++ = c1;
2198 state = st_ok;
2199 }
2200 }
2201 else 2217 else
2202 return S_F; 2218 return S_F;
2219
2220 if (state == st_x1)
2221 state = st_x2;
2222 else
2223 {
2224 *p++ = c1;
2225 state = st_ok;
2226 }
2203 2227
2204 break; 2228 break;
2205 2229
2206 case st_oct1: 2230 case st_oct1:
2207 case st_oct2: 2231 case st_oct2:
… …
2211 backchar (SCHEME_A_ c); 2235 backchar (SCHEME_A_ c);
2212 state = st_ok; 2236 state = st_ok;
2213 } 2237 }
2214 else 2238 else
2215 { 2239 {
2216 if (state == st_oct2 && c1 >= 32) 2240 if (state == st_oct2 && c1 >= ' ')
2217 return S_F; 2241 return S_F;
2218 2242
2219 c1 = (c1 << 3) + (c - '0'); 2243 c1 = (c1 << 3) + (c - '0');
2220 2244
2221 if (state == st_oct1) 2245 if (state == st_oct1)
… …
2226 state = st_ok; 2250 state = st_ok;
2227 } 2251 }
2228 } 2252 }
2229 2253
2230 break; 2254 break;
2231
2232 } 2255 }
2233 } 2256 }
2234} 2257}
2235 2258
2236/* check c is in chars */ 2259/* check c is in chars */
2237static INLINE int 2260ecb_inline int
2238is_one_of (char *s, int c) 2261is_one_of (const char *s, int c)
2239{ 2262{
2240 if (c == EOF)
2241 return 1;
2242
2243 return !!strchr (s, c); 2263 return c == EOF || !!strchr (s, c);
2244} 2264}
2245 2265
2246/* skip white characters */ 2266/* skip white characters */
2247static INLINE int 2267ecb_inline int
2248skipspace (SCHEME_P) 2268skipspace (SCHEME_P)
2249{ 2269{
2250 int c, curr_line = 0; 2270 int c, curr_line = 0;
2251 2271
2252 do 2272 do
2253 { 2273 {
2254 c = inchar (SCHEME_A); 2274 c = inchar (SCHEME_A);
2275
2255#if SHOW_ERROR_LINE 2276#if SHOW_ERROR_LINE
2256 if (c == '\n') 2277 if (ecb_expect_false (c == '\n'))
2257 curr_line++; 2278 curr_line++;
2258#endif 2279#endif
2280
2281 if (ecb_expect_false (c == EOF))
2282 return c;
2259 } 2283 }
2260 while (c == ' ' || c == '\n' || c == '\r' || c == '\t'); 2284 while (is_one_of (WHITESPACE, c));
2261 2285
2262 /* record it */ 2286 /* record it */
2263#if SHOW_ERROR_LINE 2287#if SHOW_ERROR_LINE
2264 if (SCHEME_V->load_stack[SCHEME_V->file_i].kind & port_file) 2288 if (SCHEME_V->load_stack[SCHEME_V->file_i].kind & port_file)
2265 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line += curr_line; 2289 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line += curr_line;
2266#endif 2290#endif
2267 2291
2268 if (c != EOF)
2269 {
2270 backchar (SCHEME_A_ c); 2292 backchar (SCHEME_A_ c);
2271 return 1; 2293 return 1;
2272 }
2273 else
2274 return EOF;
2275} 2294}
2276 2295
2277/* get token */ 2296/* get token */
2278static int 2297static int
2279token (SCHEME_P) 2298token (SCHEME_P)
… …
2295 return TOK_RPAREN; 2314 return TOK_RPAREN;
2296 2315
2297 case '.': 2316 case '.':
2298 c = inchar (SCHEME_A); 2317 c = inchar (SCHEME_A);
2299 2318
2300 if (is_one_of (" \n\t", c)) 2319 if (is_one_of (WHITESPACE, c))
2301 return TOK_DOT; 2320 return TOK_DOT;
2302 else 2321 else
2303 { 2322 {
2304 //TODO: ungetc twice in a row is not supported in C
2305 backchar (SCHEME_A_ c); 2323 backchar (SCHEME_A_ c);
2306 backchar (SCHEME_A_ '.');
2307 return TOK_ATOM; 2324 return TOK_DOTATOM;
2308 } 2325 }
2326
2327 case '|':
2328 return TOK_STRATOM;
2309 2329
2310 case '\'': 2330 case '\'':
2311 return TOK_QUOTE; 2331 return TOK_QUOTE;
2312 2332
2313 case ';': 2333 case ';':
… …
2445 } 2465 }
2446 2466
2447 putcharacter (SCHEME_A_ '"'); 2467 putcharacter (SCHEME_A_ '"');
2448} 2468}
2449 2469
2450
2451/* print atoms */ 2470/* print atoms */
2452static void 2471static void
2453printatom (SCHEME_P_ pointer l, int f) 2472printatom (SCHEME_P_ pointer l, int f)
2454{ 2473{
2455 char *p; 2474 char *p;
2456 int len; 2475 int len;
2457 2476
2458 atom2str (SCHEME_A_ l, f, &p, &len); 2477 atom2str (SCHEME_A_ l, f, &p, &len);
2459 putchars (SCHEME_A_ p, len); 2478 putchars (SCHEME_A_ p, len);
2460} 2479}
2461
2462 2480
2463/* Uses internal buffer unless string pointer is already available */ 2481/* Uses internal buffer unless string pointer is already available */
2464static void 2482static void
2465atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen) 2483atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen)
2466{ 2484{
… …
2480 { 2498 {
2481 p = SCHEME_V->strbuff; 2499 p = SCHEME_V->strbuff;
2482 2500
2483 if (f <= 1 || f == 10) /* f is the base for numbers if > 1 */ 2501 if (f <= 1 || f == 10) /* f is the base for numbers if > 1 */
2484 { 2502 {
2485 if (num_is_integer (l)) 2503 if (is_integer (l))
2486 xnum (p, ivalue_unchecked (l)); 2504 xnum (p, ivalue_unchecked (l));
2487#if USE_REAL 2505#if USE_REAL
2488 else 2506 else
2489 { 2507 {
2490 snprintf (p, STRBUFFSIZE, "%.10g", rvalue_unchecked (l)); 2508 snprintf (p, STRBUFFSIZE, "%.10g", rvalue_unchecked (l));
… …
2627#endif 2645#endif
2628 } 2646 }
2629 else if (is_continuation (l)) 2647 else if (is_continuation (l))
2630 p = "#<CONTINUATION>"; 2648 p = "#<CONTINUATION>";
2631 else 2649 else
2650 {
2651#if USE_PRINTF
2652 p = SCHEME_V->strbuff;
2653 snprintf (p, STRBUFFSIZE, "#<ERROR %x>", (int)typeflag (l));
2654#else
2632 p = "#<ERROR>"; 2655 p = "#<ERROR>";
2656#endif
2657 }
2633 2658
2634 *pp = p; 2659 *pp = p;
2635 *plen = strlen (p); 2660 *plen = strlen (p);
2636} 2661}
2637 2662
… …
2745 return 0; 2770 return 0;
2746 } 2771 }
2747 else if (is_number (a)) 2772 else if (is_number (a))
2748 { 2773 {
2749 if (is_number (b)) 2774 if (is_number (b))
2750 if (num_is_integer (a) == num_is_integer (b))
2751 return num_cmp (nvalue (a), nvalue (b)) == 0; 2775 return num_cmp (nvalue (a), nvalue (b)) == 0;
2752 2776
2753 return 0; 2777 return 0;
2754 } 2778 }
2755 else if (is_character (a)) 2779 else if (is_character (a))
2756 { 2780 {
… …
2782/* () is #t in R5RS */ 2806/* () is #t in R5RS */
2783#define is_true(p) ((p) != S_F) 2807#define is_true(p) ((p) != S_F)
2784#define is_false(p) ((p) == S_F) 2808#define is_false(p) ((p) == S_F)
2785 2809
2786/* ========== Environment implementation ========== */ 2810/* ========== Environment implementation ========== */
2787
2788#if !defined(USE_ALIST_ENV) || !defined(USE_OBJECT_LIST)
2789
2790static int
2791hash_fn (const char *key, int table_size)
2792{
2793 const unsigned char *p = key;
2794 uint32_t hash = 2166136261;
2795
2796 while (*p)
2797 hash = (hash ^ *p++) * 16777619;
2798
2799 return hash % table_size;
2800}
2801#endif
2802 2811
2803#ifndef USE_ALIST_ENV 2812#ifndef USE_ALIST_ENV
2804 2813
2805/* 2814/*
2806 * In this implementation, each frame of the environment may be 2815 * In this implementation, each frame of the environment may be
… …
2823 2832
2824 SCHEME_V->envir = immutable_cons (new_frame, old_env); 2833 SCHEME_V->envir = immutable_cons (new_frame, old_env);
2825 setenvironment (SCHEME_V->envir); 2834 setenvironment (SCHEME_V->envir);
2826} 2835}
2827 2836
2828static INLINE void 2837static uint32_t
2838sym_hash (pointer sym, uint32_t size)
2839{
2840 uintptr_t ptr = (uintptr_t)sym;
2841
2842#if 0
2843 /* table size is prime, so why mix */
2844 ptr += ptr >> 32;
2845 ptr += ptr >> 16;
2846 ptr += ptr >> 8;
2847#endif
2848
2849 return ptr % size;
2850}
2851
2852ecb_inline void
2829new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) 2853new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
2830{ 2854{
2831 pointer slot = immutable_cons (variable, value); 2855 pointer slot = immutable_cons (variable, value);
2832 2856
2833 if (is_vector (car (env))) 2857 if (is_vector (car (env)))
2834 { 2858 {
2835 int location = hash_fn (symname (variable), veclength (car (env))); 2859 int location = sym_hash (variable, veclength (car (env)));
2836
2837 set_vector_elem (car (env), location, immutable_cons (slot, vector_elem (car (env), location))); 2860 vector_set (car (env), location, immutable_cons (slot, vector_get (car (env), location)));
2838 } 2861 }
2839 else 2862 else
2840 set_car (env, immutable_cons (slot, car (env))); 2863 set_car (env, immutable_cons (slot, car (env)));
2841} 2864}
2842 2865
2843static pointer 2866static pointer
2844find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all) 2867find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all)
2845{ 2868{
2846 pointer x, y; 2869 pointer x, y;
2847 int location;
2848 2870
2849 for (x = env; x != NIL; x = cdr (x)) 2871 for (x = env; x != NIL; x = cdr (x))
2850 { 2872 {
2851 if (is_vector (car (x))) 2873 if (is_vector (car (x)))
2852 { 2874 {
2853 location = hash_fn (symname (hdl), veclength (car (x))); 2875 int location = sym_hash (hdl, veclength (car (x)));
2854 y = vector_elem (car (x), location); 2876 y = vector_get (car (x), location);
2855 } 2877 }
2856 else 2878 else
2857 y = car (x); 2879 y = car (x);
2858 2880
2859 for (; y != NIL; y = cdr (y)) 2881 for (; y != NIL; y = cdr (y))
2860 if (caar (y) == hdl) 2882 if (caar (y) == hdl)
2861 break; 2883 break;
2862 2884
2863 if (y != NIL) 2885 if (y != NIL)
2886 return car (y);
2887
2888 if (!all)
2864 break; 2889 break;
2865
2866 if (!all)
2867 return NIL;
2868 } 2890 }
2869
2870 if (x != NIL)
2871 return car (y);
2872 2891
2873 return NIL; 2892 return NIL;
2874} 2893}
2875 2894
2876#else /* USE_ALIST_ENV */ 2895#else /* USE_ALIST_ENV */
2877 2896
2878static INLINE void 2897ecb_inline void
2879new_frame_in_env (SCHEME_P_ pointer old_env) 2898new_frame_in_env (SCHEME_P_ pointer old_env)
2880{ 2899{
2881 SCHEME_V->envir = immutable_cons (NIL, old_env); 2900 SCHEME_V->envir = immutable_cons (NIL, old_env);
2882 setenvironment (SCHEME_V->envir); 2901 setenvironment (SCHEME_V->envir);
2883} 2902}
2884 2903
2885static INLINE void 2904ecb_inline void
2886new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) 2905new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
2887{ 2906{
2888 set_car (env, immutable_cons (immutable_cons (variable, value), car (env))); 2907 set_car (env, immutable_cons (immutable_cons (variable, value), car (env)));
2889} 2908}
2890 2909
… …
2898 for (y = car (x); y != NIL; y = cdr (y)) 2917 for (y = car (x); y != NIL; y = cdr (y))
2899 if (caar (y) == hdl) 2918 if (caar (y) == hdl)
2900 break; 2919 break;
2901 2920
2902 if (y != NIL) 2921 if (y != NIL)
2922 return car (y);
2903 break; 2923 break;
2904 2924
2905 if (!all) 2925 if (!all)
2906 return NIL; 2926 break;
2907 } 2927 }
2908
2909 if (x != NIL)
2910 return car (y);
2911 2928
2912 return NIL; 2929 return NIL;
2913} 2930}
2914 2931
2915#endif /* USE_ALIST_ENV else */ 2932#endif /* USE_ALIST_ENV else */
2916 2933
2917static INLINE void 2934ecb_inline void
2918new_slot_in_env (SCHEME_P_ pointer variable, pointer value) 2935new_slot_in_env (SCHEME_P_ pointer variable, pointer value)
2919{ 2936{
2937 assert (is_symbol (variable));//TODO: bug in current-ws/OP_LET2
2920 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value); 2938 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value);
2921} 2939}
2922 2940
2923static INLINE void 2941ecb_inline void
2924set_slot_in_env (SCHEME_P_ pointer slot, pointer value) 2942set_slot_in_env (SCHEME_P_ pointer slot, pointer value)
2925{ 2943{
2926 set_cdr (slot, value); 2944 set_cdr (slot, value);
2927} 2945}
2928 2946
2929static INLINE pointer 2947ecb_inline pointer
2930slot_value_in_env (pointer slot) 2948slot_value_in_env (pointer slot)
2931{ 2949{
2932 return cdr (slot); 2950 return cdr (slot);
2933} 2951}
2934 2952
2935/* ========== Evaluation Cycle ========== */ 2953/* ========== Evaluation Cycle ========== */
2936 2954
2937static pointer 2955static int
2938xError_1 (SCHEME_P_ const char *s, pointer a) 2956xError_1 (SCHEME_P_ const char *s, pointer a)
2939{ 2957{
2940#if USE_ERROR_HOOK 2958#if USE_ERROR_HOOK
2941 pointer x; 2959 pointer x;
2942 pointer hdl = SCHEME_V->ERROR_HOOK; 2960 pointer hdl = SCHEME_V->ERROR_HOOK;
… …
2977 code = cons (mk_string (SCHEME_A_ s), code); 2995 code = cons (mk_string (SCHEME_A_ s), code);
2978 setimmutable (car (code)); 2996 setimmutable (car (code));
2979 SCHEME_V->code = cons (slot_value_in_env (x), code); 2997 SCHEME_V->code = cons (slot_value_in_env (x), code);
2980 SCHEME_V->op = OP_EVAL; 2998 SCHEME_V->op = OP_EVAL;
2981 2999
2982 return S_T; 3000 return 0;
2983 } 3001 }
2984#endif 3002#endif
2985 3003
2986 if (a) 3004 if (a)
2987 SCHEME_V->args = cons (a, NIL); 3005 SCHEME_V->args = cons (a, NIL);
… …
2989 SCHEME_V->args = NIL; 3007 SCHEME_V->args = NIL;
2990 3008
2991 SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args); 3009 SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args);
2992 setimmutable (car (SCHEME_V->args)); 3010 setimmutable (car (SCHEME_V->args));
2993 SCHEME_V->op = OP_ERR0; 3011 SCHEME_V->op = OP_ERR0;
3012
2994 return S_T; 3013 return 0;
2995} 3014}
2996 3015
2997#define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a) 3016#define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a)
2998#define Error_0(s) Error_1 (s, 0) 3017#define Error_0(s) Error_1 (s, 0)
2999 3018
3000/* Too small to turn into function */ 3019/* Too small to turn into function */
3001#define BEGIN do { 3020#define BEGIN do {
3002#define END } while (0) 3021#define END } while (0)
3003#define s_goto(a) BEGIN \ 3022#define s_goto(a) BEGIN \
3004 SCHEME_V->op = a; \ 3023 SCHEME_V->op = a; \
3005 return S_T; END 3024 return 0; END
3006 3025
3007#define s_return(a) return xs_return (SCHEME_A_ a) 3026#define s_return(a) return xs_return (SCHEME_A_ a)
3008 3027
3009#ifndef USE_SCHEME_STACK 3028#ifndef USE_SCHEME_STACK
3010 3029
… …
3024{ 3043{
3025 int nframes = (uintptr_t)SCHEME_V->dump; 3044 int nframes = (uintptr_t)SCHEME_V->dump;
3026 struct dump_stack_frame *next_frame; 3045 struct dump_stack_frame *next_frame;
3027 3046
3028 /* enough room for the next frame? */ 3047 /* enough room for the next frame? */
3029 if (nframes >= SCHEME_V->dump_size) 3048 if (ecb_expect_false (nframes >= SCHEME_V->dump_size))
3030 { 3049 {
3031 SCHEME_V->dump_size += STACK_GROWTH; 3050 SCHEME_V->dump_size += STACK_GROWTH;
3032 SCHEME_V->dump_base = realloc (SCHEME_V->dump_base, sizeof (struct dump_stack_frame) * SCHEME_V->dump_size); 3051 SCHEME_V->dump_base = realloc (SCHEME_V->dump_base, sizeof (struct dump_stack_frame) * SCHEME_V->dump_size);
3033 } 3052 }
3034 3053
… …
3040 next_frame->code = code; 3059 next_frame->code = code;
3041 3060
3042 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1); 3061 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1);
3043} 3062}
3044 3063
3045static pointer 3064static int
3046xs_return (SCHEME_P_ pointer a) 3065xs_return (SCHEME_P_ pointer a)
3047{ 3066{
3048 int nframes = (uintptr_t)SCHEME_V->dump; 3067 int nframes = (uintptr_t)SCHEME_V->dump;
3049 struct dump_stack_frame *frame; 3068 struct dump_stack_frame *frame;
3050 3069
3051 SCHEME_V->value = a; 3070 SCHEME_V->value = a;
3052 3071
3053 if (nframes <= 0) 3072 if (nframes <= 0)
3054 return NIL; 3073 return -1;
3055 3074
3056 frame = &SCHEME_V->dump_base[--nframes]; 3075 frame = &SCHEME_V->dump_base[--nframes];
3057 SCHEME_V->op = frame->op; 3076 SCHEME_V->op = frame->op;
3058 SCHEME_V->args = frame->args; 3077 SCHEME_V->args = frame->args;
3059 SCHEME_V->envir = frame->envir; 3078 SCHEME_V->envir = frame->envir;
3060 SCHEME_V->code = frame->code; 3079 SCHEME_V->code = frame->code;
3061 SCHEME_V->dump = (pointer)(uintptr_t)nframes; 3080 SCHEME_V->dump = (pointer)(uintptr_t)nframes;
3062 3081
3063 return S_T; 3082 return 0;
3064} 3083}
3065 3084
3066static INLINE void 3085ecb_inline void
3067dump_stack_reset (SCHEME_P) 3086dump_stack_reset (SCHEME_P)
3068{ 3087{
3069 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */ 3088 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */
3070 SCHEME_V->dump = (pointer)+0; 3089 SCHEME_V->dump = (pointer)+0;
3071} 3090}
3072 3091
3073static INLINE void 3092ecb_inline void
3074dump_stack_initialize (SCHEME_P) 3093dump_stack_initialize (SCHEME_P)
3075{ 3094{
3076 SCHEME_V->dump_size = 0; 3095 SCHEME_V->dump_size = 0;
3077 SCHEME_V->dump_base = 0; 3096 SCHEME_V->dump_base = 0;
3078 dump_stack_reset (SCHEME_A); 3097 dump_stack_reset (SCHEME_A);
… …
3131 int i = 0; 3150 int i = 0;
3132 struct dump_stack_frame *frame = SCHEME_V->dump_base; 3151 struct dump_stack_frame *frame = SCHEME_V->dump_base;
3133 3152
3134 while (cont != NIL) 3153 while (cont != NIL)
3135 { 3154 {
3136 frame->op = ivalue (car (cont)); cont = cdr (cont); 3155 frame->op = ivalue_unchecked (car (cont)); cont = cdr (cont);
3137 frame->args = car (cont) ; cont = cdr (cont); 3156 frame->args = car (cont) ; cont = cdr (cont);
3138 frame->envir = car (cont) ; cont = cdr (cont); 3157 frame->envir = car (cont) ; cont = cdr (cont);
3139 frame->code = car (cont) ; cont = cdr (cont); 3158 frame->code = car (cont) ; cont = cdr (cont);
3140 3159
3141 ++frame; 3160 ++frame;
3142 ++i; 3161 ++i;
3143 } 3162 }
3144 3163
3145 SCHEME_V->dump = (pointer)(uintptr_t)i; 3164 SCHEME_V->dump = (pointer)(uintptr_t)i;
3146} 3165}
3147 3166
3148#else 3167#else
3149 3168
3150static INLINE void 3169ecb_inline void
3151dump_stack_reset (SCHEME_P) 3170dump_stack_reset (SCHEME_P)
3152{ 3171{
3153 SCHEME_V->dump = NIL; 3172 SCHEME_V->dump = NIL;
3154} 3173}
3155 3174
3156static INLINE void 3175ecb_inline void
3157dump_stack_initialize (SCHEME_P) 3176dump_stack_initialize (SCHEME_P)
3158{ 3177{
3159 dump_stack_reset (SCHEME_A); 3178 dump_stack_reset (SCHEME_A);
3160} 3179}
3161 3180
… …
3163dump_stack_free (SCHEME_P) 3182dump_stack_free (SCHEME_P)
3164{ 3183{
3165 SCHEME_V->dump = NIL; 3184 SCHEME_V->dump = NIL;
3166} 3185}
3167 3186
3168static pointer 3187static int
3169xs_return (SCHEME_P_ pointer a) 3188xs_return (SCHEME_P_ pointer a)
3170{ 3189{
3171 pointer dump = SCHEME_V->dump; 3190 pointer dump = SCHEME_V->dump;
3172 3191
3173 SCHEME_V->value = a; 3192 SCHEME_V->value = a;
3174 3193
3175 if (dump == NIL) 3194 if (dump == NIL)
3176 return NIL; 3195 return -1;
3177 3196
3178 SCHEME_V->op = ivalue (car (dump)); dump = cdr (dump); 3197 SCHEME_V->op = ivalue_unchecked (car (dump)); dump = cdr (dump);
3179 SCHEME_V->args = car (dump) ; dump = cdr (dump); 3198 SCHEME_V->args = car (dump) ; dump = cdr (dump);
3180 SCHEME_V->envir = car (dump) ; dump = cdr (dump); 3199 SCHEME_V->envir = car (dump) ; dump = cdr (dump);
3181 SCHEME_V->code = car (dump) ; dump = cdr (dump); 3200 SCHEME_V->code = car (dump) ; dump = cdr (dump);
3182 3201
3183 SCHEME_V->dump = dump; 3202 SCHEME_V->dump = dump;
3184 3203
3185 return S_T; 3204 return 0;
3186} 3205}
3187 3206
3188static void 3207static void
3189s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code) 3208s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code)
3190{ 3209{
… …
3215 3234
3216#endif 3235#endif
3217 3236
3218#define s_retbool(tf) s_return ((tf) ? S_T : S_F) 3237#define s_retbool(tf) s_return ((tf) ? S_T : S_F)
3219 3238
3239#if EXPERIMENT
3220static pointer 3240static int
3241debug (SCHEME_P_ int indent, pointer x)
3242{
3243 int c;
3244
3245 if (is_syntax (x))
3246 {
3247 printf ("%*ssyntax<%s,%d>\n", indent, "", syntaxname(x),syntaxnum(x));
3248 return 8 + 8;
3249 }
3250
3251 if (x == NIL)
3252 {
3253 printf ("%*sNIL\n", indent, "");
3254 return 3;
3255 }
3256
3257 switch (type (x))
3258 {
3259 case T_INTEGER:
3260 printf ("%*sI<%d>%p\n", indent, "", (int)ivalue_unchecked (x), x);
3261 return 32+8;
3262
3263 case T_SYMBOL:
3264 printf ("%*sS<%s>\n", indent, "", symname (x));
3265 return 24+8;
3266
3267 case T_CLOSURE:
3268 printf ("%*sS<%s>\n", indent, "", "closure");
3269 debug (SCHEME_A_ indent + 3, cdr(x));
3270 return 32 + debug (SCHEME_A_ indent + 3, car (x));
3271
3272 case T_PAIR:
3273 printf ("%*spair %p %p\n", indent, "", car(x),cdr(x));
3274 c = debug (SCHEME_A_ indent + 3, car (x));
3275 c += debug (SCHEME_A_ indent + 3, cdr (x));
3276 return c + 1;
3277
3278 case T_PORT:
3279 printf ("%*sS<%s>\n", indent, "", "port");
3280 return 24+8;
3281
3282 case T_VECTOR:
3283 printf ("%*sS<%s>\n", indent, "", "vector");
3284 return 24+8;
3285
3286 case T_ENVIRONMENT:
3287 printf ("%*sS<%s>\n", indent, "", "environment");
3288 return 0 + debug (SCHEME_A_ indent + 3, car (x));
3289
3290 default:
3291 printf ("unhandled type %d\n", type (x));
3292 break;
3293 }
3294}
3295#endif
3296
3297static int
3221opexe_0 (SCHEME_P_ enum scheme_opcodes op) 3298opexe_0 (SCHEME_P_ enum scheme_opcodes op)
3222{ 3299{
3223 pointer args = SCHEME_V->args; 3300 pointer args = SCHEME_V->args;
3224 pointer x, y; 3301 pointer x, y;
3225 3302
3226 switch (op) 3303 switch (op)
3227 { 3304 {
3305#if EXPERIMENT //D
3306 case OP_DEBUG:
3307 printf ("len = %d\n", debug (SCHEME_A_ 0, args) / 8);
3308 printf ("\n");
3309 s_return (S_T);
3310#endif
3228 case OP_LOAD: /* load */ 3311 case OP_LOAD: /* load */
3229 if (file_interactive (SCHEME_A)) 3312 if (file_interactive (SCHEME_A))
3230 { 3313 {
3231 xwrstr ("Loading "); xwrstr (strvalue (car (args))); xwrstr ("\n"); 3314 putstr (SCHEME_A_ "Loading "); putstr (SCHEME_A_ strvalue (car (args))); putstr (SCHEME_A_ "\n");
3232 //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args))); 3315 //D fprintf (port (SCHEME_V->outport)->rep.stdio.file, "Loading %s\n", strvalue (car (args)));
3233 } 3316 }
3234 3317
3235 if (!file_push (SCHEME_A_ strvalue (car (args)))) 3318 if (!file_push (SCHEME_A_ strvalue (car (args))))
3236 Error_1 ("unable to open", car (args)); 3319 Error_1 ("unable to open", car (args));
3237 else 3320 else
… …
3241 } 3324 }
3242 3325
3243 case OP_T0LVL: /* top level */ 3326 case OP_T0LVL: /* top level */
3244 3327
3245 /* If we reached the end of file, this loop is done. */ 3328 /* If we reached the end of file, this loop is done. */
3246 if (SCHEME_V->loadport->object.port->kind & port_saw_EOF) 3329 if (port (SCHEME_V->loadport)->kind & port_saw_EOF)
3247 { 3330 {
3248 if (SCHEME_V->file_i == 0) 3331 if (SCHEME_V->file_i == 0)
3249 { 3332 {
3250 SCHEME_V->args = NIL; 3333 SCHEME_V->args = NIL;
3251 s_goto (OP_QUIT); 3334 s_goto (OP_QUIT);
… …
3329#endif 3412#endif
3330 if (is_symbol (SCHEME_V->code)) /* symbol */ 3413 if (is_symbol (SCHEME_V->code)) /* symbol */
3331 { 3414 {
3332 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 1); 3415 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 1);
3333 3416
3334 if (x != NIL) 3417 if (x == NIL)
3335 s_return (slot_value_in_env (x));
3336 else
3337 Error_1 ("eval: unbound variable:", SCHEME_V->code); 3418 Error_1 ("eval: unbound variable:", SCHEME_V->code);
3419
3420 s_return (slot_value_in_env (x));
3338 } 3421 }
3339 else if (is_pair (SCHEME_V->code)) 3422 else if (is_pair (SCHEME_V->code))
3340 { 3423 {
3341 x = car (SCHEME_V->code); 3424 x = car (SCHEME_V->code);
3342 3425
… …
3355 } 3438 }
3356 else 3439 else
3357 s_return (SCHEME_V->code); 3440 s_return (SCHEME_V->code);
3358 3441
3359 case OP_E0ARGS: /* eval arguments */ 3442 case OP_E0ARGS: /* eval arguments */
3360 if (is_macro (SCHEME_V->value)) /* macro expansion */ 3443 if (ecb_expect_false (is_macro (SCHEME_V->value))) /* macro expansion */
3361 { 3444 {
3362 s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL); 3445 s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL);
3363 SCHEME_V->args = cons (SCHEME_V->code, NIL); 3446 SCHEME_V->args = cons (SCHEME_V->code, NIL);
3364 SCHEME_V->code = SCHEME_V->value; 3447 SCHEME_V->code = SCHEME_V->value;
3365 s_goto (OP_APPLY); 3448 s_goto (OP_APPLY);
… …
3392 3475
3393 case OP_TRACING: 3476 case OP_TRACING:
3394 { 3477 {
3395 int tr = SCHEME_V->tracing; 3478 int tr = SCHEME_V->tracing;
3396 3479
3397 SCHEME_V->tracing = ivalue (car (args)); 3480 SCHEME_V->tracing = ivalue_unchecked (car (args));
3398 s_return (mk_integer (SCHEME_A_ tr)); 3481 s_return (mk_integer (SCHEME_A_ tr));
3399 } 3482 }
3400 3483
3401#endif 3484#endif
3402 3485
… …
3419 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */ 3502 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */
3420 else if (is_foreign (SCHEME_V->code)) 3503 else if (is_foreign (SCHEME_V->code))
3421 { 3504 {
3422 /* Keep nested calls from GC'ing the arglist */ 3505 /* Keep nested calls from GC'ing the arglist */
3423 push_recent_alloc (SCHEME_A_ args, NIL); 3506 push_recent_alloc (SCHEME_A_ args, NIL);
3424 x = SCHEME_V->code->object.ff (SCHEME_A_ args); 3507 x = CELL(SCHEME_V->code)->object.ff (SCHEME_A_ args);
3425 3508
3426 s_return (x); 3509 s_return (x);
3427 } 3510 }
3428 else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */ 3511 else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */
3429 { 3512 {
… …
3466 3549
3467 case OP_DOMACRO: /* do macro */ 3550 case OP_DOMACRO: /* do macro */
3468 SCHEME_V->code = SCHEME_V->value; 3551 SCHEME_V->code = SCHEME_V->value;
3469 s_goto (OP_EVAL); 3552 s_goto (OP_EVAL);
3470 3553
3471#if 1
3472
3473 case OP_LAMBDA: /* lambda */ 3554 case OP_LAMBDA: /* lambda */
3474 /* If the hook is defined, apply it to SCHEME_V->code, otherwise 3555 /* If the hook is defined, apply it to SCHEME_V->code, otherwise
3475 set SCHEME_V->value fall thru */ 3556 set SCHEME_V->value fall thru */
3476 { 3557 {
3477 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1); 3558 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1);
… …
3483 SCHEME_V->code = slot_value_in_env (f); 3564 SCHEME_V->code = slot_value_in_env (f);
3484 s_goto (OP_APPLY); 3565 s_goto (OP_APPLY);
3485 } 3566 }
3486 3567
3487 SCHEME_V->value = SCHEME_V->code; 3568 SCHEME_V->value = SCHEME_V->code;
3488 /* Fallthru */
3489 } 3569 }
3570 /* Fallthru */
3490 3571
3491 case OP_LAMBDA1: 3572 case OP_LAMBDA1:
3492 s_return (mk_closure (SCHEME_A_ SCHEME_V->value, SCHEME_V->envir)); 3573 s_return (mk_closure (SCHEME_A_ SCHEME_V->value, SCHEME_V->envir));
3493
3494#else
3495
3496 case OP_LAMBDA: /* lambda */
3497 s_return (mk_closure (SCHEME_A_ SCHEME_V->code, SCHEME_V->envir));
3498
3499#endif
3500 3574
3501 case OP_MKCLOSURE: /* make-closure */ 3575 case OP_MKCLOSURE: /* make-closure */
3502 x = car (args); 3576 x = car (args);
3503 3577
3504 if (car (x) == SCHEME_V->LAMBDA) 3578 if (car (x) == SCHEME_V->LAMBDA)
… …
3911 SCHEME_V->code = car (args); 3985 SCHEME_V->code = car (args);
3912 SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL); 3986 SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL);
3913 s_goto (OP_APPLY); 3987 s_goto (OP_APPLY);
3914 } 3988 }
3915 3989
3916 abort (); 3990 if (USE_ERROR_CHECKING) abort ();
3917} 3991}
3918 3992
3919static pointer 3993static int
3920opexe_2 (SCHEME_P_ enum scheme_opcodes op) 3994opexe_1 (SCHEME_P_ enum scheme_opcodes op)
3921{ 3995{
3922 pointer args = SCHEME_V->args; 3996 pointer args = SCHEME_V->args;
3923 pointer x = car (args); 3997 pointer x = car (args);
3924 num v; 3998 num v;
3925 3999
3926#if USE_MATH
3927 RVALUE dd;
3928#endif
3929
3930 switch (op) 4000 switch (op)
3931 { 4001 {
3932#if USE_MATH 4002#if USE_MATH
3933 case OP_INEX2EX: /* inexact->exact */ 4003 case OP_INEX2EX: /* inexact->exact */
4004 {
3934 if (num_is_integer (x)) 4005 if (is_integer (x))
3935 s_return (x); 4006 s_return (x);
3936 else if (modf (rvalue_unchecked (x), &dd) == 0) 4007
4008 RVALUE r = rvalue_unchecked (x);
4009
4010 if (r == (RVALUE)(IVALUE)r)
3937 s_return (mk_integer (SCHEME_A_ ivalue (x))); 4011 s_return (mk_integer (SCHEME_A_ rvalue_unchecked (x)));
3938 else 4012 else
3939 Error_1 ("inexact->exact: not integral:", x); 4013 Error_1 ("inexact->exact: not integral:", x);
4014 }
3940 4015
3941 case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x)))); 4016 case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x))));
3942 case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x)))); 4017 case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x))));
3943 case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x)))); 4018 case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x))));
3944 case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x)))); 4019 case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x))));
… …
3962 { 4037 {
3963 RVALUE result; 4038 RVALUE result;
3964 int real_result = 1; 4039 int real_result = 1;
3965 pointer y = cadr (args); 4040 pointer y = cadr (args);
3966 4041
3967 if (num_is_integer (x) && num_is_integer (y)) 4042 if (is_integer (x) && is_integer (y))
3968 real_result = 0; 4043 real_result = 0;
3969 4044
3970 /* This 'if' is an R5RS compatibility fix. */ 4045 /* This 'if' is an R5RS compatibility fix. */
3971 /* NOTE: Remove this 'if' fix for R6RS. */ 4046 /* NOTE: Remove this 'if' fix for R6RS. */
3972 if (rvalue (x) == 0 && rvalue (y) < 0) 4047 if (rvalue (x) == 0 && rvalue (y) < 0)
… …
3978 /* If the test fails, result is too big for integer. */ 4053 /* If the test fails, result is too big for integer. */
3979 if (!real_result) 4054 if (!real_result)
3980 { 4055 {
3981 long result_as_long = result; 4056 long result_as_long = result;
3982 4057
3983 if (result != (RVALUE) result_as_long) 4058 if (result != result_as_long)
3984 real_result = 1; 4059 real_result = 1;
3985 } 4060 }
3986 4061
3987 if (real_result) 4062 if (real_result)
3988 s_return (mk_real (SCHEME_A_ result)); 4063 s_return (mk_real (SCHEME_A_ result));
3989 else 4064 else
3990 s_return (mk_integer (SCHEME_A_ result)); 4065 s_return (mk_integer (SCHEME_A_ result));
3991 } 4066 }
3992 4067
3993 case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x)))); 4068 case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x))));
3994 case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x)))); 4069 case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x))));
3995 4070 case OP_TRUNCATE: s_return (mk_real (SCHEME_A_ trunc (rvalue (x))));
3996 case OP_TRUNCATE:
3997 {
3998 RVALUE rvalue_of_x;
3999
4000 rvalue_of_x = rvalue (x);
4001
4002 if (rvalue_of_x > 0)
4003 s_return (mk_real (SCHEME_A_ floor (rvalue_of_x)));
4004 else
4005 s_return (mk_real (SCHEME_A_ ceil (rvalue_of_x))); 4071 case OP_ROUND: s_return (mk_real (SCHEME_A_ nearbyint (rvalue (x))));
4006 }
4007
4008 case OP_ROUND:
4009 if (num_is_integer (x))
4010 s_return (x);
4011
4012 s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x))));
4013#endif 4072#endif
4014 4073
4015 case OP_ADD: /* + */ 4074 case OP_ADD: /* + */
4016 v = num_zero; 4075 v = num_zero;
4017 4076
4018 for (x = args; x != NIL; x = cdr (x)) 4077 for (x = args; x != NIL; x = cdr (x))
4019 v = num_op ('+', v, nvalue (car (x))); 4078 v = num_op (NUM_ADD, v, nvalue (car (x)));
4020 4079
4021 s_return (mk_number (SCHEME_A_ v)); 4080 s_return (mk_number (SCHEME_A_ v));
4022 4081
4023 case OP_MUL: /* * */ 4082 case OP_MUL: /* * */
4024 v = num_one; 4083 v = num_one;
4025 4084
4026 for (x = args; x != NIL; x = cdr (x)) 4085 for (x = args; x != NIL; x = cdr (x))
4027 v = num_op ('+', v, nvalue (car (x))); 4086 v = num_op (NUM_MUL, v, nvalue (car (x)));
4028 4087
4029 s_return (mk_number (SCHEME_A_ v)); 4088 s_return (mk_number (SCHEME_A_ v));
4030 4089
4031 case OP_SUB: /* - */ 4090 case OP_SUB: /* - */
4032 if (cdr (args) == NIL) 4091 if (cdr (args) == NIL)
… …
4039 x = cdr (args); 4098 x = cdr (args);
4040 v = nvalue (car (args)); 4099 v = nvalue (car (args));
4041 } 4100 }
4042 4101
4043 for (; x != NIL; x = cdr (x)) 4102 for (; x != NIL; x = cdr (x))
4044 v = num_op ('+', v, nvalue (car (x))); 4103 v = num_op (NUM_SUB, v, nvalue (car (x)));
4045 4104
4046 s_return (mk_number (SCHEME_A_ v)); 4105 s_return (mk_number (SCHEME_A_ v));
4047 4106
4048 case OP_DIV: /* / */ 4107 case OP_DIV: /* / */
4049 if (cdr (args) == NIL) 4108 if (cdr (args) == NIL)
… …
4056 x = cdr (args); 4115 x = cdr (args);
4057 v = nvalue (car (args)); 4116 v = nvalue (car (args));
4058 } 4117 }
4059 4118
4060 for (; x != NIL; x = cdr (x)) 4119 for (; x != NIL; x = cdr (x))
4061 {
4062 if (!is_zero_rvalue (rvalue (car (x)))) 4120 if (!is_zero_rvalue (rvalue (car (x))))
4063 v = num_div (v, nvalue (car (x))); 4121 v = num_div (v, nvalue (car (x)));
4064 else 4122 else
4065 Error_0 ("/: division by zero"); 4123 Error_0 ("/: division by zero");
4066 }
4067 4124
4068 s_return (mk_number (SCHEME_A_ v)); 4125 s_return (mk_number (SCHEME_A_ v));
4069 4126
4070 case OP_INTDIV: /* quotient */ 4127 case OP_INTDIV: /* quotient */
4071 if (cdr (args) == NIL) 4128 if (cdr (args) == NIL)
… …
4080 } 4137 }
4081 4138
4082 for (; x != NIL; x = cdr (x)) 4139 for (; x != NIL; x = cdr (x))
4083 { 4140 {
4084 if (ivalue (car (x)) != 0) 4141 if (ivalue (car (x)) != 0)
4085 v = num_op ('/', v, nvalue (car (x))); 4142 v = num_op (NUM_INTDIV, v, nvalue (car (x)));
4086 else 4143 else
4087 Error_0 ("quotient: division by zero"); 4144 Error_0 ("quotient: division by zero");
4088 } 4145 }
4089 4146
4090 s_return (mk_number (SCHEME_A_ v)); 4147 s_return (mk_number (SCHEME_A_ v));
… …
4107 else 4164 else
4108 Error_0 ("modulo: division by zero"); 4165 Error_0 ("modulo: division by zero");
4109 4166
4110 s_return (mk_number (SCHEME_A_ v)); 4167 s_return (mk_number (SCHEME_A_ v));
4111 4168
4112 case OP_CAR: /* car */ 4169 /* the compiler will optimize this mess... */
4113 s_return (caar (args)); 4170 case OP_CAR: op_car: s_return (car (x));
4114 4171 case OP_CDR: op_cdr: s_return (cdr (x));
4115 case OP_CDR: /* cdr */ 4172 case OP_CAAR: op_caar: x = car (x); goto op_car;
4116 s_return (cdar (args)); 4173 case OP_CADR: op_cadr: x = cdr (x); goto op_car;
4174 case OP_CDAR: op_cdar: x = car (x); goto op_cdr;
4175 case OP_CDDR: op_cddr: x = cdr (x); goto op_cdr;
4176 case OP_CAAAR: op_caaar: x = car (x); goto op_caar;
4177 case OP_CAADR: op_caadr: x = cdr (x); goto op_caar;
4178 case OP_CADAR: op_cadar: x = car (x); goto op_cadr;
4179 case OP_CADDR: op_caddr: x = cdr (x); goto op_cadr;
4180 case OP_CDAAR: op_cdaar: x = car (x); goto op_cdar;
4181 case OP_CDADR: op_cdadr: x = cdr (x); goto op_cdar;
4182 case OP_CDDAR: op_cddar: x = car (x); goto op_cddr;
4183 case OP_CDDDR: op_cdddr: x = cdr (x); goto op_cddr;
4184 case OP_CAAAAR: x = car (x); goto op_caaar;
4185 case OP_CAAADR: x = cdr (x); goto op_caaar;
4186 case OP_CAADAR: x = car (x); goto op_caadr;
4187 case OP_CAADDR: x = cdr (x); goto op_caadr;
4188 case OP_CADAAR: x = car (x); goto op_cadar;
4189 case OP_CADADR: x = cdr (x); goto op_cadar;
4190 case OP_CADDAR: x = car (x); goto op_caddr;
4191 case OP_CADDDR: x = cdr (x); goto op_caddr;
4192 case OP_CDAAAR: x = car (x); goto op_cdaar;
4193 case OP_CDAADR: x = cdr (x); goto op_cdaar;
4194 case OP_CDADAR: x = car (x); goto op_cdadr;
4195 case OP_CDADDR: x = cdr (x); goto op_cdadr;
4196 case OP_CDDAAR: x = car (x); goto op_cddar;
4197 case OP_CDDADR: x = cdr (x); goto op_cddar;
4198 case OP_CDDDAR: x = car (x); goto op_cdddr;
4199 case OP_CDDDDR: x = cdr (x); goto op_cdddr;
4117 4200
4118 case OP_CONS: /* cons */ 4201 case OP_CONS: /* cons */
4119 set_cdr (args, cadr (args)); 4202 set_cdr (args, cadr (args));
4120 s_return (args); 4203 s_return (args);
4121 4204
… …
4136 } 4219 }
4137 else 4220 else
4138 Error_0 ("set-cdr!: unable to alter immutable pair"); 4221 Error_0 ("set-cdr!: unable to alter immutable pair");
4139 4222
4140 case OP_CHAR2INT: /* char->integer */ 4223 case OP_CHAR2INT: /* char->integer */
4141 s_return (mk_integer (SCHEME_A_ ivalue (x))); 4224 s_return (mk_integer (SCHEME_A_ ivalue_unchecked (x)));
4142 4225
4143 case OP_INT2CHAR: /* integer->char */ 4226 case OP_INT2CHAR: /* integer->char */
4144 s_return (mk_character (SCHEME_A_ ivalue (x))); 4227 s_return (mk_character (SCHEME_A_ ivalue_unchecked (x)));
4145 4228
4146 case OP_CHARUPCASE: 4229 case OP_CHARUPCASE:
4147 { 4230 {
4148 unsigned char c = ivalue (x); 4231 unsigned char c = ivalue_unchecked (x);
4149 c = toupper (c); 4232 c = toupper (c);
4150 s_return (mk_character (SCHEME_A_ c)); 4233 s_return (mk_character (SCHEME_A_ c));
4151 } 4234 }
4152 4235
4153 case OP_CHARDNCASE: 4236 case OP_CHARDNCASE:
4154 { 4237 {
4155 unsigned char c = ivalue (x); 4238 unsigned char c = ivalue_unchecked (x);
4156 c = tolower (c); 4239 c = tolower (c);
4157 s_return (mk_character (SCHEME_A_ c)); 4240 s_return (mk_character (SCHEME_A_ c));
4158 } 4241 }
4159 4242
4160 case OP_STR2SYM: /* string->symbol */ 4243 case OP_STR2SYM: /* string->symbol */
… …
4237 Error_1 ("atom->string: not an atom:", x); 4320 Error_1 ("atom->string: not an atom:", x);
4238 } 4321 }
4239 4322
4240 case OP_MKSTRING: /* make-string */ 4323 case OP_MKSTRING: /* make-string */
4241 { 4324 {
4242 int fill = ' '; 4325 int fill = cdr (args) != NIL ? charvalue (cadr (args)) : ' ';
4243 int len;
4244
4245 len = ivalue (x); 4326 int len = ivalue_unchecked (x);
4246
4247 if (cdr (args) != NIL)
4248 fill = charvalue (cadr (args));
4249 4327
4250 s_return (mk_empty_string (SCHEME_A_ len, fill)); 4328 s_return (mk_empty_string (SCHEME_A_ len, fill));
4251 } 4329 }
4252 4330
4253 case OP_STRLEN: /* string-length */ 4331 case OP_STRLEN: /* string-length */
4254 s_return (mk_integer (SCHEME_A_ strlength (x))); 4332 s_return (mk_integer (SCHEME_A_ strlength (x)));
4255 4333
4256 case OP_STRREF: /* string-ref */ 4334 case OP_STRREF: /* string-ref */
4257 { 4335 {
4258 char *str;
4259 int index;
4260
4261 str = strvalue (x); 4336 char *str = strvalue (x);
4262
4263 index = ivalue (cadr (args)); 4337 int index = ivalue_unchecked (cadr (args));
4264 4338
4265 if (index >= strlength (x)) 4339 if (index >= strlength (x))
4266 Error_1 ("string-ref: out of bounds:", cadr (args)); 4340 Error_1 ("string-ref: out of bounds:", cadr (args));
4267 4341
4268 s_return (mk_character (SCHEME_A_ ((unsigned char *)str)[index])); 4342 s_return (mk_character (SCHEME_A_ ((unsigned char *)str)[index]));
4269 } 4343 }
4270 4344
4271 case OP_STRSET: /* string-set! */ 4345 case OP_STRSET: /* string-set! */
4272 { 4346 {
4273 char *str; 4347 char *str = strvalue (x);
4274 int index; 4348 int index = ivalue_unchecked (cadr (args));
4275 int c; 4349 int c;
4276 4350
4277 if (is_immutable (x)) 4351 if (is_immutable (x))
4278 Error_1 ("string-set!: unable to alter immutable string:", x); 4352 Error_1 ("string-set!: unable to alter immutable string:", x);
4279
4280 str = strvalue (x);
4281
4282 index = ivalue (cadr (args));
4283 4353
4284 if (index >= strlength (x)) 4354 if (index >= strlength (x))
4285 Error_1 ("string-set!: out of bounds:", cadr (args)); 4355 Error_1 ("string-set!: out of bounds:", cadr (args));
4286 4356
4287 c = charvalue (caddr (args)); 4357 c = charvalue (caddr (args));
… …
4310 s_return (newstr); 4380 s_return (newstr);
4311 } 4381 }
4312 4382
4313 case OP_SUBSTR: /* substring */ 4383 case OP_SUBSTR: /* substring */
4314 { 4384 {
4315 char *str; 4385 char *str = strvalue (x);
4316 int index0; 4386 int index0 = ivalue_unchecked (cadr (args));
4317 int index1; 4387 int index1;
4318 int len; 4388 int len;
4319 4389
4320 str = strvalue (x);
4321
4322 index0 = ivalue (cadr (args));
4323
4324 if (index0 > strlength (x)) 4390 if (index0 > strlength (x))
4325 Error_1 ("substring: start out of bounds:", cadr (args)); 4391 Error_1 ("substring: start out of bounds:", cadr (args));
4326 4392
4327 if (cddr (args) != NIL) 4393 if (cddr (args) != NIL)
4328 { 4394 {
4329 index1 = ivalue (caddr (args)); 4395 index1 = ivalue_unchecked (caddr (args));
4330 4396
4331 if (index1 > strlength (x) || index1 < index0) 4397 if (index1 > strlength (x) || index1 < index0)
4332 Error_1 ("substring: end out of bounds:", caddr (args)); 4398 Error_1 ("substring: end out of bounds:", caddr (args));
4333 } 4399 }
4334 else 4400 else
… …
4357 if (SCHEME_V->no_memory) 4423 if (SCHEME_V->no_memory)
4358 s_return (S_SINK); 4424 s_return (S_SINK);
4359#endif 4425#endif
4360 4426
4361 for (x = args, i = 0; is_pair (x); x = cdr (x), i++) 4427 for (x = args, i = 0; is_pair (x); x = cdr (x), i++)
4362 set_vector_elem (vec, i, car (x)); 4428 vector_set (vec, i, car (x));
4363 4429
4364 s_return (vec); 4430 s_return (vec);
4365 } 4431 }
4366 4432
4367 case OP_MKVECTOR: /* make-vector */ 4433 case OP_MKVECTOR: /* make-vector */
4368 { 4434 {
4369 pointer fill = NIL; 4435 pointer fill = NIL;
4370 int len;
4371 pointer vec; 4436 pointer vec;
4372
4373 len = ivalue (x); 4437 int len = ivalue_unchecked (x);
4374 4438
4375 if (cdr (args) != NIL) 4439 if (cdr (args) != NIL)
4376 fill = cadr (args); 4440 fill = cadr (args);
4377 4441
4378 vec = mk_vector (SCHEME_A_ len); 4442 vec = mk_vector (SCHEME_A_ len);
… …
4381 if (SCHEME_V->no_memory) 4445 if (SCHEME_V->no_memory)
4382 s_return (S_SINK); 4446 s_return (S_SINK);
4383#endif 4447#endif
4384 4448
4385 if (fill != NIL) 4449 if (fill != NIL)
4386 fill_vector (vec, fill); 4450 fill_vector (vec, 0, fill);
4387 4451
4388 s_return (vec); 4452 s_return (vec);
4389 } 4453 }
4390 4454
4391 case OP_VECLEN: /* vector-length */ 4455 case OP_VECLEN: /* vector-length */
4392 s_return (mk_integer (SCHEME_A_ veclength (x))); 4456 s_return (mk_integer (SCHEME_A_ veclength (x)));
4393 4457
4458 case OP_VECRESIZE:
4459 vector_resize (x, ivalue_unchecked (cadr (args)), caddr (args));
4460 s_return (x);
4461
4394 case OP_VECREF: /* vector-ref */ 4462 case OP_VECREF: /* vector-ref */
4395 { 4463 {
4396 int index;
4397
4398 index = ivalue (cadr (args)); 4464 int index = ivalue_unchecked (cadr (args));
4399 4465
4400 if (index >= veclength (car (args)) && USE_ERROR_CHECKING) 4466 if (index >= veclength (car (args)) && USE_ERROR_CHECKING)
4401 Error_1 ("vector-ref: out of bounds:", cadr (args)); 4467 Error_1 ("vector-ref: out of bounds:", cadr (args));
4402 4468
4403 s_return (vector_elem (x, index)); 4469 s_return (vector_get (x, index));
4404 } 4470 }
4405 4471
4406 case OP_VECSET: /* vector-set! */ 4472 case OP_VECSET: /* vector-set! */
4407 { 4473 {
4408 int index; 4474 int index = ivalue_unchecked (cadr (args));
4409 4475
4410 if (is_immutable (x)) 4476 if (is_immutable (x))
4411 Error_1 ("vector-set!: unable to alter immutable vector:", x); 4477 Error_1 ("vector-set!: unable to alter immutable vector:", x);
4412 4478
4413 index = ivalue (cadr (args));
4414
4415 if (index >= veclength (car (args)) && USE_ERROR_CHECKING) 4479 if (index >= veclength (car (args)) && USE_ERROR_CHECKING)
4416 Error_1 ("vector-set!: out of bounds:", cadr (args)); 4480 Error_1 ("vector-set!: out of bounds:", cadr (args));
4417 4481
4418 set_vector_elem (x, index, caddr (args)); 4482 vector_set (x, index, caddr (args));
4419 s_return (x); 4483 s_return (x);
4420 } 4484 }
4421 } 4485 }
4422 4486
4423 return S_T; 4487 if (USE_ERROR_CHECKING) abort ();
4424} 4488}
4425 4489
4426INTERFACE int
4427is_list (SCHEME_P_ pointer a)
4428{
4429 return list_length (SCHEME_A_ a) >= 0;
4430}
4431
4432/* Result is:
4433 proper list: length
4434 circular list: -1
4435 not even a pair: -2
4436 dotted list: -2 minus length before dot
4437*/
4438INTERFACE int
4439list_length (SCHEME_P_ pointer a)
4440{
4441 int i = 0;
4442 pointer slow, fast;
4443
4444 slow = fast = a;
4445
4446 while (1)
4447 {
4448 if (fast == NIL)
4449 return i;
4450
4451 if (!is_pair (fast))
4452 return -2 - i;
4453
4454 fast = cdr (fast);
4455 ++i;
4456
4457 if (fast == NIL)
4458 return i;
4459
4460 if (!is_pair (fast))
4461 return -2 - i;
4462
4463 ++i;
4464 fast = cdr (fast);
4465
4466 /* Safe because we would have already returned if `fast'
4467 encountered a non-pair. */
4468 slow = cdr (slow);
4469
4470 if (fast == slow)
4471 {
4472 /* the fast pointer has looped back around and caught up
4473 with the slow pointer, hence the structure is circular,
4474 not of finite length, and therefore not a list */
4475 return -1;
4476 }
4477 }
4478}
4479
4480static pointer 4490static int
4481opexe_r (SCHEME_P_ enum scheme_opcodes op) 4491opexe_2 (SCHEME_P_ enum scheme_opcodes op)
4482{ 4492{
4483 pointer x = SCHEME_V->args; 4493 pointer x = SCHEME_V->args;
4484 4494
4485 for (;;) 4495 for (;;)
4486 { 4496 {
… …
4506 } 4516 }
4507 4517
4508 s_return (S_T); 4518 s_return (S_T);
4509} 4519}
4510 4520
4511static pointer 4521static int
4512opexe_3 (SCHEME_P_ enum scheme_opcodes op) 4522opexe_3 (SCHEME_P_ enum scheme_opcodes op)
4513{ 4523{
4514 pointer args = SCHEME_V->args; 4524 pointer args = SCHEME_V->args;
4515 pointer a = car (args); 4525 pointer a = car (args);
4516 pointer d = cdr (args); 4526 pointer d = cdr (args);
4517 int r; 4527 int r;
4518 4528
4519 switch (op) 4529 switch (op)
4520 { 4530 {
4521 case OP_NOT: /* not */ r = is_false (a) ; break; 4531 case OP_NOT: /* not */ r = is_false (a) ; break;
4522 case OP_BOOLP: /* boolean? */ r = a == S_F || a == S_T; break; 4532 case OP_BOOLP: /* boolean? */ r = a == S_F || a == S_T ; break;
4523 case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break; 4533 case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break;
4524 case OP_NULLP: /* null? */ r = a == NIL ; break; 4534 case OP_NULLP: /* null? */ r = a == NIL ; break;
4525 case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break; 4535 case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break;
4536 case OP_GENSYMP: /* gensym? */ r = is_gensym (SCHEME_A_ a); break;
4526 case OP_NUMBERP: /* number? */ r = is_number (a) ; break; 4537 case OP_NUMBERP: /* number? */ r = is_number (a) ; break;
4527 case OP_STRINGP: /* string? */ r = is_string (a) ; break; 4538 case OP_STRINGP: /* string? */ r = is_string (a) ; break;
4528 case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break; 4539 case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break;
4529 case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */ 4540 case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */
4530 case OP_CHARP: /* char? */ r = is_character (a) ; break; 4541 case OP_CHARP: /* char? */ r = is_character (a) ; break;
4531 4542
4532#if USE_CHAR_CLASSIFIERS 4543#if USE_CHAR_CLASSIFIERS
4533 case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue (a)); break; 4544 case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue_unchecked (a)); break;
4534 case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue (a)); break; 4545 case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue_unchecked (a)); break;
4535 case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue (a)); break; 4546 case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue_unchecked (a)); break;
4536 case OP_CHARUP: /* char-upper-case? */ r = Cisupper (ivalue (a)); break; 4547 case OP_CHARUP: /* char-upper-case? */ r = Cisupper (ivalue_unchecked (a)); break;
4537 case OP_CHARLP: /* char-lower-case? */ r = Cislower (ivalue (a)); break; 4548 case OP_CHARLP: /* char-lower-case? */ r = Cislower (ivalue_unchecked (a)); break;
4538#endif 4549#endif
4539 4550
4540#if USE_PORTS 4551#if USE_PORTS
4541 case OP_PORTP: /* port? */ r = is_port (a) ; break; 4552 case OP_PORTP: /* port? */ r = is_port (a) ; break;
4542 case OP_INPORTP: /* input-port? */ r = is_inport (a) ; break; 4553 case OP_INPORTP: /* input-port? */ r = is_inport (a) ; break;
… …
4562 } 4573 }
4563 4574
4564 s_retbool (r); 4575 s_retbool (r);
4565} 4576}
4566 4577
4567static pointer 4578static int
4568opexe_4 (SCHEME_P_ enum scheme_opcodes op) 4579opexe_4 (SCHEME_P_ enum scheme_opcodes op)
4569{ 4580{
4570 pointer args = SCHEME_V->args; 4581 pointer args = SCHEME_V->args;
4571 pointer a = car (args); 4582 pointer a = car (args);
4572 pointer x, y; 4583 pointer x, y;
… …
4585 } 4596 }
4586 else 4597 else
4587 s_return (SCHEME_V->code); 4598 s_return (SCHEME_V->code);
4588 4599
4589 case OP_SAVE_FORCED: /* Save forced value replacing promise */ 4600 case OP_SAVE_FORCED: /* Save forced value replacing promise */
4590 memcpy (SCHEME_V->code, SCHEME_V->value, sizeof (struct cell)); 4601 *CELL (SCHEME_V->code) = *CELL (SCHEME_V->value);
4591 s_return (SCHEME_V->value); 4602 s_return (SCHEME_V->value);
4592 4603
4593#if USE_PORTS 4604#if USE_PORTS
4594 4605
4595 case OP_WRITE: /* write */ 4606 case OP_WRITE: /* write */
… …
4658 putstr (SCHEME_A_ "\n"); 4669 putstr (SCHEME_A_ "\n");
4659 4670
4660 if (SCHEME_V->interactive_repl) 4671 if (SCHEME_V->interactive_repl)
4661 s_goto (OP_T0LVL); 4672 s_goto (OP_T0LVL);
4662 else 4673 else
4663 return NIL; 4674 return -1;
4664 } 4675 }
4665 4676
4666 case OP_REVERSE: /* reverse */ 4677 case OP_REVERSE: /* reverse */
4667 s_return (reverse (SCHEME_A_ a)); 4678 s_return (reverse (SCHEME_A_ a));
4668 4679
… …
4725 4736
4726 case OP_QUIT: /* quit */ 4737 case OP_QUIT: /* quit */
4727 if (is_pair (args)) 4738 if (is_pair (args))
4728 SCHEME_V->retcode = ivalue (a); 4739 SCHEME_V->retcode = ivalue (a);
4729 4740
4730 return NIL; 4741 return -1;
4731 4742
4732 case OP_GC: /* gc */ 4743 case OP_GC: /* gc */
4733 gc (SCHEME_A_ NIL, NIL); 4744 gc (SCHEME_A_ NIL, NIL);
4734 s_return (S_T); 4745 s_return (S_T);
4735 4746
… …
4740 SCHEME_V->gc_verbose = (a != S_F); 4751 SCHEME_V->gc_verbose = (a != S_F);
4741 s_retbool (was); 4752 s_retbool (was);
4742 } 4753 }
4743 4754
4744 case OP_NEWSEGMENT: /* new-segment */ 4755 case OP_NEWSEGMENT: /* new-segment */
4756#if 0
4745 if (!is_pair (args) || !is_number (a)) 4757 if (!is_pair (args) || !is_number (a))
4746 Error_0 ("new-segment: argument must be a number"); 4758 Error_0 ("new-segment: argument must be a number");
4747 4759#endif
4748 alloc_cellseg (SCHEME_A_ (int)ivalue (a)); 4760 s_retbool (alloc_cellseg (SCHEME_A));
4749
4750 s_return (S_T);
4751 4761
4752 case OP_OBLIST: /* oblist */ 4762 case OP_OBLIST: /* oblist */
4753 s_return (oblist_all_symbols (SCHEME_A)); 4763 s_return (oblist_all_symbols (SCHEME_A));
4754 4764
4755#if USE_PORTS 4765#if USE_PORTS
… …
4782 break; 4792 break;
4783 } 4793 }
4784 4794
4785 p = port_from_filename (SCHEME_A_ strvalue (a), prop); 4795 p = port_from_filename (SCHEME_A_ strvalue (a), prop);
4786 4796
4787 if (p == NIL) 4797 s_return (p == NIL ? S_F : p);
4788 s_return (S_F);
4789
4790 s_return (p);
4791 } 4798 }
4792 4799
4793# if USE_STRING_PORTS 4800# if USE_STRING_PORTS
4794 4801
4795 case OP_OPEN_INSTRING: /* open-input-string */ 4802 case OP_OPEN_INSTRING: /* open-input-string */
… …
4810 } 4817 }
4811 4818
4812 p = port_from_string (SCHEME_A_ strvalue (a), 4819 p = port_from_string (SCHEME_A_ strvalue (a),
4813 strvalue (a) + strlength (a), prop); 4820 strvalue (a) + strlength (a), prop);
4814 4821
4815 if (p == NIL) 4822 s_return (p == NIL ? S_F : p);
4816 s_return (S_F);
4817
4818 s_return (p);
4819 } 4823 }
4820 4824
4821 case OP_OPEN_OUTSTRING: /* open-output-string */ 4825 case OP_OPEN_OUTSTRING: /* open-output-string */
4822 { 4826 {
4823 pointer p; 4827 pointer p;
4824 4828
4825 if (a == NIL) 4829 if (a == NIL)
4826 {
4827 p = port_from_scratch (SCHEME_A); 4830 p = port_from_scratch (SCHEME_A);
4828
4829 if (p == NIL)
4830 s_return (S_F);
4831 }
4832 else 4831 else
4833 {
4834 p = port_from_string (SCHEME_A_ strvalue (a), 4832 p = port_from_string (SCHEME_A_ strvalue (a),
4835 strvalue (a) + strlength (a), port_output); 4833 strvalue (a) + strlength (a), port_output);
4836 4834
4837 if (p == NIL) 4835 s_return (p == NIL ? S_F : p);
4838 s_return (S_F);
4839 }
4840
4841 s_return (p);
4842 } 4836 }
4843 4837
4844 case OP_GET_OUTSTRING: /* get-output-string */ 4838 case OP_GET_OUTSTRING: /* get-output-string */
4845 { 4839 {
4846 port *p; 4840 port *p = port (a);
4847 4841
4848 if ((p = a->object.port)->kind & port_string) 4842 if (p->kind & port_string)
4849 { 4843 {
4850 off_t size; 4844 off_t size;
4851 char *str; 4845 char *str;
4852 4846
4853 size = p->rep.string.curr - p->rep.string.start + 1; 4847 size = p->rep.string.curr - p->rep.string.start + 1;
… …
4885 case OP_CURR_ENV: /* current-environment */ 4879 case OP_CURR_ENV: /* current-environment */
4886 s_return (SCHEME_V->envir); 4880 s_return (SCHEME_V->envir);
4887 4881
4888 } 4882 }
4889 4883
4890 abort (); 4884 if (USE_ERROR_CHECKING) abort ();
4891} 4885}
4892 4886
4893static pointer 4887static int
4894opexe_5 (SCHEME_P_ enum scheme_opcodes op) 4888opexe_5 (SCHEME_P_ enum scheme_opcodes op)
4895{ 4889{
4896 pointer args = SCHEME_V->args; 4890 pointer args = SCHEME_V->args;
4897 pointer x; 4891 pointer x;
4898 4892
… …
4958 int res; 4952 int res;
4959 4953
4960 if (is_pair (args)) 4954 if (is_pair (args))
4961 p = car (args); 4955 p = car (args);
4962 4956
4963 res = p->object.port->kind & port_string; 4957 res = port (p)->kind & port_string;
4964 4958
4965 s_retbool (res); 4959 s_retbool (res);
4966 } 4960 }
4967 4961
4968 case OP_SET_INPORT: /* set-input-port */ 4962 case OP_SET_INPORT: /* set-input-port */
… …
5027 s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL); 5021 s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL);
5028 SCHEME_V->tok = token (SCHEME_A); 5022 SCHEME_V->tok = token (SCHEME_A);
5029 s_goto (OP_RDSEXPR); 5023 s_goto (OP_RDSEXPR);
5030 5024
5031 case TOK_ATOM: 5025 case TOK_ATOM:
5032 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))); 5026 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS)));
5027
5028 case TOK_DOTATOM:
5029 SCHEME_V->strbuff[0] = '.';
5030 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 1, DELIMITERS)));
5031
5032 case TOK_STRATOM:
5033 x = readstrexp (SCHEME_A_ '|');
5034 //TODO: haven't checked whether the garbage collector could interfere
5035 s_return (mk_atom (SCHEME_A_ strvalue (x)));
5033 5036
5034 case TOK_DQUOTE: 5037 case TOK_DQUOTE:
5035 x = readstrexp (SCHEME_A); 5038 x = readstrexp (SCHEME_A_ '"');
5036 5039
5037 if (x == S_F) 5040 if (x == S_F)
5038 Error_0 ("Error reading string"); 5041 Error_0 ("Error reading string");
5039 5042
5040 setimmutable (x); 5043 setimmutable (x);
… …
5052 s_goto (OP_EVAL); 5055 s_goto (OP_EVAL);
5053 } 5056 }
5054 } 5057 }
5055 5058
5056 case TOK_SHARP_CONST: 5059 case TOK_SHARP_CONST:
5057 if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))) == NIL) 5060 if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS))) == NIL)
5058 Error_0 ("undefined sharp expression"); 5061 Error_0 ("undefined sharp expression");
5059 else 5062 else
5060 s_return (x); 5063 s_return (x);
5061 5064
5062 default: 5065 default:
… …
5214 putstr (SCHEME_A_ ")"); 5217 putstr (SCHEME_A_ ")");
5215 s_return (S_T); 5218 s_return (S_T);
5216 } 5219 }
5217 else 5220 else
5218 { 5221 {
5219 pointer elem = vector_elem (vec, i); 5222 pointer elem = vector_get (vec, i);
5220 5223
5221 ivalue_unchecked (cdr (args)) = i + 1; 5224 ivalue_unchecked (cdr (args)) = i + 1;
5222 s_save (SCHEME_A_ OP_PVECFROM, args, NIL); 5225 s_save (SCHEME_A_ OP_PVECFROM, args, NIL);
5223 SCHEME_V->args = elem; 5226 SCHEME_V->args = elem;
5224 5227
… …
5228 s_goto (OP_P0LIST); 5231 s_goto (OP_P0LIST);
5229 } 5232 }
5230 } 5233 }
5231 } 5234 }
5232 5235
5233 abort (); 5236 if (USE_ERROR_CHECKING) abort ();
5234} 5237}
5235 5238
5236static pointer 5239static int
5237opexe_6 (SCHEME_P_ enum scheme_opcodes op) 5240opexe_6 (SCHEME_P_ enum scheme_opcodes op)
5238{ 5241{
5239 pointer args = SCHEME_V->args; 5242 pointer args = SCHEME_V->args;
5240 pointer a = car (args); 5243 pointer a = car (args);
5241 pointer x, y; 5244 pointer x, y;
… …
5284 5287
5285 case OP_CLOSUREP: /* closure? */ 5288 case OP_CLOSUREP: /* closure? */
5286 /* 5289 /*
5287 * Note, macro object is also a closure. 5290 * Note, macro object is also a closure.
5288 * Therefore, (closure? <#MACRO>) ==> #t 5291 * Therefore, (closure? <#MACRO>) ==> #t
5292 * (schmorp) well, obviously not, fix? TODO
5289 */ 5293 */
5290 s_retbool (is_closure (a)); 5294 s_retbool (is_closure (a));
5291 5295
5292 case OP_MACROP: /* macro? */ 5296 case OP_MACROP: /* macro? */
5293 s_retbool (is_macro (a)); 5297 s_retbool (is_macro (a));
5294 } 5298 }
5295 5299
5296 abort (); 5300 if (USE_ERROR_CHECKING) abort ();
5297} 5301}
5298 5302
5303/* dispatch functions (opexe_x) return new opcode, or 0 for same opcode, or -1 to stop */
5299typedef pointer (*dispatch_func) (SCHEME_P_ enum scheme_opcodes); 5304typedef int (*dispatch_func)(SCHEME_P_ enum scheme_opcodes);
5300 5305
5301typedef int (*test_predicate)(pointer); 5306typedef int (*test_predicate)(pointer);
5302static int 5307static int
5303is_any (pointer p) 5308tst_any (pointer p)
5304{ 5309{
5305 return 1; 5310 return 1;
5306} 5311}
5307 5312
5308static int 5313static int
5309is_nonneg (pointer p) 5314tst_inonneg (pointer p)
5310{ 5315{
5311 return ivalue (p) >= 0 && is_integer (p); 5316 return is_integer (p) && ivalue_unchecked (p) >= 0;
5312} 5317}
5313 5318
5314static int 5319static int
5315tst_is_list (pointer p) 5320tst_is_list (SCHEME_P_ pointer p)
5316{ 5321{
5317 return p == NIL || is_pair (p); 5322 return p == NIL || is_pair (p);
5318} 5323}
5319 5324
5320/* Correspond carefully with following defines! */ 5325/* Correspond carefully with following defines! */
5321static struct 5326static struct
5322{ 5327{
5323 test_predicate fct; 5328 test_predicate fct;
5324 const char *kind; 5329 const char *kind;
5325} tests[] = 5330} tests[] = {
5326{
5327 { is_any, 0 }, 5331 { tst_any , 0 },
5328 { is_string, "string" }, 5332 { is_string , "string" },
5329 { is_symbol, "symbol" }, 5333 { is_symbol , "symbol" },
5330 { is_port, "port" }, 5334 { is_port , "port" },
5331 { is_inport, "input port" }, 5335 { is_inport , "input port" },
5332 { is_outport, "output port" }, 5336 { is_outport , "output port" },
5333 { is_environment, "environment" }, 5337 { is_environment, "environment" },
5334 { is_pair, "pair" }, 5338 { is_pair , "pair" },
5335 { tst_is_list, "pair or '()" }, 5339 { 0 , "pair or '()" },
5336 { is_character, "character" }, 5340 { is_character , "character" },
5337 { is_vector, "vector" }, 5341 { is_vector , "vector" },
5338 { is_number, "number" }, 5342 { is_number , "number" },
5339 { is_integer, "integer" }, 5343 { is_integer , "integer" },
5340 { is_nonneg, "non-negative integer" } 5344 { tst_inonneg , "non-negative integer" }
5341}; 5345};
5342 5346
5343#define TST_NONE 0 /* TST_NONE used for standard procedures, for internal ops, 0 is used */ 5347#define TST_NONE 0 /* TST_NONE used for built-ins, 0 for internal ops */
5344#define TST_ANY "\001" 5348#define TST_ANY "\001"
5345#define TST_STRING "\002" 5349#define TST_STRING "\002"
5346#define TST_SYMBOL "\003" 5350#define TST_SYMBOL "\003"
5347#define TST_PORT "\004" 5351#define TST_PORT "\004"
5348#define TST_INPORT "\005" 5352#define TST_INPORT "\005"
… …
5354#define TST_VECTOR "\013" 5358#define TST_VECTOR "\013"
5355#define TST_NUMBER "\014" 5359#define TST_NUMBER "\014"
5356#define TST_INTEGER "\015" 5360#define TST_INTEGER "\015"
5357#define TST_NATURAL "\016" 5361#define TST_NATURAL "\016"
5358 5362
5363#define INF_ARG 0xff
5364#define UNNAMED_OP ""
5365
5366static const char opnames[] =
5367#define OP_DEF(func,name,minarity,maxarity,argtest,op) name "\x00"
5368#include "opdefines.h"
5369#undef OP_DEF
5370;
5371
5372static const char *
5373opname (int idx)
5374{
5375 const char *name = opnames;
5376
5377 /* should do this at compile time, but would require external program, right? */
5378 while (idx--)
5379 name += strlen (name) + 1;
5380
5381 return *name ? name : "ILLEGAL";
5382}
5383
5384static const char *
5385procname (pointer x)
5386{
5387 return opname (procnum (x));
5388}
5389
5359typedef struct 5390typedef struct
5360{ 5391{
5361 dispatch_func func; 5392 uint8_t func;
5362 char *name; 5393 /*dispatch_func func;*//*TODO: maybe optionally keep the pointer, for speed? */
5394 uint8_t builtin;
5395#if USE_ERROR_CHECKING
5363 int min_arity; 5396 uint8_t min_arity;
5364 int max_arity; 5397 uint8_t max_arity;
5365 char arg_tests_encoding[3]; 5398 char arg_tests_encoding[3];
5399#endif
5366} op_code_info; 5400} op_code_info;
5367 5401
5368#define INF_ARG 0xffff
5369
5370static op_code_info dispatch_table[] = { 5402static const op_code_info dispatch_table[] = {
5403#if USE_ERROR_CHECKING
5371#define OP_DEF(func,name,minarity,maxarity,argtest,op) { opexe_ ## func, name, minarity, maxarity, argtest }, 5404#define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1, minarity, maxarity, argtest },
5405#else
5406#define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1 },
5407#endif
5372#include "opdefines.h" 5408#include "opdefines.h"
5373#undef OP_DEF 5409#undef OP_DEF
5374 {0} 5410 {0}
5375}; 5411};
5376 5412
5377static const char *
5378procname (pointer x)
5379{
5380 int n = procnum (x);
5381 const char *name = dispatch_table[n].name;
5382
5383 if (name == 0)
5384 name = "ILLEGAL!";
5385
5386 return name;
5387}
5388
5389/* kernel of this interpreter */ 5413/* kernel of this interpreter */
5390static void 5414static void ecb_hot
5391Eval_Cycle (SCHEME_P_ enum scheme_opcodes op) 5415Eval_Cycle (SCHEME_P_ enum scheme_opcodes op)
5392{ 5416{
5393 SCHEME_V->op = op; 5417 SCHEME_V->op = op;
5394 5418
5395 for (;;) 5419 for (;;)
5396 { 5420 {
5397 op_code_info *pcd = dispatch_table + SCHEME_V->op; 5421 const op_code_info *pcd = dispatch_table + SCHEME_V->op;
5398 5422
5399#if USE_ERROR_CHECKING 5423#if USE_ERROR_CHECKING
5400 if (pcd->name) /* if built-in function, check arguments */ 5424 if (pcd->builtin) /* if built-in function, check arguments */
5401 { 5425 {
5402 int ok = 1;
5403 char msg[STRBUFFSIZE]; 5426 char msg[STRBUFFSIZE];
5404 int n = list_length (SCHEME_A_ SCHEME_V->args); 5427 int n = list_length (SCHEME_A_ SCHEME_V->args);
5405 5428
5406 /* Check number of arguments */ 5429 /* Check number of arguments */
5407 if (ecb_expect_false (n < pcd->min_arity)) 5430 if (ecb_expect_false (n < pcd->min_arity))
5408 { 5431 {
5409 ok = 0;
5410 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", 5432 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)",
5411 pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity); 5433 opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity);
5434 xError_1 (SCHEME_A_ msg, 0);
5435 continue;
5412 } 5436 }
5413 else if (ecb_expect_false (n > pcd->max_arity)) 5437 else if (ecb_expect_false (n > pcd->max_arity && pcd->max_arity != INF_ARG))
5414 { 5438 {
5415 ok = 0;
5416 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", 5439 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)",
5417 pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity); 5440 opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity);
5441 xError_1 (SCHEME_A_ msg, 0);
5442 continue;
5418 } 5443 }
5419 5444 else
5420 if (ecb_expect_false (ok))
5421 { 5445 {
5422 if (*pcd->arg_tests_encoding) 5446 if (*pcd->arg_tests_encoding) /* literal 0 and TST_NONE treated the same */
5423 { 5447 {
5424 int i = 0; 5448 int i = 0;
5425 int j; 5449 int j;
5426 const char *t = pcd->arg_tests_encoding; 5450 const char *t = pcd->arg_tests_encoding;
5427 pointer arglist = SCHEME_V->args; 5451 pointer arglist = SCHEME_V->args;
… …
5430 { 5454 {
5431 pointer arg = car (arglist); 5455 pointer arg = car (arglist);
5432 5456
5433 j = t[0]; 5457 j = t[0];
5434 5458
5459 /*TODO: tst_is_list has different prototype - fix if other tests acquire same prototype */
5460 if (j == TST_LIST[0])
5461 {
5462 if (!tst_is_list (SCHEME_A_ arg))
5463 break;
5464 }
5465 else
5466 {
5435 if (!tests[j - 1].fct (arg)) 5467 if (!tests[j - 1].fct (arg))
5436 break; 5468 break;
5469 }
5437 5470
5438 if (t[1]) /* last test is replicated as necessary */ 5471 if (t < pcd->arg_tests_encoding + sizeof (pcd->arg_tests_encoding) - 1 && t[1]) /* last test is replicated as necessary */
5439 t++; 5472 t++;
5440 5473
5441 arglist = cdr (arglist); 5474 arglist = cdr (arglist);
5442 i++; 5475 i++;
5443 } 5476 }
5444 while (i < n); 5477 while (i < n);
5445 5478
5446 if (i < n) 5479 if (i < n)
5447 { 5480 {
5448 ok = 0;
5449 snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", pcd->name, i + 1, tests[j].kind); 5481 snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", opname (SCHEME_V->op), i + 1, tests[j].kind);
5482 xError_1 (SCHEME_A_ msg, 0);
5483 continue;
5450 } 5484 }
5451 } 5485 }
5452 } 5486 }
5453
5454 if (!ok)
5455 {
5456 if (xError_1 (SCHEME_A_ msg, 0) == NIL)
5457 return;
5458
5459 pcd = dispatch_table + SCHEME_V->op;
5460 }
5461 } 5487 }
5462#endif 5488#endif
5463 5489
5464 ok_to_freely_gc (SCHEME_A); 5490 ok_to_freely_gc (SCHEME_A);
5465 5491
5492 static const dispatch_func dispatch_funcs[] = {
5493 opexe_0,
5494 opexe_1,
5495 opexe_2,
5496 opexe_3,
5497 opexe_4,
5498 opexe_5,
5499 opexe_6,
5500 };
5501
5466 if (ecb_expect_false (pcd->func (SCHEME_A_ SCHEME_V->op) == NIL)) 5502 if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0))
5467 return; 5503 return;
5468 5504
5469 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 5505 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
5470 { 5506 {
5471 xwrstr ("No memory!\n"); 5507 putstr (SCHEME_A_ "No memory!\n");
5472 return; 5508 return;
5473 } 5509 }
5474 } 5510 }
5475} 5511}
5476 5512
… …
5495mk_proc (SCHEME_P_ enum scheme_opcodes op) 5531mk_proc (SCHEME_P_ enum scheme_opcodes op)
5496{ 5532{
5497 pointer y = get_cell (SCHEME_A_ NIL, NIL); 5533 pointer y = get_cell (SCHEME_A_ NIL, NIL);
5498 set_typeflag (y, (T_PROC | T_ATOM)); 5534 set_typeflag (y, (T_PROC | T_ATOM));
5499 ivalue_unchecked (y) = op; 5535 ivalue_unchecked (y) = op;
5500 set_num_integer (y);
5501 return y; 5536 return y;
5502} 5537}
5503 5538
5504/* Hard-coded for the given keywords. Remember to rewrite if more are added! */ 5539/* Hard-coded for the given keywords. Remember to rewrite if more are added! */
5505static int 5540static int
5506syntaxnum (pointer p) 5541syntaxnum (pointer p)
5507{ 5542{
5508 const char *s = strvalue (car (p)); 5543 const char *s = strvalue (p);
5509 5544
5510 switch (strlength (car (p))) 5545 switch (strlength (p))
5511 { 5546 {
5512 case 2: 5547 case 2:
5513 if (s[0] == 'i') 5548 if (s[0] == 'i')
5514 return OP_IF0; /* if */ 5549 return OP_IF0; /* if */
5515 else 5550 else
… …
5570 return OP_C0STREAM; /* cons-stream */ 5605 return OP_C0STREAM; /* cons-stream */
5571 } 5606 }
5572} 5607}
5573 5608
5574#if USE_MULTIPLICITY 5609#if USE_MULTIPLICITY
5575scheme * 5610ecb_cold scheme *
5576scheme_init_new () 5611scheme_init_new ()
5577{ 5612{
5578 scheme *sc = malloc (sizeof (scheme)); 5613 scheme *sc = malloc (sizeof (scheme));
5579 5614
5580 if (!scheme_init (SCHEME_A)) 5615 if (!scheme_init (SCHEME_A))
… …
5585 else 5620 else
5586 return sc; 5621 return sc;
5587} 5622}
5588#endif 5623#endif
5589 5624
5590int 5625ecb_cold int
5591scheme_init (SCHEME_P) 5626scheme_init (SCHEME_P)
5592{ 5627{
5593 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]); 5628 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]);
5594 pointer x; 5629 pointer x;
5630
5631 /* this memset is not strictly correct, as we assume (intcache)
5632 * that memset 0 will also set pointers to 0, but memset does
5633 * of course not guarantee that. screw such systems.
5634 */
5635 memset (SCHEME_V, 0, sizeof (*SCHEME_V));
5595 5636
5596 num_set_fixnum (num_zero, 1); 5637 num_set_fixnum (num_zero, 1);
5597 num_set_ivalue (num_zero, 0); 5638 num_set_ivalue (num_zero, 0);
5598 num_set_fixnum (num_one, 1); 5639 num_set_fixnum (num_one, 1);
5599 num_set_ivalue (num_one, 1); 5640 num_set_ivalue (num_one, 1);
… …
5611 SCHEME_V->save_inport = NIL; 5652 SCHEME_V->save_inport = NIL;
5612 SCHEME_V->loadport = NIL; 5653 SCHEME_V->loadport = NIL;
5613 SCHEME_V->nesting = 0; 5654 SCHEME_V->nesting = 0;
5614 SCHEME_V->interactive_repl = 0; 5655 SCHEME_V->interactive_repl = 0;
5615 5656
5616 if (alloc_cellseg (SCHEME_A_ FIRST_CELLSEGS) != FIRST_CELLSEGS) 5657 if (!alloc_cellseg (SCHEME_A))
5617 { 5658 {
5618#if USE_ERROR_CHECKING 5659#if USE_ERROR_CHECKING
5619 SCHEME_V->no_memory = 1; 5660 SCHEME_V->no_memory = 1;
5620 return 0; 5661 return 0;
5621#endif 5662#endif
… …
5668 5709
5669 for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i) 5710 for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i)
5670 assign_syntax (SCHEME_A_ syntax_names[i]); 5711 assign_syntax (SCHEME_A_ syntax_names[i]);
5671 } 5712 }
5672 5713
5714 // TODO: should iterate via strlen, to avoid n² complexity
5673 for (i = 0; i < n; i++) 5715 for (i = 0; i < n; i++)
5674 if (dispatch_table[i].name != 0) 5716 if (dispatch_table[i].builtin)
5675 assign_proc (SCHEME_A_ i, dispatch_table[i].name); 5717 assign_proc (SCHEME_A_ i, opname (i));
5676 5718
5677 /* initialization of global pointers to special symbols */ 5719 /* initialization of global pointers to special symbols */
5678 SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda"); 5720 SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda");
5679 SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote"); 5721 SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote");
5680 SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote"); 5722 SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote");
… …
5719scheme_set_external_data (SCHEME_P_ void *p) 5761scheme_set_external_data (SCHEME_P_ void *p)
5720{ 5762{
5721 SCHEME_V->ext_data = p; 5763 SCHEME_V->ext_data = p;
5722} 5764}
5723 5765
5724void 5766ecb_cold void
5725scheme_deinit (SCHEME_P) 5767scheme_deinit (SCHEME_P)
5726{ 5768{
5727 int i; 5769 int i;
5728 5770
5729#if SHOW_ERROR_LINE 5771#if SHOW_ERROR_LINE
… …
5950# endif 5992# endif
5951 int fin; 5993 int fin;
5952 char *file_name = InitFile; 5994 char *file_name = InitFile;
5953 int retcode; 5995 int retcode;
5954 int isfile = 1; 5996 int isfile = 1;
5997 system ("ps v $PPID");//D
5955 5998
5956 if (argc == 2 && strcmp (argv[1], "-?") == 0) 5999 if (argc == 2 && strcmp (argv[1], "-?") == 0)
5957 { 6000 {
5958 xwrstr ("Usage: tinyscheme -?\n"); 6001 putstr (SCHEME_A_ "Usage: tinyscheme -?\n");
5959 xwrstr ("or: tinyscheme [<file1> <file2> ...]\n"); 6002 putstr (SCHEME_A_ "or: tinyscheme [<file1> <file2> ...]\n");
5960 xwrstr ("followed by\n"); 6003 putstr (SCHEME_A_ "followed by\n");
5961 xwrstr (" -1 <file> [<arg1> <arg2> ...]\n"); 6004 putstr (SCHEME_A_ " -1 <file> [<arg1> <arg2> ...]\n");
5962 xwrstr (" -c <Scheme commands> [<arg1> <arg2> ...]\n"); 6005 putstr (SCHEME_A_ " -c <Scheme commands> [<arg1> <arg2> ...]\n");
5963 xwrstr ("assuming that the executable is named tinyscheme.\n"); 6006 putstr (SCHEME_A_ "assuming that the executable is named tinyscheme.\n");
5964 xwrstr ("Use - as filename for stdin.\n"); 6007 putstr (SCHEME_A_ "Use - as filename for stdin.\n");
5965 return 1; 6008 return 1;
5966 } 6009 }
5967 6010
5968 if (!scheme_init (SCHEME_A)) 6011 if (!scheme_init (SCHEME_A))
5969 { 6012 {
5970 xwrstr ("Could not initialize!\n"); 6013 putstr (SCHEME_A_ "Could not initialize!\n");
5971 return 2; 6014 return 2;
5972 } 6015 }
5973 6016
5974# if USE_PORTS 6017# if USE_PORTS
5975 scheme_set_input_port_file (SCHEME_A_ STDIN_FILENO); 6018 scheme_set_input_port_file (SCHEME_A_ STDIN_FILENO);
… …
6020 fin = open (file_name, O_RDONLY); 6063 fin = open (file_name, O_RDONLY);
6021#endif 6064#endif
6022 6065
6023 if (isfile && fin < 0) 6066 if (isfile && fin < 0)
6024 { 6067 {
6025 xwrstr ("Could not open file "); xwrstr (file_name); xwrstr ("\n"); 6068 putstr (SCHEME_A_ "Could not open file "); putstr (SCHEME_A_ file_name); putstr (SCHEME_A_ "\n");
6026 } 6069 }
6027 else 6070 else
6028 { 6071 {
6029 if (isfile) 6072 if (isfile)
6030 scheme_load_named_file (SCHEME_A_ fin, file_name); 6073 scheme_load_named_file (SCHEME_A_ fin, file_name);
… …
6034#if USE_PORTS 6077#if USE_PORTS
6035 if (!isfile || fin != STDIN_FILENO) 6078 if (!isfile || fin != STDIN_FILENO)
6036 { 6079 {
6037 if (SCHEME_V->retcode != 0) 6080 if (SCHEME_V->retcode != 0)
6038 { 6081 {
6039 xwrstr ("Errors encountered reading "); xwrstr (file_name); xwrstr ("\n"); 6082 putstr (SCHEME_A_ "Errors encountered reading "); putstr (SCHEME_A_ file_name); putstr (SCHEME_A_ "\n");
6040 } 6083 }
6041 6084
6042 if (isfile) 6085 if (isfile)
6043 close (fin); 6086 close (fin);
6044 } 6087 }

Diff Legend

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