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