]> code.delx.au - gnu-emacs/blob - lispref/internals.texi
Comment changed.
[gnu-emacs] / lispref / internals.texi
1 @c -*-texinfo-*-
2 @c This is part of the GNU Emacs Lisp Reference Manual.
3 @c Copyright (C) 1990, 1991, 1992, 1993 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
9
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.
13
14 @menu
15 * Building Emacs:: How to preload Lisp libraries into Emacs.
16 * Pure Storage:: A kludge to make preloaded Lisp functions sharable.
17 * Garbage Collection:: Reclaiming space for Lisp objects no longer used.
18 * Writing Emacs Primitives:: Writing C code for Emacs.
19 * Object Internals:: Data formats of buffers, windows, processes.
20 @end menu
21
22 @node Building Emacs, Pure Storage, GNU Emacs Internals, GNU Emacs Internals
23 @appendixsec Building Emacs
24 @cindex building Emacs
25 @pindex temacs
26
27 This section explains the steps involved in building the Emacs
28 executable. You don't have to know this material to build and install
29 Emacs, since the makefiles do all these things automatically. This
30 information is pertinent to Emacs maintenance.
31
32 Compilation of the C source files in the @file{src} directory
33 produces an executable file called @file{temacs}, also called a
34 @dfn{bare impure Emacs}. It contains the Emacs Lisp interpreter and I/O
35 routines, but not the editing commands.
36
37 @cindex @file{loadup.el}
38 The command @w{@samp{temacs -l loadup}} uses @file{temacs} to create
39 the real runnable Emacs executable. These arguments direct
40 @file{temacs} to evaluate the Lisp files specified in the file
41 @file{loadup.el}. These files set up the normal Emacs editing
42 environment, resulting in an Emacs that is still impure but no longer
43 bare.
44
45 It takes a substantial time to load the standard Lisp files. Luckily,
46 you don't have to do this each time you run Emacs; @file{temacs} can
47 dump out an executable program called @file{emacs} that has these files
48 preloaded. @file{emacs} starts more quickly because it does not need to
49 load the files. This is the Emacs executable that is normally
50 installed.
51
52 To create @file{emacs}, use the command @samp{temacs -batch -l loadup
53 dump}. The purpose of @samp{-batch} here is to prevent @file{temacs}
54 from trying to initialize any of its data on the terminal; this ensures
55 that the tables of terminal information are empty in the dumped Emacs.
56 The argument @samp{dump} tells @file{loadup.el} to dump a new executable
57 named @file{emacs}.
58
59 Some operating systems don't support dumping. On those systems, you
60 must start Emacs with the @samp{temacs -l loadup} command each time you
61 use it. This takes a substantial time, but since you need to start
62 Emacs once a day at most---or once a week if you never log out---the
63 extra time is not too severe a problem.
64
65 @cindex @file{site-load.el}
66 You can specify additional files to preload by writing a library named
67 @file{site-load.el} that loads them. You may need to increase the
68 value of @code{PURESIZE}, in @file{src/puresize.h}, to make room for the
69 additional files. (Try adding increments of 20000 until it is big
70 enough.) However, the advantage of preloading additional files
71 decreases as machines get faster. On modern machines, it is usually not
72 advisable.
73
74 @cindex @file{site-init.el}
75 You can specify other Lisp expressions to execute just before dumping
76 by putting them in a library named @file{site-init.el}. However, if
77 they might alter the behavior that users expect from an ordinary
78 unmodified Emacs, it is better to put them in @file{default.el}, so that
79 users can override them if they wish. @xref{Start-up Summary}.
80
81 Before @file{loadup.el} dumps the new executable, it finds the
82 documentation strings for primitive and preloaded functions (and
83 variables) in the file where they are stored, by calling
84 @code{Snarf-documentation} (@pxref{Accessing Documentation}). These
85 strings were moved out of the @file{emacs} executable to make it
86 smaller. @xref{Documentation Basics}.
87
88 @defun dump-emacs to-file from-file
89 @cindex unexec
90 This function dumps the current state of Emacs into an executable file
91 @var{to-file}. It takes symbols from @var{from-file} (this is normally
92 the executable file @file{temacs}).
93
94 If you use this function in an Emacs that was already dumped, you must
95 set @code{command-line-processed} to @code{nil} first for good results.
96 @xref{Command Line Arguments}.
97 @end defun
98
99 @deffn Command emacs-version
100 This function returns a string describing the version of Emacs that is
101 running. It is useful to include this string in bug reports.
102
103 @example
104 @group
105 (emacs-version)
106 @result{} "GNU Emacs 19.22.1 of Fri Feb 27 1994 \
107 on slug (berkeley-unix)"
108 @end group
109 @end example
110
111 Called interactively, the function prints the same information in the
112 echo area.
113 @end deffn
114
115 @defvar emacs-build-time
116 The value of this variable is the time at which Emacs was built at the
117 local site.
118
119 @example
120 @group
121 emacs-build-time
122 @result{} "Fri Feb 27 14:55:57 1994"
123 @end group
124 @end example
125 @end defvar
126
127 @defvar emacs-version
128 The value of this variable is the version of Emacs being run. It is a
129 string such as @code{"19.22.1"}.
130 @end defvar
131
132 The following two variables did not exist before Emacs version 19.23,
133 which reduces their usefulness at present, but we hope they will be
134 convenient in the future.
135
136 @defvar emacs-major-version
137 The major version number of Emacs, as an integer. For Emacs version
138 19.23, the value is 19.
139 @end defvar
140
141 @defvar emacs-minor-version
142 The minor version number of Emacs, as an integer. For Emacs version
143 19.23, the value is 23.
144 @end defvar
145
146 @node Pure Storage, Garbage Collection, Building Emacs, GNU Emacs Internals
147 @appendixsec Pure Storage
148 @cindex pure storage
149
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 is 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.
156
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 the
163 preloaded libraries, @file{temacs} crashes. If that happens, you must
164 increase the compilation parameter @code{PURESIZE} in the file
165 @file{src/puresize.h}. This normally won't happen unless you try to
166 preload additional libraries or add features to the standard ones.
167
168 @defun purecopy object
169 This function makes a copy of @var{object} in pure storage and returns
170 it. It copies strings by simply making a new string with the same
171 characters in pure storage. It recursively copies the contents of
172 vectors and cons cells. It does not make copies of other objects such
173 as symbols, but just returns them unchanged. It signals an error if
174 asked to copy markers.
175
176 This function is used only while Emacs is being built and dumped; it is
177 called only in the file @file{emacs/lisp/loaddefs.el}.
178 @end defun
179
180 @defvar pure-bytes-used
181 The value of this variable is the number of bytes of pure storage
182 allocated so far. Typically, in a dumped Emacs, this number is very
183 close to the total amount of pure storage available---if it were not,
184 we would preallocate less.
185 @end defvar
186
187 @defvar purify-flag
188 This variable determines whether @code{defun} should make a copy of the
189 function definition in pure storage. If it is non-@code{nil}, then the
190 function definition is copied into pure storage.
191
192 This flag is @code{t} while loading all of the basic functions for
193 building Emacs initially (allowing those functions to be sharable and
194 non-collectible). Dumping Emacs as an executable always writes
195 @code{nil} in this variable, regardless of the value it actually has
196 before and after dumping.
197
198 You should not change this flag in a running Emacs.
199 @end defvar
200
201 @node Garbage Collection, Writing Emacs Primitives, Pure Storage, GNU Emacs Internals
202 @appendixsec Garbage Collection
203 @cindex garbage collector
204
205 @cindex memory allocation
206 When a program creates a list or the user defines a new function (such
207 as by loading a library), that data is placed in normal storage. If
208 normal storage runs low, then Emacs asks the operating system to
209 allocate more memory in blocks of 1k bytes. Each block is used for one
210 type of Lisp object, so symbols, cons cells, markers, etc., are
211 segregated in distinct blocks in memory. (Vectors, long strings,
212 buffers and certain other editing types, which are fairly large, are
213 allocated in individual blocks, one per object, while small strings are
214 packed into blocks of 8k bytes.)
215
216 It is quite common to use some storage for a while, then release it by
217 (for example) killing a buffer or deleting the last pointer to an
218 object. Emacs provides a @dfn{garbage collector} to reclaim this
219 abandoned storage. (This name is traditional, but ``garbage recycler''
220 might be a more intuitive metaphor for this facility.)
221
222 The garbage collector operates by finding and marking all Lisp objects
223 that are still accessible to Lisp programs. To begin with, it assumes
224 all the symbols, their values and associated function definitions, and
225 any data presently on the stack, are accessible. Any objects that can
226 be reached indirectly through other accessible objects are also
227 accessible.
228
229 When marking is finished, all objects still unmarked are garbage. No
230 matter what the Lisp program or the user does, it is impossible to refer
231 to them, since there is no longer a way to reach them. Their space
232 might as well be reused, since no one will miss them. The second
233 (``sweep'') phase of the garbage collector arranges to reuse them.
234
235 @cindex free list
236 The sweep phase puts unused cons cells onto a @dfn{free list}
237 for future allocation; likewise for symbols and markers. It compacts
238 the accessible strings so they occupy fewer 8k blocks; then it frees the
239 other 8k blocks. Vectors, buffers, windows, and other large objects are
240 individually allocated and freed using @code{malloc} and @code{free}.
241
242 @cindex CL note---allocate more storage
243 @quotation
244 @b{Common Lisp note:} Unlike other Lisps, GNU Emacs Lisp does not
245 call the garbage collector when the free list is empty. Instead, it
246 simply requests the operating system to allocate more storage, and
247 processing continues until @code{gc-cons-threshold} bytes have been
248 used.
249
250 This means that you can make sure that the garbage collector will not
251 run during a certain portion of a Lisp program by calling the garbage
252 collector explicitly just before it (provided that portion of the
253 program does not use so much space as to force a second garbage
254 collection).
255 @end quotation
256
257 @deffn Command garbage-collect
258 This command runs a garbage collection, and returns information on
259 the amount of space in use. (Garbage collection can also occur
260 spontaneously if you use more than @code{gc-cons-threshold} bytes of
261 Lisp data since the previous garbage collection.)
262
263 @code{garbage-collect} returns a list containing the following
264 information:
265
266 @example
267 @group
268 ((@var{used-conses} . @var{free-conses})
269 (@var{used-syms} . @var{free-syms})
270 @end group
271 (@var{used-markers} . @var{free-markers})
272 @var{used-string-chars}
273 @var{used-vector-slots}
274 (@var{used-floats} . @var{free-floats}))
275
276 @group
277 (garbage-collect)
278 @result{} ((3435 . 2332) (1688 . 0)
279 (57 . 417) 24510 3839 (4 . 1))
280 @end group
281 @end example
282
283 Here is a table explaining each element:
284
285 @table @var
286 @item used-conses
287 The number of cons cells in use.
288
289 @item free-conses
290 The number of cons cells for which space has been obtained from the
291 operating system, but that are not currently being used.
292
293 @item used-syms
294 The number of symbols in use.
295
296 @item free-syms
297 The number of symbols for which space has been obtained from the
298 operating system, but that are not currently being used.
299
300 @item used-markers
301 The number of markers in use.
302
303 @item free-markers
304 The number of markers for which space has been obtained from the
305 operating system, but that are not currently being used.
306
307 @item used-string-chars
308 The total size of all strings, in characters.
309
310 @item used-vector-slots
311 The total number of elements of existing vectors.
312
313 @item used-floats
314 @c Emacs 19 feature
315 The number of floats in use.
316
317 @item free-floats
318 @c Emacs 19 feature
319 The number of floats for which space has been obtained from the
320 operating system, but that are not currently being used.
321 @end table
322 @end deffn
323
324 @defopt gc-cons-threshold
325 The value of this variable is the number of bytes of storage that must
326 be allocated for Lisp objects after one garbage collection in order to
327 trigger another garbage collection. A cons cell counts as eight bytes,
328 a string as one byte per character plus a few bytes of overhead, and so
329 on; space allocated to the contents of buffers does not count. Note
330 that the subsequent garbage collection does not happen immediately when
331 the threshold is exhausted, but only the next time the Lisp evaluator is
332 called.
333
334 The initial threshold value is 100,000. If you specify a larger
335 value, garbage collection will happen less often. This reduces the
336 amount of time spent garbage collecting, but increases total memory use.
337 You may want to do this when running a program that creates lots of
338 Lisp data.
339
340 You can make collections more frequent by specifying a smaller value,
341 down to 10,000. A value less than 10,000 will remain in effect only
342 until the subsequent garbage collection, at which time
343 @code{garbage-collect} will set the threshold back to 10,000.
344 @end defopt
345
346 @c Emacs 19 feature
347 @defun memory-limit
348 This function returns the address of the last byte Emacs has allocated,
349 divided by 1024. We divide the value by 1024 to make sure it fits in a
350 Lisp integer.
351
352 You can use this to get a general idea of how your actions affect the
353 memory usage.
354 @end defun
355
356 @node Writing Emacs Primitives, Object Internals, Garbage Collection, GNU Emacs Internals
357 @appendixsec Writing Emacs Primitives
358 @cindex primitive function internals
359
360 Lisp primitives are Lisp functions implemented in C. The details of
361 interfacing the C function so that Lisp can call it are handled by a few
362 C macros. The only way to really understand how to write new C code is
363 to read the source, but we can explain some things here.
364
365 An example of a special form is the definition of @code{or}, from
366 @file{eval.c}. (An ordinary function would have the same general
367 appearance.)
368
369 @cindex garbage collection protection
370 @smallexample
371 @group
372 DEFUN ("or", For, Sor, 0, UNEVALLED, 0,
373 "Eval args until one of them yields non-nil, then return that value.\n\
374 The remaining args are not evalled at all.\n\
375 @end group
376 @group
377 If all args return nil, return nil.")
378 (args)
379 Lisp_Object args;
380 @{
381 register Lisp_Object val;
382 Lisp_Object args_left;
383 struct gcpro gcpro1;
384 @end group
385
386 @group
387 if (NULL (args))
388 return Qnil;
389
390 args_left = args;
391 GCPRO1 (args_left);
392 @end group
393
394 @group
395 do
396 @{
397 val = Feval (Fcar (args_left));
398 if (!NULL (val))
399 break;
400 args_left = Fcdr (args_left);
401 @}
402 while (!NULL (args_left));
403 @end group
404
405 @group
406 UNGCPRO;
407 return val;
408 @}
409 @end group
410 @end smallexample
411
412 Let's start with a precise explanation of the arguments to the
413 @code{DEFUN} macro. Here is a template for them:
414
415 @example
416 DEFUN (@var{lname}, @var{fname}, @var{sname}, @var{min}, @var{max}, @var{interactive}, @var{doc})
417 @end example
418
419 @table @var
420 @item lname
421 This is the name of the Lisp symbol to define as the function name; in
422 the example above, it is @code{or}.
423
424 @item fname
425 This is the C function name for this function. This is
426 the name that is used in C code for calling the function. The name is,
427 by convention, @samp{F} prepended to the Lisp name, with all dashes
428 (@samp{-}) in the Lisp name changed to underscores. Thus, to call this
429 function from C code, call @code{For}. Remember that the arguments must
430 be of type @code{Lisp_Object}; various macros and functions for creating
431 values of type @code{Lisp_Object} are declared in the file
432 @file{lisp.h}.
433
434 @item sname
435 This is a C variable name to use for a structure that holds the data for
436 the subr object that represents the function in Lisp. This structure
437 conveys the Lisp symbol name to the initialization routine that will
438 create the symbol and store the subr object as its definition. By
439 convention, this name is always @var{fname} with @samp{F} replaced with
440 @samp{S}.
441
442 @item min
443 This is the minimum number of arguments that the function requires. The
444 function @code{or} allows a minimum of zero arguments.
445
446 @item max
447 This is the maximum number of arguments that the function accepts, if
448 there is a fixed maximum. Alternatively, it can be @code{UNEVALLED},
449 indicating a special form that receives unevaluated arguments, or
450 @code{MANY}, indicating an unlimited number of evaluated arguments (the
451 equivalent of @code{&rest}). Both @code{UNEVALLED} and @code{MANY} are
452 macros. If @var{max} is a number, it may not be less than @var{min} and
453 it may not be greater than seven.
454
455 @item interactive
456 This is an interactive specification, a string such as might be used as
457 the argument of @code{interactive} in a Lisp function. In the case of
458 @code{or}, it is 0 (a null pointer), indicating that @code{or} cannot be
459 called interactively. A value of @code{""} indicates a function that
460 should receive no arguments when called interactively.
461
462 @item doc
463 This is the documentation string. It is written just like a
464 documentation string for a function defined in Lisp, except you must
465 write @samp{\n\} at the end of each line. In particular, the first line
466 should be a single sentence.
467 @end table
468
469 After the call to the @code{DEFUN} macro, you must write the argument
470 name list that every C function must have, followed by ordinary C
471 declarations for the arguments. For a function with a fixed maximum
472 number of arguments, declare a C argument for each Lisp argument, and
473 give them all type @code{Lisp_Object}. When a Lisp function has no
474 upper limit on the number of arguments, its implementation in C actually
475 receives exactly two arguments: the first is the number of Lisp
476 arguments, and the second is the address of a block containing their
477 values. They have types @code{int} and @w{@code{Lisp_Object *}}.
478
479 Within the function @code{For} itself, note the use of the macros
480 @code{GCPRO1} and @code{UNGCPRO}. @code{GCPRO1} is used to ``protect''
481 a variable from garbage collection---to inform the garbage collector that
482 it must look in that variable and regard its contents as an accessible
483 object. This is necessary whenever you call @code{Feval} or anything
484 that can directly or indirectly call @code{Feval}. At such a time, any
485 Lisp object that you intend to refer to again must be protected somehow.
486 @code{UNGCPRO} cancels the protection of the variables that are
487 protected in the current function. It is necessary to do this explicitly.
488
489 For most data types, it suffices to protect at least one pointer to
490 the object; as long as the object is not recycled, all pointers to it
491 remain valid. This is not so for strings, because the garbage collector
492 can move them. When the garbage collector moves a string, it relocates
493 all the pointers it knows about; any other pointers become invalid.
494 Therefore, you must protect all pointers to strings across any point
495 where garbage collection may be possible.
496
497 The macro @code{GCPRO1} protects just one local variable. If you want
498 to protect two, use @code{GCPRO2} instead; repeating @code{GCPRO1} will
499 not work. Macros @code{GCPRO3} and @code{GCPRO4} also exist.
500
501 These macros implicitly use local variables such as @code{gcpro1}; you
502 must declare these explicitly, with type @code{struct gcpro}. Thus, if
503 you use @code{GCPRO2}, you must declare @code{gcpro1} and @code{gcpro2}.
504 Alas, we can't explain all the tricky details here.
505
506 You must not use C initializers for static or global variables unless
507 they are never written once Emacs is dumped. These variables with
508 initializers are allocated in an area of memory that becomes read-only
509 (on certain operating systems) as a result of dumping Emacs. @xref{Pure
510 Storage}.
511
512 Do not use static variables within functions---place all static
513 variables at top level in the file. This is necessary because Emacs on
514 some operating systems defines the keyword @code{static} as a null
515 macro. (This definition is used because those systems put all variables
516 declared static in a place that becomes read-only after dumping, whether
517 they have initializers or not.)
518
519 Defining the C function is not enough to make a Lisp primitive
520 available; you must also create the Lisp symbol for the primitive and
521 store a suitable subr object in its function cell. The code looks like
522 this:
523
524 @example
525 defsubr (&@var{subr-structure-name});
526 @end example
527
528 @noindent
529 Here @var{subr-structure-name} is the name you used as the third
530 argument to @code{DEFUN}.
531
532 If you add a new primitive to a file that already has Lisp primitives
533 defined in it, find the function (near the end of the file) named
534 @code{syms_of_@var{something}}, and add the call to @code{defsubr}
535 there. If the file doesn't have this function, or if you create a new
536 file, add to it a @code{syms_of_@var{filename}} (e.g.,
537 @code{syms_of_myfile}). Then find the spot in @file{emacs.c} where all
538 of these functions are called, and add a call to
539 @code{syms_of_@var{filename}} there.
540
541 The function @code{syms_of_@var{filename}} is also the place to define
542 any C variables that are to be visible as Lisp variables.
543 @code{DEFVAR_LISP} makes a C variable of type @code{Lisp_Object} visible
544 in Lisp. @code{DEFVAR_INT} makes a C variable of type @code{int}
545 visible in Lisp with a value that is always an integer.
546 @code{DEFVAR_BOOL} makes a C variable of type @code{int} visible in Lisp
547 with a value that is either @code{t} or @code{nil}.
548
549 Here is another example function, with more complicated arguments.
550 This comes from the code for the X Window System, and it demonstrates
551 the use of macros and functions to manipulate Lisp objects.
552
553 @smallexample
554 @group
555 DEFUN ("coordinates-in-window-p", Fcoordinates_in_window_p,
556 Scoordinates_in_window_p, 2, 2,
557 "xSpecify coordinate pair: \nXExpression which evals to window: ",
558 "Return non-nil if POSITIONS is in WINDOW.\n\
559 \(POSITIONS is a list, (SCREEN-X SCREEN-Y)\)\n\
560 @end group
561 @group
562 Returned value is list of positions expressed\n\
563 relative to window upper left corner.")
564 (coordinate, window)
565 register Lisp_Object coordinate, window;
566 @{
567 register Lisp_Object xcoord, ycoord;
568 @end group
569
570 @group
571 if (!CONSP (coordinate)) wrong_type_argument (Qlistp, coordinate);
572 CHECK_WINDOW (window, 2);
573 xcoord = Fcar (coordinate);
574 ycoord = Fcar (Fcdr (coordinate));
575 CHECK_NUMBER (xcoord, 0);
576 CHECK_NUMBER (ycoord, 1);
577 @end group
578 @group
579 if ((XINT (xcoord) < XINT (XWINDOW (window)->left))
580 || (XINT (xcoord) >= (XINT (XWINDOW (window)->left)
581 + XINT (XWINDOW (window)->width))))
582 return Qnil;
583 XFASTINT (xcoord) -= XFASTINT (XWINDOW (window)->left);
584 @end group
585 @group
586 if (XINT (ycoord) == (screen_height - 1))
587 return Qnil;
588 @end group
589 @group
590 if ((XINT (ycoord) < XINT (XWINDOW (window)->top))
591 || (XINT (ycoord) >= (XINT (XWINDOW (window)->top)
592 + XINT (XWINDOW (window)->height)) - 1))
593 return Qnil;
594 @end group
595 @group
596 XFASTINT (ycoord) -= XFASTINT (XWINDOW (window)->top);
597 return (Fcons (xcoord, Fcons (ycoord, Qnil)));
598 @}
599 @end group
600 @end smallexample
601
602 Note that C code cannot call functions by name unless they are defined
603 in C. The way to call a function written in Lisp is to use
604 @code{Ffuncall}, which embodies the Lisp function @code{funcall}. Since
605 the Lisp function @code{funcall} accepts an unlimited number of
606 arguments, in C it takes two: the number of Lisp-level arguments, and a
607 one-dimensional array containing their values. The first Lisp-level
608 argument is the Lisp function to call, and the rest are the arguments to
609 pass to it. Since @code{Ffuncall} can call the evaluator, you must
610 protect pointers from garbage collection around the call to
611 @code{Ffuncall}.
612
613 The C functions @code{call0}, @code{call1}, @code{call2}, and so on,
614 provide handy ways to call a Lisp function conveniently with a fixed
615 number of arguments. They work by calling @code{Ffuncall}.
616
617 @file{eval.c} is a very good file to look through for examples;
618 @file{lisp.h} contains the definitions for some important macros and
619 functions.
620
621 @node Object Internals, , Writing Emacs Primitives, GNU Emacs Internals
622 @appendixsec Object Internals
623 @cindex object internals
624
625 GNU Emacs Lisp manipulates many different types of data. The actual
626 data are stored in a heap and the only access that programs have to it is
627 through pointers. Pointers are thirty-two bits wide in most
628 implementations. Depending on the operating system and type of machine
629 for which you compile Emacs, twenty-four to twenty-six bits are used to
630 address the object, and the remaining six to eight bits are used for a
631 tag that identifies the object's type.
632
633 Because Lisp objects are represented as tagged pointers, it is always
634 possible to determine the Lisp data type of any object. The C data type
635 @code{Lisp_Object} can hold any Lisp object of any data type. Ordinary
636 variables have type @code{Lisp_Object}, which means they can hold any
637 type of Lisp value; you can determine the actual data type only at run
638 time. The same is true for function arguments; if you want a function
639 to accept only a certain type of argument, you must check the type
640 explicitly using a suitable predicate (@pxref{Type Predicates}).
641 @cindex type checking internals
642
643 @menu
644 * Buffer Internals:: Components of a buffer structure.
645 * Window Internals:: Components of a window structure.
646 * Process Internals:: Components of a process structure.
647 @end menu
648
649 @node Buffer Internals, Window Internals, Object Internals, Object Internals
650 @appendixsubsec Buffer Internals
651 @cindex internals, of buffer
652 @cindex buffer internals
653
654 Buffers contain fields not directly accessible by the Lisp programmer.
655 We describe them here, naming them by the names used in the C code.
656 Many are accessible indirectly in Lisp programs via Lisp primitives.
657
658 @table @code
659 @item name
660 The buffer name is a string that names the buffer. It is guaranteed to
661 be unique. @xref{Buffer Names}.
662
663 @item save_modified
664 This field contains the time when the buffer was last saved, as an integer.
665 @xref{Buffer Modification}.
666
667 @item modtime
668 This field contains the modification time of the visited file. It is
669 set when the file is written or read. Every time the buffer is written
670 to the file, this field is compared to the modification time of the
671 file. @xref{Buffer Modification}.
672
673 @item auto_save_modified
674 This field contains the time when the buffer was last auto-saved.
675
676 @item last_window_start
677 This field contains the @code{window-start} position in the buffer as of
678 the last time the buffer was displayed in a window.
679
680 @item undo_list
681 This field points to the buffer's undo list. @xref{Undo}.
682
683 @item syntax_table_v
684 This field contains the syntax table for the buffer. @xref{Syntax Tables}.
685
686 @item downcase_table
687 This field contains the conversion table for converting text to lower case.
688 @xref{Case Table}.
689
690 @item upcase_table
691 This field contains the conversion table for converting text to upper case.
692 @xref{Case Table}.
693
694 @item case_canon_table
695 This field contains the conversion table for canonicalizing text for
696 case-folding search. @xref{Case Table}.
697
698 @item case_eqv_table
699 This field contains the equivalence table for case-folding search.
700 @xref{Case Table}.
701
702 @item display_table
703 This field contains the buffer's display table, or @code{nil} if it doesn't
704 have one. @xref{Display Tables}.
705
706 @item markers
707 This field contains the chain of all markers that currently point into
708 the buffer. Deletion of text in the buffer, and motion of the buffer's
709 gap, must check each of these markers and perhaps update it.
710 @xref{Markers}.
711
712 @item backed_up
713 This field is a flag that tells whether a backup file has been made
714 for the visited file of this buffer.
715
716 @item mark
717 This field contains the mark for the buffer. The mark is a marker,
718 hence it is also included on the list @code{markers}. @xref{The Mark}.
719
720 @item mark_active
721 This field is non-@code{nil} if the buffer's mark is active.
722
723 @item local_var_alist
724 This field contains the association list describing the variables local
725 in this buffer, and their values, with the exception of local variables
726 that have special slots in the buffer object. (Those slots are omitted
727 from this table.) @xref{Buffer-Local Variables}.
728
729 @item keymap
730 This field holds the buffer's local keymap. @xref{Keymaps}.
731
732 @item overlay_center
733 This field holds the current overlay center position. @xref{Overlays}.
734
735 @item overlays_before
736 This field holds a list of the overlays in this buffer that end at or
737 before the current overlay center position. They are sorted in order of
738 decreasing end position.
739
740 @item overlays_after
741 This field holds a list of the overlays in this buffer that end after
742 the current overlay center position. They are sorted in order of
743 increasing beginning position.
744 @end table
745
746 @node Window Internals, Process Internals, Buffer Internals, Object Internals
747 @appendixsubsec Window Internals
748 @cindex internals, of window
749 @cindex window internals
750
751 Windows have the following accessible fields:
752
753 @table @code
754 @item frame
755 The frame that this window is on.
756
757 @item mini_p
758 Non-@code{nil} if this window is a minibuffer window.
759
760 @item buffer
761 The buffer that the window is displaying. This may change often during
762 the life of the window.
763
764 @item dedicated
765 Non-@code{nil} if this window is dedicated to its buffer.
766
767 @item pointm
768 @cindex window point internals
769 This is the value of point in the current buffer when this window is
770 selected; when it is not selected, it retains its previous value.
771
772 @item start
773 The position in the buffer that is the first character to be displayed
774 in the window.
775
776 @item force_start
777 If this flag is non-@code{nil}, it says that the window has been
778 scrolled explicitly by the Lisp program. This affects what the next
779 redisplay does if point is off the screen: instead of scrolling the
780 window to show the text around point, it moves point to a location that
781 is on the screen.
782
783 @item last_modified
784 The @code{modified} field of the window's buffer, as of the last time
785 a redisplay completed in this window.
786
787 @item last_point
788 The buffer's value of point, as of the last time
789 a redisplay completed in this window.
790
791 @item left
792 This is the left-hand edge of the window, measured in columns. (The
793 leftmost column on the screen is @w{column 0}.)
794
795 @item top
796 This is the top edge of the window, measured in lines. (The top line on
797 the screen is @w{line 0}.)
798
799 @item height
800 The height of the window, measured in lines.
801
802 @item width
803 The width of the window, measured in columns.
804
805 @item next
806 This is the window that is the next in the chain of siblings. It is
807 @code{nil} in a window that is the rightmost or bottommost of a group of
808 siblings.
809
810 @item prev
811 This is the window that is the previous in the chain of siblings. It is
812 @code{nil} in a window that is the leftmost or topmost of a group of
813 siblings.
814
815 @item parent
816 Internally, Emacs arranges windows in a tree; each group of siblings has
817 a parent window whose area includes all the siblings. This field points
818 to a window's parent.
819
820 Parent windows do not display buffers, and play little role in display
821 except to shape their child windows. Emacs Lisp programs usually have
822 no access to the parent windows; they operate on the windows at the
823 leaves of the tree, which actually display buffers.
824
825 @item hscroll
826 This is the number of columns that the display in the window is scrolled
827 horizontally to the left. Normally, this is 0.
828
829 @item use_time
830 This is the last time that the window was selected. The function
831 @code{get-lru-window} uses this field.
832
833 @item display_table
834 The window's display table, or @code{nil} if none is specified for it.
835
836 @item update_mode_line
837 Non-@code{nil} means this window's mode line needs to be updated.
838
839 @item base_line_number
840 The line number of a certain position in the buffer, or @code{nil}.
841 This is used for displaying the line number of point in the mode line.
842
843 @item base_line_pos
844 The position in the buffer for which the line number is known, or
845 @code{nil} meaning none is known.
846
847 @item region_showing
848 If the region (or part of it) is highlighted in this window, this field
849 holds the mark position that made one end of that region. Otherwise,
850 this field is @code{nil}.
851 @end table
852
853 @node Process Internals, , Window Internals, Object Internals
854 @appendixsubsec Process Internals
855 @cindex internals, of process
856 @cindex process internals
857
858 The fields of a process are:
859
860 @table @code
861 @item name
862 A string, the name of the process.
863
864 @item command
865 A list containing the command arguments that were used to start this
866 process.
867
868 @item filter
869 A function used to accept output from the process instead of a buffer,
870 or @code{nil}.
871
872 @item sentinel
873 A function called whenever the process receives a signal, or @code{nil}.
874
875 @item buffer
876 The associated buffer of the process.
877
878 @item pid
879 An integer, the Unix process @sc{id}.
880
881 @item childp
882 A flag, non-@code{nil} if this is really a child process.
883 It is @code{nil} for a network connection.
884
885 @item mark
886 A marker indicating the position of the end of the last output from this
887 process inserted into the buffer. This is often but not always the end
888 of the buffer.
889
890 @item kill_without_query
891 If this is non-@code{nil}, killing Emacs while this process is still
892 running does not ask for confirmation about killing the process.
893
894 @item raw_status_low
895 @itemx raw_status_high
896 These two fields record 16 bits each of the process status returned by
897 the @code{wait} system call.
898
899 @item status
900 The process status, as @code{process-status} should return it.
901
902 @item tick
903 @itemx update_tick
904 If these two fields are not equal, a change in the status of the process
905 needs to be reported, either by running the sentinel or by inserting a
906 message in the process buffer.
907
908 @item pty_flag
909 Non-@code{nil} if communication with the subprocess uses a @sc{pty};
910 @code{nil} if it uses a pipe.
911
912 @item infd
913 The file descriptor for input from the process.
914
915 @item outfd
916 The file descriptor for output to the process.
917
918 @item subtty
919 The file descriptor for the terminal that the subprocess is using. (On
920 some systems, there is no need to record this, so the value is
921 @code{nil}.)
922 @end table