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.25 by root, Fri Nov 27 04:37:26 2015 UTC vs.
Revision 1.50 by root, Tue Dec 1 00:47:54 2015 UTC

… …
16 * (MINISCM) This is a revised and modified version by Akira KIDA. 16 * (MINISCM) This is a revised and modified version by Akira KIDA.
17 * (MINISCM) current version is 0.85k4 (15 May 1994) 17 * (MINISCM) current version is 0.85k4 (15 May 1994)
18 * 18 *
19 */ 19 */
20 20
21#define EXPERIMENT 1
22
21#define PAGE_SIZE 4096 /* does not work on sparc/alpha */ 23#define PAGE_SIZE 4096 /* does not work on sparc/alpha */
22#include "malloc.c" 24#include "malloc.c"
23 25
24#define SCHEME_SOURCE 26#define SCHEME_SOURCE
25#include "scheme-private.h" 27#include "scheme-private.h"
… …
34 36
35#include <sys/types.h> 37#include <sys/types.h>
36#include <sys/stat.h> 38#include <sys/stat.h>
37#include <fcntl.h> 39#include <fcntl.h>
38 40
41#if !USE_ERROR_CHECKING
42# define NDEBUG
43#endif
44
45#include <assert.h>
46#include <stdlib.h>
39#include <string.h> 47#include <string.h>
40#include <stdlib.h>
41 48
42#include <limits.h> 49#include <limits.h>
43#include <inttypes.h> 50#include <inttypes.h>
44#include <float.h> 51#include <float.h>
45//#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
46 61
47enum { 62enum {
48 TOK_EOF, 63 TOK_EOF,
49 TOK_LPAREN, 64 TOK_LPAREN,
50 TOK_RPAREN, 65 TOK_RPAREN,
51 TOK_DOT, 66 TOK_DOT,
52 TOK_ATOM, 67 TOK_ATOM,
68 TOK_DOTATOM, /* atom name starting with '.' */
69 TOK_STRATOM, /* atom name enclosed in | */
53 TOK_QUOTE, 70 TOK_QUOTE,
54 TOK_DQUOTE, 71 TOK_DQUOTE,
55 TOK_BQUOTE, 72 TOK_BQUOTE,
56 TOK_COMMA, 73 TOK_COMMA,
57 TOK_ATMARK, 74 TOK_ATMARK,
… …
59 TOK_SHARP_CONST, 76 TOK_SHARP_CONST,
60 TOK_VEC 77 TOK_VEC
61}; 78};
62 79
63#define BACKQUOTE '`' 80#define BACKQUOTE '`'
64#define DELIMITERS "()\";\f\t\v\n\r " 81#define WHITESPACE " \t\r\n\v\f"
82#define DELIMITERS "()\";" WHITESPACE
65 83
66#define NIL (&SCHEME_V->xNIL) //TODO: make this 0? 84#define NIL (&SCHEME_V->xNIL)
67#define S_T (&SCHEME_V->xT) //TODO: magic ptr value? 85#define S_T (&SCHEME_V->xT)
68#define S_F (&SCHEME_V->xF) //TODO: magic ptr value? 86#define S_F (&SCHEME_V->xF)
69#define S_SINK (&SCHEME_V->xsink) 87#define S_SINK (&SCHEME_V->xsink)
70#define S_EOF (&SCHEME_V->xEOF_OBJ) 88#define S_EOF (&SCHEME_V->xEOF_OBJ)
71 89
72#if !USE_MULTIPLICITY 90#if !USE_MULTIPLICITY
73static scheme sc; 91static scheme sc;
… …
182# define FIRST_CELLSEGS 3 200# define FIRST_CELLSEGS 3
183#endif 201#endif
184 202
185enum scheme_types 203enum scheme_types
186{ 204{
205 T_INTEGER,
187 T_FREE, 206 T_REAL,
188 T_STRING, 207 T_STRING,
189 T_NUMBER,
190 T_SYMBOL, 208 T_SYMBOL,
191 T_PROC, 209 T_PROC,
192 T_PAIR, 210 T_PAIR, /* also used for free cells */
193 T_CLOSURE, 211 T_CLOSURE,
194 T_CONTINUATION, 212 T_CONTINUATION,
195 T_FOREIGN, 213 T_FOREIGN,
196 T_CHARACTER, 214 T_CHARACTER,
197 T_PORT, 215 T_PORT,
… …
207#define T_SYNTAX 0x0010 225#define T_SYNTAX 0x0010
208#define T_IMMUTABLE 0x0020 226#define T_IMMUTABLE 0x0020
209#define T_ATOM 0x0040 /* only for gc */ 227#define T_ATOM 0x0040 /* only for gc */
210#define T_MARK 0x0080 /* only for gc */ 228#define T_MARK 0x0080 /* only for gc */
211 229
230/* num, for generic arithmetic */
231struct num
232{
233 IVALUE ivalue;
234#if USE_REAL
235 RVALUE rvalue;
236 char is_fixnum;
237#endif
238};
239
240#if USE_REAL
241# define num_is_fixnum(n) (n).is_fixnum
242# define num_set_fixnum(n,f) (n).is_fixnum = (f)
243# define num_ivalue(n) (n).ivalue
244# define num_rvalue(n) (n).rvalue
245# define num_set_ivalue(n,i) (n).rvalue = (n).ivalue = (i)
246# define num_set_rvalue(n,r) (n).rvalue = (r)
247#else
248# define num_is_fixnum(n) 1
249# define num_set_fixnum(n,f) 0
250# define num_ivalue(n) (n).ivalue
251# define num_rvalue(n) (n).ivalue
252# define num_set_ivalue(n,i) (n).ivalue = (i)
253# define num_set_rvalue(n,r) (n).ivalue = (r)
254#endif
255
212enum num_op { NUM_ADD, NUM_SUB, NUM_MUL, NUM_INTDIV }; 256enum num_op { NUM_ADD, NUM_SUB, NUM_MUL, NUM_INTDIV };
213 257
214static num num_op (enum num_op op, num a, num b); 258static num num_op (enum num_op op, num a, num b);
215static num num_intdiv (num a, num b); 259static num num_intdiv (num a, num b);
216static num num_rem (num a, num b); 260static num num_rem (num a, num b);
… …
236} 280}
237 281
238#define strvalue(p) ((p)->object.string.svalue) 282#define strvalue(p) ((p)->object.string.svalue)
239#define strlength(p) ((p)->object.string.length) 283#define strlength(p) ((p)->object.string.length)
240 284
241INTERFACE int is_list (SCHEME_P_ pointer p);
242
243INTERFACE int 285INTERFACE int
244is_vector (pointer p) 286is_vector (pointer p)
245{ 287{
246 return type (p) == T_VECTOR; 288 return type (p) == T_VECTOR;
247} 289}
248 290
249#define vecvalue(p) ((p)->object.vector.vvalue) 291#define vecvalue(p) ((p)->object.vector.vvalue)
250#define veclength(p) ((p)->object.vector.length) 292#define veclength(p) ((p)->object.vector.length)
251INTERFACE void fill_vector (pointer vec, pointer obj); 293INTERFACE void fill_vector (pointer vec, uint32_t start, pointer obj);
252INTERFACE uint32_t vector_length (pointer vec);
253INTERFACE pointer vector_elem (pointer vec, uint32_t ielem); 294INTERFACE pointer vector_get (pointer vec, uint32_t ielem);
254INTERFACE void set_vector_elem (pointer vec, uint32_t ielem, pointer a); 295INTERFACE void vector_set (pointer vec, uint32_t ielem, pointer a);
255 296
256INTERFACE uint32_t 297INTERFACE int
257vector_length (pointer vec) 298is_integer (pointer p)
258{ 299{
259 return vec->object.vector.length; 300 return type (p) == T_INTEGER;
301}
302
303/* not the same as in scheme, where integers are (correctly :) reals */
304INTERFACE int
305is_real (pointer p)
306{
307 return type (p) == T_REAL;
260} 308}
261 309
262INTERFACE int 310INTERFACE int
263is_number (pointer p) 311is_number (pointer p)
264{ 312{
265 return type (p) == T_NUMBER; 313 return is_integer (p) || is_real (p);
266}
267
268INTERFACE int
269is_integer (pointer p)
270{
271 return is_number (p) && num_is_fixnum (p->object.number);
272}
273
274INTERFACE int
275is_real (pointer p)
276{
277 return is_number (p) && !num_is_fixnum (p->object.number);
278} 314}
279 315
280INTERFACE int 316INTERFACE int
281is_character (pointer p) 317is_character (pointer p)
282{ 318{
… …
287string_value (pointer p) 323string_value (pointer p)
288{ 324{
289 return strvalue (p); 325 return strvalue (p);
290} 326}
291 327
292ecb_inline num
293nvalue (pointer p)
294{
295 return (p)->object.number;
296}
297
298static IVALUE
299num_get_ivalue (const num n)
300{
301 return num_is_fixnum (n) ? num_ivalue (n) : (IVALUE)num_rvalue (n);
302}
303
304static RVALUE
305num_get_rvalue (const num n)
306{
307 return num_is_fixnum (n) ? (RVALUE)num_ivalue (n) : num_rvalue (n);
308}
309
310INTERFACE IVALUE
311ivalue (pointer p)
312{
313 return num_get_ivalue (p->object.number);
314}
315
316INTERFACE RVALUE
317rvalue (pointer p)
318{
319 return num_get_rvalue (p->object.number);
320}
321
322#define ivalue_unchecked(p) ((p)->object.number.value.ivalue) 328#define ivalue_unchecked(p) (p)->object.ivalue
329#define set_ivalue(p,v) (p)->object.ivalue = (v)
330
323#if USE_REAL 331#if USE_REAL
324# define rvalue_unchecked(p) ((p)->object.number.value.rvalue) 332#define rvalue_unchecked(p) (p)->object.rvalue
325# define set_num_integer(p) (p)->object.number.is_fixnum=1; 333#define set_rvalue(p,v) (p)->object.rvalue = (v)
326# define set_num_real(p) (p)->object.number.is_fixnum=0;
327#else 334#else
328# define rvalue_unchecked(p) ((p)->object.number.value.ivalue) 335#define rvalue_unchecked(p) (p)->object.ivalue
329# define set_num_integer(p) 0 336#define set_rvalue(p,v) (p)->object.ivalue = (v)
330# define set_num_real(p) 0
331#endif 337#endif
332 338
333INTERFACE long 339INTERFACE long
334charvalue (pointer p) 340charvalue (pointer p)
335{ 341{
… …
403} 409}
404 410
405INTERFACE char * 411INTERFACE char *
406symname (pointer p) 412symname (pointer p)
407{ 413{
408 return strvalue (car (p)); 414 return strvalue (p);
409} 415}
410 416
411#if USE_PLIST 417#if USE_PLIST
418#error plists are broken because symbols are no longer pairs
419#define symprop(p) cdr(p)
412SCHEME_EXPORT int 420SCHEME_EXPORT int
413hasprop (pointer p) 421hasprop (pointer p)
414{ 422{
415 return typeflag (p) & T_SYMBOL; 423 return typeflag (p) & T_SYMBOL;
416} 424}
417
418# define symprop(p) cdr(p)
419#endif 425#endif
420 426
421INTERFACE int 427INTERFACE int
422is_syntax (pointer p) 428is_syntax (pointer p)
423{ 429{
… …
437} 443}
438 444
439INTERFACE char * 445INTERFACE char *
440syntaxname (pointer p) 446syntaxname (pointer p)
441{ 447{
442 return strvalue (car (p)); 448 return strvalue (p);
443} 449}
444 450
445#define procnum(p) ivalue (p) 451#define procnum(p) ivalue_unchecked (p)
446static const char *procname (pointer x); 452static const char *procname (pointer x);
447 453
448INTERFACE int 454INTERFACE int
449is_closure (pointer p) 455is_closure (pointer p)
450{ 456{
… …
511setimmutable (pointer p) 517setimmutable (pointer p)
512{ 518{
513#if USE_ERROR_CHECKING 519#if USE_ERROR_CHECKING
514 set_typeflag (p, typeflag (p) | T_IMMUTABLE); 520 set_typeflag (p, typeflag (p) | T_IMMUTABLE);
515#endif 521#endif
522}
523
524/* Result is:
525 proper list: length
526 circular list: -1
527 not even a pair: -2
528 dotted list: -2 minus length before dot
529*/
530INTERFACE int
531list_length (SCHEME_P_ pointer a)
532{
533 int i = 0;
534 pointer slow, fast;
535
536 slow = fast = a;
537
538 while (1)
539 {
540 if (fast == NIL)
541 return i;
542
543 if (!is_pair (fast))
544 return -2 - i;
545
546 fast = cdr (fast);
547 ++i;
548
549 if (fast == NIL)
550 return i;
551
552 if (!is_pair (fast))
553 return -2 - i;
554
555 ++i;
556 fast = cdr (fast);
557
558 /* Safe because we would have already returned if `fast'
559 encountered a non-pair. */
560 slow = cdr (slow);
561
562 if (fast == slow)
563 {
564 /* the fast pointer has looped back around and caught up
565 with the slow pointer, hence the structure is circular,
566 not of finite length, and therefore not a list */
567 return -1;
568 }
569 }
570}
571
572INTERFACE int
573is_list (SCHEME_P_ pointer a)
574{
575 return list_length (SCHEME_A_ a) >= 0;
516} 576}
517 577
518#if USE_CHAR_CLASSIFIERS 578#if USE_CHAR_CLASSIFIERS
519ecb_inline int 579ecb_inline int
520Cisalpha (int c) 580Cisalpha (int c)
… …
609#endif 669#endif
610 670
611static int file_push (SCHEME_P_ const char *fname); 671static int file_push (SCHEME_P_ const char *fname);
612static void file_pop (SCHEME_P); 672static void file_pop (SCHEME_P);
613static int file_interactive (SCHEME_P); 673static int file_interactive (SCHEME_P);
614ecb_inline int is_one_of (char *s, int c); 674ecb_inline int is_one_of (const char *s, int c);
615static int alloc_cellseg (SCHEME_P_ int n); 675static int alloc_cellseg (SCHEME_P_ int n);
616ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b); 676ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b);
617static void finalize_cell (SCHEME_P_ pointer a); 677static void finalize_cell (SCHEME_P_ pointer a);
618static int count_consecutive_cells (pointer x, int needed); 678static int count_consecutive_cells (pointer x, int needed);
619static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all); 679static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all);
… …
636static void mark (pointer a); 696static void mark (pointer a);
637static void gc (SCHEME_P_ pointer a, pointer b); 697static void gc (SCHEME_P_ pointer a, pointer b);
638static int basic_inchar (port *pt); 698static int basic_inchar (port *pt);
639static int inchar (SCHEME_P); 699static int inchar (SCHEME_P);
640static void backchar (SCHEME_P_ int c); 700static void backchar (SCHEME_P_ int c);
641static char *readstr_upto (SCHEME_P_ char *delim); 701static char *readstr_upto (SCHEME_P_ int skip, const char *delim);
642static pointer readstrexp (SCHEME_P); 702static pointer readstrexp (SCHEME_P_ char delim);
643ecb_inline int skipspace (SCHEME_P); 703ecb_inline int skipspace (SCHEME_P);
644static int token (SCHEME_P); 704static int token (SCHEME_P);
645static void printslashstring (SCHEME_P_ char *s, int len); 705static void printslashstring (SCHEME_P_ char *s, int len);
646static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen); 706static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen);
647static void printatom (SCHEME_P_ pointer l, int f); 707static void printatom (SCHEME_P_ pointer l, int f);
… …
664static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op); 724static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op);
665static void assign_syntax (SCHEME_P_ const char *name); 725static void assign_syntax (SCHEME_P_ const char *name);
666static int syntaxnum (pointer p); 726static int syntaxnum (pointer p);
667static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name); 727static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name);
668 728
729static IVALUE
730ivalue (pointer x)
731{
732 return is_integer (x) ? ivalue_unchecked (x) : rvalue_unchecked (x);
733}
734
735static RVALUE
736rvalue (pointer x)
737{
738 return is_integer (x) ? ivalue_unchecked (x) : rvalue_unchecked (x);
739}
740
741INTERFACE num
742nvalue (pointer x)
743{
744 num n;
745
746 num_set_fixnum (n, is_integer (x));
747
748 if (num_is_fixnum (n))
749 num_set_ivalue (n, ivalue_unchecked (x));
750 else
751 num_set_rvalue (n, rvalue_unchecked (x));
752
753 return n;
754}
755
669static num 756static num
670num_op (enum num_op op, num a, num b) 757num_op (enum num_op op, num a, num b)
671{ 758{
672 num ret; 759 num ret;
673 760
674 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 761 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
675 762
676 if (num_is_fixnum (ret)) 763 if (num_is_fixnum (ret))
677 { 764 {
678 IVALUE av = num_get_ivalue (a);
679 IVALUE bv = num_get_ivalue (b);
680
681 switch (op) 765 switch (op)
682 { 766 {
683 case NUM_ADD: av += bv; break; 767 case NUM_ADD: a.ivalue += b.ivalue; break;
684 case NUM_SUB: av -= bv; break; 768 case NUM_SUB: a.ivalue -= b.ivalue; break;
685 case NUM_MUL: av *= bv; break; 769 case NUM_MUL: a.ivalue *= b.ivalue; break;
686 case NUM_INTDIV: av /= bv; break; 770 case NUM_INTDIV: a.ivalue /= b.ivalue; break;
687 } 771 }
688 772
689 num_set_ivalue (ret, av); 773 num_set_ivalue (ret, a.ivalue);
690 } 774 }
775#if USE_REAL
691 else 776 else
692 { 777 {
693 RVALUE av = num_get_rvalue (a);
694 RVALUE bv = num_get_rvalue (b);
695
696 switch (op) 778 switch (op)
697 { 779 {
698 case NUM_ADD: av += bv; break; 780 case NUM_ADD: a.rvalue += b.rvalue; break;
699 case NUM_SUB: av -= bv; break; 781 case NUM_SUB: a.rvalue -= b.rvalue; break;
700 case NUM_MUL: av *= bv; break; 782 case NUM_MUL: a.rvalue *= b.rvalue; break;
701 case NUM_INTDIV: av /= bv; break; 783 case NUM_INTDIV: a.rvalue /= b.rvalue; break;
702 } 784 }
703 785
704 num_set_rvalue (ret, av); 786 num_set_rvalue (ret, a.rvalue);
705 } 787 }
788#endif
706 789
707 return ret; 790 return ret;
708} 791}
709 792
710static num 793static num
711num_div (num a, num b) 794num_div (num a, num b)
712{ 795{
713 num ret; 796 num ret;
714 797
715 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_get_ivalue (a) % num_get_ivalue (b) == 0); 798 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_ivalue (a) % num_ivalue (b) == 0);
716 799
717 if (num_is_fixnum (ret)) 800 if (num_is_fixnum (ret))
718 num_set_ivalue (ret, num_get_ivalue (a) / num_get_ivalue (b)); 801 num_set_ivalue (ret, num_ivalue (a) / num_ivalue (b));
719 else 802 else
720 num_set_rvalue (ret, num_get_rvalue (a) / num_get_rvalue (b)); 803 num_set_rvalue (ret, num_rvalue (a) / num_rvalue (b));
721 804
722 return ret; 805 return ret;
723} 806}
724 807
725static num 808static num
… …
727{ 810{
728 num ret; 811 num ret;
729 long e1, e2, res; 812 long e1, e2, res;
730 813
731 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 814 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
732 e1 = num_get_ivalue (a); 815 e1 = num_ivalue (a);
733 e2 = num_get_ivalue (b); 816 e2 = num_ivalue (b);
734 res = e1 % e2; 817 res = e1 % e2;
735 818
736 /* remainder should have same sign as second operand */ 819 /* remainder should have same sign as second operand */
737 if (res > 0) 820 if (res > 0)
738 { 821 {
… …
754{ 837{
755 num ret; 838 num ret;
756 long e1, e2, res; 839 long e1, e2, res;
757 840
758 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); 841 num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b));
759 e1 = num_get_ivalue (a); 842 e1 = num_ivalue (a);
760 e2 = num_get_ivalue (b); 843 e2 = num_ivalue (b);
761 res = e1 % e2; 844 res = e1 % e2;
762 845
763 /* modulo should have same sign as second operand */ 846 /* modulo should have same sign as second operand */
764 if (res * e2 < 0) 847 if (res * e2 < 0)
765 res += e2; 848 res += e2;
… …
775 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b); 858 int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b);
776 int ret; 859 int ret;
777 860
778 if (is_fixnum) 861 if (is_fixnum)
779 { 862 {
780 IVALUE av = num_get_ivalue (a); 863 IVALUE av = num_ivalue (a);
781 IVALUE bv = num_get_ivalue (b); 864 IVALUE bv = num_ivalue (b);
782 865
783 ret = av == bv ? 0 : av < bv ? -1 : +1; 866 ret = av == bv ? 0 : av < bv ? -1 : +1;
784 } 867 }
785 else 868 else
786 { 869 {
787 RVALUE av = num_get_rvalue (a); 870 RVALUE av = num_rvalue (a);
788 RVALUE bv = num_get_rvalue (b); 871 RVALUE bv = num_rvalue (b);
789 872
790 ret = av == bv ? 0 : av < bv ? -1 : +1; 873 ret = av == bv ? 0 : av < bv ? -1 : +1;
791 } 874 }
792 875
793 return ret; 876 return ret;
… …
856 return k; 939 return k;
857 940
858 i = ++SCHEME_V->last_cell_seg; 941 i = ++SCHEME_V->last_cell_seg;
859 SCHEME_V->alloc_seg[i] = cp; 942 SCHEME_V->alloc_seg[i] = cp;
860 943
861 /* insert new segment in address order */
862 newp = (pointer)cp; 944 newp = (pointer)cp;
863 SCHEME_V->cell_seg[i] = newp; 945 SCHEME_V->cell_seg[i] = newp;
864 SCHEME_V->cell_segsize[i] = segsize; 946 SCHEME_V->cell_segsize[i] = segsize;
865
866 //TODO: insert, not swap
867 while (i > 0 && SCHEME_V->cell_seg[i - 1] > SCHEME_V->cell_seg[i])
868 {
869 p = SCHEME_V->cell_seg[i];
870 SCHEME_V->cell_seg[i] = SCHEME_V->cell_seg[i - 1];
871 SCHEME_V->cell_seg[i - 1] = p;
872
873 k = SCHEME_V->cell_segsize[i];
874 SCHEME_V->cell_segsize[i] = SCHEME_V->cell_segsize[i - 1];
875 SCHEME_V->cell_segsize[i - 1] = k;
876
877 --i;
878 }
879
880 SCHEME_V->fcells += segsize; 947 SCHEME_V->fcells += segsize;
881 last = newp + segsize - 1; 948 last = newp + segsize - 1;
882 949
883 for (p = newp; p <= last; p++) 950 for (p = newp; p <= last; p++)
884 { 951 {
885 set_typeflag (p, T_FREE); 952 set_typeflag (p, T_PAIR);
886 set_car (p, NIL); 953 set_car (p, NIL);
887 set_cdr (p, p + 1); 954 set_cdr (p, p + 1);
888 } 955 }
889 956
890 /* insert new cells in address order on free list */
891 if (SCHEME_V->free_cell == NIL || p < SCHEME_V->free_cell)
892 {
893 set_cdr (last, SCHEME_V->free_cell); 957 set_cdr (last, SCHEME_V->free_cell);
894 SCHEME_V->free_cell = newp; 958 SCHEME_V->free_cell = newp;
895 }
896 else
897 {
898 p = SCHEME_V->free_cell;
899
900 while (cdr (p) != NIL && newp > cdr (p))
901 p = cdr (p);
902
903 set_cdr (last, cdr (p));
904 set_cdr (p, newp);
905 }
906 } 959 }
907 960
908 return n; 961 return n;
909} 962}
910 963
… …
917 if (SCHEME_V->no_memory && USE_ERROR_CHECKING) 970 if (SCHEME_V->no_memory && USE_ERROR_CHECKING)
918 return S_SINK; 971 return S_SINK;
919 972
920 if (SCHEME_V->free_cell == NIL) 973 if (SCHEME_V->free_cell == NIL)
921 { 974 {
922 const int min_to_be_recovered = SCHEME_V->last_cell_seg < 128 ? 128 * 8 : SCHEME_V->last_cell_seg * 8; 975 const int min_to_be_recovered = SCHEME_V->cell_segsize [SCHEME_V->last_cell_seg] >> 1;
923 976
924 gc (SCHEME_A_ a, b); 977 gc (SCHEME_A_ a, b);
925 978
926 if (SCHEME_V->fcells < min_to_be_recovered || SCHEME_V->free_cell == NIL) 979 if (SCHEME_V->fcells < min_to_be_recovered || SCHEME_V->free_cell == NIL)
927 { 980 {
… …
978} 1031}
979 1032
980static pointer 1033static pointer
981get_vector_object (SCHEME_P_ uint32_t len, pointer init) 1034get_vector_object (SCHEME_P_ uint32_t len, pointer init)
982{ 1035{
983 pointer v = get_cell_x (SCHEME_A_ 0, 0); 1036 pointer v = get_cell_x (SCHEME_A_ NIL, NIL);
984 pointer *e = malloc (len * sizeof (pointer)); 1037 pointer *e = malloc (len * sizeof (pointer));
985 1038
986 if (!e && USE_ERROR_CHECKING) 1039 if (!e && USE_ERROR_CHECKING)
987 return S_SINK; 1040 return S_SINK;
988 1041
989 /* Record it as a vector so that gc understands it. */ 1042 /* Record it as a vector so that gc understands it. */
990 set_typeflag (v, T_VECTOR | T_ATOM); 1043 set_typeflag (v, T_VECTOR | T_ATOM);
991 1044
992 v->object.vector.vvalue = e; 1045 v->object.vector.vvalue = e;
993 v->object.vector.length = len; 1046 v->object.vector.length = len;
994 fill_vector (v, init); 1047 fill_vector (v, 0, init);
995 push_recent_alloc (SCHEME_A_ v, NIL); 1048 push_recent_alloc (SCHEME_A_ v, NIL);
996 1049
997 return v; 1050 return v;
998} 1051}
999 1052
… …
1042 set_cdr (x, b); 1095 set_cdr (x, b);
1043 1096
1044 return x; 1097 return x;
1045} 1098}
1046 1099
1100static pointer
1101generate_symbol (SCHEME_P_ const char *name)
1102{
1103 pointer x = mk_string (SCHEME_A_ name);
1104 setimmutable (x);
1105 set_typeflag (x, T_SYMBOL | T_ATOM);
1106 return x;
1107}
1108
1047/* ========== oblist implementation ========== */ 1109/* ========== oblist implementation ========== */
1048 1110
1049#ifndef USE_OBJECT_LIST 1111#ifndef USE_OBJECT_LIST
1050 1112
1113static int
1051static int hash_fn (const char *key, int table_size); 1114hash_fn (const char *key, int table_size)
1115{
1116 const unsigned char *p = key;
1117 uint32_t hash = 2166136261;
1118
1119 while (*p)
1120 hash = (hash ^ *p++) * 16777619;
1121
1122 return hash % table_size;
1123}
1052 1124
1053static pointer 1125static pointer
1054oblist_initial_value (SCHEME_P) 1126oblist_initial_value (SCHEME_P)
1055{ 1127{
1056 return mk_vector (SCHEME_A_ 461); /* probably should be bigger */ 1128 return mk_vector (SCHEME_A_ 461); /* probably should be bigger */
… …
1058 1130
1059/* returns the new symbol */ 1131/* returns the new symbol */
1060static pointer 1132static pointer
1061oblist_add_by_name (SCHEME_P_ const char *name) 1133oblist_add_by_name (SCHEME_P_ const char *name)
1062{ 1134{
1063 int location; 1135 pointer x = generate_symbol (SCHEME_A_ name);
1064
1065 pointer x = immutable_cons (mk_string (SCHEME_A_ name), NIL);
1066 set_typeflag (x, T_SYMBOL);
1067 setimmutable (car (x));
1068
1069 location = hash_fn (name, veclength (SCHEME_V->oblist)); 1136 int location = hash_fn (name, veclength (SCHEME_V->oblist));
1070 set_vector_elem (SCHEME_V->oblist, location, immutable_cons (x, vector_elem (SCHEME_V->oblist, location))); 1137 vector_set (SCHEME_V->oblist, location, immutable_cons (x, vector_get (SCHEME_V->oblist, location)));
1071 return x; 1138 return x;
1072} 1139}
1073 1140
1074ecb_inline pointer 1141ecb_inline pointer
1075oblist_find_by_name (SCHEME_P_ const char *name) 1142oblist_find_by_name (SCHEME_P_ const char *name)
… …
1078 pointer x; 1145 pointer x;
1079 char *s; 1146 char *s;
1080 1147
1081 location = hash_fn (name, veclength (SCHEME_V->oblist)); 1148 location = hash_fn (name, veclength (SCHEME_V->oblist));
1082 1149
1083 for (x = vector_elem (SCHEME_V->oblist, location); x != NIL; x = cdr (x)) 1150 for (x = vector_get (SCHEME_V->oblist, location); x != NIL; x = cdr (x))
1084 { 1151 {
1085 s = symname (car (x)); 1152 s = symname (car (x));
1086 1153
1087 /* case-insensitive, per R5RS section 2 */ 1154 /* case-insensitive, per R5RS section 2 */
1088 if (stricmp (name, s) == 0) 1155 if (stricmp (name, s) == 0)
… …
1098 int i; 1165 int i;
1099 pointer x; 1166 pointer x;
1100 pointer ob_list = NIL; 1167 pointer ob_list = NIL;
1101 1168
1102 for (i = 0; i < veclength (SCHEME_V->oblist); i++) 1169 for (i = 0; i < veclength (SCHEME_V->oblist); i++)
1103 for (x = vector_elem (SCHEME_V->oblist, i); x != NIL; x = cdr (x)) 1170 for (x = vector_get (SCHEME_V->oblist, i); x != NIL; x = cdr (x))
1104 ob_list = cons (x, ob_list); 1171 ob_list = cons (x, ob_list);
1105 1172
1106 return ob_list; 1173 return ob_list;
1107} 1174}
1108 1175
… …
1134 1201
1135/* returns the new symbol */ 1202/* returns the new symbol */
1136static pointer 1203static pointer
1137oblist_add_by_name (SCHEME_P_ const char *name) 1204oblist_add_by_name (SCHEME_P_ const char *name)
1138{ 1205{
1139 pointer x; 1206 pointer x = generate_symbol (SCHEME_A_ name);
1140
1141 x = immutable_cons (mk_string (SCHEME_A_ name), NIL);
1142 set_typeflag (x, T_SYMBOL);
1143 setimmutable (car (x));
1144 SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist); 1207 SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist);
1145 return x; 1208 return x;
1146} 1209}
1147 1210
1148static pointer 1211static pointer
… …
1169pointer 1232pointer
1170mk_foreign_func (SCHEME_P_ foreign_func f) 1233mk_foreign_func (SCHEME_P_ foreign_func f)
1171{ 1234{
1172 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1235 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1173 1236
1174 set_typeflag (x, (T_FOREIGN | T_ATOM)); 1237 set_typeflag (x, T_FOREIGN | T_ATOM);
1175 x->object.ff = f; 1238 x->object.ff = f;
1176 1239
1177 return x; 1240 return x;
1178} 1241}
1179 1242
1180INTERFACE pointer 1243INTERFACE pointer
1181mk_character (SCHEME_P_ int c) 1244mk_character (SCHEME_P_ int c)
1182{ 1245{
1183 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1246 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1184 1247
1185 set_typeflag (x, (T_CHARACTER | T_ATOM)); 1248 set_typeflag (x, T_CHARACTER | T_ATOM);
1186 ivalue_unchecked (x) = c & 0xff; 1249 set_ivalue (x, c & 0xff);
1187 set_num_integer (x); 1250
1188 return x; 1251 return x;
1189} 1252}
1190 1253
1191/* get number atom (integer) */ 1254/* get number atom (integer) */
1192INTERFACE pointer 1255INTERFACE pointer
1193mk_integer (SCHEME_P_ long num) 1256mk_integer (SCHEME_P_ long n)
1194{ 1257{
1258 pointer p = 0;
1259 pointer *pp = &p;
1260
1261#if USE_INTCACHE
1262 if (n >= INTCACHE_MIN && n <= INTCACHE_MAX)
1263 pp = &SCHEME_V->intcache[n - INTCACHE_MIN];
1264#endif
1265
1266 if (!*pp)
1267 {
1195 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1268 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1196 1269
1197 set_typeflag (x, (T_NUMBER | T_ATOM)); 1270 set_typeflag (x, T_INTEGER | T_ATOM);
1198 ivalue_unchecked (x) = num; 1271 setimmutable (x); /* shouldn't do anythi9ng, doesn't cost anything */
1199 set_num_integer (x); 1272 set_ivalue (x, n);
1273
1274 *pp = x;
1275 }
1276
1200 return x; 1277 return *pp;
1201} 1278}
1202 1279
1203INTERFACE pointer 1280INTERFACE pointer
1204mk_real (SCHEME_P_ RVALUE n) 1281mk_real (SCHEME_P_ RVALUE n)
1205{ 1282{
1283#if USE_REAL
1206 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1284 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1207 1285
1208 set_typeflag (x, (T_NUMBER | T_ATOM)); 1286 set_typeflag (x, T_REAL | T_ATOM);
1209 rvalue_unchecked (x) = n; 1287 set_rvalue (x, n);
1210 set_num_real (x); 1288
1211 return x; 1289 return x;
1290#else
1291 return mk_integer (SCHEME_A_ n);
1292#endif
1212} 1293}
1213 1294
1214static pointer 1295static pointer
1215mk_number (SCHEME_P_ const num n) 1296mk_number (SCHEME_P_ const num n)
1216{ 1297{
1298#if USE_REAL
1217 if (num_is_fixnum (n)) 1299 return num_is_fixnum (n)
1300 ? mk_integer (SCHEME_A_ num_ivalue (n))
1301 : mk_real (SCHEME_A_ num_rvalue (n));
1302#else
1218 return mk_integer (SCHEME_A_ num_get_ivalue (n)); 1303 return mk_integer (SCHEME_A_ num_ivalue (n));
1219 else 1304#endif
1220 return mk_real (SCHEME_A_ num_get_rvalue (n));
1221} 1305}
1222 1306
1223/* allocate name to string area */ 1307/* allocate name to string area */
1224static char * 1308static char *
1225store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill) 1309store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill)
… …
1231 SCHEME_V->no_memory = 1; 1315 SCHEME_V->no_memory = 1;
1232 return SCHEME_V->strbuff; 1316 return SCHEME_V->strbuff;
1233 } 1317 }
1234 1318
1235 if (str) 1319 if (str)
1236 { 1320 memcpy (q, str , len_str); /* caller must ensure that *str has length len_str */
1237 int l = strlen (str);
1238
1239 if (l > len_str)
1240 l = len_str;
1241
1242 memcpy (q, str, l);
1243 q[l] = 0;
1244 }
1245 else 1321 else
1246 {
1247 memset (q, fill, len_str); 1322 memset (q, fill, len_str);
1323
1248 q[len_str] = 0; 1324 q[len_str] = 0;
1249 }
1250 1325
1251 return q; 1326 return q;
1252} 1327}
1253 1328
1254INTERFACE pointer 1329INTERFACE pointer
… …
1268 pointer x = get_cell (SCHEME_A_ NIL, NIL); 1343 pointer x = get_cell (SCHEME_A_ NIL, NIL);
1269 1344
1270 set_typeflag (x, T_STRING | T_ATOM); 1345 set_typeflag (x, T_STRING | T_ATOM);
1271 strvalue (x) = store_string (SCHEME_A_ len, str, 0); 1346 strvalue (x) = store_string (SCHEME_A_ len, str, 0);
1272 strlength (x) = len; 1347 strlength (x) = len;
1348
1273 return x; 1349 return x;
1274} 1350}
1275 1351
1276INTERFACE pointer 1352INTERFACE pointer
1277mk_string (SCHEME_P_ const char *str) 1353mk_string (SCHEME_P_ const char *str)
… …
1284{ 1360{
1285 return get_vector_object (SCHEME_A_ len, NIL); 1361 return get_vector_object (SCHEME_A_ len, NIL);
1286} 1362}
1287 1363
1288INTERFACE void 1364INTERFACE void
1289fill_vector (pointer vec, pointer obj) 1365fill_vector (pointer vec, uint32_t start, pointer obj)
1290{ 1366{
1291 int i; 1367 int i;
1292 1368
1293 for (i = 0; i < vec->object.vector.length; i++) 1369 for (i = start; i < veclength (vec); i++)
1294 vecvalue (vec)[i] = obj; 1370 vecvalue (vec)[i] = obj;
1295} 1371}
1296 1372
1373INTERFACE void
1374vector_resize (pointer vec, uint32_t newsize, pointer fill)
1375{
1376 uint32_t oldsize = veclength (vec);
1377 vecvalue (vec) = realloc (vecvalue (vec), newsize * sizeof (pointer));
1378 veclength (vec) = newsize;
1379 fill_vector (vec, oldsize, fill);
1380}
1381
1297INTERFACE pointer 1382INTERFACE pointer
1298vector_elem (pointer vec, uint32_t ielem) 1383vector_get (pointer vec, uint32_t ielem)
1299{ 1384{
1300 return vecvalue(vec)[ielem]; 1385 return vecvalue(vec)[ielem];
1301} 1386}
1302 1387
1303INTERFACE void 1388INTERFACE void
1304set_vector_elem (pointer vec, uint32_t ielem, pointer a) 1389vector_set (pointer vec, uint32_t ielem, pointer a)
1305{ 1390{
1306 vecvalue(vec)[ielem] = a; 1391 vecvalue(vec)[ielem] = a;
1307} 1392}
1308 1393
1309/* get new symbol */ 1394/* get new symbol */
… …
1321 1406
1322INTERFACE pointer 1407INTERFACE pointer
1323gensym (SCHEME_P) 1408gensym (SCHEME_P)
1324{ 1409{
1325 pointer x; 1410 pointer x;
1326
1327 for (; SCHEME_V->gensym_cnt < LONG_MAX; SCHEME_V->gensym_cnt++)
1328 {
1329 char name[40] = "gensym-"; 1411 char name[40] = "gensym-";
1330 xnum (name + 7, SCHEME_V->gensym_cnt); 1412 xnum (name + 7, ++SCHEME_V->gensym_cnt);
1331 1413
1332 /* first check oblist */ 1414 return generate_symbol (SCHEME_A_ name);
1333 x = oblist_find_by_name (SCHEME_A_ name); 1415}
1334 1416
1335 if (x == NIL) 1417static int
1336 { 1418is_gensym (SCHEME_P_ pointer x)
1337 x = oblist_add_by_name (SCHEME_A_ name); 1419{
1338 return x; 1420 return is_symbol (x) && oblist_find_by_name (SCHEME_A_ strvalue (x)) != x;
1339 }
1340 }
1341
1342 return NIL;
1343} 1421}
1344 1422
1345/* make symbol or number atom from string */ 1423/* make symbol or number atom from string */
1346static pointer 1424static pointer
1347mk_atom (SCHEME_P_ char *q) 1425mk_atom (SCHEME_P_ char *q)
… …
1401 } 1479 }
1402 else if ((c == 'e') || (c == 'E')) 1480 else if ((c == 'e') || (c == 'E'))
1403 { 1481 {
1404 if (!has_fp_exp) 1482 if (!has_fp_exp)
1405 { 1483 {
1406 has_dec_point = 1; /* decimal point illegal 1484 has_dec_point = 1; /* decimal point illegal from now on */
1407 from now on */
1408 p++; 1485 p++;
1409 1486
1410 if ((*p == '-') || (*p == '+') || isdigit (*p)) 1487 if ((*p == '-') || (*p == '+') || isdigit (*p))
1411 continue; 1488 continue;
1412 } 1489 }
… …
1500 1577
1501 if (ecb_expect_false (is_vector (p))) 1578 if (ecb_expect_false (is_vector (p)))
1502 { 1579 {
1503 int i; 1580 int i;
1504 1581
1505 for (i = 0; i < p->object.vector.length; i++) 1582 for (i = 0; i < veclength (p); i++)
1506 mark (vecvalue (p)[i]); 1583 mark (vecvalue (p)[i]);
1507 } 1584 }
1508 1585
1509 if (is_atom (p)) 1586 if (is_atom (p))
1510 goto E6; 1587 goto E6;
… …
1583 /* Mark recent objects the interpreter doesn't know about yet. */ 1660 /* Mark recent objects the interpreter doesn't know about yet. */
1584 mark (car (S_SINK)); 1661 mark (car (S_SINK));
1585 /* Mark any older stuff above nested C calls */ 1662 /* Mark any older stuff above nested C calls */
1586 mark (SCHEME_V->c_nest); 1663 mark (SCHEME_V->c_nest);
1587 1664
1665#if USE_INTCACHE
1666 /* mark intcache */
1667 for (i = INTCACHE_MIN; i <= INTCACHE_MAX; ++i)
1668 if (SCHEME_V->intcache[i - INTCACHE_MIN])
1669 mark (SCHEME_V->intcache[i - INTCACHE_MIN]);
1670#endif
1671
1588 /* mark variables a, b */ 1672 /* mark variables a, b */
1589 mark (a); 1673 mark (a);
1590 mark (b); 1674 mark (b);
1591 1675
1592 /* garbage collect */ 1676 /* garbage collect */
1593 clrmark (NIL); 1677 clrmark (NIL);
1594 SCHEME_V->fcells = 0; 1678 SCHEME_V->fcells = 0;
1595 SCHEME_V->free_cell = NIL; 1679 SCHEME_V->free_cell = NIL;
1596 1680
1597 /* free-list is kept sorted by address so as to maintain consecutive 1681 if (SCHEME_V->gc_verbose)
1598 ranges, if possible, for use with vectors. Here we scan the cells 1682 xwrstr ("freeing...");
1599 (which are also kept sorted by address) downwards to build the 1683
1600 free-list in sorted order. 1684 uint32_t total = 0;
1601 */ 1685
1686 /* Here we scan the cells to build the free-list. */
1602 for (i = SCHEME_V->last_cell_seg; i >= 0; i--) 1687 for (i = SCHEME_V->last_cell_seg; i >= 0; i--)
1603 { 1688 {
1604 p = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i]; 1689 pointer end = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i];
1690 total += SCHEME_V->cell_segsize [i];
1605 1691
1606 while (--p >= SCHEME_V->cell_seg[i]) 1692 for (p = SCHEME_V->cell_seg[i]; p < end; ++p)
1607 { 1693 {
1608 if (is_mark (p)) 1694 if (is_mark (p))
1609 clrmark (p); 1695 clrmark (p);
1610 else 1696 else
1611 { 1697 {
1612 /* reclaim cell */ 1698 /* reclaim cell */
1613 if (typeflag (p) != T_FREE) 1699 if (typeflag (p) != T_PAIR)
1614 { 1700 {
1615 finalize_cell (SCHEME_A_ p); 1701 finalize_cell (SCHEME_A_ p);
1616 set_typeflag (p, T_FREE); 1702 set_typeflag (p, T_PAIR);
1617 set_car (p, NIL); 1703 set_car (p, NIL);
1618 } 1704 }
1619 1705
1620 ++SCHEME_V->fcells; 1706 ++SCHEME_V->fcells;
1621 set_cdr (p, SCHEME_V->free_cell); 1707 set_cdr (p, SCHEME_V->free_cell);
… …
1623 } 1709 }
1624 } 1710 }
1625 } 1711 }
1626 1712
1627 if (SCHEME_V->gc_verbose) 1713 if (SCHEME_V->gc_verbose)
1714 {
1628 xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" cells were recovered.\n"); 1715 xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" out of "); xwrnum (total); xwrstr (" cells were recovered.\n");
1716 }
1629} 1717}
1630 1718
1631static void 1719static void
1632finalize_cell (SCHEME_P_ pointer a) 1720finalize_cell (SCHEME_P_ pointer a)
1633{ 1721{
1634 /* TODO, fast bitmap check? */ 1722 /* TODO, fast bitmap check? */
1635 if (is_string (a)) 1723 if (is_string (a) || is_symbol (a))
1636 free (strvalue (a)); 1724 free (strvalue (a));
1637 else if (is_vector (a)) 1725 else if (is_vector (a))
1638 free (vecvalue (a)); 1726 free (vecvalue (a));
1639#if USE_PORTS 1727#if USE_PORTS
1640 else if (is_port (a)) 1728 else if (is_port (a))
… …
2062#endif 2150#endif
2063} 2151}
2064 2152
2065/* read characters up to delimiter, but cater to character constants */ 2153/* read characters up to delimiter, but cater to character constants */
2066static char * 2154static char *
2067readstr_upto (SCHEME_P_ char *delim) 2155readstr_upto (SCHEME_P_ int skip, const char *delim)
2068{ 2156{
2069 char *p = SCHEME_V->strbuff; 2157 char *p = SCHEME_V->strbuff + skip;
2070 2158
2071 while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A)))); 2159 while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A))));
2072 2160
2073 if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\') 2161 if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\')
2074 *p = 0; 2162 *p = 0;
… …
2081 return SCHEME_V->strbuff; 2169 return SCHEME_V->strbuff;
2082} 2170}
2083 2171
2084/* read string expression "xxx...xxx" */ 2172/* read string expression "xxx...xxx" */
2085static pointer 2173static pointer
2086readstrexp (SCHEME_P) 2174readstrexp (SCHEME_P_ char delim)
2087{ 2175{
2088 char *p = SCHEME_V->strbuff; 2176 char *p = SCHEME_V->strbuff;
2089 int c; 2177 int c;
2090 int c1 = 0; 2178 int c1 = 0;
2091 enum
2092 { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok; 2179 enum { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok;
2093 2180
2094 for (;;) 2181 for (;;)
2095 { 2182 {
2096 c = inchar (SCHEME_A); 2183 c = inchar (SCHEME_A);
2097 2184
… …
2099 return S_F; 2186 return S_F;
2100 2187
2101 switch (state) 2188 switch (state)
2102 { 2189 {
2103 case st_ok: 2190 case st_ok:
2104 switch (c) 2191 if (ecb_expect_false (c == delim))
2105 {
2106 case '\\':
2107 state = st_bsl;
2108 break;
2109
2110 case '"':
2111 *p = 0;
2112 return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff); 2192 return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff);
2113 2193
2114 default: 2194 if (ecb_expect_false (c == '\\'))
2195 state = st_bsl;
2196 else
2115 *p++ = c; 2197 *p++ = c;
2116 break;
2117 }
2118 2198
2119 break; 2199 break;
2120 2200
2121 case st_bsl: 2201 case st_bsl:
2122 switch (c) 2202 switch (c)
… …
2152 case 'r': 2232 case 'r':
2153 *p++ = '\r'; 2233 *p++ = '\r';
2154 state = st_ok; 2234 state = st_ok;
2155 break; 2235 break;
2156 2236
2157 case '"':
2158 *p++ = '"';
2159 state = st_ok;
2160 break;
2161
2162 default: 2237 default:
2163 *p++ = c; 2238 *p++ = c;
2164 state = st_ok; 2239 state = st_ok;
2165 break; 2240 break;
2166 } 2241 }
2167 2242
2168 break; 2243 break;
2169 2244
2170 case st_x1: 2245 case st_x1:
2171 case st_x2: 2246 case st_x2:
2172 c = toupper (c); 2247 c = tolower (c);
2173 2248
2174 if (c >= '0' && c <= 'F') 2249 if (c >= '0' && c <= '9')
2175 {
2176 if (c <= '9')
2177 c1 = (c1 << 4) + c - '0'; 2250 c1 = (c1 << 4) + c - '0';
2178 else 2251 else if (c >= 'a' && c <= 'f')
2179 c1 = (c1 << 4) + c - 'A' + 10; 2252 c1 = (c1 << 4) + c - 'a' + 10;
2180
2181 if (state == st_x1)
2182 state = st_x2;
2183 else
2184 {
2185 *p++ = c1;
2186 state = st_ok;
2187 }
2188 }
2189 else 2253 else
2190 return S_F; 2254 return S_F;
2255
2256 if (state == st_x1)
2257 state = st_x2;
2258 else
2259 {
2260 *p++ = c1;
2261 state = st_ok;
2262 }
2191 2263
2192 break; 2264 break;
2193 2265
2194 case st_oct1: 2266 case st_oct1:
2195 case st_oct2: 2267 case st_oct2:
… …
2199 backchar (SCHEME_A_ c); 2271 backchar (SCHEME_A_ c);
2200 state = st_ok; 2272 state = st_ok;
2201 } 2273 }
2202 else 2274 else
2203 { 2275 {
2204 if (state == st_oct2 && c1 >= 32) 2276 if (state == st_oct2 && c1 >= ' ')
2205 return S_F; 2277 return S_F;
2206 2278
2207 c1 = (c1 << 3) + (c - '0'); 2279 c1 = (c1 << 3) + (c - '0');
2208 2280
2209 if (state == st_oct1) 2281 if (state == st_oct1)
… …
2214 state = st_ok; 2286 state = st_ok;
2215 } 2287 }
2216 } 2288 }
2217 2289
2218 break; 2290 break;
2219
2220 } 2291 }
2221 } 2292 }
2222} 2293}
2223 2294
2224/* check c is in chars */ 2295/* check c is in chars */
2225ecb_inline int 2296ecb_inline int
2226is_one_of (char *s, int c) 2297is_one_of (const char *s, int c)
2227{ 2298{
2228 if (c == EOF)
2229 return 1;
2230
2231 return !!strchr (s, c); 2299 return c == EOF || !!strchr (s, c);
2232} 2300}
2233 2301
2234/* skip white characters */ 2302/* skip white characters */
2235ecb_inline int 2303ecb_inline int
2236skipspace (SCHEME_P) 2304skipspace (SCHEME_P)
… …
2238 int c, curr_line = 0; 2306 int c, curr_line = 0;
2239 2307
2240 do 2308 do
2241 { 2309 {
2242 c = inchar (SCHEME_A); 2310 c = inchar (SCHEME_A);
2311
2243#if SHOW_ERROR_LINE 2312#if SHOW_ERROR_LINE
2244 if (c == '\n') 2313 if (ecb_expect_false (c == '\n'))
2245 curr_line++; 2314 curr_line++;
2246#endif 2315#endif
2316
2317 if (ecb_expect_false (c == EOF))
2318 return c;
2247 } 2319 }
2248 while (c == ' ' || c == '\n' || c == '\r' || c == '\t'); 2320 while (is_one_of (WHITESPACE, c));
2249 2321
2250 /* record it */ 2322 /* record it */
2251#if SHOW_ERROR_LINE 2323#if SHOW_ERROR_LINE
2252 if (SCHEME_V->load_stack[SCHEME_V->file_i].kind & port_file) 2324 if (SCHEME_V->load_stack[SCHEME_V->file_i].kind & port_file)
2253 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line += curr_line; 2325 SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line += curr_line;
2254#endif 2326#endif
2255 2327
2256 if (c != EOF)
2257 {
2258 backchar (SCHEME_A_ c); 2328 backchar (SCHEME_A_ c);
2259 return 1; 2329 return 1;
2260 }
2261 else
2262 return EOF;
2263} 2330}
2264 2331
2265/* get token */ 2332/* get token */
2266static int 2333static int
2267token (SCHEME_P) 2334token (SCHEME_P)
… …
2283 return TOK_RPAREN; 2350 return TOK_RPAREN;
2284 2351
2285 case '.': 2352 case '.':
2286 c = inchar (SCHEME_A); 2353 c = inchar (SCHEME_A);
2287 2354
2288 if (is_one_of (" \n\t", c)) 2355 if (is_one_of (WHITESPACE, c))
2289 return TOK_DOT; 2356 return TOK_DOT;
2290 else 2357 else
2291 { 2358 {
2292 //TODO: ungetc twice in a row is not supported in C
2293 backchar (SCHEME_A_ c); 2359 backchar (SCHEME_A_ c);
2294 backchar (SCHEME_A_ '.');
2295 return TOK_ATOM; 2360 return TOK_DOTATOM;
2296 } 2361 }
2362
2363 case '|':
2364 return TOK_STRATOM;
2297 2365
2298 case '\'': 2366 case '\'':
2299 return TOK_QUOTE; 2367 return TOK_QUOTE;
2300 2368
2301 case ';': 2369 case ';':
… …
2433 } 2501 }
2434 2502
2435 putcharacter (SCHEME_A_ '"'); 2503 putcharacter (SCHEME_A_ '"');
2436} 2504}
2437 2505
2438
2439/* print atoms */ 2506/* print atoms */
2440static void 2507static void
2441printatom (SCHEME_P_ pointer l, int f) 2508printatom (SCHEME_P_ pointer l, int f)
2442{ 2509{
2443 char *p; 2510 char *p;
2444 int len; 2511 int len;
2445 2512
2446 atom2str (SCHEME_A_ l, f, &p, &len); 2513 atom2str (SCHEME_A_ l, f, &p, &len);
2447 putchars (SCHEME_A_ p, len); 2514 putchars (SCHEME_A_ p, len);
2448} 2515}
2449
2450 2516
2451/* Uses internal buffer unless string pointer is already available */ 2517/* Uses internal buffer unless string pointer is already available */
2452static void 2518static void
2453atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen) 2519atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen)
2454{ 2520{
… …
2615#endif 2681#endif
2616 } 2682 }
2617 else if (is_continuation (l)) 2683 else if (is_continuation (l))
2618 p = "#<CONTINUATION>"; 2684 p = "#<CONTINUATION>";
2619 else 2685 else
2686 {
2687#if USE_PRINTF
2688 p = SCHEME_V->strbuff;
2689 snprintf (p, STRBUFFSIZE, "#<ERROR %x>", (int)typeflag (l));
2690#else
2620 p = "#<ERROR>"; 2691 p = "#<ERROR>";
2692#endif
2693 }
2621 2694
2622 *pp = p; 2695 *pp = p;
2623 *plen = strlen (p); 2696 *plen = strlen (p);
2624} 2697}
2625 2698
… …
2769/* () is #t in R5RS */ 2842/* () is #t in R5RS */
2770#define is_true(p) ((p) != S_F) 2843#define is_true(p) ((p) != S_F)
2771#define is_false(p) ((p) == S_F) 2844#define is_false(p) ((p) == S_F)
2772 2845
2773/* ========== Environment implementation ========== */ 2846/* ========== Environment implementation ========== */
2774
2775#if !defined(USE_ALIST_ENV) || !defined(USE_OBJECT_LIST)
2776
2777static int
2778hash_fn (const char *key, int table_size)
2779{
2780 const unsigned char *p = key;
2781 uint32_t hash = 2166136261;
2782
2783 while (*p)
2784 hash = (hash ^ *p++) * 16777619;
2785
2786 return hash % table_size;
2787}
2788#endif
2789 2847
2790#ifndef USE_ALIST_ENV 2848#ifndef USE_ALIST_ENV
2791 2849
2792/* 2850/*
2793 * In this implementation, each frame of the environment may be 2851 * In this implementation, each frame of the environment may be
… …
2810 2868
2811 SCHEME_V->envir = immutable_cons (new_frame, old_env); 2869 SCHEME_V->envir = immutable_cons (new_frame, old_env);
2812 setenvironment (SCHEME_V->envir); 2870 setenvironment (SCHEME_V->envir);
2813} 2871}
2814 2872
2873static uint32_t
2874sym_hash (pointer sym, uint32_t size)
2875{
2876 uintptr_t ptr = (uintptr_t)sym;
2877
2878#if 0
2879 /* table size is prime, so why mix */
2880 ptr += ptr >> 32;
2881 ptr += ptr >> 16;
2882 ptr += ptr >> 8;
2883#endif
2884
2885 return ptr % size;
2886}
2887
2815ecb_inline void 2888ecb_inline void
2816new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) 2889new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value)
2817{ 2890{
2818 pointer slot = immutable_cons (variable, value); 2891 pointer slot = immutable_cons (variable, value);
2819 2892
2820 if (is_vector (car (env))) 2893 if (is_vector (car (env)))
2821 { 2894 {
2822 int location = hash_fn (symname (variable), veclength (car (env))); 2895 int location = sym_hash (variable, veclength (car (env)));
2823
2824 set_vector_elem (car (env), location, immutable_cons (slot, vector_elem (car (env), location))); 2896 vector_set (car (env), location, immutable_cons (slot, vector_get (car (env), location)));
2825 } 2897 }
2826 else 2898 else
2827 set_car (env, immutable_cons (slot, car (env))); 2899 set_car (env, immutable_cons (slot, car (env)));
2828} 2900}
2829 2901
2830static pointer 2902static pointer
2831find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all) 2903find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all)
2832{ 2904{
2833 pointer x, y; 2905 pointer x, y;
2834 int location;
2835 2906
2836 for (x = env; x != NIL; x = cdr (x)) 2907 for (x = env; x != NIL; x = cdr (x))
2837 { 2908 {
2838 if (is_vector (car (x))) 2909 if (is_vector (car (x)))
2839 { 2910 {
2840 location = hash_fn (symname (hdl), veclength (car (x))); 2911 int location = sym_hash (hdl, veclength (car (x)));
2841 y = vector_elem (car (x), location); 2912 y = vector_get (car (x), location);
2842 } 2913 }
2843 else 2914 else
2844 y = car (x); 2915 y = car (x);
2845 2916
2846 for (; y != NIL; y = cdr (y)) 2917 for (; y != NIL; y = cdr (y))
2847 if (caar (y) == hdl) 2918 if (caar (y) == hdl)
2848 break; 2919 break;
2849 2920
2850 if (y != NIL) 2921 if (y != NIL)
2922 return car (y);
2923
2924 if (!all)
2851 break; 2925 break;
2852
2853 if (!all)
2854 return NIL;
2855 } 2926 }
2856
2857 if (x != NIL)
2858 return car (y);
2859 2927
2860 return NIL; 2928 return NIL;
2861} 2929}
2862 2930
2863#else /* USE_ALIST_ENV */ 2931#else /* USE_ALIST_ENV */
… …
2885 for (y = car (x); y != NIL; y = cdr (y)) 2953 for (y = car (x); y != NIL; y = cdr (y))
2886 if (caar (y) == hdl) 2954 if (caar (y) == hdl)
2887 break; 2955 break;
2888 2956
2889 if (y != NIL) 2957 if (y != NIL)
2958 return car (y);
2890 break; 2959 break;
2891 2960
2892 if (!all) 2961 if (!all)
2893 return NIL; 2962 break;
2894 } 2963 }
2895
2896 if (x != NIL)
2897 return car (y);
2898 2964
2899 return NIL; 2965 return NIL;
2900} 2966}
2901 2967
2902#endif /* USE_ALIST_ENV else */ 2968#endif /* USE_ALIST_ENV else */
2903 2969
2904ecb_inline void 2970ecb_inline void
2905new_slot_in_env (SCHEME_P_ pointer variable, pointer value) 2971new_slot_in_env (SCHEME_P_ pointer variable, pointer value)
2906{ 2972{
2973 assert (is_symbol (variable));//TODO: bug in current-ws/OP_LET2
2907 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value); 2974 new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value);
2908} 2975}
2909 2976
2910ecb_inline void 2977ecb_inline void
2911set_slot_in_env (SCHEME_P_ pointer slot, pointer value) 2978set_slot_in_env (SCHEME_P_ pointer slot, pointer value)
… …
3119 int i = 0; 3186 int i = 0;
3120 struct dump_stack_frame *frame = SCHEME_V->dump_base; 3187 struct dump_stack_frame *frame = SCHEME_V->dump_base;
3121 3188
3122 while (cont != NIL) 3189 while (cont != NIL)
3123 { 3190 {
3124 frame->op = ivalue (car (cont)); cont = cdr (cont); 3191 frame->op = ivalue_unchecked (car (cont)); cont = cdr (cont);
3125 frame->args = car (cont) ; cont = cdr (cont); 3192 frame->args = car (cont) ; cont = cdr (cont);
3126 frame->envir = car (cont) ; cont = cdr (cont); 3193 frame->envir = car (cont) ; cont = cdr (cont);
3127 frame->code = car (cont) ; cont = cdr (cont); 3194 frame->code = car (cont) ; cont = cdr (cont);
3128 3195
3129 ++frame; 3196 ++frame;
3130 ++i; 3197 ++i;
3131 } 3198 }
3132 3199
… …
3161 SCHEME_V->value = a; 3228 SCHEME_V->value = a;
3162 3229
3163 if (dump == NIL) 3230 if (dump == NIL)
3164 return -1; 3231 return -1;
3165 3232
3166 SCHEME_V->op = ivalue (car (dump)); dump = cdr (dump); 3233 SCHEME_V->op = ivalue_unchecked (car (dump)); dump = cdr (dump);
3167 SCHEME_V->args = car (dump) ; dump = cdr (dump); 3234 SCHEME_V->args = car (dump) ; dump = cdr (dump);
3168 SCHEME_V->envir = car (dump) ; dump = cdr (dump); 3235 SCHEME_V->envir = car (dump) ; dump = cdr (dump);
3169 SCHEME_V->code = car (dump) ; dump = cdr (dump); 3236 SCHEME_V->code = car (dump) ; dump = cdr (dump);
3170 3237
3171 SCHEME_V->dump = dump; 3238 SCHEME_V->dump = dump;
3172 3239
3173 return 0; 3240 return 0;
3174} 3241}
… …
3203 3270
3204#endif 3271#endif
3205 3272
3206#define s_retbool(tf) s_return ((tf) ? S_T : S_F) 3273#define s_retbool(tf) s_return ((tf) ? S_T : S_F)
3207 3274
3275#if EXPERIMENT
3276static int
3277debug (SCHEME_P_ int indent, pointer x)
3278{
3279 int c;
3280
3281 if (is_syntax (x))
3282 {
3283 printf ("%*ssyntax<%s,%d>\n", indent, "", syntaxname(x),syntaxnum(x));
3284 return 8 + 8;
3285 }
3286
3287 if (x == NIL)
3288 {
3289 printf ("%*sNIL\n", indent, "");
3290 return 3;
3291 }
3292
3293 switch (type (x))
3294 {
3295 case T_INTEGER:
3296 printf ("%*sI<%d>%p\n", indent, "", (int)ivalue_unchecked (x), x);
3297 return 32+8;
3298
3299 case T_SYMBOL:
3300 printf ("%*sS<%s>\n", indent, "", symname (x));
3301 return 24+8;
3302
3303 case T_CLOSURE:
3304 printf ("%*sS<%s>\n", indent, "", "closure");
3305 debug (SCHEME_A_ indent + 3, cdr(x));
3306 return 32 + debug (SCHEME_A_ indent + 3, car (x));
3307
3308 case T_PAIR:
3309 printf ("%*spair %p %p\n", indent, "", car(x),cdr(x));
3310 c = debug (SCHEME_A_ indent + 3, car (x));
3311 c += debug (SCHEME_A_ indent + 3, cdr (x));
3312 return c + 1;
3313
3314 case T_PORT:
3315 printf ("%*sS<%s>\n", indent, "", "port");
3316 return 24+8;
3317
3318 case T_VECTOR:
3319 printf ("%*sS<%s>\n", indent, "", "vector");
3320 return 24+8;
3321
3322 case T_ENVIRONMENT:
3323 printf ("%*sS<%s>\n", indent, "", "environment");
3324 return 0 + debug (SCHEME_A_ indent + 3, car (x));
3325
3326 default:
3327 printf ("unhandled type %d\n", type (x));
3328 break;
3329 }
3330}
3331#endif
3332
3208static int 3333static int
3209opexe_0 (SCHEME_P_ enum scheme_opcodes op) 3334opexe_0 (SCHEME_P_ enum scheme_opcodes op)
3210{ 3335{
3211 pointer args = SCHEME_V->args; 3336 pointer args = SCHEME_V->args;
3212 pointer x, y; 3337 pointer x, y;
3213 3338
3214 switch (op) 3339 switch (op)
3215 { 3340 {
3341#if EXPERIMENT //D
3342 case OP_DEBUG:
3343 printf ("len = %d\n", debug (SCHEME_A_ 0, args) / 8);
3344 printf ("\n");
3345 s_return (S_T);
3346#endif
3216 case OP_LOAD: /* load */ 3347 case OP_LOAD: /* load */
3217 if (file_interactive (SCHEME_A)) 3348 if (file_interactive (SCHEME_A))
3218 { 3349 {
3219 xwrstr ("Loading "); xwrstr (strvalue (car (args))); xwrstr ("\n"); 3350 xwrstr ("Loading "); xwrstr (strvalue (car (args))); xwrstr ("\n");
3220 //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args))); 3351 //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args)));
… …
3343 } 3474 }
3344 else 3475 else
3345 s_return (SCHEME_V->code); 3476 s_return (SCHEME_V->code);
3346 3477
3347 case OP_E0ARGS: /* eval arguments */ 3478 case OP_E0ARGS: /* eval arguments */
3348 if (is_macro (SCHEME_V->value)) /* macro expansion */ 3479 if (ecb_expect_false (is_macro (SCHEME_V->value))) /* macro expansion */
3349 { 3480 {
3350 s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL); 3481 s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL);
3351 SCHEME_V->args = cons (SCHEME_V->code, NIL); 3482 SCHEME_V->args = cons (SCHEME_V->code, NIL);
3352 SCHEME_V->code = SCHEME_V->value; 3483 SCHEME_V->code = SCHEME_V->value;
3353 s_goto (OP_APPLY); 3484 s_goto (OP_APPLY);
… …
3380 3511
3381 case OP_TRACING: 3512 case OP_TRACING:
3382 { 3513 {
3383 int tr = SCHEME_V->tracing; 3514 int tr = SCHEME_V->tracing;
3384 3515
3385 SCHEME_V->tracing = ivalue (car (args)); 3516 SCHEME_V->tracing = ivalue_unchecked (car (args));
3386 s_return (mk_integer (SCHEME_A_ tr)); 3517 s_return (mk_integer (SCHEME_A_ tr));
3387 } 3518 }
3388 3519
3389#endif 3520#endif
3390 3521
… …
3454 3585
3455 case OP_DOMACRO: /* do macro */ 3586 case OP_DOMACRO: /* do macro */
3456 SCHEME_V->code = SCHEME_V->value; 3587 SCHEME_V->code = SCHEME_V->value;
3457 s_goto (OP_EVAL); 3588 s_goto (OP_EVAL);
3458 3589
3459#if 1
3460
3461 case OP_LAMBDA: /* lambda */ 3590 case OP_LAMBDA: /* lambda */
3462 /* If the hook is defined, apply it to SCHEME_V->code, otherwise 3591 /* If the hook is defined, apply it to SCHEME_V->code, otherwise
3463 set SCHEME_V->value fall thru */ 3592 set SCHEME_V->value fall thru */
3464 { 3593 {
3465 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1); 3594 pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1);
… …
3471 SCHEME_V->code = slot_value_in_env (f); 3600 SCHEME_V->code = slot_value_in_env (f);
3472 s_goto (OP_APPLY); 3601 s_goto (OP_APPLY);
3473 } 3602 }
3474 3603
3475 SCHEME_V->value = SCHEME_V->code; 3604 SCHEME_V->value = SCHEME_V->code;
3476 /* Fallthru */
3477 } 3605 }
3606 /* Fallthru */
3478 3607
3479 case OP_LAMBDA1: 3608 case OP_LAMBDA1:
3480 s_return (mk_closure (SCHEME_A_ SCHEME_V->value, SCHEME_V->envir)); 3609 s_return (mk_closure (SCHEME_A_ SCHEME_V->value, SCHEME_V->envir));
3481
3482#else
3483
3484 case OP_LAMBDA: /* lambda */
3485 s_return (mk_closure (SCHEME_A_ SCHEME_V->code, SCHEME_V->envir));
3486
3487#endif
3488 3610
3489 case OP_MKCLOSURE: /* make-closure */ 3611 case OP_MKCLOSURE: /* make-closure */
3490 x = car (args); 3612 x = car (args);
3491 3613
3492 if (car (x) == SCHEME_V->LAMBDA) 3614 if (car (x) == SCHEME_V->LAMBDA)
… …
3909{ 4031{
3910 pointer args = SCHEME_V->args; 4032 pointer args = SCHEME_V->args;
3911 pointer x = car (args); 4033 pointer x = car (args);
3912 num v; 4034 num v;
3913 4035
3914#if USE_MATH
3915 RVALUE dd;
3916#endif
3917
3918 switch (op) 4036 switch (op)
3919 { 4037 {
3920#if USE_MATH 4038#if USE_MATH
3921 case OP_INEX2EX: /* inexact->exact */ 4039 case OP_INEX2EX: /* inexact->exact */
4040 {
3922 if (is_integer (x)) 4041 if (is_integer (x))
3923 s_return (x); 4042 s_return (x);
3924 else if (modf (rvalue_unchecked (x), &dd) == 0) 4043
4044 RVALUE r = rvalue_unchecked (x);
4045
4046 if (r == (RVALUE)(IVALUE)r)
3925 s_return (mk_integer (SCHEME_A_ ivalue (x))); 4047 s_return (mk_integer (SCHEME_A_ rvalue_unchecked (x)));
3926 else 4048 else
3927 Error_1 ("inexact->exact: not integral:", x); 4049 Error_1 ("inexact->exact: not integral:", x);
4050 }
3928 4051
3929 case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x)))); 4052 case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x))));
3930 case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x)))); 4053 case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x))));
3931 case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x)))); 4054 case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x))));
3932 case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x)))); 4055 case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x))));
… …
3966 /* If the test fails, result is too big for integer. */ 4089 /* If the test fails, result is too big for integer. */
3967 if (!real_result) 4090 if (!real_result)
3968 { 4091 {
3969 long result_as_long = result; 4092 long result_as_long = result;
3970 4093
3971 if (result != (RVALUE) result_as_long) 4094 if (result != result_as_long)
3972 real_result = 1; 4095 real_result = 1;
3973 } 4096 }
3974 4097
3975 if (real_result) 4098 if (real_result)
3976 s_return (mk_real (SCHEME_A_ result)); 4099 s_return (mk_real (SCHEME_A_ result));
… …
3981 case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x)))); 4104 case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x))));
3982 case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x)))); 4105 case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x))));
3983 4106
3984 case OP_TRUNCATE: 4107 case OP_TRUNCATE:
3985 { 4108 {
3986 RVALUE rvalue_of_x; 4109 RVALUE n = rvalue (x);
3987
3988 rvalue_of_x = rvalue (x);
3989
3990 if (rvalue_of_x > 0)
3991 s_return (mk_real (SCHEME_A_ floor (rvalue_of_x))); 4110 s_return (mk_real (SCHEME_A_ n > 0 ? floor (n) : ceil (n)));
3992 else
3993 s_return (mk_real (SCHEME_A_ ceil (rvalue_of_x)));
3994 } 4111 }
3995 4112
3996 case OP_ROUND: 4113 case OP_ROUND:
3997 if (num_is_integer (x)) 4114 if (is_integer (x))
3998 s_return (x); 4115 s_return (x);
3999 4116
4000 s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x)))); 4117 s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x))));
4001#endif 4118#endif
4002 4119
… …
4093 else 4210 else
4094 Error_0 ("modulo: division by zero"); 4211 Error_0 ("modulo: division by zero");
4095 4212
4096 s_return (mk_number (SCHEME_A_ v)); 4213 s_return (mk_number (SCHEME_A_ v));
4097 4214
4098 case OP_CAR: /* car */ 4215 /* the compiler will optimize this mess... */
4099 s_return (caar (args)); 4216 case OP_CAR: op_car: s_return (car (x));
4100 4217 case OP_CDR: op_cdr: s_return (cdr (x));
4101 case OP_CDR: /* cdr */ 4218 case OP_CAAR: op_caar: x = car (x); goto op_car;
4102 s_return (cdar (args)); 4219 case OP_CADR: op_cadr: x = cdr (x); goto op_car;
4220 case OP_CDAR: op_cdar: x = car (x); goto op_cdr;
4221 case OP_CDDR: op_cddr: x = cdr (x); goto op_cdr;
4222 case OP_CAAAR: op_caaar: x = car (x); goto op_caar;
4223 case OP_CAADR: op_caadr: x = cdr (x); goto op_caar;
4224 case OP_CADAR: op_cadar: x = car (x); goto op_cadr;
4225 case OP_CADDR: op_caddr: x = cdr (x); goto op_cadr;
4226 case OP_CDAAR: op_cdaar: x = car (x); goto op_cdar;
4227 case OP_CDADR: op_cdadr: x = cdr (x); goto op_cdar;
4228 case OP_CDDAR: op_cddar: x = car (x); goto op_cddr;
4229 case OP_CDDDR: op_cdddr: x = cdr (x); goto op_cddr;
4230 case OP_CAAAAR: x = car (x); goto op_caaar;
4231 case OP_CAAADR: x = cdr (x); goto op_caaar;
4232 case OP_CAADAR: x = car (x); goto op_caadr;
4233 case OP_CAADDR: x = cdr (x); goto op_caadr;
4234 case OP_CADAAR: x = car (x); goto op_cadar;
4235 case OP_CADADR: x = cdr (x); goto op_cadar;
4236 case OP_CADDAR: x = car (x); goto op_caddr;
4237 case OP_CADDDR: x = cdr (x); goto op_caddr;
4238 case OP_CDAAAR: x = car (x); goto op_cdaar;
4239 case OP_CDAADR: x = cdr (x); goto op_cdaar;
4240 case OP_CDADAR: x = car (x); goto op_cdadr;
4241 case OP_CDADDR: x = cdr (x); goto op_cdadr;
4242 case OP_CDDAAR: x = car (x); goto op_cddar;
4243 case OP_CDDADR: x = cdr (x); goto op_cddar;
4244 case OP_CDDDAR: x = car (x); goto op_cdddr;
4245 case OP_CDDDDR: x = cdr (x); goto op_cdddr;
4103 4246
4104 case OP_CONS: /* cons */ 4247 case OP_CONS: /* cons */
4105 set_cdr (args, cadr (args)); 4248 set_cdr (args, cadr (args));
4106 s_return (args); 4249 s_return (args);
4107 4250
… …
4122 } 4265 }
4123 else 4266 else
4124 Error_0 ("set-cdr!: unable to alter immutable pair"); 4267 Error_0 ("set-cdr!: unable to alter immutable pair");
4125 4268
4126 case OP_CHAR2INT: /* char->integer */ 4269 case OP_CHAR2INT: /* char->integer */
4127 s_return (mk_integer (SCHEME_A_ ivalue (x))); 4270 s_return (mk_integer (SCHEME_A_ ivalue_unchecked (x)));
4128 4271
4129 case OP_INT2CHAR: /* integer->char */ 4272 case OP_INT2CHAR: /* integer->char */
4130 s_return (mk_character (SCHEME_A_ ivalue (x))); 4273 s_return (mk_character (SCHEME_A_ ivalue_unchecked (x)));
4131 4274
4132 case OP_CHARUPCASE: 4275 case OP_CHARUPCASE:
4133 { 4276 {
4134 unsigned char c = ivalue (x); 4277 unsigned char c = ivalue_unchecked (x);
4135 c = toupper (c); 4278 c = toupper (c);
4136 s_return (mk_character (SCHEME_A_ c)); 4279 s_return (mk_character (SCHEME_A_ c));
4137 } 4280 }
4138 4281
4139 case OP_CHARDNCASE: 4282 case OP_CHARDNCASE:
4140 { 4283 {
4141 unsigned char c = ivalue (x); 4284 unsigned char c = ivalue_unchecked (x);
4142 c = tolower (c); 4285 c = tolower (c);
4143 s_return (mk_character (SCHEME_A_ c)); 4286 s_return (mk_character (SCHEME_A_ c));
4144 } 4287 }
4145 4288
4146 case OP_STR2SYM: /* string->symbol */ 4289 case OP_STR2SYM: /* string->symbol */
… …
4223 Error_1 ("atom->string: not an atom:", x); 4366 Error_1 ("atom->string: not an atom:", x);
4224 } 4367 }
4225 4368
4226 case OP_MKSTRING: /* make-string */ 4369 case OP_MKSTRING: /* make-string */
4227 { 4370 {
4228 int fill = ' '; 4371 int fill = cdr (args) != NIL ? charvalue (cadr (args)) : ' ';
4229 int len;
4230
4231 len = ivalue (x); 4372 int len = ivalue_unchecked (x);
4232
4233 if (cdr (args) != NIL)
4234 fill = charvalue (cadr (args));
4235 4373
4236 s_return (mk_empty_string (SCHEME_A_ len, fill)); 4374 s_return (mk_empty_string (SCHEME_A_ len, fill));
4237 } 4375 }
4238 4376
4239 case OP_STRLEN: /* string-length */ 4377 case OP_STRLEN: /* string-length */
4240 s_return (mk_integer (SCHEME_A_ strlength (x))); 4378 s_return (mk_integer (SCHEME_A_ strlength (x)));
4241 4379
4242 case OP_STRREF: /* string-ref */ 4380 case OP_STRREF: /* string-ref */
4243 { 4381 {
4244 char *str;
4245 int index;
4246
4247 str = strvalue (x); 4382 char *str = strvalue (x);
4248
4249 index = ivalue (cadr (args)); 4383 int index = ivalue_unchecked (cadr (args));
4250 4384
4251 if (index >= strlength (x)) 4385 if (index >= strlength (x))
4252 Error_1 ("string-ref: out of bounds:", cadr (args)); 4386 Error_1 ("string-ref: out of bounds:", cadr (args));
4253 4387
4254 s_return (mk_character (SCHEME_A_ ((unsigned char *)str)[index])); 4388 s_return (mk_character (SCHEME_A_ ((unsigned char *)str)[index]));
4255 } 4389 }
4256 4390
4257 case OP_STRSET: /* string-set! */ 4391 case OP_STRSET: /* string-set! */
4258 { 4392 {
4259 char *str; 4393 char *str = strvalue (x);
4260 int index; 4394 int index = ivalue_unchecked (cadr (args));
4261 int c; 4395 int c;
4262 4396
4263 if (is_immutable (x)) 4397 if (is_immutable (x))
4264 Error_1 ("string-set!: unable to alter immutable string:", x); 4398 Error_1 ("string-set!: unable to alter immutable string:", x);
4265
4266 str = strvalue (x);
4267
4268 index = ivalue (cadr (args));
4269 4399
4270 if (index >= strlength (x)) 4400 if (index >= strlength (x))
4271 Error_1 ("string-set!: out of bounds:", cadr (args)); 4401 Error_1 ("string-set!: out of bounds:", cadr (args));
4272 4402
4273 c = charvalue (caddr (args)); 4403 c = charvalue (caddr (args));
… …
4296 s_return (newstr); 4426 s_return (newstr);
4297 } 4427 }
4298 4428
4299 case OP_SUBSTR: /* substring */ 4429 case OP_SUBSTR: /* substring */
4300 { 4430 {
4301 char *str; 4431 char *str = strvalue (x);
4302 int index0; 4432 int index0 = ivalue_unchecked (cadr (args));
4303 int index1; 4433 int index1;
4304 int len; 4434 int len;
4305 4435
4306 str = strvalue (x);
4307
4308 index0 = ivalue (cadr (args));
4309
4310 if (index0 > strlength (x)) 4436 if (index0 > strlength (x))
4311 Error_1 ("substring: start out of bounds:", cadr (args)); 4437 Error_1 ("substring: start out of bounds:", cadr (args));
4312 4438
4313 if (cddr (args) != NIL) 4439 if (cddr (args) != NIL)
4314 { 4440 {
4315 index1 = ivalue (caddr (args)); 4441 index1 = ivalue_unchecked (caddr (args));
4316 4442
4317 if (index1 > strlength (x) || index1 < index0) 4443 if (index1 > strlength (x) || index1 < index0)
4318 Error_1 ("substring: end out of bounds:", caddr (args)); 4444 Error_1 ("substring: end out of bounds:", caddr (args));
4319 } 4445 }
4320 else 4446 else
… …
4343 if (SCHEME_V->no_memory) 4469 if (SCHEME_V->no_memory)
4344 s_return (S_SINK); 4470 s_return (S_SINK);
4345#endif 4471#endif
4346 4472
4347 for (x = args, i = 0; is_pair (x); x = cdr (x), i++) 4473 for (x = args, i = 0; is_pair (x); x = cdr (x), i++)
4348 set_vector_elem (vec, i, car (x)); 4474 vector_set (vec, i, car (x));
4349 4475
4350 s_return (vec); 4476 s_return (vec);
4351 } 4477 }
4352 4478
4353 case OP_MKVECTOR: /* make-vector */ 4479 case OP_MKVECTOR: /* make-vector */
4354 { 4480 {
4355 pointer fill = NIL; 4481 pointer fill = NIL;
4356 int len;
4357 pointer vec; 4482 pointer vec;
4358
4359 len = ivalue (x); 4483 int len = ivalue_unchecked (x);
4360 4484
4361 if (cdr (args) != NIL) 4485 if (cdr (args) != NIL)
4362 fill = cadr (args); 4486 fill = cadr (args);
4363 4487
4364 vec = mk_vector (SCHEME_A_ len); 4488 vec = mk_vector (SCHEME_A_ len);
… …
4367 if (SCHEME_V->no_memory) 4491 if (SCHEME_V->no_memory)
4368 s_return (S_SINK); 4492 s_return (S_SINK);
4369#endif 4493#endif
4370 4494
4371 if (fill != NIL) 4495 if (fill != NIL)
4372 fill_vector (vec, fill); 4496 fill_vector (vec, 0, fill);
4373 4497
4374 s_return (vec); 4498 s_return (vec);
4375 } 4499 }
4376 4500
4377 case OP_VECLEN: /* vector-length */ 4501 case OP_VECLEN: /* vector-length */
4378 s_return (mk_integer (SCHEME_A_ veclength (x))); 4502 s_return (mk_integer (SCHEME_A_ veclength (x)));
4379 4503
4504 case OP_VECRESIZE:
4505 vector_resize (x, ivalue_unchecked (cadr (args)), caddr (args));
4506 s_return (x);
4507
4380 case OP_VECREF: /* vector-ref */ 4508 case OP_VECREF: /* vector-ref */
4381 { 4509 {
4382 int index;
4383
4384 index = ivalue (cadr (args)); 4510 int index = ivalue_unchecked (cadr (args));
4385 4511
4386 if (index >= veclength (car (args)) && USE_ERROR_CHECKING) 4512 if (index >= veclength (car (args)) && USE_ERROR_CHECKING)
4387 Error_1 ("vector-ref: out of bounds:", cadr (args)); 4513 Error_1 ("vector-ref: out of bounds:", cadr (args));
4388 4514
4389 s_return (vector_elem (x, index)); 4515 s_return (vector_get (x, index));
4390 } 4516 }
4391 4517
4392 case OP_VECSET: /* vector-set! */ 4518 case OP_VECSET: /* vector-set! */
4393 { 4519 {
4394 int index; 4520 int index = ivalue_unchecked (cadr (args));
4395 4521
4396 if (is_immutable (x)) 4522 if (is_immutable (x))
4397 Error_1 ("vector-set!: unable to alter immutable vector:", x); 4523 Error_1 ("vector-set!: unable to alter immutable vector:", x);
4398 4524
4399 index = ivalue (cadr (args));
4400
4401 if (index >= veclength (car (args)) && USE_ERROR_CHECKING) 4525 if (index >= veclength (car (args)) && USE_ERROR_CHECKING)
4402 Error_1 ("vector-set!: out of bounds:", cadr (args)); 4526 Error_1 ("vector-set!: out of bounds:", cadr (args));
4403 4527
4404 set_vector_elem (x, index, caddr (args)); 4528 vector_set (x, index, caddr (args));
4405 s_return (x); 4529 s_return (x);
4406 } 4530 }
4407 } 4531 }
4408 4532
4409 if (USE_ERROR_CHECKING) abort (); 4533 if (USE_ERROR_CHECKING) abort ();
4410}
4411
4412INTERFACE int
4413is_list (SCHEME_P_ pointer a)
4414{
4415 return list_length (SCHEME_A_ a) >= 0;
4416}
4417
4418/* Result is:
4419 proper list: length
4420 circular list: -1
4421 not even a pair: -2
4422 dotted list: -2 minus length before dot
4423*/
4424INTERFACE int
4425list_length (SCHEME_P_ pointer a)
4426{
4427 int i = 0;
4428 pointer slow, fast;
4429
4430 slow = fast = a;
4431
4432 while (1)
4433 {
4434 if (fast == NIL)
4435 return i;
4436
4437 if (!is_pair (fast))
4438 return -2 - i;
4439
4440 fast = cdr (fast);
4441 ++i;
4442
4443 if (fast == NIL)
4444 return i;
4445
4446 if (!is_pair (fast))
4447 return -2 - i;
4448
4449 ++i;
4450 fast = cdr (fast);
4451
4452 /* Safe because we would have already returned if `fast'
4453 encountered a non-pair. */
4454 slow = cdr (slow);
4455
4456 if (fast == slow)
4457 {
4458 /* the fast pointer has looped back around and caught up
4459 with the slow pointer, hence the structure is circular,
4460 not of finite length, and therefore not a list */
4461 return -1;
4462 }
4463 }
4464} 4534}
4465 4535
4466static int 4536static int
4467opexe_2 (SCHEME_P_ enum scheme_opcodes op) 4537opexe_2 (SCHEME_P_ enum scheme_opcodes op)
4468{ 4538{
… …
4502 pointer d = cdr (args); 4572 pointer d = cdr (args);
4503 int r; 4573 int r;
4504 4574
4505 switch (op) 4575 switch (op)
4506 { 4576 {
4507 case OP_NOT: /* not */ r = is_false (a) ; break; 4577 case OP_NOT: /* not */ r = is_false (a) ; break;
4508 case OP_BOOLP: /* boolean? */ r = a == S_F || a == S_T; break; 4578 case OP_BOOLP: /* boolean? */ r = a == S_F || a == S_T ; break;
4509 case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break; 4579 case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break;
4510 case OP_NULLP: /* null? */ r = a == NIL ; break; 4580 case OP_NULLP: /* null? */ r = a == NIL ; break;
4511 case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break; 4581 case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break;
4582 case OP_GENSYMP: /* gensym? */ r = is_gensym (SCHEME_A_ a); break;
4512 case OP_NUMBERP: /* number? */ r = is_number (a) ; break; 4583 case OP_NUMBERP: /* number? */ r = is_number (a) ; break;
4513 case OP_STRINGP: /* string? */ r = is_string (a) ; break; 4584 case OP_STRINGP: /* string? */ r = is_string (a) ; break;
4514 case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break; 4585 case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break;
4515 case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */ 4586 case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */
4516 case OP_CHARP: /* char? */ r = is_character (a) ; break; 4587 case OP_CHARP: /* char? */ r = is_character (a) ; break;
4517 4588
4518#if USE_CHAR_CLASSIFIERS 4589#if USE_CHAR_CLASSIFIERS
4519 case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue (a)); break; 4590 case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue_unchecked (a)); break;
4520 case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue (a)); break; 4591 case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue_unchecked (a)); break;
4521 case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue (a)); break; 4592 case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue_unchecked (a)); break;
4522 case OP_CHARUP: /* char-upper-case? */ r = Cisupper (ivalue (a)); break; 4593 case OP_CHARUP: /* char-upper-case? */ r = Cisupper (ivalue_unchecked (a)); break;
4523 case OP_CHARLP: /* char-lower-case? */ r = Cislower (ivalue (a)); break; 4594 case OP_CHARLP: /* char-lower-case? */ r = Cislower (ivalue_unchecked (a)); break;
4524#endif 4595#endif
4525 4596
4526#if USE_PORTS 4597#if USE_PORTS
4527 case OP_PORTP: /* port? */ r = is_port (a) ; break; 4598 case OP_PORTP: /* port? */ r = is_port (a) ; break;
4528 case OP_INPORTP: /* input-port? */ r = is_inport (a) ; break; 4599 case OP_INPORTP: /* input-port? */ r = is_inport (a) ; break;
… …
4729 4800
4730 case OP_NEWSEGMENT: /* new-segment */ 4801 case OP_NEWSEGMENT: /* new-segment */
4731 if (!is_pair (args) || !is_number (a)) 4802 if (!is_pair (args) || !is_number (a))
4732 Error_0 ("new-segment: argument must be a number"); 4803 Error_0 ("new-segment: argument must be a number");
4733 4804
4734 alloc_cellseg (SCHEME_A_ (int)ivalue (a)); 4805 alloc_cellseg (SCHEME_A_ ivalue (a));
4735 4806
4736 s_return (S_T); 4807 s_return (S_T);
4737 4808
4738 case OP_OBLIST: /* oblist */ 4809 case OP_OBLIST: /* oblist */
4739 s_return (oblist_all_symbols (SCHEME_A)); 4810 s_return (oblist_all_symbols (SCHEME_A));
… …
4997 s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL); 5068 s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL);
4998 SCHEME_V->tok = token (SCHEME_A); 5069 SCHEME_V->tok = token (SCHEME_A);
4999 s_goto (OP_RDSEXPR); 5070 s_goto (OP_RDSEXPR);
5000 5071
5001 case TOK_ATOM: 5072 case TOK_ATOM:
5002 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))); 5073 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS)));
5074
5075 case TOK_DOTATOM:
5076 SCHEME_V->strbuff[0] = '.';
5077 s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 1, DELIMITERS)));
5078
5079 case TOK_STRATOM:
5080 x = readstrexp (SCHEME_A_ '|');
5081 //TODO: haven't checked whether the garbage collector could interfere
5082 s_return (mk_atom (SCHEME_A_ strvalue (x)));
5003 5083
5004 case TOK_DQUOTE: 5084 case TOK_DQUOTE:
5005 x = readstrexp (SCHEME_A); 5085 x = readstrexp (SCHEME_A_ '"');
5006 5086
5007 if (x == S_F) 5087 if (x == S_F)
5008 Error_0 ("Error reading string"); 5088 Error_0 ("Error reading string");
5009 5089
5010 setimmutable (x); 5090 setimmutable (x);
… …
5022 s_goto (OP_EVAL); 5102 s_goto (OP_EVAL);
5023 } 5103 }
5024 } 5104 }
5025 5105
5026 case TOK_SHARP_CONST: 5106 case TOK_SHARP_CONST:
5027 if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))) == NIL) 5107 if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS))) == NIL)
5028 Error_0 ("undefined sharp expression"); 5108 Error_0 ("undefined sharp expression");
5029 else 5109 else
5030 s_return (x); 5110 s_return (x);
5031 5111
5032 default: 5112 default:
… …
5184 putstr (SCHEME_A_ ")"); 5264 putstr (SCHEME_A_ ")");
5185 s_return (S_T); 5265 s_return (S_T);
5186 } 5266 }
5187 else 5267 else
5188 { 5268 {
5189 pointer elem = vector_elem (vec, i); 5269 pointer elem = vector_get (vec, i);
5190 5270
5191 ivalue_unchecked (cdr (args)) = i + 1; 5271 ivalue_unchecked (cdr (args)) = i + 1;
5192 s_save (SCHEME_A_ OP_PVECFROM, args, NIL); 5272 s_save (SCHEME_A_ OP_PVECFROM, args, NIL);
5193 SCHEME_V->args = elem; 5273 SCHEME_V->args = elem;
5194 5274
… …
5254 5334
5255 case OP_CLOSUREP: /* closure? */ 5335 case OP_CLOSUREP: /* closure? */
5256 /* 5336 /*
5257 * Note, macro object is also a closure. 5337 * Note, macro object is also a closure.
5258 * Therefore, (closure? <#MACRO>) ==> #t 5338 * Therefore, (closure? <#MACRO>) ==> #t
5339 * (schmorp) well, obviously not, fix? TODO
5259 */ 5340 */
5260 s_retbool (is_closure (a)); 5341 s_retbool (is_closure (a));
5261 5342
5262 case OP_MACROP: /* macro? */ 5343 case OP_MACROP: /* macro? */
5263 s_retbool (is_macro (a)); 5344 s_retbool (is_macro (a));
… …
5269/* dispatch functions (opexe_x) return new opcode, or 0 for same opcode, or -1 to stop */ 5350/* dispatch functions (opexe_x) return new opcode, or 0 for same opcode, or -1 to stop */
5270typedef int (*dispatch_func)(SCHEME_P_ enum scheme_opcodes); 5351typedef int (*dispatch_func)(SCHEME_P_ enum scheme_opcodes);
5271 5352
5272typedef int (*test_predicate)(pointer); 5353typedef int (*test_predicate)(pointer);
5273static int 5354static int
5274is_any (pointer p) 5355tst_any (pointer p)
5275{ 5356{
5276 return 1; 5357 return 1;
5277} 5358}
5278 5359
5279static int 5360static int
5280is_nonneg (pointer p) 5361tst_inonneg (pointer p)
5281{ 5362{
5282 return ivalue (p) >= 0 && is_integer (p); 5363 return is_integer (p) && ivalue_unchecked (p) >= 0;
5283} 5364}
5284 5365
5285static int 5366static int
5286tst_is_list (pointer p) 5367tst_is_list (SCHEME_P_ pointer p)
5287{ 5368{
5288 return p == NIL || is_pair (p); 5369 return p == NIL || is_pair (p);
5289} 5370}
5290 5371
5291/* Correspond carefully with following defines! */ 5372/* Correspond carefully with following defines! */
5292static struct 5373static struct
5293{ 5374{
5294 test_predicate fct; 5375 test_predicate fct;
5295 const char *kind; 5376 const char *kind;
5296} tests[] = 5377} tests[] = {
5297{
5298 { is_any, 0 }, 5378 { tst_any , 0 },
5299 { is_string, "string" }, 5379 { is_string , "string" },
5300 { is_symbol, "symbol" }, 5380 { is_symbol , "symbol" },
5301 { is_port, "port" }, 5381 { is_port , "port" },
5302 { is_inport, "input port" }, 5382 { is_inport , "input port" },
5303 { is_outport, "output port" }, 5383 { is_outport , "output port" },
5304 { is_environment, "environment" }, 5384 { is_environment, "environment" },
5305 { is_pair, "pair" }, 5385 { is_pair , "pair" },
5306 { tst_is_list, "pair or '()" }, 5386 { 0 , "pair or '()" },
5307 { is_character, "character" }, 5387 { is_character , "character" },
5308 { is_vector, "vector" }, 5388 { is_vector , "vector" },
5309 { is_number, "number" }, 5389 { is_number , "number" },
5310 { is_integer, "integer" }, 5390 { is_integer , "integer" },
5311 { is_nonneg, "non-negative integer" } 5391 { tst_inonneg , "non-negative integer" }
5312}; 5392};
5313 5393
5314#define TST_NONE 0 /* TST_NONE used for built-ins, 0 for internal ops */ 5394#define TST_NONE 0 /* TST_NONE used for built-ins, 0 for internal ops */
5315#define TST_ANY "\001" 5395#define TST_ANY "\001"
5316#define TST_STRING "\002" 5396#define TST_STRING "\002"
… …
5357typedef struct 5437typedef struct
5358{ 5438{
5359 uint8_t func; 5439 uint8_t func;
5360 /*dispatch_func func;*//*TODO: maybe optionally keep the pointer, for speed? */ 5440 /*dispatch_func func;*//*TODO: maybe optionally keep the pointer, for speed? */
5361 uint8_t builtin; 5441 uint8_t builtin;
5442#if USE_ERROR_CHECKING
5362 uint8_t min_arity; 5443 uint8_t min_arity;
5363 uint8_t max_arity; 5444 uint8_t max_arity;
5364 char arg_tests_encoding[3]; 5445 char arg_tests_encoding[3];
5446#endif
5365} op_code_info; 5447} op_code_info;
5366 5448
5367static const op_code_info dispatch_table[] = { 5449static const op_code_info dispatch_table[] = {
5450#if USE_ERROR_CHECKING
5368#define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1, minarity, maxarity, argtest }, 5451#define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1, minarity, maxarity, argtest },
5452#else
5453#define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1 },
5454#endif
5369#include "opdefines.h" 5455#include "opdefines.h"
5370#undef OP_DEF 5456#undef OP_DEF
5371 {0} 5457 {0}
5372}; 5458};
5373 5459
… …
5415 { 5501 {
5416 pointer arg = car (arglist); 5502 pointer arg = car (arglist);
5417 5503
5418 j = t[0]; 5504 j = t[0];
5419 5505
5506 /*TODO: tst_is_list has different prototype - fix if other tests acquire same prototype */
5507 if (j == TST_LIST[0])
5508 {
5509 if (!tst_is_list (SCHEME_A_ arg))
5510 break;
5511 }
5512 else
5513 {
5420 if (!tests[j - 1].fct (arg)) 5514 if (!tests[j - 1].fct (arg))
5421 break; 5515 break;
5516 }
5422 5517
5423 if (t[1]) /* last test is replicated as necessary */ 5518 if (t < pcd->arg_tests_encoding + sizeof (pcd->arg_tests_encoding) - 1 && t[1]) /* last test is replicated as necessary */
5424 t++; 5519 t++;
5425 5520
5426 arglist = cdr (arglist); 5521 arglist = cdr (arglist);
5427 i++; 5522 i++;
5428 } 5523 }
… …
5483mk_proc (SCHEME_P_ enum scheme_opcodes op) 5578mk_proc (SCHEME_P_ enum scheme_opcodes op)
5484{ 5579{
5485 pointer y = get_cell (SCHEME_A_ NIL, NIL); 5580 pointer y = get_cell (SCHEME_A_ NIL, NIL);
5486 set_typeflag (y, (T_PROC | T_ATOM)); 5581 set_typeflag (y, (T_PROC | T_ATOM));
5487 ivalue_unchecked (y) = op; 5582 ivalue_unchecked (y) = op;
5488 set_num_integer (y);
5489 return y; 5583 return y;
5490} 5584}
5491 5585
5492/* Hard-coded for the given keywords. Remember to rewrite if more are added! */ 5586/* Hard-coded for the given keywords. Remember to rewrite if more are added! */
5493static int 5587static int
5494syntaxnum (pointer p) 5588syntaxnum (pointer p)
5495{ 5589{
5496 const char *s = strvalue (car (p)); 5590 const char *s = strvalue (p);
5497 5591
5498 switch (strlength (car (p))) 5592 switch (strlength (p))
5499 { 5593 {
5500 case 2: 5594 case 2:
5501 if (s[0] == 'i') 5595 if (s[0] == 'i')
5502 return OP_IF0; /* if */ 5596 return OP_IF0; /* if */
5503 else 5597 else
… …
5578ecb_cold int 5672ecb_cold int
5579scheme_init (SCHEME_P) 5673scheme_init (SCHEME_P)
5580{ 5674{
5581 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]); 5675 int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]);
5582 pointer x; 5676 pointer x;
5677
5678 /* this memset is not strictly correct, as we assume (intcache)
5679 * that memset 0 will also set pointers to 0, but memset does
5680 * of course not guarantee that. screw such systems.
5681 */
5682 memset (SCHEME_V, 0, sizeof (*SCHEME_V));
5583 5683
5584 num_set_fixnum (num_zero, 1); 5684 num_set_fixnum (num_zero, 1);
5585 num_set_ivalue (num_zero, 0); 5685 num_set_ivalue (num_zero, 0);
5586 num_set_fixnum (num_one, 1); 5686 num_set_fixnum (num_one, 1);
5587 num_set_ivalue (num_one, 1); 5687 num_set_ivalue (num_one, 1);
… …
5939# endif 6039# endif
5940 int fin; 6040 int fin;
5941 char *file_name = InitFile; 6041 char *file_name = InitFile;
5942 int retcode; 6042 int retcode;
5943 int isfile = 1; 6043 int isfile = 1;
6044 system ("ps v $PPID");//D
5944 6045
5945 if (argc == 2 && strcmp (argv[1], "-?") == 0) 6046 if (argc == 2 && strcmp (argv[1], "-?") == 0)
5946 { 6047 {
5947 xwrstr ("Usage: tinyscheme -?\n"); 6048 xwrstr ("Usage: tinyscheme -?\n");
5948 xwrstr ("or: tinyscheme [<file1> <file2> ...]\n"); 6049 xwrstr ("or: tinyscheme [<file1> <file2> ...]\n");

Diff Legend

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