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