(scm_lookupcar1): Report an "Undefined variable" insetad of an
[bpt/guile.git] / libguile / eval.c
1 /* Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002,2003,2004
2 * Free Software Foundation, Inc.
3 *
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2.1 of the License, or (at your option) any later version.
8 *
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
13 *
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library; if not, write to the Free Software
16 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 */
18
19 \f
20
21 /* This file is read twice in order to produce debugging versions of ceval and
22 * scm_apply. These functions, deval and scm_dapply, are produced when we
23 * define the preprocessor macro DEVAL. The file is divided into sections
24 * which are treated differently with respect to DEVAL. The heads of these
25 * sections are marked with the string "SECTION:". */
26
27 /* SECTION: This code is compiled once.
28 */
29
30 #if HAVE_CONFIG_H
31 # include <config.h>
32 #endif
33
34 #include "libguile/__scm.h"
35
36 #ifndef DEVAL
37
38 /* AIX requires this to be the first thing in the file. The #pragma
39 directive is indented so pre-ANSI compilers will ignore it, rather
40 than choke on it. */
41 #ifndef __GNUC__
42 # if HAVE_ALLOCA_H
43 # include <alloca.h>
44 # else
45 # ifdef _AIX
46 # pragma alloca
47 # else
48 # ifndef alloca /* predefined by HP cc +Olibcalls */
49 char *alloca ();
50 # endif
51 # endif
52 # endif
53 #endif
54
55 #include <assert.h>
56 #include "libguile/_scm.h"
57 #include "libguile/alist.h"
58 #include "libguile/async.h"
59 #include "libguile/continuations.h"
60 #include "libguile/debug.h"
61 #include "libguile/deprecation.h"
62 #include "libguile/dynwind.h"
63 #include "libguile/eq.h"
64 #include "libguile/feature.h"
65 #include "libguile/fluids.h"
66 #include "libguile/futures.h"
67 #include "libguile/goops.h"
68 #include "libguile/hash.h"
69 #include "libguile/hashtab.h"
70 #include "libguile/lang.h"
71 #include "libguile/list.h"
72 #include "libguile/macros.h"
73 #include "libguile/modules.h"
74 #include "libguile/objects.h"
75 #include "libguile/ports.h"
76 #include "libguile/print.h"
77 #include "libguile/procprop.h"
78 #include "libguile/root.h"
79 #include "libguile/smob.h"
80 #include "libguile/srcprop.h"
81 #include "libguile/stackchk.h"
82 #include "libguile/strings.h"
83 #include "libguile/throw.h"
84 #include "libguile/validate.h"
85 #include "libguile/values.h"
86 #include "libguile/vectors.h"
87
88 #include "libguile/eval.h"
89
90 \f
91
92 static SCM unmemoize_exprs (SCM expr, SCM env);
93 static SCM canonicalize_define (SCM expr);
94 static SCM *scm_lookupcar1 (SCM vloc, SCM genv, int check);
95 static SCM unmemoize_builtin_macro (SCM expr, SCM env);
96
97 \f
98
99 /* {Syntax Errors}
100 *
101 * This section defines the message strings for the syntax errors that can be
102 * detected during memoization and the functions and macros that shall be
103 * called by the memoizer code to signal syntax errors. */
104
105
106 /* Syntax errors that can be detected during memoization: */
107
108 /* Circular or improper lists do not form valid scheme expressions. If a
109 * circular list or an improper list is detected in a place where a scheme
110 * expression is expected, a 'Bad expression' error is signalled. */
111 static const char s_bad_expression[] = "Bad expression";
112
113 /* If a form is detected that holds a different number of expressions than are
114 * required in that context, a 'Missing or extra expression' error is
115 * signalled. */
116 static const char s_expression[] = "Missing or extra expression in";
117
118 /* If a form is detected that holds less expressions than are required in that
119 * context, a 'Missing expression' error is signalled. */
120 static const char s_missing_expression[] = "Missing expression in";
121
122 /* If a form is detected that holds more expressions than are allowed in that
123 * context, an 'Extra expression' error is signalled. */
124 static const char s_extra_expression[] = "Extra expression in";
125
126 /* The empty combination '()' is not allowed as an expression in scheme. If
127 * it is detected in a place where an expression is expected, an 'Illegal
128 * empty combination' error is signalled. Note: If you encounter this error
129 * message, it is very likely that you intended to denote the empty list. To
130 * do so, you need to quote the empty list like (quote ()) or '(). */
131 static const char s_empty_combination[] = "Illegal empty combination";
132
133 /* A body may hold an arbitrary number of internal defines, followed by a
134 * non-empty sequence of expressions. If a body with an empty sequence of
135 * expressions is detected, a 'Missing body expression' error is signalled.
136 */
137 static const char s_missing_body_expression[] = "Missing body expression in";
138
139 /* A body may hold an arbitrary number of internal defines, followed by a
140 * non-empty sequence of expressions. Each the definitions and the
141 * expressions may be grouped arbitraryly with begin, but it is not allowed to
142 * mix definitions and expressions. If a define form in a body mixes
143 * definitions and expressions, a 'Mixed definitions and expressions' error is
144 * signalled. */
145 static const char s_mixed_body_forms[] = "Mixed definitions and expressions in";
146 /* Definitions are only allowed on the top level and at the start of a body.
147 * If a definition is detected anywhere else, a 'Bad define placement' error
148 * is signalled. */
149 static const char s_bad_define[] = "Bad define placement";
150
151 /* Case or cond expressions must have at least one clause. If a case or cond
152 * expression without any clauses is detected, a 'Missing clauses' error is
153 * signalled. */
154 static const char s_missing_clauses[] = "Missing clauses";
155
156 /* If there is an 'else' clause in a case or a cond statement, it must be the
157 * last clause. If after the 'else' case clause further clauses are detected,
158 * a 'Misplaced else clause' error is signalled. */
159 static const char s_misplaced_else_clause[] = "Misplaced else clause";
160
161 /* If a case clause is detected that is not in the format
162 * (<label(s)> <expression1> <expression2> ...)
163 * a 'Bad case clause' error is signalled. */
164 static const char s_bad_case_clause[] = "Bad case clause";
165
166 /* If a case clause is detected where the <label(s)> element is neither a
167 * proper list nor (in case of the last clause) the syntactic keyword 'else',
168 * a 'Bad case labels' error is signalled. Note: If you encounter this error
169 * for an else-clause which seems to be syntactically correct, check if 'else'
170 * is really a syntactic keyword in that context. If 'else' is bound in the
171 * local or global environment, it is not considered a syntactic keyword, but
172 * will be treated as any other variable. */
173 static const char s_bad_case_labels[] = "Bad case labels";
174
175 /* In a case statement all labels have to be distinct. If in a case statement
176 * a label occurs more than once, a 'Duplicate case label' error is
177 * signalled. */
178 static const char s_duplicate_case_label[] = "Duplicate case label";
179
180 /* If a cond clause is detected that is not in one of the formats
181 * (<test> <expression1> ...) or (else <expression1> <expression2> ...)
182 * a 'Bad cond clause' error is signalled. */
183 static const char s_bad_cond_clause[] = "Bad cond clause";
184
185 /* If a cond clause is detected that uses the alternate '=>' form, but does
186 * not hold a recipient element for the test result, a 'Missing recipient'
187 * error is signalled. */
188 static const char s_missing_recipient[] = "Missing recipient in";
189
190 /* If in a position where a variable name is required some other object is
191 * detected, a 'Bad variable' error is signalled. */
192 static const char s_bad_variable[] = "Bad variable";
193
194 /* Bindings for forms like 'let' and 'do' have to be given in a proper,
195 * possibly empty list. If any other object is detected in a place where a
196 * list of bindings was required, a 'Bad bindings' error is signalled. */
197 static const char s_bad_bindings[] = "Bad bindings";
198
199 /* Depending on the syntactic context, a binding has to be in the format
200 * (<variable> <expression>) or (<variable> <expression1> <expression2>).
201 * If anything else is detected in a place where a binding was expected, a
202 * 'Bad binding' error is signalled. */
203 static const char s_bad_binding[] = "Bad binding";
204
205 /* Some syntactic forms don't allow variable names to appear more than once in
206 * a list of bindings. If such a situation is nevertheless detected, a
207 * 'Duplicate binding' error is signalled. */
208 static const char s_duplicate_binding[] = "Duplicate binding";
209
210 /* If the exit form of a 'do' expression is not in the format
211 * (<test> <expression> ...)
212 * a 'Bad exit clause' error is signalled. */
213 static const char s_bad_exit_clause[] = "Bad exit clause";
214
215 /* The formal function arguments of a lambda expression have to be either a
216 * single symbol or a non-cyclic list. For anything else a 'Bad formals'
217 * error is signalled. */
218 static const char s_bad_formals[] = "Bad formals";
219
220 /* If in a lambda expression something else than a symbol is detected at a
221 * place where a formal function argument is required, a 'Bad formal' error is
222 * signalled. */
223 static const char s_bad_formal[] = "Bad formal";
224
225 /* If in the arguments list of a lambda expression an argument name occurs
226 * more than once, a 'Duplicate formal' error is signalled. */
227 static const char s_duplicate_formal[] = "Duplicate formal";
228
229 /* If the evaluation of an unquote-splicing expression gives something else
230 * than a proper list, a 'Non-list result for unquote-splicing' error is
231 * signalled. */
232 static const char s_splicing[] = "Non-list result for unquote-splicing";
233
234 /* If something else than an exact integer is detected as the argument for
235 * @slot-ref and @slot-set!, a 'Bad slot number' error is signalled. */
236 static const char s_bad_slot_number[] = "Bad slot number";
237
238
239 /* Signal a syntax error. We distinguish between the form that caused the
240 * error and the enclosing expression. The error message will print out as
241 * shown in the following pattern. The file name and line number are only
242 * given when they can be determined from the erroneous form or from the
243 * enclosing expression.
244 *
245 * <filename>: In procedure memoization:
246 * <filename>: In file <name>, line <nr>: <error-message> in <expression>. */
247
248 SCM_SYMBOL (syntax_error_key, "syntax-error");
249
250 /* The prototype is needed to indicate that the function does not return. */
251 static void
252 syntax_error (const char* const, const SCM, const SCM) SCM_NORETURN;
253
254 static void
255 syntax_error (const char* const msg, const SCM form, const SCM expr)
256 {
257 SCM msg_string = scm_from_locale_string (msg);
258 SCM filename = SCM_BOOL_F;
259 SCM linenr = SCM_BOOL_F;
260 const char *format;
261 SCM args;
262
263 if (SCM_CONSP (form))
264 {
265 filename = scm_source_property (form, scm_sym_filename);
266 linenr = scm_source_property (form, scm_sym_line);
267 }
268
269 if (scm_is_false (filename) && scm_is_false (linenr) && SCM_CONSP (expr))
270 {
271 filename = scm_source_property (expr, scm_sym_filename);
272 linenr = scm_source_property (expr, scm_sym_line);
273 }
274
275 if (!SCM_UNBNDP (expr))
276 {
277 if (scm_is_true (filename))
278 {
279 format = "In file ~S, line ~S: ~A ~S in expression ~S.";
280 args = scm_list_5 (filename, linenr, msg_string, form, expr);
281 }
282 else if (scm_is_true (linenr))
283 {
284 format = "In line ~S: ~A ~S in expression ~S.";
285 args = scm_list_4 (linenr, msg_string, form, expr);
286 }
287 else
288 {
289 format = "~A ~S in expression ~S.";
290 args = scm_list_3 (msg_string, form, expr);
291 }
292 }
293 else
294 {
295 if (scm_is_true (filename))
296 {
297 format = "In file ~S, line ~S: ~A ~S.";
298 args = scm_list_4 (filename, linenr, msg_string, form);
299 }
300 else if (scm_is_true (linenr))
301 {
302 format = "In line ~S: ~A ~S.";
303 args = scm_list_3 (linenr, msg_string, form);
304 }
305 else
306 {
307 format = "~A ~S.";
308 args = scm_list_2 (msg_string, form);
309 }
310 }
311
312 scm_error (syntax_error_key, "memoization", format, args, SCM_BOOL_F);
313 }
314
315
316 /* Shortcut macros to simplify syntax error handling. */
317 #define ASSERT_SYNTAX(cond, message, form) \
318 { if (!(cond)) syntax_error (message, form, SCM_UNDEFINED); }
319 #define ASSERT_SYNTAX_2(cond, message, form, expr) \
320 { if (!(cond)) syntax_error (message, form, expr); }
321
322 \f
323
324 /* {Ilocs}
325 *
326 * Ilocs are memoized references to variables in local environment frames.
327 * They are represented as three values: The relative offset of the
328 * environment frame, the number of the binding within that frame, and a
329 * boolean value indicating whether the binding is the last binding in the
330 * frame.
331 *
332 * Frame numbers have 11 bits, relative offsets have 12 bits.
333 */
334
335 #define SCM_ILOC00 SCM_MAKE_ITAG8(0L, scm_tc8_iloc)
336 #define SCM_IFRINC (0x00000100L)
337 #define SCM_ICDR (0x00080000L)
338 #define SCM_IDINC (0x00100000L)
339 #define SCM_IFRAME(n) ((long)((SCM_ICDR-SCM_IFRINC)>>8) \
340 & (SCM_UNPACK (n) >> 8))
341 #define SCM_IDIST(n) (SCM_UNPACK (n) >> 20)
342 #define SCM_ICDRP(n) (SCM_ICDR & SCM_UNPACK (n))
343 #define SCM_IDSTMSK (-SCM_IDINC)
344 #define SCM_IFRAMEMAX ((1<<11)-1)
345 #define SCM_IDISTMAX ((1<<12)-1)
346 #define SCM_MAKE_ILOC(frame_nr, binding_nr, last_p) \
347 SCM_PACK ( \
348 ((frame_nr) << 8) \
349 + ((binding_nr) << 20) \
350 + ((last_p) ? SCM_ICDR : 0) \
351 + scm_tc8_iloc )
352
353 void
354 scm_i_print_iloc (SCM iloc, SCM port)
355 {
356 scm_puts ("#@", port);
357 scm_intprint ((long) SCM_IFRAME (iloc), 10, port);
358 scm_putc (SCM_ICDRP (iloc) ? '-' : '+', port);
359 scm_intprint ((long) SCM_IDIST (iloc), 10, port);
360 }
361
362 #if (SCM_DEBUG_DEBUGGING_SUPPORT == 1)
363
364 SCM scm_dbg_make_iloc (SCM frame, SCM binding, SCM cdrp);
365
366 SCM_DEFINE (scm_dbg_make_iloc, "dbg-make-iloc", 3, 0, 0,
367 (SCM frame, SCM binding, SCM cdrp),
368 "Return a new iloc with frame offset @var{frame}, binding\n"
369 "offset @var{binding} and the cdr flag @var{cdrp}.")
370 #define FUNC_NAME s_scm_dbg_make_iloc
371 {
372 return SCM_MAKE_ILOC (scm_to_unsigned_integer (frame, 0, SCM_IFRAME_MAX),
373 scm_to_unsigned_integer (binding, 0, SCM_IDIST_MAX),
374 scm_is_true (cdrp));
375 }
376 #undef FUNC_NAME
377
378 SCM scm_dbg_iloc_p (SCM obj);
379
380 SCM_DEFINE (scm_dbg_iloc_p, "dbg-iloc?", 1, 0, 0,
381 (SCM obj),
382 "Return @code{#t} if @var{obj} is an iloc.")
383 #define FUNC_NAME s_scm_dbg_iloc_p
384 {
385 return scm_from_bool (SCM_ILOCP (obj));
386 }
387 #undef FUNC_NAME
388
389 #endif
390
391 \f
392
393 /* {Evaluator byte codes (isyms)}
394 */
395
396 #define ISYMNUM(n) (SCM_ITAG8_DATA (n))
397
398 /* This table must agree with the list of SCM_IM_ constants in tags.h */
399 static const char *const isymnames[] =
400 {
401 "#@and",
402 "#@begin",
403 "#@case",
404 "#@cond",
405 "#@do",
406 "#@if",
407 "#@lambda",
408 "#@let",
409 "#@let*",
410 "#@letrec",
411 "#@or",
412 "#@quote",
413 "#@set!",
414 "#@define",
415 "#@apply",
416 "#@call-with-current-continuation",
417 "#@dispatch",
418 "#@slot-ref",
419 "#@slot-set!",
420 "#@delay",
421 "#@future",
422 "#@call-with-values",
423 "#@else",
424 "#@arrow",
425 "#@nil-cond",
426 "#@bind"
427 };
428
429 void
430 scm_i_print_isym (SCM isym, SCM port)
431 {
432 const size_t isymnum = ISYMNUM (isym);
433 if (isymnum < (sizeof isymnames / sizeof (char *)))
434 scm_puts (isymnames[isymnum], port);
435 else
436 scm_ipruk ("isym", isym, port);
437 }
438
439 \f
440
441 /* The function lookup_symbol is used during memoization: Lookup the symbol in
442 * the environment. If there is no binding for the symbol, SCM_UNDEFINED is
443 * returned. If the symbol is a global variable, the variable object to which
444 * the symbol is bound is returned. Finally, if the symbol is a local
445 * variable the corresponding iloc object is returned. */
446
447 /* A helper function for lookup_symbol: Try to find the symbol in the top
448 * level environment frame. The function returns SCM_UNDEFINED if the symbol
449 * is unbound and it returns a variable object if the symbol is a global
450 * variable. */
451 static SCM
452 lookup_global_symbol (const SCM symbol, const SCM top_level)
453 {
454 const SCM variable = scm_sym2var (symbol, top_level, SCM_BOOL_F);
455 if (scm_is_false (variable))
456 return SCM_UNDEFINED;
457 else
458 return variable;
459 }
460
461 static SCM
462 lookup_symbol (const SCM symbol, const SCM env)
463 {
464 SCM frame_idx;
465 unsigned int frame_nr;
466
467 for (frame_idx = env, frame_nr = 0;
468 !SCM_NULLP (frame_idx);
469 frame_idx = SCM_CDR (frame_idx), ++frame_nr)
470 {
471 const SCM frame = SCM_CAR (frame_idx);
472 if (SCM_CONSP (frame))
473 {
474 /* frame holds a local environment frame */
475 SCM symbol_idx;
476 unsigned int symbol_nr;
477
478 for (symbol_idx = SCM_CAR (frame), symbol_nr = 0;
479 SCM_CONSP (symbol_idx);
480 symbol_idx = SCM_CDR (symbol_idx), ++symbol_nr)
481 {
482 if (scm_is_eq (SCM_CAR (symbol_idx), symbol))
483 /* found the symbol, therefore return the iloc */
484 return SCM_MAKE_ILOC (frame_nr, symbol_nr, 0);
485 }
486 if (scm_is_eq (symbol_idx, symbol))
487 /* found the symbol as the last element of the current frame */
488 return SCM_MAKE_ILOC (frame_nr, symbol_nr, 1);
489 }
490 else
491 {
492 /* no more local environment frames */
493 return lookup_global_symbol (symbol, frame);
494 }
495 }
496
497 return lookup_global_symbol (symbol, SCM_BOOL_F);
498 }
499
500
501 /* Return true if the symbol is - from the point of view of a macro
502 * transformer - a literal in the sense specified in chapter "pattern
503 * language" of R5RS. In the code below, however, we don't match the
504 * definition of R5RS exactly: It returns true if the identifier has no
505 * binding or if it is a syntactic keyword. */
506 static int
507 literal_p (const SCM symbol, const SCM env)
508 {
509 const SCM variable = lookup_symbol (symbol, env);
510 if (SCM_UNBNDP (variable))
511 return 1;
512 if (SCM_VARIABLEP (variable) && SCM_MACROP (SCM_VARIABLE_REF (variable)))
513 return 1;
514 else
515 return 0;
516 }
517
518
519 /* Return true if the expression is self-quoting in the memoized code. Thus,
520 * some other objects (like e. g. vectors) are reported as self-quoting, which
521 * according to R5RS would need to be quoted. */
522 static int
523 is_self_quoting_p (const SCM expr)
524 {
525 if (SCM_CONSP (expr))
526 return 0;
527 else if (scm_is_symbol (expr))
528 return 0;
529 else if (SCM_NULLP (expr))
530 return 0;
531 else return 1;
532 }
533
534
535 SCM_SYMBOL (sym_three_question_marks, "???");
536
537 static SCM
538 unmemoize_expression (const SCM expr, const SCM env)
539 {
540 if (SCM_ILOCP (expr))
541 {
542 SCM frame_idx;
543 unsigned long int frame_nr;
544 SCM symbol_idx;
545 unsigned long int symbol_nr;
546
547 for (frame_idx = env, frame_nr = SCM_IFRAME (expr);
548 frame_nr != 0;
549 frame_idx = SCM_CDR (frame_idx), --frame_nr)
550 ;
551 for (symbol_idx = SCM_CAAR (frame_idx), symbol_nr = SCM_IDIST (expr);
552 symbol_nr != 0;
553 symbol_idx = SCM_CDR (symbol_idx), --symbol_nr)
554 ;
555 return SCM_ICDRP (expr) ? symbol_idx : SCM_CAR (symbol_idx);
556 }
557 else if (SCM_VARIABLEP (expr))
558 {
559 const SCM sym = scm_module_reverse_lookup (scm_env_module (env), expr);
560 return scm_is_true (sym) ? sym : sym_three_question_marks;
561 }
562 else if (SCM_VECTORP (expr))
563 {
564 return scm_list_2 (scm_sym_quote, expr);
565 }
566 else if (!SCM_CONSP (expr))
567 {
568 return expr;
569 }
570 else if (SCM_ISYMP (SCM_CAR (expr)))
571 {
572 return unmemoize_builtin_macro (expr, env);
573 }
574 else
575 {
576 return unmemoize_exprs (expr, env);
577 }
578 }
579
580
581 static SCM
582 unmemoize_exprs (const SCM exprs, const SCM env)
583 {
584 SCM r_result = SCM_EOL;
585 SCM expr_idx = exprs;
586 SCM um_expr;
587
588 /* Note that due to the current lazy memoizer we may find partially memoized
589 * code during execution. In such code, lists of expressions that stem from
590 * a body form may start with an ISYM if the body itself has not yet been
591 * memoized. This isym is just an internal marker to indicate that the body
592 * still needs to be memoized. It is dropped during unmemoization. */
593 if (SCM_CONSP (expr_idx) && SCM_ISYMP (SCM_CAR (expr_idx)))
594 expr_idx = SCM_CDR (expr_idx);
595
596 /* Moreover, in partially memoized code we have to expect improper lists of
597 * expressions: On the one hand, for such code syntax checks have not yet
598 * fully been performed, on the other hand, there may be even legal code
599 * like '(a . b) appear as an improper list of expressions as long as the
600 * quote expression is still in its unmemoized form. For this reason, the
601 * following code handles improper lists of expressions until memoization
602 * and execution have been completely separated. */
603 for (; SCM_CONSP (expr_idx); expr_idx = SCM_CDR (expr_idx))
604 {
605 const SCM expr = SCM_CAR (expr_idx);
606 um_expr = unmemoize_expression (expr, env);
607 r_result = scm_cons (um_expr, r_result);
608 }
609 um_expr = unmemoize_expression (expr_idx, env);
610 if (!SCM_NULLP (r_result))
611 {
612 const SCM result = scm_reverse_x (r_result, SCM_UNDEFINED);
613 SCM_SETCDR (r_result, um_expr);
614 return result;
615 }
616 else
617 {
618 return um_expr;
619 }
620 }
621
622
623 /* Rewrite the body (which is given as the list of expressions forming the
624 * body) into its internal form. The internal form of a body (<expr> ...) is
625 * just the body itself, but prefixed with an ISYM that denotes to what kind
626 * of outer construct this body belongs: (<ISYM> <expr> ...). A lambda body
627 * starts with SCM_IM_LAMBDA, for example, a body of a let starts with
628 * SCM_IM_LET, etc.
629 *
630 * It is assumed that the calling expression has already made sure that the
631 * body is a proper list. */
632 static SCM
633 m_body (SCM op, SCM exprs)
634 {
635 /* Don't add another ISYM if one is present already. */
636 if (SCM_ISYMP (SCM_CAR (exprs)))
637 return exprs;
638 else
639 return scm_cons (op, exprs);
640 }
641
642
643 /* The function m_expand_body memoizes a proper list of expressions forming a
644 * body. This function takes care of dealing with internal defines and
645 * transforming them into an equivalent letrec expression. The list of
646 * expressions is rewritten in place. */
647
648 /* This is a helper function for m_expand_body. If the argument expression is
649 * a symbol that denotes a syntactic keyword, the corresponding macro object
650 * is returned, in all other cases the function returns SCM_UNDEFINED. */
651 static SCM
652 try_macro_lookup (const SCM expr, const SCM env)
653 {
654 if (scm_is_symbol (expr))
655 {
656 const SCM variable = lookup_symbol (expr, env);
657 if (SCM_VARIABLEP (variable))
658 {
659 const SCM value = SCM_VARIABLE_REF (variable);
660 if (SCM_MACROP (value))
661 return value;
662 }
663 }
664
665 return SCM_UNDEFINED;
666 }
667
668 /* This is a helper function for m_expand_body. It expands user macros,
669 * because for the correct translation of a body we need to know whether they
670 * expand to a definition. */
671 static SCM
672 expand_user_macros (SCM expr, const SCM env)
673 {
674 while (SCM_CONSP (expr))
675 {
676 const SCM car_expr = SCM_CAR (expr);
677 const SCM new_car = expand_user_macros (car_expr, env);
678 const SCM value = try_macro_lookup (new_car, env);
679
680 if (SCM_MACROP (value) && SCM_MACRO_TYPE (value) == 2)
681 {
682 /* User macros transform code into code. */
683 expr = scm_call_2 (SCM_MACRO_CODE (value), expr, env);
684 /* We need to reiterate on the transformed code. */
685 }
686 else
687 {
688 /* No user macro: return. */
689 SCM_SETCAR (expr, new_car);
690 return expr;
691 }
692 }
693
694 return expr;
695 }
696
697 /* This is a helper function for m_expand_body. It determines if a given form
698 * represents an application of a given built-in macro. The built-in macro to
699 * check for is identified by its syntactic keyword. The form is an
700 * application of the given macro if looking up the car of the form in the
701 * given environment actually returns the built-in macro. */
702 static int
703 is_system_macro_p (const SCM syntactic_keyword, const SCM form, const SCM env)
704 {
705 if (SCM_CONSP (form))
706 {
707 const SCM car_form = SCM_CAR (form);
708 const SCM value = try_macro_lookup (car_form, env);
709 if (SCM_BUILTIN_MACRO_P (value))
710 {
711 const SCM macro_name = scm_macro_name (value);
712 return scm_is_eq (macro_name, syntactic_keyword);
713 }
714 }
715
716 return 0;
717 }
718
719 static void
720 m_expand_body (const SCM forms, const SCM env)
721 {
722 /* The first body form can be skipped since it is known to be the ISYM that
723 * was prepended to the body by m_body. */
724 SCM cdr_forms = SCM_CDR (forms);
725 SCM form_idx = cdr_forms;
726 SCM definitions = SCM_EOL;
727 SCM sequence = SCM_EOL;
728
729 /* According to R5RS, the list of body forms consists of two parts: a number
730 * (maybe zero) of definitions, followed by a non-empty sequence of
731 * expressions. Each the definitions and the expressions may be grouped
732 * arbitrarily with begin, but it is not allowed to mix definitions and
733 * expressions. The task of the following loop therefore is to split the
734 * list of body forms into the list of definitions and the sequence of
735 * expressions. */
736 while (!SCM_NULLP (form_idx))
737 {
738 const SCM form = SCM_CAR (form_idx);
739 const SCM new_form = expand_user_macros (form, env);
740 if (is_system_macro_p (scm_sym_define, new_form, env))
741 {
742 definitions = scm_cons (new_form, definitions);
743 form_idx = SCM_CDR (form_idx);
744 }
745 else if (is_system_macro_p (scm_sym_begin, new_form, env))
746 {
747 /* We have encountered a group of forms. This has to be either a
748 * (possibly empty) group of (possibly further grouped) definitions,
749 * or a non-empty group of (possibly further grouped)
750 * expressions. */
751 const SCM grouped_forms = SCM_CDR (new_form);
752 unsigned int found_definition = 0;
753 unsigned int found_expression = 0;
754 SCM grouped_form_idx = grouped_forms;
755 while (!found_expression && !SCM_NULLP (grouped_form_idx))
756 {
757 const SCM inner_form = SCM_CAR (grouped_form_idx);
758 const SCM new_inner_form = expand_user_macros (inner_form, env);
759 if (is_system_macro_p (scm_sym_define, new_inner_form, env))
760 {
761 found_definition = 1;
762 definitions = scm_cons (new_inner_form, definitions);
763 grouped_form_idx = SCM_CDR (grouped_form_idx);
764 }
765 else if (is_system_macro_p (scm_sym_begin, new_inner_form, env))
766 {
767 const SCM inner_group = SCM_CDR (new_inner_form);
768 grouped_form_idx
769 = scm_append (scm_list_2 (inner_group,
770 SCM_CDR (grouped_form_idx)));
771 }
772 else
773 {
774 /* The group marks the start of the expressions of the body.
775 * We have to make sure that within the same group we have
776 * not encountered a definition before. */
777 ASSERT_SYNTAX (!found_definition, s_mixed_body_forms, form);
778 found_expression = 1;
779 grouped_form_idx = SCM_EOL;
780 }
781 }
782
783 /* We have finished processing the group. If we have not yet
784 * encountered an expression we continue processing the forms of the
785 * body to collect further definition forms. Otherwise, the group
786 * marks the start of the sequence of expressions of the body. */
787 if (!found_expression)
788 {
789 form_idx = SCM_CDR (form_idx);
790 }
791 else
792 {
793 sequence = form_idx;
794 form_idx = SCM_EOL;
795 }
796 }
797 else
798 {
799 /* We have detected a form which is no definition. This marks the
800 * start of the sequence of expressions of the body. */
801 sequence = form_idx;
802 form_idx = SCM_EOL;
803 }
804 }
805
806 /* FIXME: forms does not hold information about the file location. */
807 ASSERT_SYNTAX (SCM_CONSP (sequence), s_missing_body_expression, cdr_forms);
808
809 if (!SCM_NULLP (definitions))
810 {
811 SCM definition_idx;
812 SCM letrec_tail;
813 SCM letrec_expression;
814 SCM new_letrec_expression;
815
816 SCM bindings = SCM_EOL;
817 for (definition_idx = definitions;
818 !SCM_NULLP (definition_idx);
819 definition_idx = SCM_CDR (definition_idx))
820 {
821 const SCM definition = SCM_CAR (definition_idx);
822 const SCM canonical_definition = canonicalize_define (definition);
823 const SCM binding = SCM_CDR (canonical_definition);
824 bindings = scm_cons (binding, bindings);
825 };
826
827 letrec_tail = scm_cons (bindings, sequence);
828 /* FIXME: forms does not hold information about the file location. */
829 letrec_expression = scm_cons_source (forms, scm_sym_letrec, letrec_tail);
830 new_letrec_expression = scm_m_letrec (letrec_expression, env);
831 SCM_SETCAR (forms, new_letrec_expression);
832 SCM_SETCDR (forms, SCM_EOL);
833 }
834 else
835 {
836 SCM_SETCAR (forms, SCM_CAR (sequence));
837 SCM_SETCDR (forms, SCM_CDR (sequence));
838 }
839 }
840
841 static SCM
842 macroexp (SCM x, SCM env)
843 {
844 SCM res, proc, orig_sym;
845
846 /* Don't bother to produce error messages here. We get them when we
847 eventually execute the code for real. */
848
849 macro_tail:
850 orig_sym = SCM_CAR (x);
851 if (!scm_is_symbol (orig_sym))
852 return x;
853
854 {
855 SCM *proc_ptr = scm_lookupcar1 (x, env, 0);
856 if (proc_ptr == NULL)
857 {
858 /* We have lost the race. */
859 goto macro_tail;
860 }
861 proc = *proc_ptr;
862 }
863
864 /* Only handle memoizing macros. `Acros' and `macros' are really
865 special forms and should not be evaluated here. */
866
867 if (!SCM_MACROP (proc)
868 || (SCM_MACRO_TYPE (proc) != 2 && !SCM_BUILTIN_MACRO_P (proc)))
869 return x;
870
871 SCM_SETCAR (x, orig_sym); /* Undo memoizing effect of lookupcar */
872 res = scm_call_2 (SCM_MACRO_CODE (proc), x, env);
873
874 if (scm_ilength (res) <= 0)
875 res = scm_list_2 (SCM_IM_BEGIN, res);
876
877 SCM_DEFER_INTS;
878 SCM_SETCAR (x, SCM_CAR (res));
879 SCM_SETCDR (x, SCM_CDR (res));
880 SCM_ALLOW_INTS;
881
882 goto macro_tail;
883 }
884
885 /* Start of the memoizers for the standard R5RS builtin macros. */
886
887
888 SCM_SYNTAX (s_and, "and", scm_i_makbimacro, scm_m_and);
889 SCM_GLOBAL_SYMBOL (scm_sym_and, s_and);
890
891 SCM
892 scm_m_and (SCM expr, SCM env SCM_UNUSED)
893 {
894 const SCM cdr_expr = SCM_CDR (expr);
895 const long length = scm_ilength (cdr_expr);
896
897 ASSERT_SYNTAX (length >= 0, s_bad_expression, expr);
898
899 if (length == 0)
900 {
901 /* Special case: (and) is replaced by #t. */
902 return SCM_BOOL_T;
903 }
904 else
905 {
906 SCM_SETCAR (expr, SCM_IM_AND);
907 return expr;
908 }
909 }
910
911 static SCM
912 unmemoize_and (const SCM expr, const SCM env)
913 {
914 return scm_cons (scm_sym_and, unmemoize_exprs (SCM_CDR (expr), env));
915 }
916
917
918 SCM_SYNTAX (s_begin, "begin", scm_i_makbimacro, scm_m_begin);
919 SCM_GLOBAL_SYMBOL (scm_sym_begin, s_begin);
920
921 SCM
922 scm_m_begin (SCM expr, SCM env SCM_UNUSED)
923 {
924 const SCM cdr_expr = SCM_CDR (expr);
925 /* Dirk:FIXME:: An empty begin clause is not generally allowed by R5RS.
926 * That means, there should be a distinction between uses of begin where an
927 * empty clause is OK and where it is not. */
928 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 0, s_bad_expression, expr);
929
930 SCM_SETCAR (expr, SCM_IM_BEGIN);
931 return expr;
932 }
933
934 static SCM
935 unmemoize_begin (const SCM expr, const SCM env)
936 {
937 return scm_cons (scm_sym_begin, unmemoize_exprs (SCM_CDR (expr), env));
938 }
939
940
941 SCM_SYNTAX (s_case, "case", scm_i_makbimacro, scm_m_case);
942 SCM_GLOBAL_SYMBOL (scm_sym_case, s_case);
943 SCM_GLOBAL_SYMBOL (scm_sym_else, "else");
944
945 SCM
946 scm_m_case (SCM expr, SCM env)
947 {
948 SCM clauses;
949 SCM all_labels = SCM_EOL;
950
951 /* Check, whether 'else is a literal, i. e. not bound to a value. */
952 const int else_literal_p = literal_p (scm_sym_else, env);
953
954 const SCM cdr_expr = SCM_CDR (expr);
955 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 0, s_bad_expression, expr);
956 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 2, s_missing_clauses, expr);
957
958 clauses = SCM_CDR (cdr_expr);
959 while (!SCM_NULLP (clauses))
960 {
961 SCM labels;
962
963 const SCM clause = SCM_CAR (clauses);
964 ASSERT_SYNTAX_2 (scm_ilength (clause) >= 2,
965 s_bad_case_clause, clause, expr);
966
967 labels = SCM_CAR (clause);
968 if (SCM_CONSP (labels))
969 {
970 ASSERT_SYNTAX_2 (scm_ilength (labels) >= 0,
971 s_bad_case_labels, labels, expr);
972 all_labels = scm_append (scm_list_2 (labels, all_labels));
973 }
974 else if (SCM_NULLP (labels))
975 {
976 /* The list of labels is empty. According to R5RS this is allowed.
977 * It means that the sequence of expressions will never be executed.
978 * Therefore, as an optimization, we could remove the whole
979 * clause. */
980 }
981 else
982 {
983 ASSERT_SYNTAX_2 (scm_is_eq (labels, scm_sym_else) && else_literal_p,
984 s_bad_case_labels, labels, expr);
985 ASSERT_SYNTAX_2 (SCM_NULLP (SCM_CDR (clauses)),
986 s_misplaced_else_clause, clause, expr);
987 }
988
989 /* build the new clause */
990 if (scm_is_eq (labels, scm_sym_else))
991 SCM_SETCAR (clause, SCM_IM_ELSE);
992
993 clauses = SCM_CDR (clauses);
994 }
995
996 /* Check whether all case labels are distinct. */
997 for (; !SCM_NULLP (all_labels); all_labels = SCM_CDR (all_labels))
998 {
999 const SCM label = SCM_CAR (all_labels);
1000 ASSERT_SYNTAX_2 (scm_is_false (scm_c_memq (label, SCM_CDR (all_labels))),
1001 s_duplicate_case_label, label, expr);
1002 }
1003
1004 SCM_SETCAR (expr, SCM_IM_CASE);
1005 return expr;
1006 }
1007
1008 static SCM
1009 unmemoize_case (const SCM expr, const SCM env)
1010 {
1011 const SCM um_key_expr = unmemoize_expression (SCM_CADR (expr), env);
1012 SCM um_clauses = SCM_EOL;
1013 SCM clause_idx;
1014
1015 for (clause_idx = SCM_CDDR (expr);
1016 !SCM_NULLP (clause_idx);
1017 clause_idx = SCM_CDR (clause_idx))
1018 {
1019 const SCM clause = SCM_CAR (clause_idx);
1020 const SCM labels = SCM_CAR (clause);
1021 const SCM exprs = SCM_CDR (clause);
1022
1023 const SCM um_exprs = unmemoize_exprs (exprs, env);
1024 const SCM um_labels = (scm_is_eq (labels, SCM_IM_ELSE))
1025 ? scm_sym_else
1026 : scm_i_finite_list_copy (labels);
1027 const SCM um_clause = scm_cons (um_labels, um_exprs);
1028
1029 um_clauses = scm_cons (um_clause, um_clauses);
1030 }
1031 um_clauses = scm_reverse_x (um_clauses, SCM_UNDEFINED);
1032
1033 return scm_cons2 (scm_sym_case, um_key_expr, um_clauses);
1034 }
1035
1036
1037 SCM_SYNTAX (s_cond, "cond", scm_i_makbimacro, scm_m_cond);
1038 SCM_GLOBAL_SYMBOL (scm_sym_cond, s_cond);
1039 SCM_GLOBAL_SYMBOL (scm_sym_arrow, "=>");
1040
1041 SCM
1042 scm_m_cond (SCM expr, SCM env)
1043 {
1044 /* Check, whether 'else or '=> is a literal, i. e. not bound to a value. */
1045 const int else_literal_p = literal_p (scm_sym_else, env);
1046 const int arrow_literal_p = literal_p (scm_sym_arrow, env);
1047
1048 const SCM clauses = SCM_CDR (expr);
1049 SCM clause_idx;
1050
1051 ASSERT_SYNTAX (scm_ilength (clauses) >= 0, s_bad_expression, expr);
1052 ASSERT_SYNTAX (scm_ilength (clauses) >= 1, s_missing_clauses, expr);
1053
1054 for (clause_idx = clauses;
1055 !SCM_NULLP (clause_idx);
1056 clause_idx = SCM_CDR (clause_idx))
1057 {
1058 SCM test;
1059
1060 const SCM clause = SCM_CAR (clause_idx);
1061 const long length = scm_ilength (clause);
1062 ASSERT_SYNTAX_2 (length >= 1, s_bad_cond_clause, clause, expr);
1063
1064 test = SCM_CAR (clause);
1065 if (scm_is_eq (test, scm_sym_else) && else_literal_p)
1066 {
1067 const int last_clause_p = SCM_NULLP (SCM_CDR (clause_idx));
1068 ASSERT_SYNTAX_2 (length >= 2,
1069 s_bad_cond_clause, clause, expr);
1070 ASSERT_SYNTAX_2 (last_clause_p,
1071 s_misplaced_else_clause, clause, expr);
1072 SCM_SETCAR (clause, SCM_IM_ELSE);
1073 }
1074 else if (length >= 2
1075 && scm_is_eq (SCM_CADR (clause), scm_sym_arrow)
1076 && arrow_literal_p)
1077 {
1078 ASSERT_SYNTAX_2 (length > 2, s_missing_recipient, clause, expr);
1079 ASSERT_SYNTAX_2 (length == 3, s_extra_expression, clause, expr);
1080 SCM_SETCAR (SCM_CDR (clause), SCM_IM_ARROW);
1081 }
1082 }
1083
1084 SCM_SETCAR (expr, SCM_IM_COND);
1085 return expr;
1086 }
1087
1088 static SCM
1089 unmemoize_cond (const SCM expr, const SCM env)
1090 {
1091 SCM um_clauses = SCM_EOL;
1092 SCM clause_idx;
1093
1094 for (clause_idx = SCM_CDR (expr);
1095 !SCM_NULLP (clause_idx);
1096 clause_idx = SCM_CDR (clause_idx))
1097 {
1098 const SCM clause = SCM_CAR (clause_idx);
1099 const SCM sequence = SCM_CDR (clause);
1100 const SCM test = SCM_CAR (clause);
1101 SCM um_test;
1102 SCM um_sequence;
1103 SCM um_clause;
1104
1105 if (scm_is_eq (test, SCM_IM_ELSE))
1106 um_test = scm_sym_else;
1107 else
1108 um_test = unmemoize_expression (test, env);
1109
1110 if (!SCM_NULLP (sequence) && scm_is_eq (SCM_CAR (sequence),
1111 SCM_IM_ARROW))
1112 {
1113 const SCM target = SCM_CADR (sequence);
1114 const SCM um_target = unmemoize_expression (target, env);
1115 um_sequence = scm_list_2 (scm_sym_arrow, um_target);
1116 }
1117 else
1118 {
1119 um_sequence = unmemoize_exprs (sequence, env);
1120 }
1121
1122 um_clause = scm_cons (um_test, um_sequence);
1123 um_clauses = scm_cons (um_clause, um_clauses);
1124 }
1125 um_clauses = scm_reverse_x (um_clauses, SCM_UNDEFINED);
1126
1127 return scm_cons (scm_sym_cond, um_clauses);
1128 }
1129
1130
1131 SCM_SYNTAX (s_define, "define", scm_i_makbimacro, scm_m_define);
1132 SCM_GLOBAL_SYMBOL (scm_sym_define, s_define);
1133
1134 /* Guile provides an extension to R5RS' define syntax to represent function
1135 * currying in a compact way. With this extension, it is allowed to write
1136 * (define <nested-variable> <body>), where <nested-variable> has of one of
1137 * the forms (<nested-variable> <formals>), (<nested-variable> . <formal>),
1138 * (<variable> <formals>) or (<variable> . <formal>). As in R5RS, <formals>
1139 * should be either a sequence of zero or more variables, or a sequence of one
1140 * or more variables followed by a space-delimited period and another
1141 * variable. Each level of argument nesting wraps the <body> within another
1142 * lambda expression. For example, the following forms are allowed, each one
1143 * followed by an equivalent, more explicit implementation.
1144 * Example 1:
1145 * (define ((a b . c) . d) <body>) is equivalent to
1146 * (define a (lambda (b . c) (lambda d <body>)))
1147 * Example 2:
1148 * (define (((a) b) c . d) <body>) is equivalent to
1149 * (define a (lambda () (lambda (b) (lambda (c . d) <body>))))
1150 */
1151 /* Dirk:FIXME:: We should provide an implementation for 'define' in the R5RS
1152 * module that does not implement this extension. */
1153 static SCM
1154 canonicalize_define (const SCM expr)
1155 {
1156 SCM body;
1157 SCM variable;
1158
1159 const SCM cdr_expr = SCM_CDR (expr);
1160 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 0, s_bad_expression, expr);
1161 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 2, s_missing_expression, expr);
1162
1163 body = SCM_CDR (cdr_expr);
1164 variable = SCM_CAR (cdr_expr);
1165 while (SCM_CONSP (variable))
1166 {
1167 /* This while loop realizes function currying by variable nesting.
1168 * Variable is known to be a nested-variable. In every iteration of the
1169 * loop another level of lambda expression is created, starting with the
1170 * innermost one. Note that we don't check for duplicate formals here:
1171 * This will be done by the memoizer of the lambda expression. */
1172 const SCM formals = SCM_CDR (variable);
1173 const SCM tail = scm_cons (formals, body);
1174
1175 /* Add source properties to each new lambda expression: */
1176 const SCM lambda = scm_cons_source (variable, scm_sym_lambda, tail);
1177
1178 body = scm_list_1 (lambda);
1179 variable = SCM_CAR (variable);
1180 }
1181 ASSERT_SYNTAX_2 (scm_is_symbol (variable), s_bad_variable, variable, expr);
1182 ASSERT_SYNTAX (scm_ilength (body) == 1, s_expression, expr);
1183
1184 SCM_SETCAR (cdr_expr, variable);
1185 SCM_SETCDR (cdr_expr, body);
1186 return expr;
1187 }
1188
1189 /* According to section 5.2.1 of R5RS we first have to make sure that the
1190 * variable is bound, and then perform the (set! variable expression)
1191 * operation. This means, that within the expression we may already assign
1192 * values to variable: (define foo (begin (set! foo 1) (+ foo 1))) */
1193 SCM
1194 scm_m_define (SCM expr, SCM env)
1195 {
1196 ASSERT_SYNTAX (SCM_TOP_LEVEL (env), s_bad_define, expr);
1197
1198 {
1199 const SCM canonical_definition = canonicalize_define (expr);
1200 const SCM cdr_canonical_definition = SCM_CDR (canonical_definition);
1201 const SCM variable = SCM_CAR (cdr_canonical_definition);
1202 const SCM location
1203 = scm_sym2var (variable, scm_env_top_level (env), SCM_BOOL_T);
1204 const SCM value = scm_eval_car (SCM_CDR (cdr_canonical_definition), env);
1205
1206 if (SCM_REC_PROCNAMES_P)
1207 {
1208 SCM tmp = value;
1209 while (SCM_MACROP (tmp))
1210 tmp = SCM_MACRO_CODE (tmp);
1211 if (SCM_CLOSUREP (tmp)
1212 /* Only the first definition determines the name. */
1213 && scm_is_false (scm_procedure_property (tmp, scm_sym_name)))
1214 scm_set_procedure_property_x (tmp, scm_sym_name, variable);
1215 }
1216
1217 SCM_VARIABLE_SET (location, value);
1218
1219 return SCM_UNSPECIFIED;
1220 }
1221 }
1222
1223
1224 /* This is a helper function for forms (<keyword> <expression>) that are
1225 * transformed into (#@<keyword> '() <memoized_expression>) in order to allow
1226 * for easy creation of a thunk (i. e. a closure without arguments) using the
1227 * ('() <memoized_expression>) tail of the memoized form. */
1228 static SCM
1229 memoize_as_thunk_prototype (const SCM expr, const SCM env SCM_UNUSED)
1230 {
1231 const SCM cdr_expr = SCM_CDR (expr);
1232 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 0, s_bad_expression, expr);
1233 ASSERT_SYNTAX (scm_ilength (cdr_expr) == 1, s_expression, expr);
1234
1235 SCM_SETCDR (expr, scm_cons (SCM_EOL, cdr_expr));
1236
1237 return expr;
1238 }
1239
1240
1241 SCM_SYNTAX (s_delay, "delay", scm_i_makbimacro, scm_m_delay);
1242 SCM_GLOBAL_SYMBOL (scm_sym_delay, s_delay);
1243
1244 /* Promises are implemented as closures with an empty parameter list. Thus,
1245 * (delay <expression>) is transformed into (#@delay '() <expression>), where
1246 * the empty list represents the empty parameter list. This representation
1247 * allows for easy creation of the closure during evaluation. */
1248 SCM
1249 scm_m_delay (SCM expr, SCM env)
1250 {
1251 const SCM new_expr = memoize_as_thunk_prototype (expr, env);
1252 SCM_SETCAR (new_expr, SCM_IM_DELAY);
1253 return new_expr;
1254 }
1255
1256 static SCM
1257 unmemoize_delay (const SCM expr, const SCM env)
1258 {
1259 const SCM thunk_expr = SCM_CADDR (expr);
1260 return scm_list_2 (scm_sym_delay, unmemoize_expression (thunk_expr, env));
1261 }
1262
1263
1264 SCM_SYNTAX(s_do, "do", scm_i_makbimacro, scm_m_do);
1265 SCM_GLOBAL_SYMBOL(scm_sym_do, s_do);
1266
1267 /* DO gets the most radically altered syntax. The order of the vars is
1268 * reversed here. During the evaluation this allows for simple consing of the
1269 * results of the inits and steps:
1270
1271 (do ((<var1> <init1> <step1>)
1272 (<var2> <init2>)
1273 ... )
1274 (<test> <return>)
1275 <body>)
1276
1277 ;; becomes
1278
1279 (#@do (<init1> <init2> ... <initn>)
1280 (varn ... var2 var1)
1281 (<test> <return>)
1282 (<body>)
1283 <step1> <step2> ... <stepn>) ;; missing steps replaced by var
1284 */
1285 SCM
1286 scm_m_do (SCM expr, SCM env SCM_UNUSED)
1287 {
1288 SCM variables = SCM_EOL;
1289 SCM init_forms = SCM_EOL;
1290 SCM step_forms = SCM_EOL;
1291 SCM binding_idx;
1292 SCM cddr_expr;
1293 SCM exit_clause;
1294 SCM commands;
1295 SCM tail;
1296
1297 const SCM cdr_expr = SCM_CDR (expr);
1298 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 0, s_bad_expression, expr);
1299 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 2, s_missing_expression, expr);
1300
1301 /* Collect variables, init and step forms. */
1302 binding_idx = SCM_CAR (cdr_expr);
1303 ASSERT_SYNTAX_2 (scm_ilength (binding_idx) >= 0,
1304 s_bad_bindings, binding_idx, expr);
1305 for (; !SCM_NULLP (binding_idx); binding_idx = SCM_CDR (binding_idx))
1306 {
1307 const SCM binding = SCM_CAR (binding_idx);
1308 const long length = scm_ilength (binding);
1309 ASSERT_SYNTAX_2 (length == 2 || length == 3,
1310 s_bad_binding, binding, expr);
1311
1312 {
1313 const SCM name = SCM_CAR (binding);
1314 const SCM init = SCM_CADR (binding);
1315 const SCM step = (length == 2) ? name : SCM_CADDR (binding);
1316 ASSERT_SYNTAX_2 (scm_is_symbol (name), s_bad_variable, name, expr);
1317 ASSERT_SYNTAX_2 (scm_is_false (scm_c_memq (name, variables)),
1318 s_duplicate_binding, name, expr);
1319
1320 variables = scm_cons (name, variables);
1321 init_forms = scm_cons (init, init_forms);
1322 step_forms = scm_cons (step, step_forms);
1323 }
1324 }
1325 init_forms = scm_reverse_x (init_forms, SCM_UNDEFINED);
1326 step_forms = scm_reverse_x (step_forms, SCM_UNDEFINED);
1327
1328 /* Memoize the test form and the exit sequence. */
1329 cddr_expr = SCM_CDR (cdr_expr);
1330 exit_clause = SCM_CAR (cddr_expr);
1331 ASSERT_SYNTAX_2 (scm_ilength (exit_clause) >= 1,
1332 s_bad_exit_clause, exit_clause, expr);
1333
1334 commands = SCM_CDR (cddr_expr);
1335 tail = scm_cons2 (exit_clause, commands, step_forms);
1336 tail = scm_cons2 (init_forms, variables, tail);
1337 SCM_SETCAR (expr, SCM_IM_DO);
1338 SCM_SETCDR (expr, tail);
1339 return expr;
1340 }
1341
1342 static SCM
1343 unmemoize_do (const SCM expr, const SCM env)
1344 {
1345 const SCM cdr_expr = SCM_CDR (expr);
1346 const SCM cddr_expr = SCM_CDR (cdr_expr);
1347 const SCM rnames = SCM_CAR (cddr_expr);
1348 const SCM extended_env = SCM_EXTEND_ENV (rnames, SCM_EOL, env);
1349 const SCM cdddr_expr = SCM_CDR (cddr_expr);
1350 const SCM exit_sequence = SCM_CAR (cdddr_expr);
1351 const SCM um_exit_sequence = unmemoize_exprs (exit_sequence, extended_env);
1352 const SCM cddddr_expr = SCM_CDR (cdddr_expr);
1353 const SCM um_body = unmemoize_exprs (SCM_CAR (cddddr_expr), extended_env);
1354
1355 /* build transformed binding list */
1356 SCM um_names = scm_reverse (rnames);
1357 SCM um_inits = unmemoize_exprs (SCM_CAR (cdr_expr), env);
1358 SCM um_steps = unmemoize_exprs (SCM_CDR (cddddr_expr), extended_env);
1359 SCM um_bindings = SCM_EOL;
1360 while (!SCM_NULLP (um_names))
1361 {
1362 const SCM name = SCM_CAR (um_names);
1363 const SCM init = SCM_CAR (um_inits);
1364 SCM step = SCM_CAR (um_steps);
1365 step = scm_is_eq (step, name) ? SCM_EOL : scm_list_1 (step);
1366
1367 um_bindings = scm_cons (scm_cons2 (name, init, step), um_bindings);
1368
1369 um_names = SCM_CDR (um_names);
1370 um_inits = SCM_CDR (um_inits);
1371 um_steps = SCM_CDR (um_steps);
1372 }
1373 um_bindings = scm_reverse_x (um_bindings, SCM_UNDEFINED);
1374
1375 return scm_cons (scm_sym_do,
1376 scm_cons2 (um_bindings, um_exit_sequence, um_body));
1377 }
1378
1379
1380 SCM_SYNTAX (s_if, "if", scm_i_makbimacro, scm_m_if);
1381 SCM_GLOBAL_SYMBOL (scm_sym_if, s_if);
1382
1383 SCM
1384 scm_m_if (SCM expr, SCM env SCM_UNUSED)
1385 {
1386 const SCM cdr_expr = SCM_CDR (expr);
1387 const long length = scm_ilength (cdr_expr);
1388 ASSERT_SYNTAX (length == 2 || length == 3, s_expression, expr);
1389 SCM_SETCAR (expr, SCM_IM_IF);
1390 return expr;
1391 }
1392
1393 static SCM
1394 unmemoize_if (const SCM expr, const SCM env)
1395 {
1396 const SCM cdr_expr = SCM_CDR (expr);
1397 const SCM um_condition = unmemoize_expression (SCM_CAR (cdr_expr), env);
1398 const SCM cddr_expr = SCM_CDR (cdr_expr);
1399 const SCM um_then = unmemoize_expression (SCM_CAR (cddr_expr), env);
1400 const SCM cdddr_expr = SCM_CDR (cddr_expr);
1401
1402 if (SCM_NULLP (cdddr_expr))
1403 {
1404 return scm_list_3 (scm_sym_if, um_condition, um_then);
1405 }
1406 else
1407 {
1408 const SCM um_else = unmemoize_expression (SCM_CAR (cdddr_expr), env);
1409 return scm_list_4 (scm_sym_if, um_condition, um_then, um_else);
1410 }
1411 }
1412
1413
1414 SCM_SYNTAX (s_lambda, "lambda", scm_i_makbimacro, scm_m_lambda);
1415 SCM_GLOBAL_SYMBOL (scm_sym_lambda, s_lambda);
1416
1417 /* A helper function for memoize_lambda to support checking for duplicate
1418 * formal arguments: Return true if OBJ is `eq?' to one of the elements of
1419 * LIST or to the cdr of the last cons. Therefore, LIST may have any of the
1420 * forms that a formal argument can have:
1421 * <rest>, (<arg1> ...), (<arg1> ... . <rest>) */
1422 static int
1423 c_improper_memq (SCM obj, SCM list)
1424 {
1425 for (; SCM_CONSP (list); list = SCM_CDR (list))
1426 {
1427 if (scm_is_eq (SCM_CAR (list), obj))
1428 return 1;
1429 }
1430 return scm_is_eq (list, obj);
1431 }
1432
1433 SCM
1434 scm_m_lambda (SCM expr, SCM env SCM_UNUSED)
1435 {
1436 SCM formals;
1437 SCM formals_idx;
1438 SCM cddr_expr;
1439 int documentation;
1440 SCM body;
1441 SCM new_body;
1442
1443 const SCM cdr_expr = SCM_CDR (expr);
1444 const long length = scm_ilength (cdr_expr);
1445 ASSERT_SYNTAX (length >= 0, s_bad_expression, expr);
1446 ASSERT_SYNTAX (length >= 2, s_missing_expression, expr);
1447
1448 /* Before iterating the list of formal arguments, make sure the formals
1449 * actually are given as either a symbol or a non-cyclic list. */
1450 formals = SCM_CAR (cdr_expr);
1451 if (SCM_CONSP (formals))
1452 {
1453 /* Dirk:FIXME:: We should check for a cyclic list of formals, and if
1454 * detected, report a 'Bad formals' error. */
1455 }
1456 else
1457 {
1458 ASSERT_SYNTAX_2 (scm_is_symbol (formals) || SCM_NULLP (formals),
1459 s_bad_formals, formals, expr);
1460 }
1461
1462 /* Now iterate the list of formal arguments to check if all formals are
1463 * symbols, and that there are no duplicates. */
1464 formals_idx = formals;
1465 while (SCM_CONSP (formals_idx))
1466 {
1467 const SCM formal = SCM_CAR (formals_idx);
1468 const SCM next_idx = SCM_CDR (formals_idx);
1469 ASSERT_SYNTAX_2 (scm_is_symbol (formal), s_bad_formal, formal, expr);
1470 ASSERT_SYNTAX_2 (!c_improper_memq (formal, next_idx),
1471 s_duplicate_formal, formal, expr);
1472 formals_idx = next_idx;
1473 }
1474 ASSERT_SYNTAX_2 (SCM_NULLP (formals_idx) || scm_is_symbol (formals_idx),
1475 s_bad_formal, formals_idx, expr);
1476
1477 /* Memoize the body. Keep a potential documentation string. */
1478 /* Dirk:FIXME:: We should probably extract the documentation string to
1479 * some external database. Otherwise it will slow down execution, since
1480 * the documentation string will have to be skipped with every execution
1481 * of the closure. */
1482 cddr_expr = SCM_CDR (cdr_expr);
1483 documentation = (length >= 3 && scm_is_string (SCM_CAR (cddr_expr)));
1484 body = documentation ? SCM_CDR (cddr_expr) : cddr_expr;
1485 new_body = m_body (SCM_IM_LAMBDA, body);
1486
1487 SCM_SETCAR (expr, SCM_IM_LAMBDA);
1488 if (documentation)
1489 SCM_SETCDR (cddr_expr, new_body);
1490 else
1491 SCM_SETCDR (cdr_expr, new_body);
1492 return expr;
1493 }
1494
1495 static SCM
1496 unmemoize_lambda (const SCM expr, const SCM env)
1497 {
1498 const SCM formals = SCM_CADR (expr);
1499 const SCM body = SCM_CDDR (expr);
1500
1501 const SCM new_env = SCM_EXTEND_ENV (formals, SCM_EOL, env);
1502 const SCM um_formals = scm_i_finite_list_copy (formals);
1503 const SCM um_body = unmemoize_exprs (body, new_env);
1504
1505 return scm_cons2 (scm_sym_lambda, um_formals, um_body);
1506 }
1507
1508
1509 /* Check if the format of the bindings is ((<symbol> <init-form>) ...). */
1510 static void
1511 check_bindings (const SCM bindings, const SCM expr)
1512 {
1513 SCM binding_idx;
1514
1515 ASSERT_SYNTAX_2 (scm_ilength (bindings) >= 0,
1516 s_bad_bindings, bindings, expr);
1517
1518 binding_idx = bindings;
1519 for (; !SCM_NULLP (binding_idx); binding_idx = SCM_CDR (binding_idx))
1520 {
1521 SCM name; /* const */
1522
1523 const SCM binding = SCM_CAR (binding_idx);
1524 ASSERT_SYNTAX_2 (scm_ilength (binding) == 2,
1525 s_bad_binding, binding, expr);
1526
1527 name = SCM_CAR (binding);
1528 ASSERT_SYNTAX_2 (scm_is_symbol (name), s_bad_variable, name, expr);
1529 }
1530 }
1531
1532
1533 /* The bindings, which must have the format ((v1 i1) (v2 i2) ... (vn in)), are
1534 * transformed to the lists (vn ... v2 v1) and (i1 i2 ... in). That is, the
1535 * variables are returned in a list with their order reversed, and the init
1536 * forms are returned in a list in the same order as they are given in the
1537 * bindings. If a duplicate variable name is detected, an error is
1538 * signalled. */
1539 static void
1540 transform_bindings (
1541 const SCM bindings, const SCM expr,
1542 SCM *const rvarptr, SCM *const initptr )
1543 {
1544 SCM rvariables = SCM_EOL;
1545 SCM rinits = SCM_EOL;
1546 SCM binding_idx = bindings;
1547 for (; !SCM_NULLP (binding_idx); binding_idx = SCM_CDR (binding_idx))
1548 {
1549 const SCM binding = SCM_CAR (binding_idx);
1550 const SCM cdr_binding = SCM_CDR (binding);
1551 const SCM name = SCM_CAR (binding);
1552 ASSERT_SYNTAX_2 (scm_is_false (scm_c_memq (name, rvariables)),
1553 s_duplicate_binding, name, expr);
1554 rvariables = scm_cons (name, rvariables);
1555 rinits = scm_cons (SCM_CAR (cdr_binding), rinits);
1556 }
1557 *rvarptr = rvariables;
1558 *initptr = scm_reverse_x (rinits, SCM_UNDEFINED);
1559 }
1560
1561
1562 SCM_SYNTAX(s_let, "let", scm_i_makbimacro, scm_m_let);
1563 SCM_GLOBAL_SYMBOL(scm_sym_let, s_let);
1564
1565 /* This function is a helper function for memoize_let. It transforms
1566 * (let name ((var init) ...) body ...) into
1567 * ((letrec ((name (lambda (var ...) body ...))) name) init ...)
1568 * and memoizes the expression. It is assumed that the caller has checked
1569 * that name is a symbol and that there are bindings and a body. */
1570 static SCM
1571 memoize_named_let (const SCM expr, const SCM env SCM_UNUSED)
1572 {
1573 SCM rvariables;
1574 SCM variables;
1575 SCM inits;
1576
1577 const SCM cdr_expr = SCM_CDR (expr);
1578 const SCM name = SCM_CAR (cdr_expr);
1579 const SCM cddr_expr = SCM_CDR (cdr_expr);
1580 const SCM bindings = SCM_CAR (cddr_expr);
1581 check_bindings (bindings, expr);
1582
1583 transform_bindings (bindings, expr, &rvariables, &inits);
1584 variables = scm_reverse_x (rvariables, SCM_UNDEFINED);
1585
1586 {
1587 const SCM let_body = SCM_CDR (cddr_expr);
1588 const SCM lambda_body = m_body (SCM_IM_LET, let_body);
1589 const SCM lambda_tail = scm_cons (variables, lambda_body);
1590 const SCM lambda_form = scm_cons_source (expr, scm_sym_lambda, lambda_tail);
1591
1592 const SCM rvar = scm_list_1 (name);
1593 const SCM init = scm_list_1 (lambda_form);
1594 const SCM body = m_body (SCM_IM_LET, scm_list_1 (name));
1595 const SCM letrec_tail = scm_cons (rvar, scm_cons (init, body));
1596 const SCM letrec_form = scm_cons_source (expr, SCM_IM_LETREC, letrec_tail);
1597 return scm_cons_source (expr, letrec_form, inits);
1598 }
1599 }
1600
1601 /* (let ((v1 i1) (v2 i2) ...) body) with variables v1 .. vn and initializers
1602 * i1 .. in is transformed to (#@let (vn ... v2 v1) (i1 i2 ...) body). */
1603 SCM
1604 scm_m_let (SCM expr, SCM env)
1605 {
1606 SCM bindings;
1607
1608 const SCM cdr_expr = SCM_CDR (expr);
1609 const long length = scm_ilength (cdr_expr);
1610 ASSERT_SYNTAX (length >= 0, s_bad_expression, expr);
1611 ASSERT_SYNTAX (length >= 2, s_missing_expression, expr);
1612
1613 bindings = SCM_CAR (cdr_expr);
1614 if (scm_is_symbol (bindings))
1615 {
1616 ASSERT_SYNTAX (length >= 3, s_missing_expression, expr);
1617 return memoize_named_let (expr, env);
1618 }
1619
1620 check_bindings (bindings, expr);
1621 if (SCM_NULLP (bindings) || SCM_NULLP (SCM_CDR (bindings)))
1622 {
1623 /* Special case: no bindings or single binding => let* is faster. */
1624 const SCM body = m_body (SCM_IM_LET, SCM_CDR (cdr_expr));
1625 return scm_m_letstar (scm_cons2 (SCM_CAR (expr), bindings, body), env);
1626 }
1627 else
1628 {
1629 /* plain let */
1630 SCM rvariables;
1631 SCM inits;
1632 transform_bindings (bindings, expr, &rvariables, &inits);
1633
1634 {
1635 const SCM new_body = m_body (SCM_IM_LET, SCM_CDR (cdr_expr));
1636 const SCM new_tail = scm_cons2 (rvariables, inits, new_body);
1637 SCM_SETCAR (expr, SCM_IM_LET);
1638 SCM_SETCDR (expr, new_tail);
1639 return expr;
1640 }
1641 }
1642 }
1643
1644 static SCM
1645 build_binding_list (SCM rnames, SCM rinits)
1646 {
1647 SCM bindings = SCM_EOL;
1648 while (!SCM_NULLP (rnames))
1649 {
1650 const SCM binding = scm_list_2 (SCM_CAR (rnames), SCM_CAR (rinits));
1651 bindings = scm_cons (binding, bindings);
1652 rnames = SCM_CDR (rnames);
1653 rinits = SCM_CDR (rinits);
1654 }
1655 return bindings;
1656 }
1657
1658 static SCM
1659 unmemoize_let (const SCM expr, const SCM env)
1660 {
1661 const SCM cdr_expr = SCM_CDR (expr);
1662 const SCM um_rnames = SCM_CAR (cdr_expr);
1663 const SCM extended_env = SCM_EXTEND_ENV (um_rnames, SCM_EOL, env);
1664 const SCM cddr_expr = SCM_CDR (cdr_expr);
1665 const SCM um_inits = unmemoize_exprs (SCM_CAR (cddr_expr), env);
1666 const SCM um_rinits = scm_reverse_x (um_inits, SCM_UNDEFINED);
1667 const SCM um_bindings = build_binding_list (um_rnames, um_rinits);
1668 const SCM um_body = unmemoize_exprs (SCM_CDR (cddr_expr), extended_env);
1669
1670 return scm_cons2 (scm_sym_let, um_bindings, um_body);
1671 }
1672
1673
1674 SCM_SYNTAX(s_letrec, "letrec", scm_i_makbimacro, scm_m_letrec);
1675 SCM_GLOBAL_SYMBOL(scm_sym_letrec, s_letrec);
1676
1677 SCM
1678 scm_m_letrec (SCM expr, SCM env)
1679 {
1680 SCM bindings;
1681
1682 const SCM cdr_expr = SCM_CDR (expr);
1683 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 0, s_bad_expression, expr);
1684 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 2, s_missing_expression, expr);
1685
1686 bindings = SCM_CAR (cdr_expr);
1687 if (SCM_NULLP (bindings))
1688 {
1689 /* no bindings, let* is executed faster */
1690 SCM body = m_body (SCM_IM_LETREC, SCM_CDR (cdr_expr));
1691 return scm_m_letstar (scm_cons2 (SCM_CAR (expr), SCM_EOL, body), env);
1692 }
1693 else
1694 {
1695 SCM rvariables;
1696 SCM inits;
1697 SCM new_body;
1698
1699 check_bindings (bindings, expr);
1700 transform_bindings (bindings, expr, &rvariables, &inits);
1701 new_body = m_body (SCM_IM_LETREC, SCM_CDR (cdr_expr));
1702 return scm_cons2 (SCM_IM_LETREC, rvariables, scm_cons (inits, new_body));
1703 }
1704 }
1705
1706 static SCM
1707 unmemoize_letrec (const SCM expr, const SCM env)
1708 {
1709 const SCM cdr_expr = SCM_CDR (expr);
1710 const SCM um_rnames = SCM_CAR (cdr_expr);
1711 const SCM extended_env = SCM_EXTEND_ENV (um_rnames, SCM_EOL, env);
1712 const SCM cddr_expr = SCM_CDR (cdr_expr);
1713 const SCM um_inits = unmemoize_exprs (SCM_CAR (cddr_expr), extended_env);
1714 const SCM um_rinits = scm_reverse_x (um_inits, SCM_UNDEFINED);
1715 const SCM um_bindings = build_binding_list (um_rnames, um_rinits);
1716 const SCM um_body = unmemoize_exprs (SCM_CDR (cddr_expr), extended_env);
1717
1718 return scm_cons2 (scm_sym_letrec, um_bindings, um_body);
1719 }
1720
1721
1722
1723 SCM_SYNTAX (s_letstar, "let*", scm_i_makbimacro, scm_m_letstar);
1724 SCM_GLOBAL_SYMBOL (scm_sym_letstar, s_letstar);
1725
1726 /* (let* ((v1 i1) (v2 i2) ...) body) with variables v1 .. vn and initializers
1727 * i1 .. in is transformed into the form (#@let* (v1 i1 v2 i2 ...) body). */
1728 SCM
1729 scm_m_letstar (SCM expr, SCM env SCM_UNUSED)
1730 {
1731 SCM binding_idx;
1732 SCM new_body;
1733
1734 const SCM cdr_expr = SCM_CDR (expr);
1735 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 0, s_bad_expression, expr);
1736 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 2, s_missing_expression, expr);
1737
1738 binding_idx = SCM_CAR (cdr_expr);
1739 check_bindings (binding_idx, expr);
1740
1741 /* Transform ((v1 i1) (v2 i2) ...) into (v1 i1 v2 i2 ...). The
1742 * transformation is done in place. At the beginning of one iteration of
1743 * the loop the variable binding_idx holds the form
1744 * P1:( (vn . P2:(in . ())) . P3:( (vn+1 in+1) ... ) ),
1745 * where P1, P2 and P3 indicate the pairs, that are relevant for the
1746 * transformation. P1 and P2 are modified in the loop, P3 remains
1747 * untouched. After the execution of the loop, P1 will hold
1748 * P1:( vn . P2:(in . P3:( (vn+1 in+1) ... )) )
1749 * and binding_idx will hold P3. */
1750 while (!SCM_NULLP (binding_idx))
1751 {
1752 const SCM cdr_binding_idx = SCM_CDR (binding_idx); /* remember P3 */
1753 const SCM binding = SCM_CAR (binding_idx);
1754 const SCM name = SCM_CAR (binding);
1755 const SCM cdr_binding = SCM_CDR (binding);
1756
1757 SCM_SETCDR (cdr_binding, cdr_binding_idx); /* update P2 */
1758 SCM_SETCAR (binding_idx, name); /* update P1 */
1759 SCM_SETCDR (binding_idx, cdr_binding); /* update P1 */
1760
1761 binding_idx = cdr_binding_idx; /* continue with P3 */
1762 }
1763
1764 new_body = m_body (SCM_IM_LETSTAR, SCM_CDR (cdr_expr));
1765 SCM_SETCAR (expr, SCM_IM_LETSTAR);
1766 /* the bindings have been changed in place */
1767 SCM_SETCDR (cdr_expr, new_body);
1768 return expr;
1769 }
1770
1771 static SCM
1772 unmemoize_letstar (const SCM expr, const SCM env)
1773 {
1774 const SCM cdr_expr = SCM_CDR (expr);
1775 const SCM body = SCM_CDR (cdr_expr);
1776 SCM bindings = SCM_CAR (cdr_expr);
1777 SCM um_bindings = SCM_EOL;
1778 SCM extended_env = env;
1779 SCM um_body;
1780
1781 while (!SCM_NULLP (bindings))
1782 {
1783 const SCM variable = SCM_CAR (bindings);
1784 const SCM init = SCM_CADR (bindings);
1785 const SCM um_init = unmemoize_expression (init, extended_env);
1786 um_bindings = scm_cons (scm_list_2 (variable, um_init), um_bindings);
1787 extended_env = SCM_EXTEND_ENV (variable, SCM_BOOL_F, extended_env);
1788 bindings = SCM_CDDR (bindings);
1789 }
1790 um_bindings = scm_reverse_x (um_bindings, SCM_UNDEFINED);
1791
1792 um_body = unmemoize_exprs (body, extended_env);
1793
1794 return scm_cons2 (scm_sym_letstar, um_bindings, um_body);
1795 }
1796
1797
1798 SCM_SYNTAX (s_or, "or", scm_i_makbimacro, scm_m_or);
1799 SCM_GLOBAL_SYMBOL (scm_sym_or, s_or);
1800
1801 SCM
1802 scm_m_or (SCM expr, SCM env SCM_UNUSED)
1803 {
1804 const SCM cdr_expr = SCM_CDR (expr);
1805 const long length = scm_ilength (cdr_expr);
1806
1807 ASSERT_SYNTAX (length >= 0, s_bad_expression, expr);
1808
1809 if (length == 0)
1810 {
1811 /* Special case: (or) is replaced by #f. */
1812 return SCM_BOOL_F;
1813 }
1814 else
1815 {
1816 SCM_SETCAR (expr, SCM_IM_OR);
1817 return expr;
1818 }
1819 }
1820
1821 static SCM
1822 unmemoize_or (const SCM expr, const SCM env)
1823 {
1824 return scm_cons (scm_sym_or, unmemoize_exprs (SCM_CDR (expr), env));
1825 }
1826
1827
1828 SCM_SYNTAX (s_quasiquote, "quasiquote", scm_makacro, scm_m_quasiquote);
1829 SCM_GLOBAL_SYMBOL (scm_sym_quasiquote, s_quasiquote);
1830 SCM_GLOBAL_SYMBOL (scm_sym_unquote, "unquote");
1831 SCM_GLOBAL_SYMBOL (scm_sym_uq_splicing, "unquote-splicing");
1832
1833 /* Internal function to handle a quasiquotation: 'form' is the parameter in
1834 * the call (quasiquotation form), 'env' is the environment where unquoted
1835 * expressions will be evaluated, and 'depth' is the current quasiquotation
1836 * nesting level and is known to be greater than zero. */
1837 static SCM
1838 iqq (SCM form, SCM env, unsigned long int depth)
1839 {
1840 if (SCM_CONSP (form))
1841 {
1842 const SCM tmp = SCM_CAR (form);
1843 if (scm_is_eq (tmp, scm_sym_quasiquote))
1844 {
1845 const SCM args = SCM_CDR (form);
1846 ASSERT_SYNTAX (scm_ilength (args) == 1, s_expression, form);
1847 return scm_list_2 (tmp, iqq (SCM_CAR (args), env, depth + 1));
1848 }
1849 else if (scm_is_eq (tmp, scm_sym_unquote))
1850 {
1851 const SCM args = SCM_CDR (form);
1852 ASSERT_SYNTAX (scm_ilength (args) == 1, s_expression, form);
1853 if (depth - 1 == 0)
1854 return scm_eval_car (args, env);
1855 else
1856 return scm_list_2 (tmp, iqq (SCM_CAR (args), env, depth - 1));
1857 }
1858 else if (SCM_CONSP (tmp)
1859 && scm_is_eq (SCM_CAR (tmp), scm_sym_uq_splicing))
1860 {
1861 const SCM args = SCM_CDR (tmp);
1862 ASSERT_SYNTAX (scm_ilength (args) == 1, s_expression, form);
1863 if (depth - 1 == 0)
1864 {
1865 const SCM list = scm_eval_car (args, env);
1866 const SCM rest = SCM_CDR (form);
1867 ASSERT_SYNTAX_2 (scm_ilength (list) >= 0,
1868 s_splicing, list, form);
1869 return scm_append (scm_list_2 (list, iqq (rest, env, depth)));
1870 }
1871 else
1872 return scm_cons (iqq (SCM_CAR (form), env, depth - 1),
1873 iqq (SCM_CDR (form), env, depth));
1874 }
1875 else
1876 return scm_cons (iqq (SCM_CAR (form), env, depth),
1877 iqq (SCM_CDR (form), env, depth));
1878 }
1879 else if (SCM_VECTORP (form))
1880 {
1881 size_t i = SCM_VECTOR_LENGTH (form);
1882 SCM const *const data = SCM_VELTS (form);
1883 SCM tmp = SCM_EOL;
1884 while (i != 0)
1885 tmp = scm_cons (data[--i], tmp);
1886 scm_remember_upto_here_1 (form);
1887 return scm_vector (iqq (tmp, env, depth));
1888 }
1889 else
1890 return form;
1891 }
1892
1893 SCM
1894 scm_m_quasiquote (SCM expr, SCM env)
1895 {
1896 const SCM cdr_expr = SCM_CDR (expr);
1897 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 0, s_bad_expression, expr);
1898 ASSERT_SYNTAX (scm_ilength (cdr_expr) == 1, s_expression, expr);
1899 return iqq (SCM_CAR (cdr_expr), env, 1);
1900 }
1901
1902
1903 SCM_SYNTAX (s_quote, "quote", scm_i_makbimacro, scm_m_quote);
1904 SCM_GLOBAL_SYMBOL (scm_sym_quote, s_quote);
1905
1906 SCM
1907 scm_m_quote (SCM expr, SCM env SCM_UNUSED)
1908 {
1909 SCM quotee;
1910
1911 const SCM cdr_expr = SCM_CDR (expr);
1912 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 0, s_bad_expression, expr);
1913 ASSERT_SYNTAX (scm_ilength (cdr_expr) == 1, s_expression, expr);
1914 quotee = SCM_CAR (cdr_expr);
1915 if (is_self_quoting_p (quotee))
1916 return quotee;
1917
1918 SCM_SETCAR (expr, SCM_IM_QUOTE);
1919 SCM_SETCDR (expr, quotee);
1920 return expr;
1921 }
1922
1923 static SCM
1924 unmemoize_quote (const SCM expr, const SCM env SCM_UNUSED)
1925 {
1926 return scm_list_2 (scm_sym_quote, SCM_CDR (expr));
1927 }
1928
1929
1930 /* Will go into the RnRS module when Guile is factorized.
1931 SCM_SYNTAX (s_set_x, "set!", scm_i_makbimacro, scm_m_set_x); */
1932 static const char s_set_x[] = "set!";
1933 SCM_GLOBAL_SYMBOL (scm_sym_set_x, s_set_x);
1934
1935 SCM
1936 scm_m_set_x (SCM expr, SCM env SCM_UNUSED)
1937 {
1938 SCM variable;
1939 SCM new_variable;
1940
1941 const SCM cdr_expr = SCM_CDR (expr);
1942 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 0, s_bad_expression, expr);
1943 ASSERT_SYNTAX (scm_ilength (cdr_expr) == 2, s_expression, expr);
1944 variable = SCM_CAR (cdr_expr);
1945
1946 /* Memoize the variable form. */
1947 ASSERT_SYNTAX_2 (scm_is_symbol (variable), s_bad_variable, variable, expr);
1948 new_variable = lookup_symbol (variable, env);
1949 /* Leave the memoization of unbound symbols to lazy memoization: */
1950 if (SCM_UNBNDP (new_variable))
1951 new_variable = variable;
1952
1953 SCM_SETCAR (expr, SCM_IM_SET_X);
1954 SCM_SETCAR (cdr_expr, new_variable);
1955 return expr;
1956 }
1957
1958 static SCM
1959 unmemoize_set_x (const SCM expr, const SCM env)
1960 {
1961 return scm_cons (scm_sym_set_x, unmemoize_exprs (SCM_CDR (expr), env));
1962 }
1963
1964
1965 /* Start of the memoizers for non-R5RS builtin macros. */
1966
1967
1968 SCM_SYNTAX (s_atapply, "@apply", scm_i_makbimacro, scm_m_apply);
1969 SCM_GLOBAL_SYMBOL (scm_sym_atapply, s_atapply);
1970 SCM_GLOBAL_SYMBOL (scm_sym_apply, s_atapply + 1);
1971
1972 SCM
1973 scm_m_apply (SCM expr, SCM env SCM_UNUSED)
1974 {
1975 const SCM cdr_expr = SCM_CDR (expr);
1976 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 0, s_bad_expression, expr);
1977 ASSERT_SYNTAX (scm_ilength (cdr_expr) == 2, s_missing_expression, expr);
1978
1979 SCM_SETCAR (expr, SCM_IM_APPLY);
1980 return expr;
1981 }
1982
1983 static SCM
1984 unmemoize_apply (const SCM expr, const SCM env)
1985 {
1986 return scm_list_2 (scm_sym_atapply, unmemoize_exprs (SCM_CDR (expr), env));
1987 }
1988
1989
1990 SCM_SYNTAX (s_atbind, "@bind", scm_i_makbimacro, scm_m_atbind);
1991
1992 /* FIXME: The following explanation should go into the documentation: */
1993 /* (@bind ((var init) ...) body ...) will assign the values of the `init's to
1994 * the global variables named by `var's (symbols, not evaluated), creating
1995 * them if they don't exist, executes body, and then restores the previous
1996 * values of the `var's. Additionally, whenever control leaves body, the
1997 * values of the `var's are saved and restored when control returns. It is an
1998 * error when a symbol appears more than once among the `var's. All `init's
1999 * are evaluated before any `var' is set.
2000 *
2001 * Think of this as `let' for dynamic scope.
2002 */
2003
2004 /* (@bind ((var1 exp1) ... (varn expn)) body ...) is memoized into
2005 * (#@bind ((varn ... var1) . (exp1 ... expn)) body ...).
2006 *
2007 * FIXME - also implement `@bind*'.
2008 */
2009 SCM
2010 scm_m_atbind (SCM expr, SCM env)
2011 {
2012 SCM bindings;
2013 SCM rvariables;
2014 SCM inits;
2015 SCM variable_idx;
2016
2017 const SCM top_level = scm_env_top_level (env);
2018
2019 const SCM cdr_expr = SCM_CDR (expr);
2020 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 0, s_bad_expression, expr);
2021 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 2, s_missing_expression, expr);
2022 bindings = SCM_CAR (cdr_expr);
2023 check_bindings (bindings, expr);
2024 transform_bindings (bindings, expr, &rvariables, &inits);
2025
2026 for (variable_idx = rvariables;
2027 !SCM_NULLP (variable_idx);
2028 variable_idx = SCM_CDR (variable_idx))
2029 {
2030 /* The first call to scm_sym2var will look beyond the current module,
2031 * while the second call wont. */
2032 const SCM variable = SCM_CAR (variable_idx);
2033 SCM new_variable = scm_sym2var (variable, top_level, SCM_BOOL_F);
2034 if (scm_is_false (new_variable))
2035 new_variable = scm_sym2var (variable, top_level, SCM_BOOL_T);
2036 SCM_SETCAR (variable_idx, new_variable);
2037 }
2038
2039 SCM_SETCAR (expr, SCM_IM_BIND);
2040 SCM_SETCAR (cdr_expr, scm_cons (rvariables, inits));
2041 return expr;
2042 }
2043
2044
2045 SCM_SYNTAX(s_atcall_cc, "@call-with-current-continuation", scm_i_makbimacro, scm_m_cont);
2046 SCM_GLOBAL_SYMBOL(scm_sym_atcall_cc, s_atcall_cc);
2047
2048 SCM
2049 scm_m_cont (SCM expr, SCM env SCM_UNUSED)
2050 {
2051 const SCM cdr_expr = SCM_CDR (expr);
2052 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 0, s_bad_expression, expr);
2053 ASSERT_SYNTAX (scm_ilength (cdr_expr) == 1, s_expression, expr);
2054
2055 SCM_SETCAR (expr, SCM_IM_CONT);
2056 return expr;
2057 }
2058
2059 static SCM
2060 unmemoize_atcall_cc (const SCM expr, const SCM env)
2061 {
2062 return scm_list_2 (scm_sym_atcall_cc, unmemoize_exprs (SCM_CDR (expr), env));
2063 }
2064
2065
2066 SCM_SYNTAX (s_at_call_with_values, "@call-with-values", scm_i_makbimacro, scm_m_at_call_with_values);
2067 SCM_GLOBAL_SYMBOL(scm_sym_at_call_with_values, s_at_call_with_values);
2068
2069 SCM
2070 scm_m_at_call_with_values (SCM expr, SCM env SCM_UNUSED)
2071 {
2072 const SCM cdr_expr = SCM_CDR (expr);
2073 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 0, s_bad_expression, expr);
2074 ASSERT_SYNTAX (scm_ilength (cdr_expr) == 2, s_expression, expr);
2075
2076 SCM_SETCAR (expr, SCM_IM_CALL_WITH_VALUES);
2077 return expr;
2078 }
2079
2080 static SCM
2081 unmemoize_at_call_with_values (const SCM expr, const SCM env)
2082 {
2083 return scm_list_2 (scm_sym_at_call_with_values,
2084 unmemoize_exprs (SCM_CDR (expr), env));
2085 }
2086
2087
2088 SCM_SYNTAX (s_future, "future", scm_i_makbimacro, scm_m_future);
2089 SCM_GLOBAL_SYMBOL (scm_sym_future, s_future);
2090
2091 /* Like promises, futures are implemented as closures with an empty
2092 * parameter list. Thus, (future <expression>) is transformed into
2093 * (#@future '() <expression>), where the empty list represents the
2094 * empty parameter list. This representation allows for easy creation
2095 * of the closure during evaluation. */
2096 SCM
2097 scm_m_future (SCM expr, SCM env)
2098 {
2099 const SCM new_expr = memoize_as_thunk_prototype (expr, env);
2100 SCM_SETCAR (new_expr, SCM_IM_FUTURE);
2101 return new_expr;
2102 }
2103
2104 static SCM
2105 unmemoize_future (const SCM expr, const SCM env)
2106 {
2107 const SCM thunk_expr = SCM_CADDR (expr);
2108 return scm_list_2 (scm_sym_future, unmemoize_expression (thunk_expr, env));
2109 }
2110
2111
2112 SCM_SYNTAX (s_gset_x, "set!", scm_i_makbimacro, scm_m_generalized_set_x);
2113 SCM_SYMBOL (scm_sym_setter, "setter");
2114
2115 SCM
2116 scm_m_generalized_set_x (SCM expr, SCM env)
2117 {
2118 SCM target, exp_target;
2119
2120 const SCM cdr_expr = SCM_CDR (expr);
2121 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 0, s_bad_expression, expr);
2122 ASSERT_SYNTAX (scm_ilength (cdr_expr) == 2, s_expression, expr);
2123
2124 target = SCM_CAR (cdr_expr);
2125 if (!SCM_CONSP (target))
2126 {
2127 /* R5RS usage */
2128 return scm_m_set_x (expr, env);
2129 }
2130 else
2131 {
2132 /* (set! (foo bar ...) baz) becomes ((setter foo) bar ... baz) */
2133 /* Macroexpanding the target might return things of the form
2134 (begin <atom>). In that case, <atom> must be a symbol or a
2135 variable and we memoize to (set! <atom> ...).
2136 */
2137 exp_target = macroexp (target, env);
2138 if (scm_is_eq (SCM_CAR (exp_target), SCM_IM_BEGIN)
2139 && !SCM_NULLP (SCM_CDR (exp_target))
2140 && SCM_NULLP (SCM_CDDR (exp_target)))
2141 {
2142 exp_target= SCM_CADR (exp_target);
2143 ASSERT_SYNTAX_2 (scm_is_symbol (exp_target)
2144 || SCM_VARIABLEP (exp_target),
2145 s_bad_variable, exp_target, expr);
2146 return scm_cons (SCM_IM_SET_X, scm_cons (exp_target,
2147 SCM_CDR (cdr_expr)));
2148 }
2149 else
2150 {
2151 const SCM setter_proc_tail = scm_list_1 (SCM_CAR (target));
2152 const SCM setter_proc = scm_cons_source (expr, scm_sym_setter,
2153 setter_proc_tail);
2154
2155 const SCM cddr_expr = SCM_CDR (cdr_expr);
2156 const SCM setter_args = scm_append_x (scm_list_2 (SCM_CDR (target),
2157 cddr_expr));
2158
2159 SCM_SETCAR (expr, setter_proc);
2160 SCM_SETCDR (expr, setter_args);
2161 return expr;
2162 }
2163 }
2164 }
2165
2166
2167 /* @slot-ref is bound privately in the (oop goops) module from goops.c. As
2168 * soon as the module system allows us to more freely create bindings in
2169 * arbitrary modules during the startup phase, the code from goops.c should be
2170 * moved here. */
2171
2172 SCM_SYMBOL (sym_atslot_ref, "@slot-ref");
2173
2174 SCM
2175 scm_m_atslot_ref (SCM expr, SCM env SCM_UNUSED)
2176 {
2177 SCM slot_nr;
2178
2179 const SCM cdr_expr = SCM_CDR (expr);
2180 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 0, s_bad_expression, expr);
2181 ASSERT_SYNTAX (scm_ilength (cdr_expr) == 2, s_expression, expr);
2182 slot_nr = SCM_CADR (cdr_expr);
2183 ASSERT_SYNTAX_2 (SCM_I_INUMP (slot_nr), s_bad_slot_number, slot_nr, expr);
2184
2185 SCM_SETCAR (expr, SCM_IM_SLOT_REF);
2186 SCM_SETCDR (cdr_expr, slot_nr);
2187 return expr;
2188 }
2189
2190 static SCM
2191 unmemoize_atslot_ref (const SCM expr, const SCM env)
2192 {
2193 const SCM instance = SCM_CADR (expr);
2194 const SCM um_instance = unmemoize_expression (instance, env);
2195 const SCM slot_nr = SCM_CDDR (expr);
2196 return scm_list_3 (sym_atslot_ref, um_instance, slot_nr);
2197 }
2198
2199
2200 /* @slot-set! is bound privately in the (oop goops) module from goops.c. As
2201 * soon as the module system allows us to more freely create bindings in
2202 * arbitrary modules during the startup phase, the code from goops.c should be
2203 * moved here. */
2204
2205 SCM_SYMBOL (sym_atslot_set_x, "@slot-set!");
2206
2207 SCM
2208 scm_m_atslot_set_x (SCM expr, SCM env SCM_UNUSED)
2209 {
2210 SCM slot_nr;
2211
2212 const SCM cdr_expr = SCM_CDR (expr);
2213 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 0, s_bad_expression, expr);
2214 ASSERT_SYNTAX (scm_ilength (cdr_expr) == 3, s_expression, expr);
2215 slot_nr = SCM_CADR (cdr_expr);
2216 ASSERT_SYNTAX_2 (SCM_I_INUMP (slot_nr), s_bad_slot_number, slot_nr, expr);
2217
2218 SCM_SETCAR (expr, SCM_IM_SLOT_SET_X);
2219 return expr;
2220 }
2221
2222 static SCM
2223 unmemoize_atslot_set_x (const SCM expr, const SCM env)
2224 {
2225 const SCM cdr_expr = SCM_CDR (expr);
2226 const SCM instance = SCM_CAR (cdr_expr);
2227 const SCM um_instance = unmemoize_expression (instance, env);
2228 const SCM cddr_expr = SCM_CDR (cdr_expr);
2229 const SCM slot_nr = SCM_CAR (cddr_expr);
2230 const SCM cdddr_expr = SCM_CDR (cddr_expr);
2231 const SCM value = SCM_CAR (cdddr_expr);
2232 const SCM um_value = unmemoize_expression (value, env);
2233 return scm_list_4 (sym_atslot_set_x, um_instance, slot_nr, um_value);
2234 }
2235
2236
2237 #if SCM_ENABLE_ELISP
2238
2239 static const char s_defun[] = "Symbol's function definition is void";
2240
2241 SCM_SYNTAX (s_nil_cond, "nil-cond", scm_i_makbimacro, scm_m_nil_cond);
2242
2243 /* nil-cond expressions have the form
2244 * (nil-cond COND VAL COND VAL ... ELSEVAL) */
2245 SCM
2246 scm_m_nil_cond (SCM expr, SCM env SCM_UNUSED)
2247 {
2248 const long length = scm_ilength (SCM_CDR (expr));
2249 ASSERT_SYNTAX (length >= 0, s_bad_expression, expr);
2250 ASSERT_SYNTAX (length >= 1 && (length % 2) == 1, s_expression, expr);
2251
2252 SCM_SETCAR (expr, SCM_IM_NIL_COND);
2253 return expr;
2254 }
2255
2256
2257 SCM_SYNTAX (s_atfop, "@fop", scm_i_makbimacro, scm_m_atfop);
2258
2259 /* The @fop-macro handles procedure and macro applications for elisp. The
2260 * input expression must have the form
2261 * (@fop <var> (transformer-macro <expr> ...))
2262 * where <var> must be a symbol. The expression is transformed into the
2263 * memoized form of either
2264 * (apply <un-aliased var> (transformer-macro <expr> ...))
2265 * if the value of var (across all aliasing) is not a macro, or
2266 * (<un-aliased var> <expr> ...)
2267 * if var is a macro. */
2268 SCM
2269 scm_m_atfop (SCM expr, SCM env SCM_UNUSED)
2270 {
2271 SCM location;
2272 SCM symbol;
2273
2274 const SCM cdr_expr = SCM_CDR (expr);
2275 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 0, s_bad_expression, expr);
2276 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 1, s_missing_expression, expr);
2277
2278 symbol = SCM_CAR (cdr_expr);
2279 ASSERT_SYNTAX_2 (scm_is_symbol (symbol), s_bad_variable, symbol, expr);
2280
2281 location = scm_symbol_fref (symbol);
2282 ASSERT_SYNTAX_2 (SCM_VARIABLEP (location), s_defun, symbol, expr);
2283
2284 /* The elisp function `defalias' allows to define aliases for symbols. To
2285 * look up such definitions, the chain of symbol definitions has to be
2286 * followed up to the terminal symbol. */
2287 while (scm_is_symbol (SCM_VARIABLE_REF (location)))
2288 {
2289 const SCM alias = SCM_VARIABLE_REF (location);
2290 location = scm_symbol_fref (alias);
2291 ASSERT_SYNTAX_2 (SCM_VARIABLEP (location), s_defun, symbol, expr);
2292 }
2293
2294 /* Memoize the value location belonging to the terminal symbol. */
2295 SCM_SETCAR (cdr_expr, location);
2296
2297 if (!SCM_MACROP (SCM_VARIABLE_REF (location)))
2298 {
2299 /* Since the location does not contain a macro, the form is a procedure
2300 * application. Replace `@fop' by `@apply' and transform the expression
2301 * including the `transformer-macro'. */
2302 SCM_SETCAR (expr, SCM_IM_APPLY);
2303 return expr;
2304 }
2305 else
2306 {
2307 /* Since the location contains a macro, the arguments should not be
2308 * transformed, so the `transformer-macro' is cut out. The resulting
2309 * expression starts with the memoized variable, that is at the cdr of
2310 * the input expression. */
2311 SCM_SETCDR (cdr_expr, SCM_CDADR (cdr_expr));
2312 return cdr_expr;
2313 }
2314 }
2315
2316 #endif /* SCM_ENABLE_ELISP */
2317
2318
2319 static SCM
2320 unmemoize_builtin_macro (const SCM expr, const SCM env)
2321 {
2322 switch (ISYMNUM (SCM_CAR (expr)))
2323 {
2324 case (ISYMNUM (SCM_IM_AND)):
2325 return unmemoize_and (expr, env);
2326
2327 case (ISYMNUM (SCM_IM_BEGIN)):
2328 return unmemoize_begin (expr, env);
2329
2330 case (ISYMNUM (SCM_IM_CASE)):
2331 return unmemoize_case (expr, env);
2332
2333 case (ISYMNUM (SCM_IM_COND)):
2334 return unmemoize_cond (expr, env);
2335
2336 case (ISYMNUM (SCM_IM_DELAY)):
2337 return unmemoize_delay (expr, env);
2338
2339 case (ISYMNUM (SCM_IM_DO)):
2340 return unmemoize_do (expr, env);
2341
2342 case (ISYMNUM (SCM_IM_IF)):
2343 return unmemoize_if (expr, env);
2344
2345 case (ISYMNUM (SCM_IM_LAMBDA)):
2346 return unmemoize_lambda (expr, env);
2347
2348 case (ISYMNUM (SCM_IM_LET)):
2349 return unmemoize_let (expr, env);
2350
2351 case (ISYMNUM (SCM_IM_LETREC)):
2352 return unmemoize_letrec (expr, env);
2353
2354 case (ISYMNUM (SCM_IM_LETSTAR)):
2355 return unmemoize_letstar (expr, env);
2356
2357 case (ISYMNUM (SCM_IM_OR)):
2358 return unmemoize_or (expr, env);
2359
2360 case (ISYMNUM (SCM_IM_QUOTE)):
2361 return unmemoize_quote (expr, env);
2362
2363 case (ISYMNUM (SCM_IM_SET_X)):
2364 return unmemoize_set_x (expr, env);
2365
2366 case (ISYMNUM (SCM_IM_APPLY)):
2367 return unmemoize_apply (expr, env);
2368
2369 case (ISYMNUM (SCM_IM_BIND)):
2370 return unmemoize_exprs (expr, env); /* FIXME */
2371
2372 case (ISYMNUM (SCM_IM_CONT)):
2373 return unmemoize_atcall_cc (expr, env);
2374
2375 case (ISYMNUM (SCM_IM_CALL_WITH_VALUES)):
2376 return unmemoize_at_call_with_values (expr, env);
2377
2378 case (ISYMNUM (SCM_IM_FUTURE)):
2379 return unmemoize_future (expr, env);
2380
2381 case (ISYMNUM (SCM_IM_SLOT_REF)):
2382 return unmemoize_atslot_ref (expr, env);
2383
2384 case (ISYMNUM (SCM_IM_SLOT_SET_X)):
2385 return unmemoize_atslot_set_x (expr, env);
2386
2387 case (ISYMNUM (SCM_IM_NIL_COND)):
2388 return unmemoize_exprs (expr, env); /* FIXME */
2389
2390 default:
2391 return unmemoize_exprs (expr, env); /* FIXME */
2392 }
2393 }
2394
2395
2396 /* scm_i_unmemocopy_expr and scm_i_unmemocopy_body take a memoized expression
2397 * respectively a memoized body together with its environment and rewrite it
2398 * to its original form. Thus, these functions are the inversion of the
2399 * rewrite rules above. The procedure is not optimized for speed. It's used
2400 * in scm_i_unmemoize_expr, scm_procedure_source, macro_print and scm_iprin1.
2401 *
2402 * Unmemoizing is not a reliable process. You cannot in general expect to get
2403 * the original source back.
2404 *
2405 * However, GOOPS currently relies on this for method compilation. This ought
2406 * to change. */
2407
2408 SCM
2409 scm_i_unmemocopy_expr (SCM expr, SCM env)
2410 {
2411 const SCM source_properties = scm_whash_lookup (scm_source_whash, expr);
2412 const SCM um_expr = unmemoize_expression (expr, env);
2413
2414 if (scm_is_true (source_properties))
2415 scm_whash_insert (scm_source_whash, um_expr, source_properties);
2416
2417 return um_expr;
2418 }
2419
2420 SCM
2421 scm_i_unmemocopy_body (SCM forms, SCM env)
2422 {
2423 const SCM source_properties = scm_whash_lookup (scm_source_whash, forms);
2424 const SCM um_forms = unmemoize_exprs (forms, env);
2425
2426 if (scm_is_true (source_properties))
2427 scm_whash_insert (scm_source_whash, um_forms, source_properties);
2428
2429 return um_forms;
2430 }
2431
2432
2433 #if (SCM_ENABLE_DEPRECATED == 1)
2434
2435 /* Deprecated in guile 1.7.0 on 2003-11-09. */
2436 SCM
2437 scm_m_expand_body (SCM exprs, SCM env)
2438 {
2439 scm_c_issue_deprecation_warning
2440 ("`scm_m_expand_body' is deprecated.");
2441 m_expand_body (exprs, env);
2442 return exprs;
2443 }
2444
2445
2446 SCM_SYNTAX (s_undefine, "undefine", scm_makacro, scm_m_undefine);
2447
2448 SCM
2449 scm_m_undefine (SCM expr, SCM env)
2450 {
2451 SCM variable;
2452 SCM location;
2453
2454 const SCM cdr_expr = SCM_CDR (expr);
2455 ASSERT_SYNTAX (SCM_TOP_LEVEL (env), "Bad undefine placement in", expr);
2456 ASSERT_SYNTAX (scm_ilength (cdr_expr) >= 0, s_bad_expression, expr);
2457 ASSERT_SYNTAX (scm_ilength (cdr_expr) == 1, s_expression, expr);
2458
2459 scm_c_issue_deprecation_warning
2460 ("`undefine' is deprecated.\n");
2461
2462 variable = SCM_CAR (cdr_expr);
2463 ASSERT_SYNTAX_2 (scm_is_symbol (variable), s_bad_variable, variable, expr);
2464 location = scm_sym2var (variable, scm_env_top_level (env), SCM_BOOL_F);
2465 ASSERT_SYNTAX_2 (scm_is_true (location)
2466 && !SCM_UNBNDP (SCM_VARIABLE_REF (location)),
2467 "variable already unbound ", variable, expr);
2468 SCM_VARIABLE_SET (location, SCM_UNDEFINED);
2469 return SCM_UNSPECIFIED;
2470 }
2471
2472 SCM
2473 scm_macroexp (SCM x, SCM env)
2474 {
2475 scm_c_issue_deprecation_warning
2476 ("`scm_macroexp' is deprecated.");
2477 return macroexp (x, env);
2478 }
2479
2480 #endif
2481
2482
2483 #if (SCM_ENABLE_DEPRECATED == 1)
2484
2485 SCM
2486 scm_unmemocar (SCM form, SCM env)
2487 {
2488 scm_c_issue_deprecation_warning
2489 ("`scm_unmemocar' is deprecated.");
2490
2491 if (!SCM_CONSP (form))
2492 return form;
2493 else
2494 {
2495 SCM c = SCM_CAR (form);
2496 if (SCM_VARIABLEP (c))
2497 {
2498 SCM sym = scm_module_reverse_lookup (scm_env_module (env), c);
2499 if (scm_is_false (sym))
2500 sym = sym_three_question_marks;
2501 SCM_SETCAR (form, sym);
2502 }
2503 else if (SCM_ILOCP (c))
2504 {
2505 unsigned long int ir;
2506
2507 for (ir = SCM_IFRAME (c); ir != 0; --ir)
2508 env = SCM_CDR (env);
2509 env = SCM_CAAR (env);
2510 for (ir = SCM_IDIST (c); ir != 0; --ir)
2511 env = SCM_CDR (env);
2512
2513 SCM_SETCAR (form, SCM_ICDRP (c) ? env : SCM_CAR (env));
2514 }
2515 return form;
2516 }
2517 }
2518
2519 #endif
2520
2521 /*****************************************************************************/
2522 /*****************************************************************************/
2523 /* The definitions for execution start here. */
2524 /*****************************************************************************/
2525 /*****************************************************************************/
2526
2527 SCM_GLOBAL_SYMBOL (scm_sym_enter_frame, "enter-frame");
2528 SCM_GLOBAL_SYMBOL (scm_sym_apply_frame, "apply-frame");
2529 SCM_GLOBAL_SYMBOL (scm_sym_exit_frame, "exit-frame");
2530 SCM_GLOBAL_SYMBOL (scm_sym_trace, "trace");
2531
2532 /* A function object to implement "apply" for non-closure functions. */
2533 static SCM f_apply;
2534 /* An endless list consisting of #<undefined> objects: */
2535 static SCM undefineds;
2536
2537
2538 int
2539 scm_badargsp (SCM formals, SCM args)
2540 {
2541 while (!SCM_NULLP (formals))
2542 {
2543 if (!SCM_CONSP (formals))
2544 return 0;
2545 if (SCM_NULLP (args))
2546 return 1;
2547 formals = SCM_CDR (formals);
2548 args = SCM_CDR (args);
2549 }
2550 return !SCM_NULLP (args) ? 1 : 0;
2551 }
2552
2553 \f
2554
2555 /* The evaluator contains a plethora of EVAL symbols. This is an attempt at
2556 * explanation.
2557 *
2558 * The following macros should be used in code which is read twice (where the
2559 * choice of evaluator is hard soldered):
2560 *
2561 * CEVAL is the symbol used within one evaluator to call itself.
2562 * Originally, it is defined to ceval, but is redefined to deval during the
2563 * second pass.
2564 *
2565 * SCM_I_EVALIM is used when it is known that the expression is an
2566 * immediate. (This macro never calls an evaluator.)
2567 *
2568 * EVAL evaluates an expression that is expected to have its symbols already
2569 * memoized. Expressions that are not of the form '(<form> <form> ...)' are
2570 * evaluated inline without calling an evaluator.
2571 *
2572 * EVALCAR evaluates the car of an expression 'X:(Y:<form> <form> ...)',
2573 * potentially replacing a symbol at the position Y:<form> by its memoized
2574 * variable. If Y:<form> is not of the form '(<form> <form> ...)', the
2575 * evaluation is performed inline without calling an evaluator.
2576 *
2577 * The following macros should be used in code which is read once
2578 * (where the choice of evaluator is dynamic):
2579 *
2580 * SCM_I_XEVAL corresponds to EVAL, but uses ceval *or* deval depending on the
2581 * debugging mode.
2582 *
2583 * SCM_I_XEVALCAR corresponds to EVALCAR, but uses ceval *or* deval depending
2584 * on the debugging mode.
2585 *
2586 * The main motivation for keeping this plethora is efficiency
2587 * together with maintainability (=> locality of code).
2588 */
2589
2590 static SCM ceval (SCM x, SCM env);
2591 static SCM deval (SCM x, SCM env);
2592 #define CEVAL ceval
2593
2594
2595 #define SCM_I_EVALIM2(x) \
2596 ((scm_is_eq ((x), SCM_EOL) \
2597 ? syntax_error (s_empty_combination, (x), SCM_UNDEFINED), 0 \
2598 : 0), \
2599 (x))
2600
2601 #define SCM_I_EVALIM(x, env) (SCM_ILOCP (x) \
2602 ? *scm_ilookup ((x), (env)) \
2603 : SCM_I_EVALIM2(x))
2604
2605 #define SCM_I_XEVAL(x, env) \
2606 (SCM_IMP (x) \
2607 ? SCM_I_EVALIM2 (x) \
2608 : (SCM_VARIABLEP (x) \
2609 ? SCM_VARIABLE_REF (x) \
2610 : (SCM_CONSP (x) \
2611 ? (scm_debug_mode_p \
2612 ? deval ((x), (env)) \
2613 : ceval ((x), (env))) \
2614 : (x))))
2615
2616 #define SCM_I_XEVALCAR(x, env) \
2617 (SCM_IMP (SCM_CAR (x)) \
2618 ? SCM_I_EVALIM (SCM_CAR (x), (env)) \
2619 : (SCM_VARIABLEP (SCM_CAR (x)) \
2620 ? SCM_VARIABLE_REF (SCM_CAR (x)) \
2621 : (SCM_CONSP (SCM_CAR (x)) \
2622 ? (scm_debug_mode_p \
2623 ? deval (SCM_CAR (x), (env)) \
2624 : ceval (SCM_CAR (x), (env))) \
2625 : (!scm_is_symbol (SCM_CAR (x)) \
2626 ? SCM_CAR (x) \
2627 : *scm_lookupcar ((x), (env), 1)))))
2628
2629 #define EVAL(x, env) \
2630 (SCM_IMP (x) \
2631 ? SCM_I_EVALIM ((x), (env)) \
2632 : (SCM_VARIABLEP (x) \
2633 ? SCM_VARIABLE_REF (x) \
2634 : (SCM_CONSP (x) \
2635 ? CEVAL ((x), (env)) \
2636 : (x))))
2637
2638 #define EVALCAR(x, env) \
2639 (SCM_IMP (SCM_CAR (x)) \
2640 ? SCM_I_EVALIM (SCM_CAR (x), (env)) \
2641 : (SCM_VARIABLEP (SCM_CAR (x)) \
2642 ? SCM_VARIABLE_REF (SCM_CAR (x)) \
2643 : (SCM_CONSP (SCM_CAR (x)) \
2644 ? CEVAL (SCM_CAR (x), (env)) \
2645 : (!scm_is_symbol (SCM_CAR (x)) \
2646 ? SCM_CAR (x) \
2647 : *scm_lookupcar ((x), (env), 1)))))
2648
2649 SCM_REC_MUTEX (source_mutex);
2650
2651
2652 /* Lookup a given local variable in an environment. The local variable is
2653 * given as an iloc, that is a triple <frame, binding, last?>, where frame
2654 * indicates the relative number of the environment frame (counting upwards
2655 * from the innermost environment frame), binding indicates the number of the
2656 * binding within the frame, and last? (which is extracted from the iloc using
2657 * the macro SCM_ICDRP) indicates whether the binding forms the binding at the
2658 * very end of the improper list of bindings. */
2659 SCM *
2660 scm_ilookup (SCM iloc, SCM env)
2661 {
2662 unsigned int frame_nr = SCM_IFRAME (iloc);
2663 unsigned int binding_nr = SCM_IDIST (iloc);
2664 SCM frames = env;
2665 SCM bindings;
2666
2667 for (; 0 != frame_nr; --frame_nr)
2668 frames = SCM_CDR (frames);
2669
2670 bindings = SCM_CAR (frames);
2671 for (; 0 != binding_nr; --binding_nr)
2672 bindings = SCM_CDR (bindings);
2673
2674 if (SCM_ICDRP (iloc))
2675 return SCM_CDRLOC (bindings);
2676 return SCM_CARLOC (SCM_CDR (bindings));
2677 }
2678
2679
2680 SCM_SYMBOL (scm_unbound_variable_key, "unbound-variable");
2681
2682 static void error_unbound_variable (SCM symbol) SCM_NORETURN;
2683 static void error_defined_variable (SCM symbol) SCM_NORETURN;
2684
2685 /* Call this for variables that are unfound.
2686 */
2687 static void
2688 error_unbound_variable (SCM symbol)
2689 {
2690 scm_error (scm_unbound_variable_key, NULL,
2691 "Unbound variable: ~S",
2692 scm_list_1 (symbol), SCM_BOOL_F);
2693 }
2694
2695 /* Call this for variables that are found but contain SCM_UNDEFINED.
2696 */
2697 static void
2698 error_defined_variable (SCM symbol)
2699 {
2700 /* We use the 'unbound-variable' key here as well, since it
2701 basically is the same kind of error, with a slight variation in
2702 the displayed message.
2703 */
2704 scm_error (scm_unbound_variable_key, NULL,
2705 "Undefined variable: ~S",
2706 scm_list_1 (symbol), SCM_BOOL_F);
2707 }
2708
2709
2710 /* The Lookup Car Race
2711 - by Eva Luator
2712
2713 Memoization of variables and special forms is done while executing
2714 the code for the first time. As long as there is only one thread
2715 everything is fine, but as soon as two threads execute the same
2716 code concurrently `for the first time' they can come into conflict.
2717
2718 This memoization includes rewriting variable references into more
2719 efficient forms and expanding macros. Furthermore, macro expansion
2720 includes `compiling' special forms like `let', `cond', etc. into
2721 tree-code instructions.
2722
2723 There shouldn't normally be a problem with memoizing local and
2724 global variable references (into ilocs and variables), because all
2725 threads will mutate the code in *exactly* the same way and (if I
2726 read the C code correctly) it is not possible to observe a half-way
2727 mutated cons cell. The lookup procedure can handle this
2728 transparently without any critical sections.
2729
2730 It is different with macro expansion, because macro expansion
2731 happens outside of the lookup procedure and can't be
2732 undone. Therefore the lookup procedure can't cope with it. It has
2733 to indicate failure when it detects a lost race and hope that the
2734 caller can handle it. Luckily, it turns out that this is the case.
2735
2736 An example to illustrate this: Suppose that the following form will
2737 be memoized concurrently by two threads
2738
2739 (let ((x 12)) x)
2740
2741 Let's first examine the lookup of X in the body. The first thread
2742 decides that it has to find the symbol "x" in the environment and
2743 starts to scan it. Then the other thread takes over and actually
2744 overtakes the first. It looks up "x" and substitutes an
2745 appropriate iloc for it. Now the first thread continues and
2746 completes its lookup. It comes to exactly the same conclusions as
2747 the second one and could - without much ado - just overwrite the
2748 iloc with the same iloc.
2749
2750 But let's see what will happen when the race occurs while looking
2751 up the symbol "let" at the start of the form. It could happen that
2752 the second thread interrupts the lookup of the first thread and not
2753 only substitutes a variable for it but goes right ahead and
2754 replaces it with the compiled form (#@let* (x 12) x). Now, when
2755 the first thread completes its lookup, it would replace the #@let*
2756 with a variable containing the "let" binding, effectively reverting
2757 the form to (let (x 12) x). This is wrong. It has to detect that
2758 it has lost the race and the evaluator has to reconsider the
2759 changed form completely.
2760
2761 This race condition could be resolved with some kind of traffic
2762 light (like mutexes) around scm_lookupcar, but I think that it is
2763 best to avoid them in this case. They would serialize memoization
2764 completely and because lookup involves calling arbitrary Scheme
2765 code (via the lookup-thunk), threads could be blocked for an
2766 arbitrary amount of time or even deadlock. But with the current
2767 solution a lot of unnecessary work is potentially done. */
2768
2769 /* SCM_LOOKUPCAR1 is what SCM_LOOKUPCAR used to be but is allowed to
2770 return NULL to indicate a failed lookup due to some race conditions
2771 between threads. This only happens when VLOC is the first cell of
2772 a special form that will eventually be memoized (like `let', etc.)
2773 In that case the whole lookup is bogus and the caller has to
2774 reconsider the complete special form.
2775
2776 SCM_LOOKUPCAR is still there, of course. It just calls
2777 SCM_LOOKUPCAR1 and aborts on receiving NULL. So SCM_LOOKUPCAR
2778 should only be called when it is known that VLOC is not the first
2779 pair of a special form. Otherwise, use SCM_LOOKUPCAR1 and check
2780 for NULL. I think I've found the only places where this
2781 applies. */
2782
2783 static SCM *
2784 scm_lookupcar1 (SCM vloc, SCM genv, int check)
2785 {
2786 SCM env = genv;
2787 register SCM *al, fl, var = SCM_CAR (vloc);
2788 register SCM iloc = SCM_ILOC00;
2789 for (; SCM_NIMP (env); env = SCM_CDR (env))
2790 {
2791 if (!SCM_CONSP (SCM_CAR (env)))
2792 break;
2793 al = SCM_CARLOC (env);
2794 for (fl = SCM_CAR (*al); SCM_NIMP (fl); fl = SCM_CDR (fl))
2795 {
2796 if (!SCM_CONSP (fl))
2797 {
2798 if (scm_is_eq (fl, var))
2799 {
2800 if (!scm_is_eq (SCM_CAR (vloc), var))
2801 goto race;
2802 SCM_SET_CELL_WORD_0 (vloc, SCM_UNPACK (iloc) + SCM_ICDR);
2803 return SCM_CDRLOC (*al);
2804 }
2805 else
2806 break;
2807 }
2808 al = SCM_CDRLOC (*al);
2809 if (scm_is_eq (SCM_CAR (fl), var))
2810 {
2811 if (SCM_UNBNDP (SCM_CAR (*al)))
2812 error_defined_variable (var);
2813 if (!scm_is_eq (SCM_CAR (vloc), var))
2814 goto race;
2815 SCM_SETCAR (vloc, iloc);
2816 return SCM_CARLOC (*al);
2817 }
2818 iloc = SCM_PACK (SCM_UNPACK (iloc) + SCM_IDINC);
2819 }
2820 iloc = SCM_PACK ((~SCM_IDSTMSK) & (SCM_UNPACK(iloc) + SCM_IFRINC));
2821 }
2822 {
2823 SCM top_thunk, real_var;
2824 if (SCM_NIMP (env))
2825 {
2826 top_thunk = SCM_CAR (env); /* env now refers to a
2827 top level env thunk */
2828 env = SCM_CDR (env);
2829 }
2830 else
2831 top_thunk = SCM_BOOL_F;
2832 real_var = scm_sym2var (var, top_thunk, SCM_BOOL_F);
2833 if (scm_is_false (real_var))
2834 goto errout;
2835
2836 if (!SCM_NULLP (env) || SCM_UNBNDP (SCM_VARIABLE_REF (real_var)))
2837 {
2838 errout:
2839 if (check)
2840 {
2841 if (SCM_NULLP (env))
2842 error_unbound_variable (var);
2843 else
2844 scm_misc_error (NULL, "Damaged environment: ~S",
2845 scm_list_1 (var));
2846 }
2847 else
2848 {
2849 /* A variable could not be found, but we shall
2850 not throw an error. */
2851 static SCM undef_object = SCM_UNDEFINED;
2852 return &undef_object;
2853 }
2854 }
2855
2856 if (!scm_is_eq (SCM_CAR (vloc), var))
2857 {
2858 /* Some other thread has changed the very cell we are working
2859 on. In effect, it must have done our job or messed it up
2860 completely. */
2861 race:
2862 var = SCM_CAR (vloc);
2863 if (SCM_VARIABLEP (var))
2864 return SCM_VARIABLE_LOC (var);
2865 if (SCM_ILOCP (var))
2866 return scm_ilookup (var, genv);
2867 /* We can't cope with anything else than variables and ilocs. When
2868 a special form has been memoized (i.e. `let' into `#@let') we
2869 return NULL and expect the calling function to do the right
2870 thing. For the evaluator, this means going back and redoing
2871 the dispatch on the car of the form. */
2872 return NULL;
2873 }
2874
2875 SCM_SETCAR (vloc, real_var);
2876 return SCM_VARIABLE_LOC (real_var);
2877 }
2878 }
2879
2880 SCM *
2881 scm_lookupcar (SCM vloc, SCM genv, int check)
2882 {
2883 SCM *loc = scm_lookupcar1 (vloc, genv, check);
2884 if (loc == NULL)
2885 abort ();
2886 return loc;
2887 }
2888
2889
2890 /* During execution, look up a symbol in the top level of the given local
2891 * environment and return the corresponding variable object. If no binding
2892 * for the symbol can be found, an 'Unbound variable' error is signalled. */
2893 static SCM
2894 lazy_memoize_variable (const SCM symbol, const SCM environment)
2895 {
2896 const SCM top_level = scm_env_top_level (environment);
2897 const SCM variable = scm_sym2var (symbol, top_level, SCM_BOOL_F);
2898
2899 if (scm_is_false (variable))
2900 error_unbound_variable (symbol);
2901 else
2902 return variable;
2903 }
2904
2905
2906 SCM
2907 scm_eval_car (SCM pair, SCM env)
2908 {
2909 return SCM_I_XEVALCAR (pair, env);
2910 }
2911
2912
2913 SCM
2914 scm_eval_args (SCM l, SCM env, SCM proc)
2915 {
2916 SCM results = SCM_EOL, *lloc = &results, res;
2917 while (SCM_CONSP (l))
2918 {
2919 res = EVALCAR (l, env);
2920
2921 *lloc = scm_list_1 (res);
2922 lloc = SCM_CDRLOC (*lloc);
2923 l = SCM_CDR (l);
2924 }
2925 if (!SCM_NULLP (l))
2926 scm_wrong_num_args (proc);
2927 return results;
2928 }
2929
2930
2931 SCM
2932 scm_eval_body (SCM code, SCM env)
2933 {
2934 SCM next;
2935
2936 again:
2937 next = SCM_CDR (code);
2938 while (!SCM_NULLP (next))
2939 {
2940 if (SCM_IMP (SCM_CAR (code)))
2941 {
2942 if (SCM_ISYMP (SCM_CAR (code)))
2943 {
2944 scm_rec_mutex_lock (&source_mutex);
2945 /* check for race condition */
2946 if (SCM_ISYMP (SCM_CAR (code)))
2947 m_expand_body (code, env);
2948 scm_rec_mutex_unlock (&source_mutex);
2949 goto again;
2950 }
2951 }
2952 else
2953 SCM_I_XEVAL (SCM_CAR (code), env);
2954 code = next;
2955 next = SCM_CDR (code);
2956 }
2957 return SCM_I_XEVALCAR (code, env);
2958 }
2959
2960 #endif /* !DEVAL */
2961
2962
2963 /* SECTION: This code is specific for the debugging support. One
2964 * branch is read when DEVAL isn't defined, the other when DEVAL is
2965 * defined.
2966 */
2967
2968 #ifndef DEVAL
2969
2970 #define SCM_APPLY scm_apply
2971 #define PREP_APPLY(proc, args)
2972 #define ENTER_APPLY
2973 #define RETURN(x) do { return x; } while (0)
2974 #ifdef STACK_CHECKING
2975 #ifndef NO_CEVAL_STACK_CHECKING
2976 #define EVAL_STACK_CHECKING
2977 #endif
2978 #endif
2979
2980 #else /* !DEVAL */
2981
2982 #undef CEVAL
2983 #define CEVAL deval /* Substitute all uses of ceval */
2984
2985 #undef SCM_APPLY
2986 #define SCM_APPLY scm_dapply
2987
2988 #undef PREP_APPLY
2989 #define PREP_APPLY(p, l) \
2990 { ++debug.info; debug.info->a.proc = p; debug.info->a.args = l; }
2991
2992 #undef ENTER_APPLY
2993 #define ENTER_APPLY \
2994 do { \
2995 SCM_SET_ARGSREADY (debug);\
2996 if (scm_check_apply_p && SCM_TRAPS_P)\
2997 if (SCM_APPLY_FRAME_P || (SCM_TRACE_P && PROCTRACEP (proc)))\
2998 {\
2999 SCM tmp, tail = scm_from_bool(SCM_TRACED_FRAME_P (debug)); \
3000 SCM_SET_TRACED_FRAME (debug); \
3001 SCM_TRAPS_P = 0;\
3002 if (SCM_CHEAPTRAPS_P)\
3003 {\
3004 tmp = scm_make_debugobj (&debug);\
3005 scm_call_3 (SCM_APPLY_FRAME_HDLR, scm_sym_apply_frame, tmp, tail);\
3006 }\
3007 else\
3008 {\
3009 int first;\
3010 tmp = scm_make_continuation (&first);\
3011 if (first)\
3012 scm_call_3 (SCM_APPLY_FRAME_HDLR, scm_sym_apply_frame, tmp, tail);\
3013 }\
3014 SCM_TRAPS_P = 1;\
3015 }\
3016 } while (0)
3017
3018 #undef RETURN
3019 #define RETURN(e) do { proc = (e); goto exit; } while (0)
3020
3021 #ifdef STACK_CHECKING
3022 #ifndef EVAL_STACK_CHECKING
3023 #define EVAL_STACK_CHECKING
3024 #endif
3025 #endif
3026
3027
3028 /* scm_last_debug_frame contains a pointer to the last debugging information
3029 * stack frame. It is accessed very often from the debugging evaluator, so it
3030 * should probably not be indirectly addressed. Better to save and restore it
3031 * from the current root at any stack swaps.
3032 */
3033
3034 /* scm_debug_eframe_size is the number of slots available for pseudo
3035 * stack frames at each real stack frame.
3036 */
3037
3038 long scm_debug_eframe_size;
3039
3040 int scm_debug_mode_p;
3041 int scm_check_entry_p;
3042 int scm_check_apply_p;
3043 int scm_check_exit_p;
3044
3045 long scm_eval_stack;
3046
3047 scm_t_option scm_eval_opts[] = {
3048 { SCM_OPTION_INTEGER, "stack", 22000, "Size of thread stacks (in machine words)." }
3049 };
3050
3051 scm_t_option scm_debug_opts[] = {
3052 { SCM_OPTION_BOOLEAN, "cheap", 1,
3053 "*Flyweight representation of the stack at traps." },
3054 { SCM_OPTION_BOOLEAN, "breakpoints", 0, "*Check for breakpoints." },
3055 { SCM_OPTION_BOOLEAN, "trace", 0, "*Trace mode." },
3056 { SCM_OPTION_BOOLEAN, "procnames", 1,
3057 "Record procedure names at definition." },
3058 { SCM_OPTION_BOOLEAN, "backwards", 0,
3059 "Display backtrace in anti-chronological order." },
3060 { SCM_OPTION_INTEGER, "width", 79, "Maximal width of backtrace." },
3061 { SCM_OPTION_INTEGER, "indent", 10, "Maximal indentation in backtrace." },
3062 { SCM_OPTION_INTEGER, "frames", 3,
3063 "Maximum number of tail-recursive frames in backtrace." },
3064 { SCM_OPTION_INTEGER, "maxdepth", 1000,
3065 "Maximal number of stored backtrace frames." },
3066 { SCM_OPTION_INTEGER, "depth", 20, "Maximal length of printed backtrace." },
3067 { SCM_OPTION_BOOLEAN, "backtrace", 0, "Show backtrace on error." },
3068 { SCM_OPTION_BOOLEAN, "debug", 0, "Use the debugging evaluator." },
3069 { SCM_OPTION_INTEGER, "stack", 20000, "Stack size limit (measured in words; 0 = no check)." },
3070 { 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."}
3071 };
3072
3073 scm_t_option scm_evaluator_trap_table[] = {
3074 { SCM_OPTION_BOOLEAN, "traps", 0, "Enable evaluator traps." },
3075 { SCM_OPTION_BOOLEAN, "enter-frame", 0, "Trap when eval enters new frame." },
3076 { SCM_OPTION_BOOLEAN, "apply-frame", 0, "Trap when entering apply." },
3077 { SCM_OPTION_BOOLEAN, "exit-frame", 0, "Trap when exiting eval or apply." },
3078 { SCM_OPTION_SCM, "enter-frame-handler", (unsigned long)SCM_BOOL_F, "Handler for enter-frame traps." },
3079 { SCM_OPTION_SCM, "apply-frame-handler", (unsigned long)SCM_BOOL_F, "Handler for apply-frame traps." },
3080 { SCM_OPTION_SCM, "exit-frame-handler", (unsigned long)SCM_BOOL_F, "Handler for exit-frame traps." }
3081 };
3082
3083 SCM_DEFINE (scm_eval_options_interface, "eval-options-interface", 0, 1, 0,
3084 (SCM setting),
3085 "Option interface for the evaluation options. Instead of using\n"
3086 "this procedure directly, use the procedures @code{eval-enable},\n"
3087 "@code{eval-disable}, @code{eval-set!} and @code{eval-options}.")
3088 #define FUNC_NAME s_scm_eval_options_interface
3089 {
3090 SCM ans;
3091 SCM_DEFER_INTS;
3092 ans = scm_options (setting,
3093 scm_eval_opts,
3094 SCM_N_EVAL_OPTIONS,
3095 FUNC_NAME);
3096 scm_eval_stack = SCM_EVAL_STACK * sizeof (void *);
3097 SCM_ALLOW_INTS;
3098 return ans;
3099 }
3100 #undef FUNC_NAME
3101
3102
3103 SCM_DEFINE (scm_evaluator_traps, "evaluator-traps-interface", 0, 1, 0,
3104 (SCM setting),
3105 "Option interface for the evaluator trap options.")
3106 #define FUNC_NAME s_scm_evaluator_traps
3107 {
3108 SCM ans;
3109 SCM_DEFER_INTS;
3110 ans = scm_options (setting,
3111 scm_evaluator_trap_table,
3112 SCM_N_EVALUATOR_TRAPS,
3113 FUNC_NAME);
3114 SCM_RESET_DEBUG_MODE;
3115 SCM_ALLOW_INTS;
3116 return ans;
3117 }
3118 #undef FUNC_NAME
3119
3120
3121 static SCM
3122 deval_args (SCM l, SCM env, SCM proc, SCM *lloc)
3123 {
3124 SCM *results = lloc;
3125 while (SCM_CONSP (l))
3126 {
3127 const SCM res = EVALCAR (l, env);
3128
3129 *lloc = scm_list_1 (res);
3130 lloc = SCM_CDRLOC (*lloc);
3131 l = SCM_CDR (l);
3132 }
3133 if (!SCM_NULLP (l))
3134 scm_wrong_num_args (proc);
3135 return *results;
3136 }
3137
3138 #endif /* !DEVAL */
3139
3140
3141 /* SECTION: This code is compiled twice.
3142 */
3143
3144
3145 /* Update the toplevel environment frame ENV so that it refers to the
3146 * current module. */
3147 #define UPDATE_TOPLEVEL_ENV(env) \
3148 do { \
3149 SCM p = scm_current_module_lookup_closure (); \
3150 if (p != SCM_CAR (env)) \
3151 env = scm_top_level_env (p); \
3152 } while (0)
3153
3154
3155 #define SCM_VALIDATE_NON_EMPTY_COMBINATION(x) \
3156 ASSERT_SYNTAX (!scm_is_eq ((x), SCM_EOL), s_empty_combination, x)
3157
3158
3159 /* This is the evaluator. Like any real monster, it has three heads:
3160 *
3161 * ceval is the non-debugging evaluator, deval is the debugging version. Both
3162 * are implemented using a common code base, using the following mechanism:
3163 * CEVAL is a macro, which is either defined to ceval or deval. Thus, there
3164 * is no function CEVAL, but the code for CEVAL actually compiles to either
3165 * ceval or deval. When CEVAL is defined to ceval, it is known that the macro
3166 * DEVAL is not defined. When CEVAL is defined to deval, then the macro DEVAL
3167 * is known to be defined. Thus, in CEVAL parts for the debugging evaluator
3168 * are enclosed within #ifdef DEVAL ... #endif.
3169 *
3170 * All three (ceval, deval and their common implementation CEVAL) take two
3171 * input parameters, x and env: x is a single expression to be evalutated.
3172 * env is the environment in which bindings are searched.
3173 *
3174 * x is known to be a pair. Since x is a single expression, it is necessarily
3175 * in a tail position. If x is just a call to another function like in the
3176 * expression (foo exp1 exp2 ...), the realization of that call therefore
3177 * _must_not_ increase stack usage (the evaluation of exp1, exp2 etc.,
3178 * however, may do so). This is realized by making extensive use of 'goto'
3179 * statements within the evaluator: The gotos replace recursive calls to
3180 * CEVAL, thus re-using the same stack frame that CEVAL was already using.
3181 * If, however, x represents some form that requires to evaluate a sequence of
3182 * expressions like (begin exp1 exp2 ...), then recursive calls to CEVAL are
3183 * performed for all but the last expression of that sequence. */
3184
3185 static SCM
3186 CEVAL (SCM x, SCM env)
3187 {
3188 SCM proc, arg1;
3189 #ifdef DEVAL
3190 scm_t_debug_frame debug;
3191 scm_t_debug_info *debug_info_end;
3192 debug.prev = scm_last_debug_frame;
3193 debug.status = 0;
3194 /*
3195 * The debug.vect contains twice as much scm_t_debug_info frames as the
3196 * user has specified with (debug-set! frames <n>).
3197 *
3198 * Even frames are eval frames, odd frames are apply frames.
3199 */
3200 debug.vect = (scm_t_debug_info *) alloca (scm_debug_eframe_size
3201 * sizeof (scm_t_debug_info));
3202 debug.info = debug.vect;
3203 debug_info_end = debug.vect + scm_debug_eframe_size;
3204 scm_last_debug_frame = &debug;
3205 #endif
3206 #ifdef EVAL_STACK_CHECKING
3207 if (scm_stack_checking_enabled_p && SCM_STACK_OVERFLOW_P (&proc))
3208 {
3209 #ifdef DEVAL
3210 debug.info->e.exp = x;
3211 debug.info->e.env = env;
3212 #endif
3213 scm_report_stack_overflow ();
3214 }
3215 #endif
3216
3217 #ifdef DEVAL
3218 goto start;
3219 #endif
3220
3221 loop:
3222 #ifdef DEVAL
3223 SCM_CLEAR_ARGSREADY (debug);
3224 if (SCM_OVERFLOWP (debug))
3225 --debug.info;
3226 /*
3227 * In theory, this should be the only place where it is necessary to
3228 * check for space in debug.vect since both eval frames and
3229 * available space are even.
3230 *
3231 * For this to be the case, however, it is necessary that primitive
3232 * special forms which jump back to `loop', `begin' or some similar
3233 * label call PREP_APPLY.
3234 */
3235 else if (++debug.info >= debug_info_end)
3236 {
3237 SCM_SET_OVERFLOW (debug);
3238 debug.info -= 2;
3239 }
3240
3241 start:
3242 debug.info->e.exp = x;
3243 debug.info->e.env = env;
3244 if (scm_check_entry_p && SCM_TRAPS_P)
3245 {
3246 if (SCM_ENTER_FRAME_P
3247 || (SCM_BREAKPOINTS_P && scm_c_source_property_breakpoint_p (x)))
3248 {
3249 SCM stackrep;
3250 SCM tail = scm_from_bool (SCM_TAILRECP (debug));
3251 SCM_SET_TAILREC (debug);
3252 if (SCM_CHEAPTRAPS_P)
3253 stackrep = scm_make_debugobj (&debug);
3254 else
3255 {
3256 int first;
3257 SCM val = scm_make_continuation (&first);
3258
3259 if (first)
3260 stackrep = val;
3261 else
3262 {
3263 x = val;
3264 if (SCM_IMP (x))
3265 RETURN (x);
3266 else
3267 /* This gives the possibility for the debugger to
3268 modify the source expression before evaluation. */
3269 goto dispatch;
3270 }
3271 }
3272 SCM_TRAPS_P = 0;
3273 scm_call_4 (SCM_ENTER_FRAME_HDLR,
3274 scm_sym_enter_frame,
3275 stackrep,
3276 tail,
3277 unmemoize_expression (x, env));
3278 SCM_TRAPS_P = 1;
3279 }
3280 }
3281 #endif
3282 dispatch:
3283 SCM_TICK;
3284 if (SCM_ISYMP (SCM_CAR (x)))
3285 {
3286 switch (ISYMNUM (SCM_CAR (x)))
3287 {
3288 case (ISYMNUM (SCM_IM_AND)):
3289 x = SCM_CDR (x);
3290 while (!SCM_NULLP (SCM_CDR (x)))
3291 {
3292 SCM test_result = EVALCAR (x, env);
3293 if (scm_is_false (test_result) || SCM_NILP (test_result))
3294 RETURN (SCM_BOOL_F);
3295 else
3296 x = SCM_CDR (x);
3297 }
3298 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
3299 goto carloop;
3300
3301 case (ISYMNUM (SCM_IM_BEGIN)):
3302 x = SCM_CDR (x);
3303 if (SCM_NULLP (x))
3304 RETURN (SCM_UNSPECIFIED);
3305
3306 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
3307
3308 begin:
3309 /* If we are on toplevel with a lookup closure, we need to sync
3310 with the current module. */
3311 if (SCM_CONSP (env) && !SCM_CONSP (SCM_CAR (env)))
3312 {
3313 UPDATE_TOPLEVEL_ENV (env);
3314 while (!SCM_NULLP (SCM_CDR (x)))
3315 {
3316 EVALCAR (x, env);
3317 UPDATE_TOPLEVEL_ENV (env);
3318 x = SCM_CDR (x);
3319 }
3320 goto carloop;
3321 }
3322 else
3323 goto nontoplevel_begin;
3324
3325 nontoplevel_begin:
3326 while (!SCM_NULLP (SCM_CDR (x)))
3327 {
3328 const SCM form = SCM_CAR (x);
3329 if (SCM_IMP (form))
3330 {
3331 if (SCM_ISYMP (form))
3332 {
3333 scm_rec_mutex_lock (&source_mutex);
3334 /* check for race condition */
3335 if (SCM_ISYMP (SCM_CAR (x)))
3336 m_expand_body (x, env);
3337 scm_rec_mutex_unlock (&source_mutex);
3338 goto nontoplevel_begin;
3339 }
3340 else
3341 SCM_VALIDATE_NON_EMPTY_COMBINATION (form);
3342 }
3343 else
3344 (void) EVAL (form, env);
3345 x = SCM_CDR (x);
3346 }
3347
3348 carloop:
3349 {
3350 /* scm_eval last form in list */
3351 const SCM last_form = SCM_CAR (x);
3352
3353 if (SCM_CONSP (last_form))
3354 {
3355 /* This is by far the most frequent case. */
3356 x = last_form;
3357 goto loop; /* tail recurse */
3358 }
3359 else if (SCM_IMP (last_form))
3360 RETURN (SCM_I_EVALIM (last_form, env));
3361 else if (SCM_VARIABLEP (last_form))
3362 RETURN (SCM_VARIABLE_REF (last_form));
3363 else if (scm_is_symbol (last_form))
3364 RETURN (*scm_lookupcar (x, env, 1));
3365 else
3366 RETURN (last_form);
3367 }
3368
3369
3370 case (ISYMNUM (SCM_IM_CASE)):
3371 x = SCM_CDR (x);
3372 {
3373 const SCM key = EVALCAR (x, env);
3374 x = SCM_CDR (x);
3375 while (!SCM_NULLP (x))
3376 {
3377 const SCM clause = SCM_CAR (x);
3378 SCM labels = SCM_CAR (clause);
3379 if (scm_is_eq (labels, SCM_IM_ELSE))
3380 {
3381 x = SCM_CDR (clause);
3382 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
3383 goto begin;
3384 }
3385 while (!SCM_NULLP (labels))
3386 {
3387 const SCM label = SCM_CAR (labels);
3388 if (scm_is_eq (label, key)
3389 || scm_is_true (scm_eqv_p (label, key)))
3390 {
3391 x = SCM_CDR (clause);
3392 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
3393 goto begin;
3394 }
3395 labels = SCM_CDR (labels);
3396 }
3397 x = SCM_CDR (x);
3398 }
3399 }
3400 RETURN (SCM_UNSPECIFIED);
3401
3402
3403 case (ISYMNUM (SCM_IM_COND)):
3404 x = SCM_CDR (x);
3405 while (!SCM_NULLP (x))
3406 {
3407 const SCM clause = SCM_CAR (x);
3408 if (scm_is_eq (SCM_CAR (clause), SCM_IM_ELSE))
3409 {
3410 x = SCM_CDR (clause);
3411 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
3412 goto begin;
3413 }
3414 else
3415 {
3416 arg1 = EVALCAR (clause, env);
3417 if (scm_is_true (arg1) && !SCM_NILP (arg1))
3418 {
3419 x = SCM_CDR (clause);
3420 if (SCM_NULLP (x))
3421 RETURN (arg1);
3422 else if (!scm_is_eq (SCM_CAR (x), SCM_IM_ARROW))
3423 {
3424 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
3425 goto begin;
3426 }
3427 else
3428 {
3429 proc = SCM_CDR (x);
3430 proc = EVALCAR (proc, env);
3431 PREP_APPLY (proc, scm_list_1 (arg1));
3432 ENTER_APPLY;
3433 goto evap1;
3434 }
3435 }
3436 x = SCM_CDR (x);
3437 }
3438 }
3439 RETURN (SCM_UNSPECIFIED);
3440
3441
3442 case (ISYMNUM (SCM_IM_DO)):
3443 x = SCM_CDR (x);
3444 {
3445 /* Compute the initialization values and the initial environment. */
3446 SCM init_forms = SCM_CAR (x);
3447 SCM init_values = SCM_EOL;
3448 while (!SCM_NULLP (init_forms))
3449 {
3450 init_values = scm_cons (EVALCAR (init_forms, env), init_values);
3451 init_forms = SCM_CDR (init_forms);
3452 }
3453 x = SCM_CDR (x);
3454 env = SCM_EXTEND_ENV (SCM_CAR (x), init_values, env);
3455 }
3456 x = SCM_CDR (x);
3457 {
3458 SCM test_form = SCM_CAR (x);
3459 SCM body_forms = SCM_CADR (x);
3460 SCM step_forms = SCM_CDDR (x);
3461
3462 SCM test_result = EVALCAR (test_form, env);
3463
3464 while (scm_is_false (test_result) || SCM_NILP (test_result))
3465 {
3466 {
3467 /* Evaluate body forms. */
3468 SCM temp_forms;
3469 for (temp_forms = body_forms;
3470 !SCM_NULLP (temp_forms);
3471 temp_forms = SCM_CDR (temp_forms))
3472 {
3473 SCM form = SCM_CAR (temp_forms);
3474 /* Dirk:FIXME: We only need to eval forms that may have
3475 * a side effect here. This is only true for forms that
3476 * start with a pair. All others are just constants.
3477 * Since with the current memoizer 'form' may hold a
3478 * constant, we call EVAL here to handle the constant
3479 * cases. In the long run it would make sense to have
3480 * the macro transformer of 'do' eliminate all forms
3481 * that have no sideeffect. Then instead of EVAL we
3482 * could call CEVAL directly here. */
3483 (void) EVAL (form, env);
3484 }
3485 }
3486
3487 {
3488 /* Evaluate the step expressions. */
3489 SCM temp_forms;
3490 SCM step_values = SCM_EOL;
3491 for (temp_forms = step_forms;
3492 !SCM_NULLP (temp_forms);
3493 temp_forms = SCM_CDR (temp_forms))
3494 {
3495 const SCM value = EVALCAR (temp_forms, env);
3496 step_values = scm_cons (value, step_values);
3497 }
3498 env = SCM_EXTEND_ENV (SCM_CAAR (env),
3499 step_values,
3500 SCM_CDR (env));
3501 }
3502
3503 test_result = EVALCAR (test_form, env);
3504 }
3505 }
3506 x = SCM_CDAR (x);
3507 if (SCM_NULLP (x))
3508 RETURN (SCM_UNSPECIFIED);
3509 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
3510 goto nontoplevel_begin;
3511
3512
3513 case (ISYMNUM (SCM_IM_IF)):
3514 x = SCM_CDR (x);
3515 {
3516 SCM test_result = EVALCAR (x, env);
3517 x = SCM_CDR (x); /* then expression */
3518 if (scm_is_false (test_result) || SCM_NILP (test_result))
3519 {
3520 x = SCM_CDR (x); /* else expression */
3521 if (SCM_NULLP (x))
3522 RETURN (SCM_UNSPECIFIED);
3523 }
3524 }
3525 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
3526 goto carloop;
3527
3528
3529 case (ISYMNUM (SCM_IM_LET)):
3530 x = SCM_CDR (x);
3531 {
3532 SCM init_forms = SCM_CADR (x);
3533 SCM init_values = SCM_EOL;
3534 do
3535 {
3536 init_values = scm_cons (EVALCAR (init_forms, env), init_values);
3537 init_forms = SCM_CDR (init_forms);
3538 }
3539 while (!SCM_NULLP (init_forms));
3540 env = SCM_EXTEND_ENV (SCM_CAR (x), init_values, env);
3541 }
3542 x = SCM_CDDR (x);
3543 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
3544 goto nontoplevel_begin;
3545
3546
3547 case (ISYMNUM (SCM_IM_LETREC)):
3548 x = SCM_CDR (x);
3549 env = SCM_EXTEND_ENV (SCM_CAR (x), undefineds, env);
3550 x = SCM_CDR (x);
3551 {
3552 SCM init_forms = SCM_CAR (x);
3553 SCM init_values = SCM_EOL;
3554 do
3555 {
3556 init_values = scm_cons (EVALCAR (init_forms, env), init_values);
3557 init_forms = SCM_CDR (init_forms);
3558 }
3559 while (!SCM_NULLP (init_forms));
3560 SCM_SETCDR (SCM_CAR (env), init_values);
3561 }
3562 x = SCM_CDR (x);
3563 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
3564 goto nontoplevel_begin;
3565
3566
3567 case (ISYMNUM (SCM_IM_LETSTAR)):
3568 x = SCM_CDR (x);
3569 {
3570 SCM bindings = SCM_CAR (x);
3571 if (!SCM_NULLP (bindings))
3572 {
3573 do
3574 {
3575 SCM name = SCM_CAR (bindings);
3576 SCM init = SCM_CDR (bindings);
3577 env = SCM_EXTEND_ENV (name, EVALCAR (init, env), env);
3578 bindings = SCM_CDR (init);
3579 }
3580 while (!SCM_NULLP (bindings));
3581 }
3582 }
3583 x = SCM_CDR (x);
3584 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
3585 goto nontoplevel_begin;
3586
3587
3588 case (ISYMNUM (SCM_IM_OR)):
3589 x = SCM_CDR (x);
3590 while (!SCM_NULLP (SCM_CDR (x)))
3591 {
3592 SCM val = EVALCAR (x, env);
3593 if (scm_is_true (val) && !SCM_NILP (val))
3594 RETURN (val);
3595 else
3596 x = SCM_CDR (x);
3597 }
3598 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
3599 goto carloop;
3600
3601
3602 case (ISYMNUM (SCM_IM_LAMBDA)):
3603 RETURN (scm_closure (SCM_CDR (x), env));
3604
3605
3606 case (ISYMNUM (SCM_IM_QUOTE)):
3607 RETURN (SCM_CDR (x));
3608
3609
3610 case (ISYMNUM (SCM_IM_SET_X)):
3611 x = SCM_CDR (x);
3612 {
3613 SCM *location;
3614 SCM variable = SCM_CAR (x);
3615 if (SCM_ILOCP (variable))
3616 location = scm_ilookup (variable, env);
3617 else if (SCM_VARIABLEP (variable))
3618 location = SCM_VARIABLE_LOC (variable);
3619 else
3620 {
3621 /* (scm_is_symbol (variable)) is known to be true */
3622 variable = lazy_memoize_variable (variable, env);
3623 SCM_SETCAR (x, variable);
3624 location = SCM_VARIABLE_LOC (variable);
3625 }
3626 x = SCM_CDR (x);
3627 *location = EVALCAR (x, env);
3628 }
3629 RETURN (SCM_UNSPECIFIED);
3630
3631
3632 case (ISYMNUM (SCM_IM_APPLY)):
3633 /* Evaluate the procedure to be applied. */
3634 x = SCM_CDR (x);
3635 proc = EVALCAR (x, env);
3636 PREP_APPLY (proc, SCM_EOL);
3637
3638 /* Evaluate the argument holding the list of arguments */
3639 x = SCM_CDR (x);
3640 arg1 = EVALCAR (x, env);
3641
3642 apply_proc:
3643 /* Go here to tail-apply a procedure. PROC is the procedure and
3644 * ARG1 is the list of arguments. PREP_APPLY must have been called
3645 * before jumping to apply_proc. */
3646 if (SCM_CLOSUREP (proc))
3647 {
3648 SCM formals = SCM_CLOSURE_FORMALS (proc);
3649 #ifdef DEVAL
3650 debug.info->a.args = arg1;
3651 #endif
3652 if (scm_badargsp (formals, arg1))
3653 scm_wrong_num_args (proc);
3654 ENTER_APPLY;
3655 /* Copy argument list */
3656 if (SCM_NULL_OR_NIL_P (arg1))
3657 env = SCM_EXTEND_ENV (formals, SCM_EOL, SCM_ENV (proc));
3658 else
3659 {
3660 SCM args = scm_list_1 (SCM_CAR (arg1));
3661 SCM tail = args;
3662 arg1 = SCM_CDR (arg1);
3663 while (!SCM_NULL_OR_NIL_P (arg1))
3664 {
3665 SCM new_tail = scm_list_1 (SCM_CAR (arg1));
3666 SCM_SETCDR (tail, new_tail);
3667 tail = new_tail;
3668 arg1 = SCM_CDR (arg1);
3669 }
3670 env = SCM_EXTEND_ENV (formals, args, SCM_ENV (proc));
3671 }
3672
3673 x = SCM_CLOSURE_BODY (proc);
3674 goto nontoplevel_begin;
3675 }
3676 else
3677 {
3678 ENTER_APPLY;
3679 RETURN (SCM_APPLY (proc, arg1, SCM_EOL));
3680 }
3681
3682
3683 case (ISYMNUM (SCM_IM_CONT)):
3684 {
3685 int first;
3686 SCM val = scm_make_continuation (&first);
3687
3688 if (!first)
3689 RETURN (val);
3690 else
3691 {
3692 arg1 = val;
3693 proc = SCM_CDR (x);
3694 proc = EVALCAR (proc, env);
3695 PREP_APPLY (proc, scm_list_1 (arg1));
3696 ENTER_APPLY;
3697 goto evap1;
3698 }
3699 }
3700
3701
3702 case (ISYMNUM (SCM_IM_DELAY)):
3703 RETURN (scm_makprom (scm_closure (SCM_CDR (x), env)));
3704
3705
3706 case (ISYMNUM (SCM_IM_FUTURE)):
3707 RETURN (scm_i_make_future (scm_closure (SCM_CDR (x), env)));
3708
3709
3710 /* PLACEHOLDER for case (ISYMNUM (SCM_IM_DISPATCH)): The following
3711 code (type_dispatch) is intended to be the tail of the case
3712 clause for the internal macro SCM_IM_DISPATCH. Please don't
3713 remove it from this location without discussing it with Mikael
3714 <djurfeldt@nada.kth.se> */
3715
3716 /* The type dispatch code is duplicated below
3717 * (c.f. objects.c:scm_mcache_compute_cmethod) since that
3718 * cuts down execution time for type dispatch to 50%. */
3719 type_dispatch: /* inputs: x, arg1 */
3720 /* Type dispatch means to determine from the types of the function
3721 * arguments (i. e. the 'signature' of the call), which method from
3722 * a generic function is to be called. This process of selecting
3723 * the right method takes some time. To speed it up, guile uses
3724 * caching: Together with the macro call to dispatch the signatures
3725 * of some previous calls to that generic function from the same
3726 * place are stored (in the code!) in a cache that we call the
3727 * 'method cache'. This is done since it is likely, that
3728 * consecutive calls to dispatch from that position in the code will
3729 * have the same signature. Thus, the type dispatch works as
3730 * follows: First, determine a hash value from the signature of the
3731 * actual arguments. Second, use this hash value as an index to
3732 * find that same signature in the method cache stored at this
3733 * position in the code. If found, you have also found the
3734 * corresponding method that belongs to that signature. If the
3735 * signature is not found in the method cache, you have to perform a
3736 * full search over all signatures stored with the generic
3737 * function. */
3738 {
3739 unsigned long int specializers;
3740 unsigned long int hash_value;
3741 unsigned long int cache_end_pos;
3742 unsigned long int mask;
3743 SCM method_cache;
3744
3745 {
3746 SCM z = SCM_CDDR (x);
3747 SCM tmp = SCM_CADR (z);
3748 specializers = scm_to_ulong (SCM_CAR (z));
3749
3750 /* Compute a hash value for searching the method cache. There
3751 * are two variants for computing the hash value, a (rather)
3752 * complicated one, and a simple one. For the complicated one
3753 * explained below, tmp holds a number that is used in the
3754 * computation. */
3755 if (SCM_VECTORP (tmp))
3756 {
3757 /* This method of determining the hash value is much
3758 * simpler: Set the hash value to zero and just perform a
3759 * linear search through the method cache. */
3760 method_cache = tmp;
3761 mask = (unsigned long int) ((long) -1);
3762 hash_value = 0;
3763 cache_end_pos = SCM_VECTOR_LENGTH (method_cache);
3764 }
3765 else
3766 {
3767 /* Use the signature of the actual arguments to determine
3768 * the hash value. This is done as follows: Each class has
3769 * an array of random numbers, that are determined when the
3770 * class is created. The integer 'hashset' is an index into
3771 * that array of random numbers. Now, from all classes that
3772 * are part of the signature of the actual arguments, the
3773 * random numbers at index 'hashset' are taken and summed
3774 * up, giving the hash value. The value of 'hashset' is
3775 * stored at the call to dispatch. This allows to have
3776 * different 'formulas' for calculating the hash value at
3777 * different places where dispatch is called. This allows
3778 * to optimize the hash formula at every individual place
3779 * where dispatch is called, such that hopefully the hash
3780 * value that is computed will directly point to the right
3781 * method in the method cache. */
3782 unsigned long int hashset = scm_to_ulong (tmp);
3783 unsigned long int counter = specializers + 1;
3784 SCM tmp_arg = arg1;
3785 hash_value = 0;
3786 while (!SCM_NULLP (tmp_arg) && counter != 0)
3787 {
3788 SCM class = scm_class_of (SCM_CAR (tmp_arg));
3789 hash_value += SCM_INSTANCE_HASH (class, hashset);
3790 tmp_arg = SCM_CDR (tmp_arg);
3791 counter--;
3792 }
3793 z = SCM_CDDR (z);
3794 method_cache = SCM_CADR (z);
3795 mask = scm_to_ulong (SCM_CAR (z));
3796 hash_value &= mask;
3797 cache_end_pos = hash_value;
3798 }
3799 }
3800
3801 {
3802 /* Search the method cache for a method with a matching
3803 * signature. Start the search at position 'hash_value'. The
3804 * hashing implementation uses linear probing for conflict
3805 * resolution, that is, if the signature in question is not
3806 * found at the starting index in the hash table, the next table
3807 * entry is tried, and so on, until in the worst case the whole
3808 * cache has been searched, but still the signature has not been
3809 * found. */
3810 SCM z;
3811 do
3812 {
3813 SCM args = arg1; /* list of arguments */
3814 z = SCM_VELTS (method_cache)[hash_value];
3815 while (!SCM_NULLP (args))
3816 {
3817 /* More arguments than specifiers => CLASS != ENV */
3818 SCM class_of_arg = scm_class_of (SCM_CAR (args));
3819 if (!scm_is_eq (class_of_arg, SCM_CAR (z)))
3820 goto next_method;
3821 args = SCM_CDR (args);
3822 z = SCM_CDR (z);
3823 }
3824 /* Fewer arguments than specifiers => CAR != ENV */
3825 if (SCM_NULLP (SCM_CAR (z)) || SCM_CONSP (SCM_CAR (z)))
3826 goto apply_cmethod;
3827 next_method:
3828 hash_value = (hash_value + 1) & mask;
3829 } while (hash_value != cache_end_pos);
3830
3831 /* No appropriate method was found in the cache. */
3832 z = scm_memoize_method (x, arg1);
3833
3834 apply_cmethod: /* inputs: z, arg1 */
3835 {
3836 SCM formals = SCM_CMETHOD_FORMALS (z);
3837 env = SCM_EXTEND_ENV (formals, arg1, SCM_CMETHOD_ENV (z));
3838 x = SCM_CMETHOD_BODY (z);
3839 goto nontoplevel_begin;
3840 }
3841 }
3842 }
3843
3844
3845 case (ISYMNUM (SCM_IM_SLOT_REF)):
3846 x = SCM_CDR (x);
3847 {
3848 SCM instance = EVALCAR (x, env);
3849 unsigned long int slot = SCM_I_INUM (SCM_CDR (x));
3850 RETURN (SCM_PACK (SCM_STRUCT_DATA (instance) [slot]));
3851 }
3852
3853
3854 case (ISYMNUM (SCM_IM_SLOT_SET_X)):
3855 x = SCM_CDR (x);
3856 {
3857 SCM instance = EVALCAR (x, env);
3858 unsigned long int slot = SCM_I_INUM (SCM_CADR (x));
3859 SCM value = EVALCAR (SCM_CDDR (x), env);
3860 SCM_STRUCT_DATA (instance) [slot] = SCM_UNPACK (value);
3861 RETURN (SCM_UNSPECIFIED);
3862 }
3863
3864
3865 #if SCM_ENABLE_ELISP
3866
3867 case (ISYMNUM (SCM_IM_NIL_COND)):
3868 {
3869 SCM test_form = SCM_CDR (x);
3870 x = SCM_CDR (test_form);
3871 while (!SCM_NULL_OR_NIL_P (x))
3872 {
3873 SCM test_result = EVALCAR (test_form, env);
3874 if (!(scm_is_false (test_result)
3875 || SCM_NULL_OR_NIL_P (test_result)))
3876 {
3877 if (scm_is_eq (SCM_CAR (x), SCM_UNSPECIFIED))
3878 RETURN (test_result);
3879 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
3880 goto carloop;
3881 }
3882 else
3883 {
3884 test_form = SCM_CDR (x);
3885 x = SCM_CDR (test_form);
3886 }
3887 }
3888 x = test_form;
3889 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
3890 goto carloop;
3891 }
3892
3893 #endif /* SCM_ENABLE_ELISP */
3894
3895 case (ISYMNUM (SCM_IM_BIND)):
3896 {
3897 SCM vars, exps, vals;
3898
3899 x = SCM_CDR (x);
3900 vars = SCM_CAAR (x);
3901 exps = SCM_CDAR (x);
3902 vals = SCM_EOL;
3903 while (!SCM_NULLP (exps))
3904 {
3905 vals = scm_cons (EVALCAR (exps, env), vals);
3906 exps = SCM_CDR (exps);
3907 }
3908
3909 scm_swap_bindings (vars, vals);
3910 scm_dynwinds = scm_acons (vars, vals, scm_dynwinds);
3911
3912 /* Ignore all but the last evaluation result. */
3913 for (x = SCM_CDR (x); !SCM_NULLP (SCM_CDR (x)); x = SCM_CDR (x))
3914 {
3915 if (SCM_CONSP (SCM_CAR (x)))
3916 CEVAL (SCM_CAR (x), env);
3917 }
3918 proc = EVALCAR (x, env);
3919
3920 scm_dynwinds = SCM_CDR (scm_dynwinds);
3921 scm_swap_bindings (vars, vals);
3922
3923 RETURN (proc);
3924 }
3925
3926
3927 case (ISYMNUM (SCM_IM_CALL_WITH_VALUES)):
3928 {
3929 SCM producer;
3930
3931 x = SCM_CDR (x);
3932 producer = EVALCAR (x, env);
3933 x = SCM_CDR (x);
3934 proc = EVALCAR (x, env); /* proc is the consumer. */
3935 arg1 = SCM_APPLY (producer, SCM_EOL, SCM_EOL);
3936 if (SCM_VALUESP (arg1))
3937 {
3938 /* The list of arguments is not copied. Rather, it is assumed
3939 * that this has been done by the 'values' procedure. */
3940 arg1 = scm_struct_ref (arg1, SCM_INUM0);
3941 }
3942 else
3943 {
3944 arg1 = scm_list_1 (arg1);
3945 }
3946 PREP_APPLY (proc, arg1);
3947 goto apply_proc;
3948 }
3949
3950
3951 default:
3952 break;
3953 }
3954 }
3955 else
3956 {
3957 if (SCM_VARIABLEP (SCM_CAR (x)))
3958 proc = SCM_VARIABLE_REF (SCM_CAR (x));
3959 else if (SCM_ILOCP (SCM_CAR (x)))
3960 proc = *scm_ilookup (SCM_CAR (x), env);
3961 else if (SCM_CONSP (SCM_CAR (x)))
3962 proc = CEVAL (SCM_CAR (x), env);
3963 else if (scm_is_symbol (SCM_CAR (x)))
3964 {
3965 SCM orig_sym = SCM_CAR (x);
3966 {
3967 SCM *location = scm_lookupcar1 (x, env, 1);
3968 if (location == NULL)
3969 {
3970 /* we have lost the race, start again. */
3971 goto dispatch;
3972 }
3973 proc = *location;
3974 }
3975
3976 if (SCM_MACROP (proc))
3977 {
3978 SCM_SETCAR (x, orig_sym); /* Undo memoizing effect of
3979 lookupcar */
3980 handle_a_macro: /* inputs: x, env, proc */
3981 #ifdef DEVAL
3982 /* Set a flag during macro expansion so that macro
3983 application frames can be deleted from the backtrace. */
3984 SCM_SET_MACROEXP (debug);
3985 #endif
3986 arg1 = SCM_APPLY (SCM_MACRO_CODE (proc), x,
3987 scm_cons (env, scm_listofnull));
3988 #ifdef DEVAL
3989 SCM_CLEAR_MACROEXP (debug);
3990 #endif
3991 switch (SCM_MACRO_TYPE (proc))
3992 {
3993 case 3:
3994 case 2:
3995 if (!SCM_CONSP (arg1))
3996 arg1 = scm_list_2 (SCM_IM_BEGIN, arg1);
3997
3998 assert (!scm_is_eq (x, SCM_CAR (arg1))
3999 && !scm_is_eq (x, SCM_CDR (arg1)));
4000
4001 #ifdef DEVAL
4002 if (!SCM_CLOSUREP (SCM_MACRO_CODE (proc)))
4003 {
4004 SCM_DEFER_INTS;
4005 SCM_SETCAR (x, SCM_CAR (arg1));
4006 SCM_SETCDR (x, SCM_CDR (arg1));
4007 SCM_ALLOW_INTS;
4008 goto dispatch;
4009 }
4010 /* Prevent memoizing of debug info expression. */
4011 debug.info->e.exp = scm_cons_source (debug.info->e.exp,
4012 SCM_CAR (x),
4013 SCM_CDR (x));
4014 #endif
4015 SCM_DEFER_INTS;
4016 SCM_SETCAR (x, SCM_CAR (arg1));
4017 SCM_SETCDR (x, SCM_CDR (arg1));
4018 SCM_ALLOW_INTS;
4019 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
4020 goto loop;
4021 #if SCM_ENABLE_DEPRECATED == 1
4022 case 1:
4023 x = arg1;
4024 if (SCM_NIMP (x))
4025 {
4026 PREP_APPLY (SCM_UNDEFINED, SCM_EOL);
4027 goto loop;
4028 }
4029 else
4030 RETURN (arg1);
4031 #endif
4032 case 0:
4033 RETURN (arg1);
4034 }
4035 }
4036 }
4037 else
4038 proc = SCM_CAR (x);
4039
4040 if (SCM_MACROP (proc))
4041 goto handle_a_macro;
4042 }
4043
4044
4045 /* When reaching this part of the code, the following is granted: Variable x
4046 * holds the first pair of an expression of the form (<function> arg ...).
4047 * Variable proc holds the object that resulted from the evaluation of
4048 * <function>. In the following, the arguments (if any) will be evaluated,
4049 * and proc will be applied to them. If proc does not really hold a
4050 * function object, this will be signalled as an error on the scheme
4051 * level. If the number of arguments does not match the number of arguments
4052 * that are allowed to be passed to proc, also an error on the scheme level
4053 * will be signalled. */
4054 PREP_APPLY (proc, SCM_EOL);
4055 if (SCM_NULLP (SCM_CDR (x))) {
4056 ENTER_APPLY;
4057 evap0:
4058 SCM_ASRTGO (!SCM_IMP (proc), badfun);
4059 switch (SCM_TYP7 (proc))
4060 { /* no arguments given */
4061 case scm_tc7_subr_0:
4062 RETURN (SCM_SUBRF (proc) ());
4063 case scm_tc7_subr_1o:
4064 RETURN (SCM_SUBRF (proc) (SCM_UNDEFINED));
4065 case scm_tc7_lsubr:
4066 RETURN (SCM_SUBRF (proc) (SCM_EOL));
4067 case scm_tc7_rpsubr:
4068 RETURN (SCM_BOOL_T);
4069 case scm_tc7_asubr:
4070 RETURN (SCM_SUBRF (proc) (SCM_UNDEFINED, SCM_UNDEFINED));
4071 case scm_tc7_smob:
4072 if (!SCM_SMOB_APPLICABLE_P (proc))
4073 goto badfun;
4074 RETURN (SCM_SMOB_APPLY_0 (proc));
4075 case scm_tc7_cclo:
4076 arg1 = proc;
4077 proc = SCM_CCLO_SUBR (proc);
4078 #ifdef DEVAL
4079 debug.info->a.proc = proc;
4080 debug.info->a.args = scm_list_1 (arg1);
4081 #endif
4082 goto evap1;
4083 case scm_tc7_pws:
4084 proc = SCM_PROCEDURE (proc);
4085 #ifdef DEVAL
4086 debug.info->a.proc = proc;
4087 #endif
4088 if (!SCM_CLOSUREP (proc))
4089 goto evap0;
4090 /* fallthrough */
4091 case scm_tcs_closures:
4092 {
4093 const SCM formals = SCM_CLOSURE_FORMALS (proc);
4094 if (SCM_CONSP (formals))
4095 goto wrongnumargs;
4096 x = SCM_CLOSURE_BODY (proc);
4097 env = SCM_EXTEND_ENV (formals, SCM_EOL, SCM_ENV (proc));
4098 goto nontoplevel_begin;
4099 }
4100 case scm_tcs_struct:
4101 if (SCM_OBJ_CLASS_FLAGS (proc) & SCM_CLASSF_PURE_GENERIC)
4102 {
4103 x = SCM_ENTITY_PROCEDURE (proc);
4104 arg1 = SCM_EOL;
4105 goto type_dispatch;
4106 }
4107 else if (SCM_I_OPERATORP (proc))
4108 {
4109 arg1 = proc;
4110 proc = (SCM_I_ENTITYP (proc)
4111 ? SCM_ENTITY_PROCEDURE (proc)
4112 : SCM_OPERATOR_PROCEDURE (proc));
4113 #ifdef DEVAL
4114 debug.info->a.proc = proc;
4115 debug.info->a.args = scm_list_1 (arg1);
4116 #endif
4117 goto evap1;
4118 }
4119 else
4120 goto badfun;
4121 case scm_tc7_subr_1:
4122 case scm_tc7_subr_2:
4123 case scm_tc7_subr_2o:
4124 case scm_tc7_dsubr:
4125 case scm_tc7_cxr:
4126 case scm_tc7_subr_3:
4127 case scm_tc7_lsubr_2:
4128 wrongnumargs:
4129 scm_wrong_num_args (proc);
4130 default:
4131 badfun:
4132 scm_misc_error (NULL, "Wrong type to apply: ~S", scm_list_1 (proc));
4133 }
4134 }
4135
4136 /* must handle macros by here */
4137 x = SCM_CDR (x);
4138 if (SCM_CONSP (x))
4139 arg1 = EVALCAR (x, env);
4140 else
4141 scm_wrong_num_args (proc);
4142 #ifdef DEVAL
4143 debug.info->a.args = scm_list_1 (arg1);
4144 #endif
4145 x = SCM_CDR (x);
4146 {
4147 SCM arg2;
4148 if (SCM_NULLP (x))
4149 {
4150 ENTER_APPLY;
4151 evap1: /* inputs: proc, arg1 */
4152 SCM_ASRTGO (!SCM_IMP (proc), badfun);
4153 switch (SCM_TYP7 (proc))
4154 { /* have one argument in arg1 */
4155 case scm_tc7_subr_2o:
4156 RETURN (SCM_SUBRF (proc) (arg1, SCM_UNDEFINED));
4157 case scm_tc7_subr_1:
4158 case scm_tc7_subr_1o:
4159 RETURN (SCM_SUBRF (proc) (arg1));
4160 case scm_tc7_dsubr:
4161 if (SCM_I_INUMP (arg1))
4162 {
4163 RETURN (scm_from_double (SCM_DSUBRF (proc) ((double) SCM_I_INUM (arg1))));
4164 }
4165 else if (SCM_REALP (arg1))
4166 {
4167 RETURN (scm_from_double (SCM_DSUBRF (proc) (SCM_REAL_VALUE (arg1))));
4168 }
4169 else if (SCM_BIGP (arg1))
4170 {
4171 RETURN (scm_from_double (SCM_DSUBRF (proc) (scm_i_big2dbl (arg1))));
4172 }
4173 else if (SCM_FRACTIONP (arg1))
4174 {
4175 RETURN (scm_from_double (SCM_DSUBRF (proc) (scm_i_fraction2double (arg1))));
4176 }
4177 SCM_WTA_DISPATCH_1 (*SCM_SUBR_GENERIC (proc), arg1,
4178 SCM_ARG1,
4179 scm_i_symbol_chars (SCM_SNAME (proc)));
4180 case scm_tc7_cxr:
4181 {
4182 unsigned char pattern = (scm_t_bits) SCM_SUBRF (proc);
4183 do
4184 {
4185 SCM_ASSERT (SCM_CONSP (arg1), arg1, SCM_ARG1,
4186 scm_i_symbol_chars (SCM_SNAME (proc)));
4187 arg1 = (pattern & 1) ? SCM_CAR (arg1) : SCM_CDR (arg1);
4188 pattern >>= 2;
4189 } while (pattern);
4190 RETURN (arg1);
4191 }
4192 case scm_tc7_rpsubr:
4193 RETURN (SCM_BOOL_T);
4194 case scm_tc7_asubr:
4195 RETURN (SCM_SUBRF (proc) (arg1, SCM_UNDEFINED));
4196 case scm_tc7_lsubr:
4197 #ifdef DEVAL
4198 RETURN (SCM_SUBRF (proc) (debug.info->a.args));
4199 #else
4200 RETURN (SCM_SUBRF (proc) (scm_list_1 (arg1)));
4201 #endif
4202 case scm_tc7_smob:
4203 if (!SCM_SMOB_APPLICABLE_P (proc))
4204 goto badfun;
4205 RETURN (SCM_SMOB_APPLY_1 (proc, arg1));
4206 case scm_tc7_cclo:
4207 arg2 = arg1;
4208 arg1 = proc;
4209 proc = SCM_CCLO_SUBR (proc);
4210 #ifdef DEVAL
4211 debug.info->a.args = scm_cons (arg1, debug.info->a.args);
4212 debug.info->a.proc = proc;
4213 #endif
4214 goto evap2;
4215 case scm_tc7_pws:
4216 proc = SCM_PROCEDURE (proc);
4217 #ifdef DEVAL
4218 debug.info->a.proc = proc;
4219 #endif
4220 if (!SCM_CLOSUREP (proc))
4221 goto evap1;
4222 /* fallthrough */
4223 case scm_tcs_closures:
4224 {
4225 /* clos1: */
4226 const SCM formals = SCM_CLOSURE_FORMALS (proc);
4227 if (SCM_NULLP (formals)
4228 || (SCM_CONSP (formals) && SCM_CONSP (SCM_CDR (formals))))
4229 goto wrongnumargs;
4230 x = SCM_CLOSURE_BODY (proc);
4231 #ifdef DEVAL
4232 env = SCM_EXTEND_ENV (formals,
4233 debug.info->a.args,
4234 SCM_ENV (proc));
4235 #else
4236 env = SCM_EXTEND_ENV (formals,
4237 scm_list_1 (arg1),
4238 SCM_ENV (proc));
4239 #endif
4240 goto nontoplevel_begin;
4241 }
4242 case scm_tcs_struct:
4243 if (SCM_OBJ_CLASS_FLAGS (proc) & SCM_CLASSF_PURE_GENERIC)
4244 {
4245 x = SCM_ENTITY_PROCEDURE (proc);
4246 #ifdef DEVAL
4247 arg1 = debug.info->a.args;
4248 #else
4249 arg1 = scm_list_1 (arg1);
4250 #endif
4251 goto type_dispatch;
4252 }
4253 else if (SCM_I_OPERATORP (proc))
4254 {
4255 arg2 = arg1;
4256 arg1 = proc;
4257 proc = (SCM_I_ENTITYP (proc)
4258 ? SCM_ENTITY_PROCEDURE (proc)
4259 : SCM_OPERATOR_PROCEDURE (proc));
4260 #ifdef DEVAL
4261 debug.info->a.args = scm_cons (arg1, debug.info->a.args);
4262 debug.info->a.proc = proc;
4263 #endif
4264 goto evap2;
4265 }
4266 else
4267 goto badfun;
4268 case scm_tc7_subr_2:
4269 case scm_tc7_subr_0:
4270 case scm_tc7_subr_3:
4271 case scm_tc7_lsubr_2:
4272 scm_wrong_num_args (proc);
4273 default:
4274 goto badfun;
4275 }
4276 }
4277 if (SCM_CONSP (x))
4278 arg2 = EVALCAR (x, env);
4279 else
4280 scm_wrong_num_args (proc);
4281
4282 { /* have two or more arguments */
4283 #ifdef DEVAL
4284 debug.info->a.args = scm_list_2 (arg1, arg2);
4285 #endif
4286 x = SCM_CDR (x);
4287 if (SCM_NULLP (x)) {
4288 ENTER_APPLY;
4289 evap2:
4290 SCM_ASRTGO (!SCM_IMP (proc), badfun);
4291 switch (SCM_TYP7 (proc))
4292 { /* have two arguments */
4293 case scm_tc7_subr_2:
4294 case scm_tc7_subr_2o:
4295 RETURN (SCM_SUBRF (proc) (arg1, arg2));
4296 case scm_tc7_lsubr:
4297 #ifdef DEVAL
4298 RETURN (SCM_SUBRF (proc) (debug.info->a.args));
4299 #else
4300 RETURN (SCM_SUBRF (proc) (scm_list_2 (arg1, arg2)));
4301 #endif
4302 case scm_tc7_lsubr_2:
4303 RETURN (SCM_SUBRF (proc) (arg1, arg2, SCM_EOL));
4304 case scm_tc7_rpsubr:
4305 case scm_tc7_asubr:
4306 RETURN (SCM_SUBRF (proc) (arg1, arg2));
4307 case scm_tc7_smob:
4308 if (!SCM_SMOB_APPLICABLE_P (proc))
4309 goto badfun;
4310 RETURN (SCM_SMOB_APPLY_2 (proc, arg1, arg2));
4311 cclon:
4312 case scm_tc7_cclo:
4313 #ifdef DEVAL
4314 RETURN (SCM_APPLY (SCM_CCLO_SUBR (proc),
4315 scm_cons (proc, debug.info->a.args),
4316 SCM_EOL));
4317 #else
4318 RETURN (SCM_APPLY (SCM_CCLO_SUBR (proc),
4319 scm_cons2 (proc, arg1,
4320 scm_cons (arg2,
4321 scm_eval_args (x,
4322 env,
4323 proc))),
4324 SCM_EOL));
4325 #endif
4326 case scm_tcs_struct:
4327 if (SCM_OBJ_CLASS_FLAGS (proc) & SCM_CLASSF_PURE_GENERIC)
4328 {
4329 x = SCM_ENTITY_PROCEDURE (proc);
4330 #ifdef DEVAL
4331 arg1 = debug.info->a.args;
4332 #else
4333 arg1 = scm_list_2 (arg1, arg2);
4334 #endif
4335 goto type_dispatch;
4336 }
4337 else if (SCM_I_OPERATORP (proc))
4338 {
4339 operatorn:
4340 #ifdef DEVAL
4341 RETURN (SCM_APPLY (SCM_I_ENTITYP (proc)
4342 ? SCM_ENTITY_PROCEDURE (proc)
4343 : SCM_OPERATOR_PROCEDURE (proc),
4344 scm_cons (proc, debug.info->a.args),
4345 SCM_EOL));
4346 #else
4347 RETURN (SCM_APPLY (SCM_I_ENTITYP (proc)
4348 ? SCM_ENTITY_PROCEDURE (proc)
4349 : SCM_OPERATOR_PROCEDURE (proc),
4350 scm_cons2 (proc, arg1,
4351 scm_cons (arg2,
4352 scm_eval_args (x,
4353 env,
4354 proc))),
4355 SCM_EOL));
4356 #endif
4357 }
4358 else
4359 goto badfun;
4360 case scm_tc7_subr_0:
4361 case scm_tc7_dsubr:
4362 case scm_tc7_cxr:
4363 case scm_tc7_subr_1o:
4364 case scm_tc7_subr_1:
4365 case scm_tc7_subr_3:
4366 scm_wrong_num_args (proc);
4367 default:
4368 goto badfun;
4369 case scm_tc7_pws:
4370 proc = SCM_PROCEDURE (proc);
4371 #ifdef DEVAL
4372 debug.info->a.proc = proc;
4373 #endif
4374 if (!SCM_CLOSUREP (proc))
4375 goto evap2;
4376 /* fallthrough */
4377 case scm_tcs_closures:
4378 {
4379 /* clos2: */
4380 const SCM formals = SCM_CLOSURE_FORMALS (proc);
4381 if (SCM_NULLP (formals)
4382 || (SCM_CONSP (formals)
4383 && (SCM_NULLP (SCM_CDR (formals))
4384 || (SCM_CONSP (SCM_CDR (formals))
4385 && SCM_CONSP (SCM_CDDR (formals))))))
4386 goto wrongnumargs;
4387 #ifdef DEVAL
4388 env = SCM_EXTEND_ENV (formals,
4389 debug.info->a.args,
4390 SCM_ENV (proc));
4391 #else
4392 env = SCM_EXTEND_ENV (formals,
4393 scm_list_2 (arg1, arg2),
4394 SCM_ENV (proc));
4395 #endif
4396 x = SCM_CLOSURE_BODY (proc);
4397 goto nontoplevel_begin;
4398 }
4399 }
4400 }
4401 if (!SCM_CONSP (x))
4402 scm_wrong_num_args (proc);
4403 #ifdef DEVAL
4404 debug.info->a.args = scm_cons2 (arg1, arg2,
4405 deval_args (x, env, proc,
4406 SCM_CDRLOC (SCM_CDR (debug.info->a.args))));
4407 #endif
4408 ENTER_APPLY;
4409 evap3:
4410 SCM_ASRTGO (!SCM_IMP (proc), badfun);
4411 switch (SCM_TYP7 (proc))
4412 { /* have 3 or more arguments */
4413 #ifdef DEVAL
4414 case scm_tc7_subr_3:
4415 if (!SCM_NULLP (SCM_CDR (x)))
4416 scm_wrong_num_args (proc);
4417 else
4418 RETURN (SCM_SUBRF (proc) (arg1, arg2,
4419 SCM_CADDR (debug.info->a.args)));
4420 case scm_tc7_asubr:
4421 arg1 = SCM_SUBRF(proc)(arg1, arg2);
4422 arg2 = SCM_CDDR (debug.info->a.args);
4423 do
4424 {
4425 arg1 = SCM_SUBRF(proc)(arg1, SCM_CAR (arg2));
4426 arg2 = SCM_CDR (arg2);
4427 }
4428 while (SCM_NIMP (arg2));
4429 RETURN (arg1);
4430 case scm_tc7_rpsubr:
4431 if (scm_is_false (SCM_SUBRF (proc) (arg1, arg2)))
4432 RETURN (SCM_BOOL_F);
4433 arg1 = SCM_CDDR (debug.info->a.args);
4434 do
4435 {
4436 if (scm_is_false (SCM_SUBRF (proc) (arg2, SCM_CAR (arg1))))
4437 RETURN (SCM_BOOL_F);
4438 arg2 = SCM_CAR (arg1);
4439 arg1 = SCM_CDR (arg1);
4440 }
4441 while (SCM_NIMP (arg1));
4442 RETURN (SCM_BOOL_T);
4443 case scm_tc7_lsubr_2:
4444 RETURN (SCM_SUBRF (proc) (arg1, arg2,
4445 SCM_CDDR (debug.info->a.args)));
4446 case scm_tc7_lsubr:
4447 RETURN (SCM_SUBRF (proc) (debug.info->a.args));
4448 case scm_tc7_smob:
4449 if (!SCM_SMOB_APPLICABLE_P (proc))
4450 goto badfun;
4451 RETURN (SCM_SMOB_APPLY_3 (proc, arg1, arg2,
4452 SCM_CDDR (debug.info->a.args)));
4453 case scm_tc7_cclo:
4454 goto cclon;
4455 case scm_tc7_pws:
4456 proc = SCM_PROCEDURE (proc);
4457 debug.info->a.proc = proc;
4458 if (!SCM_CLOSUREP (proc))
4459 goto evap3;
4460 /* fallthrough */
4461 case scm_tcs_closures:
4462 {
4463 const SCM formals = SCM_CLOSURE_FORMALS (proc);
4464 if (SCM_NULLP (formals)
4465 || (SCM_CONSP (formals)
4466 && (SCM_NULLP (SCM_CDR (formals))
4467 || (SCM_CONSP (SCM_CDR (formals))
4468 && scm_badargsp (SCM_CDDR (formals), x)))))
4469 goto wrongnumargs;
4470 SCM_SET_ARGSREADY (debug);
4471 env = SCM_EXTEND_ENV (formals,
4472 debug.info->a.args,
4473 SCM_ENV (proc));
4474 x = SCM_CLOSURE_BODY (proc);
4475 goto nontoplevel_begin;
4476 }
4477 #else /* DEVAL */
4478 case scm_tc7_subr_3:
4479 if (!SCM_NULLP (SCM_CDR (x)))
4480 scm_wrong_num_args (proc);
4481 else
4482 RETURN (SCM_SUBRF (proc) (arg1, arg2, EVALCAR (x, env)));
4483 case scm_tc7_asubr:
4484 arg1 = SCM_SUBRF (proc) (arg1, arg2);
4485 do
4486 {
4487 arg1 = SCM_SUBRF(proc)(arg1, EVALCAR(x, env));
4488 x = SCM_CDR(x);
4489 }
4490 while (!SCM_NULLP (x));
4491 RETURN (arg1);
4492 case scm_tc7_rpsubr:
4493 if (scm_is_false (SCM_SUBRF (proc) (arg1, arg2)))
4494 RETURN (SCM_BOOL_F);
4495 do
4496 {
4497 arg1 = EVALCAR (x, env);
4498 if (scm_is_false (SCM_SUBRF (proc) (arg2, arg1)))
4499 RETURN (SCM_BOOL_F);
4500 arg2 = arg1;
4501 x = SCM_CDR (x);
4502 }
4503 while (!SCM_NULLP (x));
4504 RETURN (SCM_BOOL_T);
4505 case scm_tc7_lsubr_2:
4506 RETURN (SCM_SUBRF (proc) (arg1, arg2, scm_eval_args (x, env, proc)));
4507 case scm_tc7_lsubr:
4508 RETURN (SCM_SUBRF (proc) (scm_cons2 (arg1,
4509 arg2,
4510 scm_eval_args (x, env, proc))));
4511 case scm_tc7_smob:
4512 if (!SCM_SMOB_APPLICABLE_P (proc))
4513 goto badfun;
4514 RETURN (SCM_SMOB_APPLY_3 (proc, arg1, arg2,
4515 scm_eval_args (x, env, proc)));
4516 case scm_tc7_cclo:
4517 goto cclon;
4518 case scm_tc7_pws:
4519 proc = SCM_PROCEDURE (proc);
4520 if (!SCM_CLOSUREP (proc))
4521 goto evap3;
4522 /* fallthrough */
4523 case scm_tcs_closures:
4524 {
4525 const SCM formals = SCM_CLOSURE_FORMALS (proc);
4526 if (SCM_NULLP (formals)
4527 || (SCM_CONSP (formals)
4528 && (SCM_NULLP (SCM_CDR (formals))
4529 || (SCM_CONSP (SCM_CDR (formals))
4530 && scm_badargsp (SCM_CDDR (formals), x)))))
4531 goto wrongnumargs;
4532 env = SCM_EXTEND_ENV (formals,
4533 scm_cons2 (arg1,
4534 arg2,
4535 scm_eval_args (x, env, proc)),
4536 SCM_ENV (proc));
4537 x = SCM_CLOSURE_BODY (proc);
4538 goto nontoplevel_begin;
4539 }
4540 #endif /* DEVAL */
4541 case scm_tcs_struct:
4542 if (SCM_OBJ_CLASS_FLAGS (proc) & SCM_CLASSF_PURE_GENERIC)
4543 {
4544 #ifdef DEVAL
4545 arg1 = debug.info->a.args;
4546 #else
4547 arg1 = scm_cons2 (arg1, arg2, scm_eval_args (x, env, proc));
4548 #endif
4549 x = SCM_ENTITY_PROCEDURE (proc);
4550 goto type_dispatch;
4551 }
4552 else if (SCM_I_OPERATORP (proc))
4553 goto operatorn;
4554 else
4555 goto badfun;
4556 case scm_tc7_subr_2:
4557 case scm_tc7_subr_1o:
4558 case scm_tc7_subr_2o:
4559 case scm_tc7_subr_0:
4560 case scm_tc7_dsubr:
4561 case scm_tc7_cxr:
4562 case scm_tc7_subr_1:
4563 scm_wrong_num_args (proc);
4564 default:
4565 goto badfun;
4566 }
4567 }
4568 }
4569 #ifdef DEVAL
4570 exit:
4571 if (scm_check_exit_p && SCM_TRAPS_P)
4572 if (SCM_EXIT_FRAME_P || (SCM_TRACE_P && SCM_TRACED_FRAME_P (debug)))
4573 {
4574 SCM_CLEAR_TRACED_FRAME (debug);
4575 if (SCM_CHEAPTRAPS_P)
4576 arg1 = scm_make_debugobj (&debug);
4577 else
4578 {
4579 int first;
4580 SCM val = scm_make_continuation (&first);
4581
4582 if (first)
4583 arg1 = val;
4584 else
4585 {
4586 proc = val;
4587 goto ret;
4588 }
4589 }
4590 SCM_TRAPS_P = 0;
4591 scm_call_3 (SCM_EXIT_FRAME_HDLR, scm_sym_exit_frame, arg1, proc);
4592 SCM_TRAPS_P = 1;
4593 }
4594 ret:
4595 scm_last_debug_frame = debug.prev;
4596 return proc;
4597 #endif
4598 }
4599
4600
4601 /* SECTION: This code is compiled once.
4602 */
4603
4604 #ifndef DEVAL
4605
4606 \f
4607
4608 /* Simple procedure calls
4609 */
4610
4611 SCM
4612 scm_call_0 (SCM proc)
4613 {
4614 return scm_apply (proc, SCM_EOL, SCM_EOL);
4615 }
4616
4617 SCM
4618 scm_call_1 (SCM proc, SCM arg1)
4619 {
4620 return scm_apply (proc, arg1, scm_listofnull);
4621 }
4622
4623 SCM
4624 scm_call_2 (SCM proc, SCM arg1, SCM arg2)
4625 {
4626 return scm_apply (proc, arg1, scm_cons (arg2, scm_listofnull));
4627 }
4628
4629 SCM
4630 scm_call_3 (SCM proc, SCM arg1, SCM arg2, SCM arg3)
4631 {
4632 return scm_apply (proc, arg1, scm_cons2 (arg2, arg3, scm_listofnull));
4633 }
4634
4635 SCM
4636 scm_call_4 (SCM proc, SCM arg1, SCM arg2, SCM arg3, SCM arg4)
4637 {
4638 return scm_apply (proc, arg1, scm_cons2 (arg2, arg3,
4639 scm_cons (arg4, scm_listofnull)));
4640 }
4641
4642 /* Simple procedure applies
4643 */
4644
4645 SCM
4646 scm_apply_0 (SCM proc, SCM args)
4647 {
4648 return scm_apply (proc, args, SCM_EOL);
4649 }
4650
4651 SCM
4652 scm_apply_1 (SCM proc, SCM arg1, SCM args)
4653 {
4654 return scm_apply (proc, scm_cons (arg1, args), SCM_EOL);
4655 }
4656
4657 SCM
4658 scm_apply_2 (SCM proc, SCM arg1, SCM arg2, SCM args)
4659 {
4660 return scm_apply (proc, scm_cons2 (arg1, arg2, args), SCM_EOL);
4661 }
4662
4663 SCM
4664 scm_apply_3 (SCM proc, SCM arg1, SCM arg2, SCM arg3, SCM args)
4665 {
4666 return scm_apply (proc, scm_cons (arg1, scm_cons2 (arg2, arg3, args)),
4667 SCM_EOL);
4668 }
4669
4670 /* This code processes the arguments to apply:
4671
4672 (apply PROC ARG1 ... ARGS)
4673
4674 Given a list (ARG1 ... ARGS), this function conses the ARG1
4675 ... arguments onto the front of ARGS, and returns the resulting
4676 list. Note that ARGS is a list; thus, the argument to this
4677 function is a list whose last element is a list.
4678
4679 Apply calls this function, and applies PROC to the elements of the
4680 result. apply:nconc2last takes care of building the list of
4681 arguments, given (ARG1 ... ARGS).
4682
4683 Rather than do new consing, apply:nconc2last destroys its argument.
4684 On that topic, this code came into my care with the following
4685 beautifully cryptic comment on that topic: "This will only screw
4686 you if you do (scm_apply scm_apply '( ... ))" If you know what
4687 they're referring to, send me a patch to this comment. */
4688
4689 SCM_DEFINE (scm_nconc2last, "apply:nconc2last", 1, 0, 0,
4690 (SCM lst),
4691 "Given a list (@var{arg1} @dots{} @var{args}), this function\n"
4692 "conses the @var{arg1} @dots{} arguments onto the front of\n"
4693 "@var{args}, and returns the resulting list. Note that\n"
4694 "@var{args} is a list; thus, the argument to this function is\n"
4695 "a list whose last element is a list.\n"
4696 "Note: Rather than do new consing, @code{apply:nconc2last}\n"
4697 "destroys its argument, so use with care.")
4698 #define FUNC_NAME s_scm_nconc2last
4699 {
4700 SCM *lloc;
4701 SCM_VALIDATE_NONEMPTYLIST (1, lst);
4702 lloc = &lst;
4703 while (!SCM_NULLP (SCM_CDR (*lloc))) /* Perhaps should be
4704 SCM_NULL_OR_NIL_P, but not
4705 needed in 99.99% of cases,
4706 and it could seriously hurt
4707 performance. - Neil */
4708 lloc = SCM_CDRLOC (*lloc);
4709 SCM_ASSERT (scm_ilength (SCM_CAR (*lloc)) >= 0, lst, SCM_ARG1, FUNC_NAME);
4710 *lloc = SCM_CAR (*lloc);
4711 return lst;
4712 }
4713 #undef FUNC_NAME
4714
4715 #endif /* !DEVAL */
4716
4717
4718 /* SECTION: When DEVAL is defined this code yields scm_dapply.
4719 * It is compiled twice.
4720 */
4721
4722 #if 0
4723 SCM
4724 scm_apply (SCM proc, SCM arg1, SCM args)
4725 {}
4726 #endif
4727
4728 #if 0
4729 SCM
4730 scm_dapply (SCM proc, SCM arg1, SCM args)
4731 {}
4732 #endif
4733
4734
4735 /* Apply a function to a list of arguments.
4736
4737 This function is exported to the Scheme level as taking two
4738 required arguments and a tail argument, as if it were:
4739 (lambda (proc arg1 . args) ...)
4740 Thus, if you just have a list of arguments to pass to a procedure,
4741 pass the list as ARG1, and '() for ARGS. If you have some fixed
4742 args, pass the first as ARG1, then cons any remaining fixed args
4743 onto the front of your argument list, and pass that as ARGS. */
4744
4745 SCM
4746 SCM_APPLY (SCM proc, SCM arg1, SCM args)
4747 {
4748 #ifdef DEVAL
4749 scm_t_debug_frame debug;
4750 scm_t_debug_info debug_vect_body;
4751 debug.prev = scm_last_debug_frame;
4752 debug.status = SCM_APPLYFRAME;
4753 debug.vect = &debug_vect_body;
4754 debug.vect[0].a.proc = proc;
4755 debug.vect[0].a.args = SCM_EOL;
4756 scm_last_debug_frame = &debug;
4757 #else
4758 if (scm_debug_mode_p)
4759 return scm_dapply (proc, arg1, args);
4760 #endif
4761
4762 SCM_ASRTGO (SCM_NIMP (proc), badproc);
4763
4764 /* If ARGS is the empty list, then we're calling apply with only two
4765 arguments --- ARG1 is the list of arguments for PROC. Whatever
4766 the case, futz with things so that ARG1 is the first argument to
4767 give to PROC (or SCM_UNDEFINED if no args), and ARGS contains the
4768 rest.
4769
4770 Setting the debug apply frame args this way is pretty messy.
4771 Perhaps we should store arg1 and args directly in the frame as
4772 received, and let scm_frame_arguments unpack them, because that's
4773 a relatively rare operation. This works for now; if the Guile
4774 developer archives are still around, see Mikael's post of
4775 11-Apr-97. */
4776 if (SCM_NULLP (args))
4777 {
4778 if (SCM_NULLP (arg1))
4779 {
4780 arg1 = SCM_UNDEFINED;
4781 #ifdef DEVAL
4782 debug.vect[0].a.args = SCM_EOL;
4783 #endif
4784 }
4785 else
4786 {
4787 #ifdef DEVAL
4788 debug.vect[0].a.args = arg1;
4789 #endif
4790 args = SCM_CDR (arg1);
4791 arg1 = SCM_CAR (arg1);
4792 }
4793 }
4794 else
4795 {
4796 args = scm_nconc2last (args);
4797 #ifdef DEVAL
4798 debug.vect[0].a.args = scm_cons (arg1, args);
4799 #endif
4800 }
4801 #ifdef DEVAL
4802 if (SCM_ENTER_FRAME_P && SCM_TRAPS_P)
4803 {
4804 SCM tmp;
4805 if (SCM_CHEAPTRAPS_P)
4806 tmp = scm_make_debugobj (&debug);
4807 else
4808 {
4809 int first;
4810
4811 tmp = scm_make_continuation (&first);
4812 if (!first)
4813 goto entap;
4814 }
4815 SCM_TRAPS_P = 0;
4816 scm_call_2 (SCM_ENTER_FRAME_HDLR, scm_sym_enter_frame, tmp);
4817 SCM_TRAPS_P = 1;
4818 }
4819 entap:
4820 ENTER_APPLY;
4821 #endif
4822 tail:
4823 switch (SCM_TYP7 (proc))
4824 {
4825 case scm_tc7_subr_2o:
4826 args = SCM_NULLP (args) ? SCM_UNDEFINED : SCM_CAR (args);
4827 RETURN (SCM_SUBRF (proc) (arg1, args));
4828 case scm_tc7_subr_2:
4829 if (SCM_NULLP (args) || !SCM_NULLP (SCM_CDR (args)))
4830 scm_wrong_num_args (proc);
4831 args = SCM_CAR (args);
4832 RETURN (SCM_SUBRF (proc) (arg1, args));
4833 case scm_tc7_subr_0:
4834 if (!SCM_UNBNDP (arg1))
4835 scm_wrong_num_args (proc);
4836 else
4837 RETURN (SCM_SUBRF (proc) ());
4838 case scm_tc7_subr_1:
4839 if (SCM_UNBNDP (arg1))
4840 scm_wrong_num_args (proc);
4841 case scm_tc7_subr_1o:
4842 if (!SCM_NULLP (args))
4843 scm_wrong_num_args (proc);
4844 else
4845 RETURN (SCM_SUBRF (proc) (arg1));
4846 case scm_tc7_dsubr:
4847 if (SCM_UNBNDP (arg1) || !SCM_NULLP (args))
4848 scm_wrong_num_args (proc);
4849 if (SCM_I_INUMP (arg1))
4850 {
4851 RETURN (scm_from_double (SCM_DSUBRF (proc) ((double) SCM_I_INUM (arg1))));
4852 }
4853 else if (SCM_REALP (arg1))
4854 {
4855 RETURN (scm_from_double (SCM_DSUBRF (proc) (SCM_REAL_VALUE (arg1))));
4856 }
4857 else if (SCM_BIGP (arg1))
4858 {
4859 RETURN (scm_from_double (SCM_DSUBRF (proc) (scm_i_big2dbl (arg1))));
4860 }
4861 else if (SCM_FRACTIONP (arg1))
4862 {
4863 RETURN (scm_from_double (SCM_DSUBRF (proc) (scm_i_fraction2double (arg1))));
4864 }
4865 SCM_WTA_DISPATCH_1 (*SCM_SUBR_GENERIC (proc), arg1,
4866 SCM_ARG1, scm_i_symbol_chars (SCM_SNAME (proc)));
4867 case scm_tc7_cxr:
4868 if (SCM_UNBNDP (arg1) || !SCM_NULLP (args))
4869 scm_wrong_num_args (proc);
4870 {
4871 unsigned char pattern = (scm_t_bits) SCM_SUBRF (proc);
4872 do
4873 {
4874 SCM_ASSERT (SCM_CONSP (arg1), arg1, SCM_ARG1,
4875 scm_i_symbol_chars (SCM_SNAME (proc)));
4876 arg1 = (pattern & 1) ? SCM_CAR (arg1) : SCM_CDR (arg1);
4877 pattern >>= 2;
4878 } while (pattern);
4879 RETURN (arg1);
4880 }
4881 case scm_tc7_subr_3:
4882 if (SCM_NULLP (args)
4883 || SCM_NULLP (SCM_CDR (args))
4884 || !SCM_NULLP (SCM_CDDR (args)))
4885 scm_wrong_num_args (proc);
4886 else
4887 RETURN (SCM_SUBRF (proc) (arg1, SCM_CAR (args), SCM_CADR (args)));
4888 case scm_tc7_lsubr:
4889 #ifdef DEVAL
4890 RETURN (SCM_SUBRF (proc) (SCM_UNBNDP (arg1) ? SCM_EOL : debug.vect[0].a.args));
4891 #else
4892 RETURN (SCM_SUBRF (proc) (SCM_UNBNDP (arg1) ? SCM_EOL : scm_cons (arg1, args)));
4893 #endif
4894 case scm_tc7_lsubr_2:
4895 if (!SCM_CONSP (args))
4896 scm_wrong_num_args (proc);
4897 else
4898 RETURN (SCM_SUBRF (proc) (arg1, SCM_CAR (args), SCM_CDR (args)));
4899 case scm_tc7_asubr:
4900 if (SCM_NULLP (args))
4901 RETURN (SCM_SUBRF (proc) (arg1, SCM_UNDEFINED));
4902 while (SCM_NIMP (args))
4903 {
4904 SCM_ASSERT (SCM_CONSP (args), args, SCM_ARG2, "apply");
4905 arg1 = SCM_SUBRF (proc) (arg1, SCM_CAR (args));
4906 args = SCM_CDR (args);
4907 }
4908 RETURN (arg1);
4909 case scm_tc7_rpsubr:
4910 if (SCM_NULLP (args))
4911 RETURN (SCM_BOOL_T);
4912 while (SCM_NIMP (args))
4913 {
4914 SCM_ASSERT (SCM_CONSP (args), args, SCM_ARG2, "apply");
4915 if (scm_is_false (SCM_SUBRF (proc) (arg1, SCM_CAR (args))))
4916 RETURN (SCM_BOOL_F);
4917 arg1 = SCM_CAR (args);
4918 args = SCM_CDR (args);
4919 }
4920 RETURN (SCM_BOOL_T);
4921 case scm_tcs_closures:
4922 #ifdef DEVAL
4923 arg1 = (SCM_UNBNDP (arg1) ? SCM_EOL : debug.vect[0].a.args);
4924 #else
4925 arg1 = (SCM_UNBNDP (arg1) ? SCM_EOL : scm_cons (arg1, args));
4926 #endif
4927 if (scm_badargsp (SCM_CLOSURE_FORMALS (proc), arg1))
4928 scm_wrong_num_args (proc);
4929
4930 /* Copy argument list */
4931 if (SCM_IMP (arg1))
4932 args = arg1;
4933 else
4934 {
4935 SCM tl = args = scm_cons (SCM_CAR (arg1), SCM_UNSPECIFIED);
4936 for (arg1 = SCM_CDR (arg1); SCM_CONSP (arg1); arg1 = SCM_CDR (arg1))
4937 {
4938 SCM_SETCDR (tl, scm_cons (SCM_CAR (arg1), SCM_UNSPECIFIED));
4939 tl = SCM_CDR (tl);
4940 }
4941 SCM_SETCDR (tl, arg1);
4942 }
4943
4944 args = SCM_EXTEND_ENV (SCM_CLOSURE_FORMALS (proc),
4945 args,
4946 SCM_ENV (proc));
4947 proc = SCM_CLOSURE_BODY (proc);
4948 again:
4949 arg1 = SCM_CDR (proc);
4950 while (!SCM_NULLP (arg1))
4951 {
4952 if (SCM_IMP (SCM_CAR (proc)))
4953 {
4954 if (SCM_ISYMP (SCM_CAR (proc)))
4955 {
4956 scm_rec_mutex_lock (&source_mutex);
4957 /* check for race condition */
4958 if (SCM_ISYMP (SCM_CAR (proc)))
4959 m_expand_body (proc, args);
4960 scm_rec_mutex_unlock (&source_mutex);
4961 goto again;
4962 }
4963 else
4964 SCM_VALIDATE_NON_EMPTY_COMBINATION (SCM_CAR (proc));
4965 }
4966 else
4967 (void) EVAL (SCM_CAR (proc), args);
4968 proc = arg1;
4969 arg1 = SCM_CDR (proc);
4970 }
4971 RETURN (EVALCAR (proc, args));
4972 case scm_tc7_smob:
4973 if (!SCM_SMOB_APPLICABLE_P (proc))
4974 goto badproc;
4975 if (SCM_UNBNDP (arg1))
4976 RETURN (SCM_SMOB_APPLY_0 (proc));
4977 else if (SCM_NULLP (args))
4978 RETURN (SCM_SMOB_APPLY_1 (proc, arg1));
4979 else if (SCM_NULLP (SCM_CDR (args)))
4980 RETURN (SCM_SMOB_APPLY_2 (proc, arg1, SCM_CAR (args)));
4981 else
4982 RETURN (SCM_SMOB_APPLY_3 (proc, arg1, SCM_CAR (args), SCM_CDR (args)));
4983 case scm_tc7_cclo:
4984 #ifdef DEVAL
4985 args = (SCM_UNBNDP(arg1) ? SCM_EOL : debug.vect[0].a.args);
4986 arg1 = proc;
4987 proc = SCM_CCLO_SUBR (proc);
4988 debug.vect[0].a.proc = proc;
4989 debug.vect[0].a.args = scm_cons (arg1, args);
4990 #else
4991 args = (SCM_UNBNDP(arg1) ? SCM_EOL : scm_cons (arg1, args));
4992 arg1 = proc;
4993 proc = SCM_CCLO_SUBR (proc);
4994 #endif
4995 goto tail;
4996 case scm_tc7_pws:
4997 proc = SCM_PROCEDURE (proc);
4998 #ifdef DEVAL
4999 debug.vect[0].a.proc = proc;
5000 #endif
5001 goto tail;
5002 case scm_tcs_struct:
5003 if (SCM_OBJ_CLASS_FLAGS (proc) & SCM_CLASSF_PURE_GENERIC)
5004 {
5005 #ifdef DEVAL
5006 args = (SCM_UNBNDP(arg1) ? SCM_EOL : debug.vect[0].a.args);
5007 #else
5008 args = (SCM_UNBNDP(arg1) ? SCM_EOL : scm_cons (arg1, args));
5009 #endif
5010 RETURN (scm_apply_generic (proc, args));
5011 }
5012 else if (SCM_I_OPERATORP (proc))
5013 {
5014 /* operator */
5015 #ifdef DEVAL
5016 args = (SCM_UNBNDP(arg1) ? SCM_EOL : debug.vect[0].a.args);
5017 #else
5018 args = (SCM_UNBNDP(arg1) ? SCM_EOL : scm_cons (arg1, args));
5019 #endif
5020 arg1 = proc;
5021 proc = (SCM_I_ENTITYP (proc)
5022 ? SCM_ENTITY_PROCEDURE (proc)
5023 : SCM_OPERATOR_PROCEDURE (proc));
5024 #ifdef DEVAL
5025 debug.vect[0].a.proc = proc;
5026 debug.vect[0].a.args = scm_cons (arg1, args);
5027 #endif
5028 if (SCM_NIMP (proc))
5029 goto tail;
5030 else
5031 goto badproc;
5032 }
5033 else
5034 goto badproc;
5035 default:
5036 badproc:
5037 scm_wrong_type_arg ("apply", SCM_ARG1, proc);
5038 }
5039 #ifdef DEVAL
5040 exit:
5041 if (scm_check_exit_p && SCM_TRAPS_P)
5042 if (SCM_EXIT_FRAME_P || (SCM_TRACE_P && SCM_TRACED_FRAME_P (debug)))
5043 {
5044 SCM_CLEAR_TRACED_FRAME (debug);
5045 if (SCM_CHEAPTRAPS_P)
5046 arg1 = scm_make_debugobj (&debug);
5047 else
5048 {
5049 int first;
5050 SCM val = scm_make_continuation (&first);
5051
5052 if (first)
5053 arg1 = val;
5054 else
5055 {
5056 proc = val;
5057 goto ret;
5058 }
5059 }
5060 SCM_TRAPS_P = 0;
5061 scm_call_3 (SCM_EXIT_FRAME_HDLR, scm_sym_exit_frame, arg1, proc);
5062 SCM_TRAPS_P = 1;
5063 }
5064 ret:
5065 scm_last_debug_frame = debug.prev;
5066 return proc;
5067 #endif
5068 }
5069
5070
5071 /* SECTION: The rest of this file is only read once.
5072 */
5073
5074 #ifndef DEVAL
5075
5076 /* Trampolines
5077 *
5078 * Trampolines make it possible to move procedure application dispatch
5079 * outside inner loops. The motivation was clean implementation of
5080 * efficient replacements of R5RS primitives in SRFI-1.
5081 *
5082 * The semantics is clear: scm_trampoline_N returns an optimized
5083 * version of scm_call_N (or NULL if the procedure isn't applicable
5084 * on N args).
5085 *
5086 * Applying the optimization to map and for-each increased efficiency
5087 * noticeably. For example, (map abs ls) is now 8 times faster than
5088 * before.
5089 */
5090
5091 static SCM
5092 call_subr0_0 (SCM proc)
5093 {
5094 return SCM_SUBRF (proc) ();
5095 }
5096
5097 static SCM
5098 call_subr1o_0 (SCM proc)
5099 {
5100 return SCM_SUBRF (proc) (SCM_UNDEFINED);
5101 }
5102
5103 static SCM
5104 call_lsubr_0 (SCM proc)
5105 {
5106 return SCM_SUBRF (proc) (SCM_EOL);
5107 }
5108
5109 SCM
5110 scm_i_call_closure_0 (SCM proc)
5111 {
5112 const SCM env = SCM_EXTEND_ENV (SCM_CLOSURE_FORMALS (proc),
5113 SCM_EOL,
5114 SCM_ENV (proc));
5115 const SCM result = scm_eval_body (SCM_CLOSURE_BODY (proc), env);
5116 return result;
5117 }
5118
5119 scm_t_trampoline_0
5120 scm_trampoline_0 (SCM proc)
5121 {
5122 scm_t_trampoline_0 trampoline;
5123
5124 if (SCM_IMP (proc))
5125 return NULL;
5126
5127 switch (SCM_TYP7 (proc))
5128 {
5129 case scm_tc7_subr_0:
5130 trampoline = call_subr0_0;
5131 break;
5132 case scm_tc7_subr_1o:
5133 trampoline = call_subr1o_0;
5134 break;
5135 case scm_tc7_lsubr:
5136 trampoline = call_lsubr_0;
5137 break;
5138 case scm_tcs_closures:
5139 {
5140 SCM formals = SCM_CLOSURE_FORMALS (proc);
5141 if (SCM_NULLP (formals) || !SCM_CONSP (formals))
5142 trampoline = scm_i_call_closure_0;
5143 else
5144 return NULL;
5145 break;
5146 }
5147 case scm_tcs_struct:
5148 if (SCM_OBJ_CLASS_FLAGS (proc) & SCM_CLASSF_PURE_GENERIC)
5149 trampoline = scm_call_generic_0;
5150 else if (SCM_I_OPERATORP (proc))
5151 trampoline = scm_call_0;
5152 else
5153 return NULL;
5154 break;
5155 case scm_tc7_smob:
5156 if (SCM_SMOB_APPLICABLE_P (proc))
5157 trampoline = SCM_SMOB_DESCRIPTOR (proc).apply_0;
5158 else
5159 return NULL;
5160 break;
5161 case scm_tc7_asubr:
5162 case scm_tc7_rpsubr:
5163 case scm_tc7_cclo:
5164 case scm_tc7_pws:
5165 trampoline = scm_call_0;
5166 break;
5167 default:
5168 return NULL; /* not applicable on zero arguments */
5169 }
5170 /* We only reach this point if a valid trampoline was determined. */
5171
5172 /* If debugging is enabled, we want to see all calls to proc on the stack.
5173 * Thus, we replace the trampoline shortcut with scm_call_0. */
5174 if (scm_debug_mode_p)
5175 return scm_call_0;
5176 else
5177 return trampoline;
5178 }
5179
5180 static SCM
5181 call_subr1_1 (SCM proc, SCM arg1)
5182 {
5183 return SCM_SUBRF (proc) (arg1);
5184 }
5185
5186 static SCM
5187 call_subr2o_1 (SCM proc, SCM arg1)
5188 {
5189 return SCM_SUBRF (proc) (arg1, SCM_UNDEFINED);
5190 }
5191
5192 static SCM
5193 call_lsubr_1 (SCM proc, SCM arg1)
5194 {
5195 return SCM_SUBRF (proc) (scm_list_1 (arg1));
5196 }
5197
5198 static SCM
5199 call_dsubr_1 (SCM proc, SCM arg1)
5200 {
5201 if (SCM_I_INUMP (arg1))
5202 {
5203 RETURN (scm_from_double (SCM_DSUBRF (proc) ((double) SCM_I_INUM (arg1))));
5204 }
5205 else if (SCM_REALP (arg1))
5206 {
5207 RETURN (scm_from_double (SCM_DSUBRF (proc) (SCM_REAL_VALUE (arg1))));
5208 }
5209 else if (SCM_BIGP (arg1))
5210 {
5211 RETURN (scm_from_double (SCM_DSUBRF (proc) (scm_i_big2dbl (arg1))));
5212 }
5213 else if (SCM_FRACTIONP (arg1))
5214 {
5215 RETURN (scm_from_double (SCM_DSUBRF (proc) (scm_i_fraction2double (arg1))));
5216 }
5217 SCM_WTA_DISPATCH_1 (*SCM_SUBR_GENERIC (proc), arg1,
5218 SCM_ARG1, scm_i_symbol_chars (SCM_SNAME (proc)));
5219 }
5220
5221 static SCM
5222 call_cxr_1 (SCM proc, SCM arg1)
5223 {
5224 unsigned char pattern = (scm_t_bits) SCM_SUBRF (proc);
5225 do
5226 {
5227 SCM_ASSERT (SCM_CONSP (arg1), arg1, SCM_ARG1,
5228 scm_i_symbol_chars (SCM_SNAME (proc)));
5229 arg1 = (pattern & 1) ? SCM_CAR (arg1) : SCM_CDR (arg1);
5230 pattern >>= 2;
5231 } while (pattern);
5232 return arg1;
5233 }
5234
5235 static SCM
5236 call_closure_1 (SCM proc, SCM arg1)
5237 {
5238 const SCM env = SCM_EXTEND_ENV (SCM_CLOSURE_FORMALS (proc),
5239 scm_list_1 (arg1),
5240 SCM_ENV (proc));
5241 const SCM result = scm_eval_body (SCM_CLOSURE_BODY (proc), env);
5242 return result;
5243 }
5244
5245 scm_t_trampoline_1
5246 scm_trampoline_1 (SCM proc)
5247 {
5248 scm_t_trampoline_1 trampoline;
5249
5250 if (SCM_IMP (proc))
5251 return NULL;
5252
5253 switch (SCM_TYP7 (proc))
5254 {
5255 case scm_tc7_subr_1:
5256 case scm_tc7_subr_1o:
5257 trampoline = call_subr1_1;
5258 break;
5259 case scm_tc7_subr_2o:
5260 trampoline = call_subr2o_1;
5261 break;
5262 case scm_tc7_lsubr:
5263 trampoline = call_lsubr_1;
5264 break;
5265 case scm_tc7_dsubr:
5266 trampoline = call_dsubr_1;
5267 break;
5268 case scm_tc7_cxr:
5269 trampoline = call_cxr_1;
5270 break;
5271 case scm_tcs_closures:
5272 {
5273 SCM formals = SCM_CLOSURE_FORMALS (proc);
5274 if (!SCM_NULLP (formals)
5275 && (!SCM_CONSP (formals) || !SCM_CONSP (SCM_CDR (formals))))
5276 trampoline = call_closure_1;
5277 else
5278 return NULL;
5279 break;
5280 }
5281 case scm_tcs_struct:
5282 if (SCM_OBJ_CLASS_FLAGS (proc) & SCM_CLASSF_PURE_GENERIC)
5283 trampoline = scm_call_generic_1;
5284 else if (SCM_I_OPERATORP (proc))
5285 trampoline = scm_call_1;
5286 else
5287 return NULL;
5288 break;
5289 case scm_tc7_smob:
5290 if (SCM_SMOB_APPLICABLE_P (proc))
5291 trampoline = SCM_SMOB_DESCRIPTOR (proc).apply_1;
5292 else
5293 return NULL;
5294 break;
5295 case scm_tc7_asubr:
5296 case scm_tc7_rpsubr:
5297 case scm_tc7_cclo:
5298 case scm_tc7_pws:
5299 trampoline = scm_call_1;
5300 break;
5301 default:
5302 return NULL; /* not applicable on one arg */
5303 }
5304 /* We only reach this point if a valid trampoline was determined. */
5305
5306 /* If debugging is enabled, we want to see all calls to proc on the stack.
5307 * Thus, we replace the trampoline shortcut with scm_call_1. */
5308 if (scm_debug_mode_p)
5309 return scm_call_1;
5310 else
5311 return trampoline;
5312 }
5313
5314 static SCM
5315 call_subr2_2 (SCM proc, SCM arg1, SCM arg2)
5316 {
5317 return SCM_SUBRF (proc) (arg1, arg2);
5318 }
5319
5320 static SCM
5321 call_lsubr2_2 (SCM proc, SCM arg1, SCM arg2)
5322 {
5323 return SCM_SUBRF (proc) (arg1, arg2, SCM_EOL);
5324 }
5325
5326 static SCM
5327 call_lsubr_2 (SCM proc, SCM arg1, SCM arg2)
5328 {
5329 return SCM_SUBRF (proc) (scm_list_2 (arg1, arg2));
5330 }
5331
5332 static SCM
5333 call_closure_2 (SCM proc, SCM arg1, SCM arg2)
5334 {
5335 const SCM env = SCM_EXTEND_ENV (SCM_CLOSURE_FORMALS (proc),
5336 scm_list_2 (arg1, arg2),
5337 SCM_ENV (proc));
5338 const SCM result = scm_eval_body (SCM_CLOSURE_BODY (proc), env);
5339 return result;
5340 }
5341
5342 scm_t_trampoline_2
5343 scm_trampoline_2 (SCM proc)
5344 {
5345 scm_t_trampoline_2 trampoline;
5346
5347 if (SCM_IMP (proc))
5348 return NULL;
5349
5350 switch (SCM_TYP7 (proc))
5351 {
5352 case scm_tc7_subr_2:
5353 case scm_tc7_subr_2o:
5354 case scm_tc7_rpsubr:
5355 case scm_tc7_asubr:
5356 trampoline = call_subr2_2;
5357 break;
5358 case scm_tc7_lsubr_2:
5359 trampoline = call_lsubr2_2;
5360 break;
5361 case scm_tc7_lsubr:
5362 trampoline = call_lsubr_2;
5363 break;
5364 case scm_tcs_closures:
5365 {
5366 SCM formals = SCM_CLOSURE_FORMALS (proc);
5367 if (!SCM_NULLP (formals)
5368 && (!SCM_CONSP (formals)
5369 || (!SCM_NULLP (SCM_CDR (formals))
5370 && (!SCM_CONSP (SCM_CDR (formals))
5371 || !SCM_CONSP (SCM_CDDR (formals))))))
5372 trampoline = call_closure_2;
5373 else
5374 return NULL;
5375 break;
5376 }
5377 case scm_tcs_struct:
5378 if (SCM_OBJ_CLASS_FLAGS (proc) & SCM_CLASSF_PURE_GENERIC)
5379 trampoline = scm_call_generic_2;
5380 else if (SCM_I_OPERATORP (proc))
5381 trampoline = scm_call_2;
5382 else
5383 return NULL;
5384 break;
5385 case scm_tc7_smob:
5386 if (SCM_SMOB_APPLICABLE_P (proc))
5387 trampoline = SCM_SMOB_DESCRIPTOR (proc).apply_2;
5388 else
5389 return NULL;
5390 break;
5391 case scm_tc7_cclo:
5392 case scm_tc7_pws:
5393 trampoline = scm_call_2;
5394 break;
5395 default:
5396 return NULL; /* not applicable on two args */
5397 }
5398 /* We only reach this point if a valid trampoline was determined. */
5399
5400 /* If debugging is enabled, we want to see all calls to proc on the stack.
5401 * Thus, we replace the trampoline shortcut with scm_call_2. */
5402 if (scm_debug_mode_p)
5403 return scm_call_2;
5404 else
5405 return trampoline;
5406 }
5407
5408 /* Typechecking for multi-argument MAP and FOR-EACH.
5409
5410 Verify that each element of the vector ARGV, except for the first,
5411 is a proper list whose length is LEN. Attribute errors to WHO,
5412 and claim that the i'th element of ARGV is WHO's i+2'th argument. */
5413 static inline void
5414 check_map_args (SCM argv,
5415 long len,
5416 SCM gf,
5417 SCM proc,
5418 SCM args,
5419 const char *who)
5420 {
5421 SCM const *ve = SCM_VELTS (argv);
5422 long i;
5423
5424 for (i = SCM_VECTOR_LENGTH (argv) - 1; i >= 1; i--)
5425 {
5426 long elt_len = scm_ilength (ve[i]);
5427
5428 if (elt_len < 0)
5429 {
5430 if (gf)
5431 scm_apply_generic (gf, scm_cons (proc, args));
5432 else
5433 scm_wrong_type_arg (who, i + 2, ve[i]);
5434 }
5435
5436 if (elt_len != len)
5437 scm_out_of_range_pos (who, ve[i], scm_from_long (i + 2));
5438 }
5439
5440 scm_remember_upto_here_1 (argv);
5441 }
5442
5443
5444 SCM_GPROC (s_map, "map", 2, 0, 1, scm_map, g_map);
5445
5446 /* Note: Currently, scm_map applies PROC to the argument list(s)
5447 sequentially, starting with the first element(s). This is used in
5448 evalext.c where the Scheme procedure `map-in-order', which guarantees
5449 sequential behaviour, is implemented using scm_map. If the
5450 behaviour changes, we need to update `map-in-order'.
5451 */
5452
5453 SCM
5454 scm_map (SCM proc, SCM arg1, SCM args)
5455 #define FUNC_NAME s_map
5456 {
5457 long i, len;
5458 SCM res = SCM_EOL;
5459 SCM *pres = &res;
5460 SCM const *ve = &args; /* Keep args from being optimized away. */
5461
5462 len = scm_ilength (arg1);
5463 SCM_GASSERTn (len >= 0,
5464 g_map, scm_cons2 (proc, arg1, args), SCM_ARG2, s_map);
5465 SCM_VALIDATE_REST_ARGUMENT (args);
5466 if (SCM_NULLP (args))
5467 {
5468 scm_t_trampoline_1 call = scm_trampoline_1 (proc);
5469 SCM_GASSERT2 (call, g_map, proc, arg1, SCM_ARG1, s_map);
5470 while (SCM_NIMP (arg1))
5471 {
5472 *pres = scm_list_1 (call (proc, SCM_CAR (arg1)));
5473 pres = SCM_CDRLOC (*pres);
5474 arg1 = SCM_CDR (arg1);
5475 }
5476 return res;
5477 }
5478 if (SCM_NULLP (SCM_CDR (args)))
5479 {
5480 SCM arg2 = SCM_CAR (args);
5481 int len2 = scm_ilength (arg2);
5482 scm_t_trampoline_2 call = scm_trampoline_2 (proc);
5483 SCM_GASSERTn (call,
5484 g_map, scm_cons2 (proc, arg1, args), SCM_ARG1, s_map);
5485 SCM_GASSERTn (len2 >= 0,
5486 g_map, scm_cons2 (proc, arg1, args), SCM_ARG3, s_map);
5487 if (len2 != len)
5488 SCM_OUT_OF_RANGE (3, arg2);
5489 while (SCM_NIMP (arg1))
5490 {
5491 *pres = scm_list_1 (call (proc, SCM_CAR (arg1), SCM_CAR (arg2)));
5492 pres = SCM_CDRLOC (*pres);
5493 arg1 = SCM_CDR (arg1);
5494 arg2 = SCM_CDR (arg2);
5495 }
5496 return res;
5497 }
5498 arg1 = scm_cons (arg1, args);
5499 args = scm_vector (arg1);
5500 ve = SCM_VELTS (args);
5501 check_map_args (args, len, g_map, proc, arg1, s_map);
5502 while (1)
5503 {
5504 arg1 = SCM_EOL;
5505 for (i = SCM_VECTOR_LENGTH (args) - 1; i >= 0; i--)
5506 {
5507 if (SCM_IMP (ve[i]))
5508 return res;
5509 arg1 = scm_cons (SCM_CAR (ve[i]), arg1);
5510 SCM_VECTOR_SET (args, i, SCM_CDR (ve[i]));
5511 }
5512 *pres = scm_list_1 (scm_apply (proc, arg1, SCM_EOL));
5513 pres = SCM_CDRLOC (*pres);
5514 }
5515 }
5516 #undef FUNC_NAME
5517
5518
5519 SCM_GPROC (s_for_each, "for-each", 2, 0, 1, scm_for_each, g_for_each);
5520
5521 SCM
5522 scm_for_each (SCM proc, SCM arg1, SCM args)
5523 #define FUNC_NAME s_for_each
5524 {
5525 SCM const *ve = &args; /* Keep args from being optimized away. */
5526 long i, len;
5527 len = scm_ilength (arg1);
5528 SCM_GASSERTn (len >= 0, g_for_each, scm_cons2 (proc, arg1, args),
5529 SCM_ARG2, s_for_each);
5530 SCM_VALIDATE_REST_ARGUMENT (args);
5531 if (SCM_NULLP (args))
5532 {
5533 scm_t_trampoline_1 call = scm_trampoline_1 (proc);
5534 SCM_GASSERT2 (call, g_for_each, proc, arg1, SCM_ARG1, s_for_each);
5535 while (SCM_NIMP (arg1))
5536 {
5537 call (proc, SCM_CAR (arg1));
5538 arg1 = SCM_CDR (arg1);
5539 }
5540 return SCM_UNSPECIFIED;
5541 }
5542 if (SCM_NULLP (SCM_CDR (args)))
5543 {
5544 SCM arg2 = SCM_CAR (args);
5545 int len2 = scm_ilength (arg2);
5546 scm_t_trampoline_2 call = scm_trampoline_2 (proc);
5547 SCM_GASSERTn (call, g_for_each,
5548 scm_cons2 (proc, arg1, args), SCM_ARG1, s_for_each);
5549 SCM_GASSERTn (len2 >= 0, g_for_each,
5550 scm_cons2 (proc, arg1, args), SCM_ARG3, s_for_each);
5551 if (len2 != len)
5552 SCM_OUT_OF_RANGE (3, arg2);
5553 while (SCM_NIMP (arg1))
5554 {
5555 call (proc, SCM_CAR (arg1), SCM_CAR (arg2));
5556 arg1 = SCM_CDR (arg1);
5557 arg2 = SCM_CDR (arg2);
5558 }
5559 return SCM_UNSPECIFIED;
5560 }
5561 arg1 = scm_cons (arg1, args);
5562 args = scm_vector (arg1);
5563 ve = SCM_VELTS (args);
5564 check_map_args (args, len, g_for_each, proc, arg1, s_for_each);
5565 while (1)
5566 {
5567 arg1 = SCM_EOL;
5568 for (i = SCM_VECTOR_LENGTH (args) - 1; i >= 0; i--)
5569 {
5570 if (SCM_IMP (ve[i]))
5571 return SCM_UNSPECIFIED;
5572 arg1 = scm_cons (SCM_CAR (ve[i]), arg1);
5573 SCM_VECTOR_SET (args, i, SCM_CDR (ve[i]));
5574 }
5575 scm_apply (proc, arg1, SCM_EOL);
5576 }
5577 }
5578 #undef FUNC_NAME
5579
5580
5581 SCM
5582 scm_closure (SCM code, SCM env)
5583 {
5584 SCM z;
5585 SCM closcar = scm_cons (code, SCM_EOL);
5586 z = scm_cell (SCM_UNPACK (closcar) + scm_tc3_closure, (scm_t_bits) env);
5587 scm_remember_upto_here (closcar);
5588 return z;
5589 }
5590
5591
5592 scm_t_bits scm_tc16_promise;
5593
5594 SCM
5595 scm_makprom (SCM code)
5596 {
5597 SCM_RETURN_NEWSMOB2 (scm_tc16_promise,
5598 SCM_UNPACK (code),
5599 scm_make_rec_mutex ());
5600 }
5601
5602 static size_t
5603 promise_free (SCM promise)
5604 {
5605 scm_rec_mutex_free (SCM_PROMISE_MUTEX (promise));
5606 return 0;
5607 }
5608
5609 static int
5610 promise_print (SCM exp, SCM port, scm_print_state *pstate)
5611 {
5612 int writingp = SCM_WRITINGP (pstate);
5613 scm_puts ("#<promise ", port);
5614 SCM_SET_WRITINGP (pstate, 1);
5615 scm_iprin1 (SCM_PROMISE_DATA (exp), port, pstate);
5616 SCM_SET_WRITINGP (pstate, writingp);
5617 scm_putc ('>', port);
5618 return !0;
5619 }
5620
5621 SCM_DEFINE (scm_force, "force", 1, 0, 0,
5622 (SCM promise),
5623 "If the promise @var{x} has not been computed yet, compute and\n"
5624 "return @var{x}, otherwise just return the previously computed\n"
5625 "value.")
5626 #define FUNC_NAME s_scm_force
5627 {
5628 SCM_VALIDATE_SMOB (1, promise, promise);
5629 scm_rec_mutex_lock (SCM_PROMISE_MUTEX (promise));
5630 if (!SCM_PROMISE_COMPUTED_P (promise))
5631 {
5632 SCM ans = scm_call_0 (SCM_PROMISE_DATA (promise));
5633 if (!SCM_PROMISE_COMPUTED_P (promise))
5634 {
5635 SCM_SET_PROMISE_DATA (promise, ans);
5636 SCM_SET_PROMISE_COMPUTED (promise);
5637 }
5638 }
5639 scm_rec_mutex_unlock (SCM_PROMISE_MUTEX (promise));
5640 return SCM_PROMISE_DATA (promise);
5641 }
5642 #undef FUNC_NAME
5643
5644
5645 SCM_DEFINE (scm_promise_p, "promise?", 1, 0, 0,
5646 (SCM obj),
5647 "Return true if @var{obj} is a promise, i.e. a delayed computation\n"
5648 "(@pxref{Delayed evaluation,,,r5rs.info,The Revised^5 Report on Scheme}).")
5649 #define FUNC_NAME s_scm_promise_p
5650 {
5651 return scm_from_bool (SCM_TYP16_PREDICATE (scm_tc16_promise, obj));
5652 }
5653 #undef FUNC_NAME
5654
5655
5656 SCM_DEFINE (scm_cons_source, "cons-source", 3, 0, 0,
5657 (SCM xorig, SCM x, SCM y),
5658 "Create and return a new pair whose car and cdr are @var{x} and @var{y}.\n"
5659 "Any source properties associated with @var{xorig} are also associated\n"
5660 "with the new pair.")
5661 #define FUNC_NAME s_scm_cons_source
5662 {
5663 SCM p, z;
5664 z = scm_cons (x, y);
5665 /* Copy source properties possibly associated with xorig. */
5666 p = scm_whash_lookup (scm_source_whash, xorig);
5667 if (scm_is_true (p))
5668 scm_whash_insert (scm_source_whash, z, p);
5669 return z;
5670 }
5671 #undef FUNC_NAME
5672
5673
5674 /* The function scm_copy_tree is used to copy an expression tree to allow the
5675 * memoizer to modify the expression during memoization. scm_copy_tree
5676 * creates deep copies of pairs and vectors, but not of any other data types,
5677 * since only pairs and vectors will be parsed by the memoizer.
5678 *
5679 * To avoid infinite recursion due to cyclic structures, the hare-and-tortoise
5680 * pattern is used to detect cycles. In fact, the pattern is used in two
5681 * dimensions, vertical (indicated in the code by the variable names 'hare'
5682 * and 'tortoise') and horizontal ('rabbit' and 'turtle'). In both
5683 * dimensions, the hare/rabbit will take two steps when the tortoise/turtle
5684 * takes one.
5685 *
5686 * The vertical dimension corresponds to recursive calls to function
5687 * copy_tree: This happens when descending into vector elements, into cars of
5688 * lists and into the cdr of an improper list. In this dimension, the
5689 * tortoise follows the hare by using the processor stack: Every stack frame
5690 * will hold an instance of struct t_trace. These instances are connected in
5691 * a way that represents the trace of the hare, which thus can be followed by
5692 * the tortoise. The tortoise will always point to struct t_trace instances
5693 * relating to SCM objects that have already been copied. Thus, a cycle is
5694 * detected if the tortoise and the hare point to the same object,
5695 *
5696 * The horizontal dimension is within one execution of copy_tree, when the
5697 * function cdr's along the pairs of a list. This is the standard
5698 * hare-and-tortoise implementation, found several times in guile. */
5699
5700 struct t_trace {
5701 struct t_trace *trace; // These pointers form a trace along the stack.
5702 SCM obj; // The object handled at the respective stack frame.
5703 };
5704
5705 static SCM
5706 copy_tree (
5707 struct t_trace *const hare,
5708 struct t_trace *tortoise,
5709 unsigned int tortoise_delay )
5710 {
5711 if (!SCM_CONSP (hare->obj) && !SCM_VECTORP (hare->obj))
5712 {
5713 return hare->obj;
5714 }
5715 else
5716 {
5717 /* Prepare the trace along the stack. */
5718 struct t_trace new_hare;
5719 hare->trace = &new_hare;
5720
5721 /* The tortoise will make its step after the delay has elapsed. Note
5722 * that in contrast to the typical hare-and-tortoise pattern, the step
5723 * of the tortoise happens before the hare takes its steps. This is, in
5724 * principle, no problem, except for the start of the algorithm: Then,
5725 * it has to be made sure that the hare actually gets its advantage of
5726 * two steps. */
5727 if (tortoise_delay == 0)
5728 {
5729 tortoise_delay = 1;
5730 tortoise = tortoise->trace;
5731 ASSERT_SYNTAX (!scm_is_eq (hare->obj, tortoise->obj),
5732 s_bad_expression, hare->obj);
5733 }
5734 else
5735 {
5736 --tortoise_delay;
5737 }
5738
5739 if (SCM_VECTORP (hare->obj))
5740 {
5741 const unsigned long int length = SCM_VECTOR_LENGTH (hare->obj);
5742 const SCM new_vector = scm_c_make_vector (length, SCM_UNSPECIFIED);
5743
5744 /* Each vector element is copied by recursing into copy_tree, having
5745 * the tortoise follow the hare into the depths of the stack. */
5746 unsigned long int i;
5747 for (i = 0; i < length; ++i)
5748 {
5749 SCM new_element;
5750 new_hare.obj = SCM_VECTOR_REF (hare->obj, i);
5751 new_element = copy_tree (&new_hare, tortoise, tortoise_delay);
5752 SCM_VECTOR_SET (new_vector, i, new_element);
5753 }
5754
5755 return new_vector;
5756 }
5757 else // SCM_CONSP (hare->obj)
5758 {
5759 SCM result;
5760 SCM tail;
5761
5762 SCM rabbit = hare->obj;
5763 SCM turtle = hare->obj;
5764
5765 SCM copy;
5766
5767 /* The first pair of the list is treated specially, in order to
5768 * preserve a potential source code position. */
5769 result = tail = scm_cons_source (rabbit, SCM_EOL, SCM_EOL);
5770 new_hare.obj = SCM_CAR (rabbit);
5771 copy = copy_tree (&new_hare, tortoise, tortoise_delay);
5772 SCM_SETCAR (tail, copy);
5773
5774 /* The remaining pairs of the list are copied by, horizontally,
5775 * having the turtle follow the rabbit, and, vertically, having the
5776 * tortoise follow the hare into the depths of the stack. */
5777 rabbit = SCM_CDR (rabbit);
5778 while (SCM_CONSP (rabbit))
5779 {
5780 new_hare.obj = SCM_CAR (rabbit);
5781 copy = copy_tree (&new_hare, tortoise, tortoise_delay);
5782 SCM_SETCDR (tail, scm_cons (copy, SCM_UNDEFINED));
5783 tail = SCM_CDR (tail);
5784
5785 rabbit = SCM_CDR (rabbit);
5786 if (SCM_CONSP (rabbit))
5787 {
5788 new_hare.obj = SCM_CAR (rabbit);
5789 copy = copy_tree (&new_hare, tortoise, tortoise_delay);
5790 SCM_SETCDR (tail, scm_cons (copy, SCM_UNDEFINED));
5791 tail = SCM_CDR (tail);
5792 rabbit = SCM_CDR (rabbit);
5793
5794 turtle = SCM_CDR (turtle);
5795 ASSERT_SYNTAX (!scm_is_eq (rabbit, turtle),
5796 s_bad_expression, rabbit);
5797 }
5798 }
5799
5800 /* We have to recurse into copy_tree again for the last cdr, in
5801 * order to handle the situation that it holds a vector. */
5802 new_hare.obj = rabbit;
5803 copy = copy_tree (&new_hare, tortoise, tortoise_delay);
5804 SCM_SETCDR (tail, copy);
5805
5806 return result;
5807 }
5808 }
5809 }
5810
5811 SCM_DEFINE (scm_copy_tree, "copy-tree", 1, 0, 0,
5812 (SCM obj),
5813 "Recursively copy the data tree that is bound to @var{obj}, and return a\n"
5814 "the new data structure. @code{copy-tree} recurses down the\n"
5815 "contents of both pairs and vectors (since both cons cells and vector\n"
5816 "cells may point to arbitrary objects), and stops recursing when it hits\n"
5817 "any other object.")
5818 #define FUNC_NAME s_scm_copy_tree
5819 {
5820 /* Prepare the trace along the stack. */
5821 struct t_trace trace;
5822 trace.obj = obj;
5823
5824 /* In function copy_tree, if the tortoise makes its step, it will do this
5825 * before the hare has the chance to move. Thus, we have to make sure that
5826 * the very first step of the tortoise will not happen after the hare has
5827 * really made two steps. This is achieved by passing '2' as the initial
5828 * delay for the tortoise. NOTE: Since cycles are unlikely, giving the hare
5829 * a bigger advantage may improve performance slightly. */
5830 return copy_tree (&trace, &trace, 2);
5831 }
5832 #undef FUNC_NAME
5833
5834
5835 /* We have three levels of EVAL here:
5836
5837 - scm_i_eval (exp, env)
5838
5839 evaluates EXP in environment ENV. ENV is a lexical environment
5840 structure as used by the actual tree code evaluator. When ENV is
5841 a top-level environment, then changes to the current module are
5842 tracked by updating ENV so that it continues to be in sync with
5843 the current module.
5844
5845 - scm_primitive_eval (exp)
5846
5847 evaluates EXP in the top-level environment as determined by the
5848 current module. This is done by constructing a suitable
5849 environment and calling scm_i_eval. Thus, changes to the
5850 top-level module are tracked normally.
5851
5852 - scm_eval (exp, mod)
5853
5854 evaluates EXP while MOD is the current module. This is done by
5855 setting the current module to MOD, invoking scm_primitive_eval on
5856 EXP, and then restoring the current module to the value it had
5857 previously. That is, while EXP is evaluated, changes to the
5858 current module are tracked, but these changes do not persist when
5859 scm_eval returns.
5860
5861 For each level of evals, there are two variants, distinguished by a
5862 _x suffix: the ordinary variant does not modify EXP while the _x
5863 variant can destructively modify EXP into something completely
5864 unintelligible. A Scheme data structure passed as EXP to one of the
5865 _x variants should not ever be used again for anything. So when in
5866 doubt, use the ordinary variant.
5867
5868 */
5869
5870 SCM
5871 scm_i_eval_x (SCM exp, SCM env)
5872 {
5873 if (scm_is_symbol (exp))
5874 return *scm_lookupcar (scm_cons (exp, SCM_UNDEFINED), env, 1);
5875 else
5876 return SCM_I_XEVAL (exp, env);
5877 }
5878
5879 SCM
5880 scm_i_eval (SCM exp, SCM env)
5881 {
5882 exp = scm_copy_tree (exp);
5883 if (scm_is_symbol (exp))
5884 return *scm_lookupcar (scm_cons (exp, SCM_UNDEFINED), env, 1);
5885 else
5886 return SCM_I_XEVAL (exp, env);
5887 }
5888
5889 SCM
5890 scm_primitive_eval_x (SCM exp)
5891 {
5892 SCM env;
5893 SCM transformer = scm_current_module_transformer ();
5894 if (SCM_NIMP (transformer))
5895 exp = scm_call_1 (transformer, exp);
5896 env = scm_top_level_env (scm_current_module_lookup_closure ());
5897 return scm_i_eval_x (exp, env);
5898 }
5899
5900 SCM_DEFINE (scm_primitive_eval, "primitive-eval", 1, 0, 0,
5901 (SCM exp),
5902 "Evaluate @var{exp} in the top-level environment specified by\n"
5903 "the current module.")
5904 #define FUNC_NAME s_scm_primitive_eval
5905 {
5906 SCM env;
5907 SCM transformer = scm_current_module_transformer ();
5908 if (scm_is_true (transformer))
5909 exp = scm_call_1 (transformer, exp);
5910 env = scm_top_level_env (scm_current_module_lookup_closure ());
5911 return scm_i_eval (exp, env);
5912 }
5913 #undef FUNC_NAME
5914
5915
5916 /* Eval does not take the second arg optionally. This is intentional
5917 * in order to be R5RS compatible, and to prepare for the new module
5918 * system, where we would like to make the choice of evaluation
5919 * environment explicit. */
5920
5921 static void
5922 change_environment (void *data)
5923 {
5924 SCM pair = SCM_PACK (data);
5925 SCM new_module = SCM_CAR (pair);
5926 SCM old_module = scm_current_module ();
5927 SCM_SETCDR (pair, old_module);
5928 scm_set_current_module (new_module);
5929 }
5930
5931 static void
5932 restore_environment (void *data)
5933 {
5934 SCM pair = SCM_PACK (data);
5935 SCM old_module = SCM_CDR (pair);
5936 SCM new_module = scm_current_module ();
5937 SCM_SETCAR (pair, new_module);
5938 scm_set_current_module (old_module);
5939 }
5940
5941 static SCM
5942 inner_eval_x (void *data)
5943 {
5944 return scm_primitive_eval_x (SCM_PACK(data));
5945 }
5946
5947 SCM
5948 scm_eval_x (SCM exp, SCM module)
5949 #define FUNC_NAME "eval!"
5950 {
5951 SCM_VALIDATE_MODULE (2, module);
5952
5953 return scm_internal_dynamic_wind
5954 (change_environment, inner_eval_x, restore_environment,
5955 (void *) SCM_UNPACK (exp),
5956 (void *) SCM_UNPACK (scm_cons (module, SCM_BOOL_F)));
5957 }
5958 #undef FUNC_NAME
5959
5960 static SCM
5961 inner_eval (void *data)
5962 {
5963 return scm_primitive_eval (SCM_PACK(data));
5964 }
5965
5966 SCM_DEFINE (scm_eval, "eval", 2, 0, 0,
5967 (SCM exp, SCM module),
5968 "Evaluate @var{exp}, a list representing a Scheme expression,\n"
5969 "in the top-level environment specified by @var{module}.\n"
5970 "While @var{exp} is evaluated (using @code{primitive-eval}),\n"
5971 "@var{module} is made the current module. The current module\n"
5972 "is reset to its previous value when @var{eval} returns.")
5973 #define FUNC_NAME s_scm_eval
5974 {
5975 SCM_VALIDATE_MODULE (2, module);
5976
5977 return scm_internal_dynamic_wind
5978 (change_environment, inner_eval, restore_environment,
5979 (void *) SCM_UNPACK (exp),
5980 (void *) SCM_UNPACK (scm_cons (module, SCM_BOOL_F)));
5981 }
5982 #undef FUNC_NAME
5983
5984
5985 /* At this point, deval and scm_dapply are generated.
5986 */
5987
5988 #define DEVAL
5989 #include "eval.c"
5990
5991
5992 #if (SCM_ENABLE_DEPRECATED == 1)
5993
5994 /* Deprecated in guile 1.7.0 on 2004-03-29. */
5995 SCM scm_ceval (SCM x, SCM env)
5996 {
5997 if (SCM_CONSP (x))
5998 return ceval (x, env);
5999 else if (scm_is_symbol (x))
6000 return *scm_lookupcar (scm_cons (x, SCM_UNDEFINED), env, 1);
6001 else
6002 return SCM_I_XEVAL (x, env);
6003 }
6004
6005 /* Deprecated in guile 1.7.0 on 2004-03-29. */
6006 SCM scm_deval (SCM x, SCM env)
6007 {
6008 if (SCM_CONSP (x))
6009 return deval (x, env);
6010 else if (scm_is_symbol (x))
6011 return *scm_lookupcar (scm_cons (x, SCM_UNDEFINED), env, 1);
6012 else
6013 return SCM_I_XEVAL (x, env);
6014 }
6015
6016 static SCM
6017 dispatching_eval (SCM x, SCM env)
6018 {
6019 if (scm_debug_mode_p)
6020 return scm_deval (x, env);
6021 else
6022 return scm_ceval (x, env);
6023 }
6024
6025 /* Deprecated in guile 1.7.0 on 2004-03-29. */
6026 SCM (*scm_ceval_ptr) (SCM x, SCM env) = dispatching_eval;
6027
6028 #endif
6029
6030
6031 void
6032 scm_init_eval ()
6033 {
6034 scm_init_opts (scm_evaluator_traps,
6035 scm_evaluator_trap_table,
6036 SCM_N_EVALUATOR_TRAPS);
6037 scm_init_opts (scm_eval_options_interface,
6038 scm_eval_opts,
6039 SCM_N_EVAL_OPTIONS);
6040
6041 scm_tc16_promise = scm_make_smob_type ("promise", 0);
6042 scm_set_smob_mark (scm_tc16_promise, scm_markcdr);
6043 scm_set_smob_free (scm_tc16_promise, promise_free);
6044 scm_set_smob_print (scm_tc16_promise, promise_print);
6045
6046 undefineds = scm_list_1 (SCM_UNDEFINED);
6047 SCM_SETCDR (undefineds, undefineds);
6048 scm_permanent_object (undefineds);
6049
6050 scm_listofnull = scm_list_1 (SCM_EOL);
6051
6052 f_apply = scm_c_define_subr ("apply", scm_tc7_lsubr_2, scm_apply);
6053 scm_permanent_object (f_apply);
6054
6055 #include "libguile/eval.x"
6056
6057 scm_add_feature ("delay");
6058 }
6059
6060 #endif /* !DEVAL */
6061
6062 /*
6063 Local Variables:
6064 c-file-style: "gnu"
6065 End:
6066 */