Changes in doc/ref:
[bpt/guile.git] / libguile / eval.c
1 /* Copyright (C) 1995,1996,1997,1998,1999,2000,2001 Free Software Foundation, Inc.
2 *
3 * This program is free software; you can redistribute it and/or modify
4 * it under the terms of the GNU General Public License as published by
5 * the Free Software Foundation; either version 2, or (at your option)
6 * any later version.
7 *
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11 * GNU General Public License for more details.
12 *
13 * You should have received a copy of the GNU General Public License
14 * along with this software; see the file COPYING. If not, write to
15 * the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
16 * Boston, MA 02111-1307 USA
17 *
18 * As a special exception, the Free Software Foundation gives permission
19 * for additional uses of the text contained in its release of GUILE.
20 *
21 * The exception is that, if you link the GUILE library with other files
22 * to produce an executable, this does not by itself cause the
23 * resulting executable to be covered by the GNU General Public License.
24 * Your use of that executable is in no way restricted on account of
25 * linking the GUILE library code into it.
26 *
27 * This exception does not however invalidate any other reasons why
28 * the executable file might be covered by the GNU General Public License.
29 *
30 * This exception applies only to the code released by the
31 * Free Software Foundation under the name GUILE. If you copy
32 * code from other Free Software Foundation releases into a copy of
33 * GUILE, as the General Public License permits, the exception does
34 * not apply to the code that you add in this way. To avoid misleading
35 * anyone as to the status of such modified files, you must delete
36 * this exception notice from them.
37 *
38 * If you write modifications of your own for GUILE, it is your choice
39 * whether to permit this exception to apply to your modifications.
40 * If you do not wish that, delete this exception notice. */
41
42 \f
43
44 /* This file is read twice in order to produce debugging versions of
45 * scm_ceval and scm_apply. These functions, scm_deval and
46 * scm_dapply, are produced when we define the preprocessor macro
47 * DEVAL. The file is divided into sections which are treated
48 * differently with respect to DEVAL. The heads of these sections are
49 * marked with the string "SECTION:".
50 */
51
52 /* SECTION: This code is compiled once.
53 */
54
55 #ifndef DEVAL
56
57 /* We need this to get the definitions for HAVE_ALLOCA_H, etc. */
58 #include "libguile/scmconfig.h"
59
60 /* AIX requires this to be the first thing in the file. The #pragma
61 directive is indented so pre-ANSI compilers will ignore it, rather
62 than choke on it. */
63 #ifndef __GNUC__
64 # if HAVE_ALLOCA_H
65 # include <alloca.h>
66 # else
67 # ifdef _AIX
68 # pragma alloca
69 # else
70 # ifndef alloca /* predefined by HP cc +Olibcalls */
71 char *alloca ();
72 # endif
73 # endif
74 # endif
75 #endif
76
77 #include "libguile/_scm.h"
78 #include "libguile/debug.h"
79 #include "libguile/dynwind.h"
80 #include "libguile/alist.h"
81 #include "libguile/eq.h"
82 #include "libguile/continuations.h"
83 #include "libguile/throw.h"
84 #include "libguile/smob.h"
85 #include "libguile/macros.h"
86 #include "libguile/procprop.h"
87 #include "libguile/hashtab.h"
88 #include "libguile/hash.h"
89 #include "libguile/srcprop.h"
90 #include "libguile/stackchk.h"
91 #include "libguile/objects.h"
92 #include "libguile/async.h"
93 #include "libguile/feature.h"
94 #include "libguile/modules.h"
95 #include "libguile/ports.h"
96 #include "libguile/root.h"
97 #include "libguile/vectors.h"
98 #include "libguile/fluids.h"
99 #include "libguile/values.h"
100
101 #include "libguile/validate.h"
102 #include "libguile/eval.h"
103 #include "libguile/lang.h"
104
105 \f
106
107 #define SCM_VALIDATE_NON_EMPTY_COMBINATION(x) \
108 do { \
109 if (SCM_EQ_P ((x), SCM_EOL)) \
110 scm_misc_error (NULL, scm_s_expression, SCM_EOL); \
111 } while (0)
112
113 \f
114
115 /* The evaluator contains a plethora of EVAL symbols.
116 * This is an attempt at explanation.
117 *
118 * The following macros should be used in code which is read twice
119 * (where the choice of evaluator is hard soldered):
120 *
121 * SCM_CEVAL is the symbol used within one evaluator to call itself.
122 * Originally, it is defined to scm_ceval, but is redefined to
123 * scm_deval during the second pass.
124 *
125 * SIDEVAL corresponds to SCM_CEVAL, but is used in situations where
126 * only side effects of expressions matter. All immediates are
127 * ignored.
128 *
129 * SCM_EVALIM is used when it is known that the expression is an
130 * immediate. (This macro never calls an evaluator.)
131 *
132 * EVALCAR evaluates the car of an expression.
133 *
134 * EVALCELLCAR is like EVALCAR, but is used when it is known that the
135 * car is a lisp cell.
136 *
137 * The following macros should be used in code which is read once
138 * (where the choice of evaluator is dynamic):
139 *
140 * SCM_XEVAL takes care of immediates without calling an evaluator. It
141 * then calls scm_ceval *or* scm_deval, depending on the debugging
142 * mode.
143 *
144 * SCM_XEVALCAR corresponds to EVALCAR, but uses scm_ceval *or* scm_deval
145 * depending on the debugging mode.
146 *
147 * The main motivation for keeping this plethora is efficiency
148 * together with maintainability (=> locality of code).
149 */
150
151 #define SCM_CEVAL scm_ceval
152 #define SIDEVAL(x, env) if (SCM_NIMP (x)) SCM_CEVAL((x), (env))
153
154 #define EVALCELLCAR(x, env) (SCM_SYMBOLP (SCM_CAR (x)) \
155 ? *scm_lookupcar (x, env, 1) \
156 : SCM_CEVAL (SCM_CAR (x), env))
157
158 #define EVALCAR(x, env) (SCM_IMP (SCM_CAR (x)) \
159 ? SCM_EVALIM (SCM_CAR (x), env) \
160 : EVALCELLCAR (x, env))
161
162 #define EXTEND_ENV SCM_EXTEND_ENV
163
164 #ifdef MEMOIZE_LOCALS
165
166 SCM *
167 scm_ilookup (SCM iloc, SCM env)
168 {
169 register long ir = SCM_IFRAME (iloc);
170 register SCM er = env;
171 for (; 0 != ir; --ir)
172 er = SCM_CDR (er);
173 er = SCM_CAR (er);
174 for (ir = SCM_IDIST (iloc); 0 != ir; --ir)
175 er = SCM_CDR (er);
176 if (SCM_ICDRP (iloc))
177 return SCM_CDRLOC (er);
178 return SCM_CARLOC (SCM_CDR (er));
179 }
180 #endif
181
182 #ifdef USE_THREADS
183
184 /* The Lookup Car Race
185 - by Eva Luator
186
187 Memoization of variables and special forms is done while executing
188 the code for the first time. As long as there is only one thread
189 everything is fine, but as soon as two threads execute the same
190 code concurrently `for the first time' they can come into conflict.
191
192 This memoization includes rewriting variable references into more
193 efficient forms and expanding macros. Furthermore, macro expansion
194 includes `compiling' special forms like `let', `cond', etc. into
195 tree-code instructions.
196
197 There shouldn't normally be a problem with memoizing local and
198 global variable references (into ilocs and variables), because all
199 threads will mutate the code in *exactly* the same way and (if I
200 read the C code correctly) it is not possible to observe a half-way
201 mutated cons cell. The lookup procedure can handle this
202 transparently without any critical sections.
203
204 It is different with macro expansion, because macro expansion
205 happens outside of the lookup procedure and can't be
206 undone. Therefore the lookup procedure can't cope with it. It has
207 to indicate failure when it detects a lost race and hope that the
208 caller can handle it. Luckily, it turns out that this is the case.
209
210 An example to illustrate this: Suppose that the following form will
211 be memoized concurrently by two threads
212
213 (let ((x 12)) x)
214
215 Let's first examine the lookup of X in the body. The first thread
216 decides that it has to find the symbol "x" in the environment and
217 starts to scan it. Then the other thread takes over and actually
218 overtakes the first. It looks up "x" and substitutes an
219 appropriate iloc for it. Now the first thread continues and
220 completes its lookup. It comes to exactly the same conclusions as
221 the second one and could - without much ado - just overwrite the
222 iloc with the same iloc.
223
224 But let's see what will happen when the race occurs while looking
225 up the symbol "let" at the start of the form. It could happen that
226 the second thread interrupts the lookup of the first thread and not
227 only substitutes a variable for it but goes right ahead and
228 replaces it with the compiled form (#@let* (x 12) x). Now, when
229 the first thread completes its lookup, it would replace the #@let*
230 with a variable containing the "let" binding, effectively reverting
231 the form to (let (x 12) x). This is wrong. It has to detect that
232 it has lost the race and the evaluator has to reconsider the
233 changed form completely.
234
235 This race condition could be resolved with some kind of traffic
236 light (like mutexes) around scm_lookupcar, but I think that it is
237 best to avoid them in this case. They would serialize memoization
238 completely and because lookup involves calling arbitrary Scheme
239 code (via the lookup-thunk), threads could be blocked for an
240 arbitrary amount of time or even deadlock. But with the current
241 solution a lot of unnecessary work is potentially done. */
242
243 /* SCM_LOOKUPCAR1 is was SCM_LOOKUPCAR used to be but is allowed to
244 return NULL to indicate a failed lookup due to some race conditions
245 between threads. This only happens when VLOC is the first cell of
246 a special form that will eventually be memoized (like `let', etc.)
247 In that case the whole lookup is bogus and the caller has to
248 reconsider the complete special form.
249
250 SCM_LOOKUPCAR is still there, of course. It just calls
251 SCM_LOOKUPCAR1 and aborts on receiving NULL. So SCM_LOOKUPCAR
252 should only be called when it is known that VLOC is not the first
253 pair of a special form. Otherwise, use SCM_LOOKUPCAR1 and check
254 for NULL. I think I've found the only places where this
255 applies. */
256
257 #endif /* USE_THREADS */
258
259 SCM_SYMBOL (scm_unbound_variable_key, "unbound-variable");
260
261 #ifdef USE_THREADS
262 static SCM *
263 scm_lookupcar1 (SCM vloc, SCM genv, int check)
264 #else
265 SCM *
266 scm_lookupcar (SCM vloc, SCM genv, int check)
267 #endif
268 {
269 SCM env = genv;
270 register SCM *al, fl, var = SCM_CAR (vloc);
271 #ifdef MEMOIZE_LOCALS
272 register SCM iloc = SCM_ILOC00;
273 #endif
274 for (; SCM_NIMP (env); env = SCM_CDR (env))
275 {
276 if (!SCM_CONSP (SCM_CAR (env)))
277 break;
278 al = SCM_CARLOC (env);
279 for (fl = SCM_CAR (*al); SCM_NIMP (fl); fl = SCM_CDR (fl))
280 {
281 if (!SCM_CONSP (fl))
282 {
283 if (SCM_EQ_P (fl, var))
284 {
285 #ifdef MEMOIZE_LOCALS
286 #ifdef USE_THREADS
287 if (! SCM_EQ_P (SCM_CAR (vloc), var))
288 goto race;
289 #endif
290 SCM_SET_CELL_WORD_0 (vloc, SCM_UNPACK (iloc) + SCM_ICDR);
291 #endif
292 return SCM_CDRLOC (*al);
293 }
294 else
295 break;
296 }
297 al = SCM_CDRLOC (*al);
298 if (SCM_EQ_P (SCM_CAR (fl), var))
299 {
300 #ifdef MEMOIZE_LOCALS
301 #ifndef SCM_RECKLESS /* letrec inits to SCM_UNDEFINED */
302 if (SCM_UNBNDP (SCM_CAR (*al)))
303 {
304 env = SCM_EOL;
305 goto errout;
306 }
307 #endif
308 #ifdef USE_THREADS
309 if (!SCM_EQ_P (SCM_CAR (vloc), var))
310 goto race;
311 #endif
312 SCM_SETCAR (vloc, iloc);
313 #endif
314 return SCM_CARLOC (*al);
315 }
316 #ifdef MEMOIZE_LOCALS
317 iloc = SCM_PACK (SCM_UNPACK (iloc) + SCM_IDINC);
318 #endif
319 }
320 #ifdef MEMOIZE_LOCALS
321 iloc = SCM_PACK ((~SCM_IDSTMSK) & (SCM_UNPACK(iloc) + SCM_IFRINC));
322 #endif
323 }
324 {
325 SCM top_thunk, real_var;
326 if (SCM_NIMP (env))
327 {
328 top_thunk = SCM_CAR (env); /* env now refers to a
329 top level env thunk */
330 env = SCM_CDR (env);
331 }
332 else
333 top_thunk = SCM_BOOL_F;
334 real_var = scm_sym2var (var, top_thunk, SCM_BOOL_F);
335 if (SCM_FALSEP (real_var))
336 goto errout;
337
338 #ifndef SCM_RECKLESS
339 if (!SCM_NULLP (env) || SCM_UNBNDP (SCM_VARIABLE_REF (real_var)))
340 {
341 errout:
342 if (check)
343 {
344 if (SCM_NULLP (env))
345 scm_error (scm_unbound_variable_key, NULL,
346 "Unbound variable: ~S",
347 scm_list_1 (var), SCM_BOOL_F);
348 else
349 scm_misc_error (NULL, "Damaged environment: ~S",
350 scm_list_1 (var));
351 }
352 else
353 {
354 /* A variable could not be found, but we shall
355 not throw an error. */
356 static SCM undef_object = SCM_UNDEFINED;
357 return &undef_object;
358 }
359 }
360 #endif
361
362 #ifdef USE_THREADS
363 if (!SCM_EQ_P (SCM_CAR (vloc), var))
364 {
365 /* Some other thread has changed the very cell we are working
366 on. In effect, it must have done our job or messed it up
367 completely. */
368 race:
369 var = SCM_CAR (vloc);
370 if (SCM_VARIABLEP (var))
371 return SCM_VARIABLE_LOC (var);
372 #ifdef MEMOIZE_LOCALS
373 if (SCM_ITAG7 (var) == SCM_ITAG7 (SCM_ILOC00))
374 return scm_ilookup (var, genv);
375 #endif
376 /* We can't cope with anything else than variables and ilocs. When
377 a special form has been memoized (i.e. `let' into `#@let') we
378 return NULL and expect the calling function to do the right
379 thing. For the evaluator, this means going back and redoing
380 the dispatch on the car of the form. */
381 return NULL;
382 }
383 #endif /* USE_THREADS */
384
385 SCM_SETCAR (vloc, real_var);
386 return SCM_VARIABLE_LOC (real_var);
387 }
388 }
389
390 #ifdef USE_THREADS
391 SCM *
392 scm_lookupcar (SCM vloc, SCM genv, int check)
393 {
394 SCM *loc = scm_lookupcar1 (vloc, genv, check);
395 if (loc == NULL)
396 abort ();
397 return loc;
398 }
399 #endif
400
401 #define unmemocar scm_unmemocar
402
403 SCM_SYMBOL (sym_three_question_marks, "???");
404
405 SCM
406 scm_unmemocar (SCM form, SCM env)
407 {
408 if (!SCM_CONSP (form))
409 return form;
410 else
411 {
412 SCM c = SCM_CAR (form);
413 if (SCM_VARIABLEP (c))
414 {
415 SCM sym = scm_module_reverse_lookup (scm_env_module (env), c);
416 if (SCM_FALSEP (sym))
417 sym = sym_three_question_marks;
418 SCM_SETCAR (form, sym);
419 }
420 #ifdef MEMOIZE_LOCALS
421 else if (SCM_ILOCP (c))
422 {
423 unsigned long int ir;
424
425 for (ir = SCM_IFRAME (c); ir != 0; --ir)
426 env = SCM_CDR (env);
427 env = SCM_CAAR (env);
428 for (ir = SCM_IDIST (c); ir != 0; --ir)
429 env = SCM_CDR (env);
430 SCM_SETCAR (form, SCM_ICDRP (c) ? env : SCM_CAR (env));
431 }
432 #endif
433 return form;
434 }
435 }
436
437
438 SCM
439 scm_eval_car (SCM pair, SCM env)
440 {
441 return SCM_XEVALCAR (pair, env);
442 }
443
444 \f
445 /*
446 * The following rewrite expressions and
447 * some memoized forms have different syntax
448 */
449
450 const char scm_s_expression[] = "missing or extra expression";
451 const char scm_s_test[] = "bad test";
452 const char scm_s_body[] = "bad body";
453 const char scm_s_bindings[] = "bad bindings";
454 const char scm_s_duplicate_bindings[] = "duplicate bindings";
455 const char scm_s_variable[] = "bad variable";
456 const char scm_s_clauses[] = "bad or missing clauses";
457 const char scm_s_formals[] = "bad formals";
458 const char scm_s_duplicate_formals[] = "duplicate formals";
459 static const char s_splicing[] = "bad (non-list) result for unquote-splicing";
460
461 SCM_GLOBAL_SYMBOL (scm_sym_dot, ".");
462 SCM_GLOBAL_SYMBOL (scm_sym_arrow, "=>");
463 SCM_GLOBAL_SYMBOL (scm_sym_else, "else");
464 SCM_GLOBAL_SYMBOL (scm_sym_unquote, "unquote");
465 SCM_GLOBAL_SYMBOL (scm_sym_uq_splicing, "unquote-splicing");
466
467 SCM scm_f_apply;
468
469 #ifdef DEBUG_EXTENSIONS
470 SCM_GLOBAL_SYMBOL (scm_sym_enter_frame, "enter-frame");
471 SCM_GLOBAL_SYMBOL (scm_sym_apply_frame, "apply-frame");
472 SCM_GLOBAL_SYMBOL (scm_sym_exit_frame, "exit-frame");
473 SCM_GLOBAL_SYMBOL (scm_sym_trace, "trace");
474 #endif
475
476
477 /* Check that the body denoted by XORIG is valid and rewrite it into
478 its internal form. The internal form of a body is just the body
479 itself, but prefixed with an ISYM that denotes to what kind of
480 outer construct this body belongs. A lambda body starts with
481 SCM_IM_LAMBDA, for example, a body of a let starts with SCM_IM_LET,
482 etc. The one exception is a body that belongs to a letrec that has
483 been formed by rewriting internal defines: it starts with
484 SCM_IM_DEFINE. */
485
486 /* XXX - Besides controlling the rewriting of internal defines, the
487 additional ISYM could be used for improved error messages.
488 This is not done yet. */
489
490 static SCM
491 scm_m_body (SCM op, SCM xorig, const char *what)
492 {
493 SCM_ASSYNT (scm_ilength (xorig) >= 1, scm_s_body, what);
494
495 /* Don't add another ISYM if one is present already. */
496 if (SCM_ISYMP (SCM_CAR (xorig)))
497 return xorig;
498
499 /* Retain possible doc string. */
500 if (!SCM_CONSP (SCM_CAR (xorig)))
501 {
502 if (!SCM_NULLP (SCM_CDR (xorig)))
503 return scm_cons (SCM_CAR (xorig),
504 scm_m_body (op, SCM_CDR (xorig), what));
505 return xorig;
506 }
507
508 return scm_cons (op, xorig);
509 }
510
511
512 SCM_SYNTAX (s_quote, "quote", scm_makmmacro, scm_m_quote);
513 SCM_GLOBAL_SYMBOL (scm_sym_quote, s_quote);
514
515 SCM
516 scm_m_quote (SCM xorig, SCM env SCM_UNUSED)
517 {
518 SCM_ASSYNT (scm_ilength (SCM_CDR (xorig)) == 1, scm_s_expression, s_quote);
519 return scm_cons (SCM_IM_QUOTE, SCM_CDR (xorig));
520 }
521
522
523 SCM_SYNTAX (s_begin, "begin", scm_makmmacro, scm_m_begin);
524 SCM_GLOBAL_SYMBOL (scm_sym_begin, s_begin);
525
526 SCM
527 scm_m_begin (SCM xorig, SCM env SCM_UNUSED)
528 {
529 SCM_ASSYNT (scm_ilength (SCM_CDR (xorig)) >= 0, scm_s_expression, s_begin);
530 return scm_cons (SCM_IM_BEGIN, SCM_CDR (xorig));
531 }
532
533
534 SCM_SYNTAX (s_if, "if", scm_makmmacro, scm_m_if);
535 SCM_GLOBAL_SYMBOL (scm_sym_if, s_if);
536
537 SCM
538 scm_m_if (SCM xorig, SCM env SCM_UNUSED)
539 {
540 long len = scm_ilength (SCM_CDR (xorig));
541 SCM_ASSYNT (len >= 2 && len <= 3, scm_s_expression, s_if);
542 return scm_cons (SCM_IM_IF, SCM_CDR (xorig));
543 }
544
545
546 /* Will go into the RnRS module when Guile is factorized.
547 SCM_SYNTAX (scm_s_set_x,"set!", scm_makmmacro, scm_m_set_x); */
548 const char scm_s_set_x[] = "set!";
549 SCM_GLOBAL_SYMBOL (scm_sym_set_x, scm_s_set_x);
550
551 SCM
552 scm_m_set_x (SCM xorig, SCM env SCM_UNUSED)
553 {
554 SCM x = SCM_CDR (xorig);
555 SCM_ASSYNT (scm_ilength (x) == 2, scm_s_expression, scm_s_set_x);
556 SCM_ASSYNT (SCM_SYMBOLP (SCM_CAR (x)), scm_s_variable, scm_s_set_x);
557 return scm_cons (SCM_IM_SET_X, x);
558 }
559
560
561 SCM_SYNTAX (s_and, "and", scm_makmmacro, scm_m_and);
562 SCM_GLOBAL_SYMBOL (scm_sym_and, s_and);
563
564 SCM
565 scm_m_and (SCM xorig, SCM env SCM_UNUSED)
566 {
567 long len = scm_ilength (SCM_CDR (xorig));
568 SCM_ASSYNT (len >= 0, scm_s_test, s_and);
569 if (len >= 1)
570 return scm_cons (SCM_IM_AND, SCM_CDR (xorig));
571 else
572 return SCM_BOOL_T;
573 }
574
575
576 SCM_SYNTAX (s_or, "or", scm_makmmacro, scm_m_or);
577 SCM_GLOBAL_SYMBOL (scm_sym_or, s_or);
578
579 SCM
580 scm_m_or (SCM xorig, SCM env SCM_UNUSED)
581 {
582 long len = scm_ilength (SCM_CDR (xorig));
583 SCM_ASSYNT (len >= 0, scm_s_test, s_or);
584 if (len >= 1)
585 return scm_cons (SCM_IM_OR, SCM_CDR (xorig));
586 else
587 return SCM_BOOL_F;
588 }
589
590
591 SCM_SYNTAX (s_case, "case", scm_makmmacro, scm_m_case);
592 SCM_GLOBAL_SYMBOL (scm_sym_case, s_case);
593
594 SCM
595 scm_m_case (SCM xorig, SCM env SCM_UNUSED)
596 {
597 SCM clauses;
598 SCM cdrx = SCM_CDR (xorig);
599 SCM_ASSYNT (scm_ilength (cdrx) >= 2, scm_s_clauses, s_case);
600 clauses = SCM_CDR (cdrx);
601 while (!SCM_NULLP (clauses))
602 {
603 SCM clause = SCM_CAR (clauses);
604 SCM_ASSYNT (scm_ilength (clause) >= 2, scm_s_clauses, s_case);
605 SCM_ASSYNT (scm_ilength (SCM_CAR (clause)) >= 0
606 || (SCM_EQ_P (scm_sym_else, SCM_CAR (clause))
607 && SCM_NULLP (SCM_CDR (clauses))),
608 scm_s_clauses, s_case);
609 clauses = SCM_CDR (clauses);
610 }
611 return scm_cons (SCM_IM_CASE, cdrx);
612 }
613
614
615 SCM_SYNTAX (s_cond, "cond", scm_makmmacro, scm_m_cond);
616 SCM_GLOBAL_SYMBOL (scm_sym_cond, s_cond);
617
618 SCM
619 scm_m_cond (SCM xorig, SCM env SCM_UNUSED)
620 {
621 SCM cdrx = SCM_CDR (xorig);
622 SCM clauses = cdrx;
623 SCM_ASSYNT (scm_ilength (clauses) >= 1, scm_s_clauses, s_cond);
624 while (!SCM_NULLP (clauses))
625 {
626 SCM clause = SCM_CAR (clauses);
627 long len = scm_ilength (clause);
628 SCM_ASSYNT (len >= 1, scm_s_clauses, s_cond);
629 if (SCM_EQ_P (scm_sym_else, SCM_CAR (clause)))
630 {
631 int last_clause_p = SCM_NULLP (SCM_CDR (clauses));
632 SCM_ASSYNT (len >= 2 && last_clause_p, "bad ELSE clause", s_cond);
633 }
634 else if (len >= 2 && SCM_EQ_P (scm_sym_arrow, SCM_CADR (clause)))
635 {
636 SCM_ASSYNT (len > 2, "missing recipient", s_cond);
637 SCM_ASSYNT (len == 3, "bad recipient", s_cond);
638 }
639 clauses = SCM_CDR (clauses);
640 }
641 return scm_cons (SCM_IM_COND, cdrx);
642 }
643
644
645 SCM_SYNTAX (s_lambda, "lambda", scm_makmmacro, scm_m_lambda);
646 SCM_GLOBAL_SYMBOL (scm_sym_lambda, s_lambda);
647
648 /* Return true if OBJ is `eq?' to one of the elements of LIST or to the
649 * cdr of the last cons. (Thus, LIST is not required to be a proper
650 * list and OBJ can also be found in the improper ending.) */
651 static int
652 scm_c_improper_memq (SCM obj, SCM list)
653 {
654 for (; SCM_CONSP (list); list = SCM_CDR (list))
655 {
656 if (SCM_EQ_P (SCM_CAR (list), obj))
657 return 1;
658 }
659 return SCM_EQ_P (list, obj);
660 }
661
662 SCM
663 scm_m_lambda (SCM xorig, SCM env SCM_UNUSED)
664 {
665 SCM formals;
666 SCM x = SCM_CDR (xorig);
667
668 SCM_ASSYNT (SCM_CONSP (x), scm_s_formals, s_lambda);
669
670 formals = SCM_CAR (x);
671 while (SCM_CONSP (formals))
672 {
673 SCM formal = SCM_CAR (formals);
674 SCM_ASSYNT (SCM_SYMBOLP (formal), scm_s_formals, s_lambda);
675 if (scm_c_improper_memq (formal, SCM_CDR (formals)))
676 scm_misc_error (s_lambda, scm_s_duplicate_formals, SCM_EOL);
677 formals = SCM_CDR (formals);
678 }
679 if (!SCM_NULLP (formals) && !SCM_SYMBOLP (formals))
680 scm_misc_error (s_lambda, scm_s_formals, SCM_EOL);
681
682 return scm_cons2 (SCM_IM_LAMBDA, SCM_CAR (x),
683 scm_m_body (SCM_IM_LAMBDA, SCM_CDR (x), s_lambda));
684 }
685
686
687 SCM_SYNTAX (s_letstar, "let*", scm_makmmacro, scm_m_letstar);
688 SCM_GLOBAL_SYMBOL (scm_sym_letstar, s_letstar);
689
690 /* (let* ((v1 i1) (v2 i2) ...) body) with variables v1 .. vk and initializers
691 * i1 .. ik is transformed into the form (#@let* (v1 i1 v2 i2 ...) body*). */
692 SCM
693 scm_m_letstar (SCM xorig, SCM env SCM_UNUSED)
694 {
695 SCM bindings;
696 SCM x = SCM_CDR (xorig);
697 SCM vars = SCM_EOL;
698 SCM *varloc = &vars;
699
700 SCM_ASSYNT (SCM_CONSP (x), scm_s_bindings, s_letstar);
701
702 bindings = SCM_CAR (x);
703 SCM_ASSYNT (scm_ilength (bindings) >= 0, scm_s_bindings, s_letstar);
704 while (!SCM_NULLP (bindings))
705 {
706 SCM binding = SCM_CAR (bindings);
707 SCM_ASSYNT (scm_ilength (binding) == 2, scm_s_bindings, s_letstar);
708 SCM_ASSYNT (SCM_SYMBOLP (SCM_CAR (binding)), scm_s_variable, s_letstar);
709 *varloc = scm_list_2 (SCM_CAR (binding), SCM_CADR (binding));
710 varloc = SCM_CDRLOC (SCM_CDR (*varloc));
711 bindings = SCM_CDR (bindings);
712 }
713
714 return scm_cons2 (SCM_IM_LETSTAR, vars,
715 scm_m_body (SCM_IM_LETSTAR, SCM_CDR (x), s_letstar));
716 }
717
718
719 /* DO gets the most radically altered syntax. The order of the vars is
720 * reversed here. In contrast, the order of the inits and steps is reversed
721 * during the evaluation:
722
723 (do ((<var1> <init1> <step1>)
724 (<var2> <init2>)
725 ... )
726 (<test> <return>)
727 <body>)
728
729 ;; becomes
730
731 (#@do (varn ... var2 var1)
732 (<init1> <init2> ... <initn>)
733 (<test> <return>)
734 (<body>)
735 <step1> <step2> ... <stepn>) ;; missing steps replaced by var
736 */
737
738 SCM_SYNTAX(s_do, "do", scm_makmmacro, scm_m_do);
739 SCM_GLOBAL_SYMBOL(scm_sym_do, s_do);
740
741 SCM
742 scm_m_do (SCM xorig, SCM env SCM_UNUSED)
743 {
744 SCM bindings;
745 SCM x = SCM_CDR (xorig);
746 SCM vars = SCM_EOL;
747 SCM inits = SCM_EOL;
748 SCM *initloc = &inits;
749 SCM steps = SCM_EOL;
750 SCM *steploc = &steps;
751 SCM_ASSYNT (scm_ilength (x) >= 2, scm_s_test, "do");
752 bindings = SCM_CAR (x);
753 SCM_ASSYNT (scm_ilength (bindings) >= 0, scm_s_bindings, "do");
754 while (!SCM_NULLP (bindings))
755 {
756 SCM binding = SCM_CAR (bindings);
757 long len = scm_ilength (binding);
758 SCM_ASSYNT (len == 2 || len == 3, scm_s_bindings, "do");
759 {
760 SCM name = SCM_CAR (binding);
761 SCM init = SCM_CADR (binding);
762 SCM step = (len == 2) ? name : SCM_CADDR (binding);
763 SCM_ASSYNT (SCM_SYMBOLP (name), scm_s_variable, "do");
764 vars = scm_cons (name, vars);
765 *initloc = scm_list_1 (init);
766 initloc = SCM_CDRLOC (*initloc);
767 *steploc = scm_list_1 (step);
768 steploc = SCM_CDRLOC (*steploc);
769 bindings = SCM_CDR (bindings);
770 }
771 }
772 x = SCM_CDR (x);
773 SCM_ASSYNT (scm_ilength (SCM_CAR (x)) >= 1, scm_s_test, "do");
774 x = scm_cons2 (SCM_CAR (x), SCM_CDR (x), steps);
775 x = scm_cons2 (vars, inits, x);
776 return scm_cons (SCM_IM_DO, x);
777 }
778
779
780 SCM_SYNTAX (s_quasiquote, "quasiquote", scm_makacro, scm_m_quasiquote);
781 SCM_GLOBAL_SYMBOL (scm_sym_quasiquote, s_quasiquote);
782
783 /* Internal function to handle a quasiquotation: 'form' is the parameter in
784 * the call (quasiquotation form), 'env' is the environment where unquoted
785 * expressions will be evaluated, and 'depth' is the current quasiquotation
786 * nesting level and is known to be greater than zero. */
787 static SCM
788 iqq (SCM form, SCM env, unsigned long int depth)
789 {
790 if (SCM_CONSP (form))
791 {
792 SCM tmp = SCM_CAR (form);
793 if (SCM_EQ_P (tmp, scm_sym_quasiquote))
794 {
795 SCM args = SCM_CDR (form);
796 SCM_ASSYNT (scm_ilength (args) == 1, scm_s_expression, s_quasiquote);
797 return scm_list_2 (tmp, iqq (SCM_CAR (args), env, depth + 1));
798 }
799 else if (SCM_EQ_P (tmp, scm_sym_unquote))
800 {
801 SCM args = SCM_CDR (form);
802 SCM_ASSYNT (scm_ilength (args) == 1, scm_s_expression, s_quasiquote);
803 if (depth - 1 == 0)
804 return scm_eval_car (args, env);
805 else
806 return scm_list_2 (tmp, iqq (SCM_CAR (args), env, depth - 1));
807 }
808 else if (SCM_CONSP (tmp)
809 && SCM_EQ_P (SCM_CAR (tmp), scm_sym_uq_splicing))
810 {
811 SCM args = SCM_CDR (tmp);
812 SCM_ASSYNT (scm_ilength (args) == 1, scm_s_expression, s_quasiquote);
813 if (depth - 1 == 0)
814 {
815 SCM list = scm_eval_car (args, env);
816 SCM rest = SCM_CDR (form);
817 SCM_ASSYNT (scm_ilength (list) >= 0, s_splicing, s_quasiquote);
818 return scm_append (scm_list_2 (list, iqq (rest, env, depth)));
819 }
820 else
821 return scm_cons (iqq (SCM_CAR (form), env, depth - 1),
822 iqq (SCM_CDR (form), env, depth));
823 }
824 else
825 return scm_cons (iqq (SCM_CAR (form), env, depth),
826 iqq (SCM_CDR (form), env, depth));
827 }
828 else if (SCM_VECTORP (form))
829 {
830 size_t i = SCM_VECTOR_LENGTH (form);
831 SCM *data = SCM_VELTS (form);
832 SCM tmp = SCM_EOL;
833 while (i != 0)
834 tmp = scm_cons (data[--i], tmp);
835 scm_remember_upto_here_1 (form);
836 return scm_vector (iqq (tmp, env, depth));
837 }
838 else
839 return form;
840 }
841
842 SCM
843 scm_m_quasiquote (SCM xorig, SCM env)
844 {
845 SCM x = SCM_CDR (xorig);
846 SCM_ASSYNT (scm_ilength (x) == 1, scm_s_expression, s_quasiquote);
847 return iqq (SCM_CAR (x), env, 1);
848 }
849
850
851 SCM_SYNTAX (s_delay, "delay", scm_makmmacro, scm_m_delay);
852 SCM_GLOBAL_SYMBOL (scm_sym_delay, s_delay);
853
854 /* Promises are implemented as closures with an empty parameter list. Thus,
855 * (delay <expression>) is transformed into (#@delay '() <expression>), where
856 * the empty list represents the empty parameter list. This representation
857 * allows for easy creation of the closure during evaluation. */
858 SCM
859 scm_m_delay (SCM xorig, SCM env SCM_UNUSED)
860 {
861 SCM_ASSYNT (scm_ilength (xorig) == 2, scm_s_expression, s_delay);
862 return scm_cons2 (SCM_IM_DELAY, SCM_EOL, SCM_CDR (xorig));
863 }
864
865
866 SCM_SYNTAX(s_define, "define", scm_makmmacro, scm_m_define);
867 SCM_GLOBAL_SYMBOL(scm_sym_define, s_define);
868
869 /* Guile provides an extension to R5RS' define syntax to represent function
870 * currying in a compact way. With this extension, it is allowed to write
871 * (define <nested-variable> <body>), where <nested-variable> has of one of
872 * the forms (<nested-variable> <formals>), (<nested-variable> . <formal>),
873 * (<variable> <formals>) or (<variable> . <formal>). As in R5RS, <formals>
874 * should be either a sequence of zero or more variables, or a sequence of one
875 * or more variables followed by a space-delimited period and another
876 * variable. Each level of argument nesting wraps the <body> within another
877 * lambda expression. For example, the following forms are allowed, each one
878 * followed by an equivalent, more explicit implementation.
879 * Example 1:
880 * (define ((a b . c) . d) <body>) is equivalent to
881 * (define a (lambda (b . c) (lambda d <body>)))
882 * Example 2:
883 * (define (((a) b) c . d) <body>) is equivalent to
884 * (define a (lambda () (lambda (b) (lambda (c . d) <body>))))
885 */
886 /* Dirk:FIXME:: We should provide an implementation for 'define' in the R5RS
887 * module that does not implement this extension. */
888 SCM
889 scm_m_define (SCM x, SCM env)
890 {
891 SCM name;
892 x = SCM_CDR (x);
893 SCM_ASSYNT (scm_ilength (x) >= 2, scm_s_expression, s_define);
894 name = SCM_CAR (x);
895 x = SCM_CDR (x);
896 while (SCM_CONSP (name))
897 {
898 /* This while loop realizes function currying by variable nesting. */
899 SCM formals = SCM_CDR (name);
900 x = scm_list_1 (scm_cons2 (scm_sym_lambda, formals, x));
901 name = SCM_CAR (name);
902 }
903 SCM_ASSYNT (SCM_SYMBOLP (name), scm_s_variable, s_define);
904 SCM_ASSYNT (scm_ilength (x) == 1, scm_s_expression, s_define);
905 if (SCM_TOP_LEVEL (env))
906 {
907 SCM var;
908 x = scm_eval_car (x, env);
909 if (SCM_REC_PROCNAMES_P)
910 {
911 SCM tmp = x;
912 while (SCM_MACROP (tmp))
913 tmp = SCM_MACRO_CODE (tmp);
914 if (SCM_CLOSUREP (tmp)
915 /* Only the first definition determines the name. */
916 && SCM_FALSEP (scm_procedure_property (tmp, scm_sym_name)))
917 scm_set_procedure_property_x (tmp, scm_sym_name, name);
918 }
919 var = scm_sym2var (name, scm_env_top_level (env), SCM_BOOL_T);
920 SCM_VARIABLE_SET (var, x);
921 return SCM_UNSPECIFIED;
922 }
923 else
924 return scm_cons2 (SCM_IM_DEFINE, name, x);
925 }
926
927
928 /* The bindings ((v1 i1) (v2 i2) ... (vn in)) are transformed to the lists
929 * (vn ... v2 v1) and (i1 i2 ... in). That is, the list of variables is
930 * reversed here, the list of inits gets reversed during evaluation. */
931 static void
932 transform_bindings (SCM bindings, SCM *rvarloc, SCM *initloc, const char *what)
933 {
934 SCM rvars = SCM_EOL;
935 *rvarloc = SCM_EOL;
936 *initloc = SCM_EOL;
937
938 SCM_ASSYNT (scm_ilength (bindings) >= 1, scm_s_bindings, what);
939
940 do
941 {
942 SCM binding = SCM_CAR (bindings);
943 SCM_ASSYNT (scm_ilength (binding) == 2, scm_s_bindings, what);
944 SCM_ASSYNT (SCM_SYMBOLP (SCM_CAR (binding)), scm_s_variable, what);
945 if (scm_c_improper_memq (SCM_CAR (binding), rvars))
946 scm_misc_error (what, scm_s_duplicate_bindings, SCM_EOL);
947 rvars = scm_cons (SCM_CAR (binding), rvars);
948 *initloc = scm_list_1 (SCM_CADR (binding));
949 initloc = SCM_CDRLOC (*initloc);
950 bindings = SCM_CDR (bindings);
951 }
952 while (!SCM_NULLP (bindings));
953
954 *rvarloc = rvars;
955 }
956
957
958 SCM_SYNTAX(s_letrec, "letrec", scm_makmmacro, scm_m_letrec);
959 SCM_GLOBAL_SYMBOL(scm_sym_letrec, s_letrec);
960
961 SCM
962 scm_m_letrec (SCM xorig, SCM env)
963 {
964 SCM x = SCM_CDR (xorig);
965 SCM_ASSYNT (SCM_CONSP (x), scm_s_bindings, s_letrec);
966
967 if (SCM_NULLP (SCM_CAR (x)))
968 {
969 /* null binding, let* faster */
970 SCM body = scm_m_body (SCM_IM_LETREC, SCM_CDR (x), s_letrec);
971 return scm_m_letstar (scm_cons2 (SCM_CAR (xorig), SCM_EOL, body), env);
972 }
973 else
974 {
975 SCM rvars, inits, body;
976 transform_bindings (SCM_CAR (x), &rvars, &inits, "letrec");
977 body = scm_m_body (SCM_IM_LETREC, SCM_CDR (x), "letrec");
978 return scm_cons2 (SCM_IM_LETREC, rvars, scm_cons (inits, body));
979 }
980 }
981
982
983 SCM_SYNTAX(s_let, "let", scm_makmmacro, scm_m_let);
984 SCM_GLOBAL_SYMBOL(scm_sym_let, s_let);
985
986 SCM
987 scm_m_let (SCM xorig, SCM env)
988 {
989 SCM x = SCM_CDR (xorig);
990 SCM temp;
991
992 SCM_ASSYNT (SCM_CONSP (x), scm_s_bindings, s_let);
993 temp = SCM_CAR (x);
994 if (SCM_NULLP (temp)
995 || (scm_ilength (temp) == 1 && SCM_CONSP (SCM_CAR (temp))))
996 {
997 /* null or single binding, let* is faster */
998 SCM bindings = temp;
999 SCM body = scm_m_body (SCM_IM_LET, SCM_CDR (x), s_let);
1000 return scm_m_letstar (scm_cons2 (SCM_CAR (xorig), bindings, body), env);
1001 }
1002 else if (SCM_CONSP (temp))
1003 {
1004 /* plain let */
1005 SCM bindings = temp;
1006 SCM rvars, inits, body;
1007 transform_bindings (bindings, &rvars, &inits, "let");
1008 body = scm_m_body (SCM_IM_LET, SCM_CDR (x), "let");
1009 return scm_cons2 (SCM_IM_LET, rvars, scm_cons (inits, body));
1010 }
1011 else
1012 {
1013 /* named let: Transform (let name ((var init) ...) body ...) into
1014 * ((letrec ((name (lambda (var ...) body ...))) name) init ...) */
1015
1016 SCM name = temp;
1017 SCM vars = SCM_EOL;
1018 SCM *varloc = &vars;
1019 SCM inits = SCM_EOL;
1020 SCM *initloc = &inits;
1021 SCM bindings;
1022
1023 SCM_ASSYNT (SCM_SYMBOLP (name), scm_s_bindings, s_let);
1024 x = SCM_CDR (x);
1025 SCM_ASSYNT (SCM_CONSP (x), scm_s_bindings, s_let);
1026 bindings = SCM_CAR (x);
1027 SCM_ASSYNT (scm_ilength (bindings) >= 0, scm_s_bindings, s_let);
1028 while (!SCM_NULLP (bindings))
1029 { /* vars and inits both in order */
1030 SCM binding = SCM_CAR (bindings);
1031 SCM_ASSYNT (scm_ilength (binding) == 2, scm_s_bindings, s_let);
1032 SCM_ASSYNT (SCM_SYMBOLP (SCM_CAR (binding)), scm_s_variable, s_let);
1033 *varloc = scm_list_1 (SCM_CAR (binding));
1034 varloc = SCM_CDRLOC (*varloc);
1035 *initloc = scm_list_1 (SCM_CADR (binding));
1036 initloc = SCM_CDRLOC (*initloc);
1037 bindings = SCM_CDR (bindings);
1038 }
1039
1040 {
1041 SCM lambda_body = scm_m_body (SCM_IM_LET, SCM_CDR (x), "let");
1042 SCM lambda_form = scm_cons2 (scm_sym_lambda, vars, lambda_body);
1043 SCM rvar = scm_list_1 (name);
1044 SCM init = scm_list_1 (lambda_form);
1045 SCM body = scm_m_body (SCM_IM_LET, scm_list_1 (name), "let");
1046 SCM letrec = scm_cons2 (SCM_IM_LETREC, rvar, scm_cons (init, body));
1047 return scm_cons (letrec, inits);
1048 }
1049 }
1050 }
1051
1052
1053 SCM_SYNTAX (s_atapply,"@apply", scm_makmmacro, scm_m_apply);
1054 SCM_GLOBAL_SYMBOL (scm_sym_atapply, s_atapply);
1055 SCM_GLOBAL_SYMBOL (scm_sym_apply, s_atapply + 1);
1056
1057 SCM
1058 scm_m_apply (SCM xorig, SCM env SCM_UNUSED)
1059 {
1060 SCM_ASSYNT (scm_ilength (SCM_CDR (xorig)) == 2, scm_s_expression, s_atapply);
1061 return scm_cons (SCM_IM_APPLY, SCM_CDR (xorig));
1062 }
1063
1064
1065 SCM_SYNTAX(s_atcall_cc,"@call-with-current-continuation", scm_makmmacro, scm_m_cont);
1066 SCM_GLOBAL_SYMBOL(scm_sym_atcall_cc,s_atcall_cc);
1067
1068
1069 SCM
1070 scm_m_cont (SCM xorig, SCM env SCM_UNUSED)
1071 {
1072 SCM_ASSYNT (scm_ilength (SCM_CDR (xorig)) == 1,
1073 scm_s_expression, s_atcall_cc);
1074 return scm_cons (SCM_IM_CONT, SCM_CDR (xorig));
1075 }
1076
1077 #ifdef SCM_ENABLE_ELISP
1078
1079 SCM_SYNTAX (s_nil_cond, "nil-cond", scm_makmmacro, scm_m_nil_cond);
1080
1081 SCM
1082 scm_m_nil_cond (SCM xorig, SCM env SCM_UNUSED)
1083 {
1084 long len = scm_ilength (SCM_CDR (xorig));
1085 SCM_ASSYNT (len >= 1 && (len & 1) == 1, scm_s_expression, "nil-cond");
1086 return scm_cons (SCM_IM_NIL_COND, SCM_CDR (xorig));
1087 }
1088
1089 SCM_SYNTAX (s_atfop, "@fop", scm_makmmacro, scm_m_atfop);
1090
1091 SCM
1092 scm_m_atfop (SCM xorig, SCM env SCM_UNUSED)
1093 {
1094 SCM x = SCM_CDR (xorig), var;
1095 SCM_ASSYNT (scm_ilength (x) >= 1, scm_s_expression, "@fop");
1096 var = scm_symbol_fref (SCM_CAR (x));
1097 /* Passing the symbol name as the `subr' arg here isn't really
1098 right, but without it it can be very difficult to work out from
1099 the error message which function definition was missing. In any
1100 case, we shouldn't really use SCM_ASSYNT here at all, but instead
1101 something equivalent to (signal void-function (list SYM)) in
1102 Elisp. */
1103 SCM_ASSYNT (SCM_VARIABLEP (var),
1104 "Symbol's function definition is void",
1105 SCM_SYMBOL_CHARS (SCM_CAR (x)));
1106 /* Support `defalias'. */
1107 while (SCM_SYMBOLP (SCM_VARIABLE_REF (var)))
1108 {
1109 var = scm_symbol_fref (SCM_VARIABLE_REF (var));
1110 SCM_ASSYNT (SCM_VARIABLEP (var),
1111 "Symbol's function definition is void",
1112 SCM_SYMBOL_CHARS (SCM_CAR (x)));
1113 }
1114 /* Use `var' here rather than `SCM_VARIABLE_REF (var)' because the
1115 former allows for automatically picking up redefinitions of the
1116 corresponding symbol. */
1117 SCM_SETCAR (x, var);
1118 /* If the variable contains a procedure, leave the
1119 `transformer-macro' in place so that the procedure's arguments
1120 get properly transformed, and change the initial @fop to
1121 SCM_IM_APPLY. */
1122 if (!SCM_MACROP (SCM_VARIABLE_REF (var)))
1123 {
1124 SCM_SETCAR (xorig, SCM_IM_APPLY);
1125 return xorig;
1126 }
1127 /* Otherwise (the variable contains a macro), the arguments should
1128 not be transformed, so cut the `transformer-macro' out and return
1129 the resulting expression starting with the variable. */
1130 SCM_SETCDR (x, SCM_CDADR (x));
1131 return x;
1132 }
1133
1134 #endif /* SCM_ENABLE_ELISP */
1135
1136 /* (@bind ((var exp) ...) body ...)
1137
1138 This will assign the values of the `exp's to the global variables
1139 named by `var's (symbols, not evaluated), creating them if they
1140 don't exist, executes body, and then restores the previous values of
1141 the `var's. Additionally, whenever control leaves body, the values
1142 of the `var's are saved and restored when control returns. It is an
1143 error when a symbol appears more than once among the `var's.
1144 All `exp's are evaluated before any `var' is set.
1145
1146 Think of this as `let' for dynamic scope.
1147
1148 It is memoized into (#@bind ((var ...) . (reversed-val ...)) body ...).
1149
1150 XXX - also implement `@bind*'.
1151 */
1152
1153 SCM_SYNTAX (s_atbind, "@bind", scm_makmmacro, scm_m_atbind);
1154
1155 SCM
1156 scm_m_atbind (SCM xorig, SCM env)
1157 {
1158 SCM x = SCM_CDR (xorig);
1159 SCM top_level = scm_env_top_level (env);
1160 SCM vars = SCM_EOL, var;
1161 SCM exps = SCM_EOL;
1162
1163 SCM_ASSYNT (scm_ilength (x) > 1, scm_s_expression, s_atbind);
1164
1165 x = SCM_CAR (x);
1166 while (SCM_NIMP (x))
1167 {
1168 SCM rest;
1169 SCM sym_exp = SCM_CAR (x);
1170 SCM_ASSYNT (scm_ilength (sym_exp) == 2, scm_s_bindings, s_atbind);
1171 SCM_ASSYNT (SCM_SYMBOLP (SCM_CAR (sym_exp)), scm_s_bindings, s_atbind);
1172 x = SCM_CDR (x);
1173 for (rest = x; SCM_NIMP (rest); rest = SCM_CDR (rest))
1174 if (SCM_EQ_P (SCM_CAR (sym_exp), SCM_CAAR (rest)))
1175 scm_misc_error (s_atbind, scm_s_duplicate_bindings, SCM_EOL);
1176 /* The first call to scm_sym2var will look beyond the current
1177 module, while the second call wont. */
1178 var = scm_sym2var (SCM_CAR (sym_exp), top_level, SCM_BOOL_F);
1179 if (SCM_FALSEP (var))
1180 var = scm_sym2var (SCM_CAR (sym_exp), top_level, SCM_BOOL_T);
1181 vars = scm_cons (var, vars);
1182 exps = scm_cons (SCM_CADR (sym_exp), exps);
1183 }
1184 return scm_cons (SCM_IM_BIND,
1185 scm_cons (scm_cons (scm_reverse_x (vars, SCM_EOL), exps),
1186 SCM_CDDR (xorig)));
1187 }
1188
1189 SCM_SYNTAX (s_at_call_with_values, "@call-with-values", scm_makmmacro, scm_m_at_call_with_values);
1190 SCM_GLOBAL_SYMBOL(scm_sym_at_call_with_values, s_at_call_with_values);
1191
1192 SCM
1193 scm_m_at_call_with_values (SCM xorig, SCM env SCM_UNUSED)
1194 {
1195 SCM_ASSYNT (scm_ilength (SCM_CDR (xorig)) == 2,
1196 scm_s_expression, s_at_call_with_values);
1197 return scm_cons (SCM_IM_CALL_WITH_VALUES, SCM_CDR (xorig));
1198 }
1199
1200 SCM
1201 scm_m_expand_body (SCM xorig, SCM env)
1202 {
1203 SCM x = SCM_CDR (xorig), defs = SCM_EOL;
1204 char *what = SCM_ISYMCHARS (SCM_CAR (xorig)) + 2;
1205
1206 while (SCM_NIMP (x))
1207 {
1208 SCM form = SCM_CAR (x);
1209 if (!SCM_CONSP (form))
1210 break;
1211 if (!SCM_SYMBOLP (SCM_CAR (form)))
1212 break;
1213
1214 form = scm_macroexp (scm_cons_source (form,
1215 SCM_CAR (form),
1216 SCM_CDR (form)),
1217 env);
1218
1219 if (SCM_EQ_P (SCM_IM_DEFINE, SCM_CAR (form)))
1220 {
1221 defs = scm_cons (SCM_CDR (form), defs);
1222 x = SCM_CDR (x);
1223 }
1224 else if (!SCM_IMP (defs))
1225 {
1226 break;
1227 }
1228 else if (SCM_EQ_P (SCM_IM_BEGIN, SCM_CAR (form)))
1229 {
1230 x = scm_append (scm_list_2 (SCM_CDR (form), SCM_CDR (x)));
1231 }
1232 else
1233 {
1234 x = scm_cons (form, SCM_CDR (x));
1235 break;
1236 }
1237 }
1238
1239 if (!SCM_NULLP (defs))
1240 {
1241 SCM rvars, inits, body, letrec;
1242 transform_bindings (defs, &rvars, &inits, what);
1243 body = scm_m_body (SCM_IM_DEFINE, x, what);
1244 letrec = scm_cons2 (SCM_IM_LETREC, rvars, scm_cons (inits, body));
1245 SCM_SETCAR (xorig, letrec);
1246 SCM_SETCDR (xorig, SCM_EOL);
1247 }
1248 else
1249 {
1250 SCM_ASSYNT (SCM_CONSP (x), scm_s_body, what);
1251 SCM_SETCAR (xorig, SCM_CAR (x));
1252 SCM_SETCDR (xorig, SCM_CDR (x));
1253 }
1254
1255 return xorig;
1256 }
1257
1258 SCM
1259 scm_macroexp (SCM x, SCM env)
1260 {
1261 SCM res, proc, orig_sym;
1262
1263 /* Don't bother to produce error messages here. We get them when we
1264 eventually execute the code for real. */
1265
1266 macro_tail:
1267 orig_sym = SCM_CAR (x);
1268 if (!SCM_SYMBOLP (orig_sym))
1269 return x;
1270
1271 #ifdef USE_THREADS
1272 {
1273 SCM *proc_ptr = scm_lookupcar1 (x, env, 0);
1274 if (proc_ptr == NULL)
1275 {
1276 /* We have lost the race. */
1277 goto macro_tail;
1278 }
1279 proc = *proc_ptr;
1280 }
1281 #else
1282 proc = *scm_lookupcar (x, env, 0);
1283 #endif
1284
1285 /* Only handle memoizing macros. `Acros' and `macros' are really
1286 special forms and should not be evaluated here. */
1287
1288 if (!SCM_MACROP (proc) || SCM_MACRO_TYPE (proc) != 2)
1289 return x;
1290
1291 SCM_SETCAR (x, orig_sym); /* Undo memoizing effect of lookupcar */
1292 res = scm_call_2 (SCM_MACRO_CODE (proc), x, env);
1293
1294 if (scm_ilength (res) <= 0)
1295 res = scm_list_2 (SCM_IM_BEGIN, res);
1296
1297 SCM_DEFER_INTS;
1298 SCM_SETCAR (x, SCM_CAR (res));
1299 SCM_SETCDR (x, SCM_CDR (res));
1300 SCM_ALLOW_INTS;
1301
1302 goto macro_tail;
1303 }
1304
1305 /* scm_unmemocopy takes a memoized expression together with its
1306 * environment and rewrites it to its original form. Thus, it is the
1307 * inversion of the rewrite rules above. The procedure is not
1308 * optimized for speed. It's used in scm_iprin1 when printing the
1309 * code of a closure, in scm_procedure_source, in display_frame when
1310 * generating the source for a stackframe in a backtrace, and in
1311 * display_expression.
1312 *
1313 * Unmemoizing is not a reliable process. You cannot in general
1314 * expect to get the original source back.
1315 *
1316 * However, GOOPS currently relies on this for method compilation.
1317 * This ought to change.
1318 */
1319
1320 #define SCM_BIT8(x) (127 & SCM_UNPACK (x))
1321
1322 static SCM
1323 build_binding_list (SCM names, SCM inits)
1324 {
1325 SCM bindings = SCM_EOL;
1326 while (!SCM_NULLP (names))
1327 {
1328 SCM binding = scm_list_2 (SCM_CAR (names), SCM_CAR (inits));
1329 bindings = scm_cons (binding, bindings);
1330 names = SCM_CDR (names);
1331 inits = SCM_CDR (inits);
1332 }
1333 return bindings;
1334 }
1335
1336 static SCM
1337 unmemocopy (SCM x, SCM env)
1338 {
1339 SCM ls, z;
1340 #ifdef DEBUG_EXTENSIONS
1341 SCM p;
1342 #endif
1343 if (!SCM_CONSP (x))
1344 return x;
1345 #ifdef DEBUG_EXTENSIONS
1346 p = scm_whash_lookup (scm_source_whash, x);
1347 #endif
1348 switch (SCM_ITAG7 (SCM_CAR (x)))
1349 {
1350 case SCM_BIT8(SCM_IM_AND):
1351 ls = z = scm_cons (scm_sym_and, SCM_UNSPECIFIED);
1352 break;
1353 case SCM_BIT8(SCM_IM_BEGIN):
1354 ls = z = scm_cons (scm_sym_begin, SCM_UNSPECIFIED);
1355 break;
1356 case SCM_BIT8(SCM_IM_CASE):
1357 ls = z = scm_cons (scm_sym_case, SCM_UNSPECIFIED);
1358 break;
1359 case SCM_BIT8(SCM_IM_COND):
1360 ls = z = scm_cons (scm_sym_cond, SCM_UNSPECIFIED);
1361 break;
1362 case SCM_BIT8 (SCM_IM_DO):
1363 {
1364 /* format: (#@do (nk nk-1 ...) (i1 ... ik) (test) (body) s1 ... sk),
1365 * where nx is the name of a local variable, ix is an initializer for
1366 * the local variable, test is the test clause of the do loop, body is
1367 * the body of the do loop and sx are the step clauses for the local
1368 * variables. */
1369 SCM names, inits, test, memoized_body, steps, bindings;
1370
1371 x = SCM_CDR (x);
1372 names = SCM_CAR (x);
1373 x = SCM_CDR (x);
1374 inits = scm_reverse (unmemocopy (SCM_CAR (x), env));
1375 env = EXTEND_ENV (names, SCM_EOL, env);
1376 x = SCM_CDR (x);
1377 test = unmemocopy (SCM_CAR (x), env);
1378 x = SCM_CDR (x);
1379 memoized_body = SCM_CAR (x);
1380 x = SCM_CDR (x);
1381 steps = scm_reverse (unmemocopy (x, env));
1382
1383 /* build transformed binding list */
1384 bindings = SCM_EOL;
1385 while (!SCM_NULLP (names))
1386 {
1387 SCM name = SCM_CAR (names);
1388 SCM init = SCM_CAR (inits);
1389 SCM step = SCM_CAR (steps);
1390 step = SCM_EQ_P (step, name) ? SCM_EOL : scm_list_1 (step);
1391
1392 bindings = scm_cons (scm_cons2 (name, init, step), bindings);
1393
1394 names = SCM_CDR (names);
1395 inits = SCM_CDR (inits);
1396 steps = SCM_CDR (steps);
1397 }
1398 z = scm_cons (test, SCM_UNSPECIFIED);
1399 ls = scm_cons2 (scm_sym_do, bindings, z);
1400
1401 x = scm_cons (SCM_BOOL_F, memoized_body);
1402 break;
1403 }
1404 case SCM_BIT8(SCM_IM_IF):
1405 ls = z = scm_cons (scm_sym_if, SCM_UNSPECIFIED);
1406 break;
1407 case SCM_BIT8 (SCM_IM_LET):
1408 {
1409 /* format: (#@let (nk nk-1 ...) (i1 ... ik) b1 ...),
1410 * where nx is the name of a local variable, ix is an initializer for
1411 * the local variable and by are the body clauses. */
1412 SCM names, inits, bindings;
1413
1414 x = SCM_CDR (x);
1415 names = SCM_CAR (x);
1416 x = SCM_CDR (x);
1417 inits = scm_reverse (unmemocopy (SCM_CAR (x), env));
1418 env = EXTEND_ENV (names, SCM_EOL, env);
1419
1420 bindings = build_binding_list (names, inits);
1421 z = scm_cons (bindings, SCM_UNSPECIFIED);
1422 ls = scm_cons (scm_sym_let, z);
1423 break;
1424 }
1425 case SCM_BIT8 (SCM_IM_LETREC):
1426 {
1427 /* format: (#@letrec (nk nk-1 ...) (i1 ... ik) b1 ...),
1428 * where nx is the name of a local variable, ix is an initializer for
1429 * the local variable and by are the body clauses. */
1430 SCM names, inits, bindings;
1431
1432 x = SCM_CDR (x);
1433 names = SCM_CAR (x);
1434 env = EXTEND_ENV (names, SCM_EOL, env);
1435 x = SCM_CDR (x);
1436 inits = scm_reverse (unmemocopy (SCM_CAR (x), env));
1437
1438 bindings = build_binding_list (names, inits);
1439 z = scm_cons (bindings, SCM_UNSPECIFIED);
1440 ls = scm_cons (scm_sym_letrec, z);
1441 break;
1442 }
1443 case SCM_BIT8(SCM_IM_LETSTAR):
1444 {
1445 SCM b, y;
1446 x = SCM_CDR (x);
1447 b = SCM_CAR (x);
1448 y = SCM_EOL;
1449 if SCM_IMP (b)
1450 {
1451 env = EXTEND_ENV (SCM_EOL, SCM_EOL, env);
1452 goto letstar;
1453 }
1454 y = z = scm_acons (SCM_CAR (b),
1455 unmemocar (
1456 scm_cons (unmemocopy (SCM_CADR (b), env), SCM_EOL), env),
1457 SCM_UNSPECIFIED);
1458 env = EXTEND_ENV (SCM_CAR (b), SCM_BOOL_F, env);
1459 b = SCM_CDDR (b);
1460 if (SCM_IMP (b))
1461 {
1462 SCM_SETCDR (y, SCM_EOL);
1463 ls = scm_cons (scm_sym_let, z = scm_cons (y, SCM_UNSPECIFIED));
1464 break;
1465 }
1466 do
1467 {
1468 SCM_SETCDR (z, scm_acons (SCM_CAR (b),
1469 unmemocar (
1470 scm_list_1 (unmemocopy (SCM_CADR (b), env)), env),
1471 SCM_UNSPECIFIED));
1472 z = SCM_CDR (z);
1473 env = EXTEND_ENV (SCM_CAR (b), SCM_BOOL_F, env);
1474 b = SCM_CDDR (b);
1475 }
1476 while (SCM_NIMP (b));
1477 SCM_SETCDR (z, SCM_EOL);
1478 letstar:
1479 ls = scm_cons (scm_sym_letstar, z = scm_cons (y, SCM_UNSPECIFIED));
1480 break;
1481 }
1482 case SCM_BIT8(SCM_IM_OR):
1483 ls = z = scm_cons (scm_sym_or, SCM_UNSPECIFIED);
1484 break;
1485 case SCM_BIT8(SCM_IM_LAMBDA):
1486 x = SCM_CDR (x);
1487 z = scm_cons (SCM_CAR (x), SCM_UNSPECIFIED);
1488 ls = scm_cons (scm_sym_lambda, z);
1489 env = EXTEND_ENV (SCM_CAR (x), SCM_EOL, env);
1490 break;
1491 case SCM_BIT8(SCM_IM_QUOTE):
1492 ls = z = scm_cons (scm_sym_quote, SCM_UNSPECIFIED);
1493 break;
1494 case SCM_BIT8(SCM_IM_SET_X):
1495 ls = z = scm_cons (scm_sym_set_x, SCM_UNSPECIFIED);
1496 break;
1497 case SCM_BIT8(SCM_IM_DEFINE):
1498 {
1499 SCM n;
1500 x = SCM_CDR (x);
1501 n = SCM_CAR (x);
1502 z = scm_cons (n, SCM_UNSPECIFIED);
1503 ls = scm_cons (scm_sym_define, z);
1504 if (!SCM_NULLP (env))
1505 SCM_SETCAR (SCM_CAR (env), scm_cons (n, SCM_CAAR (env)));
1506 break;
1507 }
1508 case SCM_BIT8(SCM_MAKISYM (0)):
1509 z = SCM_CAR (x);
1510 if (!SCM_ISYMP (z))
1511 goto unmemo;
1512 switch (SCM_ISYMNUM (z))
1513 {
1514 case (SCM_ISYMNUM (SCM_IM_APPLY)):
1515 ls = z = scm_cons (scm_sym_atapply, SCM_UNSPECIFIED);
1516 goto loop;
1517 case (SCM_ISYMNUM (SCM_IM_CONT)):
1518 ls = z = scm_cons (scm_sym_atcall_cc, SCM_UNSPECIFIED);
1519 goto loop;
1520 case (SCM_ISYMNUM (SCM_IM_DELAY)):
1521 ls = z = scm_cons (scm_sym_delay, SCM_UNSPECIFIED);
1522 x = SCM_CDR (x);
1523 goto loop;
1524 case (SCM_ISYMNUM (SCM_IM_CALL_WITH_VALUES)):
1525 ls = z = scm_cons (scm_sym_at_call_with_values, SCM_UNSPECIFIED);
1526 goto loop;
1527 default:
1528 /* appease the Sun compiler god: */ ;
1529 }
1530 unmemo:
1531 default:
1532 ls = z = unmemocar (scm_cons (unmemocopy (SCM_CAR (x), env),
1533 SCM_UNSPECIFIED),
1534 env);
1535 }
1536 loop:
1537 x = SCM_CDR (x);
1538 while (SCM_CONSP (x))
1539 {
1540 SCM form = SCM_CAR (x);
1541 if (!SCM_ISYMP (form))
1542 {
1543 SCM copy = scm_cons (unmemocopy (form, env), SCM_UNSPECIFIED);
1544 SCM_SETCDR (z, unmemocar (copy, env));
1545 z = SCM_CDR (z);
1546 }
1547 x = SCM_CDR (x);
1548 }
1549 SCM_SETCDR (z, x);
1550 #ifdef DEBUG_EXTENSIONS
1551 if (!SCM_FALSEP (p))
1552 scm_whash_insert (scm_source_whash, ls, p);
1553 #endif
1554 return ls;
1555 }
1556
1557
1558 SCM
1559 scm_unmemocopy (SCM x, SCM env)
1560 {
1561 if (!SCM_NULLP (env))
1562 /* Make a copy of the lowest frame to protect it from
1563 modifications by SCM_IM_DEFINE */
1564 return unmemocopy (x, scm_cons (SCM_CAR (env), SCM_CDR (env)));
1565 else
1566 return unmemocopy (x, env);
1567 }
1568
1569 #ifndef SCM_RECKLESS
1570
1571 int
1572 scm_badargsp (SCM formals, SCM args)
1573 {
1574 while (SCM_NIMP (formals))
1575 {
1576 if (!SCM_CONSP (formals))
1577 return 0;
1578 if (SCM_IMP(args))
1579 return 1;
1580 formals = SCM_CDR (formals);
1581 args = SCM_CDR (args);
1582 }
1583 return !SCM_NULLP (args) ? 1 : 0;
1584 }
1585
1586 #endif
1587
1588 static int
1589 scm_badformalsp (SCM closure, int n)
1590 {
1591 SCM formals = SCM_CLOSURE_FORMALS (closure);
1592 while (!SCM_NULLP (formals))
1593 {
1594 if (!SCM_CONSP (formals))
1595 return 0;
1596 if (n == 0)
1597 return 1;
1598 --n;
1599 formals = SCM_CDR (formals);
1600 }
1601 return n;
1602 }
1603
1604 \f
1605 SCM
1606 scm_eval_args (SCM l, SCM env, SCM proc)
1607 {
1608 SCM results = SCM_EOL, *lloc = &results, res;
1609 while (SCM_CONSP (l))
1610 {
1611 res = EVALCAR (l, env);
1612
1613 *lloc = scm_list_1 (res);
1614 lloc = SCM_CDRLOC (*lloc);
1615 l = SCM_CDR (l);
1616 }
1617 #ifdef SCM_CAUTIOUS
1618 if (!SCM_NULLP (l))
1619 scm_wrong_num_args (proc);
1620 #endif
1621 return results;
1622 }
1623
1624 SCM
1625 scm_eval_body (SCM code, SCM env)
1626 {
1627 SCM next;
1628 again:
1629 next = SCM_CDR (code);
1630 while (!SCM_NULLP (next))
1631 {
1632 if (SCM_IMP (SCM_CAR (code)))
1633 {
1634 if (SCM_ISYMP (SCM_CAR (code)))
1635 {
1636 code = scm_m_expand_body (code, env);
1637 goto again;
1638 }
1639 }
1640 else
1641 SCM_XEVAL (SCM_CAR (code), env);
1642 code = next;
1643 next = SCM_CDR (code);
1644 }
1645 return SCM_XEVALCAR (code, env);
1646 }
1647
1648
1649 #endif /* !DEVAL */
1650
1651
1652 /* SECTION: This code is specific for the debugging support. One
1653 * branch is read when DEVAL isn't defined, the other when DEVAL is
1654 * defined.
1655 */
1656
1657 #ifndef DEVAL
1658
1659 #define SCM_APPLY scm_apply
1660 #define PREP_APPLY(proc, args)
1661 #define ENTER_APPLY
1662 #define RETURN(x) do { return x; } while (0)
1663 #ifdef STACK_CHECKING
1664 #ifndef NO_CEVAL_STACK_CHECKING
1665 #define EVAL_STACK_CHECKING
1666 #endif
1667 #endif
1668
1669 #else /* !DEVAL */
1670
1671 #undef SCM_CEVAL
1672 #define SCM_CEVAL scm_deval /* Substitute all uses of scm_ceval */
1673 #undef SCM_APPLY
1674 #define SCM_APPLY scm_dapply
1675 #undef PREP_APPLY
1676 #define PREP_APPLY(p, l) \
1677 { ++debug.info; debug.info->a.proc = p; debug.info->a.args = l; }
1678 #undef ENTER_APPLY
1679 #define ENTER_APPLY \
1680 do { \
1681 SCM_SET_ARGSREADY (debug);\
1682 if (CHECK_APPLY && SCM_TRAPS_P)\
1683 if (SCM_APPLY_FRAME_P || (SCM_TRACE_P && PROCTRACEP (proc)))\
1684 {\
1685 SCM tmp, tail = SCM_BOOL(SCM_TRACED_FRAME_P (debug)); \
1686 SCM_SET_TRACED_FRAME (debug); \
1687 SCM_TRAPS_P = 0;\
1688 if (SCM_CHEAPTRAPS_P)\
1689 {\
1690 tmp = scm_make_debugobj (&debug);\
1691 scm_call_3 (SCM_APPLY_FRAME_HDLR, scm_sym_apply_frame, tmp, tail);\
1692 }\
1693 else\
1694 {\
1695 int first;\
1696 tmp = scm_make_continuation (&first);\
1697 if (first)\
1698 scm_call_3 (SCM_APPLY_FRAME_HDLR, scm_sym_apply_frame, tmp, tail);\
1699 }\
1700 SCM_TRAPS_P = 1;\
1701 }\
1702 } while (0)
1703 #undef RETURN
1704 #define RETURN(e) do { proc = (e); goto exit; } while (0)
1705 #ifdef STACK_CHECKING
1706 #ifndef EVAL_STACK_CHECKING
1707 #define EVAL_STACK_CHECKING
1708 #endif
1709 #endif
1710
1711 /* scm_ceval_ptr points to the currently selected evaluator.
1712 * *fixme*: Although efficiency is important here, this state variable
1713 * should probably not be a global. It should be related to the
1714 * current repl.
1715 */
1716
1717
1718 SCM (*scm_ceval_ptr) (SCM x, SCM env);
1719
1720 /* scm_last_debug_frame contains a pointer to the last debugging
1721 * information stack frame. It is accessed very often from the
1722 * debugging evaluator, so it should probably not be indirectly
1723 * addressed. Better to save and restore it from the current root at
1724 * any stack swaps.
1725 */
1726
1727 #ifndef USE_THREADS
1728 scm_t_debug_frame *scm_last_debug_frame;
1729 #endif
1730
1731 /* scm_debug_eframe_size is the number of slots available for pseudo
1732 * stack frames at each real stack frame.
1733 */
1734
1735 long scm_debug_eframe_size;
1736
1737 int scm_debug_mode, scm_check_entry_p, scm_check_apply_p, scm_check_exit_p;
1738
1739 long scm_eval_stack;
1740
1741 scm_t_option scm_eval_opts[] = {
1742 { SCM_OPTION_INTEGER, "stack", 22000, "Size of thread stacks (in machine words)." }
1743 };
1744
1745 scm_t_option scm_debug_opts[] = {
1746 { SCM_OPTION_BOOLEAN, "cheap", 1,
1747 "*Flyweight representation of the stack at traps." },
1748 { SCM_OPTION_BOOLEAN, "breakpoints", 0, "*Check for breakpoints." },
1749 { SCM_OPTION_BOOLEAN, "trace", 0, "*Trace mode." },
1750 { SCM_OPTION_BOOLEAN, "procnames", 1,
1751 "Record procedure names at definition." },
1752 { SCM_OPTION_BOOLEAN, "backwards", 0,
1753 "Display backtrace in anti-chronological order." },
1754 { SCM_OPTION_INTEGER, "width", 79, "Maximal width of backtrace." },
1755 { SCM_OPTION_INTEGER, "indent", 10, "Maximal indentation in backtrace." },
1756 { SCM_OPTION_INTEGER, "frames", 3,
1757 "Maximum number of tail-recursive frames in backtrace." },
1758 { SCM_OPTION_INTEGER, "maxdepth", 1000,
1759 "Maximal number of stored backtrace frames." },
1760 { SCM_OPTION_INTEGER, "depth", 20, "Maximal length of printed backtrace." },
1761 { SCM_OPTION_BOOLEAN, "backtrace", 0, "Show backtrace on error." },
1762 { SCM_OPTION_BOOLEAN, "debug", 0, "Use the debugging evaluator." },
1763 { SCM_OPTION_INTEGER, "stack", 20000, "Stack size limit (measured in words; 0 = no check)." },
1764 { SCM_OPTION_SCM, "show-file-name", (unsigned long)SCM_BOOL_T, "Show file names and line numbers in backtraces when not `#f'. A value of `base' displays only base names, while `#t' displays full names."}
1765 };
1766
1767 scm_t_option scm_evaluator_trap_table[] = {
1768 { SCM_OPTION_BOOLEAN, "traps", 0, "Enable evaluator traps." },
1769 { SCM_OPTION_BOOLEAN, "enter-frame", 0, "Trap when eval enters new frame." },
1770 { SCM_OPTION_BOOLEAN, "apply-frame", 0, "Trap when entering apply." },
1771 { SCM_OPTION_BOOLEAN, "exit-frame", 0, "Trap when exiting eval or apply." },
1772 { SCM_OPTION_SCM, "enter-frame-handler", (unsigned long)SCM_BOOL_F, "Handler for enter-frame traps." },
1773 { SCM_OPTION_SCM, "apply-frame-handler", (unsigned long)SCM_BOOL_F, "Handler for apply-frame traps." },
1774 { SCM_OPTION_SCM, "exit-frame-handler", (unsigned long)SCM_BOOL_F, "Handler for exit-frame traps." }
1775 };
1776
1777 SCM_DEFINE (scm_eval_options_interface, "eval-options-interface", 0, 1, 0,
1778 (SCM setting),
1779 "Option interface for the evaluation options. Instead of using\n"
1780 "this procedure directly, use the procedures @code{eval-enable},\n"
1781 "@code{eval-disable}, @code{eval-set!} and @var{eval-options}.")
1782 #define FUNC_NAME s_scm_eval_options_interface
1783 {
1784 SCM ans;
1785 SCM_DEFER_INTS;
1786 ans = scm_options (setting,
1787 scm_eval_opts,
1788 SCM_N_EVAL_OPTIONS,
1789 FUNC_NAME);
1790 scm_eval_stack = SCM_EVAL_STACK * sizeof (void *);
1791 SCM_ALLOW_INTS;
1792 return ans;
1793 }
1794 #undef FUNC_NAME
1795
1796 SCM_DEFINE (scm_evaluator_traps, "evaluator-traps-interface", 0, 1, 0,
1797 (SCM setting),
1798 "Option interface for the evaluator trap options.")
1799 #define FUNC_NAME s_scm_evaluator_traps
1800 {
1801 SCM ans;
1802 SCM_DEFER_INTS;
1803 ans = scm_options (setting,
1804 scm_evaluator_trap_table,
1805 SCM_N_EVALUATOR_TRAPS,
1806 FUNC_NAME);
1807 SCM_RESET_DEBUG_MODE;
1808 SCM_ALLOW_INTS;
1809 return ans;
1810 }
1811 #undef FUNC_NAME
1812
1813 static SCM
1814 deval_args (SCM l, SCM env, SCM proc, SCM *lloc)
1815 {
1816 SCM *results = lloc, res;
1817 while (SCM_CONSP (l))
1818 {
1819 res = EVALCAR (l, env);
1820
1821 *lloc = scm_list_1 (res);
1822 lloc = SCM_CDRLOC (*lloc);
1823 l = SCM_CDR (l);
1824 }
1825 #ifdef SCM_CAUTIOUS
1826 if (!SCM_NULLP (l))
1827 scm_wrong_num_args (proc);
1828 #endif
1829 return *results;
1830 }
1831
1832 #endif /* !DEVAL */
1833
1834
1835 /* SECTION: This code is compiled twice.
1836 */
1837
1838
1839 /* Update the toplevel environment frame ENV so that it refers to the
1840 * current module. */
1841 #define UPDATE_TOPLEVEL_ENV(env) \
1842 do { \
1843 SCM p = scm_current_module_lookup_closure (); \
1844 if (p != SCM_CAR(env)) \
1845 env = scm_top_level_env (p); \
1846 } while (0)
1847
1848 #ifndef DEVAL
1849 #define CHECK_EQVISH(A,B) (SCM_EQ_P ((A), (B)) || (!SCM_FALSEP (scm_eqv_p ((A), (B)))))
1850 #endif /* DEVAL */
1851
1852 /* This is the evaluator. Like any real monster, it has three heads:
1853 *
1854 * scm_ceval is the non-debugging evaluator, scm_deval is the debugging
1855 * version. Both are implemented using a common code base, using the
1856 * following mechanism: SCM_CEVAL is a macro, which is either defined to
1857 * scm_ceval or scm_deval. Thus, there is no function SCM_CEVAL, but the code
1858 * for SCM_CEVAL actually compiles to either scm_ceval or scm_deval. When
1859 * SCM_CEVAL is defined to scm_ceval, it is known that the macro DEVAL is not
1860 * defined. When SCM_CEVAL is defined to scm_deval, then the macro DEVAL is
1861 * known to be defined. Thus, in SCM_CEVAL parts for the debugging evaluator
1862 * are enclosed within #ifdef DEVAL ... #endif.
1863 *
1864 * All three (scm_ceval, scm_deval and their common implementation SCM_CEVAL)
1865 * take two input parameters, x and env: x is a single expression to be
1866 * evalutated. env is the environment in which bindings are searched.
1867 *
1868 * x is known to be a cell (i. e. a pair or any other non-immediate). Since x
1869 * is a single expression, it is necessarily in a tail position. If x is just
1870 * a call to another function like in the expression (foo exp1 exp2 ...), the
1871 * realization of that call therefore _must_not_ increase stack usage (the
1872 * evaluation of exp1, exp2 etc., however, may do so). This is realized by
1873 * making extensive use of 'goto' statements within the evaluator: The gotos
1874 * replace recursive calls to SCM_CEVAL, thus re-using the same stack frame
1875 * that SCM_CEVAL was already using. If, however, x represents some form that
1876 * requires to evaluate a sequence of expressions like (begin exp1 exp2 ...),
1877 * then recursive calls to SCM_CEVAL are performed for all but the last
1878 * expression of that sequence. */
1879
1880 #if 0
1881 SCM
1882 scm_ceval (SCM x, SCM env)
1883 {}
1884 #endif
1885
1886 #if 0
1887 SCM
1888 scm_deval (SCM x, SCM env)
1889 {}
1890 #endif
1891
1892 SCM
1893 SCM_CEVAL (SCM x, SCM env)
1894 {
1895 union
1896 {
1897 SCM *lloc;
1898 SCM arg1;
1899 } t;
1900 SCM proc, arg2, orig_sym;
1901 #ifdef DEVAL
1902 scm_t_debug_frame debug;
1903 scm_t_debug_info *debug_info_end;
1904 debug.prev = scm_last_debug_frame;
1905 debug.status = scm_debug_eframe_size;
1906 /*
1907 * The debug.vect contains twice as much scm_t_debug_info frames as the
1908 * user has specified with (debug-set! frames <n>).
1909 *
1910 * Even frames are eval frames, odd frames are apply frames.
1911 */
1912 debug.vect = (scm_t_debug_info *) alloca (scm_debug_eframe_size
1913 * sizeof (scm_t_debug_info));
1914 debug.info = debug.vect;
1915 debug_info_end = debug.vect + scm_debug_eframe_size;
1916 scm_last_debug_frame = &debug;
1917 #endif
1918 #ifdef EVAL_STACK_CHECKING
1919 if (scm_stack_checking_enabled_p
1920 && SCM_STACK_OVERFLOW_P ((SCM_STACKITEM *) &proc))
1921 {
1922 #ifdef DEVAL
1923 debug.info->e.exp = x;
1924 debug.info->e.env = env;
1925 #endif
1926 scm_report_stack_overflow ();
1927 }
1928 #endif
1929 #ifdef DEVAL
1930 goto start;
1931 #endif
1932 loopnoap:
1933 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
1934 loop:
1935 #ifdef DEVAL
1936 SCM_CLEAR_ARGSREADY (debug);
1937 if (SCM_OVERFLOWP (debug))
1938 --debug.info;
1939 /*
1940 * In theory, this should be the only place where it is necessary to
1941 * check for space in debug.vect since both eval frames and
1942 * available space are even.
1943 *
1944 * For this to be the case, however, it is necessary that primitive
1945 * special forms which jump back to `loop', `begin' or some similar
1946 * label call PREP_APPLY. A convenient way to do this is to jump to
1947 * `loopnoap' or `cdrxnoap'.
1948 */
1949 else if (++debug.info >= debug_info_end)
1950 {
1951 SCM_SET_OVERFLOW (debug);
1952 debug.info -= 2;
1953 }
1954 start:
1955 debug.info->e.exp = x;
1956 debug.info->e.env = env;
1957 if (CHECK_ENTRY && SCM_TRAPS_P)
1958 if (SCM_ENTER_FRAME_P || (SCM_BREAKPOINTS_P && SRCBRKP (x)))
1959 {
1960 SCM tail = SCM_BOOL(SCM_TAILRECP (debug));
1961 SCM_SET_TAILREC (debug);
1962 if (SCM_CHEAPTRAPS_P)
1963 t.arg1 = scm_make_debugobj (&debug);
1964 else
1965 {
1966 int first;
1967 SCM val = scm_make_continuation (&first);
1968
1969 if (first)
1970 t.arg1 = val;
1971 else
1972 {
1973 x = val;
1974 if (SCM_IMP (x))
1975 RETURN (x);
1976 else
1977 /* This gives the possibility for the debugger to
1978 modify the source expression before evaluation. */
1979 goto dispatch;
1980 }
1981 }
1982 SCM_TRAPS_P = 0;
1983 scm_call_4 (SCM_ENTER_FRAME_HDLR,
1984 scm_sym_enter_frame,
1985 t.arg1,
1986 tail,
1987 scm_unmemocopy (x, env));
1988 SCM_TRAPS_P = 1;
1989 }
1990 #endif
1991 #if defined (USE_THREADS) || defined (DEVAL)
1992 dispatch:
1993 #endif
1994 SCM_TICK;
1995 switch (SCM_TYP7 (x))
1996 {
1997 case scm_tc7_symbol:
1998 /* Only happens when called at top level. */
1999 x = scm_cons (x, SCM_UNDEFINED);
2000 RETURN (*scm_lookupcar (x, env, 1));
2001
2002 case SCM_BIT8(SCM_IM_AND):
2003 x = SCM_CDR (x);
2004 while (!SCM_NULLP (SCM_CDR (x)))
2005 {
2006 if (SCM_FALSEP (t.arg1 = EVALCAR (x, env)) || SCM_NILP (t.arg1))
2007 RETURN (SCM_BOOL_F);
2008 else
2009 x = SCM_CDR (x);
2010 }
2011 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
2012 goto carloop;
2013
2014 case SCM_BIT8(SCM_IM_BEGIN):
2015 if (SCM_NULLP (SCM_CDR (x)))
2016 RETURN (SCM_UNSPECIFIED);
2017
2018 /* (currently unused)
2019 cdrxnoap: */
2020 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
2021 /* (currently unused)
2022 cdrxbegin: */
2023 x = SCM_CDR (x);
2024
2025 begin:
2026 /* If we are on toplevel with a lookup closure, we need to sync
2027 with the current module. */
2028 if (SCM_CONSP (env) && !SCM_CONSP (SCM_CAR (env)))
2029 {
2030 UPDATE_TOPLEVEL_ENV (env);
2031 while (!SCM_NULLP (SCM_CDR (x)))
2032 {
2033 EVALCAR (x, env);
2034 UPDATE_TOPLEVEL_ENV (env);
2035 x = SCM_CDR (x);
2036 }
2037 goto carloop;
2038 }
2039 else
2040 goto nontoplevel_begin;
2041
2042 nontoplevel_cdrxnoap:
2043 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
2044 nontoplevel_cdrxbegin:
2045 x = SCM_CDR (x);
2046 nontoplevel_begin:
2047 while (!SCM_NULLP (SCM_CDR (x)))
2048 {
2049 if (SCM_IMP (SCM_CAR (x)))
2050 {
2051 if (SCM_ISYMP (SCM_CAR (x)))
2052 {
2053 x = scm_m_expand_body (x, env);
2054 goto nontoplevel_begin;
2055 }
2056 else
2057 SCM_VALIDATE_NON_EMPTY_COMBINATION (SCM_CAR (x));
2058 }
2059 else
2060 SCM_CEVAL (SCM_CAR (x), env);
2061 x = SCM_CDR (x);
2062 }
2063
2064 carloop: /* scm_eval car of last form in list */
2065 if (SCM_IMP (SCM_CAR (x)))
2066 {
2067 x = SCM_CAR (x);
2068 RETURN (SCM_EVALIM (x, env));
2069 }
2070
2071 if (SCM_SYMBOLP (SCM_CAR (x)))
2072 RETURN (*scm_lookupcar (x, env, 1));
2073
2074 x = SCM_CAR (x);
2075 goto loop; /* tail recurse */
2076
2077
2078 case SCM_BIT8(SCM_IM_CASE):
2079 x = SCM_CDR (x);
2080 t.arg1 = EVALCAR (x, env);
2081 while (SCM_NIMP (x = SCM_CDR (x)))
2082 {
2083 proc = SCM_CAR (x);
2084 if (SCM_EQ_P (scm_sym_else, SCM_CAR (proc)))
2085 {
2086 x = SCM_CDR (proc);
2087 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
2088 goto begin;
2089 }
2090 proc = SCM_CAR (proc);
2091 while (SCM_NIMP (proc))
2092 {
2093 if (CHECK_EQVISH (SCM_CAR (proc), t.arg1))
2094 {
2095 x = SCM_CDAR (x);
2096 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
2097 goto begin;
2098 }
2099 proc = SCM_CDR (proc);
2100 }
2101 }
2102 RETURN (SCM_UNSPECIFIED);
2103
2104
2105 case SCM_BIT8 (SCM_IM_COND):
2106 x = SCM_CDR (x);
2107 while (!SCM_NULLP (x))
2108 {
2109 proc = SCM_CAR (x);
2110 if (SCM_EQ_P (SCM_CAR (proc), scm_sym_else))
2111 {
2112 x = SCM_CDR (proc);
2113 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
2114 goto begin;
2115 }
2116 t.arg1 = EVALCAR (proc, env);
2117 if (!SCM_FALSEP (t.arg1) && !SCM_NILP (t.arg1))
2118 {
2119 x = SCM_CDR (proc);
2120 if (SCM_NULLP (x))
2121 RETURN (t.arg1);
2122 if (!SCM_EQ_P (scm_sym_arrow, SCM_CAR (x)))
2123 {
2124 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
2125 goto begin;
2126 }
2127 proc = SCM_CDR (x);
2128 proc = EVALCAR (proc, env);
2129 SCM_ASRTGO (SCM_NIMP (proc), badfun);
2130 PREP_APPLY (proc, scm_list_1 (t.arg1));
2131 ENTER_APPLY;
2132 if (SCM_CLOSUREP(proc) && scm_badformalsp (proc, 1))
2133 goto umwrongnumargs;
2134 goto evap1;
2135 }
2136 x = SCM_CDR (x);
2137 }
2138 RETURN (SCM_UNSPECIFIED);
2139
2140
2141 case SCM_BIT8(SCM_IM_DO):
2142 x = SCM_CDR (x);
2143 proc = SCM_CADR (x); /* inits */
2144 t.arg1 = SCM_EOL; /* values */
2145 while (SCM_NIMP (proc))
2146 {
2147 t.arg1 = scm_cons (EVALCAR (proc, env), t.arg1);
2148 proc = SCM_CDR (proc);
2149 }
2150 env = EXTEND_ENV (SCM_CAR (x), t.arg1, env);
2151 x = SCM_CDDR (x);
2152 while (proc = SCM_CAR (x),
2153 SCM_FALSEP (t.arg1 = EVALCAR (proc, env)) || SCM_NILP (t.arg1))
2154 {
2155 for (proc = SCM_CADR (x); SCM_NIMP (proc); proc = SCM_CDR (proc))
2156 {
2157 t.arg1 = SCM_CAR (proc); /* body */
2158 SIDEVAL (t.arg1, env);
2159 }
2160 for (t.arg1 = SCM_EOL, proc = SCM_CDDR (x);
2161 SCM_NIMP (proc);
2162 proc = SCM_CDR (proc))
2163 t.arg1 = scm_cons (EVALCAR (proc, env), t.arg1); /* steps */
2164 env = EXTEND_ENV (SCM_CAAR (env), t.arg1, SCM_CDR (env));
2165 }
2166 x = SCM_CDR (proc);
2167 if (SCM_NULLP (x))
2168 RETURN (SCM_UNSPECIFIED);
2169 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
2170 goto nontoplevel_begin;
2171
2172
2173 case SCM_BIT8(SCM_IM_IF):
2174 x = SCM_CDR (x);
2175 if (!SCM_FALSEP (t.arg1 = EVALCAR (x, env)) && !SCM_NILP (t.arg1))
2176 x = SCM_CDR (x);
2177 else if (SCM_IMP (x = SCM_CDDR (x)))
2178 RETURN (SCM_UNSPECIFIED);
2179 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
2180 goto carloop;
2181
2182
2183 case SCM_BIT8(SCM_IM_LET):
2184 x = SCM_CDR (x);
2185 proc = SCM_CADR (x);
2186 t.arg1 = SCM_EOL;
2187 do
2188 {
2189 t.arg1 = scm_cons (EVALCAR (proc, env), t.arg1);
2190 }
2191 while (SCM_NIMP (proc = SCM_CDR (proc)));
2192 env = EXTEND_ENV (SCM_CAR (x), t.arg1, env);
2193 x = SCM_CDR (x);
2194 goto nontoplevel_cdrxnoap;
2195
2196
2197 case SCM_BIT8(SCM_IM_LETREC):
2198 x = SCM_CDR (x);
2199 env = EXTEND_ENV (SCM_CAR (x), scm_undefineds, env);
2200 x = SCM_CDR (x);
2201 proc = SCM_CAR (x);
2202 t.arg1 = SCM_EOL;
2203 do
2204 {
2205 t.arg1 = scm_cons (EVALCAR (proc, env), t.arg1);
2206 }
2207 while (SCM_NIMP (proc = SCM_CDR (proc)));
2208 SCM_SETCDR (SCM_CAR (env), t.arg1);
2209 goto nontoplevel_cdrxnoap;
2210
2211
2212 case SCM_BIT8(SCM_IM_LETSTAR):
2213 x = SCM_CDR (x);
2214 {
2215 SCM bindings = SCM_CAR (x);
2216 if (SCM_NULLP (bindings))
2217 env = EXTEND_ENV (SCM_EOL, SCM_EOL, env);
2218 else
2219 {
2220 do
2221 {
2222 SCM name = SCM_CAR (bindings);
2223 SCM init = SCM_CDR (bindings);
2224 env = EXTEND_ENV (name, EVALCAR (init, env), env);
2225 bindings = SCM_CDR (init);
2226 }
2227 while (!SCM_NULLP (bindings));
2228 }
2229 }
2230 goto nontoplevel_cdrxnoap;
2231
2232
2233 case SCM_BIT8(SCM_IM_OR):
2234 x = SCM_CDR (x);
2235 while (!SCM_NULLP (SCM_CDR (x)))
2236 {
2237 SCM val = EVALCAR (x, env);
2238 if (!SCM_FALSEP (val) && !SCM_NILP (val))
2239 RETURN (val);
2240 else
2241 x = SCM_CDR (x);
2242 }
2243 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
2244 goto carloop;
2245
2246
2247 case SCM_BIT8(SCM_IM_LAMBDA):
2248 RETURN (scm_closure (SCM_CDR (x), env));
2249
2250
2251 case SCM_BIT8(SCM_IM_QUOTE):
2252 RETURN (SCM_CADR (x));
2253
2254
2255 case SCM_BIT8(SCM_IM_SET_X):
2256 x = SCM_CDR (x);
2257 proc = SCM_CAR (x);
2258 switch (SCM_ITAG3 (proc))
2259 {
2260 case scm_tc3_cons:
2261 if (SCM_VARIABLEP (proc))
2262 t.lloc = SCM_VARIABLE_LOC (proc);
2263 else
2264 t.lloc = scm_lookupcar (x, env, 1);
2265 break;
2266 #ifdef MEMOIZE_LOCALS
2267 case scm_tc3_imm24:
2268 t.lloc = scm_ilookup (proc, env);
2269 break;
2270 #endif
2271 }
2272 x = SCM_CDR (x);
2273 *t.lloc = EVALCAR (x, env);
2274 #ifdef SICP
2275 RETURN (*t.lloc);
2276 #else
2277 RETURN (SCM_UNSPECIFIED);
2278 #endif
2279
2280
2281 case SCM_BIT8(SCM_IM_DEFINE): /* only for internal defines */
2282 scm_misc_error (NULL, "Bad define placement", SCM_EOL);
2283
2284 /* new syntactic forms go here. */
2285 case SCM_BIT8(SCM_MAKISYM (0)):
2286 proc = SCM_CAR (x);
2287 SCM_ASRTGO (SCM_ISYMP (proc), badfun);
2288 switch (SCM_ISYMNUM (proc))
2289 {
2290 case (SCM_ISYMNUM (SCM_IM_APPLY)):
2291 proc = SCM_CDR (x);
2292 proc = EVALCAR (proc, env);
2293 SCM_ASRTGO (SCM_NIMP (proc), badfun);
2294 if (SCM_CLOSUREP (proc))
2295 {
2296 SCM argl, tl;
2297 PREP_APPLY (proc, SCM_EOL);
2298 t.arg1 = SCM_CDDR (x);
2299 t.arg1 = EVALCAR (t.arg1, env);
2300 apply_closure:
2301 /* Go here to tail-call a closure. PROC is the closure
2302 and T.ARG1 is the list of arguments. Do not forget to
2303 call PREP_APPLY. */
2304 #ifdef DEVAL
2305 debug.info->a.args = t.arg1;
2306 #endif
2307 #ifndef SCM_RECKLESS
2308 if (scm_badargsp (SCM_CLOSURE_FORMALS (proc), t.arg1))
2309 goto wrongnumargs;
2310 #endif
2311 ENTER_APPLY;
2312 /* Copy argument list */
2313 if (SCM_IMP (t.arg1))
2314 argl = t.arg1;
2315 else
2316 {
2317 argl = tl = scm_cons (SCM_CAR (t.arg1), SCM_UNSPECIFIED);
2318 while (SCM_NIMP (t.arg1 = SCM_CDR (t.arg1))
2319 && SCM_CONSP (t.arg1))
2320 {
2321 SCM_SETCDR (tl, scm_cons (SCM_CAR (t.arg1),
2322 SCM_UNSPECIFIED));
2323 tl = SCM_CDR (tl);
2324 }
2325 SCM_SETCDR (tl, t.arg1);
2326 }
2327
2328 env = EXTEND_ENV (SCM_CLOSURE_FORMALS (proc), argl, SCM_ENV (proc));
2329 x = SCM_CLOSURE_BODY (proc);
2330 goto nontoplevel_begin;
2331 }
2332 proc = scm_f_apply;
2333 goto evapply;
2334
2335 case (SCM_ISYMNUM (SCM_IM_CONT)):
2336 {
2337 int first;
2338 SCM val = scm_make_continuation (&first);
2339
2340 if (first)
2341 t.arg1 = val;
2342 else
2343 RETURN (val);
2344 }
2345 proc = SCM_CDR (x);
2346 proc = scm_eval_car (proc, env);
2347 SCM_ASRTGO (SCM_NIMP (proc), badfun);
2348 PREP_APPLY (proc, scm_list_1 (t.arg1));
2349 ENTER_APPLY;
2350 if (SCM_CLOSUREP(proc) && scm_badformalsp (proc, 1))
2351 goto umwrongnumargs;
2352 goto evap1;
2353
2354 case (SCM_ISYMNUM (SCM_IM_DELAY)):
2355 RETURN (scm_makprom (scm_closure (SCM_CDR (x), env)));
2356
2357 case (SCM_ISYMNUM (SCM_IM_DISPATCH)):
2358 proc = SCM_CADR (x); /* unevaluated operands */
2359 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
2360 if (SCM_IMP (proc))
2361 arg2 = *scm_ilookup (proc, env);
2362 else if (!SCM_CONSP (proc))
2363 {
2364 if (SCM_VARIABLEP (proc))
2365 arg2 = SCM_VARIABLE_REF (proc);
2366 else
2367 arg2 = *scm_lookupcar (SCM_CDR (x), env, 1);
2368 }
2369 else
2370 {
2371 arg2 = scm_list_1 (EVALCAR (proc, env));
2372 t.lloc = SCM_CDRLOC (arg2);
2373 while (SCM_NIMP (proc = SCM_CDR (proc)))
2374 {
2375 *t.lloc = scm_list_1 (EVALCAR (proc, env));
2376 t.lloc = SCM_CDRLOC (*t.lloc);
2377 }
2378 }
2379
2380 type_dispatch:
2381 /* The type dispatch code is duplicated here
2382 * (c.f. objects.c:scm_mcache_compute_cmethod) since that
2383 * cuts down execution time for type dispatch to 50%.
2384 */
2385 {
2386 long i, n, end, mask;
2387 SCM z = SCM_CDDR (x);
2388 n = SCM_INUM (SCM_CAR (z)); /* maximum number of specializers */
2389 proc = SCM_CADR (z);
2390
2391 if (SCM_NIMP (proc))
2392 {
2393 /* Prepare for linear search */
2394 mask = -1;
2395 i = 0;
2396 end = SCM_VECTOR_LENGTH (proc);
2397 }
2398 else
2399 {
2400 /* Compute a hash value */
2401 long hashset = SCM_INUM (proc);
2402 long j = n;
2403 z = SCM_CDDR (z);
2404 mask = SCM_INUM (SCM_CAR (z));
2405 proc = SCM_CADR (z);
2406 i = 0;
2407 t.arg1 = arg2;
2408 if (SCM_NIMP (t.arg1))
2409 do
2410 {
2411 i += SCM_STRUCT_DATA (scm_class_of (SCM_CAR (t.arg1)))
2412 [scm_si_hashsets + hashset];
2413 t.arg1 = SCM_CDR (t.arg1);
2414 }
2415 while (j-- && SCM_NIMP (t.arg1));
2416 i &= mask;
2417 end = i;
2418 }
2419
2420 /* Search for match */
2421 do
2422 {
2423 long j = n;
2424 z = SCM_VELTS (proc)[i];
2425 t.arg1 = arg2; /* list of arguments */
2426 if (SCM_NIMP (t.arg1))
2427 do
2428 {
2429 /* More arguments than specifiers => CLASS != ENV */
2430 if (! SCM_EQ_P (scm_class_of (SCM_CAR (t.arg1)), SCM_CAR (z)))
2431 goto next_method;
2432 t.arg1 = SCM_CDR (t.arg1);
2433 z = SCM_CDR (z);
2434 }
2435 while (j-- && SCM_NIMP (t.arg1));
2436 /* Fewer arguments than specifiers => CAR != ENV */
2437 if (!(SCM_IMP (SCM_CAR (z)) || SCM_CONSP (SCM_CAR (z))))
2438 goto next_method;
2439 apply_cmethod:
2440 env = EXTEND_ENV (SCM_CAR (SCM_CMETHOD_CODE (z)),
2441 arg2,
2442 SCM_CMETHOD_ENV (z));
2443 x = SCM_CMETHOD_CODE (z);
2444 goto nontoplevel_cdrxbegin;
2445 next_method:
2446 i = (i + 1) & mask;
2447 } while (i != end);
2448
2449 z = scm_memoize_method (x, arg2);
2450 goto apply_cmethod;
2451 }
2452
2453 case (SCM_ISYMNUM (SCM_IM_SLOT_REF)):
2454 x = SCM_CDR (x);
2455 t.arg1 = EVALCAR (x, env);
2456 RETURN (SCM_PACK (SCM_STRUCT_DATA (t.arg1) [SCM_INUM (SCM_CADR (x))]));
2457
2458 case (SCM_ISYMNUM (SCM_IM_SLOT_SET_X)):
2459 x = SCM_CDR (x);
2460 t.arg1 = EVALCAR (x, env);
2461 x = SCM_CDR (x);
2462 proc = SCM_CDR (x);
2463 SCM_STRUCT_DATA (t.arg1) [SCM_INUM (SCM_CAR (x))]
2464 = SCM_UNPACK (EVALCAR (proc, env));
2465 RETURN (SCM_UNSPECIFIED);
2466
2467 #ifdef SCM_ENABLE_ELISP
2468
2469 case (SCM_ISYMNUM (SCM_IM_NIL_COND)):
2470 proc = SCM_CDR (x);
2471 while (SCM_NIMP (x = SCM_CDR (proc)))
2472 {
2473 if (!(SCM_FALSEP (t.arg1 = EVALCAR (proc, env))
2474 || SCM_NILP (t.arg1)
2475 || SCM_NULLP (t.arg1)))
2476 {
2477 if (SCM_EQ_P (SCM_CAR (x), SCM_UNSPECIFIED))
2478 RETURN (t.arg1);
2479 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
2480 goto carloop;
2481 }
2482 proc = SCM_CDR (x);
2483 }
2484 x = proc;
2485 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
2486 goto carloop;
2487
2488 #endif /* SCM_ENABLE_ELISP */
2489
2490 case (SCM_ISYMNUM (SCM_IM_BIND)):
2491 {
2492 SCM vars, exps, vals;
2493
2494 x = SCM_CDR (x);
2495 vars = SCM_CAAR (x);
2496 exps = SCM_CDAR (x);
2497
2498 vals = SCM_EOL;
2499
2500 while (SCM_NIMP (exps))
2501 {
2502 vals = scm_cons (EVALCAR (exps, env), vals);
2503 exps = SCM_CDR (exps);
2504 }
2505
2506 scm_swap_bindings (vars, vals);
2507 scm_dynwinds = scm_acons (vars, vals, scm_dynwinds);
2508
2509 arg2 = x = SCM_CDR (x);
2510 while (!SCM_NULLP (arg2 = SCM_CDR (arg2)))
2511 {
2512 SIDEVAL (SCM_CAR (x), env);
2513 x = arg2;
2514 }
2515 proc = EVALCAR (x, env);
2516
2517 scm_dynwinds = SCM_CDR (scm_dynwinds);
2518 scm_swap_bindings (vars, vals);
2519
2520 RETURN (proc);
2521 }
2522
2523 case (SCM_ISYMNUM (SCM_IM_CALL_WITH_VALUES)):
2524 {
2525 proc = SCM_CDR (x);
2526 x = EVALCAR (proc, env);
2527 proc = SCM_CDR (proc);
2528 proc = EVALCAR (proc, env);
2529 t.arg1 = SCM_APPLY (x, SCM_EOL, SCM_EOL);
2530 if (SCM_VALUESP (t.arg1))
2531 t.arg1 = scm_struct_ref (t.arg1, SCM_INUM0);
2532 else
2533 t.arg1 = scm_list_1 (t.arg1);
2534 if (SCM_CLOSUREP (proc))
2535 {
2536 PREP_APPLY (proc, t.arg1);
2537 goto apply_closure;
2538 }
2539 return SCM_APPLY (proc, t.arg1, SCM_EOL);
2540 }
2541
2542 default:
2543 goto badfun;
2544 }
2545
2546 default:
2547 proc = x;
2548 badfun:
2549 scm_misc_error (NULL, "Wrong type to apply: ~S", scm_list_1 (proc));
2550 case scm_tc7_vector:
2551 case scm_tc7_wvect:
2552 #ifdef HAVE_ARRAYS
2553 case scm_tc7_bvect:
2554 case scm_tc7_byvect:
2555 case scm_tc7_svect:
2556 case scm_tc7_ivect:
2557 case scm_tc7_uvect:
2558 case scm_tc7_fvect:
2559 case scm_tc7_dvect:
2560 case scm_tc7_cvect:
2561 #ifdef HAVE_LONG_LONGS
2562 case scm_tc7_llvect:
2563 #endif
2564 #endif
2565 case scm_tc7_string:
2566 case scm_tc7_smob:
2567 case scm_tcs_closures:
2568 case scm_tc7_cclo:
2569 case scm_tc7_pws:
2570 case scm_tcs_subrs:
2571 case scm_tcs_struct:
2572 RETURN (x);
2573
2574 case scm_tc7_variable:
2575 RETURN (SCM_VARIABLE_REF(x));
2576
2577 #ifdef MEMOIZE_LOCALS
2578 case SCM_BIT8(SCM_ILOC00):
2579 proc = *scm_ilookup (SCM_CAR (x), env);
2580 SCM_ASRTGO (SCM_NIMP (proc), badfun);
2581 #ifndef SCM_RECKLESS
2582 #ifdef SCM_CAUTIOUS
2583 goto checkargs;
2584 #endif
2585 #endif
2586 break;
2587 #endif /* ifdef MEMOIZE_LOCALS */
2588
2589 case scm_tcs_cons_nimcar:
2590 orig_sym = SCM_CAR (x);
2591 if (SCM_SYMBOLP (orig_sym))
2592 {
2593 #ifdef USE_THREADS
2594 t.lloc = scm_lookupcar1 (x, env, 1);
2595 if (t.lloc == NULL)
2596 {
2597 /* we have lost the race, start again. */
2598 goto dispatch;
2599 }
2600 proc = *t.lloc;
2601 #else
2602 proc = *scm_lookupcar (x, env, 1);
2603 #endif
2604
2605 if (SCM_IMP (proc))
2606 {
2607 SCM_SETCAR (x, orig_sym); /* Undo memoizing effect of
2608 lookupcar */
2609 goto badfun;
2610 }
2611 if (SCM_MACROP (proc))
2612 {
2613 SCM_SETCAR (x, orig_sym); /* Undo memoizing effect of
2614 lookupcar */
2615 handle_a_macro:
2616 #ifdef DEVAL
2617 /* Set a flag during macro expansion so that macro
2618 application frames can be deleted from the backtrace. */
2619 SCM_SET_MACROEXP (debug);
2620 #endif
2621 t.arg1 = SCM_APPLY (SCM_MACRO_CODE (proc), x,
2622 scm_cons (env, scm_listofnull));
2623
2624 #ifdef DEVAL
2625 SCM_CLEAR_MACROEXP (debug);
2626 #endif
2627 switch (SCM_MACRO_TYPE (proc))
2628 {
2629 case 2:
2630 if (scm_ilength (t.arg1) <= 0)
2631 t.arg1 = scm_list_2 (SCM_IM_BEGIN, t.arg1);
2632 #ifdef DEVAL
2633 if (!SCM_CLOSUREP (SCM_MACRO_CODE (proc)))
2634 {
2635 SCM_DEFER_INTS;
2636 SCM_SETCAR (x, SCM_CAR (t.arg1));
2637 SCM_SETCDR (x, SCM_CDR (t.arg1));
2638 SCM_ALLOW_INTS;
2639 goto dispatch;
2640 }
2641 /* Prevent memoizing of debug info expression. */
2642 debug.info->e.exp = scm_cons_source (debug.info->e.exp,
2643 SCM_CAR (x),
2644 SCM_CDR (x));
2645 #endif
2646 SCM_DEFER_INTS;
2647 SCM_SETCAR (x, SCM_CAR (t.arg1));
2648 SCM_SETCDR (x, SCM_CDR (t.arg1));
2649 SCM_ALLOW_INTS;
2650 goto loopnoap;
2651 case 1:
2652 if (SCM_NIMP (x = t.arg1))
2653 goto loopnoap;
2654 case 0:
2655 RETURN (t.arg1);
2656 }
2657 }
2658 }
2659 else
2660 proc = SCM_CEVAL (SCM_CAR (x), env);
2661 SCM_ASRTGO (!SCM_IMP (proc), badfun);
2662 #ifndef SCM_RECKLESS
2663 #ifdef SCM_CAUTIOUS
2664 checkargs:
2665 #endif
2666 if (SCM_CLOSUREP (proc))
2667 {
2668 arg2 = SCM_CLOSURE_FORMALS (proc);
2669 t.arg1 = SCM_CDR (x);
2670 while (!SCM_NULLP (arg2))
2671 {
2672 if (!SCM_CONSP (arg2))
2673 goto evapply;
2674 if (SCM_IMP (t.arg1))
2675 goto umwrongnumargs;
2676 arg2 = SCM_CDR (arg2);
2677 t.arg1 = SCM_CDR (t.arg1);
2678 }
2679 if (!SCM_NULLP (t.arg1))
2680 goto umwrongnumargs;
2681 }
2682 else if (SCM_MACROP (proc))
2683 goto handle_a_macro;
2684 #endif
2685 }
2686
2687
2688 evapply:
2689 PREP_APPLY (proc, SCM_EOL);
2690 if (SCM_NULLP (SCM_CDR (x))) {
2691 ENTER_APPLY;
2692 evap0:
2693 switch (SCM_TYP7 (proc))
2694 { /* no arguments given */
2695 case scm_tc7_subr_0:
2696 RETURN (SCM_SUBRF (proc) ());
2697 case scm_tc7_subr_1o:
2698 RETURN (SCM_SUBRF (proc) (SCM_UNDEFINED));
2699 case scm_tc7_lsubr:
2700 RETURN (SCM_SUBRF (proc) (SCM_EOL));
2701 case scm_tc7_rpsubr:
2702 RETURN (SCM_BOOL_T);
2703 case scm_tc7_asubr:
2704 RETURN (SCM_SUBRF (proc) (SCM_UNDEFINED, SCM_UNDEFINED));
2705 case scm_tc7_smob:
2706 if (!SCM_SMOB_APPLICABLE_P (proc))
2707 goto badfun;
2708 RETURN (SCM_SMOB_APPLY_0 (proc));
2709 case scm_tc7_cclo:
2710 t.arg1 = proc;
2711 proc = SCM_CCLO_SUBR (proc);
2712 #ifdef DEVAL
2713 debug.info->a.proc = proc;
2714 debug.info->a.args = scm_list_1 (t.arg1);
2715 #endif
2716 goto evap1;
2717 case scm_tc7_pws:
2718 proc = SCM_PROCEDURE (proc);
2719 #ifdef DEVAL
2720 debug.info->a.proc = proc;
2721 #endif
2722 if (!SCM_CLOSUREP (proc))
2723 goto evap0;
2724 if (scm_badformalsp (proc, 0))
2725 goto umwrongnumargs;
2726 case scm_tcs_closures:
2727 x = SCM_CLOSURE_BODY (proc);
2728 env = EXTEND_ENV (SCM_CLOSURE_FORMALS (proc), SCM_EOL, SCM_ENV (proc));
2729 goto nontoplevel_begin;
2730 case scm_tcs_struct:
2731 if (SCM_OBJ_CLASS_FLAGS (proc) & SCM_CLASSF_PURE_GENERIC)
2732 {
2733 x = SCM_ENTITY_PROCEDURE (proc);
2734 arg2 = SCM_EOL;
2735 goto type_dispatch;
2736 }
2737 else if (!SCM_I_OPERATORP (proc))
2738 goto badfun;
2739 else
2740 {
2741 t.arg1 = proc;
2742 proc = (SCM_I_ENTITYP (proc)
2743 ? SCM_ENTITY_PROCEDURE (proc)
2744 : SCM_OPERATOR_PROCEDURE (proc));
2745 #ifdef DEVAL
2746 debug.info->a.proc = proc;
2747 debug.info->a.args = scm_list_1 (t.arg1);
2748 #endif
2749 if (SCM_NIMP (proc))
2750 goto evap1;
2751 else
2752 goto badfun;
2753 }
2754 case scm_tc7_subr_1:
2755 case scm_tc7_subr_2:
2756 case scm_tc7_subr_2o:
2757 case scm_tc7_cxr:
2758 case scm_tc7_subr_3:
2759 case scm_tc7_lsubr_2:
2760 umwrongnumargs:
2761 unmemocar (x, env);
2762 wrongnumargs:
2763 scm_wrong_num_args (proc);
2764 default:
2765 /* handle macros here */
2766 goto badfun;
2767 }
2768 }
2769
2770 /* must handle macros by here */
2771 x = SCM_CDR (x);
2772 #ifdef SCM_CAUTIOUS
2773 if (SCM_IMP (x))
2774 goto wrongnumargs;
2775 else if (SCM_CONSP (x))
2776 {
2777 if (SCM_IMP (SCM_CAR (x)))
2778 t.arg1 = SCM_EVALIM (SCM_CAR (x), env);
2779 else
2780 t.arg1 = EVALCELLCAR (x, env);
2781 }
2782 else
2783 goto wrongnumargs;
2784 #else
2785 t.arg1 = EVALCAR (x, env);
2786 #endif
2787 #ifdef DEVAL
2788 debug.info->a.args = scm_list_1 (t.arg1);
2789 #endif
2790 x = SCM_CDR (x);
2791 if (SCM_NULLP (x))
2792 {
2793 ENTER_APPLY;
2794 evap1:
2795 switch (SCM_TYP7 (proc))
2796 { /* have one argument in t.arg1 */
2797 case scm_tc7_subr_2o:
2798 RETURN (SCM_SUBRF (proc) (t.arg1, SCM_UNDEFINED));
2799 case scm_tc7_subr_1:
2800 case scm_tc7_subr_1o:
2801 RETURN (SCM_SUBRF (proc) (t.arg1));
2802 case scm_tc7_cxr:
2803 if (SCM_SUBRF (proc))
2804 {
2805 if (SCM_INUMP (t.arg1))
2806 {
2807 RETURN (scm_make_real (SCM_DSUBRF (proc) ((double) SCM_INUM (t.arg1))));
2808 }
2809 else if (SCM_REALP (t.arg1))
2810 {
2811 RETURN (scm_make_real (SCM_DSUBRF (proc) (SCM_REAL_VALUE (t.arg1))));
2812 }
2813 #ifdef SCM_BIGDIG
2814 else if (SCM_BIGP (t.arg1))
2815 {
2816 RETURN (scm_make_real (SCM_DSUBRF (proc) (scm_i_big2dbl (t.arg1))));
2817 }
2818 #endif
2819 SCM_WTA_DISPATCH_1 (*SCM_SUBR_GENERIC (proc), t.arg1,
2820 SCM_ARG1, SCM_SYMBOL_CHARS (SCM_SNAME (proc)));
2821 }
2822 proc = SCM_SNAME (proc);
2823 {
2824 char *chrs = SCM_SYMBOL_CHARS (proc) + SCM_SYMBOL_LENGTH (proc) - 1;
2825 while ('c' != *--chrs)
2826 {
2827 SCM_ASSERT (SCM_CONSP (t.arg1),
2828 t.arg1, SCM_ARG1, SCM_SYMBOL_CHARS (proc));
2829 t.arg1 = ('a' == *chrs) ? SCM_CAR (t.arg1) : SCM_CDR (t.arg1);
2830 }
2831 RETURN (t.arg1);
2832 }
2833 case scm_tc7_rpsubr:
2834 RETURN (SCM_BOOL_T);
2835 case scm_tc7_asubr:
2836 RETURN (SCM_SUBRF (proc) (t.arg1, SCM_UNDEFINED));
2837 case scm_tc7_lsubr:
2838 #ifdef DEVAL
2839 RETURN (SCM_SUBRF (proc) (debug.info->a.args));
2840 #else
2841 RETURN (SCM_SUBRF (proc) (scm_list_1 (t.arg1)));
2842 #endif
2843 case scm_tc7_smob:
2844 if (!SCM_SMOB_APPLICABLE_P (proc))
2845 goto badfun;
2846 RETURN (SCM_SMOB_APPLY_1 (proc, t.arg1));
2847 case scm_tc7_cclo:
2848 arg2 = t.arg1;
2849 t.arg1 = proc;
2850 proc = SCM_CCLO_SUBR (proc);
2851 #ifdef DEVAL
2852 debug.info->a.args = scm_cons (t.arg1, debug.info->a.args);
2853 debug.info->a.proc = proc;
2854 #endif
2855 goto evap2;
2856 case scm_tc7_pws:
2857 proc = SCM_PROCEDURE (proc);
2858 #ifdef DEVAL
2859 debug.info->a.proc = proc;
2860 #endif
2861 if (!SCM_CLOSUREP (proc))
2862 goto evap1;
2863 if (scm_badformalsp (proc, 1))
2864 goto umwrongnumargs;
2865 case scm_tcs_closures:
2866 /* clos1: */
2867 x = SCM_CLOSURE_BODY (proc);
2868 #ifdef DEVAL
2869 env = EXTEND_ENV (SCM_CLOSURE_FORMALS (proc), debug.info->a.args, SCM_ENV (proc));
2870 #else
2871 env = EXTEND_ENV (SCM_CLOSURE_FORMALS (proc), scm_list_1 (t.arg1), SCM_ENV (proc));
2872 #endif
2873 goto nontoplevel_begin;
2874 case scm_tcs_struct:
2875 if (SCM_OBJ_CLASS_FLAGS (proc) & SCM_CLASSF_PURE_GENERIC)
2876 {
2877 x = SCM_ENTITY_PROCEDURE (proc);
2878 #ifdef DEVAL
2879 arg2 = debug.info->a.args;
2880 #else
2881 arg2 = scm_list_1 (t.arg1);
2882 #endif
2883 goto type_dispatch;
2884 }
2885 else if (!SCM_I_OPERATORP (proc))
2886 goto badfun;
2887 else
2888 {
2889 arg2 = t.arg1;
2890 t.arg1 = proc;
2891 proc = (SCM_I_ENTITYP (proc)
2892 ? SCM_ENTITY_PROCEDURE (proc)
2893 : SCM_OPERATOR_PROCEDURE (proc));
2894 #ifdef DEVAL
2895 debug.info->a.args = scm_cons (t.arg1, debug.info->a.args);
2896 debug.info->a.proc = proc;
2897 #endif
2898 if (SCM_NIMP (proc))
2899 goto evap2;
2900 else
2901 goto badfun;
2902 }
2903 case scm_tc7_subr_2:
2904 case scm_tc7_subr_0:
2905 case scm_tc7_subr_3:
2906 case scm_tc7_lsubr_2:
2907 goto wrongnumargs;
2908 default:
2909 goto badfun;
2910 }
2911 }
2912 #ifdef SCM_CAUTIOUS
2913 if (SCM_IMP (x))
2914 goto wrongnumargs;
2915 else if (SCM_CONSP (x))
2916 {
2917 if (SCM_IMP (SCM_CAR (x)))
2918 arg2 = SCM_EVALIM (SCM_CAR (x), env);
2919 else
2920 arg2 = EVALCELLCAR (x, env);
2921 }
2922 else
2923 goto wrongnumargs;
2924 #else
2925 arg2 = EVALCAR (x, env);
2926 #endif
2927 { /* have two or more arguments */
2928 #ifdef DEVAL
2929 debug.info->a.args = scm_list_2 (t.arg1, arg2);
2930 #endif
2931 x = SCM_CDR (x);
2932 if (SCM_NULLP (x)) {
2933 ENTER_APPLY;
2934 evap2:
2935 switch (SCM_TYP7 (proc))
2936 { /* have two arguments */
2937 case scm_tc7_subr_2:
2938 case scm_tc7_subr_2o:
2939 RETURN (SCM_SUBRF (proc) (t.arg1, arg2));
2940 case scm_tc7_lsubr:
2941 #ifdef DEVAL
2942 RETURN (SCM_SUBRF (proc) (debug.info->a.args));
2943 #else
2944 RETURN (SCM_SUBRF (proc) (scm_list_2 (t.arg1, arg2)));
2945 #endif
2946 case scm_tc7_lsubr_2:
2947 RETURN (SCM_SUBRF (proc) (t.arg1, arg2, SCM_EOL));
2948 case scm_tc7_rpsubr:
2949 case scm_tc7_asubr:
2950 RETURN (SCM_SUBRF (proc) (t.arg1, arg2));
2951 case scm_tc7_smob:
2952 if (!SCM_SMOB_APPLICABLE_P (proc))
2953 goto badfun;
2954 RETURN (SCM_SMOB_APPLY_2 (proc, t.arg1, arg2));
2955 cclon:
2956 case scm_tc7_cclo:
2957 #ifdef DEVAL
2958 RETURN (SCM_APPLY (SCM_CCLO_SUBR (proc),
2959 scm_cons (proc, debug.info->a.args),
2960 SCM_EOL));
2961 #else
2962 RETURN (SCM_APPLY (SCM_CCLO_SUBR (proc),
2963 scm_cons2 (proc, t.arg1,
2964 scm_cons (arg2,
2965 scm_eval_args (x,
2966 env,
2967 proc))),
2968 SCM_EOL));
2969 #endif
2970 case scm_tcs_struct:
2971 if (SCM_OBJ_CLASS_FLAGS (proc) & SCM_CLASSF_PURE_GENERIC)
2972 {
2973 x = SCM_ENTITY_PROCEDURE (proc);
2974 #ifdef DEVAL
2975 arg2 = debug.info->a.args;
2976 #else
2977 arg2 = scm_list_2 (t.arg1, arg2);
2978 #endif
2979 goto type_dispatch;
2980 }
2981 else if (!SCM_I_OPERATORP (proc))
2982 goto badfun;
2983 else
2984 {
2985 operatorn:
2986 #ifdef DEVAL
2987 RETURN (SCM_APPLY (SCM_I_ENTITYP (proc)
2988 ? SCM_ENTITY_PROCEDURE (proc)
2989 : SCM_OPERATOR_PROCEDURE (proc),
2990 scm_cons (proc, debug.info->a.args),
2991 SCM_EOL));
2992 #else
2993 RETURN (SCM_APPLY (SCM_I_ENTITYP (proc)
2994 ? SCM_ENTITY_PROCEDURE (proc)
2995 : SCM_OPERATOR_PROCEDURE (proc),
2996 scm_cons2 (proc, t.arg1,
2997 scm_cons (arg2,
2998 scm_eval_args (x,
2999 env,
3000 proc))),
3001 SCM_EOL));
3002 #endif
3003 }
3004 case scm_tc7_subr_0:
3005 case scm_tc7_cxr:
3006 case scm_tc7_subr_1o:
3007 case scm_tc7_subr_1:
3008 case scm_tc7_subr_3:
3009 goto wrongnumargs;
3010 default:
3011 goto badfun;
3012 case scm_tc7_pws:
3013 proc = SCM_PROCEDURE (proc);
3014 #ifdef DEVAL
3015 debug.info->a.proc = proc;
3016 #endif
3017 if (!SCM_CLOSUREP (proc))
3018 goto evap2;
3019 if (scm_badformalsp (proc, 2))
3020 goto umwrongnumargs;
3021 case scm_tcs_closures:
3022 /* clos2: */
3023 #ifdef DEVAL
3024 env = EXTEND_ENV (SCM_CLOSURE_FORMALS (proc),
3025 debug.info->a.args,
3026 SCM_ENV (proc));
3027 #else
3028 env = EXTEND_ENV (SCM_CLOSURE_FORMALS (proc),
3029 scm_list_2 (t.arg1, arg2), SCM_ENV (proc));
3030 #endif
3031 x = SCM_CLOSURE_BODY (proc);
3032 goto nontoplevel_begin;
3033 }
3034 }
3035 #ifdef SCM_CAUTIOUS
3036 if (SCM_IMP (x) || !SCM_CONSP (x))
3037 goto wrongnumargs;
3038 #endif
3039 #ifdef DEVAL
3040 debug.info->a.args = scm_cons2 (t.arg1, arg2,
3041 deval_args (x, env, proc, SCM_CDRLOC (SCM_CDR (debug.info->a.args))));
3042 #endif
3043 ENTER_APPLY;
3044 evap3:
3045 switch (SCM_TYP7 (proc))
3046 { /* have 3 or more arguments */
3047 #ifdef DEVAL
3048 case scm_tc7_subr_3:
3049 SCM_ASRTGO (SCM_NULLP (SCM_CDR (x)), wrongnumargs);
3050 RETURN (SCM_SUBRF (proc) (t.arg1, arg2,
3051 SCM_CADDR (debug.info->a.args)));
3052 case scm_tc7_asubr:
3053 #ifdef BUILTIN_RPASUBR
3054 t.arg1 = SCM_SUBRF(proc)(t.arg1, arg2);
3055 arg2 = SCM_CDDR (debug.info->a.args);
3056 do
3057 {
3058 t.arg1 = SCM_SUBRF(proc)(t.arg1, SCM_CAR (arg2));
3059 arg2 = SCM_CDR (arg2);
3060 }
3061 while (SCM_NIMP (arg2));
3062 RETURN (t.arg1);
3063 #endif /* BUILTIN_RPASUBR */
3064 case scm_tc7_rpsubr:
3065 #ifdef BUILTIN_RPASUBR
3066 if (SCM_FALSEP (SCM_SUBRF (proc) (t.arg1, arg2)))
3067 RETURN (SCM_BOOL_F);
3068 t.arg1 = SCM_CDDR (debug.info->a.args);
3069 do
3070 {
3071 if (SCM_FALSEP (SCM_SUBRF (proc) (arg2, SCM_CAR (t.arg1))))
3072 RETURN (SCM_BOOL_F);
3073 arg2 = SCM_CAR (t.arg1);
3074 t.arg1 = SCM_CDR (t.arg1);
3075 }
3076 while (SCM_NIMP (t.arg1));
3077 RETURN (SCM_BOOL_T);
3078 #else /* BUILTIN_RPASUBR */
3079 RETURN (SCM_APPLY (proc, t.arg1,
3080 scm_acons (arg2,
3081 SCM_CDDR (debug.info->a.args),
3082 SCM_EOL)));
3083 #endif /* BUILTIN_RPASUBR */
3084 case scm_tc7_lsubr_2:
3085 RETURN (SCM_SUBRF (proc) (t.arg1, arg2,
3086 SCM_CDDR (debug.info->a.args)));
3087 case scm_tc7_lsubr:
3088 RETURN (SCM_SUBRF (proc) (debug.info->a.args));
3089 case scm_tc7_smob:
3090 if (!SCM_SMOB_APPLICABLE_P (proc))
3091 goto badfun;
3092 RETURN (SCM_SMOB_APPLY_3 (proc, t.arg1, arg2,
3093 SCM_CDDR (debug.info->a.args)));
3094 case scm_tc7_cclo:
3095 goto cclon;
3096 case scm_tc7_pws:
3097 proc = SCM_PROCEDURE (proc);
3098 debug.info->a.proc = proc;
3099 if (!SCM_CLOSUREP (proc))
3100 goto evap3;
3101 if (scm_badargsp (SCM_CLOSURE_FORMALS (proc), debug.info->a.args))
3102 goto umwrongnumargs;
3103 case scm_tcs_closures:
3104 SCM_SET_ARGSREADY (debug);
3105 env = EXTEND_ENV (SCM_CLOSURE_FORMALS (proc),
3106 debug.info->a.args,
3107 SCM_ENV (proc));
3108 x = SCM_CLOSURE_BODY (proc);
3109 goto nontoplevel_begin;
3110 #else /* DEVAL */
3111 case scm_tc7_subr_3:
3112 SCM_ASRTGO (SCM_NULLP (SCM_CDR (x)), wrongnumargs);
3113 RETURN (SCM_SUBRF (proc) (t.arg1, arg2, EVALCAR (x, env)));
3114 case scm_tc7_asubr:
3115 #ifdef BUILTIN_RPASUBR
3116 t.arg1 = SCM_SUBRF (proc) (t.arg1, arg2);
3117 do
3118 {
3119 t.arg1 = SCM_SUBRF(proc)(t.arg1, EVALCAR(x, env));
3120 x = SCM_CDR(x);
3121 }
3122 while (SCM_NIMP (x));
3123 RETURN (t.arg1);
3124 #endif /* BUILTIN_RPASUBR */
3125 case scm_tc7_rpsubr:
3126 #ifdef BUILTIN_RPASUBR
3127 if (SCM_FALSEP (SCM_SUBRF (proc) (t.arg1, arg2)))
3128 RETURN (SCM_BOOL_F);
3129 do
3130 {
3131 t.arg1 = EVALCAR (x, env);
3132 if (SCM_FALSEP (SCM_SUBRF (proc) (arg2, t.arg1)))
3133 RETURN (SCM_BOOL_F);
3134 arg2 = t.arg1;
3135 x = SCM_CDR (x);
3136 }
3137 while (SCM_NIMP (x));
3138 RETURN (SCM_BOOL_T);
3139 #else /* BUILTIN_RPASUBR */
3140 RETURN (SCM_APPLY (proc, t.arg1,
3141 scm_acons (arg2,
3142 scm_eval_args (x, env, proc),
3143 SCM_EOL)));
3144 #endif /* BUILTIN_RPASUBR */
3145 case scm_tc7_lsubr_2:
3146 RETURN (SCM_SUBRF (proc) (t.arg1, arg2, scm_eval_args (x, env, proc)));
3147 case scm_tc7_lsubr:
3148 RETURN (SCM_SUBRF (proc) (scm_cons2 (t.arg1,
3149 arg2,
3150 scm_eval_args (x, env, proc))));
3151 case scm_tc7_smob:
3152 if (!SCM_SMOB_APPLICABLE_P (proc))
3153 goto badfun;
3154 RETURN (SCM_SMOB_APPLY_3 (proc, t.arg1, arg2,
3155 scm_eval_args (x, env, proc)));
3156 case scm_tc7_cclo:
3157 goto cclon;
3158 case scm_tc7_pws:
3159 proc = SCM_PROCEDURE (proc);
3160 if (!SCM_CLOSUREP (proc))
3161 goto evap3;
3162 {
3163 SCM formals = SCM_CLOSURE_FORMALS (proc);
3164 if (SCM_NULLP (formals)
3165 || (SCM_CONSP (formals)
3166 && (SCM_NULLP (SCM_CDR (formals))
3167 || (SCM_CONSP (SCM_CDR (formals))
3168 && scm_badargsp (SCM_CDDR (formals), x)))))
3169 goto umwrongnumargs;
3170 }
3171 case scm_tcs_closures:
3172 #ifdef DEVAL
3173 SCM_SET_ARGSREADY (debug);
3174 #endif
3175 env = EXTEND_ENV (SCM_CLOSURE_FORMALS (proc),
3176 scm_cons2 (t.arg1,
3177 arg2,
3178 scm_eval_args (x, env, proc)),
3179 SCM_ENV (proc));
3180 x = SCM_CLOSURE_BODY (proc);
3181 goto nontoplevel_begin;
3182 #endif /* DEVAL */
3183 case scm_tcs_struct:
3184 if (SCM_OBJ_CLASS_FLAGS (proc) & SCM_CLASSF_PURE_GENERIC)
3185 {
3186 #ifdef DEVAL
3187 arg2 = debug.info->a.args;
3188 #else
3189 arg2 = scm_cons2 (t.arg1, arg2, scm_eval_args (x, env, proc));
3190 #endif
3191 x = SCM_ENTITY_PROCEDURE (proc);
3192 goto type_dispatch;
3193 }
3194 else if (!SCM_I_OPERATORP (proc))
3195 goto badfun;
3196 else
3197 goto operatorn;
3198 case scm_tc7_subr_2:
3199 case scm_tc7_subr_1o:
3200 case scm_tc7_subr_2o:
3201 case scm_tc7_subr_0:
3202 case scm_tc7_cxr:
3203 case scm_tc7_subr_1:
3204 goto wrongnumargs;
3205 default:
3206 goto badfun;
3207 }
3208 }
3209 #ifdef DEVAL
3210 exit:
3211 if (CHECK_EXIT && SCM_TRAPS_P)
3212 if (SCM_EXIT_FRAME_P || (SCM_TRACE_P && SCM_TRACED_FRAME_P (debug)))
3213 {
3214 SCM_CLEAR_TRACED_FRAME (debug);
3215 if (SCM_CHEAPTRAPS_P)
3216 t.arg1 = scm_make_debugobj (&debug);
3217 else
3218 {
3219 int first;
3220 SCM val = scm_make_continuation (&first);
3221
3222 if (first)
3223 t.arg1 = val;
3224 else
3225 {
3226 proc = val;
3227 goto ret;
3228 }
3229 }
3230 SCM_TRAPS_P = 0;
3231 scm_call_3 (SCM_EXIT_FRAME_HDLR, scm_sym_exit_frame, t.arg1, proc);
3232 SCM_TRAPS_P = 1;
3233 }
3234 ret:
3235 scm_last_debug_frame = debug.prev;
3236 return proc;
3237 #endif
3238 }
3239
3240
3241 /* SECTION: This code is compiled once.
3242 */
3243
3244 #ifndef DEVAL
3245
3246 \f
3247 /* Simple procedure calls
3248 */
3249
3250 SCM
3251 scm_call_0 (SCM proc)
3252 {
3253 return scm_apply (proc, SCM_EOL, SCM_EOL);
3254 }
3255
3256 SCM
3257 scm_call_1 (SCM proc, SCM arg1)
3258 {
3259 return scm_apply (proc, arg1, scm_listofnull);
3260 }
3261
3262 SCM
3263 scm_call_2 (SCM proc, SCM arg1, SCM arg2)
3264 {
3265 return scm_apply (proc, arg1, scm_cons (arg2, scm_listofnull));
3266 }
3267
3268 SCM
3269 scm_call_3 (SCM proc, SCM arg1, SCM arg2, SCM arg3)
3270 {
3271 return scm_apply (proc, arg1, scm_cons2 (arg2, arg3, scm_listofnull));
3272 }
3273
3274 SCM
3275 scm_call_4 (SCM proc, SCM arg1, SCM arg2, SCM arg3, SCM arg4)
3276 {
3277 return scm_apply (proc, arg1, scm_cons2 (arg2, arg3,
3278 scm_cons (arg4, scm_listofnull)));
3279 }
3280
3281 /* Simple procedure applies
3282 */
3283
3284 SCM
3285 scm_apply_0 (SCM proc, SCM args)
3286 {
3287 return scm_apply (proc, args, SCM_EOL);
3288 }
3289
3290 SCM
3291 scm_apply_1 (SCM proc, SCM arg1, SCM args)
3292 {
3293 return scm_apply (proc, scm_cons (arg1, args), SCM_EOL);
3294 }
3295
3296 SCM
3297 scm_apply_2 (SCM proc, SCM arg1, SCM arg2, SCM args)
3298 {
3299 return scm_apply (proc, scm_cons2 (arg1, arg2, args), SCM_EOL);
3300 }
3301
3302 SCM
3303 scm_apply_3 (SCM proc, SCM arg1, SCM arg2, SCM arg3, SCM args)
3304 {
3305 return scm_apply (proc, scm_cons (arg1, scm_cons2 (arg2, arg3, args)),
3306 SCM_EOL);
3307 }
3308
3309 /* This code processes the arguments to apply:
3310
3311 (apply PROC ARG1 ... ARGS)
3312
3313 Given a list (ARG1 ... ARGS), this function conses the ARG1
3314 ... arguments onto the front of ARGS, and returns the resulting
3315 list. Note that ARGS is a list; thus, the argument to this
3316 function is a list whose last element is a list.
3317
3318 Apply calls this function, and applies PROC to the elements of the
3319 result. apply:nconc2last takes care of building the list of
3320 arguments, given (ARG1 ... ARGS).
3321
3322 Rather than do new consing, apply:nconc2last destroys its argument.
3323 On that topic, this code came into my care with the following
3324 beautifully cryptic comment on that topic: "This will only screw
3325 you if you do (scm_apply scm_apply '( ... ))" If you know what
3326 they're referring to, send me a patch to this comment. */
3327
3328 SCM_DEFINE (scm_nconc2last, "apply:nconc2last", 1, 0, 0,
3329 (SCM lst),
3330 "Given a list (@var{arg1} @dots{} @var{args}), this function\n"
3331 "conses the @var{arg1} @dots{} arguments onto the front of\n"
3332 "@var{args}, and returns the resulting list. Note that\n"
3333 "@var{args} is a list; thus, the argument to this function is\n"
3334 "a list whose last element is a list.\n"
3335 "Note: Rather than do new consing, @code{apply:nconc2last}\n"
3336 "destroys its argument, so use with care.")
3337 #define FUNC_NAME s_scm_nconc2last
3338 {
3339 SCM *lloc;
3340 SCM_VALIDATE_NONEMPTYLIST (1,lst);
3341 lloc = &lst;
3342 while (!SCM_NULLP (SCM_CDR (*lloc))) /* Perhaps should be
3343 SCM_NULL_OR_NIL_P, but not
3344 needed in 99.99% of cases,
3345 and it could seriously hurt
3346 performance. - Neil */
3347 lloc = SCM_CDRLOC (*lloc);
3348 SCM_ASSERT (scm_ilength (SCM_CAR (*lloc)) >= 0, lst, SCM_ARG1, FUNC_NAME);
3349 *lloc = SCM_CAR (*lloc);
3350 return lst;
3351 }
3352 #undef FUNC_NAME
3353
3354 #endif /* !DEVAL */
3355
3356
3357 /* SECTION: When DEVAL is defined this code yields scm_dapply.
3358 * It is compiled twice.
3359 */
3360
3361 #if 0
3362 SCM
3363 scm_apply (SCM proc, SCM arg1, SCM args)
3364 {}
3365 #endif
3366
3367 #if 0
3368 SCM
3369 scm_dapply (SCM proc, SCM arg1, SCM args)
3370 { /* empty */ }
3371 #endif
3372
3373
3374 /* Apply a function to a list of arguments.
3375
3376 This function is exported to the Scheme level as taking two
3377 required arguments and a tail argument, as if it were:
3378 (lambda (proc arg1 . args) ...)
3379 Thus, if you just have a list of arguments to pass to a procedure,
3380 pass the list as ARG1, and '() for ARGS. If you have some fixed
3381 args, pass the first as ARG1, then cons any remaining fixed args
3382 onto the front of your argument list, and pass that as ARGS. */
3383
3384 SCM
3385 SCM_APPLY (SCM proc, SCM arg1, SCM args)
3386 {
3387 #ifdef DEBUG_EXTENSIONS
3388 #ifdef DEVAL
3389 scm_t_debug_frame debug;
3390 scm_t_debug_info debug_vect_body;
3391 debug.prev = scm_last_debug_frame;
3392 debug.status = SCM_APPLYFRAME;
3393 debug.vect = &debug_vect_body;
3394 debug.vect[0].a.proc = proc;
3395 debug.vect[0].a.args = SCM_EOL;
3396 scm_last_debug_frame = &debug;
3397 #else
3398 if (SCM_DEBUGGINGP)
3399 return scm_dapply (proc, arg1, args);
3400 #endif
3401 #endif
3402
3403 SCM_ASRTGO (SCM_NIMP (proc), badproc);
3404
3405 /* If ARGS is the empty list, then we're calling apply with only two
3406 arguments --- ARG1 is the list of arguments for PROC. Whatever
3407 the case, futz with things so that ARG1 is the first argument to
3408 give to PROC (or SCM_UNDEFINED if no args), and ARGS contains the
3409 rest.
3410
3411 Setting the debug apply frame args this way is pretty messy.
3412 Perhaps we should store arg1 and args directly in the frame as
3413 received, and let scm_frame_arguments unpack them, because that's
3414 a relatively rare operation. This works for now; if the Guile
3415 developer archives are still around, see Mikael's post of
3416 11-Apr-97. */
3417 if (SCM_NULLP (args))
3418 {
3419 if (SCM_NULLP (arg1))
3420 {
3421 arg1 = SCM_UNDEFINED;
3422 #ifdef DEVAL
3423 debug.vect[0].a.args = SCM_EOL;
3424 #endif
3425 }
3426 else
3427 {
3428 #ifdef DEVAL
3429 debug.vect[0].a.args = arg1;
3430 #endif
3431 args = SCM_CDR (arg1);
3432 arg1 = SCM_CAR (arg1);
3433 }
3434 }
3435 else
3436 {
3437 args = scm_nconc2last (args);
3438 #ifdef DEVAL
3439 debug.vect[0].a.args = scm_cons (arg1, args);
3440 #endif
3441 }
3442 #ifdef DEVAL
3443 if (SCM_ENTER_FRAME_P && SCM_TRAPS_P)
3444 {
3445 SCM tmp;
3446 if (SCM_CHEAPTRAPS_P)
3447 tmp = scm_make_debugobj (&debug);
3448 else
3449 {
3450 int first;
3451
3452 tmp = scm_make_continuation (&first);
3453 if (!first)
3454 goto entap;
3455 }
3456 SCM_TRAPS_P = 0;
3457 scm_call_2 (SCM_ENTER_FRAME_HDLR, scm_sym_enter_frame, tmp);
3458 SCM_TRAPS_P = 1;
3459 }
3460 entap:
3461 ENTER_APPLY;
3462 #endif
3463 tail:
3464 switch (SCM_TYP7 (proc))
3465 {
3466 case scm_tc7_subr_2o:
3467 args = SCM_NULLP (args) ? SCM_UNDEFINED : SCM_CAR (args);
3468 RETURN (SCM_SUBRF (proc) (arg1, args));
3469 case scm_tc7_subr_2:
3470 SCM_ASRTGO (!SCM_NULLP (args) && SCM_NULLP (SCM_CDR (args)),
3471 wrongnumargs);
3472 args = SCM_CAR (args);
3473 RETURN (SCM_SUBRF (proc) (arg1, args));
3474 case scm_tc7_subr_0:
3475 SCM_ASRTGO (SCM_UNBNDP (arg1), wrongnumargs);
3476 RETURN (SCM_SUBRF (proc) ());
3477 case scm_tc7_subr_1:
3478 SCM_ASRTGO (!SCM_UNBNDP (arg1), wrongnumargs);
3479 case scm_tc7_subr_1o:
3480 SCM_ASRTGO (SCM_NULLP (args), wrongnumargs);
3481 RETURN (SCM_SUBRF (proc) (arg1));
3482 case scm_tc7_cxr:
3483 SCM_ASRTGO (!SCM_UNBNDP (arg1) && SCM_NULLP (args), wrongnumargs);
3484 if (SCM_SUBRF (proc))
3485 {
3486 if (SCM_INUMP (arg1))
3487 {
3488 RETURN (scm_make_real (SCM_DSUBRF (proc) ((double) SCM_INUM (arg1))));
3489 }
3490 else if (SCM_REALP (arg1))
3491 {
3492 RETURN (scm_make_real (SCM_DSUBRF (proc) (SCM_REAL_VALUE (arg1))));
3493 }
3494 #ifdef SCM_BIGDIG
3495 else if (SCM_BIGP (arg1))
3496 RETURN (scm_make_real (SCM_DSUBRF (proc) (scm_i_big2dbl (arg1))));
3497 #endif
3498 SCM_WTA_DISPATCH_1 (*SCM_SUBR_GENERIC (proc), arg1,
3499 SCM_ARG1, SCM_SYMBOL_CHARS (SCM_SNAME (proc)));
3500 }
3501 proc = SCM_SNAME (proc);
3502 {
3503 char *chrs = SCM_SYMBOL_CHARS (proc) + SCM_SYMBOL_LENGTH (proc) - 1;
3504 while ('c' != *--chrs)
3505 {
3506 SCM_ASSERT (SCM_CONSP (arg1),
3507 arg1, SCM_ARG1, SCM_SYMBOL_CHARS (proc));
3508 arg1 = ('a' == *chrs) ? SCM_CAR (arg1) : SCM_CDR (arg1);
3509 }
3510 RETURN (arg1);
3511 }
3512 case scm_tc7_subr_3:
3513 SCM_ASRTGO (!SCM_NULLP (args)
3514 && !SCM_NULLP (SCM_CDR (args))
3515 && SCM_NULLP (SCM_CDDR (args)),
3516 wrongnumargs);
3517 RETURN (SCM_SUBRF (proc) (arg1, SCM_CAR (args), SCM_CADR (args)));
3518 case scm_tc7_lsubr:
3519 #ifdef DEVAL
3520 RETURN (SCM_SUBRF (proc) (SCM_UNBNDP (arg1) ? SCM_EOL : debug.vect[0].a.args));
3521 #else
3522 RETURN (SCM_SUBRF (proc) (SCM_UNBNDP (arg1) ? SCM_EOL : scm_cons (arg1, args)));
3523 #endif
3524 case scm_tc7_lsubr_2:
3525 SCM_ASRTGO (SCM_CONSP (args), wrongnumargs);
3526 RETURN (SCM_SUBRF (proc) (arg1, SCM_CAR (args), SCM_CDR (args)));
3527 case scm_tc7_asubr:
3528 if (SCM_NULLP (args))
3529 RETURN (SCM_SUBRF (proc) (arg1, SCM_UNDEFINED));
3530 while (SCM_NIMP (args))
3531 {
3532 SCM_ASSERT (SCM_CONSP (args), args, SCM_ARG2, "apply");
3533 arg1 = SCM_SUBRF (proc) (arg1, SCM_CAR (args));
3534 args = SCM_CDR (args);
3535 }
3536 RETURN (arg1);
3537 case scm_tc7_rpsubr:
3538 if (SCM_NULLP (args))
3539 RETURN (SCM_BOOL_T);
3540 while (SCM_NIMP (args))
3541 {
3542 SCM_ASSERT (SCM_CONSP (args), args, SCM_ARG2, "apply");
3543 if (SCM_FALSEP (SCM_SUBRF (proc) (arg1, SCM_CAR (args))))
3544 RETURN (SCM_BOOL_F);
3545 arg1 = SCM_CAR (args);
3546 args = SCM_CDR (args);
3547 }
3548 RETURN (SCM_BOOL_T);
3549 case scm_tcs_closures:
3550 #ifdef DEVAL
3551 arg1 = (SCM_UNBNDP (arg1) ? SCM_EOL : debug.vect[0].a.args);
3552 #else
3553 arg1 = (SCM_UNBNDP (arg1) ? SCM_EOL : scm_cons (arg1, args));
3554 #endif
3555 #ifndef SCM_RECKLESS
3556 if (scm_badargsp (SCM_CLOSURE_FORMALS (proc), arg1))
3557 goto wrongnumargs;
3558 #endif
3559
3560 /* Copy argument list */
3561 if (SCM_IMP (arg1))
3562 args = arg1;
3563 else
3564 {
3565 SCM tl = args = scm_cons (SCM_CAR (arg1), SCM_UNSPECIFIED);
3566 while (arg1 = SCM_CDR (arg1), SCM_CONSP (arg1))
3567 {
3568 SCM_SETCDR (tl, scm_cons (SCM_CAR (arg1),
3569 SCM_UNSPECIFIED));
3570 tl = SCM_CDR (tl);
3571 }
3572 SCM_SETCDR (tl, arg1);
3573 }
3574
3575 args = EXTEND_ENV (SCM_CLOSURE_FORMALS (proc), args, SCM_ENV (proc));
3576 proc = SCM_CLOSURE_BODY (proc);
3577 again:
3578 arg1 = proc;
3579 while (!SCM_NULLP (arg1 = SCM_CDR (arg1)))
3580 {
3581 if (SCM_IMP (SCM_CAR (proc)))
3582 {
3583 if (SCM_ISYMP (SCM_CAR (proc)))
3584 {
3585 proc = scm_m_expand_body (proc, args);
3586 goto again;
3587 }
3588 else
3589 SCM_VALIDATE_NON_EMPTY_COMBINATION (SCM_CAR (proc));
3590 }
3591 else
3592 SCM_CEVAL (SCM_CAR (proc), args);
3593 proc = arg1;
3594 }
3595 RETURN (EVALCAR (proc, args));
3596 case scm_tc7_smob:
3597 if (!SCM_SMOB_APPLICABLE_P (proc))
3598 goto badproc;
3599 if (SCM_UNBNDP (arg1))
3600 RETURN (SCM_SMOB_APPLY_0 (proc));
3601 else if (SCM_NULLP (args))
3602 RETURN (SCM_SMOB_APPLY_1 (proc, arg1));
3603 else if (SCM_NULLP (SCM_CDR (args)))
3604 RETURN (SCM_SMOB_APPLY_2 (proc, arg1, SCM_CAR (args)));
3605 else
3606 RETURN (SCM_SMOB_APPLY_3 (proc, arg1, SCM_CAR (args), SCM_CDR (args)));
3607 case scm_tc7_cclo:
3608 #ifdef DEVAL
3609 args = (SCM_UNBNDP(arg1) ? SCM_EOL : debug.vect[0].a.args);
3610 arg1 = proc;
3611 proc = SCM_CCLO_SUBR (proc);
3612 debug.vect[0].a.proc = proc;
3613 debug.vect[0].a.args = scm_cons (arg1, args);
3614 #else
3615 args = (SCM_UNBNDP(arg1) ? SCM_EOL : scm_cons (arg1, args));
3616 arg1 = proc;
3617 proc = SCM_CCLO_SUBR (proc);
3618 #endif
3619 goto tail;
3620 case scm_tc7_pws:
3621 proc = SCM_PROCEDURE (proc);
3622 #ifdef DEVAL
3623 debug.vect[0].a.proc = proc;
3624 #endif
3625 goto tail;
3626 case scm_tcs_struct:
3627 if (SCM_OBJ_CLASS_FLAGS (proc) & SCM_CLASSF_PURE_GENERIC)
3628 {
3629 #ifdef DEVAL
3630 args = (SCM_UNBNDP(arg1) ? SCM_EOL : debug.vect[0].a.args);
3631 #else
3632 args = (SCM_UNBNDP(arg1) ? SCM_EOL : scm_cons (arg1, args));
3633 #endif
3634 RETURN (scm_apply_generic (proc, args));
3635 }
3636 else if (!SCM_I_OPERATORP (proc))
3637 goto badproc;
3638 else
3639 {
3640 #ifdef DEVAL
3641 args = (SCM_UNBNDP(arg1) ? SCM_EOL : debug.vect[0].a.args);
3642 #else
3643 args = (SCM_UNBNDP(arg1) ? SCM_EOL : scm_cons (arg1, args));
3644 #endif
3645 arg1 = proc;
3646 proc = (SCM_I_ENTITYP (proc)
3647 ? SCM_ENTITY_PROCEDURE (proc)
3648 : SCM_OPERATOR_PROCEDURE (proc));
3649 #ifdef DEVAL
3650 debug.vect[0].a.proc = proc;
3651 debug.vect[0].a.args = scm_cons (arg1, args);
3652 #endif
3653 if (SCM_NIMP (proc))
3654 goto tail;
3655 else
3656 goto badproc;
3657 }
3658 wrongnumargs:
3659 scm_wrong_num_args (proc);
3660 default:
3661 badproc:
3662 scm_wrong_type_arg ("apply", SCM_ARG1, proc);
3663 RETURN (arg1);
3664 }
3665 #ifdef DEVAL
3666 exit:
3667 if (CHECK_EXIT && SCM_TRAPS_P)
3668 if (SCM_EXIT_FRAME_P || (SCM_TRACE_P && SCM_TRACED_FRAME_P (debug)))
3669 {
3670 SCM_CLEAR_TRACED_FRAME (debug);
3671 if (SCM_CHEAPTRAPS_P)
3672 arg1 = scm_make_debugobj (&debug);
3673 else
3674 {
3675 int first;
3676 SCM val = scm_make_continuation (&first);
3677
3678 if (first)
3679 arg1 = val;
3680 else
3681 {
3682 proc = val;
3683 goto ret;
3684 }
3685 }
3686 SCM_TRAPS_P = 0;
3687 scm_call_3 (SCM_EXIT_FRAME_HDLR, scm_sym_exit_frame, arg1, proc);
3688 SCM_TRAPS_P = 1;
3689 }
3690 ret:
3691 scm_last_debug_frame = debug.prev;
3692 return proc;
3693 #endif
3694 }
3695
3696
3697 /* SECTION: The rest of this file is only read once.
3698 */
3699
3700 #ifndef DEVAL
3701
3702 /* Typechecking for multi-argument MAP and FOR-EACH.
3703
3704 Verify that each element of the vector ARGV, except for the first,
3705 is a proper list whose length is LEN. Attribute errors to WHO,
3706 and claim that the i'th element of ARGV is WHO's i+2'th argument. */
3707 static inline void
3708 check_map_args (SCM argv,
3709 long len,
3710 SCM gf,
3711 SCM proc,
3712 SCM args,
3713 const char *who)
3714 {
3715 SCM *ve = SCM_VELTS (argv);
3716 long i;
3717
3718 for (i = SCM_VECTOR_LENGTH (argv) - 1; i >= 1; i--)
3719 {
3720 long elt_len = scm_ilength (ve[i]);
3721
3722 if (elt_len < 0)
3723 {
3724 if (gf)
3725 scm_apply_generic (gf, scm_cons (proc, args));
3726 else
3727 scm_wrong_type_arg (who, i + 2, ve[i]);
3728 }
3729
3730 if (elt_len != len)
3731 scm_out_of_range (who, ve[i]);
3732 }
3733
3734 scm_remember_upto_here_1 (argv);
3735 }
3736
3737
3738 SCM_GPROC (s_map, "map", 2, 0, 1, scm_map, g_map);
3739
3740 /* Note: Currently, scm_map applies PROC to the argument list(s)
3741 sequentially, starting with the first element(s). This is used in
3742 evalext.c where the Scheme procedure `map-in-order', which guarantees
3743 sequential behaviour, is implemented using scm_map. If the
3744 behaviour changes, we need to update `map-in-order'.
3745 */
3746
3747 SCM
3748 scm_map (SCM proc, SCM arg1, SCM args)
3749 #define FUNC_NAME s_map
3750 {
3751 long i, len;
3752 SCM res = SCM_EOL;
3753 SCM *pres = &res;
3754 SCM *ve = &args; /* Keep args from being optimized away. */
3755
3756 len = scm_ilength (arg1);
3757 SCM_GASSERTn (len >= 0,
3758 g_map, scm_cons2 (proc, arg1, args), SCM_ARG2, s_map);
3759 SCM_VALIDATE_REST_ARGUMENT (args);
3760 if (SCM_NULLP (args))
3761 {
3762 while (SCM_NIMP (arg1))
3763 {
3764 *pres = scm_list_1 (scm_apply (proc, SCM_CAR (arg1), scm_listofnull));
3765 pres = SCM_CDRLOC (*pres);
3766 arg1 = SCM_CDR (arg1);
3767 }
3768 return res;
3769 }
3770 args = scm_vector (arg1 = scm_cons (arg1, args));
3771 ve = SCM_VELTS (args);
3772 #ifndef SCM_RECKLESS
3773 check_map_args (args, len, g_map, proc, arg1, s_map);
3774 #endif
3775 while (1)
3776 {
3777 arg1 = SCM_EOL;
3778 for (i = SCM_VECTOR_LENGTH (args) - 1; i >= 0; i--)
3779 {
3780 if (SCM_IMP (ve[i]))
3781 return res;
3782 arg1 = scm_cons (SCM_CAR (ve[i]), arg1);
3783 ve[i] = SCM_CDR (ve[i]);
3784 }
3785 *pres = scm_list_1 (scm_apply (proc, arg1, SCM_EOL));
3786 pres = SCM_CDRLOC (*pres);
3787 }
3788 }
3789 #undef FUNC_NAME
3790
3791
3792 SCM_GPROC (s_for_each, "for-each", 2, 0, 1, scm_for_each, g_for_each);
3793
3794 SCM
3795 scm_for_each (SCM proc, SCM arg1, SCM args)
3796 #define FUNC_NAME s_for_each
3797 {
3798 SCM *ve = &args; /* Keep args from being optimized away. */
3799 long i, len;
3800 len = scm_ilength (arg1);
3801 SCM_GASSERTn (len >= 0, g_for_each, scm_cons2 (proc, arg1, args),
3802 SCM_ARG2, s_for_each);
3803 SCM_VALIDATE_REST_ARGUMENT (args);
3804 if (SCM_NULLP (args))
3805 {
3806 while (SCM_NIMP (arg1))
3807 {
3808 scm_apply (proc, SCM_CAR (arg1), scm_listofnull);
3809 arg1 = SCM_CDR (arg1);
3810 }
3811 return SCM_UNSPECIFIED;
3812 }
3813 args = scm_vector (arg1 = scm_cons (arg1, args));
3814 ve = SCM_VELTS (args);
3815 #ifndef SCM_RECKLESS
3816 check_map_args (args, len, g_for_each, proc, arg1, s_for_each);
3817 #endif
3818 while (1)
3819 {
3820 arg1 = SCM_EOL;
3821 for (i = SCM_VECTOR_LENGTH (args) - 1; i >= 0; i--)
3822 {
3823 if (SCM_IMP (ve[i]))
3824 return SCM_UNSPECIFIED;
3825 arg1 = scm_cons (SCM_CAR (ve[i]), arg1);
3826 ve[i] = SCM_CDR (ve[i]);
3827 }
3828 scm_apply (proc, arg1, SCM_EOL);
3829 }
3830 }
3831 #undef FUNC_NAME
3832
3833
3834 SCM
3835 scm_closure (SCM code, SCM env)
3836 {
3837 SCM z;
3838 SCM closcar = scm_cons (code, SCM_EOL);
3839 z = scm_cell (SCM_UNPACK (closcar) + scm_tc3_closure, (scm_t_bits) env);
3840 scm_remember_upto_here (closcar);
3841 return z;
3842 }
3843
3844
3845 scm_t_bits scm_tc16_promise;
3846
3847 SCM
3848 scm_makprom (SCM code)
3849 {
3850 SCM_RETURN_NEWSMOB (scm_tc16_promise, SCM_UNPACK (code));
3851 }
3852
3853
3854
3855 static int
3856 promise_print (SCM exp, SCM port, scm_print_state *pstate)
3857 {
3858 int writingp = SCM_WRITINGP (pstate);
3859 scm_puts ("#<promise ", port);
3860 SCM_SET_WRITINGP (pstate, 1);
3861 scm_iprin1 (SCM_CELL_OBJECT_1 (exp), port, pstate);
3862 SCM_SET_WRITINGP (pstate, writingp);
3863 scm_putc ('>', port);
3864 return !0;
3865 }
3866
3867
3868 SCM_DEFINE (scm_force, "force", 1, 0, 0,
3869 (SCM x),
3870 "If the promise @var{x} has not been computed yet, compute and\n"
3871 "return @var{x}, otherwise just return the previously computed\n"
3872 "value.")
3873 #define FUNC_NAME s_scm_force
3874 {
3875 SCM_VALIDATE_SMOB (1, x, promise);
3876 if (!((1L << 16) & SCM_CELL_WORD_0 (x)))
3877 {
3878 SCM ans = scm_call_0 (SCM_CELL_OBJECT_1 (x));
3879 if (!((1L << 16) & SCM_CELL_WORD_0 (x)))
3880 {
3881 SCM_DEFER_INTS;
3882 SCM_SET_CELL_OBJECT_1 (x, ans);
3883 SCM_SET_CELL_WORD_0 (x, SCM_CELL_WORD_0 (x) | (1L << 16));
3884 SCM_ALLOW_INTS;
3885 }
3886 }
3887 return SCM_CELL_OBJECT_1 (x);
3888 }
3889 #undef FUNC_NAME
3890
3891
3892 SCM_DEFINE (scm_promise_p, "promise?", 1, 0, 0,
3893 (SCM obj),
3894 "Return true if @var{obj} is a promise, i.e. a delayed computation\n"
3895 "(@pxref{Delayed evaluation,,,r5rs.info,The Revised^5 Report on Scheme}).")
3896 #define FUNC_NAME s_scm_promise_p
3897 {
3898 return SCM_BOOL (SCM_TYP16_PREDICATE (scm_tc16_promise, obj));
3899 }
3900 #undef FUNC_NAME
3901
3902
3903 SCM_DEFINE (scm_cons_source, "cons-source", 3, 0, 0,
3904 (SCM xorig, SCM x, SCM y),
3905 "Create and return a new pair whose car and cdr are @var{x} and @var{y}.\n"
3906 "Any source properties associated with @var{xorig} are also associated\n"
3907 "with the new pair.")
3908 #define FUNC_NAME s_scm_cons_source
3909 {
3910 SCM p, z;
3911 z = scm_cons (x, y);
3912 /* Copy source properties possibly associated with xorig. */
3913 p = scm_whash_lookup (scm_source_whash, xorig);
3914 if (!SCM_IMP (p))
3915 scm_whash_insert (scm_source_whash, z, p);
3916 return z;
3917 }
3918 #undef FUNC_NAME
3919
3920
3921 SCM_DEFINE (scm_copy_tree, "copy-tree", 1, 0, 0,
3922 (SCM obj),
3923 "Recursively copy the data tree that is bound to @var{obj}, and return a\n"
3924 "pointer to the new data structure. @code{copy-tree} recurses down the\n"
3925 "contents of both pairs and vectors (since both cons cells and vector\n"
3926 "cells may point to arbitrary objects), and stops recursing when it hits\n"
3927 "any other object.")
3928 #define FUNC_NAME s_scm_copy_tree
3929 {
3930 SCM ans, tl;
3931 if (SCM_IMP (obj))
3932 return obj;
3933 if (SCM_VECTORP (obj))
3934 {
3935 unsigned long i = SCM_VECTOR_LENGTH (obj);
3936 ans = scm_c_make_vector (i, SCM_UNSPECIFIED);
3937 while (i--)
3938 SCM_VELTS (ans)[i] = scm_copy_tree (SCM_VELTS (obj)[i]);
3939 return ans;
3940 }
3941 if (!SCM_CONSP (obj))
3942 return obj;
3943 ans = tl = scm_cons_source (obj,
3944 scm_copy_tree (SCM_CAR (obj)),
3945 SCM_UNSPECIFIED);
3946 while (obj = SCM_CDR (obj), SCM_CONSP (obj))
3947 {
3948 SCM_SETCDR (tl, scm_cons (scm_copy_tree (SCM_CAR (obj)),
3949 SCM_UNSPECIFIED));
3950 tl = SCM_CDR (tl);
3951 }
3952 SCM_SETCDR (tl, obj);
3953 return ans;
3954 }
3955 #undef FUNC_NAME
3956
3957
3958 /* We have three levels of EVAL here:
3959
3960 - scm_i_eval (exp, env)
3961
3962 evaluates EXP in environment ENV. ENV is a lexical environment
3963 structure as used by the actual tree code evaluator. When ENV is
3964 a top-level environment, then changes to the current module are
3965 tracked by updating ENV so that it continues to be in sync with
3966 the current module.
3967
3968 - scm_primitive_eval (exp)
3969
3970 evaluates EXP in the top-level environment as determined by the
3971 current module. This is done by constructing a suitable
3972 environment and calling scm_i_eval. Thus, changes to the
3973 top-level module are tracked normally.
3974
3975 - scm_eval (exp, mod)
3976
3977 evaluates EXP while MOD is the current module. This is done by
3978 setting the current module to MOD, invoking scm_primitive_eval on
3979 EXP, and then restoring the current module to the value it had
3980 previously. That is, while EXP is evaluated, changes to the
3981 current module are tracked, but these changes do not persist when
3982 scm_eval returns.
3983
3984 For each level of evals, there are two variants, distinguished by a
3985 _x suffix: the ordinary variant does not modify EXP while the _x
3986 variant can destructively modify EXP into something completely
3987 unintelligible. A Scheme data structure passed as EXP to one of the
3988 _x variants should not ever be used again for anything. So when in
3989 doubt, use the ordinary variant.
3990
3991 */
3992
3993 SCM
3994 scm_i_eval_x (SCM exp, SCM env)
3995 {
3996 return SCM_XEVAL (exp, env);
3997 }
3998
3999 SCM
4000 scm_i_eval (SCM exp, SCM env)
4001 {
4002 exp = scm_copy_tree (exp);
4003 return SCM_XEVAL (exp, env);
4004 }
4005
4006 SCM
4007 scm_primitive_eval_x (SCM exp)
4008 {
4009 SCM env;
4010 SCM transformer = scm_current_module_transformer ();
4011 if (SCM_NIMP (transformer))
4012 exp = scm_call_1 (transformer, exp);
4013 env = scm_top_level_env (scm_current_module_lookup_closure ());
4014 return scm_i_eval_x (exp, env);
4015 }
4016
4017 SCM_DEFINE (scm_primitive_eval, "primitive-eval", 1, 0, 0,
4018 (SCM exp),
4019 "Evaluate @var{exp} in the top-level environment specified by\n"
4020 "the current module.")
4021 #define FUNC_NAME s_scm_primitive_eval
4022 {
4023 SCM env;
4024 SCM transformer = scm_current_module_transformer ();
4025 if (SCM_NIMP (transformer))
4026 exp = scm_call_1 (transformer, exp);
4027 env = scm_top_level_env (scm_current_module_lookup_closure ());
4028 return scm_i_eval (exp, env);
4029 }
4030 #undef FUNC_NAME
4031
4032 /* Eval does not take the second arg optionally. This is intentional
4033 * in order to be R5RS compatible, and to prepare for the new module
4034 * system, where we would like to make the choice of evaluation
4035 * environment explicit. */
4036
4037 static void
4038 change_environment (void *data)
4039 {
4040 SCM pair = SCM_PACK (data);
4041 SCM new_module = SCM_CAR (pair);
4042 SCM old_module = scm_current_module ();
4043 SCM_SETCDR (pair, old_module);
4044 scm_set_current_module (new_module);
4045 }
4046
4047
4048 static void
4049 restore_environment (void *data)
4050 {
4051 SCM pair = SCM_PACK (data);
4052 SCM old_module = SCM_CDR (pair);
4053 SCM new_module = scm_current_module ();
4054 SCM_SETCAR (pair, new_module);
4055 scm_set_current_module (old_module);
4056 }
4057
4058 static SCM
4059 inner_eval_x (void *data)
4060 {
4061 return scm_primitive_eval_x (SCM_PACK(data));
4062 }
4063
4064 SCM
4065 scm_eval_x (SCM exp, SCM module)
4066 #define FUNC_NAME "eval!"
4067 {
4068 SCM_VALIDATE_MODULE (2, module);
4069
4070 return scm_internal_dynamic_wind
4071 (change_environment, inner_eval_x, restore_environment,
4072 (void *) SCM_UNPACK (exp),
4073 (void *) SCM_UNPACK (scm_cons (module, SCM_BOOL_F)));
4074 }
4075 #undef FUNC_NAME
4076
4077 static SCM
4078 inner_eval (void *data)
4079 {
4080 return scm_primitive_eval (SCM_PACK(data));
4081 }
4082
4083 SCM_DEFINE (scm_eval, "eval", 2, 0, 0,
4084 (SCM exp, SCM module),
4085 "Evaluate @var{exp}, a list representing a Scheme expression,\n"
4086 "in the top-level environment specified by @var{module}.\n"
4087 "While @var{exp} is evaluated (using @code{primitive-eval}),\n"
4088 "@var{module} is made the current module. The current module\n"
4089 "is reset to its previous value when @var{eval} returns.")
4090 #define FUNC_NAME s_scm_eval
4091 {
4092 SCM_VALIDATE_MODULE (2, module);
4093
4094 return scm_internal_dynamic_wind
4095 (change_environment, inner_eval, restore_environment,
4096 (void *) SCM_UNPACK (exp),
4097 (void *) SCM_UNPACK (scm_cons (module, SCM_BOOL_F)));
4098 }
4099 #undef FUNC_NAME
4100
4101
4102 /* At this point, scm_deval and scm_dapply are generated.
4103 */
4104
4105 #ifdef DEBUG_EXTENSIONS
4106 # define DEVAL
4107 # include "eval.c"
4108 #endif
4109
4110
4111
4112 void
4113 scm_init_eval ()
4114 {
4115 scm_init_opts (scm_evaluator_traps,
4116 scm_evaluator_trap_table,
4117 SCM_N_EVALUATOR_TRAPS);
4118 scm_init_opts (scm_eval_options_interface,
4119 scm_eval_opts,
4120 SCM_N_EVAL_OPTIONS);
4121
4122 scm_tc16_promise = scm_make_smob_type ("promise", 0);
4123 scm_set_smob_mark (scm_tc16_promise, scm_markcdr);
4124 scm_set_smob_print (scm_tc16_promise, promise_print);
4125
4126 /* Dirk:Fixme:: make scm_undefineds local to eval.c: it's only used here. */
4127 scm_undefineds = scm_list_1 (SCM_UNDEFINED);
4128 SCM_SETCDR (scm_undefineds, scm_undefineds);
4129 scm_listofnull = scm_list_1 (SCM_EOL);
4130
4131 scm_f_apply = scm_c_define_subr ("apply", scm_tc7_lsubr_2, scm_apply);
4132
4133 /* acros */
4134 /* end of acros */
4135
4136 #ifndef SCM_MAGIC_SNARFER
4137 #include "libguile/eval.x"
4138 #endif
4139
4140 scm_add_feature ("delay");
4141 }
4142
4143 #endif /* !DEVAL */
4144
4145 /*
4146 Local Variables:
4147 c-file-style: "gnu"
4148 End:
4149 */