Commit | Line | Data |
---|---|---|
b8d4c8d0 GM |
1 | @c -*-texinfo-*- |
2 | @c This is part of the GNU Emacs Lisp Reference Manual. | |
73b0cd50 | 3 | @c Copyright (C) 1990-1994, 1998, 2001-2011 Free Software Foundation, Inc. |
b8d4c8d0 | 4 | @c See the file elisp.texi for copying conditions. |
6336d8c3 | 5 | @setfilename ../../info/eval |
b8d4c8d0 GM |
6 | @node Evaluation, Control Structures, Symbols, Top |
7 | @chapter Evaluation | |
8 | @cindex evaluation | |
9 | @cindex interpreter | |
10 | @cindex interpreter | |
11 | @cindex value of expression | |
12 | ||
13 | The @dfn{evaluation} of expressions in Emacs Lisp is performed by the | |
14 | @dfn{Lisp interpreter}---a program that receives a Lisp object as input | |
15 | and computes its @dfn{value as an expression}. How it does this depends | |
16 | on the data type of the object, according to rules described in this | |
17 | chapter. The interpreter runs automatically to evaluate portions of | |
18 | your program, but can also be called explicitly via the Lisp primitive | |
19 | function @code{eval}. | |
20 | ||
21 | @ifnottex | |
22 | @menu | |
23 | * Intro Eval:: Evaluation in the scheme of things. | |
24 | * Forms:: How various sorts of objects are evaluated. | |
25 | * Quoting:: Avoiding evaluation (to put constants in the program). | |
26 | * Eval:: How to invoke the Lisp interpreter explicitly. | |
27 | @end menu | |
28 | ||
29 | @node Intro Eval | |
30 | @section Introduction to Evaluation | |
31 | ||
a5b99fab CY |
32 | The Lisp interpreter, or evaluator, is the part of Emacs that |
33 | computes the value of an expression that is given to it. When a | |
34 | function written in Lisp is called, the evaluator computes the value | |
35 | of the function by evaluating the expressions in the function body. | |
36 | Thus, running any Lisp program really means running the Lisp | |
37 | interpreter. | |
b8d4c8d0 GM |
38 | @end ifnottex |
39 | ||
a5b99fab | 40 | @cindex form |
b8d4c8d0 GM |
41 | @cindex expression |
42 | A Lisp object that is intended for evaluation is called an | |
a5b99fab | 43 | @dfn{expression} or a @dfn{form}. The fact that forms are data |
b8d4c8d0 GM |
44 | objects and not merely text is one of the fundamental differences |
45 | between Lisp-like languages and typical programming languages. Any | |
46 | object can be evaluated, but in practice only numbers, symbols, lists | |
47 | and strings are evaluated very often. | |
48 | ||
a5b99fab CY |
49 | In subsequent sections, we will describe the details of what |
50 | evaluation means for each kind of form. | |
51 | ||
52 | It is very common to read a Lisp form and then evaluate the form, | |
53 | but reading and evaluation are separate activities, and either can be | |
54 | performed alone. Reading per se does not evaluate anything; it | |
55 | converts the printed representation of a Lisp object to the object | |
56 | itself. It is up to the caller of @code{read} to specify whether this | |
b8d4c8d0 GM |
57 | object is a form to be evaluated, or serves some entirely different |
58 | purpose. @xref{Input Functions}. | |
59 | ||
b8d4c8d0 | 60 | @cindex recursive evaluation |
a5b99fab CY |
61 | Evaluation is a recursive process, and evaluating a form often |
62 | involves evaluating parts within that form. For instance, when you | |
63 | evaluate a @dfn{function call} form such as @code{(car x)}, Emacs | |
64 | first evaluates the argument (the subform @code{x}). After evaluating | |
65 | the argument, Emacs @dfn{executes} the function (@code{car}), and if | |
66 | the function is written in Lisp, execution works by evaluating the | |
67 | @dfn{body} of the function. (In this example, however, @code{car} is | |
68 | not a Lisp function; it is a primitive function implemented in C.) | |
69 | @xref{Functions}, for more information about functions and function | |
70 | calls. | |
b8d4c8d0 GM |
71 | |
72 | @cindex environment | |
a5b99fab CY |
73 | Evaluation takes place in a context called the @dfn{environment}, |
74 | which consists of the current values and bindings of all Lisp | |
75 | variables (@pxref{Variables}).@footnote{This definition of | |
76 | ``environment'' is specifically not intended to include all the data | |
77 | that can affect the result of a program.} Whenever a form refers to a | |
78 | variable without creating a new binding for it, the variable evaluates | |
79 | to the value given by the current environment. Evaluating a form may | |
80 | create a new environment for recursive evaluation, by binding | |
81 | variables (@pxref{Local Variables}). Such environments are temporary, | |
82 | and vanish when the evaluation of the form is complete. | |
b8d4c8d0 GM |
83 | |
84 | @cindex side effect | |
a5b99fab CY |
85 | Evaluating a form may also make changes that persist; these changes |
86 | are called @dfn{side effects}. An example of a form that produces a | |
87 | side effect is @code{(setq foo 1)}. | |
b8d4c8d0 | 88 | |
a5b99fab CY |
89 | Do not confuse evaluation with command key interpretation. The |
90 | editor command loop translates keyboard input into a command (an | |
91 | interactively callable function) using the active keymaps, and then | |
92 | uses @code{call-interactively} to execute that command. Executing the | |
93 | command usually involves evaluation, if the command is written in | |
94 | Lisp; however, this step is not considered a part of command key | |
95 | interpretation. @xref{Command Loop}. | |
b8d4c8d0 GM |
96 | |
97 | @node Forms | |
98 | @section Kinds of Forms | |
99 | ||
100 | A Lisp object that is intended to be evaluated is called a @dfn{form}. | |
101 | How Emacs evaluates a form depends on its data type. Emacs has three | |
102 | different kinds of form that are evaluated differently: symbols, lists, | |
103 | and ``all other types.'' This section describes all three kinds, one by | |
104 | one, starting with the ``all other types'' which are self-evaluating | |
105 | forms. | |
106 | ||
107 | @menu | |
108 | * Self-Evaluating Forms:: Forms that evaluate to themselves. | |
109 | * Symbol Forms:: Symbols evaluate as variables. | |
110 | * Classifying Lists:: How to distinguish various sorts of list forms. | |
111 | * Function Indirection:: When a symbol appears as the car of a list, | |
d24880de | 112 | we find the real function via the symbol. |
b8d4c8d0 GM |
113 | * Function Forms:: Forms that call functions. |
114 | * Macro Forms:: Forms that call macros. | |
115 | * Special Forms:: "Special forms" are idiosyncratic primitives, | |
116 | most of them extremely important. | |
117 | * Autoloading:: Functions set up to load files | |
118 | containing their real definitions. | |
119 | @end menu | |
120 | ||
121 | @node Self-Evaluating Forms | |
122 | @subsection Self-Evaluating Forms | |
123 | @cindex vector evaluation | |
124 | @cindex literal evaluation | |
125 | @cindex self-evaluating form | |
126 | ||
a5b99fab CY |
127 | A @dfn{self-evaluating form} is any form that is not a list or |
128 | symbol. Self-evaluating forms evaluate to themselves: the result of | |
129 | evaluation is the same object that was evaluated. Thus, the number 25 | |
130 | evaluates to 25, and the string @code{"foo"} evaluates to the string | |
131 | @code{"foo"}. Likewise, evaluating a vector does not cause evaluation | |
132 | of the elements of the vector---it returns the same vector with its | |
133 | contents unchanged. | |
b8d4c8d0 GM |
134 | |
135 | @example | |
136 | @group | |
137 | '123 ; @r{A number, shown without evaluation.} | |
138 | @result{} 123 | |
139 | @end group | |
140 | @group | |
141 | 123 ; @r{Evaluated as usual---result is the same.} | |
142 | @result{} 123 | |
143 | @end group | |
144 | @group | |
145 | (eval '123) ; @r{Evaluated ``by hand''---result is the same.} | |
146 | @result{} 123 | |
147 | @end group | |
148 | @group | |
149 | (eval (eval '123)) ; @r{Evaluating twice changes nothing.} | |
150 | @result{} 123 | |
151 | @end group | |
152 | @end example | |
153 | ||
154 | It is common to write numbers, characters, strings, and even vectors | |
155 | in Lisp code, taking advantage of the fact that they self-evaluate. | |
156 | However, it is quite unusual to do this for types that lack a read | |
157 | syntax, because there's no way to write them textually. It is possible | |
158 | to construct Lisp expressions containing these types by means of a Lisp | |
159 | program. Here is an example: | |
160 | ||
161 | @example | |
162 | @group | |
163 | ;; @r{Build an expression containing a buffer object.} | |
164 | (setq print-exp (list 'print (current-buffer))) | |
165 | @result{} (print #<buffer eval.texi>) | |
166 | @end group | |
167 | @group | |
168 | ;; @r{Evaluate it.} | |
169 | (eval print-exp) | |
170 | @print{} #<buffer eval.texi> | |
171 | @result{} #<buffer eval.texi> | |
172 | @end group | |
173 | @end example | |
174 | ||
175 | @node Symbol Forms | |
176 | @subsection Symbol Forms | |
177 | @cindex symbol evaluation | |
178 | ||
179 | When a symbol is evaluated, it is treated as a variable. The result | |
180 | is the variable's value, if it has one. If it has none (if its value | |
181 | cell is void), an error is signaled. For more information on the use of | |
182 | variables, see @ref{Variables}. | |
183 | ||
184 | In the following example, we set the value of a symbol with | |
185 | @code{setq}. Then we evaluate the symbol, and get back the value that | |
186 | @code{setq} stored. | |
187 | ||
188 | @example | |
189 | @group | |
190 | (setq a 123) | |
191 | @result{} 123 | |
192 | @end group | |
193 | @group | |
194 | (eval 'a) | |
195 | @result{} 123 | |
196 | @end group | |
197 | @group | |
198 | a | |
199 | @result{} 123 | |
200 | @end group | |
201 | @end example | |
202 | ||
203 | The symbols @code{nil} and @code{t} are treated specially, so that the | |
204 | value of @code{nil} is always @code{nil}, and the value of @code{t} is | |
205 | always @code{t}; you cannot set or bind them to any other values. Thus, | |
206 | these two symbols act like self-evaluating forms, even though | |
207 | @code{eval} treats them like any other symbol. A symbol whose name | |
208 | starts with @samp{:} also self-evaluates in the same way; likewise, | |
209 | its value ordinarily cannot be changed. @xref{Constant Variables}. | |
210 | ||
211 | @node Classifying Lists | |
212 | @subsection Classification of List Forms | |
213 | @cindex list form evaluation | |
214 | ||
215 | A form that is a nonempty list is either a function call, a macro | |
216 | call, or a special form, according to its first element. These three | |
217 | kinds of forms are evaluated in different ways, described below. The | |
218 | remaining list elements constitute the @dfn{arguments} for the function, | |
219 | macro, or special form. | |
220 | ||
221 | The first step in evaluating a nonempty list is to examine its first | |
222 | element. This element alone determines what kind of form the list is | |
223 | and how the rest of the list is to be processed. The first element is | |
224 | @emph{not} evaluated, as it would be in some Lisp dialects such as | |
225 | Scheme. | |
226 | ||
227 | @node Function Indirection | |
228 | @subsection Symbol Function Indirection | |
229 | @cindex symbol function indirection | |
230 | @cindex indirection for functions | |
231 | @cindex void function | |
232 | ||
a5b99fab CY |
233 | If the first element of the list is a symbol then evaluation |
234 | examines the symbol's function cell, and uses its contents instead of | |
235 | the original symbol. If the contents are another symbol, this | |
236 | process, called @dfn{symbol function indirection}, is repeated until | |
237 | it obtains a non-symbol. @xref{Function Names}, for more information | |
238 | about symbol function indirection. | |
b8d4c8d0 GM |
239 | |
240 | One possible consequence of this process is an infinite loop, in the | |
241 | event that a symbol's function cell refers to the same symbol. Or a | |
242 | symbol may have a void function cell, in which case the subroutine | |
243 | @code{symbol-function} signals a @code{void-function} error. But if | |
244 | neither of these things happens, we eventually obtain a non-symbol, | |
245 | which ought to be a function or other suitable object. | |
246 | ||
247 | @kindex invalid-function | |
248 | More precisely, we should now have a Lisp function (a lambda | |
a5b99fab CY |
249 | expression), a byte-code function, a primitive function, a Lisp macro, |
250 | a special form, or an autoload object. Each of these types is a case | |
251 | described in one of the following sections. If the object is not one | |
252 | of these types, Emacs signals an @code{invalid-function} error. | |
b8d4c8d0 GM |
253 | |
254 | The following example illustrates the symbol indirection process. We | |
255 | use @code{fset} to set the function cell of a symbol and | |
256 | @code{symbol-function} to get the function cell contents | |
257 | (@pxref{Function Cells}). Specifically, we store the symbol @code{car} | |
258 | into the function cell of @code{first}, and the symbol @code{first} into | |
259 | the function cell of @code{erste}. | |
260 | ||
261 | @smallexample | |
262 | @group | |
263 | ;; @r{Build this function cell linkage:} | |
264 | ;; ------------- ----- ------- ------- | |
265 | ;; | #<subr car> | <-- | car | <-- | first | <-- | erste | | |
266 | ;; ------------- ----- ------- ------- | |
267 | @end group | |
268 | @end smallexample | |
269 | ||
270 | @smallexample | |
271 | @group | |
272 | (symbol-function 'car) | |
273 | @result{} #<subr car> | |
274 | @end group | |
275 | @group | |
276 | (fset 'first 'car) | |
277 | @result{} car | |
278 | @end group | |
279 | @group | |
280 | (fset 'erste 'first) | |
281 | @result{} first | |
282 | @end group | |
283 | @group | |
284 | (erste '(1 2 3)) ; @r{Call the function referenced by @code{erste}.} | |
285 | @result{} 1 | |
286 | @end group | |
287 | @end smallexample | |
288 | ||
289 | By contrast, the following example calls a function without any symbol | |
290 | function indirection, because the first element is an anonymous Lisp | |
291 | function, not a symbol. | |
292 | ||
293 | @smallexample | |
294 | @group | |
295 | ((lambda (arg) (erste arg)) | |
296 | '(1 2 3)) | |
297 | @result{} 1 | |
298 | @end group | |
299 | @end smallexample | |
300 | ||
301 | @noindent | |
302 | Executing the function itself evaluates its body; this does involve | |
303 | symbol function indirection when calling @code{erste}. | |
304 | ||
305 | The built-in function @code{indirect-function} provides an easy way to | |
306 | perform symbol function indirection explicitly. | |
307 | ||
308 | @c Emacs 19 feature | |
309 | @defun indirect-function function &optional noerror | |
310 | @anchor{Definition of indirect-function} | |
311 | This function returns the meaning of @var{function} as a function. If | |
312 | @var{function} is a symbol, then it finds @var{function}'s function | |
313 | definition and starts over with that value. If @var{function} is not a | |
314 | symbol, then it returns @var{function} itself. | |
315 | ||
316 | This function signals a @code{void-function} error if the final symbol | |
317 | is unbound and optional argument @var{noerror} is @code{nil} or | |
318 | omitted. Otherwise, if @var{noerror} is non-@code{nil}, it returns | |
319 | @code{nil} if the final symbol is unbound. | |
320 | ||
321 | It signals a @code{cyclic-function-indirection} error if there is a | |
322 | loop in the chain of symbols. | |
323 | ||
324 | Here is how you could define @code{indirect-function} in Lisp: | |
325 | ||
326 | @smallexample | |
327 | (defun indirect-function (function) | |
328 | (if (symbolp function) | |
329 | (indirect-function (symbol-function function)) | |
330 | function)) | |
331 | @end smallexample | |
332 | @end defun | |
333 | ||
334 | @node Function Forms | |
335 | @subsection Evaluation of Function Forms | |
336 | @cindex function form evaluation | |
337 | @cindex function call | |
338 | ||
339 | If the first element of a list being evaluated is a Lisp function | |
340 | object, byte-code object or primitive function object, then that list is | |
341 | a @dfn{function call}. For example, here is a call to the function | |
342 | @code{+}: | |
343 | ||
344 | @example | |
345 | (+ 1 x) | |
346 | @end example | |
347 | ||
348 | The first step in evaluating a function call is to evaluate the | |
349 | remaining elements of the list from left to right. The results are the | |
350 | actual argument values, one value for each list element. The next step | |
351 | is to call the function with this list of arguments, effectively using | |
352 | the function @code{apply} (@pxref{Calling Functions}). If the function | |
353 | is written in Lisp, the arguments are used to bind the argument | |
354 | variables of the function (@pxref{Lambda Expressions}); then the forms | |
355 | in the function body are evaluated in order, and the value of the last | |
356 | body form becomes the value of the function call. | |
357 | ||
358 | @node Macro Forms | |
359 | @subsection Lisp Macro Evaluation | |
360 | @cindex macro call evaluation | |
361 | ||
362 | If the first element of a list being evaluated is a macro object, then | |
363 | the list is a @dfn{macro call}. When a macro call is evaluated, the | |
364 | elements of the rest of the list are @emph{not} initially evaluated. | |
365 | Instead, these elements themselves are used as the arguments of the | |
366 | macro. The macro definition computes a replacement form, called the | |
367 | @dfn{expansion} of the macro, to be evaluated in place of the original | |
368 | form. The expansion may be any sort of form: a self-evaluating | |
369 | constant, a symbol, or a list. If the expansion is itself a macro call, | |
370 | this process of expansion repeats until some other sort of form results. | |
371 | ||
372 | Ordinary evaluation of a macro call finishes by evaluating the | |
373 | expansion. However, the macro expansion is not necessarily evaluated | |
374 | right away, or at all, because other programs also expand macro calls, | |
375 | and they may or may not evaluate the expansions. | |
376 | ||
377 | Normally, the argument expressions are not evaluated as part of | |
378 | computing the macro expansion, but instead appear as part of the | |
379 | expansion, so they are computed when the expansion is evaluated. | |
380 | ||
381 | For example, given a macro defined as follows: | |
382 | ||
383 | @example | |
384 | @group | |
385 | (defmacro cadr (x) | |
386 | (list 'car (list 'cdr x))) | |
387 | @end group | |
388 | @end example | |
389 | ||
390 | @noindent | |
391 | an expression such as @code{(cadr (assq 'handler list))} is a macro | |
392 | call, and its expansion is: | |
393 | ||
394 | @example | |
395 | (car (cdr (assq 'handler list))) | |
396 | @end example | |
397 | ||
398 | @noindent | |
399 | Note that the argument @code{(assq 'handler list)} appears in the | |
400 | expansion. | |
401 | ||
402 | @xref{Macros}, for a complete description of Emacs Lisp macros. | |
403 | ||
404 | @node Special Forms | |
405 | @subsection Special Forms | |
45e46036 EZ |
406 | @cindex special forms |
407 | @cindex evaluation of special forms | |
b8d4c8d0 GM |
408 | |
409 | A @dfn{special form} is a primitive function specially marked so that | |
410 | its arguments are not all evaluated. Most special forms define control | |
411 | structures or perform variable bindings---things which functions cannot | |
412 | do. | |
413 | ||
414 | Each special form has its own rules for which arguments are evaluated | |
415 | and which are used without evaluation. Whether a particular argument is | |
416 | evaluated may depend on the results of evaluating other arguments. | |
417 | ||
418 | Here is a list, in alphabetical order, of all of the special forms in | |
419 | Emacs Lisp with a reference to where each is described. | |
420 | ||
421 | @table @code | |
422 | @item and | |
423 | @pxref{Combining Conditions} | |
424 | ||
425 | @item catch | |
426 | @pxref{Catch and Throw} | |
427 | ||
428 | @item cond | |
429 | @pxref{Conditionals} | |
430 | ||
431 | @item condition-case | |
432 | @pxref{Handling Errors} | |
433 | ||
434 | @item defconst | |
435 | @pxref{Defining Variables} | |
436 | ||
437 | @item defmacro | |
438 | @pxref{Defining Macros} | |
439 | ||
440 | @item defun | |
441 | @pxref{Defining Functions} | |
442 | ||
443 | @item defvar | |
444 | @pxref{Defining Variables} | |
445 | ||
446 | @item function | |
447 | @pxref{Anonymous Functions} | |
448 | ||
449 | @item if | |
450 | @pxref{Conditionals} | |
451 | ||
452 | @item interactive | |
453 | @pxref{Interactive Call} | |
454 | ||
455 | @item let | |
456 | @itemx let* | |
457 | @pxref{Local Variables} | |
458 | ||
459 | @item or | |
460 | @pxref{Combining Conditions} | |
461 | ||
462 | @item prog1 | |
463 | @itemx prog2 | |
464 | @itemx progn | |
465 | @pxref{Sequencing} | |
466 | ||
467 | @item quote | |
468 | @pxref{Quoting} | |
469 | ||
470 | @item save-current-buffer | |
471 | @pxref{Current Buffer} | |
472 | ||
473 | @item save-excursion | |
474 | @pxref{Excursions} | |
475 | ||
476 | @item save-restriction | |
477 | @pxref{Narrowing} | |
478 | ||
479 | @item save-window-excursion | |
480 | @pxref{Window Configurations} | |
481 | ||
482 | @item setq | |
483 | @pxref{Setting Variables} | |
484 | ||
485 | @item setq-default | |
486 | @pxref{Creating Buffer-Local} | |
487 | ||
488 | @item track-mouse | |
489 | @pxref{Mouse Tracking} | |
490 | ||
491 | @item unwind-protect | |
492 | @pxref{Nonlocal Exits} | |
493 | ||
494 | @item while | |
495 | @pxref{Iteration} | |
496 | ||
497 | @item with-output-to-temp-buffer | |
498 | @pxref{Temporary Displays} | |
499 | @end table | |
500 | ||
501 | @cindex CL note---special forms compared | |
502 | @quotation | |
503 | @b{Common Lisp note:} Here are some comparisons of special forms in | |
504 | GNU Emacs Lisp and Common Lisp. @code{setq}, @code{if}, and | |
505 | @code{catch} are special forms in both Emacs Lisp and Common Lisp. | |
506 | @code{defun} is a special form in Emacs Lisp, but a macro in Common | |
507 | Lisp. @code{save-excursion} is a special form in Emacs Lisp, but | |
508 | doesn't exist in Common Lisp. @code{throw} is a special form in | |
509 | Common Lisp (because it must be able to throw multiple values), but it | |
510 | is a function in Emacs Lisp (which doesn't have multiple | |
511 | values).@refill | |
512 | @end quotation | |
513 | ||
514 | @node Autoloading | |
515 | @subsection Autoloading | |
516 | ||
517 | The @dfn{autoload} feature allows you to call a function or macro | |
518 | whose function definition has not yet been loaded into Emacs. It | |
519 | specifies which file contains the definition. When an autoload object | |
520 | appears as a symbol's function definition, calling that symbol as a | |
521 | function automatically loads the specified file; then it calls the real | |
522 | definition loaded from that file. @xref{Autoload}. | |
523 | ||
524 | @node Quoting | |
525 | @section Quoting | |
526 | ||
527 | The special form @code{quote} returns its single argument, as written, | |
528 | without evaluating it. This provides a way to include constant symbols | |
529 | and lists, which are not self-evaluating objects, in a program. (It is | |
530 | not necessary to quote self-evaluating objects such as numbers, strings, | |
531 | and vectors.) | |
532 | ||
533 | @defspec quote object | |
534 | This special form returns @var{object}, without evaluating it. | |
535 | @end defspec | |
536 | ||
537 | @cindex @samp{'} for quoting | |
538 | @cindex quoting using apostrophe | |
539 | @cindex apostrophe for quoting | |
540 | Because @code{quote} is used so often in programs, Lisp provides a | |
541 | convenient read syntax for it. An apostrophe character (@samp{'}) | |
542 | followed by a Lisp object (in read syntax) expands to a list whose first | |
543 | element is @code{quote}, and whose second element is the object. Thus, | |
544 | the read syntax @code{'x} is an abbreviation for @code{(quote x)}. | |
545 | ||
546 | Here are some examples of expressions that use @code{quote}: | |
547 | ||
548 | @example | |
549 | @group | |
550 | (quote (+ 1 2)) | |
551 | @result{} (+ 1 2) | |
552 | @end group | |
553 | @group | |
554 | (quote foo) | |
555 | @result{} foo | |
556 | @end group | |
557 | @group | |
558 | 'foo | |
559 | @result{} foo | |
560 | @end group | |
561 | @group | |
562 | ''foo | |
563 | @result{} (quote foo) | |
564 | @end group | |
565 | @group | |
566 | '(quote foo) | |
567 | @result{} (quote foo) | |
568 | @end group | |
569 | @group | |
570 | ['foo] | |
571 | @result{} [(quote foo)] | |
572 | @end group | |
573 | @end example | |
574 | ||
575 | Other quoting constructs include @code{function} (@pxref{Anonymous | |
576 | Functions}), which causes an anonymous lambda expression written in Lisp | |
577 | to be compiled, and @samp{`} (@pxref{Backquote}), which is used to quote | |
578 | only part of a list, while computing and substituting other parts. | |
579 | ||
580 | @node Eval | |
581 | @section Eval | |
582 | ||
583 | Most often, forms are evaluated automatically, by virtue of their | |
584 | occurrence in a program being run. On rare occasions, you may need to | |
585 | write code that evaluates a form that is computed at run time, such as | |
586 | after reading a form from text being edited or getting one from a | |
587 | property list. On these occasions, use the @code{eval} function. | |
588 | ||
589 | The functions and variables described in this section evaluate forms, | |
590 | specify limits to the evaluation process, or record recently returned | |
591 | values. Loading a file also does evaluation (@pxref{Loading}). | |
592 | ||
593 | It is generally cleaner and more flexible to store a function in a | |
594 | data structure, and call it with @code{funcall} or @code{apply}, than | |
595 | to store an expression in the data structure and evaluate it. Using | |
596 | functions provides the ability to pass information to them as | |
597 | arguments. | |
598 | ||
599 | @defun eval form | |
600 | This is the basic function evaluating an expression. It evaluates | |
601 | @var{form} in the current environment and returns the result. How the | |
602 | evaluation proceeds depends on the type of the object (@pxref{Forms}). | |
603 | ||
604 | Since @code{eval} is a function, the argument expression that appears | |
605 | in a call to @code{eval} is evaluated twice: once as preparation before | |
606 | @code{eval} is called, and again by the @code{eval} function itself. | |
607 | Here is an example: | |
608 | ||
609 | @example | |
610 | @group | |
611 | (setq foo 'bar) | |
612 | @result{} bar | |
613 | @end group | |
614 | @group | |
615 | (setq bar 'baz) | |
616 | @result{} baz | |
617 | ;; @r{Here @code{eval} receives argument @code{foo}} | |
618 | (eval 'foo) | |
619 | @result{} bar | |
620 | ;; @r{Here @code{eval} receives argument @code{bar}, which is the value of @code{foo}} | |
621 | (eval foo) | |
622 | @result{} baz | |
623 | @end group | |
624 | @end example | |
625 | ||
626 | The number of currently active calls to @code{eval} is limited to | |
627 | @code{max-lisp-eval-depth} (see below). | |
628 | @end defun | |
629 | ||
630 | @deffn Command eval-region start end &optional stream read-function | |
631 | @anchor{Definition of eval-region} | |
632 | This function evaluates the forms in the current buffer in the region | |
633 | defined by the positions @var{start} and @var{end}. It reads forms from | |
634 | the region and calls @code{eval} on them until the end of the region is | |
635 | reached, or until an error is signaled and not handled. | |
636 | ||
637 | By default, @code{eval-region} does not produce any output. However, | |
638 | if @var{stream} is non-@code{nil}, any output produced by output | |
639 | functions (@pxref{Output Functions}), as well as the values that | |
640 | result from evaluating the expressions in the region are printed using | |
641 | @var{stream}. @xref{Output Streams}. | |
642 | ||
643 | If @var{read-function} is non-@code{nil}, it should be a function, | |
644 | which is used instead of @code{read} to read expressions one by one. | |
645 | This function is called with one argument, the stream for reading | |
646 | input. You can also use the variable @code{load-read-function} | |
647 | (@pxref{Definition of load-read-function,, How Programs Do Loading}) | |
648 | to specify this function, but it is more robust to use the | |
649 | @var{read-function} argument. | |
650 | ||
651 | @code{eval-region} does not move point. It always returns @code{nil}. | |
652 | @end deffn | |
653 | ||
654 | @cindex evaluation of buffer contents | |
655 | @deffn Command eval-buffer &optional buffer-or-name stream filename unibyte print | |
656 | This is similar to @code{eval-region}, but the arguments provide | |
657 | different optional features. @code{eval-buffer} operates on the | |
658 | entire accessible portion of buffer @var{buffer-or-name}. | |
659 | @var{buffer-or-name} can be a buffer, a buffer name (a string), or | |
660 | @code{nil} (or omitted), which means to use the current buffer. | |
661 | @var{stream} is used as in @code{eval-region}, unless @var{stream} is | |
662 | @code{nil} and @var{print} non-@code{nil}. In that case, values that | |
663 | result from evaluating the expressions are still discarded, but the | |
664 | output of the output functions is printed in the echo area. | |
665 | @var{filename} is the file name to use for @code{load-history} | |
666 | (@pxref{Unloading}), and defaults to @code{buffer-file-name} | |
667 | (@pxref{Buffer File Name}). If @var{unibyte} is non-@code{nil}, | |
668 | @code{read} converts strings to unibyte whenever possible. | |
669 | ||
670 | @findex eval-current-buffer | |
671 | @code{eval-current-buffer} is an alias for this command. | |
672 | @end deffn | |
673 | ||
01f17ae2 | 674 | @defopt max-lisp-eval-depth |
b8d4c8d0 GM |
675 | @anchor{Definition of max-lisp-eval-depth} |
676 | This variable defines the maximum depth allowed in calls to @code{eval}, | |
677 | @code{apply}, and @code{funcall} before an error is signaled (with error | |
678 | message @code{"Lisp nesting exceeds max-lisp-eval-depth"}). | |
679 | ||
680 | This limit, with the associated error when it is exceeded, is one way | |
681 | Emacs Lisp avoids infinite recursion on an ill-defined function. If | |
682 | you increase the value of @code{max-lisp-eval-depth} too much, such | |
683 | code can cause stack overflow instead. | |
684 | @cindex Lisp nesting error | |
685 | ||
686 | The depth limit counts internal uses of @code{eval}, @code{apply}, and | |
687 | @code{funcall}, such as for calling the functions mentioned in Lisp | |
688 | expressions, and recursive evaluation of function call arguments and | |
689 | function body forms, as well as explicit calls in Lisp code. | |
690 | ||
a5b99fab CY |
691 | The default value of this variable is 400. If you set it to a value |
692 | less than 100, Lisp will reset it to 100 if the given value is | |
693 | reached. Entry to the Lisp debugger increases the value, if there is | |
694 | little room left, to make sure the debugger itself has room to | |
695 | execute. | |
b8d4c8d0 GM |
696 | |
697 | @code{max-specpdl-size} provides another limit on nesting. | |
698 | @xref{Definition of max-specpdl-size,, Local Variables}. | |
01f17ae2 | 699 | @end defopt |
b8d4c8d0 GM |
700 | |
701 | @defvar values | |
702 | The value of this variable is a list of the values returned by all the | |
703 | expressions that were read, evaluated, and printed from buffers | |
704 | (including the minibuffer) by the standard Emacs commands which do | |
705 | this. (Note that this does @emph{not} include evaluation in | |
706 | @samp{*ielm*} buffers, nor evaluation using @kbd{C-j} in | |
707 | @code{lisp-interaction-mode}.) The elements are ordered most recent | |
708 | first. | |
709 | ||
710 | @example | |
711 | @group | |
712 | (setq x 1) | |
713 | @result{} 1 | |
714 | @end group | |
715 | @group | |
716 | (list 'A (1+ 2) auto-save-default) | |
717 | @result{} (A 3 t) | |
718 | @end group | |
719 | @group | |
720 | values | |
721 | @result{} ((A 3 t) 1 @dots{}) | |
722 | @end group | |
723 | @end example | |
724 | ||
725 | This variable is useful for referring back to values of forms recently | |
726 | evaluated. It is generally a bad idea to print the value of | |
727 | @code{values} itself, since this may be very long. Instead, examine | |
728 | particular elements, like this: | |
729 | ||
730 | @example | |
731 | @group | |
732 | ;; @r{Refer to the most recent evaluation result.} | |
733 | (nth 0 values) | |
734 | @result{} (A 3 t) | |
735 | @end group | |
736 | @group | |
737 | ;; @r{That put a new element on,} | |
738 | ;; @r{so all elements move back one.} | |
739 | (nth 1 values) | |
740 | @result{} (A 3 t) | |
741 | @end group | |
742 | @group | |
743 | ;; @r{This gets the element that was next-to-most-recent} | |
744 | ;; @r{before this example.} | |
745 | (nth 3 values) | |
746 | @result{} 1 | |
747 | @end group | |
748 | @end example | |
749 | @end defvar |