… | |
… | |
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 | |
|
|
23 | #if 1 |
21 | #define PAGE_SIZE 4096 /* does not work on sparc/alpha */ |
24 | #define PAGE_SIZE 4096 /* does not work on sparc/alpha */ |
22 | #include "malloc.c" |
25 | #include "malloc.c" |
|
|
26 | #endif |
23 | |
27 | |
24 | #define SCHEME_SOURCE |
28 | #define SCHEME_SOURCE |
25 | #include "scheme-private.h" |
29 | #include "scheme-private.h" |
26 | #ifndef WIN32 |
30 | #ifndef WIN32 |
27 | # include <unistd.h> |
31 | # include <unistd.h> |
28 | #endif |
32 | #endif |
29 | #if USE_MATH |
33 | #if USE_MATH |
30 | # include <math.h> |
34 | # include <math.h> |
31 | #endif |
35 | #endif |
32 | |
36 | |
|
|
37 | #include "ecb.h" |
|
|
38 | |
33 | #include <sys/types.h> |
39 | #include <sys/types.h> |
34 | #include <sys/stat.h> |
40 | #include <sys/stat.h> |
35 | #include <fcntl.h> |
41 | #include <fcntl.h> |
36 | |
42 | |
|
|
43 | #if !USE_ERROR_CHECKING |
|
|
44 | # define NDEBUG |
|
|
45 | #endif |
|
|
46 | |
|
|
47 | #include <assert.h> |
|
|
48 | #include <stdlib.h> |
37 | #include <string.h> |
49 | #include <string.h> |
38 | #include <stdlib.h> |
|
|
39 | |
50 | |
40 | #include <limits.h> |
51 | #include <limits.h> |
41 | #include <inttypes.h> |
52 | #include <inttypes.h> |
42 | #include <float.h> |
53 | #include <float.h> |
43 | //#include <ctype.h> |
54 | //#include <ctype.h> |
|
|
55 | |
|
|
56 | #if '1' != '0' + 1 \ |
|
|
57 | || '2' != '0' + 2 || '3' != '0' + 3 || '4' != '0' + 4 || '5' != '0' + 5 \ |
|
|
58 | || '6' != '0' + 6 || '7' != '0' + 7 || '8' != '0' + 8 || '9' != '0' + 9 \ |
|
|
59 | || 'b' != 'a' + 1 || 'c' != 'a' + 2 || 'd' != 'a' + 3 || 'e' != 'a' + 4 \ |
|
|
60 | || 'f' != 'a' + 5 |
|
|
61 | # error "execution character set digits not consecutive" |
|
|
62 | #endif |
44 | |
63 | |
45 | enum { |
64 | enum { |
46 | TOK_EOF, |
65 | TOK_EOF, |
47 | TOK_LPAREN, |
66 | TOK_LPAREN, |
48 | TOK_RPAREN, |
67 | TOK_RPAREN, |
49 | TOK_DOT, |
68 | TOK_DOT, |
50 | TOK_ATOM, |
69 | TOK_ATOM, |
|
|
70 | TOK_DOTATOM, /* atom name starting with '.' */ |
|
|
71 | TOK_STRATOM, /* atom name enclosed in | */ |
51 | TOK_QUOTE, |
72 | TOK_QUOTE, |
52 | TOK_DQUOTE, |
73 | TOK_DQUOTE, |
53 | TOK_BQUOTE, |
74 | TOK_BQUOTE, |
54 | TOK_COMMA, |
75 | TOK_COMMA, |
55 | TOK_ATMARK, |
76 | TOK_ATMARK, |
… | |
… | |
57 | TOK_SHARP_CONST, |
78 | TOK_SHARP_CONST, |
58 | TOK_VEC |
79 | TOK_VEC |
59 | }; |
80 | }; |
60 | |
81 | |
61 | #define BACKQUOTE '`' |
82 | #define BACKQUOTE '`' |
62 | #define DELIMITERS "()\";\f\t\v\n\r " |
83 | #define WHITESPACE " \t\r\n\v\f" |
|
|
84 | #define DELIMITERS "()\";" WHITESPACE |
63 | |
85 | |
64 | #define NIL (&SCHEME_V->xNIL) //TODO: make this 0? |
86 | #define NIL POINTER (&SCHEME_V->xNIL) |
65 | #define S_T (&SCHEME_V->xT) //TODO: magic ptr value? |
87 | #define S_T POINTER (&SCHEME_V->xT) |
66 | #define S_F (&SCHEME_V->xF) //TODO: magic ptr value? |
88 | #define S_F POINTER (&SCHEME_V->xF) |
67 | #define S_SINK (&SCHEME_V->xsink) |
89 | #define S_SINK POINTER (&SCHEME_V->xsink) |
68 | #define S_EOF (&SCHEME_V->xEOF_OBJ) |
90 | #define S_EOF POINTER (&SCHEME_V->xEOF_OBJ) |
69 | |
91 | |
70 | #if !USE_MULTIPLICITY |
92 | #if !USE_MULTIPLICITY |
71 | static scheme sc; |
93 | static scheme sc; |
72 | #endif |
94 | #endif |
73 | |
95 | |
… | |
… | |
81 | } |
103 | } |
82 | |
104 | |
83 | char *p = s; |
105 | char *p = s; |
84 | |
106 | |
85 | do { |
107 | do { |
86 | *p++ = '0' + n % base; |
108 | *p++ = "0123456789abcdef"[n % base]; |
87 | n /= base; |
109 | n /= base; |
88 | } while (n); |
110 | } while (n); |
89 | |
111 | |
90 | *p-- = 0; |
112 | *p-- = 0; |
91 | |
113 | |
… | |
… | |
101 | { |
123 | { |
102 | xbase (s, n, 10); |
124 | xbase (s, n, 10); |
103 | } |
125 | } |
104 | |
126 | |
105 | static void |
127 | static void |
106 | xwrstr (const char *s) |
128 | putnum (SCHEME_P_ long n) |
107 | { |
|
|
108 | write (1, s, strlen (s)); |
|
|
109 | } |
|
|
110 | |
|
|
111 | static void |
|
|
112 | xwrnum (long n) |
|
|
113 | { |
129 | { |
114 | char buf[64]; |
130 | char buf[64]; |
115 | |
131 | |
116 | xnum (buf, n); |
132 | xnum (buf, n); |
117 | xwrstr (buf); |
133 | putstr (SCHEME_A_ buf); |
118 | } |
134 | } |
119 | |
135 | |
120 | static char |
136 | static char |
121 | xtoupper (char c) |
137 | xtoupper (char c) |
122 | { |
138 | { |
… | |
… | |
143 | |
159 | |
144 | #define toupper(c) xtoupper (c) |
160 | #define toupper(c) xtoupper (c) |
145 | #define tolower(c) xtolower (c) |
161 | #define tolower(c) xtolower (c) |
146 | #define isdigit(c) xisdigit (c) |
162 | #define isdigit(c) xisdigit (c) |
147 | |
163 | |
148 | #if USE_STRLWR |
164 | #if USE_IGNORECASE |
149 | static const char * |
165 | static const char * |
150 | strlwr (char *s) |
166 | xstrlwr (char *s) |
151 | { |
167 | { |
152 | const char *p = s; |
168 | const char *p = s; |
153 | |
169 | |
154 | while (*s) |
170 | while (*s) |
155 | { |
171 | { |
… | |
… | |
157 | s++; |
173 | s++; |
158 | } |
174 | } |
159 | |
175 | |
160 | return p; |
176 | return p; |
161 | } |
177 | } |
162 | #endif |
|
|
163 | |
178 | |
|
|
179 | #define stricmp(a,b) strcasecmp (a, b) |
|
|
180 | #define strlwr(s) xstrlwr (s) |
|
|
181 | |
|
|
182 | #else |
164 | #define stricmp(a,b) strcmp (a, b) |
183 | # define stricmp(a,b) strcmp (a, b) |
165 | #define strlwr(s) (s) |
184 | # define strlwr(s) (s) |
|
|
185 | #endif |
166 | |
186 | |
167 | #ifndef prompt |
187 | #ifndef prompt |
168 | # define prompt "ts> " |
188 | # define prompt "ts> " |
169 | #endif |
189 | #endif |
170 | |
190 | |
171 | #ifndef InitFile |
191 | #ifndef InitFile |
172 | # define InitFile "init.scm" |
192 | # define InitFile "init.scm" |
173 | #endif |
193 | #endif |
174 | |
194 | |
175 | #ifndef FIRST_CELLSEGS |
|
|
176 | # define FIRST_CELLSEGS 3 |
|
|
177 | #endif |
|
|
178 | |
|
|
179 | enum scheme_types |
195 | enum scheme_types |
180 | { |
196 | { |
|
|
197 | T_INTEGER, |
181 | T_FREE, |
198 | T_REAL, |
182 | T_STRING, |
199 | T_STRING, |
183 | T_NUMBER, |
|
|
184 | T_SYMBOL, |
200 | T_SYMBOL, |
185 | T_PROC, |
201 | T_PROC, |
186 | T_PAIR, |
202 | T_PAIR, /* also used for free cells */ |
187 | T_CLOSURE, |
203 | T_CLOSURE, |
188 | T_CONTINUATION, |
204 | T_CONTINUATION, |
189 | T_FOREIGN, |
205 | T_FOREIGN, |
190 | T_CHARACTER, |
206 | T_CHARACTER, |
191 | T_PORT, |
207 | T_PORT, |
… | |
… | |
201 | #define T_SYNTAX 0x0010 |
217 | #define T_SYNTAX 0x0010 |
202 | #define T_IMMUTABLE 0x0020 |
218 | #define T_IMMUTABLE 0x0020 |
203 | #define T_ATOM 0x0040 /* only for gc */ |
219 | #define T_ATOM 0x0040 /* only for gc */ |
204 | #define T_MARK 0x0080 /* only for gc */ |
220 | #define T_MARK 0x0080 /* only for gc */ |
205 | |
221 | |
206 | static num num_add (num a, num b); |
222 | /* num, for generic arithmetic */ |
207 | static num num_mul (num a, num b); |
223 | struct num |
208 | static num num_div (num a, num b); |
224 | { |
|
|
225 | IVALUE ivalue; |
|
|
226 | #if USE_REAL |
|
|
227 | RVALUE rvalue; |
|
|
228 | char is_fixnum; |
|
|
229 | #endif |
|
|
230 | }; |
|
|
231 | |
|
|
232 | #if USE_REAL |
|
|
233 | # define num_is_fixnum(n) (n).is_fixnum |
|
|
234 | # define num_set_fixnum(n,f) (n).is_fixnum = (f) |
|
|
235 | # define num_ivalue(n) (n).ivalue |
|
|
236 | # define num_rvalue(n) (n).rvalue |
|
|
237 | # define num_set_ivalue(n,i) (n).rvalue = (n).ivalue = (i) |
|
|
238 | # define num_set_rvalue(n,r) (n).rvalue = (r) |
|
|
239 | #else |
|
|
240 | # define num_is_fixnum(n) 1 |
|
|
241 | # define num_set_fixnum(n,f) 0 |
|
|
242 | # define num_ivalue(n) (n).ivalue |
|
|
243 | # define num_rvalue(n) (n).ivalue |
|
|
244 | # define num_set_ivalue(n,i) (n).ivalue = (i) |
|
|
245 | # define num_set_rvalue(n,r) (n).ivalue = (r) |
|
|
246 | #endif |
|
|
247 | |
|
|
248 | enum num_op { NUM_ADD, NUM_SUB, NUM_MUL, NUM_INTDIV }; |
|
|
249 | |
|
|
250 | static num num_op (enum num_op op, num a, num b); |
209 | static num num_intdiv (num a, num b); |
251 | static num num_intdiv (num a, num b); |
210 | static num num_sub (num a, num b); |
|
|
211 | static num num_rem (num a, num b); |
252 | static num num_rem (num a, num b); |
212 | static num num_mod (num a, num b); |
253 | static num num_mod (num a, num b); |
213 | static int num_eq (num a, num b); |
|
|
214 | static int num_gt (num a, num b); |
|
|
215 | static int num_ge (num a, num b); |
|
|
216 | static int num_lt (num a, num b); |
|
|
217 | static int num_le (num a, num b); |
|
|
218 | |
254 | |
219 | #if USE_MATH |
|
|
220 | static double round_per_R5RS (double x); |
|
|
221 | #endif |
|
|
222 | static int is_zero_rvalue (RVALUE x); |
255 | static int is_zero_rvalue (RVALUE x); |
223 | |
|
|
224 | static INLINE int |
|
|
225 | num_is_integer (pointer p) |
|
|
226 | { |
|
|
227 | return num_is_fixnum (p->object.number); |
|
|
228 | } |
|
|
229 | |
256 | |
230 | static num num_zero; |
257 | static num num_zero; |
231 | static num num_one; |
258 | static num num_one; |
232 | |
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 | |
233 | /* macros for cell operations */ |
264 | /* macros for cell operations */ |
234 | #define typeflag(p) ((p)->flag + 0) |
265 | #define typeflag(p) (CELL(p)->flag + 0) |
235 | #define set_typeflag(p,v) ((p)->flag = (v)) |
266 | #define set_typeflag(p,v) (CELL(p)->flag = (v)) |
236 | #define type(p) (typeflag (p) & T_MASKTYPE) |
267 | #define type(p) (typeflag (p) & T_MASKTYPE) |
237 | |
268 | |
238 | INTERFACE INLINE int |
269 | INTERFACE int |
239 | is_string (pointer p) |
270 | is_string (pointer p) |
240 | { |
271 | { |
241 | return type (p) == T_STRING; |
272 | return type (p) == T_STRING; |
242 | } |
273 | } |
243 | |
274 | |
244 | #define strvalue(p) ((p)->object.string.svalue) |
275 | #define strvalue(p) (CELL(p)->object.string.svalue) |
245 | #define strlength(p) ((p)->object.string.length) |
276 | #define strlength(p) (CELL(p)->object.string.length) |
246 | |
277 | |
247 | INTERFACE int is_list (SCHEME_P_ pointer p); |
|
|
248 | INTERFACE INLINE int |
278 | INTERFACE int |
249 | is_vector (pointer p) |
279 | is_vector (pointer p) |
250 | { |
280 | { |
251 | return type (p) == T_VECTOR; |
281 | return type (p) == T_VECTOR; |
252 | } |
282 | } |
253 | |
283 | |
254 | #define vecvalue(p) ((p)->object.vector.vvalue) |
284 | #define vecvalue(p) (CELL(p)->object.vector.vvalue) |
255 | #define veclength(p) ((p)->object.vector.length) |
285 | #define veclength(p) (CELL(p)->object.vector.length) |
256 | INTERFACE void fill_vector (pointer vec, pointer obj); |
286 | INTERFACE void fill_vector (pointer vec, uint32_t start, pointer obj); |
257 | INTERFACE uint32_t vector_length (pointer vec); |
|
|
258 | INTERFACE pointer vector_elem (pointer vec, uint32_t ielem); |
287 | INTERFACE pointer vector_get (pointer vec, uint32_t ielem); |
259 | INTERFACE void set_vector_elem (pointer vec, uint32_t ielem, pointer a); |
288 | INTERFACE void vector_set (pointer vec, uint32_t ielem, pointer a); |
260 | |
289 | |
261 | INTERFACE uint32_t |
290 | INTERFACE int |
262 | vector_length (pointer vec) |
291 | is_integer (pointer p) |
263 | { |
292 | { |
264 | return vec->object.vector.length; |
293 | return type (p) == T_INTEGER; |
265 | } |
294 | } |
266 | |
295 | |
|
|
296 | /* not the same as in scheme, where integers are (correctly :) reals */ |
267 | INTERFACE INLINE int |
297 | INTERFACE int |
|
|
298 | is_real (pointer p) |
|
|
299 | { |
|
|
300 | return type (p) == T_REAL; |
|
|
301 | } |
|
|
302 | |
|
|
303 | INTERFACE int |
268 | is_number (pointer p) |
304 | is_number (pointer p) |
269 | { |
305 | { |
270 | return type (p) == T_NUMBER; |
306 | return is_integer (p) || is_real (p); |
271 | } |
307 | } |
272 | |
308 | |
273 | INTERFACE INLINE int |
309 | INTERFACE int |
274 | is_integer (pointer p) |
|
|
275 | { |
|
|
276 | if (!is_number (p)) |
|
|
277 | return 0; |
|
|
278 | |
|
|
279 | if (num_is_integer (p) || ivalue (p) == rvalue (p)) |
|
|
280 | return 1; |
|
|
281 | |
|
|
282 | return 0; |
|
|
283 | } |
|
|
284 | |
|
|
285 | INTERFACE INLINE int |
|
|
286 | is_real (pointer p) |
|
|
287 | { |
|
|
288 | return is_number (p) && !num_is_fixnum (p->object.number); |
|
|
289 | } |
|
|
290 | |
|
|
291 | INTERFACE INLINE int |
|
|
292 | is_character (pointer p) |
310 | is_character (pointer p) |
293 | { |
311 | { |
294 | return type (p) == T_CHARACTER; |
312 | return type (p) == T_CHARACTER; |
295 | } |
313 | } |
296 | |
314 | |
297 | INTERFACE INLINE char * |
315 | INTERFACE char * |
298 | string_value (pointer p) |
316 | string_value (pointer p) |
299 | { |
317 | { |
300 | return strvalue (p); |
318 | return strvalue (p); |
301 | } |
319 | } |
302 | |
320 | |
303 | INLINE num |
|
|
304 | nvalue (pointer p) |
|
|
305 | { |
|
|
306 | return (p)->object.number; |
|
|
307 | } |
|
|
308 | |
|
|
309 | static IVALUE |
|
|
310 | num_get_ivalue (const num n) |
|
|
311 | { |
|
|
312 | return num_is_fixnum (n) ? num_ivalue (n) : (IVALUE)num_rvalue (n); |
|
|
313 | } |
|
|
314 | |
|
|
315 | static RVALUE |
|
|
316 | num_get_rvalue (const num n) |
|
|
317 | { |
|
|
318 | return num_is_fixnum (n) ? (RVALUE)num_ivalue (n) : num_rvalue (n); |
|
|
319 | } |
|
|
320 | |
|
|
321 | INTERFACE IVALUE |
|
|
322 | ivalue (pointer p) |
|
|
323 | { |
|
|
324 | return num_get_ivalue (p->object.number); |
|
|
325 | } |
|
|
326 | |
|
|
327 | INTERFACE RVALUE |
|
|
328 | rvalue (pointer p) |
|
|
329 | { |
|
|
330 | return num_get_rvalue (p->object.number); |
|
|
331 | } |
|
|
332 | |
|
|
333 | #define ivalue_unchecked(p) ((p)->object.number.value.ivalue) |
321 | #define ivalue_unchecked(p) CELL(p)->object.ivalue |
|
|
322 | #define set_ivalue(p,v) CELL(p)->object.ivalue = (v) |
|
|
323 | |
334 | #if USE_REAL |
324 | #if USE_REAL |
335 | # define rvalue_unchecked(p) ((p)->object.number.value.rvalue) |
325 | #define rvalue_unchecked(p) CELL(p)->object.rvalue |
336 | # define set_num_integer(p) (p)->object.number.is_fixnum=1; |
326 | #define set_rvalue(p,v) CELL(p)->object.rvalue = (v) |
337 | # define set_num_real(p) (p)->object.number.is_fixnum=0; |
|
|
338 | #else |
327 | #else |
339 | # define rvalue_unchecked(p) ((p)->object.number.value.ivalue) |
328 | #define rvalue_unchecked(p) CELL(p)->object.ivalue |
340 | # define set_num_integer(p) 0 |
329 | #define set_rvalue(p,v) CELL(p)->object.ivalue = (v) |
341 | # define set_num_real(p) 0 |
|
|
342 | #endif |
330 | #endif |
|
|
331 | |
343 | INTERFACE long |
332 | INTERFACE long |
344 | charvalue (pointer p) |
333 | charvalue (pointer p) |
345 | { |
334 | { |
346 | return ivalue_unchecked (p); |
335 | return ivalue_unchecked (p); |
347 | } |
336 | } |
348 | |
337 | |
|
|
338 | #define port(p) CELL(p)->object.port |
|
|
339 | #define set_port(p,v) port(p) = (v) |
349 | INTERFACE INLINE int |
340 | INTERFACE int |
350 | is_port (pointer p) |
341 | is_port (pointer p) |
351 | { |
342 | { |
352 | return type (p) == T_PORT; |
343 | return type (p) == T_PORT; |
353 | } |
344 | } |
354 | |
345 | |
355 | INTERFACE INLINE int |
346 | INTERFACE int |
356 | is_inport (pointer p) |
347 | is_inport (pointer p) |
357 | { |
348 | { |
358 | return is_port (p) && p->object.port->kind & port_input; |
349 | return is_port (p) && port (p)->kind & port_input; |
359 | } |
350 | } |
360 | |
351 | |
361 | INTERFACE INLINE int |
352 | INTERFACE int |
362 | is_outport (pointer p) |
353 | is_outport (pointer p) |
363 | { |
354 | { |
364 | return is_port (p) && p->object.port->kind & port_output; |
355 | return is_port (p) && port (p)->kind & port_output; |
365 | } |
356 | } |
366 | |
357 | |
367 | INTERFACE INLINE int |
358 | INTERFACE int |
368 | is_pair (pointer p) |
359 | is_pair (pointer p) |
369 | { |
360 | { |
370 | return type (p) == T_PAIR; |
361 | return type (p) == T_PAIR; |
371 | } |
362 | } |
372 | |
363 | |
373 | #define car(p) ((p)->object.cons.car + 0) |
364 | #define car(p) (POINTER (CELL(p)->object.cons.car)) |
374 | #define cdr(p) ((p)->object.cons.cdr) /* find_consecutive_cells uses &cdr */ |
365 | #define cdr(p) (POINTER (CELL(p)->object.cons.cdr)) |
375 | |
366 | |
376 | #define caar(p) car (car (p)) |
367 | static pointer caar (pointer p) { return car (car (p)); } |
377 | #define cadr(p) car (cdr (p)) |
368 | static pointer cadr (pointer p) { return car (cdr (p)); } |
378 | #define cdar(p) cdr (car (p)) |
369 | static pointer cdar (pointer p) { return cdr (car (p)); } |
379 | #define cddr(p) cdr (cdr (p)) |
370 | static pointer cddr (pointer p) { return cdr (cdr (p)); } |
380 | |
371 | |
381 | #define cadar(p) car (cdr (car (p))) |
372 | static pointer cadar (pointer p) { return car (cdr (car (p))); } |
382 | #define caddr(p) car (cdr (cdr (p))) |
373 | static pointer caddr (pointer p) { return car (cdr (cdr (p))); } |
383 | #define cdaar(p) cdr (car (car (p))) |
374 | static pointer cdaar (pointer p) { return cdr (car (car (p))); } |
384 | |
375 | |
385 | INTERFACE void |
376 | INTERFACE void |
386 | set_car (pointer p, pointer q) |
377 | set_car (pointer p, pointer q) |
387 | { |
378 | { |
388 | p->object.cons.car = q; |
379 | CELL(p)->object.cons.car = CELL (q); |
389 | } |
380 | } |
390 | |
381 | |
391 | INTERFACE void |
382 | INTERFACE void |
392 | set_cdr (pointer p, pointer q) |
383 | set_cdr (pointer p, pointer q) |
393 | { |
384 | { |
394 | p->object.cons.cdr = q; |
385 | CELL(p)->object.cons.cdr = CELL (q); |
395 | } |
386 | } |
396 | |
387 | |
397 | INTERFACE pointer |
388 | INTERFACE pointer |
398 | pair_car (pointer p) |
389 | pair_car (pointer p) |
399 | { |
390 | { |
… | |
… | |
404 | pair_cdr (pointer p) |
395 | pair_cdr (pointer p) |
405 | { |
396 | { |
406 | return cdr (p); |
397 | return cdr (p); |
407 | } |
398 | } |
408 | |
399 | |
409 | INTERFACE INLINE int |
400 | INTERFACE int |
410 | is_symbol (pointer p) |
401 | is_symbol (pointer p) |
411 | { |
402 | { |
412 | return type (p) == T_SYMBOL; |
403 | return type (p) == T_SYMBOL; |
413 | } |
404 | } |
414 | |
405 | |
415 | INTERFACE INLINE char * |
406 | INTERFACE char * |
416 | symname (pointer p) |
407 | symname (pointer p) |
417 | { |
408 | { |
418 | return strvalue (car (p)); |
409 | return strvalue (p); |
419 | } |
410 | } |
420 | |
411 | |
421 | #if USE_PLIST |
412 | #if USE_PLIST |
|
|
413 | #error plists are broken because symbols are no longer pairs |
|
|
414 | #define symprop(p) cdr(p) |
422 | SCHEME_EXPORT INLINE int |
415 | SCHEME_EXPORT int |
423 | hasprop (pointer p) |
416 | hasprop (pointer p) |
424 | { |
417 | { |
425 | return typeflag (p) & T_SYMBOL; |
418 | return typeflag (p) & T_SYMBOL; |
426 | } |
419 | } |
427 | |
|
|
428 | # define symprop(p) cdr(p) |
|
|
429 | #endif |
420 | #endif |
430 | |
421 | |
431 | INTERFACE INLINE int |
422 | INTERFACE int |
432 | is_syntax (pointer p) |
423 | is_syntax (pointer p) |
433 | { |
424 | { |
434 | return typeflag (p) & T_SYNTAX; |
425 | return typeflag (p) & T_SYNTAX; |
435 | } |
426 | } |
436 | |
427 | |
437 | INTERFACE INLINE int |
428 | INTERFACE int |
438 | is_proc (pointer p) |
429 | is_proc (pointer p) |
439 | { |
430 | { |
440 | return type (p) == T_PROC; |
431 | return type (p) == T_PROC; |
441 | } |
432 | } |
442 | |
433 | |
443 | INTERFACE INLINE int |
434 | INTERFACE int |
444 | is_foreign (pointer p) |
435 | is_foreign (pointer p) |
445 | { |
436 | { |
446 | return type (p) == T_FOREIGN; |
437 | return type (p) == T_FOREIGN; |
447 | } |
438 | } |
448 | |
439 | |
449 | INTERFACE INLINE char * |
440 | INTERFACE char * |
450 | syntaxname (pointer p) |
441 | syntaxname (pointer p) |
451 | { |
442 | { |
452 | return strvalue (car (p)); |
443 | return strvalue (p); |
453 | } |
444 | } |
454 | |
445 | |
455 | #define procnum(p) ivalue (p) |
446 | #define procnum(p) ivalue_unchecked (p) |
456 | static const char *procname (pointer x); |
447 | static const char *procname (pointer x); |
457 | |
448 | |
458 | INTERFACE INLINE int |
449 | INTERFACE int |
459 | is_closure (pointer p) |
450 | is_closure (pointer p) |
460 | { |
451 | { |
461 | return type (p) == T_CLOSURE; |
452 | return type (p) == T_CLOSURE; |
462 | } |
453 | } |
463 | |
454 | |
464 | INTERFACE INLINE int |
455 | INTERFACE int |
465 | is_macro (pointer p) |
456 | is_macro (pointer p) |
466 | { |
457 | { |
467 | return type (p) == T_MACRO; |
458 | return type (p) == T_MACRO; |
468 | } |
459 | } |
469 | |
460 | |
470 | INTERFACE INLINE pointer |
461 | INTERFACE pointer |
471 | closure_code (pointer p) |
462 | closure_code (pointer p) |
472 | { |
463 | { |
473 | return car (p); |
464 | return car (p); |
474 | } |
465 | } |
475 | |
466 | |
476 | INTERFACE INLINE pointer |
467 | INTERFACE pointer |
477 | closure_env (pointer p) |
468 | closure_env (pointer p) |
478 | { |
469 | { |
479 | return cdr (p); |
470 | return cdr (p); |
480 | } |
471 | } |
481 | |
472 | |
482 | INTERFACE INLINE int |
473 | INTERFACE int |
483 | is_continuation (pointer p) |
474 | is_continuation (pointer p) |
484 | { |
475 | { |
485 | return type (p) == T_CONTINUATION; |
476 | return type (p) == T_CONTINUATION; |
486 | } |
477 | } |
487 | |
478 | |
488 | #define cont_dump(p) cdr (p) |
479 | #define cont_dump(p) cdr (p) |
489 | #define set_cont_dump(p,v) set_cdr ((p), (v)) |
480 | #define set_cont_dump(p,v) set_cdr ((p), (v)) |
490 | |
481 | |
491 | /* To do: promise should be forced ONCE only */ |
482 | /* To do: promise should be forced ONCE only */ |
492 | INTERFACE INLINE int |
483 | INTERFACE int |
493 | is_promise (pointer p) |
484 | is_promise (pointer p) |
494 | { |
485 | { |
495 | return type (p) == T_PROMISE; |
486 | return type (p) == T_PROMISE; |
496 | } |
487 | } |
497 | |
488 | |
498 | INTERFACE INLINE int |
489 | INTERFACE int |
499 | is_environment (pointer p) |
490 | is_environment (pointer p) |
500 | { |
491 | { |
501 | return type (p) == T_ENVIRONMENT; |
492 | return type (p) == T_ENVIRONMENT; |
502 | } |
493 | } |
503 | |
494 | |
… | |
… | |
509 | |
500 | |
510 | #define is_mark(p) (typeflag (p) & T_MARK) |
501 | #define is_mark(p) (typeflag (p) & T_MARK) |
511 | #define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK) |
502 | #define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK) |
512 | #define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK) |
503 | #define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK) |
513 | |
504 | |
514 | INTERFACE INLINE int |
505 | INTERFACE int |
515 | is_immutable (pointer p) |
506 | is_immutable (pointer p) |
516 | { |
507 | { |
517 | return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING; |
508 | return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING; |
518 | } |
509 | } |
519 | |
510 | |
520 | INTERFACE INLINE void |
511 | INTERFACE void |
521 | setimmutable (pointer p) |
512 | setimmutable (pointer p) |
522 | { |
513 | { |
523 | #if USE_ERROR_CHECKING |
514 | #if USE_ERROR_CHECKING |
524 | set_typeflag (p, typeflag (p) | T_IMMUTABLE); |
515 | set_typeflag (p, typeflag (p) | T_IMMUTABLE); |
525 | #endif |
516 | #endif |
526 | } |
517 | } |
527 | |
518 | |
|
|
519 | /* Result is: |
|
|
520 | proper list: length |
|
|
521 | circular list: -1 |
|
|
522 | not even a pair: -2 |
|
|
523 | dotted list: -2 minus length before dot |
|
|
524 | */ |
|
|
525 | INTERFACE int |
|
|
526 | list_length (SCHEME_P_ pointer a) |
|
|
527 | { |
|
|
528 | int i = 0; |
|
|
529 | pointer slow, fast; |
|
|
530 | |
|
|
531 | slow = fast = a; |
|
|
532 | |
|
|
533 | while (1) |
|
|
534 | { |
|
|
535 | if (fast == NIL) |
|
|
536 | return i; |
|
|
537 | |
|
|
538 | if (!is_pair (fast)) |
|
|
539 | return -2 - i; |
|
|
540 | |
|
|
541 | fast = cdr (fast); |
|
|
542 | ++i; |
|
|
543 | |
|
|
544 | if (fast == NIL) |
|
|
545 | return i; |
|
|
546 | |
|
|
547 | if (!is_pair (fast)) |
|
|
548 | return -2 - i; |
|
|
549 | |
|
|
550 | ++i; |
|
|
551 | fast = cdr (fast); |
|
|
552 | |
|
|
553 | /* Safe because we would have already returned if `fast' |
|
|
554 | encountered a non-pair. */ |
|
|
555 | slow = cdr (slow); |
|
|
556 | |
|
|
557 | if (fast == slow) |
|
|
558 | { |
|
|
559 | /* the fast pointer has looped back around and caught up |
|
|
560 | with the slow pointer, hence the structure is circular, |
|
|
561 | not of finite length, and therefore not a list */ |
|
|
562 | return -1; |
|
|
563 | } |
|
|
564 | } |
|
|
565 | } |
|
|
566 | |
|
|
567 | INTERFACE int |
|
|
568 | is_list (SCHEME_P_ pointer a) |
|
|
569 | { |
|
|
570 | return list_length (SCHEME_A_ a) >= 0; |
|
|
571 | } |
|
|
572 | |
528 | #if USE_CHAR_CLASSIFIERS |
573 | #if USE_CHAR_CLASSIFIERS |
529 | static INLINE int |
574 | ecb_inline int |
530 | Cisalpha (int c) |
575 | Cisalpha (int c) |
531 | { |
576 | { |
532 | return isascii (c) && isalpha (c); |
577 | return isascii (c) && isalpha (c); |
533 | } |
578 | } |
534 | |
579 | |
535 | static INLINE int |
580 | ecb_inline int |
536 | Cisdigit (int c) |
581 | Cisdigit (int c) |
537 | { |
582 | { |
538 | return isascii (c) && isdigit (c); |
583 | return isascii (c) && isdigit (c); |
539 | } |
584 | } |
540 | |
585 | |
541 | static INLINE int |
586 | ecb_inline int |
542 | Cisspace (int c) |
587 | Cisspace (int c) |
543 | { |
588 | { |
544 | return isascii (c) && isspace (c); |
589 | return isascii (c) && isspace (c); |
545 | } |
590 | } |
546 | |
591 | |
547 | static INLINE int |
592 | ecb_inline int |
548 | Cisupper (int c) |
593 | Cisupper (int c) |
549 | { |
594 | { |
550 | return isascii (c) && isupper (c); |
595 | return isascii (c) && isupper (c); |
551 | } |
596 | } |
552 | |
597 | |
553 | static INLINE int |
598 | ecb_inline int |
554 | Cislower (int c) |
599 | Cislower (int c) |
555 | { |
600 | { |
556 | return isascii (c) && islower (c); |
601 | return isascii (c) && islower (c); |
557 | } |
602 | } |
558 | #endif |
603 | #endif |
… | |
… | |
619 | #endif |
664 | #endif |
620 | |
665 | |
621 | static int file_push (SCHEME_P_ const char *fname); |
666 | static int file_push (SCHEME_P_ const char *fname); |
622 | static void file_pop (SCHEME_P); |
667 | static void file_pop (SCHEME_P); |
623 | static int file_interactive (SCHEME_P); |
668 | static int file_interactive (SCHEME_P); |
624 | static INLINE int is_one_of (char *s, int c); |
669 | ecb_inline int is_one_of (const char *s, int c); |
625 | static int alloc_cellseg (SCHEME_P_ int n); |
670 | static int alloc_cellseg (SCHEME_P); |
626 | static INLINE pointer get_cell (SCHEME_P_ pointer a, pointer b); |
671 | ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b); |
627 | static void finalize_cell (SCHEME_P_ pointer a); |
672 | static void finalize_cell (SCHEME_P_ pointer a); |
628 | static int count_consecutive_cells (pointer x, int needed); |
673 | static int count_consecutive_cells (pointer x, int needed); |
629 | 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); |
630 | static pointer mk_number (SCHEME_P_ const num n); |
675 | static pointer mk_number (SCHEME_P_ const num n); |
631 | static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill); |
676 | static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill); |
… | |
… | |
646 | static void mark (pointer a); |
691 | static void mark (pointer a); |
647 | static void gc (SCHEME_P_ pointer a, pointer b); |
692 | static void gc (SCHEME_P_ pointer a, pointer b); |
648 | static int basic_inchar (port *pt); |
693 | static int basic_inchar (port *pt); |
649 | static int inchar (SCHEME_P); |
694 | static int inchar (SCHEME_P); |
650 | static void backchar (SCHEME_P_ int c); |
695 | static void backchar (SCHEME_P_ int c); |
651 | static char *readstr_upto (SCHEME_P_ char *delim); |
696 | static char *readstr_upto (SCHEME_P_ int skip, const char *delim); |
652 | static pointer readstrexp (SCHEME_P); |
697 | static pointer readstrexp (SCHEME_P_ char delim); |
653 | static INLINE int skipspace (SCHEME_P); |
698 | ecb_inline int skipspace (SCHEME_P); |
654 | static int token (SCHEME_P); |
699 | static int token (SCHEME_P); |
655 | static void printslashstring (SCHEME_P_ char *s, int len); |
700 | static void printslashstring (SCHEME_P_ char *s, int len); |
656 | static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen); |
701 | static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen); |
657 | static void printatom (SCHEME_P_ pointer l, int f); |
702 | static void printatom (SCHEME_P_ pointer l, int f); |
658 | static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op); |
703 | static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op); |
… | |
… | |
662 | static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list); |
707 | static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list); |
663 | static pointer revappend (SCHEME_P_ pointer a, pointer b); |
708 | static pointer revappend (SCHEME_P_ pointer a, pointer b); |
664 | static pointer ss_get_cont (SCHEME_P); |
709 | static pointer ss_get_cont (SCHEME_P); |
665 | static void ss_set_cont (SCHEME_P_ pointer cont); |
710 | static void ss_set_cont (SCHEME_P_ pointer cont); |
666 | static void dump_stack_mark (SCHEME_P); |
711 | static void dump_stack_mark (SCHEME_P); |
667 | static pointer opexe_0 (SCHEME_P_ enum scheme_opcodes op); |
712 | static int opexe_0 (SCHEME_P_ enum scheme_opcodes op); |
|
|
713 | static int opexe_1 (SCHEME_P_ enum scheme_opcodes op); |
668 | static pointer opexe_2 (SCHEME_P_ enum scheme_opcodes op); |
714 | static int opexe_2 (SCHEME_P_ enum scheme_opcodes op); |
669 | static pointer opexe_3 (SCHEME_P_ enum scheme_opcodes op); |
715 | static int opexe_3 (SCHEME_P_ enum scheme_opcodes op); |
670 | static pointer opexe_4 (SCHEME_P_ enum scheme_opcodes op); |
716 | static int opexe_4 (SCHEME_P_ enum scheme_opcodes op); |
671 | static pointer opexe_5 (SCHEME_P_ enum scheme_opcodes op); |
717 | static int opexe_5 (SCHEME_P_ enum scheme_opcodes op); |
672 | static pointer opexe_6 (SCHEME_P_ enum scheme_opcodes op); |
718 | static int opexe_6 (SCHEME_P_ enum scheme_opcodes op); |
673 | static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op); |
719 | static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op); |
674 | static void assign_syntax (SCHEME_P_ const char *name); |
720 | static void assign_syntax (SCHEME_P_ const char *name); |
675 | static int syntaxnum (pointer p); |
721 | static int syntaxnum (pointer p); |
676 | static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name); |
722 | static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name); |
677 | |
723 | |
|
|
724 | static IVALUE |
|
|
725 | ivalue (pointer x) |
|
|
726 | { |
|
|
727 | return is_integer (x) ? ivalue_unchecked (x) : rvalue_unchecked (x); |
|
|
728 | } |
|
|
729 | |
|
|
730 | static RVALUE |
|
|
731 | rvalue (pointer x) |
|
|
732 | { |
|
|
733 | return is_integer (x) ? ivalue_unchecked (x) : rvalue_unchecked (x); |
|
|
734 | } |
|
|
735 | |
|
|
736 | INTERFACE num |
|
|
737 | nvalue (pointer x) |
|
|
738 | { |
|
|
739 | num n; |
|
|
740 | |
|
|
741 | num_set_fixnum (n, is_integer (x)); |
|
|
742 | |
|
|
743 | if (num_is_fixnum (n)) |
|
|
744 | num_set_ivalue (n, ivalue_unchecked (x)); |
|
|
745 | else |
|
|
746 | num_set_rvalue (n, rvalue_unchecked (x)); |
|
|
747 | |
|
|
748 | return n; |
|
|
749 | } |
|
|
750 | |
678 | static num |
751 | static num |
679 | num_add (num a, num b) |
752 | num_op (enum num_op op, num a, num b) |
680 | { |
753 | { |
681 | num ret; |
754 | num ret; |
682 | |
755 | |
683 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
756 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
684 | |
757 | |
685 | if (num_is_fixnum (ret)) |
758 | if (num_is_fixnum (ret)) |
686 | num_set_ivalue (ret, num_get_ivalue (a) + num_get_ivalue (b)); |
759 | { |
|
|
760 | switch (op) |
|
|
761 | { |
|
|
762 | case NUM_ADD: a.ivalue += b.ivalue; break; |
|
|
763 | case NUM_SUB: a.ivalue -= b.ivalue; break; |
|
|
764 | case NUM_MUL: a.ivalue *= b.ivalue; break; |
|
|
765 | case NUM_INTDIV: a.ivalue /= b.ivalue; break; |
|
|
766 | } |
|
|
767 | |
|
|
768 | num_set_ivalue (ret, a.ivalue); |
|
|
769 | } |
|
|
770 | #if USE_REAL |
687 | else |
771 | else |
688 | num_set_rvalue (ret, num_get_rvalue (a) + num_get_rvalue (b)); |
772 | { |
|
|
773 | switch (op) |
|
|
774 | { |
|
|
775 | case NUM_ADD: a.rvalue += b.rvalue; break; |
|
|
776 | case NUM_SUB: a.rvalue -= b.rvalue; break; |
|
|
777 | case NUM_MUL: a.rvalue *= b.rvalue; break; |
|
|
778 | case NUM_INTDIV: a.rvalue /= b.rvalue; break; |
|
|
779 | } |
689 | |
780 | |
690 | return ret; |
781 | num_set_rvalue (ret, a.rvalue); |
691 | } |
782 | } |
692 | |
783 | #endif |
693 | static num |
|
|
694 | num_mul (num a, num b) |
|
|
695 | { |
|
|
696 | num ret; |
|
|
697 | |
|
|
698 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
|
|
699 | |
|
|
700 | if (num_is_fixnum (ret)) |
|
|
701 | num_set_ivalue (ret, num_get_ivalue (a) * num_get_ivalue (b)); |
|
|
702 | else |
|
|
703 | num_set_rvalue (ret, num_get_rvalue (a) * num_get_rvalue (b)); |
|
|
704 | |
784 | |
705 | return ret; |
785 | return ret; |
706 | } |
786 | } |
707 | |
787 | |
708 | static num |
788 | static num |
709 | num_div (num a, num b) |
789 | num_div (num a, num b) |
710 | { |
790 | { |
711 | num ret; |
791 | num ret; |
712 | |
792 | |
713 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_get_ivalue (a) % num_get_ivalue (b) == 0); |
793 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_ivalue (a) % num_ivalue (b) == 0); |
714 | |
794 | |
715 | if (num_is_fixnum (ret)) |
795 | if (num_is_fixnum (ret)) |
716 | num_set_ivalue (ret, num_get_ivalue (a) / num_get_ivalue (b)); |
796 | num_set_ivalue (ret, num_ivalue (a) / num_ivalue (b)); |
717 | else |
797 | else |
718 | num_set_rvalue (ret, num_get_rvalue (a) / num_get_rvalue (b)); |
798 | num_set_rvalue (ret, num_rvalue (a) / num_rvalue (b)); |
719 | |
|
|
720 | return ret; |
|
|
721 | } |
|
|
722 | |
|
|
723 | static num |
|
|
724 | num_intdiv (num a, num b) |
|
|
725 | { |
|
|
726 | num ret; |
|
|
727 | |
|
|
728 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
|
|
729 | |
|
|
730 | if (num_is_fixnum (ret)) |
|
|
731 | num_set_ivalue (ret, num_get_ivalue (a) / num_get_ivalue (b)); |
|
|
732 | else |
|
|
733 | num_set_rvalue (ret, num_get_rvalue (a) / num_get_rvalue (b)); |
|
|
734 | |
|
|
735 | return ret; |
|
|
736 | } |
|
|
737 | |
|
|
738 | static num |
|
|
739 | num_sub (num a, num b) |
|
|
740 | { |
|
|
741 | num ret; |
|
|
742 | |
|
|
743 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
|
|
744 | |
|
|
745 | if (num_is_fixnum (ret)) |
|
|
746 | num_set_ivalue (ret, num_get_ivalue (a) - num_get_ivalue (b)); |
|
|
747 | else |
|
|
748 | num_set_rvalue (ret, num_get_rvalue (a) - num_get_rvalue (b)); |
|
|
749 | |
799 | |
750 | return ret; |
800 | return ret; |
751 | } |
801 | } |
752 | |
802 | |
753 | static num |
803 | static num |
… | |
… | |
755 | { |
805 | { |
756 | num ret; |
806 | num ret; |
757 | long e1, e2, res; |
807 | long e1, e2, res; |
758 | |
808 | |
759 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
809 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
760 | e1 = num_get_ivalue (a); |
810 | e1 = num_ivalue (a); |
761 | e2 = num_get_ivalue (b); |
811 | e2 = num_ivalue (b); |
762 | res = e1 % e2; |
812 | res = e1 % e2; |
763 | |
813 | |
764 | /* remainder should have same sign as second operand */ |
814 | /* remainder should have same sign as second operand */ |
765 | if (res > 0) |
815 | if (res > 0) |
766 | { |
816 | { |
… | |
… | |
782 | { |
832 | { |
783 | num ret; |
833 | num ret; |
784 | long e1, e2, res; |
834 | long e1, e2, res; |
785 | |
835 | |
786 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
836 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
787 | e1 = num_get_ivalue (a); |
837 | e1 = num_ivalue (a); |
788 | e2 = num_get_ivalue (b); |
838 | e2 = num_ivalue (b); |
789 | res = e1 % e2; |
839 | res = e1 % e2; |
790 | |
840 | |
791 | /* modulo should have same sign as second operand */ |
841 | /* modulo should have same sign as second operand */ |
792 | if (res * e2 < 0) |
842 | if (res * e2 < 0) |
793 | res += e2; |
843 | res += e2; |
794 | |
844 | |
795 | num_set_ivalue (ret, res); |
845 | num_set_ivalue (ret, res); |
796 | return ret; |
846 | return ret; |
797 | } |
847 | } |
798 | |
848 | |
|
|
849 | /* this completely disrespects NaNs, but r5rs doesn't even allow NaNs */ |
799 | static int |
850 | static int |
800 | num_eq (num a, num b) |
851 | num_cmp (num a, num b) |
801 | { |
852 | { |
|
|
853 | int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b); |
802 | int ret; |
854 | int ret; |
803 | int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b); |
|
|
804 | |
855 | |
805 | if (is_fixnum) |
856 | if (is_fixnum) |
806 | ret = num_get_ivalue (a) == num_get_ivalue (b); |
857 | { |
|
|
858 | IVALUE av = num_ivalue (a); |
|
|
859 | IVALUE bv = num_ivalue (b); |
|
|
860 | |
|
|
861 | ret = av == bv ? 0 : av < bv ? -1 : +1; |
|
|
862 | } |
807 | else |
863 | else |
808 | ret = num_get_rvalue (a) == num_get_rvalue (b); |
864 | { |
|
|
865 | RVALUE av = num_rvalue (a); |
|
|
866 | RVALUE bv = num_rvalue (b); |
|
|
867 | |
|
|
868 | ret = av == bv ? 0 : av < bv ? -1 : +1; |
|
|
869 | } |
809 | |
870 | |
810 | return ret; |
871 | return ret; |
811 | } |
872 | } |
812 | |
|
|
813 | |
|
|
814 | static int |
|
|
815 | num_gt (num a, num b) |
|
|
816 | { |
|
|
817 | int ret; |
|
|
818 | int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b); |
|
|
819 | |
|
|
820 | if (is_fixnum) |
|
|
821 | ret = num_get_ivalue (a) > num_get_ivalue (b); |
|
|
822 | else |
|
|
823 | ret = num_get_rvalue (a) > num_get_rvalue (b); |
|
|
824 | |
|
|
825 | return ret; |
|
|
826 | } |
|
|
827 | |
|
|
828 | static int |
|
|
829 | num_ge (num a, num b) |
|
|
830 | { |
|
|
831 | return !num_lt (a, b); |
|
|
832 | } |
|
|
833 | |
|
|
834 | static int |
|
|
835 | num_lt (num a, num b) |
|
|
836 | { |
|
|
837 | int ret; |
|
|
838 | int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b); |
|
|
839 | |
|
|
840 | if (is_fixnum) |
|
|
841 | ret = num_get_ivalue (a) < num_get_ivalue (b); |
|
|
842 | else |
|
|
843 | ret = num_get_rvalue (a) < num_get_rvalue (b); |
|
|
844 | |
|
|
845 | return ret; |
|
|
846 | } |
|
|
847 | |
|
|
848 | static int |
|
|
849 | num_le (num a, num b) |
|
|
850 | { |
|
|
851 | return !num_gt (a, b); |
|
|
852 | } |
|
|
853 | |
|
|
854 | #if USE_MATH |
|
|
855 | |
|
|
856 | /* Round to nearest. Round to even if midway */ |
|
|
857 | static double |
|
|
858 | round_per_R5RS (double x) |
|
|
859 | { |
|
|
860 | double fl = floor (x); |
|
|
861 | double ce = ceil (x); |
|
|
862 | double dfl = x - fl; |
|
|
863 | double dce = ce - x; |
|
|
864 | |
|
|
865 | if (dfl > dce) |
|
|
866 | return ce; |
|
|
867 | else if (dfl < dce) |
|
|
868 | return fl; |
|
|
869 | else |
|
|
870 | { |
|
|
871 | if (fmod (fl, 2.0) == 0.0) /* I imagine this holds */ |
|
|
872 | return fl; |
|
|
873 | else |
|
|
874 | return ce; |
|
|
875 | } |
|
|
876 | } |
|
|
877 | #endif |
|
|
878 | |
873 | |
879 | static int |
874 | static int |
880 | is_zero_rvalue (RVALUE x) |
875 | is_zero_rvalue (RVALUE x) |
881 | { |
876 | { |
|
|
877 | return x == 0; |
|
|
878 | #if 0 |
882 | #if USE_REAL |
879 | #if USE_REAL |
883 | return x < DBL_MIN && x > -DBL_MIN; /* why the hate of denormals? this should be == 0. */ |
880 | return x < DBL_MIN && x > -DBL_MIN; /* why the hate of denormals? this should be == 0. */ |
884 | #else |
881 | #else |
885 | return x == 0; |
882 | return x == 0; |
886 | #endif |
883 | #endif |
|
|
884 | #endif |
887 | } |
885 | } |
888 | |
886 | |
889 | /* allocate new cell segment */ |
887 | /* allocate new cell segment */ |
890 | static int |
888 | static int |
891 | alloc_cellseg (SCHEME_P_ int n) |
889 | alloc_cellseg (SCHEME_P) |
892 | { |
890 | { |
893 | pointer newp; |
891 | struct cell *newp; |
894 | pointer last; |
892 | struct cell *last; |
895 | pointer p; |
893 | struct cell *p; |
896 | char *cp; |
894 | char *cp; |
897 | long i; |
895 | long i; |
898 | int k; |
896 | int k; |
899 | |
897 | |
900 | static int segsize = CELL_SEGSIZE >> 1; |
898 | static int segsize = CELL_SEGSIZE >> 1; |
901 | segsize <<= 1; |
899 | segsize <<= 1; |
902 | |
900 | |
903 | for (k = 0; k < n; k++) |
|
|
904 | { |
|
|
905 | if (SCHEME_V->last_cell_seg >= CELL_NSEGMENT - 1) |
|
|
906 | return k; |
|
|
907 | |
|
|
908 | cp = malloc (segsize * sizeof (struct cell)); |
901 | cp = malloc (segsize * sizeof (struct cell)); |
909 | |
902 | |
910 | if (!cp && USE_ERROR_CHECKING) |
903 | if (!cp && USE_ERROR_CHECKING) |
911 | return k; |
904 | return k; |
912 | |
905 | |
913 | i = ++SCHEME_V->last_cell_seg; |
906 | i = ++SCHEME_V->last_cell_seg; |
914 | SCHEME_V->alloc_seg[i] = cp; |
907 | SCHEME_V->alloc_seg[i] = cp; |
915 | |
908 | |
916 | /* insert new segment in address order */ |
909 | newp = (struct cell *)cp; |
917 | newp = (pointer)cp; |
|
|
918 | SCHEME_V->cell_seg[i] = newp; |
910 | SCHEME_V->cell_seg[i] = newp; |
919 | SCHEME_V->cell_segsize[i] = segsize; |
911 | SCHEME_V->cell_segsize[i] = segsize; |
920 | |
|
|
921 | //TODO: insert, not swap |
|
|
922 | while (i > 0 && SCHEME_V->cell_seg[i - 1] > SCHEME_V->cell_seg[i]) |
|
|
923 | { |
|
|
924 | p = SCHEME_V->cell_seg[i]; |
|
|
925 | SCHEME_V->cell_seg[i] = SCHEME_V->cell_seg[i - 1]; |
|
|
926 | SCHEME_V->cell_seg[i - 1] = p; |
|
|
927 | |
|
|
928 | k = SCHEME_V->cell_segsize[i]; |
|
|
929 | SCHEME_V->cell_segsize[i] = SCHEME_V->cell_segsize[i - 1]; |
|
|
930 | SCHEME_V->cell_segsize[i - 1] = k; |
|
|
931 | |
|
|
932 | --i; |
|
|
933 | } |
|
|
934 | |
|
|
935 | SCHEME_V->fcells += segsize; |
912 | SCHEME_V->fcells += segsize; |
936 | last = newp + segsize - 1; |
913 | last = newp + segsize - 1; |
937 | |
914 | |
938 | for (p = newp; p <= last; p++) |
915 | for (p = newp; p <= last; p++) |
939 | { |
916 | { |
|
|
917 | pointer cp = POINTER (p); |
940 | set_typeflag (p, T_FREE); |
918 | set_typeflag (cp, T_PAIR); |
941 | set_car (p, NIL); |
919 | set_car (cp, NIL); |
942 | set_cdr (p, p + 1); |
920 | set_cdr (cp, POINTER (p + 1)); |
943 | } |
921 | } |
944 | |
922 | |
945 | /* insert new cells in address order on free list */ |
|
|
946 | if (SCHEME_V->free_cell == NIL || p < SCHEME_V->free_cell) |
|
|
947 | { |
|
|
948 | set_cdr (last, SCHEME_V->free_cell); |
923 | set_cdr (POINTER (last), SCHEME_V->free_cell); |
949 | SCHEME_V->free_cell = newp; |
924 | SCHEME_V->free_cell = POINTER (newp); |
950 | } |
|
|
951 | else |
|
|
952 | { |
|
|
953 | p = SCHEME_V->free_cell; |
|
|
954 | |
925 | |
955 | while (cdr (p) != NIL && newp > cdr (p)) |
|
|
956 | p = cdr (p); |
|
|
957 | |
|
|
958 | set_cdr (last, cdr (p)); |
|
|
959 | set_cdr (p, newp); |
|
|
960 | } |
|
|
961 | } |
|
|
962 | |
|
|
963 | return n; |
926 | return 1; |
964 | } |
927 | } |
965 | |
928 | |
966 | /* get new cell. parameter a, b is marked by gc. */ |
929 | /* get new cell. parameter a, b is marked by gc. */ |
967 | static INLINE pointer |
930 | ecb_inline pointer |
968 | get_cell_x (SCHEME_P_ pointer a, pointer b) |
931 | get_cell_x (SCHEME_P_ pointer a, pointer b) |
969 | { |
932 | { |
970 | if (SCHEME_V->free_cell == NIL) |
933 | if (ecb_expect_false (SCHEME_V->free_cell == NIL)) |
971 | { |
934 | { |
972 | if (SCHEME_V->no_memory && USE_ERROR_CHECKING) |
935 | if (SCHEME_V->no_memory && USE_ERROR_CHECKING) |
973 | return S_SINK; |
936 | return S_SINK; |
974 | |
937 | |
975 | if (SCHEME_V->free_cell == NIL) |
938 | if (SCHEME_V->free_cell == NIL) |
976 | { |
939 | { |
977 | const int min_to_be_recovered = SCHEME_V->last_cell_seg < 128 ? 128 * 8 : SCHEME_V->last_cell_seg * 8; |
940 | const int min_to_be_recovered = SCHEME_V->cell_segsize [SCHEME_V->last_cell_seg] >> 1; |
978 | |
941 | |
979 | gc (SCHEME_A_ a, b); |
942 | gc (SCHEME_A_ a, b); |
980 | |
943 | |
981 | 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) |
982 | { |
945 | { |
983 | /* 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 */ |
984 | if (!alloc_cellseg (SCHEME_A_ 1) && SCHEME_V->free_cell == NIL) |
947 | if (!alloc_cellseg (SCHEME_A) && SCHEME_V->free_cell == NIL) |
985 | { |
948 | { |
986 | #if USE_ERROR_CHECKING |
949 | #if USE_ERROR_CHECKING |
987 | SCHEME_V->no_memory = 1; |
950 | SCHEME_V->no_memory = 1; |
988 | return S_SINK; |
951 | return S_SINK; |
989 | #endif |
952 | #endif |
… | |
… | |
1001 | } |
964 | } |
1002 | } |
965 | } |
1003 | |
966 | |
1004 | /* To retain recent allocs before interpreter knows about them - |
967 | /* To retain recent allocs before interpreter knows about them - |
1005 | Tehom */ |
968 | Tehom */ |
1006 | |
|
|
1007 | static void |
969 | static void |
1008 | push_recent_alloc (SCHEME_P_ pointer recent, pointer extra) |
970 | push_recent_alloc (SCHEME_P_ pointer recent, pointer extra) |
1009 | { |
971 | { |
1010 | pointer holder = get_cell_x (SCHEME_A_ recent, extra); |
972 | pointer holder = get_cell_x (SCHEME_A_ recent, extra); |
1011 | |
973 | |
… | |
… | |
1033 | } |
995 | } |
1034 | |
996 | |
1035 | static pointer |
997 | static pointer |
1036 | get_vector_object (SCHEME_P_ uint32_t len, pointer init) |
998 | get_vector_object (SCHEME_P_ uint32_t len, pointer init) |
1037 | { |
999 | { |
1038 | pointer v = get_cell_x (SCHEME_A_ 0, 0); |
1000 | pointer v = get_cell_x (SCHEME_A_ NIL, NIL); |
1039 | pointer *e = malloc (len * sizeof (pointer)); |
1001 | pointer *e = malloc (len * sizeof (pointer)); |
1040 | |
1002 | |
1041 | if (!e && USE_ERROR_CHECKING) |
1003 | if (!e && USE_ERROR_CHECKING) |
1042 | return S_SINK; |
1004 | return S_SINK; |
1043 | |
1005 | |
1044 | /* Record it as a vector so that gc understands it. */ |
1006 | /* Record it as a vector so that gc understands it. */ |
1045 | set_typeflag (v, T_VECTOR | T_ATOM); |
1007 | set_typeflag (v, T_VECTOR | T_ATOM); |
1046 | |
1008 | |
1047 | v->object.vector.vvalue = e; |
1009 | CELL(v)->object.vector.vvalue = e; |
1048 | v->object.vector.length = len; |
1010 | CELL(v)->object.vector.length = len; |
1049 | fill_vector (v, init); |
1011 | fill_vector (v, 0, init); |
1050 | push_recent_alloc (SCHEME_A_ v, NIL); |
1012 | push_recent_alloc (SCHEME_A_ v, NIL); |
1051 | |
1013 | |
1052 | return v; |
1014 | return v; |
1053 | } |
1015 | } |
1054 | |
1016 | |
1055 | static INLINE void |
1017 | ecb_inline void |
1056 | ok_to_freely_gc (SCHEME_P) |
1018 | ok_to_freely_gc (SCHEME_P) |
1057 | { |
1019 | { |
1058 | set_car (S_SINK, NIL); |
1020 | set_car (S_SINK, NIL); |
1059 | } |
1021 | } |
1060 | |
1022 | |
… | |
… | |
1062 | static void |
1024 | static void |
1063 | check_cell_alloced (pointer p, int expect_alloced) |
1025 | check_cell_alloced (pointer p, int expect_alloced) |
1064 | { |
1026 | { |
1065 | /* 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. */ |
1066 | if (typeflag (p) & !expect_alloced) |
1028 | if (typeflag (p) & !expect_alloced) |
1067 | xwrstr ("Cell is already allocated!\n"); |
1029 | putstr (SCHEME_A_ "Cell is already allocated!\n"); |
1068 | |
1030 | |
1069 | if (!(typeflag (p)) & expect_alloced) |
1031 | if (!(typeflag (p)) & expect_alloced) |
1070 | xwrstr ("Cell is not allocated!\n"); |
1032 | putstr (SCHEME_A_ "Cell is not allocated!\n"); |
1071 | } |
1033 | } |
1072 | |
1034 | |
1073 | static void |
1035 | static void |
1074 | check_range_alloced (pointer p, int n, int expect_alloced) |
1036 | check_range_alloced (pointer p, int n, int expect_alloced) |
1075 | { |
1037 | { |
… | |
… | |
1097 | set_cdr (x, b); |
1059 | set_cdr (x, b); |
1098 | |
1060 | |
1099 | return x; |
1061 | return x; |
1100 | } |
1062 | } |
1101 | |
1063 | |
|
|
1064 | static pointer |
|
|
1065 | generate_symbol (SCHEME_P_ const char *name) |
|
|
1066 | { |
|
|
1067 | pointer x = mk_string (SCHEME_A_ name); |
|
|
1068 | setimmutable (x); |
|
|
1069 | set_typeflag (x, T_SYMBOL | T_ATOM); |
|
|
1070 | return x; |
|
|
1071 | } |
|
|
1072 | |
1102 | /* ========== oblist implementation ========== */ |
1073 | /* ========== oblist implementation ========== */ |
1103 | |
1074 | |
1104 | #ifndef USE_OBJECT_LIST |
1075 | #ifndef USE_OBJECT_LIST |
1105 | |
1076 | |
|
|
1077 | static int |
1106 | static int hash_fn (const char *key, int table_size); |
1078 | hash_fn (const char *key, int table_size) |
|
|
1079 | { |
|
|
1080 | const unsigned char *p = key; |
|
|
1081 | uint32_t hash = 2166136261; |
|
|
1082 | |
|
|
1083 | while (*p) |
|
|
1084 | hash = (hash ^ *p++) * 16777619; |
|
|
1085 | |
|
|
1086 | return hash % table_size; |
|
|
1087 | } |
1107 | |
1088 | |
1108 | static pointer |
1089 | static pointer |
1109 | oblist_initial_value (SCHEME_P) |
1090 | oblist_initial_value (SCHEME_P) |
1110 | { |
1091 | { |
1111 | return mk_vector (SCHEME_A_ 461); /* probably should be bigger */ |
1092 | return mk_vector (SCHEME_A_ 461); /* probably should be bigger */ |
… | |
… | |
1113 | |
1094 | |
1114 | /* returns the new symbol */ |
1095 | /* returns the new symbol */ |
1115 | static pointer |
1096 | static pointer |
1116 | oblist_add_by_name (SCHEME_P_ const char *name) |
1097 | oblist_add_by_name (SCHEME_P_ const char *name) |
1117 | { |
1098 | { |
1118 | int location; |
1099 | pointer x = generate_symbol (SCHEME_A_ name); |
1119 | |
|
|
1120 | pointer x = immutable_cons (mk_string (SCHEME_A_ name), NIL); |
|
|
1121 | set_typeflag (x, T_SYMBOL); |
|
|
1122 | setimmutable (car (x)); |
|
|
1123 | |
|
|
1124 | location = hash_fn (name, veclength (SCHEME_V->oblist)); |
1100 | int location = hash_fn (name, veclength (SCHEME_V->oblist)); |
1125 | set_vector_elem (SCHEME_V->oblist, location, immutable_cons (x, vector_elem (SCHEME_V->oblist, location))); |
1101 | vector_set (SCHEME_V->oblist, location, immutable_cons (x, vector_get (SCHEME_V->oblist, location))); |
1126 | return x; |
1102 | return x; |
1127 | } |
1103 | } |
1128 | |
1104 | |
1129 | static INLINE pointer |
1105 | ecb_inline pointer |
1130 | oblist_find_by_name (SCHEME_P_ const char *name) |
1106 | oblist_find_by_name (SCHEME_P_ const char *name) |
1131 | { |
1107 | { |
1132 | int location; |
1108 | int location; |
1133 | pointer x; |
1109 | pointer x; |
1134 | char *s; |
1110 | char *s; |
1135 | |
1111 | |
1136 | location = hash_fn (name, veclength (SCHEME_V->oblist)); |
1112 | location = hash_fn (name, veclength (SCHEME_V->oblist)); |
1137 | |
1113 | |
1138 | for (x = vector_elem (SCHEME_V->oblist, location); x != NIL; x = cdr (x)) |
1114 | for (x = vector_get (SCHEME_V->oblist, location); x != NIL; x = cdr (x)) |
1139 | { |
1115 | { |
1140 | s = symname (car (x)); |
1116 | s = symname (car (x)); |
1141 | |
1117 | |
1142 | /* case-insensitive, per R5RS section 2 */ |
1118 | /* case-insensitive, per R5RS section 2 */ |
1143 | if (stricmp (name, s) == 0) |
1119 | if (stricmp (name, s) == 0) |
… | |
… | |
1153 | int i; |
1129 | int i; |
1154 | pointer x; |
1130 | pointer x; |
1155 | pointer ob_list = NIL; |
1131 | pointer ob_list = NIL; |
1156 | |
1132 | |
1157 | for (i = 0; i < veclength (SCHEME_V->oblist); i++) |
1133 | for (i = 0; i < veclength (SCHEME_V->oblist); i++) |
1158 | for (x = vector_elem (SCHEME_V->oblist, i); x != NIL; x = cdr (x)) |
1134 | for (x = vector_get (SCHEME_V->oblist, i); x != NIL; x = cdr (x)) |
1159 | ob_list = cons (x, ob_list); |
1135 | ob_list = cons (x, ob_list); |
1160 | |
1136 | |
1161 | return ob_list; |
1137 | return ob_list; |
1162 | } |
1138 | } |
1163 | |
1139 | |
… | |
… | |
1167 | oblist_initial_value (SCHEME_P) |
1143 | oblist_initial_value (SCHEME_P) |
1168 | { |
1144 | { |
1169 | return NIL; |
1145 | return NIL; |
1170 | } |
1146 | } |
1171 | |
1147 | |
1172 | static INLINE pointer |
1148 | ecb_inline pointer |
1173 | oblist_find_by_name (SCHEME_P_ const char *name) |
1149 | oblist_find_by_name (SCHEME_P_ const char *name) |
1174 | { |
1150 | { |
1175 | pointer x; |
1151 | pointer x; |
1176 | char *s; |
1152 | char *s; |
1177 | |
1153 | |
… | |
… | |
1189 | |
1165 | |
1190 | /* returns the new symbol */ |
1166 | /* returns the new symbol */ |
1191 | static pointer |
1167 | static pointer |
1192 | oblist_add_by_name (SCHEME_P_ const char *name) |
1168 | oblist_add_by_name (SCHEME_P_ const char *name) |
1193 | { |
1169 | { |
1194 | pointer x; |
1170 | pointer x = generate_symbol (SCHEME_A_ name); |
1195 | |
|
|
1196 | x = immutable_cons (mk_string (SCHEME_A_ name), NIL); |
|
|
1197 | set_typeflag (x, T_SYMBOL); |
|
|
1198 | setimmutable (car (x)); |
|
|
1199 | SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist); |
1171 | SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist); |
1200 | return x; |
1172 | return x; |
1201 | } |
1173 | } |
1202 | |
1174 | |
1203 | static pointer |
1175 | static pointer |
… | |
… | |
1213 | mk_port (SCHEME_P_ port *p) |
1185 | mk_port (SCHEME_P_ port *p) |
1214 | { |
1186 | { |
1215 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1187 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1216 | |
1188 | |
1217 | set_typeflag (x, T_PORT | T_ATOM); |
1189 | set_typeflag (x, T_PORT | T_ATOM); |
1218 | x->object.port = p; |
1190 | set_port (x, p); |
1219 | |
1191 | |
1220 | return x; |
1192 | return x; |
1221 | } |
1193 | } |
1222 | #endif |
1194 | #endif |
1223 | |
1195 | |
1224 | pointer |
1196 | pointer |
1225 | mk_foreign_func (SCHEME_P_ foreign_func f) |
1197 | mk_foreign_func (SCHEME_P_ foreign_func f) |
1226 | { |
1198 | { |
1227 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1199 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1228 | |
1200 | |
1229 | set_typeflag (x, (T_FOREIGN | T_ATOM)); |
1201 | set_typeflag (x, T_FOREIGN | T_ATOM); |
1230 | x->object.ff = f; |
1202 | CELL(x)->object.ff = f; |
1231 | |
1203 | |
1232 | return x; |
1204 | return x; |
1233 | } |
1205 | } |
1234 | |
1206 | |
1235 | INTERFACE pointer |
1207 | INTERFACE pointer |
1236 | mk_character (SCHEME_P_ int c) |
1208 | mk_character (SCHEME_P_ int c) |
1237 | { |
1209 | { |
1238 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1210 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1239 | |
1211 | |
1240 | set_typeflag (x, (T_CHARACTER | T_ATOM)); |
1212 | set_typeflag (x, T_CHARACTER | T_ATOM); |
1241 | ivalue_unchecked (x) = c & 0xff; |
1213 | set_ivalue (x, c & 0xff); |
1242 | set_num_integer (x); |
1214 | |
1243 | return x; |
1215 | return x; |
1244 | } |
1216 | } |
1245 | |
1217 | |
1246 | /* get number atom (integer) */ |
1218 | /* get number atom (integer) */ |
1247 | INTERFACE pointer |
1219 | INTERFACE pointer |
1248 | mk_integer (SCHEME_P_ long num) |
1220 | mk_integer (SCHEME_P_ long n) |
1249 | { |
1221 | { |
|
|
1222 | pointer p = 0; |
|
|
1223 | pointer *pp = &p; |
|
|
1224 | |
|
|
1225 | #if USE_INTCACHE |
|
|
1226 | if (n >= INTCACHE_MIN && n <= INTCACHE_MAX) |
|
|
1227 | pp = &SCHEME_V->intcache[n - INTCACHE_MIN]; |
|
|
1228 | #endif |
|
|
1229 | |
|
|
1230 | if (!*pp) |
|
|
1231 | { |
1250 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1232 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1251 | |
1233 | |
1252 | set_typeflag (x, (T_NUMBER | T_ATOM)); |
1234 | set_typeflag (x, T_INTEGER | T_ATOM); |
1253 | ivalue_unchecked (x) = num; |
1235 | setimmutable (x); /* shouldn't do anythi9ng, doesn't cost anything */ |
1254 | set_num_integer (x); |
1236 | set_ivalue (x, n); |
|
|
1237 | |
|
|
1238 | *pp = x; |
|
|
1239 | } |
|
|
1240 | |
1255 | return x; |
1241 | return *pp; |
1256 | } |
1242 | } |
1257 | |
1243 | |
1258 | INTERFACE pointer |
1244 | INTERFACE pointer |
1259 | mk_real (SCHEME_P_ RVALUE n) |
1245 | mk_real (SCHEME_P_ RVALUE n) |
1260 | { |
1246 | { |
|
|
1247 | #if USE_REAL |
1261 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1248 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1262 | |
1249 | |
1263 | set_typeflag (x, (T_NUMBER | T_ATOM)); |
1250 | set_typeflag (x, T_REAL | T_ATOM); |
1264 | rvalue_unchecked (x) = n; |
1251 | set_rvalue (x, n); |
1265 | set_num_real (x); |
1252 | |
1266 | return x; |
1253 | return x; |
|
|
1254 | #else |
|
|
1255 | return mk_integer (SCHEME_A_ n); |
|
|
1256 | #endif |
1267 | } |
1257 | } |
1268 | |
1258 | |
1269 | static pointer |
1259 | static pointer |
1270 | mk_number (SCHEME_P_ const num n) |
1260 | mk_number (SCHEME_P_ const num n) |
1271 | { |
1261 | { |
|
|
1262 | #if USE_REAL |
1272 | if (num_is_fixnum (n)) |
1263 | return num_is_fixnum (n) |
|
|
1264 | ? mk_integer (SCHEME_A_ num_ivalue (n)) |
|
|
1265 | : mk_real (SCHEME_A_ num_rvalue (n)); |
|
|
1266 | #else |
1273 | return mk_integer (SCHEME_A_ num_get_ivalue (n)); |
1267 | return mk_integer (SCHEME_A_ num_ivalue (n)); |
1274 | else |
1268 | #endif |
1275 | return mk_real (SCHEME_A_ num_get_rvalue (n)); |
|
|
1276 | } |
1269 | } |
1277 | |
1270 | |
1278 | /* allocate name to string area */ |
1271 | /* allocate name to string area */ |
1279 | static char * |
1272 | static char * |
1280 | store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill) |
1273 | store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill) |
… | |
… | |
1286 | SCHEME_V->no_memory = 1; |
1279 | SCHEME_V->no_memory = 1; |
1287 | return SCHEME_V->strbuff; |
1280 | return SCHEME_V->strbuff; |
1288 | } |
1281 | } |
1289 | |
1282 | |
1290 | if (str) |
1283 | if (str) |
1291 | { |
1284 | memcpy (q, str , len_str); /* caller must ensure that *str has length len_str */ |
1292 | int l = strlen (str); |
|
|
1293 | |
|
|
1294 | if (l > len_str) |
|
|
1295 | l = len_str; |
|
|
1296 | |
|
|
1297 | memcpy (q, str, l); |
|
|
1298 | q[l] = 0; |
|
|
1299 | } |
|
|
1300 | else |
1285 | else |
1301 | { |
|
|
1302 | memset (q, fill, len_str); |
1286 | memset (q, fill, len_str); |
|
|
1287 | |
1303 | q[len_str] = 0; |
1288 | q[len_str] = 0; |
1304 | } |
|
|
1305 | |
1289 | |
1306 | return q; |
1290 | return q; |
1307 | } |
1291 | } |
1308 | |
1292 | |
1309 | INTERFACE pointer |
1293 | INTERFACE pointer |
… | |
… | |
1323 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1307 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1324 | |
1308 | |
1325 | set_typeflag (x, T_STRING | T_ATOM); |
1309 | set_typeflag (x, T_STRING | T_ATOM); |
1326 | strvalue (x) = store_string (SCHEME_A_ len, str, 0); |
1310 | strvalue (x) = store_string (SCHEME_A_ len, str, 0); |
1327 | strlength (x) = len; |
1311 | strlength (x) = len; |
|
|
1312 | |
1328 | return x; |
1313 | return x; |
1329 | } |
1314 | } |
1330 | |
1315 | |
1331 | INTERFACE pointer |
1316 | INTERFACE pointer |
1332 | mk_string (SCHEME_P_ const char *str) |
1317 | mk_string (SCHEME_P_ const char *str) |
… | |
… | |
1339 | { |
1324 | { |
1340 | return get_vector_object (SCHEME_A_ len, NIL); |
1325 | return get_vector_object (SCHEME_A_ len, NIL); |
1341 | } |
1326 | } |
1342 | |
1327 | |
1343 | INTERFACE void |
1328 | INTERFACE void |
1344 | fill_vector (pointer vec, pointer obj) |
1329 | fill_vector (pointer vec, uint32_t start, pointer obj) |
1345 | { |
1330 | { |
1346 | int i; |
1331 | int i; |
1347 | |
1332 | |
1348 | for (i = 0; i < vec->object.vector.length; i++) |
1333 | for (i = start; i < veclength (vec); i++) |
1349 | vecvalue (vec)[i] = obj; |
1334 | vecvalue (vec)[i] = obj; |
1350 | } |
1335 | } |
1351 | |
1336 | |
|
|
1337 | INTERFACE void |
|
|
1338 | vector_resize (pointer vec, uint32_t newsize, pointer fill) |
|
|
1339 | { |
|
|
1340 | uint32_t oldsize = veclength (vec); |
|
|
1341 | vecvalue (vec) = realloc (vecvalue (vec), newsize * sizeof (pointer)); |
|
|
1342 | veclength (vec) = newsize; |
|
|
1343 | fill_vector (vec, oldsize, fill); |
|
|
1344 | } |
|
|
1345 | |
1352 | INTERFACE pointer |
1346 | INTERFACE pointer |
1353 | vector_elem (pointer vec, uint32_t ielem) |
1347 | vector_get (pointer vec, uint32_t ielem) |
1354 | { |
1348 | { |
1355 | return vecvalue(vec)[ielem]; |
1349 | return vecvalue(vec)[ielem]; |
1356 | } |
1350 | } |
1357 | |
1351 | |
1358 | INTERFACE void |
1352 | INTERFACE void |
1359 | set_vector_elem (pointer vec, uint32_t ielem, pointer a) |
1353 | vector_set (pointer vec, uint32_t ielem, pointer a) |
1360 | { |
1354 | { |
1361 | vecvalue(vec)[ielem] = a; |
1355 | vecvalue(vec)[ielem] = a; |
1362 | } |
1356 | } |
1363 | |
1357 | |
1364 | /* get new symbol */ |
1358 | /* get new symbol */ |
… | |
… | |
1376 | |
1370 | |
1377 | INTERFACE pointer |
1371 | INTERFACE pointer |
1378 | gensym (SCHEME_P) |
1372 | gensym (SCHEME_P) |
1379 | { |
1373 | { |
1380 | pointer x; |
1374 | pointer x; |
1381 | |
|
|
1382 | for (; SCHEME_V->gensym_cnt < LONG_MAX; SCHEME_V->gensym_cnt++) |
|
|
1383 | { |
|
|
1384 | char name[40] = "gensym-"; |
1375 | char name[40] = "gensym-"; |
1385 | xnum (name + 7, SCHEME_V->gensym_cnt); |
1376 | xnum (name + 7, ++SCHEME_V->gensym_cnt); |
1386 | |
1377 | |
1387 | /* first check oblist */ |
1378 | return generate_symbol (SCHEME_A_ name); |
1388 | x = oblist_find_by_name (SCHEME_A_ name); |
1379 | } |
1389 | |
1380 | |
1390 | if (x == NIL) |
1381 | static int |
1391 | { |
1382 | is_gensym (SCHEME_P_ pointer x) |
1392 | x = oblist_add_by_name (SCHEME_A_ name); |
1383 | { |
1393 | return x; |
1384 | return is_symbol (x) && oblist_find_by_name (SCHEME_A_ strvalue (x)) != x; |
1394 | } |
|
|
1395 | } |
|
|
1396 | |
|
|
1397 | return NIL; |
|
|
1398 | } |
1385 | } |
1399 | |
1386 | |
1400 | /* make symbol or number atom from string */ |
1387 | /* make symbol or number atom from string */ |
1401 | static pointer |
1388 | static pointer |
1402 | mk_atom (SCHEME_P_ char *q) |
1389 | mk_atom (SCHEME_P_ char *q) |
… | |
… | |
1456 | } |
1443 | } |
1457 | else if ((c == 'e') || (c == 'E')) |
1444 | else if ((c == 'e') || (c == 'E')) |
1458 | { |
1445 | { |
1459 | if (!has_fp_exp) |
1446 | if (!has_fp_exp) |
1460 | { |
1447 | { |
1461 | has_dec_point = 1; /* decimal point illegal |
1448 | has_dec_point = 1; /* decimal point illegal from now on */ |
1462 | from now on */ |
|
|
1463 | p++; |
1449 | p++; |
1464 | |
1450 | |
1465 | if ((*p == '-') || (*p == '+') || isdigit (*p)) |
1451 | if ((*p == '-') || (*p == '+') || isdigit (*p)) |
1466 | continue; |
1452 | continue; |
1467 | } |
1453 | } |
… | |
… | |
1481 | |
1467 | |
1482 | /* make constant */ |
1468 | /* make constant */ |
1483 | static pointer |
1469 | static pointer |
1484 | mk_sharp_const (SCHEME_P_ char *name) |
1470 | mk_sharp_const (SCHEME_P_ char *name) |
1485 | { |
1471 | { |
1486 | long x; |
|
|
1487 | char tmp[STRBUFFSIZE]; |
|
|
1488 | |
|
|
1489 | if (!strcmp (name, "t")) |
1472 | if (!strcmp (name, "t")) |
1490 | return S_T; |
1473 | return S_T; |
1491 | else if (!strcmp (name, "f")) |
1474 | else if (!strcmp (name, "f")) |
1492 | return S_F; |
1475 | return S_F; |
1493 | else if (*name == '\\') /* #\w (character) */ |
1476 | else if (*name == '\\') /* #\w (character) */ |
1494 | { |
1477 | { |
1495 | int c = 0; |
1478 | int c; |
1496 | |
1479 | |
1497 | if (stricmp (name + 1, "space") == 0) |
1480 | if (stricmp (name + 1, "space") == 0) |
1498 | c = ' '; |
1481 | c = ' '; |
1499 | else if (stricmp (name + 1, "newline") == 0) |
1482 | else if (stricmp (name + 1, "newline") == 0) |
1500 | c = '\n'; |
1483 | c = '\n'; |
… | |
… | |
1502 | c = '\r'; |
1485 | c = '\r'; |
1503 | else if (stricmp (name + 1, "tab") == 0) |
1486 | else if (stricmp (name + 1, "tab") == 0) |
1504 | c = '\t'; |
1487 | c = '\t'; |
1505 | else if (name[1] == 'x' && name[2] != 0) |
1488 | else if (name[1] == 'x' && name[2] != 0) |
1506 | { |
1489 | { |
1507 | int c1 = strtol (name + 2, 0, 16); |
1490 | long c1 = strtol (name + 2, 0, 16); |
1508 | |
1491 | |
1509 | if (c1 <= UCHAR_MAX) |
1492 | if (0 <= c1 && c1 <= UCHAR_MAX) |
1510 | c = c1; |
1493 | c = c1; |
1511 | else |
1494 | else |
1512 | return NIL; |
1495 | return NIL; |
1513 | |
1496 | } |
1514 | #if USE_ASCII_NAMES |
1497 | #if USE_ASCII_NAMES |
1515 | } |
|
|
1516 | else if (is_ascii_name (name + 1, &c)) |
1498 | else if (is_ascii_name (name + 1, &c)) |
1517 | { |
|
|
1518 | /* nothing */ |
1499 | /* nothing */; |
1519 | #endif |
1500 | #endif |
1520 | } |
|
|
1521 | else if (name[2] == 0) |
1501 | else if (name[2] == 0) |
1522 | c = name[1]; |
1502 | c = name[1]; |
1523 | else |
1503 | else |
1524 | return NIL; |
1504 | return NIL; |
1525 | |
1505 | |
… | |
… | |
1542 | |
1522 | |
1543 | /*-- |
1523 | /*-- |
1544 | * We use algorithm E (Knuth, The Art of Computer Programming Vol.1, |
1524 | * We use algorithm E (Knuth, The Art of Computer Programming Vol.1, |
1545 | * sec. 2.3.5), the Schorr-Deutsch-Waite link-inversion algorithm, |
1525 | * sec. 2.3.5), the Schorr-Deutsch-Waite link-inversion algorithm, |
1546 | * for marking. |
1526 | * for marking. |
|
|
1527 | * |
|
|
1528 | * The exception is vectors - vectors are currently marked recursively, |
|
|
1529 | * which is inherited form tinyscheme and could be fixed by having another |
|
|
1530 | * word of context in the vector |
1547 | */ |
1531 | */ |
1548 | static void |
1532 | static void |
1549 | mark (pointer a) |
1533 | mark (pointer a) |
1550 | { |
1534 | { |
1551 | pointer t, q, p; |
1535 | pointer t, q, p; |
… | |
… | |
1553 | t = 0; |
1537 | t = 0; |
1554 | p = a; |
1538 | p = a; |
1555 | E2: |
1539 | E2: |
1556 | setmark (p); |
1540 | setmark (p); |
1557 | |
1541 | |
1558 | if (is_vector (p)) |
1542 | if (ecb_expect_false (is_vector (p))) |
1559 | { |
1543 | { |
1560 | int i; |
1544 | int i; |
1561 | |
1545 | |
1562 | for (i = 0; i < p->object.vector.length; i++) |
1546 | for (i = 0; i < veclength (p); i++) |
1563 | mark (vecvalue (p)[i]); |
1547 | mark (vecvalue (p)[i]); |
1564 | } |
1548 | } |
1565 | |
1549 | |
1566 | if (is_atom (p)) |
1550 | if (is_atom (p)) |
1567 | goto E6; |
1551 | goto E6; |
… | |
… | |
1614 | |
1598 | |
1615 | /* garbage collection. parameter a, b is marked. */ |
1599 | /* garbage collection. parameter a, b is marked. */ |
1616 | static void |
1600 | static void |
1617 | gc (SCHEME_P_ pointer a, pointer b) |
1601 | gc (SCHEME_P_ pointer a, pointer b) |
1618 | { |
1602 | { |
1619 | pointer p; |
|
|
1620 | int i; |
1603 | int i; |
1621 | |
1604 | |
1622 | if (SCHEME_V->gc_verbose) |
1605 | if (SCHEME_V->gc_verbose) |
1623 | putstr (SCHEME_A_ "gc..."); |
1606 | putstr (SCHEME_A_ "gc..."); |
1624 | |
1607 | |
… | |
… | |
1640 | /* Mark recent objects the interpreter doesn't know about yet. */ |
1623 | /* Mark recent objects the interpreter doesn't know about yet. */ |
1641 | mark (car (S_SINK)); |
1624 | mark (car (S_SINK)); |
1642 | /* Mark any older stuff above nested C calls */ |
1625 | /* Mark any older stuff above nested C calls */ |
1643 | mark (SCHEME_V->c_nest); |
1626 | mark (SCHEME_V->c_nest); |
1644 | |
1627 | |
|
|
1628 | #if USE_INTCACHE |
|
|
1629 | /* mark intcache */ |
|
|
1630 | for (i = INTCACHE_MIN; i <= INTCACHE_MAX; ++i) |
|
|
1631 | if (SCHEME_V->intcache[i - INTCACHE_MIN]) |
|
|
1632 | mark (SCHEME_V->intcache[i - INTCACHE_MIN]); |
|
|
1633 | #endif |
|
|
1634 | |
1645 | /* mark variables a, b */ |
1635 | /* mark variables a, b */ |
1646 | mark (a); |
1636 | mark (a); |
1647 | mark (b); |
1637 | mark (b); |
1648 | |
1638 | |
1649 | /* garbage collect */ |
1639 | /* garbage collect */ |
1650 | clrmark (NIL); |
1640 | clrmark (NIL); |
1651 | SCHEME_V->fcells = 0; |
1641 | SCHEME_V->fcells = 0; |
1652 | SCHEME_V->free_cell = NIL; |
1642 | SCHEME_V->free_cell = NIL; |
1653 | |
1643 | |
1654 | /* free-list is kept sorted by address so as to maintain consecutive |
1644 | if (SCHEME_V->gc_verbose) |
1655 | ranges, if possible, for use with vectors. Here we scan the cells |
1645 | putstr (SCHEME_A_ "freeing..."); |
1656 | (which are also kept sorted by address) downwards to build the |
1646 | |
1657 | free-list in sorted order. |
1647 | uint32_t total = 0; |
1658 | */ |
1648 | |
|
|
1649 | /* Here we scan the cells to build the free-list. */ |
1659 | for (i = SCHEME_V->last_cell_seg; i >= 0; i--) |
1650 | for (i = SCHEME_V->last_cell_seg; i >= 0; i--) |
1660 | { |
1651 | { |
1661 | p = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i]; |
1652 | struct cell *end = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i]; |
|
|
1653 | struct cell *p; |
|
|
1654 | total += SCHEME_V->cell_segsize [i]; |
1662 | |
1655 | |
1663 | while (--p >= SCHEME_V->cell_seg[i]) |
1656 | for (p = SCHEME_V->cell_seg[i]; p < end; ++p) |
1664 | { |
1657 | { |
|
|
1658 | pointer c = POINTER (p); |
|
|
1659 | |
1665 | if (is_mark (p)) |
1660 | if (is_mark (c)) |
1666 | clrmark (p); |
1661 | clrmark (c); |
1667 | else |
1662 | else |
1668 | { |
1663 | { |
1669 | /* reclaim cell */ |
1664 | /* reclaim cell */ |
1670 | if (typeflag (p) != T_FREE) |
1665 | if (typeflag (c) != T_PAIR) |
1671 | { |
1666 | { |
1672 | finalize_cell (SCHEME_A_ p); |
1667 | finalize_cell (SCHEME_A_ c); |
1673 | set_typeflag (p, T_FREE); |
1668 | set_typeflag (c, T_PAIR); |
1674 | set_car (p, NIL); |
1669 | set_car (c, NIL); |
1675 | } |
1670 | } |
1676 | |
1671 | |
1677 | ++SCHEME_V->fcells; |
1672 | ++SCHEME_V->fcells; |
1678 | set_cdr (p, SCHEME_V->free_cell); |
1673 | set_cdr (c, SCHEME_V->free_cell); |
1679 | SCHEME_V->free_cell = p; |
1674 | SCHEME_V->free_cell = c; |
1680 | } |
1675 | } |
1681 | } |
1676 | } |
1682 | } |
1677 | } |
1683 | |
1678 | |
1684 | if (SCHEME_V->gc_verbose) |
1679 | if (SCHEME_V->gc_verbose) |
1685 | xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" cells were recovered.\n"); |
1680 | { |
|
|
1681 | 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"); |
|
|
1682 | } |
1686 | } |
1683 | } |
1687 | |
1684 | |
1688 | static void |
1685 | static void |
1689 | finalize_cell (SCHEME_P_ pointer a) |
1686 | finalize_cell (SCHEME_P_ pointer a) |
1690 | { |
1687 | { |
1691 | if (is_string (a)) |
1688 | /* TODO, fast bitmap check? */ |
|
|
1689 | if (is_string (a) || is_symbol (a)) |
1692 | free (strvalue (a)); |
1690 | free (strvalue (a)); |
1693 | else if (is_vector (a)) |
1691 | else if (is_vector (a)) |
1694 | free (vecvalue (a)); |
1692 | free (vecvalue (a)); |
1695 | #if USE_PORTS |
1693 | #if USE_PORTS |
1696 | else if (is_port (a)) |
1694 | else if (is_port (a)) |
1697 | { |
1695 | { |
1698 | if (a->object.port->kind & port_file && a->object.port->rep.stdio.closeit) |
1696 | if (port(a)->kind & port_file && port (a)->rep.stdio.closeit) |
1699 | port_close (SCHEME_A_ a, port_input | port_output); |
1697 | port_close (SCHEME_A_ a, port_input | port_output); |
1700 | |
1698 | |
1701 | free (a->object.port); |
1699 | free (port (a)); |
1702 | } |
1700 | } |
1703 | #endif |
1701 | #endif |
1704 | } |
1702 | } |
1705 | |
1703 | |
1706 | /* ========== Routines for Reading ========== */ |
1704 | /* ========== Routines for Reading ========== */ |
… | |
… | |
1722 | SCHEME_V->load_stack[SCHEME_V->file_i].unget = -1; |
1720 | SCHEME_V->load_stack[SCHEME_V->file_i].unget = -1; |
1723 | SCHEME_V->load_stack[SCHEME_V->file_i].kind = port_file | port_input; |
1721 | SCHEME_V->load_stack[SCHEME_V->file_i].kind = port_file | port_input; |
1724 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.file = fin; |
1722 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.file = fin; |
1725 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.closeit = 1; |
1723 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.closeit = 1; |
1726 | SCHEME_V->nesting_stack[SCHEME_V->file_i] = 0; |
1724 | SCHEME_V->nesting_stack[SCHEME_V->file_i] = 0; |
1727 | SCHEME_V->loadport->object.port = SCHEME_V->load_stack + SCHEME_V->file_i; |
1725 | set_port (SCHEME_V->loadport, SCHEME_V->load_stack + SCHEME_V->file_i); |
1728 | |
1726 | |
1729 | #if SHOW_ERROR_LINE |
1727 | #if SHOW_ERROR_LINE |
1730 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line = 0; |
1728 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line = 0; |
1731 | |
1729 | |
1732 | if (fname) |
1730 | if (fname) |
… | |
… | |
1749 | SCHEME_V->nesting = SCHEME_V->nesting_stack[SCHEME_V->file_i]; |
1747 | SCHEME_V->nesting = SCHEME_V->nesting_stack[SCHEME_V->file_i]; |
1750 | #if USE_PORTS |
1748 | #if USE_PORTS |
1751 | port_close (SCHEME_A_ SCHEME_V->loadport, port_input); |
1749 | port_close (SCHEME_A_ SCHEME_V->loadport, port_input); |
1752 | #endif |
1750 | #endif |
1753 | SCHEME_V->file_i--; |
1751 | SCHEME_V->file_i--; |
1754 | SCHEME_V->loadport->object.port = SCHEME_V->load_stack + SCHEME_V->file_i; |
1752 | set_port (SCHEME_V->loadport, SCHEME_V->load_stack + SCHEME_V->file_i); |
1755 | } |
1753 | } |
1756 | } |
1754 | } |
1757 | |
1755 | |
1758 | static int |
1756 | static int |
1759 | file_interactive (SCHEME_P) |
1757 | file_interactive (SCHEME_P) |
1760 | { |
1758 | { |
1761 | #if USE_PORTS |
1759 | #if USE_PORTS |
1762 | return SCHEME_V->file_i == 0 |
1760 | return SCHEME_V->file_i == 0 |
1763 | && SCHEME_V->load_stack[0].rep.stdio.file == STDIN_FILENO |
1761 | && SCHEME_V->load_stack[0].rep.stdio.file == STDIN_FILENO |
1764 | && (SCHEME_V->inport->object.port->kind & port_file); |
1762 | && (port (SCHEME_V->inport)->kind & port_file); |
1765 | #else |
1763 | #else |
1766 | return 0; |
1764 | return 0; |
1767 | #endif |
1765 | #endif |
1768 | } |
1766 | } |
1769 | |
1767 | |
… | |
… | |
1903 | } |
1901 | } |
1904 | |
1902 | |
1905 | static void |
1903 | static void |
1906 | port_close (SCHEME_P_ pointer p, int flag) |
1904 | port_close (SCHEME_P_ pointer p, int flag) |
1907 | { |
1905 | { |
1908 | port *pt = p->object.port; |
1906 | port *pt = port (p); |
1909 | |
1907 | |
1910 | pt->kind &= ~flag; |
1908 | pt->kind &= ~flag; |
1911 | |
1909 | |
1912 | if ((pt->kind & (port_input | port_output)) == 0) |
1910 | if ((pt->kind & (port_input | port_output)) == 0) |
1913 | { |
1911 | { |
… | |
… | |
1934 | /* get new character from input file */ |
1932 | /* get new character from input file */ |
1935 | static int |
1933 | static int |
1936 | inchar (SCHEME_P) |
1934 | inchar (SCHEME_P) |
1937 | { |
1935 | { |
1938 | int c; |
1936 | int c; |
1939 | port *pt; |
1937 | port *pt = port (SCHEME_V->inport); |
1940 | |
|
|
1941 | pt = SCHEME_V->inport->object.port; |
|
|
1942 | |
1938 | |
1943 | if (pt->kind & port_saw_EOF) |
1939 | if (pt->kind & port_saw_EOF) |
1944 | return EOF; |
1940 | return EOF; |
1945 | |
1941 | |
1946 | c = basic_inchar (pt); |
1942 | c = basic_inchar (pt); |
… | |
… | |
2013 | port *pt; |
2009 | port *pt; |
2014 | |
2010 | |
2015 | if (c == EOF) |
2011 | if (c == EOF) |
2016 | return; |
2012 | return; |
2017 | |
2013 | |
2018 | pt = SCHEME_V->inport->object.port; |
2014 | pt = port (SCHEME_V->inport); |
2019 | pt->unget = c; |
2015 | pt->unget = c; |
2020 | #else |
2016 | #else |
2021 | if (c == EOF) |
2017 | if (c == EOF) |
2022 | return; |
2018 | return; |
2023 | |
2019 | |
… | |
… | |
2051 | |
2047 | |
2052 | INTERFACE void |
2048 | INTERFACE void |
2053 | putstr (SCHEME_P_ const char *s) |
2049 | putstr (SCHEME_P_ const char *s) |
2054 | { |
2050 | { |
2055 | #if USE_PORTS |
2051 | #if USE_PORTS |
2056 | port *pt = SCHEME_V->outport->object.port; |
2052 | port *pt = port (SCHEME_V->outport); |
2057 | |
2053 | |
2058 | if (pt->kind & port_file) |
2054 | if (pt->kind & port_file) |
2059 | write (pt->rep.stdio.file, s, strlen (s)); |
2055 | write (pt->rep.stdio.file, s, strlen (s)); |
2060 | else |
2056 | else |
2061 | for (; *s; s++) |
2057 | for (; *s; s++) |
… | |
… | |
2063 | *pt->rep.string.curr++ = *s; |
2059 | *pt->rep.string.curr++ = *s; |
2064 | else if (pt->kind & port_srfi6 && realloc_port_string (SCHEME_A_ pt)) |
2060 | else if (pt->kind & port_srfi6 && realloc_port_string (SCHEME_A_ pt)) |
2065 | *pt->rep.string.curr++ = *s; |
2061 | *pt->rep.string.curr++ = *s; |
2066 | |
2062 | |
2067 | #else |
2063 | #else |
2068 | xwrstr (s); |
2064 | write (pt->rep.stdio.file, s, strlen (s)); |
2069 | #endif |
2065 | #endif |
2070 | } |
2066 | } |
2071 | |
2067 | |
2072 | static void |
2068 | static void |
2073 | putchars (SCHEME_P_ const char *s, int len) |
2069 | putchars (SCHEME_P_ const char *s, int len) |
2074 | { |
2070 | { |
2075 | #if USE_PORTS |
2071 | #if USE_PORTS |
2076 | port *pt = SCHEME_V->outport->object.port; |
2072 | port *pt = port (SCHEME_V->outport); |
2077 | |
2073 | |
2078 | if (pt->kind & port_file) |
2074 | if (pt->kind & port_file) |
2079 | write (pt->rep.stdio.file, s, len); |
2075 | write (pt->rep.stdio.file, s, len); |
2080 | else |
2076 | else |
2081 | { |
2077 | { |
… | |
… | |
2095 | |
2091 | |
2096 | INTERFACE void |
2092 | INTERFACE void |
2097 | putcharacter (SCHEME_P_ int c) |
2093 | putcharacter (SCHEME_P_ int c) |
2098 | { |
2094 | { |
2099 | #if USE_PORTS |
2095 | #if USE_PORTS |
2100 | port *pt = SCHEME_V->outport->object.port; |
2096 | port *pt = port (SCHEME_V->outport); |
2101 | |
2097 | |
2102 | if (pt->kind & port_file) |
2098 | if (pt->kind & port_file) |
2103 | { |
2099 | { |
2104 | char cc = c; |
2100 | char cc = c; |
2105 | write (pt->rep.stdio.file, &cc, 1); |
2101 | write (pt->rep.stdio.file, &cc, 1); |
… | |
… | |
2118 | #endif |
2114 | #endif |
2119 | } |
2115 | } |
2120 | |
2116 | |
2121 | /* read characters up to delimiter, but cater to character constants */ |
2117 | /* read characters up to delimiter, but cater to character constants */ |
2122 | static char * |
2118 | static char * |
2123 | readstr_upto (SCHEME_P_ char *delim) |
2119 | readstr_upto (SCHEME_P_ int skip, const char *delim) |
2124 | { |
2120 | { |
2125 | char *p = SCHEME_V->strbuff; |
2121 | char *p = SCHEME_V->strbuff + skip; |
2126 | |
2122 | |
2127 | while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A)))); |
2123 | while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A)))); |
2128 | |
2124 | |
2129 | if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\') |
2125 | if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\') |
2130 | *p = 0; |
2126 | *p = 0; |
… | |
… | |
2137 | return SCHEME_V->strbuff; |
2133 | return SCHEME_V->strbuff; |
2138 | } |
2134 | } |
2139 | |
2135 | |
2140 | /* read string expression "xxx...xxx" */ |
2136 | /* read string expression "xxx...xxx" */ |
2141 | static pointer |
2137 | static pointer |
2142 | readstrexp (SCHEME_P) |
2138 | readstrexp (SCHEME_P_ char delim) |
2143 | { |
2139 | { |
2144 | char *p = SCHEME_V->strbuff; |
2140 | char *p = SCHEME_V->strbuff; |
2145 | int c; |
2141 | int c; |
2146 | int c1 = 0; |
2142 | int c1 = 0; |
2147 | enum |
|
|
2148 | { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok; |
2143 | enum { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok; |
2149 | |
2144 | |
2150 | for (;;) |
2145 | for (;;) |
2151 | { |
2146 | { |
2152 | c = inchar (SCHEME_A); |
2147 | c = inchar (SCHEME_A); |
2153 | |
2148 | |
… | |
… | |
2155 | return S_F; |
2150 | return S_F; |
2156 | |
2151 | |
2157 | switch (state) |
2152 | switch (state) |
2158 | { |
2153 | { |
2159 | case st_ok: |
2154 | case st_ok: |
2160 | switch (c) |
2155 | if (ecb_expect_false (c == delim)) |
2161 | { |
|
|
2162 | case '\\': |
|
|
2163 | state = st_bsl; |
|
|
2164 | break; |
|
|
2165 | |
|
|
2166 | case '"': |
|
|
2167 | *p = 0; |
|
|
2168 | return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff); |
2156 | return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff); |
2169 | |
2157 | |
2170 | default: |
2158 | if (ecb_expect_false (c == '\\')) |
|
|
2159 | state = st_bsl; |
|
|
2160 | else |
2171 | *p++ = c; |
2161 | *p++ = c; |
2172 | break; |
|
|
2173 | } |
|
|
2174 | |
2162 | |
2175 | break; |
2163 | break; |
2176 | |
2164 | |
2177 | case st_bsl: |
2165 | case st_bsl: |
2178 | switch (c) |
2166 | switch (c) |
… | |
… | |
2208 | case 'r': |
2196 | case 'r': |
2209 | *p++ = '\r'; |
2197 | *p++ = '\r'; |
2210 | state = st_ok; |
2198 | state = st_ok; |
2211 | break; |
2199 | break; |
2212 | |
2200 | |
2213 | case '"': |
|
|
2214 | *p++ = '"'; |
|
|
2215 | state = st_ok; |
|
|
2216 | break; |
|
|
2217 | |
|
|
2218 | default: |
2201 | default: |
2219 | *p++ = c; |
2202 | *p++ = c; |
2220 | state = st_ok; |
2203 | state = st_ok; |
2221 | break; |
2204 | break; |
2222 | } |
2205 | } |
2223 | |
2206 | |
2224 | break; |
2207 | break; |
2225 | |
2208 | |
2226 | case st_x1: |
2209 | case st_x1: |
2227 | case st_x2: |
2210 | case st_x2: |
2228 | c = toupper (c); |
2211 | c = tolower (c); |
2229 | |
2212 | |
2230 | if (c >= '0' && c <= 'F') |
2213 | if (c >= '0' && c <= '9') |
2231 | { |
|
|
2232 | if (c <= '9') |
|
|
2233 | c1 = (c1 << 4) + c - '0'; |
2214 | c1 = (c1 << 4) + c - '0'; |
2234 | else |
2215 | else if (c >= 'a' && c <= 'f') |
2235 | c1 = (c1 << 4) + c - 'A' + 10; |
2216 | c1 = (c1 << 4) + c - 'a' + 10; |
2236 | |
|
|
2237 | if (state == st_x1) |
|
|
2238 | state = st_x2; |
|
|
2239 | else |
|
|
2240 | { |
|
|
2241 | *p++ = c1; |
|
|
2242 | state = st_ok; |
|
|
2243 | } |
|
|
2244 | } |
|
|
2245 | else |
2217 | else |
2246 | return S_F; |
2218 | return S_F; |
|
|
2219 | |
|
|
2220 | if (state == st_x1) |
|
|
2221 | state = st_x2; |
|
|
2222 | else |
|
|
2223 | { |
|
|
2224 | *p++ = c1; |
|
|
2225 | state = st_ok; |
|
|
2226 | } |
2247 | |
2227 | |
2248 | break; |
2228 | break; |
2249 | |
2229 | |
2250 | case st_oct1: |
2230 | case st_oct1: |
2251 | case st_oct2: |
2231 | case st_oct2: |
… | |
… | |
2255 | backchar (SCHEME_A_ c); |
2235 | backchar (SCHEME_A_ c); |
2256 | state = st_ok; |
2236 | state = st_ok; |
2257 | } |
2237 | } |
2258 | else |
2238 | else |
2259 | { |
2239 | { |
2260 | if (state == st_oct2 && c1 >= 32) |
2240 | if (state == st_oct2 && c1 >= ' ') |
2261 | return S_F; |
2241 | return S_F; |
2262 | |
2242 | |
2263 | c1 = (c1 << 3) + (c - '0'); |
2243 | c1 = (c1 << 3) + (c - '0'); |
2264 | |
2244 | |
2265 | if (state == st_oct1) |
2245 | if (state == st_oct1) |
… | |
… | |
2270 | state = st_ok; |
2250 | state = st_ok; |
2271 | } |
2251 | } |
2272 | } |
2252 | } |
2273 | |
2253 | |
2274 | break; |
2254 | break; |
2275 | |
|
|
2276 | } |
2255 | } |
2277 | } |
2256 | } |
2278 | } |
2257 | } |
2279 | |
2258 | |
2280 | /* check c is in chars */ |
2259 | /* check c is in chars */ |
2281 | static INLINE int |
2260 | ecb_inline int |
2282 | is_one_of (char *s, int c) |
2261 | is_one_of (const char *s, int c) |
2283 | { |
2262 | { |
2284 | if (c == EOF) |
|
|
2285 | return 1; |
|
|
2286 | |
|
|
2287 | return !!strchr (s, c); |
2263 | return c == EOF || !!strchr (s, c); |
2288 | } |
2264 | } |
2289 | |
2265 | |
2290 | /* skip white characters */ |
2266 | /* skip white characters */ |
2291 | static INLINE int |
2267 | ecb_inline int |
2292 | skipspace (SCHEME_P) |
2268 | skipspace (SCHEME_P) |
2293 | { |
2269 | { |
2294 | int c, curr_line = 0; |
2270 | int c, curr_line = 0; |
2295 | |
2271 | |
2296 | do |
2272 | do |
2297 | { |
2273 | { |
2298 | c = inchar (SCHEME_A); |
2274 | c = inchar (SCHEME_A); |
|
|
2275 | |
2299 | #if SHOW_ERROR_LINE |
2276 | #if SHOW_ERROR_LINE |
2300 | if (c == '\n') |
2277 | if (ecb_expect_false (c == '\n')) |
2301 | curr_line++; |
2278 | curr_line++; |
2302 | #endif |
2279 | #endif |
|
|
2280 | |
|
|
2281 | if (ecb_expect_false (c == EOF)) |
|
|
2282 | return c; |
2303 | } |
2283 | } |
2304 | while (c == ' ' || c == '\n' || c == '\r' || c == '\t'); |
2284 | while (is_one_of (WHITESPACE, c)); |
2305 | |
2285 | |
2306 | /* record it */ |
2286 | /* record it */ |
2307 | #if SHOW_ERROR_LINE |
2287 | #if SHOW_ERROR_LINE |
2308 | if (SCHEME_V->load_stack[SCHEME_V->file_i].kind & port_file) |
2288 | if (SCHEME_V->load_stack[SCHEME_V->file_i].kind & port_file) |
2309 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line += curr_line; |
2289 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line += curr_line; |
2310 | #endif |
2290 | #endif |
2311 | |
2291 | |
2312 | if (c != EOF) |
|
|
2313 | { |
|
|
2314 | backchar (SCHEME_A_ c); |
2292 | backchar (SCHEME_A_ c); |
2315 | return 1; |
2293 | return 1; |
2316 | } |
|
|
2317 | else |
|
|
2318 | return EOF; |
|
|
2319 | } |
2294 | } |
2320 | |
2295 | |
2321 | /* get token */ |
2296 | /* get token */ |
2322 | static int |
2297 | static int |
2323 | token (SCHEME_P) |
2298 | token (SCHEME_P) |
… | |
… | |
2339 | return TOK_RPAREN; |
2314 | return TOK_RPAREN; |
2340 | |
2315 | |
2341 | case '.': |
2316 | case '.': |
2342 | c = inchar (SCHEME_A); |
2317 | c = inchar (SCHEME_A); |
2343 | |
2318 | |
2344 | if (is_one_of (" \n\t", c)) |
2319 | if (is_one_of (WHITESPACE, c)) |
2345 | return TOK_DOT; |
2320 | return TOK_DOT; |
2346 | else |
2321 | else |
2347 | { |
2322 | { |
2348 | //TODO: ungetc twice in a row is not supported in C |
|
|
2349 | backchar (SCHEME_A_ c); |
2323 | backchar (SCHEME_A_ c); |
2350 | backchar (SCHEME_A_ '.'); |
|
|
2351 | return TOK_ATOM; |
2324 | return TOK_DOTATOM; |
2352 | } |
2325 | } |
|
|
2326 | |
|
|
2327 | case '|': |
|
|
2328 | return TOK_STRATOM; |
2353 | |
2329 | |
2354 | case '\'': |
2330 | case '\'': |
2355 | return TOK_QUOTE; |
2331 | return TOK_QUOTE; |
2356 | |
2332 | |
2357 | case ';': |
2333 | case ';': |
… | |
… | |
2489 | } |
2465 | } |
2490 | |
2466 | |
2491 | putcharacter (SCHEME_A_ '"'); |
2467 | putcharacter (SCHEME_A_ '"'); |
2492 | } |
2468 | } |
2493 | |
2469 | |
2494 | |
|
|
2495 | /* print atoms */ |
2470 | /* print atoms */ |
2496 | static void |
2471 | static void |
2497 | printatom (SCHEME_P_ pointer l, int f) |
2472 | printatom (SCHEME_P_ pointer l, int f) |
2498 | { |
2473 | { |
2499 | char *p; |
2474 | char *p; |
2500 | int len; |
2475 | int len; |
2501 | |
2476 | |
2502 | atom2str (SCHEME_A_ l, f, &p, &len); |
2477 | atom2str (SCHEME_A_ l, f, &p, &len); |
2503 | putchars (SCHEME_A_ p, len); |
2478 | putchars (SCHEME_A_ p, len); |
2504 | } |
2479 | } |
2505 | |
|
|
2506 | |
2480 | |
2507 | /* Uses internal buffer unless string pointer is already available */ |
2481 | /* Uses internal buffer unless string pointer is already available */ |
2508 | static void |
2482 | static void |
2509 | atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen) |
2483 | atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen) |
2510 | { |
2484 | { |
… | |
… | |
2524 | { |
2498 | { |
2525 | p = SCHEME_V->strbuff; |
2499 | p = SCHEME_V->strbuff; |
2526 | |
2500 | |
2527 | if (f <= 1 || f == 10) /* f is the base for numbers if > 1 */ |
2501 | if (f <= 1 || f == 10) /* f is the base for numbers if > 1 */ |
2528 | { |
2502 | { |
2529 | if (num_is_integer (l)) |
2503 | if (is_integer (l)) |
2530 | xnum (p, ivalue_unchecked (l)); |
2504 | xnum (p, ivalue_unchecked (l)); |
2531 | #if USE_REAL |
2505 | #if USE_REAL |
2532 | else |
2506 | else |
2533 | { |
2507 | { |
2534 | snprintf (p, STRBUFFSIZE, "%.10g", rvalue_unchecked (l)); |
2508 | snprintf (p, STRBUFFSIZE, "%.10g", rvalue_unchecked (l)); |
… | |
… | |
2671 | #endif |
2645 | #endif |
2672 | } |
2646 | } |
2673 | else if (is_continuation (l)) |
2647 | else if (is_continuation (l)) |
2674 | p = "#<CONTINUATION>"; |
2648 | p = "#<CONTINUATION>"; |
2675 | else |
2649 | else |
|
|
2650 | { |
|
|
2651 | #if USE_PRINTF |
|
|
2652 | p = SCHEME_V->strbuff; |
|
|
2653 | snprintf (p, STRBUFFSIZE, "#<ERROR %x>", (int)typeflag (l)); |
|
|
2654 | #else |
2676 | p = "#<ERROR>"; |
2655 | p = "#<ERROR>"; |
|
|
2656 | #endif |
|
|
2657 | } |
2677 | |
2658 | |
2678 | *pp = p; |
2659 | *pp = p; |
2679 | *plen = strlen (p); |
2660 | *plen = strlen (p); |
2680 | } |
2661 | } |
2681 | |
2662 | |
… | |
… | |
2789 | return 0; |
2770 | return 0; |
2790 | } |
2771 | } |
2791 | else if (is_number (a)) |
2772 | else if (is_number (a)) |
2792 | { |
2773 | { |
2793 | if (is_number (b)) |
2774 | if (is_number (b)) |
2794 | if (num_is_integer (a) == num_is_integer (b)) |
|
|
2795 | return num_eq (nvalue (a), nvalue (b)); |
2775 | return num_cmp (nvalue (a), nvalue (b)) == 0; |
2796 | |
2776 | |
2797 | return 0; |
2777 | return 0; |
2798 | } |
2778 | } |
2799 | else if (is_character (a)) |
2779 | else if (is_character (a)) |
2800 | { |
2780 | { |
… | |
… | |
2826 | /* () is #t in R5RS */ |
2806 | /* () is #t in R5RS */ |
2827 | #define is_true(p) ((p) != S_F) |
2807 | #define is_true(p) ((p) != S_F) |
2828 | #define is_false(p) ((p) == S_F) |
2808 | #define is_false(p) ((p) == S_F) |
2829 | |
2809 | |
2830 | /* ========== Environment implementation ========== */ |
2810 | /* ========== Environment implementation ========== */ |
2831 | |
|
|
2832 | #if !defined(USE_ALIST_ENV) || !defined(USE_OBJECT_LIST) |
|
|
2833 | |
|
|
2834 | static int |
|
|
2835 | hash_fn (const char *key, int table_size) |
|
|
2836 | { |
|
|
2837 | const unsigned char *p = key; |
|
|
2838 | uint32_t hash = 2166136261; |
|
|
2839 | |
|
|
2840 | while (*p) |
|
|
2841 | hash = (hash ^ *p++) * 16777619; |
|
|
2842 | |
|
|
2843 | return hash % table_size; |
|
|
2844 | } |
|
|
2845 | #endif |
|
|
2846 | |
2811 | |
2847 | #ifndef USE_ALIST_ENV |
2812 | #ifndef USE_ALIST_ENV |
2848 | |
2813 | |
2849 | /* |
2814 | /* |
2850 | * In this implementation, each frame of the environment may be |
2815 | * In this implementation, each frame of the environment may be |
… | |
… | |
2867 | |
2832 | |
2868 | SCHEME_V->envir = immutable_cons (new_frame, old_env); |
2833 | SCHEME_V->envir = immutable_cons (new_frame, old_env); |
2869 | setenvironment (SCHEME_V->envir); |
2834 | setenvironment (SCHEME_V->envir); |
2870 | } |
2835 | } |
2871 | |
2836 | |
2872 | static INLINE void |
2837 | static uint32_t |
|
|
2838 | sym_hash (pointer sym, uint32_t size) |
|
|
2839 | { |
|
|
2840 | uintptr_t ptr = (uintptr_t)sym; |
|
|
2841 | |
|
|
2842 | #if 0 |
|
|
2843 | /* table size is prime, so why mix */ |
|
|
2844 | ptr += ptr >> 32; |
|
|
2845 | ptr += ptr >> 16; |
|
|
2846 | ptr += ptr >> 8; |
|
|
2847 | #endif |
|
|
2848 | |
|
|
2849 | return ptr % size; |
|
|
2850 | } |
|
|
2851 | |
|
|
2852 | ecb_inline void |
2873 | new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) |
2853 | new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) |
2874 | { |
2854 | { |
2875 | pointer slot = immutable_cons (variable, value); |
2855 | pointer slot = immutable_cons (variable, value); |
2876 | |
2856 | |
2877 | if (is_vector (car (env))) |
2857 | if (is_vector (car (env))) |
2878 | { |
2858 | { |
2879 | int location = hash_fn (symname (variable), veclength (car (env))); |
2859 | int location = sym_hash (variable, veclength (car (env))); |
2880 | |
|
|
2881 | set_vector_elem (car (env), location, immutable_cons (slot, vector_elem (car (env), location))); |
2860 | vector_set (car (env), location, immutable_cons (slot, vector_get (car (env), location))); |
2882 | } |
2861 | } |
2883 | else |
2862 | else |
2884 | set_car (env, immutable_cons (slot, car (env))); |
2863 | set_car (env, immutable_cons (slot, car (env))); |
2885 | } |
2864 | } |
2886 | |
2865 | |
2887 | static pointer |
2866 | static pointer |
2888 | find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all) |
2867 | find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all) |
2889 | { |
2868 | { |
2890 | pointer x, y; |
2869 | pointer x, y; |
2891 | int location; |
|
|
2892 | |
2870 | |
2893 | for (x = env; x != NIL; x = cdr (x)) |
2871 | for (x = env; x != NIL; x = cdr (x)) |
2894 | { |
2872 | { |
2895 | if (is_vector (car (x))) |
2873 | if (is_vector (car (x))) |
2896 | { |
2874 | { |
2897 | location = hash_fn (symname (hdl), veclength (car (x))); |
2875 | int location = sym_hash (hdl, veclength (car (x))); |
2898 | y = vector_elem (car (x), location); |
2876 | y = vector_get (car (x), location); |
2899 | } |
2877 | } |
2900 | else |
2878 | else |
2901 | y = car (x); |
2879 | y = car (x); |
2902 | |
2880 | |
2903 | for (; y != NIL; y = cdr (y)) |
2881 | for (; y != NIL; y = cdr (y)) |
2904 | if (caar (y) == hdl) |
2882 | if (caar (y) == hdl) |
2905 | break; |
2883 | break; |
2906 | |
2884 | |
2907 | if (y != NIL) |
2885 | if (y != NIL) |
|
|
2886 | return car (y); |
|
|
2887 | |
|
|
2888 | if (!all) |
2908 | break; |
2889 | break; |
2909 | |
|
|
2910 | if (!all) |
|
|
2911 | return NIL; |
|
|
2912 | } |
2890 | } |
2913 | |
|
|
2914 | if (x != NIL) |
|
|
2915 | return car (y); |
|
|
2916 | |
2891 | |
2917 | return NIL; |
2892 | return NIL; |
2918 | } |
2893 | } |
2919 | |
2894 | |
2920 | #else /* USE_ALIST_ENV */ |
2895 | #else /* USE_ALIST_ENV */ |
2921 | |
2896 | |
2922 | static INLINE void |
2897 | ecb_inline void |
2923 | new_frame_in_env (SCHEME_P_ pointer old_env) |
2898 | new_frame_in_env (SCHEME_P_ pointer old_env) |
2924 | { |
2899 | { |
2925 | SCHEME_V->envir = immutable_cons (NIL, old_env); |
2900 | SCHEME_V->envir = immutable_cons (NIL, old_env); |
2926 | setenvironment (SCHEME_V->envir); |
2901 | setenvironment (SCHEME_V->envir); |
2927 | } |
2902 | } |
2928 | |
2903 | |
2929 | static INLINE void |
2904 | ecb_inline void |
2930 | new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) |
2905 | new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) |
2931 | { |
2906 | { |
2932 | set_car (env, immutable_cons (immutable_cons (variable, value), car (env))); |
2907 | set_car (env, immutable_cons (immutable_cons (variable, value), car (env))); |
2933 | } |
2908 | } |
2934 | |
2909 | |
… | |
… | |
2942 | for (y = car (x); y != NIL; y = cdr (y)) |
2917 | for (y = car (x); y != NIL; y = cdr (y)) |
2943 | if (caar (y) == hdl) |
2918 | if (caar (y) == hdl) |
2944 | break; |
2919 | break; |
2945 | |
2920 | |
2946 | if (y != NIL) |
2921 | if (y != NIL) |
|
|
2922 | return car (y); |
2947 | break; |
2923 | break; |
2948 | |
2924 | |
2949 | if (!all) |
2925 | if (!all) |
2950 | return NIL; |
2926 | break; |
2951 | } |
2927 | } |
2952 | |
|
|
2953 | if (x != NIL) |
|
|
2954 | return car (y); |
|
|
2955 | |
2928 | |
2956 | return NIL; |
2929 | return NIL; |
2957 | } |
2930 | } |
2958 | |
2931 | |
2959 | #endif /* USE_ALIST_ENV else */ |
2932 | #endif /* USE_ALIST_ENV else */ |
2960 | |
2933 | |
2961 | static INLINE void |
2934 | ecb_inline void |
2962 | new_slot_in_env (SCHEME_P_ pointer variable, pointer value) |
2935 | new_slot_in_env (SCHEME_P_ pointer variable, pointer value) |
2963 | { |
2936 | { |
|
|
2937 | assert (is_symbol (variable));//TODO: bug in current-ws/OP_LET2 |
2964 | new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value); |
2938 | new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value); |
2965 | } |
2939 | } |
2966 | |
2940 | |
2967 | static INLINE void |
2941 | ecb_inline void |
2968 | set_slot_in_env (SCHEME_P_ pointer slot, pointer value) |
2942 | set_slot_in_env (SCHEME_P_ pointer slot, pointer value) |
2969 | { |
2943 | { |
2970 | set_cdr (slot, value); |
2944 | set_cdr (slot, value); |
2971 | } |
2945 | } |
2972 | |
2946 | |
2973 | static INLINE pointer |
2947 | ecb_inline pointer |
2974 | slot_value_in_env (pointer slot) |
2948 | slot_value_in_env (pointer slot) |
2975 | { |
2949 | { |
2976 | return cdr (slot); |
2950 | return cdr (slot); |
2977 | } |
2951 | } |
2978 | |
2952 | |
2979 | /* ========== Evaluation Cycle ========== */ |
2953 | /* ========== Evaluation Cycle ========== */ |
2980 | |
2954 | |
2981 | static pointer |
2955 | static int |
2982 | xError_1 (SCHEME_P_ const char *s, pointer a) |
2956 | xError_1 (SCHEME_P_ const char *s, pointer a) |
2983 | { |
2957 | { |
2984 | #if USE_ERROR_HOOK |
2958 | #if USE_ERROR_HOOK |
2985 | pointer x; |
2959 | pointer x; |
2986 | pointer hdl = SCHEME_V->ERROR_HOOK; |
2960 | pointer hdl = SCHEME_V->ERROR_HOOK; |
… | |
… | |
3021 | code = cons (mk_string (SCHEME_A_ s), code); |
2995 | code = cons (mk_string (SCHEME_A_ s), code); |
3022 | setimmutable (car (code)); |
2996 | setimmutable (car (code)); |
3023 | SCHEME_V->code = cons (slot_value_in_env (x), code); |
2997 | SCHEME_V->code = cons (slot_value_in_env (x), code); |
3024 | SCHEME_V->op = OP_EVAL; |
2998 | SCHEME_V->op = OP_EVAL; |
3025 | |
2999 | |
3026 | return S_T; |
3000 | return 0; |
3027 | } |
3001 | } |
3028 | #endif |
3002 | #endif |
3029 | |
3003 | |
3030 | if (a) |
3004 | if (a) |
3031 | SCHEME_V->args = cons (a, NIL); |
3005 | SCHEME_V->args = cons (a, NIL); |
… | |
… | |
3033 | SCHEME_V->args = NIL; |
3007 | SCHEME_V->args = NIL; |
3034 | |
3008 | |
3035 | SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args); |
3009 | SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args); |
3036 | setimmutable (car (SCHEME_V->args)); |
3010 | setimmutable (car (SCHEME_V->args)); |
3037 | SCHEME_V->op = OP_ERR0; |
3011 | SCHEME_V->op = OP_ERR0; |
|
|
3012 | |
3038 | return S_T; |
3013 | return 0; |
3039 | } |
3014 | } |
3040 | |
3015 | |
3041 | #define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a) |
3016 | #define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a) |
3042 | #define Error_0(s) Error_1 (s, 0) |
3017 | #define Error_0(s) Error_1 (s, 0) |
3043 | |
3018 | |
3044 | /* Too small to turn into function */ |
3019 | /* Too small to turn into function */ |
3045 | #define BEGIN do { |
3020 | #define BEGIN do { |
3046 | #define END } while (0) |
3021 | #define END } while (0) |
3047 | #define s_goto(a) BEGIN \ |
3022 | #define s_goto(a) BEGIN \ |
3048 | SCHEME_V->op = a; \ |
3023 | SCHEME_V->op = a; \ |
3049 | return S_T; END |
3024 | return 0; END |
3050 | |
3025 | |
3051 | #define s_return(a) return xs_return (SCHEME_A_ a) |
3026 | #define s_return(a) return xs_return (SCHEME_A_ a) |
3052 | |
3027 | |
3053 | #ifndef USE_SCHEME_STACK |
3028 | #ifndef USE_SCHEME_STACK |
3054 | |
3029 | |
… | |
… | |
3068 | { |
3043 | { |
3069 | int nframes = (uintptr_t)SCHEME_V->dump; |
3044 | int nframes = (uintptr_t)SCHEME_V->dump; |
3070 | struct dump_stack_frame *next_frame; |
3045 | struct dump_stack_frame *next_frame; |
3071 | |
3046 | |
3072 | /* enough room for the next frame? */ |
3047 | /* enough room for the next frame? */ |
3073 | if (nframes >= SCHEME_V->dump_size) |
3048 | if (ecb_expect_false (nframes >= SCHEME_V->dump_size)) |
3074 | { |
3049 | { |
3075 | SCHEME_V->dump_size += STACK_GROWTH; |
3050 | SCHEME_V->dump_size += STACK_GROWTH; |
3076 | SCHEME_V->dump_base = realloc (SCHEME_V->dump_base, sizeof (struct dump_stack_frame) * SCHEME_V->dump_size); |
3051 | SCHEME_V->dump_base = realloc (SCHEME_V->dump_base, sizeof (struct dump_stack_frame) * SCHEME_V->dump_size); |
3077 | } |
3052 | } |
3078 | |
3053 | |
3079 | next_frame = SCHEME_V->dump_base + nframes; |
3054 | next_frame = SCHEME_V->dump_base + nframes; |
3080 | |
3055 | |
3081 | next_frame->op = op; |
3056 | next_frame->op = op; |
3082 | next_frame->args = args; |
3057 | next_frame->args = args; |
3083 | next_frame->envir = SCHEME_V->envir; |
3058 | next_frame->envir = SCHEME_V->envir; |
3084 | next_frame->code = code; |
3059 | next_frame->code = code; |
3085 | |
3060 | |
3086 | SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1); |
3061 | SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1); |
3087 | } |
3062 | } |
3088 | |
3063 | |
3089 | static pointer |
3064 | static int |
3090 | xs_return (SCHEME_P_ pointer a) |
3065 | xs_return (SCHEME_P_ pointer a) |
3091 | { |
3066 | { |
3092 | int nframes = (uintptr_t)SCHEME_V->dump; |
3067 | int nframes = (uintptr_t)SCHEME_V->dump; |
3093 | struct dump_stack_frame *frame; |
3068 | struct dump_stack_frame *frame; |
3094 | |
3069 | |
3095 | SCHEME_V->value = a; |
3070 | SCHEME_V->value = a; |
3096 | |
3071 | |
3097 | if (nframes <= 0) |
3072 | if (nframes <= 0) |
3098 | return NIL; |
3073 | return -1; |
3099 | |
3074 | |
3100 | frame = &SCHEME_V->dump_base[--nframes]; |
3075 | frame = &SCHEME_V->dump_base[--nframes]; |
3101 | SCHEME_V->op = frame->op; |
3076 | SCHEME_V->op = frame->op; |
3102 | SCHEME_V->args = frame->args; |
3077 | SCHEME_V->args = frame->args; |
3103 | SCHEME_V->envir = frame->envir; |
3078 | SCHEME_V->envir = frame->envir; |
3104 | SCHEME_V->code = frame->code; |
3079 | SCHEME_V->code = frame->code; |
3105 | SCHEME_V->dump = (pointer)(uintptr_t)nframes; |
3080 | SCHEME_V->dump = (pointer)(uintptr_t)nframes; |
3106 | |
3081 | |
3107 | return S_T; |
3082 | return 0; |
3108 | } |
3083 | } |
3109 | |
3084 | |
3110 | static INLINE void |
3085 | ecb_inline void |
3111 | dump_stack_reset (SCHEME_P) |
3086 | dump_stack_reset (SCHEME_P) |
3112 | { |
3087 | { |
3113 | /* in this implementation, SCHEME_V->dump is the number of frames on the stack */ |
3088 | /* in this implementation, SCHEME_V->dump is the number of frames on the stack */ |
3114 | SCHEME_V->dump = (pointer)+0; |
3089 | SCHEME_V->dump = (pointer)+0; |
3115 | } |
3090 | } |
3116 | |
3091 | |
3117 | static INLINE void |
3092 | ecb_inline void |
3118 | dump_stack_initialize (SCHEME_P) |
3093 | dump_stack_initialize (SCHEME_P) |
3119 | { |
3094 | { |
3120 | SCHEME_V->dump_size = 0; |
3095 | SCHEME_V->dump_size = 0; |
3121 | SCHEME_V->dump_base = 0; |
3096 | SCHEME_V->dump_base = 0; |
3122 | dump_stack_reset (SCHEME_A); |
3097 | dump_stack_reset (SCHEME_A); |
… | |
… | |
3175 | int i = 0; |
3150 | int i = 0; |
3176 | struct dump_stack_frame *frame = SCHEME_V->dump_base; |
3151 | struct dump_stack_frame *frame = SCHEME_V->dump_base; |
3177 | |
3152 | |
3178 | while (cont != NIL) |
3153 | while (cont != NIL) |
3179 | { |
3154 | { |
3180 | frame->op = ivalue (car (cont)); cont = cdr (cont); |
3155 | frame->op = ivalue_unchecked (car (cont)); cont = cdr (cont); |
3181 | frame->args = car (cont) ; cont = cdr (cont); |
3156 | frame->args = car (cont) ; cont = cdr (cont); |
3182 | frame->envir = car (cont) ; cont = cdr (cont); |
3157 | frame->envir = car (cont) ; cont = cdr (cont); |
3183 | frame->code = car (cont) ; cont = cdr (cont); |
3158 | frame->code = car (cont) ; cont = cdr (cont); |
3184 | |
3159 | |
3185 | ++frame; |
3160 | ++frame; |
3186 | ++i; |
3161 | ++i; |
3187 | } |
3162 | } |
3188 | |
3163 | |
3189 | SCHEME_V->dump = (pointer)(uintptr_t)i; |
3164 | SCHEME_V->dump = (pointer)(uintptr_t)i; |
3190 | } |
3165 | } |
3191 | |
3166 | |
3192 | #else |
3167 | #else |
3193 | |
3168 | |
3194 | static INLINE void |
3169 | ecb_inline void |
3195 | dump_stack_reset (SCHEME_P) |
3170 | dump_stack_reset (SCHEME_P) |
3196 | { |
3171 | { |
3197 | SCHEME_V->dump = NIL; |
3172 | SCHEME_V->dump = NIL; |
3198 | } |
3173 | } |
3199 | |
3174 | |
3200 | static INLINE void |
3175 | ecb_inline void |
3201 | dump_stack_initialize (SCHEME_P) |
3176 | dump_stack_initialize (SCHEME_P) |
3202 | { |
3177 | { |
3203 | dump_stack_reset (SCHEME_A); |
3178 | dump_stack_reset (SCHEME_A); |
3204 | } |
3179 | } |
3205 | |
3180 | |
… | |
… | |
3207 | dump_stack_free (SCHEME_P) |
3182 | dump_stack_free (SCHEME_P) |
3208 | { |
3183 | { |
3209 | SCHEME_V->dump = NIL; |
3184 | SCHEME_V->dump = NIL; |
3210 | } |
3185 | } |
3211 | |
3186 | |
3212 | static pointer |
3187 | static int |
3213 | xs_return (SCHEME_P_ pointer a) |
3188 | xs_return (SCHEME_P_ pointer a) |
3214 | { |
3189 | { |
3215 | pointer dump = SCHEME_V->dump; |
3190 | pointer dump = SCHEME_V->dump; |
3216 | |
3191 | |
3217 | SCHEME_V->value = a; |
3192 | SCHEME_V->value = a; |
3218 | |
3193 | |
3219 | if (dump == NIL) |
3194 | if (dump == NIL) |
3220 | return NIL; |
3195 | return -1; |
3221 | |
3196 | |
3222 | SCHEME_V->op = ivalue (car (dump)); dump = cdr (dump); |
3197 | SCHEME_V->op = ivalue_unchecked (car (dump)); dump = cdr (dump); |
3223 | SCHEME_V->args = car (dump) ; dump = cdr (dump); |
3198 | SCHEME_V->args = car (dump) ; dump = cdr (dump); |
3224 | SCHEME_V->envir = car (dump) ; dump = cdr (dump); |
3199 | SCHEME_V->envir = car (dump) ; dump = cdr (dump); |
3225 | SCHEME_V->code = car (dump) ; dump = cdr (dump); |
3200 | SCHEME_V->code = car (dump) ; dump = cdr (dump); |
3226 | |
3201 | |
3227 | SCHEME_V->dump = dump; |
3202 | SCHEME_V->dump = dump; |
3228 | |
3203 | |
3229 | return S_T; |
3204 | return 0; |
3230 | } |
3205 | } |
3231 | |
3206 | |
3232 | static void |
3207 | static void |
3233 | s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code) |
3208 | s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code) |
3234 | { |
3209 | { |
… | |
… | |
3259 | |
3234 | |
3260 | #endif |
3235 | #endif |
3261 | |
3236 | |
3262 | #define s_retbool(tf) s_return ((tf) ? S_T : S_F) |
3237 | #define s_retbool(tf) s_return ((tf) ? S_T : S_F) |
3263 | |
3238 | |
|
|
3239 | #if EXPERIMENT |
3264 | static pointer |
3240 | static int |
|
|
3241 | debug (SCHEME_P_ int indent, pointer x) |
|
|
3242 | { |
|
|
3243 | int c; |
|
|
3244 | |
|
|
3245 | if (is_syntax (x)) |
|
|
3246 | { |
|
|
3247 | printf ("%*ssyntax<%s,%d>\n", indent, "", syntaxname(x),syntaxnum(x)); |
|
|
3248 | return 8 + 8; |
|
|
3249 | } |
|
|
3250 | |
|
|
3251 | if (x == NIL) |
|
|
3252 | { |
|
|
3253 | printf ("%*sNIL\n", indent, ""); |
|
|
3254 | return 3; |
|
|
3255 | } |
|
|
3256 | |
|
|
3257 | switch (type (x)) |
|
|
3258 | { |
|
|
3259 | case T_INTEGER: |
|
|
3260 | printf ("%*sI<%d>%p\n", indent, "", (int)ivalue_unchecked (x), x); |
|
|
3261 | return 32+8; |
|
|
3262 | |
|
|
3263 | case T_SYMBOL: |
|
|
3264 | printf ("%*sS<%s>\n", indent, "", symname (x)); |
|
|
3265 | return 24+8; |
|
|
3266 | |
|
|
3267 | case T_CLOSURE: |
|
|
3268 | printf ("%*sS<%s>\n", indent, "", "closure"); |
|
|
3269 | debug (SCHEME_A_ indent + 3, cdr(x)); |
|
|
3270 | return 32 + debug (SCHEME_A_ indent + 3, car (x)); |
|
|
3271 | |
|
|
3272 | case T_PAIR: |
|
|
3273 | printf ("%*spair %p %p\n", indent, "", car(x),cdr(x)); |
|
|
3274 | c = debug (SCHEME_A_ indent + 3, car (x)); |
|
|
3275 | c += debug (SCHEME_A_ indent + 3, cdr (x)); |
|
|
3276 | return c + 1; |
|
|
3277 | |
|
|
3278 | case T_PORT: |
|
|
3279 | printf ("%*sS<%s>\n", indent, "", "port"); |
|
|
3280 | return 24+8; |
|
|
3281 | |
|
|
3282 | case T_VECTOR: |
|
|
3283 | printf ("%*sS<%s>\n", indent, "", "vector"); |
|
|
3284 | return 24+8; |
|
|
3285 | |
|
|
3286 | case T_ENVIRONMENT: |
|
|
3287 | printf ("%*sS<%s>\n", indent, "", "environment"); |
|
|
3288 | return 0 + debug (SCHEME_A_ indent + 3, car (x)); |
|
|
3289 | |
|
|
3290 | default: |
|
|
3291 | printf ("unhandled type %d\n", type (x)); |
|
|
3292 | break; |
|
|
3293 | } |
|
|
3294 | } |
|
|
3295 | #endif |
|
|
3296 | |
|
|
3297 | static int |
3265 | opexe_0 (SCHEME_P_ enum scheme_opcodes op) |
3298 | opexe_0 (SCHEME_P_ enum scheme_opcodes op) |
3266 | { |
3299 | { |
|
|
3300 | pointer args = SCHEME_V->args; |
3267 | pointer x, y; |
3301 | pointer x, y; |
3268 | |
3302 | |
3269 | switch (op) |
3303 | switch (op) |
3270 | { |
3304 | { |
|
|
3305 | #if EXPERIMENT //D |
|
|
3306 | case OP_DEBUG: |
|
|
3307 | printf ("len = %d\n", debug (SCHEME_A_ 0, args) / 8); |
|
|
3308 | printf ("\n"); |
|
|
3309 | s_return (S_T); |
|
|
3310 | #endif |
3271 | case OP_LOAD: /* load */ |
3311 | case OP_LOAD: /* load */ |
3272 | if (file_interactive (SCHEME_A)) |
3312 | if (file_interactive (SCHEME_A)) |
3273 | { |
3313 | { |
3274 | xwrstr ("Loading "); xwrstr (strvalue (car (SCHEME_V->args))); xwrstr ("\n"); |
3314 | putstr (SCHEME_A_ "Loading "); putstr (SCHEME_A_ strvalue (car (args))); putstr (SCHEME_A_ "\n"); |
3275 | //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (SCHEME_V->args))); |
3315 | //D fprintf (port (SCHEME_V->outport)->rep.stdio.file, "Loading %s\n", strvalue (car (args))); |
3276 | } |
3316 | } |
3277 | |
3317 | |
3278 | if (!file_push (SCHEME_A_ strvalue (car (SCHEME_V->args)))) |
3318 | if (!file_push (SCHEME_A_ strvalue (car (args)))) |
3279 | Error_1 ("unable to open", car (SCHEME_V->args)); |
3319 | Error_1 ("unable to open", car (args)); |
3280 | else |
3320 | else |
3281 | { |
3321 | { |
3282 | SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i); |
3322 | SCHEME_V->args = mk_integer (SCHEME_A_ SCHEME_V->file_i); |
3283 | s_goto (OP_T0LVL); |
3323 | s_goto (OP_T0LVL); |
3284 | } |
3324 | } |
3285 | |
3325 | |
3286 | case OP_T0LVL: /* top level */ |
3326 | case OP_T0LVL: /* top level */ |
3287 | |
3327 | |
3288 | /* If we reached the end of file, this loop is done. */ |
3328 | /* If we reached the end of file, this loop is done. */ |
3289 | if (SCHEME_V->loadport->object.port->kind & port_saw_EOF) |
3329 | if (port (SCHEME_V->loadport)->kind & port_saw_EOF) |
3290 | { |
3330 | { |
3291 | if (SCHEME_V->file_i == 0) |
3331 | if (SCHEME_V->file_i == 0) |
3292 | { |
3332 | { |
3293 | SCHEME_V->args = NIL; |
3333 | SCHEME_V->args = NIL; |
3294 | s_goto (OP_QUIT); |
3334 | s_goto (OP_QUIT); |
… | |
… | |
3358 | case OP_EVAL: /* main part of evaluation */ |
3398 | case OP_EVAL: /* main part of evaluation */ |
3359 | #if USE_TRACING |
3399 | #if USE_TRACING |
3360 | if (SCHEME_V->tracing) |
3400 | if (SCHEME_V->tracing) |
3361 | { |
3401 | { |
3362 | /*s_save(SCHEME_A_ OP_VALUEPRINT,NIL,NIL); */ |
3402 | /*s_save(SCHEME_A_ OP_VALUEPRINT,NIL,NIL); */ |
3363 | s_save (SCHEME_A_ OP_REAL_EVAL, SCHEME_V->args, SCHEME_V->code); |
3403 | s_save (SCHEME_A_ OP_REAL_EVAL, args, SCHEME_V->code); |
3364 | SCHEME_V->args = SCHEME_V->code; |
3404 | SCHEME_V->args = SCHEME_V->code; |
3365 | putstr (SCHEME_A_ "\nEval: "); |
3405 | putstr (SCHEME_A_ "\nEval: "); |
3366 | s_goto (OP_P0LIST); |
3406 | s_goto (OP_P0LIST); |
3367 | } |
3407 | } |
3368 | |
3408 | |
… | |
… | |
3372 | #endif |
3412 | #endif |
3373 | if (is_symbol (SCHEME_V->code)) /* symbol */ |
3413 | if (is_symbol (SCHEME_V->code)) /* symbol */ |
3374 | { |
3414 | { |
3375 | x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 1); |
3415 | x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 1); |
3376 | |
3416 | |
3377 | if (x != NIL) |
3417 | if (x == NIL) |
3378 | s_return (slot_value_in_env (x)); |
|
|
3379 | else |
|
|
3380 | Error_1 ("eval: unbound variable:", SCHEME_V->code); |
3418 | Error_1 ("eval: unbound variable:", SCHEME_V->code); |
|
|
3419 | |
|
|
3420 | s_return (slot_value_in_env (x)); |
3381 | } |
3421 | } |
3382 | else if (is_pair (SCHEME_V->code)) |
3422 | else if (is_pair (SCHEME_V->code)) |
3383 | { |
3423 | { |
3384 | x = car (SCHEME_V->code); |
3424 | x = car (SCHEME_V->code); |
3385 | |
3425 | |
… | |
… | |
3398 | } |
3438 | } |
3399 | else |
3439 | else |
3400 | s_return (SCHEME_V->code); |
3440 | s_return (SCHEME_V->code); |
3401 | |
3441 | |
3402 | case OP_E0ARGS: /* eval arguments */ |
3442 | case OP_E0ARGS: /* eval arguments */ |
3403 | if (is_macro (SCHEME_V->value)) /* macro expansion */ |
3443 | if (ecb_expect_false (is_macro (SCHEME_V->value))) /* macro expansion */ |
3404 | { |
3444 | { |
3405 | s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL); |
3445 | s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL); |
3406 | SCHEME_V->args = cons (SCHEME_V->code, NIL); |
3446 | SCHEME_V->args = cons (SCHEME_V->code, NIL); |
3407 | SCHEME_V->code = SCHEME_V->value; |
3447 | SCHEME_V->code = SCHEME_V->value; |
3408 | s_goto (OP_APPLY); |
3448 | s_goto (OP_APPLY); |
… | |
… | |
3412 | SCHEME_V->code = cdr (SCHEME_V->code); |
3452 | SCHEME_V->code = cdr (SCHEME_V->code); |
3413 | s_goto (OP_E1ARGS); |
3453 | s_goto (OP_E1ARGS); |
3414 | } |
3454 | } |
3415 | |
3455 | |
3416 | case OP_E1ARGS: /* eval arguments */ |
3456 | case OP_E1ARGS: /* eval arguments */ |
3417 | SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); |
3457 | args = cons (SCHEME_V->value, args); |
3418 | |
3458 | |
3419 | if (is_pair (SCHEME_V->code)) /* continue */ |
3459 | if (is_pair (SCHEME_V->code)) /* continue */ |
3420 | { |
3460 | { |
3421 | s_save (SCHEME_A_ OP_E1ARGS, SCHEME_V->args, cdr (SCHEME_V->code)); |
3461 | s_save (SCHEME_A_ OP_E1ARGS, args, cdr (SCHEME_V->code)); |
3422 | SCHEME_V->code = car (SCHEME_V->code); |
3462 | SCHEME_V->code = car (SCHEME_V->code); |
3423 | SCHEME_V->args = NIL; |
3463 | SCHEME_V->args = NIL; |
3424 | s_goto (OP_EVAL); |
3464 | s_goto (OP_EVAL); |
3425 | } |
3465 | } |
3426 | else /* end */ |
3466 | else /* end */ |
3427 | { |
3467 | { |
3428 | SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); |
3468 | args = reverse_in_place (SCHEME_A_ NIL, args); |
3429 | SCHEME_V->code = car (SCHEME_V->args); |
3469 | SCHEME_V->code = car (args); |
3430 | SCHEME_V->args = cdr (SCHEME_V->args); |
3470 | SCHEME_V->args = cdr (args); |
3431 | s_goto (OP_APPLY); |
3471 | s_goto (OP_APPLY); |
3432 | } |
3472 | } |
3433 | |
3473 | |
3434 | #if USE_TRACING |
3474 | #if USE_TRACING |
3435 | |
3475 | |
3436 | case OP_TRACING: |
3476 | case OP_TRACING: |
3437 | { |
3477 | { |
3438 | int tr = SCHEME_V->tracing; |
3478 | int tr = SCHEME_V->tracing; |
3439 | |
3479 | |
3440 | SCHEME_V->tracing = ivalue (car (SCHEME_V->args)); |
3480 | SCHEME_V->tracing = ivalue_unchecked (car (args)); |
3441 | s_return (mk_integer (SCHEME_A_ tr)); |
3481 | s_return (mk_integer (SCHEME_A_ tr)); |
3442 | } |
3482 | } |
3443 | |
3483 | |
3444 | #endif |
3484 | #endif |
3445 | |
3485 | |
3446 | case OP_APPLY: /* apply 'code' to 'args' */ |
3486 | case OP_APPLY: /* apply 'code' to 'args' */ |
3447 | #if USE_TRACING |
3487 | #if USE_TRACING |
3448 | if (SCHEME_V->tracing) |
3488 | if (SCHEME_V->tracing) |
3449 | { |
3489 | { |
3450 | s_save (SCHEME_A_ OP_REAL_APPLY, SCHEME_V->args, SCHEME_V->code); |
3490 | s_save (SCHEME_A_ OP_REAL_APPLY, args, SCHEME_V->code); |
3451 | SCHEME_V->print_flag = 1; |
3491 | SCHEME_V->print_flag = 1; |
3452 | /* SCHEME_V->args=cons(SCHEME_V->code,SCHEME_V->args); */ |
3492 | /* args=cons(SCHEME_V->code,args); */ |
3453 | putstr (SCHEME_A_ "\nApply to: "); |
3493 | putstr (SCHEME_A_ "\nApply to: "); |
3454 | s_goto (OP_P0LIST); |
3494 | s_goto (OP_P0LIST); |
3455 | } |
3495 | } |
3456 | |
3496 | |
3457 | /* fall through */ |
3497 | /* fall through */ |
3458 | |
3498 | |
3459 | case OP_REAL_APPLY: |
3499 | case OP_REAL_APPLY: |
3460 | #endif |
3500 | #endif |
3461 | if (is_proc (SCHEME_V->code)) |
3501 | if (is_proc (SCHEME_V->code)) |
3462 | { |
|
|
3463 | s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */ |
3502 | s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */ |
3464 | } |
|
|
3465 | else if (is_foreign (SCHEME_V->code)) |
3503 | else if (is_foreign (SCHEME_V->code)) |
3466 | { |
3504 | { |
3467 | /* Keep nested calls from GC'ing the arglist */ |
3505 | /* Keep nested calls from GC'ing the arglist */ |
3468 | push_recent_alloc (SCHEME_A_ SCHEME_V->args, NIL); |
3506 | push_recent_alloc (SCHEME_A_ args, NIL); |
3469 | x = SCHEME_V->code->object.ff (SCHEME_A_ SCHEME_V->args); |
3507 | x = CELL(SCHEME_V->code)->object.ff (SCHEME_A_ args); |
3470 | |
3508 | |
3471 | s_return (x); |
3509 | s_return (x); |
3472 | } |
3510 | } |
3473 | else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */ |
3511 | else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */ |
3474 | { |
3512 | { |
3475 | /* Should not accept promise */ |
3513 | /* Should not accept promise */ |
3476 | /* make environment */ |
3514 | /* make environment */ |
3477 | new_frame_in_env (SCHEME_A_ closure_env (SCHEME_V->code)); |
3515 | new_frame_in_env (SCHEME_A_ closure_env (SCHEME_V->code)); |
3478 | |
3516 | |
3479 | for (x = car (closure_code (SCHEME_V->code)), y = SCHEME_V->args; is_pair (x); x = cdr (x), y = cdr (y)) |
3517 | for (x = car (closure_code (SCHEME_V->code)), y = args; is_pair (x); x = cdr (x), y = cdr (y)) |
3480 | { |
3518 | { |
3481 | if (y == NIL) |
3519 | if (y == NIL) |
3482 | Error_0 ("not enough arguments"); |
3520 | Error_0 ("not enough arguments"); |
3483 | else |
3521 | else |
3484 | new_slot_in_env (SCHEME_A_ car (x), car (y)); |
3522 | new_slot_in_env (SCHEME_A_ car (x), car (y)); |
… | |
… | |
3502 | s_goto (OP_BEGIN); |
3540 | s_goto (OP_BEGIN); |
3503 | } |
3541 | } |
3504 | else if (is_continuation (SCHEME_V->code)) /* CONTINUATION */ |
3542 | else if (is_continuation (SCHEME_V->code)) /* CONTINUATION */ |
3505 | { |
3543 | { |
3506 | ss_set_cont (SCHEME_A_ cont_dump (SCHEME_V->code)); |
3544 | ss_set_cont (SCHEME_A_ cont_dump (SCHEME_V->code)); |
3507 | s_return (SCHEME_V->args != NIL ? car (SCHEME_V->args) : NIL); |
3545 | s_return (args != NIL ? car (args) : NIL); |
3508 | } |
3546 | } |
3509 | else |
3547 | else |
3510 | Error_0 ("illegal function"); |
3548 | Error_0 ("illegal function"); |
3511 | |
3549 | |
3512 | case OP_DOMACRO: /* do macro */ |
3550 | case OP_DOMACRO: /* do macro */ |
3513 | SCHEME_V->code = SCHEME_V->value; |
3551 | SCHEME_V->code = SCHEME_V->value; |
3514 | s_goto (OP_EVAL); |
3552 | s_goto (OP_EVAL); |
3515 | |
|
|
3516 | #if 1 |
|
|
3517 | |
3553 | |
3518 | case OP_LAMBDA: /* lambda */ |
3554 | case OP_LAMBDA: /* lambda */ |
3519 | /* If the hook is defined, apply it to SCHEME_V->code, otherwise |
3555 | /* If the hook is defined, apply it to SCHEME_V->code, otherwise |
3520 | set SCHEME_V->value fall thru */ |
3556 | set SCHEME_V->value fall thru */ |
3521 | { |
3557 | { |
3522 | pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1); |
3558 | pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1); |
3523 | |
3559 | |
3524 | if (f != NIL) |
3560 | if (f != NIL) |
3525 | { |
3561 | { |
3526 | s_save (SCHEME_A_ OP_LAMBDA1, SCHEME_V->args, SCHEME_V->code); |
3562 | s_save (SCHEME_A_ OP_LAMBDA1, args, SCHEME_V->code); |
3527 | SCHEME_V->args = cons (SCHEME_V->code, NIL); |
3563 | SCHEME_V->args = cons (SCHEME_V->code, NIL); |
3528 | SCHEME_V->code = slot_value_in_env (f); |
3564 | SCHEME_V->code = slot_value_in_env (f); |
3529 | s_goto (OP_APPLY); |
3565 | s_goto (OP_APPLY); |
3530 | } |
3566 | } |
3531 | |
3567 | |
3532 | SCHEME_V->value = SCHEME_V->code; |
3568 | SCHEME_V->value = SCHEME_V->code; |
3533 | /* Fallthru */ |
|
|
3534 | } |
3569 | } |
|
|
3570 | /* Fallthru */ |
3535 | |
3571 | |
3536 | case OP_LAMBDA1: |
3572 | case OP_LAMBDA1: |
3537 | s_return (mk_closure (SCHEME_A_ SCHEME_V->value, SCHEME_V->envir)); |
3573 | s_return (mk_closure (SCHEME_A_ SCHEME_V->value, SCHEME_V->envir)); |
3538 | |
3574 | |
3539 | #else |
|
|
3540 | |
|
|
3541 | case OP_LAMBDA: /* lambda */ |
|
|
3542 | s_return (mk_closure (SCHEME_A_ SCHEME_V->code, SCHEME_V->envir)); |
|
|
3543 | |
|
|
3544 | #endif |
|
|
3545 | |
|
|
3546 | case OP_MKCLOSURE: /* make-closure */ |
3575 | case OP_MKCLOSURE: /* make-closure */ |
3547 | x = car (SCHEME_V->args); |
3576 | x = car (args); |
3548 | |
3577 | |
3549 | if (car (x) == SCHEME_V->LAMBDA) |
3578 | if (car (x) == SCHEME_V->LAMBDA) |
3550 | x = cdr (x); |
3579 | x = cdr (x); |
3551 | |
3580 | |
3552 | if (cdr (SCHEME_V->args) == NIL) |
3581 | if (cdr (args) == NIL) |
3553 | y = SCHEME_V->envir; |
3582 | y = SCHEME_V->envir; |
3554 | else |
3583 | else |
3555 | y = cadr (SCHEME_V->args); |
3584 | y = cadr (args); |
3556 | |
3585 | |
3557 | s_return (mk_closure (SCHEME_A_ x, y)); |
3586 | s_return (mk_closure (SCHEME_A_ x, y)); |
3558 | |
3587 | |
3559 | case OP_QUOTE: /* quote */ |
3588 | case OP_QUOTE: /* quote */ |
3560 | s_return (car (SCHEME_V->code)); |
3589 | s_return (car (SCHEME_V->code)); |
… | |
… | |
3592 | |
3621 | |
3593 | |
3622 | |
3594 | case OP_DEFP: /* defined? */ |
3623 | case OP_DEFP: /* defined? */ |
3595 | x = SCHEME_V->envir; |
3624 | x = SCHEME_V->envir; |
3596 | |
3625 | |
3597 | if (cdr (SCHEME_V->args) != NIL) |
3626 | if (cdr (args) != NIL) |
3598 | x = cadr (SCHEME_V->args); |
3627 | x = cadr (args); |
3599 | |
3628 | |
3600 | s_retbool (find_slot_in_env (SCHEME_A_ x, car (SCHEME_V->args), 1) != NIL); |
3629 | s_retbool (find_slot_in_env (SCHEME_A_ x, car (args), 1) != NIL); |
3601 | |
3630 | |
3602 | case OP_SET0: /* set! */ |
3631 | case OP_SET0: /* set! */ |
3603 | if (is_immutable (car (SCHEME_V->code))) |
3632 | if (is_immutable (car (SCHEME_V->code))) |
3604 | Error_1 ("set!: unable to alter immutable variable", car (SCHEME_V->code)); |
3633 | Error_1 ("set!: unable to alter immutable variable", car (SCHEME_V->code)); |
3605 | |
3634 | |
… | |
… | |
3636 | |
3665 | |
3637 | case OP_IF1: /* if */ |
3666 | case OP_IF1: /* if */ |
3638 | if (is_true (SCHEME_V->value)) |
3667 | if (is_true (SCHEME_V->value)) |
3639 | SCHEME_V->code = car (SCHEME_V->code); |
3668 | SCHEME_V->code = car (SCHEME_V->code); |
3640 | else |
3669 | else |
3641 | SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because |
3670 | SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because * car(NIL) = NIL */ |
3642 | |
|
|
3643 | * car(NIL) = NIL */ |
|
|
3644 | s_goto (OP_EVAL); |
3671 | s_goto (OP_EVAL); |
3645 | |
3672 | |
3646 | case OP_LET0: /* let */ |
3673 | case OP_LET0: /* let */ |
3647 | SCHEME_V->args = NIL; |
3674 | SCHEME_V->args = NIL; |
3648 | SCHEME_V->value = SCHEME_V->code; |
3675 | SCHEME_V->value = SCHEME_V->code; |
3649 | SCHEME_V->code = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code); |
3676 | SCHEME_V->code = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code); |
3650 | s_goto (OP_LET1); |
3677 | s_goto (OP_LET1); |
3651 | |
3678 | |
3652 | case OP_LET1: /* let (calculate parameters) */ |
3679 | case OP_LET1: /* let (calculate parameters) */ |
3653 | SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); |
3680 | args = cons (SCHEME_V->value, args); |
3654 | |
3681 | |
3655 | if (is_pair (SCHEME_V->code)) /* continue */ |
3682 | if (is_pair (SCHEME_V->code)) /* continue */ |
3656 | { |
3683 | { |
3657 | if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code))) |
3684 | if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code))) |
3658 | Error_1 ("Bad syntax of binding spec in let :", car (SCHEME_V->code)); |
3685 | Error_1 ("Bad syntax of binding spec in let :", car (SCHEME_V->code)); |
3659 | |
3686 | |
3660 | s_save (SCHEME_A_ OP_LET1, SCHEME_V->args, cdr (SCHEME_V->code)); |
3687 | s_save (SCHEME_A_ OP_LET1, args, cdr (SCHEME_V->code)); |
3661 | SCHEME_V->code = cadar (SCHEME_V->code); |
3688 | SCHEME_V->code = cadar (SCHEME_V->code); |
3662 | SCHEME_V->args = NIL; |
3689 | SCHEME_V->args = NIL; |
3663 | s_goto (OP_EVAL); |
3690 | s_goto (OP_EVAL); |
3664 | } |
3691 | } |
3665 | else /* end */ |
3692 | else /* end */ |
3666 | { |
3693 | { |
3667 | SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); |
3694 | args = reverse_in_place (SCHEME_A_ NIL, args); |
3668 | SCHEME_V->code = car (SCHEME_V->args); |
3695 | SCHEME_V->code = car (args); |
3669 | SCHEME_V->args = cdr (SCHEME_V->args); |
3696 | SCHEME_V->args = cdr (args); |
3670 | s_goto (OP_LET2); |
3697 | s_goto (OP_LET2); |
3671 | } |
3698 | } |
3672 | |
3699 | |
3673 | case OP_LET2: /* let */ |
3700 | case OP_LET2: /* let */ |
3674 | new_frame_in_env (SCHEME_A_ SCHEME_V->envir); |
3701 | new_frame_in_env (SCHEME_A_ SCHEME_V->envir); |
3675 | |
3702 | |
3676 | for (x = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code), y = SCHEME_V->args; |
3703 | for (x = is_symbol (car (SCHEME_V->code)) ? cadr (SCHEME_V->code) : car (SCHEME_V->code), y = args; |
3677 | y != NIL; x = cdr (x), y = cdr (y)) |
3704 | y != NIL; x = cdr (x), y = cdr (y)) |
3678 | new_slot_in_env (SCHEME_A_ caar (x), car (y)); |
3705 | new_slot_in_env (SCHEME_A_ caar (x), car (y)); |
3679 | |
3706 | |
3680 | if (is_symbol (car (SCHEME_V->code))) /* named let */ |
3707 | if (is_symbol (car (SCHEME_V->code))) /* named let */ |
3681 | { |
3708 | { |
3682 | for (x = cadr (SCHEME_V->code), SCHEME_V->args = NIL; x != NIL; x = cdr (x)) |
3709 | for (x = cadr (SCHEME_V->code), args = NIL; x != NIL; x = cdr (x)) |
3683 | { |
3710 | { |
3684 | if (!is_pair (x)) |
3711 | if (!is_pair (x)) |
3685 | Error_1 ("Bad syntax of binding in let :", x); |
3712 | Error_1 ("Bad syntax of binding in let :", x); |
3686 | |
3713 | |
3687 | if (!is_list (SCHEME_A_ car (x))) |
3714 | if (!is_list (SCHEME_A_ car (x))) |
3688 | Error_1 ("Bad syntax of binding in let :", car (x)); |
3715 | Error_1 ("Bad syntax of binding in let :", car (x)); |
3689 | |
3716 | |
3690 | SCHEME_V->args = cons (caar (x), SCHEME_V->args); |
3717 | args = cons (caar (x), args); |
3691 | } |
3718 | } |
3692 | |
3719 | |
3693 | x = |
|
|
3694 | mk_closure (SCHEME_A_ cons (reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args), cddr (SCHEME_V->code)), |
3720 | x = mk_closure (SCHEME_A_ cons (reverse_in_place (SCHEME_A_ NIL, args), cddr (SCHEME_V->code)), |
3695 | SCHEME_V->envir); |
3721 | SCHEME_V->envir); |
3696 | new_slot_in_env (SCHEME_A_ car (SCHEME_V->code), x); |
3722 | new_slot_in_env (SCHEME_A_ car (SCHEME_V->code), x); |
3697 | SCHEME_V->code = cddr (SCHEME_V->code); |
3723 | SCHEME_V->code = cddr (SCHEME_V->code); |
3698 | SCHEME_V->args = NIL; |
|
|
3699 | } |
3724 | } |
3700 | else |
3725 | else |
3701 | { |
3726 | { |
3702 | SCHEME_V->code = cdr (SCHEME_V->code); |
3727 | SCHEME_V->code = cdr (SCHEME_V->code); |
|
|
3728 | } |
|
|
3729 | |
3703 | SCHEME_V->args = NIL; |
3730 | SCHEME_V->args = NIL; |
3704 | } |
|
|
3705 | |
|
|
3706 | s_goto (OP_BEGIN); |
3731 | s_goto (OP_BEGIN); |
3707 | |
3732 | |
3708 | case OP_LET0AST: /* let* */ |
3733 | case OP_LET0AST: /* let* */ |
3709 | if (car (SCHEME_V->code) == NIL) |
3734 | if (car (SCHEME_V->code) == NIL) |
3710 | { |
3735 | { |
… | |
… | |
3728 | new_slot_in_env (SCHEME_A_ caar (SCHEME_V->code), SCHEME_V->value); |
3753 | new_slot_in_env (SCHEME_A_ caar (SCHEME_V->code), SCHEME_V->value); |
3729 | SCHEME_V->code = cdr (SCHEME_V->code); |
3754 | SCHEME_V->code = cdr (SCHEME_V->code); |
3730 | |
3755 | |
3731 | if (is_pair (SCHEME_V->code)) /* continue */ |
3756 | if (is_pair (SCHEME_V->code)) /* continue */ |
3732 | { |
3757 | { |
3733 | s_save (SCHEME_A_ OP_LET2AST, SCHEME_V->args, SCHEME_V->code); |
3758 | s_save (SCHEME_A_ OP_LET2AST, args, SCHEME_V->code); |
3734 | SCHEME_V->code = cadar (SCHEME_V->code); |
3759 | SCHEME_V->code = cadar (SCHEME_V->code); |
3735 | SCHEME_V->args = NIL; |
3760 | SCHEME_V->args = NIL; |
3736 | s_goto (OP_EVAL); |
3761 | s_goto (OP_EVAL); |
3737 | } |
3762 | } |
3738 | else /* end */ |
3763 | else /* end */ |
3739 | { |
3764 | { |
3740 | SCHEME_V->code = SCHEME_V->args; |
3765 | SCHEME_V->code = args; |
3741 | SCHEME_V->args = NIL; |
3766 | SCHEME_V->args = NIL; |
3742 | s_goto (OP_BEGIN); |
3767 | s_goto (OP_BEGIN); |
3743 | } |
3768 | } |
3744 | |
3769 | |
3745 | case OP_LET0REC: /* letrec */ |
3770 | case OP_LET0REC: /* letrec */ |
… | |
… | |
3748 | SCHEME_V->value = SCHEME_V->code; |
3773 | SCHEME_V->value = SCHEME_V->code; |
3749 | SCHEME_V->code = car (SCHEME_V->code); |
3774 | SCHEME_V->code = car (SCHEME_V->code); |
3750 | s_goto (OP_LET1REC); |
3775 | s_goto (OP_LET1REC); |
3751 | |
3776 | |
3752 | case OP_LET1REC: /* letrec (calculate parameters) */ |
3777 | case OP_LET1REC: /* letrec (calculate parameters) */ |
3753 | SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); |
3778 | args = cons (SCHEME_V->value, args); |
3754 | |
3779 | |
3755 | if (is_pair (SCHEME_V->code)) /* continue */ |
3780 | if (is_pair (SCHEME_V->code)) /* continue */ |
3756 | { |
3781 | { |
3757 | if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code))) |
3782 | if (!is_pair (car (SCHEME_V->code)) || !is_pair (cdar (SCHEME_V->code))) |
3758 | Error_1 ("Bad syntax of binding spec in letrec :", car (SCHEME_V->code)); |
3783 | Error_1 ("Bad syntax of binding spec in letrec :", car (SCHEME_V->code)); |
3759 | |
3784 | |
3760 | s_save (SCHEME_A_ OP_LET1REC, SCHEME_V->args, cdr (SCHEME_V->code)); |
3785 | s_save (SCHEME_A_ OP_LET1REC, args, cdr (SCHEME_V->code)); |
3761 | SCHEME_V->code = cadar (SCHEME_V->code); |
3786 | SCHEME_V->code = cadar (SCHEME_V->code); |
3762 | SCHEME_V->args = NIL; |
3787 | SCHEME_V->args = NIL; |
3763 | s_goto (OP_EVAL); |
3788 | s_goto (OP_EVAL); |
3764 | } |
3789 | } |
3765 | else /* end */ |
3790 | else /* end */ |
3766 | { |
3791 | { |
3767 | SCHEME_V->args = reverse_in_place (SCHEME_A_ NIL, SCHEME_V->args); |
3792 | args = reverse_in_place (SCHEME_A_ NIL, args); |
3768 | SCHEME_V->code = car (SCHEME_V->args); |
3793 | SCHEME_V->code = car (args); |
3769 | SCHEME_V->args = cdr (SCHEME_V->args); |
3794 | SCHEME_V->args = cdr (args); |
3770 | s_goto (OP_LET2REC); |
3795 | s_goto (OP_LET2REC); |
3771 | } |
3796 | } |
3772 | |
3797 | |
3773 | case OP_LET2REC: /* letrec */ |
3798 | case OP_LET2REC: /* letrec */ |
3774 | for (x = car (SCHEME_V->code), y = SCHEME_V->args; y != NIL; x = cdr (x), y = cdr (y)) |
3799 | for (x = car (SCHEME_V->code), y = args; y != NIL; x = cdr (x), y = cdr (y)) |
3775 | new_slot_in_env (SCHEME_A_ caar (x), car (y)); |
3800 | new_slot_in_env (SCHEME_A_ caar (x), car (y)); |
3776 | |
3801 | |
3777 | SCHEME_V->code = cdr (SCHEME_V->code); |
3802 | SCHEME_V->code = cdr (SCHEME_V->code); |
3778 | SCHEME_V->args = NIL; |
3803 | SCHEME_V->args = NIL; |
3779 | s_goto (OP_BEGIN); |
3804 | s_goto (OP_BEGIN); |
… | |
… | |
3865 | s_save (SCHEME_A_ OP_C1STREAM, NIL, cdr (SCHEME_V->code)); |
3890 | s_save (SCHEME_A_ OP_C1STREAM, NIL, cdr (SCHEME_V->code)); |
3866 | SCHEME_V->code = car (SCHEME_V->code); |
3891 | SCHEME_V->code = car (SCHEME_V->code); |
3867 | s_goto (OP_EVAL); |
3892 | s_goto (OP_EVAL); |
3868 | |
3893 | |
3869 | case OP_C1STREAM: /* cons-stream */ |
3894 | case OP_C1STREAM: /* cons-stream */ |
3870 | SCHEME_V->args = SCHEME_V->value; /* save SCHEME_V->value to register SCHEME_V->args for gc */ |
3895 | SCHEME_V->args = SCHEME_V->value; /* save SCHEME_V->value to register args for gc */ |
3871 | x = mk_closure (SCHEME_A_ cons (NIL, SCHEME_V->code), SCHEME_V->envir); |
3896 | x = mk_closure (SCHEME_A_ cons (NIL, SCHEME_V->code), SCHEME_V->envir); |
3872 | set_typeflag (x, T_PROMISE); |
3897 | set_typeflag (x, T_PROMISE); |
3873 | s_return (cons (SCHEME_V->args, x)); |
3898 | s_return (cons (args, x)); |
3874 | |
3899 | |
3875 | case OP_MACRO0: /* macro */ |
3900 | case OP_MACRO0: /* macro */ |
3876 | if (is_pair (car (SCHEME_V->code))) |
3901 | if (is_pair (car (SCHEME_V->code))) |
3877 | { |
3902 | { |
3878 | x = caar (SCHEME_V->code); |
3903 | x = caar (SCHEME_V->code); |
… | |
… | |
3911 | { |
3936 | { |
3912 | if (!is_pair (y = caar (x))) |
3937 | if (!is_pair (y = caar (x))) |
3913 | break; |
3938 | break; |
3914 | |
3939 | |
3915 | for (; y != NIL; y = cdr (y)) |
3940 | for (; y != NIL; y = cdr (y)) |
3916 | { |
|
|
3917 | if (eqv (car (y), SCHEME_V->value)) |
3941 | if (eqv (car (y), SCHEME_V->value)) |
3918 | break; |
3942 | break; |
3919 | } |
|
|
3920 | |
3943 | |
3921 | if (y != NIL) |
3944 | if (y != NIL) |
3922 | break; |
3945 | break; |
3923 | } |
3946 | } |
3924 | |
3947 | |
… | |
… | |
3944 | s_goto (OP_BEGIN); |
3967 | s_goto (OP_BEGIN); |
3945 | else |
3968 | else |
3946 | s_return (NIL); |
3969 | s_return (NIL); |
3947 | |
3970 | |
3948 | case OP_PAPPLY: /* apply */ |
3971 | case OP_PAPPLY: /* apply */ |
3949 | SCHEME_V->code = car (SCHEME_V->args); |
3972 | SCHEME_V->code = car (args); |
3950 | SCHEME_V->args = list_star (SCHEME_A_ cdr (SCHEME_V->args)); |
3973 | SCHEME_V->args = list_star (SCHEME_A_ cdr (args)); |
3951 | /*SCHEME_V->args = cadr(SCHEME_V->args); */ |
3974 | /*SCHEME_V->args = cadr(args); */ |
3952 | s_goto (OP_APPLY); |
3975 | s_goto (OP_APPLY); |
3953 | |
3976 | |
3954 | case OP_PEVAL: /* eval */ |
3977 | case OP_PEVAL: /* eval */ |
3955 | if (cdr (SCHEME_V->args) != NIL) |
3978 | if (cdr (args) != NIL) |
3956 | SCHEME_V->envir = cadr (SCHEME_V->args); |
3979 | SCHEME_V->envir = cadr (args); |
3957 | |
3980 | |
3958 | SCHEME_V->code = car (SCHEME_V->args); |
3981 | SCHEME_V->code = car (args); |
3959 | s_goto (OP_EVAL); |
3982 | s_goto (OP_EVAL); |
3960 | |
3983 | |
3961 | case OP_CONTINUATION: /* call-with-current-continuation */ |
3984 | case OP_CONTINUATION: /* call-with-current-continuation */ |
3962 | SCHEME_V->code = car (SCHEME_V->args); |
3985 | SCHEME_V->code = car (args); |
3963 | SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL); |
3986 | SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL); |
3964 | s_goto (OP_APPLY); |
3987 | s_goto (OP_APPLY); |
3965 | } |
3988 | } |
3966 | |
3989 | |
3967 | return S_T; |
3990 | if (USE_ERROR_CHECKING) abort (); |
3968 | } |
3991 | } |
3969 | |
3992 | |
3970 | static pointer |
3993 | static int |
3971 | opexe_2 (SCHEME_P_ enum scheme_opcodes op) |
3994 | opexe_1 (SCHEME_P_ enum scheme_opcodes op) |
3972 | { |
3995 | { |
3973 | pointer x; |
3996 | pointer args = SCHEME_V->args; |
|
|
3997 | pointer x = car (args); |
3974 | num v; |
3998 | num v; |
3975 | |
3999 | |
|
|
4000 | switch (op) |
|
|
4001 | { |
3976 | #if USE_MATH |
4002 | #if USE_MATH |
3977 | RVALUE dd; |
|
|
3978 | #endif |
|
|
3979 | |
|
|
3980 | switch (op) |
|
|
3981 | { |
|
|
3982 | #if USE_MATH |
|
|
3983 | |
|
|
3984 | case OP_INEX2EX: /* inexact->exact */ |
4003 | case OP_INEX2EX: /* inexact->exact */ |
3985 | x = car (SCHEME_V->args); |
|
|
3986 | |
|
|
3987 | if (num_is_integer (x)) |
4004 | if (!is_integer (x)) |
3988 | s_return (x); |
4005 | { |
3989 | else if (modf (rvalue_unchecked (x), &dd) == 0.0) |
4006 | RVALUE r = rvalue_unchecked (x); |
3990 | s_return (mk_integer (SCHEME_A_ ivalue (x))); |
4007 | |
|
|
4008 | if (r == (RVALUE)(IVALUE)r) |
|
|
4009 | x = mk_integer (SCHEME_A_ rvalue_unchecked (x)); |
3991 | else |
4010 | else |
3992 | Error_1 ("inexact->exact: not integral:", x); |
4011 | Error_1 ("inexact->exact: not integral:", x); |
|
|
4012 | } |
3993 | |
4013 | |
3994 | case OP_EXP: |
4014 | s_return (x); |
3995 | x = car (SCHEME_V->args); |
4015 | |
|
|
4016 | case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x)))); |
|
|
4017 | case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x)))); |
|
|
4018 | case OP_TRUNCATE: s_return (mk_real (SCHEME_A_ trunc (rvalue (x)))); |
|
|
4019 | case OP_ROUND: s_return (mk_real (SCHEME_A_ nearbyint (rvalue (x)))); |
|
|
4020 | |
|
|
4021 | case OP_SQRT: s_return (mk_real (SCHEME_A_ sqrt (rvalue (x)))); |
3996 | s_return (mk_real (SCHEME_A_ exp (rvalue (x)))); |
4022 | case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x)))); |
3997 | |
|
|
3998 | case OP_LOG: |
|
|
3999 | x = car (SCHEME_V->args); |
|
|
4000 | s_return (mk_real (SCHEME_A_ log (rvalue (x)))); |
4023 | case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x)) |
4001 | |
4024 | / (cadr (args) == NIL ? 1 : log (rvalue (cadr (args)))))); |
4002 | case OP_SIN: |
|
|
4003 | x = car (SCHEME_V->args); |
|
|
4004 | s_return (mk_real (SCHEME_A_ sin (rvalue (x)))); |
4025 | case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x)))); |
4005 | |
|
|
4006 | case OP_COS: |
|
|
4007 | x = car (SCHEME_V->args); |
|
|
4008 | s_return (mk_real (SCHEME_A_ cos (rvalue (x)))); |
4026 | case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x)))); |
4009 | |
|
|
4010 | case OP_TAN: |
|
|
4011 | x = car (SCHEME_V->args); |
|
|
4012 | s_return (mk_real (SCHEME_A_ tan (rvalue (x)))); |
4027 | case OP_TAN: s_return (mk_real (SCHEME_A_ tan (rvalue (x)))); |
4013 | |
|
|
4014 | case OP_ASIN: |
|
|
4015 | x = car (SCHEME_V->args); |
|
|
4016 | s_return (mk_real (SCHEME_A_ asin (rvalue (x)))); |
4028 | case OP_ASIN: s_return (mk_real (SCHEME_A_ asin (rvalue (x)))); |
4017 | |
|
|
4018 | case OP_ACOS: |
|
|
4019 | x = car (SCHEME_V->args); |
|
|
4020 | s_return (mk_real (SCHEME_A_ acos (rvalue (x)))); |
4029 | case OP_ACOS: s_return (mk_real (SCHEME_A_ acos (rvalue (x)))); |
4021 | |
4030 | |
4022 | case OP_ATAN: |
4031 | case OP_ATAN: |
4023 | x = car (SCHEME_V->args); |
|
|
4024 | |
|
|
4025 | if (cdr (SCHEME_V->args) == NIL) |
|
|
4026 | s_return (mk_real (SCHEME_A_ atan (rvalue (x)))); |
|
|
4027 | else |
|
|
4028 | { |
|
|
4029 | pointer y = cadr (SCHEME_V->args); |
|
|
4030 | |
|
|
4031 | s_return (mk_real (SCHEME_A_ atan2 (rvalue (x), rvalue (y)))); |
|
|
4032 | } |
|
|
4033 | |
|
|
4034 | case OP_SQRT: |
|
|
4035 | x = car (SCHEME_V->args); |
|
|
4036 | s_return (mk_real (SCHEME_A_ sqrt (rvalue (x)))); |
4032 | s_return (mk_real (SCHEME_A_ |
|
|
4033 | cdr (args) == NIL |
|
|
4034 | ? atan (rvalue (x)) |
|
|
4035 | : atan2 (rvalue (x), rvalue (cadr (args))))); |
4037 | |
4036 | |
4038 | case OP_EXPT: |
4037 | case OP_EXPT: |
4039 | { |
4038 | { |
4040 | RVALUE result; |
4039 | RVALUE result; |
4041 | int real_result = 1; |
4040 | int real_result = 1; |
4042 | pointer y = cadr (SCHEME_V->args); |
4041 | pointer y = cadr (args); |
4043 | |
4042 | |
4044 | x = car (SCHEME_V->args); |
|
|
4045 | |
|
|
4046 | if (num_is_integer (x) && num_is_integer (y)) |
4043 | if (is_integer (x) && is_integer (y)) |
4047 | real_result = 0; |
4044 | real_result = 0; |
4048 | |
4045 | |
4049 | /* This 'if' is an R5RS compatibility fix. */ |
4046 | /* This 'if' is an R5RS compatibility fix. */ |
4050 | /* NOTE: Remove this 'if' fix for R6RS. */ |
4047 | /* NOTE: Remove this 'if' fix for R6RS. */ |
4051 | if (rvalue (x) == 0 && rvalue (y) < 0) |
4048 | if (rvalue (x) == 0 && rvalue (y) < 0) |
4052 | result = 0.0; |
4049 | result = 0; |
4053 | else |
4050 | else |
4054 | result = pow (rvalue (x), rvalue (y)); |
4051 | result = pow (rvalue (x), rvalue (y)); |
4055 | |
4052 | |
4056 | /* Before returning integer result make sure we can. */ |
4053 | /* Before returning integer result make sure we can. */ |
4057 | /* If the test fails, result is too big for integer. */ |
4054 | /* If the test fails, result is too big for integer. */ |
4058 | if (!real_result) |
4055 | if (!real_result) |
4059 | { |
4056 | { |
4060 | long result_as_long = (long) result; |
4057 | long result_as_long = result; |
4061 | |
4058 | |
4062 | if (result != (RVALUE) result_as_long) |
4059 | if (result != result_as_long) |
4063 | real_result = 1; |
4060 | real_result = 1; |
4064 | } |
4061 | } |
4065 | |
4062 | |
4066 | if (real_result) |
4063 | if (real_result) |
4067 | s_return (mk_real (SCHEME_A_ result)); |
4064 | s_return (mk_real (SCHEME_A_ result)); |
4068 | else |
4065 | else |
4069 | s_return (mk_integer (SCHEME_A_ result)); |
4066 | s_return (mk_integer (SCHEME_A_ result)); |
4070 | } |
4067 | } |
4071 | |
|
|
4072 | case OP_FLOOR: |
|
|
4073 | x = car (SCHEME_V->args); |
|
|
4074 | s_return (mk_real (SCHEME_A_ floor (rvalue (x)))); |
|
|
4075 | |
|
|
4076 | case OP_CEILING: |
|
|
4077 | x = car (SCHEME_V->args); |
|
|
4078 | s_return (mk_real (SCHEME_A_ ceil (rvalue (x)))); |
|
|
4079 | |
|
|
4080 | case OP_TRUNCATE: |
|
|
4081 | { |
|
|
4082 | RVALUE rvalue_of_x; |
|
|
4083 | |
|
|
4084 | x = car (SCHEME_V->args); |
|
|
4085 | rvalue_of_x = rvalue (x); |
|
|
4086 | |
|
|
4087 | if (rvalue_of_x > 0) |
|
|
4088 | s_return (mk_real (SCHEME_A_ floor (rvalue_of_x))); |
|
|
4089 | else |
|
|
4090 | s_return (mk_real (SCHEME_A_ ceil (rvalue_of_x))); |
|
|
4091 | } |
|
|
4092 | |
|
|
4093 | case OP_ROUND: |
|
|
4094 | x = car (SCHEME_V->args); |
|
|
4095 | |
|
|
4096 | if (num_is_integer (x)) |
|
|
4097 | s_return (x); |
|
|
4098 | |
|
|
4099 | s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x)))); |
|
|
4100 | #endif |
4068 | #endif |
4101 | |
4069 | |
4102 | case OP_ADD: /* + */ |
4070 | case OP_ADD: /* + */ |
4103 | v = num_zero; |
4071 | v = num_zero; |
4104 | |
4072 | |
4105 | for (x = SCHEME_V->args; x != NIL; x = cdr (x)) |
4073 | for (x = args; x != NIL; x = cdr (x)) |
4106 | v = num_add (v, nvalue (car (x))); |
4074 | v = num_op (NUM_ADD, v, nvalue (car (x))); |
4107 | |
4075 | |
4108 | s_return (mk_number (SCHEME_A_ v)); |
4076 | s_return (mk_number (SCHEME_A_ v)); |
4109 | |
4077 | |
4110 | case OP_MUL: /* * */ |
4078 | case OP_MUL: /* * */ |
4111 | v = num_one; |
4079 | v = num_one; |
4112 | |
4080 | |
4113 | for (x = SCHEME_V->args; x != NIL; x = cdr (x)) |
4081 | for (x = args; x != NIL; x = cdr (x)) |
4114 | v = num_mul (v, nvalue (car (x))); |
4082 | v = num_op (NUM_MUL, v, nvalue (car (x))); |
4115 | |
4083 | |
4116 | s_return (mk_number (SCHEME_A_ v)); |
4084 | s_return (mk_number (SCHEME_A_ v)); |
4117 | |
4085 | |
4118 | case OP_SUB: /* - */ |
4086 | case OP_SUB: /* - */ |
4119 | if (cdr (SCHEME_V->args) == NIL) |
4087 | if (cdr (args) == NIL) |
4120 | { |
4088 | { |
4121 | x = SCHEME_V->args; |
4089 | x = args; |
4122 | v = num_zero; |
4090 | v = num_zero; |
4123 | } |
4091 | } |
4124 | else |
4092 | else |
4125 | { |
4093 | { |
4126 | x = cdr (SCHEME_V->args); |
4094 | x = cdr (args); |
4127 | v = nvalue (car (SCHEME_V->args)); |
4095 | v = nvalue (car (args)); |
4128 | } |
4096 | } |
4129 | |
4097 | |
4130 | for (; x != NIL; x = cdr (x)) |
4098 | for (; x != NIL; x = cdr (x)) |
4131 | v = num_sub (v, nvalue (car (x))); |
4099 | v = num_op (NUM_SUB, v, nvalue (car (x))); |
4132 | |
4100 | |
4133 | s_return (mk_number (SCHEME_A_ v)); |
4101 | s_return (mk_number (SCHEME_A_ v)); |
4134 | |
4102 | |
4135 | case OP_DIV: /* / */ |
4103 | case OP_DIV: /* / */ |
4136 | if (cdr (SCHEME_V->args) == NIL) |
4104 | if (cdr (args) == NIL) |
4137 | { |
4105 | { |
4138 | x = SCHEME_V->args; |
4106 | x = args; |
4139 | v = num_one; |
4107 | v = num_one; |
4140 | } |
4108 | } |
4141 | else |
4109 | else |
4142 | { |
4110 | { |
4143 | x = cdr (SCHEME_V->args); |
4111 | x = cdr (args); |
4144 | v = nvalue (car (SCHEME_V->args)); |
4112 | v = nvalue (car (args)); |
4145 | } |
4113 | } |
4146 | |
4114 | |
4147 | for (; x != NIL; x = cdr (x)) |
4115 | for (; x != NIL; x = cdr (x)) |
4148 | { |
|
|
4149 | if (!is_zero_rvalue (rvalue (car (x)))) |
4116 | if (!is_zero_rvalue (rvalue (car (x)))) |
4150 | v = num_div (v, nvalue (car (x))); |
4117 | v = num_div (v, nvalue (car (x))); |
4151 | else |
4118 | else |
4152 | Error_0 ("/: division by zero"); |
4119 | Error_0 ("/: division by zero"); |
4153 | } |
|
|
4154 | |
4120 | |
4155 | s_return (mk_number (SCHEME_A_ v)); |
4121 | s_return (mk_number (SCHEME_A_ v)); |
4156 | |
4122 | |
4157 | case OP_INTDIV: /* quotient */ |
4123 | case OP_INTDIV: /* quotient */ |
4158 | if (cdr (SCHEME_V->args) == NIL) |
4124 | if (cdr (args) == NIL) |
4159 | { |
4125 | { |
4160 | x = SCHEME_V->args; |
4126 | x = args; |
4161 | v = num_one; |
4127 | v = num_one; |
4162 | } |
4128 | } |
4163 | else |
4129 | else |
4164 | { |
4130 | { |
4165 | x = cdr (SCHEME_V->args); |
4131 | x = cdr (args); |
4166 | v = nvalue (car (SCHEME_V->args)); |
4132 | v = nvalue (car (args)); |
4167 | } |
4133 | } |
4168 | |
4134 | |
4169 | for (; x != NIL; x = cdr (x)) |
4135 | for (; x != NIL; x = cdr (x)) |
4170 | { |
4136 | { |
4171 | if (ivalue (car (x)) != 0) |
4137 | if (ivalue (car (x)) != 0) |
4172 | v = num_intdiv (v, nvalue (car (x))); |
4138 | v = num_op (NUM_INTDIV, v, nvalue (car (x))); |
4173 | else |
4139 | else |
4174 | Error_0 ("quotient: division by zero"); |
4140 | Error_0 ("quotient: division by zero"); |
4175 | } |
4141 | } |
4176 | |
4142 | |
4177 | s_return (mk_number (SCHEME_A_ v)); |
4143 | s_return (mk_number (SCHEME_A_ v)); |
4178 | |
4144 | |
4179 | case OP_REM: /* remainder */ |
4145 | case OP_REM: /* remainder */ |
4180 | v = nvalue (car (SCHEME_V->args)); |
4146 | v = nvalue (x); |
4181 | |
4147 | |
4182 | if (ivalue (cadr (SCHEME_V->args)) != 0) |
4148 | if (ivalue (cadr (args)) != 0) |
4183 | v = num_rem (v, nvalue (cadr (SCHEME_V->args))); |
4149 | v = num_rem (v, nvalue (cadr (args))); |
4184 | else |
4150 | else |
4185 | Error_0 ("remainder: division by zero"); |
4151 | Error_0 ("remainder: division by zero"); |
4186 | |
4152 | |
4187 | s_return (mk_number (SCHEME_A_ v)); |
4153 | s_return (mk_number (SCHEME_A_ v)); |
4188 | |
4154 | |
4189 | case OP_MOD: /* modulo */ |
4155 | case OP_MOD: /* modulo */ |
4190 | v = nvalue (car (SCHEME_V->args)); |
4156 | v = nvalue (x); |
4191 | |
4157 | |
4192 | if (ivalue (cadr (SCHEME_V->args)) != 0) |
4158 | if (ivalue (cadr (args)) != 0) |
4193 | v = num_mod (v, nvalue (cadr (SCHEME_V->args))); |
4159 | v = num_mod (v, nvalue (cadr (args))); |
4194 | else |
4160 | else |
4195 | Error_0 ("modulo: division by zero"); |
4161 | Error_0 ("modulo: division by zero"); |
4196 | |
4162 | |
4197 | s_return (mk_number (SCHEME_A_ v)); |
4163 | s_return (mk_number (SCHEME_A_ v)); |
4198 | |
4164 | |
4199 | case OP_CAR: /* car */ |
4165 | /* the compiler will optimize this mess... */ |
4200 | s_return (caar (SCHEME_V->args)); |
4166 | case OP_CAR: op_car: s_return (car (x)); |
4201 | |
4167 | case OP_CDR: op_cdr: s_return (cdr (x)); |
4202 | case OP_CDR: /* cdr */ |
4168 | case OP_CAAR: op_caar: x = car (x); goto op_car; |
4203 | s_return (cdar (SCHEME_V->args)); |
4169 | case OP_CADR: op_cadr: x = cdr (x); goto op_car; |
|
|
4170 | case OP_CDAR: op_cdar: x = car (x); goto op_cdr; |
|
|
4171 | case OP_CDDR: op_cddr: x = cdr (x); goto op_cdr; |
|
|
4172 | case OP_CAAAR: op_caaar: x = car (x); goto op_caar; |
|
|
4173 | case OP_CAADR: op_caadr: x = cdr (x); goto op_caar; |
|
|
4174 | case OP_CADAR: op_cadar: x = car (x); goto op_cadr; |
|
|
4175 | case OP_CADDR: op_caddr: x = cdr (x); goto op_cadr; |
|
|
4176 | case OP_CDAAR: op_cdaar: x = car (x); goto op_cdar; |
|
|
4177 | case OP_CDADR: op_cdadr: x = cdr (x); goto op_cdar; |
|
|
4178 | case OP_CDDAR: op_cddar: x = car (x); goto op_cddr; |
|
|
4179 | case OP_CDDDR: op_cdddr: x = cdr (x); goto op_cddr; |
|
|
4180 | case OP_CAAAAR: x = car (x); goto op_caaar; |
|
|
4181 | case OP_CAAADR: x = cdr (x); goto op_caaar; |
|
|
4182 | case OP_CAADAR: x = car (x); goto op_caadr; |
|
|
4183 | case OP_CAADDR: x = cdr (x); goto op_caadr; |
|
|
4184 | case OP_CADAAR: x = car (x); goto op_cadar; |
|
|
4185 | case OP_CADADR: x = cdr (x); goto op_cadar; |
|
|
4186 | case OP_CADDAR: x = car (x); goto op_caddr; |
|
|
4187 | case OP_CADDDR: x = cdr (x); goto op_caddr; |
|
|
4188 | case OP_CDAAAR: x = car (x); goto op_cdaar; |
|
|
4189 | case OP_CDAADR: x = cdr (x); goto op_cdaar; |
|
|
4190 | case OP_CDADAR: x = car (x); goto op_cdadr; |
|
|
4191 | case OP_CDADDR: x = cdr (x); goto op_cdadr; |
|
|
4192 | case OP_CDDAAR: x = car (x); goto op_cddar; |
|
|
4193 | case OP_CDDADR: x = cdr (x); goto op_cddar; |
|
|
4194 | case OP_CDDDAR: x = car (x); goto op_cdddr; |
|
|
4195 | case OP_CDDDDR: x = cdr (x); goto op_cdddr; |
4204 | |
4196 | |
4205 | case OP_CONS: /* cons */ |
4197 | case OP_CONS: /* cons */ |
4206 | set_cdr (SCHEME_V->args, cadr (SCHEME_V->args)); |
4198 | set_cdr (args, cadr (args)); |
4207 | s_return (SCHEME_V->args); |
4199 | s_return (args); |
4208 | |
4200 | |
4209 | case OP_SETCAR: /* set-car! */ |
4201 | case OP_SETCAR: /* set-car! */ |
4210 | if (!is_immutable (car (SCHEME_V->args))) |
4202 | if (!is_immutable (x)) |
4211 | { |
4203 | { |
4212 | set_car (car (SCHEME_V->args), cadr (SCHEME_V->args)); |
4204 | set_car (x, cadr (args)); |
4213 | s_return (car (SCHEME_V->args)); |
4205 | s_return (car (args)); |
4214 | } |
4206 | } |
4215 | else |
4207 | else |
4216 | Error_0 ("set-car!: unable to alter immutable pair"); |
4208 | Error_0 ("set-car!: unable to alter immutable pair"); |
4217 | |
4209 | |
4218 | case OP_SETCDR: /* set-cdr! */ |
4210 | case OP_SETCDR: /* set-cdr! */ |
4219 | if (!is_immutable (car (SCHEME_V->args))) |
4211 | if (!is_immutable (x)) |
4220 | { |
4212 | { |
4221 | set_cdr (car (SCHEME_V->args), cadr (SCHEME_V->args)); |
4213 | set_cdr (x, cadr (args)); |
4222 | s_return (car (SCHEME_V->args)); |
4214 | s_return (car (args)); |
4223 | } |
4215 | } |
4224 | else |
4216 | else |
4225 | Error_0 ("set-cdr!: unable to alter immutable pair"); |
4217 | Error_0 ("set-cdr!: unable to alter immutable pair"); |
4226 | |
4218 | |
4227 | case OP_CHAR2INT: /* char->integer */ |
4219 | case OP_CHAR2INT: /* char->integer */ |
4228 | s_return (mk_integer (SCHEME_A_ ivalue (car (SCHEME_V->args)))); |
4220 | s_return (mk_integer (SCHEME_A_ ivalue_unchecked (x))); |
4229 | |
4221 | |
4230 | case OP_INT2CHAR: /* integer->char */ |
4222 | case OP_INT2CHAR: /* integer->char */ |
4231 | s_return (mk_character (SCHEME_A_ ivalue (car (SCHEME_V->args)))); |
4223 | s_return (mk_character (SCHEME_A_ ivalue_unchecked (x))); |
4232 | |
4224 | |
4233 | case OP_CHARUPCASE: |
4225 | case OP_CHARUPCASE: |
4234 | { |
4226 | { |
4235 | unsigned char c = ivalue (car (SCHEME_V->args)); |
4227 | unsigned char c = ivalue_unchecked (x); |
4236 | c = toupper (c); |
4228 | c = toupper (c); |
4237 | s_return (mk_character (SCHEME_A_ c)); |
4229 | s_return (mk_character (SCHEME_A_ c)); |
4238 | } |
4230 | } |
4239 | |
4231 | |
4240 | case OP_CHARDNCASE: |
4232 | case OP_CHARDNCASE: |
4241 | { |
4233 | { |
4242 | unsigned char c = ivalue (car (SCHEME_V->args)); |
4234 | unsigned char c = ivalue_unchecked (x); |
4243 | c = tolower (c); |
4235 | c = tolower (c); |
4244 | s_return (mk_character (SCHEME_A_ c)); |
4236 | s_return (mk_character (SCHEME_A_ c)); |
4245 | } |
4237 | } |
4246 | |
4238 | |
4247 | case OP_STR2SYM: /* string->symbol */ |
4239 | case OP_STR2SYM: /* string->symbol */ |
4248 | s_return (mk_symbol (SCHEME_A_ strvalue (car (SCHEME_V->args)))); |
4240 | s_return (mk_symbol (SCHEME_A_ strvalue (x))); |
4249 | |
4241 | |
4250 | case OP_STR2ATOM: /* string->atom */ |
4242 | case OP_STR2ATOM: /* string->atom */ |
4251 | { |
4243 | { |
4252 | char *s = strvalue (car (SCHEME_V->args)); |
4244 | char *s = strvalue (x); |
4253 | long pf = 0; |
4245 | long pf = 0; |
4254 | |
4246 | |
4255 | if (cdr (SCHEME_V->args) != NIL) |
4247 | if (cdr (args) != NIL) |
4256 | { |
4248 | { |
4257 | /* we know cadr(SCHEME_V->args) is a natural number */ |
4249 | /* we know cadr(args) is a natural number */ |
4258 | /* see if it is 2, 8, 10, or 16, or error */ |
4250 | /* see if it is 2, 8, 10, or 16, or error */ |
4259 | pf = ivalue_unchecked (cadr (SCHEME_V->args)); |
4251 | pf = ivalue_unchecked (cadr (args)); |
4260 | |
4252 | |
4261 | if (pf == 16 || pf == 10 || pf == 8 || pf == 2) |
4253 | if (pf == 16 || pf == 10 || pf == 8 || pf == 2) |
4262 | { |
4254 | { |
4263 | /* base is OK */ |
4255 | /* base is OK */ |
4264 | } |
4256 | } |
4265 | else |
4257 | else |
4266 | pf = -1; |
4258 | pf = -1; |
4267 | } |
4259 | } |
4268 | |
4260 | |
4269 | if (pf < 0) |
4261 | if (pf < 0) |
4270 | Error_1 ("string->atom: bad base:", cadr (SCHEME_V->args)); |
4262 | Error_1 ("string->atom: bad base:", cadr (args)); |
4271 | else if (*s == '#') /* no use of base! */ |
4263 | else if (*s == '#') /* no use of base! */ |
4272 | s_return (mk_sharp_const (SCHEME_A_ s + 1)); |
4264 | s_return (mk_sharp_const (SCHEME_A_ s + 1)); |
4273 | else |
4265 | else |
4274 | { |
4266 | { |
4275 | if (pf == 0 || pf == 10) |
4267 | if (pf == 0 || pf == 10) |
… | |
… | |
4286 | } |
4278 | } |
4287 | } |
4279 | } |
4288 | } |
4280 | } |
4289 | |
4281 | |
4290 | case OP_SYM2STR: /* symbol->string */ |
4282 | case OP_SYM2STR: /* symbol->string */ |
4291 | x = mk_string (SCHEME_A_ symname (car (SCHEME_V->args))); |
4283 | x = mk_string (SCHEME_A_ symname (x)); |
4292 | setimmutable (x); |
4284 | setimmutable (x); |
4293 | s_return (x); |
4285 | s_return (x); |
4294 | |
4286 | |
4295 | case OP_ATOM2STR: /* atom->string */ |
4287 | case OP_ATOM2STR: /* atom->string */ |
4296 | { |
4288 | { |
4297 | long pf = 0; |
4289 | long pf = 0; |
4298 | |
4290 | |
4299 | x = car (SCHEME_V->args); |
|
|
4300 | |
|
|
4301 | if (cdr (SCHEME_V->args) != NIL) |
4291 | if (cdr (args) != NIL) |
4302 | { |
4292 | { |
4303 | /* we know cadr(SCHEME_V->args) is a natural number */ |
4293 | /* we know cadr(args) is a natural number */ |
4304 | /* see if it is 2, 8, 10, or 16, or error */ |
4294 | /* see if it is 2, 8, 10, or 16, or error */ |
4305 | pf = ivalue_unchecked (cadr (SCHEME_V->args)); |
4295 | pf = ivalue_unchecked (cadr (args)); |
4306 | |
4296 | |
4307 | if (is_number (x) && (pf == 16 || pf == 10 || pf == 8 || pf == 2)) |
4297 | if (is_number (x) && (pf == 16 || pf == 10 || pf == 8 || pf == 2)) |
4308 | { |
4298 | { |
4309 | /* base is OK */ |
4299 | /* base is OK */ |
4310 | } |
4300 | } |
4311 | else |
4301 | else |
4312 | pf = -1; |
4302 | pf = -1; |
4313 | } |
4303 | } |
4314 | |
4304 | |
4315 | if (pf < 0) |
4305 | if (pf < 0) |
4316 | Error_1 ("atom->string: bad base:", cadr (SCHEME_V->args)); |
4306 | Error_1 ("atom->string: bad base:", cadr (args)); |
4317 | else if (is_number (x) || is_character (x) || is_string (x) || is_symbol (x)) |
4307 | else if (is_number (x) || is_character (x) || is_string (x) || is_symbol (x)) |
4318 | { |
4308 | { |
4319 | char *p; |
4309 | char *p; |
4320 | int len; |
4310 | int len; |
4321 | |
4311 | |
… | |
… | |
4326 | Error_1 ("atom->string: not an atom:", x); |
4316 | Error_1 ("atom->string: not an atom:", x); |
4327 | } |
4317 | } |
4328 | |
4318 | |
4329 | case OP_MKSTRING: /* make-string */ |
4319 | case OP_MKSTRING: /* make-string */ |
4330 | { |
4320 | { |
4331 | int fill = ' '; |
4321 | int fill = cdr (args) != NIL ? charvalue (cadr (args)) : ' '; |
4332 | int len; |
4322 | int len = ivalue_unchecked (x); |
4333 | |
4323 | |
4334 | len = ivalue (car (SCHEME_V->args)); |
|
|
4335 | |
|
|
4336 | if (cdr (SCHEME_V->args) != NIL) |
|
|
4337 | fill = charvalue (cadr (SCHEME_V->args)); |
|
|
4338 | |
|
|
4339 | s_return (mk_empty_string (SCHEME_A_ len, (char) fill)); |
4324 | s_return (mk_empty_string (SCHEME_A_ len, fill)); |
4340 | } |
4325 | } |
4341 | |
4326 | |
4342 | case OP_STRLEN: /* string-length */ |
4327 | case OP_STRLEN: /* string-length */ |
4343 | s_return (mk_integer (SCHEME_A_ strlength (car (SCHEME_V->args)))); |
4328 | s_return (mk_integer (SCHEME_A_ strlength (x))); |
4344 | |
4329 | |
4345 | case OP_STRREF: /* string-ref */ |
4330 | case OP_STRREF: /* string-ref */ |
4346 | { |
4331 | { |
4347 | char *str; |
4332 | char *str = strvalue (x); |
4348 | int index; |
|
|
4349 | |
|
|
4350 | str = strvalue (car (SCHEME_V->args)); |
|
|
4351 | |
|
|
4352 | index = ivalue (cadr (SCHEME_V->args)); |
4333 | int index = ivalue_unchecked (cadr (args)); |
4353 | |
4334 | |
4354 | if (index >= strlength (car (SCHEME_V->args))) |
4335 | if (index >= strlength (x)) |
4355 | Error_1 ("string-ref: out of bounds:", cadr (SCHEME_V->args)); |
4336 | Error_1 ("string-ref: out of bounds:", cadr (args)); |
4356 | |
4337 | |
4357 | s_return (mk_character (SCHEME_A_ ((unsigned char *) str)[index])); |
4338 | s_return (mk_character (SCHEME_A_ ((unsigned char *)str)[index])); |
4358 | } |
4339 | } |
4359 | |
4340 | |
4360 | case OP_STRSET: /* string-set! */ |
4341 | case OP_STRSET: /* string-set! */ |
4361 | { |
4342 | { |
4362 | char *str; |
4343 | char *str = strvalue (x); |
4363 | int index; |
4344 | int index = ivalue_unchecked (cadr (args)); |
4364 | int c; |
4345 | int c; |
4365 | |
4346 | |
4366 | if (is_immutable (car (SCHEME_V->args))) |
4347 | if (is_immutable (x)) |
4367 | Error_1 ("string-set!: unable to alter immutable string:", car (SCHEME_V->args)); |
4348 | Error_1 ("string-set!: unable to alter immutable string:", x); |
4368 | |
4349 | |
4369 | str = strvalue (car (SCHEME_V->args)); |
|
|
4370 | |
|
|
4371 | index = ivalue (cadr (SCHEME_V->args)); |
|
|
4372 | |
|
|
4373 | if (index >= strlength (car (SCHEME_V->args))) |
4350 | if (index >= strlength (x)) |
4374 | Error_1 ("string-set!: out of bounds:", cadr (SCHEME_V->args)); |
4351 | Error_1 ("string-set!: out of bounds:", cadr (args)); |
4375 | |
4352 | |
4376 | c = charvalue (caddr (SCHEME_V->args)); |
4353 | c = charvalue (caddr (args)); |
4377 | |
4354 | |
4378 | str[index] = (char) c; |
4355 | str[index] = c; |
4379 | s_return (car (SCHEME_V->args)); |
4356 | s_return (car (args)); |
4380 | } |
4357 | } |
4381 | |
4358 | |
4382 | case OP_STRAPPEND: /* string-append */ |
4359 | case OP_STRAPPEND: /* string-append */ |
4383 | { |
4360 | { |
4384 | /* in 1.29 string-append was in Scheme in init.scm but was too slow */ |
4361 | /* in 1.29 string-append was in Scheme in init.scm but was too slow */ |
4385 | int len = 0; |
4362 | int len = 0; |
4386 | pointer newstr; |
4363 | pointer newstr; |
4387 | char *pos; |
4364 | char *pos; |
4388 | |
4365 | |
4389 | /* compute needed length for new string */ |
4366 | /* compute needed length for new string */ |
4390 | for (x = SCHEME_V->args; x != NIL; x = cdr (x)) |
4367 | for (x = args; x != NIL; x = cdr (x)) |
4391 | len += strlength (car (x)); |
4368 | len += strlength (car (x)); |
4392 | |
4369 | |
4393 | newstr = mk_empty_string (SCHEME_A_ len, ' '); |
4370 | newstr = mk_empty_string (SCHEME_A_ len, ' '); |
4394 | |
4371 | |
4395 | /* store the contents of the argument strings into the new string */ |
4372 | /* store the contents of the argument strings into the new string */ |
4396 | for (pos = strvalue (newstr), x = SCHEME_V->args; x != NIL; pos += strlength (car (x)), x = cdr (x)) |
4373 | for (pos = strvalue (newstr), x = args; x != NIL; pos += strlength (car (x)), x = cdr (x)) |
4397 | memcpy (pos, strvalue (car (x)), strlength (car (x))); |
4374 | memcpy (pos, strvalue (car (x)), strlength (car (x))); |
4398 | |
4375 | |
4399 | s_return (newstr); |
4376 | s_return (newstr); |
4400 | } |
4377 | } |
4401 | |
4378 | |
4402 | case OP_SUBSTR: /* substring */ |
4379 | case OP_SUBSTR: /* substring */ |
4403 | { |
4380 | { |
4404 | char *str; |
4381 | char *str = strvalue (x); |
4405 | int index0; |
4382 | int index0 = ivalue_unchecked (cadr (args)); |
4406 | int index1; |
4383 | int index1; |
4407 | int len; |
4384 | int len; |
4408 | |
4385 | |
4409 | str = strvalue (car (SCHEME_V->args)); |
|
|
4410 | |
|
|
4411 | index0 = ivalue (cadr (SCHEME_V->args)); |
|
|
4412 | |
|
|
4413 | if (index0 > strlength (car (SCHEME_V->args))) |
4386 | if (index0 > strlength (x)) |
4414 | Error_1 ("substring: start out of bounds:", cadr (SCHEME_V->args)); |
4387 | Error_1 ("substring: start out of bounds:", cadr (args)); |
4415 | |
4388 | |
4416 | if (cddr (SCHEME_V->args) != NIL) |
4389 | if (cddr (args) != NIL) |
4417 | { |
4390 | { |
4418 | index1 = ivalue (caddr (SCHEME_V->args)); |
4391 | index1 = ivalue_unchecked (caddr (args)); |
4419 | |
4392 | |
4420 | if (index1 > strlength (car (SCHEME_V->args)) || index1 < index0) |
4393 | if (index1 > strlength (x) || index1 < index0) |
4421 | Error_1 ("substring: end out of bounds:", caddr (SCHEME_V->args)); |
4394 | Error_1 ("substring: end out of bounds:", caddr (args)); |
4422 | } |
4395 | } |
4423 | else |
4396 | else |
4424 | index1 = strlength (car (SCHEME_V->args)); |
4397 | index1 = strlength (x); |
4425 | |
4398 | |
4426 | len = index1 - index0; |
4399 | len = index1 - index0; |
4427 | x = mk_empty_string (SCHEME_A_ len, ' '); |
4400 | x = mk_empty_string (SCHEME_A_ len, ' '); |
4428 | memcpy (strvalue (x), str + index0, len); |
4401 | memcpy (strvalue (x), str + index0, len); |
4429 | strvalue (x)[len] = 0; |
4402 | strvalue (x)[len] = 0; |
… | |
… | |
4433 | |
4406 | |
4434 | case OP_VECTOR: /* vector */ |
4407 | case OP_VECTOR: /* vector */ |
4435 | { |
4408 | { |
4436 | int i; |
4409 | int i; |
4437 | pointer vec; |
4410 | pointer vec; |
4438 | int len = list_length (SCHEME_A_ SCHEME_V->args); |
4411 | int len = list_length (SCHEME_A_ args); |
4439 | |
4412 | |
4440 | if (len < 0) |
4413 | if (len < 0) |
4441 | Error_1 ("vector: not a proper list:", SCHEME_V->args); |
4414 | Error_1 ("vector: not a proper list:", args); |
4442 | |
4415 | |
4443 | vec = mk_vector (SCHEME_A_ len); |
4416 | vec = mk_vector (SCHEME_A_ len); |
4444 | |
4417 | |
4445 | #if USE_ERROR_CHECKING |
4418 | #if USE_ERROR_CHECKING |
4446 | if (SCHEME_V->no_memory) |
4419 | if (SCHEME_V->no_memory) |
4447 | s_return (S_SINK); |
4420 | s_return (S_SINK); |
4448 | #endif |
4421 | #endif |
4449 | |
4422 | |
4450 | for (x = SCHEME_V->args, i = 0; is_pair (x); x = cdr (x), i++) |
4423 | for (x = args, i = 0; is_pair (x); x = cdr (x), i++) |
4451 | set_vector_elem (vec, i, car (x)); |
4424 | vector_set (vec, i, car (x)); |
4452 | |
4425 | |
4453 | s_return (vec); |
4426 | s_return (vec); |
4454 | } |
4427 | } |
4455 | |
4428 | |
4456 | case OP_MKVECTOR: /* make-vector */ |
4429 | case OP_MKVECTOR: /* make-vector */ |
4457 | { |
4430 | { |
4458 | pointer fill = NIL; |
4431 | pointer fill = NIL; |
4459 | int len; |
|
|
4460 | pointer vec; |
4432 | pointer vec; |
|
|
4433 | int len = ivalue_unchecked (x); |
4461 | |
4434 | |
4462 | len = ivalue (car (SCHEME_V->args)); |
|
|
4463 | |
|
|
4464 | if (cdr (SCHEME_V->args) != NIL) |
4435 | if (cdr (args) != NIL) |
4465 | fill = cadr (SCHEME_V->args); |
4436 | fill = cadr (args); |
4466 | |
4437 | |
4467 | vec = mk_vector (SCHEME_A_ len); |
4438 | vec = mk_vector (SCHEME_A_ len); |
4468 | |
4439 | |
4469 | #if USE_ERROR_CHECKING |
4440 | #if USE_ERROR_CHECKING |
4470 | if (SCHEME_V->no_memory) |
4441 | if (SCHEME_V->no_memory) |
4471 | s_return (S_SINK); |
4442 | s_return (S_SINK); |
4472 | #endif |
4443 | #endif |
4473 | |
4444 | |
4474 | if (fill != NIL) |
4445 | if (fill != NIL) |
4475 | fill_vector (vec, fill); |
4446 | fill_vector (vec, 0, fill); |
4476 | |
4447 | |
4477 | s_return (vec); |
4448 | s_return (vec); |
4478 | } |
4449 | } |
4479 | |
4450 | |
4480 | case OP_VECLEN: /* vector-length */ |
4451 | case OP_VECLEN: /* vector-length */ |
4481 | s_return (mk_integer (SCHEME_A_ veclength (car (SCHEME_V->args)))); |
4452 | s_return (mk_integer (SCHEME_A_ veclength (x))); |
|
|
4453 | |
|
|
4454 | case OP_VECRESIZE: |
|
|
4455 | vector_resize (x, ivalue_unchecked (cadr (args)), caddr (args)); |
|
|
4456 | s_return (x); |
4482 | |
4457 | |
4483 | case OP_VECREF: /* vector-ref */ |
4458 | case OP_VECREF: /* vector-ref */ |
4484 | { |
4459 | { |
4485 | int index; |
|
|
4486 | |
|
|
4487 | index = ivalue (cadr (SCHEME_V->args)); |
4460 | int index = ivalue_unchecked (cadr (args)); |
4488 | |
4461 | |
4489 | if (index >= veclength (car (SCHEME_V->args)) && USE_ERROR_CHECKING) |
4462 | if (index >= veclength (car (args)) && USE_ERROR_CHECKING) |
4490 | Error_1 ("vector-ref: out of bounds:", cadr (SCHEME_V->args)); |
4463 | Error_1 ("vector-ref: out of bounds:", cadr (args)); |
4491 | |
4464 | |
4492 | s_return (vector_elem (car (SCHEME_V->args), index)); |
4465 | s_return (vector_get (x, index)); |
4493 | } |
4466 | } |
4494 | |
4467 | |
4495 | case OP_VECSET: /* vector-set! */ |
4468 | case OP_VECSET: /* vector-set! */ |
4496 | { |
4469 | { |
4497 | int index; |
4470 | int index = ivalue_unchecked (cadr (args)); |
4498 | |
4471 | |
4499 | if (is_immutable (car (SCHEME_V->args))) |
4472 | if (is_immutable (x)) |
4500 | Error_1 ("vector-set!: unable to alter immutable vector:", car (SCHEME_V->args)); |
4473 | Error_1 ("vector-set!: unable to alter immutable vector:", x); |
4501 | |
4474 | |
4502 | index = ivalue (cadr (SCHEME_V->args)); |
|
|
4503 | |
|
|
4504 | if (index >= veclength (car (SCHEME_V->args)) && USE_ERROR_CHECKING) |
4475 | if (index >= veclength (car (args)) && USE_ERROR_CHECKING) |
4505 | Error_1 ("vector-set!: out of bounds:", cadr (SCHEME_V->args)); |
4476 | Error_1 ("vector-set!: out of bounds:", cadr (args)); |
4506 | |
4477 | |
4507 | set_vector_elem (car (SCHEME_V->args), index, caddr (SCHEME_V->args)); |
4478 | vector_set (x, index, caddr (args)); |
4508 | s_return (car (SCHEME_V->args)); |
4479 | s_return (x); |
4509 | } |
4480 | } |
4510 | } |
4481 | } |
4511 | |
4482 | |
4512 | return S_T; |
4483 | if (USE_ERROR_CHECKING) abort (); |
4513 | } |
4484 | } |
4514 | |
4485 | |
4515 | INTERFACE int |
4486 | static int |
4516 | is_list (SCHEME_P_ pointer a) |
4487 | opexe_2 (SCHEME_P_ enum scheme_opcodes op) |
4517 | { |
4488 | { |
4518 | return list_length (SCHEME_A_ a) >= 0; |
4489 | pointer x = SCHEME_V->args; |
4519 | } |
|
|
4520 | |
4490 | |
4521 | /* Result is: |
4491 | for (;;) |
4522 | proper list: length |
|
|
4523 | circular list: -1 |
|
|
4524 | not even a pair: -2 |
|
|
4525 | dotted list: -2 minus length before dot |
|
|
4526 | */ |
|
|
4527 | INTERFACE int |
|
|
4528 | list_length (SCHEME_P_ pointer a) |
|
|
4529 | { |
|
|
4530 | int i = 0; |
|
|
4531 | pointer slow, fast; |
|
|
4532 | |
|
|
4533 | slow = fast = a; |
|
|
4534 | |
|
|
4535 | while (1) |
|
|
4536 | { |
4492 | { |
|
|
4493 | num v = nvalue (car (x)); |
|
|
4494 | x = cdr (x); |
|
|
4495 | |
4537 | if (fast == NIL) |
4496 | if (x == NIL) |
4538 | return i; |
4497 | break; |
4539 | |
4498 | |
4540 | if (!is_pair (fast)) |
4499 | int r = num_cmp (v, nvalue (car (x))); |
4541 | return -2 - i; |
|
|
4542 | |
4500 | |
4543 | fast = cdr (fast); |
4501 | switch (op) |
4544 | ++i; |
|
|
4545 | |
|
|
4546 | if (fast == NIL) |
|
|
4547 | return i; |
|
|
4548 | |
|
|
4549 | if (!is_pair (fast)) |
|
|
4550 | return -2 - i; |
|
|
4551 | |
|
|
4552 | ++i; |
|
|
4553 | fast = cdr (fast); |
|
|
4554 | |
|
|
4555 | /* Safe because we would have already returned if `fast' |
|
|
4556 | encountered a non-pair. */ |
|
|
4557 | slow = cdr (slow); |
|
|
4558 | |
|
|
4559 | if (fast == slow) |
|
|
4560 | { |
4502 | { |
4561 | /* the fast pointer has looped back around and caught up |
4503 | case OP_NUMEQ: r = r == 0; break; |
4562 | with the slow pointer, hence the structure is circular, |
4504 | case OP_LESS: r = r < 0; break; |
4563 | not of finite length, and therefore not a list */ |
4505 | case OP_GRE: r = r > 0; break; |
4564 | return -1; |
4506 | case OP_LEQ: r = r <= 0; break; |
|
|
4507 | case OP_GEQ: r = r >= 0; break; |
4565 | } |
4508 | } |
4566 | } |
|
|
4567 | } |
|
|
4568 | |
4509 | |
|
|
4510 | if (!r) |
|
|
4511 | s_return (S_F); |
|
|
4512 | } |
|
|
4513 | |
|
|
4514 | s_return (S_T); |
|
|
4515 | } |
|
|
4516 | |
4569 | static pointer |
4517 | static int |
4570 | opexe_3 (SCHEME_P_ enum scheme_opcodes op) |
4518 | opexe_3 (SCHEME_P_ enum scheme_opcodes op) |
4571 | { |
4519 | { |
4572 | pointer x; |
4520 | pointer args = SCHEME_V->args; |
4573 | num v; |
4521 | pointer a = car (args); |
4574 | int (*comp_func) (num, num); |
4522 | pointer d = cdr (args); |
|
|
4523 | int r; |
4575 | |
4524 | |
4576 | switch (op) |
4525 | switch (op) |
4577 | { |
4526 | { |
4578 | case OP_NOT: /* not */ |
4527 | case OP_NOT: /* not */ r = is_false (a) ; break; |
4579 | s_retbool (is_false (car (SCHEME_V->args))); |
4528 | case OP_BOOLP: /* boolean? */ r = a == S_F || a == S_T ; break; |
|
|
4529 | case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break; |
|
|
4530 | case OP_NULLP: /* null? */ r = a == NIL ; break; |
|
|
4531 | case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break; |
|
|
4532 | case OP_GENSYMP: /* gensym? */ r = is_gensym (SCHEME_A_ a); break; |
|
|
4533 | case OP_NUMBERP: /* number? */ r = is_number (a) ; break; |
|
|
4534 | case OP_STRINGP: /* string? */ r = is_string (a) ; break; |
|
|
4535 | case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break; |
|
|
4536 | case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */ |
|
|
4537 | case OP_CHARP: /* char? */ r = is_character (a) ; break; |
4580 | |
4538 | |
4581 | case OP_BOOLP: /* boolean? */ |
|
|
4582 | s_retbool (car (SCHEME_V->args) == S_F || car (SCHEME_V->args) == S_T); |
|
|
4583 | |
|
|
4584 | case OP_EOFOBJP: /* boolean? */ |
|
|
4585 | s_retbool (car (SCHEME_V->args) == S_EOF); |
|
|
4586 | |
|
|
4587 | case OP_NULLP: /* null? */ |
|
|
4588 | s_retbool (car (SCHEME_V->args) == NIL); |
|
|
4589 | |
|
|
4590 | case OP_NUMEQ: /* = */ |
|
|
4591 | case OP_LESS: /* < */ |
|
|
4592 | case OP_GRE: /* > */ |
|
|
4593 | case OP_LEQ: /* <= */ |
|
|
4594 | case OP_GEQ: /* >= */ |
|
|
4595 | switch (op) |
|
|
4596 | { |
|
|
4597 | case OP_NUMEQ: |
|
|
4598 | comp_func = num_eq; |
|
|
4599 | break; |
|
|
4600 | |
|
|
4601 | case OP_LESS: |
|
|
4602 | comp_func = num_lt; |
|
|
4603 | break; |
|
|
4604 | |
|
|
4605 | case OP_GRE: |
|
|
4606 | comp_func = num_gt; |
|
|
4607 | break; |
|
|
4608 | |
|
|
4609 | case OP_LEQ: |
|
|
4610 | comp_func = num_le; |
|
|
4611 | break; |
|
|
4612 | |
|
|
4613 | case OP_GEQ: |
|
|
4614 | comp_func = num_ge; |
|
|
4615 | break; |
|
|
4616 | } |
|
|
4617 | |
|
|
4618 | x = SCHEME_V->args; |
|
|
4619 | v = nvalue (car (x)); |
|
|
4620 | x = cdr (x); |
|
|
4621 | |
|
|
4622 | for (; x != NIL; x = cdr (x)) |
|
|
4623 | { |
|
|
4624 | if (!comp_func (v, nvalue (car (x)))) |
|
|
4625 | s_retbool (0); |
|
|
4626 | |
|
|
4627 | v = nvalue (car (x)); |
|
|
4628 | } |
|
|
4629 | |
|
|
4630 | s_retbool (1); |
|
|
4631 | |
|
|
4632 | case OP_SYMBOLP: /* symbol? */ |
|
|
4633 | s_retbool (is_symbol (car (SCHEME_V->args))); |
|
|
4634 | |
|
|
4635 | case OP_NUMBERP: /* number? */ |
|
|
4636 | s_retbool (is_number (car (SCHEME_V->args))); |
|
|
4637 | |
|
|
4638 | case OP_STRINGP: /* string? */ |
|
|
4639 | s_retbool (is_string (car (SCHEME_V->args))); |
|
|
4640 | |
|
|
4641 | case OP_INTEGERP: /* integer? */ |
|
|
4642 | s_retbool (is_integer (car (SCHEME_V->args))); |
|
|
4643 | |
|
|
4644 | case OP_REALP: /* real? */ |
|
|
4645 | s_retbool (is_number (car (SCHEME_V->args))); /* All numbers are real */ |
|
|
4646 | |
|
|
4647 | case OP_CHARP: /* char? */ |
|
|
4648 | s_retbool (is_character (car (SCHEME_V->args))); |
|
|
4649 | #if USE_CHAR_CLASSIFIERS |
4539 | #if USE_CHAR_CLASSIFIERS |
4650 | |
4540 | case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue_unchecked (a)); break; |
4651 | case OP_CHARAP: /* char-alphabetic? */ |
4541 | case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue_unchecked (a)); break; |
4652 | s_retbool (Cisalpha (ivalue (car (SCHEME_V->args)))); |
4542 | case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue_unchecked (a)); break; |
4653 | |
4543 | case OP_CHARUP: /* char-upper-case? */ r = Cisupper (ivalue_unchecked (a)); break; |
4654 | case OP_CHARNP: /* char-numeric? */ |
4544 | case OP_CHARLP: /* char-lower-case? */ r = Cislower (ivalue_unchecked (a)); break; |
4655 | s_retbool (Cisdigit (ivalue (car (SCHEME_V->args)))); |
|
|
4656 | |
|
|
4657 | case OP_CHARWP: /* char-whitespace? */ |
|
|
4658 | s_retbool (Cisspace (ivalue (car (SCHEME_V->args)))); |
|
|
4659 | |
|
|
4660 | case OP_CHARUP: /* char-upper-case? */ |
|
|
4661 | s_retbool (Cisupper (ivalue (car (SCHEME_V->args)))); |
|
|
4662 | |
|
|
4663 | case OP_CHARLP: /* char-lower-case? */ |
|
|
4664 | s_retbool (Cislower (ivalue (car (SCHEME_V->args)))); |
|
|
4665 | #endif |
4545 | #endif |
|
|
4546 | |
4666 | #if USE_PORTS |
4547 | #if USE_PORTS |
4667 | |
4548 | case OP_PORTP: /* port? */ r = is_port (a) ; break; |
4668 | case OP_PORTP: /* port? */ |
|
|
4669 | s_retbool (is_port (car (SCHEME_V->args))); |
|
|
4670 | |
|
|
4671 | case OP_INPORTP: /* input-port? */ |
4549 | case OP_INPORTP: /* input-port? */ r = is_inport (a) ; break; |
4672 | s_retbool (is_inport (car (SCHEME_V->args))); |
|
|
4673 | |
|
|
4674 | case OP_OUTPORTP: /* output-port? */ |
4550 | case OP_OUTPORTP: /* output-port? */ r = is_outport (a); break; |
4675 | s_retbool (is_outport (car (SCHEME_V->args))); |
|
|
4676 | #endif |
4551 | #endif |
4677 | |
4552 | |
4678 | case OP_PROCP: /* procedure? */ |
4553 | case OP_PROCP: /* procedure? */ |
4679 | |
4554 | |
4680 | /*-- |
4555 | /*-- |
4681 | * continuation should be procedure by the example |
4556 | * continuation should be procedure by the example |
4682 | * (call-with-current-continuation procedure?) ==> #t |
4557 | * (call-with-current-continuation procedure?) ==> #t |
4683 | * in R^3 report sec. 6.9 |
4558 | * in R^3 report sec. 6.9 |
4684 | */ |
4559 | */ |
4685 | s_retbool (is_proc (car (SCHEME_V->args)) || is_closure (car (SCHEME_V->args)) |
4560 | r = is_proc (a) || is_closure (a) || is_continuation (a) || is_foreign (a); |
4686 | || is_continuation (car (SCHEME_V->args)) || is_foreign (car (SCHEME_V->args))); |
4561 | break; |
4687 | |
4562 | |
4688 | case OP_PAIRP: /* pair? */ |
4563 | case OP_PAIRP: /* pair? */ r = is_pair (a) ; break; |
4689 | s_retbool (is_pair (car (SCHEME_V->args))); |
4564 | case OP_LISTP: /* list? */ r = list_length (SCHEME_A_ a) >= 0; break; |
4690 | |
4565 | case OP_ENVP: /* environment? */ r = is_environment (a) ; break; |
4691 | case OP_LISTP: /* list? */ |
4566 | case OP_VECTORP: /* vector? */ r = is_vector (a) ; break; |
4692 | s_retbool (list_length (SCHEME_A_ car (SCHEME_V->args)) >= 0); |
4567 | case OP_EQ: /* eq? */ r = a == cadr (args) ; break; |
4693 | |
4568 | case OP_EQV: /* eqv? */ r = eqv (a, cadr (args)) ; break; |
4694 | case OP_ENVP: /* environment? */ |
|
|
4695 | s_retbool (is_environment (car (SCHEME_V->args))); |
|
|
4696 | |
|
|
4697 | case OP_VECTORP: /* vector? */ |
|
|
4698 | s_retbool (is_vector (car (SCHEME_V->args))); |
|
|
4699 | |
|
|
4700 | case OP_EQ: /* eq? */ |
|
|
4701 | s_retbool (car (SCHEME_V->args) == cadr (SCHEME_V->args)); |
|
|
4702 | |
|
|
4703 | case OP_EQV: /* eqv? */ |
|
|
4704 | s_retbool (eqv (car (SCHEME_V->args), cadr (SCHEME_V->args))); |
|
|
4705 | } |
4569 | } |
4706 | |
4570 | |
4707 | return S_T; |
4571 | s_retbool (r); |
4708 | } |
4572 | } |
4709 | |
4573 | |
4710 | static pointer |
4574 | static int |
4711 | opexe_4 (SCHEME_P_ enum scheme_opcodes op) |
4575 | opexe_4 (SCHEME_P_ enum scheme_opcodes op) |
4712 | { |
4576 | { |
|
|
4577 | pointer args = SCHEME_V->args; |
|
|
4578 | pointer a = car (args); |
4713 | pointer x, y; |
4579 | pointer x, y; |
4714 | |
4580 | |
4715 | switch (op) |
4581 | switch (op) |
4716 | { |
4582 | { |
4717 | case OP_FORCE: /* force */ |
4583 | case OP_FORCE: /* force */ |
4718 | SCHEME_V->code = car (SCHEME_V->args); |
4584 | SCHEME_V->code = a; |
4719 | |
4585 | |
4720 | if (is_promise (SCHEME_V->code)) |
4586 | if (is_promise (SCHEME_V->code)) |
4721 | { |
4587 | { |
4722 | /* Should change type to closure here */ |
4588 | /* Should change type to closure here */ |
4723 | s_save (SCHEME_A_ OP_SAVE_FORCED, NIL, SCHEME_V->code); |
4589 | s_save (SCHEME_A_ OP_SAVE_FORCED, NIL, SCHEME_V->code); |
… | |
… | |
4726 | } |
4592 | } |
4727 | else |
4593 | else |
4728 | s_return (SCHEME_V->code); |
4594 | s_return (SCHEME_V->code); |
4729 | |
4595 | |
4730 | case OP_SAVE_FORCED: /* Save forced value replacing promise */ |
4596 | case OP_SAVE_FORCED: /* Save forced value replacing promise */ |
4731 | memcpy (SCHEME_V->code, SCHEME_V->value, sizeof (struct cell)); |
4597 | *CELL (SCHEME_V->code) = *CELL (SCHEME_V->value); |
4732 | s_return (SCHEME_V->value); |
4598 | s_return (SCHEME_V->value); |
4733 | |
4599 | |
4734 | #if USE_PORTS |
4600 | #if USE_PORTS |
4735 | |
4601 | |
4736 | case OP_WRITE: /* write */ |
4602 | case OP_WRITE: /* write */ |
… | |
… | |
4744 | s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL); |
4610 | s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL); |
4745 | SCHEME_V->outport = cadr (SCHEME_V->args); |
4611 | SCHEME_V->outport = cadr (SCHEME_V->args); |
4746 | } |
4612 | } |
4747 | } |
4613 | } |
4748 | |
4614 | |
4749 | SCHEME_V->args = car (SCHEME_V->args); |
4615 | SCHEME_V->args = a; |
4750 | |
4616 | |
4751 | if (op == OP_WRITE) |
4617 | if (op == OP_WRITE) |
4752 | SCHEME_V->print_flag = 1; |
4618 | SCHEME_V->print_flag = 1; |
4753 | else |
4619 | else |
4754 | SCHEME_V->print_flag = 0; |
4620 | SCHEME_V->print_flag = 0; |
4755 | |
4621 | |
4756 | s_goto (OP_P0LIST); |
4622 | s_goto (OP_P0LIST); |
4757 | |
4623 | |
4758 | case OP_NEWLINE: /* newline */ |
4624 | case OP_NEWLINE: /* newline */ |
4759 | if (is_pair (SCHEME_V->args)) |
4625 | if (is_pair (args)) |
4760 | { |
4626 | { |
4761 | if (car (SCHEME_V->args) != SCHEME_V->outport) |
4627 | if (a != SCHEME_V->outport) |
4762 | { |
4628 | { |
4763 | x = cons (SCHEME_V->outport, NIL); |
4629 | x = cons (SCHEME_V->outport, NIL); |
4764 | s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL); |
4630 | s_save (SCHEME_A_ OP_SET_OUTPORT, x, NIL); |
4765 | SCHEME_V->outport = car (SCHEME_V->args); |
4631 | SCHEME_V->outport = a; |
4766 | } |
4632 | } |
4767 | } |
4633 | } |
4768 | |
4634 | |
4769 | putstr (SCHEME_A_ "\n"); |
4635 | putstr (SCHEME_A_ "\n"); |
4770 | s_return (S_T); |
4636 | s_return (S_T); |
4771 | #endif |
4637 | #endif |
4772 | |
4638 | |
4773 | case OP_ERR0: /* error */ |
4639 | case OP_ERR0: /* error */ |
4774 | SCHEME_V->retcode = -1; |
4640 | SCHEME_V->retcode = -1; |
4775 | |
4641 | |
4776 | if (!is_string (car (SCHEME_V->args))) |
4642 | if (!is_string (a)) |
4777 | { |
4643 | { |
4778 | SCHEME_V->args = cons (mk_string (SCHEME_A_ " -- "), SCHEME_V->args); |
4644 | args = cons (mk_string (SCHEME_A_ " -- "), args); |
4779 | setimmutable (car (SCHEME_V->args)); |
4645 | setimmutable (car (args)); |
4780 | } |
4646 | } |
4781 | |
4647 | |
4782 | putstr (SCHEME_A_ "Error: "); |
4648 | putstr (SCHEME_A_ "Error: "); |
4783 | putstr (SCHEME_A_ strvalue (car (SCHEME_V->args))); |
4649 | putstr (SCHEME_A_ strvalue (car (args))); |
4784 | SCHEME_V->args = cdr (SCHEME_V->args); |
4650 | SCHEME_V->args = cdr (args); |
4785 | s_goto (OP_ERR1); |
4651 | s_goto (OP_ERR1); |
4786 | |
4652 | |
4787 | case OP_ERR1: /* error */ |
4653 | case OP_ERR1: /* error */ |
4788 | putstr (SCHEME_A_ " "); |
4654 | putstr (SCHEME_A_ " "); |
4789 | |
4655 | |
4790 | if (SCHEME_V->args != NIL) |
4656 | if (args != NIL) |
4791 | { |
4657 | { |
4792 | s_save (SCHEME_A_ OP_ERR1, cdr (SCHEME_V->args), NIL); |
4658 | s_save (SCHEME_A_ OP_ERR1, cdr (args), NIL); |
4793 | SCHEME_V->args = car (SCHEME_V->args); |
4659 | SCHEME_V->args = a; |
4794 | SCHEME_V->print_flag = 1; |
4660 | SCHEME_V->print_flag = 1; |
4795 | s_goto (OP_P0LIST); |
4661 | s_goto (OP_P0LIST); |
4796 | } |
4662 | } |
4797 | else |
4663 | else |
4798 | { |
4664 | { |
4799 | putstr (SCHEME_A_ "\n"); |
4665 | putstr (SCHEME_A_ "\n"); |
4800 | |
4666 | |
4801 | if (SCHEME_V->interactive_repl) |
4667 | if (SCHEME_V->interactive_repl) |
4802 | s_goto (OP_T0LVL); |
4668 | s_goto (OP_T0LVL); |
4803 | else |
4669 | else |
4804 | return NIL; |
4670 | return -1; |
4805 | } |
4671 | } |
4806 | |
4672 | |
4807 | case OP_REVERSE: /* reverse */ |
4673 | case OP_REVERSE: /* reverse */ |
4808 | s_return (reverse (SCHEME_A_ car (SCHEME_V->args))); |
4674 | s_return (reverse (SCHEME_A_ a)); |
4809 | |
4675 | |
4810 | case OP_LIST_STAR: /* list* */ |
4676 | case OP_LIST_STAR: /* list* */ |
4811 | s_return (list_star (SCHEME_A_ SCHEME_V->args)); |
4677 | s_return (list_star (SCHEME_A_ SCHEME_V->args)); |
4812 | |
4678 | |
4813 | case OP_APPEND: /* append */ |
4679 | case OP_APPEND: /* append */ |
4814 | x = NIL; |
4680 | x = NIL; |
4815 | y = SCHEME_V->args; |
4681 | y = args; |
4816 | |
4682 | |
4817 | if (y == x) |
4683 | if (y == x) |
4818 | s_return (x); |
4684 | s_return (x); |
4819 | |
4685 | |
4820 | /* cdr() in the while condition is not a typo. If car() */ |
4686 | /* cdr() in the while condition is not a typo. If car() */ |
… | |
… | |
4831 | s_return (reverse_in_place (SCHEME_A_ car (y), x)); |
4697 | s_return (reverse_in_place (SCHEME_A_ car (y), x)); |
4832 | |
4698 | |
4833 | #if USE_PLIST |
4699 | #if USE_PLIST |
4834 | |
4700 | |
4835 | case OP_PUT: /* put */ |
4701 | case OP_PUT: /* put */ |
4836 | if (!hasprop (car (SCHEME_V->args)) || !hasprop (cadr (SCHEME_V->args))) |
4702 | if (!hasprop (a) || !hasprop (cadr (args))) |
4837 | Error_0 ("illegal use of put"); |
4703 | Error_0 ("illegal use of put"); |
4838 | |
4704 | |
4839 | for (x = symprop (car (SCHEME_V->args)), y = cadr (SCHEME_V->args); x != NIL; x = cdr (x)) |
4705 | for (x = symprop (a), y = cadr (args); x != NIL; x = cdr (x)) |
4840 | { |
4706 | { |
4841 | if (caar (x) == y) |
4707 | if (caar (x) == y) |
4842 | break; |
4708 | break; |
4843 | } |
4709 | } |
4844 | |
4710 | |
4845 | if (x != NIL) |
4711 | if (x != NIL) |
4846 | cdar (x) = caddr (SCHEME_V->args); |
4712 | cdar (x) = caddr (args); |
4847 | else |
4713 | else |
4848 | symprop (car (SCHEME_V->args)) = cons (cons (y, caddr (SCHEME_V->args)), symprop (car (SCHEME_V->args))); |
4714 | symprop (a) = cons (cons (y, caddr (args)), symprop (a)); |
4849 | |
4715 | |
4850 | s_return (S_T); |
4716 | s_return (S_T); |
4851 | |
4717 | |
4852 | case OP_GET: /* get */ |
4718 | case OP_GET: /* get */ |
4853 | if (!hasprop (car (SCHEME_V->args)) || !hasprop (cadr (SCHEME_V->args))) |
4719 | if (!hasprop (a) || !hasprop (cadr (args))) |
4854 | Error_0 ("illegal use of get"); |
4720 | Error_0 ("illegal use of get"); |
4855 | |
4721 | |
4856 | for (x = symprop (car (SCHEME_V->args)), y = cadr (SCHEME_V->args); x != NIL; x = cdr (x)) |
4722 | for (x = symprop (a), y = cadr (args); x != NIL; x = cdr (x)) |
4857 | if (caar (x) == y) |
4723 | if (caar (x) == y) |
4858 | break; |
4724 | break; |
4859 | |
4725 | |
4860 | if (x != NIL) |
4726 | if (x != NIL) |
4861 | s_return (cdar (x)); |
4727 | s_return (cdar (x)); |
… | |
… | |
4863 | s_return (NIL); |
4729 | s_return (NIL); |
4864 | |
4730 | |
4865 | #endif /* USE_PLIST */ |
4731 | #endif /* USE_PLIST */ |
4866 | |
4732 | |
4867 | case OP_QUIT: /* quit */ |
4733 | case OP_QUIT: /* quit */ |
4868 | if (is_pair (SCHEME_V->args)) |
4734 | if (is_pair (args)) |
4869 | SCHEME_V->retcode = ivalue (car (SCHEME_V->args)); |
4735 | SCHEME_V->retcode = ivalue (a); |
4870 | |
4736 | |
4871 | return NIL; |
4737 | return -1; |
4872 | |
4738 | |
4873 | case OP_GC: /* gc */ |
4739 | case OP_GC: /* gc */ |
4874 | gc (SCHEME_A_ NIL, NIL); |
4740 | gc (SCHEME_A_ NIL, NIL); |
4875 | s_return (S_T); |
4741 | s_return (S_T); |
4876 | |
4742 | |
4877 | case OP_GCVERB: /* gc-verbose */ |
4743 | case OP_GCVERB: /* gc-verbose */ |
4878 | { |
4744 | { |
4879 | int was = SCHEME_V->gc_verbose; |
4745 | int was = SCHEME_V->gc_verbose; |
4880 | |
4746 | |
4881 | SCHEME_V->gc_verbose = (car (SCHEME_V->args) != S_F); |
4747 | SCHEME_V->gc_verbose = (a != S_F); |
4882 | s_retbool (was); |
4748 | s_retbool (was); |
4883 | } |
4749 | } |
4884 | |
4750 | |
4885 | case OP_NEWSEGMENT: /* new-segment */ |
4751 | case OP_NEWSEGMENT: /* new-segment */ |
|
|
4752 | #if 0 |
4886 | if (!is_pair (SCHEME_V->args) || !is_number (car (SCHEME_V->args))) |
4753 | if (!is_pair (args) || !is_number (a)) |
4887 | Error_0 ("new-segment: argument must be a number"); |
4754 | Error_0 ("new-segment: argument must be a number"); |
4888 | |
4755 | #endif |
4889 | alloc_cellseg (SCHEME_A_ (int)ivalue (car (SCHEME_V->args))); |
4756 | s_retbool (alloc_cellseg (SCHEME_A)); |
4890 | |
|
|
4891 | s_return (S_T); |
|
|
4892 | |
4757 | |
4893 | case OP_OBLIST: /* oblist */ |
4758 | case OP_OBLIST: /* oblist */ |
4894 | s_return (oblist_all_symbols (SCHEME_A)); |
4759 | s_return (oblist_all_symbols (SCHEME_A)); |
4895 | |
4760 | |
4896 | #if USE_PORTS |
4761 | #if USE_PORTS |
… | |
… | |
4921 | case OP_OPEN_INOUTFILE: |
4786 | case OP_OPEN_INOUTFILE: |
4922 | prop = port_input | port_output; |
4787 | prop = port_input | port_output; |
4923 | break; |
4788 | break; |
4924 | } |
4789 | } |
4925 | |
4790 | |
4926 | p = port_from_filename (SCHEME_A_ strvalue (car (SCHEME_V->args)), prop); |
4791 | p = port_from_filename (SCHEME_A_ strvalue (a), prop); |
4927 | |
4792 | |
4928 | if (p == NIL) |
4793 | s_return (p == NIL ? S_F : p); |
4929 | s_return (S_F); |
|
|
4930 | |
|
|
4931 | s_return (p); |
|
|
4932 | } |
4794 | } |
4933 | |
4795 | |
4934 | # if USE_STRING_PORTS |
4796 | # if USE_STRING_PORTS |
4935 | |
4797 | |
4936 | case OP_OPEN_INSTRING: /* open-input-string */ |
4798 | case OP_OPEN_INSTRING: /* open-input-string */ |
… | |
… | |
4948 | case OP_OPEN_INOUTSTRING: |
4810 | case OP_OPEN_INOUTSTRING: |
4949 | prop = port_input | port_output; |
4811 | prop = port_input | port_output; |
4950 | break; |
4812 | break; |
4951 | } |
4813 | } |
4952 | |
4814 | |
4953 | p = port_from_string (SCHEME_A_ strvalue (car (SCHEME_V->args)), |
4815 | p = port_from_string (SCHEME_A_ strvalue (a), |
4954 | strvalue (car (SCHEME_V->args)) + strlength (car (SCHEME_V->args)), prop); |
4816 | strvalue (a) + strlength (a), prop); |
4955 | |
4817 | |
4956 | if (p == NIL) |
4818 | s_return (p == NIL ? S_F : p); |
4957 | s_return (S_F); |
|
|
4958 | |
|
|
4959 | s_return (p); |
|
|
4960 | } |
4819 | } |
4961 | |
4820 | |
4962 | case OP_OPEN_OUTSTRING: /* open-output-string */ |
4821 | case OP_OPEN_OUTSTRING: /* open-output-string */ |
4963 | { |
4822 | { |
4964 | pointer p; |
4823 | pointer p; |
4965 | |
4824 | |
4966 | if (car (SCHEME_V->args) == NIL) |
4825 | if (a == NIL) |
4967 | { |
|
|
4968 | p = port_from_scratch (SCHEME_A); |
4826 | p = port_from_scratch (SCHEME_A); |
4969 | |
|
|
4970 | if (p == NIL) |
|
|
4971 | s_return (S_F); |
|
|
4972 | } |
|
|
4973 | else |
4827 | else |
4974 | { |
|
|
4975 | p = port_from_string (SCHEME_A_ strvalue (car (SCHEME_V->args)), |
4828 | p = port_from_string (SCHEME_A_ strvalue (a), |
4976 | strvalue (car (SCHEME_V->args)) + strlength (car (SCHEME_V->args)), port_output); |
4829 | strvalue (a) + strlength (a), port_output); |
4977 | |
4830 | |
4978 | if (p == NIL) |
4831 | s_return (p == NIL ? S_F : p); |
4979 | s_return (S_F); |
|
|
4980 | } |
|
|
4981 | |
|
|
4982 | s_return (p); |
|
|
4983 | } |
4832 | } |
4984 | |
4833 | |
4985 | case OP_GET_OUTSTRING: /* get-output-string */ |
4834 | case OP_GET_OUTSTRING: /* get-output-string */ |
4986 | { |
4835 | { |
4987 | port *p; |
4836 | port *p = port (a); |
4988 | |
4837 | |
4989 | if ((p = car (SCHEME_V->args)->object.port)->kind & port_string) |
4838 | if (p->kind & port_string) |
4990 | { |
4839 | { |
4991 | off_t size; |
4840 | off_t size; |
4992 | char *str; |
4841 | char *str; |
4993 | |
4842 | |
4994 | size = p->rep.string.curr - p->rep.string.start + 1; |
4843 | size = p->rep.string.curr - p->rep.string.start + 1; |
… | |
… | |
5010 | } |
4859 | } |
5011 | |
4860 | |
5012 | # endif |
4861 | # endif |
5013 | |
4862 | |
5014 | case OP_CLOSE_INPORT: /* close-input-port */ |
4863 | case OP_CLOSE_INPORT: /* close-input-port */ |
5015 | port_close (SCHEME_A_ car (SCHEME_V->args), port_input); |
4864 | port_close (SCHEME_A_ a, port_input); |
5016 | s_return (S_T); |
4865 | s_return (S_T); |
5017 | |
4866 | |
5018 | case OP_CLOSE_OUTPORT: /* close-output-port */ |
4867 | case OP_CLOSE_OUTPORT: /* close-output-port */ |
5019 | port_close (SCHEME_A_ car (SCHEME_V->args), port_output); |
4868 | port_close (SCHEME_A_ a, port_output); |
5020 | s_return (S_T); |
4869 | s_return (S_T); |
5021 | #endif |
4870 | #endif |
5022 | |
4871 | |
5023 | case OP_INT_ENV: /* interaction-environment */ |
4872 | case OP_INT_ENV: /* interaction-environment */ |
5024 | s_return (SCHEME_V->global_env); |
4873 | s_return (SCHEME_V->global_env); |
… | |
… | |
5026 | case OP_CURR_ENV: /* current-environment */ |
4875 | case OP_CURR_ENV: /* current-environment */ |
5027 | s_return (SCHEME_V->envir); |
4876 | s_return (SCHEME_V->envir); |
5028 | |
4877 | |
5029 | } |
4878 | } |
5030 | |
4879 | |
5031 | return S_T; |
4880 | if (USE_ERROR_CHECKING) abort (); |
5032 | } |
4881 | } |
5033 | |
4882 | |
5034 | static pointer |
4883 | static int |
5035 | opexe_5 (SCHEME_P_ enum scheme_opcodes op) |
4884 | opexe_5 (SCHEME_P_ enum scheme_opcodes op) |
5036 | { |
4885 | { |
|
|
4886 | pointer args = SCHEME_V->args; |
5037 | pointer x; |
4887 | pointer x; |
5038 | |
4888 | |
5039 | if (SCHEME_V->nesting != 0) |
4889 | if (SCHEME_V->nesting != 0) |
5040 | { |
4890 | { |
5041 | int n = SCHEME_V->nesting; |
4891 | int n = SCHEME_V->nesting; |
… | |
… | |
5048 | switch (op) |
4898 | switch (op) |
5049 | { |
4899 | { |
5050 | /* ========== reading part ========== */ |
4900 | /* ========== reading part ========== */ |
5051 | #if USE_PORTS |
4901 | #if USE_PORTS |
5052 | case OP_READ: |
4902 | case OP_READ: |
5053 | if (!is_pair (SCHEME_V->args)) |
4903 | if (!is_pair (args)) |
5054 | s_goto (OP_READ_INTERNAL); |
4904 | s_goto (OP_READ_INTERNAL); |
5055 | |
4905 | |
5056 | if (!is_inport (car (SCHEME_V->args))) |
4906 | if (!is_inport (car (args))) |
5057 | Error_1 ("read: not an input port:", car (SCHEME_V->args)); |
4907 | Error_1 ("read: not an input port:", car (args)); |
5058 | |
4908 | |
5059 | if (car (SCHEME_V->args) == SCHEME_V->inport) |
4909 | if (car (args) == SCHEME_V->inport) |
5060 | s_goto (OP_READ_INTERNAL); |
4910 | s_goto (OP_READ_INTERNAL); |
5061 | |
4911 | |
5062 | x = SCHEME_V->inport; |
4912 | x = SCHEME_V->inport; |
5063 | SCHEME_V->inport = car (SCHEME_V->args); |
4913 | SCHEME_V->inport = car (args); |
5064 | x = cons (x, NIL); |
4914 | x = cons (x, NIL); |
5065 | s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); |
4915 | s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); |
5066 | s_goto (OP_READ_INTERNAL); |
4916 | s_goto (OP_READ_INTERNAL); |
5067 | |
4917 | |
5068 | case OP_READ_CHAR: /* read-char */ |
4918 | case OP_READ_CHAR: /* read-char */ |
5069 | case OP_PEEK_CHAR: /* peek-char */ |
4919 | case OP_PEEK_CHAR: /* peek-char */ |
5070 | { |
4920 | { |
5071 | int c; |
4921 | int c; |
5072 | |
4922 | |
5073 | if (is_pair (SCHEME_V->args)) |
4923 | if (is_pair (args)) |
5074 | { |
4924 | { |
5075 | if (car (SCHEME_V->args) != SCHEME_V->inport) |
4925 | if (car (args) != SCHEME_V->inport) |
5076 | { |
4926 | { |
5077 | x = SCHEME_V->inport; |
4927 | x = SCHEME_V->inport; |
5078 | x = cons (x, NIL); |
4928 | x = cons (x, NIL); |
5079 | s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); |
4929 | s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); |
5080 | SCHEME_V->inport = car (SCHEME_V->args); |
4930 | SCHEME_V->inport = car (args); |
5081 | } |
4931 | } |
5082 | } |
4932 | } |
5083 | |
4933 | |
5084 | c = inchar (SCHEME_A); |
4934 | c = inchar (SCHEME_A); |
5085 | |
4935 | |
… | |
… | |
5095 | case OP_CHAR_READY: /* char-ready? */ |
4945 | case OP_CHAR_READY: /* char-ready? */ |
5096 | { |
4946 | { |
5097 | pointer p = SCHEME_V->inport; |
4947 | pointer p = SCHEME_V->inport; |
5098 | int res; |
4948 | int res; |
5099 | |
4949 | |
5100 | if (is_pair (SCHEME_V->args)) |
4950 | if (is_pair (args)) |
5101 | p = car (SCHEME_V->args); |
4951 | p = car (args); |
5102 | |
4952 | |
5103 | res = p->object.port->kind & port_string; |
4953 | res = port (p)->kind & port_string; |
5104 | |
4954 | |
5105 | s_retbool (res); |
4955 | s_retbool (res); |
5106 | } |
4956 | } |
5107 | |
4957 | |
5108 | case OP_SET_INPORT: /* set-input-port */ |
4958 | case OP_SET_INPORT: /* set-input-port */ |
5109 | SCHEME_V->inport = car (SCHEME_V->args); |
4959 | SCHEME_V->inport = car (args); |
5110 | s_return (SCHEME_V->value); |
4960 | s_return (SCHEME_V->value); |
5111 | |
4961 | |
5112 | case OP_SET_OUTPORT: /* set-output-port */ |
4962 | case OP_SET_OUTPORT: /* set-output-port */ |
5113 | SCHEME_V->outport = car (SCHEME_V->args); |
4963 | SCHEME_V->outport = car (args); |
5114 | s_return (SCHEME_V->value); |
4964 | s_return (SCHEME_V->value); |
5115 | #endif |
4965 | #endif |
5116 | |
4966 | |
5117 | case OP_RDSEXPR: |
4967 | case OP_RDSEXPR: |
5118 | switch (SCHEME_V->tok) |
4968 | switch (SCHEME_V->tok) |
… | |
… | |
5167 | s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL); |
5017 | s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL); |
5168 | SCHEME_V->tok = token (SCHEME_A); |
5018 | SCHEME_V->tok = token (SCHEME_A); |
5169 | s_goto (OP_RDSEXPR); |
5019 | s_goto (OP_RDSEXPR); |
5170 | |
5020 | |
5171 | case TOK_ATOM: |
5021 | case TOK_ATOM: |
5172 | s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))); |
5022 | s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS))); |
|
|
5023 | |
|
|
5024 | case TOK_DOTATOM: |
|
|
5025 | SCHEME_V->strbuff[0] = '.'; |
|
|
5026 | s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 1, DELIMITERS))); |
|
|
5027 | |
|
|
5028 | case TOK_STRATOM: |
|
|
5029 | x = readstrexp (SCHEME_A_ '|'); |
|
|
5030 | //TODO: haven't checked whether the garbage collector could interfere |
|
|
5031 | s_return (mk_atom (SCHEME_A_ strvalue (x))); |
5173 | |
5032 | |
5174 | case TOK_DQUOTE: |
5033 | case TOK_DQUOTE: |
5175 | x = readstrexp (SCHEME_A); |
5034 | x = readstrexp (SCHEME_A_ '"'); |
5176 | |
5035 | |
5177 | if (x == S_F) |
5036 | if (x == S_F) |
5178 | Error_0 ("Error reading string"); |
5037 | Error_0 ("Error reading string"); |
5179 | |
5038 | |
5180 | setimmutable (x); |
5039 | setimmutable (x); |
… | |
… | |
5192 | s_goto (OP_EVAL); |
5051 | s_goto (OP_EVAL); |
5193 | } |
5052 | } |
5194 | } |
5053 | } |
5195 | |
5054 | |
5196 | case TOK_SHARP_CONST: |
5055 | case TOK_SHARP_CONST: |
5197 | if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))) == NIL) |
5056 | if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS))) == NIL) |
5198 | Error_0 ("undefined sharp expression"); |
5057 | Error_0 ("undefined sharp expression"); |
5199 | else |
5058 | else |
5200 | s_return (x); |
5059 | s_return (x); |
5201 | |
5060 | |
5202 | default: |
5061 | default: |
… | |
… | |
5204 | } |
5063 | } |
5205 | |
5064 | |
5206 | break; |
5065 | break; |
5207 | |
5066 | |
5208 | case OP_RDLIST: |
5067 | case OP_RDLIST: |
5209 | SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); |
5068 | SCHEME_V->args = cons (SCHEME_V->value, args); |
5210 | SCHEME_V->tok = token (SCHEME_A); |
5069 | SCHEME_V->tok = token (SCHEME_A); |
5211 | |
5070 | |
5212 | switch (SCHEME_V->tok) |
5071 | switch (SCHEME_V->tok) |
5213 | { |
5072 | { |
5214 | case TOK_EOF: |
5073 | case TOK_EOF: |
… | |
… | |
5242 | case OP_RDDOT: |
5101 | case OP_RDDOT: |
5243 | if (token (SCHEME_A) != TOK_RPAREN) |
5102 | if (token (SCHEME_A) != TOK_RPAREN) |
5244 | Error_0 ("syntax error: illegal dot expression"); |
5103 | Error_0 ("syntax error: illegal dot expression"); |
5245 | |
5104 | |
5246 | SCHEME_V->nesting_stack[SCHEME_V->file_i]--; |
5105 | SCHEME_V->nesting_stack[SCHEME_V->file_i]--; |
5247 | s_return (reverse_in_place (SCHEME_A_ SCHEME_V->value, SCHEME_V->args)); |
5106 | s_return (reverse_in_place (SCHEME_A_ SCHEME_V->value, args)); |
5248 | |
5107 | |
5249 | case OP_RDQUOTE: |
5108 | case OP_RDQUOTE: |
5250 | s_return (cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL))); |
5109 | s_return (cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL))); |
5251 | |
5110 | |
5252 | case OP_RDQQUOTE: |
5111 | case OP_RDQQUOTE: |
… | |
… | |
5274 | SCHEME_V->args = SCHEME_V->value; |
5133 | SCHEME_V->args = SCHEME_V->value; |
5275 | s_goto (OP_VECTOR); |
5134 | s_goto (OP_VECTOR); |
5276 | |
5135 | |
5277 | /* ========== printing part ========== */ |
5136 | /* ========== printing part ========== */ |
5278 | case OP_P0LIST: |
5137 | case OP_P0LIST: |
5279 | if (is_vector (SCHEME_V->args)) |
5138 | if (is_vector (args)) |
5280 | { |
5139 | { |
5281 | putstr (SCHEME_A_ "#("); |
5140 | putstr (SCHEME_A_ "#("); |
5282 | SCHEME_V->args = cons (SCHEME_V->args, mk_integer (SCHEME_A_ 0)); |
5141 | SCHEME_V->args = cons (args, mk_integer (SCHEME_A_ 0)); |
5283 | s_goto (OP_PVECFROM); |
5142 | s_goto (OP_PVECFROM); |
5284 | } |
5143 | } |
5285 | else if (is_environment (SCHEME_V->args)) |
5144 | else if (is_environment (args)) |
5286 | { |
5145 | { |
5287 | putstr (SCHEME_A_ "#<ENVIRONMENT>"); |
5146 | putstr (SCHEME_A_ "#<ENVIRONMENT>"); |
5288 | s_return (S_T); |
5147 | s_return (S_T); |
5289 | } |
5148 | } |
5290 | else if (!is_pair (SCHEME_V->args)) |
5149 | else if (!is_pair (args)) |
5291 | { |
5150 | { |
5292 | printatom (SCHEME_A_ SCHEME_V->args, SCHEME_V->print_flag); |
5151 | printatom (SCHEME_A_ args, SCHEME_V->print_flag); |
5293 | s_return (S_T); |
5152 | s_return (S_T); |
5294 | } |
5153 | } |
5295 | else if (car (SCHEME_V->args) == SCHEME_V->QUOTE && ok_abbrev (cdr (SCHEME_V->args))) |
5154 | else |
5296 | { |
5155 | { |
|
|
5156 | pointer a = car (args); |
|
|
5157 | pointer b = cdr (args); |
|
|
5158 | int ok_abbr = ok_abbrev (b); |
|
|
5159 | SCHEME_V->args = car (b); |
|
|
5160 | |
|
|
5161 | if (a == SCHEME_V->QUOTE && ok_abbr) |
5297 | putstr (SCHEME_A_ "'"); |
5162 | putstr (SCHEME_A_ "'"); |
5298 | SCHEME_V->args = cadr (SCHEME_V->args); |
5163 | else if (a == SCHEME_V->QQUOTE && ok_abbr) |
|
|
5164 | putstr (SCHEME_A_ "`"); |
|
|
5165 | else if (a == SCHEME_V->UNQUOTE && ok_abbr) |
|
|
5166 | putstr (SCHEME_A_ ","); |
|
|
5167 | else if (a == SCHEME_V->UNQUOTESP && ok_abbr) |
|
|
5168 | putstr (SCHEME_A_ ",@"); |
|
|
5169 | else |
|
|
5170 | { |
|
|
5171 | putstr (SCHEME_A_ "("); |
|
|
5172 | s_save (SCHEME_A_ OP_P1LIST, b, NIL); |
|
|
5173 | SCHEME_V->args = a; |
|
|
5174 | } |
|
|
5175 | |
5299 | s_goto (OP_P0LIST); |
5176 | s_goto (OP_P0LIST); |
5300 | } |
5177 | } |
5301 | else if (car (SCHEME_V->args) == SCHEME_V->QQUOTE && ok_abbrev (cdr (SCHEME_V->args))) |
5178 | |
|
|
5179 | case OP_P1LIST: |
|
|
5180 | if (is_pair (args)) |
5302 | { |
5181 | { |
|
|
5182 | s_save (SCHEME_A_ OP_P1LIST, cdr (args), NIL); |
5303 | putstr (SCHEME_A_ "`"); |
5183 | putstr (SCHEME_A_ " "); |
5304 | SCHEME_V->args = cadr (SCHEME_V->args); |
5184 | SCHEME_V->args = car (args); |
5305 | s_goto (OP_P0LIST); |
5185 | s_goto (OP_P0LIST); |
5306 | } |
5186 | } |
5307 | else if (car (SCHEME_V->args) == SCHEME_V->UNQUOTE && ok_abbrev (cdr (SCHEME_V->args))) |
|
|
5308 | { |
|
|
5309 | putstr (SCHEME_A_ ","); |
|
|
5310 | SCHEME_V->args = cadr (SCHEME_V->args); |
|
|
5311 | s_goto (OP_P0LIST); |
|
|
5312 | } |
|
|
5313 | else if (car (SCHEME_V->args) == SCHEME_V->UNQUOTESP && ok_abbrev (cdr (SCHEME_V->args))) |
|
|
5314 | { |
|
|
5315 | putstr (SCHEME_A_ ",@"); |
|
|
5316 | SCHEME_V->args = cadr (SCHEME_V->args); |
|
|
5317 | s_goto (OP_P0LIST); |
|
|
5318 | } |
|
|
5319 | else |
|
|
5320 | { |
|
|
5321 | putstr (SCHEME_A_ "("); |
|
|
5322 | s_save (SCHEME_A_ OP_P1LIST, cdr (SCHEME_V->args), NIL); |
|
|
5323 | SCHEME_V->args = car (SCHEME_V->args); |
|
|
5324 | s_goto (OP_P0LIST); |
|
|
5325 | } |
|
|
5326 | |
|
|
5327 | case OP_P1LIST: |
|
|
5328 | if (is_pair (SCHEME_V->args)) |
|
|
5329 | { |
|
|
5330 | s_save (SCHEME_A_ OP_P1LIST, cdr (SCHEME_V->args), NIL); |
|
|
5331 | putstr (SCHEME_A_ " "); |
|
|
5332 | SCHEME_V->args = car (SCHEME_V->args); |
|
|
5333 | s_goto (OP_P0LIST); |
|
|
5334 | } |
|
|
5335 | else if (is_vector (SCHEME_V->args)) |
5187 | else if (is_vector (args)) |
5336 | { |
5188 | { |
5337 | s_save (SCHEME_A_ OP_P1LIST, NIL, NIL); |
5189 | s_save (SCHEME_A_ OP_P1LIST, NIL, NIL); |
5338 | putstr (SCHEME_A_ " . "); |
5190 | putstr (SCHEME_A_ " . "); |
5339 | s_goto (OP_P0LIST); |
5191 | s_goto (OP_P0LIST); |
5340 | } |
5192 | } |
5341 | else |
5193 | else |
5342 | { |
5194 | { |
5343 | if (SCHEME_V->args != NIL) |
5195 | if (args != NIL) |
5344 | { |
5196 | { |
5345 | putstr (SCHEME_A_ " . "); |
5197 | putstr (SCHEME_A_ " . "); |
5346 | printatom (SCHEME_A_ SCHEME_V->args, SCHEME_V->print_flag); |
5198 | printatom (SCHEME_A_ args, SCHEME_V->print_flag); |
5347 | } |
5199 | } |
5348 | |
5200 | |
5349 | putstr (SCHEME_A_ ")"); |
5201 | putstr (SCHEME_A_ ")"); |
5350 | s_return (S_T); |
5202 | s_return (S_T); |
5351 | } |
5203 | } |
5352 | |
5204 | |
5353 | case OP_PVECFROM: |
5205 | case OP_PVECFROM: |
5354 | { |
5206 | { |
5355 | int i = ivalue_unchecked (cdr (SCHEME_V->args)); |
5207 | int i = ivalue_unchecked (cdr (args)); |
5356 | pointer vec = car (SCHEME_V->args); |
5208 | pointer vec = car (args); |
5357 | int len = veclength (vec); |
5209 | int len = veclength (vec); |
5358 | |
5210 | |
5359 | if (i == len) |
5211 | if (i == len) |
5360 | { |
5212 | { |
5361 | putstr (SCHEME_A_ ")"); |
5213 | putstr (SCHEME_A_ ")"); |
5362 | s_return (S_T); |
5214 | s_return (S_T); |
5363 | } |
5215 | } |
5364 | else |
5216 | else |
5365 | { |
5217 | { |
5366 | pointer elem = vector_elem (vec, i); |
5218 | pointer elem = vector_get (vec, i); |
5367 | |
5219 | |
5368 | ivalue_unchecked (cdr (SCHEME_V->args)) = i + 1; |
5220 | ivalue_unchecked (cdr (args)) = i + 1; |
5369 | s_save (SCHEME_A_ OP_PVECFROM, SCHEME_V->args, NIL); |
5221 | s_save (SCHEME_A_ OP_PVECFROM, args, NIL); |
5370 | SCHEME_V->args = elem; |
5222 | SCHEME_V->args = elem; |
5371 | |
5223 | |
5372 | if (i > 0) |
5224 | if (i > 0) |
5373 | putstr (SCHEME_A_ " "); |
5225 | putstr (SCHEME_A_ " "); |
5374 | |
5226 | |
5375 | s_goto (OP_P0LIST); |
5227 | s_goto (OP_P0LIST); |
5376 | } |
5228 | } |
5377 | } |
5229 | } |
5378 | } |
5230 | } |
5379 | |
5231 | |
5380 | return S_T; |
5232 | if (USE_ERROR_CHECKING) abort (); |
5381 | } |
5233 | } |
5382 | |
5234 | |
5383 | static pointer |
5235 | static int |
5384 | opexe_6 (SCHEME_P_ enum scheme_opcodes op) |
5236 | opexe_6 (SCHEME_P_ enum scheme_opcodes op) |
5385 | { |
5237 | { |
|
|
5238 | pointer args = SCHEME_V->args; |
|
|
5239 | pointer a = car (args); |
5386 | pointer x, y; |
5240 | pointer x, y; |
5387 | |
5241 | |
5388 | switch (op) |
5242 | switch (op) |
5389 | { |
5243 | { |
5390 | case OP_LIST_LENGTH: /* length *//* a.k */ |
5244 | case OP_LIST_LENGTH: /* length *//* a.k */ |
5391 | { |
5245 | { |
5392 | long v = list_length (SCHEME_A_ car (SCHEME_V->args)); |
5246 | long v = list_length (SCHEME_A_ a); |
5393 | |
5247 | |
5394 | if (v < 0) |
5248 | if (v < 0) |
5395 | Error_1 ("length: not a list:", car (SCHEME_V->args)); |
5249 | Error_1 ("length: not a list:", a); |
5396 | |
5250 | |
5397 | s_return (mk_integer (SCHEME_A_ v)); |
5251 | s_return (mk_integer (SCHEME_A_ v)); |
5398 | } |
5252 | } |
5399 | |
5253 | |
5400 | case OP_ASSQ: /* assq *//* a.k */ |
5254 | case OP_ASSQ: /* assq *//* a.k */ |
5401 | x = car (SCHEME_V->args); |
5255 | x = a; |
5402 | |
5256 | |
5403 | for (y = cadr (SCHEME_V->args); is_pair (y); y = cdr (y)) |
5257 | for (y = cadr (args); is_pair (y); y = cdr (y)) |
5404 | { |
5258 | { |
5405 | if (!is_pair (car (y))) |
5259 | if (!is_pair (car (y))) |
5406 | Error_0 ("unable to handle non pair element"); |
5260 | Error_0 ("unable to handle non pair element"); |
5407 | |
5261 | |
5408 | if (x == caar (y)) |
5262 | if (x == caar (y)) |
… | |
… | |
5414 | else |
5268 | else |
5415 | s_return (S_F); |
5269 | s_return (S_F); |
5416 | |
5270 | |
5417 | |
5271 | |
5418 | case OP_GET_CLOSURE: /* get-closure-code *//* a.k */ |
5272 | case OP_GET_CLOSURE: /* get-closure-code *//* a.k */ |
5419 | SCHEME_V->args = car (SCHEME_V->args); |
5273 | SCHEME_V->args = a; |
5420 | |
5274 | |
5421 | if (SCHEME_V->args == NIL) |
5275 | if (SCHEME_V->args == NIL) |
5422 | s_return (S_F); |
5276 | s_return (S_F); |
5423 | else if (is_closure (SCHEME_V->args)) |
5277 | else if (is_closure (SCHEME_V->args)) |
5424 | s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value))); |
5278 | s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value))); |
… | |
… | |
5429 | |
5283 | |
5430 | case OP_CLOSUREP: /* closure? */ |
5284 | case OP_CLOSUREP: /* closure? */ |
5431 | /* |
5285 | /* |
5432 | * Note, macro object is also a closure. |
5286 | * Note, macro object is also a closure. |
5433 | * Therefore, (closure? <#MACRO>) ==> #t |
5287 | * Therefore, (closure? <#MACRO>) ==> #t |
|
|
5288 | * (schmorp) well, obviously not, fix? TODO |
5434 | */ |
5289 | */ |
5435 | s_retbool (is_closure (car (SCHEME_V->args))); |
5290 | s_retbool (is_closure (a)); |
5436 | |
5291 | |
5437 | case OP_MACROP: /* macro? */ |
5292 | case OP_MACROP: /* macro? */ |
5438 | s_retbool (is_macro (car (SCHEME_V->args))); |
5293 | s_retbool (is_macro (a)); |
5439 | } |
5294 | } |
5440 | |
5295 | |
5441 | return S_T; /* NOTREACHED */ |
5296 | if (USE_ERROR_CHECKING) abort (); |
5442 | } |
5297 | } |
5443 | |
5298 | |
|
|
5299 | /* dispatch functions (opexe_x) return new opcode, or 0 for same opcode, or -1 to stop */ |
5444 | typedef pointer (*dispatch_func) (SCHEME_P_ enum scheme_opcodes); |
5300 | typedef int (*dispatch_func)(SCHEME_P_ enum scheme_opcodes); |
5445 | |
5301 | |
5446 | typedef int (*test_predicate) (pointer); |
5302 | typedef int (*test_predicate)(pointer); |
5447 | static int |
5303 | static int |
5448 | is_any (pointer p) |
5304 | tst_any (pointer p) |
5449 | { |
5305 | { |
5450 | return 1; |
5306 | return 1; |
5451 | } |
5307 | } |
5452 | |
5308 | |
5453 | static int |
5309 | static int |
5454 | is_nonneg (pointer p) |
5310 | tst_inonneg (pointer p) |
5455 | { |
5311 | { |
5456 | return ivalue (p) >= 0 && is_integer (p); |
5312 | return is_integer (p) && ivalue_unchecked (p) >= 0; |
|
|
5313 | } |
|
|
5314 | |
|
|
5315 | static int |
|
|
5316 | tst_is_list (SCHEME_P_ pointer p) |
|
|
5317 | { |
|
|
5318 | return p == NIL || is_pair (p); |
5457 | } |
5319 | } |
5458 | |
5320 | |
5459 | /* Correspond carefully with following defines! */ |
5321 | /* Correspond carefully with following defines! */ |
5460 | static struct |
5322 | static struct |
5461 | { |
5323 | { |
5462 | test_predicate fct; |
5324 | test_predicate fct; |
5463 | const char *kind; |
5325 | const char *kind; |
5464 | } tests[] = |
5326 | } tests[] = { |
5465 | { |
5327 | { tst_any , 0 }, |
5466 | { 0, 0}, /* unused */ |
5328 | { is_string , "string" }, |
5467 | { is_any, 0}, |
5329 | { is_symbol , "symbol" }, |
5468 | { is_string, "string" }, |
5330 | { is_port , "port" }, |
5469 | { is_symbol, "symbol" }, |
|
|
5470 | { is_port, "port" }, |
|
|
5471 | { is_inport, "input port" }, |
5331 | { is_inport , "input port" }, |
5472 | { is_outport, "output port" }, |
5332 | { is_outport , "output port" }, |
5473 | { is_environment, "environment" }, |
5333 | { is_environment, "environment" }, |
5474 | { is_pair, "pair" }, |
5334 | { is_pair , "pair" }, |
5475 | { 0, "pair or '()" }, |
5335 | { 0 , "pair or '()" }, |
5476 | { is_character, "character" }, |
5336 | { is_character , "character" }, |
5477 | { is_vector, "vector" }, |
5337 | { is_vector , "vector" }, |
5478 | { is_number, "number" }, |
5338 | { is_number , "number" }, |
5479 | { is_integer, "integer" }, |
5339 | { is_integer , "integer" }, |
5480 | { is_nonneg, "non-negative integer" } |
5340 | { tst_inonneg , "non-negative integer" } |
5481 | }; |
5341 | }; |
5482 | |
5342 | |
5483 | #define TST_NONE 0 |
5343 | #define TST_NONE 0 /* TST_NONE used for built-ins, 0 for internal ops */ |
5484 | #define TST_ANY "\001" |
5344 | #define TST_ANY "\001" |
5485 | #define TST_STRING "\002" |
5345 | #define TST_STRING "\002" |
5486 | #define TST_SYMBOL "\003" |
5346 | #define TST_SYMBOL "\003" |
5487 | #define TST_PORT "\004" |
5347 | #define TST_PORT "\004" |
5488 | #define TST_INPORT "\005" |
5348 | #define TST_INPORT "\005" |
5489 | #define TST_OUTPORT "\006" |
5349 | #define TST_OUTPORT "\006" |
5490 | #define TST_ENVIRONMENT "\007" |
5350 | #define TST_ENVIRONMENT "\007" |
5491 | #define TST_PAIR "\010" |
5351 | #define TST_PAIR "\010" |
5492 | #define TST_LIST "\011" |
5352 | #define TST_LIST "\011" |
5493 | #define TST_CHAR "\012" |
5353 | #define TST_CHAR "\012" |
5494 | #define TST_VECTOR "\013" |
5354 | #define TST_VECTOR "\013" |
5495 | #define TST_NUMBER "\014" |
5355 | #define TST_NUMBER "\014" |
5496 | #define TST_INTEGER "\015" |
5356 | #define TST_INTEGER "\015" |
5497 | #define TST_NATURAL "\016" |
5357 | #define TST_NATURAL "\016" |
|
|
5358 | |
|
|
5359 | #define INF_ARG 0xff |
|
|
5360 | #define UNNAMED_OP "" |
|
|
5361 | |
|
|
5362 | static const char opnames[] = |
|
|
5363 | #define OP_DEF(func,name,minarity,maxarity,argtest,op) name "\x00" |
|
|
5364 | #include "opdefines.h" |
|
|
5365 | #undef OP_DEF |
|
|
5366 | ; |
|
|
5367 | |
|
|
5368 | static const char * |
|
|
5369 | opname (int idx) |
|
|
5370 | { |
|
|
5371 | const char *name = opnames; |
|
|
5372 | |
|
|
5373 | /* should do this at compile time, but would require external program, right? */ |
|
|
5374 | while (idx--) |
|
|
5375 | name += strlen (name) + 1; |
|
|
5376 | |
|
|
5377 | return *name ? name : "ILLEGAL"; |
|
|
5378 | } |
|
|
5379 | |
|
|
5380 | static const char * |
|
|
5381 | procname (pointer x) |
|
|
5382 | { |
|
|
5383 | return opname (procnum (x)); |
|
|
5384 | } |
5498 | |
5385 | |
5499 | typedef struct |
5386 | typedef struct |
5500 | { |
5387 | { |
5501 | dispatch_func func; |
5388 | uint8_t func; |
5502 | char *name; |
5389 | /*dispatch_func func;*//*TODO: maybe optionally keep the pointer, for speed? */ |
|
|
5390 | uint8_t builtin; |
|
|
5391 | #if USE_ERROR_CHECKING |
5503 | int min_arity; |
5392 | uint8_t min_arity; |
5504 | int max_arity; |
5393 | uint8_t max_arity; |
5505 | char *arg_tests_encoding; |
5394 | char arg_tests_encoding[3]; |
|
|
5395 | #endif |
5506 | } op_code_info; |
5396 | } op_code_info; |
5507 | |
5397 | |
5508 | #define INF_ARG 0xffff |
|
|
5509 | |
|
|
5510 | static op_code_info dispatch_table[] = { |
5398 | static const op_code_info dispatch_table[] = { |
5511 | #define OP_DEF(A,B,C,D,E,OP) {A,B,C,D,E}, |
5399 | #if USE_ERROR_CHECKING |
|
|
5400 | #define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1, minarity, maxarity, argtest }, |
|
|
5401 | #else |
|
|
5402 | #define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1 }, |
|
|
5403 | #endif |
5512 | #include "opdefines.h" |
5404 | #include "opdefines.h" |
|
|
5405 | #undef OP_DEF |
5513 | {0} |
5406 | {0} |
5514 | }; |
5407 | }; |
5515 | |
5408 | |
5516 | static const char * |
|
|
5517 | procname (pointer x) |
|
|
5518 | { |
|
|
5519 | int n = procnum (x); |
|
|
5520 | const char *name = dispatch_table[n].name; |
|
|
5521 | |
|
|
5522 | if (name == 0) |
|
|
5523 | name = "ILLEGAL!"; |
|
|
5524 | |
|
|
5525 | return name; |
|
|
5526 | } |
|
|
5527 | |
|
|
5528 | /* kernel of this interpreter */ |
5409 | /* kernel of this interpreter */ |
5529 | static void |
5410 | static void ecb_hot |
5530 | Eval_Cycle (SCHEME_P_ enum scheme_opcodes op) |
5411 | Eval_Cycle (SCHEME_P_ enum scheme_opcodes op) |
5531 | { |
5412 | { |
5532 | SCHEME_V->op = op; |
5413 | SCHEME_V->op = op; |
5533 | |
5414 | |
5534 | for (;;) |
5415 | for (;;) |
5535 | { |
5416 | { |
5536 | op_code_info *pcd = dispatch_table + SCHEME_V->op; |
5417 | const op_code_info *pcd = dispatch_table + SCHEME_V->op; |
5537 | |
5418 | |
5538 | #if USE_ERROR_CHECKING |
5419 | #if USE_ERROR_CHECKING |
5539 | if (pcd->name) /* if built-in function, check arguments */ |
5420 | if (pcd->builtin) /* if built-in function, check arguments */ |
5540 | { |
5421 | { |
5541 | int ok = 1; |
|
|
5542 | char msg[STRBUFFSIZE]; |
5422 | char msg[STRBUFFSIZE]; |
5543 | int n = list_length (SCHEME_A_ SCHEME_V->args); |
5423 | int n = list_length (SCHEME_A_ SCHEME_V->args); |
5544 | |
5424 | |
5545 | /* Check number of arguments */ |
5425 | /* Check number of arguments */ |
5546 | if (n < pcd->min_arity) |
5426 | if (ecb_expect_false (n < pcd->min_arity)) |
5547 | { |
5427 | { |
5548 | ok = 0; |
|
|
5549 | snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", |
5428 | snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", |
5550 | pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity); |
5429 | opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity); |
|
|
5430 | xError_1 (SCHEME_A_ msg, 0); |
|
|
5431 | continue; |
5551 | } |
5432 | } |
5552 | |
5433 | else if (ecb_expect_false (n > pcd->max_arity && pcd->max_arity != INF_ARG)) |
5553 | if (ok && n > pcd->max_arity) |
|
|
5554 | { |
5434 | { |
5555 | ok = 0; |
|
|
5556 | snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", |
5435 | snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", |
5557 | pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity); |
5436 | opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity); |
|
|
5437 | xError_1 (SCHEME_A_ msg, 0); |
|
|
5438 | continue; |
5558 | } |
5439 | } |
5559 | |
5440 | else |
5560 | if (ok) |
|
|
5561 | { |
5441 | { |
5562 | if (pcd->arg_tests_encoding) |
5442 | if (*pcd->arg_tests_encoding) /* literal 0 and TST_NONE treated the same */ |
5563 | { |
5443 | { |
5564 | int i = 0; |
5444 | int i = 0; |
5565 | int j; |
5445 | int j; |
5566 | const char *t = pcd->arg_tests_encoding; |
5446 | const char *t = pcd->arg_tests_encoding; |
5567 | pointer arglist = SCHEME_V->args; |
5447 | pointer arglist = SCHEME_V->args; |
5568 | |
5448 | |
5569 | do |
5449 | do |
5570 | { |
5450 | { |
5571 | pointer arg = car (arglist); |
5451 | pointer arg = car (arglist); |
5572 | |
5452 | |
5573 | j = (int) t[0]; |
5453 | j = t[0]; |
5574 | |
5454 | |
|
|
5455 | /*TODO: tst_is_list has different prototype - fix if other tests acquire same prototype */ |
5575 | if (j == TST_LIST[0]) |
5456 | if (j == TST_LIST[0]) |
5576 | { |
5457 | { |
5577 | if (arg != NIL && !is_pair (arg)) |
5458 | if (!tst_is_list (SCHEME_A_ arg)) |
5578 | break; |
5459 | break; |
5579 | } |
5460 | } |
5580 | else |
5461 | else |
5581 | { |
5462 | { |
5582 | if (!tests[j].fct (arg)) |
5463 | if (!tests[j - 1].fct (arg)) |
5583 | break; |
5464 | break; |
5584 | } |
5465 | } |
5585 | |
5466 | |
5586 | if (t[1] != 0) /* last test is replicated as necessary */ |
5467 | if (t < pcd->arg_tests_encoding + sizeof (pcd->arg_tests_encoding) - 1 && t[1]) /* last test is replicated as necessary */ |
5587 | t++; |
5468 | t++; |
5588 | |
5469 | |
5589 | arglist = cdr (arglist); |
5470 | arglist = cdr (arglist); |
5590 | i++; |
5471 | i++; |
5591 | } |
5472 | } |
5592 | while (i < n); |
5473 | while (i < n); |
5593 | |
5474 | |
5594 | if (i < n) |
5475 | if (i < n) |
5595 | { |
5476 | { |
5596 | ok = 0; |
|
|
5597 | snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", pcd->name, i + 1, tests[j].kind); |
5477 | snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", opname (SCHEME_V->op), i + 1, tests[j].kind); |
|
|
5478 | xError_1 (SCHEME_A_ msg, 0); |
|
|
5479 | continue; |
5598 | } |
5480 | } |
5599 | } |
5481 | } |
5600 | } |
5482 | } |
5601 | |
|
|
5602 | if (!ok) |
|
|
5603 | { |
|
|
5604 | if (xError_1 (SCHEME_A_ msg, 0) == NIL) |
|
|
5605 | return; |
|
|
5606 | |
|
|
5607 | pcd = dispatch_table + SCHEME_V->op; |
|
|
5608 | } |
|
|
5609 | } |
5483 | } |
5610 | #endif |
5484 | #endif |
5611 | |
5485 | |
5612 | ok_to_freely_gc (SCHEME_A); |
5486 | ok_to_freely_gc (SCHEME_A); |
5613 | |
5487 | |
5614 | if (pcd->func (SCHEME_A_ SCHEME_V->op) == NIL) |
5488 | static const dispatch_func dispatch_funcs[] = { |
|
|
5489 | opexe_0, |
|
|
5490 | opexe_1, |
|
|
5491 | opexe_2, |
|
|
5492 | opexe_3, |
|
|
5493 | opexe_4, |
|
|
5494 | opexe_5, |
|
|
5495 | opexe_6, |
|
|
5496 | }; |
|
|
5497 | |
|
|
5498 | if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0)) |
5615 | return; |
5499 | return; |
5616 | |
5500 | |
5617 | if (SCHEME_V->no_memory && USE_ERROR_CHECKING) |
5501 | if (SCHEME_V->no_memory && USE_ERROR_CHECKING) |
5618 | { |
5502 | { |
5619 | xwrstr ("No memory!\n"); |
5503 | putstr (SCHEME_A_ "No memory!\n"); |
5620 | return; |
5504 | return; |
5621 | } |
5505 | } |
5622 | } |
5506 | } |
5623 | } |
5507 | } |
5624 | |
5508 | |
… | |
… | |
5643 | mk_proc (SCHEME_P_ enum scheme_opcodes op) |
5527 | mk_proc (SCHEME_P_ enum scheme_opcodes op) |
5644 | { |
5528 | { |
5645 | pointer y = get_cell (SCHEME_A_ NIL, NIL); |
5529 | pointer y = get_cell (SCHEME_A_ NIL, NIL); |
5646 | set_typeflag (y, (T_PROC | T_ATOM)); |
5530 | set_typeflag (y, (T_PROC | T_ATOM)); |
5647 | ivalue_unchecked (y) = op; |
5531 | ivalue_unchecked (y) = op; |
5648 | set_num_integer (y); |
|
|
5649 | return y; |
5532 | return y; |
5650 | } |
5533 | } |
5651 | |
5534 | |
5652 | /* Hard-coded for the given keywords. Remember to rewrite if more are added! */ |
5535 | /* Hard-coded for the given keywords. Remember to rewrite if more are added! */ |
5653 | static int |
5536 | static int |
5654 | syntaxnum (pointer p) |
5537 | syntaxnum (pointer p) |
5655 | { |
5538 | { |
5656 | const char *s = strvalue (car (p)); |
5539 | const char *s = strvalue (p); |
5657 | |
5540 | |
5658 | switch (strlength (car (p))) |
5541 | switch (strlength (p)) |
5659 | { |
5542 | { |
5660 | case 2: |
5543 | case 2: |
5661 | if (s[0] == 'i') |
5544 | if (s[0] == 'i') |
5662 | return OP_IF0; /* if */ |
5545 | return OP_IF0; /* if */ |
5663 | else |
5546 | else |
… | |
… | |
5677 | |
5560 | |
5678 | case 'd': |
5561 | case 'd': |
5679 | return OP_COND0; /* cond */ |
5562 | return OP_COND0; /* cond */ |
5680 | |
5563 | |
5681 | case '*': |
5564 | case '*': |
5682 | return OP_LET0AST; /* let* */ |
5565 | return OP_LET0AST;/* let* */ |
5683 | |
5566 | |
5684 | default: |
5567 | default: |
5685 | return OP_SET0; /* set! */ |
5568 | return OP_SET0; /* set! */ |
5686 | } |
5569 | } |
5687 | |
5570 | |
… | |
… | |
5709 | |
5592 | |
5710 | case 'f': |
5593 | case 'f': |
5711 | return OP_DEF0; /* define */ |
5594 | return OP_DEF0; /* define */ |
5712 | |
5595 | |
5713 | default: |
5596 | default: |
5714 | return OP_LET0REC; /* letrec */ |
5597 | return OP_LET0REC;/* letrec */ |
5715 | } |
5598 | } |
5716 | |
5599 | |
5717 | default: |
5600 | default: |
5718 | return OP_C0STREAM; /* cons-stream */ |
5601 | return OP_C0STREAM; /* cons-stream */ |
5719 | } |
5602 | } |
5720 | } |
5603 | } |
5721 | |
5604 | |
5722 | #if USE_MULTIPLICITY |
5605 | #if USE_MULTIPLICITY |
5723 | scheme * |
5606 | ecb_cold scheme * |
5724 | scheme_init_new () |
5607 | scheme_init_new () |
5725 | { |
5608 | { |
5726 | scheme *sc = malloc (sizeof (scheme)); |
5609 | scheme *sc = malloc (sizeof (scheme)); |
5727 | |
5610 | |
5728 | if (!scheme_init (SCHEME_A)) |
5611 | if (!scheme_init (SCHEME_A)) |
… | |
… | |
5733 | else |
5616 | else |
5734 | return sc; |
5617 | return sc; |
5735 | } |
5618 | } |
5736 | #endif |
5619 | #endif |
5737 | |
5620 | |
5738 | int |
5621 | ecb_cold int |
5739 | scheme_init (SCHEME_P) |
5622 | scheme_init (SCHEME_P) |
5740 | { |
5623 | { |
5741 | int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]); |
5624 | int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]); |
5742 | pointer x; |
5625 | pointer x; |
|
|
5626 | |
|
|
5627 | /* this memset is not strictly correct, as we assume (intcache) |
|
|
5628 | * that memset 0 will also set pointers to 0, but memset does |
|
|
5629 | * of course not guarantee that. screw such systems. |
|
|
5630 | */ |
|
|
5631 | memset (SCHEME_V, 0, sizeof (*SCHEME_V)); |
5743 | |
5632 | |
5744 | num_set_fixnum (num_zero, 1); |
5633 | num_set_fixnum (num_zero, 1); |
5745 | num_set_ivalue (num_zero, 0); |
5634 | num_set_ivalue (num_zero, 0); |
5746 | num_set_fixnum (num_one, 1); |
5635 | num_set_fixnum (num_one, 1); |
5747 | num_set_ivalue (num_one, 1); |
5636 | num_set_ivalue (num_one, 1); |
… | |
… | |
5759 | SCHEME_V->save_inport = NIL; |
5648 | SCHEME_V->save_inport = NIL; |
5760 | SCHEME_V->loadport = NIL; |
5649 | SCHEME_V->loadport = NIL; |
5761 | SCHEME_V->nesting = 0; |
5650 | SCHEME_V->nesting = 0; |
5762 | SCHEME_V->interactive_repl = 0; |
5651 | SCHEME_V->interactive_repl = 0; |
5763 | |
5652 | |
5764 | if (alloc_cellseg (SCHEME_A_ FIRST_CELLSEGS) != FIRST_CELLSEGS) |
5653 | if (!alloc_cellseg (SCHEME_A)) |
5765 | { |
5654 | { |
5766 | #if USE_ERROR_CHECKING |
5655 | #if USE_ERROR_CHECKING |
5767 | SCHEME_V->no_memory = 1; |
5656 | SCHEME_V->no_memory = 1; |
5768 | return 0; |
5657 | return 0; |
5769 | #endif |
5658 | #endif |
… | |
… | |
5816 | |
5705 | |
5817 | for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i) |
5706 | for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i) |
5818 | assign_syntax (SCHEME_A_ syntax_names[i]); |
5707 | assign_syntax (SCHEME_A_ syntax_names[i]); |
5819 | } |
5708 | } |
5820 | |
5709 | |
|
|
5710 | // TODO: should iterate via strlen, to avoid n² complexity |
5821 | for (i = 0; i < n; i++) |
5711 | for (i = 0; i < n; i++) |
5822 | if (dispatch_table[i].name != 0) |
5712 | if (dispatch_table[i].builtin) |
5823 | assign_proc (SCHEME_A_ i, dispatch_table[i].name); |
5713 | assign_proc (SCHEME_A_ i, opname (i)); |
5824 | |
5714 | |
5825 | /* initialization of global pointers to special symbols */ |
5715 | /* initialization of global pointers to special symbols */ |
5826 | SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda"); |
5716 | SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda"); |
5827 | SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote"); |
5717 | SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote"); |
5828 | SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote"); |
5718 | SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote"); |
… | |
… | |
5867 | scheme_set_external_data (SCHEME_P_ void *p) |
5757 | scheme_set_external_data (SCHEME_P_ void *p) |
5868 | { |
5758 | { |
5869 | SCHEME_V->ext_data = p; |
5759 | SCHEME_V->ext_data = p; |
5870 | } |
5760 | } |
5871 | |
5761 | |
5872 | void |
5762 | ecb_cold void |
5873 | scheme_deinit (SCHEME_P) |
5763 | scheme_deinit (SCHEME_P) |
5874 | { |
5764 | { |
5875 | int i; |
5765 | int i; |
5876 | |
5766 | |
5877 | #if SHOW_ERROR_LINE |
5767 | #if SHOW_ERROR_LINE |
… | |
… | |
5969 | { |
5859 | { |
5970 | dump_stack_reset (SCHEME_A); |
5860 | dump_stack_reset (SCHEME_A); |
5971 | SCHEME_V->envir = SCHEME_V->global_env; |
5861 | SCHEME_V->envir = SCHEME_V->global_env; |
5972 | SCHEME_V->file_i = 0; |
5862 | SCHEME_V->file_i = 0; |
5973 | SCHEME_V->load_stack[0].kind = port_input | port_string; |
5863 | SCHEME_V->load_stack[0].kind = port_input | port_string; |
5974 | SCHEME_V->load_stack[0].rep.string.start = (char *) cmd; /* This func respects const */ |
5864 | SCHEME_V->load_stack[0].rep.string.start = (char *)cmd; /* This func respects const */ |
5975 | SCHEME_V->load_stack[0].rep.string.past_the_end = (char *) cmd + strlen (cmd); |
5865 | SCHEME_V->load_stack[0].rep.string.past_the_end = (char *)cmd + strlen (cmd); |
5976 | SCHEME_V->load_stack[0].rep.string.curr = (char *) cmd; |
5866 | SCHEME_V->load_stack[0].rep.string.curr = (char *)cmd; |
5977 | #if USE_PORTS |
5867 | #if USE_PORTS |
5978 | SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack); |
5868 | SCHEME_V->loadport = mk_port (SCHEME_A_ SCHEME_V->load_stack); |
5979 | #endif |
5869 | #endif |
5980 | SCHEME_V->retcode = 0; |
5870 | SCHEME_V->retcode = 0; |
5981 | SCHEME_V->interactive_repl = 0; |
5871 | SCHEME_V->interactive_repl = 0; |
… | |
… | |
6098 | # endif |
5988 | # endif |
6099 | int fin; |
5989 | int fin; |
6100 | char *file_name = InitFile; |
5990 | char *file_name = InitFile; |
6101 | int retcode; |
5991 | int retcode; |
6102 | int isfile = 1; |
5992 | int isfile = 1; |
|
|
5993 | system ("ps v $PPID");//D |
6103 | |
5994 | |
6104 | if (argc == 2 && strcmp (argv[1], "-?") == 0) |
5995 | if (argc == 2 && strcmp (argv[1], "-?") == 0) |
6105 | { |
5996 | { |
6106 | xwrstr ("Usage: tinyscheme -?\n"); |
5997 | putstr (SCHEME_A_ "Usage: tinyscheme -?\n"); |
6107 | xwrstr ("or: tinyscheme [<file1> <file2> ...]\n"); |
5998 | putstr (SCHEME_A_ "or: tinyscheme [<file1> <file2> ...]\n"); |
6108 | xwrstr ("followed by\n"); |
5999 | putstr (SCHEME_A_ "followed by\n"); |
6109 | xwrstr (" -1 <file> [<arg1> <arg2> ...]\n"); |
6000 | putstr (SCHEME_A_ " -1 <file> [<arg1> <arg2> ...]\n"); |
6110 | xwrstr (" -c <Scheme commands> [<arg1> <arg2> ...]\n"); |
6001 | putstr (SCHEME_A_ " -c <Scheme commands> [<arg1> <arg2> ...]\n"); |
6111 | xwrstr ("assuming that the executable is named tinyscheme.\n"); |
6002 | putstr (SCHEME_A_ "assuming that the executable is named tinyscheme.\n"); |
6112 | xwrstr ("Use - as filename for stdin.\n"); |
6003 | putstr (SCHEME_A_ "Use - as filename for stdin.\n"); |
6113 | return 1; |
6004 | return 1; |
6114 | } |
6005 | } |
6115 | |
6006 | |
6116 | if (!scheme_init (SCHEME_A)) |
6007 | if (!scheme_init (SCHEME_A)) |
6117 | { |
6008 | { |
6118 | xwrstr ("Could not initialize!\n"); |
6009 | putstr (SCHEME_A_ "Could not initialize!\n"); |
6119 | return 2; |
6010 | return 2; |
6120 | } |
6011 | } |
6121 | |
6012 | |
6122 | # if USE_PORTS |
6013 | # if USE_PORTS |
6123 | scheme_set_input_port_file (SCHEME_A_ STDIN_FILENO); |
6014 | scheme_set_input_port_file (SCHEME_A_ STDIN_FILENO); |
… | |
… | |
6168 | fin = open (file_name, O_RDONLY); |
6059 | fin = open (file_name, O_RDONLY); |
6169 | #endif |
6060 | #endif |
6170 | |
6061 | |
6171 | if (isfile && fin < 0) |
6062 | if (isfile && fin < 0) |
6172 | { |
6063 | { |
6173 | xwrstr ("Could not open file "); xwrstr (file_name); xwrstr ("\n"); |
6064 | putstr (SCHEME_A_ "Could not open file "); putstr (SCHEME_A_ file_name); putstr (SCHEME_A_ "\n"); |
6174 | } |
6065 | } |
6175 | else |
6066 | else |
6176 | { |
6067 | { |
6177 | if (isfile) |
6068 | if (isfile) |
6178 | scheme_load_named_file (SCHEME_A_ fin, file_name); |
6069 | scheme_load_named_file (SCHEME_A_ fin, file_name); |
… | |
… | |
6182 | #if USE_PORTS |
6073 | #if USE_PORTS |
6183 | if (!isfile || fin != STDIN_FILENO) |
6074 | if (!isfile || fin != STDIN_FILENO) |
6184 | { |
6075 | { |
6185 | if (SCHEME_V->retcode != 0) |
6076 | if (SCHEME_V->retcode != 0) |
6186 | { |
6077 | { |
6187 | xwrstr ("Errors encountered reading "); xwrstr (file_name); xwrstr ("\n"); |
6078 | putstr (SCHEME_A_ "Errors encountered reading "); putstr (SCHEME_A_ file_name); putstr (SCHEME_A_ "\n"); |
6188 | } |
6079 | } |
6189 | |
6080 | |
6190 | if (isfile) |
6081 | if (isfile) |
6191 | close (fin); |
6082 | close (fin); |
6192 | } |
6083 | } |