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