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