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.48 by root, Mon Nov 30 13:07:34 2015 UTC

… …
16 * (MINISCM) This is a revised and modified version by Akira KIDA. 16 * (MINISCM) This is a revised and modified version by Akira KIDA.
17 * (MINISCM) current version is 0.85k4 (15 May 1994) 17 * (MINISCM) current version is 0.85k4 (15 May 1994)
18 * 18 *
19 */ 19 */
20 20
21#define EXPERIMENT 1
22
21#define PAGE_SIZE 4096 /* does not work on sparc/alpha */ 23#define PAGE_SIZE 4096 /* does not work on sparc/alpha */
22#include "malloc.c" 24#include "malloc.c"
23 25
24#define SCHEME_SOURCE 26#define SCHEME_SOURCE
25#include "scheme-private.h" 27#include "scheme-private.h"
… …
28#endif 30#endif
29#if USE_MATH 31#if USE_MATH
30# include <math.h> 32# include <math.h>
31#endif 33#endif
32 34
35#include "ecb.h"
36
33#include <sys/types.h> 37#include <sys/types.h>
34#include <sys/stat.h> 38#include <sys/stat.h>
35#include <fcntl.h> 39#include <fcntl.h>
36 40
41#if !USE_ERROR_CHECKING
42# define NDEBUG
43#endif
44
45#include <assert.h>
46#include <stdlib.h>
37#include <string.h> 47#include <string.h>
38#include <stdlib.h>
39 48
40#include <limits.h> 49#include <limits.h>
41#include <inttypes.h> 50#include <inttypes.h>
42#include <float.h> 51#include <float.h>
43//#include <ctype.h> 52//#include <ctype.h>
53
54#if '1' != '0' + 1 \
55 || '2' != '0' + 2 || '3' != '0' + 3 || '4' != '0' + 4 || '5' != '0' + 5 \
56 || '6' != '0' + 6 || '7' != '0' + 7 || '8' != '0' + 8 || '9' != '0' + 9 \
57 || 'b' != 'a' + 1 || 'c' != 'a' + 2 || 'd' != 'a' + 3 || 'e' != 'a' + 4 \
58 || 'f' != 'a' + 5
59# error "execution character set digits not consecutive"
60#endif
44 61
45enum { 62enum {
46 TOK_EOF, 63 TOK_EOF,
47 TOK_LPAREN, 64 TOK_LPAREN,
48 TOK_RPAREN, 65 TOK_RPAREN,
49 TOK_DOT, 66 TOK_DOT,
50 TOK_ATOM, 67 TOK_ATOM,
68 TOK_DOTATOM, /* atom name starting with '.' */
69 TOK_STRATOM, /* atom name enclosed in | */
51 TOK_QUOTE, 70 TOK_QUOTE,
52 TOK_DQUOTE, 71 TOK_DQUOTE,
53 TOK_BQUOTE, 72 TOK_BQUOTE,
54 TOK_COMMA, 73 TOK_COMMA,
55 TOK_ATMARK, 74 TOK_ATMARK,
… …
57 TOK_SHARP_CONST, 76 TOK_SHARP_CONST,
58 TOK_VEC 77 TOK_VEC
59}; 78};
60 79
61#define BACKQUOTE '`' 80#define BACKQUOTE '`'
62#define DELIMITERS "()\";\f\t\v\n\r " 81#define WHITESPACE " \t\r\n\v\f"
82#define DELIMITERS "()\";" WHITESPACE
63 83
64#define NIL (&SCHEME_V->xNIL) //TODO: make this 0? 84#define NIL (&SCHEME_V->xNIL) //TODO: make this 0?
65#define S_T (&SCHEME_V->xT) //TODO: magic ptr value? 85#define S_T (&SCHEME_V->xT) //TODO: magic ptr value?
66#define S_F (&SCHEME_V->xF) //TODO: magic ptr value? 86#define S_F (&SCHEME_V->xF) //TODO: magic ptr value?
67#define S_SINK (&SCHEME_V->xsink) 87#define S_SINK (&SCHEME_V->xsink)
… …
143 163
144#define toupper(c) xtoupper (c) 164#define toupper(c) xtoupper (c)
145#define tolower(c) xtolower (c) 165#define tolower(c) xtolower (c)
146#define isdigit(c) xisdigit (c) 166#define isdigit(c) xisdigit (c)
147 167
148#if USE_STRLWR 168#if USE_IGNORECASE
149static const char * 169static const char *
150strlwr (char *s) 170xstrlwr (char *s)
151{ 171{
152 const char *p = s; 172 const char *p = s;
153 173
154 while (*s) 174 while (*s)
155 { 175 {
… …
157 s++; 177 s++;
158 } 178 }
159 179
160 return p; 180 return p;
161} 181}
162#endif
163 182
183#define stricmp(a,b) strcasecmp (a, b)
184#define strlwr(s) xstrlwr (s)
185
186#else
164#define stricmp(a,b) strcmp (a, b) 187# define stricmp(a,b) strcmp (a, b)
165#define strlwr(s) (s) 188# define strlwr(s) (s)
189#endif
166 190
167#ifndef prompt 191#ifndef prompt
168# define prompt "ts> " 192# define prompt "ts> "
169#endif 193#endif
170 194
… …
176# define FIRST_CELLSEGS 3 200# define FIRST_CELLSEGS 3
177#endif 201#endif
178 202
179enum scheme_types 203enum scheme_types
180{ 204{
205 T_INTEGER,
181 T_FREE, 206 T_REAL,
182 T_STRING, 207 T_STRING,
183 T_NUMBER,
184 T_SYMBOL, 208 T_SYMBOL,
185 T_PROC, 209 T_PROC,
186 T_PAIR, 210 T_PAIR, /* also used for free cells */
187 T_CLOSURE, 211 T_CLOSURE,
188 T_CONTINUATION, 212 T_CONTINUATION,
189 T_FOREIGN, 213 T_FOREIGN,
190 T_CHARACTER, 214 T_CHARACTER,
191 T_PORT, 215 T_PORT,
… …
201#define T_SYNTAX 0x0010 225#define T_SYNTAX 0x0010
202#define T_IMMUTABLE 0x0020 226#define T_IMMUTABLE 0x0020
203#define T_ATOM 0x0040 /* only for gc */ 227#define T_ATOM 0x0040 /* only for gc */
204#define T_MARK 0x0080 /* only for gc */ 228#define T_MARK 0x0080 /* only for gc */
205 229
206static num num_add (num a, num b); 230/* num, for generic arithmetic */
207static num num_mul (num a, num b); 231struct num
208static num num_div (num a, num b); 232{
233 IVALUE ivalue;
234#if USE_REAL
235 RVALUE rvalue;
236 char is_fixnum;
237#endif
238};
239
240#if USE_REAL
241# define num_is_fixnum(n) (n).is_fixnum
242# define num_set_fixnum(n,f) (n).is_fixnum = (f)
243# define num_ivalue(n) (n).ivalue
244# define num_rvalue(n) (n).rvalue
245# define num_set_ivalue(n,i) (n).rvalue = (n).ivalue = (i)
246# define num_set_rvalue(n,r) (n).rvalue = (r)
247#else
248# define num_is_fixnum(n) 1
249# define num_set_fixnum(n,f) 0
250# define num_ivalue(n) (n).ivalue
251# define num_rvalue(n) (n).ivalue
252# define num_set_ivalue(n,i) (n).ivalue = (i)
253# define num_set_rvalue(n,r) (n).ivalue = (r)
254#endif
255
256enum num_op { NUM_ADD, NUM_SUB, NUM_MUL, NUM_INTDIV };
257
258static num num_op (enum num_op op, num a, num b);
209static num num_intdiv (num a, num b); 259static num num_intdiv (num a, num b);
210static num num_sub (num a, num b);
211static num num_rem (num a, num b); 260static num num_rem (num a, num b);
212static num num_mod (num a, num b); 261static 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 262
219#if USE_MATH 263#if USE_MATH
220static double round_per_R5RS (double x); 264static double round_per_R5RS (double x);
221#endif 265#endif
222static int is_zero_rvalue (RVALUE x); 266static 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 267
230static num num_zero; 268static num num_zero;
231static num num_one; 269static num num_one;
232 270
233/* macros for cell operations */ 271/* macros for cell operations */
234#define typeflag(p) ((p)->flag + 0) 272#define typeflag(p) ((p)->flag + 0)
235#define set_typeflag(p,v) ((p)->flag = (v)) 273#define set_typeflag(p,v) ((p)->flag = (v))
236#define type(p) (typeflag (p) & T_MASKTYPE) 274#define type(p) (typeflag (p) & T_MASKTYPE)
237 275
238INTERFACE INLINE int 276INTERFACE int
239is_string (pointer p) 277is_string (pointer p)
240{ 278{
241 return type (p) == T_STRING; 279 return type (p) == T_STRING;
242} 280}
243 281
244#define strvalue(p) ((p)->object.string.svalue) 282#define strvalue(p) ((p)->object.string.svalue)
245#define strlength(p) ((p)->object.string.length) 283#define strlength(p) ((p)->object.string.length)
246 284
247INTERFACE int is_list (SCHEME_P_ pointer p);
248INTERFACE INLINE int 285INTERFACE int
249is_vector (pointer p) 286is_vector (pointer p)
250{ 287{
251 return type (p) == T_VECTOR; 288 return type (p) == T_VECTOR;
252} 289}
253 290
254#define vecvalue(p) ((p)->object.vector.vvalue) 291#define vecvalue(p) ((p)->object.vector.vvalue)
255#define veclength(p) ((p)->object.vector.length) 292#define veclength(p) ((p)->object.vector.length)
256INTERFACE void fill_vector (pointer vec, pointer obj); 293INTERFACE 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); 294INTERFACE pointer vector_get (pointer vec, uint32_t ielem);
259INTERFACE void set_vector_elem (pointer vec, uint32_t ielem, pointer a); 295INTERFACE void vector_set (pointer vec, uint32_t ielem, pointer a);
260 296
261INTERFACE uint32_t 297INTERFACE int
262vector_length (pointer vec) 298is_integer (pointer p)
263{ 299{
264 return vec->object.vector.length; 300 return type (p) == T_INTEGER;
265} 301}
266 302
303/* not the same as in scheme, where integers are (correctly :) reals */
267INTERFACE INLINE int 304INTERFACE int
305is_real (pointer p)
306{
307 return type (p) == T_REAL;
308}
309
310INTERFACE int
268is_number (pointer p) 311is_number (pointer p)
269{ 312{
270 return type (p) == T_NUMBER; 313 return is_integer (p) || is_real (p);
271} 314}
272 315
273INTERFACE INLINE int 316INTERFACE 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) 317is_character (pointer p)
293{ 318{
294 return type (p) == T_CHARACTER; 319 return type (p) == T_CHARACTER;
295} 320}
296 321
297INTERFACE INLINE char * 322INTERFACE char *
298string_value (pointer p) 323string_value (pointer p)
299{ 324{
300 return strvalue (p); 325 return strvalue (p);
301} 326}
302 327
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) 328#define ivalue_unchecked(p) (p)->object.ivalue
329#define set_ivalue(p,v) (p)->object.ivalue = (v)
330
334#if USE_REAL 331#if USE_REAL
335# define rvalue_unchecked(p) ((p)->object.number.value.rvalue) 332#define rvalue_unchecked(p) (p)->object.rvalue
336# define set_num_integer(p) (p)->object.number.is_fixnum=1; 333#define set_rvalue(p,v) (p)->object.rvalue = (v)
337# define set_num_real(p) (p)->object.number.is_fixnum=0;
338#else 334#else
339# define rvalue_unchecked(p) ((p)->object.number.value.ivalue) 335#define rvalue_unchecked(p) (p)->object.ivalue
340# define set_num_integer(p) 0 336#define set_rvalue(p,v) (p)->object.ivalue = (v)
341# define set_num_real(p) 0
342#endif 337#endif
338
343INTERFACE long 339INTERFACE long
344charvalue (pointer p) 340charvalue (pointer p)
345{ 341{
346 return ivalue_unchecked (p); 342 return ivalue_unchecked (p);
347} 343}
348 344
349INTERFACE INLINE int 345INTERFACE int
350is_port (pointer p) 346is_port (pointer p)
351{ 347{
352 return type (p) == T_PORT; 348 return type (p) == T_PORT;
353} 349}
354 350
355INTERFACE INLINE int 351INTERFACE int
356is_inport (pointer p) 352is_inport (pointer p)
357{ 353{
358 return is_port (p) && p->object.port->kind & port_input; 354 return is_port (p) && p->object.port->kind & port_input;
359} 355}
360 356
361INTERFACE INLINE int 357INTERFACE int
362is_outport (pointer p) 358is_outport (pointer p)
363{ 359{
364 return is_port (p) && p->object.port->kind & port_output; 360 return is_port (p) && p->object.port->kind & port_output;
365} 361}
366 362
367INTERFACE INLINE int 363INTERFACE int
368is_pair (pointer p) 364is_pair (pointer p)
369{ 365{
370 return type (p) == T_PAIR; 366 return type (p) == T_PAIR;
371} 367}
372 368
373#define car(p) ((p)->object.cons.car + 0) 369#define car(p) ((p)->object.cons.car + 0)
374#define cdr(p) ((p)->object.cons.cdr) /* find_consecutive_cells uses &cdr */ 370#define cdr(p) ((p)->object.cons.cdr + 0)
375 371
376#define caar(p) car (car (p)) 372static pointer caar (pointer p) { return car (car (p)); }
377#define cadr(p) car (cdr (p)) 373static pointer cadr (pointer p) { return car (cdr (p)); }
378#define cdar(p) cdr (car (p)) 374static pointer cdar (pointer p) { return cdr (car (p)); }
379#define cddr(p) cdr (cdr (p)) 375static pointer cddr (pointer p) { return cdr (cdr (p)); }
380 376
381#define cadar(p) car (cdr (car (p))) 377static pointer cadar (pointer p) { return car (cdr (car (p))); }
382#define caddr(p) car (cdr (cdr (p))) 378static pointer caddr (pointer p) { return car (cdr (cdr (p))); }
383#define cdaar(p) cdr (car (car (p))) 379static pointer cdaar (pointer p) { return cdr (car (car (p))); }
384 380
385INTERFACE void 381INTERFACE void
386set_car (pointer p, pointer q) 382set_car (pointer p, pointer q)
387{ 383{
388 p->object.cons.car = q; 384 p->object.cons.car = q;
… …
404pair_cdr (pointer p) 400pair_cdr (pointer p)
405{ 401{
406 return cdr (p); 402 return cdr (p);
407} 403}
408 404
409INTERFACE INLINE int 405INTERFACE int
410is_symbol (pointer p) 406is_symbol (pointer p)
411{ 407{
412 return type (p) == T_SYMBOL; 408 return type (p) == T_SYMBOL;
413} 409}
414 410
415INTERFACE INLINE char * 411INTERFACE char *
416symname (pointer p) 412symname (pointer p)
417{ 413{
418 return strvalue (car (p)); 414 return strvalue (p);
419} 415}
420 416
421#if USE_PLIST 417#if USE_PLIST
418#error plists are broken because symbols are no longer pairs
419#define symprop(p) cdr(p)
422SCHEME_EXPORT INLINE int 420SCHEME_EXPORT int
423hasprop (pointer p) 421hasprop (pointer p)
424{ 422{
425 return typeflag (p) & T_SYMBOL; 423 return typeflag (p) & T_SYMBOL;
426} 424}
427
428# define symprop(p) cdr(p)
429#endif 425#endif
430 426
431INTERFACE INLINE int 427INTERFACE int
432is_syntax (pointer p) 428is_syntax (pointer p)
433{ 429{
434 return typeflag (p) & T_SYNTAX; 430 return typeflag (p) & T_SYNTAX;
435} 431}
436 432
437INTERFACE INLINE int 433INTERFACE int
438is_proc (pointer p) 434is_proc (pointer p)
439{ 435{
440 return type (p) == T_PROC; 436 return type (p) == T_PROC;
441} 437}
442 438
443INTERFACE INLINE int 439INTERFACE int
444is_foreign (pointer p) 440is_foreign (pointer p)
445{ 441{
446 return type (p) == T_FOREIGN; 442 return type (p) == T_FOREIGN;
447} 443}
448 444
449INTERFACE INLINE char * 445INTERFACE char *
450syntaxname (pointer p) 446syntaxname (pointer p)
451{ 447{
452 return strvalue (car (p)); 448 return strvalue (p);
453} 449}
454 450
455#define procnum(p) ivalue (p) 451#define procnum(p) ivalue_unchecked (p)
456static const char *procname (pointer x); 452static const char *procname (pointer x);
457 453
458INTERFACE INLINE int 454INTERFACE int
459is_closure (pointer p) 455is_closure (pointer p)
460{ 456{
461 return type (p) == T_CLOSURE; 457 return type (p) == T_CLOSURE;
462} 458}
463 459
464INTERFACE INLINE int 460INTERFACE int
465is_macro (pointer p) 461is_macro (pointer p)
466{ 462{
467 return type (p) == T_MACRO; 463 return type (p) == T_MACRO;
468} 464}
469 465
470INTERFACE INLINE pointer 466INTERFACE pointer
471closure_code (pointer p) 467closure_code (pointer p)
472{ 468{
473 return car (p); 469 return car (p);
474} 470}
475 471
476INTERFACE INLINE pointer 472INTERFACE pointer
477closure_env (pointer p) 473closure_env (pointer p)
478{ 474{
479 return cdr (p); 475 return cdr (p);
480} 476}
481 477
482INTERFACE INLINE int 478INTERFACE int
483is_continuation (pointer p) 479is_continuation (pointer p)
484{ 480{
485 return type (p) == T_CONTINUATION; 481 return type (p) == T_CONTINUATION;
486} 482}
487 483
488#define cont_dump(p) cdr (p) 484#define cont_dump(p) cdr (p)
489#define set_cont_dump(p,v) set_cdr ((p), (v)) 485#define set_cont_dump(p,v) set_cdr ((p), (v))
490 486
491/* To do: promise should be forced ONCE only */ 487/* To do: promise should be forced ONCE only */
492INTERFACE INLINE int 488INTERFACE int
493is_promise (pointer p) 489is_promise (pointer p)
494{ 490{
495 return type (p) == T_PROMISE; 491 return type (p) == T_PROMISE;
496} 492}
497 493
498INTERFACE INLINE int 494INTERFACE int
499is_environment (pointer p) 495is_environment (pointer p)
500{ 496{
501 return type (p) == T_ENVIRONMENT; 497 return type (p) == T_ENVIRONMENT;
502} 498}
503 499
… …
509 505
510#define is_mark(p) (typeflag (p) & T_MARK) 506#define is_mark(p) (typeflag (p) & T_MARK)
511#define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK) 507#define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK)
512#define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK) 508#define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK)
513 509
514INTERFACE INLINE int 510INTERFACE int
515is_immutable (pointer p) 511is_immutable (pointer p)
516{ 512{
517 return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING; 513 return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING;
518} 514}
519 515
520INTERFACE INLINE void 516INTERFACE void
521setimmutable (pointer p) 517setimmutable (pointer p)
522{ 518{
523#if USE_ERROR_CHECKING 519#if USE_ERROR_CHECKING
524 set_typeflag (p, typeflag (p) | T_IMMUTABLE); 520 set_typeflag (p, typeflag (p) | T_IMMUTABLE);
525#endif 521#endif
526} 522}
527 523
524/* Result is:
525 proper list: length
526 circular list: -1
527 not even a pair: -2
528 dotted list: -2 minus length before dot
529*/
530INTERFACE int
531list_length (SCHEME_P_ pointer a)
532{
533 int i = 0;
534 pointer slow, fast;
535
536 slow = fast = a;
537
538 while (1)
539 {
540 if (fast == NIL)
541 return i;
542
543 if (!is_pair (fast))
544 return -2 - i;
545
546 fast = cdr (fast);
547 ++i;
548
549 if (fast == NIL)
550 return i;
551
552 if (!is_pair (fast))
553 return -2 - i;
554
555 ++i;
556 fast = cdr (fast);
557
558 /* Safe because we would have already returned if `fast'
559 encountered a non-pair. */
560 slow = cdr (slow);
561
562 if (fast == slow)
563 {
564 /* the fast pointer has looped back around and caught up
565 with the slow pointer, hence the structure is circular,
566 not of finite length, and therefore not a list */
567 return -1;
568 }
569 }
570}
571
572INTERFACE int
573is_list (SCHEME_P_ pointer a)
574{
575 return list_length (SCHEME_A_ a) >= 0;
576}
577
528#if USE_CHAR_CLASSIFIERS 578#if USE_CHAR_CLASSIFIERS
529static INLINE int 579ecb_inline int
530Cisalpha (int c) 580Cisalpha (int c)
531{ 581{
532 return isascii (c) && isalpha (c); 582 return isascii (c) && isalpha (c);
533} 583}
534 584
535static INLINE int 585ecb_inline int
536Cisdigit (int c) 586Cisdigit (int c)
537{ 587{
538 return isascii (c) && isdigit (c); 588 return isascii (c) && isdigit (c);
539} 589}
540 590
541static INLINE int 591ecb_inline int
542Cisspace (int c) 592Cisspace (int c)
543{ 593{
544 return isascii (c) && isspace (c); 594 return isascii (c) && isspace (c);
545} 595}
546 596
547static INLINE int 597ecb_inline int
548Cisupper (int c) 598Cisupper (int c)
549{ 599{
550 return isascii (c) && isupper (c); 600 return isascii (c) && isupper (c);
551} 601}
552 602
553static INLINE int 603ecb_inline int
554Cislower (int c) 604Cislower (int c)
555{ 605{
556 return isascii (c) && islower (c); 606 return isascii (c) && islower (c);
557} 607}
558#endif 608#endif
… …
619#endif 669#endif
620 670
621static int file_push (SCHEME_P_ const char *fname); 671static int file_push (SCHEME_P_ const char *fname);
622static void file_pop (SCHEME_P); 672static void file_pop (SCHEME_P);
623static int file_interactive (SCHEME_P); 673static int file_interactive (SCHEME_P);
624static INLINE int is_one_of (char *s, int c); 674ecb_inline int is_one_of (const char *s, int c);
625static int alloc_cellseg (SCHEME_P_ int n); 675static 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); 676ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b);
628static void finalize_cell (SCHEME_P_ pointer a); 677static void finalize_cell (SCHEME_P_ pointer a);
629static int count_consecutive_cells (pointer x, int needed); 678static int count_consecutive_cells (pointer x, int needed);
630static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all); 679static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all);
631static pointer mk_number (SCHEME_P_ const num n); 680static pointer mk_number (SCHEME_P_ const num n);
632static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill); 681static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill);
… …
647static void mark (pointer a); 696static void mark (pointer a);
648static void gc (SCHEME_P_ pointer a, pointer b); 697static void gc (SCHEME_P_ pointer a, pointer b);
649static int basic_inchar (port *pt); 698static int basic_inchar (port *pt);
650static int inchar (SCHEME_P); 699static int inchar (SCHEME_P);
651static void backchar (SCHEME_P_ int c); 700static void backchar (SCHEME_P_ int c);
652static char *readstr_upto (SCHEME_P_ char *delim); 701static char *readstr_upto (SCHEME_P_ int skip, const char *delim);
653static pointer readstrexp (SCHEME_P); 702static pointer readstrexp (SCHEME_P_ char delim);
654static INLINE int skipspace (SCHEME_P); 703ecb_inline int skipspace (SCHEME_P);
655static int token (SCHEME_P); 704static int token (SCHEME_P);
656static void printslashstring (SCHEME_P_ char *s, int len); 705static void printslashstring (SCHEME_P_ char *s, int len);
657static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen); 706static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen);
658static void printatom (SCHEME_P_ pointer l, int f); 707static void printatom (SCHEME_P_ pointer l, int f);
659static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op); 708static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op);
… …
663static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list); 712static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list);
664static pointer revappend (SCHEME_P_ pointer a, pointer b); 713static pointer revappend (SCHEME_P_ pointer a, pointer b);
665static pointer ss_get_cont (SCHEME_P); 714static pointer ss_get_cont (SCHEME_P);
666static void ss_set_cont (SCHEME_P_ pointer cont); 715static void ss_set_cont (SCHEME_P_ pointer cont);
667static void dump_stack_mark (SCHEME_P); 716static void dump_stack_mark (SCHEME_P);
668static pointer opexe_0 (SCHEME_P_ enum scheme_opcodes op); 717static int opexe_0 (SCHEME_P_ enum scheme_opcodes op);
718static int opexe_1 (SCHEME_P_ enum scheme_opcodes op);
669static pointer opexe_2 (SCHEME_P_ enum scheme_opcodes op); 719static int opexe_2 (SCHEME_P_ enum scheme_opcodes op);
670static pointer opexe_3 (SCHEME_P_ enum scheme_opcodes op); 720static int opexe_3 (SCHEME_P_ enum scheme_opcodes op);
671static pointer opexe_4 (SCHEME_P_ enum scheme_opcodes op); 721static int opexe_4 (SCHEME_P_ enum scheme_opcodes op);
672static pointer opexe_5 (SCHEME_P_ enum scheme_opcodes op); 722static int opexe_5 (SCHEME_P_ enum scheme_opcodes op);
673static pointer opexe_6 (SCHEME_P_ enum scheme_opcodes op); 723static int opexe_6 (SCHEME_P_ enum scheme_opcodes op);
674static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op); 724static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op);
675static void assign_syntax (SCHEME_P_ const char *name); 725static void assign_syntax (SCHEME_P_ const char *name);
676static int syntaxnum (pointer p); 726static int syntaxnum (pointer p);
677static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name); 727static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name);
678 728
729static IVALUE
730ivalue (pointer x)
731{
732 return is_integer (x) ? ivalue_unchecked (x) : rvalue_unchecked (x);
733}
734
735static RVALUE
736rvalue (pointer x)
737{
738 return is_integer (x) ? ivalue_unchecked (x) : rvalue_unchecked (x);
739}
740
741INTERFACE num
742nvalue (pointer x)
743{
744 num n;
745
746 num_set_fixnum (n, is_integer (x));
747
748 if (num_is_fixnum (n))
749 num_set_ivalue (n, ivalue_unchecked (x));
750 else
751 num_set_rvalue (n, rvalue_unchecked (x));
752
753 return n;
754}
755
679static num 756static num
680num_add (num a, num b) 757num_op (enum num_op op, num a, num b)
681{ 758{
682 num ret; 759 num ret;
683 760
684 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 761 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
685 762
686 if (num_is_fixnum (ret)) 763 if (num_is_fixnum (ret))
687 num_set_ivalue (ret, num_get_ivalue (a) + num_get_ivalue (b)); 764 {
765 switch (op)
766 {
767 case NUM_ADD: a.ivalue += b.ivalue; break;
768 case NUM_SUB: a.ivalue -= b.ivalue; break;
769 case NUM_MUL: a.ivalue *= b.ivalue; break;
770 case NUM_INTDIV: a.ivalue /= b.ivalue; break;
771 }
772
773 num_set_ivalue (ret, a.ivalue);
774 }
775#if USE_REAL
688 else 776 else
689 num_set_rvalue (ret, num_get_rvalue (a) + num_get_rvalue (b)); 777 {
778 switch (op)
779 {
780 case NUM_ADD: a.rvalue += b.rvalue; break;
781 case NUM_SUB: a.rvalue -= b.rvalue; break;
782 case NUM_MUL: a.rvalue *= b.rvalue; break;
783 case NUM_INTDIV: a.rvalue /= b.rvalue; break;
784 }
690 785
691 return ret; 786 num_set_rvalue (ret, a.rvalue);
692} 787 }
693 788#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 789
706 return ret; 790 return ret;
707} 791}
708 792
709static num 793static num
710num_div (num a, num b) 794num_div (num a, num b)
711{ 795{
712 num ret; 796 num ret;
713 797
714 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_get_ivalue (a) % num_get_ivalue (b) == 0); 798 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_ivalue (a) % num_ivalue (b) == 0);
715 799
716 if (num_is_fixnum (ret)) 800 if (num_is_fixnum (ret))
717 num_set_ivalue (ret, num_get_ivalue (a) / num_get_ivalue (b)); 801 num_set_ivalue (ret, num_ivalue (a) / num_ivalue (b));
718 else 802 else
719 num_set_rvalue (ret, num_get_rvalue (a) / num_get_rvalue (b)); 803 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 804
751 return ret; 805 return ret;
752} 806}
753 807
754static num 808static num
… …
756{ 810{
757 num ret; 811 num ret;
758 long e1, e2, res; 812 long e1, e2, res;
759 813
760 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 814 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
761 e1 = num_get_ivalue (a); 815 e1 = num_ivalue (a);
762 e2 = num_get_ivalue (b); 816 e2 = num_ivalue (b);
763 res = e1 % e2; 817 res = e1 % e2;
764 818
765 /* remainder should have same sign as second operand */ 819 /* remainder should have same sign as second operand */
766 if (res > 0) 820 if (res > 0)
767 { 821 {
… …
783{ 837{
784 num ret; 838 num ret;
785 long e1, e2, res; 839 long e1, e2, res;
786 840
787 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 841 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
788 e1 = num_get_ivalue (a); 842 e1 = num_ivalue (a);
789 e2 = num_get_ivalue (b); 843 e2 = num_ivalue (b);
790 res = e1 % e2; 844 res = e1 % e2;
791 845
792 /* modulo should have same sign as second operand */ 846 /* modulo should have same sign as second operand */
793 if (res * e2 < 0) 847 if (res * e2 < 0)
794 res += e2; 848 res += e2;
795 849
796 num_set_ivalue (ret, res); 850 num_set_ivalue (ret, res);
797 return ret; 851 return ret;
798} 852}
799 853
854/* this completely disrespects NaNs, but r5rs doesn't even allow NaNs */
800static int 855static int
801num_eq (num a, num b) 856num_cmp (num a, num b)
802{ 857{
858 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
803 int ret; 859 int ret;
804 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
805 860
806 if (is_fixnum) 861 if (is_fixnum)
807 ret = num_get_ivalue (a) == num_get_ivalue (b); 862 {
863 IVALUE av = num_ivalue (a);
864 IVALUE bv = num_ivalue (b);
865
866 ret = av == bv ? 0 : av < bv ? -1 : +1;
867 }
808 else 868 else
809 ret = num_get_rvalue (a) == num_get_rvalue (b); 869 {
870 RVALUE av = num_rvalue (a);
871 RVALUE bv = num_rvalue (b);
872
873 ret = av == bv ? 0 : av < bv ? -1 : +1;
874 }
810 875
811 return ret; 876 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} 877}
854 878
855#if USE_MATH 879#if USE_MATH
856 880
857/* Round to nearest. Round to even if midway */ 881/* Round to nearest. Round to even if midway */
… …
867 return ce; 891 return ce;
868 else if (dfl < dce) 892 else if (dfl < dce)
869 return fl; 893 return fl;
870 else 894 else
871 { 895 {
872 if (fmod (fl, 2.0) == 0.0) /* I imagine this holds */ 896 if (fmod (fl, 2) == 0) /* I imagine this holds */
873 return fl; 897 return fl;
874 else 898 else
875 return ce; 899 return ce;
876 } 900 }
877} 901}
878#endif 902#endif
879 903
880static int 904static int
881is_zero_rvalue (RVALUE x) 905is_zero_rvalue (RVALUE x)
882{ 906{
907 return x == 0;
908#if 0
883#if USE_REAL 909#if USE_REAL
884 return x < DBL_MIN && x > -DBL_MIN; /* why the hate of denormals? this should be == 0. */ 910 return x < DBL_MIN && x > -DBL_MIN; /* why the hate of denormals? this should be == 0. */
885#else 911#else
886 return x == 0; 912 return x == 0;
887#endif 913#endif
888} 914#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} 915}
904 916
905/* allocate new cell segment */ 917/* allocate new cell segment */
906static int 918static int
907alloc_cellseg (SCHEME_P_ int n) 919alloc_cellseg (SCHEME_P_ int n)
… …
927 return k; 939 return k;
928 940
929 i = ++SCHEME_V->last_cell_seg; 941 i = ++SCHEME_V->last_cell_seg;
930 SCHEME_V->alloc_seg[i] = cp; 942 SCHEME_V->alloc_seg[i] = cp;
931 943
932 /* insert new segment in address order */
933 newp = (pointer)cp; 944 newp = (pointer)cp;
934 SCHEME_V->cell_seg[i] = newp; 945 SCHEME_V->cell_seg[i] = newp;
935 SCHEME_V->cell_segsize[i] = segsize; 946 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; 947 SCHEME_V->fcells += segsize;
952 last = newp + segsize - 1; 948 last = newp + segsize - 1;
953 949
954 for (p = newp; p <= last; p++) 950 for (p = newp; p <= last; p++)
955 { 951 {
956 set_typeflag (p, T_FREE); 952 set_typeflag (p, T_PAIR);
957 set_car (p, NIL); 953 set_car (p, NIL);
958 set_cdr (p, p + 1); 954 set_cdr (p, p + 1);
959 } 955 }
960 956
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); 957 set_cdr (last, SCHEME_V->free_cell);
965 SCHEME_V->free_cell = newp; 958 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 } 959 }
978 960
979 return n; 961 return n;
980} 962}
981 963
982/* get new cell. parameter a, b is marked by gc. */ 964/* get new cell. parameter a, b is marked by gc. */
983static INLINE pointer 965ecb_inline pointer
984get_cell_x (SCHEME_P_ pointer a, pointer b) 966get_cell_x (SCHEME_P_ pointer a, pointer b)
985{ 967{
986 if (SCHEME_V->free_cell == NIL) 968 if (ecb_expect_false (SCHEME_V->free_cell == NIL))
987 { 969 {
988 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 970 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
989 return S_SINK; 971 return S_SINK;
990 972
991 if (SCHEME_V->free_cell == NIL) 973 if (SCHEME_V->free_cell == NIL)
992 { 974 {
993 const int min_to_be_recovered = SCHEME_V->last_cell_seg < 128 ? 128 * 8 : SCHEME_V->last_cell_seg * 8; 975 const int min_to_be_recovered = SCHEME_V->cell_segsize [SCHEME_V->last_cell_seg] >> 1;
994 976
995 gc (SCHEME_A_ a, b); 977 gc (SCHEME_A_ a, b);
996 978
997 if (SCHEME_V->fcells < min_to_be_recovered || SCHEME_V->free_cell == NIL) 979 if (SCHEME_V->fcells < min_to_be_recovered || SCHEME_V->free_cell == NIL)
998 { 980 {
… …
1049} 1031}
1050 1032
1051static pointer 1033static pointer
1052get_vector_object (SCHEME_P_ uint32_t len, pointer init) 1034get_vector_object (SCHEME_P_ uint32_t len, pointer init)
1053{ 1035{
1054 pointer v = get_cell_x (SCHEME_A_ 0, 0); 1036 pointer v = get_cell_x (SCHEME_A_ NIL, NIL);
1055 pointer *e = malloc (len * sizeof (pointer)); 1037 pointer *e = malloc (len * sizeof (pointer));
1056 1038
1057 if (!e && USE_ERROR_CHECKING) 1039 if (!e && USE_ERROR_CHECKING)
1058 return S_SINK; 1040 return S_SINK;
1059 1041
1060 /* Record it as a vector so that gc understands it. */ 1042 /* Record it as a vector so that gc understands it. */
1061 set_typeflag (v, T_VECTOR | T_ATOM); 1043 set_typeflag (v, T_VECTOR | T_ATOM);
1062 1044
1063 v->object.vector.vvalue = e; 1045 v->object.vector.vvalue = e;
1064 v->object.vector.length = len; 1046 v->object.vector.length = len;
1065 fill_vector (v, init); 1047 fill_vector (v, 0, init);
1066 push_recent_alloc (SCHEME_A_ v, NIL); 1048 push_recent_alloc (SCHEME_A_ v, NIL);
1067 1049
1068 return v; 1050 return v;
1069} 1051}
1070 1052
1071static INLINE void 1053ecb_inline void
1072ok_to_freely_gc (SCHEME_P) 1054ok_to_freely_gc (SCHEME_P)
1073{ 1055{
1074 set_car (S_SINK, NIL); 1056 set_car (S_SINK, NIL);
1075} 1057}
1076 1058
… …
1113 set_cdr (x, b); 1095 set_cdr (x, b);
1114 1096
1115 return x; 1097 return x;
1116} 1098}
1117 1099
1100static pointer
1101generate_symbol (SCHEME_P_ const char *name)
1102{
1103 pointer x = mk_string (SCHEME_A_ name);
1104 setimmutable (x);
1105 set_typeflag (x, T_SYMBOL | T_ATOM);
1106 return x;
1107}
1108
1118/* ========== oblist implementation ========== */ 1109/* ========== oblist implementation ========== */
1119 1110
1120#ifndef USE_OBJECT_LIST 1111#ifndef USE_OBJECT_LIST
1121 1112
1113static int
1122static int hash_fn (const char *key, int table_size); 1114hash_fn (const char *key, int table_size)
1115{
1116 const unsigned char *p = key;
1117 uint32_t hash = 2166136261;
1118
1119 while (*p)
1120 hash = (hash ^ *p++) * 16777619;
1121
1122 return hash % table_size;
1123}
1123 1124
1124static pointer 1125static pointer
1125oblist_initial_value (SCHEME_P) 1126oblist_initial_value (SCHEME_P)
1126{ 1127{
1127 return mk_vector (SCHEME_A_ 461); /* probably should be bigger */ 1128 return mk_vector (SCHEME_A_ 461); /* probably should be bigger */
… …
1129 1130
1130/* returns the new symbol */ 1131/* returns the new symbol */
1131static pointer 1132static pointer
1132oblist_add_by_name (SCHEME_P_ const char *name) 1133oblist_add_by_name (SCHEME_P_ const char *name)
1133{ 1134{
1134 int location; 1135 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)); 1136 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))); 1137 vector_set (SCHEME_V->oblist, location, immutable_cons (x, vector_get (SCHEME_V->oblist, location)));
1142 return x; 1138 return x;
1143} 1139}
1144 1140
1145static INLINE pointer 1141ecb_inline pointer
1146oblist_find_by_name (SCHEME_P_ const char *name) 1142oblist_find_by_name (SCHEME_P_ const char *name)
1147{ 1143{
1148 int location; 1144 int location;
1149 pointer x; 1145 pointer x;
1150 char *s; 1146 char *s;
1151 1147
1152 location = hash_fn (name, veclength (SCHEME_V->oblist)); 1148 location = hash_fn (name, veclength (SCHEME_V->oblist));
1153 1149
1154 for (x = vector_elem (SCHEME_V->oblist, location); x != NIL; x = cdr (x)) 1150 for (x = vector_get (SCHEME_V->oblist, location); x != NIL; x = cdr (x))
1155 { 1151 {
1156 s = symname (car (x)); 1152 s = symname (car (x));
1157 1153
1158 /* case-insensitive, per R5RS section 2 */ 1154 /* case-insensitive, per R5RS section 2 */
1159 if (stricmp (name, s) == 0) 1155 if (stricmp (name, s) == 0)
… …
1169 int i; 1165 int i;
1170 pointer x; 1166 pointer x;
1171 pointer ob_list = NIL; 1167 pointer ob_list = NIL;
1172 1168
1173 for (i = 0; i < veclength (SCHEME_V->oblist); i++) 1169 for (i = 0; i < veclength (SCHEME_V->oblist); i++)
1174 for (x = vector_elem (SCHEME_V->oblist, i); x != NIL; x = cdr (x)) 1170 for (x = vector_get (SCHEME_V->oblist, i); x != NIL; x = cdr (x))
1175 ob_list = cons (x, ob_list); 1171 ob_list = cons (x, ob_list);
1176 1172
1177 return ob_list; 1173 return ob_list;
1178} 1174}
1179 1175
… …
1183oblist_initial_value (SCHEME_P) 1179oblist_initial_value (SCHEME_P)
1184{ 1180{
1185 return NIL; 1181 return NIL;
1186} 1182}
1187 1183
1188static INLINE pointer 1184ecb_inline pointer
1189oblist_find_by_name (SCHEME_P_ const char *name) 1185oblist_find_by_name (SCHEME_P_ const char *name)
1190{ 1186{
1191 pointer x; 1187 pointer x;
1192 char *s; 1188 char *s;
1193 1189
… …
1205 1201
1206/* returns the new symbol */ 1202/* returns the new symbol */
1207static pointer 1203static pointer
1208oblist_add_by_name (SCHEME_P_ const char *name) 1204oblist_add_by_name (SCHEME_P_ const char *name)
1209{ 1205{
1210 pointer x; 1206 pointer x = generate_symbol (SCHEME_A_ name);
1211
1212 x = immutable_cons (mk_string (SCHEME_A_ name), NIL);
1213 set_typeflag (x, T_SYMBOL);
1214 setimmutable (car (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
… …
1240pointer 1232pointer
1241mk_foreign_func (SCHEME_P_ foreign_func f) 1233mk_foreign_func (SCHEME_P_ foreign_func f)
1242{ 1234{
1243 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1235 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1244 1236
1245 set_typeflag (x, (T_FOREIGN | T_ATOM)); 1237 set_typeflag (x, T_FOREIGN | T_ATOM);
1246 x->object.ff = f; 1238 x->object.ff = f;
1247 1239
1248 return x; 1240 return x;
1249} 1241}
1250 1242
1251INTERFACE pointer 1243INTERFACE 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{
1258 pointer p = 0;
1259 pointer *pp = &p;
1260
1261#if USE_INTCACHE
1262 if (n >= INTCACHE_MIN && n <= INTCACHE_MAX)
1263 pp = &SCHEME_V->intcache[n - INTCACHE_MIN];
1264#endif
1265
1266 if (!*pp)
1267 {
1266 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1268 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1267 1269
1268 set_typeflag (x, (T_NUMBER | T_ATOM)); 1270 set_typeflag (x, T_INTEGER | T_ATOM);
1269 ivalue_unchecked (x) = num; 1271 setimmutable (x); /* shouldn't do anythi9ng, doesn't cost anything */
1270 set_num_integer (x); 1272 set_ivalue (x, n);
1273
1274 *pp = x;
1275 }
1276
1271 return x; 1277 return *pp;
1272} 1278}
1273 1279
1274INTERFACE pointer 1280INTERFACE pointer
1275mk_real (SCHEME_P_ RVALUE n) 1281mk_real (SCHEME_P_ RVALUE n)
1276{ 1282{
1283#if USE_REAL
1277 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1284 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1278 1285
1279 set_typeflag (x, (T_NUMBER | T_ATOM)); 1286 set_typeflag (x, T_REAL | T_ATOM);
1280 rvalue_unchecked (x) = n; 1287 set_rvalue (x, n);
1281 set_num_real (x); 1288
1282 return x; 1289 return x;
1290#else
1291 return mk_integer (SCHEME_A_ n);
1292#endif
1283} 1293}
1284 1294
1285static pointer 1295static pointer
1286mk_number (SCHEME_P_ const num n) 1296mk_number (SCHEME_P_ const num n)
1287{ 1297{
1298#if USE_REAL
1288 if (num_is_fixnum (n)) 1299 return num_is_fixnum (n)
1300 ? mk_integer (SCHEME_A_ num_ivalue (n))
1301 : mk_real (SCHEME_A_ num_rvalue (n));
1302#else
1289 return mk_integer (SCHEME_A_ num_get_ivalue (n)); 1303 return mk_integer (SCHEME_A_ num_ivalue (n));
1290 else 1304#endif
1291 return mk_real (SCHEME_A_ num_get_rvalue (n));
1292} 1305}
1293 1306
1294/* allocate name to string area */ 1307/* allocate name to string area */
1295static char * 1308static char *
1296store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill) 1309store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill)
… …
1302 SCHEME_V->no_memory = 1; 1315 SCHEME_V->no_memory = 1;
1303 return SCHEME_V->strbuff; 1316 return SCHEME_V->strbuff;
1304 } 1317 }
1305 1318
1306 if (str) 1319 if (str)
1307 { 1320 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 1321 else
1317 {
1318 memset (q, fill, len_str); 1322 memset (q, fill, len_str);
1323
1319 q[len_str] = 0; 1324 q[len_str] = 0;
1320 }
1321 1325
1322 return q; 1326 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} 1327}
1342 1328
1343INTERFACE pointer 1329INTERFACE pointer
1344mk_empty_string (SCHEME_P_ uint32_t len, char fill) 1330mk_empty_string (SCHEME_P_ uint32_t len, char fill)
1345{ 1331{
… …
1350 strlength (x) = len; 1336 strlength (x) = len;
1351 return x; 1337 return x;
1352} 1338}
1353 1339
1354INTERFACE pointer 1340INTERFACE pointer
1341mk_counted_string (SCHEME_P_ const char *str, uint32_t len)
1342{
1343 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1344
1345 set_typeflag (x, T_STRING | T_ATOM);
1346 strvalue (x) = store_string (SCHEME_A_ len, str, 0);
1347 strlength (x) = len;
1348
1349 return x;
1350}
1351
1352INTERFACE pointer
1353mk_string (SCHEME_P_ const char *str)
1354{
1355 return mk_counted_string (SCHEME_A_ str, strlen (str));
1356}
1357
1358INTERFACE pointer
1355mk_vector (SCHEME_P_ uint32_t len) 1359mk_vector (SCHEME_P_ uint32_t len)
1356{ 1360{
1357 return get_vector_object (SCHEME_A_ len, NIL); 1361 return get_vector_object (SCHEME_A_ len, NIL);
1358} 1362}
1359 1363
1360INTERFACE void 1364INTERFACE void
1361fill_vector (pointer vec, pointer obj) 1365fill_vector (pointer vec, uint32_t start, pointer obj)
1362{ 1366{
1363 int i; 1367 int i;
1364 1368
1365 for (i = 0; i < vec->object.vector.length; i++) 1369 for (i = start; i < veclength (vec); i++)
1366 vecvalue (vec)[i] = obj; 1370 vecvalue (vec)[i] = obj;
1367} 1371}
1368 1372
1373INTERFACE void
1374vector_resize (pointer vec, uint32_t newsize, pointer fill)
1375{
1376 uint32_t oldsize = veclength (vec);
1377 vecvalue (vec) = realloc (vecvalue (vec), newsize * sizeof (pointer));
1378 veclength (vec) = newsize;
1379 fill_vector (vec, oldsize, fill);
1380}
1381
1369INTERFACE pointer 1382INTERFACE pointer
1370vector_elem (pointer vec, uint32_t ielem) 1383vector_get (pointer vec, uint32_t ielem)
1371{ 1384{
1372 return vecvalue(vec)[ielem]; 1385 return vecvalue(vec)[ielem];
1373} 1386}
1374 1387
1375INTERFACE void 1388INTERFACE void
1376set_vector_elem (pointer vec, uint32_t ielem, pointer a) 1389vector_set (pointer vec, uint32_t ielem, pointer a)
1377{ 1390{
1378 vecvalue(vec)[ielem] = a; 1391 vecvalue(vec)[ielem] = a;
1379} 1392}
1380 1393
1381/* get new symbol */ 1394/* get new symbol */
… …
1393 1406
1394INTERFACE pointer 1407INTERFACE pointer
1395gensym (SCHEME_P) 1408gensym (SCHEME_P)
1396{ 1409{
1397 pointer x; 1410 pointer x;
1398 char name[40]; 1411 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); 1412 xnum (name + 7, ++SCHEME_V->gensym_cnt);
1404 1413
1405 /* first check oblist */ 1414 return generate_symbol (SCHEME_A_ name);
1406 x = oblist_find_by_name (SCHEME_A_ name); 1415}
1407 1416
1408 if (x != NIL) 1417static int
1409 continue; 1418is_gensym (SCHEME_P_ pointer x)
1410 else 1419{
1411 { 1420 return is_symbol (x) && oblist_find_by_name (SCHEME_A_ strvalue (x)) != x;
1412 x = oblist_add_by_name (SCHEME_A_ name);
1413 return x;
1414 }
1415 }
1416
1417 return NIL;
1418} 1421}
1419 1422
1420/* make symbol or number atom from string */ 1423/* make symbol or number atom from string */
1421static pointer 1424static pointer
1422mk_atom (SCHEME_P_ char *q) 1425mk_atom (SCHEME_P_ char *q)
… …
1424 char c, *p; 1427 char c, *p;
1425 int has_dec_point = 0; 1428 int has_dec_point = 0;
1426 int has_fp_exp = 0; 1429 int has_fp_exp = 0;
1427 1430
1428#if USE_COLON_HOOK 1431#if USE_COLON_HOOK
1429
1430 if ((p = strstr (q, "::")) != 0) 1432 if ((p = strstr (q, "::")) != 0)
1431 { 1433 {
1432 *p = 0; 1434 *p = 0;
1433 return cons (SCHEME_V->COLON_HOOK, 1435 return cons (SCHEME_V->COLON_HOOK,
1434 cons (cons (SCHEME_V->QUOTE, 1436 cons (cons (SCHEME_V->QUOTE,
1435 cons (mk_atom (SCHEME_A_ p + 2), NIL)), cons (mk_symbol (SCHEME_A_ strlwr (q)), NIL))); 1437 cons (mk_atom (SCHEME_A_ p + 2), NIL)), cons (mk_symbol (SCHEME_A_ strlwr (q)), NIL)));
1436 } 1438 }
1437
1438#endif 1439#endif
1439 1440
1440 p = q; 1441 p = q;
1441 c = *p++; 1442 c = *p++;
1442 1443
… …
1478 } 1479 }
1479 else if ((c == 'e') || (c == 'E')) 1480 else if ((c == 'e') || (c == 'E'))
1480 { 1481 {
1481 if (!has_fp_exp) 1482 if (!has_fp_exp)
1482 { 1483 {
1483 has_dec_point = 1; /* decimal point illegal 1484 has_dec_point = 1; /* decimal point illegal from now on */
1484 from now on */
1485 p++; 1485 p++;
1486 1486
1487 if ((*p == '-') || (*p == '+') || isdigit (*p)) 1487 if ((*p == '-') || (*p == '+') || isdigit (*p))
1488 continue; 1488 continue;
1489 } 1489 }
… …
1503 1503
1504/* make constant */ 1504/* make constant */
1505static pointer 1505static pointer
1506mk_sharp_const (SCHEME_P_ char *name) 1506mk_sharp_const (SCHEME_P_ char *name)
1507{ 1507{
1508 long x;
1509 char tmp[STRBUFFSIZE];
1510
1511 if (!strcmp (name, "t")) 1508 if (!strcmp (name, "t"))
1512 return S_T; 1509 return S_T;
1513 else if (!strcmp (name, "f")) 1510 else if (!strcmp (name, "f"))
1514 return S_F; 1511 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) */ 1512 else if (*name == '\\') /* #\w (character) */
1536 { 1513 {
1537 int c = 0; 1514 int c;
1538 1515
1539 if (stricmp (name + 1, "space") == 0) 1516 if (stricmp (name + 1, "space") == 0)
1540 c = ' '; 1517 c = ' ';
1541 else if (stricmp (name + 1, "newline") == 0) 1518 else if (stricmp (name + 1, "newline") == 0)
1542 c = '\n'; 1519 c = '\n';
… …
1544 c = '\r'; 1521 c = '\r';
1545 else if (stricmp (name + 1, "tab") == 0) 1522 else if (stricmp (name + 1, "tab") == 0)
1546 c = '\t'; 1523 c = '\t';
1547 else if (name[1] == 'x' && name[2] != 0) 1524 else if (name[1] == 'x' && name[2] != 0)
1548 { 1525 {
1549 int c1 = strtol (name + 2, 0, 16); 1526 long c1 = strtol (name + 2, 0, 16);
1550 1527
1551 if (c1 <= UCHAR_MAX) 1528 if (0 <= c1 && c1 <= UCHAR_MAX)
1552 c = c1; 1529 c = c1;
1553 else 1530 else
1554 return NIL; 1531 return NIL;
1555 1532 }
1556#if USE_ASCII_NAMES 1533#if USE_ASCII_NAMES
1557 }
1558 else if (is_ascii_name (name + 1, &c)) 1534 else if (is_ascii_name (name + 1, &c))
1559 {
1560 /* nothing */ 1535 /* nothing */;
1561#endif 1536#endif
1562 }
1563 else if (name[2] == 0) 1537 else if (name[2] == 0)
1564 c = name[1]; 1538 c = name[1];
1565 else 1539 else
1566 return NIL; 1540 return NIL;
1567 1541
1568 return mk_character (SCHEME_A_ c); 1542 return mk_character (SCHEME_A_ c);
1569 } 1543 }
1570 else 1544 else
1545 {
1546 /* identify base by string index */
1547 const char baseidx[17] = "ffbf" "ffff" "ofdf" "ffff" "x";
1548 char *base = strchr (baseidx, *name);
1549
1550 if (base)
1551 return mk_integer (SCHEME_A_ strtol (name + 1, 0, base - baseidx));
1552
1571 return NIL; 1553 return NIL;
1554 }
1572} 1555}
1573 1556
1574/* ========== garbage collector ========== */ 1557/* ========== garbage collector ========== */
1575 1558
1576/*-- 1559/*--
1577 * We use algorithm E (Knuth, The Art of Computer Programming Vol.1, 1560 * We use algorithm E (Knuth, The Art of Computer Programming Vol.1,
1578 * sec. 2.3.5), the Schorr-Deutsch-Waite link-inversion algorithm, 1561 * sec. 2.3.5), the Schorr-Deutsch-Waite link-inversion algorithm,
1579 * for marking. 1562 * for marking.
1563 *
1564 * The exception is vectors - vectors are currently marked recursively,
1565 * which is inherited form tinyscheme and could be fixed by having another
1566 * word of context in the vector
1580 */ 1567 */
1581static void 1568static void
1582mark (pointer a) 1569mark (pointer a)
1583{ 1570{
1584 pointer t, q, p; 1571 pointer t, q, p;
… …
1586 t = 0; 1573 t = 0;
1587 p = a; 1574 p = a;
1588E2: 1575E2:
1589 setmark (p); 1576 setmark (p);
1590 1577
1591 if (is_vector (p)) 1578 if (ecb_expect_false (is_vector (p)))
1592 { 1579 {
1593 int i; 1580 int i;
1594 1581
1595 for (i = 0; i < p->object.vector.length; i++) 1582 for (i = 0; i < veclength (p); i++)
1596 mark (vecvalue (p)[i]); 1583 mark (vecvalue (p)[i]);
1597 } 1584 }
1598 1585
1599 if (is_atom (p)) 1586 if (is_atom (p))
1600 goto E6; 1587 goto E6;
… …
1673 /* Mark recent objects the interpreter doesn't know about yet. */ 1660 /* Mark recent objects the interpreter doesn't know about yet. */
1674 mark (car (S_SINK)); 1661 mark (car (S_SINK));
1675 /* Mark any older stuff above nested C calls */ 1662 /* Mark any older stuff above nested C calls */
1676 mark (SCHEME_V->c_nest); 1663 mark (SCHEME_V->c_nest);
1677 1664
1665#if USE_INTCACHE
1666 /* mark intcache */
1667 for (i = INTCACHE_MIN; i <= INTCACHE_MAX; ++i)
1668 if (SCHEME_V->intcache[i - INTCACHE_MIN])
1669 mark (SCHEME_V->intcache[i - INTCACHE_MIN]);
1670#endif
1671
1678 /* mark variables a, b */ 1672 /* mark variables a, b */
1679 mark (a); 1673 mark (a);
1680 mark (b); 1674 mark (b);
1681 1675
1682 /* garbage collect */ 1676 /* garbage collect */
1683 clrmark (NIL); 1677 clrmark (NIL);
1684 SCHEME_V->fcells = 0; 1678 SCHEME_V->fcells = 0;
1685 SCHEME_V->free_cell = NIL; 1679 SCHEME_V->free_cell = NIL;
1686 1680
1687 /* free-list is kept sorted by address so as to maintain consecutive 1681 if (SCHEME_V->gc_verbose)
1688 ranges, if possible, for use with vectors. Here we scan the cells 1682 xwrstr ("freeing...");
1689 (which are also kept sorted by address) downwards to build the 1683
1690 free-list in sorted order. 1684 uint32_t total = 0;
1691 */ 1685
1686 /* Here we scan the cells to build the free-list. */
1692 for (i = SCHEME_V->last_cell_seg; i >= 0; i--) 1687 for (i = SCHEME_V->last_cell_seg; i >= 0; i--)
1693 { 1688 {
1694 p = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i]; 1689 pointer end = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i];
1690 total += SCHEME_V->cell_segsize [i];
1695 1691
1696 while (--p >= SCHEME_V->cell_seg[i]) 1692 for (p = SCHEME_V->cell_seg[i]; p < end; ++p)
1697 { 1693 {
1698 if (is_mark (p)) 1694 if (is_mark (p))
1699 clrmark (p); 1695 clrmark (p);
1700 else 1696 else
1701 { 1697 {
1702 /* reclaim cell */ 1698 /* reclaim cell */
1703 if (typeflag (p) != T_FREE) 1699 if (typeflag (p) != T_PAIR)
1704 { 1700 {
1705 finalize_cell (SCHEME_A_ p); 1701 finalize_cell (SCHEME_A_ p);
1706 set_typeflag (p, T_FREE); 1702 set_typeflag (p, T_PAIR);
1707 set_car (p, NIL); 1703 set_car (p, NIL);
1708 } 1704 }
1709 1705
1710 ++SCHEME_V->fcells; 1706 ++SCHEME_V->fcells;
1711 set_cdr (p, SCHEME_V->free_cell); 1707 set_cdr (p, SCHEME_V->free_cell);
… …
1713 } 1709 }
1714 } 1710 }
1715 } 1711 }
1716 1712
1717 if (SCHEME_V->gc_verbose) 1713 if (SCHEME_V->gc_verbose)
1714 {
1718 xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" cells were recovered.\n"); 1715 xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" out of "); xwrnum (total); xwrstr (" cells were recovered.\n");
1716 }
1719} 1717}
1720 1718
1721static void 1719static void
1722finalize_cell (SCHEME_P_ pointer a) 1720finalize_cell (SCHEME_P_ pointer a)
1723{ 1721{
1724 if (is_string (a)) 1722 /* TODO, fast bitmap check? */
1723 if (is_string (a) || is_symbol (a))
1725 free (strvalue (a)); 1724 free (strvalue (a));
1726 else if (is_vector (a)) 1725 else if (is_vector (a))
1727 free (vecvalue (a)); 1726 free (vecvalue (a));
1728#if USE_PORTS 1727#if USE_PORTS
1729 else if (is_port (a)) 1728 else if (is_port (a))
… …
2151#endif 2150#endif
2152} 2151}
2153 2152
2154/* read characters up to delimiter, but cater to character constants */ 2153/* read characters up to delimiter, but cater to character constants */
2155static char * 2154static char *
2156readstr_upto (SCHEME_P_ char *delim) 2155readstr_upto (SCHEME_P_ int skip, const char *delim)
2157{ 2156{
2158 char *p = SCHEME_V->strbuff; 2157 char *p = SCHEME_V->strbuff + skip;
2159 2158
2160 while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A)))); 2159 while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A))));
2161 2160
2162 if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\') 2161 if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\')
2163 *p = 0; 2162 *p = 0;
… …
2170 return SCHEME_V->strbuff; 2169 return SCHEME_V->strbuff;
2171} 2170}
2172 2171
2173/* read string expression "xxx...xxx" */ 2172/* read string expression "xxx...xxx" */
2174static pointer 2173static pointer
2175readstrexp (SCHEME_P) 2174readstrexp (SCHEME_P_ char delim)
2176{ 2175{
2177 char *p = SCHEME_V->strbuff; 2176 char *p = SCHEME_V->strbuff;
2178 int c; 2177 int c;
2179 int c1 = 0; 2178 int c1 = 0;
2180 enum
2181 { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok; 2179 enum { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok;
2182 2180
2183 for (;;) 2181 for (;;)
2184 { 2182 {
2185 c = inchar (SCHEME_A); 2183 c = inchar (SCHEME_A);
2186 2184
… …
2188 return S_F; 2186 return S_F;
2189 2187
2190 switch (state) 2188 switch (state)
2191 { 2189 {
2192 case st_ok: 2190 case st_ok:
2193 switch (c) 2191 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); 2192 return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff);
2202 2193
2203 default: 2194 if (ecb_expect_false (c == '\\'))
2195 state = st_bsl;
2196 else
2204 *p++ = c; 2197 *p++ = c;
2205 break;
2206 }
2207 2198
2208 break; 2199 break;
2209 2200
2210 case st_bsl: 2201 case st_bsl:
2211 switch (c) 2202 switch (c)
… …
2241 case 'r': 2232 case 'r':
2242 *p++ = '\r'; 2233 *p++ = '\r';
2243 state = st_ok; 2234 state = st_ok;
2244 break; 2235 break;
2245 2236
2246 case '"':
2247 *p++ = '"';
2248 state = st_ok;
2249 break;
2250
2251 default: 2237 default:
2252 *p++ = c; 2238 *p++ = c;
2253 state = st_ok; 2239 state = st_ok;
2254 break; 2240 break;
2255 } 2241 }
2256 2242
2257 break; 2243 break;
2258 2244
2259 case st_x1: 2245 case st_x1:
2260 case st_x2: 2246 case st_x2:
2261 c = toupper (c); 2247 c = tolower (c);
2262 2248
2263 if (c >= '0' && c <= 'F') 2249 if (c >= '0' && c <= '9')
2264 {
2265 if (c <= '9')
2266 c1 = (c1 << 4) + c - '0'; 2250 c1 = (c1 << 4) + c - '0';
2267 else 2251 else if (c >= 'a' && c <= 'f')
2268 c1 = (c1 << 4) + c - 'A' + 10; 2252 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 2253 else
2279 return S_F; 2254 return S_F;
2255
2256 if (state == st_x1)
2257 state = st_x2;
2258 else
2259 {
2260 *p++ = c1;
2261 state = st_ok;
2262 }
2280 2263
2281 break; 2264 break;
2282 2265
2283 case st_oct1: 2266 case st_oct1:
2284 case st_oct2: 2267 case st_oct2:
… …
2288 backchar (SCHEME_A_ c); 2271 backchar (SCHEME_A_ c);
2289 state = st_ok; 2272 state = st_ok;
2290 } 2273 }
2291 else 2274 else
2292 { 2275 {
2293 if (state == st_oct2 && c1 >= 32) 2276 if (state == st_oct2 && c1 >= ' ')
2294 return S_F; 2277 return S_F;
2295 2278
2296 c1 = (c1 << 3) + (c - '0'); 2279 c1 = (c1 << 3) + (c - '0');
2297 2280
2298 if (state == st_oct1) 2281 if (state == st_oct1)
… …
2303 state = st_ok; 2286 state = st_ok;
2304 } 2287 }
2305 } 2288 }
2306 2289
2307 break; 2290 break;
2308
2309 } 2291 }
2310 } 2292 }
2311} 2293}
2312 2294
2313/* check c is in chars */ 2295/* check c is in chars */
2314static INLINE int 2296ecb_inline int
2315is_one_of (char *s, int c) 2297is_one_of (const char *s, int c)
2316{ 2298{
2317 if (c == EOF)
2318 return 1;
2319
2320 return !!strchr (s, c); 2299 return c == EOF || !!strchr (s, c);
2321} 2300}
2322 2301
2323/* skip white characters */ 2302/* skip white characters */
2324static INLINE int 2303ecb_inline int
2325skipspace (SCHEME_P) 2304skipspace (SCHEME_P)
2326{ 2305{
2327 int c, curr_line = 0; 2306 int c, curr_line = 0;
2328 2307
2329 do 2308 do
2330 { 2309 {
2331 c = inchar (SCHEME_A); 2310 c = inchar (SCHEME_A);
2311
2332#if SHOW_ERROR_LINE 2312#if SHOW_ERROR_LINE
2333 if (c == '\n') 2313 if (ecb_expect_false (c == '\n'))
2334 curr_line++; 2314 curr_line++;
2335#endif 2315#endif
2316
2317 if (ecb_expect_false (c == EOF))
2318 return c;
2336 } 2319 }
2337 while (c == ' ' || c == '\n' || c == '\r' || c == '\t'); 2320 while (is_one_of (WHITESPACE, c));
2338 2321
2339 /* record it */ 2322 /* record it */
2340#if SHOW_ERROR_LINE 2323#if SHOW_ERROR_LINE
2341 if (SCHEME_V->load_stack[SCHEME_V->file_i].kind & port_file) 2324 if (SCHEME_V->load_stack[SCHEME_V->file_i].kind & port_file)
2342 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line += curr_line; 2325 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line += curr_line;
2343#endif 2326#endif
2344 2327
2345 if (c != EOF)
2346 {
2347 backchar (SCHEME_A_ c); 2328 backchar (SCHEME_A_ c);
2348 return 1; 2329 return 1;
2349 }
2350 else
2351 return EOF;
2352} 2330}
2353 2331
2354/* get token */ 2332/* get token */
2355static int 2333static int
2356token (SCHEME_P) 2334token (SCHEME_P)
… …
2372 return TOK_RPAREN; 2350 return TOK_RPAREN;
2373 2351
2374 case '.': 2352 case '.':
2375 c = inchar (SCHEME_A); 2353 c = inchar (SCHEME_A);
2376 2354
2377 if (is_one_of (" \n\t", c)) 2355 if (is_one_of (WHITESPACE, c))
2378 return TOK_DOT; 2356 return TOK_DOT;
2379 else 2357 else
2380 { 2358 {
2381 //TODO: ungetc twice in a row is not supported in C
2382 backchar (SCHEME_A_ c); 2359 backchar (SCHEME_A_ c);
2383 backchar (SCHEME_A_ '.');
2384 return TOK_ATOM; 2360 return TOK_DOTATOM;
2385 } 2361 }
2362
2363 case '|':
2364 return TOK_STRATOM;
2386 2365
2387 case '\'': 2366 case '\'':
2388 return TOK_QUOTE; 2367 return TOK_QUOTE;
2389 2368
2390 case ';': 2369 case ';':
… …
2522 } 2501 }
2523 2502
2524 putcharacter (SCHEME_A_ '"'); 2503 putcharacter (SCHEME_A_ '"');
2525} 2504}
2526 2505
2527
2528/* print atoms */ 2506/* print atoms */
2529static void 2507static void
2530printatom (SCHEME_P_ pointer l, int f) 2508printatom (SCHEME_P_ pointer l, int f)
2531{ 2509{
2532 char *p; 2510 char *p;
2533 int len; 2511 int len;
2534 2512
2535 atom2str (SCHEME_A_ l, f, &p, &len); 2513 atom2str (SCHEME_A_ l, f, &p, &len);
2536 putchars (SCHEME_A_ p, len); 2514 putchars (SCHEME_A_ p, len);
2537} 2515}
2538
2539 2516
2540/* Uses internal buffer unless string pointer is already available */ 2517/* Uses internal buffer unless string pointer is already available */
2541static void 2518static void
2542atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen) 2519atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen)
2543{ 2520{
… …
2557 { 2534 {
2558 p = SCHEME_V->strbuff; 2535 p = SCHEME_V->strbuff;
2559 2536
2560 if (f <= 1 || f == 10) /* f is the base for numbers if > 1 */ 2537 if (f <= 1 || f == 10) /* f is the base for numbers if > 1 */
2561 { 2538 {
2562 if (num_is_integer (l)) 2539 if (is_integer (l))
2563 xnum (p, ivalue_unchecked (l)); 2540 xnum (p, ivalue_unchecked (l));
2564#if USE_REAL 2541#if USE_REAL
2565 else 2542 else
2566 { 2543 {
2567 snprintf (p, STRBUFFSIZE, "%.10g", rvalue_unchecked (l)); 2544 snprintf (p, STRBUFFSIZE, "%.10g", rvalue_unchecked (l));
… …
2704#endif 2681#endif
2705 } 2682 }
2706 else if (is_continuation (l)) 2683 else if (is_continuation (l))
2707 p = "#<CONTINUATION>"; 2684 p = "#<CONTINUATION>";
2708 else 2685 else
2686 {
2687#if USE_PRINTF
2688 p = SCHEME_V->strbuff;
2689 snprintf (p, STRBUFFSIZE, "#<ERROR %x>", (int)typeflag (l));
2690#else
2709 p = "#<ERROR>"; 2691 p = "#<ERROR>";
2692#endif
2693 }
2710 2694
2711 *pp = p; 2695 *pp = p;
2712 *plen = strlen (p); 2696 *plen = strlen (p);
2713} 2697}
2714 2698
… …
2822 return 0; 2806 return 0;
2823 } 2807 }
2824 else if (is_number (a)) 2808 else if (is_number (a))
2825 { 2809 {
2826 if (is_number (b)) 2810 if (is_number (b))
2827 if (num_is_integer (a) == num_is_integer (b))
2828 return num_eq (nvalue (a), nvalue (b)); 2811 return num_cmp (nvalue (a), nvalue (b)) == 0;
2829 2812
2830 return 0; 2813 return 0;
2831 } 2814 }
2832 else if (is_character (a)) 2815 else if (is_character (a))
2833 { 2816 {
… …
2859/* () is #t in R5RS */ 2842/* () is #t in R5RS */
2860#define is_true(p) ((p) != S_F) 2843#define is_true(p) ((p) != S_F)
2861#define is_false(p) ((p) == S_F) 2844#define is_false(p) ((p) == S_F)
2862 2845
2863/* ========== Environment implementation ========== */ 2846/* ========== 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 2847
2880#ifndef USE_ALIST_ENV 2848#ifndef USE_ALIST_ENV
2881 2849
2882/* 2850/*
2883 * In this implementation, each frame of the environment may be 2851 * In this implementation, each frame of the environment may be
… …
2900 2868
2901 SCHEME_V->envir = immutable_cons (new_frame, old_env); 2869 SCHEME_V->envir = immutable_cons (new_frame, old_env);
2902 setenvironment (SCHEME_V->envir); 2870 setenvironment (SCHEME_V->envir);
2903} 2871}
2904 2872
2905static INLINE void 2873static uint32_t
2874sym_hash (pointer sym, uint32_t size)
2875{
2876 uintptr_t ptr = (uintptr_t)sym;
2877
2878#if 0
2879 /* table size is prime, so why mix */
2880 ptr += ptr >> 32;
2881 ptr += ptr >> 16;
2882 ptr += ptr >> 8;
2883#endif
2884
2885 return ptr % size;
2886}
2887
2888ecb_inline void
2906new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) 2889new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
2907{ 2890{
2908 pointer slot = immutable_cons (variable, value); 2891 pointer slot = immutable_cons (variable, value);
2909 2892
2910 if (is_vector (car (env))) 2893 if (is_vector (car (env)))
2911 { 2894 {
2912 int location = hash_fn (symname (variable), veclength (car (env))); 2895 int location = sym_hash (variable, veclength (car (env)));
2913
2914 set_vector_elem (car (env), location, immutable_cons (slot, vector_elem (car (env), location))); 2896 vector_set (car (env), location, immutable_cons (slot, vector_get (car (env), location)));
2915 } 2897 }
2916 else 2898 else
2917 set_car (env, immutable_cons (slot, car (env))); 2899 set_car (env, immutable_cons (slot, car (env)));
2918} 2900}
2919 2901
2920static pointer 2902static pointer
2921find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all) 2903find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all)
2922{ 2904{
2923 pointer x, y; 2905 pointer x, y;
2924 int location;
2925 2906
2926 for (x = env; x != NIL; x = cdr (x)) 2907 for (x = env; x != NIL; x = cdr (x))
2927 { 2908 {
2928 if (is_vector (car (x))) 2909 if (is_vector (car (x)))
2929 { 2910 {
2930 location = hash_fn (symname (hdl), veclength (car (x))); 2911 int location = sym_hash (hdl, veclength (car (x)));
2931 y = vector_elem (car (x), location); 2912 y = vector_get (car (x), location);
2932 } 2913 }
2933 else 2914 else
2934 y = car (x); 2915 y = car (x);
2935 2916
2936 for (; y != NIL; y = cdr (y)) 2917 for (; y != NIL; y = cdr (y))
2937 if (caar (y) == hdl) 2918 if (caar (y) == hdl)
2938 break; 2919 break;
2939 2920
2940 if (y != NIL) 2921 if (y != NIL)
2922 return car (y);
2923
2924 if (!all)
2941 break; 2925 break;
2942
2943 if (!all)
2944 return NIL;
2945 } 2926 }
2946
2947 if (x != NIL)
2948 return car (y);
2949 2927
2950 return NIL; 2928 return NIL;
2951} 2929}
2952 2930
2953#else /* USE_ALIST_ENV */ 2931#else /* USE_ALIST_ENV */
2954 2932
2955static INLINE void 2933ecb_inline void
2956new_frame_in_env (SCHEME_P_ pointer old_env) 2934new_frame_in_env (SCHEME_P_ pointer old_env)
2957{ 2935{
2958 SCHEME_V->envir = immutable_cons (NIL, old_env); 2936 SCHEME_V->envir = immutable_cons (NIL, old_env);
2959 setenvironment (SCHEME_V->envir); 2937 setenvironment (SCHEME_V->envir);
2960} 2938}
2961 2939
2962static INLINE void 2940ecb_inline void
2963new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) 2941new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
2964{ 2942{
2965 set_car (env, immutable_cons (immutable_cons (variable, value), car (env))); 2943 set_car (env, immutable_cons (immutable_cons (variable, value), car (env)));
2966} 2944}
2967 2945
… …
2975 for (y = car (x); y != NIL; y = cdr (y)) 2953 for (y = car (x); y != NIL; y = cdr (y))
2976 if (caar (y) == hdl) 2954 if (caar (y) == hdl)
2977 break; 2955 break;
2978 2956
2979 if (y != NIL) 2957 if (y != NIL)
2958 return car (y);
2980 break; 2959 break;
2981 2960
2982 if (!all) 2961 if (!all)
2983 return NIL; 2962 break;
2984 } 2963 }
2985
2986 if (x != NIL)
2987 return car (y);
2988 2964
2989 return NIL; 2965 return NIL;
2990} 2966}
2991 2967
2992#endif /* USE_ALIST_ENV else */ 2968#endif /* USE_ALIST_ENV else */
2993 2969
2994static INLINE void 2970ecb_inline void
2995new_slot_in_env (SCHEME_P_ pointer variable, pointer value) 2971new_slot_in_env (SCHEME_P_ pointer variable, pointer value)
2996{ 2972{
2973 assert (is_symbol (variable));//TODO: bug in current-ws/OP_LET2
2997 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value); 2974 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value);
2998} 2975}
2999 2976
3000static INLINE void 2977ecb_inline void
3001set_slot_in_env (SCHEME_P_ pointer slot, pointer value) 2978set_slot_in_env (SCHEME_P_ pointer slot, pointer value)
3002{ 2979{
3003 set_cdr (slot, value); 2980 set_cdr (slot, value);
3004} 2981}
3005 2982
3006static INLINE pointer 2983ecb_inline pointer
3007slot_value_in_env (pointer slot) 2984slot_value_in_env (pointer slot)
3008{ 2985{
3009 return cdr (slot); 2986 return cdr (slot);
3010} 2987}
3011 2988
3012/* ========== Evaluation Cycle ========== */ 2989/* ========== Evaluation Cycle ========== */
3013 2990
3014static pointer 2991static int
3015xError_1 (SCHEME_P_ const char *s, pointer a) 2992xError_1 (SCHEME_P_ const char *s, pointer a)
3016{ 2993{
3017#if USE_ERROR_HOOK 2994#if USE_ERROR_HOOK
3018 pointer x; 2995 pointer x;
3019 pointer hdl = SCHEME_V->ERROR_HOOK; 2996 pointer hdl = SCHEME_V->ERROR_HOOK;
… …
3054 code = cons (mk_string (SCHEME_A_ s), code); 3031 code = cons (mk_string (SCHEME_A_ s), code);
3055 setimmutable (car (code)); 3032 setimmutable (car (code));
3056 SCHEME_V->code = cons (slot_value_in_env (x), code); 3033 SCHEME_V->code = cons (slot_value_in_env (x), code);
3057 SCHEME_V->op = OP_EVAL; 3034 SCHEME_V->op = OP_EVAL;
3058 3035
3059 return S_T; 3036 return 0;
3060 } 3037 }
3061#endif 3038#endif
3062 3039
3063 if (a) 3040 if (a)
3064 SCHEME_V->args = cons (a, NIL); 3041 SCHEME_V->args = cons (a, NIL);
… …
3066 SCHEME_V->args = NIL; 3043 SCHEME_V->args = NIL;
3067 3044
3068 SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args); 3045 SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args);
3069 setimmutable (car (SCHEME_V->args)); 3046 setimmutable (car (SCHEME_V->args));
3070 SCHEME_V->op = OP_ERR0; 3047 SCHEME_V->op = OP_ERR0;
3048
3071 return S_T; 3049 return 0;
3072} 3050}
3073 3051
3074#define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a) 3052#define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a)
3075#define Error_0(s) Error_1 (s, 0) 3053#define Error_0(s) Error_1 (s, 0)
3076 3054
3077/* Too small to turn into function */ 3055/* Too small to turn into function */
3078#define BEGIN do { 3056#define BEGIN do {
3079#define END } while (0) 3057#define END } while (0)
3080#define s_goto(a) BEGIN \ 3058#define s_goto(a) BEGIN \
3081 SCHEME_V->op = a; \ 3059 SCHEME_V->op = a; \
3082 return S_T; END 3060 return 0; END
3083 3061
3084#define s_return(a) return xs_return (SCHEME_A_ a) 3062#define s_return(a) return xs_return (SCHEME_A_ a)
3085 3063
3086#ifndef USE_SCHEME_STACK 3064#ifndef USE_SCHEME_STACK
3087 3065
… …
3112 next_frame = SCHEME_V->dump_base + nframes; 3090 next_frame = SCHEME_V->dump_base + nframes;
3113 3091
3114 next_frame->op = op; 3092 next_frame->op = op;
3115 next_frame->args = args; 3093 next_frame->args = args;
3116 next_frame->envir = SCHEME_V->envir; 3094 next_frame->envir = SCHEME_V->envir;
3117 next_frame->code = code; 3095 next_frame->code = code;
3118 3096
3119 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1); 3097 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1);
3120} 3098}
3121 3099
3122static pointer 3100static int
3123xs_return (SCHEME_P_ pointer a) 3101xs_return (SCHEME_P_ pointer a)
3124{ 3102{
3125 int nframes = (uintptr_t)SCHEME_V->dump; 3103 int nframes = (uintptr_t)SCHEME_V->dump;
3126 struct dump_stack_frame *frame; 3104 struct dump_stack_frame *frame;
3127 3105
3128 SCHEME_V->value = a; 3106 SCHEME_V->value = a;
3129 3107
3130 if (nframes <= 0) 3108 if (nframes <= 0)
3131 return NIL; 3109 return -1;
3132 3110
3133 frame = &SCHEME_V->dump_base[--nframes]; 3111 frame = &SCHEME_V->dump_base[--nframes];
3134 SCHEME_V->op = frame->op; 3112 SCHEME_V->op = frame->op;
3135 SCHEME_V->args = frame->args; 3113 SCHEME_V->args = frame->args;
3136 SCHEME_V->envir = frame->envir; 3114 SCHEME_V->envir = frame->envir;
3137 SCHEME_V->code = frame->code; 3115 SCHEME_V->code = frame->code;
3138 SCHEME_V->dump = (pointer)(uintptr_t)nframes; 3116 SCHEME_V->dump = (pointer)(uintptr_t)nframes;
3139 3117
3140 return S_T; 3118 return 0;
3141} 3119}
3142 3120
3143static INLINE void 3121ecb_inline void
3144dump_stack_reset (SCHEME_P) 3122dump_stack_reset (SCHEME_P)
3145{ 3123{
3146 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */ 3124 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */
3147 SCHEME_V->dump = (pointer)+0; 3125 SCHEME_V->dump = (pointer)+0;
3148} 3126}
3149 3127
3150static INLINE void 3128ecb_inline void
3151dump_stack_initialize (SCHEME_P) 3129dump_stack_initialize (SCHEME_P)
3152{ 3130{
3153 SCHEME_V->dump_size = 0; 3131 SCHEME_V->dump_size = 0;
3154 SCHEME_V->dump_base = 0; 3132 SCHEME_V->dump_base = 0;
3155 dump_stack_reset (SCHEME_A); 3133 dump_stack_reset (SCHEME_A);
… …
3208 int i = 0; 3186 int i = 0;
3209 struct dump_stack_frame *frame = SCHEME_V->dump_base; 3187 struct dump_stack_frame *frame = SCHEME_V->dump_base;
3210 3188
3211 while (cont != NIL) 3189 while (cont != NIL)
3212 { 3190 {
3213 frame->op = ivalue (car (cont)); cont = cdr (cont); 3191 frame->op = ivalue_unchecked (car (cont)); cont = cdr (cont);
3214 frame->args = car (cont) ; cont = cdr (cont); 3192 frame->args = car (cont) ; cont = cdr (cont);
3215 frame->envir = car (cont) ; cont = cdr (cont); 3193 frame->envir = car (cont) ; cont = cdr (cont);
3216 frame->code = car (cont) ; cont = cdr (cont); 3194 frame->code = car (cont) ; cont = cdr (cont);
3217 3195
3218 ++frame; 3196 ++frame;
3219 ++i; 3197 ++i;
3220 } 3198 }
3221 3199
3222 SCHEME_V->dump = (pointer)(uintptr_t)i; 3200 SCHEME_V->dump = (pointer)(uintptr_t)i;
3223} 3201}
3224 3202
3225#else 3203#else
3226 3204
3227static INLINE void 3205ecb_inline void
3228dump_stack_reset (SCHEME_P) 3206dump_stack_reset (SCHEME_P)
3229{ 3207{
3230 SCHEME_V->dump = NIL; 3208 SCHEME_V->dump = NIL;
3231} 3209}
3232 3210
3233static INLINE void 3211ecb_inline void
3234dump_stack_initialize (SCHEME_P) 3212dump_stack_initialize (SCHEME_P)
3235{ 3213{
3236 dump_stack_reset (SCHEME_A); 3214 dump_stack_reset (SCHEME_A);
3237} 3215}
3238 3216
… …
3240dump_stack_free (SCHEME_P) 3218dump_stack_free (SCHEME_P)
3241{ 3219{
3242 SCHEME_V->dump = NIL; 3220 SCHEME_V->dump = NIL;
3243} 3221}
3244 3222
3245static pointer 3223static int
3246xs_return (SCHEME_P_ pointer a) 3224xs_return (SCHEME_P_ pointer a)
3247{ 3225{
3248 pointer dump = SCHEME_V->dump; 3226 pointer dump = SCHEME_V->dump;
3249 3227
3250 SCHEME_V->value = a; 3228 SCHEME_V->value = a;
3251 3229
3252 if (dump == NIL) 3230 if (dump == NIL)
3253 return NIL; 3231 return -1;
3254 3232
3255 SCHEME_V->op = ivalue (car (dump)); dump = cdr (dump); 3233 SCHEME_V->op = ivalue_unchecked (car (dump)); dump = cdr (dump);
3256 SCHEME_V->args = car (dump) ; dump = cdr (dump); 3234 SCHEME_V->args = car (dump) ; dump = cdr (dump);
3257 SCHEME_V->envir = car (dump) ; dump = cdr (dump); 3235 SCHEME_V->envir = car (dump) ; dump = cdr (dump);
3258 SCHEME_V->code = car (dump) ; dump = cdr (dump); 3236 SCHEME_V->code = car (dump) ; dump = cdr (dump);
3259 3237
3260 SCHEME_V->dump = dump; 3238 SCHEME_V->dump = dump;
3261 3239
3262 return S_T; 3240 return 0;
3263} 3241}
3264 3242
3265static void 3243static void
3266s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code) 3244s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code)
3267{ 3245{
… …
3292 3270
3293#endif 3271#endif
3294 3272
3295#define s_retbool(tf) s_return ((tf) ? S_T : S_F) 3273#define s_retbool(tf) s_return ((tf) ? S_T : S_F)
3296 3274
3275#if EXPERIMENT
3297static pointer 3276static int
3277debug (SCHEME_P_ int indent, pointer x)
3278{
3279 int c;
3280
3281 if (is_syntax (x))
3282 {
3283 printf ("%*ssyntax<%s,%d>\n", indent, "", syntaxname(x),syntaxnum(x));
3284 return 8 + 8;
3285 }
3286
3287 if (x == NIL)
3288 {
3289 printf ("%*sNIL\n", indent, "");
3290 return 3;
3291 }
3292
3293 switch (type (x))
3294 {
3295 case T_INTEGER:
3296 printf ("%*sI<%d>%p\n", indent, "", (int)ivalue_unchecked (x), x);
3297 return 32+8;
3298
3299 case T_SYMBOL:
3300 printf ("%*sS<%s>\n", indent, "", symname (x));
3301 return 24+8;
3302
3303 case T_CLOSURE:
3304 printf ("%*sS<%s>\n", indent, "", "closure");
3305 debug (SCHEME_A_ indent + 3, cdr(x));
3306 return 32 + debug (SCHEME_A_ indent + 3, car (x));
3307
3308 case T_PAIR:
3309 printf ("%*spair %p %p\n", indent, "", car(x),cdr(x));
3310 c = debug (SCHEME_A_ indent + 3, car (x));
3311 c += debug (SCHEME_A_ indent + 3, cdr (x));
3312 return c + 1;
3313
3314 case T_PORT:
3315 printf ("%*sS<%s>\n", indent, "", "port");
3316 return 24+8;
3317
3318 case T_VECTOR:
3319 printf ("%*sS<%s>\n", indent, "", "vector");
3320 return 24+8;
3321
3322 case T_ENVIRONMENT:
3323 printf ("%*sS<%s>\n", indent, "", "environment");
3324 return 0 + debug (SCHEME_A_ indent + 3, car (x));
3325
3326 default:
3327 printf ("unhandled type %d\n", type (x));
3328 break;
3329 }
3330}
3331#endif
3332
3333static int
3298opexe_0 (SCHEME_P_ enum scheme_opcodes op) 3334opexe_0 (SCHEME_P_ enum scheme_opcodes op)
3299{ 3335{
3336 pointer args = SCHEME_V->args;
3300 pointer x, y; 3337 pointer x, y;
3301 3338
3302 switch (op) 3339 switch (op)
3303 { 3340 {
3341#if EXPERIMENT //D
3342 case OP_DEBUG:
3343 printf ("len = %d\n", debug (SCHEME_A_ 0, args) / 8);
3344 printf ("\n");
3345 s_return (S_T);
3346#endif
3304 case OP_LOAD: /* load */ 3347 case OP_LOAD: /* load */
3305 if (file_interactive (SCHEME_A)) 3348 if (file_interactive (SCHEME_A))
3306 { 3349 {
3307 xwrstr ("Loading "); xwrstr (strvalue (car (SCHEME_V->args))); xwrstr ("\n"); 3350 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))); 3351 //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args)));
3309 } 3352 }
3310 3353
3311 if (!file_push (SCHEME_A_ strvalue (car (SCHEME_V->args)))) 3354 if (!file_push (SCHEME_A_ strvalue (car (args))))
3312 Error_1 ("unable to open", car (SCHEME_V->args)); 3355 Error_1 ("unable to open", car (args));
3313 else 3356 else
3314 { 3357 {
3315 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i); 3358 SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i);
3316 s_goto (OP_T0LVL); 3359 s_goto (OP_T0LVL);
3317 } 3360 }
… …
3391 case OP_EVAL: /* main part of evaluation */ 3434 case OP_EVAL: /* main part of evaluation */
3392#if USE_TRACING 3435#if USE_TRACING
3393 if (SCHEME_V->tracing) 3436 if (SCHEME_V->tracing)
3394 { 3437 {
3395 /*s_save(SCHEME_A_ OP_VALUEPRINT,NIL,NIL); */ 3438 /*s_save(SCHEME_A_ OP_VALUEPRINT,NIL,NIL); */
3396 s_save (SCHEME_A_ OP_REAL_EVAL, SCHEME_V->args, SCHEME_V->code); 3439 s_save (SCHEME_A_ OP_REAL_EVAL, args, SCHEME_V->code);
3397 SCHEME_V->args = SCHEME_V->code; 3440 SCHEME_V->args = SCHEME_V->code;
3398 putstr (SCHEME_A_ "\nEval: "); 3441 putstr (SCHEME_A_ "\nEval: ");
3399 s_goto (OP_P0LIST); 3442 s_goto (OP_P0LIST);
3400 } 3443 }
3401 3444
… …
3431 } 3474 }
3432 else 3475 else
3433 s_return (SCHEME_V->code); 3476 s_return (SCHEME_V->code);
3434 3477
3435 case OP_E0ARGS: /* eval arguments */ 3478 case OP_E0ARGS: /* eval arguments */
3436 if (is_macro (SCHEME_V->value)) /* macro expansion */ 3479 if (ecb_expect_false (is_macro (SCHEME_V->value))) /* macro expansion */
3437 { 3480 {
3438 s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL); 3481 s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL);
3439 SCHEME_V->args = cons (SCHEME_V->code, NIL); 3482 SCHEME_V->args = cons (SCHEME_V->code, NIL);
3440 SCHEME_V->code = SCHEME_V->value; 3483 SCHEME_V->code = SCHEME_V->value;
3441 s_goto (OP_APPLY); 3484 s_goto (OP_APPLY);
… …
3445 SCHEME_V->code = cdr (SCHEME_V->code); 3488 SCHEME_V->code = cdr (SCHEME_V->code);
3446 s_goto (OP_E1ARGS); 3489 s_goto (OP_E1ARGS);
3447 } 3490 }
3448 3491
3449 case OP_E1ARGS: /* eval arguments */ 3492 case OP_E1ARGS: /* eval arguments */
3450 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 3493 args = cons (SCHEME_V->value, args);
3451 3494
3452 if (is_pair (SCHEME_V->code)) /* continue */ 3495 if (is_pair (SCHEME_V->code)) /* continue */
3453 { 3496 {
3454 s_save (SCHEME_A_ OP_E1ARGS, SCHEME_V->args, cdr (SCHEME_V->code)); 3497 s_save (SCHEME_A_ OP_E1ARGS, args, cdr (SCHEME_V->code));
3455 SCHEME_V->code = car (SCHEME_V->code); 3498 SCHEME_V->code = car (SCHEME_V->code);
3456 SCHEME_V->args = NIL; 3499 SCHEME_V->args = NIL;
3457 s_goto (OP_EVAL); 3500 s_goto (OP_EVAL);
3458 } 3501 }
3459 else /* end */ 3502 else /* end */
3460 { 3503 {
3461 SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); 3504 args = reverse_in_place (SCHEME_A_ NIL, args);
3462 SCHEME_V->code = car (SCHEME_V->args); 3505 SCHEME_V->code = car (args);
3463 SCHEME_V->args = cdr (SCHEME_V->args); 3506 SCHEME_V->args = cdr (args);
3464 s_goto (OP_APPLY); 3507 s_goto (OP_APPLY);
3465 } 3508 }
3466 3509
3467#if USE_TRACING 3510#if USE_TRACING
3468 3511
3469 case OP_TRACING: 3512 case OP_TRACING:
3470 { 3513 {
3471 int tr = SCHEME_V->tracing; 3514 int tr = SCHEME_V->tracing;
3472 3515
3473 SCHEME_V->tracing = ivalue (car (SCHEME_V->args)); 3516 SCHEME_V->tracing = ivalue_unchecked (car (args));
3474 s_return (mk_integer (SCHEME_A_ tr)); 3517 s_return (mk_integer (SCHEME_A_ tr));
3475 } 3518 }
3476 3519
3477#endif 3520#endif
3478 3521
3479 case OP_APPLY: /* apply 'code' to 'args' */ 3522 case OP_APPLY: /* apply 'code' to 'args' */
3480#if USE_TRACING 3523#if USE_TRACING
3481 if (SCHEME_V->tracing) 3524 if (SCHEME_V->tracing)
3482 { 3525 {
3483 s_save (SCHEME_A_ OP_REAL_APPLY, SCHEME_V->args, SCHEME_V->code); 3526 s_save (SCHEME_A_ OP_REAL_APPLY, args, SCHEME_V->code);
3484 SCHEME_V->print_flag = 1; 3527 SCHEME_V->print_flag = 1;
3485 /* SCHEME_V->args=cons(SCHEME_V->code,SCHEME_V->args); */ 3528 /* args=cons(SCHEME_V->code,args); */
3486 putstr (SCHEME_A_ "\nApply to: "); 3529 putstr (SCHEME_A_ "\nApply to: ");
3487 s_goto (OP_P0LIST); 3530 s_goto (OP_P0LIST);
3488 } 3531 }
3489 3532
3490 /* fall through */ 3533 /* fall through */
3491 3534
3492 case OP_REAL_APPLY: 3535 case OP_REAL_APPLY:
3493#endif 3536#endif
3494 if (is_proc (SCHEME_V->code)) 3537 if (is_proc (SCHEME_V->code))
3495 {
3496 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */ 3538 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */
3497 }
3498 else if (is_foreign (SCHEME_V->code)) 3539 else if (is_foreign (SCHEME_V->code))
3499 { 3540 {
3500 /* Keep nested calls from GC'ing the arglist */ 3541 /* Keep nested calls from GC'ing the arglist */
3501 push_recent_alloc (SCHEME_A_ SCHEME_V->args, NIL); 3542 push_recent_alloc (SCHEME_A_ args, NIL);
3502 x = SCHEME_V->code->object.ff (SCHEME_A_ SCHEME_V->args); 3543 x = SCHEME_V->code->object.ff (SCHEME_A_ args);
3503 3544
3504 s_return (x); 3545 s_return (x);
3505 } 3546 }
3506 else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */ 3547 else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */
3507 { 3548 {
3508 /* Should not accept promise */ 3549 /* Should not accept promise */
3509 /* make environment */ 3550 /* make environment */
3510 new_frame_in_env (SCHEME_A_ closure_env (SCHEME_V->code)); 3551 new_frame_in_env (SCHEME_A_ closure_env (SCHEME_V->code));
3511 3552
3512 for (x = car (closure_code (SCHEME_V->code)), y = SCHEME_V->args; is_pair (x); x = cdr (x), y = cdr (y)) 3553 for (x = car (closure_code (SCHEME_V->code)), y = args; is_pair (x); x = cdr (x), y = cdr (y))
3513 { 3554 {
3514 if (y == NIL) 3555 if (y == NIL)
3515 Error_0 ("not enough arguments"); 3556 Error_0 ("not enough arguments");
3516 else 3557 else
3517 new_slot_in_env (SCHEME_A_ car (x), car (y)); 3558 new_slot_in_env (SCHEME_A_ car (x), car (y));
… …
3535 s_goto (OP_BEGIN); 3576 s_goto (OP_BEGIN);
3536 } 3577 }
3537 else if (is_continuation (SCHEME_V->code)) /* CONTINUATION */ 3578 else if (is_continuation (SCHEME_V->code)) /* CONTINUATION */
3538 { 3579 {
3539 ss_set_cont (SCHEME_A_ cont_dump (SCHEME_V->code)); 3580 ss_set_cont (SCHEME_A_ cont_dump (SCHEME_V->code));
3540 s_return (SCHEME_V->args != NIL ? car (SCHEME_V->args) : NIL); 3581 s_return (args != NIL ? car (args) : NIL);
3541 } 3582 }
3542 else 3583 else
3543 Error_0 ("illegal function"); 3584 Error_0 ("illegal function");
3544 3585
3545 case OP_DOMACRO: /* do macro */ 3586 case OP_DOMACRO: /* do macro */
3546 SCHEME_V->code = SCHEME_V->value; 3587 SCHEME_V->code = SCHEME_V->value;
3547 s_goto (OP_EVAL); 3588 s_goto (OP_EVAL);
3548
3549#if 1
3550 3589
3551 case OP_LAMBDA: /* lambda */ 3590 case OP_LAMBDA: /* lambda */
3552 /* If the hook is defined, apply it to SCHEME_V->code, otherwise 3591 /* If the hook is defined, apply it to SCHEME_V->code, otherwise
3553 set SCHEME_V->value fall thru */ 3592 set SCHEME_V->value fall thru */
3554 { 3593 {
3555 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1); 3594 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1);
3556 3595
3557 if (f != NIL) 3596 if (f != NIL)
3558 { 3597 {
3559 s_save (SCHEME_A_ OP_LAMBDA1, SCHEME_V->args, SCHEME_V->code); 3598 s_save (SCHEME_A_ OP_LAMBDA1, args, SCHEME_V->code);
3560 SCHEME_V->args = cons (SCHEME_V->code, NIL); 3599 SCHEME_V->args = cons (SCHEME_V->code, NIL);
3561 SCHEME_V->code = slot_value_in_env (f); 3600 SCHEME_V->code = slot_value_in_env (f);
3562 s_goto (OP_APPLY); 3601 s_goto (OP_APPLY);
3563 } 3602 }
3564 3603
3565 SCHEME_V->value = SCHEME_V->code; 3604 SCHEME_V->value = SCHEME_V->code;
3566 /* Fallthru */
3567 } 3605 }
3606 /* Fallthru */
3568 3607
3569 case OP_LAMBDA1: 3608 case OP_LAMBDA1:
3570 s_return (mk_closure (SCHEME_A_ SCHEME_V->value, SCHEME_V->envir)); 3609 s_return (mk_closure (SCHEME_A_ SCHEME_V->value, SCHEME_V->envir));
3571 3610
3572#else
3573
3574 case OP_LAMBDA: /* lambda */
3575 s_return (mk_closure (SCHEME_A_ SCHEME_V->code, SCHEME_V->envir));
3576
3577#endif
3578
3579 case OP_MKCLOSURE: /* make-closure */ 3611 case OP_MKCLOSURE: /* make-closure */
3580 x = car (SCHEME_V->args); 3612 x = car (args);
3581 3613
3582 if (car (x) == SCHEME_V->LAMBDA) 3614 if (car (x) == SCHEME_V->LAMBDA)
3583 x = cdr (x); 3615 x = cdr (x);
3584 3616
3585 if (cdr (SCHEME_V->args) == NIL) 3617 if (cdr (args) == NIL)
3586 y = SCHEME_V->envir; 3618 y = SCHEME_V->envir;
3587 else 3619 else
3588 y = cadr (SCHEME_V->args); 3620 y = cadr (args);
3589 3621
3590 s_return (mk_closure (SCHEME_A_ x, y)); 3622 s_return (mk_closure (SCHEME_A_ x, y));
3591 3623
3592 case OP_QUOTE: /* quote */ 3624 case OP_QUOTE: /* quote */
3593 s_return (car (SCHEME_V->code)); 3625 s_return (car (SCHEME_V->code));
… …
3625 3657
3626 3658
3627 case OP_DEFP: /* defined? */ 3659 case OP_DEFP: /* defined? */
3628 x = SCHEME_V->envir; 3660 x = SCHEME_V->envir;
3629 3661
3630 if (cdr (SCHEME_V->args) != NIL) 3662 if (cdr (args) != NIL)
3631 x = cadr (SCHEME_V->args); 3663 x = cadr (args);
3632 3664
3633 s_retbool (find_slot_in_env (SCHEME_A_ x, car (SCHEME_V->args), 1) != NIL); 3665 s_retbool (find_slot_in_env (SCHEME_A_ x, car (args), 1) != NIL);
3634 3666
3635 case OP_SET0: /* set! */ 3667 case OP_SET0: /* set! */
3636 if (is_immutable (car (SCHEME_V->code))) 3668 if (is_immutable (car (SCHEME_V->code)))
3637 Error_1 ("set!: unable to alter immutable variable", car (SCHEME_V->code)); 3669 Error_1 ("set!: unable to alter immutable variable", car (SCHEME_V->code));
3638 3670
… …
3669 3701
3670 case OP_IF1: /* if */ 3702 case OP_IF1: /* if */
3671 if (is_true (SCHEME_V->value)) 3703 if (is_true (SCHEME_V->value))
3672 SCHEME_V->code = car (SCHEME_V->code); 3704 SCHEME_V->code = car (SCHEME_V->code);
3673 else 3705 else
3674 SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because 3706 SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because * car(NIL) = NIL */
3675
3676 * car(NIL) = NIL */
3677 s_goto (OP_EVAL); 3707 s_goto (OP_EVAL);
3678 3708
3679 case OP_LET0: /* let */ 3709 case OP_LET0: /* let */
3680 SCHEME_V->args = NIL; 3710 SCHEME_V->args = NIL;
3681 SCHEME_V->value = SCHEME_V->code; 3711 SCHEME_V->value = SCHEME_V->code;
3682 SCHEME_V->code = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code); 3712 SCHEME_V->code = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code);
3683 s_goto (OP_LET1); 3713 s_goto (OP_LET1);
3684 3714
3685 case OP_LET1: /* let (calculate parameters) */ 3715 case OP_LET1: /* let (calculate parameters) */
3686 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 3716 args = cons (SCHEME_V->value, args);
3687 3717
3688 if (is_pair (SCHEME_V->code)) /* continue */ 3718 if (is_pair (SCHEME_V->code)) /* continue */
3689 { 3719 {
3690 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code))) 3720 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)); 3721 Error_1 ("Bad syntax of binding spec in let :", car (SCHEME_V->code));
3692 3722
3693 s_save (SCHEME_A_ OP_LET1, SCHEME_V->args, cdr (SCHEME_V->code)); 3723 s_save (SCHEME_A_ OP_LET1, args, cdr (SCHEME_V->code));
3694 SCHEME_V->code = cadar (SCHEME_V->code); 3724 SCHEME_V->code = cadar (SCHEME_V->code);
3695 SCHEME_V->args = NIL; 3725 SCHEME_V->args = NIL;
3696 s_goto (OP_EVAL); 3726 s_goto (OP_EVAL);
3697 } 3727 }
3698 else /* end */ 3728 else /* end */
3699 { 3729 {
3700 SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); 3730 args = reverse_in_place (SCHEME_A_ NIL, args);
3701 SCHEME_V->code = car (SCHEME_V->args); 3731 SCHEME_V->code = car (args);
3702 SCHEME_V->args = cdr (SCHEME_V->args); 3732 SCHEME_V->args = cdr (args);
3703 s_goto (OP_LET2); 3733 s_goto (OP_LET2);
3704 } 3734 }
3705 3735
3706 case OP_LET2: /* let */ 3736 case OP_LET2: /* let */
3707 new_frame_in_env (SCHEME_A_ SCHEME_V->envir); 3737 new_frame_in_env (SCHEME_A_ SCHEME_V->envir);
3708 3738
3709 for (x = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code), y = SCHEME_V->args; 3739 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)) 3740 y != NIL; x = cdr (x), y = cdr (y))
3711 new_slot_in_env (SCHEME_A_ caar (x), car (y)); 3741 new_slot_in_env (SCHEME_A_ caar (x), car (y));
3712 3742
3713 if (is_symbol (car (SCHEME_V->code))) /* named let */ 3743 if (is_symbol (car (SCHEME_V->code))) /* named let */
3714 { 3744 {
3715 for (x = cadr (SCHEME_V->code), SCHEME_V->args = NIL; x != NIL; x = cdr (x)) 3745 for (x = cadr (SCHEME_V->code), args = NIL; x != NIL; x = cdr (x))
3716 { 3746 {
3717 if (!is_pair (x)) 3747 if (!is_pair (x))
3718 Error_1 ("Bad syntax of binding in let :", x); 3748 Error_1 ("Bad syntax of binding in let :", x);
3719 3749
3720 if (!is_list (SCHEME_A_ car (x))) 3750 if (!is_list (SCHEME_A_ car (x)))
3721 Error_1 ("Bad syntax of binding in let :", car (x)); 3751 Error_1 ("Bad syntax of binding in let :", car (x));
3722 3752
3723 SCHEME_V->args = cons (caar (x), SCHEME_V->args); 3753 args = cons (caar (x), args);
3724 } 3754 }
3725 3755
3726 x =
3727 mk_closure (SCHEME_A_ cons (reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args), cddr (SCHEME_V->code)), 3756 x = mk_closure (SCHEME_A_ cons (reverse_in_place (SCHEME_A_ NIL, args), cddr (SCHEME_V->code)),
3728 SCHEME_V->envir); 3757 SCHEME_V->envir);
3729 new_slot_in_env (SCHEME_A_ car (SCHEME_V->code), x); 3758 new_slot_in_env (SCHEME_A_ car (SCHEME_V->code), x);
3730 SCHEME_V->code = cddr (SCHEME_V->code); 3759 SCHEME_V->code = cddr (SCHEME_V->code);
3731 SCHEME_V->args = NIL;
3732 } 3760 }
3733 else 3761 else
3734 { 3762 {
3735 SCHEME_V->code = cdr (SCHEME_V->code); 3763 SCHEME_V->code = cdr (SCHEME_V->code);
3764 }
3765
3736 SCHEME_V->args = NIL; 3766 SCHEME_V->args = NIL;
3737 }
3738
3739 s_goto (OP_BEGIN); 3767 s_goto (OP_BEGIN);
3740 3768
3741 case OP_LET0AST: /* let* */ 3769 case OP_LET0AST: /* let* */
3742 if (car (SCHEME_V->code) == NIL) 3770 if (car (SCHEME_V->code) == NIL)
3743 { 3771 {
… …
3761 new_slot_in_env (SCHEME_A_ caar (SCHEME_V->code), SCHEME_V->value); 3789 new_slot_in_env (SCHEME_A_ caar (SCHEME_V->code), SCHEME_V->value);
3762 SCHEME_V->code = cdr (SCHEME_V->code); 3790 SCHEME_V->code = cdr (SCHEME_V->code);
3763 3791
3764 if (is_pair (SCHEME_V->code)) /* continue */ 3792 if (is_pair (SCHEME_V->code)) /* continue */
3765 { 3793 {
3766 s_save (SCHEME_A_ OP_LET2AST, SCHEME_V->args, SCHEME_V->code); 3794 s_save (SCHEME_A_ OP_LET2AST, args, SCHEME_V->code);
3767 SCHEME_V->code = cadar (SCHEME_V->code); 3795 SCHEME_V->code = cadar (SCHEME_V->code);
3768 SCHEME_V->args = NIL; 3796 SCHEME_V->args = NIL;
3769 s_goto (OP_EVAL); 3797 s_goto (OP_EVAL);
3770 } 3798 }
3771 else /* end */ 3799 else /* end */
3772 { 3800 {
3773 SCHEME_V->code = SCHEME_V->args; 3801 SCHEME_V->code = args;
3774 SCHEME_V->args = NIL; 3802 SCHEME_V->args = NIL;
3775 s_goto (OP_BEGIN); 3803 s_goto (OP_BEGIN);
3776 } 3804 }
3777 3805
3778 case OP_LET0REC: /* letrec */ 3806 case OP_LET0REC: /* letrec */
… …
3781 SCHEME_V->value = SCHEME_V->code; 3809 SCHEME_V->value = SCHEME_V->code;
3782 SCHEME_V->code = car (SCHEME_V->code); 3810 SCHEME_V->code = car (SCHEME_V->code);
3783 s_goto (OP_LET1REC); 3811 s_goto (OP_LET1REC);
3784 3812
3785 case OP_LET1REC: /* letrec (calculate parameters) */ 3813 case OP_LET1REC: /* letrec (calculate parameters) */
3786 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 3814 args = cons (SCHEME_V->value, args);
3787 3815
3788 if (is_pair (SCHEME_V->code)) /* continue */ 3816 if (is_pair (SCHEME_V->code)) /* continue */
3789 { 3817 {
3790 if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code))) 3818 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)); 3819 Error_1 ("Bad syntax of binding spec in letrec :", car (SCHEME_V->code));
3792 3820
3793 s_save (SCHEME_A_ OP_LET1REC, SCHEME_V->args, cdr (SCHEME_V->code)); 3821 s_save (SCHEME_A_ OP_LET1REC, args, cdr (SCHEME_V->code));
3794 SCHEME_V->code = cadar (SCHEME_V->code); 3822 SCHEME_V->code = cadar (SCHEME_V->code);
3795 SCHEME_V->args = NIL; 3823 SCHEME_V->args = NIL;
3796 s_goto (OP_EVAL); 3824 s_goto (OP_EVAL);
3797 } 3825 }
3798 else /* end */ 3826 else /* end */
3799 { 3827 {
3800 SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); 3828 args = reverse_in_place (SCHEME_A_ NIL, args);
3801 SCHEME_V->code = car (SCHEME_V->args); 3829 SCHEME_V->code = car (args);
3802 SCHEME_V->args = cdr (SCHEME_V->args); 3830 SCHEME_V->args = cdr (args);
3803 s_goto (OP_LET2REC); 3831 s_goto (OP_LET2REC);
3804 } 3832 }
3805 3833
3806 case OP_LET2REC: /* letrec */ 3834 case OP_LET2REC: /* letrec */
3807 for (x = car (SCHEME_V->code), y = SCHEME_V->args; y != NIL; x = cdr (x), y = cdr (y)) 3835 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)); 3836 new_slot_in_env (SCHEME_A_ caar (x), car (y));
3809 3837
3810 SCHEME_V->code = cdr (SCHEME_V->code); 3838 SCHEME_V->code = cdr (SCHEME_V->code);
3811 SCHEME_V->args = NIL; 3839 SCHEME_V->args = NIL;
3812 s_goto (OP_BEGIN); 3840 s_goto (OP_BEGIN);
… …
3898 s_save (SCHEME_A_ OP_C1STREAM, NIL, cdr (SCHEME_V->code)); 3926 s_save (SCHEME_A_ OP_C1STREAM, NIL, cdr (SCHEME_V->code));
3899 SCHEME_V->code = car (SCHEME_V->code); 3927 SCHEME_V->code = car (SCHEME_V->code);
3900 s_goto (OP_EVAL); 3928 s_goto (OP_EVAL);
3901 3929
3902 case OP_C1STREAM: /* cons-stream */ 3930 case OP_C1STREAM: /* cons-stream */
3903 SCHEME_V->args = SCHEME_V->value; /* save SCHEME_V->value to register SCHEME_V->args for gc */ 3931 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); 3932 x = mk_closure (SCHEME_A_ cons (NIL, SCHEME_V->code), SCHEME_V->envir);
3905 set_typeflag (x, T_PROMISE); 3933 set_typeflag (x, T_PROMISE);
3906 s_return (cons (SCHEME_V->args, x)); 3934 s_return (cons (args, x));
3907 3935
3908 case OP_MACRO0: /* macro */ 3936 case OP_MACRO0: /* macro */
3909 if (is_pair (car (SCHEME_V->code))) 3937 if (is_pair (car (SCHEME_V->code)))
3910 { 3938 {
3911 x = caar (SCHEME_V->code); 3939 x = caar (SCHEME_V->code);
… …
3944 { 3972 {
3945 if (!is_pair (y = caar (x))) 3973 if (!is_pair (y = caar (x)))
3946 break; 3974 break;
3947 3975
3948 for (; y != NIL; y = cdr (y)) 3976 for (; y != NIL; y = cdr (y))
3949 {
3950 if (eqv (car (y), SCHEME_V->value)) 3977 if (eqv (car (y), SCHEME_V->value))
3951 break; 3978 break;
3952 }
3953 3979
3954 if (y != NIL) 3980 if (y != NIL)
3955 break; 3981 break;
3956 } 3982 }
3957 3983
… …
3977 s_goto (OP_BEGIN); 4003 s_goto (OP_BEGIN);
3978 else 4004 else
3979 s_return (NIL); 4005 s_return (NIL);
3980 4006
3981 case OP_PAPPLY: /* apply */ 4007 case OP_PAPPLY: /* apply */
3982 SCHEME_V->code = car (SCHEME_V->args); 4008 SCHEME_V->code = car (args);
3983 SCHEME_V->args = list_star (SCHEME_A_ cdr (SCHEME_V->args)); 4009 SCHEME_V->args = list_star (SCHEME_A_ cdr (args));
3984 /*SCHEME_V->args = cadr(SCHEME_V->args); */ 4010 /*SCHEME_V->args = cadr(args); */
3985 s_goto (OP_APPLY); 4011 s_goto (OP_APPLY);
3986 4012
3987 case OP_PEVAL: /* eval */ 4013 case OP_PEVAL: /* eval */
3988 if (cdr (SCHEME_V->args) != NIL) 4014 if (cdr (args) != NIL)
3989 SCHEME_V->envir = cadr (SCHEME_V->args); 4015 SCHEME_V->envir = cadr (args);
3990 4016
3991 SCHEME_V->code = car (SCHEME_V->args); 4017 SCHEME_V->code = car (args);
3992 s_goto (OP_EVAL); 4018 s_goto (OP_EVAL);
3993 4019
3994 case OP_CONTINUATION: /* call-with-current-continuation */ 4020 case OP_CONTINUATION: /* call-with-current-continuation */
3995 SCHEME_V->code = car (SCHEME_V->args); 4021 SCHEME_V->code = car (args);
3996 SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL); 4022 SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL);
3997 s_goto (OP_APPLY); 4023 s_goto (OP_APPLY);
3998 } 4024 }
3999 4025
4000 return S_T; 4026 if (USE_ERROR_CHECKING) abort ();
4001} 4027}
4002 4028
4003static pointer 4029static int
4004opexe_2 (SCHEME_P_ enum scheme_opcodes op) 4030opexe_1 (SCHEME_P_ enum scheme_opcodes op)
4005{ 4031{
4006 pointer x; 4032 pointer args = SCHEME_V->args;
4033 pointer x = car (args);
4007 num v; 4034 num v;
4008 4035
4036 switch (op)
4037 {
4009#if USE_MATH 4038#if USE_MATH
4010 RVALUE dd;
4011#endif
4012
4013 switch (op)
4014 {
4015#if USE_MATH
4016
4017 case OP_INEX2EX: /* inexact->exact */ 4039 case OP_INEX2EX: /* inexact->exact */
4018 x = car (SCHEME_V->args); 4040 {
4019
4020 if (num_is_integer (x)) 4041 if (is_integer (x))
4021 s_return (x); 4042 s_return (x);
4022 else if (modf (rvalue_unchecked (x), &dd) == 0.0) 4043
4044 RVALUE r = rvalue_unchecked (x);
4045
4046 if (r == (RVALUE)(IVALUE)r)
4023 s_return (mk_integer (SCHEME_A_ ivalue (x))); 4047 s_return (mk_integer (SCHEME_A_ rvalue_unchecked (x)));
4024 else 4048 else
4025 Error_1 ("inexact->exact: not integral:", x); 4049 Error_1 ("inexact->exact: not integral:", x);
4050 }
4026 4051
4027 case OP_EXP:
4028 x = car (SCHEME_V->args);
4029 s_return (mk_real (SCHEME_A_ exp (rvalue (x)))); 4052 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)))); 4053 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)))); 4054 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)))); 4055 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)))); 4056 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)))); 4057 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)))); 4058 case OP_ACOS: s_return (mk_real (SCHEME_A_ acos (rvalue (x))));
4054 4059
4055 case OP_ATAN: 4060 case OP_ATAN:
4056 x = car (SCHEME_V->args);
4057
4058 if (cdr (SCHEME_V->args) == NIL) 4061 if (cdr (args) == NIL)
4059 s_return (mk_real (SCHEME_A_ atan (rvalue (x)))); 4062 s_return (mk_real (SCHEME_A_ atan (rvalue (x))));
4060 else 4063 else
4061 { 4064 {
4062 pointer y = cadr (SCHEME_V->args); 4065 pointer y = cadr (args);
4063
4064 s_return (mk_real (SCHEME_A_ atan2 (rvalue (x), rvalue (y)))); 4066 s_return (mk_real (SCHEME_A_ atan2 (rvalue (x), rvalue (y))));
4065 } 4067 }
4066 4068
4067 case OP_SQRT: 4069 case OP_SQRT:
4068 x = car (SCHEME_V->args);
4069 s_return (mk_real (SCHEME_A_ sqrt (rvalue (x)))); 4070 s_return (mk_real (SCHEME_A_ sqrt (rvalue (x))));
4070 4071
4071 case OP_EXPT: 4072 case OP_EXPT:
4072 { 4073 {
4073 RVALUE result; 4074 RVALUE result;
4074 int real_result = 1; 4075 int real_result = 1;
4075 pointer y = cadr (SCHEME_V->args); 4076 pointer y = cadr (args);
4076 4077
4077 x = car (SCHEME_V->args);
4078
4079 if (num_is_integer (x) && num_is_integer (y)) 4078 if (is_integer (x) && is_integer (y))
4080 real_result = 0; 4079 real_result = 0;
4081 4080
4082 /* This 'if' is an R5RS compatibility fix. */ 4081 /* This 'if' is an R5RS compatibility fix. */
4083 /* NOTE: Remove this 'if' fix for R6RS. */ 4082 /* NOTE: Remove this 'if' fix for R6RS. */
4084 if (rvalue (x) == 0 && rvalue (y) < 0) 4083 if (rvalue (x) == 0 && rvalue (y) < 0)
4085 result = 0.0; 4084 result = 0;
4086 else 4085 else
4087 result = pow (rvalue (x), rvalue (y)); 4086 result = pow (rvalue (x), rvalue (y));
4088 4087
4089 /* Before returning integer result make sure we can. */ 4088 /* Before returning integer result make sure we can. */
4090 /* If the test fails, result is too big for integer. */ 4089 /* If the test fails, result is too big for integer. */
4091 if (!real_result) 4090 if (!real_result)
4092 { 4091 {
4093 long result_as_long = (long) result; 4092 long result_as_long = result;
4094 4093
4095 if (result != (RVALUE) result_as_long) 4094 if (result != result_as_long)
4096 real_result = 1; 4095 real_result = 1;
4097 } 4096 }
4098 4097
4099 if (real_result) 4098 if (real_result)
4100 s_return (mk_real (SCHEME_A_ result)); 4099 s_return (mk_real (SCHEME_A_ result));
4101 else 4100 else
4102 s_return (mk_integer (SCHEME_A_ result)); 4101 s_return (mk_integer (SCHEME_A_ result));
4103 } 4102 }
4104 4103
4105 case OP_FLOOR:
4106 x = car (SCHEME_V->args);
4107 s_return (mk_real (SCHEME_A_ floor (rvalue (x)))); 4104 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)))); 4105 case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x))));
4112 4106
4113 case OP_TRUNCATE: 4107 case OP_TRUNCATE:
4114 { 4108 {
4115 RVALUE rvalue_of_x; 4109 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))); 4110 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 } 4111 }
4125 4112
4126 case OP_ROUND: 4113 case OP_ROUND:
4127 x = car (SCHEME_V->args);
4128
4129 if (num_is_integer (x)) 4114 if (is_integer (x))
4130 s_return (x); 4115 s_return (x);
4131 4116
4132 s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x)))); 4117 s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x))));
4133#endif 4118#endif
4134 4119
4135 case OP_ADD: /* + */ 4120 case OP_ADD: /* + */
4136 v = num_zero; 4121 v = num_zero;
4137 4122
4138 for (x = SCHEME_V->args; x != NIL; x = cdr (x)) 4123 for (x = args; x != NIL; x = cdr (x))
4139 v = num_add (v, nvalue (car (x))); 4124 v = num_op (NUM_ADD, v, nvalue (car (x)));
4140 4125
4141 s_return (mk_number (SCHEME_A_ v)); 4126 s_return (mk_number (SCHEME_A_ v));
4142 4127
4143 case OP_MUL: /* * */ 4128 case OP_MUL: /* * */
4144 v = num_one; 4129 v = num_one;
4145 4130
4146 for (x = SCHEME_V->args; x != NIL; x = cdr (x)) 4131 for (x = args; x != NIL; x = cdr (x))
4147 v = num_mul (v, nvalue (car (x))); 4132 v = num_op (NUM_MUL, v, nvalue (car (x)));
4148 4133
4149 s_return (mk_number (SCHEME_A_ v)); 4134 s_return (mk_number (SCHEME_A_ v));
4150 4135
4151 case OP_SUB: /* - */ 4136 case OP_SUB: /* - */
4152 if (cdr (SCHEME_V->args) == NIL) 4137 if (cdr (args) == NIL)
4153 { 4138 {
4154 x = SCHEME_V->args; 4139 x = args;
4155 v = num_zero; 4140 v = num_zero;
4156 } 4141 }
4157 else 4142 else
4158 { 4143 {
4159 x = cdr (SCHEME_V->args); 4144 x = cdr (args);
4160 v = nvalue (car (SCHEME_V->args)); 4145 v = nvalue (car (args));
4161 } 4146 }
4162 4147
4163 for (; x != NIL; x = cdr (x)) 4148 for (; x != NIL; x = cdr (x))
4164 v = num_sub (v, nvalue (car (x))); 4149 v = num_op (NUM_SUB, v, nvalue (car (x)));
4165 4150
4166 s_return (mk_number (SCHEME_A_ v)); 4151 s_return (mk_number (SCHEME_A_ v));
4167 4152
4168 case OP_DIV: /* / */ 4153 case OP_DIV: /* / */
4169 if (cdr (SCHEME_V->args) == NIL) 4154 if (cdr (args) == NIL)
4170 { 4155 {
4171 x = SCHEME_V->args; 4156 x = args;
4172 v = num_one; 4157 v = num_one;
4173 } 4158 }
4174 else 4159 else
4175 { 4160 {
4176 x = cdr (SCHEME_V->args); 4161 x = cdr (args);
4177 v = nvalue (car (SCHEME_V->args)); 4162 v = nvalue (car (args));
4178 } 4163 }
4179 4164
4180 for (; x != NIL; x = cdr (x)) 4165 for (; x != NIL; x = cdr (x))
4181 {
4182 if (!is_zero_rvalue (rvalue (car (x)))) 4166 if (!is_zero_rvalue (rvalue (car (x))))
4183 v = num_div (v, nvalue (car (x))); 4167 v = num_div (v, nvalue (car (x)));
4184 else 4168 else
4185 Error_0 ("/: division by zero"); 4169 Error_0 ("/: division by zero");
4186 }
4187 4170
4188 s_return (mk_number (SCHEME_A_ v)); 4171 s_return (mk_number (SCHEME_A_ v));
4189 4172
4190 case OP_INTDIV: /* quotient */ 4173 case OP_INTDIV: /* quotient */
4191 if (cdr (SCHEME_V->args) == NIL) 4174 if (cdr (args) == NIL)
4192 { 4175 {
4193 x = SCHEME_V->args; 4176 x = args;
4194 v = num_one; 4177 v = num_one;
4195 } 4178 }
4196 else 4179 else
4197 { 4180 {
4198 x = cdr (SCHEME_V->args); 4181 x = cdr (args);
4199 v = nvalue (car (SCHEME_V->args)); 4182 v = nvalue (car (args));
4200 } 4183 }
4201 4184
4202 for (; x != NIL; x = cdr (x)) 4185 for (; x != NIL; x = cdr (x))
4203 { 4186 {
4204 if (ivalue (car (x)) != 0) 4187 if (ivalue (car (x)) != 0)
4205 v = num_intdiv (v, nvalue (car (x))); 4188 v = num_op (NUM_INTDIV, v, nvalue (car (x)));
4206 else 4189 else
4207 Error_0 ("quotient: division by zero"); 4190 Error_0 ("quotient: division by zero");
4208 } 4191 }
4209 4192
4210 s_return (mk_number (SCHEME_A_ v)); 4193 s_return (mk_number (SCHEME_A_ v));
4211 4194
4212 case OP_REM: /* remainder */ 4195 case OP_REM: /* remainder */
4213 v = nvalue (car (SCHEME_V->args)); 4196 v = nvalue (x);
4214 4197
4215 if (ivalue (cadr (SCHEME_V->args)) != 0) 4198 if (ivalue (cadr (args)) != 0)
4216 v = num_rem (v, nvalue (cadr (SCHEME_V->args))); 4199 v = num_rem (v, nvalue (cadr (args)));
4217 else 4200 else
4218 Error_0 ("remainder: division by zero"); 4201 Error_0 ("remainder: division by zero");
4219 4202
4220 s_return (mk_number (SCHEME_A_ v)); 4203 s_return (mk_number (SCHEME_A_ v));
4221 4204
4222 case OP_MOD: /* modulo */ 4205 case OP_MOD: /* modulo */
4223 v = nvalue (car (SCHEME_V->args)); 4206 v = nvalue (x);
4224 4207
4225 if (ivalue (cadr (SCHEME_V->args)) != 0) 4208 if (ivalue (cadr (args)) != 0)
4226 v = num_mod (v, nvalue (cadr (SCHEME_V->args))); 4209 v = num_mod (v, nvalue (cadr (args)));
4227 else 4210 else
4228 Error_0 ("modulo: division by zero"); 4211 Error_0 ("modulo: division by zero");
4229 4212
4230 s_return (mk_number (SCHEME_A_ v)); 4213 s_return (mk_number (SCHEME_A_ v));
4231 4214
4232 case OP_CAR: /* car */ 4215 /* the compiler will optimize this mess... */
4233 s_return (caar (SCHEME_V->args)); 4216 case OP_CAR: op_car: s_return (car (x));
4234 4217 case OP_CDR: op_cdr: s_return (cdr (x));
4235 case OP_CDR: /* cdr */ 4218 case OP_CAAR: op_caar: x = car (x); goto op_car;
4236 s_return (cdar (SCHEME_V->args)); 4219 case OP_CADR: op_cadr: x = cdr (x); goto op_car;
4220 case OP_CDAR: op_cdar: x = car (x); goto op_cdr;
4221 case OP_CDDR: op_cddr: x = cdr (x); goto op_cdr;
4222 case OP_CAAAR: op_caaar: x = car (x); goto op_caar;
4223 case OP_CAADR: op_caadr: x = cdr (x); goto op_caar;
4224 case OP_CADAR: op_cadar: x = car (x); goto op_cadr;
4225 case OP_CADDR: op_caddr: x = cdr (x); goto op_cadr;
4226 case OP_CDAAR: op_cdaar: x = car (x); goto op_cdar;
4227 case OP_CDADR: op_cdadr: x = cdr (x); goto op_cdar;
4228 case OP_CDDAR: op_cddar: x = car (x); goto op_cddr;
4229 case OP_CDDDR: op_cdddr: x = cdr (x); goto op_cddr;
4230 case OP_CAAAAR: x = car (x); goto op_caaar;
4231 case OP_CAAADR: x = cdr (x); goto op_caaar;
4232 case OP_CAADAR: x = car (x); goto op_caadr;
4233 case OP_CAADDR: x = cdr (x); goto op_caadr;
4234 case OP_CADAAR: x = car (x); goto op_cadar;
4235 case OP_CADADR: x = cdr (x); goto op_cadar;
4236 case OP_CADDAR: x = car (x); goto op_caddr;
4237 case OP_CADDDR: x = cdr (x); goto op_caddr;
4238 case OP_CDAAAR: x = car (x); goto op_cdaar;
4239 case OP_CDAADR: x = cdr (x); goto op_cdaar;
4240 case OP_CDADAR: x = car (x); goto op_cdadr;
4241 case OP_CDADDR: x = cdr (x); goto op_cdadr;
4242 case OP_CDDAAR: x = car (x); goto op_cddar;
4243 case OP_CDDADR: x = cdr (x); goto op_cddar;
4244 case OP_CDDDAR: x = car (x); goto op_cdddr;
4245 case OP_CDDDDR: x = cdr (x); goto op_cdddr;
4237 4246
4238 case OP_CONS: /* cons */ 4247 case OP_CONS: /* cons */
4239 set_cdr (SCHEME_V->args, cadr (SCHEME_V->args)); 4248 set_cdr (args, cadr (args));
4240 s_return (SCHEME_V->args); 4249 s_return (args);
4241 4250
4242 case OP_SETCAR: /* set-car! */ 4251 case OP_SETCAR: /* set-car! */
4243 if (!is_immutable (car (SCHEME_V->args))) 4252 if (!is_immutable (x))
4244 { 4253 {
4245 set_car (car (SCHEME_V->args), cadr (SCHEME_V->args)); 4254 set_car (x, cadr (args));
4246 s_return (car (SCHEME_V->args)); 4255 s_return (car (args));
4247 } 4256 }
4248 else 4257 else
4249 Error_0 ("set-car!: unable to alter immutable pair"); 4258 Error_0 ("set-car!: unable to alter immutable pair");
4250 4259
4251 case OP_SETCDR: /* set-cdr! */ 4260 case OP_SETCDR: /* set-cdr! */
4252 if (!is_immutable (car (SCHEME_V->args))) 4261 if (!is_immutable (x))
4253 { 4262 {
4254 set_cdr (car (SCHEME_V->args), cadr (SCHEME_V->args)); 4263 set_cdr (x, cadr (args));
4255 s_return (car (SCHEME_V->args)); 4264 s_return (car (args));
4256 } 4265 }
4257 else 4266 else
4258 Error_0 ("set-cdr!: unable to alter immutable pair"); 4267 Error_0 ("set-cdr!: unable to alter immutable pair");
4259 4268
4260 case OP_CHAR2INT: /* char->integer */ 4269 case OP_CHAR2INT: /* char->integer */
4261 s_return (mk_integer (SCHEME_A_ ivalue (car (SCHEME_V->args)))); 4270 s_return (mk_integer (SCHEME_A_ ivalue_unchecked (x)));
4262 4271
4263 case OP_INT2CHAR: /* integer->char */ 4272 case OP_INT2CHAR: /* integer->char */
4264 s_return (mk_character (SCHEME_A_ ivalue (car (SCHEME_V->args)))); 4273 s_return (mk_character (SCHEME_A_ ivalue_unchecked (x)));
4265 4274
4266 case OP_CHARUPCASE: 4275 case OP_CHARUPCASE:
4267 { 4276 {
4268 unsigned char c = ivalue (car (SCHEME_V->args)); 4277 unsigned char c = ivalue_unchecked (x);
4269 c = toupper (c); 4278 c = toupper (c);
4270 s_return (mk_character (SCHEME_A_ c)); 4279 s_return (mk_character (SCHEME_A_ c));
4271 } 4280 }
4272 4281
4273 case OP_CHARDNCASE: 4282 case OP_CHARDNCASE:
4274 { 4283 {
4275 unsigned char c = ivalue (car (SCHEME_V->args)); 4284 unsigned char c = ivalue_unchecked (x);
4276 c = tolower (c); 4285 c = tolower (c);
4277 s_return (mk_character (SCHEME_A_ c)); 4286 s_return (mk_character (SCHEME_A_ c));
4278 } 4287 }
4279 4288
4280 case OP_STR2SYM: /* string->symbol */ 4289 case OP_STR2SYM: /* string->symbol */
4281 s_return (mk_symbol (SCHEME_A_ strvalue (car (SCHEME_V->args)))); 4290 s_return (mk_symbol (SCHEME_A_ strvalue (x)));
4282 4291
4283 case OP_STR2ATOM: /* string->atom */ 4292 case OP_STR2ATOM: /* string->atom */
4284 { 4293 {
4285 char *s = strvalue (car (SCHEME_V->args)); 4294 char *s = strvalue (x);
4286 long pf = 0; 4295 long pf = 0;
4287 4296
4288 if (cdr (SCHEME_V->args) != NIL) 4297 if (cdr (args) != NIL)
4289 { 4298 {
4290 /* we know cadr(SCHEME_V->args) is a natural number */ 4299 /* we know cadr(args) is a natural number */
4291 /* see if it is 2, 8, 10, or 16, or error */ 4300 /* see if it is 2, 8, 10, or 16, or error */
4292 pf = ivalue_unchecked (cadr (SCHEME_V->args)); 4301 pf = ivalue_unchecked (cadr (args));
4293 4302
4294 if (pf == 16 || pf == 10 || pf == 8 || pf == 2) 4303 if (pf == 16 || pf == 10 || pf == 8 || pf == 2)
4295 { 4304 {
4296 /* base is OK */ 4305 /* base is OK */
4297 } 4306 }
4298 else 4307 else
4299 pf = -1; 4308 pf = -1;
4300 } 4309 }
4301 4310
4302 if (pf < 0) 4311 if (pf < 0)
4303 Error_1 ("string->atom: bad base:", cadr (SCHEME_V->args)); 4312 Error_1 ("string->atom: bad base:", cadr (args));
4304 else if (*s == '#') /* no use of base! */ 4313 else if (*s == '#') /* no use of base! */
4305 s_return (mk_sharp_const (SCHEME_A_ s + 1)); 4314 s_return (mk_sharp_const (SCHEME_A_ s + 1));
4306 else 4315 else
4307 { 4316 {
4308 if (pf == 0 || pf == 10) 4317 if (pf == 0 || pf == 10)
… …
4319 } 4328 }
4320 } 4329 }
4321 } 4330 }
4322 4331
4323 case OP_SYM2STR: /* symbol->string */ 4332 case OP_SYM2STR: /* symbol->string */
4324 x = mk_string (SCHEME_A_ symname (car (SCHEME_V->args))); 4333 x = mk_string (SCHEME_A_ symname (x));
4325 setimmutable (x); 4334 setimmutable (x);
4326 s_return (x); 4335 s_return (x);
4327 4336
4328 case OP_ATOM2STR: /* atom->string */ 4337 case OP_ATOM2STR: /* atom->string */
4329 { 4338 {
4330 long pf = 0; 4339 long pf = 0;
4331 4340
4332 x = car (SCHEME_V->args);
4333
4334 if (cdr (SCHEME_V->args) != NIL) 4341 if (cdr (args) != NIL)
4335 { 4342 {
4336 /* we know cadr(SCHEME_V->args) is a natural number */ 4343 /* we know cadr(args) is a natural number */
4337 /* see if it is 2, 8, 10, or 16, or error */ 4344 /* see if it is 2, 8, 10, or 16, or error */
4338 pf = ivalue_unchecked (cadr (SCHEME_V->args)); 4345 pf = ivalue_unchecked (cadr (args));
4339 4346
4340 if (is_number (x) && (pf == 16 || pf == 10 || pf == 8 || pf == 2)) 4347 if (is_number (x) && (pf == 16 || pf == 10 || pf == 8 || pf == 2))
4341 { 4348 {
4342 /* base is OK */ 4349 /* base is OK */
4343 } 4350 }
4344 else 4351 else
4345 pf = -1; 4352 pf = -1;
4346 } 4353 }
4347 4354
4348 if (pf < 0) 4355 if (pf < 0)
4349 Error_1 ("atom->string: bad base:", cadr (SCHEME_V->args)); 4356 Error_1 ("atom->string: bad base:", cadr (args));
4350 else if (is_number (x) || is_character (x) || is_string (x) || is_symbol (x)) 4357 else if (is_number (x) || is_character (x) || is_string (x) || is_symbol (x))
4351 { 4358 {
4352 char *p; 4359 char *p;
4353 int len; 4360 int len;
4354 4361
… …
4359 Error_1 ("atom->string: not an atom:", x); 4366 Error_1 ("atom->string: not an atom:", x);
4360 } 4367 }
4361 4368
4362 case OP_MKSTRING: /* make-string */ 4369 case OP_MKSTRING: /* make-string */
4363 { 4370 {
4364 int fill = ' '; 4371 int fill = cdr (args) != NIL ? charvalue (cadr (args)) : ' ';
4365 int len; 4372 int len = ivalue_unchecked (x);
4366 4373
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)); 4374 s_return (mk_empty_string (SCHEME_A_ len, fill));
4373 } 4375 }
4374 4376
4375 case OP_STRLEN: /* string-length */ 4377 case OP_STRLEN: /* string-length */
4376 s_return (mk_integer (SCHEME_A_ strlength (car (SCHEME_V->args)))); 4378 s_return (mk_integer (SCHEME_A_ strlength (x)));
4377 4379
4378 case OP_STRREF: /* string-ref */ 4380 case OP_STRREF: /* string-ref */
4379 { 4381 {
4380 char *str; 4382 char *str = strvalue (x);
4381 int index;
4382
4383 str = strvalue (car (SCHEME_V->args));
4384
4385 index = ivalue (cadr (SCHEME_V->args)); 4383 int index = ivalue_unchecked (cadr (args));
4386 4384
4387 if (index >= strlength (car (SCHEME_V->args))) 4385 if (index >= strlength (x))
4388 Error_1 ("string-ref: out of bounds:", cadr (SCHEME_V->args)); 4386 Error_1 ("string-ref: out of bounds:", cadr (args));
4389 4387
4390 s_return (mk_character (SCHEME_A_ ((unsigned char *) str)[index])); 4388 s_return (mk_character (SCHEME_A_ ((unsigned char *)str)[index]));
4391 } 4389 }
4392 4390
4393 case OP_STRSET: /* string-set! */ 4391 case OP_STRSET: /* string-set! */
4394 { 4392 {
4395 char *str; 4393 char *str = strvalue (x);
4396 int index; 4394 int index = ivalue_unchecked (cadr (args));
4397 int c; 4395 int c;
4398 4396
4399 if (is_immutable (car (SCHEME_V->args))) 4397 if (is_immutable (x))
4400 Error_1 ("string-set!: unable to alter immutable string:", car (SCHEME_V->args)); 4398 Error_1 ("string-set!: unable to alter immutable string:", x);
4401 4399
4402 str = strvalue (car (SCHEME_V->args));
4403
4404 index = ivalue (cadr (SCHEME_V->args));
4405
4406 if (index >= strlength (car (SCHEME_V->args))) 4400 if (index >= strlength (x))
4407 Error_1 ("string-set!: out of bounds:", cadr (SCHEME_V->args)); 4401 Error_1 ("string-set!: out of bounds:", cadr (args));
4408 4402
4409 c = charvalue (caddr (SCHEME_V->args)); 4403 c = charvalue (caddr (args));
4410 4404
4411 str[index] = (char) c; 4405 str[index] = c;
4412 s_return (car (SCHEME_V->args)); 4406 s_return (car (args));
4413 } 4407 }
4414 4408
4415 case OP_STRAPPEND: /* string-append */ 4409 case OP_STRAPPEND: /* string-append */
4416 { 4410 {
4417 /* in 1.29 string-append was in Scheme in init.scm but was too slow */ 4411 /* in 1.29 string-append was in Scheme in init.scm but was too slow */
4418 int len = 0; 4412 int len = 0;
4419 pointer newstr; 4413 pointer newstr;
4420 char *pos; 4414 char *pos;
4421 4415
4422 /* compute needed length for new string */ 4416 /* compute needed length for new string */
4423 for (x = SCHEME_V->args; x != NIL; x = cdr (x)) 4417 for (x = args; x != NIL; x = cdr (x))
4424 len += strlength (car (x)); 4418 len += strlength (car (x));
4425 4419
4426 newstr = mk_empty_string (SCHEME_A_ len, ' '); 4420 newstr = mk_empty_string (SCHEME_A_ len, ' ');
4427 4421
4428 /* store the contents of the argument strings into the new string */ 4422 /* 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)) 4423 for (pos = strvalue (newstr), x = args; x != NIL; pos += strlength (car (x)), x = cdr (x))
4430 memcpy (pos, strvalue (car (x)), strlength (car (x))); 4424 memcpy (pos, strvalue (car (x)), strlength (car (x)));
4431 4425
4432 s_return (newstr); 4426 s_return (newstr);
4433 } 4427 }
4434 4428
4435 case OP_SUBSTR: /* substring */ 4429 case OP_SUBSTR: /* substring */
4436 { 4430 {
4437 char *str; 4431 char *str = strvalue (x);
4438 int index0; 4432 int index0 = ivalue_unchecked (cadr (args));
4439 int index1; 4433 int index1;
4440 int len; 4434 int len;
4441 4435
4442 str = strvalue (car (SCHEME_V->args));
4443
4444 index0 = ivalue (cadr (SCHEME_V->args));
4445
4446 if (index0 > strlength (car (SCHEME_V->args))) 4436 if (index0 > strlength (x))
4447 Error_1 ("substring: start out of bounds:", cadr (SCHEME_V->args)); 4437 Error_1 ("substring: start out of bounds:", cadr (args));
4448 4438
4449 if (cddr (SCHEME_V->args) != NIL) 4439 if (cddr (args) != NIL)
4450 { 4440 {
4451 index1 = ivalue (caddr (SCHEME_V->args)); 4441 index1 = ivalue_unchecked (caddr (args));
4452 4442
4453 if (index1 > strlength (car (SCHEME_V->args)) || index1 < index0) 4443 if (index1 > strlength (x) || index1 < index0)
4454 Error_1 ("substring: end out of bounds:", caddr (SCHEME_V->args)); 4444 Error_1 ("substring: end out of bounds:", caddr (args));
4455 } 4445 }
4456 else 4446 else
4457 index1 = strlength (car (SCHEME_V->args)); 4447 index1 = strlength (x);
4458 4448
4459 len = index1 - index0; 4449 len = index1 - index0;
4460 x = mk_empty_string (SCHEME_A_ len, ' '); 4450 x = mk_empty_string (SCHEME_A_ len, ' ');
4461 memcpy (strvalue (x), str + index0, len); 4451 memcpy (strvalue (x), str + index0, len);
4462 strvalue (x)[len] = 0; 4452 strvalue (x)[len] = 0;
… …
4466 4456
4467 case OP_VECTOR: /* vector */ 4457 case OP_VECTOR: /* vector */
4468 { 4458 {
4469 int i; 4459 int i;
4470 pointer vec; 4460 pointer vec;
4471 int len = list_length (SCHEME_A_ SCHEME_V->args); 4461 int len = list_length (SCHEME_A_ args);
4472 4462
4473 if (len < 0) 4463 if (len < 0)
4474 Error_1 ("vector: not a proper list:", SCHEME_V->args); 4464 Error_1 ("vector: not a proper list:", args);
4475 4465
4476 vec = mk_vector (SCHEME_A_ len); 4466 vec = mk_vector (SCHEME_A_ len);
4477 4467
4478#if USE_ERROR_CHECKING 4468#if USE_ERROR_CHECKING
4479 if (SCHEME_V->no_memory) 4469 if (SCHEME_V->no_memory)
4480 s_return (S_SINK); 4470 s_return (S_SINK);
4481#endif 4471#endif
4482 4472
4483 for (x = SCHEME_V->args, i = 0; is_pair (x); x = cdr (x), i++) 4473 for (x = args, i = 0; is_pair (x); x = cdr (x), i++)
4484 set_vector_elem (vec, i, car (x)); 4474 vector_set (vec, i, car (x));
4485 4475
4486 s_return (vec); 4476 s_return (vec);
4487 } 4477 }
4488 4478
4489 case OP_MKVECTOR: /* make-vector */ 4479 case OP_MKVECTOR: /* make-vector */
4490 { 4480 {
4491 pointer fill = NIL; 4481 pointer fill = NIL;
4492 int len;
4493 pointer vec; 4482 pointer vec;
4483 int len = ivalue_unchecked (x);
4494 4484
4495 len = ivalue (car (SCHEME_V->args));
4496
4497 if (cdr (SCHEME_V->args) != NIL) 4485 if (cdr (args) != NIL)
4498 fill = cadr (SCHEME_V->args); 4486 fill = cadr (args);
4499 4487
4500 vec = mk_vector (SCHEME_A_ len); 4488 vec = mk_vector (SCHEME_A_ len);
4501 4489
4502#if USE_ERROR_CHECKING 4490#if USE_ERROR_CHECKING
4503 if (SCHEME_V->no_memory) 4491 if (SCHEME_V->no_memory)
4504 s_return (S_SINK); 4492 s_return (S_SINK);
4505#endif 4493#endif
4506 4494
4507 if (fill != NIL) 4495 if (fill != NIL)
4508 fill_vector (vec, fill); 4496 fill_vector (vec, 0, fill);
4509 4497
4510 s_return (vec); 4498 s_return (vec);
4511 } 4499 }
4512 4500
4513 case OP_VECLEN: /* vector-length */ 4501 case OP_VECLEN: /* vector-length */
4514 s_return (mk_integer (SCHEME_A_ veclength (car (SCHEME_V->args)))); 4502 s_return (mk_integer (SCHEME_A_ veclength (x)));
4503
4504 case OP_VECRESIZE:
4505 vector_resize (x, ivalue_unchecked (cadr (args)), caddr (args));
4506 s_return (x);
4515 4507
4516 case OP_VECREF: /* vector-ref */ 4508 case OP_VECREF: /* vector-ref */
4517 { 4509 {
4518 int index;
4519
4520 index = ivalue (cadr (SCHEME_V->args)); 4510 int index = ivalue_unchecked (cadr (args));
4521 4511
4522 if (index >= veclength (car (SCHEME_V->args)) && USE_ERROR_CHECKING) 4512 if (index >= veclength (car (args)) && USE_ERROR_CHECKING)
4523 Error_1 ("vector-ref: out of bounds:", cadr (SCHEME_V->args)); 4513 Error_1 ("vector-ref: out of bounds:", cadr (args));
4524 4514
4525 s_return (vector_elem (car (SCHEME_V->args), index)); 4515 s_return (vector_get (x, index));
4526 } 4516 }
4527 4517
4528 case OP_VECSET: /* vector-set! */ 4518 case OP_VECSET: /* vector-set! */
4529 { 4519 {
4530 int index; 4520 int index = ivalue_unchecked (cadr (args));
4531 4521
4532 if (is_immutable (car (SCHEME_V->args))) 4522 if (is_immutable (x))
4533 Error_1 ("vector-set!: unable to alter immutable vector:", car (SCHEME_V->args)); 4523 Error_1 ("vector-set!: unable to alter immutable vector:", x);
4534 4524
4535 index = ivalue (cadr (SCHEME_V->args));
4536
4537 if (index >= veclength (car (SCHEME_V->args)) && USE_ERROR_CHECKING) 4525 if (index >= veclength (car (args)) && USE_ERROR_CHECKING)
4538 Error_1 ("vector-set!: out of bounds:", cadr (SCHEME_V->args)); 4526 Error_1 ("vector-set!: out of bounds:", cadr (args));
4539 4527
4540 set_vector_elem (car (SCHEME_V->args), index, caddr (SCHEME_V->args)); 4528 vector_set (x, index, caddr (args));
4541 s_return (car (SCHEME_V->args)); 4529 s_return (x);
4542 } 4530 }
4543 } 4531 }
4544 4532
4545 return S_T; 4533 if (USE_ERROR_CHECKING) abort ();
4546} 4534}
4547 4535
4548INTERFACE int 4536static int
4549is_list (SCHEME_P_ pointer a) 4537opexe_2 (SCHEME_P_ enum scheme_opcodes op)
4550{ 4538{
4551 return list_length (SCHEME_A_ a) >= 0; 4539 pointer x = SCHEME_V->args;
4552}
4553 4540
4554/* Result is: 4541 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 { 4542 {
4543 num v = nvalue (car (x));
4544 x = cdr (x);
4545
4570 if (fast == NIL) 4546 if (x == NIL)
4571 return i; 4547 break;
4572 4548
4573 if (!is_pair (fast)) 4549 int r = num_cmp (v, nvalue (car (x)));
4574 return -2 - i;
4575 4550
4576 fast = cdr (fast); 4551 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 { 4552 {
4594 /* the fast pointer has looped back around and caught up 4553 case OP_NUMEQ: r = r == 0; break;
4595 with the slow pointer, hence the structure is circular, 4554 case OP_LESS: r = r < 0; break;
4596 not of finite length, and therefore not a list */ 4555 case OP_GRE: r = r > 0; break;
4597 return -1; 4556 case OP_LEQ: r = r <= 0; break;
4557 case OP_GEQ: r = r >= 0; break;
4598 } 4558 }
4599 }
4600}
4601 4559
4560 if (!r)
4561 s_return (S_F);
4562 }
4563
4564 s_return (S_T);
4565}
4566
4602static pointer 4567static int
4603opexe_3 (SCHEME_P_ enum scheme_opcodes op) 4568opexe_3 (SCHEME_P_ enum scheme_opcodes op)
4604{ 4569{
4605 pointer x; 4570 pointer args = SCHEME_V->args;
4606 num v; 4571 pointer a = car (args);
4607 int (*comp_func) (num, num); 4572 pointer d = cdr (args);
4573 int r;
4608 4574
4609 switch (op) 4575 switch (op)
4610 { 4576 {
4611 case OP_NOT: /* not */ 4577 case OP_NOT: /* not */ r = is_false (a) ; break;
4612 s_retbool (is_false (car (SCHEME_V->args))); 4578 case OP_BOOLP: /* boolean? */ r = a == S_F || a == S_T ; break;
4579 case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break;
4580 case OP_NULLP: /* null? */ r = a == NIL ; break;
4581 case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break;
4582 case OP_GENSYMP: /* gensym? */ r = is_gensym (SCHEME_A_ a); break;
4583 case OP_NUMBERP: /* number? */ r = is_number (a) ; break;
4584 case OP_STRINGP: /* string? */ r = is_string (a) ; break;
4585 case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break;
4586 case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */
4587 case OP_CHARP: /* char? */ r = is_character (a) ; break;
4613 4588
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 4589#if USE_CHAR_CLASSIFIERS
4683 4590 case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue_unchecked (a)); break;
4684 case OP_CHARAP: /* char-alphabetic? */ 4591 case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue_unchecked (a)); break;
4685 s_retbool (Cisalpha (ivalue (car (SCHEME_V->args)))); 4592 case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue_unchecked (a)); break;
4686 4593 case OP_CHARUP: /* char-upper-case? */ r = Cisupper (ivalue_unchecked (a)); break;
4687 case OP_CHARNP: /* char-numeric? */ 4594 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 4595#endif
4596
4699#if USE_PORTS 4597#if USE_PORTS
4700 4598 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? */ 4599 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? */ 4600 case OP_OUTPORTP: /* output-port? */ r = is_outport (a); break;
4708 s_retbool (is_outport (car (SCHEME_V->args)));
4709#endif 4601#endif
4710 4602
4711 case OP_PROCP: /* procedure? */ 4603 case OP_PROCP: /* procedure? */
4712 4604
4713 /*-- 4605 /*--
4714 * continuation should be procedure by the example 4606 * continuation should be procedure by the example
4715 * (call-with-current-continuation procedure?) ==> #t 4607 * (call-with-current-continuation procedure?) ==> #t
4716 * in R^3 report sec. 6.9 4608 * in R^3 report sec. 6.9
4717 */ 4609 */
4718 s_retbool (is_proc (car (SCHEME_V->args)) || is_closure (car (SCHEME_V->args)) 4610 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))); 4611 break;
4720 4612
4721 case OP_PAIRP: /* pair? */ 4613 case OP_PAIRP: /* pair? */ r = is_pair (a) ; break;
4722 s_retbool (is_pair (car (SCHEME_V->args))); 4614 case OP_LISTP: /* list? */ r = list_length (SCHEME_A_ a) >= 0; break;
4723 4615 case OP_ENVP: /* environment? */ r = is_environment (a) ; break;
4724 case OP_LISTP: /* list? */ 4616 case OP_VECTORP: /* vector? */ r = is_vector (a) ; break;
4725 s_retbool (list_length (SCHEME_A_ car (SCHEME_V->args)) >= 0); 4617 case OP_EQ: /* eq? */ r = a == cadr (args) ; break;
4726 4618 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 } 4619 }
4739 4620
4740 return S_T; 4621 s_retbool (r);
4741} 4622}
4742 4623
4743static pointer 4624static int
4744opexe_4 (SCHEME_P_ enum scheme_opcodes op) 4625opexe_4 (SCHEME_P_ enum scheme_opcodes op)
4745{ 4626{
4627 pointer args = SCHEME_V->args;
4628 pointer a = car (args);
4746 pointer x, y; 4629 pointer x, y;
4747 4630
4748 switch (op) 4631 switch (op)
4749 { 4632 {
4750 case OP_FORCE: /* force */ 4633 case OP_FORCE: /* force */
4751 SCHEME_V->code = car (SCHEME_V->args); 4634 SCHEME_V->code = a;
4752 4635
4753 if (is_promise (SCHEME_V->code)) 4636 if (is_promise (SCHEME_V->code))
4754 { 4637 {
4755 /* Should change type to closure here */ 4638 /* Should change type to closure here */
4756 s_save (SCHEME_A_ OP_SAVE_FORCED, NIL, SCHEME_V->code); 4639 s_save (SCHEME_A_ OP_SAVE_FORCED, NIL, SCHEME_V->code);
… …
4777 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL); 4660 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL);
4778 SCHEME_V->outport = cadr (SCHEME_V->args); 4661 SCHEME_V->outport = cadr (SCHEME_V->args);
4779 } 4662 }
4780 } 4663 }
4781 4664
4782 SCHEME_V->args = car (SCHEME_V->args); 4665 SCHEME_V->args = a;
4783 4666
4784 if (op == OP_WRITE) 4667 if (op == OP_WRITE)
4785 SCHEME_V->print_flag = 1; 4668 SCHEME_V->print_flag = 1;
4786 else 4669 else
4787 SCHEME_V->print_flag = 0; 4670 SCHEME_V->print_flag = 0;
4788 4671
4789 s_goto (OP_P0LIST); 4672 s_goto (OP_P0LIST);
4790 4673
4791 case OP_NEWLINE: /* newline */ 4674 case OP_NEWLINE: /* newline */
4792 if (is_pair (SCHEME_V->args)) 4675 if (is_pair (args))
4793 { 4676 {
4794 if (car (SCHEME_V->args) != SCHEME_V->outport) 4677 if (a != SCHEME_V->outport)
4795 { 4678 {
4796 x = cons (SCHEME_V->outport, NIL); 4679 x = cons (SCHEME_V->outport, NIL);
4797 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL); 4680 s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL);
4798 SCHEME_V->outport = car (SCHEME_V->args); 4681 SCHEME_V->outport = a;
4799 } 4682 }
4800 } 4683 }
4801 4684
4802 putstr (SCHEME_A_ "\n"); 4685 putstr (SCHEME_A_ "\n");
4803 s_return (S_T); 4686 s_return (S_T);
4804#endif 4687#endif
4805 4688
4806 case OP_ERR0: /* error */ 4689 case OP_ERR0: /* error */
4807 SCHEME_V->retcode = -1; 4690 SCHEME_V->retcode = -1;
4808 4691
4809 if (!is_string (car (SCHEME_V->args))) 4692 if (!is_string (a))
4810 { 4693 {
4811 SCHEME_V->args = cons (mk_string (SCHEME_A_ " -- "), SCHEME_V->args); 4694 args = cons (mk_string (SCHEME_A_ " -- "), args);
4812 setimmutable (car (SCHEME_V->args)); 4695 setimmutable (car (args));
4813 } 4696 }
4814 4697
4815 putstr (SCHEME_A_ "Error: "); 4698 putstr (SCHEME_A_ "Error: ");
4816 putstr (SCHEME_A_ strvalue (car (SCHEME_V->args))); 4699 putstr (SCHEME_A_ strvalue (car (args)));
4817 SCHEME_V->args = cdr (SCHEME_V->args); 4700 SCHEME_V->args = cdr (args);
4818 s_goto (OP_ERR1); 4701 s_goto (OP_ERR1);
4819 4702
4820 case OP_ERR1: /* error */ 4703 case OP_ERR1: /* error */
4821 putstr (SCHEME_A_ " "); 4704 putstr (SCHEME_A_ " ");
4822 4705
4823 if (SCHEME_V->args != NIL) 4706 if (args != NIL)
4824 { 4707 {
4825 s_save (SCHEME_A_ OP_ERR1, cdr (SCHEME_V->args), NIL); 4708 s_save (SCHEME_A_ OP_ERR1, cdr (args), NIL);
4826 SCHEME_V->args = car (SCHEME_V->args); 4709 SCHEME_V->args = a;
4827 SCHEME_V->print_flag = 1; 4710 SCHEME_V->print_flag = 1;
4828 s_goto (OP_P0LIST); 4711 s_goto (OP_P0LIST);
4829 } 4712 }
4830 else 4713 else
4831 { 4714 {
4832 putstr (SCHEME_A_ "\n"); 4715 putstr (SCHEME_A_ "\n");
4833 4716
4834 if (SCHEME_V->interactive_repl) 4717 if (SCHEME_V->interactive_repl)
4835 s_goto (OP_T0LVL); 4718 s_goto (OP_T0LVL);
4836 else 4719 else
4837 return NIL; 4720 return -1;
4838 } 4721 }
4839 4722
4840 case OP_REVERSE: /* reverse */ 4723 case OP_REVERSE: /* reverse */
4841 s_return (reverse (SCHEME_A_ car (SCHEME_V->args))); 4724 s_return (reverse (SCHEME_A_ a));
4842 4725
4843 case OP_LIST_STAR: /* list* */ 4726 case OP_LIST_STAR: /* list* */
4844 s_return (list_star (SCHEME_A_ SCHEME_V->args)); 4727 s_return (list_star (SCHEME_A_ SCHEME_V->args));
4845 4728
4846 case OP_APPEND: /* append */ 4729 case OP_APPEND: /* append */
4847 x = NIL; 4730 x = NIL;
4848 y = SCHEME_V->args; 4731 y = args;
4849 4732
4850 if (y == x) 4733 if (y == x)
4851 s_return (x); 4734 s_return (x);
4852 4735
4853 /* cdr() in the while condition is not a typo. If car() */ 4736 /* cdr() in the while condition is not a typo. If car() */
… …
4864 s_return (reverse_in_place (SCHEME_A_ car (y), x)); 4747 s_return (reverse_in_place (SCHEME_A_ car (y), x));
4865 4748
4866#if USE_PLIST 4749#if USE_PLIST
4867 4750
4868 case OP_PUT: /* put */ 4751 case OP_PUT: /* put */
4869 if (!hasprop (car (SCHEME_V->args)) || !hasprop (cadr (SCHEME_V->args))) 4752 if (!hasprop (a) || !hasprop (cadr (args)))
4870 Error_0 ("illegal use of put"); 4753 Error_0 ("illegal use of put");
4871 4754
4872 for (x = symprop (car (SCHEME_V->args)), y = cadr (SCHEME_V->args); x != NIL; x = cdr (x)) 4755 for (x = symprop (a), y = cadr (args); x != NIL; x = cdr (x))
4873 { 4756 {
4874 if (caar (x) == y) 4757 if (caar (x) == y)
4875 break; 4758 break;
4876 } 4759 }
4877 4760
4878 if (x != NIL) 4761 if (x != NIL)
4879 cdar (x) = caddr (SCHEME_V->args); 4762 cdar (x) = caddr (args);
4880 else 4763 else
4881 symprop (car (SCHEME_V->args)) = cons (cons (y, caddr (SCHEME_V->args)), symprop (car (SCHEME_V->args))); 4764 symprop (a) = cons (cons (y, caddr (args)), symprop (a));
4882 4765
4883 s_return (S_T); 4766 s_return (S_T);
4884 4767
4885 case OP_GET: /* get */ 4768 case OP_GET: /* get */
4886 if (!hasprop (car (SCHEME_V->args)) || !hasprop (cadr (SCHEME_V->args))) 4769 if (!hasprop (a) || !hasprop (cadr (args)))
4887 Error_0 ("illegal use of get"); 4770 Error_0 ("illegal use of get");
4888 4771
4889 for (x = symprop (car (SCHEME_V->args)), y = cadr (SCHEME_V->args); x != NIL; x = cdr (x)) 4772 for (x = symprop (a), y = cadr (args); x != NIL; x = cdr (x))
4890 if (caar (x) == y) 4773 if (caar (x) == y)
4891 break; 4774 break;
4892 4775
4893 if (x != NIL) 4776 if (x != NIL)
4894 s_return (cdar (x)); 4777 s_return (cdar (x));
… …
4896 s_return (NIL); 4779 s_return (NIL);
4897 4780
4898#endif /* USE_PLIST */ 4781#endif /* USE_PLIST */
4899 4782
4900 case OP_QUIT: /* quit */ 4783 case OP_QUIT: /* quit */
4901 if (is_pair (SCHEME_V->args)) 4784 if (is_pair (args))
4902 SCHEME_V->retcode = ivalue (car (SCHEME_V->args)); 4785 SCHEME_V->retcode = ivalue (a);
4903 4786
4904 return NIL; 4787 return -1;
4905 4788
4906 case OP_GC: /* gc */ 4789 case OP_GC: /* gc */
4907 gc (SCHEME_A_ NIL, NIL); 4790 gc (SCHEME_A_ NIL, NIL);
4908 s_return (S_T); 4791 s_return (S_T);
4909 4792
4910 case OP_GCVERB: /* gc-verbose */ 4793 case OP_GCVERB: /* gc-verbose */
4911 { 4794 {
4912 int was = SCHEME_V->gc_verbose; 4795 int was = SCHEME_V->gc_verbose;
4913 4796
4914 SCHEME_V->gc_verbose = (car (SCHEME_V->args) != S_F); 4797 SCHEME_V->gc_verbose = (a != S_F);
4915 s_retbool (was); 4798 s_retbool (was);
4916 } 4799 }
4917 4800
4918 case OP_NEWSEGMENT: /* new-segment */ 4801 case OP_NEWSEGMENT: /* new-segment */
4919 if (!is_pair (SCHEME_V->args) || !is_number (car (SCHEME_V->args))) 4802 if (!is_pair (args) || !is_number (a))
4920 Error_0 ("new-segment: argument must be a number"); 4803 Error_0 ("new-segment: argument must be a number");
4921 4804
4922 alloc_cellseg (SCHEME_A_ (int)ivalue (car (SCHEME_V->args))); 4805 alloc_cellseg (SCHEME_A_ ivalue (a));
4923 4806
4924 s_return (S_T); 4807 s_return (S_T);
4925 4808
4926 case OP_OBLIST: /* oblist */ 4809 case OP_OBLIST: /* oblist */
4927 s_return (oblist_all_symbols (SCHEME_A)); 4810 s_return (oblist_all_symbols (SCHEME_A));
… …
4954 case OP_OPEN_INOUTFILE: 4837 case OP_OPEN_INOUTFILE:
4955 prop = port_input | port_output; 4838 prop = port_input | port_output;
4956 break; 4839 break;
4957 } 4840 }
4958 4841
4959 p = port_from_filename (SCHEME_A_ strvalue (car (SCHEME_V->args)), prop); 4842 p = port_from_filename (SCHEME_A_ strvalue (a), prop);
4960 4843
4961 if (p == NIL) 4844 s_return (p == NIL ? S_F : p);
4962 s_return (S_F);
4963
4964 s_return (p);
4965 } 4845 }
4966 4846
4967# if USE_STRING_PORTS 4847# if USE_STRING_PORTS
4968 4848
4969 case OP_OPEN_INSTRING: /* open-input-string */ 4849 case OP_OPEN_INSTRING: /* open-input-string */
… …
4981 case OP_OPEN_INOUTSTRING: 4861 case OP_OPEN_INOUTSTRING:
4982 prop = port_input | port_output; 4862 prop = port_input | port_output;
4983 break; 4863 break;
4984 } 4864 }
4985 4865
4986 p = port_from_string (SCHEME_A_ strvalue (car (SCHEME_V->args)), 4866 p = port_from_string (SCHEME_A_ strvalue (a),
4987 strvalue (car (SCHEME_V->args)) + strlength (car (SCHEME_V->args)), prop); 4867 strvalue (a) + strlength (a), prop);
4988 4868
4989 if (p == NIL) 4869 s_return (p == NIL ? S_F : p);
4990 s_return (S_F);
4991
4992 s_return (p);
4993 } 4870 }
4994 4871
4995 case OP_OPEN_OUTSTRING: /* open-output-string */ 4872 case OP_OPEN_OUTSTRING: /* open-output-string */
4996 { 4873 {
4997 pointer p; 4874 pointer p;
4998 4875
4999 if (car (SCHEME_V->args) == NIL) 4876 if (a == NIL)
5000 {
5001 p = port_from_scratch (SCHEME_A); 4877 p = port_from_scratch (SCHEME_A);
5002
5003 if (p == NIL)
5004 s_return (S_F);
5005 }
5006 else 4878 else
5007 {
5008 p = port_from_string (SCHEME_A_ strvalue (car (SCHEME_V->args)), 4879 p = port_from_string (SCHEME_A_ strvalue (a),
5009 strvalue (car (SCHEME_V->args)) + strlength (car (SCHEME_V->args)), port_output); 4880 strvalue (a) + strlength (a), port_output);
5010 4881
5011 if (p == NIL) 4882 s_return (p == NIL ? S_F : p);
5012 s_return (S_F);
5013 }
5014
5015 s_return (p);
5016 } 4883 }
5017 4884
5018 case OP_GET_OUTSTRING: /* get-output-string */ 4885 case OP_GET_OUTSTRING: /* get-output-string */
5019 { 4886 {
5020 port *p; 4887 port *p;
5021 4888
5022 if ((p = car (SCHEME_V->args)->object.port)->kind & port_string) 4889 if ((p = a->object.port)->kind & port_string)
5023 { 4890 {
5024 off_t size; 4891 off_t size;
5025 char *str; 4892 char *str;
5026 4893
5027 size = p->rep.string.curr - p->rep.string.start + 1; 4894 size = p->rep.string.curr - p->rep.string.start + 1;
… …
5043 } 4910 }
5044 4911
5045# endif 4912# endif
5046 4913
5047 case OP_CLOSE_INPORT: /* close-input-port */ 4914 case OP_CLOSE_INPORT: /* close-input-port */
5048 port_close (SCHEME_A_ car (SCHEME_V->args), port_input); 4915 port_close (SCHEME_A_ a, port_input);
5049 s_return (S_T); 4916 s_return (S_T);
5050 4917
5051 case OP_CLOSE_OUTPORT: /* close-output-port */ 4918 case OP_CLOSE_OUTPORT: /* close-output-port */
5052 port_close (SCHEME_A_ car (SCHEME_V->args), port_output); 4919 port_close (SCHEME_A_ a, port_output);
5053 s_return (S_T); 4920 s_return (S_T);
5054#endif 4921#endif
5055 4922
5056 case OP_INT_ENV: /* interaction-environment */ 4923 case OP_INT_ENV: /* interaction-environment */
5057 s_return (SCHEME_V->global_env); 4924 s_return (SCHEME_V->global_env);
… …
5059 case OP_CURR_ENV: /* current-environment */ 4926 case OP_CURR_ENV: /* current-environment */
5060 s_return (SCHEME_V->envir); 4927 s_return (SCHEME_V->envir);
5061 4928
5062 } 4929 }
5063 4930
5064 return S_T; 4931 if (USE_ERROR_CHECKING) abort ();
5065} 4932}
5066 4933
5067static pointer 4934static int
5068opexe_5 (SCHEME_P_ enum scheme_opcodes op) 4935opexe_5 (SCHEME_P_ enum scheme_opcodes op)
5069{ 4936{
4937 pointer args = SCHEME_V->args;
5070 pointer x; 4938 pointer x;
5071 4939
5072 if (SCHEME_V->nesting != 0) 4940 if (SCHEME_V->nesting != 0)
5073 { 4941 {
5074 int n = SCHEME_V->nesting; 4942 int n = SCHEME_V->nesting;
… …
5081 switch (op) 4949 switch (op)
5082 { 4950 {
5083 /* ========== reading part ========== */ 4951 /* ========== reading part ========== */
5084#if USE_PORTS 4952#if USE_PORTS
5085 case OP_READ: 4953 case OP_READ:
5086 if (!is_pair (SCHEME_V->args)) 4954 if (!is_pair (args))
5087 s_goto (OP_READ_INTERNAL); 4955 s_goto (OP_READ_INTERNAL);
5088 4956
5089 if (!is_inport (car (SCHEME_V->args))) 4957 if (!is_inport (car (args)))
5090 Error_1 ("read: not an input port:", car (SCHEME_V->args)); 4958 Error_1 ("read: not an input port:", car (args));
5091 4959
5092 if (car (SCHEME_V->args) == SCHEME_V->inport) 4960 if (car (args) == SCHEME_V->inport)
5093 s_goto (OP_READ_INTERNAL); 4961 s_goto (OP_READ_INTERNAL);
5094 4962
5095 x = SCHEME_V->inport; 4963 x = SCHEME_V->inport;
5096 SCHEME_V->inport = car (SCHEME_V->args); 4964 SCHEME_V->inport = car (args);
5097 x = cons (x, NIL); 4965 x = cons (x, NIL);
5098 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); 4966 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL);
5099 s_goto (OP_READ_INTERNAL); 4967 s_goto (OP_READ_INTERNAL);
5100 4968
5101 case OP_READ_CHAR: /* read-char */ 4969 case OP_READ_CHAR: /* read-char */
5102 case OP_PEEK_CHAR: /* peek-char */ 4970 case OP_PEEK_CHAR: /* peek-char */
5103 { 4971 {
5104 int c; 4972 int c;
5105 4973
5106 if (is_pair (SCHEME_V->args)) 4974 if (is_pair (args))
5107 { 4975 {
5108 if (car (SCHEME_V->args) != SCHEME_V->inport) 4976 if (car (args) != SCHEME_V->inport)
5109 { 4977 {
5110 x = SCHEME_V->inport; 4978 x = SCHEME_V->inport;
5111 x = cons (x, NIL); 4979 x = cons (x, NIL);
5112 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); 4980 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL);
5113 SCHEME_V->inport = car (SCHEME_V->args); 4981 SCHEME_V->inport = car (args);
5114 } 4982 }
5115 } 4983 }
5116 4984
5117 c = inchar (SCHEME_A); 4985 c = inchar (SCHEME_A);
5118 4986
… …
5128 case OP_CHAR_READY: /* char-ready? */ 4996 case OP_CHAR_READY: /* char-ready? */
5129 { 4997 {
5130 pointer p = SCHEME_V->inport; 4998 pointer p = SCHEME_V->inport;
5131 int res; 4999 int res;
5132 5000
5133 if (is_pair (SCHEME_V->args)) 5001 if (is_pair (args))
5134 p = car (SCHEME_V->args); 5002 p = car (args);
5135 5003
5136 res = p->object.port->kind & port_string; 5004 res = p->object.port->kind & port_string;
5137 5005
5138 s_retbool (res); 5006 s_retbool (res);
5139 } 5007 }
5140 5008
5141 case OP_SET_INPORT: /* set-input-port */ 5009 case OP_SET_INPORT: /* set-input-port */
5142 SCHEME_V->inport = car (SCHEME_V->args); 5010 SCHEME_V->inport = car (args);
5143 s_return (SCHEME_V->value); 5011 s_return (SCHEME_V->value);
5144 5012
5145 case OP_SET_OUTPORT: /* set-output-port */ 5013 case OP_SET_OUTPORT: /* set-output-port */
5146 SCHEME_V->outport = car (SCHEME_V->args); 5014 SCHEME_V->outport = car (args);
5147 s_return (SCHEME_V->value); 5015 s_return (SCHEME_V->value);
5148#endif 5016#endif
5149 5017
5150 case OP_RDSEXPR: 5018 case OP_RDSEXPR:
5151 switch (SCHEME_V->tok) 5019 switch (SCHEME_V->tok)
… …
5200 s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL); 5068 s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL);
5201 SCHEME_V->tok = token (SCHEME_A); 5069 SCHEME_V->tok = token (SCHEME_A);
5202 s_goto (OP_RDSEXPR); 5070 s_goto (OP_RDSEXPR);
5203 5071
5204 case TOK_ATOM: 5072 case TOK_ATOM:
5205 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))); 5073 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS)));
5074
5075 case TOK_DOTATOM:
5076 SCHEME_V->strbuff[0] = '.';
5077 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 1, DELIMITERS)));
5078
5079 case TOK_STRATOM:
5080 x = readstrexp (SCHEME_A_ '|');
5081 //TODO: haven't checked whether the garbage collector could interfere
5082 s_return (mk_atom (SCHEME_A_ strvalue (x)));
5206 5083
5207 case TOK_DQUOTE: 5084 case TOK_DQUOTE:
5208 x = readstrexp (SCHEME_A); 5085 x = readstrexp (SCHEME_A_ '"');
5209 5086
5210 if (x == S_F) 5087 if (x == S_F)
5211 Error_0 ("Error reading string"); 5088 Error_0 ("Error reading string");
5212 5089
5213 setimmutable (x); 5090 setimmutable (x);
… …
5225 s_goto (OP_EVAL); 5102 s_goto (OP_EVAL);
5226 } 5103 }
5227 } 5104 }
5228 5105
5229 case TOK_SHARP_CONST: 5106 case TOK_SHARP_CONST:
5230 if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))) == NIL) 5107 if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS))) == NIL)
5231 Error_0 ("undefined sharp expression"); 5108 Error_0 ("undefined sharp expression");
5232 else 5109 else
5233 s_return (x); 5110 s_return (x);
5234 5111
5235 default: 5112 default:
… …
5237 } 5114 }
5238 5115
5239 break; 5116 break;
5240 5117
5241 case OP_RDLIST: 5118 case OP_RDLIST:
5242 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 5119 SCHEME_V->args = cons (SCHEME_V->value, args);
5243 SCHEME_V->tok = token (SCHEME_A); 5120 SCHEME_V->tok = token (SCHEME_A);
5244 5121
5245 switch (SCHEME_V->tok) 5122 switch (SCHEME_V->tok)
5246 { 5123 {
5247 case TOK_EOF: 5124 case TOK_EOF:
… …
5275 case OP_RDDOT: 5152 case OP_RDDOT:
5276 if (token (SCHEME_A) != TOK_RPAREN) 5153 if (token (SCHEME_A) != TOK_RPAREN)
5277 Error_0 ("syntax error: illegal dot expression"); 5154 Error_0 ("syntax error: illegal dot expression");
5278 5155
5279 SCHEME_V->nesting_stack[SCHEME_V->file_i]--; 5156 SCHEME_V->nesting_stack[SCHEME_V->file_i]--;
5280 s_return (reverse_in_place (SCHEME_A_ SCHEME_V->value, SCHEME_V->args)); 5157 s_return (reverse_in_place (SCHEME_A_ SCHEME_V->value, args));
5281 5158
5282 case OP_RDQUOTE: 5159 case OP_RDQUOTE:
5283 s_return (cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL))); 5160 s_return (cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL)));
5284 5161
5285 case OP_RDQQUOTE: 5162 case OP_RDQQUOTE:
… …
5307 SCHEME_V->args = SCHEME_V->value; 5184 SCHEME_V->args = SCHEME_V->value;
5308 s_goto (OP_VECTOR); 5185 s_goto (OP_VECTOR);
5309 5186
5310 /* ========== printing part ========== */ 5187 /* ========== printing part ========== */
5311 case OP_P0LIST: 5188 case OP_P0LIST:
5312 if (is_vector (SCHEME_V->args)) 5189 if (is_vector (args))
5313 { 5190 {
5314 putstr (SCHEME_A_ "#("); 5191 putstr (SCHEME_A_ "#(");
5315 SCHEME_V->args = cons (SCHEME_V->args, mk_integer (SCHEME_A_ 0)); 5192 SCHEME_V->args = cons (args, mk_integer (SCHEME_A_ 0));
5316 s_goto (OP_PVECFROM); 5193 s_goto (OP_PVECFROM);
5317 } 5194 }
5318 else if (is_environment (SCHEME_V->args)) 5195 else if (is_environment (args))
5319 { 5196 {
5320 putstr (SCHEME_A_ "#<ENVIRONMENT>"); 5197 putstr (SCHEME_A_ "#<ENVIRONMENT>");
5321 s_return (S_T); 5198 s_return (S_T);
5322 } 5199 }
5323 else if (!is_pair (SCHEME_V->args)) 5200 else if (!is_pair (args))
5324 { 5201 {
5325 printatom (SCHEME_A_ SCHEME_V->args, SCHEME_V->print_flag); 5202 printatom (SCHEME_A_ args, SCHEME_V->print_flag);
5326 s_return (S_T); 5203 s_return (S_T);
5327 } 5204 }
5328 else if (car (SCHEME_V->args) == SCHEME_V->QUOTE && ok_abbrev (cdr (SCHEME_V->args))) 5205 else
5329 { 5206 {
5207 pointer a = car (args);
5208 pointer b = cdr (args);
5209 int ok_abbr = ok_abbrev (b);
5210 SCHEME_V->args = car (b);
5211
5212 if (a == SCHEME_V->QUOTE && ok_abbr)
5330 putstr (SCHEME_A_ "'"); 5213 putstr (SCHEME_A_ "'");
5331 SCHEME_V->args = cadr (SCHEME_V->args); 5214 else if (a == SCHEME_V->QQUOTE && ok_abbr)
5215 putstr (SCHEME_A_ "`");
5216 else if (a == SCHEME_V->UNQUOTE && ok_abbr)
5217 putstr (SCHEME_A_ ",");
5218 else if (a == SCHEME_V->UNQUOTESP && ok_abbr)
5219 putstr (SCHEME_A_ ",@");
5220 else
5221 {
5222 putstr (SCHEME_A_ "(");
5223 s_save (SCHEME_A_ OP_P1LIST, b, NIL);
5224 SCHEME_V->args = a;
5225 }
5226
5332 s_goto (OP_P0LIST); 5227 s_goto (OP_P0LIST);
5333 } 5228 }
5334 else if (car (SCHEME_V->args) == SCHEME_V->QQUOTE && ok_abbrev (cdr (SCHEME_V->args))) 5229
5230 case OP_P1LIST:
5231 if (is_pair (args))
5335 { 5232 {
5233 s_save (SCHEME_A_ OP_P1LIST, cdr (args), NIL);
5336 putstr (SCHEME_A_ "`"); 5234 putstr (SCHEME_A_ " ");
5337 SCHEME_V->args = cadr (SCHEME_V->args); 5235 SCHEME_V->args = car (args);
5338 s_goto (OP_P0LIST); 5236 s_goto (OP_P0LIST);
5339 } 5237 }
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)) 5238 else if (is_vector (args))
5369 { 5239 {
5370 s_save (SCHEME_A_ OP_P1LIST, NIL, NIL); 5240 s_save (SCHEME_A_ OP_P1LIST, NIL, NIL);
5371 putstr (SCHEME_A_ " . "); 5241 putstr (SCHEME_A_ " . ");
5372 s_goto (OP_P0LIST); 5242 s_goto (OP_P0LIST);
5373 } 5243 }
5374 else 5244 else
5375 { 5245 {
5376 if (SCHEME_V->args != NIL) 5246 if (args != NIL)
5377 { 5247 {
5378 putstr (SCHEME_A_ " . "); 5248 putstr (SCHEME_A_ " . ");
5379 printatom (SCHEME_A_ SCHEME_V->args, SCHEME_V->print_flag); 5249 printatom (SCHEME_A_ args, SCHEME_V->print_flag);
5380 } 5250 }
5381 5251
5382 putstr (SCHEME_A_ ")"); 5252 putstr (SCHEME_A_ ")");
5383 s_return (S_T); 5253 s_return (S_T);
5384 } 5254 }
5385 5255
5386 case OP_PVECFROM: 5256 case OP_PVECFROM:
5387 { 5257 {
5388 int i = ivalue_unchecked (cdr (SCHEME_V->args)); 5258 int i = ivalue_unchecked (cdr (args));
5389 pointer vec = car (SCHEME_V->args); 5259 pointer vec = car (args);
5390 int len = veclength (vec); 5260 int len = veclength (vec);
5391 5261
5392 if (i == len) 5262 if (i == len)
5393 { 5263 {
5394 putstr (SCHEME_A_ ")"); 5264 putstr (SCHEME_A_ ")");
5395 s_return (S_T); 5265 s_return (S_T);
5396 } 5266 }
5397 else 5267 else
5398 { 5268 {
5399 pointer elem = vector_elem (vec, i); 5269 pointer elem = vector_get (vec, i);
5400 5270
5401 ivalue_unchecked (cdr (SCHEME_V->args)) = i + 1; 5271 ivalue_unchecked (cdr (args)) = i + 1;
5402 s_save (SCHEME_A_ OP_PVECFROM, SCHEME_V->args, NIL); 5272 s_save (SCHEME_A_ OP_PVECFROM, args, NIL);
5403 SCHEME_V->args = elem; 5273 SCHEME_V->args = elem;
5404 5274
5405 if (i > 0) 5275 if (i > 0)
5406 putstr (SCHEME_A_ " "); 5276 putstr (SCHEME_A_ " ");
5407 5277
5408 s_goto (OP_P0LIST); 5278 s_goto (OP_P0LIST);
5409 } 5279 }
5410 } 5280 }
5411 } 5281 }
5412 5282
5413 return S_T; 5283 if (USE_ERROR_CHECKING) abort ();
5414} 5284}
5415 5285
5416static pointer 5286static int
5417opexe_6 (SCHEME_P_ enum scheme_opcodes op) 5287opexe_6 (SCHEME_P_ enum scheme_opcodes op)
5418{ 5288{
5289 pointer args = SCHEME_V->args;
5290 pointer a = car (args);
5419 pointer x, y; 5291 pointer x, y;
5420 5292
5421 switch (op) 5293 switch (op)
5422 { 5294 {
5423 case OP_LIST_LENGTH: /* length *//* a.k */ 5295 case OP_LIST_LENGTH: /* length *//* a.k */
5424 { 5296 {
5425 long v = list_length (SCHEME_A_ car (SCHEME_V->args)); 5297 long v = list_length (SCHEME_A_ a);
5426 5298
5427 if (v < 0) 5299 if (v < 0)
5428 Error_1 ("length: not a list:", car (SCHEME_V->args)); 5300 Error_1 ("length: not a list:", a);
5429 5301
5430 s_return (mk_integer (SCHEME_A_ v)); 5302 s_return (mk_integer (SCHEME_A_ v));
5431 } 5303 }
5432 5304
5433 case OP_ASSQ: /* assq *//* a.k */ 5305 case OP_ASSQ: /* assq *//* a.k */
5434 x = car (SCHEME_V->args); 5306 x = a;
5435 5307
5436 for (y = cadr (SCHEME_V->args); is_pair (y); y = cdr (y)) 5308 for (y = cadr (args); is_pair (y); y = cdr (y))
5437 { 5309 {
5438 if (!is_pair (car (y))) 5310 if (!is_pair (car (y)))
5439 Error_0 ("unable to handle non pair element"); 5311 Error_0 ("unable to handle non pair element");
5440 5312
5441 if (x == caar (y)) 5313 if (x == caar (y))
… …
5447 else 5319 else
5448 s_return (S_F); 5320 s_return (S_F);
5449 5321
5450 5322
5451 case OP_GET_CLOSURE: /* get-closure-code *//* a.k */ 5323 case OP_GET_CLOSURE: /* get-closure-code *//* a.k */
5452 SCHEME_V->args = car (SCHEME_V->args); 5324 SCHEME_V->args = a;
5453 5325
5454 if (SCHEME_V->args == NIL) 5326 if (SCHEME_V->args == NIL)
5455 s_return (S_F); 5327 s_return (S_F);
5456 else if (is_closure (SCHEME_V->args)) 5328 else if (is_closure (SCHEME_V->args))
5457 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value))); 5329 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value)));
… …
5462 5334
5463 case OP_CLOSUREP: /* closure? */ 5335 case OP_CLOSUREP: /* closure? */
5464 /* 5336 /*
5465 * Note, macro object is also a closure. 5337 * Note, macro object is also a closure.
5466 * Therefore, (closure? <#MACRO>) ==> #t 5338 * Therefore, (closure? <#MACRO>) ==> #t
5339 * (schmorp) well, obviously not, fix? TODO
5467 */ 5340 */
5468 s_retbool (is_closure (car (SCHEME_V->args))); 5341 s_retbool (is_closure (a));
5469 5342
5470 case OP_MACROP: /* macro? */ 5343 case OP_MACROP: /* macro? */
5471 s_retbool (is_macro (car (SCHEME_V->args))); 5344 s_retbool (is_macro (a));
5472 } 5345 }
5473 5346
5474 return S_T; /* NOTREACHED */ 5347 if (USE_ERROR_CHECKING) abort ();
5475} 5348}
5476 5349
5350/* 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); 5351typedef int (*dispatch_func)(SCHEME_P_ enum scheme_opcodes);
5478 5352
5479typedef int (*test_predicate) (pointer); 5353typedef int (*test_predicate)(pointer);
5480static int 5354static int
5481is_any (pointer p) 5355tst_any (pointer p)
5482{ 5356{
5483 return 1; 5357 return 1;
5484} 5358}
5485 5359
5486static int 5360static int
5487is_nonneg (pointer p) 5361tst_inonneg (pointer p)
5488{ 5362{
5489 return ivalue (p) >= 0 && is_integer (p); 5363 return is_integer (p) && ivalue_unchecked (p) >= 0;
5364}
5365
5366static int
5367tst_is_list (SCHEME_P_ pointer p)
5368{
5369 return p == NIL || is_pair (p);
5490} 5370}
5491 5371
5492/* Correspond carefully with following defines! */ 5372/* Correspond carefully with following defines! */
5493static struct 5373static struct
5494{ 5374{
5495 test_predicate fct; 5375 test_predicate fct;
5496 const char *kind; 5376 const char *kind;
5497} tests[] = 5377} tests[] = {
5498{ 5378 { tst_any , 0 },
5499 { 0, 0}, /* unused */ 5379 { is_string , "string" },
5500 { is_any, 0}, 5380 { is_symbol , "symbol" },
5501 { is_string, "string" }, 5381 { is_port , "port" },
5502 { is_symbol, "symbol" },
5503 { is_port, "port" },
5504 { is_inport, "input port" }, 5382 { is_inport , "input port" },
5505 { is_outport, "output port" }, 5383 { is_outport , "output port" },
5506 { is_environment, "environment" }, 5384 { is_environment, "environment" },
5507 { is_pair, "pair" }, 5385 { is_pair , "pair" },
5508 { 0, "pair or '()" }, 5386 { 0 , "pair or '()" },
5509 { is_character, "character" }, 5387 { is_character , "character" },
5510 { is_vector, "vector" }, 5388 { is_vector , "vector" },
5511 { is_number, "number" }, 5389 { is_number , "number" },
5512 { is_integer, "integer" }, 5390 { is_integer , "integer" },
5513 { is_nonneg, "non-negative integer" } 5391 { tst_inonneg , "non-negative integer" }
5514}; 5392};
5515 5393
5516#define TST_NONE 0 5394#define TST_NONE 0 /* TST_NONE used for built-ins, 0 for internal ops */
5517#define TST_ANY "\001" 5395#define TST_ANY "\001"
5518#define TST_STRING "\002" 5396#define TST_STRING "\002"
5519#define TST_SYMBOL "\003" 5397#define TST_SYMBOL "\003"
5520#define TST_PORT "\004" 5398#define TST_PORT "\004"
5521#define TST_INPORT "\005" 5399#define TST_INPORT "\005"
5522#define TST_OUTPORT "\006" 5400#define TST_OUTPORT "\006"
5523#define TST_ENVIRONMENT "\007" 5401#define TST_ENVIRONMENT "\007"
5524#define TST_PAIR "\010" 5402#define TST_PAIR "\010"
5525#define TST_LIST "\011" 5403#define TST_LIST "\011"
5526#define TST_CHAR "\012" 5404#define TST_CHAR "\012"
5527#define TST_VECTOR "\013" 5405#define TST_VECTOR "\013"
5528#define TST_NUMBER "\014" 5406#define TST_NUMBER "\014"
5529#define TST_INTEGER "\015" 5407#define TST_INTEGER "\015"
5530#define TST_NATURAL "\016" 5408#define TST_NATURAL "\016"
5409
5410#define INF_ARG 0xff
5411#define UNNAMED_OP ""
5412
5413static const char opnames[] =
5414#define OP_DEF(func,name,minarity,maxarity,argtest,op) name "\x00"
5415#include "opdefines.h"
5416#undef OP_DEF
5417;
5418
5419static const char *
5420opname (int idx)
5421{
5422 const char *name = opnames;
5423
5424 /* should do this at compile time, but would require external program, right? */
5425 while (idx--)
5426 name += strlen (name) + 1;
5427
5428 return *name ? name : "ILLEGAL";
5429}
5430
5431static const char *
5432procname (pointer x)
5433{
5434 return opname (procnum (x));
5435}
5531 5436
5532typedef struct 5437typedef struct
5533{ 5438{
5534 dispatch_func func; 5439 uint8_t func;
5535 char *name; 5440 /*dispatch_func func;*//*TODO: maybe optionally keep the pointer, for speed? */
5441 uint8_t builtin;
5442#if USE_ERROR_CHECKING
5536 int min_arity; 5443 uint8_t min_arity;
5537 int max_arity; 5444 uint8_t max_arity;
5538 char *arg_tests_encoding; 5445 char arg_tests_encoding[3];
5446#endif
5539} op_code_info; 5447} op_code_info;
5540 5448
5541#define INF_ARG 0xffff
5542
5543static op_code_info dispatch_table[] = { 5449static const op_code_info dispatch_table[] = {
5544#define OP_DEF(A,B,C,D,E,OP) {A,B,C,D,E}, 5450#if USE_ERROR_CHECKING
5451#define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1, minarity, maxarity, argtest },
5452#else
5453#define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1 },
5454#endif
5545#include "opdefines.h" 5455#include "opdefines.h"
5456#undef OP_DEF
5546 {0} 5457 {0}
5547}; 5458};
5548 5459
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 */ 5460/* kernel of this interpreter */
5562static void 5461static void ecb_hot
5563Eval_Cycle (SCHEME_P_ enum scheme_opcodes op) 5462Eval_Cycle (SCHEME_P_ enum scheme_opcodes op)
5564{ 5463{
5565 SCHEME_V->op = op; 5464 SCHEME_V->op = op;
5566 5465
5567 for (;;) 5466 for (;;)
5568 { 5467 {
5569 op_code_info *pcd = dispatch_table + SCHEME_V->op; 5468 const op_code_info *pcd = dispatch_table + SCHEME_V->op;
5570 5469
5571#if USE_ERROR_CHECKING 5470#if USE_ERROR_CHECKING
5572 if (pcd->name) /* if built-in function, check arguments */ 5471 if (pcd->builtin) /* if built-in function, check arguments */
5573 { 5472 {
5574 int ok = 1;
5575 char msg[STRBUFFSIZE]; 5473 char msg[STRBUFFSIZE];
5576 int n = list_length (SCHEME_A_ SCHEME_V->args); 5474 int n = list_length (SCHEME_A_ SCHEME_V->args);
5577 5475
5578 /* Check number of arguments */ 5476 /* Check number of arguments */
5579 if (n < pcd->min_arity) 5477 if (ecb_expect_false (n < pcd->min_arity))
5580 { 5478 {
5581 ok = 0;
5582 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", 5479 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)",
5583 pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity); 5480 opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity);
5481 xError_1 (SCHEME_A_ msg, 0);
5482 continue;
5584 } 5483 }
5585 5484 else if (ecb_expect_false (n > pcd->max_arity && pcd->max_arity != INF_ARG))
5586 if (ok && n > pcd->max_arity)
5587 { 5485 {
5588 ok = 0;
5589 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", 5486 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)",
5590 pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity); 5487 opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity);
5488 xError_1 (SCHEME_A_ msg, 0);
5489 continue;
5591 } 5490 }
5592 5491 else
5593 if (ok)
5594 { 5492 {
5595 if (pcd->arg_tests_encoding) 5493 if (*pcd->arg_tests_encoding) /* literal 0 and TST_NONE treated the same */
5596 { 5494 {
5597 int i = 0; 5495 int i = 0;
5598 int j; 5496 int j;
5599 const char *t = pcd->arg_tests_encoding; 5497 const char *t = pcd->arg_tests_encoding;
5600 pointer arglist = SCHEME_V->args; 5498 pointer arglist = SCHEME_V->args;
5601 5499
5602 do 5500 do
5603 { 5501 {
5604 pointer arg = car (arglist); 5502 pointer arg = car (arglist);
5605 5503
5606 j = (int) t[0]; 5504 j = t[0];
5607 5505
5506 /*TODO: tst_is_list has different prototype - fix if other tests acquire same prototype */
5608 if (j == TST_LIST[0]) 5507 if (j == TST_LIST[0])
5609 { 5508 {
5610 if (arg != NIL && !is_pair (arg)) 5509 if (!tst_is_list (SCHEME_A_ arg))
5611 break; 5510 break;
5612 } 5511 }
5613 else 5512 else
5614 { 5513 {
5615 if (!tests[j].fct (arg)) 5514 if (!tests[j - 1].fct (arg))
5616 break; 5515 break;
5617 } 5516 }
5618 5517
5619 if (t[1] != 0) /* last test is replicated as necessary */ 5518 if (t < pcd->arg_tests_encoding + sizeof (pcd->arg_tests_encoding) - 1 && t[1]) /* last test is replicated as necessary */
5620 t++; 5519 t++;
5621 5520
5622 arglist = cdr (arglist); 5521 arglist = cdr (arglist);
5623 i++; 5522 i++;
5624 } 5523 }
5625 while (i < n); 5524 while (i < n);
5626 5525
5627 if (i < n) 5526 if (i < n)
5628 { 5527 {
5629 ok = 0;
5630 snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", pcd->name, i + 1, tests[j].kind); 5528 snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", opname (SCHEME_V->op), i + 1, tests[j].kind);
5529 xError_1 (SCHEME_A_ msg, 0);
5530 continue;
5631 } 5531 }
5632 } 5532 }
5633 } 5533 }
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 } 5534 }
5643#endif 5535#endif
5644 5536
5645 ok_to_freely_gc (SCHEME_A); 5537 ok_to_freely_gc (SCHEME_A);
5646 5538
5647 if (pcd->func (SCHEME_A_ SCHEME_V->op) == NIL) 5539 static const dispatch_func dispatch_funcs[] = {
5540 opexe_0,
5541 opexe_1,
5542 opexe_2,
5543 opexe_3,
5544 opexe_4,
5545 opexe_5,
5546 opexe_6,
5547 };
5548
5549 if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0))
5648 return; 5550 return;
5649 5551
5650 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 5552 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
5651 { 5553 {
5652 xwrstr ("No memory!\n"); 5554 xwrstr ("No memory!\n");
… …
5676mk_proc (SCHEME_P_ enum scheme_opcodes op) 5578mk_proc (SCHEME_P_ enum scheme_opcodes op)
5677{ 5579{
5678 pointer y = get_cell (SCHEME_A_ NIL, NIL); 5580 pointer y = get_cell (SCHEME_A_ NIL, NIL);
5679 set_typeflag (y, (T_PROC | T_ATOM)); 5581 set_typeflag (y, (T_PROC | T_ATOM));
5680 ivalue_unchecked (y) = op; 5582 ivalue_unchecked (y) = op;
5681 set_num_integer (y);
5682 return y; 5583 return y;
5683} 5584}
5684 5585
5685/* Hard-coded for the given keywords. Remember to rewrite if more are added! */ 5586/* Hard-coded for the given keywords. Remember to rewrite if more are added! */
5686static int 5587static int
5687syntaxnum (pointer p) 5588syntaxnum (pointer p)
5688{ 5589{
5689 const char *s = strvalue (car (p)); 5590 const char *s = strvalue (p);
5690 5591
5691 switch (strlength (car (p))) 5592 switch (strlength (p))
5692 { 5593 {
5693 case 2: 5594 case 2:
5694 if (s[0] == 'i') 5595 if (s[0] == 'i')
5695 return OP_IF0; /* if */ 5596 return OP_IF0; /* if */
5696 else 5597 else
… …
5710 5611
5711 case 'd': 5612 case 'd':
5712 return OP_COND0; /* cond */ 5613 return OP_COND0; /* cond */
5713 5614
5714 case '*': 5615 case '*':
5715 return OP_LET0AST; /* let* */ 5616 return OP_LET0AST;/* let* */
5716 5617
5717 default: 5618 default:
5718 return OP_SET0; /* set! */ 5619 return OP_SET0; /* set! */
5719 } 5620 }
5720 5621
… …
5742 5643
5743 case 'f': 5644 case 'f':
5744 return OP_DEF0; /* define */ 5645 return OP_DEF0; /* define */
5745 5646
5746 default: 5647 default:
5747 return OP_LET0REC; /* letrec */ 5648 return OP_LET0REC;/* letrec */
5748 } 5649 }
5749 5650
5750 default: 5651 default:
5751 return OP_C0STREAM; /* cons-stream */ 5652 return OP_C0STREAM; /* cons-stream */
5752 } 5653 }
5753} 5654}
5754 5655
5755#if USE_MULTIPLICITY 5656#if USE_MULTIPLICITY
5756scheme * 5657ecb_cold scheme *
5757scheme_init_new () 5658scheme_init_new ()
5758{ 5659{
5759 scheme *sc = malloc (sizeof (scheme)); 5660 scheme *sc = malloc (sizeof (scheme));
5760 5661
5761 if (!scheme_init (SCHEME_A)) 5662 if (!scheme_init (SCHEME_A))
… …
5766 else 5667 else
5767 return sc; 5668 return sc;
5768} 5669}
5769#endif 5670#endif
5770 5671
5771int 5672ecb_cold int
5772scheme_init (SCHEME_P) 5673scheme_init (SCHEME_P)
5773{ 5674{
5774 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]); 5675 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]);
5775 pointer x; 5676 pointer x;
5677
5678 memset (SCHEME_V, 0, sizeof (*SCHEME_V));//TODO !iso c
5776 5679
5777 num_set_fixnum (num_zero, 1); 5680 num_set_fixnum (num_zero, 1);
5778 num_set_ivalue (num_zero, 0); 5681 num_set_ivalue (num_zero, 0);
5779 num_set_fixnum (num_one, 1); 5682 num_set_fixnum (num_one, 1);
5780 num_set_ivalue (num_one, 1); 5683 num_set_ivalue (num_one, 1);
… …
5849 5752
5850 for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i) 5753 for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i)
5851 assign_syntax (SCHEME_A_ syntax_names[i]); 5754 assign_syntax (SCHEME_A_ syntax_names[i]);
5852 } 5755 }
5853 5756
5757 // TODO: should iterate via strlen, to avoid n² complexity
5854 for (i = 0; i < n; i++) 5758 for (i = 0; i < n; i++)
5855 if (dispatch_table[i].name != 0) 5759 if (dispatch_table[i].builtin)
5856 assign_proc (SCHEME_A_ i, dispatch_table[i].name); 5760 assign_proc (SCHEME_A_ i, opname (i));
5857 5761
5858 /* initialization of global pointers to special symbols */ 5762 /* initialization of global pointers to special symbols */
5859 SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda"); 5763 SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda");
5860 SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote"); 5764 SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote");
5861 SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote"); 5765 SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote");
… …
5900scheme_set_external_data (SCHEME_P_ void *p) 5804scheme_set_external_data (SCHEME_P_ void *p)
5901{ 5805{
5902 SCHEME_V->ext_data = p; 5806 SCHEME_V->ext_data = p;
5903} 5807}
5904 5808
5905void 5809ecb_cold void
5906scheme_deinit (SCHEME_P) 5810scheme_deinit (SCHEME_P)
5907{ 5811{
5908 int i; 5812 int i;
5909 5813
5910#if SHOW_ERROR_LINE 5814#if SHOW_ERROR_LINE
… …
6002{ 5906{
6003 dump_stack_reset (SCHEME_A); 5907 dump_stack_reset (SCHEME_A);
6004 SCHEME_V->envir = SCHEME_V->global_env; 5908 SCHEME_V->envir = SCHEME_V->global_env;
6005 SCHEME_V->file_i = 0; 5909 SCHEME_V->file_i = 0;
6006 SCHEME_V->load_stack[0].kind = port_input | port_string; 5910 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 */ 5911 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); 5912 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; 5913 SCHEME_V->load_stack[0].rep.string.curr = (char *)cmd;
6010#if USE_PORTS 5914#if USE_PORTS
6011 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack); 5915 SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack);
6012#endif 5916#endif
6013 SCHEME_V->retcode = 0; 5917 SCHEME_V->retcode = 0;
6014 SCHEME_V->interactive_repl = 0; 5918 SCHEME_V->interactive_repl = 0;
… …
6131# endif 6035# endif
6132 int fin; 6036 int fin;
6133 char *file_name = InitFile; 6037 char *file_name = InitFile;
6134 int retcode; 6038 int retcode;
6135 int isfile = 1; 6039 int isfile = 1;
6040 system ("ps v $PPID");//D
6136 6041
6137 if (argc == 2 && strcmp (argv[1], "-?") == 0) 6042 if (argc == 2 && strcmp (argv[1], "-?") == 0)
6138 { 6043 {
6139 xwrstr ("Usage: tinyscheme -?\n"); 6044 xwrstr ("Usage: tinyscheme -?\n");
6140 xwrstr ("or: tinyscheme [<file1> <file2> ...]\n"); 6045 xwrstr ("or: tinyscheme [<file1> <file2> ...]\n");

Diff Legend

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