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

Comparing microscheme/scheme.c (file contents):
Revision 1.12 by root, Thu Nov 26 07:30:25 2015 UTC vs.
Revision 1.35 by root, Sun Nov 29 00:02:21 2015 UTC

… …
28#endif 28#endif
29#if USE_MATH 29#if USE_MATH
30# include <math.h> 30# include <math.h>
31#endif 31#endif
32 32
33#include "ecb.h"
34
33#include <sys/types.h> 35#include <sys/types.h>
34#include <sys/stat.h> 36#include <sys/stat.h>
35#include <fcntl.h> 37#include <fcntl.h>
36 38
39#if !USE_ERROR_CHECKING
40# define NDEBUG
41#endif
42
43#include <assert.h>
44#include <stdlib.h>
37#include <string.h> 45#include <string.h>
38#include <stdlib.h>
39 46
40#include <limits.h> 47#include <limits.h>
41#include <inttypes.h> 48#include <inttypes.h>
42#include <float.h> 49#include <float.h>
43//#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
44 59
45enum { 60enum {
46 TOK_EOF, 61 TOK_EOF,
47 TOK_LPAREN, 62 TOK_LPAREN,
48 TOK_RPAREN, 63 TOK_RPAREN,
49 TOK_DOT, 64 TOK_DOT,
50 TOK_ATOM, 65 TOK_ATOM,
66 TOK_DOTATOM, /* atom name starting with '.' */
67 TOK_STRATOM, /* atom name enclosed in | */
51 TOK_QUOTE, 68 TOK_QUOTE,
52 TOK_DQUOTE, 69 TOK_DQUOTE,
53 TOK_BQUOTE, 70 TOK_BQUOTE,
54 TOK_COMMA, 71 TOK_COMMA,
55 TOK_ATMARK, 72 TOK_ATMARK,
… …
65#define S_T (&SCHEME_V->xT) //TODO: magic ptr value? 82#define S_T (&SCHEME_V->xT) //TODO: magic ptr value?
66#define S_F (&SCHEME_V->xF) //TODO: magic ptr value? 83#define S_F (&SCHEME_V->xF) //TODO: magic ptr value?
67#define S_SINK (&SCHEME_V->xsink) 84#define S_SINK (&SCHEME_V->xsink)
68#define S_EOF (&SCHEME_V->xEOF_OBJ) 85#define S_EOF (&SCHEME_V->xEOF_OBJ)
69 86
70/* should use libecb */
71#if __GNUC__ >= 4
72# define ecb_expect(expr,value) __builtin_expect ((expr),(value))
73# define ecb_expect_false(expr) ecb_expect (!!(expr), 0)
74# define ecb_expect_true(expr) ecb_expect (!!(expr), 1)
75#endif
76
77#if !USE_MULTIPLICITY 87#if !USE_MULTIPLICITY
78static scheme sc; 88static scheme sc;
79#endif 89#endif
80 90
81static void 91static void
… …
150 160
151#define toupper(c) xtoupper (c) 161#define toupper(c) xtoupper (c)
152#define tolower(c) xtolower (c) 162#define tolower(c) xtolower (c)
153#define isdigit(c) xisdigit (c) 163#define isdigit(c) xisdigit (c)
154 164
155#if USE_STRLWR 165#if USE_IGNORECASE
156static const char * 166static const char *
157strlwr (char *s) 167xstrlwr (char *s)
158{ 168{
159 const char *p = s; 169 const char *p = s;
160 170
161 while (*s) 171 while (*s)
162 { 172 {
… …
164 s++; 174 s++;
165 } 175 }
166 176
167 return p; 177 return p;
168} 178}
169#endif
170 179
180#define stricmp(a,b) strcasecmp (a, b)
181#define strlwr(s) xstrlwr (s)
182
183#else
171#define stricmp(a,b) strcmp (a, b) 184# define stricmp(a,b) strcmp (a, b)
172#define strlwr(s) (s) 185# define strlwr(s) (s)
186#endif
173 187
174#ifndef prompt 188#ifndef prompt
175# define prompt "ts> " 189# define prompt "ts> "
176#endif 190#endif
177 191
… …
183# define FIRST_CELLSEGS 3 197# define FIRST_CELLSEGS 3
184#endif 198#endif
185 199
186enum scheme_types 200enum scheme_types
187{ 201{
202 T_INTEGER,
188 T_FREE, 203 T_REAL,
189 T_STRING, 204 T_STRING,
190 T_NUMBER,
191 T_SYMBOL, 205 T_SYMBOL,
192 T_PROC, 206 T_PROC,
193 T_PAIR, 207 T_PAIR, /* also used for free cells */
194 T_CLOSURE, 208 T_CLOSURE,
195 T_CONTINUATION, 209 T_CONTINUATION,
196 T_FOREIGN, 210 T_FOREIGN,
197 T_CHARACTER, 211 T_CHARACTER,
198 T_PORT, 212 T_PORT,
… …
208#define T_SYNTAX 0x0010 222#define T_SYNTAX 0x0010
209#define T_IMMUTABLE 0x0020 223#define T_IMMUTABLE 0x0020
210#define T_ATOM 0x0040 /* only for gc */ 224#define T_ATOM 0x0040 /* only for gc */
211#define T_MARK 0x0080 /* only for gc */ 225#define T_MARK 0x0080 /* only for gc */
212 226
213static num num_add (num a, num b); 227/* num, for generic arithmetic */
214static num num_mul (num a, num b); 228struct num
215static num num_div (num a, num b); 229{
230 IVALUE ivalue;
231#if USE_REAL
232 RVALUE rvalue;
233 char is_fixnum;
234#endif
235};
236
237#if USE_REAL
238# define num_is_fixnum(n) (n).is_fixnum
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);
216static num num_intdiv (num a, num b); 256static num num_intdiv (num a, num b);
217static num num_sub (num a, num b);
218static num num_rem (num a, num b); 257static num num_rem (num a, num b);
219static num num_mod (num a, num b); 258static num num_mod (num a, num b);
220static int num_eq (num a, num b);
221static int num_gt (num a, num b);
222static int num_ge (num a, num b);
223static int num_lt (num a, num b);
224static int num_le (num a, num b);
225 259
226#if USE_MATH 260#if USE_MATH
227static double round_per_R5RS (double x); 261static double round_per_R5RS (double x);
228#endif 262#endif
229static int is_zero_rvalue (RVALUE x); 263static int is_zero_rvalue (RVALUE x);
230
231static INLINE int
232num_is_integer (pointer p)
233{
234 return num_is_fixnum (p->object.number);
235}
236 264
237static num num_zero; 265static num num_zero;
238static num num_one; 266static num num_one;
239 267
240/* macros for cell operations */ 268/* macros for cell operations */
241#define typeflag(p) ((p)->flag + 0) 269#define typeflag(p) ((p)->flag + 0)
242#define set_typeflag(p,v) ((p)->flag = (v)) 270#define set_typeflag(p,v) ((p)->flag = (v))
243#define type(p) (typeflag (p) & T_MASKTYPE) 271#define type(p) (typeflag (p) & T_MASKTYPE)
244 272
245INTERFACE INLINE int 273INTERFACE int
246is_string (pointer p) 274is_string (pointer p)
247{ 275{
248 return type (p) == T_STRING; 276 return type (p) == T_STRING;
249} 277}
250 278
251#define strvalue(p) ((p)->object.string.svalue) 279#define strvalue(p) ((p)->object.string.svalue)
252#define strlength(p) ((p)->object.string.length) 280#define strlength(p) ((p)->object.string.length)
253 281
254INTERFACE int is_list (SCHEME_P_ pointer p);
255INTERFACE INLINE int 282INTERFACE int
256is_vector (pointer p) 283is_vector (pointer p)
257{ 284{
258 return type (p) == T_VECTOR; 285 return type (p) == T_VECTOR;
259} 286}
260 287
261#define vecvalue(p) ((p)->object.vector.vvalue) 288#define vecvalue(p) ((p)->object.vector.vvalue)
262#define veclength(p) ((p)->object.vector.length) 289#define veclength(p) ((p)->object.vector.length)
263INTERFACE void fill_vector (pointer vec, pointer obj); 290INTERFACE void fill_vector (pointer vec, uint32_t start, pointer obj);
264INTERFACE uint32_t vector_length (pointer vec);
265INTERFACE pointer vector_elem (pointer vec, uint32_t ielem); 291INTERFACE pointer vector_get (pointer vec, uint32_t ielem);
266INTERFACE void set_vector_elem (pointer vec, uint32_t ielem, pointer a); 292INTERFACE void vector_set (pointer vec, uint32_t ielem, pointer a);
267 293
268INTERFACE uint32_t 294INTERFACE int
269vector_length (pointer vec) 295is_integer (pointer p)
270{ 296{
271 return vec->object.vector.length; 297 return type (p) == T_INTEGER;
272} 298}
273 299
300/* not the same as in scheme, where integers are (correctly :) reals */
274INTERFACE INLINE int 301INTERFACE int
302is_real (pointer p)
303{
304 return type (p) == T_REAL;
305}
306
307INTERFACE int
275is_number (pointer p) 308is_number (pointer p)
276{ 309{
277 return type (p) == T_NUMBER; 310 return is_integer (p) || is_real (p);
278} 311}
279 312
280INTERFACE INLINE int 313INTERFACE int
281is_integer (pointer p)
282{
283 if (!is_number (p))
284 return 0;
285
286 if (num_is_integer (p) || ivalue (p) == rvalue (p))
287 return 1;
288
289 return 0;
290}
291
292INTERFACE INLINE int
293is_real (pointer p)
294{
295 return is_number (p) && !num_is_fixnum (p->object.number);
296}
297
298INTERFACE INLINE int
299is_character (pointer p) 314is_character (pointer p)
300{ 315{
301 return type (p) == T_CHARACTER; 316 return type (p) == T_CHARACTER;
302} 317}
303 318
304INTERFACE INLINE char * 319INTERFACE char *
305string_value (pointer p) 320string_value (pointer p)
306{ 321{
307 return strvalue (p); 322 return strvalue (p);
308} 323}
309 324
310INLINE num
311nvalue (pointer p)
312{
313 return (p)->object.number;
314}
315
316static IVALUE
317num_get_ivalue (const num n)
318{
319 return num_is_fixnum (n) ? num_ivalue (n) : (IVALUE)num_rvalue (n);
320}
321
322static RVALUE
323num_get_rvalue (const num n)
324{
325 return num_is_fixnum (n) ? (RVALUE)num_ivalue (n) : num_rvalue (n);
326}
327
328INTERFACE IVALUE
329ivalue (pointer p)
330{
331 return num_get_ivalue (p->object.number);
332}
333
334INTERFACE RVALUE
335rvalue (pointer p)
336{
337 return num_get_rvalue (p->object.number);
338}
339
340#define ivalue_unchecked(p) ((p)->object.number.value.ivalue) 325#define ivalue_unchecked(p) (p)->object.ivalue
326#define set_ivalue(p,v) (p)->object.ivalue = (v)
327
341#if USE_REAL 328#if USE_REAL
342# define rvalue_unchecked(p) ((p)->object.number.value.rvalue) 329#define rvalue_unchecked(p) (p)->object.rvalue
343# define set_num_integer(p) (p)->object.number.is_fixnum=1; 330#define set_rvalue(p,v) (p)->object.rvalue = (v)
344# define set_num_real(p) (p)->object.number.is_fixnum=0;
345#else 331#else
346# define rvalue_unchecked(p) ((p)->object.number.value.ivalue) 332#define rvalue_unchecked(p) (p)->object.ivalue
347# define set_num_integer(p) 0 333#define set_rvalue(p,v) (p)->object.ivalue = (v)
348# define set_num_real(p) 0
349#endif 334#endif
335
350INTERFACE long 336INTERFACE long
351charvalue (pointer p) 337charvalue (pointer p)
352{ 338{
353 return ivalue_unchecked (p); 339 return ivalue_unchecked (p);
354} 340}
355 341
356INTERFACE INLINE int 342INTERFACE int
357is_port (pointer p) 343is_port (pointer p)
358{ 344{
359 return type (p) == T_PORT; 345 return type (p) == T_PORT;
360} 346}
361 347
362INTERFACE INLINE int 348INTERFACE int
363is_inport (pointer p) 349is_inport (pointer p)
364{ 350{
365 return is_port (p) && p->object.port->kind & port_input; 351 return is_port (p) && p->object.port->kind & port_input;
366} 352}
367 353
368INTERFACE INLINE int 354INTERFACE int
369is_outport (pointer p) 355is_outport (pointer p)
370{ 356{
371 return is_port (p) && p->object.port->kind & port_output; 357 return is_port (p) && p->object.port->kind & port_output;
372} 358}
373 359
374INTERFACE INLINE int 360INTERFACE int
375is_pair (pointer p) 361is_pair (pointer p)
376{ 362{
377 return type (p) == T_PAIR; 363 return type (p) == T_PAIR;
378} 364}
379 365
… …
411pair_cdr (pointer p) 397pair_cdr (pointer p)
412{ 398{
413 return cdr (p); 399 return cdr (p);
414} 400}
415 401
416INTERFACE INLINE int 402INTERFACE int
417is_symbol (pointer p) 403is_symbol (pointer p)
418{ 404{
419 return type (p) == T_SYMBOL; 405 return type (p) == T_SYMBOL;
420} 406}
421 407
422INTERFACE INLINE char * 408INTERFACE char *
423symname (pointer p) 409symname (pointer p)
424{ 410{
425 return strvalue (car (p)); 411 return strvalue (car (p));
426} 412}
427 413
428#if USE_PLIST 414#if USE_PLIST
429SCHEME_EXPORT INLINE int 415SCHEME_EXPORT int
430hasprop (pointer p) 416hasprop (pointer p)
431{ 417{
432 return typeflag (p) & T_SYMBOL; 418 return typeflag (p) & T_SYMBOL;
433} 419}
434 420
435# define symprop(p) cdr(p) 421# define symprop(p) cdr(p)
436#endif 422#endif
437 423
438INTERFACE INLINE int 424INTERFACE int
439is_syntax (pointer p) 425is_syntax (pointer p)
440{ 426{
441 return typeflag (p) & T_SYNTAX; 427 return typeflag (p) & T_SYNTAX;
442} 428}
443 429
444INTERFACE INLINE int 430INTERFACE int
445is_proc (pointer p) 431is_proc (pointer p)
446{ 432{
447 return type (p) == T_PROC; 433 return type (p) == T_PROC;
448} 434}
449 435
450INTERFACE INLINE int 436INTERFACE int
451is_foreign (pointer p) 437is_foreign (pointer p)
452{ 438{
453 return type (p) == T_FOREIGN; 439 return type (p) == T_FOREIGN;
454} 440}
455 441
456INTERFACE INLINE char * 442INTERFACE char *
457syntaxname (pointer p) 443syntaxname (pointer p)
458{ 444{
459 return strvalue (car (p)); 445 return strvalue (car (p));
460} 446}
461 447
462#define procnum(p) ivalue (p) 448#define procnum(p) ivalue_unchecked (p)
463static const char *procname (pointer x); 449static const char *procname (pointer x);
464 450
465INTERFACE INLINE int 451INTERFACE int
466is_closure (pointer p) 452is_closure (pointer p)
467{ 453{
468 return type (p) == T_CLOSURE; 454 return type (p) == T_CLOSURE;
469} 455}
470 456
471INTERFACE INLINE int 457INTERFACE int
472is_macro (pointer p) 458is_macro (pointer p)
473{ 459{
474 return type (p) == T_MACRO; 460 return type (p) == T_MACRO;
475} 461}
476 462
477INTERFACE INLINE pointer 463INTERFACE pointer
478closure_code (pointer p) 464closure_code (pointer p)
479{ 465{
480 return car (p); 466 return car (p);
481} 467}
482 468
483INTERFACE INLINE pointer 469INTERFACE pointer
484closure_env (pointer p) 470closure_env (pointer p)
485{ 471{
486 return cdr (p); 472 return cdr (p);
487} 473}
488 474
489INTERFACE INLINE int 475INTERFACE int
490is_continuation (pointer p) 476is_continuation (pointer p)
491{ 477{
492 return type (p) == T_CONTINUATION; 478 return type (p) == T_CONTINUATION;
493} 479}
494 480
495#define cont_dump(p) cdr (p) 481#define cont_dump(p) cdr (p)
496#define set_cont_dump(p,v) set_cdr ((p), (v)) 482#define set_cont_dump(p,v) set_cdr ((p), (v))
497 483
498/* To do: promise should be forced ONCE only */ 484/* To do: promise should be forced ONCE only */
499INTERFACE INLINE int 485INTERFACE int
500is_promise (pointer p) 486is_promise (pointer p)
501{ 487{
502 return type (p) == T_PROMISE; 488 return type (p) == T_PROMISE;
503} 489}
504 490
505INTERFACE INLINE int 491INTERFACE int
506is_environment (pointer p) 492is_environment (pointer p)
507{ 493{
508 return type (p) == T_ENVIRONMENT; 494 return type (p) == T_ENVIRONMENT;
509} 495}
510 496
… …
516 502
517#define is_mark(p) (typeflag (p) & T_MARK) 503#define is_mark(p) (typeflag (p) & T_MARK)
518#define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK) 504#define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK)
519#define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK) 505#define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK)
520 506
521INTERFACE INLINE int 507INTERFACE int
522is_immutable (pointer p) 508is_immutable (pointer p)
523{ 509{
524 return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING; 510 return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING;
525} 511}
526 512
527INTERFACE INLINE void 513INTERFACE void
528setimmutable (pointer p) 514setimmutable (pointer p)
529{ 515{
530#if USE_ERROR_CHECKING 516#if USE_ERROR_CHECKING
531 set_typeflag (p, typeflag (p) | T_IMMUTABLE); 517 set_typeflag (p, typeflag (p) | T_IMMUTABLE);
532#endif 518#endif
533} 519}
534 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;
573}
574
535#if USE_CHAR_CLASSIFIERS 575#if USE_CHAR_CLASSIFIERS
536static INLINE int 576ecb_inline int
537Cisalpha (int c) 577Cisalpha (int c)
538{ 578{
539 return isascii (c) && isalpha (c); 579 return isascii (c) && isalpha (c);
540} 580}
541 581
542static INLINE int 582ecb_inline int
543Cisdigit (int c) 583Cisdigit (int c)
544{ 584{
545 return isascii (c) && isdigit (c); 585 return isascii (c) && isdigit (c);
546} 586}
547 587
548static INLINE int 588ecb_inline int
549Cisspace (int c) 589Cisspace (int c)
550{ 590{
551 return isascii (c) && isspace (c); 591 return isascii (c) && isspace (c);
552} 592}
553 593
554static INLINE int 594ecb_inline int
555Cisupper (int c) 595Cisupper (int c)
556{ 596{
557 return isascii (c) && isupper (c); 597 return isascii (c) && isupper (c);
558} 598}
559 599
560static INLINE int 600ecb_inline int
561Cislower (int c) 601Cislower (int c)
562{ 602{
563 return isascii (c) && islower (c); 603 return isascii (c) && islower (c);
564} 604}
565#endif 605#endif
… …
626#endif 666#endif
627 667
628static int file_push (SCHEME_P_ const char *fname); 668static int file_push (SCHEME_P_ const char *fname);
629static void file_pop (SCHEME_P); 669static void file_pop (SCHEME_P);
630static int file_interactive (SCHEME_P); 670static int file_interactive (SCHEME_P);
631static INLINE int is_one_of (char *s, int c); 671ecb_inline int is_one_of (const char *s, int c);
632static int alloc_cellseg (SCHEME_P_ int n); 672static int alloc_cellseg (SCHEME_P_ int n);
633static INLINE pointer get_cell (SCHEME_P_ pointer a, pointer b); 673ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b);
634static void finalize_cell (SCHEME_P_ pointer a); 674static void finalize_cell (SCHEME_P_ pointer a);
635static int count_consecutive_cells (pointer x, int needed); 675static int count_consecutive_cells (pointer x, int needed);
636static 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);
637static pointer mk_number (SCHEME_P_ const num n); 677static pointer mk_number (SCHEME_P_ const num n);
638static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill); 678static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill);
… …
653static void mark (pointer a); 693static void mark (pointer a);
654static void gc (SCHEME_P_ pointer a, pointer b); 694static void gc (SCHEME_P_ pointer a, pointer b);
655static int basic_inchar (port *pt); 695static int basic_inchar (port *pt);
656static int inchar (SCHEME_P); 696static int inchar (SCHEME_P);
657static void backchar (SCHEME_P_ int c); 697static void backchar (SCHEME_P_ int c);
658static char *readstr_upto (SCHEME_P_ char *delim); 698static char *readstr_upto (SCHEME_P_ int skip, const char *delim);
659static pointer readstrexp (SCHEME_P); 699static pointer readstrexp (SCHEME_P_ char delim);
660static INLINE int skipspace (SCHEME_P); 700ecb_inline int skipspace (SCHEME_P);
661static int token (SCHEME_P); 701static int token (SCHEME_P);
662static void printslashstring (SCHEME_P_ char *s, int len); 702static void printslashstring (SCHEME_P_ char *s, int len);
663static 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);
664static void printatom (SCHEME_P_ pointer l, int f); 704static void printatom (SCHEME_P_ pointer l, int f);
665static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op); 705static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op);
… …
669static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list); 709static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list);
670static pointer revappend (SCHEME_P_ pointer a, pointer b); 710static pointer revappend (SCHEME_P_ pointer a, pointer b);
671static pointer ss_get_cont (SCHEME_P); 711static pointer ss_get_cont (SCHEME_P);
672static void ss_set_cont (SCHEME_P_ pointer cont); 712static void ss_set_cont (SCHEME_P_ pointer cont);
673static void dump_stack_mark (SCHEME_P); 713static void dump_stack_mark (SCHEME_P);
674static 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);
675static pointer opexe_2 (SCHEME_P_ enum scheme_opcodes op); 716static int opexe_2 (SCHEME_P_ enum scheme_opcodes op);
676static pointer opexe_3 (SCHEME_P_ enum scheme_opcodes op); 717static int opexe_3 (SCHEME_P_ enum scheme_opcodes op);
677static pointer opexe_4 (SCHEME_P_ enum scheme_opcodes op); 718static int opexe_4 (SCHEME_P_ enum scheme_opcodes op);
678static pointer opexe_5 (SCHEME_P_ enum scheme_opcodes op); 719static int opexe_5 (SCHEME_P_ enum scheme_opcodes op);
679static pointer opexe_6 (SCHEME_P_ enum scheme_opcodes op); 720static int opexe_6 (SCHEME_P_ enum scheme_opcodes op);
680static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op); 721static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op);
681static void assign_syntax (SCHEME_P_ const char *name); 722static void assign_syntax (SCHEME_P_ const char *name);
682static int syntaxnum (pointer p); 723static int syntaxnum (pointer p);
683static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name); 724static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name);
684 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}
752
685static num 753static num
686num_add (num a, num b) 754num_op (enum num_op op, num a, num b)
687{ 755{
688 num ret; 756 num ret;
689 757
690 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));
691 759
692 if (num_is_fixnum (ret)) 760 if (num_is_fixnum (ret))
693 num_set_ivalue (ret, num_get_ivalue (a) + num_get_ivalue (b)); 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
694 else 773 else
695 num_set_rvalue (ret, num_get_rvalue (a) + num_get_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 }
696 782
697 return ret; 783 num_set_rvalue (ret, a.rvalue);
698} 784 }
699 785#endif
700static num
701num_mul (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, num_get_ivalue (a) * num_get_ivalue (b));
709 else
710 num_set_rvalue (ret, num_get_rvalue (a) * num_get_rvalue (b));
711 786
712 return ret; 787 return ret;
713} 788}
714 789
715static num 790static num
716num_div (num a, num b) 791num_div (num a, num b)
717{ 792{
718 num ret; 793 num ret;
719 794
720 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_get_ivalue (a) % num_get_ivalue (b) == 0); 795 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_ivalue (a) % num_ivalue (b) == 0);
721 796
722 if (num_is_fixnum (ret)) 797 if (num_is_fixnum (ret))
723 num_set_ivalue (ret, num_get_ivalue (a) / num_get_ivalue (b)); 798 num_set_ivalue (ret, num_ivalue (a) / num_ivalue (b));
724 else 799 else
725 num_set_rvalue (ret, num_get_rvalue (a) / num_get_rvalue (b)); 800 num_set_rvalue (ret, num_rvalue (a) / num_rvalue (b));
726
727 return ret;
728}
729
730static num
731num_intdiv (num a, num b)
732{
733 num ret;
734
735 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
736
737 if (num_is_fixnum (ret))
738 num_set_ivalue (ret, num_get_ivalue (a) / num_get_ivalue (b));
739 else
740 num_set_rvalue (ret, num_get_rvalue (a) / num_get_rvalue (b));
741
742 return ret;
743}
744
745static num
746num_sub (num a, num b)
747{
748 num ret;
749
750 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
751
752 if (num_is_fixnum (ret))
753 num_set_ivalue (ret, num_get_ivalue (a) - num_get_ivalue (b));
754 else
755 num_set_rvalue (ret, num_get_rvalue (a) - num_get_rvalue (b));
756 801
757 return ret; 802 return ret;
758} 803}
759 804
760static num 805static num
… …
762{ 807{
763 num ret; 808 num ret;
764 long e1, e2, res; 809 long e1, e2, res;
765 810
766 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 811 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
767 e1 = num_get_ivalue (a); 812 e1 = num_ivalue (a);
768 e2 = num_get_ivalue (b); 813 e2 = num_ivalue (b);
769 res = e1 % e2; 814 res = e1 % e2;
770 815
771 /* remainder should have same sign as second operand */ 816 /* remainder should have same sign as second operand */
772 if (res > 0) 817 if (res > 0)
773 { 818 {
… …
789{ 834{
790 num ret; 835 num ret;
791 long e1, e2, res; 836 long e1, e2, res;
792 837
793 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 838 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
794 e1 = num_get_ivalue (a); 839 e1 = num_ivalue (a);
795 e2 = num_get_ivalue (b); 840 e2 = num_ivalue (b);
796 res = e1 % e2; 841 res = e1 % e2;
797 842
798 /* modulo should have same sign as second operand */ 843 /* modulo should have same sign as second operand */
799 if (res * e2 < 0) 844 if (res * e2 < 0)
800 res += e2; 845 res += e2;
801 846
802 num_set_ivalue (ret, res); 847 num_set_ivalue (ret, res);
803 return ret; 848 return ret;
804} 849}
805 850
851/* this completely disrespects NaNs, but r5rs doesn't even allow NaNs */
806static int 852static int
807num_eq (num a, num b) 853num_cmp (num a, num b)
808{ 854{
855 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
809 int ret; 856 int ret;
810 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
811 857
812 if (is_fixnum) 858 if (is_fixnum)
813 ret = num_get_ivalue (a) == num_get_ivalue (b); 859 {
860 IVALUE av = num_ivalue (a);
861 IVALUE bv = num_ivalue (b);
862
863 ret = av == bv ? 0 : av < bv ? -1 : +1;
864 }
814 else 865 else
815 ret = num_get_rvalue (a) == num_get_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 }
816 872
817 return ret; 873 return ret;
818}
819
820
821static int
822num_gt (num a, num b)
823{
824 int ret;
825 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
826
827 if (is_fixnum)
828 ret = num_get_ivalue (a) > num_get_ivalue (b);
829 else
830 ret = num_get_rvalue (a) > num_get_rvalue (b);
831
832 return ret;
833}
834
835static int
836num_ge (num a, num b)
837{
838 return !num_lt (a, b);
839}
840
841static int
842num_lt (num a, num b)
843{
844 int ret;
845 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
846
847 if (is_fixnum)
848 ret = num_get_ivalue (a) < num_get_ivalue (b);
849 else
850 ret = num_get_rvalue (a) < num_get_rvalue (b);
851
852 return ret;
853}
854
855static int
856num_le (num a, num b)
857{
858 return !num_gt (a, b);
859} 874}
860 875
861#if USE_MATH 876#if USE_MATH
862 877
863/* Round to nearest. Round to even if midway */ 878/* Round to nearest. Round to even if midway */
… …
873 return ce; 888 return ce;
874 else if (dfl < dce) 889 else if (dfl < dce)
875 return fl; 890 return fl;
876 else 891 else
877 { 892 {
878 if (fmod (fl, 2.0) == 0.0) /* I imagine this holds */ 893 if (fmod (fl, 2) == 0) /* I imagine this holds */
879 return fl; 894 return fl;
880 else 895 else
881 return ce; 896 return ce;
882 } 897 }
883} 898}
884#endif 899#endif
885 900
886static int 901static int
887is_zero_rvalue (RVALUE x) 902is_zero_rvalue (RVALUE x)
888{ 903{
904 return x == 0;
905#if 0
889#if USE_REAL 906#if USE_REAL
890 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. */
891#else 908#else
892 return x == 0; 909 return x == 0;
910#endif
893#endif 911#endif
894} 912}
895 913
896/* allocate new cell segment */ 914/* allocate new cell segment */
897static int 915static int
… …
918 return k; 936 return k;
919 937
920 i = ++SCHEME_V->last_cell_seg; 938 i = ++SCHEME_V->last_cell_seg;
921 SCHEME_V->alloc_seg[i] = cp; 939 SCHEME_V->alloc_seg[i] = cp;
922 940
923 /* insert new segment in address order */
924 newp = (pointer)cp; 941 newp = (pointer)cp;
925 SCHEME_V->cell_seg[i] = newp; 942 SCHEME_V->cell_seg[i] = newp;
926 SCHEME_V->cell_segsize[i] = segsize; 943 SCHEME_V->cell_segsize[i] = segsize;
927
928 //TODO: insert, not swap
929 while (i > 0 && SCHEME_V->cell_seg[i - 1] > SCHEME_V->cell_seg[i])
930 {
931 p = SCHEME_V->cell_seg[i];
932 SCHEME_V->cell_seg[i] = SCHEME_V->cell_seg[i - 1];
933 SCHEME_V->cell_seg[i - 1] = p;
934
935 k = SCHEME_V->cell_segsize[i];
936 SCHEME_V->cell_segsize[i] = SCHEME_V->cell_segsize[i - 1];
937 SCHEME_V->cell_segsize[i - 1] = k;
938
939 --i;
940 }
941
942 SCHEME_V->fcells += segsize; 944 SCHEME_V->fcells += segsize;
943 last = newp + segsize - 1; 945 last = newp + segsize - 1;
944 946
945 for (p = newp; p <= last; p++) 947 for (p = newp; p <= last; p++)
946 { 948 {
947 set_typeflag (p, T_FREE); 949 set_typeflag (p, T_PAIR);
948 set_car (p, NIL); 950 set_car (p, NIL);
949 set_cdr (p, p + 1); 951 set_cdr (p, p + 1);
950 } 952 }
951 953
952 /* insert new cells in address order on free list */
953 if (SCHEME_V->free_cell == NIL || p < SCHEME_V->free_cell)
954 {
955 set_cdr (last, SCHEME_V->free_cell); 954 set_cdr (last, SCHEME_V->free_cell);
956 SCHEME_V->free_cell = newp; 955 SCHEME_V->free_cell = newp;
957 }
958 else
959 {
960 p = SCHEME_V->free_cell;
961
962 while (cdr (p) != NIL && newp > cdr (p))
963 p = cdr (p);
964
965 set_cdr (last, cdr (p));
966 set_cdr (p, newp);
967 }
968 } 956 }
969 957
970 return n; 958 return n;
971} 959}
972 960
973/* get new cell. parameter a, b is marked by gc. */ 961/* get new cell. parameter a, b is marked by gc. */
974static INLINE pointer 962ecb_inline pointer
975get_cell_x (SCHEME_P_ pointer a, pointer b) 963get_cell_x (SCHEME_P_ pointer a, pointer b)
976{ 964{
977 if (ecb_expect_false (SCHEME_V->free_cell == NIL)) 965 if (ecb_expect_false (SCHEME_V->free_cell == NIL))
978 { 966 {
979 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 967 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
… …
1051 /* Record it as a vector so that gc understands it. */ 1039 /* Record it as a vector so that gc understands it. */
1052 set_typeflag (v, T_VECTOR | T_ATOM); 1040 set_typeflag (v, T_VECTOR | T_ATOM);
1053 1041
1054 v->object.vector.vvalue = e; 1042 v->object.vector.vvalue = e;
1055 v->object.vector.length = len; 1043 v->object.vector.length = len;
1056 fill_vector (v, init); 1044 fill_vector (v, 0, init);
1057 push_recent_alloc (SCHEME_A_ v, NIL); 1045 push_recent_alloc (SCHEME_A_ v, NIL);
1058 1046
1059 return v; 1047 return v;
1060} 1048}
1061 1049
1062static INLINE void 1050ecb_inline void
1063ok_to_freely_gc (SCHEME_P) 1051ok_to_freely_gc (SCHEME_P)
1064{ 1052{
1065 set_car (S_SINK, NIL); 1053 set_car (S_SINK, NIL);
1066} 1054}
1067 1055
… …
1106 return x; 1094 return x;
1107} 1095}
1108 1096
1109/* ========== oblist implementation ========== */ 1097/* ========== oblist implementation ========== */
1110 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
1111#ifndef USE_OBJECT_LIST 1109#ifndef USE_OBJECT_LIST
1112 1110
1111static int
1113static 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}
1114 1122
1115static pointer 1123static pointer
1116oblist_initial_value (SCHEME_P) 1124oblist_initial_value (SCHEME_P)
1117{ 1125{
1118 return mk_vector (SCHEME_A_ 461); /* probably should be bigger */ 1126 return mk_vector (SCHEME_A_ 461); /* probably should be bigger */
… …
1120 1128
1121/* returns the new symbol */ 1129/* returns the new symbol */
1122static pointer 1130static pointer
1123oblist_add_by_name (SCHEME_P_ const char *name) 1131oblist_add_by_name (SCHEME_P_ const char *name)
1124{ 1132{
1125 int location; 1133 pointer x = generate_symbol (SCHEME_A_ name);
1126
1127 pointer x = immutable_cons (mk_string (SCHEME_A_ name), NIL);
1128 set_typeflag (x, T_SYMBOL);
1129 setimmutable (car (x));
1130
1131 location = hash_fn (name, veclength (SCHEME_V->oblist)); 1134 int location = hash_fn (name, veclength (SCHEME_V->oblist));
1132 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)));
1133 return x; 1136 return x;
1134} 1137}
1135 1138
1136static INLINE pointer 1139ecb_inline pointer
1137oblist_find_by_name (SCHEME_P_ const char *name) 1140oblist_find_by_name (SCHEME_P_ const char *name)
1138{ 1141{
1139 int location; 1142 int location;
1140 pointer x; 1143 pointer x;
1141 char *s; 1144 char *s;
1142 1145
1143 location = hash_fn (name, veclength (SCHEME_V->oblist)); 1146 location = hash_fn (name, veclength (SCHEME_V->oblist));
1144 1147
1145 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))
1146 { 1149 {
1147 s = symname (car (x)); 1150 s = symname (car (x));
1148 1151
1149 /* case-insensitive, per R5RS section 2 */ 1152 /* case-insensitive, per R5RS section 2 */
1150 if (stricmp (name, s) == 0) 1153 if (stricmp (name, s) == 0)
… …
1160 int i; 1163 int i;
1161 pointer x; 1164 pointer x;
1162 pointer ob_list = NIL; 1165 pointer ob_list = NIL;
1163 1166
1164 for (i = 0; i < veclength (SCHEME_V->oblist); i++) 1167 for (i = 0; i < veclength (SCHEME_V->oblist); i++)
1165 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))
1166 ob_list = cons (x, ob_list); 1169 ob_list = cons (x, ob_list);
1167 1170
1168 return ob_list; 1171 return ob_list;
1169} 1172}
1170 1173
… …
1174oblist_initial_value (SCHEME_P) 1177oblist_initial_value (SCHEME_P)
1175{ 1178{
1176 return NIL; 1179 return NIL;
1177} 1180}
1178 1181
1179static INLINE pointer 1182ecb_inline pointer
1180oblist_find_by_name (SCHEME_P_ const char *name) 1183oblist_find_by_name (SCHEME_P_ const char *name)
1181{ 1184{
1182 pointer x; 1185 pointer x;
1183 char *s; 1186 char *s;
1184 1187
… …
1196 1199
1197/* returns the new symbol */ 1200/* returns the new symbol */
1198static pointer 1201static pointer
1199oblist_add_by_name (SCHEME_P_ const char *name) 1202oblist_add_by_name (SCHEME_P_ const char *name)
1200{ 1203{
1201 pointer x; 1204 pointer x = mk_string (SCHEME_A_ name);
1202
1203 x = immutable_cons (mk_string (SCHEME_A_ name), NIL);
1204 set_typeflag (x, T_SYMBOL); 1205 set_typeflag (x, T_SYMBOL);
1205 setimmutable (car (x)); 1206 setimmutable (x);
1206 SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist); 1207 SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist);
1207 return x; 1208 return x;
1208} 1209}
1209 1210
1210static pointer 1211static pointer
… …
1243mk_character (SCHEME_P_ int c) 1244mk_character (SCHEME_P_ int c)
1244{ 1245{
1245 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1246 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1246 1247
1247 set_typeflag (x, (T_CHARACTER | T_ATOM)); 1248 set_typeflag (x, (T_CHARACTER | T_ATOM));
1248 ivalue_unchecked (x) = c & 0xff; 1249 set_ivalue (x, c & 0xff);
1249 set_num_integer (x); 1250
1250 return x; 1251 return x;
1251} 1252}
1252 1253
1253/* get number atom (integer) */ 1254/* get number atom (integer) */
1254INTERFACE pointer 1255INTERFACE pointer
1255mk_integer (SCHEME_P_ long num) 1256mk_integer (SCHEME_P_ long n)
1256{ 1257{
1257 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1258 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1258 1259
1259 set_typeflag (x, (T_NUMBER | T_ATOM)); 1260 set_typeflag (x, (T_INTEGER | T_ATOM));
1260 ivalue_unchecked (x) = num; 1261 set_ivalue (x, n);
1261 set_num_integer (x); 1262
1262 return x; 1263 return x;
1263} 1264}
1264 1265
1265INTERFACE pointer 1266INTERFACE pointer
1266mk_real (SCHEME_P_ RVALUE n) 1267mk_real (SCHEME_P_ RVALUE n)
1267{ 1268{
1269#if USE_REAL
1268 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1270 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1269 1271
1270 set_typeflag (x, (T_NUMBER | T_ATOM)); 1272 set_typeflag (x, (T_REAL | T_ATOM));
1271 rvalue_unchecked (x) = n; 1273 set_rvalue (x, n);
1272 set_num_real (x); 1274
1273 return x; 1275 return x;
1276#else
1277 return mk_integer (SCHEME_A_ n);
1278#endif
1274} 1279}
1275 1280
1276static pointer 1281static pointer
1277mk_number (SCHEME_P_ const num n) 1282mk_number (SCHEME_P_ const num n)
1278{ 1283{
1284#if USE_REAL
1279 if (num_is_fixnum (n)) 1285 return num_is_fixnum (n)
1286 ? mk_integer (SCHEME_A_ num_ivalue (n))
1287 : mk_real (SCHEME_A_ num_rvalue (n));
1288#else
1280 return mk_integer (SCHEME_A_ num_get_ivalue (n)); 1289 return mk_integer (SCHEME_A_ num_ivalue (n));
1281 else 1290#endif
1282 return mk_real (SCHEME_A_ num_get_rvalue (n));
1283} 1291}
1284 1292
1285/* allocate name to string area */ 1293/* allocate name to string area */
1286static char * 1294static char *
1287store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill) 1295store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill)
… …
1293 SCHEME_V->no_memory = 1; 1301 SCHEME_V->no_memory = 1;
1294 return SCHEME_V->strbuff; 1302 return SCHEME_V->strbuff;
1295 } 1303 }
1296 1304
1297 if (str) 1305 if (str)
1298 { 1306 memcpy (q, str , len_str); /* caller must ensure that *str has length len_str */
1299 int l = strlen (str);
1300
1301 if (l > len_str)
1302 l = len_str;
1303
1304 memcpy (q, str, l);
1305 q[l] = 0;
1306 }
1307 else 1307 else
1308 {
1309 memset (q, fill, len_str); 1308 memset (q, fill, len_str);
1309
1310 q[len_str] = 0; 1310 q[len_str] = 0;
1311 }
1312 1311
1313 return q; 1312 return q;
1314} 1313}
1315 1314
1316INTERFACE pointer 1315INTERFACE pointer
… …
1330 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1329 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1331 1330
1332 set_typeflag (x, T_STRING | T_ATOM); 1331 set_typeflag (x, T_STRING | T_ATOM);
1333 strvalue (x) = store_string (SCHEME_A_ len, str, 0); 1332 strvalue (x) = store_string (SCHEME_A_ len, str, 0);
1334 strlength (x) = len; 1333 strlength (x) = len;
1334
1335 return x; 1335 return x;
1336} 1336}
1337 1337
1338INTERFACE pointer 1338INTERFACE pointer
1339mk_string (SCHEME_P_ const char *str) 1339mk_string (SCHEME_P_ const char *str)
… …
1346{ 1346{
1347 return get_vector_object (SCHEME_A_ len, NIL); 1347 return get_vector_object (SCHEME_A_ len, NIL);
1348} 1348}
1349 1349
1350INTERFACE void 1350INTERFACE void
1351fill_vector (pointer vec, pointer obj) 1351fill_vector (pointer vec, uint32_t start, pointer obj)
1352{ 1352{
1353 int i; 1353 int i;
1354 1354
1355 for (i = 0; i < vec->object.vector.length; i++) 1355 for (i = start; i < veclength (vec); i++)
1356 vecvalue (vec)[i] = obj; 1356 vecvalue (vec)[i] = obj;
1357} 1357}
1358 1358
1359INTERFACE pointer 1359INTERFACE pointer
1360vector_elem (pointer vec, uint32_t ielem) 1360vector_get (pointer vec, uint32_t ielem)
1361{ 1361{
1362 return vecvalue(vec)[ielem]; 1362 return vecvalue(vec)[ielem];
1363} 1363}
1364 1364
1365INTERFACE void 1365INTERFACE void
1366set_vector_elem (pointer vec, uint32_t ielem, pointer a) 1366vector_set (pointer vec, uint32_t ielem, pointer a)
1367{ 1367{
1368 vecvalue(vec)[ielem] = a; 1368 vecvalue(vec)[ielem] = a;
1369} 1369}
1370 1370
1371/* get new symbol */ 1371/* get new symbol */
… …
1383 1383
1384INTERFACE pointer 1384INTERFACE pointer
1385gensym (SCHEME_P) 1385gensym (SCHEME_P)
1386{ 1386{
1387 pointer x; 1387 pointer x;
1388
1389 for (; SCHEME_V->gensym_cnt < LONG_MAX; SCHEME_V->gensym_cnt++)
1390 {
1391 char name[40] = "gensym-"; 1388 char name[40] = "gensym-";
1392 xnum (name + 7, SCHEME_V->gensym_cnt); 1389 xnum (name + 7, SCHEME_V->gensym_cnt);
1393 1390
1394 /* first check oblist */ 1391 return generate_symbol (SCHEME_A_ name);
1395 x = oblist_find_by_name (SCHEME_A_ name);
1396
1397 if (x == NIL)
1398 {
1399 x = oblist_add_by_name (SCHEME_A_ name);
1400 return x;
1401 }
1402 }
1403
1404 return NIL;
1405} 1392}
1406 1393
1407/* make symbol or number atom from string */ 1394/* make symbol or number atom from string */
1408static pointer 1395static pointer
1409mk_atom (SCHEME_P_ char *q) 1396mk_atom (SCHEME_P_ char *q)
… …
1463 } 1450 }
1464 else if ((c == 'e') || (c == 'E')) 1451 else if ((c == 'e') || (c == 'E'))
1465 { 1452 {
1466 if (!has_fp_exp) 1453 if (!has_fp_exp)
1467 { 1454 {
1468 has_dec_point = 1; /* decimal point illegal 1455 has_dec_point = 1; /* decimal point illegal from now on */
1469 from now on */
1470 p++; 1456 p++;
1471 1457
1472 if ((*p == '-') || (*p == '+') || isdigit (*p)) 1458 if ((*p == '-') || (*p == '+') || isdigit (*p))
1473 continue; 1459 continue;
1474 } 1460 }
… …
1562 1548
1563 if (ecb_expect_false (is_vector (p))) 1549 if (ecb_expect_false (is_vector (p)))
1564 { 1550 {
1565 int i; 1551 int i;
1566 1552
1567 for (i = 0; i < p->object.vector.length; i++) 1553 for (i = 0; i < veclength (p); i++)
1568 mark (vecvalue (p)[i]); 1554 mark (vecvalue (p)[i]);
1569 } 1555 }
1570 1556
1571 if (is_atom (p)) 1557 if (is_atom (p))
1572 goto E6; 1558 goto E6;
… …
1670 if (is_mark (p)) 1656 if (is_mark (p))
1671 clrmark (p); 1657 clrmark (p);
1672 else 1658 else
1673 { 1659 {
1674 /* reclaim cell */ 1660 /* reclaim cell */
1675 if (typeflag (p) != T_FREE) 1661 if (typeflag (p) != T_PAIR)
1676 { 1662 {
1677 finalize_cell (SCHEME_A_ p); 1663 finalize_cell (SCHEME_A_ p);
1678 set_typeflag (p, T_FREE); 1664 set_typeflag (p, T_PAIR);
1679 set_car (p, NIL); 1665 set_car (p, NIL);
1680 } 1666 }
1681 1667
1682 ++SCHEME_V->fcells; 1668 ++SCHEME_V->fcells;
1683 set_cdr (p, SCHEME_V->free_cell); 1669 set_cdr (p, SCHEME_V->free_cell);
… …
1685 } 1671 }
1686 } 1672 }
1687 } 1673 }
1688 1674
1689 if (SCHEME_V->gc_verbose) 1675 if (SCHEME_V->gc_verbose)
1676 {
1690 xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" cells were recovered.\n"); 1677 xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" cells were recovered.\n");
1678 }
1691} 1679}
1692 1680
1693static void 1681static void
1694finalize_cell (SCHEME_P_ pointer a) 1682finalize_cell (SCHEME_P_ pointer a)
1695{ 1683{
… …
2124#endif 2112#endif
2125} 2113}
2126 2114
2127/* read characters up to delimiter, but cater to character constants */ 2115/* read characters up to delimiter, but cater to character constants */
2128static char * 2116static char *
2129readstr_upto (SCHEME_P_ char *delim) 2117readstr_upto (SCHEME_P_ int skip, const char *delim)
2130{ 2118{
2131 char *p = SCHEME_V->strbuff; 2119 char *p = SCHEME_V->strbuff + skip;
2132 2120
2133 while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A)))); 2121 while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A))));
2134 2122
2135 if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\') 2123 if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\')
2136 *p = 0; 2124 *p = 0;
… …
2143 return SCHEME_V->strbuff; 2131 return SCHEME_V->strbuff;
2144} 2132}
2145 2133
2146/* read string expression "xxx...xxx" */ 2134/* read string expression "xxx...xxx" */
2147static pointer 2135static pointer
2148readstrexp (SCHEME_P) 2136readstrexp (SCHEME_P_ char delim)
2149{ 2137{
2150 char *p = SCHEME_V->strbuff; 2138 char *p = SCHEME_V->strbuff;
2151 int c; 2139 int c;
2152 int c1 = 0; 2140 int c1 = 0;
2153 enum
2154 { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok; 2141 enum { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok;
2155 2142
2156 for (;;) 2143 for (;;)
2157 { 2144 {
2158 c = inchar (SCHEME_A); 2145 c = inchar (SCHEME_A);
2159 2146
… …
2161 return S_F; 2148 return S_F;
2162 2149
2163 switch (state) 2150 switch (state)
2164 { 2151 {
2165 case st_ok: 2152 case st_ok:
2166 switch (c) 2153 if (ecb_expect_false (c == delim))
2167 {
2168 case '\\':
2169 state = st_bsl;
2170 break;
2171
2172 case '"':
2173 *p = 0;
2174 return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff); 2154 return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff);
2175 2155
2176 default: 2156 if (ecb_expect_false (c == '\\'))
2157 state = st_bsl;
2158 else
2177 *p++ = c; 2159 *p++ = c;
2178 break;
2179 }
2180 2160
2181 break; 2161 break;
2182 2162
2183 case st_bsl: 2163 case st_bsl:
2184 switch (c) 2164 switch (c)
… …
2214 case 'r': 2194 case 'r':
2215 *p++ = '\r'; 2195 *p++ = '\r';
2216 state = st_ok; 2196 state = st_ok;
2217 break; 2197 break;
2218 2198
2219 case '"':
2220 *p++ = '"';
2221 state = st_ok;
2222 break;
2223
2224 default: 2199 default:
2225 *p++ = c; 2200 *p++ = c;
2226 state = st_ok; 2201 state = st_ok;
2227 break; 2202 break;
2228 } 2203 }
2229 2204
2230 break; 2205 break;
2231 2206
2232 case st_x1: 2207 case st_x1:
2233 case st_x2: 2208 case st_x2:
2234 c = toupper (c); 2209 c = tolower (c);
2235 2210
2236 if (c >= '0' && c <= 'F') 2211 if (c >= '0' && c <= '9')
2237 {
2238 if (c <= '9')
2239 c1 = (c1 << 4) + c - '0'; 2212 c1 = (c1 << 4) + c - '0';
2240 else 2213 else if (c >= 'a' && c <= 'f')
2241 c1 = (c1 << 4) + c - 'A' + 10; 2214 c1 = (c1 << 4) + c - 'a' + 10;
2242
2243 if (state == st_x1)
2244 state = st_x2;
2245 else
2246 {
2247 *p++ = c1;
2248 state = st_ok;
2249 }
2250 }
2251 else 2215 else
2252 return S_F; 2216 return S_F;
2217
2218 if (state == st_x1)
2219 state = st_x2;
2220 else
2221 {
2222 *p++ = c1;
2223 state = st_ok;
2224 }
2253 2225
2254 break; 2226 break;
2255 2227
2256 case st_oct1: 2228 case st_oct1:
2257 case st_oct2: 2229 case st_oct2:
… …
2261 backchar (SCHEME_A_ c); 2233 backchar (SCHEME_A_ c);
2262 state = st_ok; 2234 state = st_ok;
2263 } 2235 }
2264 else 2236 else
2265 { 2237 {
2266 if (state == st_oct2 && c1 >= 32) 2238 if (state == st_oct2 && c1 >= ' ')
2267 return S_F; 2239 return S_F;
2268 2240
2269 c1 = (c1 << 3) + (c - '0'); 2241 c1 = (c1 << 3) + (c - '0');
2270 2242
2271 if (state == st_oct1) 2243 if (state == st_oct1)
… …
2276 state = st_ok; 2248 state = st_ok;
2277 } 2249 }
2278 } 2250 }
2279 2251
2280 break; 2252 break;
2281
2282 } 2253 }
2283 } 2254 }
2284} 2255}
2285 2256
2286/* check c is in chars */ 2257/* check c is in chars */
2287static INLINE int 2258ecb_inline int
2288is_one_of (char *s, int c) 2259is_one_of (const char *s, int c)
2289{ 2260{
2290 if (c == EOF) 2261 if (c == EOF)
2291 return 1; 2262 return 1;
2292 2263
2293 return !!strchr (s, c); 2264 return !!strchr (s, c);
2294} 2265}
2295 2266
2296/* skip white characters */ 2267/* skip white characters */
2297static INLINE int 2268ecb_inline int
2298skipspace (SCHEME_P) 2269skipspace (SCHEME_P)
2299{ 2270{
2300 int c, curr_line = 0; 2271 int c, curr_line = 0;
2301 2272
2302 do 2273 do
… …
2349 2320
2350 if (is_one_of (" \n\t", c)) 2321 if (is_one_of (" \n\t", c))
2351 return TOK_DOT; 2322 return TOK_DOT;
2352 else 2323 else
2353 { 2324 {
2354 //TODO: ungetc twice in a row is not supported in C
2355 backchar (SCHEME_A_ c); 2325 backchar (SCHEME_A_ c);
2356 backchar (SCHEME_A_ '.');
2357 return TOK_ATOM; 2326 return TOK_DOTATOM;
2358 } 2327 }
2328
2329 case '|':
2330 return TOK_STRATOM;
2359 2331
2360 case '\'': 2332 case '\'':
2361 return TOK_QUOTE; 2333 return TOK_QUOTE;
2362 2334
2363 case ';': 2335 case ';':
… …
2530 { 2502 {
2531 p = SCHEME_V->strbuff; 2503 p = SCHEME_V->strbuff;
2532 2504
2533 if (f <= 1 || f == 10) /* f is the base for numbers if > 1 */ 2505 if (f <= 1 || f == 10) /* f is the base for numbers if > 1 */
2534 { 2506 {
2535 if (num_is_integer (l)) 2507 if (is_integer (l))
2536 xnum (p, ivalue_unchecked (l)); 2508 xnum (p, ivalue_unchecked (l));
2537#if USE_REAL 2509#if USE_REAL
2538 else 2510 else
2539 { 2511 {
2540 snprintf (p, STRBUFFSIZE, "%.10g", rvalue_unchecked (l)); 2512 snprintf (p, STRBUFFSIZE, "%.10g", rvalue_unchecked (l));
… …
2795 return 0; 2767 return 0;
2796 } 2768 }
2797 else if (is_number (a)) 2769 else if (is_number (a))
2798 { 2770 {
2799 if (is_number (b)) 2771 if (is_number (b))
2800 if (num_is_integer (a) == num_is_integer (b))
2801 return num_eq (nvalue (a), nvalue (b)); 2772 return num_cmp (nvalue (a), nvalue (b)) == 0;
2802 2773
2803 return 0; 2774 return 0;
2804 } 2775 }
2805 else if (is_character (a)) 2776 else if (is_character (a))
2806 { 2777 {
… …
2832/* () is #t in R5RS */ 2803/* () is #t in R5RS */
2833#define is_true(p) ((p) != S_F) 2804#define is_true(p) ((p) != S_F)
2834#define is_false(p) ((p) == S_F) 2805#define is_false(p) ((p) == S_F)
2835 2806
2836/* ========== Environment implementation ========== */ 2807/* ========== Environment implementation ========== */
2837
2838#if !defined(USE_ALIST_ENV) || !defined(USE_OBJECT_LIST)
2839
2840static int
2841hash_fn (const char *key, int table_size)
2842{
2843 const unsigned char *p = key;
2844 uint32_t hash = 2166136261;
2845
2846 while (*p)
2847 hash = (hash ^ *p++) * 16777619;
2848
2849 return hash % table_size;
2850}
2851#endif
2852 2808
2853#ifndef USE_ALIST_ENV 2809#ifndef USE_ALIST_ENV
2854 2810
2855/* 2811/*
2856 * In this implementation, each frame of the environment may be 2812 * In this implementation, each frame of the environment may be
… …
2873 2829
2874 SCHEME_V->envir = immutable_cons (new_frame, old_env); 2830 SCHEME_V->envir = immutable_cons (new_frame, old_env);
2875 setenvironment (SCHEME_V->envir); 2831 setenvironment (SCHEME_V->envir);
2876} 2832}
2877 2833
2878static INLINE void 2834static uint32_t
2835sym_hash (pointer sym, uint32_t size)
2836{
2837 uintptr_t ptr = (uintptr_t)sym;
2838
2839#if 0
2840 /* table size is prime, so why mix */
2841 ptr += ptr >> 32;
2842 ptr += ptr >> 16;
2843 ptr += ptr >> 8;
2844#endif
2845
2846 return ptr % size;
2847}
2848
2849ecb_inline void
2879new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) 2850new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
2880{ 2851{
2881 pointer slot = immutable_cons (variable, value); 2852 pointer slot = immutable_cons (variable, value);
2882 2853
2883 if (is_vector (car (env))) 2854 if (is_vector (car (env)))
2884 { 2855 {
2885 int location = hash_fn (symname (variable), veclength (car (env))); 2856 int location = sym_hash (variable, veclength (car (env)));
2886
2887 set_vector_elem (car (env), location, immutable_cons (slot, vector_elem (car (env), location))); 2857 vector_set (car (env), location, immutable_cons (slot, vector_get (car (env), location)));
2888 } 2858 }
2889 else 2859 else
2890 set_car (env, immutable_cons (slot, car (env))); 2860 set_car (env, immutable_cons (slot, car (env)));
2891} 2861}
2892 2862
2893static pointer 2863static pointer
2894find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all) 2864find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all)
2895{ 2865{
2896 pointer x, y; 2866 pointer x, y;
2897 int location;
2898 2867
2899 for (x = env; x != NIL; x = cdr (x)) 2868 for (x = env; x != NIL; x = cdr (x))
2900 { 2869 {
2901 if (is_vector (car (x))) 2870 if (is_vector (car (x)))
2902 { 2871 {
2903 location = hash_fn (symname (hdl), veclength (car (x))); 2872 int location = sym_hash (hdl, veclength (car (x)));
2904 y = vector_elem (car (x), location); 2873 y = vector_get (car (x), location);
2905 } 2874 }
2906 else 2875 else
2907 y = car (x); 2876 y = car (x);
2908 2877
2909 for (; y != NIL; y = cdr (y)) 2878 for (; y != NIL; y = cdr (y))
2910 if (caar (y) == hdl) 2879 if (caar (y) == hdl)
2911 break; 2880 break;
2912 2881
2913 if (y != NIL) 2882 if (y != NIL)
2883 return car (y);
2884
2885 if (!all)
2914 break; 2886 break;
2915
2916 if (!all)
2917 return NIL;
2918 } 2887 }
2919
2920 if (x != NIL)
2921 return car (y);
2922 2888
2923 return NIL; 2889 return NIL;
2924} 2890}
2925 2891
2926#else /* USE_ALIST_ENV */ 2892#else /* USE_ALIST_ENV */
2927 2893
2928static INLINE void 2894ecb_inline void
2929new_frame_in_env (SCHEME_P_ pointer old_env) 2895new_frame_in_env (SCHEME_P_ pointer old_env)
2930{ 2896{
2931 SCHEME_V->envir = immutable_cons (NIL, old_env); 2897 SCHEME_V->envir = immutable_cons (NIL, old_env);
2932 setenvironment (SCHEME_V->envir); 2898 setenvironment (SCHEME_V->envir);
2933} 2899}
2934 2900
2935static INLINE void 2901ecb_inline void
2936new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) 2902new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
2937{ 2903{
2938 set_car (env, immutable_cons (immutable_cons (variable, value), car (env))); 2904 set_car (env, immutable_cons (immutable_cons (variable, value), car (env)));
2939} 2905}
2940 2906
… …
2948 for (y = car (x); y != NIL; y = cdr (y)) 2914 for (y = car (x); y != NIL; y = cdr (y))
2949 if (caar (y) == hdl) 2915 if (caar (y) == hdl)
2950 break; 2916 break;
2951 2917
2952 if (y != NIL) 2918 if (y != NIL)
2919 return car (y);
2953 break; 2920 break;
2954 2921
2955 if (!all) 2922 if (!all)
2956 return NIL; 2923 break;
2957 } 2924 }
2958
2959 if (x != NIL)
2960 return car (y);
2961 2925
2962 return NIL; 2926 return NIL;
2963} 2927}
2964 2928
2965#endif /* USE_ALIST_ENV else */ 2929#endif /* USE_ALIST_ENV else */
2966 2930
2967static INLINE void 2931ecb_inline void
2968new_slot_in_env (SCHEME_P_ pointer variable, pointer value) 2932new_slot_in_env (SCHEME_P_ pointer variable, pointer value)
2969{ 2933{
2970 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value); 2934 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value);
2971} 2935}
2972 2936
2973static INLINE void 2937ecb_inline void
2974set_slot_in_env (SCHEME_P_ pointer slot, pointer value) 2938set_slot_in_env (SCHEME_P_ pointer slot, pointer value)
2975{ 2939{
2976 set_cdr (slot, value); 2940 set_cdr (slot, value);
2977} 2941}
2978 2942
2979static INLINE pointer 2943ecb_inline pointer
2980slot_value_in_env (pointer slot) 2944slot_value_in_env (pointer slot)
2981{ 2945{
2982 return cdr (slot); 2946 return cdr (slot);
2983} 2947}
2984 2948
2985/* ========== Evaluation Cycle ========== */ 2949/* ========== Evaluation Cycle ========== */
2986 2950
2987static pointer 2951static int
2988xError_1 (SCHEME_P_ const char *s, pointer a) 2952xError_1 (SCHEME_P_ const char *s, pointer a)
2989{ 2953{
2990#if USE_ERROR_HOOK 2954#if USE_ERROR_HOOK
2991 pointer x; 2955 pointer x;
2992 pointer hdl = SCHEME_V->ERROR_HOOK; 2956 pointer hdl = SCHEME_V->ERROR_HOOK;
… …
3027 code = cons (mk_string (SCHEME_A_ s), code); 2991 code = cons (mk_string (SCHEME_A_ s), code);
3028 setimmutable (car (code)); 2992 setimmutable (car (code));
3029 SCHEME_V->code = cons (slot_value_in_env (x), code); 2993 SCHEME_V->code = cons (slot_value_in_env (x), code);
3030 SCHEME_V->op = OP_EVAL; 2994 SCHEME_V->op = OP_EVAL;
3031 2995
3032 return S_T; 2996 return 0;
3033 } 2997 }
3034#endif 2998#endif
3035 2999
3036 if (a) 3000 if (a)
3037 SCHEME_V->args = cons (a, NIL); 3001 SCHEME_V->args = cons (a, NIL);
… …
3039 SCHEME_V->args = NIL; 3003 SCHEME_V->args = NIL;
3040 3004
3041 SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args); 3005 SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args);
3042 setimmutable (car (SCHEME_V->args)); 3006 setimmutable (car (SCHEME_V->args));
3043 SCHEME_V->op = OP_ERR0; 3007 SCHEME_V->op = OP_ERR0;
3008
3044 return S_T; 3009 return 0;
3045} 3010}
3046 3011
3047#define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a) 3012#define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a)
3048#define Error_0(s) Error_1 (s, 0) 3013#define Error_0(s) Error_1 (s, 0)
3049 3014
3050/* Too small to turn into function */ 3015/* Too small to turn into function */
3051#define BEGIN do { 3016#define BEGIN do {
3052#define END } while (0) 3017#define END } while (0)
3053#define s_goto(a) BEGIN \ 3018#define s_goto(a) BEGIN \
3054 SCHEME_V->op = a; \ 3019 SCHEME_V->op = a; \
3055 return S_T; END 3020 return 0; END
3056 3021
3057#define s_return(a) return xs_return (SCHEME_A_ a) 3022#define s_return(a) return xs_return (SCHEME_A_ a)
3058 3023
3059#ifndef USE_SCHEME_STACK 3024#ifndef USE_SCHEME_STACK
3060 3025
… …
3085 next_frame = SCHEME_V->dump_base + nframes; 3050 next_frame = SCHEME_V->dump_base + nframes;
3086 3051
3087 next_frame->op = op; 3052 next_frame->op = op;
3088 next_frame->args = args; 3053 next_frame->args = args;
3089 next_frame->envir = SCHEME_V->envir; 3054 next_frame->envir = SCHEME_V->envir;
3090 next_frame->code = code; 3055 next_frame->code = code;
3091 3056
3092 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1); 3057 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1);
3093} 3058}
3094 3059
3095static pointer 3060static int
3096xs_return (SCHEME_P_ pointer a) 3061xs_return (SCHEME_P_ pointer a)
3097{ 3062{
3098 int nframes = (uintptr_t)SCHEME_V->dump; 3063 int nframes = (uintptr_t)SCHEME_V->dump;
3099 struct dump_stack_frame *frame; 3064 struct dump_stack_frame *frame;
3100 3065
3101 SCHEME_V->value = a; 3066 SCHEME_V->value = a;
3102 3067
3103 if (nframes <= 0) 3068 if (nframes <= 0)
3104 return NIL; 3069 return -1;
3105 3070
3106 frame = &SCHEME_V->dump_base[--nframes]; 3071 frame = &SCHEME_V->dump_base[--nframes];
3107 SCHEME_V->op = frame->op; 3072 SCHEME_V->op = frame->op;
3108 SCHEME_V->args = frame->args; 3073 SCHEME_V->args = frame->args;
3109 SCHEME_V->envir = frame->envir; 3074 SCHEME_V->envir = frame->envir;
3110 SCHEME_V->code = frame->code; 3075 SCHEME_V->code = frame->code;
3111 SCHEME_V->dump = (pointer)(uintptr_t)nframes; 3076 SCHEME_V->dump = (pointer)(uintptr_t)nframes;
3112 3077
3113 return S_T; 3078 return 0;
3114} 3079}
3115 3080
3116static INLINE void 3081ecb_inline void
3117dump_stack_reset (SCHEME_P) 3082dump_stack_reset (SCHEME_P)
3118{ 3083{
3119 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */ 3084 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */
3120 SCHEME_V->dump = (pointer)+0; 3085 SCHEME_V->dump = (pointer)+0;
3121} 3086}
3122 3087
3123static INLINE void 3088ecb_inline void
3124dump_stack_initialize (SCHEME_P) 3089dump_stack_initialize (SCHEME_P)
3125{ 3090{
3126 SCHEME_V->dump_size = 0; 3091 SCHEME_V->dump_size = 0;
3127 SCHEME_V->dump_base = 0; 3092 SCHEME_V->dump_base = 0;
3128 dump_stack_reset (SCHEME_A); 3093 dump_stack_reset (SCHEME_A);
… …
3181 int i = 0; 3146 int i = 0;
3182 struct dump_stack_frame *frame = SCHEME_V->dump_base; 3147 struct dump_stack_frame *frame = SCHEME_V->dump_base;
3183 3148
3184 while (cont != NIL) 3149 while (cont != NIL)
3185 { 3150 {
3186 frame->op = ivalue (car (cont)); cont = cdr (cont); 3151 frame->op = ivalue_unchecked (car (cont)); cont = cdr (cont);
3187 frame->args = car (cont) ; cont = cdr (cont); 3152 frame->args = car (cont) ; cont = cdr (cont);
3188 frame->envir = car (cont) ; cont = cdr (cont); 3153 frame->envir = car (cont) ; cont = cdr (cont);
3189 frame->code = car (cont) ; cont = cdr (cont); 3154 frame->code = car (cont) ; cont = cdr (cont);
3190 3155
3191 ++frame; 3156 ++frame;
3192 ++i; 3157 ++i;
3193 } 3158 }
3194 3159
3195 SCHEME_V->dump = (pointer)(uintptr_t)i; 3160 SCHEME_V->dump = (pointer)(uintptr_t)i;
3196} 3161}
3197 3162
3198#else 3163#else
3199 3164
3200static INLINE void 3165ecb_inline void
3201dump_stack_reset (SCHEME_P) 3166dump_stack_reset (SCHEME_P)
3202{ 3167{
3203 SCHEME_V->dump = NIL; 3168 SCHEME_V->dump = NIL;
3204} 3169}
3205 3170
3206static INLINE void 3171ecb_inline void
3207dump_stack_initialize (SCHEME_P) 3172dump_stack_initialize (SCHEME_P)
3208{ 3173{
3209 dump_stack_reset (SCHEME_A); 3174 dump_stack_reset (SCHEME_A);
3210} 3175}
3211 3176
… …
3213dump_stack_free (SCHEME_P) 3178dump_stack_free (SCHEME_P)
3214{ 3179{
3215 SCHEME_V->dump = NIL; 3180 SCHEME_V->dump = NIL;
3216} 3181}
3217 3182
3218static pointer 3183static int
3219xs_return (SCHEME_P_ pointer a) 3184xs_return (SCHEME_P_ pointer a)
3220{ 3185{
3221 pointer dump = SCHEME_V->dump; 3186 pointer dump = SCHEME_V->dump;
3222 3187
3223 SCHEME_V->value = a; 3188 SCHEME_V->value = a;
3224 3189
3225 if (dump == NIL) 3190 if (dump == NIL)
3226 return NIL; 3191 return -1;
3227 3192
3228 SCHEME_V->op = ivalue (car (dump)); dump = cdr (dump); 3193 SCHEME_V->op = ivalue_unchecked (car (dump)); dump = cdr (dump);
3229 SCHEME_V->args = car (dump) ; dump = cdr (dump); 3194 SCHEME_V->args = car (dump) ; dump = cdr (dump);
3230 SCHEME_V->envir = car (dump) ; dump = cdr (dump); 3195 SCHEME_V->envir = car (dump) ; dump = cdr (dump);
3231 SCHEME_V->code = car (dump) ; dump = cdr (dump); 3196 SCHEME_V->code = car (dump) ; dump = cdr (dump);
3232 3197
3233 SCHEME_V->dump = dump; 3198 SCHEME_V->dump = dump;
3234 3199
3235 return S_T; 3200 return 0;
3236} 3201}
3237 3202
3238static void 3203static void
3239s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code) 3204s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code)
3240{ 3205{
… …
3265 3230
3266#endif 3231#endif
3267 3232
3268#define s_retbool(tf) s_return ((tf) ? S_T : S_F) 3233#define s_retbool(tf) s_return ((tf) ? S_T : S_F)
3269 3234
3270static pointer 3235static int
3271opexe_0 (SCHEME_P_ enum scheme_opcodes op) 3236opexe_0 (SCHEME_P_ enum scheme_opcodes op)
3272{ 3237{
3238 pointer args = SCHEME_V->args;
3273 pointer x, y; 3239 pointer x, y;
3274 3240
3275 switch (op) 3241 switch (op)
3276 { 3242 {
3277 case OP_LOAD: /* load */ 3243 case OP_LOAD: /* load */
3278 if (file_interactive (SCHEME_A)) 3244 if (file_interactive (SCHEME_A))
3279 { 3245 {
3280 xwrstr ("Loading "); xwrstr (strvalue (car (SCHEME_V->args))); xwrstr ("\n"); 3246 xwrstr ("Loading "); xwrstr (strvalue (car (args))); xwrstr ("\n");
3281 //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (SCHEME_V->args))); 3247 //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args)));
3282 } 3248 }
3283 3249
3284 if (!file_push (SCHEME_A_ strvalue (car (SCHEME_V->args)))) 3250 if (!file_push (SCHEME_A_ strvalue (car (args))))
3285 Error_1 ("unable to open", car (SCHEME_V->args)); 3251 Error_1 ("unable to open", car (args));
3286 else 3252 else
3287 { 3253 {
3288 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i); 3254 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i);
3289 s_goto (OP_T0LVL); 3255 s_goto (OP_T0LVL);
3290 } 3256 }
… …
3364 case OP_EVAL: /* main part of evaluation */ 3330 case OP_EVAL: /* main part of evaluation */
3365#if USE_TRACING 3331#if USE_TRACING
3366 if (SCHEME_V->tracing) 3332 if (SCHEME_V->tracing)
3367 { 3333 {
3368 /*s_save(SCHEME_A_ OP_VALUEPRINT,NIL,NIL); */ 3334 /*s_save(SCHEME_A_ OP_VALUEPRINT,NIL,NIL); */
3369 s_save (SCHEME_A_ OP_REAL_EVAL, SCHEME_V->args, SCHEME_V->code); 3335 s_save (SCHEME_A_ OP_REAL_EVAL, args, SCHEME_V->code);
3370 SCHEME_V->args = SCHEME_V->code; 3336 SCHEME_V->args = SCHEME_V->code;
3371 putstr (SCHEME_A_ "\nEval: "); 3337 putstr (SCHEME_A_ "\nEval: ");
3372 s_goto (OP_P0LIST); 3338 s_goto (OP_P0LIST);
3373 } 3339 }
3374 3340
… …
3418 SCHEME_V->code = cdr (SCHEME_V->code); 3384 SCHEME_V->code = cdr (SCHEME_V->code);
3419 s_goto (OP_E1ARGS); 3385 s_goto (OP_E1ARGS);
3420 } 3386 }
3421 3387
3422 case OP_E1ARGS: /* eval arguments */ 3388 case OP_E1ARGS: /* eval arguments */
3423 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 3389 args = cons (SCHEME_V->value, args);
3424 3390
3425 if (is_pair (SCHEME_V->code)) /* continue */ 3391 if (is_pair (SCHEME_V->code)) /* continue */
3426 { 3392 {
3427 s_save (SCHEME_A_ OP_E1ARGS, SCHEME_V->args, cdr (SCHEME_V->code)); 3393 s_save (SCHEME_A_ OP_E1ARGS, args, cdr (SCHEME_V->code));
3428 SCHEME_V->code = car (SCHEME_V->code); 3394 SCHEME_V->code = car (SCHEME_V->code);
3429 SCHEME_V->args = NIL; 3395 SCHEME_V->args = NIL;
3430 s_goto (OP_EVAL); 3396 s_goto (OP_EVAL);
3431 } 3397 }
3432 else /* end */ 3398 else /* end */
3433 { 3399 {
3434 SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); 3400 args = reverse_in_place (SCHEME_A_ NIL, args);
3435 SCHEME_V->code = car (SCHEME_V->args); 3401 SCHEME_V->code = car (args);
3436 SCHEME_V->args = cdr (SCHEME_V->args); 3402 SCHEME_V->args = cdr (args);
3437 s_goto (OP_APPLY); 3403 s_goto (OP_APPLY);
3438 } 3404 }
3439 3405
3440#if USE_TRACING 3406#if USE_TRACING
3441 3407
3442 case OP_TRACING: 3408 case OP_TRACING:
3443 { 3409 {
3444 int tr = SCHEME_V->tracing; 3410 int tr = SCHEME_V->tracing;
3445 3411
3446 SCHEME_V->tracing = ivalue (car (SCHEME_V->args)); 3412 SCHEME_V->tracing = ivalue_unchecked (car (args));
3447 s_return (mk_integer (SCHEME_A_ tr)); 3413 s_return (mk_integer (SCHEME_A_ tr));
3448 } 3414 }
3449 3415
3450#endif 3416#endif
3451 3417
3452 case OP_APPLY: /* apply 'code' to 'args' */ 3418 case OP_APPLY: /* apply 'code' to 'args' */
3453#if USE_TRACING 3419#if USE_TRACING
3454 if (SCHEME_V->tracing) 3420 if (SCHEME_V->tracing)
3455 { 3421 {
3456 s_save (SCHEME_A_ OP_REAL_APPLY, SCHEME_V->args, SCHEME_V->code); 3422 s_save (SCHEME_A_ OP_REAL_APPLY, args, SCHEME_V->code);
3457 SCHEME_V->print_flag = 1; 3423 SCHEME_V->print_flag = 1;
3458 /* SCHEME_V->args=cons(SCHEME_V->code,SCHEME_V->args); */ 3424 /* args=cons(SCHEME_V->code,args); */
3459 putstr (SCHEME_A_ "\nApply to: "); 3425 putstr (SCHEME_A_ "\nApply to: ");
3460 s_goto (OP_P0LIST); 3426 s_goto (OP_P0LIST);
3461 } 3427 }
3462 3428
3463 /* fall through */ 3429 /* fall through */
3464 3430
3465 case OP_REAL_APPLY: 3431 case OP_REAL_APPLY:
3466#endif 3432#endif
3467 if (is_proc (SCHEME_V->code)) 3433 if (is_proc (SCHEME_V->code))
3468 {
3469 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */ 3434 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */
3470 }
3471 else if (is_foreign (SCHEME_V->code)) 3435 else if (is_foreign (SCHEME_V->code))
3472 { 3436 {
3473 /* Keep nested calls from GC'ing the arglist */ 3437 /* Keep nested calls from GC'ing the arglist */
3474 push_recent_alloc (SCHEME_A_ SCHEME_V->args, NIL); 3438 push_recent_alloc (SCHEME_A_ args, NIL);
3475 x = SCHEME_V->code->object.ff (SCHEME_A_ SCHEME_V->args); 3439 x = SCHEME_V->code->object.ff (SCHEME_A_ args);
3476 3440
3477 s_return (x); 3441 s_return (x);
3478 } 3442 }
3479 else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */ 3443 else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */
3480 { 3444 {
3481 /* Should not accept promise */ 3445 /* Should not accept promise */
3482 /* make environment */ 3446 /* make environment */
3483 new_frame_in_env (SCHEME_A_ closure_env (SCHEME_V->code)); 3447 new_frame_in_env (SCHEME_A_ closure_env (SCHEME_V->code));
3484 3448
3485 for (x = car (closure_code (SCHEME_V->code)), y = SCHEME_V->args; is_pair (x); x = cdr (x), y = cdr (y)) 3449 for (x = car (closure_code (SCHEME_V->code)), y = args; is_pair (x); x = cdr (x), y = cdr (y))
3486 { 3450 {
3487 if (y == NIL) 3451 if (y == NIL)
3488 Error_0 ("not enough arguments"); 3452 Error_0 ("not enough arguments");
3489 else 3453 else
3490 new_slot_in_env (SCHEME_A_ car (x), car (y)); 3454 new_slot_in_env (SCHEME_A_ car (x), car (y));
… …
3508 s_goto (OP_BEGIN); 3472 s_goto (OP_BEGIN);
3509 } 3473 }
3510 else if (is_continuation (SCHEME_V->code)) /* CONTINUATION */ 3474 else if (is_continuation (SCHEME_V->code)) /* CONTINUATION */
3511 { 3475 {
3512 ss_set_cont (SCHEME_A_ cont_dump (SCHEME_V->code)); 3476 ss_set_cont (SCHEME_A_ cont_dump (SCHEME_V->code));
3513 s_return (SCHEME_V->args != NIL ? car (SCHEME_V->args) : NIL); 3477 s_return (args != NIL ? car (args) : NIL);
3514 } 3478 }
3515 else 3479 else
3516 Error_0 ("illegal function"); 3480 Error_0 ("illegal function");
3517 3481
3518 case OP_DOMACRO: /* do macro */ 3482 case OP_DOMACRO: /* do macro */
… …
3527 { 3491 {
3528 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1); 3492 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1);
3529 3493
3530 if (f != NIL) 3494 if (f != NIL)
3531 { 3495 {
3532 s_save (SCHEME_A_ OP_LAMBDA1, SCHEME_V->args, SCHEME_V->code); 3496 s_save (SCHEME_A_ OP_LAMBDA1, args, SCHEME_V->code);
3533 SCHEME_V->args = cons (SCHEME_V->code, NIL); 3497 SCHEME_V->args = cons (SCHEME_V->code, NIL);
3534 SCHEME_V->code = slot_value_in_env (f); 3498 SCHEME_V->code = slot_value_in_env (f);
3535 s_goto (OP_APPLY); 3499 s_goto (OP_APPLY);
3536 } 3500 }
3537 3501
… …
3548 s_return (mk_closure (SCHEME_A_ SCHEME_V->code, SCHEME_V->envir)); 3512 s_return (mk_closure (SCHEME_A_ SCHEME_V->code, SCHEME_V->envir));
3549 3513
3550#endif 3514#endif
3551 3515
3552 case OP_MKCLOSURE: /* make-closure */ 3516 case OP_MKCLOSURE: /* make-closure */
3553 x = car (SCHEME_V->args); 3517 x = car (args);
3554 3518
3555 if (car (x) == SCHEME_V->LAMBDA) 3519 if (car (x) == SCHEME_V->LAMBDA)
3556 x = cdr (x); 3520 x = cdr (x);
3557 3521
3558 if (cdr (SCHEME_V->args) == NIL) 3522 if (cdr (args) == NIL)
3559 y = SCHEME_V->envir; 3523 y = SCHEME_V->envir;
3560 else 3524 else
3561 y = cadr (SCHEME_V->args); 3525 y = cadr (args);
3562 3526
3563 s_return (mk_closure (SCHEME_A_ x, y)); 3527 s_return (mk_closure (SCHEME_A_ x, y));
3564 3528
3565 case OP_QUOTE: /* quote */ 3529 case OP_QUOTE: /* quote */
3566 s_return (car (SCHEME_V->code)); 3530 s_return (car (SCHEME_V->code));
… …
3598 3562
3599 3563
3600 case OP_DEFP: /* defined? */ 3564 case OP_DEFP: /* defined? */
3601 x = SCHEME_V->envir; 3565 x = SCHEME_V->envir;
3602 3566
3603 if (cdr (SCHEME_V->args) != NIL) 3567 if (cdr (args) != NIL)
3604 x = cadr (SCHEME_V->args); 3568 x = cadr (args);
3605 3569
3606 s_retbool (find_slot_in_env (SCHEME_A_ x, car (SCHEME_V->args), 1) != NIL); 3570 s_retbool (find_slot_in_env (SCHEME_A_ x, car (args), 1) != NIL);
3607 3571
3608 case OP_SET0: /* set! */ 3572 case OP_SET0: /* set! */
3609 if (is_immutable (car (SCHEME_V->code))) 3573 if (is_immutable (car (SCHEME_V->code)))
3610 Error_1 ("set!: unable to alter immutable variable", car (SCHEME_V->code)); 3574 Error_1 ("set!: unable to alter immutable variable", car (SCHEME_V->code));
3611 3575
… …
3642 3606
3643 case OP_IF1: /* if */ 3607 case OP_IF1: /* if */
3644 if (is_true (SCHEME_V->value)) 3608 if (is_true (SCHEME_V->value))
3645 SCHEME_V->code = car (SCHEME_V->code); 3609 SCHEME_V->code = car (SCHEME_V->code);
3646 else 3610 else
3647 SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because 3611 SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because * car(NIL) = NIL */
3648
3649 * car(NIL) = NIL */
3650 s_goto (OP_EVAL); 3612 s_goto (OP_EVAL);
3651 3613
3652 case OP_LET0: /* let */ 3614 case OP_LET0: /* let */
3653 SCHEME_V->args = NIL; 3615 SCHEME_V->args = NIL;
3654 SCHEME_V->value = SCHEME_V->code; 3616 SCHEME_V->value = SCHEME_V->code;
3655 SCHEME_V->code = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code); 3617 SCHEME_V->code = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code);
3656 s_goto (OP_LET1); 3618 s_goto (OP_LET1);
3657 3619
3658 case OP_LET1: /* let (calculate parameters) */ 3620 case OP_LET1: /* let (calculate parameters) */
3659 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 3621 args = cons (SCHEME_V->value, args);
3660 3622
3661 if (is_pair (SCHEME_V->code)) /* continue */ 3623 if (is_pair (SCHEME_V->code)) /* continue */
3662 { 3624 {
3663 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code))) 3625 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code)))
3664 Error_1 ("Bad syntax of binding spec in let :", car (SCHEME_V->code)); 3626 Error_1 ("Bad syntax of binding spec in let :", car (SCHEME_V->code));
3665 3627
3666 s_save (SCHEME_A_ OP_LET1, SCHEME_V->args, cdr (SCHEME_V->code)); 3628 s_save (SCHEME_A_ OP_LET1, args, cdr (SCHEME_V->code));
3667 SCHEME_V->code = cadar (SCHEME_V->code); 3629 SCHEME_V->code = cadar (SCHEME_V->code);
3668 SCHEME_V->args = NIL; 3630 SCHEME_V->args = NIL;
3669 s_goto (OP_EVAL); 3631 s_goto (OP_EVAL);
3670 } 3632 }
3671 else /* end */ 3633 else /* end */
3672 { 3634 {
3673 SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); 3635 args = reverse_in_place (SCHEME_A_ NIL, args);
3674 SCHEME_V->code = car (SCHEME_V->args); 3636 SCHEME_V->code = car (args);
3675 SCHEME_V->args = cdr (SCHEME_V->args); 3637 SCHEME_V->args = cdr (args);
3676 s_goto (OP_LET2); 3638 s_goto (OP_LET2);
3677 } 3639 }
3678 3640
3679 case OP_LET2: /* let */ 3641 case OP_LET2: /* let */
3680 new_frame_in_env (SCHEME_A_ SCHEME_V->envir); 3642 new_frame_in_env (SCHEME_A_ SCHEME_V->envir);
3681 3643
3682 for (x = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code), y = SCHEME_V->args; 3644 for (x = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code), y = args;
3683 y != NIL; x = cdr (x), y = cdr (y)) 3645 y != NIL; x = cdr (x), y = cdr (y))
3684 new_slot_in_env (SCHEME_A_ caar (x), car (y)); 3646 new_slot_in_env (SCHEME_A_ caar (x), car (y));
3685 3647
3686 if (is_symbol (car (SCHEME_V->code))) /* named let */ 3648 if (is_symbol (car (SCHEME_V->code))) /* named let */
3687 { 3649 {
3688 for (x = cadr (SCHEME_V->code), SCHEME_V->args = NIL; x != NIL; x = cdr (x)) 3650 for (x = cadr (SCHEME_V->code), args = NIL; x != NIL; x = cdr (x))
3689 { 3651 {
3690 if (!is_pair (x)) 3652 if (!is_pair (x))
3691 Error_1 ("Bad syntax of binding in let :", x); 3653 Error_1 ("Bad syntax of binding in let :", x);
3692 3654
3693 if (!is_list (SCHEME_A_ car (x))) 3655 if (!is_list (SCHEME_A_ car (x)))
3694 Error_1 ("Bad syntax of binding in let :", car (x)); 3656 Error_1 ("Bad syntax of binding in let :", car (x));
3695 3657
3696 SCHEME_V->args = cons (caar (x), SCHEME_V->args); 3658 args = cons (caar (x), args);
3697 } 3659 }
3698 3660
3699 x =
3700 mk_closure (SCHEME_A_ cons (reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args), cddr (SCHEME_V->code)), 3661 x = mk_closure (SCHEME_A_ cons (reverse_in_place (SCHEME_A_ NIL, args), cddr (SCHEME_V->code)),
3701 SCHEME_V->envir); 3662 SCHEME_V->envir);
3702 new_slot_in_env (SCHEME_A_ car (SCHEME_V->code), x); 3663 new_slot_in_env (SCHEME_A_ car (SCHEME_V->code), x);
3703 SCHEME_V->code = cddr (SCHEME_V->code); 3664 SCHEME_V->code = cddr (SCHEME_V->code);
3704 SCHEME_V->args = NIL;
3705 } 3665 }
3706 else 3666 else
3707 { 3667 {
3708 SCHEME_V->code = cdr (SCHEME_V->code); 3668 SCHEME_V->code = cdr (SCHEME_V->code);
3669 }
3670
3709 SCHEME_V->args = NIL; 3671 SCHEME_V->args = NIL;
3710 }
3711
3712 s_goto (OP_BEGIN); 3672 s_goto (OP_BEGIN);
3713 3673
3714 case OP_LET0AST: /* let* */ 3674 case OP_LET0AST: /* let* */
3715 if (car (SCHEME_V->code) == NIL) 3675 if (car (SCHEME_V->code) == NIL)
3716 { 3676 {
… …
3734 new_slot_in_env (SCHEME_A_ caar (SCHEME_V->code), SCHEME_V->value); 3694 new_slot_in_env (SCHEME_A_ caar (SCHEME_V->code), SCHEME_V->value);
3735 SCHEME_V->code = cdr (SCHEME_V->code); 3695 SCHEME_V->code = cdr (SCHEME_V->code);
3736 3696
3737 if (is_pair (SCHEME_V->code)) /* continue */ 3697 if (is_pair (SCHEME_V->code)) /* continue */
3738 { 3698 {
3739 s_save (SCHEME_A_ OP_LET2AST, SCHEME_V->args, SCHEME_V->code); 3699 s_save (SCHEME_A_ OP_LET2AST, args, SCHEME_V->code);
3740 SCHEME_V->code = cadar (SCHEME_V->code); 3700 SCHEME_V->code = cadar (SCHEME_V->code);
3741 SCHEME_V->args = NIL; 3701 SCHEME_V->args = NIL;
3742 s_goto (OP_EVAL); 3702 s_goto (OP_EVAL);
3743 } 3703 }
3744 else /* end */ 3704 else /* end */
3745 { 3705 {
3746 SCHEME_V->code = SCHEME_V->args; 3706 SCHEME_V->code = args;
3747 SCHEME_V->args = NIL; 3707 SCHEME_V->args = NIL;
3748 s_goto (OP_BEGIN); 3708 s_goto (OP_BEGIN);
3749 } 3709 }
3750 3710
3751 case OP_LET0REC: /* letrec */ 3711 case OP_LET0REC: /* letrec */
… …
3754 SCHEME_V->value = SCHEME_V->code; 3714 SCHEME_V->value = SCHEME_V->code;
3755 SCHEME_V->code = car (SCHEME_V->code); 3715 SCHEME_V->code = car (SCHEME_V->code);
3756 s_goto (OP_LET1REC); 3716 s_goto (OP_LET1REC);
3757 3717
3758 case OP_LET1REC: /* letrec (calculate parameters) */ 3718 case OP_LET1REC: /* letrec (calculate parameters) */
3759 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 3719 args = cons (SCHEME_V->value, args);
3760 3720
3761 if (is_pair (SCHEME_V->code)) /* continue */ 3721 if (is_pair (SCHEME_V->code)) /* continue */
3762 { 3722 {
3763 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code))) 3723 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code)))
3764 Error_1 ("Bad syntax of binding spec in letrec :", car (SCHEME_V->code)); 3724 Error_1 ("Bad syntax of binding spec in letrec :", car (SCHEME_V->code));
3765 3725
3766 s_save (SCHEME_A_ OP_LET1REC, SCHEME_V->args, cdr (SCHEME_V->code)); 3726 s_save (SCHEME_A_ OP_LET1REC, args, cdr (SCHEME_V->code));
3767 SCHEME_V->code = cadar (SCHEME_V->code); 3727 SCHEME_V->code = cadar (SCHEME_V->code);
3768 SCHEME_V->args = NIL; 3728 SCHEME_V->args = NIL;
3769 s_goto (OP_EVAL); 3729 s_goto (OP_EVAL);
3770 } 3730 }
3771 else /* end */ 3731 else /* end */
3772 { 3732 {
3773 SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); 3733 args = reverse_in_place (SCHEME_A_ NIL, args);
3774 SCHEME_V->code = car (SCHEME_V->args); 3734 SCHEME_V->code = car (args);
3775 SCHEME_V->args = cdr (SCHEME_V->args); 3735 SCHEME_V->args = cdr (args);
3776 s_goto (OP_LET2REC); 3736 s_goto (OP_LET2REC);
3777 } 3737 }
3778 3738
3779 case OP_LET2REC: /* letrec */ 3739 case OP_LET2REC: /* letrec */
3780 for (x = car (SCHEME_V->code), y = SCHEME_V->args; y != NIL; x = cdr (x), y = cdr (y)) 3740 for (x = car (SCHEME_V->code), y = args; y != NIL; x = cdr (x), y = cdr (y))
3781 new_slot_in_env (SCHEME_A_ caar (x), car (y)); 3741 new_slot_in_env (SCHEME_A_ caar (x), car (y));
3782 3742
3783 SCHEME_V->code = cdr (SCHEME_V->code); 3743 SCHEME_V->code = cdr (SCHEME_V->code);
3784 SCHEME_V->args = NIL; 3744 SCHEME_V->args = NIL;
3785 s_goto (OP_BEGIN); 3745 s_goto (OP_BEGIN);
… …
3871 s_save (SCHEME_A_ OP_C1STREAM, NIL, cdr (SCHEME_V->code)); 3831 s_save (SCHEME_A_ OP_C1STREAM, NIL, cdr (SCHEME_V->code));
3872 SCHEME_V->code = car (SCHEME_V->code); 3832 SCHEME_V->code = car (SCHEME_V->code);
3873 s_goto (OP_EVAL); 3833 s_goto (OP_EVAL);
3874 3834
3875 case OP_C1STREAM: /* cons-stream */ 3835 case OP_C1STREAM: /* cons-stream */
3876 SCHEME_V->args = SCHEME_V->value; /* save SCHEME_V->value to register SCHEME_V->args for gc */ 3836 SCHEME_V->args = SCHEME_V->value; /* save SCHEME_V->value to register args for gc */
3877 x = mk_closure (SCHEME_A_ cons (NIL, SCHEME_V->code), SCHEME_V->envir); 3837 x = mk_closure (SCHEME_A_ cons (NIL, SCHEME_V->code), SCHEME_V->envir);
3878 set_typeflag (x, T_PROMISE); 3838 set_typeflag (x, T_PROMISE);
3879 s_return (cons (SCHEME_V->args, x)); 3839 s_return (cons (args, x));
3880 3840
3881 case OP_MACRO0: /* macro */ 3841 case OP_MACRO0: /* macro */
3882 if (is_pair (car (SCHEME_V->code))) 3842 if (is_pair (car (SCHEME_V->code)))
3883 { 3843 {
3884 x = caar (SCHEME_V->code); 3844 x = caar (SCHEME_V->code);
… …
3917 { 3877 {
3918 if (!is_pair (y = caar (x))) 3878 if (!is_pair (y = caar (x)))
3919 break; 3879 break;
3920 3880
3921 for (; y != NIL; y = cdr (y)) 3881 for (; y != NIL; y = cdr (y))
3922 {
3923 if (eqv (car (y), SCHEME_V->value)) 3882 if (eqv (car (y), SCHEME_V->value))
3924 break; 3883 break;
3925 }
3926 3884
3927 if (y != NIL) 3885 if (y != NIL)
3928 break; 3886 break;
3929 } 3887 }
3930 3888
… …
3950 s_goto (OP_BEGIN); 3908 s_goto (OP_BEGIN);
3951 else 3909 else
3952 s_return (NIL); 3910 s_return (NIL);
3953 3911
3954 case OP_PAPPLY: /* apply */ 3912 case OP_PAPPLY: /* apply */
3955 SCHEME_V->code = car (SCHEME_V->args); 3913 SCHEME_V->code = car (args);
3956 SCHEME_V->args = list_star (SCHEME_A_ cdr (SCHEME_V->args)); 3914 SCHEME_V->args = list_star (SCHEME_A_ cdr (args));
3957 /*SCHEME_V->args = cadr(SCHEME_V->args); */ 3915 /*SCHEME_V->args = cadr(args); */
3958 s_goto (OP_APPLY); 3916 s_goto (OP_APPLY);
3959 3917
3960 case OP_PEVAL: /* eval */ 3918 case OP_PEVAL: /* eval */
3961 if (cdr (SCHEME_V->args) != NIL) 3919 if (cdr (args) != NIL)
3962 SCHEME_V->envir = cadr (SCHEME_V->args); 3920 SCHEME_V->envir = cadr (args);
3963 3921
3964 SCHEME_V->code = car (SCHEME_V->args); 3922 SCHEME_V->code = car (args);
3965 s_goto (OP_EVAL); 3923 s_goto (OP_EVAL);
3966 3924
3967 case OP_CONTINUATION: /* call-with-current-continuation */ 3925 case OP_CONTINUATION: /* call-with-current-continuation */
3968 SCHEME_V->code = car (SCHEME_V->args); 3926 SCHEME_V->code = car (args);
3969 SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL); 3927 SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL);
3970 s_goto (OP_APPLY); 3928 s_goto (OP_APPLY);
3971 } 3929 }
3972 3930
3973 return S_T; 3931 if (USE_ERROR_CHECKING) abort ();
3974} 3932}
3975 3933
3976static pointer 3934static int
3977opexe_2 (SCHEME_P_ enum scheme_opcodes op) 3935opexe_1 (SCHEME_P_ enum scheme_opcodes op)
3978{ 3936{
3979 pointer x; 3937 pointer args = SCHEME_V->args;
3938 pointer x = car (args);
3980 num v; 3939 num v;
3981 3940
3941 switch (op)
3942 {
3982#if USE_MATH 3943#if USE_MATH
3983 RVALUE dd;
3984#endif
3985
3986 switch (op)
3987 {
3988#if USE_MATH
3989
3990 case OP_INEX2EX: /* inexact->exact */ 3944 case OP_INEX2EX: /* inexact->exact */
3991 x = car (SCHEME_V->args); 3945 {
3992
3993 if (num_is_integer (x)) 3946 if (is_integer (x))
3994 s_return (x); 3947 s_return (x);
3995 else if (modf (rvalue_unchecked (x), &dd) == 0.0) 3948
3949 RVALUE r = rvalue_unchecked (x);
3950
3951 if (r == (RVALUE)(IVALUE)r)
3996 s_return (mk_integer (SCHEME_A_ ivalue (x))); 3952 s_return (mk_integer (SCHEME_A_ rvalue_unchecked (x)));
3997 else 3953 else
3998 Error_1 ("inexact->exact: not integral:", x); 3954 Error_1 ("inexact->exact: not integral:", x);
3955 }
3999 3956
4000 case OP_EXP:
4001 x = car (SCHEME_V->args);
4002 s_return (mk_real (SCHEME_A_ exp (rvalue (x)))); 3957 case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x))));
4003
4004 case OP_LOG:
4005 x = car (SCHEME_V->args);
4006 s_return (mk_real (SCHEME_A_ log (rvalue (x)))); 3958 case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x))));
4007
4008 case OP_SIN:
4009 x = car (SCHEME_V->args);
4010 s_return (mk_real (SCHEME_A_ sin (rvalue (x)))); 3959 case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x))));
4011
4012 case OP_COS:
4013 x = car (SCHEME_V->args);
4014 s_return (mk_real (SCHEME_A_ cos (rvalue (x)))); 3960 case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x))));
4015
4016 case OP_TAN:
4017 x = car (SCHEME_V->args);
4018 s_return (mk_real (SCHEME_A_ tan (rvalue (x)))); 3961 case OP_TAN: s_return (mk_real (SCHEME_A_ tan (rvalue (x))));
4019
4020 case OP_ASIN:
4021 x = car (SCHEME_V->args);
4022 s_return (mk_real (SCHEME_A_ asin (rvalue (x)))); 3962 case OP_ASIN: s_return (mk_real (SCHEME_A_ asin (rvalue (x))));
4023
4024 case OP_ACOS:
4025 x = car (SCHEME_V->args);
4026 s_return (mk_real (SCHEME_A_ acos (rvalue (x)))); 3963 case OP_ACOS: s_return (mk_real (SCHEME_A_ acos (rvalue (x))));
4027 3964
4028 case OP_ATAN: 3965 case OP_ATAN:
4029 x = car (SCHEME_V->args);
4030
4031 if (cdr (SCHEME_V->args) == NIL) 3966 if (cdr (args) == NIL)
4032 s_return (mk_real (SCHEME_A_ atan (rvalue (x)))); 3967 s_return (mk_real (SCHEME_A_ atan (rvalue (x))));
4033 else 3968 else
4034 { 3969 {
4035 pointer y = cadr (SCHEME_V->args); 3970 pointer y = cadr (args);
4036
4037 s_return (mk_real (SCHEME_A_ atan2 (rvalue (x), rvalue (y)))); 3971 s_return (mk_real (SCHEME_A_ atan2 (rvalue (x), rvalue (y))));
4038 } 3972 }
4039 3973
4040 case OP_SQRT: 3974 case OP_SQRT:
4041 x = car (SCHEME_V->args);
4042 s_return (mk_real (SCHEME_A_ sqrt (rvalue (x)))); 3975 s_return (mk_real (SCHEME_A_ sqrt (rvalue (x))));
4043 3976
4044 case OP_EXPT: 3977 case OP_EXPT:
4045 { 3978 {
4046 RVALUE result; 3979 RVALUE result;
4047 int real_result = 1; 3980 int real_result = 1;
4048 pointer y = cadr (SCHEME_V->args); 3981 pointer y = cadr (args);
4049 3982
4050 x = car (SCHEME_V->args);
4051
4052 if (num_is_integer (x) && num_is_integer (y)) 3983 if (is_integer (x) && is_integer (y))
4053 real_result = 0; 3984 real_result = 0;
4054 3985
4055 /* This 'if' is an R5RS compatibility fix. */ 3986 /* This 'if' is an R5RS compatibility fix. */
4056 /* NOTE: Remove this 'if' fix for R6RS. */ 3987 /* NOTE: Remove this 'if' fix for R6RS. */
4057 if (rvalue (x) == 0 && rvalue (y) < 0) 3988 if (rvalue (x) == 0 && rvalue (y) < 0)
4058 result = 0.0; 3989 result = 0;
4059 else 3990 else
4060 result = pow (rvalue (x), rvalue (y)); 3991 result = pow (rvalue (x), rvalue (y));
4061 3992
4062 /* Before returning integer result make sure we can. */ 3993 /* Before returning integer result make sure we can. */
4063 /* If the test fails, result is too big for integer. */ 3994 /* If the test fails, result is too big for integer. */
4064 if (!real_result) 3995 if (!real_result)
4065 { 3996 {
4066 long result_as_long = (long) result; 3997 long result_as_long = result;
4067 3998
4068 if (result != (RVALUE) result_as_long) 3999 if (result != result_as_long)
4069 real_result = 1; 4000 real_result = 1;
4070 } 4001 }
4071 4002
4072 if (real_result) 4003 if (real_result)
4073 s_return (mk_real (SCHEME_A_ result)); 4004 s_return (mk_real (SCHEME_A_ result));
4074 else 4005 else
4075 s_return (mk_integer (SCHEME_A_ result)); 4006 s_return (mk_integer (SCHEME_A_ result));
4076 } 4007 }
4077 4008
4078 case OP_FLOOR:
4079 x = car (SCHEME_V->args);
4080 s_return (mk_real (SCHEME_A_ floor (rvalue (x)))); 4009 case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x))));
4081
4082 case OP_CEILING:
4083 x = car (SCHEME_V->args);
4084 s_return (mk_real (SCHEME_A_ ceil (rvalue (x)))); 4010 case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x))));
4085 4011
4086 case OP_TRUNCATE: 4012 case OP_TRUNCATE:
4087 { 4013 {
4088 RVALUE rvalue_of_x; 4014 RVALUE n = rvalue (x);
4089
4090 x = car (SCHEME_V->args);
4091 rvalue_of_x = rvalue (x);
4092
4093 if (rvalue_of_x > 0)
4094 s_return (mk_real (SCHEME_A_ floor (rvalue_of_x))); 4015 s_return (mk_real (SCHEME_A_ n > 0 ? floor (n) : ceil (n)));
4095 else
4096 s_return (mk_real (SCHEME_A_ ceil (rvalue_of_x)));
4097 } 4016 }
4098 4017
4099 case OP_ROUND: 4018 case OP_ROUND:
4100 x = car (SCHEME_V->args);
4101
4102 if (num_is_integer (x)) 4019 if (is_integer (x))
4103 s_return (x); 4020 s_return (x);
4104 4021
4105 s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x)))); 4022 s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x))));
4106#endif 4023#endif
4107 4024
4108 case OP_ADD: /* + */ 4025 case OP_ADD: /* + */
4109 v = num_zero; 4026 v = num_zero;
4110 4027
4111 for (x = SCHEME_V->args; x != NIL; x = cdr (x)) 4028 for (x = args; x != NIL; x = cdr (x))
4112 v = num_add (v, nvalue (car (x))); 4029 v = num_op (NUM_ADD, v, nvalue (car (x)));
4113 4030
4114 s_return (mk_number (SCHEME_A_ v)); 4031 s_return (mk_number (SCHEME_A_ v));
4115 4032
4116 case OP_MUL: /* * */ 4033 case OP_MUL: /* * */
4117 v = num_one; 4034 v = num_one;
4118 4035
4119 for (x = SCHEME_V->args; x != NIL; x = cdr (x)) 4036 for (x = args; x != NIL; x = cdr (x))
4120 v = num_mul (v, nvalue (car (x))); 4037 v = num_op (NUM_MUL, v, nvalue (car (x)));
4121 4038
4122 s_return (mk_number (SCHEME_A_ v)); 4039 s_return (mk_number (SCHEME_A_ v));
4123 4040
4124 case OP_SUB: /* - */ 4041 case OP_SUB: /* - */
4125 if (cdr (SCHEME_V->args) == NIL) 4042 if (cdr (args) == NIL)
4126 { 4043 {
4127 x = SCHEME_V->args; 4044 x = args;
4128 v = num_zero; 4045 v = num_zero;
4129 } 4046 }
4130 else 4047 else
4131 { 4048 {
4132 x = cdr (SCHEME_V->args); 4049 x = cdr (args);
4133 v = nvalue (car (SCHEME_V->args)); 4050 v = nvalue (car (args));
4134 } 4051 }
4135 4052
4136 for (; x != NIL; x = cdr (x)) 4053 for (; x != NIL; x = cdr (x))
4137 v = num_sub (v, nvalue (car (x))); 4054 v = num_op (NUM_SUB, v, nvalue (car (x)));
4138 4055
4139 s_return (mk_number (SCHEME_A_ v)); 4056 s_return (mk_number (SCHEME_A_ v));
4140 4057
4141 case OP_DIV: /* / */ 4058 case OP_DIV: /* / */
4142 if (cdr (SCHEME_V->args) == NIL) 4059 if (cdr (args) == NIL)
4143 { 4060 {
4144 x = SCHEME_V->args; 4061 x = args;
4145 v = num_one; 4062 v = num_one;
4146 } 4063 }
4147 else 4064 else
4148 { 4065 {
4149 x = cdr (SCHEME_V->args); 4066 x = cdr (args);
4150 v = nvalue (car (SCHEME_V->args)); 4067 v = nvalue (car (args));
4151 } 4068 }
4152 4069
4153 for (; x != NIL; x = cdr (x)) 4070 for (; x != NIL; x = cdr (x))
4154 {
4155 if (!is_zero_rvalue (rvalue (car (x)))) 4071 if (!is_zero_rvalue (rvalue (car (x))))
4156 v = num_div (v, nvalue (car (x))); 4072 v = num_div (v, nvalue (car (x)));
4157 else 4073 else
4158 Error_0 ("/: division by zero"); 4074 Error_0 ("/: division by zero");
4159 }
4160 4075
4161 s_return (mk_number (SCHEME_A_ v)); 4076 s_return (mk_number (SCHEME_A_ v));
4162 4077
4163 case OP_INTDIV: /* quotient */ 4078 case OP_INTDIV: /* quotient */
4164 if (cdr (SCHEME_V->args) == NIL) 4079 if (cdr (args) == NIL)
4165 { 4080 {
4166 x = SCHEME_V->args; 4081 x = args;
4167 v = num_one; 4082 v = num_one;
4168 } 4083 }
4169 else 4084 else
4170 { 4085 {
4171 x = cdr (SCHEME_V->args); 4086 x = cdr (args);
4172 v = nvalue (car (SCHEME_V->args)); 4087 v = nvalue (car (args));
4173 } 4088 }
4174 4089
4175 for (; x != NIL; x = cdr (x)) 4090 for (; x != NIL; x = cdr (x))
4176 { 4091 {
4177 if (ivalue (car (x)) != 0) 4092 if (ivalue (car (x)) != 0)
4178 v = num_intdiv (v, nvalue (car (x))); 4093 v = num_op (NUM_INTDIV, v, nvalue (car (x)));
4179 else 4094 else
4180 Error_0 ("quotient: division by zero"); 4095 Error_0 ("quotient: division by zero");
4181 } 4096 }
4182 4097
4183 s_return (mk_number (SCHEME_A_ v)); 4098 s_return (mk_number (SCHEME_A_ v));
4184 4099
4185 case OP_REM: /* remainder */ 4100 case OP_REM: /* remainder */
4186 v = nvalue (car (SCHEME_V->args)); 4101 v = nvalue (x);
4187 4102
4188 if (ivalue (cadr (SCHEME_V->args)) != 0) 4103 if (ivalue (cadr (args)) != 0)
4189 v = num_rem (v, nvalue (cadr (SCHEME_V->args))); 4104 v = num_rem (v, nvalue (cadr (args)));
4190 else 4105 else
4191 Error_0 ("remainder: division by zero"); 4106 Error_0 ("remainder: division by zero");
4192 4107
4193 s_return (mk_number (SCHEME_A_ v)); 4108 s_return (mk_number (SCHEME_A_ v));
4194 4109
4195 case OP_MOD: /* modulo */ 4110 case OP_MOD: /* modulo */
4196 v = nvalue (car (SCHEME_V->args)); 4111 v = nvalue (x);
4197 4112
4198 if (ivalue (cadr (SCHEME_V->args)) != 0) 4113 if (ivalue (cadr (args)) != 0)
4199 v = num_mod (v, nvalue (cadr (SCHEME_V->args))); 4114 v = num_mod (v, nvalue (cadr (args)));
4200 else 4115 else
4201 Error_0 ("modulo: division by zero"); 4116 Error_0 ("modulo: division by zero");
4202 4117
4203 s_return (mk_number (SCHEME_A_ v)); 4118 s_return (mk_number (SCHEME_A_ v));
4204 4119
4205 case OP_CAR: /* car */ 4120 case OP_CAR: /* car */
4206 s_return (caar (SCHEME_V->args)); 4121 s_return (caar (args));
4207 4122
4208 case OP_CDR: /* cdr */ 4123 case OP_CDR: /* cdr */
4209 s_return (cdar (SCHEME_V->args)); 4124 s_return (cdar (args));
4210 4125
4211 case OP_CONS: /* cons */ 4126 case OP_CONS: /* cons */
4212 set_cdr (SCHEME_V->args, cadr (SCHEME_V->args)); 4127 set_cdr (args, cadr (args));
4213 s_return (SCHEME_V->args); 4128 s_return (args);
4214 4129
4215 case OP_SETCAR: /* set-car! */ 4130 case OP_SETCAR: /* set-car! */
4216 if (!is_immutable (car (SCHEME_V->args))) 4131 if (!is_immutable (x))
4217 { 4132 {
4218 set_car (car (SCHEME_V->args), cadr (SCHEME_V->args)); 4133 set_car (x, cadr (args));
4219 s_return (car (SCHEME_V->args)); 4134 s_return (car (args));
4220 } 4135 }
4221 else 4136 else
4222 Error_0 ("set-car!: unable to alter immutable pair"); 4137 Error_0 ("set-car!: unable to alter immutable pair");
4223 4138
4224 case OP_SETCDR: /* set-cdr! */ 4139 case OP_SETCDR: /* set-cdr! */
4225 if (!is_immutable (car (SCHEME_V->args))) 4140 if (!is_immutable (x))
4226 { 4141 {
4227 set_cdr (car (SCHEME_V->args), cadr (SCHEME_V->args)); 4142 set_cdr (x, cadr (args));
4228 s_return (car (SCHEME_V->args)); 4143 s_return (car (args));
4229 } 4144 }
4230 else 4145 else
4231 Error_0 ("set-cdr!: unable to alter immutable pair"); 4146 Error_0 ("set-cdr!: unable to alter immutable pair");
4232 4147
4233 case OP_CHAR2INT: /* char->integer */ 4148 case OP_CHAR2INT: /* char->integer */
4234 s_return (mk_integer (SCHEME_A_ ivalue (car (SCHEME_V->args)))); 4149 s_return (mk_integer (SCHEME_A_ ivalue_unchecked (x)));
4235 4150
4236 case OP_INT2CHAR: /* integer->char */ 4151 case OP_INT2CHAR: /* integer->char */
4237 s_return (mk_character (SCHEME_A_ ivalue (car (SCHEME_V->args)))); 4152 s_return (mk_character (SCHEME_A_ ivalue_unchecked (x)));
4238 4153
4239 case OP_CHARUPCASE: 4154 case OP_CHARUPCASE:
4240 { 4155 {
4241 unsigned char c = ivalue (car (SCHEME_V->args)); 4156 unsigned char c = ivalue_unchecked (x);
4242 c = toupper (c); 4157 c = toupper (c);
4243 s_return (mk_character (SCHEME_A_ c)); 4158 s_return (mk_character (SCHEME_A_ c));
4244 } 4159 }
4245 4160
4246 case OP_CHARDNCASE: 4161 case OP_CHARDNCASE:
4247 { 4162 {
4248 unsigned char c = ivalue (car (SCHEME_V->args)); 4163 unsigned char c = ivalue_unchecked (x);
4249 c = tolower (c); 4164 c = tolower (c);
4250 s_return (mk_character (SCHEME_A_ c)); 4165 s_return (mk_character (SCHEME_A_ c));
4251 } 4166 }
4252 4167
4253 case OP_STR2SYM: /* string->symbol */ 4168 case OP_STR2SYM: /* string->symbol */
4254 s_return (mk_symbol (SCHEME_A_ strvalue (car (SCHEME_V->args)))); 4169 s_return (mk_symbol (SCHEME_A_ strvalue (x)));
4255 4170
4256 case OP_STR2ATOM: /* string->atom */ 4171 case OP_STR2ATOM: /* string->atom */
4257 { 4172 {
4258 char *s = strvalue (car (SCHEME_V->args)); 4173 char *s = strvalue (x);
4259 long pf = 0; 4174 long pf = 0;
4260 4175
4261 if (cdr (SCHEME_V->args) != NIL) 4176 if (cdr (args) != NIL)
4262 { 4177 {
4263 /* we know cadr(SCHEME_V->args) is a natural number */ 4178 /* we know cadr(args) is a natural number */
4264 /* see if it is 2, 8, 10, or 16, or error */ 4179 /* see if it is 2, 8, 10, or 16, or error */
4265 pf = ivalue_unchecked (cadr (SCHEME_V->args)); 4180 pf = ivalue_unchecked (cadr (args));
4266 4181
4267 if (pf == 16 || pf == 10 || pf == 8 || pf == 2) 4182 if (pf == 16 || pf == 10 || pf == 8 || pf == 2)
4268 { 4183 {
4269 /* base is OK */ 4184 /* base is OK */
4270 } 4185 }
4271 else 4186 else
4272 pf = -1; 4187 pf = -1;
4273 } 4188 }
4274 4189
4275 if (pf < 0) 4190 if (pf < 0)
4276 Error_1 ("string->atom: bad base:", cadr (SCHEME_V->args)); 4191 Error_1 ("string->atom: bad base:", cadr (args));
4277 else if (*s == '#') /* no use of base! */ 4192 else if (*s == '#') /* no use of base! */
4278 s_return (mk_sharp_const (SCHEME_A_ s + 1)); 4193 s_return (mk_sharp_const (SCHEME_A_ s + 1));
4279 else 4194 else
4280 { 4195 {
4281 if (pf == 0 || pf == 10) 4196 if (pf == 0 || pf == 10)
… …
4292 } 4207 }
4293 } 4208 }
4294 } 4209 }
4295 4210
4296 case OP_SYM2STR: /* symbol->string */ 4211 case OP_SYM2STR: /* symbol->string */
4297 x = mk_string (SCHEME_A_ symname (car (SCHEME_V->args))); 4212 x = mk_string (SCHEME_A_ symname (x));
4298 setimmutable (x); 4213 setimmutable (x);
4299 s_return (x); 4214 s_return (x);
4300 4215
4301 case OP_ATOM2STR: /* atom->string */ 4216 case OP_ATOM2STR: /* atom->string */
4302 { 4217 {
4303 long pf = 0; 4218 long pf = 0;
4304 4219
4305 x = car (SCHEME_V->args);
4306
4307 if (cdr (SCHEME_V->args) != NIL) 4220 if (cdr (args) != NIL)
4308 { 4221 {
4309 /* we know cadr(SCHEME_V->args) is a natural number */ 4222 /* we know cadr(args) is a natural number */
4310 /* see if it is 2, 8, 10, or 16, or error */ 4223 /* see if it is 2, 8, 10, or 16, or error */
4311 pf = ivalue_unchecked (cadr (SCHEME_V->args)); 4224 pf = ivalue_unchecked (cadr (args));
4312 4225
4313 if (is_number (x) && (pf == 16 || pf == 10 || pf == 8 || pf == 2)) 4226 if (is_number (x) && (pf == 16 || pf == 10 || pf == 8 || pf == 2))
4314 { 4227 {
4315 /* base is OK */ 4228 /* base is OK */
4316 } 4229 }
4317 else 4230 else
4318 pf = -1; 4231 pf = -1;
4319 } 4232 }
4320 4233
4321 if (pf < 0) 4234 if (pf < 0)
4322 Error_1 ("atom->string: bad base:", cadr (SCHEME_V->args)); 4235 Error_1 ("atom->string: bad base:", cadr (args));
4323 else if (is_number (x) || is_character (x) || is_string (x) || is_symbol (x)) 4236 else if (is_number (x) || is_character (x) || is_string (x) || is_symbol (x))
4324 { 4237 {
4325 char *p; 4238 char *p;
4326 int len; 4239 int len;
4327 4240
… …
4332 Error_1 ("atom->string: not an atom:", x); 4245 Error_1 ("atom->string: not an atom:", x);
4333 } 4246 }
4334 4247
4335 case OP_MKSTRING: /* make-string */ 4248 case OP_MKSTRING: /* make-string */
4336 { 4249 {
4337 int fill = ' '; 4250 int fill = cdr (args) != NIL ? charvalue (cadr (args)) : ' ';
4338 int len; 4251 int len = ivalue_unchecked (x);
4339 4252
4340 len = ivalue (car (SCHEME_V->args));
4341
4342 if (cdr (SCHEME_V->args) != NIL)
4343 fill = charvalue (cadr (SCHEME_V->args));
4344
4345 s_return (mk_empty_string (SCHEME_A_ len, (char) fill)); 4253 s_return (mk_empty_string (SCHEME_A_ len, fill));
4346 } 4254 }
4347 4255
4348 case OP_STRLEN: /* string-length */ 4256 case OP_STRLEN: /* string-length */
4349 s_return (mk_integer (SCHEME_A_ strlength (car (SCHEME_V->args)))); 4257 s_return (mk_integer (SCHEME_A_ strlength (x)));
4350 4258
4351 case OP_STRREF: /* string-ref */ 4259 case OP_STRREF: /* string-ref */
4352 { 4260 {
4353 char *str; 4261 char *str = strvalue (x);
4354 int index;
4355
4356 str = strvalue (car (SCHEME_V->args));
4357
4358 index = ivalue (cadr (SCHEME_V->args)); 4262 int index = ivalue_unchecked (cadr (args));
4359 4263
4360 if (index >= strlength (car (SCHEME_V->args))) 4264 if (index >= strlength (x))
4361 Error_1 ("string-ref: out of bounds:", cadr (SCHEME_V->args)); 4265 Error_1 ("string-ref: out of bounds:", cadr (args));
4362 4266
4363 s_return (mk_character (SCHEME_A_ ((unsigned char *) str)[index])); 4267 s_return (mk_character (SCHEME_A_ ((unsigned char *)str)[index]));
4364 } 4268 }
4365 4269
4366 case OP_STRSET: /* string-set! */ 4270 case OP_STRSET: /* string-set! */
4367 { 4271 {
4368 char *str; 4272 char *str = strvalue (x);
4369 int index; 4273 int index = ivalue_unchecked (cadr (args));
4370 int c; 4274 int c;
4371 4275
4372 if (is_immutable (car (SCHEME_V->args))) 4276 if (is_immutable (x))
4373 Error_1 ("string-set!: unable to alter immutable string:", car (SCHEME_V->args)); 4277 Error_1 ("string-set!: unable to alter immutable string:", x);
4374 4278
4375 str = strvalue (car (SCHEME_V->args));
4376
4377 index = ivalue (cadr (SCHEME_V->args));
4378
4379 if (index >= strlength (car (SCHEME_V->args))) 4279 if (index >= strlength (x))
4380 Error_1 ("string-set!: out of bounds:", cadr (SCHEME_V->args)); 4280 Error_1 ("string-set!: out of bounds:", cadr (args));
4381 4281
4382 c = charvalue (caddr (SCHEME_V->args)); 4282 c = charvalue (caddr (args));
4383 4283
4384 str[index] = (char) c; 4284 str[index] = c;
4385 s_return (car (SCHEME_V->args)); 4285 s_return (car (args));
4386 } 4286 }
4387 4287
4388 case OP_STRAPPEND: /* string-append */ 4288 case OP_STRAPPEND: /* string-append */
4389 { 4289 {
4390 /* in 1.29 string-append was in Scheme in init.scm but was too slow */ 4290 /* in 1.29 string-append was in Scheme in init.scm but was too slow */
4391 int len = 0; 4291 int len = 0;
4392 pointer newstr; 4292 pointer newstr;
4393 char *pos; 4293 char *pos;
4394 4294
4395 /* compute needed length for new string */ 4295 /* compute needed length for new string */
4396 for (x = SCHEME_V->args; x != NIL; x = cdr (x)) 4296 for (x = args; x != NIL; x = cdr (x))
4397 len += strlength (car (x)); 4297 len += strlength (car (x));
4398 4298
4399 newstr = mk_empty_string (SCHEME_A_ len, ' '); 4299 newstr = mk_empty_string (SCHEME_A_ len, ' ');
4400 4300
4401 /* store the contents of the argument strings into the new string */ 4301 /* store the contents of the argument strings into the new string */
4402 for (pos = strvalue (newstr), x = SCHEME_V->args; x != NIL; pos += strlength (car (x)), x = cdr (x)) 4302 for (pos = strvalue (newstr), x = args; x != NIL; pos += strlength (car (x)), x = cdr (x))
4403 memcpy (pos, strvalue (car (x)), strlength (car (x))); 4303 memcpy (pos, strvalue (car (x)), strlength (car (x)));
4404 4304
4405 s_return (newstr); 4305 s_return (newstr);
4406 } 4306 }
4407 4307
4408 case OP_SUBSTR: /* substring */ 4308 case OP_SUBSTR: /* substring */
4409 { 4309 {
4410 char *str; 4310 char *str = strvalue (x);
4411 int index0; 4311 int index0 = ivalue_unchecked (cadr (args));
4412 int index1; 4312 int index1;
4413 int len; 4313 int len;
4414 4314
4415 str = strvalue (car (SCHEME_V->args));
4416
4417 index0 = ivalue (cadr (SCHEME_V->args));
4418
4419 if (index0 > strlength (car (SCHEME_V->args))) 4315 if (index0 > strlength (x))
4420 Error_1 ("substring: start out of bounds:", cadr (SCHEME_V->args)); 4316 Error_1 ("substring: start out of bounds:", cadr (args));
4421 4317
4422 if (cddr (SCHEME_V->args) != NIL) 4318 if (cddr (args) != NIL)
4423 { 4319 {
4424 index1 = ivalue (caddr (SCHEME_V->args)); 4320 index1 = ivalue_unchecked (caddr (args));
4425 4321
4426 if (index1 > strlength (car (SCHEME_V->args)) || index1 < index0) 4322 if (index1 > strlength (x) || index1 < index0)
4427 Error_1 ("substring: end out of bounds:", caddr (SCHEME_V->args)); 4323 Error_1 ("substring: end out of bounds:", caddr (args));
4428 } 4324 }
4429 else 4325 else
4430 index1 = strlength (car (SCHEME_V->args)); 4326 index1 = strlength (x);
4431 4327
4432 len = index1 - index0; 4328 len = index1 - index0;
4433 x = mk_empty_string (SCHEME_A_ len, ' '); 4329 x = mk_empty_string (SCHEME_A_ len, ' ');
4434 memcpy (strvalue (x), str + index0, len); 4330 memcpy (strvalue (x), str + index0, len);
4435 strvalue (x)[len] = 0; 4331 strvalue (x)[len] = 0;
… …
4439 4335
4440 case OP_VECTOR: /* vector */ 4336 case OP_VECTOR: /* vector */
4441 { 4337 {
4442 int i; 4338 int i;
4443 pointer vec; 4339 pointer vec;
4444 int len = list_length (SCHEME_A_ SCHEME_V->args); 4340 int len = list_length (SCHEME_A_ args);
4445 4341
4446 if (len < 0) 4342 if (len < 0)
4447 Error_1 ("vector: not a proper list:", SCHEME_V->args); 4343 Error_1 ("vector: not a proper list:", args);
4448 4344
4449 vec = mk_vector (SCHEME_A_ len); 4345 vec = mk_vector (SCHEME_A_ len);
4450 4346
4451#if USE_ERROR_CHECKING 4347#if USE_ERROR_CHECKING
4452 if (SCHEME_V->no_memory) 4348 if (SCHEME_V->no_memory)
4453 s_return (S_SINK); 4349 s_return (S_SINK);
4454#endif 4350#endif
4455 4351
4456 for (x = SCHEME_V->args, i = 0; is_pair (x); x = cdr (x), i++) 4352 for (x = args, i = 0; is_pair (x); x = cdr (x), i++)
4457 set_vector_elem (vec, i, car (x)); 4353 vector_set (vec, i, car (x));
4458 4354
4459 s_return (vec); 4355 s_return (vec);
4460 } 4356 }
4461 4357
4462 case OP_MKVECTOR: /* make-vector */ 4358 case OP_MKVECTOR: /* make-vector */
4463 { 4359 {
4464 pointer fill = NIL; 4360 pointer fill = NIL;
4465 int len;
4466 pointer vec; 4361 pointer vec;
4362 int len = ivalue_unchecked (x);
4467 4363
4468 len = ivalue (car (SCHEME_V->args));
4469
4470 if (cdr (SCHEME_V->args) != NIL) 4364 if (cdr (args) != NIL)
4471 fill = cadr (SCHEME_V->args); 4365 fill = cadr (args);
4472 4366
4473 vec = mk_vector (SCHEME_A_ len); 4367 vec = mk_vector (SCHEME_A_ len);
4474 4368
4475#if USE_ERROR_CHECKING 4369#if USE_ERROR_CHECKING
4476 if (SCHEME_V->no_memory) 4370 if (SCHEME_V->no_memory)
4477 s_return (S_SINK); 4371 s_return (S_SINK);
4478#endif 4372#endif
4479 4373
4480 if (fill != NIL) 4374 if (fill != NIL)
4481 fill_vector (vec, fill); 4375 fill_vector (vec, 0, fill);
4482 4376
4483 s_return (vec); 4377 s_return (vec);
4484 } 4378 }
4485 4379
4486 case OP_VECLEN: /* vector-length */ 4380 case OP_VECLEN: /* vector-length */
4487 s_return (mk_integer (SCHEME_A_ veclength (car (SCHEME_V->args)))); 4381 s_return (mk_integer (SCHEME_A_ veclength (x)));
4488 4382
4489 case OP_VECREF: /* vector-ref */ 4383 case OP_VECREF: /* vector-ref */
4490 { 4384 {
4491 int index;
4492
4493 index = ivalue (cadr (SCHEME_V->args)); 4385 int index = ivalue_unchecked (cadr (args));
4494 4386
4495 if (index >= veclength (car (SCHEME_V->args)) && USE_ERROR_CHECKING) 4387 if (index >= veclength (car (args)) && USE_ERROR_CHECKING)
4496 Error_1 ("vector-ref: out of bounds:", cadr (SCHEME_V->args)); 4388 Error_1 ("vector-ref: out of bounds:", cadr (args));
4497 4389
4498 s_return (vector_elem (car (SCHEME_V->args), index)); 4390 s_return (vector_get (x, index));
4499 } 4391 }
4500 4392
4501 case OP_VECSET: /* vector-set! */ 4393 case OP_VECSET: /* vector-set! */
4502 { 4394 {
4503 int index; 4395 int index = ivalue_unchecked (cadr (args));
4504 4396
4505 if (is_immutable (car (SCHEME_V->args))) 4397 if (is_immutable (x))
4506 Error_1 ("vector-set!: unable to alter immutable vector:", car (SCHEME_V->args)); 4398 Error_1 ("vector-set!: unable to alter immutable vector:", x);
4507 4399
4508 index = ivalue (cadr (SCHEME_V->args));
4509
4510 if (index >= veclength (car (SCHEME_V->args)) && USE_ERROR_CHECKING) 4400 if (index >= veclength (car (args)) && USE_ERROR_CHECKING)
4511 Error_1 ("vector-set!: out of bounds:", cadr (SCHEME_V->args)); 4401 Error_1 ("vector-set!: out of bounds:", cadr (args));
4512 4402
4513 set_vector_elem (car (SCHEME_V->args), index, caddr (SCHEME_V->args)); 4403 vector_set (x, index, caddr (args));
4514 s_return (car (SCHEME_V->args)); 4404 s_return (x);
4515 } 4405 }
4516 } 4406 }
4517 4407
4518 return S_T; 4408 if (USE_ERROR_CHECKING) abort ();
4519} 4409}
4520 4410
4521INTERFACE int 4411static int
4522is_list (SCHEME_P_ pointer a) 4412opexe_2 (SCHEME_P_ enum scheme_opcodes op)
4523{ 4413{
4524 return list_length (SCHEME_A_ a) >= 0; 4414 pointer x = SCHEME_V->args;
4525}
4526 4415
4527/* Result is: 4416 for (;;)
4528 proper list: length
4529 circular list: -1
4530 not even a pair: -2
4531 dotted list: -2 minus length before dot
4532*/
4533INTERFACE int
4534list_length (SCHEME_P_ pointer a)
4535{
4536 int i = 0;
4537 pointer slow, fast;
4538
4539 slow = fast = a;
4540
4541 while (1)
4542 { 4417 {
4418 num v = nvalue (car (x));
4419 x = cdr (x);
4420
4543 if (fast == NIL) 4421 if (x == NIL)
4544 return i; 4422 break;
4545 4423
4546 if (!is_pair (fast)) 4424 int r = num_cmp (v, nvalue (car (x)));
4547 return -2 - i;
4548 4425
4549 fast = cdr (fast); 4426 switch (op)
4550 ++i;
4551
4552 if (fast == NIL)
4553 return i;
4554
4555 if (!is_pair (fast))
4556 return -2 - i;
4557
4558 ++i;
4559 fast = cdr (fast);
4560
4561 /* Safe because we would have already returned if `fast'
4562 encountered a non-pair. */
4563 slow = cdr (slow);
4564
4565 if (fast == slow)
4566 { 4427 {
4567 /* the fast pointer has looped back around and caught up 4428 case OP_NUMEQ: r = r == 0; break;
4568 with the slow pointer, hence the structure is circular, 4429 case OP_LESS: r = r < 0; break;
4569 not of finite length, and therefore not a list */ 4430 case OP_GRE: r = r > 0; break;
4570 return -1; 4431 case OP_LEQ: r = r <= 0; break;
4432 case OP_GEQ: r = r >= 0; break;
4571 } 4433 }
4572 }
4573}
4574 4434
4435 if (!r)
4436 s_return (S_F);
4437 }
4438
4439 s_return (S_T);
4440}
4441
4575static pointer 4442static int
4576opexe_3 (SCHEME_P_ enum scheme_opcodes op) 4443opexe_3 (SCHEME_P_ enum scheme_opcodes op)
4577{ 4444{
4578 pointer x; 4445 pointer args = SCHEME_V->args;
4579 num v; 4446 pointer a = car (args);
4580 int (*comp_func) (num, num); 4447 pointer d = cdr (args);
4448 int r;
4581 4449
4582 switch (op) 4450 switch (op)
4583 { 4451 {
4584 case OP_NOT: /* not */ 4452 case OP_NOT: /* not */ r = is_false (a) ; break;
4585 s_retbool (is_false (car (SCHEME_V->args))); 4453 case OP_BOOLP: /* boolean? */ r = a == S_F || a == S_T; break;
4454 case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break;
4455 case OP_NULLP: /* null? */ r = a == NIL ; break;
4456 case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break;
4457 case OP_NUMBERP: /* number? */ r = is_number (a) ; break;
4458 case OP_STRINGP: /* string? */ r = is_string (a) ; break;
4459 case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break;
4460 case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */
4461 case OP_CHARP: /* char? */ r = is_character (a) ; break;
4586 4462
4587 case OP_BOOLP: /* boolean? */
4588 s_retbool (car (SCHEME_V->args) == S_F || car (SCHEME_V->args) == S_T);
4589
4590 case OP_EOFOBJP: /* boolean? */
4591 s_retbool (car (SCHEME_V->args) == S_EOF);
4592
4593 case OP_NULLP: /* null? */
4594 s_retbool (car (SCHEME_V->args) == NIL);
4595
4596 case OP_NUMEQ: /* = */
4597 case OP_LESS: /* < */
4598 case OP_GRE: /* > */
4599 case OP_LEQ: /* <= */
4600 case OP_GEQ: /* >= */
4601 switch (op)
4602 {
4603 case OP_NUMEQ:
4604 comp_func = num_eq;
4605 break;
4606
4607 case OP_LESS:
4608 comp_func = num_lt;
4609 break;
4610
4611 case OP_GRE:
4612 comp_func = num_gt;
4613 break;
4614
4615 case OP_LEQ:
4616 comp_func = num_le;
4617 break;
4618
4619 case OP_GEQ:
4620 comp_func = num_ge;
4621 break;
4622 }
4623
4624 x = SCHEME_V->args;
4625 v = nvalue (car (x));
4626 x = cdr (x);
4627
4628 for (; x != NIL; x = cdr (x))
4629 {
4630 if (!comp_func (v, nvalue (car (x))))
4631 s_retbool (0);
4632
4633 v = nvalue (car (x));
4634 }
4635
4636 s_retbool (1);
4637
4638 case OP_SYMBOLP: /* symbol? */
4639 s_retbool (is_symbol (car (SCHEME_V->args)));
4640
4641 case OP_NUMBERP: /* number? */
4642 s_retbool (is_number (car (SCHEME_V->args)));
4643
4644 case OP_STRINGP: /* string? */
4645 s_retbool (is_string (car (SCHEME_V->args)));
4646
4647 case OP_INTEGERP: /* integer? */
4648 s_retbool (is_integer (car (SCHEME_V->args)));
4649
4650 case OP_REALP: /* real? */
4651 s_retbool (is_number (car (SCHEME_V->args))); /* All numbers are real */
4652
4653 case OP_CHARP: /* char? */
4654 s_retbool (is_character (car (SCHEME_V->args)));
4655#if USE_CHAR_CLASSIFIERS 4463#if USE_CHAR_CLASSIFIERS
4656 4464 case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue_unchecked (a)); break;
4657 case OP_CHARAP: /* char-alphabetic? */ 4465 case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue_unchecked (a)); break;
4658 s_retbool (Cisalpha (ivalue (car (SCHEME_V->args)))); 4466 case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue_unchecked (a)); break;
4659 4467 case OP_CHARUP: /* char-upper-case? */ r = Cisupper (ivalue_unchecked (a)); break;
4660 case OP_CHARNP: /* char-numeric? */ 4468 case OP_CHARLP: /* char-lower-case? */ r = Cislower (ivalue_unchecked (a)); break;
4661 s_retbool (Cisdigit (ivalue (car (SCHEME_V->args))));
4662
4663 case OP_CHARWP: /* char-whitespace? */
4664 s_retbool (Cisspace (ivalue (car (SCHEME_V->args))));
4665
4666 case OP_CHARUP: /* char-upper-case? */
4667 s_retbool (Cisupper (ivalue (car (SCHEME_V->args))));
4668
4669 case OP_CHARLP: /* char-lower-case? */
4670 s_retbool (Cislower (ivalue (car (SCHEME_V->args))));
4671#endif 4469#endif
4470
4672#if USE_PORTS 4471#if USE_PORTS
4673 4472 case OP_PORTP: /* port? */ r = is_port (a) ; break;
4674 case OP_PORTP: /* port? */
4675 s_retbool (is_port (car (SCHEME_V->args)));
4676
4677 case OP_INPORTP: /* input-port? */ 4473 case OP_INPORTP: /* input-port? */ r = is_inport (a) ; break;
4678 s_retbool (is_inport (car (SCHEME_V->args)));
4679
4680 case OP_OUTPORTP: /* output-port? */ 4474 case OP_OUTPORTP: /* output-port? */ r = is_outport (a); break;
4681 s_retbool (is_outport (car (SCHEME_V->args)));
4682#endif 4475#endif
4683 4476
4684 case OP_PROCP: /* procedure? */ 4477 case OP_PROCP: /* procedure? */
4685 4478
4686 /*-- 4479 /*--
4687 * continuation should be procedure by the example 4480 * continuation should be procedure by the example
4688 * (call-with-current-continuation procedure?) ==> #t 4481 * (call-with-current-continuation procedure?) ==> #t
4689 * in R^3 report sec. 6.9 4482 * in R^3 report sec. 6.9
4690 */ 4483 */
4691 s_retbool (is_proc (car (SCHEME_V->args)) || is_closure (car (SCHEME_V->args)) 4484 r = is_proc (a) || is_closure (a) || is_continuation (a) || is_foreign (a);
4692 || is_continuation (car (SCHEME_V->args)) || is_foreign (car (SCHEME_V->args))); 4485 break;
4693 4486
4694 case OP_PAIRP: /* pair? */ 4487 case OP_PAIRP: /* pair? */ r = is_pair (a) ; break;
4695 s_retbool (is_pair (car (SCHEME_V->args))); 4488 case OP_LISTP: /* list? */ r = list_length (SCHEME_A_ a) >= 0; break;
4696 4489 case OP_ENVP: /* environment? */ r = is_environment (a) ; break;
4697 case OP_LISTP: /* list? */ 4490 case OP_VECTORP: /* vector? */ r = is_vector (a) ; break;
4698 s_retbool (list_length (SCHEME_A_ car (SCHEME_V->args)) >= 0); 4491 case OP_EQ: /* eq? */ r = a == cadr (args) ; break;
4699 4492 case OP_EQV: /* eqv? */ r = eqv (a, cadr (args)) ; break;
4700 case OP_ENVP: /* environment? */
4701 s_retbool (is_environment (car (SCHEME_V->args)));
4702
4703 case OP_VECTORP: /* vector? */
4704 s_retbool (is_vector (car (SCHEME_V->args)));
4705
4706 case OP_EQ: /* eq? */
4707 s_retbool (car (SCHEME_V->args) == cadr (SCHEME_V->args));
4708
4709 case OP_EQV: /* eqv? */
4710 s_retbool (eqv (car (SCHEME_V->args), cadr (SCHEME_V->args)));
4711 } 4493 }
4712 4494
4713 return S_T; 4495 s_retbool (r);
4714} 4496}
4715 4497
4716static pointer 4498static int
4717opexe_4 (SCHEME_P_ enum scheme_opcodes op) 4499opexe_4 (SCHEME_P_ enum scheme_opcodes op)
4718{ 4500{
4501 pointer args = SCHEME_V->args;
4502 pointer a = car (args);
4719 pointer x, y; 4503 pointer x, y;
4720 4504
4721 switch (op) 4505 switch (op)
4722 { 4506 {
4723 case OP_FORCE: /* force */ 4507 case OP_FORCE: /* force */
4724 SCHEME_V->code = car (SCHEME_V->args); 4508 SCHEME_V->code = a;
4725 4509
4726 if (is_promise (SCHEME_V->code)) 4510 if (is_promise (SCHEME_V->code))
4727 { 4511 {
4728 /* Should change type to closure here */ 4512 /* Should change type to closure here */
4729 s_save (SCHEME_A_ OP_SAVE_FORCED, NIL, SCHEME_V->code); 4513 s_save (SCHEME_A_ OP_SAVE_FORCED, NIL, SCHEME_V->code);
… …
4750 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL); 4534 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL);
4751 SCHEME_V->outport = cadr (SCHEME_V->args); 4535 SCHEME_V->outport = cadr (SCHEME_V->args);
4752 } 4536 }
4753 } 4537 }
4754 4538
4755 SCHEME_V->args = car (SCHEME_V->args); 4539 SCHEME_V->args = a;
4756 4540
4757 if (op == OP_WRITE) 4541 if (op == OP_WRITE)
4758 SCHEME_V->print_flag = 1; 4542 SCHEME_V->print_flag = 1;
4759 else 4543 else
4760 SCHEME_V->print_flag = 0; 4544 SCHEME_V->print_flag = 0;
4761 4545
4762 s_goto (OP_P0LIST); 4546 s_goto (OP_P0LIST);
4763 4547
4764 case OP_NEWLINE: /* newline */ 4548 case OP_NEWLINE: /* newline */
4765 if (is_pair (SCHEME_V->args)) 4549 if (is_pair (args))
4766 { 4550 {
4767 if (car (SCHEME_V->args) != SCHEME_V->outport) 4551 if (a != SCHEME_V->outport)
4768 { 4552 {
4769 x = cons (SCHEME_V->outport, NIL); 4553 x = cons (SCHEME_V->outport, NIL);
4770 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL); 4554 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL);
4771 SCHEME_V->outport = car (SCHEME_V->args); 4555 SCHEME_V->outport = a;
4772 } 4556 }
4773 } 4557 }
4774 4558
4775 putstr (SCHEME_A_ "\n"); 4559 putstr (SCHEME_A_ "\n");
4776 s_return (S_T); 4560 s_return (S_T);
4777#endif 4561#endif
4778 4562
4779 case OP_ERR0: /* error */ 4563 case OP_ERR0: /* error */
4780 SCHEME_V->retcode = -1; 4564 SCHEME_V->retcode = -1;
4781 4565
4782 if (!is_string (car (SCHEME_V->args))) 4566 if (!is_string (a))
4783 { 4567 {
4784 SCHEME_V->args = cons (mk_string (SCHEME_A_ " -- "), SCHEME_V->args); 4568 args = cons (mk_string (SCHEME_A_ " -- "), args);
4785 setimmutable (car (SCHEME_V->args)); 4569 setimmutable (car (args));
4786 } 4570 }
4787 4571
4788 putstr (SCHEME_A_ "Error: "); 4572 putstr (SCHEME_A_ "Error: ");
4789 putstr (SCHEME_A_ strvalue (car (SCHEME_V->args))); 4573 putstr (SCHEME_A_ strvalue (car (args)));
4790 SCHEME_V->args = cdr (SCHEME_V->args); 4574 SCHEME_V->args = cdr (args);
4791 s_goto (OP_ERR1); 4575 s_goto (OP_ERR1);
4792 4576
4793 case OP_ERR1: /* error */ 4577 case OP_ERR1: /* error */
4794 putstr (SCHEME_A_ " "); 4578 putstr (SCHEME_A_ " ");
4795 4579
4796 if (SCHEME_V->args != NIL) 4580 if (args != NIL)
4797 { 4581 {
4798 s_save (SCHEME_A_ OP_ERR1, cdr (SCHEME_V->args), NIL); 4582 s_save (SCHEME_A_ OP_ERR1, cdr (args), NIL);
4799 SCHEME_V->args = car (SCHEME_V->args); 4583 SCHEME_V->args = a;
4800 SCHEME_V->print_flag = 1; 4584 SCHEME_V->print_flag = 1;
4801 s_goto (OP_P0LIST); 4585 s_goto (OP_P0LIST);
4802 } 4586 }
4803 else 4587 else
4804 { 4588 {
4805 putstr (SCHEME_A_ "\n"); 4589 putstr (SCHEME_A_ "\n");
4806 4590
4807 if (SCHEME_V->interactive_repl) 4591 if (SCHEME_V->interactive_repl)
4808 s_goto (OP_T0LVL); 4592 s_goto (OP_T0LVL);
4809 else 4593 else
4810 return NIL; 4594 return -1;
4811 } 4595 }
4812 4596
4813 case OP_REVERSE: /* reverse */ 4597 case OP_REVERSE: /* reverse */
4814 s_return (reverse (SCHEME_A_ car (SCHEME_V->args))); 4598 s_return (reverse (SCHEME_A_ a));
4815 4599
4816 case OP_LIST_STAR: /* list* */ 4600 case OP_LIST_STAR: /* list* */
4817 s_return (list_star (SCHEME_A_ SCHEME_V->args)); 4601 s_return (list_star (SCHEME_A_ SCHEME_V->args));
4818 4602
4819 case OP_APPEND: /* append */ 4603 case OP_APPEND: /* append */
4820 x = NIL; 4604 x = NIL;
4821 y = SCHEME_V->args; 4605 y = args;
4822 4606
4823 if (y == x) 4607 if (y == x)
4824 s_return (x); 4608 s_return (x);
4825 4609
4826 /* cdr() in the while condition is not a typo. If car() */ 4610 /* cdr() in the while condition is not a typo. If car() */
… …
4837 s_return (reverse_in_place (SCHEME_A_ car (y), x)); 4621 s_return (reverse_in_place (SCHEME_A_ car (y), x));
4838 4622
4839#if USE_PLIST 4623#if USE_PLIST
4840 4624
4841 case OP_PUT: /* put */ 4625 case OP_PUT: /* put */
4842 if (!hasprop (car (SCHEME_V->args)) || !hasprop (cadr (SCHEME_V->args))) 4626 if (!hasprop (a) || !hasprop (cadr (args)))
4843 Error_0 ("illegal use of put"); 4627 Error_0 ("illegal use of put");
4844 4628
4845 for (x = symprop (car (SCHEME_V->args)), y = cadr (SCHEME_V->args); x != NIL; x = cdr (x)) 4629 for (x = symprop (a), y = cadr (args); x != NIL; x = cdr (x))
4846 { 4630 {
4847 if (caar (x) == y) 4631 if (caar (x) == y)
4848 break; 4632 break;
4849 } 4633 }
4850 4634
4851 if (x != NIL) 4635 if (x != NIL)
4852 cdar (x) = caddr (SCHEME_V->args); 4636 cdar (x) = caddr (args);
4853 else 4637 else
4854 symprop (car (SCHEME_V->args)) = cons (cons (y, caddr (SCHEME_V->args)), symprop (car (SCHEME_V->args))); 4638 symprop (a) = cons (cons (y, caddr (args)), symprop (a));
4855 4639
4856 s_return (S_T); 4640 s_return (S_T);
4857 4641
4858 case OP_GET: /* get */ 4642 case OP_GET: /* get */
4859 if (!hasprop (car (SCHEME_V->args)) || !hasprop (cadr (SCHEME_V->args))) 4643 if (!hasprop (a) || !hasprop (cadr (args)))
4860 Error_0 ("illegal use of get"); 4644 Error_0 ("illegal use of get");
4861 4645
4862 for (x = symprop (car (SCHEME_V->args)), y = cadr (SCHEME_V->args); x != NIL; x = cdr (x)) 4646 for (x = symprop (a), y = cadr (args); x != NIL; x = cdr (x))
4863 if (caar (x) == y) 4647 if (caar (x) == y)
4864 break; 4648 break;
4865 4649
4866 if (x != NIL) 4650 if (x != NIL)
4867 s_return (cdar (x)); 4651 s_return (cdar (x));
… …
4869 s_return (NIL); 4653 s_return (NIL);
4870 4654
4871#endif /* USE_PLIST */ 4655#endif /* USE_PLIST */
4872 4656
4873 case OP_QUIT: /* quit */ 4657 case OP_QUIT: /* quit */
4874 if (is_pair (SCHEME_V->args)) 4658 if (is_pair (args))
4875 SCHEME_V->retcode = ivalue (car (SCHEME_V->args)); 4659 SCHEME_V->retcode = ivalue (a);
4876 4660
4877 return NIL; 4661 return -1;
4878 4662
4879 case OP_GC: /* gc */ 4663 case OP_GC: /* gc */
4880 gc (SCHEME_A_ NIL, NIL); 4664 gc (SCHEME_A_ NIL, NIL);
4881 s_return (S_T); 4665 s_return (S_T);
4882 4666
4883 case OP_GCVERB: /* gc-verbose */ 4667 case OP_GCVERB: /* gc-verbose */
4884 { 4668 {
4885 int was = SCHEME_V->gc_verbose; 4669 int was = SCHEME_V->gc_verbose;
4886 4670
4887 SCHEME_V->gc_verbose = (car (SCHEME_V->args) != S_F); 4671 SCHEME_V->gc_verbose = (a != S_F);
4888 s_retbool (was); 4672 s_retbool (was);
4889 } 4673 }
4890 4674
4891 case OP_NEWSEGMENT: /* new-segment */ 4675 case OP_NEWSEGMENT: /* new-segment */
4892 if (!is_pair (SCHEME_V->args) || !is_number (car (SCHEME_V->args))) 4676 if (!is_pair (args) || !is_number (a))
4893 Error_0 ("new-segment: argument must be a number"); 4677 Error_0 ("new-segment: argument must be a number");
4894 4678
4895 alloc_cellseg (SCHEME_A_ (int)ivalue (car (SCHEME_V->args))); 4679 alloc_cellseg (SCHEME_A_ ivalue (a));
4896 4680
4897 s_return (S_T); 4681 s_return (S_T);
4898 4682
4899 case OP_OBLIST: /* oblist */ 4683 case OP_OBLIST: /* oblist */
4900 s_return (oblist_all_symbols (SCHEME_A)); 4684 s_return (oblist_all_symbols (SCHEME_A));
… …
4927 case OP_OPEN_INOUTFILE: 4711 case OP_OPEN_INOUTFILE:
4928 prop = port_input | port_output; 4712 prop = port_input | port_output;
4929 break; 4713 break;
4930 } 4714 }
4931 4715
4932 p = port_from_filename (SCHEME_A_ strvalue (car (SCHEME_V->args)), prop); 4716 p = port_from_filename (SCHEME_A_ strvalue (a), prop);
4933 4717
4934 if (p == NIL) 4718 s_return (p == NIL ? S_F : p);
4935 s_return (S_F);
4936
4937 s_return (p);
4938 } 4719 }
4939 4720
4940# if USE_STRING_PORTS 4721# if USE_STRING_PORTS
4941 4722
4942 case OP_OPEN_INSTRING: /* open-input-string */ 4723 case OP_OPEN_INSTRING: /* open-input-string */
… …
4954 case OP_OPEN_INOUTSTRING: 4735 case OP_OPEN_INOUTSTRING:
4955 prop = port_input | port_output; 4736 prop = port_input | port_output;
4956 break; 4737 break;
4957 } 4738 }
4958 4739
4959 p = port_from_string (SCHEME_A_ strvalue (car (SCHEME_V->args)), 4740 p = port_from_string (SCHEME_A_ strvalue (a),
4960 strvalue (car (SCHEME_V->args)) + strlength (car (SCHEME_V->args)), prop); 4741 strvalue (a) + strlength (a), prop);
4961 4742
4962 if (p == NIL) 4743 s_return (p == NIL ? S_F : p);
4963 s_return (S_F);
4964
4965 s_return (p);
4966 } 4744 }
4967 4745
4968 case OP_OPEN_OUTSTRING: /* open-output-string */ 4746 case OP_OPEN_OUTSTRING: /* open-output-string */
4969 { 4747 {
4970 pointer p; 4748 pointer p;
4971 4749
4972 if (car (SCHEME_V->args) == NIL) 4750 if (a == NIL)
4973 {
4974 p = port_from_scratch (SCHEME_A); 4751 p = port_from_scratch (SCHEME_A);
4975
4976 if (p == NIL)
4977 s_return (S_F);
4978 }
4979 else 4752 else
4980 {
4981 p = port_from_string (SCHEME_A_ strvalue (car (SCHEME_V->args)), 4753 p = port_from_string (SCHEME_A_ strvalue (a),
4982 strvalue (car (SCHEME_V->args)) + strlength (car (SCHEME_V->args)), port_output); 4754 strvalue (a) + strlength (a), port_output);
4983 4755
4984 if (p == NIL) 4756 s_return (p == NIL ? S_F : p);
4985 s_return (S_F);
4986 }
4987
4988 s_return (p);
4989 } 4757 }
4990 4758
4991 case OP_GET_OUTSTRING: /* get-output-string */ 4759 case OP_GET_OUTSTRING: /* get-output-string */
4992 { 4760 {
4993 port *p; 4761 port *p;
4994 4762
4995 if ((p = car (SCHEME_V->args)->object.port)->kind & port_string) 4763 if ((p = a->object.port)->kind & port_string)
4996 { 4764 {
4997 off_t size; 4765 off_t size;
4998 char *str; 4766 char *str;
4999 4767
5000 size = p->rep.string.curr - p->rep.string.start + 1; 4768 size = p->rep.string.curr - p->rep.string.start + 1;
… …
5016 } 4784 }
5017 4785
5018# endif 4786# endif
5019 4787
5020 case OP_CLOSE_INPORT: /* close-input-port */ 4788 case OP_CLOSE_INPORT: /* close-input-port */
5021 port_close (SCHEME_A_ car (SCHEME_V->args), port_input); 4789 port_close (SCHEME_A_ a, port_input);
5022 s_return (S_T); 4790 s_return (S_T);
5023 4791
5024 case OP_CLOSE_OUTPORT: /* close-output-port */ 4792 case OP_CLOSE_OUTPORT: /* close-output-port */
5025 port_close (SCHEME_A_ car (SCHEME_V->args), port_output); 4793 port_close (SCHEME_A_ a, port_output);
5026 s_return (S_T); 4794 s_return (S_T);
5027#endif 4795#endif
5028 4796
5029 case OP_INT_ENV: /* interaction-environment */ 4797 case OP_INT_ENV: /* interaction-environment */
5030 s_return (SCHEME_V->global_env); 4798 s_return (SCHEME_V->global_env);
… …
5032 case OP_CURR_ENV: /* current-environment */ 4800 case OP_CURR_ENV: /* current-environment */
5033 s_return (SCHEME_V->envir); 4801 s_return (SCHEME_V->envir);
5034 4802
5035 } 4803 }
5036 4804
5037 return S_T; 4805 if (USE_ERROR_CHECKING) abort ();
5038} 4806}
5039 4807
5040static pointer 4808static int
5041opexe_5 (SCHEME_P_ enum scheme_opcodes op) 4809opexe_5 (SCHEME_P_ enum scheme_opcodes op)
5042{ 4810{
4811 pointer args = SCHEME_V->args;
5043 pointer x; 4812 pointer x;
5044 4813
5045 if (SCHEME_V->nesting != 0) 4814 if (SCHEME_V->nesting != 0)
5046 { 4815 {
5047 int n = SCHEME_V->nesting; 4816 int n = SCHEME_V->nesting;
… …
5054 switch (op) 4823 switch (op)
5055 { 4824 {
5056 /* ========== reading part ========== */ 4825 /* ========== reading part ========== */
5057#if USE_PORTS 4826#if USE_PORTS
5058 case OP_READ: 4827 case OP_READ:
5059 if (!is_pair (SCHEME_V->args)) 4828 if (!is_pair (args))
5060 s_goto (OP_READ_INTERNAL); 4829 s_goto (OP_READ_INTERNAL);
5061 4830
5062 if (!is_inport (car (SCHEME_V->args))) 4831 if (!is_inport (car (args)))
5063 Error_1 ("read: not an input port:", car (SCHEME_V->args)); 4832 Error_1 ("read: not an input port:", car (args));
5064 4833
5065 if (car (SCHEME_V->args) == SCHEME_V->inport) 4834 if (car (args) == SCHEME_V->inport)
5066 s_goto (OP_READ_INTERNAL); 4835 s_goto (OP_READ_INTERNAL);
5067 4836
5068 x = SCHEME_V->inport; 4837 x = SCHEME_V->inport;
5069 SCHEME_V->inport = car (SCHEME_V->args); 4838 SCHEME_V->inport = car (args);
5070 x = cons (x, NIL); 4839 x = cons (x, NIL);
5071 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); 4840 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL);
5072 s_goto (OP_READ_INTERNAL); 4841 s_goto (OP_READ_INTERNAL);
5073 4842
5074 case OP_READ_CHAR: /* read-char */ 4843 case OP_READ_CHAR: /* read-char */
5075 case OP_PEEK_CHAR: /* peek-char */ 4844 case OP_PEEK_CHAR: /* peek-char */
5076 { 4845 {
5077 int c; 4846 int c;
5078 4847
5079 if (is_pair (SCHEME_V->args)) 4848 if (is_pair (args))
5080 { 4849 {
5081 if (car (SCHEME_V->args) != SCHEME_V->inport) 4850 if (car (args) != SCHEME_V->inport)
5082 { 4851 {
5083 x = SCHEME_V->inport; 4852 x = SCHEME_V->inport;
5084 x = cons (x, NIL); 4853 x = cons (x, NIL);
5085 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); 4854 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL);
5086 SCHEME_V->inport = car (SCHEME_V->args); 4855 SCHEME_V->inport = car (args);
5087 } 4856 }
5088 } 4857 }
5089 4858
5090 c = inchar (SCHEME_A); 4859 c = inchar (SCHEME_A);
5091 4860
… …
5101 case OP_CHAR_READY: /* char-ready? */ 4870 case OP_CHAR_READY: /* char-ready? */
5102 { 4871 {
5103 pointer p = SCHEME_V->inport; 4872 pointer p = SCHEME_V->inport;
5104 int res; 4873 int res;
5105 4874
5106 if (is_pair (SCHEME_V->args)) 4875 if (is_pair (args))
5107 p = car (SCHEME_V->args); 4876 p = car (args);
5108 4877
5109 res = p->object.port->kind & port_string; 4878 res = p->object.port->kind & port_string;
5110 4879
5111 s_retbool (res); 4880 s_retbool (res);
5112 } 4881 }
5113 4882
5114 case OP_SET_INPORT: /* set-input-port */ 4883 case OP_SET_INPORT: /* set-input-port */
5115 SCHEME_V->inport = car (SCHEME_V->args); 4884 SCHEME_V->inport = car (args);
5116 s_return (SCHEME_V->value); 4885 s_return (SCHEME_V->value);
5117 4886
5118 case OP_SET_OUTPORT: /* set-output-port */ 4887 case OP_SET_OUTPORT: /* set-output-port */
5119 SCHEME_V->outport = car (SCHEME_V->args); 4888 SCHEME_V->outport = car (args);
5120 s_return (SCHEME_V->value); 4889 s_return (SCHEME_V->value);
5121#endif 4890#endif
5122 4891
5123 case OP_RDSEXPR: 4892 case OP_RDSEXPR:
5124 switch (SCHEME_V->tok) 4893 switch (SCHEME_V->tok)
… …
5173 s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL); 4942 s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL);
5174 SCHEME_V->tok = token (SCHEME_A); 4943 SCHEME_V->tok = token (SCHEME_A);
5175 s_goto (OP_RDSEXPR); 4944 s_goto (OP_RDSEXPR);
5176 4945
5177 case TOK_ATOM: 4946 case TOK_ATOM:
5178 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))); 4947 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS)));
4948
4949 case TOK_DOTATOM:
4950 SCHEME_V->strbuff[0] = '.';
4951 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 1, DELIMITERS)));
5179 4952
5180 case TOK_DQUOTE: 4953 case TOK_DQUOTE:
5181 x = readstrexp (SCHEME_A); 4954 x = readstrexp (SCHEME_A_ '"');
5182 4955
5183 if (x == S_F) 4956 if (x == S_F)
5184 Error_0 ("Error reading string"); 4957 Error_0 ("Error reading string");
5185 4958
5186 setimmutable (x); 4959 setimmutable (x);
… …
5198 s_goto (OP_EVAL); 4971 s_goto (OP_EVAL);
5199 } 4972 }
5200 } 4973 }
5201 4974
5202 case TOK_SHARP_CONST: 4975 case TOK_SHARP_CONST:
5203 if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))) == NIL) 4976 if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS))) == NIL)
5204 Error_0 ("undefined sharp expression"); 4977 Error_0 ("undefined sharp expression");
5205 else 4978 else
5206 s_return (x); 4979 s_return (x);
5207 4980
5208 default: 4981 default:
… …
5210 } 4983 }
5211 4984
5212 break; 4985 break;
5213 4986
5214 case OP_RDLIST: 4987 case OP_RDLIST:
5215 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 4988 SCHEME_V->args = cons (SCHEME_V->value, args);
5216 SCHEME_V->tok = token (SCHEME_A); 4989 SCHEME_V->tok = token (SCHEME_A);
5217 4990
5218 switch (SCHEME_V->tok) 4991 switch (SCHEME_V->tok)
5219 { 4992 {
5220 case TOK_EOF: 4993 case TOK_EOF:
… …
5248 case OP_RDDOT: 5021 case OP_RDDOT:
5249 if (token (SCHEME_A) != TOK_RPAREN) 5022 if (token (SCHEME_A) != TOK_RPAREN)
5250 Error_0 ("syntax error: illegal dot expression"); 5023 Error_0 ("syntax error: illegal dot expression");
5251 5024
5252 SCHEME_V->nesting_stack[SCHEME_V->file_i]--; 5025 SCHEME_V->nesting_stack[SCHEME_V->file_i]--;
5253 s_return (reverse_in_place (SCHEME_A_ SCHEME_V->value, SCHEME_V->args)); 5026 s_return (reverse_in_place (SCHEME_A_ SCHEME_V->value, args));
5254 5027
5255 case OP_RDQUOTE: 5028 case OP_RDQUOTE:
5256 s_return (cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL))); 5029 s_return (cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL)));
5257 5030
5258 case OP_RDQQUOTE: 5031 case OP_RDQQUOTE:
… …
5280 SCHEME_V->args = SCHEME_V->value; 5053 SCHEME_V->args = SCHEME_V->value;
5281 s_goto (OP_VECTOR); 5054 s_goto (OP_VECTOR);
5282 5055
5283 /* ========== printing part ========== */ 5056 /* ========== printing part ========== */
5284 case OP_P0LIST: 5057 case OP_P0LIST:
5285 if (is_vector (SCHEME_V->args)) 5058 if (is_vector (args))
5286 { 5059 {
5287 putstr (SCHEME_A_ "#("); 5060 putstr (SCHEME_A_ "#(");
5288 SCHEME_V->args = cons (SCHEME_V->args, mk_integer (SCHEME_A_ 0)); 5061 SCHEME_V->args = cons (args, mk_integer (SCHEME_A_ 0));
5289 s_goto (OP_PVECFROM); 5062 s_goto (OP_PVECFROM);
5290 } 5063 }
5291 else if (is_environment (SCHEME_V->args)) 5064 else if (is_environment (args))
5292 { 5065 {
5293 putstr (SCHEME_A_ "#<ENVIRONMENT>"); 5066 putstr (SCHEME_A_ "#<ENVIRONMENT>");
5294 s_return (S_T); 5067 s_return (S_T);
5295 } 5068 }
5296 else if (!is_pair (SCHEME_V->args)) 5069 else if (!is_pair (args))
5297 { 5070 {
5298 printatom (SCHEME_A_ SCHEME_V->args, SCHEME_V->print_flag); 5071 printatom (SCHEME_A_ args, SCHEME_V->print_flag);
5299 s_return (S_T); 5072 s_return (S_T);
5300 } 5073 }
5301 else if (car (SCHEME_V->args) == SCHEME_V->QUOTE && ok_abbrev (cdr (SCHEME_V->args))) 5074 else
5302 { 5075 {
5076 pointer a = car (args);
5077 pointer b = cdr (args);
5078 int ok_abbr = ok_abbrev (b);
5079 SCHEME_V->args = car (b);
5080
5081 if (a == SCHEME_V->QUOTE && ok_abbr)
5303 putstr (SCHEME_A_ "'"); 5082 putstr (SCHEME_A_ "'");
5304 SCHEME_V->args = cadr (SCHEME_V->args); 5083 else if (a == SCHEME_V->QQUOTE && ok_abbr)
5084 putstr (SCHEME_A_ "`");
5085 else if (a == SCHEME_V->UNQUOTE && ok_abbr)
5086 putstr (SCHEME_A_ ",");
5087 else if (a == SCHEME_V->UNQUOTESP && ok_abbr)
5088 putstr (SCHEME_A_ ",@");
5089 else
5090 {
5091 putstr (SCHEME_A_ "(");
5092 s_save (SCHEME_A_ OP_P1LIST, b, NIL);
5093 SCHEME_V->args = a;
5094 }
5095
5305 s_goto (OP_P0LIST); 5096 s_goto (OP_P0LIST);
5306 } 5097 }
5307 else if (car (SCHEME_V->args) == SCHEME_V->QQUOTE && ok_abbrev (cdr (SCHEME_V->args))) 5098
5099 case OP_P1LIST:
5100 if (is_pair (args))
5308 { 5101 {
5102 s_save (SCHEME_A_ OP_P1LIST, cdr (args), NIL);
5309 putstr (SCHEME_A_ "`"); 5103 putstr (SCHEME_A_ " ");
5310 SCHEME_V->args = cadr (SCHEME_V->args); 5104 SCHEME_V->args = car (args);
5311 s_goto (OP_P0LIST); 5105 s_goto (OP_P0LIST);
5312 } 5106 }
5313 else if (car (SCHEME_V->args) == SCHEME_V->UNQUOTE && ok_abbrev (cdr (SCHEME_V->args)))
5314 {
5315 putstr (SCHEME_A_ ",");
5316 SCHEME_V->args = cadr (SCHEME_V->args);
5317 s_goto (OP_P0LIST);
5318 }
5319 else if (car (SCHEME_V->args) == SCHEME_V->UNQUOTESP && ok_abbrev (cdr (SCHEME_V->args)))
5320 {
5321 putstr (SCHEME_A_ ",@");
5322 SCHEME_V->args = cadr (SCHEME_V->args);
5323 s_goto (OP_P0LIST);
5324 }
5325 else
5326 {
5327 putstr (SCHEME_A_ "(");
5328 s_save (SCHEME_A_ OP_P1LIST, cdr (SCHEME_V->args), NIL);
5329 SCHEME_V->args = car (SCHEME_V->args);
5330 s_goto (OP_P0LIST);
5331 }
5332
5333 case OP_P1LIST:
5334 if (is_pair (SCHEME_V->args))
5335 {
5336 s_save (SCHEME_A_ OP_P1LIST, cdr (SCHEME_V->args), NIL);
5337 putstr (SCHEME_A_ " ");
5338 SCHEME_V->args = car (SCHEME_V->args);
5339 s_goto (OP_P0LIST);
5340 }
5341 else if (is_vector (SCHEME_V->args)) 5107 else if (is_vector (args))
5342 { 5108 {
5343 s_save (SCHEME_A_ OP_P1LIST, NIL, NIL); 5109 s_save (SCHEME_A_ OP_P1LIST, NIL, NIL);
5344 putstr (SCHEME_A_ " . "); 5110 putstr (SCHEME_A_ " . ");
5345 s_goto (OP_P0LIST); 5111 s_goto (OP_P0LIST);
5346 } 5112 }
5347 else 5113 else
5348 { 5114 {
5349 if (SCHEME_V->args != NIL) 5115 if (args != NIL)
5350 { 5116 {
5351 putstr (SCHEME_A_ " . "); 5117 putstr (SCHEME_A_ " . ");
5352 printatom (SCHEME_A_ SCHEME_V->args, SCHEME_V->print_flag); 5118 printatom (SCHEME_A_ args, SCHEME_V->print_flag);
5353 } 5119 }
5354 5120
5355 putstr (SCHEME_A_ ")"); 5121 putstr (SCHEME_A_ ")");
5356 s_return (S_T); 5122 s_return (S_T);
5357 } 5123 }
5358 5124
5359 case OP_PVECFROM: 5125 case OP_PVECFROM:
5360 { 5126 {
5361 int i = ivalue_unchecked (cdr (SCHEME_V->args)); 5127 int i = ivalue_unchecked (cdr (args));
5362 pointer vec = car (SCHEME_V->args); 5128 pointer vec = car (args);
5363 int len = veclength (vec); 5129 int len = veclength (vec);
5364 5130
5365 if (i == len) 5131 if (i == len)
5366 { 5132 {
5367 putstr (SCHEME_A_ ")"); 5133 putstr (SCHEME_A_ ")");
5368 s_return (S_T); 5134 s_return (S_T);
5369 } 5135 }
5370 else 5136 else
5371 { 5137 {
5372 pointer elem = vector_elem (vec, i); 5138 pointer elem = vector_get (vec, i);
5373 5139
5374 ivalue_unchecked (cdr (SCHEME_V->args)) = i + 1; 5140 ivalue_unchecked (cdr (args)) = i + 1;
5375 s_save (SCHEME_A_ OP_PVECFROM, SCHEME_V->args, NIL); 5141 s_save (SCHEME_A_ OP_PVECFROM, args, NIL);
5376 SCHEME_V->args = elem; 5142 SCHEME_V->args = elem;
5377 5143
5378 if (i > 0) 5144 if (i > 0)
5379 putstr (SCHEME_A_ " "); 5145 putstr (SCHEME_A_ " ");
5380 5146
5381 s_goto (OP_P0LIST); 5147 s_goto (OP_P0LIST);
5382 } 5148 }
5383 } 5149 }
5384 } 5150 }
5385 5151
5386 return S_T; 5152 if (USE_ERROR_CHECKING) abort ();
5387} 5153}
5388 5154
5389static pointer 5155static int
5390opexe_6 (SCHEME_P_ enum scheme_opcodes op) 5156opexe_6 (SCHEME_P_ enum scheme_opcodes op)
5391{ 5157{
5158 pointer args = SCHEME_V->args;
5159 pointer a = car (args);
5392 pointer x, y; 5160 pointer x, y;
5393 5161
5394 switch (op) 5162 switch (op)
5395 { 5163 {
5396 case OP_LIST_LENGTH: /* length *//* a.k */ 5164 case OP_LIST_LENGTH: /* length *//* a.k */
5397 { 5165 {
5398 long v = list_length (SCHEME_A_ car (SCHEME_V->args)); 5166 long v = list_length (SCHEME_A_ a);
5399 5167
5400 if (v < 0) 5168 if (v < 0)
5401 Error_1 ("length: not a list:", car (SCHEME_V->args)); 5169 Error_1 ("length: not a list:", a);
5402 5170
5403 s_return (mk_integer (SCHEME_A_ v)); 5171 s_return (mk_integer (SCHEME_A_ v));
5404 } 5172 }
5405 5173
5406 case OP_ASSQ: /* assq *//* a.k */ 5174 case OP_ASSQ: /* assq *//* a.k */
5407 x = car (SCHEME_V->args); 5175 x = a;
5408 5176
5409 for (y = cadr (SCHEME_V->args); is_pair (y); y = cdr (y)) 5177 for (y = cadr (args); is_pair (y); y = cdr (y))
5410 { 5178 {
5411 if (!is_pair (car (y))) 5179 if (!is_pair (car (y)))
5412 Error_0 ("unable to handle non pair element"); 5180 Error_0 ("unable to handle non pair element");
5413 5181
5414 if (x == caar (y)) 5182 if (x == caar (y))
… …
5420 else 5188 else
5421 s_return (S_F); 5189 s_return (S_F);
5422 5190
5423 5191
5424 case OP_GET_CLOSURE: /* get-closure-code *//* a.k */ 5192 case OP_GET_CLOSURE: /* get-closure-code *//* a.k */
5425 SCHEME_V->args = car (SCHEME_V->args); 5193 SCHEME_V->args = a;
5426 5194
5427 if (SCHEME_V->args == NIL) 5195 if (SCHEME_V->args == NIL)
5428 s_return (S_F); 5196 s_return (S_F);
5429 else if (is_closure (SCHEME_V->args)) 5197 else if (is_closure (SCHEME_V->args))
5430 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value))); 5198 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value)));
… …
5436 case OP_CLOSUREP: /* closure? */ 5204 case OP_CLOSUREP: /* closure? */
5437 /* 5205 /*
5438 * Note, macro object is also a closure. 5206 * Note, macro object is also a closure.
5439 * Therefore, (closure? <#MACRO>) ==> #t 5207 * Therefore, (closure? <#MACRO>) ==> #t
5440 */ 5208 */
5441 s_retbool (is_closure (car (SCHEME_V->args))); 5209 s_retbool (is_closure (a));
5442 5210
5443 case OP_MACROP: /* macro? */ 5211 case OP_MACROP: /* macro? */
5444 s_retbool (is_macro (car (SCHEME_V->args))); 5212 s_retbool (is_macro (a));
5445 } 5213 }
5446 5214
5447 return S_T; /* NOTREACHED */ 5215 if (USE_ERROR_CHECKING) abort ();
5448} 5216}
5449 5217
5218/* dispatch functions (opexe_x) return new opcode, or 0 for same opcode, or -1 to stop */
5450typedef pointer (*dispatch_func) (SCHEME_P_ enum scheme_opcodes); 5219typedef int (*dispatch_func)(SCHEME_P_ enum scheme_opcodes);
5451 5220
5452typedef int (*test_predicate) (pointer); 5221typedef int (*test_predicate)(pointer);
5453static int 5222static int
5454is_any (pointer p) 5223tst_any (pointer p)
5455{ 5224{
5456 return 1; 5225 return 1;
5457} 5226}
5458 5227
5459static int 5228static int
5460is_nonneg (pointer p) 5229tst_inonneg (pointer p)
5461{ 5230{
5462 return ivalue (p) >= 0 && is_integer (p); 5231 return is_integer (p) && ivalue_unchecked (p) >= 0;
5232}
5233
5234static int
5235tst_is_list (SCHEME_P_ pointer p)
5236{
5237 return p == NIL || is_pair (p);
5463} 5238}
5464 5239
5465/* Correspond carefully with following defines! */ 5240/* Correspond carefully with following defines! */
5466static struct 5241static struct
5467{ 5242{
5468 test_predicate fct; 5243 test_predicate fct;
5469 const char *kind; 5244 const char *kind;
5470} tests[] = 5245} tests[] = {
5471{ 5246 { tst_any , 0 },
5472 { 0, 0}, /* unused */ 5247 { is_string , "string" },
5473 { is_any, 0}, 5248 { is_symbol , "symbol" },
5474 { is_string, "string" }, 5249 { is_port , "port" },
5475 { is_symbol, "symbol" },
5476 { is_port, "port" },
5477 { is_inport, "input port" }, 5250 { is_inport , "input port" },
5478 { is_outport, "output port" }, 5251 { is_outport , "output port" },
5479 { is_environment, "environment" }, 5252 { is_environment, "environment" },
5480 { is_pair, "pair" }, 5253 { is_pair , "pair" },
5481 { 0, "pair or '()" }, 5254 { 0 , "pair or '()" },
5482 { is_character, "character" }, 5255 { is_character , "character" },
5483 { is_vector, "vector" }, 5256 { is_vector , "vector" },
5484 { is_number, "number" }, 5257 { is_number , "number" },
5485 { is_integer, "integer" }, 5258 { is_integer , "integer" },
5486 { is_nonneg, "non-negative integer" } 5259 { tst_inonneg , "non-negative integer" }
5487}; 5260};
5488 5261
5489#define TST_NONE 0 5262#define TST_NONE 0 /* TST_NONE used for built-ins, 0 for internal ops */
5490#define TST_ANY "\001" 5263#define TST_ANY "\001"
5491#define TST_STRING "\002" 5264#define TST_STRING "\002"
5492#define TST_SYMBOL "\003" 5265#define TST_SYMBOL "\003"
5493#define TST_PORT "\004" 5266#define TST_PORT "\004"
5494#define TST_INPORT "\005" 5267#define TST_INPORT "\005"
5495#define TST_OUTPORT "\006" 5268#define TST_OUTPORT "\006"
5496#define TST_ENVIRONMENT "\007" 5269#define TST_ENVIRONMENT "\007"
5497#define TST_PAIR "\010" 5270#define TST_PAIR "\010"
5498#define TST_LIST "\011" 5271#define TST_LIST "\011"
5499#define TST_CHAR "\012" 5272#define TST_CHAR "\012"
5500#define TST_VECTOR "\013" 5273#define TST_VECTOR "\013"
5501#define TST_NUMBER "\014" 5274#define TST_NUMBER "\014"
5502#define TST_INTEGER "\015" 5275#define TST_INTEGER "\015"
5503#define TST_NATURAL "\016" 5276#define TST_NATURAL "\016"
5277
5278#define INF_ARG 0xff
5279#define UNNAMED_OP ""
5280
5281static const char opnames[] =
5282#define OP_DEF(func,name,minarity,maxarity,argtest,op) name "\x00"
5283#include "opdefines.h"
5284#undef OP_DEF
5285;
5286
5287static const char *
5288opname (int idx)
5289{
5290 const char *name = opnames;
5291
5292 /* should do this at compile time, but would require external program, right? */
5293 while (idx--)
5294 name += strlen (name) + 1;
5295
5296 return *name ? name : "ILLEGAL";
5297}
5298
5299static const char *
5300procname (pointer x)
5301{
5302 return opname (procnum (x));
5303}
5504 5304
5505typedef struct 5305typedef struct
5506{ 5306{
5507 dispatch_func func; 5307 uint8_t func;
5508 char *name; 5308 /*dispatch_func func;*//*TODO: maybe optionally keep the pointer, for speed? */
5309 uint8_t builtin;
5310#if USE_ERROR_CHECKING
5509 int min_arity; 5311 uint8_t min_arity;
5510 int max_arity; 5312 uint8_t max_arity;
5511 char *arg_tests_encoding; 5313 char arg_tests_encoding[3];
5314#endif
5512} op_code_info; 5315} op_code_info;
5513 5316
5514#define INF_ARG 0xffff
5515
5516static op_code_info dispatch_table[] = { 5317static const op_code_info dispatch_table[] = {
5517#define OP_DEF(A,B,C,D,E,OP) {A,B,C,D,E}, 5318#if USE_ERROR_CHECKING
5319#define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1, minarity, maxarity, argtest },
5320#else
5321#define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1 },
5322#endif
5518#include "opdefines.h" 5323#include "opdefines.h"
5324#undef OP_DEF
5519 {0} 5325 {0}
5520}; 5326};
5521 5327
5522static const char *
5523procname (pointer x)
5524{
5525 int n = procnum (x);
5526 const char *name = dispatch_table[n].name;
5527
5528 if (name == 0)
5529 name = "ILLEGAL!";
5530
5531 return name;
5532}
5533
5534/* kernel of this interpreter */ 5328/* kernel of this interpreter */
5535static void 5329static void ecb_hot
5536Eval_Cycle (SCHEME_P_ enum scheme_opcodes op) 5330Eval_Cycle (SCHEME_P_ enum scheme_opcodes op)
5537{ 5331{
5538 SCHEME_V->op = op; 5332 SCHEME_V->op = op;
5539 5333
5540 for (;;) 5334 for (;;)
5541 { 5335 {
5542 op_code_info *pcd = dispatch_table + SCHEME_V->op; 5336 const op_code_info *pcd = dispatch_table + SCHEME_V->op;
5543 5337
5544#if USE_ERROR_CHECKING 5338#if USE_ERROR_CHECKING
5545 if (pcd->name) /* if built-in function, check arguments */ 5339 if (pcd->builtin) /* if built-in function, check arguments */
5546 { 5340 {
5547 int ok = 1;
5548 char msg[STRBUFFSIZE]; 5341 char msg[STRBUFFSIZE];
5549 int n = list_length (SCHEME_A_ SCHEME_V->args); 5342 int n = list_length (SCHEME_A_ SCHEME_V->args);
5550 5343
5551 /* Check number of arguments */ 5344 /* Check number of arguments */
5552 if (ecb_expect_false (n < pcd->min_arity)) 5345 if (ecb_expect_false (n < pcd->min_arity))
5553 { 5346 {
5554 ok = 0;
5555 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", 5347 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)",
5556 pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity); 5348 opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity);
5349 xError_1 (SCHEME_A_ msg, 0);
5350 continue;
5557 } 5351 }
5558 else if (ecb_excpect_false (n > pcd->max_arity)) 5352 else if (ecb_expect_false (n > pcd->max_arity && pcd->max_arity != INF_ARG))
5559 { 5353 {
5560 ok = 0;
5561 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", 5354 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)",
5562 pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity); 5355 opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity);
5356 xError_1 (SCHEME_A_ msg, 0);
5357 continue;
5563 } 5358 }
5564 5359 else
5565 if (ecb_expect_false (ok))
5566 { 5360 {
5567 if (pcd->arg_tests_encoding) 5361 if (*pcd->arg_tests_encoding) /* literal 0 and TST_NONE treated the same */
5568 { 5362 {
5569 int i = 0; 5363 int i = 0;
5570 int j; 5364 int j;
5571 const char *t = pcd->arg_tests_encoding; 5365 const char *t = pcd->arg_tests_encoding;
5572 pointer arglist = SCHEME_V->args; 5366 pointer arglist = SCHEME_V->args;
5573 5367
5574 do 5368 do
5575 { 5369 {
5576 pointer arg = car (arglist); 5370 pointer arg = car (arglist);
5577 5371
5578 j = (int) t[0]; 5372 j = t[0];
5579 5373
5374 /*TODO: tst_is_list has different prototype - fix if other tests acquire same prototype */
5580 if (j == TST_LIST[0]) 5375 if (j == TST_LIST[0])
5581 { 5376 {
5582 if (arg != NIL && !is_pair (arg)) 5377 if (!tst_is_list (SCHEME_A_ arg))
5583 break; 5378 break;
5584 } 5379 }
5585 else 5380 else
5586 { 5381 {
5587 if (!tests[j].fct (arg)) 5382 if (!tests[j - 1].fct (arg))
5588 break; 5383 break;
5589 } 5384 }
5590 5385
5591 if (t[1] != 0) /* last test is replicated as necessary */ 5386 if (t < pcd->arg_tests_encoding + sizeof (pcd->arg_tests_encoding) - 1 && t[1]) /* last test is replicated as necessary */
5592 t++; 5387 t++;
5593 5388
5594 arglist = cdr (arglist); 5389 arglist = cdr (arglist);
5595 i++; 5390 i++;
5596 } 5391 }
5597 while (i < n); 5392 while (i < n);
5598 5393
5599 if (i < n) 5394 if (i < n)
5600 { 5395 {
5601 ok = 0;
5602 snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", pcd->name, i + 1, tests[j].kind); 5396 snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", opname (SCHEME_V->op), i + 1, tests[j].kind);
5397 xError_1 (SCHEME_A_ msg, 0);
5398 continue;
5603 } 5399 }
5604 } 5400 }
5605 } 5401 }
5606
5607 if (!ok)
5608 {
5609 if (xError_1 (SCHEME_A_ msg, 0) == NIL)
5610 return;
5611
5612 pcd = dispatch_table + SCHEME_V->op;
5613 }
5614 } 5402 }
5615#endif 5403#endif
5616 5404
5617 ok_to_freely_gc (SCHEME_A); 5405 ok_to_freely_gc (SCHEME_A);
5618 5406
5407 static const dispatch_func dispatch_funcs[] = {
5408 opexe_0,
5409 opexe_1,
5410 opexe_2,
5411 opexe_3,
5412 opexe_4,
5413 opexe_5,
5414 opexe_6,
5415 };
5416
5619 if (ecb_expect_false (pcd->func (SCHEME_A_ SCHEME_V->op) == NIL)) 5417 if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0))
5620 return; 5418 return;
5621 5419
5622 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 5420 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
5623 { 5421 {
5624 xwrstr ("No memory!\n"); 5422 xwrstr ("No memory!\n");
… …
5648mk_proc (SCHEME_P_ enum scheme_opcodes op) 5446mk_proc (SCHEME_P_ enum scheme_opcodes op)
5649{ 5447{
5650 pointer y = get_cell (SCHEME_A_ NIL, NIL); 5448 pointer y = get_cell (SCHEME_A_ NIL, NIL);
5651 set_typeflag (y, (T_PROC | T_ATOM)); 5449 set_typeflag (y, (T_PROC | T_ATOM));
5652 ivalue_unchecked (y) = op; 5450 ivalue_unchecked (y) = op;
5653 set_num_integer (y);
5654 return y; 5451 return y;
5655} 5452}
5656 5453
5657/* Hard-coded for the given keywords. Remember to rewrite if more are added! */ 5454/* Hard-coded for the given keywords. Remember to rewrite if more are added! */
5658static int 5455static int
… …
5723 return OP_C0STREAM; /* cons-stream */ 5520 return OP_C0STREAM; /* cons-stream */
5724 } 5521 }
5725} 5522}
5726 5523
5727#if USE_MULTIPLICITY 5524#if USE_MULTIPLICITY
5728scheme * 5525ecb_cold scheme *
5729scheme_init_new () 5526scheme_init_new ()
5730{ 5527{
5731 scheme *sc = malloc (sizeof (scheme)); 5528 scheme *sc = malloc (sizeof (scheme));
5732 5529
5733 if (!scheme_init (SCHEME_A)) 5530 if (!scheme_init (SCHEME_A))
… …
5738 else 5535 else
5739 return sc; 5536 return sc;
5740} 5537}
5741#endif 5538#endif
5742 5539
5743int 5540ecb_cold int
5744scheme_init (SCHEME_P) 5541scheme_init (SCHEME_P)
5745{ 5542{
5746 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]); 5543 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]);
5747 pointer x; 5544 pointer x;
5748 5545
… …
5821 5618
5822 for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i) 5619 for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i)
5823 assign_syntax (SCHEME_A_ syntax_names[i]); 5620 assign_syntax (SCHEME_A_ syntax_names[i]);
5824 } 5621 }
5825 5622
5623 // TODO: should iterate via strlen, to avoid n² complexity
5826 for (i = 0; i < n; i++) 5624 for (i = 0; i < n; i++)
5827 if (dispatch_table[i].name != 0) 5625 if (dispatch_table[i].builtin)
5828 assign_proc (SCHEME_A_ i, dispatch_table[i].name); 5626 assign_proc (SCHEME_A_ i, opname (i));
5829 5627
5830 /* initialization of global pointers to special symbols */ 5628 /* initialization of global pointers to special symbols */
5831 SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda"); 5629 SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda");
5832 SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote"); 5630 SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote");
5833 SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote"); 5631 SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote");
… …
5872scheme_set_external_data (SCHEME_P_ void *p) 5670scheme_set_external_data (SCHEME_P_ void *p)
5873{ 5671{
5874 SCHEME_V->ext_data = p; 5672 SCHEME_V->ext_data = p;
5875} 5673}
5876 5674
5877void 5675ecb_cold void
5878scheme_deinit (SCHEME_P) 5676scheme_deinit (SCHEME_P)
5879{ 5677{
5880 int i; 5678 int i;
5881 5679
5882#if SHOW_ERROR_LINE 5680#if SHOW_ERROR_LINE
… …
5974{ 5772{
5975 dump_stack_reset (SCHEME_A); 5773 dump_stack_reset (SCHEME_A);
5976 SCHEME_V->envir = SCHEME_V->global_env; 5774 SCHEME_V->envir = SCHEME_V->global_env;
5977 SCHEME_V->file_i = 0; 5775 SCHEME_V->file_i = 0;
5978 SCHEME_V->load_stack[0].kind = port_input | port_string; 5776 SCHEME_V->load_stack[0].kind = port_input | port_string;
5979 SCHEME_V->load_stack[0].rep.string.start = (char *) cmd; /* This func respects const */ 5777 SCHEME_V->load_stack[0].rep.string.start = (char *)cmd; /* This func respects const */
5980 SCHEME_V->load_stack[0].rep.string.past_the_end = (char *) cmd + strlen (cmd); 5778 SCHEME_V->load_stack[0].rep.string.past_the_end = (char *)cmd + strlen (cmd);
5981 SCHEME_V->load_stack[0].rep.string.curr = (char *) cmd; 5779 SCHEME_V->load_stack[0].rep.string.curr = (char *)cmd;
5982#if USE_PORTS 5780#if USE_PORTS
5983 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack); 5781 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack);
5984#endif 5782#endif
5985 SCHEME_V->retcode = 0; 5783 SCHEME_V->retcode = 0;
5986 SCHEME_V->interactive_repl = 0; 5784 SCHEME_V->interactive_repl = 0;

Diff Legend

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