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

Diff Legend

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