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.17 by root, Thu Nov 26 10:15:51 2015 UTC vs.
Revision 1.47 by root, Mon Nov 30 09:25:19 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)
68#define S_EOF (&SCHEME_V->xEOF_OBJ) 88#define S_EOF (&SCHEME_V->xEOF_OBJ)
69 89
70/* should use libecb */
71#if __GNUC__ >= 4
72# define ecb_expect(expr,value) __builtin_expect ((expr),(value))
73# define ecb_expect_false(expr) ecb_expect (!!(expr), 0)
74# define ecb_expect_true(expr) ecb_expect (!!(expr), 1)
75#else
76# define ecb_expect_false(expr) !!(expr)
77# define ecb_expect_true(expr) !!(expr)
78#endif
79
80#if !USE_MULTIPLICITY 90#if !USE_MULTIPLICITY
81static scheme sc; 91static scheme sc;
82#endif 92#endif
83 93
84static void 94static void
… …
153 163
154#define toupper(c) xtoupper (c) 164#define toupper(c) xtoupper (c)
155#define tolower(c) xtolower (c) 165#define tolower(c) xtolower (c)
156#define isdigit(c) xisdigit (c) 166#define isdigit(c) xisdigit (c)
157 167
158#if USE_STRLWR 168#if USE_IGNORECASE
159static const char * 169static const char *
160strlwr (char *s) 170xstrlwr (char *s)
161{ 171{
162 const char *p = s; 172 const char *p = s;
163 173
164 while (*s) 174 while (*s)
165 { 175 {
… …
167 s++; 177 s++;
168 } 178 }
169 179
170 return p; 180 return p;
171} 181}
172#endif
173 182
183#define stricmp(a,b) strcasecmp (a, b)
184#define strlwr(s) xstrlwr (s)
185
186#else
174#define stricmp(a,b) strcmp (a, b) 187# define stricmp(a,b) strcmp (a, b)
175#define strlwr(s) (s) 188# define strlwr(s) (s)
189#endif
176 190
177#ifndef prompt 191#ifndef prompt
178# define prompt "ts> " 192# define prompt "ts> "
179#endif 193#endif
180 194
… …
186# define FIRST_CELLSEGS 3 200# define FIRST_CELLSEGS 3
187#endif 201#endif
188 202
189enum scheme_types 203enum scheme_types
190{ 204{
205 T_INTEGER,
191 T_FREE, 206 T_REAL,
192 T_STRING, 207 T_STRING,
193 T_NUMBER,
194 T_SYMBOL, 208 T_SYMBOL,
195 T_PROC, 209 T_PROC,
196 T_PAIR, 210 T_PAIR, /* also used for free cells */
197 T_CLOSURE, 211 T_CLOSURE,
198 T_CONTINUATION, 212 T_CONTINUATION,
199 T_FOREIGN, 213 T_FOREIGN,
200 T_CHARACTER, 214 T_CHARACTER,
201 T_PORT, 215 T_PORT,
… …
211#define T_SYNTAX 0x0010 225#define T_SYNTAX 0x0010
212#define T_IMMUTABLE 0x0020 226#define T_IMMUTABLE 0x0020
213#define T_ATOM 0x0040 /* only for gc */ 227#define T_ATOM 0x0040 /* only for gc */
214#define T_MARK 0x0080 /* only for gc */ 228#define T_MARK 0x0080 /* only for gc */
215 229
230/* num, for generic arithmetic */
231struct num
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
216enum num_op { NUM_ADD, NUM_SUB, NUM_MUL, NUM_INTDIV }; 256enum num_op { NUM_ADD, NUM_SUB, NUM_MUL, NUM_INTDIV };
217 257
218static num num_op (enum num_op op, num a, num b); 258static num num_op (enum num_op op, num a, num b);
219static num num_intdiv (num a, num b); 259static num num_intdiv (num a, num b);
220static num num_rem (num a, num b); 260static num num_rem (num a, num b);
… …
223#if USE_MATH 263#if USE_MATH
224static double round_per_R5RS (double x); 264static double round_per_R5RS (double x);
225#endif 265#endif
226static int is_zero_rvalue (RVALUE x); 266static int is_zero_rvalue (RVALUE x);
227 267
228static INLINE int
229num_is_integer (pointer p)
230{
231 return num_is_fixnum (p->object.number);
232}
233
234static num num_zero; 268static num num_zero;
235static num num_one; 269static num num_one;
236 270
237/* macros for cell operations */ 271/* macros for cell operations */
238#define typeflag(p) ((p)->flag + 0) 272#define typeflag(p) ((p)->flag + 0)
239#define set_typeflag(p,v) ((p)->flag = (v)) 273#define set_typeflag(p,v) ((p)->flag = (v))
240#define type(p) (typeflag (p) & T_MASKTYPE) 274#define type(p) (typeflag (p) & T_MASKTYPE)
241 275
242INTERFACE INLINE int 276INTERFACE int
243is_string (pointer p) 277is_string (pointer p)
244{ 278{
245 return type (p) == T_STRING; 279 return type (p) == T_STRING;
246} 280}
247 281
248#define strvalue(p) ((p)->object.string.svalue) 282#define strvalue(p) ((p)->object.string.svalue)
249#define strlength(p) ((p)->object.string.length) 283#define strlength(p) ((p)->object.string.length)
250 284
251INTERFACE int is_list (SCHEME_P_ pointer p);
252INTERFACE INLINE int 285INTERFACE int
253is_vector (pointer p) 286is_vector (pointer p)
254{ 287{
255 return type (p) == T_VECTOR; 288 return type (p) == T_VECTOR;
256} 289}
257 290
258#define vecvalue(p) ((p)->object.vector.vvalue) 291#define vecvalue(p) ((p)->object.vector.vvalue)
259#define veclength(p) ((p)->object.vector.length) 292#define veclength(p) ((p)->object.vector.length)
260INTERFACE void fill_vector (pointer vec, pointer obj); 293INTERFACE void fill_vector (pointer vec, uint32_t start, pointer obj);
261INTERFACE uint32_t vector_length (pointer vec);
262INTERFACE pointer vector_elem (pointer vec, uint32_t ielem); 294INTERFACE pointer vector_get (pointer vec, uint32_t ielem);
263INTERFACE void set_vector_elem (pointer vec, uint32_t ielem, pointer a); 295INTERFACE void vector_set (pointer vec, uint32_t ielem, pointer a);
264 296
265INTERFACE uint32_t 297INTERFACE int
266vector_length (pointer vec) 298is_integer (pointer p)
267{ 299{
268 return vec->object.vector.length; 300 return type (p) == T_INTEGER;
269} 301}
270 302
303/* not the same as in scheme, where integers are (correctly :) reals */
271INTERFACE INLINE int 304INTERFACE int
305is_real (pointer p)
306{
307 return type (p) == T_REAL;
308}
309
310INTERFACE int
272is_number (pointer p) 311is_number (pointer p)
273{ 312{
274 return type (p) == T_NUMBER; 313 return is_integer (p) || is_real (p);
275} 314}
276 315
277INTERFACE INLINE int 316INTERFACE int
278is_integer (pointer p)
279{
280 if (!is_number (p))
281 return 0;
282
283 if (num_is_integer (p) || ivalue (p) == rvalue (p))
284 return 1;
285
286 return 0;
287}
288
289INTERFACE INLINE int
290is_real (pointer p)
291{
292 return is_number (p) && !num_is_fixnum (p->object.number);
293}
294
295INTERFACE INLINE int
296is_character (pointer p) 317is_character (pointer p)
297{ 318{
298 return type (p) == T_CHARACTER; 319 return type (p) == T_CHARACTER;
299} 320}
300 321
301INTERFACE INLINE char * 322INTERFACE char *
302string_value (pointer p) 323string_value (pointer p)
303{ 324{
304 return strvalue (p); 325 return strvalue (p);
305} 326}
306 327
307INLINE num
308nvalue (pointer p)
309{
310 return (p)->object.number;
311}
312
313static IVALUE
314num_get_ivalue (const num n)
315{
316 return num_is_fixnum (n) ? num_ivalue (n) : (IVALUE)num_rvalue (n);
317}
318
319static RVALUE
320num_get_rvalue (const num n)
321{
322 return num_is_fixnum (n) ? (RVALUE)num_ivalue (n) : num_rvalue (n);
323}
324
325INTERFACE IVALUE
326ivalue (pointer p)
327{
328 return num_get_ivalue (p->object.number);
329}
330
331INTERFACE RVALUE
332rvalue (pointer p)
333{
334 return num_get_rvalue (p->object.number);
335}
336
337#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
338#if USE_REAL 331#if USE_REAL
339# define rvalue_unchecked(p) ((p)->object.number.value.rvalue) 332#define rvalue_unchecked(p) (p)->object.rvalue
340# define set_num_integer(p) (p)->object.number.is_fixnum=1; 333#define set_rvalue(p,v) (p)->object.rvalue = (v)
341# define set_num_real(p) (p)->object.number.is_fixnum=0;
342#else 334#else
343# define rvalue_unchecked(p) ((p)->object.number.value.ivalue) 335#define rvalue_unchecked(p) (p)->object.ivalue
344# define set_num_integer(p) 0 336#define set_rvalue(p,v) (p)->object.ivalue = (v)
345# define set_num_real(p) 0
346#endif 337#endif
338
347INTERFACE long 339INTERFACE long
348charvalue (pointer p) 340charvalue (pointer p)
349{ 341{
350 return ivalue_unchecked (p); 342 return ivalue_unchecked (p);
351} 343}
352 344
353INTERFACE INLINE int 345INTERFACE int
354is_port (pointer p) 346is_port (pointer p)
355{ 347{
356 return type (p) == T_PORT; 348 return type (p) == T_PORT;
357} 349}
358 350
359INTERFACE INLINE int 351INTERFACE int
360is_inport (pointer p) 352is_inport (pointer p)
361{ 353{
362 return is_port (p) && p->object.port->kind & port_input; 354 return is_port (p) && p->object.port->kind & port_input;
363} 355}
364 356
365INTERFACE INLINE int 357INTERFACE int
366is_outport (pointer p) 358is_outport (pointer p)
367{ 359{
368 return is_port (p) && p->object.port->kind & port_output; 360 return is_port (p) && p->object.port->kind & port_output;
369} 361}
370 362
371INTERFACE INLINE int 363INTERFACE int
372is_pair (pointer p) 364is_pair (pointer p)
373{ 365{
374 return type (p) == T_PAIR; 366 return type (p) == T_PAIR;
375} 367}
376 368
… …
408pair_cdr (pointer p) 400pair_cdr (pointer p)
409{ 401{
410 return cdr (p); 402 return cdr (p);
411} 403}
412 404
413INTERFACE INLINE int 405INTERFACE int
414is_symbol (pointer p) 406is_symbol (pointer p)
415{ 407{
416 return type (p) == T_SYMBOL; 408 return type (p) == T_SYMBOL;
417} 409}
418 410
419INTERFACE INLINE char * 411INTERFACE char *
420symname (pointer p) 412symname (pointer p)
421{ 413{
422 return strvalue (car (p)); 414 return strvalue (p);
423} 415}
424 416
425#if USE_PLIST 417#if USE_PLIST
418#error plists are broken because symbols are no longer pairs
419#define symprop(p) cdr(p)
426SCHEME_EXPORT INLINE int 420SCHEME_EXPORT int
427hasprop (pointer p) 421hasprop (pointer p)
428{ 422{
429 return typeflag (p) & T_SYMBOL; 423 return typeflag (p) & T_SYMBOL;
430} 424}
431
432# define symprop(p) cdr(p)
433#endif 425#endif
434 426
435INTERFACE INLINE int 427INTERFACE int
436is_syntax (pointer p) 428is_syntax (pointer p)
437{ 429{
438 return typeflag (p) & T_SYNTAX; 430 return typeflag (p) & T_SYNTAX;
439} 431}
440 432
441INTERFACE INLINE int 433INTERFACE int
442is_proc (pointer p) 434is_proc (pointer p)
443{ 435{
444 return type (p) == T_PROC; 436 return type (p) == T_PROC;
445} 437}
446 438
447INTERFACE INLINE int 439INTERFACE int
448is_foreign (pointer p) 440is_foreign (pointer p)
449{ 441{
450 return type (p) == T_FOREIGN; 442 return type (p) == T_FOREIGN;
451} 443}
452 444
453INTERFACE INLINE char * 445INTERFACE char *
454syntaxname (pointer p) 446syntaxname (pointer p)
455{ 447{
456 return strvalue (car (p)); 448 return strvalue (p);
457} 449}
458 450
459#define procnum(p) ivalue (p) 451#define procnum(p) ivalue_unchecked (p)
460static const char *procname (pointer x); 452static const char *procname (pointer x);
461 453
462INTERFACE INLINE int 454INTERFACE int
463is_closure (pointer p) 455is_closure (pointer p)
464{ 456{
465 return type (p) == T_CLOSURE; 457 return type (p) == T_CLOSURE;
466} 458}
467 459
468INTERFACE INLINE int 460INTERFACE int
469is_macro (pointer p) 461is_macro (pointer p)
470{ 462{
471 return type (p) == T_MACRO; 463 return type (p) == T_MACRO;
472} 464}
473 465
474INTERFACE INLINE pointer 466INTERFACE pointer
475closure_code (pointer p) 467closure_code (pointer p)
476{ 468{
477 return car (p); 469 return car (p);
478} 470}
479 471
480INTERFACE INLINE pointer 472INTERFACE pointer
481closure_env (pointer p) 473closure_env (pointer p)
482{ 474{
483 return cdr (p); 475 return cdr (p);
484} 476}
485 477
486INTERFACE INLINE int 478INTERFACE int
487is_continuation (pointer p) 479is_continuation (pointer p)
488{ 480{
489 return type (p) == T_CONTINUATION; 481 return type (p) == T_CONTINUATION;
490} 482}
491 483
492#define cont_dump(p) cdr (p) 484#define cont_dump(p) cdr (p)
493#define set_cont_dump(p,v) set_cdr ((p), (v)) 485#define set_cont_dump(p,v) set_cdr ((p), (v))
494 486
495/* To do: promise should be forced ONCE only */ 487/* To do: promise should be forced ONCE only */
496INTERFACE INLINE int 488INTERFACE int
497is_promise (pointer p) 489is_promise (pointer p)
498{ 490{
499 return type (p) == T_PROMISE; 491 return type (p) == T_PROMISE;
500} 492}
501 493
502INTERFACE INLINE int 494INTERFACE int
503is_environment (pointer p) 495is_environment (pointer p)
504{ 496{
505 return type (p) == T_ENVIRONMENT; 497 return type (p) == T_ENVIRONMENT;
506} 498}
507 499
… …
513 505
514#define is_mark(p) (typeflag (p) & T_MARK) 506#define is_mark(p) (typeflag (p) & T_MARK)
515#define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK) 507#define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK)
516#define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK) 508#define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK)
517 509
518INTERFACE INLINE int 510INTERFACE int
519is_immutable (pointer p) 511is_immutable (pointer p)
520{ 512{
521 return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING; 513 return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING;
522} 514}
523 515
524INTERFACE INLINE void 516INTERFACE void
525setimmutable (pointer p) 517setimmutable (pointer p)
526{ 518{
527#if USE_ERROR_CHECKING 519#if USE_ERROR_CHECKING
528 set_typeflag (p, typeflag (p) | T_IMMUTABLE); 520 set_typeflag (p, typeflag (p) | T_IMMUTABLE);
529#endif 521#endif
530} 522}
531 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
532#if USE_CHAR_CLASSIFIERS 578#if USE_CHAR_CLASSIFIERS
533static INLINE int 579ecb_inline int
534Cisalpha (int c) 580Cisalpha (int c)
535{ 581{
536 return isascii (c) && isalpha (c); 582 return isascii (c) && isalpha (c);
537} 583}
538 584
539static INLINE int 585ecb_inline int
540Cisdigit (int c) 586Cisdigit (int c)
541{ 587{
542 return isascii (c) && isdigit (c); 588 return isascii (c) && isdigit (c);
543} 589}
544 590
545static INLINE int 591ecb_inline int
546Cisspace (int c) 592Cisspace (int c)
547{ 593{
548 return isascii (c) && isspace (c); 594 return isascii (c) && isspace (c);
549} 595}
550 596
551static INLINE int 597ecb_inline int
552Cisupper (int c) 598Cisupper (int c)
553{ 599{
554 return isascii (c) && isupper (c); 600 return isascii (c) && isupper (c);
555} 601}
556 602
557static INLINE int 603ecb_inline int
558Cislower (int c) 604Cislower (int c)
559{ 605{
560 return isascii (c) && islower (c); 606 return isascii (c) && islower (c);
561} 607}
562#endif 608#endif
… …
623#endif 669#endif
624 670
625static int file_push (SCHEME_P_ const char *fname); 671static int file_push (SCHEME_P_ const char *fname);
626static void file_pop (SCHEME_P); 672static void file_pop (SCHEME_P);
627static int file_interactive (SCHEME_P); 673static int file_interactive (SCHEME_P);
628static INLINE int is_one_of (char *s, int c); 674ecb_inline int is_one_of (const char *s, int c);
629static int alloc_cellseg (SCHEME_P_ int n); 675static int alloc_cellseg (SCHEME_P_ int n);
630static INLINE pointer get_cell (SCHEME_P_ pointer a, pointer b); 676ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b);
631static void finalize_cell (SCHEME_P_ pointer a); 677static void finalize_cell (SCHEME_P_ pointer a);
632static int count_consecutive_cells (pointer x, int needed); 678static int count_consecutive_cells (pointer x, int needed);
633static 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);
634static pointer mk_number (SCHEME_P_ const num n); 680static pointer mk_number (SCHEME_P_ const num n);
635static 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);
… …
650static void mark (pointer a); 696static void mark (pointer a);
651static void gc (SCHEME_P_ pointer a, pointer b); 697static void gc (SCHEME_P_ pointer a, pointer b);
652static int basic_inchar (port *pt); 698static int basic_inchar (port *pt);
653static int inchar (SCHEME_P); 699static int inchar (SCHEME_P);
654static void backchar (SCHEME_P_ int c); 700static void backchar (SCHEME_P_ int c);
655static char *readstr_upto (SCHEME_P_ char *delim); 701static char *readstr_upto (SCHEME_P_ int skip, const char *delim);
656static pointer readstrexp (SCHEME_P); 702static pointer readstrexp (SCHEME_P_ char delim);
657static INLINE int skipspace (SCHEME_P); 703ecb_inline int skipspace (SCHEME_P);
658static int token (SCHEME_P); 704static int token (SCHEME_P);
659static void printslashstring (SCHEME_P_ char *s, int len); 705static void printslashstring (SCHEME_P_ char *s, int len);
660static 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);
661static void printatom (SCHEME_P_ pointer l, int f); 707static void printatom (SCHEME_P_ pointer l, int f);
662static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op); 708static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op);
… …
666static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list); 712static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list);
667static pointer revappend (SCHEME_P_ pointer a, pointer b); 713static pointer revappend (SCHEME_P_ pointer a, pointer b);
668static pointer ss_get_cont (SCHEME_P); 714static pointer ss_get_cont (SCHEME_P);
669static void ss_set_cont (SCHEME_P_ pointer cont); 715static void ss_set_cont (SCHEME_P_ pointer cont);
670static void dump_stack_mark (SCHEME_P); 716static void dump_stack_mark (SCHEME_P);
671static 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);
672static pointer opexe_2 (SCHEME_P_ enum scheme_opcodes op); 719static int opexe_2 (SCHEME_P_ enum scheme_opcodes op);
673static pointer opexe_r (SCHEME_P_ enum scheme_opcodes op);
674static pointer opexe_3 (SCHEME_P_ enum scheme_opcodes op); 720static int opexe_3 (SCHEME_P_ enum scheme_opcodes op);
675static pointer opexe_4 (SCHEME_P_ enum scheme_opcodes op); 721static int opexe_4 (SCHEME_P_ enum scheme_opcodes op);
676static pointer opexe_5 (SCHEME_P_ enum scheme_opcodes op); 722static int opexe_5 (SCHEME_P_ enum scheme_opcodes op);
677static pointer opexe_6 (SCHEME_P_ enum scheme_opcodes op); 723static int opexe_6 (SCHEME_P_ enum scheme_opcodes op);
678static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op); 724static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op);
679static void assign_syntax (SCHEME_P_ const char *name); 725static void assign_syntax (SCHEME_P_ const char *name);
680static int syntaxnum (pointer p); 726static int syntaxnum (pointer p);
681static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name); 727static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name);
682 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
683static num 756static num
684num_op (enum num_op op, num a, num b) 757num_op (enum num_op op, num a, num b)
685{ 758{
686 num ret; 759 num ret;
687 760
688 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));
689 762
690 if (num_is_fixnum (ret)) 763 if (num_is_fixnum (ret))
691 { 764 {
692 IVALUE av = num_get_ivalue (a);
693 IVALUE bv = num_get_ivalue (b);
694
695 switch (op) 765 switch (op)
696 { 766 {
697 case NUM_ADD: av += bv; break; 767 case NUM_ADD: a.ivalue += b.ivalue; break;
698 case NUM_SUB: av -= bv; break; 768 case NUM_SUB: a.ivalue -= b.ivalue; break;
699 case NUM_MUL: av *= bv; break; 769 case NUM_MUL: a.ivalue *= b.ivalue; break;
700 case NUM_INTDIV: av /= bv; break; 770 case NUM_INTDIV: a.ivalue /= b.ivalue; break;
701 } 771 }
702 772
703 num_set_ivalue (ret, av); 773 num_set_ivalue (ret, a.ivalue);
704 } 774 }
775#if USE_REAL
705 else 776 else
706 { 777 {
707 RVALUE av = num_get_rvalue (a);
708 RVALUE bv = num_get_rvalue (b);
709
710 switch (op) 778 switch (op)
711 { 779 {
712 case NUM_ADD: av += bv; break; 780 case NUM_ADD: a.rvalue += b.rvalue; break;
713 case NUM_SUB: av -= bv; break; 781 case NUM_SUB: a.rvalue -= b.rvalue; break;
714 case NUM_MUL: av *= bv; break; 782 case NUM_MUL: a.rvalue *= b.rvalue; break;
715 case NUM_INTDIV: av /= bv; break; 783 case NUM_INTDIV: a.rvalue /= b.rvalue; break;
716 } 784 }
717 785
718 num_set_rvalue (ret, av); 786 num_set_rvalue (ret, a.rvalue);
719 } 787 }
788#endif
720 789
721 return ret; 790 return ret;
722} 791}
723 792
724static num 793static num
725num_div (num a, num b) 794num_div (num a, num b)
726{ 795{
727 num ret; 796 num ret;
728 797
729 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);
730 799
731 if (num_is_fixnum (ret)) 800 if (num_is_fixnum (ret))
732 num_set_ivalue (ret, num_get_ivalue (a) / num_get_ivalue (b)); 801 num_set_ivalue (ret, num_ivalue (a) / num_ivalue (b));
733 else 802 else
734 num_set_rvalue (ret, num_get_rvalue (a) / num_get_rvalue (b)); 803 num_set_rvalue (ret, num_rvalue (a) / num_rvalue (b));
735 804
736 return ret; 805 return ret;
737} 806}
738 807
739static num 808static num
… …
741{ 810{
742 num ret; 811 num ret;
743 long e1, e2, res; 812 long e1, e2, res;
744 813
745 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));
746 e1 = num_get_ivalue (a); 815 e1 = num_ivalue (a);
747 e2 = num_get_ivalue (b); 816 e2 = num_ivalue (b);
748 res = e1 % e2; 817 res = e1 % e2;
749 818
750 /* remainder should have same sign as second operand */ 819 /* remainder should have same sign as second operand */
751 if (res > 0) 820 if (res > 0)
752 { 821 {
… …
768{ 837{
769 num ret; 838 num ret;
770 long e1, e2, res; 839 long e1, e2, res;
771 840
772 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));
773 e1 = num_get_ivalue (a); 842 e1 = num_ivalue (a);
774 e2 = num_get_ivalue (b); 843 e2 = num_ivalue (b);
775 res = e1 % e2; 844 res = e1 % e2;
776 845
777 /* modulo should have same sign as second operand */ 846 /* modulo should have same sign as second operand */
778 if (res * e2 < 0) 847 if (res * e2 < 0)
779 res += e2; 848 res += e2;
780 849
781 num_set_ivalue (ret, res); 850 num_set_ivalue (ret, res);
782 return ret; 851 return ret;
783} 852}
784 853
785/* this completely disrespects NaNs */ 854/* this completely disrespects NaNs, but r5rs doesn't even allow NaNs */
786static int 855static int
787num_cmp (num a, num b) 856num_cmp (num a, num b)
788{ 857{
789 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b); 858 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
790 int ret; 859 int ret;
791 860
792 if (is_fixnum) 861 if (is_fixnum)
793 { 862 {
794 IVALUE av = num_get_ivalue (a); 863 IVALUE av = num_ivalue (a);
795 IVALUE bv = num_get_ivalue (b); 864 IVALUE bv = num_ivalue (b);
796 865
797 ret = av == bv ? 0 : av < bv ? -1 : +1; 866 ret = av == bv ? 0 : av < bv ? -1 : +1;
798 } 867 }
799 else 868 else
800 { 869 {
801 RVALUE av = num_get_rvalue (a); 870 RVALUE av = num_rvalue (a);
802 RVALUE bv = num_get_rvalue (b); 871 RVALUE bv = num_rvalue (b);
803 872
804 ret = av == bv ? 0 : av < bv ? -1 : +1; 873 ret = av == bv ? 0 : av < bv ? -1 : +1;
805 } 874 }
806 875
807 return ret; 876 return ret;
… …
833#endif 902#endif
834 903
835static int 904static int
836is_zero_rvalue (RVALUE x) 905is_zero_rvalue (RVALUE x)
837{ 906{
907 return x == 0;
908#if 0
838#if USE_REAL 909#if USE_REAL
839 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. */
840#else 911#else
841 return x == 0; 912 return x == 0;
913#endif
842#endif 914#endif
843} 915}
844 916
845/* allocate new cell segment */ 917/* allocate new cell segment */
846static int 918static int
… …
867 return k; 939 return k;
868 940
869 i = ++SCHEME_V->last_cell_seg; 941 i = ++SCHEME_V->last_cell_seg;
870 SCHEME_V->alloc_seg[i] = cp; 942 SCHEME_V->alloc_seg[i] = cp;
871 943
872 /* insert new segment in address order */
873 newp = (pointer)cp; 944 newp = (pointer)cp;
874 SCHEME_V->cell_seg[i] = newp; 945 SCHEME_V->cell_seg[i] = newp;
875 SCHEME_V->cell_segsize[i] = segsize; 946 SCHEME_V->cell_segsize[i] = segsize;
876
877 //TODO: insert, not swap
878 while (i > 0 && SCHEME_V->cell_seg[i - 1] > SCHEME_V->cell_seg[i])
879 {
880 p = SCHEME_V->cell_seg[i];
881 SCHEME_V->cell_seg[i] = SCHEME_V->cell_seg[i - 1];
882 SCHEME_V->cell_seg[i - 1] = p;
883
884 k = SCHEME_V->cell_segsize[i];
885 SCHEME_V->cell_segsize[i] = SCHEME_V->cell_segsize[i - 1];
886 SCHEME_V->cell_segsize[i - 1] = k;
887
888 --i;
889 }
890
891 SCHEME_V->fcells += segsize; 947 SCHEME_V->fcells += segsize;
892 last = newp + segsize - 1; 948 last = newp + segsize - 1;
893 949
894 for (p = newp; p <= last; p++) 950 for (p = newp; p <= last; p++)
895 { 951 {
896 set_typeflag (p, T_FREE); 952 set_typeflag (p, T_PAIR);
897 set_car (p, NIL); 953 set_car (p, NIL);
898 set_cdr (p, p + 1); 954 set_cdr (p, p + 1);
899 } 955 }
900 956
901 /* insert new cells in address order on free list */
902 if (SCHEME_V->free_cell == NIL || p < SCHEME_V->free_cell)
903 {
904 set_cdr (last, SCHEME_V->free_cell); 957 set_cdr (last, SCHEME_V->free_cell);
905 SCHEME_V->free_cell = newp; 958 SCHEME_V->free_cell = newp;
906 }
907 else
908 {
909 p = SCHEME_V->free_cell;
910
911 while (cdr (p) != NIL && newp > cdr (p))
912 p = cdr (p);
913
914 set_cdr (last, cdr (p));
915 set_cdr (p, newp);
916 }
917 } 959 }
918 960
919 return n; 961 return n;
920} 962}
921 963
922/* get new cell. parameter a, b is marked by gc. */ 964/* get new cell. parameter a, b is marked by gc. */
923static INLINE pointer 965ecb_inline pointer
924get_cell_x (SCHEME_P_ pointer a, pointer b) 966get_cell_x (SCHEME_P_ pointer a, pointer b)
925{ 967{
926 if (ecb_expect_false (SCHEME_V->free_cell == NIL)) 968 if (ecb_expect_false (SCHEME_V->free_cell == NIL))
927 { 969 {
928 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 970 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
929 return S_SINK; 971 return S_SINK;
930 972
931 if (SCHEME_V->free_cell == NIL) 973 if (SCHEME_V->free_cell == NIL)
932 { 974 {
933 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;
934 976
935 gc (SCHEME_A_ a, b); 977 gc (SCHEME_A_ a, b);
936 978
937 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)
938 { 980 {
… …
989} 1031}
990 1032
991static pointer 1033static pointer
992get_vector_object (SCHEME_P_ uint32_t len, pointer init) 1034get_vector_object (SCHEME_P_ uint32_t len, pointer init)
993{ 1035{
994 pointer v = get_cell_x (SCHEME_A_ 0, 0); 1036 pointer v = get_cell_x (SCHEME_A_ NIL, NIL);
995 pointer *e = malloc (len * sizeof (pointer)); 1037 pointer *e = malloc (len * sizeof (pointer));
996 1038
997 if (!e && USE_ERROR_CHECKING) 1039 if (!e && USE_ERROR_CHECKING)
998 return S_SINK; 1040 return S_SINK;
999 1041
1000 /* Record it as a vector so that gc understands it. */ 1042 /* Record it as a vector so that gc understands it. */
1001 set_typeflag (v, T_VECTOR | T_ATOM); 1043 set_typeflag (v, T_VECTOR | T_ATOM);
1002 1044
1003 v->object.vector.vvalue = e; 1045 v->object.vector.vvalue = e;
1004 v->object.vector.length = len; 1046 v->object.vector.length = len;
1005 fill_vector (v, init); 1047 fill_vector (v, 0, init);
1006 push_recent_alloc (SCHEME_A_ v, NIL); 1048 push_recent_alloc (SCHEME_A_ v, NIL);
1007 1049
1008 return v; 1050 return v;
1009} 1051}
1010 1052
1011static INLINE void 1053ecb_inline void
1012ok_to_freely_gc (SCHEME_P) 1054ok_to_freely_gc (SCHEME_P)
1013{ 1055{
1014 set_car (S_SINK, NIL); 1056 set_car (S_SINK, NIL);
1015} 1057}
1016 1058
… …
1053 set_cdr (x, b); 1095 set_cdr (x, b);
1054 1096
1055 return x; 1097 return x;
1056} 1098}
1057 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
1058/* ========== oblist implementation ========== */ 1109/* ========== oblist implementation ========== */
1059 1110
1060#ifndef USE_OBJECT_LIST 1111#ifndef USE_OBJECT_LIST
1061 1112
1113static int
1062static 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}
1063 1124
1064static pointer 1125static pointer
1065oblist_initial_value (SCHEME_P) 1126oblist_initial_value (SCHEME_P)
1066{ 1127{
1067 return mk_vector (SCHEME_A_ 461); /* probably should be bigger */ 1128 return mk_vector (SCHEME_A_ 461); /* probably should be bigger */
… …
1069 1130
1070/* returns the new symbol */ 1131/* returns the new symbol */
1071static pointer 1132static pointer
1072oblist_add_by_name (SCHEME_P_ const char *name) 1133oblist_add_by_name (SCHEME_P_ const char *name)
1073{ 1134{
1074 int location; 1135 pointer x = generate_symbol (SCHEME_A_ name);
1075
1076 pointer x = immutable_cons (mk_string (SCHEME_A_ name), NIL);
1077 set_typeflag (x, T_SYMBOL);
1078 setimmutable (car (x));
1079
1080 location = hash_fn (name, veclength (SCHEME_V->oblist)); 1136 int location = hash_fn (name, veclength (SCHEME_V->oblist));
1081 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)));
1082 return x; 1138 return x;
1083} 1139}
1084 1140
1085static INLINE pointer 1141ecb_inline pointer
1086oblist_find_by_name (SCHEME_P_ const char *name) 1142oblist_find_by_name (SCHEME_P_ const char *name)
1087{ 1143{
1088 int location; 1144 int location;
1089 pointer x; 1145 pointer x;
1090 char *s; 1146 char *s;
1091 1147
1092 location = hash_fn (name, veclength (SCHEME_V->oblist)); 1148 location = hash_fn (name, veclength (SCHEME_V->oblist));
1093 1149
1094 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))
1095 { 1151 {
1096 s = symname (car (x)); 1152 s = symname (car (x));
1097 1153
1098 /* case-insensitive, per R5RS section 2 */ 1154 /* case-insensitive, per R5RS section 2 */
1099 if (stricmp (name, s) == 0) 1155 if (stricmp (name, s) == 0)
… …
1109 int i; 1165 int i;
1110 pointer x; 1166 pointer x;
1111 pointer ob_list = NIL; 1167 pointer ob_list = NIL;
1112 1168
1113 for (i = 0; i < veclength (SCHEME_V->oblist); i++) 1169 for (i = 0; i < veclength (SCHEME_V->oblist); i++)
1114 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))
1115 ob_list = cons (x, ob_list); 1171 ob_list = cons (x, ob_list);
1116 1172
1117 return ob_list; 1173 return ob_list;
1118} 1174}
1119 1175
… …
1123oblist_initial_value (SCHEME_P) 1179oblist_initial_value (SCHEME_P)
1124{ 1180{
1125 return NIL; 1181 return NIL;
1126} 1182}
1127 1183
1128static INLINE pointer 1184ecb_inline pointer
1129oblist_find_by_name (SCHEME_P_ const char *name) 1185oblist_find_by_name (SCHEME_P_ const char *name)
1130{ 1186{
1131 pointer x; 1187 pointer x;
1132 char *s; 1188 char *s;
1133 1189
… …
1145 1201
1146/* returns the new symbol */ 1202/* returns the new symbol */
1147static pointer 1203static pointer
1148oblist_add_by_name (SCHEME_P_ const char *name) 1204oblist_add_by_name (SCHEME_P_ const char *name)
1149{ 1205{
1150 pointer x; 1206 pointer x = mk_string (SCHEME_A_ name);
1151
1152 x = immutable_cons (mk_string (SCHEME_A_ name), NIL);
1153 set_typeflag (x, T_SYMBOL); 1207 set_typeflag (x, T_SYMBOL);
1154 setimmutable (car (x)); 1208 setimmutable (x);
1155 SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist); 1209 SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist);
1156 return x; 1210 return x;
1157} 1211}
1158 1212
1159static pointer 1213static pointer
… …
1192mk_character (SCHEME_P_ int c) 1246mk_character (SCHEME_P_ int c)
1193{ 1247{
1194 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1248 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1195 1249
1196 set_typeflag (x, (T_CHARACTER | T_ATOM)); 1250 set_typeflag (x, (T_CHARACTER | T_ATOM));
1197 ivalue_unchecked (x) = c & 0xff; 1251 set_ivalue (x, c & 0xff);
1198 set_num_integer (x); 1252
1199 return x; 1253 return x;
1200} 1254}
1201 1255
1202/* get number atom (integer) */ 1256/* get number atom (integer) */
1203INTERFACE pointer 1257INTERFACE pointer
1204mk_integer (SCHEME_P_ long num) 1258mk_integer (SCHEME_P_ long n)
1205{ 1259{
1206 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1260 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1207 1261
1208 set_typeflag (x, (T_NUMBER | T_ATOM)); 1262 set_typeflag (x, (T_INTEGER | T_ATOM));
1209 ivalue_unchecked (x) = num; 1263 set_ivalue (x, n);
1210 set_num_integer (x); 1264
1211 return x; 1265 return x;
1212} 1266}
1213 1267
1214INTERFACE pointer 1268INTERFACE pointer
1215mk_real (SCHEME_P_ RVALUE n) 1269mk_real (SCHEME_P_ RVALUE n)
1216{ 1270{
1271#if USE_REAL
1217 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1272 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1218 1273
1219 set_typeflag (x, (T_NUMBER | T_ATOM)); 1274 set_typeflag (x, (T_REAL | T_ATOM));
1220 rvalue_unchecked (x) = n; 1275 set_rvalue (x, n);
1221 set_num_real (x); 1276
1222 return x; 1277 return x;
1278#else
1279 return mk_integer (SCHEME_A_ n);
1280#endif
1223} 1281}
1224 1282
1225static pointer 1283static pointer
1226mk_number (SCHEME_P_ const num n) 1284mk_number (SCHEME_P_ const num n)
1227{ 1285{
1286#if USE_REAL
1228 if (num_is_fixnum (n)) 1287 return num_is_fixnum (n)
1288 ? mk_integer (SCHEME_A_ num_ivalue (n))
1289 : mk_real (SCHEME_A_ num_rvalue (n));
1290#else
1229 return mk_integer (SCHEME_A_ num_get_ivalue (n)); 1291 return mk_integer (SCHEME_A_ num_ivalue (n));
1230 else 1292#endif
1231 return mk_real (SCHEME_A_ num_get_rvalue (n));
1232} 1293}
1233 1294
1234/* allocate name to string area */ 1295/* allocate name to string area */
1235static char * 1296static char *
1236store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill) 1297store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill)
… …
1242 SCHEME_V->no_memory = 1; 1303 SCHEME_V->no_memory = 1;
1243 return SCHEME_V->strbuff; 1304 return SCHEME_V->strbuff;
1244 } 1305 }
1245 1306
1246 if (str) 1307 if (str)
1247 { 1308 memcpy (q, str , len_str); /* caller must ensure that *str has length len_str */
1248 int l = strlen (str);
1249
1250 if (l > len_str)
1251 l = len_str;
1252
1253 memcpy (q, str, l);
1254 q[l] = 0;
1255 }
1256 else 1309 else
1257 {
1258 memset (q, fill, len_str); 1310 memset (q, fill, len_str);
1311
1259 q[len_str] = 0; 1312 q[len_str] = 0;
1260 }
1261 1313
1262 return q; 1314 return q;
1263} 1315}
1264 1316
1265INTERFACE pointer 1317INTERFACE pointer
… …
1279 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1331 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1280 1332
1281 set_typeflag (x, T_STRING | T_ATOM); 1333 set_typeflag (x, T_STRING | T_ATOM);
1282 strvalue (x) = store_string (SCHEME_A_ len, str, 0); 1334 strvalue (x) = store_string (SCHEME_A_ len, str, 0);
1283 strlength (x) = len; 1335 strlength (x) = len;
1336
1284 return x; 1337 return x;
1285} 1338}
1286 1339
1287INTERFACE pointer 1340INTERFACE pointer
1288mk_string (SCHEME_P_ const char *str) 1341mk_string (SCHEME_P_ const char *str)
… …
1295{ 1348{
1296 return get_vector_object (SCHEME_A_ len, NIL); 1349 return get_vector_object (SCHEME_A_ len, NIL);
1297} 1350}
1298 1351
1299INTERFACE void 1352INTERFACE void
1300fill_vector (pointer vec, pointer obj) 1353fill_vector (pointer vec, uint32_t start, pointer obj)
1301{ 1354{
1302 int i; 1355 int i;
1303 1356
1304 for (i = 0; i < vec->object.vector.length; i++) 1357 for (i = start; i < veclength (vec); i++)
1305 vecvalue (vec)[i] = obj; 1358 vecvalue (vec)[i] = obj;
1306} 1359}
1307 1360
1361INTERFACE void
1362vector_resize (pointer vec, uint32_t newsize, pointer fill)
1363{
1364 uint32_t oldsize = veclength (vec);
1365 vecvalue (vec) = realloc (vecvalue (vec), newsize * sizeof (pointer));
1366 veclength (vec) = newsize;
1367 fill_vector (vec, oldsize, fill);
1368}
1369
1308INTERFACE pointer 1370INTERFACE pointer
1309vector_elem (pointer vec, uint32_t ielem) 1371vector_get (pointer vec, uint32_t ielem)
1310{ 1372{
1311 return vecvalue(vec)[ielem]; 1373 return vecvalue(vec)[ielem];
1312} 1374}
1313 1375
1314INTERFACE void 1376INTERFACE void
1315set_vector_elem (pointer vec, uint32_t ielem, pointer a) 1377vector_set (pointer vec, uint32_t ielem, pointer a)
1316{ 1378{
1317 vecvalue(vec)[ielem] = a; 1379 vecvalue(vec)[ielem] = a;
1318} 1380}
1319 1381
1320/* get new symbol */ 1382/* get new symbol */
… …
1332 1394
1333INTERFACE pointer 1395INTERFACE pointer
1334gensym (SCHEME_P) 1396gensym (SCHEME_P)
1335{ 1397{
1336 pointer x; 1398 pointer x;
1337
1338 for (; SCHEME_V->gensym_cnt < LONG_MAX; SCHEME_V->gensym_cnt++)
1339 {
1340 char name[40] = "gensym-"; 1399 char name[40] = "gensym-";
1341 xnum (name + 7, SCHEME_V->gensym_cnt); 1400 xnum (name + 7, ++SCHEME_V->gensym_cnt);
1342 1401
1343 /* first check oblist */ 1402 return generate_symbol (SCHEME_A_ name);
1344 x = oblist_find_by_name (SCHEME_A_ name); 1403}
1345 1404
1346 if (x == NIL) 1405static int
1347 { 1406is_gensym (SCHEME_P_ pointer x)
1348 x = oblist_add_by_name (SCHEME_A_ name); 1407{
1349 return x; 1408 return is_symbol (x) && oblist_find_by_name (SCHEME_A_ strvalue (x)) != x;
1350 }
1351 }
1352
1353 return NIL;
1354} 1409}
1355 1410
1356/* make symbol or number atom from string */ 1411/* make symbol or number atom from string */
1357static pointer 1412static pointer
1358mk_atom (SCHEME_P_ char *q) 1413mk_atom (SCHEME_P_ char *q)
… …
1412 } 1467 }
1413 else if ((c == 'e') || (c == 'E')) 1468 else if ((c == 'e') || (c == 'E'))
1414 { 1469 {
1415 if (!has_fp_exp) 1470 if (!has_fp_exp)
1416 { 1471 {
1417 has_dec_point = 1; /* decimal point illegal 1472 has_dec_point = 1; /* decimal point illegal from now on */
1418 from now on */
1419 p++; 1473 p++;
1420 1474
1421 if ((*p == '-') || (*p == '+') || isdigit (*p)) 1475 if ((*p == '-') || (*p == '+') || isdigit (*p))
1422 continue; 1476 continue;
1423 } 1477 }
… …
1511 1565
1512 if (ecb_expect_false (is_vector (p))) 1566 if (ecb_expect_false (is_vector (p)))
1513 { 1567 {
1514 int i; 1568 int i;
1515 1569
1516 for (i = 0; i < p->object.vector.length; i++) 1570 for (i = 0; i < veclength (p); i++)
1517 mark (vecvalue (p)[i]); 1571 mark (vecvalue (p)[i]);
1518 } 1572 }
1519 1573
1520 if (is_atom (p)) 1574 if (is_atom (p))
1521 goto E6; 1575 goto E6;
… …
1603 /* garbage collect */ 1657 /* garbage collect */
1604 clrmark (NIL); 1658 clrmark (NIL);
1605 SCHEME_V->fcells = 0; 1659 SCHEME_V->fcells = 0;
1606 SCHEME_V->free_cell = NIL; 1660 SCHEME_V->free_cell = NIL;
1607 1661
1608 /* free-list is kept sorted by address so as to maintain consecutive 1662 if (SCHEME_V->gc_verbose)
1609 ranges, if possible, for use with vectors. Here we scan the cells 1663 xwrstr ("freeing...");
1610 (which are also kept sorted by address) downwards to build the 1664
1611 free-list in sorted order. 1665 uint32_t total = 0;
1612 */ 1666
1667 /* Here we scan the cells to build the free-list. */
1613 for (i = SCHEME_V->last_cell_seg; i >= 0; i--) 1668 for (i = SCHEME_V->last_cell_seg; i >= 0; i--)
1614 { 1669 {
1615 p = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i]; 1670 pointer end = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i];
1671 total += SCHEME_V->cell_segsize [i];
1616 1672
1617 while (--p >= SCHEME_V->cell_seg[i]) 1673 for (p = SCHEME_V->cell_seg[i]; p < end; ++p)
1618 { 1674 {
1619 if (is_mark (p)) 1675 if (is_mark (p))
1620 clrmark (p); 1676 clrmark (p);
1621 else 1677 else
1622 { 1678 {
1623 /* reclaim cell */ 1679 /* reclaim cell */
1624 if (typeflag (p) != T_FREE) 1680 if (typeflag (p) != T_PAIR)
1625 { 1681 {
1626 finalize_cell (SCHEME_A_ p); 1682 finalize_cell (SCHEME_A_ p);
1627 set_typeflag (p, T_FREE); 1683 set_typeflag (p, T_PAIR);
1628 set_car (p, NIL); 1684 set_car (p, NIL);
1629 } 1685 }
1630 1686
1631 ++SCHEME_V->fcells; 1687 ++SCHEME_V->fcells;
1632 set_cdr (p, SCHEME_V->free_cell); 1688 set_cdr (p, SCHEME_V->free_cell);
… …
1634 } 1690 }
1635 } 1691 }
1636 } 1692 }
1637 1693
1638 if (SCHEME_V->gc_verbose) 1694 if (SCHEME_V->gc_verbose)
1695 {
1639 xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" cells were recovered.\n"); 1696 xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" out of "); xwrnum (total); xwrstr (" cells were recovered.\n");
1697 }
1640} 1698}
1641 1699
1642static void 1700static void
1643finalize_cell (SCHEME_P_ pointer a) 1701finalize_cell (SCHEME_P_ pointer a)
1644{ 1702{
1645 /* TODO, fast bitmap check? */ 1703 /* TODO, fast bitmap check? */
1646 if (is_string (a)) 1704 if (is_string (a) || is_symbol (a))
1647 free (strvalue (a)); 1705 free (strvalue (a));
1648 else if (is_vector (a)) 1706 else if (is_vector (a))
1649 free (vecvalue (a)); 1707 free (vecvalue (a));
1650#if USE_PORTS 1708#if USE_PORTS
1651 else if (is_port (a)) 1709 else if (is_port (a))
… …
2073#endif 2131#endif
2074} 2132}
2075 2133
2076/* read characters up to delimiter, but cater to character constants */ 2134/* read characters up to delimiter, but cater to character constants */
2077static char * 2135static char *
2078readstr_upto (SCHEME_P_ char *delim) 2136readstr_upto (SCHEME_P_ int skip, const char *delim)
2079{ 2137{
2080 char *p = SCHEME_V->strbuff; 2138 char *p = SCHEME_V->strbuff + skip;
2081 2139
2082 while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A)))); 2140 while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A))));
2083 2141
2084 if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\') 2142 if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\')
2085 *p = 0; 2143 *p = 0;
… …
2092 return SCHEME_V->strbuff; 2150 return SCHEME_V->strbuff;
2093} 2151}
2094 2152
2095/* read string expression "xxx...xxx" */ 2153/* read string expression "xxx...xxx" */
2096static pointer 2154static pointer
2097readstrexp (SCHEME_P) 2155readstrexp (SCHEME_P_ char delim)
2098{ 2156{
2099 char *p = SCHEME_V->strbuff; 2157 char *p = SCHEME_V->strbuff;
2100 int c; 2158 int c;
2101 int c1 = 0; 2159 int c1 = 0;
2102 enum
2103 { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok; 2160 enum { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok;
2104 2161
2105 for (;;) 2162 for (;;)
2106 { 2163 {
2107 c = inchar (SCHEME_A); 2164 c = inchar (SCHEME_A);
2108 2165
… …
2110 return S_F; 2167 return S_F;
2111 2168
2112 switch (state) 2169 switch (state)
2113 { 2170 {
2114 case st_ok: 2171 case st_ok:
2115 switch (c) 2172 if (ecb_expect_false (c == delim))
2116 {
2117 case '\\':
2118 state = st_bsl;
2119 break;
2120
2121 case '"':
2122 *p = 0;
2123 return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff); 2173 return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff);
2124 2174
2125 default: 2175 if (ecb_expect_false (c == '\\'))
2176 state = st_bsl;
2177 else
2126 *p++ = c; 2178 *p++ = c;
2127 break;
2128 }
2129 2179
2130 break; 2180 break;
2131 2181
2132 case st_bsl: 2182 case st_bsl:
2133 switch (c) 2183 switch (c)
… …
2163 case 'r': 2213 case 'r':
2164 *p++ = '\r'; 2214 *p++ = '\r';
2165 state = st_ok; 2215 state = st_ok;
2166 break; 2216 break;
2167 2217
2168 case '"':
2169 *p++ = '"';
2170 state = st_ok;
2171 break;
2172
2173 default: 2218 default:
2174 *p++ = c; 2219 *p++ = c;
2175 state = st_ok; 2220 state = st_ok;
2176 break; 2221 break;
2177 } 2222 }
2178 2223
2179 break; 2224 break;
2180 2225
2181 case st_x1: 2226 case st_x1:
2182 case st_x2: 2227 case st_x2:
2183 c = toupper (c); 2228 c = tolower (c);
2184 2229
2185 if (c >= '0' && c <= 'F') 2230 if (c >= '0' && c <= '9')
2186 {
2187 if (c <= '9')
2188 c1 = (c1 << 4) + c - '0'; 2231 c1 = (c1 << 4) + c - '0';
2189 else 2232 else if (c >= 'a' && c <= 'f')
2190 c1 = (c1 << 4) + c - 'A' + 10; 2233 c1 = (c1 << 4) + c - 'a' + 10;
2191
2192 if (state == st_x1)
2193 state = st_x2;
2194 else
2195 {
2196 *p++ = c1;
2197 state = st_ok;
2198 }
2199 }
2200 else 2234 else
2201 return S_F; 2235 return S_F;
2236
2237 if (state == st_x1)
2238 state = st_x2;
2239 else
2240 {
2241 *p++ = c1;
2242 state = st_ok;
2243 }
2202 2244
2203 break; 2245 break;
2204 2246
2205 case st_oct1: 2247 case st_oct1:
2206 case st_oct2: 2248 case st_oct2:
… …
2210 backchar (SCHEME_A_ c); 2252 backchar (SCHEME_A_ c);
2211 state = st_ok; 2253 state = st_ok;
2212 } 2254 }
2213 else 2255 else
2214 { 2256 {
2215 if (state == st_oct2 && c1 >= 32) 2257 if (state == st_oct2 && c1 >= ' ')
2216 return S_F; 2258 return S_F;
2217 2259
2218 c1 = (c1 << 3) + (c - '0'); 2260 c1 = (c1 << 3) + (c - '0');
2219 2261
2220 if (state == st_oct1) 2262 if (state == st_oct1)
… …
2225 state = st_ok; 2267 state = st_ok;
2226 } 2268 }
2227 } 2269 }
2228 2270
2229 break; 2271 break;
2230
2231 } 2272 }
2232 } 2273 }
2233} 2274}
2234 2275
2235/* check c is in chars */ 2276/* check c is in chars */
2236static INLINE int 2277ecb_inline int
2237is_one_of (char *s, int c) 2278is_one_of (const char *s, int c)
2238{ 2279{
2239 if (c == EOF)
2240 return 1;
2241
2242 return !!strchr (s, c); 2280 return c == EOF || !!strchr (s, c);
2243} 2281}
2244 2282
2245/* skip white characters */ 2283/* skip white characters */
2246static INLINE int 2284ecb_inline int
2247skipspace (SCHEME_P) 2285skipspace (SCHEME_P)
2248{ 2286{
2249 int c, curr_line = 0; 2287 int c, curr_line = 0;
2250 2288
2251 do 2289 do
2252 { 2290 {
2253 c = inchar (SCHEME_A); 2291 c = inchar (SCHEME_A);
2292
2254#if SHOW_ERROR_LINE 2293#if SHOW_ERROR_LINE
2255 if (c == '\n') 2294 if (ecb_expect_false (c == '\n'))
2256 curr_line++; 2295 curr_line++;
2257#endif 2296#endif
2297
2298 if (ecb_expect_false (c == EOF))
2299 return c;
2258 } 2300 }
2259 while (c == ' ' || c == '\n' || c == '\r' || c == '\t'); 2301 while (is_one_of (WHITESPACE, c));
2260 2302
2261 /* record it */ 2303 /* record it */
2262#if SHOW_ERROR_LINE 2304#if SHOW_ERROR_LINE
2263 if (SCHEME_V->load_stack[SCHEME_V->file_i].kind & port_file) 2305 if (SCHEME_V->load_stack[SCHEME_V->file_i].kind & port_file)
2264 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line += curr_line; 2306 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line += curr_line;
2265#endif 2307#endif
2266 2308
2267 if (c != EOF)
2268 {
2269 backchar (SCHEME_A_ c); 2309 backchar (SCHEME_A_ c);
2270 return 1; 2310 return 1;
2271 }
2272 else
2273 return EOF;
2274} 2311}
2275 2312
2276/* get token */ 2313/* get token */
2277static int 2314static int
2278token (SCHEME_P) 2315token (SCHEME_P)
… …
2294 return TOK_RPAREN; 2331 return TOK_RPAREN;
2295 2332
2296 case '.': 2333 case '.':
2297 c = inchar (SCHEME_A); 2334 c = inchar (SCHEME_A);
2298 2335
2299 if (is_one_of (" \n\t", c)) 2336 if (is_one_of (WHITESPACE, c))
2300 return TOK_DOT; 2337 return TOK_DOT;
2301 else 2338 else
2302 { 2339 {
2303 //TODO: ungetc twice in a row is not supported in C
2304 backchar (SCHEME_A_ c); 2340 backchar (SCHEME_A_ c);
2305 backchar (SCHEME_A_ '.');
2306 return TOK_ATOM; 2341 return TOK_DOTATOM;
2307 } 2342 }
2343
2344 case '|':
2345 return TOK_STRATOM;
2308 2346
2309 case '\'': 2347 case '\'':
2310 return TOK_QUOTE; 2348 return TOK_QUOTE;
2311 2349
2312 case ';': 2350 case ';':
… …
2444 } 2482 }
2445 2483
2446 putcharacter (SCHEME_A_ '"'); 2484 putcharacter (SCHEME_A_ '"');
2447} 2485}
2448 2486
2449
2450/* print atoms */ 2487/* print atoms */
2451static void 2488static void
2452printatom (SCHEME_P_ pointer l, int f) 2489printatom (SCHEME_P_ pointer l, int f)
2453{ 2490{
2454 char *p; 2491 char *p;
2455 int len; 2492 int len;
2456 2493
2457 atom2str (SCHEME_A_ l, f, &p, &len); 2494 atom2str (SCHEME_A_ l, f, &p, &len);
2458 putchars (SCHEME_A_ p, len); 2495 putchars (SCHEME_A_ p, len);
2459} 2496}
2460
2461 2497
2462/* Uses internal buffer unless string pointer is already available */ 2498/* Uses internal buffer unless string pointer is already available */
2463static void 2499static void
2464atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen) 2500atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen)
2465{ 2501{
… …
2479 { 2515 {
2480 p = SCHEME_V->strbuff; 2516 p = SCHEME_V->strbuff;
2481 2517
2482 if (f <= 1 || f == 10) /* f is the base for numbers if > 1 */ 2518 if (f <= 1 || f == 10) /* f is the base for numbers if > 1 */
2483 { 2519 {
2484 if (num_is_integer (l)) 2520 if (is_integer (l))
2485 xnum (p, ivalue_unchecked (l)); 2521 xnum (p, ivalue_unchecked (l));
2486#if USE_REAL 2522#if USE_REAL
2487 else 2523 else
2488 { 2524 {
2489 snprintf (p, STRBUFFSIZE, "%.10g", rvalue_unchecked (l)); 2525 snprintf (p, STRBUFFSIZE, "%.10g", rvalue_unchecked (l));
… …
2626#endif 2662#endif
2627 } 2663 }
2628 else if (is_continuation (l)) 2664 else if (is_continuation (l))
2629 p = "#<CONTINUATION>"; 2665 p = "#<CONTINUATION>";
2630 else 2666 else
2667 {
2668#if USE_PRINTF
2669 p = SCHEME_V->strbuff;
2670 snprintf (p, STRBUFFSIZE, "#<ERROR %x>", (int)typeflag (l));
2671#else
2631 p = "#<ERROR>"; 2672 p = "#<ERROR>";
2673#endif
2674 }
2632 2675
2633 *pp = p; 2676 *pp = p;
2634 *plen = strlen (p); 2677 *plen = strlen (p);
2635} 2678}
2636 2679
… …
2744 return 0; 2787 return 0;
2745 } 2788 }
2746 else if (is_number (a)) 2789 else if (is_number (a))
2747 { 2790 {
2748 if (is_number (b)) 2791 if (is_number (b))
2749 if (num_is_integer (a) == num_is_integer (b))
2750 return num_cmp (nvalue (a), nvalue (b)) == 0; 2792 return num_cmp (nvalue (a), nvalue (b)) == 0;
2751 2793
2752 return 0; 2794 return 0;
2753 } 2795 }
2754 else if (is_character (a)) 2796 else if (is_character (a))
2755 { 2797 {
… …
2781/* () is #t in R5RS */ 2823/* () is #t in R5RS */
2782#define is_true(p) ((p) != S_F) 2824#define is_true(p) ((p) != S_F)
2783#define is_false(p) ((p) == S_F) 2825#define is_false(p) ((p) == S_F)
2784 2826
2785/* ========== Environment implementation ========== */ 2827/* ========== Environment implementation ========== */
2786
2787#if !defined(USE_ALIST_ENV) || !defined(USE_OBJECT_LIST)
2788
2789static int
2790hash_fn (const char *key, int table_size)
2791{
2792 const unsigned char *p = key;
2793 uint32_t hash = 2166136261;
2794
2795 while (*p)
2796 hash = (hash ^ *p++) * 16777619;
2797
2798 return hash % table_size;
2799}
2800#endif
2801 2828
2802#ifndef USE_ALIST_ENV 2829#ifndef USE_ALIST_ENV
2803 2830
2804/* 2831/*
2805 * In this implementation, each frame of the environment may be 2832 * In this implementation, each frame of the environment may be
… …
2822 2849
2823 SCHEME_V->envir = immutable_cons (new_frame, old_env); 2850 SCHEME_V->envir = immutable_cons (new_frame, old_env);
2824 setenvironment (SCHEME_V->envir); 2851 setenvironment (SCHEME_V->envir);
2825} 2852}
2826 2853
2827static INLINE void 2854static uint32_t
2855sym_hash (pointer sym, uint32_t size)
2856{
2857 uintptr_t ptr = (uintptr_t)sym;
2858
2859#if 0
2860 /* table size is prime, so why mix */
2861 ptr += ptr >> 32;
2862 ptr += ptr >> 16;
2863 ptr += ptr >> 8;
2864#endif
2865
2866 return ptr % size;
2867}
2868
2869ecb_inline void
2828new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) 2870new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
2829{ 2871{
2830 pointer slot = immutable_cons (variable, value); 2872 pointer slot = immutable_cons (variable, value);
2831 2873
2832 if (is_vector (car (env))) 2874 if (is_vector (car (env)))
2833 { 2875 {
2834 int location = hash_fn (symname (variable), veclength (car (env))); 2876 int location = sym_hash (variable, veclength (car (env)));
2835
2836 set_vector_elem (car (env), location, immutable_cons (slot, vector_elem (car (env), location))); 2877 vector_set (car (env), location, immutable_cons (slot, vector_get (car (env), location)));
2837 } 2878 }
2838 else 2879 else
2839 set_car (env, immutable_cons (slot, car (env))); 2880 set_car (env, immutable_cons (slot, car (env)));
2840} 2881}
2841 2882
2842static pointer 2883static pointer
2843find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all) 2884find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all)
2844{ 2885{
2845 pointer x, y; 2886 pointer x, y;
2846 int location;
2847 2887
2848 for (x = env; x != NIL; x = cdr (x)) 2888 for (x = env; x != NIL; x = cdr (x))
2849 { 2889 {
2850 if (is_vector (car (x))) 2890 if (is_vector (car (x)))
2851 { 2891 {
2852 location = hash_fn (symname (hdl), veclength (car (x))); 2892 int location = sym_hash (hdl, veclength (car (x)));
2853 y = vector_elem (car (x), location); 2893 y = vector_get (car (x), location);
2854 } 2894 }
2855 else 2895 else
2856 y = car (x); 2896 y = car (x);
2857 2897
2858 for (; y != NIL; y = cdr (y)) 2898 for (; y != NIL; y = cdr (y))
2859 if (caar (y) == hdl) 2899 if (caar (y) == hdl)
2860 break; 2900 break;
2861 2901
2862 if (y != NIL) 2902 if (y != NIL)
2903 return car (y);
2904
2905 if (!all)
2863 break; 2906 break;
2864
2865 if (!all)
2866 return NIL;
2867 } 2907 }
2868
2869 if (x != NIL)
2870 return car (y);
2871 2908
2872 return NIL; 2909 return NIL;
2873} 2910}
2874 2911
2875#else /* USE_ALIST_ENV */ 2912#else /* USE_ALIST_ENV */
2876 2913
2877static INLINE void 2914ecb_inline void
2878new_frame_in_env (SCHEME_P_ pointer old_env) 2915new_frame_in_env (SCHEME_P_ pointer old_env)
2879{ 2916{
2880 SCHEME_V->envir = immutable_cons (NIL, old_env); 2917 SCHEME_V->envir = immutable_cons (NIL, old_env);
2881 setenvironment (SCHEME_V->envir); 2918 setenvironment (SCHEME_V->envir);
2882} 2919}
2883 2920
2884static INLINE void 2921ecb_inline void
2885new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) 2922new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
2886{ 2923{
2887 set_car (env, immutable_cons (immutable_cons (variable, value), car (env))); 2924 set_car (env, immutable_cons (immutable_cons (variable, value), car (env)));
2888} 2925}
2889 2926
… …
2897 for (y = car (x); y != NIL; y = cdr (y)) 2934 for (y = car (x); y != NIL; y = cdr (y))
2898 if (caar (y) == hdl) 2935 if (caar (y) == hdl)
2899 break; 2936 break;
2900 2937
2901 if (y != NIL) 2938 if (y != NIL)
2939 return car (y);
2902 break; 2940 break;
2903 2941
2904 if (!all) 2942 if (!all)
2905 return NIL; 2943 break;
2906 } 2944 }
2907
2908 if (x != NIL)
2909 return car (y);
2910 2945
2911 return NIL; 2946 return NIL;
2912} 2947}
2913 2948
2914#endif /* USE_ALIST_ENV else */ 2949#endif /* USE_ALIST_ENV else */
2915 2950
2916static INLINE void 2951ecb_inline void
2917new_slot_in_env (SCHEME_P_ pointer variable, pointer value) 2952new_slot_in_env (SCHEME_P_ pointer variable, pointer value)
2918{ 2953{
2954 assert (is_symbol (variable));//TODO: bug in current-ws/OP_LET2
2919 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value); 2955 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value);
2920} 2956}
2921 2957
2922static INLINE void 2958ecb_inline void
2923set_slot_in_env (SCHEME_P_ pointer slot, pointer value) 2959set_slot_in_env (SCHEME_P_ pointer slot, pointer value)
2924{ 2960{
2925 set_cdr (slot, value); 2961 set_cdr (slot, value);
2926} 2962}
2927 2963
2928static INLINE pointer 2964ecb_inline pointer
2929slot_value_in_env (pointer slot) 2965slot_value_in_env (pointer slot)
2930{ 2966{
2931 return cdr (slot); 2967 return cdr (slot);
2932} 2968}
2933 2969
2934/* ========== Evaluation Cycle ========== */ 2970/* ========== Evaluation Cycle ========== */
2935 2971
2936static pointer 2972static int
2937xError_1 (SCHEME_P_ const char *s, pointer a) 2973xError_1 (SCHEME_P_ const char *s, pointer a)
2938{ 2974{
2939#if USE_ERROR_HOOK 2975#if USE_ERROR_HOOK
2940 pointer x; 2976 pointer x;
2941 pointer hdl = SCHEME_V->ERROR_HOOK; 2977 pointer hdl = SCHEME_V->ERROR_HOOK;
… …
2976 code = cons (mk_string (SCHEME_A_ s), code); 3012 code = cons (mk_string (SCHEME_A_ s), code);
2977 setimmutable (car (code)); 3013 setimmutable (car (code));
2978 SCHEME_V->code = cons (slot_value_in_env (x), code); 3014 SCHEME_V->code = cons (slot_value_in_env (x), code);
2979 SCHEME_V->op = OP_EVAL; 3015 SCHEME_V->op = OP_EVAL;
2980 3016
2981 return S_T; 3017 return 0;
2982 } 3018 }
2983#endif 3019#endif
2984 3020
2985 if (a) 3021 if (a)
2986 SCHEME_V->args = cons (a, NIL); 3022 SCHEME_V->args = cons (a, NIL);
… …
2988 SCHEME_V->args = NIL; 3024 SCHEME_V->args = NIL;
2989 3025
2990 SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args); 3026 SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args);
2991 setimmutable (car (SCHEME_V->args)); 3027 setimmutable (car (SCHEME_V->args));
2992 SCHEME_V->op = OP_ERR0; 3028 SCHEME_V->op = OP_ERR0;
3029
2993 return S_T; 3030 return 0;
2994} 3031}
2995 3032
2996#define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a) 3033#define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a)
2997#define Error_0(s) Error_1 (s, 0) 3034#define Error_0(s) Error_1 (s, 0)
2998 3035
2999/* Too small to turn into function */ 3036/* Too small to turn into function */
3000#define BEGIN do { 3037#define BEGIN do {
3001#define END } while (0) 3038#define END } while (0)
3002#define s_goto(a) BEGIN \ 3039#define s_goto(a) BEGIN \
3003 SCHEME_V->op = a; \ 3040 SCHEME_V->op = a; \
3004 return S_T; END 3041 return 0; END
3005 3042
3006#define s_return(a) return xs_return (SCHEME_A_ a) 3043#define s_return(a) return xs_return (SCHEME_A_ a)
3007 3044
3008#ifndef USE_SCHEME_STACK 3045#ifndef USE_SCHEME_STACK
3009 3046
… …
3039 next_frame->code = code; 3076 next_frame->code = code;
3040 3077
3041 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1); 3078 SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1);
3042} 3079}
3043 3080
3044static pointer 3081static int
3045xs_return (SCHEME_P_ pointer a) 3082xs_return (SCHEME_P_ pointer a)
3046{ 3083{
3047 int nframes = (uintptr_t)SCHEME_V->dump; 3084 int nframes = (uintptr_t)SCHEME_V->dump;
3048 struct dump_stack_frame *frame; 3085 struct dump_stack_frame *frame;
3049 3086
3050 SCHEME_V->value = a; 3087 SCHEME_V->value = a;
3051 3088
3052 if (nframes <= 0) 3089 if (nframes <= 0)
3053 return NIL; 3090 return -1;
3054 3091
3055 frame = &SCHEME_V->dump_base[--nframes]; 3092 frame = &SCHEME_V->dump_base[--nframes];
3056 SCHEME_V->op = frame->op; 3093 SCHEME_V->op = frame->op;
3057 SCHEME_V->args = frame->args; 3094 SCHEME_V->args = frame->args;
3058 SCHEME_V->envir = frame->envir; 3095 SCHEME_V->envir = frame->envir;
3059 SCHEME_V->code = frame->code; 3096 SCHEME_V->code = frame->code;
3060 SCHEME_V->dump = (pointer)(uintptr_t)nframes; 3097 SCHEME_V->dump = (pointer)(uintptr_t)nframes;
3061 3098
3062 return S_T; 3099 return 0;
3063} 3100}
3064 3101
3065static INLINE void 3102ecb_inline void
3066dump_stack_reset (SCHEME_P) 3103dump_stack_reset (SCHEME_P)
3067{ 3104{
3068 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */ 3105 /* in this implementation, SCHEME_V->dump is the number of frames on the stack */
3069 SCHEME_V->dump = (pointer)+0; 3106 SCHEME_V->dump = (pointer)+0;
3070} 3107}
3071 3108
3072static INLINE void 3109ecb_inline void
3073dump_stack_initialize (SCHEME_P) 3110dump_stack_initialize (SCHEME_P)
3074{ 3111{
3075 SCHEME_V->dump_size = 0; 3112 SCHEME_V->dump_size = 0;
3076 SCHEME_V->dump_base = 0; 3113 SCHEME_V->dump_base = 0;
3077 dump_stack_reset (SCHEME_A); 3114 dump_stack_reset (SCHEME_A);
… …
3130 int i = 0; 3167 int i = 0;
3131 struct dump_stack_frame *frame = SCHEME_V->dump_base; 3168 struct dump_stack_frame *frame = SCHEME_V->dump_base;
3132 3169
3133 while (cont != NIL) 3170 while (cont != NIL)
3134 { 3171 {
3135 frame->op = ivalue (car (cont)); cont = cdr (cont); 3172 frame->op = ivalue_unchecked (car (cont)); cont = cdr (cont);
3136 frame->args = car (cont) ; cont = cdr (cont); 3173 frame->args = car (cont) ; cont = cdr (cont);
3137 frame->envir = car (cont) ; cont = cdr (cont); 3174 frame->envir = car (cont) ; cont = cdr (cont);
3138 frame->code = car (cont) ; cont = cdr (cont); 3175 frame->code = car (cont) ; cont = cdr (cont);
3139 3176
3140 ++frame; 3177 ++frame;
3141 ++i; 3178 ++i;
3142 } 3179 }
3143 3180
3144 SCHEME_V->dump = (pointer)(uintptr_t)i; 3181 SCHEME_V->dump = (pointer)(uintptr_t)i;
3145} 3182}
3146 3183
3147#else 3184#else
3148 3185
3149static INLINE void 3186ecb_inline void
3150dump_stack_reset (SCHEME_P) 3187dump_stack_reset (SCHEME_P)
3151{ 3188{
3152 SCHEME_V->dump = NIL; 3189 SCHEME_V->dump = NIL;
3153} 3190}
3154 3191
3155static INLINE void 3192ecb_inline void
3156dump_stack_initialize (SCHEME_P) 3193dump_stack_initialize (SCHEME_P)
3157{ 3194{
3158 dump_stack_reset (SCHEME_A); 3195 dump_stack_reset (SCHEME_A);
3159} 3196}
3160 3197
… …
3162dump_stack_free (SCHEME_P) 3199dump_stack_free (SCHEME_P)
3163{ 3200{
3164 SCHEME_V->dump = NIL; 3201 SCHEME_V->dump = NIL;
3165} 3202}
3166 3203
3167static pointer 3204static int
3168xs_return (SCHEME_P_ pointer a) 3205xs_return (SCHEME_P_ pointer a)
3169{ 3206{
3170 pointer dump = SCHEME_V->dump; 3207 pointer dump = SCHEME_V->dump;
3171 3208
3172 SCHEME_V->value = a; 3209 SCHEME_V->value = a;
3173 3210
3174 if (dump == NIL) 3211 if (dump == NIL)
3175 return NIL; 3212 return -1;
3176 3213
3177 SCHEME_V->op = ivalue (car (dump)); dump = cdr (dump); 3214 SCHEME_V->op = ivalue_unchecked (car (dump)); dump = cdr (dump);
3178 SCHEME_V->args = car (dump) ; dump = cdr (dump); 3215 SCHEME_V->args = car (dump) ; dump = cdr (dump);
3179 SCHEME_V->envir = car (dump) ; dump = cdr (dump); 3216 SCHEME_V->envir = car (dump) ; dump = cdr (dump);
3180 SCHEME_V->code = car (dump) ; dump = cdr (dump); 3217 SCHEME_V->code = car (dump) ; dump = cdr (dump);
3181 3218
3182 SCHEME_V->dump = dump; 3219 SCHEME_V->dump = dump;
3183 3220
3184 return S_T; 3221 return 0;
3185} 3222}
3186 3223
3187static void 3224static void
3188s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code) 3225s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code)
3189{ 3226{
… …
3214 3251
3215#endif 3252#endif
3216 3253
3217#define s_retbool(tf) s_return ((tf) ? S_T : S_F) 3254#define s_retbool(tf) s_return ((tf) ? S_T : S_F)
3218 3255
3256#if EXPERIMENT
3219static pointer 3257static int
3258debug (SCHEME_P_ int indent, pointer x)
3259{
3260 int c;
3261
3262 if (is_syntax (x))
3263 {
3264 printf ("%*ssyntax<%s,%d>\n", indent, "", syntaxname(x),syntaxnum(x));
3265 return 8 + 8;
3266 }
3267
3268 if (x == NIL)
3269 {
3270 printf ("%*sNIL\n", indent, "");
3271 return 3;
3272 }
3273
3274 switch (type (x))
3275 {
3276 case T_INTEGER:
3277 printf ("%*sI<%d>%p\n", indent, "", (int)ivalue_unchecked (x), x);
3278 return 32+8;
3279
3280 case T_SYMBOL:
3281 printf ("%*sS<%s>\n", indent, "", symname (x));
3282 return 24+8;
3283
3284 case T_CLOSURE:
3285 printf ("%*sS<%s>\n", indent, "", "closure");
3286 debug (SCHEME_A_ indent + 3, cdr(x));
3287 return 32 + debug (SCHEME_A_ indent + 3, car (x));
3288
3289 case T_PAIR:
3290 printf ("%*spair %p %p\n", indent, "", car(x),cdr(x));
3291 c = debug (SCHEME_A_ indent + 3, car (x));
3292 c += debug (SCHEME_A_ indent + 3, cdr (x));
3293 return c + 1;
3294
3295 case T_PORT:
3296 printf ("%*sS<%s>\n", indent, "", "port");
3297 return 24+8;
3298
3299 case T_VECTOR:
3300 printf ("%*sS<%s>\n", indent, "", "vector");
3301 return 24+8;
3302
3303 case T_ENVIRONMENT:
3304 printf ("%*sS<%s>\n", indent, "", "environment");
3305 return 0 + debug (SCHEME_A_ indent + 3, car (x));
3306
3307 default:
3308 printf ("unhandled type %d\n", type (x));
3309 break;
3310 }
3311}
3312#endif
3313
3314static int
3220opexe_0 (SCHEME_P_ enum scheme_opcodes op) 3315opexe_0 (SCHEME_P_ enum scheme_opcodes op)
3221{ 3316{
3222 pointer args = SCHEME_V->args; 3317 pointer args = SCHEME_V->args;
3223 pointer x, y; 3318 pointer x, y;
3224 3319
3225 switch (op) 3320 switch (op)
3226 { 3321 {
3322#if EXPERIMENT //D
3323 case OP_DEBUG:
3324 printf ("len = %d\n", debug (SCHEME_A_ 0, args) / 8);
3325 printf ("\n");
3326 s_return (S_T);
3327#endif
3227 case OP_LOAD: /* load */ 3328 case OP_LOAD: /* load */
3228 if (file_interactive (SCHEME_A)) 3329 if (file_interactive (SCHEME_A))
3229 { 3330 {
3230 xwrstr ("Loading "); xwrstr (strvalue (car (args))); xwrstr ("\n"); 3331 xwrstr ("Loading "); xwrstr (strvalue (car (args))); xwrstr ("\n");
3231 //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args))); 3332 //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args)));
… …
3354 } 3455 }
3355 else 3456 else
3356 s_return (SCHEME_V->code); 3457 s_return (SCHEME_V->code);
3357 3458
3358 case OP_E0ARGS: /* eval arguments */ 3459 case OP_E0ARGS: /* eval arguments */
3359 if (is_macro (SCHEME_V->value)) /* macro expansion */ 3460 if (ecb_expect_false (is_macro (SCHEME_V->value))) /* macro expansion */
3360 { 3461 {
3361 s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL); 3462 s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL);
3362 SCHEME_V->args = cons (SCHEME_V->code, NIL); 3463 SCHEME_V->args = cons (SCHEME_V->code, NIL);
3363 SCHEME_V->code = SCHEME_V->value; 3464 SCHEME_V->code = SCHEME_V->value;
3364 s_goto (OP_APPLY); 3465 s_goto (OP_APPLY);
… …
3391 3492
3392 case OP_TRACING: 3493 case OP_TRACING:
3393 { 3494 {
3394 int tr = SCHEME_V->tracing; 3495 int tr = SCHEME_V->tracing;
3395 3496
3396 SCHEME_V->tracing = ivalue (car (args)); 3497 SCHEME_V->tracing = ivalue_unchecked (car (args));
3397 s_return (mk_integer (SCHEME_A_ tr)); 3498 s_return (mk_integer (SCHEME_A_ tr));
3398 } 3499 }
3399 3500
3400#endif 3501#endif
3401 3502
… …
3413 /* fall through */ 3514 /* fall through */
3414 3515
3415 case OP_REAL_APPLY: 3516 case OP_REAL_APPLY:
3416#endif 3517#endif
3417 if (is_proc (SCHEME_V->code)) 3518 if (is_proc (SCHEME_V->code))
3418 {
3419 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */ 3519 s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */
3420 }
3421 else if (is_foreign (SCHEME_V->code)) 3520 else if (is_foreign (SCHEME_V->code))
3422 { 3521 {
3423 /* Keep nested calls from GC'ing the arglist */ 3522 /* Keep nested calls from GC'ing the arglist */
3424 push_recent_alloc (SCHEME_A_ args, NIL); 3523 push_recent_alloc (SCHEME_A_ args, NIL);
3425 x = SCHEME_V->code->object.ff (SCHEME_A_ args); 3524 x = SCHEME_V->code->object.ff (SCHEME_A_ args);
… …
3592 3691
3593 case OP_IF1: /* if */ 3692 case OP_IF1: /* if */
3594 if (is_true (SCHEME_V->value)) 3693 if (is_true (SCHEME_V->value))
3595 SCHEME_V->code = car (SCHEME_V->code); 3694 SCHEME_V->code = car (SCHEME_V->code);
3596 else 3695 else
3597 SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because 3696 SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because * car(NIL) = NIL */
3598
3599 * car(NIL) = NIL */
3600 s_goto (OP_EVAL); 3697 s_goto (OP_EVAL);
3601 3698
3602 case OP_LET0: /* let */ 3699 case OP_LET0: /* let */
3603 SCHEME_V->args = NIL; 3700 SCHEME_V->args = NIL;
3604 SCHEME_V->value = SCHEME_V->code; 3701 SCHEME_V->value = SCHEME_V->code;
… …
3914 SCHEME_V->code = car (args); 4011 SCHEME_V->code = car (args);
3915 SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL); 4012 SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL);
3916 s_goto (OP_APPLY); 4013 s_goto (OP_APPLY);
3917 } 4014 }
3918 4015
3919 abort (); 4016 if (USE_ERROR_CHECKING) abort ();
3920} 4017}
3921 4018
3922static pointer 4019static int
3923opexe_2 (SCHEME_P_ enum scheme_opcodes op) 4020opexe_1 (SCHEME_P_ enum scheme_opcodes op)
3924{ 4021{
3925 pointer args = SCHEME_V->args; 4022 pointer args = SCHEME_V->args;
3926 pointer x = car (args); 4023 pointer x = car (args);
3927 num v; 4024 num v;
3928 4025
3929#if USE_MATH
3930 RVALUE dd;
3931#endif
3932
3933 switch (op) 4026 switch (op)
3934 { 4027 {
3935#if USE_MATH 4028#if USE_MATH
3936 case OP_INEX2EX: /* inexact->exact */ 4029 case OP_INEX2EX: /* inexact->exact */
4030 {
3937 if (num_is_integer (x)) 4031 if (is_integer (x))
3938 s_return (x); 4032 s_return (x);
3939 else if (modf (rvalue_unchecked (x), &dd) == 0) 4033
4034 RVALUE r = rvalue_unchecked (x);
4035
4036 if (r == (RVALUE)(IVALUE)r)
3940 s_return (mk_integer (SCHEME_A_ ivalue (x))); 4037 s_return (mk_integer (SCHEME_A_ rvalue_unchecked (x)));
3941 else 4038 else
3942 Error_1 ("inexact->exact: not integral:", x); 4039 Error_1 ("inexact->exact: not integral:", x);
4040 }
3943 4041
3944 case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x)))); 4042 case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x))));
3945 case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x)))); 4043 case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x))));
3946 case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x)))); 4044 case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x))));
3947 case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x)))); 4045 case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x))));
… …
3965 { 4063 {
3966 RVALUE result; 4064 RVALUE result;
3967 int real_result = 1; 4065 int real_result = 1;
3968 pointer y = cadr (args); 4066 pointer y = cadr (args);
3969 4067
3970 if (num_is_integer (x) && num_is_integer (y)) 4068 if (is_integer (x) && is_integer (y))
3971 real_result = 0; 4069 real_result = 0;
3972 4070
3973 /* This 'if' is an R5RS compatibility fix. */ 4071 /* This 'if' is an R5RS compatibility fix. */
3974 /* NOTE: Remove this 'if' fix for R6RS. */ 4072 /* NOTE: Remove this 'if' fix for R6RS. */
3975 if (rvalue (x) == 0 && rvalue (y) < 0) 4073 if (rvalue (x) == 0 && rvalue (y) < 0)
… …
3981 /* If the test fails, result is too big for integer. */ 4079 /* If the test fails, result is too big for integer. */
3982 if (!real_result) 4080 if (!real_result)
3983 { 4081 {
3984 long result_as_long = result; 4082 long result_as_long = result;
3985 4083
3986 if (result != (RVALUE) result_as_long) 4084 if (result != result_as_long)
3987 real_result = 1; 4085 real_result = 1;
3988 } 4086 }
3989 4087
3990 if (real_result) 4088 if (real_result)
3991 s_return (mk_real (SCHEME_A_ result)); 4089 s_return (mk_real (SCHEME_A_ result));
… …
3996 case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x)))); 4094 case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x))));
3997 case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x)))); 4095 case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x))));
3998 4096
3999 case OP_TRUNCATE: 4097 case OP_TRUNCATE:
4000 { 4098 {
4001 RVALUE rvalue_of_x; 4099 RVALUE n = rvalue (x);
4002
4003 rvalue_of_x = rvalue (x);
4004
4005 if (rvalue_of_x > 0)
4006 s_return (mk_real (SCHEME_A_ floor (rvalue_of_x))); 4100 s_return (mk_real (SCHEME_A_ n > 0 ? floor (n) : ceil (n)));
4007 else
4008 s_return (mk_real (SCHEME_A_ ceil (rvalue_of_x)));
4009 } 4101 }
4010 4102
4011 case OP_ROUND: 4103 case OP_ROUND:
4012 if (num_is_integer (x)) 4104 if (is_integer (x))
4013 s_return (x); 4105 s_return (x);
4014 4106
4015 s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x)))); 4107 s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x))));
4016#endif 4108#endif
4017 4109
4018 case OP_ADD: /* + */ 4110 case OP_ADD: /* + */
4019 v = num_zero; 4111 v = num_zero;
4020 4112
4021 for (x = args; x != NIL; x = cdr (x)) 4113 for (x = args; x != NIL; x = cdr (x))
4022 v = num_op ('+', v, nvalue (car (x))); 4114 v = num_op (NUM_ADD, v, nvalue (car (x)));
4023 4115
4024 s_return (mk_number (SCHEME_A_ v)); 4116 s_return (mk_number (SCHEME_A_ v));
4025 4117
4026 case OP_MUL: /* * */ 4118 case OP_MUL: /* * */
4027 v = num_one; 4119 v = num_one;
4028 4120
4029 for (x = args; x != NIL; x = cdr (x)) 4121 for (x = args; x != NIL; x = cdr (x))
4030 v = num_op ('+', v, nvalue (car (x))); 4122 v = num_op (NUM_MUL, v, nvalue (car (x)));
4031 4123
4032 s_return (mk_number (SCHEME_A_ v)); 4124 s_return (mk_number (SCHEME_A_ v));
4033 4125
4034 case OP_SUB: /* - */ 4126 case OP_SUB: /* - */
4035 if (cdr (args) == NIL) 4127 if (cdr (args) == NIL)
… …
4042 x = cdr (args); 4134 x = cdr (args);
4043 v = nvalue (car (args)); 4135 v = nvalue (car (args));
4044 } 4136 }
4045 4137
4046 for (; x != NIL; x = cdr (x)) 4138 for (; x != NIL; x = cdr (x))
4047 v = num_op ('+', v, nvalue (car (x))); 4139 v = num_op (NUM_SUB, v, nvalue (car (x)));
4048 4140
4049 s_return (mk_number (SCHEME_A_ v)); 4141 s_return (mk_number (SCHEME_A_ v));
4050 4142
4051 case OP_DIV: /* / */ 4143 case OP_DIV: /* / */
4052 if (cdr (args) == NIL) 4144 if (cdr (args) == NIL)
… …
4059 x = cdr (args); 4151 x = cdr (args);
4060 v = nvalue (car (args)); 4152 v = nvalue (car (args));
4061 } 4153 }
4062 4154
4063 for (; x != NIL; x = cdr (x)) 4155 for (; x != NIL; x = cdr (x))
4064 {
4065 if (!is_zero_rvalue (rvalue (car (x)))) 4156 if (!is_zero_rvalue (rvalue (car (x))))
4066 v = num_div (v, nvalue (car (x))); 4157 v = num_div (v, nvalue (car (x)));
4067 else 4158 else
4068 Error_0 ("/: division by zero"); 4159 Error_0 ("/: division by zero");
4069 }
4070 4160
4071 s_return (mk_number (SCHEME_A_ v)); 4161 s_return (mk_number (SCHEME_A_ v));
4072 4162
4073 case OP_INTDIV: /* quotient */ 4163 case OP_INTDIV: /* quotient */
4074 if (cdr (args) == NIL) 4164 if (cdr (args) == NIL)
… …
4083 } 4173 }
4084 4174
4085 for (; x != NIL; x = cdr (x)) 4175 for (; x != NIL; x = cdr (x))
4086 { 4176 {
4087 if (ivalue (car (x)) != 0) 4177 if (ivalue (car (x)) != 0)
4088 v = num_op ('/', v, nvalue (car (x))); 4178 v = num_op (NUM_INTDIV, v, nvalue (car (x)));
4089 else 4179 else
4090 Error_0 ("quotient: division by zero"); 4180 Error_0 ("quotient: division by zero");
4091 } 4181 }
4092 4182
4093 s_return (mk_number (SCHEME_A_ v)); 4183 s_return (mk_number (SCHEME_A_ v));
… …
4110 else 4200 else
4111 Error_0 ("modulo: division by zero"); 4201 Error_0 ("modulo: division by zero");
4112 4202
4113 s_return (mk_number (SCHEME_A_ v)); 4203 s_return (mk_number (SCHEME_A_ v));
4114 4204
4115 case OP_CAR: /* car */ 4205 /* the compiler will optimize this mess... */
4116 s_return (caar (args)); 4206 case OP_CAR: op_car: s_return (car (x));
4117 4207 case OP_CDR: op_cdr: s_return (cdr (x));
4118 case OP_CDR: /* cdr */ 4208 case OP_CAAR: op_caar: x = car (x); goto op_car;
4119 s_return (cdar (args)); 4209 case OP_CADR: op_cadr: x = cdr (x); goto op_car;
4210 case OP_CDAR: op_cdar: x = car (x); goto op_cdr;
4211 case OP_CDDR: op_cddr: x = cdr (x); goto op_cdr;
4212 case OP_CAAAR: op_caaar: x = car (x); goto op_caar;
4213 case OP_CAADR: op_caadr: x = cdr (x); goto op_caar;
4214 case OP_CADAR: op_cadar: x = car (x); goto op_cadr;
4215 case OP_CADDR: op_caddr: x = cdr (x); goto op_cadr;
4216 case OP_CDAAR: op_cdaar: x = car (x); goto op_cdar;
4217 case OP_CDADR: op_cdadr: x = cdr (x); goto op_cdar;
4218 case OP_CDDAR: op_cddar: x = car (x); goto op_cddr;
4219 case OP_CDDDR: op_cdddr: x = cdr (x); goto op_cddr;
4220 case OP_CAAAAR: x = car (x); goto op_caaar;
4221 case OP_CAAADR: x = cdr (x); goto op_caaar;
4222 case OP_CAADAR: x = car (x); goto op_caadr;
4223 case OP_CAADDR: x = cdr (x); goto op_caadr;
4224 case OP_CADAAR: x = car (x); goto op_cadar;
4225 case OP_CADADR: x = cdr (x); goto op_cadar;
4226 case OP_CADDAR: x = car (x); goto op_caddr;
4227 case OP_CADDDR: x = cdr (x); goto op_caddr;
4228 case OP_CDAAAR: x = car (x); goto op_cdaar;
4229 case OP_CDAADR: x = cdr (x); goto op_cdaar;
4230 case OP_CDADAR: x = car (x); goto op_cdadr;
4231 case OP_CDADDR: x = cdr (x); goto op_cdadr;
4232 case OP_CDDAAR: x = car (x); goto op_cddar;
4233 case OP_CDDADR: x = cdr (x); goto op_cddar;
4234 case OP_CDDDAR: x = car (x); goto op_cdddr;
4235 case OP_CDDDDR: x = cdr (x); goto op_cdddr;
4120 4236
4121 case OP_CONS: /* cons */ 4237 case OP_CONS: /* cons */
4122 set_cdr (args, cadr (args)); 4238 set_cdr (args, cadr (args));
4123 s_return (args); 4239 s_return (args);
4124 4240
… …
4139 } 4255 }
4140 else 4256 else
4141 Error_0 ("set-cdr!: unable to alter immutable pair"); 4257 Error_0 ("set-cdr!: unable to alter immutable pair");
4142 4258
4143 case OP_CHAR2INT: /* char->integer */ 4259 case OP_CHAR2INT: /* char->integer */
4144 s_return (mk_integer (SCHEME_A_ ivalue (x))); 4260 s_return (mk_integer (SCHEME_A_ ivalue_unchecked (x)));
4145 4261
4146 case OP_INT2CHAR: /* integer->char */ 4262 case OP_INT2CHAR: /* integer->char */
4147 s_return (mk_character (SCHEME_A_ ivalue (x))); 4263 s_return (mk_character (SCHEME_A_ ivalue_unchecked (x)));
4148 4264
4149 case OP_CHARUPCASE: 4265 case OP_CHARUPCASE:
4150 { 4266 {
4151 unsigned char c = ivalue (x); 4267 unsigned char c = ivalue_unchecked (x);
4152 c = toupper (c); 4268 c = toupper (c);
4153 s_return (mk_character (SCHEME_A_ c)); 4269 s_return (mk_character (SCHEME_A_ c));
4154 } 4270 }
4155 4271
4156 case OP_CHARDNCASE: 4272 case OP_CHARDNCASE:
4157 { 4273 {
4158 unsigned char c = ivalue (x); 4274 unsigned char c = ivalue_unchecked (x);
4159 c = tolower (c); 4275 c = tolower (c);
4160 s_return (mk_character (SCHEME_A_ c)); 4276 s_return (mk_character (SCHEME_A_ c));
4161 } 4277 }
4162 4278
4163 case OP_STR2SYM: /* string->symbol */ 4279 case OP_STR2SYM: /* string->symbol */
… …
4240 Error_1 ("atom->string: not an atom:", x); 4356 Error_1 ("atom->string: not an atom:", x);
4241 } 4357 }
4242 4358
4243 case OP_MKSTRING: /* make-string */ 4359 case OP_MKSTRING: /* make-string */
4244 { 4360 {
4245 int fill = ' '; 4361 int fill = cdr (args) != NIL ? charvalue (cadr (args)) : ' ';
4246 int len;
4247
4248 len = ivalue (x); 4362 int len = ivalue_unchecked (x);
4249
4250 if (cdr (args) != NIL)
4251 fill = charvalue (cadr (args));
4252 4363
4253 s_return (mk_empty_string (SCHEME_A_ len, fill)); 4364 s_return (mk_empty_string (SCHEME_A_ len, fill));
4254 } 4365 }
4255 4366
4256 case OP_STRLEN: /* string-length */ 4367 case OP_STRLEN: /* string-length */
4257 s_return (mk_integer (SCHEME_A_ strlength (x))); 4368 s_return (mk_integer (SCHEME_A_ strlength (x)));
4258 4369
4259 case OP_STRREF: /* string-ref */ 4370 case OP_STRREF: /* string-ref */
4260 { 4371 {
4261 char *str;
4262 int index;
4263
4264 str = strvalue (x); 4372 char *str = strvalue (x);
4265
4266 index = ivalue (cadr (args)); 4373 int index = ivalue_unchecked (cadr (args));
4267 4374
4268 if (index >= strlength (x)) 4375 if (index >= strlength (x))
4269 Error_1 ("string-ref: out of bounds:", cadr (args)); 4376 Error_1 ("string-ref: out of bounds:", cadr (args));
4270 4377
4271 s_return (mk_character (SCHEME_A_ ((unsigned char *)str)[index])); 4378 s_return (mk_character (SCHEME_A_ ((unsigned char *)str)[index]));
4272 } 4379 }
4273 4380
4274 case OP_STRSET: /* string-set! */ 4381 case OP_STRSET: /* string-set! */
4275 { 4382 {
4276 char *str; 4383 char *str = strvalue (x);
4277 int index; 4384 int index = ivalue_unchecked (cadr (args));
4278 int c; 4385 int c;
4279 4386
4280 if (is_immutable (x)) 4387 if (is_immutable (x))
4281 Error_1 ("string-set!: unable to alter immutable string:", x); 4388 Error_1 ("string-set!: unable to alter immutable string:", x);
4282
4283 str = strvalue (x);
4284
4285 index = ivalue (cadr (args));
4286 4389
4287 if (index >= strlength (x)) 4390 if (index >= strlength (x))
4288 Error_1 ("string-set!: out of bounds:", cadr (args)); 4391 Error_1 ("string-set!: out of bounds:", cadr (args));
4289 4392
4290 c = charvalue (caddr (args)); 4393 c = charvalue (caddr (args));
… …
4313 s_return (newstr); 4416 s_return (newstr);
4314 } 4417 }
4315 4418
4316 case OP_SUBSTR: /* substring */ 4419 case OP_SUBSTR: /* substring */
4317 { 4420 {
4318 char *str; 4421 char *str = strvalue (x);
4319 int index0; 4422 int index0 = ivalue_unchecked (cadr (args));
4320 int index1; 4423 int index1;
4321 int len; 4424 int len;
4322 4425
4323 str = strvalue (x);
4324
4325 index0 = ivalue (cadr (args));
4326
4327 if (index0 > strlength (x)) 4426 if (index0 > strlength (x))
4328 Error_1 ("substring: start out of bounds:", cadr (args)); 4427 Error_1 ("substring: start out of bounds:", cadr (args));
4329 4428
4330 if (cddr (args) != NIL) 4429 if (cddr (args) != NIL)
4331 { 4430 {
4332 index1 = ivalue (caddr (args)); 4431 index1 = ivalue_unchecked (caddr (args));
4333 4432
4334 if (index1 > strlength (x) || index1 < index0) 4433 if (index1 > strlength (x) || index1 < index0)
4335 Error_1 ("substring: end out of bounds:", caddr (args)); 4434 Error_1 ("substring: end out of bounds:", caddr (args));
4336 } 4435 }
4337 else 4436 else
… …
4360 if (SCHEME_V->no_memory) 4459 if (SCHEME_V->no_memory)
4361 s_return (S_SINK); 4460 s_return (S_SINK);
4362#endif 4461#endif
4363 4462
4364 for (x = args, i = 0; is_pair (x); x = cdr (x), i++) 4463 for (x = args, i = 0; is_pair (x); x = cdr (x), i++)
4365 set_vector_elem (vec, i, car (x)); 4464 vector_set (vec, i, car (x));
4366 4465
4367 s_return (vec); 4466 s_return (vec);
4368 } 4467 }
4369 4468
4370 case OP_MKVECTOR: /* make-vector */ 4469 case OP_MKVECTOR: /* make-vector */
4371 { 4470 {
4372 pointer fill = NIL; 4471 pointer fill = NIL;
4373 int len;
4374 pointer vec; 4472 pointer vec;
4375
4376 len = ivalue (x); 4473 int len = ivalue_unchecked (x);
4377 4474
4378 if (cdr (args) != NIL) 4475 if (cdr (args) != NIL)
4379 fill = cadr (args); 4476 fill = cadr (args);
4380 4477
4381 vec = mk_vector (SCHEME_A_ len); 4478 vec = mk_vector (SCHEME_A_ len);
… …
4384 if (SCHEME_V->no_memory) 4481 if (SCHEME_V->no_memory)
4385 s_return (S_SINK); 4482 s_return (S_SINK);
4386#endif 4483#endif
4387 4484
4388 if (fill != NIL) 4485 if (fill != NIL)
4389 fill_vector (vec, fill); 4486 fill_vector (vec, 0, fill);
4390 4487
4391 s_return (vec); 4488 s_return (vec);
4392 } 4489 }
4393 4490
4394 case OP_VECLEN: /* vector-length */ 4491 case OP_VECLEN: /* vector-length */
4395 s_return (mk_integer (SCHEME_A_ veclength (x))); 4492 s_return (mk_integer (SCHEME_A_ veclength (x)));
4396 4493
4494 case OP_VECRESIZE:
4495 vector_resize (x, ivalue_unchecked (cadr (args)), caddr (args));
4496 s_return (x);
4497
4397 case OP_VECREF: /* vector-ref */ 4498 case OP_VECREF: /* vector-ref */
4398 { 4499 {
4399 int index;
4400
4401 index = ivalue (cadr (args)); 4500 int index = ivalue_unchecked (cadr (args));
4402 4501
4403 if (index >= veclength (car (args)) && USE_ERROR_CHECKING) 4502 if (index >= veclength (car (args)) && USE_ERROR_CHECKING)
4404 Error_1 ("vector-ref: out of bounds:", cadr (args)); 4503 Error_1 ("vector-ref: out of bounds:", cadr (args));
4405 4504
4406 s_return (vector_elem (x, index)); 4505 s_return (vector_get (x, index));
4407 } 4506 }
4408 4507
4409 case OP_VECSET: /* vector-set! */ 4508 case OP_VECSET: /* vector-set! */
4410 { 4509 {
4411 int index; 4510 int index = ivalue_unchecked (cadr (args));
4412 4511
4413 if (is_immutable (x)) 4512 if (is_immutable (x))
4414 Error_1 ("vector-set!: unable to alter immutable vector:", x); 4513 Error_1 ("vector-set!: unable to alter immutable vector:", x);
4415 4514
4416 index = ivalue (cadr (args));
4417
4418 if (index >= veclength (car (args)) && USE_ERROR_CHECKING) 4515 if (index >= veclength (car (args)) && USE_ERROR_CHECKING)
4419 Error_1 ("vector-set!: out of bounds:", cadr (args)); 4516 Error_1 ("vector-set!: out of bounds:", cadr (args));
4420 4517
4421 set_vector_elem (x, index, caddr (args)); 4518 vector_set (x, index, caddr (args));
4422 s_return (x); 4519 s_return (x);
4423 } 4520 }
4424 } 4521 }
4425 4522
4426 return S_T; 4523 if (USE_ERROR_CHECKING) abort ();
4427} 4524}
4428 4525
4429INTERFACE int
4430is_list (SCHEME_P_ pointer a)
4431{
4432 return list_length (SCHEME_A_ a) >= 0;
4433}
4434
4435/* Result is:
4436 proper list: length
4437 circular list: -1
4438 not even a pair: -2
4439 dotted list: -2 minus length before dot
4440*/
4441INTERFACE int
4442list_length (SCHEME_P_ pointer a)
4443{
4444 int i = 0;
4445 pointer slow, fast;
4446
4447 slow = fast = a;
4448
4449 while (1)
4450 {
4451 if (fast == NIL)
4452 return i;
4453
4454 if (!is_pair (fast))
4455 return -2 - i;
4456
4457 fast = cdr (fast);
4458 ++i;
4459
4460 if (fast == NIL)
4461 return i;
4462
4463 if (!is_pair (fast))
4464 return -2 - i;
4465
4466 ++i;
4467 fast = cdr (fast);
4468
4469 /* Safe because we would have already returned if `fast'
4470 encountered a non-pair. */
4471 slow = cdr (slow);
4472
4473 if (fast == slow)
4474 {
4475 /* the fast pointer has looped back around and caught up
4476 with the slow pointer, hence the structure is circular,
4477 not of finite length, and therefore not a list */
4478 return -1;
4479 }
4480 }
4481}
4482
4483static pointer 4526static int
4484opexe_r (SCHEME_P_ enum scheme_opcodes op) 4527opexe_2 (SCHEME_P_ enum scheme_opcodes op)
4485{ 4528{
4486 pointer x = SCHEME_V->args; 4529 pointer x = SCHEME_V->args;
4487 4530
4488 for (;;) 4531 for (;;)
4489 { 4532 {
… …
4509 } 4552 }
4510 4553
4511 s_return (S_T); 4554 s_return (S_T);
4512} 4555}
4513 4556
4514static pointer 4557static int
4515opexe_3 (SCHEME_P_ enum scheme_opcodes op) 4558opexe_3 (SCHEME_P_ enum scheme_opcodes op)
4516{ 4559{
4517 pointer args = SCHEME_V->args; 4560 pointer args = SCHEME_V->args;
4518 pointer a = car (args); 4561 pointer a = car (args);
4519 pointer d = cdr (args); 4562 pointer d = cdr (args);
4520 int r; 4563 int r;
4521 4564
4522 switch (op) 4565 switch (op)
4523 { 4566 {
4524 case OP_NOT: /* not */ r = is_false (a) ; break; 4567 case OP_NOT: /* not */ r = is_false (a) ; break;
4525 case OP_BOOLP: /* boolean? */ r = a == S_F || a == S_T; break; 4568 case OP_BOOLP: /* boolean? */ r = a == S_F || a == S_T ; break;
4526 case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break; 4569 case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break;
4527 case OP_NULLP: /* null? */ r = a == NIL ; break; 4570 case OP_NULLP: /* null? */ r = a == NIL ; break;
4528 case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break; 4571 case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break;
4572 case OP_GENSYMP: /* gensym? */ r = is_gensym (SCHEME_A_ a); break;
4529 case OP_NUMBERP: /* number? */ r = is_number (a) ; break; 4573 case OP_NUMBERP: /* number? */ r = is_number (a) ; break;
4530 case OP_STRINGP: /* string? */ r = is_string (a) ; break; 4574 case OP_STRINGP: /* string? */ r = is_string (a) ; break;
4531 case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break; 4575 case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break;
4532 case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */ 4576 case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */
4533 case OP_CHARP: /* char? */ r = is_character (a) ; break; 4577 case OP_CHARP: /* char? */ r = is_character (a) ; break;
4534 4578
4535#if USE_CHAR_CLASSIFIERS 4579#if USE_CHAR_CLASSIFIERS
4536 case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue (a)); break; 4580 case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue_unchecked (a)); break;
4537 case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue (a)); break; 4581 case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue_unchecked (a)); break;
4538 case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue (a)); break; 4582 case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue_unchecked (a)); break;
4539 case OP_CHARUP: /* char-upper-case? */ r = Cisupper (ivalue (a)); break; 4583 case OP_CHARUP: /* char-upper-case? */ r = Cisupper (ivalue_unchecked (a)); break;
4540 case OP_CHARLP: /* char-lower-case? */ r = Cislower (ivalue (a)); break; 4584 case OP_CHARLP: /* char-lower-case? */ r = Cislower (ivalue_unchecked (a)); break;
4541#endif 4585#endif
4542 4586
4543#if USE_PORTS 4587#if USE_PORTS
4544 case OP_PORTP: /* port? */ r = is_port (a) ; break; 4588 case OP_PORTP: /* port? */ r = is_port (a) ; break;
4545 case OP_INPORTP: /* input-port? */ r = is_inport (a) ; break; 4589 case OP_INPORTP: /* input-port? */ r = is_inport (a) ; break;
… …
4565 } 4609 }
4566 4610
4567 s_retbool (r); 4611 s_retbool (r);
4568} 4612}
4569 4613
4570static pointer 4614static int
4571opexe_4 (SCHEME_P_ enum scheme_opcodes op) 4615opexe_4 (SCHEME_P_ enum scheme_opcodes op)
4572{ 4616{
4573 pointer args = SCHEME_V->args; 4617 pointer args = SCHEME_V->args;
4574 pointer a = car (args); 4618 pointer a = car (args);
4575 pointer x, y; 4619 pointer x, y;
… …
4661 putstr (SCHEME_A_ "\n"); 4705 putstr (SCHEME_A_ "\n");
4662 4706
4663 if (SCHEME_V->interactive_repl) 4707 if (SCHEME_V->interactive_repl)
4664 s_goto (OP_T0LVL); 4708 s_goto (OP_T0LVL);
4665 else 4709 else
4666 return NIL; 4710 return -1;
4667 } 4711 }
4668 4712
4669 case OP_REVERSE: /* reverse */ 4713 case OP_REVERSE: /* reverse */
4670 s_return (reverse (SCHEME_A_ a)); 4714 s_return (reverse (SCHEME_A_ a));
4671 4715
… …
4728 4772
4729 case OP_QUIT: /* quit */ 4773 case OP_QUIT: /* quit */
4730 if (is_pair (args)) 4774 if (is_pair (args))
4731 SCHEME_V->retcode = ivalue (a); 4775 SCHEME_V->retcode = ivalue (a);
4732 4776
4733 return NIL; 4777 return -1;
4734 4778
4735 case OP_GC: /* gc */ 4779 case OP_GC: /* gc */
4736 gc (SCHEME_A_ NIL, NIL); 4780 gc (SCHEME_A_ NIL, NIL);
4737 s_return (S_T); 4781 s_return (S_T);
4738 4782
… …
4746 4790
4747 case OP_NEWSEGMENT: /* new-segment */ 4791 case OP_NEWSEGMENT: /* new-segment */
4748 if (!is_pair (args) || !is_number (a)) 4792 if (!is_pair (args) || !is_number (a))
4749 Error_0 ("new-segment: argument must be a number"); 4793 Error_0 ("new-segment: argument must be a number");
4750 4794
4751 alloc_cellseg (SCHEME_A_ (int)ivalue (a)); 4795 alloc_cellseg (SCHEME_A_ ivalue (a));
4752 4796
4753 s_return (S_T); 4797 s_return (S_T);
4754 4798
4755 case OP_OBLIST: /* oblist */ 4799 case OP_OBLIST: /* oblist */
4756 s_return (oblist_all_symbols (SCHEME_A)); 4800 s_return (oblist_all_symbols (SCHEME_A));
… …
4785 break; 4829 break;
4786 } 4830 }
4787 4831
4788 p = port_from_filename (SCHEME_A_ strvalue (a), prop); 4832 p = port_from_filename (SCHEME_A_ strvalue (a), prop);
4789 4833
4790 if (p == NIL) 4834 s_return (p == NIL ? S_F : p);
4791 s_return (S_F);
4792
4793 s_return (p);
4794 } 4835 }
4795 4836
4796# if USE_STRING_PORTS 4837# if USE_STRING_PORTS
4797 4838
4798 case OP_OPEN_INSTRING: /* open-input-string */ 4839 case OP_OPEN_INSTRING: /* open-input-string */
… …
4813 } 4854 }
4814 4855
4815 p = port_from_string (SCHEME_A_ strvalue (a), 4856 p = port_from_string (SCHEME_A_ strvalue (a),
4816 strvalue (a) + strlength (a), prop); 4857 strvalue (a) + strlength (a), prop);
4817 4858
4818 if (p == NIL) 4859 s_return (p == NIL ? S_F : p);
4819 s_return (S_F);
4820
4821 s_return (p);
4822 } 4860 }
4823 4861
4824 case OP_OPEN_OUTSTRING: /* open-output-string */ 4862 case OP_OPEN_OUTSTRING: /* open-output-string */
4825 { 4863 {
4826 pointer p; 4864 pointer p;
4827 4865
4828 if (a == NIL) 4866 if (a == NIL)
4829 {
4830 p = port_from_scratch (SCHEME_A); 4867 p = port_from_scratch (SCHEME_A);
4831
4832 if (p == NIL)
4833 s_return (S_F);
4834 }
4835 else 4868 else
4836 {
4837 p = port_from_string (SCHEME_A_ strvalue (a), 4869 p = port_from_string (SCHEME_A_ strvalue (a),
4838 strvalue (a) + strlength (a), port_output); 4870 strvalue (a) + strlength (a), port_output);
4839 4871
4840 if (p == NIL) 4872 s_return (p == NIL ? S_F : p);
4841 s_return (S_F);
4842 }
4843
4844 s_return (p);
4845 } 4873 }
4846 4874
4847 case OP_GET_OUTSTRING: /* get-output-string */ 4875 case OP_GET_OUTSTRING: /* get-output-string */
4848 { 4876 {
4849 port *p; 4877 port *p;
… …
4888 case OP_CURR_ENV: /* current-environment */ 4916 case OP_CURR_ENV: /* current-environment */
4889 s_return (SCHEME_V->envir); 4917 s_return (SCHEME_V->envir);
4890 4918
4891 } 4919 }
4892 4920
4893 abort (); 4921 if (USE_ERROR_CHECKING) abort ();
4894} 4922}
4895 4923
4896static pointer 4924static int
4897opexe_5 (SCHEME_P_ enum scheme_opcodes op) 4925opexe_5 (SCHEME_P_ enum scheme_opcodes op)
4898{ 4926{
4927 pointer args = SCHEME_V->args;
4899 pointer x; 4928 pointer x;
4900 4929
4901 if (SCHEME_V->nesting != 0) 4930 if (SCHEME_V->nesting != 0)
4902 { 4931 {
4903 int n = SCHEME_V->nesting; 4932 int n = SCHEME_V->nesting;
… …
4910 switch (op) 4939 switch (op)
4911 { 4940 {
4912 /* ========== reading part ========== */ 4941 /* ========== reading part ========== */
4913#if USE_PORTS 4942#if USE_PORTS
4914 case OP_READ: 4943 case OP_READ:
4915 if (!is_pair (SCHEME_V->args)) 4944 if (!is_pair (args))
4916 s_goto (OP_READ_INTERNAL); 4945 s_goto (OP_READ_INTERNAL);
4917 4946
4918 if (!is_inport (car (SCHEME_V->args))) 4947 if (!is_inport (car (args)))
4919 Error_1 ("read: not an input port:", car (SCHEME_V->args)); 4948 Error_1 ("read: not an input port:", car (args));
4920 4949
4921 if (car (SCHEME_V->args) == SCHEME_V->inport) 4950 if (car (args) == SCHEME_V->inport)
4922 s_goto (OP_READ_INTERNAL); 4951 s_goto (OP_READ_INTERNAL);
4923 4952
4924 x = SCHEME_V->inport; 4953 x = SCHEME_V->inport;
4925 SCHEME_V->inport = car (SCHEME_V->args); 4954 SCHEME_V->inport = car (args);
4926 x = cons (x, NIL); 4955 x = cons (x, NIL);
4927 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); 4956 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL);
4928 s_goto (OP_READ_INTERNAL); 4957 s_goto (OP_READ_INTERNAL);
4929 4958
4930 case OP_READ_CHAR: /* read-char */ 4959 case OP_READ_CHAR: /* read-char */
4931 case OP_PEEK_CHAR: /* peek-char */ 4960 case OP_PEEK_CHAR: /* peek-char */
4932 { 4961 {
4933 int c; 4962 int c;
4934 4963
4935 if (is_pair (SCHEME_V->args)) 4964 if (is_pair (args))
4936 { 4965 {
4937 if (car (SCHEME_V->args) != SCHEME_V->inport) 4966 if (car (args) != SCHEME_V->inport)
4938 { 4967 {
4939 x = SCHEME_V->inport; 4968 x = SCHEME_V->inport;
4940 x = cons (x, NIL); 4969 x = cons (x, NIL);
4941 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); 4970 s_save (SCHEME_A_ OP_SET_INPORT, x, NIL);
4942 SCHEME_V->inport = car (SCHEME_V->args); 4971 SCHEME_V->inport = car (args);
4943 } 4972 }
4944 } 4973 }
4945 4974
4946 c = inchar (SCHEME_A); 4975 c = inchar (SCHEME_A);
4947 4976
… …
4957 case OP_CHAR_READY: /* char-ready? */ 4986 case OP_CHAR_READY: /* char-ready? */
4958 { 4987 {
4959 pointer p = SCHEME_V->inport; 4988 pointer p = SCHEME_V->inport;
4960 int res; 4989 int res;
4961 4990
4962 if (is_pair (SCHEME_V->args)) 4991 if (is_pair (args))
4963 p = car (SCHEME_V->args); 4992 p = car (args);
4964 4993
4965 res = p->object.port->kind & port_string; 4994 res = p->object.port->kind & port_string;
4966 4995
4967 s_retbool (res); 4996 s_retbool (res);
4968 } 4997 }
4969 4998
4970 case OP_SET_INPORT: /* set-input-port */ 4999 case OP_SET_INPORT: /* set-input-port */
4971 SCHEME_V->inport = car (SCHEME_V->args); 5000 SCHEME_V->inport = car (args);
4972 s_return (SCHEME_V->value); 5001 s_return (SCHEME_V->value);
4973 5002
4974 case OP_SET_OUTPORT: /* set-output-port */ 5003 case OP_SET_OUTPORT: /* set-output-port */
4975 SCHEME_V->outport = car (SCHEME_V->args); 5004 SCHEME_V->outport = car (args);
4976 s_return (SCHEME_V->value); 5005 s_return (SCHEME_V->value);
4977#endif 5006#endif
4978 5007
4979 case OP_RDSEXPR: 5008 case OP_RDSEXPR:
4980 switch (SCHEME_V->tok) 5009 switch (SCHEME_V->tok)
… …
5029 s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL); 5058 s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL);
5030 SCHEME_V->tok = token (SCHEME_A); 5059 SCHEME_V->tok = token (SCHEME_A);
5031 s_goto (OP_RDSEXPR); 5060 s_goto (OP_RDSEXPR);
5032 5061
5033 case TOK_ATOM: 5062 case TOK_ATOM:
5034 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))); 5063 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS)));
5064
5065 case TOK_DOTATOM:
5066 SCHEME_V->strbuff[0] = '.';
5067 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 1, DELIMITERS)));
5068
5069 case TOK_STRATOM:
5070 x = readstrexp (SCHEME_A_ '|');
5071 //TODO: haven't checked whether the garbage collector could interfere
5072 s_return (mk_atom (SCHEME_A_ strvalue (x)));
5035 5073
5036 case TOK_DQUOTE: 5074 case TOK_DQUOTE:
5037 x = readstrexp (SCHEME_A); 5075 x = readstrexp (SCHEME_A_ '"');
5038 5076
5039 if (x == S_F) 5077 if (x == S_F)
5040 Error_0 ("Error reading string"); 5078 Error_0 ("Error reading string");
5041 5079
5042 setimmutable (x); 5080 setimmutable (x);
… …
5054 s_goto (OP_EVAL); 5092 s_goto (OP_EVAL);
5055 } 5093 }
5056 } 5094 }
5057 5095
5058 case TOK_SHARP_CONST: 5096 case TOK_SHARP_CONST:
5059 if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))) == NIL) 5097 if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS))) == NIL)
5060 Error_0 ("undefined sharp expression"); 5098 Error_0 ("undefined sharp expression");
5061 else 5099 else
5062 s_return (x); 5100 s_return (x);
5063 5101
5064 default: 5102 default:
… …
5066 } 5104 }
5067 5105
5068 break; 5106 break;
5069 5107
5070 case OP_RDLIST: 5108 case OP_RDLIST:
5071 SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); 5109 SCHEME_V->args = cons (SCHEME_V->value, args);
5072 SCHEME_V->tok = token (SCHEME_A); 5110 SCHEME_V->tok = token (SCHEME_A);
5073 5111
5074 switch (SCHEME_V->tok) 5112 switch (SCHEME_V->tok)
5075 { 5113 {
5076 case TOK_EOF: 5114 case TOK_EOF:
… …
5104 case OP_RDDOT: 5142 case OP_RDDOT:
5105 if (token (SCHEME_A) != TOK_RPAREN) 5143 if (token (SCHEME_A) != TOK_RPAREN)
5106 Error_0 ("syntax error: illegal dot expression"); 5144 Error_0 ("syntax error: illegal dot expression");
5107 5145
5108 SCHEME_V->nesting_stack[SCHEME_V->file_i]--; 5146 SCHEME_V->nesting_stack[SCHEME_V->file_i]--;
5109 s_return (reverse_in_place (SCHEME_A_ SCHEME_V->value, SCHEME_V->args)); 5147 s_return (reverse_in_place (SCHEME_A_ SCHEME_V->value, args));
5110 5148
5111 case OP_RDQUOTE: 5149 case OP_RDQUOTE:
5112 s_return (cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL))); 5150 s_return (cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL)));
5113 5151
5114 case OP_RDQQUOTE: 5152 case OP_RDQQUOTE:
… …
5136 SCHEME_V->args = SCHEME_V->value; 5174 SCHEME_V->args = SCHEME_V->value;
5137 s_goto (OP_VECTOR); 5175 s_goto (OP_VECTOR);
5138 5176
5139 /* ========== printing part ========== */ 5177 /* ========== printing part ========== */
5140 case OP_P0LIST: 5178 case OP_P0LIST:
5141 if (is_vector (SCHEME_V->args)) 5179 if (is_vector (args))
5142 { 5180 {
5143 putstr (SCHEME_A_ "#("); 5181 putstr (SCHEME_A_ "#(");
5144 SCHEME_V->args = cons (SCHEME_V->args, mk_integer (SCHEME_A_ 0)); 5182 SCHEME_V->args = cons (args, mk_integer (SCHEME_A_ 0));
5145 s_goto (OP_PVECFROM); 5183 s_goto (OP_PVECFROM);
5146 } 5184 }
5147 else if (is_environment (SCHEME_V->args)) 5185 else if (is_environment (args))
5148 { 5186 {
5149 putstr (SCHEME_A_ "#<ENVIRONMENT>"); 5187 putstr (SCHEME_A_ "#<ENVIRONMENT>");
5150 s_return (S_T); 5188 s_return (S_T);
5151 } 5189 }
5152 else if (!is_pair (SCHEME_V->args)) 5190 else if (!is_pair (args))
5153 { 5191 {
5154 printatom (SCHEME_A_ SCHEME_V->args, SCHEME_V->print_flag); 5192 printatom (SCHEME_A_ args, SCHEME_V->print_flag);
5155 s_return (S_T); 5193 s_return (S_T);
5156 } 5194 }
5157 else if (car (SCHEME_V->args) == SCHEME_V->QUOTE && ok_abbrev (cdr (SCHEME_V->args))) 5195 else
5158 { 5196 {
5197 pointer a = car (args);
5198 pointer b = cdr (args);
5199 int ok_abbr = ok_abbrev (b);
5200 SCHEME_V->args = car (b);
5201
5202 if (a == SCHEME_V->QUOTE && ok_abbr)
5159 putstr (SCHEME_A_ "'"); 5203 putstr (SCHEME_A_ "'");
5160 SCHEME_V->args = cadr (SCHEME_V->args); 5204 else if (a == SCHEME_V->QQUOTE && ok_abbr)
5205 putstr (SCHEME_A_ "`");
5206 else if (a == SCHEME_V->UNQUOTE && ok_abbr)
5207 putstr (SCHEME_A_ ",");
5208 else if (a == SCHEME_V->UNQUOTESP && ok_abbr)
5209 putstr (SCHEME_A_ ",@");
5210 else
5211 {
5212 putstr (SCHEME_A_ "(");
5213 s_save (SCHEME_A_ OP_P1LIST, b, NIL);
5214 SCHEME_V->args = a;
5215 }
5216
5161 s_goto (OP_P0LIST); 5217 s_goto (OP_P0LIST);
5162 } 5218 }
5163 else if (car (SCHEME_V->args) == SCHEME_V->QQUOTE && ok_abbrev (cdr (SCHEME_V->args))) 5219
5220 case OP_P1LIST:
5221 if (is_pair (args))
5164 { 5222 {
5223 s_save (SCHEME_A_ OP_P1LIST, cdr (args), NIL);
5165 putstr (SCHEME_A_ "`"); 5224 putstr (SCHEME_A_ " ");
5166 SCHEME_V->args = cadr (SCHEME_V->args); 5225 SCHEME_V->args = car (args);
5167 s_goto (OP_P0LIST); 5226 s_goto (OP_P0LIST);
5168 } 5227 }
5169 else if (car (SCHEME_V->args) == SCHEME_V->UNQUOTE && ok_abbrev (cdr (SCHEME_V->args)))
5170 {
5171 putstr (SCHEME_A_ ",");
5172 SCHEME_V->args = cadr (SCHEME_V->args);
5173 s_goto (OP_P0LIST);
5174 }
5175 else if (car (SCHEME_V->args) == SCHEME_V->UNQUOTESP && ok_abbrev (cdr (SCHEME_V->args)))
5176 {
5177 putstr (SCHEME_A_ ",@");
5178 SCHEME_V->args = cadr (SCHEME_V->args);
5179 s_goto (OP_P0LIST);
5180 }
5181 else
5182 {
5183 putstr (SCHEME_A_ "(");
5184 s_save (SCHEME_A_ OP_P1LIST, cdr (SCHEME_V->args), NIL);
5185 SCHEME_V->args = car (SCHEME_V->args);
5186 s_goto (OP_P0LIST);
5187 }
5188
5189 case OP_P1LIST:
5190 if (is_pair (SCHEME_V->args))
5191 {
5192 s_save (SCHEME_A_ OP_P1LIST, cdr (SCHEME_V->args), NIL);
5193 putstr (SCHEME_A_ " ");
5194 SCHEME_V->args = car (SCHEME_V->args);
5195 s_goto (OP_P0LIST);
5196 }
5197 else if (is_vector (SCHEME_V->args)) 5228 else if (is_vector (args))
5198 { 5229 {
5199 s_save (SCHEME_A_ OP_P1LIST, NIL, NIL); 5230 s_save (SCHEME_A_ OP_P1LIST, NIL, NIL);
5200 putstr (SCHEME_A_ " . "); 5231 putstr (SCHEME_A_ " . ");
5201 s_goto (OP_P0LIST); 5232 s_goto (OP_P0LIST);
5202 } 5233 }
5203 else 5234 else
5204 { 5235 {
5205 if (SCHEME_V->args != NIL) 5236 if (args != NIL)
5206 { 5237 {
5207 putstr (SCHEME_A_ " . "); 5238 putstr (SCHEME_A_ " . ");
5208 printatom (SCHEME_A_ SCHEME_V->args, SCHEME_V->print_flag); 5239 printatom (SCHEME_A_ args, SCHEME_V->print_flag);
5209 } 5240 }
5210 5241
5211 putstr (SCHEME_A_ ")"); 5242 putstr (SCHEME_A_ ")");
5212 s_return (S_T); 5243 s_return (S_T);
5213 } 5244 }
5214 5245
5215 case OP_PVECFROM: 5246 case OP_PVECFROM:
5216 { 5247 {
5217 int i = ivalue_unchecked (cdr (SCHEME_V->args)); 5248 int i = ivalue_unchecked (cdr (args));
5218 pointer vec = car (SCHEME_V->args); 5249 pointer vec = car (args);
5219 int len = veclength (vec); 5250 int len = veclength (vec);
5220 5251
5221 if (i == len) 5252 if (i == len)
5222 { 5253 {
5223 putstr (SCHEME_A_ ")"); 5254 putstr (SCHEME_A_ ")");
5224 s_return (S_T); 5255 s_return (S_T);
5225 } 5256 }
5226 else 5257 else
5227 { 5258 {
5228 pointer elem = vector_elem (vec, i); 5259 pointer elem = vector_get (vec, i);
5229 5260
5230 ivalue_unchecked (cdr (SCHEME_V->args)) = i + 1; 5261 ivalue_unchecked (cdr (args)) = i + 1;
5231 s_save (SCHEME_A_ OP_PVECFROM, SCHEME_V->args, NIL); 5262 s_save (SCHEME_A_ OP_PVECFROM, args, NIL);
5232 SCHEME_V->args = elem; 5263 SCHEME_V->args = elem;
5233 5264
5234 if (i > 0) 5265 if (i > 0)
5235 putstr (SCHEME_A_ " "); 5266 putstr (SCHEME_A_ " ");
5236 5267
5237 s_goto (OP_P0LIST); 5268 s_goto (OP_P0LIST);
5238 } 5269 }
5239 } 5270 }
5240 } 5271 }
5241 5272
5242 abort (); 5273 if (USE_ERROR_CHECKING) abort ();
5243} 5274}
5244 5275
5245static pointer 5276static int
5246opexe_6 (SCHEME_P_ enum scheme_opcodes op) 5277opexe_6 (SCHEME_P_ enum scheme_opcodes op)
5247{ 5278{
5279 pointer args = SCHEME_V->args;
5280 pointer a = car (args);
5248 pointer x, y; 5281 pointer x, y;
5249 5282
5250 switch (op) 5283 switch (op)
5251 { 5284 {
5252 case OP_LIST_LENGTH: /* length *//* a.k */ 5285 case OP_LIST_LENGTH: /* length *//* a.k */
5253 { 5286 {
5254 long v = list_length (SCHEME_A_ car (SCHEME_V->args)); 5287 long v = list_length (SCHEME_A_ a);
5255 5288
5256 if (v < 0) 5289 if (v < 0)
5257 Error_1 ("length: not a list:", car (SCHEME_V->args)); 5290 Error_1 ("length: not a list:", a);
5258 5291
5259 s_return (mk_integer (SCHEME_A_ v)); 5292 s_return (mk_integer (SCHEME_A_ v));
5260 } 5293 }
5261 5294
5262 case OP_ASSQ: /* assq *//* a.k */ 5295 case OP_ASSQ: /* assq *//* a.k */
5263 x = car (SCHEME_V->args); 5296 x = a;
5264 5297
5265 for (y = cadr (SCHEME_V->args); is_pair (y); y = cdr (y)) 5298 for (y = cadr (args); is_pair (y); y = cdr (y))
5266 { 5299 {
5267 if (!is_pair (car (y))) 5300 if (!is_pair (car (y)))
5268 Error_0 ("unable to handle non pair element"); 5301 Error_0 ("unable to handle non pair element");
5269 5302
5270 if (x == caar (y)) 5303 if (x == caar (y))
… …
5276 else 5309 else
5277 s_return (S_F); 5310 s_return (S_F);
5278 5311
5279 5312
5280 case OP_GET_CLOSURE: /* get-closure-code *//* a.k */ 5313 case OP_GET_CLOSURE: /* get-closure-code *//* a.k */
5281 SCHEME_V->args = car (SCHEME_V->args); 5314 SCHEME_V->args = a;
5282 5315
5283 if (SCHEME_V->args == NIL) 5316 if (SCHEME_V->args == NIL)
5284 s_return (S_F); 5317 s_return (S_F);
5285 else if (is_closure (SCHEME_V->args)) 5318 else if (is_closure (SCHEME_V->args))
5286 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value))); 5319 s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value)));
… …
5291 5324
5292 case OP_CLOSUREP: /* closure? */ 5325 case OP_CLOSUREP: /* closure? */
5293 /* 5326 /*
5294 * Note, macro object is also a closure. 5327 * Note, macro object is also a closure.
5295 * Therefore, (closure? <#MACRO>) ==> #t 5328 * Therefore, (closure? <#MACRO>) ==> #t
5329 * (schmorp) well, obviously not, fix? TODO
5296 */ 5330 */
5297 s_retbool (is_closure (car (SCHEME_V->args))); 5331 s_retbool (is_closure (a));
5298 5332
5299 case OP_MACROP: /* macro? */ 5333 case OP_MACROP: /* macro? */
5300 s_retbool (is_macro (car (SCHEME_V->args))); 5334 s_retbool (is_macro (a));
5301 } 5335 }
5302 5336
5303 abort (); 5337 if (USE_ERROR_CHECKING) abort ();
5304} 5338}
5305 5339
5340/* dispatch functions (opexe_x) return new opcode, or 0 for same opcode, or -1 to stop */
5306typedef pointer (*dispatch_func) (SCHEME_P_ enum scheme_opcodes); 5341typedef int (*dispatch_func)(SCHEME_P_ enum scheme_opcodes);
5307 5342
5308typedef int (*test_predicate) (pointer); 5343typedef int (*test_predicate)(pointer);
5309static int 5344static int
5310is_any (pointer p) 5345tst_any (pointer p)
5311{ 5346{
5312 return 1; 5347 return 1;
5313} 5348}
5314 5349
5315static int 5350static int
5316is_nonneg (pointer p) 5351tst_inonneg (pointer p)
5317{ 5352{
5318 return ivalue (p) >= 0 && is_integer (p); 5353 return is_integer (p) && ivalue_unchecked (p) >= 0;
5354}
5355
5356static int
5357tst_is_list (SCHEME_P_ pointer p)
5358{
5359 return p == NIL || is_pair (p);
5319} 5360}
5320 5361
5321/* Correspond carefully with following defines! */ 5362/* Correspond carefully with following defines! */
5322static struct 5363static struct
5323{ 5364{
5324 test_predicate fct; 5365 test_predicate fct;
5325 const char *kind; 5366 const char *kind;
5326} tests[] = 5367} tests[] = {
5327{ 5368 { tst_any , 0 },
5328 { 0, 0}, /* unused */ 5369 { is_string , "string" },
5329 { is_any, 0}, 5370 { is_symbol , "symbol" },
5330 { is_string, "string" }, 5371 { is_port , "port" },
5331 { is_symbol, "symbol" },
5332 { is_port, "port" },
5333 { is_inport, "input port" }, 5372 { is_inport , "input port" },
5334 { is_outport, "output port" }, 5373 { is_outport , "output port" },
5335 { is_environment, "environment" }, 5374 { is_environment, "environment" },
5336 { is_pair, "pair" }, 5375 { is_pair , "pair" },
5337 { 0, "pair or '()" }, 5376 { 0 , "pair or '()" },
5338 { is_character, "character" }, 5377 { is_character , "character" },
5339 { is_vector, "vector" }, 5378 { is_vector , "vector" },
5340 { is_number, "number" }, 5379 { is_number , "number" },
5341 { is_integer, "integer" }, 5380 { is_integer , "integer" },
5342 { is_nonneg, "non-negative integer" } 5381 { tst_inonneg , "non-negative integer" }
5343}; 5382};
5344 5383
5345#define TST_NONE 0 5384#define TST_NONE 0 /* TST_NONE used for built-ins, 0 for internal ops */
5346#define TST_ANY "\001" 5385#define TST_ANY "\001"
5347#define TST_STRING "\002" 5386#define TST_STRING "\002"
5348#define TST_SYMBOL "\003" 5387#define TST_SYMBOL "\003"
5349#define TST_PORT "\004" 5388#define TST_PORT "\004"
5350#define TST_INPORT "\005" 5389#define TST_INPORT "\005"
5351#define TST_OUTPORT "\006" 5390#define TST_OUTPORT "\006"
5352#define TST_ENVIRONMENT "\007" 5391#define TST_ENVIRONMENT "\007"
5353#define TST_PAIR "\010" 5392#define TST_PAIR "\010"
5354#define TST_LIST "\011" 5393#define TST_LIST "\011"
5355#define TST_CHAR "\012" 5394#define TST_CHAR "\012"
5356#define TST_VECTOR "\013" 5395#define TST_VECTOR "\013"
5357#define TST_NUMBER "\014" 5396#define TST_NUMBER "\014"
5358#define TST_INTEGER "\015" 5397#define TST_INTEGER "\015"
5359#define TST_NATURAL "\016" 5398#define TST_NATURAL "\016"
5399
5400#define INF_ARG 0xff
5401#define UNNAMED_OP ""
5402
5403static const char opnames[] =
5404#define OP_DEF(func,name,minarity,maxarity,argtest,op) name "\x00"
5405#include "opdefines.h"
5406#undef OP_DEF
5407;
5408
5409static const char *
5410opname (int idx)
5411{
5412 const char *name = opnames;
5413
5414 /* should do this at compile time, but would require external program, right? */
5415 while (idx--)
5416 name += strlen (name) + 1;
5417
5418 return *name ? name : "ILLEGAL";
5419}
5420
5421static const char *
5422procname (pointer x)
5423{
5424 return opname (procnum (x));
5425}
5360 5426
5361typedef struct 5427typedef struct
5362{ 5428{
5363 dispatch_func func; 5429 uint8_t func;
5364 char *name; 5430 /*dispatch_func func;*//*TODO: maybe optionally keep the pointer, for speed? */
5431 uint8_t builtin;
5432#if USE_ERROR_CHECKING
5365 int min_arity; 5433 uint8_t min_arity;
5366 int max_arity; 5434 uint8_t max_arity;
5367 char *arg_tests_encoding; 5435 char arg_tests_encoding[3];
5436#endif
5368} op_code_info; 5437} op_code_info;
5369 5438
5370#define INF_ARG 0xffff
5371
5372static op_code_info dispatch_table[] = { 5439static const op_code_info dispatch_table[] = {
5373#define OP_DEF(A,B,C,D,E,OP) {A,B,C,D,E}, 5440#if USE_ERROR_CHECKING
5441#define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1, minarity, maxarity, argtest },
5442#else
5443#define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1 },
5444#endif
5374#include "opdefines.h" 5445#include "opdefines.h"
5446#undef OP_DEF
5375 {0} 5447 {0}
5376}; 5448};
5377 5449
5378static const char *
5379procname (pointer x)
5380{
5381 int n = procnum (x);
5382 const char *name = dispatch_table[n].name;
5383
5384 if (name == 0)
5385 name = "ILLEGAL!";
5386
5387 return name;
5388}
5389
5390/* kernel of this interpreter */ 5450/* kernel of this interpreter */
5391static void 5451static void ecb_hot
5392Eval_Cycle (SCHEME_P_ enum scheme_opcodes op) 5452Eval_Cycle (SCHEME_P_ enum scheme_opcodes op)
5393{ 5453{
5394 SCHEME_V->op = op; 5454 SCHEME_V->op = op;
5395 5455
5396 for (;;) 5456 for (;;)
5397 { 5457 {
5398 op_code_info *pcd = dispatch_table + SCHEME_V->op; 5458 const op_code_info *pcd = dispatch_table + SCHEME_V->op;
5399 5459
5400#if USE_ERROR_CHECKING 5460#if USE_ERROR_CHECKING
5401 if (pcd->name) /* if built-in function, check arguments */ 5461 if (pcd->builtin) /* if built-in function, check arguments */
5402 { 5462 {
5403 int ok = 1;
5404 char msg[STRBUFFSIZE]; 5463 char msg[STRBUFFSIZE];
5405 int n = list_length (SCHEME_A_ SCHEME_V->args); 5464 int n = list_length (SCHEME_A_ SCHEME_V->args);
5406 5465
5407 /* Check number of arguments */ 5466 /* Check number of arguments */
5408 if (ecb_expect_false (n < pcd->min_arity)) 5467 if (ecb_expect_false (n < pcd->min_arity))
5409 { 5468 {
5410 ok = 0;
5411 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", 5469 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)",
5412 pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity); 5470 opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity);
5471 xError_1 (SCHEME_A_ msg, 0);
5472 continue;
5413 } 5473 }
5414 else if (ecb_expect_false (n > pcd->max_arity)) 5474 else if (ecb_expect_false (n > pcd->max_arity && pcd->max_arity != INF_ARG))
5415 { 5475 {
5416 ok = 0;
5417 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", 5476 snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)",
5418 pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity); 5477 opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity);
5478 xError_1 (SCHEME_A_ msg, 0);
5479 continue;
5419 } 5480 }
5420 5481 else
5421 if (ecb_expect_false (ok))
5422 { 5482 {
5423 if (pcd->arg_tests_encoding) 5483 if (*pcd->arg_tests_encoding) /* literal 0 and TST_NONE treated the same */
5424 { 5484 {
5425 int i = 0; 5485 int i = 0;
5426 int j; 5486 int j;
5427 const char *t = pcd->arg_tests_encoding; 5487 const char *t = pcd->arg_tests_encoding;
5428 pointer arglist = SCHEME_V->args; 5488 pointer arglist = SCHEME_V->args;
5429 5489
5430 do 5490 do
5431 { 5491 {
5432 pointer arg = car (arglist); 5492 pointer arg = car (arglist);
5433 5493
5434 j = (int) t[0]; 5494 j = t[0];
5435 5495
5496 /*TODO: tst_is_list has different prototype - fix if other tests acquire same prototype */
5436 if (j == TST_LIST[0]) 5497 if (j == TST_LIST[0])
5437 { 5498 {
5438 if (arg != NIL && !is_pair (arg)) 5499 if (!tst_is_list (SCHEME_A_ arg))
5439 break; 5500 break;
5440 } 5501 }
5441 else 5502 else
5442 { 5503 {
5443 if (!tests[j].fct (arg)) 5504 if (!tests[j - 1].fct (arg))
5444 break; 5505 break;
5445 } 5506 }
5446 5507
5447 if (t[1] != 0) /* last test is replicated as necessary */ 5508 if (t < pcd->arg_tests_encoding + sizeof (pcd->arg_tests_encoding) - 1 && t[1]) /* last test is replicated as necessary */
5448 t++; 5509 t++;
5449 5510
5450 arglist = cdr (arglist); 5511 arglist = cdr (arglist);
5451 i++; 5512 i++;
5452 } 5513 }
5453 while (i < n); 5514 while (i < n);
5454 5515
5455 if (i < n) 5516 if (i < n)
5456 { 5517 {
5457 ok = 0;
5458 snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", pcd->name, i + 1, tests[j].kind); 5518 snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", opname (SCHEME_V->op), i + 1, tests[j].kind);
5519 xError_1 (SCHEME_A_ msg, 0);
5520 continue;
5459 } 5521 }
5460 } 5522 }
5461 } 5523 }
5462
5463 if (!ok)
5464 {
5465 if (xError_1 (SCHEME_A_ msg, 0) == NIL)
5466 return;
5467
5468 pcd = dispatch_table + SCHEME_V->op;
5469 }
5470 } 5524 }
5471#endif 5525#endif
5472 5526
5473 ok_to_freely_gc (SCHEME_A); 5527 ok_to_freely_gc (SCHEME_A);
5474 5528
5529 static const dispatch_func dispatch_funcs[] = {
5530 opexe_0,
5531 opexe_1,
5532 opexe_2,
5533 opexe_3,
5534 opexe_4,
5535 opexe_5,
5536 opexe_6,
5537 };
5538
5475 if (ecb_expect_false (pcd->func (SCHEME_A_ SCHEME_V->op) == NIL)) 5539 if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0))
5476 return; 5540 return;
5477 5541
5478 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 5542 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
5479 { 5543 {
5480 xwrstr ("No memory!\n"); 5544 xwrstr ("No memory!\n");
… …
5504mk_proc (SCHEME_P_ enum scheme_opcodes op) 5568mk_proc (SCHEME_P_ enum scheme_opcodes op)
5505{ 5569{
5506 pointer y = get_cell (SCHEME_A_ NIL, NIL); 5570 pointer y = get_cell (SCHEME_A_ NIL, NIL);
5507 set_typeflag (y, (T_PROC | T_ATOM)); 5571 set_typeflag (y, (T_PROC | T_ATOM));
5508 ivalue_unchecked (y) = op; 5572 ivalue_unchecked (y) = op;
5509 set_num_integer (y);
5510 return y; 5573 return y;
5511} 5574}
5512 5575
5513/* Hard-coded for the given keywords. Remember to rewrite if more are added! */ 5576/* Hard-coded for the given keywords. Remember to rewrite if more are added! */
5514static int 5577static int
5515syntaxnum (pointer p) 5578syntaxnum (pointer p)
5516{ 5579{
5517 const char *s = strvalue (car (p)); 5580 const char *s = strvalue (p);
5518 5581
5519 switch (strlength (car (p))) 5582 switch (strlength (p))
5520 { 5583 {
5521 case 2: 5584 case 2:
5522 if (s[0] == 'i') 5585 if (s[0] == 'i')
5523 return OP_IF0; /* if */ 5586 return OP_IF0; /* if */
5524 else 5587 else
… …
5579 return OP_C0STREAM; /* cons-stream */ 5642 return OP_C0STREAM; /* cons-stream */
5580 } 5643 }
5581} 5644}
5582 5645
5583#if USE_MULTIPLICITY 5646#if USE_MULTIPLICITY
5584scheme * 5647ecb_cold scheme *
5585scheme_init_new () 5648scheme_init_new ()
5586{ 5649{
5587 scheme *sc = malloc (sizeof (scheme)); 5650 scheme *sc = malloc (sizeof (scheme));
5588 5651
5589 if (!scheme_init (SCHEME_A)) 5652 if (!scheme_init (SCHEME_A))
… …
5594 else 5657 else
5595 return sc; 5658 return sc;
5596} 5659}
5597#endif 5660#endif
5598 5661
5599int 5662ecb_cold int
5600scheme_init (SCHEME_P) 5663scheme_init (SCHEME_P)
5601{ 5664{
5602 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]); 5665 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]);
5603 pointer x; 5666 pointer x;
5604 5667
… …
5677 5740
5678 for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i) 5741 for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i)
5679 assign_syntax (SCHEME_A_ syntax_names[i]); 5742 assign_syntax (SCHEME_A_ syntax_names[i]);
5680 } 5743 }
5681 5744
5745 // TODO: should iterate via strlen, to avoid n² complexity
5682 for (i = 0; i < n; i++) 5746 for (i = 0; i < n; i++)
5683 if (dispatch_table[i].name != 0) 5747 if (dispatch_table[i].builtin)
5684 assign_proc (SCHEME_A_ i, dispatch_table[i].name); 5748 assign_proc (SCHEME_A_ i, opname (i));
5685 5749
5686 /* initialization of global pointers to special symbols */ 5750 /* initialization of global pointers to special symbols */
5687 SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda"); 5751 SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda");
5688 SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote"); 5752 SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote");
5689 SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote"); 5753 SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote");
… …
5728scheme_set_external_data (SCHEME_P_ void *p) 5792scheme_set_external_data (SCHEME_P_ void *p)
5729{ 5793{
5730 SCHEME_V->ext_data = p; 5794 SCHEME_V->ext_data = p;
5731} 5795}
5732 5796
5733void 5797ecb_cold void
5734scheme_deinit (SCHEME_P) 5798scheme_deinit (SCHEME_P)
5735{ 5799{
5736 int i; 5800 int i;
5737 5801
5738#if SHOW_ERROR_LINE 5802#if SHOW_ERROR_LINE
… …
5959# endif 6023# endif
5960 int fin; 6024 int fin;
5961 char *file_name = InitFile; 6025 char *file_name = InitFile;
5962 int retcode; 6026 int retcode;
5963 int isfile = 1; 6027 int isfile = 1;
6028 system ("ps v $PPID");//D
5964 6029
5965 if (argc == 2 && strcmp (argv[1], "-?") == 0) 6030 if (argc == 2 && strcmp (argv[1], "-?") == 0)
5966 { 6031 {
5967 xwrstr ("Usage: tinyscheme -?\n"); 6032 xwrstr ("Usage: tinyscheme -?\n");
5968 xwrstr ("or: tinyscheme [<file1> <file2> ...]\n"); 6033 xwrstr ("or: tinyscheme [<file1> <file2> ...]\n");

Diff Legend

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