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.1 by root, Wed Nov 25 05:02:56 2015 UTC vs.
Revision 1.37 by root, Sun Nov 29 05:09:24 2015 UTC

1 1/*
2/* T I N Y S C H E M E 1 . 4 1 2 * µscheme
3 *
4 * Copyright (C) 2015 Marc Alexander Lehmann <uscheme@schmorp.de>
5 * do as you want with this, attribution appreciated.
6 *
7 * Based opn tinyscheme-1.41 (original credits follow)
3 * Dimitrios Souflis (dsouflis@acm.org) 8 * Dimitrios Souflis (dsouflis@acm.org)
4 * Based on MiniScheme (original credits follow) 9 * Based on MiniScheme (original credits follow)
5 * (MINISCM) coded by Atsushi Moriwaki (11/5/1989) 10 * (MINISCM) coded by Atsushi Moriwaki (11/5/1989)
6 * (MINISCM) E-MAIL : moriwaki@kurims.kurims.kyoto-u.ac.jp 11 * (MINISCM) E-MAIL : moriwaki@kurims.kurims.kyoto-u.ac.jp
7 * (MINISCM) This version has been modified by R.C. Secrist. 12 * (MINISCM) This version has been modified by R.C. Secrist.
… …
23#endif 28#endif
24#if USE_MATH 29#if USE_MATH
25# include <math.h> 30# include <math.h>
26#endif 31#endif
27 32
33#include "ecb.h"
34
28#include <sys/types.h> 35#include <sys/types.h>
29#include <sys/stat.h> 36#include <sys/stat.h>
30#include <fcntl.h> 37#include <fcntl.h>
38
39#if !USE_ERROR_CHECKING
40# define NDEBUG
41#endif
42
43#include <assert.h>
44#include <stdlib.h>
45#include <string.h>
31 46
32#include <limits.h> 47#include <limits.h>
33#include <inttypes.h> 48#include <inttypes.h>
34#include <float.h> 49#include <float.h>
35//#include <ctype.h> 50//#include <ctype.h>
51
52#if '1' != '0' + 1 \
53 || '2' != '0' + 2 || '3' != '0' + 3 || '4' != '0' + 4 || '5' != '0' + 5 \
54 || '6' != '0' + 6 || '7' != '0' + 7 || '8' != '0' + 8 || '9' != '0' + 9 \
55 || 'b' != 'a' + 1 || 'c' != 'a' + 2 || 'd' != 'a' + 3 || 'e' != 'a' + 4 \
56 || 'f' != 'a' + 5
57# error "execution character set digits not consecutive"
58#endif
36 59
37enum { 60enum {
38 TOK_EOF, 61 TOK_EOF,
39 TOK_LPAREN, 62 TOK_LPAREN,
40 TOK_RPAREN, 63 TOK_RPAREN,
41 TOK_DOT, 64 TOK_DOT,
42 TOK_ATOM, 65 TOK_ATOM,
66 TOK_DOTATOM, /* atom name starting with '.' */
67 TOK_STRATOM, /* atom name enclosed in | */
43 TOK_QUOTE, 68 TOK_QUOTE,
44 TOK_DQUOTE, 69 TOK_DQUOTE,
45 TOK_BQUOTE, 70 TOK_BQUOTE,
46 TOK_COMMA, 71 TOK_COMMA,
47 TOK_ATMARK, 72 TOK_ATMARK,
… …
52 77
53#define BACKQUOTE '`' 78#define BACKQUOTE '`'
54#define DELIMITERS "()\";\f\t\v\n\r " 79#define DELIMITERS "()\";\f\t\v\n\r "
55 80
56#define NIL (&SCHEME_V->xNIL) //TODO: make this 0? 81#define NIL (&SCHEME_V->xNIL) //TODO: make this 0?
57#define S_T (&SCHEME_V->xT) 82#define S_T (&SCHEME_V->xT) //TODO: magic ptr value?
58#define S_F (&SCHEME_V->xF) 83#define S_F (&SCHEME_V->xF) //TODO: magic ptr value?
59#define S_SINK (&SCHEME_V->xsink) 84#define S_SINK (&SCHEME_V->xsink)
60#define S_EOF (&SCHEME_V->xEOF_OBJ) 85#define S_EOF (&SCHEME_V->xEOF_OBJ)
61
62/*
63 * Basic memory allocation units
64 */
65
66#define banner "TinyScheme 1.41-s"
67
68#include <string.h>
69#include <stdlib.h>
70 86
71#if !USE_MULTIPLICITY 87#if !USE_MULTIPLICITY
72static scheme sc; 88static scheme sc;
73#endif 89#endif
74 90
… …
134 c += 'a' - 'A'; 150 c += 'a' - 'A';
135 151
136 return c; 152 return c;
137} 153}
138 154
139#if USE_STRLWR 155static int
156xisdigit (char c)
157{
158 return c >= '0' && c <= '9';
159}
160
161#define toupper(c) xtoupper (c)
162#define tolower(c) xtolower (c)
163#define isdigit(c) xisdigit (c)
164
165#if USE_IGNORECASE
140static const char * 166static const char *
141strlwr (char *s) 167xstrlwr (char *s)
142{ 168{
143 const char *p = s; 169 const char *p = s;
144 170
145 while (*s) 171 while (*s)
146 { 172 {
… …
148 s++; 174 s++;
149 } 175 }
150 176
151 return p; 177 return p;
152} 178}
153#endif
154 179
180#define stricmp(a,b) strcasecmp (a, b)
181#define strlwr(s) xstrlwr (s)
182
183#else
155#define stricmp(a,b) strcmp (a, b) 184# define stricmp(a,b) strcmp (a, b)
156#define strlwr(s) (s) 185# define strlwr(s) (s)
157#define toupper(c) xtoupper(c) 186#endif
158#define tolower(c) xtolower(c)
159 187
160#ifndef prompt 188#ifndef prompt
161# define prompt "ts> " 189# define prompt "ts> "
162#endif 190#endif
163 191
… …
169# define FIRST_CELLSEGS 3 197# define FIRST_CELLSEGS 3
170#endif 198#endif
171 199
172enum scheme_types 200enum scheme_types
173{ 201{
174 T_NULL, 202 T_INTEGER,
203 T_REAL,
175 T_STRING, 204 T_STRING,
176 T_NUMBER,
177 T_SYMBOL, 205 T_SYMBOL,
178 T_PROC, 206 T_PROC,
179 T_PAIR, 207 T_PAIR, /* also used for free cells */
180 T_CLOSURE, 208 T_CLOSURE,
181 T_CONTINUATION, 209 T_CONTINUATION,
182 T_FOREIGN, 210 T_FOREIGN,
183 T_CHARACTER, 211 T_CHARACTER,
184 T_PORT, 212 T_PORT,
185 T_VECTOR, 213 T_VECTOR,
186 T_MACRO, 214 T_MACRO,
187 T_PROMISE, 215 T_PROMISE,
188 T_ENVIRONMENT, 216 T_ENVIRONMENT,
217 /* one more... */
189 T_NUM_SYSTEM_TYPES 218 T_NUM_SYSTEM_TYPES
190}; 219};
191 220
192#define T_MASKTYPE 31 /* 0000000000011111 */ 221#define T_MASKTYPE 0x000f
193#define T_SYNTAX 4096 /* 0001000000000000 */ 222#define T_SYNTAX 0x0010
194#define T_IMMUTABLE 8192 /* 0010000000000000 */ 223#define T_IMMUTABLE 0x0020
195#define T_ATOM 16384 /* 0100000000000000 */ /* only for gc */ 224#define T_ATOM 0x0040 /* only for gc */
196#define CLRATOM 49151 /* 1011111111111111 */ /* only for gc */ 225#define T_MARK 0x0080 /* only for gc */
197#define MARK 32768 /* 1000000000000000 */
198#define UNMARK 32767 /* 0111111111111111 */
199 226
227/* num, for generic arithmetic */
228struct num
229{
230 IVALUE ivalue;
231#if USE_REAL
232 RVALUE rvalue;
233 char is_fixnum;
234#endif
235};
200 236
201static num num_add (num a, num b); 237#if USE_REAL
202static num num_mul (num a, num b); 238# define num_is_fixnum(n) (n).is_fixnum
203static num num_div (num a, num b); 239# define num_set_fixnum(n,f) (n).is_fixnum = (f)
240# define num_ivalue(n) (n).ivalue
241# define num_rvalue(n) (n).rvalue
242# define num_set_ivalue(n,i) (n).rvalue = (n).ivalue = (i)
243# define num_set_rvalue(n,r) (n).rvalue = (r)
244#else
245# define num_is_fixnum(n) 1
246# define num_set_fixnum(n,f) 0
247# define num_ivalue(n) (n).ivalue
248# define num_rvalue(n) (n).ivalue
249# define num_set_ivalue(n,i) (n).ivalue = (i)
250# define num_set_rvalue(n,r) (n).ivalue = (r)
251#endif
252
253enum num_op { NUM_ADD, NUM_SUB, NUM_MUL, NUM_INTDIV };
254
255static num num_op (enum num_op op, num a, num b);
204static num num_intdiv (num a, num b); 256static num num_intdiv (num a, num b);
205static num num_sub (num a, num b);
206static num num_rem (num a, num b); 257static num num_rem (num a, num b);
207static num num_mod (num a, num b); 258static num num_mod (num a, num b);
208static int num_eq (num a, num b);
209static int num_gt (num a, num b);
210static int num_ge (num a, num b);
211static int num_lt (num a, num b);
212static int num_le (num a, num b);
213 259
214#if USE_MATH 260#if USE_MATH
215static double round_per_R5RS (double x); 261static double round_per_R5RS (double x);
216#endif 262#endif
217static int is_zero_rvalue (RVALUE x); 263static int is_zero_rvalue (RVALUE x);
218
219static INLINE int
220num_is_integer (pointer p)
221{
222 return num_is_fixnum (p->object.number);
223}
224 264
225static num num_zero; 265static num num_zero;
226static num num_one; 266static num num_one;
227 267
228/* macros for cell operations */ 268/* macros for cell operations */
229#define typeflag(p) ((p)->flag + 0) 269#define typeflag(p) ((p)->flag + 0)
230#define set_typeflag(p,v) ((p)->flag = (v)) 270#define set_typeflag(p,v) ((p)->flag = (v))
231#define type(p) (typeflag (p) & T_MASKTYPE) 271#define type(p) (typeflag (p) & T_MASKTYPE)
232 272
233INTERFACE INLINE int 273INTERFACE int
234is_string (pointer p) 274is_string (pointer p)
235{ 275{
236 return type (p) == T_STRING; 276 return type (p) == T_STRING;
237} 277}
238 278
239#define strvalue(p) ((p)->object.string.svalue) 279#define strvalue(p) ((p)->object.string.svalue)
240#define strlength(p) ((p)->object.string.length) 280#define strlength(p) ((p)->object.string.length)
241 281
242INTERFACE int is_list (SCHEME_P_ pointer p);
243INTERFACE INLINE int 282INTERFACE int
244is_vector (pointer p) 283is_vector (pointer p)
245{ 284{
246 return type (p) == T_VECTOR; 285 return type (p) == T_VECTOR;
247} 286}
248 287
288#define vecvalue(p) ((p)->object.vector.vvalue)
289#define veclength(p) ((p)->object.vector.length)
249INTERFACE void fill_vector (pointer vec, pointer obj); 290INTERFACE void fill_vector (pointer vec, uint32_t start, pointer obj);
250INTERFACE pointer vector_elem (pointer vec, int ielem); 291INTERFACE pointer vector_get (pointer vec, uint32_t ielem);
251INTERFACE void set_vector_elem (pointer vec, int ielem, pointer a); 292INTERFACE void vector_set (pointer vec, uint32_t ielem, pointer a);
252 293
253INTERFACE INLINE int 294INTERFACE int
295is_integer (pointer p)
296{
297 return type (p) == T_INTEGER;
298}
299
300/* not the same as in scheme, where integers are (correctly :) reals */
301INTERFACE int
302is_real (pointer p)
303{
304 return type (p) == T_REAL;
305}
306
307INTERFACE int
254is_number (pointer p) 308is_number (pointer p)
255{ 309{
256 return type (p) == T_NUMBER; 310 return is_integer (p) || is_real (p);
257} 311}
258 312
259INTERFACE INLINE int 313INTERFACE int
260is_integer (pointer p)
261{
262 if (!is_number (p))
263 return 0;
264
265 if (num_is_integer (p) || ivalue (p) == rvalue (p))
266 return 1;
267
268 return 0;
269}
270
271INTERFACE INLINE int
272is_real (pointer p)
273{
274 return is_number (p) && !num_is_fixnum (p->object.number);
275}
276
277INTERFACE INLINE int
278is_character (pointer p) 314is_character (pointer p)
279{ 315{
280 return type (p) == T_CHARACTER; 316 return type (p) == T_CHARACTER;
281} 317}
282 318
283INTERFACE INLINE char * 319INTERFACE char *
284string_value (pointer p) 320string_value (pointer p)
285{ 321{
286 return strvalue (p); 322 return strvalue (p);
287} 323}
288 324
289INLINE num
290nvalue (pointer p)
291{
292 return (p)->object.number;
293}
294
295INTERFACE long
296ivalue (pointer p)
297{
298 return num_is_integer (p) ? num_ivalue ((p)->object.number) : (long) num_rvalue ((p)->object.number);
299}
300
301INTERFACE RVALUE
302rvalue (pointer p)
303{
304 return num_is_integer (p) ? (RVALUE) num_ivalue ((p)->object.number) : num_rvalue ((p)->object.number);
305}
306
307#define ivalue_unchecked(p) ((p)->object.number.value.ivalue) 325#define ivalue_unchecked(p) (p)->object.ivalue
308#if USE_FLOAT 326#define set_ivalue(p,v) (p)->object.ivalue = (v)
327
328#if USE_REAL
309# define rvalue_unchecked(p) ((p)->object.number.value.rvalue) 329#define rvalue_unchecked(p) (p)->object.rvalue
310# define set_num_integer(p) (p)->object.number.is_fixnum=1; 330#define set_rvalue(p,v) (p)->object.rvalue = (v)
311# define set_num_real(p) (p)->object.number.is_fixnum=0;
312#else 331#else
313# define rvalue_unchecked(p) ((p)->object.number.value.ivalue) 332#define rvalue_unchecked(p) (p)->object.ivalue
314# define set_num_integer(p) 0 333#define set_rvalue(p,v) (p)->object.ivalue = (v)
315# define set_num_real(p) 0
316#endif 334#endif
335
317INTERFACE long 336INTERFACE long
318charvalue (pointer p) 337charvalue (pointer p)
319{ 338{
320 return ivalue_unchecked (p); 339 return ivalue_unchecked (p);
321} 340}
322 341
323INTERFACE INLINE int 342INTERFACE int
324is_port (pointer p) 343is_port (pointer p)
325{ 344{
326 return type (p) == T_PORT; 345 return type (p) == T_PORT;
327} 346}
328 347
329INTERFACE INLINE int 348INTERFACE int
330is_inport (pointer p) 349is_inport (pointer p)
331{ 350{
332 return is_port (p) && p->object.port->kind & port_input; 351 return is_port (p) && p->object.port->kind & port_input;
333} 352}
334 353
335INTERFACE INLINE int 354INTERFACE int
336is_outport (pointer p) 355is_outport (pointer p)
337{ 356{
338 return is_port (p) && p->object.port->kind & port_output; 357 return is_port (p) && p->object.port->kind & port_output;
339} 358}
340 359
341INTERFACE INLINE int 360INTERFACE int
342is_pair (pointer p) 361is_pair (pointer p)
343{ 362{
344 return type (p) == T_PAIR; 363 return type (p) == T_PAIR;
345} 364}
346 365
347#define car(p) ((p)->object.cons.car + 0) 366#define car(p) ((p)->object.cons.car + 0)
348#define cdr(p) ((p)->object.cons.cdr) /* find_consecutive_cells uses &cdr */ 367#define cdr(p) ((p)->object.cons.cdr + 0)
349 368
350#define caar(p) car (car (p)) 369static pointer caar (pointer p) { return car (car (p)); }
351#define cadr(p) car (cdr (p)) 370static pointer cadr (pointer p) { return car (cdr (p)); }
352#define cdar(p) cdr (car (p)) 371static pointer cdar (pointer p) { return cdr (car (p)); }
353#define cddr(p) cdr (cdr (p)) 372static pointer cddr (pointer p) { return cdr (cdr (p)); }
354 373
355#define cadar(p) car (cdr (car (p))) 374static pointer cadar (pointer p) { return car (cdr (car (p))); }
356#define caddr(p) car (cdr (cdr (p))) 375static pointer caddr (pointer p) { return car (cdr (cdr (p))); }
357#define cdaar(p) cdr (car (car (p))) 376static pointer cdaar (pointer p) { return cdr (car (car (p))); }
358 377
359INTERFACE void 378INTERFACE void
360set_car (pointer p, pointer q) 379set_car (pointer p, pointer q)
361{ 380{
362 p->object.cons.car = q; 381 p->object.cons.car = q;
… …
378pair_cdr (pointer p) 397pair_cdr (pointer p)
379{ 398{
380 return cdr (p); 399 return cdr (p);
381} 400}
382 401
383INTERFACE INLINE int 402INTERFACE int
384is_symbol (pointer p) 403is_symbol (pointer p)
385{ 404{
386 return type (p) == T_SYMBOL; 405 return type (p) == T_SYMBOL;
387} 406}
388 407
389INTERFACE INLINE char * 408INTERFACE char *
390symname (pointer p) 409symname (pointer p)
391{ 410{
392 return strvalue (car (p)); 411 return strvalue (car (p));
393} 412}
394 413
395#if USE_PLIST 414#if USE_PLIST
396SCHEME_EXPORT INLINE int 415SCHEME_EXPORT int
397hasprop (pointer p) 416hasprop (pointer p)
398{ 417{
399 return typeflag (p) & T_SYMBOL; 418 return typeflag (p) & T_SYMBOL;
400} 419}
401 420
402# define symprop(p) cdr(p) 421# define symprop(p) cdr(p)
403#endif 422#endif
404 423
405INTERFACE INLINE int 424INTERFACE int
406is_syntax (pointer p) 425is_syntax (pointer p)
407{ 426{
408 return typeflag (p) & T_SYNTAX; 427 return typeflag (p) & T_SYNTAX;
409} 428}
410 429
411INTERFACE INLINE int 430INTERFACE int
412is_proc (pointer p) 431is_proc (pointer p)
413{ 432{
414 return type (p) == T_PROC; 433 return type (p) == T_PROC;
415} 434}
416 435
417INTERFACE INLINE int 436INTERFACE int
418is_foreign (pointer p) 437is_foreign (pointer p)
419{ 438{
420 return type (p) == T_FOREIGN; 439 return type (p) == T_FOREIGN;
421} 440}
422 441
423INTERFACE INLINE char * 442INTERFACE char *
424syntaxname (pointer p) 443syntaxname (pointer p)
425{ 444{
426 return strvalue (car (p)); 445 return strvalue (car (p));
427} 446}
428 447
429#define procnum(p) ivalue(p) 448#define procnum(p) ivalue_unchecked (p)
430static const char *procname (pointer x); 449static const char *procname (pointer x);
431 450
432INTERFACE INLINE int 451INTERFACE int
433is_closure (pointer p) 452is_closure (pointer p)
434{ 453{
435 return type (p) == T_CLOSURE; 454 return type (p) == T_CLOSURE;
436} 455}
437 456
438INTERFACE INLINE int 457INTERFACE int
439is_macro (pointer p) 458is_macro (pointer p)
440{ 459{
441 return type (p) == T_MACRO; 460 return type (p) == T_MACRO;
442} 461}
443 462
444INTERFACE INLINE pointer 463INTERFACE pointer
445closure_code (pointer p) 464closure_code (pointer p)
446{ 465{
447 return car (p); 466 return car (p);
448} 467}
449 468
450INTERFACE INLINE pointer 469INTERFACE pointer
451closure_env (pointer p) 470closure_env (pointer p)
452{ 471{
453 return cdr (p); 472 return cdr (p);
454} 473}
455 474
456INTERFACE INLINE int 475INTERFACE int
457is_continuation (pointer p) 476is_continuation (pointer p)
458{ 477{
459 return type (p) == T_CONTINUATION; 478 return type (p) == T_CONTINUATION;
460} 479}
461 480
462#define cont_dump(p) cdr (p) 481#define cont_dump(p) cdr (p)
463#define set_cont_dump(p,v) set_cdr ((p), (v)) 482#define set_cont_dump(p,v) set_cdr ((p), (v))
464 483
465/* To do: promise should be forced ONCE only */ 484/* To do: promise should be forced ONCE only */
466INTERFACE INLINE int 485INTERFACE int
467is_promise (pointer p) 486is_promise (pointer p)
468{ 487{
469 return type (p) == T_PROMISE; 488 return type (p) == T_PROMISE;
470} 489}
471 490
472INTERFACE INLINE int 491INTERFACE int
473is_environment (pointer p) 492is_environment (pointer p)
474{ 493{
475 return type (p) == T_ENVIRONMENT; 494 return type (p) == T_ENVIRONMENT;
476} 495}
477 496
478#define setenvironment(p) set_typeflag ((p), T_ENVIRONMENT) 497#define setenvironment(p) set_typeflag ((p), T_ENVIRONMENT)
479 498
480#define is_atom(p) (typeflag (p) & T_ATOM) 499#define is_atom(p) (typeflag (p) & T_ATOM)
481#define setatom(p) set_typeflag ((p), typeflag (p) | T_ATOM) 500#define setatom(p) set_typeflag ((p), typeflag (p) | T_ATOM)
482#define clratom(p) set_typeflag ((p), typeflag (p) & CLRATOM) 501#define clratom(p) set_typeflag ((p), typeflag (p) & ~T_ATOM)
483 502
484#define is_mark(p) (typeflag (p) & MARK) 503#define is_mark(p) (typeflag (p) & T_MARK)
485#define setmark(p) set_typeflag ((p), typeflag (p) | MARK) 504#define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK)
486#define clrmark(p) set_typeflag ((p), typeflag (p) & UNMARK) 505#define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK)
487 506
488INTERFACE INLINE int 507INTERFACE int
489is_immutable (pointer p) 508is_immutable (pointer p)
490{ 509{
491 return typeflag (p) & T_IMMUTABLE; 510 return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING;
492} 511}
493 512
494INTERFACE INLINE void 513INTERFACE void
495setimmutable (pointer p) 514setimmutable (pointer p)
496{ 515{
516#if USE_ERROR_CHECKING
497 set_typeflag (p, T_IMMUTABLE); 517 set_typeflag (p, typeflag (p) | T_IMMUTABLE);
518#endif
519}
520
521/* Result is:
522 proper list: length
523 circular list: -1
524 not even a pair: -2
525 dotted list: -2 minus length before dot
526*/
527INTERFACE int
528list_length (SCHEME_P_ pointer a)
529{
530 int i = 0;
531 pointer slow, fast;
532
533 slow = fast = a;
534
535 while (1)
536 {
537 if (fast == NIL)
538 return i;
539
540 if (!is_pair (fast))
541 return -2 - i;
542
543 fast = cdr (fast);
544 ++i;
545
546 if (fast == NIL)
547 return i;
548
549 if (!is_pair (fast))
550 return -2 - i;
551
552 ++i;
553 fast = cdr (fast);
554
555 /* Safe because we would have already returned if `fast'
556 encountered a non-pair. */
557 slow = cdr (slow);
558
559 if (fast == slow)
560 {
561 /* the fast pointer has looped back around and caught up
562 with the slow pointer, hence the structure is circular,
563 not of finite length, and therefore not a list */
564 return -1;
565 }
566 }
567}
568
569INTERFACE int
570is_list (SCHEME_P_ pointer a)
571{
572 return list_length (SCHEME_A_ a) >= 0;
498} 573}
499 574
500#if USE_CHAR_CLASSIFIERS 575#if USE_CHAR_CLASSIFIERS
501static INLINE int 576ecb_inline int
502Cisalpha (int c) 577Cisalpha (int c)
503{ 578{
504 return isascii (c) && isalpha (c); 579 return isascii (c) && isalpha (c);
505} 580}
506 581
507static INLINE int 582ecb_inline int
508Cisdigit (int c) 583Cisdigit (int c)
509{ 584{
510 return isascii (c) && isdigit (c); 585 return isascii (c) && isdigit (c);
511} 586}
512 587
513static INLINE int 588ecb_inline int
514Cisspace (int c) 589Cisspace (int c)
515{ 590{
516 return isascii (c) && isspace (c); 591 return isascii (c) && isspace (c);
517} 592}
518 593
519static INLINE int 594ecb_inline int
520Cisupper (int c) 595Cisupper (int c)
521{ 596{
522 return isascii (c) && isupper (c); 597 return isascii (c) && isupper (c);
523} 598}
524 599
525static INLINE int 600ecb_inline int
526Cislower (int c) 601Cislower (int c)
527{ 602{
528 return isascii (c) && islower (c); 603 return isascii (c) && islower (c);
529} 604}
530#endif 605#endif
… …
591#endif 666#endif
592 667
593static int file_push (SCHEME_P_ const char *fname); 668static int file_push (SCHEME_P_ const char *fname);
594static void file_pop (SCHEME_P); 669static void file_pop (SCHEME_P);
595static int file_interactive (SCHEME_P); 670static int file_interactive (SCHEME_P);
596static INLINE int is_one_of (char *s, int c); 671ecb_inline int is_one_of (const char *s, int c);
597static int alloc_cellseg (SCHEME_P_ int n); 672static int alloc_cellseg (SCHEME_P_ int n);
598static long binary_decode (const char *s);
599static INLINE pointer get_cell (SCHEME_P_ pointer a, pointer b);
600static pointer xget_cell (SCHEME_P_ pointer a, pointer b); 673ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b);
601static pointer reserve_cells (SCHEME_P_ int n);
602static pointer get_consecutive_cells (SCHEME_P_ int n);
603static pointer find_consecutive_cells (SCHEME_P_ int n);
604static void finalize_cell (SCHEME_P_ pointer a); 674static void finalize_cell (SCHEME_P_ pointer a);
605static int count_consecutive_cells (pointer x, int needed); 675static int count_consecutive_cells (pointer x, int needed);
606static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all); 676static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all);
607static pointer mk_number (SCHEME_P_ num n); 677static pointer mk_number (SCHEME_P_ const num n);
608static char *store_string (SCHEME_P_ int len, const char *str, char fill); 678static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill);
609static pointer mk_vector (SCHEME_P_ int len); 679static pointer mk_vector (SCHEME_P_ uint32_t len);
610static pointer mk_atom (SCHEME_P_ char *q); 680static pointer mk_atom (SCHEME_P_ char *q);
611static pointer mk_sharp_const (SCHEME_P_ char *name); 681static pointer mk_sharp_const (SCHEME_P_ char *name);
612 682
613#if USE_PORTS 683#if USE_PORTS
614static pointer mk_port (SCHEME_P_ port *p); 684static pointer mk_port (SCHEME_P_ port *p);
… …
623static void mark (pointer a); 693static void mark (pointer a);
624static void gc (SCHEME_P_ pointer a, pointer b); 694static void gc (SCHEME_P_ pointer a, pointer b);
625static int basic_inchar (port *pt); 695static int basic_inchar (port *pt);
626static int inchar (SCHEME_P); 696static int inchar (SCHEME_P);
627static void backchar (SCHEME_P_ int c); 697static void backchar (SCHEME_P_ int c);
628static char *readstr_upto (SCHEME_P_ char *delim); 698static char *readstr_upto (SCHEME_P_ int skip, const char *delim);
629static pointer readstrexp (SCHEME_P); 699static pointer readstrexp (SCHEME_P_ char delim);
630static INLINE int skipspace (SCHEME_P); 700ecb_inline int skipspace (SCHEME_P);
631static int token (SCHEME_P); 701static int token (SCHEME_P);
632static void printslashstring (SCHEME_P_ char *s, int len); 702static void printslashstring (SCHEME_P_ char *s, int len);
633static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen); 703static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen);
634static void printatom (SCHEME_P_ pointer l, int f); 704static void printatom (SCHEME_P_ pointer l, int f);
635static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op); 705static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op);
… …
639static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list); 709static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list);
640static pointer revappend (SCHEME_P_ pointer a, pointer b); 710static pointer revappend (SCHEME_P_ pointer a, pointer b);
641static pointer ss_get_cont (SCHEME_P); 711static pointer ss_get_cont (SCHEME_P);
642static void ss_set_cont (SCHEME_P_ pointer cont); 712static void ss_set_cont (SCHEME_P_ pointer cont);
643static void dump_stack_mark (SCHEME_P); 713static void dump_stack_mark (SCHEME_P);
644static pointer opexe_0 (SCHEME_P_ enum scheme_opcodes op); 714static int opexe_0 (SCHEME_P_ enum scheme_opcodes op);
715static int opexe_1 (SCHEME_P_ enum scheme_opcodes op);
645static pointer opexe_2 (SCHEME_P_ enum scheme_opcodes op); 716static int opexe_2 (SCHEME_P_ enum scheme_opcodes op);
646static pointer opexe_3 (SCHEME_P_ enum scheme_opcodes op); 717static int opexe_3 (SCHEME_P_ enum scheme_opcodes op);
647static pointer opexe_4 (SCHEME_P_ enum scheme_opcodes op); 718static int opexe_4 (SCHEME_P_ enum scheme_opcodes op);
648static pointer opexe_5 (SCHEME_P_ enum scheme_opcodes op); 719static int opexe_5 (SCHEME_P_ enum scheme_opcodes op);
649static pointer opexe_6 (SCHEME_P_ enum scheme_opcodes op); 720static int opexe_6 (SCHEME_P_ enum scheme_opcodes op);
650static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op); 721static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op);
651static void assign_syntax (SCHEME_P_ char *name); 722static void assign_syntax (SCHEME_P_ const char *name);
652static int syntaxnum (pointer p); 723static int syntaxnum (pointer p);
653static void assign_proc (SCHEME_P_ enum scheme_opcodes, char *name); 724static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name);
725
726static IVALUE
727ivalue (pointer x)
728{
729 return is_integer (x) ? ivalue_unchecked (x) : rvalue_unchecked (x);
730}
731
732static RVALUE
733rvalue (pointer x)
734{
735 return is_integer (x) ? ivalue_unchecked (x) : rvalue_unchecked (x);
736}
737
738INTERFACE num
739nvalue (pointer x)
740{
741 num n;
742
743 num_set_fixnum (n, is_integer (x));
744
745 if (num_is_fixnum (n))
746 num_set_ivalue (n, ivalue_unchecked (x));
747 else
748 num_set_rvalue (n, rvalue_unchecked (x));
749
750 return n;
751}
654 752
655static num 753static num
656num_add (num a, num b) 754num_op (enum num_op op, num a, num b)
657{ 755{
658 num ret; 756 num ret;
659 757
660 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 758 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
661 759
662 if (num_is_fixnum (ret)) 760 if (num_is_fixnum (ret))
663 num_set_ivalue (ret, a.value.ivalue + b.value.ivalue); 761 {
762 switch (op)
763 {
764 case NUM_ADD: a.ivalue += b.ivalue; break;
765 case NUM_SUB: a.ivalue -= b.ivalue; break;
766 case NUM_MUL: a.ivalue *= b.ivalue; break;
767 case NUM_INTDIV: a.ivalue /= b.ivalue; break;
768 }
769
770 num_set_ivalue (ret, a.ivalue);
771 }
772#if USE_REAL
664 else 773 else
665 num_set_rvalue (ret, num_rvalue (a) + num_rvalue (b)); 774 {
775 switch (op)
776 {
777 case NUM_ADD: a.rvalue += b.rvalue; break;
778 case NUM_SUB: a.rvalue -= b.rvalue; break;
779 case NUM_MUL: a.rvalue *= b.rvalue; break;
780 case NUM_INTDIV: a.rvalue /= b.rvalue; break;
781 }
666 782
667 return ret; 783 num_set_rvalue (ret, a.rvalue);
668} 784 }
669 785#endif
670static num
671num_mul (num a, num b)
672{
673 num ret;
674
675 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
676
677 if (num_is_fixnum (ret))
678 num_set_ivalue (ret, a.value.ivalue * b.value.ivalue);
679 else
680 num_set_rvalue (ret, num_rvalue (a) * num_rvalue (b));
681 786
682 return ret; 787 return ret;
683} 788}
684 789
685static num 790static num
686num_div (num a, num b) 791num_div (num a, num b)
687{ 792{
688 num ret; 793 num ret;
689 794
690 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && a.value.ivalue % b.value.ivalue == 0); 795 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_ivalue (a) % num_ivalue (b) == 0);
691 796
692 if (num_is_fixnum (ret)) 797 if (num_is_fixnum (ret))
693 num_set_ivalue (ret, a.value.ivalue / b.value.ivalue); 798 num_set_ivalue (ret, num_ivalue (a) / num_ivalue (b));
694 else 799 else
695 num_set_rvalue (ret, num_rvalue (a) / num_rvalue (b)); 800 num_set_rvalue (ret, num_rvalue (a) / num_rvalue (b));
696
697 return ret;
698}
699
700static num
701num_intdiv (num a, num b)
702{
703 num ret;
704
705 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
706
707 if (num_is_fixnum (ret))
708 num_set_ivalue (ret, a.value.ivalue / b.value.ivalue);
709 else
710 num_set_rvalue (ret, num_rvalue (a) / num_rvalue (b));
711
712 return ret;
713}
714
715static num
716num_sub (num a, num b)
717{
718 num ret;
719
720 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
721
722 if (num_is_fixnum (ret))
723 num_set_ivalue (ret, a.value.ivalue - b.value.ivalue);
724 else
725 num_set_rvalue (ret, num_rvalue (a) - num_rvalue (b));
726 801
727 return ret; 802 return ret;
728} 803}
729 804
730static num 805static num
… …
771 846
772 num_set_ivalue (ret, res); 847 num_set_ivalue (ret, res);
773 return ret; 848 return ret;
774} 849}
775 850
851/* this completely disrespects NaNs, but r5rs doesn't even allow NaNs */
776static int 852static int
777num_eq (num a, num b) 853num_cmp (num a, num b)
778{ 854{
855 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
779 int ret; 856 int ret;
780 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
781 857
782 if (is_fixnum) 858 if (is_fixnum)
783 ret = a.value.ivalue == b.value.ivalue; 859 {
860 IVALUE av = num_ivalue (a);
861 IVALUE bv = num_ivalue (b);
862
863 ret = av == bv ? 0 : av < bv ? -1 : +1;
864 }
784 else 865 else
785 ret = num_rvalue (a) == num_rvalue (b); 866 {
867 RVALUE av = num_rvalue (a);
868 RVALUE bv = num_rvalue (b);
869
870 ret = av == bv ? 0 : av < bv ? -1 : +1;
871 }
786 872
787 return ret; 873 return ret;
788}
789
790
791static int
792num_gt (num a, num b)
793{
794 int ret;
795 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
796
797 if (is_fixnum)
798 ret = a.value.ivalue > b.value.ivalue;
799 else
800 ret = num_rvalue (a) > num_rvalue (b);
801
802 return ret;
803}
804
805static int
806num_ge (num a, num b)
807{
808 return !num_lt (a, b);
809}
810
811static int
812num_lt (num a, num b)
813{
814 int ret;
815 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
816
817 if (is_fixnum)
818 ret = a.value.ivalue < b.value.ivalue;
819 else
820 ret = num_rvalue (a) < num_rvalue (b);
821
822 return ret;
823}
824
825static int
826num_le (num a, num b)
827{
828 return !num_gt (a, b);
829} 874}
830 875
831#if USE_MATH 876#if USE_MATH
832 877
833/* Round to nearest. Round to even if midway */ 878/* Round to nearest. Round to even if midway */
… …
843 return ce; 888 return ce;
844 else if (dfl < dce) 889 else if (dfl < dce)
845 return fl; 890 return fl;
846 else 891 else
847 { 892 {
848 if (fmod (fl, 2.0) == 0.0) /* I imagine this holds */ 893 if (fmod (fl, 2) == 0) /* I imagine this holds */
849 return fl; 894 return fl;
850 else 895 else
851 return ce; 896 return ce;
852 } 897 }
853} 898}
854#endif 899#endif
855 900
856static int 901static int
857is_zero_rvalue (RVALUE x) 902is_zero_rvalue (RVALUE x)
858{ 903{
859#if USE_FLOAT 904 return x == 0;
905#if 0
906#if USE_REAL
860 return x < DBL_MIN && x > -DBL_MIN; /* why the hate of denormals? this should be == 0. */ 907 return x < DBL_MIN && x > -DBL_MIN; /* why the hate of denormals? this should be == 0. */
861#else 908#else
862 return x == 0; 909 return x == 0;
863#endif 910#endif
864} 911#endif
865
866static long
867binary_decode (const char *s)
868{
869 long x = 0;
870
871 while (*s != 0 && (*s == '1' || *s == '0'))
872 {
873 x <<= 1;
874 x += *s - '0';
875 s++;
876 }
877
878 return x;
879} 912}
880 913
881/* allocate new cell segment */ 914/* allocate new cell segment */
882static int 915static int
883alloc_cellseg (SCHEME_P_ int n) 916alloc_cellseg (SCHEME_P_ int n)
… …
903 return k; 936 return k;
904 937
905 i = ++SCHEME_V->last_cell_seg; 938 i = ++SCHEME_V->last_cell_seg;
906 SCHEME_V->alloc_seg[i] = cp; 939 SCHEME_V->alloc_seg[i] = cp;
907 940
908 /* insert new segment in address order */
909 newp = (pointer)cp; 941 newp = (pointer)cp;
910 SCHEME_V->cell_seg[i] = newp; 942 SCHEME_V->cell_seg[i] = newp;
911 SCHEME_V->cell_segsize[i] = segsize; 943 SCHEME_V->cell_segsize[i] = segsize;
912
913 //TODO: insert, not swap
914 while (i > 0 && SCHEME_V->cell_seg[i - 1] > SCHEME_V->cell_seg[i])
915 {
916 p = SCHEME_V->cell_seg[i];
917 SCHEME_V->cell_seg[i] = SCHEME_V->cell_seg[i - 1];
918 SCHEME_V->cell_seg[i - 1] = p;
919
920 k = SCHEME_V->cell_segsize[i];
921 SCHEME_V->cell_segsize[i] = SCHEME_V->cell_segsize[i - 1];
922 SCHEME_V->cell_segsize[i - 1] = k;
923
924 --i;
925 }
926
927 SCHEME_V->fcells += segsize; 944 SCHEME_V->fcells += segsize;
928 last = newp + segsize - 1; 945 last = newp + segsize - 1;
929 946
930 for (p = newp; p <= last; p++) 947 for (p = newp; p <= last; p++)
931 { 948 {
932 set_typeflag (p, 0); 949 set_typeflag (p, T_PAIR);
950 set_car (p, NIL);
933 set_cdr (p, p + 1); 951 set_cdr (p, p + 1);
934 set_car (p, NIL);
935 } 952 }
936 953
937 /* insert new cells in address order on free list */
938 if (SCHEME_V->free_cell == NIL || p < SCHEME_V->free_cell)
939 {
940 set_cdr (last, SCHEME_V->free_cell); 954 set_cdr (last, SCHEME_V->free_cell);
941 SCHEME_V->free_cell = newp; 955 SCHEME_V->free_cell = newp;
942 }
943 else
944 {
945 p = SCHEME_V->free_cell;
946
947 while (cdr (p) != NIL && newp > cdr (p))
948 p = cdr (p);
949
950 set_cdr (last, cdr (p));
951 set_cdr (p, newp);
952 }
953 } 956 }
954 957
955 return n; 958 return n;
956} 959}
957 960
958/* get new cell. parameter a, b is marked by gc. */ 961/* get new cell. parameter a, b is marked by gc. */
959static INLINE pointer 962ecb_inline pointer
960get_cell_x (SCHEME_P_ pointer a, pointer b) 963get_cell_x (SCHEME_P_ pointer a, pointer b)
961{ 964{
962 if (SCHEME_V->free_cell == NIL) 965 if (ecb_expect_false (SCHEME_V->free_cell == NIL))
963 { 966 {
964 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 967 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
965 return S_SINK; 968 return S_SINK;
966 969
967 if (SCHEME_V->free_cell == NIL) 970 if (SCHEME_V->free_cell == NIL)
… …
991 --SCHEME_V->fcells; 994 --SCHEME_V->fcells;
992 return x; 995 return x;
993 } 996 }
994} 997}
995 998
996/* make sure that there is a given number of cells free */
997static pointer
998reserve_cells (SCHEME_P_ int n)
999{
1000 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
1001 return NIL;
1002
1003 /* Are there enough cells available? */
1004 if (SCHEME_V->fcells < n)
1005 {
1006 /* If not, try gc'ing some */
1007 gc (SCHEME_A_ NIL, NIL);
1008
1009 if (SCHEME_V->fcells < n)
1010 {
1011 /* If there still aren't, try getting more heap */
1012 if (!alloc_cellseg (SCHEME_A_ 1) && USE_ERROR_CHECKING)
1013 {
1014 SCHEME_V->no_memory = 1;
1015 return NIL;
1016 }
1017 }
1018
1019 if (SCHEME_V->fcells < n && USE_ERROR_CHECKING)
1020 {
1021 /* If all fail, report failure */
1022 SCHEME_V->no_memory = 1;
1023 return NIL;
1024 }
1025 }
1026
1027 return S_T;
1028}
1029
1030static pointer
1031get_consecutive_cells (SCHEME_P_ int n)
1032{
1033 pointer x;
1034
1035 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
1036 return S_SINK;
1037
1038 /* Are there any cells available? */
1039 x = find_consecutive_cells (SCHEME_A_ n);
1040
1041 if (x != NIL)
1042 return x;
1043
1044 /* If not, try gc'ing some */
1045 gc (SCHEME_A_ NIL, NIL);
1046
1047 for (;;)
1048 {
1049 x = find_consecutive_cells (SCHEME_A_ n);
1050
1051 if (x != NIL)
1052 return x;
1053
1054 /* If there still aren't, try getting more heap */
1055 if (!alloc_cellseg (SCHEME_A_ 1))
1056 {
1057#if USE_ERROR_CHECKING
1058 SCHEME_V->no_memory = 1;
1059 return S_SINK;
1060#endif
1061 }
1062 }
1063}
1064
1065static int
1066count_consecutive_cells (pointer x, int needed)
1067{
1068 int n = 1;
1069
1070 while (cdr (x) == x + 1)
1071 {
1072 x = cdr (x);
1073 n++;
1074
1075 if (n > needed)
1076 return n;
1077 }
1078
1079 return n;
1080}
1081
1082static pointer
1083find_consecutive_cells (SCHEME_P_ int n)
1084{
1085 pointer *pp;
1086 int cnt;
1087
1088 pp = &SCHEME_V->free_cell;
1089
1090 while (*pp != NIL)
1091 {
1092 cnt = count_consecutive_cells (*pp, n);
1093
1094 if (cnt >= n)
1095 {
1096 pointer x = *pp;
1097
1098 *pp = cdr (*pp + n - 1);
1099 SCHEME_V->fcells -= n;
1100 return x;
1101 }
1102
1103 pp = &cdr (*pp + cnt - 1);
1104 }
1105
1106 return NIL;
1107}
1108
1109/* To retain recent allocs before interpreter knows about them - 999/* To retain recent allocs before interpreter knows about them -
1110 Tehom */ 1000 Tehom */
1111 1001
1112static void 1002static void
1113push_recent_alloc (SCHEME_P_ pointer recent, pointer extra) 1003push_recent_alloc (SCHEME_P_ pointer recent, pointer extra)
1114{ 1004{
1115 pointer holder = get_cell_x (SCHEME_A_ recent, extra); 1005 pointer holder = get_cell_x (SCHEME_A_ recent, extra);
1116 1006
1117 set_typeflag (holder, T_PAIR | T_IMMUTABLE); 1007 set_typeflag (holder, T_PAIR);
1008 setimmutable (holder);
1118 set_car (holder, recent); 1009 set_car (holder, recent);
1119 set_cdr (holder, car (S_SINK)); 1010 set_cdr (holder, car (S_SINK));
1120 set_car (S_SINK, holder); 1011 set_car (S_SINK, holder);
1121} 1012}
1122 1013
… …
1135 1026
1136 return cell; 1027 return cell;
1137} 1028}
1138 1029
1139static pointer 1030static pointer
1140get_vector_object (SCHEME_P_ int len, pointer init) 1031get_vector_object (SCHEME_P_ uint32_t len, pointer init)
1141{ 1032{
1142 pointer cells = get_consecutive_cells (SCHEME_A_ len / 2 + len % 2 + 1); 1033 pointer v = get_cell_x (SCHEME_A_ 0, 0);
1034 pointer *e = malloc (len * sizeof (pointer));
1143 1035
1144#if USE_ERROR_CHECKING 1036 if (!e && USE_ERROR_CHECKING)
1145 if (SCHEME_V->no_memory)
1146 return S_SINK; 1037 return S_SINK;
1147#endif
1148 1038
1149 /* Record it as a vector so that gc understands it. */ 1039 /* Record it as a vector so that gc understands it. */
1150 set_typeflag (cells, T_VECTOR | T_ATOM); 1040 set_typeflag (v, T_VECTOR | T_ATOM);
1151 ivalue_unchecked (cells) = len; 1041
1152 set_num_integer (cells); 1042 v->object.vector.vvalue = e;
1043 v->object.vector.length = len;
1153 fill_vector (cells, init); 1044 fill_vector (v, 0, init);
1154 push_recent_alloc (SCHEME_A_ cells, NIL); 1045 push_recent_alloc (SCHEME_A_ v, NIL);
1155 1046
1156 return cells; 1047 return v;
1157} 1048}
1158 1049
1159static INLINE void 1050ecb_inline void
1160ok_to_freely_gc (SCHEME_P) 1051ok_to_freely_gc (SCHEME_P)
1161{ 1052{
1162 set_car (S_SINK, NIL); 1053 set_car (S_SINK, NIL);
1163} 1054}
1164 1055
1165#if defined TSGRIND 1056#if defined TSGRIND
1166static void 1057static void
1167check_cell_alloced (pointer p, int expect_alloced) 1058check_cell_alloced (pointer p, int expect_alloced)
1168{ 1059{
1169 /* Can't use putstr(SCHEME_A_ str) because callers have no access to 1060 /* Can't use putstr(SCHEME_A_ str) because callers have no access to sc. */
1170 sc. */
1171 if (typeflag (p) & !expect_alloced) 1061 if (typeflag (p) & !expect_alloced)
1172 xwrstr ("Cell is already allocated!\n"); 1062 xwrstr ("Cell is already allocated!\n");
1173 1063
1174 if (!(typeflag (p)) & expect_alloced) 1064 if (!(typeflag (p)) & expect_alloced)
1175 xwrstr ("Cell is not allocated!\n"); 1065 xwrstr ("Cell is not allocated!\n");
… …
1198 if (immutable) 1088 if (immutable)
1199 setimmutable (x); 1089 setimmutable (x);
1200 1090
1201 set_car (x, a); 1091 set_car (x, a);
1202 set_cdr (x, b); 1092 set_cdr (x, b);
1093
1203 return x; 1094 return x;
1204} 1095}
1205 1096
1206/* ========== oblist implementation ========== */ 1097/* ========== oblist implementation ========== */
1207 1098
1099static pointer
1100generate_symbol (SCHEME_P_ const char *name)
1101{
1102 pointer x = mk_string (SCHEME_A_ name);
1103 setimmutable (x);
1104 x = immutable_cons (x, NIL);
1105 set_typeflag (x, T_SYMBOL);
1106 return x;
1107}
1108
1208#ifndef USE_OBJECT_LIST 1109#ifndef USE_OBJECT_LIST
1209 1110
1111static int
1210static int hash_fn (const char *key, int table_size); 1112hash_fn (const char *key, int table_size)
1113{
1114 const unsigned char *p = key;
1115 uint32_t hash = 2166136261;
1116
1117 while (*p)
1118 hash = (hash ^ *p++) * 16777619;
1119
1120 return hash % table_size;
1121}
1211 1122
1212static pointer 1123static pointer
1213oblist_initial_value (SCHEME_P) 1124oblist_initial_value (SCHEME_P)
1214{ 1125{
1215 return mk_vector (SCHEME_A_ 461); /* probably should be bigger */ 1126 return mk_vector (SCHEME_A_ 461); /* probably should be bigger */
… …
1217 1128
1218/* returns the new symbol */ 1129/* returns the new symbol */
1219static pointer 1130static pointer
1220oblist_add_by_name (SCHEME_P_ const char *name) 1131oblist_add_by_name (SCHEME_P_ const char *name)
1221{ 1132{
1222 pointer x; 1133 pointer x = generate_symbol (SCHEME_A_ name);
1223 int location;
1224
1225 x = immutable_cons (mk_string (SCHEME_A_ name), NIL);
1226 set_typeflag (x, T_SYMBOL);
1227 setimmutable (car (x));
1228
1229 location = hash_fn (name, ivalue_unchecked (SCHEME_V->oblist)); 1134 int location = hash_fn (name, veclength (SCHEME_V->oblist));
1230 set_vector_elem (SCHEME_V->oblist, location, immutable_cons (x, vector_elem (SCHEME_V->oblist, location))); 1135 vector_set (SCHEME_V->oblist, location, immutable_cons (x, vector_get (SCHEME_V->oblist, location)));
1231 return x; 1136 return x;
1232} 1137}
1233 1138
1234static INLINE pointer 1139ecb_inline pointer
1235oblist_find_by_name (SCHEME_P_ const char *name) 1140oblist_find_by_name (SCHEME_P_ const char *name)
1236{ 1141{
1237 int location; 1142 int location;
1238 pointer x; 1143 pointer x;
1239 char *s; 1144 char *s;
1240 1145
1241 location = hash_fn (name, ivalue_unchecked (SCHEME_V->oblist)); 1146 location = hash_fn (name, veclength (SCHEME_V->oblist));
1242 1147
1243 for (x = vector_elem (SCHEME_V->oblist, location); x != NIL; x = cdr (x)) 1148 for (x = vector_get (SCHEME_V->oblist, location); x != NIL; x = cdr (x))
1244 { 1149 {
1245 s = symname (car (x)); 1150 s = symname (car (x));
1246 1151
1247 /* case-insensitive, per R5RS section 2 */ 1152 /* case-insensitive, per R5RS section 2 */
1248 if (stricmp (name, s) == 0) 1153 if (stricmp (name, s) == 0)
… …
1257{ 1162{
1258 int i; 1163 int i;
1259 pointer x; 1164 pointer x;
1260 pointer ob_list = NIL; 1165 pointer ob_list = NIL;
1261 1166
1262 for (i = 0; i < ivalue_unchecked (SCHEME_V->oblist); i++) 1167 for (i = 0; i < veclength (SCHEME_V->oblist); i++)
1263 for (x = vector_elem (SCHEME_V->oblist, i); x != NIL; x = cdr (x)) 1168 for (x = vector_get (SCHEME_V->oblist, i); x != NIL; x = cdr (x))
1264 ob_list = cons (x, ob_list); 1169 ob_list = cons (x, ob_list);
1265 1170
1266 return ob_list; 1171 return ob_list;
1267} 1172}
1268 1173
… …
1272oblist_initial_value (SCHEME_P) 1177oblist_initial_value (SCHEME_P)
1273{ 1178{
1274 return NIL; 1179 return NIL;
1275} 1180}
1276 1181
1277static INLINE pointer 1182ecb_inline pointer
1278oblist_find_by_name (SCHEME_P_ const char *name) 1183oblist_find_by_name (SCHEME_P_ const char *name)
1279{ 1184{
1280 pointer x; 1185 pointer x;
1281 char *s; 1186 char *s;
1282 1187
… …
1294 1199
1295/* returns the new symbol */ 1200/* returns the new symbol */
1296static pointer 1201static pointer
1297oblist_add_by_name (SCHEME_P_ const char *name) 1202oblist_add_by_name (SCHEME_P_ const char *name)
1298{ 1203{
1299 pointer x; 1204 pointer x = mk_string (SCHEME_A_ name);
1300
1301 x = immutable_cons (mk_string (SCHEME_A_ name), NIL);
1302 set_typeflag (x, T_SYMBOL); 1205 set_typeflag (x, T_SYMBOL);
1303 setimmutable (car (x)); 1206 setimmutable (x);
1304 SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist); 1207 SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist);
1305 return x; 1208 return x;
1306} 1209}
1307 1210
1308static pointer 1211static pointer
… …
1341mk_character (SCHEME_P_ int c) 1244mk_character (SCHEME_P_ int c)
1342{ 1245{
1343 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1246 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1344 1247
1345 set_typeflag (x, (T_CHARACTER | T_ATOM)); 1248 set_typeflag (x, (T_CHARACTER | T_ATOM));
1346 ivalue_unchecked (x) = c; 1249 set_ivalue (x, c & 0xff);
1347 set_num_integer (x); 1250
1348 return x; 1251 return x;
1349} 1252}
1350 1253
1351/* get number atom (integer) */ 1254/* get number atom (integer) */
1352INTERFACE pointer 1255INTERFACE pointer
1353mk_integer (SCHEME_P_ long num) 1256mk_integer (SCHEME_P_ long n)
1354{ 1257{
1355 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1258 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1356 1259
1357 set_typeflag (x, (T_NUMBER | T_ATOM)); 1260 set_typeflag (x, (T_INTEGER | T_ATOM));
1358 ivalue_unchecked (x) = num; 1261 set_ivalue (x, n);
1359 set_num_integer (x); 1262
1360 return x; 1263 return x;
1361} 1264}
1362 1265
1363INTERFACE pointer 1266INTERFACE pointer
1364mk_real (SCHEME_P_ RVALUE n) 1267mk_real (SCHEME_P_ RVALUE n)
1365{ 1268{
1269#if USE_REAL
1366 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1270 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1367 1271
1368 set_typeflag (x, (T_NUMBER | T_ATOM)); 1272 set_typeflag (x, (T_REAL | T_ATOM));
1369 rvalue_unchecked (x) = n; 1273 set_rvalue (x, n);
1370 set_num_real (x); 1274
1371 return x; 1275 return x;
1276#else
1277 return mk_integer (SCHEME_A_ n);
1278#endif
1372} 1279}
1373 1280
1374static pointer 1281static pointer
1375mk_number (SCHEME_P_ num n) 1282mk_number (SCHEME_P_ const num n)
1376{ 1283{
1284#if USE_REAL
1377 if (num_is_fixnum (n)) 1285 return num_is_fixnum (n)
1378 { 1286 ? mk_integer (SCHEME_A_ num_ivalue (n))
1287 : mk_real (SCHEME_A_ num_rvalue (n));
1288#else
1379 return mk_integer (SCHEME_A_ num_ivalue (n)); 1289 return mk_integer (SCHEME_A_ num_ivalue (n));
1380 } 1290#endif
1381 else
1382 {
1383 return mk_real (SCHEME_A_ num_rvalue (n));
1384 }
1385} 1291}
1386 1292
1387/* allocate name to string area */ 1293/* allocate name to string area */
1388static char * 1294static char *
1389store_string (SCHEME_P_ int len_str, const char *str, char fill) 1295store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill)
1390{ 1296{
1391 char *q;
1392
1393 q = (char *)malloc (len_str + 1); 1297 char *q = malloc (len_str + 1);
1394 1298
1395 if (q == 0) 1299 if (q == 0 && USE_ERROR_CHECKING)
1396 { 1300 {
1397#if USE_ERROR_CHECKING
1398 SCHEME_V->no_memory = 1; 1301 SCHEME_V->no_memory = 1;
1399 return SCHEME_V->strbuff; 1302 return SCHEME_V->strbuff;
1400#endif
1401 } 1303 }
1402 1304
1403 if (str) 1305 if (str)
1404 { 1306 memcpy (q, str , len_str); /* caller must ensure that *str has length len_str */
1405 int l = strlen (str);
1406
1407 if (l > len_str)
1408 l = len_str;
1409
1410 memcpy (q, str, l + 1);
1411 q[l + 1] = 0;
1412 }
1413 else 1307 else
1414 {
1415 memset (q, fill, len_str); 1308 memset (q, fill, len_str);
1309
1416 q[len_str] = 0; 1310 q[len_str] = 0;
1417 }
1418 1311
1419 return q; 1312 return q;
1420} 1313}
1421 1314
1422/* get new string */
1423INTERFACE pointer 1315INTERFACE pointer
1424mk_string (SCHEME_P_ const char *str)
1425{
1426 return mk_counted_string (SCHEME_A_ str, strlen (str));
1427}
1428
1429INTERFACE pointer
1430mk_counted_string (SCHEME_P_ const char *str, int len)
1431{
1432 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1433
1434 set_typeflag (x, T_STRING | T_ATOM);
1435 strvalue (x) = store_string (SCHEME_A_ len, str, 0);
1436 strlength (x) = len;
1437 return x;
1438}
1439
1440INTERFACE pointer
1441mk_empty_string (SCHEME_P_ int len, char fill) 1316mk_empty_string (SCHEME_P_ uint32_t len, char fill)
1442{ 1317{
1443 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1318 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1444 1319
1445 set_typeflag (x, T_STRING | T_ATOM); 1320 set_typeflag (x, T_STRING | T_ATOM);
1446 strvalue (x) = store_string (SCHEME_A_ len, 0, fill); 1321 strvalue (x) = store_string (SCHEME_A_ len, 0, fill);
1447 strlength (x) = len; 1322 strlength (x) = len;
1448 return x; 1323 return x;
1449} 1324}
1450 1325
1451INTERFACE pointer 1326INTERFACE pointer
1327mk_counted_string (SCHEME_P_ const char *str, uint32_t len)
1328{
1329 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1330
1331 set_typeflag (x, T_STRING | T_ATOM);
1332 strvalue (x) = store_string (SCHEME_A_ len, str, 0);
1333 strlength (x) = len;
1334
1335 return x;
1336}
1337
1338INTERFACE pointer
1339mk_string (SCHEME_P_ const char *str)
1340{
1341 return mk_counted_string (SCHEME_A_ str, strlen (str));
1342}
1343
1344INTERFACE pointer
1452mk_vector (SCHEME_P_ int len) 1345mk_vector (SCHEME_P_ uint32_t len)
1453{ 1346{
1454 return get_vector_object (SCHEME_A_ len, NIL); 1347 return get_vector_object (SCHEME_A_ len, NIL);
1455} 1348}
1456 1349
1457INTERFACE void 1350INTERFACE void
1458fill_vector (pointer vec, pointer obj) 1351fill_vector (pointer vec, uint32_t start, pointer obj)
1459{ 1352{
1460 int i; 1353 int i;
1461 int num = ivalue (vec) / 2 + ivalue (vec) % 2;
1462 1354
1463 for (i = 0; i < num; i++) 1355 for (i = start; i < veclength (vec); i++)
1464 { 1356 vecvalue (vec)[i] = obj;
1465 set_typeflag (vec + 1 + i, T_PAIR); 1357}
1466 setimmutable (vec + 1 + i); 1358
1467 set_car (vec + 1 + i, obj); 1359INTERFACE void
1468 set_cdr (vec + 1 + i, obj); 1360vector_resize (pointer vec, uint32_t newsize, pointer fill)
1469 } 1361{
1362 uint32_t oldsize = veclength (vec);
1363 vecvalue (vec) = realloc (vecvalue (vec), newsize * sizeof (pointer));
1364 veclength (vec) = newsize;
1365 fill_vector (vec, oldsize, fill);
1470} 1366}
1471 1367
1472INTERFACE pointer 1368INTERFACE pointer
1473vector_elem (pointer vec, int ielem) 1369vector_get (pointer vec, uint32_t ielem)
1474{ 1370{
1475 int n = ielem / 2; 1371 return vecvalue(vec)[ielem];
1476
1477 if (ielem % 2 == 0)
1478 return car (vec + 1 + n);
1479 else
1480 return cdr (vec + 1 + n);
1481} 1372}
1482 1373
1483INTERFACE void 1374INTERFACE void
1484set_vector_elem (pointer vec, int ielem, pointer a) 1375vector_set (pointer vec, uint32_t ielem, pointer a)
1485{ 1376{
1486 int n = ielem / 2; 1377 vecvalue(vec)[ielem] = a;
1487
1488 if (ielem % 2 == 0)
1489 set_car (vec + 1 + n, a);
1490 else
1491 set_cdr (vec + 1 + n, a);
1492} 1378}
1493 1379
1494/* get new symbol */ 1380/* get new symbol */
1495INTERFACE pointer 1381INTERFACE pointer
1496mk_symbol (SCHEME_P_ const char *name) 1382mk_symbol (SCHEME_P_ const char *name)
1497{ 1383{
1498 pointer x;
1499
1500 /* first check oblist */ 1384 /* first check oblist */
1501 x = oblist_find_by_name (SCHEME_A_ name); 1385 pointer x = oblist_find_by_name (SCHEME_A_ name);
1502 1386
1503 if (x != NIL) 1387 if (x == NIL)
1504 return x;
1505 else
1506 {
1507 x = oblist_add_by_name (SCHEME_A_ name); 1388 x = oblist_add_by_name (SCHEME_A_ name);
1389
1508 return x; 1390 return x;
1509 }
1510} 1391}
1511 1392
1512INTERFACE pointer 1393INTERFACE pointer
1513gensym (SCHEME_P) 1394gensym (SCHEME_P)
1514{ 1395{
1515 pointer x; 1396 pointer x;
1516 char name[40]; 1397 char name[40] = "gensym-";
1517
1518 for (; SCHEME_V->gensym_cnt < LONG_MAX; SCHEME_V->gensym_cnt++)
1519 {
1520 strcpy (name, "gensym-");
1521 xnum (name + 7, SCHEME_V->gensym_cnt); 1398 xnum (name + 7, SCHEME_V->gensym_cnt);
1522 1399
1523 /* first check oblist */ 1400 return generate_symbol (SCHEME_A_ name);
1524 x = oblist_find_by_name (SCHEME_A_ name);
1525
1526 if (x != NIL)
1527 continue;
1528 else
1529 {
1530 x = oblist_add_by_name (SCHEME_A_ name);
1531 return x;
1532 }
1533 }
1534
1535 return NIL;
1536} 1401}
1537 1402
1538/* make symbol or number atom from string */ 1403/* make symbol or number atom from string */
1539static pointer 1404static pointer
1540mk_atom (SCHEME_P_ char *q) 1405mk_atom (SCHEME_P_ char *q)
… …
1542 char c, *p; 1407 char c, *p;
1543 int has_dec_point = 0; 1408 int has_dec_point = 0;
1544 int has_fp_exp = 0; 1409 int has_fp_exp = 0;
1545 1410
1546#if USE_COLON_HOOK 1411#if USE_COLON_HOOK
1547
1548 if ((p = strstr (q, "::")) != 0) 1412 if ((p = strstr (q, "::")) != 0)
1549 { 1413 {
1550 *p = 0; 1414 *p = 0;
1551 return cons (SCHEME_V->COLON_HOOK, 1415 return cons (SCHEME_V->COLON_HOOK,
1552 cons (cons (SCHEME_V->QUOTE, 1416 cons (cons (SCHEME_V->QUOTE,
1553 cons (mk_atom (SCHEME_A_ p + 2), NIL)), cons (mk_symbol (SCHEME_A_ strlwr (q)), NIL))); 1417 cons (mk_atom (SCHEME_A_ p + 2), NIL)), cons (mk_symbol (SCHEME_A_ strlwr (q)), NIL)));
1554 } 1418 }
1555
1556#endif 1419#endif
1557 1420
1558 p = q; 1421 p = q;
1559 c = *p++; 1422 c = *p++;
1560 1423
… …
1567 has_dec_point = 1; 1430 has_dec_point = 1;
1568 c = *p++; 1431 c = *p++;
1569 } 1432 }
1570 1433
1571 if (!isdigit (c)) 1434 if (!isdigit (c))
1572 {
1573 return mk_symbol (SCHEME_A_ strlwr (q)); 1435 return mk_symbol (SCHEME_A_ strlwr (q));
1574 }
1575 } 1436 }
1576 else if (c == '.') 1437 else if (c == '.')
1577 { 1438 {
1578 has_dec_point = 1; 1439 has_dec_point = 1;
1579 c = *p++; 1440 c = *p++;
1580 1441
1581 if (!isdigit (c)) 1442 if (!isdigit (c))
1582 {
1583 return mk_symbol (SCHEME_A_ strlwr (q)); 1443 return mk_symbol (SCHEME_A_ strlwr (q));
1584 }
1585 } 1444 }
1586 else if (!isdigit (c)) 1445 else if (!isdigit (c))
1587 {
1588 return mk_symbol (SCHEME_A_ strlwr (q)); 1446 return mk_symbol (SCHEME_A_ strlwr (q));
1589 }
1590 1447
1591 for (; (c = *p) != 0; ++p) 1448 for (; (c = *p) != 0; ++p)
1592 { 1449 {
1593 if (!isdigit (c)) 1450 if (!isdigit (c))
1594 { 1451 {
… …
1602 } 1459 }
1603 else if ((c == 'e') || (c == 'E')) 1460 else if ((c == 'e') || (c == 'E'))
1604 { 1461 {
1605 if (!has_fp_exp) 1462 if (!has_fp_exp)
1606 { 1463 {
1607 has_dec_point = 1; /* decimal point illegal 1464 has_dec_point = 1; /* decimal point illegal from now on */
1608 from now on */
1609 p++; 1465 p++;
1610 1466
1611 if ((*p == '-') || (*p == '+') || isdigit (*p)) 1467 if ((*p == '-') || (*p == '+') || isdigit (*p))
1612 {
1613 continue; 1468 continue;
1614 }
1615 } 1469 }
1616 } 1470 }
1617 1471
1618 return mk_symbol (SCHEME_A_ strlwr (q)); 1472 return mk_symbol (SCHEME_A_ strlwr (q));
1619 } 1473 }
1620 } 1474 }
1621 1475
1622#if USE_FLOAT 1476#if USE_REAL
1623 if (has_dec_point) 1477 if (has_dec_point)
1624 return mk_real (SCHEME_A_ atof (q)); 1478 return mk_real (SCHEME_A_ atof (q));
1625#endif 1479#endif
1626 1480
1627 return mk_integer (SCHEME_A_ strtol (q, 0, 10)); 1481 return mk_integer (SCHEME_A_ strtol (q, 0, 10));
… …
1629 1483
1630/* make constant */ 1484/* make constant */
1631static pointer 1485static pointer
1632mk_sharp_const (SCHEME_P_ char *name) 1486mk_sharp_const (SCHEME_P_ char *name)
1633{ 1487{
1634 long x;
1635 char tmp[STRBUFFSIZE];
1636
1637 if (!strcmp (name, "t")) 1488 if (!strcmp (name, "t"))
1638 return S_T; 1489 return S_T;
1639 else if (!strcmp (name, "f")) 1490 else if (!strcmp (name, "f"))
1640 return S_F; 1491 return S_F;
1641 else if (*name == 'o') /* #o (octal) */
1642 {
1643 x = strtol (name + 1, 0, 8);
1644 return mk_integer (SCHEME_A_ x);
1645 }
1646 else if (*name == 'd') /* #d (decimal) */
1647 {
1648 x = strtol (name + 1, 0, 10);
1649 return mk_integer (SCHEME_A_ x);
1650 }
1651 else if (*name == 'x') /* #x (hex) */
1652 {
1653 x = strtol (name + 1, 0, 16);
1654 return mk_integer (SCHEME_A_ x);
1655 }
1656 else if (*name == 'b') /* #b (binary) */
1657 {
1658 x = binary_decode (name + 1);
1659 return mk_integer (SCHEME_A_ x);
1660 }
1661 else if (*name == '\\') /* #\w (character) */ 1492 else if (*name == '\\') /* #\w (character) */
1662 { 1493 {
1663 int c = 0; 1494 int c;
1664 1495
1665 if (stricmp (name + 1, "space") == 0) 1496 if (stricmp (name + 1, "space") == 0)
1666 c = ' '; 1497 c = ' ';
1667 else if (stricmp (name + 1, "newline") == 0) 1498 else if (stricmp (name + 1, "newline") == 0)
1668 c = '\n'; 1499 c = '\n';
… …
1670 c = '\r'; 1501 c = '\r';
1671 else if (stricmp (name + 1, "tab") == 0) 1502 else if (stricmp (name + 1, "tab") == 0)
1672 c = '\t'; 1503 c = '\t';
1673 else if (name[1] == 'x' && name[2] != 0) 1504 else if (name[1] == 'x' && name[2] != 0)
1674 { 1505 {
1675 int c1 = strtol (name + 2, 0, 16); 1506 long c1 = strtol (name + 2, 0, 16);
1676 1507
1677 if (c1 <= UCHAR_MAX) 1508 if (0 <= c1 && c1 <= UCHAR_MAX)
1678 c = c1; 1509 c = c1;
1679 else 1510 else
1680 return NIL; 1511 return NIL;
1681 1512 }
1682#if USE_ASCII_NAMES 1513#if USE_ASCII_NAMES
1683 }
1684 else if (is_ascii_name (name + 1, &c)) 1514 else if (is_ascii_name (name + 1, &c))
1685 {
1686 /* nothing */ 1515 /* nothing */;
1687#endif 1516#endif
1688 }
1689 else if (name[2] == 0) 1517 else if (name[2] == 0)
1690 c = name[1]; 1518 c = name[1];
1691 else 1519 else
1692 return NIL; 1520 return NIL;
1693 1521
1694 return mk_character (SCHEME_A_ c); 1522 return mk_character (SCHEME_A_ c);
1695 } 1523 }
1696 else 1524 else
1525 {
1526 /* identify base by string index */
1527 const char baseidx[17] = "ffbf" "ffff" "ofdf" "ffff" "x";
1528 char *base = strchr (baseidx, *name);
1529
1530 if (base)
1531 return mk_integer (SCHEME_A_ strtol (name + 1, 0, base - baseidx));
1532
1697 return NIL; 1533 return NIL;
1534 }
1698} 1535}
1699 1536
1700/* ========== garbage collector ========== */ 1537/* ========== garbage collector ========== */
1701 1538
1702/*-- 1539/*--
1703 * We use algorithm E (Knuth, The Art of Computer Programming Vol.1, 1540 * We use algorithm E (Knuth, The Art of Computer Programming Vol.1,
1704 * sec. 2.3.5), the Schorr-Deutsch-Waite link-inversion algorithm, 1541 * sec. 2.3.5), the Schorr-Deutsch-Waite link-inversion algorithm,
1705 * for marking. 1542 * for marking.
1543 *
1544 * The exception is vectors - vectors are currently marked recursively,
1545 * which is inherited form tinyscheme and could be fixed by having another
1546 * word of context in the vector
1706 */ 1547 */
1707static void 1548static void
1708mark (pointer a) 1549mark (pointer a)
1709{ 1550{
1710 pointer t, q, p; 1551 pointer t, q, p;
1711 1552
1712 t = (pointer) 0; 1553 t = 0;
1713 p = a; 1554 p = a;
1714E2: 1555E2:
1715 setmark (p); 1556 setmark (p);
1716 printf ("mark %p %x\n", p, p->flag);//D
1717 1557
1718 if (is_vector (p)) 1558 if (ecb_expect_false (is_vector (p)))
1719 { 1559 {
1720 int i; 1560 int i;
1721 int num = ivalue_unchecked (p) / 2 + ivalue_unchecked (p) % 2;
1722 1561
1723 for (i = 0; i < num; i++) 1562 for (i = 0; i < veclength (p); i++)
1724 { 1563 mark (vecvalue (p)[i]);
1725 /* Vector cells will be treated like ordinary cells */
1726 mark (p + 1 + i);
1727 }
1728 } 1564 }
1729 1565
1730 if (is_atom (p)) 1566 if (is_atom (p))
1731 goto E6; 1567 goto E6;
1732 1568
… …
1742 goto E2; 1578 goto E2;
1743 } 1579 }
1744 1580
1745E5: 1581E5:
1746 q = cdr (p); /* down cdr */ 1582 q = cdr (p); /* down cdr */
1747 printf ("mark+ %p\n", q, q->flag);//D
1748 1583
1749 if (q && !is_mark (q)) 1584 if (q && !is_mark (q))
1750 { 1585 {
1751 set_cdr (p, t); 1586 set_cdr (p, t);
1752 t = p; 1587 t = p;
1753 p = q; 1588 p = q;
1754 goto E2; 1589 goto E2;
1755 } 1590 }
1756 1591
1757E6: /* up. Undo the link switching from steps E4 and E5. */ 1592E6: /* up. Undo the link switching from steps E4 and E5. */
1758
1759 if (!t) 1593 if (!t)
1760 return; 1594 return;
1761 1595
1762 q = t; 1596 q = t;
1763 1597
… …
1831 if (is_mark (p)) 1665 if (is_mark (p))
1832 clrmark (p); 1666 clrmark (p);
1833 else 1667 else
1834 { 1668 {
1835 /* reclaim cell */ 1669 /* reclaim cell */
1836 if (typeflag (p) != 0) 1670 if (typeflag (p) != T_PAIR)
1837 { 1671 {
1838 finalize_cell (SCHEME_A_ p); 1672 finalize_cell (SCHEME_A_ p);
1839 set_typeflag (p, 0); 1673 set_typeflag (p, T_PAIR);
1840 set_car (p, NIL); 1674 set_car (p, NIL);
1841 } 1675 }
1842 1676
1843 ++SCHEME_V->fcells; 1677 ++SCHEME_V->fcells;
1844 set_cdr (p, SCHEME_V->free_cell); 1678 set_cdr (p, SCHEME_V->free_cell);
… …
1846 } 1680 }
1847 } 1681 }
1848 } 1682 }
1849 1683
1850 if (SCHEME_V->gc_verbose) 1684 if (SCHEME_V->gc_verbose)
1685 {
1851 xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" cells were recovered.\n"); 1686 xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" cells were recovered.\n");
1687 }
1852} 1688}
1853 1689
1854static void 1690static void
1855finalize_cell (SCHEME_P_ pointer a) 1691finalize_cell (SCHEME_P_ pointer a)
1856{ 1692{
1693 /* TODO, fast bitmap check? */
1857 if (is_string (a)) 1694 if (is_string (a))
1858 free (strvalue (a)); 1695 free (strvalue (a));
1696 else if (is_vector (a))
1697 free (vecvalue (a));
1859#if USE_PORTS 1698#if USE_PORTS
1860 else if (is_port (a)) 1699 else if (is_port (a))
1861 { 1700 {
1862 if (a->object.port->kind & port_file && a->object.port->rep.stdio.closeit) 1701 if (a->object.port->kind & port_file && a->object.port->rep.stdio.closeit)
1863 port_close (SCHEME_A_ a, port_input | port_output); 1702 port_close (SCHEME_A_ a, port_input | port_output);
… …
2282#endif 2121#endif
2283} 2122}
2284 2123
2285/* read characters up to delimiter, but cater to character constants */ 2124/* read characters up to delimiter, but cater to character constants */
2286static char * 2125static char *
2287readstr_upto (SCHEME_P_ char *delim) 2126readstr_upto (SCHEME_P_ int skip, const char *delim)
2288{ 2127{
2289 char *p = SCHEME_V->strbuff; 2128 char *p = SCHEME_V->strbuff + skip;
2290 2129
2291 while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A)))); 2130 while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A))));
2292 2131
2293 if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\') 2132 if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\')
2294 {
2295 *p = 0; 2133 *p = 0;
2296 }
2297 else 2134 else
2298 { 2135 {
2299 backchar (SCHEME_A_ p[-1]); 2136 backchar (SCHEME_A_ p[-1]);
2300 *--p = '\0'; 2137 *--p = '\0';
2301 } 2138 }
… …
2303 return SCHEME_V->strbuff; 2140 return SCHEME_V->strbuff;
2304} 2141}
2305 2142
2306/* read string expression "xxx...xxx" */ 2143/* read string expression "xxx...xxx" */
2307static pointer 2144static pointer
2308readstrexp (SCHEME_P) 2145readstrexp (SCHEME_P_ char delim)
2309{ 2146{
2310 char *p = SCHEME_V->strbuff; 2147 char *p = SCHEME_V->strbuff;
2311 int c; 2148 int c;
2312 int c1 = 0; 2149 int c1 = 0;
2313 enum
2314 { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok; 2150 enum { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok;
2315 2151
2316 for (;;) 2152 for (;;)
2317 { 2153 {
2318 c = inchar (SCHEME_A); 2154 c = inchar (SCHEME_A);
2319 2155
2320 if (c == EOF || p - SCHEME_V->strbuff > sizeof (SCHEME_V->strbuff) - 1) 2156 if (c == EOF || p - SCHEME_V->strbuff > sizeof (SCHEME_V->strbuff) - 1)
2321 {
2322 return S_F; 2157 return S_F;
2323 }
2324 2158
2325 switch (state) 2159 switch (state)
2326 { 2160 {
2327 case st_ok: 2161 case st_ok:
2328 switch (c) 2162 if (ecb_expect_false (c == delim))
2329 {
2330 case '\\':
2331 state = st_bsl;
2332 break;
2333
2334 case '"':
2335 *p = 0;
2336 return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff); 2163 return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff);
2337 2164
2338 default: 2165 if (ecb_expect_false (c == '\\'))
2166 state = st_bsl;
2167 else
2339 *p++ = c; 2168 *p++ = c;
2340 break;
2341 }
2342 2169
2343 break; 2170 break;
2344 2171
2345 case st_bsl: 2172 case st_bsl:
2346 switch (c) 2173 switch (c)
… …
2376 case 'r': 2203 case 'r':
2377 *p++ = '\r'; 2204 *p++ = '\r';
2378 state = st_ok; 2205 state = st_ok;
2379 break; 2206 break;
2380 2207
2381 case '"':
2382 *p++ = '"';
2383 state = st_ok;
2384 break;
2385
2386 default: 2208 default:
2387 *p++ = c; 2209 *p++ = c;
2388 state = st_ok; 2210 state = st_ok;
2389 break; 2211 break;
2390 } 2212 }
2391 2213
2392 break; 2214 break;
2393 2215
2394 case st_x1: 2216 case st_x1:
2395 case st_x2: 2217 case st_x2:
2396 c = toupper (c); 2218 c = tolower (c);
2397 2219
2398 if (c >= '0' && c <= 'F') 2220 if (c >= '0' && c <= '9')
2399 {
2400 if (c <= '9')
2401 {
2402 c1 = (c1 << 4) + c - '0'; 2221 c1 = (c1 << 4) + c - '0';
2403 } 2222 else if (c >= 'a' && c <= 'f')
2404 else
2405 {
2406 c1 = (c1 << 4) + c - 'A' + 10; 2223 c1 = (c1 << 4) + c - 'a' + 10;
2407 } 2224 else
2225 return S_F;
2408 2226
2409 if (state == st_x1) 2227 if (state == st_x1)
2410 {
2411 state = st_x2; 2228 state = st_x2;
2412 }
2413 else
2414 {
2415 *p++ = c1;
2416 state = st_ok;
2417 }
2418 }
2419 else 2229 else
2420 { 2230 {
2421 return S_F; 2231 *p++ = c1;
2232 state = st_ok;
2422 } 2233 }
2423 2234
2424 break; 2235 break;
2425 2236
2426 case st_oct1: 2237 case st_oct1:
… …
2431 backchar (SCHEME_A_ c); 2242 backchar (SCHEME_A_ c);
2432 state = st_ok; 2243 state = st_ok;
2433 } 2244 }
2434 else 2245 else
2435 { 2246 {
2436 if (state == st_oct2 && c1 >= 32) 2247 if (state == st_oct2 && c1 >= ' ')
2437 return S_F; 2248 return S_F;
2438 2249
2439 c1 = (c1 << 3) + (c - '0'); 2250 c1 = (c1 << 3) + (c - '0');
2440 2251
2441 if (state == st_oct1) 2252 if (state == st_oct1)
… …
2446 state = st_ok; 2257 state = st_ok;
2447 } 2258 }
2448 } 2259 }
2449 2260
2450 break; 2261 break;
2451
2452 } 2262 }
2453 } 2263 }
2454} 2264}
2455 2265
2456/* check c is in chars */ 2266/* check c is in chars */
2457static INLINE int 2267ecb_inline int
2458is_one_of (char *s, int c) 2268is_one_of (const char *s, int c)
2459{ 2269{
2460 if (c == EOF) 2270 if (c == EOF)
2461 return 1; 2271 return 1;
2462 2272
2463 while (*s) 2273 return !!strchr (s, c);
2464 if (*s++ == c)
2465 return 1;
2466
2467 return 0;
2468} 2274}
2469 2275
2470/* skip white characters */ 2276/* skip white characters */
2471static INLINE int 2277ecb_inline int
2472skipspace (SCHEME_P) 2278skipspace (SCHEME_P)
2473{ 2279{
2474 int c, curr_line = 0; 2280 int c, curr_line = 0;
2475 2281
2476 do 2282 do
2477 { 2283 {
2478 c = inchar (SCHEME_A); 2284 c = inchar (SCHEME_A);
2479#if SHOW_ERROR_LINE 2285#if SHOW_ERROR_LINE
2480 if (c == '\n') 2286 if (c == '\n')
2481 curr_line++; 2287 curr_line++;
2482
2483#endif 2288#endif
2484 } 2289 }
2485 while (c == ' ' || c == '\n' || c == '\r' || c == '\t'); 2290 while (c == ' ' || c == '\n' || c == '\r' || c == '\t');
2486 2291
2487 /* record it */ 2292 /* record it */
… …
2525 if (is_one_of (" \n\t", c)) 2330 if (is_one_of (" \n\t", c))
2526 return TOK_DOT; 2331 return TOK_DOT;
2527 else 2332 else
2528 { 2333 {
2529 backchar (SCHEME_A_ c); 2334 backchar (SCHEME_A_ c);
2530 backchar (SCHEME_A_ '.');
2531 return TOK_ATOM; 2335 return TOK_DOTATOM;
2532 } 2336 }
2337
2338 case '|':
2339 return TOK_STRATOM;
2533 2340
2534 case '\'': 2341 case '\'':
2535 return TOK_QUOTE; 2342 return TOK_QUOTE;
2536 2343
2537 case ';': 2344 case ';':
… …
2647 int d = *s / 16; 2454 int d = *s / 16;
2648 2455
2649 putcharacter (SCHEME_A_ 'x'); 2456 putcharacter (SCHEME_A_ 'x');
2650 2457
2651 if (d < 10) 2458 if (d < 10)
2652 {
2653 putcharacter (SCHEME_A_ d + '0'); 2459 putcharacter (SCHEME_A_ d + '0');
2654 }
2655 else 2460 else
2656 {
2657 putcharacter (SCHEME_A_ d - 10 + 'A'); 2461 putcharacter (SCHEME_A_ d - 10 + 'A');
2658 }
2659 2462
2660 d = *s % 16; 2463 d = *s % 16;
2661 2464
2662 if (d < 10) 2465 if (d < 10)
2663 {
2664 putcharacter (SCHEME_A_ d + '0'); 2466 putcharacter (SCHEME_A_ d + '0');
2665 }
2666 else 2467 else
2667 {
2668 putcharacter (SCHEME_A_ d - 10 + 'A'); 2468 putcharacter (SCHEME_A_ d - 10 + 'A');
2669 }
2670 } 2469 }
2671 } 2470 }
2672 } 2471 }
2673 else 2472 else
2674 {
2675 putcharacter (SCHEME_A_ * s); 2473 putcharacter (SCHEME_A_ * s);
2676 }
2677 2474
2678 s++; 2475 s++;
2679 } 2476 }
2680 2477
2681 putcharacter (SCHEME_A_ '"'); 2478 putcharacter (SCHEME_A_ '"');
… …
2714 { 2511 {
2715 p = SCHEME_V->strbuff; 2512 p = SCHEME_V->strbuff;
2716 2513
2717 if (f <= 1 || f == 10) /* f is the base for numbers if > 1 */ 2514 if (f <= 1 || f == 10) /* f is the base for numbers if > 1 */
2718 { 2515 {
2719 if (num_is_integer (l)) 2516 if (is_integer (l))
2720 xnum (p, ivalue_unchecked (l)); 2517 xnum (p, ivalue_unchecked (l));
2721#if USE_FLOAT 2518#if USE_REAL
2722 else 2519 else
2723 { 2520 {
2724 snprintf (p, STRBUFFSIZE, "%.10g", rvalue_unchecked (l)); 2521 snprintf (p, STRBUFFSIZE, "%.10g", rvalue_unchecked (l));
2725 /* r5rs says there must be a '.' (unless 'e'?) */ 2522 /* r5rs says there must be a '.' (unless 'e'?) */
2726 f = strcspn (p, ".e"); 2523 f = strcspn (p, ".e");
… …
2898list_star (SCHEME_P_ pointer d) 2695list_star (SCHEME_P_ pointer d)
2899{ 2696{
2900 pointer p, q; 2697 pointer p, q;
2901 2698
2902 if (cdr (d) == NIL) 2699 if (cdr (d) == NIL)
2903 {
2904 return car (d); 2700 return car (d);
2905 }
2906 2701
2907 p = cons (car (d), cdr (d)); 2702 p = cons (car (d), cdr (d));
2908 q = p; 2703 q = p;
2909 2704
2910 while (cdr (cdr (p)) != NIL) 2705 while (cdr (cdr (p)) != NIL)
2911 { 2706 {
2912 d = cons (car (p), cdr (p)); 2707 d = cons (car (p), cdr (p));
2913 2708
2914 if (cdr (cdr (p)) != NIL) 2709 if (cdr (cdr (p)) != NIL)
2915 {
2916 p = cdr (d); 2710 p = cdr (d);
2917 }
2918 } 2711 }
2919 2712
2920 set_cdr (p, car (cdr (p))); 2713 set_cdr (p, car (cdr (p)));
2921 return q; 2714 return q;
2922} 2715}
… …
2936 2729
2937/* reverse list --- in-place */ 2730/* reverse list --- in-place */
2938static pointer 2731static pointer
2939reverse_in_place (SCHEME_P_ pointer term, pointer list) 2732reverse_in_place (SCHEME_P_ pointer term, pointer list)
2940{ 2733{
2941 pointer p = list, result = term, q; 2734 pointer result = term;
2735 pointer p = list;
2942 2736
2943 while (p != NIL) 2737 while (p != NIL)
2944 { 2738 {
2945 q = cdr (p); 2739 pointer q = cdr (p);
2946 set_cdr (p, result); 2740 set_cdr (p, result);
2947 result = p; 2741 result = p;
2948 p = q; 2742 p = q;
2949 } 2743 }
2950 2744
… …
2982 return 0; 2776 return 0;
2983 } 2777 }
2984 else if (is_number (a)) 2778 else if (is_number (a))
2985 { 2779 {
2986 if (is_number (b)) 2780 if (is_number (b))
2987 if (num_is_integer (a) == num_is_integer (b))
2988 return num_eq (nvalue (a), nvalue (b)); 2781 return num_cmp (nvalue (a), nvalue (b)) == 0;
2989 2782
2990 return 0; 2783 return 0;
2991 } 2784 }
2992 else if (is_character (a)) 2785 else if (is_character (a))
2993 { 2786 {
… …
3019/* () is #t in R5RS */ 2812/* () is #t in R5RS */
3020#define is_true(p) ((p) != S_F) 2813#define is_true(p) ((p) != S_F)
3021#define is_false(p) ((p) == S_F) 2814#define is_false(p) ((p) == S_F)
3022 2815
3023/* ========== Environment implementation ========== */ 2816/* ========== Environment implementation ========== */
3024
3025#if !defined(USE_ALIST_ENV) || !defined(USE_OBJECT_LIST)
3026
3027static int
3028hash_fn (const char *key, int table_size)
3029{
3030 unsigned int hashed = 0;
3031 const char *c;
3032 int bits_per_int = sizeof (unsigned int) * 8;
3033
3034 for (c = key; *c; c++)
3035 {
3036 /* letters have about 5 bits in them */
3037 hashed = (hashed << 5) | (hashed >> (bits_per_int - 5));
3038 hashed ^= *c;
3039 }
3040
3041 return hashed % table_size;
3042}
3043#endif
3044 2817
3045#ifndef USE_ALIST_ENV 2818#ifndef USE_ALIST_ENV
3046 2819
3047/* 2820/*
3048 * In this implementation, each frame of the environment may be 2821 * In this implementation, each frame of the environment may be
… …
3065 2838
3066 SCHEME_V->envir = immutable_cons (new_frame, old_env); 2839 SCHEME_V->envir = immutable_cons (new_frame, old_env);
3067 setenvironment (SCHEME_V->envir); 2840 setenvironment (SCHEME_V->envir);
3068} 2841}
3069 2842
3070static INLINE void 2843static uint32_t
2844sym_hash (pointer sym, uint32_t size)
2845{
2846 uintptr_t ptr = (uintptr_t)sym;
2847
2848#if 0
2849 /* table size is prime, so why mix */
2850 ptr += ptr >> 32;
2851 ptr += ptr >> 16;
2852 ptr += ptr >> 8;
2853#endif
2854
2855 return ptr % size;
2856}
2857
2858ecb_inline void
3071new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) 2859new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
3072{ 2860{
3073 pointer slot = immutable_cons (variable, value); 2861 pointer slot = immutable_cons (variable, value);
3074 2862
3075 if (is_vector (car (env))) 2863 if (is_vector (car (env)))
3076 { 2864 {
3077 int location = hash_fn (symname (variable), ivalue_unchecked (car (env))); 2865 int location = sym_hash (variable, veclength (car (env)));
3078
3079 set_vector_elem (car (env), location, immutable_cons (slot, vector_elem (car (env), location))); 2866 vector_set (car (env), location, immutable_cons (slot, vector_get (car (env), location)));
3080 } 2867 }
3081 else 2868 else
3082 set_car (env, immutable_cons (slot, car (env))); 2869 set_car (env, immutable_cons (slot, car (env)));
3083} 2870}
3084 2871
3085static pointer 2872static pointer
3086find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all) 2873find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all)
3087{ 2874{
3088 pointer x, y; 2875 pointer x, y;
3089 int location;
3090 2876
3091 for (x = env; x != NIL; x = cdr (x)) 2877 for (x = env; x != NIL; x = cdr (x))
3092 { 2878 {
3093 if (is_vector (car (x))) 2879 if (is_vector (car (x)))
3094 { 2880 {
3095 location = hash_fn (symname (hdl), ivalue_unchecked (car (x))); 2881 int location = sym_hash (hdl, veclength (car (x)));
3096 y = vector_elem (car (x), location); 2882 y = vector_get (car (x), location);
3097 } 2883 }
3098 else 2884 else
3099 y = car (x); 2885 y = car (x);
3100 2886
3101 for (; y != NIL; y = cdr (y)) 2887 for (; y != NIL; y = cdr (y))
3102 if (caar (y) == hdl) 2888 if (caar (y) == hdl)
3103 break; 2889 break;
3104 2890
3105 if (y != NIL) 2891 if (y != NIL)
2892 return car (y);
2893
2894 if (!all)
3106 break; 2895 break;
3107
3108 if (!all)
3109 return NIL;
3110 } 2896 }
3111
3112 if (x != NIL)
3113 return car (y);
3114 2897
3115 return NIL; 2898 return NIL;
3116} 2899}
3117 2900
3118#else /* USE_ALIST_ENV */ 2901#else /* USE_ALIST_ENV */
3119 2902
3120static INLINE void 2903ecb_inline void
3121new_frame_in_env (SCHEME_P_ pointer old_env) 2904new_frame_in_env (SCHEME_P_ pointer old_env)
3122{ 2905{
3123 SCHEME_V->envir = immutable_cons (NIL, old_env); 2906 SCHEME_V->envir = immutable_cons (NIL, old_env);
3124 setenvironment (SCHEME_V->envir); 2907 setenvironment (SCHEME_V->envir);
3125} 2908}
3126 2909
3127static INLINE void 2910ecb_inline void
3128new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) 2911new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
3129{ 2912{
3130 set_car (env, immutable_cons (immutable_cons (variable, value), car (env))); 2913 set_car (env, immutable_cons (immutable_cons (variable, value), car (env)));
3131} 2914}
3132 2915
… …
3140 for (y = car (x); y != NIL; y = cdr (y)) 2923 for (y = car (x); y != NIL; y = cdr (y))
3141 if (caar (y) == hdl) 2924 if (caar (y) == hdl)
3142 break; 2925 break;
3143 2926
3144 if (y != NIL) 2927 if (y != NIL)
2928 return car (y);
3145 break; 2929 break;
3146 2930
3147 if (!all) 2931 if (!all)
3148 return NIL; 2932 break;
3149 } 2933 }
3150
3151 if (x != NIL)
3152 return car (y);
3153 2934
3154 return NIL; 2935 return NIL;
3155} 2936}
3156 2937
3157#endif /* USE_ALIST_ENV else */ 2938#endif /* USE_ALIST_ENV else */
3158 2939
3159static INLINE void 2940ecb_inline void
3160new_slot_in_env (SCHEME_P_ pointer variable, pointer value) 2941new_slot_in_env (SCHEME_P_ pointer variable, pointer value)
3161{ 2942{
3162 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value); 2943 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value);
3163} 2944}
3164 2945
3165static INLINE void 2946ecb_inline void
3166set_slot_in_env (SCHEME_P_ pointer slot, pointer value) 2947set_slot_in_env (SCHEME_P_ pointer slot, pointer value)
3167{ 2948{
3168 set_cdr (slot, value); 2949 set_cdr (slot, value);
3169} 2950}
3170 2951
3171static INLINE pointer 2952ecb_inline pointer
3172slot_value_in_env (pointer slot) 2953slot_value_in_env (pointer slot)
3173{ 2954{
3174 return cdr (slot); 2955 return cdr (slot);
3175} 2956}
3176 2957
3177/* ========== Evaluation Cycle ========== */ 2958/* ========== Evaluation Cycle ========== */
3178 2959
3179static pointer 2960static int
3180xError_1 (SCHEME_P_ const char *s, pointer a) 2961xError_1 (SCHEME_P_ const char *s, pointer a)
3181{ 2962{
3182#if USE_ERROR_HOOK 2963#if USE_ERROR_HOOK
3183 pointer x; 2964 pointer x;
3184 pointer hdl = SCHEME_V->ERROR_HOOK; 2965 pointer hdl = SCHEME_V->ERROR_HOOK;
… …
3210#if USE_ERROR_HOOK 2991#if USE_ERROR_HOOK
3211 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, hdl, 1); 2992 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, hdl, 1);
3212 2993
3213 if (x != NIL) 2994 if (x != NIL)
3214 { 2995 {
3215 if (a) 2996 pointer code = a
3216 SCHEME_V->code = cons (cons (SCHEME_V->QUOTE, cons (a, NIL)), NIL); 2997 ? cons (cons (SCHEME_V->QUOTE, cons (a, NIL)), NIL)
3217 else 2998 : NIL;
3218 SCHEME_V->code = NIL;
3219 2999
3220 SCHEME_V->code = cons (mk_string (SCHEME_A_ s), SCHEME_V->code); 3000 code = cons (mk_string (SCHEME_A_ s), code);
3221 setimmutable (car (SCHEME_V->code)); 3001 setimmutable (car (code));
3222 SCHEME_V->code = cons (slot_value_in_env (x), SCHEME_V->code); 3002 SCHEME_V->code = cons (slot_value_in_env (x), code);
3223 SCHEME_V->op = OP_EVAL; 3003 SCHEME_V->op = OP_EVAL;
3224 3004
3225 return S_T; 3005 return 0;
3226 } 3006 }
3227#endif 3007#endif
3228 3008
3229 if (a) 3009 if (a)
3230 SCHEME_V->args = cons (a, NIL); 3010 SCHEME_V->args = cons (a, NIL);
3231 else 3011 else
3232 SCHEME_V->args = NIL; 3012 SCHEME_V->args = NIL;
3233 3013
3234 SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args); 3014 SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args);
3235 setimmutable (car (SCHEME_V->args)); 3015 setimmutable (car (SCHEME_V->args));
3236 SCHEME_V->op = (int)OP_ERR0; 3016 SCHEME_V->op = OP_ERR0;
3017
3237 return S_T; 3018 return 0;
3238} 3019}
3239 3020
3240#define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a) 3021#define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a)
3241#define Error_0(s) Error_1 (s, 0) 3022#define Error_0(s) Error_1 (s, 0)
3242 3023
3243/* Too small to turn into function */ 3024/* Too small to turn into function */
3244#define BEGIN do { 3025#define BEGIN do {
3245#define END } while (0) 3026#define END } while (0)
3246#define s_goto(a) BEGIN \ 3027#define s_goto(a) BEGIN \
3247 SCHEME_V->op = (int)(a); \ 3028 SCHEME_V->op = a; \
3248 return S_T; END 3029 return 0; END
3249 3030
3250#define s_return(a) return xs_return(SCHEME_A_ a) 3031#define s_return(a) return xs_return (SCHEME_A_ a)
3251 3032
3252#ifndef USE_SCHEME_STACK 3033#ifndef USE_SCHEME_STACK
3253 3034
3254/* this structure holds all the interpreter's registers */ 3035/* this structure holds all the interpreter's registers */
3255struct dump_stack_frame 3036struct dump_stack_frame
… …
3274 SCHEME_V->dump_size += STACK_GROWTH; 3055 SCHEME_V->dump_size += STACK_GROWTH;
3275 SCHEME_V->dump_base = realloc (SCHEME_V->dump_base, sizeof (struct dump_stack_frame) * SCHEME_V->dump_size); 3056 SCHEME_V->dump_base = realloc (SCHEME_V->dump_base, sizeof (struct dump_stack_frame) * SCHEME_V->dump_size);
3276 } 3057 }
3277 3058
3278 next_frame = SCHEME_V->dump_base + nframes; 3059 next_frame = SCHEME_V->dump_base + nframes;
3060
3279 next_frame->op = op; 3061 next_frame->op = op;
3280 next_frame->args = args; 3062 next_frame->args = args;
3281 next_frame->envir = SCHEME_V->envir; 3063 next_frame->envir = SCHEME_V->envir;
3282 next_frame->code = code; 3064 next_frame->code = code;
3065
3283 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1); 3066 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1);
3284} 3067}
3285 3068
3286static pointer 3069static int
3287xs_return (SCHEME_P_ pointer a) 3070xs_return (SCHEME_P_ pointer a)
3288{ 3071{
3289 int nframes = (uintptr_t)SCHEME_V->dump; 3072 int nframes = (uintptr_t)SCHEME_V->dump;
3290 struct dump_stack_frame *frame; 3073 struct dump_stack_frame *frame;
3291 3074
3292 SCHEME_V->value = a; 3075 SCHEME_V->value = a;
3293 3076
3294 if (nframes <= 0) 3077 if (nframes <= 0)
3295 return NIL; 3078 return -1;
3296 3079
3297 nframes--;
3298 frame = SCHEME_V->dump_base + nframes; 3080 frame = &SCHEME_V->dump_base[--nframes];
3299 SCHEME_V->op = frame->op; 3081 SCHEME_V->op = frame->op;
3300 SCHEME_V->args = frame->args; 3082 SCHEME_V->args = frame->args;
3301 SCHEME_V->envir = frame->envir; 3083 SCHEME_V->envir = frame->envir;
3302 SCHEME_V->code = frame->code; 3084 SCHEME_V->code = frame->code;
3303 SCHEME_V->dump = (pointer)(uintptr_t)nframes; 3085 SCHEME_V->dump = (pointer)(uintptr_t)nframes;
3304 3086
3305 return S_T; 3087 return 0;
3306} 3088}
3307 3089
3308static INLINE void 3090ecb_inline void
3309dump_stack_reset (SCHEME_P) 3091dump_stack_reset (SCHEME_P)
3310{ 3092{
3311 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */ 3093 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */
3312 SCHEME_V->dump = (pointer)0; 3094 SCHEME_V->dump = (pointer)+0;
3313} 3095}
3314 3096
3315static INLINE void 3097ecb_inline void
3316dump_stack_initialize (SCHEME_P) 3098dump_stack_initialize (SCHEME_P)
3317{ 3099{
3318 SCHEME_V->dump_size = 0; 3100 SCHEME_V->dump_size = 0;
3319 SCHEME_V->dump_base = NULL; 3101 SCHEME_V->dump_base = 0;
3320 dump_stack_reset (SCHEME_A); 3102 dump_stack_reset (SCHEME_A);
3321} 3103}
3322 3104
3323static void 3105static void
3324dump_stack_free (SCHEME_P) 3106dump_stack_free (SCHEME_P)
3325{ 3107{
3326 free (SCHEME_V->dump_base); 3108 free (SCHEME_V->dump_base);
3327 SCHEME_V->dump_base = NULL; 3109 SCHEME_V->dump_base = 0;
3328 SCHEME_V->dump = (pointer)0; 3110 SCHEME_V->dump = (pointer)0;
3329 SCHEME_V->dump_size = 0; 3111 SCHEME_V->dump_size = 0;
3330} 3112}
3331 3113
3332static void 3114static void
… …
3373 int i = 0; 3155 int i = 0;
3374 struct dump_stack_frame *frame = SCHEME_V->dump_base; 3156 struct dump_stack_frame *frame = SCHEME_V->dump_base;
3375 3157
3376 while (cont != NIL) 3158 while (cont != NIL)
3377 { 3159 {
3378 frame->op = ivalue (car (cont)); cont = cdr (cont); 3160 frame->op = ivalue_unchecked (car (cont)); cont = cdr (cont);
3379 frame->args = car (cont) ; cont = cdr (cont); 3161 frame->args = car (cont) ; cont = cdr (cont);
3380 frame->envir = car (cont) ; cont = cdr (cont); 3162 frame->envir = car (cont) ; cont = cdr (cont);
3381 frame->code = car (cont) ; cont = cdr (cont); 3163 frame->code = car (cont) ; cont = cdr (cont);
3382 3164
3383 ++frame; 3165 ++frame;
3384 ++i; 3166 ++i;
3385 } 3167 }
3386 3168
3387 SCHEME_V->dump = (pointer)(uintptr_t)i; 3169 SCHEME_V->dump = (pointer)(uintptr_t)i;
3388} 3170}
3389 3171
3390#else 3172#else
3391 3173
3392static INLINE void 3174ecb_inline void
3393dump_stack_reset (SCHEME_P) 3175dump_stack_reset (SCHEME_P)
3394{ 3176{
3395 SCHEME_V->dump = NIL; 3177 SCHEME_V->dump = NIL;
3396} 3178}
3397 3179
3398static INLINE void 3180ecb_inline void
3399dump_stack_initialize (SCHEME_P) 3181dump_stack_initialize (SCHEME_P)
3400{ 3182{
3401 dump_stack_reset (SCHEME_A); 3183 dump_stack_reset (SCHEME_A);
3402} 3184}
3403 3185
… …
3405dump_stack_free (SCHEME_P) 3187dump_stack_free (SCHEME_P)
3406{ 3188{
3407 SCHEME_V->dump = NIL; 3189 SCHEME_V->dump = NIL;
3408} 3190}
3409 3191
3410static pointer 3192static int
3411xs_return (SCHEME_P_ pointer a) 3193xs_return (SCHEME_P_ pointer a)
3412{ 3194{
3413 pointer dump = SCHEME_V->dump; 3195 pointer dump = SCHEME_V->dump;
3414 3196
3415 SCHEME_V->value = a; 3197 SCHEME_V->value = a;
3416 3198
3417 if (dump == NIL) 3199 if (dump == NIL)
3418 return NIL; 3200 return -1;
3419 3201
3420 SCHEME_V->op = ivalue (car (dump)); 3202 SCHEME_V->op = ivalue_unchecked (car (dump)); dump = cdr (dump);
3421 SCHEME_V->args = car (dump) ; dump = cdr (dump); 3203 SCHEME_V->args = car (dump) ; dump = cdr (dump);
3422 SCHEME_V->envir = car (dump) ; dump = cdr (dump); 3204 SCHEME_V->envir = car (dump) ; dump = cdr (dump);
3423 SCHEME_V->code = car (dump) ; dump = cdr (dump); 3205 SCHEME_V->code = car (dump) ; dump = cdr (dump);
3424 3206
3425 SCHEME_V->dump = dump; 3207 SCHEME_V->dump = dump;
3426 3208
3427 return S_T; 3209 return 0;
3428} 3210}
3429 3211
3430static void 3212static void
3431s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code) 3213s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code)
3432{ 3214{
… …
3457 3239
3458#endif 3240#endif
3459 3241
3460#define s_retbool(tf) s_return ((tf) ? S_T : S_F) 3242#define s_retbool(tf) s_return ((tf) ? S_T : S_F)
3461 3243
3462static pointer 3244static int
3463opexe_0 (SCHEME_P_ enum scheme_opcodes op) 3245opexe_0 (SCHEME_P_ enum scheme_opcodes op)
3464{ 3246{
3247 pointer args = SCHEME_V->args;
3465 pointer x, y; 3248 pointer x, y;
3466 3249
3467 switch (op) 3250 switch (op)
3468 { 3251 {
3469 case OP_LOAD: /* load */ 3252 case OP_LOAD: /* load */
3470 if (file_interactive (SCHEME_A)) 3253 if (file_interactive (SCHEME_A))
3471 { 3254 {
3472 xwrstr ("Loading "); xwrstr (strvalue (car (SCHEME_V->args))); xwrstr ("\n"); 3255 xwrstr ("Loading "); xwrstr (strvalue (car (args))); xwrstr ("\n");
3473 //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (SCHEME_V->args))); 3256 //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args)));
3474 } 3257 }
3475 3258
3476 if (!file_push (SCHEME_A_ strvalue (car (SCHEME_V->args)))) 3259 if (!file_push (SCHEME_A_ strvalue (car (args))))
3477 Error_1 ("unable to open", car (SCHEME_V->args)); 3260 Error_1 ("unable to open", car (args));
3478 else 3261 else
3479 { 3262 {
3480 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i); 3263 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i);
3481 s_goto (OP_T0LVL); 3264 s_goto (OP_T0LVL);
3482 } 3265 }
… …
3517 s_save (SCHEME_A_ OP_VALUEPRINT, NIL, NIL); 3300 s_save (SCHEME_A_ OP_VALUEPRINT, NIL, NIL);
3518 s_save (SCHEME_A_ OP_T1LVL, NIL, NIL); 3301 s_save (SCHEME_A_ OP_T1LVL, NIL, NIL);
3519 s_goto (OP_READ_INTERNAL); 3302 s_goto (OP_READ_INTERNAL);
3520 3303
3521 case OP_T1LVL: /* top level */ 3304 case OP_T1LVL: /* top level */
3522 SCHEME_V->code = SCHEME_V->value; 3305 SCHEME_V->code = SCHEME_V->value;
3523 SCHEME_V->inport = SCHEME_V->save_inport; 3306 SCHEME_V->inport = SCHEME_V->save_inport;
3524 s_goto (OP_EVAL); 3307 s_goto (OP_EVAL);
3525 3308
3526 case OP_READ_INTERNAL: /* internal read */ 3309 case OP_READ_INTERNAL: /* internal read */
3527 SCHEME_V->tok = token (SCHEME_A); 3310 SCHEME_V->tok = token (SCHEME_A);
3528 3311
3529 if (SCHEME_V->tok == TOK_EOF) 3312 if (SCHEME_V->tok == TOK_EOF)
3530 {
3531 s_return (S_EOF); 3313 s_return (S_EOF);
3532 }
3533 3314
3534 s_goto (OP_RDSEXPR); 3315 s_goto (OP_RDSEXPR);
3535 3316
3536 case OP_GENSYM: 3317 case OP_GENSYM:
3537 s_return (gensym (SCHEME_A)); 3318 s_return (gensym (SCHEME_A));
… …
3541 /* OP_VALUEPRINT is always pushed, because when changing from 3322 /* OP_VALUEPRINT is always pushed, because when changing from
3542 non-interactive to interactive mode, it needs to be 3323 non-interactive to interactive mode, it needs to be
3543 already on the stack */ 3324 already on the stack */
3544#if USE_TRACING 3325#if USE_TRACING
3545 if (SCHEME_V->tracing) 3326 if (SCHEME_V->tracing)
3546 {
3547 putstr (SCHEME_A_ "\nGives: "); 3327 putstr (SCHEME_A_ "\nGives: ");
3548 }
3549#endif 3328#endif
3550 3329
3551 if (file_interactive (SCHEME_A)) 3330 if (file_interactive (SCHEME_A))
3552 { 3331 {
3553 SCHEME_V->print_flag = 1; 3332 SCHEME_V->print_flag = 1;
3554 SCHEME_V->args = SCHEME_V->value; 3333 SCHEME_V->args = SCHEME_V->value;
3555 s_goto (OP_P0LIST); 3334 s_goto (OP_P0LIST);
3556 } 3335 }
3557 else 3336 else
3558 {
3559 s_return (SCHEME_V->value); 3337 s_return (SCHEME_V->value);
3560 }
3561 3338
3562 case OP_EVAL: /* main part of evaluation */ 3339 case OP_EVAL: /* main part of evaluation */
3563#if USE_TRACING 3340#if USE_TRACING
3564 if (SCHEME_V->tracing) 3341 if (SCHEME_V->tracing)
3565 { 3342 {
3566 /*s_save(SCHEME_A_ OP_VALUEPRINT,NIL,NIL); */ 3343 /*s_save(SCHEME_A_ OP_VALUEPRINT,NIL,NIL); */
3567 s_save (SCHEME_A_ OP_REAL_EVAL, SCHEME_V->args, SCHEME_V->code); 3344 s_save (SCHEME_A_ OP_REAL_EVAL, args, SCHEME_V->code);
3568 SCHEME_V->args = SCHEME_V->code; 3345 SCHEME_V->args = SCHEME_V->code;
3569 putstr (SCHEME_A_ "\nEval: "); 3346 putstr (SCHEME_A_ "\nEval: ");
3570 s_goto (OP_P0LIST); 3347 s_goto (OP_P0LIST);
3571 } 3348 }
3572 3349
3573 /* fall through */ 3350 /* fall through */
3351
3574 case OP_REAL_EVAL: 3352 case OP_REAL_EVAL:
3575#endif 3353#endif
3576 if (is_symbol (SCHEME_V->code)) /* symbol */ 3354 if (is_symbol (SCHEME_V->code)) /* symbol */
3577 { 3355 {
3578 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 1); 3356 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 1);
… …
3582 else 3360 else
3583 Error_1 ("eval: unbound variable:", SCHEME_V->code); 3361 Error_1 ("eval: unbound variable:", SCHEME_V->code);
3584 } 3362 }
3585 else if (is_pair (SCHEME_V->code)) 3363 else if (is_pair (SCHEME_V->code))
3586 { 3364 {
3365 x = car (SCHEME_V->code);
3366
3587 if (is_syntax (x = car (SCHEME_V->code))) /* SYNTAX */ 3367 if (is_syntax (x)) /* SYNTAX */
3588 { 3368 {
3589 SCHEME_V->code = cdr (SCHEME_V->code); 3369 SCHEME_V->code = cdr (SCHEME_V->code);
3590 s_goto (syntaxnum (x)); 3370 s_goto (syntaxnum (x));
3591 } 3371 }
3592 else /* first, eval top element and eval arguments */ 3372 else /* first, eval top element and eval arguments */
3593 { 3373 {
3594 s_save (SCHEME_A_ OP_E0ARGS, NIL, SCHEME_V->code); 3374 s_save (SCHEME_A_ OP_E0ARGS, NIL, SCHEME_V->code);
3595 /* If no macros => s_save(SCHEME_A_ OP_E1ARGS, NIL, cdr(SCHEME_V->code)); */ 3375 /* If no macros => s_save(SCHEME_A_ OP_E1ARGS, NIL, cdr(SCHEME_V->code)); */
3596 SCHEME_V->code = car (SCHEME_V->code); 3376 SCHEME_V->code = x;
3597 s_goto (OP_EVAL); 3377 s_goto (OP_EVAL);
3598 } 3378 }
3599 } 3379 }
3600 else 3380 else
3601 s_return (SCHEME_V->code); 3381 s_return (SCHEME_V->code);
… …
3613 SCHEME_V->code = cdr (SCHEME_V->code); 3393 SCHEME_V->code = cdr (SCHEME_V->code);
3614 s_goto (OP_E1ARGS); 3394 s_goto (OP_E1ARGS);
3615 } 3395 }
3616 3396
3617 case OP_E1ARGS: /* eval arguments */ 3397 case OP_E1ARGS: /* eval arguments */
3618 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 3398 args = cons (SCHEME_V->value, args);
3619 3399
3620 if (is_pair (SCHEME_V->code)) /* continue */ 3400 if (is_pair (SCHEME_V->code)) /* continue */
3621 { 3401 {
3622 s_save (SCHEME_A_ OP_E1ARGS, SCHEME_V->args, cdr (SCHEME_V->code)); 3402 s_save (SCHEME_A_ OP_E1ARGS, args, cdr (SCHEME_V->code));
3623 SCHEME_V->code = car (SCHEME_V->code); 3403 SCHEME_V->code = car (SCHEME_V->code);
3624 SCHEME_V->args = NIL; 3404 SCHEME_V->args = NIL;
3625 s_goto (OP_EVAL); 3405 s_goto (OP_EVAL);
3626 } 3406 }
3627 else /* end */ 3407 else /* end */
3628 { 3408 {
3629 SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); 3409 args = reverse_in_place (SCHEME_A_ NIL, args);
3630 SCHEME_V->code = car (SCHEME_V->args); 3410 SCHEME_V->code = car (args);
3631 SCHEME_V->args = cdr (SCHEME_V->args); 3411 SCHEME_V->args = cdr (args);
3632 s_goto (OP_APPLY); 3412 s_goto (OP_APPLY);
3633 } 3413 }
3634 3414
3635#if USE_TRACING 3415#if USE_TRACING
3636 3416
3637 case OP_TRACING: 3417 case OP_TRACING:
3638 { 3418 {
3639 int tr = SCHEME_V->tracing; 3419 int tr = SCHEME_V->tracing;
3640 3420
3641 SCHEME_V->tracing = ivalue (car (SCHEME_V->args)); 3421 SCHEME_V->tracing = ivalue_unchecked (car (args));
3642 s_return (mk_integer (SCHEME_A_ tr)); 3422 s_return (mk_integer (SCHEME_A_ tr));
3643 } 3423 }
3644 3424
3645#endif 3425#endif
3646 3426
3647 case OP_APPLY: /* apply 'code' to 'args' */ 3427 case OP_APPLY: /* apply 'code' to 'args' */
3648#if USE_TRACING 3428#if USE_TRACING
3649 if (SCHEME_V->tracing) 3429 if (SCHEME_V->tracing)
3650 { 3430 {
3651 s_save (SCHEME_A_ OP_REAL_APPLY, SCHEME_V->args, SCHEME_V->code); 3431 s_save (SCHEME_A_ OP_REAL_APPLY, args, SCHEME_V->code);
3652 SCHEME_V->print_flag = 1; 3432 SCHEME_V->print_flag = 1;
3653 /* SCHEME_V->args=cons(SCHEME_V->code,SCHEME_V->args); */ 3433 /* args=cons(SCHEME_V->code,args); */
3654 putstr (SCHEME_A_ "\nApply to: "); 3434 putstr (SCHEME_A_ "\nApply to: ");
3655 s_goto (OP_P0LIST); 3435 s_goto (OP_P0LIST);
3656 } 3436 }
3657 3437
3658 /* fall through */ 3438 /* fall through */
3439
3659 case OP_REAL_APPLY: 3440 case OP_REAL_APPLY:
3660#endif 3441#endif
3661 if (is_proc (SCHEME_V->code)) 3442 if (is_proc (SCHEME_V->code))
3662 {
3663 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */ 3443 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */
3664 }
3665 else if (is_foreign (SCHEME_V->code)) 3444 else if (is_foreign (SCHEME_V->code))
3666 { 3445 {
3667 /* Keep nested calls from GC'ing the arglist */ 3446 /* Keep nested calls from GC'ing the arglist */
3668 push_recent_alloc (SCHEME_A_ SCHEME_V->args, NIL); 3447 push_recent_alloc (SCHEME_A_ args, NIL);
3669 x = SCHEME_V->code->object.ff (SCHEME_A_ SCHEME_V->args); 3448 x = SCHEME_V->code->object.ff (SCHEME_A_ args);
3670 3449
3671 s_return (x); 3450 s_return (x);
3672 } 3451 }
3673 else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */ 3452 else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */
3674 { 3453 {
3675 /* Should not accept promise */ 3454 /* Should not accept promise */
3676 /* make environment */ 3455 /* make environment */
3677 new_frame_in_env (SCHEME_A_ closure_env (SCHEME_V->code)); 3456 new_frame_in_env (SCHEME_A_ closure_env (SCHEME_V->code));
3678 3457
3679 for (x = car (closure_code (SCHEME_V->code)), y = SCHEME_V->args; is_pair (x); x = cdr (x), y = cdr (y)) 3458 for (x = car (closure_code (SCHEME_V->code)), y = args; is_pair (x); x = cdr (x), y = cdr (y))
3680 { 3459 {
3681 if (y == NIL) 3460 if (y == NIL)
3682 {
3683 Error_0 ("not enough arguments"); 3461 Error_0 ("not enough arguments");
3684 }
3685 else 3462 else
3686 {
3687 new_slot_in_env (SCHEME_A_ car (x), car (y)); 3463 new_slot_in_env (SCHEME_A_ car (x), car (y));
3688 }
3689 } 3464 }
3690 3465
3691 if (x == NIL) 3466 if (x == NIL)
3692 { 3467 {
3693
3694 /*-- 3468 /*--
3695 * if (y != NIL) { 3469 * if (y != NIL) {
3696 * Error_0("too many arguments"); 3470 * Error_0("too many arguments");
3697 * } 3471 * }
3698 */ 3472 */
3699 } 3473 }
3700 else if (is_symbol (x)) 3474 else if (is_symbol (x))
3701 new_slot_in_env (SCHEME_A_ x, y); 3475 new_slot_in_env (SCHEME_A_ x, y);
3702 else 3476 else
3703 {
3704 Error_1 ("syntax error in closure: not a symbol:", x); 3477 Error_1 ("syntax error in closure: not a symbol:", x);
3705 }
3706 3478
3707 SCHEME_V->code = cdr (closure_code (SCHEME_V->code)); 3479 SCHEME_V->code = cdr (closure_code (SCHEME_V->code));
3708 SCHEME_V->args = NIL; 3480 SCHEME_V->args = NIL;
3709 s_goto (OP_BEGIN); 3481 s_goto (OP_BEGIN);
3710 } 3482 }
3711 else if (is_continuation (SCHEME_V->code)) /* CONTINUATION */ 3483 else if (is_continuation (SCHEME_V->code)) /* CONTINUATION */
3712 { 3484 {
3713 ss_set_cont (SCHEME_A_ cont_dump (SCHEME_V->code)); 3485 ss_set_cont (SCHEME_A_ cont_dump (SCHEME_V->code));
3714 s_return (SCHEME_V->args != NIL ? car (SCHEME_V->args) : NIL); 3486 s_return (args != NIL ? car (args) : NIL);
3715 } 3487 }
3716 else 3488 else
3717 Error_0 ("illegal function"); 3489 Error_0 ("illegal function");
3718 3490
3719 case OP_DOMACRO: /* do macro */ 3491 case OP_DOMACRO: /* do macro */
… …
3728 { 3500 {
3729 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1); 3501 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1);
3730 3502
3731 if (f != NIL) 3503 if (f != NIL)
3732 { 3504 {
3733 s_save (SCHEME_A_ OP_LAMBDA1, SCHEME_V->args, SCHEME_V->code); 3505 s_save (SCHEME_A_ OP_LAMBDA1, args, SCHEME_V->code);
3734 SCHEME_V->args = cons (SCHEME_V->code, NIL); 3506 SCHEME_V->args = cons (SCHEME_V->code, NIL);
3735 SCHEME_V->code = slot_value_in_env (f); 3507 SCHEME_V->code = slot_value_in_env (f);
3736 s_goto (OP_APPLY); 3508 s_goto (OP_APPLY);
3737 } 3509 }
3738 3510
… …
3749 s_return (mk_closure (SCHEME_A_ SCHEME_V->code, SCHEME_V->envir)); 3521 s_return (mk_closure (SCHEME_A_ SCHEME_V->code, SCHEME_V->envir));
3750 3522
3751#endif 3523#endif
3752 3524
3753 case OP_MKCLOSURE: /* make-closure */ 3525 case OP_MKCLOSURE: /* make-closure */
3754 x = car (SCHEME_V->args); 3526 x = car (args);
3755 3527
3756 if (car (x) == SCHEME_V->LAMBDA) 3528 if (car (x) == SCHEME_V->LAMBDA)
3757 x = cdr (x); 3529 x = cdr (x);
3758 3530
3759 if (cdr (SCHEME_V->args) == NIL) 3531 if (cdr (args) == NIL)
3760 y = SCHEME_V->envir; 3532 y = SCHEME_V->envir;
3761 else 3533 else
3762 y = cadr (SCHEME_V->args); 3534 y = cadr (args);
3763 3535
3764 s_return (mk_closure (SCHEME_A_ x, y)); 3536 s_return (mk_closure (SCHEME_A_ x, y));
3765 3537
3766 case OP_QUOTE: /* quote */ 3538 case OP_QUOTE: /* quote */
3767 s_return (car (SCHEME_V->code)); 3539 s_return (car (SCHEME_V->code));
… …
3780 x = car (SCHEME_V->code); 3552 x = car (SCHEME_V->code);
3781 SCHEME_V->code = cadr (SCHEME_V->code); 3553 SCHEME_V->code = cadr (SCHEME_V->code);
3782 } 3554 }
3783 3555
3784 if (!is_symbol (x)) 3556 if (!is_symbol (x))
3785 {
3786 Error_0 ("variable is not a symbol"); 3557 Error_0 ("variable is not a symbol");
3787 }
3788 3558
3789 s_save (SCHEME_A_ OP_DEF1, NIL, x); 3559 s_save (SCHEME_A_ OP_DEF1, NIL, x);
3790 s_goto (OP_EVAL); 3560 s_goto (OP_EVAL);
3791 3561
3792 case OP_DEF1: /* define */ 3562 case OP_DEF1: /* define */
3793 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 0); 3563 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 0);
3794 3564
3795 if (x != NIL) 3565 if (x != NIL)
3796 {
3797 set_slot_in_env (SCHEME_A_ x, SCHEME_V->value); 3566 set_slot_in_env (SCHEME_A_ x, SCHEME_V->value);
3798 }
3799 else 3567 else
3800 {
3801 new_slot_in_env (SCHEME_A_ SCHEME_V->code, SCHEME_V->value); 3568 new_slot_in_env (SCHEME_A_ SCHEME_V->code, SCHEME_V->value);
3802 }
3803 3569
3804 s_return (SCHEME_V->code); 3570 s_return (SCHEME_V->code);
3805 3571
3806 3572
3807 case OP_DEFP: /* defined? */ 3573 case OP_DEFP: /* defined? */
3808 x = SCHEME_V->envir; 3574 x = SCHEME_V->envir;
3809 3575
3810 if (cdr (SCHEME_V->args) != NIL) 3576 if (cdr (args) != NIL)
3811 {
3812 x = cadr (SCHEME_V->args); 3577 x = cadr (args);
3813 }
3814 3578
3815 s_retbool (find_slot_in_env (SCHEME_A_ x, car (SCHEME_V->args), 1) != NIL); 3579 s_retbool (find_slot_in_env (SCHEME_A_ x, car (args), 1) != NIL);
3816 3580
3817 case OP_SET0: /* set! */ 3581 case OP_SET0: /* set! */
3818 if (is_immutable (car (SCHEME_V->code))) 3582 if (is_immutable (car (SCHEME_V->code)))
3819 Error_1 ("set!: unable to alter immutable variable", car (SCHEME_V->code)); 3583 Error_1 ("set!: unable to alter immutable variable", car (SCHEME_V->code));
3820 3584
… …
3829 { 3593 {
3830 set_slot_in_env (SCHEME_A_ y, SCHEME_V->value); 3594 set_slot_in_env (SCHEME_A_ y, SCHEME_V->value);
3831 s_return (SCHEME_V->value); 3595 s_return (SCHEME_V->value);
3832 } 3596 }
3833 else 3597 else
3834 {
3835 Error_1 ("set!: unbound variable:", SCHEME_V->code); 3598 Error_1 ("set!: unbound variable:", SCHEME_V->code);
3836 }
3837 3599
3838 3600
3839 case OP_BEGIN: /* begin */ 3601 case OP_BEGIN: /* begin */
3840 if (!is_pair (SCHEME_V->code)) 3602 if (!is_pair (SCHEME_V->code))
3841 {
3842 s_return (SCHEME_V->code); 3603 s_return (SCHEME_V->code);
3843 }
3844 3604
3845 if (cdr (SCHEME_V->code) != NIL) 3605 if (cdr (SCHEME_V->code) != NIL)
3846 {
3847 s_save (SCHEME_A_ OP_BEGIN, NIL, cdr (SCHEME_V->code)); 3606 s_save (SCHEME_A_ OP_BEGIN, NIL, cdr (SCHEME_V->code));
3848 }
3849 3607
3850 SCHEME_V->code = car (SCHEME_V->code); 3608 SCHEME_V->code = car (SCHEME_V->code);
3851 s_goto (OP_EVAL); 3609 s_goto (OP_EVAL);
3852 3610
3853 case OP_IF0: /* if */ 3611 case OP_IF0: /* if */
… …
3857 3615
3858 case OP_IF1: /* if */ 3616 case OP_IF1: /* if */
3859 if (is_true (SCHEME_V->value)) 3617 if (is_true (SCHEME_V->value))
3860 SCHEME_V->code = car (SCHEME_V->code); 3618 SCHEME_V->code = car (SCHEME_V->code);
3861 else 3619 else
3862 SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because 3620 SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because * car(NIL) = NIL */
3863
3864 * car(NIL) = NIL */
3865 s_goto (OP_EVAL); 3621 s_goto (OP_EVAL);
3866 3622
3867 case OP_LET0: /* let */ 3623 case OP_LET0: /* let */
3868 SCHEME_V->args = NIL; 3624 SCHEME_V->args = NIL;
3869 SCHEME_V->value = SCHEME_V->code; 3625 SCHEME_V->value = SCHEME_V->code;
3870 SCHEME_V->code = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code); 3626 SCHEME_V->code = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code);
3871 s_goto (OP_LET1); 3627 s_goto (OP_LET1);
3872 3628
3873 case OP_LET1: /* let (calculate parameters) */ 3629 case OP_LET1: /* let (calculate parameters) */
3874 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 3630 args = cons (SCHEME_V->value, args);
3875 3631
3876 if (is_pair (SCHEME_V->code)) /* continue */ 3632 if (is_pair (SCHEME_V->code)) /* continue */
3877 { 3633 {
3878 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code))) 3634 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code)))
3879 {
3880 Error_1 ("Bad syntax of binding spec in let :", car (SCHEME_V->code)); 3635 Error_1 ("Bad syntax of binding spec in let :", car (SCHEME_V->code));
3881 }
3882 3636
3883 s_save (SCHEME_A_ OP_LET1, SCHEME_V->args, cdr (SCHEME_V->code)); 3637 s_save (SCHEME_A_ OP_LET1, args, cdr (SCHEME_V->code));
3884 SCHEME_V->code = cadar (SCHEME_V->code); 3638 SCHEME_V->code = cadar (SCHEME_V->code);
3885 SCHEME_V->args = NIL; 3639 SCHEME_V->args = NIL;
3886 s_goto (OP_EVAL); 3640 s_goto (OP_EVAL);
3887 } 3641 }
3888 else /* end */ 3642 else /* end */
3889 { 3643 {
3890 SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); 3644 args = reverse_in_place (SCHEME_A_ NIL, args);
3891 SCHEME_V->code = car (SCHEME_V->args); 3645 SCHEME_V->code = car (args);
3892 SCHEME_V->args = cdr (SCHEME_V->args); 3646 SCHEME_V->args = cdr (args);
3893 s_goto (OP_LET2); 3647 s_goto (OP_LET2);
3894 } 3648 }
3895 3649
3896 case OP_LET2: /* let */ 3650 case OP_LET2: /* let */
3897 new_frame_in_env (SCHEME_A_ SCHEME_V->envir); 3651 new_frame_in_env (SCHEME_A_ SCHEME_V->envir);
3898 3652
3899 for (x = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code), y = SCHEME_V->args; 3653 for (x = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code), y = args;
3900 y != NIL; x = cdr (x), y = cdr (y)) 3654 y != NIL; x = cdr (x), y = cdr (y))
3901 {
3902 new_slot_in_env (SCHEME_A_ caar (x), car (y)); 3655 new_slot_in_env (SCHEME_A_ caar (x), car (y));
3903 }
3904 3656
3905 if (is_symbol (car (SCHEME_V->code))) /* named let */ 3657 if (is_symbol (car (SCHEME_V->code))) /* named let */
3906 { 3658 {
3907 for (x = cadr (SCHEME_V->code), SCHEME_V->args = NIL; x != NIL; x = cdr (x)) 3659 for (x = cadr (SCHEME_V->code), args = NIL; x != NIL; x = cdr (x))
3908 { 3660 {
3909 if (!is_pair (x)) 3661 if (!is_pair (x))
3910 Error_1 ("Bad syntax of binding in let :", x); 3662 Error_1 ("Bad syntax of binding in let :", x);
3911 3663
3912 if (!is_list (SCHEME_A_ car (x))) 3664 if (!is_list (SCHEME_A_ car (x)))
3913 Error_1 ("Bad syntax of binding in let :", car (x)); 3665 Error_1 ("Bad syntax of binding in let :", car (x));
3914 3666
3915 SCHEME_V->args = cons (caar (x), SCHEME_V->args); 3667 args = cons (caar (x), args);
3916 } 3668 }
3917 3669
3918 x =
3919 mk_closure (SCHEME_A_ cons (reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args), cddr (SCHEME_V->code)), 3670 x = mk_closure (SCHEME_A_ cons (reverse_in_place (SCHEME_A_ NIL, args), cddr (SCHEME_V->code)),
3920 SCHEME_V->envir); 3671 SCHEME_V->envir);
3921 new_slot_in_env (SCHEME_A_ car (SCHEME_V->code), x); 3672 new_slot_in_env (SCHEME_A_ car (SCHEME_V->code), x);
3922 SCHEME_V->code = cddr (SCHEME_V->code); 3673 SCHEME_V->code = cddr (SCHEME_V->code);
3923 SCHEME_V->args = NIL;
3924 } 3674 }
3925 else 3675 else
3926 { 3676 {
3927 SCHEME_V->code = cdr (SCHEME_V->code); 3677 SCHEME_V->code = cdr (SCHEME_V->code);
3678 }
3679
3928 SCHEME_V->args = NIL; 3680 SCHEME_V->args = NIL;
3929 }
3930
3931 s_goto (OP_BEGIN); 3681 s_goto (OP_BEGIN);
3932 3682
3933 case OP_LET0AST: /* let* */ 3683 case OP_LET0AST: /* let* */
3934 if (car (SCHEME_V->code) == NIL) 3684 if (car (SCHEME_V->code) == NIL)
3935 { 3685 {
… …
3953 new_slot_in_env (SCHEME_A_ caar (SCHEME_V->code), SCHEME_V->value); 3703 new_slot_in_env (SCHEME_A_ caar (SCHEME_V->code), SCHEME_V->value);
3954 SCHEME_V->code = cdr (SCHEME_V->code); 3704 SCHEME_V->code = cdr (SCHEME_V->code);
3955 3705
3956 if (is_pair (SCHEME_V->code)) /* continue */ 3706 if (is_pair (SCHEME_V->code)) /* continue */
3957 { 3707 {
3958 s_save (SCHEME_A_ OP_LET2AST, SCHEME_V->args, SCHEME_V->code); 3708 s_save (SCHEME_A_ OP_LET2AST, args, SCHEME_V->code);
3959 SCHEME_V->code = cadar (SCHEME_V->code); 3709 SCHEME_V->code = cadar (SCHEME_V->code);
3960 SCHEME_V->args = NIL; 3710 SCHEME_V->args = NIL;
3961 s_goto (OP_EVAL); 3711 s_goto (OP_EVAL);
3962 } 3712 }
3963 else /* end */ 3713 else /* end */
3964 { 3714 {
3965 SCHEME_V->code = SCHEME_V->args; 3715 SCHEME_V->code = args;
3966 SCHEME_V->args = NIL; 3716 SCHEME_V->args = NIL;
3967 s_goto (OP_BEGIN); 3717 s_goto (OP_BEGIN);
3968 } 3718 }
3969 3719
3970 case OP_LET0REC: /* letrec */ 3720 case OP_LET0REC: /* letrec */
… …
3973 SCHEME_V->value = SCHEME_V->code; 3723 SCHEME_V->value = SCHEME_V->code;
3974 SCHEME_V->code = car (SCHEME_V->code); 3724 SCHEME_V->code = car (SCHEME_V->code);
3975 s_goto (OP_LET1REC); 3725 s_goto (OP_LET1REC);
3976 3726
3977 case OP_LET1REC: /* letrec (calculate parameters) */ 3727 case OP_LET1REC: /* letrec (calculate parameters) */
3978 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 3728 args = cons (SCHEME_V->value, args);
3979 3729
3980 if (is_pair (SCHEME_V->code)) /* continue */ 3730 if (is_pair (SCHEME_V->code)) /* continue */
3981 { 3731 {
3982 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code))) 3732 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code)))
3983 {
3984 Error_1 ("Bad syntax of binding spec in letrec :", car (SCHEME_V->code)); 3733 Error_1 ("Bad syntax of binding spec in letrec :", car (SCHEME_V->code));
3985 }
3986 3734
3987 s_save (SCHEME_A_ OP_LET1REC, SCHEME_V->args, cdr (SCHEME_V->code)); 3735 s_save (SCHEME_A_ OP_LET1REC, args, cdr (SCHEME_V->code));
3988 SCHEME_V->code = cadar (SCHEME_V->code); 3736 SCHEME_V->code = cadar (SCHEME_V->code);
3989 SCHEME_V->args = NIL; 3737 SCHEME_V->args = NIL;
3990 s_goto (OP_EVAL); 3738 s_goto (OP_EVAL);
3991 } 3739 }
3992 else /* end */ 3740 else /* end */
3993 { 3741 {
3994 SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); 3742 args = reverse_in_place (SCHEME_A_ NIL, args);
3995 SCHEME_V->code = car (SCHEME_V->args); 3743 SCHEME_V->code = car (args);
3996 SCHEME_V->args = cdr (SCHEME_V->args); 3744 SCHEME_V->args = cdr (args);
3997 s_goto (OP_LET2REC); 3745 s_goto (OP_LET2REC);
3998 } 3746 }
3999 3747
4000 case OP_LET2REC: /* letrec */ 3748 case OP_LET2REC: /* letrec */
4001 for (x = car (SCHEME_V->code), y = SCHEME_V->args; y != NIL; x = cdr (x), y = cdr (y)) 3749 for (x = car (SCHEME_V->code), y = args; y != NIL; x = cdr (x), y = cdr (y))
4002 {
4003 new_slot_in_env (SCHEME_A_ caar (x), car (y)); 3750 new_slot_in_env (SCHEME_A_ caar (x), car (y));
4004 }
4005 3751
4006 SCHEME_V->code = cdr (SCHEME_V->code); 3752 SCHEME_V->code = cdr (SCHEME_V->code);
4007 SCHEME_V->args = NIL; 3753 SCHEME_V->args = NIL;
4008 s_goto (OP_BEGIN); 3754 s_goto (OP_BEGIN);
4009 3755
4010 case OP_COND0: /* cond */ 3756 case OP_COND0: /* cond */
4011 if (!is_pair (SCHEME_V->code)) 3757 if (!is_pair (SCHEME_V->code))
4012 {
4013 Error_0 ("syntax error in cond"); 3758 Error_0 ("syntax error in cond");
4014 }
4015 3759
4016 s_save (SCHEME_A_ OP_COND1, NIL, SCHEME_V->code); 3760 s_save (SCHEME_A_ OP_COND1, NIL, SCHEME_V->code);
4017 SCHEME_V->code = caar (SCHEME_V->code); 3761 SCHEME_V->code = caar (SCHEME_V->code);
4018 s_goto (OP_EVAL); 3762 s_goto (OP_EVAL);
4019 3763
4020 case OP_COND1: /* cond */ 3764 case OP_COND1: /* cond */
4021 if (is_true (SCHEME_V->value)) 3765 if (is_true (SCHEME_V->value))
4022 { 3766 {
4023 if ((SCHEME_V->code = cdar (SCHEME_V->code)) == NIL) 3767 if ((SCHEME_V->code = cdar (SCHEME_V->code)) == NIL)
4024 {
4025 s_return (SCHEME_V->value); 3768 s_return (SCHEME_V->value);
4026 }
4027 3769
4028 if (car (SCHEME_V->code) == SCHEME_V->FEED_TO) 3770 if (car (SCHEME_V->code) == SCHEME_V->FEED_TO)
4029 { 3771 {
4030 if (!is_pair (cdr (SCHEME_V->code))) 3772 if (!is_pair (cdr (SCHEME_V->code)))
4031 {
4032 Error_0 ("syntax error in cond"); 3773 Error_0 ("syntax error in cond");
4033 }
4034 3774
4035 x = cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL)); 3775 x = cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL));
4036 SCHEME_V->code = cons (cadr (SCHEME_V->code), cons (x, NIL)); 3776 SCHEME_V->code = cons (cadr (SCHEME_V->code), cons (x, NIL));
4037 s_goto (OP_EVAL); 3777 s_goto (OP_EVAL);
4038 } 3778 }
… …
4040 s_goto (OP_BEGIN); 3780 s_goto (OP_BEGIN);
4041 } 3781 }
4042 else 3782 else
4043 { 3783 {
4044 if ((SCHEME_V->code = cdr (SCHEME_V->code)) == NIL) 3784 if ((SCHEME_V->code = cdr (SCHEME_V->code)) == NIL)
4045 {
4046 s_return (NIL); 3785 s_return (NIL);
4047 }
4048 else 3786 else
4049 { 3787 {
4050 s_save (SCHEME_A_ OP_COND1, NIL, SCHEME_V->code); 3788 s_save (SCHEME_A_ OP_COND1, NIL, SCHEME_V->code);
4051 SCHEME_V->code = caar (SCHEME_V->code); 3789 SCHEME_V->code = caar (SCHEME_V->code);
4052 s_goto (OP_EVAL); 3790 s_goto (OP_EVAL);
… …
4058 set_typeflag (x, T_PROMISE); 3796 set_typeflag (x, T_PROMISE);
4059 s_return (x); 3797 s_return (x);
4060 3798
4061 case OP_AND0: /* and */ 3799 case OP_AND0: /* and */
4062 if (SCHEME_V->code == NIL) 3800 if (SCHEME_V->code == NIL)
4063 {
4064 s_return (S_T); 3801 s_return (S_T);
4065 }
4066 3802
4067 s_save (SCHEME_A_ OP_AND1, NIL, cdr (SCHEME_V->code)); 3803 s_save (SCHEME_A_ OP_AND1, NIL, cdr (SCHEME_V->code));
4068 SCHEME_V->code = car (SCHEME_V->code); 3804 SCHEME_V->code = car (SCHEME_V->code);
4069 s_goto (OP_EVAL); 3805 s_goto (OP_EVAL);
4070 3806
4071 case OP_AND1: /* and */ 3807 case OP_AND1: /* and */
4072 if (is_false (SCHEME_V->value)) 3808 if (is_false (SCHEME_V->value))
4073 {
4074 s_return (SCHEME_V->value); 3809 s_return (SCHEME_V->value);
4075 }
4076 else if (SCHEME_V->code == NIL) 3810 else if (SCHEME_V->code == NIL)
4077 {
4078 s_return (SCHEME_V->value); 3811 s_return (SCHEME_V->value);
4079 }
4080 else 3812 else
4081 { 3813 {
4082 s_save (SCHEME_A_ OP_AND1, NIL, cdr (SCHEME_V->code)); 3814 s_save (SCHEME_A_ OP_AND1, NIL, cdr (SCHEME_V->code));
4083 SCHEME_V->code = car (SCHEME_V->code); 3815 SCHEME_V->code = car (SCHEME_V->code);
4084 s_goto (OP_EVAL); 3816 s_goto (OP_EVAL);
4085 } 3817 }
4086 3818
4087 case OP_OR0: /* or */ 3819 case OP_OR0: /* or */
4088 if (SCHEME_V->code == NIL) 3820 if (SCHEME_V->code == NIL)
4089 {
4090 s_return (S_F); 3821 s_return (S_F);
4091 }
4092 3822
4093 s_save (SCHEME_A_ OP_OR1, NIL, cdr (SCHEME_V->code)); 3823 s_save (SCHEME_A_ OP_OR1, NIL, cdr (SCHEME_V->code));
4094 SCHEME_V->code = car (SCHEME_V->code); 3824 SCHEME_V->code = car (SCHEME_V->code);
4095 s_goto (OP_EVAL); 3825 s_goto (OP_EVAL);
4096 3826
4097 case OP_OR1: /* or */ 3827 case OP_OR1: /* or */
4098 if (is_true (SCHEME_V->value)) 3828 if (is_true (SCHEME_V->value))
4099 {
4100 s_return (SCHEME_V->value); 3829 s_return (SCHEME_V->value);
4101 }
4102 else if (SCHEME_V->code == NIL) 3830 else if (SCHEME_V->code == NIL)
4103 {
4104 s_return (SCHEME_V->value); 3831 s_return (SCHEME_V->value);
4105 }
4106 else 3832 else
4107 { 3833 {
4108 s_save (SCHEME_A_ OP_OR1, NIL, cdr (SCHEME_V->code)); 3834 s_save (SCHEME_A_ OP_OR1, NIL, cdr (SCHEME_V->code));
4109 SCHEME_V->code = car (SCHEME_V->code); 3835 SCHEME_V->code = car (SCHEME_V->code);
4110 s_goto (OP_EVAL); 3836 s_goto (OP_EVAL);
… …
4114 s_save (SCHEME_A_ OP_C1STREAM, NIL, cdr (SCHEME_V->code)); 3840 s_save (SCHEME_A_ OP_C1STREAM, NIL, cdr (SCHEME_V->code));
4115 SCHEME_V->code = car (SCHEME_V->code); 3841 SCHEME_V->code = car (SCHEME_V->code);
4116 s_goto (OP_EVAL); 3842 s_goto (OP_EVAL);
4117 3843
4118 case OP_C1STREAM: /* cons-stream */ 3844 case OP_C1STREAM: /* cons-stream */
4119 SCHEME_V->args = SCHEME_V->value; /* save SCHEME_V->value to register SCHEME_V->args for gc */ 3845 SCHEME_V->args = SCHEME_V->value; /* save SCHEME_V->value to register args for gc */
4120 x = mk_closure (SCHEME_A_ cons (NIL, SCHEME_V->code), SCHEME_V->envir); 3846 x = mk_closure (SCHEME_A_ cons (NIL, SCHEME_V->code), SCHEME_V->envir);
4121 set_typeflag (x, T_PROMISE); 3847 set_typeflag (x, T_PROMISE);
4122 s_return (cons (SCHEME_V->args, x)); 3848 s_return (cons (args, x));
4123 3849
4124 case OP_MACRO0: /* macro */ 3850 case OP_MACRO0: /* macro */
4125 if (is_pair (car (SCHEME_V->code))) 3851 if (is_pair (car (SCHEME_V->code)))
4126 { 3852 {
4127 x = caar (SCHEME_V->code); 3853 x = caar (SCHEME_V->code);
… …
4132 x = car (SCHEME_V->code); 3858 x = car (SCHEME_V->code);
4133 SCHEME_V->code = cadr (SCHEME_V->code); 3859 SCHEME_V->code = cadr (SCHEME_V->code);
4134 } 3860 }
4135 3861
4136 if (!is_symbol (x)) 3862 if (!is_symbol (x))
4137 {
4138 Error_0 ("variable is not a symbol"); 3863 Error_0 ("variable is not a symbol");
4139 }
4140 3864
4141 s_save (SCHEME_A_ OP_MACRO1, NIL, x); 3865 s_save (SCHEME_A_ OP_MACRO1, NIL, x);
4142 s_goto (OP_EVAL); 3866 s_goto (OP_EVAL);
4143 3867
4144 case OP_MACRO1: /* macro */ 3868 case OP_MACRO1: /* macro */
4145 set_typeflag (SCHEME_V->value, T_MACRO); 3869 set_typeflag (SCHEME_V->value, T_MACRO);
4146 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 0); 3870 x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 0);
4147 3871
4148 if (x != NIL) 3872 if (x != NIL)
4149 {
4150 set_slot_in_env (SCHEME_A_ x, SCHEME_V->value); 3873 set_slot_in_env (SCHEME_A_ x, SCHEME_V->value);
4151 }
4152 else 3874 else
4153 {
4154 new_slot_in_env (SCHEME_A_ SCHEME_V->code, SCHEME_V->value); 3875 new_slot_in_env (SCHEME_A_ SCHEME_V->code, SCHEME_V->value);
4155 }
4156 3876
4157 s_return (SCHEME_V->code); 3877 s_return (SCHEME_V->code);
4158 3878
4159 case OP_CASE0: /* case */ 3879 case OP_CASE0: /* case */
4160 s_save (SCHEME_A_ OP_CASE1, NIL, cdr (SCHEME_V->code)); 3880 s_save (SCHEME_A_ OP_CASE1, NIL, cdr (SCHEME_V->code));
… …
4163 3883
4164 case OP_CASE1: /* case */ 3884 case OP_CASE1: /* case */
4165 for (x = SCHEME_V->code; x != NIL; x = cdr (x)) 3885 for (x = SCHEME_V->code; x != NIL; x = cdr (x))
4166 { 3886 {
4167 if (!is_pair (y = caar (x))) 3887 if (!is_pair (y = caar (x)))
4168 {
4169 break; 3888 break;
4170 }
4171 3889
4172 for (; y != NIL; y = cdr (y)) 3890 for (; y != NIL; y = cdr (y))
4173 {
4174 if (eqv (car (y), SCHEME_V->value)) 3891 if (eqv (car (y), SCHEME_V->value))
4175 {
4176 break; 3892 break;
4177 }
4178 }
4179 3893
4180 if (y != NIL) 3894 if (y != NIL)
4181 {
4182 break; 3895 break;
4183 }
4184 } 3896 }
4185 3897
4186 if (x != NIL) 3898 if (x != NIL)
4187 { 3899 {
4188 if (is_pair (caar (x))) 3900 if (is_pair (caar (x)))
… …
4196 SCHEME_V->code = caar (x); 3908 SCHEME_V->code = caar (x);
4197 s_goto (OP_EVAL); 3909 s_goto (OP_EVAL);
4198 } 3910 }
4199 } 3911 }
4200 else 3912 else
4201 {
4202 s_return (NIL); 3913 s_return (NIL);
4203 }
4204 3914
4205 case OP_CASE2: /* case */ 3915 case OP_CASE2: /* case */
4206 if (is_true (SCHEME_V->value)) 3916 if (is_true (SCHEME_V->value))
4207 {
4208 s_goto (OP_BEGIN); 3917 s_goto (OP_BEGIN);
4209 }
4210 else 3918 else
4211 {
4212 s_return (NIL); 3919 s_return (NIL);
4213 }
4214 3920
4215 case OP_PAPPLY: /* apply */ 3921 case OP_PAPPLY: /* apply */
4216 SCHEME_V->code = car (SCHEME_V->args); 3922 SCHEME_V->code = car (args);
4217 SCHEME_V->args = list_star (SCHEME_A_ cdr (SCHEME_V->args)); 3923 SCHEME_V->args = list_star (SCHEME_A_ cdr (args));
4218 /*SCHEME_V->args = cadr(SCHEME_V->args); */ 3924 /*SCHEME_V->args = cadr(args); */
4219 s_goto (OP_APPLY); 3925 s_goto (OP_APPLY);
4220 3926
4221 case OP_PEVAL: /* eval */ 3927 case OP_PEVAL: /* eval */
4222 if (cdr (SCHEME_V->args) != NIL) 3928 if (cdr (args) != NIL)
4223 {
4224 SCHEME_V->envir = cadr (SCHEME_V->args); 3929 SCHEME_V->envir = cadr (args);
4225 }
4226 3930
4227 SCHEME_V->code = car (SCHEME_V->args); 3931 SCHEME_V->code = car (args);
4228 s_goto (OP_EVAL); 3932 s_goto (OP_EVAL);
4229 3933
4230 case OP_CONTINUATION: /* call-with-current-continuation */ 3934 case OP_CONTINUATION: /* call-with-current-continuation */
4231 SCHEME_V->code = car (SCHEME_V->args); 3935 SCHEME_V->code = car (args);
4232 SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_V)), NIL); 3936 SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL);
4233 s_goto (OP_APPLY); 3937 s_goto (OP_APPLY);
4234 } 3938 }
4235 3939
4236 return S_T; 3940 if (USE_ERROR_CHECKING) abort ();
4237} 3941}
4238 3942
4239static pointer 3943static int
4240opexe_2 (SCHEME_P_ enum scheme_opcodes op) 3944opexe_1 (SCHEME_P_ enum scheme_opcodes op)
4241{ 3945{
4242 pointer x; 3946 pointer args = SCHEME_V->args;
3947 pointer x = car (args);
4243 num v; 3948 num v;
4244 3949
3950 switch (op)
3951 {
4245#if USE_MATH 3952#if USE_MATH
4246 RVALUE dd;
4247#endif
4248
4249 switch (op)
4250 {
4251#if USE_MATH
4252
4253 case OP_INEX2EX: /* inexact->exact */ 3953 case OP_INEX2EX: /* inexact->exact */
4254 x = car (SCHEME_V->args);
4255
4256 if (num_is_integer (x))
4257 { 3954 {
3955 if (is_integer (x))
4258 s_return (x); 3956 s_return (x);
4259 } 3957
4260 else if (modf (rvalue_unchecked (x), &dd) == 0.0) 3958 RVALUE r = rvalue_unchecked (x);
4261 { 3959
3960 if (r == (RVALUE)(IVALUE)r)
4262 s_return (mk_integer (SCHEME_A_ ivalue (x))); 3961 s_return (mk_integer (SCHEME_A_ rvalue_unchecked (x)));
3962 else
3963 Error_1 ("inexact->exact: not integral:", x);
4263 } 3964 }
3965
3966 case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x))));
3967 case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x))));
3968 case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x))));
3969 case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x))));
3970 case OP_TAN: s_return (mk_real (SCHEME_A_ tan (rvalue (x))));
3971 case OP_ASIN: s_return (mk_real (SCHEME_A_ asin (rvalue (x))));
3972 case OP_ACOS: s_return (mk_real (SCHEME_A_ acos (rvalue (x))));
3973
3974 case OP_ATAN:
3975 if (cdr (args) == NIL)
3976 s_return (mk_real (SCHEME_A_ atan (rvalue (x))));
4264 else 3977 else
4265 { 3978 {
4266 Error_1 ("inexact->exact: not integral:", x);
4267 }
4268
4269 case OP_EXP:
4270 x = car (SCHEME_V->args);
4271 s_return (mk_real (SCHEME_A_ exp (rvalue (x))));
4272
4273 case OP_LOG:
4274 x = car (SCHEME_V->args);
4275 s_return (mk_real (SCHEME_A_ log (rvalue (x))));
4276
4277 case OP_SIN:
4278 x = car (SCHEME_V->args);
4279 s_return (mk_real (SCHEME_A_ sin (rvalue (x))));
4280
4281 case OP_COS:
4282 x = car (SCHEME_V->args);
4283 s_return (mk_real (SCHEME_A_ cos (rvalue (x))));
4284
4285 case OP_TAN:
4286 x = car (SCHEME_V->args);
4287 s_return (mk_real (SCHEME_A_ tan (rvalue (x))));
4288
4289 case OP_ASIN:
4290 x = car (SCHEME_V->args);
4291 s_return (mk_real (SCHEME_A_ asin (rvalue (x))));
4292
4293 case OP_ACOS:
4294 x = car (SCHEME_V->args);
4295 s_return (mk_real (SCHEME_A_ acos (rvalue (x))));
4296
4297 case OP_ATAN:
4298 x = car (SCHEME_V->args);
4299
4300 if (cdr (SCHEME_V->args) == NIL)
4301 {
4302 s_return (mk_real (SCHEME_A_ atan (rvalue (x))));
4303 }
4304 else
4305 {
4306 pointer y = cadr (SCHEME_V->args); 3979 pointer y = cadr (args);
4307
4308 s_return (mk_real (SCHEME_A_ atan2 (rvalue (x), rvalue (y)))); 3980 s_return (mk_real (SCHEME_A_ atan2 (rvalue (x), rvalue (y))));
4309 } 3981 }
4310 3982
4311 case OP_SQRT: 3983 case OP_SQRT:
4312 x = car (SCHEME_V->args);
4313 s_return (mk_real (SCHEME_A_ sqrt (rvalue (x)))); 3984 s_return (mk_real (SCHEME_A_ sqrt (rvalue (x))));
4314 3985
4315 case OP_EXPT: 3986 case OP_EXPT:
4316 { 3987 {
4317 RVALUE result; 3988 RVALUE result;
4318 int real_result = 1; 3989 int real_result = 1;
4319 pointer y = cadr (SCHEME_V->args); 3990 pointer y = cadr (args);
4320 3991
4321 x = car (SCHEME_V->args);
4322
4323 if (num_is_integer (x) && num_is_integer (y)) 3992 if (is_integer (x) && is_integer (y))
4324 real_result = 0; 3993 real_result = 0;
4325 3994
4326 /* This 'if' is an R5RS compatibility fix. */ 3995 /* This 'if' is an R5RS compatibility fix. */
4327 /* NOTE: Remove this 'if' fix for R6RS. */ 3996 /* NOTE: Remove this 'if' fix for R6RS. */
4328 if (rvalue (x) == 0 && rvalue (y) < 0) 3997 if (rvalue (x) == 0 && rvalue (y) < 0)
4329 {
4330 result = 0.0; 3998 result = 0;
4331 }
4332 else 3999 else
4333 {
4334 result = pow (rvalue (x), rvalue (y)); 4000 result = pow (rvalue (x), rvalue (y));
4335 }
4336 4001
4337 /* Before returning integer result make sure we can. */ 4002 /* Before returning integer result make sure we can. */
4338 /* If the test fails, result is too big for integer. */ 4003 /* If the test fails, result is too big for integer. */
4339 if (!real_result) 4004 if (!real_result)
4340 { 4005 {
4341 long result_as_long = (long) result; 4006 long result_as_long = result;
4342 4007
4343 if (result != (RVALUE) result_as_long) 4008 if (result != result_as_long)
4344 real_result = 1; 4009 real_result = 1;
4345 } 4010 }
4346 4011
4347 if (real_result) 4012 if (real_result)
4348 {
4349 s_return (mk_real (SCHEME_A_ result)); 4013 s_return (mk_real (SCHEME_A_ result));
4350 }
4351 else 4014 else
4352 {
4353 s_return (mk_integer (SCHEME_A_ result)); 4015 s_return (mk_integer (SCHEME_A_ result));
4354 }
4355 } 4016 }
4356 4017
4357 case OP_FLOOR:
4358 x = car (SCHEME_V->args);
4359 s_return (mk_real (SCHEME_A_ floor (rvalue (x)))); 4018 case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x))));
4360
4361 case OP_CEILING:
4362 x = car (SCHEME_V->args);
4363 s_return (mk_real (SCHEME_A_ ceil (rvalue (x)))); 4019 case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x))));
4364 4020
4365 case OP_TRUNCATE: 4021 case OP_TRUNCATE:
4366 { 4022 {
4367 RVALUE rvalue_of_x; 4023 RVALUE n = rvalue (x);
4368
4369 x = car (SCHEME_V->args);
4370 rvalue_of_x = rvalue (x);
4371
4372 if (rvalue_of_x > 0)
4373 {
4374 s_return (mk_real (SCHEME_A_ floor (rvalue_of_x))); 4024 s_return (mk_real (SCHEME_A_ n > 0 ? floor (n) : ceil (n)));
4375 }
4376 else
4377 {
4378 s_return (mk_real (SCHEME_A_ ceil (rvalue_of_x)));
4379 }
4380 } 4025 }
4381 4026
4382 case OP_ROUND: 4027 case OP_ROUND:
4383 x = car (SCHEME_V->args);
4384
4385 if (num_is_integer (x)) 4028 if (is_integer (x))
4386 s_return (x); 4029 s_return (x);
4387 4030
4388 s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x)))); 4031 s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x))));
4389#endif 4032#endif
4390 4033
4391 case OP_ADD: /* + */ 4034 case OP_ADD: /* + */
4392 v = num_zero; 4035 v = num_zero;
4393 4036
4394 for (x = SCHEME_V->args; x != NIL; x = cdr (x)) 4037 for (x = args; x != NIL; x = cdr (x))
4395 v = num_add (v, nvalue (car (x))); 4038 v = num_op (NUM_ADD, v, nvalue (car (x)));
4396 4039
4397 s_return (mk_number (SCHEME_A_ v)); 4040 s_return (mk_number (SCHEME_A_ v));
4398 4041
4399 case OP_MUL: /* * */ 4042 case OP_MUL: /* * */
4400 v = num_one; 4043 v = num_one;
4401 4044
4402 for (x = SCHEME_V->args; x != NIL; x = cdr (x)) 4045 for (x = args; x != NIL; x = cdr (x))
4403 v = num_mul (v, nvalue (car (x))); 4046 v = num_op (NUM_MUL, v, nvalue (car (x)));
4404 4047
4405 s_return (mk_number (SCHEME_A_ v)); 4048 s_return (mk_number (SCHEME_A_ v));
4406 4049
4407 case OP_SUB: /* - */ 4050 case OP_SUB: /* - */
4408 if (cdr (SCHEME_V->args) == NIL) 4051 if (cdr (args) == NIL)
4409 { 4052 {
4410 x = SCHEME_V->args; 4053 x = args;
4411 v = num_zero; 4054 v = num_zero;
4412 } 4055 }
4413 else 4056 else
4414 { 4057 {
4415 x = cdr (SCHEME_V->args); 4058 x = cdr (args);
4416 v = nvalue (car (SCHEME_V->args)); 4059 v = nvalue (car (args));
4417 } 4060 }
4418 4061
4419 for (; x != NIL; x = cdr (x)) 4062 for (; x != NIL; x = cdr (x))
4420 v = num_sub (v, nvalue (car (x))); 4063 v = num_op (NUM_SUB, v, nvalue (car (x)));
4421 4064
4422 s_return (mk_number (SCHEME_A_ v)); 4065 s_return (mk_number (SCHEME_A_ v));
4423 4066
4424 case OP_DIV: /* / */ 4067 case OP_DIV: /* / */
4425 if (cdr (SCHEME_V->args) == NIL) 4068 if (cdr (args) == NIL)
4426 { 4069 {
4427 x = SCHEME_V->args; 4070 x = args;
4428 v = num_one; 4071 v = num_one;
4429 } 4072 }
4430 else 4073 else
4431 { 4074 {
4432 x = cdr (SCHEME_V->args); 4075 x = cdr (args);
4433 v = nvalue (car (SCHEME_V->args)); 4076 v = nvalue (car (args));
4434 } 4077 }
4435 4078
4436 for (; x != NIL; x = cdr (x)) 4079 for (; x != NIL; x = cdr (x))
4437 {
4438 if (!is_zero_rvalue (rvalue (car (x)))) 4080 if (!is_zero_rvalue (rvalue (car (x))))
4439 v = num_div (v, nvalue (car (x))); 4081 v = num_div (v, nvalue (car (x)));
4440 else 4082 else
4441 Error_0 ("/: division by zero"); 4083 Error_0 ("/: division by zero");
4442 }
4443 4084
4444 s_return (mk_number (SCHEME_A_ v)); 4085 s_return (mk_number (SCHEME_A_ v));
4445 4086
4446 case OP_INTDIV: /* quotient */ 4087 case OP_INTDIV: /* quotient */
4447 if (cdr (SCHEME_V->args) == NIL) 4088 if (cdr (args) == NIL)
4448 { 4089 {
4449 x = SCHEME_V->args; 4090 x = args;
4450 v = num_one; 4091 v = num_one;
4451 } 4092 }
4452 else 4093 else
4453 { 4094 {
4454 x = cdr (SCHEME_V->args); 4095 x = cdr (args);
4455 v = nvalue (car (SCHEME_V->args)); 4096 v = nvalue (car (args));
4456 } 4097 }
4457 4098
4458 for (; x != NIL; x = cdr (x)) 4099 for (; x != NIL; x = cdr (x))
4459 { 4100 {
4460 if (ivalue (car (x)) != 0) 4101 if (ivalue (car (x)) != 0)
4461 v = num_intdiv (v, nvalue (car (x))); 4102 v = num_op (NUM_INTDIV, v, nvalue (car (x)));
4462 else 4103 else
4463 Error_0 ("quotient: division by zero"); 4104 Error_0 ("quotient: division by zero");
4464 } 4105 }
4465 4106
4466 s_return (mk_number (SCHEME_A_ v)); 4107 s_return (mk_number (SCHEME_A_ v));
4467 4108
4468 case OP_REM: /* remainder */ 4109 case OP_REM: /* remainder */
4469 v = nvalue (car (SCHEME_V->args)); 4110 v = nvalue (x);
4470 4111
4471 if (ivalue (cadr (SCHEME_V->args)) != 0) 4112 if (ivalue (cadr (args)) != 0)
4472 v = num_rem (v, nvalue (cadr (SCHEME_V->args))); 4113 v = num_rem (v, nvalue (cadr (args)));
4473 else 4114 else
4474 Error_0 ("remainder: division by zero"); 4115 Error_0 ("remainder: division by zero");
4475 4116
4476 s_return (mk_number (SCHEME_A_ v)); 4117 s_return (mk_number (SCHEME_A_ v));
4477 4118
4478 case OP_MOD: /* modulo */ 4119 case OP_MOD: /* modulo */
4479 v = nvalue (car (SCHEME_V->args)); 4120 v = nvalue (x);
4480 4121
4481 if (ivalue (cadr (SCHEME_V->args)) != 0) 4122 if (ivalue (cadr (args)) != 0)
4482 v = num_mod (v, nvalue (cadr (SCHEME_V->args))); 4123 v = num_mod (v, nvalue (cadr (args)));
4483 else 4124 else
4484 Error_0 ("modulo: division by zero"); 4125 Error_0 ("modulo: division by zero");
4485 4126
4486 s_return (mk_number (SCHEME_A_ v)); 4127 s_return (mk_number (SCHEME_A_ v));
4487 4128
4488 case OP_CAR: /* car */ 4129 case OP_CAR: /* car */
4489 s_return (caar (SCHEME_V->args)); 4130 s_return (caar (args));
4490 4131
4491 case OP_CDR: /* cdr */ 4132 case OP_CDR: /* cdr */
4492 s_return (cdar (SCHEME_V->args)); 4133 s_return (cdar (args));
4493 4134
4494 case OP_CONS: /* cons */ 4135 case OP_CONS: /* cons */
4495 set_cdr (SCHEME_V->args, cadr (SCHEME_V->args)); 4136 set_cdr (args, cadr (args));
4496 s_return (SCHEME_V->args); 4137 s_return (args);
4497 4138
4498 case OP_SETCAR: /* set-car! */ 4139 case OP_SETCAR: /* set-car! */
4499 if (!is_immutable (car (SCHEME_V->args))) 4140 if (!is_immutable (x))
4500 { 4141 {
4501 set_car (car (SCHEME_V->args), cadr (SCHEME_V->args)); 4142 set_car (x, cadr (args));
4502 s_return (car (SCHEME_V->args)); 4143 s_return (car (args));
4503 } 4144 }
4504 else 4145 else
4505 Error_0 ("set-car!: unable to alter immutable pair"); 4146 Error_0 ("set-car!: unable to alter immutable pair");
4506 4147
4507 case OP_SETCDR: /* set-cdr! */ 4148 case OP_SETCDR: /* set-cdr! */
4508 if (!is_immutable (car (SCHEME_V->args))) 4149 if (!is_immutable (x))
4509 { 4150 {
4510 set_cdr (car (SCHEME_V->args), cadr (SCHEME_V->args)); 4151 set_cdr (x, cadr (args));
4511 s_return (car (SCHEME_V->args)); 4152 s_return (car (args));
4512 } 4153 }
4513 else 4154 else
4514 Error_0 ("set-cdr!: unable to alter immutable pair"); 4155 Error_0 ("set-cdr!: unable to alter immutable pair");
4515 4156
4516 case OP_CHAR2INT: /* char->integer */ 4157 case OP_CHAR2INT: /* char->integer */
4517 {
4518 char c;
4519
4520 c = (char) ivalue (car (SCHEME_V->args));
4521 s_return (mk_integer (SCHEME_A_ (unsigned char) c)); 4158 s_return (mk_integer (SCHEME_A_ ivalue_unchecked (x)));
4522 }
4523 4159
4524 case OP_INT2CHAR: /* integer->char */ 4160 case OP_INT2CHAR: /* integer->char */
4525 {
4526 unsigned char c;
4527
4528 c = (unsigned char) ivalue (car (SCHEME_V->args));
4529 s_return (mk_character (SCHEME_A_ (char) c)); 4161 s_return (mk_character (SCHEME_A_ ivalue_unchecked (x)));
4530 }
4531 4162
4532 case OP_CHARUPCASE: 4163 case OP_CHARUPCASE:
4533 { 4164 {
4534 unsigned char c; 4165 unsigned char c = ivalue_unchecked (x);
4535
4536 c = (unsigned char) ivalue (car (SCHEME_V->args));
4537 c = toupper (c); 4166 c = toupper (c);
4538 s_return (mk_character (SCHEME_A_ (char) c)); 4167 s_return (mk_character (SCHEME_A_ c));
4539 } 4168 }
4540 4169
4541 case OP_CHARDNCASE: 4170 case OP_CHARDNCASE:
4542 { 4171 {
4543 unsigned char c; 4172 unsigned char c = ivalue_unchecked (x);
4544
4545 c = (unsigned char) ivalue (car (SCHEME_V->args));
4546 c = tolower (c); 4173 c = tolower (c);
4547 s_return (mk_character (SCHEME_A_ (char) c)); 4174 s_return (mk_character (SCHEME_A_ c));
4548 } 4175 }
4549 4176
4550 case OP_STR2SYM: /* string->symbol */ 4177 case OP_STR2SYM: /* string->symbol */
4551 s_return (mk_symbol (SCHEME_A_ strvalue (car (SCHEME_V->args)))); 4178 s_return (mk_symbol (SCHEME_A_ strvalue (x)));
4552 4179
4553 case OP_STR2ATOM: /* string->atom */ 4180 case OP_STR2ATOM: /* string->atom */
4554 { 4181 {
4555 char *s = strvalue (car (SCHEME_V->args)); 4182 char *s = strvalue (x);
4556 long pf = 0; 4183 long pf = 0;
4557 4184
4558 if (cdr (SCHEME_V->args) != NIL) 4185 if (cdr (args) != NIL)
4559 { 4186 {
4560 /* we know cadr(SCHEME_V->args) is a natural number */ 4187 /* we know cadr(args) is a natural number */
4561 /* see if it is 2, 8, 10, or 16, or error */ 4188 /* see if it is 2, 8, 10, or 16, or error */
4562 pf = ivalue_unchecked (cadr (SCHEME_V->args)); 4189 pf = ivalue_unchecked (cadr (args));
4563 4190
4564 if (pf == 16 || pf == 10 || pf == 8 || pf == 2) 4191 if (pf == 16 || pf == 10 || pf == 8 || pf == 2)
4565 { 4192 {
4566 /* base is OK */ 4193 /* base is OK */
4567 } 4194 }
4568 else 4195 else
4569 {
4570 pf = -1; 4196 pf = -1;
4571 }
4572 } 4197 }
4573 4198
4574 if (pf < 0) 4199 if (pf < 0)
4575 {
4576 Error_1 ("string->atom: bad base:", cadr (SCHEME_V->args)); 4200 Error_1 ("string->atom: bad base:", cadr (args));
4577 }
4578 else if (*s == '#') /* no use of base! */ 4201 else if (*s == '#') /* no use of base! */
4579 {
4580 s_return (mk_sharp_const (SCHEME_A_ s + 1)); 4202 s_return (mk_sharp_const (SCHEME_A_ s + 1));
4581 }
4582 else 4203 else
4583 { 4204 {
4584 if (pf == 0 || pf == 10) 4205 if (pf == 0 || pf == 10)
4585 {
4586 s_return (mk_atom (SCHEME_A_ s)); 4206 s_return (mk_atom (SCHEME_A_ s));
4587 }
4588 else 4207 else
4589 { 4208 {
4590 char *ep; 4209 char *ep;
4591 long iv = strtol (s, &ep, (int) pf); 4210 long iv = strtol (s, &ep, (int) pf);
4592 4211
4593 if (*ep == 0) 4212 if (*ep == 0)
4594 {
4595 s_return (mk_integer (SCHEME_A_ iv)); 4213 s_return (mk_integer (SCHEME_A_ iv));
4596 }
4597 else 4214 else
4598 {
4599 s_return (S_F); 4215 s_return (S_F);
4600 }
4601 } 4216 }
4602 } 4217 }
4603 } 4218 }
4604 4219
4605 case OP_SYM2STR: /* symbol->string */ 4220 case OP_SYM2STR: /* symbol->string */
4606 x = mk_string (SCHEME_A_ symname (car (SCHEME_V->args))); 4221 x = mk_string (SCHEME_A_ symname (x));
4607 setimmutable (x); 4222 setimmutable (x);
4608 s_return (x); 4223 s_return (x);
4609 4224
4610 case OP_ATOM2STR: /* atom->string */ 4225 case OP_ATOM2STR: /* atom->string */
4611 { 4226 {
4612 long pf = 0; 4227 long pf = 0;
4613 4228
4614 x = car (SCHEME_V->args);
4615
4616 if (cdr (SCHEME_V->args) != NIL) 4229 if (cdr (args) != NIL)
4617 { 4230 {
4618 /* we know cadr(SCHEME_V->args) is a natural number */ 4231 /* we know cadr(args) is a natural number */
4619 /* see if it is 2, 8, 10, or 16, or error */ 4232 /* see if it is 2, 8, 10, or 16, or error */
4620 pf = ivalue_unchecked (cadr (SCHEME_V->args)); 4233 pf = ivalue_unchecked (cadr (args));
4621 4234
4622 if (is_number (x) && (pf == 16 || pf == 10 || pf == 8 || pf == 2)) 4235 if (is_number (x) && (pf == 16 || pf == 10 || pf == 8 || pf == 2))
4623 { 4236 {
4624 /* base is OK */ 4237 /* base is OK */
4625 } 4238 }
4626 else 4239 else
4627 {
4628 pf = -1; 4240 pf = -1;
4629 }
4630 } 4241 }
4631 4242
4632 if (pf < 0) 4243 if (pf < 0)
4633 {
4634 Error_1 ("atom->string: bad base:", cadr (SCHEME_V->args)); 4244 Error_1 ("atom->string: bad base:", cadr (args));
4635 }
4636 else if (is_number (x) || is_character (x) || is_string (x) || is_symbol (x)) 4245 else if (is_number (x) || is_character (x) || is_string (x) || is_symbol (x))
4637 { 4246 {
4638 char *p; 4247 char *p;
4639 int len; 4248 int len;
4640 4249
4641 atom2str (SCHEME_A_ x, (int) pf, &p, &len); 4250 atom2str (SCHEME_A_ x, pf, &p, &len);
4642 s_return (mk_counted_string (SCHEME_A_ p, len)); 4251 s_return (mk_counted_string (SCHEME_A_ p, len));
4643 } 4252 }
4644 else 4253 else
4645 {
4646 Error_1 ("atom->string: not an atom:", x); 4254 Error_1 ("atom->string: not an atom:", x);
4647 }
4648 } 4255 }
4649 4256
4650 case OP_MKSTRING: /* make-string */ 4257 case OP_MKSTRING: /* make-string */
4651 { 4258 {
4652 int fill = ' '; 4259 int fill = cdr (args) != NIL ? charvalue (cadr (args)) : ' ';
4653 int len; 4260 int len = ivalue_unchecked (x);
4654 4261
4655 len = ivalue (car (SCHEME_V->args));
4656
4657 if (cdr (SCHEME_V->args) != NIL)
4658 {
4659 fill = charvalue (cadr (SCHEME_V->args));
4660 }
4661
4662 s_return (mk_empty_string (SCHEME_A_ len, (char) fill)); 4262 s_return (mk_empty_string (SCHEME_A_ len, fill));
4663 } 4263 }
4664 4264
4665 case OP_STRLEN: /* string-length */ 4265 case OP_STRLEN: /* string-length */
4666 s_return (mk_integer (SCHEME_A_ strlength (car (SCHEME_V->args)))); 4266 s_return (mk_integer (SCHEME_A_ strlength (x)));
4667 4267
4668 case OP_STRREF: /* string-ref */ 4268 case OP_STRREF: /* string-ref */
4669 { 4269 {
4670 char *str; 4270 char *str = strvalue (x);
4671 int index;
4672
4673 str = strvalue (car (SCHEME_V->args));
4674
4675 index = ivalue (cadr (SCHEME_V->args)); 4271 int index = ivalue_unchecked (cadr (args));
4676 4272
4677 if (index >= strlength (car (SCHEME_V->args))) 4273 if (index >= strlength (x))
4678 {
4679 Error_1 ("string-ref: out of bounds:", cadr (SCHEME_V->args)); 4274 Error_1 ("string-ref: out of bounds:", cadr (args));
4680 }
4681 4275
4682 s_return (mk_character (SCHEME_A_ ((unsigned char *) str)[index])); 4276 s_return (mk_character (SCHEME_A_ ((unsigned char *)str)[index]));
4683 } 4277 }
4684 4278
4685 case OP_STRSET: /* string-set! */ 4279 case OP_STRSET: /* string-set! */
4686 { 4280 {
4687 char *str; 4281 char *str = strvalue (x);
4688 int index; 4282 int index = ivalue_unchecked (cadr (args));
4689 int c; 4283 int c;
4690 4284
4691 if (is_immutable (car (SCHEME_V->args))) 4285 if (is_immutable (x))
4692 {
4693 Error_1 ("string-set!: unable to alter immutable string:", car (SCHEME_V->args)); 4286 Error_1 ("string-set!: unable to alter immutable string:", x);
4694 }
4695 4287
4696 str = strvalue (car (SCHEME_V->args));
4697
4698 index = ivalue (cadr (SCHEME_V->args));
4699
4700 if (index >= strlength (car (SCHEME_V->args))) 4288 if (index >= strlength (x))
4701 {
4702 Error_1 ("string-set!: out of bounds:", cadr (SCHEME_V->args)); 4289 Error_1 ("string-set!: out of bounds:", cadr (args));
4703 }
4704 4290
4705 c = charvalue (caddr (SCHEME_V->args)); 4291 c = charvalue (caddr (args));
4706 4292
4707 str[index] = (char) c; 4293 str[index] = c;
4708 s_return (car (SCHEME_V->args)); 4294 s_return (car (args));
4709 } 4295 }
4710 4296
4711 case OP_STRAPPEND: /* string-append */ 4297 case OP_STRAPPEND: /* string-append */
4712 { 4298 {
4713 /* in 1.29 string-append was in Scheme in init.scm but was too slow */ 4299 /* in 1.29 string-append was in Scheme in init.scm but was too slow */
4714 int len = 0; 4300 int len = 0;
4715 pointer newstr; 4301 pointer newstr;
4716 char *pos; 4302 char *pos;
4717 4303
4718 /* compute needed length for new string */ 4304 /* compute needed length for new string */
4719 for (x = SCHEME_V->args; x != NIL; x = cdr (x)) 4305 for (x = args; x != NIL; x = cdr (x))
4720 {
4721 len += strlength (car (x)); 4306 len += strlength (car (x));
4722 }
4723 4307
4724 newstr = mk_empty_string (SCHEME_A_ len, ' '); 4308 newstr = mk_empty_string (SCHEME_A_ len, ' ');
4725 4309
4726 /* store the contents of the argument strings into the new string */ 4310 /* store the contents of the argument strings into the new string */
4727 for (pos = strvalue (newstr), x = SCHEME_V->args; x != NIL; pos += strlength (car (x)), x = cdr (x)) 4311 for (pos = strvalue (newstr), x = args; x != NIL; pos += strlength (car (x)), x = cdr (x))
4728 {
4729 memcpy (pos, strvalue (car (x)), strlength (car (x))); 4312 memcpy (pos, strvalue (car (x)), strlength (car (x)));
4730 }
4731 4313
4732 s_return (newstr); 4314 s_return (newstr);
4733 } 4315 }
4734 4316
4735 case OP_SUBSTR: /* substring */ 4317 case OP_SUBSTR: /* substring */
4736 { 4318 {
4737 char *str; 4319 char *str = strvalue (x);
4738 int index0; 4320 int index0 = ivalue_unchecked (cadr (args));
4739 int index1; 4321 int index1;
4740 int len; 4322 int len;
4741 4323
4742 str = strvalue (car (SCHEME_V->args));
4743
4744 index0 = ivalue (cadr (SCHEME_V->args));
4745
4746 if (index0 > strlength (car (SCHEME_V->args))) 4324 if (index0 > strlength (x))
4325 Error_1 ("substring: start out of bounds:", cadr (args));
4326
4327 if (cddr (args) != NIL)
4747 { 4328 {
4748 Error_1 ("substring: start out of bounds:", cadr (SCHEME_V->args));
4749 }
4750
4751 if (cddr (SCHEME_V->args) != NIL)
4752 {
4753 index1 = ivalue (caddr (SCHEME_V->args)); 4329 index1 = ivalue_unchecked (caddr (args));
4754 4330
4755 if (index1 > strlength (car (SCHEME_V->args)) || index1 < index0) 4331 if (index1 > strlength (x) || index1 < index0)
4756 {
4757 Error_1 ("substring: end out of bounds:", caddr (SCHEME_V->args)); 4332 Error_1 ("substring: end out of bounds:", caddr (args));
4758 }
4759 } 4333 }
4760 else 4334 else
4761 { 4335 index1 = strlength (x);
4762 index1 = strlength (car (SCHEME_V->args));
4763 }
4764 4336
4765 len = index1 - index0; 4337 len = index1 - index0;
4766 x = mk_empty_string (SCHEME_A_ len, ' '); 4338 x = mk_empty_string (SCHEME_A_ len, ' ');
4767 memcpy (strvalue (x), str + index0, len); 4339 memcpy (strvalue (x), str + index0, len);
4768 strvalue (x)[len] = 0; 4340 strvalue (x)[len] = 0;
… …
4772 4344
4773 case OP_VECTOR: /* vector */ 4345 case OP_VECTOR: /* vector */
4774 { 4346 {
4775 int i; 4347 int i;
4776 pointer vec; 4348 pointer vec;
4777 int len = list_length (SCHEME_A_ SCHEME_V->args); 4349 int len = list_length (SCHEME_A_ args);
4778 4350
4779 if (len < 0) 4351 if (len < 0)
4780 {
4781 Error_1 ("vector: not a proper list:", SCHEME_V->args); 4352 Error_1 ("vector: not a proper list:", args);
4782 }
4783 4353
4784 vec = mk_vector (SCHEME_A_ len); 4354 vec = mk_vector (SCHEME_A_ len);
4785 4355
4786#if USE_ERROR_CHECKING 4356#if USE_ERROR_CHECKING
4787 if (SCHEME_V->no_memory) 4357 if (SCHEME_V->no_memory)
4788 s_return (S_SINK); 4358 s_return (S_SINK);
4789#endif 4359#endif
4790 4360
4791 for (x = SCHEME_V->args, i = 0; is_pair (x); x = cdr (x), i++) 4361 for (x = args, i = 0; is_pair (x); x = cdr (x), i++)
4792 set_vector_elem (vec, i, car (x)); 4362 vector_set (vec, i, car (x));
4793 4363
4794 s_return (vec); 4364 s_return (vec);
4795 } 4365 }
4796 4366
4797 case OP_MKVECTOR: /* make-vector */ 4367 case OP_MKVECTOR: /* make-vector */
4798 { 4368 {
4799 pointer fill = NIL; 4369 pointer fill = NIL;
4800 int len;
4801 pointer vec; 4370 pointer vec;
4371 int len = ivalue_unchecked (x);
4802 4372
4803 len = ivalue (car (SCHEME_V->args));
4804
4805 if (cdr (SCHEME_V->args) != NIL) 4373 if (cdr (args) != NIL)
4806 fill = cadr (SCHEME_V->args); 4374 fill = cadr (args);
4807 4375
4808 vec = mk_vector (SCHEME_A_ len); 4376 vec = mk_vector (SCHEME_A_ len);
4809 4377
4810#if USE_ERROR_CHECKING 4378#if USE_ERROR_CHECKING
4811 if (SCHEME_V->no_memory) 4379 if (SCHEME_V->no_memory)
4812 s_return (S_SINK); 4380 s_return (S_SINK);
4813#endif 4381#endif
4814 4382
4815 if (fill != NIL) 4383 if (fill != NIL)
4816 fill_vector (vec, fill); 4384 fill_vector (vec, 0, fill);
4817 4385
4818 s_return (vec); 4386 s_return (vec);
4819 } 4387 }
4820 4388
4821 case OP_VECLEN: /* vector-length */ 4389 case OP_VECLEN: /* vector-length */
4822 s_return (mk_integer (SCHEME_A_ ivalue (car (SCHEME_V->args)))); 4390 s_return (mk_integer (SCHEME_A_ veclength (x)));
4391
4392 case OP_VECRESIZE:
4393 vector_resize (x, ivalue_unchecked (cadr (args)), caddr (args));
4394 s_return (x);
4823 4395
4824 case OP_VECREF: /* vector-ref */ 4396 case OP_VECREF: /* vector-ref */
4825 { 4397 {
4826 int index;
4827
4828 index = ivalue (cadr (SCHEME_V->args)); 4398 int index = ivalue_unchecked (cadr (args));
4829 4399
4830 if (index >= ivalue (car (SCHEME_V->args))) 4400 if (index >= veclength (car (args)) && USE_ERROR_CHECKING)
4831 {
4832 Error_1 ("vector-ref: out of bounds:", cadr (SCHEME_V->args)); 4401 Error_1 ("vector-ref: out of bounds:", cadr (args));
4833 }
4834 4402
4835 s_return (vector_elem (car (SCHEME_V->args), index)); 4403 s_return (vector_get (x, index));
4836 } 4404 }
4837 4405
4838 case OP_VECSET: /* vector-set! */ 4406 case OP_VECSET: /* vector-set! */
4839 { 4407 {
4840 int index; 4408 int index = ivalue_unchecked (cadr (args));
4841 4409
4842 if (is_immutable (car (SCHEME_V->args))) 4410 if (is_immutable (x))
4843 {
4844 Error_1 ("vector-set!: unable to alter immutable vector:", car (SCHEME_V->args)); 4411 Error_1 ("vector-set!: unable to alter immutable vector:", x);
4845 }
4846 4412
4847 index = ivalue (cadr (SCHEME_V->args)); 4413 if (index >= veclength (car (args)) && USE_ERROR_CHECKING)
4848
4849 if (index >= ivalue (car (SCHEME_V->args)))
4850 {
4851 Error_1 ("vector-set!: out of bounds:", cadr (SCHEME_V->args)); 4414 Error_1 ("vector-set!: out of bounds:", cadr (args));
4852 }
4853 4415
4854 set_vector_elem (car (SCHEME_V->args), index, caddr (SCHEME_V->args)); 4416 vector_set (x, index, caddr (args));
4855 s_return (car (SCHEME_V->args)); 4417 s_return (x);
4856 } 4418 }
4857 } 4419 }
4858 4420
4859 return S_T; 4421 if (USE_ERROR_CHECKING) abort ();
4860} 4422}
4861 4423
4862INTERFACE int 4424static int
4863is_list (SCHEME_P_ pointer a) 4425opexe_2 (SCHEME_P_ enum scheme_opcodes op)
4864{ 4426{
4865 return list_length (SCHEME_A_ a) >= 0; 4427 pointer x = SCHEME_V->args;
4866}
4867 4428
4868/* Result is: 4429 for (;;)
4869 proper list: length
4870 circular list: -1
4871 not even a pair: -2
4872 dotted list: -2 minus length before dot
4873*/
4874INTERFACE int
4875list_length (SCHEME_P_ pointer a)
4876{
4877 int i = 0;
4878 pointer slow, fast;
4879
4880 slow = fast = a;
4881
4882 while (1)
4883 { 4430 {
4431 num v = nvalue (car (x));
4432 x = cdr (x);
4433
4884 if (fast == NIL) 4434 if (x == NIL)
4885 return i; 4435 break;
4886 4436
4887 if (!is_pair (fast)) 4437 int r = num_cmp (v, nvalue (car (x)));
4888 return -2 - i;
4889 4438
4890 fast = cdr (fast); 4439 switch (op)
4891 ++i;
4892
4893 if (fast == NIL)
4894 return i;
4895
4896 if (!is_pair (fast))
4897 return -2 - i;
4898
4899 ++i;
4900 fast = cdr (fast);
4901
4902 /* Safe because we would have already returned if `fast'
4903 encountered a non-pair. */
4904 slow = cdr (slow);
4905
4906 if (fast == slow)
4907 { 4440 {
4908 /* the fast pointer has looped back around and caught up 4441 case OP_NUMEQ: r = r == 0; break;
4909 with the slow pointer, hence the structure is circular, 4442 case OP_LESS: r = r < 0; break;
4910 not of finite length, and therefore not a list */ 4443 case OP_GRE: r = r > 0; break;
4911 return -1; 4444 case OP_LEQ: r = r <= 0; break;
4445 case OP_GEQ: r = r >= 0; break;
4912 } 4446 }
4913 }
4914}
4915 4447
4448 if (!r)
4449 s_return (S_F);
4450 }
4451
4452 s_return (S_T);
4453}
4454
4916static pointer 4455static int
4917opexe_3 (SCHEME_P_ enum scheme_opcodes op) 4456opexe_3 (SCHEME_P_ enum scheme_opcodes op)
4918{ 4457{
4919 pointer x; 4458 pointer args = SCHEME_V->args;
4920 num v; 4459 pointer a = car (args);
4921 int (*comp_func) (num, num); 4460 pointer d = cdr (args);
4461 int r;
4922 4462
4923 switch (op) 4463 switch (op)
4924 { 4464 {
4925 case OP_NOT: /* not */ 4465 case OP_NOT: /* not */ r = is_false (a) ; break;
4926 s_retbool (is_false (car (SCHEME_V->args))); 4466 case OP_BOOLP: /* boolean? */ r = a == S_F || a == S_T; break;
4467 case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break;
4468 case OP_NULLP: /* null? */ r = a == NIL ; break;
4469 case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break;
4470 case OP_NUMBERP: /* number? */ r = is_number (a) ; break;
4471 case OP_STRINGP: /* string? */ r = is_string (a) ; break;
4472 case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break;
4473 case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */
4474 case OP_CHARP: /* char? */ r = is_character (a) ; break;
4927 4475
4928 case OP_BOOLP: /* boolean? */
4929 s_retbool (car (SCHEME_V->args) == S_F || car (SCHEME_V->args) == S_T);
4930
4931 case OP_EOFOBJP: /* boolean? */
4932 s_retbool (car (SCHEME_V->args) == S_EOF);
4933
4934 case OP_NULLP: /* null? */
4935 s_retbool (car (SCHEME_V->args) == NIL);
4936
4937 case OP_NUMEQ: /* = */
4938 case OP_LESS: /* < */
4939 case OP_GRE: /* > */
4940 case OP_LEQ: /* <= */
4941 case OP_GEQ: /* >= */
4942 switch (op)
4943 {
4944 case OP_NUMEQ:
4945 comp_func = num_eq;
4946 break;
4947
4948 case OP_LESS:
4949 comp_func = num_lt;
4950 break;
4951
4952 case OP_GRE:
4953 comp_func = num_gt;
4954 break;
4955
4956 case OP_LEQ:
4957 comp_func = num_le;
4958 break;
4959
4960 case OP_GEQ:
4961 comp_func = num_ge;
4962 break;
4963 }
4964
4965 x = SCHEME_V->args;
4966 v = nvalue (car (x));
4967 x = cdr (x);
4968
4969 for (; x != NIL; x = cdr (x))
4970 {
4971 if (!comp_func (v, nvalue (car (x))))
4972 {
4973 s_retbool (0);
4974 }
4975
4976 v = nvalue (car (x));
4977 }
4978
4979 s_retbool (1);
4980
4981 case OP_SYMBOLP: /* symbol? */
4982 s_retbool (is_symbol (car (SCHEME_V->args)));
4983
4984 case OP_NUMBERP: /* number? */
4985 s_retbool (is_number (car (SCHEME_V->args)));
4986
4987 case OP_STRINGP: /* string? */
4988 s_retbool (is_string (car (SCHEME_V->args)));
4989
4990 case OP_INTEGERP: /* integer? */
4991 s_retbool (is_integer (car (SCHEME_V->args)));
4992
4993 case OP_REALP: /* real? */
4994 s_retbool (is_number (car (SCHEME_V->args))); /* All numbers are real */
4995
4996 case OP_CHARP: /* char? */
4997 s_retbool (is_character (car (SCHEME_V->args)));
4998#if USE_CHAR_CLASSIFIERS 4476#if USE_CHAR_CLASSIFIERS
4999 4477 case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue_unchecked (a)); break;
5000 case OP_CHARAP: /* char-alphabetic? */ 4478 case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue_unchecked (a)); break;
5001 s_retbool (Cisalpha (ivalue (car (SCHEME_V->args)))); 4479 case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue_unchecked (a)); break;
5002 4480 case OP_CHARUP: /* char-upper-case? */ r = Cisupper (ivalue_unchecked (a)); break;
5003 case OP_CHARNP: /* char-numeric? */ 4481 case OP_CHARLP: /* char-lower-case? */ r = Cislower (ivalue_unchecked (a)); break;
5004 s_retbool (Cisdigit (ivalue (car (SCHEME_V->args))));
5005
5006 case OP_CHARWP: /* char-whitespace? */
5007 s_retbool (Cisspace (ivalue (car (SCHEME_V->args))));
5008
5009 case OP_CHARUP: /* char-upper-case? */
5010 s_retbool (Cisupper (ivalue (car (SCHEME_V->args))));
5011
5012 case OP_CHARLP: /* char-lower-case? */
5013 s_retbool (Cislower (ivalue (car (SCHEME_V->args))));
5014#endif 4482#endif
4483
5015#if USE_PORTS 4484#if USE_PORTS
5016 4485 case OP_PORTP: /* port? */ r = is_port (a) ; break;
5017 case OP_PORTP: /* port? */
5018 s_retbool (is_port (car (SCHEME_V->args)));
5019
5020 case OP_INPORTP: /* input-port? */ 4486 case OP_INPORTP: /* input-port? */ r = is_inport (a) ; break;
5021 s_retbool (is_inport (car (SCHEME_V->args)));
5022
5023 case OP_OUTPORTP: /* output-port? */ 4487 case OP_OUTPORTP: /* output-port? */ r = is_outport (a); break;
5024 s_retbool (is_outport (car (SCHEME_V->args)));
5025#endif 4488#endif
5026 4489
5027 case OP_PROCP: /* procedure? */ 4490 case OP_PROCP: /* procedure? */
5028 4491
5029 /*-- 4492 /*--
5030 * continuation should be procedure by the example 4493 * continuation should be procedure by the example
5031 * (call-with-current-continuation procedure?) ==> #t 4494 * (call-with-current-continuation procedure?) ==> #t
5032 * in R^3 report sec. 6.9 4495 * in R^3 report sec. 6.9
5033 */ 4496 */
5034 s_retbool (is_proc (car (SCHEME_V->args)) || is_closure (car (SCHEME_V->args)) 4497 r = is_proc (a) || is_closure (a) || is_continuation (a) || is_foreign (a);
5035 || is_continuation (car (SCHEME_V->args)) || is_foreign (car (SCHEME_V->args))); 4498 break;
5036 4499
5037 case OP_PAIRP: /* pair? */ 4500 case OP_PAIRP: /* pair? */ r = is_pair (a) ; break;
5038 s_retbool (is_pair (car (SCHEME_V->args))); 4501 case OP_LISTP: /* list? */ r = list_length (SCHEME_A_ a) >= 0; break;
5039 4502 case OP_ENVP: /* environment? */ r = is_environment (a) ; break;
5040 case OP_LISTP: /* list? */ 4503 case OP_VECTORP: /* vector? */ r = is_vector (a) ; break;
5041 s_retbool (list_length (SCHEME_A_ car (SCHEME_V->args)) >= 0); 4504 case OP_EQ: /* eq? */ r = a == cadr (args) ; break;
5042 4505 case OP_EQV: /* eqv? */ r = eqv (a, cadr (args)) ; break;
5043 case OP_ENVP: /* environment? */
5044 s_retbool (is_environment (car (SCHEME_V->args)));
5045
5046 case OP_VECTORP: /* vector? */
5047 s_retbool (is_vector (car (SCHEME_V->args)));
5048
5049 case OP_EQ: /* eq? */
5050 s_retbool (car (SCHEME_V->args) == cadr (SCHEME_V->args));
5051
5052 case OP_EQV: /* eqv? */
5053 s_retbool (eqv (car (SCHEME_V->args), cadr (SCHEME_V->args)));
5054 } 4506 }
5055 4507
5056 return S_T; 4508 s_retbool (r);
5057} 4509}
5058 4510
5059static pointer 4511static int
5060opexe_4 (SCHEME_P_ enum scheme_opcodes op) 4512opexe_4 (SCHEME_P_ enum scheme_opcodes op)
5061{ 4513{
4514 pointer args = SCHEME_V->args;
4515 pointer a = car (args);
5062 pointer x, y; 4516 pointer x, y;
5063 4517
5064 switch (op) 4518 switch (op)
5065 { 4519 {
5066 case OP_FORCE: /* force */ 4520 case OP_FORCE: /* force */
5067 SCHEME_V->code = car (SCHEME_V->args); 4521 SCHEME_V->code = a;
5068 4522
5069 if (is_promise (SCHEME_V->code)) 4523 if (is_promise (SCHEME_V->code))
5070 { 4524 {
5071 /* Should change type to closure here */ 4525 /* Should change type to closure here */
5072 s_save (SCHEME_A_ OP_SAVE_FORCED, NIL, SCHEME_V->code); 4526 s_save (SCHEME_A_ OP_SAVE_FORCED, NIL, SCHEME_V->code);
5073 SCHEME_V->args = NIL; 4527 SCHEME_V->args = NIL;
5074 s_goto (OP_APPLY); 4528 s_goto (OP_APPLY);
5075 } 4529 }
5076 else 4530 else
5077 {
5078 s_return (SCHEME_V->code); 4531 s_return (SCHEME_V->code);
5079 }
5080 4532
5081 case OP_SAVE_FORCED: /* Save forced value replacing promise */ 4533 case OP_SAVE_FORCED: /* Save forced value replacing promise */
5082 memcpy (SCHEME_V->code, SCHEME_V->value, sizeof (struct cell)); 4534 memcpy (SCHEME_V->code, SCHEME_V->value, sizeof (struct cell));
5083 s_return (SCHEME_V->value); 4535 s_return (SCHEME_V->value);
5084 4536
… …
5095 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL); 4547 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL);
5096 SCHEME_V->outport = cadr (SCHEME_V->args); 4548 SCHEME_V->outport = cadr (SCHEME_V->args);
5097 } 4549 }
5098 } 4550 }
5099 4551
5100 SCHEME_V->args = car (SCHEME_V->args); 4552 SCHEME_V->args = a;
5101 4553
5102 if (op == OP_WRITE) 4554 if (op == OP_WRITE)
5103 SCHEME_V->print_flag = 1; 4555 SCHEME_V->print_flag = 1;
5104 else 4556 else
5105 SCHEME_V->print_flag = 0; 4557 SCHEME_V->print_flag = 0;
5106 4558
5107 s_goto (OP_P0LIST); 4559 s_goto (OP_P0LIST);
5108 4560
5109 case OP_NEWLINE: /* newline */ 4561 case OP_NEWLINE: /* newline */
5110 if (is_pair (SCHEME_V->args)) 4562 if (is_pair (args))
5111 { 4563 {
5112 if (car (SCHEME_V->args) != SCHEME_V->outport) 4564 if (a != SCHEME_V->outport)
5113 { 4565 {
5114 x = cons (SCHEME_V->outport, NIL); 4566 x = cons (SCHEME_V->outport, NIL);
5115 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL); 4567 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL);
5116 SCHEME_V->outport = car (SCHEME_V->args); 4568 SCHEME_V->outport = a;
5117 } 4569 }
5118 } 4570 }
5119 4571
5120 putstr (SCHEME_A_ "\n"); 4572 putstr (SCHEME_A_ "\n");
5121 s_return (S_T); 4573 s_return (S_T);
5122#endif 4574#endif
5123 4575
5124 case OP_ERR0: /* error */ 4576 case OP_ERR0: /* error */
5125 SCHEME_V->retcode = -1; 4577 SCHEME_V->retcode = -1;
5126 4578
5127 if (!is_string (car (SCHEME_V->args))) 4579 if (!is_string (a))
5128 { 4580 {
5129 SCHEME_V->args = cons (mk_string (SCHEME_A_ " -- "), SCHEME_V->args); 4581 args = cons (mk_string (SCHEME_A_ " -- "), args);
5130 setimmutable (car (SCHEME_V->args)); 4582 setimmutable (car (args));
5131 } 4583 }
5132 4584
5133 putstr (SCHEME_A_ "Error: "); 4585 putstr (SCHEME_A_ "Error: ");
5134 putstr (SCHEME_A_ strvalue (car (SCHEME_V->args))); 4586 putstr (SCHEME_A_ strvalue (car (args)));
5135 SCHEME_V->args = cdr (SCHEME_V->args); 4587 SCHEME_V->args = cdr (args);
5136 s_goto (OP_ERR1); 4588 s_goto (OP_ERR1);
5137 4589
5138 case OP_ERR1: /* error */ 4590 case OP_ERR1: /* error */
5139 putstr (SCHEME_A_ " "); 4591 putstr (SCHEME_A_ " ");
5140 4592
5141 if (SCHEME_V->args != NIL) 4593 if (args != NIL)
5142 { 4594 {
5143 s_save (SCHEME_A_ OP_ERR1, cdr (SCHEME_V->args), NIL); 4595 s_save (SCHEME_A_ OP_ERR1, cdr (args), NIL);
5144 SCHEME_V->args = car (SCHEME_V->args); 4596 SCHEME_V->args = a;
5145 SCHEME_V->print_flag = 1; 4597 SCHEME_V->print_flag = 1;
5146 s_goto (OP_P0LIST); 4598 s_goto (OP_P0LIST);
5147 } 4599 }
5148 else 4600 else
5149 { 4601 {
5150 putstr (SCHEME_A_ "\n"); 4602 putstr (SCHEME_A_ "\n");
5151 4603
5152 if (SCHEME_V->interactive_repl) 4604 if (SCHEME_V->interactive_repl)
5153 {
5154 s_goto (OP_T0LVL); 4605 s_goto (OP_T0LVL);
5155 }
5156 else 4606 else
5157 {
5158 return NIL; 4607 return -1;
5159 }
5160 } 4608 }
5161 4609
5162 case OP_REVERSE: /* reverse */ 4610 case OP_REVERSE: /* reverse */
5163 s_return (reverse (SCHEME_A_ car (SCHEME_V->args))); 4611 s_return (reverse (SCHEME_A_ a));
5164 4612
5165 case OP_LIST_STAR: /* list* */ 4613 case OP_LIST_STAR: /* list* */
5166 s_return (list_star (SCHEME_A_ SCHEME_V->args)); 4614 s_return (list_star (SCHEME_A_ SCHEME_V->args));
5167 4615
5168 case OP_APPEND: /* append */ 4616 case OP_APPEND: /* append */
5169 x = NIL; 4617 x = NIL;
5170 y = SCHEME_V->args; 4618 y = args;
5171 4619
5172 if (y == x) 4620 if (y == x)
5173 s_return (x); 4621 s_return (x);
5174 4622
5175 /* cdr() in the while condition is not a typo. If car() */ 4623 /* cdr() in the while condition is not a typo. If car() */
… …
5186 s_return (reverse_in_place (SCHEME_A_ car (y), x)); 4634 s_return (reverse_in_place (SCHEME_A_ car (y), x));
5187 4635
5188#if USE_PLIST 4636#if USE_PLIST
5189 4637
5190 case OP_PUT: /* put */ 4638 case OP_PUT: /* put */
5191 if (!hasprop (car (SCHEME_V->args)) || !hasprop (cadr (SCHEME_V->args))) 4639 if (!hasprop (a) || !hasprop (cadr (args)))
5192 {
5193 Error_0 ("illegal use of put"); 4640 Error_0 ("illegal use of put");
5194 }
5195 4641
5196 for (x = symprop (car (SCHEME_V->args)), y = cadr (SCHEME_V->args); x != NIL; x = cdr (x)) 4642 for (x = symprop (a), y = cadr (args); x != NIL; x = cdr (x))
5197 { 4643 {
5198 if (caar (x) == y) 4644 if (caar (x) == y)
5199 {
5200 break; 4645 break;
5201 }
5202 } 4646 }
5203 4647
5204 if (x != NIL) 4648 if (x != NIL)
5205 cdar (x) = caddr (SCHEME_V->args); 4649 cdar (x) = caddr (args);
5206 else 4650 else
5207 symprop (car (SCHEME_V->args)) = cons (cons (y, caddr (SCHEME_V->args)), symprop (car (SCHEME_V->args))); 4651 symprop (a) = cons (cons (y, caddr (args)), symprop (a));
5208 4652
5209 s_return (S_T); 4653 s_return (S_T);
5210 4654
5211 case OP_GET: /* get */ 4655 case OP_GET: /* get */
5212 if (!hasprop (car (SCHEME_V->args)) || !hasprop (cadr (SCHEME_V->args))) 4656 if (!hasprop (a) || !hasprop (cadr (args)))
5213 Error_0 ("illegal use of get"); 4657 Error_0 ("illegal use of get");
5214 4658
5215 for (x = symprop (car (SCHEME_V->args)), y = cadr (SCHEME_V->args); x != NIL; x = cdr (x)) 4659 for (x = symprop (a), y = cadr (args); x != NIL; x = cdr (x))
5216 if (caar (x) == y) 4660 if (caar (x) == y)
5217 break; 4661 break;
5218 4662
5219 if (x != NIL) 4663 if (x != NIL)
5220 s_return (cdar (x)); 4664 s_return (cdar (x));
… …
5222 s_return (NIL); 4666 s_return (NIL);
5223 4667
5224#endif /* USE_PLIST */ 4668#endif /* USE_PLIST */
5225 4669
5226 case OP_QUIT: /* quit */ 4670 case OP_QUIT: /* quit */
5227 if (is_pair (SCHEME_V->args)) 4671 if (is_pair (args))
5228 SCHEME_V->retcode = ivalue (car (SCHEME_V->args)); 4672 SCHEME_V->retcode = ivalue (a);
5229 4673
5230 return NIL; 4674 return -1;
5231 4675
5232 case OP_GC: /* gc */ 4676 case OP_GC: /* gc */
5233 gc (SCHEME_A_ NIL, NIL); 4677 gc (SCHEME_A_ NIL, NIL);
5234 s_return (S_T); 4678 s_return (S_T);
5235 4679
5236 case OP_GCVERB: /* gc-verbose */ 4680 case OP_GCVERB: /* gc-verbose */
5237 { 4681 {
5238 int was = SCHEME_V->gc_verbose; 4682 int was = SCHEME_V->gc_verbose;
5239 4683
5240 SCHEME_V->gc_verbose = (car (SCHEME_V->args) != S_F); 4684 SCHEME_V->gc_verbose = (a != S_F);
5241 s_retbool (was); 4685 s_retbool (was);
5242 } 4686 }
5243 4687
5244 case OP_NEWSEGMENT: /* new-segment */ 4688 case OP_NEWSEGMENT: /* new-segment */
5245 if (!is_pair (SCHEME_V->args) || !is_number (car (SCHEME_V->args))) 4689 if (!is_pair (args) || !is_number (a))
5246 Error_0 ("new-segment: argument must be a number"); 4690 Error_0 ("new-segment: argument must be a number");
5247 4691
5248 alloc_cellseg (SCHEME_A_ (int)ivalue (car (SCHEME_V->args))); 4692 alloc_cellseg (SCHEME_A_ ivalue (a));
5249 4693
5250 s_return (S_T); 4694 s_return (S_T);
5251 4695
5252 case OP_OBLIST: /* oblist */ 4696 case OP_OBLIST: /* oblist */
5253 s_return (oblist_all_symbols (SCHEME_A)); 4697 s_return (oblist_all_symbols (SCHEME_A));
… …
5280 case OP_OPEN_INOUTFILE: 4724 case OP_OPEN_INOUTFILE:
5281 prop = port_input | port_output; 4725 prop = port_input | port_output;
5282 break; 4726 break;
5283 } 4727 }
5284 4728
5285 p = port_from_filename (SCHEME_A_ strvalue (car (SCHEME_V->args)), prop); 4729 p = port_from_filename (SCHEME_A_ strvalue (a), prop);
5286 4730
5287 if (p == NIL) 4731 s_return (p == NIL ? S_F : p);
5288 {
5289 s_return (S_F);
5290 }
5291
5292 s_return (p);
5293 } 4732 }
5294 4733
5295# if USE_STRING_PORTS 4734# if USE_STRING_PORTS
5296 4735
5297 case OP_OPEN_INSTRING: /* open-input-string */ 4736 case OP_OPEN_INSTRING: /* open-input-string */
… …
5309 case OP_OPEN_INOUTSTRING: 4748 case OP_OPEN_INOUTSTRING:
5310 prop = port_input | port_output; 4749 prop = port_input | port_output;
5311 break; 4750 break;
5312 } 4751 }
5313 4752
5314 p = port_from_string (SCHEME_A_ strvalue (car (SCHEME_V->args)), 4753 p = port_from_string (SCHEME_A_ strvalue (a),
5315 strvalue (car (SCHEME_V->args)) + strlength (car (SCHEME_V->args)), prop); 4754 strvalue (a) + strlength (a), prop);
5316 4755
5317 if (p == NIL) 4756 s_return (p == NIL ? S_F : p);
5318 {
5319 s_return (S_F);
5320 }
5321
5322 s_return (p);
5323 } 4757 }
5324 4758
5325 case OP_OPEN_OUTSTRING: /* open-output-string */ 4759 case OP_OPEN_OUTSTRING: /* open-output-string */
5326 { 4760 {
5327 pointer p; 4761 pointer p;
5328 4762
5329 if (car (SCHEME_V->args) == NIL) 4763 if (a == NIL)
5330 {
5331 p = port_from_scratch (SCHEME_A); 4764 p = port_from_scratch (SCHEME_A);
5332
5333 if (p == NIL)
5334 {
5335 s_return (S_F);
5336 }
5337 }
5338 else 4765 else
5339 {
5340 p = port_from_string (SCHEME_A_ strvalue (car (SCHEME_V->args)), 4766 p = port_from_string (SCHEME_A_ strvalue (a),
5341 strvalue (car (SCHEME_V->args)) + strlength (car (SCHEME_V->args)), port_output); 4767 strvalue (a) + strlength (a), port_output);
5342 4768
5343 if (p == NIL) 4769 s_return (p == NIL ? S_F : p);
5344 {
5345 s_return (S_F);
5346 }
5347 }
5348
5349 s_return (p);
5350 } 4770 }
5351 4771
5352 case OP_GET_OUTSTRING: /* get-output-string */ 4772 case OP_GET_OUTSTRING: /* get-output-string */
5353 { 4773 {
5354 port *p; 4774 port *p;
5355 4775
5356 if ((p = car (SCHEME_V->args)->object.port)->kind & port_string) 4776 if ((p = a->object.port)->kind & port_string)
5357 { 4777 {
5358 off_t size; 4778 off_t size;
5359 char *str; 4779 char *str;
5360 4780
5361 size = p->rep.string.curr - p->rep.string.start + 1; 4781 size = p->rep.string.curr - p->rep.string.start + 1;
… …
5377 } 4797 }
5378 4798
5379# endif 4799# endif
5380 4800
5381 case OP_CLOSE_INPORT: /* close-input-port */ 4801 case OP_CLOSE_INPORT: /* close-input-port */
5382 port_close (SCHEME_A_ car (SCHEME_V->args), port_input); 4802 port_close (SCHEME_A_ a, port_input);
5383 s_return (S_T); 4803 s_return (S_T);
5384 4804
5385 case OP_CLOSE_OUTPORT: /* close-output-port */ 4805 case OP_CLOSE_OUTPORT: /* close-output-port */
5386 port_close (SCHEME_A_ car (SCHEME_V->args), port_output); 4806 port_close (SCHEME_A_ a, port_output);
5387 s_return (S_T); 4807 s_return (S_T);
5388#endif 4808#endif
5389 4809
5390 case OP_INT_ENV: /* interaction-environment */ 4810 case OP_INT_ENV: /* interaction-environment */
5391 s_return (SCHEME_V->global_env); 4811 s_return (SCHEME_V->global_env);
… …
5393 case OP_CURR_ENV: /* current-environment */ 4813 case OP_CURR_ENV: /* current-environment */
5394 s_return (SCHEME_V->envir); 4814 s_return (SCHEME_V->envir);
5395 4815
5396 } 4816 }
5397 4817
5398 return S_T; 4818 if (USE_ERROR_CHECKING) abort ();
5399} 4819}
5400 4820
5401static pointer 4821static int
5402opexe_5 (SCHEME_P_ enum scheme_opcodes op) 4822opexe_5 (SCHEME_P_ enum scheme_opcodes op)
5403{ 4823{
4824 pointer args = SCHEME_V->args;
5404 pointer x; 4825 pointer x;
5405 4826
5406 if (SCHEME_V->nesting != 0) 4827 if (SCHEME_V->nesting != 0)
5407 { 4828 {
5408 int n = SCHEME_V->nesting; 4829 int n = SCHEME_V->nesting;
… …
5415 switch (op) 4836 switch (op)
5416 { 4837 {
5417 /* ========== reading part ========== */ 4838 /* ========== reading part ========== */
5418#if USE_PORTS 4839#if USE_PORTS
5419 case OP_READ: 4840 case OP_READ:
5420 if (!is_pair (SCHEME_V->args)) 4841 if (!is_pair (args))
5421 {
5422 s_goto (OP_READ_INTERNAL); 4842 s_goto (OP_READ_INTERNAL);
5423 }
5424 4843
5425 if (!is_inport (car (SCHEME_V->args))) 4844 if (!is_inport (car (args)))
5426 {
5427 Error_1 ("read: not an input port:", car (SCHEME_V->args)); 4845 Error_1 ("read: not an input port:", car (args));
5428 }
5429 4846
5430 if (car (SCHEME_V->args) == SCHEME_V->inport) 4847 if (car (args) == SCHEME_V->inport)
5431 {
5432 s_goto (OP_READ_INTERNAL); 4848 s_goto (OP_READ_INTERNAL);
5433 }
5434 4849
5435 x = SCHEME_V->inport; 4850 x = SCHEME_V->inport;
5436 SCHEME_V->inport = car (SCHEME_V->args); 4851 SCHEME_V->inport = car (args);
5437 x = cons (x, NIL); 4852 x = cons (x, NIL);
5438 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); 4853 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL);
5439 s_goto (OP_READ_INTERNAL); 4854 s_goto (OP_READ_INTERNAL);
5440 4855
5441 case OP_READ_CHAR: /* read-char */ 4856 case OP_READ_CHAR: /* read-char */
5442 case OP_PEEK_CHAR: /* peek-char */ 4857 case OP_PEEK_CHAR: /* peek-char */
5443 { 4858 {
5444 int c; 4859 int c;
5445 4860
5446 if (is_pair (SCHEME_V->args)) 4861 if (is_pair (args))
5447 { 4862 {
5448 if (car (SCHEME_V->args) != SCHEME_V->inport) 4863 if (car (args) != SCHEME_V->inport)
5449 { 4864 {
5450 x = SCHEME_V->inport; 4865 x = SCHEME_V->inport;
5451 x = cons (x, NIL); 4866 x = cons (x, NIL);
5452 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); 4867 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL);
5453 SCHEME_V->inport = car (SCHEME_V->args); 4868 SCHEME_V->inport = car (args);
5454 } 4869 }
5455 } 4870 }
5456 4871
5457 c = inchar (SCHEME_A); 4872 c = inchar (SCHEME_A);
5458 4873
… …
5468 case OP_CHAR_READY: /* char-ready? */ 4883 case OP_CHAR_READY: /* char-ready? */
5469 { 4884 {
5470 pointer p = SCHEME_V->inport; 4885 pointer p = SCHEME_V->inport;
5471 int res; 4886 int res;
5472 4887
5473 if (is_pair (SCHEME_V->args)) 4888 if (is_pair (args))
5474 {
5475 p = car (SCHEME_V->args); 4889 p = car (args);
5476 }
5477 4890
5478 res = p->object.port->kind & port_string; 4891 res = p->object.port->kind & port_string;
5479 4892
5480 s_retbool (res); 4893 s_retbool (res);
5481 } 4894 }
5482 4895
5483 case OP_SET_INPORT: /* set-input-port */ 4896 case OP_SET_INPORT: /* set-input-port */
5484 SCHEME_V->inport = car (SCHEME_V->args); 4897 SCHEME_V->inport = car (args);
5485 s_return (SCHEME_V->value); 4898 s_return (SCHEME_V->value);
5486 4899
5487 case OP_SET_OUTPORT: /* set-output-port */ 4900 case OP_SET_OUTPORT: /* set-output-port */
5488 SCHEME_V->outport = car (SCHEME_V->args); 4901 SCHEME_V->outport = car (args);
5489 s_return (SCHEME_V->value); 4902 s_return (SCHEME_V->value);
5490#endif 4903#endif
5491 4904
5492 case OP_RDSEXPR: 4905 case OP_RDSEXPR:
5493 switch (SCHEME_V->tok) 4906 switch (SCHEME_V->tok)
… …
5496 s_return (S_EOF); 4909 s_return (S_EOF);
5497 /* NOTREACHED */ 4910 /* NOTREACHED */
5498 4911
5499 case TOK_VEC: 4912 case TOK_VEC:
5500 s_save (SCHEME_A_ OP_RDVEC, NIL, NIL); 4913 s_save (SCHEME_A_ OP_RDVEC, NIL, NIL);
5501
5502 /* fall through */ 4914 /* fall through */
4915
5503 case TOK_LPAREN: 4916 case TOK_LPAREN:
5504 SCHEME_V->tok = token (SCHEME_A); 4917 SCHEME_V->tok = token (SCHEME_A);
5505 4918
5506 if (SCHEME_V->tok == TOK_RPAREN) 4919 if (SCHEME_V->tok == TOK_RPAREN)
5507 s_return (NIL); 4920 s_return (NIL);
… …
5527 s_save (SCHEME_A_ OP_RDQQUOTEVEC, NIL, NIL); 4940 s_save (SCHEME_A_ OP_RDQQUOTEVEC, NIL, NIL);
5528 SCHEME_V->tok = TOK_LPAREN; 4941 SCHEME_V->tok = TOK_LPAREN;
5529 s_goto (OP_RDSEXPR); 4942 s_goto (OP_RDSEXPR);
5530 } 4943 }
5531 else 4944 else
5532 {
5533 s_save (SCHEME_A_ OP_RDQQUOTE, NIL, NIL); 4945 s_save (SCHEME_A_ OP_RDQQUOTE, NIL, NIL);
5534 }
5535 4946
5536 s_goto (OP_RDSEXPR); 4947 s_goto (OP_RDSEXPR);
5537 4948
5538 case TOK_COMMA: 4949 case TOK_COMMA:
5539 s_save (SCHEME_A_ OP_RDUNQUOTE, NIL, NIL); 4950 s_save (SCHEME_A_ OP_RDUNQUOTE, NIL, NIL);
… …
5544 s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL); 4955 s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL);
5545 SCHEME_V->tok = token (SCHEME_A); 4956 SCHEME_V->tok = token (SCHEME_A);
5546 s_goto (OP_RDSEXPR); 4957 s_goto (OP_RDSEXPR);
5547 4958
5548 case TOK_ATOM: 4959 case TOK_ATOM:
5549 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))); 4960 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS)));
4961
4962 case TOK_DOTATOM:
4963 SCHEME_V->strbuff[0] = '.';
4964 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 1, DELIMITERS)));
4965
4966 case TOK_STRATOM:
4967 x = readstrexp (SCHEME_A_ '|');
4968 //TODO: haven't checked whether the garbage collector could interfere
4969 s_return (mk_atom (SCHEME_A_ strvalue (x)));
5550 4970
5551 case TOK_DQUOTE: 4971 case TOK_DQUOTE:
5552 x = readstrexp (SCHEME_A); 4972 x = readstrexp (SCHEME_A_ '"');
5553 4973
5554 if (x == S_F) 4974 if (x == S_F)
5555 Error_0 ("Error reading string"); 4975 Error_0 ("Error reading string");
5556 4976
5557 setimmutable (x); 4977 setimmutable (x);
… …
5569 s_goto (OP_EVAL); 4989 s_goto (OP_EVAL);
5570 } 4990 }
5571 } 4991 }
5572 4992
5573 case TOK_SHARP_CONST: 4993 case TOK_SHARP_CONST:
5574 if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))) == NIL) 4994 if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS))) == NIL)
5575 Error_0 ("undefined sharp expression"); 4995 Error_0 ("undefined sharp expression");
5576 else 4996 else
5577 s_return (x); 4997 s_return (x);
5578 4998
5579 default: 4999 default:
… …
5581 } 5001 }
5582 5002
5583 break; 5003 break;
5584 5004
5585 case OP_RDLIST: 5005 case OP_RDLIST:
5586 {
5587 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 5006 SCHEME_V->args = cons (SCHEME_V->value, args);
5588 SCHEME_V->tok = token (SCHEME_A); 5007 SCHEME_V->tok = token (SCHEME_A);
5589 5008
5590 if (SCHEME_V->tok == TOK_EOF) 5009 switch (SCHEME_V->tok)
5010 {
5011 case TOK_EOF:
5591 s_return (S_EOF); 5012 s_return (S_EOF);
5592 else if (SCHEME_V->tok == TOK_RPAREN) 5013
5014 case TOK_RPAREN:
5593 { 5015 {
5594 int c = inchar (SCHEME_A); 5016 int c = inchar (SCHEME_A);
5595 5017
5596 if (c != '\n') 5018 if (c != '\n')
5597 backchar (SCHEME_A_ c); 5019 backchar (SCHEME_A_ c);
5598
5599#if SHOW_ERROR_LINE 5020#if SHOW_ERROR_LINE
5600 else if (SCHEME_V->load_stack[SCHEME_V->file_i].kind & port_file) 5021 else if (SCHEME_V->load_stack[SCHEME_V->file_i].kind & port_file)
5601 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line++; 5022 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line++;
5602
5603#endif 5023#endif
5024
5604 SCHEME_V->nesting_stack[SCHEME_V->file_i]--; 5025 SCHEME_V->nesting_stack[SCHEME_V->file_i]--;
5605 s_return (reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args)); 5026 s_return (reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args));
5606 } 5027 }
5607 else if (SCHEME_V->tok == TOK_DOT) 5028
5608 { 5029 case TOK_DOT:
5609 s_save (SCHEME_A_ OP_RDDOT, SCHEME_V->args, NIL); 5030 s_save (SCHEME_A_ OP_RDDOT, SCHEME_V->args, NIL);
5610 SCHEME_V->tok = token (SCHEME_A); 5031 SCHEME_V->tok = token (SCHEME_A);
5611 s_goto (OP_RDSEXPR); 5032 s_goto (OP_RDSEXPR);
5612 } 5033
5613 else 5034 default:
5614 {
5615 s_save (SCHEME_A_ OP_RDLIST, SCHEME_V->args, NIL);; 5035 s_save (SCHEME_A_ OP_RDLIST, SCHEME_V->args, NIL);
5616 s_goto (OP_RDSEXPR); 5036 s_goto (OP_RDSEXPR);
5617 } 5037 }
5618 }
5619 5038
5620 case OP_RDDOT: 5039 case OP_RDDOT:
5621 if (token (SCHEME_A) != TOK_RPAREN) 5040 if (token (SCHEME_A) != TOK_RPAREN)
5622 Error_0 ("syntax error: illegal dot expression"); 5041 Error_0 ("syntax error: illegal dot expression");
5623 else 5042
5624 {
5625 SCHEME_V->nesting_stack[SCHEME_V->file_i]--; 5043 SCHEME_V->nesting_stack[SCHEME_V->file_i]--;
5626 s_return (reverse_in_place (SCHEME_A_ SCHEME_V->value, SCHEME_V->args)); 5044 s_return (reverse_in_place (SCHEME_A_ SCHEME_V->value, args));
5627 }
5628 5045
5629 case OP_RDQUOTE: 5046 case OP_RDQUOTE:
5630 s_return (cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL))); 5047 s_return (cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL)));
5631 5048
5632 case OP_RDQQUOTE: 5049 case OP_RDQQUOTE:
… …
5654 SCHEME_V->args = SCHEME_V->value; 5071 SCHEME_V->args = SCHEME_V->value;
5655 s_goto (OP_VECTOR); 5072 s_goto (OP_VECTOR);
5656 5073
5657 /* ========== printing part ========== */ 5074 /* ========== printing part ========== */
5658 case OP_P0LIST: 5075 case OP_P0LIST:
5659 if (is_vector (SCHEME_V->args)) 5076 if (is_vector (args))
5660 { 5077 {
5661 putstr (SCHEME_A_ "#("); 5078 putstr (SCHEME_A_ "#(");
5662 SCHEME_V->args = cons (SCHEME_V->args, mk_integer (SCHEME_A_ 0)); 5079 SCHEME_V->args = cons (args, mk_integer (SCHEME_A_ 0));
5663 s_goto (OP_PVECFROM); 5080 s_goto (OP_PVECFROM);
5664 } 5081 }
5665 else if (is_environment (SCHEME_V->args)) 5082 else if (is_environment (args))
5666 { 5083 {
5667 putstr (SCHEME_A_ "#<ENVIRONMENT>"); 5084 putstr (SCHEME_A_ "#<ENVIRONMENT>");
5668 s_return (S_T); 5085 s_return (S_T);
5669 } 5086 }
5670 else if (!is_pair (SCHEME_V->args)) 5087 else if (!is_pair (args))
5671 { 5088 {
5672 printatom (SCHEME_A_ SCHEME_V->args, SCHEME_V->print_flag); 5089 printatom (SCHEME_A_ args, SCHEME_V->print_flag);
5673 s_return (S_T); 5090 s_return (S_T);
5674 } 5091 }
5675 else if (car (SCHEME_V->args) == SCHEME_V->QUOTE && ok_abbrev (cdr (SCHEME_V->args))) 5092 else
5676 { 5093 {
5094 pointer a = car (args);
5095 pointer b = cdr (args);
5096 int ok_abbr = ok_abbrev (b);
5097 SCHEME_V->args = car (b);
5098
5099 if (a == SCHEME_V->QUOTE && ok_abbr)
5677 putstr (SCHEME_A_ "'"); 5100 putstr (SCHEME_A_ "'");
5678 SCHEME_V->args = cadr (SCHEME_V->args); 5101 else if (a == SCHEME_V->QQUOTE && ok_abbr)
5102 putstr (SCHEME_A_ "`");
5103 else if (a == SCHEME_V->UNQUOTE && ok_abbr)
5104 putstr (SCHEME_A_ ",");
5105 else if (a == SCHEME_V->UNQUOTESP && ok_abbr)
5106 putstr (SCHEME_A_ ",@");
5107 else
5108 {
5109 putstr (SCHEME_A_ "(");
5110 s_save (SCHEME_A_ OP_P1LIST, b, NIL);
5111 SCHEME_V->args = a;
5112 }
5113
5679 s_goto (OP_P0LIST); 5114 s_goto (OP_P0LIST);
5680 } 5115 }
5681 else if (car (SCHEME_V->args) == SCHEME_V->QQUOTE && ok_abbrev (cdr (SCHEME_V->args))) 5116
5117 case OP_P1LIST:
5118 if (is_pair (args))
5682 { 5119 {
5120 s_save (SCHEME_A_ OP_P1LIST, cdr (args), NIL);
5683 putstr (SCHEME_A_ "`"); 5121 putstr (SCHEME_A_ " ");
5684 SCHEME_V->args = cadr (SCHEME_V->args); 5122 SCHEME_V->args = car (args);
5685 s_goto (OP_P0LIST); 5123 s_goto (OP_P0LIST);
5686 } 5124 }
5687 else if (car (SCHEME_V->args) == SCHEME_V->UNQUOTE && ok_abbrev (cdr (SCHEME_V->args)))
5688 {
5689 putstr (SCHEME_A_ ",");
5690 SCHEME_V->args = cadr (SCHEME_V->args);
5691 s_goto (OP_P0LIST);
5692 }
5693 else if (car (SCHEME_V->args) == SCHEME_V->UNQUOTESP && ok_abbrev (cdr (SCHEME_V->args)))
5694 {
5695 putstr (SCHEME_A_ ",@");
5696 SCHEME_V->args = cadr (SCHEME_V->args);
5697 s_goto (OP_P0LIST);
5698 }
5699 else
5700 {
5701 putstr (SCHEME_A_ "(");
5702 s_save (SCHEME_A_ OP_P1LIST, cdr (SCHEME_V->args), NIL);
5703 SCHEME_V->args = car (SCHEME_V->args);
5704 s_goto (OP_P0LIST);
5705 }
5706
5707 case OP_P1LIST:
5708 if (is_pair (SCHEME_V->args))
5709 {
5710 s_save (SCHEME_A_ OP_P1LIST, cdr (SCHEME_V->args), NIL);
5711 putstr (SCHEME_A_ " ");
5712 SCHEME_V->args = car (SCHEME_V->args);
5713 s_goto (OP_P0LIST);
5714 }
5715 else if (is_vector (SCHEME_V->args)) 5125 else if (is_vector (args))
5716 { 5126 {
5717 s_save (SCHEME_A_ OP_P1LIST, NIL, NIL); 5127 s_save (SCHEME_A_ OP_P1LIST, NIL, NIL);
5718 putstr (SCHEME_A_ " . "); 5128 putstr (SCHEME_A_ " . ");
5719 s_goto (OP_P0LIST); 5129 s_goto (OP_P0LIST);
5720 } 5130 }
5721 else 5131 else
5722 { 5132 {
5723 if (SCHEME_V->args != NIL) 5133 if (args != NIL)
5724 { 5134 {
5725 putstr (SCHEME_A_ " . "); 5135 putstr (SCHEME_A_ " . ");
5726 printatom (SCHEME_A_ SCHEME_V->args, SCHEME_V->print_flag); 5136 printatom (SCHEME_A_ args, SCHEME_V->print_flag);
5727 } 5137 }
5728 5138
5729 putstr (SCHEME_A_ ")"); 5139 putstr (SCHEME_A_ ")");
5730 s_return (S_T); 5140 s_return (S_T);
5731 } 5141 }
5732 5142
5733 case OP_PVECFROM: 5143 case OP_PVECFROM:
5734 { 5144 {
5735 int i = ivalue_unchecked (cdr (SCHEME_V->args)); 5145 int i = ivalue_unchecked (cdr (args));
5736 pointer vec = car (SCHEME_V->args); 5146 pointer vec = car (args);
5737 int len = ivalue_unchecked (vec); 5147 int len = veclength (vec);
5738 5148
5739 if (i == len) 5149 if (i == len)
5740 { 5150 {
5741 putstr (SCHEME_A_ ")"); 5151 putstr (SCHEME_A_ ")");
5742 s_return (S_T); 5152 s_return (S_T);
5743 } 5153 }
5744 else 5154 else
5745 { 5155 {
5746 pointer elem = vector_elem (vec, i); 5156 pointer elem = vector_get (vec, i);
5747 5157
5748 ivalue_unchecked (cdr (SCHEME_V->args)) = i + 1; 5158 ivalue_unchecked (cdr (args)) = i + 1;
5749 s_save (SCHEME_A_ OP_PVECFROM, SCHEME_V->args, NIL); 5159 s_save (SCHEME_A_ OP_PVECFROM, args, NIL);
5750 SCHEME_V->args = elem; 5160 SCHEME_V->args = elem;
5751 5161
5752 if (i > 0) 5162 if (i > 0)
5753 putstr (SCHEME_A_ " "); 5163 putstr (SCHEME_A_ " ");
5754 5164
5755 s_goto (OP_P0LIST); 5165 s_goto (OP_P0LIST);
5756 } 5166 }
5757 } 5167 }
5758 } 5168 }
5759 5169
5760 return S_T; 5170 if (USE_ERROR_CHECKING) abort ();
5761} 5171}
5762 5172
5763static pointer 5173static int
5764opexe_6 (SCHEME_P_ enum scheme_opcodes op) 5174opexe_6 (SCHEME_P_ enum scheme_opcodes op)
5765{ 5175{
5176 pointer args = SCHEME_V->args;
5177 pointer a = car (args);
5766 pointer x, y; 5178 pointer x, y;
5767 5179
5768 switch (op) 5180 switch (op)
5769 { 5181 {
5770 case OP_LIST_LENGTH: /* length *//* a.k */ 5182 case OP_LIST_LENGTH: /* length *//* a.k */
5771 { 5183 {
5772 long v = list_length (SCHEME_A_ car (SCHEME_V->args)); 5184 long v = list_length (SCHEME_A_ a);
5773 5185
5774 if (v < 0) 5186 if (v < 0)
5775 Error_1 ("length: not a list:", car (SCHEME_V->args)); 5187 Error_1 ("length: not a list:", a);
5776 5188
5777 s_return (mk_integer (SCHEME_A_ v)); 5189 s_return (mk_integer (SCHEME_A_ v));
5778 } 5190 }
5779 5191
5780 case OP_ASSQ: /* assq *//* a.k */ 5192 case OP_ASSQ: /* assq *//* a.k */
5781 x = car (SCHEME_V->args); 5193 x = a;
5782 5194
5783 for (y = cadr (SCHEME_V->args); is_pair (y); y = cdr (y)) 5195 for (y = cadr (args); is_pair (y); y = cdr (y))
5784 { 5196 {
5785 if (!is_pair (car (y))) 5197 if (!is_pair (car (y)))
5786 Error_0 ("unable to handle non pair element"); 5198 Error_0 ("unable to handle non pair element");
5787 5199
5788 if (x == caar (y)) 5200 if (x == caar (y))
… …
5794 else 5206 else
5795 s_return (S_F); 5207 s_return (S_F);
5796 5208
5797 5209
5798 case OP_GET_CLOSURE: /* get-closure-code *//* a.k */ 5210 case OP_GET_CLOSURE: /* get-closure-code *//* a.k */
5799 SCHEME_V->args = car (SCHEME_V->args); 5211 SCHEME_V->args = a;
5800 5212
5801 if (SCHEME_V->args == NIL) 5213 if (SCHEME_V->args == NIL)
5802 s_return (S_F); 5214 s_return (S_F);
5803 else if (is_closure (SCHEME_V->args)) 5215 else if (is_closure (SCHEME_V->args))
5804 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value))); 5216 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value)));
… …
5810 case OP_CLOSUREP: /* closure? */ 5222 case OP_CLOSUREP: /* closure? */
5811 /* 5223 /*
5812 * Note, macro object is also a closure. 5224 * Note, macro object is also a closure.
5813 * Therefore, (closure? <#MACRO>) ==> #t 5225 * Therefore, (closure? <#MACRO>) ==> #t
5814 */ 5226 */
5815 s_retbool (is_closure (car (SCHEME_V->args))); 5227 s_retbool (is_closure (a));
5816 5228
5817 case OP_MACROP: /* macro? */ 5229 case OP_MACROP: /* macro? */
5818 s_retbool (is_macro (car (SCHEME_V->args))); 5230 s_retbool (is_macro (a));
5819 } 5231 }
5820 5232
5821 return S_T; /* NOTREACHED */ 5233 if (USE_ERROR_CHECKING) abort ();
5822} 5234}
5823 5235
5236/* dispatch functions (opexe_x) return new opcode, or 0 for same opcode, or -1 to stop */
5824typedef pointer (*dispatch_func) (SCHEME_P_ enum scheme_opcodes); 5237typedef int (*dispatch_func)(SCHEME_P_ enum scheme_opcodes);
5825 5238
5826typedef int (*test_predicate) (pointer); 5239typedef int (*test_predicate)(pointer);
5827static int 5240static int
5828is_any (pointer p) 5241tst_any (pointer p)
5829{ 5242{
5830 return 1; 5243 return 1;
5831} 5244}
5832 5245
5833static int 5246static int
5834is_nonneg (pointer p) 5247tst_inonneg (pointer p)
5835{ 5248{
5836 return ivalue (p) >= 0 && is_integer (p); 5249 return is_integer (p) && ivalue_unchecked (p) >= 0;
5250}
5251
5252static int
5253tst_is_list (SCHEME_P_ pointer p)
5254{
5255 return p == NIL || is_pair (p);
5837} 5256}
5838 5257
5839/* Correspond carefully with following defines! */ 5258/* Correspond carefully with following defines! */
5840static struct 5259static struct
5841{ 5260{
5842 test_predicate fct; 5261 test_predicate fct;
5843 const char *kind; 5262 const char *kind;
5844} tests[] = 5263} tests[] = {
5845{ 5264 { tst_any , 0 },
5846 { 0, 0}, /* unused */ 5265 { is_string , "string" },
5847 { is_any, 0}, 5266 { is_symbol , "symbol" },
5848 { is_string, "string" }, 5267 { is_port , "port" },
5849 { is_symbol, "symbol" },
5850 { is_port, "port" },
5851 { is_inport, "input port" }, 5268 { is_inport , "input port" },
5852 { is_outport, "output port" }, 5269 { is_outport , "output port" },
5853 { is_environment, "environment" }, 5270 { is_environment, "environment" },
5854 { is_pair, "pair" }, 5271 { is_pair , "pair" },
5855 { 0, "pair or '()" }, 5272 { 0 , "pair or '()" },
5856 { is_character, "character" }, 5273 { is_character , "character" },
5857 { is_vector, "vector" }, 5274 { is_vector , "vector" },
5858 { is_number, "number" }, 5275 { is_number , "number" },
5859 { is_integer, "integer" }, 5276 { is_integer , "integer" },
5860 { is_nonneg, "non-negative integer" } 5277 { tst_inonneg , "non-negative integer" }
5861}; 5278};
5862 5279
5863#define TST_NONE 0 5280#define TST_NONE 0 /* TST_NONE used for built-ins, 0 for internal ops */
5864#define TST_ANY "\001" 5281#define TST_ANY "\001"
5865#define TST_STRING "\002" 5282#define TST_STRING "\002"
5866#define TST_SYMBOL "\003" 5283#define TST_SYMBOL "\003"
5867#define TST_PORT "\004" 5284#define TST_PORT "\004"
5868#define TST_INPORT "\005" 5285#define TST_INPORT "\005"
5869#define TST_OUTPORT "\006" 5286#define TST_OUTPORT "\006"
5870#define TST_ENVIRONMENT "\007" 5287#define TST_ENVIRONMENT "\007"
5871#define TST_PAIR "\010" 5288#define TST_PAIR "\010"
5872#define TST_LIST "\011" 5289#define TST_LIST "\011"
5873#define TST_CHAR "\012" 5290#define TST_CHAR "\012"
5874#define TST_VECTOR "\013" 5291#define TST_VECTOR "\013"
5875#define TST_NUMBER "\014" 5292#define TST_NUMBER "\014"
5876#define TST_INTEGER "\015" 5293#define TST_INTEGER "\015"
5877#define TST_NATURAL "\016" 5294#define TST_NATURAL "\016"
5295
5296#define INF_ARG 0xff
5297#define UNNAMED_OP ""
5298
5299static const char opnames[] =
5300#define OP_DEF(func,name,minarity,maxarity,argtest,op) name "\x00"
5301#include "opdefines.h"
5302#undef OP_DEF
5303;
5304
5305static const char *
5306opname (int idx)
5307{
5308 const char *name = opnames;
5309
5310 /* should do this at compile time, but would require external program, right? */
5311 while (idx--)
5312 name += strlen (name) + 1;
5313
5314 return *name ? name : "ILLEGAL";
5315}
5316
5317static const char *
5318procname (pointer x)
5319{
5320 return opname (procnum (x));
5321}
5878 5322
5879typedef struct 5323typedef struct
5880{ 5324{
5881 dispatch_func func; 5325 uint8_t func;
5882 char *name; 5326 /*dispatch_func func;*//*TODO: maybe optionally keep the pointer, for speed? */
5327 uint8_t builtin;
5328#if USE_ERROR_CHECKING
5883 int min_arity; 5329 uint8_t min_arity;
5884 int max_arity; 5330 uint8_t max_arity;
5885 char *arg_tests_encoding; 5331 char arg_tests_encoding[3];
5332#endif
5886} op_code_info; 5333} op_code_info;
5887 5334
5888#define INF_ARG 0xffff
5889
5890static op_code_info dispatch_table[] = { 5335static const op_code_info dispatch_table[] = {
5891#define OP_DEF(A,B,C,D,E,OP) {A,B,C,D,E}, 5336#if USE_ERROR_CHECKING
5337#define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1, minarity, maxarity, argtest },
5338#else
5339#define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1 },
5340#endif
5892#include "opdefines.h" 5341#include "opdefines.h"
5342#undef OP_DEF
5893 {0} 5343 {0}
5894}; 5344};
5895 5345
5896static const char *
5897procname (pointer x)
5898{
5899 int n = procnum (x);
5900 const char *name = dispatch_table[n].name;
5901
5902 if (name == 0)
5903 {
5904 name = "ILLEGAL!";
5905 }
5906
5907 return name;
5908}
5909
5910/* kernel of this interpreter */ 5346/* kernel of this interpreter */
5911static void 5347static void ecb_hot
5912Eval_Cycle (SCHEME_P_ enum scheme_opcodes op) 5348Eval_Cycle (SCHEME_P_ enum scheme_opcodes op)
5913{ 5349{
5914 SCHEME_V->op = op; 5350 SCHEME_V->op = op;
5915 5351
5916 for (;;) 5352 for (;;)
5917 { 5353 {
5918 op_code_info *pcd = dispatch_table + SCHEME_V->op; 5354 const op_code_info *pcd = dispatch_table + SCHEME_V->op;
5919 5355
5356#if USE_ERROR_CHECKING
5920 if (pcd->name != 0) /* if built-in function, check arguments */ 5357 if (pcd->builtin) /* if built-in function, check arguments */
5921 { 5358 {
5922 char msg[STRBUFFSIZE]; 5359 char msg[STRBUFFSIZE];
5923 int ok = 1;
5924 int n = list_length (SCHEME_A_ SCHEME_V->args); 5360 int n = list_length (SCHEME_A_ SCHEME_V->args);
5925 5361
5926#if USE_ERROR_CHECKING
5927 /* Check number of arguments */ 5362 /* Check number of arguments */
5928 if (n < pcd->min_arity) 5363 if (ecb_expect_false (n < pcd->min_arity))
5929 { 5364 {
5930 ok = 0;
5931 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", 5365 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)",
5932 pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity); 5366 opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity);
5367 xError_1 (SCHEME_A_ msg, 0);
5368 continue;
5933 } 5369 }
5934 5370 else if (ecb_expect_false (n > pcd->max_arity && pcd->max_arity != INF_ARG))
5935 if (ok && n > pcd->max_arity)
5936 { 5371 {
5937 ok = 0;
5938 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", 5372 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)",
5939 pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity); 5373 opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity);
5374 xError_1 (SCHEME_A_ msg, 0);
5375 continue;
5940 } 5376 }
5941#endif 5377 else
5942
5943 if (ok)
5944 { 5378 {
5945 if (pcd->arg_tests_encoding != 0) 5379 if (*pcd->arg_tests_encoding) /* literal 0 and TST_NONE treated the same */
5946 { 5380 {
5947 int i = 0; 5381 int i = 0;
5948 int j; 5382 int j;
5949 const char *t = pcd->arg_tests_encoding; 5383 const char *t = pcd->arg_tests_encoding;
5950 pointer arglist = SCHEME_V->args; 5384 pointer arglist = SCHEME_V->args;
5951 5385
5952 do 5386 do
5953 { 5387 {
5954 pointer arg = car (arglist); 5388 pointer arg = car (arglist);
5955 5389
5956 j = (int) t[0]; 5390 j = t[0];
5957 5391
5392 /*TODO: tst_is_list has different prototype - fix if other tests acquire same prototype */
5958 if (j == TST_LIST[0]) 5393 if (j == TST_LIST[0])
5959 { 5394 {
5960 if (arg != NIL && !is_pair (arg)) 5395 if (!tst_is_list (SCHEME_A_ arg))
5961 break; 5396 break;
5962 } 5397 }
5963 else 5398 else
5964 { 5399 {
5965 if (!tests[j].fct (arg)) 5400 if (!tests[j - 1].fct (arg))
5966 break; 5401 break;
5967 } 5402 }
5968 5403
5969 if (t[1] != 0) /* last test is replicated as necessary */ 5404 if (t < pcd->arg_tests_encoding + sizeof (pcd->arg_tests_encoding) - 1 && t[1]) /* last test is replicated as necessary */
5970 {
5971 t++; 5405 t++;
5972 }
5973 5406
5974 arglist = cdr (arglist); 5407 arglist = cdr (arglist);
5975 i++; 5408 i++;
5976 } 5409 }
5977 while (i < n); 5410 while (i < n);
5978 5411
5979#if USE_ERROR_CHECKING
5980 if (i < n) 5412 if (i < n)
5981 { 5413 {
5982 ok = 0;
5983 snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", pcd->name, i + 1, tests[j].kind); 5414 snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", opname (SCHEME_V->op), i + 1, tests[j].kind);
5415 xError_1 (SCHEME_A_ msg, 0);
5416 continue;
5984 } 5417 }
5985#endif
5986 } 5418 }
5987 } 5419 }
5988
5989 if (!ok)
5990 {
5991 if (xError_1 (SCHEME_A_ msg, 0) == NIL)
5992 return;
5993
5994 pcd = dispatch_table + SCHEME_V->op;
5995 }
5996 } 5420 }
5421#endif
5997 5422
5998 ok_to_freely_gc (SCHEME_A); 5423 ok_to_freely_gc (SCHEME_A);
5999 5424
6000 if (pcd->func (SCHEME_A_ (enum scheme_opcodes) SCHEME_V->op) == NIL) 5425 static const dispatch_func dispatch_funcs[] = {
5426 opexe_0,
5427 opexe_1,
5428 opexe_2,
5429 opexe_3,
5430 opexe_4,
5431 opexe_5,
5432 opexe_6,
5433 };
5434
5435 if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0))
6001 return; 5436 return;
6002 5437
6003#if USE_ERROR_CHECKING 5438 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
6004 if (SCHEME_V->no_memory)
6005 { 5439 {
6006 xwrstr ("No memory!\n"); 5440 xwrstr ("No memory!\n");
6007 return; 5441 return;
6008 } 5442 }
6009#endif
6010 } 5443 }
6011} 5444}
6012 5445
6013/* ========== Initialization of internal keywords ========== */ 5446/* ========== Initialization of internal keywords ========== */
6014 5447
6015static void 5448static void
6016assign_syntax (SCHEME_P_ char *name) 5449assign_syntax (SCHEME_P_ const char *name)
6017{ 5450{
6018 pointer x = oblist_add_by_name (SCHEME_A_ name); 5451 pointer x = oblist_add_by_name (SCHEME_A_ name);
6019 set_typeflag (x, typeflag (x) | T_SYNTAX); 5452 set_typeflag (x, typeflag (x) | T_SYNTAX);
6020} 5453}
6021 5454
6022static void 5455static void
6023assign_proc (SCHEME_P_ enum scheme_opcodes op, char *name) 5456assign_proc (SCHEME_P_ enum scheme_opcodes op, const char *name)
6024{ 5457{
6025 pointer x = mk_symbol (SCHEME_A_ name); 5458 pointer x = mk_symbol (SCHEME_A_ name);
6026 pointer y = mk_proc (SCHEME_A_ op); 5459 pointer y = mk_proc (SCHEME_A_ op);
6027 new_slot_in_env (SCHEME_A_ x, y); 5460 new_slot_in_env (SCHEME_A_ x, y);
6028} 5461}
… …
6030static pointer 5463static pointer
6031mk_proc (SCHEME_P_ enum scheme_opcodes op) 5464mk_proc (SCHEME_P_ enum scheme_opcodes op)
6032{ 5465{
6033 pointer y = get_cell (SCHEME_A_ NIL, NIL); 5466 pointer y = get_cell (SCHEME_A_ NIL, NIL);
6034 set_typeflag (y, (T_PROC | T_ATOM)); 5467 set_typeflag (y, (T_PROC | T_ATOM));
6035 ivalue_unchecked (y) = (long) op; 5468 ivalue_unchecked (y) = op;
6036 set_num_integer (y);
6037 return y; 5469 return y;
6038} 5470}
6039 5471
6040/* Hard-coded for the given keywords. Remember to rewrite if more are added! */ 5472/* Hard-coded for the given keywords. Remember to rewrite if more are added! */
6041static int 5473static int
… …
6065 5497
6066 case 'd': 5498 case 'd':
6067 return OP_COND0; /* cond */ 5499 return OP_COND0; /* cond */
6068 5500
6069 case '*': 5501 case '*':
6070 return OP_LET0AST; /* let* */ 5502 return OP_LET0AST;/* let* */
6071 5503
6072 default: 5504 default:
6073 return OP_SET0; /* set! */ 5505 return OP_SET0; /* set! */
6074 } 5506 }
6075 5507
… …
6097 5529
6098 case 'f': 5530 case 'f':
6099 return OP_DEF0; /* define */ 5531 return OP_DEF0; /* define */
6100 5532
6101 default: 5533 default:
6102 return OP_LET0REC; /* letrec */ 5534 return OP_LET0REC;/* letrec */
6103 } 5535 }
6104 5536
6105 default: 5537 default:
6106 return OP_C0STREAM; /* cons-stream */ 5538 return OP_C0STREAM; /* cons-stream */
6107 } 5539 }
6108} 5540}
6109 5541
6110#if USE_MULTIPLICITY 5542#if USE_MULTIPLICITY
6111scheme * 5543ecb_cold scheme *
6112scheme_init_new () 5544scheme_init_new ()
6113{ 5545{
6114 scheme *sc = malloc (sizeof (scheme)); 5546 scheme *sc = malloc (sizeof (scheme));
6115 5547
6116 if (!scheme_init (SCHEME_A)) 5548 if (!scheme_init (SCHEME_A))
… …
6121 else 5553 else
6122 return sc; 5554 return sc;
6123} 5555}
6124#endif 5556#endif
6125 5557
6126int 5558ecb_cold int
6127scheme_init (SCHEME_P) 5559scheme_init (SCHEME_P)
6128{ 5560{
6129 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]); 5561 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]);
6130 pointer x; 5562 pointer x;
6131 5563
… …
6158 } 5590 }
6159 5591
6160 SCHEME_V->gc_verbose = 0; 5592 SCHEME_V->gc_verbose = 0;
6161 dump_stack_initialize (SCHEME_A); 5593 dump_stack_initialize (SCHEME_A);
6162 SCHEME_V->code = NIL; 5594 SCHEME_V->code = NIL;
5595 SCHEME_V->args = NIL;
5596 SCHEME_V->envir = NIL;
6163 SCHEME_V->tracing = 0; 5597 SCHEME_V->tracing = 0;
6164 5598
6165 /* init NIL */ 5599 /* init NIL */
6166 set_typeflag (NIL, T_ATOM | MARK); 5600 set_typeflag (NIL, T_ATOM | T_MARK);
6167 set_car (NIL, NIL); 5601 set_car (NIL, NIL);
6168 set_cdr (NIL, NIL); 5602 set_cdr (NIL, NIL);
6169 /* init T */ 5603 /* init T */
6170 set_typeflag (S_T, T_ATOM | MARK); 5604 set_typeflag (S_T, T_ATOM | T_MARK);
6171 set_car (S_T, S_T); 5605 set_car (S_T, S_T);
6172 set_cdr (S_T, S_T); 5606 set_cdr (S_T, S_T);
6173 /* init F */ 5607 /* init F */
6174 set_typeflag (S_F, T_ATOM | MARK); 5608 set_typeflag (S_F, T_ATOM | T_MARK);
6175 set_car (S_F, S_F); 5609 set_car (S_F, S_F);
6176 set_cdr (S_F, S_F); 5610 set_cdr (S_F, S_F);
5611 /* init EOF_OBJ */
5612 set_typeflag (S_EOF, T_ATOM | T_MARK);
5613 set_car (S_EOF, S_EOF);
5614 set_cdr (S_EOF, S_EOF);
6177 /* init sink */ 5615 /* init sink */
6178 set_typeflag (S_SINK, T_PAIR | MARK); 5616 set_typeflag (S_SINK, T_PAIR | T_MARK);
6179 set_car (S_SINK, NIL); 5617 set_car (S_SINK, NIL);
5618
6180 /* init c_nest */ 5619 /* init c_nest */
6181 SCHEME_V->c_nest = NIL; 5620 SCHEME_V->c_nest = NIL;
6182 5621
6183 SCHEME_V->oblist = oblist_initial_value (SCHEME_A); 5622 SCHEME_V->oblist = oblist_initial_value (SCHEME_A);
6184 /* init global_env */ 5623 /* init global_env */
… …
6186 SCHEME_V->global_env = SCHEME_V->envir; 5625 SCHEME_V->global_env = SCHEME_V->envir;
6187 /* init else */ 5626 /* init else */
6188 x = mk_symbol (SCHEME_A_ "else"); 5627 x = mk_symbol (SCHEME_A_ "else");
6189 new_slot_in_env (SCHEME_A_ x, S_T); 5628 new_slot_in_env (SCHEME_A_ x, S_T);
6190 5629
6191 assign_syntax (SCHEME_A_ "lambda"); 5630 {
6192 assign_syntax (SCHEME_A_ "quote"); 5631 static const char *syntax_names[] = {
6193 assign_syntax (SCHEME_A_ "define"); 5632 "lambda", "quote", "define", "if", "begin", "set!",
6194 assign_syntax (SCHEME_A_ "if"); 5633 "let", "let*", "letrec", "cond", "delay", "and",
6195 assign_syntax (SCHEME_A_ "begin"); 5634 "or", "cons-stream", "macro", "case"
6196 assign_syntax (SCHEME_A_ "set!"); 5635 };
6197 assign_syntax (SCHEME_A_ "let"); 5636
6198 assign_syntax (SCHEME_A_ "let*"); 5637 for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i)
6199 assign_syntax (SCHEME_A_ "letrec");
6200 assign_syntax (SCHEME_A_ "cond");
6201 assign_syntax (SCHEME_A_ "delay");
6202 assign_syntax (SCHEME_A_ "and"); 5638 assign_syntax (SCHEME_A_ syntax_names[i]);
6203 assign_syntax (SCHEME_A_ "or"); 5639 }
6204 assign_syntax (SCHEME_A_ "cons-stream");
6205 assign_syntax (SCHEME_A_ "macro");
6206 assign_syntax (SCHEME_A_ "case");
6207 5640
5641 // TODO: should iterate via strlen, to avoid n² complexity
6208 for (i = 0; i < n; i++) 5642 for (i = 0; i < n; i++)
6209 {
6210 if (dispatch_table[i].name != 0) 5643 if (dispatch_table[i].builtin)
6211 { 5644 assign_proc (SCHEME_A_ i, opname (i));
6212 assign_proc (SCHEME_A_ (enum scheme_opcodes) i, dispatch_table[i].name);
6213 }
6214 }
6215 5645
6216 /* initialization of global pointers to special symbols */ 5646 /* initialization of global pointers to special symbols */
6217 SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda"); 5647 SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda");
6218 SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote"); 5648 SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote");
6219 SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote"); 5649 SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote");
6220 SCHEME_V->UNQUOTE = mk_symbol (SCHEME_A_ "unquote"); 5650 SCHEME_V->UNQUOTE = mk_symbol (SCHEME_A_ "unquote");
6221 SCHEME_V->UNQUOTESP = mk_symbol (SCHEME_A_ "unquote-splicing"); 5651 SCHEME_V->UNQUOTESP = mk_symbol (SCHEME_A_ "unquote-splicing");
6222 SCHEME_V->FEED_TO = mk_symbol (SCHEME_A_ "=>"); 5652 SCHEME_V->FEED_TO = mk_symbol (SCHEME_A_ "=>");
6223 SCHEME_V->COLON_HOOK = mk_symbol (SCHEME_A_ "*colon-hook*"); 5653 SCHEME_V->COLON_HOOK = mk_symbol (SCHEME_A_ "*colon-hook*");
6224 SCHEME_V->ERROR_HOOK = mk_symbol (SCHEME_A_ "*error-hook*"); 5654 SCHEME_V->ERROR_HOOK = mk_symbol (SCHEME_A_ "*error-hook*");
6225 SCHEME_V->SHARP_HOOK = mk_symbol (SCHEME_A_ "*sharp-hook*"); 5655 SCHEME_V->SHARP_HOOK = mk_symbol (SCHEME_A_ "*sharp-hook*");
6226 SCHEME_V->COMPILE_HOOK = mk_symbol (SCHEME_A_ "*compile-hook*"); 5656 SCHEME_V->COMPILE_HOOK = mk_symbol (SCHEME_A_ "*compile-hook*");
6227 5657
6228 return !SCHEME_V->no_memory; 5658 return !SCHEME_V->no_memory;
6229} 5659}
6230 5660
… …
6258scheme_set_external_data (SCHEME_P_ void *p) 5688scheme_set_external_data (SCHEME_P_ void *p)
6259{ 5689{
6260 SCHEME_V->ext_data = p; 5690 SCHEME_V->ext_data = p;
6261} 5691}
6262 5692
6263void 5693ecb_cold void
6264scheme_deinit (SCHEME_P) 5694scheme_deinit (SCHEME_P)
6265{ 5695{
6266 int i; 5696 int i;
6267 5697
6268#if SHOW_ERROR_LINE 5698#if SHOW_ERROR_LINE
… …
6360{ 5790{
6361 dump_stack_reset (SCHEME_A); 5791 dump_stack_reset (SCHEME_A);
6362 SCHEME_V->envir = SCHEME_V->global_env; 5792 SCHEME_V->envir = SCHEME_V->global_env;
6363 SCHEME_V->file_i = 0; 5793 SCHEME_V->file_i = 0;
6364 SCHEME_V->load_stack[0].kind = port_input | port_string; 5794 SCHEME_V->load_stack[0].kind = port_input | port_string;
6365 SCHEME_V->load_stack[0].rep.string.start = (char *) cmd; /* This func respects const */ 5795 SCHEME_V->load_stack[0].rep.string.start = (char *)cmd; /* This func respects const */
6366 SCHEME_V->load_stack[0].rep.string.past_the_end = (char *) cmd + strlen (cmd); 5796 SCHEME_V->load_stack[0].rep.string.past_the_end = (char *)cmd + strlen (cmd);
6367 SCHEME_V->load_stack[0].rep.string.curr = (char *) cmd; 5797 SCHEME_V->load_stack[0].rep.string.curr = (char *)cmd;
6368#if USE_PORTS 5798#if USE_PORTS
6369 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack); 5799 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack);
6370#endif 5800#endif
6371 SCHEME_V->retcode = 0; 5801 SCHEME_V->retcode = 0;
6372 SCHEME_V->interactive_repl = 0; 5802 SCHEME_V->interactive_repl = 0;
… …
6385 pointer x; 5815 pointer x;
6386 5816
6387 x = find_slot_in_env (SCHEME_A_ envir, symbol, 0); 5817 x = find_slot_in_env (SCHEME_A_ envir, symbol, 0);
6388 5818
6389 if (x != NIL) 5819 if (x != NIL)
6390 {
6391 set_slot_in_env (SCHEME_A_ x, value); 5820 set_slot_in_env (SCHEME_A_ x, value);
6392 }
6393 else 5821 else
6394 {
6395 new_slot_spec_in_env (SCHEME_A_ envir, symbol, value); 5822 new_slot_spec_in_env (SCHEME_A_ envir, symbol, value);
6396 }
6397} 5823}
6398 5824
6399#if !STANDALONE 5825#if !STANDALONE
5826
6400void 5827void
6401scheme_register_foreign_func (scheme * sc, scheme_registerable * sr) 5828scheme_register_foreign_func (scheme * sc, scheme_registerable * sr)
6402{ 5829{
6403 scheme_define (SCHEME_A_ SCHEME_V->global_env, mk_symbol (SCHEME_A_ sr->name), mk_foreign_func (SCHEME_A_ sr->f)); 5830 scheme_define (SCHEME_A_ SCHEME_V->global_env, mk_symbol (SCHEME_A_ sr->name), mk_foreign_func (SCHEME_A_ sr->f));
6404} 5831}
… …
6407scheme_register_foreign_func_list (scheme * sc, scheme_registerable * list, int count) 5834scheme_register_foreign_func_list (scheme * sc, scheme_registerable * list, int count)
6408{ 5835{
6409 int i; 5836 int i;
6410 5837
6411 for (i = 0; i < count; i++) 5838 for (i = 0; i < count; i++)
6412 {
6413 scheme_register_foreign_func (SCHEME_A_ list + i); 5839 scheme_register_foreign_func (SCHEME_A_ list + i);
6414 }
6415} 5840}
6416 5841
6417pointer 5842pointer
6418scheme_apply0 (SCHEME_P_ const char *procname) 5843scheme_apply0 (SCHEME_P_ const char *procname)
6419{ 5844{
… …
6476 SCHEME_V->interactive_repl = old_repl; 5901 SCHEME_V->interactive_repl = old_repl;
6477 restore_from_C_call (SCHEME_A); 5902 restore_from_C_call (SCHEME_A);
6478 return SCHEME_V->value; 5903 return SCHEME_V->value;
6479} 5904}
6480 5905
6481
6482#endif 5906#endif
6483 5907
6484/* ========== Main ========== */ 5908/* ========== Main ========== */
6485 5909
6486#if STANDALONE 5910#if STANDALONE
6487 5911
6488# if defined(__APPLE__) && !defined (OSX)
6489int
6490main ()
6491{
6492 extern MacTS_main (int argc, char **argv);
6493 char **argv;
6494 int argc = ccommand (&argv);
6495
6496 MacTS_main (argc, argv);
6497 return 0;
6498}
6499
6500int
6501MacTS_main (int argc, char **argv)
6502{
6503# else
6504int 5912int
6505main (int argc, char **argv) 5913main (int argc, char **argv)
6506{ 5914{
6507# endif
6508# if USE_MULTIPLICITY 5915# if USE_MULTIPLICITY
6509 scheme ssc; 5916 scheme ssc;
6510 scheme *const sc = &ssc; 5917 scheme *const SCHEME_V = &ssc;
6511# else 5918# else
6512# endif 5919# endif
6513 int fin; 5920 int fin;
6514 char *file_name = InitFile; 5921 char *file_name = InitFile;
6515 int retcode; 5922 int retcode;
6516 int isfile = 1; 5923 int isfile = 1;
6517
6518 if (argc == 1)
6519 xwrstr (banner);
6520 5924
6521 if (argc == 2 && strcmp (argv[1], "-?") == 0) 5925 if (argc == 2 && strcmp (argv[1], "-?") == 0)
6522 { 5926 {
6523 xwrstr ("Usage: tinyscheme -?\n"); 5927 xwrstr ("Usage: tinyscheme -?\n");
6524 xwrstr ("or: tinyscheme [<file1> <file2> ...]\n"); 5928 xwrstr ("or: tinyscheme [<file1> <file2> ...]\n");
… …
6547 if (access (file_name, 0) != 0) 5951 if (access (file_name, 0) != 0)
6548 { 5952 {
6549 char *p = getenv ("TINYSCHEMEINIT"); 5953 char *p = getenv ("TINYSCHEMEINIT");
6550 5954
6551 if (p != 0) 5955 if (p != 0)
6552 {
6553 file_name = p; 5956 file_name = p;
6554 }
6555 } 5957 }
6556#endif 5958#endif
6557 5959
6558 do 5960 do
6559 { 5961 {

Diff Legend

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