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