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.8 by root, Wed Nov 25 22:36:25 2015 UTC vs.
Revision 1.29 by root, Sat Nov 28 10:31:06 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
… …
176# define FIRST_CELLSEGS 3 182# define FIRST_CELLSEGS 3
177#endif 183#endif
178 184
179enum scheme_types 185enum scheme_types
180{ 186{
187 T_INTEGER,
181 T_FREE, 188 T_REAL,
182 T_STRING, 189 T_STRING,
183 T_NUMBER,
184 T_SYMBOL, 190 T_SYMBOL,
185 T_PROC, 191 T_PROC,
186 T_PAIR, 192 T_PAIR, /* also used for free cells */
187 T_CLOSURE, 193 T_CLOSURE,
188 T_CONTINUATION, 194 T_CONTINUATION,
189 T_FOREIGN, 195 T_FOREIGN,
190 T_CHARACTER, 196 T_CHARACTER,
191 T_PORT, 197 T_PORT,
… …
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); 212/* num, for generic arithmetic */
207static num num_mul (num a, num b); 213struct num
208static num num_div (num a, num b); 214{
215 IVALUE ivalue;
216#if USE_REAL
217 RVALUE rvalue;
218 char is_fixnum;
219#endif
220};
221
222#if USE_REAL
223# define num_is_fixnum(n) (n).is_fixnum
224# define num_set_fixnum(n,f) (n).is_fixnum = (f)
225# define num_ivalue(n) (n).ivalue
226# define num_rvalue(n) (n).rvalue
227# define num_set_ivalue(n,i) (n).rvalue = (n).ivalue = (i)
228# define num_set_rvalue(n,r) (n).rvalue = (r)
229#else
230# define num_is_fixnum(n) 1
231# define num_set_fixnum(n,f) 0
232# define num_ivalue(n) (n).ivalue
233# define num_rvalue(n) (n).ivalue
234# define num_set_ivalue(n,i) (n).ivalue = (i)
235# define num_set_rvalue(n,r) (n).ivalue = (r)
236#endif
237
238enum num_op { NUM_ADD, NUM_SUB, NUM_MUL, NUM_INTDIV };
239
240static num num_op (enum num_op op, num a, num b);
209static num num_intdiv (num a, num b); 241static num num_intdiv (num a, num b);
210static num num_sub (num a, num b);
211static num num_rem (num a, num b); 242static num num_rem (num a, num b);
212static num num_mod (num a, num b); 243static 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 244
219#if USE_MATH 245#if USE_MATH
220static double round_per_R5RS (double x); 246static double round_per_R5RS (double x);
221#endif 247#endif
222static int is_zero_rvalue (RVALUE x); 248static 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 249
230static num num_zero; 250static num num_zero;
231static num num_one; 251static num num_one;
232 252
233/* macros for cell operations */ 253/* macros for cell operations */
234#define typeflag(p) ((p)->flag + 0) 254#define typeflag(p) ((p)->flag + 0)
235#define set_typeflag(p,v) ((p)->flag = (v)) 255#define set_typeflag(p,v) ((p)->flag = (v))
236#define type(p) (typeflag (p) & T_MASKTYPE) 256#define type(p) (typeflag (p) & T_MASKTYPE)
237 257
238INTERFACE INLINE int 258INTERFACE int
239is_string (pointer p) 259is_string (pointer p)
240{ 260{
241 return type (p) == T_STRING; 261 return type (p) == T_STRING;
242} 262}
243 263
244#define strvalue(p) ((p)->object.string.svalue) 264#define strvalue(p) ((p)->object.string.svalue)
245#define strlength(p) ((p)->object.string.length) 265#define strlength(p) ((p)->object.string.length)
246 266
247INTERFACE int is_list (SCHEME_P_ pointer p);
248INTERFACE INLINE int 267INTERFACE int
249is_vector (pointer p) 268is_vector (pointer p)
250{ 269{
251 return type (p) == T_VECTOR; 270 return type (p) == T_VECTOR;
252} 271}
253 272
254#define vecvalue(p) ((p)->object.vector.vvalue) 273#define vecvalue(p) ((p)->object.vector.vvalue)
255#define veclength(p) ((p)->object.vector.length) 274#define veclength(p) ((p)->object.vector.length)
256INTERFACE void fill_vector (pointer vec, pointer obj); 275INTERFACE void fill_vector (pointer vec, uint32_t start, pointer obj);
257INTERFACE uint32_t vector_length (pointer vec);
258INTERFACE pointer vector_elem (pointer vec, uint32_t ielem); 276INTERFACE pointer vector_get (pointer vec, uint32_t ielem);
259INTERFACE void set_vector_elem (pointer vec, uint32_t ielem, pointer a); 277INTERFACE void vector_set (pointer vec, uint32_t ielem, pointer a);
260 278
261INTERFACE uint32_t 279INTERFACE int
262vector_length (pointer vec) 280is_integer (pointer p)
263{ 281{
264 return vec->object.vector.length; 282 return type (p) == T_INTEGER;
265} 283}
266 284
285/* not the same as in scheme, where integers are (correctly :) reals */
267INTERFACE INLINE int 286INTERFACE int
287is_real (pointer p)
288{
289 return type (p) == T_REAL;
290}
291
292INTERFACE int
268is_number (pointer p) 293is_number (pointer p)
269{ 294{
270 return type (p) == T_NUMBER; 295 return is_integer (p) || is_real (p);
271} 296}
272 297
273INTERFACE INLINE int 298INTERFACE int
274is_integer (pointer p)
275{
276 if (!is_number (p))
277 return 0;
278
279 if (num_is_integer (p) || ivalue (p) == rvalue (p))
280 return 1;
281
282 return 0;
283}
284
285INTERFACE INLINE int
286is_real (pointer p)
287{
288 return is_number (p) && !num_is_fixnum (p->object.number);
289}
290
291INTERFACE INLINE int
292is_character (pointer p) 299is_character (pointer p)
293{ 300{
294 return type (p) == T_CHARACTER; 301 return type (p) == T_CHARACTER;
295} 302}
296 303
297INTERFACE INLINE char * 304INTERFACE char *
298string_value (pointer p) 305string_value (pointer p)
299{ 306{
300 return strvalue (p); 307 return strvalue (p);
301} 308}
302 309
303INLINE num
304nvalue (pointer p)
305{
306 return (p)->object.number;
307}
308
309static IVALUE
310num_get_ivalue (const num n)
311{
312 return num_is_fixnum (n) ? num_ivalue (n) : (IVALUE)num_rvalue (n);
313}
314
315static RVALUE
316num_get_rvalue (const num n)
317{
318 return num_is_fixnum (n) ? (RVALUE)num_ivalue (n) : num_rvalue (n);
319}
320
321INTERFACE IVALUE
322ivalue (pointer p)
323{
324 return num_get_ivalue (p->object.number);
325}
326
327INTERFACE RVALUE
328rvalue (pointer p)
329{
330 return num_get_rvalue (p->object.number);
331}
332
333#define ivalue_unchecked(p) ((p)->object.number.value.ivalue) 310#define ivalue_unchecked(p) (p)->object.ivalue
311#define set_ivalue(p,v) (p)->object.ivalue = (v)
312
334#if USE_REAL 313#if USE_REAL
335# define rvalue_unchecked(p) ((p)->object.number.value.rvalue) 314#define rvalue_unchecked(p) (p)->object.rvalue
336# define set_num_integer(p) (p)->object.number.is_fixnum=1; 315#define set_rvalue(p,v) (p)->object.rvalue = (v)
337# define set_num_real(p) (p)->object.number.is_fixnum=0;
338#else 316#else
339# define rvalue_unchecked(p) ((p)->object.number.value.ivalue) 317#define rvalue_unchecked(p) (p)->object.ivalue
340# define set_num_integer(p) 0 318#define set_rvalue(p,v) (p)->object.ivalue = (v)
341# define set_num_real(p) 0
342#endif 319#endif
320
343INTERFACE long 321INTERFACE long
344charvalue (pointer p) 322charvalue (pointer p)
345{ 323{
346 return ivalue_unchecked (p); 324 return ivalue_unchecked (p);
347} 325}
348 326
349INTERFACE INLINE int 327INTERFACE int
350is_port (pointer p) 328is_port (pointer p)
351{ 329{
352 return type (p) == T_PORT; 330 return type (p) == T_PORT;
353} 331}
354 332
355INTERFACE INLINE int 333INTERFACE int
356is_inport (pointer p) 334is_inport (pointer p)
357{ 335{
358 return is_port (p) && p->object.port->kind & port_input; 336 return is_port (p) && p->object.port->kind & port_input;
359} 337}
360 338
361INTERFACE INLINE int 339INTERFACE int
362is_outport (pointer p) 340is_outport (pointer p)
363{ 341{
364 return is_port (p) && p->object.port->kind & port_output; 342 return is_port (p) && p->object.port->kind & port_output;
365} 343}
366 344
367INTERFACE INLINE int 345INTERFACE int
368is_pair (pointer p) 346is_pair (pointer p)
369{ 347{
370 return type (p) == T_PAIR; 348 return type (p) == T_PAIR;
371} 349}
372 350
373#define car(p) ((p)->object.cons.car + 0) 351#define car(p) ((p)->object.cons.car + 0)
374#define cdr(p) ((p)->object.cons.cdr) /* find_consecutive_cells uses &cdr */ 352#define cdr(p) ((p)->object.cons.cdr + 0)
375 353
376#define caar(p) car (car (p)) 354static pointer caar (pointer p) { return car (car (p)); }
377#define cadr(p) car (cdr (p)) 355static pointer cadr (pointer p) { return car (cdr (p)); }
378#define cdar(p) cdr (car (p)) 356static pointer cdar (pointer p) { return cdr (car (p)); }
379#define cddr(p) cdr (cdr (p)) 357static pointer cddr (pointer p) { return cdr (cdr (p)); }
380 358
381#define cadar(p) car (cdr (car (p))) 359static pointer cadar (pointer p) { return car (cdr (car (p))); }
382#define caddr(p) car (cdr (cdr (p))) 360static pointer caddr (pointer p) { return car (cdr (cdr (p))); }
383#define cdaar(p) cdr (car (car (p))) 361static pointer cdaar (pointer p) { return cdr (car (car (p))); }
384 362
385INTERFACE void 363INTERFACE void
386set_car (pointer p, pointer q) 364set_car (pointer p, pointer q)
387{ 365{
388 p->object.cons.car = q; 366 p->object.cons.car = q;
… …
404pair_cdr (pointer p) 382pair_cdr (pointer p)
405{ 383{
406 return cdr (p); 384 return cdr (p);
407} 385}
408 386
409INTERFACE INLINE int 387INTERFACE int
410is_symbol (pointer p) 388is_symbol (pointer p)
411{ 389{
412 return type (p) == T_SYMBOL; 390 return type (p) == T_SYMBOL;
413} 391}
414 392
415INTERFACE INLINE char * 393INTERFACE char *
416symname (pointer p) 394symname (pointer p)
417{ 395{
418 return strvalue (car (p)); 396 return strvalue (car (p));
419} 397}
420 398
421#if USE_PLIST 399#if USE_PLIST
422SCHEME_EXPORT INLINE int 400SCHEME_EXPORT int
423hasprop (pointer p) 401hasprop (pointer p)
424{ 402{
425 return typeflag (p) & T_SYMBOL; 403 return typeflag (p) & T_SYMBOL;
426} 404}
427 405
428# define symprop(p) cdr(p) 406# define symprop(p) cdr(p)
429#endif 407#endif
430 408
431INTERFACE INLINE int 409INTERFACE int
432is_syntax (pointer p) 410is_syntax (pointer p)
433{ 411{
434 return typeflag (p) & T_SYNTAX; 412 return typeflag (p) & T_SYNTAX;
435} 413}
436 414
437INTERFACE INLINE int 415INTERFACE int
438is_proc (pointer p) 416is_proc (pointer p)
439{ 417{
440 return type (p) == T_PROC; 418 return type (p) == T_PROC;
441} 419}
442 420
443INTERFACE INLINE int 421INTERFACE int
444is_foreign (pointer p) 422is_foreign (pointer p)
445{ 423{
446 return type (p) == T_FOREIGN; 424 return type (p) == T_FOREIGN;
447} 425}
448 426
449INTERFACE INLINE char * 427INTERFACE char *
450syntaxname (pointer p) 428syntaxname (pointer p)
451{ 429{
452 return strvalue (car (p)); 430 return strvalue (car (p));
453} 431}
454 432
455#define procnum(p) ivalue (p) 433#define procnum(p) ivalue_unchecked (p)
456static const char *procname (pointer x); 434static const char *procname (pointer x);
457 435
458INTERFACE INLINE int 436INTERFACE int
459is_closure (pointer p) 437is_closure (pointer p)
460{ 438{
461 return type (p) == T_CLOSURE; 439 return type (p) == T_CLOSURE;
462} 440}
463 441
464INTERFACE INLINE int 442INTERFACE int
465is_macro (pointer p) 443is_macro (pointer p)
466{ 444{
467 return type (p) == T_MACRO; 445 return type (p) == T_MACRO;
468} 446}
469 447
470INTERFACE INLINE pointer 448INTERFACE pointer
471closure_code (pointer p) 449closure_code (pointer p)
472{ 450{
473 return car (p); 451 return car (p);
474} 452}
475 453
476INTERFACE INLINE pointer 454INTERFACE pointer
477closure_env (pointer p) 455closure_env (pointer p)
478{ 456{
479 return cdr (p); 457 return cdr (p);
480} 458}
481 459
482INTERFACE INLINE int 460INTERFACE int
483is_continuation (pointer p) 461is_continuation (pointer p)
484{ 462{
485 return type (p) == T_CONTINUATION; 463 return type (p) == T_CONTINUATION;
486} 464}
487 465
488#define cont_dump(p) cdr (p) 466#define cont_dump(p) cdr (p)
489#define set_cont_dump(p,v) set_cdr ((p), (v)) 467#define set_cont_dump(p,v) set_cdr ((p), (v))
490 468
491/* To do: promise should be forced ONCE only */ 469/* To do: promise should be forced ONCE only */
492INTERFACE INLINE int 470INTERFACE int
493is_promise (pointer p) 471is_promise (pointer p)
494{ 472{
495 return type (p) == T_PROMISE; 473 return type (p) == T_PROMISE;
496} 474}
497 475
498INTERFACE INLINE int 476INTERFACE int
499is_environment (pointer p) 477is_environment (pointer p)
500{ 478{
501 return type (p) == T_ENVIRONMENT; 479 return type (p) == T_ENVIRONMENT;
502} 480}
503 481
… …
509 487
510#define is_mark(p) (typeflag (p) & T_MARK) 488#define is_mark(p) (typeflag (p) & T_MARK)
511#define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK) 489#define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK)
512#define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK) 490#define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK)
513 491
514INTERFACE INLINE int 492INTERFACE int
515is_immutable (pointer p) 493is_immutable (pointer p)
516{ 494{
517 return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING; 495 return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING;
518} 496}
519 497
520INTERFACE INLINE void 498INTERFACE void
521setimmutable (pointer p) 499setimmutable (pointer p)
522{ 500{
523#if USE_ERROR_CHECKING 501#if USE_ERROR_CHECKING
524 set_typeflag (p, typeflag (p) | T_IMMUTABLE); 502 set_typeflag (p, typeflag (p) | T_IMMUTABLE);
525#endif 503#endif
526} 504}
527 505
506/* Result is:
507 proper list: length
508 circular list: -1
509 not even a pair: -2
510 dotted list: -2 minus length before dot
511*/
512INTERFACE int
513list_length (SCHEME_P_ pointer a)
514{
515 int i = 0;
516 pointer slow, fast;
517
518 slow = fast = a;
519
520 while (1)
521 {
522 if (fast == NIL)
523 return i;
524
525 if (!is_pair (fast))
526 return -2 - i;
527
528 fast = cdr (fast);
529 ++i;
530
531 if (fast == NIL)
532 return i;
533
534 if (!is_pair (fast))
535 return -2 - i;
536
537 ++i;
538 fast = cdr (fast);
539
540 /* Safe because we would have already returned if `fast'
541 encountered a non-pair. */
542 slow = cdr (slow);
543
544 if (fast == slow)
545 {
546 /* the fast pointer has looped back around and caught up
547 with the slow pointer, hence the structure is circular,
548 not of finite length, and therefore not a list */
549 return -1;
550 }
551 }
552}
553
554INTERFACE int
555is_list (SCHEME_P_ pointer a)
556{
557 return list_length (SCHEME_A_ a) >= 0;
558}
559
528#if USE_CHAR_CLASSIFIERS 560#if USE_CHAR_CLASSIFIERS
529static INLINE int 561ecb_inline int
530Cisalpha (int c) 562Cisalpha (int c)
531{ 563{
532 return isascii (c) && isalpha (c); 564 return isascii (c) && isalpha (c);
533} 565}
534 566
535static INLINE int 567ecb_inline int
536Cisdigit (int c) 568Cisdigit (int c)
537{ 569{
538 return isascii (c) && isdigit (c); 570 return isascii (c) && isdigit (c);
539} 571}
540 572
541static INLINE int 573ecb_inline int
542Cisspace (int c) 574Cisspace (int c)
543{ 575{
544 return isascii (c) && isspace (c); 576 return isascii (c) && isspace (c);
545} 577}
546 578
547static INLINE int 579ecb_inline int
548Cisupper (int c) 580Cisupper (int c)
549{ 581{
550 return isascii (c) && isupper (c); 582 return isascii (c) && isupper (c);
551} 583}
552 584
553static INLINE int 585ecb_inline int
554Cislower (int c) 586Cislower (int c)
555{ 587{
556 return isascii (c) && islower (c); 588 return isascii (c) && islower (c);
557} 589}
558#endif 590#endif
… …
619#endif 651#endif
620 652
621static int file_push (SCHEME_P_ const char *fname); 653static int file_push (SCHEME_P_ const char *fname);
622static void file_pop (SCHEME_P); 654static void file_pop (SCHEME_P);
623static int file_interactive (SCHEME_P); 655static int file_interactive (SCHEME_P);
624static INLINE int is_one_of (char *s, int c); 656ecb_inline int is_one_of (char *s, int c);
625static int alloc_cellseg (SCHEME_P_ int n); 657static int alloc_cellseg (SCHEME_P_ int n);
626static INLINE pointer get_cell (SCHEME_P_ pointer a, pointer b); 658ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b);
627static void finalize_cell (SCHEME_P_ pointer a); 659static void finalize_cell (SCHEME_P_ pointer a);
628static int count_consecutive_cells (pointer x, int needed); 660static int count_consecutive_cells (pointer x, int needed);
629static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all); 661static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all);
630static pointer mk_number (SCHEME_P_ const num n); 662static pointer mk_number (SCHEME_P_ const num n);
631static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill); 663static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill);
… …
648static int basic_inchar (port *pt); 680static int basic_inchar (port *pt);
649static int inchar (SCHEME_P); 681static int inchar (SCHEME_P);
650static void backchar (SCHEME_P_ int c); 682static void backchar (SCHEME_P_ int c);
651static char *readstr_upto (SCHEME_P_ char *delim); 683static char *readstr_upto (SCHEME_P_ char *delim);
652static pointer readstrexp (SCHEME_P); 684static pointer readstrexp (SCHEME_P);
653static INLINE int skipspace (SCHEME_P); 685ecb_inline int skipspace (SCHEME_P);
654static int token (SCHEME_P); 686static int token (SCHEME_P);
655static void printslashstring (SCHEME_P_ char *s, int len); 687static void printslashstring (SCHEME_P_ char *s, int len);
656static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen); 688static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen);
657static void printatom (SCHEME_P_ pointer l, int f); 689static void printatom (SCHEME_P_ pointer l, int f);
658static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op); 690static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op);
… …
662static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list); 694static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list);
663static pointer revappend (SCHEME_P_ pointer a, pointer b); 695static pointer revappend (SCHEME_P_ pointer a, pointer b);
664static pointer ss_get_cont (SCHEME_P); 696static pointer ss_get_cont (SCHEME_P);
665static void ss_set_cont (SCHEME_P_ pointer cont); 697static void ss_set_cont (SCHEME_P_ pointer cont);
666static void dump_stack_mark (SCHEME_P); 698static void dump_stack_mark (SCHEME_P);
667static pointer opexe_0 (SCHEME_P_ enum scheme_opcodes op); 699static int opexe_0 (SCHEME_P_ enum scheme_opcodes op);
700static int opexe_1 (SCHEME_P_ enum scheme_opcodes op);
668static pointer opexe_2 (SCHEME_P_ enum scheme_opcodes op); 701static int opexe_2 (SCHEME_P_ enum scheme_opcodes op);
669static pointer opexe_3 (SCHEME_P_ enum scheme_opcodes op); 702static int opexe_3 (SCHEME_P_ enum scheme_opcodes op);
670static pointer opexe_4 (SCHEME_P_ enum scheme_opcodes op); 703static int opexe_4 (SCHEME_P_ enum scheme_opcodes op);
671static pointer opexe_5 (SCHEME_P_ enum scheme_opcodes op); 704static int opexe_5 (SCHEME_P_ enum scheme_opcodes op);
672static pointer opexe_6 (SCHEME_P_ enum scheme_opcodes op); 705static int opexe_6 (SCHEME_P_ enum scheme_opcodes op);
673static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op); 706static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op);
674static void assign_syntax (SCHEME_P_ const char *name); 707static void assign_syntax (SCHEME_P_ const char *name);
675static int syntaxnum (pointer p); 708static int syntaxnum (pointer p);
676static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name); 709static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name);
677 710
711static IVALUE
712ivalue (pointer x)
713{
714 return is_integer (x) ? ivalue_unchecked (x) : rvalue_unchecked (x);
715}
716
717static RVALUE
718rvalue (pointer x)
719{
720 return is_integer (x) ? ivalue_unchecked (x) : rvalue_unchecked (x);
721}
722
723INTERFACE num
724nvalue (pointer x)
725{
726 num n;
727
728 num_set_fixnum (n, is_integer (x));
729
730 if (num_is_fixnum (n))
731 num_set_ivalue (n, ivalue_unchecked (x));
732 else
733 num_set_rvalue (n, rvalue_unchecked (x));
734
735 return n;
736}
737
678static num 738static num
679num_add (num a, num b) 739num_op (enum num_op op, num a, num b)
680{ 740{
681 num ret; 741 num ret;
682 742
683 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 743 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
684 744
685 if (num_is_fixnum (ret)) 745 if (num_is_fixnum (ret))
686 num_set_ivalue (ret, num_get_ivalue (a) + num_get_ivalue (b)); 746 {
747 switch (op)
748 {
749 case NUM_ADD: a.ivalue += b.ivalue; break;
750 case NUM_SUB: a.ivalue -= b.ivalue; break;
751 case NUM_MUL: a.ivalue *= b.ivalue; break;
752 case NUM_INTDIV: a.ivalue /= b.ivalue; break;
753 }
754
755 num_set_ivalue (ret, a.ivalue);
756 }
757#if USE_REAL
687 else 758 else
688 num_set_rvalue (ret, num_get_rvalue (a) + num_get_rvalue (b)); 759 {
760 switch (op)
761 {
762 case NUM_ADD: a.rvalue += b.rvalue; break;
763 case NUM_SUB: a.rvalue -= b.rvalue; break;
764 case NUM_MUL: a.rvalue *= b.rvalue; break;
765 case NUM_INTDIV: a.rvalue /= b.rvalue; break;
766 }
689 767
690 return ret; 768 num_set_rvalue (ret, a.rvalue);
691} 769 }
692 770#endif
693static num
694num_mul (num a, num b)
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 771
705 return ret; 772 return ret;
706} 773}
707 774
708static num 775static num
709num_div (num a, num b) 776num_div (num a, num b)
710{ 777{
711 num ret; 778 num ret;
712 779
713 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_get_ivalue (a) % num_get_ivalue (b) == 0); 780 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_ivalue (a) % num_ivalue (b) == 0);
714 781
715 if (num_is_fixnum (ret)) 782 if (num_is_fixnum (ret))
716 num_set_ivalue (ret, num_get_ivalue (a) / num_get_ivalue (b)); 783 num_set_ivalue (ret, num_ivalue (a) / num_ivalue (b));
717 else 784 else
718 num_set_rvalue (ret, num_get_rvalue (a) / num_get_rvalue (b)); 785 num_set_rvalue (ret, num_rvalue (a) / num_rvalue (b));
719
720 return ret;
721}
722
723static 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 786
750 return ret; 787 return ret;
751} 788}
752 789
753static num 790static num
… …
755{ 792{
756 num ret; 793 num ret;
757 long e1, e2, res; 794 long e1, e2, res;
758 795
759 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 796 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
760 e1 = num_get_ivalue (a); 797 e1 = num_ivalue (a);
761 e2 = num_get_ivalue (b); 798 e2 = num_ivalue (b);
762 res = e1 % e2; 799 res = e1 % e2;
763 800
764 /* remainder should have same sign as second operand */ 801 /* remainder should have same sign as second operand */
765 if (res > 0) 802 if (res > 0)
766 { 803 {
… …
782{ 819{
783 num ret; 820 num ret;
784 long e1, e2, res; 821 long e1, e2, res;
785 822
786 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 823 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
787 e1 = num_get_ivalue (a); 824 e1 = num_ivalue (a);
788 e2 = num_get_ivalue (b); 825 e2 = num_ivalue (b);
789 res = e1 % e2; 826 res = e1 % e2;
790 827
791 /* modulo should have same sign as second operand */ 828 /* modulo should have same sign as second operand */
792 if (res * e2 < 0) 829 if (res * e2 < 0)
793 res += e2; 830 res += e2;
794 831
795 num_set_ivalue (ret, res); 832 num_set_ivalue (ret, res);
796 return ret; 833 return ret;
797} 834}
798 835
836/* this completely disrespects NaNs, but r5rs doesn't even allow NaNs */
799static int 837static int
800num_eq (num a, num b) 838num_cmp (num a, num b)
801{ 839{
840 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
802 int ret; 841 int ret;
803 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
804 842
805 if (is_fixnum) 843 if (is_fixnum)
806 ret = num_get_ivalue (a) == num_get_ivalue (b); 844 {
845 IVALUE av = num_ivalue (a);
846 IVALUE bv = num_ivalue (b);
847
848 ret = av == bv ? 0 : av < bv ? -1 : +1;
849 }
807 else 850 else
808 ret = num_get_rvalue (a) == num_get_rvalue (b); 851 {
852 RVALUE av = num_rvalue (a);
853 RVALUE bv = num_rvalue (b);
854
855 ret = av == bv ? 0 : av < bv ? -1 : +1;
856 }
809 857
810 return ret; 858 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} 859}
853 860
854#if USE_MATH 861#if USE_MATH
855 862
856/* Round to nearest. Round to even if midway */ 863/* Round to nearest. Round to even if midway */
… …
866 return ce; 873 return ce;
867 else if (dfl < dce) 874 else if (dfl < dce)
868 return fl; 875 return fl;
869 else 876 else
870 { 877 {
871 if (fmod (fl, 2.0) == 0.0) /* I imagine this holds */ 878 if (fmod (fl, 2) == 0) /* I imagine this holds */
872 return fl; 879 return fl;
873 else 880 else
874 return ce; 881 return ce;
875 } 882 }
876} 883}
877#endif 884#endif
878 885
879static int 886static int
880is_zero_rvalue (RVALUE x) 887is_zero_rvalue (RVALUE x)
881{ 888{
889 return x == 0;
890#if 0
882#if USE_REAL 891#if USE_REAL
883 return x < DBL_MIN && x > -DBL_MIN; /* why the hate of denormals? this should be == 0. */ 892 return x < DBL_MIN && x > -DBL_MIN; /* why the hate of denormals? this should be == 0. */
884#else 893#else
885 return x == 0; 894 return x == 0;
895#endif
886#endif 896#endif
887} 897}
888 898
889/* allocate new cell segment */ 899/* allocate new cell segment */
890static int 900static int
… …
911 return k; 921 return k;
912 922
913 i = ++SCHEME_V->last_cell_seg; 923 i = ++SCHEME_V->last_cell_seg;
914 SCHEME_V->alloc_seg[i] = cp; 924 SCHEME_V->alloc_seg[i] = cp;
915 925
916 /* insert new segment in address order */
917 newp = (pointer)cp; 926 newp = (pointer)cp;
918 SCHEME_V->cell_seg[i] = newp; 927 SCHEME_V->cell_seg[i] = newp;
919 SCHEME_V->cell_segsize[i] = segsize; 928 SCHEME_V->cell_segsize[i] = segsize;
920
921 //TODO: insert, not swap
922 while (i > 0 && SCHEME_V->cell_seg[i - 1] > SCHEME_V->cell_seg[i])
923 {
924 p = SCHEME_V->cell_seg[i];
925 SCHEME_V->cell_seg[i] = SCHEME_V->cell_seg[i - 1];
926 SCHEME_V->cell_seg[i - 1] = p;
927
928 k = SCHEME_V->cell_segsize[i];
929 SCHEME_V->cell_segsize[i] = SCHEME_V->cell_segsize[i - 1];
930 SCHEME_V->cell_segsize[i - 1] = k;
931
932 --i;
933 }
934
935 SCHEME_V->fcells += segsize; 929 SCHEME_V->fcells += segsize;
936 last = newp + segsize - 1; 930 last = newp + segsize - 1;
937 931
938 for (p = newp; p <= last; p++) 932 for (p = newp; p <= last; p++)
939 { 933 {
940 set_typeflag (p, T_FREE); 934 set_typeflag (p, T_PAIR);
941 set_car (p, NIL); 935 set_car (p, NIL);
942 set_cdr (p, p + 1); 936 set_cdr (p, p + 1);
943 } 937 }
944 938
945 /* insert new cells in address order on free list */
946 if (SCHEME_V->free_cell == NIL || p < SCHEME_V->free_cell)
947 {
948 set_cdr (last, SCHEME_V->free_cell); 939 set_cdr (last, SCHEME_V->free_cell);
949 SCHEME_V->free_cell = newp; 940 SCHEME_V->free_cell = newp;
950 }
951 else
952 {
953 p = SCHEME_V->free_cell;
954
955 while (cdr (p) != NIL && newp > cdr (p))
956 p = cdr (p);
957
958 set_cdr (last, cdr (p));
959 set_cdr (p, newp);
960 }
961 } 941 }
962 942
963 return n; 943 return n;
964} 944}
965 945
966/* get new cell. parameter a, b is marked by gc. */ 946/* get new cell. parameter a, b is marked by gc. */
967static INLINE pointer 947ecb_inline pointer
968get_cell_x (SCHEME_P_ pointer a, pointer b) 948get_cell_x (SCHEME_P_ pointer a, pointer b)
969{ 949{
970 if (SCHEME_V->free_cell == NIL) 950 if (ecb_expect_false (SCHEME_V->free_cell == NIL))
971 { 951 {
972 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 952 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
973 return S_SINK; 953 return S_SINK;
974 954
975 if (SCHEME_V->free_cell == NIL) 955 if (SCHEME_V->free_cell == NIL)
… …
1044 /* Record it as a vector so that gc understands it. */ 1024 /* Record it as a vector so that gc understands it. */
1045 set_typeflag (v, T_VECTOR | T_ATOM); 1025 set_typeflag (v, T_VECTOR | T_ATOM);
1046 1026
1047 v->object.vector.vvalue = e; 1027 v->object.vector.vvalue = e;
1048 v->object.vector.length = len; 1028 v->object.vector.length = len;
1049 fill_vector (v, init); 1029 fill_vector (v, 0, init);
1050 push_recent_alloc (SCHEME_A_ v, NIL); 1030 push_recent_alloc (SCHEME_A_ v, NIL);
1051 1031
1052 return v; 1032 return v;
1053} 1033}
1054 1034
1055static INLINE void 1035ecb_inline void
1056ok_to_freely_gc (SCHEME_P) 1036ok_to_freely_gc (SCHEME_P)
1057{ 1037{
1058 set_car (S_SINK, NIL); 1038 set_car (S_SINK, NIL);
1059} 1039}
1060 1040
… …
1120 pointer x = immutable_cons (mk_string (SCHEME_A_ name), NIL); 1100 pointer x = immutable_cons (mk_string (SCHEME_A_ name), NIL);
1121 set_typeflag (x, T_SYMBOL); 1101 set_typeflag (x, T_SYMBOL);
1122 setimmutable (car (x)); 1102 setimmutable (car (x));
1123 1103
1124 location = hash_fn (name, veclength (SCHEME_V->oblist)); 1104 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))); 1105 vector_set (SCHEME_V->oblist, location, immutable_cons (x, vector_get (SCHEME_V->oblist, location)));
1126 return x; 1106 return x;
1127} 1107}
1128 1108
1129static INLINE pointer 1109ecb_inline pointer
1130oblist_find_by_name (SCHEME_P_ const char *name) 1110oblist_find_by_name (SCHEME_P_ const char *name)
1131{ 1111{
1132 int location; 1112 int location;
1133 pointer x; 1113 pointer x;
1134 char *s; 1114 char *s;
1135 1115
1136 location = hash_fn (name, veclength (SCHEME_V->oblist)); 1116 location = hash_fn (name, veclength (SCHEME_V->oblist));
1137 1117
1138 for (x = vector_elem (SCHEME_V->oblist, location); x != NIL; x = cdr (x)) 1118 for (x = vector_get (SCHEME_V->oblist, location); x != NIL; x = cdr (x))
1139 { 1119 {
1140 s = symname (car (x)); 1120 s = symname (car (x));
1141 1121
1142 /* case-insensitive, per R5RS section 2 */ 1122 /* case-insensitive, per R5RS section 2 */
1143 if (stricmp (name, s) == 0) 1123 if (stricmp (name, s) == 0)
… …
1153 int i; 1133 int i;
1154 pointer x; 1134 pointer x;
1155 pointer ob_list = NIL; 1135 pointer ob_list = NIL;
1156 1136
1157 for (i = 0; i < veclength (SCHEME_V->oblist); i++) 1137 for (i = 0; i < veclength (SCHEME_V->oblist); i++)
1158 for (x = vector_elem (SCHEME_V->oblist, i); x != NIL; x = cdr (x)) 1138 for (x = vector_get (SCHEME_V->oblist, i); x != NIL; x = cdr (x))
1159 ob_list = cons (x, ob_list); 1139 ob_list = cons (x, ob_list);
1160 1140
1161 return ob_list; 1141 return ob_list;
1162} 1142}
1163 1143
… …
1167oblist_initial_value (SCHEME_P) 1147oblist_initial_value (SCHEME_P)
1168{ 1148{
1169 return NIL; 1149 return NIL;
1170} 1150}
1171 1151
1172static INLINE pointer 1152ecb_inline pointer
1173oblist_find_by_name (SCHEME_P_ const char *name) 1153oblist_find_by_name (SCHEME_P_ const char *name)
1174{ 1154{
1175 pointer x; 1155 pointer x;
1176 char *s; 1156 char *s;
1177 1157
… …
1236mk_character (SCHEME_P_ int c) 1216mk_character (SCHEME_P_ int c)
1237{ 1217{
1238 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1218 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1239 1219
1240 set_typeflag (x, (T_CHARACTER | T_ATOM)); 1220 set_typeflag (x, (T_CHARACTER | T_ATOM));
1241 ivalue_unchecked (x) = c & 0xff; 1221 set_ivalue (x, c & 0xff);
1242 set_num_integer (x); 1222
1243 return x; 1223 return x;
1244} 1224}
1245 1225
1246/* get number atom (integer) */ 1226/* get number atom (integer) */
1247INTERFACE pointer 1227INTERFACE pointer
1248mk_integer (SCHEME_P_ long num) 1228mk_integer (SCHEME_P_ long n)
1249{ 1229{
1250 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1230 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1251 1231
1252 set_typeflag (x, (T_NUMBER | T_ATOM)); 1232 set_typeflag (x, (T_INTEGER | T_ATOM));
1253 ivalue_unchecked (x) = num; 1233 set_ivalue (x, n);
1254 set_num_integer (x); 1234
1255 return x; 1235 return x;
1256} 1236}
1257 1237
1258INTERFACE pointer 1238INTERFACE pointer
1259mk_real (SCHEME_P_ RVALUE n) 1239mk_real (SCHEME_P_ RVALUE n)
1260{ 1240{
1241#if USE_REAL
1261 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1242 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1262 1243
1263 set_typeflag (x, (T_NUMBER | T_ATOM)); 1244 set_typeflag (x, (T_REAL | T_ATOM));
1264 rvalue_unchecked (x) = n; 1245 set_rvalue (x, n);
1265 set_num_real (x); 1246
1266 return x; 1247 return x;
1248#else
1249 return mk_integer (SCHEME_A_ n);
1250#endif
1267} 1251}
1268 1252
1269static pointer 1253static pointer
1270mk_number (SCHEME_P_ const num n) 1254mk_number (SCHEME_P_ const num n)
1271{ 1255{
1256#if USE_REAL
1272 if (num_is_fixnum (n)) 1257 return num_is_fixnum (n)
1258 ? mk_integer (SCHEME_A_ num_ivalue (n))
1259 : mk_real (SCHEME_A_ num_rvalue (n));
1260#else
1273 return mk_integer (SCHEME_A_ num_get_ivalue (n)); 1261 return mk_integer (SCHEME_A_ num_ivalue (n));
1274 else 1262#endif
1275 return mk_real (SCHEME_A_ num_get_rvalue (n));
1276} 1263}
1277 1264
1278/* allocate name to string area */ 1265/* allocate name to string area */
1279static char * 1266static char *
1280store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill) 1267store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill)
… …
1339{ 1326{
1340 return get_vector_object (SCHEME_A_ len, NIL); 1327 return get_vector_object (SCHEME_A_ len, NIL);
1341} 1328}
1342 1329
1343INTERFACE void 1330INTERFACE void
1344fill_vector (pointer vec, pointer obj) 1331fill_vector (pointer vec, uint32_t start, pointer obj)
1345{ 1332{
1346 int i; 1333 int i;
1347 1334
1348 for (i = 0; i < vec->object.vector.length; i++) 1335 for (i = start; i < veclength (vec); i++)
1349 vecvalue (vec)[i] = obj; 1336 vecvalue (vec)[i] = obj;
1350} 1337}
1351 1338
1352INTERFACE pointer 1339INTERFACE pointer
1353vector_elem (pointer vec, uint32_t ielem) 1340vector_get (pointer vec, uint32_t ielem)
1354{ 1341{
1355 return vecvalue(vec)[ielem]; 1342 return vecvalue(vec)[ielem];
1356} 1343}
1357 1344
1358INTERFACE void 1345INTERFACE void
1359set_vector_elem (pointer vec, uint32_t ielem, pointer a) 1346vector_set (pointer vec, uint32_t ielem, pointer a)
1360{ 1347{
1361 vecvalue(vec)[ielem] = a; 1348 vecvalue(vec)[ielem] = a;
1362} 1349}
1363 1350
1364/* get new symbol */ 1351/* get new symbol */
… …
1456 } 1443 }
1457 else if ((c == 'e') || (c == 'E')) 1444 else if ((c == 'e') || (c == 'E'))
1458 { 1445 {
1459 if (!has_fp_exp) 1446 if (!has_fp_exp)
1460 { 1447 {
1461 has_dec_point = 1; /* decimal point illegal 1448 has_dec_point = 1; /* decimal point illegal from now on */
1462 from now on */
1463 p++; 1449 p++;
1464 1450
1465 if ((*p == '-') || (*p == '+') || isdigit (*p)) 1451 if ((*p == '-') || (*p == '+') || isdigit (*p))
1466 continue; 1452 continue;
1467 } 1453 }
… …
1481 1467
1482/* make constant */ 1468/* make constant */
1483static pointer 1469static pointer
1484mk_sharp_const (SCHEME_P_ char *name) 1470mk_sharp_const (SCHEME_P_ char *name)
1485{ 1471{
1486 long x;
1487 char tmp[STRBUFFSIZE];
1488
1489 if (!strcmp (name, "t")) 1472 if (!strcmp (name, "t"))
1490 return S_T; 1473 return S_T;
1491 else if (!strcmp (name, "f")) 1474 else if (!strcmp (name, "f"))
1492 return S_F; 1475 return S_F;
1493 else if (*name == '\\') /* #\w (character) */ 1476 else if (*name == '\\') /* #\w (character) */
1494 { 1477 {
1495 int c = 0; 1478 int c;
1496 1479
1497 if (stricmp (name + 1, "space") == 0) 1480 if (stricmp (name + 1, "space") == 0)
1498 c = ' '; 1481 c = ' ';
1499 else if (stricmp (name + 1, "newline") == 0) 1482 else if (stricmp (name + 1, "newline") == 0)
1500 c = '\n'; 1483 c = '\n';
… …
1502 c = '\r'; 1485 c = '\r';
1503 else if (stricmp (name + 1, "tab") == 0) 1486 else if (stricmp (name + 1, "tab") == 0)
1504 c = '\t'; 1487 c = '\t';
1505 else if (name[1] == 'x' && name[2] != 0) 1488 else if (name[1] == 'x' && name[2] != 0)
1506 { 1489 {
1507 int c1 = strtol (name + 2, 0, 16); 1490 long c1 = strtol (name + 2, 0, 16);
1508 1491
1509 if (c1 <= UCHAR_MAX) 1492 if (0 <= c1 && c1 <= UCHAR_MAX)
1510 c = c1; 1493 c = c1;
1511 else 1494 else
1512 return NIL; 1495 return NIL;
1513 1496 }
1514#if USE_ASCII_NAMES 1497#if USE_ASCII_NAMES
1515 }
1516 else if (is_ascii_name (name + 1, &c)) 1498 else if (is_ascii_name (name + 1, &c))
1517 {
1518 /* nothing */ 1499 /* nothing */;
1519#endif 1500#endif
1520 }
1521 else if (name[2] == 0) 1501 else if (name[2] == 0)
1522 c = name[1]; 1502 c = name[1];
1523 else 1503 else
1524 return NIL; 1504 return NIL;
1525 1505
… …
1542 1522
1543/*-- 1523/*--
1544 * We use algorithm E (Knuth, The Art of Computer Programming Vol.1, 1524 * We use algorithm E (Knuth, The Art of Computer Programming Vol.1,
1545 * sec. 2.3.5), the Schorr-Deutsch-Waite link-inversion algorithm, 1525 * sec. 2.3.5), the Schorr-Deutsch-Waite link-inversion algorithm,
1546 * for marking. 1526 * for marking.
1527 *
1528 * The exception is vectors - vectors are currently marked recursively,
1529 * which is inherited form tinyscheme and could be fixed by having another
1530 * word of context in the vector
1547 */ 1531 */
1548static void 1532static void
1549mark (pointer a) 1533mark (pointer a)
1550{ 1534{
1551 pointer t, q, p; 1535 pointer t, q, p;
… …
1553 t = 0; 1537 t = 0;
1554 p = a; 1538 p = a;
1555E2: 1539E2:
1556 setmark (p); 1540 setmark (p);
1557 1541
1558 if (is_vector (p)) 1542 if (ecb_expect_false (is_vector (p)))
1559 { 1543 {
1560 int i; 1544 int i;
1561 1545
1562 for (i = 0; i < p->object.vector.length; i++) 1546 for (i = 0; i < veclength (p); i++)
1563 mark (vecvalue (p)[i]); 1547 mark (vecvalue (p)[i]);
1564 } 1548 }
1565 1549
1566 if (is_atom (p)) 1550 if (is_atom (p))
1567 goto E6; 1551 goto E6;
… …
1665 if (is_mark (p)) 1649 if (is_mark (p))
1666 clrmark (p); 1650 clrmark (p);
1667 else 1651 else
1668 { 1652 {
1669 /* reclaim cell */ 1653 /* reclaim cell */
1670 if (typeflag (p) != T_FREE) 1654 if (typeflag (p) != T_PAIR)
1671 { 1655 {
1672 finalize_cell (SCHEME_A_ p); 1656 finalize_cell (SCHEME_A_ p);
1673 set_typeflag (p, T_FREE); 1657 set_typeflag (p, T_PAIR);
1674 set_car (p, NIL); 1658 set_car (p, NIL);
1675 } 1659 }
1676 1660
1677 ++SCHEME_V->fcells; 1661 ++SCHEME_V->fcells;
1678 set_cdr (p, SCHEME_V->free_cell); 1662 set_cdr (p, SCHEME_V->free_cell);
… …
1680 } 1664 }
1681 } 1665 }
1682 } 1666 }
1683 1667
1684 if (SCHEME_V->gc_verbose) 1668 if (SCHEME_V->gc_verbose)
1669 {
1685 xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" cells were recovered.\n"); 1670 xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" cells were recovered.\n");
1671 }
1686} 1672}
1687 1673
1688static void 1674static void
1689finalize_cell (SCHEME_P_ pointer a) 1675finalize_cell (SCHEME_P_ pointer a)
1690{ 1676{
1677 /* TODO, fast bitmap check? */
1691 if (is_string (a)) 1678 if (is_string (a))
1692 free (strvalue (a)); 1679 free (strvalue (a));
1693 else if (is_vector (a)) 1680 else if (is_vector (a))
1694 free (vecvalue (a)); 1681 free (vecvalue (a));
1695#if USE_PORTS 1682#if USE_PORTS
… …
2276 } 2263 }
2277 } 2264 }
2278} 2265}
2279 2266
2280/* check c is in chars */ 2267/* check c is in chars */
2281static INLINE int 2268ecb_inline int
2282is_one_of (char *s, int c) 2269is_one_of (char *s, int c)
2283{ 2270{
2284 if (c == EOF) 2271 if (c == EOF)
2285 return 1; 2272 return 1;
2286 2273
2287 return !!strchr (s, c); 2274 return !!strchr (s, c);
2288} 2275}
2289 2276
2290/* skip white characters */ 2277/* skip white characters */
2291static INLINE int 2278ecb_inline int
2292skipspace (SCHEME_P) 2279skipspace (SCHEME_P)
2293{ 2280{
2294 int c, curr_line = 0; 2281 int c, curr_line = 0;
2295 2282
2296 do 2283 do
… …
2524 { 2511 {
2525 p = SCHEME_V->strbuff; 2512 p = SCHEME_V->strbuff;
2526 2513
2527 if (f <= 1 || f == 10) /* f is the base for numbers if > 1 */ 2514 if (f <= 1 || f == 10) /* f is the base for numbers if > 1 */
2528 { 2515 {
2529 if (num_is_integer (l)) 2516 if (is_integer (l))
2530 xnum (p, ivalue_unchecked (l)); 2517 xnum (p, ivalue_unchecked (l));
2531#if USE_REAL 2518#if USE_REAL
2532 else 2519 else
2533 { 2520 {
2534 snprintf (p, STRBUFFSIZE, "%.10g", rvalue_unchecked (l)); 2521 snprintf (p, STRBUFFSIZE, "%.10g", rvalue_unchecked (l));
… …
2789 return 0; 2776 return 0;
2790 } 2777 }
2791 else if (is_number (a)) 2778 else if (is_number (a))
2792 { 2779 {
2793 if (is_number (b)) 2780 if (is_number (b))
2794 if (num_is_integer (a) == num_is_integer (b))
2795 return num_eq (nvalue (a), nvalue (b)); 2781 return num_cmp (nvalue (a), nvalue (b)) == 0;
2796 2782
2797 return 0; 2783 return 0;
2798 } 2784 }
2799 else if (is_character (a)) 2785 else if (is_character (a))
2800 { 2786 {
… …
2867 2853
2868 SCHEME_V->envir = immutable_cons (new_frame, old_env); 2854 SCHEME_V->envir = immutable_cons (new_frame, old_env);
2869 setenvironment (SCHEME_V->envir); 2855 setenvironment (SCHEME_V->envir);
2870} 2856}
2871 2857
2872static INLINE void 2858ecb_inline void
2873new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) 2859new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
2874{ 2860{
2875 pointer slot = immutable_cons (variable, value); 2861 pointer slot = immutable_cons (variable, value);
2876 2862
2877 if (is_vector (car (env))) 2863 if (is_vector (car (env)))
2878 { 2864 {
2879 int location = hash_fn (symname (variable), veclength (car (env))); 2865 int location = hash_fn (symname (variable), veclength (car (env)));
2880 2866
2881 set_vector_elem (car (env), location, immutable_cons (slot, vector_elem (car (env), location))); 2867 vector_set (car (env), location, immutable_cons (slot, vector_get (car (env), location)));
2882 } 2868 }
2883 else 2869 else
2884 set_car (env, immutable_cons (slot, car (env))); 2870 set_car (env, immutable_cons (slot, car (env)));
2885} 2871}
2886 2872
… …
2893 for (x = env; x != NIL; x = cdr (x)) 2879 for (x = env; x != NIL; x = cdr (x))
2894 { 2880 {
2895 if (is_vector (car (x))) 2881 if (is_vector (car (x)))
2896 { 2882 {
2897 location = hash_fn (symname (hdl), veclength (car (x))); 2883 location = hash_fn (symname (hdl), veclength (car (x)));
2898 y = vector_elem (car (x), location); 2884 y = vector_get (car (x), location);
2899 } 2885 }
2900 else 2886 else
2901 y = car (x); 2887 y = car (x);
2902 2888
2903 for (; y != NIL; y = cdr (y)) 2889 for (; y != NIL; y = cdr (y))
2904 if (caar (y) == hdl) 2890 if (caar (y) == hdl)
2905 break; 2891 break;
2906 2892
2907 if (y != NIL) 2893 if (y != NIL)
2894 return car (y);
2895
2896 if (!all)
2908 break; 2897 break;
2909
2910 if (!all)
2911 return NIL;
2912 } 2898 }
2913
2914 if (x != NIL)
2915 return car (y);
2916 2899
2917 return NIL; 2900 return NIL;
2918} 2901}
2919 2902
2920#else /* USE_ALIST_ENV */ 2903#else /* USE_ALIST_ENV */
2921 2904
2922static INLINE void 2905ecb_inline void
2923new_frame_in_env (SCHEME_P_ pointer old_env) 2906new_frame_in_env (SCHEME_P_ pointer old_env)
2924{ 2907{
2925 SCHEME_V->envir = immutable_cons (NIL, old_env); 2908 SCHEME_V->envir = immutable_cons (NIL, old_env);
2926 setenvironment (SCHEME_V->envir); 2909 setenvironment (SCHEME_V->envir);
2927} 2910}
2928 2911
2929static INLINE void 2912ecb_inline void
2930new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) 2913new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
2931{ 2914{
2932 set_car (env, immutable_cons (immutable_cons (variable, value), car (env))); 2915 set_car (env, immutable_cons (immutable_cons (variable, value), car (env)));
2933} 2916}
2934 2917
… …
2956 return NIL; 2939 return NIL;
2957} 2940}
2958 2941
2959#endif /* USE_ALIST_ENV else */ 2942#endif /* USE_ALIST_ENV else */
2960 2943
2961static INLINE void 2944ecb_inline void
2962new_slot_in_env (SCHEME_P_ pointer variable, pointer value) 2945new_slot_in_env (SCHEME_P_ pointer variable, pointer value)
2963{ 2946{
2964 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value); 2947 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value);
2965} 2948}
2966 2949
2967static INLINE void 2950ecb_inline void
2968set_slot_in_env (SCHEME_P_ pointer slot, pointer value) 2951set_slot_in_env (SCHEME_P_ pointer slot, pointer value)
2969{ 2952{
2970 set_cdr (slot, value); 2953 set_cdr (slot, value);
2971} 2954}
2972 2955
2973static INLINE pointer 2956ecb_inline pointer
2974slot_value_in_env (pointer slot) 2957slot_value_in_env (pointer slot)
2975{ 2958{
2976 return cdr (slot); 2959 return cdr (slot);
2977} 2960}
2978 2961
2979/* ========== Evaluation Cycle ========== */ 2962/* ========== Evaluation Cycle ========== */
2980 2963
2981static pointer 2964static int
2982xError_1 (SCHEME_P_ const char *s, pointer a) 2965xError_1 (SCHEME_P_ const char *s, pointer a)
2983{ 2966{
2984#if USE_ERROR_HOOK 2967#if USE_ERROR_HOOK
2985 pointer x; 2968 pointer x;
2986 pointer hdl = SCHEME_V->ERROR_HOOK; 2969 pointer hdl = SCHEME_V->ERROR_HOOK;
… …
3021 code = cons (mk_string (SCHEME_A_ s), code); 3004 code = cons (mk_string (SCHEME_A_ s), code);
3022 setimmutable (car (code)); 3005 setimmutable (car (code));
3023 SCHEME_V->code = cons (slot_value_in_env (x), code); 3006 SCHEME_V->code = cons (slot_value_in_env (x), code);
3024 SCHEME_V->op = OP_EVAL; 3007 SCHEME_V->op = OP_EVAL;
3025 3008
3026 return S_T; 3009 return 0;
3027 } 3010 }
3028#endif 3011#endif
3029 3012
3030 if (a) 3013 if (a)
3031 SCHEME_V->args = cons (a, NIL); 3014 SCHEME_V->args = cons (a, NIL);
… …
3033 SCHEME_V->args = NIL; 3016 SCHEME_V->args = NIL;
3034 3017
3035 SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args); 3018 SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args);
3036 setimmutable (car (SCHEME_V->args)); 3019 setimmutable (car (SCHEME_V->args));
3037 SCHEME_V->op = OP_ERR0; 3020 SCHEME_V->op = OP_ERR0;
3021
3038 return S_T; 3022 return 0;
3039} 3023}
3040 3024
3041#define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a) 3025#define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a)
3042#define Error_0(s) Error_1 (s, 0) 3026#define Error_0(s) Error_1 (s, 0)
3043 3027
3044/* Too small to turn into function */ 3028/* Too small to turn into function */
3045#define BEGIN do { 3029#define BEGIN do {
3046#define END } while (0) 3030#define END } while (0)
3047#define s_goto(a) BEGIN \ 3031#define s_goto(a) BEGIN \
3048 SCHEME_V->op = a; \ 3032 SCHEME_V->op = a; \
3049 return S_T; END 3033 return 0; END
3050 3034
3051#define s_return(a) return xs_return (SCHEME_A_ a) 3035#define s_return(a) return xs_return (SCHEME_A_ a)
3052 3036
3053#ifndef USE_SCHEME_STACK 3037#ifndef USE_SCHEME_STACK
3054 3038
… …
3079 next_frame = SCHEME_V->dump_base + nframes; 3063 next_frame = SCHEME_V->dump_base + nframes;
3080 3064
3081 next_frame->op = op; 3065 next_frame->op = op;
3082 next_frame->args = args; 3066 next_frame->args = args;
3083 next_frame->envir = SCHEME_V->envir; 3067 next_frame->envir = SCHEME_V->envir;
3084 next_frame->code = code; 3068 next_frame->code = code;
3085 3069
3086 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1); 3070 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1);
3087} 3071}
3088 3072
3089static pointer 3073static int
3090xs_return (SCHEME_P_ pointer a) 3074xs_return (SCHEME_P_ pointer a)
3091{ 3075{
3092 int nframes = (uintptr_t)SCHEME_V->dump; 3076 int nframes = (uintptr_t)SCHEME_V->dump;
3093 struct dump_stack_frame *frame; 3077 struct dump_stack_frame *frame;
3094 3078
3095 SCHEME_V->value = a; 3079 SCHEME_V->value = a;
3096 3080
3097 if (nframes <= 0) 3081 if (nframes <= 0)
3098 return NIL; 3082 return -1;
3099 3083
3100 frame = &SCHEME_V->dump_base[--nframes]; 3084 frame = &SCHEME_V->dump_base[--nframes];
3101 SCHEME_V->op = frame->op; 3085 SCHEME_V->op = frame->op;
3102 SCHEME_V->args = frame->args; 3086 SCHEME_V->args = frame->args;
3103 SCHEME_V->envir = frame->envir; 3087 SCHEME_V->envir = frame->envir;
3104 SCHEME_V->code = frame->code; 3088 SCHEME_V->code = frame->code;
3105 SCHEME_V->dump = (pointer)(uintptr_t)nframes; 3089 SCHEME_V->dump = (pointer)(uintptr_t)nframes;
3106 3090
3107 return S_T; 3091 return 0;
3108} 3092}
3109 3093
3110static INLINE void 3094ecb_inline void
3111dump_stack_reset (SCHEME_P) 3095dump_stack_reset (SCHEME_P)
3112{ 3096{
3113 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */ 3097 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */
3114 SCHEME_V->dump = (pointer)+0; 3098 SCHEME_V->dump = (pointer)+0;
3115} 3099}
3116 3100
3117static INLINE void 3101ecb_inline void
3118dump_stack_initialize (SCHEME_P) 3102dump_stack_initialize (SCHEME_P)
3119{ 3103{
3120 SCHEME_V->dump_size = 0; 3104 SCHEME_V->dump_size = 0;
3121 SCHEME_V->dump_base = 0; 3105 SCHEME_V->dump_base = 0;
3122 dump_stack_reset (SCHEME_A); 3106 dump_stack_reset (SCHEME_A);
… …
3175 int i = 0; 3159 int i = 0;
3176 struct dump_stack_frame *frame = SCHEME_V->dump_base; 3160 struct dump_stack_frame *frame = SCHEME_V->dump_base;
3177 3161
3178 while (cont != NIL) 3162 while (cont != NIL)
3179 { 3163 {
3180 frame->op = ivalue (car (cont)); cont = cdr (cont); 3164 frame->op = ivalue_unchecked (car (cont)); cont = cdr (cont);
3181 frame->args = car (cont) ; cont = cdr (cont); 3165 frame->args = car (cont) ; cont = cdr (cont);
3182 frame->envir = car (cont) ; cont = cdr (cont); 3166 frame->envir = car (cont) ; cont = cdr (cont);
3183 frame->code = car (cont) ; cont = cdr (cont); 3167 frame->code = car (cont) ; cont = cdr (cont);
3184 3168
3185 ++frame; 3169 ++frame;
3186 ++i; 3170 ++i;
3187 } 3171 }
3188 3172
3189 SCHEME_V->dump = (pointer)(uintptr_t)i; 3173 SCHEME_V->dump = (pointer)(uintptr_t)i;
3190} 3174}
3191 3175
3192#else 3176#else
3193 3177
3194static INLINE void 3178ecb_inline void
3195dump_stack_reset (SCHEME_P) 3179dump_stack_reset (SCHEME_P)
3196{ 3180{
3197 SCHEME_V->dump = NIL; 3181 SCHEME_V->dump = NIL;
3198} 3182}
3199 3183
3200static INLINE void 3184ecb_inline void
3201dump_stack_initialize (SCHEME_P) 3185dump_stack_initialize (SCHEME_P)
3202{ 3186{
3203 dump_stack_reset (SCHEME_A); 3187 dump_stack_reset (SCHEME_A);
3204} 3188}
3205 3189
… …
3207dump_stack_free (SCHEME_P) 3191dump_stack_free (SCHEME_P)
3208{ 3192{
3209 SCHEME_V->dump = NIL; 3193 SCHEME_V->dump = NIL;
3210} 3194}
3211 3195
3212static pointer 3196static int
3213xs_return (SCHEME_P_ pointer a) 3197xs_return (SCHEME_P_ pointer a)
3214{ 3198{
3215 pointer dump = SCHEME_V->dump; 3199 pointer dump = SCHEME_V->dump;
3216 3200
3217 SCHEME_V->value = a; 3201 SCHEME_V->value = a;
3218 3202
3219 if (dump == NIL) 3203 if (dump == NIL)
3220 return NIL; 3204 return -1;
3221 3205
3222 SCHEME_V->op = ivalue (car (dump)); dump = cdr (dump); 3206 SCHEME_V->op = ivalue_unchecked (car (dump)); dump = cdr (dump);
3223 SCHEME_V->args = car (dump) ; dump = cdr (dump); 3207 SCHEME_V->args = car (dump) ; dump = cdr (dump);
3224 SCHEME_V->envir = car (dump) ; dump = cdr (dump); 3208 SCHEME_V->envir = car (dump) ; dump = cdr (dump);
3225 SCHEME_V->code = car (dump) ; dump = cdr (dump); 3209 SCHEME_V->code = car (dump) ; dump = cdr (dump);
3226 3210
3227 SCHEME_V->dump = dump; 3211 SCHEME_V->dump = dump;
3228 3212
3229 return S_T; 3213 return 0;
3230} 3214}
3231 3215
3232static void 3216static void
3233s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code) 3217s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code)
3234{ 3218{
… …
3259 3243
3260#endif 3244#endif
3261 3245
3262#define s_retbool(tf) s_return ((tf) ? S_T : S_F) 3246#define s_retbool(tf) s_return ((tf) ? S_T : S_F)
3263 3247
3264static pointer 3248static int
3265opexe_0 (SCHEME_P_ enum scheme_opcodes op) 3249opexe_0 (SCHEME_P_ enum scheme_opcodes op)
3266{ 3250{
3251 pointer args = SCHEME_V->args;
3267 pointer x, y; 3252 pointer x, y;
3268 3253
3269 switch (op) 3254 switch (op)
3270 { 3255 {
3271 case OP_LOAD: /* load */ 3256 case OP_LOAD: /* load */
3272 if (file_interactive (SCHEME_A)) 3257 if (file_interactive (SCHEME_A))
3273 { 3258 {
3274 xwrstr ("Loading "); xwrstr (strvalue (car (SCHEME_V->args))); xwrstr ("\n"); 3259 xwrstr ("Loading "); xwrstr (strvalue (car (args))); xwrstr ("\n");
3275 //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (SCHEME_V->args))); 3260 //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args)));
3276 } 3261 }
3277 3262
3278 if (!file_push (SCHEME_A_ strvalue (car (SCHEME_V->args)))) 3263 if (!file_push (SCHEME_A_ strvalue (car (args))))
3279 Error_1 ("unable to open", car (SCHEME_V->args)); 3264 Error_1 ("unable to open", car (args));
3280 else 3265 else
3281 { 3266 {
3282 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i); 3267 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i);
3283 s_goto (OP_T0LVL); 3268 s_goto (OP_T0LVL);
3284 } 3269 }
… …
3358 case OP_EVAL: /* main part of evaluation */ 3343 case OP_EVAL: /* main part of evaluation */
3359#if USE_TRACING 3344#if USE_TRACING
3360 if (SCHEME_V->tracing) 3345 if (SCHEME_V->tracing)
3361 { 3346 {
3362 /*s_save(SCHEME_A_ OP_VALUEPRINT,NIL,NIL); */ 3347 /*s_save(SCHEME_A_ OP_VALUEPRINT,NIL,NIL); */
3363 s_save (SCHEME_A_ OP_REAL_EVAL, SCHEME_V->args, SCHEME_V->code); 3348 s_save (SCHEME_A_ OP_REAL_EVAL, args, SCHEME_V->code);
3364 SCHEME_V->args = SCHEME_V->code; 3349 SCHEME_V->args = SCHEME_V->code;
3365 putstr (SCHEME_A_ "\nEval: "); 3350 putstr (SCHEME_A_ "\nEval: ");
3366 s_goto (OP_P0LIST); 3351 s_goto (OP_P0LIST);
3367 } 3352 }
3368 3353
… …
3412 SCHEME_V->code = cdr (SCHEME_V->code); 3397 SCHEME_V->code = cdr (SCHEME_V->code);
3413 s_goto (OP_E1ARGS); 3398 s_goto (OP_E1ARGS);
3414 } 3399 }
3415 3400
3416 case OP_E1ARGS: /* eval arguments */ 3401 case OP_E1ARGS: /* eval arguments */
3417 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 3402 args = cons (SCHEME_V->value, args);
3418 3403
3419 if (is_pair (SCHEME_V->code)) /* continue */ 3404 if (is_pair (SCHEME_V->code)) /* continue */
3420 { 3405 {
3421 s_save (SCHEME_A_ OP_E1ARGS, SCHEME_V->args, cdr (SCHEME_V->code)); 3406 s_save (SCHEME_A_ OP_E1ARGS, args, cdr (SCHEME_V->code));
3422 SCHEME_V->code = car (SCHEME_V->code); 3407 SCHEME_V->code = car (SCHEME_V->code);
3423 SCHEME_V->args = NIL; 3408 SCHEME_V->args = NIL;
3424 s_goto (OP_EVAL); 3409 s_goto (OP_EVAL);
3425 } 3410 }
3426 else /* end */ 3411 else /* end */
3427 { 3412 {
3428 SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); 3413 args = reverse_in_place (SCHEME_A_ NIL, args);
3429 SCHEME_V->code = car (SCHEME_V->args); 3414 SCHEME_V->code = car (args);
3430 SCHEME_V->args = cdr (SCHEME_V->args); 3415 SCHEME_V->args = cdr (args);
3431 s_goto (OP_APPLY); 3416 s_goto (OP_APPLY);
3432 } 3417 }
3433 3418
3434#if USE_TRACING 3419#if USE_TRACING
3435 3420
3436 case OP_TRACING: 3421 case OP_TRACING:
3437 { 3422 {
3438 int tr = SCHEME_V->tracing; 3423 int tr = SCHEME_V->tracing;
3439 3424
3440 SCHEME_V->tracing = ivalue (car (SCHEME_V->args)); 3425 SCHEME_V->tracing = ivalue_unchecked (car (args));
3441 s_return (mk_integer (SCHEME_A_ tr)); 3426 s_return (mk_integer (SCHEME_A_ tr));
3442 } 3427 }
3443 3428
3444#endif 3429#endif
3445 3430
3446 case OP_APPLY: /* apply 'code' to 'args' */ 3431 case OP_APPLY: /* apply 'code' to 'args' */
3447#if USE_TRACING 3432#if USE_TRACING
3448 if (SCHEME_V->tracing) 3433 if (SCHEME_V->tracing)
3449 { 3434 {
3450 s_save (SCHEME_A_ OP_REAL_APPLY, SCHEME_V->args, SCHEME_V->code); 3435 s_save (SCHEME_A_ OP_REAL_APPLY, args, SCHEME_V->code);
3451 SCHEME_V->print_flag = 1; 3436 SCHEME_V->print_flag = 1;
3452 /* SCHEME_V->args=cons(SCHEME_V->code,SCHEME_V->args); */ 3437 /* args=cons(SCHEME_V->code,args); */
3453 putstr (SCHEME_A_ "\nApply to: "); 3438 putstr (SCHEME_A_ "\nApply to: ");
3454 s_goto (OP_P0LIST); 3439 s_goto (OP_P0LIST);
3455 } 3440 }
3456 3441
3457 /* fall through */ 3442 /* fall through */
3458 3443
3459 case OP_REAL_APPLY: 3444 case OP_REAL_APPLY:
3460#endif 3445#endif
3461 if (is_proc (SCHEME_V->code)) 3446 if (is_proc (SCHEME_V->code))
3462 {
3463 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */ 3447 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */
3464 }
3465 else if (is_foreign (SCHEME_V->code)) 3448 else if (is_foreign (SCHEME_V->code))
3466 { 3449 {
3467 /* Keep nested calls from GC'ing the arglist */ 3450 /* Keep nested calls from GC'ing the arglist */
3468 push_recent_alloc (SCHEME_A_ SCHEME_V->args, NIL); 3451 push_recent_alloc (SCHEME_A_ args, NIL);
3469 x = SCHEME_V->code->object.ff (SCHEME_A_ SCHEME_V->args); 3452 x = SCHEME_V->code->object.ff (SCHEME_A_ args);
3470 3453
3471 s_return (x); 3454 s_return (x);
3472 } 3455 }
3473 else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */ 3456 else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */
3474 { 3457 {
3475 /* Should not accept promise */ 3458 /* Should not accept promise */
3476 /* make environment */ 3459 /* make environment */
3477 new_frame_in_env (SCHEME_A_ closure_env (SCHEME_V->code)); 3460 new_frame_in_env (SCHEME_A_ closure_env (SCHEME_V->code));
3478 3461
3479 for (x = car (closure_code (SCHEME_V->code)), y = SCHEME_V->args; is_pair (x); x = cdr (x), y = cdr (y)) 3462 for (x = car (closure_code (SCHEME_V->code)), y = args; is_pair (x); x = cdr (x), y = cdr (y))
3480 { 3463 {
3481 if (y == NIL) 3464 if (y == NIL)
3482 Error_0 ("not enough arguments"); 3465 Error_0 ("not enough arguments");
3483 else 3466 else
3484 new_slot_in_env (SCHEME_A_ car (x), car (y)); 3467 new_slot_in_env (SCHEME_A_ car (x), car (y));
… …
3502 s_goto (OP_BEGIN); 3485 s_goto (OP_BEGIN);
3503 } 3486 }
3504 else if (is_continuation (SCHEME_V->code)) /* CONTINUATION */ 3487 else if (is_continuation (SCHEME_V->code)) /* CONTINUATION */
3505 { 3488 {
3506 ss_set_cont (SCHEME_A_ cont_dump (SCHEME_V->code)); 3489 ss_set_cont (SCHEME_A_ cont_dump (SCHEME_V->code));
3507 s_return (SCHEME_V->args != NIL ? car (SCHEME_V->args) : NIL); 3490 s_return (args != NIL ? car (args) : NIL);
3508 } 3491 }
3509 else 3492 else
3510 Error_0 ("illegal function"); 3493 Error_0 ("illegal function");
3511 3494
3512 case OP_DOMACRO: /* do macro */ 3495 case OP_DOMACRO: /* do macro */
… …
3521 { 3504 {
3522 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1); 3505 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1);
3523 3506
3524 if (f != NIL) 3507 if (f != NIL)
3525 { 3508 {
3526 s_save (SCHEME_A_ OP_LAMBDA1, SCHEME_V->args, SCHEME_V->code); 3509 s_save (SCHEME_A_ OP_LAMBDA1, args, SCHEME_V->code);
3527 SCHEME_V->args = cons (SCHEME_V->code, NIL); 3510 SCHEME_V->args = cons (SCHEME_V->code, NIL);
3528 SCHEME_V->code = slot_value_in_env (f); 3511 SCHEME_V->code = slot_value_in_env (f);
3529 s_goto (OP_APPLY); 3512 s_goto (OP_APPLY);
3530 } 3513 }
3531 3514
… …
3542 s_return (mk_closure (SCHEME_A_ SCHEME_V->code, SCHEME_V->envir)); 3525 s_return (mk_closure (SCHEME_A_ SCHEME_V->code, SCHEME_V->envir));
3543 3526
3544#endif 3527#endif
3545 3528
3546 case OP_MKCLOSURE: /* make-closure */ 3529 case OP_MKCLOSURE: /* make-closure */
3547 x = car (SCHEME_V->args); 3530 x = car (args);
3548 3531
3549 if (car (x) == SCHEME_V->LAMBDA) 3532 if (car (x) == SCHEME_V->LAMBDA)
3550 x = cdr (x); 3533 x = cdr (x);
3551 3534
3552 if (cdr (SCHEME_V->args) == NIL) 3535 if (cdr (args) == NIL)
3553 y = SCHEME_V->envir; 3536 y = SCHEME_V->envir;
3554 else 3537 else
3555 y = cadr (SCHEME_V->args); 3538 y = cadr (args);
3556 3539
3557 s_return (mk_closure (SCHEME_A_ x, y)); 3540 s_return (mk_closure (SCHEME_A_ x, y));
3558 3541
3559 case OP_QUOTE: /* quote */ 3542 case OP_QUOTE: /* quote */
3560 s_return (car (SCHEME_V->code)); 3543 s_return (car (SCHEME_V->code));
… …
3592 3575
3593 3576
3594 case OP_DEFP: /* defined? */ 3577 case OP_DEFP: /* defined? */
3595 x = SCHEME_V->envir; 3578 x = SCHEME_V->envir;
3596 3579
3597 if (cdr (SCHEME_V->args) != NIL) 3580 if (cdr (args) != NIL)
3598 x = cadr (SCHEME_V->args); 3581 x = cadr (args);
3599 3582
3600 s_retbool (find_slot_in_env (SCHEME_A_ x, car (SCHEME_V->args), 1) != NIL); 3583 s_retbool (find_slot_in_env (SCHEME_A_ x, car (args), 1) != NIL);
3601 3584
3602 case OP_SET0: /* set! */ 3585 case OP_SET0: /* set! */
3603 if (is_immutable (car (SCHEME_V->code))) 3586 if (is_immutable (car (SCHEME_V->code)))
3604 Error_1 ("set!: unable to alter immutable variable", car (SCHEME_V->code)); 3587 Error_1 ("set!: unable to alter immutable variable", car (SCHEME_V->code));
3605 3588
… …
3636 3619
3637 case OP_IF1: /* if */ 3620 case OP_IF1: /* if */
3638 if (is_true (SCHEME_V->value)) 3621 if (is_true (SCHEME_V->value))
3639 SCHEME_V->code = car (SCHEME_V->code); 3622 SCHEME_V->code = car (SCHEME_V->code);
3640 else 3623 else
3641 SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because 3624 SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because * car(NIL) = NIL */
3642
3643 * car(NIL) = NIL */
3644 s_goto (OP_EVAL); 3625 s_goto (OP_EVAL);
3645 3626
3646 case OP_LET0: /* let */ 3627 case OP_LET0: /* let */
3647 SCHEME_V->args = NIL; 3628 SCHEME_V->args = NIL;
3648 SCHEME_V->value = SCHEME_V->code; 3629 SCHEME_V->value = SCHEME_V->code;
3649 SCHEME_V->code = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code); 3630 SCHEME_V->code = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code);
3650 s_goto (OP_LET1); 3631 s_goto (OP_LET1);
3651 3632
3652 case OP_LET1: /* let (calculate parameters) */ 3633 case OP_LET1: /* let (calculate parameters) */
3653 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 3634 args = cons (SCHEME_V->value, args);
3654 3635
3655 if (is_pair (SCHEME_V->code)) /* continue */ 3636 if (is_pair (SCHEME_V->code)) /* continue */
3656 { 3637 {
3657 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code))) 3638 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code)))
3658 Error_1 ("Bad syntax of binding spec in let :", car (SCHEME_V->code)); 3639 Error_1 ("Bad syntax of binding spec in let :", car (SCHEME_V->code));
3659 3640
3660 s_save (SCHEME_A_ OP_LET1, SCHEME_V->args, cdr (SCHEME_V->code)); 3641 s_save (SCHEME_A_ OP_LET1, args, cdr (SCHEME_V->code));
3661 SCHEME_V->code = cadar (SCHEME_V->code); 3642 SCHEME_V->code = cadar (SCHEME_V->code);
3662 SCHEME_V->args = NIL; 3643 SCHEME_V->args = NIL;
3663 s_goto (OP_EVAL); 3644 s_goto (OP_EVAL);
3664 } 3645 }
3665 else /* end */ 3646 else /* end */
3666 { 3647 {
3667 SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); 3648 args = reverse_in_place (SCHEME_A_ NIL, args);
3668 SCHEME_V->code = car (SCHEME_V->args); 3649 SCHEME_V->code = car (args);
3669 SCHEME_V->args = cdr (SCHEME_V->args); 3650 SCHEME_V->args = cdr (args);
3670 s_goto (OP_LET2); 3651 s_goto (OP_LET2);
3671 } 3652 }
3672 3653
3673 case OP_LET2: /* let */ 3654 case OP_LET2: /* let */
3674 new_frame_in_env (SCHEME_A_ SCHEME_V->envir); 3655 new_frame_in_env (SCHEME_A_ SCHEME_V->envir);
3675 3656
3676 for (x = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code), y = SCHEME_V->args; 3657 for (x = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code), y = args;
3677 y != NIL; x = cdr (x), y = cdr (y)) 3658 y != NIL; x = cdr (x), y = cdr (y))
3678 new_slot_in_env (SCHEME_A_ caar (x), car (y)); 3659 new_slot_in_env (SCHEME_A_ caar (x), car (y));
3679 3660
3680 if (is_symbol (car (SCHEME_V->code))) /* named let */ 3661 if (is_symbol (car (SCHEME_V->code))) /* named let */
3681 { 3662 {
3682 for (x = cadr (SCHEME_V->code), SCHEME_V->args = NIL; x != NIL; x = cdr (x)) 3663 for (x = cadr (SCHEME_V->code), args = NIL; x != NIL; x = cdr (x))
3683 { 3664 {
3684 if (!is_pair (x)) 3665 if (!is_pair (x))
3685 Error_1 ("Bad syntax of binding in let :", x); 3666 Error_1 ("Bad syntax of binding in let :", x);
3686 3667
3687 if (!is_list (SCHEME_A_ car (x))) 3668 if (!is_list (SCHEME_A_ car (x)))
3688 Error_1 ("Bad syntax of binding in let :", car (x)); 3669 Error_1 ("Bad syntax of binding in let :", car (x));
3689 3670
3690 SCHEME_V->args = cons (caar (x), SCHEME_V->args); 3671 args = cons (caar (x), args);
3691 } 3672 }
3692 3673
3693 x =
3694 mk_closure (SCHEME_A_ cons (reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args), cddr (SCHEME_V->code)), 3674 x = mk_closure (SCHEME_A_ cons (reverse_in_place (SCHEME_A_ NIL, args), cddr (SCHEME_V->code)),
3695 SCHEME_V->envir); 3675 SCHEME_V->envir);
3696 new_slot_in_env (SCHEME_A_ car (SCHEME_V->code), x); 3676 new_slot_in_env (SCHEME_A_ car (SCHEME_V->code), x);
3697 SCHEME_V->code = cddr (SCHEME_V->code); 3677 SCHEME_V->code = cddr (SCHEME_V->code);
3698 SCHEME_V->args = NIL;
3699 } 3678 }
3700 else 3679 else
3701 { 3680 {
3702 SCHEME_V->code = cdr (SCHEME_V->code); 3681 SCHEME_V->code = cdr (SCHEME_V->code);
3682 }
3683
3703 SCHEME_V->args = NIL; 3684 SCHEME_V->args = NIL;
3704 }
3705
3706 s_goto (OP_BEGIN); 3685 s_goto (OP_BEGIN);
3707 3686
3708 case OP_LET0AST: /* let* */ 3687 case OP_LET0AST: /* let* */
3709 if (car (SCHEME_V->code) == NIL) 3688 if (car (SCHEME_V->code) == NIL)
3710 { 3689 {
… …
3728 new_slot_in_env (SCHEME_A_ caar (SCHEME_V->code), SCHEME_V->value); 3707 new_slot_in_env (SCHEME_A_ caar (SCHEME_V->code), SCHEME_V->value);
3729 SCHEME_V->code = cdr (SCHEME_V->code); 3708 SCHEME_V->code = cdr (SCHEME_V->code);
3730 3709
3731 if (is_pair (SCHEME_V->code)) /* continue */ 3710 if (is_pair (SCHEME_V->code)) /* continue */
3732 { 3711 {
3733 s_save (SCHEME_A_ OP_LET2AST, SCHEME_V->args, SCHEME_V->code); 3712 s_save (SCHEME_A_ OP_LET2AST, args, SCHEME_V->code);
3734 SCHEME_V->code = cadar (SCHEME_V->code); 3713 SCHEME_V->code = cadar (SCHEME_V->code);
3735 SCHEME_V->args = NIL; 3714 SCHEME_V->args = NIL;
3736 s_goto (OP_EVAL); 3715 s_goto (OP_EVAL);
3737 } 3716 }
3738 else /* end */ 3717 else /* end */
3739 { 3718 {
3740 SCHEME_V->code = SCHEME_V->args; 3719 SCHEME_V->code = args;
3741 SCHEME_V->args = NIL; 3720 SCHEME_V->args = NIL;
3742 s_goto (OP_BEGIN); 3721 s_goto (OP_BEGIN);
3743 } 3722 }
3744 3723
3745 case OP_LET0REC: /* letrec */ 3724 case OP_LET0REC: /* letrec */
… …
3748 SCHEME_V->value = SCHEME_V->code; 3727 SCHEME_V->value = SCHEME_V->code;
3749 SCHEME_V->code = car (SCHEME_V->code); 3728 SCHEME_V->code = car (SCHEME_V->code);
3750 s_goto (OP_LET1REC); 3729 s_goto (OP_LET1REC);
3751 3730
3752 case OP_LET1REC: /* letrec (calculate parameters) */ 3731 case OP_LET1REC: /* letrec (calculate parameters) */
3753 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 3732 args = cons (SCHEME_V->value, args);
3754 3733
3755 if (is_pair (SCHEME_V->code)) /* continue */ 3734 if (is_pair (SCHEME_V->code)) /* continue */
3756 { 3735 {
3757 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code))) 3736 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code)))
3758 Error_1 ("Bad syntax of binding spec in letrec :", car (SCHEME_V->code)); 3737 Error_1 ("Bad syntax of binding spec in letrec :", car (SCHEME_V->code));
3759 3738
3760 s_save (SCHEME_A_ OP_LET1REC, SCHEME_V->args, cdr (SCHEME_V->code)); 3739 s_save (SCHEME_A_ OP_LET1REC, args, cdr (SCHEME_V->code));
3761 SCHEME_V->code = cadar (SCHEME_V->code); 3740 SCHEME_V->code = cadar (SCHEME_V->code);
3762 SCHEME_V->args = NIL; 3741 SCHEME_V->args = NIL;
3763 s_goto (OP_EVAL); 3742 s_goto (OP_EVAL);
3764 } 3743 }
3765 else /* end */ 3744 else /* end */
3766 { 3745 {
3767 SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); 3746 args = reverse_in_place (SCHEME_A_ NIL, args);
3768 SCHEME_V->code = car (SCHEME_V->args); 3747 SCHEME_V->code = car (args);
3769 SCHEME_V->args = cdr (SCHEME_V->args); 3748 SCHEME_V->args = cdr (args);
3770 s_goto (OP_LET2REC); 3749 s_goto (OP_LET2REC);
3771 } 3750 }
3772 3751
3773 case OP_LET2REC: /* letrec */ 3752 case OP_LET2REC: /* letrec */
3774 for (x = car (SCHEME_V->code), y = SCHEME_V->args; y != NIL; x = cdr (x), y = cdr (y)) 3753 for (x = car (SCHEME_V->code), y = args; y != NIL; x = cdr (x), y = cdr (y))
3775 new_slot_in_env (SCHEME_A_ caar (x), car (y)); 3754 new_slot_in_env (SCHEME_A_ caar (x), car (y));
3776 3755
3777 SCHEME_V->code = cdr (SCHEME_V->code); 3756 SCHEME_V->code = cdr (SCHEME_V->code);
3778 SCHEME_V->args = NIL; 3757 SCHEME_V->args = NIL;
3779 s_goto (OP_BEGIN); 3758 s_goto (OP_BEGIN);
… …
3865 s_save (SCHEME_A_ OP_C1STREAM, NIL, cdr (SCHEME_V->code)); 3844 s_save (SCHEME_A_ OP_C1STREAM, NIL, cdr (SCHEME_V->code));
3866 SCHEME_V->code = car (SCHEME_V->code); 3845 SCHEME_V->code = car (SCHEME_V->code);
3867 s_goto (OP_EVAL); 3846 s_goto (OP_EVAL);
3868 3847
3869 case OP_C1STREAM: /* cons-stream */ 3848 case OP_C1STREAM: /* cons-stream */
3870 SCHEME_V->args = SCHEME_V->value; /* save SCHEME_V->value to register SCHEME_V->args for gc */ 3849 SCHEME_V->args = SCHEME_V->value; /* save SCHEME_V->value to register args for gc */
3871 x = mk_closure (SCHEME_A_ cons (NIL, SCHEME_V->code), SCHEME_V->envir); 3850 x = mk_closure (SCHEME_A_ cons (NIL, SCHEME_V->code), SCHEME_V->envir);
3872 set_typeflag (x, T_PROMISE); 3851 set_typeflag (x, T_PROMISE);
3873 s_return (cons (SCHEME_V->args, x)); 3852 s_return (cons (args, x));
3874 3853
3875 case OP_MACRO0: /* macro */ 3854 case OP_MACRO0: /* macro */
3876 if (is_pair (car (SCHEME_V->code))) 3855 if (is_pair (car (SCHEME_V->code)))
3877 { 3856 {
3878 x = caar (SCHEME_V->code); 3857 x = caar (SCHEME_V->code);
… …
3911 { 3890 {
3912 if (!is_pair (y = caar (x))) 3891 if (!is_pair (y = caar (x)))
3913 break; 3892 break;
3914 3893
3915 for (; y != NIL; y = cdr (y)) 3894 for (; y != NIL; y = cdr (y))
3916 {
3917 if (eqv (car (y), SCHEME_V->value)) 3895 if (eqv (car (y), SCHEME_V->value))
3918 break; 3896 break;
3919 }
3920 3897
3921 if (y != NIL) 3898 if (y != NIL)
3922 break; 3899 break;
3923 } 3900 }
3924 3901
… …
3944 s_goto (OP_BEGIN); 3921 s_goto (OP_BEGIN);
3945 else 3922 else
3946 s_return (NIL); 3923 s_return (NIL);
3947 3924
3948 case OP_PAPPLY: /* apply */ 3925 case OP_PAPPLY: /* apply */
3949 SCHEME_V->code = car (SCHEME_V->args); 3926 SCHEME_V->code = car (args);
3950 SCHEME_V->args = list_star (SCHEME_A_ cdr (SCHEME_V->args)); 3927 SCHEME_V->args = list_star (SCHEME_A_ cdr (args));
3951 /*SCHEME_V->args = cadr(SCHEME_V->args); */ 3928 /*SCHEME_V->args = cadr(args); */
3952 s_goto (OP_APPLY); 3929 s_goto (OP_APPLY);
3953 3930
3954 case OP_PEVAL: /* eval */ 3931 case OP_PEVAL: /* eval */
3955 if (cdr (SCHEME_V->args) != NIL) 3932 if (cdr (args) != NIL)
3956 SCHEME_V->envir = cadr (SCHEME_V->args); 3933 SCHEME_V->envir = cadr (args);
3957 3934
3958 SCHEME_V->code = car (SCHEME_V->args); 3935 SCHEME_V->code = car (args);
3959 s_goto (OP_EVAL); 3936 s_goto (OP_EVAL);
3960 3937
3961 case OP_CONTINUATION: /* call-with-current-continuation */ 3938 case OP_CONTINUATION: /* call-with-current-continuation */
3962 SCHEME_V->code = car (SCHEME_V->args); 3939 SCHEME_V->code = car (args);
3963 SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL); 3940 SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL);
3964 s_goto (OP_APPLY); 3941 s_goto (OP_APPLY);
3965 } 3942 }
3966 3943
3967 return S_T; 3944 if (USE_ERROR_CHECKING) abort ();
3968} 3945}
3969 3946
3970static pointer 3947static int
3971opexe_2 (SCHEME_P_ enum scheme_opcodes op) 3948opexe_1 (SCHEME_P_ enum scheme_opcodes op)
3972{ 3949{
3973 pointer x; 3950 pointer args = SCHEME_V->args;
3951 pointer x = car (args);
3974 num v; 3952 num v;
3975 3953
3954 switch (op)
3955 {
3976#if USE_MATH 3956#if USE_MATH
3977 RVALUE dd;
3978#endif
3979
3980 switch (op)
3981 {
3982#if USE_MATH
3983
3984 case OP_INEX2EX: /* inexact->exact */ 3957 case OP_INEX2EX: /* inexact->exact */
3985 x = car (SCHEME_V->args); 3958 {
3986
3987 if (num_is_integer (x)) 3959 if (is_integer (x))
3988 s_return (x); 3960 s_return (x);
3989 else if (modf (rvalue_unchecked (x), &dd) == 0.0) 3961
3962 RVALUE r = rvalue_unchecked (x);
3963
3964 if (r == (RVALUE)(IVALUE)r)
3990 s_return (mk_integer (SCHEME_A_ ivalue (x))); 3965 s_return (mk_integer (SCHEME_A_ rvalue_unchecked (x)));
3991 else 3966 else
3992 Error_1 ("inexact->exact: not integral:", x); 3967 Error_1 ("inexact->exact: not integral:", x);
3968 }
3993 3969
3994 case OP_EXP:
3995 x = car (SCHEME_V->args);
3996 s_return (mk_real (SCHEME_A_ exp (rvalue (x)))); 3970 case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x))));
3997
3998 case OP_LOG:
3999 x = car (SCHEME_V->args);
4000 s_return (mk_real (SCHEME_A_ log (rvalue (x)))); 3971 case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x))));
4001
4002 case OP_SIN:
4003 x = car (SCHEME_V->args);
4004 s_return (mk_real (SCHEME_A_ sin (rvalue (x)))); 3972 case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x))));
4005
4006 case OP_COS:
4007 x = car (SCHEME_V->args);
4008 s_return (mk_real (SCHEME_A_ cos (rvalue (x)))); 3973 case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x))));
4009
4010 case OP_TAN:
4011 x = car (SCHEME_V->args);
4012 s_return (mk_real (SCHEME_A_ tan (rvalue (x)))); 3974 case OP_TAN: s_return (mk_real (SCHEME_A_ tan (rvalue (x))));
4013
4014 case OP_ASIN:
4015 x = car (SCHEME_V->args);
4016 s_return (mk_real (SCHEME_A_ asin (rvalue (x)))); 3975 case OP_ASIN: s_return (mk_real (SCHEME_A_ asin (rvalue (x))));
4017
4018 case OP_ACOS:
4019 x = car (SCHEME_V->args);
4020 s_return (mk_real (SCHEME_A_ acos (rvalue (x)))); 3976 case OP_ACOS: s_return (mk_real (SCHEME_A_ acos (rvalue (x))));
4021 3977
4022 case OP_ATAN: 3978 case OP_ATAN:
4023 x = car (SCHEME_V->args);
4024
4025 if (cdr (SCHEME_V->args) == NIL) 3979 if (cdr (args) == NIL)
4026 s_return (mk_real (SCHEME_A_ atan (rvalue (x)))); 3980 s_return (mk_real (SCHEME_A_ atan (rvalue (x))));
4027 else 3981 else
4028 { 3982 {
4029 pointer y = cadr (SCHEME_V->args); 3983 pointer y = cadr (args);
4030
4031 s_return (mk_real (SCHEME_A_ atan2 (rvalue (x), rvalue (y)))); 3984 s_return (mk_real (SCHEME_A_ atan2 (rvalue (x), rvalue (y))));
4032 } 3985 }
4033 3986
4034 case OP_SQRT: 3987 case OP_SQRT:
4035 x = car (SCHEME_V->args);
4036 s_return (mk_real (SCHEME_A_ sqrt (rvalue (x)))); 3988 s_return (mk_real (SCHEME_A_ sqrt (rvalue (x))));
4037 3989
4038 case OP_EXPT: 3990 case OP_EXPT:
4039 { 3991 {
4040 RVALUE result; 3992 RVALUE result;
4041 int real_result = 1; 3993 int real_result = 1;
4042 pointer y = cadr (SCHEME_V->args); 3994 pointer y = cadr (args);
4043 3995
4044 x = car (SCHEME_V->args);
4045
4046 if (num_is_integer (x) && num_is_integer (y)) 3996 if (is_integer (x) && is_integer (y))
4047 real_result = 0; 3997 real_result = 0;
4048 3998
4049 /* This 'if' is an R5RS compatibility fix. */ 3999 /* This 'if' is an R5RS compatibility fix. */
4050 /* NOTE: Remove this 'if' fix for R6RS. */ 4000 /* NOTE: Remove this 'if' fix for R6RS. */
4051 if (rvalue (x) == 0 && rvalue (y) < 0) 4001 if (rvalue (x) == 0 && rvalue (y) < 0)
4052 result = 0.0; 4002 result = 0;
4053 else 4003 else
4054 result = pow (rvalue (x), rvalue (y)); 4004 result = pow (rvalue (x), rvalue (y));
4055 4005
4056 /* Before returning integer result make sure we can. */ 4006 /* Before returning integer result make sure we can. */
4057 /* If the test fails, result is too big for integer. */ 4007 /* If the test fails, result is too big for integer. */
4058 if (!real_result) 4008 if (!real_result)
4059 { 4009 {
4060 long result_as_long = (long) result; 4010 long result_as_long = result;
4061 4011
4062 if (result != (RVALUE) result_as_long) 4012 if (result != result_as_long)
4063 real_result = 1; 4013 real_result = 1;
4064 } 4014 }
4065 4015
4066 if (real_result) 4016 if (real_result)
4067 s_return (mk_real (SCHEME_A_ result)); 4017 s_return (mk_real (SCHEME_A_ result));
4068 else 4018 else
4069 s_return (mk_integer (SCHEME_A_ result)); 4019 s_return (mk_integer (SCHEME_A_ result));
4070 } 4020 }
4071 4021
4072 case OP_FLOOR:
4073 x = car (SCHEME_V->args);
4074 s_return (mk_real (SCHEME_A_ floor (rvalue (x)))); 4022 case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x))));
4075
4076 case OP_CEILING:
4077 x = car (SCHEME_V->args);
4078 s_return (mk_real (SCHEME_A_ ceil (rvalue (x)))); 4023 case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x))));
4079 4024
4080 case OP_TRUNCATE: 4025 case OP_TRUNCATE:
4081 { 4026 {
4082 RVALUE rvalue_of_x; 4027 RVALUE n = rvalue (x);
4083
4084 x = car (SCHEME_V->args);
4085 rvalue_of_x = rvalue (x);
4086
4087 if (rvalue_of_x > 0)
4088 s_return (mk_real (SCHEME_A_ floor (rvalue_of_x))); 4028 s_return (mk_real (SCHEME_A_ n > 0 ? floor (n) : ceil (n)));
4089 else
4090 s_return (mk_real (SCHEME_A_ ceil (rvalue_of_x)));
4091 } 4029 }
4092 4030
4093 case OP_ROUND: 4031 case OP_ROUND:
4094 x = car (SCHEME_V->args);
4095
4096 if (num_is_integer (x)) 4032 if (is_integer (x))
4097 s_return (x); 4033 s_return (x);
4098 4034
4099 s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x)))); 4035 s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x))));
4100#endif 4036#endif
4101 4037
4102 case OP_ADD: /* + */ 4038 case OP_ADD: /* + */
4103 v = num_zero; 4039 v = num_zero;
4104 4040
4105 for (x = SCHEME_V->args; x != NIL; x = cdr (x)) 4041 for (x = args; x != NIL; x = cdr (x))
4106 v = num_add (v, nvalue (car (x))); 4042 v = num_op (NUM_ADD, v, nvalue (car (x)));
4107 4043
4108 s_return (mk_number (SCHEME_A_ v)); 4044 s_return (mk_number (SCHEME_A_ v));
4109 4045
4110 case OP_MUL: /* * */ 4046 case OP_MUL: /* * */
4111 v = num_one; 4047 v = num_one;
4112 4048
4113 for (x = SCHEME_V->args; x != NIL; x = cdr (x)) 4049 for (x = args; x != NIL; x = cdr (x))
4114 v = num_mul (v, nvalue (car (x))); 4050 v = num_op (NUM_MUL, v, nvalue (car (x)));
4115 4051
4116 s_return (mk_number (SCHEME_A_ v)); 4052 s_return (mk_number (SCHEME_A_ v));
4117 4053
4118 case OP_SUB: /* - */ 4054 case OP_SUB: /* - */
4119 if (cdr (SCHEME_V->args) == NIL) 4055 if (cdr (args) == NIL)
4120 { 4056 {
4121 x = SCHEME_V->args; 4057 x = args;
4122 v = num_zero; 4058 v = num_zero;
4123 } 4059 }
4124 else 4060 else
4125 { 4061 {
4126 x = cdr (SCHEME_V->args); 4062 x = cdr (args);
4127 v = nvalue (car (SCHEME_V->args)); 4063 v = nvalue (car (args));
4128 } 4064 }
4129 4065
4130 for (; x != NIL; x = cdr (x)) 4066 for (; x != NIL; x = cdr (x))
4131 v = num_sub (v, nvalue (car (x))); 4067 v = num_op (NUM_SUB, v, nvalue (car (x)));
4132 4068
4133 s_return (mk_number (SCHEME_A_ v)); 4069 s_return (mk_number (SCHEME_A_ v));
4134 4070
4135 case OP_DIV: /* / */ 4071 case OP_DIV: /* / */
4136 if (cdr (SCHEME_V->args) == NIL) 4072 if (cdr (args) == NIL)
4137 { 4073 {
4138 x = SCHEME_V->args; 4074 x = args;
4139 v = num_one; 4075 v = num_one;
4140 } 4076 }
4141 else 4077 else
4142 { 4078 {
4143 x = cdr (SCHEME_V->args); 4079 x = cdr (args);
4144 v = nvalue (car (SCHEME_V->args)); 4080 v = nvalue (car (args));
4145 } 4081 }
4146 4082
4147 for (; x != NIL; x = cdr (x)) 4083 for (; x != NIL; x = cdr (x))
4148 {
4149 if (!is_zero_rvalue (rvalue (car (x)))) 4084 if (!is_zero_rvalue (rvalue (car (x))))
4150 v = num_div (v, nvalue (car (x))); 4085 v = num_div (v, nvalue (car (x)));
4151 else 4086 else
4152 Error_0 ("/: division by zero"); 4087 Error_0 ("/: division by zero");
4153 }
4154 4088
4155 s_return (mk_number (SCHEME_A_ v)); 4089 s_return (mk_number (SCHEME_A_ v));
4156 4090
4157 case OP_INTDIV: /* quotient */ 4091 case OP_INTDIV: /* quotient */
4158 if (cdr (SCHEME_V->args) == NIL) 4092 if (cdr (args) == NIL)
4159 { 4093 {
4160 x = SCHEME_V->args; 4094 x = args;
4161 v = num_one; 4095 v = num_one;
4162 } 4096 }
4163 else 4097 else
4164 { 4098 {
4165 x = cdr (SCHEME_V->args); 4099 x = cdr (args);
4166 v = nvalue (car (SCHEME_V->args)); 4100 v = nvalue (car (args));
4167 } 4101 }
4168 4102
4169 for (; x != NIL; x = cdr (x)) 4103 for (; x != NIL; x = cdr (x))
4170 { 4104 {
4171 if (ivalue (car (x)) != 0) 4105 if (ivalue (car (x)) != 0)
4172 v = num_intdiv (v, nvalue (car (x))); 4106 v = num_op (NUM_INTDIV, v, nvalue (car (x)));
4173 else 4107 else
4174 Error_0 ("quotient: division by zero"); 4108 Error_0 ("quotient: division by zero");
4175 } 4109 }
4176 4110
4177 s_return (mk_number (SCHEME_A_ v)); 4111 s_return (mk_number (SCHEME_A_ v));
4178 4112
4179 case OP_REM: /* remainder */ 4113 case OP_REM: /* remainder */
4180 v = nvalue (car (SCHEME_V->args)); 4114 v = nvalue (x);
4181 4115
4182 if (ivalue (cadr (SCHEME_V->args)) != 0) 4116 if (ivalue (cadr (args)) != 0)
4183 v = num_rem (v, nvalue (cadr (SCHEME_V->args))); 4117 v = num_rem (v, nvalue (cadr (args)));
4184 else 4118 else
4185 Error_0 ("remainder: division by zero"); 4119 Error_0 ("remainder: division by zero");
4186 4120
4187 s_return (mk_number (SCHEME_A_ v)); 4121 s_return (mk_number (SCHEME_A_ v));
4188 4122
4189 case OP_MOD: /* modulo */ 4123 case OP_MOD: /* modulo */
4190 v = nvalue (car (SCHEME_V->args)); 4124 v = nvalue (x);
4191 4125
4192 if (ivalue (cadr (SCHEME_V->args)) != 0) 4126 if (ivalue (cadr (args)) != 0)
4193 v = num_mod (v, nvalue (cadr (SCHEME_V->args))); 4127 v = num_mod (v, nvalue (cadr (args)));
4194 else 4128 else
4195 Error_0 ("modulo: division by zero"); 4129 Error_0 ("modulo: division by zero");
4196 4130
4197 s_return (mk_number (SCHEME_A_ v)); 4131 s_return (mk_number (SCHEME_A_ v));
4198 4132
4199 case OP_CAR: /* car */ 4133 case OP_CAR: /* car */
4200 s_return (caar (SCHEME_V->args)); 4134 s_return (caar (args));
4201 4135
4202 case OP_CDR: /* cdr */ 4136 case OP_CDR: /* cdr */
4203 s_return (cdar (SCHEME_V->args)); 4137 s_return (cdar (args));
4204 4138
4205 case OP_CONS: /* cons */ 4139 case OP_CONS: /* cons */
4206 set_cdr (SCHEME_V->args, cadr (SCHEME_V->args)); 4140 set_cdr (args, cadr (args));
4207 s_return (SCHEME_V->args); 4141 s_return (args);
4208 4142
4209 case OP_SETCAR: /* set-car! */ 4143 case OP_SETCAR: /* set-car! */
4210 if (!is_immutable (car (SCHEME_V->args))) 4144 if (!is_immutable (x))
4211 { 4145 {
4212 set_car (car (SCHEME_V->args), cadr (SCHEME_V->args)); 4146 set_car (x, cadr (args));
4213 s_return (car (SCHEME_V->args)); 4147 s_return (car (args));
4214 } 4148 }
4215 else 4149 else
4216 Error_0 ("set-car!: unable to alter immutable pair"); 4150 Error_0 ("set-car!: unable to alter immutable pair");
4217 4151
4218 case OP_SETCDR: /* set-cdr! */ 4152 case OP_SETCDR: /* set-cdr! */
4219 if (!is_immutable (car (SCHEME_V->args))) 4153 if (!is_immutable (x))
4220 { 4154 {
4221 set_cdr (car (SCHEME_V->args), cadr (SCHEME_V->args)); 4155 set_cdr (x, cadr (args));
4222 s_return (car (SCHEME_V->args)); 4156 s_return (car (args));
4223 } 4157 }
4224 else 4158 else
4225 Error_0 ("set-cdr!: unable to alter immutable pair"); 4159 Error_0 ("set-cdr!: unable to alter immutable pair");
4226 4160
4227 case OP_CHAR2INT: /* char->integer */ 4161 case OP_CHAR2INT: /* char->integer */
4228 s_return (mk_integer (SCHEME_A_ ivalue (car (SCHEME_V->args)))); 4162 s_return (mk_integer (SCHEME_A_ ivalue_unchecked (x)));
4229 4163
4230 case OP_INT2CHAR: /* integer->char */ 4164 case OP_INT2CHAR: /* integer->char */
4231 s_return (mk_character (SCHEME_A_ ivalue (car (SCHEME_V->args)))); 4165 s_return (mk_character (SCHEME_A_ ivalue_unchecked (x)));
4232 4166
4233 case OP_CHARUPCASE: 4167 case OP_CHARUPCASE:
4234 { 4168 {
4235 unsigned char c = ivalue (car (SCHEME_V->args)); 4169 unsigned char c = ivalue_unchecked (x);
4236 c = toupper (c); 4170 c = toupper (c);
4237 s_return (mk_character (SCHEME_A_ c)); 4171 s_return (mk_character (SCHEME_A_ c));
4238 } 4172 }
4239 4173
4240 case OP_CHARDNCASE: 4174 case OP_CHARDNCASE:
4241 { 4175 {
4242 unsigned char c = ivalue (car (SCHEME_V->args)); 4176 unsigned char c = ivalue_unchecked (x);
4243 c = tolower (c); 4177 c = tolower (c);
4244 s_return (mk_character (SCHEME_A_ c)); 4178 s_return (mk_character (SCHEME_A_ c));
4245 } 4179 }
4246 4180
4247 case OP_STR2SYM: /* string->symbol */ 4181 case OP_STR2SYM: /* string->symbol */
4248 s_return (mk_symbol (SCHEME_A_ strvalue (car (SCHEME_V->args)))); 4182 s_return (mk_symbol (SCHEME_A_ strvalue (x)));
4249 4183
4250 case OP_STR2ATOM: /* string->atom */ 4184 case OP_STR2ATOM: /* string->atom */
4251 { 4185 {
4252 char *s = strvalue (car (SCHEME_V->args)); 4186 char *s = strvalue (x);
4253 long pf = 0; 4187 long pf = 0;
4254 4188
4255 if (cdr (SCHEME_V->args) != NIL) 4189 if (cdr (args) != NIL)
4256 { 4190 {
4257 /* we know cadr(SCHEME_V->args) is a natural number */ 4191 /* we know cadr(args) is a natural number */
4258 /* see if it is 2, 8, 10, or 16, or error */ 4192 /* see if it is 2, 8, 10, or 16, or error */
4259 pf = ivalue_unchecked (cadr (SCHEME_V->args)); 4193 pf = ivalue_unchecked (cadr (args));
4260 4194
4261 if (pf == 16 || pf == 10 || pf == 8 || pf == 2) 4195 if (pf == 16 || pf == 10 || pf == 8 || pf == 2)
4262 { 4196 {
4263 /* base is OK */ 4197 /* base is OK */
4264 } 4198 }
4265 else 4199 else
4266 pf = -1; 4200 pf = -1;
4267 } 4201 }
4268 4202
4269 if (pf < 0) 4203 if (pf < 0)
4270 Error_1 ("string->atom: bad base:", cadr (SCHEME_V->args)); 4204 Error_1 ("string->atom: bad base:", cadr (args));
4271 else if (*s == '#') /* no use of base! */ 4205 else if (*s == '#') /* no use of base! */
4272 s_return (mk_sharp_const (SCHEME_A_ s + 1)); 4206 s_return (mk_sharp_const (SCHEME_A_ s + 1));
4273 else 4207 else
4274 { 4208 {
4275 if (pf == 0 || pf == 10) 4209 if (pf == 0 || pf == 10)
… …
4286 } 4220 }
4287 } 4221 }
4288 } 4222 }
4289 4223
4290 case OP_SYM2STR: /* symbol->string */ 4224 case OP_SYM2STR: /* symbol->string */
4291 x = mk_string (SCHEME_A_ symname (car (SCHEME_V->args))); 4225 x = mk_string (SCHEME_A_ symname (x));
4292 setimmutable (x); 4226 setimmutable (x);
4293 s_return (x); 4227 s_return (x);
4294 4228
4295 case OP_ATOM2STR: /* atom->string */ 4229 case OP_ATOM2STR: /* atom->string */
4296 { 4230 {
4297 long pf = 0; 4231 long pf = 0;
4298 4232
4299 x = car (SCHEME_V->args);
4300
4301 if (cdr (SCHEME_V->args) != NIL) 4233 if (cdr (args) != NIL)
4302 { 4234 {
4303 /* we know cadr(SCHEME_V->args) is a natural number */ 4235 /* we know cadr(args) is a natural number */
4304 /* see if it is 2, 8, 10, or 16, or error */ 4236 /* see if it is 2, 8, 10, or 16, or error */
4305 pf = ivalue_unchecked (cadr (SCHEME_V->args)); 4237 pf = ivalue_unchecked (cadr (args));
4306 4238
4307 if (is_number (x) && (pf == 16 || pf == 10 || pf == 8 || pf == 2)) 4239 if (is_number (x) && (pf == 16 || pf == 10 || pf == 8 || pf == 2))
4308 { 4240 {
4309 /* base is OK */ 4241 /* base is OK */
4310 } 4242 }
4311 else 4243 else
4312 pf = -1; 4244 pf = -1;
4313 } 4245 }
4314 4246
4315 if (pf < 0) 4247 if (pf < 0)
4316 Error_1 ("atom->string: bad base:", cadr (SCHEME_V->args)); 4248 Error_1 ("atom->string: bad base:", cadr (args));
4317 else if (is_number (x) || is_character (x) || is_string (x) || is_symbol (x)) 4249 else if (is_number (x) || is_character (x) || is_string (x) || is_symbol (x))
4318 { 4250 {
4319 char *p; 4251 char *p;
4320 int len; 4252 int len;
4321 4253
… …
4326 Error_1 ("atom->string: not an atom:", x); 4258 Error_1 ("atom->string: not an atom:", x);
4327 } 4259 }
4328 4260
4329 case OP_MKSTRING: /* make-string */ 4261 case OP_MKSTRING: /* make-string */
4330 { 4262 {
4331 int fill = ' '; 4263 int fill = cdr (args) != NIL ? charvalue (cadr (args)) : ' ';
4332 int len; 4264 int len = ivalue_unchecked (x);
4333 4265
4334 len = ivalue (car (SCHEME_V->args));
4335
4336 if (cdr (SCHEME_V->args) != NIL)
4337 fill = charvalue (cadr (SCHEME_V->args));
4338
4339 s_return (mk_empty_string (SCHEME_A_ len, (char) fill)); 4266 s_return (mk_empty_string (SCHEME_A_ len, fill));
4340 } 4267 }
4341 4268
4342 case OP_STRLEN: /* string-length */ 4269 case OP_STRLEN: /* string-length */
4343 s_return (mk_integer (SCHEME_A_ strlength (car (SCHEME_V->args)))); 4270 s_return (mk_integer (SCHEME_A_ strlength (x)));
4344 4271
4345 case OP_STRREF: /* string-ref */ 4272 case OP_STRREF: /* string-ref */
4346 { 4273 {
4347 char *str; 4274 char *str = strvalue (x);
4348 int index;
4349
4350 str = strvalue (car (SCHEME_V->args));
4351
4352 index = ivalue (cadr (SCHEME_V->args)); 4275 int index = ivalue_unchecked (cadr (args));
4353 4276
4354 if (index >= strlength (car (SCHEME_V->args))) 4277 if (index >= strlength (x))
4355 Error_1 ("string-ref: out of bounds:", cadr (SCHEME_V->args)); 4278 Error_1 ("string-ref: out of bounds:", cadr (args));
4356 4279
4357 s_return (mk_character (SCHEME_A_ ((unsigned char *) str)[index])); 4280 s_return (mk_character (SCHEME_A_ ((unsigned char *)str)[index]));
4358 } 4281 }
4359 4282
4360 case OP_STRSET: /* string-set! */ 4283 case OP_STRSET: /* string-set! */
4361 { 4284 {
4362 char *str; 4285 char *str = strvalue (x);
4363 int index; 4286 int index = ivalue_unchecked (cadr (args));
4364 int c; 4287 int c;
4365 4288
4366 if (is_immutable (car (SCHEME_V->args))) 4289 if (is_immutable (x))
4367 Error_1 ("string-set!: unable to alter immutable string:", car (SCHEME_V->args)); 4290 Error_1 ("string-set!: unable to alter immutable string:", x);
4368 4291
4369 str = strvalue (car (SCHEME_V->args));
4370
4371 index = ivalue (cadr (SCHEME_V->args));
4372
4373 if (index >= strlength (car (SCHEME_V->args))) 4292 if (index >= strlength (x))
4374 Error_1 ("string-set!: out of bounds:", cadr (SCHEME_V->args)); 4293 Error_1 ("string-set!: out of bounds:", cadr (args));
4375 4294
4376 c = charvalue (caddr (SCHEME_V->args)); 4295 c = charvalue (caddr (args));
4377 4296
4378 str[index] = (char) c; 4297 str[index] = c;
4379 s_return (car (SCHEME_V->args)); 4298 s_return (car (args));
4380 } 4299 }
4381 4300
4382 case OP_STRAPPEND: /* string-append */ 4301 case OP_STRAPPEND: /* string-append */
4383 { 4302 {
4384 /* in 1.29 string-append was in Scheme in init.scm but was too slow */ 4303 /* in 1.29 string-append was in Scheme in init.scm but was too slow */
4385 int len = 0; 4304 int len = 0;
4386 pointer newstr; 4305 pointer newstr;
4387 char *pos; 4306 char *pos;
4388 4307
4389 /* compute needed length for new string */ 4308 /* compute needed length for new string */
4390 for (x = SCHEME_V->args; x != NIL; x = cdr (x)) 4309 for (x = args; x != NIL; x = cdr (x))
4391 len += strlength (car (x)); 4310 len += strlength (car (x));
4392 4311
4393 newstr = mk_empty_string (SCHEME_A_ len, ' '); 4312 newstr = mk_empty_string (SCHEME_A_ len, ' ');
4394 4313
4395 /* store the contents of the argument strings into the new string */ 4314 /* store the contents of the argument strings into the new string */
4396 for (pos = strvalue (newstr), x = SCHEME_V->args; x != NIL; pos += strlength (car (x)), x = cdr (x)) 4315 for (pos = strvalue (newstr), x = args; x != NIL; pos += strlength (car (x)), x = cdr (x))
4397 memcpy (pos, strvalue (car (x)), strlength (car (x))); 4316 memcpy (pos, strvalue (car (x)), strlength (car (x)));
4398 4317
4399 s_return (newstr); 4318 s_return (newstr);
4400 } 4319 }
4401 4320
4402 case OP_SUBSTR: /* substring */ 4321 case OP_SUBSTR: /* substring */
4403 { 4322 {
4404 char *str; 4323 char *str = strvalue (x);
4405 int index0; 4324 int index0 = ivalue_unchecked (cadr (args));
4406 int index1; 4325 int index1;
4407 int len; 4326 int len;
4408 4327
4409 str = strvalue (car (SCHEME_V->args));
4410
4411 index0 = ivalue (cadr (SCHEME_V->args));
4412
4413 if (index0 > strlength (car (SCHEME_V->args))) 4328 if (index0 > strlength (x))
4414 Error_1 ("substring: start out of bounds:", cadr (SCHEME_V->args)); 4329 Error_1 ("substring: start out of bounds:", cadr (args));
4415 4330
4416 if (cddr (SCHEME_V->args) != NIL) 4331 if (cddr (args) != NIL)
4417 { 4332 {
4418 index1 = ivalue (caddr (SCHEME_V->args)); 4333 index1 = ivalue_unchecked (caddr (args));
4419 4334
4420 if (index1 > strlength (car (SCHEME_V->args)) || index1 < index0) 4335 if (index1 > strlength (x) || index1 < index0)
4421 Error_1 ("substring: end out of bounds:", caddr (SCHEME_V->args)); 4336 Error_1 ("substring: end out of bounds:", caddr (args));
4422 } 4337 }
4423 else 4338 else
4424 index1 = strlength (car (SCHEME_V->args)); 4339 index1 = strlength (x);
4425 4340
4426 len = index1 - index0; 4341 len = index1 - index0;
4427 x = mk_empty_string (SCHEME_A_ len, ' '); 4342 x = mk_empty_string (SCHEME_A_ len, ' ');
4428 memcpy (strvalue (x), str + index0, len); 4343 memcpy (strvalue (x), str + index0, len);
4429 strvalue (x)[len] = 0; 4344 strvalue (x)[len] = 0;
… …
4433 4348
4434 case OP_VECTOR: /* vector */ 4349 case OP_VECTOR: /* vector */
4435 { 4350 {
4436 int i; 4351 int i;
4437 pointer vec; 4352 pointer vec;
4438 int len = list_length (SCHEME_A_ SCHEME_V->args); 4353 int len = list_length (SCHEME_A_ args);
4439 4354
4440 if (len < 0) 4355 if (len < 0)
4441 Error_1 ("vector: not a proper list:", SCHEME_V->args); 4356 Error_1 ("vector: not a proper list:", args);
4442 4357
4443 vec = mk_vector (SCHEME_A_ len); 4358 vec = mk_vector (SCHEME_A_ len);
4444 4359
4445#if USE_ERROR_CHECKING 4360#if USE_ERROR_CHECKING
4446 if (SCHEME_V->no_memory) 4361 if (SCHEME_V->no_memory)
4447 s_return (S_SINK); 4362 s_return (S_SINK);
4448#endif 4363#endif
4449 4364
4450 for (x = SCHEME_V->args, i = 0; is_pair (x); x = cdr (x), i++) 4365 for (x = args, i = 0; is_pair (x); x = cdr (x), i++)
4451 set_vector_elem (vec, i, car (x)); 4366 vector_set (vec, i, car (x));
4452 4367
4453 s_return (vec); 4368 s_return (vec);
4454 } 4369 }
4455 4370
4456 case OP_MKVECTOR: /* make-vector */ 4371 case OP_MKVECTOR: /* make-vector */
4457 { 4372 {
4458 pointer fill = NIL; 4373 pointer fill = NIL;
4459 int len;
4460 pointer vec; 4374 pointer vec;
4375 int len = ivalue_unchecked (x);
4461 4376
4462 len = ivalue (car (SCHEME_V->args));
4463
4464 if (cdr (SCHEME_V->args) != NIL) 4377 if (cdr (args) != NIL)
4465 fill = cadr (SCHEME_V->args); 4378 fill = cadr (args);
4466 4379
4467 vec = mk_vector (SCHEME_A_ len); 4380 vec = mk_vector (SCHEME_A_ len);
4468 4381
4469#if USE_ERROR_CHECKING 4382#if USE_ERROR_CHECKING
4470 if (SCHEME_V->no_memory) 4383 if (SCHEME_V->no_memory)
4471 s_return (S_SINK); 4384 s_return (S_SINK);
4472#endif 4385#endif
4473 4386
4474 if (fill != NIL) 4387 if (fill != NIL)
4475 fill_vector (vec, fill); 4388 fill_vector (vec, 0, fill);
4476 4389
4477 s_return (vec); 4390 s_return (vec);
4478 } 4391 }
4479 4392
4480 case OP_VECLEN: /* vector-length */ 4393 case OP_VECLEN: /* vector-length */
4481 s_return (mk_integer (SCHEME_A_ veclength (car (SCHEME_V->args)))); 4394 s_return (mk_integer (SCHEME_A_ veclength (x)));
4482 4395
4483 case OP_VECREF: /* vector-ref */ 4396 case OP_VECREF: /* vector-ref */
4484 { 4397 {
4485 int index;
4486
4487 index = ivalue (cadr (SCHEME_V->args)); 4398 int index = ivalue_unchecked (cadr (args));
4488 4399
4489 if (index >= veclength (car (SCHEME_V->args)) && USE_ERROR_CHECKING) 4400 if (index >= veclength (car (args)) && USE_ERROR_CHECKING)
4490 Error_1 ("vector-ref: out of bounds:", cadr (SCHEME_V->args)); 4401 Error_1 ("vector-ref: out of bounds:", cadr (args));
4491 4402
4492 s_return (vector_elem (car (SCHEME_V->args), index)); 4403 s_return (vector_get (x, index));
4493 } 4404 }
4494 4405
4495 case OP_VECSET: /* vector-set! */ 4406 case OP_VECSET: /* vector-set! */
4496 { 4407 {
4497 int index; 4408 int index = ivalue_unchecked (cadr (args));
4498 4409
4499 if (is_immutable (car (SCHEME_V->args))) 4410 if (is_immutable (x))
4500 Error_1 ("vector-set!: unable to alter immutable vector:", car (SCHEME_V->args)); 4411 Error_1 ("vector-set!: unable to alter immutable vector:", x);
4501 4412
4502 index = ivalue (cadr (SCHEME_V->args));
4503
4504 if (index >= veclength (car (SCHEME_V->args)) && USE_ERROR_CHECKING) 4413 if (index >= veclength (car (args)) && USE_ERROR_CHECKING)
4505 Error_1 ("vector-set!: out of bounds:", cadr (SCHEME_V->args)); 4414 Error_1 ("vector-set!: out of bounds:", cadr (args));
4506 4415
4507 set_vector_elem (car (SCHEME_V->args), index, caddr (SCHEME_V->args)); 4416 vector_set (x, index, caddr (args));
4508 s_return (car (SCHEME_V->args)); 4417 s_return (x);
4509 } 4418 }
4510 } 4419 }
4511 4420
4512 return S_T; 4421 if (USE_ERROR_CHECKING) abort ();
4513} 4422}
4514 4423
4515INTERFACE int 4424static int
4516is_list (SCHEME_P_ pointer a) 4425opexe_2 (SCHEME_P_ enum scheme_opcodes op)
4517{ 4426{
4518 return list_length (SCHEME_A_ a) >= 0; 4427 pointer x = SCHEME_V->args;
4519}
4520 4428
4521/* Result is: 4429 for (;;)
4522 proper list: length
4523 circular list: -1
4524 not even a pair: -2
4525 dotted list: -2 minus length before dot
4526*/
4527INTERFACE int
4528list_length (SCHEME_P_ pointer a)
4529{
4530 int i = 0;
4531 pointer slow, fast;
4532
4533 slow = fast = a;
4534
4535 while (1)
4536 { 4430 {
4431 num v = nvalue (car (x));
4432 x = cdr (x);
4433
4537 if (fast == NIL) 4434 if (x == NIL)
4538 return i; 4435 break;
4539 4436
4540 if (!is_pair (fast)) 4437 int r = num_cmp (v, nvalue (car (x)));
4541 return -2 - i;
4542 4438
4543 fast = cdr (fast); 4439 switch (op)
4544 ++i;
4545
4546 if (fast == NIL)
4547 return i;
4548
4549 if (!is_pair (fast))
4550 return -2 - i;
4551
4552 ++i;
4553 fast = cdr (fast);
4554
4555 /* Safe because we would have already returned if `fast'
4556 encountered a non-pair. */
4557 slow = cdr (slow);
4558
4559 if (fast == slow)
4560 { 4440 {
4561 /* the fast pointer has looped back around and caught up 4441 case OP_NUMEQ: r = r == 0; break;
4562 with the slow pointer, hence the structure is circular, 4442 case OP_LESS: r = r < 0; break;
4563 not of finite length, and therefore not a list */ 4443 case OP_GRE: r = r > 0; break;
4564 return -1; 4444 case OP_LEQ: r = r <= 0; break;
4445 case OP_GEQ: r = r >= 0; break;
4565 } 4446 }
4566 }
4567}
4568 4447
4448 if (!r)
4449 s_return (S_F);
4450 }
4451
4452 s_return (S_T);
4453}
4454
4569static pointer 4455static int
4570opexe_3 (SCHEME_P_ enum scheme_opcodes op) 4456opexe_3 (SCHEME_P_ enum scheme_opcodes op)
4571{ 4457{
4572 pointer x; 4458 pointer args = SCHEME_V->args;
4573 num v; 4459 pointer a = car (args);
4574 int (*comp_func) (num, num); 4460 pointer d = cdr (args);
4461 int r;
4575 4462
4576 switch (op) 4463 switch (op)
4577 { 4464 {
4578 case OP_NOT: /* not */ 4465 case OP_NOT: /* not */ r = is_false (a) ; break;
4579 s_retbool (is_false (car (SCHEME_V->args))); 4466 case OP_BOOLP: /* boolean? */ r = a == S_F || a == S_T; break;
4467 case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break;
4468 case OP_NULLP: /* null? */ r = a == NIL ; break;
4469 case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break;
4470 case OP_NUMBERP: /* number? */ r = is_number (a) ; break;
4471 case OP_STRINGP: /* string? */ r = is_string (a) ; break;
4472 case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break;
4473 case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */
4474 case OP_CHARP: /* char? */ r = is_character (a) ; break;
4580 4475
4581 case OP_BOOLP: /* boolean? */
4582 s_retbool (car (SCHEME_V->args) == S_F || car (SCHEME_V->args) == S_T);
4583
4584 case OP_EOFOBJP: /* boolean? */
4585 s_retbool (car (SCHEME_V->args) == S_EOF);
4586
4587 case OP_NULLP: /* null? */
4588 s_retbool (car (SCHEME_V->args) == NIL);
4589
4590 case OP_NUMEQ: /* = */
4591 case OP_LESS: /* < */
4592 case OP_GRE: /* > */
4593 case OP_LEQ: /* <= */
4594 case OP_GEQ: /* >= */
4595 switch (op)
4596 {
4597 case OP_NUMEQ:
4598 comp_func = num_eq;
4599 break;
4600
4601 case OP_LESS:
4602 comp_func = num_lt;
4603 break;
4604
4605 case OP_GRE:
4606 comp_func = num_gt;
4607 break;
4608
4609 case OP_LEQ:
4610 comp_func = num_le;
4611 break;
4612
4613 case OP_GEQ:
4614 comp_func = num_ge;
4615 break;
4616 }
4617
4618 x = SCHEME_V->args;
4619 v = nvalue (car (x));
4620 x = cdr (x);
4621
4622 for (; x != NIL; x = cdr (x))
4623 {
4624 if (!comp_func (v, nvalue (car (x))))
4625 s_retbool (0);
4626
4627 v = nvalue (car (x));
4628 }
4629
4630 s_retbool (1);
4631
4632 case OP_SYMBOLP: /* symbol? */
4633 s_retbool (is_symbol (car (SCHEME_V->args)));
4634
4635 case OP_NUMBERP: /* number? */
4636 s_retbool (is_number (car (SCHEME_V->args)));
4637
4638 case OP_STRINGP: /* string? */
4639 s_retbool (is_string (car (SCHEME_V->args)));
4640
4641 case OP_INTEGERP: /* integer? */
4642 s_retbool (is_integer (car (SCHEME_V->args)));
4643
4644 case OP_REALP: /* real? */
4645 s_retbool (is_number (car (SCHEME_V->args))); /* All numbers are real */
4646
4647 case OP_CHARP: /* char? */
4648 s_retbool (is_character (car (SCHEME_V->args)));
4649#if USE_CHAR_CLASSIFIERS 4476#if USE_CHAR_CLASSIFIERS
4650 4477 case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue_unchecked (a)); break;
4651 case OP_CHARAP: /* char-alphabetic? */ 4478 case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue_unchecked (a)); break;
4652 s_retbool (Cisalpha (ivalue (car (SCHEME_V->args)))); 4479 case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue_unchecked (a)); break;
4653 4480 case OP_CHARUP: /* char-upper-case? */ r = Cisupper (ivalue_unchecked (a)); break;
4654 case OP_CHARNP: /* char-numeric? */ 4481 case OP_CHARLP: /* char-lower-case? */ r = Cislower (ivalue_unchecked (a)); break;
4655 s_retbool (Cisdigit (ivalue (car (SCHEME_V->args))));
4656
4657 case OP_CHARWP: /* char-whitespace? */
4658 s_retbool (Cisspace (ivalue (car (SCHEME_V->args))));
4659
4660 case OP_CHARUP: /* char-upper-case? */
4661 s_retbool (Cisupper (ivalue (car (SCHEME_V->args))));
4662
4663 case OP_CHARLP: /* char-lower-case? */
4664 s_retbool (Cislower (ivalue (car (SCHEME_V->args))));
4665#endif 4482#endif
4483
4666#if USE_PORTS 4484#if USE_PORTS
4667 4485 case OP_PORTP: /* port? */ r = is_port (a) ; break;
4668 case OP_PORTP: /* port? */
4669 s_retbool (is_port (car (SCHEME_V->args)));
4670
4671 case OP_INPORTP: /* input-port? */ 4486 case OP_INPORTP: /* input-port? */ r = is_inport (a) ; break;
4672 s_retbool (is_inport (car (SCHEME_V->args)));
4673
4674 case OP_OUTPORTP: /* output-port? */ 4487 case OP_OUTPORTP: /* output-port? */ r = is_outport (a); break;
4675 s_retbool (is_outport (car (SCHEME_V->args)));
4676#endif 4488#endif
4677 4489
4678 case OP_PROCP: /* procedure? */ 4490 case OP_PROCP: /* procedure? */
4679 4491
4680 /*-- 4492 /*--
4681 * continuation should be procedure by the example 4493 * continuation should be procedure by the example
4682 * (call-with-current-continuation procedure?) ==> #t 4494 * (call-with-current-continuation procedure?) ==> #t
4683 * in R^3 report sec. 6.9 4495 * in R^3 report sec. 6.9
4684 */ 4496 */
4685 s_retbool (is_proc (car (SCHEME_V->args)) || is_closure (car (SCHEME_V->args)) 4497 r = is_proc (a) || is_closure (a) || is_continuation (a) || is_foreign (a);
4686 || is_continuation (car (SCHEME_V->args)) || is_foreign (car (SCHEME_V->args))); 4498 break;
4687 4499
4688 case OP_PAIRP: /* pair? */ 4500 case OP_PAIRP: /* pair? */ r = is_pair (a) ; break;
4689 s_retbool (is_pair (car (SCHEME_V->args))); 4501 case OP_LISTP: /* list? */ r = list_length (SCHEME_A_ a) >= 0; break;
4690 4502 case OP_ENVP: /* environment? */ r = is_environment (a) ; break;
4691 case OP_LISTP: /* list? */ 4503 case OP_VECTORP: /* vector? */ r = is_vector (a) ; break;
4692 s_retbool (list_length (SCHEME_A_ car (SCHEME_V->args)) >= 0); 4504 case OP_EQ: /* eq? */ r = a == cadr (args) ; break;
4693 4505 case OP_EQV: /* eqv? */ r = eqv (a, cadr (args)) ; break;
4694 case OP_ENVP: /* environment? */
4695 s_retbool (is_environment (car (SCHEME_V->args)));
4696
4697 case OP_VECTORP: /* vector? */
4698 s_retbool (is_vector (car (SCHEME_V->args)));
4699
4700 case OP_EQ: /* eq? */
4701 s_retbool (car (SCHEME_V->args) == cadr (SCHEME_V->args));
4702
4703 case OP_EQV: /* eqv? */
4704 s_retbool (eqv (car (SCHEME_V->args), cadr (SCHEME_V->args)));
4705 } 4506 }
4706 4507
4707 return S_T; 4508 s_retbool (r);
4708} 4509}
4709 4510
4710static pointer 4511static int
4711opexe_4 (SCHEME_P_ enum scheme_opcodes op) 4512opexe_4 (SCHEME_P_ enum scheme_opcodes op)
4712{ 4513{
4514 pointer args = SCHEME_V->args;
4515 pointer a = car (args);
4713 pointer x, y; 4516 pointer x, y;
4714 4517
4715 switch (op) 4518 switch (op)
4716 { 4519 {
4717 case OP_FORCE: /* force */ 4520 case OP_FORCE: /* force */
4718 SCHEME_V->code = car (SCHEME_V->args); 4521 SCHEME_V->code = a;
4719 4522
4720 if (is_promise (SCHEME_V->code)) 4523 if (is_promise (SCHEME_V->code))
4721 { 4524 {
4722 /* Should change type to closure here */ 4525 /* Should change type to closure here */
4723 s_save (SCHEME_A_ OP_SAVE_FORCED, NIL, SCHEME_V->code); 4526 s_save (SCHEME_A_ OP_SAVE_FORCED, NIL, SCHEME_V->code);
… …
4744 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL); 4547 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL);
4745 SCHEME_V->outport = cadr (SCHEME_V->args); 4548 SCHEME_V->outport = cadr (SCHEME_V->args);
4746 } 4549 }
4747 } 4550 }
4748 4551
4749 SCHEME_V->args = car (SCHEME_V->args); 4552 SCHEME_V->args = a;
4750 4553
4751 if (op == OP_WRITE) 4554 if (op == OP_WRITE)
4752 SCHEME_V->print_flag = 1; 4555 SCHEME_V->print_flag = 1;
4753 else 4556 else
4754 SCHEME_V->print_flag = 0; 4557 SCHEME_V->print_flag = 0;
4755 4558
4756 s_goto (OP_P0LIST); 4559 s_goto (OP_P0LIST);
4757 4560
4758 case OP_NEWLINE: /* newline */ 4561 case OP_NEWLINE: /* newline */
4759 if (is_pair (SCHEME_V->args)) 4562 if (is_pair (args))
4760 { 4563 {
4761 if (car (SCHEME_V->args) != SCHEME_V->outport) 4564 if (a != SCHEME_V->outport)
4762 { 4565 {
4763 x = cons (SCHEME_V->outport, NIL); 4566 x = cons (SCHEME_V->outport, NIL);
4764 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL); 4567 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL);
4765 SCHEME_V->outport = car (SCHEME_V->args); 4568 SCHEME_V->outport = a;
4766 } 4569 }
4767 } 4570 }
4768 4571
4769 putstr (SCHEME_A_ "\n"); 4572 putstr (SCHEME_A_ "\n");
4770 s_return (S_T); 4573 s_return (S_T);
4771#endif 4574#endif
4772 4575
4773 case OP_ERR0: /* error */ 4576 case OP_ERR0: /* error */
4774 SCHEME_V->retcode = -1; 4577 SCHEME_V->retcode = -1;
4775 4578
4776 if (!is_string (car (SCHEME_V->args))) 4579 if (!is_string (a))
4777 { 4580 {
4778 SCHEME_V->args = cons (mk_string (SCHEME_A_ " -- "), SCHEME_V->args); 4581 args = cons (mk_string (SCHEME_A_ " -- "), args);
4779 setimmutable (car (SCHEME_V->args)); 4582 setimmutable (car (args));
4780 } 4583 }
4781 4584
4782 putstr (SCHEME_A_ "Error: "); 4585 putstr (SCHEME_A_ "Error: ");
4783 putstr (SCHEME_A_ strvalue (car (SCHEME_V->args))); 4586 putstr (SCHEME_A_ strvalue (car (args)));
4784 SCHEME_V->args = cdr (SCHEME_V->args); 4587 SCHEME_V->args = cdr (args);
4785 s_goto (OP_ERR1); 4588 s_goto (OP_ERR1);
4786 4589
4787 case OP_ERR1: /* error */ 4590 case OP_ERR1: /* error */
4788 putstr (SCHEME_A_ " "); 4591 putstr (SCHEME_A_ " ");
4789 4592
4790 if (SCHEME_V->args != NIL) 4593 if (args != NIL)
4791 { 4594 {
4792 s_save (SCHEME_A_ OP_ERR1, cdr (SCHEME_V->args), NIL); 4595 s_save (SCHEME_A_ OP_ERR1, cdr (args), NIL);
4793 SCHEME_V->args = car (SCHEME_V->args); 4596 SCHEME_V->args = a;
4794 SCHEME_V->print_flag = 1; 4597 SCHEME_V->print_flag = 1;
4795 s_goto (OP_P0LIST); 4598 s_goto (OP_P0LIST);
4796 } 4599 }
4797 else 4600 else
4798 { 4601 {
4799 putstr (SCHEME_A_ "\n"); 4602 putstr (SCHEME_A_ "\n");
4800 4603
4801 if (SCHEME_V->interactive_repl) 4604 if (SCHEME_V->interactive_repl)
4802 s_goto (OP_T0LVL); 4605 s_goto (OP_T0LVL);
4803 else 4606 else
4804 return NIL; 4607 return -1;
4805 } 4608 }
4806 4609
4807 case OP_REVERSE: /* reverse */ 4610 case OP_REVERSE: /* reverse */
4808 s_return (reverse (SCHEME_A_ car (SCHEME_V->args))); 4611 s_return (reverse (SCHEME_A_ a));
4809 4612
4810 case OP_LIST_STAR: /* list* */ 4613 case OP_LIST_STAR: /* list* */
4811 s_return (list_star (SCHEME_A_ SCHEME_V->args)); 4614 s_return (list_star (SCHEME_A_ SCHEME_V->args));
4812 4615
4813 case OP_APPEND: /* append */ 4616 case OP_APPEND: /* append */
4814 x = NIL; 4617 x = NIL;
4815 y = SCHEME_V->args; 4618 y = args;
4816 4619
4817 if (y == x) 4620 if (y == x)
4818 s_return (x); 4621 s_return (x);
4819 4622
4820 /* cdr() in the while condition is not a typo. If car() */ 4623 /* cdr() in the while condition is not a typo. If car() */
… …
4831 s_return (reverse_in_place (SCHEME_A_ car (y), x)); 4634 s_return (reverse_in_place (SCHEME_A_ car (y), x));
4832 4635
4833#if USE_PLIST 4636#if USE_PLIST
4834 4637
4835 case OP_PUT: /* put */ 4638 case OP_PUT: /* put */
4836 if (!hasprop (car (SCHEME_V->args)) || !hasprop (cadr (SCHEME_V->args))) 4639 if (!hasprop (a) || !hasprop (cadr (args)))
4837 Error_0 ("illegal use of put"); 4640 Error_0 ("illegal use of put");
4838 4641
4839 for (x = symprop (car (SCHEME_V->args)), y = cadr (SCHEME_V->args); x != NIL; x = cdr (x)) 4642 for (x = symprop (a), y = cadr (args); x != NIL; x = cdr (x))
4840 { 4643 {
4841 if (caar (x) == y) 4644 if (caar (x) == y)
4842 break; 4645 break;
4843 } 4646 }
4844 4647
4845 if (x != NIL) 4648 if (x != NIL)
4846 cdar (x) = caddr (SCHEME_V->args); 4649 cdar (x) = caddr (args);
4847 else 4650 else
4848 symprop (car (SCHEME_V->args)) = cons (cons (y, caddr (SCHEME_V->args)), symprop (car (SCHEME_V->args))); 4651 symprop (a) = cons (cons (y, caddr (args)), symprop (a));
4849 4652
4850 s_return (S_T); 4653 s_return (S_T);
4851 4654
4852 case OP_GET: /* get */ 4655 case OP_GET: /* get */
4853 if (!hasprop (car (SCHEME_V->args)) || !hasprop (cadr (SCHEME_V->args))) 4656 if (!hasprop (a) || !hasprop (cadr (args)))
4854 Error_0 ("illegal use of get"); 4657 Error_0 ("illegal use of get");
4855 4658
4856 for (x = symprop (car (SCHEME_V->args)), y = cadr (SCHEME_V->args); x != NIL; x = cdr (x)) 4659 for (x = symprop (a), y = cadr (args); x != NIL; x = cdr (x))
4857 if (caar (x) == y) 4660 if (caar (x) == y)
4858 break; 4661 break;
4859 4662
4860 if (x != NIL) 4663 if (x != NIL)
4861 s_return (cdar (x)); 4664 s_return (cdar (x));
… …
4863 s_return (NIL); 4666 s_return (NIL);
4864 4667
4865#endif /* USE_PLIST */ 4668#endif /* USE_PLIST */
4866 4669
4867 case OP_QUIT: /* quit */ 4670 case OP_QUIT: /* quit */
4868 if (is_pair (SCHEME_V->args)) 4671 if (is_pair (args))
4869 SCHEME_V->retcode = ivalue (car (SCHEME_V->args)); 4672 SCHEME_V->retcode = ivalue (a);
4870 4673
4871 return NIL; 4674 return -1;
4872 4675
4873 case OP_GC: /* gc */ 4676 case OP_GC: /* gc */
4874 gc (SCHEME_A_ NIL, NIL); 4677 gc (SCHEME_A_ NIL, NIL);
4875 s_return (S_T); 4678 s_return (S_T);
4876 4679
4877 case OP_GCVERB: /* gc-verbose */ 4680 case OP_GCVERB: /* gc-verbose */
4878 { 4681 {
4879 int was = SCHEME_V->gc_verbose; 4682 int was = SCHEME_V->gc_verbose;
4880 4683
4881 SCHEME_V->gc_verbose = (car (SCHEME_V->args) != S_F); 4684 SCHEME_V->gc_verbose = (a != S_F);
4882 s_retbool (was); 4685 s_retbool (was);
4883 } 4686 }
4884 4687
4885 case OP_NEWSEGMENT: /* new-segment */ 4688 case OP_NEWSEGMENT: /* new-segment */
4886 if (!is_pair (SCHEME_V->args) || !is_number (car (SCHEME_V->args))) 4689 if (!is_pair (args) || !is_number (a))
4887 Error_0 ("new-segment: argument must be a number"); 4690 Error_0 ("new-segment: argument must be a number");
4888 4691
4889 alloc_cellseg (SCHEME_A_ (int)ivalue (car (SCHEME_V->args))); 4692 alloc_cellseg (SCHEME_A_ ivalue (a));
4890 4693
4891 s_return (S_T); 4694 s_return (S_T);
4892 4695
4893 case OP_OBLIST: /* oblist */ 4696 case OP_OBLIST: /* oblist */
4894 s_return (oblist_all_symbols (SCHEME_A)); 4697 s_return (oblist_all_symbols (SCHEME_A));
… …
4921 case OP_OPEN_INOUTFILE: 4724 case OP_OPEN_INOUTFILE:
4922 prop = port_input | port_output; 4725 prop = port_input | port_output;
4923 break; 4726 break;
4924 } 4727 }
4925 4728
4926 p = port_from_filename (SCHEME_A_ strvalue (car (SCHEME_V->args)), prop); 4729 p = port_from_filename (SCHEME_A_ strvalue (a), prop);
4927 4730
4928 if (p == NIL) 4731 s_return (p == NIL ? S_F : p);
4929 s_return (S_F);
4930
4931 s_return (p);
4932 } 4732 }
4933 4733
4934# if USE_STRING_PORTS 4734# if USE_STRING_PORTS
4935 4735
4936 case OP_OPEN_INSTRING: /* open-input-string */ 4736 case OP_OPEN_INSTRING: /* open-input-string */
… …
4948 case OP_OPEN_INOUTSTRING: 4748 case OP_OPEN_INOUTSTRING:
4949 prop = port_input | port_output; 4749 prop = port_input | port_output;
4950 break; 4750 break;
4951 } 4751 }
4952 4752
4953 p = port_from_string (SCHEME_A_ strvalue (car (SCHEME_V->args)), 4753 p = port_from_string (SCHEME_A_ strvalue (a),
4954 strvalue (car (SCHEME_V->args)) + strlength (car (SCHEME_V->args)), prop); 4754 strvalue (a) + strlength (a), prop);
4955 4755
4956 if (p == NIL) 4756 s_return (p == NIL ? S_F : p);
4957 s_return (S_F);
4958
4959 s_return (p);
4960 } 4757 }
4961 4758
4962 case OP_OPEN_OUTSTRING: /* open-output-string */ 4759 case OP_OPEN_OUTSTRING: /* open-output-string */
4963 { 4760 {
4964 pointer p; 4761 pointer p;
4965 4762
4966 if (car (SCHEME_V->args) == NIL) 4763 if (a == NIL)
4967 {
4968 p = port_from_scratch (SCHEME_A); 4764 p = port_from_scratch (SCHEME_A);
4969
4970 if (p == NIL)
4971 s_return (S_F);
4972 }
4973 else 4765 else
4974 {
4975 p = port_from_string (SCHEME_A_ strvalue (car (SCHEME_V->args)), 4766 p = port_from_string (SCHEME_A_ strvalue (a),
4976 strvalue (car (SCHEME_V->args)) + strlength (car (SCHEME_V->args)), port_output); 4767 strvalue (a) + strlength (a), port_output);
4977 4768
4978 if (p == NIL) 4769 s_return (p == NIL ? S_F : p);
4979 s_return (S_F);
4980 }
4981
4982 s_return (p);
4983 } 4770 }
4984 4771
4985 case OP_GET_OUTSTRING: /* get-output-string */ 4772 case OP_GET_OUTSTRING: /* get-output-string */
4986 { 4773 {
4987 port *p; 4774 port *p;
4988 4775
4989 if ((p = car (SCHEME_V->args)->object.port)->kind & port_string) 4776 if ((p = a->object.port)->kind & port_string)
4990 { 4777 {
4991 off_t size; 4778 off_t size;
4992 char *str; 4779 char *str;
4993 4780
4994 size = p->rep.string.curr - p->rep.string.start + 1; 4781 size = p->rep.string.curr - p->rep.string.start + 1;
… …
5010 } 4797 }
5011 4798
5012# endif 4799# endif
5013 4800
5014 case OP_CLOSE_INPORT: /* close-input-port */ 4801 case OP_CLOSE_INPORT: /* close-input-port */
5015 port_close (SCHEME_A_ car (SCHEME_V->args), port_input); 4802 port_close (SCHEME_A_ a, port_input);
5016 s_return (S_T); 4803 s_return (S_T);
5017 4804
5018 case OP_CLOSE_OUTPORT: /* close-output-port */ 4805 case OP_CLOSE_OUTPORT: /* close-output-port */
5019 port_close (SCHEME_A_ car (SCHEME_V->args), port_output); 4806 port_close (SCHEME_A_ a, port_output);
5020 s_return (S_T); 4807 s_return (S_T);
5021#endif 4808#endif
5022 4809
5023 case OP_INT_ENV: /* interaction-environment */ 4810 case OP_INT_ENV: /* interaction-environment */
5024 s_return (SCHEME_V->global_env); 4811 s_return (SCHEME_V->global_env);
… …
5026 case OP_CURR_ENV: /* current-environment */ 4813 case OP_CURR_ENV: /* current-environment */
5027 s_return (SCHEME_V->envir); 4814 s_return (SCHEME_V->envir);
5028 4815
5029 } 4816 }
5030 4817
5031 return S_T; 4818 if (USE_ERROR_CHECKING) abort ();
5032} 4819}
5033 4820
5034static pointer 4821static int
5035opexe_5 (SCHEME_P_ enum scheme_opcodes op) 4822opexe_5 (SCHEME_P_ enum scheme_opcodes op)
5036{ 4823{
4824 pointer args = SCHEME_V->args;
5037 pointer x; 4825 pointer x;
5038 4826
5039 if (SCHEME_V->nesting != 0) 4827 if (SCHEME_V->nesting != 0)
5040 { 4828 {
5041 int n = SCHEME_V->nesting; 4829 int n = SCHEME_V->nesting;
… …
5048 switch (op) 4836 switch (op)
5049 { 4837 {
5050 /* ========== reading part ========== */ 4838 /* ========== reading part ========== */
5051#if USE_PORTS 4839#if USE_PORTS
5052 case OP_READ: 4840 case OP_READ:
5053 if (!is_pair (SCHEME_V->args)) 4841 if (!is_pair (args))
5054 s_goto (OP_READ_INTERNAL); 4842 s_goto (OP_READ_INTERNAL);
5055 4843
5056 if (!is_inport (car (SCHEME_V->args))) 4844 if (!is_inport (car (args)))
5057 Error_1 ("read: not an input port:", car (SCHEME_V->args)); 4845 Error_1 ("read: not an input port:", car (args));
5058 4846
5059 if (car (SCHEME_V->args) == SCHEME_V->inport) 4847 if (car (args) == SCHEME_V->inport)
5060 s_goto (OP_READ_INTERNAL); 4848 s_goto (OP_READ_INTERNAL);
5061 4849
5062 x = SCHEME_V->inport; 4850 x = SCHEME_V->inport;
5063 SCHEME_V->inport = car (SCHEME_V->args); 4851 SCHEME_V->inport = car (args);
5064 x = cons (x, NIL); 4852 x = cons (x, NIL);
5065 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); 4853 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL);
5066 s_goto (OP_READ_INTERNAL); 4854 s_goto (OP_READ_INTERNAL);
5067 4855
5068 case OP_READ_CHAR: /* read-char */ 4856 case OP_READ_CHAR: /* read-char */
5069 case OP_PEEK_CHAR: /* peek-char */ 4857 case OP_PEEK_CHAR: /* peek-char */
5070 { 4858 {
5071 int c; 4859 int c;
5072 4860
5073 if (is_pair (SCHEME_V->args)) 4861 if (is_pair (args))
5074 { 4862 {
5075 if (car (SCHEME_V->args) != SCHEME_V->inport) 4863 if (car (args) != SCHEME_V->inport)
5076 { 4864 {
5077 x = SCHEME_V->inport; 4865 x = SCHEME_V->inport;
5078 x = cons (x, NIL); 4866 x = cons (x, NIL);
5079 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); 4867 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL);
5080 SCHEME_V->inport = car (SCHEME_V->args); 4868 SCHEME_V->inport = car (args);
5081 } 4869 }
5082 } 4870 }
5083 4871
5084 c = inchar (SCHEME_A); 4872 c = inchar (SCHEME_A);
5085 4873
… …
5095 case OP_CHAR_READY: /* char-ready? */ 4883 case OP_CHAR_READY: /* char-ready? */
5096 { 4884 {
5097 pointer p = SCHEME_V->inport; 4885 pointer p = SCHEME_V->inport;
5098 int res; 4886 int res;
5099 4887
5100 if (is_pair (SCHEME_V->args)) 4888 if (is_pair (args))
5101 p = car (SCHEME_V->args); 4889 p = car (args);
5102 4890
5103 res = p->object.port->kind & port_string; 4891 res = p->object.port->kind & port_string;
5104 4892
5105 s_retbool (res); 4893 s_retbool (res);
5106 } 4894 }
5107 4895
5108 case OP_SET_INPORT: /* set-input-port */ 4896 case OP_SET_INPORT: /* set-input-port */
5109 SCHEME_V->inport = car (SCHEME_V->args); 4897 SCHEME_V->inport = car (args);
5110 s_return (SCHEME_V->value); 4898 s_return (SCHEME_V->value);
5111 4899
5112 case OP_SET_OUTPORT: /* set-output-port */ 4900 case OP_SET_OUTPORT: /* set-output-port */
5113 SCHEME_V->outport = car (SCHEME_V->args); 4901 SCHEME_V->outport = car (args);
5114 s_return (SCHEME_V->value); 4902 s_return (SCHEME_V->value);
5115#endif 4903#endif
5116 4904
5117 case OP_RDSEXPR: 4905 case OP_RDSEXPR:
5118 switch (SCHEME_V->tok) 4906 switch (SCHEME_V->tok)
… …
5204 } 4992 }
5205 4993
5206 break; 4994 break;
5207 4995
5208 case OP_RDLIST: 4996 case OP_RDLIST:
5209 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 4997 SCHEME_V->args = cons (SCHEME_V->value, args);
5210 SCHEME_V->tok = token (SCHEME_A); 4998 SCHEME_V->tok = token (SCHEME_A);
5211 4999
5212 switch (SCHEME_V->tok) 5000 switch (SCHEME_V->tok)
5213 { 5001 {
5214 case TOK_EOF: 5002 case TOK_EOF:
… …
5242 case OP_RDDOT: 5030 case OP_RDDOT:
5243 if (token (SCHEME_A) != TOK_RPAREN) 5031 if (token (SCHEME_A) != TOK_RPAREN)
5244 Error_0 ("syntax error: illegal dot expression"); 5032 Error_0 ("syntax error: illegal dot expression");
5245 5033
5246 SCHEME_V->nesting_stack[SCHEME_V->file_i]--; 5034 SCHEME_V->nesting_stack[SCHEME_V->file_i]--;
5247 s_return (reverse_in_place (SCHEME_A_ SCHEME_V->value, SCHEME_V->args)); 5035 s_return (reverse_in_place (SCHEME_A_ SCHEME_V->value, args));
5248 5036
5249 case OP_RDQUOTE: 5037 case OP_RDQUOTE:
5250 s_return (cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL))); 5038 s_return (cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL)));
5251 5039
5252 case OP_RDQQUOTE: 5040 case OP_RDQQUOTE:
… …
5274 SCHEME_V->args = SCHEME_V->value; 5062 SCHEME_V->args = SCHEME_V->value;
5275 s_goto (OP_VECTOR); 5063 s_goto (OP_VECTOR);
5276 5064
5277 /* ========== printing part ========== */ 5065 /* ========== printing part ========== */
5278 case OP_P0LIST: 5066 case OP_P0LIST:
5279 if (is_vector (SCHEME_V->args)) 5067 if (is_vector (args))
5280 { 5068 {
5281 putstr (SCHEME_A_ "#("); 5069 putstr (SCHEME_A_ "#(");
5282 SCHEME_V->args = cons (SCHEME_V->args, mk_integer (SCHEME_A_ 0)); 5070 SCHEME_V->args = cons (args, mk_integer (SCHEME_A_ 0));
5283 s_goto (OP_PVECFROM); 5071 s_goto (OP_PVECFROM);
5284 } 5072 }
5285 else if (is_environment (SCHEME_V->args)) 5073 else if (is_environment (args))
5286 { 5074 {
5287 putstr (SCHEME_A_ "#<ENVIRONMENT>"); 5075 putstr (SCHEME_A_ "#<ENVIRONMENT>");
5288 s_return (S_T); 5076 s_return (S_T);
5289 } 5077 }
5290 else if (!is_pair (SCHEME_V->args)) 5078 else if (!is_pair (args))
5291 { 5079 {
5292 printatom (SCHEME_A_ SCHEME_V->args, SCHEME_V->print_flag); 5080 printatom (SCHEME_A_ args, SCHEME_V->print_flag);
5293 s_return (S_T); 5081 s_return (S_T);
5294 } 5082 }
5295 else if (car (SCHEME_V->args) == SCHEME_V->QUOTE && ok_abbrev (cdr (SCHEME_V->args))) 5083 else
5296 { 5084 {
5085 pointer a = car (args);
5086 pointer b = cdr (args);
5087 int ok_abbr = ok_abbrev (b);
5088 SCHEME_V->args = car (b);
5089
5090 if (a == SCHEME_V->QUOTE && ok_abbr)
5297 putstr (SCHEME_A_ "'"); 5091 putstr (SCHEME_A_ "'");
5298 SCHEME_V->args = cadr (SCHEME_V->args); 5092 else if (a == SCHEME_V->QQUOTE && ok_abbr)
5093 putstr (SCHEME_A_ "`");
5094 else if (a == SCHEME_V->UNQUOTE && ok_abbr)
5095 putstr (SCHEME_A_ ",");
5096 else if (a == SCHEME_V->UNQUOTESP && ok_abbr)
5097 putstr (SCHEME_A_ ",@");
5098 else
5099 {
5100 putstr (SCHEME_A_ "(");
5101 s_save (SCHEME_A_ OP_P1LIST, b, NIL);
5102 SCHEME_V->args = a;
5103 }
5104
5299 s_goto (OP_P0LIST); 5105 s_goto (OP_P0LIST);
5300 } 5106 }
5301 else if (car (SCHEME_V->args) == SCHEME_V->QQUOTE && ok_abbrev (cdr (SCHEME_V->args))) 5107
5108 case OP_P1LIST:
5109 if (is_pair (args))
5302 { 5110 {
5111 s_save (SCHEME_A_ OP_P1LIST, cdr (args), NIL);
5303 putstr (SCHEME_A_ "`"); 5112 putstr (SCHEME_A_ " ");
5304 SCHEME_V->args = cadr (SCHEME_V->args); 5113 SCHEME_V->args = car (args);
5305 s_goto (OP_P0LIST); 5114 s_goto (OP_P0LIST);
5306 } 5115 }
5307 else if (car (SCHEME_V->args) == SCHEME_V->UNQUOTE && 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 if (car (SCHEME_V->args) == SCHEME_V->UNQUOTESP && ok_abbrev (cdr (SCHEME_V->args)))
5314 {
5315 putstr (SCHEME_A_ ",@");
5316 SCHEME_V->args = cadr (SCHEME_V->args);
5317 s_goto (OP_P0LIST);
5318 }
5319 else
5320 {
5321 putstr (SCHEME_A_ "(");
5322 s_save (SCHEME_A_ OP_P1LIST, cdr (SCHEME_V->args), NIL);
5323 SCHEME_V->args = car (SCHEME_V->args);
5324 s_goto (OP_P0LIST);
5325 }
5326
5327 case OP_P1LIST:
5328 if (is_pair (SCHEME_V->args))
5329 {
5330 s_save (SCHEME_A_ OP_P1LIST, cdr (SCHEME_V->args), NIL);
5331 putstr (SCHEME_A_ " ");
5332 SCHEME_V->args = car (SCHEME_V->args);
5333 s_goto (OP_P0LIST);
5334 }
5335 else if (is_vector (SCHEME_V->args)) 5116 else if (is_vector (args))
5336 { 5117 {
5337 s_save (SCHEME_A_ OP_P1LIST, NIL, NIL); 5118 s_save (SCHEME_A_ OP_P1LIST, NIL, NIL);
5338 putstr (SCHEME_A_ " . "); 5119 putstr (SCHEME_A_ " . ");
5339 s_goto (OP_P0LIST); 5120 s_goto (OP_P0LIST);
5340 } 5121 }
5341 else 5122 else
5342 { 5123 {
5343 if (SCHEME_V->args != NIL) 5124 if (args != NIL)
5344 { 5125 {
5345 putstr (SCHEME_A_ " . "); 5126 putstr (SCHEME_A_ " . ");
5346 printatom (SCHEME_A_ SCHEME_V->args, SCHEME_V->print_flag); 5127 printatom (SCHEME_A_ args, SCHEME_V->print_flag);
5347 } 5128 }
5348 5129
5349 putstr (SCHEME_A_ ")"); 5130 putstr (SCHEME_A_ ")");
5350 s_return (S_T); 5131 s_return (S_T);
5351 } 5132 }
5352 5133
5353 case OP_PVECFROM: 5134 case OP_PVECFROM:
5354 { 5135 {
5355 int i = ivalue_unchecked (cdr (SCHEME_V->args)); 5136 int i = ivalue_unchecked (cdr (args));
5356 pointer vec = car (SCHEME_V->args); 5137 pointer vec = car (args);
5357 int len = veclength (vec); 5138 int len = veclength (vec);
5358 5139
5359 if (i == len) 5140 if (i == len)
5360 { 5141 {
5361 putstr (SCHEME_A_ ")"); 5142 putstr (SCHEME_A_ ")");
5362 s_return (S_T); 5143 s_return (S_T);
5363 } 5144 }
5364 else 5145 else
5365 { 5146 {
5366 pointer elem = vector_elem (vec, i); 5147 pointer elem = vector_get (vec, i);
5367 5148
5368 ivalue_unchecked (cdr (SCHEME_V->args)) = i + 1; 5149 ivalue_unchecked (cdr (args)) = i + 1;
5369 s_save (SCHEME_A_ OP_PVECFROM, SCHEME_V->args, NIL); 5150 s_save (SCHEME_A_ OP_PVECFROM, args, NIL);
5370 SCHEME_V->args = elem; 5151 SCHEME_V->args = elem;
5371 5152
5372 if (i > 0) 5153 if (i > 0)
5373 putstr (SCHEME_A_ " "); 5154 putstr (SCHEME_A_ " ");
5374 5155
5375 s_goto (OP_P0LIST); 5156 s_goto (OP_P0LIST);
5376 } 5157 }
5377 } 5158 }
5378 } 5159 }
5379 5160
5380 return S_T; 5161 if (USE_ERROR_CHECKING) abort ();
5381} 5162}
5382 5163
5383static pointer 5164static int
5384opexe_6 (SCHEME_P_ enum scheme_opcodes op) 5165opexe_6 (SCHEME_P_ enum scheme_opcodes op)
5385{ 5166{
5167 pointer args = SCHEME_V->args;
5168 pointer a = car (args);
5386 pointer x, y; 5169 pointer x, y;
5387 5170
5388 switch (op) 5171 switch (op)
5389 { 5172 {
5390 case OP_LIST_LENGTH: /* length *//* a.k */ 5173 case OP_LIST_LENGTH: /* length *//* a.k */
5391 { 5174 {
5392 long v = list_length (SCHEME_A_ car (SCHEME_V->args)); 5175 long v = list_length (SCHEME_A_ a);
5393 5176
5394 if (v < 0) 5177 if (v < 0)
5395 Error_1 ("length: not a list:", car (SCHEME_V->args)); 5178 Error_1 ("length: not a list:", a);
5396 5179
5397 s_return (mk_integer (SCHEME_A_ v)); 5180 s_return (mk_integer (SCHEME_A_ v));
5398 } 5181 }
5399 5182
5400 case OP_ASSQ: /* assq *//* a.k */ 5183 case OP_ASSQ: /* assq *//* a.k */
5401 x = car (SCHEME_V->args); 5184 x = a;
5402 5185
5403 for (y = cadr (SCHEME_V->args); is_pair (y); y = cdr (y)) 5186 for (y = cadr (args); is_pair (y); y = cdr (y))
5404 { 5187 {
5405 if (!is_pair (car (y))) 5188 if (!is_pair (car (y)))
5406 Error_0 ("unable to handle non pair element"); 5189 Error_0 ("unable to handle non pair element");
5407 5190
5408 if (x == caar (y)) 5191 if (x == caar (y))
… …
5414 else 5197 else
5415 s_return (S_F); 5198 s_return (S_F);
5416 5199
5417 5200
5418 case OP_GET_CLOSURE: /* get-closure-code *//* a.k */ 5201 case OP_GET_CLOSURE: /* get-closure-code *//* a.k */
5419 SCHEME_V->args = car (SCHEME_V->args); 5202 SCHEME_V->args = a;
5420 5203
5421 if (SCHEME_V->args == NIL) 5204 if (SCHEME_V->args == NIL)
5422 s_return (S_F); 5205 s_return (S_F);
5423 else if (is_closure (SCHEME_V->args)) 5206 else if (is_closure (SCHEME_V->args))
5424 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value))); 5207 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value)));
… …
5430 case OP_CLOSUREP: /* closure? */ 5213 case OP_CLOSUREP: /* closure? */
5431 /* 5214 /*
5432 * Note, macro object is also a closure. 5215 * Note, macro object is also a closure.
5433 * Therefore, (closure? <#MACRO>) ==> #t 5216 * Therefore, (closure? <#MACRO>) ==> #t
5434 */ 5217 */
5435 s_retbool (is_closure (car (SCHEME_V->args))); 5218 s_retbool (is_closure (a));
5436 5219
5437 case OP_MACROP: /* macro? */ 5220 case OP_MACROP: /* macro? */
5438 s_retbool (is_macro (car (SCHEME_V->args))); 5221 s_retbool (is_macro (a));
5439 } 5222 }
5440 5223
5441 return S_T; /* NOTREACHED */ 5224 if (USE_ERROR_CHECKING) abort ();
5442} 5225}
5443 5226
5227/* dispatch functions (opexe_x) return new opcode, or 0 for same opcode, or -1 to stop */
5444typedef pointer (*dispatch_func) (SCHEME_P_ enum scheme_opcodes); 5228typedef int (*dispatch_func)(SCHEME_P_ enum scheme_opcodes);
5445 5229
5446typedef int (*test_predicate) (pointer); 5230typedef int (*test_predicate)(pointer);
5447static int 5231static int
5448is_any (pointer p) 5232tst_any (pointer p)
5449{ 5233{
5450 return 1; 5234 return 1;
5451} 5235}
5452 5236
5453static int 5237static int
5454is_nonneg (pointer p) 5238tst_inonneg (pointer p)
5455{ 5239{
5456 return ivalue (p) >= 0 && is_integer (p); 5240 return is_integer (p) && ivalue_unchecked (p) >= 0;
5241}
5242
5243static int
5244tst_is_list (SCHEME_P_ pointer p)
5245{
5246 return p == NIL || is_pair (p);
5457} 5247}
5458 5248
5459/* Correspond carefully with following defines! */ 5249/* Correspond carefully with following defines! */
5460static struct 5250static struct
5461{ 5251{
5462 test_predicate fct; 5252 test_predicate fct;
5463 const char *kind; 5253 const char *kind;
5464} tests[] = 5254} tests[] = {
5465{ 5255 { tst_any , 0 },
5466 { 0, 0}, /* unused */ 5256 { is_string , "string" },
5467 { is_any, 0}, 5257 { is_symbol , "symbol" },
5468 { is_string, "string" }, 5258 { is_port , "port" },
5469 { is_symbol, "symbol" },
5470 { is_port, "port" },
5471 { is_inport, "input port" }, 5259 { is_inport , "input port" },
5472 { is_outport, "output port" }, 5260 { is_outport , "output port" },
5473 { is_environment, "environment" }, 5261 { is_environment, "environment" },
5474 { is_pair, "pair" }, 5262 { is_pair , "pair" },
5475 { 0, "pair or '()" }, 5263 { 0 , "pair or '()" },
5476 { is_character, "character" }, 5264 { is_character , "character" },
5477 { is_vector, "vector" }, 5265 { is_vector , "vector" },
5478 { is_number, "number" }, 5266 { is_number , "number" },
5479 { is_integer, "integer" }, 5267 { is_integer , "integer" },
5480 { is_nonneg, "non-negative integer" } 5268 { tst_inonneg , "non-negative integer" }
5481}; 5269};
5482 5270
5483#define TST_NONE 0 5271#define TST_NONE 0 /* TST_NONE used for built-ins, 0 for internal ops */
5484#define TST_ANY "\001" 5272#define TST_ANY "\001"
5485#define TST_STRING "\002" 5273#define TST_STRING "\002"
5486#define TST_SYMBOL "\003" 5274#define TST_SYMBOL "\003"
5487#define TST_PORT "\004" 5275#define TST_PORT "\004"
5488#define TST_INPORT "\005" 5276#define TST_INPORT "\005"
5489#define TST_OUTPORT "\006" 5277#define TST_OUTPORT "\006"
5490#define TST_ENVIRONMENT "\007" 5278#define TST_ENVIRONMENT "\007"
5491#define TST_PAIR "\010" 5279#define TST_PAIR "\010"
5492#define TST_LIST "\011" 5280#define TST_LIST "\011"
5493#define TST_CHAR "\012" 5281#define TST_CHAR "\012"
5494#define TST_VECTOR "\013" 5282#define TST_VECTOR "\013"
5495#define TST_NUMBER "\014" 5283#define TST_NUMBER "\014"
5496#define TST_INTEGER "\015" 5284#define TST_INTEGER "\015"
5497#define TST_NATURAL "\016" 5285#define TST_NATURAL "\016"
5286
5287#define INF_ARG 0xff
5288#define UNNAMED_OP ""
5289
5290static const char opnames[] =
5291#define OP_DEF(func,name,minarity,maxarity,argtest,op) name "\x00"
5292#include "opdefines.h"
5293#undef OP_DEF
5294;
5295
5296static const char *
5297opname (int idx)
5298{
5299 const char *name = opnames;
5300
5301 /* should do this at compile time, but would require external program, right? */
5302 while (idx--)
5303 name += strlen (name) + 1;
5304
5305 return *name ? name : "ILLEGAL";
5306}
5307
5308static const char *
5309procname (pointer x)
5310{
5311 return opname (procnum (x));
5312}
5498 5313
5499typedef struct 5314typedef struct
5500{ 5315{
5501 dispatch_func func; 5316 uint8_t func;
5502 char *name; 5317 /*dispatch_func func;*//*TODO: maybe optionally keep the pointer, for speed? */
5318 uint8_t builtin;
5319#if USE_ERROR_CHECKING
5503 int min_arity; 5320 uint8_t min_arity;
5504 int max_arity; 5321 uint8_t max_arity;
5505 char *arg_tests_encoding; 5322 char arg_tests_encoding[3];
5323#endif
5506} op_code_info; 5324} op_code_info;
5507 5325
5508#define INF_ARG 0xffff
5509
5510static op_code_info dispatch_table[] = { 5326static const op_code_info dispatch_table[] = {
5511#define OP_DEF(A,B,C,D,E,OP) {A,B,C,D,E}, 5327#if USE_ERROR_CHECKING
5328#define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1, minarity, maxarity, argtest },
5329#else
5330#define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1 },
5331#endif
5512#include "opdefines.h" 5332#include "opdefines.h"
5333#undef OP_DEF
5513 {0} 5334 {0}
5514}; 5335};
5515 5336
5516static const char *
5517procname (pointer x)
5518{
5519 int n = procnum (x);
5520 const char *name = dispatch_table[n].name;
5521
5522 if (name == 0)
5523 name = "ILLEGAL!";
5524
5525 return name;
5526}
5527
5528/* kernel of this interpreter */ 5337/* kernel of this interpreter */
5529static void 5338static void ecb_hot
5530Eval_Cycle (SCHEME_P_ enum scheme_opcodes op) 5339Eval_Cycle (SCHEME_P_ enum scheme_opcodes op)
5531{ 5340{
5532 SCHEME_V->op = op; 5341 SCHEME_V->op = op;
5533 5342
5534 for (;;) 5343 for (;;)
5535 { 5344 {
5536 op_code_info *pcd = dispatch_table + SCHEME_V->op; 5345 const op_code_info *pcd = dispatch_table + SCHEME_V->op;
5537 5346
5538#if USE_ERROR_CHECKING 5347#if USE_ERROR_CHECKING
5539 if (pcd->name) /* if built-in function, check arguments */ 5348 if (pcd->builtin) /* if built-in function, check arguments */
5540 { 5349 {
5541 int ok = 1;
5542 char msg[STRBUFFSIZE]; 5350 char msg[STRBUFFSIZE];
5543 int n = list_length (SCHEME_A_ SCHEME_V->args); 5351 int n = list_length (SCHEME_A_ SCHEME_V->args);
5544 5352
5545 /* Check number of arguments */ 5353 /* Check number of arguments */
5546 if (n < pcd->min_arity) 5354 if (ecb_expect_false (n < pcd->min_arity))
5547 { 5355 {
5548 ok = 0;
5549 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", 5356 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)",
5550 pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity); 5357 opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity);
5358 xError_1 (SCHEME_A_ msg, 0);
5359 continue;
5551 } 5360 }
5552 5361 else if (ecb_expect_false (n > pcd->max_arity && pcd->max_arity != INF_ARG))
5553 if (ok && n > pcd->max_arity)
5554 { 5362 {
5555 ok = 0;
5556 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", 5363 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)",
5557 pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity); 5364 opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity);
5365 xError_1 (SCHEME_A_ msg, 0);
5366 continue;
5558 } 5367 }
5559 5368 else
5560 if (ok)
5561 { 5369 {
5562 if (pcd->arg_tests_encoding) 5370 if (*pcd->arg_tests_encoding) /* literal 0 and TST_NONE treated the same */
5563 { 5371 {
5564 int i = 0; 5372 int i = 0;
5565 int j; 5373 int j;
5566 const char *t = pcd->arg_tests_encoding; 5374 const char *t = pcd->arg_tests_encoding;
5567 pointer arglist = SCHEME_V->args; 5375 pointer arglist = SCHEME_V->args;
5568 5376
5569 do 5377 do
5570 { 5378 {
5571 pointer arg = car (arglist); 5379 pointer arg = car (arglist);
5572 5380
5573 j = (int) t[0]; 5381 j = t[0];
5574 5382
5383 /*TODO: tst_is_list has different prototype - fix if other tests acquire same prototype */
5575 if (j == TST_LIST[0]) 5384 if (j == TST_LIST[0])
5576 { 5385 {
5577 if (arg != NIL && !is_pair (arg)) 5386 if (!tst_is_list (SCHEME_A_ arg))
5578 break; 5387 break;
5579 } 5388 }
5580 else 5389 else
5581 { 5390 {
5582 if (!tests[j].fct (arg)) 5391 if (!tests[j - 1].fct (arg))
5583 break; 5392 break;
5584 } 5393 }
5585 5394
5586 if (t[1] != 0) /* last test is replicated as necessary */ 5395 if (t < pcd->arg_tests_encoding + sizeof (pcd->arg_tests_encoding) - 1 && t[1]) /* last test is replicated as necessary */
5587 t++; 5396 t++;
5588 5397
5589 arglist = cdr (arglist); 5398 arglist = cdr (arglist);
5590 i++; 5399 i++;
5591 } 5400 }
5592 while (i < n); 5401 while (i < n);
5593 5402
5594 if (i < n) 5403 if (i < n)
5595 { 5404 {
5596 ok = 0;
5597 snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", pcd->name, i + 1, tests[j].kind); 5405 snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", opname (SCHEME_V->op), i + 1, tests[j].kind);
5406 xError_1 (SCHEME_A_ msg, 0);
5407 continue;
5598 } 5408 }
5599 } 5409 }
5600 } 5410 }
5601
5602 if (!ok)
5603 {
5604 if (xError_1 (SCHEME_A_ msg, 0) == NIL)
5605 return;
5606
5607 pcd = dispatch_table + SCHEME_V->op;
5608 }
5609 } 5411 }
5610#endif 5412#endif
5611 5413
5612 ok_to_freely_gc (SCHEME_A); 5414 ok_to_freely_gc (SCHEME_A);
5613 5415
5614 if (pcd->func (SCHEME_A_ SCHEME_V->op) == NIL) 5416 static const dispatch_func dispatch_funcs[] = {
5417 opexe_0,
5418 opexe_1,
5419 opexe_2,
5420 opexe_3,
5421 opexe_4,
5422 opexe_5,
5423 opexe_6,
5424 };
5425
5426 if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0))
5615 return; 5427 return;
5616 5428
5617 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 5429 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
5618 { 5430 {
5619 xwrstr ("No memory!\n"); 5431 xwrstr ("No memory!\n");
… …
5643mk_proc (SCHEME_P_ enum scheme_opcodes op) 5455mk_proc (SCHEME_P_ enum scheme_opcodes op)
5644{ 5456{
5645 pointer y = get_cell (SCHEME_A_ NIL, NIL); 5457 pointer y = get_cell (SCHEME_A_ NIL, NIL);
5646 set_typeflag (y, (T_PROC | T_ATOM)); 5458 set_typeflag (y, (T_PROC | T_ATOM));
5647 ivalue_unchecked (y) = op; 5459 ivalue_unchecked (y) = op;
5648 set_num_integer (y);
5649 return y; 5460 return y;
5650} 5461}
5651 5462
5652/* Hard-coded for the given keywords. Remember to rewrite if more are added! */ 5463/* Hard-coded for the given keywords. Remember to rewrite if more are added! */
5653static int 5464static int
… …
5677 5488
5678 case 'd': 5489 case 'd':
5679 return OP_COND0; /* cond */ 5490 return OP_COND0; /* cond */
5680 5491
5681 case '*': 5492 case '*':
5682 return OP_LET0AST; /* let* */ 5493 return OP_LET0AST;/* let* */
5683 5494
5684 default: 5495 default:
5685 return OP_SET0; /* set! */ 5496 return OP_SET0; /* set! */
5686 } 5497 }
5687 5498
… …
5709 5520
5710 case 'f': 5521 case 'f':
5711 return OP_DEF0; /* define */ 5522 return OP_DEF0; /* define */
5712 5523
5713 default: 5524 default:
5714 return OP_LET0REC; /* letrec */ 5525 return OP_LET0REC;/* letrec */
5715 } 5526 }
5716 5527
5717 default: 5528 default:
5718 return OP_C0STREAM; /* cons-stream */ 5529 return OP_C0STREAM; /* cons-stream */
5719 } 5530 }
5720} 5531}
5721 5532
5722#if USE_MULTIPLICITY 5533#if USE_MULTIPLICITY
5723scheme * 5534ecb_cold scheme *
5724scheme_init_new () 5535scheme_init_new ()
5725{ 5536{
5726 scheme *sc = malloc (sizeof (scheme)); 5537 scheme *sc = malloc (sizeof (scheme));
5727 5538
5728 if (!scheme_init (SCHEME_A)) 5539 if (!scheme_init (SCHEME_A))
… …
5733 else 5544 else
5734 return sc; 5545 return sc;
5735} 5546}
5736#endif 5547#endif
5737 5548
5738int 5549ecb_cold int
5739scheme_init (SCHEME_P) 5550scheme_init (SCHEME_P)
5740{ 5551{
5741 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]); 5552 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]);
5742 pointer x; 5553 pointer x;
5743 5554
… …
5816 5627
5817 for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i) 5628 for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i)
5818 assign_syntax (SCHEME_A_ syntax_names[i]); 5629 assign_syntax (SCHEME_A_ syntax_names[i]);
5819 } 5630 }
5820 5631
5632 // TODO: should iterate via strlen, to avoid n² complexity
5821 for (i = 0; i < n; i++) 5633 for (i = 0; i < n; i++)
5822 if (dispatch_table[i].name != 0) 5634 if (dispatch_table[i].builtin)
5823 assign_proc (SCHEME_A_ i, dispatch_table[i].name); 5635 assign_proc (SCHEME_A_ i, opname (i));
5824 5636
5825 /* initialization of global pointers to special symbols */ 5637 /* initialization of global pointers to special symbols */
5826 SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda"); 5638 SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda");
5827 SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote"); 5639 SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote");
5828 SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote"); 5640 SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote");
… …
5867scheme_set_external_data (SCHEME_P_ void *p) 5679scheme_set_external_data (SCHEME_P_ void *p)
5868{ 5680{
5869 SCHEME_V->ext_data = p; 5681 SCHEME_V->ext_data = p;
5870} 5682}
5871 5683
5872void 5684ecb_cold void
5873scheme_deinit (SCHEME_P) 5685scheme_deinit (SCHEME_P)
5874{ 5686{
5875 int i; 5687 int i;
5876 5688
5877#if SHOW_ERROR_LINE 5689#if SHOW_ERROR_LINE
… …
5969{ 5781{
5970 dump_stack_reset (SCHEME_A); 5782 dump_stack_reset (SCHEME_A);
5971 SCHEME_V->envir = SCHEME_V->global_env; 5783 SCHEME_V->envir = SCHEME_V->global_env;
5972 SCHEME_V->file_i = 0; 5784 SCHEME_V->file_i = 0;
5973 SCHEME_V->load_stack[0].kind = port_input | port_string; 5785 SCHEME_V->load_stack[0].kind = port_input | port_string;
5974 SCHEME_V->load_stack[0].rep.string.start = (char *) cmd; /* This func respects const */ 5786 SCHEME_V->load_stack[0].rep.string.start = (char *)cmd; /* This func respects const */
5975 SCHEME_V->load_stack[0].rep.string.past_the_end = (char *) cmd + strlen (cmd); 5787 SCHEME_V->load_stack[0].rep.string.past_the_end = (char *)cmd + strlen (cmd);
5976 SCHEME_V->load_stack[0].rep.string.curr = (char *) cmd; 5788 SCHEME_V->load_stack[0].rep.string.curr = (char *)cmd;
5977#if USE_PORTS 5789#if USE_PORTS
5978 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack); 5790 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack);
5979#endif 5791#endif
5980 SCHEME_V->retcode = 0; 5792 SCHEME_V->retcode = 0;
5981 SCHEME_V->interactive_repl = 0; 5793 SCHEME_V->interactive_repl = 0;

Diff Legend

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