… | |
… | |
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 | |
37 | #include <string.h> |
39 | #include <string.h> |
… | |
… | |
65 | #define S_T (&SCHEME_V->xT) //TODO: magic ptr value? |
67 | #define S_T (&SCHEME_V->xT) //TODO: magic ptr value? |
66 | #define S_F (&SCHEME_V->xF) //TODO: magic ptr value? |
68 | #define S_F (&SCHEME_V->xF) //TODO: magic ptr value? |
67 | #define S_SINK (&SCHEME_V->xsink) |
69 | #define S_SINK (&SCHEME_V->xsink) |
68 | #define S_EOF (&SCHEME_V->xEOF_OBJ) |
70 | #define S_EOF (&SCHEME_V->xEOF_OBJ) |
69 | |
71 | |
70 | /* should use libecb */ |
|
|
71 | #if __GNUC__ >= 4 |
|
|
72 | # define ecb_expect(expr,value) __builtin_expect ((expr),(value)) |
|
|
73 | # define ecb_expect_false(expr) ecb_expect (!!(expr), 0) |
|
|
74 | # define ecb_expect_true(expr) ecb_expect (!!(expr), 1) |
|
|
75 | #else |
|
|
76 | # define ecb_expect_false(expr) !!(expr) |
|
|
77 | # define ecb_expect_true(expr) !!(expr) |
|
|
78 | #endif |
|
|
79 | |
|
|
80 | #if !USE_MULTIPLICITY |
72 | #if !USE_MULTIPLICITY |
81 | static scheme sc; |
73 | static scheme sc; |
82 | #endif |
74 | #endif |
83 | |
75 | |
84 | static void |
76 | static void |
… | |
… | |
153 | |
145 | |
154 | #define toupper(c) xtoupper (c) |
146 | #define toupper(c) xtoupper (c) |
155 | #define tolower(c) xtolower (c) |
147 | #define tolower(c) xtolower (c) |
156 | #define isdigit(c) xisdigit (c) |
148 | #define isdigit(c) xisdigit (c) |
157 | |
149 | |
158 | #if USE_STRLWR |
150 | #if USE_IGNORECASE |
159 | static const char * |
151 | static const char * |
160 | strlwr (char *s) |
152 | xstrlwr (char *s) |
161 | { |
153 | { |
162 | const char *p = s; |
154 | const char *p = s; |
163 | |
155 | |
164 | while (*s) |
156 | while (*s) |
165 | { |
157 | { |
… | |
… | |
167 | s++; |
159 | s++; |
168 | } |
160 | } |
169 | |
161 | |
170 | return p; |
162 | return p; |
171 | } |
163 | } |
172 | #endif |
|
|
173 | |
164 | |
|
|
165 | #define stricmp(a,b) strcasecmp (a, b) |
|
|
166 | #define strlwr(s) xstrlwr (s) |
|
|
167 | |
|
|
168 | #else |
174 | #define stricmp(a,b) strcmp (a, b) |
169 | # define stricmp(a,b) strcmp (a, b) |
175 | #define strlwr(s) (s) |
170 | # define strlwr(s) (s) |
|
|
171 | #endif |
176 | |
172 | |
177 | #ifndef prompt |
173 | #ifndef prompt |
178 | # define prompt "ts> " |
174 | # define prompt "ts> " |
179 | #endif |
175 | #endif |
180 | |
176 | |
… | |
… | |
186 | # define FIRST_CELLSEGS 3 |
182 | # define FIRST_CELLSEGS 3 |
187 | #endif |
183 | #endif |
188 | |
184 | |
189 | enum scheme_types |
185 | enum scheme_types |
190 | { |
186 | { |
|
|
187 | T_INTEGER, |
191 | T_FREE, |
188 | T_REAL, |
192 | T_STRING, |
189 | T_STRING, |
193 | T_NUMBER, |
|
|
194 | T_SYMBOL, |
190 | T_SYMBOL, |
195 | T_PROC, |
191 | T_PROC, |
196 | T_PAIR, |
192 | T_PAIR, /* also used for free cells */ |
197 | T_CLOSURE, |
193 | T_CLOSURE, |
198 | T_CONTINUATION, |
194 | T_CONTINUATION, |
199 | T_FOREIGN, |
195 | T_FOREIGN, |
200 | T_CHARACTER, |
196 | T_CHARACTER, |
201 | T_PORT, |
197 | T_PORT, |
… | |
… | |
211 | #define T_SYNTAX 0x0010 |
207 | #define T_SYNTAX 0x0010 |
212 | #define T_IMMUTABLE 0x0020 |
208 | #define T_IMMUTABLE 0x0020 |
213 | #define T_ATOM 0x0040 /* only for gc */ |
209 | #define T_ATOM 0x0040 /* only for gc */ |
214 | #define T_MARK 0x0080 /* only for gc */ |
210 | #define T_MARK 0x0080 /* only for gc */ |
215 | |
211 | |
|
|
212 | /* num, for generic arithmetic */ |
|
|
213 | struct num |
|
|
214 | { |
|
|
215 | IVALUE ivalue; |
|
|
216 | #if USE_REAL |
|
|
217 | RVALUE rvalue; |
|
|
218 | char is_fixnum; |
|
|
219 | #endif |
|
|
220 | }; |
|
|
221 | |
|
|
222 | #if USE_REAL |
|
|
223 | # define num_is_fixnum(n) (n).is_fixnum |
|
|
224 | # define num_set_fixnum(n,f) (n).is_fixnum = (f) |
|
|
225 | # define num_ivalue(n) (n).ivalue |
|
|
226 | # define num_rvalue(n) (n).rvalue |
|
|
227 | # define num_set_ivalue(n,i) (n).rvalue = (n).ivalue = (i) |
|
|
228 | # define num_set_rvalue(n,r) (n).rvalue = (r) |
|
|
229 | #else |
|
|
230 | # define num_is_fixnum(n) 1 |
|
|
231 | # define num_set_fixnum(n,f) 0 |
|
|
232 | # define num_ivalue(n) (n).ivalue |
|
|
233 | # define num_rvalue(n) (n).ivalue |
|
|
234 | # define num_set_ivalue(n,i) (n).ivalue = (i) |
|
|
235 | # define num_set_rvalue(n,r) (n).ivalue = (r) |
|
|
236 | #endif |
|
|
237 | |
216 | enum num_op { NUM_ADD, NUM_SUB, NUM_MUL, NUM_INTDIV }; |
238 | enum num_op { NUM_ADD, NUM_SUB, NUM_MUL, NUM_INTDIV }; |
217 | |
239 | |
218 | static num num_op (enum num_op op, num a, num b); |
240 | static num num_op (enum num_op op, num a, num b); |
219 | static num num_intdiv (num a, num b); |
241 | static num num_intdiv (num a, num b); |
220 | static num num_rem (num a, num b); |
242 | static num num_rem (num a, num b); |
… | |
… | |
223 | #if USE_MATH |
245 | #if USE_MATH |
224 | static double round_per_R5RS (double x); |
246 | static double round_per_R5RS (double x); |
225 | #endif |
247 | #endif |
226 | static int is_zero_rvalue (RVALUE x); |
248 | static int is_zero_rvalue (RVALUE x); |
227 | |
249 | |
228 | static INLINE int |
|
|
229 | num_is_integer (pointer p) |
|
|
230 | { |
|
|
231 | return num_is_fixnum (p->object.number); |
|
|
232 | } |
|
|
233 | |
|
|
234 | static num num_zero; |
250 | static num num_zero; |
235 | static num num_one; |
251 | static num num_one; |
236 | |
252 | |
237 | /* macros for cell operations */ |
253 | /* macros for cell operations */ |
238 | #define typeflag(p) ((p)->flag + 0) |
254 | #define typeflag(p) ((p)->flag + 0) |
239 | #define set_typeflag(p,v) ((p)->flag = (v)) |
255 | #define set_typeflag(p,v) ((p)->flag = (v)) |
240 | #define type(p) (typeflag (p) & T_MASKTYPE) |
256 | #define type(p) (typeflag (p) & T_MASKTYPE) |
241 | |
257 | |
242 | INTERFACE INLINE int |
258 | INTERFACE int |
243 | is_string (pointer p) |
259 | is_string (pointer p) |
244 | { |
260 | { |
245 | return type (p) == T_STRING; |
261 | return type (p) == T_STRING; |
246 | } |
262 | } |
247 | |
263 | |
248 | #define strvalue(p) ((p)->object.string.svalue) |
264 | #define strvalue(p) ((p)->object.string.svalue) |
249 | #define strlength(p) ((p)->object.string.length) |
265 | #define strlength(p) ((p)->object.string.length) |
250 | |
266 | |
251 | INTERFACE int is_list (SCHEME_P_ pointer p); |
|
|
252 | INTERFACE INLINE int |
267 | INTERFACE int |
253 | is_vector (pointer p) |
268 | is_vector (pointer p) |
254 | { |
269 | { |
255 | return type (p) == T_VECTOR; |
270 | return type (p) == T_VECTOR; |
256 | } |
271 | } |
257 | |
272 | |
258 | #define vecvalue(p) ((p)->object.vector.vvalue) |
273 | #define vecvalue(p) ((p)->object.vector.vvalue) |
259 | #define veclength(p) ((p)->object.vector.length) |
274 | #define veclength(p) ((p)->object.vector.length) |
260 | INTERFACE void fill_vector (pointer vec, pointer obj); |
275 | INTERFACE void fill_vector (pointer vec, uint32_t start, pointer obj); |
261 | INTERFACE uint32_t vector_length (pointer vec); |
|
|
262 | INTERFACE pointer vector_elem (pointer vec, uint32_t ielem); |
276 | INTERFACE pointer vector_get (pointer vec, uint32_t ielem); |
263 | INTERFACE void set_vector_elem (pointer vec, uint32_t ielem, pointer a); |
277 | INTERFACE void vector_set (pointer vec, uint32_t ielem, pointer a); |
264 | |
278 | |
265 | INTERFACE uint32_t |
279 | INTERFACE int |
266 | vector_length (pointer vec) |
280 | is_integer (pointer p) |
267 | { |
281 | { |
268 | return vec->object.vector.length; |
282 | return type (p) == T_INTEGER; |
269 | } |
283 | } |
270 | |
284 | |
|
|
285 | /* not the same as in scheme, where integers are (correctly :) reals */ |
271 | INTERFACE INLINE int |
286 | INTERFACE int |
|
|
287 | is_real (pointer p) |
|
|
288 | { |
|
|
289 | return type (p) == T_REAL; |
|
|
290 | } |
|
|
291 | |
|
|
292 | INTERFACE int |
272 | is_number (pointer p) |
293 | is_number (pointer p) |
273 | { |
294 | { |
274 | return type (p) == T_NUMBER; |
295 | return is_integer (p) || is_real (p); |
275 | } |
296 | } |
276 | |
297 | |
277 | INTERFACE INLINE int |
298 | INTERFACE int |
278 | is_integer (pointer p) |
|
|
279 | { |
|
|
280 | if (!is_number (p)) |
|
|
281 | return 0; |
|
|
282 | |
|
|
283 | if (num_is_integer (p) || ivalue (p) == rvalue (p)) |
|
|
284 | return 1; |
|
|
285 | |
|
|
286 | return 0; |
|
|
287 | } |
|
|
288 | |
|
|
289 | INTERFACE INLINE int |
|
|
290 | is_real (pointer p) |
|
|
291 | { |
|
|
292 | return is_number (p) && !num_is_fixnum (p->object.number); |
|
|
293 | } |
|
|
294 | |
|
|
295 | INTERFACE INLINE int |
|
|
296 | is_character (pointer p) |
299 | is_character (pointer p) |
297 | { |
300 | { |
298 | return type (p) == T_CHARACTER; |
301 | return type (p) == T_CHARACTER; |
299 | } |
302 | } |
300 | |
303 | |
301 | INTERFACE INLINE char * |
304 | INTERFACE char * |
302 | string_value (pointer p) |
305 | string_value (pointer p) |
303 | { |
306 | { |
304 | return strvalue (p); |
307 | return strvalue (p); |
305 | } |
308 | } |
306 | |
309 | |
307 | INLINE num |
|
|
308 | nvalue (pointer p) |
|
|
309 | { |
|
|
310 | return (p)->object.number; |
|
|
311 | } |
|
|
312 | |
|
|
313 | static IVALUE |
|
|
314 | num_get_ivalue (const num n) |
|
|
315 | { |
|
|
316 | return num_is_fixnum (n) ? num_ivalue (n) : (IVALUE)num_rvalue (n); |
|
|
317 | } |
|
|
318 | |
|
|
319 | static RVALUE |
|
|
320 | num_get_rvalue (const num n) |
|
|
321 | { |
|
|
322 | return num_is_fixnum (n) ? (RVALUE)num_ivalue (n) : num_rvalue (n); |
|
|
323 | } |
|
|
324 | |
|
|
325 | INTERFACE IVALUE |
|
|
326 | ivalue (pointer p) |
|
|
327 | { |
|
|
328 | return num_get_ivalue (p->object.number); |
|
|
329 | } |
|
|
330 | |
|
|
331 | INTERFACE RVALUE |
|
|
332 | rvalue (pointer p) |
|
|
333 | { |
|
|
334 | return num_get_rvalue (p->object.number); |
|
|
335 | } |
|
|
336 | |
|
|
337 | #define ivalue_unchecked(p) ((p)->object.number.value.ivalue) |
310 | #define ivalue_unchecked(p) (p)->object.ivalue |
|
|
311 | #define set_ivalue(p,v) (p)->object.ivalue = (v) |
|
|
312 | |
338 | #if USE_REAL |
313 | #if USE_REAL |
339 | # define rvalue_unchecked(p) ((p)->object.number.value.rvalue) |
314 | #define rvalue_unchecked(p) (p)->object.rvalue |
340 | # define set_num_integer(p) (p)->object.number.is_fixnum=1; |
315 | #define set_rvalue(p,v) (p)->object.rvalue = (v) |
341 | # define set_num_real(p) (p)->object.number.is_fixnum=0; |
|
|
342 | #else |
316 | #else |
343 | # define rvalue_unchecked(p) ((p)->object.number.value.ivalue) |
317 | #define rvalue_unchecked(p) (p)->object.ivalue |
344 | # define set_num_integer(p) 0 |
318 | #define set_rvalue(p,v) (p)->object.ivalue = (v) |
345 | # define set_num_real(p) 0 |
|
|
346 | #endif |
319 | #endif |
|
|
320 | |
347 | INTERFACE long |
321 | INTERFACE long |
348 | charvalue (pointer p) |
322 | charvalue (pointer p) |
349 | { |
323 | { |
350 | return ivalue_unchecked (p); |
324 | return ivalue_unchecked (p); |
351 | } |
325 | } |
352 | |
326 | |
353 | INTERFACE INLINE int |
327 | INTERFACE int |
354 | is_port (pointer p) |
328 | is_port (pointer p) |
355 | { |
329 | { |
356 | return type (p) == T_PORT; |
330 | return type (p) == T_PORT; |
357 | } |
331 | } |
358 | |
332 | |
359 | INTERFACE INLINE int |
333 | INTERFACE int |
360 | is_inport (pointer p) |
334 | is_inport (pointer p) |
361 | { |
335 | { |
362 | return is_port (p) && p->object.port->kind & port_input; |
336 | return is_port (p) && p->object.port->kind & port_input; |
363 | } |
337 | } |
364 | |
338 | |
365 | INTERFACE INLINE int |
339 | INTERFACE int |
366 | is_outport (pointer p) |
340 | is_outport (pointer p) |
367 | { |
341 | { |
368 | return is_port (p) && p->object.port->kind & port_output; |
342 | return is_port (p) && p->object.port->kind & port_output; |
369 | } |
343 | } |
370 | |
344 | |
371 | INTERFACE INLINE int |
345 | INTERFACE int |
372 | is_pair (pointer p) |
346 | is_pair (pointer p) |
373 | { |
347 | { |
374 | return type (p) == T_PAIR; |
348 | return type (p) == T_PAIR; |
375 | } |
349 | } |
376 | |
350 | |
… | |
… | |
408 | pair_cdr (pointer p) |
382 | pair_cdr (pointer p) |
409 | { |
383 | { |
410 | return cdr (p); |
384 | return cdr (p); |
411 | } |
385 | } |
412 | |
386 | |
413 | INTERFACE INLINE int |
387 | INTERFACE int |
414 | is_symbol (pointer p) |
388 | is_symbol (pointer p) |
415 | { |
389 | { |
416 | return type (p) == T_SYMBOL; |
390 | return type (p) == T_SYMBOL; |
417 | } |
391 | } |
418 | |
392 | |
419 | INTERFACE INLINE char * |
393 | INTERFACE char * |
420 | symname (pointer p) |
394 | symname (pointer p) |
421 | { |
395 | { |
422 | return strvalue (car (p)); |
396 | return strvalue (car (p)); |
423 | } |
397 | } |
424 | |
398 | |
425 | #if USE_PLIST |
399 | #if USE_PLIST |
426 | SCHEME_EXPORT INLINE int |
400 | SCHEME_EXPORT int |
427 | hasprop (pointer p) |
401 | hasprop (pointer p) |
428 | { |
402 | { |
429 | return typeflag (p) & T_SYMBOL; |
403 | return typeflag (p) & T_SYMBOL; |
430 | } |
404 | } |
431 | |
405 | |
432 | # define symprop(p) cdr(p) |
406 | # define symprop(p) cdr(p) |
433 | #endif |
407 | #endif |
434 | |
408 | |
435 | INTERFACE INLINE int |
409 | INTERFACE int |
436 | is_syntax (pointer p) |
410 | is_syntax (pointer p) |
437 | { |
411 | { |
438 | return typeflag (p) & T_SYNTAX; |
412 | return typeflag (p) & T_SYNTAX; |
439 | } |
413 | } |
440 | |
414 | |
441 | INTERFACE INLINE int |
415 | INTERFACE int |
442 | is_proc (pointer p) |
416 | is_proc (pointer p) |
443 | { |
417 | { |
444 | return type (p) == T_PROC; |
418 | return type (p) == T_PROC; |
445 | } |
419 | } |
446 | |
420 | |
447 | INTERFACE INLINE int |
421 | INTERFACE int |
448 | is_foreign (pointer p) |
422 | is_foreign (pointer p) |
449 | { |
423 | { |
450 | return type (p) == T_FOREIGN; |
424 | return type (p) == T_FOREIGN; |
451 | } |
425 | } |
452 | |
426 | |
453 | INTERFACE INLINE char * |
427 | INTERFACE char * |
454 | syntaxname (pointer p) |
428 | syntaxname (pointer p) |
455 | { |
429 | { |
456 | return strvalue (car (p)); |
430 | return strvalue (car (p)); |
457 | } |
431 | } |
458 | |
432 | |
459 | #define procnum(p) ivalue (p) |
433 | #define procnum(p) ivalue_unchecked (p) |
460 | static const char *procname (pointer x); |
434 | static const char *procname (pointer x); |
461 | |
435 | |
462 | INTERFACE INLINE int |
436 | INTERFACE int |
463 | is_closure (pointer p) |
437 | is_closure (pointer p) |
464 | { |
438 | { |
465 | return type (p) == T_CLOSURE; |
439 | return type (p) == T_CLOSURE; |
466 | } |
440 | } |
467 | |
441 | |
468 | INTERFACE INLINE int |
442 | INTERFACE int |
469 | is_macro (pointer p) |
443 | is_macro (pointer p) |
470 | { |
444 | { |
471 | return type (p) == T_MACRO; |
445 | return type (p) == T_MACRO; |
472 | } |
446 | } |
473 | |
447 | |
474 | INTERFACE INLINE pointer |
448 | INTERFACE pointer |
475 | closure_code (pointer p) |
449 | closure_code (pointer p) |
476 | { |
450 | { |
477 | return car (p); |
451 | return car (p); |
478 | } |
452 | } |
479 | |
453 | |
480 | INTERFACE INLINE pointer |
454 | INTERFACE pointer |
481 | closure_env (pointer p) |
455 | closure_env (pointer p) |
482 | { |
456 | { |
483 | return cdr (p); |
457 | return cdr (p); |
484 | } |
458 | } |
485 | |
459 | |
486 | INTERFACE INLINE int |
460 | INTERFACE int |
487 | is_continuation (pointer p) |
461 | is_continuation (pointer p) |
488 | { |
462 | { |
489 | return type (p) == T_CONTINUATION; |
463 | return type (p) == T_CONTINUATION; |
490 | } |
464 | } |
491 | |
465 | |
492 | #define cont_dump(p) cdr (p) |
466 | #define cont_dump(p) cdr (p) |
493 | #define set_cont_dump(p,v) set_cdr ((p), (v)) |
467 | #define set_cont_dump(p,v) set_cdr ((p), (v)) |
494 | |
468 | |
495 | /* To do: promise should be forced ONCE only */ |
469 | /* To do: promise should be forced ONCE only */ |
496 | INTERFACE INLINE int |
470 | INTERFACE int |
497 | is_promise (pointer p) |
471 | is_promise (pointer p) |
498 | { |
472 | { |
499 | return type (p) == T_PROMISE; |
473 | return type (p) == T_PROMISE; |
500 | } |
474 | } |
501 | |
475 | |
502 | INTERFACE INLINE int |
476 | INTERFACE int |
503 | is_environment (pointer p) |
477 | is_environment (pointer p) |
504 | { |
478 | { |
505 | return type (p) == T_ENVIRONMENT; |
479 | return type (p) == T_ENVIRONMENT; |
506 | } |
480 | } |
507 | |
481 | |
… | |
… | |
513 | |
487 | |
514 | #define is_mark(p) (typeflag (p) & T_MARK) |
488 | #define is_mark(p) (typeflag (p) & T_MARK) |
515 | #define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK) |
489 | #define setmark(p) set_typeflag ((p), typeflag (p) | T_MARK) |
516 | #define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK) |
490 | #define clrmark(p) set_typeflag ((p), typeflag (p) & ~T_MARK) |
517 | |
491 | |
518 | INTERFACE INLINE int |
492 | INTERFACE int |
519 | is_immutable (pointer p) |
493 | is_immutable (pointer p) |
520 | { |
494 | { |
521 | return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING; |
495 | return typeflag (p) & T_IMMUTABLE && USE_ERROR_CHECKING; |
522 | } |
496 | } |
523 | |
497 | |
524 | INTERFACE INLINE void |
498 | INTERFACE void |
525 | setimmutable (pointer p) |
499 | setimmutable (pointer p) |
526 | { |
500 | { |
527 | #if USE_ERROR_CHECKING |
501 | #if USE_ERROR_CHECKING |
528 | set_typeflag (p, typeflag (p) | T_IMMUTABLE); |
502 | set_typeflag (p, typeflag (p) | T_IMMUTABLE); |
529 | #endif |
503 | #endif |
530 | } |
504 | } |
531 | |
505 | |
|
|
506 | /* Result is: |
|
|
507 | proper list: length |
|
|
508 | circular list: -1 |
|
|
509 | not even a pair: -2 |
|
|
510 | dotted list: -2 minus length before dot |
|
|
511 | */ |
|
|
512 | INTERFACE int |
|
|
513 | list_length (SCHEME_P_ pointer a) |
|
|
514 | { |
|
|
515 | int i = 0; |
|
|
516 | pointer slow, fast; |
|
|
517 | |
|
|
518 | slow = fast = a; |
|
|
519 | |
|
|
520 | while (1) |
|
|
521 | { |
|
|
522 | if (fast == NIL) |
|
|
523 | return i; |
|
|
524 | |
|
|
525 | if (!is_pair (fast)) |
|
|
526 | return -2 - i; |
|
|
527 | |
|
|
528 | fast = cdr (fast); |
|
|
529 | ++i; |
|
|
530 | |
|
|
531 | if (fast == NIL) |
|
|
532 | return i; |
|
|
533 | |
|
|
534 | if (!is_pair (fast)) |
|
|
535 | return -2 - i; |
|
|
536 | |
|
|
537 | ++i; |
|
|
538 | fast = cdr (fast); |
|
|
539 | |
|
|
540 | /* Safe because we would have already returned if `fast' |
|
|
541 | encountered a non-pair. */ |
|
|
542 | slow = cdr (slow); |
|
|
543 | |
|
|
544 | if (fast == slow) |
|
|
545 | { |
|
|
546 | /* the fast pointer has looped back around and caught up |
|
|
547 | with the slow pointer, hence the structure is circular, |
|
|
548 | not of finite length, and therefore not a list */ |
|
|
549 | return -1; |
|
|
550 | } |
|
|
551 | } |
|
|
552 | } |
|
|
553 | |
|
|
554 | INTERFACE int |
|
|
555 | is_list (SCHEME_P_ pointer a) |
|
|
556 | { |
|
|
557 | return list_length (SCHEME_A_ a) >= 0; |
|
|
558 | } |
|
|
559 | |
532 | #if USE_CHAR_CLASSIFIERS |
560 | #if USE_CHAR_CLASSIFIERS |
533 | static INLINE int |
561 | ecb_inline int |
534 | Cisalpha (int c) |
562 | Cisalpha (int c) |
535 | { |
563 | { |
536 | return isascii (c) && isalpha (c); |
564 | return isascii (c) && isalpha (c); |
537 | } |
565 | } |
538 | |
566 | |
539 | static INLINE int |
567 | ecb_inline int |
540 | Cisdigit (int c) |
568 | Cisdigit (int c) |
541 | { |
569 | { |
542 | return isascii (c) && isdigit (c); |
570 | return isascii (c) && isdigit (c); |
543 | } |
571 | } |
544 | |
572 | |
545 | static INLINE int |
573 | ecb_inline int |
546 | Cisspace (int c) |
574 | Cisspace (int c) |
547 | { |
575 | { |
548 | return isascii (c) && isspace (c); |
576 | return isascii (c) && isspace (c); |
549 | } |
577 | } |
550 | |
578 | |
551 | static INLINE int |
579 | ecb_inline int |
552 | Cisupper (int c) |
580 | Cisupper (int c) |
553 | { |
581 | { |
554 | return isascii (c) && isupper (c); |
582 | return isascii (c) && isupper (c); |
555 | } |
583 | } |
556 | |
584 | |
557 | static INLINE int |
585 | ecb_inline int |
558 | Cislower (int c) |
586 | Cislower (int c) |
559 | { |
587 | { |
560 | return isascii (c) && islower (c); |
588 | return isascii (c) && islower (c); |
561 | } |
589 | } |
562 | #endif |
590 | #endif |
… | |
… | |
623 | #endif |
651 | #endif |
624 | |
652 | |
625 | static int file_push (SCHEME_P_ const char *fname); |
653 | static int file_push (SCHEME_P_ const char *fname); |
626 | static void file_pop (SCHEME_P); |
654 | static void file_pop (SCHEME_P); |
627 | static int file_interactive (SCHEME_P); |
655 | static int file_interactive (SCHEME_P); |
628 | static INLINE int is_one_of (char *s, int c); |
656 | ecb_inline int is_one_of (char *s, int c); |
629 | static int alloc_cellseg (SCHEME_P_ int n); |
657 | static int alloc_cellseg (SCHEME_P_ int n); |
630 | static INLINE pointer get_cell (SCHEME_P_ pointer a, pointer b); |
658 | ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b); |
631 | static void finalize_cell (SCHEME_P_ pointer a); |
659 | static void finalize_cell (SCHEME_P_ pointer a); |
632 | static int count_consecutive_cells (pointer x, int needed); |
660 | static int count_consecutive_cells (pointer x, int needed); |
633 | static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all); |
661 | static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all); |
634 | static pointer mk_number (SCHEME_P_ const num n); |
662 | static pointer mk_number (SCHEME_P_ const num n); |
635 | static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill); |
663 | static char *store_string (SCHEME_P_ uint32_t len, const char *str, char fill); |
… | |
… | |
652 | static int basic_inchar (port *pt); |
680 | static int basic_inchar (port *pt); |
653 | static int inchar (SCHEME_P); |
681 | static int inchar (SCHEME_P); |
654 | static void backchar (SCHEME_P_ int c); |
682 | static void backchar (SCHEME_P_ int c); |
655 | static char *readstr_upto (SCHEME_P_ char *delim); |
683 | static char *readstr_upto (SCHEME_P_ char *delim); |
656 | static pointer readstrexp (SCHEME_P); |
684 | static pointer readstrexp (SCHEME_P); |
657 | static INLINE int skipspace (SCHEME_P); |
685 | ecb_inline int skipspace (SCHEME_P); |
658 | static int token (SCHEME_P); |
686 | static int token (SCHEME_P); |
659 | static void printslashstring (SCHEME_P_ char *s, int len); |
687 | static void printslashstring (SCHEME_P_ char *s, int len); |
660 | static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen); |
688 | static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen); |
661 | static void printatom (SCHEME_P_ pointer l, int f); |
689 | static void printatom (SCHEME_P_ pointer l, int f); |
662 | static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op); |
690 | static pointer mk_proc (SCHEME_P_ enum scheme_opcodes op); |
… | |
… | |
666 | static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list); |
694 | static pointer reverse_in_place (SCHEME_P_ pointer term, pointer list); |
667 | static pointer revappend (SCHEME_P_ pointer a, pointer b); |
695 | static pointer revappend (SCHEME_P_ pointer a, pointer b); |
668 | static pointer ss_get_cont (SCHEME_P); |
696 | static pointer ss_get_cont (SCHEME_P); |
669 | static void ss_set_cont (SCHEME_P_ pointer cont); |
697 | static void ss_set_cont (SCHEME_P_ pointer cont); |
670 | static void dump_stack_mark (SCHEME_P); |
698 | static void dump_stack_mark (SCHEME_P); |
671 | static pointer opexe_0 (SCHEME_P_ enum scheme_opcodes op); |
699 | static int opexe_0 (SCHEME_P_ enum scheme_opcodes op); |
|
|
700 | static int opexe_1 (SCHEME_P_ enum scheme_opcodes op); |
672 | static pointer opexe_2 (SCHEME_P_ enum scheme_opcodes op); |
701 | static int opexe_2 (SCHEME_P_ enum scheme_opcodes op); |
673 | static pointer opexe_r (SCHEME_P_ enum scheme_opcodes op); |
|
|
674 | static pointer opexe_3 (SCHEME_P_ enum scheme_opcodes op); |
702 | static int opexe_3 (SCHEME_P_ enum scheme_opcodes op); |
675 | static pointer opexe_4 (SCHEME_P_ enum scheme_opcodes op); |
703 | static int opexe_4 (SCHEME_P_ enum scheme_opcodes op); |
676 | static pointer opexe_5 (SCHEME_P_ enum scheme_opcodes op); |
704 | static int opexe_5 (SCHEME_P_ enum scheme_opcodes op); |
677 | static pointer opexe_6 (SCHEME_P_ enum scheme_opcodes op); |
705 | static int opexe_6 (SCHEME_P_ enum scheme_opcodes op); |
678 | static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op); |
706 | static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op); |
679 | static void assign_syntax (SCHEME_P_ const char *name); |
707 | static void assign_syntax (SCHEME_P_ const char *name); |
680 | static int syntaxnum (pointer p); |
708 | static int syntaxnum (pointer p); |
681 | static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name); |
709 | static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name); |
682 | |
710 | |
|
|
711 | static IVALUE |
|
|
712 | ivalue (pointer x) |
|
|
713 | { |
|
|
714 | return is_integer (x) ? ivalue_unchecked (x) : rvalue_unchecked (x); |
|
|
715 | } |
|
|
716 | |
|
|
717 | static RVALUE |
|
|
718 | rvalue (pointer x) |
|
|
719 | { |
|
|
720 | return is_integer (x) ? ivalue_unchecked (x) : rvalue_unchecked (x); |
|
|
721 | } |
|
|
722 | |
|
|
723 | INTERFACE num |
|
|
724 | nvalue (pointer x) |
|
|
725 | { |
|
|
726 | num n; |
|
|
727 | |
|
|
728 | num_set_fixnum (n, is_integer (x)); |
|
|
729 | |
|
|
730 | if (num_is_fixnum (n)) |
|
|
731 | num_set_ivalue (n, ivalue_unchecked (x)); |
|
|
732 | else |
|
|
733 | num_set_rvalue (n, rvalue_unchecked (x)); |
|
|
734 | |
|
|
735 | return n; |
|
|
736 | } |
|
|
737 | |
683 | static num |
738 | static num |
684 | num_op (enum num_op op, num a, num b) |
739 | num_op (enum num_op op, num a, num b) |
685 | { |
740 | { |
686 | num ret; |
741 | num ret; |
687 | |
742 | |
688 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
743 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
689 | |
744 | |
690 | if (num_is_fixnum (ret)) |
745 | if (num_is_fixnum (ret)) |
691 | { |
746 | { |
692 | IVALUE av = num_get_ivalue (a); |
|
|
693 | IVALUE bv = num_get_ivalue (b); |
|
|
694 | |
|
|
695 | switch (op) |
747 | switch (op) |
696 | { |
748 | { |
697 | case NUM_ADD: av += bv; break; |
749 | case NUM_ADD: a.ivalue += b.ivalue; break; |
698 | case NUM_SUB: av -= bv; break; |
750 | case NUM_SUB: a.ivalue -= b.ivalue; break; |
699 | case NUM_MUL: av *= bv; break; |
751 | case NUM_MUL: a.ivalue *= b.ivalue; break; |
700 | case NUM_INTDIV: av /= bv; break; |
752 | case NUM_INTDIV: a.ivalue /= b.ivalue; break; |
701 | } |
753 | } |
702 | |
754 | |
703 | num_set_ivalue (ret, av); |
755 | num_set_ivalue (ret, a.ivalue); |
704 | } |
756 | } |
|
|
757 | #if USE_REAL |
705 | else |
758 | else |
706 | { |
759 | { |
707 | RVALUE av = num_get_rvalue (a); |
|
|
708 | RVALUE bv = num_get_rvalue (b); |
|
|
709 | |
|
|
710 | switch (op) |
760 | switch (op) |
711 | { |
761 | { |
712 | case NUM_ADD: av += bv; break; |
762 | case NUM_ADD: a.rvalue += b.rvalue; break; |
713 | case NUM_SUB: av -= bv; break; |
763 | case NUM_SUB: a.rvalue -= b.rvalue; break; |
714 | case NUM_MUL: av *= bv; break; |
764 | case NUM_MUL: a.rvalue *= b.rvalue; break; |
715 | case NUM_INTDIV: av /= bv; break; |
765 | case NUM_INTDIV: a.rvalue /= b.rvalue; break; |
716 | } |
766 | } |
717 | |
767 | |
718 | num_set_rvalue (ret, av); |
768 | num_set_rvalue (ret, a.rvalue); |
719 | } |
769 | } |
|
|
770 | #endif |
720 | |
771 | |
721 | return ret; |
772 | return ret; |
722 | } |
773 | } |
723 | |
774 | |
724 | static num |
775 | static num |
725 | num_div (num a, num b) |
776 | num_div (num a, num b) |
726 | { |
777 | { |
727 | num ret; |
778 | num ret; |
728 | |
779 | |
729 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_get_ivalue (a) % num_get_ivalue (b) == 0); |
780 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_ivalue (a) % num_ivalue (b) == 0); |
730 | |
781 | |
731 | if (num_is_fixnum (ret)) |
782 | if (num_is_fixnum (ret)) |
732 | num_set_ivalue (ret, num_get_ivalue (a) / num_get_ivalue (b)); |
783 | num_set_ivalue (ret, num_ivalue (a) / num_ivalue (b)); |
733 | else |
784 | else |
734 | num_set_rvalue (ret, num_get_rvalue (a) / num_get_rvalue (b)); |
785 | num_set_rvalue (ret, num_rvalue (a) / num_rvalue (b)); |
735 | |
786 | |
736 | return ret; |
787 | return ret; |
737 | } |
788 | } |
738 | |
789 | |
739 | static num |
790 | static num |
… | |
… | |
741 | { |
792 | { |
742 | num ret; |
793 | num ret; |
743 | long e1, e2, res; |
794 | long e1, e2, res; |
744 | |
795 | |
745 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
796 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
746 | e1 = num_get_ivalue (a); |
797 | e1 = num_ivalue (a); |
747 | e2 = num_get_ivalue (b); |
798 | e2 = num_ivalue (b); |
748 | res = e1 % e2; |
799 | res = e1 % e2; |
749 | |
800 | |
750 | /* remainder should have same sign as second operand */ |
801 | /* remainder should have same sign as second operand */ |
751 | if (res > 0) |
802 | if (res > 0) |
752 | { |
803 | { |
… | |
… | |
768 | { |
819 | { |
769 | num ret; |
820 | num ret; |
770 | long e1, e2, res; |
821 | long e1, e2, res; |
771 | |
822 | |
772 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
823 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
773 | e1 = num_get_ivalue (a); |
824 | e1 = num_ivalue (a); |
774 | e2 = num_get_ivalue (b); |
825 | e2 = num_ivalue (b); |
775 | res = e1 % e2; |
826 | res = e1 % e2; |
776 | |
827 | |
777 | /* modulo should have same sign as second operand */ |
828 | /* modulo should have same sign as second operand */ |
778 | if (res * e2 < 0) |
829 | if (res * e2 < 0) |
779 | res += e2; |
830 | res += e2; |
780 | |
831 | |
781 | num_set_ivalue (ret, res); |
832 | num_set_ivalue (ret, res); |
782 | return ret; |
833 | return ret; |
783 | } |
834 | } |
784 | |
835 | |
785 | /* this completely disrespects NaNs */ |
836 | /* this completely disrespects NaNs, but r5rs doesn't even allow NaNs */ |
786 | static int |
837 | static int |
787 | num_cmp (num a, num b) |
838 | num_cmp (num a, num b) |
788 | { |
839 | { |
789 | int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b); |
840 | int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b); |
790 | int ret; |
841 | int ret; |
791 | |
842 | |
792 | if (is_fixnum) |
843 | if (is_fixnum) |
793 | { |
844 | { |
794 | IVALUE av = num_get_ivalue (a); |
845 | IVALUE av = num_ivalue (a); |
795 | IVALUE bv = num_get_ivalue (b); |
846 | IVALUE bv = num_ivalue (b); |
796 | |
847 | |
797 | ret = av == bv ? 0 : av < bv ? -1 : +1; |
848 | ret = av == bv ? 0 : av < bv ? -1 : +1; |
798 | } |
849 | } |
799 | else |
850 | else |
800 | { |
851 | { |
801 | RVALUE av = num_get_rvalue (a); |
852 | RVALUE av = num_rvalue (a); |
802 | RVALUE bv = num_get_rvalue (b); |
853 | RVALUE bv = num_rvalue (b); |
803 | |
854 | |
804 | ret = av == bv ? 0 : av < bv ? -1 : +1; |
855 | ret = av == bv ? 0 : av < bv ? -1 : +1; |
805 | } |
856 | } |
806 | |
857 | |
807 | return ret; |
858 | return ret; |
… | |
… | |
833 | #endif |
884 | #endif |
834 | |
885 | |
835 | static int |
886 | static int |
836 | is_zero_rvalue (RVALUE x) |
887 | is_zero_rvalue (RVALUE x) |
837 | { |
888 | { |
|
|
889 | return x == 0; |
|
|
890 | #if 0 |
838 | #if USE_REAL |
891 | #if USE_REAL |
839 | return x < DBL_MIN && x > -DBL_MIN; /* why the hate of denormals? this should be == 0. */ |
892 | return x < DBL_MIN && x > -DBL_MIN; /* why the hate of denormals? this should be == 0. */ |
840 | #else |
893 | #else |
841 | return x == 0; |
894 | return x == 0; |
|
|
895 | #endif |
842 | #endif |
896 | #endif |
843 | } |
897 | } |
844 | |
898 | |
845 | /* allocate new cell segment */ |
899 | /* allocate new cell segment */ |
846 | static int |
900 | static int |
… | |
… | |
867 | return k; |
921 | return k; |
868 | |
922 | |
869 | i = ++SCHEME_V->last_cell_seg; |
923 | i = ++SCHEME_V->last_cell_seg; |
870 | SCHEME_V->alloc_seg[i] = cp; |
924 | SCHEME_V->alloc_seg[i] = cp; |
871 | |
925 | |
872 | /* insert new segment in address order */ |
|
|
873 | newp = (pointer)cp; |
926 | newp = (pointer)cp; |
874 | SCHEME_V->cell_seg[i] = newp; |
927 | SCHEME_V->cell_seg[i] = newp; |
875 | SCHEME_V->cell_segsize[i] = segsize; |
928 | SCHEME_V->cell_segsize[i] = segsize; |
876 | |
|
|
877 | //TODO: insert, not swap |
|
|
878 | while (i > 0 && SCHEME_V->cell_seg[i - 1] > SCHEME_V->cell_seg[i]) |
|
|
879 | { |
|
|
880 | p = SCHEME_V->cell_seg[i]; |
|
|
881 | SCHEME_V->cell_seg[i] = SCHEME_V->cell_seg[i - 1]; |
|
|
882 | SCHEME_V->cell_seg[i - 1] = p; |
|
|
883 | |
|
|
884 | k = SCHEME_V->cell_segsize[i]; |
|
|
885 | SCHEME_V->cell_segsize[i] = SCHEME_V->cell_segsize[i - 1]; |
|
|
886 | SCHEME_V->cell_segsize[i - 1] = k; |
|
|
887 | |
|
|
888 | --i; |
|
|
889 | } |
|
|
890 | |
|
|
891 | SCHEME_V->fcells += segsize; |
929 | SCHEME_V->fcells += segsize; |
892 | last = newp + segsize - 1; |
930 | last = newp + segsize - 1; |
893 | |
931 | |
894 | for (p = newp; p <= last; p++) |
932 | for (p = newp; p <= last; p++) |
895 | { |
933 | { |
896 | set_typeflag (p, T_FREE); |
934 | set_typeflag (p, T_PAIR); |
897 | set_car (p, NIL); |
935 | set_car (p, NIL); |
898 | set_cdr (p, p + 1); |
936 | set_cdr (p, p + 1); |
899 | } |
937 | } |
900 | |
938 | |
901 | /* insert new cells in address order on free list */ |
|
|
902 | if (SCHEME_V->free_cell == NIL || p < SCHEME_V->free_cell) |
|
|
903 | { |
|
|
904 | set_cdr (last, SCHEME_V->free_cell); |
939 | set_cdr (last, SCHEME_V->free_cell); |
905 | SCHEME_V->free_cell = newp; |
940 | SCHEME_V->free_cell = newp; |
906 | } |
|
|
907 | else |
|
|
908 | { |
|
|
909 | p = SCHEME_V->free_cell; |
|
|
910 | |
|
|
911 | while (cdr (p) != NIL && newp > cdr (p)) |
|
|
912 | p = cdr (p); |
|
|
913 | |
|
|
914 | set_cdr (last, cdr (p)); |
|
|
915 | set_cdr (p, newp); |
|
|
916 | } |
|
|
917 | } |
941 | } |
918 | |
942 | |
919 | return n; |
943 | return n; |
920 | } |
944 | } |
921 | |
945 | |
922 | /* get new cell. parameter a, b is marked by gc. */ |
946 | /* get new cell. parameter a, b is marked by gc. */ |
923 | static INLINE pointer |
947 | ecb_inline pointer |
924 | get_cell_x (SCHEME_P_ pointer a, pointer b) |
948 | get_cell_x (SCHEME_P_ pointer a, pointer b) |
925 | { |
949 | { |
926 | if (ecb_expect_false (SCHEME_V->free_cell == NIL)) |
950 | if (ecb_expect_false (SCHEME_V->free_cell == NIL)) |
927 | { |
951 | { |
928 | if (SCHEME_V->no_memory && USE_ERROR_CHECKING) |
952 | if (SCHEME_V->no_memory && USE_ERROR_CHECKING) |
… | |
… | |
1000 | /* Record it as a vector so that gc understands it. */ |
1024 | /* Record it as a vector so that gc understands it. */ |
1001 | set_typeflag (v, T_VECTOR | T_ATOM); |
1025 | set_typeflag (v, T_VECTOR | T_ATOM); |
1002 | |
1026 | |
1003 | v->object.vector.vvalue = e; |
1027 | v->object.vector.vvalue = e; |
1004 | v->object.vector.length = len; |
1028 | v->object.vector.length = len; |
1005 | fill_vector (v, init); |
1029 | fill_vector (v, 0, init); |
1006 | push_recent_alloc (SCHEME_A_ v, NIL); |
1030 | push_recent_alloc (SCHEME_A_ v, NIL); |
1007 | |
1031 | |
1008 | return v; |
1032 | return v; |
1009 | } |
1033 | } |
1010 | |
1034 | |
1011 | static INLINE void |
1035 | ecb_inline void |
1012 | ok_to_freely_gc (SCHEME_P) |
1036 | ok_to_freely_gc (SCHEME_P) |
1013 | { |
1037 | { |
1014 | set_car (S_SINK, NIL); |
1038 | set_car (S_SINK, NIL); |
1015 | } |
1039 | } |
1016 | |
1040 | |
… | |
… | |
1076 | pointer x = immutable_cons (mk_string (SCHEME_A_ name), NIL); |
1100 | pointer x = immutable_cons (mk_string (SCHEME_A_ name), NIL); |
1077 | set_typeflag (x, T_SYMBOL); |
1101 | set_typeflag (x, T_SYMBOL); |
1078 | setimmutable (car (x)); |
1102 | setimmutable (car (x)); |
1079 | |
1103 | |
1080 | location = hash_fn (name, veclength (SCHEME_V->oblist)); |
1104 | location = hash_fn (name, veclength (SCHEME_V->oblist)); |
1081 | set_vector_elem (SCHEME_V->oblist, location, immutable_cons (x, vector_elem (SCHEME_V->oblist, location))); |
1105 | vector_set (SCHEME_V->oblist, location, immutable_cons (x, vector_get (SCHEME_V->oblist, location))); |
1082 | return x; |
1106 | return x; |
1083 | } |
1107 | } |
1084 | |
1108 | |
1085 | static INLINE pointer |
1109 | ecb_inline pointer |
1086 | oblist_find_by_name (SCHEME_P_ const char *name) |
1110 | oblist_find_by_name (SCHEME_P_ const char *name) |
1087 | { |
1111 | { |
1088 | int location; |
1112 | int location; |
1089 | pointer x; |
1113 | pointer x; |
1090 | char *s; |
1114 | char *s; |
1091 | |
1115 | |
1092 | location = hash_fn (name, veclength (SCHEME_V->oblist)); |
1116 | location = hash_fn (name, veclength (SCHEME_V->oblist)); |
1093 | |
1117 | |
1094 | for (x = vector_elem (SCHEME_V->oblist, location); x != NIL; x = cdr (x)) |
1118 | for (x = vector_get (SCHEME_V->oblist, location); x != NIL; x = cdr (x)) |
1095 | { |
1119 | { |
1096 | s = symname (car (x)); |
1120 | s = symname (car (x)); |
1097 | |
1121 | |
1098 | /* case-insensitive, per R5RS section 2 */ |
1122 | /* case-insensitive, per R5RS section 2 */ |
1099 | if (stricmp (name, s) == 0) |
1123 | if (stricmp (name, s) == 0) |
… | |
… | |
1109 | int i; |
1133 | int i; |
1110 | pointer x; |
1134 | pointer x; |
1111 | pointer ob_list = NIL; |
1135 | pointer ob_list = NIL; |
1112 | |
1136 | |
1113 | for (i = 0; i < veclength (SCHEME_V->oblist); i++) |
1137 | for (i = 0; i < veclength (SCHEME_V->oblist); i++) |
1114 | for (x = vector_elem (SCHEME_V->oblist, i); x != NIL; x = cdr (x)) |
1138 | for (x = vector_get (SCHEME_V->oblist, i); x != NIL; x = cdr (x)) |
1115 | ob_list = cons (x, ob_list); |
1139 | ob_list = cons (x, ob_list); |
1116 | |
1140 | |
1117 | return ob_list; |
1141 | return ob_list; |
1118 | } |
1142 | } |
1119 | |
1143 | |
… | |
… | |
1123 | oblist_initial_value (SCHEME_P) |
1147 | oblist_initial_value (SCHEME_P) |
1124 | { |
1148 | { |
1125 | return NIL; |
1149 | return NIL; |
1126 | } |
1150 | } |
1127 | |
1151 | |
1128 | static INLINE pointer |
1152 | ecb_inline pointer |
1129 | oblist_find_by_name (SCHEME_P_ const char *name) |
1153 | oblist_find_by_name (SCHEME_P_ const char *name) |
1130 | { |
1154 | { |
1131 | pointer x; |
1155 | pointer x; |
1132 | char *s; |
1156 | char *s; |
1133 | |
1157 | |
… | |
… | |
1192 | mk_character (SCHEME_P_ int c) |
1216 | mk_character (SCHEME_P_ int c) |
1193 | { |
1217 | { |
1194 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1218 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1195 | |
1219 | |
1196 | set_typeflag (x, (T_CHARACTER | T_ATOM)); |
1220 | set_typeflag (x, (T_CHARACTER | T_ATOM)); |
1197 | ivalue_unchecked (x) = c & 0xff; |
1221 | set_ivalue (x, c & 0xff); |
1198 | set_num_integer (x); |
1222 | |
1199 | return x; |
1223 | return x; |
1200 | } |
1224 | } |
1201 | |
1225 | |
1202 | /* get number atom (integer) */ |
1226 | /* get number atom (integer) */ |
1203 | INTERFACE pointer |
1227 | INTERFACE pointer |
1204 | mk_integer (SCHEME_P_ long num) |
1228 | mk_integer (SCHEME_P_ long n) |
1205 | { |
1229 | { |
1206 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1230 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1207 | |
1231 | |
1208 | set_typeflag (x, (T_NUMBER | T_ATOM)); |
1232 | set_typeflag (x, (T_INTEGER | T_ATOM)); |
1209 | ivalue_unchecked (x) = num; |
1233 | set_ivalue (x, n); |
1210 | set_num_integer (x); |
1234 | |
1211 | return x; |
1235 | return x; |
1212 | } |
1236 | } |
1213 | |
1237 | |
1214 | INTERFACE pointer |
1238 | INTERFACE pointer |
1215 | mk_real (SCHEME_P_ RVALUE n) |
1239 | mk_real (SCHEME_P_ RVALUE n) |
1216 | { |
1240 | { |
|
|
1241 | #if USE_REAL |
1217 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1242 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1218 | |
1243 | |
1219 | set_typeflag (x, (T_NUMBER | T_ATOM)); |
1244 | set_typeflag (x, (T_REAL | T_ATOM)); |
1220 | rvalue_unchecked (x) = n; |
1245 | set_rvalue (x, n); |
1221 | set_num_real (x); |
1246 | |
1222 | return x; |
1247 | return x; |
|
|
1248 | #else |
|
|
1249 | return mk_integer (SCHEME_A_ n); |
|
|
1250 | #endif |
1223 | } |
1251 | } |
1224 | |
1252 | |
1225 | static pointer |
1253 | static pointer |
1226 | mk_number (SCHEME_P_ const num n) |
1254 | mk_number (SCHEME_P_ const num n) |
1227 | { |
1255 | { |
|
|
1256 | #if USE_REAL |
1228 | if (num_is_fixnum (n)) |
1257 | return num_is_fixnum (n) |
|
|
1258 | ? mk_integer (SCHEME_A_ num_ivalue (n)) |
|
|
1259 | : mk_real (SCHEME_A_ num_rvalue (n)); |
|
|
1260 | #else |
1229 | return mk_integer (SCHEME_A_ num_get_ivalue (n)); |
1261 | return mk_integer (SCHEME_A_ num_ivalue (n)); |
1230 | else |
1262 | #endif |
1231 | return mk_real (SCHEME_A_ num_get_rvalue (n)); |
|
|
1232 | } |
1263 | } |
1233 | |
1264 | |
1234 | /* allocate name to string area */ |
1265 | /* allocate name to string area */ |
1235 | static char * |
1266 | static char * |
1236 | store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill) |
1267 | store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill) |
… | |
… | |
1295 | { |
1326 | { |
1296 | return get_vector_object (SCHEME_A_ len, NIL); |
1327 | return get_vector_object (SCHEME_A_ len, NIL); |
1297 | } |
1328 | } |
1298 | |
1329 | |
1299 | INTERFACE void |
1330 | INTERFACE void |
1300 | fill_vector (pointer vec, pointer obj) |
1331 | fill_vector (pointer vec, uint32_t start, pointer obj) |
1301 | { |
1332 | { |
1302 | int i; |
1333 | int i; |
1303 | |
1334 | |
1304 | for (i = 0; i < vec->object.vector.length; i++) |
1335 | for (i = start; i < veclength (vec); i++) |
1305 | vecvalue (vec)[i] = obj; |
1336 | vecvalue (vec)[i] = obj; |
1306 | } |
1337 | } |
1307 | |
1338 | |
1308 | INTERFACE pointer |
1339 | INTERFACE pointer |
1309 | vector_elem (pointer vec, uint32_t ielem) |
1340 | vector_get (pointer vec, uint32_t ielem) |
1310 | { |
1341 | { |
1311 | return vecvalue(vec)[ielem]; |
1342 | return vecvalue(vec)[ielem]; |
1312 | } |
1343 | } |
1313 | |
1344 | |
1314 | INTERFACE void |
1345 | INTERFACE void |
1315 | set_vector_elem (pointer vec, uint32_t ielem, pointer a) |
1346 | vector_set (pointer vec, uint32_t ielem, pointer a) |
1316 | { |
1347 | { |
1317 | vecvalue(vec)[ielem] = a; |
1348 | vecvalue(vec)[ielem] = a; |
1318 | } |
1349 | } |
1319 | |
1350 | |
1320 | /* get new symbol */ |
1351 | /* get new symbol */ |
… | |
… | |
1412 | } |
1443 | } |
1413 | else if ((c == 'e') || (c == 'E')) |
1444 | else if ((c == 'e') || (c == 'E')) |
1414 | { |
1445 | { |
1415 | if (!has_fp_exp) |
1446 | if (!has_fp_exp) |
1416 | { |
1447 | { |
1417 | has_dec_point = 1; /* decimal point illegal |
1448 | has_dec_point = 1; /* decimal point illegal from now on */ |
1418 | from now on */ |
|
|
1419 | p++; |
1449 | p++; |
1420 | |
1450 | |
1421 | if ((*p == '-') || (*p == '+') || isdigit (*p)) |
1451 | if ((*p == '-') || (*p == '+') || isdigit (*p)) |
1422 | continue; |
1452 | continue; |
1423 | } |
1453 | } |
… | |
… | |
1511 | |
1541 | |
1512 | if (ecb_expect_false (is_vector (p))) |
1542 | if (ecb_expect_false (is_vector (p))) |
1513 | { |
1543 | { |
1514 | int i; |
1544 | int i; |
1515 | |
1545 | |
1516 | for (i = 0; i < p->object.vector.length; i++) |
1546 | for (i = 0; i < veclength (p); i++) |
1517 | mark (vecvalue (p)[i]); |
1547 | mark (vecvalue (p)[i]); |
1518 | } |
1548 | } |
1519 | |
1549 | |
1520 | if (is_atom (p)) |
1550 | if (is_atom (p)) |
1521 | goto E6; |
1551 | goto E6; |
… | |
… | |
1619 | if (is_mark (p)) |
1649 | if (is_mark (p)) |
1620 | clrmark (p); |
1650 | clrmark (p); |
1621 | else |
1651 | else |
1622 | { |
1652 | { |
1623 | /* reclaim cell */ |
1653 | /* reclaim cell */ |
1624 | if (typeflag (p) != T_FREE) |
1654 | if (typeflag (p) != T_PAIR) |
1625 | { |
1655 | { |
1626 | finalize_cell (SCHEME_A_ p); |
1656 | finalize_cell (SCHEME_A_ p); |
1627 | set_typeflag (p, T_FREE); |
1657 | set_typeflag (p, T_PAIR); |
1628 | set_car (p, NIL); |
1658 | set_car (p, NIL); |
1629 | } |
1659 | } |
1630 | |
1660 | |
1631 | ++SCHEME_V->fcells; |
1661 | ++SCHEME_V->fcells; |
1632 | set_cdr (p, SCHEME_V->free_cell); |
1662 | set_cdr (p, SCHEME_V->free_cell); |
… | |
… | |
1634 | } |
1664 | } |
1635 | } |
1665 | } |
1636 | } |
1666 | } |
1637 | |
1667 | |
1638 | if (SCHEME_V->gc_verbose) |
1668 | if (SCHEME_V->gc_verbose) |
|
|
1669 | { |
1639 | xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" cells were recovered.\n"); |
1670 | xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" cells were recovered.\n"); |
|
|
1671 | } |
1640 | } |
1672 | } |
1641 | |
1673 | |
1642 | static void |
1674 | static void |
1643 | finalize_cell (SCHEME_P_ pointer a) |
1675 | finalize_cell (SCHEME_P_ pointer a) |
1644 | { |
1676 | { |
… | |
… | |
2231 | } |
2263 | } |
2232 | } |
2264 | } |
2233 | } |
2265 | } |
2234 | |
2266 | |
2235 | /* check c is in chars */ |
2267 | /* check c is in chars */ |
2236 | static INLINE int |
2268 | ecb_inline int |
2237 | is_one_of (char *s, int c) |
2269 | is_one_of (char *s, int c) |
2238 | { |
2270 | { |
2239 | if (c == EOF) |
2271 | if (c == EOF) |
2240 | return 1; |
2272 | return 1; |
2241 | |
2273 | |
2242 | return !!strchr (s, c); |
2274 | return !!strchr (s, c); |
2243 | } |
2275 | } |
2244 | |
2276 | |
2245 | /* skip white characters */ |
2277 | /* skip white characters */ |
2246 | static INLINE int |
2278 | ecb_inline int |
2247 | skipspace (SCHEME_P) |
2279 | skipspace (SCHEME_P) |
2248 | { |
2280 | { |
2249 | int c, curr_line = 0; |
2281 | int c, curr_line = 0; |
2250 | |
2282 | |
2251 | do |
2283 | do |
… | |
… | |
2479 | { |
2511 | { |
2480 | p = SCHEME_V->strbuff; |
2512 | p = SCHEME_V->strbuff; |
2481 | |
2513 | |
2482 | if (f <= 1 || f == 10) /* f is the base for numbers if > 1 */ |
2514 | if (f <= 1 || f == 10) /* f is the base for numbers if > 1 */ |
2483 | { |
2515 | { |
2484 | if (num_is_integer (l)) |
2516 | if (is_integer (l)) |
2485 | xnum (p, ivalue_unchecked (l)); |
2517 | xnum (p, ivalue_unchecked (l)); |
2486 | #if USE_REAL |
2518 | #if USE_REAL |
2487 | else |
2519 | else |
2488 | { |
2520 | { |
2489 | snprintf (p, STRBUFFSIZE, "%.10g", rvalue_unchecked (l)); |
2521 | snprintf (p, STRBUFFSIZE, "%.10g", rvalue_unchecked (l)); |
… | |
… | |
2744 | return 0; |
2776 | return 0; |
2745 | } |
2777 | } |
2746 | else if (is_number (a)) |
2778 | else if (is_number (a)) |
2747 | { |
2779 | { |
2748 | if (is_number (b)) |
2780 | if (is_number (b)) |
2749 | if (num_is_integer (a) == num_is_integer (b)) |
|
|
2750 | return num_cmp (nvalue (a), nvalue (b)) == 0; |
2781 | return num_cmp (nvalue (a), nvalue (b)) == 0; |
2751 | |
2782 | |
2752 | return 0; |
2783 | return 0; |
2753 | } |
2784 | } |
2754 | else if (is_character (a)) |
2785 | else if (is_character (a)) |
2755 | { |
2786 | { |
… | |
… | |
2822 | |
2853 | |
2823 | SCHEME_V->envir = immutable_cons (new_frame, old_env); |
2854 | SCHEME_V->envir = immutable_cons (new_frame, old_env); |
2824 | setenvironment (SCHEME_V->envir); |
2855 | setenvironment (SCHEME_V->envir); |
2825 | } |
2856 | } |
2826 | |
2857 | |
2827 | static INLINE void |
2858 | ecb_inline void |
2828 | new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) |
2859 | new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) |
2829 | { |
2860 | { |
2830 | pointer slot = immutable_cons (variable, value); |
2861 | pointer slot = immutable_cons (variable, value); |
2831 | |
2862 | |
2832 | if (is_vector (car (env))) |
2863 | if (is_vector (car (env))) |
2833 | { |
2864 | { |
2834 | int location = hash_fn (symname (variable), veclength (car (env))); |
2865 | int location = hash_fn (symname (variable), veclength (car (env))); |
2835 | |
2866 | |
2836 | set_vector_elem (car (env), location, immutable_cons (slot, vector_elem (car (env), location))); |
2867 | vector_set (car (env), location, immutable_cons (slot, vector_get (car (env), location))); |
2837 | } |
2868 | } |
2838 | else |
2869 | else |
2839 | set_car (env, immutable_cons (slot, car (env))); |
2870 | set_car (env, immutable_cons (slot, car (env))); |
2840 | } |
2871 | } |
2841 | |
2872 | |
… | |
… | |
2848 | for (x = env; x != NIL; x = cdr (x)) |
2879 | for (x = env; x != NIL; x = cdr (x)) |
2849 | { |
2880 | { |
2850 | if (is_vector (car (x))) |
2881 | if (is_vector (car (x))) |
2851 | { |
2882 | { |
2852 | location = hash_fn (symname (hdl), veclength (car (x))); |
2883 | location = hash_fn (symname (hdl), veclength (car (x))); |
2853 | y = vector_elem (car (x), location); |
2884 | y = vector_get (car (x), location); |
2854 | } |
2885 | } |
2855 | else |
2886 | else |
2856 | y = car (x); |
2887 | y = car (x); |
2857 | |
2888 | |
2858 | for (; y != NIL; y = cdr (y)) |
2889 | for (; y != NIL; y = cdr (y)) |
2859 | if (caar (y) == hdl) |
2890 | if (caar (y) == hdl) |
2860 | break; |
2891 | break; |
2861 | |
2892 | |
2862 | if (y != NIL) |
2893 | if (y != NIL) |
|
|
2894 | return car (y); |
|
|
2895 | |
|
|
2896 | if (!all) |
2863 | break; |
2897 | break; |
2864 | |
|
|
2865 | if (!all) |
|
|
2866 | return NIL; |
|
|
2867 | } |
2898 | } |
2868 | |
|
|
2869 | if (x != NIL) |
|
|
2870 | return car (y); |
|
|
2871 | |
2899 | |
2872 | return NIL; |
2900 | return NIL; |
2873 | } |
2901 | } |
2874 | |
2902 | |
2875 | #else /* USE_ALIST_ENV */ |
2903 | #else /* USE_ALIST_ENV */ |
2876 | |
2904 | |
2877 | static INLINE void |
2905 | ecb_inline void |
2878 | new_frame_in_env (SCHEME_P_ pointer old_env) |
2906 | new_frame_in_env (SCHEME_P_ pointer old_env) |
2879 | { |
2907 | { |
2880 | SCHEME_V->envir = immutable_cons (NIL, old_env); |
2908 | SCHEME_V->envir = immutable_cons (NIL, old_env); |
2881 | setenvironment (SCHEME_V->envir); |
2909 | setenvironment (SCHEME_V->envir); |
2882 | } |
2910 | } |
2883 | |
2911 | |
2884 | static INLINE void |
2912 | ecb_inline void |
2885 | 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) |
2886 | { |
2914 | { |
2887 | set_car (env, immutable_cons (immutable_cons (variable, value), car (env))); |
2915 | set_car (env, immutable_cons (immutable_cons (variable, value), car (env))); |
2888 | } |
2916 | } |
2889 | |
2917 | |
… | |
… | |
2911 | return NIL; |
2939 | return NIL; |
2912 | } |
2940 | } |
2913 | |
2941 | |
2914 | #endif /* USE_ALIST_ENV else */ |
2942 | #endif /* USE_ALIST_ENV else */ |
2915 | |
2943 | |
2916 | static INLINE void |
2944 | ecb_inline void |
2917 | new_slot_in_env (SCHEME_P_ pointer variable, pointer value) |
2945 | new_slot_in_env (SCHEME_P_ pointer variable, pointer value) |
2918 | { |
2946 | { |
2919 | new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value); |
2947 | new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value); |
2920 | } |
2948 | } |
2921 | |
2949 | |
2922 | static INLINE void |
2950 | ecb_inline void |
2923 | set_slot_in_env (SCHEME_P_ pointer slot, pointer value) |
2951 | set_slot_in_env (SCHEME_P_ pointer slot, pointer value) |
2924 | { |
2952 | { |
2925 | set_cdr (slot, value); |
2953 | set_cdr (slot, value); |
2926 | } |
2954 | } |
2927 | |
2955 | |
2928 | static INLINE pointer |
2956 | ecb_inline pointer |
2929 | slot_value_in_env (pointer slot) |
2957 | slot_value_in_env (pointer slot) |
2930 | { |
2958 | { |
2931 | return cdr (slot); |
2959 | return cdr (slot); |
2932 | } |
2960 | } |
2933 | |
2961 | |
2934 | /* ========== Evaluation Cycle ========== */ |
2962 | /* ========== Evaluation Cycle ========== */ |
2935 | |
2963 | |
2936 | static pointer |
2964 | static int |
2937 | xError_1 (SCHEME_P_ const char *s, pointer a) |
2965 | xError_1 (SCHEME_P_ const char *s, pointer a) |
2938 | { |
2966 | { |
2939 | #if USE_ERROR_HOOK |
2967 | #if USE_ERROR_HOOK |
2940 | pointer x; |
2968 | pointer x; |
2941 | pointer hdl = SCHEME_V->ERROR_HOOK; |
2969 | pointer hdl = SCHEME_V->ERROR_HOOK; |
… | |
… | |
2976 | code = cons (mk_string (SCHEME_A_ s), code); |
3004 | code = cons (mk_string (SCHEME_A_ s), code); |
2977 | setimmutable (car (code)); |
3005 | setimmutable (car (code)); |
2978 | SCHEME_V->code = cons (slot_value_in_env (x), code); |
3006 | SCHEME_V->code = cons (slot_value_in_env (x), code); |
2979 | SCHEME_V->op = OP_EVAL; |
3007 | SCHEME_V->op = OP_EVAL; |
2980 | |
3008 | |
2981 | return S_T; |
3009 | return 0; |
2982 | } |
3010 | } |
2983 | #endif |
3011 | #endif |
2984 | |
3012 | |
2985 | if (a) |
3013 | if (a) |
2986 | SCHEME_V->args = cons (a, NIL); |
3014 | SCHEME_V->args = cons (a, NIL); |
… | |
… | |
2988 | SCHEME_V->args = NIL; |
3016 | SCHEME_V->args = NIL; |
2989 | |
3017 | |
2990 | SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args); |
3018 | SCHEME_V->args = cons (mk_string (SCHEME_A_ s), SCHEME_V->args); |
2991 | setimmutable (car (SCHEME_V->args)); |
3019 | setimmutable (car (SCHEME_V->args)); |
2992 | SCHEME_V->op = OP_ERR0; |
3020 | SCHEME_V->op = OP_ERR0; |
|
|
3021 | |
2993 | return S_T; |
3022 | return 0; |
2994 | } |
3023 | } |
2995 | |
3024 | |
2996 | #define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a) |
3025 | #define Error_1(s, a) return xError_1(SCHEME_A_ USE_ERROR_CHECKING ? s : "", a) |
2997 | #define Error_0(s) Error_1 (s, 0) |
3026 | #define Error_0(s) Error_1 (s, 0) |
2998 | |
3027 | |
2999 | /* Too small to turn into function */ |
3028 | /* Too small to turn into function */ |
3000 | #define BEGIN do { |
3029 | #define BEGIN do { |
3001 | #define END } while (0) |
3030 | #define END } while (0) |
3002 | #define s_goto(a) BEGIN \ |
3031 | #define s_goto(a) BEGIN \ |
3003 | SCHEME_V->op = a; \ |
3032 | SCHEME_V->op = a; \ |
3004 | return S_T; END |
3033 | return 0; END |
3005 | |
3034 | |
3006 | #define s_return(a) return xs_return (SCHEME_A_ a) |
3035 | #define s_return(a) return xs_return (SCHEME_A_ a) |
3007 | |
3036 | |
3008 | #ifndef USE_SCHEME_STACK |
3037 | #ifndef USE_SCHEME_STACK |
3009 | |
3038 | |
… | |
… | |
3039 | next_frame->code = code; |
3068 | next_frame->code = code; |
3040 | |
3069 | |
3041 | SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1); |
3070 | SCHEME_V->dump = (pointer)(uintptr_t)(nframes + 1); |
3042 | } |
3071 | } |
3043 | |
3072 | |
3044 | static pointer |
3073 | static int |
3045 | xs_return (SCHEME_P_ pointer a) |
3074 | xs_return (SCHEME_P_ pointer a) |
3046 | { |
3075 | { |
3047 | int nframes = (uintptr_t)SCHEME_V->dump; |
3076 | int nframes = (uintptr_t)SCHEME_V->dump; |
3048 | struct dump_stack_frame *frame; |
3077 | struct dump_stack_frame *frame; |
3049 | |
3078 | |
3050 | SCHEME_V->value = a; |
3079 | SCHEME_V->value = a; |
3051 | |
3080 | |
3052 | if (nframes <= 0) |
3081 | if (nframes <= 0) |
3053 | return NIL; |
3082 | return -1; |
3054 | |
3083 | |
3055 | frame = &SCHEME_V->dump_base[--nframes]; |
3084 | frame = &SCHEME_V->dump_base[--nframes]; |
3056 | SCHEME_V->op = frame->op; |
3085 | SCHEME_V->op = frame->op; |
3057 | SCHEME_V->args = frame->args; |
3086 | SCHEME_V->args = frame->args; |
3058 | SCHEME_V->envir = frame->envir; |
3087 | SCHEME_V->envir = frame->envir; |
3059 | SCHEME_V->code = frame->code; |
3088 | SCHEME_V->code = frame->code; |
3060 | SCHEME_V->dump = (pointer)(uintptr_t)nframes; |
3089 | SCHEME_V->dump = (pointer)(uintptr_t)nframes; |
3061 | |
3090 | |
3062 | return S_T; |
3091 | return 0; |
3063 | } |
3092 | } |
3064 | |
3093 | |
3065 | static INLINE void |
3094 | ecb_inline void |
3066 | dump_stack_reset (SCHEME_P) |
3095 | dump_stack_reset (SCHEME_P) |
3067 | { |
3096 | { |
3068 | /* in this implementation, SCHEME_V->dump is the number of frames on the stack */ |
3097 | /* in this implementation, SCHEME_V->dump is the number of frames on the stack */ |
3069 | SCHEME_V->dump = (pointer)+0; |
3098 | SCHEME_V->dump = (pointer)+0; |
3070 | } |
3099 | } |
3071 | |
3100 | |
3072 | static INLINE void |
3101 | ecb_inline void |
3073 | dump_stack_initialize (SCHEME_P) |
3102 | dump_stack_initialize (SCHEME_P) |
3074 | { |
3103 | { |
3075 | SCHEME_V->dump_size = 0; |
3104 | SCHEME_V->dump_size = 0; |
3076 | SCHEME_V->dump_base = 0; |
3105 | SCHEME_V->dump_base = 0; |
3077 | dump_stack_reset (SCHEME_A); |
3106 | dump_stack_reset (SCHEME_A); |
… | |
… | |
3130 | int i = 0; |
3159 | int i = 0; |
3131 | struct dump_stack_frame *frame = SCHEME_V->dump_base; |
3160 | struct dump_stack_frame *frame = SCHEME_V->dump_base; |
3132 | |
3161 | |
3133 | while (cont != NIL) |
3162 | while (cont != NIL) |
3134 | { |
3163 | { |
3135 | frame->op = ivalue (car (cont)); cont = cdr (cont); |
3164 | frame->op = ivalue_unchecked (car (cont)); cont = cdr (cont); |
3136 | frame->args = car (cont) ; cont = cdr (cont); |
3165 | frame->args = car (cont) ; cont = cdr (cont); |
3137 | frame->envir = car (cont) ; cont = cdr (cont); |
3166 | frame->envir = car (cont) ; cont = cdr (cont); |
3138 | frame->code = car (cont) ; cont = cdr (cont); |
3167 | frame->code = car (cont) ; cont = cdr (cont); |
3139 | |
3168 | |
3140 | ++frame; |
3169 | ++frame; |
3141 | ++i; |
3170 | ++i; |
3142 | } |
3171 | } |
3143 | |
3172 | |
3144 | SCHEME_V->dump = (pointer)(uintptr_t)i; |
3173 | SCHEME_V->dump = (pointer)(uintptr_t)i; |
3145 | } |
3174 | } |
3146 | |
3175 | |
3147 | #else |
3176 | #else |
3148 | |
3177 | |
3149 | static INLINE void |
3178 | ecb_inline void |
3150 | dump_stack_reset (SCHEME_P) |
3179 | dump_stack_reset (SCHEME_P) |
3151 | { |
3180 | { |
3152 | SCHEME_V->dump = NIL; |
3181 | SCHEME_V->dump = NIL; |
3153 | } |
3182 | } |
3154 | |
3183 | |
3155 | static INLINE void |
3184 | ecb_inline void |
3156 | dump_stack_initialize (SCHEME_P) |
3185 | dump_stack_initialize (SCHEME_P) |
3157 | { |
3186 | { |
3158 | dump_stack_reset (SCHEME_A); |
3187 | dump_stack_reset (SCHEME_A); |
3159 | } |
3188 | } |
3160 | |
3189 | |
… | |
… | |
3162 | dump_stack_free (SCHEME_P) |
3191 | dump_stack_free (SCHEME_P) |
3163 | { |
3192 | { |
3164 | SCHEME_V->dump = NIL; |
3193 | SCHEME_V->dump = NIL; |
3165 | } |
3194 | } |
3166 | |
3195 | |
3167 | static pointer |
3196 | static int |
3168 | xs_return (SCHEME_P_ pointer a) |
3197 | xs_return (SCHEME_P_ pointer a) |
3169 | { |
3198 | { |
3170 | pointer dump = SCHEME_V->dump; |
3199 | pointer dump = SCHEME_V->dump; |
3171 | |
3200 | |
3172 | SCHEME_V->value = a; |
3201 | SCHEME_V->value = a; |
3173 | |
3202 | |
3174 | if (dump == NIL) |
3203 | if (dump == NIL) |
3175 | return NIL; |
3204 | return -1; |
3176 | |
3205 | |
3177 | SCHEME_V->op = ivalue (car (dump)); dump = cdr (dump); |
3206 | SCHEME_V->op = ivalue_unchecked (car (dump)); dump = cdr (dump); |
3178 | SCHEME_V->args = car (dump) ; dump = cdr (dump); |
3207 | SCHEME_V->args = car (dump) ; dump = cdr (dump); |
3179 | SCHEME_V->envir = car (dump) ; dump = cdr (dump); |
3208 | SCHEME_V->envir = car (dump) ; dump = cdr (dump); |
3180 | SCHEME_V->code = car (dump) ; dump = cdr (dump); |
3209 | SCHEME_V->code = car (dump) ; dump = cdr (dump); |
3181 | |
3210 | |
3182 | SCHEME_V->dump = dump; |
3211 | SCHEME_V->dump = dump; |
3183 | |
3212 | |
3184 | return S_T; |
3213 | return 0; |
3185 | } |
3214 | } |
3186 | |
3215 | |
3187 | static void |
3216 | static void |
3188 | s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code) |
3217 | s_save (SCHEME_P_ enum scheme_opcodes op, pointer args, pointer code) |
3189 | { |
3218 | { |
… | |
… | |
3214 | |
3243 | |
3215 | #endif |
3244 | #endif |
3216 | |
3245 | |
3217 | #define s_retbool(tf) s_return ((tf) ? S_T : S_F) |
3246 | #define s_retbool(tf) s_return ((tf) ? S_T : S_F) |
3218 | |
3247 | |
3219 | static pointer |
3248 | static int |
3220 | opexe_0 (SCHEME_P_ enum scheme_opcodes op) |
3249 | opexe_0 (SCHEME_P_ enum scheme_opcodes op) |
3221 | { |
3250 | { |
3222 | pointer args = SCHEME_V->args; |
3251 | pointer args = SCHEME_V->args; |
3223 | pointer x, y; |
3252 | pointer x, y; |
3224 | |
3253 | |
… | |
… | |
3391 | |
3420 | |
3392 | case OP_TRACING: |
3421 | case OP_TRACING: |
3393 | { |
3422 | { |
3394 | int tr = SCHEME_V->tracing; |
3423 | int tr = SCHEME_V->tracing; |
3395 | |
3424 | |
3396 | SCHEME_V->tracing = ivalue (car (args)); |
3425 | SCHEME_V->tracing = ivalue_unchecked (car (args)); |
3397 | s_return (mk_integer (SCHEME_A_ tr)); |
3426 | s_return (mk_integer (SCHEME_A_ tr)); |
3398 | } |
3427 | } |
3399 | |
3428 | |
3400 | #endif |
3429 | #endif |
3401 | |
3430 | |
… | |
… | |
3413 | /* fall through */ |
3442 | /* fall through */ |
3414 | |
3443 | |
3415 | case OP_REAL_APPLY: |
3444 | case OP_REAL_APPLY: |
3416 | #endif |
3445 | #endif |
3417 | if (is_proc (SCHEME_V->code)) |
3446 | if (is_proc (SCHEME_V->code)) |
3418 | { |
|
|
3419 | s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */ |
3447 | s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */ |
3420 | } |
|
|
3421 | else if (is_foreign (SCHEME_V->code)) |
3448 | else if (is_foreign (SCHEME_V->code)) |
3422 | { |
3449 | { |
3423 | /* Keep nested calls from GC'ing the arglist */ |
3450 | /* Keep nested calls from GC'ing the arglist */ |
3424 | push_recent_alloc (SCHEME_A_ args, NIL); |
3451 | push_recent_alloc (SCHEME_A_ args, NIL); |
3425 | x = SCHEME_V->code->object.ff (SCHEME_A_ args); |
3452 | x = SCHEME_V->code->object.ff (SCHEME_A_ args); |
… | |
… | |
3592 | |
3619 | |
3593 | case OP_IF1: /* if */ |
3620 | case OP_IF1: /* if */ |
3594 | if (is_true (SCHEME_V->value)) |
3621 | if (is_true (SCHEME_V->value)) |
3595 | SCHEME_V->code = car (SCHEME_V->code); |
3622 | SCHEME_V->code = car (SCHEME_V->code); |
3596 | else |
3623 | else |
3597 | SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because |
3624 | SCHEME_V->code = cadr (SCHEME_V->code); /* (if #f 1) ==> () because * car(NIL) = NIL */ |
3598 | |
|
|
3599 | * car(NIL) = NIL */ |
|
|
3600 | s_goto (OP_EVAL); |
3625 | s_goto (OP_EVAL); |
3601 | |
3626 | |
3602 | case OP_LET0: /* let */ |
3627 | case OP_LET0: /* let */ |
3603 | SCHEME_V->args = NIL; |
3628 | SCHEME_V->args = NIL; |
3604 | SCHEME_V->value = SCHEME_V->code; |
3629 | SCHEME_V->value = SCHEME_V->code; |
… | |
… | |
3914 | SCHEME_V->code = car (args); |
3939 | SCHEME_V->code = car (args); |
3915 | SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL); |
3940 | SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL); |
3916 | s_goto (OP_APPLY); |
3941 | s_goto (OP_APPLY); |
3917 | } |
3942 | } |
3918 | |
3943 | |
3919 | abort (); |
3944 | if (USE_ERROR_CHECKING) abort (); |
3920 | } |
3945 | } |
3921 | |
3946 | |
3922 | static pointer |
3947 | static int |
3923 | opexe_2 (SCHEME_P_ enum scheme_opcodes op) |
3948 | opexe_1 (SCHEME_P_ enum scheme_opcodes op) |
3924 | { |
3949 | { |
3925 | pointer args = SCHEME_V->args; |
3950 | pointer args = SCHEME_V->args; |
3926 | pointer x = car (args); |
3951 | pointer x = car (args); |
3927 | num v; |
3952 | num v; |
3928 | |
3953 | |
3929 | #if USE_MATH |
|
|
3930 | RVALUE dd; |
|
|
3931 | #endif |
|
|
3932 | |
|
|
3933 | switch (op) |
3954 | switch (op) |
3934 | { |
3955 | { |
3935 | #if USE_MATH |
3956 | #if USE_MATH |
3936 | case OP_INEX2EX: /* inexact->exact */ |
3957 | case OP_INEX2EX: /* inexact->exact */ |
|
|
3958 | { |
3937 | if (num_is_integer (x)) |
3959 | if (is_integer (x)) |
3938 | s_return (x); |
3960 | s_return (x); |
3939 | else if (modf (rvalue_unchecked (x), &dd) == 0) |
3961 | |
|
|
3962 | RVALUE r = rvalue_unchecked (x); |
|
|
3963 | |
|
|
3964 | if (r == (RVALUE)(IVALUE)r) |
3940 | s_return (mk_integer (SCHEME_A_ ivalue (x))); |
3965 | s_return (mk_integer (SCHEME_A_ rvalue_unchecked (x))); |
3941 | else |
3966 | else |
3942 | Error_1 ("inexact->exact: not integral:", x); |
3967 | Error_1 ("inexact->exact: not integral:", x); |
|
|
3968 | } |
3943 | |
3969 | |
3944 | case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x)))); |
3970 | case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x)))); |
3945 | case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x)))); |
3971 | case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x)))); |
3946 | case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x)))); |
3972 | case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x)))); |
3947 | case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x)))); |
3973 | case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x)))); |
… | |
… | |
3965 | { |
3991 | { |
3966 | RVALUE result; |
3992 | RVALUE result; |
3967 | int real_result = 1; |
3993 | int real_result = 1; |
3968 | pointer y = cadr (args); |
3994 | pointer y = cadr (args); |
3969 | |
3995 | |
3970 | if (num_is_integer (x) && num_is_integer (y)) |
3996 | if (is_integer (x) && is_integer (y)) |
3971 | real_result = 0; |
3997 | real_result = 0; |
3972 | |
3998 | |
3973 | /* This 'if' is an R5RS compatibility fix. */ |
3999 | /* This 'if' is an R5RS compatibility fix. */ |
3974 | /* NOTE: Remove this 'if' fix for R6RS. */ |
4000 | /* NOTE: Remove this 'if' fix for R6RS. */ |
3975 | if (rvalue (x) == 0 && rvalue (y) < 0) |
4001 | if (rvalue (x) == 0 && rvalue (y) < 0) |
… | |
… | |
3981 | /* If the test fails, result is too big for integer. */ |
4007 | /* If the test fails, result is too big for integer. */ |
3982 | if (!real_result) |
4008 | if (!real_result) |
3983 | { |
4009 | { |
3984 | long result_as_long = result; |
4010 | long result_as_long = result; |
3985 | |
4011 | |
3986 | if (result != (RVALUE) result_as_long) |
4012 | if (result != result_as_long) |
3987 | real_result = 1; |
4013 | real_result = 1; |
3988 | } |
4014 | } |
3989 | |
4015 | |
3990 | if (real_result) |
4016 | if (real_result) |
3991 | s_return (mk_real (SCHEME_A_ result)); |
4017 | s_return (mk_real (SCHEME_A_ result)); |
… | |
… | |
3996 | case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x)))); |
4022 | case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x)))); |
3997 | case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x)))); |
4023 | case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x)))); |
3998 | |
4024 | |
3999 | case OP_TRUNCATE: |
4025 | case OP_TRUNCATE: |
4000 | { |
4026 | { |
4001 | RVALUE rvalue_of_x; |
4027 | RVALUE n = rvalue (x); |
4002 | |
|
|
4003 | rvalue_of_x = rvalue (x); |
|
|
4004 | |
|
|
4005 | if (rvalue_of_x > 0) |
|
|
4006 | s_return (mk_real (SCHEME_A_ floor (rvalue_of_x))); |
4028 | s_return (mk_real (SCHEME_A_ n > 0 ? floor (n) : ceil (n))); |
4007 | else |
|
|
4008 | s_return (mk_real (SCHEME_A_ ceil (rvalue_of_x))); |
|
|
4009 | } |
4029 | } |
4010 | |
4030 | |
4011 | case OP_ROUND: |
4031 | case OP_ROUND: |
4012 | if (num_is_integer (x)) |
4032 | if (is_integer (x)) |
4013 | s_return (x); |
4033 | s_return (x); |
4014 | |
4034 | |
4015 | s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x)))); |
4035 | s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x)))); |
4016 | #endif |
4036 | #endif |
4017 | |
4037 | |
4018 | case OP_ADD: /* + */ |
4038 | case OP_ADD: /* + */ |
4019 | v = num_zero; |
4039 | v = num_zero; |
4020 | |
4040 | |
4021 | for (x = args; x != NIL; x = cdr (x)) |
4041 | for (x = args; x != NIL; x = cdr (x)) |
4022 | v = num_op ('+', v, nvalue (car (x))); |
4042 | v = num_op (NUM_ADD, v, nvalue (car (x))); |
4023 | |
4043 | |
4024 | s_return (mk_number (SCHEME_A_ v)); |
4044 | s_return (mk_number (SCHEME_A_ v)); |
4025 | |
4045 | |
4026 | case OP_MUL: /* * */ |
4046 | case OP_MUL: /* * */ |
4027 | v = num_one; |
4047 | v = num_one; |
4028 | |
4048 | |
4029 | for (x = args; x != NIL; x = cdr (x)) |
4049 | for (x = args; x != NIL; x = cdr (x)) |
4030 | v = num_op ('+', v, nvalue (car (x))); |
4050 | v = num_op (NUM_MUL, v, nvalue (car (x))); |
4031 | |
4051 | |
4032 | s_return (mk_number (SCHEME_A_ v)); |
4052 | s_return (mk_number (SCHEME_A_ v)); |
4033 | |
4053 | |
4034 | case OP_SUB: /* - */ |
4054 | case OP_SUB: /* - */ |
4035 | if (cdr (args) == NIL) |
4055 | if (cdr (args) == NIL) |
… | |
… | |
4042 | x = cdr (args); |
4062 | x = cdr (args); |
4043 | v = nvalue (car (args)); |
4063 | v = nvalue (car (args)); |
4044 | } |
4064 | } |
4045 | |
4065 | |
4046 | for (; x != NIL; x = cdr (x)) |
4066 | for (; x != NIL; x = cdr (x)) |
4047 | v = num_op ('+', v, nvalue (car (x))); |
4067 | v = num_op (NUM_SUB, v, nvalue (car (x))); |
4048 | |
4068 | |
4049 | s_return (mk_number (SCHEME_A_ v)); |
4069 | s_return (mk_number (SCHEME_A_ v)); |
4050 | |
4070 | |
4051 | case OP_DIV: /* / */ |
4071 | case OP_DIV: /* / */ |
4052 | if (cdr (args) == NIL) |
4072 | if (cdr (args) == NIL) |
… | |
… | |
4059 | x = cdr (args); |
4079 | x = cdr (args); |
4060 | v = nvalue (car (args)); |
4080 | v = nvalue (car (args)); |
4061 | } |
4081 | } |
4062 | |
4082 | |
4063 | for (; x != NIL; x = cdr (x)) |
4083 | for (; x != NIL; x = cdr (x)) |
4064 | { |
|
|
4065 | if (!is_zero_rvalue (rvalue (car (x)))) |
4084 | if (!is_zero_rvalue (rvalue (car (x)))) |
4066 | v = num_div (v, nvalue (car (x))); |
4085 | v = num_div (v, nvalue (car (x))); |
4067 | else |
4086 | else |
4068 | Error_0 ("/: division by zero"); |
4087 | Error_0 ("/: division by zero"); |
4069 | } |
|
|
4070 | |
4088 | |
4071 | s_return (mk_number (SCHEME_A_ v)); |
4089 | s_return (mk_number (SCHEME_A_ v)); |
4072 | |
4090 | |
4073 | case OP_INTDIV: /* quotient */ |
4091 | case OP_INTDIV: /* quotient */ |
4074 | if (cdr (args) == NIL) |
4092 | if (cdr (args) == NIL) |
… | |
… | |
4083 | } |
4101 | } |
4084 | |
4102 | |
4085 | for (; x != NIL; x = cdr (x)) |
4103 | for (; x != NIL; x = cdr (x)) |
4086 | { |
4104 | { |
4087 | if (ivalue (car (x)) != 0) |
4105 | if (ivalue (car (x)) != 0) |
4088 | v = num_op ('/', v, nvalue (car (x))); |
4106 | v = num_op (NUM_INTDIV, v, nvalue (car (x))); |
4089 | else |
4107 | else |
4090 | Error_0 ("quotient: division by zero"); |
4108 | Error_0 ("quotient: division by zero"); |
4091 | } |
4109 | } |
4092 | |
4110 | |
4093 | s_return (mk_number (SCHEME_A_ v)); |
4111 | s_return (mk_number (SCHEME_A_ v)); |
… | |
… | |
4139 | } |
4157 | } |
4140 | else |
4158 | else |
4141 | Error_0 ("set-cdr!: unable to alter immutable pair"); |
4159 | Error_0 ("set-cdr!: unable to alter immutable pair"); |
4142 | |
4160 | |
4143 | case OP_CHAR2INT: /* char->integer */ |
4161 | case OP_CHAR2INT: /* char->integer */ |
4144 | s_return (mk_integer (SCHEME_A_ ivalue (x))); |
4162 | s_return (mk_integer (SCHEME_A_ ivalue_unchecked (x))); |
4145 | |
4163 | |
4146 | case OP_INT2CHAR: /* integer->char */ |
4164 | case OP_INT2CHAR: /* integer->char */ |
4147 | s_return (mk_character (SCHEME_A_ ivalue (x))); |
4165 | s_return (mk_character (SCHEME_A_ ivalue_unchecked (x))); |
4148 | |
4166 | |
4149 | case OP_CHARUPCASE: |
4167 | case OP_CHARUPCASE: |
4150 | { |
4168 | { |
4151 | unsigned char c = ivalue (x); |
4169 | unsigned char c = ivalue_unchecked (x); |
4152 | c = toupper (c); |
4170 | c = toupper (c); |
4153 | s_return (mk_character (SCHEME_A_ c)); |
4171 | s_return (mk_character (SCHEME_A_ c)); |
4154 | } |
4172 | } |
4155 | |
4173 | |
4156 | case OP_CHARDNCASE: |
4174 | case OP_CHARDNCASE: |
4157 | { |
4175 | { |
4158 | unsigned char c = ivalue (x); |
4176 | unsigned char c = ivalue_unchecked (x); |
4159 | c = tolower (c); |
4177 | c = tolower (c); |
4160 | s_return (mk_character (SCHEME_A_ c)); |
4178 | s_return (mk_character (SCHEME_A_ c)); |
4161 | } |
4179 | } |
4162 | |
4180 | |
4163 | case OP_STR2SYM: /* string->symbol */ |
4181 | case OP_STR2SYM: /* string->symbol */ |
… | |
… | |
4240 | Error_1 ("atom->string: not an atom:", x); |
4258 | Error_1 ("atom->string: not an atom:", x); |
4241 | } |
4259 | } |
4242 | |
4260 | |
4243 | case OP_MKSTRING: /* make-string */ |
4261 | case OP_MKSTRING: /* make-string */ |
4244 | { |
4262 | { |
4245 | int fill = ' '; |
4263 | int fill = cdr (args) != NIL ? charvalue (cadr (args)) : ' '; |
4246 | int len; |
|
|
4247 | |
|
|
4248 | len = ivalue (x); |
4264 | int len = ivalue_unchecked (x); |
4249 | |
|
|
4250 | if (cdr (args) != NIL) |
|
|
4251 | fill = charvalue (cadr (args)); |
|
|
4252 | |
4265 | |
4253 | s_return (mk_empty_string (SCHEME_A_ len, fill)); |
4266 | s_return (mk_empty_string (SCHEME_A_ len, fill)); |
4254 | } |
4267 | } |
4255 | |
4268 | |
4256 | case OP_STRLEN: /* string-length */ |
4269 | case OP_STRLEN: /* string-length */ |
4257 | s_return (mk_integer (SCHEME_A_ strlength (x))); |
4270 | s_return (mk_integer (SCHEME_A_ strlength (x))); |
4258 | |
4271 | |
4259 | case OP_STRREF: /* string-ref */ |
4272 | case OP_STRREF: /* string-ref */ |
4260 | { |
4273 | { |
4261 | char *str; |
|
|
4262 | int index; |
|
|
4263 | |
|
|
4264 | str = strvalue (x); |
4274 | char *str = strvalue (x); |
4265 | |
|
|
4266 | index = ivalue (cadr (args)); |
4275 | int index = ivalue_unchecked (cadr (args)); |
4267 | |
4276 | |
4268 | if (index >= strlength (x)) |
4277 | if (index >= strlength (x)) |
4269 | Error_1 ("string-ref: out of bounds:", cadr (args)); |
4278 | Error_1 ("string-ref: out of bounds:", cadr (args)); |
4270 | |
4279 | |
4271 | s_return (mk_character (SCHEME_A_ ((unsigned char *)str)[index])); |
4280 | s_return (mk_character (SCHEME_A_ ((unsigned char *)str)[index])); |
4272 | } |
4281 | } |
4273 | |
4282 | |
4274 | case OP_STRSET: /* string-set! */ |
4283 | case OP_STRSET: /* string-set! */ |
4275 | { |
4284 | { |
4276 | char *str; |
4285 | char *str = strvalue (x); |
4277 | int index; |
4286 | int index = ivalue_unchecked (cadr (args)); |
4278 | int c; |
4287 | int c; |
4279 | |
4288 | |
4280 | if (is_immutable (x)) |
4289 | if (is_immutable (x)) |
4281 | Error_1 ("string-set!: unable to alter immutable string:", x); |
4290 | Error_1 ("string-set!: unable to alter immutable string:", x); |
4282 | |
|
|
4283 | str = strvalue (x); |
|
|
4284 | |
|
|
4285 | index = ivalue (cadr (args)); |
|
|
4286 | |
4291 | |
4287 | if (index >= strlength (x)) |
4292 | if (index >= strlength (x)) |
4288 | Error_1 ("string-set!: out of bounds:", cadr (args)); |
4293 | Error_1 ("string-set!: out of bounds:", cadr (args)); |
4289 | |
4294 | |
4290 | c = charvalue (caddr (args)); |
4295 | c = charvalue (caddr (args)); |
… | |
… | |
4313 | s_return (newstr); |
4318 | s_return (newstr); |
4314 | } |
4319 | } |
4315 | |
4320 | |
4316 | case OP_SUBSTR: /* substring */ |
4321 | case OP_SUBSTR: /* substring */ |
4317 | { |
4322 | { |
4318 | char *str; |
4323 | char *str = strvalue (x); |
4319 | int index0; |
4324 | int index0 = ivalue_unchecked (cadr (args)); |
4320 | int index1; |
4325 | int index1; |
4321 | int len; |
4326 | int len; |
4322 | |
4327 | |
4323 | str = strvalue (x); |
|
|
4324 | |
|
|
4325 | index0 = ivalue (cadr (args)); |
|
|
4326 | |
|
|
4327 | if (index0 > strlength (x)) |
4328 | if (index0 > strlength (x)) |
4328 | Error_1 ("substring: start out of bounds:", cadr (args)); |
4329 | Error_1 ("substring: start out of bounds:", cadr (args)); |
4329 | |
4330 | |
4330 | if (cddr (args) != NIL) |
4331 | if (cddr (args) != NIL) |
4331 | { |
4332 | { |
4332 | index1 = ivalue (caddr (args)); |
4333 | index1 = ivalue_unchecked (caddr (args)); |
4333 | |
4334 | |
4334 | if (index1 > strlength (x) || index1 < index0) |
4335 | if (index1 > strlength (x) || index1 < index0) |
4335 | Error_1 ("substring: end out of bounds:", caddr (args)); |
4336 | Error_1 ("substring: end out of bounds:", caddr (args)); |
4336 | } |
4337 | } |
4337 | else |
4338 | else |
… | |
… | |
4360 | if (SCHEME_V->no_memory) |
4361 | if (SCHEME_V->no_memory) |
4361 | s_return (S_SINK); |
4362 | s_return (S_SINK); |
4362 | #endif |
4363 | #endif |
4363 | |
4364 | |
4364 | for (x = args, i = 0; is_pair (x); x = cdr (x), i++) |
4365 | for (x = args, i = 0; is_pair (x); x = cdr (x), i++) |
4365 | set_vector_elem (vec, i, car (x)); |
4366 | vector_set (vec, i, car (x)); |
4366 | |
4367 | |
4367 | s_return (vec); |
4368 | s_return (vec); |
4368 | } |
4369 | } |
4369 | |
4370 | |
4370 | case OP_MKVECTOR: /* make-vector */ |
4371 | case OP_MKVECTOR: /* make-vector */ |
4371 | { |
4372 | { |
4372 | pointer fill = NIL; |
4373 | pointer fill = NIL; |
4373 | int len; |
|
|
4374 | pointer vec; |
4374 | pointer vec; |
4375 | |
|
|
4376 | len = ivalue (x); |
4375 | int len = ivalue_unchecked (x); |
4377 | |
4376 | |
4378 | if (cdr (args) != NIL) |
4377 | if (cdr (args) != NIL) |
4379 | fill = cadr (args); |
4378 | fill = cadr (args); |
4380 | |
4379 | |
4381 | vec = mk_vector (SCHEME_A_ len); |
4380 | vec = mk_vector (SCHEME_A_ len); |
… | |
… | |
4384 | if (SCHEME_V->no_memory) |
4383 | if (SCHEME_V->no_memory) |
4385 | s_return (S_SINK); |
4384 | s_return (S_SINK); |
4386 | #endif |
4385 | #endif |
4387 | |
4386 | |
4388 | if (fill != NIL) |
4387 | if (fill != NIL) |
4389 | fill_vector (vec, fill); |
4388 | fill_vector (vec, 0, fill); |
4390 | |
4389 | |
4391 | s_return (vec); |
4390 | s_return (vec); |
4392 | } |
4391 | } |
4393 | |
4392 | |
4394 | case OP_VECLEN: /* vector-length */ |
4393 | case OP_VECLEN: /* vector-length */ |
4395 | s_return (mk_integer (SCHEME_A_ veclength (x))); |
4394 | s_return (mk_integer (SCHEME_A_ veclength (x))); |
4396 | |
4395 | |
4397 | case OP_VECREF: /* vector-ref */ |
4396 | case OP_VECREF: /* vector-ref */ |
4398 | { |
4397 | { |
4399 | int index; |
|
|
4400 | |
|
|
4401 | index = ivalue (cadr (args)); |
4398 | int index = ivalue_unchecked (cadr (args)); |
4402 | |
4399 | |
4403 | if (index >= veclength (car (args)) && USE_ERROR_CHECKING) |
4400 | if (index >= veclength (car (args)) && USE_ERROR_CHECKING) |
4404 | Error_1 ("vector-ref: out of bounds:", cadr (args)); |
4401 | Error_1 ("vector-ref: out of bounds:", cadr (args)); |
4405 | |
4402 | |
4406 | s_return (vector_elem (x, index)); |
4403 | s_return (vector_get (x, index)); |
4407 | } |
4404 | } |
4408 | |
4405 | |
4409 | case OP_VECSET: /* vector-set! */ |
4406 | case OP_VECSET: /* vector-set! */ |
4410 | { |
4407 | { |
4411 | int index; |
4408 | int index = ivalue_unchecked (cadr (args)); |
4412 | |
4409 | |
4413 | if (is_immutable (x)) |
4410 | if (is_immutable (x)) |
4414 | Error_1 ("vector-set!: unable to alter immutable vector:", x); |
4411 | Error_1 ("vector-set!: unable to alter immutable vector:", x); |
4415 | |
4412 | |
4416 | index = ivalue (cadr (args)); |
|
|
4417 | |
|
|
4418 | if (index >= veclength (car (args)) && USE_ERROR_CHECKING) |
4413 | if (index >= veclength (car (args)) && USE_ERROR_CHECKING) |
4419 | Error_1 ("vector-set!: out of bounds:", cadr (args)); |
4414 | Error_1 ("vector-set!: out of bounds:", cadr (args)); |
4420 | |
4415 | |
4421 | set_vector_elem (x, index, caddr (args)); |
4416 | vector_set (x, index, caddr (args)); |
4422 | s_return (x); |
4417 | s_return (x); |
4423 | } |
4418 | } |
4424 | } |
4419 | } |
4425 | |
4420 | |
4426 | return S_T; |
4421 | if (USE_ERROR_CHECKING) abort (); |
4427 | } |
4422 | } |
4428 | |
4423 | |
4429 | INTERFACE int |
|
|
4430 | is_list (SCHEME_P_ pointer a) |
|
|
4431 | { |
|
|
4432 | return list_length (SCHEME_A_ a) >= 0; |
|
|
4433 | } |
|
|
4434 | |
|
|
4435 | /* Result is: |
|
|
4436 | proper list: length |
|
|
4437 | circular list: -1 |
|
|
4438 | not even a pair: -2 |
|
|
4439 | dotted list: -2 minus length before dot |
|
|
4440 | */ |
|
|
4441 | INTERFACE int |
|
|
4442 | list_length (SCHEME_P_ pointer a) |
|
|
4443 | { |
|
|
4444 | int i = 0; |
|
|
4445 | pointer slow, fast; |
|
|
4446 | |
|
|
4447 | slow = fast = a; |
|
|
4448 | |
|
|
4449 | while (1) |
|
|
4450 | { |
|
|
4451 | if (fast == NIL) |
|
|
4452 | return i; |
|
|
4453 | |
|
|
4454 | if (!is_pair (fast)) |
|
|
4455 | return -2 - i; |
|
|
4456 | |
|
|
4457 | fast = cdr (fast); |
|
|
4458 | ++i; |
|
|
4459 | |
|
|
4460 | if (fast == NIL) |
|
|
4461 | return i; |
|
|
4462 | |
|
|
4463 | if (!is_pair (fast)) |
|
|
4464 | return -2 - i; |
|
|
4465 | |
|
|
4466 | ++i; |
|
|
4467 | fast = cdr (fast); |
|
|
4468 | |
|
|
4469 | /* Safe because we would have already returned if `fast' |
|
|
4470 | encountered a non-pair. */ |
|
|
4471 | slow = cdr (slow); |
|
|
4472 | |
|
|
4473 | if (fast == slow) |
|
|
4474 | { |
|
|
4475 | /* the fast pointer has looped back around and caught up |
|
|
4476 | with the slow pointer, hence the structure is circular, |
|
|
4477 | not of finite length, and therefore not a list */ |
|
|
4478 | return -1; |
|
|
4479 | } |
|
|
4480 | } |
|
|
4481 | } |
|
|
4482 | |
|
|
4483 | static pointer |
4424 | static int |
4484 | opexe_r (SCHEME_P_ enum scheme_opcodes op) |
4425 | opexe_2 (SCHEME_P_ enum scheme_opcodes op) |
4485 | { |
4426 | { |
4486 | pointer x = SCHEME_V->args; |
4427 | pointer x = SCHEME_V->args; |
4487 | |
4428 | |
4488 | for (;;) |
4429 | for (;;) |
4489 | { |
4430 | { |
… | |
… | |
4509 | } |
4450 | } |
4510 | |
4451 | |
4511 | s_return (S_T); |
4452 | s_return (S_T); |
4512 | } |
4453 | } |
4513 | |
4454 | |
4514 | static pointer |
4455 | static int |
4515 | opexe_3 (SCHEME_P_ enum scheme_opcodes op) |
4456 | opexe_3 (SCHEME_P_ enum scheme_opcodes op) |
4516 | { |
4457 | { |
4517 | pointer args = SCHEME_V->args; |
4458 | pointer args = SCHEME_V->args; |
4518 | pointer a = car (args); |
4459 | pointer a = car (args); |
4519 | pointer d = cdr (args); |
4460 | pointer d = cdr (args); |
… | |
… | |
4531 | case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break; |
4472 | case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break; |
4532 | case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */ |
4473 | case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */ |
4533 | case OP_CHARP: /* char? */ r = is_character (a) ; break; |
4474 | case OP_CHARP: /* char? */ r = is_character (a) ; break; |
4534 | |
4475 | |
4535 | #if USE_CHAR_CLASSIFIERS |
4476 | #if USE_CHAR_CLASSIFIERS |
4536 | case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue (a)); break; |
4477 | case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue_unchecked (a)); break; |
4537 | case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue (a)); break; |
4478 | case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue_unchecked (a)); break; |
4538 | case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue (a)); break; |
4479 | case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue_unchecked (a)); break; |
4539 | case OP_CHARUP: /* char-upper-case? */ r = Cisupper (ivalue (a)); break; |
4480 | case OP_CHARUP: /* char-upper-case? */ r = Cisupper (ivalue_unchecked (a)); break; |
4540 | case OP_CHARLP: /* char-lower-case? */ r = Cislower (ivalue (a)); break; |
4481 | case OP_CHARLP: /* char-lower-case? */ r = Cislower (ivalue_unchecked (a)); break; |
4541 | #endif |
4482 | #endif |
4542 | |
4483 | |
4543 | #if USE_PORTS |
4484 | #if USE_PORTS |
4544 | case OP_PORTP: /* port? */ r = is_port (a) ; break; |
4485 | case OP_PORTP: /* port? */ r = is_port (a) ; break; |
4545 | case OP_INPORTP: /* input-port? */ r = is_inport (a) ; break; |
4486 | case OP_INPORTP: /* input-port? */ r = is_inport (a) ; break; |
… | |
… | |
4565 | } |
4506 | } |
4566 | |
4507 | |
4567 | s_retbool (r); |
4508 | s_retbool (r); |
4568 | } |
4509 | } |
4569 | |
4510 | |
4570 | static pointer |
4511 | static int |
4571 | opexe_4 (SCHEME_P_ enum scheme_opcodes op) |
4512 | opexe_4 (SCHEME_P_ enum scheme_opcodes op) |
4572 | { |
4513 | { |
4573 | pointer args = SCHEME_V->args; |
4514 | pointer args = SCHEME_V->args; |
4574 | pointer a = car (args); |
4515 | pointer a = car (args); |
4575 | pointer x, y; |
4516 | pointer x, y; |
… | |
… | |
4661 | putstr (SCHEME_A_ "\n"); |
4602 | putstr (SCHEME_A_ "\n"); |
4662 | |
4603 | |
4663 | if (SCHEME_V->interactive_repl) |
4604 | if (SCHEME_V->interactive_repl) |
4664 | s_goto (OP_T0LVL); |
4605 | s_goto (OP_T0LVL); |
4665 | else |
4606 | else |
4666 | return NIL; |
4607 | return -1; |
4667 | } |
4608 | } |
4668 | |
4609 | |
4669 | case OP_REVERSE: /* reverse */ |
4610 | case OP_REVERSE: /* reverse */ |
4670 | s_return (reverse (SCHEME_A_ a)); |
4611 | s_return (reverse (SCHEME_A_ a)); |
4671 | |
4612 | |
… | |
… | |
4728 | |
4669 | |
4729 | case OP_QUIT: /* quit */ |
4670 | case OP_QUIT: /* quit */ |
4730 | if (is_pair (args)) |
4671 | if (is_pair (args)) |
4731 | SCHEME_V->retcode = ivalue (a); |
4672 | SCHEME_V->retcode = ivalue (a); |
4732 | |
4673 | |
4733 | return NIL; |
4674 | return -1; |
4734 | |
4675 | |
4735 | case OP_GC: /* gc */ |
4676 | case OP_GC: /* gc */ |
4736 | gc (SCHEME_A_ NIL, NIL); |
4677 | gc (SCHEME_A_ NIL, NIL); |
4737 | s_return (S_T); |
4678 | s_return (S_T); |
4738 | |
4679 | |
… | |
… | |
4746 | |
4687 | |
4747 | case OP_NEWSEGMENT: /* new-segment */ |
4688 | case OP_NEWSEGMENT: /* new-segment */ |
4748 | if (!is_pair (args) || !is_number (a)) |
4689 | if (!is_pair (args) || !is_number (a)) |
4749 | Error_0 ("new-segment: argument must be a number"); |
4690 | Error_0 ("new-segment: argument must be a number"); |
4750 | |
4691 | |
4751 | alloc_cellseg (SCHEME_A_ (int)ivalue (a)); |
4692 | alloc_cellseg (SCHEME_A_ ivalue (a)); |
4752 | |
4693 | |
4753 | s_return (S_T); |
4694 | s_return (S_T); |
4754 | |
4695 | |
4755 | case OP_OBLIST: /* oblist */ |
4696 | case OP_OBLIST: /* oblist */ |
4756 | s_return (oblist_all_symbols (SCHEME_A)); |
4697 | s_return (oblist_all_symbols (SCHEME_A)); |
… | |
… | |
4785 | break; |
4726 | break; |
4786 | } |
4727 | } |
4787 | |
4728 | |
4788 | p = port_from_filename (SCHEME_A_ strvalue (a), prop); |
4729 | p = port_from_filename (SCHEME_A_ strvalue (a), prop); |
4789 | |
4730 | |
4790 | if (p == NIL) |
4731 | s_return (p == NIL ? S_F : p); |
4791 | s_return (S_F); |
|
|
4792 | |
|
|
4793 | s_return (p); |
|
|
4794 | } |
4732 | } |
4795 | |
4733 | |
4796 | # if USE_STRING_PORTS |
4734 | # if USE_STRING_PORTS |
4797 | |
4735 | |
4798 | case OP_OPEN_INSTRING: /* open-input-string */ |
4736 | case OP_OPEN_INSTRING: /* open-input-string */ |
… | |
… | |
4813 | } |
4751 | } |
4814 | |
4752 | |
4815 | p = port_from_string (SCHEME_A_ strvalue (a), |
4753 | p = port_from_string (SCHEME_A_ strvalue (a), |
4816 | strvalue (a) + strlength (a), prop); |
4754 | strvalue (a) + strlength (a), prop); |
4817 | |
4755 | |
4818 | if (p == NIL) |
4756 | s_return (p == NIL ? S_F : p); |
4819 | s_return (S_F); |
|
|
4820 | |
|
|
4821 | s_return (p); |
|
|
4822 | } |
4757 | } |
4823 | |
4758 | |
4824 | case OP_OPEN_OUTSTRING: /* open-output-string */ |
4759 | case OP_OPEN_OUTSTRING: /* open-output-string */ |
4825 | { |
4760 | { |
4826 | pointer p; |
4761 | pointer p; |
4827 | |
4762 | |
4828 | if (a == NIL) |
4763 | if (a == NIL) |
4829 | { |
|
|
4830 | p = port_from_scratch (SCHEME_A); |
4764 | p = port_from_scratch (SCHEME_A); |
4831 | |
|
|
4832 | if (p == NIL) |
|
|
4833 | s_return (S_F); |
|
|
4834 | } |
|
|
4835 | else |
4765 | else |
4836 | { |
|
|
4837 | p = port_from_string (SCHEME_A_ strvalue (a), |
4766 | p = port_from_string (SCHEME_A_ strvalue (a), |
4838 | strvalue (a) + strlength (a), port_output); |
4767 | strvalue (a) + strlength (a), port_output); |
4839 | |
4768 | |
4840 | if (p == NIL) |
4769 | s_return (p == NIL ? S_F : p); |
4841 | s_return (S_F); |
|
|
4842 | } |
|
|
4843 | |
|
|
4844 | s_return (p); |
|
|
4845 | } |
4770 | } |
4846 | |
4771 | |
4847 | case OP_GET_OUTSTRING: /* get-output-string */ |
4772 | case OP_GET_OUTSTRING: /* get-output-string */ |
4848 | { |
4773 | { |
4849 | port *p; |
4774 | port *p; |
… | |
… | |
4888 | case OP_CURR_ENV: /* current-environment */ |
4813 | case OP_CURR_ENV: /* current-environment */ |
4889 | s_return (SCHEME_V->envir); |
4814 | s_return (SCHEME_V->envir); |
4890 | |
4815 | |
4891 | } |
4816 | } |
4892 | |
4817 | |
4893 | abort (); |
4818 | if (USE_ERROR_CHECKING) abort (); |
4894 | } |
4819 | } |
4895 | |
4820 | |
4896 | static pointer |
4821 | static int |
4897 | opexe_5 (SCHEME_P_ enum scheme_opcodes op) |
4822 | opexe_5 (SCHEME_P_ enum scheme_opcodes op) |
4898 | { |
4823 | { |
|
|
4824 | pointer args = SCHEME_V->args; |
4899 | pointer x; |
4825 | pointer x; |
4900 | |
4826 | |
4901 | if (SCHEME_V->nesting != 0) |
4827 | if (SCHEME_V->nesting != 0) |
4902 | { |
4828 | { |
4903 | int n = SCHEME_V->nesting; |
4829 | int n = SCHEME_V->nesting; |
… | |
… | |
4910 | switch (op) |
4836 | switch (op) |
4911 | { |
4837 | { |
4912 | /* ========== reading part ========== */ |
4838 | /* ========== reading part ========== */ |
4913 | #if USE_PORTS |
4839 | #if USE_PORTS |
4914 | case OP_READ: |
4840 | case OP_READ: |
4915 | if (!is_pair (SCHEME_V->args)) |
4841 | if (!is_pair (args)) |
4916 | s_goto (OP_READ_INTERNAL); |
4842 | s_goto (OP_READ_INTERNAL); |
4917 | |
4843 | |
4918 | if (!is_inport (car (SCHEME_V->args))) |
4844 | if (!is_inport (car (args))) |
4919 | Error_1 ("read: not an input port:", car (SCHEME_V->args)); |
4845 | Error_1 ("read: not an input port:", car (args)); |
4920 | |
4846 | |
4921 | if (car (SCHEME_V->args) == SCHEME_V->inport) |
4847 | if (car (args) == SCHEME_V->inport) |
4922 | s_goto (OP_READ_INTERNAL); |
4848 | s_goto (OP_READ_INTERNAL); |
4923 | |
4849 | |
4924 | x = SCHEME_V->inport; |
4850 | x = SCHEME_V->inport; |
4925 | SCHEME_V->inport = car (SCHEME_V->args); |
4851 | SCHEME_V->inport = car (args); |
4926 | x = cons (x, NIL); |
4852 | x = cons (x, NIL); |
4927 | s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); |
4853 | s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); |
4928 | s_goto (OP_READ_INTERNAL); |
4854 | s_goto (OP_READ_INTERNAL); |
4929 | |
4855 | |
4930 | case OP_READ_CHAR: /* read-char */ |
4856 | case OP_READ_CHAR: /* read-char */ |
4931 | case OP_PEEK_CHAR: /* peek-char */ |
4857 | case OP_PEEK_CHAR: /* peek-char */ |
4932 | { |
4858 | { |
4933 | int c; |
4859 | int c; |
4934 | |
4860 | |
4935 | if (is_pair (SCHEME_V->args)) |
4861 | if (is_pair (args)) |
4936 | { |
4862 | { |
4937 | if (car (SCHEME_V->args) != SCHEME_V->inport) |
4863 | if (car (args) != SCHEME_V->inport) |
4938 | { |
4864 | { |
4939 | x = SCHEME_V->inport; |
4865 | x = SCHEME_V->inport; |
4940 | x = cons (x, NIL); |
4866 | x = cons (x, NIL); |
4941 | s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); |
4867 | s_save (SCHEME_A_ OP_SET_INPORT, x, NIL); |
4942 | SCHEME_V->inport = car (SCHEME_V->args); |
4868 | SCHEME_V->inport = car (args); |
4943 | } |
4869 | } |
4944 | } |
4870 | } |
4945 | |
4871 | |
4946 | c = inchar (SCHEME_A); |
4872 | c = inchar (SCHEME_A); |
4947 | |
4873 | |
… | |
… | |
4957 | case OP_CHAR_READY: /* char-ready? */ |
4883 | case OP_CHAR_READY: /* char-ready? */ |
4958 | { |
4884 | { |
4959 | pointer p = SCHEME_V->inport; |
4885 | pointer p = SCHEME_V->inport; |
4960 | int res; |
4886 | int res; |
4961 | |
4887 | |
4962 | if (is_pair (SCHEME_V->args)) |
4888 | if (is_pair (args)) |
4963 | p = car (SCHEME_V->args); |
4889 | p = car (args); |
4964 | |
4890 | |
4965 | res = p->object.port->kind & port_string; |
4891 | res = p->object.port->kind & port_string; |
4966 | |
4892 | |
4967 | s_retbool (res); |
4893 | s_retbool (res); |
4968 | } |
4894 | } |
4969 | |
4895 | |
4970 | case OP_SET_INPORT: /* set-input-port */ |
4896 | case OP_SET_INPORT: /* set-input-port */ |
4971 | SCHEME_V->inport = car (SCHEME_V->args); |
4897 | SCHEME_V->inport = car (args); |
4972 | s_return (SCHEME_V->value); |
4898 | s_return (SCHEME_V->value); |
4973 | |
4899 | |
4974 | case OP_SET_OUTPORT: /* set-output-port */ |
4900 | case OP_SET_OUTPORT: /* set-output-port */ |
4975 | SCHEME_V->outport = car (SCHEME_V->args); |
4901 | SCHEME_V->outport = car (args); |
4976 | s_return (SCHEME_V->value); |
4902 | s_return (SCHEME_V->value); |
4977 | #endif |
4903 | #endif |
4978 | |
4904 | |
4979 | case OP_RDSEXPR: |
4905 | case OP_RDSEXPR: |
4980 | switch (SCHEME_V->tok) |
4906 | switch (SCHEME_V->tok) |
… | |
… | |
5066 | } |
4992 | } |
5067 | |
4993 | |
5068 | break; |
4994 | break; |
5069 | |
4995 | |
5070 | case OP_RDLIST: |
4996 | case OP_RDLIST: |
5071 | SCHEME_V->args = cons (SCHEME_V->value, SCHEME_V->args); |
4997 | SCHEME_V->args = cons (SCHEME_V->value, args); |
5072 | SCHEME_V->tok = token (SCHEME_A); |
4998 | SCHEME_V->tok = token (SCHEME_A); |
5073 | |
4999 | |
5074 | switch (SCHEME_V->tok) |
5000 | switch (SCHEME_V->tok) |
5075 | { |
5001 | { |
5076 | case TOK_EOF: |
5002 | case TOK_EOF: |
… | |
… | |
5104 | case OP_RDDOT: |
5030 | case OP_RDDOT: |
5105 | if (token (SCHEME_A) != TOK_RPAREN) |
5031 | if (token (SCHEME_A) != TOK_RPAREN) |
5106 | Error_0 ("syntax error: illegal dot expression"); |
5032 | Error_0 ("syntax error: illegal dot expression"); |
5107 | |
5033 | |
5108 | SCHEME_V->nesting_stack[SCHEME_V->file_i]--; |
5034 | SCHEME_V->nesting_stack[SCHEME_V->file_i]--; |
5109 | s_return (reverse_in_place (SCHEME_A_ SCHEME_V->value, SCHEME_V->args)); |
5035 | s_return (reverse_in_place (SCHEME_A_ SCHEME_V->value, args)); |
5110 | |
5036 | |
5111 | case OP_RDQUOTE: |
5037 | case OP_RDQUOTE: |
5112 | s_return (cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL))); |
5038 | s_return (cons (SCHEME_V->QUOTE, cons (SCHEME_V->value, NIL))); |
5113 | |
5039 | |
5114 | case OP_RDQQUOTE: |
5040 | case OP_RDQQUOTE: |
… | |
… | |
5136 | SCHEME_V->args = SCHEME_V->value; |
5062 | SCHEME_V->args = SCHEME_V->value; |
5137 | s_goto (OP_VECTOR); |
5063 | s_goto (OP_VECTOR); |
5138 | |
5064 | |
5139 | /* ========== printing part ========== */ |
5065 | /* ========== printing part ========== */ |
5140 | case OP_P0LIST: |
5066 | case OP_P0LIST: |
5141 | if (is_vector (SCHEME_V->args)) |
5067 | if (is_vector (args)) |
5142 | { |
5068 | { |
5143 | putstr (SCHEME_A_ "#("); |
5069 | putstr (SCHEME_A_ "#("); |
5144 | SCHEME_V->args = cons (SCHEME_V->args, mk_integer (SCHEME_A_ 0)); |
5070 | SCHEME_V->args = cons (args, mk_integer (SCHEME_A_ 0)); |
5145 | s_goto (OP_PVECFROM); |
5071 | s_goto (OP_PVECFROM); |
5146 | } |
5072 | } |
5147 | else if (is_environment (SCHEME_V->args)) |
5073 | else if (is_environment (args)) |
5148 | { |
5074 | { |
5149 | putstr (SCHEME_A_ "#<ENVIRONMENT>"); |
5075 | putstr (SCHEME_A_ "#<ENVIRONMENT>"); |
5150 | s_return (S_T); |
5076 | s_return (S_T); |
5151 | } |
5077 | } |
5152 | else if (!is_pair (SCHEME_V->args)) |
5078 | else if (!is_pair (args)) |
5153 | { |
5079 | { |
5154 | printatom (SCHEME_A_ SCHEME_V->args, SCHEME_V->print_flag); |
5080 | printatom (SCHEME_A_ args, SCHEME_V->print_flag); |
5155 | s_return (S_T); |
5081 | s_return (S_T); |
5156 | } |
5082 | } |
5157 | else if (car (SCHEME_V->args) == SCHEME_V->QUOTE && ok_abbrev (cdr (SCHEME_V->args))) |
5083 | else |
5158 | { |
5084 | { |
|
|
5085 | pointer a = car (args); |
|
|
5086 | pointer b = cdr (args); |
|
|
5087 | int ok_abbr = ok_abbrev (b); |
|
|
5088 | SCHEME_V->args = car (b); |
|
|
5089 | |
|
|
5090 | if (a == SCHEME_V->QUOTE && ok_abbr) |
5159 | putstr (SCHEME_A_ "'"); |
5091 | putstr (SCHEME_A_ "'"); |
5160 | SCHEME_V->args = cadr (SCHEME_V->args); |
5092 | else if (a == SCHEME_V->QQUOTE && ok_abbr) |
|
|
5093 | putstr (SCHEME_A_ "`"); |
|
|
5094 | else if (a == SCHEME_V->UNQUOTE && ok_abbr) |
|
|
5095 | putstr (SCHEME_A_ ","); |
|
|
5096 | else if (a == SCHEME_V->UNQUOTESP && ok_abbr) |
|
|
5097 | putstr (SCHEME_A_ ",@"); |
|
|
5098 | else |
|
|
5099 | { |
|
|
5100 | putstr (SCHEME_A_ "("); |
|
|
5101 | s_save (SCHEME_A_ OP_P1LIST, b, NIL); |
|
|
5102 | SCHEME_V->args = a; |
|
|
5103 | } |
|
|
5104 | |
5161 | s_goto (OP_P0LIST); |
5105 | s_goto (OP_P0LIST); |
5162 | } |
5106 | } |
5163 | else if (car (SCHEME_V->args) == SCHEME_V->QQUOTE && ok_abbrev (cdr (SCHEME_V->args))) |
5107 | |
|
|
5108 | case OP_P1LIST: |
|
|
5109 | if (is_pair (args)) |
5164 | { |
5110 | { |
|
|
5111 | s_save (SCHEME_A_ OP_P1LIST, cdr (args), NIL); |
5165 | putstr (SCHEME_A_ "`"); |
5112 | putstr (SCHEME_A_ " "); |
5166 | SCHEME_V->args = cadr (SCHEME_V->args); |
5113 | SCHEME_V->args = car (args); |
5167 | s_goto (OP_P0LIST); |
5114 | s_goto (OP_P0LIST); |
5168 | } |
5115 | } |
5169 | else if (car (SCHEME_V->args) == SCHEME_V->UNQUOTE && ok_abbrev (cdr (SCHEME_V->args))) |
|
|
5170 | { |
|
|
5171 | putstr (SCHEME_A_ ","); |
|
|
5172 | SCHEME_V->args = cadr (SCHEME_V->args); |
|
|
5173 | s_goto (OP_P0LIST); |
|
|
5174 | } |
|
|
5175 | else if (car (SCHEME_V->args) == SCHEME_V->UNQUOTESP && ok_abbrev (cdr (SCHEME_V->args))) |
|
|
5176 | { |
|
|
5177 | putstr (SCHEME_A_ ",@"); |
|
|
5178 | SCHEME_V->args = cadr (SCHEME_V->args); |
|
|
5179 | s_goto (OP_P0LIST); |
|
|
5180 | } |
|
|
5181 | else |
|
|
5182 | { |
|
|
5183 | putstr (SCHEME_A_ "("); |
|
|
5184 | s_save (SCHEME_A_ OP_P1LIST, cdr (SCHEME_V->args), NIL); |
|
|
5185 | SCHEME_V->args = car (SCHEME_V->args); |
|
|
5186 | s_goto (OP_P0LIST); |
|
|
5187 | } |
|
|
5188 | |
|
|
5189 | case OP_P1LIST: |
|
|
5190 | if (is_pair (SCHEME_V->args)) |
|
|
5191 | { |
|
|
5192 | s_save (SCHEME_A_ OP_P1LIST, cdr (SCHEME_V->args), NIL); |
|
|
5193 | putstr (SCHEME_A_ " "); |
|
|
5194 | SCHEME_V->args = car (SCHEME_V->args); |
|
|
5195 | s_goto (OP_P0LIST); |
|
|
5196 | } |
|
|
5197 | else if (is_vector (SCHEME_V->args)) |
5116 | else if (is_vector (args)) |
5198 | { |
5117 | { |
5199 | s_save (SCHEME_A_ OP_P1LIST, NIL, NIL); |
5118 | s_save (SCHEME_A_ OP_P1LIST, NIL, NIL); |
5200 | putstr (SCHEME_A_ " . "); |
5119 | putstr (SCHEME_A_ " . "); |
5201 | s_goto (OP_P0LIST); |
5120 | s_goto (OP_P0LIST); |
5202 | } |
5121 | } |
5203 | else |
5122 | else |
5204 | { |
5123 | { |
5205 | if (SCHEME_V->args != NIL) |
5124 | if (args != NIL) |
5206 | { |
5125 | { |
5207 | putstr (SCHEME_A_ " . "); |
5126 | putstr (SCHEME_A_ " . "); |
5208 | printatom (SCHEME_A_ SCHEME_V->args, SCHEME_V->print_flag); |
5127 | printatom (SCHEME_A_ args, SCHEME_V->print_flag); |
5209 | } |
5128 | } |
5210 | |
5129 | |
5211 | putstr (SCHEME_A_ ")"); |
5130 | putstr (SCHEME_A_ ")"); |
5212 | s_return (S_T); |
5131 | s_return (S_T); |
5213 | } |
5132 | } |
5214 | |
5133 | |
5215 | case OP_PVECFROM: |
5134 | case OP_PVECFROM: |
5216 | { |
5135 | { |
5217 | int i = ivalue_unchecked (cdr (SCHEME_V->args)); |
5136 | int i = ivalue_unchecked (cdr (args)); |
5218 | pointer vec = car (SCHEME_V->args); |
5137 | pointer vec = car (args); |
5219 | int len = veclength (vec); |
5138 | int len = veclength (vec); |
5220 | |
5139 | |
5221 | if (i == len) |
5140 | if (i == len) |
5222 | { |
5141 | { |
5223 | putstr (SCHEME_A_ ")"); |
5142 | putstr (SCHEME_A_ ")"); |
5224 | s_return (S_T); |
5143 | s_return (S_T); |
5225 | } |
5144 | } |
5226 | else |
5145 | else |
5227 | { |
5146 | { |
5228 | pointer elem = vector_elem (vec, i); |
5147 | pointer elem = vector_get (vec, i); |
5229 | |
5148 | |
5230 | ivalue_unchecked (cdr (SCHEME_V->args)) = i + 1; |
5149 | ivalue_unchecked (cdr (args)) = i + 1; |
5231 | s_save (SCHEME_A_ OP_PVECFROM, SCHEME_V->args, NIL); |
5150 | s_save (SCHEME_A_ OP_PVECFROM, args, NIL); |
5232 | SCHEME_V->args = elem; |
5151 | SCHEME_V->args = elem; |
5233 | |
5152 | |
5234 | if (i > 0) |
5153 | if (i > 0) |
5235 | putstr (SCHEME_A_ " "); |
5154 | putstr (SCHEME_A_ " "); |
5236 | |
5155 | |
5237 | s_goto (OP_P0LIST); |
5156 | s_goto (OP_P0LIST); |
5238 | } |
5157 | } |
5239 | } |
5158 | } |
5240 | } |
5159 | } |
5241 | |
5160 | |
5242 | abort (); |
5161 | if (USE_ERROR_CHECKING) abort (); |
5243 | } |
5162 | } |
5244 | |
5163 | |
5245 | static pointer |
5164 | static int |
5246 | opexe_6 (SCHEME_P_ enum scheme_opcodes op) |
5165 | opexe_6 (SCHEME_P_ enum scheme_opcodes op) |
5247 | { |
5166 | { |
|
|
5167 | pointer args = SCHEME_V->args; |
|
|
5168 | pointer a = car (args); |
5248 | pointer x, y; |
5169 | pointer x, y; |
5249 | |
5170 | |
5250 | switch (op) |
5171 | switch (op) |
5251 | { |
5172 | { |
5252 | case OP_LIST_LENGTH: /* length *//* a.k */ |
5173 | case OP_LIST_LENGTH: /* length *//* a.k */ |
5253 | { |
5174 | { |
5254 | long v = list_length (SCHEME_A_ car (SCHEME_V->args)); |
5175 | long v = list_length (SCHEME_A_ a); |
5255 | |
5176 | |
5256 | if (v < 0) |
5177 | if (v < 0) |
5257 | Error_1 ("length: not a list:", car (SCHEME_V->args)); |
5178 | Error_1 ("length: not a list:", a); |
5258 | |
5179 | |
5259 | s_return (mk_integer (SCHEME_A_ v)); |
5180 | s_return (mk_integer (SCHEME_A_ v)); |
5260 | } |
5181 | } |
5261 | |
5182 | |
5262 | case OP_ASSQ: /* assq *//* a.k */ |
5183 | case OP_ASSQ: /* assq *//* a.k */ |
5263 | x = car (SCHEME_V->args); |
5184 | x = a; |
5264 | |
5185 | |
5265 | for (y = cadr (SCHEME_V->args); is_pair (y); y = cdr (y)) |
5186 | for (y = cadr (args); is_pair (y); y = cdr (y)) |
5266 | { |
5187 | { |
5267 | if (!is_pair (car (y))) |
5188 | if (!is_pair (car (y))) |
5268 | Error_0 ("unable to handle non pair element"); |
5189 | Error_0 ("unable to handle non pair element"); |
5269 | |
5190 | |
5270 | if (x == caar (y)) |
5191 | if (x == caar (y)) |
… | |
… | |
5276 | else |
5197 | else |
5277 | s_return (S_F); |
5198 | s_return (S_F); |
5278 | |
5199 | |
5279 | |
5200 | |
5280 | case OP_GET_CLOSURE: /* get-closure-code *//* a.k */ |
5201 | case OP_GET_CLOSURE: /* get-closure-code *//* a.k */ |
5281 | SCHEME_V->args = car (SCHEME_V->args); |
5202 | SCHEME_V->args = a; |
5282 | |
5203 | |
5283 | if (SCHEME_V->args == NIL) |
5204 | if (SCHEME_V->args == NIL) |
5284 | s_return (S_F); |
5205 | s_return (S_F); |
5285 | else if (is_closure (SCHEME_V->args)) |
5206 | else if (is_closure (SCHEME_V->args)) |
5286 | s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value))); |
5207 | s_return (cons (SCHEME_V->LAMBDA, closure_code (SCHEME_V->value))); |
… | |
… | |
5292 | case OP_CLOSUREP: /* closure? */ |
5213 | case OP_CLOSUREP: /* closure? */ |
5293 | /* |
5214 | /* |
5294 | * Note, macro object is also a closure. |
5215 | * Note, macro object is also a closure. |
5295 | * Therefore, (closure? <#MACRO>) ==> #t |
5216 | * Therefore, (closure? <#MACRO>) ==> #t |
5296 | */ |
5217 | */ |
5297 | s_retbool (is_closure (car (SCHEME_V->args))); |
5218 | s_retbool (is_closure (a)); |
5298 | |
5219 | |
5299 | case OP_MACROP: /* macro? */ |
5220 | case OP_MACROP: /* macro? */ |
5300 | s_retbool (is_macro (car (SCHEME_V->args))); |
5221 | s_retbool (is_macro (a)); |
5301 | } |
5222 | } |
5302 | |
5223 | |
5303 | abort (); |
5224 | if (USE_ERROR_CHECKING) abort (); |
5304 | } |
5225 | } |
5305 | |
5226 | |
|
|
5227 | /* dispatch functions (opexe_x) return new opcode, or 0 for same opcode, or -1 to stop */ |
5306 | typedef pointer (*dispatch_func) (SCHEME_P_ enum scheme_opcodes); |
5228 | typedef int (*dispatch_func)(SCHEME_P_ enum scheme_opcodes); |
5307 | |
5229 | |
5308 | typedef int (*test_predicate) (pointer); |
5230 | typedef int (*test_predicate)(pointer); |
5309 | static int |
5231 | static int |
5310 | is_any (pointer p) |
5232 | tst_any (pointer p) |
5311 | { |
5233 | { |
5312 | return 1; |
5234 | return 1; |
5313 | } |
5235 | } |
5314 | |
5236 | |
5315 | static int |
5237 | static int |
5316 | is_nonneg (pointer p) |
5238 | tst_inonneg (pointer p) |
5317 | { |
5239 | { |
5318 | return ivalue (p) >= 0 && is_integer (p); |
5240 | return is_integer (p) && ivalue_unchecked (p) >= 0; |
|
|
5241 | } |
|
|
5242 | |
|
|
5243 | static int |
|
|
5244 | tst_is_list (SCHEME_P_ pointer p) |
|
|
5245 | { |
|
|
5246 | return p == NIL || is_pair (p); |
5319 | } |
5247 | } |
5320 | |
5248 | |
5321 | /* Correspond carefully with following defines! */ |
5249 | /* Correspond carefully with following defines! */ |
5322 | static struct |
5250 | static struct |
5323 | { |
5251 | { |
5324 | test_predicate fct; |
5252 | test_predicate fct; |
5325 | const char *kind; |
5253 | const char *kind; |
5326 | } tests[] = |
5254 | } tests[] = { |
5327 | { |
5255 | { tst_any , 0 }, |
5328 | { 0, 0}, /* unused */ |
5256 | { is_string , "string" }, |
5329 | { is_any, 0}, |
5257 | { is_symbol , "symbol" }, |
5330 | { is_string, "string" }, |
5258 | { is_port , "port" }, |
5331 | { is_symbol, "symbol" }, |
|
|
5332 | { is_port, "port" }, |
|
|
5333 | { is_inport, "input port" }, |
5259 | { is_inport , "input port" }, |
5334 | { is_outport, "output port" }, |
5260 | { is_outport , "output port" }, |
5335 | { is_environment, "environment" }, |
5261 | { is_environment, "environment" }, |
5336 | { is_pair, "pair" }, |
5262 | { is_pair , "pair" }, |
5337 | { 0, "pair or '()" }, |
5263 | { 0 , "pair or '()" }, |
5338 | { is_character, "character" }, |
5264 | { is_character , "character" }, |
5339 | { is_vector, "vector" }, |
5265 | { is_vector , "vector" }, |
5340 | { is_number, "number" }, |
5266 | { is_number , "number" }, |
5341 | { is_integer, "integer" }, |
5267 | { is_integer , "integer" }, |
5342 | { is_nonneg, "non-negative integer" } |
5268 | { tst_inonneg , "non-negative integer" } |
5343 | }; |
5269 | }; |
5344 | |
5270 | |
5345 | #define TST_NONE 0 |
5271 | #define TST_NONE 0 /* TST_NONE used for built-ins, 0 for internal ops */ |
5346 | #define TST_ANY "\001" |
5272 | #define TST_ANY "\001" |
5347 | #define TST_STRING "\002" |
5273 | #define TST_STRING "\002" |
5348 | #define TST_SYMBOL "\003" |
5274 | #define TST_SYMBOL "\003" |
5349 | #define TST_PORT "\004" |
5275 | #define TST_PORT "\004" |
5350 | #define TST_INPORT "\005" |
5276 | #define TST_INPORT "\005" |
5351 | #define TST_OUTPORT "\006" |
5277 | #define TST_OUTPORT "\006" |
5352 | #define TST_ENVIRONMENT "\007" |
5278 | #define TST_ENVIRONMENT "\007" |
5353 | #define TST_PAIR "\010" |
5279 | #define TST_PAIR "\010" |
5354 | #define TST_LIST "\011" |
5280 | #define TST_LIST "\011" |
5355 | #define TST_CHAR "\012" |
5281 | #define TST_CHAR "\012" |
5356 | #define TST_VECTOR "\013" |
5282 | #define TST_VECTOR "\013" |
5357 | #define TST_NUMBER "\014" |
5283 | #define TST_NUMBER "\014" |
5358 | #define TST_INTEGER "\015" |
5284 | #define TST_INTEGER "\015" |
5359 | #define TST_NATURAL "\016" |
5285 | #define TST_NATURAL "\016" |
|
|
5286 | |
|
|
5287 | #define INF_ARG 0xff |
|
|
5288 | #define UNNAMED_OP "" |
|
|
5289 | |
|
|
5290 | static const char opnames[] = |
|
|
5291 | #define OP_DEF(func,name,minarity,maxarity,argtest,op) name "\x00" |
|
|
5292 | #include "opdefines.h" |
|
|
5293 | #undef OP_DEF |
|
|
5294 | ; |
|
|
5295 | |
|
|
5296 | static const char * |
|
|
5297 | opname (int idx) |
|
|
5298 | { |
|
|
5299 | const char *name = opnames; |
|
|
5300 | |
|
|
5301 | /* should do this at compile time, but would require external program, right? */ |
|
|
5302 | while (idx--) |
|
|
5303 | name += strlen (name) + 1; |
|
|
5304 | |
|
|
5305 | return *name ? name : "ILLEGAL"; |
|
|
5306 | } |
|
|
5307 | |
|
|
5308 | static const char * |
|
|
5309 | procname (pointer x) |
|
|
5310 | { |
|
|
5311 | return opname (procnum (x)); |
|
|
5312 | } |
5360 | |
5313 | |
5361 | typedef struct |
5314 | typedef struct |
5362 | { |
5315 | { |
5363 | dispatch_func func; |
5316 | uint8_t func; |
5364 | char *name; |
5317 | /*dispatch_func func;*//*TODO: maybe optionally keep the pointer, for speed? */ |
|
|
5318 | uint8_t builtin; |
|
|
5319 | #if USE_ERROR_CHECKING |
5365 | int min_arity; |
5320 | uint8_t min_arity; |
5366 | int max_arity; |
5321 | uint8_t max_arity; |
5367 | char *arg_tests_encoding; |
5322 | char arg_tests_encoding[3]; |
|
|
5323 | #endif |
5368 | } op_code_info; |
5324 | } op_code_info; |
5369 | |
5325 | |
5370 | #define INF_ARG 0xffff |
|
|
5371 | |
|
|
5372 | static op_code_info dispatch_table[] = { |
5326 | static const op_code_info dispatch_table[] = { |
5373 | #define OP_DEF(A,B,C,D,E,OP) {A,B,C,D,E}, |
5327 | #if USE_ERROR_CHECKING |
|
|
5328 | #define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1, minarity, maxarity, argtest }, |
|
|
5329 | #else |
|
|
5330 | #define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1 }, |
|
|
5331 | #endif |
5374 | #include "opdefines.h" |
5332 | #include "opdefines.h" |
|
|
5333 | #undef OP_DEF |
5375 | {0} |
5334 | {0} |
5376 | }; |
5335 | }; |
5377 | |
5336 | |
5378 | static const char * |
|
|
5379 | procname (pointer x) |
|
|
5380 | { |
|
|
5381 | int n = procnum (x); |
|
|
5382 | const char *name = dispatch_table[n].name; |
|
|
5383 | |
|
|
5384 | if (name == 0) |
|
|
5385 | name = "ILLEGAL!"; |
|
|
5386 | |
|
|
5387 | return name; |
|
|
5388 | } |
|
|
5389 | |
|
|
5390 | /* kernel of this interpreter */ |
5337 | /* kernel of this interpreter */ |
5391 | static void |
5338 | static void ecb_hot |
5392 | Eval_Cycle (SCHEME_P_ enum scheme_opcodes op) |
5339 | Eval_Cycle (SCHEME_P_ enum scheme_opcodes op) |
5393 | { |
5340 | { |
5394 | SCHEME_V->op = op; |
5341 | SCHEME_V->op = op; |
5395 | |
5342 | |
5396 | for (;;) |
5343 | for (;;) |
5397 | { |
5344 | { |
5398 | op_code_info *pcd = dispatch_table + SCHEME_V->op; |
5345 | const op_code_info *pcd = dispatch_table + SCHEME_V->op; |
5399 | |
5346 | |
5400 | #if USE_ERROR_CHECKING |
5347 | #if USE_ERROR_CHECKING |
5401 | if (pcd->name) /* if built-in function, check arguments */ |
5348 | if (pcd->builtin) /* if built-in function, check arguments */ |
5402 | { |
5349 | { |
5403 | int ok = 1; |
|
|
5404 | char msg[STRBUFFSIZE]; |
5350 | char msg[STRBUFFSIZE]; |
5405 | int n = list_length (SCHEME_A_ SCHEME_V->args); |
5351 | int n = list_length (SCHEME_A_ SCHEME_V->args); |
5406 | |
5352 | |
5407 | /* Check number of arguments */ |
5353 | /* Check number of arguments */ |
5408 | if (ecb_expect_false (n < pcd->min_arity)) |
5354 | if (ecb_expect_false (n < pcd->min_arity)) |
5409 | { |
5355 | { |
5410 | ok = 0; |
|
|
5411 | snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", |
5356 | snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", |
5412 | pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity); |
5357 | opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity); |
|
|
5358 | xError_1 (SCHEME_A_ msg, 0); |
|
|
5359 | continue; |
5413 | } |
5360 | } |
5414 | else if (ecb_expect_false (n > pcd->max_arity)) |
5361 | else if (ecb_expect_false (n > pcd->max_arity && pcd->max_arity != INF_ARG)) |
5415 | { |
5362 | { |
5416 | ok = 0; |
|
|
5417 | snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", |
5363 | snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", |
5418 | pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity); |
5364 | opname (SCHEME_V->op), pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity); |
|
|
5365 | xError_1 (SCHEME_A_ msg, 0); |
|
|
5366 | continue; |
5419 | } |
5367 | } |
5420 | |
5368 | else |
5421 | if (ecb_expect_false (ok)) |
|
|
5422 | { |
5369 | { |
5423 | if (pcd->arg_tests_encoding) |
5370 | if (*pcd->arg_tests_encoding) /* literal 0 and TST_NONE treated the same */ |
5424 | { |
5371 | { |
5425 | int i = 0; |
5372 | int i = 0; |
5426 | int j; |
5373 | int j; |
5427 | const char *t = pcd->arg_tests_encoding; |
5374 | const char *t = pcd->arg_tests_encoding; |
5428 | pointer arglist = SCHEME_V->args; |
5375 | pointer arglist = SCHEME_V->args; |
5429 | |
5376 | |
5430 | do |
5377 | do |
5431 | { |
5378 | { |
5432 | pointer arg = car (arglist); |
5379 | pointer arg = car (arglist); |
5433 | |
5380 | |
5434 | j = (int) t[0]; |
5381 | j = t[0]; |
5435 | |
5382 | |
|
|
5383 | /*TODO: tst_is_list has different prototype - fix if other tests acquire same prototype */ |
5436 | if (j == TST_LIST[0]) |
5384 | if (j == TST_LIST[0]) |
5437 | { |
5385 | { |
5438 | if (arg != NIL && !is_pair (arg)) |
5386 | if (!tst_is_list (SCHEME_A_ arg)) |
5439 | break; |
5387 | break; |
5440 | } |
5388 | } |
5441 | else |
5389 | else |
5442 | { |
5390 | { |
5443 | if (!tests[j].fct (arg)) |
5391 | if (!tests[j - 1].fct (arg)) |
5444 | break; |
5392 | break; |
5445 | } |
5393 | } |
5446 | |
5394 | |
5447 | if (t[1] != 0) /* last test is replicated as necessary */ |
5395 | if (t < pcd->arg_tests_encoding + sizeof (pcd->arg_tests_encoding) - 1 && t[1]) /* last test is replicated as necessary */ |
5448 | t++; |
5396 | t++; |
5449 | |
5397 | |
5450 | arglist = cdr (arglist); |
5398 | arglist = cdr (arglist); |
5451 | i++; |
5399 | i++; |
5452 | } |
5400 | } |
5453 | while (i < n); |
5401 | while (i < n); |
5454 | |
5402 | |
5455 | if (i < n) |
5403 | if (i < n) |
5456 | { |
5404 | { |
5457 | ok = 0; |
|
|
5458 | snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", pcd->name, i + 1, tests[j].kind); |
5405 | snprintf (msg, STRBUFFSIZE, "%s: argument %d must be: %s", opname (SCHEME_V->op), i + 1, tests[j].kind); |
|
|
5406 | xError_1 (SCHEME_A_ msg, 0); |
|
|
5407 | continue; |
5459 | } |
5408 | } |
5460 | } |
5409 | } |
5461 | } |
5410 | } |
5462 | |
|
|
5463 | if (!ok) |
|
|
5464 | { |
|
|
5465 | if (xError_1 (SCHEME_A_ msg, 0) == NIL) |
|
|
5466 | return; |
|
|
5467 | |
|
|
5468 | pcd = dispatch_table + SCHEME_V->op; |
|
|
5469 | } |
|
|
5470 | } |
5411 | } |
5471 | #endif |
5412 | #endif |
5472 | |
5413 | |
5473 | ok_to_freely_gc (SCHEME_A); |
5414 | ok_to_freely_gc (SCHEME_A); |
5474 | |
5415 | |
|
|
5416 | static const dispatch_func dispatch_funcs[] = { |
|
|
5417 | opexe_0, |
|
|
5418 | opexe_1, |
|
|
5419 | opexe_2, |
|
|
5420 | opexe_3, |
|
|
5421 | opexe_4, |
|
|
5422 | opexe_5, |
|
|
5423 | opexe_6, |
|
|
5424 | }; |
|
|
5425 | |
5475 | if (ecb_expect_false (pcd->func (SCHEME_A_ SCHEME_V->op) == NIL)) |
5426 | if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0)) |
5476 | return; |
5427 | return; |
5477 | |
5428 | |
5478 | if (SCHEME_V->no_memory && USE_ERROR_CHECKING) |
5429 | if (SCHEME_V->no_memory && USE_ERROR_CHECKING) |
5479 | { |
5430 | { |
5480 | xwrstr ("No memory!\n"); |
5431 | xwrstr ("No memory!\n"); |
… | |
… | |
5504 | mk_proc (SCHEME_P_ enum scheme_opcodes op) |
5455 | mk_proc (SCHEME_P_ enum scheme_opcodes op) |
5505 | { |
5456 | { |
5506 | pointer y = get_cell (SCHEME_A_ NIL, NIL); |
5457 | pointer y = get_cell (SCHEME_A_ NIL, NIL); |
5507 | set_typeflag (y, (T_PROC | T_ATOM)); |
5458 | set_typeflag (y, (T_PROC | T_ATOM)); |
5508 | ivalue_unchecked (y) = op; |
5459 | ivalue_unchecked (y) = op; |
5509 | set_num_integer (y); |
|
|
5510 | return y; |
5460 | return y; |
5511 | } |
5461 | } |
5512 | |
5462 | |
5513 | /* Hard-coded for the given keywords. Remember to rewrite if more are added! */ |
5463 | /* Hard-coded for the given keywords. Remember to rewrite if more are added! */ |
5514 | static int |
5464 | static int |
… | |
… | |
5579 | return OP_C0STREAM; /* cons-stream */ |
5529 | return OP_C0STREAM; /* cons-stream */ |
5580 | } |
5530 | } |
5581 | } |
5531 | } |
5582 | |
5532 | |
5583 | #if USE_MULTIPLICITY |
5533 | #if USE_MULTIPLICITY |
5584 | scheme * |
5534 | ecb_cold scheme * |
5585 | scheme_init_new () |
5535 | scheme_init_new () |
5586 | { |
5536 | { |
5587 | scheme *sc = malloc (sizeof (scheme)); |
5537 | scheme *sc = malloc (sizeof (scheme)); |
5588 | |
5538 | |
5589 | if (!scheme_init (SCHEME_A)) |
5539 | if (!scheme_init (SCHEME_A)) |
… | |
… | |
5594 | else |
5544 | else |
5595 | return sc; |
5545 | return sc; |
5596 | } |
5546 | } |
5597 | #endif |
5547 | #endif |
5598 | |
5548 | |
5599 | int |
5549 | ecb_cold int |
5600 | scheme_init (SCHEME_P) |
5550 | scheme_init (SCHEME_P) |
5601 | { |
5551 | { |
5602 | int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]); |
5552 | int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]); |
5603 | pointer x; |
5553 | pointer x; |
5604 | |
5554 | |
… | |
… | |
5677 | |
5627 | |
5678 | for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i) |
5628 | for (i = 0; i < sizeof (syntax_names) / sizeof (*syntax_names); ++i) |
5679 | assign_syntax (SCHEME_A_ syntax_names[i]); |
5629 | assign_syntax (SCHEME_A_ syntax_names[i]); |
5680 | } |
5630 | } |
5681 | |
5631 | |
|
|
5632 | // TODO: should iterate via strlen, to avoid n² complexity |
5682 | for (i = 0; i < n; i++) |
5633 | for (i = 0; i < n; i++) |
5683 | if (dispatch_table[i].name != 0) |
5634 | if (dispatch_table[i].builtin) |
5684 | assign_proc (SCHEME_A_ i, dispatch_table[i].name); |
5635 | assign_proc (SCHEME_A_ i, opname (i)); |
5685 | |
5636 | |
5686 | /* initialization of global pointers to special symbols */ |
5637 | /* initialization of global pointers to special symbols */ |
5687 | SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda"); |
5638 | SCHEME_V->LAMBDA = mk_symbol (SCHEME_A_ "lambda"); |
5688 | SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote"); |
5639 | SCHEME_V->QUOTE = mk_symbol (SCHEME_A_ "quote"); |
5689 | SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote"); |
5640 | SCHEME_V->QQUOTE = mk_symbol (SCHEME_A_ "quasiquote"); |
… | |
… | |
5728 | scheme_set_external_data (SCHEME_P_ void *p) |
5679 | scheme_set_external_data (SCHEME_P_ void *p) |
5729 | { |
5680 | { |
5730 | SCHEME_V->ext_data = p; |
5681 | SCHEME_V->ext_data = p; |
5731 | } |
5682 | } |
5732 | |
5683 | |
5733 | void |
5684 | ecb_cold void |
5734 | scheme_deinit (SCHEME_P) |
5685 | scheme_deinit (SCHEME_P) |
5735 | { |
5686 | { |
5736 | int i; |
5687 | int i; |
5737 | |
5688 | |
5738 | #if SHOW_ERROR_LINE |
5689 | #if SHOW_ERROR_LINE |