… | |
… | |
16 | * (MINISCM) This is a revised and modified version by Akira KIDA. |
16 | * (MINISCM) This is a revised and modified version by Akira KIDA. |
17 | * (MINISCM) current version is 0.85k4 (15 May 1994) |
17 | * (MINISCM) current version is 0.85k4 (15 May 1994) |
18 | * |
18 | * |
19 | */ |
19 | */ |
20 | |
20 | |
|
|
21 | #define EXPERIMENT 1 |
|
|
22 | |
|
|
23 | #if 1 |
21 | #define PAGE_SIZE 4096 /* does not work on sparc/alpha */ |
24 | #define PAGE_SIZE 4096 /* does not work on sparc/alpha */ |
22 | #include "malloc.c" |
25 | #include "malloc.c" |
|
|
26 | #endif |
23 | |
27 | |
24 | #define SCHEME_SOURCE |
28 | #define SCHEME_SOURCE |
25 | #include "scheme-private.h" |
29 | #include "scheme-private.h" |
26 | #ifndef WIN32 |
30 | #ifndef WIN32 |
27 | # include <unistd.h> |
31 | # include <unistd.h> |
… | |
… | |
34 | |
38 | |
35 | #include <sys/types.h> |
39 | #include <sys/types.h> |
36 | #include <sys/stat.h> |
40 | #include <sys/stat.h> |
37 | #include <fcntl.h> |
41 | #include <fcntl.h> |
38 | |
42 | |
|
|
43 | #if !USE_ERROR_CHECKING |
|
|
44 | # define NDEBUG |
|
|
45 | #endif |
|
|
46 | |
|
|
47 | #include <assert.h> |
|
|
48 | #include <stdlib.h> |
39 | #include <string.h> |
49 | #include <string.h> |
40 | #include <stdlib.h> |
|
|
41 | |
50 | |
42 | #include <limits.h> |
51 | #include <limits.h> |
43 | #include <inttypes.h> |
52 | #include <inttypes.h> |
44 | #include <float.h> |
53 | #include <float.h> |
45 | //#include <ctype.h> |
54 | //#include <ctype.h> |
|
|
55 | |
|
|
56 | #if '1' != '0' + 1 \ |
|
|
57 | || '2' != '0' + 2 || '3' != '0' + 3 || '4' != '0' + 4 || '5' != '0' + 5 \ |
|
|
58 | || '6' != '0' + 6 || '7' != '0' + 7 || '8' != '0' + 8 || '9' != '0' + 9 \ |
|
|
59 | || 'b' != 'a' + 1 || 'c' != 'a' + 2 || 'd' != 'a' + 3 || 'e' != 'a' + 4 \ |
|
|
60 | || 'f' != 'a' + 5 |
|
|
61 | # error "execution character set digits not consecutive" |
|
|
62 | #endif |
46 | |
63 | |
47 | enum { |
64 | enum { |
48 | TOK_EOF, |
65 | TOK_EOF, |
49 | TOK_LPAREN, |
66 | TOK_LPAREN, |
50 | TOK_RPAREN, |
67 | TOK_RPAREN, |
51 | TOK_DOT, |
68 | TOK_DOT, |
52 | TOK_ATOM, |
69 | TOK_ATOM, |
|
|
70 | TOK_DOTATOM, /* atom name starting with '.' */ |
|
|
71 | TOK_STRATOM, /* atom name enclosed in | */ |
53 | TOK_QUOTE, |
72 | TOK_QUOTE, |
54 | TOK_DQUOTE, |
73 | TOK_DQUOTE, |
55 | TOK_BQUOTE, |
74 | TOK_BQUOTE, |
56 | TOK_COMMA, |
75 | TOK_COMMA, |
57 | TOK_ATMARK, |
76 | TOK_ATMARK, |
… | |
… | |
59 | TOK_SHARP_CONST, |
78 | TOK_SHARP_CONST, |
60 | TOK_VEC |
79 | TOK_VEC |
61 | }; |
80 | }; |
62 | |
81 | |
63 | #define BACKQUOTE '`' |
82 | #define BACKQUOTE '`' |
64 | #define DELIMITERS "()\";\f\t\v\n\r " |
83 | #define WHITESPACE " \t\r\n\v\f" |
|
|
84 | #define DELIMITERS "()\";" WHITESPACE |
65 | |
85 | |
66 | #define NIL (&SCHEME_V->xNIL) //TODO: make this 0? |
86 | #define NIL POINTER (&SCHEME_V->xNIL) |
67 | #define S_T (&SCHEME_V->xT) //TODO: magic ptr value? |
87 | #define S_T POINTER (&SCHEME_V->xT) |
68 | #define S_F (&SCHEME_V->xF) //TODO: magic ptr value? |
88 | #define S_F POINTER (&SCHEME_V->xF) |
69 | #define S_SINK (&SCHEME_V->xsink) |
89 | #define S_SINK POINTER (&SCHEME_V->xsink) |
70 | #define S_EOF (&SCHEME_V->xEOF_OBJ) |
90 | #define S_EOF POINTER (&SCHEME_V->xEOF_OBJ) |
71 | |
91 | |
72 | #if !USE_MULTIPLICITY |
92 | #if !USE_MULTIPLICITY |
73 | static scheme sc; |
93 | static scheme sc; |
74 | #endif |
94 | #endif |
75 | |
95 | |
… | |
… | |
83 | } |
103 | } |
84 | |
104 | |
85 | char *p = s; |
105 | char *p = s; |
86 | |
106 | |
87 | do { |
107 | do { |
88 | *p++ = '0' + n % base; |
108 | *p++ = "0123456789abcdef"[n % base]; |
89 | n /= base; |
109 | n /= base; |
90 | } while (n); |
110 | } while (n); |
91 | |
111 | |
92 | *p-- = 0; |
112 | *p-- = 0; |
93 | |
113 | |
… | |
… | |
103 | { |
123 | { |
104 | xbase (s, n, 10); |
124 | xbase (s, n, 10); |
105 | } |
125 | } |
106 | |
126 | |
107 | static void |
127 | static void |
108 | xwrstr (const char *s) |
128 | putnum (SCHEME_P_ long n) |
109 | { |
|
|
110 | write (1, s, strlen (s)); |
|
|
111 | } |
|
|
112 | |
|
|
113 | static void |
|
|
114 | xwrnum (long n) |
|
|
115 | { |
129 | { |
116 | char buf[64]; |
130 | char buf[64]; |
117 | |
131 | |
118 | xnum (buf, n); |
132 | xnum (buf, n); |
119 | xwrstr (buf); |
133 | putstr (SCHEME_A_ buf); |
120 | } |
134 | } |
121 | |
135 | |
122 | static char |
136 | static char |
123 | xtoupper (char c) |
137 | xtoupper (char c) |
124 | { |
138 | { |
… | |
… | |
176 | |
190 | |
177 | #ifndef InitFile |
191 | #ifndef InitFile |
178 | # define InitFile "init.scm" |
192 | # define InitFile "init.scm" |
179 | #endif |
193 | #endif |
180 | |
194 | |
181 | #ifndef FIRST_CELLSEGS |
|
|
182 | # define FIRST_CELLSEGS 3 |
|
|
183 | #endif |
|
|
184 | |
|
|
185 | enum scheme_types |
195 | enum scheme_types |
186 | { |
196 | { |
|
|
197 | T_INTEGER, |
187 | T_FREE, |
198 | T_REAL, |
188 | T_STRING, |
199 | T_STRING, |
189 | T_NUMBER, |
|
|
190 | T_SYMBOL, |
200 | T_SYMBOL, |
191 | T_PROC, |
201 | T_PROC, |
192 | T_PAIR, |
202 | T_PAIR, /* also used for free cells */ |
193 | T_CLOSURE, |
203 | T_CLOSURE, |
194 | T_CONTINUATION, |
204 | T_CONTINUATION, |
195 | T_FOREIGN, |
205 | T_FOREIGN, |
196 | T_CHARACTER, |
206 | T_CHARACTER, |
197 | T_PORT, |
207 | T_PORT, |
… | |
… | |
207 | #define T_SYNTAX 0x0010 |
217 | #define T_SYNTAX 0x0010 |
208 | #define T_IMMUTABLE 0x0020 |
218 | #define T_IMMUTABLE 0x0020 |
209 | #define T_ATOM 0x0040 /* only for gc */ |
219 | #define T_ATOM 0x0040 /* only for gc */ |
210 | #define T_MARK 0x0080 /* only for gc */ |
220 | #define T_MARK 0x0080 /* only for gc */ |
211 | |
221 | |
|
|
222 | /* num, for generic arithmetic */ |
|
|
223 | struct num |
|
|
224 | { |
|
|
225 | IVALUE ivalue; |
|
|
226 | #if USE_REAL |
|
|
227 | RVALUE rvalue; |
|
|
228 | char is_fixnum; |
|
|
229 | #endif |
|
|
230 | }; |
|
|
231 | |
|
|
232 | #if USE_REAL |
|
|
233 | # define num_is_fixnum(n) (n).is_fixnum |
|
|
234 | # define num_set_fixnum(n,f) (n).is_fixnum = (f) |
|
|
235 | # define num_ivalue(n) (n).ivalue |
|
|
236 | # define num_rvalue(n) (n).rvalue |
|
|
237 | # define num_set_ivalue(n,i) (n).rvalue = (n).ivalue = (i) |
|
|
238 | # define num_set_rvalue(n,r) (n).rvalue = (r) |
|
|
239 | #else |
|
|
240 | # define num_is_fixnum(n) 1 |
|
|
241 | # define num_set_fixnum(n,f) 0 |
|
|
242 | # define num_ivalue(n) (n).ivalue |
|
|
243 | # define num_rvalue(n) (n).ivalue |
|
|
244 | # define num_set_ivalue(n,i) (n).ivalue = (i) |
|
|
245 | # define num_set_rvalue(n,r) (n).ivalue = (r) |
|
|
246 | #endif |
|
|
247 | |
212 | enum num_op { NUM_ADD, NUM_SUB, NUM_MUL, NUM_INTDIV }; |
248 | enum num_op { NUM_ADD, NUM_SUB, NUM_MUL, NUM_INTDIV }; |
213 | |
249 | |
214 | static num num_op (enum num_op op, num a, num b); |
250 | static num num_op (enum num_op op, num a, num b); |
215 | static num num_intdiv (num a, num b); |
251 | static num num_intdiv (num a, num b); |
216 | static num num_rem (num a, num b); |
252 | static num num_rem (num a, num b); |
… | |
… | |
222 | static int is_zero_rvalue (RVALUE x); |
258 | static int is_zero_rvalue (RVALUE x); |
223 | |
259 | |
224 | static num num_zero; |
260 | static num num_zero; |
225 | static num num_one; |
261 | static num num_one; |
226 | |
262 | |
|
|
263 | /* convert "pointer" to cell* / cell* to pointer */ |
|
|
264 | #define CELL(p) ((struct cell *)(p) + 0) |
|
|
265 | #define POINTER(c) ((void *)((c) - 0)) |
|
|
266 | |
227 | /* macros for cell operations */ |
267 | /* macros for cell operations */ |
228 | #define typeflag(p) ((p)->flag + 0) |
268 | #define typeflag(p) (CELL(p)->flag + 0) |
229 | #define set_typeflag(p,v) ((p)->flag = (v)) |
269 | #define set_typeflag(p,v) (CELL(p)->flag = (v)) |
230 | #define type(p) (typeflag (p) & T_MASKTYPE) |
270 | #define type(p) (typeflag (p) & T_MASKTYPE) |
231 | |
271 | |
232 | INTERFACE int |
272 | INTERFACE int |
233 | is_string (pointer p) |
273 | is_string (pointer p) |
234 | { |
274 | { |
235 | return type (p) == T_STRING; |
275 | return type (p) == T_STRING; |
236 | } |
276 | } |
237 | |
277 | |
238 | #define strvalue(p) ((p)->object.string.svalue) |
278 | #define strvalue(p) (CELL(p)->object.string.svalue) |
239 | #define strlength(p) ((p)->object.string.length) |
279 | #define strlength(p) (CELL(p)->object.string.length) |
240 | |
|
|
241 | INTERFACE int is_list (SCHEME_P_ pointer p); |
|
|
242 | |
280 | |
243 | INTERFACE int |
281 | INTERFACE int |
244 | is_vector (pointer p) |
282 | is_vector (pointer p) |
245 | { |
283 | { |
246 | return type (p) == T_VECTOR; |
284 | return type (p) == T_VECTOR; |
247 | } |
285 | } |
248 | |
286 | |
249 | #define vecvalue(p) ((p)->object.vector.vvalue) |
287 | #define vecvalue(p) (CELL(p)->object.vector.vvalue) |
250 | #define veclength(p) ((p)->object.vector.length) |
288 | #define veclength(p) (CELL(p)->object.vector.length) |
251 | INTERFACE void fill_vector (pointer vec, pointer obj); |
289 | INTERFACE void fill_vector (pointer vec, uint32_t start, pointer obj); |
252 | INTERFACE uint32_t vector_length (pointer vec); |
|
|
253 | INTERFACE pointer vector_elem (pointer vec, uint32_t ielem); |
290 | INTERFACE pointer vector_get (pointer vec, uint32_t ielem); |
254 | INTERFACE void set_vector_elem (pointer vec, uint32_t ielem, pointer a); |
291 | INTERFACE void vector_set (pointer vec, uint32_t ielem, pointer a); |
255 | |
292 | |
256 | INTERFACE uint32_t |
293 | INTERFACE int |
257 | vector_length (pointer vec) |
294 | is_integer (pointer p) |
258 | { |
295 | { |
259 | return vec->object.vector.length; |
296 | return type (p) == T_INTEGER; |
|
|
297 | } |
|
|
298 | |
|
|
299 | /* not the same as in scheme, where integers are (correctly :) reals */ |
|
|
300 | INTERFACE int |
|
|
301 | is_real (pointer p) |
|
|
302 | { |
|
|
303 | return type (p) == T_REAL; |
260 | } |
304 | } |
261 | |
305 | |
262 | INTERFACE int |
306 | INTERFACE int |
263 | is_number (pointer p) |
307 | is_number (pointer p) |
264 | { |
308 | { |
265 | return type (p) == T_NUMBER; |
309 | return is_integer (p) || is_real (p); |
266 | } |
|
|
267 | |
|
|
268 | INTERFACE int |
|
|
269 | is_integer (pointer p) |
|
|
270 | { |
|
|
271 | return is_number (p) && num_is_fixnum (p->object.number); |
|
|
272 | } |
|
|
273 | |
|
|
274 | INTERFACE int |
|
|
275 | is_real (pointer p) |
|
|
276 | { |
|
|
277 | return is_number (p) && !num_is_fixnum (p->object.number); |
|
|
278 | } |
310 | } |
279 | |
311 | |
280 | INTERFACE int |
312 | INTERFACE int |
281 | is_character (pointer p) |
313 | is_character (pointer p) |
282 | { |
314 | { |
… | |
… | |
287 | string_value (pointer p) |
319 | string_value (pointer p) |
288 | { |
320 | { |
289 | return strvalue (p); |
321 | return strvalue (p); |
290 | } |
322 | } |
291 | |
323 | |
292 | ecb_inline num |
|
|
293 | nvalue (pointer p) |
|
|
294 | { |
|
|
295 | return (p)->object.number; |
|
|
296 | } |
|
|
297 | |
|
|
298 | static IVALUE |
|
|
299 | num_get_ivalue (const num n) |
|
|
300 | { |
|
|
301 | return num_is_fixnum (n) ? num_ivalue (n) : (IVALUE)num_rvalue (n); |
|
|
302 | } |
|
|
303 | |
|
|
304 | static RVALUE |
|
|
305 | num_get_rvalue (const num n) |
|
|
306 | { |
|
|
307 | return num_is_fixnum (n) ? (RVALUE)num_ivalue (n) : num_rvalue (n); |
|
|
308 | } |
|
|
309 | |
|
|
310 | INTERFACE IVALUE |
|
|
311 | ivalue (pointer p) |
|
|
312 | { |
|
|
313 | return num_get_ivalue (p->object.number); |
|
|
314 | } |
|
|
315 | |
|
|
316 | INTERFACE RVALUE |
|
|
317 | rvalue (pointer p) |
|
|
318 | { |
|
|
319 | return num_get_rvalue (p->object.number); |
|
|
320 | } |
|
|
321 | |
|
|
322 | #define ivalue_unchecked(p) ((p)->object.number.value.ivalue) |
324 | #define ivalue_unchecked(p) CELL(p)->object.ivalue |
|
|
325 | #define set_ivalue(p,v) CELL(p)->object.ivalue = (v) |
|
|
326 | |
323 | #if USE_REAL |
327 | #if USE_REAL |
324 | # define rvalue_unchecked(p) ((p)->object.number.value.rvalue) |
328 | #define rvalue_unchecked(p) CELL(p)->object.rvalue |
325 | # define set_num_integer(p) (p)->object.number.is_fixnum=1; |
329 | #define set_rvalue(p,v) CELL(p)->object.rvalue = (v) |
326 | # define set_num_real(p) (p)->object.number.is_fixnum=0; |
|
|
327 | #else |
330 | #else |
328 | # define rvalue_unchecked(p) ((p)->object.number.value.ivalue) |
331 | #define rvalue_unchecked(p) CELL(p)->object.ivalue |
329 | # define set_num_integer(p) 0 |
332 | #define set_rvalue(p,v) CELL(p)->object.ivalue = (v) |
330 | # define set_num_real(p) 0 |
|
|
331 | #endif |
333 | #endif |
332 | |
334 | |
333 | INTERFACE long |
335 | INTERFACE long |
334 | charvalue (pointer p) |
336 | charvalue (pointer p) |
335 | { |
337 | { |
336 | return ivalue_unchecked (p); |
338 | return ivalue_unchecked (p); |
337 | } |
339 | } |
338 | |
340 | |
|
|
341 | #define port(p) CELL(p)->object.port |
|
|
342 | #define set_port(p,v) port(p) = (v) |
339 | INTERFACE int |
343 | INTERFACE int |
340 | is_port (pointer p) |
344 | is_port (pointer p) |
341 | { |
345 | { |
342 | return type (p) == T_PORT; |
346 | return type (p) == T_PORT; |
343 | } |
347 | } |
344 | |
348 | |
345 | INTERFACE int |
349 | INTERFACE int |
346 | is_inport (pointer p) |
350 | is_inport (pointer p) |
347 | { |
351 | { |
348 | return is_port (p) && p->object.port->kind & port_input; |
352 | return is_port (p) && port (p)->kind & port_input; |
349 | } |
353 | } |
350 | |
354 | |
351 | INTERFACE int |
355 | INTERFACE int |
352 | is_outport (pointer p) |
356 | is_outport (pointer p) |
353 | { |
357 | { |
354 | return is_port (p) && p->object.port->kind & port_output; |
358 | return is_port (p) && port (p)->kind & port_output; |
355 | } |
359 | } |
356 | |
360 | |
357 | INTERFACE int |
361 | INTERFACE int |
358 | is_pair (pointer p) |
362 | is_pair (pointer p) |
359 | { |
363 | { |
360 | return type (p) == T_PAIR; |
364 | return type (p) == T_PAIR; |
361 | } |
365 | } |
362 | |
366 | |
363 | #define car(p) ((p)->object.cons.car + 0) |
367 | #define car(p) (POINTER (CELL(p)->object.cons.car)) |
364 | #define cdr(p) ((p)->object.cons.cdr + 0) |
368 | #define cdr(p) (POINTER (CELL(p)->object.cons.cdr)) |
365 | |
369 | |
366 | static pointer caar (pointer p) { return car (car (p)); } |
370 | static pointer caar (pointer p) { return car (car (p)); } |
367 | static pointer cadr (pointer p) { return car (cdr (p)); } |
371 | static pointer cadr (pointer p) { return car (cdr (p)); } |
368 | static pointer cdar (pointer p) { return cdr (car (p)); } |
372 | static pointer cdar (pointer p) { return cdr (car (p)); } |
369 | static pointer cddr (pointer p) { return cdr (cdr (p)); } |
373 | static pointer cddr (pointer p) { return cdr (cdr (p)); } |
… | |
… | |
373 | static pointer cdaar (pointer p) { return cdr (car (car (p))); } |
377 | static pointer cdaar (pointer p) { return cdr (car (car (p))); } |
374 | |
378 | |
375 | INTERFACE void |
379 | INTERFACE void |
376 | set_car (pointer p, pointer q) |
380 | set_car (pointer p, pointer q) |
377 | { |
381 | { |
378 | p->object.cons.car = q; |
382 | CELL(p)->object.cons.car = CELL (q); |
379 | } |
383 | } |
380 | |
384 | |
381 | INTERFACE void |
385 | INTERFACE void |
382 | set_cdr (pointer p, pointer q) |
386 | set_cdr (pointer p, pointer q) |
383 | { |
387 | { |
384 | p->object.cons.cdr = q; |
388 | CELL(p)->object.cons.cdr = CELL (q); |
385 | } |
389 | } |
386 | |
390 | |
387 | INTERFACE pointer |
391 | INTERFACE pointer |
388 | pair_car (pointer p) |
392 | pair_car (pointer p) |
389 | { |
393 | { |
… | |
… | |
403 | } |
407 | } |
404 | |
408 | |
405 | INTERFACE char * |
409 | INTERFACE char * |
406 | symname (pointer p) |
410 | symname (pointer p) |
407 | { |
411 | { |
408 | return strvalue (car (p)); |
412 | return strvalue (p); |
409 | } |
413 | } |
410 | |
414 | |
411 | #if USE_PLIST |
415 | #if USE_PLIST |
|
|
416 | #error plists are broken because symbols are no longer pairs |
|
|
417 | #define symprop(p) cdr(p) |
412 | SCHEME_EXPORT int |
418 | SCHEME_EXPORT int |
413 | hasprop (pointer p) |
419 | hasprop (pointer p) |
414 | { |
420 | { |
415 | return typeflag (p) & T_SYMBOL; |
421 | return typeflag (p) & T_SYMBOL; |
416 | } |
422 | } |
417 | |
|
|
418 | # define symprop(p) cdr(p) |
|
|
419 | #endif |
423 | #endif |
420 | |
424 | |
421 | INTERFACE int |
425 | INTERFACE int |
422 | is_syntax (pointer p) |
426 | is_syntax (pointer p) |
423 | { |
427 | { |
… | |
… | |
437 | } |
441 | } |
438 | |
442 | |
439 | INTERFACE char * |
443 | INTERFACE char * |
440 | syntaxname (pointer p) |
444 | syntaxname (pointer p) |
441 | { |
445 | { |
442 | return strvalue (car (p)); |
446 | return strvalue (p); |
443 | } |
447 | } |
444 | |
448 | |
445 | #define procnum(p) ivalue (p) |
449 | #define procnum(p) ivalue_unchecked (p) |
446 | static const char *procname (pointer x); |
450 | static const char *procname (pointer x); |
447 | |
451 | |
448 | INTERFACE int |
452 | INTERFACE int |
449 | is_closure (pointer p) |
453 | is_closure (pointer p) |
450 | { |
454 | { |
… | |
… | |
511 | setimmutable (pointer p) |
515 | setimmutable (pointer p) |
512 | { |
516 | { |
513 | #if USE_ERROR_CHECKING |
517 | #if USE_ERROR_CHECKING |
514 | set_typeflag (p, typeflag (p) | T_IMMUTABLE); |
518 | set_typeflag (p, typeflag (p) | T_IMMUTABLE); |
515 | #endif |
519 | #endif |
|
|
520 | } |
|
|
521 | |
|
|
522 | /* Result is: |
|
|
523 | proper list: length |
|
|
524 | circular list: -1 |
|
|
525 | not even a pair: -2 |
|
|
526 | dotted list: -2 minus length before dot |
|
|
527 | */ |
|
|
528 | INTERFACE int |
|
|
529 | list_length (SCHEME_P_ pointer a) |
|
|
530 | { |
|
|
531 | int i = 0; |
|
|
532 | pointer slow, fast; |
|
|
533 | |
|
|
534 | slow = fast = a; |
|
|
535 | |
|
|
536 | while (1) |
|
|
537 | { |
|
|
538 | if (fast == NIL) |
|
|
539 | return i; |
|
|
540 | |
|
|
541 | if (!is_pair (fast)) |
|
|
542 | return -2 - i; |
|
|
543 | |
|
|
544 | fast = cdr (fast); |
|
|
545 | ++i; |
|
|
546 | |
|
|
547 | if (fast == NIL) |
|
|
548 | return i; |
|
|
549 | |
|
|
550 | if (!is_pair (fast)) |
|
|
551 | return -2 - i; |
|
|
552 | |
|
|
553 | ++i; |
|
|
554 | fast = cdr (fast); |
|
|
555 | |
|
|
556 | /* Safe because we would have already returned if `fast' |
|
|
557 | encountered a non-pair. */ |
|
|
558 | slow = cdr (slow); |
|
|
559 | |
|
|
560 | if (fast == slow) |
|
|
561 | { |
|
|
562 | /* the fast pointer has looped back around and caught up |
|
|
563 | with the slow pointer, hence the structure is circular, |
|
|
564 | not of finite length, and therefore not a list */ |
|
|
565 | return -1; |
|
|
566 | } |
|
|
567 | } |
|
|
568 | } |
|
|
569 | |
|
|
570 | INTERFACE int |
|
|
571 | is_list (SCHEME_P_ pointer a) |
|
|
572 | { |
|
|
573 | return list_length (SCHEME_A_ a) >= 0; |
516 | } |
574 | } |
517 | |
575 | |
518 | #if USE_CHAR_CLASSIFIERS |
576 | #if USE_CHAR_CLASSIFIERS |
519 | ecb_inline int |
577 | ecb_inline int |
520 | Cisalpha (int c) |
578 | Cisalpha (int c) |
… | |
… | |
609 | #endif |
667 | #endif |
610 | |
668 | |
611 | static int file_push (SCHEME_P_ const char *fname); |
669 | static int file_push (SCHEME_P_ const char *fname); |
612 | static void file_pop (SCHEME_P); |
670 | static void file_pop (SCHEME_P); |
613 | static int file_interactive (SCHEME_P); |
671 | static int file_interactive (SCHEME_P); |
614 | ecb_inline int is_one_of (char *s, int c); |
672 | ecb_inline int is_one_of (const char *s, int c); |
615 | static int alloc_cellseg (SCHEME_P_ int n); |
673 | static int alloc_cellseg (SCHEME_P); |
616 | ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b); |
674 | ecb_inline pointer get_cell (SCHEME_P_ pointer a, pointer b); |
617 | static void finalize_cell (SCHEME_P_ pointer a); |
675 | static void finalize_cell (SCHEME_P_ pointer a); |
618 | static int count_consecutive_cells (pointer x, int needed); |
676 | static int count_consecutive_cells (pointer x, int needed); |
619 | static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all); |
677 | static pointer find_slot_in_env (SCHEME_P_ pointer env, pointer sym, int all); |
620 | static pointer mk_number (SCHEME_P_ const num n); |
678 | static pointer mk_number (SCHEME_P_ const num n); |
… | |
… | |
636 | static void mark (pointer a); |
694 | static void mark (pointer a); |
637 | static void gc (SCHEME_P_ pointer a, pointer b); |
695 | static void gc (SCHEME_P_ pointer a, pointer b); |
638 | static int basic_inchar (port *pt); |
696 | static int basic_inchar (port *pt); |
639 | static int inchar (SCHEME_P); |
697 | static int inchar (SCHEME_P); |
640 | static void backchar (SCHEME_P_ int c); |
698 | static void backchar (SCHEME_P_ int c); |
641 | static char *readstr_upto (SCHEME_P_ char *delim); |
699 | static char *readstr_upto (SCHEME_P_ int skip, const char *delim); |
642 | static pointer readstrexp (SCHEME_P); |
700 | static pointer readstrexp (SCHEME_P_ char delim); |
643 | ecb_inline int skipspace (SCHEME_P); |
701 | ecb_inline int skipspace (SCHEME_P); |
644 | static int token (SCHEME_P); |
702 | static int token (SCHEME_P); |
645 | static void printslashstring (SCHEME_P_ char *s, int len); |
703 | static void printslashstring (SCHEME_P_ char *s, int len); |
646 | static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen); |
704 | static void atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen); |
647 | static void printatom (SCHEME_P_ pointer l, int f); |
705 | static void printatom (SCHEME_P_ pointer l, int f); |
… | |
… | |
664 | static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op); |
722 | static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op); |
665 | static void assign_syntax (SCHEME_P_ const char *name); |
723 | static void assign_syntax (SCHEME_P_ const char *name); |
666 | static int syntaxnum (pointer p); |
724 | static int syntaxnum (pointer p); |
667 | static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name); |
725 | static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name); |
668 | |
726 | |
|
|
727 | static IVALUE |
|
|
728 | ivalue (pointer x) |
|
|
729 | { |
|
|
730 | return is_integer (x) ? ivalue_unchecked (x) : rvalue_unchecked (x); |
|
|
731 | } |
|
|
732 | |
|
|
733 | static RVALUE |
|
|
734 | rvalue (pointer x) |
|
|
735 | { |
|
|
736 | return is_integer (x) ? ivalue_unchecked (x) : rvalue_unchecked (x); |
|
|
737 | } |
|
|
738 | |
|
|
739 | INTERFACE num |
|
|
740 | nvalue (pointer x) |
|
|
741 | { |
|
|
742 | num n; |
|
|
743 | |
|
|
744 | num_set_fixnum (n, is_integer (x)); |
|
|
745 | |
|
|
746 | if (num_is_fixnum (n)) |
|
|
747 | num_set_ivalue (n, ivalue_unchecked (x)); |
|
|
748 | else |
|
|
749 | num_set_rvalue (n, rvalue_unchecked (x)); |
|
|
750 | |
|
|
751 | return n; |
|
|
752 | } |
|
|
753 | |
669 | static num |
754 | static num |
670 | num_op (enum num_op op, num a, num b) |
755 | num_op (enum num_op op, num a, num b) |
671 | { |
756 | { |
672 | num ret; |
757 | num ret; |
673 | |
758 | |
674 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
759 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
675 | |
760 | |
676 | if (num_is_fixnum (ret)) |
761 | if (num_is_fixnum (ret)) |
677 | { |
762 | { |
678 | IVALUE av = num_get_ivalue (a); |
|
|
679 | IVALUE bv = num_get_ivalue (b); |
|
|
680 | |
|
|
681 | switch (op) |
763 | switch (op) |
682 | { |
764 | { |
683 | case NUM_ADD: av += bv; break; |
765 | case NUM_ADD: a.ivalue += b.ivalue; break; |
684 | case NUM_SUB: av -= bv; break; |
766 | case NUM_SUB: a.ivalue -= b.ivalue; break; |
685 | case NUM_MUL: av *= bv; break; |
767 | case NUM_MUL: a.ivalue *= b.ivalue; break; |
686 | case NUM_INTDIV: av /= bv; break; |
768 | case NUM_INTDIV: a.ivalue /= b.ivalue; break; |
687 | } |
769 | } |
688 | |
770 | |
689 | num_set_ivalue (ret, av); |
771 | num_set_ivalue (ret, a.ivalue); |
690 | } |
772 | } |
|
|
773 | #if USE_REAL |
691 | else |
774 | else |
692 | { |
775 | { |
693 | RVALUE av = num_get_rvalue (a); |
|
|
694 | RVALUE bv = num_get_rvalue (b); |
|
|
695 | |
|
|
696 | switch (op) |
776 | switch (op) |
697 | { |
777 | { |
698 | case NUM_ADD: av += bv; break; |
778 | case NUM_ADD: a.rvalue += b.rvalue; break; |
699 | case NUM_SUB: av -= bv; break; |
779 | case NUM_SUB: a.rvalue -= b.rvalue; break; |
700 | case NUM_MUL: av *= bv; break; |
780 | case NUM_MUL: a.rvalue *= b.rvalue; break; |
701 | case NUM_INTDIV: av /= bv; break; |
781 | case NUM_INTDIV: a.rvalue /= b.rvalue; break; |
702 | } |
782 | } |
703 | |
783 | |
704 | num_set_rvalue (ret, av); |
784 | num_set_rvalue (ret, a.rvalue); |
705 | } |
785 | } |
|
|
786 | #endif |
706 | |
787 | |
707 | return ret; |
788 | return ret; |
708 | } |
789 | } |
709 | |
790 | |
710 | static num |
791 | static num |
711 | num_div (num a, num b) |
792 | num_div (num a, num b) |
712 | { |
793 | { |
713 | num ret; |
794 | num ret; |
714 | |
795 | |
715 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_get_ivalue (a) % num_get_ivalue (b) == 0); |
796 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b) && num_ivalue (a) % num_ivalue (b) == 0); |
716 | |
797 | |
717 | if (num_is_fixnum (ret)) |
798 | if (num_is_fixnum (ret)) |
718 | num_set_ivalue (ret, num_get_ivalue (a) / num_get_ivalue (b)); |
799 | num_set_ivalue (ret, num_ivalue (a) / num_ivalue (b)); |
719 | else |
800 | else |
720 | num_set_rvalue (ret, num_get_rvalue (a) / num_get_rvalue (b)); |
801 | num_set_rvalue (ret, num_rvalue (a) / num_rvalue (b)); |
721 | |
802 | |
722 | return ret; |
803 | return ret; |
723 | } |
804 | } |
724 | |
805 | |
725 | static num |
806 | static num |
… | |
… | |
727 | { |
808 | { |
728 | num ret; |
809 | num ret; |
729 | long e1, e2, res; |
810 | long e1, e2, res; |
730 | |
811 | |
731 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
812 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
732 | e1 = num_get_ivalue (a); |
813 | e1 = num_ivalue (a); |
733 | e2 = num_get_ivalue (b); |
814 | e2 = num_ivalue (b); |
734 | res = e1 % e2; |
815 | res = e1 % e2; |
735 | |
816 | |
736 | /* remainder should have same sign as second operand */ |
817 | /* remainder should have same sign as second operand */ |
737 | if (res > 0) |
818 | if (res > 0) |
738 | { |
819 | { |
… | |
… | |
754 | { |
835 | { |
755 | num ret; |
836 | num ret; |
756 | long e1, e2, res; |
837 | long e1, e2, res; |
757 | |
838 | |
758 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
839 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
759 | e1 = num_get_ivalue (a); |
840 | e1 = num_ivalue (a); |
760 | e2 = num_get_ivalue (b); |
841 | e2 = num_ivalue (b); |
761 | res = e1 % e2; |
842 | res = e1 % e2; |
762 | |
843 | |
763 | /* modulo should have same sign as second operand */ |
844 | /* modulo should have same sign as second operand */ |
764 | if (res * e2 < 0) |
845 | if (res * e2 < 0) |
765 | res += e2; |
846 | res += e2; |
… | |
… | |
775 | int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b); |
856 | int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b); |
776 | int ret; |
857 | int ret; |
777 | |
858 | |
778 | if (is_fixnum) |
859 | if (is_fixnum) |
779 | { |
860 | { |
780 | IVALUE av = num_get_ivalue (a); |
861 | IVALUE av = num_ivalue (a); |
781 | IVALUE bv = num_get_ivalue (b); |
862 | IVALUE bv = num_ivalue (b); |
782 | |
863 | |
783 | ret = av == bv ? 0 : av < bv ? -1 : +1; |
864 | ret = av == bv ? 0 : av < bv ? -1 : +1; |
784 | } |
865 | } |
785 | else |
866 | else |
786 | { |
867 | { |
787 | RVALUE av = num_get_rvalue (a); |
868 | RVALUE av = num_rvalue (a); |
788 | RVALUE bv = num_get_rvalue (b); |
869 | RVALUE bv = num_rvalue (b); |
789 | |
870 | |
790 | ret = av == bv ? 0 : av < bv ? -1 : +1; |
871 | ret = av == bv ? 0 : av < bv ? -1 : +1; |
791 | } |
872 | } |
792 | |
873 | |
793 | return ret; |
874 | return ret; |
… | |
… | |
831 | #endif |
912 | #endif |
832 | } |
913 | } |
833 | |
914 | |
834 | /* allocate new cell segment */ |
915 | /* allocate new cell segment */ |
835 | static int |
916 | static int |
836 | alloc_cellseg (SCHEME_P_ int n) |
917 | alloc_cellseg (SCHEME_P) |
837 | { |
918 | { |
838 | pointer newp; |
919 | struct cell *newp; |
839 | pointer last; |
920 | struct cell *last; |
840 | pointer p; |
921 | struct cell *p; |
841 | char *cp; |
922 | char *cp; |
842 | long i; |
923 | long i; |
843 | int k; |
924 | int k; |
844 | |
925 | |
845 | static int segsize = CELL_SEGSIZE >> 1; |
926 | static int segsize = CELL_SEGSIZE >> 1; |
846 | segsize <<= 1; |
927 | segsize <<= 1; |
847 | |
928 | |
848 | for (k = 0; k < n; k++) |
|
|
849 | { |
|
|
850 | if (SCHEME_V->last_cell_seg >= CELL_NSEGMENT - 1) |
|
|
851 | return k; |
|
|
852 | |
|
|
853 | cp = malloc (segsize * sizeof (struct cell)); |
929 | cp = malloc (segsize * sizeof (struct cell)); |
854 | |
930 | |
855 | if (!cp && USE_ERROR_CHECKING) |
931 | if (!cp && USE_ERROR_CHECKING) |
856 | return k; |
932 | return k; |
857 | |
933 | |
858 | i = ++SCHEME_V->last_cell_seg; |
934 | i = ++SCHEME_V->last_cell_seg; |
859 | SCHEME_V->alloc_seg[i] = cp; |
935 | SCHEME_V->alloc_seg[i] = cp; |
860 | |
936 | |
861 | /* insert new segment in address order */ |
937 | newp = (struct cell *)cp; |
862 | newp = (pointer)cp; |
|
|
863 | SCHEME_V->cell_seg[i] = newp; |
938 | SCHEME_V->cell_seg[i] = newp; |
864 | SCHEME_V->cell_segsize[i] = segsize; |
939 | SCHEME_V->cell_segsize[i] = segsize; |
865 | |
|
|
866 | //TODO: insert, not swap |
|
|
867 | while (i > 0 && SCHEME_V->cell_seg[i - 1] > SCHEME_V->cell_seg[i]) |
|
|
868 | { |
|
|
869 | p = SCHEME_V->cell_seg[i]; |
|
|
870 | SCHEME_V->cell_seg[i] = SCHEME_V->cell_seg[i - 1]; |
|
|
871 | SCHEME_V->cell_seg[i - 1] = p; |
|
|
872 | |
|
|
873 | k = SCHEME_V->cell_segsize[i]; |
|
|
874 | SCHEME_V->cell_segsize[i] = SCHEME_V->cell_segsize[i - 1]; |
|
|
875 | SCHEME_V->cell_segsize[i - 1] = k; |
|
|
876 | |
|
|
877 | --i; |
|
|
878 | } |
|
|
879 | |
|
|
880 | SCHEME_V->fcells += segsize; |
940 | SCHEME_V->fcells += segsize; |
881 | last = newp + segsize - 1; |
941 | last = newp + segsize - 1; |
882 | |
942 | |
883 | for (p = newp; p <= last; p++) |
943 | for (p = newp; p <= last; p++) |
884 | { |
944 | { |
|
|
945 | pointer cp = POINTER (p); |
885 | set_typeflag (p, T_FREE); |
946 | set_typeflag (cp, T_PAIR); |
886 | set_car (p, NIL); |
947 | set_car (cp, NIL); |
887 | set_cdr (p, p + 1); |
948 | set_cdr (cp, POINTER (p + 1)); |
888 | } |
949 | } |
889 | |
950 | |
890 | /* insert new cells in address order on free list */ |
|
|
891 | if (SCHEME_V->free_cell == NIL || p < SCHEME_V->free_cell) |
|
|
892 | { |
|
|
893 | set_cdr (last, SCHEME_V->free_cell); |
951 | set_cdr (POINTER (last), SCHEME_V->free_cell); |
894 | SCHEME_V->free_cell = newp; |
952 | SCHEME_V->free_cell = POINTER (newp); |
895 | } |
|
|
896 | else |
|
|
897 | { |
|
|
898 | p = SCHEME_V->free_cell; |
|
|
899 | |
953 | |
900 | while (cdr (p) != NIL && newp > cdr (p)) |
|
|
901 | p = cdr (p); |
|
|
902 | |
|
|
903 | set_cdr (last, cdr (p)); |
|
|
904 | set_cdr (p, newp); |
|
|
905 | } |
|
|
906 | } |
|
|
907 | |
|
|
908 | return n; |
954 | return 1; |
909 | } |
955 | } |
910 | |
956 | |
911 | /* get new cell. parameter a, b is marked by gc. */ |
957 | /* get new cell. parameter a, b is marked by gc. */ |
912 | ecb_inline pointer |
958 | ecb_inline pointer |
913 | get_cell_x (SCHEME_P_ pointer a, pointer b) |
959 | get_cell_x (SCHEME_P_ pointer a, pointer b) |
… | |
… | |
917 | if (SCHEME_V->no_memory && USE_ERROR_CHECKING) |
963 | if (SCHEME_V->no_memory && USE_ERROR_CHECKING) |
918 | return S_SINK; |
964 | return S_SINK; |
919 | |
965 | |
920 | if (SCHEME_V->free_cell == NIL) |
966 | if (SCHEME_V->free_cell == NIL) |
921 | { |
967 | { |
922 | const int min_to_be_recovered = SCHEME_V->last_cell_seg < 128 ? 128 * 8 : SCHEME_V->last_cell_seg * 8; |
968 | const int min_to_be_recovered = SCHEME_V->cell_segsize [SCHEME_V->last_cell_seg] >> 1; |
923 | |
969 | |
924 | gc (SCHEME_A_ a, b); |
970 | gc (SCHEME_A_ a, b); |
925 | |
971 | |
926 | if (SCHEME_V->fcells < min_to_be_recovered || SCHEME_V->free_cell == NIL) |
972 | if (SCHEME_V->fcells < min_to_be_recovered || SCHEME_V->free_cell == NIL) |
927 | { |
973 | { |
928 | /* if only a few recovered, get more to avoid fruitless gc's */ |
974 | /* if only a few recovered, get more to avoid fruitless gc's */ |
929 | if (!alloc_cellseg (SCHEME_A_ 1) && SCHEME_V->free_cell == NIL) |
975 | if (!alloc_cellseg (SCHEME_A) && SCHEME_V->free_cell == NIL) |
930 | { |
976 | { |
931 | #if USE_ERROR_CHECKING |
977 | #if USE_ERROR_CHECKING |
932 | SCHEME_V->no_memory = 1; |
978 | SCHEME_V->no_memory = 1; |
933 | return S_SINK; |
979 | return S_SINK; |
934 | #endif |
980 | #endif |
… | |
… | |
946 | } |
992 | } |
947 | } |
993 | } |
948 | |
994 | |
949 | /* To retain recent allocs before interpreter knows about them - |
995 | /* To retain recent allocs before interpreter knows about them - |
950 | Tehom */ |
996 | Tehom */ |
951 | |
|
|
952 | static void |
997 | static void |
953 | push_recent_alloc (SCHEME_P_ pointer recent, pointer extra) |
998 | push_recent_alloc (SCHEME_P_ pointer recent, pointer extra) |
954 | { |
999 | { |
955 | pointer holder = get_cell_x (SCHEME_A_ recent, extra); |
1000 | pointer holder = get_cell_x (SCHEME_A_ recent, extra); |
956 | |
1001 | |
… | |
… | |
978 | } |
1023 | } |
979 | |
1024 | |
980 | static pointer |
1025 | static pointer |
981 | get_vector_object (SCHEME_P_ uint32_t len, pointer init) |
1026 | get_vector_object (SCHEME_P_ uint32_t len, pointer init) |
982 | { |
1027 | { |
983 | pointer v = get_cell_x (SCHEME_A_ 0, 0); |
1028 | pointer v = get_cell_x (SCHEME_A_ NIL, NIL); |
984 | pointer *e = malloc (len * sizeof (pointer)); |
1029 | pointer *e = malloc (len * sizeof (pointer)); |
985 | |
1030 | |
986 | if (!e && USE_ERROR_CHECKING) |
1031 | if (!e && USE_ERROR_CHECKING) |
987 | return S_SINK; |
1032 | return S_SINK; |
988 | |
1033 | |
989 | /* Record it as a vector so that gc understands it. */ |
1034 | /* Record it as a vector so that gc understands it. */ |
990 | set_typeflag (v, T_VECTOR | T_ATOM); |
1035 | set_typeflag (v, T_VECTOR | T_ATOM); |
991 | |
1036 | |
992 | v->object.vector.vvalue = e; |
1037 | CELL(v)->object.vector.vvalue = e; |
993 | v->object.vector.length = len; |
1038 | CELL(v)->object.vector.length = len; |
994 | fill_vector (v, init); |
1039 | fill_vector (v, 0, init); |
995 | push_recent_alloc (SCHEME_A_ v, NIL); |
1040 | push_recent_alloc (SCHEME_A_ v, NIL); |
996 | |
1041 | |
997 | return v; |
1042 | return v; |
998 | } |
1043 | } |
999 | |
1044 | |
… | |
… | |
1007 | static void |
1052 | static void |
1008 | check_cell_alloced (pointer p, int expect_alloced) |
1053 | check_cell_alloced (pointer p, int expect_alloced) |
1009 | { |
1054 | { |
1010 | /* Can't use putstr(SCHEME_A_ str) because callers have no access to sc. */ |
1055 | /* Can't use putstr(SCHEME_A_ str) because callers have no access to sc. */ |
1011 | if (typeflag (p) & !expect_alloced) |
1056 | if (typeflag (p) & !expect_alloced) |
1012 | xwrstr ("Cell is already allocated!\n"); |
1057 | putstr (SCHEME_A_ "Cell is already allocated!\n"); |
1013 | |
1058 | |
1014 | if (!(typeflag (p)) & expect_alloced) |
1059 | if (!(typeflag (p)) & expect_alloced) |
1015 | xwrstr ("Cell is not allocated!\n"); |
1060 | putstr (SCHEME_A_ "Cell is not allocated!\n"); |
1016 | } |
1061 | } |
1017 | |
1062 | |
1018 | static void |
1063 | static void |
1019 | check_range_alloced (pointer p, int n, int expect_alloced) |
1064 | check_range_alloced (pointer p, int n, int expect_alloced) |
1020 | { |
1065 | { |
… | |
… | |
1042 | set_cdr (x, b); |
1087 | set_cdr (x, b); |
1043 | |
1088 | |
1044 | return x; |
1089 | return x; |
1045 | } |
1090 | } |
1046 | |
1091 | |
|
|
1092 | static pointer |
|
|
1093 | generate_symbol (SCHEME_P_ const char *name) |
|
|
1094 | { |
|
|
1095 | pointer x = mk_string (SCHEME_A_ name); |
|
|
1096 | setimmutable (x); |
|
|
1097 | set_typeflag (x, T_SYMBOL | T_ATOM); |
|
|
1098 | return x; |
|
|
1099 | } |
|
|
1100 | |
1047 | /* ========== oblist implementation ========== */ |
1101 | /* ========== oblist implementation ========== */ |
1048 | |
1102 | |
1049 | #ifndef USE_OBJECT_LIST |
1103 | #ifndef USE_OBJECT_LIST |
1050 | |
1104 | |
|
|
1105 | static int |
1051 | static int hash_fn (const char *key, int table_size); |
1106 | hash_fn (const char *key, int table_size) |
|
|
1107 | { |
|
|
1108 | const unsigned char *p = key; |
|
|
1109 | uint32_t hash = 2166136261; |
|
|
1110 | |
|
|
1111 | while (*p) |
|
|
1112 | hash = (hash ^ *p++) * 16777619; |
|
|
1113 | |
|
|
1114 | return hash % table_size; |
|
|
1115 | } |
1052 | |
1116 | |
1053 | static pointer |
1117 | static pointer |
1054 | oblist_initial_value (SCHEME_P) |
1118 | oblist_initial_value (SCHEME_P) |
1055 | { |
1119 | { |
1056 | return mk_vector (SCHEME_A_ 461); /* probably should be bigger */ |
1120 | return mk_vector (SCHEME_A_ 461); /* probably should be bigger */ |
… | |
… | |
1058 | |
1122 | |
1059 | /* returns the new symbol */ |
1123 | /* returns the new symbol */ |
1060 | static pointer |
1124 | static pointer |
1061 | oblist_add_by_name (SCHEME_P_ const char *name) |
1125 | oblist_add_by_name (SCHEME_P_ const char *name) |
1062 | { |
1126 | { |
1063 | int location; |
1127 | pointer x = generate_symbol (SCHEME_A_ name); |
1064 | |
|
|
1065 | pointer x = immutable_cons (mk_string (SCHEME_A_ name), NIL); |
|
|
1066 | set_typeflag (x, T_SYMBOL); |
|
|
1067 | setimmutable (car (x)); |
|
|
1068 | |
|
|
1069 | location = hash_fn (name, veclength (SCHEME_V->oblist)); |
1128 | int location = hash_fn (name, veclength (SCHEME_V->oblist)); |
1070 | set_vector_elem (SCHEME_V->oblist, location, immutable_cons (x, vector_elem (SCHEME_V->oblist, location))); |
1129 | vector_set (SCHEME_V->oblist, location, immutable_cons (x, vector_get (SCHEME_V->oblist, location))); |
1071 | return x; |
1130 | return x; |
1072 | } |
1131 | } |
1073 | |
1132 | |
1074 | ecb_inline pointer |
1133 | ecb_inline pointer |
1075 | oblist_find_by_name (SCHEME_P_ const char *name) |
1134 | oblist_find_by_name (SCHEME_P_ const char *name) |
… | |
… | |
1078 | pointer x; |
1137 | pointer x; |
1079 | char *s; |
1138 | char *s; |
1080 | |
1139 | |
1081 | location = hash_fn (name, veclength (SCHEME_V->oblist)); |
1140 | location = hash_fn (name, veclength (SCHEME_V->oblist)); |
1082 | |
1141 | |
1083 | for (x = vector_elem (SCHEME_V->oblist, location); x != NIL; x = cdr (x)) |
1142 | for (x = vector_get (SCHEME_V->oblist, location); x != NIL; x = cdr (x)) |
1084 | { |
1143 | { |
1085 | s = symname (car (x)); |
1144 | s = symname (car (x)); |
1086 | |
1145 | |
1087 | /* case-insensitive, per R5RS section 2 */ |
1146 | /* case-insensitive, per R5RS section 2 */ |
1088 | if (stricmp (name, s) == 0) |
1147 | if (stricmp (name, s) == 0) |
… | |
… | |
1098 | int i; |
1157 | int i; |
1099 | pointer x; |
1158 | pointer x; |
1100 | pointer ob_list = NIL; |
1159 | pointer ob_list = NIL; |
1101 | |
1160 | |
1102 | for (i = 0; i < veclength (SCHEME_V->oblist); i++) |
1161 | for (i = 0; i < veclength (SCHEME_V->oblist); i++) |
1103 | for (x = vector_elem (SCHEME_V->oblist, i); x != NIL; x = cdr (x)) |
1162 | for (x = vector_get (SCHEME_V->oblist, i); x != NIL; x = cdr (x)) |
1104 | ob_list = cons (x, ob_list); |
1163 | ob_list = cons (x, ob_list); |
1105 | |
1164 | |
1106 | return ob_list; |
1165 | return ob_list; |
1107 | } |
1166 | } |
1108 | |
1167 | |
… | |
… | |
1134 | |
1193 | |
1135 | /* returns the new symbol */ |
1194 | /* returns the new symbol */ |
1136 | static pointer |
1195 | static pointer |
1137 | oblist_add_by_name (SCHEME_P_ const char *name) |
1196 | oblist_add_by_name (SCHEME_P_ const char *name) |
1138 | { |
1197 | { |
1139 | pointer x; |
1198 | pointer x = generate_symbol (SCHEME_A_ name); |
1140 | |
|
|
1141 | x = immutable_cons (mk_string (SCHEME_A_ name), NIL); |
|
|
1142 | set_typeflag (x, T_SYMBOL); |
|
|
1143 | setimmutable (car (x)); |
|
|
1144 | SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist); |
1199 | SCHEME_V->oblist = immutable_cons (x, SCHEME_V->oblist); |
1145 | return x; |
1200 | return x; |
1146 | } |
1201 | } |
1147 | |
1202 | |
1148 | static pointer |
1203 | static pointer |
… | |
… | |
1158 | mk_port (SCHEME_P_ port *p) |
1213 | mk_port (SCHEME_P_ port *p) |
1159 | { |
1214 | { |
1160 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1215 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1161 | |
1216 | |
1162 | set_typeflag (x, T_PORT | T_ATOM); |
1217 | set_typeflag (x, T_PORT | T_ATOM); |
1163 | x->object.port = p; |
1218 | set_port (x, p); |
1164 | |
1219 | |
1165 | return x; |
1220 | return x; |
1166 | } |
1221 | } |
1167 | #endif |
1222 | #endif |
1168 | |
1223 | |
1169 | pointer |
1224 | pointer |
1170 | mk_foreign_func (SCHEME_P_ foreign_func f) |
1225 | mk_foreign_func (SCHEME_P_ foreign_func f) |
1171 | { |
1226 | { |
1172 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1227 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1173 | |
1228 | |
1174 | set_typeflag (x, (T_FOREIGN | T_ATOM)); |
1229 | set_typeflag (x, T_FOREIGN | T_ATOM); |
1175 | x->object.ff = f; |
1230 | CELL(x)->object.ff = f; |
1176 | |
1231 | |
1177 | return x; |
1232 | return x; |
1178 | } |
1233 | } |
1179 | |
1234 | |
1180 | INTERFACE pointer |
1235 | INTERFACE pointer |
1181 | mk_character (SCHEME_P_ int c) |
1236 | mk_character (SCHEME_P_ int c) |
1182 | { |
1237 | { |
1183 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1238 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1184 | |
1239 | |
1185 | set_typeflag (x, (T_CHARACTER | T_ATOM)); |
1240 | set_typeflag (x, T_CHARACTER | T_ATOM); |
1186 | ivalue_unchecked (x) = c & 0xff; |
1241 | set_ivalue (x, c & 0xff); |
1187 | set_num_integer (x); |
1242 | |
1188 | return x; |
1243 | return x; |
1189 | } |
1244 | } |
1190 | |
1245 | |
1191 | /* get number atom (integer) */ |
1246 | /* get number atom (integer) */ |
1192 | INTERFACE pointer |
1247 | INTERFACE pointer |
1193 | mk_integer (SCHEME_P_ long num) |
1248 | mk_integer (SCHEME_P_ long n) |
1194 | { |
1249 | { |
|
|
1250 | pointer p = 0; |
|
|
1251 | pointer *pp = &p; |
|
|
1252 | |
|
|
1253 | #if USE_INTCACHE |
|
|
1254 | if (n >= INTCACHE_MIN && n <= INTCACHE_MAX) |
|
|
1255 | pp = &SCHEME_V->intcache[n - INTCACHE_MIN]; |
|
|
1256 | #endif |
|
|
1257 | |
|
|
1258 | if (!*pp) |
|
|
1259 | { |
1195 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1260 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1196 | |
1261 | |
1197 | set_typeflag (x, (T_NUMBER | T_ATOM)); |
1262 | set_typeflag (x, T_INTEGER | T_ATOM); |
1198 | ivalue_unchecked (x) = num; |
1263 | setimmutable (x); /* shouldn't do anythi9ng, doesn't cost anything */ |
1199 | set_num_integer (x); |
1264 | set_ivalue (x, n); |
|
|
1265 | |
|
|
1266 | *pp = x; |
|
|
1267 | } |
|
|
1268 | |
1200 | return x; |
1269 | return *pp; |
1201 | } |
1270 | } |
1202 | |
1271 | |
1203 | INTERFACE pointer |
1272 | INTERFACE pointer |
1204 | mk_real (SCHEME_P_ RVALUE n) |
1273 | mk_real (SCHEME_P_ RVALUE n) |
1205 | { |
1274 | { |
|
|
1275 | #if USE_REAL |
1206 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1276 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1207 | |
1277 | |
1208 | set_typeflag (x, (T_NUMBER | T_ATOM)); |
1278 | set_typeflag (x, T_REAL | T_ATOM); |
1209 | rvalue_unchecked (x) = n; |
1279 | set_rvalue (x, n); |
1210 | set_num_real (x); |
1280 | |
1211 | return x; |
1281 | return x; |
|
|
1282 | #else |
|
|
1283 | return mk_integer (SCHEME_A_ n); |
|
|
1284 | #endif |
1212 | } |
1285 | } |
1213 | |
1286 | |
1214 | static pointer |
1287 | static pointer |
1215 | mk_number (SCHEME_P_ const num n) |
1288 | mk_number (SCHEME_P_ const num n) |
1216 | { |
1289 | { |
|
|
1290 | #if USE_REAL |
1217 | if (num_is_fixnum (n)) |
1291 | return num_is_fixnum (n) |
|
|
1292 | ? mk_integer (SCHEME_A_ num_ivalue (n)) |
|
|
1293 | : mk_real (SCHEME_A_ num_rvalue (n)); |
|
|
1294 | #else |
1218 | return mk_integer (SCHEME_A_ num_get_ivalue (n)); |
1295 | return mk_integer (SCHEME_A_ num_ivalue (n)); |
1219 | else |
1296 | #endif |
1220 | return mk_real (SCHEME_A_ num_get_rvalue (n)); |
|
|
1221 | } |
1297 | } |
1222 | |
1298 | |
1223 | /* allocate name to string area */ |
1299 | /* allocate name to string area */ |
1224 | static char * |
1300 | static char * |
1225 | store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill) |
1301 | store_string (SCHEME_P_ uint32_t len_str, const char *str, char fill) |
… | |
… | |
1231 | SCHEME_V->no_memory = 1; |
1307 | SCHEME_V->no_memory = 1; |
1232 | return SCHEME_V->strbuff; |
1308 | return SCHEME_V->strbuff; |
1233 | } |
1309 | } |
1234 | |
1310 | |
1235 | if (str) |
1311 | if (str) |
1236 | { |
1312 | memcpy (q, str , len_str); /* caller must ensure that *str has length len_str */ |
1237 | int l = strlen (str); |
|
|
1238 | |
|
|
1239 | if (l > len_str) |
|
|
1240 | l = len_str; |
|
|
1241 | |
|
|
1242 | memcpy (q, str, l); |
|
|
1243 | q[l] = 0; |
|
|
1244 | } |
|
|
1245 | else |
1313 | else |
1246 | { |
|
|
1247 | memset (q, fill, len_str); |
1314 | memset (q, fill, len_str); |
|
|
1315 | |
1248 | q[len_str] = 0; |
1316 | q[len_str] = 0; |
1249 | } |
|
|
1250 | |
1317 | |
1251 | return q; |
1318 | return q; |
1252 | } |
1319 | } |
1253 | |
1320 | |
1254 | INTERFACE pointer |
1321 | INTERFACE pointer |
… | |
… | |
1268 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1335 | pointer x = get_cell (SCHEME_A_ NIL, NIL); |
1269 | |
1336 | |
1270 | set_typeflag (x, T_STRING | T_ATOM); |
1337 | set_typeflag (x, T_STRING | T_ATOM); |
1271 | strvalue (x) = store_string (SCHEME_A_ len, str, 0); |
1338 | strvalue (x) = store_string (SCHEME_A_ len, str, 0); |
1272 | strlength (x) = len; |
1339 | strlength (x) = len; |
|
|
1340 | |
1273 | return x; |
1341 | return x; |
1274 | } |
1342 | } |
1275 | |
1343 | |
1276 | INTERFACE pointer |
1344 | INTERFACE pointer |
1277 | mk_string (SCHEME_P_ const char *str) |
1345 | mk_string (SCHEME_P_ const char *str) |
… | |
… | |
1284 | { |
1352 | { |
1285 | return get_vector_object (SCHEME_A_ len, NIL); |
1353 | return get_vector_object (SCHEME_A_ len, NIL); |
1286 | } |
1354 | } |
1287 | |
1355 | |
1288 | INTERFACE void |
1356 | INTERFACE void |
1289 | fill_vector (pointer vec, pointer obj) |
1357 | fill_vector (pointer vec, uint32_t start, pointer obj) |
1290 | { |
1358 | { |
1291 | int i; |
1359 | int i; |
1292 | |
1360 | |
1293 | for (i = 0; i < vec->object.vector.length; i++) |
1361 | for (i = start; i < veclength (vec); i++) |
1294 | vecvalue (vec)[i] = obj; |
1362 | vecvalue (vec)[i] = obj; |
1295 | } |
1363 | } |
1296 | |
1364 | |
|
|
1365 | INTERFACE void |
|
|
1366 | vector_resize (pointer vec, uint32_t newsize, pointer fill) |
|
|
1367 | { |
|
|
1368 | uint32_t oldsize = veclength (vec); |
|
|
1369 | vecvalue (vec) = realloc (vecvalue (vec), newsize * sizeof (pointer)); |
|
|
1370 | veclength (vec) = newsize; |
|
|
1371 | fill_vector (vec, oldsize, fill); |
|
|
1372 | } |
|
|
1373 | |
1297 | INTERFACE pointer |
1374 | INTERFACE pointer |
1298 | vector_elem (pointer vec, uint32_t ielem) |
1375 | vector_get (pointer vec, uint32_t ielem) |
1299 | { |
1376 | { |
1300 | return vecvalue(vec)[ielem]; |
1377 | return vecvalue(vec)[ielem]; |
1301 | } |
1378 | } |
1302 | |
1379 | |
1303 | INTERFACE void |
1380 | INTERFACE void |
1304 | set_vector_elem (pointer vec, uint32_t ielem, pointer a) |
1381 | vector_set (pointer vec, uint32_t ielem, pointer a) |
1305 | { |
1382 | { |
1306 | vecvalue(vec)[ielem] = a; |
1383 | vecvalue(vec)[ielem] = a; |
1307 | } |
1384 | } |
1308 | |
1385 | |
1309 | /* get new symbol */ |
1386 | /* get new symbol */ |
… | |
… | |
1321 | |
1398 | |
1322 | INTERFACE pointer |
1399 | INTERFACE pointer |
1323 | gensym (SCHEME_P) |
1400 | gensym (SCHEME_P) |
1324 | { |
1401 | { |
1325 | pointer x; |
1402 | pointer x; |
1326 | |
|
|
1327 | for (; SCHEME_V->gensym_cnt < LONG_MAX; SCHEME_V->gensym_cnt++) |
|
|
1328 | { |
|
|
1329 | char name[40] = "gensym-"; |
1403 | char name[40] = "gensym-"; |
1330 | xnum (name + 7, SCHEME_V->gensym_cnt); |
1404 | xnum (name + 7, ++SCHEME_V->gensym_cnt); |
1331 | |
1405 | |
1332 | /* first check oblist */ |
1406 | return generate_symbol (SCHEME_A_ name); |
1333 | x = oblist_find_by_name (SCHEME_A_ name); |
1407 | } |
1334 | |
1408 | |
1335 | if (x == NIL) |
1409 | static int |
1336 | { |
1410 | is_gensym (SCHEME_P_ pointer x) |
1337 | x = oblist_add_by_name (SCHEME_A_ name); |
1411 | { |
1338 | return x; |
1412 | return is_symbol (x) && oblist_find_by_name (SCHEME_A_ strvalue (x)) != x; |
1339 | } |
|
|
1340 | } |
|
|
1341 | |
|
|
1342 | return NIL; |
|
|
1343 | } |
1413 | } |
1344 | |
1414 | |
1345 | /* make symbol or number atom from string */ |
1415 | /* make symbol or number atom from string */ |
1346 | static pointer |
1416 | static pointer |
1347 | mk_atom (SCHEME_P_ char *q) |
1417 | mk_atom (SCHEME_P_ char *q) |
… | |
… | |
1401 | } |
1471 | } |
1402 | else if ((c == 'e') || (c == 'E')) |
1472 | else if ((c == 'e') || (c == 'E')) |
1403 | { |
1473 | { |
1404 | if (!has_fp_exp) |
1474 | if (!has_fp_exp) |
1405 | { |
1475 | { |
1406 | has_dec_point = 1; /* decimal point illegal |
1476 | has_dec_point = 1; /* decimal point illegal from now on */ |
1407 | from now on */ |
|
|
1408 | p++; |
1477 | p++; |
1409 | |
1478 | |
1410 | if ((*p == '-') || (*p == '+') || isdigit (*p)) |
1479 | if ((*p == '-') || (*p == '+') || isdigit (*p)) |
1411 | continue; |
1480 | continue; |
1412 | } |
1481 | } |
… | |
… | |
1500 | |
1569 | |
1501 | if (ecb_expect_false (is_vector (p))) |
1570 | if (ecb_expect_false (is_vector (p))) |
1502 | { |
1571 | { |
1503 | int i; |
1572 | int i; |
1504 | |
1573 | |
1505 | for (i = 0; i < p->object.vector.length; i++) |
1574 | for (i = 0; i < veclength (p); i++) |
1506 | mark (vecvalue (p)[i]); |
1575 | mark (vecvalue (p)[i]); |
1507 | } |
1576 | } |
1508 | |
1577 | |
1509 | if (is_atom (p)) |
1578 | if (is_atom (p)) |
1510 | goto E6; |
1579 | goto E6; |
… | |
… | |
1557 | |
1626 | |
1558 | /* garbage collection. parameter a, b is marked. */ |
1627 | /* garbage collection. parameter a, b is marked. */ |
1559 | static void |
1628 | static void |
1560 | gc (SCHEME_P_ pointer a, pointer b) |
1629 | gc (SCHEME_P_ pointer a, pointer b) |
1561 | { |
1630 | { |
1562 | pointer p; |
|
|
1563 | int i; |
1631 | int i; |
1564 | |
1632 | |
1565 | if (SCHEME_V->gc_verbose) |
1633 | if (SCHEME_V->gc_verbose) |
1566 | putstr (SCHEME_A_ "gc..."); |
1634 | putstr (SCHEME_A_ "gc..."); |
1567 | |
1635 | |
… | |
… | |
1583 | /* Mark recent objects the interpreter doesn't know about yet. */ |
1651 | /* Mark recent objects the interpreter doesn't know about yet. */ |
1584 | mark (car (S_SINK)); |
1652 | mark (car (S_SINK)); |
1585 | /* Mark any older stuff above nested C calls */ |
1653 | /* Mark any older stuff above nested C calls */ |
1586 | mark (SCHEME_V->c_nest); |
1654 | mark (SCHEME_V->c_nest); |
1587 | |
1655 | |
|
|
1656 | #if USE_INTCACHE |
|
|
1657 | /* mark intcache */ |
|
|
1658 | for (i = INTCACHE_MIN; i <= INTCACHE_MAX; ++i) |
|
|
1659 | if (SCHEME_V->intcache[i - INTCACHE_MIN]) |
|
|
1660 | mark (SCHEME_V->intcache[i - INTCACHE_MIN]); |
|
|
1661 | #endif |
|
|
1662 | |
1588 | /* mark variables a, b */ |
1663 | /* mark variables a, b */ |
1589 | mark (a); |
1664 | mark (a); |
1590 | mark (b); |
1665 | mark (b); |
1591 | |
1666 | |
1592 | /* garbage collect */ |
1667 | /* garbage collect */ |
1593 | clrmark (NIL); |
1668 | clrmark (NIL); |
1594 | SCHEME_V->fcells = 0; |
1669 | SCHEME_V->fcells = 0; |
1595 | SCHEME_V->free_cell = NIL; |
1670 | SCHEME_V->free_cell = NIL; |
1596 | |
1671 | |
1597 | /* free-list is kept sorted by address so as to maintain consecutive |
1672 | if (SCHEME_V->gc_verbose) |
1598 | ranges, if possible, for use with vectors. Here we scan the cells |
1673 | putstr (SCHEME_A_ "freeing..."); |
1599 | (which are also kept sorted by address) downwards to build the |
1674 | |
1600 | free-list in sorted order. |
1675 | uint32_t total = 0; |
1601 | */ |
1676 | |
|
|
1677 | /* Here we scan the cells to build the free-list. */ |
1602 | for (i = SCHEME_V->last_cell_seg; i >= 0; i--) |
1678 | for (i = SCHEME_V->last_cell_seg; i >= 0; i--) |
1603 | { |
1679 | { |
1604 | p = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i]; |
1680 | struct cell *end = SCHEME_V->cell_seg[i] + SCHEME_V->cell_segsize [i]; |
|
|
1681 | struct cell *p; |
|
|
1682 | total += SCHEME_V->cell_segsize [i]; |
1605 | |
1683 | |
1606 | while (--p >= SCHEME_V->cell_seg[i]) |
1684 | for (p = SCHEME_V->cell_seg[i]; p < end; ++p) |
1607 | { |
1685 | { |
|
|
1686 | pointer c = POINTER (p); |
|
|
1687 | |
1608 | if (is_mark (p)) |
1688 | if (is_mark (c)) |
1609 | clrmark (p); |
1689 | clrmark (c); |
1610 | else |
1690 | else |
1611 | { |
1691 | { |
1612 | /* reclaim cell */ |
1692 | /* reclaim cell */ |
1613 | if (typeflag (p) != T_FREE) |
1693 | if (typeflag (c) != T_PAIR) |
1614 | { |
1694 | { |
1615 | finalize_cell (SCHEME_A_ p); |
1695 | finalize_cell (SCHEME_A_ c); |
1616 | set_typeflag (p, T_FREE); |
1696 | set_typeflag (c, T_PAIR); |
1617 | set_car (p, NIL); |
1697 | set_car (c, NIL); |
1618 | } |
1698 | } |
1619 | |
1699 | |
1620 | ++SCHEME_V->fcells; |
1700 | ++SCHEME_V->fcells; |
1621 | set_cdr (p, SCHEME_V->free_cell); |
1701 | set_cdr (c, SCHEME_V->free_cell); |
1622 | SCHEME_V->free_cell = p; |
1702 | SCHEME_V->free_cell = c; |
1623 | } |
1703 | } |
1624 | } |
1704 | } |
1625 | } |
1705 | } |
1626 | |
1706 | |
1627 | if (SCHEME_V->gc_verbose) |
1707 | if (SCHEME_V->gc_verbose) |
1628 | xwrstr ("done: "); xwrnum (SCHEME_V->fcells); xwrstr (" cells were recovered.\n"); |
1708 | { |
|
|
1709 | putstr (SCHEME_A_ "done: "); putnum (SCHEME_A_ SCHEME_V->fcells); putstr (SCHEME_A_ " out of "); putnum (SCHEME_A_ total); putstr (SCHEME_A_ " cells were recovered.\n"); |
|
|
1710 | } |
1629 | } |
1711 | } |
1630 | |
1712 | |
1631 | static void |
1713 | static void |
1632 | finalize_cell (SCHEME_P_ pointer a) |
1714 | finalize_cell (SCHEME_P_ pointer a) |
1633 | { |
1715 | { |
1634 | /* TODO, fast bitmap check? */ |
1716 | /* TODO, fast bitmap check? */ |
1635 | if (is_string (a)) |
1717 | if (is_string (a) || is_symbol (a)) |
1636 | free (strvalue (a)); |
1718 | free (strvalue (a)); |
1637 | else if (is_vector (a)) |
1719 | else if (is_vector (a)) |
1638 | free (vecvalue (a)); |
1720 | free (vecvalue (a)); |
1639 | #if USE_PORTS |
1721 | #if USE_PORTS |
1640 | else if (is_port (a)) |
1722 | else if (is_port (a)) |
1641 | { |
1723 | { |
1642 | if (a->object.port->kind & port_file && a->object.port->rep.stdio.closeit) |
1724 | if (port(a)->kind & port_file && port (a)->rep.stdio.closeit) |
1643 | port_close (SCHEME_A_ a, port_input | port_output); |
1725 | port_close (SCHEME_A_ a, port_input | port_output); |
1644 | |
1726 | |
1645 | free (a->object.port); |
1727 | free (port (a)); |
1646 | } |
1728 | } |
1647 | #endif |
1729 | #endif |
1648 | } |
1730 | } |
1649 | |
1731 | |
1650 | /* ========== Routines for Reading ========== */ |
1732 | /* ========== Routines for Reading ========== */ |
… | |
… | |
1666 | SCHEME_V->load_stack[SCHEME_V->file_i].unget = -1; |
1748 | SCHEME_V->load_stack[SCHEME_V->file_i].unget = -1; |
1667 | SCHEME_V->load_stack[SCHEME_V->file_i].kind = port_file | port_input; |
1749 | SCHEME_V->load_stack[SCHEME_V->file_i].kind = port_file | port_input; |
1668 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.file = fin; |
1750 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.file = fin; |
1669 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.closeit = 1; |
1751 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.closeit = 1; |
1670 | SCHEME_V->nesting_stack[SCHEME_V->file_i] = 0; |
1752 | SCHEME_V->nesting_stack[SCHEME_V->file_i] = 0; |
1671 | SCHEME_V->loadport->object.port = SCHEME_V->load_stack + SCHEME_V->file_i; |
1753 | set_port (SCHEME_V->loadport, SCHEME_V->load_stack + SCHEME_V->file_i); |
1672 | |
1754 | |
1673 | #if SHOW_ERROR_LINE |
1755 | #if SHOW_ERROR_LINE |
1674 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line = 0; |
1756 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line = 0; |
1675 | |
1757 | |
1676 | if (fname) |
1758 | if (fname) |
… | |
… | |
1693 | SCHEME_V->nesting = SCHEME_V->nesting_stack[SCHEME_V->file_i]; |
1775 | SCHEME_V->nesting = SCHEME_V->nesting_stack[SCHEME_V->file_i]; |
1694 | #if USE_PORTS |
1776 | #if USE_PORTS |
1695 | port_close (SCHEME_A_ SCHEME_V->loadport, port_input); |
1777 | port_close (SCHEME_A_ SCHEME_V->loadport, port_input); |
1696 | #endif |
1778 | #endif |
1697 | SCHEME_V->file_i--; |
1779 | SCHEME_V->file_i--; |
1698 | SCHEME_V->loadport->object.port = SCHEME_V->load_stack + SCHEME_V->file_i; |
1780 | set_port (SCHEME_V->loadport, SCHEME_V->load_stack + SCHEME_V->file_i); |
1699 | } |
1781 | } |
1700 | } |
1782 | } |
1701 | |
1783 | |
1702 | static int |
1784 | static int |
1703 | file_interactive (SCHEME_P) |
1785 | file_interactive (SCHEME_P) |
1704 | { |
1786 | { |
1705 | #if USE_PORTS |
1787 | #if USE_PORTS |
1706 | return SCHEME_V->file_i == 0 |
1788 | return SCHEME_V->file_i == 0 |
1707 | && SCHEME_V->load_stack[0].rep.stdio.file == STDIN_FILENO |
1789 | && SCHEME_V->load_stack[0].rep.stdio.file == STDIN_FILENO |
1708 | && (SCHEME_V->inport->object.port->kind & port_file); |
1790 | && (port (SCHEME_V->inport)->kind & port_file); |
1709 | #else |
1791 | #else |
1710 | return 0; |
1792 | return 0; |
1711 | #endif |
1793 | #endif |
1712 | } |
1794 | } |
1713 | |
1795 | |
… | |
… | |
1847 | } |
1929 | } |
1848 | |
1930 | |
1849 | static void |
1931 | static void |
1850 | port_close (SCHEME_P_ pointer p, int flag) |
1932 | port_close (SCHEME_P_ pointer p, int flag) |
1851 | { |
1933 | { |
1852 | port *pt = p->object.port; |
1934 | port *pt = port (p); |
1853 | |
1935 | |
1854 | pt->kind &= ~flag; |
1936 | pt->kind &= ~flag; |
1855 | |
1937 | |
1856 | if ((pt->kind & (port_input | port_output)) == 0) |
1938 | if ((pt->kind & (port_input | port_output)) == 0) |
1857 | { |
1939 | { |
… | |
… | |
1878 | /* get new character from input file */ |
1960 | /* get new character from input file */ |
1879 | static int |
1961 | static int |
1880 | inchar (SCHEME_P) |
1962 | inchar (SCHEME_P) |
1881 | { |
1963 | { |
1882 | int c; |
1964 | int c; |
1883 | port *pt; |
1965 | port *pt = port (SCHEME_V->inport); |
1884 | |
|
|
1885 | pt = SCHEME_V->inport->object.port; |
|
|
1886 | |
1966 | |
1887 | if (pt->kind & port_saw_EOF) |
1967 | if (pt->kind & port_saw_EOF) |
1888 | return EOF; |
1968 | return EOF; |
1889 | |
1969 | |
1890 | c = basic_inchar (pt); |
1970 | c = basic_inchar (pt); |
… | |
… | |
1957 | port *pt; |
2037 | port *pt; |
1958 | |
2038 | |
1959 | if (c == EOF) |
2039 | if (c == EOF) |
1960 | return; |
2040 | return; |
1961 | |
2041 | |
1962 | pt = SCHEME_V->inport->object.port; |
2042 | pt = port (SCHEME_V->inport); |
1963 | pt->unget = c; |
2043 | pt->unget = c; |
1964 | #else |
2044 | #else |
1965 | if (c == EOF) |
2045 | if (c == EOF) |
1966 | return; |
2046 | return; |
1967 | |
2047 | |
… | |
… | |
1995 | |
2075 | |
1996 | INTERFACE void |
2076 | INTERFACE void |
1997 | putstr (SCHEME_P_ const char *s) |
2077 | putstr (SCHEME_P_ const char *s) |
1998 | { |
2078 | { |
1999 | #if USE_PORTS |
2079 | #if USE_PORTS |
2000 | port *pt = SCHEME_V->outport->object.port; |
2080 | port *pt = port (SCHEME_V->outport); |
2001 | |
2081 | |
2002 | if (pt->kind & port_file) |
2082 | if (pt->kind & port_file) |
2003 | write (pt->rep.stdio.file, s, strlen (s)); |
2083 | write (pt->rep.stdio.file, s, strlen (s)); |
2004 | else |
2084 | else |
2005 | for (; *s; s++) |
2085 | for (; *s; s++) |
… | |
… | |
2007 | *pt->rep.string.curr++ = *s; |
2087 | *pt->rep.string.curr++ = *s; |
2008 | else if (pt->kind & port_srfi6 && realloc_port_string (SCHEME_A_ pt)) |
2088 | else if (pt->kind & port_srfi6 && realloc_port_string (SCHEME_A_ pt)) |
2009 | *pt->rep.string.curr++ = *s; |
2089 | *pt->rep.string.curr++ = *s; |
2010 | |
2090 | |
2011 | #else |
2091 | #else |
2012 | xwrstr (s); |
2092 | write (pt->rep.stdio.file, s, strlen (s)); |
2013 | #endif |
2093 | #endif |
2014 | } |
2094 | } |
2015 | |
2095 | |
2016 | static void |
2096 | static void |
2017 | putchars (SCHEME_P_ const char *s, int len) |
2097 | putchars (SCHEME_P_ const char *s, int len) |
2018 | { |
2098 | { |
2019 | #if USE_PORTS |
2099 | #if USE_PORTS |
2020 | port *pt = SCHEME_V->outport->object.port; |
2100 | port *pt = port (SCHEME_V->outport); |
2021 | |
2101 | |
2022 | if (pt->kind & port_file) |
2102 | if (pt->kind & port_file) |
2023 | write (pt->rep.stdio.file, s, len); |
2103 | write (pt->rep.stdio.file, s, len); |
2024 | else |
2104 | else |
2025 | { |
2105 | { |
… | |
… | |
2039 | |
2119 | |
2040 | INTERFACE void |
2120 | INTERFACE void |
2041 | putcharacter (SCHEME_P_ int c) |
2121 | putcharacter (SCHEME_P_ int c) |
2042 | { |
2122 | { |
2043 | #if USE_PORTS |
2123 | #if USE_PORTS |
2044 | port *pt = SCHEME_V->outport->object.port; |
2124 | port *pt = port (SCHEME_V->outport); |
2045 | |
2125 | |
2046 | if (pt->kind & port_file) |
2126 | if (pt->kind & port_file) |
2047 | { |
2127 | { |
2048 | char cc = c; |
2128 | char cc = c; |
2049 | write (pt->rep.stdio.file, &cc, 1); |
2129 | write (pt->rep.stdio.file, &cc, 1); |
… | |
… | |
2062 | #endif |
2142 | #endif |
2063 | } |
2143 | } |
2064 | |
2144 | |
2065 | /* read characters up to delimiter, but cater to character constants */ |
2145 | /* read characters up to delimiter, but cater to character constants */ |
2066 | static char * |
2146 | static char * |
2067 | readstr_upto (SCHEME_P_ char *delim) |
2147 | readstr_upto (SCHEME_P_ int skip, const char *delim) |
2068 | { |
2148 | { |
2069 | char *p = SCHEME_V->strbuff; |
2149 | char *p = SCHEME_V->strbuff + skip; |
2070 | |
2150 | |
2071 | while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A)))); |
2151 | while ((p - SCHEME_V->strbuff < sizeof (SCHEME_V->strbuff)) && !is_one_of (delim, (*p++ = inchar (SCHEME_A)))); |
2072 | |
2152 | |
2073 | if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\') |
2153 | if (p == SCHEME_V->strbuff + 2 && p[-2] == '\\') |
2074 | *p = 0; |
2154 | *p = 0; |
… | |
… | |
2081 | return SCHEME_V->strbuff; |
2161 | return SCHEME_V->strbuff; |
2082 | } |
2162 | } |
2083 | |
2163 | |
2084 | /* read string expression "xxx...xxx" */ |
2164 | /* read string expression "xxx...xxx" */ |
2085 | static pointer |
2165 | static pointer |
2086 | readstrexp (SCHEME_P) |
2166 | readstrexp (SCHEME_P_ char delim) |
2087 | { |
2167 | { |
2088 | char *p = SCHEME_V->strbuff; |
2168 | char *p = SCHEME_V->strbuff; |
2089 | int c; |
2169 | int c; |
2090 | int c1 = 0; |
2170 | int c1 = 0; |
2091 | enum |
|
|
2092 | { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok; |
2171 | enum { st_ok, st_bsl, st_x1, st_x2, st_oct1, st_oct2 } state = st_ok; |
2093 | |
2172 | |
2094 | for (;;) |
2173 | for (;;) |
2095 | { |
2174 | { |
2096 | c = inchar (SCHEME_A); |
2175 | c = inchar (SCHEME_A); |
2097 | |
2176 | |
… | |
… | |
2099 | return S_F; |
2178 | return S_F; |
2100 | |
2179 | |
2101 | switch (state) |
2180 | switch (state) |
2102 | { |
2181 | { |
2103 | case st_ok: |
2182 | case st_ok: |
2104 | switch (c) |
2183 | if (ecb_expect_false (c == delim)) |
2105 | { |
|
|
2106 | case '\\': |
|
|
2107 | state = st_bsl; |
|
|
2108 | break; |
|
|
2109 | |
|
|
2110 | case '"': |
|
|
2111 | *p = 0; |
|
|
2112 | return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff); |
2184 | return mk_counted_string (SCHEME_A_ SCHEME_V->strbuff, p - SCHEME_V->strbuff); |
2113 | |
2185 | |
2114 | default: |
2186 | if (ecb_expect_false (c == '\\')) |
|
|
2187 | state = st_bsl; |
|
|
2188 | else |
2115 | *p++ = c; |
2189 | *p++ = c; |
2116 | break; |
|
|
2117 | } |
|
|
2118 | |
2190 | |
2119 | break; |
2191 | break; |
2120 | |
2192 | |
2121 | case st_bsl: |
2193 | case st_bsl: |
2122 | switch (c) |
2194 | switch (c) |
… | |
… | |
2152 | case 'r': |
2224 | case 'r': |
2153 | *p++ = '\r'; |
2225 | *p++ = '\r'; |
2154 | state = st_ok; |
2226 | state = st_ok; |
2155 | break; |
2227 | break; |
2156 | |
2228 | |
2157 | case '"': |
|
|
2158 | *p++ = '"'; |
|
|
2159 | state = st_ok; |
|
|
2160 | break; |
|
|
2161 | |
|
|
2162 | default: |
2229 | default: |
2163 | *p++ = c; |
2230 | *p++ = c; |
2164 | state = st_ok; |
2231 | state = st_ok; |
2165 | break; |
2232 | break; |
2166 | } |
2233 | } |
2167 | |
2234 | |
2168 | break; |
2235 | break; |
2169 | |
2236 | |
2170 | case st_x1: |
2237 | case st_x1: |
2171 | case st_x2: |
2238 | case st_x2: |
2172 | c = toupper (c); |
2239 | c = tolower (c); |
2173 | |
2240 | |
2174 | if (c >= '0' && c <= 'F') |
2241 | if (c >= '0' && c <= '9') |
2175 | { |
|
|
2176 | if (c <= '9') |
|
|
2177 | c1 = (c1 << 4) + c - '0'; |
2242 | c1 = (c1 << 4) + c - '0'; |
2178 | else |
2243 | else if (c >= 'a' && c <= 'f') |
2179 | c1 = (c1 << 4) + c - 'A' + 10; |
2244 | c1 = (c1 << 4) + c - 'a' + 10; |
2180 | |
|
|
2181 | if (state == st_x1) |
|
|
2182 | state = st_x2; |
|
|
2183 | else |
|
|
2184 | { |
|
|
2185 | *p++ = c1; |
|
|
2186 | state = st_ok; |
|
|
2187 | } |
|
|
2188 | } |
|
|
2189 | else |
2245 | else |
2190 | return S_F; |
2246 | return S_F; |
|
|
2247 | |
|
|
2248 | if (state == st_x1) |
|
|
2249 | state = st_x2; |
|
|
2250 | else |
|
|
2251 | { |
|
|
2252 | *p++ = c1; |
|
|
2253 | state = st_ok; |
|
|
2254 | } |
2191 | |
2255 | |
2192 | break; |
2256 | break; |
2193 | |
2257 | |
2194 | case st_oct1: |
2258 | case st_oct1: |
2195 | case st_oct2: |
2259 | case st_oct2: |
… | |
… | |
2199 | backchar (SCHEME_A_ c); |
2263 | backchar (SCHEME_A_ c); |
2200 | state = st_ok; |
2264 | state = st_ok; |
2201 | } |
2265 | } |
2202 | else |
2266 | else |
2203 | { |
2267 | { |
2204 | if (state == st_oct2 && c1 >= 32) |
2268 | if (state == st_oct2 && c1 >= ' ') |
2205 | return S_F; |
2269 | return S_F; |
2206 | |
2270 | |
2207 | c1 = (c1 << 3) + (c - '0'); |
2271 | c1 = (c1 << 3) + (c - '0'); |
2208 | |
2272 | |
2209 | if (state == st_oct1) |
2273 | if (state == st_oct1) |
… | |
… | |
2214 | state = st_ok; |
2278 | state = st_ok; |
2215 | } |
2279 | } |
2216 | } |
2280 | } |
2217 | |
2281 | |
2218 | break; |
2282 | break; |
2219 | |
|
|
2220 | } |
2283 | } |
2221 | } |
2284 | } |
2222 | } |
2285 | } |
2223 | |
2286 | |
2224 | /* check c is in chars */ |
2287 | /* check c is in chars */ |
2225 | ecb_inline int |
2288 | ecb_inline int |
2226 | is_one_of (char *s, int c) |
2289 | is_one_of (const char *s, int c) |
2227 | { |
2290 | { |
2228 | if (c == EOF) |
|
|
2229 | return 1; |
|
|
2230 | |
|
|
2231 | return !!strchr (s, c); |
2291 | return c == EOF || !!strchr (s, c); |
2232 | } |
2292 | } |
2233 | |
2293 | |
2234 | /* skip white characters */ |
2294 | /* skip white characters */ |
2235 | ecb_inline int |
2295 | ecb_inline int |
2236 | skipspace (SCHEME_P) |
2296 | skipspace (SCHEME_P) |
… | |
… | |
2238 | int c, curr_line = 0; |
2298 | int c, curr_line = 0; |
2239 | |
2299 | |
2240 | do |
2300 | do |
2241 | { |
2301 | { |
2242 | c = inchar (SCHEME_A); |
2302 | c = inchar (SCHEME_A); |
|
|
2303 | |
2243 | #if SHOW_ERROR_LINE |
2304 | #if SHOW_ERROR_LINE |
2244 | if (c == '\n') |
2305 | if (ecb_expect_false (c == '\n')) |
2245 | curr_line++; |
2306 | curr_line++; |
2246 | #endif |
2307 | #endif |
|
|
2308 | |
|
|
2309 | if (ecb_expect_false (c == EOF)) |
|
|
2310 | return c; |
2247 | } |
2311 | } |
2248 | while (c == ' ' || c == '\n' || c == '\r' || c == '\t'); |
2312 | while (is_one_of (WHITESPACE, c)); |
2249 | |
2313 | |
2250 | /* record it */ |
2314 | /* record it */ |
2251 | #if SHOW_ERROR_LINE |
2315 | #if SHOW_ERROR_LINE |
2252 | if (SCHEME_V->load_stack[SCHEME_V->file_i].kind & port_file) |
2316 | if (SCHEME_V->load_stack[SCHEME_V->file_i].kind & port_file) |
2253 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line += curr_line; |
2317 | SCHEME_V->load_stack[SCHEME_V->file_i].rep.stdio.curr_line += curr_line; |
2254 | #endif |
2318 | #endif |
2255 | |
2319 | |
2256 | if (c != EOF) |
|
|
2257 | { |
|
|
2258 | backchar (SCHEME_A_ c); |
2320 | backchar (SCHEME_A_ c); |
2259 | return 1; |
2321 | return 1; |
2260 | } |
|
|
2261 | else |
|
|
2262 | return EOF; |
|
|
2263 | } |
2322 | } |
2264 | |
2323 | |
2265 | /* get token */ |
2324 | /* get token */ |
2266 | static int |
2325 | static int |
2267 | token (SCHEME_P) |
2326 | token (SCHEME_P) |
… | |
… | |
2283 | return TOK_RPAREN; |
2342 | return TOK_RPAREN; |
2284 | |
2343 | |
2285 | case '.': |
2344 | case '.': |
2286 | c = inchar (SCHEME_A); |
2345 | c = inchar (SCHEME_A); |
2287 | |
2346 | |
2288 | if (is_one_of (" \n\t", c)) |
2347 | if (is_one_of (WHITESPACE, c)) |
2289 | return TOK_DOT; |
2348 | return TOK_DOT; |
2290 | else |
2349 | else |
2291 | { |
2350 | { |
2292 | //TODO: ungetc twice in a row is not supported in C |
|
|
2293 | backchar (SCHEME_A_ c); |
2351 | backchar (SCHEME_A_ c); |
2294 | backchar (SCHEME_A_ '.'); |
|
|
2295 | return TOK_ATOM; |
2352 | return TOK_DOTATOM; |
2296 | } |
2353 | } |
|
|
2354 | |
|
|
2355 | case '|': |
|
|
2356 | return TOK_STRATOM; |
2297 | |
2357 | |
2298 | case '\'': |
2358 | case '\'': |
2299 | return TOK_QUOTE; |
2359 | return TOK_QUOTE; |
2300 | |
2360 | |
2301 | case ';': |
2361 | case ';': |
… | |
… | |
2433 | } |
2493 | } |
2434 | |
2494 | |
2435 | putcharacter (SCHEME_A_ '"'); |
2495 | putcharacter (SCHEME_A_ '"'); |
2436 | } |
2496 | } |
2437 | |
2497 | |
2438 | |
|
|
2439 | /* print atoms */ |
2498 | /* print atoms */ |
2440 | static void |
2499 | static void |
2441 | printatom (SCHEME_P_ pointer l, int f) |
2500 | printatom (SCHEME_P_ pointer l, int f) |
2442 | { |
2501 | { |
2443 | char *p; |
2502 | char *p; |
2444 | int len; |
2503 | int len; |
2445 | |
2504 | |
2446 | atom2str (SCHEME_A_ l, f, &p, &len); |
2505 | atom2str (SCHEME_A_ l, f, &p, &len); |
2447 | putchars (SCHEME_A_ p, len); |
2506 | putchars (SCHEME_A_ p, len); |
2448 | } |
2507 | } |
2449 | |
|
|
2450 | |
2508 | |
2451 | /* Uses internal buffer unless string pointer is already available */ |
2509 | /* Uses internal buffer unless string pointer is already available */ |
2452 | static void |
2510 | static void |
2453 | atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen) |
2511 | atom2str (SCHEME_P_ pointer l, int f, char **pp, int *plen) |
2454 | { |
2512 | { |
… | |
… | |
2615 | #endif |
2673 | #endif |
2616 | } |
2674 | } |
2617 | else if (is_continuation (l)) |
2675 | else if (is_continuation (l)) |
2618 | p = "#<CONTINUATION>"; |
2676 | p = "#<CONTINUATION>"; |
2619 | else |
2677 | else |
|
|
2678 | { |
|
|
2679 | #if USE_PRINTF |
|
|
2680 | p = SCHEME_V->strbuff; |
|
|
2681 | snprintf (p, STRBUFFSIZE, "#<ERROR %x>", (int)typeflag (l)); |
|
|
2682 | #else |
2620 | p = "#<ERROR>"; |
2683 | p = "#<ERROR>"; |
|
|
2684 | #endif |
|
|
2685 | } |
2621 | |
2686 | |
2622 | *pp = p; |
2687 | *pp = p; |
2623 | *plen = strlen (p); |
2688 | *plen = strlen (p); |
2624 | } |
2689 | } |
2625 | |
2690 | |
… | |
… | |
2769 | /* () is #t in R5RS */ |
2834 | /* () is #t in R5RS */ |
2770 | #define is_true(p) ((p) != S_F) |
2835 | #define is_true(p) ((p) != S_F) |
2771 | #define is_false(p) ((p) == S_F) |
2836 | #define is_false(p) ((p) == S_F) |
2772 | |
2837 | |
2773 | /* ========== Environment implementation ========== */ |
2838 | /* ========== Environment implementation ========== */ |
2774 | |
|
|
2775 | #if !defined(USE_ALIST_ENV) || !defined(USE_OBJECT_LIST) |
|
|
2776 | |
|
|
2777 | static int |
|
|
2778 | hash_fn (const char *key, int table_size) |
|
|
2779 | { |
|
|
2780 | const unsigned char *p = key; |
|
|
2781 | uint32_t hash = 2166136261; |
|
|
2782 | |
|
|
2783 | while (*p) |
|
|
2784 | hash = (hash ^ *p++) * 16777619; |
|
|
2785 | |
|
|
2786 | return hash % table_size; |
|
|
2787 | } |
|
|
2788 | #endif |
|
|
2789 | |
2839 | |
2790 | #ifndef USE_ALIST_ENV |
2840 | #ifndef USE_ALIST_ENV |
2791 | |
2841 | |
2792 | /* |
2842 | /* |
2793 | * In this implementation, each frame of the environment may be |
2843 | * In this implementation, each frame of the environment may be |
… | |
… | |
2810 | |
2860 | |
2811 | SCHEME_V->envir = immutable_cons (new_frame, old_env); |
2861 | SCHEME_V->envir = immutable_cons (new_frame, old_env); |
2812 | setenvironment (SCHEME_V->envir); |
2862 | setenvironment (SCHEME_V->envir); |
2813 | } |
2863 | } |
2814 | |
2864 | |
|
|
2865 | static uint32_t |
|
|
2866 | sym_hash (pointer sym, uint32_t size) |
|
|
2867 | { |
|
|
2868 | uintptr_t ptr = (uintptr_t)sym; |
|
|
2869 | |
|
|
2870 | #if 0 |
|
|
2871 | /* table size is prime, so why mix */ |
|
|
2872 | ptr += ptr >> 32; |
|
|
2873 | ptr += ptr >> 16; |
|
|
2874 | ptr += ptr >> 8; |
|
|
2875 | #endif |
|
|
2876 | |
|
|
2877 | return ptr % size; |
|
|
2878 | } |
|
|
2879 | |
2815 | ecb_inline void |
2880 | ecb_inline void |
2816 | new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) |
2881 | new_slot_spec_in_env (SCHEME_P_ pointer env, pointer variable, pointer value) |
2817 | { |
2882 | { |
2818 | pointer slot = immutable_cons (variable, value); |
2883 | pointer slot = immutable_cons (variable, value); |
2819 | |
2884 | |
2820 | if (is_vector (car (env))) |
2885 | if (is_vector (car (env))) |
2821 | { |
2886 | { |
2822 | int location = hash_fn (symname (variable), veclength (car (env))); |
2887 | int location = sym_hash (variable, veclength (car (env))); |
2823 | |
|
|
2824 | set_vector_elem (car (env), location, immutable_cons (slot, vector_elem (car (env), location))); |
2888 | vector_set (car (env), location, immutable_cons (slot, vector_get (car (env), location))); |
2825 | } |
2889 | } |
2826 | else |
2890 | else |
2827 | set_car (env, immutable_cons (slot, car (env))); |
2891 | set_car (env, immutable_cons (slot, car (env))); |
2828 | } |
2892 | } |
2829 | |
2893 | |
2830 | static pointer |
2894 | static pointer |
2831 | find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all) |
2895 | find_slot_in_env (SCHEME_P_ pointer env, pointer hdl, int all) |
2832 | { |
2896 | { |
2833 | pointer x, y; |
2897 | pointer x, y; |
2834 | int location; |
|
|
2835 | |
2898 | |
2836 | for (x = env; x != NIL; x = cdr (x)) |
2899 | for (x = env; x != NIL; x = cdr (x)) |
2837 | { |
2900 | { |
2838 | if (is_vector (car (x))) |
2901 | if (is_vector (car (x))) |
2839 | { |
2902 | { |
2840 | location = hash_fn (symname (hdl), veclength (car (x))); |
2903 | int location = sym_hash (hdl, veclength (car (x))); |
2841 | y = vector_elem (car (x), location); |
2904 | y = vector_get (car (x), location); |
2842 | } |
2905 | } |
2843 | else |
2906 | else |
2844 | y = car (x); |
2907 | y = car (x); |
2845 | |
2908 | |
2846 | for (; y != NIL; y = cdr (y)) |
2909 | for (; y != NIL; y = cdr (y)) |
2847 | if (caar (y) == hdl) |
2910 | if (caar (y) == hdl) |
2848 | break; |
2911 | break; |
2849 | |
2912 | |
2850 | if (y != NIL) |
2913 | if (y != NIL) |
|
|
2914 | return car (y); |
|
|
2915 | |
|
|
2916 | if (!all) |
2851 | break; |
2917 | break; |
2852 | |
|
|
2853 | if (!all) |
|
|
2854 | return NIL; |
|
|
2855 | } |
2918 | } |
2856 | |
|
|
2857 | if (x != NIL) |
|
|
2858 | return car (y); |
|
|
2859 | |
2919 | |
2860 | return NIL; |
2920 | return NIL; |
2861 | } |
2921 | } |
2862 | |
2922 | |
2863 | #else /* USE_ALIST_ENV */ |
2923 | #else /* USE_ALIST_ENV */ |
… | |
… | |
2885 | for (y = car (x); y != NIL; y = cdr (y)) |
2945 | for (y = car (x); y != NIL; y = cdr (y)) |
2886 | if (caar (y) == hdl) |
2946 | if (caar (y) == hdl) |
2887 | break; |
2947 | break; |
2888 | |
2948 | |
2889 | if (y != NIL) |
2949 | if (y != NIL) |
|
|
2950 | return car (y); |
2890 | break; |
2951 | break; |
2891 | |
2952 | |
2892 | if (!all) |
2953 | if (!all) |
2893 | return NIL; |
2954 | break; |
2894 | } |
2955 | } |
2895 | |
|
|
2896 | if (x != NIL) |
|
|
2897 | return car (y); |
|
|
2898 | |
2956 | |
2899 | return NIL; |
2957 | return NIL; |
2900 | } |
2958 | } |
2901 | |
2959 | |
2902 | #endif /* USE_ALIST_ENV else */ |
2960 | #endif /* USE_ALIST_ENV else */ |
2903 | |
2961 | |
2904 | ecb_inline void |
2962 | ecb_inline void |
2905 | new_slot_in_env (SCHEME_P_ pointer variable, pointer value) |
2963 | new_slot_in_env (SCHEME_P_ pointer variable, pointer value) |
2906 | { |
2964 | { |
|
|
2965 | assert (is_symbol (variable));//TODO: bug in current-ws/OP_LET2 |
2907 | new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value); |
2966 | new_slot_spec_in_env (SCHEME_A_ SCHEME_V->envir, variable, value); |
2908 | } |
2967 | } |
2909 | |
2968 | |
2910 | ecb_inline void |
2969 | ecb_inline void |
2911 | set_slot_in_env (SCHEME_P_ pointer slot, pointer value) |
2970 | set_slot_in_env (SCHEME_P_ pointer slot, pointer value) |
… | |
… | |
3012 | { |
3071 | { |
3013 | int nframes = (uintptr_t)SCHEME_V->dump; |
3072 | int nframes = (uintptr_t)SCHEME_V->dump; |
3014 | struct dump_stack_frame *next_frame; |
3073 | struct dump_stack_frame *next_frame; |
3015 | |
3074 | |
3016 | /* enough room for the next frame? */ |
3075 | /* enough room for the next frame? */ |
3017 | if (nframes >= SCHEME_V->dump_size) |
3076 | if (ecb_expect_false (nframes >= SCHEME_V->dump_size)) |
3018 | { |
3077 | { |
3019 | SCHEME_V->dump_size += STACK_GROWTH; |
3078 | SCHEME_V->dump_size += STACK_GROWTH; |
3020 | SCHEME_V->dump_base = realloc (SCHEME_V->dump_base, sizeof (struct dump_stack_frame) * SCHEME_V->dump_size); |
3079 | SCHEME_V->dump_base = realloc (SCHEME_V->dump_base, sizeof (struct dump_stack_frame) * SCHEME_V->dump_size); |
3021 | } |
3080 | } |
3022 | |
3081 | |
… | |
… | |
3119 | int i = 0; |
3178 | int i = 0; |
3120 | struct dump_stack_frame *frame = SCHEME_V->dump_base; |
3179 | struct dump_stack_frame *frame = SCHEME_V->dump_base; |
3121 | |
3180 | |
3122 | while (cont != NIL) |
3181 | while (cont != NIL) |
3123 | { |
3182 | { |
3124 | frame->op = ivalue (car (cont)); cont = cdr (cont); |
3183 | frame->op = ivalue_unchecked (car (cont)); cont = cdr (cont); |
3125 | frame->args = car (cont) ; cont = cdr (cont); |
3184 | frame->args = car (cont) ; cont = cdr (cont); |
3126 | frame->envir = car (cont) ; cont = cdr (cont); |
3185 | frame->envir = car (cont) ; cont = cdr (cont); |
3127 | frame->code = car (cont) ; cont = cdr (cont); |
3186 | frame->code = car (cont) ; cont = cdr (cont); |
3128 | |
3187 | |
3129 | ++frame; |
3188 | ++frame; |
3130 | ++i; |
3189 | ++i; |
3131 | } |
3190 | } |
3132 | |
3191 | |
… | |
… | |
3161 | SCHEME_V->value = a; |
3220 | SCHEME_V->value = a; |
3162 | |
3221 | |
3163 | if (dump == NIL) |
3222 | if (dump == NIL) |
3164 | return -1; |
3223 | return -1; |
3165 | |
3224 | |
3166 | SCHEME_V->op = ivalue (car (dump)); dump = cdr (dump); |
3225 | SCHEME_V->op = ivalue_unchecked (car (dump)); dump = cdr (dump); |
3167 | SCHEME_V->args = car (dump) ; dump = cdr (dump); |
3226 | SCHEME_V->args = car (dump) ; dump = cdr (dump); |
3168 | SCHEME_V->envir = car (dump) ; dump = cdr (dump); |
3227 | SCHEME_V->envir = car (dump) ; dump = cdr (dump); |
3169 | SCHEME_V->code = car (dump) ; dump = cdr (dump); |
3228 | SCHEME_V->code = car (dump) ; dump = cdr (dump); |
3170 | |
3229 | |
3171 | SCHEME_V->dump = dump; |
3230 | SCHEME_V->dump = dump; |
3172 | |
3231 | |
3173 | return 0; |
3232 | return 0; |
3174 | } |
3233 | } |
… | |
… | |
3203 | |
3262 | |
3204 | #endif |
3263 | #endif |
3205 | |
3264 | |
3206 | #define s_retbool(tf) s_return ((tf) ? S_T : S_F) |
3265 | #define s_retbool(tf) s_return ((tf) ? S_T : S_F) |
3207 | |
3266 | |
|
|
3267 | #if EXPERIMENT |
|
|
3268 | static int |
|
|
3269 | debug (SCHEME_P_ int indent, pointer x) |
|
|
3270 | { |
|
|
3271 | int c; |
|
|
3272 | |
|
|
3273 | if (is_syntax (x)) |
|
|
3274 | { |
|
|
3275 | printf ("%*ssyntax<%s,%d>\n", indent, "", syntaxname(x),syntaxnum(x)); |
|
|
3276 | return 8 + 8; |
|
|
3277 | } |
|
|
3278 | |
|
|
3279 | if (x == NIL) |
|
|
3280 | { |
|
|
3281 | printf ("%*sNIL\n", indent, ""); |
|
|
3282 | return 3; |
|
|
3283 | } |
|
|
3284 | |
|
|
3285 | switch (type (x)) |
|
|
3286 | { |
|
|
3287 | case T_INTEGER: |
|
|
3288 | printf ("%*sI<%d>%p\n", indent, "", (int)ivalue_unchecked (x), x); |
|
|
3289 | return 32+8; |
|
|
3290 | |
|
|
3291 | case T_SYMBOL: |
|
|
3292 | printf ("%*sS<%s>\n", indent, "", symname (x)); |
|
|
3293 | return 24+8; |
|
|
3294 | |
|
|
3295 | case T_CLOSURE: |
|
|
3296 | printf ("%*sS<%s>\n", indent, "", "closure"); |
|
|
3297 | debug (SCHEME_A_ indent + 3, cdr(x)); |
|
|
3298 | return 32 + debug (SCHEME_A_ indent + 3, car (x)); |
|
|
3299 | |
|
|
3300 | case T_PAIR: |
|
|
3301 | printf ("%*spair %p %p\n", indent, "", car(x),cdr(x)); |
|
|
3302 | c = debug (SCHEME_A_ indent + 3, car (x)); |
|
|
3303 | c += debug (SCHEME_A_ indent + 3, cdr (x)); |
|
|
3304 | return c + 1; |
|
|
3305 | |
|
|
3306 | case T_PORT: |
|
|
3307 | printf ("%*sS<%s>\n", indent, "", "port"); |
|
|
3308 | return 24+8; |
|
|
3309 | |
|
|
3310 | case T_VECTOR: |
|
|
3311 | printf ("%*sS<%s>\n", indent, "", "vector"); |
|
|
3312 | return 24+8; |
|
|
3313 | |
|
|
3314 | case T_ENVIRONMENT: |
|
|
3315 | printf ("%*sS<%s>\n", indent, "", "environment"); |
|
|
3316 | return 0 + debug (SCHEME_A_ indent + 3, car (x)); |
|
|
3317 | |
|
|
3318 | default: |
|
|
3319 | printf ("unhandled type %d\n", type (x)); |
|
|
3320 | break; |
|
|
3321 | } |
|
|
3322 | } |
|
|
3323 | #endif |
|
|
3324 | |
3208 | static int |
3325 | static int |
3209 | opexe_0 (SCHEME_P_ enum scheme_opcodes op) |
3326 | opexe_0 (SCHEME_P_ enum scheme_opcodes op) |
3210 | { |
3327 | { |
3211 | pointer args = SCHEME_V->args; |
3328 | pointer args = SCHEME_V->args; |
3212 | pointer x, y; |
3329 | pointer x, y; |
3213 | |
3330 | |
3214 | switch (op) |
3331 | switch (op) |
3215 | { |
3332 | { |
|
|
3333 | #if EXPERIMENT //D |
|
|
3334 | case OP_DEBUG: |
|
|
3335 | printf ("len = %d\n", debug (SCHEME_A_ 0, args) / 8); |
|
|
3336 | printf ("\n"); |
|
|
3337 | s_return (S_T); |
|
|
3338 | #endif |
3216 | case OP_LOAD: /* load */ |
3339 | case OP_LOAD: /* load */ |
3217 | if (file_interactive (SCHEME_A)) |
3340 | if (file_interactive (SCHEME_A)) |
3218 | { |
3341 | { |
3219 | xwrstr ("Loading "); xwrstr (strvalue (car (args))); xwrstr ("\n"); |
3342 | putstr (SCHEME_A_ "Loading "); putstr (SCHEME_A_ strvalue (car (args))); putstr (SCHEME_A_ "\n"); |
3220 | //D fprintf (SCHEME_V->outport->object.port->rep.stdio.file, "Loading %s\n", strvalue (car (args))); |
3343 | //D fprintf (port (SCHEME_V->outport)->rep.stdio.file, "Loading %s\n", strvalue (car (args))); |
3221 | } |
3344 | } |
3222 | |
3345 | |
3223 | if (!file_push (SCHEME_A_ strvalue (car (args)))) |
3346 | if (!file_push (SCHEME_A_ strvalue (car (args)))) |
3224 | Error_1 ("unable to open", car (args)); |
3347 | Error_1 ("unable to open", car (args)); |
3225 | else |
3348 | else |
… | |
… | |
3229 | } |
3352 | } |
3230 | |
3353 | |
3231 | case OP_T0LVL: /* top level */ |
3354 | case OP_T0LVL: /* top level */ |
3232 | |
3355 | |
3233 | /* If we reached the end of file, this loop is done. */ |
3356 | /* If we reached the end of file, this loop is done. */ |
3234 | if (SCHEME_V->loadport->object.port->kind & port_saw_EOF) |
3357 | if (port (SCHEME_V->loadport)->kind & port_saw_EOF) |
3235 | { |
3358 | { |
3236 | if (SCHEME_V->file_i == 0) |
3359 | if (SCHEME_V->file_i == 0) |
3237 | { |
3360 | { |
3238 | SCHEME_V->args = NIL; |
3361 | SCHEME_V->args = NIL; |
3239 | s_goto (OP_QUIT); |
3362 | s_goto (OP_QUIT); |
… | |
… | |
3317 | #endif |
3440 | #endif |
3318 | if (is_symbol (SCHEME_V->code)) /* symbol */ |
3441 | if (is_symbol (SCHEME_V->code)) /* symbol */ |
3319 | { |
3442 | { |
3320 | x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 1); |
3443 | x = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->code, 1); |
3321 | |
3444 | |
3322 | if (x != NIL) |
3445 | if (x == NIL) |
3323 | s_return (slot_value_in_env (x)); |
|
|
3324 | else |
|
|
3325 | Error_1 ("eval: unbound variable:", SCHEME_V->code); |
3446 | Error_1 ("eval: unbound variable:", SCHEME_V->code); |
|
|
3447 | |
|
|
3448 | s_return (slot_value_in_env (x)); |
3326 | } |
3449 | } |
3327 | else if (is_pair (SCHEME_V->code)) |
3450 | else if (is_pair (SCHEME_V->code)) |
3328 | { |
3451 | { |
3329 | x = car (SCHEME_V->code); |
3452 | x = car (SCHEME_V->code); |
3330 | |
3453 | |
… | |
… | |
3343 | } |
3466 | } |
3344 | else |
3467 | else |
3345 | s_return (SCHEME_V->code); |
3468 | s_return (SCHEME_V->code); |
3346 | |
3469 | |
3347 | case OP_E0ARGS: /* eval arguments */ |
3470 | case OP_E0ARGS: /* eval arguments */ |
3348 | if (is_macro (SCHEME_V->value)) /* macro expansion */ |
3471 | if (ecb_expect_false (is_macro (SCHEME_V->value))) /* macro expansion */ |
3349 | { |
3472 | { |
3350 | s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL); |
3473 | s_save (SCHEME_A_ OP_DOMACRO, NIL, NIL); |
3351 | SCHEME_V->args = cons (SCHEME_V->code, NIL); |
3474 | SCHEME_V->args = cons (SCHEME_V->code, NIL); |
3352 | SCHEME_V->code = SCHEME_V->value; |
3475 | SCHEME_V->code = SCHEME_V->value; |
3353 | s_goto (OP_APPLY); |
3476 | s_goto (OP_APPLY); |
… | |
… | |
3380 | |
3503 | |
3381 | case OP_TRACING: |
3504 | case OP_TRACING: |
3382 | { |
3505 | { |
3383 | int tr = SCHEME_V->tracing; |
3506 | int tr = SCHEME_V->tracing; |
3384 | |
3507 | |
3385 | SCHEME_V->tracing = ivalue (car (args)); |
3508 | SCHEME_V->tracing = ivalue_unchecked (car (args)); |
3386 | s_return (mk_integer (SCHEME_A_ tr)); |
3509 | s_return (mk_integer (SCHEME_A_ tr)); |
3387 | } |
3510 | } |
3388 | |
3511 | |
3389 | #endif |
3512 | #endif |
3390 | |
3513 | |
… | |
… | |
3407 | s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */ |
3530 | s_goto (procnum (SCHEME_V->code)); /* PROCEDURE */ |
3408 | else if (is_foreign (SCHEME_V->code)) |
3531 | else if (is_foreign (SCHEME_V->code)) |
3409 | { |
3532 | { |
3410 | /* Keep nested calls from GC'ing the arglist */ |
3533 | /* Keep nested calls from GC'ing the arglist */ |
3411 | push_recent_alloc (SCHEME_A_ args, NIL); |
3534 | push_recent_alloc (SCHEME_A_ args, NIL); |
3412 | x = SCHEME_V->code->object.ff (SCHEME_A_ args); |
3535 | x = CELL(SCHEME_V->code)->object.ff (SCHEME_A_ args); |
3413 | |
3536 | |
3414 | s_return (x); |
3537 | s_return (x); |
3415 | } |
3538 | } |
3416 | else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */ |
3539 | else if (is_closure (SCHEME_V->code) || is_macro (SCHEME_V->code) || is_promise (SCHEME_V->code)) /* CLOSURE */ |
3417 | { |
3540 | { |
… | |
… | |
3454 | |
3577 | |
3455 | case OP_DOMACRO: /* do macro */ |
3578 | case OP_DOMACRO: /* do macro */ |
3456 | SCHEME_V->code = SCHEME_V->value; |
3579 | SCHEME_V->code = SCHEME_V->value; |
3457 | s_goto (OP_EVAL); |
3580 | s_goto (OP_EVAL); |
3458 | |
3581 | |
3459 | #if 1 |
|
|
3460 | |
|
|
3461 | case OP_LAMBDA: /* lambda */ |
3582 | case OP_LAMBDA: /* lambda */ |
3462 | /* If the hook is defined, apply it to SCHEME_V->code, otherwise |
3583 | /* If the hook is defined, apply it to SCHEME_V->code, otherwise |
3463 | set SCHEME_V->value fall thru */ |
3584 | set SCHEME_V->value fall thru */ |
3464 | { |
3585 | { |
3465 | pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1); |
3586 | pointer f = find_slot_in_env (SCHEME_A_ SCHEME_V->envir, SCHEME_V->COMPILE_HOOK, 1); |
… | |
… | |
3471 | SCHEME_V->code = slot_value_in_env (f); |
3592 | SCHEME_V->code = slot_value_in_env (f); |
3472 | s_goto (OP_APPLY); |
3593 | s_goto (OP_APPLY); |
3473 | } |
3594 | } |
3474 | |
3595 | |
3475 | SCHEME_V->value = SCHEME_V->code; |
3596 | SCHEME_V->value = SCHEME_V->code; |
3476 | /* Fallthru */ |
|
|
3477 | } |
3597 | } |
|
|
3598 | /* Fallthru */ |
3478 | |
3599 | |
3479 | case OP_LAMBDA1: |
3600 | case OP_LAMBDA1: |
3480 | s_return (mk_closure (SCHEME_A_ SCHEME_V->value, SCHEME_V->envir)); |
3601 | s_return (mk_closure (SCHEME_A_ SCHEME_V->value, SCHEME_V->envir)); |
3481 | |
|
|
3482 | #else |
|
|
3483 | |
|
|
3484 | case OP_LAMBDA: /* lambda */ |
|
|
3485 | s_return (mk_closure (SCHEME_A_ SCHEME_V->code, SCHEME_V->envir)); |
|
|
3486 | |
|
|
3487 | #endif |
|
|
3488 | |
3602 | |
3489 | case OP_MKCLOSURE: /* make-closure */ |
3603 | case OP_MKCLOSURE: /* make-closure */ |
3490 | x = car (args); |
3604 | x = car (args); |
3491 | |
3605 | |
3492 | if (car (x) == SCHEME_V->LAMBDA) |
3606 | if (car (x) == SCHEME_V->LAMBDA) |
… | |
… | |
3909 | { |
4023 | { |
3910 | pointer args = SCHEME_V->args; |
4024 | pointer args = SCHEME_V->args; |
3911 | pointer x = car (args); |
4025 | pointer x = car (args); |
3912 | num v; |
4026 | num v; |
3913 | |
4027 | |
3914 | #if USE_MATH |
|
|
3915 | RVALUE dd; |
|
|
3916 | #endif |
|
|
3917 | |
|
|
3918 | switch (op) |
4028 | switch (op) |
3919 | { |
4029 | { |
3920 | #if USE_MATH |
4030 | #if USE_MATH |
3921 | case OP_INEX2EX: /* inexact->exact */ |
4031 | case OP_INEX2EX: /* inexact->exact */ |
|
|
4032 | { |
3922 | if (is_integer (x)) |
4033 | if (is_integer (x)) |
3923 | s_return (x); |
4034 | s_return (x); |
3924 | else if (modf (rvalue_unchecked (x), &dd) == 0) |
4035 | |
|
|
4036 | RVALUE r = rvalue_unchecked (x); |
|
|
4037 | |
|
|
4038 | if (r == (RVALUE)(IVALUE)r) |
3925 | s_return (mk_integer (SCHEME_A_ ivalue (x))); |
4039 | s_return (mk_integer (SCHEME_A_ rvalue_unchecked (x))); |
3926 | else |
4040 | else |
3927 | Error_1 ("inexact->exact: not integral:", x); |
4041 | Error_1 ("inexact->exact: not integral:", x); |
|
|
4042 | } |
3928 | |
4043 | |
3929 | case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x)))); |
4044 | case OP_EXP: s_return (mk_real (SCHEME_A_ exp (rvalue (x)))); |
3930 | case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x)))); |
4045 | case OP_LOG: s_return (mk_real (SCHEME_A_ log (rvalue (x)))); |
3931 | case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x)))); |
4046 | case OP_SIN: s_return (mk_real (SCHEME_A_ sin (rvalue (x)))); |
3932 | case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x)))); |
4047 | case OP_COS: s_return (mk_real (SCHEME_A_ cos (rvalue (x)))); |
… | |
… | |
3966 | /* If the test fails, result is too big for integer. */ |
4081 | /* If the test fails, result is too big for integer. */ |
3967 | if (!real_result) |
4082 | if (!real_result) |
3968 | { |
4083 | { |
3969 | long result_as_long = result; |
4084 | long result_as_long = result; |
3970 | |
4085 | |
3971 | if (result != (RVALUE) result_as_long) |
4086 | if (result != result_as_long) |
3972 | real_result = 1; |
4087 | real_result = 1; |
3973 | } |
4088 | } |
3974 | |
4089 | |
3975 | if (real_result) |
4090 | if (real_result) |
3976 | s_return (mk_real (SCHEME_A_ result)); |
4091 | s_return (mk_real (SCHEME_A_ result)); |
… | |
… | |
3981 | case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x)))); |
4096 | case OP_FLOOR: s_return (mk_real (SCHEME_A_ floor (rvalue (x)))); |
3982 | case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x)))); |
4097 | case OP_CEILING: s_return (mk_real (SCHEME_A_ ceil (rvalue (x)))); |
3983 | |
4098 | |
3984 | case OP_TRUNCATE: |
4099 | case OP_TRUNCATE: |
3985 | { |
4100 | { |
3986 | RVALUE rvalue_of_x; |
4101 | RVALUE n = rvalue (x); |
3987 | |
|
|
3988 | rvalue_of_x = rvalue (x); |
|
|
3989 | |
|
|
3990 | if (rvalue_of_x > 0) |
|
|
3991 | s_return (mk_real (SCHEME_A_ floor (rvalue_of_x))); |
4102 | s_return (mk_real (SCHEME_A_ n > 0 ? floor (n) : ceil (n))); |
3992 | else |
|
|
3993 | s_return (mk_real (SCHEME_A_ ceil (rvalue_of_x))); |
|
|
3994 | } |
4103 | } |
3995 | |
4104 | |
3996 | case OP_ROUND: |
4105 | case OP_ROUND: |
3997 | if (num_is_integer (x)) |
4106 | if (is_integer (x)) |
3998 | s_return (x); |
4107 | s_return (x); |
3999 | |
4108 | |
4000 | s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x)))); |
4109 | s_return (mk_real (SCHEME_A_ round_per_R5RS (rvalue (x)))); |
4001 | #endif |
4110 | #endif |
4002 | |
4111 | |
… | |
… | |
4093 | else |
4202 | else |
4094 | Error_0 ("modulo: division by zero"); |
4203 | Error_0 ("modulo: division by zero"); |
4095 | |
4204 | |
4096 | s_return (mk_number (SCHEME_A_ v)); |
4205 | s_return (mk_number (SCHEME_A_ v)); |
4097 | |
4206 | |
4098 | case OP_CAR: /* car */ |
4207 | /* the compiler will optimize this mess... */ |
4099 | s_return (caar (args)); |
4208 | case OP_CAR: op_car: s_return (car (x)); |
4100 | |
4209 | case OP_CDR: op_cdr: s_return (cdr (x)); |
4101 | case OP_CDR: /* cdr */ |
4210 | case OP_CAAR: op_caar: x = car (x); goto op_car; |
4102 | s_return (cdar (args)); |
4211 | case OP_CADR: op_cadr: x = cdr (x); goto op_car; |
|
|
4212 | case OP_CDAR: op_cdar: x = car (x); goto op_cdr; |
|
|
4213 | case OP_CDDR: op_cddr: x = cdr (x); goto op_cdr; |
|
|
4214 | case OP_CAAAR: op_caaar: x = car (x); goto op_caar; |
|
|
4215 | case OP_CAADR: op_caadr: x = cdr (x); goto op_caar; |
|
|
4216 | case OP_CADAR: op_cadar: x = car (x); goto op_cadr; |
|
|
4217 | case OP_CADDR: op_caddr: x = cdr (x); goto op_cadr; |
|
|
4218 | case OP_CDAAR: op_cdaar: x = car (x); goto op_cdar; |
|
|
4219 | case OP_CDADR: op_cdadr: x = cdr (x); goto op_cdar; |
|
|
4220 | case OP_CDDAR: op_cddar: x = car (x); goto op_cddr; |
|
|
4221 | case OP_CDDDR: op_cdddr: x = cdr (x); goto op_cddr; |
|
|
4222 | case OP_CAAAAR: x = car (x); goto op_caaar; |
|
|
4223 | case OP_CAAADR: x = cdr (x); goto op_caaar; |
|
|
4224 | case OP_CAADAR: x = car (x); goto op_caadr; |
|
|
4225 | case OP_CAADDR: x = cdr (x); goto op_caadr; |
|
|
4226 | case OP_CADAAR: x = car (x); goto op_cadar; |
|
|
4227 | case OP_CADADR: x = cdr (x); goto op_cadar; |
|
|
4228 | case OP_CADDAR: x = car (x); goto op_caddr; |
|
|
4229 | case OP_CADDDR: x = cdr (x); goto op_caddr; |
|
|
4230 | case OP_CDAAAR: x = car (x); goto op_cdaar; |
|
|
4231 | case OP_CDAADR: x = cdr (x); goto op_cdaar; |
|
|
4232 | case OP_CDADAR: x = car (x); goto op_cdadr; |
|
|
4233 | case OP_CDADDR: x = cdr (x); goto op_cdadr; |
|
|
4234 | case OP_CDDAAR: x = car (x); goto op_cddar; |
|
|
4235 | case OP_CDDADR: x = cdr (x); goto op_cddar; |
|
|
4236 | case OP_CDDDAR: x = car (x); goto op_cdddr; |
|
|
4237 | case OP_CDDDDR: x = cdr (x); goto op_cdddr; |
4103 | |
4238 | |
4104 | case OP_CONS: /* cons */ |
4239 | case OP_CONS: /* cons */ |
4105 | set_cdr (args, cadr (args)); |
4240 | set_cdr (args, cadr (args)); |
4106 | s_return (args); |
4241 | s_return (args); |
4107 | |
4242 | |
… | |
… | |
4122 | } |
4257 | } |
4123 | else |
4258 | else |
4124 | Error_0 ("set-cdr!: unable to alter immutable pair"); |
4259 | Error_0 ("set-cdr!: unable to alter immutable pair"); |
4125 | |
4260 | |
4126 | case OP_CHAR2INT: /* char->integer */ |
4261 | case OP_CHAR2INT: /* char->integer */ |
4127 | s_return (mk_integer (SCHEME_A_ ivalue (x))); |
4262 | s_return (mk_integer (SCHEME_A_ ivalue_unchecked (x))); |
4128 | |
4263 | |
4129 | case OP_INT2CHAR: /* integer->char */ |
4264 | case OP_INT2CHAR: /* integer->char */ |
4130 | s_return (mk_character (SCHEME_A_ ivalue (x))); |
4265 | s_return (mk_character (SCHEME_A_ ivalue_unchecked (x))); |
4131 | |
4266 | |
4132 | case OP_CHARUPCASE: |
4267 | case OP_CHARUPCASE: |
4133 | { |
4268 | { |
4134 | unsigned char c = ivalue (x); |
4269 | unsigned char c = ivalue_unchecked (x); |
4135 | c = toupper (c); |
4270 | c = toupper (c); |
4136 | s_return (mk_character (SCHEME_A_ c)); |
4271 | s_return (mk_character (SCHEME_A_ c)); |
4137 | } |
4272 | } |
4138 | |
4273 | |
4139 | case OP_CHARDNCASE: |
4274 | case OP_CHARDNCASE: |
4140 | { |
4275 | { |
4141 | unsigned char c = ivalue (x); |
4276 | unsigned char c = ivalue_unchecked (x); |
4142 | c = tolower (c); |
4277 | c = tolower (c); |
4143 | s_return (mk_character (SCHEME_A_ c)); |
4278 | s_return (mk_character (SCHEME_A_ c)); |
4144 | } |
4279 | } |
4145 | |
4280 | |
4146 | case OP_STR2SYM: /* string->symbol */ |
4281 | case OP_STR2SYM: /* string->symbol */ |
… | |
… | |
4223 | Error_1 ("atom->string: not an atom:", x); |
4358 | Error_1 ("atom->string: not an atom:", x); |
4224 | } |
4359 | } |
4225 | |
4360 | |
4226 | case OP_MKSTRING: /* make-string */ |
4361 | case OP_MKSTRING: /* make-string */ |
4227 | { |
4362 | { |
4228 | int fill = ' '; |
4363 | int fill = cdr (args) != NIL ? charvalue (cadr (args)) : ' '; |
4229 | int len; |
|
|
4230 | |
|
|
4231 | len = ivalue (x); |
4364 | int len = ivalue_unchecked (x); |
4232 | |
|
|
4233 | if (cdr (args) != NIL) |
|
|
4234 | fill = charvalue (cadr (args)); |
|
|
4235 | |
4365 | |
4236 | s_return (mk_empty_string (SCHEME_A_ len, fill)); |
4366 | s_return (mk_empty_string (SCHEME_A_ len, fill)); |
4237 | } |
4367 | } |
4238 | |
4368 | |
4239 | case OP_STRLEN: /* string-length */ |
4369 | case OP_STRLEN: /* string-length */ |
4240 | s_return (mk_integer (SCHEME_A_ strlength (x))); |
4370 | s_return (mk_integer (SCHEME_A_ strlength (x))); |
4241 | |
4371 | |
4242 | case OP_STRREF: /* string-ref */ |
4372 | case OP_STRREF: /* string-ref */ |
4243 | { |
4373 | { |
4244 | char *str; |
|
|
4245 | int index; |
|
|
4246 | |
|
|
4247 | str = strvalue (x); |
4374 | char *str = strvalue (x); |
4248 | |
|
|
4249 | index = ivalue (cadr (args)); |
4375 | int index = ivalue_unchecked (cadr (args)); |
4250 | |
4376 | |
4251 | if (index >= strlength (x)) |
4377 | if (index >= strlength (x)) |
4252 | Error_1 ("string-ref: out of bounds:", cadr (args)); |
4378 | Error_1 ("string-ref: out of bounds:", cadr (args)); |
4253 | |
4379 | |
4254 | s_return (mk_character (SCHEME_A_ ((unsigned char *)str)[index])); |
4380 | s_return (mk_character (SCHEME_A_ ((unsigned char *)str)[index])); |
4255 | } |
4381 | } |
4256 | |
4382 | |
4257 | case OP_STRSET: /* string-set! */ |
4383 | case OP_STRSET: /* string-set! */ |
4258 | { |
4384 | { |
4259 | char *str; |
4385 | char *str = strvalue (x); |
4260 | int index; |
4386 | int index = ivalue_unchecked (cadr (args)); |
4261 | int c; |
4387 | int c; |
4262 | |
4388 | |
4263 | if (is_immutable (x)) |
4389 | if (is_immutable (x)) |
4264 | Error_1 ("string-set!: unable to alter immutable string:", x); |
4390 | Error_1 ("string-set!: unable to alter immutable string:", x); |
4265 | |
|
|
4266 | str = strvalue (x); |
|
|
4267 | |
|
|
4268 | index = ivalue (cadr (args)); |
|
|
4269 | |
4391 | |
4270 | if (index >= strlength (x)) |
4392 | if (index >= strlength (x)) |
4271 | Error_1 ("string-set!: out of bounds:", cadr (args)); |
4393 | Error_1 ("string-set!: out of bounds:", cadr (args)); |
4272 | |
4394 | |
4273 | c = charvalue (caddr (args)); |
4395 | c = charvalue (caddr (args)); |
… | |
… | |
4296 | s_return (newstr); |
4418 | s_return (newstr); |
4297 | } |
4419 | } |
4298 | |
4420 | |
4299 | case OP_SUBSTR: /* substring */ |
4421 | case OP_SUBSTR: /* substring */ |
4300 | { |
4422 | { |
4301 | char *str; |
4423 | char *str = strvalue (x); |
4302 | int index0; |
4424 | int index0 = ivalue_unchecked (cadr (args)); |
4303 | int index1; |
4425 | int index1; |
4304 | int len; |
4426 | int len; |
4305 | |
4427 | |
4306 | str = strvalue (x); |
|
|
4307 | |
|
|
4308 | index0 = ivalue (cadr (args)); |
|
|
4309 | |
|
|
4310 | if (index0 > strlength (x)) |
4428 | if (index0 > strlength (x)) |
4311 | Error_1 ("substring: start out of bounds:", cadr (args)); |
4429 | Error_1 ("substring: start out of bounds:", cadr (args)); |
4312 | |
4430 | |
4313 | if (cddr (args) != NIL) |
4431 | if (cddr (args) != NIL) |
4314 | { |
4432 | { |
4315 | index1 = ivalue (caddr (args)); |
4433 | index1 = ivalue_unchecked (caddr (args)); |
4316 | |
4434 | |
4317 | if (index1 > strlength (x) || index1 < index0) |
4435 | if (index1 > strlength (x) || index1 < index0) |
4318 | Error_1 ("substring: end out of bounds:", caddr (args)); |
4436 | Error_1 ("substring: end out of bounds:", caddr (args)); |
4319 | } |
4437 | } |
4320 | else |
4438 | else |
… | |
… | |
4343 | if (SCHEME_V->no_memory) |
4461 | if (SCHEME_V->no_memory) |
4344 | s_return (S_SINK); |
4462 | s_return (S_SINK); |
4345 | #endif |
4463 | #endif |
4346 | |
4464 | |
4347 | for (x = args, i = 0; is_pair (x); x = cdr (x), i++) |
4465 | for (x = args, i = 0; is_pair (x); x = cdr (x), i++) |
4348 | set_vector_elem (vec, i, car (x)); |
4466 | vector_set (vec, i, car (x)); |
4349 | |
4467 | |
4350 | s_return (vec); |
4468 | s_return (vec); |
4351 | } |
4469 | } |
4352 | |
4470 | |
4353 | case OP_MKVECTOR: /* make-vector */ |
4471 | case OP_MKVECTOR: /* make-vector */ |
4354 | { |
4472 | { |
4355 | pointer fill = NIL; |
4473 | pointer fill = NIL; |
4356 | int len; |
|
|
4357 | pointer vec; |
4474 | pointer vec; |
4358 | |
|
|
4359 | len = ivalue (x); |
4475 | int len = ivalue_unchecked (x); |
4360 | |
4476 | |
4361 | if (cdr (args) != NIL) |
4477 | if (cdr (args) != NIL) |
4362 | fill = cadr (args); |
4478 | fill = cadr (args); |
4363 | |
4479 | |
4364 | vec = mk_vector (SCHEME_A_ len); |
4480 | vec = mk_vector (SCHEME_A_ len); |
… | |
… | |
4367 | if (SCHEME_V->no_memory) |
4483 | if (SCHEME_V->no_memory) |
4368 | s_return (S_SINK); |
4484 | s_return (S_SINK); |
4369 | #endif |
4485 | #endif |
4370 | |
4486 | |
4371 | if (fill != NIL) |
4487 | if (fill != NIL) |
4372 | fill_vector (vec, fill); |
4488 | fill_vector (vec, 0, fill); |
4373 | |
4489 | |
4374 | s_return (vec); |
4490 | s_return (vec); |
4375 | } |
4491 | } |
4376 | |
4492 | |
4377 | case OP_VECLEN: /* vector-length */ |
4493 | case OP_VECLEN: /* vector-length */ |
4378 | s_return (mk_integer (SCHEME_A_ veclength (x))); |
4494 | s_return (mk_integer (SCHEME_A_ veclength (x))); |
4379 | |
4495 | |
|
|
4496 | case OP_VECRESIZE: |
|
|
4497 | vector_resize (x, ivalue_unchecked (cadr (args)), caddr (args)); |
|
|
4498 | s_return (x); |
|
|
4499 | |
4380 | case OP_VECREF: /* vector-ref */ |
4500 | case OP_VECREF: /* vector-ref */ |
4381 | { |
4501 | { |
4382 | int index; |
|
|
4383 | |
|
|
4384 | index = ivalue (cadr (args)); |
4502 | int index = ivalue_unchecked (cadr (args)); |
4385 | |
4503 | |
4386 | if (index >= veclength (car (args)) && USE_ERROR_CHECKING) |
4504 | if (index >= veclength (car (args)) && USE_ERROR_CHECKING) |
4387 | Error_1 ("vector-ref: out of bounds:", cadr (args)); |
4505 | Error_1 ("vector-ref: out of bounds:", cadr (args)); |
4388 | |
4506 | |
4389 | s_return (vector_elem (x, index)); |
4507 | s_return (vector_get (x, index)); |
4390 | } |
4508 | } |
4391 | |
4509 | |
4392 | case OP_VECSET: /* vector-set! */ |
4510 | case OP_VECSET: /* vector-set! */ |
4393 | { |
4511 | { |
4394 | int index; |
4512 | int index = ivalue_unchecked (cadr (args)); |
4395 | |
4513 | |
4396 | if (is_immutable (x)) |
4514 | if (is_immutable (x)) |
4397 | Error_1 ("vector-set!: unable to alter immutable vector:", x); |
4515 | Error_1 ("vector-set!: unable to alter immutable vector:", x); |
4398 | |
4516 | |
4399 | index = ivalue (cadr (args)); |
|
|
4400 | |
|
|
4401 | if (index >= veclength (car (args)) && USE_ERROR_CHECKING) |
4517 | if (index >= veclength (car (args)) && USE_ERROR_CHECKING) |
4402 | Error_1 ("vector-set!: out of bounds:", cadr (args)); |
4518 | Error_1 ("vector-set!: out of bounds:", cadr (args)); |
4403 | |
4519 | |
4404 | set_vector_elem (x, index, caddr (args)); |
4520 | vector_set (x, index, caddr (args)); |
4405 | s_return (x); |
4521 | s_return (x); |
4406 | } |
4522 | } |
4407 | } |
4523 | } |
4408 | |
4524 | |
4409 | if (USE_ERROR_CHECKING) abort (); |
4525 | if (USE_ERROR_CHECKING) abort (); |
4410 | } |
|
|
4411 | |
|
|
4412 | INTERFACE int |
|
|
4413 | is_list (SCHEME_P_ pointer a) |
|
|
4414 | { |
|
|
4415 | return list_length (SCHEME_A_ a) >= 0; |
|
|
4416 | } |
|
|
4417 | |
|
|
4418 | /* Result is: |
|
|
4419 | proper list: length |
|
|
4420 | circular list: -1 |
|
|
4421 | not even a pair: -2 |
|
|
4422 | dotted list: -2 minus length before dot |
|
|
4423 | */ |
|
|
4424 | INTERFACE int |
|
|
4425 | list_length (SCHEME_P_ pointer a) |
|
|
4426 | { |
|
|
4427 | int i = 0; |
|
|
4428 | pointer slow, fast; |
|
|
4429 | |
|
|
4430 | slow = fast = a; |
|
|
4431 | |
|
|
4432 | while (1) |
|
|
4433 | { |
|
|
4434 | if (fast == NIL) |
|
|
4435 | return i; |
|
|
4436 | |
|
|
4437 | if (!is_pair (fast)) |
|
|
4438 | return -2 - i; |
|
|
4439 | |
|
|
4440 | fast = cdr (fast); |
|
|
4441 | ++i; |
|
|
4442 | |
|
|
4443 | if (fast == NIL) |
|
|
4444 | return i; |
|
|
4445 | |
|
|
4446 | if (!is_pair (fast)) |
|
|
4447 | return -2 - i; |
|
|
4448 | |
|
|
4449 | ++i; |
|
|
4450 | fast = cdr (fast); |
|
|
4451 | |
|
|
4452 | /* Safe because we would have already returned if `fast' |
|
|
4453 | encountered a non-pair. */ |
|
|
4454 | slow = cdr (slow); |
|
|
4455 | |
|
|
4456 | if (fast == slow) |
|
|
4457 | { |
|
|
4458 | /* the fast pointer has looped back around and caught up |
|
|
4459 | with the slow pointer, hence the structure is circular, |
|
|
4460 | not of finite length, and therefore not a list */ |
|
|
4461 | return -1; |
|
|
4462 | } |
|
|
4463 | } |
|
|
4464 | } |
4526 | } |
4465 | |
4527 | |
4466 | static int |
4528 | static int |
4467 | opexe_2 (SCHEME_P_ enum scheme_opcodes op) |
4529 | opexe_2 (SCHEME_P_ enum scheme_opcodes op) |
4468 | { |
4530 | { |
… | |
… | |
4502 | pointer d = cdr (args); |
4564 | pointer d = cdr (args); |
4503 | int r; |
4565 | int r; |
4504 | |
4566 | |
4505 | switch (op) |
4567 | switch (op) |
4506 | { |
4568 | { |
4507 | case OP_NOT: /* not */ r = is_false (a) ; break; |
4569 | case OP_NOT: /* not */ r = is_false (a) ; break; |
4508 | case OP_BOOLP: /* boolean? */ r = a == S_F || a == S_T; break; |
4570 | case OP_BOOLP: /* boolean? */ r = a == S_F || a == S_T ; break; |
4509 | case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break; |
4571 | case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break; |
4510 | case OP_NULLP: /* null? */ r = a == NIL ; break; |
4572 | case OP_NULLP: /* null? */ r = a == NIL ; break; |
4511 | case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break; |
4573 | case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break; |
|
|
4574 | case OP_GENSYMP: /* gensym? */ r = is_gensym (SCHEME_A_ a); break; |
4512 | case OP_NUMBERP: /* number? */ r = is_number (a) ; break; |
4575 | case OP_NUMBERP: /* number? */ r = is_number (a) ; break; |
4513 | case OP_STRINGP: /* string? */ r = is_string (a) ; break; |
4576 | case OP_STRINGP: /* string? */ r = is_string (a) ; break; |
4514 | case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break; |
4577 | case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break; |
4515 | case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */ |
4578 | case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */ |
4516 | case OP_CHARP: /* char? */ r = is_character (a) ; break; |
4579 | case OP_CHARP: /* char? */ r = is_character (a) ; break; |
4517 | |
4580 | |
4518 | #if USE_CHAR_CLASSIFIERS |
4581 | #if USE_CHAR_CLASSIFIERS |
4519 | case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue (a)); break; |
4582 | case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue_unchecked (a)); break; |
4520 | case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue (a)); break; |
4583 | case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue_unchecked (a)); break; |
4521 | case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue (a)); break; |
4584 | case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue_unchecked (a)); break; |
4522 | case OP_CHARUP: /* char-upper-case? */ r = Cisupper (ivalue (a)); break; |
4585 | case OP_CHARUP: /* char-upper-case? */ r = Cisupper (ivalue_unchecked (a)); break; |
4523 | case OP_CHARLP: /* char-lower-case? */ r = Cislower (ivalue (a)); break; |
4586 | case OP_CHARLP: /* char-lower-case? */ r = Cislower (ivalue_unchecked (a)); break; |
4524 | #endif |
4587 | #endif |
4525 | |
4588 | |
4526 | #if USE_PORTS |
4589 | #if USE_PORTS |
4527 | case OP_PORTP: /* port? */ r = is_port (a) ; break; |
4590 | case OP_PORTP: /* port? */ r = is_port (a) ; break; |
4528 | case OP_INPORTP: /* input-port? */ r = is_inport (a) ; break; |
4591 | case OP_INPORTP: /* input-port? */ r = is_inport (a) ; break; |
… | |
… | |
4571 | } |
4634 | } |
4572 | else |
4635 | else |
4573 | s_return (SCHEME_V->code); |
4636 | s_return (SCHEME_V->code); |
4574 | |
4637 | |
4575 | case OP_SAVE_FORCED: /* Save forced value replacing promise */ |
4638 | case OP_SAVE_FORCED: /* Save forced value replacing promise */ |
4576 | memcpy (SCHEME_V->code, SCHEME_V->value, sizeof (struct cell)); |
4639 | *CELL (SCHEME_V->code) = *CELL (SCHEME_V->value); |
4577 | s_return (SCHEME_V->value); |
4640 | s_return (SCHEME_V->value); |
4578 | |
4641 | |
4579 | #if USE_PORTS |
4642 | #if USE_PORTS |
4580 | |
4643 | |
4581 | case OP_WRITE: /* write */ |
4644 | case OP_WRITE: /* write */ |
… | |
… | |
4726 | SCHEME_V->gc_verbose = (a != S_F); |
4789 | SCHEME_V->gc_verbose = (a != S_F); |
4727 | s_retbool (was); |
4790 | s_retbool (was); |
4728 | } |
4791 | } |
4729 | |
4792 | |
4730 | case OP_NEWSEGMENT: /* new-segment */ |
4793 | case OP_NEWSEGMENT: /* new-segment */ |
|
|
4794 | #if 0 |
4731 | if (!is_pair (args) || !is_number (a)) |
4795 | if (!is_pair (args) || !is_number (a)) |
4732 | Error_0 ("new-segment: argument must be a number"); |
4796 | Error_0 ("new-segment: argument must be a number"); |
4733 | |
4797 | #endif |
4734 | alloc_cellseg (SCHEME_A_ (int)ivalue (a)); |
4798 | s_retbool (alloc_cellseg (SCHEME_A)); |
4735 | |
|
|
4736 | s_return (S_T); |
|
|
4737 | |
4799 | |
4738 | case OP_OBLIST: /* oblist */ |
4800 | case OP_OBLIST: /* oblist */ |
4739 | s_return (oblist_all_symbols (SCHEME_A)); |
4801 | s_return (oblist_all_symbols (SCHEME_A)); |
4740 | |
4802 | |
4741 | #if USE_PORTS |
4803 | #if USE_PORTS |
… | |
… | |
4811 | s_return (p == NIL ? S_F : p); |
4873 | s_return (p == NIL ? S_F : p); |
4812 | } |
4874 | } |
4813 | |
4875 | |
4814 | case OP_GET_OUTSTRING: /* get-output-string */ |
4876 | case OP_GET_OUTSTRING: /* get-output-string */ |
4815 | { |
4877 | { |
4816 | port *p; |
4878 | port *p = port (a); |
4817 | |
4879 | |
4818 | if ((p = a->object.port)->kind & port_string) |
4880 | if (p->kind & port_string) |
4819 | { |
4881 | { |
4820 | off_t size; |
4882 | off_t size; |
4821 | char *str; |
4883 | char *str; |
4822 | |
4884 | |
4823 | size = p->rep.string.curr - p->rep.string.start + 1; |
4885 | size = p->rep.string.curr - p->rep.string.start + 1; |
… | |
… | |
4928 | int res; |
4990 | int res; |
4929 | |
4991 | |
4930 | if (is_pair (args)) |
4992 | if (is_pair (args)) |
4931 | p = car (args); |
4993 | p = car (args); |
4932 | |
4994 | |
4933 | res = p->object.port->kind & port_string; |
4995 | res = port (p)->kind & port_string; |
4934 | |
4996 | |
4935 | s_retbool (res); |
4997 | s_retbool (res); |
4936 | } |
4998 | } |
4937 | |
4999 | |
4938 | case OP_SET_INPORT: /* set-input-port */ |
5000 | case OP_SET_INPORT: /* set-input-port */ |
… | |
… | |
4997 | s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL); |
5059 | s_save (SCHEME_A_ OP_RDUQTSP, NIL, NIL); |
4998 | SCHEME_V->tok = token (SCHEME_A); |
5060 | SCHEME_V->tok = token (SCHEME_A); |
4999 | s_goto (OP_RDSEXPR); |
5061 | s_goto (OP_RDSEXPR); |
5000 | |
5062 | |
5001 | case TOK_ATOM: |
5063 | case TOK_ATOM: |
5002 | s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))); |
5064 | s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS))); |
|
|
5065 | |
|
|
5066 | case TOK_DOTATOM: |
|
|
5067 | SCHEME_V->strbuff[0] = '.'; |
|
|
5068 | s_return (mk_atom (SCHEME_A_ readstr_upto (SCHEME_A_ 1, DELIMITERS))); |
|
|
5069 | |
|
|
5070 | case TOK_STRATOM: |
|
|
5071 | x = readstrexp (SCHEME_A_ '|'); |
|
|
5072 | //TODO: haven't checked whether the garbage collector could interfere |
|
|
5073 | s_return (mk_atom (SCHEME_A_ strvalue (x))); |
5003 | |
5074 | |
5004 | case TOK_DQUOTE: |
5075 | case TOK_DQUOTE: |
5005 | x = readstrexp (SCHEME_A); |
5076 | x = readstrexp (SCHEME_A_ '"'); |
5006 | |
5077 | |
5007 | if (x == S_F) |
5078 | if (x == S_F) |
5008 | Error_0 ("Error reading string"); |
5079 | Error_0 ("Error reading string"); |
5009 | |
5080 | |
5010 | setimmutable (x); |
5081 | setimmutable (x); |
… | |
… | |
5022 | s_goto (OP_EVAL); |
5093 | s_goto (OP_EVAL); |
5023 | } |
5094 | } |
5024 | } |
5095 | } |
5025 | |
5096 | |
5026 | case TOK_SHARP_CONST: |
5097 | case TOK_SHARP_CONST: |
5027 | if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ DELIMITERS))) == NIL) |
5098 | if ((x = mk_sharp_const (SCHEME_A_ readstr_upto (SCHEME_A_ 0, DELIMITERS))) == NIL) |
5028 | Error_0 ("undefined sharp expression"); |
5099 | Error_0 ("undefined sharp expression"); |
5029 | else |
5100 | else |
5030 | s_return (x); |
5101 | s_return (x); |
5031 | |
5102 | |
5032 | default: |
5103 | default: |
… | |
… | |
5184 | putstr (SCHEME_A_ ")"); |
5255 | putstr (SCHEME_A_ ")"); |
5185 | s_return (S_T); |
5256 | s_return (S_T); |
5186 | } |
5257 | } |
5187 | else |
5258 | else |
5188 | { |
5259 | { |
5189 | pointer elem = vector_elem (vec, i); |
5260 | pointer elem = vector_get (vec, i); |
5190 | |
5261 | |
5191 | ivalue_unchecked (cdr (args)) = i + 1; |
5262 | ivalue_unchecked (cdr (args)) = i + 1; |
5192 | s_save (SCHEME_A_ OP_PVECFROM, args, NIL); |
5263 | s_save (SCHEME_A_ OP_PVECFROM, args, NIL); |
5193 | SCHEME_V->args = elem; |
5264 | SCHEME_V->args = elem; |
5194 | |
5265 | |
… | |
… | |
5254 | |
5325 | |
5255 | case OP_CLOSUREP: /* closure? */ |
5326 | case OP_CLOSUREP: /* closure? */ |
5256 | /* |
5327 | /* |
5257 | * Note, macro object is also a closure. |
5328 | * Note, macro object is also a closure. |
5258 | * Therefore, (closure? <#MACRO>) ==> #t |
5329 | * Therefore, (closure? <#MACRO>) ==> #t |
|
|
5330 | * (schmorp) well, obviously not, fix? TODO |
5259 | */ |
5331 | */ |
5260 | s_retbool (is_closure (a)); |
5332 | s_retbool (is_closure (a)); |
5261 | |
5333 | |
5262 | case OP_MACROP: /* macro? */ |
5334 | case OP_MACROP: /* macro? */ |
5263 | s_retbool (is_macro (a)); |
5335 | s_retbool (is_macro (a)); |
… | |
… | |
5269 | /* dispatch functions (opexe_x) return new opcode, or 0 for same opcode, or -1 to stop */ |
5341 | /* dispatch functions (opexe_x) return new opcode, or 0 for same opcode, or -1 to stop */ |
5270 | typedef int (*dispatch_func)(SCHEME_P_ enum scheme_opcodes); |
5342 | typedef int (*dispatch_func)(SCHEME_P_ enum scheme_opcodes); |
5271 | |
5343 | |
5272 | typedef int (*test_predicate)(pointer); |
5344 | typedef int (*test_predicate)(pointer); |
5273 | static int |
5345 | static int |
5274 | is_any (pointer p) |
5346 | tst_any (pointer p) |
5275 | { |
5347 | { |
5276 | return 1; |
5348 | return 1; |
5277 | } |
5349 | } |
5278 | |
5350 | |
5279 | static int |
5351 | static int |
5280 | is_nonneg (pointer p) |
5352 | tst_inonneg (pointer p) |
5281 | { |
5353 | { |
5282 | return ivalue (p) >= 0 && is_integer (p); |
5354 | return is_integer (p) && ivalue_unchecked (p) >= 0; |
5283 | } |
5355 | } |
5284 | |
5356 | |
5285 | static int |
5357 | static int |
5286 | tst_is_list (pointer p) |
5358 | tst_is_list (SCHEME_P_ pointer p) |
5287 | { |
5359 | { |
5288 | return p == NIL || is_pair (p); |
5360 | return p == NIL || is_pair (p); |
5289 | } |
5361 | } |
5290 | |
5362 | |
5291 | /* Correspond carefully with following defines! */ |
5363 | /* Correspond carefully with following defines! */ |
5292 | static struct |
5364 | static struct |
5293 | { |
5365 | { |
5294 | test_predicate fct; |
5366 | test_predicate fct; |
5295 | const char *kind; |
5367 | const char *kind; |
5296 | } tests[] = |
5368 | } tests[] = { |
5297 | { |
|
|
5298 | { is_any, 0 }, |
5369 | { tst_any , 0 }, |
5299 | { is_string, "string" }, |
5370 | { is_string , "string" }, |
5300 | { is_symbol, "symbol" }, |
5371 | { is_symbol , "symbol" }, |
5301 | { is_port, "port" }, |
5372 | { is_port , "port" }, |
5302 | { is_inport, "input port" }, |
5373 | { is_inport , "input port" }, |
5303 | { is_outport, "output port" }, |
5374 | { is_outport , "output port" }, |
5304 | { is_environment, "environment" }, |
5375 | { is_environment, "environment" }, |
5305 | { is_pair, "pair" }, |
5376 | { is_pair , "pair" }, |
5306 | { tst_is_list, "pair or '()" }, |
5377 | { 0 , "pair or '()" }, |
5307 | { is_character, "character" }, |
5378 | { is_character , "character" }, |
5308 | { is_vector, "vector" }, |
5379 | { is_vector , "vector" }, |
5309 | { is_number, "number" }, |
5380 | { is_number , "number" }, |
5310 | { is_integer, "integer" }, |
5381 | { is_integer , "integer" }, |
5311 | { is_nonneg, "non-negative integer" } |
5382 | { tst_inonneg , "non-negative integer" } |
5312 | }; |
5383 | }; |
5313 | |
5384 | |
5314 | #define TST_NONE 0 /* TST_NONE used for built-ins, 0 for internal ops */ |
5385 | #define TST_NONE 0 /* TST_NONE used for built-ins, 0 for internal ops */ |
5315 | #define TST_ANY "\001" |
5386 | #define TST_ANY "\001" |
5316 | #define TST_STRING "\002" |
5387 | #define TST_STRING "\002" |
… | |
… | |
5357 | typedef struct |
5428 | typedef struct |
5358 | { |
5429 | { |
5359 | uint8_t func; |
5430 | uint8_t func; |
5360 | /*dispatch_func func;*//*TODO: maybe optionally keep the pointer, for speed? */ |
5431 | /*dispatch_func func;*//*TODO: maybe optionally keep the pointer, for speed? */ |
5361 | uint8_t builtin; |
5432 | uint8_t builtin; |
|
|
5433 | #if USE_ERROR_CHECKING |
5362 | uint8_t min_arity; |
5434 | uint8_t min_arity; |
5363 | uint8_t max_arity; |
5435 | uint8_t max_arity; |
5364 | char arg_tests_encoding[3]; |
5436 | char arg_tests_encoding[3]; |
|
|
5437 | #endif |
5365 | } op_code_info; |
5438 | } op_code_info; |
5366 | |
5439 | |
5367 | static const op_code_info dispatch_table[] = { |
5440 | static const op_code_info dispatch_table[] = { |
|
|
5441 | #if USE_ERROR_CHECKING |
5368 | #define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1, minarity, maxarity, argtest }, |
5442 | #define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1, minarity, maxarity, argtest }, |
|
|
5443 | #else |
|
|
5444 | #define OP_DEF(func,name,minarity,maxarity,argtest,op) { func, sizeof (name) > 1 }, |
|
|
5445 | #endif |
5369 | #include "opdefines.h" |
5446 | #include "opdefines.h" |
5370 | #undef OP_DEF |
5447 | #undef OP_DEF |
5371 | {0} |
5448 | {0} |
5372 | }; |
5449 | }; |
5373 | |
5450 | |
… | |
… | |
5415 | { |
5492 | { |
5416 | pointer arg = car (arglist); |
5493 | pointer arg = car (arglist); |
5417 | |
5494 | |
5418 | j = t[0]; |
5495 | j = t[0]; |
5419 | |
5496 | |
|
|
5497 | /*TODO: tst_is_list has different prototype - fix if other tests acquire same prototype */ |
|
|
5498 | if (j == TST_LIST[0]) |
|
|
5499 | { |
|
|
5500 | if (!tst_is_list (SCHEME_A_ arg)) |
|
|
5501 | break; |
|
|
5502 | } |
|
|
5503 | else |
|
|
5504 | { |
5420 | if (!tests[j - 1].fct (arg)) |
5505 | if (!tests[j - 1].fct (arg)) |
5421 | break; |
5506 | break; |
|
|
5507 | } |
5422 | |
5508 | |
5423 | if (t[1]) /* last test is replicated as necessary */ |
5509 | if (t < pcd->arg_tests_encoding + sizeof (pcd->arg_tests_encoding) - 1 && t[1]) /* last test is replicated as necessary */ |
5424 | t++; |
5510 | t++; |
5425 | |
5511 | |
5426 | arglist = cdr (arglist); |
5512 | arglist = cdr (arglist); |
5427 | i++; |
5513 | i++; |
5428 | } |
5514 | } |
… | |
… | |
5454 | if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0)) |
5540 | if (ecb_expect_false (dispatch_funcs [pcd->func] (SCHEME_A_ SCHEME_V->op) != 0)) |
5455 | return; |
5541 | return; |
5456 | |
5542 | |
5457 | if (SCHEME_V->no_memory && USE_ERROR_CHECKING) |
5543 | if (SCHEME_V->no_memory && USE_ERROR_CHECKING) |
5458 | { |
5544 | { |
5459 | xwrstr ("No memory!\n"); |
5545 | putstr (SCHEME_A_ "No memory!\n"); |
5460 | return; |
5546 | return; |
5461 | } |
5547 | } |
5462 | } |
5548 | } |
5463 | } |
5549 | } |
5464 | |
5550 | |
… | |
… | |
5483 | mk_proc (SCHEME_P_ enum scheme_opcodes op) |
5569 | mk_proc (SCHEME_P_ enum scheme_opcodes op) |
5484 | { |
5570 | { |
5485 | pointer y = get_cell (SCHEME_A_ NIL, NIL); |
5571 | pointer y = get_cell (SCHEME_A_ NIL, NIL); |
5486 | set_typeflag (y, (T_PROC | T_ATOM)); |
5572 | set_typeflag (y, (T_PROC | T_ATOM)); |
5487 | ivalue_unchecked (y) = op; |
5573 | ivalue_unchecked (y) = op; |
5488 | set_num_integer (y); |
|
|
5489 | return y; |
5574 | return y; |
5490 | } |
5575 | } |
5491 | |
5576 | |
5492 | /* Hard-coded for the given keywords. Remember to rewrite if more are added! */ |
5577 | /* Hard-coded for the given keywords. Remember to rewrite if more are added! */ |
5493 | static int |
5578 | static int |
5494 | syntaxnum (pointer p) |
5579 | syntaxnum (pointer p) |
5495 | { |
5580 | { |
5496 | const char *s = strvalue (car (p)); |
5581 | const char *s = strvalue (p); |
5497 | |
5582 | |
5498 | switch (strlength (car (p))) |
5583 | switch (strlength (p)) |
5499 | { |
5584 | { |
5500 | case 2: |
5585 | case 2: |
5501 | if (s[0] == 'i') |
5586 | if (s[0] == 'i') |
5502 | return OP_IF0; /* if */ |
5587 | return OP_IF0; /* if */ |
5503 | else |
5588 | else |
… | |
… | |
5578 | ecb_cold int |
5663 | ecb_cold int |
5579 | scheme_init (SCHEME_P) |
5664 | scheme_init (SCHEME_P) |
5580 | { |
5665 | { |
5581 | int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]); |
5666 | int i, n = sizeof (dispatch_table) / sizeof (dispatch_table[0]); |
5582 | pointer x; |
5667 | pointer x; |
|
|
5668 | |
|
|
5669 | /* this memset is not strictly correct, as we assume (intcache) |
|
|
5670 | * that memset 0 will also set pointers to 0, but memset does |
|
|
5671 | * of course not guarantee that. screw such systems. |
|
|
5672 | */ |
|
|
5673 | memset (SCHEME_V, 0, sizeof (*SCHEME_V)); |
5583 | |
5674 | |
5584 | num_set_fixnum (num_zero, 1); |
5675 | num_set_fixnum (num_zero, 1); |
5585 | num_set_ivalue (num_zero, 0); |
5676 | num_set_ivalue (num_zero, 0); |
5586 | num_set_fixnum (num_one, 1); |
5677 | num_set_fixnum (num_one, 1); |
5587 | num_set_ivalue (num_one, 1); |
5678 | num_set_ivalue (num_one, 1); |
… | |
… | |
5599 | SCHEME_V->save_inport = NIL; |
5690 | SCHEME_V->save_inport = NIL; |
5600 | SCHEME_V->loadport = NIL; |
5691 | SCHEME_V->loadport = NIL; |
5601 | SCHEME_V->nesting = 0; |
5692 | SCHEME_V->nesting = 0; |
5602 | SCHEME_V->interactive_repl = 0; |
5693 | SCHEME_V->interactive_repl = 0; |
5603 | |
5694 | |
5604 | if (alloc_cellseg (SCHEME_A_ FIRST_CELLSEGS) != FIRST_CELLSEGS) |
5695 | if (!alloc_cellseg (SCHEME_A)) |
5605 | { |
5696 | { |
5606 | #if USE_ERROR_CHECKING |
5697 | #if USE_ERROR_CHECKING |
5607 | SCHEME_V->no_memory = 1; |
5698 | SCHEME_V->no_memory = 1; |
5608 | return 0; |
5699 | return 0; |
5609 | #endif |
5700 | #endif |
… | |
… | |
5939 | # endif |
6030 | # endif |
5940 | int fin; |
6031 | int fin; |
5941 | char *file_name = InitFile; |
6032 | char *file_name = InitFile; |
5942 | int retcode; |
6033 | int retcode; |
5943 | int isfile = 1; |
6034 | int isfile = 1; |
|
|
6035 | system ("ps v $PPID");//D |
5944 | |
6036 | |
5945 | if (argc == 2 && strcmp (argv[1], "-?") == 0) |
6037 | if (argc == 2 && strcmp (argv[1], "-?") == 0) |
5946 | { |
6038 | { |
5947 | xwrstr ("Usage: tinyscheme -?\n"); |
6039 | putstr (SCHEME_A_ "Usage: tinyscheme -?\n"); |
5948 | xwrstr ("or: tinyscheme [<file1> <file2> ...]\n"); |
6040 | putstr (SCHEME_A_ "or: tinyscheme [<file1> <file2> ...]\n"); |
5949 | xwrstr ("followed by\n"); |
6041 | putstr (SCHEME_A_ "followed by\n"); |
5950 | xwrstr (" -1 <file> [<arg1> <arg2> ...]\n"); |
6042 | putstr (SCHEME_A_ " -1 <file> [<arg1> <arg2> ...]\n"); |
5951 | xwrstr (" -c <Scheme commands> [<arg1> <arg2> ...]\n"); |
6043 | putstr (SCHEME_A_ " -c <Scheme commands> [<arg1> <arg2> ...]\n"); |
5952 | xwrstr ("assuming that the executable is named tinyscheme.\n"); |
6044 | putstr (SCHEME_A_ "assuming that the executable is named tinyscheme.\n"); |
5953 | xwrstr ("Use - as filename for stdin.\n"); |
6045 | putstr (SCHEME_A_ "Use - as filename for stdin.\n"); |
5954 | return 1; |
6046 | return 1; |
5955 | } |
6047 | } |
5956 | |
6048 | |
5957 | if (!scheme_init (SCHEME_A)) |
6049 | if (!scheme_init (SCHEME_A)) |
5958 | { |
6050 | { |
5959 | xwrstr ("Could not initialize!\n"); |
6051 | putstr (SCHEME_A_ "Could not initialize!\n"); |
5960 | return 2; |
6052 | return 2; |
5961 | } |
6053 | } |
5962 | |
6054 | |
5963 | # if USE_PORTS |
6055 | # if USE_PORTS |
5964 | scheme_set_input_port_file (SCHEME_A_ STDIN_FILENO); |
6056 | scheme_set_input_port_file (SCHEME_A_ STDIN_FILENO); |
… | |
… | |
6009 | fin = open (file_name, O_RDONLY); |
6101 | fin = open (file_name, O_RDONLY); |
6010 | #endif |
6102 | #endif |
6011 | |
6103 | |
6012 | if (isfile && fin < 0) |
6104 | if (isfile && fin < 0) |
6013 | { |
6105 | { |
6014 | xwrstr ("Could not open file "); xwrstr (file_name); xwrstr ("\n"); |
6106 | putstr (SCHEME_A_ "Could not open file "); putstr (SCHEME_A_ file_name); putstr (SCHEME_A_ "\n"); |
6015 | } |
6107 | } |
6016 | else |
6108 | else |
6017 | { |
6109 | { |
6018 | if (isfile) |
6110 | if (isfile) |
6019 | scheme_load_named_file (SCHEME_A_ fin, file_name); |
6111 | scheme_load_named_file (SCHEME_A_ fin, file_name); |
… | |
… | |
6023 | #if USE_PORTS |
6115 | #if USE_PORTS |
6024 | if (!isfile || fin != STDIN_FILENO) |
6116 | if (!isfile || fin != STDIN_FILENO) |
6025 | { |
6117 | { |
6026 | if (SCHEME_V->retcode != 0) |
6118 | if (SCHEME_V->retcode != 0) |
6027 | { |
6119 | { |
6028 | xwrstr ("Errors encountered reading "); xwrstr (file_name); xwrstr ("\n"); |
6120 | putstr (SCHEME_A_ "Errors encountered reading "); putstr (SCHEME_A_ file_name); putstr (SCHEME_A_ "\n"); |
6029 | } |
6121 | } |
6030 | |
6122 | |
6031 | if (isfile) |
6123 | if (isfile) |
6032 | close (fin); |
6124 | close (fin); |
6033 | } |
6125 | } |