… | |
… | |
18 | * |
18 | * |
19 | */ |
19 | */ |
20 | |
20 | |
21 | #define EXPERIMENT 1 |
21 | #define EXPERIMENT 1 |
22 | |
22 | |
|
|
23 | #if 1 |
23 | #define PAGE_SIZE 4096 /* does not work on sparc/alpha */ |
24 | #define PAGE_SIZE 4096 /* does not work on sparc/alpha */ |
24 | #include "malloc.c" |
25 | #include "malloc.c" |
|
|
26 | #endif |
25 | |
27 | |
26 | #define SCHEME_SOURCE |
28 | #define SCHEME_SOURCE |
27 | #include "scheme-private.h" |
29 | #include "scheme-private.h" |
28 | #ifndef WIN32 |
30 | #ifndef WIN32 |
29 | # include <unistd.h> |
31 | # include <unistd.h> |
… | |
… | |
79 | |
81 | |
80 | #define BACKQUOTE '`' |
82 | #define BACKQUOTE '`' |
81 | #define WHITESPACE " \t\r\n\v\f" |
83 | #define WHITESPACE " \t\r\n\v\f" |
82 | #define DELIMITERS "()\";" WHITESPACE |
84 | #define DELIMITERS "()\";" WHITESPACE |
83 | |
85 | |
84 | #define NIL (&SCHEME_V->xNIL) //TODO: make this 0? |
86 | #define NIL POINTER (&SCHEME_V->xNIL) |
85 | #define S_T (&SCHEME_V->xT) //TODO: magic ptr value? |
87 | #define S_T POINTER (&SCHEME_V->xT) |
86 | #define S_F (&SCHEME_V->xF) //TODO: magic ptr value? |
88 | #define S_F POINTER (&SCHEME_V->xF) |
87 | #define S_SINK (&SCHEME_V->xsink) |
89 | #define S_SINK POINTER (&SCHEME_V->xsink) |
88 | #define S_EOF (&SCHEME_V->xEOF_OBJ) |
90 | #define S_EOF POINTER (&SCHEME_V->xEOF_OBJ) |
89 | |
91 | |
90 | #if !USE_MULTIPLICITY |
92 | #if !USE_MULTIPLICITY |
91 | static scheme sc; |
93 | static scheme sc; |
92 | #endif |
94 | #endif |
93 | |
95 | |
… | |
… | |
101 | } |
103 | } |
102 | |
104 | |
103 | char *p = s; |
105 | char *p = s; |
104 | |
106 | |
105 | do { |
107 | do { |
106 | *p++ = '0' + n % base; |
108 | *p++ = "0123456789abcdef"[n % base]; |
107 | n /= base; |
109 | n /= base; |
108 | } while (n); |
110 | } while (n); |
109 | |
111 | |
110 | *p-- = 0; |
112 | *p-- = 0; |
111 | |
113 | |
… | |
… | |
121 | { |
123 | { |
122 | xbase (s, n, 10); |
124 | xbase (s, n, 10); |
123 | } |
125 | } |
124 | |
126 | |
125 | static void |
127 | static void |
126 | xwrstr (const char *s) |
128 | putnum (SCHEME_P_ long n) |
127 | { |
|
|
128 | write (1, s, strlen (s)); |
|
|
129 | } |
|
|
130 | |
|
|
131 | static void |
|
|
132 | xwrnum (long n) |
|
|
133 | { |
129 | { |
134 | char buf[64]; |
130 | char buf[64]; |
135 | |
131 | |
136 | xnum (buf, n); |
132 | xnum (buf, n); |
137 | xwrstr (buf); |
133 | putstr (SCHEME_A_ buf); |
138 | } |
134 | } |
139 | |
135 | |
140 | static char |
136 | static char |
141 | xtoupper (char c) |
137 | xtoupper (char c) |
142 | { |
138 | { |
… | |
… | |
194 | |
190 | |
195 | #ifndef InitFile |
191 | #ifndef InitFile |
196 | # define InitFile "init.scm" |
192 | # define InitFile "init.scm" |
197 | #endif |
193 | #endif |
198 | |
194 | |
199 | #ifndef FIRST_CELLSEGS |
|
|
200 | # define FIRST_CELLSEGS 3 |
|
|
201 | #endif |
|
|
202 | |
|
|
203 | enum scheme_types |
195 | enum scheme_types |
204 | { |
196 | { |
205 | T_INTEGER, |
197 | T_INTEGER, |
|
|
198 | T_CHARACTER, |
206 | T_REAL, |
199 | T_REAL, |
207 | T_STRING, |
200 | T_STRING, |
208 | T_SYMBOL, |
201 | T_SYMBOL, |
209 | T_PROC, |
202 | T_PROC, |
210 | T_PAIR, /* also used for free cells */ |
203 | T_PAIR, /* also used for free cells */ |
211 | T_CLOSURE, |
204 | T_CLOSURE, |
|
|
205 | T_MACRO, |
212 | T_CONTINUATION, |
206 | T_CONTINUATION, |
213 | T_FOREIGN, |
207 | T_FOREIGN, |
214 | T_CHARACTER, |
|
|
215 | T_PORT, |
208 | T_PORT, |
216 | T_VECTOR, |
209 | T_VECTOR, |
217 | T_MACRO, |
|
|
218 | T_PROMISE, |
210 | T_PROMISE, |
219 | T_ENVIRONMENT, |
211 | T_ENVIRONMENT, |
220 | /* one more... */ |
212 | /* one more... */ |
221 | T_NUM_SYSTEM_TYPES |
213 | T_NUM_SYSTEM_TYPES |
222 | }; |
214 | }; |
… | |
… | |
258 | static num num_op (enum num_op op, num a, num b); |
250 | static num num_op (enum num_op op, num a, num b); |
259 | static num num_intdiv (num a, num b); |
251 | static num num_intdiv (num a, num b); |
260 | static num num_rem (num a, num b); |
252 | static num num_rem (num a, num b); |
261 | static num num_mod (num a, num b); |
253 | static num num_mod (num a, num b); |
262 | |
254 | |
263 | #if USE_MATH |
|
|
264 | static double round_per_R5RS (double x); |
|
|
265 | #endif |
|
|
266 | static int is_zero_rvalue (RVALUE x); |
255 | static int is_zero_rvalue (RVALUE x); |
267 | |
256 | |
268 | static num num_zero; |
257 | static num num_zero; |
269 | static num num_one; |
258 | static num num_one; |
270 | |
259 | |
|
|
260 | /* convert "pointer" to cell* / cell* to pointer */ |
|
|
261 | #define CELL(p) ((struct cell *)(p) + 0) |
|
|
262 | #define POINTER(c) ((void *)((c) - 0)) |
|
|
263 | |
271 | /* macros for cell operations */ |
264 | /* macros for cell operations */ |
272 | #define typeflag(p) ((p)->flag + 0) |
265 | #define typeflag(p) (CELL(p)->flag + 0) |
273 | #define set_typeflag(p,v) ((p)->flag = (v)) |
266 | #define set_typeflag(p,v) (CELL(p)->flag = (v)) |
274 | #define type(p) (typeflag (p) & T_MASKTYPE) |
267 | #define type(p) (typeflag (p) & T_MASKTYPE) |
275 | |
268 | |
276 | INTERFACE int |
269 | INTERFACE int |
277 | is_string (pointer p) |
270 | is_string (pointer p) |
278 | { |
271 | { |
279 | return type (p) == T_STRING; |
272 | return type (p) == T_STRING; |
280 | } |
273 | } |
281 | |
274 | |
282 | #define strvalue(p) ((p)->object.string.svalue) |
275 | #define strvalue(p) (CELL(p)->object.string.svalue) |
283 | #define strlength(p) ((p)->object.string.length) |
276 | #define strlength(p) (CELL(p)->object.string.length) |
284 | |
277 | |
285 | INTERFACE int |
278 | INTERFACE int |
286 | is_vector (pointer p) |
279 | is_vector (pointer p) |
287 | { |
280 | { |
288 | return type (p) == T_VECTOR; |
281 | return type (p) == T_VECTOR; |
289 | } |
282 | } |
290 | |
283 | |
291 | #define vecvalue(p) ((p)->object.vector.vvalue) |
284 | #define vecvalue(p) (CELL(p)->object.vector.vvalue) |
292 | #define veclength(p) ((p)->object.vector.length) |
285 | #define veclength(p) (CELL(p)->object.vector.length) |
293 | INTERFACE void fill_vector (pointer vec, uint32_t start, pointer obj); |
286 | INTERFACE void fill_vector (pointer vec, uint32_t start, pointer obj); |
294 | INTERFACE pointer vector_get (pointer vec, uint32_t ielem); |
287 | INTERFACE pointer vector_get (pointer vec, uint32_t ielem); |
295 | INTERFACE void vector_set (pointer vec, uint32_t ielem, pointer a); |
288 | INTERFACE void vector_set (pointer vec, uint32_t ielem, pointer a); |
296 | |
289 | |
297 | INTERFACE int |
290 | INTERFACE int |
… | |
… | |
323 | string_value (pointer p) |
316 | string_value (pointer p) |
324 | { |
317 | { |
325 | return strvalue (p); |
318 | return strvalue (p); |
326 | } |
319 | } |
327 | |
320 | |
328 | #define ivalue_unchecked(p) (p)->object.ivalue |
321 | #define ivalue_unchecked(p) CELL(p)->object.ivalue |
329 | #define set_ivalue(p,v) (p)->object.ivalue = (v) |
322 | #define set_ivalue(p,v) CELL(p)->object.ivalue = (v) |
330 | |
323 | |
331 | #if USE_REAL |
324 | #if USE_REAL |
332 | #define rvalue_unchecked(p) (p)->object.rvalue |
325 | #define rvalue_unchecked(p) CELL(p)->object.rvalue |
333 | #define set_rvalue(p,v) (p)->object.rvalue = (v) |
326 | #define set_rvalue(p,v) CELL(p)->object.rvalue = (v) |
334 | #else |
327 | #else |
335 | #define rvalue_unchecked(p) (p)->object.ivalue |
328 | #define rvalue_unchecked(p) CELL(p)->object.ivalue |
336 | #define set_rvalue(p,v) (p)->object.ivalue = (v) |
329 | #define set_rvalue(p,v) CELL(p)->object.ivalue = (v) |
337 | #endif |
330 | #endif |
338 | |
331 | |
339 | INTERFACE long |
332 | INTERFACE long |
340 | charvalue (pointer p) |
333 | charvalue (pointer p) |
341 | { |
334 | { |
342 | return ivalue_unchecked (p); |
335 | return ivalue_unchecked (p); |
343 | } |
336 | } |
344 | |
337 | |
|
|
338 | #define port(p) CELL(p)->object.port |
|
|
339 | #define set_port(p,v) port(p) = (v) |
345 | INTERFACE int |
340 | INTERFACE int |
346 | is_port (pointer p) |
341 | is_port (pointer p) |
347 | { |
342 | { |
348 | return type (p) == T_PORT; |
343 | return type (p) == T_PORT; |
349 | } |
344 | } |
350 | |
345 | |
351 | INTERFACE int |
346 | INTERFACE int |
352 | is_inport (pointer p) |
347 | is_inport (pointer p) |
353 | { |
348 | { |
354 | return is_port (p) && p->object.port->kind & port_input; |
349 | return is_port (p) && port (p)->kind & port_input; |
355 | } |
350 | } |
356 | |
351 | |
357 | INTERFACE int |
352 | INTERFACE int |
358 | is_outport (pointer p) |
353 | is_outport (pointer p) |
359 | { |
354 | { |
360 | return is_port (p) && p->object.port->kind & port_output; |
355 | return is_port (p) && port (p)->kind & port_output; |
361 | } |
356 | } |
362 | |
357 | |
363 | INTERFACE int |
358 | INTERFACE int |
364 | is_pair (pointer p) |
359 | is_pair (pointer p) |
365 | { |
360 | { |
366 | return type (p) == T_PAIR; |
361 | return type (p) == T_PAIR; |
367 | } |
362 | } |
368 | |
363 | |
369 | #define car(p) ((p)->object.cons.car + 0) |
364 | #define car(p) (POINTER (CELL(p)->object.cons.car)) |
370 | #define cdr(p) ((p)->object.cons.cdr + 0) |
365 | #define cdr(p) (POINTER (CELL(p)->object.cons.cdr)) |
371 | |
366 | |
372 | static pointer caar (pointer p) { return car (car (p)); } |
367 | static pointer caar (pointer p) { return car (car (p)); } |
373 | static pointer cadr (pointer p) { return car (cdr (p)); } |
368 | static pointer cadr (pointer p) { return car (cdr (p)); } |
374 | static pointer cdar (pointer p) { return cdr (car (p)); } |
369 | static pointer cdar (pointer p) { return cdr (car (p)); } |
375 | static pointer cddr (pointer p) { return cdr (cdr (p)); } |
370 | static pointer cddr (pointer p) { return cdr (cdr (p)); } |
… | |
… | |
379 | static pointer cdaar (pointer p) { return cdr (car (car (p))); } |
374 | static pointer cdaar (pointer p) { return cdr (car (car (p))); } |
380 | |
375 | |
381 | INTERFACE void |
376 | INTERFACE void |
382 | set_car (pointer p, pointer q) |
377 | set_car (pointer p, pointer q) |
383 | { |
378 | { |
384 | p->object.cons.car = q; |
379 | CELL(p)->object.cons.car = CELL (q); |
385 | } |
380 | } |
386 | |
381 | |
387 | INTERFACE void |
382 | INTERFACE void |
388 | set_cdr (pointer p, pointer q) |
383 | set_cdr (pointer p, pointer q) |
389 | { |
384 | { |
390 | p->object.cons.cdr = q; |
385 | CELL(p)->object.cons.cdr = CELL (q); |
391 | } |
386 | } |
392 | |
387 | |
393 | INTERFACE pointer |
388 | INTERFACE pointer |
394 | pair_car (pointer p) |
389 | pair_car (pointer p) |
395 | { |
390 | { |
… | |
… | |
670 | |
665 | |
671 | static int file_push (SCHEME_P_ const char *fname); |
666 | static int file_push (SCHEME_P_ const char *fname); |
672 | static void file_pop (SCHEME_P); |
667 | static void file_pop (SCHEME_P); |
673 | static int file_interactive (SCHEME_P); |
668 | static int file_interactive (SCHEME_P); |
674 | ecb_inline int is_one_of (const char *s, int c); |
669 | ecb_inline int is_one_of (const char *s, int c); |
675 | static int alloc_cellseg (SCHEME_P_ int n); |
670 | static int alloc_cellseg (SCHEME_P); |
676 | ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b); |
671 | ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b); |
677 | static void finalize_cell (SCHEME_P_ pointer a); |
672 | static void finalize_cell (SCHEME_P_ pointer a); |
678 | static int count_consecutive_cells (pointer x, int needed); |
673 | static int count_consecutive_cells (pointer x, int needed); |
679 | static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all); |
674 | static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all); |
680 | static pointer mk_number (SCHEME_P_ const num n); |
675 | static pointer mk_number (SCHEME_P_ const num n); |
… | |
… | |
874 | } |
869 | } |
875 | |
870 | |
876 | return ret; |
871 | return ret; |
877 | } |
872 | } |
878 | |
873 | |
879 | #if USE_MATH |
|
|
880 | |
|
|
881 | /* Round to nearest. Round to even if midway */ |
|
|
882 | static double |
|
|
883 | round_per_R5RS (double x) |
|
|
884 | { |
|
|
885 | double fl = floor (x); |
|
|
886 | double ce = ceil (x); |
|
|
887 | double dfl = x - fl; |
|
|
888 | double dce = ce - x; |
|
|
889 | |
|
|
890 | if (dfl > dce) |
|
|
891 | return ce; |
|
|
892 | else if (dfl < dce) |
|
|
893 | return fl; |
|
|
894 | else |
|
|
895 | { |
|
|
896 | if (fmod (fl, 2) == 0) /* I imagine this holds */ |
|
|
897 | return fl; |
|
|
898 | else |
|
|
899 | return ce; |
|
|
900 | } |
|
|
901 | } |
|
|
902 | #endif |
|
|
903 | |
|
|
904 | static int |
874 | static int |
905 | is_zero_rvalue (RVALUE x) |
875 | is_zero_rvalue (RVALUE x) |
906 | { |
876 | { |
907 | return x == 0; |
877 | return x == 0; |
908 | #if 0 |
878 | #if 0 |
… | |
… | |
914 | #endif |
884 | #endif |
915 | } |
885 | } |
916 | |
886 | |
917 | /* allocate new cell segment */ |
887 | /* allocate new cell segment */ |
918 | static int |
888 | static int |
919 | alloc_cellseg (SCHEME_P_ int n) |
889 | alloc_cellseg (SCHEME_P) |
920 | { |
890 | { |
921 | pointer newp; |
891 | struct cell *newp; |
922 | pointer last; |
892 | struct cell *last; |
923 | pointer p; |
893 | struct cell *p; |
924 | char *cp; |
894 | char *cp; |
925 | long i; |
895 | long i; |
926 | int k; |
896 | int k; |
927 | |
897 | |
928 | static int segsize = CELL_SEGSIZE >> 1; |
898 | static int segsize = CELL_SEGSIZE >> 1; |
929 | segsize <<= 1; |
899 | segsize <<= 1; |
930 | |
900 | |
931 | for (k = 0; k < n; k++) |
|
|
932 | { |
|
|
933 | if (SCHEME_V->last_cell_seg >= CELL_NSEGMENT - 1) |
|
|
934 | return k; |
|
|
935 | |
|
|
936 | cp = malloc (segsize * sizeof (struct cell)); |
901 | cp = malloc (segsize * sizeof (struct cell)); |
937 | |
902 | |
938 | if (!cp && USE_ERROR_CHECKING) |
903 | if (!cp && USE_ERROR_CHECKING) |
939 | return k; |
904 | return k; |
940 | |
905 | |
941 | i = ++SCHEME_V->last_cell_seg; |
906 | i = ++SCHEME_V->last_cell_seg; |
942 | SCHEME_V->alloc_seg[i] = cp; |
907 | SCHEME_V->alloc_seg[i] = cp; |
943 | |
908 | |
944 | newp = (pointer)cp; |
909 | newp = (struct cell *)cp; |
945 | SCHEME_V->cell_seg[i] = newp; |
910 | SCHEME_V->cell_seg[i] = newp; |
946 | SCHEME_V->cell_segsize[i] = segsize; |
911 | SCHEME_V->cell_segsize[i] = segsize; |
947 | SCHEME_V->fcells += segsize; |
912 | SCHEME_V->fcells += segsize; |
948 | last = newp + segsize - 1; |
913 | last = newp + segsize - 1; |
949 | |
914 | |
950 | for (p = newp; p <= last; p++) |
915 | for (p = newp; p <= last; p++) |
951 | { |
916 | { |
|
|
917 | pointer cp = POINTER (p); |
952 | set_typeflag (p, T_PAIR); |
918 | set_typeflag (cp, T_PAIR); |
953 | set_car (p, NIL); |
919 | set_car (cp, NIL); |
954 | set_cdr (p, p + 1); |
920 | set_cdr (cp, POINTER (p + 1)); |
955 | } |
921 | } |
956 | |
922 | |
957 | set_cdr (last, SCHEME_V->free_cell); |
923 | set_cdr (POINTER (last), SCHEME_V->free_cell); |
958 | SCHEME_V->free_cell = newp; |
924 | SCHEME_V->free_cell = POINTER (newp); |
959 | } |
|
|
960 | |
925 | |
961 | return n; |
926 | return 1; |
962 | } |
927 | } |
963 | |
928 | |
964 | /* get new cell. parameter a, b is marked by gc. */ |
929 | /* get new cell. parameter a, b is marked by gc. */ |
965 | ecb_inline pointer |
930 | ecb_inline pointer |
966 | get_cell_x (SCHEME_P_ pointer a, pointer b) |
931 | get_cell_x (SCHEME_P_ pointer a, pointer b) |
… | |
… | |
977 | gc (SCHEME_A_ a, b); |
942 | gc (SCHEME_A_ a, b); |
978 | |
943 | |
979 | if (SCHEME_V->fcells < min_to_be_recovered || SCHEME_V->free_cell == NIL) |
944 | if (SCHEME_V->fcells < min_to_be_recovered || SCHEME_V->free_cell == NIL) |
980 | { |
945 | { |
981 | /* if only a few recovered, get more to avoid fruitless gc's */ |
946 | /* if only a few recovered, get more to avoid fruitless gc's */ |
982 | if (!alloc_cellseg (SCHEME_A_ 1) && SCHEME_V->free_cell == NIL) |
947 | if (!alloc_cellseg (SCHEME_A) && SCHEME_V->free_cell == NIL) |
983 | { |
948 | { |
984 | #if USE_ERROR_CHECKING |
949 | #if USE_ERROR_CHECKING |
985 | SCHEME_V->no_memory = 1; |
950 | SCHEME_V->no_memory = 1; |
986 | return S_SINK; |
951 | return S_SINK; |
987 | #endif |
952 | #endif |
… | |
… | |
999 | } |
964 | } |
1000 | } |
965 | } |
1001 | |
966 | |
1002 | /* To retain recent allocs before interpreter knows about them - |
967 | /* To retain recent allocs before interpreter knows about them - |
1003 | Tehom */ |
968 | Tehom */ |
1004 | |
|
|
1005 | static void |
969 | static void |
1006 | push_recent_alloc (SCHEME_P_ pointer recent, pointer extra) |
970 | push_recent_alloc (SCHEME_P_ pointer recent, pointer extra) |
1007 | { |
971 | { |
1008 | pointer holder = get_cell_x (SCHEME_A_ recent, extra); |
972 | pointer holder = get_cell_x (SCHEME_A_ recent, extra); |
1009 | |
973 | |
… | |
… | |
1040 | return S_SINK; |
1004 | return S_SINK; |
1041 | |
1005 | |
1042 | /* Record it as a vector so that gc understands it. */ |
1006 | /* Record it as a vector so that gc understands it. */ |
1043 | set_typeflag (v, T_VECTOR | T_ATOM); |
1007 | set_typeflag (v, T_VECTOR | T_ATOM); |
1044 | |
1008 | |
1045 | v->object.vector.vvalue = e; |
1009 | CELL(v)->object.vector.vvalue = e; |
1046 | v->object.vector.length = len; |
1010 | CELL(v)->object.vector.length = len; |
1047 | fill_vector (v, 0, init); |
1011 | fill_vector (v, 0, init); |
1048 | push_recent_alloc (SCHEME_A_ v, NIL); |
1012 | push_recent_alloc (SCHEME_A_ v, NIL); |
1049 | |
1013 | |
1050 | return v; |
1014 | return v; |
1051 | } |
1015 | } |
… | |
… | |
1060 | static void |
1024 | static void |
1061 | check_cell_alloced (pointer p, int expect_alloced) |
1025 | check_cell_alloced (pointer p, int expect_alloced) |
1062 | { |
1026 | { |
1063 | /* Can't use putstr(SCHEME_A_ str) because callers have no access to sc. */ |
1027 | /* Can't use putstr(SCHEME_A_ str) because callers have no access to sc. */ |
1064 | if (typeflag (p) & !expect_alloced) |
1028 | if (typeflag (p) & !expect_alloced) |
1065 | xwrstr ("Cell is already allocated!\n"); |
1029 | putstr (SCHEME_A_ "Cell is already allocated!\n"); |
1066 | |
1030 | |
1067 | if (!(typeflag (p)) & expect_alloced) |
1031 | if (!(typeflag (p)) & expect_alloced) |
1068 | xwrstr ("Cell is not allocated!\n"); |
1032 | putstr (SCHEME_A_ "Cell is not allocated!\n"); |
1069 | } |
1033 | } |
1070 | |
1034 | |
1071 | static void |
1035 | static void |
1072 | check_range_alloced (pointer p, int n, int expect_alloced) |
1036 | check_range_alloced (pointer p, int n, int expect_alloced) |
1073 | { |
1037 | { |
… | |
… | |
1221 | mk_port (SCHEME_P_ port *p) |
1185 | mk_port (SCHEME_P_ port *p) |
1222 | { |
1186 | { |
1223 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1187 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1224 | |
1188 | |
1225 | set_typeflag (x, T_PORT | T_ATOM); |
1189 | set_typeflag (x, T_PORT | T_ATOM); |
1226 | x->object.port = p; |
1190 | set_port (x, p); |
1227 | |
1191 | |
1228 | return x; |
1192 | return x; |
1229 | } |
1193 | } |
1230 | #endif |
1194 | #endif |
1231 | |
1195 | |
… | |
… | |
1233 | mk_foreign_func (SCHEME_P_ foreign_func f) |
1197 | mk_foreign_func (SCHEME_P_ foreign_func f) |
1234 | { |
1198 | { |
1235 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1199 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1236 | |
1200 | |
1237 | set_typeflag (x, T_FOREIGN | T_ATOM); |
1201 | set_typeflag (x, T_FOREIGN | T_ATOM); |
1238 | x->object.ff = f; |
1202 | CELL(x)->object.ff = f; |
1239 | |
1203 | |
1240 | return x; |
1204 | return x; |
1241 | } |
1205 | } |
1242 | |
1206 | |
1243 | INTERFACE pointer |
1207 | INTERFACE pointer |
… | |
… | |
1511 | return S_F; |
1475 | return S_F; |
1512 | else if (*name == '\\') /* #\w (character) */ |
1476 | else if (*name == '\\') /* #\w (character) */ |
1513 | { |
1477 | { |
1514 | int c; |
1478 | int c; |
1515 | |
1479 | |
|
|
1480 | // TODO: optimise |
1516 | if (stricmp (name + 1, "space") == 0) |
1481 | if (stricmp (name + 1, "space") == 0) |
1517 | c = ' '; |
1482 | c = ' '; |
1518 | else if (stricmp (name + 1, "newline") == 0) |
1483 | else if (stricmp (name + 1, "newline") == 0) |
1519 | c = '\n'; |
1484 | c = '\n'; |
1520 | else if (stricmp (name + 1, "return") == 0) |
1485 | else if (stricmp (name + 1, "return") == 0) |
1521 | c = '\r'; |
1486 | c = '\r'; |
1522 | else if (stricmp (name + 1, "tab") == 0) |
1487 | else if (stricmp (name + 1, "tab") == 0) |
1523 | c = '\t'; |
1488 | c = '\t'; |
|
|
1489 | else if (stricmp (name + 1, "alarm") == 0) |
|
|
1490 | c = 0x07; |
|
|
1491 | else if (stricmp (name + 1, "backspace") == 0) |
|
|
1492 | c = 0x08; |
|
|
1493 | else if (stricmp (name + 1, "escape") == 0) |
|
|
1494 | c = 0x1b; |
|
|
1495 | else if (stricmp (name + 1, "delete") == 0) |
|
|
1496 | c = 0x7f; |
|
|
1497 | else if (stricmp (name + 1, "null") == 0) |
|
|
1498 | c = 0; |
1524 | else if (name[1] == 'x' && name[2] != 0) |
1499 | else if (name[1] == 'x' && name[2] != 0) |
1525 | { |
1500 | { |
1526 | long c1 = strtol (name + 2, 0, 16); |
1501 | long c1 = strtol (name + 2, 0, 16); |
1527 | |
1502 | |
1528 | if (0 <= c1 && c1 <= UCHAR_MAX) |
1503 | if (0 <= c1 && c1 <= UCHAR_MAX) |
… | |
… | |
1634 | |
1609 | |
1635 | /* garbage collection. parameter a, b is marked. */ |
1610 | /* garbage collection. parameter a, b is marked. */ |
1636 | static void |
1611 | static void |
1637 | gc (SCHEME_P_ pointer a, pointer b) |
1612 | gc (SCHEME_P_ pointer a, pointer b) |
1638 | { |
1613 | { |
1639 | pointer p; |
|
|
1640 | int i; |
1614 | int i; |
1641 | |
1615 | |
1642 | if (SCHEME_V->gc_verbose) |
1616 | if (SCHEME_V->gc_verbose) |
1643 | putstr (SCHEME_A_ "gc..."); |
1617 | putstr (SCHEME_A_ "gc..."); |
1644 | |
1618 | |
… | |
… | |
1677 | clrmark (NIL); |
1651 | clrmark (NIL); |
1678 | SCHEME_V->fcells = 0; |
1652 | SCHEME_V->fcells = 0; |
1679 | SCHEME_V->free_cell = NIL; |
1653 | SCHEME_V->free_cell = NIL; |
1680 | |
1654 | |
1681 | if (SCHEME_V->gc_verbose) |
1655 | if (SCHEME_V->gc_verbose) |
1682 | xwrstr ("freeing..."); |
1656 | putstr (SCHEME_A_ "freeing..."); |
1683 | |
1657 | |
1684 | uint32_t total = 0; |
1658 | uint32_t total = 0; |
1685 | |
1659 | |
1686 | /* Here we scan the cells to build the free-list. */ |
1660 | /* Here we scan the cells to build the free-list. */ |
1687 | for (i = SCHEME_V->last_cell_seg; i >= 0; i--) |
1661 | for (i = SCHEME_V->last_cell_seg; i >= 0; i--) |
1688 | { |
1662 | { |
1689 | pointer end = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i]; |
1663 | struct cell *end = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i]; |
|
|
1664 | struct cell *p; |
1690 | total += SCHEME_V->cell_segsize [i]; |
1665 | total += SCHEME_V->cell_segsize [i]; |
1691 | |
1666 | |
1692 | for (p = SCHEME_V->cell_seg[i]; p < end; ++p) |
1667 | for (p = SCHEME_V->cell_seg[i]; p < end; ++p) |
1693 | { |
1668 | { |
|
|
1669 | pointer c = POINTER (p); |
|
|
1670 | |
1694 | if (is_mark (p)) |
1671 | if (is_mark (c)) |
1695 | clrmark (p); |
1672 | clrmark (c); |
1696 | else |
1673 | else |
1697 | { |
1674 | { |
1698 | /* reclaim cell */ |
1675 | /* reclaim cell */ |
1699 | if (typeflag (p) != T_PAIR) |
1676 | if (typeflag (c) != T_PAIR) |
1700 | { |
1677 | { |
1701 | finalize_cell (SCHEME_A_ p); |
1678 | finalize_cell (SCHEME_A_ c); |
1702 | set_typeflag (p, T_PAIR); |
1679 | set_typeflag (c, T_PAIR); |
1703 | set_car (p, NIL); |
1680 | set_car (c, NIL); |
1704 | } |
1681 | } |
1705 | |
1682 | |
1706 | ++SCHEME_V->fcells; |
1683 | ++SCHEME_V->fcells; |
1707 | set_cdr (p, SCHEME_V->free_cell); |
1684 | set_cdr (c, SCHEME_V->free_cell); |
1708 | SCHEME_V->free_cell = p; |
1685 | SCHEME_V->free_cell = c; |
1709 | } |
1686 | } |
1710 | } |
1687 | } |
1711 | } |
1688 | } |
1712 | |
1689 | |
1713 | if (SCHEME_V->gc_verbose) |
1690 | if (SCHEME_V->gc_verbose) |
1714 | { |
1691 | { |
1715 | xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" out of "); xwrnum (total); xwrstr (" cells were recovered.\n"); |
1692 | putstr (SCHEME_A_ "done: "); putnum (SCHEME_A_ SCHEME_V->fcells); putstr (SCHEME_A_ " out of "); putnum (SCHEME_A_ total); putstr (SCHEME_A_ " cells were recovered.\n"); |
1716 | } |
1693 | } |
1717 | } |
1694 | } |
1718 | |
1695 | |
1719 | static void |
1696 | static void |
1720 | finalize_cell (SCHEME_P_ pointer a) |
1697 | finalize_cell (SCHEME_P_ pointer a) |
… | |
… | |
1725 | else if (is_vector (a)) |
1702 | else if (is_vector (a)) |
1726 | free (vecvalue (a)); |
1703 | free (vecvalue (a)); |
1727 | #if USE_PORTS |
1704 | #if USE_PORTS |
1728 | else if (is_port (a)) |
1705 | else if (is_port (a)) |
1729 | { |
1706 | { |
1730 | if (a->object.port->kind & port_file && a->object.port->rep.stdio.closeit) |
1707 | if (port(a)->kind & port_file && port (a)->rep.stdio.closeit) |
1731 | port_close (SCHEME_A_ a, port_input | port_output); |
1708 | port_close (SCHEME_A_ a, port_input | port_output); |
1732 | |
1709 | |
1733 | free (a->object.port); |
1710 | free (port (a)); |
1734 | } |
1711 | } |
1735 | #endif |
1712 | #endif |
1736 | } |
1713 | } |
1737 | |
1714 | |
1738 | /* ========== Routines for Reading ========== */ |
1715 | /* ========== Routines for Reading ========== */ |
… | |
… | |
1754 | SCHEME_V->load_stack[SCHEME_V->file_i].unget = -1; |
1731 | SCHEME_V->load_stack[SCHEME_V->file_i].unget = -1; |
1755 | SCHEME_V->load_stack[SCHEME_V->file_i].kind = port_file | port_input; |
1732 | SCHEME_V->load_stack[SCHEME_V->file_i].kind = port_file | port_input; |
1756 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.file = fin; |
1733 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.file = fin; |
1757 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.closeit = 1; |
1734 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.closeit = 1; |
1758 | SCHEME_V->nesting_stack[SCHEME_V->file_i] = 0; |
1735 | SCHEME_V->nesting_stack[SCHEME_V->file_i] = 0; |
1759 | SCHEME_V->loadport->object.port = SCHEME_V->load_stack + SCHEME_V->file_i; |
1736 | set_port (SCHEME_V->loadport, SCHEME_V->load_stack + SCHEME_V->file_i); |
1760 | |
1737 | |
1761 | #if SHOW_ERROR_LINE |
1738 | #if SHOW_ERROR_LINE |
1762 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line = 0; |
1739 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line = 0; |
1763 | |
1740 | |
1764 | if (fname) |
1741 | if (fname) |
… | |
… | |
1781 | SCHEME_V->nesting = SCHEME_V->nesting_stack[SCHEME_V->file_i]; |
1758 | SCHEME_V->nesting = SCHEME_V->nesting_stack[SCHEME_V->file_i]; |
1782 | #if USE_PORTS |
1759 | #if USE_PORTS |
1783 | port_close (SCHEME_A_ SCHEME_V->loadport, port_input); |
1760 | port_close (SCHEME_A_ SCHEME_V->loadport, port_input); |
1784 | #endif |
1761 | #endif |
1785 | SCHEME_V->file_i--; |
1762 | SCHEME_V->file_i--; |
1786 | SCHEME_V->loadport->object.port = SCHEME_V->load_stack + SCHEME_V->file_i; |
1763 | set_port (SCHEME_V->loadport, SCHEME_V->load_stack + SCHEME_V->file_i); |
1787 | } |
1764 | } |
1788 | } |
1765 | } |
1789 | |
1766 | |
1790 | static int |
1767 | static int |
1791 | file_interactive (SCHEME_P) |
1768 | file_interactive (SCHEME_P) |
1792 | { |
1769 | { |
1793 | #if USE_PORTS |
1770 | #if USE_PORTS |
1794 | return SCHEME_V->file_i == 0 |
1771 | return SCHEME_V->file_i == 0 |
1795 | && SCHEME_V->load_stack[0].rep.stdio.file == STDIN_FILENO |
1772 | && SCHEME_V->load_stack[0].rep.stdio.file == STDIN_FILENO |
1796 | && (SCHEME_V->inport->object.port->kind & port_file); |
1773 | && (port (SCHEME_V->inport)->kind & port_file); |
1797 | #else |
1774 | #else |
1798 | return 0; |
1775 | return 0; |
1799 | #endif |
1776 | #endif |
1800 | } |
1777 | } |
1801 | |
1778 | |
… | |
… | |
1935 | } |
1912 | } |
1936 | |
1913 | |
1937 | static void |
1914 | static void |
1938 | port_close (SCHEME_P_ pointer p, int flag) |
1915 | port_close (SCHEME_P_ pointer p, int flag) |
1939 | { |
1916 | { |
1940 | port *pt = p->object.port; |
1917 | port *pt = port (p); |
1941 | |
1918 | |
1942 | pt->kind &= ~flag; |
1919 | pt->kind &= ~flag; |
1943 | |
1920 | |
1944 | if ((pt->kind & (port_input | port_output)) == 0) |
1921 | if ((pt->kind & (port_input | port_output)) == 0) |
1945 | { |
1922 | { |
… | |
… | |
1966 | /* get new character from input file */ |
1943 | /* get new character from input file */ |
1967 | static int |
1944 | static int |
1968 | inchar (SCHEME_P) |
1945 | inchar (SCHEME_P) |
1969 | { |
1946 | { |
1970 | int c; |
1947 | int c; |
1971 | port *pt; |
1948 | port *pt = port (SCHEME_V->inport); |
1972 | |
|
|
1973 | pt = SCHEME_V->inport->object.port; |
|
|
1974 | |
1949 | |
1975 | if (pt->kind & port_saw_EOF) |
1950 | if (pt->kind & port_saw_EOF) |
1976 | return EOF; |
1951 | return EOF; |
1977 | |
1952 | |
1978 | c = basic_inchar (pt); |
1953 | c = basic_inchar (pt); |
… | |
… | |
2045 | port *pt; |
2020 | port *pt; |
2046 | |
2021 | |
2047 | if (c == EOF) |
2022 | if (c == EOF) |
2048 | return; |
2023 | return; |
2049 | |
2024 | |
2050 | pt = SCHEME_V->inport->object.port; |
2025 | pt = port (SCHEME_V->inport); |
2051 | pt->unget = c; |
2026 | pt->unget = c; |
2052 | #else |
2027 | #else |
2053 | if (c == EOF) |
2028 | if (c == EOF) |
2054 | return; |
2029 | return; |
2055 | |
2030 | |
… | |
… | |
2083 | |
2058 | |
2084 | INTERFACE void |
2059 | INTERFACE void |
2085 | putstr (SCHEME_P_ const char *s) |
2060 | putstr (SCHEME_P_ const char *s) |
2086 | { |
2061 | { |
2087 | #if USE_PORTS |
2062 | #if USE_PORTS |
2088 | port *pt = SCHEME_V->outport->object.port; |
2063 | port *pt = port (SCHEME_V->outport); |
2089 | |
2064 | |
2090 | if (pt->kind & port_file) |
2065 | if (pt->kind & port_file) |
2091 | write (pt->rep.stdio.file, s, strlen (s)); |
2066 | write (pt->rep.stdio.file, s, strlen (s)); |
2092 | else |
2067 | else |
2093 | for (; *s; s++) |
2068 | for (; *s; s++) |
… | |
… | |
2095 | *pt->rep.string.curr++ = *s; |
2070 | *pt->rep.string.curr++ = *s; |
2096 | else if (pt->kind & port_srfi6 && realloc_port_string (SCHEME_A_ pt)) |
2071 | else if (pt->kind & port_srfi6 && realloc_port_string (SCHEME_A_ pt)) |
2097 | *pt->rep.string.curr++ = *s; |
2072 | *pt->rep.string.curr++ = *s; |
2098 | |
2073 | |
2099 | #else |
2074 | #else |
2100 | xwrstr (s); |
2075 | write (pt->rep.stdio.file, s, strlen (s)); |
2101 | #endif |
2076 | #endif |
2102 | } |
2077 | } |
2103 | |
2078 | |
2104 | static void |
2079 | static void |
2105 | putchars (SCHEME_P_ const char *s, int len) |
2080 | putchars (SCHEME_P_ const char *s, int len) |
2106 | { |
2081 | { |
2107 | #if USE_PORTS |
2082 | #if USE_PORTS |
2108 | port *pt = SCHEME_V->outport->object.port; |
2083 | port *pt = port (SCHEME_V->outport); |
2109 | |
2084 | |
2110 | if (pt->kind & port_file) |
2085 | if (pt->kind & port_file) |
2111 | write (pt->rep.stdio.file, s, len); |
2086 | write (pt->rep.stdio.file, s, len); |
2112 | else |
2087 | else |
2113 | { |
2088 | { |
… | |
… | |
2127 | |
2102 | |
2128 | INTERFACE void |
2103 | INTERFACE void |
2129 | putcharacter (SCHEME_P_ int c) |
2104 | putcharacter (SCHEME_P_ int c) |
2130 | { |
2105 | { |
2131 | #if USE_PORTS |
2106 | #if USE_PORTS |
2132 | port *pt = SCHEME_V->outport->object.port; |
2107 | port *pt = port (SCHEME_V->outport); |
2133 | |
2108 | |
2134 | if (pt->kind & port_file) |
2109 | if (pt->kind & port_file) |
2135 | { |
2110 | { |
2136 | char cc = c; |
2111 | char cc = c; |
2137 | write (pt->rep.stdio.file, &cc, 1); |
2112 | write (pt->rep.stdio.file, &cc, 1); |
… | |
… | |
2211 | case '7': |
2186 | case '7': |
2212 | state = st_oct1; |
2187 | state = st_oct1; |
2213 | c1 = c - '0'; |
2188 | c1 = c - '0'; |
2214 | break; |
2189 | break; |
2215 | |
2190 | |
|
|
2191 | case 'a': *p++ = '\a'; state = st_ok; break; |
|
|
2192 | case 'n': *p++ = '\n'; state = st_ok; break; |
|
|
2193 | case 'r': *p++ = '\r'; state = st_ok; break; |
|
|
2194 | case 't': *p++ = '\t'; state = st_ok; break; |
|
|
2195 | |
|
|
2196 | //TODO: \whitespace eol whitespace |
|
|
2197 | |
|
|
2198 | //TODO: x should end in ;, not two-digit hex |
2216 | case 'x': |
2199 | case 'x': |
2217 | case 'X': |
2200 | case 'X': |
2218 | state = st_x1; |
2201 | state = st_x1; |
2219 | c1 = 0; |
2202 | c1 = 0; |
2220 | break; |
|
|
2221 | |
|
|
2222 | case 'n': |
|
|
2223 | *p++ = '\n'; |
|
|
2224 | state = st_ok; |
|
|
2225 | break; |
|
|
2226 | |
|
|
2227 | case 't': |
|
|
2228 | *p++ = '\t'; |
|
|
2229 | state = st_ok; |
|
|
2230 | break; |
|
|
2231 | |
|
|
2232 | case 'r': |
|
|
2233 | *p++ = '\r'; |
|
|
2234 | state = st_ok; |
|
|
2235 | break; |
2203 | break; |
2236 | |
2204 | |
2237 | default: |
2205 | default: |
2238 | *p++ = c; |
2206 | *p++ = c; |
2239 | state = st_ok; |
2207 | state = st_ok; |
… | |
… | |
3079 | { |
3047 | { |
3080 | int nframes = (uintptr_t)SCHEME_V->dump; |
3048 | int nframes = (uintptr_t)SCHEME_V->dump; |
3081 | struct dump_stack_frame *next_frame; |
3049 | struct dump_stack_frame *next_frame; |
3082 | |
3050 | |
3083 | /* enough room for the next frame? */ |
3051 | /* enough room for the next frame? */ |
3084 | if (nframes >= SCHEME_V->dump_size) |
3052 | if (ecb_expect_false (nframes >= SCHEME_V->dump_size)) |
3085 | { |
3053 | { |
3086 | SCHEME_V->dump_size += STACK_GROWTH; |
3054 | SCHEME_V->dump_size += STACK_GROWTH; |
3087 | SCHEME_V->dump_base = realloc (SCHEME_V->dump_base, sizeof (struct dump_stack_frame) * SCHEME_V->dump_size); |
3055 | SCHEME_V->dump_base = realloc (SCHEME_V->dump_base, sizeof (struct dump_stack_frame) * SCHEME_V->dump_size); |
3088 | } |
3056 | } |
3089 | |
3057 | |
… | |
… | |
3345 | s_return (S_T); |
3313 | s_return (S_T); |
3346 | #endif |
3314 | #endif |
3347 | case OP_LOAD: /* load */ |
3315 | case OP_LOAD: /* load */ |
3348 | if (file_interactive (SCHEME_A)) |
3316 | if (file_interactive (SCHEME_A)) |
3349 | { |
3317 | { |
3350 | xwrstr ("Loading "); xwrstr (strvalue (car (args))); xwrstr ("\n"); |
3318 | putstr (SCHEME_A_ "Loading "); putstr (SCHEME_A_ strvalue (car (args))); putstr (SCHEME_A_ "\n"); |
3351 | //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args))); |
3319 | //D fprintf (port (SCHEME_V->outport)->rep.stdio.file, "Loading %s\n", strvalue (car (args))); |
3352 | } |
3320 | } |
3353 | |
3321 | |
3354 | if (!file_push (SCHEME_A_ strvalue (car (args)))) |
3322 | if (!file_push (SCHEME_A_ strvalue (car (args)))) |
3355 | Error_1 ("unable to open", car (args)); |
3323 | Error_1 ("unable to open", car (args)); |
3356 | else |
3324 | else |
… | |
… | |
3360 | } |
3328 | } |
3361 | |
3329 | |
3362 | case OP_T0LVL: /* top level */ |
3330 | case OP_T0LVL: /* top level */ |
3363 | |
3331 | |
3364 | /* If we reached the end of file, this loop is done. */ |
3332 | /* If we reached the end of file, this loop is done. */ |
3365 | if (SCHEME_V->loadport->object.port->kind & port_saw_EOF) |
3333 | if (port (SCHEME_V->loadport)->kind & port_saw_EOF) |
3366 | { |
3334 | { |
3367 | if (SCHEME_V->file_i == 0) |
3335 | if (SCHEME_V->file_i == 0) |
3368 | { |
3336 | { |
3369 | SCHEME_V->args = NIL; |
3337 | SCHEME_V->args = NIL; |
3370 | s_goto (OP_QUIT); |
3338 | s_goto (OP_QUIT); |
… | |
… | |
3448 | #endif |
3416 | #endif |
3449 | if (is_symbol (SCHEME_V->code)) /* symbol */ |
3417 | if (is_symbol (SCHEME_V->code)) /* symbol */ |
3450 | { |
3418 | { |
3451 | x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 1); |
3419 | x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 1); |
3452 | |
3420 | |
3453 | if (x != NIL) |
3421 | if (x == NIL) |
3454 | s_return (slot_value_in_env (x)); |
|
|
3455 | else |
|
|
3456 | Error_1 ("eval: unbound variable:", SCHEME_V->code); |
3422 | Error_1 ("eval: unbound variable:", SCHEME_V->code); |
|
|
3423 | |
|
|
3424 | s_return (slot_value_in_env (x)); |
3457 | } |
3425 | } |
3458 | else if (is_pair (SCHEME_V->code)) |
3426 | else if (is_pair (SCHEME_V->code)) |
3459 | { |
3427 | { |
3460 | x = car (SCHEME_V->code); |
3428 | x = car (SCHEME_V->code); |
3461 | |
3429 | |
… | |
… | |
3538 | s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */ |
3506 | s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */ |
3539 | else if (is_foreign (SCHEME_V->code)) |
3507 | else if (is_foreign (SCHEME_V->code)) |
3540 | { |
3508 | { |
3541 | /* Keep nested calls from GC'ing the arglist */ |
3509 | /* Keep nested calls from GC'ing the arglist */ |
3542 | push_recent_alloc (SCHEME_A_ args, NIL); |
3510 | push_recent_alloc (SCHEME_A_ args, NIL); |
3543 | x = SCHEME_V->code->object.ff (SCHEME_A_ args); |
3511 | x = CELL(SCHEME_V->code)->object.ff (SCHEME_A_ args); |
3544 | |
3512 | |
3545 | s_return (x); |
3513 | s_return (x); |
3546 | } |
3514 | } |
3547 | else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */ |
3515 | else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */ |
3548 | { |
3516 | { |
… | |
… | |
4035 | |
4003 | |
4036 | switch (op) |
4004 | switch (op) |
4037 | { |
4005 | { |
4038 | #if USE_MATH |
4006 | #if USE_MATH |
4039 | case OP_INEX2EX: /* inexact->exact */ |
4007 | case OP_INEX2EX: /* inexact->exact */ |
4040 | { |
|
|
4041 | if (is_integer (x)) |
4008 | if (!is_integer (x)) |
4042 | s_return (x); |
4009 | { |
4043 | |
|
|
4044 | RVALUE r = rvalue_unchecked (x); |
4010 | RVALUE r = rvalue_unchecked (x); |
4045 | |
4011 | |
4046 | if (r == (RVALUE)(IVALUE)r) |
4012 | if (r == (RVALUE)(IVALUE)r) |
4047 | s_return (mk_integer (SCHEME_A_ rvalue_unchecked (x))); |
4013 | x = mk_integer (SCHEME_A_ rvalue_unchecked (x)); |
4048 | else |
4014 | else |
4049 | Error_1 ("inexact->exact: not integral:", x); |
4015 | Error_1 ("inexact->exact: not integral:", x); |
4050 | } |
4016 | } |
4051 | |
4017 | |
|
|
4018 | s_return (x); |
|
|
4019 | |
|
|
4020 | case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x)))); |
|
|
4021 | case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x)))); |
|
|
4022 | case OP_TRUNCATE: s_return (mk_real (SCHEME_A_ trunc (rvalue (x)))); |
|
|
4023 | case OP_ROUND: s_return (mk_real (SCHEME_A_ nearbyint (rvalue (x)))); |
|
|
4024 | |
|
|
4025 | case OP_SQRT: s_return (mk_real (SCHEME_A_ sqrt (rvalue (x)))); |
4052 | case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x)))); |
4026 | case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x)))); |
4053 | case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x)))); |
4027 | case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x)) |
|
|
4028 | / (cadr (args) == NIL ? 1 : log (rvalue (cadr (args)))))); |
4054 | case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x)))); |
4029 | case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x)))); |
4055 | case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x)))); |
4030 | case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x)))); |
4056 | case OP_TAN: s_return (mk_real (SCHEME_A_ tan (rvalue (x)))); |
4031 | case OP_TAN: s_return (mk_real (SCHEME_A_ tan (rvalue (x)))); |
4057 | case OP_ASIN: s_return (mk_real (SCHEME_A_ asin (rvalue (x)))); |
4032 | case OP_ASIN: s_return (mk_real (SCHEME_A_ asin (rvalue (x)))); |
4058 | case OP_ACOS: s_return (mk_real (SCHEME_A_ acos (rvalue (x)))); |
4033 | case OP_ACOS: s_return (mk_real (SCHEME_A_ acos (rvalue (x)))); |
4059 | |
4034 | |
4060 | case OP_ATAN: |
4035 | case OP_ATAN: |
|
|
4036 | s_return (mk_real (SCHEME_A_ |
4061 | if (cdr (args) == NIL) |
4037 | cdr (args) == NIL |
4062 | s_return (mk_real (SCHEME_A_ atan (rvalue (x)))); |
4038 | ? atan (rvalue (x)) |
4063 | else |
4039 | : atan2 (rvalue (x), rvalue (cadr (args))))); |
4064 | { |
|
|
4065 | pointer y = cadr (args); |
|
|
4066 | s_return (mk_real (SCHEME_A_ atan2 (rvalue (x), rvalue (y)))); |
|
|
4067 | } |
|
|
4068 | |
|
|
4069 | case OP_SQRT: |
|
|
4070 | s_return (mk_real (SCHEME_A_ sqrt (rvalue (x)))); |
|
|
4071 | |
4040 | |
4072 | case OP_EXPT: |
4041 | case OP_EXPT: |
4073 | { |
4042 | { |
4074 | RVALUE result; |
4043 | RVALUE result; |
4075 | int real_result = 1; |
4044 | int real_result = 1; |
… | |
… | |
4098 | if (real_result) |
4067 | if (real_result) |
4099 | s_return (mk_real (SCHEME_A_ result)); |
4068 | s_return (mk_real (SCHEME_A_ result)); |
4100 | else |
4069 | else |
4101 | s_return (mk_integer (SCHEME_A_ result)); |
4070 | s_return (mk_integer (SCHEME_A_ result)); |
4102 | } |
4071 | } |
4103 | |
|
|
4104 | case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x)))); |
|
|
4105 | case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x)))); |
|
|
4106 | |
|
|
4107 | case OP_TRUNCATE: |
|
|
4108 | { |
|
|
4109 | RVALUE n = rvalue (x); |
|
|
4110 | s_return (mk_real (SCHEME_A_ n > 0 ? floor (n) : ceil (n))); |
|
|
4111 | } |
|
|
4112 | |
|
|
4113 | case OP_ROUND: |
|
|
4114 | if (is_integer (x)) |
|
|
4115 | s_return (x); |
|
|
4116 | |
|
|
4117 | s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x)))); |
|
|
4118 | #endif |
4072 | #endif |
4119 | |
4073 | |
4120 | case OP_ADD: /* + */ |
4074 | case OP_ADD: /* + */ |
4121 | v = num_zero; |
4075 | v = num_zero; |
4122 | |
4076 | |
… | |
… | |
4424 | memcpy (pos, strvalue (car (x)), strlength (car (x))); |
4378 | memcpy (pos, strvalue (car (x)), strlength (car (x))); |
4425 | |
4379 | |
4426 | s_return (newstr); |
4380 | s_return (newstr); |
4427 | } |
4381 | } |
4428 | |
4382 | |
4429 | case OP_SUBSTR: /* substring */ |
4383 | case OP_STRING_COPY: /* substring/string-copy */ |
4430 | { |
4384 | { |
4431 | char *str = strvalue (x); |
4385 | char *str = strvalue (x); |
4432 | int index0 = ivalue_unchecked (cadr (args)); |
4386 | int index0 = cadr (args) == NIL ? 0 : ivalue_unchecked (cadr (args)); |
4433 | int index1; |
4387 | int index1; |
4434 | int len; |
4388 | int len; |
4435 | |
4389 | |
4436 | if (index0 > strlength (x)) |
4390 | if (index0 > strlength (x)) |
4437 | Error_1 ("substring: start out of bounds:", cadr (args)); |
4391 | Error_1 ("string->copy: start out of bounds:", cadr (args)); |
4438 | |
4392 | |
4439 | if (cddr (args) != NIL) |
4393 | if (cddr (args) != NIL) |
4440 | { |
4394 | { |
4441 | index1 = ivalue_unchecked (caddr (args)); |
4395 | index1 = ivalue_unchecked (caddr (args)); |
4442 | |
4396 | |
4443 | if (index1 > strlength (x) || index1 < index0) |
4397 | if (index1 > strlength (x) || index1 < index0) |
4444 | Error_1 ("substring: end out of bounds:", caddr (args)); |
4398 | Error_1 ("string->copy: end out of bounds:", caddr (args)); |
4445 | } |
4399 | } |
4446 | else |
4400 | else |
4447 | index1 = strlength (x); |
4401 | index1 = strlength (x); |
4448 | |
4402 | |
4449 | len = index1 - index0; |
4403 | len = index1 - index0; |
4450 | x = mk_empty_string (SCHEME_A_ len, ' '); |
4404 | x = mk_counted_string (SCHEME_A_ str + index0, len); |
4451 | memcpy (strvalue (x), str + index0, len); |
|
|
4452 | strvalue (x)[len] = 0; |
|
|
4453 | |
4405 | |
4454 | s_return (x); |
4406 | s_return (x); |
4455 | } |
4407 | } |
4456 | |
4408 | |
4457 | case OP_VECTOR: /* vector */ |
4409 | case OP_VECTOR: /* vector */ |
… | |
… | |
4642 | } |
4594 | } |
4643 | else |
4595 | else |
4644 | s_return (SCHEME_V->code); |
4596 | s_return (SCHEME_V->code); |
4645 | |
4597 | |
4646 | case OP_SAVE_FORCED: /* Save forced value replacing promise */ |
4598 | case OP_SAVE_FORCED: /* Save forced value replacing promise */ |
4647 | memcpy (SCHEME_V->code, SCHEME_V->value, sizeof (struct cell)); |
4599 | *CELL (SCHEME_V->code) = *CELL (SCHEME_V->value); |
4648 | s_return (SCHEME_V->value); |
4600 | s_return (SCHEME_V->value); |
4649 | |
4601 | |
4650 | #if USE_PORTS |
4602 | #if USE_PORTS |
|
|
4603 | |
|
|
4604 | case OP_EOF_OBJECT: /* eof-object */ |
|
|
4605 | s_return (S_EOF); |
4651 | |
4606 | |
4652 | case OP_WRITE: /* write */ |
4607 | case OP_WRITE: /* write */ |
4653 | case OP_DISPLAY: /* display */ |
4608 | case OP_DISPLAY: /* display */ |
4654 | case OP_WRITE_CHAR: /* write-char */ |
4609 | case OP_WRITE_CHAR: /* write-char */ |
4655 | if (is_pair (cdr (SCHEME_V->args))) |
4610 | if (is_pair (cdr (SCHEME_V->args))) |
… | |
… | |
4797 | SCHEME_V->gc_verbose = (a != S_F); |
4752 | SCHEME_V->gc_verbose = (a != S_F); |
4798 | s_retbool (was); |
4753 | s_retbool (was); |
4799 | } |
4754 | } |
4800 | |
4755 | |
4801 | case OP_NEWSEGMENT: /* new-segment */ |
4756 | case OP_NEWSEGMENT: /* new-segment */ |
|
|
4757 | #if 0 |
4802 | if (!is_pair (args) || !is_number (a)) |
4758 | if (!is_pair (args) || !is_number (a)) |
4803 | Error_0 ("new-segment: argument must be a number"); |
4759 | Error_0 ("new-segment: argument must be a number"); |
4804 | |
4760 | #endif |
4805 | alloc_cellseg (SCHEME_A_ ivalue (a)); |
4761 | s_retbool (alloc_cellseg (SCHEME_A)); |
4806 | |
|
|
4807 | s_return (S_T); |
|
|
4808 | |
4762 | |
4809 | case OP_OBLIST: /* oblist */ |
4763 | case OP_OBLIST: /* oblist */ |
4810 | s_return (oblist_all_symbols (SCHEME_A)); |
4764 | s_return (oblist_all_symbols (SCHEME_A)); |
4811 | |
4765 | |
4812 | #if USE_PORTS |
4766 | #if USE_PORTS |
… | |
… | |
4882 | s_return (p == NIL ? S_F : p); |
4836 | s_return (p == NIL ? S_F : p); |
4883 | } |
4837 | } |
4884 | |
4838 | |
4885 | case OP_GET_OUTSTRING: /* get-output-string */ |
4839 | case OP_GET_OUTSTRING: /* get-output-string */ |
4886 | { |
4840 | { |
4887 | port *p; |
4841 | port *p = port (a); |
4888 | |
4842 | |
4889 | if ((p = a->object.port)->kind & port_string) |
4843 | if (p->kind & port_string) |
4890 | { |
4844 | { |
4891 | off_t size; |
4845 | off_t size; |
4892 | char *str; |
4846 | char *str; |
4893 | |
4847 | |
4894 | size = p->rep.string.curr - p->rep.string.start + 1; |
4848 | size = p->rep.string.curr - p->rep.string.start + 1; |
… | |
… | |
4999 | int res; |
4953 | int res; |
5000 | |
4954 | |
5001 | if (is_pair (args)) |
4955 | if (is_pair (args)) |
5002 | p = car (args); |
4956 | p = car (args); |
5003 | |
4957 | |
5004 | res = p->object.port->kind & port_string; |
4958 | res = port (p)->kind & port_string; |
5005 | |
4959 | |
5006 | s_retbool (res); |
4960 | s_retbool (res); |
5007 | } |
4961 | } |
5008 | |
4962 | |
5009 | case OP_SET_INPORT: /* set-input-port */ |
4963 | case OP_SET_INPORT: /* set-input-port */ |
… | |
… | |
5549 | if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0)) |
5503 | if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0)) |
5550 | return; |
5504 | return; |
5551 | |
5505 | |
5552 | if (SCHEME_V->no_memory && USE_ERROR_CHECKING) |
5506 | if (SCHEME_V->no_memory && USE_ERROR_CHECKING) |
5553 | { |
5507 | { |
5554 | xwrstr ("No memory!\n"); |
5508 | putstr (SCHEME_A_ "No memory!\n"); |
5555 | return; |
5509 | return; |
5556 | } |
5510 | } |
5557 | } |
5511 | } |
5558 | } |
5512 | } |
5559 | |
5513 | |
… | |
… | |
5699 | SCHEME_V->save_inport = NIL; |
5653 | SCHEME_V->save_inport = NIL; |
5700 | SCHEME_V->loadport = NIL; |
5654 | SCHEME_V->loadport = NIL; |
5701 | SCHEME_V->nesting = 0; |
5655 | SCHEME_V->nesting = 0; |
5702 | SCHEME_V->interactive_repl = 0; |
5656 | SCHEME_V->interactive_repl = 0; |
5703 | |
5657 | |
5704 | if (alloc_cellseg (SCHEME_A_ FIRST_CELLSEGS) != FIRST_CELLSEGS) |
5658 | if (!alloc_cellseg (SCHEME_A)) |
5705 | { |
5659 | { |
5706 | #if USE_ERROR_CHECKING |
5660 | #if USE_ERROR_CHECKING |
5707 | SCHEME_V->no_memory = 1; |
5661 | SCHEME_V->no_memory = 1; |
5708 | return 0; |
5662 | return 0; |
5709 | #endif |
5663 | #endif |
… | |
… | |
6043 | int isfile = 1; |
5997 | int isfile = 1; |
6044 | system ("ps v $PPID");//D |
5998 | system ("ps v $PPID");//D |
6045 | |
5999 | |
6046 | if (argc == 2 && strcmp (argv[1], "-?") == 0) |
6000 | if (argc == 2 && strcmp (argv[1], "-?") == 0) |
6047 | { |
6001 | { |
6048 | xwrstr ("Usage: tinyscheme -?\n"); |
6002 | putstr (SCHEME_A_ "Usage: tinyscheme -?\n"); |
6049 | xwrstr ("or: tinyscheme [<file1> <file2> ...]\n"); |
6003 | putstr (SCHEME_A_ "or: tinyscheme [<file1> <file2> ...]\n"); |
6050 | xwrstr ("followed by\n"); |
6004 | putstr (SCHEME_A_ "followed by\n"); |
6051 | xwrstr (" -1 <file> [<arg1> <arg2> ...]\n"); |
6005 | putstr (SCHEME_A_ " -1 <file> [<arg1> <arg2> ...]\n"); |
6052 | xwrstr (" -c <Scheme commands> [<arg1> <arg2> ...]\n"); |
6006 | putstr (SCHEME_A_ " -c <Scheme commands> [<arg1> <arg2> ...]\n"); |
6053 | xwrstr ("assuming that the executable is named tinyscheme.\n"); |
6007 | putstr (SCHEME_A_ "assuming that the executable is named tinyscheme.\n"); |
6054 | xwrstr ("Use - as filename for stdin.\n"); |
6008 | putstr (SCHEME_A_ "Use - as filename for stdin.\n"); |
6055 | return 1; |
6009 | return 1; |
6056 | } |
6010 | } |
6057 | |
6011 | |
6058 | if (!scheme_init (SCHEME_A)) |
6012 | if (!scheme_init (SCHEME_A)) |
6059 | { |
6013 | { |
6060 | xwrstr ("Could not initialize!\n"); |
6014 | putstr (SCHEME_A_ "Could not initialize!\n"); |
6061 | return 2; |
6015 | return 2; |
6062 | } |
6016 | } |
6063 | |
6017 | |
6064 | # if USE_PORTS |
6018 | # if USE_PORTS |
6065 | scheme_set_input_port_file (SCHEME_A_ STDIN_FILENO); |
6019 | scheme_set_input_port_file (SCHEME_A_ STDIN_FILENO); |
… | |
… | |
6110 | fin = open (file_name, O_RDONLY); |
6064 | fin = open (file_name, O_RDONLY); |
6111 | #endif |
6065 | #endif |
6112 | |
6066 | |
6113 | if (isfile && fin < 0) |
6067 | if (isfile && fin < 0) |
6114 | { |
6068 | { |
6115 | xwrstr ("Could not open file "); xwrstr (file_name); xwrstr ("\n"); |
6069 | putstr (SCHEME_A_ "Could not open file "); putstr (SCHEME_A_ file_name); putstr (SCHEME_A_ "\n"); |
6116 | } |
6070 | } |
6117 | else |
6071 | else |
6118 | { |
6072 | { |
6119 | if (isfile) |
6073 | if (isfile) |
6120 | scheme_load_named_file (SCHEME_A_ fin, file_name); |
6074 | scheme_load_named_file (SCHEME_A_ fin, file_name); |
… | |
… | |
6124 | #if USE_PORTS |
6078 | #if USE_PORTS |
6125 | if (!isfile || fin != STDIN_FILENO) |
6079 | if (!isfile || fin != STDIN_FILENO) |
6126 | { |
6080 | { |
6127 | if (SCHEME_V->retcode != 0) |
6081 | if (SCHEME_V->retcode != 0) |
6128 | { |
6082 | { |
6129 | xwrstr ("Errors encountered reading "); xwrstr (file_name); xwrstr ("\n"); |
6083 | putstr (SCHEME_A_ "Errors encountered reading "); putstr (SCHEME_A_ file_name); putstr (SCHEME_A_ "\n"); |
6130 | } |
6084 | } |
6131 | |
6085 | |
6132 | if (isfile) |
6086 | if (isfile) |
6133 | close (fin); |
6087 | close (fin); |
6134 | } |
6088 | } |