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.37 by root, Sun Nov 29 05:09:24 2015 UTC

… …
28#endif 28#endif
29#if USE_MATH 29#if USE_MATH
30# include <math.h> 30# include <math.h>
31#endif 31#endif
32 32
33#include "ecb.h"
34
33#include <sys/types.h> 35#include <sys/types.h>
34#include <sys/stat.h> 36#include <sys/stat.h>
35#include <fcntl.h> 37#include <fcntl.h>
36 38
39#if !USE_ERROR_CHECKING
40# define NDEBUG
41#endif
42
43#include <assert.h>
44#include <stdlib.h>
37#include <string.h> 45#include <string.h>
38#include <stdlib.h>
39 46
40#include <limits.h> 47#include <limits.h>
41#include <inttypes.h> 48#include <inttypes.h>
42#include <float.h> 49#include <float.h>
43//#include <ctype.h> 50//#include <ctype.h>
51
52#if '1' != '0' + 1 \
53 || '2' != '0' + 2 || '3' != '0' + 3 || '4' != '0' + 4 || '5' != '0' + 5 \
54 || '6' != '0' + 6 || '7' != '0' + 7 || '8' != '0' + 8 || '9' != '0' + 9 \
55 || 'b' != 'a' + 1 || 'c' != 'a' + 2 || 'd' != 'a' + 3 || 'e' != 'a' + 4 \
56 || 'f' != 'a' + 5
57# error "execution character set digits not consecutive"
58#endif
44 59
45enum { 60enum {
46 TOK_EOF, 61 TOK_EOF,
47 TOK_LPAREN, 62 TOK_LPAREN,
48 TOK_RPAREN, 63 TOK_RPAREN,
49 TOK_DOT, 64 TOK_DOT,
50 TOK_ATOM, 65 TOK_ATOM,
66 TOK_DOTATOM, /* atom name starting with '.' */
67 TOK_STRATOM, /* atom name enclosed in | */
51 TOK_QUOTE, 68 TOK_QUOTE,
52 TOK_DQUOTE, 69 TOK_DQUOTE,
53 TOK_BQUOTE, 70 TOK_BQUOTE,
54 TOK_COMMA, 71 TOK_COMMA,
55 TOK_ATMARK, 72 TOK_ATMARK,
… …
143 160
144#define toupper(c) xtoupper (c) 161#define toupper(c) xtoupper (c)
145#define tolower(c) xtolower (c) 162#define tolower(c) xtolower (c)
146#define isdigit(c) xisdigit (c) 163#define isdigit(c) xisdigit (c)
147 164
148#if USE_STRLWR 165#if USE_IGNORECASE
149static const char * 166static const char *
150strlwr (char *s) 167xstrlwr (char *s)
151{ 168{
152 const char *p = s; 169 const char *p = s;
153 170
154 while (*s) 171 while (*s)
155 { 172 {
… …
157 s++; 174 s++;
158 } 175 }
159 176
160 return p; 177 return p;
161} 178}
162#endif
163 179
180#define stricmp(a,b) strcasecmp (a, b)
181#define strlwr(s) xstrlwr (s)
182
183#else
164#define stricmp(a,b) strcmp (a, b) 184# define stricmp(a,b) strcmp (a, b)
165#define strlwr(s) (s) 185# define strlwr(s) (s)
186#endif
166 187
167#ifndef prompt 188#ifndef prompt
168# define prompt "ts> " 189# define prompt "ts> "
169#endif 190#endif
170 191
… …
176# define FIRST_CELLSEGS 3 197# define FIRST_CELLSEGS 3
177#endif 198#endif
178 199
179enum scheme_types 200enum scheme_types
180{ 201{
202 T_INTEGER,
181 T_FREE, 203 T_REAL,
182 T_STRING, 204 T_STRING,
183 T_NUMBER,
184 T_SYMBOL, 205 T_SYMBOL,
185 T_PROC, 206 T_PROC,
186 T_PAIR, 207 T_PAIR, /* also used for free cells */
187 T_CLOSURE, 208 T_CLOSURE,
188 T_CONTINUATION, 209 T_CONTINUATION,
189 T_FOREIGN, 210 T_FOREIGN,
190 T_CHARACTER, 211 T_CHARACTER,
191 T_PORT, 212 T_PORT,
… …
201#define T_SYNTAX 0x0010 222#define T_SYNTAX 0x0010
202#define T_IMMUTABLE 0x0020 223#define T_IMMUTABLE 0x0020
203#define T_ATOM 0x0040 /* only for gc */ 224#define T_ATOM 0x0040 /* only for gc */
204#define T_MARK 0x0080 /* only for gc */ 225#define T_MARK 0x0080 /* only for gc */
205 226
206static num num_add (num a, num b); 227/* num, for generic arithmetic */
207static num num_mul (num a, num b); 228struct num
208static num num_div (num a, num b); 229{
230 IVALUE ivalue;
231#if USE_REAL
232 RVALUE rvalue;
233 char is_fixnum;
234#endif
235};
236
237#if USE_REAL
238# define num_is_fixnum(n) (n).is_fixnum
239# define num_set_fixnum(n,f) (n).is_fixnum = (f)
240# define num_ivalue(n) (n).ivalue
241# define num_rvalue(n) (n).rvalue
242# define num_set_ivalue(n,i) (n).rvalue = (n).ivalue = (i)
243# define num_set_rvalue(n,r) (n).rvalue = (r)
244#else
245# define num_is_fixnum(n) 1
246# define num_set_fixnum(n,f) 0
247# define num_ivalue(n) (n).ivalue
248# define num_rvalue(n) (n).ivalue
249# define num_set_ivalue(n,i) (n).ivalue = (i)
250# define num_set_rvalue(n,r) (n).ivalue = (r)
251#endif
252
253enum num_op { NUM_ADD, NUM_SUB, NUM_MUL, NUM_INTDIV };
254
255static num num_op (enum num_op op, num a, num b);
209static num num_intdiv (num a, num b); 256static num num_intdiv (num a, num b);
210static num num_sub (num a, num b);
211static num num_rem (num a, num b); 257static num num_rem (num a, num b);
212static num num_mod (num a, num b); 258static 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 259
219#if USE_MATH 260#if USE_MATH
220static double round_per_R5RS (double x); 261static double round_per_R5RS (double x);
221#endif 262#endif
222static int is_zero_rvalue (RVALUE x); 263static 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 264
230static num num_zero; 265static num num_zero;
231static num num_one; 266static num num_one;
232 267
233/* macros for cell operations */ 268/* macros for cell operations */
234#define typeflag(p) ((p)->flag + 0) 269#define typeflag(p) ((p)->flag + 0)
235#define set_typeflag(p,v) ((p)->flag = (v)) 270#define set_typeflag(p,v) ((p)->flag = (v))
236#define type(p) (typeflag (p) & T_MASKTYPE) 271#define type(p) (typeflag (p) & T_MASKTYPE)
237 272
238INTERFACE INLINE int 273INTERFACE int
239is_string (pointer p) 274is_string (pointer p)
240{ 275{
241 return type (p) == T_STRING; 276 return type (p) == T_STRING;
242} 277}
243 278
244#define strvalue(p) ((p)->object.string.svalue) 279#define strvalue(p) ((p)->object.string.svalue)
245#define strlength(p) ((p)->object.string.length) 280#define strlength(p) ((p)->object.string.length)
246 281
247INTERFACE int is_list (SCHEME_P_ pointer p);
248INTERFACE INLINE int 282INTERFACE int
249is_vector (pointer p) 283is_vector (pointer p)
250{ 284{
251 return type (p) == T_VECTOR; 285 return type (p) == T_VECTOR;
252} 286}
253 287
254#define vecvalue(p) ((p)->object.vector.vvalue) 288#define vecvalue(p) ((p)->object.vector.vvalue)
255#define veclength(p) ((p)->object.vector.length) 289#define veclength(p) ((p)->object.vector.length)
256INTERFACE void fill_vector (pointer vec, pointer obj); 290INTERFACE 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); 291INTERFACE pointer vector_get (pointer vec, uint32_t ielem);
259INTERFACE void set_vector_elem (pointer vec, uint32_t ielem, pointer a); 292INTERFACE void vector_set (pointer vec, uint32_t ielem, pointer a);
260 293
261INTERFACE uint32_t 294INTERFACE int
262vector_length (pointer vec) 295is_integer (pointer p)
263{ 296{
264 return vec->object.vector.length; 297 return type (p) == T_INTEGER;
265} 298}
266 299
300/* not the same as in scheme, where integers are (correctly :) reals */
267INTERFACE INLINE int 301INTERFACE int
302is_real (pointer p)
303{
304 return type (p) == T_REAL;
305}
306
307INTERFACE int
268is_number (pointer p) 308is_number (pointer p)
269{ 309{
270 return type (p) == T_NUMBER; 310 return is_integer (p) || is_real (p);
271} 311}
272 312
273INTERFACE INLINE int 313INTERFACE 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) 314is_character (pointer p)
293{ 315{
294 return type (p) == T_CHARACTER; 316 return type (p) == T_CHARACTER;
295} 317}
296 318
297INTERFACE INLINE char * 319INTERFACE char *
298string_value (pointer p) 320string_value (pointer p)
299{ 321{
300 return strvalue (p); 322 return strvalue (p);
301} 323}
302 324
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) 325#define ivalue_unchecked(p) (p)->object.ivalue
326#define set_ivalue(p,v) (p)->object.ivalue = (v)
327
334#if USE_REAL 328#if USE_REAL
335# define rvalue_unchecked(p) ((p)->object.number.value.rvalue) 329#define rvalue_unchecked(p) (p)->object.rvalue
336# define set_num_integer(p) (p)->object.number.is_fixnum=1; 330#define set_rvalue(p,v) (p)->object.rvalue = (v)
337# define set_num_real(p) (p)->object.number.is_fixnum=0;
338#else 331#else
339# define rvalue_unchecked(p) ((p)->object.number.value.ivalue) 332#define rvalue_unchecked(p) (p)->object.ivalue
340# define set_num_integer(p) 0 333#define set_rvalue(p,v) (p)->object.ivalue = (v)
341# define set_num_real(p) 0
342#endif 334#endif
335
343INTERFACE long 336INTERFACE long
344charvalue (pointer p) 337charvalue (pointer p)
345{ 338{
346 return ivalue_unchecked (p); 339 return ivalue_unchecked (p);
347} 340}
348 341
349INTERFACE INLINE int 342INTERFACE int
350is_port (pointer p) 343is_port (pointer p)
351{ 344{
352 return type (p) == T_PORT; 345 return type (p) == T_PORT;
353} 346}
354 347
355INTERFACE INLINE int 348INTERFACE int
356is_inport (pointer p) 349is_inport (pointer p)
357{ 350{
358 return is_port (p) && p->object.port->kind & port_input; 351 return is_port (p) && p->object.port->kind & port_input;
359} 352}
360 353
361INTERFACE INLINE int 354INTERFACE int
362is_outport (pointer p) 355is_outport (pointer p)
363{ 356{
364 return is_port (p) && p->object.port->kind & port_output; 357 return is_port (p) && p->object.port->kind & port_output;
365} 358}
366 359
367INTERFACE INLINE int 360INTERFACE int
368is_pair (pointer p) 361is_pair (pointer p)
369{ 362{
370 return type (p) == T_PAIR; 363 return type (p) == T_PAIR;
371} 364}
372 365
373#define car(p) ((p)->object.cons.car + 0) 366#define car(p) ((p)->object.cons.car + 0)
374#define cdr(p) ((p)->object.cons.cdr) /* find_consecutive_cells uses &cdr */ 367#define cdr(p) ((p)->object.cons.cdr + 0)
375 368
376#define caar(p) car (car (p)) 369static pointer caar (pointer p) { return car (car (p)); }
377#define cadr(p) car (cdr (p)) 370static pointer cadr (pointer p) { return car (cdr (p)); }
378#define cdar(p) cdr (car (p)) 371static pointer cdar (pointer p) { return cdr (car (p)); }
379#define cddr(p) cdr (cdr (p)) 372static pointer cddr (pointer p) { return cdr (cdr (p)); }
380 373
381#define cadar(p) car (cdr (car (p))) 374static pointer cadar (pointer p) { return car (cdr (car (p))); }
382#define caddr(p) car (cdr (cdr (p))) 375static pointer caddr (pointer p) { return car (cdr (cdr (p))); }
383#define cdaar(p) cdr (car (car (p))) 376static pointer cdaar (pointer p) { return cdr (car (car (p))); }
384 377
385INTERFACE void 378INTERFACE void
386set_car (pointer p, pointer q) 379set_car (pointer p, pointer q)
387{ 380{
388 p->object.cons.car = q; 381 p->object.cons.car = q;
… …
404pair_cdr (pointer p) 397pair_cdr (pointer p)
405{ 398{
406 return cdr (p); 399 return cdr (p);
407} 400}
408 401
409INTERFACE INLINE int 402INTERFACE int
410is_symbol (pointer p) 403is_symbol (pointer p)
411{ 404{
412 return type (p) == T_SYMBOL; 405 return type (p) == T_SYMBOL;
413} 406}
414 407
415INTERFACE INLINE char * 408INTERFACE char *
416symname (pointer p) 409symname (pointer p)
417{ 410{
418 return strvalue (car (p)); 411 return strvalue (car (p));
419} 412}
420 413
421#if USE_PLIST 414#if USE_PLIST
422SCHEME_EXPORT INLINE int 415SCHEME_EXPORT int
423hasprop (pointer p) 416hasprop (pointer p)
424{ 417{
425 return typeflag (p) & T_SYMBOL; 418 return typeflag (p) & T_SYMBOL;
426} 419}
427 420
428# define symprop(p) cdr(p) 421# define symprop(p) cdr(p)
429#endif 422#endif
430 423
431INTERFACE INLINE int 424INTERFACE int
432is_syntax (pointer p) 425is_syntax (pointer p)
433{ 426{
434 return typeflag (p) & T_SYNTAX; 427 return typeflag (p) & T_SYNTAX;
435} 428}
436 429
437INTERFACE INLINE int 430INTERFACE int
438is_proc (pointer p) 431is_proc (pointer p)
439{ 432{
440 return type (p) == T_PROC; 433 return type (p) == T_PROC;
441} 434}
442 435
443INTERFACE INLINE int 436INTERFACE int
444is_foreign (pointer p) 437is_foreign (pointer p)
445{ 438{
446 return type (p) == T_FOREIGN; 439 return type (p) == T_FOREIGN;
447} 440}
448 441
449INTERFACE INLINE char * 442INTERFACE char *
450syntaxname (pointer p) 443syntaxname (pointer p)
451{ 444{
452 return strvalue (car (p)); 445 return strvalue (car (p));
453} 446}
454 447
455#define procnum(p) ivalue (p) 448#define procnum(p) ivalue_unchecked (p)
456static const char *procname (pointer x); 449static const char *procname (pointer x);
457 450
458INTERFACE INLINE int 451INTERFACE int
459is_closure (pointer p) 452is_closure (pointer p)
460{ 453{
461 return type (p) == T_CLOSURE; 454 return type (p) == T_CLOSURE;
462} 455}
463 456
464INTERFACE INLINE int 457INTERFACE int
465is_macro (pointer p) 458is_macro (pointer p)
466{ 459{
467 return type (p) == T_MACRO; 460 return type (p) == T_MACRO;
468} 461}
469 462
470INTERFACE INLINE pointer 463INTERFACE pointer
471closure_code (pointer p) 464closure_code (pointer p)
472{ 465{
473 return car (p); 466 return car (p);
474} 467}
475 468
476INTERFACE INLINE pointer 469INTERFACE pointer
477closure_env (pointer p) 470closure_env (pointer p)
478{ 471{
479 return cdr (p); 472 return cdr (p);
480} 473}
481 474
482INTERFACE INLINE int 475INTERFACE int
483is_continuation (pointer p) 476is_continuation (pointer p)
484{ 477{
485 return type (p) == T_CONTINUATION; 478 return type (p) == T_CONTINUATION;
486} 479}
487 480
488#define cont_dump(p) cdr (p) 481#define cont_dump(p) cdr (p)
489#define set_cont_dump(p,v) set_cdr ((p), (v)) 482#define set_cont_dump(p,v) set_cdr ((p), (v))
490 483
491/* To do: promise should be forced ONCE only */ 484/* To do: promise should be forced ONCE only */
492INTERFACE INLINE int 485INTERFACE int
493is_promise (pointer p) 486is_promise (pointer p)
494{ 487{
495 return type (p) == T_PROMISE; 488 return type (p) == T_PROMISE;
496} 489}
497 490
498INTERFACE INLINE int 491INTERFACE int
499is_environment (pointer p) 492is_environment (pointer p)
500{ 493{
501 return type (p) == T_ENVIRONMENT; 494 return type (p) == T_ENVIRONMENT;
502} 495}
503 496
… …
509 502
510#define is_mark(p) (typeflag (p) & T_MARK) 503#define is_mark(p) (typeflag (p) & T_MARK)
511#define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK) 504#define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK)
512#define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK) 505#define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK)
513 506
514INTERFACE INLINE int 507INTERFACE int
515is_immutable (pointer p) 508is_immutable (pointer p)
516{ 509{
517 return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING; 510 return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING;
518} 511}
519 512
520INTERFACE INLINE void 513INTERFACE void
521setimmutable (pointer p) 514setimmutable (pointer p)
522{ 515{
523#if USE_ERROR_CHECKING 516#if USE_ERROR_CHECKING
524 set_typeflag (p, typeflag (p) | T_IMMUTABLE); 517 set_typeflag (p, typeflag (p) | T_IMMUTABLE);
525#endif 518#endif
526} 519}
527 520
521/* Result is:
522 proper list: length
523 circular list: -1
524 not even a pair: -2
525 dotted list: -2 minus length before dot
526*/
527INTERFACE int
528list_length (SCHEME_P_ pointer a)
529{
530 int i = 0;
531 pointer slow, fast;
532
533 slow = fast = a;
534
535 while (1)
536 {
537 if (fast == NIL)
538 return i;
539
540 if (!is_pair (fast))
541 return -2 - i;
542
543 fast = cdr (fast);
544 ++i;
545
546 if (fast == NIL)
547 return i;
548
549 if (!is_pair (fast))
550 return -2 - i;
551
552 ++i;
553 fast = cdr (fast);
554
555 /* Safe because we would have already returned if `fast'
556 encountered a non-pair. */
557 slow = cdr (slow);
558
559 if (fast == slow)
560 {
561 /* the fast pointer has looped back around and caught up
562 with the slow pointer, hence the structure is circular,
563 not of finite length, and therefore not a list */
564 return -1;
565 }
566 }
567}
568
569INTERFACE int
570is_list (SCHEME_P_ pointer a)
571{
572 return list_length (SCHEME_A_ a) >= 0;
573}
574
528#if USE_CHAR_CLASSIFIERS 575#if USE_CHAR_CLASSIFIERS
529static INLINE int 576ecb_inline int
530Cisalpha (int c) 577Cisalpha (int c)
531{ 578{
532 return isascii (c) && isalpha (c); 579 return isascii (c) && isalpha (c);
533} 580}
534 581
535static INLINE int 582ecb_inline int
536Cisdigit (int c) 583Cisdigit (int c)
537{ 584{
538 return isascii (c) && isdigit (c); 585 return isascii (c) && isdigit (c);
539} 586}
540 587
541static INLINE int 588ecb_inline int
542Cisspace (int c) 589Cisspace (int c)
543{ 590{
544 return isascii (c) && isspace (c); 591 return isascii (c) && isspace (c);
545} 592}
546 593
547static INLINE int 594ecb_inline int
548Cisupper (int c) 595Cisupper (int c)
549{ 596{
550 return isascii (c) && isupper (c); 597 return isascii (c) && isupper (c);
551} 598}
552 599
553static INLINE int 600ecb_inline int
554Cislower (int c) 601Cislower (int c)
555{ 602{
556 return isascii (c) && islower (c); 603 return isascii (c) && islower (c);
557} 604}
558#endif 605#endif
… …
619#endif 666#endif
620 667
621static int file_push (SCHEME_P_ const char *fname); 668static int file_push (SCHEME_P_ const char *fname);
622static void file_pop (SCHEME_P); 669static void file_pop (SCHEME_P);
623static int file_interactive (SCHEME_P); 670static int file_interactive (SCHEME_P);
624static INLINE int is_one_of (char *s, int c); 671ecb_inline int is_one_of (const char *s, int c);
625static int alloc_cellseg (SCHEME_P_ int n); 672static 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); 673ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b);
628static void finalize_cell (SCHEME_P_ pointer a); 674static void finalize_cell (SCHEME_P_ pointer a);
629static int count_consecutive_cells (pointer x, int needed); 675static int count_consecutive_cells (pointer x, int needed);
630static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all); 676static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all);
631static pointer mk_number (SCHEME_P_ const num n); 677static pointer mk_number (SCHEME_P_ const num n);
632static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill); 678static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill);
… …
647static void mark (pointer a); 693static void mark (pointer a);
648static void gc (SCHEME_P_ pointer a, pointer b); 694static void gc (SCHEME_P_ pointer a, pointer b);
649static int basic_inchar (port *pt); 695static int basic_inchar (port *pt);
650static int inchar (SCHEME_P); 696static int inchar (SCHEME_P);
651static void backchar (SCHEME_P_ int c); 697static void backchar (SCHEME_P_ int c);
652static char *readstr_upto (SCHEME_P_ char *delim); 698static char *readstr_upto (SCHEME_P_ int skip, const char *delim);
653static pointer readstrexp (SCHEME_P); 699static pointer readstrexp (SCHEME_P_ char delim);
654static INLINE int skipspace (SCHEME_P); 700ecb_inline int skipspace (SCHEME_P);
655static int token (SCHEME_P); 701static int token (SCHEME_P);
656static void printslashstring (SCHEME_P_ char *s, int len); 702static void printslashstring (SCHEME_P_ char *s, int len);
657static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen); 703static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen);
658static void printatom (SCHEME_P_ pointer l, int f); 704static void printatom (SCHEME_P_ pointer l, int f);
659static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op); 705static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op);
… …
663static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list); 709static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list);
664static pointer revappend (SCHEME_P_ pointer a, pointer b); 710static pointer revappend (SCHEME_P_ pointer a, pointer b);
665static pointer ss_get_cont (SCHEME_P); 711static pointer ss_get_cont (SCHEME_P);
666static void ss_set_cont (SCHEME_P_ pointer cont); 712static void ss_set_cont (SCHEME_P_ pointer cont);
667static void dump_stack_mark (SCHEME_P); 713static void dump_stack_mark (SCHEME_P);
668static pointer opexe_0 (SCHEME_P_ enum scheme_opcodes op); 714static int opexe_0 (SCHEME_P_ enum scheme_opcodes op);
715static int opexe_1 (SCHEME_P_ enum scheme_opcodes op);
669static pointer opexe_2 (SCHEME_P_ enum scheme_opcodes op); 716static int opexe_2 (SCHEME_P_ enum scheme_opcodes op);
670static pointer opexe_3 (SCHEME_P_ enum scheme_opcodes op); 717static int opexe_3 (SCHEME_P_ enum scheme_opcodes op);
671static pointer opexe_4 (SCHEME_P_ enum scheme_opcodes op); 718static int opexe_4 (SCHEME_P_ enum scheme_opcodes op);
672static pointer opexe_5 (SCHEME_P_ enum scheme_opcodes op); 719static int opexe_5 (SCHEME_P_ enum scheme_opcodes op);
673static pointer opexe_6 (SCHEME_P_ enum scheme_opcodes op); 720static int opexe_6 (SCHEME_P_ enum scheme_opcodes op);
674static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op); 721static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op);
675static void assign_syntax (SCHEME_P_ const char *name); 722static void assign_syntax (SCHEME_P_ const char *name);
676static int syntaxnum (pointer p); 723static int syntaxnum (pointer p);
677static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name); 724static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name);
678 725
726static IVALUE
727ivalue (pointer x)
728{
729 return is_integer (x) ? ivalue_unchecked (x) : rvalue_unchecked (x);
730}
731
732static RVALUE
733rvalue (pointer x)
734{
735 return is_integer (x) ? ivalue_unchecked (x) : rvalue_unchecked (x);
736}
737
738INTERFACE num
739nvalue (pointer x)
740{
741 num n;
742
743 num_set_fixnum (n, is_integer (x));
744
745 if (num_is_fixnum (n))
746 num_set_ivalue (n, ivalue_unchecked (x));
747 else
748 num_set_rvalue (n, rvalue_unchecked (x));
749
750 return n;
751}
752
679static num 753static num
680num_add (num a, num b) 754num_op (enum num_op op, num a, num b)
681{ 755{
682 num ret; 756 num ret;
683 757
684 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 758 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
685 759
686 if (num_is_fixnum (ret)) 760 if (num_is_fixnum (ret))
687 num_set_ivalue (ret, num_get_ivalue (a) + num_get_ivalue (b)); 761 {
762 switch (op)
763 {
764 case NUM_ADD: a.ivalue += b.ivalue; break;
765 case NUM_SUB: a.ivalue -= b.ivalue; break;
766 case NUM_MUL: a.ivalue *= b.ivalue; break;
767 case NUM_INTDIV: a.ivalue /= b.ivalue; break;
768 }
769
770 num_set_ivalue (ret, a.ivalue);
771 }
772#if USE_REAL
688 else 773 else
689 num_set_rvalue (ret, num_get_rvalue (a) + num_get_rvalue (b)); 774 {
775 switch (op)
776 {
777 case NUM_ADD: a.rvalue += b.rvalue; break;
778 case NUM_SUB: a.rvalue -= b.rvalue; break;
779 case NUM_MUL: a.rvalue *= b.rvalue; break;
780 case NUM_INTDIV: a.rvalue /= b.rvalue; break;
781 }
690 782
691 return ret; 783 num_set_rvalue (ret, a.rvalue);
692} 784 }
693 785#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 786
706 return ret; 787 return ret;
707} 788}
708 789
709static num 790static num
710num_div (num a, num b) 791num_div (num a, num b)
711{ 792{
712 num ret; 793 num ret;
713 794
714 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_get_ivalue (a) % num_get_ivalue (b) == 0); 795 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_ivalue (a) % num_ivalue (b) == 0);
715 796
716 if (num_is_fixnum (ret)) 797 if (num_is_fixnum (ret))
717 num_set_ivalue (ret, num_get_ivalue (a) / num_get_ivalue (b)); 798 num_set_ivalue (ret, num_ivalue (a) / num_ivalue (b));
718 else 799 else
719 num_set_rvalue (ret, num_get_rvalue (a) / num_get_rvalue (b)); 800 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 801
751 return ret; 802 return ret;
752} 803}
753 804
754static num 805static num
… …
756{ 807{
757 num ret; 808 num ret;
758 long e1, e2, res; 809 long e1, e2, res;
759 810
760 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 811 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
761 e1 = num_get_ivalue (a); 812 e1 = num_ivalue (a);
762 e2 = num_get_ivalue (b); 813 e2 = num_ivalue (b);
763 res = e1 % e2; 814 res = e1 % e2;
764 815
765 /* remainder should have same sign as second operand */ 816 /* remainder should have same sign as second operand */
766 if (res > 0) 817 if (res > 0)
767 { 818 {
… …
783{ 834{
784 num ret; 835 num ret;
785 long e1, e2, res; 836 long e1, e2, res;
786 837
787 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 838 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
788 e1 = num_get_ivalue (a); 839 e1 = num_ivalue (a);
789 e2 = num_get_ivalue (b); 840 e2 = num_ivalue (b);
790 res = e1 % e2; 841 res = e1 % e2;
791 842
792 /* modulo should have same sign as second operand */ 843 /* modulo should have same sign as second operand */
793 if (res * e2 < 0) 844 if (res * e2 < 0)
794 res += e2; 845 res += e2;
795 846
796 num_set_ivalue (ret, res); 847 num_set_ivalue (ret, res);
797 return ret; 848 return ret;
798} 849}
799 850
851/* this completely disrespects NaNs, but r5rs doesn't even allow NaNs */
800static int 852static int
801num_eq (num a, num b) 853num_cmp (num a, num b)
802{ 854{
855 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
803 int ret; 856 int ret;
804 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
805 857
806 if (is_fixnum) 858 if (is_fixnum)
807 ret = num_get_ivalue (a) == num_get_ivalue (b); 859 {
860 IVALUE av = num_ivalue (a);
861 IVALUE bv = num_ivalue (b);
862
863 ret = av == bv ? 0 : av < bv ? -1 : +1;
864 }
808 else 865 else
809 ret = num_get_rvalue (a) == num_get_rvalue (b); 866 {
867 RVALUE av = num_rvalue (a);
868 RVALUE bv = num_rvalue (b);
869
870 ret = av == bv ? 0 : av < bv ? -1 : +1;
871 }
810 872
811 return ret; 873 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} 874}
854 875
855#if USE_MATH 876#if USE_MATH
856 877
857/* Round to nearest. Round to even if midway */ 878/* Round to nearest. Round to even if midway */
… …
867 return ce; 888 return ce;
868 else if (dfl < dce) 889 else if (dfl < dce)
869 return fl; 890 return fl;
870 else 891 else
871 { 892 {
872 if (fmod (fl, 2.0) == 0.0) /* I imagine this holds */ 893 if (fmod (fl, 2) == 0) /* I imagine this holds */
873 return fl; 894 return fl;
874 else 895 else
875 return ce; 896 return ce;
876 } 897 }
877} 898}
878#endif 899#endif
879 900
880static int 901static int
881is_zero_rvalue (RVALUE x) 902is_zero_rvalue (RVALUE x)
882{ 903{
904 return x == 0;
905#if 0
883#if USE_REAL 906#if USE_REAL
884 return x < DBL_MIN && x > -DBL_MIN; /* why the hate of denormals? this should be == 0. */ 907 return x < DBL_MIN && x > -DBL_MIN; /* why the hate of denormals? this should be == 0. */
885#else 908#else
886 return x == 0; 909 return x == 0;
887#endif 910#endif
888} 911#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} 912}
904 913
905/* allocate new cell segment */ 914/* allocate new cell segment */
906static int 915static int
907alloc_cellseg (SCHEME_P_ int n) 916alloc_cellseg (SCHEME_P_ int n)
… …
927 return k; 936 return k;
928 937
929 i = ++SCHEME_V->last_cell_seg; 938 i = ++SCHEME_V->last_cell_seg;
930 SCHEME_V->alloc_seg[i] = cp; 939 SCHEME_V->alloc_seg[i] = cp;
931 940
932 /* insert new segment in address order */
933 newp = (pointer)cp; 941 newp = (pointer)cp;
934 SCHEME_V->cell_seg[i] = newp; 942 SCHEME_V->cell_seg[i] = newp;
935 SCHEME_V->cell_segsize[i] = segsize; 943 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; 944 SCHEME_V->fcells += segsize;
952 last = newp + segsize - 1; 945 last = newp + segsize - 1;
953 946
954 for (p = newp; p <= last; p++) 947 for (p = newp; p <= last; p++)
955 { 948 {
956 set_typeflag (p, T_FREE); 949 set_typeflag (p, T_PAIR);
957 set_car (p, NIL); 950 set_car (p, NIL);
958 set_cdr (p, p + 1); 951 set_cdr (p, p + 1);
959 } 952 }
960 953
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); 954 set_cdr (last, SCHEME_V->free_cell);
965 SCHEME_V->free_cell = newp; 955 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 } 956 }
978 957
979 return n; 958 return n;
980} 959}
981 960
982/* get new cell. parameter a, b is marked by gc. */ 961/* get new cell. parameter a, b is marked by gc. */
983static INLINE pointer 962ecb_inline pointer
984get_cell_x (SCHEME_P_ pointer a, pointer b) 963get_cell_x (SCHEME_P_ pointer a, pointer b)
985{ 964{
986 if (SCHEME_V->free_cell == NIL) 965 if (ecb_expect_false (SCHEME_V->free_cell == NIL))
987 { 966 {
988 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 967 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
989 return S_SINK; 968 return S_SINK;
990 969
991 if (SCHEME_V->free_cell == NIL) 970 if (SCHEME_V->free_cell == NIL)
… …
1060 /* Record it as a vector so that gc understands it. */ 1039 /* Record it as a vector so that gc understands it. */
1061 set_typeflag (v, T_VECTOR | T_ATOM); 1040 set_typeflag (v, T_VECTOR | T_ATOM);
1062 1041
1063 v->object.vector.vvalue = e; 1042 v->object.vector.vvalue = e;
1064 v->object.vector.length = len; 1043 v->object.vector.length = len;
1065 fill_vector (v, init); 1044 fill_vector (v, 0, init);
1066 push_recent_alloc (SCHEME_A_ v, NIL); 1045 push_recent_alloc (SCHEME_A_ v, NIL);
1067 1046
1068 return v; 1047 return v;
1069} 1048}
1070 1049
1071static INLINE void 1050ecb_inline void
1072ok_to_freely_gc (SCHEME_P) 1051ok_to_freely_gc (SCHEME_P)
1073{ 1052{
1074 set_car (S_SINK, NIL); 1053 set_car (S_SINK, NIL);
1075} 1054}
1076 1055
… …
1115 return x; 1094 return x;
1116} 1095}
1117 1096
1118/* ========== oblist implementation ========== */ 1097/* ========== oblist implementation ========== */
1119 1098
1099static pointer
1100generate_symbol (SCHEME_P_ const char *name)
1101{
1102 pointer x = mk_string (SCHEME_A_ name);
1103 setimmutable (x);
1104 x = immutable_cons (x, NIL);
1105 set_typeflag (x, T_SYMBOL);
1106 return x;
1107}
1108
1120#ifndef USE_OBJECT_LIST 1109#ifndef USE_OBJECT_LIST
1121 1110
1111static int
1122static int hash_fn (const char *key, int table_size); 1112hash_fn (const char *key, int table_size)
1113{
1114 const unsigned char *p = key;
1115 uint32_t hash = 2166136261;
1116
1117 while (*p)
1118 hash = (hash ^ *p++) * 16777619;
1119
1120 return hash % table_size;
1121}
1123 1122
1124static pointer 1123static pointer
1125oblist_initial_value (SCHEME_P) 1124oblist_initial_value (SCHEME_P)
1126{ 1125{
1127 return mk_vector (SCHEME_A_ 461); /* probably should be bigger */ 1126 return mk_vector (SCHEME_A_ 461); /* probably should be bigger */
… …
1129 1128
1130/* returns the new symbol */ 1129/* returns the new symbol */
1131static pointer 1130static pointer
1132oblist_add_by_name (SCHEME_P_ const char *name) 1131oblist_add_by_name (SCHEME_P_ const char *name)
1133{ 1132{
1134 int location; 1133 pointer x = generate_symbol (SCHEME_A_ name);
1135
1136 pointer x = immutable_cons (mk_string (SCHEME_A_ name), NIL);
1137 set_typeflag (x, T_SYMBOL);
1138 setimmutable (car (x));
1139
1140 location = hash_fn (name, veclength (SCHEME_V->oblist)); 1134 int 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))); 1135 vector_set (SCHEME_V->oblist, location, immutable_cons (x, vector_get (SCHEME_V->oblist, location)));
1142 return x; 1136 return x;
1143} 1137}
1144 1138
1145static INLINE pointer 1139ecb_inline pointer
1146oblist_find_by_name (SCHEME_P_ const char *name) 1140oblist_find_by_name (SCHEME_P_ const char *name)
1147{ 1141{
1148 int location; 1142 int location;
1149 pointer x; 1143 pointer x;
1150 char *s; 1144 char *s;
1151 1145
1152 location = hash_fn (name, veclength (SCHEME_V->oblist)); 1146 location = hash_fn (name, veclength (SCHEME_V->oblist));
1153 1147
1154 for (x = vector_elem (SCHEME_V->oblist, location); x != NIL; x = cdr (x)) 1148 for (x = vector_get (SCHEME_V->oblist, location); x != NIL; x = cdr (x))
1155 { 1149 {
1156 s = symname (car (x)); 1150 s = symname (car (x));
1157 1151
1158 /* case-insensitive, per R5RS section 2 */ 1152 /* case-insensitive, per R5RS section 2 */
1159 if (stricmp (name, s) == 0) 1153 if (stricmp (name, s) == 0)
… …
1169 int i; 1163 int i;
1170 pointer x; 1164 pointer x;
1171 pointer ob_list = NIL; 1165 pointer ob_list = NIL;
1172 1166
1173 for (i = 0; i < veclength (SCHEME_V->oblist); i++) 1167 for (i = 0; i < veclength (SCHEME_V->oblist); i++)
1174 for (x = vector_elem (SCHEME_V->oblist, i); x != NIL; x = cdr (x)) 1168 for (x = vector_get (SCHEME_V->oblist, i); x != NIL; x = cdr (x))
1175 ob_list = cons (x, ob_list); 1169 ob_list = cons (x, ob_list);
1176 1170
1177 return ob_list; 1171 return ob_list;
1178} 1172}
1179 1173
… …
1183oblist_initial_value (SCHEME_P) 1177oblist_initial_value (SCHEME_P)
1184{ 1178{
1185 return NIL; 1179 return NIL;
1186} 1180}
1187 1181
1188static INLINE pointer 1182ecb_inline pointer
1189oblist_find_by_name (SCHEME_P_ const char *name) 1183oblist_find_by_name (SCHEME_P_ const char *name)
1190{ 1184{
1191 pointer x; 1185 pointer x;
1192 char *s; 1186 char *s;
1193 1187
… …
1205 1199
1206/* returns the new symbol */ 1200/* returns the new symbol */
1207static pointer 1201static pointer
1208oblist_add_by_name (SCHEME_P_ const char *name) 1202oblist_add_by_name (SCHEME_P_ const char *name)
1209{ 1203{
1210 pointer x; 1204 pointer x = mk_string (SCHEME_A_ name);
1211
1212 x = immutable_cons (mk_string (SCHEME_A_ name), NIL);
1213 set_typeflag (x, T_SYMBOL); 1205 set_typeflag (x, T_SYMBOL);
1214 setimmutable (car (x)); 1206 setimmutable (x);
1215 SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist); 1207 SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist);
1216 return x; 1208 return x;
1217} 1209}
1218 1210
1219static pointer 1211static pointer
… …
1252mk_character (SCHEME_P_ int c) 1244mk_character (SCHEME_P_ int c)
1253{ 1245{
1254 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1246 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1255 1247
1256 set_typeflag (x, (T_CHARACTER | T_ATOM)); 1248 set_typeflag (x, (T_CHARACTER | T_ATOM));
1257 ivalue_unchecked (x) = c & 0xff; 1249 set_ivalue (x, c & 0xff);
1258 set_num_integer (x); 1250
1259 return x; 1251 return x;
1260} 1252}
1261 1253
1262/* get number atom (integer) */ 1254/* get number atom (integer) */
1263INTERFACE pointer 1255INTERFACE pointer
1264mk_integer (SCHEME_P_ long num) 1256mk_integer (SCHEME_P_ long n)
1265{ 1257{
1266 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1258 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1267 1259
1268 set_typeflag (x, (T_NUMBER | T_ATOM)); 1260 set_typeflag (x, (T_INTEGER | T_ATOM));
1269 ivalue_unchecked (x) = num; 1261 set_ivalue (x, n);
1270 set_num_integer (x); 1262
1271 return x; 1263 return x;
1272} 1264}
1273 1265
1274INTERFACE pointer 1266INTERFACE pointer
1275mk_real (SCHEME_P_ RVALUE n) 1267mk_real (SCHEME_P_ RVALUE n)
1276{ 1268{
1269#if USE_REAL
1277 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1270 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1278 1271
1279 set_typeflag (x, (T_NUMBER | T_ATOM)); 1272 set_typeflag (x, (T_REAL | T_ATOM));
1280 rvalue_unchecked (x) = n; 1273 set_rvalue (x, n);
1281 set_num_real (x); 1274
1282 return x; 1275 return x;
1276#else
1277 return mk_integer (SCHEME_A_ n);
1278#endif
1283} 1279}
1284 1280
1285static pointer 1281static pointer
1286mk_number (SCHEME_P_ const num n) 1282mk_number (SCHEME_P_ const num n)
1287{ 1283{
1284#if USE_REAL
1288 if (num_is_fixnum (n)) 1285 return num_is_fixnum (n)
1286 ? mk_integer (SCHEME_A_ num_ivalue (n))
1287 : mk_real (SCHEME_A_ num_rvalue (n));
1288#else
1289 return mk_integer (SCHEME_A_ num_get_ivalue (n)); 1289 return mk_integer (SCHEME_A_ num_ivalue (n));
1290 else 1290#endif
1291 return mk_real (SCHEME_A_ num_get_rvalue (n));
1292} 1291}
1293 1292
1294/* allocate name to string area */ 1293/* allocate name to string area */
1295static char * 1294static char *
1296store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill) 1295store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill)
… …
1302 SCHEME_V->no_memory = 1; 1301 SCHEME_V->no_memory = 1;
1303 return SCHEME_V->strbuff; 1302 return SCHEME_V->strbuff;
1304 } 1303 }
1305 1304
1306 if (str) 1305 if (str)
1307 { 1306 memcpy (q, str , len_str); /* caller must ensure that *str has length len_str */
1308 int l = strlen (str);
1309
1310 if (l > len_str)
1311 l = len_str;
1312
1313 memcpy (q, str, l);
1314 q[l] = 0;
1315 }
1316 else 1307 else
1317 {
1318 memset (q, fill, len_str); 1308 memset (q, fill, len_str);
1309
1319 q[len_str] = 0; 1310 q[len_str] = 0;
1320 }
1321 1311
1322 return q; 1312 return q;
1323}
1324
1325/* get new string */
1326INTERFACE pointer
1327mk_string (SCHEME_P_ const char *str)
1328{
1329 return mk_counted_string (SCHEME_A_ str, strlen (str));
1330}
1331
1332INTERFACE pointer
1333mk_counted_string (SCHEME_P_ const char *str, uint32_t len)
1334{
1335 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1336
1337 set_typeflag (x, T_STRING | T_ATOM);
1338 strvalue (x) = store_string (SCHEME_A_ len, str, 0);
1339 strlength (x) = len;
1340 return x;
1341} 1313}
1342 1314
1343INTERFACE pointer 1315INTERFACE pointer
1344mk_empty_string (SCHEME_P_ uint32_t len, char fill) 1316mk_empty_string (SCHEME_P_ uint32_t len, char fill)
1345{ 1317{
… …
1350 strlength (x) = len; 1322 strlength (x) = len;
1351 return x; 1323 return x;
1352} 1324}
1353 1325
1354INTERFACE pointer 1326INTERFACE pointer
1327mk_counted_string (SCHEME_P_ const char *str, uint32_t len)
1328{
1329 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1330
1331 set_typeflag (x, T_STRING | T_ATOM);
1332 strvalue (x) = store_string (SCHEME_A_ len, str, 0);
1333 strlength (x) = len;
1334
1335 return x;
1336}
1337
1338INTERFACE pointer
1339mk_string (SCHEME_P_ const char *str)
1340{
1341 return mk_counted_string (SCHEME_A_ str, strlen (str));
1342}
1343
1344INTERFACE pointer
1355mk_vector (SCHEME_P_ uint32_t len) 1345mk_vector (SCHEME_P_ uint32_t len)
1356{ 1346{
1357 return get_vector_object (SCHEME_A_ len, NIL); 1347 return get_vector_object (SCHEME_A_ len, NIL);
1358} 1348}
1359 1349
1360INTERFACE void 1350INTERFACE void
1361fill_vector (pointer vec, pointer obj) 1351fill_vector (pointer vec, uint32_t start, pointer obj)
1362{ 1352{
1363 int i; 1353 int i;
1364 1354
1365 for (i = 0; i < vec->object.vector.length; i++) 1355 for (i = start; i < veclength (vec); i++)
1366 vecvalue (vec)[i] = obj; 1356 vecvalue (vec)[i] = obj;
1367} 1357}
1368 1358
1359INTERFACE void
1360vector_resize (pointer vec, uint32_t newsize, pointer fill)
1361{
1362 uint32_t oldsize = veclength (vec);
1363 vecvalue (vec) = realloc (vecvalue (vec), newsize * sizeof (pointer));
1364 veclength (vec) = newsize;
1365 fill_vector (vec, oldsize, fill);
1366}
1367
1369INTERFACE pointer 1368INTERFACE pointer
1370vector_elem (pointer vec, uint32_t ielem) 1369vector_get (pointer vec, uint32_t ielem)
1371{ 1370{
1372 return vecvalue(vec)[ielem]; 1371 return vecvalue(vec)[ielem];
1373} 1372}
1374 1373
1375INTERFACE void 1374INTERFACE void
1376set_vector_elem (pointer vec, uint32_t ielem, pointer a) 1375vector_set (pointer vec, uint32_t ielem, pointer a)
1377{ 1376{
1378 vecvalue(vec)[ielem] = a; 1377 vecvalue(vec)[ielem] = a;
1379} 1378}
1380 1379
1381/* get new symbol */ 1380/* get new symbol */
… …
1393 1392
1394INTERFACE pointer 1393INTERFACE pointer
1395gensym (SCHEME_P) 1394gensym (SCHEME_P)
1396{ 1395{
1397 pointer x; 1396 pointer x;
1398 char name[40]; 1397 char name[40] = "gensym-";
1399
1400 for (; SCHEME_V->gensym_cnt < LONG_MAX; SCHEME_V->gensym_cnt++)
1401 {
1402 strcpy (name, "gensym-");
1403 xnum (name + 7, SCHEME_V->gensym_cnt); 1398 xnum (name + 7, SCHEME_V->gensym_cnt);
1404 1399
1405 /* first check oblist */ 1400 return generate_symbol (SCHEME_A_ name);
1406 x = oblist_find_by_name (SCHEME_A_ name);
1407
1408 if (x != NIL)
1409 continue;
1410 else
1411 {
1412 x = oblist_add_by_name (SCHEME_A_ name);
1413 return x;
1414 }
1415 }
1416
1417 return NIL;
1418} 1401}
1419 1402
1420/* make symbol or number atom from string */ 1403/* make symbol or number atom from string */
1421static pointer 1404static pointer
1422mk_atom (SCHEME_P_ char *q) 1405mk_atom (SCHEME_P_ char *q)
… …
1424 char c, *p; 1407 char c, *p;
1425 int has_dec_point = 0; 1408 int has_dec_point = 0;
1426 int has_fp_exp = 0; 1409 int has_fp_exp = 0;
1427 1410
1428#if USE_COLON_HOOK 1411#if USE_COLON_HOOK
1429
1430 if ((p = strstr (q, "::")) != 0) 1412 if ((p = strstr (q, "::")) != 0)
1431 { 1413 {
1432 *p = 0; 1414 *p = 0;
1433 return cons (SCHEME_V->COLON_HOOK, 1415 return cons (SCHEME_V->COLON_HOOK,
1434 cons (cons (SCHEME_V->QUOTE, 1416 cons (cons (SCHEME_V->QUOTE,
1435 cons (mk_atom (SCHEME_A_ p + 2), NIL)), cons (mk_symbol (SCHEME_A_ strlwr (q)), NIL))); 1417 cons (mk_atom (SCHEME_A_ p + 2), NIL)), cons (mk_symbol (SCHEME_A_ strlwr (q)), NIL)));
1436 } 1418 }
1437
1438#endif 1419#endif
1439 1420
1440 p = q; 1421 p = q;
1441 c = *p++; 1422 c = *p++;
1442 1423
… …
1478 } 1459 }
1479 else if ((c == 'e') || (c == 'E')) 1460 else if ((c == 'e') || (c == 'E'))
1480 { 1461 {
1481 if (!has_fp_exp) 1462 if (!has_fp_exp)
1482 { 1463 {
1483 has_dec_point = 1; /* decimal point illegal 1464 has_dec_point = 1; /* decimal point illegal from now on */
1484 from now on */
1485 p++; 1465 p++;
1486 1466
1487 if ((*p == '-') || (*p == '+') || isdigit (*p)) 1467 if ((*p == '-') || (*p == '+') || isdigit (*p))
1488 continue; 1468 continue;
1489 } 1469 }
… …
1503 1483
1504/* make constant */ 1484/* make constant */
1505static pointer 1485static pointer
1506mk_sharp_const (SCHEME_P_ char *name) 1486mk_sharp_const (SCHEME_P_ char *name)
1507{ 1487{
1508 long x;
1509 char tmp[STRBUFFSIZE];
1510
1511 if (!strcmp (name, "t")) 1488 if (!strcmp (name, "t"))
1512 return S_T; 1489 return S_T;
1513 else if (!strcmp (name, "f")) 1490 else if (!strcmp (name, "f"))
1514 return S_F; 1491 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) */ 1492 else if (*name == '\\') /* #\w (character) */
1536 { 1493 {
1537 int c = 0; 1494 int c;
1538 1495
1539 if (stricmp (name + 1, "space") == 0) 1496 if (stricmp (name + 1, "space") == 0)
1540 c = ' '; 1497 c = ' ';
1541 else if (stricmp (name + 1, "newline") == 0) 1498 else if (stricmp (name + 1, "newline") == 0)
1542 c = '\n'; 1499 c = '\n';
… …
1544 c = '\r'; 1501 c = '\r';
1545 else if (stricmp (name + 1, "tab") == 0) 1502 else if (stricmp (name + 1, "tab") == 0)
1546 c = '\t'; 1503 c = '\t';
1547 else if (name[1] == 'x' && name[2] != 0) 1504 else if (name[1] == 'x' && name[2] != 0)
1548 { 1505 {
1549 int c1 = strtol (name + 2, 0, 16); 1506 long c1 = strtol (name + 2, 0, 16);
1550 1507
1551 if (c1 <= UCHAR_MAX) 1508 if (0 <= c1 && c1 <= UCHAR_MAX)
1552 c = c1; 1509 c = c1;
1553 else 1510 else
1554 return NIL; 1511 return NIL;
1555 1512 }
1556#if USE_ASCII_NAMES 1513#if USE_ASCII_NAMES
1557 }
1558 else if (is_ascii_name (name + 1, &c)) 1514 else if (is_ascii_name (name + 1, &c))
1559 {
1560 /* nothing */ 1515 /* nothing */;
1561#endif 1516#endif
1562 }
1563 else if (name[2] == 0) 1517 else if (name[2] == 0)
1564 c = name[1]; 1518 c = name[1];
1565 else 1519 else
1566 return NIL; 1520 return NIL;
1567 1521
1568 return mk_character (SCHEME_A_ c); 1522 return mk_character (SCHEME_A_ c);
1569 } 1523 }
1570 else 1524 else
1525 {
1526 /* identify base by string index */
1527 const char baseidx[17] = "ffbf" "ffff" "ofdf" "ffff" "x";
1528 char *base = strchr (baseidx, *name);
1529
1530 if (base)
1531 return mk_integer (SCHEME_A_ strtol (name + 1, 0, base - baseidx));
1532
1571 return NIL; 1533 return NIL;
1534 }
1572} 1535}
1573 1536
1574/* ========== garbage collector ========== */ 1537/* ========== garbage collector ========== */
1575 1538
1576/*-- 1539/*--
1577 * We use algorithm E (Knuth, The Art of Computer Programming Vol.1, 1540 * We use algorithm E (Knuth, The Art of Computer Programming Vol.1,
1578 * sec. 2.3.5), the Schorr-Deutsch-Waite link-inversion algorithm, 1541 * sec. 2.3.5), the Schorr-Deutsch-Waite link-inversion algorithm,
1579 * for marking. 1542 * for marking.
1543 *
1544 * The exception is vectors - vectors are currently marked recursively,
1545 * which is inherited form tinyscheme and could be fixed by having another
1546 * word of context in the vector
1580 */ 1547 */
1581static void 1548static void
1582mark (pointer a) 1549mark (pointer a)
1583{ 1550{
1584 pointer t, q, p; 1551 pointer t, q, p;
… …
1586 t = 0; 1553 t = 0;
1587 p = a; 1554 p = a;
1588E2: 1555E2:
1589 setmark (p); 1556 setmark (p);
1590 1557
1591 if (is_vector (p)) 1558 if (ecb_expect_false (is_vector (p)))
1592 { 1559 {
1593 int i; 1560 int i;
1594 1561
1595 for (i = 0; i < p->object.vector.length; i++) 1562 for (i = 0; i < veclength (p); i++)
1596 mark (vecvalue (p)[i]); 1563 mark (vecvalue (p)[i]);
1597 } 1564 }
1598 1565
1599 if (is_atom (p)) 1566 if (is_atom (p))
1600 goto E6; 1567 goto E6;
… …
1698 if (is_mark (p)) 1665 if (is_mark (p))
1699 clrmark (p); 1666 clrmark (p);
1700 else 1667 else
1701 { 1668 {
1702 /* reclaim cell */ 1669 /* reclaim cell */
1703 if (typeflag (p) != T_FREE) 1670 if (typeflag (p) != T_PAIR)
1704 { 1671 {
1705 finalize_cell (SCHEME_A_ p); 1672 finalize_cell (SCHEME_A_ p);
1706 set_typeflag (p, T_FREE); 1673 set_typeflag (p, T_PAIR);
1707 set_car (p, NIL); 1674 set_car (p, NIL);
1708 } 1675 }
1709 1676
1710 ++SCHEME_V->fcells; 1677 ++SCHEME_V->fcells;
1711 set_cdr (p, SCHEME_V->free_cell); 1678 set_cdr (p, SCHEME_V->free_cell);
… …
1713 } 1680 }
1714 } 1681 }
1715 } 1682 }
1716 1683
1717 if (SCHEME_V->gc_verbose) 1684 if (SCHEME_V->gc_verbose)
1685 {
1718 xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" cells were recovered.\n"); 1686 xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" cells were recovered.\n");
1687 }
1719} 1688}
1720 1689
1721static void 1690static void
1722finalize_cell (SCHEME_P_ pointer a) 1691finalize_cell (SCHEME_P_ pointer a)
1723{ 1692{
1693 /* TODO, fast bitmap check? */
1724 if (is_string (a)) 1694 if (is_string (a))
1725 free (strvalue (a)); 1695 free (strvalue (a));
1726 else if (is_vector (a)) 1696 else if (is_vector (a))
1727 free (vecvalue (a)); 1697 free (vecvalue (a));
1728#if USE_PORTS 1698#if USE_PORTS
… …
2151#endif 2121#endif
2152} 2122}
2153 2123
2154/* read characters up to delimiter, but cater to character constants */ 2124/* read characters up to delimiter, but cater to character constants */
2155static char * 2125static char *
2156readstr_upto (SCHEME_P_ char *delim) 2126readstr_upto (SCHEME_P_ int skip, const char *delim)
2157{ 2127{
2158 char *p = SCHEME_V->strbuff; 2128 char *p = SCHEME_V->strbuff + skip;
2159 2129
2160 while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A)))); 2130 while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A))));
2161 2131
2162 if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\') 2132 if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\')
2163 *p = 0; 2133 *p = 0;
… …
2170 return SCHEME_V->strbuff; 2140 return SCHEME_V->strbuff;
2171} 2141}
2172 2142
2173/* read string expression "xxx...xxx" */ 2143/* read string expression "xxx...xxx" */
2174static pointer 2144static pointer
2175readstrexp (SCHEME_P) 2145readstrexp (SCHEME_P_ char delim)
2176{ 2146{
2177 char *p = SCHEME_V->strbuff; 2147 char *p = SCHEME_V->strbuff;
2178 int c; 2148 int c;
2179 int c1 = 0; 2149 int c1 = 0;
2180 enum
2181 { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok; 2150 enum { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok;
2182 2151
2183 for (;;) 2152 for (;;)
2184 { 2153 {
2185 c = inchar (SCHEME_A); 2154 c = inchar (SCHEME_A);
2186 2155
… …
2188 return S_F; 2157 return S_F;
2189 2158
2190 switch (state) 2159 switch (state)
2191 { 2160 {
2192 case st_ok: 2161 case st_ok:
2193 switch (c) 2162 if (ecb_expect_false (c == delim))
2194 {
2195 case '\\':
2196 state = st_bsl;
2197 break;
2198
2199 case '"':
2200 *p = 0;
2201 return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff); 2163 return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff);
2202 2164
2203 default: 2165 if (ecb_expect_false (c == '\\'))
2166 state = st_bsl;
2167 else
2204 *p++ = c; 2168 *p++ = c;
2205 break;
2206 }
2207 2169
2208 break; 2170 break;
2209 2171
2210 case st_bsl: 2172 case st_bsl:
2211 switch (c) 2173 switch (c)
… …
2241 case 'r': 2203 case 'r':
2242 *p++ = '\r'; 2204 *p++ = '\r';
2243 state = st_ok; 2205 state = st_ok;
2244 break; 2206 break;
2245 2207
2246 case '"':
2247 *p++ = '"';
2248 state = st_ok;
2249 break;
2250
2251 default: 2208 default:
2252 *p++ = c; 2209 *p++ = c;
2253 state = st_ok; 2210 state = st_ok;
2254 break; 2211 break;
2255 } 2212 }
2256 2213
2257 break; 2214 break;
2258 2215
2259 case st_x1: 2216 case st_x1:
2260 case st_x2: 2217 case st_x2:
2261 c = toupper (c); 2218 c = tolower (c);
2262 2219
2263 if (c >= '0' && c <= 'F') 2220 if (c >= '0' && c <= '9')
2264 {
2265 if (c <= '9')
2266 c1 = (c1 << 4) + c - '0'; 2221 c1 = (c1 << 4) + c - '0';
2267 else 2222 else if (c >= 'a' && c <= 'f')
2268 c1 = (c1 << 4) + c - 'A' + 10; 2223 c1 = (c1 << 4) + c - 'a' + 10;
2269
2270 if (state == st_x1)
2271 state = st_x2;
2272 else
2273 {
2274 *p++ = c1;
2275 state = st_ok;
2276 }
2277 }
2278 else 2224 else
2279 return S_F; 2225 return S_F;
2226
2227 if (state == st_x1)
2228 state = st_x2;
2229 else
2230 {
2231 *p++ = c1;
2232 state = st_ok;
2233 }
2280 2234
2281 break; 2235 break;
2282 2236
2283 case st_oct1: 2237 case st_oct1:
2284 case st_oct2: 2238 case st_oct2:
… …
2288 backchar (SCHEME_A_ c); 2242 backchar (SCHEME_A_ c);
2289 state = st_ok; 2243 state = st_ok;
2290 } 2244 }
2291 else 2245 else
2292 { 2246 {
2293 if (state == st_oct2 && c1 >= 32) 2247 if (state == st_oct2 && c1 >= ' ')
2294 return S_F; 2248 return S_F;
2295 2249
2296 c1 = (c1 << 3) + (c - '0'); 2250 c1 = (c1 << 3) + (c - '0');
2297 2251
2298 if (state == st_oct1) 2252 if (state == st_oct1)
… …
2303 state = st_ok; 2257 state = st_ok;
2304 } 2258 }
2305 } 2259 }
2306 2260
2307 break; 2261 break;
2308
2309 } 2262 }
2310 } 2263 }
2311} 2264}
2312 2265
2313/* check c is in chars */ 2266/* check c is in chars */
2314static INLINE int 2267ecb_inline int
2315is_one_of (char *s, int c) 2268is_one_of (const char *s, int c)
2316{ 2269{
2317 if (c == EOF) 2270 if (c == EOF)
2318 return 1; 2271 return 1;
2319 2272
2320 return !!strchr (s, c); 2273 return !!strchr (s, c);
2321} 2274}
2322 2275
2323/* skip white characters */ 2276/* skip white characters */
2324static INLINE int 2277ecb_inline int
2325skipspace (SCHEME_P) 2278skipspace (SCHEME_P)
2326{ 2279{
2327 int c, curr_line = 0; 2280 int c, curr_line = 0;
2328 2281
2329 do 2282 do
… …
2376 2329
2377 if (is_one_of (" \n\t", c)) 2330 if (is_one_of (" \n\t", c))
2378 return TOK_DOT; 2331 return TOK_DOT;
2379 else 2332 else
2380 { 2333 {
2381 //TODO: ungetc twice in a row is not supported in C
2382 backchar (SCHEME_A_ c); 2334 backchar (SCHEME_A_ c);
2383 backchar (SCHEME_A_ '.');
2384 return TOK_ATOM; 2335 return TOK_DOTATOM;
2385 } 2336 }
2337
2338 case '|':
2339 return TOK_STRATOM;
2386 2340
2387 case '\'': 2341 case '\'':
2388 return TOK_QUOTE; 2342 return TOK_QUOTE;
2389 2343
2390 case ';': 2344 case ';':
… …
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 {
… …
2859/* () is #t in R5RS */ 2812/* () is #t in R5RS */
2860#define is_true(p) ((p) != S_F) 2813#define is_true(p) ((p) != S_F)
2861#define is_false(p) ((p) == S_F) 2814#define is_false(p) ((p) == S_F)
2862 2815
2863/* ========== Environment implementation ========== */ 2816/* ========== Environment implementation ========== */
2864
2865#if !defined(USE_ALIST_ENV) || !defined(USE_OBJECT_LIST)
2866
2867static int
2868hash_fn (const char *key, int table_size)
2869{
2870 const unsigned char *p = key;
2871 uint32_t hash = 2166136261;
2872
2873 while (*p)
2874 hash = (hash ^ *p++) * 16777619;
2875
2876 return hash % table_size;
2877}
2878#endif
2879 2817
2880#ifndef USE_ALIST_ENV 2818#ifndef USE_ALIST_ENV
2881 2819
2882/* 2820/*
2883 * In this implementation, each frame of the environment may be 2821 * In this implementation, each frame of the environment may be
… …
2900 2838
2901 SCHEME_V->envir = immutable_cons (new_frame, old_env); 2839 SCHEME_V->envir = immutable_cons (new_frame, old_env);
2902 setenvironment (SCHEME_V->envir); 2840 setenvironment (SCHEME_V->envir);
2903} 2841}
2904 2842
2905static INLINE void 2843static uint32_t
2844sym_hash (pointer sym, uint32_t size)
2845{
2846 uintptr_t ptr = (uintptr_t)sym;
2847
2848#if 0
2849 /* table size is prime, so why mix */
2850 ptr += ptr >> 32;
2851 ptr += ptr >> 16;
2852 ptr += ptr >> 8;
2853#endif
2854
2855 return ptr % size;
2856}
2857
2858ecb_inline void
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 = sym_hash (variable, veclength (car (env)));
2913
2914 set_vector_elem (car (env), location, immutable_cons (slot, vector_elem (car (env), location))); 2866 vector_set (car (env), location, immutable_cons (slot, vector_get (car (env), location)));
2915 } 2867 }
2916 else 2868 else
2917 set_car (env, immutable_cons (slot, car (env))); 2869 set_car (env, immutable_cons (slot, car (env)));
2918} 2870}
2919 2871
2920static pointer 2872static pointer
2921find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all) 2873find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all)
2922{ 2874{
2923 pointer x, y; 2875 pointer x, y;
2924 int location;
2925 2876
2926 for (x = env; x != NIL; x = cdr (x)) 2877 for (x = env; x != NIL; x = cdr (x))
2927 { 2878 {
2928 if (is_vector (car (x))) 2879 if (is_vector (car (x)))
2929 { 2880 {
2930 location = hash_fn (symname (hdl), veclength (car (x))); 2881 int location = sym_hash (hdl, veclength (car (x)));
2931 y = vector_elem (car (x), location); 2882 y = vector_get (car (x), location);
2932 } 2883 }
2933 else 2884 else
2934 y = car (x); 2885 y = car (x);
2935 2886
2936 for (; y != NIL; y = cdr (y)) 2887 for (; y != NIL; y = cdr (y))
2937 if (caar (y) == hdl) 2888 if (caar (y) == hdl)
2938 break; 2889 break;
2939 2890
2940 if (y != NIL) 2891 if (y != NIL)
2892 return car (y);
2893
2894 if (!all)
2941 break; 2895 break;
2942
2943 if (!all)
2944 return NIL;
2945 } 2896 }
2946
2947 if (x != NIL)
2948 return car (y);
2949 2897
2950 return NIL; 2898 return NIL;
2951} 2899}
2952 2900
2953#else /* USE_ALIST_ENV */ 2901#else /* USE_ALIST_ENV */
2954 2902
2955static INLINE void 2903ecb_inline void
2956new_frame_in_env (SCHEME_P_ pointer old_env) 2904new_frame_in_env (SCHEME_P_ pointer old_env)
2957{ 2905{
2958 SCHEME_V->envir = immutable_cons (NIL, old_env); 2906 SCHEME_V->envir = immutable_cons (NIL, old_env);
2959 setenvironment (SCHEME_V->envir); 2907 setenvironment (SCHEME_V->envir);
2960} 2908}
2961 2909
2962static INLINE void 2910ecb_inline void
2963new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) 2911new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
2964{ 2912{
2965 set_car (env, immutable_cons (immutable_cons (variable, value), car (env))); 2913 set_car (env, immutable_cons (immutable_cons (variable, value), car (env)));
2966} 2914}
2967 2915
… …
2975 for (y = car (x); y != NIL; y = cdr (y)) 2923 for (y = car (x); y != NIL; y = cdr (y))
2976 if (caar (y) == hdl) 2924 if (caar (y) == hdl)
2977 break; 2925 break;
2978 2926
2979 if (y != NIL) 2927 if (y != NIL)
2928 return car (y);
2980 break; 2929 break;
2981 2930
2982 if (!all) 2931 if (!all)
2983 return NIL; 2932 break;
2984 } 2933 }
2985
2986 if (x != NIL)
2987 return car (y);
2988 2934
2989 return NIL; 2935 return NIL;
2990} 2936}
2991 2937
2992#endif /* USE_ALIST_ENV else */ 2938#endif /* USE_ALIST_ENV else */
2993 2939
2994static INLINE void 2940ecb_inline void
2995new_slot_in_env (SCHEME_P_ pointer variable, pointer value) 2941new_slot_in_env (SCHEME_P_ pointer variable, pointer value)
2996{ 2942{
2997 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value); 2943 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value);
2998} 2944}
2999 2945
3000static INLINE void 2946ecb_inline void
3001set_slot_in_env (SCHEME_P_ pointer slot, pointer value) 2947set_slot_in_env (SCHEME_P_ pointer slot, pointer value)
3002{ 2948{
3003 set_cdr (slot, value); 2949 set_cdr (slot, value);
3004} 2950}
3005 2951
3006static INLINE pointer 2952ecb_inline pointer
3007slot_value_in_env (pointer slot) 2953slot_value_in_env (pointer slot)
3008{ 2954{
3009 return cdr (slot); 2955 return cdr (slot);
3010} 2956}
3011 2957
3012/* ========== Evaluation Cycle ========== */ 2958/* ========== Evaluation Cycle ========== */
3013 2959
3014static pointer 2960static int
3015xError_1 (SCHEME_P_ const char *s, pointer a) 2961xError_1 (SCHEME_P_ const char *s, pointer a)
3016{ 2962{
3017#if USE_ERROR_HOOK 2963#if USE_ERROR_HOOK
3018 pointer x; 2964 pointer x;
3019 pointer hdl = SCHEME_V->ERROR_HOOK; 2965 pointer hdl = SCHEME_V->ERROR_HOOK;
… …
3054 code = cons (mk_string (SCHEME_A_ s), code); 3000 code = cons (mk_string (SCHEME_A_ s), code);
3055 setimmutable (car (code)); 3001 setimmutable (car (code));
3056 SCHEME_V->code = cons (slot_value_in_env (x), code); 3002 SCHEME_V->code = cons (slot_value_in_env (x), code);
3057 SCHEME_V->op = OP_EVAL; 3003 SCHEME_V->op = OP_EVAL;
3058 3004
3059 return S_T; 3005 return 0;
3060 } 3006 }
3061#endif 3007#endif
3062 3008
3063 if (a) 3009 if (a)
3064 SCHEME_V->args = cons (a, NIL); 3010 SCHEME_V->args = cons (a, NIL);
… …
3066 SCHEME_V->args = NIL; 3012 SCHEME_V->args = NIL;
3067 3013
3068 SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args); 3014 SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args);
3069 setimmutable (car (SCHEME_V->args)); 3015 setimmutable (car (SCHEME_V->args));
3070 SCHEME_V->op = OP_ERR0; 3016 SCHEME_V->op = OP_ERR0;
3017
3071 return S_T; 3018 return 0;
3072} 3019}
3073 3020
3074#define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a) 3021#define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a)
3075#define Error_0(s) Error_1 (s, 0) 3022#define Error_0(s) Error_1 (s, 0)
3076 3023
3077/* Too small to turn into function */ 3024/* Too small to turn into function */
3078#define BEGIN do { 3025#define BEGIN do {
3079#define END } while (0) 3026#define END } while (0)
3080#define s_goto(a) BEGIN \ 3027#define s_goto(a) BEGIN \
3081 SCHEME_V->op = a; \ 3028 SCHEME_V->op = a; \
3082 return S_T; END 3029 return 0; END
3083 3030
3084#define s_return(a) return xs_return (SCHEME_A_ a) 3031#define s_return(a) return xs_return (SCHEME_A_ a)
3085 3032
3086#ifndef USE_SCHEME_STACK 3033#ifndef USE_SCHEME_STACK
3087 3034
… …
3112 next_frame = SCHEME_V->dump_base + nframes; 3059 next_frame = SCHEME_V->dump_base + nframes;
3113 3060
3114 next_frame->op = op; 3061 next_frame->op = op;
3115 next_frame->args = args; 3062 next_frame->args = args;
3116 next_frame->envir = SCHEME_V->envir; 3063 next_frame->envir = SCHEME_V->envir;
3117 next_frame->code = code; 3064 next_frame->code = code;
3118 3065
3119 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1); 3066 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1);
3120} 3067}
3121 3068
3122static pointer 3069static int
3123xs_return (SCHEME_P_ pointer a) 3070xs_return (SCHEME_P_ pointer a)
3124{ 3071{
3125 int nframes = (uintptr_t)SCHEME_V->dump; 3072 int nframes = (uintptr_t)SCHEME_V->dump;
3126 struct dump_stack_frame *frame; 3073 struct dump_stack_frame *frame;
3127 3074
3128 SCHEME_V->value = a; 3075 SCHEME_V->value = a;
3129 3076
3130 if (nframes <= 0) 3077 if (nframes <= 0)
3131 return NIL; 3078 return -1;
3132 3079
3133 frame = &SCHEME_V->dump_base[--nframes]; 3080 frame = &SCHEME_V->dump_base[--nframes];
3134 SCHEME_V->op = frame->op; 3081 SCHEME_V->op = frame->op;
3135 SCHEME_V->args = frame->args; 3082 SCHEME_V->args = frame->args;
3136 SCHEME_V->envir = frame->envir; 3083 SCHEME_V->envir = frame->envir;
3137 SCHEME_V->code = frame->code; 3084 SCHEME_V->code = frame->code;
3138 SCHEME_V->dump = (pointer)(uintptr_t)nframes; 3085 SCHEME_V->dump = (pointer)(uintptr_t)nframes;
3139 3086
3140 return S_T; 3087 return 0;
3141} 3088}
3142 3089
3143static INLINE void 3090ecb_inline void
3144dump_stack_reset (SCHEME_P) 3091dump_stack_reset (SCHEME_P)
3145{ 3092{
3146 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */ 3093 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */
3147 SCHEME_V->dump = (pointer)+0; 3094 SCHEME_V->dump = (pointer)+0;
3148} 3095}
3149 3096
3150static INLINE void 3097ecb_inline void
3151dump_stack_initialize (SCHEME_P) 3098dump_stack_initialize (SCHEME_P)
3152{ 3099{
3153 SCHEME_V->dump_size = 0; 3100 SCHEME_V->dump_size = 0;
3154 SCHEME_V->dump_base = 0; 3101 SCHEME_V->dump_base = 0;
3155 dump_stack_reset (SCHEME_A); 3102 dump_stack_reset (SCHEME_A);
… …
3208 int i = 0; 3155 int i = 0;
3209 struct dump_stack_frame *frame = SCHEME_V->dump_base; 3156 struct dump_stack_frame *frame = SCHEME_V->dump_base;
3210 3157
3211 while (cont != NIL) 3158 while (cont != NIL)
3212 { 3159 {
3213 frame->op = ivalue (car (cont)); cont = cdr (cont); 3160 frame->op = ivalue_unchecked (car (cont)); cont = cdr (cont);
3214 frame->args = car (cont) ; cont = cdr (cont); 3161 frame->args = car (cont) ; cont = cdr (cont);
3215 frame->envir = car (cont) ; cont = cdr (cont); 3162 frame->envir = car (cont) ; cont = cdr (cont);
3216 frame->code = car (cont) ; cont = cdr (cont); 3163 frame->code = car (cont) ; cont = cdr (cont);
3217 3164
3218 ++frame; 3165 ++frame;
3219 ++i; 3166 ++i;
3220 } 3167 }
3221 3168
3222 SCHEME_V->dump = (pointer)(uintptr_t)i; 3169 SCHEME_V->dump = (pointer)(uintptr_t)i;
3223} 3170}
3224 3171
3225#else 3172#else
3226 3173
3227static INLINE void 3174ecb_inline void
3228dump_stack_reset (SCHEME_P) 3175dump_stack_reset (SCHEME_P)
3229{ 3176{
3230 SCHEME_V->dump = NIL; 3177 SCHEME_V->dump = NIL;
3231} 3178}
3232 3179
3233static INLINE void 3180ecb_inline void
3234dump_stack_initialize (SCHEME_P) 3181dump_stack_initialize (SCHEME_P)
3235{ 3182{
3236 dump_stack_reset (SCHEME_A); 3183 dump_stack_reset (SCHEME_A);
3237} 3184}
3238 3185
… …
3240dump_stack_free (SCHEME_P) 3187dump_stack_free (SCHEME_P)
3241{ 3188{
3242 SCHEME_V->dump = NIL; 3189 SCHEME_V->dump = NIL;
3243} 3190}
3244 3191
3245static pointer 3192static int
3246xs_return (SCHEME_P_ pointer a) 3193xs_return (SCHEME_P_ pointer a)
3247{ 3194{
3248 pointer dump = SCHEME_V->dump; 3195 pointer dump = SCHEME_V->dump;
3249 3196
3250 SCHEME_V->value = a; 3197 SCHEME_V->value = a;
3251 3198
3252 if (dump == NIL) 3199 if (dump == NIL)
3253 return NIL; 3200 return -1;
3254 3201
3255 SCHEME_V->op = ivalue (car (dump)); dump = cdr (dump); 3202 SCHEME_V->op = ivalue_unchecked (car (dump)); dump = cdr (dump);
3256 SCHEME_V->args = car (dump) ; dump = cdr (dump); 3203 SCHEME_V->args = car (dump) ; dump = cdr (dump);
3257 SCHEME_V->envir = car (dump) ; dump = cdr (dump); 3204 SCHEME_V->envir = car (dump) ; dump = cdr (dump);
3258 SCHEME_V->code = car (dump) ; dump = cdr (dump); 3205 SCHEME_V->code = car (dump) ; dump = cdr (dump);
3259 3206
3260 SCHEME_V->dump = dump; 3207 SCHEME_V->dump = dump;
3261 3208
3262 return S_T; 3209 return 0;
3263} 3210}
3264 3211
3265static void 3212static void
3266s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code) 3213s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code)
3267{ 3214{
… …
3292 3239
3293#endif 3240#endif
3294 3241
3295#define s_retbool(tf) s_return ((tf) ? S_T : S_F) 3242#define s_retbool(tf) s_return ((tf) ? S_T : S_F)
3296 3243
3297static pointer 3244static int
3298opexe_0 (SCHEME_P_ enum scheme_opcodes op) 3245opexe_0 (SCHEME_P_ enum scheme_opcodes op)
3299{ 3246{
3247 pointer args = SCHEME_V->args;
3300 pointer x, y; 3248 pointer x, y;
3301 3249
3302 switch (op) 3250 switch (op)
3303 { 3251 {
3304 case OP_LOAD: /* load */ 3252 case OP_LOAD: /* load */
3305 if (file_interactive (SCHEME_A)) 3253 if (file_interactive (SCHEME_A))
3306 { 3254 {
3307 xwrstr ("Loading "); xwrstr (strvalue (car (SCHEME_V->args))); xwrstr ("\n"); 3255 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))); 3256 //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args)));
3309 } 3257 }
3310 3258
3311 if (!file_push (SCHEME_A_ strvalue (car (SCHEME_V->args)))) 3259 if (!file_push (SCHEME_A_ strvalue (car (args))))
3312 Error_1 ("unable to open", car (SCHEME_V->args)); 3260 Error_1 ("unable to open", car (args));
3313 else 3261 else
3314 { 3262 {
3315 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i); 3263 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i);
3316 s_goto (OP_T0LVL); 3264 s_goto (OP_T0LVL);
3317 } 3265 }
… …
3391 case OP_EVAL: /* main part of evaluation */ 3339 case OP_EVAL: /* main part of evaluation */
3392#if USE_TRACING 3340#if USE_TRACING
3393 if (SCHEME_V->tracing) 3341 if (SCHEME_V->tracing)
3394 { 3342 {
3395 /*s_save(SCHEME_A_ OP_VALUEPRINT,NIL,NIL); */ 3343 /*s_save(SCHEME_A_ OP_VALUEPRINT,NIL,NIL); */
3396 s_save (SCHEME_A_ OP_REAL_EVAL, SCHEME_V->args, SCHEME_V->code); 3344 s_save (SCHEME_A_ OP_REAL_EVAL, args, SCHEME_V->code);
3397 SCHEME_V->args = SCHEME_V->code; 3345 SCHEME_V->args = SCHEME_V->code;
3398 putstr (SCHEME_A_ "\nEval: "); 3346 putstr (SCHEME_A_ "\nEval: ");
3399 s_goto (OP_P0LIST); 3347 s_goto (OP_P0LIST);
3400 } 3348 }
3401 3349
… …
3445 SCHEME_V->code = cdr (SCHEME_V->code); 3393 SCHEME_V->code = cdr (SCHEME_V->code);
3446 s_goto (OP_E1ARGS); 3394 s_goto (OP_E1ARGS);
3447 } 3395 }
3448 3396
3449 case OP_E1ARGS: /* eval arguments */ 3397 case OP_E1ARGS: /* eval arguments */
3450 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 3398 args = cons (SCHEME_V->value, args);
3451 3399
3452 if (is_pair (SCHEME_V->code)) /* continue */ 3400 if (is_pair (SCHEME_V->code)) /* continue */
3453 { 3401 {
3454 s_save (SCHEME_A_ OP_E1ARGS, SCHEME_V->args, cdr (SCHEME_V->code)); 3402 s_save (SCHEME_A_ OP_E1ARGS, args, cdr (SCHEME_V->code));
3455 SCHEME_V->code = car (SCHEME_V->code); 3403 SCHEME_V->code = car (SCHEME_V->code);
3456 SCHEME_V->args = NIL; 3404 SCHEME_V->args = NIL;
3457 s_goto (OP_EVAL); 3405 s_goto (OP_EVAL);
3458 } 3406 }
3459 else /* end */ 3407 else /* end */
3460 { 3408 {
3461 SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); 3409 args = reverse_in_place (SCHEME_A_ NIL, args);
3462 SCHEME_V->code = car (SCHEME_V->args); 3410 SCHEME_V->code = car (args);
3463 SCHEME_V->args = cdr (SCHEME_V->args); 3411 SCHEME_V->args = cdr (args);
3464 s_goto (OP_APPLY); 3412 s_goto (OP_APPLY);
3465 } 3413 }
3466 3414
3467#if USE_TRACING 3415#if USE_TRACING
3468 3416
3469 case OP_TRACING: 3417 case OP_TRACING:
3470 { 3418 {
3471 int tr = SCHEME_V->tracing; 3419 int tr = SCHEME_V->tracing;
3472 3420
3473 SCHEME_V->tracing = ivalue (car (SCHEME_V->args)); 3421 SCHEME_V->tracing = ivalue_unchecked (car (args));
3474 s_return (mk_integer (SCHEME_A_ tr)); 3422 s_return (mk_integer (SCHEME_A_ tr));
3475 } 3423 }
3476 3424
3477#endif 3425#endif
3478 3426
3479 case OP_APPLY: /* apply 'code' to 'args' */ 3427 case OP_APPLY: /* apply 'code' to 'args' */
3480#if USE_TRACING 3428#if USE_TRACING
3481 if (SCHEME_V->tracing) 3429 if (SCHEME_V->tracing)
3482 { 3430 {
3483 s_save (SCHEME_A_ OP_REAL_APPLY, SCHEME_V->args, SCHEME_V->code); 3431 s_save (SCHEME_A_ OP_REAL_APPLY, args, SCHEME_V->code);
3484 SCHEME_V->print_flag = 1; 3432 SCHEME_V->print_flag = 1;
3485 /* SCHEME_V->args=cons(SCHEME_V->code,SCHEME_V->args); */ 3433 /* args=cons(SCHEME_V->code,args); */
3486 putstr (SCHEME_A_ "\nApply to: "); 3434 putstr (SCHEME_A_ "\nApply to: ");
3487 s_goto (OP_P0LIST); 3435 s_goto (OP_P0LIST);
3488 } 3436 }
3489 3437
3490 /* fall through */ 3438 /* fall through */
3491 3439
3492 case OP_REAL_APPLY: 3440 case OP_REAL_APPLY:
3493#endif 3441#endif
3494 if (is_proc (SCHEME_V->code)) 3442 if (is_proc (SCHEME_V->code))
3495 {
3496 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */ 3443 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */
3497 }
3498 else if (is_foreign (SCHEME_V->code)) 3444 else if (is_foreign (SCHEME_V->code))
3499 { 3445 {
3500 /* Keep nested calls from GC'ing the arglist */ 3446 /* Keep nested calls from GC'ing the arglist */
3501 push_recent_alloc (SCHEME_A_ SCHEME_V->args, NIL); 3447 push_recent_alloc (SCHEME_A_ args, NIL);
3502 x = SCHEME_V->code->object.ff (SCHEME_A_ SCHEME_V->args); 3448 x = SCHEME_V->code->object.ff (SCHEME_A_ args);
3503 3449
3504 s_return (x); 3450 s_return (x);
3505 } 3451 }
3506 else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */ 3452 else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */
3507 { 3453 {
3508 /* Should not accept promise */ 3454 /* Should not accept promise */
3509 /* make environment */ 3455 /* make environment */
3510 new_frame_in_env (SCHEME_A_ closure_env (SCHEME_V->code)); 3456 new_frame_in_env (SCHEME_A_ closure_env (SCHEME_V->code));
3511 3457
3512 for (x = car (closure_code (SCHEME_V->code)), y = SCHEME_V->args; is_pair (x); x = cdr (x), y = cdr (y)) 3458 for (x = car (closure_code (SCHEME_V->code)), y = args; is_pair (x); x = cdr (x), y = cdr (y))
3513 { 3459 {
3514 if (y == NIL) 3460 if (y == NIL)
3515 Error_0 ("not enough arguments"); 3461 Error_0 ("not enough arguments");
3516 else 3462 else
3517 new_slot_in_env (SCHEME_A_ car (x), car (y)); 3463 new_slot_in_env (SCHEME_A_ car (x), car (y));
… …
3535 s_goto (OP_BEGIN); 3481 s_goto (OP_BEGIN);
3536 } 3482 }
3537 else if (is_continuation (SCHEME_V->code)) /* CONTINUATION */ 3483 else if (is_continuation (SCHEME_V->code)) /* CONTINUATION */
3538 { 3484 {
3539 ss_set_cont (SCHEME_A_ cont_dump (SCHEME_V->code)); 3485 ss_set_cont (SCHEME_A_ cont_dump (SCHEME_V->code));
3540 s_return (SCHEME_V->args != NIL ? car (SCHEME_V->args) : NIL); 3486 s_return (args != NIL ? car (args) : NIL);
3541 } 3487 }
3542 else 3488 else
3543 Error_0 ("illegal function"); 3489 Error_0 ("illegal function");
3544 3490
3545 case OP_DOMACRO: /* do macro */ 3491 case OP_DOMACRO: /* do macro */
… …
3554 { 3500 {
3555 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1); 3501 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1);
3556 3502
3557 if (f != NIL) 3503 if (f != NIL)
3558 { 3504 {
3559 s_save (SCHEME_A_ OP_LAMBDA1, SCHEME_V->args, SCHEME_V->code); 3505 s_save (SCHEME_A_ OP_LAMBDA1, args, SCHEME_V->code);
3560 SCHEME_V->args = cons (SCHEME_V->code, NIL); 3506 SCHEME_V->args = cons (SCHEME_V->code, NIL);
3561 SCHEME_V->code = slot_value_in_env (f); 3507 SCHEME_V->code = slot_value_in_env (f);
3562 s_goto (OP_APPLY); 3508 s_goto (OP_APPLY);
3563 } 3509 }
3564 3510
… …
3575 s_return (mk_closure (SCHEME_A_ SCHEME_V->code, SCHEME_V->envir)); 3521 s_return (mk_closure (SCHEME_A_ SCHEME_V->code, SCHEME_V->envir));
3576 3522
3577#endif 3523#endif
3578 3524
3579 case OP_MKCLOSURE: /* make-closure */ 3525 case OP_MKCLOSURE: /* make-closure */
3580 x = car (SCHEME_V->args); 3526 x = car (args);
3581 3527
3582 if (car (x) == SCHEME_V->LAMBDA) 3528 if (car (x) == SCHEME_V->LAMBDA)
3583 x = cdr (x); 3529 x = cdr (x);
3584 3530
3585 if (cdr (SCHEME_V->args) == NIL) 3531 if (cdr (args) == NIL)
3586 y = SCHEME_V->envir; 3532 y = SCHEME_V->envir;
3587 else 3533 else
3588 y = cadr (SCHEME_V->args); 3534 y = cadr (args);
3589 3535
3590 s_return (mk_closure (SCHEME_A_ x, y)); 3536 s_return (mk_closure (SCHEME_A_ x, y));
3591 3537
3592 case OP_QUOTE: /* quote */ 3538 case OP_QUOTE: /* quote */
3593 s_return (car (SCHEME_V->code)); 3539 s_return (car (SCHEME_V->code));
… …
3625 3571
3626 3572
3627 case OP_DEFP: /* defined? */ 3573 case OP_DEFP: /* defined? */
3628 x = SCHEME_V->envir; 3574 x = SCHEME_V->envir;
3629 3575
3630 if (cdr (SCHEME_V->args) != NIL) 3576 if (cdr (args) != NIL)
3631 x = cadr (SCHEME_V->args); 3577 x = cadr (args);
3632 3578
3633 s_retbool (find_slot_in_env (SCHEME_A_ x, car (SCHEME_V->args), 1) != NIL); 3579 s_retbool (find_slot_in_env (SCHEME_A_ x, car (args), 1) != NIL);
3634 3580
3635 case OP_SET0: /* set! */ 3581 case OP_SET0: /* set! */
3636 if (is_immutable (car (SCHEME_V->code))) 3582 if (is_immutable (car (SCHEME_V->code)))
3637 Error_1 ("set!: unable to alter immutable variable", car (SCHEME_V->code)); 3583 Error_1 ("set!: unable to alter immutable variable", car (SCHEME_V->code));
3638 3584
… …
3669 3615
3670 case OP_IF1: /* if */ 3616 case OP_IF1: /* if */
3671 if (is_true (SCHEME_V->value)) 3617 if (is_true (SCHEME_V->value))
3672 SCHEME_V->code = car (SCHEME_V->code); 3618 SCHEME_V->code = car (SCHEME_V->code);
3673 else 3619 else
3674 SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because 3620 SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because * car(NIL) = NIL */
3675
3676 * car(NIL) = NIL */
3677 s_goto (OP_EVAL); 3621 s_goto (OP_EVAL);
3678 3622
3679 case OP_LET0: /* let */ 3623 case OP_LET0: /* let */
3680 SCHEME_V->args = NIL; 3624 SCHEME_V->args = NIL;
3681 SCHEME_V->value = SCHEME_V->code; 3625 SCHEME_V->value = SCHEME_V->code;
3682 SCHEME_V->code = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code); 3626 SCHEME_V->code = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code);
3683 s_goto (OP_LET1); 3627 s_goto (OP_LET1);
3684 3628
3685 case OP_LET1: /* let (calculate parameters) */ 3629 case OP_LET1: /* let (calculate parameters) */
3686 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 3630 args = cons (SCHEME_V->value, args);
3687 3631
3688 if (is_pair (SCHEME_V->code)) /* continue */ 3632 if (is_pair (SCHEME_V->code)) /* continue */
3689 { 3633 {
3690 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code))) 3634 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code)))
3691 Error_1 ("Bad syntax of binding spec in let :", car (SCHEME_V->code)); 3635 Error_1 ("Bad syntax of binding spec in let :", car (SCHEME_V->code));
3692 3636
3693 s_save (SCHEME_A_ OP_LET1, SCHEME_V->args, cdr (SCHEME_V->code)); 3637 s_save (SCHEME_A_ OP_LET1, args, cdr (SCHEME_V->code));
3694 SCHEME_V->code = cadar (SCHEME_V->code); 3638 SCHEME_V->code = cadar (SCHEME_V->code);
3695 SCHEME_V->args = NIL; 3639 SCHEME_V->args = NIL;
3696 s_goto (OP_EVAL); 3640 s_goto (OP_EVAL);
3697 } 3641 }
3698 else /* end */ 3642 else /* end */
3699 { 3643 {
3700 SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); 3644 args = reverse_in_place (SCHEME_A_ NIL, args);
3701 SCHEME_V->code = car (SCHEME_V->args); 3645 SCHEME_V->code = car (args);
3702 SCHEME_V->args = cdr (SCHEME_V->args); 3646 SCHEME_V->args = cdr (args);
3703 s_goto (OP_LET2); 3647 s_goto (OP_LET2);
3704 } 3648 }
3705 3649
3706 case OP_LET2: /* let */ 3650 case OP_LET2: /* let */
3707 new_frame_in_env (SCHEME_A_ SCHEME_V->envir); 3651 new_frame_in_env (SCHEME_A_ SCHEME_V->envir);
3708 3652
3709 for (x = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code), y = SCHEME_V->args; 3653 for (x = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code), y = args;
3710 y != NIL; x = cdr (x), y = cdr (y)) 3654 y != NIL; x = cdr (x), y = cdr (y))
3711 new_slot_in_env (SCHEME_A_ caar (x), car (y)); 3655 new_slot_in_env (SCHEME_A_ caar (x), car (y));
3712 3656
3713 if (is_symbol (car (SCHEME_V->code))) /* named let */ 3657 if (is_symbol (car (SCHEME_V->code))) /* named let */
3714 { 3658 {
3715 for (x = cadr (SCHEME_V->code), SCHEME_V->args = NIL; x != NIL; x = cdr (x)) 3659 for (x = cadr (SCHEME_V->code), args = NIL; x != NIL; x = cdr (x))
3716 { 3660 {
3717 if (!is_pair (x)) 3661 if (!is_pair (x))
3718 Error_1 ("Bad syntax of binding in let :", x); 3662 Error_1 ("Bad syntax of binding in let :", x);
3719 3663
3720 if (!is_list (SCHEME_A_ car (x))) 3664 if (!is_list (SCHEME_A_ car (x)))
3721 Error_1 ("Bad syntax of binding in let :", car (x)); 3665 Error_1 ("Bad syntax of binding in let :", car (x));
3722 3666
3723 SCHEME_V->args = cons (caar (x), SCHEME_V->args); 3667 args = cons (caar (x), args);
3724 } 3668 }
3725 3669
3726 x =
3727 mk_closure (SCHEME_A_ cons (reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args), cddr (SCHEME_V->code)), 3670 x = mk_closure (SCHEME_A_ cons (reverse_in_place (SCHEME_A_ NIL, args), cddr (SCHEME_V->code)),
3728 SCHEME_V->envir); 3671 SCHEME_V->envir);
3729 new_slot_in_env (SCHEME_A_ car (SCHEME_V->code), x); 3672 new_slot_in_env (SCHEME_A_ car (SCHEME_V->code), x);
3730 SCHEME_V->code = cddr (SCHEME_V->code); 3673 SCHEME_V->code = cddr (SCHEME_V->code);
3731 SCHEME_V->args = NIL;
3732 } 3674 }
3733 else 3675 else
3734 { 3676 {
3735 SCHEME_V->code = cdr (SCHEME_V->code); 3677 SCHEME_V->code = cdr (SCHEME_V->code);
3678 }
3679
3736 SCHEME_V->args = NIL; 3680 SCHEME_V->args = NIL;
3737 }
3738
3739 s_goto (OP_BEGIN); 3681 s_goto (OP_BEGIN);
3740 3682
3741 case OP_LET0AST: /* let* */ 3683 case OP_LET0AST: /* let* */
3742 if (car (SCHEME_V->code) == NIL) 3684 if (car (SCHEME_V->code) == NIL)
3743 { 3685 {
… …
3761 new_slot_in_env (SCHEME_A_ caar (SCHEME_V->code), SCHEME_V->value); 3703 new_slot_in_env (SCHEME_A_ caar (SCHEME_V->code), SCHEME_V->value);
3762 SCHEME_V->code = cdr (SCHEME_V->code); 3704 SCHEME_V->code = cdr (SCHEME_V->code);
3763 3705
3764 if (is_pair (SCHEME_V->code)) /* continue */ 3706 if (is_pair (SCHEME_V->code)) /* continue */
3765 { 3707 {
3766 s_save (SCHEME_A_ OP_LET2AST, SCHEME_V->args, SCHEME_V->code); 3708 s_save (SCHEME_A_ OP_LET2AST, args, SCHEME_V->code);
3767 SCHEME_V->code = cadar (SCHEME_V->code); 3709 SCHEME_V->code = cadar (SCHEME_V->code);
3768 SCHEME_V->args = NIL; 3710 SCHEME_V->args = NIL;
3769 s_goto (OP_EVAL); 3711 s_goto (OP_EVAL);
3770 } 3712 }
3771 else /* end */ 3713 else /* end */
3772 { 3714 {
3773 SCHEME_V->code = SCHEME_V->args; 3715 SCHEME_V->code = args;
3774 SCHEME_V->args = NIL; 3716 SCHEME_V->args = NIL;
3775 s_goto (OP_BEGIN); 3717 s_goto (OP_BEGIN);
3776 } 3718 }
3777 3719
3778 case OP_LET0REC: /* letrec */ 3720 case OP_LET0REC: /* letrec */
… …
3781 SCHEME_V->value = SCHEME_V->code; 3723 SCHEME_V->value = SCHEME_V->code;
3782 SCHEME_V->code = car (SCHEME_V->code); 3724 SCHEME_V->code = car (SCHEME_V->code);
3783 s_goto (OP_LET1REC); 3725 s_goto (OP_LET1REC);
3784 3726
3785 case OP_LET1REC: /* letrec (calculate parameters) */ 3727 case OP_LET1REC: /* letrec (calculate parameters) */
3786 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 3728 args = cons (SCHEME_V->value, args);
3787 3729
3788 if (is_pair (SCHEME_V->code)) /* continue */ 3730 if (is_pair (SCHEME_V->code)) /* continue */
3789 { 3731 {
3790 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code))) 3732 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code)))
3791 Error_1 ("Bad syntax of binding spec in letrec :", car (SCHEME_V->code)); 3733 Error_1 ("Bad syntax of binding spec in letrec :", car (SCHEME_V->code));
3792 3734
3793 s_save (SCHEME_A_ OP_LET1REC, SCHEME_V->args, cdr (SCHEME_V->code)); 3735 s_save (SCHEME_A_ OP_LET1REC, args, cdr (SCHEME_V->code));
3794 SCHEME_V->code = cadar (SCHEME_V->code); 3736 SCHEME_V->code = cadar (SCHEME_V->code);
3795 SCHEME_V->args = NIL; 3737 SCHEME_V->args = NIL;
3796 s_goto (OP_EVAL); 3738 s_goto (OP_EVAL);
3797 } 3739 }
3798 else /* end */ 3740 else /* end */
3799 { 3741 {
3800 SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); 3742 args = reverse_in_place (SCHEME_A_ NIL, args);
3801 SCHEME_V->code = car (SCHEME_V->args); 3743 SCHEME_V->code = car (args);
3802 SCHEME_V->args = cdr (SCHEME_V->args); 3744 SCHEME_V->args = cdr (args);
3803 s_goto (OP_LET2REC); 3745 s_goto (OP_LET2REC);
3804 } 3746 }
3805 3747
3806 case OP_LET2REC: /* letrec */ 3748 case OP_LET2REC: /* letrec */
3807 for (x = car (SCHEME_V->code), y = SCHEME_V->args; y != NIL; x = cdr (x), y = cdr (y)) 3749 for (x = car (SCHEME_V->code), y = args; y != NIL; x = cdr (x), y = cdr (y))
3808 new_slot_in_env (SCHEME_A_ caar (x), car (y)); 3750 new_slot_in_env (SCHEME_A_ caar (x), car (y));
3809 3751
3810 SCHEME_V->code = cdr (SCHEME_V->code); 3752 SCHEME_V->code = cdr (SCHEME_V->code);
3811 SCHEME_V->args = NIL; 3753 SCHEME_V->args = NIL;
3812 s_goto (OP_BEGIN); 3754 s_goto (OP_BEGIN);
… …
3898 s_save (SCHEME_A_ OP_C1STREAM, NIL, cdr (SCHEME_V->code)); 3840 s_save (SCHEME_A_ OP_C1STREAM, NIL, cdr (SCHEME_V->code));
3899 SCHEME_V->code = car (SCHEME_V->code); 3841 SCHEME_V->code = car (SCHEME_V->code);
3900 s_goto (OP_EVAL); 3842 s_goto (OP_EVAL);
3901 3843
3902 case OP_C1STREAM: /* cons-stream */ 3844 case OP_C1STREAM: /* cons-stream */
3903 SCHEME_V->args = SCHEME_V->value; /* save SCHEME_V->value to register SCHEME_V->args for gc */ 3845 SCHEME_V->args = SCHEME_V->value; /* save SCHEME_V->value to register args for gc */
3904 x = mk_closure (SCHEME_A_ cons (NIL, SCHEME_V->code), SCHEME_V->envir); 3846 x = mk_closure (SCHEME_A_ cons (NIL, SCHEME_V->code), SCHEME_V->envir);
3905 set_typeflag (x, T_PROMISE); 3847 set_typeflag (x, T_PROMISE);
3906 s_return (cons (SCHEME_V->args, x)); 3848 s_return (cons (args, x));
3907 3849
3908 case OP_MACRO0: /* macro */ 3850 case OP_MACRO0: /* macro */
3909 if (is_pair (car (SCHEME_V->code))) 3851 if (is_pair (car (SCHEME_V->code)))
3910 { 3852 {
3911 x = caar (SCHEME_V->code); 3853 x = caar (SCHEME_V->code);
… …
3944 { 3886 {
3945 if (!is_pair (y = caar (x))) 3887 if (!is_pair (y = caar (x)))
3946 break; 3888 break;
3947 3889
3948 for (; y != NIL; y = cdr (y)) 3890 for (; y != NIL; y = cdr (y))
3949 {
3950 if (eqv (car (y), SCHEME_V->value)) 3891 if (eqv (car (y), SCHEME_V->value))
3951 break; 3892 break;
3952 }
3953 3893
3954 if (y != NIL) 3894 if (y != NIL)
3955 break; 3895 break;
3956 } 3896 }
3957 3897
… …
3977 s_goto (OP_BEGIN); 3917 s_goto (OP_BEGIN);
3978 else 3918 else
3979 s_return (NIL); 3919 s_return (NIL);
3980 3920
3981 case OP_PAPPLY: /* apply */ 3921 case OP_PAPPLY: /* apply */
3982 SCHEME_V->code = car (SCHEME_V->args); 3922 SCHEME_V->code = car (args);
3983 SCHEME_V->args = list_star (SCHEME_A_ cdr (SCHEME_V->args)); 3923 SCHEME_V->args = list_star (SCHEME_A_ cdr (args));
3984 /*SCHEME_V->args = cadr(SCHEME_V->args); */ 3924 /*SCHEME_V->args = cadr(args); */
3985 s_goto (OP_APPLY); 3925 s_goto (OP_APPLY);
3986 3926
3987 case OP_PEVAL: /* eval */ 3927 case OP_PEVAL: /* eval */
3988 if (cdr (SCHEME_V->args) != NIL) 3928 if (cdr (args) != NIL)
3989 SCHEME_V->envir = cadr (SCHEME_V->args); 3929 SCHEME_V->envir = cadr (args);
3990 3930
3991 SCHEME_V->code = car (SCHEME_V->args); 3931 SCHEME_V->code = car (args);
3992 s_goto (OP_EVAL); 3932 s_goto (OP_EVAL);
3993 3933
3994 case OP_CONTINUATION: /* call-with-current-continuation */ 3934 case OP_CONTINUATION: /* call-with-current-continuation */
3995 SCHEME_V->code = car (SCHEME_V->args); 3935 SCHEME_V->code = car (args);
3996 SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL); 3936 SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL);
3997 s_goto (OP_APPLY); 3937 s_goto (OP_APPLY);
3998 } 3938 }
3999 3939
4000 return S_T; 3940 if (USE_ERROR_CHECKING) abort ();
4001} 3941}
4002 3942
4003static pointer 3943static int
4004opexe_2 (SCHEME_P_ enum scheme_opcodes op) 3944opexe_1 (SCHEME_P_ enum scheme_opcodes op)
4005{ 3945{
4006 pointer x; 3946 pointer args = SCHEME_V->args;
3947 pointer x = car (args);
4007 num v; 3948 num v;
4008 3949
3950 switch (op)
3951 {
4009#if USE_MATH 3952#if USE_MATH
4010 RVALUE dd;
4011#endif
4012
4013 switch (op)
4014 {
4015#if USE_MATH
4016
4017 case OP_INEX2EX: /* inexact->exact */ 3953 case OP_INEX2EX: /* inexact->exact */
4018 x = car (SCHEME_V->args); 3954 {
4019
4020 if (num_is_integer (x)) 3955 if (is_integer (x))
4021 s_return (x); 3956 s_return (x);
4022 else if (modf (rvalue_unchecked (x), &dd) == 0.0) 3957
3958 RVALUE r = rvalue_unchecked (x);
3959
3960 if (r == (RVALUE)(IVALUE)r)
4023 s_return (mk_integer (SCHEME_A_ ivalue (x))); 3961 s_return (mk_integer (SCHEME_A_ rvalue_unchecked (x)));
4024 else 3962 else
4025 Error_1 ("inexact->exact: not integral:", x); 3963 Error_1 ("inexact->exact: not integral:", x);
3964 }
4026 3965
4027 case OP_EXP:
4028 x = car (SCHEME_V->args);
4029 s_return (mk_real (SCHEME_A_ exp (rvalue (x)))); 3966 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)))); 3967 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)))); 3968 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)))); 3969 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)))); 3970 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)))); 3971 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)))); 3972 case OP_ACOS: s_return (mk_real (SCHEME_A_ acos (rvalue (x))));
4054 3973
4055 case OP_ATAN: 3974 case OP_ATAN:
4056 x = car (SCHEME_V->args);
4057
4058 if (cdr (SCHEME_V->args) == NIL) 3975 if (cdr (args) == NIL)
4059 s_return (mk_real (SCHEME_A_ atan (rvalue (x)))); 3976 s_return (mk_real (SCHEME_A_ atan (rvalue (x))));
4060 else 3977 else
4061 { 3978 {
4062 pointer y = cadr (SCHEME_V->args); 3979 pointer y = cadr (args);
4063
4064 s_return (mk_real (SCHEME_A_ atan2 (rvalue (x), rvalue (y)))); 3980 s_return (mk_real (SCHEME_A_ atan2 (rvalue (x), rvalue (y))));
4065 } 3981 }
4066 3982
4067 case OP_SQRT: 3983 case OP_SQRT:
4068 x = car (SCHEME_V->args);
4069 s_return (mk_real (SCHEME_A_ sqrt (rvalue (x)))); 3984 s_return (mk_real (SCHEME_A_ sqrt (rvalue (x))));
4070 3985
4071 case OP_EXPT: 3986 case OP_EXPT:
4072 { 3987 {
4073 RVALUE result; 3988 RVALUE result;
4074 int real_result = 1; 3989 int real_result = 1;
4075 pointer y = cadr (SCHEME_V->args); 3990 pointer y = cadr (args);
4076 3991
4077 x = car (SCHEME_V->args);
4078
4079 if (num_is_integer (x) && num_is_integer (y)) 3992 if (is_integer (x) && is_integer (y))
4080 real_result = 0; 3993 real_result = 0;
4081 3994
4082 /* This 'if' is an R5RS compatibility fix. */ 3995 /* This 'if' is an R5RS compatibility fix. */
4083 /* NOTE: Remove this 'if' fix for R6RS. */ 3996 /* NOTE: Remove this 'if' fix for R6RS. */
4084 if (rvalue (x) == 0 && rvalue (y) < 0) 3997 if (rvalue (x) == 0 && rvalue (y) < 0)
4085 result = 0.0; 3998 result = 0;
4086 else 3999 else
4087 result = pow (rvalue (x), rvalue (y)); 4000 result = pow (rvalue (x), rvalue (y));
4088 4001
4089 /* Before returning integer result make sure we can. */ 4002 /* Before returning integer result make sure we can. */
4090 /* If the test fails, result is too big for integer. */ 4003 /* If the test fails, result is too big for integer. */
4091 if (!real_result) 4004 if (!real_result)
4092 { 4005 {
4093 long result_as_long = (long) result; 4006 long result_as_long = result;
4094 4007
4095 if (result != (RVALUE) result_as_long) 4008 if (result != result_as_long)
4096 real_result = 1; 4009 real_result = 1;
4097 } 4010 }
4098 4011
4099 if (real_result) 4012 if (real_result)
4100 s_return (mk_real (SCHEME_A_ result)); 4013 s_return (mk_real (SCHEME_A_ result));
4101 else 4014 else
4102 s_return (mk_integer (SCHEME_A_ result)); 4015 s_return (mk_integer (SCHEME_A_ result));
4103 } 4016 }
4104 4017
4105 case OP_FLOOR:
4106 x = car (SCHEME_V->args);
4107 s_return (mk_real (SCHEME_A_ floor (rvalue (x)))); 4018 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)))); 4019 case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x))));
4112 4020
4113 case OP_TRUNCATE: 4021 case OP_TRUNCATE:
4114 { 4022 {
4115 RVALUE rvalue_of_x; 4023 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))); 4024 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 } 4025 }
4125 4026
4126 case OP_ROUND: 4027 case OP_ROUND:
4127 x = car (SCHEME_V->args);
4128
4129 if (num_is_integer (x)) 4028 if (is_integer (x))
4130 s_return (x); 4029 s_return (x);
4131 4030
4132 s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x)))); 4031 s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x))));
4133#endif 4032#endif
4134 4033
4135 case OP_ADD: /* + */ 4034 case OP_ADD: /* + */
4136 v = num_zero; 4035 v = num_zero;
4137 4036
4138 for (x = SCHEME_V->args; x != NIL; x = cdr (x)) 4037 for (x = args; x != NIL; x = cdr (x))
4139 v = num_add (v, nvalue (car (x))); 4038 v = num_op (NUM_ADD, v, nvalue (car (x)));
4140 4039
4141 s_return (mk_number (SCHEME_A_ v)); 4040 s_return (mk_number (SCHEME_A_ v));
4142 4041
4143 case OP_MUL: /* * */ 4042 case OP_MUL: /* * */
4144 v = num_one; 4043 v = num_one;
4145 4044
4146 for (x = SCHEME_V->args; x != NIL; x = cdr (x)) 4045 for (x = args; x != NIL; x = cdr (x))
4147 v = num_mul (v, nvalue (car (x))); 4046 v = num_op (NUM_MUL, v, nvalue (car (x)));
4148 4047
4149 s_return (mk_number (SCHEME_A_ v)); 4048 s_return (mk_number (SCHEME_A_ v));
4150 4049
4151 case OP_SUB: /* - */ 4050 case OP_SUB: /* - */
4152 if (cdr (SCHEME_V->args) == NIL) 4051 if (cdr (args) == NIL)
4153 { 4052 {
4154 x = SCHEME_V->args; 4053 x = args;
4155 v = num_zero; 4054 v = num_zero;
4156 } 4055 }
4157 else 4056 else
4158 { 4057 {
4159 x = cdr (SCHEME_V->args); 4058 x = cdr (args);
4160 v = nvalue (car (SCHEME_V->args)); 4059 v = nvalue (car (args));
4161 } 4060 }
4162 4061
4163 for (; x != NIL; x = cdr (x)) 4062 for (; x != NIL; x = cdr (x))
4164 v = num_sub (v, nvalue (car (x))); 4063 v = num_op (NUM_SUB, v, nvalue (car (x)));
4165 4064
4166 s_return (mk_number (SCHEME_A_ v)); 4065 s_return (mk_number (SCHEME_A_ v));
4167 4066
4168 case OP_DIV: /* / */ 4067 case OP_DIV: /* / */
4169 if (cdr (SCHEME_V->args) == NIL) 4068 if (cdr (args) == NIL)
4170 { 4069 {
4171 x = SCHEME_V->args; 4070 x = args;
4172 v = num_one; 4071 v = num_one;
4173 } 4072 }
4174 else 4073 else
4175 { 4074 {
4176 x = cdr (SCHEME_V->args); 4075 x = cdr (args);
4177 v = nvalue (car (SCHEME_V->args)); 4076 v = nvalue (car (args));
4178 } 4077 }
4179 4078
4180 for (; x != NIL; x = cdr (x)) 4079 for (; x != NIL; x = cdr (x))
4181 {
4182 if (!is_zero_rvalue (rvalue (car (x)))) 4080 if (!is_zero_rvalue (rvalue (car (x))))
4183 v = num_div (v, nvalue (car (x))); 4081 v = num_div (v, nvalue (car (x)));
4184 else 4082 else
4185 Error_0 ("/: division by zero"); 4083 Error_0 ("/: division by zero");
4186 }
4187 4084
4188 s_return (mk_number (SCHEME_A_ v)); 4085 s_return (mk_number (SCHEME_A_ v));
4189 4086
4190 case OP_INTDIV: /* quotient */ 4087 case OP_INTDIV: /* quotient */
4191 if (cdr (SCHEME_V->args) == NIL) 4088 if (cdr (args) == NIL)
4192 { 4089 {
4193 x = SCHEME_V->args; 4090 x = args;
4194 v = num_one; 4091 v = num_one;
4195 } 4092 }
4196 else 4093 else
4197 { 4094 {
4198 x = cdr (SCHEME_V->args); 4095 x = cdr (args);
4199 v = nvalue (car (SCHEME_V->args)); 4096 v = nvalue (car (args));
4200 } 4097 }
4201 4098
4202 for (; x != NIL; x = cdr (x)) 4099 for (; x != NIL; x = cdr (x))
4203 { 4100 {
4204 if (ivalue (car (x)) != 0) 4101 if (ivalue (car (x)) != 0)
4205 v = num_intdiv (v, nvalue (car (x))); 4102 v = num_op (NUM_INTDIV, v, nvalue (car (x)));
4206 else 4103 else
4207 Error_0 ("quotient: division by zero"); 4104 Error_0 ("quotient: division by zero");
4208 } 4105 }
4209 4106
4210 s_return (mk_number (SCHEME_A_ v)); 4107 s_return (mk_number (SCHEME_A_ v));
4211 4108
4212 case OP_REM: /* remainder */ 4109 case OP_REM: /* remainder */
4213 v = nvalue (car (SCHEME_V->args)); 4110 v = nvalue (x);
4214 4111
4215 if (ivalue (cadr (SCHEME_V->args)) != 0) 4112 if (ivalue (cadr (args)) != 0)
4216 v = num_rem (v, nvalue (cadr (SCHEME_V->args))); 4113 v = num_rem (v, nvalue (cadr (args)));
4217 else 4114 else
4218 Error_0 ("remainder: division by zero"); 4115 Error_0 ("remainder: division by zero");
4219 4116
4220 s_return (mk_number (SCHEME_A_ v)); 4117 s_return (mk_number (SCHEME_A_ v));
4221 4118
4222 case OP_MOD: /* modulo */ 4119 case OP_MOD: /* modulo */
4223 v = nvalue (car (SCHEME_V->args)); 4120 v = nvalue (x);
4224 4121
4225 if (ivalue (cadr (SCHEME_V->args)) != 0) 4122 if (ivalue (cadr (args)) != 0)
4226 v = num_mod (v, nvalue (cadr (SCHEME_V->args))); 4123 v = num_mod (v, nvalue (cadr (args)));
4227 else 4124 else
4228 Error_0 ("modulo: division by zero"); 4125 Error_0 ("modulo: division by zero");
4229 4126
4230 s_return (mk_number (SCHEME_A_ v)); 4127 s_return (mk_number (SCHEME_A_ v));
4231 4128
4232 case OP_CAR: /* car */ 4129 case OP_CAR: /* car */
4233 s_return (caar (SCHEME_V->args)); 4130 s_return (caar (args));
4234 4131
4235 case OP_CDR: /* cdr */ 4132 case OP_CDR: /* cdr */
4236 s_return (cdar (SCHEME_V->args)); 4133 s_return (cdar (args));
4237 4134
4238 case OP_CONS: /* cons */ 4135 case OP_CONS: /* cons */
4239 set_cdr (SCHEME_V->args, cadr (SCHEME_V->args)); 4136 set_cdr (args, cadr (args));
4240 s_return (SCHEME_V->args); 4137 s_return (args);
4241 4138
4242 case OP_SETCAR: /* set-car! */ 4139 case OP_SETCAR: /* set-car! */
4243 if (!is_immutable (car (SCHEME_V->args))) 4140 if (!is_immutable (x))
4244 { 4141 {
4245 set_car (car (SCHEME_V->args), cadr (SCHEME_V->args)); 4142 set_car (x, cadr (args));
4246 s_return (car (SCHEME_V->args)); 4143 s_return (car (args));
4247 } 4144 }
4248 else 4145 else
4249 Error_0 ("set-car!: unable to alter immutable pair"); 4146 Error_0 ("set-car!: unable to alter immutable pair");
4250 4147
4251 case OP_SETCDR: /* set-cdr! */ 4148 case OP_SETCDR: /* set-cdr! */
4252 if (!is_immutable (car (SCHEME_V->args))) 4149 if (!is_immutable (x))
4253 { 4150 {
4254 set_cdr (car (SCHEME_V->args), cadr (SCHEME_V->args)); 4151 set_cdr (x, cadr (args));
4255 s_return (car (SCHEME_V->args)); 4152 s_return (car (args));
4256 } 4153 }
4257 else 4154 else
4258 Error_0 ("set-cdr!: unable to alter immutable pair"); 4155 Error_0 ("set-cdr!: unable to alter immutable pair");
4259 4156
4260 case OP_CHAR2INT: /* char->integer */ 4157 case OP_CHAR2INT: /* char->integer */
4261 s_return (mk_integer (SCHEME_A_ ivalue (car (SCHEME_V->args)))); 4158 s_return (mk_integer (SCHEME_A_ ivalue_unchecked (x)));
4262 4159
4263 case OP_INT2CHAR: /* integer->char */ 4160 case OP_INT2CHAR: /* integer->char */
4264 s_return (mk_character (SCHEME_A_ ivalue (car (SCHEME_V->args)))); 4161 s_return (mk_character (SCHEME_A_ ivalue_unchecked (x)));
4265 4162
4266 case OP_CHARUPCASE: 4163 case OP_CHARUPCASE:
4267 { 4164 {
4268 unsigned char c = ivalue (car (SCHEME_V->args)); 4165 unsigned char c = ivalue_unchecked (x);
4269 c = toupper (c); 4166 c = toupper (c);
4270 s_return (mk_character (SCHEME_A_ c)); 4167 s_return (mk_character (SCHEME_A_ c));
4271 } 4168 }
4272 4169
4273 case OP_CHARDNCASE: 4170 case OP_CHARDNCASE:
4274 { 4171 {
4275 unsigned char c = ivalue (car (SCHEME_V->args)); 4172 unsigned char c = ivalue_unchecked (x);
4276 c = tolower (c); 4173 c = tolower (c);
4277 s_return (mk_character (SCHEME_A_ c)); 4174 s_return (mk_character (SCHEME_A_ c));
4278 } 4175 }
4279 4176
4280 case OP_STR2SYM: /* string->symbol */ 4177 case OP_STR2SYM: /* string->symbol */
4281 s_return (mk_symbol (SCHEME_A_ strvalue (car (SCHEME_V->args)))); 4178 s_return (mk_symbol (SCHEME_A_ strvalue (x)));
4282 4179
4283 case OP_STR2ATOM: /* string->atom */ 4180 case OP_STR2ATOM: /* string->atom */
4284 { 4181 {
4285 char *s = strvalue (car (SCHEME_V->args)); 4182 char *s = strvalue (x);
4286 long pf = 0; 4183 long pf = 0;
4287 4184
4288 if (cdr (SCHEME_V->args) != NIL) 4185 if (cdr (args) != NIL)
4289 { 4186 {
4290 /* we know cadr(SCHEME_V->args) is a natural number */ 4187 /* we know cadr(args) is a natural number */
4291 /* see if it is 2, 8, 10, or 16, or error */ 4188 /* see if it is 2, 8, 10, or 16, or error */
4292 pf = ivalue_unchecked (cadr (SCHEME_V->args)); 4189 pf = ivalue_unchecked (cadr (args));
4293 4190
4294 if (pf == 16 || pf == 10 || pf == 8 || pf == 2) 4191 if (pf == 16 || pf == 10 || pf == 8 || pf == 2)
4295 { 4192 {
4296 /* base is OK */ 4193 /* base is OK */
4297 } 4194 }
4298 else 4195 else
4299 pf = -1; 4196 pf = -1;
4300 } 4197 }
4301 4198
4302 if (pf < 0) 4199 if (pf < 0)
4303 Error_1 ("string->atom: bad base:", cadr (SCHEME_V->args)); 4200 Error_1 ("string->atom: bad base:", cadr (args));
4304 else if (*s == '#') /* no use of base! */ 4201 else if (*s == '#') /* no use of base! */
4305 s_return (mk_sharp_const (SCHEME_A_ s + 1)); 4202 s_return (mk_sharp_const (SCHEME_A_ s + 1));
4306 else 4203 else
4307 { 4204 {
4308 if (pf == 0 || pf == 10) 4205 if (pf == 0 || pf == 10)
… …
4319 } 4216 }
4320 } 4217 }
4321 } 4218 }
4322 4219
4323 case OP_SYM2STR: /* symbol->string */ 4220 case OP_SYM2STR: /* symbol->string */
4324 x = mk_string (SCHEME_A_ symname (car (SCHEME_V->args))); 4221 x = mk_string (SCHEME_A_ symname (x));
4325 setimmutable (x); 4222 setimmutable (x);
4326 s_return (x); 4223 s_return (x);
4327 4224
4328 case OP_ATOM2STR: /* atom->string */ 4225 case OP_ATOM2STR: /* atom->string */
4329 { 4226 {
4330 long pf = 0; 4227 long pf = 0;
4331 4228
4332 x = car (SCHEME_V->args);
4333
4334 if (cdr (SCHEME_V->args) != NIL) 4229 if (cdr (args) != NIL)
4335 { 4230 {
4336 /* we know cadr(SCHEME_V->args) is a natural number */ 4231 /* we know cadr(args) is a natural number */
4337 /* see if it is 2, 8, 10, or 16, or error */ 4232 /* see if it is 2, 8, 10, or 16, or error */
4338 pf = ivalue_unchecked (cadr (SCHEME_V->args)); 4233 pf = ivalue_unchecked (cadr (args));
4339 4234
4340 if (is_number (x) && (pf == 16 || pf == 10 || pf == 8 || pf == 2)) 4235 if (is_number (x) && (pf == 16 || pf == 10 || pf == 8 || pf == 2))
4341 { 4236 {
4342 /* base is OK */ 4237 /* base is OK */
4343 } 4238 }
4344 else 4239 else
4345 pf = -1; 4240 pf = -1;
4346 } 4241 }
4347 4242
4348 if (pf < 0) 4243 if (pf < 0)
4349 Error_1 ("atom->string: bad base:", cadr (SCHEME_V->args)); 4244 Error_1 ("atom->string: bad base:", cadr (args));
4350 else if (is_number (x) || is_character (x) || is_string (x) || is_symbol (x)) 4245 else if (is_number (x) || is_character (x) || is_string (x) || is_symbol (x))
4351 { 4246 {
4352 char *p; 4247 char *p;
4353 int len; 4248 int len;
4354 4249
… …
4359 Error_1 ("atom->string: not an atom:", x); 4254 Error_1 ("atom->string: not an atom:", x);
4360 } 4255 }
4361 4256
4362 case OP_MKSTRING: /* make-string */ 4257 case OP_MKSTRING: /* make-string */
4363 { 4258 {
4364 int fill = ' '; 4259 int fill = cdr (args) != NIL ? charvalue (cadr (args)) : ' ';
4365 int len; 4260 int len = ivalue_unchecked (x);
4366 4261
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)); 4262 s_return (mk_empty_string (SCHEME_A_ len, fill));
4373 } 4263 }
4374 4264
4375 case OP_STRLEN: /* string-length */ 4265 case OP_STRLEN: /* string-length */
4376 s_return (mk_integer (SCHEME_A_ strlength (car (SCHEME_V->args)))); 4266 s_return (mk_integer (SCHEME_A_ strlength (x)));
4377 4267
4378 case OP_STRREF: /* string-ref */ 4268 case OP_STRREF: /* string-ref */
4379 { 4269 {
4380 char *str; 4270 char *str = strvalue (x);
4381 int index;
4382
4383 str = strvalue (car (SCHEME_V->args));
4384
4385 index = ivalue (cadr (SCHEME_V->args)); 4271 int index = ivalue_unchecked (cadr (args));
4386 4272
4387 if (index >= strlength (car (SCHEME_V->args))) 4273 if (index >= strlength (x))
4388 Error_1 ("string-ref: out of bounds:", cadr (SCHEME_V->args)); 4274 Error_1 ("string-ref: out of bounds:", cadr (args));
4389 4275
4390 s_return (mk_character (SCHEME_A_ ((unsigned char *) str)[index])); 4276 s_return (mk_character (SCHEME_A_ ((unsigned char *)str)[index]));
4391 } 4277 }
4392 4278
4393 case OP_STRSET: /* string-set! */ 4279 case OP_STRSET: /* string-set! */
4394 { 4280 {
4395 char *str; 4281 char *str = strvalue (x);
4396 int index; 4282 int index = ivalue_unchecked (cadr (args));
4397 int c; 4283 int c;
4398 4284
4399 if (is_immutable (car (SCHEME_V->args))) 4285 if (is_immutable (x))
4400 Error_1 ("string-set!: unable to alter immutable string:", car (SCHEME_V->args)); 4286 Error_1 ("string-set!: unable to alter immutable string:", x);
4401 4287
4402 str = strvalue (car (SCHEME_V->args));
4403
4404 index = ivalue (cadr (SCHEME_V->args));
4405
4406 if (index >= strlength (car (SCHEME_V->args))) 4288 if (index >= strlength (x))
4407 Error_1 ("string-set!: out of bounds:", cadr (SCHEME_V->args)); 4289 Error_1 ("string-set!: out of bounds:", cadr (args));
4408 4290
4409 c = charvalue (caddr (SCHEME_V->args)); 4291 c = charvalue (caddr (args));
4410 4292
4411 str[index] = (char) c; 4293 str[index] = c;
4412 s_return (car (SCHEME_V->args)); 4294 s_return (car (args));
4413 } 4295 }
4414 4296
4415 case OP_STRAPPEND: /* string-append */ 4297 case OP_STRAPPEND: /* string-append */
4416 { 4298 {
4417 /* in 1.29 string-append was in Scheme in init.scm but was too slow */ 4299 /* in 1.29 string-append was in Scheme in init.scm but was too slow */
4418 int len = 0; 4300 int len = 0;
4419 pointer newstr; 4301 pointer newstr;
4420 char *pos; 4302 char *pos;
4421 4303
4422 /* compute needed length for new string */ 4304 /* compute needed length for new string */
4423 for (x = SCHEME_V->args; x != NIL; x = cdr (x)) 4305 for (x = args; x != NIL; x = cdr (x))
4424 len += strlength (car (x)); 4306 len += strlength (car (x));
4425 4307
4426 newstr = mk_empty_string (SCHEME_A_ len, ' '); 4308 newstr = mk_empty_string (SCHEME_A_ len, ' ');
4427 4309
4428 /* store the contents of the argument strings into the new string */ 4310 /* 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)) 4311 for (pos = strvalue (newstr), x = args; x != NIL; pos += strlength (car (x)), x = cdr (x))
4430 memcpy (pos, strvalue (car (x)), strlength (car (x))); 4312 memcpy (pos, strvalue (car (x)), strlength (car (x)));
4431 4313
4432 s_return (newstr); 4314 s_return (newstr);
4433 } 4315 }
4434 4316
4435 case OP_SUBSTR: /* substring */ 4317 case OP_SUBSTR: /* substring */
4436 { 4318 {
4437 char *str; 4319 char *str = strvalue (x);
4438 int index0; 4320 int index0 = ivalue_unchecked (cadr (args));
4439 int index1; 4321 int index1;
4440 int len; 4322 int len;
4441 4323
4442 str = strvalue (car (SCHEME_V->args));
4443
4444 index0 = ivalue (cadr (SCHEME_V->args));
4445
4446 if (index0 > strlength (car (SCHEME_V->args))) 4324 if (index0 > strlength (x))
4447 Error_1 ("substring: start out of bounds:", cadr (SCHEME_V->args)); 4325 Error_1 ("substring: start out of bounds:", cadr (args));
4448 4326
4449 if (cddr (SCHEME_V->args) != NIL) 4327 if (cddr (args) != NIL)
4450 { 4328 {
4451 index1 = ivalue (caddr (SCHEME_V->args)); 4329 index1 = ivalue_unchecked (caddr (args));
4452 4330
4453 if (index1 > strlength (car (SCHEME_V->args)) || index1 < index0) 4331 if (index1 > strlength (x) || index1 < index0)
4454 Error_1 ("substring: end out of bounds:", caddr (SCHEME_V->args)); 4332 Error_1 ("substring: end out of bounds:", caddr (args));
4455 } 4333 }
4456 else 4334 else
4457 index1 = strlength (car (SCHEME_V->args)); 4335 index1 = strlength (x);
4458 4336
4459 len = index1 - index0; 4337 len = index1 - index0;
4460 x = mk_empty_string (SCHEME_A_ len, ' '); 4338 x = mk_empty_string (SCHEME_A_ len, ' ');
4461 memcpy (strvalue (x), str + index0, len); 4339 memcpy (strvalue (x), str + index0, len);
4462 strvalue (x)[len] = 0; 4340 strvalue (x)[len] = 0;
… …
4466 4344
4467 case OP_VECTOR: /* vector */ 4345 case OP_VECTOR: /* vector */
4468 { 4346 {
4469 int i; 4347 int i;
4470 pointer vec; 4348 pointer vec;
4471 int len = list_length (SCHEME_A_ SCHEME_V->args); 4349 int len = list_length (SCHEME_A_ args);
4472 4350
4473 if (len < 0) 4351 if (len < 0)
4474 Error_1 ("vector: not a proper list:", SCHEME_V->args); 4352 Error_1 ("vector: not a proper list:", args);
4475 4353
4476 vec = mk_vector (SCHEME_A_ len); 4354 vec = mk_vector (SCHEME_A_ len);
4477 4355
4478#if USE_ERROR_CHECKING 4356#if USE_ERROR_CHECKING
4479 if (SCHEME_V->no_memory) 4357 if (SCHEME_V->no_memory)
4480 s_return (S_SINK); 4358 s_return (S_SINK);
4481#endif 4359#endif
4482 4360
4483 for (x = SCHEME_V->args, i = 0; is_pair (x); x = cdr (x), i++) 4361 for (x = args, i = 0; is_pair (x); x = cdr (x), i++)
4484 set_vector_elem (vec, i, car (x)); 4362 vector_set (vec, i, car (x));
4485 4363
4486 s_return (vec); 4364 s_return (vec);
4487 } 4365 }
4488 4366
4489 case OP_MKVECTOR: /* make-vector */ 4367 case OP_MKVECTOR: /* make-vector */
4490 { 4368 {
4491 pointer fill = NIL; 4369 pointer fill = NIL;
4492 int len;
4493 pointer vec; 4370 pointer vec;
4371 int len = ivalue_unchecked (x);
4494 4372
4495 len = ivalue (car (SCHEME_V->args));
4496
4497 if (cdr (SCHEME_V->args) != NIL) 4373 if (cdr (args) != NIL)
4498 fill = cadr (SCHEME_V->args); 4374 fill = cadr (args);
4499 4375
4500 vec = mk_vector (SCHEME_A_ len); 4376 vec = mk_vector (SCHEME_A_ len);
4501 4377
4502#if USE_ERROR_CHECKING 4378#if USE_ERROR_CHECKING
4503 if (SCHEME_V->no_memory) 4379 if (SCHEME_V->no_memory)
4504 s_return (S_SINK); 4380 s_return (S_SINK);
4505#endif 4381#endif
4506 4382
4507 if (fill != NIL) 4383 if (fill != NIL)
4508 fill_vector (vec, fill); 4384 fill_vector (vec, 0, fill);
4509 4385
4510 s_return (vec); 4386 s_return (vec);
4511 } 4387 }
4512 4388
4513 case OP_VECLEN: /* vector-length */ 4389 case OP_VECLEN: /* vector-length */
4514 s_return (mk_integer (SCHEME_A_ veclength (car (SCHEME_V->args)))); 4390 s_return (mk_integer (SCHEME_A_ veclength (x)));
4391
4392 case OP_VECRESIZE:
4393 vector_resize (x, ivalue_unchecked (cadr (args)), caddr (args));
4394 s_return (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)
… …
5200 s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL); 4955 s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL);
5201 SCHEME_V->tok = token (SCHEME_A); 4956 SCHEME_V->tok = token (SCHEME_A);
5202 s_goto (OP_RDSEXPR); 4957 s_goto (OP_RDSEXPR);
5203 4958
5204 case TOK_ATOM: 4959 case TOK_ATOM:
5205 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))); 4960 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS)));
4961
4962 case TOK_DOTATOM:
4963 SCHEME_V->strbuff[0] = '.';
4964 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 1, DELIMITERS)));
4965
4966 case TOK_STRATOM:
4967 x = readstrexp (SCHEME_A_ '|');
4968 //TODO: haven't checked whether the garbage collector could interfere
4969 s_return (mk_atom (SCHEME_A_ strvalue (x)));
5206 4970
5207 case TOK_DQUOTE: 4971 case TOK_DQUOTE:
5208 x = readstrexp (SCHEME_A); 4972 x = readstrexp (SCHEME_A_ '"');
5209 4973
5210 if (x == S_F) 4974 if (x == S_F)
5211 Error_0 ("Error reading string"); 4975 Error_0 ("Error reading string");
5212 4976
5213 setimmutable (x); 4977 setimmutable (x);
… …
5225 s_goto (OP_EVAL); 4989 s_goto (OP_EVAL);
5226 } 4990 }
5227 } 4991 }
5228 4992
5229 case TOK_SHARP_CONST: 4993 case TOK_SHARP_CONST:
5230 if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))) == NIL) 4994 if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS))) == NIL)
5231 Error_0 ("undefined sharp expression"); 4995 Error_0 ("undefined sharp expression");
5232 else 4996 else
5233 s_return (x); 4997 s_return (x);
5234 4998
5235 default: 4999 default:
… …
5237 } 5001 }
5238 5002
5239 break; 5003 break;
5240 5004
5241 case OP_RDLIST: 5005 case OP_RDLIST:
5242 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 5006 SCHEME_V->args = cons (SCHEME_V->value, args);
5243 SCHEME_V->tok = token (SCHEME_A); 5007 SCHEME_V->tok = token (SCHEME_A);
5244 5008
5245 switch (SCHEME_V->tok) 5009 switch (SCHEME_V->tok)
5246 { 5010 {
5247 case TOK_EOF: 5011 case TOK_EOF:
… …
5275 case OP_RDDOT: 5039 case OP_RDDOT:
5276 if (token (SCHEME_A) != TOK_RPAREN) 5040 if (token (SCHEME_A) != TOK_RPAREN)
5277 Error_0 ("syntax error: illegal dot expression"); 5041 Error_0 ("syntax error: illegal dot expression");
5278 5042
5279 SCHEME_V->nesting_stack[SCHEME_V->file_i]--; 5043 SCHEME_V->nesting_stack[SCHEME_V->file_i]--;
5280 s_return (reverse_in_place (SCHEME_A_ SCHEME_V->value, SCHEME_V->args)); 5044 s_return (reverse_in_place (SCHEME_A_ SCHEME_V->value, args));
5281 5045
5282 case OP_RDQUOTE: 5046 case OP_RDQUOTE:
5283 s_return (cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL))); 5047 s_return (cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL)));
5284 5048
5285 case OP_RDQQUOTE: 5049 case OP_RDQQUOTE:
… …
5307 SCHEME_V->args = SCHEME_V->value; 5071 SCHEME_V->args = SCHEME_V->value;
5308 s_goto (OP_VECTOR); 5072 s_goto (OP_VECTOR);
5309 5073
5310 /* ========== printing part ========== */ 5074 /* ========== printing part ========== */
5311 case OP_P0LIST: 5075 case OP_P0LIST:
5312 if (is_vector (SCHEME_V->args)) 5076 if (is_vector (args))
5313 { 5077 {
5314 putstr (SCHEME_A_ "#("); 5078 putstr (SCHEME_A_ "#(");
5315 SCHEME_V->args = cons (SCHEME_V->args, mk_integer (SCHEME_A_ 0)); 5079 SCHEME_V->args = cons (args, mk_integer (SCHEME_A_ 0));
5316 s_goto (OP_PVECFROM); 5080 s_goto (OP_PVECFROM);
5317 } 5081 }
5318 else if (is_environment (SCHEME_V->args)) 5082 else if (is_environment (args))
5319 { 5083 {
5320 putstr (SCHEME_A_ "#<ENVIRONMENT>"); 5084 putstr (SCHEME_A_ "#<ENVIRONMENT>");
5321 s_return (S_T); 5085 s_return (S_T);
5322 } 5086 }
5323 else if (!is_pair (SCHEME_V->args)) 5087 else if (!is_pair (args))
5324 { 5088 {
5325 printatom (SCHEME_A_ SCHEME_V->args, SCHEME_V->print_flag); 5089 printatom (SCHEME_A_ args, SCHEME_V->print_flag);
5326 s_return (S_T); 5090 s_return (S_T);
5327 } 5091 }
5328 else if (car (SCHEME_V->args) == SCHEME_V->QUOTE && ok_abbrev (cdr (SCHEME_V->args))) 5092 else
5329 { 5093 {
5094 pointer a = car (args);
5095 pointer b = cdr (args);
5096 int ok_abbr = ok_abbrev (b);
5097 SCHEME_V->args = car (b);
5098
5099 if (a == SCHEME_V->QUOTE && ok_abbr)
5330 putstr (SCHEME_A_ "'"); 5100 putstr (SCHEME_A_ "'");
5331 SCHEME_V->args = cadr (SCHEME_V->args); 5101 else if (a == SCHEME_V->QQUOTE && ok_abbr)
5102 putstr (SCHEME_A_ "`");
5103 else if (a == SCHEME_V->UNQUOTE && ok_abbr)
5104 putstr (SCHEME_A_ ",");
5105 else if (a == SCHEME_V->UNQUOTESP && ok_abbr)
5106 putstr (SCHEME_A_ ",@");
5107 else
5108 {
5109 putstr (SCHEME_A_ "(");
5110 s_save (SCHEME_A_ OP_P1LIST, b, NIL);
5111 SCHEME_V->args = a;
5112 }
5113
5332 s_goto (OP_P0LIST); 5114 s_goto (OP_P0LIST);
5333 } 5115 }
5334 else if (car (SCHEME_V->args) == SCHEME_V->QQUOTE && ok_abbrev (cdr (SCHEME_V->args))) 5116
5117 case OP_P1LIST:
5118 if (is_pair (args))
5335 { 5119 {
5120 s_save (SCHEME_A_ OP_P1LIST, cdr (args), NIL);
5336 putstr (SCHEME_A_ "`"); 5121 putstr (SCHEME_A_ " ");
5337 SCHEME_V->args = cadr (SCHEME_V->args); 5122 SCHEME_V->args = car (args);
5338 s_goto (OP_P0LIST); 5123 s_goto (OP_P0LIST);
5339 } 5124 }
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)) 5125 else if (is_vector (args))
5369 { 5126 {
5370 s_save (SCHEME_A_ OP_P1LIST, NIL, NIL); 5127 s_save (SCHEME_A_ OP_P1LIST, NIL, NIL);
5371 putstr (SCHEME_A_ " . "); 5128 putstr (SCHEME_A_ " . ");
5372 s_goto (OP_P0LIST); 5129 s_goto (OP_P0LIST);
5373 } 5130 }
5374 else 5131 else
5375 { 5132 {
5376 if (SCHEME_V->args != NIL) 5133 if (args != NIL)
5377 { 5134 {
5378 putstr (SCHEME_A_ " . "); 5135 putstr (SCHEME_A_ " . ");
5379 printatom (SCHEME_A_ SCHEME_V->args, SCHEME_V->print_flag); 5136 printatom (SCHEME_A_ args, SCHEME_V->print_flag);
5380 } 5137 }
5381 5138
5382 putstr (SCHEME_A_ ")"); 5139 putstr (SCHEME_A_ ")");
5383 s_return (S_T); 5140 s_return (S_T);
5384 } 5141 }
5385 5142
5386 case OP_PVECFROM: 5143 case OP_PVECFROM:
5387 { 5144 {
5388 int i = ivalue_unchecked (cdr (SCHEME_V->args)); 5145 int i = ivalue_unchecked (cdr (args));
5389 pointer vec = car (SCHEME_V->args); 5146 pointer vec = car (args);
5390 int len = veclength (vec); 5147 int len = veclength (vec);
5391 5148
5392 if (i == len) 5149 if (i == len)
5393 { 5150 {
5394 putstr (SCHEME_A_ ")"); 5151 putstr (SCHEME_A_ ")");
5395 s_return (S_T); 5152 s_return (S_T);
5396 } 5153 }
5397 else 5154 else
5398 { 5155 {
5399 pointer elem = vector_elem (vec, i); 5156 pointer elem = vector_get (vec, i);
5400 5157
5401 ivalue_unchecked (cdr (SCHEME_V->args)) = i + 1; 5158 ivalue_unchecked (cdr (args)) = i + 1;
5402 s_save (SCHEME_A_ OP_PVECFROM, SCHEME_V->args, NIL); 5159 s_save (SCHEME_A_ OP_PVECFROM, args, NIL);
5403 SCHEME_V->args = elem; 5160 SCHEME_V->args = elem;
5404 5161
5405 if (i > 0) 5162 if (i > 0)
5406 putstr (SCHEME_A_ " "); 5163 putstr (SCHEME_A_ " ");
5407 5164
5408 s_goto (OP_P0LIST); 5165 s_goto (OP_P0LIST);
5409 } 5166 }
5410 } 5167 }
5411 } 5168 }
5412 5169
5413 return S_T; 5170 if (USE_ERROR_CHECKING) abort ();
5414} 5171}
5415 5172
5416static pointer 5173static int
5417opexe_6 (SCHEME_P_ enum scheme_opcodes op) 5174opexe_6 (SCHEME_P_ enum scheme_opcodes op)
5418{ 5175{
5176 pointer args = SCHEME_V->args;
5177 pointer a = car (args);
5419 pointer x, y; 5178 pointer x, y;
5420 5179
5421 switch (op) 5180 switch (op)
5422 { 5181 {
5423 case OP_LIST_LENGTH: /* length *//* a.k */ 5182 case OP_LIST_LENGTH: /* length *//* a.k */
5424 { 5183 {
5425 long v = list_length (SCHEME_A_ car (SCHEME_V->args)); 5184 long v = list_length (SCHEME_A_ a);
5426 5185
5427 if (v < 0) 5186 if (v < 0)
5428 Error_1 ("length: not a list:", car (SCHEME_V->args)); 5187 Error_1 ("length: not a list:", a);
5429 5188
5430 s_return (mk_integer (SCHEME_A_ v)); 5189 s_return (mk_integer (SCHEME_A_ v));
5431 } 5190 }
5432 5191
5433 case OP_ASSQ: /* assq *//* a.k */ 5192 case OP_ASSQ: /* assq *//* a.k */
5434 x = car (SCHEME_V->args); 5193 x = a;
5435 5194
5436 for (y = cadr (SCHEME_V->args); is_pair (y); y = cdr (y)) 5195 for (y = cadr (args); is_pair (y); y = cdr (y))
5437 { 5196 {
5438 if (!is_pair (car (y))) 5197 if (!is_pair (car (y)))
5439 Error_0 ("unable to handle non pair element"); 5198 Error_0 ("unable to handle non pair element");
5440 5199
5441 if (x == caar (y)) 5200 if (x == caar (y))
… …
5447 else 5206 else
5448 s_return (S_F); 5207 s_return (S_F);
5449 5208
5450 5209
5451 case OP_GET_CLOSURE: /* get-closure-code *//* a.k */ 5210 case OP_GET_CLOSURE: /* get-closure-code *//* a.k */
5452 SCHEME_V->args = car (SCHEME_V->args); 5211 SCHEME_V->args = a;
5453 5212
5454 if (SCHEME_V->args == NIL) 5213 if (SCHEME_V->args == NIL)
5455 s_return (S_F); 5214 s_return (S_F);
5456 else if (is_closure (SCHEME_V->args)) 5215 else if (is_closure (SCHEME_V->args))
5457 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value))); 5216 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value)));
… …
5463 case OP_CLOSUREP: /* closure? */ 5222 case OP_CLOSUREP: /* closure? */
5464 /* 5223 /*
5465 * Note, macro object is also a closure. 5224 * Note, macro object is also a closure.
5466 * Therefore, (closure? <#MACRO>) ==> #t 5225 * Therefore, (closure? <#MACRO>) ==> #t
5467 */ 5226 */
5468 s_retbool (is_closure (car (SCHEME_V->args))); 5227 s_retbool (is_closure (a));
5469 5228
5470 case OP_MACROP: /* macro? */ 5229 case OP_MACROP: /* macro? */
5471 s_retbool (is_macro (car (SCHEME_V->args))); 5230 s_retbool (is_macro (a));
5472 } 5231 }
5473 5232
5474 return S_T; /* NOTREACHED */ 5233 if (USE_ERROR_CHECKING) abort ();
5475} 5234}
5476 5235
5236/* 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); 5237typedef int (*dispatch_func)(SCHEME_P_ enum scheme_opcodes);
5478 5238
5479typedef int (*test_predicate) (pointer); 5239typedef int (*test_predicate)(pointer);
5480static int 5240static int
5481is_any (pointer p) 5241tst_any (pointer p)
5482{ 5242{
5483 return 1; 5243 return 1;
5484} 5244}
5485 5245
5486static int 5246static int
5487is_nonneg (pointer p) 5247tst_inonneg (pointer p)
5488{ 5248{
5489 return ivalue (p) >= 0 && is_integer (p); 5249 return is_integer (p) && ivalue_unchecked (p) >= 0;
5250}
5251
5252static int
5253tst_is_list (SCHEME_P_ pointer p)
5254{
5255 return p == NIL || is_pair (p);
5490} 5256}
5491 5257
5492/* Correspond carefully with following defines! */ 5258/* Correspond carefully with following defines! */
5493static struct 5259static struct
5494{ 5260{
5495 test_predicate fct; 5261 test_predicate fct;
5496 const char *kind; 5262 const char *kind;
5497} tests[] = 5263} tests[] = {
5498{ 5264 { tst_any , 0 },
5499 { 0, 0}, /* unused */ 5265 { is_string , "string" },
5500 { is_any, 0}, 5266 { is_symbol , "symbol" },
5501 { is_string, "string" }, 5267 { is_port , "port" },
5502 { is_symbol, "symbol" },
5503 { is_port, "port" },
5504 { is_inport, "input port" }, 5268 { is_inport , "input port" },
5505 { is_outport, "output port" }, 5269 { is_outport , "output port" },
5506 { is_environment, "environment" }, 5270 { is_environment, "environment" },
5507 { is_pair, "pair" }, 5271 { is_pair , "pair" },
5508 { 0, "pair or '()" }, 5272 { 0 , "pair or '()" },
5509 { is_character, "character" }, 5273 { is_character , "character" },
5510 { is_vector, "vector" }, 5274 { is_vector , "vector" },
5511 { is_number, "number" }, 5275 { is_number , "number" },
5512 { is_integer, "integer" }, 5276 { is_integer , "integer" },
5513 { is_nonneg, "non-negative integer" } 5277 { tst_inonneg , "non-negative integer" }
5514}; 5278};
5515 5279
5516#define TST_NONE 0 5280#define TST_NONE 0 /* TST_NONE used for built-ins, 0 for internal ops */
5517#define TST_ANY "\001" 5281#define TST_ANY "\001"
5518#define TST_STRING "\002" 5282#define TST_STRING "\002"
5519#define TST_SYMBOL "\003" 5283#define TST_SYMBOL "\003"
5520#define TST_PORT "\004" 5284#define TST_PORT "\004"
5521#define TST_INPORT "\005" 5285#define TST_INPORT "\005"
5522#define TST_OUTPORT "\006" 5286#define TST_OUTPORT "\006"
5523#define TST_ENVIRONMENT "\007" 5287#define TST_ENVIRONMENT "\007"
5524#define TST_PAIR "\010" 5288#define TST_PAIR "\010"
5525#define TST_LIST "\011" 5289#define TST_LIST "\011"
5526#define TST_CHAR "\012" 5290#define TST_CHAR "\012"
5527#define TST_VECTOR "\013" 5291#define TST_VECTOR "\013"
5528#define TST_NUMBER "\014" 5292#define TST_NUMBER "\014"
5529#define TST_INTEGER "\015" 5293#define TST_INTEGER "\015"
5530#define TST_NATURAL "\016" 5294#define TST_NATURAL "\016"
5295
5296#define INF_ARG 0xff
5297#define UNNAMED_OP ""
5298
5299static const char opnames[] =
5300#define OP_DEF(func,name,minarity,maxarity,argtest,op) name "\x00"
5301#include "opdefines.h"
5302#undef OP_DEF
5303;
5304
5305static const char *
5306opname (int idx)
5307{
5308 const char *name = opnames;
5309
5310 /* should do this at compile time, but would require external program, right? */
5311 while (idx--)
5312 name += strlen (name) + 1;
5313
5314 return *name ? name : "ILLEGAL";
5315}
5316
5317static const char *
5318procname (pointer x)
5319{
5320 return opname (procnum (x));
5321}
5531 5322
5532typedef struct 5323typedef struct
5533{ 5324{
5534 dispatch_func func; 5325 uint8_t func;
5535 char *name; 5326 /*dispatch_func func;*//*TODO: maybe optionally keep the pointer, for speed? */
5327 uint8_t builtin;
5328#if USE_ERROR_CHECKING
5536 int min_arity; 5329 uint8_t min_arity;
5537 int max_arity; 5330 uint8_t max_arity;
5538 char *arg_tests_encoding; 5331 char arg_tests_encoding[3];
5332#endif
5539} op_code_info; 5333} op_code_info;
5540 5334
5541#define INF_ARG 0xffff
5542
5543static op_code_info dispatch_table[] = { 5335static const op_code_info dispatch_table[] = {
5544#define OP_DEF(A,B,C,D,E,OP) {A,B,C,D,E}, 5336#if USE_ERROR_CHECKING
5337#define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1, minarity, maxarity, argtest },
5338#else
5339#define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1 },
5340#endif
5545#include "opdefines.h" 5341#include "opdefines.h"
5342#undef OP_DEF
5546 {0} 5343 {0}
5547}; 5344};
5548 5345
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 */ 5346/* kernel of this interpreter */
5562static void 5347static void ecb_hot
5563Eval_Cycle (SCHEME_P_ enum scheme_opcodes op) 5348Eval_Cycle (SCHEME_P_ enum scheme_opcodes op)
5564{ 5349{
5565 SCHEME_V->op = op; 5350 SCHEME_V->op = op;
5566 5351
5567 for (;;) 5352 for (;;)
5568 { 5353 {
5569 op_code_info *pcd = dispatch_table + SCHEME_V->op; 5354 const op_code_info *pcd = dispatch_table + SCHEME_V->op;
5570 5355
5571#if USE_ERROR_CHECKING 5356#if USE_ERROR_CHECKING
5572 if (pcd->name) /* if built-in function, check arguments */ 5357 if (pcd->builtin) /* if built-in function, check arguments */
5573 { 5358 {
5574 int ok = 1;
5575 char msg[STRBUFFSIZE]; 5359 char msg[STRBUFFSIZE];
5576 int n = list_length (SCHEME_A_ SCHEME_V->args); 5360 int n = list_length (SCHEME_A_ SCHEME_V->args);
5577 5361
5578 /* Check number of arguments */ 5362 /* Check number of arguments */
5579 if (n < pcd->min_arity) 5363 if (ecb_expect_false (n < pcd->min_arity))
5580 { 5364 {
5581 ok = 0;
5582 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", 5365 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)",
5583 pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity); 5366 opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity);
5367 xError_1 (SCHEME_A_ msg, 0);
5368 continue;
5584 } 5369 }
5585 5370 else if (ecb_expect_false (n > pcd->max_arity && pcd->max_arity != INF_ARG))
5586 if (ok && n > pcd->max_arity)
5587 { 5371 {
5588 ok = 0;
5589 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", 5372 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)",
5590 pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity); 5373 opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity);
5374 xError_1 (SCHEME_A_ msg, 0);
5375 continue;
5591 } 5376 }
5592 5377 else
5593 if (ok)
5594 { 5378 {
5595 if (pcd->arg_tests_encoding) 5379 if (*pcd->arg_tests_encoding) /* literal 0 and TST_NONE treated the same */
5596 { 5380 {
5597 int i = 0; 5381 int i = 0;
5598 int j; 5382 int j;
5599 const char *t = pcd->arg_tests_encoding; 5383 const char *t = pcd->arg_tests_encoding;
5600 pointer arglist = SCHEME_V->args; 5384 pointer arglist = SCHEME_V->args;
5601 5385
5602 do 5386 do
5603 { 5387 {
5604 pointer arg = car (arglist); 5388 pointer arg = car (arglist);
5605 5389
5606 j = (int) t[0]; 5390 j = t[0];
5607 5391
5392 /*TODO: tst_is_list has different prototype - fix if other tests acquire same prototype */
5608 if (j == TST_LIST[0]) 5393 if (j == TST_LIST[0])
5609 { 5394 {
5610 if (arg != NIL && !is_pair (arg)) 5395 if (!tst_is_list (SCHEME_A_ arg))
5611 break; 5396 break;
5612 } 5397 }
5613 else 5398 else
5614 { 5399 {
5615 if (!tests[j].fct (arg)) 5400 if (!tests[j - 1].fct (arg))
5616 break; 5401 break;
5617 } 5402 }
5618 5403
5619 if (t[1] != 0) /* last test is replicated as necessary */ 5404 if (t < pcd->arg_tests_encoding + sizeof (pcd->arg_tests_encoding) - 1 && t[1]) /* last test is replicated as necessary */
5620 t++; 5405 t++;
5621 5406
5622 arglist = cdr (arglist); 5407 arglist = cdr (arglist);
5623 i++; 5408 i++;
5624 } 5409 }
5625 while (i < n); 5410 while (i < n);
5626 5411
5627 if (i < n) 5412 if (i < n)
5628 { 5413 {
5629 ok = 0;
5630 snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", pcd->name, i + 1, tests[j].kind); 5414 snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", opname (SCHEME_V->op), i + 1, tests[j].kind);
5415 xError_1 (SCHEME_A_ msg, 0);
5416 continue;
5631 } 5417 }
5632 } 5418 }
5633 } 5419 }
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 } 5420 }
5643#endif 5421#endif
5644 5422
5645 ok_to_freely_gc (SCHEME_A); 5423 ok_to_freely_gc (SCHEME_A);
5646 5424
5647 if (pcd->func (SCHEME_A_ SCHEME_V->op) == NIL) 5425 static const dispatch_func dispatch_funcs[] = {
5426 opexe_0,
5427 opexe_1,
5428 opexe_2,
5429 opexe_3,
5430 opexe_4,
5431 opexe_5,
5432 opexe_6,
5433 };
5434
5435 if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0))
5648 return; 5436 return;
5649 5437
5650 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 5438 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
5651 { 5439 {
5652 xwrstr ("No memory!\n"); 5440 xwrstr ("No memory!\n");
… …
5676mk_proc (SCHEME_P_ enum scheme_opcodes op) 5464mk_proc (SCHEME_P_ enum scheme_opcodes op)
5677{ 5465{
5678 pointer y = get_cell (SCHEME_A_ NIL, NIL); 5466 pointer y = get_cell (SCHEME_A_ NIL, NIL);
5679 set_typeflag (y, (T_PROC | T_ATOM)); 5467 set_typeflag (y, (T_PROC | T_ATOM));
5680 ivalue_unchecked (y) = op; 5468 ivalue_unchecked (y) = op;
5681 set_num_integer (y);
5682 return y; 5469 return y;
5683} 5470}
5684 5471
5685/* Hard-coded for the given keywords. Remember to rewrite if more are added! */ 5472/* Hard-coded for the given keywords. Remember to rewrite if more are added! */
5686static int 5473static int
… …
5710 5497
5711 case 'd': 5498 case 'd':
5712 return OP_COND0; /* cond */ 5499 return OP_COND0; /* cond */
5713 5500
5714 case '*': 5501 case '*':
5715 return OP_LET0AST; /* let* */ 5502 return OP_LET0AST;/* let* */
5716 5503
5717 default: 5504 default:
5718 return OP_SET0; /* set! */ 5505 return OP_SET0; /* set! */
5719 } 5506 }
5720 5507
… …
5742 5529
5743 case 'f': 5530 case 'f':
5744 return OP_DEF0; /* define */ 5531 return OP_DEF0; /* define */
5745 5532
5746 default: 5533 default:
5747 return OP_LET0REC; /* letrec */ 5534 return OP_LET0REC;/* letrec */
5748 } 5535 }
5749 5536
5750 default: 5537 default:
5751 return OP_C0STREAM; /* cons-stream */ 5538 return OP_C0STREAM; /* cons-stream */
5752 } 5539 }
5753} 5540}
5754 5541
5755#if USE_MULTIPLICITY 5542#if USE_MULTIPLICITY
5756scheme * 5543ecb_cold scheme *
5757scheme_init_new () 5544scheme_init_new ()
5758{ 5545{
5759 scheme *sc = malloc (sizeof (scheme)); 5546 scheme *sc = malloc (sizeof (scheme));
5760 5547
5761 if (!scheme_init (SCHEME_A)) 5548 if (!scheme_init (SCHEME_A))
… …
5766 else 5553 else
5767 return sc; 5554 return sc;
5768} 5555}
5769#endif 5556#endif
5770 5557
5771int 5558ecb_cold int
5772scheme_init (SCHEME_P) 5559scheme_init (SCHEME_P)
5773{ 5560{
5774 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]); 5561 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]);
5775 pointer x; 5562 pointer x;
5776 5563
… …
5849 5636
5850 for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i) 5637 for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i)
5851 assign_syntax (SCHEME_A_ syntax_names[i]); 5638 assign_syntax (SCHEME_A_ syntax_names[i]);
5852 } 5639 }
5853 5640
5641 // TODO: should iterate via strlen, to avoid n² complexity
5854 for (i = 0; i < n; i++) 5642 for (i = 0; i < n; i++)
5855 if (dispatch_table[i].name != 0) 5643 if (dispatch_table[i].builtin)
5856 assign_proc (SCHEME_A_ i, dispatch_table[i].name); 5644 assign_proc (SCHEME_A_ i, opname (i));
5857 5645
5858 /* initialization of global pointers to special symbols */ 5646 /* initialization of global pointers to special symbols */
5859 SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda"); 5647 SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda");
5860 SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote"); 5648 SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote");
5861 SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote"); 5649 SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote");
… …
5900scheme_set_external_data (SCHEME_P_ void *p) 5688scheme_set_external_data (SCHEME_P_ void *p)
5901{ 5689{
5902 SCHEME_V->ext_data = p; 5690 SCHEME_V->ext_data = p;
5903} 5691}
5904 5692
5905void 5693ecb_cold void
5906scheme_deinit (SCHEME_P) 5694scheme_deinit (SCHEME_P)
5907{ 5695{
5908 int i; 5696 int i;
5909 5697
5910#if SHOW_ERROR_LINE 5698#if SHOW_ERROR_LINE
… …
6002{ 5790{
6003 dump_stack_reset (SCHEME_A); 5791 dump_stack_reset (SCHEME_A);
6004 SCHEME_V->envir = SCHEME_V->global_env; 5792 SCHEME_V->envir = SCHEME_V->global_env;
6005 SCHEME_V->file_i = 0; 5793 SCHEME_V->file_i = 0;
6006 SCHEME_V->load_stack[0].kind = port_input | port_string; 5794 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 */ 5795 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); 5796 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; 5797 SCHEME_V->load_stack[0].rep.string.curr = (char *)cmd;
6010#if USE_PORTS 5798#if USE_PORTS
6011 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack); 5799 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack);
6012#endif 5800#endif
6013 SCHEME_V->retcode = 0; 5801 SCHEME_V->retcode = 0;
6014 SCHEME_V->interactive_repl = 0; 5802 SCHEME_V->interactive_repl = 0;

Diff Legend

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