Commit | Line | Data |
---|---|---|
b8d4c8d0 GM |
1 | @c -*-texinfo-*- |
2 | @c This is part of the GNU Emacs Lisp Reference Manual. | |
3 | @c Copyright (C) 1990, 1991, 1992, 1993, 1994, 2001, 2002, 2003, 2004, | |
49f70d46 | 4 | @c 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 Free Software Foundation, Inc. |
b8d4c8d0 | 5 | @c See the file elisp.texi for copying conditions. |
6336d8c3 | 6 | @setfilename ../../info/compile |
b8d4c8d0 GM |
7 | @node Byte Compilation, Advising Functions, Loading, Top |
8 | @chapter Byte Compilation | |
9 | @cindex byte compilation | |
10 | @cindex byte-code | |
11 | @cindex compilation (Emacs Lisp) | |
12 | ||
13 | Emacs Lisp has a @dfn{compiler} that translates functions written | |
14 | in Lisp into a special representation called @dfn{byte-code} that can be | |
15 | executed more efficiently. The compiler replaces Lisp function | |
16 | definitions with byte-code. When a byte-code function is called, its | |
17 | definition is evaluated by the @dfn{byte-code interpreter}. | |
18 | ||
19 | Because the byte-compiled code is evaluated by the byte-code | |
20 | interpreter, instead of being executed directly by the machine's | |
21 | hardware (as true compiled code is), byte-code is completely | |
22 | transportable from machine to machine without recompilation. It is not, | |
23 | however, as fast as true compiled code. | |
24 | ||
25 | Compiling a Lisp file with the Emacs byte compiler always reads the | |
26 | file as multibyte text, even if Emacs was started with @samp{--unibyte}, | |
27 | unless the file specifies otherwise. This is so that compilation gives | |
28 | results compatible with running the same file without compilation. | |
29 | @xref{Loading Non-ASCII}. | |
30 | ||
31 | In general, any version of Emacs can run byte-compiled code produced | |
32 | by recent earlier versions of Emacs, but the reverse is not true. | |
33 | ||
34 | @vindex no-byte-compile | |
35 | If you do not want a Lisp file to be compiled, ever, put a file-local | |
36 | variable binding for @code{no-byte-compile} into it, like this: | |
37 | ||
38 | @example | |
39 | ;; -*-no-byte-compile: t; -*- | |
40 | @end example | |
41 | ||
42 | @xref{Compilation Errors}, for how to investigate errors occurring in | |
43 | byte compilation. | |
44 | ||
45 | @menu | |
46 | * Speed of Byte-Code:: An example of speedup from byte compilation. | |
47 | * Compilation Functions:: Byte compilation functions. | |
48 | * Docs and Compilation:: Dynamic loading of documentation strings. | |
49 | * Dynamic Loading:: Dynamic loading of individual functions. | |
d24880de | 50 | * Eval During Compile:: Code to be evaluated when you compile. |
b8d4c8d0 | 51 | * Compiler Errors:: Handling compiler error messages. |
d24880de | 52 | * Byte-Code Objects:: The data type used for byte-compiled functions. |
b8d4c8d0 GM |
53 | * Disassembly:: Disassembling byte-code; how to read byte-code. |
54 | @end menu | |
55 | ||
56 | @node Speed of Byte-Code | |
57 | @section Performance of Byte-Compiled Code | |
58 | ||
59 | A byte-compiled function is not as efficient as a primitive function | |
60 | written in C, but runs much faster than the version written in Lisp. | |
61 | Here is an example: | |
62 | ||
63 | @example | |
64 | @group | |
65 | (defun silly-loop (n) | |
66 | "Return time before and after N iterations of a loop." | |
67 | (let ((t1 (current-time-string))) | |
68 | (while (> (setq n (1- n)) | |
69 | 0)) | |
70 | (list t1 (current-time-string)))) | |
71 | @result{} silly-loop | |
72 | @end group | |
73 | ||
74 | @group | |
c36745c6 CY |
75 | (silly-loop 50000000) |
76 | @result{} ("Wed Mar 11 21:10:19 2009" | |
77 | "Wed Mar 11 21:10:41 2009") ; @r{22 seconds} | |
b8d4c8d0 GM |
78 | @end group |
79 | ||
80 | @group | |
81 | (byte-compile 'silly-loop) | |
82 | @result{} @r{[Compiled code not shown]} | |
83 | @end group | |
84 | ||
85 | @group | |
c36745c6 CY |
86 | (silly-loop 50000000) |
87 | @result{} ("Wed Mar 11 21:12:26 2009" | |
88 | "Wed Mar 11 21:12:32 2009") ; @r{6 seconds} | |
b8d4c8d0 GM |
89 | @end group |
90 | @end example | |
91 | ||
c36745c6 | 92 | In this example, the interpreted code required 22 seconds to run, |
b8d4c8d0 GM |
93 | whereas the byte-compiled code required 6 seconds. These results are |
94 | representative, but actual results will vary greatly. | |
95 | ||
96 | @node Compilation Functions | |
97 | @comment node-name, next, previous, up | |
98 | @section The Compilation Functions | |
99 | @cindex compilation functions | |
100 | ||
101 | You can byte-compile an individual function or macro definition with | |
102 | the @code{byte-compile} function. You can compile a whole file with | |
103 | @code{byte-compile-file}, or several files with | |
104 | @code{byte-recompile-directory} or @code{batch-byte-compile}. | |
105 | ||
106 | The byte compiler produces error messages and warnings about each file | |
107 | in a buffer called @samp{*Compile-Log*}. These report things in your | |
108 | program that suggest a problem but are not necessarily erroneous. | |
109 | ||
110 | @cindex macro compilation | |
111 | Be careful when writing macro calls in files that you may someday | |
112 | byte-compile. Macro calls are expanded when they are compiled, so the | |
113 | macros must already be defined for proper compilation. For more | |
114 | details, see @ref{Compiling Macros}. If a program does not work the | |
115 | same way when compiled as it does when interpreted, erroneous macro | |
116 | definitions are one likely cause (@pxref{Problems with Macros}). | |
117 | Inline (@code{defsubst}) functions are less troublesome; if you | |
118 | compile a call to such a function before its definition is known, the | |
119 | call will still work right, it will just run slower. | |
120 | ||
121 | Normally, compiling a file does not evaluate the file's contents or | |
122 | load the file. But it does execute any @code{require} calls at top | |
123 | level in the file. One way to ensure that necessary macro definitions | |
124 | are available during compilation is to require the file that defines | |
125 | them (@pxref{Named Features}). To avoid loading the macro definition files | |
126 | when someone @emph{runs} the compiled program, write | |
127 | @code{eval-when-compile} around the @code{require} calls (@pxref{Eval | |
128 | During Compile}). | |
129 | ||
130 | @defun byte-compile symbol | |
131 | This function byte-compiles the function definition of @var{symbol}, | |
132 | replacing the previous definition with the compiled one. The function | |
133 | definition of @var{symbol} must be the actual code for the function; | |
134 | i.e., the compiler does not follow indirection to another symbol. | |
135 | @code{byte-compile} returns the new, compiled definition of | |
136 | @var{symbol}. | |
137 | ||
138 | If @var{symbol}'s definition is a byte-code function object, | |
139 | @code{byte-compile} does nothing and returns @code{nil}. Lisp records | |
140 | only one function definition for any symbol, and if that is already | |
141 | compiled, non-compiled code is not available anywhere. So there is no | |
142 | way to ``compile the same definition again.'' | |
143 | ||
144 | @example | |
145 | @group | |
146 | (defun factorial (integer) | |
147 | "Compute factorial of INTEGER." | |
148 | (if (= 1 integer) 1 | |
149 | (* integer (factorial (1- integer))))) | |
150 | @result{} factorial | |
151 | @end group | |
152 | ||
153 | @group | |
154 | (byte-compile 'factorial) | |
155 | @result{} | |
156 | #[(integer) | |
157 | "^H\301U\203^H^@@\301\207\302^H\303^HS!\"\207" | |
158 | [integer 1 * factorial] | |
159 | 4 "Compute factorial of INTEGER."] | |
160 | @end group | |
161 | @end example | |
162 | ||
163 | @noindent | |
164 | The result is a byte-code function object. The string it contains is | |
165 | the actual byte-code; each character in it is an instruction or an | |
166 | operand of an instruction. The vector contains all the constants, | |
167 | variable names and function names used by the function, except for | |
168 | certain primitives that are coded as special instructions. | |
169 | ||
170 | If the argument to @code{byte-compile} is a @code{lambda} expression, | |
171 | it returns the corresponding compiled code, but does not store | |
172 | it anywhere. | |
173 | @end defun | |
174 | ||
175 | @deffn Command compile-defun &optional arg | |
176 | This command reads the defun containing point, compiles it, and | |
177 | evaluates the result. If you use this on a defun that is actually a | |
178 | function definition, the effect is to install a compiled version of that | |
179 | function. | |
180 | ||
181 | @code{compile-defun} normally displays the result of evaluation in the | |
182 | echo area, but if @var{arg} is non-@code{nil}, it inserts the result | |
183 | in the current buffer after the form it compiled. | |
184 | @end deffn | |
185 | ||
186 | @deffn Command byte-compile-file filename &optional load | |
187 | This function compiles a file of Lisp code named @var{filename} into a | |
188 | file of byte-code. The output file's name is made by changing the | |
189 | @samp{.el} suffix into @samp{.elc}; if @var{filename} does not end in | |
190 | @samp{.el}, it adds @samp{.elc} to the end of @var{filename}. | |
191 | ||
192 | Compilation works by reading the input file one form at a time. If it | |
193 | is a definition of a function or macro, the compiled function or macro | |
194 | definition is written out. Other forms are batched together, then each | |
195 | batch is compiled, and written so that its compiled code will be | |
196 | executed when the file is read. All comments are discarded when the | |
197 | input file is read. | |
198 | ||
199 | This command returns @code{t} if there were no errors and @code{nil} | |
200 | otherwise. When called interactively, it prompts for the file name. | |
201 | ||
202 | If @var{load} is non-@code{nil}, this command loads the compiled file | |
203 | after compiling it. Interactively, @var{load} is the prefix argument. | |
204 | ||
205 | @example | |
206 | @group | |
207 | % ls -l push* | |
208 | -rw-r--r-- 1 lewis 791 Oct 5 20:31 push.el | |
209 | @end group | |
210 | ||
211 | @group | |
212 | (byte-compile-file "~/emacs/push.el") | |
213 | @result{} t | |
214 | @end group | |
215 | ||
216 | @group | |
217 | % ls -l push* | |
218 | -rw-r--r-- 1 lewis 791 Oct 5 20:31 push.el | |
219 | -rw-rw-rw- 1 lewis 638 Oct 8 20:25 push.elc | |
220 | @end group | |
221 | @end example | |
222 | @end deffn | |
223 | ||
224 | @deffn Command byte-recompile-directory directory &optional flag force | |
225 | @cindex library compilation | |
226 | This command recompiles every @samp{.el} file in @var{directory} (or | |
227 | its subdirectories) that needs recompilation. A file needs | |
228 | recompilation if a @samp{.elc} file exists but is older than the | |
229 | @samp{.el} file. | |
230 | ||
231 | When a @samp{.el} file has no corresponding @samp{.elc} file, | |
232 | @var{flag} says what to do. If it is @code{nil}, this command ignores | |
233 | these files. If @var{flag} is 0, it compiles them. If it is neither | |
234 | @code{nil} nor 0, it asks the user whether to compile each such file, | |
235 | and asks about each subdirectory as well. | |
236 | ||
237 | Interactively, @code{byte-recompile-directory} prompts for | |
238 | @var{directory} and @var{flag} is the prefix argument. | |
239 | ||
240 | If @var{force} is non-@code{nil}, this command recompiles every | |
241 | @samp{.el} file that has a @samp{.elc} file. | |
242 | ||
243 | The returned value is unpredictable. | |
244 | @end deffn | |
245 | ||
246 | @defun batch-byte-compile &optional noforce | |
247 | This function runs @code{byte-compile-file} on files specified on the | |
248 | command line. This function must be used only in a batch execution of | |
249 | Emacs, as it kills Emacs on completion. An error in one file does not | |
250 | prevent processing of subsequent files, but no output file will be | |
251 | generated for it, and the Emacs process will terminate with a nonzero | |
252 | status code. | |
253 | ||
254 | If @var{noforce} is non-@code{nil}, this function does not recompile | |
255 | files that have an up-to-date @samp{.elc} file. | |
256 | ||
257 | @example | |
258 | % emacs -batch -f batch-byte-compile *.el | |
259 | @end example | |
260 | @end defun | |
261 | ||
262 | @defun byte-code code-string data-vector max-stack | |
263 | @cindex byte-code interpreter | |
264 | This function actually interprets byte-code. A byte-compiled function | |
265 | is actually defined with a body that calls @code{byte-code}. Don't call | |
266 | this function yourself---only the byte compiler knows how to generate | |
267 | valid calls to this function. | |
268 | ||
269 | In Emacs version 18, byte-code was always executed by way of a call to | |
270 | the function @code{byte-code}. Nowadays, byte-code is usually executed | |
271 | as part of a byte-code function object, and only rarely through an | |
272 | explicit call to @code{byte-code}. | |
273 | @end defun | |
274 | ||
275 | @node Docs and Compilation | |
276 | @section Documentation Strings and Compilation | |
277 | @cindex dynamic loading of documentation | |
278 | ||
279 | Functions and variables loaded from a byte-compiled file access their | |
280 | documentation strings dynamically from the file whenever needed. This | |
281 | saves space within Emacs, and makes loading faster because the | |
282 | documentation strings themselves need not be processed while loading the | |
283 | file. Actual access to the documentation strings becomes slower as a | |
284 | result, but this normally is not enough to bother users. | |
285 | ||
286 | Dynamic access to documentation strings does have drawbacks: | |
287 | ||
288 | @itemize @bullet | |
289 | @item | |
290 | If you delete or move the compiled file after loading it, Emacs can no | |
291 | longer access the documentation strings for the functions and variables | |
292 | in the file. | |
293 | ||
294 | @item | |
295 | If you alter the compiled file (such as by compiling a new version), | |
296 | then further access to documentation strings in this file will | |
297 | probably give nonsense results. | |
298 | @end itemize | |
299 | ||
300 | If your site installs Emacs following the usual procedures, these | |
301 | problems will never normally occur. Installing a new version uses a new | |
302 | directory with a different name; as long as the old version remains | |
303 | installed, its files will remain unmodified in the places where they are | |
304 | expected to be. | |
305 | ||
306 | However, if you have built Emacs yourself and use it from the | |
307 | directory where you built it, you will experience this problem | |
308 | occasionally if you edit and recompile Lisp files. When it happens, you | |
309 | can cure the problem by reloading the file after recompiling it. | |
310 | ||
311 | You can turn off this feature at compile time by setting | |
312 | @code{byte-compile-dynamic-docstrings} to @code{nil}; this is useful | |
313 | mainly if you expect to change the file, and you want Emacs processes | |
314 | that have already loaded it to keep working when the file changes. | |
315 | You can do this globally, or for one source file by specifying a | |
316 | file-local binding for the variable. One way to do that is by adding | |
317 | this string to the file's first line: | |
318 | ||
319 | @example | |
320 | -*-byte-compile-dynamic-docstrings: nil;-*- | |
321 | @end example | |
322 | ||
323 | @defvar byte-compile-dynamic-docstrings | |
324 | If this is non-@code{nil}, the byte compiler generates compiled files | |
325 | that are set up for dynamic loading of documentation strings. | |
326 | @end defvar | |
327 | ||
328 | @cindex @samp{#@@@var{count}} | |
329 | @cindex @samp{#$} | |
330 | The dynamic documentation string feature writes compiled files that | |
331 | use a special Lisp reader construct, @samp{#@@@var{count}}. This | |
332 | construct skips the next @var{count} characters. It also uses the | |
333 | @samp{#$} construct, which stands for ``the name of this file, as a | |
334 | string.'' It is usually best not to use these constructs in Lisp source | |
335 | files, since they are not designed to be clear to humans reading the | |
336 | file. | |
337 | ||
338 | @node Dynamic Loading | |
339 | @section Dynamic Loading of Individual Functions | |
340 | ||
341 | @cindex dynamic loading of functions | |
342 | @cindex lazy loading | |
343 | When you compile a file, you can optionally enable the @dfn{dynamic | |
344 | function loading} feature (also known as @dfn{lazy loading}). With | |
345 | dynamic function loading, loading the file doesn't fully read the | |
346 | function definitions in the file. Instead, each function definition | |
347 | contains a place-holder which refers to the file. The first time each | |
348 | function is called, it reads the full definition from the file, to | |
349 | replace the place-holder. | |
350 | ||
351 | The advantage of dynamic function loading is that loading the file | |
352 | becomes much faster. This is a good thing for a file which contains | |
353 | many separate user-callable functions, if using one of them does not | |
354 | imply you will probably also use the rest. A specialized mode which | |
355 | provides many keyboard commands often has that usage pattern: a user may | |
356 | invoke the mode, but use only a few of the commands it provides. | |
357 | ||
358 | The dynamic loading feature has certain disadvantages: | |
359 | ||
360 | @itemize @bullet | |
361 | @item | |
362 | If you delete or move the compiled file after loading it, Emacs can no | |
363 | longer load the remaining function definitions not already loaded. | |
364 | ||
365 | @item | |
366 | If you alter the compiled file (such as by compiling a new version), | |
367 | then trying to load any function not already loaded will usually yield | |
368 | nonsense results. | |
369 | @end itemize | |
370 | ||
371 | These problems will never happen in normal circumstances with | |
372 | installed Emacs files. But they are quite likely to happen with Lisp | |
373 | files that you are changing. The easiest way to prevent these problems | |
374 | is to reload the new compiled file immediately after each recompilation. | |
375 | ||
376 | The byte compiler uses the dynamic function loading feature if the | |
377 | variable @code{byte-compile-dynamic} is non-@code{nil} at compilation | |
378 | time. Do not set this variable globally, since dynamic loading is | |
379 | desirable only for certain files. Instead, enable the feature for | |
380 | specific source files with file-local variable bindings. For example, | |
381 | you could do it by writing this text in the source file's first line: | |
382 | ||
383 | @example | |
384 | -*-byte-compile-dynamic: t;-*- | |
385 | @end example | |
386 | ||
387 | @defvar byte-compile-dynamic | |
388 | If this is non-@code{nil}, the byte compiler generates compiled files | |
389 | that are set up for dynamic function loading. | |
390 | @end defvar | |
391 | ||
392 | @defun fetch-bytecode function | |
393 | If @var{function} is a byte-code function object, this immediately | |
394 | finishes loading the byte code of @var{function} from its | |
395 | byte-compiled file, if it is not fully loaded already. Otherwise, | |
396 | it does nothing. It always returns @var{function}. | |
397 | @end defun | |
398 | ||
399 | @node Eval During Compile | |
400 | @section Evaluation During Compilation | |
401 | ||
402 | These features permit you to write code to be evaluated during | |
403 | compilation of a program. | |
404 | ||
405 | @defspec eval-and-compile body@dots{} | |
406 | This form marks @var{body} to be evaluated both when you compile the | |
407 | containing code and when you run it (whether compiled or not). | |
408 | ||
409 | You can get a similar result by putting @var{body} in a separate file | |
410 | and referring to that file with @code{require}. That method is | |
411 | preferable when @var{body} is large. Effectively @code{require} is | |
412 | automatically @code{eval-and-compile}, the package is loaded both when | |
413 | compiling and executing. | |
414 | ||
415 | @code{autoload} is also effectively @code{eval-and-compile} too. It's | |
416 | recognized when compiling, so uses of such a function don't produce | |
417 | ``not known to be defined'' warnings. | |
418 | ||
419 | Most uses of @code{eval-and-compile} are fairly sophisticated. | |
420 | ||
421 | If a macro has a helper function to build its result, and that macro | |
422 | is used both locally and outside the package, then | |
423 | @code{eval-and-compile} should be used to get the helper both when | |
424 | compiling and then later when running. | |
425 | ||
426 | If functions are defined programmatically (with @code{fset} say), then | |
427 | @code{eval-and-compile} can be used to have that done at compile-time | |
428 | as well as run-time, so calls to those functions are checked (and | |
429 | warnings about ``not known to be defined'' suppressed). | |
430 | @end defspec | |
431 | ||
432 | @defspec eval-when-compile body@dots{} | |
433 | This form marks @var{body} to be evaluated at compile time but not when | |
434 | the compiled program is loaded. The result of evaluation by the | |
435 | compiler becomes a constant which appears in the compiled program. If | |
436 | you load the source file, rather than compiling it, @var{body} is | |
437 | evaluated normally. | |
438 | ||
439 | @cindex compile-time constant | |
440 | If you have a constant that needs some calculation to produce, | |
441 | @code{eval-when-compile} can do that at compile-time. For example, | |
442 | ||
443 | @lisp | |
444 | (defvar my-regexp | |
445 | (eval-when-compile (regexp-opt '("aaa" "aba" "abb")))) | |
446 | @end lisp | |
447 | ||
448 | @cindex macros, at compile time | |
449 | If you're using another package, but only need macros from it (the | |
450 | byte compiler will expand those), then @code{eval-when-compile} can be | |
451 | used to load it for compiling, but not executing. For example, | |
452 | ||
453 | @lisp | |
454 | (eval-when-compile | |
049bcbcb | 455 | (require 'my-macro-package)) |
b8d4c8d0 GM |
456 | @end lisp |
457 | ||
458 | The same sort of thing goes for macros and @code{defsubst} functions | |
459 | defined locally and only for use within the file. They are needed for | |
460 | compiling the file, but in most cases they are not needed for | |
461 | execution of the compiled file. For example, | |
462 | ||
463 | @lisp | |
464 | (eval-when-compile | |
465 | (unless (fboundp 'some-new-thing) | |
466 | (defmacro 'some-new-thing () | |
467 | (compatibility code)))) | |
468 | @end lisp | |
469 | ||
470 | @noindent | |
471 | This is often good for code that's only a fallback for compatibility | |
472 | with other versions of Emacs. | |
473 | ||
474 | @strong{Common Lisp Note:} At top level, @code{eval-when-compile} is analogous to the Common | |
475 | Lisp idiom @code{(eval-when (compile eval) @dots{})}. Elsewhere, the | |
476 | Common Lisp @samp{#.} reader macro (but not when interpreting) is closer | |
477 | to what @code{eval-when-compile} does. | |
478 | @end defspec | |
479 | ||
480 | @node Compiler Errors | |
481 | @section Compiler Errors | |
482 | @cindex compiler errors | |
483 | ||
484 | Byte compilation outputs all errors and warnings into the buffer | |
485 | @samp{*Compile-Log*}. The messages include file names and line | |
486 | numbers that identify the location of the problem. The usual Emacs | |
487 | commands for operating on compiler diagnostics work properly on | |
488 | these messages. | |
489 | ||
490 | However, the warnings about functions that were used but not | |
491 | defined are always ``located'' at the end of the file, so these | |
492 | commands won't find the places they are really used. To do that, | |
493 | you must search for the function names. | |
494 | ||
495 | You can suppress the compiler warning for calling an undefined | |
496 | function @var{func} by conditionalizing the function call on an | |
497 | @code{fboundp} test, like this: | |
498 | ||
499 | @example | |
500 | (if (fboundp '@var{func}) ...(@var{func} ...)...) | |
501 | @end example | |
502 | ||
503 | @noindent | |
504 | The call to @var{func} must be in the @var{then-form} of the | |
505 | @code{if}, and @var{func} must appear quoted in the call to | |
506 | @code{fboundp}. (This feature operates for @code{cond} as well.) | |
507 | ||
fc37ae72 RS |
508 | You can tell the compiler that a function is defined using |
509 | @code{declare-function} (@pxref{Declaring Functions}). Likewise, you | |
510 | can tell the compiler that a variable is defined using @code{defvar} | |
511 | with no initial value. | |
5bb0cda3 | 512 | |
fc37ae72 RS |
513 | You can suppress the compiler warning for a specific use of an |
514 | undefined variable @var{variable} by conditionalizing its use on a | |
515 | @code{boundp} test, like this: | |
b8d4c8d0 GM |
516 | |
517 | @example | |
518 | (if (boundp '@var{variable}) ...@var{variable}...) | |
519 | @end example | |
520 | ||
521 | @noindent | |
522 | The reference to @var{variable} must be in the @var{then-form} of the | |
523 | @code{if}, and @var{variable} must appear quoted in the call to | |
524 | @code{boundp}. | |
525 | ||
fc37ae72 RS |
526 | You can suppress any and all compiler warnings within a certain |
527 | expression using the construct @code{with-no-warnings}: | |
b8d4c8d0 GM |
528 | |
529 | @c This is implemented with a defun, but conceptually it is | |
530 | @c a special form. | |
531 | ||
532 | @defspec with-no-warnings body@dots{} | |
533 | In execution, this is equivalent to @code{(progn @var{body}...)}, | |
534 | but the compiler does not issue warnings for anything that occurs | |
535 | inside @var{body}. | |
536 | ||
537 | We recommend that you use this construct around the smallest | |
fc37ae72 RS |
538 | possible piece of code, to avoid missing possible warnings other than one |
539 | one you intend to suppress. | |
b8d4c8d0 GM |
540 | @end defspec |
541 | ||
fc37ae72 | 542 | More precise control of warnings is possible by setting the variable |
5bb0cda3 GM |
543 | @code{byte-compile-warnings}. |
544 | ||
b8d4c8d0 GM |
545 | @node Byte-Code Objects |
546 | @section Byte-Code Function Objects | |
547 | @cindex compiled function | |
548 | @cindex byte-code function | |
549 | ||
550 | Byte-compiled functions have a special data type: they are | |
551 | @dfn{byte-code function objects}. | |
552 | ||
553 | Internally, a byte-code function object is much like a vector; | |
554 | however, the evaluator handles this data type specially when it appears | |
555 | as a function to be called. The printed representation for a byte-code | |
556 | function object is like that for a vector, with an additional @samp{#} | |
557 | before the opening @samp{[}. | |
558 | ||
559 | A byte-code function object must have at least four elements; there is | |
560 | no maximum number, but only the first six elements have any normal use. | |
561 | They are: | |
562 | ||
563 | @table @var | |
564 | @item arglist | |
565 | The list of argument symbols. | |
566 | ||
567 | @item byte-code | |
568 | The string containing the byte-code instructions. | |
569 | ||
570 | @item constants | |
571 | The vector of Lisp objects referenced by the byte code. These include | |
572 | symbols used as function names and variable names. | |
573 | ||
574 | @item stacksize | |
575 | The maximum stack size this function needs. | |
576 | ||
577 | @item docstring | |
578 | The documentation string (if any); otherwise, @code{nil}. The value may | |
579 | be a number or a list, in case the documentation string is stored in a | |
580 | file. Use the function @code{documentation} to get the real | |
581 | documentation string (@pxref{Accessing Documentation}). | |
582 | ||
583 | @item interactive | |
584 | The interactive spec (if any). This can be a string or a Lisp | |
585 | expression. It is @code{nil} for a function that isn't interactive. | |
586 | @end table | |
587 | ||
588 | Here's an example of a byte-code function object, in printed | |
589 | representation. It is the definition of the command | |
590 | @code{backward-sexp}. | |
591 | ||
592 | @example | |
593 | #[(&optional arg) | |
594 | "^H\204^F^@@\301^P\302^H[!\207" | |
595 | [arg 1 forward-sexp] | |
596 | 2 | |
597 | 254435 | |
598 | "p"] | |
599 | @end example | |
600 | ||
601 | The primitive way to create a byte-code object is with | |
602 | @code{make-byte-code}: | |
603 | ||
604 | @defun make-byte-code &rest elements | |
605 | This function constructs and returns a byte-code function object | |
606 | with @var{elements} as its elements. | |
607 | @end defun | |
608 | ||
609 | You should not try to come up with the elements for a byte-code | |
610 | function yourself, because if they are inconsistent, Emacs may crash | |
611 | when you call the function. Always leave it to the byte compiler to | |
612 | create these objects; it makes the elements consistent (we hope). | |
613 | ||
614 | You can access the elements of a byte-code object using @code{aref}; | |
615 | you can also use @code{vconcat} to create a vector with the same | |
616 | elements. | |
617 | ||
618 | @node Disassembly | |
619 | @section Disassembled Byte-Code | |
620 | @cindex disassembled byte-code | |
621 | ||
c36745c6 CY |
622 | People do not write byte-code; that job is left to the byte |
623 | compiler. But we provide a disassembler to satisfy a cat-like | |
624 | curiosity. The disassembler converts the byte-compiled code into | |
625 | human-readable form. | |
b8d4c8d0 GM |
626 | |
627 | The byte-code interpreter is implemented as a simple stack machine. | |
628 | It pushes values onto a stack of its own, then pops them off to use them | |
629 | in calculations whose results are themselves pushed back on the stack. | |
630 | When a byte-code function returns, it pops a value off the stack and | |
631 | returns it as the value of the function. | |
632 | ||
633 | In addition to the stack, byte-code functions can use, bind, and set | |
634 | ordinary Lisp variables, by transferring values between variables and | |
635 | the stack. | |
636 | ||
637 | @deffn Command disassemble object &optional buffer-or-name | |
638 | This command displays the disassembled code for @var{object}. In | |
639 | interactive use, or if @var{buffer-or-name} is @code{nil} or omitted, | |
640 | the output goes in a buffer named @samp{*Disassemble*}. If | |
641 | @var{buffer-or-name} is non-@code{nil}, it must be a buffer or the | |
642 | name of an existing buffer. Then the output goes there, at point, and | |
643 | point is left before the output. | |
644 | ||
645 | The argument @var{object} can be a function name, a lambda expression | |
646 | or a byte-code object. If it is a lambda expression, @code{disassemble} | |
647 | compiles it and disassembles the resulting compiled code. | |
648 | @end deffn | |
649 | ||
650 | Here are two examples of using the @code{disassemble} function. We | |
651 | have added explanatory comments to help you relate the byte-code to the | |
652 | Lisp source; these do not appear in the output of @code{disassemble}. | |
b8d4c8d0 GM |
653 | |
654 | @example | |
655 | @group | |
656 | (defun factorial (integer) | |
657 | "Compute factorial of an integer." | |
658 | (if (= 1 integer) 1 | |
659 | (* integer (factorial (1- integer))))) | |
660 | @result{} factorial | |
661 | @end group | |
662 | ||
663 | @group | |
664 | (factorial 4) | |
665 | @result{} 24 | |
666 | @end group | |
667 | ||
668 | @group | |
669 | (disassemble 'factorial) | |
670 | @print{} byte-code for factorial: | |
671 | doc: Compute factorial of an integer. | |
672 | args: (integer) | |
673 | @end group | |
674 | ||
675 | @group | |
c36745c6 CY |
676 | 0 varref integer ; @r{Get the value of @code{integer}} |
677 | ; @r{and push it onto the stack.} | |
678 | 1 constant 1 ; @r{Push 1 onto stack.} | |
b8d4c8d0 GM |
679 | @end group |
680 | ||
681 | @group | |
c36745c6 CY |
682 | 2 eqlsign ; @r{Pop top two values off stack, compare} |
683 | ; @r{them, and push result onto stack.} | |
b8d4c8d0 GM |
684 | @end group |
685 | ||
686 | @group | |
c36745c6 CY |
687 | 3 goto-if-nil 1 ; @r{Pop and test top of stack;} |
688 | ; @r{if @code{nil}, go to 1,} | |
b8d4c8d0 | 689 | ; @r{else continue.} |
b8d4c8d0 | 690 | 6 constant 1 ; @r{Push 1 onto top of stack.} |
c36745c6 CY |
691 | 7 return ; @r{Return the top element} |
692 | ; @r{of the stack.} | |
b8d4c8d0 GM |
693 | @end group |
694 | ||
695 | @group | |
c36745c6 CY |
696 | 8:1 varref integer ; @r{Push value of @code{integer} onto stack.} |
697 | 9 constant factorial ; @r{Push @code{factorial} onto stack.} | |
698 | 10 varref integer ; @r{Push value of @code{integer} onto stack.} | |
699 | 11 sub1 ; @r{Pop @code{integer}, decrement value,} | |
b8d4c8d0 | 700 | ; @r{push new value onto stack.} |
c36745c6 | 701 | 12 call 1 ; @r{Call function @code{factorial} using} |
b8d4c8d0 GM |
702 | ; @r{the first (i.e., the top) element} |
703 | ; @r{of the stack as the argument;} | |
704 | ; @r{push returned value onto stack.} | |
705 | @end group | |
706 | ||
707 | @group | |
c36745c6 CY |
708 | 13 mult ; @r{Pop top two values off stack, multiply} |
709 | ; @r{them, and push result onto stack.} | |
710 | 14 return ; @r{Return the top element of stack.} | |
b8d4c8d0 GM |
711 | @end group |
712 | @end example | |
713 | ||
714 | The @code{silly-loop} function is somewhat more complex: | |
715 | ||
716 | @example | |
717 | @group | |
718 | (defun silly-loop (n) | |
719 | "Return time before and after N iterations of a loop." | |
720 | (let ((t1 (current-time-string))) | |
721 | (while (> (setq n (1- n)) | |
722 | 0)) | |
723 | (list t1 (current-time-string)))) | |
724 | @result{} silly-loop | |
725 | @end group | |
726 | ||
727 | @group | |
728 | (disassemble 'silly-loop) | |
729 | @print{} byte-code for silly-loop: | |
730 | doc: Return time before and after N iterations of a loop. | |
731 | args: (n) | |
732 | ||
733 | 0 constant current-time-string ; @r{Push} | |
734 | ; @r{@code{current-time-string}} | |
735 | ; @r{onto top of stack.} | |
736 | @end group | |
737 | ||
738 | @group | |
739 | 1 call 0 ; @r{Call @code{current-time-string}} | |
c36745c6 CY |
740 | ; @r{with no argument,} |
741 | ; @r{pushing result onto stack.} | |
b8d4c8d0 GM |
742 | @end group |
743 | ||
744 | @group | |
745 | 2 varbind t1 ; @r{Pop stack and bind @code{t1}} | |
746 | ; @r{to popped value.} | |
747 | @end group | |
748 | ||
749 | @group | |
c36745c6 | 750 | 3:1 varref n ; @r{Get value of @code{n} from} |
b8d4c8d0 GM |
751 | ; @r{the environment and push} |
752 | ; @r{the value onto the stack.} | |
b8d4c8d0 GM |
753 | 4 sub1 ; @r{Subtract 1 from top of stack.} |
754 | @end group | |
755 | ||
756 | @group | |
757 | 5 dup ; @r{Duplicate the top of the stack;} | |
758 | ; @r{i.e., copy the top of} | |
759 | ; @r{the stack and push the} | |
760 | ; @r{copy onto the stack.} | |
b8d4c8d0 GM |
761 | 6 varset n ; @r{Pop the top of the stack,} |
762 | ; @r{and bind @code{n} to the value.} | |
763 | ||
764 | ; @r{In effect, the sequence @code{dup varset}} | |
765 | ; @r{copies the top of the stack} | |
766 | ; @r{into the value of @code{n}} | |
767 | ; @r{without popping it.} | |
768 | @end group | |
769 | ||
770 | @group | |
771 | 7 constant 0 ; @r{Push 0 onto stack.} | |
b8d4c8d0 GM |
772 | 8 gtr ; @r{Pop top two values off stack,} |
773 | ; @r{test if @var{n} is greater than 0} | |
774 | ; @r{and push result onto stack.} | |
775 | @end group | |
776 | ||
777 | @group | |
c36745c6 CY |
778 | 9 goto-if-not-nil 1 ; @r{Goto 1 if @code{n} > 0} |
779 | ; @r{(this continues the while loop)} | |
780 | ; @r{else continue.} | |
b8d4c8d0 GM |
781 | @end group |
782 | ||
783 | @group | |
c36745c6 CY |
784 | 12 varref t1 ; @r{Push value of @code{t1} onto stack.} |
785 | 13 constant current-time-string ; @r{Push @code{current-time-string}} | |
b8d4c8d0 | 786 | ; @r{onto top of stack.} |
c36745c6 | 787 | 14 call 0 ; @r{Call @code{current-time-string} again.} |
b8d4c8d0 GM |
788 | @end group |
789 | ||
790 | @group | |
c36745c6 CY |
791 | 15 unbind 1 ; @r{Unbind @code{t1} in local environment.} |
792 | 16 list2 ; @r{Pop top two elements off stack,} | |
b8d4c8d0 GM |
793 | ; @r{create a list of them,} |
794 | ; @r{and push list onto stack.} | |
c36745c6 | 795 | 17 return ; @r{Return value of the top of stack.} |
b8d4c8d0 GM |
796 | @end group |
797 | @end example | |
798 | ||
799 | ||
800 | @ignore | |
801 | arch-tag: f78e3050-2f0a-4dee-be27-d9979a0a2289 | |
802 | @end ignore |