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

Comparing cvsroot/microscheme/scheme.c (file contents):
Revision 1.9 by root, Wed Nov 25 22:39:19 2015 UTC vs.
Revision 1.25 by root, Fri Nov 27 04:37:26 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
37#include <string.h> 39#include <string.h>
… …
143 145
144#define toupper(c) xtoupper (c) 146#define toupper(c) xtoupper (c)
145#define tolower(c) xtolower (c) 147#define tolower(c) xtolower (c)
146#define isdigit(c) xisdigit (c) 148#define isdigit(c) xisdigit (c)
147 149
148#if USE_STRLWR 150#if USE_IGNORECASE
149static const char * 151static const char *
150strlwr (char *s) 152xstrlwr (char *s)
151{ 153{
152 const char *p = s; 154 const char *p = s;
153 155
154 while (*s) 156 while (*s)
155 { 157 {
… …
157 s++; 159 s++;
158 } 160 }
159 161
160 return p; 162 return p;
161} 163}
162#endif
163 164
165#define stricmp(a,b) strcasecmp (a, b)
166#define strlwr(s) xstrlwr (s)
167
168#else
164#define stricmp(a,b) strcmp (a, b) 169# define stricmp(a,b) strcmp (a, b)
165#define strlwr(s) (s) 170# define strlwr(s) (s)
171#endif
166 172
167#ifndef prompt 173#ifndef prompt
168# define prompt "ts> " 174# define prompt "ts> "
169#endif 175#endif
170 176
… …
201#define T_SYNTAX 0x0010 207#define T_SYNTAX 0x0010
202#define T_IMMUTABLE 0x0020 208#define T_IMMUTABLE 0x0020
203#define T_ATOM 0x0040 /* only for gc */ 209#define T_ATOM 0x0040 /* only for gc */
204#define T_MARK 0x0080 /* only for gc */ 210#define T_MARK 0x0080 /* only for gc */
205 211
206static num num_add (num a, num b); 212enum num_op { NUM_ADD, NUM_SUB, NUM_MUL, NUM_INTDIV };
207static num num_mul (num a, num b); 213
208static num num_div (num a, num b); 214static num num_op (enum num_op op, num a, num b);
209static num num_intdiv (num a, num b); 215static num num_intdiv (num a, num b);
210static num num_sub (num a, num b);
211static num num_rem (num a, num b); 216static num num_rem (num a, num b);
212static num num_mod (num a, num b); 217static num num_mod (num a, num b);
213static int num_eq (num a, num b);
214static int num_gt (num a, num b);
215static int num_ge (num a, num b);
216static int num_lt (num a, num b);
217static int num_le (num a, num b);
218 218
219#if USE_MATH 219#if USE_MATH
220static double round_per_R5RS (double x); 220static double round_per_R5RS (double x);
221#endif 221#endif
222static int is_zero_rvalue (RVALUE x); 222static int is_zero_rvalue (RVALUE x);
223
224static INLINE int
225num_is_integer (pointer p)
226{
227 return num_is_fixnum (p->object.number);
228}
229 223
230static num num_zero; 224static num num_zero;
231static num num_one; 225static num num_one;
232 226
233/* macros for cell operations */ 227/* macros for cell operations */
234#define typeflag(p) ((p)->flag + 0) 228#define typeflag(p) ((p)->flag + 0)
235#define set_typeflag(p,v) ((p)->flag = (v)) 229#define set_typeflag(p,v) ((p)->flag = (v))
236#define type(p) (typeflag (p) & T_MASKTYPE) 230#define type(p) (typeflag (p) & T_MASKTYPE)
237 231
238INTERFACE INLINE int 232INTERFACE int
239is_string (pointer p) 233is_string (pointer p)
240{ 234{
241 return type (p) == T_STRING; 235 return type (p) == T_STRING;
242} 236}
243 237
244#define strvalue(p) ((p)->object.string.svalue) 238#define strvalue(p) ((p)->object.string.svalue)
245#define strlength(p) ((p)->object.string.length) 239#define strlength(p) ((p)->object.string.length)
246 240
247INTERFACE int is_list (SCHEME_P_ pointer p); 241INTERFACE int is_list (SCHEME_P_ pointer p);
242
248INTERFACE INLINE int 243INTERFACE int
249is_vector (pointer p) 244is_vector (pointer p)
250{ 245{
251 return type (p) == T_VECTOR; 246 return type (p) == T_VECTOR;
252} 247}
253 248
… …
262vector_length (pointer vec) 257vector_length (pointer vec)
263{ 258{
264 return vec->object.vector.length; 259 return vec->object.vector.length;
265} 260}
266 261
267INTERFACE INLINE int 262INTERFACE int
268is_number (pointer p) 263is_number (pointer p)
269{ 264{
270 return type (p) == T_NUMBER; 265 return type (p) == T_NUMBER;
271} 266}
272 267
273INTERFACE INLINE int 268INTERFACE int
274is_integer (pointer p) 269is_integer (pointer p)
275{ 270{
276 if (!is_number (p)) 271 return is_number (p) && num_is_fixnum (p->object.number);
277 return 0;
278
279 if (num_is_integer (p) || ivalue (p) == rvalue (p))
280 return 1;
281
282 return 0;
283} 272}
284 273
285INTERFACE INLINE int 274INTERFACE int
286is_real (pointer p) 275is_real (pointer p)
287{ 276{
288 return is_number (p) && !num_is_fixnum (p->object.number); 277 return is_number (p) && !num_is_fixnum (p->object.number);
289} 278}
290 279
291INTERFACE INLINE int 280INTERFACE int
292is_character (pointer p) 281is_character (pointer p)
293{ 282{
294 return type (p) == T_CHARACTER; 283 return type (p) == T_CHARACTER;
295} 284}
296 285
297INTERFACE INLINE char * 286INTERFACE char *
298string_value (pointer p) 287string_value (pointer p)
299{ 288{
300 return strvalue (p); 289 return strvalue (p);
301} 290}
302 291
303INLINE num 292ecb_inline num
304nvalue (pointer p) 293nvalue (pointer p)
305{ 294{
306 return (p)->object.number; 295 return (p)->object.number;
307} 296}
308 297
… …
338#else 327#else
339# define rvalue_unchecked(p) ((p)->object.number.value.ivalue) 328# define rvalue_unchecked(p) ((p)->object.number.value.ivalue)
340# define set_num_integer(p) 0 329# define set_num_integer(p) 0
341# define set_num_real(p) 0 330# define set_num_real(p) 0
342#endif 331#endif
332
343INTERFACE long 333INTERFACE long
344charvalue (pointer p) 334charvalue (pointer p)
345{ 335{
346 return ivalue_unchecked (p); 336 return ivalue_unchecked (p);
347} 337}
348 338
349INTERFACE INLINE int 339INTERFACE int
350is_port (pointer p) 340is_port (pointer p)
351{ 341{
352 return type (p) == T_PORT; 342 return type (p) == T_PORT;
353} 343}
354 344
355INTERFACE INLINE int 345INTERFACE int
356is_inport (pointer p) 346is_inport (pointer p)
357{ 347{
358 return is_port (p) && p->object.port->kind & port_input; 348 return is_port (p) && p->object.port->kind & port_input;
359} 349}
360 350
361INTERFACE INLINE int 351INTERFACE int
362is_outport (pointer p) 352is_outport (pointer p)
363{ 353{
364 return is_port (p) && p->object.port->kind & port_output; 354 return is_port (p) && p->object.port->kind & port_output;
365} 355}
366 356
367INTERFACE INLINE int 357INTERFACE int
368is_pair (pointer p) 358is_pair (pointer p)
369{ 359{
370 return type (p) == T_PAIR; 360 return type (p) == T_PAIR;
371} 361}
372 362
373#define car(p) ((p)->object.cons.car + 0) 363#define car(p) ((p)->object.cons.car + 0)
374#define cdr(p) ((p)->object.cons.cdr) /* find_consecutive_cells uses &cdr */ 364#define cdr(p) ((p)->object.cons.cdr + 0)
375 365
376#define caar(p) car (car (p)) 366static pointer caar (pointer p) { return car (car (p)); }
377#define cadr(p) car (cdr (p)) 367static pointer cadr (pointer p) { return car (cdr (p)); }
378#define cdar(p) cdr (car (p)) 368static pointer cdar (pointer p) { return cdr (car (p)); }
379#define cddr(p) cdr (cdr (p)) 369static pointer cddr (pointer p) { return cdr (cdr (p)); }
380 370
381#define cadar(p) car (cdr (car (p))) 371static pointer cadar (pointer p) { return car (cdr (car (p))); }
382#define caddr(p) car (cdr (cdr (p))) 372static pointer caddr (pointer p) { return car (cdr (cdr (p))); }
383#define cdaar(p) cdr (car (car (p))) 373static pointer cdaar (pointer p) { return cdr (car (car (p))); }
384 374
385INTERFACE void 375INTERFACE void
386set_car (pointer p, pointer q) 376set_car (pointer p, pointer q)
387{ 377{
388 p->object.cons.car = q; 378 p->object.cons.car = q;
… …
404pair_cdr (pointer p) 394pair_cdr (pointer p)
405{ 395{
406 return cdr (p); 396 return cdr (p);
407} 397}
408 398
409INTERFACE INLINE int 399INTERFACE int
410is_symbol (pointer p) 400is_symbol (pointer p)
411{ 401{
412 return type (p) == T_SYMBOL; 402 return type (p) == T_SYMBOL;
413} 403}
414 404
415INTERFACE INLINE char * 405INTERFACE char *
416symname (pointer p) 406symname (pointer p)
417{ 407{
418 return strvalue (car (p)); 408 return strvalue (car (p));
419} 409}
420 410
421#if USE_PLIST 411#if USE_PLIST
422SCHEME_EXPORT INLINE int 412SCHEME_EXPORT int
423hasprop (pointer p) 413hasprop (pointer p)
424{ 414{
425 return typeflag (p) & T_SYMBOL; 415 return typeflag (p) & T_SYMBOL;
426} 416}
427 417
428# define symprop(p) cdr(p) 418# define symprop(p) cdr(p)
429#endif 419#endif
430 420
431INTERFACE INLINE int 421INTERFACE int
432is_syntax (pointer p) 422is_syntax (pointer p)
433{ 423{
434 return typeflag (p) & T_SYNTAX; 424 return typeflag (p) & T_SYNTAX;
435} 425}
436 426
437INTERFACE INLINE int 427INTERFACE int
438is_proc (pointer p) 428is_proc (pointer p)
439{ 429{
440 return type (p) == T_PROC; 430 return type (p) == T_PROC;
441} 431}
442 432
443INTERFACE INLINE int 433INTERFACE int
444is_foreign (pointer p) 434is_foreign (pointer p)
445{ 435{
446 return type (p) == T_FOREIGN; 436 return type (p) == T_FOREIGN;
447} 437}
448 438
449INTERFACE INLINE char * 439INTERFACE char *
450syntaxname (pointer p) 440syntaxname (pointer p)
451{ 441{
452 return strvalue (car (p)); 442 return strvalue (car (p));
453} 443}
454 444
455#define procnum(p) ivalue (p) 445#define procnum(p) ivalue (p)
456static const char *procname (pointer x); 446static const char *procname (pointer x);
457 447
458INTERFACE INLINE int 448INTERFACE int
459is_closure (pointer p) 449is_closure (pointer p)
460{ 450{
461 return type (p) == T_CLOSURE; 451 return type (p) == T_CLOSURE;
462} 452}
463 453
464INTERFACE INLINE int 454INTERFACE int
465is_macro (pointer p) 455is_macro (pointer p)
466{ 456{
467 return type (p) == T_MACRO; 457 return type (p) == T_MACRO;
468} 458}
469 459
470INTERFACE INLINE pointer 460INTERFACE pointer
471closure_code (pointer p) 461closure_code (pointer p)
472{ 462{
473 return car (p); 463 return car (p);
474} 464}
475 465
476INTERFACE INLINE pointer 466INTERFACE pointer
477closure_env (pointer p) 467closure_env (pointer p)
478{ 468{
479 return cdr (p); 469 return cdr (p);
480} 470}
481 471
482INTERFACE INLINE int 472INTERFACE int
483is_continuation (pointer p) 473is_continuation (pointer p)
484{ 474{
485 return type (p) == T_CONTINUATION; 475 return type (p) == T_CONTINUATION;
486} 476}
487 477
488#define cont_dump(p) cdr (p) 478#define cont_dump(p) cdr (p)
489#define set_cont_dump(p,v) set_cdr ((p), (v)) 479#define set_cont_dump(p,v) set_cdr ((p), (v))
490 480
491/* To do: promise should be forced ONCE only */ 481/* To do: promise should be forced ONCE only */
492INTERFACE INLINE int 482INTERFACE int
493is_promise (pointer p) 483is_promise (pointer p)
494{ 484{
495 return type (p) == T_PROMISE; 485 return type (p) == T_PROMISE;
496} 486}
497 487
498INTERFACE INLINE int 488INTERFACE int
499is_environment (pointer p) 489is_environment (pointer p)
500{ 490{
501 return type (p) == T_ENVIRONMENT; 491 return type (p) == T_ENVIRONMENT;
502} 492}
503 493
… …
509 499
510#define is_mark(p) (typeflag (p) & T_MARK) 500#define is_mark(p) (typeflag (p) & T_MARK)
511#define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK) 501#define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK)
512#define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK) 502#define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK)
513 503
514INTERFACE INLINE int 504INTERFACE int
515is_immutable (pointer p) 505is_immutable (pointer p)
516{ 506{
517 return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING; 507 return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING;
518} 508}
519 509
520INTERFACE INLINE void 510INTERFACE void
521setimmutable (pointer p) 511setimmutable (pointer p)
522{ 512{
523#if USE_ERROR_CHECKING 513#if USE_ERROR_CHECKING
524 set_typeflag (p, typeflag (p) | T_IMMUTABLE); 514 set_typeflag (p, typeflag (p) | T_IMMUTABLE);
525#endif 515#endif
526} 516}
527 517
528#if USE_CHAR_CLASSIFIERS 518#if USE_CHAR_CLASSIFIERS
529static INLINE int 519ecb_inline int
530Cisalpha (int c) 520Cisalpha (int c)
531{ 521{
532 return isascii (c) && isalpha (c); 522 return isascii (c) && isalpha (c);
533} 523}
534 524
535static INLINE int 525ecb_inline int
536Cisdigit (int c) 526Cisdigit (int c)
537{ 527{
538 return isascii (c) && isdigit (c); 528 return isascii (c) && isdigit (c);
539} 529}
540 530
541static INLINE int 531ecb_inline int
542Cisspace (int c) 532Cisspace (int c)
543{ 533{
544 return isascii (c) && isspace (c); 534 return isascii (c) && isspace (c);
545} 535}
546 536
547static INLINE int 537ecb_inline int
548Cisupper (int c) 538Cisupper (int c)
549{ 539{
550 return isascii (c) && isupper (c); 540 return isascii (c) && isupper (c);
551} 541}
552 542
553static INLINE int 543ecb_inline int
554Cislower (int c) 544Cislower (int c)
555{ 545{
556 return isascii (c) && islower (c); 546 return isascii (c) && islower (c);
557} 547}
558#endif 548#endif
… …
619#endif 609#endif
620 610
621static int file_push (SCHEME_P_ const char *fname); 611static int file_push (SCHEME_P_ const char *fname);
622static void file_pop (SCHEME_P); 612static void file_pop (SCHEME_P);
623static int file_interactive (SCHEME_P); 613static int file_interactive (SCHEME_P);
624static INLINE int is_one_of (char *s, int c); 614ecb_inline int is_one_of (char *s, int c);
625static int alloc_cellseg (SCHEME_P_ int n); 615static int alloc_cellseg (SCHEME_P_ int n);
626static INLINE pointer get_cell (SCHEME_P_ pointer a, pointer b); 616ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b);
627static void finalize_cell (SCHEME_P_ pointer a); 617static void finalize_cell (SCHEME_P_ pointer a);
628static int count_consecutive_cells (pointer x, int needed); 618static int count_consecutive_cells (pointer x, int needed);
629static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all); 619static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all);
630static pointer mk_number (SCHEME_P_ const num n); 620static pointer mk_number (SCHEME_P_ const num n);
631static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill); 621static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill);
… …
648static int basic_inchar (port *pt); 638static int basic_inchar (port *pt);
649static int inchar (SCHEME_P); 639static int inchar (SCHEME_P);
650static void backchar (SCHEME_P_ int c); 640static void backchar (SCHEME_P_ int c);
651static char *readstr_upto (SCHEME_P_ char *delim); 641static char *readstr_upto (SCHEME_P_ char *delim);
652static pointer readstrexp (SCHEME_P); 642static pointer readstrexp (SCHEME_P);
653static INLINE int skipspace (SCHEME_P); 643ecb_inline int skipspace (SCHEME_P);
654static int token (SCHEME_P); 644static int token (SCHEME_P);
655static void printslashstring (SCHEME_P_ char *s, int len); 645static void printslashstring (SCHEME_P_ char *s, int len);
656static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen); 646static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen);
657static void printatom (SCHEME_P_ pointer l, int f); 647static void printatom (SCHEME_P_ pointer l, int f);
658static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op); 648static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op);
… …
662static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list); 652static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list);
663static pointer revappend (SCHEME_P_ pointer a, pointer b); 653static pointer revappend (SCHEME_P_ pointer a, pointer b);
664static pointer ss_get_cont (SCHEME_P); 654static pointer ss_get_cont (SCHEME_P);
665static void ss_set_cont (SCHEME_P_ pointer cont); 655static void ss_set_cont (SCHEME_P_ pointer cont);
666static void dump_stack_mark (SCHEME_P); 656static void dump_stack_mark (SCHEME_P);
667static pointer opexe_0 (SCHEME_P_ enum scheme_opcodes op); 657static int opexe_0 (SCHEME_P_ enum scheme_opcodes op);
658static int opexe_1 (SCHEME_P_ enum scheme_opcodes op);
668static pointer opexe_2 (SCHEME_P_ enum scheme_opcodes op); 659static int opexe_2 (SCHEME_P_ enum scheme_opcodes op);
669static pointer opexe_3 (SCHEME_P_ enum scheme_opcodes op); 660static int opexe_3 (SCHEME_P_ enum scheme_opcodes op);
670static pointer opexe_4 (SCHEME_P_ enum scheme_opcodes op); 661static int opexe_4 (SCHEME_P_ enum scheme_opcodes op);
671static pointer opexe_5 (SCHEME_P_ enum scheme_opcodes op); 662static int opexe_5 (SCHEME_P_ enum scheme_opcodes op);
672static pointer opexe_6 (SCHEME_P_ enum scheme_opcodes op); 663static int opexe_6 (SCHEME_P_ enum scheme_opcodes op);
673static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op); 664static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op);
674static void assign_syntax (SCHEME_P_ const char *name); 665static void assign_syntax (SCHEME_P_ const char *name);
675static int syntaxnum (pointer p); 666static int syntaxnum (pointer p);
676static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name); 667static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name);
677 668
678static num 669static num
679num_add (num a, num b) 670num_op (enum num_op op, num a, num b)
680{ 671{
681 num ret; 672 num ret;
682 673
683 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 674 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
684 675
685 if (num_is_fixnum (ret)) 676 if (num_is_fixnum (ret))
686 num_set_ivalue (ret, num_get_ivalue (a) + num_get_ivalue (b)); 677 {
678 IVALUE av = num_get_ivalue (a);
679 IVALUE bv = num_get_ivalue (b);
680
681 switch (op)
682 {
683 case NUM_ADD: av += bv; break;
684 case NUM_SUB: av -= bv; break;
685 case NUM_MUL: av *= bv; break;
686 case NUM_INTDIV: av /= bv; break;
687 }
688
689 num_set_ivalue (ret, av);
690 }
687 else 691 else
688 num_set_rvalue (ret, num_get_rvalue (a) + num_get_rvalue (b)); 692 {
693 RVALUE av = num_get_rvalue (a);
694 RVALUE bv = num_get_rvalue (b);
689 695
690 return ret; 696 switch (op)
691} 697 {
698 case NUM_ADD: av += bv; break;
699 case NUM_SUB: av -= bv; break;
700 case NUM_MUL: av *= bv; break;
701 case NUM_INTDIV: av /= bv; break;
702 }
692 703
693static num 704 num_set_rvalue (ret, av);
694num_mul (num a, num b) 705 }
695{
696 num ret;
697
698 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
699
700 if (num_is_fixnum (ret))
701 num_set_ivalue (ret, num_get_ivalue (a) * num_get_ivalue (b));
702 else
703 num_set_rvalue (ret, num_get_rvalue (a) * num_get_rvalue (b));
704 706
705 return ret; 707 return ret;
706} 708}
707 709
708static num 710static num
… …
719 721
720 return ret; 722 return ret;
721} 723}
722 724
723static num 725static num
724num_intdiv (num a, num b)
725{
726 num ret;
727
728 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
729
730 if (num_is_fixnum (ret))
731 num_set_ivalue (ret, num_get_ivalue (a) / num_get_ivalue (b));
732 else
733 num_set_rvalue (ret, num_get_rvalue (a) / num_get_rvalue (b));
734
735 return ret;
736}
737
738static num
739num_sub (num a, num b)
740{
741 num ret;
742
743 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
744
745 if (num_is_fixnum (ret))
746 num_set_ivalue (ret, num_get_ivalue (a) - num_get_ivalue (b));
747 else
748 num_set_rvalue (ret, num_get_rvalue (a) - num_get_rvalue (b));
749
750 return ret;
751}
752
753static num
754num_rem (num a, num b) 726num_rem (num a, num b)
755{ 727{
756 num ret; 728 num ret;
757 long e1, e2, res; 729 long e1, e2, res;
758 730
… …
794 766
795 num_set_ivalue (ret, res); 767 num_set_ivalue (ret, res);
796 return ret; 768 return ret;
797} 769}
798 770
771/* this completely disrespects NaNs, but r5rs doesn't even allow NaNs */
799static int 772static int
800num_eq (num a, num b) 773num_cmp (num a, num b)
801{ 774{
775 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
802 int ret; 776 int ret;
803 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
804 777
805 if (is_fixnum) 778 if (is_fixnum)
806 ret = num_get_ivalue (a) == num_get_ivalue (b); 779 {
780 IVALUE av = num_get_ivalue (a);
781 IVALUE bv = num_get_ivalue (b);
782
783 ret = av == bv ? 0 : av < bv ? -1 : +1;
784 }
807 else 785 else
808 ret = num_get_rvalue (a) == num_get_rvalue (b); 786 {
787 RVALUE av = num_get_rvalue (a);
788 RVALUE bv = num_get_rvalue (b);
789
790 ret = av == bv ? 0 : av < bv ? -1 : +1;
791 }
809 792
810 return ret; 793 return ret;
811}
812
813
814static int
815num_gt (num a, num b)
816{
817 int ret;
818 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
819
820 if (is_fixnum)
821 ret = num_get_ivalue (a) > num_get_ivalue (b);
822 else
823 ret = num_get_rvalue (a) > num_get_rvalue (b);
824
825 return ret;
826}
827
828static int
829num_ge (num a, num b)
830{
831 return !num_lt (a, b);
832}
833
834static int
835num_lt (num a, num b)
836{
837 int ret;
838 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
839
840 if (is_fixnum)
841 ret = num_get_ivalue (a) < num_get_ivalue (b);
842 else
843 ret = num_get_rvalue (a) < num_get_rvalue (b);
844
845 return ret;
846}
847
848static int
849num_le (num a, num b)
850{
851 return !num_gt (a, b);
852} 794}
853 795
854#if USE_MATH 796#if USE_MATH
855 797
856/* Round to nearest. Round to even if midway */ 798/* Round to nearest. Round to even if midway */
… …
866 return ce; 808 return ce;
867 else if (dfl < dce) 809 else if (dfl < dce)
868 return fl; 810 return fl;
869 else 811 else
870 { 812 {
871 if (fmod (fl, 2.0) == 0.0) /* I imagine this holds */ 813 if (fmod (fl, 2) == 0) /* I imagine this holds */
872 return fl; 814 return fl;
873 else 815 else
874 return ce; 816 return ce;
875 } 817 }
876} 818}
877#endif 819#endif
878 820
879static int 821static int
880is_zero_rvalue (RVALUE x) 822is_zero_rvalue (RVALUE x)
881{ 823{
824 return x == 0;
825#if 0
882#if USE_REAL 826#if USE_REAL
883 return x < DBL_MIN && x > -DBL_MIN; /* why the hate of denormals? this should be == 0. */ 827 return x < DBL_MIN && x > -DBL_MIN; /* why the hate of denormals? this should be == 0. */
884#else 828#else
885 return x == 0; 829 return x == 0;
830#endif
886#endif 831#endif
887} 832}
888 833
889/* allocate new cell segment */ 834/* allocate new cell segment */
890static int 835static int
… …
962 907
963 return n; 908 return n;
964} 909}
965 910
966/* get new cell. parameter a, b is marked by gc. */ 911/* get new cell. parameter a, b is marked by gc. */
967static INLINE pointer 912ecb_inline pointer
968get_cell_x (SCHEME_P_ pointer a, pointer b) 913get_cell_x (SCHEME_P_ pointer a, pointer b)
969{ 914{
970 if (SCHEME_V->free_cell == NIL) 915 if (ecb_expect_false (SCHEME_V->free_cell == NIL))
971 { 916 {
972 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 917 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
973 return S_SINK; 918 return S_SINK;
974 919
975 if (SCHEME_V->free_cell == NIL) 920 if (SCHEME_V->free_cell == NIL)
… …
1050 push_recent_alloc (SCHEME_A_ v, NIL); 995 push_recent_alloc (SCHEME_A_ v, NIL);
1051 996
1052 return v; 997 return v;
1053} 998}
1054 999
1055static INLINE void 1000ecb_inline void
1056ok_to_freely_gc (SCHEME_P) 1001ok_to_freely_gc (SCHEME_P)
1057{ 1002{
1058 set_car (S_SINK, NIL); 1003 set_car (S_SINK, NIL);
1059} 1004}
1060 1005
… …
1124 location = hash_fn (name, veclength (SCHEME_V->oblist)); 1069 location = hash_fn (name, veclength (SCHEME_V->oblist));
1125 set_vector_elem (SCHEME_V->oblist, location, immutable_cons (x, vector_elem (SCHEME_V->oblist, location))); 1070 set_vector_elem (SCHEME_V->oblist, location, immutable_cons (x, vector_elem (SCHEME_V->oblist, location)));
1126 return x; 1071 return x;
1127} 1072}
1128 1073
1129static INLINE pointer 1074ecb_inline pointer
1130oblist_find_by_name (SCHEME_P_ const char *name) 1075oblist_find_by_name (SCHEME_P_ const char *name)
1131{ 1076{
1132 int location; 1077 int location;
1133 pointer x; 1078 pointer x;
1134 char *s; 1079 char *s;
… …
1167oblist_initial_value (SCHEME_P) 1112oblist_initial_value (SCHEME_P)
1168{ 1113{
1169 return NIL; 1114 return NIL;
1170} 1115}
1171 1116
1172static INLINE pointer 1117ecb_inline pointer
1173oblist_find_by_name (SCHEME_P_ const char *name) 1118oblist_find_by_name (SCHEME_P_ const char *name)
1174{ 1119{
1175 pointer x; 1120 pointer x;
1176 char *s; 1121 char *s;
1177 1122
… …
1536 1481
1537/*-- 1482/*--
1538 * We use algorithm E (Knuth, The Art of Computer Programming Vol.1, 1483 * We use algorithm E (Knuth, The Art of Computer Programming Vol.1,
1539 * sec. 2.3.5), the Schorr-Deutsch-Waite link-inversion algorithm, 1484 * sec. 2.3.5), the Schorr-Deutsch-Waite link-inversion algorithm,
1540 * for marking. 1485 * for marking.
1486 *
1487 * The exception is vectors - vectors are currently marked recursively,
1488 * which is inherited form tinyscheme and could be fixed by having another
1489 * word of context in the vector
1541 */ 1490 */
1542static void 1491static void
1543mark (pointer a) 1492mark (pointer a)
1544{ 1493{
1545 pointer t, q, p; 1494 pointer t, q, p;
… …
1547 t = 0; 1496 t = 0;
1548 p = a; 1497 p = a;
1549E2: 1498E2:
1550 setmark (p); 1499 setmark (p);
1551 1500
1552 if (is_vector (p)) 1501 if (ecb_expect_false (is_vector (p)))
1553 { 1502 {
1554 int i; 1503 int i;
1555 1504
1556 for (i = 0; i < p->object.vector.length; i++) 1505 for (i = 0; i < p->object.vector.length; i++)
1557 mark (vecvalue (p)[i]); 1506 mark (vecvalue (p)[i]);
… …
1680} 1629}
1681 1630
1682static void 1631static void
1683finalize_cell (SCHEME_P_ pointer a) 1632finalize_cell (SCHEME_P_ pointer a)
1684{ 1633{
1634 /* TODO, fast bitmap check? */
1685 if (is_string (a)) 1635 if (is_string (a))
1686 free (strvalue (a)); 1636 free (strvalue (a));
1687 else if (is_vector (a)) 1637 else if (is_vector (a))
1688 free (vecvalue (a)); 1638 free (vecvalue (a));
1689#if USE_PORTS 1639#if USE_PORTS
… …
2270 } 2220 }
2271 } 2221 }
2272} 2222}
2273 2223
2274/* check c is in chars */ 2224/* check c is in chars */
2275static INLINE int 2225ecb_inline int
2276is_one_of (char *s, int c) 2226is_one_of (char *s, int c)
2277{ 2227{
2278 if (c == EOF) 2228 if (c == EOF)
2279 return 1; 2229 return 1;
2280 2230
2281 return !!strchr (s, c); 2231 return !!strchr (s, c);
2282} 2232}
2283 2233
2284/* skip white characters */ 2234/* skip white characters */
2285static INLINE int 2235ecb_inline int
2286skipspace (SCHEME_P) 2236skipspace (SCHEME_P)
2287{ 2237{
2288 int c, curr_line = 0; 2238 int c, curr_line = 0;
2289 2239
2290 do 2240 do
… …
2518 { 2468 {
2519 p = SCHEME_V->strbuff; 2469 p = SCHEME_V->strbuff;
2520 2470
2521 if (f <= 1 || f == 10) /* f is the base for numbers if > 1 */ 2471 if (f <= 1 || f == 10) /* f is the base for numbers if > 1 */
2522 { 2472 {
2523 if (num_is_integer (l)) 2473 if (is_integer (l))
2524 xnum (p, ivalue_unchecked (l)); 2474 xnum (p, ivalue_unchecked (l));
2525#if USE_REAL 2475#if USE_REAL
2526 else 2476 else
2527 { 2477 {
2528 snprintf (p, STRBUFFSIZE, "%.10g", rvalue_unchecked (l)); 2478 snprintf (p, STRBUFFSIZE, "%.10g", rvalue_unchecked (l));
… …
2783 return 0; 2733 return 0;
2784 } 2734 }
2785 else if (is_number (a)) 2735 else if (is_number (a))
2786 { 2736 {
2787 if (is_number (b)) 2737 if (is_number (b))
2788 if (num_is_integer (a) == num_is_integer (b))
2789 return num_eq (nvalue (a), nvalue (b)); 2738 return num_cmp (nvalue (a), nvalue (b)) == 0;
2790 2739
2791 return 0; 2740 return 0;
2792 } 2741 }
2793 else if (is_character (a)) 2742 else if (is_character (a))
2794 { 2743 {
… …
2861 2810
2862 SCHEME_V->envir = immutable_cons (new_frame, old_env); 2811 SCHEME_V->envir = immutable_cons (new_frame, old_env);
2863 setenvironment (SCHEME_V->envir); 2812 setenvironment (SCHEME_V->envir);
2864} 2813}
2865 2814
2866static INLINE void 2815ecb_inline void
2867new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) 2816new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
2868{ 2817{
2869 pointer slot = immutable_cons (variable, value); 2818 pointer slot = immutable_cons (variable, value);
2870 2819
2871 if (is_vector (car (env))) 2820 if (is_vector (car (env)))
… …
2911 return NIL; 2860 return NIL;
2912} 2861}
2913 2862
2914#else /* USE_ALIST_ENV */ 2863#else /* USE_ALIST_ENV */
2915 2864
2916static INLINE void 2865ecb_inline void
2917new_frame_in_env (SCHEME_P_ pointer old_env) 2866new_frame_in_env (SCHEME_P_ pointer old_env)
2918{ 2867{
2919 SCHEME_V->envir = immutable_cons (NIL, old_env); 2868 SCHEME_V->envir = immutable_cons (NIL, old_env);
2920 setenvironment (SCHEME_V->envir); 2869 setenvironment (SCHEME_V->envir);
2921} 2870}
2922 2871
2923static INLINE void 2872ecb_inline void
2924new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) 2873new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
2925{ 2874{
2926 set_car (env, immutable_cons (immutable_cons (variable, value), car (env))); 2875 set_car (env, immutable_cons (immutable_cons (variable, value), car (env)));
2927} 2876}
2928 2877
… …
2950 return NIL; 2899 return NIL;
2951} 2900}
2952 2901
2953#endif /* USE_ALIST_ENV else */ 2902#endif /* USE_ALIST_ENV else */
2954 2903
2955static INLINE void 2904ecb_inline void
2956new_slot_in_env (SCHEME_P_ pointer variable, pointer value) 2905new_slot_in_env (SCHEME_P_ pointer variable, pointer value)
2957{ 2906{
2958 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value); 2907 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value);
2959} 2908}
2960 2909
2961static INLINE void 2910ecb_inline void
2962set_slot_in_env (SCHEME_P_ pointer slot, pointer value) 2911set_slot_in_env (SCHEME_P_ pointer slot, pointer value)
2963{ 2912{
2964 set_cdr (slot, value); 2913 set_cdr (slot, value);
2965} 2914}
2966 2915
2967static INLINE pointer 2916ecb_inline pointer
2968slot_value_in_env (pointer slot) 2917slot_value_in_env (pointer slot)
2969{ 2918{
2970 return cdr (slot); 2919 return cdr (slot);
2971} 2920}
2972 2921
2973/* ========== Evaluation Cycle ========== */ 2922/* ========== Evaluation Cycle ========== */
2974 2923
2975static pointer 2924static int
2976xError_1 (SCHEME_P_ const char *s, pointer a) 2925xError_1 (SCHEME_P_ const char *s, pointer a)
2977{ 2926{
2978#if USE_ERROR_HOOK 2927#if USE_ERROR_HOOK
2979 pointer x; 2928 pointer x;
2980 pointer hdl = SCHEME_V->ERROR_HOOK; 2929 pointer hdl = SCHEME_V->ERROR_HOOK;
… …
3015 code = cons (mk_string (SCHEME_A_ s), code); 2964 code = cons (mk_string (SCHEME_A_ s), code);
3016 setimmutable (car (code)); 2965 setimmutable (car (code));
3017 SCHEME_V->code = cons (slot_value_in_env (x), code); 2966 SCHEME_V->code = cons (slot_value_in_env (x), code);
3018 SCHEME_V->op = OP_EVAL; 2967 SCHEME_V->op = OP_EVAL;
3019 2968
3020 return S_T; 2969 return 0;
3021 } 2970 }
3022#endif 2971#endif
3023 2972
3024 if (a) 2973 if (a)
3025 SCHEME_V->args = cons (a, NIL); 2974 SCHEME_V->args = cons (a, NIL);
… …
3027 SCHEME_V->args = NIL; 2976 SCHEME_V->args = NIL;
3028 2977
3029 SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args); 2978 SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args);
3030 setimmutable (car (SCHEME_V->args)); 2979 setimmutable (car (SCHEME_V->args));
3031 SCHEME_V->op = OP_ERR0; 2980 SCHEME_V->op = OP_ERR0;
2981
3032 return S_T; 2982 return 0;
3033} 2983}
3034 2984
3035#define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a) 2985#define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a)
3036#define Error_0(s) Error_1 (s, 0) 2986#define Error_0(s) Error_1 (s, 0)
3037 2987
3038/* Too small to turn into function */ 2988/* Too small to turn into function */
3039#define BEGIN do { 2989#define BEGIN do {
3040#define END } while (0) 2990#define END } while (0)
3041#define s_goto(a) BEGIN \ 2991#define s_goto(a) BEGIN \
3042 SCHEME_V->op = a; \ 2992 SCHEME_V->op = a; \
3043 return S_T; END 2993 return 0; END
3044 2994
3045#define s_return(a) return xs_return (SCHEME_A_ a) 2995#define s_return(a) return xs_return (SCHEME_A_ a)
3046 2996
3047#ifndef USE_SCHEME_STACK 2997#ifndef USE_SCHEME_STACK
3048 2998
… …
3073 next_frame = SCHEME_V->dump_base + nframes; 3023 next_frame = SCHEME_V->dump_base + nframes;
3074 3024
3075 next_frame->op = op; 3025 next_frame->op = op;
3076 next_frame->args = args; 3026 next_frame->args = args;
3077 next_frame->envir = SCHEME_V->envir; 3027 next_frame->envir = SCHEME_V->envir;
3078 next_frame->code = code; 3028 next_frame->code = code;
3079 3029
3080 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1); 3030 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1);
3081} 3031}
3082 3032
3083static pointer 3033static int
3084xs_return (SCHEME_P_ pointer a) 3034xs_return (SCHEME_P_ pointer a)
3085{ 3035{
3086 int nframes = (uintptr_t)SCHEME_V->dump; 3036 int nframes = (uintptr_t)SCHEME_V->dump;
3087 struct dump_stack_frame *frame; 3037 struct dump_stack_frame *frame;
3088 3038
3089 SCHEME_V->value = a; 3039 SCHEME_V->value = a;
3090 3040
3091 if (nframes <= 0) 3041 if (nframes <= 0)
3092 return NIL; 3042 return -1;
3093 3043
3094 frame = &SCHEME_V->dump_base[--nframes]; 3044 frame = &SCHEME_V->dump_base[--nframes];
3095 SCHEME_V->op = frame->op; 3045 SCHEME_V->op = frame->op;
3096 SCHEME_V->args = frame->args; 3046 SCHEME_V->args = frame->args;
3097 SCHEME_V->envir = frame->envir; 3047 SCHEME_V->envir = frame->envir;
3098 SCHEME_V->code = frame->code; 3048 SCHEME_V->code = frame->code;
3099 SCHEME_V->dump = (pointer)(uintptr_t)nframes; 3049 SCHEME_V->dump = (pointer)(uintptr_t)nframes;
3100 3050
3101 return S_T; 3051 return 0;
3102} 3052}
3103 3053
3104static INLINE void 3054ecb_inline void
3105dump_stack_reset (SCHEME_P) 3055dump_stack_reset (SCHEME_P)
3106{ 3056{
3107 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */ 3057 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */
3108 SCHEME_V->dump = (pointer)+0; 3058 SCHEME_V->dump = (pointer)+0;
3109} 3059}
3110 3060
3111static INLINE void 3061ecb_inline void
3112dump_stack_initialize (SCHEME_P) 3062dump_stack_initialize (SCHEME_P)
3113{ 3063{
3114 SCHEME_V->dump_size = 0; 3064 SCHEME_V->dump_size = 0;
3115 SCHEME_V->dump_base = 0; 3065 SCHEME_V->dump_base = 0;
3116 dump_stack_reset (SCHEME_A); 3066 dump_stack_reset (SCHEME_A);
… …
3183 SCHEME_V->dump = (pointer)(uintptr_t)i; 3133 SCHEME_V->dump = (pointer)(uintptr_t)i;
3184} 3134}
3185 3135
3186#else 3136#else
3187 3137
3188static INLINE void 3138ecb_inline void
3189dump_stack_reset (SCHEME_P) 3139dump_stack_reset (SCHEME_P)
3190{ 3140{
3191 SCHEME_V->dump = NIL; 3141 SCHEME_V->dump = NIL;
3192} 3142}
3193 3143
3194static INLINE void 3144ecb_inline void
3195dump_stack_initialize (SCHEME_P) 3145dump_stack_initialize (SCHEME_P)
3196{ 3146{
3197 dump_stack_reset (SCHEME_A); 3147 dump_stack_reset (SCHEME_A);
3198} 3148}
3199 3149
… …
3201dump_stack_free (SCHEME_P) 3151dump_stack_free (SCHEME_P)
3202{ 3152{
3203 SCHEME_V->dump = NIL; 3153 SCHEME_V->dump = NIL;
3204} 3154}
3205 3155
3206static pointer 3156static int
3207xs_return (SCHEME_P_ pointer a) 3157xs_return (SCHEME_P_ pointer a)
3208{ 3158{
3209 pointer dump = SCHEME_V->dump; 3159 pointer dump = SCHEME_V->dump;
3210 3160
3211 SCHEME_V->value = a; 3161 SCHEME_V->value = a;
3212 3162
3213 if (dump == NIL) 3163 if (dump == NIL)
3214 return NIL; 3164 return -1;
3215 3165
3216 SCHEME_V->op = ivalue (car (dump)); dump = cdr (dump); 3166 SCHEME_V->op = ivalue (car (dump)); dump = cdr (dump);
3217 SCHEME_V->args = car (dump) ; dump = cdr (dump); 3167 SCHEME_V->args = car (dump) ; dump = cdr (dump);
3218 SCHEME_V->envir = car (dump) ; dump = cdr (dump); 3168 SCHEME_V->envir = car (dump) ; dump = cdr (dump);
3219 SCHEME_V->code = car (dump) ; dump = cdr (dump); 3169 SCHEME_V->code = car (dump) ; dump = cdr (dump);
3220 3170
3221 SCHEME_V->dump = dump; 3171 SCHEME_V->dump = dump;
3222 3172
3223 return S_T; 3173 return 0;
3224} 3174}
3225 3175
3226static void 3176static void
3227s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code) 3177s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code)
3228{ 3178{
… …
3253 3203
3254#endif 3204#endif
3255 3205
3256#define s_retbool(tf) s_return ((tf) ? S_T : S_F) 3206#define s_retbool(tf) s_return ((tf) ? S_T : S_F)
3257 3207
3258static pointer 3208static int
3259opexe_0 (SCHEME_P_ enum scheme_opcodes op) 3209opexe_0 (SCHEME_P_ enum scheme_opcodes op)
3260{ 3210{
3211 pointer args = SCHEME_V->args;
3261 pointer x, y; 3212 pointer x, y;
3262 3213
3263 switch (op) 3214 switch (op)
3264 { 3215 {
3265 case OP_LOAD: /* load */ 3216 case OP_LOAD: /* load */
3266 if (file_interactive (SCHEME_A)) 3217 if (file_interactive (SCHEME_A))
3267 { 3218 {
3268 xwrstr ("Loading "); xwrstr (strvalue (car (SCHEME_V->args))); xwrstr ("\n"); 3219 xwrstr ("Loading "); xwrstr (strvalue (car (args))); xwrstr ("\n");
3269 //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (SCHEME_V->args))); 3220 //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args)));
3270 } 3221 }
3271 3222
3272 if (!file_push (SCHEME_A_ strvalue (car (SCHEME_V->args)))) 3223 if (!file_push (SCHEME_A_ strvalue (car (args))))
3273 Error_1 ("unable to open", car (SCHEME_V->args)); 3224 Error_1 ("unable to open", car (args));
3274 else 3225 else
3275 { 3226 {
3276 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i); 3227 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i);
3277 s_goto (OP_T0LVL); 3228 s_goto (OP_T0LVL);
3278 } 3229 }
… …
3352 case OP_EVAL: /* main part of evaluation */ 3303 case OP_EVAL: /* main part of evaluation */
3353#if USE_TRACING 3304#if USE_TRACING
3354 if (SCHEME_V->tracing) 3305 if (SCHEME_V->tracing)
3355 { 3306 {
3356 /*s_save(SCHEME_A_ OP_VALUEPRINT,NIL,NIL); */ 3307 /*s_save(SCHEME_A_ OP_VALUEPRINT,NIL,NIL); */
3357 s_save (SCHEME_A_ OP_REAL_EVAL, SCHEME_V->args, SCHEME_V->code); 3308 s_save (SCHEME_A_ OP_REAL_EVAL, args, SCHEME_V->code);
3358 SCHEME_V->args = SCHEME_V->code; 3309 SCHEME_V->args = SCHEME_V->code;
3359 putstr (SCHEME_A_ "\nEval: "); 3310 putstr (SCHEME_A_ "\nEval: ");
3360 s_goto (OP_P0LIST); 3311 s_goto (OP_P0LIST);
3361 } 3312 }
3362 3313
… …
3406 SCHEME_V->code = cdr (SCHEME_V->code); 3357 SCHEME_V->code = cdr (SCHEME_V->code);
3407 s_goto (OP_E1ARGS); 3358 s_goto (OP_E1ARGS);
3408 } 3359 }
3409 3360
3410 case OP_E1ARGS: /* eval arguments */ 3361 case OP_E1ARGS: /* eval arguments */
3411 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 3362 args = cons (SCHEME_V->value, args);
3412 3363
3413 if (is_pair (SCHEME_V->code)) /* continue */ 3364 if (is_pair (SCHEME_V->code)) /* continue */
3414 { 3365 {
3415 s_save (SCHEME_A_ OP_E1ARGS, SCHEME_V->args, cdr (SCHEME_V->code)); 3366 s_save (SCHEME_A_ OP_E1ARGS, args, cdr (SCHEME_V->code));
3416 SCHEME_V->code = car (SCHEME_V->code); 3367 SCHEME_V->code = car (SCHEME_V->code);
3417 SCHEME_V->args = NIL; 3368 SCHEME_V->args = NIL;
3418 s_goto (OP_EVAL); 3369 s_goto (OP_EVAL);
3419 } 3370 }
3420 else /* end */ 3371 else /* end */
3421 { 3372 {
3422 SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); 3373 args = reverse_in_place (SCHEME_A_ NIL, args);
3423 SCHEME_V->code = car (SCHEME_V->args); 3374 SCHEME_V->code = car (args);
3424 SCHEME_V->args = cdr (SCHEME_V->args); 3375 SCHEME_V->args = cdr (args);
3425 s_goto (OP_APPLY); 3376 s_goto (OP_APPLY);
3426 } 3377 }
3427 3378
3428#if USE_TRACING 3379#if USE_TRACING
3429 3380
3430 case OP_TRACING: 3381 case OP_TRACING:
3431 { 3382 {
3432 int tr = SCHEME_V->tracing; 3383 int tr = SCHEME_V->tracing;
3433 3384
3434 SCHEME_V->tracing = ivalue (car (SCHEME_V->args)); 3385 SCHEME_V->tracing = ivalue (car (args));
3435 s_return (mk_integer (SCHEME_A_ tr)); 3386 s_return (mk_integer (SCHEME_A_ tr));
3436 } 3387 }
3437 3388
3438#endif 3389#endif
3439 3390
3440 case OP_APPLY: /* apply 'code' to 'args' */ 3391 case OP_APPLY: /* apply 'code' to 'args' */
3441#if USE_TRACING 3392#if USE_TRACING
3442 if (SCHEME_V->tracing) 3393 if (SCHEME_V->tracing)
3443 { 3394 {
3444 s_save (SCHEME_A_ OP_REAL_APPLY, SCHEME_V->args, SCHEME_V->code); 3395 s_save (SCHEME_A_ OP_REAL_APPLY, args, SCHEME_V->code);
3445 SCHEME_V->print_flag = 1; 3396 SCHEME_V->print_flag = 1;
3446 /* SCHEME_V->args=cons(SCHEME_V->code,SCHEME_V->args); */ 3397 /* args=cons(SCHEME_V->code,args); */
3447 putstr (SCHEME_A_ "\nApply to: "); 3398 putstr (SCHEME_A_ "\nApply to: ");
3448 s_goto (OP_P0LIST); 3399 s_goto (OP_P0LIST);
3449 } 3400 }
3450 3401
3451 /* fall through */ 3402 /* fall through */
3452 3403
3453 case OP_REAL_APPLY: 3404 case OP_REAL_APPLY:
3454#endif 3405#endif
3455 if (is_proc (SCHEME_V->code)) 3406 if (is_proc (SCHEME_V->code))
3456 {
3457 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */ 3407 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */
3458 }
3459 else if (is_foreign (SCHEME_V->code)) 3408 else if (is_foreign (SCHEME_V->code))
3460 { 3409 {
3461 /* Keep nested calls from GC'ing the arglist */ 3410 /* Keep nested calls from GC'ing the arglist */
3462 push_recent_alloc (SCHEME_A_ SCHEME_V->args, NIL); 3411 push_recent_alloc (SCHEME_A_ args, NIL);
3463 x = SCHEME_V->code->object.ff (SCHEME_A_ SCHEME_V->args); 3412 x = SCHEME_V->code->object.ff (SCHEME_A_ args);
3464 3413
3465 s_return (x); 3414 s_return (x);
3466 } 3415 }
3467 else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */ 3416 else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */
3468 { 3417 {
3469 /* Should not accept promise */ 3418 /* Should not accept promise */
3470 /* make environment */ 3419 /* make environment */
3471 new_frame_in_env (SCHEME_A_ closure_env (SCHEME_V->code)); 3420 new_frame_in_env (SCHEME_A_ closure_env (SCHEME_V->code));
3472 3421
3473 for (x = car (closure_code (SCHEME_V->code)), y = SCHEME_V->args; is_pair (x); x = cdr (x), y = cdr (y)) 3422 for (x = car (closure_code (SCHEME_V->code)), y = args; is_pair (x); x = cdr (x), y = cdr (y))
3474 { 3423 {
3475 if (y == NIL) 3424 if (y == NIL)
3476 Error_0 ("not enough arguments"); 3425 Error_0 ("not enough arguments");
3477 else 3426 else
3478 new_slot_in_env (SCHEME_A_ car (x), car (y)); 3427 new_slot_in_env (SCHEME_A_ car (x), car (y));
… …
3496 s_goto (OP_BEGIN); 3445 s_goto (OP_BEGIN);
3497 } 3446 }
3498 else if (is_continuation (SCHEME_V->code)) /* CONTINUATION */ 3447 else if (is_continuation (SCHEME_V->code)) /* CONTINUATION */
3499 { 3448 {
3500 ss_set_cont (SCHEME_A_ cont_dump (SCHEME_V->code)); 3449 ss_set_cont (SCHEME_A_ cont_dump (SCHEME_V->code));
3501 s_return (SCHEME_V->args != NIL ? car (SCHEME_V->args) : NIL); 3450 s_return (args != NIL ? car (args) : NIL);
3502 } 3451 }
3503 else 3452 else
3504 Error_0 ("illegal function"); 3453 Error_0 ("illegal function");
3505 3454
3506 case OP_DOMACRO: /* do macro */ 3455 case OP_DOMACRO: /* do macro */
… …
3515 { 3464 {
3516 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1); 3465 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1);
3517 3466
3518 if (f != NIL) 3467 if (f != NIL)
3519 { 3468 {
3520 s_save (SCHEME_A_ OP_LAMBDA1, SCHEME_V->args, SCHEME_V->code); 3469 s_save (SCHEME_A_ OP_LAMBDA1, args, SCHEME_V->code);
3521 SCHEME_V->args = cons (SCHEME_V->code, NIL); 3470 SCHEME_V->args = cons (SCHEME_V->code, NIL);
3522 SCHEME_V->code = slot_value_in_env (f); 3471 SCHEME_V->code = slot_value_in_env (f);
3523 s_goto (OP_APPLY); 3472 s_goto (OP_APPLY);
3524 } 3473 }
3525 3474
… …
3536 s_return (mk_closure (SCHEME_A_ SCHEME_V->code, SCHEME_V->envir)); 3485 s_return (mk_closure (SCHEME_A_ SCHEME_V->code, SCHEME_V->envir));
3537 3486
3538#endif 3487#endif
3539 3488
3540 case OP_MKCLOSURE: /* make-closure */ 3489 case OP_MKCLOSURE: /* make-closure */
3541 x = car (SCHEME_V->args); 3490 x = car (args);
3542 3491
3543 if (car (x) == SCHEME_V->LAMBDA) 3492 if (car (x) == SCHEME_V->LAMBDA)
3544 x = cdr (x); 3493 x = cdr (x);
3545 3494
3546 if (cdr (SCHEME_V->args) == NIL) 3495 if (cdr (args) == NIL)
3547 y = SCHEME_V->envir; 3496 y = SCHEME_V->envir;
3548 else 3497 else
3549 y = cadr (SCHEME_V->args); 3498 y = cadr (args);
3550 3499
3551 s_return (mk_closure (SCHEME_A_ x, y)); 3500 s_return (mk_closure (SCHEME_A_ x, y));
3552 3501
3553 case OP_QUOTE: /* quote */ 3502 case OP_QUOTE: /* quote */
3554 s_return (car (SCHEME_V->code)); 3503 s_return (car (SCHEME_V->code));
… …
3586 3535
3587 3536
3588 case OP_DEFP: /* defined? */ 3537 case OP_DEFP: /* defined? */
3589 x = SCHEME_V->envir; 3538 x = SCHEME_V->envir;
3590 3539
3591 if (cdr (SCHEME_V->args) != NIL) 3540 if (cdr (args) != NIL)
3592 x = cadr (SCHEME_V->args); 3541 x = cadr (args);
3593 3542
3594 s_retbool (find_slot_in_env (SCHEME_A_ x, car (SCHEME_V->args), 1) != NIL); 3543 s_retbool (find_slot_in_env (SCHEME_A_ x, car (args), 1) != NIL);
3595 3544
3596 case OP_SET0: /* set! */ 3545 case OP_SET0: /* set! */
3597 if (is_immutable (car (SCHEME_V->code))) 3546 if (is_immutable (car (SCHEME_V->code)))
3598 Error_1 ("set!: unable to alter immutable variable", car (SCHEME_V->code)); 3547 Error_1 ("set!: unable to alter immutable variable", car (SCHEME_V->code));
3599 3548
… …
3630 3579
3631 case OP_IF1: /* if */ 3580 case OP_IF1: /* if */
3632 if (is_true (SCHEME_V->value)) 3581 if (is_true (SCHEME_V->value))
3633 SCHEME_V->code = car (SCHEME_V->code); 3582 SCHEME_V->code = car (SCHEME_V->code);
3634 else 3583 else
3635 SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because 3584 SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because * car(NIL) = NIL */
3636
3637 * car(NIL) = NIL */
3638 s_goto (OP_EVAL); 3585 s_goto (OP_EVAL);
3639 3586
3640 case OP_LET0: /* let */ 3587 case OP_LET0: /* let */
3641 SCHEME_V->args = NIL; 3588 SCHEME_V->args = NIL;
3642 SCHEME_V->value = SCHEME_V->code; 3589 SCHEME_V->value = SCHEME_V->code;
3643 SCHEME_V->code = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code); 3590 SCHEME_V->code = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code);
3644 s_goto (OP_LET1); 3591 s_goto (OP_LET1);
3645 3592
3646 case OP_LET1: /* let (calculate parameters) */ 3593 case OP_LET1: /* let (calculate parameters) */
3647 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 3594 args = cons (SCHEME_V->value, args);
3648 3595
3649 if (is_pair (SCHEME_V->code)) /* continue */ 3596 if (is_pair (SCHEME_V->code)) /* continue */
3650 { 3597 {
3651 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code))) 3598 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code)))
3652 Error_1 ("Bad syntax of binding spec in let :", car (SCHEME_V->code)); 3599 Error_1 ("Bad syntax of binding spec in let :", car (SCHEME_V->code));
3653 3600
3654 s_save (SCHEME_A_ OP_LET1, SCHEME_V->args, cdr (SCHEME_V->code)); 3601 s_save (SCHEME_A_ OP_LET1, args, cdr (SCHEME_V->code));
3655 SCHEME_V->code = cadar (SCHEME_V->code); 3602 SCHEME_V->code = cadar (SCHEME_V->code);
3656 SCHEME_V->args = NIL; 3603 SCHEME_V->args = NIL;
3657 s_goto (OP_EVAL); 3604 s_goto (OP_EVAL);
3658 } 3605 }
3659 else /* end */ 3606 else /* end */
3660 { 3607 {
3661 SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); 3608 args = reverse_in_place (SCHEME_A_ NIL, args);
3662 SCHEME_V->code = car (SCHEME_V->args); 3609 SCHEME_V->code = car (args);
3663 SCHEME_V->args = cdr (SCHEME_V->args); 3610 SCHEME_V->args = cdr (args);
3664 s_goto (OP_LET2); 3611 s_goto (OP_LET2);
3665 } 3612 }
3666 3613
3667 case OP_LET2: /* let */ 3614 case OP_LET2: /* let */
3668 new_frame_in_env (SCHEME_A_ SCHEME_V->envir); 3615 new_frame_in_env (SCHEME_A_ SCHEME_V->envir);
3669 3616
3670 for (x = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code), y = SCHEME_V->args; 3617 for (x = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code), y = args;
3671 y != NIL; x = cdr (x), y = cdr (y)) 3618 y != NIL; x = cdr (x), y = cdr (y))
3672 new_slot_in_env (SCHEME_A_ caar (x), car (y)); 3619 new_slot_in_env (SCHEME_A_ caar (x), car (y));
3673 3620
3674 if (is_symbol (car (SCHEME_V->code))) /* named let */ 3621 if (is_symbol (car (SCHEME_V->code))) /* named let */
3675 { 3622 {
3676 for (x = cadr (SCHEME_V->code), SCHEME_V->args = NIL; x != NIL; x = cdr (x)) 3623 for (x = cadr (SCHEME_V->code), args = NIL; x != NIL; x = cdr (x))
3677 { 3624 {
3678 if (!is_pair (x)) 3625 if (!is_pair (x))
3679 Error_1 ("Bad syntax of binding in let :", x); 3626 Error_1 ("Bad syntax of binding in let :", x);
3680 3627
3681 if (!is_list (SCHEME_A_ car (x))) 3628 if (!is_list (SCHEME_A_ car (x)))
3682 Error_1 ("Bad syntax of binding in let :", car (x)); 3629 Error_1 ("Bad syntax of binding in let :", car (x));
3683 3630
3684 SCHEME_V->args = cons (caar (x), SCHEME_V->args); 3631 args = cons (caar (x), args);
3685 } 3632 }
3686 3633
3687 x =
3688 mk_closure (SCHEME_A_ cons (reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args), cddr (SCHEME_V->code)), 3634 x = mk_closure (SCHEME_A_ cons (reverse_in_place (SCHEME_A_ NIL, args), cddr (SCHEME_V->code)),
3689 SCHEME_V->envir); 3635 SCHEME_V->envir);
3690 new_slot_in_env (SCHEME_A_ car (SCHEME_V->code), x); 3636 new_slot_in_env (SCHEME_A_ car (SCHEME_V->code), x);
3691 SCHEME_V->code = cddr (SCHEME_V->code); 3637 SCHEME_V->code = cddr (SCHEME_V->code);
3692 SCHEME_V->args = NIL;
3693 } 3638 }
3694 else 3639 else
3695 { 3640 {
3696 SCHEME_V->code = cdr (SCHEME_V->code); 3641 SCHEME_V->code = cdr (SCHEME_V->code);
3642 }
3643
3697 SCHEME_V->args = NIL; 3644 SCHEME_V->args = NIL;
3698 }
3699
3700 s_goto (OP_BEGIN); 3645 s_goto (OP_BEGIN);
3701 3646
3702 case OP_LET0AST: /* let* */ 3647 case OP_LET0AST: /* let* */
3703 if (car (SCHEME_V->code) == NIL) 3648 if (car (SCHEME_V->code) == NIL)
3704 { 3649 {
… …
3722 new_slot_in_env (SCHEME_A_ caar (SCHEME_V->code), SCHEME_V->value); 3667 new_slot_in_env (SCHEME_A_ caar (SCHEME_V->code), SCHEME_V->value);
3723 SCHEME_V->code = cdr (SCHEME_V->code); 3668 SCHEME_V->code = cdr (SCHEME_V->code);
3724 3669
3725 if (is_pair (SCHEME_V->code)) /* continue */ 3670 if (is_pair (SCHEME_V->code)) /* continue */
3726 { 3671 {
3727 s_save (SCHEME_A_ OP_LET2AST, SCHEME_V->args, SCHEME_V->code); 3672 s_save (SCHEME_A_ OP_LET2AST, args, SCHEME_V->code);
3728 SCHEME_V->code = cadar (SCHEME_V->code); 3673 SCHEME_V->code = cadar (SCHEME_V->code);
3729 SCHEME_V->args = NIL; 3674 SCHEME_V->args = NIL;
3730 s_goto (OP_EVAL); 3675 s_goto (OP_EVAL);
3731 } 3676 }
3732 else /* end */ 3677 else /* end */
3733 { 3678 {
3734 SCHEME_V->code = SCHEME_V->args; 3679 SCHEME_V->code = args;
3735 SCHEME_V->args = NIL; 3680 SCHEME_V->args = NIL;
3736 s_goto (OP_BEGIN); 3681 s_goto (OP_BEGIN);
3737 } 3682 }
3738 3683
3739 case OP_LET0REC: /* letrec */ 3684 case OP_LET0REC: /* letrec */
… …
3742 SCHEME_V->value = SCHEME_V->code; 3687 SCHEME_V->value = SCHEME_V->code;
3743 SCHEME_V->code = car (SCHEME_V->code); 3688 SCHEME_V->code = car (SCHEME_V->code);
3744 s_goto (OP_LET1REC); 3689 s_goto (OP_LET1REC);
3745 3690
3746 case OP_LET1REC: /* letrec (calculate parameters) */ 3691 case OP_LET1REC: /* letrec (calculate parameters) */
3747 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 3692 args = cons (SCHEME_V->value, args);
3748 3693
3749 if (is_pair (SCHEME_V->code)) /* continue */ 3694 if (is_pair (SCHEME_V->code)) /* continue */
3750 { 3695 {
3751 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code))) 3696 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code)))
3752 Error_1 ("Bad syntax of binding spec in letrec :", car (SCHEME_V->code)); 3697 Error_1 ("Bad syntax of binding spec in letrec :", car (SCHEME_V->code));
3753 3698
3754 s_save (SCHEME_A_ OP_LET1REC, SCHEME_V->args, cdr (SCHEME_V->code)); 3699 s_save (SCHEME_A_ OP_LET1REC, args, cdr (SCHEME_V->code));
3755 SCHEME_V->code = cadar (SCHEME_V->code); 3700 SCHEME_V->code = cadar (SCHEME_V->code);
3756 SCHEME_V->args = NIL; 3701 SCHEME_V->args = NIL;
3757 s_goto (OP_EVAL); 3702 s_goto (OP_EVAL);
3758 } 3703 }
3759 else /* end */ 3704 else /* end */
3760 { 3705 {
3761 SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); 3706 args = reverse_in_place (SCHEME_A_ NIL, args);
3762 SCHEME_V->code = car (SCHEME_V->args); 3707 SCHEME_V->code = car (args);
3763 SCHEME_V->args = cdr (SCHEME_V->args); 3708 SCHEME_V->args = cdr (args);
3764 s_goto (OP_LET2REC); 3709 s_goto (OP_LET2REC);
3765 } 3710 }
3766 3711
3767 case OP_LET2REC: /* letrec */ 3712 case OP_LET2REC: /* letrec */
3768 for (x = car (SCHEME_V->code), y = SCHEME_V->args; y != NIL; x = cdr (x), y = cdr (y)) 3713 for (x = car (SCHEME_V->code), y = args; y != NIL; x = cdr (x), y = cdr (y))
3769 new_slot_in_env (SCHEME_A_ caar (x), car (y)); 3714 new_slot_in_env (SCHEME_A_ caar (x), car (y));
3770 3715
3771 SCHEME_V->code = cdr (SCHEME_V->code); 3716 SCHEME_V->code = cdr (SCHEME_V->code);
3772 SCHEME_V->args = NIL; 3717 SCHEME_V->args = NIL;
3773 s_goto (OP_BEGIN); 3718 s_goto (OP_BEGIN);
… …
3859 s_save (SCHEME_A_ OP_C1STREAM, NIL, cdr (SCHEME_V->code)); 3804 s_save (SCHEME_A_ OP_C1STREAM, NIL, cdr (SCHEME_V->code));
3860 SCHEME_V->code = car (SCHEME_V->code); 3805 SCHEME_V->code = car (SCHEME_V->code);
3861 s_goto (OP_EVAL); 3806 s_goto (OP_EVAL);
3862 3807
3863 case OP_C1STREAM: /* cons-stream */ 3808 case OP_C1STREAM: /* cons-stream */
3864 SCHEME_V->args = SCHEME_V->value; /* save SCHEME_V->value to register SCHEME_V->args for gc */ 3809 SCHEME_V->args = SCHEME_V->value; /* save SCHEME_V->value to register args for gc */
3865 x = mk_closure (SCHEME_A_ cons (NIL, SCHEME_V->code), SCHEME_V->envir); 3810 x = mk_closure (SCHEME_A_ cons (NIL, SCHEME_V->code), SCHEME_V->envir);
3866 set_typeflag (x, T_PROMISE); 3811 set_typeflag (x, T_PROMISE);
3867 s_return (cons (SCHEME_V->args, x)); 3812 s_return (cons (args, x));
3868 3813
3869 case OP_MACRO0: /* macro */ 3814 case OP_MACRO0: /* macro */
3870 if (is_pair (car (SCHEME_V->code))) 3815 if (is_pair (car (SCHEME_V->code)))
3871 { 3816 {
3872 x = caar (SCHEME_V->code); 3817 x = caar (SCHEME_V->code);
… …
3905 { 3850 {
3906 if (!is_pair (y = caar (x))) 3851 if (!is_pair (y = caar (x)))
3907 break; 3852 break;
3908 3853
3909 for (; y != NIL; y = cdr (y)) 3854 for (; y != NIL; y = cdr (y))
3910 {
3911 if (eqv (car (y), SCHEME_V->value)) 3855 if (eqv (car (y), SCHEME_V->value))
3912 break; 3856 break;
3913 }
3914 3857
3915 if (y != NIL) 3858 if (y != NIL)
3916 break; 3859 break;
3917 } 3860 }
3918 3861
… …
3938 s_goto (OP_BEGIN); 3881 s_goto (OP_BEGIN);
3939 else 3882 else
3940 s_return (NIL); 3883 s_return (NIL);
3941 3884
3942 case OP_PAPPLY: /* apply */ 3885 case OP_PAPPLY: /* apply */
3943 SCHEME_V->code = car (SCHEME_V->args); 3886 SCHEME_V->code = car (args);
3944 SCHEME_V->args = list_star (SCHEME_A_ cdr (SCHEME_V->args)); 3887 SCHEME_V->args = list_star (SCHEME_A_ cdr (args));
3945 /*SCHEME_V->args = cadr(SCHEME_V->args); */ 3888 /*SCHEME_V->args = cadr(args); */
3946 s_goto (OP_APPLY); 3889 s_goto (OP_APPLY);
3947 3890
3948 case OP_PEVAL: /* eval */ 3891 case OP_PEVAL: /* eval */
3949 if (cdr (SCHEME_V->args) != NIL) 3892 if (cdr (args) != NIL)
3950 SCHEME_V->envir = cadr (SCHEME_V->args); 3893 SCHEME_V->envir = cadr (args);
3951 3894
3952 SCHEME_V->code = car (SCHEME_V->args); 3895 SCHEME_V->code = car (args);
3953 s_goto (OP_EVAL); 3896 s_goto (OP_EVAL);
3954 3897
3955 case OP_CONTINUATION: /* call-with-current-continuation */ 3898 case OP_CONTINUATION: /* call-with-current-continuation */
3956 SCHEME_V->code = car (SCHEME_V->args); 3899 SCHEME_V->code = car (args);
3957 SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL); 3900 SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL);
3958 s_goto (OP_APPLY); 3901 s_goto (OP_APPLY);
3959 } 3902 }
3960 3903
3961 return S_T; 3904 if (USE_ERROR_CHECKING) abort ();
3962} 3905}
3963 3906
3964static pointer 3907static int
3965opexe_2 (SCHEME_P_ enum scheme_opcodes op) 3908opexe_1 (SCHEME_P_ enum scheme_opcodes op)
3966{ 3909{
3967 pointer x; 3910 pointer args = SCHEME_V->args;
3911 pointer x = car (args);
3968 num v; 3912 num v;
3969 3913
3970#if USE_MATH 3914#if USE_MATH
3971 RVALUE dd; 3915 RVALUE dd;
3972#endif 3916#endif
3973 3917
3974 switch (op) 3918 switch (op)
3975 { 3919 {
3976#if USE_MATH 3920#if USE_MATH
3977
3978 case OP_INEX2EX: /* inexact->exact */ 3921 case OP_INEX2EX: /* inexact->exact */
3979 x = car (SCHEME_V->args);
3980
3981 if (num_is_integer (x)) 3922 if (is_integer (x))
3982 s_return (x); 3923 s_return (x);
3983 else if (modf (rvalue_unchecked (x), &dd) == 0.0) 3924 else if (modf (rvalue_unchecked (x), &dd) == 0)
3984 s_return (mk_integer (SCHEME_A_ ivalue (x))); 3925 s_return (mk_integer (SCHEME_A_ ivalue (x)));
3985 else 3926 else
3986 Error_1 ("inexact->exact: not integral:", x); 3927 Error_1 ("inexact->exact: not integral:", x);
3987 3928
3988 case OP_EXP:
3989 x = car (SCHEME_V->args);
3990 s_return (mk_real (SCHEME_A_ exp (rvalue (x)))); 3929 case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x))));
3991
3992 case OP_LOG:
3993 x = car (SCHEME_V->args);
3994 s_return (mk_real (SCHEME_A_ log (rvalue (x)))); 3930 case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x))));
3995
3996 case OP_SIN:
3997 x = car (SCHEME_V->args);
3998 s_return (mk_real (SCHEME_A_ sin (rvalue (x)))); 3931 case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x))));
3999
4000 case OP_COS:
4001 x = car (SCHEME_V->args);
4002 s_return (mk_real (SCHEME_A_ cos (rvalue (x)))); 3932 case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x))));
4003
4004 case OP_TAN:
4005 x = car (SCHEME_V->args);
4006 s_return (mk_real (SCHEME_A_ tan (rvalue (x)))); 3933 case OP_TAN: s_return (mk_real (SCHEME_A_ tan (rvalue (x))));
4007
4008 case OP_ASIN:
4009 x = car (SCHEME_V->args);
4010 s_return (mk_real (SCHEME_A_ asin (rvalue (x)))); 3934 case OP_ASIN: s_return (mk_real (SCHEME_A_ asin (rvalue (x))));
4011
4012 case OP_ACOS:
4013 x = car (SCHEME_V->args);
4014 s_return (mk_real (SCHEME_A_ acos (rvalue (x)))); 3935 case OP_ACOS: s_return (mk_real (SCHEME_A_ acos (rvalue (x))));
4015 3936
4016 case OP_ATAN: 3937 case OP_ATAN:
4017 x = car (SCHEME_V->args);
4018
4019 if (cdr (SCHEME_V->args) == NIL) 3938 if (cdr (args) == NIL)
4020 s_return (mk_real (SCHEME_A_ atan (rvalue (x)))); 3939 s_return (mk_real (SCHEME_A_ atan (rvalue (x))));
4021 else 3940 else
4022 { 3941 {
4023 pointer y = cadr (SCHEME_V->args); 3942 pointer y = cadr (args);
4024
4025 s_return (mk_real (SCHEME_A_ atan2 (rvalue (x), rvalue (y)))); 3943 s_return (mk_real (SCHEME_A_ atan2 (rvalue (x), rvalue (y))));
4026 } 3944 }
4027 3945
4028 case OP_SQRT: 3946 case OP_SQRT:
4029 x = car (SCHEME_V->args);
4030 s_return (mk_real (SCHEME_A_ sqrt (rvalue (x)))); 3947 s_return (mk_real (SCHEME_A_ sqrt (rvalue (x))));
4031 3948
4032 case OP_EXPT: 3949 case OP_EXPT:
4033 { 3950 {
4034 RVALUE result; 3951 RVALUE result;
4035 int real_result = 1; 3952 int real_result = 1;
4036 pointer y = cadr (SCHEME_V->args); 3953 pointer y = cadr (args);
4037 3954
4038 x = car (SCHEME_V->args);
4039
4040 if (num_is_integer (x) && num_is_integer (y)) 3955 if (is_integer (x) && is_integer (y))
4041 real_result = 0; 3956 real_result = 0;
4042 3957
4043 /* This 'if' is an R5RS compatibility fix. */ 3958 /* This 'if' is an R5RS compatibility fix. */
4044 /* NOTE: Remove this 'if' fix for R6RS. */ 3959 /* NOTE: Remove this 'if' fix for R6RS. */
4045 if (rvalue (x) == 0 && rvalue (y) < 0) 3960 if (rvalue (x) == 0 && rvalue (y) < 0)
4046 result = 0.0; 3961 result = 0;
4047 else 3962 else
4048 result = pow (rvalue (x), rvalue (y)); 3963 result = pow (rvalue (x), rvalue (y));
4049 3964
4050 /* Before returning integer result make sure we can. */ 3965 /* Before returning integer result make sure we can. */
4051 /* If the test fails, result is too big for integer. */ 3966 /* If the test fails, result is too big for integer. */
4052 if (!real_result) 3967 if (!real_result)
4053 { 3968 {
4054 long result_as_long = (long) result; 3969 long result_as_long = result;
4055 3970
4056 if (result != (RVALUE) result_as_long) 3971 if (result != (RVALUE) result_as_long)
4057 real_result = 1; 3972 real_result = 1;
4058 } 3973 }
4059 3974
… …
4061 s_return (mk_real (SCHEME_A_ result)); 3976 s_return (mk_real (SCHEME_A_ result));
4062 else 3977 else
4063 s_return (mk_integer (SCHEME_A_ result)); 3978 s_return (mk_integer (SCHEME_A_ result));
4064 } 3979 }
4065 3980
4066 case OP_FLOOR:
4067 x = car (SCHEME_V->args);
4068 s_return (mk_real (SCHEME_A_ floor (rvalue (x)))); 3981 case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x))));
4069
4070 case OP_CEILING:
4071 x = car (SCHEME_V->args);
4072 s_return (mk_real (SCHEME_A_ ceil (rvalue (x)))); 3982 case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x))));
4073 3983
4074 case OP_TRUNCATE: 3984 case OP_TRUNCATE:
4075 { 3985 {
4076 RVALUE rvalue_of_x; 3986 RVALUE rvalue_of_x;
4077 3987
4078 x = car (SCHEME_V->args);
4079 rvalue_of_x = rvalue (x); 3988 rvalue_of_x = rvalue (x);
4080 3989
4081 if (rvalue_of_x > 0) 3990 if (rvalue_of_x > 0)
4082 s_return (mk_real (SCHEME_A_ floor (rvalue_of_x))); 3991 s_return (mk_real (SCHEME_A_ floor (rvalue_of_x)));
4083 else 3992 else
4084 s_return (mk_real (SCHEME_A_ ceil (rvalue_of_x))); 3993 s_return (mk_real (SCHEME_A_ ceil (rvalue_of_x)));
4085 } 3994 }
4086 3995
4087 case OP_ROUND: 3996 case OP_ROUND:
4088 x = car (SCHEME_V->args);
4089
4090 if (num_is_integer (x)) 3997 if (num_is_integer (x))
4091 s_return (x); 3998 s_return (x);
4092 3999
4093 s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x)))); 4000 s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x))));
4094#endif 4001#endif
4095 4002
4096 case OP_ADD: /* + */ 4003 case OP_ADD: /* + */
4097 v = num_zero; 4004 v = num_zero;
4098 4005
4099 for (x = SCHEME_V->args; x != NIL; x = cdr (x)) 4006 for (x = args; x != NIL; x = cdr (x))
4100 v = num_add (v, nvalue (car (x))); 4007 v = num_op (NUM_ADD, v, nvalue (car (x)));
4101 4008
4102 s_return (mk_number (SCHEME_A_ v)); 4009 s_return (mk_number (SCHEME_A_ v));
4103 4010
4104 case OP_MUL: /* * */ 4011 case OP_MUL: /* * */
4105 v = num_one; 4012 v = num_one;
4106 4013
4107 for (x = SCHEME_V->args; x != NIL; x = cdr (x)) 4014 for (x = args; x != NIL; x = cdr (x))
4108 v = num_mul (v, nvalue (car (x))); 4015 v = num_op (NUM_MUL, v, nvalue (car (x)));
4109 4016
4110 s_return (mk_number (SCHEME_A_ v)); 4017 s_return (mk_number (SCHEME_A_ v));
4111 4018
4112 case OP_SUB: /* - */ 4019 case OP_SUB: /* - */
4113 if (cdr (SCHEME_V->args) == NIL) 4020 if (cdr (args) == NIL)
4114 { 4021 {
4115 x = SCHEME_V->args; 4022 x = args;
4116 v = num_zero; 4023 v = num_zero;
4117 } 4024 }
4118 else 4025 else
4119 { 4026 {
4120 x = cdr (SCHEME_V->args); 4027 x = cdr (args);
4121 v = nvalue (car (SCHEME_V->args)); 4028 v = nvalue (car (args));
4122 } 4029 }
4123 4030
4124 for (; x != NIL; x = cdr (x)) 4031 for (; x != NIL; x = cdr (x))
4125 v = num_sub (v, nvalue (car (x))); 4032 v = num_op (NUM_SUB, v, nvalue (car (x)));
4126 4033
4127 s_return (mk_number (SCHEME_A_ v)); 4034 s_return (mk_number (SCHEME_A_ v));
4128 4035
4129 case OP_DIV: /* / */ 4036 case OP_DIV: /* / */
4130 if (cdr (SCHEME_V->args) == NIL) 4037 if (cdr (args) == NIL)
4131 { 4038 {
4132 x = SCHEME_V->args; 4039 x = args;
4133 v = num_one; 4040 v = num_one;
4134 } 4041 }
4135 else 4042 else
4136 { 4043 {
4137 x = cdr (SCHEME_V->args); 4044 x = cdr (args);
4138 v = nvalue (car (SCHEME_V->args)); 4045 v = nvalue (car (args));
4139 } 4046 }
4140 4047
4141 for (; x != NIL; x = cdr (x)) 4048 for (; x != NIL; x = cdr (x))
4142 {
4143 if (!is_zero_rvalue (rvalue (car (x)))) 4049 if (!is_zero_rvalue (rvalue (car (x))))
4144 v = num_div (v, nvalue (car (x))); 4050 v = num_div (v, nvalue (car (x)));
4145 else 4051 else
4146 Error_0 ("/: division by zero"); 4052 Error_0 ("/: division by zero");
4147 }
4148 4053
4149 s_return (mk_number (SCHEME_A_ v)); 4054 s_return (mk_number (SCHEME_A_ v));
4150 4055
4151 case OP_INTDIV: /* quotient */ 4056 case OP_INTDIV: /* quotient */
4152 if (cdr (SCHEME_V->args) == NIL) 4057 if (cdr (args) == NIL)
4153 { 4058 {
4154 x = SCHEME_V->args; 4059 x = args;
4155 v = num_one; 4060 v = num_one;
4156 } 4061 }
4157 else 4062 else
4158 { 4063 {
4159 x = cdr (SCHEME_V->args); 4064 x = cdr (args);
4160 v = nvalue (car (SCHEME_V->args)); 4065 v = nvalue (car (args));
4161 } 4066 }
4162 4067
4163 for (; x != NIL; x = cdr (x)) 4068 for (; x != NIL; x = cdr (x))
4164 { 4069 {
4165 if (ivalue (car (x)) != 0) 4070 if (ivalue (car (x)) != 0)
4166 v = num_intdiv (v, nvalue (car (x))); 4071 v = num_op (NUM_INTDIV, v, nvalue (car (x)));
4167 else 4072 else
4168 Error_0 ("quotient: division by zero"); 4073 Error_0 ("quotient: division by zero");
4169 } 4074 }
4170 4075
4171 s_return (mk_number (SCHEME_A_ v)); 4076 s_return (mk_number (SCHEME_A_ v));
4172 4077
4173 case OP_REM: /* remainder */ 4078 case OP_REM: /* remainder */
4174 v = nvalue (car (SCHEME_V->args)); 4079 v = nvalue (x);
4175 4080
4176 if (ivalue (cadr (SCHEME_V->args)) != 0) 4081 if (ivalue (cadr (args)) != 0)
4177 v = num_rem (v, nvalue (cadr (SCHEME_V->args))); 4082 v = num_rem (v, nvalue (cadr (args)));
4178 else 4083 else
4179 Error_0 ("remainder: division by zero"); 4084 Error_0 ("remainder: division by zero");
4180 4085
4181 s_return (mk_number (SCHEME_A_ v)); 4086 s_return (mk_number (SCHEME_A_ v));
4182 4087
4183 case OP_MOD: /* modulo */ 4088 case OP_MOD: /* modulo */
4184 v = nvalue (car (SCHEME_V->args)); 4089 v = nvalue (x);
4185 4090
4186 if (ivalue (cadr (SCHEME_V->args)) != 0) 4091 if (ivalue (cadr (args)) != 0)
4187 v = num_mod (v, nvalue (cadr (SCHEME_V->args))); 4092 v = num_mod (v, nvalue (cadr (args)));
4188 else 4093 else
4189 Error_0 ("modulo: division by zero"); 4094 Error_0 ("modulo: division by zero");
4190 4095
4191 s_return (mk_number (SCHEME_A_ v)); 4096 s_return (mk_number (SCHEME_A_ v));
4192 4097
4193 case OP_CAR: /* car */ 4098 case OP_CAR: /* car */
4194 s_return (caar (SCHEME_V->args)); 4099 s_return (caar (args));
4195 4100
4196 case OP_CDR: /* cdr */ 4101 case OP_CDR: /* cdr */
4197 s_return (cdar (SCHEME_V->args)); 4102 s_return (cdar (args));
4198 4103
4199 case OP_CONS: /* cons */ 4104 case OP_CONS: /* cons */
4200 set_cdr (SCHEME_V->args, cadr (SCHEME_V->args)); 4105 set_cdr (args, cadr (args));
4201 s_return (SCHEME_V->args); 4106 s_return (args);
4202 4107
4203 case OP_SETCAR: /* set-car! */ 4108 case OP_SETCAR: /* set-car! */
4204 if (!is_immutable (car (SCHEME_V->args))) 4109 if (!is_immutable (x))
4205 { 4110 {
4206 set_car (car (SCHEME_V->args), cadr (SCHEME_V->args)); 4111 set_car (x, cadr (args));
4207 s_return (car (SCHEME_V->args)); 4112 s_return (car (args));
4208 } 4113 }
4209 else 4114 else
4210 Error_0 ("set-car!: unable to alter immutable pair"); 4115 Error_0 ("set-car!: unable to alter immutable pair");
4211 4116
4212 case OP_SETCDR: /* set-cdr! */ 4117 case OP_SETCDR: /* set-cdr! */
4213 if (!is_immutable (car (SCHEME_V->args))) 4118 if (!is_immutable (x))
4214 { 4119 {
4215 set_cdr (car (SCHEME_V->args), cadr (SCHEME_V->args)); 4120 set_cdr (x, cadr (args));
4216 s_return (car (SCHEME_V->args)); 4121 s_return (car (args));
4217 } 4122 }
4218 else 4123 else
4219 Error_0 ("set-cdr!: unable to alter immutable pair"); 4124 Error_0 ("set-cdr!: unable to alter immutable pair");
4220 4125
4221 case OP_CHAR2INT: /* char->integer */ 4126 case OP_CHAR2INT: /* char->integer */
4222 s_return (mk_integer (SCHEME_A_ ivalue (car (SCHEME_V->args)))); 4127 s_return (mk_integer (SCHEME_A_ ivalue (x)));
4223 4128
4224 case OP_INT2CHAR: /* integer->char */ 4129 case OP_INT2CHAR: /* integer->char */
4225 s_return (mk_character (SCHEME_A_ ivalue (car (SCHEME_V->args)))); 4130 s_return (mk_character (SCHEME_A_ ivalue (x)));
4226 4131
4227 case OP_CHARUPCASE: 4132 case OP_CHARUPCASE:
4228 { 4133 {
4229 unsigned char c = ivalue (car (SCHEME_V->args)); 4134 unsigned char c = ivalue (x);
4230 c = toupper (c); 4135 c = toupper (c);
4231 s_return (mk_character (SCHEME_A_ c)); 4136 s_return (mk_character (SCHEME_A_ c));
4232 } 4137 }
4233 4138
4234 case OP_CHARDNCASE: 4139 case OP_CHARDNCASE:
4235 { 4140 {
4236 unsigned char c = ivalue (car (SCHEME_V->args)); 4141 unsigned char c = ivalue (x);
4237 c = tolower (c); 4142 c = tolower (c);
4238 s_return (mk_character (SCHEME_A_ c)); 4143 s_return (mk_character (SCHEME_A_ c));
4239 } 4144 }
4240 4145
4241 case OP_STR2SYM: /* string->symbol */ 4146 case OP_STR2SYM: /* string->symbol */
4242 s_return (mk_symbol (SCHEME_A_ strvalue (car (SCHEME_V->args)))); 4147 s_return (mk_symbol (SCHEME_A_ strvalue (x)));
4243 4148
4244 case OP_STR2ATOM: /* string->atom */ 4149 case OP_STR2ATOM: /* string->atom */
4245 { 4150 {
4246 char *s = strvalue (car (SCHEME_V->args)); 4151 char *s = strvalue (x);
4247 long pf = 0; 4152 long pf = 0;
4248 4153
4249 if (cdr (SCHEME_V->args) != NIL) 4154 if (cdr (args) != NIL)
4250 { 4155 {
4251 /* we know cadr(SCHEME_V->args) is a natural number */ 4156 /* we know cadr(args) is a natural number */
4252 /* see if it is 2, 8, 10, or 16, or error */ 4157 /* see if it is 2, 8, 10, or 16, or error */
4253 pf = ivalue_unchecked (cadr (SCHEME_V->args)); 4158 pf = ivalue_unchecked (cadr (args));
4254 4159
4255 if (pf == 16 || pf == 10 || pf == 8 || pf == 2) 4160 if (pf == 16 || pf == 10 || pf == 8 || pf == 2)
4256 { 4161 {
4257 /* base is OK */ 4162 /* base is OK */
4258 } 4163 }
4259 else 4164 else
4260 pf = -1; 4165 pf = -1;
4261 } 4166 }
4262 4167
4263 if (pf < 0) 4168 if (pf < 0)
4264 Error_1 ("string->atom: bad base:", cadr (SCHEME_V->args)); 4169 Error_1 ("string->atom: bad base:", cadr (args));
4265 else if (*s == '#') /* no use of base! */ 4170 else if (*s == '#') /* no use of base! */
4266 s_return (mk_sharp_const (SCHEME_A_ s + 1)); 4171 s_return (mk_sharp_const (SCHEME_A_ s + 1));
4267 else 4172 else
4268 { 4173 {
4269 if (pf == 0 || pf == 10) 4174 if (pf == 0 || pf == 10)
… …
4280 } 4185 }
4281 } 4186 }
4282 } 4187 }
4283 4188
4284 case OP_SYM2STR: /* symbol->string */ 4189 case OP_SYM2STR: /* symbol->string */
4285 x = mk_string (SCHEME_A_ symname (car (SCHEME_V->args))); 4190 x = mk_string (SCHEME_A_ symname (x));
4286 setimmutable (x); 4191 setimmutable (x);
4287 s_return (x); 4192 s_return (x);
4288 4193
4289 case OP_ATOM2STR: /* atom->string */ 4194 case OP_ATOM2STR: /* atom->string */
4290 { 4195 {
4291 long pf = 0; 4196 long pf = 0;
4292 4197
4293 x = car (SCHEME_V->args);
4294
4295 if (cdr (SCHEME_V->args) != NIL) 4198 if (cdr (args) != NIL)
4296 { 4199 {
4297 /* we know cadr(SCHEME_V->args) is a natural number */ 4200 /* we know cadr(args) is a natural number */
4298 /* see if it is 2, 8, 10, or 16, or error */ 4201 /* see if it is 2, 8, 10, or 16, or error */
4299 pf = ivalue_unchecked (cadr (SCHEME_V->args)); 4202 pf = ivalue_unchecked (cadr (args));
4300 4203
4301 if (is_number (x) && (pf == 16 || pf == 10 || pf == 8 || pf == 2)) 4204 if (is_number (x) && (pf == 16 || pf == 10 || pf == 8 || pf == 2))
4302 { 4205 {
4303 /* base is OK */ 4206 /* base is OK */
4304 } 4207 }
4305 else 4208 else
4306 pf = -1; 4209 pf = -1;
4307 } 4210 }
4308 4211
4309 if (pf < 0) 4212 if (pf < 0)
4310 Error_1 ("atom->string: bad base:", cadr (SCHEME_V->args)); 4213 Error_1 ("atom->string: bad base:", cadr (args));
4311 else if (is_number (x) || is_character (x) || is_string (x) || is_symbol (x)) 4214 else if (is_number (x) || is_character (x) || is_string (x) || is_symbol (x))
4312 { 4215 {
4313 char *p; 4216 char *p;
4314 int len; 4217 int len;
4315 4218
… …
4323 case OP_MKSTRING: /* make-string */ 4226 case OP_MKSTRING: /* make-string */
4324 { 4227 {
4325 int fill = ' '; 4228 int fill = ' ';
4326 int len; 4229 int len;
4327 4230
4328 len = ivalue (car (SCHEME_V->args)); 4231 len = ivalue (x);
4329 4232
4330 if (cdr (SCHEME_V->args) != NIL) 4233 if (cdr (args) != NIL)
4331 fill = charvalue (cadr (SCHEME_V->args)); 4234 fill = charvalue (cadr (args));
4332 4235
4333 s_return (mk_empty_string (SCHEME_A_ len, (char) fill)); 4236 s_return (mk_empty_string (SCHEME_A_ len, fill));
4334 } 4237 }
4335 4238
4336 case OP_STRLEN: /* string-length */ 4239 case OP_STRLEN: /* string-length */
4337 s_return (mk_integer (SCHEME_A_ strlength (car (SCHEME_V->args)))); 4240 s_return (mk_integer (SCHEME_A_ strlength (x)));
4338 4241
4339 case OP_STRREF: /* string-ref */ 4242 case OP_STRREF: /* string-ref */
4340 { 4243 {
4341 char *str; 4244 char *str;
4342 int index; 4245 int index;
4343 4246
4344 str = strvalue (car (SCHEME_V->args)); 4247 str = strvalue (x);
4345 4248
4346 index = ivalue (cadr (SCHEME_V->args)); 4249 index = ivalue (cadr (args));
4347 4250
4348 if (index >= strlength (car (SCHEME_V->args))) 4251 if (index >= strlength (x))
4349 Error_1 ("string-ref: out of bounds:", cadr (SCHEME_V->args)); 4252 Error_1 ("string-ref: out of bounds:", cadr (args));
4350 4253
4351 s_return (mk_character (SCHEME_A_ ((unsigned char *) str)[index])); 4254 s_return (mk_character (SCHEME_A_ ((unsigned char *)str)[index]));
4352 } 4255 }
4353 4256
4354 case OP_STRSET: /* string-set! */ 4257 case OP_STRSET: /* string-set! */
4355 { 4258 {
4356 char *str; 4259 char *str;
4357 int index; 4260 int index;
4358 int c; 4261 int c;
4359 4262
4360 if (is_immutable (car (SCHEME_V->args))) 4263 if (is_immutable (x))
4361 Error_1 ("string-set!: unable to alter immutable string:", car (SCHEME_V->args)); 4264 Error_1 ("string-set!: unable to alter immutable string:", x);
4362 4265
4363 str = strvalue (car (SCHEME_V->args)); 4266 str = strvalue (x);
4364 4267
4365 index = ivalue (cadr (SCHEME_V->args)); 4268 index = ivalue (cadr (args));
4366 4269
4367 if (index >= strlength (car (SCHEME_V->args))) 4270 if (index >= strlength (x))
4368 Error_1 ("string-set!: out of bounds:", cadr (SCHEME_V->args)); 4271 Error_1 ("string-set!: out of bounds:", cadr (args));
4369 4272
4370 c = charvalue (caddr (SCHEME_V->args)); 4273 c = charvalue (caddr (args));
4371 4274
4372 str[index] = (char) c; 4275 str[index] = c;
4373 s_return (car (SCHEME_V->args)); 4276 s_return (car (args));
4374 } 4277 }
4375 4278
4376 case OP_STRAPPEND: /* string-append */ 4279 case OP_STRAPPEND: /* string-append */
4377 { 4280 {
4378 /* in 1.29 string-append was in Scheme in init.scm but was too slow */ 4281 /* in 1.29 string-append was in Scheme in init.scm but was too slow */
4379 int len = 0; 4282 int len = 0;
4380 pointer newstr; 4283 pointer newstr;
4381 char *pos; 4284 char *pos;
4382 4285
4383 /* compute needed length for new string */ 4286 /* compute needed length for new string */
4384 for (x = SCHEME_V->args; x != NIL; x = cdr (x)) 4287 for (x = args; x != NIL; x = cdr (x))
4385 len += strlength (car (x)); 4288 len += strlength (car (x));
4386 4289
4387 newstr = mk_empty_string (SCHEME_A_ len, ' '); 4290 newstr = mk_empty_string (SCHEME_A_ len, ' ');
4388 4291
4389 /* store the contents of the argument strings into the new string */ 4292 /* store the contents of the argument strings into the new string */
4390 for (pos = strvalue (newstr), x = SCHEME_V->args; x != NIL; pos += strlength (car (x)), x = cdr (x)) 4293 for (pos = strvalue (newstr), x = args; x != NIL; pos += strlength (car (x)), x = cdr (x))
4391 memcpy (pos, strvalue (car (x)), strlength (car (x))); 4294 memcpy (pos, strvalue (car (x)), strlength (car (x)));
4392 4295
4393 s_return (newstr); 4296 s_return (newstr);
4394 } 4297 }
4395 4298
… …
4398 char *str; 4301 char *str;
4399 int index0; 4302 int index0;
4400 int index1; 4303 int index1;
4401 int len; 4304 int len;
4402 4305
4403 str = strvalue (car (SCHEME_V->args)); 4306 str = strvalue (x);
4404 4307
4405 index0 = ivalue (cadr (SCHEME_V->args)); 4308 index0 = ivalue (cadr (args));
4406 4309
4407 if (index0 > strlength (car (SCHEME_V->args))) 4310 if (index0 > strlength (x))
4408 Error_1 ("substring: start out of bounds:", cadr (SCHEME_V->args)); 4311 Error_1 ("substring: start out of bounds:", cadr (args));
4409 4312
4410 if (cddr (SCHEME_V->args) != NIL) 4313 if (cddr (args) != NIL)
4411 { 4314 {
4412 index1 = ivalue (caddr (SCHEME_V->args)); 4315 index1 = ivalue (caddr (args));
4413 4316
4414 if (index1 > strlength (car (SCHEME_V->args)) || index1 < index0) 4317 if (index1 > strlength (x) || index1 < index0)
4415 Error_1 ("substring: end out of bounds:", caddr (SCHEME_V->args)); 4318 Error_1 ("substring: end out of bounds:", caddr (args));
4416 } 4319 }
4417 else 4320 else
4418 index1 = strlength (car (SCHEME_V->args)); 4321 index1 = strlength (x);
4419 4322
4420 len = index1 - index0; 4323 len = index1 - index0;
4421 x = mk_empty_string (SCHEME_A_ len, ' '); 4324 x = mk_empty_string (SCHEME_A_ len, ' ');
4422 memcpy (strvalue (x), str + index0, len); 4325 memcpy (strvalue (x), str + index0, len);
4423 strvalue (x)[len] = 0; 4326 strvalue (x)[len] = 0;
… …
4427 4330
4428 case OP_VECTOR: /* vector */ 4331 case OP_VECTOR: /* vector */
4429 { 4332 {
4430 int i; 4333 int i;
4431 pointer vec; 4334 pointer vec;
4432 int len = list_length (SCHEME_A_ SCHEME_V->args); 4335 int len = list_length (SCHEME_A_ args);
4433 4336
4434 if (len < 0) 4337 if (len < 0)
4435 Error_1 ("vector: not a proper list:", SCHEME_V->args); 4338 Error_1 ("vector: not a proper list:", args);
4436 4339
4437 vec = mk_vector (SCHEME_A_ len); 4340 vec = mk_vector (SCHEME_A_ len);
4438 4341
4439#if USE_ERROR_CHECKING 4342#if USE_ERROR_CHECKING
4440 if (SCHEME_V->no_memory) 4343 if (SCHEME_V->no_memory)
4441 s_return (S_SINK); 4344 s_return (S_SINK);
4442#endif 4345#endif
4443 4346
4444 for (x = SCHEME_V->args, i = 0; is_pair (x); x = cdr (x), i++) 4347 for (x = args, i = 0; is_pair (x); x = cdr (x), i++)
4445 set_vector_elem (vec, i, car (x)); 4348 set_vector_elem (vec, i, car (x));
4446 4349
4447 s_return (vec); 4350 s_return (vec);
4448 } 4351 }
4449 4352
… …
4451 { 4354 {
4452 pointer fill = NIL; 4355 pointer fill = NIL;
4453 int len; 4356 int len;
4454 pointer vec; 4357 pointer vec;
4455 4358
4456 len = ivalue (car (SCHEME_V->args)); 4359 len = ivalue (x);
4457 4360
4458 if (cdr (SCHEME_V->args) != NIL) 4361 if (cdr (args) != NIL)
4459 fill = cadr (SCHEME_V->args); 4362 fill = cadr (args);
4460 4363
4461 vec = mk_vector (SCHEME_A_ len); 4364 vec = mk_vector (SCHEME_A_ len);
4462 4365
4463#if USE_ERROR_CHECKING 4366#if USE_ERROR_CHECKING
4464 if (SCHEME_V->no_memory) 4367 if (SCHEME_V->no_memory)
… …
4470 4373
4471 s_return (vec); 4374 s_return (vec);
4472 } 4375 }
4473 4376
4474 case OP_VECLEN: /* vector-length */ 4377 case OP_VECLEN: /* vector-length */
4475 s_return (mk_integer (SCHEME_A_ veclength (car (SCHEME_V->args)))); 4378 s_return (mk_integer (SCHEME_A_ veclength (x)));
4476 4379
4477 case OP_VECREF: /* vector-ref */ 4380 case OP_VECREF: /* vector-ref */
4478 { 4381 {
4479 int index; 4382 int index;
4480 4383
4481 index = ivalue (cadr (SCHEME_V->args)); 4384 index = ivalue (cadr (args));
4482 4385
4483 if (index >= veclength (car (SCHEME_V->args)) && USE_ERROR_CHECKING) 4386 if (index >= veclength (car (args)) && USE_ERROR_CHECKING)
4484 Error_1 ("vector-ref: out of bounds:", cadr (SCHEME_V->args)); 4387 Error_1 ("vector-ref: out of bounds:", cadr (args));
4485 4388
4486 s_return (vector_elem (car (SCHEME_V->args), index)); 4389 s_return (vector_elem (x, index));
4487 } 4390 }
4488 4391
4489 case OP_VECSET: /* vector-set! */ 4392 case OP_VECSET: /* vector-set! */
4490 { 4393 {
4491 int index; 4394 int index;
4492 4395
4493 if (is_immutable (car (SCHEME_V->args))) 4396 if (is_immutable (x))
4494 Error_1 ("vector-set!: unable to alter immutable vector:", car (SCHEME_V->args)); 4397 Error_1 ("vector-set!: unable to alter immutable vector:", x);
4495 4398
4496 index = ivalue (cadr (SCHEME_V->args)); 4399 index = ivalue (cadr (args));
4497 4400
4498 if (index >= veclength (car (SCHEME_V->args)) && USE_ERROR_CHECKING) 4401 if (index >= veclength (car (args)) && USE_ERROR_CHECKING)
4499 Error_1 ("vector-set!: out of bounds:", cadr (SCHEME_V->args)); 4402 Error_1 ("vector-set!: out of bounds:", cadr (args));
4500 4403
4501 set_vector_elem (car (SCHEME_V->args), index, caddr (SCHEME_V->args)); 4404 set_vector_elem (x, index, caddr (args));
4502 s_return (car (SCHEME_V->args)); 4405 s_return (x);
4503 } 4406 }
4504 } 4407 }
4505 4408
4506 return S_T; 4409 if (USE_ERROR_CHECKING) abort ();
4507} 4410}
4508 4411
4509INTERFACE int 4412INTERFACE int
4510is_list (SCHEME_P_ pointer a) 4413is_list (SCHEME_P_ pointer a)
4511{ 4414{
… …
4558 return -1; 4461 return -1;
4559 } 4462 }
4560 } 4463 }
4561} 4464}
4562 4465
4563static pointer 4466static int
4467opexe_2 (SCHEME_P_ enum scheme_opcodes op)
4468{
4469 pointer x = SCHEME_V->args;
4470
4471 for (;;)
4472 {
4473 num v = nvalue (car (x));
4474 x = cdr (x);
4475
4476 if (x == NIL)
4477 break;
4478
4479 int r = num_cmp (v, nvalue (car (x)));
4480
4481 switch (op)
4482 {
4483 case OP_NUMEQ: r = r == 0; break;
4484 case OP_LESS: r = r < 0; break;
4485 case OP_GRE: r = r > 0; break;
4486 case OP_LEQ: r = r <= 0; break;
4487 case OP_GEQ: r = r >= 0; break;
4488 }
4489
4490 if (!r)
4491 s_return (S_F);
4492 }
4493
4494 s_return (S_T);
4495}
4496
4497static int
4564opexe_3 (SCHEME_P_ enum scheme_opcodes op) 4498opexe_3 (SCHEME_P_ enum scheme_opcodes op)
4565{ 4499{
4566 pointer x; 4500 pointer args = SCHEME_V->args;
4567 num v; 4501 pointer a = car (args);
4568 int (*comp_func) (num, num); 4502 pointer d = cdr (args);
4503 int r;
4569 4504
4570 switch (op) 4505 switch (op)
4571 { 4506 {
4572 case OP_NOT: /* not */ 4507 case OP_NOT: /* not */ r = is_false (a) ; break;
4573 s_retbool (is_false (car (SCHEME_V->args))); 4508 case OP_BOOLP: /* boolean? */ r = a == S_F || a == S_T; break;
4509 case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break;
4510 case OP_NULLP: /* null? */ r = a == NIL ; break;
4511 case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break;
4512 case OP_NUMBERP: /* number? */ r = is_number (a) ; break;
4513 case OP_STRINGP: /* string? */ r = is_string (a) ; break;
4514 case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break;
4515 case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */
4516 case OP_CHARP: /* char? */ r = is_character (a) ; break;
4574 4517
4575 case OP_BOOLP: /* boolean? */
4576 s_retbool (car (SCHEME_V->args) == S_F || car (SCHEME_V->args) == S_T);
4577
4578 case OP_EOFOBJP: /* boolean? */
4579 s_retbool (car (SCHEME_V->args) == S_EOF);
4580
4581 case OP_NULLP: /* null? */
4582 s_retbool (car (SCHEME_V->args) == NIL);
4583
4584 case OP_NUMEQ: /* = */
4585 case OP_LESS: /* < */
4586 case OP_GRE: /* > */
4587 case OP_LEQ: /* <= */
4588 case OP_GEQ: /* >= */
4589 switch (op)
4590 {
4591 case OP_NUMEQ:
4592 comp_func = num_eq;
4593 break;
4594
4595 case OP_LESS:
4596 comp_func = num_lt;
4597 break;
4598
4599 case OP_GRE:
4600 comp_func = num_gt;
4601 break;
4602
4603 case OP_LEQ:
4604 comp_func = num_le;
4605 break;
4606
4607 case OP_GEQ:
4608 comp_func = num_ge;
4609 break;
4610 }
4611
4612 x = SCHEME_V->args;
4613 v = nvalue (car (x));
4614 x = cdr (x);
4615
4616 for (; x != NIL; x = cdr (x))
4617 {
4618 if (!comp_func (v, nvalue (car (x))))
4619 s_retbool (0);
4620
4621 v = nvalue (car (x));
4622 }
4623
4624 s_retbool (1);
4625
4626 case OP_SYMBOLP: /* symbol? */
4627 s_retbool (is_symbol (car (SCHEME_V->args)));
4628
4629 case OP_NUMBERP: /* number? */
4630 s_retbool (is_number (car (SCHEME_V->args)));
4631
4632 case OP_STRINGP: /* string? */
4633 s_retbool (is_string (car (SCHEME_V->args)));
4634
4635 case OP_INTEGERP: /* integer? */
4636 s_retbool (is_integer (car (SCHEME_V->args)));
4637
4638 case OP_REALP: /* real? */
4639 s_retbool (is_number (car (SCHEME_V->args))); /* All numbers are real */
4640
4641 case OP_CHARP: /* char? */
4642 s_retbool (is_character (car (SCHEME_V->args)));
4643#if USE_CHAR_CLASSIFIERS 4518#if USE_CHAR_CLASSIFIERS
4644
4645 case OP_CHARAP: /* char-alphabetic? */ 4519 case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue (a)); break;
4646 s_retbool (Cisalpha (ivalue (car (SCHEME_V->args)))); 4520 case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue (a)); break;
4647
4648 case OP_CHARNP: /* char-numeric? */
4649 s_retbool (Cisdigit (ivalue (car (SCHEME_V->args))));
4650
4651 case OP_CHARWP: /* char-whitespace? */ 4521 case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue (a)); break;
4652 s_retbool (Cisspace (ivalue (car (SCHEME_V->args))));
4653
4654 case OP_CHARUP: /* char-upper-case? */ 4522 case OP_CHARUP: /* char-upper-case? */ r = Cisupper (ivalue (a)); break;
4655 s_retbool (Cisupper (ivalue (car (SCHEME_V->args))));
4656
4657 case OP_CHARLP: /* char-lower-case? */ 4523 case OP_CHARLP: /* char-lower-case? */ r = Cislower (ivalue (a)); break;
4658 s_retbool (Cislower (ivalue (car (SCHEME_V->args))));
4659#endif 4524#endif
4525
4660#if USE_PORTS 4526#if USE_PORTS
4661 4527 case OP_PORTP: /* port? */ r = is_port (a) ; break;
4662 case OP_PORTP: /* port? */
4663 s_retbool (is_port (car (SCHEME_V->args)));
4664
4665 case OP_INPORTP: /* input-port? */ 4528 case OP_INPORTP: /* input-port? */ r = is_inport (a) ; break;
4666 s_retbool (is_inport (car (SCHEME_V->args)));
4667
4668 case OP_OUTPORTP: /* output-port? */ 4529 case OP_OUTPORTP: /* output-port? */ r = is_outport (a); break;
4669 s_retbool (is_outport (car (SCHEME_V->args)));
4670#endif 4530#endif
4671 4531
4672 case OP_PROCP: /* procedure? */ 4532 case OP_PROCP: /* procedure? */
4673 4533
4674 /*-- 4534 /*--
4675 * continuation should be procedure by the example 4535 * continuation should be procedure by the example
4676 * (call-with-current-continuation procedure?) ==> #t 4536 * (call-with-current-continuation procedure?) ==> #t
4677 * in R^3 report sec. 6.9 4537 * in R^3 report sec. 6.9
4678 */ 4538 */
4679 s_retbool (is_proc (car (SCHEME_V->args)) || is_closure (car (SCHEME_V->args)) 4539 r = is_proc (a) || is_closure (a) || is_continuation (a) || is_foreign (a);
4680 || is_continuation (car (SCHEME_V->args)) || is_foreign (car (SCHEME_V->args))); 4540 break;
4681 4541
4682 case OP_PAIRP: /* pair? */ 4542 case OP_PAIRP: /* pair? */ r = is_pair (a) ; break;
4683 s_retbool (is_pair (car (SCHEME_V->args))); 4543 case OP_LISTP: /* list? */ r = list_length (SCHEME_A_ a) >= 0; break;
4684 4544 case OP_ENVP: /* environment? */ r = is_environment (a) ; break;
4685 case OP_LISTP: /* list? */ 4545 case OP_VECTORP: /* vector? */ r = is_vector (a) ; break;
4686 s_retbool (list_length (SCHEME_A_ car (SCHEME_V->args)) >= 0); 4546 case OP_EQ: /* eq? */ r = a == cadr (args) ; break;
4687 4547 case OP_EQV: /* eqv? */ r = eqv (a, cadr (args)) ; break;
4688 case OP_ENVP: /* environment? */
4689 s_retbool (is_environment (car (SCHEME_V->args)));
4690
4691 case OP_VECTORP: /* vector? */
4692 s_retbool (is_vector (car (SCHEME_V->args)));
4693
4694 case OP_EQ: /* eq? */
4695 s_retbool (car (SCHEME_V->args) == cadr (SCHEME_V->args));
4696
4697 case OP_EQV: /* eqv? */
4698 s_retbool (eqv (car (SCHEME_V->args), cadr (SCHEME_V->args)));
4699 } 4548 }
4700 4549
4701 return S_T; 4550 s_retbool (r);
4702} 4551}
4703 4552
4704static pointer 4553static int
4705opexe_4 (SCHEME_P_ enum scheme_opcodes op) 4554opexe_4 (SCHEME_P_ enum scheme_opcodes op)
4706{ 4555{
4556 pointer args = SCHEME_V->args;
4557 pointer a = car (args);
4707 pointer x, y; 4558 pointer x, y;
4708 4559
4709 switch (op) 4560 switch (op)
4710 { 4561 {
4711 case OP_FORCE: /* force */ 4562 case OP_FORCE: /* force */
4712 SCHEME_V->code = car (SCHEME_V->args); 4563 SCHEME_V->code = a;
4713 4564
4714 if (is_promise (SCHEME_V->code)) 4565 if (is_promise (SCHEME_V->code))
4715 { 4566 {
4716 /* Should change type to closure here */ 4567 /* Should change type to closure here */
4717 s_save (SCHEME_A_ OP_SAVE_FORCED, NIL, SCHEME_V->code); 4568 s_save (SCHEME_A_ OP_SAVE_FORCED, NIL, SCHEME_V->code);
… …
4738 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL); 4589 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL);
4739 SCHEME_V->outport = cadr (SCHEME_V->args); 4590 SCHEME_V->outport = cadr (SCHEME_V->args);
4740 } 4591 }
4741 } 4592 }
4742 4593
4743 SCHEME_V->args = car (SCHEME_V->args); 4594 SCHEME_V->args = a;
4744 4595
4745 if (op == OP_WRITE) 4596 if (op == OP_WRITE)
4746 SCHEME_V->print_flag = 1; 4597 SCHEME_V->print_flag = 1;
4747 else 4598 else
4748 SCHEME_V->print_flag = 0; 4599 SCHEME_V->print_flag = 0;
4749 4600
4750 s_goto (OP_P0LIST); 4601 s_goto (OP_P0LIST);
4751 4602
4752 case OP_NEWLINE: /* newline */ 4603 case OP_NEWLINE: /* newline */
4753 if (is_pair (SCHEME_V->args)) 4604 if (is_pair (args))
4754 { 4605 {
4755 if (car (SCHEME_V->args) != SCHEME_V->outport) 4606 if (a != SCHEME_V->outport)
4756 { 4607 {
4757 x = cons (SCHEME_V->outport, NIL); 4608 x = cons (SCHEME_V->outport, NIL);
4758 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL); 4609 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL);
4759 SCHEME_V->outport = car (SCHEME_V->args); 4610 SCHEME_V->outport = a;
4760 } 4611 }
4761 } 4612 }
4762 4613
4763 putstr (SCHEME_A_ "\n"); 4614 putstr (SCHEME_A_ "\n");
4764 s_return (S_T); 4615 s_return (S_T);
4765#endif 4616#endif
4766 4617
4767 case OP_ERR0: /* error */ 4618 case OP_ERR0: /* error */
4768 SCHEME_V->retcode = -1; 4619 SCHEME_V->retcode = -1;
4769 4620
4770 if (!is_string (car (SCHEME_V->args))) 4621 if (!is_string (a))
4771 { 4622 {
4772 SCHEME_V->args = cons (mk_string (SCHEME_A_ " -- "), SCHEME_V->args); 4623 args = cons (mk_string (SCHEME_A_ " -- "), args);
4773 setimmutable (car (SCHEME_V->args)); 4624 setimmutable (car (args));
4774 } 4625 }
4775 4626
4776 putstr (SCHEME_A_ "Error: "); 4627 putstr (SCHEME_A_ "Error: ");
4777 putstr (SCHEME_A_ strvalue (car (SCHEME_V->args))); 4628 putstr (SCHEME_A_ strvalue (car (args)));
4778 SCHEME_V->args = cdr (SCHEME_V->args); 4629 SCHEME_V->args = cdr (args);
4779 s_goto (OP_ERR1); 4630 s_goto (OP_ERR1);
4780 4631
4781 case OP_ERR1: /* error */ 4632 case OP_ERR1: /* error */
4782 putstr (SCHEME_A_ " "); 4633 putstr (SCHEME_A_ " ");
4783 4634
4784 if (SCHEME_V->args != NIL) 4635 if (args != NIL)
4785 { 4636 {
4786 s_save (SCHEME_A_ OP_ERR1, cdr (SCHEME_V->args), NIL); 4637 s_save (SCHEME_A_ OP_ERR1, cdr (args), NIL);
4787 SCHEME_V->args = car (SCHEME_V->args); 4638 SCHEME_V->args = a;
4788 SCHEME_V->print_flag = 1; 4639 SCHEME_V->print_flag = 1;
4789 s_goto (OP_P0LIST); 4640 s_goto (OP_P0LIST);
4790 } 4641 }
4791 else 4642 else
4792 { 4643 {
4793 putstr (SCHEME_A_ "\n"); 4644 putstr (SCHEME_A_ "\n");
4794 4645
4795 if (SCHEME_V->interactive_repl) 4646 if (SCHEME_V->interactive_repl)
4796 s_goto (OP_T0LVL); 4647 s_goto (OP_T0LVL);
4797 else 4648 else
4798 return NIL; 4649 return -1;
4799 } 4650 }
4800 4651
4801 case OP_REVERSE: /* reverse */ 4652 case OP_REVERSE: /* reverse */
4802 s_return (reverse (SCHEME_A_ car (SCHEME_V->args))); 4653 s_return (reverse (SCHEME_A_ a));
4803 4654
4804 case OP_LIST_STAR: /* list* */ 4655 case OP_LIST_STAR: /* list* */
4805 s_return (list_star (SCHEME_A_ SCHEME_V->args)); 4656 s_return (list_star (SCHEME_A_ SCHEME_V->args));
4806 4657
4807 case OP_APPEND: /* append */ 4658 case OP_APPEND: /* append */
4808 x = NIL; 4659 x = NIL;
4809 y = SCHEME_V->args; 4660 y = args;
4810 4661
4811 if (y == x) 4662 if (y == x)
4812 s_return (x); 4663 s_return (x);
4813 4664
4814 /* cdr() in the while condition is not a typo. If car() */ 4665 /* cdr() in the while condition is not a typo. If car() */
… …
4825 s_return (reverse_in_place (SCHEME_A_ car (y), x)); 4676 s_return (reverse_in_place (SCHEME_A_ car (y), x));
4826 4677
4827#if USE_PLIST 4678#if USE_PLIST
4828 4679
4829 case OP_PUT: /* put */ 4680 case OP_PUT: /* put */
4830 if (!hasprop (car (SCHEME_V->args)) || !hasprop (cadr (SCHEME_V->args))) 4681 if (!hasprop (a) || !hasprop (cadr (args)))
4831 Error_0 ("illegal use of put"); 4682 Error_0 ("illegal use of put");
4832 4683
4833 for (x = symprop (car (SCHEME_V->args)), y = cadr (SCHEME_V->args); x != NIL; x = cdr (x)) 4684 for (x = symprop (a), y = cadr (args); x != NIL; x = cdr (x))
4834 { 4685 {
4835 if (caar (x) == y) 4686 if (caar (x) == y)
4836 break; 4687 break;
4837 } 4688 }
4838 4689
4839 if (x != NIL) 4690 if (x != NIL)
4840 cdar (x) = caddr (SCHEME_V->args); 4691 cdar (x) = caddr (args);
4841 else 4692 else
4842 symprop (car (SCHEME_V->args)) = cons (cons (y, caddr (SCHEME_V->args)), symprop (car (SCHEME_V->args))); 4693 symprop (a) = cons (cons (y, caddr (args)), symprop (a));
4843 4694
4844 s_return (S_T); 4695 s_return (S_T);
4845 4696
4846 case OP_GET: /* get */ 4697 case OP_GET: /* get */
4847 if (!hasprop (car (SCHEME_V->args)) || !hasprop (cadr (SCHEME_V->args))) 4698 if (!hasprop (a) || !hasprop (cadr (args)))
4848 Error_0 ("illegal use of get"); 4699 Error_0 ("illegal use of get");
4849 4700
4850 for (x = symprop (car (SCHEME_V->args)), y = cadr (SCHEME_V->args); x != NIL; x = cdr (x)) 4701 for (x = symprop (a), y = cadr (args); x != NIL; x = cdr (x))
4851 if (caar (x) == y) 4702 if (caar (x) == y)
4852 break; 4703 break;
4853 4704
4854 if (x != NIL) 4705 if (x != NIL)
4855 s_return (cdar (x)); 4706 s_return (cdar (x));
… …
4857 s_return (NIL); 4708 s_return (NIL);
4858 4709
4859#endif /* USE_PLIST */ 4710#endif /* USE_PLIST */
4860 4711
4861 case OP_QUIT: /* quit */ 4712 case OP_QUIT: /* quit */
4862 if (is_pair (SCHEME_V->args)) 4713 if (is_pair (args))
4863 SCHEME_V->retcode = ivalue (car (SCHEME_V->args)); 4714 SCHEME_V->retcode = ivalue (a);
4864 4715
4865 return NIL; 4716 return -1;
4866 4717
4867 case OP_GC: /* gc */ 4718 case OP_GC: /* gc */
4868 gc (SCHEME_A_ NIL, NIL); 4719 gc (SCHEME_A_ NIL, NIL);
4869 s_return (S_T); 4720 s_return (S_T);
4870 4721
4871 case OP_GCVERB: /* gc-verbose */ 4722 case OP_GCVERB: /* gc-verbose */
4872 { 4723 {
4873 int was = SCHEME_V->gc_verbose; 4724 int was = SCHEME_V->gc_verbose;
4874 4725
4875 SCHEME_V->gc_verbose = (car (SCHEME_V->args) != S_F); 4726 SCHEME_V->gc_verbose = (a != S_F);
4876 s_retbool (was); 4727 s_retbool (was);
4877 } 4728 }
4878 4729
4879 case OP_NEWSEGMENT: /* new-segment */ 4730 case OP_NEWSEGMENT: /* new-segment */
4880 if (!is_pair (SCHEME_V->args) || !is_number (car (SCHEME_V->args))) 4731 if (!is_pair (args) || !is_number (a))
4881 Error_0 ("new-segment: argument must be a number"); 4732 Error_0 ("new-segment: argument must be a number");
4882 4733
4883 alloc_cellseg (SCHEME_A_ (int)ivalue (car (SCHEME_V->args))); 4734 alloc_cellseg (SCHEME_A_ (int)ivalue (a));
4884 4735
4885 s_return (S_T); 4736 s_return (S_T);
4886 4737
4887 case OP_OBLIST: /* oblist */ 4738 case OP_OBLIST: /* oblist */
4888 s_return (oblist_all_symbols (SCHEME_A)); 4739 s_return (oblist_all_symbols (SCHEME_A));
… …
4915 case OP_OPEN_INOUTFILE: 4766 case OP_OPEN_INOUTFILE:
4916 prop = port_input | port_output; 4767 prop = port_input | port_output;
4917 break; 4768 break;
4918 } 4769 }
4919 4770
4920 p = port_from_filename (SCHEME_A_ strvalue (car (SCHEME_V->args)), prop); 4771 p = port_from_filename (SCHEME_A_ strvalue (a), prop);
4921 4772
4922 if (p == NIL) 4773 s_return (p == NIL ? S_F : p);
4923 s_return (S_F);
4924
4925 s_return (p);
4926 } 4774 }
4927 4775
4928# if USE_STRING_PORTS 4776# if USE_STRING_PORTS
4929 4777
4930 case OP_OPEN_INSTRING: /* open-input-string */ 4778 case OP_OPEN_INSTRING: /* open-input-string */
… …
4942 case OP_OPEN_INOUTSTRING: 4790 case OP_OPEN_INOUTSTRING:
4943 prop = port_input | port_output; 4791 prop = port_input | port_output;
4944 break; 4792 break;
4945 } 4793 }
4946 4794
4947 p = port_from_string (SCHEME_A_ strvalue (car (SCHEME_V->args)), 4795 p = port_from_string (SCHEME_A_ strvalue (a),
4948 strvalue (car (SCHEME_V->args)) + strlength (car (SCHEME_V->args)), prop); 4796 strvalue (a) + strlength (a), prop);
4949 4797
4950 if (p == NIL) 4798 s_return (p == NIL ? S_F : p);
4951 s_return (S_F);
4952
4953 s_return (p);
4954 } 4799 }
4955 4800
4956 case OP_OPEN_OUTSTRING: /* open-output-string */ 4801 case OP_OPEN_OUTSTRING: /* open-output-string */
4957 { 4802 {
4958 pointer p; 4803 pointer p;
4959 4804
4960 if (car (SCHEME_V->args) == NIL) 4805 if (a == NIL)
4961 {
4962 p = port_from_scratch (SCHEME_A); 4806 p = port_from_scratch (SCHEME_A);
4963
4964 if (p == NIL)
4965 s_return (S_F);
4966 }
4967 else 4807 else
4968 {
4969 p = port_from_string (SCHEME_A_ strvalue (car (SCHEME_V->args)), 4808 p = port_from_string (SCHEME_A_ strvalue (a),
4970 strvalue (car (SCHEME_V->args)) + strlength (car (SCHEME_V->args)), port_output); 4809 strvalue (a) + strlength (a), port_output);
4971 4810
4972 if (p == NIL) 4811 s_return (p == NIL ? S_F : p);
4973 s_return (S_F);
4974 }
4975
4976 s_return (p);
4977 } 4812 }
4978 4813
4979 case OP_GET_OUTSTRING: /* get-output-string */ 4814 case OP_GET_OUTSTRING: /* get-output-string */
4980 { 4815 {
4981 port *p; 4816 port *p;
4982 4817
4983 if ((p = car (SCHEME_V->args)->object.port)->kind & port_string) 4818 if ((p = a->object.port)->kind & port_string)
4984 { 4819 {
4985 off_t size; 4820 off_t size;
4986 char *str; 4821 char *str;
4987 4822
4988 size = p->rep.string.curr - p->rep.string.start + 1; 4823 size = p->rep.string.curr - p->rep.string.start + 1;
… …
5004 } 4839 }
5005 4840
5006# endif 4841# endif
5007 4842
5008 case OP_CLOSE_INPORT: /* close-input-port */ 4843 case OP_CLOSE_INPORT: /* close-input-port */
5009 port_close (SCHEME_A_ car (SCHEME_V->args), port_input); 4844 port_close (SCHEME_A_ a, port_input);
5010 s_return (S_T); 4845 s_return (S_T);
5011 4846
5012 case OP_CLOSE_OUTPORT: /* close-output-port */ 4847 case OP_CLOSE_OUTPORT: /* close-output-port */
5013 port_close (SCHEME_A_ car (SCHEME_V->args), port_output); 4848 port_close (SCHEME_A_ a, port_output);
5014 s_return (S_T); 4849 s_return (S_T);
5015#endif 4850#endif
5016 4851
5017 case OP_INT_ENV: /* interaction-environment */ 4852 case OP_INT_ENV: /* interaction-environment */
5018 s_return (SCHEME_V->global_env); 4853 s_return (SCHEME_V->global_env);
… …
5020 case OP_CURR_ENV: /* current-environment */ 4855 case OP_CURR_ENV: /* current-environment */
5021 s_return (SCHEME_V->envir); 4856 s_return (SCHEME_V->envir);
5022 4857
5023 } 4858 }
5024 4859
5025 return S_T; 4860 if (USE_ERROR_CHECKING) abort ();
5026} 4861}
5027 4862
5028static pointer 4863static int
5029opexe_5 (SCHEME_P_ enum scheme_opcodes op) 4864opexe_5 (SCHEME_P_ enum scheme_opcodes op)
5030{ 4865{
4866 pointer args = SCHEME_V->args;
5031 pointer x; 4867 pointer x;
5032 4868
5033 if (SCHEME_V->nesting != 0) 4869 if (SCHEME_V->nesting != 0)
5034 { 4870 {
5035 int n = SCHEME_V->nesting; 4871 int n = SCHEME_V->nesting;
… …
5042 switch (op) 4878 switch (op)
5043 { 4879 {
5044 /* ========== reading part ========== */ 4880 /* ========== reading part ========== */
5045#if USE_PORTS 4881#if USE_PORTS
5046 case OP_READ: 4882 case OP_READ:
5047 if (!is_pair (SCHEME_V->args)) 4883 if (!is_pair (args))
5048 s_goto (OP_READ_INTERNAL); 4884 s_goto (OP_READ_INTERNAL);
5049 4885
5050 if (!is_inport (car (SCHEME_V->args))) 4886 if (!is_inport (car (args)))
5051 Error_1 ("read: not an input port:", car (SCHEME_V->args)); 4887 Error_1 ("read: not an input port:", car (args));
5052 4888
5053 if (car (SCHEME_V->args) == SCHEME_V->inport) 4889 if (car (args) == SCHEME_V->inport)
5054 s_goto (OP_READ_INTERNAL); 4890 s_goto (OP_READ_INTERNAL);
5055 4891
5056 x = SCHEME_V->inport; 4892 x = SCHEME_V->inport;
5057 SCHEME_V->inport = car (SCHEME_V->args); 4893 SCHEME_V->inport = car (args);
5058 x = cons (x, NIL); 4894 x = cons (x, NIL);
5059 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); 4895 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL);
5060 s_goto (OP_READ_INTERNAL); 4896 s_goto (OP_READ_INTERNAL);
5061 4897
5062 case OP_READ_CHAR: /* read-char */ 4898 case OP_READ_CHAR: /* read-char */
5063 case OP_PEEK_CHAR: /* peek-char */ 4899 case OP_PEEK_CHAR: /* peek-char */
5064 { 4900 {
5065 int c; 4901 int c;
5066 4902
5067 if (is_pair (SCHEME_V->args)) 4903 if (is_pair (args))
5068 { 4904 {
5069 if (car (SCHEME_V->args) != SCHEME_V->inport) 4905 if (car (args) != SCHEME_V->inport)
5070 { 4906 {
5071 x = SCHEME_V->inport; 4907 x = SCHEME_V->inport;
5072 x = cons (x, NIL); 4908 x = cons (x, NIL);
5073 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); 4909 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL);
5074 SCHEME_V->inport = car (SCHEME_V->args); 4910 SCHEME_V->inport = car (args);
5075 } 4911 }
5076 } 4912 }
5077 4913
5078 c = inchar (SCHEME_A); 4914 c = inchar (SCHEME_A);
5079 4915
… …
5089 case OP_CHAR_READY: /* char-ready? */ 4925 case OP_CHAR_READY: /* char-ready? */
5090 { 4926 {
5091 pointer p = SCHEME_V->inport; 4927 pointer p = SCHEME_V->inport;
5092 int res; 4928 int res;
5093 4929
5094 if (is_pair (SCHEME_V->args)) 4930 if (is_pair (args))
5095 p = car (SCHEME_V->args); 4931 p = car (args);
5096 4932
5097 res = p->object.port->kind & port_string; 4933 res = p->object.port->kind & port_string;
5098 4934
5099 s_retbool (res); 4935 s_retbool (res);
5100 } 4936 }
5101 4937
5102 case OP_SET_INPORT: /* set-input-port */ 4938 case OP_SET_INPORT: /* set-input-port */
5103 SCHEME_V->inport = car (SCHEME_V->args); 4939 SCHEME_V->inport = car (args);
5104 s_return (SCHEME_V->value); 4940 s_return (SCHEME_V->value);
5105 4941
5106 case OP_SET_OUTPORT: /* set-output-port */ 4942 case OP_SET_OUTPORT: /* set-output-port */
5107 SCHEME_V->outport = car (SCHEME_V->args); 4943 SCHEME_V->outport = car (args);
5108 s_return (SCHEME_V->value); 4944 s_return (SCHEME_V->value);
5109#endif 4945#endif
5110 4946
5111 case OP_RDSEXPR: 4947 case OP_RDSEXPR:
5112 switch (SCHEME_V->tok) 4948 switch (SCHEME_V->tok)
… …
5198 } 5034 }
5199 5035
5200 break; 5036 break;
5201 5037
5202 case OP_RDLIST: 5038 case OP_RDLIST:
5203 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 5039 SCHEME_V->args = cons (SCHEME_V->value, args);
5204 SCHEME_V->tok = token (SCHEME_A); 5040 SCHEME_V->tok = token (SCHEME_A);
5205 5041
5206 switch (SCHEME_V->tok) 5042 switch (SCHEME_V->tok)
5207 { 5043 {
5208 case TOK_EOF: 5044 case TOK_EOF:
… …
5236 case OP_RDDOT: 5072 case OP_RDDOT:
5237 if (token (SCHEME_A) != TOK_RPAREN) 5073 if (token (SCHEME_A) != TOK_RPAREN)
5238 Error_0 ("syntax error: illegal dot expression"); 5074 Error_0 ("syntax error: illegal dot expression");
5239 5075
5240 SCHEME_V->nesting_stack[SCHEME_V->file_i]--; 5076 SCHEME_V->nesting_stack[SCHEME_V->file_i]--;
5241 s_return (reverse_in_place (SCHEME_A_ SCHEME_V->value, SCHEME_V->args)); 5077 s_return (reverse_in_place (SCHEME_A_ SCHEME_V->value, args));
5242 5078
5243 case OP_RDQUOTE: 5079 case OP_RDQUOTE:
5244 s_return (cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL))); 5080 s_return (cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL)));
5245 5081
5246 case OP_RDQQUOTE: 5082 case OP_RDQQUOTE:
… …
5268 SCHEME_V->args = SCHEME_V->value; 5104 SCHEME_V->args = SCHEME_V->value;
5269 s_goto (OP_VECTOR); 5105 s_goto (OP_VECTOR);
5270 5106
5271 /* ========== printing part ========== */ 5107 /* ========== printing part ========== */
5272 case OP_P0LIST: 5108 case OP_P0LIST:
5273 if (is_vector (SCHEME_V->args)) 5109 if (is_vector (args))
5274 { 5110 {
5275 putstr (SCHEME_A_ "#("); 5111 putstr (SCHEME_A_ "#(");
5276 SCHEME_V->args = cons (SCHEME_V->args, mk_integer (SCHEME_A_ 0)); 5112 SCHEME_V->args = cons (args, mk_integer (SCHEME_A_ 0));
5277 s_goto (OP_PVECFROM); 5113 s_goto (OP_PVECFROM);
5278 } 5114 }
5279 else if (is_environment (SCHEME_V->args)) 5115 else if (is_environment (args))
5280 { 5116 {
5281 putstr (SCHEME_A_ "#<ENVIRONMENT>"); 5117 putstr (SCHEME_A_ "#<ENVIRONMENT>");
5282 s_return (S_T); 5118 s_return (S_T);
5283 } 5119 }
5284 else if (!is_pair (SCHEME_V->args)) 5120 else if (!is_pair (args))
5285 { 5121 {
5286 printatom (SCHEME_A_ SCHEME_V->args, SCHEME_V->print_flag); 5122 printatom (SCHEME_A_ args, SCHEME_V->print_flag);
5287 s_return (S_T); 5123 s_return (S_T);
5288 } 5124 }
5289 else if (car (SCHEME_V->args) == SCHEME_V->QUOTE && ok_abbrev (cdr (SCHEME_V->args))) 5125 else
5290 { 5126 {
5127 pointer a = car (args);
5128 pointer b = cdr (args);
5129 int ok_abbr = ok_abbrev (b);
5130 SCHEME_V->args = car (b);
5131
5132 if (a == SCHEME_V->QUOTE && ok_abbr)
5291 putstr (SCHEME_A_ "'"); 5133 putstr (SCHEME_A_ "'");
5292 SCHEME_V->args = cadr (SCHEME_V->args); 5134 else if (a == SCHEME_V->QQUOTE && ok_abbr)
5135 putstr (SCHEME_A_ "`");
5136 else if (a == SCHEME_V->UNQUOTE && ok_abbr)
5137 putstr (SCHEME_A_ ",");
5138 else if (a == SCHEME_V->UNQUOTESP && ok_abbr)
5139 putstr (SCHEME_A_ ",@");
5140 else
5141 {
5142 putstr (SCHEME_A_ "(");
5143 s_save (SCHEME_A_ OP_P1LIST, b, NIL);
5144 SCHEME_V->args = a;
5145 }
5146
5293 s_goto (OP_P0LIST); 5147 s_goto (OP_P0LIST);
5294 } 5148 }
5295 else if (car (SCHEME_V->args) == SCHEME_V->QQUOTE && ok_abbrev (cdr (SCHEME_V->args))) 5149
5150 case OP_P1LIST:
5151 if (is_pair (args))
5296 { 5152 {
5153 s_save (SCHEME_A_ OP_P1LIST, cdr (args), NIL);
5297 putstr (SCHEME_A_ "`"); 5154 putstr (SCHEME_A_ " ");
5298 SCHEME_V->args = cadr (SCHEME_V->args); 5155 SCHEME_V->args = car (args);
5299 s_goto (OP_P0LIST); 5156 s_goto (OP_P0LIST);
5300 } 5157 }
5301 else if (car (SCHEME_V->args) == SCHEME_V->UNQUOTE && ok_abbrev (cdr (SCHEME_V->args)))
5302 {
5303 putstr (SCHEME_A_ ",");
5304 SCHEME_V->args = cadr (SCHEME_V->args);
5305 s_goto (OP_P0LIST);
5306 }
5307 else if (car (SCHEME_V->args) == SCHEME_V->UNQUOTESP && ok_abbrev (cdr (SCHEME_V->args)))
5308 {
5309 putstr (SCHEME_A_ ",@");
5310 SCHEME_V->args = cadr (SCHEME_V->args);
5311 s_goto (OP_P0LIST);
5312 }
5313 else
5314 {
5315 putstr (SCHEME_A_ "(");
5316 s_save (SCHEME_A_ OP_P1LIST, cdr (SCHEME_V->args), NIL);
5317 SCHEME_V->args = car (SCHEME_V->args);
5318 s_goto (OP_P0LIST);
5319 }
5320
5321 case OP_P1LIST:
5322 if (is_pair (SCHEME_V->args))
5323 {
5324 s_save (SCHEME_A_ OP_P1LIST, cdr (SCHEME_V->args), NIL);
5325 putstr (SCHEME_A_ " ");
5326 SCHEME_V->args = car (SCHEME_V->args);
5327 s_goto (OP_P0LIST);
5328 }
5329 else if (is_vector (SCHEME_V->args)) 5158 else if (is_vector (args))
5330 { 5159 {
5331 s_save (SCHEME_A_ OP_P1LIST, NIL, NIL); 5160 s_save (SCHEME_A_ OP_P1LIST, NIL, NIL);
5332 putstr (SCHEME_A_ " . "); 5161 putstr (SCHEME_A_ " . ");
5333 s_goto (OP_P0LIST); 5162 s_goto (OP_P0LIST);
5334 } 5163 }
5335 else 5164 else
5336 { 5165 {
5337 if (SCHEME_V->args != NIL) 5166 if (args != NIL)
5338 { 5167 {
5339 putstr (SCHEME_A_ " . "); 5168 putstr (SCHEME_A_ " . ");
5340 printatom (SCHEME_A_ SCHEME_V->args, SCHEME_V->print_flag); 5169 printatom (SCHEME_A_ args, SCHEME_V->print_flag);
5341 } 5170 }
5342 5171
5343 putstr (SCHEME_A_ ")"); 5172 putstr (SCHEME_A_ ")");
5344 s_return (S_T); 5173 s_return (S_T);
5345 } 5174 }
5346 5175
5347 case OP_PVECFROM: 5176 case OP_PVECFROM:
5348 { 5177 {
5349 int i = ivalue_unchecked (cdr (SCHEME_V->args)); 5178 int i = ivalue_unchecked (cdr (args));
5350 pointer vec = car (SCHEME_V->args); 5179 pointer vec = car (args);
5351 int len = veclength (vec); 5180 int len = veclength (vec);
5352 5181
5353 if (i == len) 5182 if (i == len)
5354 { 5183 {
5355 putstr (SCHEME_A_ ")"); 5184 putstr (SCHEME_A_ ")");
… …
5357 } 5186 }
5358 else 5187 else
5359 { 5188 {
5360 pointer elem = vector_elem (vec, i); 5189 pointer elem = vector_elem (vec, i);
5361 5190
5362 ivalue_unchecked (cdr (SCHEME_V->args)) = i + 1; 5191 ivalue_unchecked (cdr (args)) = i + 1;
5363 s_save (SCHEME_A_ OP_PVECFROM, SCHEME_V->args, NIL); 5192 s_save (SCHEME_A_ OP_PVECFROM, args, NIL);
5364 SCHEME_V->args = elem; 5193 SCHEME_V->args = elem;
5365 5194
5366 if (i > 0) 5195 if (i > 0)
5367 putstr (SCHEME_A_ " "); 5196 putstr (SCHEME_A_ " ");
5368 5197
5369 s_goto (OP_P0LIST); 5198 s_goto (OP_P0LIST);
5370 } 5199 }
5371 } 5200 }
5372 } 5201 }
5373 5202
5374 return S_T; 5203 if (USE_ERROR_CHECKING) abort ();
5375} 5204}
5376 5205
5377static pointer 5206static int
5378opexe_6 (SCHEME_P_ enum scheme_opcodes op) 5207opexe_6 (SCHEME_P_ enum scheme_opcodes op)
5379{ 5208{
5209 pointer args = SCHEME_V->args;
5210 pointer a = car (args);
5380 pointer x, y; 5211 pointer x, y;
5381 5212
5382 switch (op) 5213 switch (op)
5383 { 5214 {
5384 case OP_LIST_LENGTH: /* length *//* a.k */ 5215 case OP_LIST_LENGTH: /* length *//* a.k */
5385 { 5216 {
5386 long v = list_length (SCHEME_A_ car (SCHEME_V->args)); 5217 long v = list_length (SCHEME_A_ a);
5387 5218
5388 if (v < 0) 5219 if (v < 0)
5389 Error_1 ("length: not a list:", car (SCHEME_V->args)); 5220 Error_1 ("length: not a list:", a);
5390 5221
5391 s_return (mk_integer (SCHEME_A_ v)); 5222 s_return (mk_integer (SCHEME_A_ v));
5392 } 5223 }
5393 5224
5394 case OP_ASSQ: /* assq *//* a.k */ 5225 case OP_ASSQ: /* assq *//* a.k */
5395 x = car (SCHEME_V->args); 5226 x = a;
5396 5227
5397 for (y = cadr (SCHEME_V->args); is_pair (y); y = cdr (y)) 5228 for (y = cadr (args); is_pair (y); y = cdr (y))
5398 { 5229 {
5399 if (!is_pair (car (y))) 5230 if (!is_pair (car (y)))
5400 Error_0 ("unable to handle non pair element"); 5231 Error_0 ("unable to handle non pair element");
5401 5232
5402 if (x == caar (y)) 5233 if (x == caar (y))
… …
5408 else 5239 else
5409 s_return (S_F); 5240 s_return (S_F);
5410 5241
5411 5242
5412 case OP_GET_CLOSURE: /* get-closure-code *//* a.k */ 5243 case OP_GET_CLOSURE: /* get-closure-code *//* a.k */
5413 SCHEME_V->args = car (SCHEME_V->args); 5244 SCHEME_V->args = a;
5414 5245
5415 if (SCHEME_V->args == NIL) 5246 if (SCHEME_V->args == NIL)
5416 s_return (S_F); 5247 s_return (S_F);
5417 else if (is_closure (SCHEME_V->args)) 5248 else if (is_closure (SCHEME_V->args))
5418 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value))); 5249 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value)));
… …
5424 case OP_CLOSUREP: /* closure? */ 5255 case OP_CLOSUREP: /* closure? */
5425 /* 5256 /*
5426 * Note, macro object is also a closure. 5257 * Note, macro object is also a closure.
5427 * Therefore, (closure? <#MACRO>) ==> #t 5258 * Therefore, (closure? <#MACRO>) ==> #t
5428 */ 5259 */
5429 s_retbool (is_closure (car (SCHEME_V->args))); 5260 s_retbool (is_closure (a));
5430 5261
5431 case OP_MACROP: /* macro? */ 5262 case OP_MACROP: /* macro? */
5432 s_retbool (is_macro (car (SCHEME_V->args))); 5263 s_retbool (is_macro (a));
5433 } 5264 }
5434 5265
5435 return S_T; /* NOTREACHED */ 5266 if (USE_ERROR_CHECKING) abort ();
5436} 5267}
5437 5268
5269/* dispatch functions (opexe_x) return new opcode, or 0 for same opcode, or -1 to stop */
5438typedef pointer (*dispatch_func) (SCHEME_P_ enum scheme_opcodes); 5270typedef int (*dispatch_func)(SCHEME_P_ enum scheme_opcodes);
5439 5271
5440typedef int (*test_predicate) (pointer); 5272typedef int (*test_predicate)(pointer);
5441static int 5273static int
5442is_any (pointer p) 5274is_any (pointer p)
5443{ 5275{
5444 return 1; 5276 return 1;
5445} 5277}
5446 5278
5447static int 5279static int
5448is_nonneg (pointer p) 5280is_nonneg (pointer p)
5449{ 5281{
5450 return ivalue (p) >= 0 && is_integer (p); 5282 return ivalue (p) >= 0 && is_integer (p);
5283}
5284
5285static int
5286tst_is_list (pointer p)
5287{
5288 return p == NIL || is_pair (p);
5451} 5289}
5452 5290
5453/* Correspond carefully with following defines! */ 5291/* Correspond carefully with following defines! */
5454static struct 5292static struct
5455{ 5293{
5456 test_predicate fct; 5294 test_predicate fct;
5457 const char *kind; 5295 const char *kind;
5458} tests[] = 5296} tests[] =
5459{ 5297{
5460 { 0, 0}, /* unused */ 5298 { is_any, 0 },
5461 { is_any, 0}, 5299 { is_string, "string" },
5462 { is_string, "string" }, 5300 { is_symbol, "symbol" },
5463 { is_symbol, "symbol" }, 5301 { is_port, "port" },
5464 { is_port, "port" },
5465 { is_inport, "input port" }, 5302 { is_inport, "input port" },
5466 { is_outport, "output port" }, 5303 { is_outport, "output port" },
5467 { is_environment, "environment" }, 5304 { is_environment, "environment" },
5468 { is_pair, "pair" }, 5305 { is_pair, "pair" },
5469 { 0, "pair or '()" }, 5306 { tst_is_list, "pair or '()" },
5470 { is_character, "character" }, 5307 { is_character, "character" },
5471 { is_vector, "vector" }, 5308 { is_vector, "vector" },
5472 { is_number, "number" }, 5309 { is_number, "number" },
5473 { is_integer, "integer" }, 5310 { is_integer, "integer" },
5474 { is_nonneg, "non-negative integer" } 5311 { is_nonneg, "non-negative integer" }
5475}; 5312};
5476 5313
5477#define TST_NONE 0 5314#define TST_NONE 0 /* TST_NONE used for built-ins, 0 for internal ops */
5478#define TST_ANY "\001" 5315#define TST_ANY "\001"
5479#define TST_STRING "\002" 5316#define TST_STRING "\002"
5480#define TST_SYMBOL "\003" 5317#define TST_SYMBOL "\003"
5481#define TST_PORT "\004" 5318#define TST_PORT "\004"
5482#define TST_INPORT "\005" 5319#define TST_INPORT "\005"
5483#define TST_OUTPORT "\006" 5320#define TST_OUTPORT "\006"
5484#define TST_ENVIRONMENT "\007" 5321#define TST_ENVIRONMENT "\007"
5485#define TST_PAIR "\010" 5322#define TST_PAIR "\010"
5486#define TST_LIST "\011" 5323#define TST_LIST "\011"
5487#define TST_CHAR "\012" 5324#define TST_CHAR "\012"
5488#define TST_VECTOR "\013" 5325#define TST_VECTOR "\013"
5489#define TST_NUMBER "\014" 5326#define TST_NUMBER "\014"
5490#define TST_INTEGER "\015" 5327#define TST_INTEGER "\015"
5491#define TST_NATURAL "\016" 5328#define TST_NATURAL "\016"
5329
5330#define INF_ARG 0xff
5331#define UNNAMED_OP ""
5332
5333static const char opnames[] =
5334#define OP_DEF(func,name,minarity,maxarity,argtest,op) name "\x00"
5335#include "opdefines.h"
5336#undef OP_DEF
5337;
5338
5339static const char *
5340opname (int idx)
5341{
5342 const char *name = opnames;
5343
5344 /* should do this at compile time, but would require external program, right? */
5345 while (idx--)
5346 name += strlen (name) + 1;
5347
5348 return *name ? name : "ILLEGAL";
5349}
5350
5351static const char *
5352procname (pointer x)
5353{
5354 return opname (procnum (x));
5355}
5492 5356
5493typedef struct 5357typedef struct
5494{ 5358{
5495 dispatch_func func; 5359 uint8_t func;
5496 char *name; 5360 /*dispatch_func func;*//*TODO: maybe optionally keep the pointer, for speed? */
5361 uint8_t builtin;
5497 int min_arity; 5362 uint8_t min_arity;
5498 int max_arity; 5363 uint8_t max_arity;
5499 char *arg_tests_encoding; 5364 char arg_tests_encoding[3];
5500} op_code_info; 5365} op_code_info;
5501 5366
5502#define INF_ARG 0xffff
5503
5504static op_code_info dispatch_table[] = { 5367static const op_code_info dispatch_table[] = {
5505#define OP_DEF(A,B,C,D,E,OP) {A,B,C,D,E}, 5368#define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1, minarity, maxarity, argtest },
5506#include "opdefines.h" 5369#include "opdefines.h"
5370#undef OP_DEF
5507 {0} 5371 {0}
5508}; 5372};
5509 5373
5510static const char *
5511procname (pointer x)
5512{
5513 int n = procnum (x);
5514 const char *name = dispatch_table[n].name;
5515
5516 if (name == 0)
5517 name = "ILLEGAL!";
5518
5519 return name;
5520}
5521
5522/* kernel of this interpreter */ 5374/* kernel of this interpreter */
5523static void 5375static void ecb_hot
5524Eval_Cycle (SCHEME_P_ enum scheme_opcodes op) 5376Eval_Cycle (SCHEME_P_ enum scheme_opcodes op)
5525{ 5377{
5526 SCHEME_V->op = op; 5378 SCHEME_V->op = op;
5527 5379
5528 for (;;) 5380 for (;;)
5529 { 5381 {
5530 op_code_info *pcd = dispatch_table + SCHEME_V->op; 5382 const op_code_info *pcd = dispatch_table + SCHEME_V->op;
5531 5383
5532#if USE_ERROR_CHECKING 5384#if USE_ERROR_CHECKING
5533 if (pcd->name) /* if built-in function, check arguments */ 5385 if (pcd->builtin) /* if built-in function, check arguments */
5534 { 5386 {
5535 int ok = 1;
5536 char msg[STRBUFFSIZE]; 5387 char msg[STRBUFFSIZE];
5537 int n = list_length (SCHEME_A_ SCHEME_V->args); 5388 int n = list_length (SCHEME_A_ SCHEME_V->args);
5538 5389
5539 /* Check number of arguments */ 5390 /* Check number of arguments */
5540 if (n < pcd->min_arity) 5391 if (ecb_expect_false (n < pcd->min_arity))
5541 { 5392 {
5542 ok = 0;
5543 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", 5393 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)",
5544 pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity); 5394 opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity);
5395 xError_1 (SCHEME_A_ msg, 0);
5396 continue;
5545 } 5397 }
5546 5398 else if (ecb_expect_false (n > pcd->max_arity && pcd->max_arity != INF_ARG))
5547 if (ok && n > pcd->max_arity)
5548 { 5399 {
5549 ok = 0;
5550 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", 5400 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)",
5551 pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity); 5401 opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity);
5402 xError_1 (SCHEME_A_ msg, 0);
5403 continue;
5552 } 5404 }
5553 5405 else
5554 if (ok)
5555 { 5406 {
5556 if (pcd->arg_tests_encoding) 5407 if (*pcd->arg_tests_encoding) /* literal 0 and TST_NONE treated the same */
5557 { 5408 {
5558 int i = 0; 5409 int i = 0;
5559 int j; 5410 int j;
5560 const char *t = pcd->arg_tests_encoding; 5411 const char *t = pcd->arg_tests_encoding;
5561 pointer arglist = SCHEME_V->args; 5412 pointer arglist = SCHEME_V->args;
5562 5413
5563 do 5414 do
5564 { 5415 {
5565 pointer arg = car (arglist); 5416 pointer arg = car (arglist);
5566 5417
5567 j = (int) t[0]; 5418 j = t[0];
5568 5419
5569 if (j == TST_LIST[0]) 5420 if (!tests[j - 1].fct (arg))
5570 {
5571 if (arg != NIL && !is_pair (arg))
5572 break; 5421 break;
5573 }
5574 else
5575 {
5576 if (!tests[j].fct (arg))
5577 break;
5578 }
5579 5422
5580 if (t[1] != 0) /* last test is replicated as necessary */ 5423 if (t[1]) /* last test is replicated as necessary */
5581 t++; 5424 t++;
5582 5425
5583 arglist = cdr (arglist); 5426 arglist = cdr (arglist);
5584 i++; 5427 i++;
5585 } 5428 }
5586 while (i < n); 5429 while (i < n);
5587 5430
5588 if (i < n) 5431 if (i < n)
5589 { 5432 {
5590 ok = 0;
5591 snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", pcd->name, i + 1, tests[j].kind); 5433 snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", opname (SCHEME_V->op), i + 1, tests[j].kind);
5434 xError_1 (SCHEME_A_ msg, 0);
5435 continue;
5592 } 5436 }
5593 } 5437 }
5594 } 5438 }
5595
5596 if (!ok)
5597 {
5598 if (xError_1 (SCHEME_A_ msg, 0) == NIL)
5599 return;
5600
5601 pcd = dispatch_table + SCHEME_V->op;
5602 }
5603 } 5439 }
5604#endif 5440#endif
5605 5441
5606 ok_to_freely_gc (SCHEME_A); 5442 ok_to_freely_gc (SCHEME_A);
5607 5443
5608 if (pcd->func (SCHEME_A_ SCHEME_V->op) == NIL) 5444 static const dispatch_func dispatch_funcs[] = {
5445 opexe_0,
5446 opexe_1,
5447 opexe_2,
5448 opexe_3,
5449 opexe_4,
5450 opexe_5,
5451 opexe_6,
5452 };
5453
5454 if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0))
5609 return; 5455 return;
5610 5456
5611 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 5457 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
5612 { 5458 {
5613 xwrstr ("No memory!\n"); 5459 xwrstr ("No memory!\n");
… …
5671 5517
5672 case 'd': 5518 case 'd':
5673 return OP_COND0; /* cond */ 5519 return OP_COND0; /* cond */
5674 5520
5675 case '*': 5521 case '*':
5676 return OP_LET0AST; /* let* */ 5522 return OP_LET0AST;/* let* */
5677 5523
5678 default: 5524 default:
5679 return OP_SET0; /* set! */ 5525 return OP_SET0; /* set! */
5680 } 5526 }
5681 5527
… …
5703 5549
5704 case 'f': 5550 case 'f':
5705 return OP_DEF0; /* define */ 5551 return OP_DEF0; /* define */
5706 5552
5707 default: 5553 default:
5708 return OP_LET0REC; /* letrec */ 5554 return OP_LET0REC;/* letrec */
5709 } 5555 }
5710 5556
5711 default: 5557 default:
5712 return OP_C0STREAM; /* cons-stream */ 5558 return OP_C0STREAM; /* cons-stream */
5713 } 5559 }
5714} 5560}
5715 5561
5716#if USE_MULTIPLICITY 5562#if USE_MULTIPLICITY
5717scheme * 5563ecb_cold scheme *
5718scheme_init_new () 5564scheme_init_new ()
5719{ 5565{
5720 scheme *sc = malloc (sizeof (scheme)); 5566 scheme *sc = malloc (sizeof (scheme));
5721 5567
5722 if (!scheme_init (SCHEME_A)) 5568 if (!scheme_init (SCHEME_A))
… …
5727 else 5573 else
5728 return sc; 5574 return sc;
5729} 5575}
5730#endif 5576#endif
5731 5577
5732int 5578ecb_cold int
5733scheme_init (SCHEME_P) 5579scheme_init (SCHEME_P)
5734{ 5580{
5735 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]); 5581 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]);
5736 pointer x; 5582 pointer x;
5737 5583
… …
5810 5656
5811 for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i) 5657 for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i)
5812 assign_syntax (SCHEME_A_ syntax_names[i]); 5658 assign_syntax (SCHEME_A_ syntax_names[i]);
5813 } 5659 }
5814 5660
5661 // TODO: should iterate via strlen, to avoid n² complexity
5815 for (i = 0; i < n; i++) 5662 for (i = 0; i < n; i++)
5816 if (dispatch_table[i].name != 0) 5663 if (dispatch_table[i].builtin)
5817 assign_proc (SCHEME_A_ i, dispatch_table[i].name); 5664 assign_proc (SCHEME_A_ i, opname (i));
5818 5665
5819 /* initialization of global pointers to special symbols */ 5666 /* initialization of global pointers to special symbols */
5820 SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda"); 5667 SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda");
5821 SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote"); 5668 SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote");
5822 SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote"); 5669 SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote");
… …
5861scheme_set_external_data (SCHEME_P_ void *p) 5708scheme_set_external_data (SCHEME_P_ void *p)
5862{ 5709{
5863 SCHEME_V->ext_data = p; 5710 SCHEME_V->ext_data = p;
5864} 5711}
5865 5712
5866void 5713ecb_cold void
5867scheme_deinit (SCHEME_P) 5714scheme_deinit (SCHEME_P)
5868{ 5715{
5869 int i; 5716 int i;
5870 5717
5871#if SHOW_ERROR_LINE 5718#if SHOW_ERROR_LINE
… …
5963{ 5810{
5964 dump_stack_reset (SCHEME_A); 5811 dump_stack_reset (SCHEME_A);
5965 SCHEME_V->envir = SCHEME_V->global_env; 5812 SCHEME_V->envir = SCHEME_V->global_env;
5966 SCHEME_V->file_i = 0; 5813 SCHEME_V->file_i = 0;
5967 SCHEME_V->load_stack[0].kind = port_input | port_string; 5814 SCHEME_V->load_stack[0].kind = port_input | port_string;
5968 SCHEME_V->load_stack[0].rep.string.start = (char *) cmd; /* This func respects const */ 5815 SCHEME_V->load_stack[0].rep.string.start = (char *)cmd; /* This func respects const */
5969 SCHEME_V->load_stack[0].rep.string.past_the_end = (char *) cmd + strlen (cmd); 5816 SCHEME_V->load_stack[0].rep.string.past_the_end = (char *)cmd + strlen (cmd);
5970 SCHEME_V->load_stack[0].rep.string.curr = (char *) cmd; 5817 SCHEME_V->load_stack[0].rep.string.curr = (char *)cmd;
5971#if USE_PORTS 5818#if USE_PORTS
5972 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack); 5819 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack);
5973#endif 5820#endif
5974 SCHEME_V->retcode = 0; 5821 SCHEME_V->retcode = 0;
5975 SCHEME_V->interactive_repl = 0; 5822 SCHEME_V->interactive_repl = 0;

Diff Legend

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