1 /* Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002,2003,2004
2 * Free Software Foundation, Inc.
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.
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.
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
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:". */
27 /* SECTION: This code is compiled once.
34 #include "libguile/__scm.h"
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
48 # ifndef alloca /* predefined by HP cc +Olibcalls */
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"
88 #include "libguile/eval.h"
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
);
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. */
106 /* Syntax errors that can be detected during memoization: */
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";
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
116 static const char s_expression
[] = "Missing or extra expression in";
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";
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";
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";
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.
137 static const char s_missing_body_expression
[] = "Missing body expression in";
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
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
149 static const char s_bad_define
[] = "Bad define placement";
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
154 static const char s_missing_clauses
[] = "Missing clauses";
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";
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";
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";
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
178 static const char s_duplicate_case_label
[] = "Duplicate case label";
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";
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";
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";
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";
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";
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";
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";
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";
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
223 static const char s_bad_formal
[] = "Bad formal";
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";
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
232 static const char s_splicing
[] = "Non-list result for unquote-splicing";
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";
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.
245 * <filename>: In procedure memoization:
246 * <filename>: In file <name>, line <nr>: <error-message> in <expression>. */
248 SCM_SYMBOL (syntax_error_key
, "syntax-error");
250 /* The prototype is needed to indicate that the function does not return. */
252 syntax_error (const char* const, const SCM
, const SCM
) SCM_NORETURN
;
255 syntax_error (const char* const msg
, const SCM form
, const SCM expr
)
257 SCM msg_string
= scm_from_locale_string (msg
);
258 SCM filename
= SCM_BOOL_F
;
259 SCM linenr
= SCM_BOOL_F
;
263 if (scm_is_pair (form
))
265 filename
= scm_source_property (form
, scm_sym_filename
);
266 linenr
= scm_source_property (form
, scm_sym_line
);
269 if (scm_is_false (filename
) && scm_is_false (linenr
) && scm_is_pair (expr
))
271 filename
= scm_source_property (expr
, scm_sym_filename
);
272 linenr
= scm_source_property (expr
, scm_sym_line
);
275 if (!SCM_UNBNDP (expr
))
277 if (scm_is_true (filename
))
279 format
= "In file ~S, line ~S: ~A ~S in expression ~S.";
280 args
= scm_list_5 (filename
, linenr
, msg_string
, form
, expr
);
282 else if (scm_is_true (linenr
))
284 format
= "In line ~S: ~A ~S in expression ~S.";
285 args
= scm_list_4 (linenr
, msg_string
, form
, expr
);
289 format
= "~A ~S in expression ~S.";
290 args
= scm_list_3 (msg_string
, form
, expr
);
295 if (scm_is_true (filename
))
297 format
= "In file ~S, line ~S: ~A ~S.";
298 args
= scm_list_4 (filename
, linenr
, msg_string
, form
);
300 else if (scm_is_true (linenr
))
302 format
= "In line ~S: ~A ~S.";
303 args
= scm_list_3 (linenr
, msg_string
, form
);
308 args
= scm_list_2 (msg_string
, form
);
312 scm_error (syntax_error_key
, "memoization", format
, args
, SCM_BOOL_F
);
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); }
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
332 * Frame numbers have 11 bits, relative offsets have 12 bits.
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) \
349 + ((binding_nr) << 20) \
350 + ((last_p) ? SCM_ICDR : 0) \
354 scm_i_print_iloc (SCM iloc
, SCM port
)
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
);
362 #if (SCM_DEBUG_DEBUGGING_SUPPORT == 1)
364 SCM
scm_dbg_make_iloc (SCM frame
, SCM binding
, SCM cdrp
);
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
372 return SCM_MAKE_ILOC (scm_to_unsigned_integer (frame
, 0, SCM_IFRAME_MAX
),
373 scm_to_unsigned_integer (binding
, 0, SCM_IDIST_MAX
),
378 SCM
scm_dbg_iloc_p (SCM obj
);
380 SCM_DEFINE (scm_dbg_iloc_p
, "dbg-iloc?", 1, 0, 0,
382 "Return @code{#t} if @var{obj} is an iloc.")
383 #define FUNC_NAME s_scm_dbg_iloc_p
385 return scm_from_bool (SCM_ILOCP (obj
));
393 /* {Evaluator byte codes (isyms)}
396 #define ISYMNUM(n) (SCM_ITAG8_DATA (n))
398 /* This table must agree with the list of SCM_IM_ constants in tags.h */
399 static const char *const isymnames
[] =
416 "#@call-with-current-continuation",
422 "#@call-with-values",
430 scm_i_print_isym (SCM isym
, SCM port
)
432 const size_t isymnum
= ISYMNUM (isym
);
433 if (isymnum
< (sizeof isymnames
/ sizeof (char *)))
434 scm_puts (isymnames
[isymnum
], port
);
436 scm_ipruk ("isym", isym
, port
);
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. */
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
452 lookup_global_symbol (const SCM symbol
, const SCM top_level
)
454 const SCM variable
= scm_sym2var (symbol
, top_level
, SCM_BOOL_F
);
455 if (scm_is_false (variable
))
456 return SCM_UNDEFINED
;
462 lookup_symbol (const SCM symbol
, const SCM env
)
465 unsigned int frame_nr
;
467 for (frame_idx
= env
, frame_nr
= 0;
468 !scm_is_null (frame_idx
);
469 frame_idx
= SCM_CDR (frame_idx
), ++frame_nr
)
471 const SCM frame
= SCM_CAR (frame_idx
);
472 if (scm_is_pair (frame
))
474 /* frame holds a local environment frame */
476 unsigned int symbol_nr
;
478 for (symbol_idx
= SCM_CAR (frame
), symbol_nr
= 0;
479 scm_is_pair (symbol_idx
);
480 symbol_idx
= SCM_CDR (symbol_idx
), ++symbol_nr
)
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);
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);
492 /* no more local environment frames */
493 return lookup_global_symbol (symbol
, frame
);
497 return lookup_global_symbol (symbol
, SCM_BOOL_F
);
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. */
507 literal_p (const SCM symbol
, const SCM env
)
509 const SCM variable
= lookup_symbol (symbol
, env
);
510 if (SCM_UNBNDP (variable
))
512 if (SCM_VARIABLEP (variable
) && SCM_MACROP (SCM_VARIABLE_REF (variable
)))
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. */
523 is_self_quoting_p (const SCM expr
)
525 if (scm_is_pair (expr
))
527 else if (scm_is_symbol (expr
))
529 else if (scm_is_null (expr
))
535 SCM_SYMBOL (sym_three_question_marks
, "???");
538 unmemoize_expression (const SCM expr
, const SCM env
)
540 if (SCM_ILOCP (expr
))
543 unsigned long int frame_nr
;
545 unsigned long int symbol_nr
;
547 for (frame_idx
= env
, frame_nr
= SCM_IFRAME (expr
);
549 frame_idx
= SCM_CDR (frame_idx
), --frame_nr
)
551 for (symbol_idx
= SCM_CAAR (frame_idx
), symbol_nr
= SCM_IDIST (expr
);
553 symbol_idx
= SCM_CDR (symbol_idx
), --symbol_nr
)
555 return SCM_ICDRP (expr
) ? symbol_idx
: SCM_CAR (symbol_idx
);
557 else if (SCM_VARIABLEP (expr
))
559 const SCM sym
= scm_module_reverse_lookup (scm_env_module (env
), expr
);
560 return scm_is_true (sym
) ? sym
: sym_three_question_marks
;
562 else if (scm_is_simple_vector (expr
))
564 return scm_list_2 (scm_sym_quote
, expr
);
566 else if (!scm_is_pair (expr
))
570 else if (SCM_ISYMP (SCM_CAR (expr
)))
572 return unmemoize_builtin_macro (expr
, env
);
576 return unmemoize_exprs (expr
, env
);
582 unmemoize_exprs (const SCM exprs
, const SCM env
)
584 SCM r_result
= SCM_EOL
;
585 SCM expr_idx
= exprs
;
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_is_pair (expr_idx
); expr_idx
= SCM_CDR (expr_idx
))
598 const SCM expr
= SCM_CAR (expr_idx
);
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
))
608 um_expr
= unmemoize_expression (expr
, env
);
609 r_result
= scm_cons (um_expr
, r_result
);
612 um_expr
= unmemoize_expression (expr_idx
, env
);
613 if (!scm_is_null (r_result
))
615 const SCM result
= scm_reverse_x (r_result
, SCM_UNDEFINED
);
616 SCM_SETCDR (r_result
, um_expr
);
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
633 * It is assumed that the calling expression has already made sure that the
634 * body is a proper list. */
636 m_body (SCM op
, SCM exprs
)
638 /* Don't add another ISYM if one is present already. */
639 if (SCM_ISYMP (SCM_CAR (exprs
)))
642 return scm_cons (op
, exprs
);
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. */
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. */
655 try_macro_lookup (const SCM expr
, const SCM env
)
657 if (scm_is_symbol (expr
))
659 const SCM variable
= lookup_symbol (expr
, env
);
660 if (SCM_VARIABLEP (variable
))
662 const SCM value
= SCM_VARIABLE_REF (variable
);
663 if (SCM_MACROP (value
))
668 return SCM_UNDEFINED
;
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. */
675 expand_user_macros (SCM expr
, const SCM env
)
677 while (scm_is_pair (expr
))
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
);
683 if (SCM_MACROP (value
) && SCM_MACRO_TYPE (value
) == 2)
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. */
691 /* No user macro: return. */
692 SCM_SETCAR (expr
, new_car
);
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. */
706 is_system_macro_p (const SCM syntactic_keyword
, const SCM form
, const SCM env
)
708 if (scm_is_pair (form
))
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
))
714 const SCM macro_name
= scm_macro_name (value
);
715 return scm_is_eq (macro_name
, syntactic_keyword
);
723 m_expand_body (const SCM forms
, const SCM env
)
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
;
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
739 while (!scm_is_null (form_idx
))
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
))
745 definitions
= scm_cons (new_form
, definitions
);
746 form_idx
= SCM_CDR (form_idx
);
748 else if (is_system_macro_p (scm_sym_begin
, new_form
, env
))
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)
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_is_null (grouped_form_idx
))
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
))
764 found_definition
= 1;
765 definitions
= scm_cons (new_inner_form
, definitions
);
766 grouped_form_idx
= SCM_CDR (grouped_form_idx
);
768 else if (is_system_macro_p (scm_sym_begin
, new_inner_form
, env
))
770 const SCM inner_group
= SCM_CDR (new_inner_form
);
772 = scm_append (scm_list_2 (inner_group
,
773 SCM_CDR (grouped_form_idx
)));
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
;
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
)
792 form_idx
= SCM_CDR (form_idx
);
802 /* We have detected a form which is no definition. This marks the
803 * start of the sequence of expressions of the body. */
809 /* FIXME: forms does not hold information about the file location. */
810 ASSERT_SYNTAX (scm_is_pair (sequence
), s_missing_body_expression
, cdr_forms
);
812 if (!scm_is_null (definitions
))
816 SCM letrec_expression
;
817 SCM new_letrec_expression
;
819 SCM bindings
= SCM_EOL
;
820 for (definition_idx
= definitions
;
821 !scm_is_null (definition_idx
);
822 definition_idx
= SCM_CDR (definition_idx
))
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
);
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
);
839 SCM_SETCAR (forms
, SCM_CAR (sequence
));
840 SCM_SETCDR (forms
, SCM_CDR (sequence
));
845 macroexp (SCM x
, SCM env
)
847 SCM res
, proc
, orig_sym
;
849 /* Don't bother to produce error messages here. We get them when we
850 eventually execute the code for real. */
853 orig_sym
= SCM_CAR (x
);
854 if (!scm_is_symbol (orig_sym
))
858 SCM
*proc_ptr
= scm_lookupcar1 (x
, env
, 0);
859 if (proc_ptr
== NULL
)
861 /* We have lost the race. */
867 /* Only handle memoizing macros. `Acros' and `macros' are really
868 special forms and should not be evaluated here. */
870 if (!SCM_MACROP (proc
)
871 || (SCM_MACRO_TYPE (proc
) != 2 && !SCM_BUILTIN_MACRO_P (proc
)))
874 SCM_SETCAR (x
, orig_sym
); /* Undo memoizing effect of lookupcar */
875 res
= scm_call_2 (SCM_MACRO_CODE (proc
), x
, env
);
877 if (scm_ilength (res
) <= 0)
878 res
= scm_list_2 (SCM_IM_BEGIN
, res
);
881 SCM_SETCAR (x
, SCM_CAR (res
));
882 SCM_SETCDR (x
, SCM_CDR (res
));
888 /* Start of the memoizers for the standard R5RS builtin macros. */
891 SCM_SYNTAX (s_and
, "and", scm_i_makbimacro
, scm_m_and
);
892 SCM_GLOBAL_SYMBOL (scm_sym_and
, s_and
);
895 scm_m_and (SCM expr
, SCM env SCM_UNUSED
)
897 const SCM cdr_expr
= SCM_CDR (expr
);
898 const long length
= scm_ilength (cdr_expr
);
900 ASSERT_SYNTAX (length
>= 0, s_bad_expression
, expr
);
904 /* Special case: (and) is replaced by #t. */
909 SCM_SETCAR (expr
, SCM_IM_AND
);
915 unmemoize_and (const SCM expr
, const SCM env
)
917 return scm_cons (scm_sym_and
, unmemoize_exprs (SCM_CDR (expr
), env
));
921 SCM_SYNTAX (s_begin
, "begin", scm_i_makbimacro
, scm_m_begin
);
922 SCM_GLOBAL_SYMBOL (scm_sym_begin
, s_begin
);
925 scm_m_begin (SCM expr
, SCM env SCM_UNUSED
)
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
);
933 SCM_SETCAR (expr
, SCM_IM_BEGIN
);
938 unmemoize_begin (const SCM expr
, const SCM env
)
940 return scm_cons (scm_sym_begin
, unmemoize_exprs (SCM_CDR (expr
), env
));
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");
949 scm_m_case (SCM expr
, SCM env
)
952 SCM all_labels
= SCM_EOL
;
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
);
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
);
961 clauses
= SCM_CDR (cdr_expr
);
962 while (!scm_is_null (clauses
))
966 const SCM clause
= SCM_CAR (clauses
);
967 ASSERT_SYNTAX_2 (scm_ilength (clause
) >= 2,
968 s_bad_case_clause
, clause
, expr
);
970 labels
= SCM_CAR (clause
);
971 if (scm_is_pair (labels
))
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
));
977 else if (scm_is_null (labels
))
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
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_is_null (SCM_CDR (clauses
)),
989 s_misplaced_else_clause
, clause
, expr
);
992 /* build the new clause */
993 if (scm_is_eq (labels
, scm_sym_else
))
994 SCM_SETCAR (clause
, SCM_IM_ELSE
);
996 clauses
= SCM_CDR (clauses
);
999 /* Check whether all case labels are distinct. */
1000 for (; !scm_is_null (all_labels
); all_labels
= SCM_CDR (all_labels
))
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
);
1007 SCM_SETCAR (expr
, SCM_IM_CASE
);
1012 unmemoize_case (const SCM expr
, const SCM env
)
1014 const SCM um_key_expr
= unmemoize_expression (SCM_CADR (expr
), env
);
1015 SCM um_clauses
= SCM_EOL
;
1018 for (clause_idx
= SCM_CDDR (expr
);
1019 !scm_is_null (clause_idx
);
1020 clause_idx
= SCM_CDR (clause_idx
))
1022 const SCM clause
= SCM_CAR (clause_idx
);
1023 const SCM labels
= SCM_CAR (clause
);
1024 const SCM exprs
= SCM_CDR (clause
);
1026 const SCM um_exprs
= unmemoize_exprs (exprs
, env
);
1027 const SCM um_labels
= (scm_is_eq (labels
, SCM_IM_ELSE
))
1029 : scm_i_finite_list_copy (labels
);
1030 const SCM um_clause
= scm_cons (um_labels
, um_exprs
);
1032 um_clauses
= scm_cons (um_clause
, um_clauses
);
1034 um_clauses
= scm_reverse_x (um_clauses
, SCM_UNDEFINED
);
1036 return scm_cons2 (scm_sym_case
, um_key_expr
, um_clauses
);
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
, "=>");
1045 scm_m_cond (SCM expr
, SCM env
)
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
);
1051 const SCM clauses
= SCM_CDR (expr
);
1054 ASSERT_SYNTAX (scm_ilength (clauses
) >= 0, s_bad_expression
, expr
);
1055 ASSERT_SYNTAX (scm_ilength (clauses
) >= 1, s_missing_clauses
, expr
);
1057 for (clause_idx
= clauses
;
1058 !scm_is_null (clause_idx
);
1059 clause_idx
= SCM_CDR (clause_idx
))
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
);
1067 test
= SCM_CAR (clause
);
1068 if (scm_is_eq (test
, scm_sym_else
) && else_literal_p
)
1070 const int last_clause_p
= scm_is_null (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
);
1077 else if (length
>= 2
1078 && scm_is_eq (SCM_CADR (clause
), scm_sym_arrow
)
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
);
1087 SCM_SETCAR (expr
, SCM_IM_COND
);
1092 unmemoize_cond (const SCM expr
, const SCM env
)
1094 SCM um_clauses
= SCM_EOL
;
1097 for (clause_idx
= SCM_CDR (expr
);
1098 !scm_is_null (clause_idx
);
1099 clause_idx
= SCM_CDR (clause_idx
))
1101 const SCM clause
= SCM_CAR (clause_idx
);
1102 const SCM sequence
= SCM_CDR (clause
);
1103 const SCM test
= SCM_CAR (clause
);
1108 if (scm_is_eq (test
, SCM_IM_ELSE
))
1109 um_test
= scm_sym_else
;
1111 um_test
= unmemoize_expression (test
, env
);
1113 if (!scm_is_null (sequence
) && scm_is_eq (SCM_CAR (sequence
),
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
);
1122 um_sequence
= unmemoize_exprs (sequence
, env
);
1125 um_clause
= scm_cons (um_test
, um_sequence
);
1126 um_clauses
= scm_cons (um_clause
, um_clauses
);
1128 um_clauses
= scm_reverse_x (um_clauses
, SCM_UNDEFINED
);
1130 return scm_cons (scm_sym_cond
, um_clauses
);
1134 SCM_SYNTAX (s_define
, "define", scm_i_makbimacro
, scm_m_define
);
1135 SCM_GLOBAL_SYMBOL (scm_sym_define
, s_define
);
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.
1148 * (define ((a b . c) . d) <body>) is equivalent to
1149 * (define a (lambda (b . c) (lambda d <body>)))
1151 * (define (((a) b) c . d) <body>) is equivalent to
1152 * (define a (lambda () (lambda (b) (lambda (c . d) <body>))))
1154 /* Dirk:FIXME:: We should provide an implementation for 'define' in the R5RS
1155 * module that does not implement this extension. */
1157 canonicalize_define (const SCM expr
)
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
);
1166 body
= SCM_CDR (cdr_expr
);
1167 variable
= SCM_CAR (cdr_expr
);
1168 while (scm_is_pair (variable
))
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
);
1178 /* Add source properties to each new lambda expression: */
1179 const SCM lambda
= scm_cons_source (variable
, scm_sym_lambda
, tail
);
1181 body
= scm_list_1 (lambda
);
1182 variable
= SCM_CAR (variable
);
1184 ASSERT_SYNTAX_2 (scm_is_symbol (variable
), s_bad_variable
, variable
, expr
);
1185 ASSERT_SYNTAX (scm_ilength (body
) == 1, s_expression
, expr
);
1187 SCM_SETCAR (cdr_expr
, variable
);
1188 SCM_SETCDR (cdr_expr
, body
);
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))) */
1197 scm_m_define (SCM expr
, SCM env
)
1199 ASSERT_SYNTAX (SCM_TOP_LEVEL (env
), s_bad_define
, expr
);
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
);
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
);
1209 if (SCM_REC_PROCNAMES_P
)
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
);
1220 SCM_VARIABLE_SET (location
, value
);
1222 return SCM_UNSPECIFIED
;
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. */
1232 memoize_as_thunk_prototype (const SCM expr
, const SCM env SCM_UNUSED
)
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
);
1238 SCM_SETCDR (expr
, scm_cons (SCM_EOL
, cdr_expr
));
1244 SCM_SYNTAX (s_delay
, "delay", scm_i_makbimacro
, scm_m_delay
);
1245 SCM_GLOBAL_SYMBOL (scm_sym_delay
, s_delay
);
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. */
1252 scm_m_delay (SCM expr
, SCM env
)
1254 const SCM new_expr
= memoize_as_thunk_prototype (expr
, env
);
1255 SCM_SETCAR (new_expr
, SCM_IM_DELAY
);
1260 unmemoize_delay (const SCM expr
, const SCM env
)
1262 const SCM thunk_expr
= SCM_CADDR (expr
);
1263 return scm_list_2 (scm_sym_delay
, unmemoize_expression (thunk_expr
, env
));
1267 SCM_SYNTAX(s_do
, "do", scm_i_makbimacro
, scm_m_do
);
1268 SCM_GLOBAL_SYMBOL(scm_sym_do
, s_do
);
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:
1274 (do ((<var1> <init1> <step1>)
1282 (#@do (<init1> <init2> ... <initn>)
1283 (varn ... var2 var1)
1286 <step1> <step2> ... <stepn>) ;; missing steps replaced by var
1289 scm_m_do (SCM expr
, SCM env SCM_UNUSED
)
1291 SCM variables
= SCM_EOL
;
1292 SCM init_forms
= SCM_EOL
;
1293 SCM step_forms
= SCM_EOL
;
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
);
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_is_null (binding_idx
); binding_idx
= SCM_CDR (binding_idx
))
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
);
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
);
1323 variables
= scm_cons (name
, variables
);
1324 init_forms
= scm_cons (init
, init_forms
);
1325 step_forms
= scm_cons (step
, step_forms
);
1328 init_forms
= scm_reverse_x (init_forms
, SCM_UNDEFINED
);
1329 step_forms
= scm_reverse_x (step_forms
, SCM_UNDEFINED
);
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
);
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
);
1346 unmemoize_do (const SCM expr
, const SCM env
)
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
);
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_is_null (um_names
))
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
);
1370 um_bindings
= scm_cons (scm_cons2 (name
, init
, step
), um_bindings
);
1372 um_names
= SCM_CDR (um_names
);
1373 um_inits
= SCM_CDR (um_inits
);
1374 um_steps
= SCM_CDR (um_steps
);
1376 um_bindings
= scm_reverse_x (um_bindings
, SCM_UNDEFINED
);
1378 return scm_cons (scm_sym_do
,
1379 scm_cons2 (um_bindings
, um_exit_sequence
, um_body
));
1383 SCM_SYNTAX (s_if
, "if", scm_i_makbimacro
, scm_m_if
);
1384 SCM_GLOBAL_SYMBOL (scm_sym_if
, s_if
);
1387 scm_m_if (SCM expr
, SCM env SCM_UNUSED
)
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
);
1397 unmemoize_if (const SCM expr
, const SCM env
)
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
);
1405 if (scm_is_null (cdddr_expr
))
1407 return scm_list_3 (scm_sym_if
, um_condition
, um_then
);
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
);
1417 SCM_SYNTAX (s_lambda
, "lambda", scm_i_makbimacro
, scm_m_lambda
);
1418 SCM_GLOBAL_SYMBOL (scm_sym_lambda
, s_lambda
);
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>) */
1426 c_improper_memq (SCM obj
, SCM list
)
1428 for (; scm_is_pair (list
); list
= SCM_CDR (list
))
1430 if (scm_is_eq (SCM_CAR (list
), obj
))
1433 return scm_is_eq (list
, obj
);
1437 scm_m_lambda (SCM expr
, SCM env SCM_UNUSED
)
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
);
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_is_pair (formals
))
1456 /* Dirk:FIXME:: We should check for a cyclic list of formals, and if
1457 * detected, report a 'Bad formals' error. */
1461 ASSERT_SYNTAX_2 (scm_is_symbol (formals
) || scm_is_null (formals
),
1462 s_bad_formals
, formals
, expr
);
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_is_pair (formals_idx
))
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
;
1477 ASSERT_SYNTAX_2 (scm_is_null (formals_idx
) || scm_is_symbol (formals_idx
),
1478 s_bad_formal
, formals_idx
, expr
);
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
);
1490 SCM_SETCAR (expr
, SCM_IM_LAMBDA
);
1492 SCM_SETCDR (cddr_expr
, new_body
);
1494 SCM_SETCDR (cdr_expr
, new_body
);
1499 unmemoize_lambda (const SCM expr
, const SCM env
)
1501 const SCM formals
= SCM_CADR (expr
);
1502 const SCM body
= SCM_CDDR (expr
);
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
);
1508 return scm_cons2 (scm_sym_lambda
, um_formals
, um_body
);
1512 /* Check if the format of the bindings is ((<symbol> <init-form>) ...). */
1514 check_bindings (const SCM bindings
, const SCM expr
)
1518 ASSERT_SYNTAX_2 (scm_ilength (bindings
) >= 0,
1519 s_bad_bindings
, bindings
, expr
);
1521 binding_idx
= bindings
;
1522 for (; !scm_is_null (binding_idx
); binding_idx
= SCM_CDR (binding_idx
))
1524 SCM name
; /* const */
1526 const SCM binding
= SCM_CAR (binding_idx
);
1527 ASSERT_SYNTAX_2 (scm_ilength (binding
) == 2,
1528 s_bad_binding
, binding
, expr
);
1530 name
= SCM_CAR (binding
);
1531 ASSERT_SYNTAX_2 (scm_is_symbol (name
), s_bad_variable
, name
, expr
);
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
1543 transform_bindings (
1544 const SCM bindings
, const SCM expr
,
1545 SCM
*const rvarptr
, SCM
*const initptr
)
1547 SCM rvariables
= SCM_EOL
;
1548 SCM rinits
= SCM_EOL
;
1549 SCM binding_idx
= bindings
;
1550 for (; !scm_is_null (binding_idx
); binding_idx
= SCM_CDR (binding_idx
))
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
);
1560 *rvarptr
= rvariables
;
1561 *initptr
= scm_reverse_x (rinits
, SCM_UNDEFINED
);
1565 SCM_SYNTAX(s_let
, "let", scm_i_makbimacro
, scm_m_let
);
1566 SCM_GLOBAL_SYMBOL(scm_sym_let
, s_let
);
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. */
1574 memoize_named_let (const SCM expr
, const SCM env SCM_UNUSED
)
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
);
1586 transform_bindings (bindings
, expr
, &rvariables
, &inits
);
1587 variables
= scm_reverse_x (rvariables
, SCM_UNDEFINED
);
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
);
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
);
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). */
1607 scm_m_let (SCM expr
, SCM env
)
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
);
1616 bindings
= SCM_CAR (cdr_expr
);
1617 if (scm_is_symbol (bindings
))
1619 ASSERT_SYNTAX (length
>= 3, s_missing_expression
, expr
);
1620 return memoize_named_let (expr
, env
);
1623 check_bindings (bindings
, expr
);
1624 if (scm_is_null (bindings
) || scm_is_null (SCM_CDR (bindings
)))
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
);
1635 transform_bindings (bindings
, expr
, &rvariables
, &inits
);
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
);
1648 build_binding_list (SCM rnames
, SCM rinits
)
1650 SCM bindings
= SCM_EOL
;
1651 while (!scm_is_null (rnames
))
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
);
1662 unmemoize_let (const SCM expr
, const SCM env
)
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
);
1673 return scm_cons2 (scm_sym_let
, um_bindings
, um_body
);
1677 SCM_SYNTAX(s_letrec
, "letrec", scm_i_makbimacro
, scm_m_letrec
);
1678 SCM_GLOBAL_SYMBOL(scm_sym_letrec
, s_letrec
);
1681 scm_m_letrec (SCM expr
, SCM env
)
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
);
1689 bindings
= SCM_CAR (cdr_expr
);
1690 if (scm_is_null (bindings
))
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
);
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
));
1710 unmemoize_letrec (const SCM expr
, const SCM env
)
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
);
1721 return scm_cons2 (scm_sym_letrec
, um_bindings
, um_body
);
1726 SCM_SYNTAX (s_letstar
, "let*", scm_i_makbimacro
, scm_m_letstar
);
1727 SCM_GLOBAL_SYMBOL (scm_sym_letstar
, s_letstar
);
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). */
1732 scm_m_letstar (SCM expr
, SCM env SCM_UNUSED
)
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
);
1741 binding_idx
= SCM_CAR (cdr_expr
);
1742 check_bindings (binding_idx
, expr
);
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_is_null (binding_idx
))
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
);
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 */
1764 binding_idx
= cdr_binding_idx
; /* continue with P3 */
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
);
1775 unmemoize_letstar (const SCM expr
, const SCM env
)
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
;
1784 while (!scm_is_null (bindings
))
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
);
1793 um_bindings
= scm_reverse_x (um_bindings
, SCM_UNDEFINED
);
1795 um_body
= unmemoize_exprs (body
, extended_env
);
1797 return scm_cons2 (scm_sym_letstar
, um_bindings
, um_body
);
1801 SCM_SYNTAX (s_or
, "or", scm_i_makbimacro
, scm_m_or
);
1802 SCM_GLOBAL_SYMBOL (scm_sym_or
, s_or
);
1805 scm_m_or (SCM expr
, SCM env SCM_UNUSED
)
1807 const SCM cdr_expr
= SCM_CDR (expr
);
1808 const long length
= scm_ilength (cdr_expr
);
1810 ASSERT_SYNTAX (length
>= 0, s_bad_expression
, expr
);
1814 /* Special case: (or) is replaced by #f. */
1819 SCM_SETCAR (expr
, SCM_IM_OR
);
1825 unmemoize_or (const SCM expr
, const SCM env
)
1827 return scm_cons (scm_sym_or
, unmemoize_exprs (SCM_CDR (expr
), env
));
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");
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. */
1841 iqq (SCM form
, SCM env
, unsigned long int depth
)
1843 if (scm_is_pair (form
))
1845 const SCM tmp
= SCM_CAR (form
);
1846 if (scm_is_eq (tmp
, scm_sym_quasiquote
))
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));
1852 else if (scm_is_eq (tmp
, scm_sym_unquote
))
1854 const SCM args
= SCM_CDR (form
);
1855 ASSERT_SYNTAX (scm_ilength (args
) == 1, s_expression
, form
);
1857 return scm_eval_car (args
, env
);
1859 return scm_list_2 (tmp
, iqq (SCM_CAR (args
), env
, depth
- 1));
1861 else if (scm_is_pair (tmp
)
1862 && scm_is_eq (SCM_CAR (tmp
), scm_sym_uq_splicing
))
1864 const SCM args
= SCM_CDR (tmp
);
1865 ASSERT_SYNTAX (scm_ilength (args
) == 1, s_expression
, form
);
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
)));
1875 return scm_cons (iqq (SCM_CAR (form
), env
, depth
- 1),
1876 iqq (SCM_CDR (form
), env
, depth
));
1879 return scm_cons (iqq (SCM_CAR (form
), env
, depth
),
1880 iqq (SCM_CDR (form
), env
, depth
));
1882 else if (scm_is_vector (form
))
1883 return scm_vector (iqq (scm_vector_to_list (form
), env
, depth
));
1889 scm_m_quasiquote (SCM expr
, SCM env
)
1891 const SCM cdr_expr
= SCM_CDR (expr
);
1892 ASSERT_SYNTAX (scm_ilength (cdr_expr
) >= 0, s_bad_expression
, expr
);
1893 ASSERT_SYNTAX (scm_ilength (cdr_expr
) == 1, s_expression
, expr
);
1894 return iqq (SCM_CAR (cdr_expr
), env
, 1);
1898 SCM_SYNTAX (s_quote
, "quote", scm_i_makbimacro
, scm_m_quote
);
1899 SCM_GLOBAL_SYMBOL (scm_sym_quote
, s_quote
);
1902 scm_m_quote (SCM expr
, SCM env SCM_UNUSED
)
1906 const SCM cdr_expr
= SCM_CDR (expr
);
1907 ASSERT_SYNTAX (scm_ilength (cdr_expr
) >= 0, s_bad_expression
, expr
);
1908 ASSERT_SYNTAX (scm_ilength (cdr_expr
) == 1, s_expression
, expr
);
1909 quotee
= SCM_CAR (cdr_expr
);
1910 if (is_self_quoting_p (quotee
))
1913 SCM_SETCAR (expr
, SCM_IM_QUOTE
);
1914 SCM_SETCDR (expr
, quotee
);
1919 unmemoize_quote (const SCM expr
, const SCM env SCM_UNUSED
)
1921 return scm_list_2 (scm_sym_quote
, SCM_CDR (expr
));
1925 /* Will go into the RnRS module when Guile is factorized.
1926 SCM_SYNTAX (s_set_x, "set!", scm_i_makbimacro, scm_m_set_x); */
1927 static const char s_set_x
[] = "set!";
1928 SCM_GLOBAL_SYMBOL (scm_sym_set_x
, s_set_x
);
1931 scm_m_set_x (SCM expr
, SCM env SCM_UNUSED
)
1936 const SCM cdr_expr
= SCM_CDR (expr
);
1937 ASSERT_SYNTAX (scm_ilength (cdr_expr
) >= 0, s_bad_expression
, expr
);
1938 ASSERT_SYNTAX (scm_ilength (cdr_expr
) == 2, s_expression
, expr
);
1939 variable
= SCM_CAR (cdr_expr
);
1941 /* Memoize the variable form. */
1942 ASSERT_SYNTAX_2 (scm_is_symbol (variable
), s_bad_variable
, variable
, expr
);
1943 new_variable
= lookup_symbol (variable
, env
);
1944 /* Leave the memoization of unbound symbols to lazy memoization: */
1945 if (SCM_UNBNDP (new_variable
))
1946 new_variable
= variable
;
1948 SCM_SETCAR (expr
, SCM_IM_SET_X
);
1949 SCM_SETCAR (cdr_expr
, new_variable
);
1954 unmemoize_set_x (const SCM expr
, const SCM env
)
1956 return scm_cons (scm_sym_set_x
, unmemoize_exprs (SCM_CDR (expr
), env
));
1960 /* Start of the memoizers for non-R5RS builtin macros. */
1963 SCM_SYNTAX (s_atapply
, "@apply", scm_i_makbimacro
, scm_m_apply
);
1964 SCM_GLOBAL_SYMBOL (scm_sym_atapply
, s_atapply
);
1965 SCM_GLOBAL_SYMBOL (scm_sym_apply
, s_atapply
+ 1);
1968 scm_m_apply (SCM expr
, SCM env SCM_UNUSED
)
1970 const SCM cdr_expr
= SCM_CDR (expr
);
1971 ASSERT_SYNTAX (scm_ilength (cdr_expr
) >= 0, s_bad_expression
, expr
);
1972 ASSERT_SYNTAX (scm_ilength (cdr_expr
) == 2, s_missing_expression
, expr
);
1974 SCM_SETCAR (expr
, SCM_IM_APPLY
);
1979 unmemoize_apply (const SCM expr
, const SCM env
)
1981 return scm_list_2 (scm_sym_atapply
, unmemoize_exprs (SCM_CDR (expr
), env
));
1985 SCM_SYNTAX (s_atbind
, "@bind", scm_i_makbimacro
, scm_m_atbind
);
1987 /* FIXME: The following explanation should go into the documentation: */
1988 /* (@bind ((var init) ...) body ...) will assign the values of the `init's to
1989 * the global variables named by `var's (symbols, not evaluated), creating
1990 * them if they don't exist, executes body, and then restores the previous
1991 * values of the `var's. Additionally, whenever control leaves body, the
1992 * values of the `var's are saved and restored when control returns. It is an
1993 * error when a symbol appears more than once among the `var's. All `init's
1994 * are evaluated before any `var' is set.
1996 * Think of this as `let' for dynamic scope.
1999 /* (@bind ((var1 exp1) ... (varn expn)) body ...) is memoized into
2000 * (#@bind ((varn ... var1) . (exp1 ... expn)) body ...).
2002 * FIXME - also implement `@bind*'.
2005 scm_m_atbind (SCM expr
, SCM env
)
2012 const SCM top_level
= scm_env_top_level (env
);
2014 const SCM cdr_expr
= SCM_CDR (expr
);
2015 ASSERT_SYNTAX (scm_ilength (cdr_expr
) >= 0, s_bad_expression
, expr
);
2016 ASSERT_SYNTAX (scm_ilength (cdr_expr
) >= 2, s_missing_expression
, expr
);
2017 bindings
= SCM_CAR (cdr_expr
);
2018 check_bindings (bindings
, expr
);
2019 transform_bindings (bindings
, expr
, &rvariables
, &inits
);
2021 for (variable_idx
= rvariables
;
2022 !scm_is_null (variable_idx
);
2023 variable_idx
= SCM_CDR (variable_idx
))
2025 /* The first call to scm_sym2var will look beyond the current module,
2026 * while the second call wont. */
2027 const SCM variable
= SCM_CAR (variable_idx
);
2028 SCM new_variable
= scm_sym2var (variable
, top_level
, SCM_BOOL_F
);
2029 if (scm_is_false (new_variable
))
2030 new_variable
= scm_sym2var (variable
, top_level
, SCM_BOOL_T
);
2031 SCM_SETCAR (variable_idx
, new_variable
);
2034 SCM_SETCAR (expr
, SCM_IM_BIND
);
2035 SCM_SETCAR (cdr_expr
, scm_cons (rvariables
, inits
));
2040 SCM_SYNTAX(s_atcall_cc
, "@call-with-current-continuation", scm_i_makbimacro
, scm_m_cont
);
2041 SCM_GLOBAL_SYMBOL(scm_sym_atcall_cc
, s_atcall_cc
);
2044 scm_m_cont (SCM expr
, SCM env SCM_UNUSED
)
2046 const SCM cdr_expr
= SCM_CDR (expr
);
2047 ASSERT_SYNTAX (scm_ilength (cdr_expr
) >= 0, s_bad_expression
, expr
);
2048 ASSERT_SYNTAX (scm_ilength (cdr_expr
) == 1, s_expression
, expr
);
2050 SCM_SETCAR (expr
, SCM_IM_CONT
);
2055 unmemoize_atcall_cc (const SCM expr
, const SCM env
)
2057 return scm_list_2 (scm_sym_atcall_cc
, unmemoize_exprs (SCM_CDR (expr
), env
));
2061 SCM_SYNTAX (s_at_call_with_values
, "@call-with-values", scm_i_makbimacro
, scm_m_at_call_with_values
);
2062 SCM_GLOBAL_SYMBOL(scm_sym_at_call_with_values
, s_at_call_with_values
);
2065 scm_m_at_call_with_values (SCM expr
, SCM env SCM_UNUSED
)
2067 const SCM cdr_expr
= SCM_CDR (expr
);
2068 ASSERT_SYNTAX (scm_ilength (cdr_expr
) >= 0, s_bad_expression
, expr
);
2069 ASSERT_SYNTAX (scm_ilength (cdr_expr
) == 2, s_expression
, expr
);
2071 SCM_SETCAR (expr
, SCM_IM_CALL_WITH_VALUES
);
2076 unmemoize_at_call_with_values (const SCM expr
, const SCM env
)
2078 return scm_list_2 (scm_sym_at_call_with_values
,
2079 unmemoize_exprs (SCM_CDR (expr
), env
));
2083 SCM_SYNTAX (s_future
, "future", scm_i_makbimacro
, scm_m_future
);
2084 SCM_GLOBAL_SYMBOL (scm_sym_future
, s_future
);
2086 /* Like promises, futures are implemented as closures with an empty
2087 * parameter list. Thus, (future <expression>) is transformed into
2088 * (#@future '() <expression>), where the empty list represents the
2089 * empty parameter list. This representation allows for easy creation
2090 * of the closure during evaluation. */
2092 scm_m_future (SCM expr
, SCM env
)
2094 const SCM new_expr
= memoize_as_thunk_prototype (expr
, env
);
2095 SCM_SETCAR (new_expr
, SCM_IM_FUTURE
);
2100 unmemoize_future (const SCM expr
, const SCM env
)
2102 const SCM thunk_expr
= SCM_CADDR (expr
);
2103 return scm_list_2 (scm_sym_future
, unmemoize_expression (thunk_expr
, env
));
2107 SCM_SYNTAX (s_gset_x
, "set!", scm_i_makbimacro
, scm_m_generalized_set_x
);
2108 SCM_SYMBOL (scm_sym_setter
, "setter");
2111 scm_m_generalized_set_x (SCM expr
, SCM env
)
2113 SCM target
, exp_target
;
2115 const SCM cdr_expr
= SCM_CDR (expr
);
2116 ASSERT_SYNTAX (scm_ilength (cdr_expr
) >= 0, s_bad_expression
, expr
);
2117 ASSERT_SYNTAX (scm_ilength (cdr_expr
) == 2, s_expression
, expr
);
2119 target
= SCM_CAR (cdr_expr
);
2120 if (!scm_is_pair (target
))
2123 return scm_m_set_x (expr
, env
);
2127 /* (set! (foo bar ...) baz) becomes ((setter foo) bar ... baz) */
2128 /* Macroexpanding the target might return things of the form
2129 (begin <atom>). In that case, <atom> must be a symbol or a
2130 variable and we memoize to (set! <atom> ...).
2132 exp_target
= macroexp (target
, env
);
2133 if (scm_is_eq (SCM_CAR (exp_target
), SCM_IM_BEGIN
)
2134 && !scm_is_null (SCM_CDR (exp_target
))
2135 && scm_is_null (SCM_CDDR (exp_target
)))
2137 exp_target
= SCM_CADR (exp_target
);
2138 ASSERT_SYNTAX_2 (scm_is_symbol (exp_target
)
2139 || SCM_VARIABLEP (exp_target
),
2140 s_bad_variable
, exp_target
, expr
);
2141 return scm_cons (SCM_IM_SET_X
, scm_cons (exp_target
,
2142 SCM_CDR (cdr_expr
)));
2146 const SCM setter_proc_tail
= scm_list_1 (SCM_CAR (target
));
2147 const SCM setter_proc
= scm_cons_source (expr
, scm_sym_setter
,
2150 const SCM cddr_expr
= SCM_CDR (cdr_expr
);
2151 const SCM setter_args
= scm_append_x (scm_list_2 (SCM_CDR (target
),
2154 SCM_SETCAR (expr
, setter_proc
);
2155 SCM_SETCDR (expr
, setter_args
);
2162 /* @slot-ref is bound privately in the (oop goops) module from goops.c. As
2163 * soon as the module system allows us to more freely create bindings in
2164 * arbitrary modules during the startup phase, the code from goops.c should be
2167 SCM_SYMBOL (sym_atslot_ref
, "@slot-ref");
2170 scm_m_atslot_ref (SCM expr
, SCM env SCM_UNUSED
)
2174 const SCM cdr_expr
= SCM_CDR (expr
);
2175 ASSERT_SYNTAX (scm_ilength (cdr_expr
) >= 0, s_bad_expression
, expr
);
2176 ASSERT_SYNTAX (scm_ilength (cdr_expr
) == 2, s_expression
, expr
);
2177 slot_nr
= SCM_CADR (cdr_expr
);
2178 ASSERT_SYNTAX_2 (SCM_I_INUMP (slot_nr
), s_bad_slot_number
, slot_nr
, expr
);
2180 SCM_SETCAR (expr
, SCM_IM_SLOT_REF
);
2181 SCM_SETCDR (cdr_expr
, slot_nr
);
2186 unmemoize_atslot_ref (const SCM expr
, const SCM env
)
2188 const SCM instance
= SCM_CADR (expr
);
2189 const SCM um_instance
= unmemoize_expression (instance
, env
);
2190 const SCM slot_nr
= SCM_CDDR (expr
);
2191 return scm_list_3 (sym_atslot_ref
, um_instance
, slot_nr
);
2195 /* @slot-set! is bound privately in the (oop goops) module from goops.c. As
2196 * soon as the module system allows us to more freely create bindings in
2197 * arbitrary modules during the startup phase, the code from goops.c should be
2200 SCM_SYMBOL (sym_atslot_set_x
, "@slot-set!");
2203 scm_m_atslot_set_x (SCM expr
, SCM env SCM_UNUSED
)
2207 const SCM cdr_expr
= SCM_CDR (expr
);
2208 ASSERT_SYNTAX (scm_ilength (cdr_expr
) >= 0, s_bad_expression
, expr
);
2209 ASSERT_SYNTAX (scm_ilength (cdr_expr
) == 3, s_expression
, expr
);
2210 slot_nr
= SCM_CADR (cdr_expr
);
2211 ASSERT_SYNTAX_2 (SCM_I_INUMP (slot_nr
), s_bad_slot_number
, slot_nr
, expr
);
2213 SCM_SETCAR (expr
, SCM_IM_SLOT_SET_X
);
2218 unmemoize_atslot_set_x (const SCM expr
, const SCM env
)
2220 const SCM cdr_expr
= SCM_CDR (expr
);
2221 const SCM instance
= SCM_CAR (cdr_expr
);
2222 const SCM um_instance
= unmemoize_expression (instance
, env
);
2223 const SCM cddr_expr
= SCM_CDR (cdr_expr
);
2224 const SCM slot_nr
= SCM_CAR (cddr_expr
);
2225 const SCM cdddr_expr
= SCM_CDR (cddr_expr
);
2226 const SCM value
= SCM_CAR (cdddr_expr
);
2227 const SCM um_value
= unmemoize_expression (value
, env
);
2228 return scm_list_4 (sym_atslot_set_x
, um_instance
, slot_nr
, um_value
);
2232 #if SCM_ENABLE_ELISP
2234 static const char s_defun
[] = "Symbol's function definition is void";
2236 SCM_SYNTAX (s_nil_cond
, "nil-cond", scm_i_makbimacro
, scm_m_nil_cond
);
2238 /* nil-cond expressions have the form
2239 * (nil-cond COND VAL COND VAL ... ELSEVAL) */
2241 scm_m_nil_cond (SCM expr
, SCM env SCM_UNUSED
)
2243 const long length
= scm_ilength (SCM_CDR (expr
));
2244 ASSERT_SYNTAX (length
>= 0, s_bad_expression
, expr
);
2245 ASSERT_SYNTAX (length
>= 1 && (length
% 2) == 1, s_expression
, expr
);
2247 SCM_SETCAR (expr
, SCM_IM_NIL_COND
);
2252 SCM_SYNTAX (s_atfop
, "@fop", scm_i_makbimacro
, scm_m_atfop
);
2254 /* The @fop-macro handles procedure and macro applications for elisp. The
2255 * input expression must have the form
2256 * (@fop <var> (transformer-macro <expr> ...))
2257 * where <var> must be a symbol. The expression is transformed into the
2258 * memoized form of either
2259 * (apply <un-aliased var> (transformer-macro <expr> ...))
2260 * if the value of var (across all aliasing) is not a macro, or
2261 * (<un-aliased var> <expr> ...)
2262 * if var is a macro. */
2264 scm_m_atfop (SCM expr
, SCM env SCM_UNUSED
)
2269 const SCM cdr_expr
= SCM_CDR (expr
);
2270 ASSERT_SYNTAX (scm_ilength (cdr_expr
) >= 0, s_bad_expression
, expr
);
2271 ASSERT_SYNTAX (scm_ilength (cdr_expr
) >= 1, s_missing_expression
, expr
);
2273 symbol
= SCM_CAR (cdr_expr
);
2274 ASSERT_SYNTAX_2 (scm_is_symbol (symbol
), s_bad_variable
, symbol
, expr
);
2276 location
= scm_symbol_fref (symbol
);
2277 ASSERT_SYNTAX_2 (SCM_VARIABLEP (location
), s_defun
, symbol
, expr
);
2279 /* The elisp function `defalias' allows to define aliases for symbols. To
2280 * look up such definitions, the chain of symbol definitions has to be
2281 * followed up to the terminal symbol. */
2282 while (scm_is_symbol (SCM_VARIABLE_REF (location
)))
2284 const SCM alias
= SCM_VARIABLE_REF (location
);
2285 location
= scm_symbol_fref (alias
);
2286 ASSERT_SYNTAX_2 (SCM_VARIABLEP (location
), s_defun
, symbol
, expr
);
2289 /* Memoize the value location belonging to the terminal symbol. */
2290 SCM_SETCAR (cdr_expr
, location
);
2292 if (!SCM_MACROP (SCM_VARIABLE_REF (location
)))
2294 /* Since the location does not contain a macro, the form is a procedure
2295 * application. Replace `@fop' by `@apply' and transform the expression
2296 * including the `transformer-macro'. */
2297 SCM_SETCAR (expr
, SCM_IM_APPLY
);
2302 /* Since the location contains a macro, the arguments should not be
2303 * transformed, so the `transformer-macro' is cut out. The resulting
2304 * expression starts with the memoized variable, that is at the cdr of
2305 * the input expression. */
2306 SCM_SETCDR (cdr_expr
, SCM_CDADR (cdr_expr
));
2311 #endif /* SCM_ENABLE_ELISP */
2315 unmemoize_builtin_macro (const SCM expr
, const SCM env
)
2317 switch (ISYMNUM (SCM_CAR (expr
)))
2319 case (ISYMNUM (SCM_IM_AND
)):
2320 return unmemoize_and (expr
, env
);
2322 case (ISYMNUM (SCM_IM_BEGIN
)):
2323 return unmemoize_begin (expr
, env
);
2325 case (ISYMNUM (SCM_IM_CASE
)):
2326 return unmemoize_case (expr
, env
);
2328 case (ISYMNUM (SCM_IM_COND
)):
2329 return unmemoize_cond (expr
, env
);
2331 case (ISYMNUM (SCM_IM_DELAY
)):
2332 return unmemoize_delay (expr
, env
);
2334 case (ISYMNUM (SCM_IM_DO
)):
2335 return unmemoize_do (expr
, env
);
2337 case (ISYMNUM (SCM_IM_IF
)):
2338 return unmemoize_if (expr
, env
);
2340 case (ISYMNUM (SCM_IM_LAMBDA
)):
2341 return unmemoize_lambda (expr
, env
);
2343 case (ISYMNUM (SCM_IM_LET
)):
2344 return unmemoize_let (expr
, env
);
2346 case (ISYMNUM (SCM_IM_LETREC
)):
2347 return unmemoize_letrec (expr
, env
);
2349 case (ISYMNUM (SCM_IM_LETSTAR
)):
2350 return unmemoize_letstar (expr
, env
);
2352 case (ISYMNUM (SCM_IM_OR
)):
2353 return unmemoize_or (expr
, env
);
2355 case (ISYMNUM (SCM_IM_QUOTE
)):
2356 return unmemoize_quote (expr
, env
);
2358 case (ISYMNUM (SCM_IM_SET_X
)):
2359 return unmemoize_set_x (expr
, env
);
2361 case (ISYMNUM (SCM_IM_APPLY
)):
2362 return unmemoize_apply (expr
, env
);
2364 case (ISYMNUM (SCM_IM_BIND
)):
2365 return unmemoize_exprs (expr
, env
); /* FIXME */
2367 case (ISYMNUM (SCM_IM_CONT
)):
2368 return unmemoize_atcall_cc (expr
, env
);
2370 case (ISYMNUM (SCM_IM_CALL_WITH_VALUES
)):
2371 return unmemoize_at_call_with_values (expr
, env
);
2373 case (ISYMNUM (SCM_IM_FUTURE
)):
2374 return unmemoize_future (expr
, env
);
2376 case (ISYMNUM (SCM_IM_SLOT_REF
)):
2377 return unmemoize_atslot_ref (expr
, env
);
2379 case (ISYMNUM (SCM_IM_SLOT_SET_X
)):
2380 return unmemoize_atslot_set_x (expr
, env
);
2382 case (ISYMNUM (SCM_IM_NIL_COND
)):
2383 return unmemoize_exprs (expr
, env
); /* FIXME */
2386 return unmemoize_exprs (expr
, env
); /* FIXME */
2391 /* scm_i_unmemocopy_expr and scm_i_unmemocopy_body take a memoized expression
2392 * respectively a memoized body together with its environment and rewrite it
2393 * to its original form. Thus, these functions are the inversion of the
2394 * rewrite rules above. The procedure is not optimized for speed. It's used
2395 * in scm_i_unmemoize_expr, scm_procedure_source, macro_print and scm_iprin1.
2397 * Unmemoizing is not a reliable process. You cannot in general expect to get
2398 * the original source back.
2400 * However, GOOPS currently relies on this for method compilation. This ought
2404 scm_i_unmemocopy_expr (SCM expr
, SCM env
)
2406 const SCM source_properties
= scm_whash_lookup (scm_source_whash
, expr
);
2407 const SCM um_expr
= unmemoize_expression (expr
, env
);
2409 if (scm_is_true (source_properties
))
2410 scm_whash_insert (scm_source_whash
, um_expr
, source_properties
);
2416 scm_i_unmemocopy_body (SCM forms
, SCM env
)
2418 const SCM source_properties
= scm_whash_lookup (scm_source_whash
, forms
);
2419 const SCM um_forms
= unmemoize_exprs (forms
, env
);
2421 if (scm_is_true (source_properties
))
2422 scm_whash_insert (scm_source_whash
, um_forms
, source_properties
);
2428 #if (SCM_ENABLE_DEPRECATED == 1)
2430 /* Deprecated in guile 1.7.0 on 2003-11-09. */
2432 scm_m_expand_body (SCM exprs
, SCM env
)
2434 scm_c_issue_deprecation_warning
2435 ("`scm_m_expand_body' is deprecated.");
2436 m_expand_body (exprs
, env
);
2441 SCM_SYNTAX (s_undefine
, "undefine", scm_makacro
, scm_m_undefine
);
2444 scm_m_undefine (SCM expr
, SCM env
)
2449 const SCM cdr_expr
= SCM_CDR (expr
);
2450 ASSERT_SYNTAX (SCM_TOP_LEVEL (env
), "Bad undefine placement in", expr
);
2451 ASSERT_SYNTAX (scm_ilength (cdr_expr
) >= 0, s_bad_expression
, expr
);
2452 ASSERT_SYNTAX (scm_ilength (cdr_expr
) == 1, s_expression
, expr
);
2454 scm_c_issue_deprecation_warning
2455 ("`undefine' is deprecated.\n");
2457 variable
= SCM_CAR (cdr_expr
);
2458 ASSERT_SYNTAX_2 (scm_is_symbol (variable
), s_bad_variable
, variable
, expr
);
2459 location
= scm_sym2var (variable
, scm_env_top_level (env
), SCM_BOOL_F
);
2460 ASSERT_SYNTAX_2 (scm_is_true (location
)
2461 && !SCM_UNBNDP (SCM_VARIABLE_REF (location
)),
2462 "variable already unbound ", variable
, expr
);
2463 SCM_VARIABLE_SET (location
, SCM_UNDEFINED
);
2464 return SCM_UNSPECIFIED
;
2468 scm_macroexp (SCM x
, SCM env
)
2470 scm_c_issue_deprecation_warning
2471 ("`scm_macroexp' is deprecated.");
2472 return macroexp (x
, env
);
2478 #if (SCM_ENABLE_DEPRECATED == 1)
2481 scm_unmemocar (SCM form
, SCM env
)
2483 scm_c_issue_deprecation_warning
2484 ("`scm_unmemocar' is deprecated.");
2486 if (!scm_is_pair (form
))
2490 SCM c
= SCM_CAR (form
);
2491 if (SCM_VARIABLEP (c
))
2493 SCM sym
= scm_module_reverse_lookup (scm_env_module (env
), c
);
2494 if (scm_is_false (sym
))
2495 sym
= sym_three_question_marks
;
2496 SCM_SETCAR (form
, sym
);
2498 else if (SCM_ILOCP (c
))
2500 unsigned long int ir
;
2502 for (ir
= SCM_IFRAME (c
); ir
!= 0; --ir
)
2503 env
= SCM_CDR (env
);
2504 env
= SCM_CAAR (env
);
2505 for (ir
= SCM_IDIST (c
); ir
!= 0; --ir
)
2506 env
= SCM_CDR (env
);
2508 SCM_SETCAR (form
, SCM_ICDRP (c
) ? env
: SCM_CAR (env
));
2516 /*****************************************************************************/
2517 /*****************************************************************************/
2518 /* The definitions for execution start here. */
2519 /*****************************************************************************/
2520 /*****************************************************************************/
2522 SCM_GLOBAL_SYMBOL (scm_sym_enter_frame
, "enter-frame");
2523 SCM_GLOBAL_SYMBOL (scm_sym_apply_frame
, "apply-frame");
2524 SCM_GLOBAL_SYMBOL (scm_sym_exit_frame
, "exit-frame");
2525 SCM_GLOBAL_SYMBOL (scm_sym_trace
, "trace");
2527 /* A function object to implement "apply" for non-closure functions. */
2529 /* An endless list consisting of #<undefined> objects: */
2530 static SCM undefineds
;
2534 scm_badargsp (SCM formals
, SCM args
)
2536 while (!scm_is_null (formals
))
2538 if (!scm_is_pair (formals
))
2540 if (scm_is_null (args
))
2542 formals
= SCM_CDR (formals
);
2543 args
= SCM_CDR (args
);
2545 return !scm_is_null (args
) ? 1 : 0;
2550 /* The evaluator contains a plethora of EVAL symbols. This is an attempt at
2553 * The following macros should be used in code which is read twice (where the
2554 * choice of evaluator is hard soldered):
2556 * CEVAL is the symbol used within one evaluator to call itself.
2557 * Originally, it is defined to ceval, but is redefined to deval during the
2560 * SCM_I_EVALIM is used when it is known that the expression is an
2561 * immediate. (This macro never calls an evaluator.)
2563 * EVAL evaluates an expression that is expected to have its symbols already
2564 * memoized. Expressions that are not of the form '(<form> <form> ...)' are
2565 * evaluated inline without calling an evaluator.
2567 * EVALCAR evaluates the car of an expression 'X:(Y:<form> <form> ...)',
2568 * potentially replacing a symbol at the position Y:<form> by its memoized
2569 * variable. If Y:<form> is not of the form '(<form> <form> ...)', the
2570 * evaluation is performed inline without calling an evaluator.
2572 * The following macros should be used in code which is read once
2573 * (where the choice of evaluator is dynamic):
2575 * SCM_I_XEVAL corresponds to EVAL, but uses ceval *or* deval depending on the
2578 * SCM_I_XEVALCAR corresponds to EVALCAR, but uses ceval *or* deval depending
2579 * on the debugging mode.
2581 * The main motivation for keeping this plethora is efficiency
2582 * together with maintainability (=> locality of code).
2585 static SCM
ceval (SCM x
, SCM env
);
2586 static SCM
deval (SCM x
, SCM env
);
2590 #define SCM_I_EVALIM2(x) \
2591 ((scm_is_eq ((x), SCM_EOL) \
2592 ? syntax_error (s_empty_combination, (x), SCM_UNDEFINED), 0 \
2596 #define SCM_I_EVALIM(x, env) (SCM_ILOCP (x) \
2597 ? *scm_ilookup ((x), (env)) \
2600 #define SCM_I_XEVAL(x, env) \
2602 ? SCM_I_EVALIM2 (x) \
2603 : (SCM_VARIABLEP (x) \
2604 ? SCM_VARIABLE_REF (x) \
2605 : (scm_is_pair (x) \
2606 ? (scm_debug_mode_p \
2607 ? deval ((x), (env)) \
2608 : ceval ((x), (env))) \
2611 #define SCM_I_XEVALCAR(x, env) \
2612 (SCM_IMP (SCM_CAR (x)) \
2613 ? SCM_I_EVALIM (SCM_CAR (x), (env)) \
2614 : (SCM_VARIABLEP (SCM_CAR (x)) \
2615 ? SCM_VARIABLE_REF (SCM_CAR (x)) \
2616 : (scm_is_pair (SCM_CAR (x)) \
2617 ? (scm_debug_mode_p \
2618 ? deval (SCM_CAR (x), (env)) \
2619 : ceval (SCM_CAR (x), (env))) \
2620 : (!scm_is_symbol (SCM_CAR (x)) \
2622 : *scm_lookupcar ((x), (env), 1)))))
2624 #define EVAL(x, env) \
2626 ? SCM_I_EVALIM ((x), (env)) \
2627 : (SCM_VARIABLEP (x) \
2628 ? SCM_VARIABLE_REF (x) \
2629 : (scm_is_pair (x) \
2630 ? CEVAL ((x), (env)) \
2633 #define EVALCAR(x, env) \
2634 (SCM_IMP (SCM_CAR (x)) \
2635 ? SCM_I_EVALIM (SCM_CAR (x), (env)) \
2636 : (SCM_VARIABLEP (SCM_CAR (x)) \
2637 ? SCM_VARIABLE_REF (SCM_CAR (x)) \
2638 : (scm_is_pair (SCM_CAR (x)) \
2639 ? CEVAL (SCM_CAR (x), (env)) \
2640 : (!scm_is_symbol (SCM_CAR (x)) \
2642 : *scm_lookupcar ((x), (env), 1)))))
2644 SCM_REC_MUTEX (source_mutex
);
2647 /* Lookup a given local variable in an environment. The local variable is
2648 * given as an iloc, that is a triple <frame, binding, last?>, where frame
2649 * indicates the relative number of the environment frame (counting upwards
2650 * from the innermost environment frame), binding indicates the number of the
2651 * binding within the frame, and last? (which is extracted from the iloc using
2652 * the macro SCM_ICDRP) indicates whether the binding forms the binding at the
2653 * very end of the improper list of bindings. */
2655 scm_ilookup (SCM iloc
, SCM env
)
2657 unsigned int frame_nr
= SCM_IFRAME (iloc
);
2658 unsigned int binding_nr
= SCM_IDIST (iloc
);
2662 for (; 0 != frame_nr
; --frame_nr
)
2663 frames
= SCM_CDR (frames
);
2665 bindings
= SCM_CAR (frames
);
2666 for (; 0 != binding_nr
; --binding_nr
)
2667 bindings
= SCM_CDR (bindings
);
2669 if (SCM_ICDRP (iloc
))
2670 return SCM_CDRLOC (bindings
);
2671 return SCM_CARLOC (SCM_CDR (bindings
));
2675 SCM_SYMBOL (scm_unbound_variable_key
, "unbound-variable");
2677 static void error_unbound_variable (SCM symbol
) SCM_NORETURN
;
2678 static void error_defined_variable (SCM symbol
) SCM_NORETURN
;
2680 /* Call this for variables that are unfound.
2683 error_unbound_variable (SCM symbol
)
2685 scm_error (scm_unbound_variable_key
, NULL
,
2686 "Unbound variable: ~S",
2687 scm_list_1 (symbol
), SCM_BOOL_F
);
2690 /* Call this for variables that are found but contain SCM_UNDEFINED.
2693 error_defined_variable (SCM symbol
)
2695 /* We use the 'unbound-variable' key here as well, since it
2696 basically is the same kind of error, with a slight variation in
2697 the displayed message.
2699 scm_error (scm_unbound_variable_key
, NULL
,
2700 "Variable used before given a value: ~S",
2701 scm_list_1 (symbol
), SCM_BOOL_F
);
2705 /* The Lookup Car Race
2708 Memoization of variables and special forms is done while executing
2709 the code for the first time. As long as there is only one thread
2710 everything is fine, but as soon as two threads execute the same
2711 code concurrently `for the first time' they can come into conflict.
2713 This memoization includes rewriting variable references into more
2714 efficient forms and expanding macros. Furthermore, macro expansion
2715 includes `compiling' special forms like `let', `cond', etc. into
2716 tree-code instructions.
2718 There shouldn't normally be a problem with memoizing local and
2719 global variable references (into ilocs and variables), because all
2720 threads will mutate the code in *exactly* the same way and (if I
2721 read the C code correctly) it is not possible to observe a half-way
2722 mutated cons cell. The lookup procedure can handle this
2723 transparently without any critical sections.
2725 It is different with macro expansion, because macro expansion
2726 happens outside of the lookup procedure and can't be
2727 undone. Therefore the lookup procedure can't cope with it. It has
2728 to indicate failure when it detects a lost race and hope that the
2729 caller can handle it. Luckily, it turns out that this is the case.
2731 An example to illustrate this: Suppose that the following form will
2732 be memoized concurrently by two threads
2736 Let's first examine the lookup of X in the body. The first thread
2737 decides that it has to find the symbol "x" in the environment and
2738 starts to scan it. Then the other thread takes over and actually
2739 overtakes the first. It looks up "x" and substitutes an
2740 appropriate iloc for it. Now the first thread continues and
2741 completes its lookup. It comes to exactly the same conclusions as
2742 the second one and could - without much ado - just overwrite the
2743 iloc with the same iloc.
2745 But let's see what will happen when the race occurs while looking
2746 up the symbol "let" at the start of the form. It could happen that
2747 the second thread interrupts the lookup of the first thread and not
2748 only substitutes a variable for it but goes right ahead and
2749 replaces it with the compiled form (#@let* (x 12) x). Now, when
2750 the first thread completes its lookup, it would replace the #@let*
2751 with a variable containing the "let" binding, effectively reverting
2752 the form to (let (x 12) x). This is wrong. It has to detect that
2753 it has lost the race and the evaluator has to reconsider the
2754 changed form completely.
2756 This race condition could be resolved with some kind of traffic
2757 light (like mutexes) around scm_lookupcar, but I think that it is
2758 best to avoid them in this case. They would serialize memoization
2759 completely and because lookup involves calling arbitrary Scheme
2760 code (via the lookup-thunk), threads could be blocked for an
2761 arbitrary amount of time or even deadlock. But with the current
2762 solution a lot of unnecessary work is potentially done. */
2764 /* SCM_LOOKUPCAR1 is what SCM_LOOKUPCAR used to be but is allowed to
2765 return NULL to indicate a failed lookup due to some race conditions
2766 between threads. This only happens when VLOC is the first cell of
2767 a special form that will eventually be memoized (like `let', etc.)
2768 In that case the whole lookup is bogus and the caller has to
2769 reconsider the complete special form.
2771 SCM_LOOKUPCAR is still there, of course. It just calls
2772 SCM_LOOKUPCAR1 and aborts on receiving NULL. So SCM_LOOKUPCAR
2773 should only be called when it is known that VLOC is not the first
2774 pair of a special form. Otherwise, use SCM_LOOKUPCAR1 and check
2775 for NULL. I think I've found the only places where this
2779 scm_lookupcar1 (SCM vloc
, SCM genv
, int check
)
2782 register SCM
*al
, fl
, var
= SCM_CAR (vloc
);
2783 register SCM iloc
= SCM_ILOC00
;
2784 for (; SCM_NIMP (env
); env
= SCM_CDR (env
))
2786 if (!scm_is_pair (SCM_CAR (env
)))
2788 al
= SCM_CARLOC (env
);
2789 for (fl
= SCM_CAR (*al
); SCM_NIMP (fl
); fl
= SCM_CDR (fl
))
2791 if (!scm_is_pair (fl
))
2793 if (scm_is_eq (fl
, var
))
2795 if (!scm_is_eq (SCM_CAR (vloc
), var
))
2797 SCM_SET_CELL_WORD_0 (vloc
, SCM_UNPACK (iloc
) + SCM_ICDR
);
2798 return SCM_CDRLOC (*al
);
2803 al
= SCM_CDRLOC (*al
);
2804 if (scm_is_eq (SCM_CAR (fl
), var
))
2806 if (SCM_UNBNDP (SCM_CAR (*al
)))
2807 error_defined_variable (var
);
2808 if (!scm_is_eq (SCM_CAR (vloc
), var
))
2810 SCM_SETCAR (vloc
, iloc
);
2811 return SCM_CARLOC (*al
);
2813 iloc
= SCM_PACK (SCM_UNPACK (iloc
) + SCM_IDINC
);
2815 iloc
= SCM_PACK ((~SCM_IDSTMSK
) & (SCM_UNPACK(iloc
) + SCM_IFRINC
));
2818 SCM top_thunk
, real_var
;
2821 top_thunk
= SCM_CAR (env
); /* env now refers to a
2822 top level env thunk */
2823 env
= SCM_CDR (env
);
2826 top_thunk
= SCM_BOOL_F
;
2827 real_var
= scm_sym2var (var
, top_thunk
, SCM_BOOL_F
);
2828 if (scm_is_false (real_var
))
2831 if (!scm_is_null (env
) || SCM_UNBNDP (SCM_VARIABLE_REF (real_var
)))
2836 if (scm_is_null (env
))
2837 error_unbound_variable (var
);
2839 scm_misc_error (NULL
, "Damaged environment: ~S",
2844 /* A variable could not be found, but we shall
2845 not throw an error. */
2846 static SCM undef_object
= SCM_UNDEFINED
;
2847 return &undef_object
;
2851 if (!scm_is_eq (SCM_CAR (vloc
), var
))
2853 /* Some other thread has changed the very cell we are working
2854 on. In effect, it must have done our job or messed it up
2857 var
= SCM_CAR (vloc
);
2858 if (SCM_VARIABLEP (var
))
2859 return SCM_VARIABLE_LOC (var
);
2860 if (SCM_ILOCP (var
))
2861 return scm_ilookup (var
, genv
);
2862 /* We can't cope with anything else than variables and ilocs. When
2863 a special form has been memoized (i.e. `let' into `#@let') we
2864 return NULL and expect the calling function to do the right
2865 thing. For the evaluator, this means going back and redoing
2866 the dispatch on the car of the form. */
2870 SCM_SETCAR (vloc
, real_var
);
2871 return SCM_VARIABLE_LOC (real_var
);
2876 scm_lookupcar (SCM vloc
, SCM genv
, int check
)
2878 SCM
*loc
= scm_lookupcar1 (vloc
, genv
, check
);
2885 /* During execution, look up a symbol in the top level of the given local
2886 * environment and return the corresponding variable object. If no binding
2887 * for the symbol can be found, an 'Unbound variable' error is signalled. */
2889 lazy_memoize_variable (const SCM symbol
, const SCM environment
)
2891 const SCM top_level
= scm_env_top_level (environment
);
2892 const SCM variable
= scm_sym2var (symbol
, top_level
, SCM_BOOL_F
);
2894 if (scm_is_false (variable
))
2895 error_unbound_variable (symbol
);
2902 scm_eval_car (SCM pair
, SCM env
)
2904 return SCM_I_XEVALCAR (pair
, env
);
2909 scm_eval_args (SCM l
, SCM env
, SCM proc
)
2911 SCM results
= SCM_EOL
, *lloc
= &results
, res
;
2912 while (scm_is_pair (l
))
2914 res
= EVALCAR (l
, env
);
2916 *lloc
= scm_list_1 (res
);
2917 lloc
= SCM_CDRLOC (*lloc
);
2920 if (!scm_is_null (l
))
2921 scm_wrong_num_args (proc
);
2927 scm_eval_body (SCM code
, SCM env
)
2932 next
= SCM_CDR (code
);
2933 while (!scm_is_null (next
))
2935 if (SCM_IMP (SCM_CAR (code
)))
2937 if (SCM_ISYMP (SCM_CAR (code
)))
2939 scm_rec_mutex_lock (&source_mutex
);
2940 /* check for race condition */
2941 if (SCM_ISYMP (SCM_CAR (code
)))
2942 m_expand_body (code
, env
);
2943 scm_rec_mutex_unlock (&source_mutex
);
2948 SCM_I_XEVAL (SCM_CAR (code
), env
);
2950 next
= SCM_CDR (code
);
2952 return SCM_I_XEVALCAR (code
, env
);
2958 /* SECTION: This code is specific for the debugging support. One
2959 * branch is read when DEVAL isn't defined, the other when DEVAL is
2965 #define SCM_APPLY scm_apply
2966 #define PREP_APPLY(proc, args)
2968 #define RETURN(x) do { return x; } while (0)
2969 #ifdef STACK_CHECKING
2970 #ifndef NO_CEVAL_STACK_CHECKING
2971 #define EVAL_STACK_CHECKING
2978 #define CEVAL deval /* Substitute all uses of ceval */
2981 #define SCM_APPLY scm_dapply
2984 #define PREP_APPLY(p, l) \
2985 { ++debug.info; debug.info->a.proc = p; debug.info->a.args = l; }
2988 #define ENTER_APPLY \
2990 SCM_SET_ARGSREADY (debug);\
2991 if (scm_check_apply_p && SCM_TRAPS_P)\
2992 if (SCM_APPLY_FRAME_P || (SCM_TRACE_P && PROCTRACEP (proc)))\
2994 SCM tmp, tail = scm_from_bool(SCM_TRACED_FRAME_P (debug)); \
2995 SCM_SET_TRACED_FRAME (debug); \
2997 if (SCM_CHEAPTRAPS_P)\
2999 tmp = scm_make_debugobj (&debug);\
3000 scm_call_3 (SCM_APPLY_FRAME_HDLR, scm_sym_apply_frame, tmp, tail);\
3005 tmp = scm_make_continuation (&first);\
3007 scm_call_3 (SCM_APPLY_FRAME_HDLR, scm_sym_apply_frame, tmp, tail);\
3014 #define RETURN(e) do { proc = (e); goto exit; } while (0)
3016 #ifdef STACK_CHECKING
3017 #ifndef EVAL_STACK_CHECKING
3018 #define EVAL_STACK_CHECKING
3023 /* scm_last_debug_frame contains a pointer to the last debugging information
3024 * stack frame. It is accessed very often from the debugging evaluator, so it
3025 * should probably not be indirectly addressed. Better to save and restore it
3026 * from the current root at any stack swaps.
3029 /* scm_debug_eframe_size is the number of slots available for pseudo
3030 * stack frames at each real stack frame.
3033 long scm_debug_eframe_size
;
3035 int scm_debug_mode_p
;
3036 int scm_check_entry_p
;
3037 int scm_check_apply_p
;
3038 int scm_check_exit_p
;
3040 long scm_eval_stack
;
3042 scm_t_option scm_eval_opts
[] = {
3043 { SCM_OPTION_INTEGER
, "stack", 22000, "Size of thread stacks (in machine words)." }
3046 scm_t_option scm_debug_opts
[] = {
3047 { SCM_OPTION_BOOLEAN
, "cheap", 1,
3048 "*Flyweight representation of the stack at traps." },
3049 { SCM_OPTION_BOOLEAN
, "breakpoints", 0, "*Check for breakpoints." },
3050 { SCM_OPTION_BOOLEAN
, "trace", 0, "*Trace mode." },
3051 { SCM_OPTION_BOOLEAN
, "procnames", 1,
3052 "Record procedure names at definition." },
3053 { SCM_OPTION_BOOLEAN
, "backwards", 0,
3054 "Display backtrace in anti-chronological order." },
3055 { SCM_OPTION_INTEGER
, "width", 79, "Maximal width of backtrace." },
3056 { SCM_OPTION_INTEGER
, "indent", 10, "Maximal indentation in backtrace." },
3057 { SCM_OPTION_INTEGER
, "frames", 3,
3058 "Maximum number of tail-recursive frames in backtrace." },
3059 { SCM_OPTION_INTEGER
, "maxdepth", 1000,
3060 "Maximal number of stored backtrace frames." },
3061 { SCM_OPTION_INTEGER
, "depth", 20, "Maximal length of printed backtrace." },
3062 { SCM_OPTION_BOOLEAN
, "backtrace", 0, "Show backtrace on error." },
3063 { SCM_OPTION_BOOLEAN
, "debug", 0, "Use the debugging evaluator." },
3064 { SCM_OPTION_INTEGER
, "stack", 20000, "Stack size limit (measured in words; 0 = no check)." },
3065 { 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."}
3068 scm_t_option scm_evaluator_trap_table
[] = {
3069 { SCM_OPTION_BOOLEAN
, "traps", 0, "Enable evaluator traps." },
3070 { SCM_OPTION_BOOLEAN
, "enter-frame", 0, "Trap when eval enters new frame." },
3071 { SCM_OPTION_BOOLEAN
, "apply-frame", 0, "Trap when entering apply." },
3072 { SCM_OPTION_BOOLEAN
, "exit-frame", 0, "Trap when exiting eval or apply." },
3073 { SCM_OPTION_SCM
, "enter-frame-handler", (unsigned long)SCM_BOOL_F
, "Handler for enter-frame traps." },
3074 { SCM_OPTION_SCM
, "apply-frame-handler", (unsigned long)SCM_BOOL_F
, "Handler for apply-frame traps." },
3075 { SCM_OPTION_SCM
, "exit-frame-handler", (unsigned long)SCM_BOOL_F
, "Handler for exit-frame traps." }
3078 SCM_DEFINE (scm_eval_options_interface
, "eval-options-interface", 0, 1, 0,
3080 "Option interface for the evaluation options. Instead of using\n"
3081 "this procedure directly, use the procedures @code{eval-enable},\n"
3082 "@code{eval-disable}, @code{eval-set!} and @code{eval-options}.")
3083 #define FUNC_NAME s_scm_eval_options_interface
3087 ans
= scm_options (setting
,
3091 scm_eval_stack
= SCM_EVAL_STACK
* sizeof (void *);
3098 SCM_DEFINE (scm_evaluator_traps
, "evaluator-traps-interface", 0, 1, 0,
3100 "Option interface for the evaluator trap options.")
3101 #define FUNC_NAME s_scm_evaluator_traps
3105 ans
= scm_options (setting
,
3106 scm_evaluator_trap_table
,
3107 SCM_N_EVALUATOR_TRAPS
,
3109 SCM_RESET_DEBUG_MODE
;
3117 deval_args (SCM l
, SCM env
, SCM proc
, SCM
*lloc
)
3119 SCM
*results
= lloc
;
3120 while (scm_is_pair (l
))
3122 const SCM res
= EVALCAR (l
, env
);
3124 *lloc
= scm_list_1 (res
);
3125 lloc
= SCM_CDRLOC (*lloc
);
3128 if (!scm_is_null (l
))
3129 scm_wrong_num_args (proc
);
3136 /* SECTION: This code is compiled twice.
3140 /* Update the toplevel environment frame ENV so that it refers to the
3141 * current module. */
3142 #define UPDATE_TOPLEVEL_ENV(env) \
3144 SCM p = scm_current_module_lookup_closure (); \
3145 if (p != SCM_CAR (env)) \
3146 env = scm_top_level_env (p); \
3150 #define SCM_VALIDATE_NON_EMPTY_COMBINATION(x) \
3151 ASSERT_SYNTAX (!scm_is_eq ((x), SCM_EOL), s_empty_combination, x)
3154 /* This is the evaluator. Like any real monster, it has three heads:
3156 * ceval is the non-debugging evaluator, deval is the debugging version. Both
3157 * are implemented using a common code base, using the following mechanism:
3158 * CEVAL is a macro, which is either defined to ceval or deval. Thus, there
3159 * is no function CEVAL, but the code for CEVAL actually compiles to either
3160 * ceval or deval. When CEVAL is defined to ceval, it is known that the macro
3161 * DEVAL is not defined. When CEVAL is defined to deval, then the macro DEVAL
3162 * is known to be defined. Thus, in CEVAL parts for the debugging evaluator
3163 * are enclosed within #ifdef DEVAL ... #endif.
3165 * All three (ceval, deval and their common implementation CEVAL) take two
3166 * input parameters, x and env: x is a single expression to be evalutated.
3167 * env is the environment in which bindings are searched.
3169 * x is known to be a pair. Since x is a single expression, it is necessarily
3170 * in a tail position. If x is just a call to another function like in the
3171 * expression (foo exp1 exp2 ...), the realization of that call therefore
3172 * _must_not_ increase stack usage (the evaluation of exp1, exp2 etc.,
3173 * however, may do so). This is realized by making extensive use of 'goto'
3174 * statements within the evaluator: The gotos replace recursive calls to
3175 * CEVAL, thus re-using the same stack frame that CEVAL was already using.
3176 * If, however, x represents some form that requires to evaluate a sequence of
3177 * expressions like (begin exp1 exp2 ...), then recursive calls to CEVAL are
3178 * performed for all but the last expression of that sequence. */
3181 CEVAL (SCM x
, SCM env
)
3185 scm_t_debug_frame debug
;
3186 scm_t_debug_info
*debug_info_end
;
3187 debug
.prev
= scm_last_debug_frame
;
3190 * The debug.vect contains twice as much scm_t_debug_info frames as the
3191 * user has specified with (debug-set! frames <n>).
3193 * Even frames are eval frames, odd frames are apply frames.
3195 debug
.vect
= (scm_t_debug_info
*) alloca (scm_debug_eframe_size
3196 * sizeof (scm_t_debug_info
));
3197 debug
.info
= debug
.vect
;
3198 debug_info_end
= debug
.vect
+ scm_debug_eframe_size
;
3199 scm_last_debug_frame
= &debug
;
3201 #ifdef EVAL_STACK_CHECKING
3202 if (scm_stack_checking_enabled_p
&& SCM_STACK_OVERFLOW_P (&proc
))
3205 debug
.info
->e
.exp
= x
;
3206 debug
.info
->e
.env
= env
;
3208 scm_report_stack_overflow ();
3218 SCM_CLEAR_ARGSREADY (debug
);
3219 if (SCM_OVERFLOWP (debug
))
3222 * In theory, this should be the only place where it is necessary to
3223 * check for space in debug.vect since both eval frames and
3224 * available space are even.
3226 * For this to be the case, however, it is necessary that primitive
3227 * special forms which jump back to `loop', `begin' or some similar
3228 * label call PREP_APPLY.
3230 else if (++debug
.info
>= debug_info_end
)
3232 SCM_SET_OVERFLOW (debug
);
3237 debug
.info
->e
.exp
= x
;
3238 debug
.info
->e
.env
= env
;
3239 if (scm_check_entry_p
&& SCM_TRAPS_P
)
3241 if (SCM_ENTER_FRAME_P
3242 || (SCM_BREAKPOINTS_P
&& scm_c_source_property_breakpoint_p (x
)))
3245 SCM tail
= scm_from_bool (SCM_TAILRECP (debug
));
3246 SCM_SET_TAILREC (debug
);
3247 if (SCM_CHEAPTRAPS_P
)
3248 stackrep
= scm_make_debugobj (&debug
);
3252 SCM val
= scm_make_continuation (&first
);
3262 /* This gives the possibility for the debugger to
3263 modify the source expression before evaluation. */
3268 scm_call_4 (SCM_ENTER_FRAME_HDLR
,
3269 scm_sym_enter_frame
,
3272 unmemoize_expression (x
, env
));
3279 if (SCM_ISYMP (SCM_CAR (x
)))
3281 switch (ISYMNUM (SCM_CAR (x
)))
3283 case (ISYMNUM (SCM_IM_AND
)):
3285 while (!scm_is_null (SCM_CDR (x
)))
3287 SCM test_result
= EVALCAR (x
, env
);
3288 if (scm_is_false (test_result
) || SCM_NILP (test_result
))
3289 RETURN (SCM_BOOL_F
);
3293 PREP_APPLY (SCM_UNDEFINED
, SCM_EOL
);
3296 case (ISYMNUM (SCM_IM_BEGIN
)):
3298 if (scm_is_null (x
))
3299 RETURN (SCM_UNSPECIFIED
);
3301 PREP_APPLY (SCM_UNDEFINED
, SCM_EOL
);
3304 /* If we are on toplevel with a lookup closure, we need to sync
3305 with the current module. */
3306 if (scm_is_pair (env
) && !scm_is_pair (SCM_CAR (env
)))
3308 UPDATE_TOPLEVEL_ENV (env
);
3309 while (!scm_is_null (SCM_CDR (x
)))
3312 UPDATE_TOPLEVEL_ENV (env
);
3318 goto nontoplevel_begin
;
3321 while (!scm_is_null (SCM_CDR (x
)))
3323 const SCM form
= SCM_CAR (x
);
3326 if (SCM_ISYMP (form
))
3328 scm_rec_mutex_lock (&source_mutex
);
3329 /* check for race condition */
3330 if (SCM_ISYMP (SCM_CAR (x
)))
3331 m_expand_body (x
, env
);
3332 scm_rec_mutex_unlock (&source_mutex
);
3333 goto nontoplevel_begin
;
3336 SCM_VALIDATE_NON_EMPTY_COMBINATION (form
);
3339 (void) EVAL (form
, env
);
3345 /* scm_eval last form in list */
3346 const SCM last_form
= SCM_CAR (x
);
3348 if (scm_is_pair (last_form
))
3350 /* This is by far the most frequent case. */
3352 goto loop
; /* tail recurse */
3354 else if (SCM_IMP (last_form
))
3355 RETURN (SCM_I_EVALIM (last_form
, env
));
3356 else if (SCM_VARIABLEP (last_form
))
3357 RETURN (SCM_VARIABLE_REF (last_form
));
3358 else if (scm_is_symbol (last_form
))
3359 RETURN (*scm_lookupcar (x
, env
, 1));
3365 case (ISYMNUM (SCM_IM_CASE
)):
3368 const SCM key
= EVALCAR (x
, env
);
3370 while (!scm_is_null (x
))
3372 const SCM clause
= SCM_CAR (x
);
3373 SCM labels
= SCM_CAR (clause
);
3374 if (scm_is_eq (labels
, SCM_IM_ELSE
))
3376 x
= SCM_CDR (clause
);
3377 PREP_APPLY (SCM_UNDEFINED
, SCM_EOL
);
3380 while (!scm_is_null (labels
))
3382 const SCM label
= SCM_CAR (labels
);
3383 if (scm_is_eq (label
, key
)
3384 || scm_is_true (scm_eqv_p (label
, key
)))
3386 x
= SCM_CDR (clause
);
3387 PREP_APPLY (SCM_UNDEFINED
, SCM_EOL
);
3390 labels
= SCM_CDR (labels
);
3395 RETURN (SCM_UNSPECIFIED
);
3398 case (ISYMNUM (SCM_IM_COND
)):
3400 while (!scm_is_null (x
))
3402 const SCM clause
= SCM_CAR (x
);
3403 if (scm_is_eq (SCM_CAR (clause
), SCM_IM_ELSE
))
3405 x
= SCM_CDR (clause
);
3406 PREP_APPLY (SCM_UNDEFINED
, SCM_EOL
);
3411 arg1
= EVALCAR (clause
, env
);
3412 if (scm_is_true (arg1
) && !SCM_NILP (arg1
))
3414 x
= SCM_CDR (clause
);
3415 if (scm_is_null (x
))
3417 else if (!scm_is_eq (SCM_CAR (x
), SCM_IM_ARROW
))
3419 PREP_APPLY (SCM_UNDEFINED
, SCM_EOL
);
3425 proc
= EVALCAR (proc
, env
);
3426 PREP_APPLY (proc
, scm_list_1 (arg1
));
3434 RETURN (SCM_UNSPECIFIED
);
3437 case (ISYMNUM (SCM_IM_DO
)):
3440 /* Compute the initialization values and the initial environment. */
3441 SCM init_forms
= SCM_CAR (x
);
3442 SCM init_values
= SCM_EOL
;
3443 while (!scm_is_null (init_forms
))
3445 init_values
= scm_cons (EVALCAR (init_forms
, env
), init_values
);
3446 init_forms
= SCM_CDR (init_forms
);
3449 env
= SCM_EXTEND_ENV (SCM_CAR (x
), init_values
, env
);
3453 SCM test_form
= SCM_CAR (x
);
3454 SCM body_forms
= SCM_CADR (x
);
3455 SCM step_forms
= SCM_CDDR (x
);
3457 SCM test_result
= EVALCAR (test_form
, env
);
3459 while (scm_is_false (test_result
) || SCM_NILP (test_result
))
3462 /* Evaluate body forms. */
3464 for (temp_forms
= body_forms
;
3465 !scm_is_null (temp_forms
);
3466 temp_forms
= SCM_CDR (temp_forms
))
3468 SCM form
= SCM_CAR (temp_forms
);
3469 /* Dirk:FIXME: We only need to eval forms that may have
3470 * a side effect here. This is only true for forms that
3471 * start with a pair. All others are just constants.
3472 * Since with the current memoizer 'form' may hold a
3473 * constant, we call EVAL here to handle the constant
3474 * cases. In the long run it would make sense to have
3475 * the macro transformer of 'do' eliminate all forms
3476 * that have no sideeffect. Then instead of EVAL we
3477 * could call CEVAL directly here. */
3478 (void) EVAL (form
, env
);
3483 /* Evaluate the step expressions. */
3485 SCM step_values
= SCM_EOL
;
3486 for (temp_forms
= step_forms
;
3487 !scm_is_null (temp_forms
);
3488 temp_forms
= SCM_CDR (temp_forms
))
3490 const SCM value
= EVALCAR (temp_forms
, env
);
3491 step_values
= scm_cons (value
, step_values
);
3493 env
= SCM_EXTEND_ENV (SCM_CAAR (env
),
3498 test_result
= EVALCAR (test_form
, env
);
3502 if (scm_is_null (x
))
3503 RETURN (SCM_UNSPECIFIED
);
3504 PREP_APPLY (SCM_UNDEFINED
, SCM_EOL
);
3505 goto nontoplevel_begin
;
3508 case (ISYMNUM (SCM_IM_IF
)):
3511 SCM test_result
= EVALCAR (x
, env
);
3512 x
= SCM_CDR (x
); /* then expression */
3513 if (scm_is_false (test_result
) || SCM_NILP (test_result
))
3515 x
= SCM_CDR (x
); /* else expression */
3516 if (scm_is_null (x
))
3517 RETURN (SCM_UNSPECIFIED
);
3520 PREP_APPLY (SCM_UNDEFINED
, SCM_EOL
);
3524 case (ISYMNUM (SCM_IM_LET
)):
3527 SCM init_forms
= SCM_CADR (x
);
3528 SCM init_values
= SCM_EOL
;
3531 init_values
= scm_cons (EVALCAR (init_forms
, env
), init_values
);
3532 init_forms
= SCM_CDR (init_forms
);
3534 while (!scm_is_null (init_forms
));
3535 env
= SCM_EXTEND_ENV (SCM_CAR (x
), init_values
, env
);
3538 PREP_APPLY (SCM_UNDEFINED
, SCM_EOL
);
3539 goto nontoplevel_begin
;
3542 case (ISYMNUM (SCM_IM_LETREC
)):
3544 env
= SCM_EXTEND_ENV (SCM_CAR (x
), undefineds
, env
);
3547 SCM init_forms
= SCM_CAR (x
);
3548 SCM init_values
= SCM_EOL
;
3551 init_values
= scm_cons (EVALCAR (init_forms
, env
), init_values
);
3552 init_forms
= SCM_CDR (init_forms
);
3554 while (!scm_is_null (init_forms
));
3555 SCM_SETCDR (SCM_CAR (env
), init_values
);
3558 PREP_APPLY (SCM_UNDEFINED
, SCM_EOL
);
3559 goto nontoplevel_begin
;
3562 case (ISYMNUM (SCM_IM_LETSTAR
)):
3565 SCM bindings
= SCM_CAR (x
);
3566 if (!scm_is_null (bindings
))
3570 SCM name
= SCM_CAR (bindings
);
3571 SCM init
= SCM_CDR (bindings
);
3572 env
= SCM_EXTEND_ENV (name
, EVALCAR (init
, env
), env
);
3573 bindings
= SCM_CDR (init
);
3575 while (!scm_is_null (bindings
));
3579 PREP_APPLY (SCM_UNDEFINED
, SCM_EOL
);
3580 goto nontoplevel_begin
;
3583 case (ISYMNUM (SCM_IM_OR
)):
3585 while (!scm_is_null (SCM_CDR (x
)))
3587 SCM val
= EVALCAR (x
, env
);
3588 if (scm_is_true (val
) && !SCM_NILP (val
))
3593 PREP_APPLY (SCM_UNDEFINED
, SCM_EOL
);
3597 case (ISYMNUM (SCM_IM_LAMBDA
)):
3598 RETURN (scm_closure (SCM_CDR (x
), env
));
3601 case (ISYMNUM (SCM_IM_QUOTE
)):
3602 RETURN (SCM_CDR (x
));
3605 case (ISYMNUM (SCM_IM_SET_X
)):
3609 SCM variable
= SCM_CAR (x
);
3610 if (SCM_ILOCP (variable
))
3611 location
= scm_ilookup (variable
, env
);
3612 else if (SCM_VARIABLEP (variable
))
3613 location
= SCM_VARIABLE_LOC (variable
);
3616 /* (scm_is_symbol (variable)) is known to be true */
3617 variable
= lazy_memoize_variable (variable
, env
);
3618 SCM_SETCAR (x
, variable
);
3619 location
= SCM_VARIABLE_LOC (variable
);
3622 *location
= EVALCAR (x
, env
);
3624 RETURN (SCM_UNSPECIFIED
);
3627 case (ISYMNUM (SCM_IM_APPLY
)):
3628 /* Evaluate the procedure to be applied. */
3630 proc
= EVALCAR (x
, env
);
3631 PREP_APPLY (proc
, SCM_EOL
);
3633 /* Evaluate the argument holding the list of arguments */
3635 arg1
= EVALCAR (x
, env
);
3638 /* Go here to tail-apply a procedure. PROC is the procedure and
3639 * ARG1 is the list of arguments. PREP_APPLY must have been called
3640 * before jumping to apply_proc. */
3641 if (SCM_CLOSUREP (proc
))
3643 SCM formals
= SCM_CLOSURE_FORMALS (proc
);
3645 debug
.info
->a
.args
= arg1
;
3647 if (scm_badargsp (formals
, arg1
))
3648 scm_wrong_num_args (proc
);
3650 /* Copy argument list */
3651 if (SCM_NULL_OR_NIL_P (arg1
))
3652 env
= SCM_EXTEND_ENV (formals
, SCM_EOL
, SCM_ENV (proc
));
3655 SCM args
= scm_list_1 (SCM_CAR (arg1
));
3657 arg1
= SCM_CDR (arg1
);
3658 while (!SCM_NULL_OR_NIL_P (arg1
))
3660 SCM new_tail
= scm_list_1 (SCM_CAR (arg1
));
3661 SCM_SETCDR (tail
, new_tail
);
3663 arg1
= SCM_CDR (arg1
);
3665 env
= SCM_EXTEND_ENV (formals
, args
, SCM_ENV (proc
));
3668 x
= SCM_CLOSURE_BODY (proc
);
3669 goto nontoplevel_begin
;
3674 RETURN (SCM_APPLY (proc
, arg1
, SCM_EOL
));
3678 case (ISYMNUM (SCM_IM_CONT
)):
3681 SCM val
= scm_make_continuation (&first
);
3689 proc
= EVALCAR (proc
, env
);
3690 PREP_APPLY (proc
, scm_list_1 (arg1
));
3697 case (ISYMNUM (SCM_IM_DELAY
)):
3698 RETURN (scm_makprom (scm_closure (SCM_CDR (x
), env
)));
3701 case (ISYMNUM (SCM_IM_FUTURE
)):
3702 RETURN (scm_i_make_future (scm_closure (SCM_CDR (x
), env
)));
3705 /* PLACEHOLDER for case (ISYMNUM (SCM_IM_DISPATCH)): The following
3706 code (type_dispatch) is intended to be the tail of the case
3707 clause for the internal macro SCM_IM_DISPATCH. Please don't
3708 remove it from this location without discussing it with Mikael
3709 <djurfeldt@nada.kth.se> */
3711 /* The type dispatch code is duplicated below
3712 * (c.f. objects.c:scm_mcache_compute_cmethod) since that
3713 * cuts down execution time for type dispatch to 50%. */
3714 type_dispatch
: /* inputs: x, arg1 */
3715 /* Type dispatch means to determine from the types of the function
3716 * arguments (i. e. the 'signature' of the call), which method from
3717 * a generic function is to be called. This process of selecting
3718 * the right method takes some time. To speed it up, guile uses
3719 * caching: Together with the macro call to dispatch the signatures
3720 * of some previous calls to that generic function from the same
3721 * place are stored (in the code!) in a cache that we call the
3722 * 'method cache'. This is done since it is likely, that
3723 * consecutive calls to dispatch from that position in the code will
3724 * have the same signature. Thus, the type dispatch works as
3725 * follows: First, determine a hash value from the signature of the
3726 * actual arguments. Second, use this hash value as an index to
3727 * find that same signature in the method cache stored at this
3728 * position in the code. If found, you have also found the
3729 * corresponding method that belongs to that signature. If the
3730 * signature is not found in the method cache, you have to perform a
3731 * full search over all signatures stored with the generic
3734 unsigned long int specializers
;
3735 unsigned long int hash_value
;
3736 unsigned long int cache_end_pos
;
3737 unsigned long int mask
;
3741 SCM z
= SCM_CDDR (x
);
3742 SCM tmp
= SCM_CADR (z
);
3743 specializers
= scm_to_ulong (SCM_CAR (z
));
3745 /* Compute a hash value for searching the method cache. There
3746 * are two variants for computing the hash value, a (rather)
3747 * complicated one, and a simple one. For the complicated one
3748 * explained below, tmp holds a number that is used in the
3750 if (scm_is_simple_vector (tmp
))
3752 /* This method of determining the hash value is much
3753 * simpler: Set the hash value to zero and just perform a
3754 * linear search through the method cache. */
3756 mask
= (unsigned long int) ((long) -1);
3758 cache_end_pos
= SCM_SIMPLE_VECTOR_LENGTH (method_cache
);
3762 /* Use the signature of the actual arguments to determine
3763 * the hash value. This is done as follows: Each class has
3764 * an array of random numbers, that are determined when the
3765 * class is created. The integer 'hashset' is an index into
3766 * that array of random numbers. Now, from all classes that
3767 * are part of the signature of the actual arguments, the
3768 * random numbers at index 'hashset' are taken and summed
3769 * up, giving the hash value. The value of 'hashset' is
3770 * stored at the call to dispatch. This allows to have
3771 * different 'formulas' for calculating the hash value at
3772 * different places where dispatch is called. This allows
3773 * to optimize the hash formula at every individual place
3774 * where dispatch is called, such that hopefully the hash
3775 * value that is computed will directly point to the right
3776 * method in the method cache. */
3777 unsigned long int hashset
= scm_to_ulong (tmp
);
3778 unsigned long int counter
= specializers
+ 1;
3781 while (!scm_is_null (tmp_arg
) && counter
!= 0)
3783 SCM
class = scm_class_of (SCM_CAR (tmp_arg
));
3784 hash_value
+= SCM_INSTANCE_HASH (class, hashset
);
3785 tmp_arg
= SCM_CDR (tmp_arg
);
3789 method_cache
= SCM_CADR (z
);
3790 mask
= scm_to_ulong (SCM_CAR (z
));
3792 cache_end_pos
= hash_value
;
3797 /* Search the method cache for a method with a matching
3798 * signature. Start the search at position 'hash_value'. The
3799 * hashing implementation uses linear probing for conflict
3800 * resolution, that is, if the signature in question is not
3801 * found at the starting index in the hash table, the next table
3802 * entry is tried, and so on, until in the worst case the whole
3803 * cache has been searched, but still the signature has not been
3808 SCM args
= arg1
; /* list of arguments */
3809 z
= SCM_SIMPLE_VECTOR_REF (method_cache
, hash_value
);
3810 while (!scm_is_null (args
))
3812 /* More arguments than specifiers => CLASS != ENV */
3813 SCM class_of_arg
= scm_class_of (SCM_CAR (args
));
3814 if (!scm_is_eq (class_of_arg
, SCM_CAR (z
)))
3816 args
= SCM_CDR (args
);
3819 /* Fewer arguments than specifiers => CAR != ENV */
3820 if (scm_is_null (SCM_CAR (z
)) || scm_is_pair (SCM_CAR (z
)))
3823 hash_value
= (hash_value
+ 1) & mask
;
3824 } while (hash_value
!= cache_end_pos
);
3826 /* No appropriate method was found in the cache. */
3827 z
= scm_memoize_method (x
, arg1
);
3829 apply_cmethod
: /* inputs: z, arg1 */
3831 SCM formals
= SCM_CMETHOD_FORMALS (z
);
3832 env
= SCM_EXTEND_ENV (formals
, arg1
, SCM_CMETHOD_ENV (z
));
3833 x
= SCM_CMETHOD_BODY (z
);
3834 goto nontoplevel_begin
;
3840 case (ISYMNUM (SCM_IM_SLOT_REF
)):
3843 SCM instance
= EVALCAR (x
, env
);
3844 unsigned long int slot
= SCM_I_INUM (SCM_CDR (x
));
3845 RETURN (SCM_PACK (SCM_STRUCT_DATA (instance
) [slot
]));
3849 case (ISYMNUM (SCM_IM_SLOT_SET_X
)):
3852 SCM instance
= EVALCAR (x
, env
);
3853 unsigned long int slot
= SCM_I_INUM (SCM_CADR (x
));
3854 SCM value
= EVALCAR (SCM_CDDR (x
), env
);
3855 SCM_STRUCT_DATA (instance
) [slot
] = SCM_UNPACK (value
);
3856 RETURN (SCM_UNSPECIFIED
);
3860 #if SCM_ENABLE_ELISP
3862 case (ISYMNUM (SCM_IM_NIL_COND
)):
3864 SCM test_form
= SCM_CDR (x
);
3865 x
= SCM_CDR (test_form
);
3866 while (!SCM_NULL_OR_NIL_P (x
))
3868 SCM test_result
= EVALCAR (test_form
, env
);
3869 if (!(scm_is_false (test_result
)
3870 || SCM_NULL_OR_NIL_P (test_result
)))
3872 if (scm_is_eq (SCM_CAR (x
), SCM_UNSPECIFIED
))
3873 RETURN (test_result
);
3874 PREP_APPLY (SCM_UNDEFINED
, SCM_EOL
);
3879 test_form
= SCM_CDR (x
);
3880 x
= SCM_CDR (test_form
);
3884 PREP_APPLY (SCM_UNDEFINED
, SCM_EOL
);
3888 #endif /* SCM_ENABLE_ELISP */
3890 case (ISYMNUM (SCM_IM_BIND
)):
3892 SCM vars
, exps
, vals
;
3895 vars
= SCM_CAAR (x
);
3896 exps
= SCM_CDAR (x
);
3898 while (!scm_is_null (exps
))
3900 vals
= scm_cons (EVALCAR (exps
, env
), vals
);
3901 exps
= SCM_CDR (exps
);
3904 scm_swap_bindings (vars
, vals
);
3905 scm_dynwinds
= scm_acons (vars
, vals
, scm_dynwinds
);
3907 /* Ignore all but the last evaluation result. */
3908 for (x
= SCM_CDR (x
); !scm_is_null (SCM_CDR (x
)); x
= SCM_CDR (x
))
3910 if (scm_is_pair (SCM_CAR (x
)))
3911 CEVAL (SCM_CAR (x
), env
);
3913 proc
= EVALCAR (x
, env
);
3915 scm_dynwinds
= SCM_CDR (scm_dynwinds
);
3916 scm_swap_bindings (vars
, vals
);
3922 case (ISYMNUM (SCM_IM_CALL_WITH_VALUES
)):
3927 producer
= EVALCAR (x
, env
);
3929 proc
= EVALCAR (x
, env
); /* proc is the consumer. */
3930 arg1
= SCM_APPLY (producer
, SCM_EOL
, SCM_EOL
);
3931 if (SCM_VALUESP (arg1
))
3933 /* The list of arguments is not copied. Rather, it is assumed
3934 * that this has been done by the 'values' procedure. */
3935 arg1
= scm_struct_ref (arg1
, SCM_INUM0
);
3939 arg1
= scm_list_1 (arg1
);
3941 PREP_APPLY (proc
, arg1
);
3952 if (SCM_VARIABLEP (SCM_CAR (x
)))
3953 proc
= SCM_VARIABLE_REF (SCM_CAR (x
));
3954 else if (SCM_ILOCP (SCM_CAR (x
)))
3955 proc
= *scm_ilookup (SCM_CAR (x
), env
);
3956 else if (scm_is_pair (SCM_CAR (x
)))
3957 proc
= CEVAL (SCM_CAR (x
), env
);
3958 else if (scm_is_symbol (SCM_CAR (x
)))
3960 SCM orig_sym
= SCM_CAR (x
);
3962 SCM
*location
= scm_lookupcar1 (x
, env
, 1);
3963 if (location
== NULL
)
3965 /* we have lost the race, start again. */
3971 if (SCM_MACROP (proc
))
3973 SCM_SETCAR (x
, orig_sym
); /* Undo memoizing effect of
3975 handle_a_macro
: /* inputs: x, env, proc */
3977 /* Set a flag during macro expansion so that macro
3978 application frames can be deleted from the backtrace. */
3979 SCM_SET_MACROEXP (debug
);
3981 arg1
= SCM_APPLY (SCM_MACRO_CODE (proc
), x
,
3982 scm_cons (env
, scm_listofnull
));
3984 SCM_CLEAR_MACROEXP (debug
);
3986 switch (SCM_MACRO_TYPE (proc
))
3990 if (!scm_is_pair (arg1
))
3991 arg1
= scm_list_2 (SCM_IM_BEGIN
, arg1
);
3993 assert (!scm_is_eq (x
, SCM_CAR (arg1
))
3994 && !scm_is_eq (x
, SCM_CDR (arg1
)));
3997 if (!SCM_CLOSUREP (SCM_MACRO_CODE (proc
)))
4000 SCM_SETCAR (x
, SCM_CAR (arg1
));
4001 SCM_SETCDR (x
, SCM_CDR (arg1
));
4005 /* Prevent memoizing of debug info expression. */
4006 debug
.info
->e
.exp
= scm_cons_source (debug
.info
->e
.exp
,
4011 SCM_SETCAR (x
, SCM_CAR (arg1
));
4012 SCM_SETCDR (x
, SCM_CDR (arg1
));
4014 PREP_APPLY (SCM_UNDEFINED
, SCM_EOL
);
4016 #if SCM_ENABLE_DEPRECATED == 1
4021 PREP_APPLY (SCM_UNDEFINED
, SCM_EOL
);
4035 if (SCM_MACROP (proc
))
4036 goto handle_a_macro
;
4040 /* When reaching this part of the code, the following is granted: Variable x
4041 * holds the first pair of an expression of the form (<function> arg ...).
4042 * Variable proc holds the object that resulted from the evaluation of
4043 * <function>. In the following, the arguments (if any) will be evaluated,
4044 * and proc will be applied to them. If proc does not really hold a
4045 * function object, this will be signalled as an error on the scheme
4046 * level. If the number of arguments does not match the number of arguments
4047 * that are allowed to be passed to proc, also an error on the scheme level
4048 * will be signalled. */
4049 PREP_APPLY (proc
, SCM_EOL
);
4050 if (scm_is_null (SCM_CDR (x
))) {
4053 SCM_ASRTGO (!SCM_IMP (proc
), badfun
);
4054 switch (SCM_TYP7 (proc
))
4055 { /* no arguments given */
4056 case scm_tc7_subr_0
:
4057 RETURN (SCM_SUBRF (proc
) ());
4058 case scm_tc7_subr_1o
:
4059 RETURN (SCM_SUBRF (proc
) (SCM_UNDEFINED
));
4061 RETURN (SCM_SUBRF (proc
) (SCM_EOL
));
4062 case scm_tc7_rpsubr
:
4063 RETURN (SCM_BOOL_T
);
4065 RETURN (SCM_SUBRF (proc
) (SCM_UNDEFINED
, SCM_UNDEFINED
));
4067 if (!SCM_SMOB_APPLICABLE_P (proc
))
4069 RETURN (SCM_SMOB_APPLY_0 (proc
));
4072 proc
= SCM_CCLO_SUBR (proc
);
4074 debug
.info
->a
.proc
= proc
;
4075 debug
.info
->a
.args
= scm_list_1 (arg1
);
4079 proc
= SCM_PROCEDURE (proc
);
4081 debug
.info
->a
.proc
= proc
;
4083 if (!SCM_CLOSUREP (proc
))
4086 case scm_tcs_closures
:
4088 const SCM formals
= SCM_CLOSURE_FORMALS (proc
);
4089 if (scm_is_pair (formals
))
4091 x
= SCM_CLOSURE_BODY (proc
);
4092 env
= SCM_EXTEND_ENV (formals
, SCM_EOL
, SCM_ENV (proc
));
4093 goto nontoplevel_begin
;
4095 case scm_tcs_struct
:
4096 if (SCM_OBJ_CLASS_FLAGS (proc
) & SCM_CLASSF_PURE_GENERIC
)
4098 x
= SCM_ENTITY_PROCEDURE (proc
);
4102 else if (SCM_I_OPERATORP (proc
))
4105 proc
= (SCM_I_ENTITYP (proc
)
4106 ? SCM_ENTITY_PROCEDURE (proc
)
4107 : SCM_OPERATOR_PROCEDURE (proc
));
4109 debug
.info
->a
.proc
= proc
;
4110 debug
.info
->a
.args
= scm_list_1 (arg1
);
4116 case scm_tc7_subr_1
:
4117 case scm_tc7_subr_2
:
4118 case scm_tc7_subr_2o
:
4121 case scm_tc7_subr_3
:
4122 case scm_tc7_lsubr_2
:
4124 scm_wrong_num_args (proc
);
4127 scm_misc_error (NULL
, "Wrong type to apply: ~S", scm_list_1 (proc
));
4131 /* must handle macros by here */
4133 if (scm_is_pair (x
))
4134 arg1
= EVALCAR (x
, env
);
4136 scm_wrong_num_args (proc
);
4138 debug
.info
->a
.args
= scm_list_1 (arg1
);
4143 if (scm_is_null (x
))
4146 evap1
: /* inputs: proc, arg1 */
4147 SCM_ASRTGO (!SCM_IMP (proc
), badfun
);
4148 switch (SCM_TYP7 (proc
))
4149 { /* have one argument in arg1 */
4150 case scm_tc7_subr_2o
:
4151 RETURN (SCM_SUBRF (proc
) (arg1
, SCM_UNDEFINED
));
4152 case scm_tc7_subr_1
:
4153 case scm_tc7_subr_1o
:
4154 RETURN (SCM_SUBRF (proc
) (arg1
));
4156 if (SCM_I_INUMP (arg1
))
4158 RETURN (scm_from_double (SCM_DSUBRF (proc
) ((double) SCM_I_INUM (arg1
))));
4160 else if (SCM_REALP (arg1
))
4162 RETURN (scm_from_double (SCM_DSUBRF (proc
) (SCM_REAL_VALUE (arg1
))));
4164 else if (SCM_BIGP (arg1
))
4166 RETURN (scm_from_double (SCM_DSUBRF (proc
) (scm_i_big2dbl (arg1
))));
4168 else if (SCM_FRACTIONP (arg1
))
4170 RETURN (scm_from_double (SCM_DSUBRF (proc
) (scm_i_fraction2double (arg1
))));
4172 SCM_WTA_DISPATCH_1 (*SCM_SUBR_GENERIC (proc
), arg1
,
4174 scm_i_symbol_chars (SCM_SNAME (proc
)));
4176 RETURN (scm_i_chase_pairs (arg1
, (scm_t_bits
) SCM_SUBRF (proc
)));
4177 case scm_tc7_rpsubr
:
4178 RETURN (SCM_BOOL_T
);
4180 RETURN (SCM_SUBRF (proc
) (arg1
, SCM_UNDEFINED
));
4183 RETURN (SCM_SUBRF (proc
) (debug
.info
->a
.args
));
4185 RETURN (SCM_SUBRF (proc
) (scm_list_1 (arg1
)));
4188 if (!SCM_SMOB_APPLICABLE_P (proc
))
4190 RETURN (SCM_SMOB_APPLY_1 (proc
, arg1
));
4194 proc
= SCM_CCLO_SUBR (proc
);
4196 debug
.info
->a
.args
= scm_cons (arg1
, debug
.info
->a
.args
);
4197 debug
.info
->a
.proc
= proc
;
4201 proc
= SCM_PROCEDURE (proc
);
4203 debug
.info
->a
.proc
= proc
;
4205 if (!SCM_CLOSUREP (proc
))
4208 case scm_tcs_closures
:
4211 const SCM formals
= SCM_CLOSURE_FORMALS (proc
);
4212 if (scm_is_null (formals
)
4213 || (scm_is_pair (formals
) && scm_is_pair (SCM_CDR (formals
))))
4215 x
= SCM_CLOSURE_BODY (proc
);
4217 env
= SCM_EXTEND_ENV (formals
,
4221 env
= SCM_EXTEND_ENV (formals
,
4225 goto nontoplevel_begin
;
4227 case scm_tcs_struct
:
4228 if (SCM_OBJ_CLASS_FLAGS (proc
) & SCM_CLASSF_PURE_GENERIC
)
4230 x
= SCM_ENTITY_PROCEDURE (proc
);
4232 arg1
= debug
.info
->a
.args
;
4234 arg1
= scm_list_1 (arg1
);
4238 else if (SCM_I_OPERATORP (proc
))
4242 proc
= (SCM_I_ENTITYP (proc
)
4243 ? SCM_ENTITY_PROCEDURE (proc
)
4244 : SCM_OPERATOR_PROCEDURE (proc
));
4246 debug
.info
->a
.args
= scm_cons (arg1
, debug
.info
->a
.args
);
4247 debug
.info
->a
.proc
= proc
;
4253 case scm_tc7_subr_2
:
4254 case scm_tc7_subr_0
:
4255 case scm_tc7_subr_3
:
4256 case scm_tc7_lsubr_2
:
4257 scm_wrong_num_args (proc
);
4262 if (scm_is_pair (x
))
4263 arg2
= EVALCAR (x
, env
);
4265 scm_wrong_num_args (proc
);
4267 { /* have two or more arguments */
4269 debug
.info
->a
.args
= scm_list_2 (arg1
, arg2
);
4272 if (scm_is_null (x
)) {
4275 SCM_ASRTGO (!SCM_IMP (proc
), badfun
);
4276 switch (SCM_TYP7 (proc
))
4277 { /* have two arguments */
4278 case scm_tc7_subr_2
:
4279 case scm_tc7_subr_2o
:
4280 RETURN (SCM_SUBRF (proc
) (arg1
, arg2
));
4283 RETURN (SCM_SUBRF (proc
) (debug
.info
->a
.args
));
4285 RETURN (SCM_SUBRF (proc
) (scm_list_2 (arg1
, arg2
)));
4287 case scm_tc7_lsubr_2
:
4288 RETURN (SCM_SUBRF (proc
) (arg1
, arg2
, SCM_EOL
));
4289 case scm_tc7_rpsubr
:
4291 RETURN (SCM_SUBRF (proc
) (arg1
, arg2
));
4293 if (!SCM_SMOB_APPLICABLE_P (proc
))
4295 RETURN (SCM_SMOB_APPLY_2 (proc
, arg1
, arg2
));
4299 RETURN (SCM_APPLY (SCM_CCLO_SUBR (proc
),
4300 scm_cons (proc
, debug
.info
->a
.args
),
4303 RETURN (SCM_APPLY (SCM_CCLO_SUBR (proc
),
4304 scm_cons2 (proc
, arg1
,
4311 case scm_tcs_struct
:
4312 if (SCM_OBJ_CLASS_FLAGS (proc
) & SCM_CLASSF_PURE_GENERIC
)
4314 x
= SCM_ENTITY_PROCEDURE (proc
);
4316 arg1
= debug
.info
->a
.args
;
4318 arg1
= scm_list_2 (arg1
, arg2
);
4322 else if (SCM_I_OPERATORP (proc
))
4326 RETURN (SCM_APPLY (SCM_I_ENTITYP (proc
)
4327 ? SCM_ENTITY_PROCEDURE (proc
)
4328 : SCM_OPERATOR_PROCEDURE (proc
),
4329 scm_cons (proc
, debug
.info
->a
.args
),
4332 RETURN (SCM_APPLY (SCM_I_ENTITYP (proc
)
4333 ? SCM_ENTITY_PROCEDURE (proc
)
4334 : SCM_OPERATOR_PROCEDURE (proc
),
4335 scm_cons2 (proc
, arg1
,
4345 case scm_tc7_subr_0
:
4348 case scm_tc7_subr_1o
:
4349 case scm_tc7_subr_1
:
4350 case scm_tc7_subr_3
:
4351 scm_wrong_num_args (proc
);
4355 proc
= SCM_PROCEDURE (proc
);
4357 debug
.info
->a
.proc
= proc
;
4359 if (!SCM_CLOSUREP (proc
))
4362 case scm_tcs_closures
:
4365 const SCM formals
= SCM_CLOSURE_FORMALS (proc
);
4366 if (scm_is_null (formals
)
4367 || (scm_is_pair (formals
)
4368 && (scm_is_null (SCM_CDR (formals
))
4369 || (scm_is_pair (SCM_CDR (formals
))
4370 && scm_is_pair (SCM_CDDR (formals
))))))
4373 env
= SCM_EXTEND_ENV (formals
,
4377 env
= SCM_EXTEND_ENV (formals
,
4378 scm_list_2 (arg1
, arg2
),
4381 x
= SCM_CLOSURE_BODY (proc
);
4382 goto nontoplevel_begin
;
4386 if (!scm_is_pair (x
))
4387 scm_wrong_num_args (proc
);
4389 debug
.info
->a
.args
= scm_cons2 (arg1
, arg2
,
4390 deval_args (x
, env
, proc
,
4391 SCM_CDRLOC (SCM_CDR (debug
.info
->a
.args
))));
4395 SCM_ASRTGO (!SCM_IMP (proc
), badfun
);
4396 switch (SCM_TYP7 (proc
))
4397 { /* have 3 or more arguments */
4399 case scm_tc7_subr_3
:
4400 if (!scm_is_null (SCM_CDR (x
)))
4401 scm_wrong_num_args (proc
);
4403 RETURN (SCM_SUBRF (proc
) (arg1
, arg2
,
4404 SCM_CADDR (debug
.info
->a
.args
)));
4406 arg1
= SCM_SUBRF(proc
)(arg1
, arg2
);
4407 arg2
= SCM_CDDR (debug
.info
->a
.args
);
4410 arg1
= SCM_SUBRF(proc
)(arg1
, SCM_CAR (arg2
));
4411 arg2
= SCM_CDR (arg2
);
4413 while (SCM_NIMP (arg2
));
4415 case scm_tc7_rpsubr
:
4416 if (scm_is_false (SCM_SUBRF (proc
) (arg1
, arg2
)))
4417 RETURN (SCM_BOOL_F
);
4418 arg1
= SCM_CDDR (debug
.info
->a
.args
);
4421 if (scm_is_false (SCM_SUBRF (proc
) (arg2
, SCM_CAR (arg1
))))
4422 RETURN (SCM_BOOL_F
);
4423 arg2
= SCM_CAR (arg1
);
4424 arg1
= SCM_CDR (arg1
);
4426 while (SCM_NIMP (arg1
));
4427 RETURN (SCM_BOOL_T
);
4428 case scm_tc7_lsubr_2
:
4429 RETURN (SCM_SUBRF (proc
) (arg1
, arg2
,
4430 SCM_CDDR (debug
.info
->a
.args
)));
4432 RETURN (SCM_SUBRF (proc
) (debug
.info
->a
.args
));
4434 if (!SCM_SMOB_APPLICABLE_P (proc
))
4436 RETURN (SCM_SMOB_APPLY_3 (proc
, arg1
, arg2
,
4437 SCM_CDDR (debug
.info
->a
.args
)));
4441 proc
= SCM_PROCEDURE (proc
);
4442 debug
.info
->a
.proc
= proc
;
4443 if (!SCM_CLOSUREP (proc
))
4446 case scm_tcs_closures
:
4448 const SCM formals
= SCM_CLOSURE_FORMALS (proc
);
4449 if (scm_is_null (formals
)
4450 || (scm_is_pair (formals
)
4451 && (scm_is_null (SCM_CDR (formals
))
4452 || (scm_is_pair (SCM_CDR (formals
))
4453 && scm_badargsp (SCM_CDDR (formals
), x
)))))
4455 SCM_SET_ARGSREADY (debug
);
4456 env
= SCM_EXTEND_ENV (formals
,
4459 x
= SCM_CLOSURE_BODY (proc
);
4460 goto nontoplevel_begin
;
4463 case scm_tc7_subr_3
:
4464 if (!scm_is_null (SCM_CDR (x
)))
4465 scm_wrong_num_args (proc
);
4467 RETURN (SCM_SUBRF (proc
) (arg1
, arg2
, EVALCAR (x
, env
)));
4469 arg1
= SCM_SUBRF (proc
) (arg1
, arg2
);
4472 arg1
= SCM_SUBRF(proc
)(arg1
, EVALCAR(x
, env
));
4475 while (!scm_is_null (x
));
4477 case scm_tc7_rpsubr
:
4478 if (scm_is_false (SCM_SUBRF (proc
) (arg1
, arg2
)))
4479 RETURN (SCM_BOOL_F
);
4482 arg1
= EVALCAR (x
, env
);
4483 if (scm_is_false (SCM_SUBRF (proc
) (arg2
, arg1
)))
4484 RETURN (SCM_BOOL_F
);
4488 while (!scm_is_null (x
));
4489 RETURN (SCM_BOOL_T
);
4490 case scm_tc7_lsubr_2
:
4491 RETURN (SCM_SUBRF (proc
) (arg1
, arg2
, scm_eval_args (x
, env
, proc
)));
4493 RETURN (SCM_SUBRF (proc
) (scm_cons2 (arg1
,
4495 scm_eval_args (x
, env
, proc
))));
4497 if (!SCM_SMOB_APPLICABLE_P (proc
))
4499 RETURN (SCM_SMOB_APPLY_3 (proc
, arg1
, arg2
,
4500 scm_eval_args (x
, env
, proc
)));
4504 proc
= SCM_PROCEDURE (proc
);
4505 if (!SCM_CLOSUREP (proc
))
4508 case scm_tcs_closures
:
4510 const SCM formals
= SCM_CLOSURE_FORMALS (proc
);
4511 if (scm_is_null (formals
)
4512 || (scm_is_pair (formals
)
4513 && (scm_is_null (SCM_CDR (formals
))
4514 || (scm_is_pair (SCM_CDR (formals
))
4515 && scm_badargsp (SCM_CDDR (formals
), x
)))))
4517 env
= SCM_EXTEND_ENV (formals
,
4520 scm_eval_args (x
, env
, proc
)),
4522 x
= SCM_CLOSURE_BODY (proc
);
4523 goto nontoplevel_begin
;
4526 case scm_tcs_struct
:
4527 if (SCM_OBJ_CLASS_FLAGS (proc
) & SCM_CLASSF_PURE_GENERIC
)
4530 arg1
= debug
.info
->a
.args
;
4532 arg1
= scm_cons2 (arg1
, arg2
, scm_eval_args (x
, env
, proc
));
4534 x
= SCM_ENTITY_PROCEDURE (proc
);
4537 else if (SCM_I_OPERATORP (proc
))
4541 case scm_tc7_subr_2
:
4542 case scm_tc7_subr_1o
:
4543 case scm_tc7_subr_2o
:
4544 case scm_tc7_subr_0
:
4547 case scm_tc7_subr_1
:
4548 scm_wrong_num_args (proc
);
4556 if (scm_check_exit_p
&& SCM_TRAPS_P
)
4557 if (SCM_EXIT_FRAME_P
|| (SCM_TRACE_P
&& SCM_TRACED_FRAME_P (debug
)))
4559 SCM_CLEAR_TRACED_FRAME (debug
);
4560 if (SCM_CHEAPTRAPS_P
)
4561 arg1
= scm_make_debugobj (&debug
);
4565 SCM val
= scm_make_continuation (&first
);
4576 scm_call_3 (SCM_EXIT_FRAME_HDLR
, scm_sym_exit_frame
, arg1
, proc
);
4580 scm_last_debug_frame
= debug
.prev
;
4586 /* SECTION: This code is compiled once.
4593 /* Simple procedure calls
4597 scm_call_0 (SCM proc
)
4599 return scm_apply (proc
, SCM_EOL
, SCM_EOL
);
4603 scm_call_1 (SCM proc
, SCM arg1
)
4605 return scm_apply (proc
, arg1
, scm_listofnull
);
4609 scm_call_2 (SCM proc
, SCM arg1
, SCM arg2
)
4611 return scm_apply (proc
, arg1
, scm_cons (arg2
, scm_listofnull
));
4615 scm_call_3 (SCM proc
, SCM arg1
, SCM arg2
, SCM arg3
)
4617 return scm_apply (proc
, arg1
, scm_cons2 (arg2
, arg3
, scm_listofnull
));
4621 scm_call_4 (SCM proc
, SCM arg1
, SCM arg2
, SCM arg3
, SCM arg4
)
4623 return scm_apply (proc
, arg1
, scm_cons2 (arg2
, arg3
,
4624 scm_cons (arg4
, scm_listofnull
)));
4627 /* Simple procedure applies
4631 scm_apply_0 (SCM proc
, SCM args
)
4633 return scm_apply (proc
, args
, SCM_EOL
);
4637 scm_apply_1 (SCM proc
, SCM arg1
, SCM args
)
4639 return scm_apply (proc
, scm_cons (arg1
, args
), SCM_EOL
);
4643 scm_apply_2 (SCM proc
, SCM arg1
, SCM arg2
, SCM args
)
4645 return scm_apply (proc
, scm_cons2 (arg1
, arg2
, args
), SCM_EOL
);
4649 scm_apply_3 (SCM proc
, SCM arg1
, SCM arg2
, SCM arg3
, SCM args
)
4651 return scm_apply (proc
, scm_cons (arg1
, scm_cons2 (arg2
, arg3
, args
)),
4655 /* This code processes the arguments to apply:
4657 (apply PROC ARG1 ... ARGS)
4659 Given a list (ARG1 ... ARGS), this function conses the ARG1
4660 ... arguments onto the front of ARGS, and returns the resulting
4661 list. Note that ARGS is a list; thus, the argument to this
4662 function is a list whose last element is a list.
4664 Apply calls this function, and applies PROC to the elements of the
4665 result. apply:nconc2last takes care of building the list of
4666 arguments, given (ARG1 ... ARGS).
4668 Rather than do new consing, apply:nconc2last destroys its argument.
4669 On that topic, this code came into my care with the following
4670 beautifully cryptic comment on that topic: "This will only screw
4671 you if you do (scm_apply scm_apply '( ... ))" If you know what
4672 they're referring to, send me a patch to this comment. */
4674 SCM_DEFINE (scm_nconc2last
, "apply:nconc2last", 1, 0, 0,
4676 "Given a list (@var{arg1} @dots{} @var{args}), this function\n"
4677 "conses the @var{arg1} @dots{} arguments onto the front of\n"
4678 "@var{args}, and returns the resulting list. Note that\n"
4679 "@var{args} is a list; thus, the argument to this function is\n"
4680 "a list whose last element is a list.\n"
4681 "Note: Rather than do new consing, @code{apply:nconc2last}\n"
4682 "destroys its argument, so use with care.")
4683 #define FUNC_NAME s_scm_nconc2last
4686 SCM_VALIDATE_NONEMPTYLIST (1, lst
);
4688 while (!scm_is_null (SCM_CDR (*lloc
))) /* Perhaps should be
4689 SCM_NULL_OR_NIL_P, but not
4690 needed in 99.99% of cases,
4691 and it could seriously hurt
4692 performance. - Neil */
4693 lloc
= SCM_CDRLOC (*lloc
);
4694 SCM_ASSERT (scm_ilength (SCM_CAR (*lloc
)) >= 0, lst
, SCM_ARG1
, FUNC_NAME
);
4695 *lloc
= SCM_CAR (*lloc
);
4703 /* SECTION: When DEVAL is defined this code yields scm_dapply.
4704 * It is compiled twice.
4709 scm_apply (SCM proc
, SCM arg1
, SCM args
)
4715 scm_dapply (SCM proc
, SCM arg1
, SCM args
)
4720 /* Apply a function to a list of arguments.
4722 This function is exported to the Scheme level as taking two
4723 required arguments and a tail argument, as if it were:
4724 (lambda (proc arg1 . args) ...)
4725 Thus, if you just have a list of arguments to pass to a procedure,
4726 pass the list as ARG1, and '() for ARGS. If you have some fixed
4727 args, pass the first as ARG1, then cons any remaining fixed args
4728 onto the front of your argument list, and pass that as ARGS. */
4731 SCM_APPLY (SCM proc
, SCM arg1
, SCM args
)
4734 scm_t_debug_frame debug
;
4735 scm_t_debug_info debug_vect_body
;
4736 debug
.prev
= scm_last_debug_frame
;
4737 debug
.status
= SCM_APPLYFRAME
;
4738 debug
.vect
= &debug_vect_body
;
4739 debug
.vect
[0].a
.proc
= proc
;
4740 debug
.vect
[0].a
.args
= SCM_EOL
;
4741 scm_last_debug_frame
= &debug
;
4743 if (scm_debug_mode_p
)
4744 return scm_dapply (proc
, arg1
, args
);
4747 SCM_ASRTGO (SCM_NIMP (proc
), badproc
);
4749 /* If ARGS is the empty list, then we're calling apply with only two
4750 arguments --- ARG1 is the list of arguments for PROC. Whatever
4751 the case, futz with things so that ARG1 is the first argument to
4752 give to PROC (or SCM_UNDEFINED if no args), and ARGS contains the
4755 Setting the debug apply frame args this way is pretty messy.
4756 Perhaps we should store arg1 and args directly in the frame as
4757 received, and let scm_frame_arguments unpack them, because that's
4758 a relatively rare operation. This works for now; if the Guile
4759 developer archives are still around, see Mikael's post of
4761 if (scm_is_null (args
))
4763 if (scm_is_null (arg1
))
4765 arg1
= SCM_UNDEFINED
;
4767 debug
.vect
[0].a
.args
= SCM_EOL
;
4773 debug
.vect
[0].a
.args
= arg1
;
4775 args
= SCM_CDR (arg1
);
4776 arg1
= SCM_CAR (arg1
);
4781 args
= scm_nconc2last (args
);
4783 debug
.vect
[0].a
.args
= scm_cons (arg1
, args
);
4787 if (SCM_ENTER_FRAME_P
&& SCM_TRAPS_P
)
4790 if (SCM_CHEAPTRAPS_P
)
4791 tmp
= scm_make_debugobj (&debug
);
4796 tmp
= scm_make_continuation (&first
);
4801 scm_call_2 (SCM_ENTER_FRAME_HDLR
, scm_sym_enter_frame
, tmp
);
4808 switch (SCM_TYP7 (proc
))
4810 case scm_tc7_subr_2o
:
4811 args
= scm_is_null (args
) ? SCM_UNDEFINED
: SCM_CAR (args
);
4812 RETURN (SCM_SUBRF (proc
) (arg1
, args
));
4813 case scm_tc7_subr_2
:
4814 if (scm_is_null (args
) || !scm_is_null (SCM_CDR (args
)))
4815 scm_wrong_num_args (proc
);
4816 args
= SCM_CAR (args
);
4817 RETURN (SCM_SUBRF (proc
) (arg1
, args
));
4818 case scm_tc7_subr_0
:
4819 if (!SCM_UNBNDP (arg1
))
4820 scm_wrong_num_args (proc
);
4822 RETURN (SCM_SUBRF (proc
) ());
4823 case scm_tc7_subr_1
:
4824 if (SCM_UNBNDP (arg1
))
4825 scm_wrong_num_args (proc
);
4826 case scm_tc7_subr_1o
:
4827 if (!scm_is_null (args
))
4828 scm_wrong_num_args (proc
);
4830 RETURN (SCM_SUBRF (proc
) (arg1
));
4832 if (SCM_UNBNDP (arg1
) || !scm_is_null (args
))
4833 scm_wrong_num_args (proc
);
4834 if (SCM_I_INUMP (arg1
))
4836 RETURN (scm_from_double (SCM_DSUBRF (proc
) ((double) SCM_I_INUM (arg1
))));
4838 else if (SCM_REALP (arg1
))
4840 RETURN (scm_from_double (SCM_DSUBRF (proc
) (SCM_REAL_VALUE (arg1
))));
4842 else if (SCM_BIGP (arg1
))
4844 RETURN (scm_from_double (SCM_DSUBRF (proc
) (scm_i_big2dbl (arg1
))));
4846 else if (SCM_FRACTIONP (arg1
))
4848 RETURN (scm_from_double (SCM_DSUBRF (proc
) (scm_i_fraction2double (arg1
))));
4850 SCM_WTA_DISPATCH_1 (*SCM_SUBR_GENERIC (proc
), arg1
,
4851 SCM_ARG1
, scm_i_symbol_chars (SCM_SNAME (proc
)));
4853 if (SCM_UNBNDP (arg1
) || !scm_is_null (args
))
4854 scm_wrong_num_args (proc
);
4855 RETURN (scm_i_chase_pairs (arg1
, (scm_t_bits
) SCM_SUBRF (proc
)));
4856 case scm_tc7_subr_3
:
4857 if (scm_is_null (args
)
4858 || scm_is_null (SCM_CDR (args
))
4859 || !scm_is_null (SCM_CDDR (args
)))
4860 scm_wrong_num_args (proc
);
4862 RETURN (SCM_SUBRF (proc
) (arg1
, SCM_CAR (args
), SCM_CADR (args
)));
4865 RETURN (SCM_SUBRF (proc
) (SCM_UNBNDP (arg1
) ? SCM_EOL
: debug
.vect
[0].a
.args
));
4867 RETURN (SCM_SUBRF (proc
) (SCM_UNBNDP (arg1
) ? SCM_EOL
: scm_cons (arg1
, args
)));
4869 case scm_tc7_lsubr_2
:
4870 if (!scm_is_pair (args
))
4871 scm_wrong_num_args (proc
);
4873 RETURN (SCM_SUBRF (proc
) (arg1
, SCM_CAR (args
), SCM_CDR (args
)));
4875 if (scm_is_null (args
))
4876 RETURN (SCM_SUBRF (proc
) (arg1
, SCM_UNDEFINED
));
4877 while (SCM_NIMP (args
))
4879 SCM_ASSERT (scm_is_pair (args
), args
, SCM_ARG2
, "apply");
4880 arg1
= SCM_SUBRF (proc
) (arg1
, SCM_CAR (args
));
4881 args
= SCM_CDR (args
);
4884 case scm_tc7_rpsubr
:
4885 if (scm_is_null (args
))
4886 RETURN (SCM_BOOL_T
);
4887 while (SCM_NIMP (args
))
4889 SCM_ASSERT (scm_is_pair (args
), args
, SCM_ARG2
, "apply");
4890 if (scm_is_false (SCM_SUBRF (proc
) (arg1
, SCM_CAR (args
))))
4891 RETURN (SCM_BOOL_F
);
4892 arg1
= SCM_CAR (args
);
4893 args
= SCM_CDR (args
);
4895 RETURN (SCM_BOOL_T
);
4896 case scm_tcs_closures
:
4898 arg1
= (SCM_UNBNDP (arg1
) ? SCM_EOL
: debug
.vect
[0].a
.args
);
4900 arg1
= (SCM_UNBNDP (arg1
) ? SCM_EOL
: scm_cons (arg1
, args
));
4902 if (scm_badargsp (SCM_CLOSURE_FORMALS (proc
), arg1
))
4903 scm_wrong_num_args (proc
);
4905 /* Copy argument list */
4910 SCM tl
= args
= scm_cons (SCM_CAR (arg1
), SCM_UNSPECIFIED
);
4911 for (arg1
= SCM_CDR (arg1
); scm_is_pair (arg1
); arg1
= SCM_CDR (arg1
))
4913 SCM_SETCDR (tl
, scm_cons (SCM_CAR (arg1
), SCM_UNSPECIFIED
));
4916 SCM_SETCDR (tl
, arg1
);
4919 args
= SCM_EXTEND_ENV (SCM_CLOSURE_FORMALS (proc
),
4922 proc
= SCM_CLOSURE_BODY (proc
);
4924 arg1
= SCM_CDR (proc
);
4925 while (!scm_is_null (arg1
))
4927 if (SCM_IMP (SCM_CAR (proc
)))
4929 if (SCM_ISYMP (SCM_CAR (proc
)))
4931 scm_rec_mutex_lock (&source_mutex
);
4932 /* check for race condition */
4933 if (SCM_ISYMP (SCM_CAR (proc
)))
4934 m_expand_body (proc
, args
);
4935 scm_rec_mutex_unlock (&source_mutex
);
4939 SCM_VALIDATE_NON_EMPTY_COMBINATION (SCM_CAR (proc
));
4942 (void) EVAL (SCM_CAR (proc
), args
);
4944 arg1
= SCM_CDR (proc
);
4946 RETURN (EVALCAR (proc
, args
));
4948 if (!SCM_SMOB_APPLICABLE_P (proc
))
4950 if (SCM_UNBNDP (arg1
))
4951 RETURN (SCM_SMOB_APPLY_0 (proc
));
4952 else if (scm_is_null (args
))
4953 RETURN (SCM_SMOB_APPLY_1 (proc
, arg1
));
4954 else if (scm_is_null (SCM_CDR (args
)))
4955 RETURN (SCM_SMOB_APPLY_2 (proc
, arg1
, SCM_CAR (args
)));
4957 RETURN (SCM_SMOB_APPLY_3 (proc
, arg1
, SCM_CAR (args
), SCM_CDR (args
)));
4960 args
= (SCM_UNBNDP(arg1
) ? SCM_EOL
: debug
.vect
[0].a
.args
);
4962 proc
= SCM_CCLO_SUBR (proc
);
4963 debug
.vect
[0].a
.proc
= proc
;
4964 debug
.vect
[0].a
.args
= scm_cons (arg1
, args
);
4966 args
= (SCM_UNBNDP(arg1
) ? SCM_EOL
: scm_cons (arg1
, args
));
4968 proc
= SCM_CCLO_SUBR (proc
);
4972 proc
= SCM_PROCEDURE (proc
);
4974 debug
.vect
[0].a
.proc
= proc
;
4977 case scm_tcs_struct
:
4978 if (SCM_OBJ_CLASS_FLAGS (proc
) & SCM_CLASSF_PURE_GENERIC
)
4981 args
= (SCM_UNBNDP(arg1
) ? SCM_EOL
: debug
.vect
[0].a
.args
);
4983 args
= (SCM_UNBNDP(arg1
) ? SCM_EOL
: scm_cons (arg1
, args
));
4985 RETURN (scm_apply_generic (proc
, args
));
4987 else if (SCM_I_OPERATORP (proc
))
4991 args
= (SCM_UNBNDP(arg1
) ? SCM_EOL
: debug
.vect
[0].a
.args
);
4993 args
= (SCM_UNBNDP(arg1
) ? SCM_EOL
: scm_cons (arg1
, args
));
4996 proc
= (SCM_I_ENTITYP (proc
)
4997 ? SCM_ENTITY_PROCEDURE (proc
)
4998 : SCM_OPERATOR_PROCEDURE (proc
));
5000 debug
.vect
[0].a
.proc
= proc
;
5001 debug
.vect
[0].a
.args
= scm_cons (arg1
, args
);
5003 if (SCM_NIMP (proc
))
5012 scm_wrong_type_arg ("apply", SCM_ARG1
, proc
);
5016 if (scm_check_exit_p
&& SCM_TRAPS_P
)
5017 if (SCM_EXIT_FRAME_P
|| (SCM_TRACE_P
&& SCM_TRACED_FRAME_P (debug
)))
5019 SCM_CLEAR_TRACED_FRAME (debug
);
5020 if (SCM_CHEAPTRAPS_P
)
5021 arg1
= scm_make_debugobj (&debug
);
5025 SCM val
= scm_make_continuation (&first
);
5036 scm_call_3 (SCM_EXIT_FRAME_HDLR
, scm_sym_exit_frame
, arg1
, proc
);
5040 scm_last_debug_frame
= debug
.prev
;
5046 /* SECTION: The rest of this file is only read once.
5053 * Trampolines make it possible to move procedure application dispatch
5054 * outside inner loops. The motivation was clean implementation of
5055 * efficient replacements of R5RS primitives in SRFI-1.
5057 * The semantics is clear: scm_trampoline_N returns an optimized
5058 * version of scm_call_N (or NULL if the procedure isn't applicable
5061 * Applying the optimization to map and for-each increased efficiency
5062 * noticeably. For example, (map abs ls) is now 8 times faster than
5067 call_subr0_0 (SCM proc
)
5069 return SCM_SUBRF (proc
) ();
5073 call_subr1o_0 (SCM proc
)
5075 return SCM_SUBRF (proc
) (SCM_UNDEFINED
);
5079 call_lsubr_0 (SCM proc
)
5081 return SCM_SUBRF (proc
) (SCM_EOL
);
5085 scm_i_call_closure_0 (SCM proc
)
5087 const SCM env
= SCM_EXTEND_ENV (SCM_CLOSURE_FORMALS (proc
),
5090 const SCM result
= scm_eval_body (SCM_CLOSURE_BODY (proc
), env
);
5095 scm_trampoline_0 (SCM proc
)
5097 scm_t_trampoline_0 trampoline
;
5102 switch (SCM_TYP7 (proc
))
5104 case scm_tc7_subr_0
:
5105 trampoline
= call_subr0_0
;
5107 case scm_tc7_subr_1o
:
5108 trampoline
= call_subr1o_0
;
5111 trampoline
= call_lsubr_0
;
5113 case scm_tcs_closures
:
5115 SCM formals
= SCM_CLOSURE_FORMALS (proc
);
5116 if (scm_is_null (formals
) || !scm_is_pair (formals
))
5117 trampoline
= scm_i_call_closure_0
;
5122 case scm_tcs_struct
:
5123 if (SCM_OBJ_CLASS_FLAGS (proc
) & SCM_CLASSF_PURE_GENERIC
)
5124 trampoline
= scm_call_generic_0
;
5125 else if (SCM_I_OPERATORP (proc
))
5126 trampoline
= scm_call_0
;
5131 if (SCM_SMOB_APPLICABLE_P (proc
))
5132 trampoline
= SCM_SMOB_DESCRIPTOR (proc
).apply_0
;
5137 case scm_tc7_rpsubr
:
5140 trampoline
= scm_call_0
;
5143 return NULL
; /* not applicable on zero arguments */
5145 /* We only reach this point if a valid trampoline was determined. */
5147 /* If debugging is enabled, we want to see all calls to proc on the stack.
5148 * Thus, we replace the trampoline shortcut with scm_call_0. */
5149 if (scm_debug_mode_p
)
5156 call_subr1_1 (SCM proc
, SCM arg1
)
5158 return SCM_SUBRF (proc
) (arg1
);
5162 call_subr2o_1 (SCM proc
, SCM arg1
)
5164 return SCM_SUBRF (proc
) (arg1
, SCM_UNDEFINED
);
5168 call_lsubr_1 (SCM proc
, SCM arg1
)
5170 return SCM_SUBRF (proc
) (scm_list_1 (arg1
));
5174 call_dsubr_1 (SCM proc
, SCM arg1
)
5176 if (SCM_I_INUMP (arg1
))
5178 RETURN (scm_from_double (SCM_DSUBRF (proc
) ((double) SCM_I_INUM (arg1
))));
5180 else if (SCM_REALP (arg1
))
5182 RETURN (scm_from_double (SCM_DSUBRF (proc
) (SCM_REAL_VALUE (arg1
))));
5184 else if (SCM_BIGP (arg1
))
5186 RETURN (scm_from_double (SCM_DSUBRF (proc
) (scm_i_big2dbl (arg1
))));
5188 else if (SCM_FRACTIONP (arg1
))
5190 RETURN (scm_from_double (SCM_DSUBRF (proc
) (scm_i_fraction2double (arg1
))));
5192 SCM_WTA_DISPATCH_1 (*SCM_SUBR_GENERIC (proc
), arg1
,
5193 SCM_ARG1
, scm_i_symbol_chars (SCM_SNAME (proc
)));
5197 call_cxr_1 (SCM proc
, SCM arg1
)
5199 return scm_i_chase_pairs (arg1
, (scm_t_bits
) SCM_SUBRF (proc
));
5203 call_closure_1 (SCM proc
, SCM arg1
)
5205 const SCM env
= SCM_EXTEND_ENV (SCM_CLOSURE_FORMALS (proc
),
5208 const SCM result
= scm_eval_body (SCM_CLOSURE_BODY (proc
), env
);
5213 scm_trampoline_1 (SCM proc
)
5215 scm_t_trampoline_1 trampoline
;
5220 switch (SCM_TYP7 (proc
))
5222 case scm_tc7_subr_1
:
5223 case scm_tc7_subr_1o
:
5224 trampoline
= call_subr1_1
;
5226 case scm_tc7_subr_2o
:
5227 trampoline
= call_subr2o_1
;
5230 trampoline
= call_lsubr_1
;
5233 trampoline
= call_dsubr_1
;
5236 trampoline
= call_cxr_1
;
5238 case scm_tcs_closures
:
5240 SCM formals
= SCM_CLOSURE_FORMALS (proc
);
5241 if (!scm_is_null (formals
)
5242 && (!scm_is_pair (formals
) || !scm_is_pair (SCM_CDR (formals
))))
5243 trampoline
= call_closure_1
;
5248 case scm_tcs_struct
:
5249 if (SCM_OBJ_CLASS_FLAGS (proc
) & SCM_CLASSF_PURE_GENERIC
)
5250 trampoline
= scm_call_generic_1
;
5251 else if (SCM_I_OPERATORP (proc
))
5252 trampoline
= scm_call_1
;
5257 if (SCM_SMOB_APPLICABLE_P (proc
))
5258 trampoline
= SCM_SMOB_DESCRIPTOR (proc
).apply_1
;
5263 case scm_tc7_rpsubr
:
5266 trampoline
= scm_call_1
;
5269 return NULL
; /* not applicable on one arg */
5271 /* We only reach this point if a valid trampoline was determined. */
5273 /* If debugging is enabled, we want to see all calls to proc on the stack.
5274 * Thus, we replace the trampoline shortcut with scm_call_1. */
5275 if (scm_debug_mode_p
)
5282 call_subr2_2 (SCM proc
, SCM arg1
, SCM arg2
)
5284 return SCM_SUBRF (proc
) (arg1
, arg2
);
5288 call_lsubr2_2 (SCM proc
, SCM arg1
, SCM arg2
)
5290 return SCM_SUBRF (proc
) (arg1
, arg2
, SCM_EOL
);
5294 call_lsubr_2 (SCM proc
, SCM arg1
, SCM arg2
)
5296 return SCM_SUBRF (proc
) (scm_list_2 (arg1
, arg2
));
5300 call_closure_2 (SCM proc
, SCM arg1
, SCM arg2
)
5302 const SCM env
= SCM_EXTEND_ENV (SCM_CLOSURE_FORMALS (proc
),
5303 scm_list_2 (arg1
, arg2
),
5305 const SCM result
= scm_eval_body (SCM_CLOSURE_BODY (proc
), env
);
5310 scm_trampoline_2 (SCM proc
)
5312 scm_t_trampoline_2 trampoline
;
5317 switch (SCM_TYP7 (proc
))
5319 case scm_tc7_subr_2
:
5320 case scm_tc7_subr_2o
:
5321 case scm_tc7_rpsubr
:
5323 trampoline
= call_subr2_2
;
5325 case scm_tc7_lsubr_2
:
5326 trampoline
= call_lsubr2_2
;
5329 trampoline
= call_lsubr_2
;
5331 case scm_tcs_closures
:
5333 SCM formals
= SCM_CLOSURE_FORMALS (proc
);
5334 if (!scm_is_null (formals
)
5335 && (!scm_is_pair (formals
)
5336 || (!scm_is_null (SCM_CDR (formals
))
5337 && (!scm_is_pair (SCM_CDR (formals
))
5338 || !scm_is_pair (SCM_CDDR (formals
))))))
5339 trampoline
= call_closure_2
;
5344 case scm_tcs_struct
:
5345 if (SCM_OBJ_CLASS_FLAGS (proc
) & SCM_CLASSF_PURE_GENERIC
)
5346 trampoline
= scm_call_generic_2
;
5347 else if (SCM_I_OPERATORP (proc
))
5348 trampoline
= scm_call_2
;
5353 if (SCM_SMOB_APPLICABLE_P (proc
))
5354 trampoline
= SCM_SMOB_DESCRIPTOR (proc
).apply_2
;
5360 trampoline
= scm_call_2
;
5363 return NULL
; /* not applicable on two args */
5365 /* We only reach this point if a valid trampoline was determined. */
5367 /* If debugging is enabled, we want to see all calls to proc on the stack.
5368 * Thus, we replace the trampoline shortcut with scm_call_2. */
5369 if (scm_debug_mode_p
)
5375 /* Typechecking for multi-argument MAP and FOR-EACH.
5377 Verify that each element of the vector ARGV, except for the first,
5378 is a proper list whose length is LEN. Attribute errors to WHO,
5379 and claim that the i'th element of ARGV is WHO's i+2'th argument. */
5381 check_map_args (SCM argv
,
5390 for (i
= SCM_SIMPLE_VECTOR_LENGTH (argv
) - 1; i
>= 1; i
--)
5392 SCM elt
= SCM_SIMPLE_VECTOR_REF (argv
, i
);
5393 long elt_len
= scm_ilength (elt
);
5398 scm_apply_generic (gf
, scm_cons (proc
, args
));
5400 scm_wrong_type_arg (who
, i
+ 2, elt
);
5404 scm_out_of_range_pos (who
, elt
, scm_from_long (i
+ 2));
5409 SCM_GPROC (s_map
, "map", 2, 0, 1, scm_map
, g_map
);
5411 /* Note: Currently, scm_map applies PROC to the argument list(s)
5412 sequentially, starting with the first element(s). This is used in
5413 evalext.c where the Scheme procedure `map-in-order', which guarantees
5414 sequential behaviour, is implemented using scm_map. If the
5415 behaviour changes, we need to update `map-in-order'.
5419 scm_map (SCM proc
, SCM arg1
, SCM args
)
5420 #define FUNC_NAME s_map
5426 len
= scm_ilength (arg1
);
5427 SCM_GASSERTn (len
>= 0,
5428 g_map
, scm_cons2 (proc
, arg1
, args
), SCM_ARG2
, s_map
);
5429 SCM_VALIDATE_REST_ARGUMENT (args
);
5430 if (scm_is_null (args
))
5432 scm_t_trampoline_1 call
= scm_trampoline_1 (proc
);
5433 SCM_GASSERT2 (call
, g_map
, proc
, arg1
, SCM_ARG1
, s_map
);
5434 while (SCM_NIMP (arg1
))
5436 *pres
= scm_list_1 (call (proc
, SCM_CAR (arg1
)));
5437 pres
= SCM_CDRLOC (*pres
);
5438 arg1
= SCM_CDR (arg1
);
5442 if (scm_is_null (SCM_CDR (args
)))
5444 SCM arg2
= SCM_CAR (args
);
5445 int len2
= scm_ilength (arg2
);
5446 scm_t_trampoline_2 call
= scm_trampoline_2 (proc
);
5448 g_map
, scm_cons2 (proc
, arg1
, args
), SCM_ARG1
, s_map
);
5449 SCM_GASSERTn (len2
>= 0,
5450 g_map
, scm_cons2 (proc
, arg1
, args
), SCM_ARG3
, s_map
);
5452 SCM_OUT_OF_RANGE (3, arg2
);
5453 while (SCM_NIMP (arg1
))
5455 *pres
= scm_list_1 (call (proc
, SCM_CAR (arg1
), SCM_CAR (arg2
)));
5456 pres
= SCM_CDRLOC (*pres
);
5457 arg1
= SCM_CDR (arg1
);
5458 arg2
= SCM_CDR (arg2
);
5462 arg1
= scm_cons (arg1
, args
);
5463 args
= scm_vector (arg1
);
5464 check_map_args (args
, len
, g_map
, proc
, arg1
, s_map
);
5468 for (i
= SCM_SIMPLE_VECTOR_LENGTH (args
) - 1; i
>= 0; i
--)
5470 SCM elt
= SCM_SIMPLE_VECTOR_REF (args
, i
);
5473 arg1
= scm_cons (SCM_CAR (elt
), arg1
);
5474 SCM_SIMPLE_VECTOR_SET (args
, i
, SCM_CDR (elt
));
5476 *pres
= scm_list_1 (scm_apply (proc
, arg1
, SCM_EOL
));
5477 pres
= SCM_CDRLOC (*pres
);
5483 SCM_GPROC (s_for_each
, "for-each", 2, 0, 1, scm_for_each
, g_for_each
);
5486 scm_for_each (SCM proc
, SCM arg1
, SCM args
)
5487 #define FUNC_NAME s_for_each
5490 len
= scm_ilength (arg1
);
5491 SCM_GASSERTn (len
>= 0, g_for_each
, scm_cons2 (proc
, arg1
, args
),
5492 SCM_ARG2
, s_for_each
);
5493 SCM_VALIDATE_REST_ARGUMENT (args
);
5494 if (scm_is_null (args
))
5496 scm_t_trampoline_1 call
= scm_trampoline_1 (proc
);
5497 SCM_GASSERT2 (call
, g_for_each
, proc
, arg1
, SCM_ARG1
, s_for_each
);
5498 while (SCM_NIMP (arg1
))
5500 call (proc
, SCM_CAR (arg1
));
5501 arg1
= SCM_CDR (arg1
);
5503 return SCM_UNSPECIFIED
;
5505 if (scm_is_null (SCM_CDR (args
)))
5507 SCM arg2
= SCM_CAR (args
);
5508 int len2
= scm_ilength (arg2
);
5509 scm_t_trampoline_2 call
= scm_trampoline_2 (proc
);
5510 SCM_GASSERTn (call
, g_for_each
,
5511 scm_cons2 (proc
, arg1
, args
), SCM_ARG1
, s_for_each
);
5512 SCM_GASSERTn (len2
>= 0, g_for_each
,
5513 scm_cons2 (proc
, arg1
, args
), SCM_ARG3
, s_for_each
);
5515 SCM_OUT_OF_RANGE (3, arg2
);
5516 while (SCM_NIMP (arg1
))
5518 call (proc
, SCM_CAR (arg1
), SCM_CAR (arg2
));
5519 arg1
= SCM_CDR (arg1
);
5520 arg2
= SCM_CDR (arg2
);
5522 return SCM_UNSPECIFIED
;
5524 arg1
= scm_cons (arg1
, args
);
5525 args
= scm_vector (arg1
);
5526 check_map_args (args
, len
, g_for_each
, proc
, arg1
, s_for_each
);
5530 for (i
= SCM_SIMPLE_VECTOR_LENGTH (args
) - 1; i
>= 0; i
--)
5532 SCM elt
= SCM_SIMPLE_VECTOR_REF (args
, i
);
5534 return SCM_UNSPECIFIED
;
5535 arg1
= scm_cons (SCM_CAR (elt
), arg1
);
5536 SCM_SIMPLE_VECTOR_SET (args
, i
, SCM_CDR (elt
));
5538 scm_apply (proc
, arg1
, SCM_EOL
);
5545 scm_closure (SCM code
, SCM env
)
5548 SCM closcar
= scm_cons (code
, SCM_EOL
);
5549 z
= scm_cell (SCM_UNPACK (closcar
) + scm_tc3_closure
, (scm_t_bits
) env
);
5550 scm_remember_upto_here (closcar
);
5555 scm_t_bits scm_tc16_promise
;
5558 scm_makprom (SCM code
)
5560 SCM_RETURN_NEWSMOB2 (scm_tc16_promise
,
5562 scm_make_rec_mutex ());
5566 promise_free (SCM promise
)
5568 scm_rec_mutex_free (SCM_PROMISE_MUTEX (promise
));
5573 promise_print (SCM exp
, SCM port
, scm_print_state
*pstate
)
5575 int writingp
= SCM_WRITINGP (pstate
);
5576 scm_puts ("#<promise ", port
);
5577 SCM_SET_WRITINGP (pstate
, 1);
5578 scm_iprin1 (SCM_PROMISE_DATA (exp
), port
, pstate
);
5579 SCM_SET_WRITINGP (pstate
, writingp
);
5580 scm_putc ('>', port
);
5584 SCM_DEFINE (scm_force
, "force", 1, 0, 0,
5586 "If the promise @var{x} has not been computed yet, compute and\n"
5587 "return @var{x}, otherwise just return the previously computed\n"
5589 #define FUNC_NAME s_scm_force
5591 SCM_VALIDATE_SMOB (1, promise
, promise
);
5592 scm_rec_mutex_lock (SCM_PROMISE_MUTEX (promise
));
5593 if (!SCM_PROMISE_COMPUTED_P (promise
))
5595 SCM ans
= scm_call_0 (SCM_PROMISE_DATA (promise
));
5596 if (!SCM_PROMISE_COMPUTED_P (promise
))
5598 SCM_SET_PROMISE_DATA (promise
, ans
);
5599 SCM_SET_PROMISE_COMPUTED (promise
);
5602 scm_rec_mutex_unlock (SCM_PROMISE_MUTEX (promise
));
5603 return SCM_PROMISE_DATA (promise
);
5608 SCM_DEFINE (scm_promise_p
, "promise?", 1, 0, 0,
5610 "Return true if @var{obj} is a promise, i.e. a delayed computation\n"
5611 "(@pxref{Delayed evaluation,,,r5rs.info,The Revised^5 Report on Scheme}).")
5612 #define FUNC_NAME s_scm_promise_p
5614 return scm_from_bool (SCM_TYP16_PREDICATE (scm_tc16_promise
, obj
));
5619 SCM_DEFINE (scm_cons_source
, "cons-source", 3, 0, 0,
5620 (SCM xorig
, SCM x
, SCM y
),
5621 "Create and return a new pair whose car and cdr are @var{x} and @var{y}.\n"
5622 "Any source properties associated with @var{xorig} are also associated\n"
5623 "with the new pair.")
5624 #define FUNC_NAME s_scm_cons_source
5627 z
= scm_cons (x
, y
);
5628 /* Copy source properties possibly associated with xorig. */
5629 p
= scm_whash_lookup (scm_source_whash
, xorig
);
5630 if (scm_is_true (p
))
5631 scm_whash_insert (scm_source_whash
, z
, p
);
5637 /* The function scm_copy_tree is used to copy an expression tree to allow the
5638 * memoizer to modify the expression during memoization. scm_copy_tree
5639 * creates deep copies of pairs and vectors, but not of any other data types,
5640 * since only pairs and vectors will be parsed by the memoizer.
5642 * To avoid infinite recursion due to cyclic structures, the hare-and-tortoise
5643 * pattern is used to detect cycles. In fact, the pattern is used in two
5644 * dimensions, vertical (indicated in the code by the variable names 'hare'
5645 * and 'tortoise') and horizontal ('rabbit' and 'turtle'). In both
5646 * dimensions, the hare/rabbit will take two steps when the tortoise/turtle
5649 * The vertical dimension corresponds to recursive calls to function
5650 * copy_tree: This happens when descending into vector elements, into cars of
5651 * lists and into the cdr of an improper list. In this dimension, the
5652 * tortoise follows the hare by using the processor stack: Every stack frame
5653 * will hold an instance of struct t_trace. These instances are connected in
5654 * a way that represents the trace of the hare, which thus can be followed by
5655 * the tortoise. The tortoise will always point to struct t_trace instances
5656 * relating to SCM objects that have already been copied. Thus, a cycle is
5657 * detected if the tortoise and the hare point to the same object,
5659 * The horizontal dimension is within one execution of copy_tree, when the
5660 * function cdr's along the pairs of a list. This is the standard
5661 * hare-and-tortoise implementation, found several times in guile. */
5664 struct t_trace
*trace
; // These pointers form a trace along the stack.
5665 SCM obj
; // The object handled at the respective stack frame.
5670 struct t_trace
*const hare
,
5671 struct t_trace
*tortoise
,
5672 unsigned int tortoise_delay
)
5674 if (!scm_is_pair (hare
->obj
) && !scm_is_simple_vector (hare
->obj
))
5680 /* Prepare the trace along the stack. */
5681 struct t_trace new_hare
;
5682 hare
->trace
= &new_hare
;
5684 /* The tortoise will make its step after the delay has elapsed. Note
5685 * that in contrast to the typical hare-and-tortoise pattern, the step
5686 * of the tortoise happens before the hare takes its steps. This is, in
5687 * principle, no problem, except for the start of the algorithm: Then,
5688 * it has to be made sure that the hare actually gets its advantage of
5690 if (tortoise_delay
== 0)
5693 tortoise
= tortoise
->trace
;
5694 ASSERT_SYNTAX (!scm_is_eq (hare
->obj
, tortoise
->obj
),
5695 s_bad_expression
, hare
->obj
);
5702 if (scm_is_simple_vector (hare
->obj
))
5704 size_t length
= SCM_SIMPLE_VECTOR_LENGTH (hare
->obj
);
5705 SCM new_vector
= scm_c_make_vector (length
, SCM_UNSPECIFIED
);
5707 /* Each vector element is copied by recursing into copy_tree, having
5708 * the tortoise follow the hare into the depths of the stack. */
5709 unsigned long int i
;
5710 for (i
= 0; i
< length
; ++i
)
5713 new_hare
.obj
= SCM_SIMPLE_VECTOR_REF (hare
->obj
, i
);
5714 new_element
= copy_tree (&new_hare
, tortoise
, tortoise_delay
);
5715 SCM_SIMPLE_VECTOR_SET (new_vector
, i
, new_element
);
5720 else // scm_is_pair (hare->obj)
5725 SCM rabbit
= hare
->obj
;
5726 SCM turtle
= hare
->obj
;
5730 /* The first pair of the list is treated specially, in order to
5731 * preserve a potential source code position. */
5732 result
= tail
= scm_cons_source (rabbit
, SCM_EOL
, SCM_EOL
);
5733 new_hare
.obj
= SCM_CAR (rabbit
);
5734 copy
= copy_tree (&new_hare
, tortoise
, tortoise_delay
);
5735 SCM_SETCAR (tail
, copy
);
5737 /* The remaining pairs of the list are copied by, horizontally,
5738 * having the turtle follow the rabbit, and, vertically, having the
5739 * tortoise follow the hare into the depths of the stack. */
5740 rabbit
= SCM_CDR (rabbit
);
5741 while (scm_is_pair (rabbit
))
5743 new_hare
.obj
= SCM_CAR (rabbit
);
5744 copy
= copy_tree (&new_hare
, tortoise
, tortoise_delay
);
5745 SCM_SETCDR (tail
, scm_cons (copy
, SCM_UNDEFINED
));
5746 tail
= SCM_CDR (tail
);
5748 rabbit
= SCM_CDR (rabbit
);
5749 if (scm_is_pair (rabbit
))
5751 new_hare
.obj
= SCM_CAR (rabbit
);
5752 copy
= copy_tree (&new_hare
, tortoise
, tortoise_delay
);
5753 SCM_SETCDR (tail
, scm_cons (copy
, SCM_UNDEFINED
));
5754 tail
= SCM_CDR (tail
);
5755 rabbit
= SCM_CDR (rabbit
);
5757 turtle
= SCM_CDR (turtle
);
5758 ASSERT_SYNTAX (!scm_is_eq (rabbit
, turtle
),
5759 s_bad_expression
, rabbit
);
5763 /* We have to recurse into copy_tree again for the last cdr, in
5764 * order to handle the situation that it holds a vector. */
5765 new_hare
.obj
= rabbit
;
5766 copy
= copy_tree (&new_hare
, tortoise
, tortoise_delay
);
5767 SCM_SETCDR (tail
, copy
);
5774 SCM_DEFINE (scm_copy_tree
, "copy-tree", 1, 0, 0,
5776 "Recursively copy the data tree that is bound to @var{obj}, and return a\n"
5777 "the new data structure. @code{copy-tree} recurses down the\n"
5778 "contents of both pairs and vectors (since both cons cells and vector\n"
5779 "cells may point to arbitrary objects), and stops recursing when it hits\n"
5780 "any other object.")
5781 #define FUNC_NAME s_scm_copy_tree
5783 /* Prepare the trace along the stack. */
5784 struct t_trace trace
;
5787 /* In function copy_tree, if the tortoise makes its step, it will do this
5788 * before the hare has the chance to move. Thus, we have to make sure that
5789 * the very first step of the tortoise will not happen after the hare has
5790 * really made two steps. This is achieved by passing '2' as the initial
5791 * delay for the tortoise. NOTE: Since cycles are unlikely, giving the hare
5792 * a bigger advantage may improve performance slightly. */
5793 return copy_tree (&trace
, &trace
, 2);
5798 /* We have three levels of EVAL here:
5800 - scm_i_eval (exp, env)
5802 evaluates EXP in environment ENV. ENV is a lexical environment
5803 structure as used by the actual tree code evaluator. When ENV is
5804 a top-level environment, then changes to the current module are
5805 tracked by updating ENV so that it continues to be in sync with
5808 - scm_primitive_eval (exp)
5810 evaluates EXP in the top-level environment as determined by the
5811 current module. This is done by constructing a suitable
5812 environment and calling scm_i_eval. Thus, changes to the
5813 top-level module are tracked normally.
5815 - scm_eval (exp, mod)
5817 evaluates EXP while MOD is the current module. This is done by
5818 setting the current module to MOD, invoking scm_primitive_eval on
5819 EXP, and then restoring the current module to the value it had
5820 previously. That is, while EXP is evaluated, changes to the
5821 current module are tracked, but these changes do not persist when
5824 For each level of evals, there are two variants, distinguished by a
5825 _x suffix: the ordinary variant does not modify EXP while the _x
5826 variant can destructively modify EXP into something completely
5827 unintelligible. A Scheme data structure passed as EXP to one of the
5828 _x variants should not ever be used again for anything. So when in
5829 doubt, use the ordinary variant.
5834 scm_i_eval_x (SCM exp
, SCM env
)
5836 if (scm_is_symbol (exp
))
5837 return *scm_lookupcar (scm_cons (exp
, SCM_UNDEFINED
), env
, 1);
5839 return SCM_I_XEVAL (exp
, env
);
5843 scm_i_eval (SCM exp
, SCM env
)
5845 exp
= scm_copy_tree (exp
);
5846 if (scm_is_symbol (exp
))
5847 return *scm_lookupcar (scm_cons (exp
, SCM_UNDEFINED
), env
, 1);
5849 return SCM_I_XEVAL (exp
, env
);
5853 scm_primitive_eval_x (SCM exp
)
5856 SCM transformer
= scm_current_module_transformer ();
5857 if (SCM_NIMP (transformer
))
5858 exp
= scm_call_1 (transformer
, exp
);
5859 env
= scm_top_level_env (scm_current_module_lookup_closure ());
5860 return scm_i_eval_x (exp
, env
);
5863 SCM_DEFINE (scm_primitive_eval
, "primitive-eval", 1, 0, 0,
5865 "Evaluate @var{exp} in the top-level environment specified by\n"
5866 "the current module.")
5867 #define FUNC_NAME s_scm_primitive_eval
5870 SCM transformer
= scm_current_module_transformer ();
5871 if (scm_is_true (transformer
))
5872 exp
= scm_call_1 (transformer
, exp
);
5873 env
= scm_top_level_env (scm_current_module_lookup_closure ());
5874 return scm_i_eval (exp
, env
);
5879 /* Eval does not take the second arg optionally. This is intentional
5880 * in order to be R5RS compatible, and to prepare for the new module
5881 * system, where we would like to make the choice of evaluation
5882 * environment explicit. */
5885 change_environment (void *data
)
5887 SCM pair
= SCM_PACK (data
);
5888 SCM new_module
= SCM_CAR (pair
);
5889 SCM old_module
= scm_current_module ();
5890 SCM_SETCDR (pair
, old_module
);
5891 scm_set_current_module (new_module
);
5895 restore_environment (void *data
)
5897 SCM pair
= SCM_PACK (data
);
5898 SCM old_module
= SCM_CDR (pair
);
5899 SCM new_module
= scm_current_module ();
5900 SCM_SETCAR (pair
, new_module
);
5901 scm_set_current_module (old_module
);
5905 inner_eval_x (void *data
)
5907 return scm_primitive_eval_x (SCM_PACK(data
));
5911 scm_eval_x (SCM exp
, SCM module
)
5912 #define FUNC_NAME "eval!"
5914 SCM_VALIDATE_MODULE (2, module
);
5916 return scm_internal_dynamic_wind
5917 (change_environment
, inner_eval_x
, restore_environment
,
5918 (void *) SCM_UNPACK (exp
),
5919 (void *) SCM_UNPACK (scm_cons (module
, SCM_BOOL_F
)));
5924 inner_eval (void *data
)
5926 return scm_primitive_eval (SCM_PACK(data
));
5929 SCM_DEFINE (scm_eval
, "eval", 2, 0, 0,
5930 (SCM exp
, SCM module
),
5931 "Evaluate @var{exp}, a list representing a Scheme expression,\n"
5932 "in the top-level environment specified by @var{module}.\n"
5933 "While @var{exp} is evaluated (using @code{primitive-eval}),\n"
5934 "@var{module} is made the current module. The current module\n"
5935 "is reset to its previous value when @var{eval} returns.")
5936 #define FUNC_NAME s_scm_eval
5938 SCM_VALIDATE_MODULE (2, module
);
5940 return scm_internal_dynamic_wind
5941 (change_environment
, inner_eval
, restore_environment
,
5942 (void *) SCM_UNPACK (exp
),
5943 (void *) SCM_UNPACK (scm_cons (module
, SCM_BOOL_F
)));
5948 /* At this point, deval and scm_dapply are generated.
5955 #if (SCM_ENABLE_DEPRECATED == 1)
5957 /* Deprecated in guile 1.7.0 on 2004-03-29. */
5958 SCM
scm_ceval (SCM x
, SCM env
)
5960 if (scm_is_pair (x
))
5961 return ceval (x
, env
);
5962 else if (scm_is_symbol (x
))
5963 return *scm_lookupcar (scm_cons (x
, SCM_UNDEFINED
), env
, 1);
5965 return SCM_I_XEVAL (x
, env
);
5968 /* Deprecated in guile 1.7.0 on 2004-03-29. */
5969 SCM
scm_deval (SCM x
, SCM env
)
5971 if (scm_is_pair (x
))
5972 return deval (x
, env
);
5973 else if (scm_is_symbol (x
))
5974 return *scm_lookupcar (scm_cons (x
, SCM_UNDEFINED
), env
, 1);
5976 return SCM_I_XEVAL (x
, env
);
5980 dispatching_eval (SCM x
, SCM env
)
5982 if (scm_debug_mode_p
)
5983 return scm_deval (x
, env
);
5985 return scm_ceval (x
, env
);
5988 /* Deprecated in guile 1.7.0 on 2004-03-29. */
5989 SCM (*scm_ceval_ptr
) (SCM x
, SCM env
) = dispatching_eval
;
5997 scm_init_opts (scm_evaluator_traps
,
5998 scm_evaluator_trap_table
,
5999 SCM_N_EVALUATOR_TRAPS
);
6000 scm_init_opts (scm_eval_options_interface
,
6002 SCM_N_EVAL_OPTIONS
);
6004 scm_tc16_promise
= scm_make_smob_type ("promise", 0);
6005 scm_set_smob_mark (scm_tc16_promise
, scm_markcdr
);
6006 scm_set_smob_free (scm_tc16_promise
, promise_free
);
6007 scm_set_smob_print (scm_tc16_promise
, promise_print
);
6009 undefineds
= scm_list_1 (SCM_UNDEFINED
);
6010 SCM_SETCDR (undefineds
, undefineds
);
6011 scm_permanent_object (undefineds
);
6013 scm_listofnull
= scm_list_1 (SCM_EOL
);
6015 f_apply
= scm_c_define_subr ("apply", scm_tc7_lsubr_2
, scm_apply
);
6016 scm_permanent_object (f_apply
);
6018 #include "libguile/eval.x"
6020 scm_add_feature ("delay");