2 @c This is part of the GNU Emacs Lisp Reference Manual.
3 @c Copyright (C) 1990-1993, 1998-1999, 2001-2011 Free Software Foundation, Inc.
4 @c See the file elisp.texi for copying conditions.
5 @setfilename ../../info/internals
6 @node GNU Emacs Internals, Standard Errors, Tips, Top
7 @comment node-name, next, previous, up
8 @appendix GNU Emacs Internals
10 This chapter describes how the runnable Emacs executable is dumped with
11 the preloaded Lisp libraries in it, how storage is allocated, and some
12 internal aspects of GNU Emacs that may be of interest to C programmers.
15 * Building Emacs:: How the dumped Emacs is made.
16 * Pure Storage:: A kludge to make preloaded Lisp functions sharable.
17 * Garbage Collection:: Reclaiming space for Lisp objects no longer used.
18 * Memory Usage:: Info about total size of Lisp objects made so far.
19 * Writing Emacs Primitives:: Writing C code for Emacs.
20 * Object Internals:: Data formats of buffers, windows, processes.
24 @appendixsec Building Emacs
25 @cindex building Emacs
28 This section explains the steps involved in building the Emacs
29 executable. You don't have to know this material to build and install
30 Emacs, since the makefiles do all these things automatically. This
31 information is pertinent to Emacs maintenance.
33 Compilation of the C source files in the @file{src} directory
34 produces an executable file called @file{temacs}, also called a
35 @dfn{bare impure Emacs}. It contains the Emacs Lisp interpreter and I/O
36 routines, but not the editing commands.
38 @cindex @file{loadup.el}
39 The command @w{@samp{temacs -l loadup}} uses @file{temacs} to create
40 the real runnable Emacs executable. These arguments direct
41 @file{temacs} to evaluate the Lisp files specified in the file
42 @file{loadup.el}. These files set up the normal Emacs editing
43 environment, resulting in an Emacs that is still impure but no longer
47 It takes a substantial time to load the standard Lisp files. Luckily,
48 you don't have to do this each time you run Emacs; @file{temacs} can
49 dump out an executable program called @file{emacs} that has these files
50 preloaded. @file{emacs} starts more quickly because it does not need to
51 load the files. This is the Emacs executable that is normally
54 @vindex preloaded-file-list
55 @cindex dumped Lisp files
56 To create @file{emacs}, use the command @samp{temacs -batch -l loadup
57 dump}. The purpose of @samp{-batch} here is to prevent @file{temacs}
58 from trying to initialize any of its data on the terminal; this ensures
59 that the tables of terminal information are empty in the dumped Emacs.
60 The argument @samp{dump} tells @file{loadup.el} to dump a new executable
61 named @file{emacs}. The variable @code{preloaded-file-list} stores a
62 list of the Lisp files that were dumped with the @file{emacs} executable.
64 Some operating systems don't support dumping. On those systems, you
65 must start Emacs with the @samp{temacs -l loadup} command each time you
66 use it. This takes a substantial time, but since you need to start
67 Emacs once a day at most---or once a week if you never log out---the
68 extra time is not too severe a problem.
70 @cindex @file{site-load.el}
72 You can specify additional files to preload by writing a library named
73 @file{site-load.el} that loads them. You may need to add a definition
76 #define SITELOAD_PURESIZE_EXTRA @var{n}
80 to make @var{n} added bytes of pure space to hold the additional files.
81 (Try adding increments of 20000 until it is big enough.) However, the
82 advantage of preloading additional files decreases as machines get
83 faster. On modern machines, it is usually not advisable.
85 After @file{loadup.el} reads @file{site-load.el}, it finds the
86 documentation strings for primitive and preloaded functions (and
87 variables) in the file @file{etc/DOC} where they are stored, by
88 calling @code{Snarf-documentation} (@pxref{Definition of
89 Snarf-documentation,, Accessing Documentation}).
91 @cindex @file{site-init.el}
92 @cindex preloading additional functions and variables
93 You can specify other Lisp expressions to execute just before dumping
94 by putting them in a library named @file{site-init.el}. This file is
95 executed after the documentation strings are found.
97 If you want to preload function or variable definitions, there are
98 three ways you can do this and make their documentation strings
99 accessible when you subsequently run Emacs:
103 Arrange to scan these files when producing the @file{etc/DOC} file,
104 and load them with @file{site-load.el}.
107 Load the files with @file{site-init.el}, then copy the files into the
108 installation directory for Lisp files when you install Emacs.
111 Specify a non-@code{nil} value for
112 @code{byte-compile-dynamic-docstrings} as a local variable in each of these
113 files, and load them with either @file{site-load.el} or
114 @file{site-init.el}. (This method has the drawback that the
115 documentation strings take up space in Emacs all the time.)
118 It is not advisable to put anything in @file{site-load.el} or
119 @file{site-init.el} that would alter any of the features that users
120 expect in an ordinary unmodified Emacs. If you feel you must override
121 normal features for your site, do it with @file{default.el}, so that
122 users can override your changes if they wish. @xref{Startup Summary}.
124 In a package that can be preloaded, it is sometimes useful to
125 specify a computation to be done when Emacs subsequently starts up.
126 For this, use @code{eval-at-startup}:
128 @defmac eval-at-startup body@dots{}
129 This evaluates the @var{body} forms, either immediately if running in
130 an Emacs that has already started up, or later when Emacs does start
131 up. Since the value of the @var{body} forms is not necessarily
132 available when the @code{eval-at-startup} form is run, that form
133 always returns @code{nil}.
136 @defun dump-emacs to-file from-file
138 This function dumps the current state of Emacs into an executable file
139 @var{to-file}. It takes symbols from @var{from-file} (this is normally
140 the executable file @file{temacs}).
142 If you want to use this function in an Emacs that was already dumped,
143 you must run Emacs with @samp{-batch}.
147 @appendixsec Pure Storage
150 Emacs Lisp uses two kinds of storage for user-created Lisp objects:
151 @dfn{normal storage} and @dfn{pure storage}. Normal storage is where
152 all the new data created during an Emacs session are kept; see the
153 following section for information on normal storage. Pure storage is
154 used for certain data in the preloaded standard Lisp files---data that
155 should never change during actual use of Emacs.
157 Pure storage is allocated only while @file{temacs} is loading the
158 standard preloaded Lisp libraries. In the file @file{emacs}, it is
159 marked as read-only (on operating systems that permit this), so that
160 the memory space can be shared by all the Emacs jobs running on the
161 machine at once. Pure storage is not expandable; a fixed amount is
162 allocated when Emacs is compiled, and if that is not sufficient for
163 the preloaded libraries, @file{temacs} allocates dynamic memory for
164 the part that didn't fit. If that happens, you should increase the
165 compilation parameter @code{PURESIZE} in the file
166 @file{src/puresize.h} and rebuild Emacs, even though the resulting
167 image will work: garbage collection is disabled in this situation,
168 causing a memory leak. Such an overflow normally won't happen unless you
169 try to preload additional libraries or add features to the standard
170 ones. Emacs will display a warning about the overflow when it
173 @defun purecopy object
174 This function makes a copy in pure storage of @var{object}, and returns
175 it. It copies a string by simply making a new string with the same
176 characters, but without text properties, in pure storage. It
177 recursively copies the contents of vectors and cons cells. It does
178 not make copies of other objects such as symbols, but just returns
179 them unchanged. It signals an error if asked to copy markers.
181 This function is a no-op except while Emacs is being built and dumped;
182 it is usually called only in the file @file{emacs/lisp/loaddefs.el}, but
183 a few packages call it just in case you decide to preload them.
186 @defvar pure-bytes-used
187 The value of this variable is the number of bytes of pure storage
188 allocated so far. Typically, in a dumped Emacs, this number is very
189 close to the total amount of pure storage available---if it were not,
190 we would preallocate less.
194 This variable determines whether @code{defun} should make a copy of the
195 function definition in pure storage. If it is non-@code{nil}, then the
196 function definition is copied into pure storage.
198 This flag is @code{t} while loading all of the basic functions for
199 building Emacs initially (allowing those functions to be sharable and
200 non-collectible). Dumping Emacs as an executable always writes
201 @code{nil} in this variable, regardless of the value it actually has
202 before and after dumping.
204 You should not change this flag in a running Emacs.
207 @node Garbage Collection
208 @appendixsec Garbage Collection
209 @cindex garbage collection
211 @cindex memory allocation
212 When a program creates a list or the user defines a new function (such
213 as by loading a library), that data is placed in normal storage. If
214 normal storage runs low, then Emacs asks the operating system to
215 allocate more memory in blocks of 1k bytes. Each block is used for one
216 type of Lisp object, so symbols, cons cells, markers, etc., are
217 segregated in distinct blocks in memory. (Vectors, long strings,
218 buffers and certain other editing types, which are fairly large, are
219 allocated in individual blocks, one per object, while small strings are
220 packed into blocks of 8k bytes.)
222 It is quite common to use some storage for a while, then release it by
223 (for example) killing a buffer or deleting the last pointer to an
224 object. Emacs provides a @dfn{garbage collector} to reclaim this
225 abandoned storage. (This name is traditional, but ``garbage recycler''
226 might be a more intuitive metaphor for this facility.)
228 The garbage collector operates by finding and marking all Lisp objects
229 that are still accessible to Lisp programs. To begin with, it assumes
230 all the symbols, their values and associated function definitions, and
231 any data presently on the stack, are accessible. Any objects that can
232 be reached indirectly through other accessible objects are also
235 When marking is finished, all objects still unmarked are garbage. No
236 matter what the Lisp program or the user does, it is impossible to refer
237 to them, since there is no longer a way to reach them. Their space
238 might as well be reused, since no one will miss them. The second
239 (``sweep'') phase of the garbage collector arranges to reuse them.
241 @c ??? Maybe add something describing weak hash tables here?
244 The sweep phase puts unused cons cells onto a @dfn{free list}
245 for future allocation; likewise for symbols and markers. It compacts
246 the accessible strings so they occupy fewer 8k blocks; then it frees the
247 other 8k blocks. Vectors, buffers, windows, and other large objects are
248 individually allocated and freed using @code{malloc} and @code{free}.
250 @cindex CL note---allocate more storage
252 @b{Common Lisp note:} Unlike other Lisps, GNU Emacs Lisp does not
253 call the garbage collector when the free list is empty. Instead, it
254 simply requests the operating system to allocate more storage, and
255 processing continues until @code{gc-cons-threshold} bytes have been
258 This means that you can make sure that the garbage collector will not
259 run during a certain portion of a Lisp program by calling the garbage
260 collector explicitly just before it (provided that portion of the
261 program does not use so much space as to force a second garbage
265 @deffn Command garbage-collect
266 This command runs a garbage collection, and returns information on
267 the amount of space in use. (Garbage collection can also occur
268 spontaneously if you use more than @code{gc-cons-threshold} bytes of
269 Lisp data since the previous garbage collection.)
271 @code{garbage-collect} returns a list containing the following
276 ((@var{used-conses} . @var{free-conses})
277 (@var{used-syms} . @var{free-syms})
279 (@var{used-miscs} . @var{free-miscs})
280 @var{used-string-chars}
281 @var{used-vector-slots}
282 (@var{used-floats} . @var{free-floats})
283 (@var{used-intervals} . @var{free-intervals})
284 (@var{used-strings} . @var{free-strings}))
292 @result{} ((106886 . 13184) (9769 . 0)
293 (7731 . 4651) 347543 121628
294 (31 . 94) (1273 . 168)
299 Here is a table explaining each element:
303 The number of cons cells in use.
306 The number of cons cells for which space has been obtained from the
307 operating system, but that are not currently being used.
310 The number of symbols in use.
313 The number of symbols for which space has been obtained from the
314 operating system, but that are not currently being used.
317 The number of miscellaneous objects in use. These include markers and
318 overlays, plus certain objects not visible to users.
321 The number of miscellaneous objects for which space has been obtained
322 from the operating system, but that are not currently being used.
324 @item used-string-chars
325 The total size of all strings, in characters.
327 @item used-vector-slots
328 The total number of elements of existing vectors.
332 The number of floats in use.
336 The number of floats for which space has been obtained from the
337 operating system, but that are not currently being used.
340 The number of intervals in use. Intervals are an internal
341 data structure used for representing text properties.
344 The number of intervals for which space has been obtained
345 from the operating system, but that are not currently being used.
348 The number of strings in use.
351 The number of string headers for which the space was obtained from the
352 operating system, but which are currently not in use. (A string
353 object consists of a header and the storage for the string text
354 itself; the latter is only allocated when the string is created.)
357 If there was overflow in pure space (see the previous section),
358 @code{garbage-collect} returns @code{nil}, because a real garbage
359 collection can not be done in this situation.
362 @defopt garbage-collection-messages
363 If this variable is non-@code{nil}, Emacs displays a message at the
364 beginning and end of garbage collection. The default value is
365 @code{nil}, meaning there are no such messages.
369 This is a normal hook that is run at the end of garbage collection.
370 Garbage collection is inhibited while the hook functions run, so be
371 careful writing them.
374 @defopt gc-cons-threshold
375 The value of this variable is the number of bytes of storage that must
376 be allocated for Lisp objects after one garbage collection in order to
377 trigger another garbage collection. A cons cell counts as eight bytes,
378 a string as one byte per character plus a few bytes of overhead, and so
379 on; space allocated to the contents of buffers does not count. Note
380 that the subsequent garbage collection does not happen immediately when
381 the threshold is exhausted, but only the next time the Lisp evaluator is
384 The initial threshold value is 400,000. If you specify a larger
385 value, garbage collection will happen less often. This reduces the
386 amount of time spent garbage collecting, but increases total memory use.
387 You may want to do this when running a program that creates lots of
390 You can make collections more frequent by specifying a smaller value,
391 down to 10,000. A value less than 10,000 will remain in effect only
392 until the subsequent garbage collection, at which time
393 @code{garbage-collect} will set the threshold back to 10,000.
396 @defopt gc-cons-percentage
397 The value of this variable specifies the amount of consing before a
398 garbage collection occurs, as a fraction of the current heap size.
399 This criterion and @code{gc-cons-threshold} apply in parallel, and
400 garbage collection occurs only when both criteria are satisfied.
402 As the heap size increases, the time to perform a garbage collection
403 increases. Thus, it can be desirable to do them less frequently in
407 The value returned by @code{garbage-collect} describes the amount of
408 memory used by Lisp data, broken down by data type. By contrast, the
409 function @code{memory-limit} provides information on the total amount of
410 memory Emacs is currently using.
414 This function returns the address of the last byte Emacs has allocated,
415 divided by 1024. We divide the value by 1024 to make sure it fits in a
418 You can use this to get a general idea of how your actions affect the
423 This variable is @code{t} if Emacs is close to out of memory for Lisp
424 objects, and @code{nil} otherwise.
427 @defun memory-use-counts
428 This returns a list of numbers that count the number of objects
429 created in this Emacs session. Each of these counters increments for
430 a certain kind of object. See the documentation string for details.
434 This variable contains the total number of garbage collections
435 done so far in this Emacs session.
439 This variable contains the total number of seconds of elapsed time
440 during garbage collection so far in this Emacs session, as a floating
445 @section Memory Usage
448 These functions and variables give information about the total amount
449 of memory allocation that Emacs has done, broken down by data type.
450 Note the difference between these and the values returned by
451 @code{(garbage-collect)}; those count objects that currently exist, but
452 these count the number or size of all allocations, including those for
453 objects that have since been freed.
455 @defvar cons-cells-consed
456 The total number of cons cells that have been allocated so far
457 in this Emacs session.
460 @defvar floats-consed
461 The total number of floats that have been allocated so far
462 in this Emacs session.
465 @defvar vector-cells-consed
466 The total number of vector cells that have been allocated so far
467 in this Emacs session.
470 @defvar symbols-consed
471 The total number of symbols that have been allocated so far
472 in this Emacs session.
475 @defvar string-chars-consed
476 The total number of string characters that have been allocated so far
477 in this Emacs session.
480 @defvar misc-objects-consed
481 The total number of miscellaneous objects that have been allocated so
482 far in this Emacs session. These include markers and overlays, plus
483 certain objects not visible to users.
486 @defvar intervals-consed
487 The total number of intervals that have been allocated so far
488 in this Emacs session.
491 @defvar strings-consed
492 The total number of strings that have been allocated so far in this
496 @node Writing Emacs Primitives
497 @appendixsec Writing Emacs Primitives
498 @cindex primitive function internals
499 @cindex writing Emacs primitives
501 Lisp primitives are Lisp functions implemented in C. The details of
502 interfacing the C function so that Lisp can call it are handled by a few
503 C macros. The only way to really understand how to write new C code is
504 to read the source, but we can explain some things here.
506 An example of a special form is the definition of @code{or}, from
507 @file{eval.c}. (An ordinary function would have the same general
510 @cindex garbage collection protection
513 DEFUN ("or", For, Sor, 0, UNEVALLED, 0,
514 doc: /* Eval args until one of them yields non-nil, then return that
515 value. The remaining args are not evalled at all.
516 If all args return nil, return nil.
519 usage: (or CONDITIONS ...) */)
522 register Lisp_Object val = Qnil;
533 val = Feval (XCAR (args));
547 @cindex @code{DEFUN}, C macro to define Lisp primitives
548 Let's start with a precise explanation of the arguments to the
549 @code{DEFUN} macro. Here is a template for them:
552 DEFUN (@var{lname}, @var{fname}, @var{sname}, @var{min}, @var{max}, @var{interactive}, @var{doc})
557 This is the name of the Lisp symbol to define as the function name; in
558 the example above, it is @code{or}.
561 This is the C function name for this function. This is
562 the name that is used in C code for calling the function. The name is,
563 by convention, @samp{F} prepended to the Lisp name, with all dashes
564 (@samp{-}) in the Lisp name changed to underscores. Thus, to call this
565 function from C code, call @code{For}. Remember that the arguments must
566 be of type @code{Lisp_Object}; various macros and functions for creating
567 values of type @code{Lisp_Object} are declared in the file
571 This is a C variable name to use for a structure that holds the data for
572 the subr object that represents the function in Lisp. This structure
573 conveys the Lisp symbol name to the initialization routine that will
574 create the symbol and store the subr object as its definition. By
575 convention, this name is always @var{fname} with @samp{F} replaced with
579 This is the minimum number of arguments that the function requires. The
580 function @code{or} allows a minimum of zero arguments.
583 This is the maximum number of arguments that the function accepts, if
584 there is a fixed maximum. Alternatively, it can be @code{UNEVALLED},
585 indicating a special form that receives unevaluated arguments, or
586 @code{MANY}, indicating an unlimited number of evaluated arguments (the
587 equivalent of @code{&rest}). Both @code{UNEVALLED} and @code{MANY} are
588 macros. If @var{max} is a number, it may not be less than @var{min} and
589 it may not be greater than eight.
592 This is an interactive specification, a string such as might be used as
593 the argument of @code{interactive} in a Lisp function. In the case of
594 @code{or}, it is 0 (a null pointer), indicating that @code{or} cannot be
595 called interactively. A value of @code{""} indicates a function that
596 should receive no arguments when called interactively. If the value
597 begins with a @samp{(}, the string is evaluated as a Lisp form.
600 This is the documentation string. It uses C comment syntax rather
601 than C string syntax because comment syntax requires nothing special
602 to include multiple lines. The @samp{doc:} identifies the comment
603 that follows as the documentation string. The @samp{/*} and @samp{*/}
604 delimiters that begin and end the comment are not part of the
605 documentation string.
607 If the last line of the documentation string begins with the keyword
608 @samp{usage:}, the rest of the line is treated as the argument list
609 for documentation purposes. This way, you can use different argument
610 names in the documentation string from the ones used in the C code.
611 @samp{usage:} is required if the function has an unlimited number of
614 All the usual rules for documentation strings in Lisp code
615 (@pxref{Documentation Tips}) apply to C code documentation strings
619 After the call to the @code{DEFUN} macro, you must write the
620 argument list that every C function must have, including the types for
621 the arguments. For a function with a fixed maximum number of
622 arguments, declare a C argument for each Lisp argument, and give them
623 all type @code{Lisp_Object}. When a Lisp function has no upper limit
624 on the number of arguments, its implementation in C actually receives
625 exactly two arguments: the first is the number of Lisp arguments, and
626 the second is the address of a block containing their values. They
627 have types @code{int} and @w{@code{Lisp_Object *}}.
629 @cindex @code{GCPRO} and @code{UNGCPRO}
630 @cindex protect C variables from garbage collection
631 Within the function @code{For} itself, note the use of the macros
632 @code{GCPRO1} and @code{UNGCPRO}. @code{GCPRO1} is used to
633 ``protect'' a variable from garbage collection---to inform the garbage
634 collector that it must look in that variable and regard its contents
635 as an accessible object. GC protection is necessary whenever you call
636 @code{Feval} or anything that can directly or indirectly call
637 @code{Feval}. At such a time, any Lisp object that this function may
638 refer to again must be protected somehow.
640 It suffices to ensure that at least one pointer to each object is
641 GC-protected; that way, the object cannot be recycled, so all pointers
642 to it remain valid. Thus, a particular local variable can do without
643 protection if it is certain that the object it points to will be
644 preserved by some other pointer (such as another local variable which
645 has a @code{GCPRO})@footnote{Formerly, strings were a special
646 exception; in older Emacs versions, every local variable that might
647 point to a string needed a @code{GCPRO}.}. Otherwise, the local
648 variable needs a @code{GCPRO}.
650 The macro @code{GCPRO1} protects just one local variable. If you
651 want to protect two variables, use @code{GCPRO2} instead; repeating
652 @code{GCPRO1} will not work. Macros @code{GCPRO3}, @code{GCPRO4},
653 @code{GCPRO5}, and @code{GCPRO6} also exist. All these macros
654 implicitly use local variables such as @code{gcpro1}; you must declare
655 these explicitly, with type @code{struct gcpro}. Thus, if you use
656 @code{GCPRO2}, you must declare @code{gcpro1} and @code{gcpro2}.
657 Alas, we can't explain all the tricky details here.
659 @code{UNGCPRO} cancels the protection of the variables that are
660 protected in the current function. It is necessary to do this
663 Built-in functions that take a variable number of arguments actually
664 accept two arguments at the C level: the number of Lisp arguments, and
665 a @code{Lisp_Object *} pointer to a C vector containing those Lisp
666 arguments. This C vector may be part of a Lisp vector, but it need
667 not be. The responsibility for using @code{GCPRO} to protect the Lisp
668 arguments from GC if necessary rests with the caller in this case,
669 since the caller allocated or found the storage for them.
671 You must not use C initializers for static or global variables unless
672 the variables are never written once Emacs is dumped. These variables
673 with initializers are allocated in an area of memory that becomes
674 read-only (on certain operating systems) as a result of dumping Emacs.
677 Do not use static variables within functions---place all static
678 variables at top level in the file. This is necessary because Emacs on
679 some operating systems defines the keyword @code{static} as a null
680 macro. (This definition is used because those systems put all variables
681 declared static in a place that becomes read-only after dumping, whether
682 they have initializers or not.)
684 @cindex @code{defsubr}, Lisp symbol for a primitive
685 Defining the C function is not enough to make a Lisp primitive
686 available; you must also create the Lisp symbol for the primitive and
687 store a suitable subr object in its function cell. The code looks like
691 defsubr (&@var{subr-structure-name});
695 Here @var{subr-structure-name} is the name you used as the third
696 argument to @code{DEFUN}.
698 If you add a new primitive to a file that already has Lisp primitives
699 defined in it, find the function (near the end of the file) named
700 @code{syms_of_@var{something}}, and add the call to @code{defsubr}
701 there. If the file doesn't have this function, or if you create a new
702 file, add to it a @code{syms_of_@var{filename}} (e.g.,
703 @code{syms_of_myfile}). Then find the spot in @file{emacs.c} where all
704 of these functions are called, and add a call to
705 @code{syms_of_@var{filename}} there.
707 @anchor{Defining Lisp variables in C}
708 @vindex byte-boolean-vars
709 @cindex defining Lisp variables in C
710 @cindex @code{DEFVAR_INT}, @code{DEFVAR_LISP}, @code{DEFVAR_BOOL}
711 The function @code{syms_of_@var{filename}} is also the place to define
712 any C variables that are to be visible as Lisp variables.
713 @code{DEFVAR_LISP} makes a C variable of type @code{Lisp_Object} visible
714 in Lisp. @code{DEFVAR_INT} makes a C variable of type @code{int}
715 visible in Lisp with a value that is always an integer.
716 @code{DEFVAR_BOOL} makes a C variable of type @code{int} visible in Lisp
717 with a value that is either @code{t} or @code{nil}. Note that variables
718 defined with @code{DEFVAR_BOOL} are automatically added to the list
719 @code{byte-boolean-vars} used by the byte compiler.
721 @cindex @code{staticpro}, protection from GC
722 If you define a file-scope C variable of type @code{Lisp_Object},
723 you must protect it from garbage-collection by calling @code{staticpro}
724 in @code{syms_of_@var{filename}}, like this:
727 staticpro (&@var{variable});
730 Here is another example function, with more complicated arguments.
731 This comes from the code in @file{window.c}, and it demonstrates the use
732 of macros and functions to manipulate Lisp objects.
736 DEFUN ("coordinates-in-window-p", Fcoordinates_in_window_p,
737 Scoordinates_in_window_p, 2, 2,
738 "xSpecify coordinate pair: \nXExpression which evals to window: ",
739 "Return non-nil if COORDINATES is in WINDOW.\n\
740 COORDINATES is a cons of the form (X . Y), X and Y being distances\n\
744 If they are on the border between WINDOW and its right sibling,\n\
745 `vertical-line' is returned.")
746 (coordinates, window)
747 register Lisp_Object coordinates, window;
753 CHECK_LIVE_WINDOW (window, 0);
754 CHECK_CONS (coordinates, 1);
755 x = XINT (Fcar (coordinates));
756 y = XINT (Fcdr (coordinates));
760 switch (coordinates_in_window (XWINDOW (window), &x, &y))
762 case 0: /* NOT in window at all. */
767 case 1: /* In text part of window. */
768 return Fcons (make_number (x), make_number (y));
772 case 2: /* In mode line of window. */
777 case 3: /* On right border of window. */
778 return Qvertical_line;
789 Note that C code cannot call functions by name unless they are defined
790 in C. The way to call a function written in Lisp is to use
791 @code{Ffuncall}, which embodies the Lisp function @code{funcall}. Since
792 the Lisp function @code{funcall} accepts an unlimited number of
793 arguments, in C it takes two: the number of Lisp-level arguments, and a
794 one-dimensional array containing their values. The first Lisp-level
795 argument is the Lisp function to call, and the rest are the arguments to
796 pass to it. Since @code{Ffuncall} can call the evaluator, you must
797 protect pointers from garbage collection around the call to
800 The C functions @code{call0}, @code{call1}, @code{call2}, and so on,
801 provide handy ways to call a Lisp function conveniently with a fixed
802 number of arguments. They work by calling @code{Ffuncall}.
804 @file{eval.c} is a very good file to look through for examples;
805 @file{lisp.h} contains the definitions for some important macros and
808 If you define a function which is side-effect free, update the code
809 in @file{byte-opt.el} which binds @code{side-effect-free-fns} and
810 @code{side-effect-and-error-free-fns} so that the compiler optimizer
813 @node Object Internals
814 @appendixsec Object Internals
815 @cindex object internals
817 GNU Emacs Lisp manipulates many different types of data. The actual
818 data are stored in a heap and the only access that programs have to it
819 is through pointers. Each pointer is 32 bits wide on 32-bit machines,
820 and 64 bits wide on 64-bit machines; three of these bits are used for
821 the tag that identifies the object's type, and the remainder are used
822 to address the object.
824 Because Lisp objects are represented as tagged pointers, it is always
825 possible to determine the Lisp data type of any object. The C data type
826 @code{Lisp_Object} can hold any Lisp object of any data type. Ordinary
827 variables have type @code{Lisp_Object}, which means they can hold any
828 type of Lisp value; you can determine the actual data type only at run
829 time. The same is true for function arguments; if you want a function
830 to accept only a certain type of argument, you must check the type
831 explicitly using a suitable predicate (@pxref{Type Predicates}).
832 @cindex type checking internals
835 * Buffer Internals:: Components of a buffer structure.
836 * Window Internals:: Components of a window structure.
837 * Process Internals:: Components of a process structure.
840 @node Buffer Internals
841 @appendixsubsec Buffer Internals
842 @cindex internals, of buffer
843 @cindex buffer internals
845 Two structures are used to represent buffers in C. The
846 @code{buffer_text} structure contains fields describing the text of a
847 buffer; the @code{buffer} structure holds other fields. In the case
848 of indirect buffers, two or more @code{buffer} structures reference
849 the same @code{buffer_text} structure.
851 Here are some of the fields in @code{struct buffer_text}:
855 The address of the buffer contents.
859 The character and byte positions of the buffer gap. @xref{Buffer
864 The character and byte positions of the end of the buffer text.
867 The size of buffer's gap. @xref{Buffer Gap}.
872 @itemx overlay_modiff
873 These fields count the number of buffer-modification events performed
874 in this buffer. @code{modiff} is incremented after each
875 buffer-modification event, and is never otherwise changed;
876 @code{save_modiff} contains the value of @code{modiff} the last time
877 the buffer was visited or saved; @code{chars_modiff} counts only
878 modifications to the characters in the buffer, ignoring all other
879 kinds of changes; and @code{overlay_modiff} counts only modifications
884 The number of characters at the start and end of the text that are
885 known to be unchanged since the last complete redisplay.
887 @item unchanged_modified
888 @itemx overlay_unchanged_modified
889 The values of @code{modiff} and @code{overlay_modiff}, respectively,
890 after the last compelete redisplay. If their current values match
891 @code{modiff} or @code{overlay_modiff}, that means
892 @code{beg_unchanged} and @code{end_unchanged} contain no useful
896 The markers that refer to this buffer. This is actually a single
897 marker, and successive elements in its marker @code{chain} are the other
898 markers referring to this buffer text.
901 The interval tree which records the text properties of this buffer.
904 Some of the fields of @code{struct buffer} are:
908 Points to the next buffer, in the chain of all buffers (including
909 killed buffers). This chain is used only for garbage collection, in
910 order to collect killed buffers properly. Note that vectors, and most
911 kinds of objects allocated as vectors, are all on one chain, but
912 buffers are on a separate chain of their own.
915 A @code{struct buffer_text} structure that ordinarily holds the buffer
916 contents. In indirect buffers, this field is not used.
919 A pointer to the @code{buffer_text} structure for this buffer. In an
920 ordinary buffer, this is the @code{own_text} field above. In an
921 indirect buffer, this is the @code{own_text} field of the base buffer.
925 The character and byte positions of point in a buffer.
929 The character and byte positions of the beginning of the accessible
930 range of text in the buffer.
934 The character and byte positions of the end of the accessible range of
938 In an indirect buffer, this points to the base buffer. In an ordinary
942 This field contains flags indicating that certain variables are local
943 in this buffer. Such variables are declared in the C code using
944 @code{DEFVAR_PER_BUFFER}, and their buffer-local bindings are stored
945 in fields in the buffer structure itself. (Some of these fields are
946 described in this table.)
949 The modification time of the visited file. It is set when the file is
950 written or read. Before writing the buffer into a file, this field is
951 compared to the modification time of the file to see if the file has
952 changed on disk. @xref{Buffer Modification}.
954 @item auto_save_modified
955 The time when the buffer was last auto-saved.
957 @item last_window_start
958 The @code{window-start} position in the buffer as of the last time the
959 buffer was displayed in a window.
962 This flag indicates that narrowing has changed in the buffer.
965 @item prevent_redisplay_optimizations_p
966 This flag indicates that redisplay optimizations should not be used to
970 This field holds the current overlay center position. @xref{Managing
973 @item overlays_before
974 @itemx overlays_after
975 These fields hold, respectively, a list of overlays that end at or
976 before the current overlay center, and a list of overlays that end
977 after the current overlay center. @xref{Managing Overlays}.
978 @code{overlays_before} is sorted in order of decreasing end position,
979 and @code{overlays_after} is sorted in order of increasing beginning
983 A Lisp string that names the buffer. It is guaranteed to be unique.
987 The length of the file this buffer is visiting, when last read or
988 saved. This and other fields concerned with saving are not kept in
989 the @code{buffer_text} structure because indirect buffers are never
993 The directory for expanding relative file names. This is the value of
994 the buffer-local variable @code{default-directory} (@pxref{File Name Expansion}).
997 The name of the file visited in this buffer, or @code{nil}. This is
998 the value of the buffer-local variable @code{buffer-file-name}
999 (@pxref{Buffer File Name}).
1003 @itemx auto_save_file_name
1006 @itemx file_truename
1007 @itemx invisibility_spec
1008 @itemx display_count
1010 These fields store the values of Lisp variables that are automatically
1011 buffer-local (@pxref{Buffer-Local Variables}), whose corresponding
1012 variable names have the additional prefix @code{buffer-} and have
1013 underscores replaced with dashes. For instance, @code{undo_list}
1014 stores the value of @code{buffer-undo-list}. @xref{Standard
1015 Buffer-Local Variables}.
1018 The mark for the buffer. The mark is a marker, hence it is also
1019 included on the list @code{markers}. @xref{The Mark}.
1021 @item local_var_alist
1022 The association list describing the buffer-local variable bindings of
1023 this buffer, not including the built-in buffer-local bindings that
1024 have special slots in the buffer object. (Those slots are omitted
1025 from this table.) @xref{Buffer-Local Variables}.
1028 Symbol naming the major mode of this buffer, e.g., @code{lisp-mode}.
1031 Pretty name of the major mode, e.g., @code{"Lisp"}.
1036 @itemx category_table
1037 @itemx display_table
1038 These fields store the buffer's local keymap (@pxref{Keymaps}), abbrev
1039 table (@pxref{Abbrev Tables}), syntax table (@pxref{Syntax Tables}),
1040 category table (@pxref{Categories}), and display table (@pxref{Display
1043 @item downcase_table
1045 @itemx case_canon_table
1046 These fields store the conversion tables for converting text to lower
1047 case, upper case, and for canonicalizing text for case-fold search.
1051 An alist of the minor modes of this buffer.
1056 These fields are only used in an indirect buffer, or in a buffer that
1057 is the base of an indirect buffer. Each holds a marker that records
1058 @code{pt}, @code{begv}, and @code{zv} respectively, for this buffer
1059 when the buffer is not current.
1061 @item mode_line_format
1062 @itemx header_line_format
1063 @itemx case_fold_search
1067 @itemx auto_fill_function
1068 @itemx truncate_lines
1071 @itemx selective_display
1072 @itemx selective_display_ellipses
1073 @itemx overwrite_mode
1075 @itemx display_table
1077 @itemx enable_multibyte_characters
1078 @itemx buffer_file_coding_system
1079 @itemx auto_save_file_format
1080 @itemx cache_long_line_scans
1081 @itemx point_before_scroll
1082 @itemx left_fringe_width
1083 @itemx right_fringe_width
1084 @itemx fringes_outside_margins
1085 @itemx scroll_bar_width
1086 @itemx indicate_empty_lines
1087 @itemx indicate_buffer_boundaries
1088 @itemx fringe_indicator_alist
1089 @itemx fringe_cursor_alist
1090 @itemx scroll_up_aggressively
1091 @itemx scroll_down_aggressively
1093 @itemx cursor_in_non_selected_windows
1094 These fields store the values of Lisp variables that are automatically
1095 buffer-local (@pxref{Buffer-Local Variables}), whose corresponding
1096 variable names have underscores replaced with dashes. For instance,
1097 @code{mode_line_format} stores the value of @code{mode-line-format}.
1098 @xref{Standard Buffer-Local Variables}.
1100 @item last_selected_window
1101 This is the last window that was selected with this buffer in it, or @code{nil}
1102 if that window no longer displays this buffer.
1105 @node Window Internals
1106 @appendixsubsec Window Internals
1107 @cindex internals, of window
1108 @cindex window internals
1110 Windows have the following accessible fields:
1114 The frame that this window is on.
1117 Non-@code{nil} if this window is a minibuffer window.
1120 Internally, Emacs arranges windows in a tree; each group of siblings has
1121 a parent window whose area includes all the siblings. This field points
1122 to a window's parent.
1124 Parent windows do not display buffers, and play little role in display
1125 except to shape their child windows. Emacs Lisp programs usually have
1126 no access to the parent windows; they operate on the windows at the
1127 leaves of the tree, which actually display buffers.
1131 These fields contain the window's leftmost child and its topmost child
1132 respectively. @code{hchild} is used if the window is subdivided
1133 horizontally by child windows, and @code{vchild} if it is subdivided
1138 The next sibling and previous sibling of this window. @code{next} is
1139 @code{nil} if the window is the rightmost or bottommost in its group;
1140 @code{prev} is @code{nil} if it is the leftmost or topmost in its
1144 The left-hand edge of the window, measured in columns, relative to the
1145 leftmost column in the frame (column 0).
1148 The top edge of the window, measured in lines, relative to the topmost
1149 line in the frame (line 0).
1153 The width and height of the window, measured in columns and lines
1154 respectively. The width includes the scroll bar and fringes, and/or
1155 the separator line on the right of the window (if any).
1158 The buffer that the window is displaying.
1161 A marker pointing to the position in the buffer that is the first
1162 character displayed in the window.
1165 @cindex window point internals
1166 This is the value of point in the current buffer when this window is
1167 selected; when it is not selected, it retains its previous value.
1170 If this flag is non-@code{nil}, it says that the window has been
1171 scrolled explicitly by the Lisp program. This affects what the next
1172 redisplay does if point is off the screen: instead of scrolling the
1173 window to show the text around point, it moves point to a location that
1176 @item frozen_window_start_p
1177 This field is set temporarily to 1 to indicate to redisplay that
1178 @code{start} of this window should not be changed, even if point
1181 @item start_at_line_beg
1182 Non-@code{nil} means current value of @code{start} was the beginning of a line
1186 This is the last time that the window was selected. The function
1187 @code{get-lru-window} uses this field.
1189 @item sequence_number
1190 A unique number assigned to this window when it was created.
1193 The @code{modiff} field of the window's buffer, as of the last time
1194 a redisplay completed in this window.
1196 @item last_overlay_modified
1197 The @code{overlay_modiff} field of the window's buffer, as of the last
1198 time a redisplay completed in this window.
1201 The buffer's value of point, as of the last time a redisplay completed
1205 A non-@code{nil} value means the window's buffer was ``modified'' when the
1206 window was last updated.
1208 @item vertical_scroll_bar
1209 This window's vertical scroll bar.
1211 @item left_margin_width
1212 @itemx right_margin_width
1213 The widths of the left and right margins in this window. A value of
1214 @code{nil} means to use the buffer's value of @code{left-margin-width}
1215 or @code{right-margin-width}.
1217 @item window_end_pos
1218 This is computed as @code{z} minus the buffer position of the last glyph
1219 in the current matrix of the window. The value is only valid if
1220 @code{window_end_valid} is not @code{nil}.
1222 @item window_end_bytepos
1223 The byte position corresponding to @code{window_end_pos}.
1225 @item window_end_vpos
1226 The window-relative vertical position of the line containing
1227 @code{window_end_pos}.
1229 @item window_end_valid
1230 This field is set to a non-@code{nil} value if @code{window_end_pos} is truly
1231 valid. This is @code{nil} if nontrivial redisplay is preempted since in that
1232 case the display that @code{window_end_pos} was computed for did not get
1236 A structure describing where the cursor is in this window.
1239 The value of @code{cursor} as of the last redisplay that finished.
1242 A structure describing where the cursor of this window physically is.
1244 @item phys_cursor_type
1245 The type of cursor that was last displayed on this window.
1247 @item phys_cursor_on_p
1248 This field is non-zero if the cursor is physically on.
1251 Non-zero means the cursor in this window is logically on.
1253 @item last_cursor_off_p
1254 This field contains the value of @code{cursor_off_p} as of the time of
1257 @item must_be_updated_p
1258 This is set to 1 during redisplay when this window must be updated.
1261 This is the number of columns that the display in the window is scrolled
1262 horizontally to the left. Normally, this is 0.
1265 Vertical scroll amount, in pixels. Normally, this is 0.
1268 Non-@code{nil} if this window is dedicated to its buffer.
1271 The window's display table, or @code{nil} if none is specified for it.
1273 @item update_mode_line
1274 Non-@code{nil} means this window's mode line needs to be updated.
1276 @item base_line_number
1277 The line number of a certain position in the buffer, or @code{nil}.
1278 This is used for displaying the line number of point in the mode line.
1281 The position in the buffer for which the line number is known, or
1282 @code{nil} meaning none is known.
1284 @item region_showing
1285 If the region (or part of it) is highlighted in this window, this field
1286 holds the mark position that made one end of that region. Otherwise,
1287 this field is @code{nil}.
1289 @item column_number_displayed
1290 The column number currently displayed in this window's mode line, or @code{nil}
1291 if column numbers are not being displayed.
1293 @item current_matrix
1294 A glyph matrix describing the current display of this window.
1296 @item desired_matrix
1297 A glyph matrix describing the desired display of this window.
1300 @node Process Internals
1301 @appendixsubsec Process Internals
1302 @cindex internals, of process
1303 @cindex process internals
1305 The fields of a process are:
1309 A string, the name of the process.
1312 A list containing the command arguments that were used to start this
1313 process. For a network or serial process, it is @code{nil} if the
1314 process is running or @code{t} if the process is stopped.
1317 A function used to accept output from the process instead of a buffer,
1321 A function called whenever the process receives a signal, or @code{nil}.
1324 The associated buffer of the process.
1327 An integer, the operating system's process @acronym{ID}.
1330 A flag, non-@code{nil} if this is really a child process.
1331 It is @code{nil} for a network or serial connection.
1334 A marker indicating the position of the end of the last output from this
1335 process inserted into the buffer. This is often but not always the end
1338 @item kill_without_query
1339 If this is non-zero, killing Emacs while this process is still running
1340 does not ask for confirmation about killing the process.
1342 @item raw_status_low
1343 @itemx raw_status_high
1344 These two fields record 16 bits each of the process status returned by
1345 the @code{wait} system call.
1348 The process status, as @code{process-status} should return it.
1352 If these two fields are not equal, a change in the status of the process
1353 needs to be reported, either by running the sentinel or by inserting a
1354 message in the process buffer.
1357 Non-@code{nil} if communication with the subprocess uses a @acronym{PTY};
1358 @code{nil} if it uses a pipe.
1361 The file descriptor for input from the process.
1364 The file descriptor for output to the process.
1367 The file descriptor for the terminal that the subprocess is using. (On
1368 some systems, there is no need to record this, so the value is
1372 The name of the terminal that the subprocess is using,
1373 or @code{nil} if it is using pipes.
1375 @item decode_coding_system
1376 Coding-system for decoding the input from this process.
1379 A working buffer for decoding.
1381 @item decoding_carryover
1382 Size of carryover in decoding.
1384 @item encode_coding_system
1385 Coding-system for encoding the output to this process.
1388 A working buffer for encoding.
1390 @item encoding_carryover
1391 Size of carryover in encoding.
1393 @item inherit_coding_system_flag
1394 Flag to set @code{coding-system} of the process buffer from the
1395 coding system used to decode process output.
1398 Symbol indicating the type of process: @code{real}, @code{network},