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.7 by root, Wed Nov 25 22:12:59 2015 UTC vs.
Revision 1.29 by root, Sat Nov 28 10:31:06 2015 UTC

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

Diff Legend

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