2 @c This is part of the GNU Emacs Lisp Reference Manual.
3 @c Copyright (C) 1990-1993, 1998-1999, 2001-2015 Free Software
5 @c See the file elisp.texi for copying conditions.
6 @node GNU Emacs Internals
7 @appendix GNU Emacs Internals
9 This chapter describes how the runnable Emacs executable is dumped with
10 the preloaded Lisp libraries in it, how storage is allocated, and some
11 internal aspects of GNU Emacs that may be of interest to C programmers.
14 * Building Emacs:: How the dumped Emacs is made.
15 * Pure Storage:: Kludge to make preloaded Lisp functions shareable.
16 * Garbage Collection:: Reclaiming space for Lisp objects no longer used.
17 * Memory Usage:: Info about total size of Lisp objects made so far.
18 * C Dialect:: What C variant Emacs is written in.
19 * Writing Emacs Primitives:: Writing C code for Emacs.
20 * Object Internals:: Data formats of buffers, windows, processes.
21 * C Integer Types:: How C integer types are used inside Emacs.
25 @section Building Emacs
26 @cindex building Emacs
29 This section explains the steps involved in building the Emacs
30 executable. You don't have to know this material to build and install
31 Emacs, since the makefiles do all these things automatically. This
32 information is pertinent to Emacs developers.
34 Compilation of the C source files in the @file{src} directory
35 produces an executable file called @file{temacs}, also called a
36 @dfn{bare impure Emacs}. It contains the Emacs Lisp interpreter and
37 I/O routines, but not the editing commands.
39 @cindex @file{loadup.el}
40 The command @w{@command{temacs -l loadup}} would run @file{temacs}
41 and direct it to load @file{loadup.el}. The @code{loadup} library
42 loads additional Lisp libraries, which set up the normal Emacs editing
43 environment. After this step, the Emacs executable is no longer
47 Because it takes some time to load the standard Lisp files, the
48 @file{temacs} executable usually isn't run directly by users.
49 Instead, as one of the last steps of building Emacs, the command
50 @samp{temacs -batch -l loadup dump} is run. The special @samp{dump}
51 argument causes @command{temacs} to dump out an executable program,
52 called @file{emacs}, which has all the standard Lisp files preloaded.
53 (The @samp{-batch} argument prevents @file{temacs} from trying to
54 initialize any of its data on the terminal, so that the tables of
55 terminal information are empty in the dumped Emacs.)
57 @cindex preloaded Lisp files
58 @vindex preloaded-file-list
59 The dumped @file{emacs} executable (also called a @dfn{pure} Emacs)
60 is the one which is installed. The variable
61 @code{preloaded-file-list} stores a list of the Lisp files preloaded
62 into the dumped Emacs. If you port Emacs to a new operating system,
63 and are not able to implement dumping, then Emacs must load
64 @file{loadup.el} each time it starts.
66 @cindex @file{site-load.el}
67 You can specify additional files to preload by writing a library named
68 @file{site-load.el} that loads them. You may need to rebuild Emacs
69 with an added definition
72 #define SITELOAD_PURESIZE_EXTRA @var{n}
76 to make @var{n} added bytes of pure space to hold the additional files;
77 see @file{src/puresize.h}.
78 (Try adding increments of 20000 until it is big enough.) However, the
79 advantage of preloading additional files decreases as machines get
80 faster. On modern machines, it is usually not advisable.
82 After @file{loadup.el} reads @file{site-load.el}, it finds the
83 documentation strings for primitive and preloaded functions (and
84 variables) in the file @file{etc/DOC} where they are stored, by
85 calling @code{Snarf-documentation} (@pxref{Definition of
86 Snarf-documentation,, Accessing Documentation}).
88 @cindex @file{site-init.el}
89 @cindex preloading additional functions and variables
90 You can specify other Lisp expressions to execute just before dumping
91 by putting them in a library named @file{site-init.el}. This file is
92 executed after the documentation strings are found.
94 If you want to preload function or variable definitions, there are
95 three ways you can do this and make their documentation strings
96 accessible when you subsequently run Emacs:
100 Arrange to scan these files when producing the @file{etc/DOC} file,
101 and load them with @file{site-load.el}.
104 Load the files with @file{site-init.el}, then copy the files into the
105 installation directory for Lisp files when you install Emacs.
108 Specify a @code{nil} value for @code{byte-compile-dynamic-docstrings}
109 as a local variable in each of these files, and load them with either
110 @file{site-load.el} or @file{site-init.el}. (This method has the
111 drawback that the documentation strings take up space in Emacs all the
115 @cindex change @code{load-path} at configure time
116 @cindex @option{--enable-locallisppath} option to @command{configure}
117 It is not advisable to put anything in @file{site-load.el} or
118 @file{site-init.el} that would alter any of the features that users
119 expect in an ordinary unmodified Emacs. If you feel you must override
120 normal features for your site, do it with @file{default.el}, so that
121 users can override your changes if they wish. @xref{Startup Summary}.
122 Note that if either @file{site-load.el} or @file{site-init.el} changes
123 @code{load-path}, the changes will be lost after dumping.
124 @xref{Library Search}. To make a permanent change to
125 @code{load-path}, use the @option{--enable-locallisppath} option
126 of @command{configure}.
128 In a package that can be preloaded, it is sometimes necessary (or
129 useful) to delay certain evaluations until Emacs subsequently starts
130 up. The vast majority of such cases relate to the values of
131 customizable variables. For example, @code{tutorial-directory} is a
132 variable defined in @file{startup.el}, which is preloaded. The default
133 value is set based on @code{data-directory}. The variable needs to
134 access the value of @code{data-directory} when Emacs starts, not when
135 it is dumped, because the Emacs executable has probably been installed
136 in a different location since it was dumped.
138 @defun custom-initialize-delay symbol value
139 This function delays the initialization of @var{symbol} to the next
140 Emacs start. You normally use this function by specifying it as the
141 @code{:initialize} property of a customizable variable. (The argument
142 @var{value} is unused, and is provided only for compatibility with the
143 form Custom expects.)
146 In the unlikely event that you need a more general functionality than
147 @code{custom-initialize-delay} provides, you can use
148 @code{before-init-hook} (@pxref{Startup Summary}).
150 @defun dump-emacs to-file from-file
152 This function dumps the current state of Emacs into an executable file
153 @var{to-file}. It takes symbols from @var{from-file} (this is normally
154 the executable file @file{temacs}).
156 If you want to use this function in an Emacs that was already dumped,
157 you must run Emacs with @samp{-batch}.
161 @section Pure Storage
164 Emacs Lisp uses two kinds of storage for user-created Lisp objects:
165 @dfn{normal storage} and @dfn{pure storage}. Normal storage is where
166 all the new data created during an Emacs session are kept
167 (@pxref{Garbage Collection}). Pure storage is used for certain data
168 in the preloaded standard Lisp files---data that should never change
169 during actual use of Emacs.
171 Pure storage is allocated only while @command{temacs} is loading the
172 standard preloaded Lisp libraries. In the file @file{emacs}, it is
173 marked as read-only (on operating systems that permit this), so that
174 the memory space can be shared by all the Emacs jobs running on the
175 machine at once. Pure storage is not expandable; a fixed amount is
176 allocated when Emacs is compiled, and if that is not sufficient for
177 the preloaded libraries, @file{temacs} allocates dynamic memory for
178 the part that didn't fit. The resulting image will work, but garbage
179 collection (@pxref{Garbage Collection}) is disabled in this situation,
180 causing a memory leak. Such an overflow normally won't happen unless
181 you try to preload additional libraries or add features to the
182 standard ones. Emacs will display a warning about the overflow when
183 it starts. If this happens, you should increase the compilation
184 parameter @code{SYSTEM_PURESIZE_EXTRA} in the file
185 @file{src/puresize.h} and rebuild Emacs.
187 @defun purecopy object
188 This function makes a copy in pure storage of @var{object}, and returns
189 it. It copies a string by simply making a new string with the same
190 characters, but without text properties, in pure storage. It
191 recursively copies the contents of vectors and cons cells. It does
192 not make copies of other objects such as symbols, but just returns
193 them unchanged. It signals an error if asked to copy markers.
195 This function is a no-op except while Emacs is being built and dumped;
196 it is usually called only in preloaded Lisp files.
199 @defvar pure-bytes-used
200 The value of this variable is the number of bytes of pure storage
201 allocated so far. Typically, in a dumped Emacs, this number is very
202 close to the total amount of pure storage available---if it were not,
203 we would preallocate less.
207 This variable determines whether @code{defun} should make a copy of the
208 function definition in pure storage. If it is non-@code{nil}, then the
209 function definition is copied into pure storage.
211 This flag is @code{t} while loading all of the basic functions for
212 building Emacs initially (allowing those functions to be shareable and
213 non-collectible). Dumping Emacs as an executable always writes
214 @code{nil} in this variable, regardless of the value it actually has
215 before and after dumping.
217 You should not change this flag in a running Emacs.
220 @node Garbage Collection
221 @section Garbage Collection
223 @cindex memory allocation
224 When a program creates a list or the user defines a new function
225 (such as by loading a library), that data is placed in normal storage.
226 If normal storage runs low, then Emacs asks the operating system to
227 allocate more memory. Different types of Lisp objects, such as
228 symbols, cons cells, small vectors, markers, etc., are segregated in
229 distinct blocks in memory. (Large vectors, long strings, buffers and
230 certain other editing types, which are fairly large, are allocated in
231 individual blocks, one per object; small strings are packed into blocks
232 of 8k bytes, and small vectors are packed into blocks of 4k bytes).
234 @cindex vector-like objects, storage
235 @cindex storage of vector-like Lisp objects
236 Beyond the basic vector, a lot of objects like window, buffer, and
237 frame are managed as if they were vectors. The corresponding C data
238 structures include the @code{struct vectorlike_header} field whose
239 @code{size} member contains the subtype enumerated by @code{enum pvec_type}
240 and an information about how many @code{Lisp_Object} fields this structure
241 contains and what the size of the rest data is. This information is
242 needed to calculate the memory footprint of an object, and used
243 by the vector allocation code while iterating over the vector blocks.
245 @cindex garbage collection
246 It is quite common to use some storage for a while, then release it
247 by (for example) killing a buffer or deleting the last pointer to an
248 object. Emacs provides a @dfn{garbage collector} to reclaim this
249 abandoned storage. The garbage collector operates by finding and
250 marking all Lisp objects that are still accessible to Lisp programs.
251 To begin with, it assumes all the symbols, their values and associated
252 function definitions, and any data presently on the stack, are
253 accessible. Any objects that can be reached indirectly through other
254 accessible objects are also accessible.
256 When marking is finished, all objects still unmarked are garbage. No
257 matter what the Lisp program or the user does, it is impossible to refer
258 to them, since there is no longer a way to reach them. Their space
259 might as well be reused, since no one will miss them. The second
260 (``sweep'') phase of the garbage collector arranges to reuse them.
262 @c ??? Maybe add something describing weak hash tables here?
265 The sweep phase puts unused cons cells onto a @dfn{free list}
266 for future allocation; likewise for symbols and markers. It compacts
267 the accessible strings so they occupy fewer 8k blocks; then it frees the
268 other 8k blocks. Unreachable vectors from vector blocks are coalesced
269 to create largest possible free areas; if a free area spans a complete
270 4k block, that block is freed. Otherwise, the free area is recorded
271 in a free list array, where each entry corresponds to a free list
272 of areas of the same size. Large vectors, buffers, and other large
273 objects are allocated and freed individually.
275 @cindex CL note---allocate more storage
277 @b{Common Lisp note:} Unlike other Lisps, GNU Emacs Lisp does not
278 call the garbage collector when the free list is empty. Instead, it
279 simply requests the operating system to allocate more storage, and
280 processing continues until @code{gc-cons-threshold} bytes have been
283 This means that you can make sure that the garbage collector will not
284 run during a certain portion of a Lisp program by calling the garbage
285 collector explicitly just before it (provided that portion of the
286 program does not use so much space as to force a second garbage
290 @deffn Command garbage-collect
291 This command runs a garbage collection, and returns information on
292 the amount of space in use. (Garbage collection can also occur
293 spontaneously if you use more than @code{gc-cons-threshold} bytes of
294 Lisp data since the previous garbage collection.)
296 @code{garbage-collect} returns a list with information on amount of space in
297 use, where each entry has the form @samp{(@var{name} @var{size} @var{used})}
298 or @samp{(@var{name} @var{size} @var{used} @var{free})}. In the entry,
299 @var{name} is a symbol describing the kind of objects this entry represents,
300 @var{size} is the number of bytes used by each one, @var{used} is the number
301 of those objects that were found live in the heap, and optional @var{free} is
302 the number of those objects that are not live but that Emacs keeps around for
303 future allocations. So an overall result is:
306 ((@code{conses} @var{cons-size} @var{used-conses} @var{free-conses})
307 (@code{symbols} @var{symbol-size} @var{used-symbols} @var{free-symbols})
308 (@code{miscs} @var{misc-size} @var{used-miscs} @var{free-miscs})
309 (@code{strings} @var{string-size} @var{used-strings} @var{free-strings})
310 (@code{string-bytes} @var{byte-size} @var{used-bytes})
311 (@code{vectors} @var{vector-size} @var{used-vectors})
312 (@code{vector-slots} @var{slot-size} @var{used-slots} @var{free-slots})
313 (@code{floats} @var{float-size} @var{used-floats} @var{free-floats})
314 (@code{intervals} @var{interval-size} @var{used-intervals} @var{free-intervals})
315 (@code{buffers} @var{buffer-size} @var{used-buffers})
316 (@code{heap} @var{unit-size} @var{total-size} @var{free-size}))
323 @result{} ((conses 16 49126 8058) (symbols 48 14607 0)
324 (miscs 40 34 56) (strings 32 2942 2607)
325 (string-bytes 1 78607) (vectors 16 7247)
326 (vector-slots 8 341609 29474) (floats 8 71 102)
327 (intervals 56 27 26) (buffers 944 8)
328 (heap 1024 11715 2678))
331 Below is a table explaining each element. Note that last @code{heap} entry
332 is optional and present only if an underlying @code{malloc} implementation
333 provides @code{mallinfo} function.
337 Internal size of a cons cell, i.e., @code{sizeof (struct Lisp_Cons)}.
340 The number of cons cells in use.
343 The number of cons cells for which space has been obtained from
344 the operating system, but that are not currently being used.
347 Internal size of a symbol, i.e., @code{sizeof (struct Lisp_Symbol)}.
350 The number of symbols in use.
353 The number of symbols for which space has been obtained from
354 the operating system, but that are not currently being used.
357 Internal size of a miscellaneous entity, i.e.,
358 @code{sizeof (union Lisp_Misc)}, which is a size of the
359 largest type enumerated in @code{enum Lisp_Misc_Type}.
362 The number of miscellaneous objects in use. These include markers
363 and overlays, plus certain objects not visible to users.
366 The number of miscellaneous objects for which space has been obtained
367 from the operating system, but that are not currently being used.
370 Internal size of a string header, i.e., @code{sizeof (struct Lisp_String)}.
373 The number of string headers in use.
376 The number of string headers for which space has been obtained
377 from the operating system, but that are not currently being used.
380 This is used for convenience and equals to @code{sizeof (char)}.
383 The total size of all string data in bytes.
386 Internal size of a vector header, i.e., @code{sizeof (struct Lisp_Vector)}.
389 The number of vector headers allocated from the vector blocks.
392 Internal size of a vector slot, always equal to @code{sizeof (Lisp_Object)}.
395 The number of slots in all used vectors.
398 The number of free slots in all vector blocks.
401 Internal size of a float object, i.e., @code{sizeof (struct Lisp_Float)}.
402 (Do not confuse it with the native platform @code{float} or @code{double}.)
405 The number of floats in use.
408 The number of floats for which space has been obtained from
409 the operating system, but that are not currently being used.
412 Internal size of an interval object, i.e., @code{sizeof (struct interval)}.
415 The number of intervals in use.
418 The number of intervals for which space has been obtained from
419 the operating system, but that are not currently being used.
422 Internal size of a buffer, i.e., @code{sizeof (struct buffer)}.
423 (Do not confuse with the value returned by @code{buffer-size} function.)
426 The number of buffer objects in use. This includes killed buffers
427 invisible to users, i.e., all buffers in @code{all_buffers} list.
430 The unit of heap space measurement, always equal to 1024 bytes.
433 Total heap size, in @var{unit-size} units.
436 Heap space which is not currently used, in @var{unit-size} units.
439 If there was overflow in pure space (@pxref{Pure Storage}),
440 @code{garbage-collect} returns @code{nil}, because a real garbage
441 collection cannot be done.
444 @defopt garbage-collection-messages
445 If this variable is non-@code{nil}, Emacs displays a message at the
446 beginning and end of garbage collection. The default value is
451 This is a normal hook that is run at the end of garbage collection.
452 Garbage collection is inhibited while the hook functions run, so be
453 careful writing them.
456 @defopt gc-cons-threshold
457 The value of this variable is the number of bytes of storage that must
458 be allocated for Lisp objects after one garbage collection in order to
459 trigger another garbage collection. You can use the result returned by
460 @code{garbage-collect} to get an information about size of the particular
461 object type; space allocated to the contents of buffers does not count.
462 Note that the subsequent garbage collection does not happen immediately
463 when the threshold is exhausted, but only the next time the Lisp interpreter
466 The initial threshold value is @code{GC_DEFAULT_THRESHOLD}, defined in
467 @file{alloc.c}. Since it's defined in @code{word_size} units, the value
468 is 400,000 for the default 32-bit configuration and 800,000 for the 64-bit
469 one. If you specify a larger value, garbage collection will happen less
470 often. This reduces the amount of time spent garbage collecting, but
471 increases total memory use. You may want to do this when running a program
472 that creates lots of Lisp data.
474 You can make collections more frequent by specifying a smaller value, down
475 to 1/10th of @code{GC_DEFAULT_THRESHOLD}. A value less than this minimum
476 will remain in effect only until the subsequent garbage collection, at which
477 time @code{garbage-collect} will set the threshold back to the minimum.
480 @defopt gc-cons-percentage
481 The value of this variable specifies the amount of consing before a
482 garbage collection occurs, as a fraction of the current heap size.
483 This criterion and @code{gc-cons-threshold} apply in parallel, and
484 garbage collection occurs only when both criteria are satisfied.
486 As the heap size increases, the time to perform a garbage collection
487 increases. Thus, it can be desirable to do them less frequently in
491 The value returned by @code{garbage-collect} describes the amount of
492 memory used by Lisp data, broken down by data type. By contrast, the
493 function @code{memory-limit} provides information on the total amount of
494 memory Emacs is currently using.
497 This function returns the address of the last byte Emacs has allocated,
498 divided by 1024. We divide the value by 1024 to make sure it fits in a
501 You can use this to get a general idea of how your actions affect the
506 This variable is @code{t} if Emacs is nearly out of memory for Lisp
507 objects, and @code{nil} otherwise.
510 @defun memory-use-counts
511 This returns a list of numbers that count the number of objects
512 created in this Emacs session. Each of these counters increments for
513 a certain kind of object. See the documentation string for details.
517 This variable contains the total number of garbage collections
518 done so far in this Emacs session.
522 This variable contains the total number of seconds of elapsed time
523 during garbage collection so far in this Emacs session, as a
524 floating-point number.
528 @section Memory Usage
531 These functions and variables give information about the total amount
532 of memory allocation that Emacs has done, broken down by data type.
533 Note the difference between these and the values returned by
534 @code{garbage-collect}; those count objects that currently exist, but
535 these count the number or size of all allocations, including those for
536 objects that have since been freed.
538 @defvar cons-cells-consed
539 The total number of cons cells that have been allocated so far
540 in this Emacs session.
543 @defvar floats-consed
544 The total number of floats that have been allocated so far
545 in this Emacs session.
548 @defvar vector-cells-consed
549 The total number of vector cells that have been allocated so far
550 in this Emacs session.
553 @defvar symbols-consed
554 The total number of symbols that have been allocated so far
555 in this Emacs session.
558 @defvar string-chars-consed
559 The total number of string characters that have been allocated so far
563 @defvar misc-objects-consed
564 The total number of miscellaneous objects that have been allocated so
565 far in this session. These include markers and overlays, plus
566 certain objects not visible to users.
569 @defvar intervals-consed
570 The total number of intervals that have been allocated so far
571 in this Emacs session.
574 @defvar strings-consed
575 The total number of strings that have been allocated so far in this
581 @cindex C programming language
583 The C part of Emacs is portable to C89: C99-specific features such as
584 @samp{<stdbool.h>} and @samp{inline} are not used without a check,
585 typically at configuration time, and the Emacs build procedure
586 provides a substitute implementation if necessary. Some C99 features,
587 such as declarations after statements, are too difficult to provide
588 substitutes for, so they are avoided entirely.
590 At some point in the not-too-distant future the base C dialect will
591 change from C89 to C99, and eventually it will no doubt change to C11.
593 @node Writing Emacs Primitives
594 @section Writing Emacs Primitives
595 @cindex primitive function internals
596 @cindex writing Emacs primitives
598 Lisp primitives are Lisp functions implemented in C@. The details of
599 interfacing the C function so that Lisp can call it are handled by a few
600 C macros. The only way to really understand how to write new C code is
601 to read the source, but we can explain some things here.
603 An example of a special form is the definition of @code{or}, from
604 @file{eval.c}. (An ordinary function would have the same general
607 @cindex garbage collection protection
610 DEFUN ("or", For, Sor, 0, UNEVALLED, 0,
611 doc: /* Eval args until one of them yields non-nil, then return
613 The remaining args are not evalled at all.
614 If all args return nil, return nil.
617 usage: (or CONDITIONS ...) */)
620 register Lisp_Object val = Qnil;
631 val = eval_sub (XCAR (args));
645 @cindex @code{DEFUN}, C macro to define Lisp primitives
646 Let's start with a precise explanation of the arguments to the
647 @code{DEFUN} macro. Here is a template for them:
650 DEFUN (@var{lname}, @var{fname}, @var{sname}, @var{min}, @var{max}, @var{interactive}, @var{doc})
655 This is the name of the Lisp symbol to define as the function name; in
656 the example above, it is @code{or}.
659 This is the C function name for this function. This is the name that
660 is used in C code for calling the function. The name is, by
661 convention, @samp{F} prepended to the Lisp name, with all dashes
662 (@samp{-}) in the Lisp name changed to underscores. Thus, to call
663 this function from C code, call @code{For}.
666 This is a C variable name to use for a structure that holds the data for
667 the subr object that represents the function in Lisp. This structure
668 conveys the Lisp symbol name to the initialization routine that will
669 create the symbol and store the subr object as its definition. By
670 convention, this name is always @var{fname} with @samp{F} replaced with
674 This is the minimum number of arguments that the function requires. The
675 function @code{or} allows a minimum of zero arguments.
678 This is the maximum number of arguments that the function accepts, if
679 there is a fixed maximum. Alternatively, it can be @code{UNEVALLED},
680 indicating a special form that receives unevaluated arguments, or
681 @code{MANY}, indicating an unlimited number of evaluated arguments (the
682 equivalent of @code{&rest}). Both @code{UNEVALLED} and @code{MANY} are
683 macros. If @var{max} is a number, it must be more than @var{min} but
686 @cindex interactive specification in primitives
688 This is an interactive specification, a string such as might be used
689 as the argument of @code{interactive} in a Lisp function. In the case
690 of @code{or}, it is 0 (a null pointer), indicating that @code{or}
691 cannot be called interactively. A value of @code{""} indicates a
692 function that should receive no arguments when called interactively.
693 If the value begins with a @samp{"(}, the string is evaluated as a
694 Lisp form. For example:
698 DEFUN ("foo", Ffoo, Sfoo, 0, UNEVALLED,
699 "(list (read-char-by-name \"Insert character: \")\
700 (prefix-numeric-value current-prefix-arg)\
707 This is the documentation string. It uses C comment syntax rather
708 than C string syntax because comment syntax requires nothing special
709 to include multiple lines. The @samp{doc:} identifies the comment
710 that follows as the documentation string. The @samp{/*} and @samp{*/}
711 delimiters that begin and end the comment are not part of the
712 documentation string.
714 If the last line of the documentation string begins with the keyword
715 @samp{usage:}, the rest of the line is treated as the argument list
716 for documentation purposes. This way, you can use different argument
717 names in the documentation string from the ones used in the C code.
718 @samp{usage:} is required if the function has an unlimited number of
721 All the usual rules for documentation strings in Lisp code
722 (@pxref{Documentation Tips}) apply to C code documentation strings
726 After the call to the @code{DEFUN} macro, you must write the
727 argument list for the C function, including the types for the
728 arguments. If the primitive accepts a fixed maximum number of Lisp
729 arguments, there must be one C argument for each Lisp argument, and
730 each argument must be of type @code{Lisp_Object}. (Various macros and
731 functions for creating values of type @code{Lisp_Object} are declared
732 in the file @file{lisp.h}.) If the primitive has no upper limit on
733 the number of Lisp arguments, it must have exactly two C arguments:
734 the first is the number of Lisp arguments, and the second is the
735 address of a block containing their values. These have types
736 @code{int} and @w{@code{Lisp_Object *}} respectively. Since
737 @code{Lisp_Object} can hold any Lisp object of any data type, you
738 can determine the actual data type only at run time; so if you want
739 a primitive to accept only a certain type of argument, you must check
740 the type explicitly using a suitable predicate (@pxref{Type Predicates}).
741 @cindex type checking internals
743 @cindex @code{GCPRO} and @code{UNGCPRO}
744 @cindex protect C variables from garbage collection
745 Within the function @code{For} itself, note the use of the macros
746 @code{GCPRO1} and @code{UNGCPRO}. These macros are defined for the
747 sake of the few platforms which do not use Emacs' default
748 stack-marking garbage collector. The @code{GCPRO1} macro ``protects''
749 a variable from garbage collection, explicitly informing the garbage
750 collector that that variable and all its contents must be as
751 accessible. GC protection is necessary in any function which can
752 perform Lisp evaluation by calling @code{eval_sub} or @code{Feval} as
753 a subroutine, either directly or indirectly.
755 It suffices to ensure that at least one pointer to each object is
756 GC-protected. Thus, a particular local variable can do without
757 protection if it is certain that the object it points to will be
758 preserved by some other pointer (such as another local variable that
759 has a @code{GCPRO}). Otherwise, the local variable needs a
762 The macro @code{GCPRO1} protects just one local variable. If you
763 want to protect two variables, use @code{GCPRO2} instead; repeating
764 @code{GCPRO1} will not work. Macros @code{GCPRO3}, @code{GCPRO4},
765 @code{GCPRO5}, and @code{GCPRO6} also exist. All these macros
766 implicitly use local variables such as @code{gcpro1}; you must declare
767 these explicitly, with type @code{struct gcpro}. Thus, if you use
768 @code{GCPRO2}, you must declare @code{gcpro1} and @code{gcpro2}.
770 @code{UNGCPRO} cancels the protection of the variables that are
771 protected in the current function. It is necessary to do this
774 You must not use C initializers for static or global variables unless
775 the variables are never written once Emacs is dumped. These variables
776 with initializers are allocated in an area of memory that becomes
777 read-only (on certain operating systems) as a result of dumping Emacs.
780 @cindex @code{defsubr}, Lisp symbol for a primitive
781 Defining the C function is not enough to make a Lisp primitive
782 available; you must also create the Lisp symbol for the primitive and
783 store a suitable subr object in its function cell. The code looks like
787 defsubr (&@var{sname});
791 Here @var{sname} is the name you used as the third argument to @code{DEFUN}.
793 If you add a new primitive to a file that already has Lisp primitives
794 defined in it, find the function (near the end of the file) named
795 @code{syms_of_@var{something}}, and add the call to @code{defsubr}
796 there. If the file doesn't have this function, or if you create a new
797 file, add to it a @code{syms_of_@var{filename}} (e.g.,
798 @code{syms_of_myfile}). Then find the spot in @file{emacs.c} where all
799 of these functions are called, and add a call to
800 @code{syms_of_@var{filename}} there.
802 @anchor{Defining Lisp variables in C}
803 @vindex byte-boolean-vars
804 @cindex defining Lisp variables in C
805 @cindex @code{DEFVAR_INT}, @code{DEFVAR_LISP}, @code{DEFVAR_BOOL}
806 The function @code{syms_of_@var{filename}} is also the place to define
807 any C variables that are to be visible as Lisp variables.
808 @code{DEFVAR_LISP} makes a C variable of type @code{Lisp_Object} visible
809 in Lisp. @code{DEFVAR_INT} makes a C variable of type @code{int}
810 visible in Lisp with a value that is always an integer.
811 @code{DEFVAR_BOOL} makes a C variable of type @code{int} visible in Lisp
812 with a value that is either @code{t} or @code{nil}. Note that variables
813 defined with @code{DEFVAR_BOOL} are automatically added to the list
814 @code{byte-boolean-vars} used by the byte compiler.
816 @cindex defining customization variables in C
817 If you want to make a Lisp variables that is defined in C behave
818 like one declared with @code{defcustom}, add an appropriate entry to
821 @cindex @code{staticpro}, protection from GC
822 If you define a file-scope C variable of type @code{Lisp_Object},
823 you must protect it from garbage-collection by calling @code{staticpro}
824 in @code{syms_of_@var{filename}}, like this:
827 staticpro (&@var{variable});
830 Here is another example function, with more complicated arguments.
831 This comes from the code in @file{window.c}, and it demonstrates the use
832 of macros and functions to manipulate Lisp objects.
836 DEFUN ("coordinates-in-window-p", Fcoordinates_in_window_p,
837 Scoordinates_in_window_p, 2, 2, 0,
838 doc: /* Return non-nil if COORDINATES are in WINDOW.
842 or `right-margin' is returned. */)
843 (register Lisp_Object coordinates, Lisp_Object window)
852 CHECK_LIVE_WINDOW (window);
853 w = XWINDOW (window);
854 f = XFRAME (w->frame);
855 CHECK_CONS (coordinates);
856 lx = Fcar (coordinates);
857 ly = Fcdr (coordinates);
858 CHECK_NUMBER_OR_FLOAT (lx);
859 CHECK_NUMBER_OR_FLOAT (ly);
860 x = FRAME_PIXEL_X_FROM_CANON_X (f, lx) + FRAME_INTERNAL_BORDER_WIDTH(f);
861 y = FRAME_PIXEL_Y_FROM_CANON_Y (f, ly) + FRAME_INTERNAL_BORDER_WIDTH(f);
865 switch (coordinates_in_window (w, x, y))
867 case ON_NOTHING: /* NOT in window at all. */
874 case ON_MODE_LINE: /* In mode line of window. */
881 case ON_SCROLL_BAR: /* On scroll-bar of window. */
882 /* Historically we are supposed to return nil in this case. */
894 Note that C code cannot call functions by name unless they are defined
895 in C@. The way to call a function written in Lisp is to use
896 @code{Ffuncall}, which embodies the Lisp function @code{funcall}. Since
897 the Lisp function @code{funcall} accepts an unlimited number of
898 arguments, in C it takes two: the number of Lisp-level arguments, and a
899 one-dimensional array containing their values. The first Lisp-level
900 argument is the Lisp function to call, and the rest are the arguments to
901 pass to it. Since @code{Ffuncall} can call the evaluator, you must
902 protect pointers from garbage collection around the call to
905 The C functions @code{call0}, @code{call1}, @code{call2}, and so on,
906 provide handy ways to call a Lisp function conveniently with a fixed
907 number of arguments. They work by calling @code{Ffuncall}.
909 @file{eval.c} is a very good file to look through for examples;
910 @file{lisp.h} contains the definitions for some important macros and
913 If you define a function which is side-effect free, update the code
914 in @file{byte-opt.el} that binds @code{side-effect-free-fns} and
915 @code{side-effect-and-error-free-fns} so that the compiler optimizer
918 @node Object Internals
919 @section Object Internals
920 @cindex object internals
922 Emacs Lisp provides a rich set of the data types. Some of them, like cons
923 cells, integers and strings, are common to nearly all Lisp dialects. Some
924 others, like markers and buffers, are quite special and needed to provide
925 the basic support to write editor commands in Lisp. To implement such
926 a variety of object types and provide an efficient way to pass objects between
927 the subsystems of an interpreter, there is a set of C data structures and
928 a special type to represent the pointers to all of them, which is known as
929 @dfn{tagged pointer}.
931 In C, the tagged pointer is an object of type @code{Lisp_Object}. Any
932 initialized variable of such a type always holds the value of one of the
933 following basic data types: integer, symbol, string, cons cell, float,
934 vectorlike or miscellaneous object. Each of these data types has the
935 corresponding tag value. All tags are enumerated by @code{enum Lisp_Type}
936 and placed into a 3-bit bitfield of the @code{Lisp_Object}. The rest of the
937 bits is the value itself. Integers are immediate, i.e., directly
938 represented by those @dfn{value bits}, and all other objects are represented
939 by the C pointers to a corresponding object allocated from the heap. Width
940 of the @code{Lisp_Object} is platform- and configuration-dependent: usually
941 it's equal to the width of an underlying platform pointer (i.e., 32-bit on
942 a 32-bit machine and 64-bit on a 64-bit one), but also there is a special
943 configuration where @code{Lisp_Object} is 64-bit but all pointers are 32-bit.
944 The latter trick was designed to overcome the limited range of values for
945 Lisp integers on a 32-bit system by using 64-bit @code{long long} type for
948 The following C data structures are defined in @file{lisp.h} to represent
949 the basic data types beyond integers:
952 @item struct Lisp_Cons
953 Cons cell, an object used to construct lists.
955 @item struct Lisp_String
956 String, the basic object to represent a sequence of characters.
958 @item struct Lisp_Vector
959 Array, a fixed-size set of Lisp objects which may be accessed by an index.
961 @item struct Lisp_Symbol
962 Symbol, the unique-named entity commonly used as an identifier.
964 @item struct Lisp_Float
965 Floating-point value.
967 @item union Lisp_Misc
968 Miscellaneous kinds of objects which don't fit into any of the above.
971 These types are the first-class citizens of an internal type system.
972 Since the tag space is limited, all other types are the subtypes of either
973 @code{Lisp_Vectorlike} or @code{Lisp_Misc}. Vector subtypes are enumerated
974 by @code{enum pvec_type}, and nearly all complex objects like windows, buffers,
975 frames, and processes fall into this category. The rest of special types,
976 including markers and overlays, are enumerated by @code{enum Lisp_Misc_Type}
977 and form the set of subtypes of @code{Lisp_Misc}.
979 Below there is a description of a few subtypes of @code{Lisp_Vectorlike}.
980 Buffer object represents the text to display and edit. Window is the part
981 of display structure which shows the buffer or used as a container to
982 recursively place other windows on the same frame. (Do not confuse Emacs Lisp
983 window object with the window as an entity managed by the user interface
984 system like X; in Emacs terminology, the latter is called frame.) Finally,
985 process object is used to manage the subprocesses.
988 * Buffer Internals:: Components of a buffer structure.
989 * Window Internals:: Components of a window structure.
990 * Process Internals:: Components of a process structure.
993 @node Buffer Internals
994 @subsection Buffer Internals
995 @cindex internals, of buffer
996 @cindex buffer internals
998 Two structures (see @file{buffer.h}) are used to represent buffers
999 in C@. The @code{buffer_text} structure contains fields describing the
1000 text of a buffer; the @code{buffer} structure holds other fields. In
1001 the case of indirect buffers, two or more @code{buffer} structures
1002 reference the same @code{buffer_text} structure.
1004 Here are some of the fields in @code{struct buffer_text}:
1008 The address of the buffer contents.
1012 The character and byte positions of the buffer gap. @xref{Buffer
1017 The character and byte positions of the end of the buffer text.
1020 The size of buffer's gap. @xref{Buffer Gap}.
1025 @itemx overlay_modiff
1026 These fields count the number of buffer-modification events performed
1027 in this buffer. @code{modiff} is incremented after each
1028 buffer-modification event, and is never otherwise changed;
1029 @code{save_modiff} contains the value of @code{modiff} the last time
1030 the buffer was visited or saved; @code{chars_modiff} counts only
1031 modifications to the characters in the buffer, ignoring all other
1032 kinds of changes; and @code{overlay_modiff} counts only modifications
1036 @itemx end_unchanged
1037 The number of characters at the start and end of the text that are
1038 known to be unchanged since the last complete redisplay.
1040 @item unchanged_modified
1041 @itemx overlay_unchanged_modified
1042 The values of @code{modiff} and @code{overlay_modiff}, respectively,
1043 after the last complete redisplay. If their current values match
1044 @code{modiff} or @code{overlay_modiff}, that means
1045 @code{beg_unchanged} and @code{end_unchanged} contain no useful
1049 The markers that refer to this buffer. This is actually a single
1050 marker, and successive elements in its marker @code{chain} are the other
1051 markers referring to this buffer text.
1054 The interval tree which records the text properties of this buffer.
1057 Some of the fields of @code{struct buffer} are:
1061 A header of type @code{struct vectorlike_header} is common to all
1065 A @code{struct buffer_text} structure that ordinarily holds the buffer
1066 contents. In indirect buffers, this field is not used.
1069 A pointer to the @code{buffer_text} structure for this buffer. In an
1070 ordinary buffer, this is the @code{own_text} field above. In an
1071 indirect buffer, this is the @code{own_text} field of the base buffer.
1074 A pointer to the next buffer, in the chain of all buffers, including
1075 killed buffers. This chain is used only for allocation and garbage
1076 collection, in order to collect killed buffers properly.
1080 The character and byte positions of point in a buffer.
1084 The character and byte positions of the beginning of the accessible
1085 range of text in the buffer.
1089 The character and byte positions of the end of the accessible range of
1093 In an indirect buffer, this points to the base buffer. In an ordinary
1097 This field contains flags indicating that certain variables are local
1098 in this buffer. Such variables are declared in the C code using
1099 @code{DEFVAR_PER_BUFFER}, and their buffer-local bindings are stored
1100 in fields in the buffer structure itself. (Some of these fields are
1101 described in this table.)
1104 The modification time of the visited file. It is set when the file is
1105 written or read. Before writing the buffer into a file, this field is
1106 compared to the modification time of the file to see if the file has
1107 changed on disk. @xref{Buffer Modification}.
1109 @item auto_save_modified
1110 The time when the buffer was last auto-saved.
1112 @item last_window_start
1113 The @code{window-start} position in the buffer as of the last time the
1114 buffer was displayed in a window.
1117 This flag indicates that narrowing has changed in the buffer.
1120 @item prevent_redisplay_optimizations_p
1121 This flag indicates that redisplay optimizations should not be used to
1122 display this buffer.
1124 @item overlay_center
1125 This field holds the current overlay center position. @xref{Managing
1128 @item overlays_before
1129 @itemx overlays_after
1130 These fields hold, respectively, a list of overlays that end at or
1131 before the current overlay center, and a list of overlays that end
1132 after the current overlay center. @xref{Managing Overlays}.
1133 @code{overlays_before} is sorted in order of decreasing end position,
1134 and @code{overlays_after} is sorted in order of increasing beginning
1137 @c FIXME? the following are now all Lisp_Object BUFFER_INTERNAL_FIELD (foo).
1140 A Lisp string that names the buffer. It is guaranteed to be unique.
1141 @xref{Buffer Names}.
1144 The length of the file this buffer is visiting, when last read or
1145 saved. This and other fields concerned with saving are not kept in
1146 the @code{buffer_text} structure because indirect buffers are never
1150 The directory for expanding relative file names. This is the value of
1151 the buffer-local variable @code{default-directory} (@pxref{File Name Expansion}).
1154 The name of the file visited in this buffer, or @code{nil}. This is
1155 the value of the buffer-local variable @code{buffer-file-name}
1156 (@pxref{Buffer File Name}).
1160 @itemx auto_save_file_name
1161 @itemx auto_save_file_format
1164 @itemx file_truename
1165 @itemx invisibility_spec
1166 @itemx display_count
1168 These fields store the values of Lisp variables that are automatically
1169 buffer-local (@pxref{Buffer-Local Variables}), whose corresponding
1170 variable names have the additional prefix @code{buffer-} and have
1171 underscores replaced with dashes. For instance, @code{undo_list}
1172 stores the value of @code{buffer-undo-list}.
1175 The mark for the buffer. The mark is a marker, hence it is also
1176 included on the list @code{markers}. @xref{The Mark}.
1178 @item local_var_alist
1179 The association list describing the buffer-local variable bindings of
1180 this buffer, not including the built-in buffer-local bindings that
1181 have special slots in the buffer object. (Those slots are omitted
1182 from this table.) @xref{Buffer-Local Variables}.
1185 Symbol naming the major mode of this buffer, e.g., @code{lisp-mode}.
1188 Pretty name of the major mode, e.g., @code{"Lisp"}.
1193 @itemx category_table
1194 @itemx display_table
1195 These fields store the buffer's local keymap (@pxref{Keymaps}), abbrev
1196 table (@pxref{Abbrev Tables}), syntax table (@pxref{Syntax Tables}),
1197 category table (@pxref{Categories}), and display table (@pxref{Display
1200 @item downcase_table
1202 @itemx case_canon_table
1203 These fields store the conversion tables for converting text to lower
1204 case, upper case, and for canonicalizing text for case-fold search.
1208 An alist of the minor modes of this buffer.
1213 These fields are only used in an indirect buffer, or in a buffer that
1214 is the base of an indirect buffer. Each holds a marker that records
1215 @code{pt}, @code{begv}, and @code{zv} respectively, for this buffer
1216 when the buffer is not current.
1218 @item mode_line_format
1219 @itemx header_line_format
1220 @itemx case_fold_search
1224 @itemx auto_fill_function
1225 @itemx truncate_lines
1228 @itemx bidi_display_reordering
1229 @itemx bidi_paragraph_direction
1230 @itemx selective_display
1231 @itemx selective_display_ellipses
1232 @itemx overwrite_mode
1235 @itemx enable_multibyte_characters
1236 @itemx buffer_file_coding_system
1237 @itemx cache_long_line_scans
1238 @itemx point_before_scroll
1239 @itemx left_fringe_width
1240 @itemx right_fringe_width
1241 @itemx fringes_outside_margins
1242 @itemx scroll_bar_width
1243 @itemx indicate_empty_lines
1244 @itemx indicate_buffer_boundaries
1245 @itemx fringe_indicator_alist
1246 @itemx fringe_cursor_alist
1247 @itemx scroll_up_aggressively
1248 @itemx scroll_down_aggressively
1250 @itemx cursor_in_non_selected_windows
1251 These fields store the values of Lisp variables that are automatically
1252 buffer-local (@pxref{Buffer-Local Variables}), whose corresponding
1253 variable names have underscores replaced with dashes. For instance,
1254 @code{mode_line_format} stores the value of @code{mode-line-format}.
1256 @item last_selected_window
1257 This is the last window that was selected with this buffer in it, or @code{nil}
1258 if that window no longer displays this buffer.
1261 @node Window Internals
1262 @subsection Window Internals
1263 @cindex internals, of window
1264 @cindex window internals
1266 The fields of a window (for a complete list, see the definition of
1267 @code{struct window} in @file{window.h}) include:
1271 The frame that this window is on.
1274 Non-@code{nil} if this window is a minibuffer window.
1277 Internally, Emacs arranges windows in a tree; each group of siblings has
1278 a parent window whose area includes all the siblings. This field points
1279 to a window's parent.
1281 Parent windows do not display buffers, and play little role in display
1282 except to shape their child windows. Emacs Lisp programs usually have
1283 no access to the parent windows; they operate on the windows at the
1284 leaves of the tree, which actually display buffers.
1286 @c FIXME: These two slots and the `buffer' slot below were replaced
1287 @c with a single slot `contents' on 2013-03-28. --xfq
1290 These fields contain the window's leftmost child and its topmost child
1291 respectively. @code{hchild} is used if the window is subdivided
1292 horizontally by child windows, and @code{vchild} if it is subdivided
1293 vertically. In a live window, only one of @code{hchild}, @code{vchild},
1294 and @code{buffer} (q.v.@:) is non-@code{nil}.
1298 The next sibling and previous sibling of this window. @code{next} is
1299 @code{nil} if the window is the right-most or bottom-most in its group;
1300 @code{prev} is @code{nil} if it is the left-most or top-most in its
1304 The left-hand edge of the window, measured in columns, relative to the
1305 leftmost column in the frame (column 0).
1308 The top edge of the window, measured in lines, relative to the topmost
1309 line in the frame (line 0).
1313 The width and height of the window, measured in columns and lines
1314 respectively. The width includes the scroll bar and fringes, and/or
1315 the separator line on the right of the window (if any).
1318 The buffer that the window is displaying.
1321 A marker pointing to the position in the buffer that is the first
1322 character displayed in the window.
1325 @cindex window point internals
1326 This is the value of point in the current buffer when this window is
1327 selected; when it is not selected, it retains its previous value.
1330 If this flag is non-@code{nil}, it says that the window has been
1331 scrolled explicitly by the Lisp program. This affects what the next
1332 redisplay does if point is off the screen: instead of scrolling the
1333 window to show the text around point, it moves point to a location that
1336 @item frozen_window_start_p
1337 This field is set temporarily to 1 to indicate to redisplay that
1338 @code{start} of this window should not be changed, even if point
1341 @item start_at_line_beg
1342 Non-@code{nil} means current value of @code{start} was the beginning of a line
1346 This is the last time that the window was selected. The function
1347 @code{get-lru-window} uses this field.
1349 @item sequence_number
1350 A unique number assigned to this window when it was created.
1353 The @code{modiff} field of the window's buffer, as of the last time
1354 a redisplay completed in this window.
1356 @item last_overlay_modified
1357 The @code{overlay_modiff} field of the window's buffer, as of the last
1358 time a redisplay completed in this window.
1361 The buffer's value of point, as of the last time a redisplay completed
1365 A non-@code{nil} value means the window's buffer was ``modified'' when the
1366 window was last updated.
1368 @item vertical_scroll_bar
1369 This window's vertical scroll bar.
1371 @item left_margin_cols
1372 @itemx right_margin_cols
1373 The widths of the left and right margins in this window. A value of
1374 @code{nil} means no margin.
1376 @item left_fringe_width
1377 @itemx right_fringe_width
1378 The widths of the left and right fringes in this window. A value of
1379 @code{nil} or @code{t} means use the values of the frame.
1381 @item fringes_outside_margins
1382 A non-@code{nil} value means the fringes outside the display margins;
1383 othersize they are between the margin and the text.
1385 @item window_end_pos
1386 This is computed as @code{z} minus the buffer position of the last glyph
1387 in the current matrix of the window. The value is only valid if
1388 @code{window_end_valid} is not @code{nil}.
1390 @item window_end_bytepos
1391 The byte position corresponding to @code{window_end_pos}.
1393 @item window_end_vpos
1394 The window-relative vertical position of the line containing
1395 @code{window_end_pos}.
1397 @item window_end_valid
1398 This field is set to a non-@code{nil} value if @code{window_end_pos} is truly
1399 valid. This is @code{nil} if nontrivial redisplay is pre-empted, since in that
1400 case the display that @code{window_end_pos} was computed for did not get
1404 A structure describing where the cursor is in this window.
1407 The value of @code{cursor} as of the last redisplay that finished.
1410 A structure describing where the cursor of this window physically is.
1412 @item phys_cursor_type
1413 @c FIXME What is this?
1414 @c itemx phys_cursor_ascent
1415 @itemx phys_cursor_height
1416 @itemx phys_cursor_width
1417 The type, height, and width of the cursor that was last displayed on
1420 @item phys_cursor_on_p
1421 This field is non-zero if the cursor is physically on.
1424 Non-zero means the cursor in this window is logically off. This is
1425 used for blinking the cursor.
1427 @item last_cursor_off_p
1428 This field contains the value of @code{cursor_off_p} as of the time of
1431 @item must_be_updated_p
1432 This is set to 1 during redisplay when this window must be updated.
1435 This is the number of columns that the display in the window is scrolled
1436 horizontally to the left. Normally, this is 0.
1439 Vertical scroll amount, in pixels. Normally, this is 0.
1442 Non-@code{nil} if this window is dedicated to its buffer.
1445 The window's display table, or @code{nil} if none is specified for it.
1447 @item update_mode_line
1448 Non-@code{nil} means this window's mode line needs to be updated.
1450 @item base_line_number
1451 The line number of a certain position in the buffer, or @code{nil}.
1452 This is used for displaying the line number of point in the mode line.
1455 The position in the buffer for which the line number is known, or
1456 @code{nil} meaning none is known. If it is a buffer, don't display
1457 the line number as long as the window shows that buffer.
1459 @item column_number_displayed
1460 The column number currently displayed in this window's mode line, or @code{nil}
1461 if column numbers are not being displayed.
1463 @item current_matrix
1464 @itemx desired_matrix
1465 Glyph matrices describing the current and desired display of this window.
1468 @node Process Internals
1469 @subsection Process Internals
1470 @cindex internals, of process
1471 @cindex process internals
1473 The fields of a process (for a complete list, see the definition of
1474 @code{struct Lisp_Process} in @file{process.h}) include:
1478 A string, the name of the process.
1481 A list containing the command arguments that were used to start this
1482 process. For a network or serial process, it is @code{nil} if the
1483 process is running or @code{t} if the process is stopped.
1486 A function used to accept output from the process.
1489 A function called whenever the state of the process changes.
1492 The associated buffer of the process.
1495 An integer, the operating system's process @acronym{ID}.
1496 Pseudo-processes such as network or serial connections use a value of 0.
1499 A flag, @code{t} if this is really a child process. For a network or
1500 serial connection, it is a plist based on the arguments to
1501 @code{make-network-process} or @code{make-serial-process}.
1504 A marker indicating the position of the end of the last output from this
1505 process inserted into the buffer. This is often but not always the end
1508 @item kill_without_query
1509 If this is non-zero, killing Emacs while this process is still running
1510 does not ask for confirmation about killing the process.
1513 The raw process status, as returned by the @code{wait} system call.
1516 The process status, as @code{process-status} should return it.
1520 If these two fields are not equal, a change in the status of the process
1521 needs to be reported, either by running the sentinel or by inserting a
1522 message in the process buffer.
1525 Non-@code{nil} if communication with the subprocess uses a pty;
1526 @code{nil} if it uses a pipe.
1529 The file descriptor for input from the process.
1532 The file descriptor for output to the process.
1535 The name of the terminal that the subprocess is using,
1536 or @code{nil} if it is using pipes.
1538 @item decode_coding_system
1539 Coding-system for decoding the input from this process.
1542 A working buffer for decoding.
1544 @item decoding_carryover
1545 Size of carryover in decoding.
1547 @item encode_coding_system
1548 Coding-system for encoding the output to this process.
1551 A working buffer for encoding.
1553 @item inherit_coding_system_flag
1554 Flag to set @code{coding-system} of the process buffer from the
1555 coding system used to decode process output.
1558 Symbol indicating the type of process: @code{real}, @code{network},
1563 @node C Integer Types
1564 @section C Integer Types
1565 @cindex integer types (C programming language)
1567 Here are some guidelines for use of integer types in the Emacs C
1568 source code. These guidelines sometimes give competing advice; common
1573 Avoid arbitrary limits. For example, avoid @code{int len = strlen
1574 (s);} unless the length of @code{s} is required for other reasons to
1575 fit in @code{int} range.
1578 Do not assume that signed integer arithmetic wraps around on overflow.
1579 This is no longer true of Emacs porting targets: signed integer
1580 overflow has undefined behavior in practice, and can dump core or
1581 even cause earlier or later code to behave ``illogically''. Unsigned
1582 overflow does wrap around reliably, modulo a power of two.
1585 Prefer signed types to unsigned, as code gets confusing when signed
1586 and unsigned types are combined. Many other guidelines assume that
1587 types are signed; in the rarer cases where unsigned types are needed,
1588 similar advice may apply to the unsigned counterparts (e.g.,
1589 @code{size_t} instead of @code{ptrdiff_t}, or @code{uintptr_t} instead
1590 of @code{intptr_t}).
1593 Prefer @code{int} for Emacs character codes, in the range 0 ..@: 0x3FFFFF.
1596 Prefer @code{ptrdiff_t} for sizes, i.e., for integers bounded by the
1597 maximum size of any individual C object or by the maximum number of
1598 elements in any C array. This is part of Emacs's general preference
1599 for signed types. Using @code{ptrdiff_t} limits objects to
1600 @code{PTRDIFF_MAX} bytes, but larger objects would cause trouble
1601 anyway since they would break pointer subtraction, so this does not
1602 impose an arbitrary limit.
1605 Prefer @code{intptr_t} for internal representations of pointers, or
1606 for integers bounded only by the number of objects that can exist at
1607 any given time or by the total number of bytes that can be allocated.
1608 Currently Emacs sometimes uses other types when @code{intptr_t} would
1609 be better; fixing this is lower priority, as the code works as-is on
1610 Emacs's current porting targets.
1613 Prefer the Emacs-defined type @code{EMACS_INT} for representing values
1614 converted to or from Emacs Lisp fixnums, as fixnum arithmetic is based
1615 on @code{EMACS_INT}.
1618 When representing a system value (such as a file size or a count of
1619 seconds since the Epoch), prefer the corresponding system type (e.g.,
1620 @code{off_t}, @code{time_t}). Do not assume that a system type is
1621 signed, unless this assumption is known to be safe. For example,
1622 although @code{off_t} is always signed, @code{time_t} need not be.
1625 Prefer the Emacs-defined type @code{printmax_t} for representing
1626 values that might be any signed integer that can be printed,
1627 using a @code{printf}-family function.
1630 Prefer @code{intmax_t} for representing values that might be any
1631 signed integer value.
1634 Prefer @code{bool}, @code{false} and @code{true} for booleans.
1635 Using @code{bool} can make programs easier to read and a bit faster than
1636 using @code{int}. Although it is also OK to use @code{int}, @code{0}
1637 and @code{1}, this older style is gradually being phased out. When
1638 using @code{bool}, respect the limitations of the replacement
1639 implementation of @code{bool}, as documented in the source file
1640 @file{lib/stdbool.in.h}, so that Emacs remains portable to pre-C99
1641 platforms. In particular, boolean bitfields should be of type
1642 @code{bool_bf}, not @code{bool}, so that they work correctly even when
1643 compiling Objective C with standard GCC.
1646 In bitfields, prefer @code{unsigned int} or @code{signed int} to
1647 @code{int}, as @code{int} is less portable: it might be signed, and
1648 might not be. Single-bit bit fields should be @code{unsigned int} or
1649 @code{bool_bf} so that their values are 0 or 1.
1652 @c FIXME Mention src/globals.h somewhere in this file?