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.4 by root, Wed Nov 25 10:49:29 2015 UTC vs.
Revision 1.45 by root, Mon Nov 30 07:44:23 2015 UTC

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

Diff Legend

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