|
428
|
1 /* Fundamental definitions for XEmacs Lisp interpreter.
|
|
|
2 Copyright (C) 1985-1987, 1992-1995 Free Software Foundation, Inc.
|
|
|
3 Copyright (C) 1993-1996 Richard Mlynarik.
|
|
2535
|
4 Copyright (C) 1995, 1996, 2000, 2001, 2002, 2003, 2004, 2005 Ben Wing.
|
|
428
|
5
|
|
|
6 This file is part of XEmacs.
|
|
|
7
|
|
|
8 XEmacs is free software; you can redistribute it and/or modify it
|
|
|
9 under the terms of the GNU General Public License as published by the
|
|
|
10 Free Software Foundation; either version 2, or (at your option) any
|
|
|
11 later version.
|
|
|
12
|
|
|
13 XEmacs is distributed in the hope that it will be useful, but WITHOUT
|
|
|
14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
16 for more details.
|
|
|
17
|
|
|
18 You should have received a copy of the GNU General Public License
|
|
|
19 along with XEmacs; see the file COPYING. If not, write to
|
|
|
20 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
21 Boston, MA 02111-1307, USA. */
|
|
|
22
|
|
|
23 /* Synched up with: FSF 19.30. */
|
|
|
24
|
|
853
|
25 /* Authorship:
|
|
|
26
|
|
|
27 Based on code from pre-release FSF 19, c. 1991.
|
|
|
28 Various changes by Jamie Zawinski 1991-1994:
|
|
|
29 converting to ANSI C, splitting out function prototypes to a separate
|
|
|
30 file (later moved back for unknown reasons by Steve Baur?), debug-gcpro
|
|
|
31 stuff (now moribund).
|
|
|
32 ANSI-fication of DEFUN macros by Felix Lee, c. 1992?
|
|
|
33 NOT_REACHED, DOESNT_RETURN, PRINTF_ARGS by Richard Mlynarik, c. 1994.
|
|
|
34 Many changes over the years corresponding to Lisp_Object definition
|
|
|
35 changes, esp. by Richard Mlynarik (c. 1993) and Kyle Jones (c. 1998).
|
|
|
36 See alloc.c for more details.
|
|
|
37 Overhauled and reordered by Ben Wing, 1995-1996, and many things added:
|
|
|
38 Dynarrs, REALLOC macros, asserts, typedefs, inline header code,
|
|
|
39 first LIST_LOOP macros, CONCHECK_*, all error-checking code
|
|
|
40 (e.g. error-checking versions of XFOO macros), structure read syntax,
|
|
|
41 weak lists, lcrecord lists, reworking of quit handling, object hashing,
|
|
|
42 nested GCPRO, character objects and Ebola checking, memory usage stats,
|
|
|
43 others.
|
|
|
44 LOADHIST changes from Steve Baur, c. 1997?
|
|
|
45 Various macro-related changes by Martin Buchholz, 1998-1999:
|
|
|
46 LIST_LOOP macros greatly expanded and tortoise-hared;
|
|
|
47 RETURN_SANS_WARNINGS; reworked DEFUN macros; EXFUN macros (???).
|
|
1743
|
48 Various macro-related changes by Jerry James, 2003:
|
|
|
49 MODULE_API introduced;
|
|
|
50 Compiler-specific definitions modernized and moved to compiler.h.
|
|
853
|
51 */
|
|
|
52
|
|
440
|
53 #ifndef INCLUDED_lisp_h_
|
|
|
54 #define INCLUDED_lisp_h_
|
|
428
|
55
|
|
|
56 /************************************************************************/
|
|
|
57 /* general definitions */
|
|
|
58 /************************************************************************/
|
|
|
59
|
|
2367
|
60 /* Conventions in comments:
|
|
|
61
|
|
|
62 "Mule-izing" is the process of going through a file and eliminating
|
|
|
63 assumptions that the internal format (Ibyte * text) is the same as the
|
|
|
64 external format used by library routines. Mule-ization should also
|
|
|
65 include replacing *ALL* raw references to `char' or `unsigned char' with
|
|
|
66 one of the self-documenting types created below. How exactly to do the
|
|
|
67 conversion, and how to write correctly Mule-ized code, is described in
|
|
|
68 the internals manual. Files that say "This file is Mule-ized" have
|
|
|
69 been reviewed at some point; that's not to say that incorrect code hasn't
|
|
|
70 crept in, though.
|
|
|
71
|
|
|
72 "Unicode-splitting" is the process of fixing a file so that it will
|
|
|
73 handle external text in Unicode under Microsoft Windows, as appropriate.
|
|
|
74 ("splitting" because it needs to handle either Unicode or variable-width
|
|
|
75 multibyte depending on the OS -- NT or 9x). See intl-win32.c.
|
|
|
76
|
|
|
77 #### is a way of marking problems of any sort.
|
|
|
78
|
|
|
79 !!#### marks places that are not properly Mule-ized.
|
|
|
80
|
|
|
81 &&#### marks places that need to be fixed in order for the "8-bit mule"
|
|
|
82 conversion to work correctly, i.e. in order to support multiple different
|
|
|
83 buffer formats under Mule, including a fixed 8-bit format.
|
|
|
84
|
|
|
85 ^^#### marks places that need to be fixed in order to eliminate the
|
|
|
86 assumption that Ibyte * text is composed of 1-byte units (e.g. UTF-16
|
|
|
87 is composed of 2-byte units and might be a possible format to consider
|
|
|
88 for Ibyte * text).
|
|
|
89
|
|
|
90 %%#### marks places that need work for KKCC (the new garbage collector).
|
|
|
91
|
|
|
92 */
|
|
|
93
|
|
1318
|
94 /* -------------------------- include files --------------------- */
|
|
442
|
95
|
|
428
|
96 /* We include the following generally useful header files so that you
|
|
|
97 don't have to worry about prototypes when using the standard C
|
|
|
98 library functions and macros. These files shouldn't be excessively
|
|
|
99 large so they shouldn't cause that much of a slowdown. */
|
|
|
100
|
|
|
101 #include <stdlib.h>
|
|
|
102 #include <string.h> /* primarily for memcpy, etc. */
|
|
|
103 #include <stdio.h> /* NULL, etc. */
|
|
|
104 #include <ctype.h>
|
|
|
105 #include <stdarg.h>
|
|
|
106 #include <stddef.h> /* offsetof */
|
|
|
107 #include <sys/types.h>
|
|
442
|
108 #include <limits.h>
|
|
|
109
|
|
1318
|
110 /* -------------------------- error-checking ------------------------ */
|
|
853
|
111
|
|
|
112 /* The large categories established by configure can be subdivided into
|
|
|
113 smaller subcategories, for problems in specific modules. You can't
|
|
|
114 control this using configure, but you can manually stick in a define as
|
|
|
115 necessary. */
|
|
|
116
|
|
|
117 #ifdef ERROR_CHECK_STRUCTURES
|
|
|
118 /* Check for problems with the catch list and specbind stack */
|
|
|
119 #define ERROR_CHECK_CATCH
|
|
|
120 /* Check for insufficient use of call_trapping_problems(), particularly
|
|
|
121 due to glyph-related changes causing eval or QUIT within redisplay */
|
|
|
122 #define ERROR_CHECK_TRAPPING_PROBLEMS
|
|
|
123 #endif
|
|
|
124
|
|
1318
|
125 #ifdef ERROR_CHECK_TYPES
|
|
|
126 #define type_checking_assert(assertion) assert (assertion)
|
|
|
127 #define type_checking_assert_at_line(assertion, file, line) \
|
|
|
128 assert_at_line (assertion, file, line)
|
|
|
129 #define type_checking_assert_with_message(assertion, msg) \
|
|
|
130 assert_with_message (assertion, msg)
|
|
|
131 #else
|
|
|
132 #define type_checking_assert(assertion)
|
|
|
133 #define type_checking_assert_at_line(assertion, file, line)
|
|
|
134 #define type_checking_assert_with_message(assertion, msg)
|
|
|
135 #endif
|
|
|
136 #ifdef ERROR_CHECK_GC
|
|
|
137 #define gc_checking_assert(assertion) assert (assertion)
|
|
|
138 #define gc_checking_assert_at_line(assertion, file, line) \
|
|
|
139 assert_at_line (assertion, file, line)
|
|
|
140 #define gc_checking_assert_with_message(assertion, msg) \
|
|
|
141 assert_with_message (assertion, msg)
|
|
|
142 #else
|
|
|
143 #define gc_checking_assert(assertion)
|
|
|
144 #define gc_checking_assert_at_line(assertion, file, line)
|
|
|
145 #define gc_checking_assert_with_message(assertion, msg)
|
|
|
146 #endif
|
|
|
147 #ifdef ERROR_CHECK_TEXT
|
|
|
148 #define text_checking_assert(assertion) assert (assertion)
|
|
|
149 #define text_checking_assert_at_line(assertion, file, line) \
|
|
|
150 assert_at_line (assertion, file, line)
|
|
|
151 #define text_checking_assert_with_message(assertion, msg) \
|
|
|
152 assert_with_message (assertion, msg)
|
|
|
153 #else
|
|
|
154 #define text_checking_assert(assertion)
|
|
|
155 #define text_checking_assert_at_line(assertion, file, line)
|
|
|
156 #define text_checking_assert_with_message(assertion, msg)
|
|
|
157 #endif
|
|
|
158 #ifdef ERROR_CHECK_TRAPPING_PROBLEMS
|
|
|
159 #define trapping_problems_checking_assert(assertion) assert (assertion)
|
|
|
160 #define trapping_problems_checking_assert_at_line(assertion, file, line) \
|
|
|
161 assert_at_line (assertion, file, line)
|
|
|
162 #define trapping_problems_checking_assert_with_message(assertion, msg) \
|
|
|
163 assert_with_message (assertion, msg)
|
|
|
164 #else
|
|
|
165 #define trapping_problems_checking_assert(assertion)
|
|
|
166 #define trapping_problems_checking_assert_at_line(assertion, file, line)
|
|
|
167 #define trapping_problems_checking_assert_with_message(assertion, msg)
|
|
|
168 #endif
|
|
|
169
|
|
2367
|
170 /************************************************************************/
|
|
|
171 /** Definitions of basic types **/
|
|
|
172 /************************************************************************/
|
|
|
173
|
|
|
174 /* ------------- generic 8/16/32/64/128-bit integral types ------------ */
|
|
647
|
175
|
|
826
|
176 #if SIZEOF_SHORT == 2
|
|
|
177 #define INT_16_BIT short
|
|
|
178 #define UINT_16_BIT unsigned short
|
|
|
179 #elif SIZEOF_INT == 2
|
|
|
180 /* Bwa ha ha. As if XEmacs could actually support such systems. */
|
|
|
181 #define INT_16_BIT int
|
|
|
182 #define UINT_16_BIT unsigned int
|
|
|
183 #else
|
|
|
184 #error Unable to find a 16-bit integral type
|
|
|
185 #endif
|
|
|
186
|
|
|
187 #if SIZEOF_INT == 4
|
|
|
188 #define INT_32_BIT int
|
|
|
189 #define UINT_32_BIT unsigned int
|
|
|
190 #define MAKE_32_BIT_UNSIGNED_CONSTANT(num) num##U
|
|
|
191 #elif SIZEOF_LONG == 4
|
|
|
192 /* Bwa ha ha again. */
|
|
|
193 #define INT_32_BIT long
|
|
|
194 #define UINT_32_BIT unsigned long
|
|
|
195 #define MAKE_32_BIT_UNSIGNED_CONSTANT(num) num##UL
|
|
|
196 #elif SIZEOF_SHORT == 4
|
|
|
197 /* And again. */
|
|
|
198 #define INT_32_BIT short
|
|
|
199 #define UINT_32_BIT unsigned short
|
|
|
200 #define MAKE_32_BIT_UNSIGNED_CONSTANT(num) num##U
|
|
1429
|
201 #elif 1 /* Unable to find a 32-bit integral type! */
|
|
826
|
202 #error What kind of strange-ass system are you running on?
|
|
|
203 #endif
|
|
|
204
|
|
|
205 #if SIZEOF_LONG == 8
|
|
|
206 #define INT_64_BIT long
|
|
|
207 #define UINT_64_BIT unsigned long
|
|
|
208 #define MAKE_64_BIT_UNSIGNED_CONSTANT(num) num##UL
|
|
|
209 #elif SIZEOF_LONG_LONG == 8
|
|
|
210 #define INT_64_BIT long long
|
|
|
211 #define UINT_64_BIT unsigned long long
|
|
|
212 #define MAKE_64_BIT_UNSIGNED_CONSTANT(num) num##ULL
|
|
|
213 /* No error otherwise; just leave undefined */
|
|
|
214 #endif
|
|
|
215
|
|
|
216 #if SIZEOF_LONG_LONG == 16
|
|
|
217 #define INT_128_BIT long long
|
|
|
218 #define UINT_128_BIT unsigned long long
|
|
|
219 #define MAKE_128_BIT_UNSIGNED_CONSTANT(num) num##ULL
|
|
|
220 /* No error otherwise; just leave undefined */
|
|
|
221 #endif
|
|
|
222
|
|
|
223 /* #### Fill this in for other systems */
|
|
|
224 #if defined (INT_64_BIT) && !(defined (i386) || defined (__i386__))
|
|
|
225 #define EFFICIENT_INT_64_BIT INT_64_BIT
|
|
|
226 #define EFFICIENT_UINT_64_BIT UINT_64_BIT
|
|
|
227 #endif
|
|
|
228
|
|
|
229 #if defined (INT_128_BIT)
|
|
|
230 #define EFFICIENT_INT_128_BIT INT_128_BIT
|
|
|
231 #define EFFICIENT_UINT_128_BIT UINT_128_BIT
|
|
|
232 #endif
|
|
|
233
|
|
2367
|
234 #ifdef HAVE_INTTYPES_H
|
|
|
235 #include <inttypes.h>
|
|
|
236 #elif defined (HAVE_INTPTR_T_IN_SYS_TYPES_H)
|
|
|
237 /* included elsewhere */
|
|
|
238 #elif SIZEOF_VOID_P == SIZEOF_INT
|
|
|
239 typedef int intptr_t;
|
|
|
240 typedef unsigned int uintptr_t;
|
|
|
241 #elif SIZEOF_VOID_P == SIZEOF_LONG
|
|
|
242 typedef long intptr_t;
|
|
|
243 typedef unsigned long uintptr_t;
|
|
|
244 #elif defined (SIZEOF_LONG_LONG) && SIZEOF_VOID_P == SIZEOF_LONG_LONG
|
|
|
245 typedef long long intptr_t;
|
|
|
246 typedef unsigned long long uintptr_t;
|
|
|
247 #else
|
|
|
248 /* Just pray. May break, may not. */
|
|
|
249 typedef long intptr_t;
|
|
|
250 typedef unsigned long uintptr_t;
|
|
|
251 #endif
|
|
|
252
|
|
|
253 /* ---------------------- definition of EMACS_INT --------------------- */
|
|
|
254
|
|
|
255 /* EMACS_INT is the underlying integral type into which a Lisp_Object must fit.
|
|
|
256 In particular, it must be large enough to contain a pointer.
|
|
|
257 config.h can override this, e.g. to use `long long' for bigger lisp ints.
|
|
|
258
|
|
|
259 #### In point of fact, it would NOT be a good idea for config.h to mess
|
|
|
260 with EMACS_INT. A lot of code makes the basic assumption that EMACS_INT
|
|
|
261 is the size of a pointer. */
|
|
|
262
|
|
|
263 #ifndef SIZEOF_EMACS_INT
|
|
|
264 # define SIZEOF_EMACS_INT SIZEOF_VOID_P
|
|
|
265 #endif
|
|
|
266
|
|
|
267 #ifndef EMACS_INT
|
|
|
268 # if SIZEOF_EMACS_INT == SIZEOF_LONG
|
|
|
269 # define EMACS_INT long
|
|
|
270 # elif SIZEOF_EMACS_INT == SIZEOF_INT
|
|
|
271 # define EMACS_INT int
|
|
|
272 # elif SIZEOF_EMACS_INT == SIZEOF_LONG_LONG
|
|
|
273 # define EMACS_INT long long
|
|
|
274 # else
|
|
|
275 # error Unable to determine suitable type for EMACS_INT
|
|
|
276 # endif
|
|
|
277 #endif
|
|
|
278
|
|
|
279 #ifndef EMACS_UINT
|
|
|
280 # define EMACS_UINT unsigned EMACS_INT
|
|
|
281 #endif
|
|
|
282
|
|
|
283 #define BITS_PER_EMACS_INT (SIZEOF_EMACS_INT * BITS_PER_CHAR)
|
|
|
284
|
|
|
285 /* -------------------------- basic byte typedefs --------------------- */
|
|
|
286
|
|
|
287 /* The definitions we put here and in the next section use typedefs to
|
|
|
288 attribute specific meaning to types that by themselves are pretty
|
|
|
289 general.
|
|
|
290
|
|
|
291 REMEMBER! These typedefs are purely for documentation purposes; from
|
|
647
|
292 the C code's perspective, they are exactly equivalent to `char *',
|
|
|
293 `unsigned char *', etc., so you can freely use them with library
|
|
2367
|
294 functions declared as such.
|
|
|
295
|
|
|
296 (See also "Byte/Character Types" in text.c)
|
|
|
297
|
|
|
298 The basic semantics for `char':
|
|
|
299
|
|
|
300 a) [Ibyte] pointer to internally-formatted text
|
|
|
301 b) [Extbyte] pointer to text in some external format, which can be
|
|
|
302 defined as all formats other than the internal one
|
|
|
303 c) [Ascbyte] pure ASCII text
|
|
|
304 d) [Binbyte] binary data that is not meant to be interpreted as text
|
|
|
305 e) [Rawbyte] general data in memory, where we don't care about whether
|
|
|
306 it's text or binary
|
|
|
307 f) [Boolbyte] a zero or a one
|
|
|
308 g) [Bitbyte] a byte used for bit fields
|
|
|
309 h) [Chbyte] null-semantics `char *'; used when casting an argument to
|
|
|
310 an external API where the the other types may not be
|
|
|
311 appropriate
|
|
|
312
|
|
|
313
|
|
|
314 Prefixing codes:
|
|
|
315
|
|
|
316 C = plain char, when the base type is unsigned
|
|
|
317 U = unsigned
|
|
|
318 S = signed
|
|
|
319
|
|
|
320 Ideally, XEmacs code should NEVER directly use `char' or any type
|
|
|
321 derived from it. This is for Mule-cleanliness. If you find yourself
|
|
|
322 wanting or needing to use `char' and one of the above six semantics does
|
|
|
323 not apply, add a new type of semantics; don't use `char' directly.
|
|
|
324
|
|
|
325 See text.c under "Byte Types", and following sections.
|
|
|
326 */
|
|
647
|
327
|
|
|
328 /* The data representing the text in a buffer is logically a set
|
|
867
|
329 of Ibytes, declared as follows. */
|
|
|
330
|
|
|
331 typedef unsigned char Ibyte;
|
|
647
|
332
|
|
|
333 /* The following should be used when you are working with internal data
|
|
|
334 but for whatever reason need to have it declared a "char *". Examples
|
|
|
335 are function arguments whose values are most commonly literal strings,
|
|
|
336 or where you have to apply a stdlib string function to internal data.
|
|
|
337
|
|
2367
|
338 In general, you should avoid this where possible and use Ascbyte if the
|
|
|
339 text is just ASCII (e.g. string literals) or otherwise Ibyte, for
|
|
|
340 consistency. For example, the new Mule workspace contains Ibyte
|
|
|
341 versions of the stdlib string functions. */
|
|
867
|
342
|
|
|
343 typedef char CIbyte;
|
|
647
|
344
|
|
|
345 /* The data representing a string in "external" format (binary or any
|
|
|
346 external encoding) is logically a set of Extbytes, declared as
|
|
|
347 follows. Extbyte is guaranteed to be just a char, so for example
|
|
|
348 strlen (Extbyte *) is OK. Extbyte is only a documentation device
|
|
|
349 for referring to external text. */
|
|
|
350
|
|
|
351 typedef char Extbyte;
|
|
771
|
352 typedef unsigned char UExtbyte;
|
|
647
|
353
|
|
2367
|
354 #define EXTTEXT_ZTERM_SIZE (sizeof (Extbyte))
|
|
647
|
355
|
|
|
356 /* A byte in a string in entirely US-ASCII format: (Nothing outside
|
|
|
357 the range 00 - 7F) */
|
|
|
358
|
|
2367
|
359 typedef char Ascbyte;
|
|
|
360 typedef unsigned char UAscbyte;
|
|
|
361
|
|
|
362 /* A generic memory pointer, no text or binary semantics assumed.
|
|
|
363 In general, there should be no manipulation of the memory pointed to
|
|
|
364 by these pointers other than just copying it around. */
|
|
|
365
|
|
|
366 typedef unsigned char Rawbyte;
|
|
|
367 typedef char CRawbyte;
|
|
|
368
|
|
|
369 /* A byte in a string in binary (not meant as text) format: */
|
|
|
370
|
|
|
371 typedef unsigned char Binbyte;
|
|
|
372 typedef char CBinbyte;
|
|
|
373 typedef signed char SBinbyte;
|
|
|
374
|
|
|
375 /* A byte used to represent a boolean value: 0 or 1.
|
|
|
376 Normally use plain Boolint, and only use Boolbyte to save space. */
|
|
|
377
|
|
|
378 typedef char Boolbyte;
|
|
|
379
|
|
|
380 /* A byte composed of bitfields. Hardly ever used. */
|
|
|
381
|
|
|
382 typedef unsigned char Bitbyte;
|
|
|
383
|
|
|
384 /* A no-semantics `char'. Used (pretty-much) ONLY for casting arguments to
|
|
|
385 functions accepting a `char *', `unsigned char *', etc. where the other
|
|
|
386 types don't exactly apply and what you are logically concerned with is
|
|
|
387 the type of the function's argument and not its semantics.
|
|
|
388
|
|
|
389 DO NOT DO NOT DO NOT DO NOT use this as a sloppy replacement for one of
|
|
|
390 the other types. If you're not using this as part of casting an
|
|
|
391 argument to a function call, and you're not Ben Wing, you're using it
|
|
|
392 wrong. Go find another one of the types. */
|
|
|
393
|
|
|
394 typedef char Chbyte;
|
|
|
395 typedef unsigned char UChbyte;
|
|
|
396 typedef signed char SChbyte;
|
|
|
397
|
|
|
398 /* ------------------------ other text-related typedefs ------------------- */
|
|
647
|
399
|
|
826
|
400 /* To the user, a buffer is made up of characters. In the non-Mule world,
|
|
867
|
401 characters and Ibytes are equivalent, restricted to the range 0 - 255.
|
|
826
|
402 In the Mule world, many more characters are possible (19 bits worth,
|
|
867
|
403 more or less), and a character requires (typically) 1 to 4 Ibytes for
|
|
826
|
404 its representation in a buffer or string. Note that the representation
|
|
|
405 of a character by itself, in a variable, is very different from its
|
|
|
406 representation in a string of text (in a buffer or Lisp string).
|
|
|
407
|
|
|
408 Under Mule, text can be represented in more than one way. The "default"
|
|
|
409 format is variable-width (1 to 4 bytes) and compatible with ASCII --
|
|
|
410 ASCII chars are stored in one byte, as themselves, and all other chars
|
|
|
411 use only high bytes. The default format is currently the only format
|
|
|
412 used for text stored anywhere but in a buffer. In a buffer, other
|
|
|
413 formats -- fixed-width formats (1, 2, or 4 bytes) -- are possible, for
|
|
|
414 speed.
|
|
|
415
|
|
|
416 See text.c/text.h for a detailed discussion of all of this. */
|
|
|
417
|
|
|
418 /* A character, as represented on its own. */
|
|
647
|
419
|
|
867
|
420 typedef int Ichar;
|
|
647
|
421
|
|
826
|
422 /* The "raw value" of a character as stored in the buffer. In the default
|
|
|
423 format, this is just the same as the character. In fixed-width formats,
|
|
|
424 this is the actual value in the buffer, which will be limited to the
|
|
|
425 range as established by the format. This is used when searching for a
|
|
|
426 character in a buffer -- it's faster to convert the character to the raw
|
|
|
427 value and look for that, than repeatedly convert each raw value in the
|
|
|
428 buffer into a character. */
|
|
|
429
|
|
867
|
430 typedef int Raw_Ichar;
|
|
826
|
431
|
|
2367
|
432 /* Internal text as a series of textual units (8-bit bytes in the old
|
|
|
433 "Mule" encoding -- still the standard internal encoding -- and in UTF-8,
|
|
|
434 but 16-bit bytes in UTF-16 and 32-bit bytes in UTF-32). See text.c. */
|
|
|
435
|
|
|
436 #ifdef UTF16_IBYTE_FORMAT
|
|
|
437 #define NON_ASCII_INTERNAL_FORMAT
|
|
|
438 typedef unsigned short Itext;
|
|
|
439 #else
|
|
|
440 typedef Ibyte Itext;
|
|
|
441 #endif
|
|
|
442 typedef EMACS_INT Textcount;
|
|
|
443
|
|
|
444 #define ITEXT_SIZE (sizeof (Itext))
|
|
|
445 /* Use this to emphasize that we are adding space for the zero-terminator */
|
|
|
446 #define ITEXT_ZTERM_SIZE ITEXT_SIZE
|
|
|
447
|
|
|
448 /* Wexttext is wchar_t on WIN32_NATIVE (and perhaps other systems that
|
|
|
449 support wchar_t's in library functions), and Extbyte otherwise. This is
|
|
|
450 used whenever we have to do any sort of manipulation of
|
|
|
451 externally-encoded strings -- generally a very bad idea, and unsafe, but
|
|
|
452 in some cases we have no choice (especially at startup, and esp. prior
|
|
|
453 to pdump, where we haven't loaded the Unicode tables necessary for
|
|
|
454 conversion under Windows). On platforms where the external encoding may
|
|
|
455 be Unicode (i.e. Windows), we always do our manipulations in Unicode,
|
|
|
456 converting to and from multibyte if necessary -- otherwise we'd have to
|
|
|
457 conditionalize on Unicode vs. multibyte all over the place, which is
|
|
|
458 just a nightmare. */
|
|
|
459 #ifdef WIN32_NATIVE
|
|
|
460 #define WEXTTEXT_IS_WIDE
|
|
|
461 typedef wchar_t Wexttext;
|
|
|
462 #else
|
|
|
463 typedef Extbyte Wexttext;
|
|
|
464 #endif
|
|
826
|
465
|
|
|
466 #if !defined (__cplusplus) || !defined (CPLUSPLUS_INTEGRAL_CLASSES_NOT_YET)
|
|
|
467
|
|
|
468 /* Counts of bytes or chars */
|
|
|
469
|
|
|
470 typedef EMACS_INT Bytecount;
|
|
|
471 typedef EMACS_INT Charcount;
|
|
|
472
|
|
647
|
473 /* Different ways of referring to a position in a buffer. We use
|
|
|
474 the typedefs in preference to 'EMACS_INT' to make it clearer what
|
|
826
|
475 sort of position is being used. See text.c for a description
|
|
|
476 of the different positions.
|
|
|
477
|
|
|
478 Note that buffer positions are 1-based, and there's a gap in the middle
|
|
|
479 of a buffer; that's why we have separate typedefs. For Lisp strings and
|
|
|
480 other strings of text, we just use Bytecount and Charcount. */
|
|
800
|
481
|
|
665
|
482 typedef EMACS_INT Charbpos;
|
|
|
483 typedef EMACS_INT Bytebpos;
|
|
|
484 typedef EMACS_INT Membpos;
|
|
647
|
485
|
|
826
|
486 /* Different ways of referring to a position that can be either in a buffer
|
|
|
487 or string; used when passing around an object that can be either a
|
|
|
488 buffer or string, and an associated position. Conceptually, they
|
|
|
489 resolve as follows:
|
|
|
490
|
|
|
491 Typedef Buffer String
|
|
|
492 ------------------------------------------------------
|
|
|
493 Charxpos Charbpos Charcount
|
|
|
494 Bytexpos Bytebpos Bytecount
|
|
|
495 Memxpos Membpos Bytecount
|
|
|
496
|
|
|
497 */
|
|
|
498
|
|
814
|
499 typedef EMACS_INT Charxpos;
|
|
|
500 typedef EMACS_INT Bytexpos;
|
|
|
501 typedef EMACS_INT Memxpos;
|
|
|
502
|
|
|
503 #else /* __cplusplus */
|
|
|
504
|
|
|
505 /* Implement strong type-checking of the above integral types by declaring
|
|
|
506 them to be classes and using operator overloading. Unfortunately this
|
|
|
507 is a huge pain in the ass because C++ doesn't strongly distinguish
|
|
|
508 "bool" and "size_t" from int. The problem is especially bad with "bool"
|
|
2956
|
509 -- if you want to be able to say `if (len--)' where len is e.g. a
|
|
814
|
510 Bytecount, you need to declare a conversion operator to bool(); and
|
|
|
511 since bool is just an alias for int, you suddenly get tons and tons of
|
|
|
512 ambiguities, which need to be resolved by lots of laborious declarations
|
|
|
513 for every single possible type combination. Hence the multitude of
|
|
|
514 declarations in DECLARE_INTCLASS_ARITH_COMPARE(). The bool/int
|
|
|
515 equivalence also means that we have to forcibly block the combinations
|
|
|
516 we don't want by creating overloaded versions of them and declaring them
|
|
|
517 private. */
|
|
|
518
|
|
|
519 class Bytecount;
|
|
|
520 class Bytebpos;
|
|
|
521 class Bytexpos;
|
|
|
522 class Charcount;
|
|
|
523 class Charbpos;
|
|
|
524 class Charxpos;
|
|
|
525 class Membpos;
|
|
|
526 class Memxpos;
|
|
|
527
|
|
|
528 /* Declare the arithmetic and comparison operations for an integral class,
|
|
|
529 i.e. one of the above classes. If this is a "position" class, where the
|
|
|
530 difference between two positions is a different class (a "count" class),
|
|
|
531 then use POSCL for the position class and COUNTCL for the count class.
|
|
|
532 If this is a simple class, where all operations yield the same class,
|
|
|
533 substitute the same class for POSCL and COUNTCL. */
|
|
|
534
|
|
|
535 #define DECLARE_INTCLASS_ARITH_COMPARE(poscl, countcl) \
|
|
|
536 poscl operator += (const countcl& l) { data += l.data; return *this; } \
|
|
|
537 poscl operator -= (const countcl& l) { data -= l.data; return *this; } \
|
|
|
538 poscl operator + (const countcl& l) const { return poscl (data + l.data); } \
|
|
|
539 poscl operator - (const countcl& l) const { return poscl (data - l.data); } \
|
|
|
540 poscl operator += (const int& l) { data += l; return *this; } \
|
|
|
541 poscl operator -= (const int& l) { data -= l; return *this; } \
|
|
|
542 poscl operator + (const int& l) const { return poscl (data + l); } \
|
|
|
543 poscl operator - (const int& l) const { return poscl (data - l); } \
|
|
|
544 poscl operator += (const unsigned int& l) { data += l; return *this; } \
|
|
|
545 poscl operator -= (const unsigned int& l) { data -= l; return *this; } \
|
|
|
546 poscl operator + (const unsigned int& l) const \
|
|
|
547 { return poscl (data + l); } \
|
|
|
548 poscl operator - (const unsigned int& l) const \
|
|
|
549 { return poscl (data - l); } \
|
|
|
550 poscl operator += (const long& l) { data += l; return *this; } \
|
|
|
551 poscl operator -= (const long& l) { data -= l; return *this; } \
|
|
|
552 poscl operator + (const long& l) const { return poscl (data + l); } \
|
|
|
553 poscl operator - (const long& l) const { return poscl (data - l); } \
|
|
|
554 poscl operator += (const unsigned long& l) { data += l; return *this; } \
|
|
|
555 poscl operator -= (const unsigned long& l) { data -= l; return *this; } \
|
|
|
556 poscl operator + (const unsigned long& l) const \
|
|
|
557 { return poscl (data + l); } \
|
|
|
558 poscl operator - (const unsigned long& l) const \
|
|
|
559 { return poscl (data - l); } \
|
|
|
560 poscl operator += (const short& l) { data += l; return *this; } \
|
|
|
561 poscl operator -= (const short& l) { data -= l; return *this; } \
|
|
|
562 poscl operator + (const short& l) const { return poscl (data + l); } \
|
|
|
563 poscl operator - (const short& l) const { return poscl (data - l); } \
|
|
|
564 poscl operator += (const unsigned short& l) { data += l; return *this; } \
|
|
|
565 poscl operator -= (const unsigned short& l) { data -= l; return *this; } \
|
|
|
566 poscl operator + (const unsigned short& l) const \
|
|
|
567 { return poscl (data + l); } \
|
|
|
568 poscl operator - (const unsigned short& l) const \
|
|
|
569 { return poscl (data - l); } \
|
|
|
570 \
|
|
|
571 poscl operator *= (const countcl& l) { data *= l.data; return *this; } \
|
|
|
572 poscl operator /= (const countcl& l) { data /= l.data; return *this; } \
|
|
|
573 poscl operator * (const countcl& l) const { return poscl (data * l.data); } \
|
|
|
574 poscl operator / (const countcl& l) const { return poscl (data / l.data); } \
|
|
|
575 poscl operator *= (const int& l) { data *= l; return *this; } \
|
|
|
576 poscl operator /= (const int& l) { data /= l; return *this; } \
|
|
|
577 poscl operator * (const int& l) const { return poscl (data * l); } \
|
|
|
578 poscl operator / (const int& l) const { return poscl (data / l); } \
|
|
|
579 poscl operator *= (const unsigned int& l) { data *= l; return *this; } \
|
|
|
580 poscl operator /= (const unsigned int& l) { data /= l; return *this; } \
|
|
|
581 poscl operator * (const unsigned int& l) const { return poscl (data * l); } \
|
|
|
582 poscl operator / (const unsigned int& l) const { return poscl (data / l); } \
|
|
|
583 poscl operator *= (const long& l) { data *= l; return *this; } \
|
|
|
584 poscl operator /= (const long& l) { data /= l; return *this; } \
|
|
|
585 poscl operator * (const long& l) const { return poscl (data * l); } \
|
|
|
586 poscl operator / (const long& l) const { return poscl (data / l); } \
|
|
|
587 poscl operator *= (const unsigned long& l) { data *= l; return *this; } \
|
|
|
588 poscl operator /= (const unsigned long& l) { data /= l; return *this; } \
|
|
|
589 poscl operator * (const unsigned long& l) const \
|
|
|
590 { return poscl (data * l); } \
|
|
|
591 poscl operator / (const unsigned long& l) const \
|
|
|
592 { return poscl (data / l); } \
|
|
|
593 poscl operator *= (const short& l) { data *= l; return *this; } \
|
|
|
594 poscl operator /= (const short& l) { data /= l; return *this; } \
|
|
|
595 poscl operator * (const short& l) const { return poscl (data * l); } \
|
|
|
596 poscl operator / (const short& l) const { return poscl (data / l); } \
|
|
|
597 poscl operator *= (const unsigned short& l) { data *= l; return *this; } \
|
|
|
598 poscl operator /= (const unsigned short& l) { data /= l; return *this; } \
|
|
|
599 poscl operator * (const unsigned short& l) const \
|
|
|
600 { return poscl (data * l); } \
|
|
|
601 poscl operator / (const unsigned short& l) const \
|
|
|
602 { return poscl (data / l); } \
|
|
|
603 \
|
|
|
604 poscl operator &= (const countcl& l) { data &= l.data; return *this; } \
|
|
|
605 poscl operator |= (const countcl& l) { data |= l.data; return *this; } \
|
|
|
606 poscl operator & (const countcl& l) const { return poscl (data & l.data); } \
|
|
|
607 poscl operator | (const countcl& l) const { return poscl (data | l.data); } \
|
|
|
608 poscl operator &= (const int& l) { data &= l; return *this; } \
|
|
|
609 poscl operator |= (const int& l) { data |= l; return *this; } \
|
|
|
610 poscl operator & (const int& l) const { return poscl (data & l); } \
|
|
|
611 poscl operator | (const int& l) const { return poscl (data | l); } \
|
|
|
612 poscl operator &= (const unsigned int& l) { data &= l; return *this; } \
|
|
|
613 poscl operator |= (const unsigned int& l) { data |= l; return *this; } \
|
|
|
614 poscl operator & (const unsigned int& l) const { return poscl (data & l); } \
|
|
|
615 poscl operator | (const unsigned int& l) const { return poscl (data | l); } \
|
|
|
616 poscl operator &= (const long& l) { data &= l; return *this; } \
|
|
|
617 poscl operator |= (const long& l) { data |= l; return *this; } \
|
|
|
618 poscl operator & (const long& l) const { return poscl (data & l); } \
|
|
|
619 poscl operator | (const long& l) const { return poscl (data | l); } \
|
|
|
620 poscl operator &= (const unsigned long& l) { data &= l; return *this; } \
|
|
|
621 poscl operator |= (const unsigned long& l) { data |= l; return *this; } \
|
|
|
622 poscl operator & (const unsigned long& l) const \
|
|
|
623 { return poscl (data & l); } \
|
|
|
624 poscl operator | (const unsigned long& l) const \
|
|
|
625 { return poscl (data | l); } \
|
|
|
626 poscl operator &= (const short& l) { data &= l; return *this; } \
|
|
|
627 poscl operator |= (const short& l) { data |= l; return *this; } \
|
|
|
628 poscl operator & (const short& l) const { return poscl (data & l); } \
|
|
|
629 poscl operator | (const short& l) const { return poscl (data | l); } \
|
|
|
630 poscl operator &= (const unsigned short& l) { data &= l; return *this; } \
|
|
|
631 poscl operator |= (const unsigned short& l) { data |= l; return *this; } \
|
|
|
632 poscl operator & (const unsigned short& l) const \
|
|
|
633 { return poscl (data & l); } \
|
|
|
634 poscl operator | (const unsigned short& l) const \
|
|
|
635 { return poscl (data | l); } \
|
|
|
636 \
|
|
|
637 poscl operator - () { return poscl (-data); } \
|
|
|
638 poscl operator-- () { data--; return *this; } \
|
|
|
639 poscl operator-- (int) { data--; return poscl (data + 1); } \
|
|
|
640 poscl operator++ () { data++; return *this; } \
|
|
|
641 poscl operator++ (int) { data++; return poscl (data - 1); } \
|
|
|
642 \
|
|
|
643 bool operator < (const poscl& l) const { return data < l.data; } \
|
|
|
644 bool operator <= (const poscl& l) const { return data <= l.data; } \
|
|
|
645 bool operator > (const poscl& l) const { return data > l.data; } \
|
|
|
646 bool operator >= (const poscl& l) const { return data >= l.data; } \
|
|
|
647 bool operator == (const poscl& l) const { return data == l.data; } \
|
|
|
648 bool operator != (const poscl& l) const { return data != l.data; } \
|
|
|
649 bool operator < (const int& l) const { return data < (EMACS_INT) l; } \
|
|
|
650 bool operator <= (const int& l) const { return data <= (EMACS_INT) l; } \
|
|
|
651 bool operator > (const int& l) const { return data > (EMACS_INT) l; } \
|
|
|
652 bool operator >= (const int& l) const { return data >= (EMACS_INT) l; } \
|
|
|
653 bool operator == (const int& l) const { return data == (EMACS_INT) l; } \
|
|
|
654 bool operator != (const int& l) const { return data != (EMACS_INT) l; } \
|
|
|
655 bool operator < (const unsigned int& l) const \
|
|
|
656 { return data < (EMACS_INT) l; } \
|
|
|
657 bool operator <= (const unsigned int& l) const \
|
|
|
658 { return data <= (EMACS_INT) l; } \
|
|
|
659 bool operator > (const unsigned int& l) const \
|
|
|
660 { return data > (EMACS_INT) l; } \
|
|
|
661 bool operator >= (const unsigned int& l) const \
|
|
|
662 { return data >= (EMACS_INT) l; } \
|
|
|
663 bool operator == (const unsigned int& l) const \
|
|
|
664 { return data == (EMACS_INT) l; } \
|
|
|
665 bool operator != (const unsigned int& l) const \
|
|
|
666 { return data != (EMACS_INT) l; } \
|
|
|
667 bool operator < (const long& l) const { return data < (EMACS_INT) l; } \
|
|
|
668 bool operator <= (const long& l) const { return data <= (EMACS_INT) l; } \
|
|
|
669 bool operator > (const long& l) const { return data > (EMACS_INT) l; } \
|
|
|
670 bool operator >= (const long& l) const { return data >= (EMACS_INT) l; } \
|
|
|
671 bool operator == (const long& l) const { return data == (EMACS_INT) l; } \
|
|
|
672 bool operator != (const long& l) const { return data != (EMACS_INT) l; } \
|
|
|
673 bool operator < (const unsigned long& l) const \
|
|
|
674 { return data < (EMACS_INT) l; } \
|
|
|
675 bool operator <= (const unsigned long& l) const \
|
|
|
676 { return data <= (EMACS_INT) l; } \
|
|
|
677 bool operator > (const unsigned long& l) const \
|
|
|
678 { return data > (EMACS_INT) l; } \
|
|
|
679 bool operator >= (const unsigned long& l) const \
|
|
|
680 { return data >= (EMACS_INT) l; } \
|
|
|
681 bool operator == (const unsigned long& l) const \
|
|
|
682 { return data == (EMACS_INT) l; } \
|
|
|
683 bool operator != (const unsigned long& l) const \
|
|
|
684 { return data != (EMACS_INT) l; } \
|
|
|
685 bool operator < (const short& l) const { return data < (EMACS_INT) l; } \
|
|
|
686 bool operator <= (const short& l) const { return data <= (EMACS_INT) l; } \
|
|
|
687 bool operator > (const short& l) const { return data > (EMACS_INT) l; } \
|
|
|
688 bool operator >= (const short& l) const { return data >= (EMACS_INT) l; } \
|
|
|
689 bool operator == (const short& l) const { return data == (EMACS_INT) l; } \
|
|
|
690 bool operator != (const short& l) const { return data != (EMACS_INT) l; } \
|
|
|
691 bool operator < (const unsigned short& l) const \
|
|
|
692 { return data < (EMACS_INT) l; } \
|
|
|
693 bool operator <= (const unsigned short& l) const \
|
|
|
694 { return data <= (EMACS_INT) l; } \
|
|
|
695 bool operator > (const unsigned short& l) const \
|
|
|
696 { return data > (EMACS_INT) l; } \
|
|
|
697 bool operator >= (const unsigned short& l) const \
|
|
|
698 { return data >= (EMACS_INT) l; } \
|
|
|
699 bool operator == (const unsigned short& l) const \
|
|
|
700 { return data == (EMACS_INT) l; } \
|
|
|
701 bool operator != (const unsigned short& l) const \
|
|
|
702 { return data != (EMACS_INT) l; } \
|
|
|
703 bool operator ! () const { return !data; }
|
|
|
704
|
|
|
705 /* Declare the "bad" or disallowed arithmetic and comparion operations
|
|
|
706 between class GOOD and class BAD. Meant to go inside the private
|
|
|
707 section of class GOOD. */
|
|
|
708
|
|
|
709 #define DECLARE_BAD_INTCLASS_ARITH_COMPARE(good, bad) \
|
|
|
710 good operator += (const bad& l) { return badret; } \
|
|
|
711 good operator -= (const bad& l) { return badret; } \
|
|
|
712 good operator *= (const bad& l) { return badret; } \
|
|
|
713 good operator /= (const bad& l) { return badret; } \
|
|
|
714 good operator + (const bad& l) { return badret; } \
|
|
|
715 good operator - (const bad& l) { return badret; } \
|
|
|
716 good operator * (const bad& l) { return badret; } \
|
|
|
717 good operator / (const bad& l) { return badret; } \
|
|
|
718 \
|
|
|
719 bool operator < (const bad& l) { return 0; } \
|
|
|
720 bool operator <= (const bad& l) { return 0; } \
|
|
|
721 bool operator > (const bad& l) { return 0; } \
|
|
|
722 bool operator >= (const bad& l) { return 0; } \
|
|
|
723 bool operator == (const bad& l) { return 0; } \
|
|
|
724 bool operator != (const bad& l) { return 0; }
|
|
|
725
|
|
|
726 /* Declare the "bad" or disallowed arithmetic operations between class GOOD
|
|
|
727 and another of the same class, for a position class. Meant to go inside
|
|
|
728 the private section of class GOOD. */
|
|
|
729
|
|
|
730 #define DECLARE_BAD_POS_CLASS_ARITH(good) \
|
|
|
731 good operator += (const good& l) { return badret; } \
|
|
|
732 good operator -= (const good& l) { return badret; } \
|
|
|
733 good operator *= (const good& l) { return badret; } \
|
|
|
734 good operator /= (const good& l) { return badret; } \
|
|
|
735 good operator + (const good& l) { return badret; } \
|
|
|
736 good operator * (const good& l) { return badret; } \
|
|
|
737 good operator / (const good& l) { return badret; }
|
|
|
738
|
|
|
739 /* Basic declaration at the top of all integral classes. Don't call
|
|
|
740 directly, use one of the more specific versions below. */
|
|
|
741
|
|
|
742 #define DECLARE_INTCLASS(cl) \
|
|
|
743 public: \
|
|
|
744 EMACS_INT data; \
|
|
|
745 cl () { data = 0xCDCDCDCD; } \
|
|
|
746 cl (int i) { data = i; } \
|
|
|
747 cl (unsigned int i) { data = i; } \
|
|
|
748 cl (long i) { data = i; } \
|
|
|
749 cl (unsigned long i) { data = i; } \
|
|
|
750 cl (short i) { data = i; } \
|
|
|
751 cl (unsigned short i) { data = i; } \
|
|
|
752 operator EMACS_INT () const { return data; }
|
|
|
753
|
|
|
754 /* Basic declaration at the top of all count classes. */
|
|
|
755
|
|
|
756 #define DECLARE_COUNT_CLASS(cl) \
|
|
|
757 DECLARE_INTCLASS (cl) \
|
|
|
758 DECLARE_INTCLASS_ARITH_COMPARE (cl, cl) \
|
|
|
759 private: \
|
|
|
760 static cl badret;
|
|
|
761
|
|
|
762 /* Basic declaration at the bottom of the prelude of all position classes.
|
|
|
763 Don't call directly. */
|
|
|
764
|
|
|
765 #define DECLARE_POS_CLASS_SECOND_HALF(cl, countcl) \
|
|
|
766 DECLARE_INTCLASS_ARITH_COMPARE (cl, countcl) \
|
|
|
767 countcl operator - (const cl& l) const { return countcl (data - l.data); } \
|
|
|
768 private: \
|
|
|
769 static cl badret; \
|
|
|
770 DECLARE_BAD_POS_INTCLASS_ARITH (cl)
|
|
|
771
|
|
|
772 /* Basic declaration at the top of all buffer position classes. */
|
|
|
773
|
|
|
774 #define DECLARE_BPOS_CLASS(cl, countcl) \
|
|
|
775 DECLARE_INTCLASS (cl) \
|
|
|
776 DECLARE_POS_CLASS_SECOND_HALF (cl, countcl)
|
|
|
777
|
|
|
778 /* Basic declaration at the top of all X-position classes (that can refer
|
|
|
779 to buffers or strings). CL1 and CL2 are the equivalent more specific
|
|
1318
|
780 classes referring only to buffers or strings, respectively. */
|
|
814
|
781
|
|
|
782 #define DECLARE_XPOS_CLASS(cl, countcl, cl1, cl2) \
|
|
|
783 DECLARE_INTCLASS (cl) \
|
|
|
784 cl (const cl1& x) { data = x.data; } \
|
|
|
785 cl (const cl2& x) { data = x.data; } \
|
|
|
786 operator cl1 () const { return cl1 (data); } \
|
|
|
787 operator cl2 () const { return cl2 (data); } \
|
|
|
788 DECLARE_POS_CLASS_SECOND_HALF (cl, countcl)
|
|
|
789
|
|
|
790 /* Declare the "bad" or disallowed arithmetic and comparion operations
|
|
|
791 between class CHARCL (a character class) and various non-character
|
|
|
792 classes. Meant to go inside the private section of class GOOD. */
|
|
|
793
|
|
|
794 #define DECLARE_BAD_CHAR_INTCLASS_ARITH_COMPARE(charcl) \
|
|
|
795 DECLARE_BAD_INTCLASS_ARITH_COMPARE (charcl, Bytecount) \
|
|
|
796 DECLARE_BAD_INTCLASS_ARITH_COMPARE (charcl, Bytebpos) \
|
|
|
797 DECLARE_BAD_INTCLASS_ARITH_COMPARE (charcl, Bytexpos) \
|
|
|
798 DECLARE_BAD_INTCLASS_ARITH_COMPARE (charcl, Membpos) \
|
|
|
799 DECLARE_BAD_INTCLASS_ARITH_COMPARE (charcl, Memxpos)
|
|
|
800
|
|
|
801 /* Declare the "bad" or disallowed arithmetic and comparion operations
|
|
|
802 between class BYTECL (a byte class) and various non-byte classes.
|
|
|
803 Meant to go inside the private section of class GOOD. */
|
|
|
804
|
|
|
805 #define DECLARE_BAD_BYTE_INTCLASS_ARITH_COMPARE(bytecl) \
|
|
|
806 DECLARE_BAD_INTCLASS_ARITH_COMPARE (bytecl, Charcount) \
|
|
|
807 DECLARE_BAD_INTCLASS_ARITH_COMPARE (bytecl, Charbpos) \
|
|
|
808 DECLARE_BAD_INTCLASS_ARITH_COMPARE (bytecl, Charxpos) \
|
|
|
809 DECLARE_BAD_INTCLASS_ARITH_COMPARE (bytecl, Membpos) \
|
|
|
810 DECLARE_BAD_INTCLASS_ARITH_COMPARE (bytecl, Memxpos)
|
|
|
811
|
|
|
812 /* Declare the "bad" or disallowed arithmetic and comparion operations
|
|
|
813 between class BYTECL (a mem class) and various non-mem classes.
|
|
|
814 Meant to go inside the private section of class GOOD. */
|
|
|
815
|
|
|
816 #define DECLARE_BAD_MEM_INTCLASS_ARITH_COMPARE(bytecl) \
|
|
|
817 DECLARE_BAD_INTCLASS_ARITH_COMPARE (bytecl, Charcount) \
|
|
|
818 DECLARE_BAD_INTCLASS_ARITH_COMPARE (bytecl, Charbpos) \
|
|
|
819 DECLARE_BAD_INTCLASS_ARITH_COMPARE (bytecl, Charxpos) \
|
|
|
820 DECLARE_BAD_INTCLASS_ARITH_COMPARE (bytecl, Bytebpos) \
|
|
|
821 DECLARE_BAD_INTCLASS_ARITH_COMPARE (bytecl, Bytexpos)
|
|
|
822
|
|
|
823 class Charcount
|
|
|
824 {
|
|
|
825 DECLARE_COUNT_CLASS (Charcount)
|
|
|
826 DECLARE_BAD_CHAR_INTCLASS_ARITH_COMPARE (Charcount)
|
|
|
827 };
|
|
|
828
|
|
|
829 class Charbpos
|
|
|
830 {
|
|
|
831 DECLARE_BPOS_CLASS (Charbpos, Charcount)
|
|
|
832 DECLARE_BAD_CHAR_INTCLASS_ARITH_COMPARE (Charbpos)
|
|
|
833 };
|
|
|
834
|
|
|
835 class Charxpos
|
|
|
836 {
|
|
|
837 DECLARE_XPOS_CLASS (Charxpos, Charcount, Charbpos, Charcount)
|
|
|
838 DECLARE_BAD_CHAR_INTCLASS_ARITH_COMPARE (Charxpos)
|
|
|
839 };
|
|
|
840
|
|
|
841 class Bytecount
|
|
|
842 {
|
|
|
843 DECLARE_COUNT_CLASS (Bytecount)
|
|
|
844 DECLARE_BAD_BYTE_INTCLASS_ARITH_COMPARE (Bytecount)
|
|
|
845 };
|
|
|
846
|
|
|
847 class Bytebpos
|
|
|
848 {
|
|
|
849 DECLARE_BPOS_CLASS (Bytebpos, Bytecount)
|
|
|
850 DECLARE_BAD_BYTE_INTCLASS_ARITH_COMPARE (Bytebpos)
|
|
|
851 };
|
|
|
852
|
|
|
853 class Bytexpos
|
|
|
854 {
|
|
|
855 DECLARE_XPOS_CLASS (Bytexpos, Bytecount, Bytebpos, Bytecount)
|
|
|
856 DECLARE_BAD_BYTE_INTCLASS_ARITH_COMPARE (Bytexpos)
|
|
|
857 };
|
|
|
858
|
|
|
859 class Membpos
|
|
|
860 {
|
|
|
861 DECLARE_BPOS_CLASS (Membpos, Bytecount)
|
|
|
862 DECLARE_BAD_MEM_INTCLASS_ARITH_COMPARE (Membpos)
|
|
|
863 };
|
|
|
864
|
|
|
865 class Memxpos
|
|
|
866 {
|
|
|
867 DECLARE_XPOS_CLASS (Memxpos, Bytecount, Membpos, Bytecount)
|
|
|
868 DECLARE_BAD_MEM_INTCLASS_ARITH_COMPARE (Memxpos)
|
|
|
869 };
|
|
|
870
|
|
826
|
871 #define DECLARE_POINTER_TYPE_ARITH_COUNT(pointer, countcl) \
|
|
|
872 inline pointer operator += (const pointer & x, const countcl& y) \
|
|
|
873 { x += y.data; return x; } \
|
|
|
874 inline pointer operator -= (const pointer & x, const countcl& y) \
|
|
|
875 { x -= y.data; return x; } \
|
|
|
876 inline pointer operator + (const pointer x, const countcl& y) \
|
|
|
877 { return x + y.data; } \
|
|
|
878 inline pointer operator - (const pointer x, const countcl& y) \
|
|
814
|
879 { return x - y.data; }
|
|
|
880
|
|
|
881 #define DECLARE_INTEGRAL_TYPE_ARITH_COUNT(integral, countcl) \
|
|
|
882 inline integral operator += (integral & x, const countcl& y) \
|
|
|
883 { x += y.data; return x; } \
|
|
|
884 inline integral operator -= (integral & x, const countcl& y) \
|
|
|
885 { x -= y.data; return x; } \
|
|
|
886 inline countcl operator + (integral x, const countcl& y) \
|
|
|
887 { return countcl (x + y.data); } \
|
|
|
888 inline countcl operator - (integral x, const countcl& y) \
|
|
|
889 { return countcl (x - y.data); }
|
|
|
890
|
|
|
891 #define DECLARE_INTEGRAL_TYPE_COMPARE(integral, cl) \
|
|
|
892 inline bool operator < (integral x, const cl& y) \
|
|
|
893 { return (EMACS_INT) x < y.data; } \
|
|
|
894 inline bool operator <= (integral x, const cl& y) \
|
|
|
895 { return (EMACS_INT) x <= y.data; } \
|
|
|
896 inline bool operator > (integral x, const cl& y) \
|
|
|
897 { return (EMACS_INT) x > y.data; } \
|
|
|
898 inline bool operator >= (integral x, const cl& y) \
|
|
|
899 { return (EMACS_INT) x >= y.data; } \
|
|
|
900 inline bool operator == (integral x, const cl& y) \
|
|
|
901 { return (EMACS_INT) x == y.data; } \
|
|
|
902 inline bool operator != (integral x, const cl& y) \
|
|
|
903 { return (EMACS_INT) x != y.data; }
|
|
|
904
|
|
|
905 #if 0
|
|
|
906 /* Unfortunately C++ doesn't let you overload the ?: operator, so we have
|
|
|
907 to manually deal with ambiguities using casting */
|
|
|
908 #define DECLARE_INTEGRAL_TYPE_TRISTATE(integral, cl) \
|
|
|
909 inline cl operator ?: (bool b, integral x, const cl& y) \
|
|
|
910 { return b ? cl (x) : y; } \
|
|
|
911 inline cl operator ?: (bool b, const cl& x, integral y) \
|
|
|
912 { return b ? x : cl (y); }
|
|
|
913 #endif /* 0 */
|
|
|
914
|
|
867
|
915 /* DECLARE_POINTER_TYPE_ARITH_COUNT (const Ibyte *, Bytecount);
|
|
826
|
916 DECLARE_POINTER_TYPE_ARITH_COUNT (const Extbyte *, Bytecount); */
|
|
867
|
917 DECLARE_POINTER_TYPE_ARITH_COUNT (Ibyte *, Bytecount);
|
|
814
|
918 DECLARE_POINTER_TYPE_ARITH_COUNT (Extbyte *, Bytecount);
|
|
|
919
|
|
|
920 DECLARE_INTEGRAL_TYPE_ARITH_COUNT (int, Bytecount);
|
|
|
921 DECLARE_INTEGRAL_TYPE_ARITH_COUNT (int, Charcount);
|
|
|
922 DECLARE_INTEGRAL_TYPE_ARITH_COUNT (unsigned int, Bytecount);
|
|
|
923 DECLARE_INTEGRAL_TYPE_ARITH_COUNT (unsigned int, Charcount);
|
|
|
924 DECLARE_INTEGRAL_TYPE_ARITH_COUNT (long, Bytecount);
|
|
|
925 DECLARE_INTEGRAL_TYPE_ARITH_COUNT (long, Charcount);
|
|
|
926 DECLARE_INTEGRAL_TYPE_ARITH_COUNT (unsigned long, Bytecount);
|
|
|
927 DECLARE_INTEGRAL_TYPE_ARITH_COUNT (unsigned long, Charcount);
|
|
|
928
|
|
|
929 DECLARE_INTEGRAL_TYPE_COMPARE (int, Bytecount);
|
|
|
930 DECLARE_INTEGRAL_TYPE_COMPARE (int, Charcount);
|
|
|
931 DECLARE_INTEGRAL_TYPE_COMPARE (unsigned int, Bytecount);
|
|
|
932 DECLARE_INTEGRAL_TYPE_COMPARE (unsigned int, Charcount);
|
|
|
933 DECLARE_INTEGRAL_TYPE_COMPARE (long, Bytecount);
|
|
|
934 DECLARE_INTEGRAL_TYPE_COMPARE (long, Charcount);
|
|
|
935 DECLARE_INTEGRAL_TYPE_COMPARE (unsigned long, Bytecount);
|
|
|
936 DECLARE_INTEGRAL_TYPE_COMPARE (unsigned long, Charcount);
|
|
|
937
|
|
|
938 #if 0 /* doesn't work */
|
|
867
|
939 inline Bytecount operator - (const Ibyte *x, const Ibyte *y) \
|
|
814
|
940 { return Bytecount (x - y); }
|
|
|
941 #endif
|
|
|
942
|
|
|
943 #endif /* __cplusplus */
|
|
|
944
|
|
665
|
945 /* Counts of elements */
|
|
|
946 typedef EMACS_INT Elemcount;
|
|
|
947 /* Hash codes */
|
|
|
948 typedef unsigned long Hashcode;
|
|
2367
|
949 /* Booleans */
|
|
|
950 typedef int Boolint;
|
|
771
|
951
|
|
793
|
952 /* ------------------------ basic compiler defines ------------------- */
|
|
428
|
953
|
|
1743
|
954 #include "compiler.h"
|
|
1632
|
955
|
|
793
|
956 /* ------------------------ alignment definitions ------------------- */
|
|
|
957
|
|
454
|
958 /* No type has a greater alignment requirement than max_align_t.
|
|
|
959 (except perhaps for types we don't use, like long double) */
|
|
|
960 typedef union
|
|
|
961 {
|
|
|
962 struct { long l; } l;
|
|
|
963 struct { void *p; } p;
|
|
|
964 struct { void (*f)(void); } f;
|
|
|
965 struct { double d; } d;
|
|
|
966 } max_align_t;
|
|
|
967
|
|
771
|
968 /* ALIGNOF returns the required alignment of a type -- i.e. a value such
|
|
|
969 that data of this type must begin at a memory address which is a
|
|
|
970 multiple of that value. For simple types, this is often the same size
|
|
|
971 as the type itself. */
|
|
|
972
|
|
428
|
973 #ifndef ALIGNOF
|
|
|
974 # if defined (__GNUC__) && (__GNUC__ >= 2)
|
|
454
|
975 /* gcc has an extension that gives us exactly what we want. */
|
|
|
976 # define ALIGNOF(type) __alignof__ (type)
|
|
|
977 # elif ! defined (__cplusplus)
|
|
|
978 /* The following is mostly portable, except that:
|
|
|
979 - it doesn't work for inside out declarations like void (*) (void).
|
|
|
980 (so just call ALIGNOF with a typedef'ed name)
|
|
|
981 - it doesn't work with C++. The C++ committee has decided,
|
|
|
982 in its infinite wisdom, that:
|
|
|
983 "Types must be declared in declarations, not in expressions." */
|
|
|
984 # define ALIGNOF(type) offsetof (struct { char c; type member; }, member)
|
|
428
|
985 # else
|
|
456
|
986 /* C++ is annoying, but it has a big bag of tricks.
|
|
|
987 The following doesn't have the "inside out" declaration bug C does. */
|
|
458
|
988 template<typename T> struct alignment_trick { char c; T member; };
|
|
456
|
989 # define ALIGNOF(type) offsetof (alignment_trick<type>, member)
|
|
428
|
990 # endif
|
|
454
|
991 #endif /* ALIGNOF */
|
|
428
|
992
|
|
771
|
993 /* ALIGN_SIZE returns the smallest size greater than or equal to LEN which
|
|
|
994 is a multiple of UNIT. This can be used to assure that data that
|
|
|
995 follows a block of the returned size is of correct alignment for a type
|
|
|
996 whose alignment (as returned by ALIGNOF) is UNIT (provided that the
|
|
|
997 block itself is correctly aligned for this type; memory returned by
|
|
|
998 malloc() is guaranteed to be correctly aligned for all types). */
|
|
|
999
|
|
428
|
1000 #define ALIGN_SIZE(len, unit) \
|
|
|
1001 ((((len) + (unit) - 1) / (unit)) * (unit))
|
|
|
1002
|
|
826
|
1003 /* ALIGN_FOR_TYPE returns the smallest size greater than or equal to LEN
|
|
|
1004 which is aligned for the given type. This can be used to assure that
|
|
|
1005 data that follows a block of the returned size is of correct alignment
|
|
|
1006 for the type (provided that the block itself is correctly aligned for
|
|
|
1007 this type; memory returned by malloc() is guaranteed to be correctly
|
|
|
1008 aligned for all types). */
|
|
|
1009
|
|
|
1010 #define ALIGN_FOR_TYPE(len, type) ALIGN_SIZE (len, ALIGNOF (type))
|
|
|
1011
|
|
771
|
1012 /* MAX_ALIGN_SIZE returns the smallest size greater than or equal to LEN
|
|
|
1013 which guarantees that data following a block of such size is correctly
|
|
|
1014 aligned for all types (provided that the block itself is so aligned,
|
|
|
1015 which is the case for memory returned by malloc()). */
|
|
|
1016
|
|
826
|
1017 #define MAX_ALIGN_SIZE(len) ALIGN_FOR_TYPE (len, max_align_t)
|
|
|
1018
|
|
|
1019 /* ALIGN_PTR returns the smallest pointer >= PTR which is aligned for
|
|
|
1020 data of TYPE. */
|
|
|
1021 #define ALIGN_PTR(ptr, type) ((void *) ALIGN_FOR_TYPE ((size_t) (ptr), type))
|
|
428
|
1022
|
|
1743
|
1023 BEGIN_C_DECLS
|
|
1650
|
1024
|
|
793
|
1025 /* ------------------------ assertions ------------------- */
|
|
428
|
1026
|
|
|
1027 /* We define assert iff USE_ASSERTIONS or DEBUG_XEMACS is defined.
|
|
|
1028 Otherwise we define it to be empty. Quantify has shown that the
|
|
|
1029 time the assert checks take is measurable so let's not include them
|
|
771
|
1030 in production binaries.
|
|
|
1031
|
|
788
|
1032 If ASSERTIONS_DONT_ABORT defined, we will continue after assertion
|
|
|
1033 failures.
|
|
|
1034
|
|
|
1035 assert_at_line() is used for asserts inside of inline functions called
|
|
|
1036 from error-checking macros. If we're not tricky, we just get the file
|
|
|
1037 and line of the inline function, which is not very useful. */
|
|
428
|
1038
|
|
|
1039 /* Highly dubious kludge */
|
|
|
1040 /* (thanks, Jamie, I feel better now -- ben) */
|
|
2367
|
1041 MODULE_API void assert_failed (const Ascbyte *, int, const Ascbyte *);
|
|
2535
|
1042 #define ABORT() (assert_failed (__FILE__, __LINE__, "ABORT()"))
|
|
|
1043
|
|
|
1044 #ifdef USE_ASSERTIONS
|
|
428
|
1045 # define assert(x) ((x) ? (void) 0 : assert_failed (__FILE__, __LINE__, #x))
|
|
853
|
1046 # define assert_with_message(x, msg) \
|
|
|
1047 ((x) ? (void) 0 : assert_failed (__FILE__, __LINE__, msg))
|
|
788
|
1048 # define assert_at_line(x, file, line) \
|
|
|
1049 ((x) ? (void) 0 : assert_failed (file, line, #x))
|
|
2535
|
1050 #elif defined (DEBUG_XEMACS)
|
|
|
1051 # define assert(x) ((x) ? (void) 0 : (void) ABORT ())
|
|
2956
|
1052 # define assert_with_message(x, msg) assert (x)
|
|
2535
|
1053 # define assert_at_line(x, file, line) assert (x)
|
|
428
|
1054 #else
|
|
2956
|
1055 /* This used to be ((void) (0)) but that triggers lots of unused variable
|
|
|
1056 warnings. It's pointless to force all that code to be rewritten, with
|
|
|
1057 added ifdefs. Any reasonable compiler will eliminate an expression with
|
|
|
1058 no effects. */
|
|
|
1059 # define assert(x) ((void) (x))
|
|
|
1060 # define assert_with_message(x, msg) assert (x)
|
|
2535
|
1061 # define assert_at_line(x, file, line) assert (x)
|
|
428
|
1062 #endif
|
|
|
1063
|
|
2367
|
1064 /************************************************************************/
|
|
|
1065 /** Memory allocation **/
|
|
|
1066 /************************************************************************/
|
|
853
|
1067
|
|
793
|
1068 /* ------------------------ simple memory allocation ------------------- */
|
|
|
1069
|
|
2367
|
1070 /* Basic memory allocation and freeing functions */
|
|
|
1071 void malloc_warning (const Ascbyte *);
|
|
1743
|
1072 MODULE_API void *xmalloc (Bytecount size) ATTRIBUTE_MALLOC;
|
|
|
1073 MODULE_API void *xmalloc_and_zero (Bytecount size) ATTRIBUTE_MALLOC;
|
|
|
1074 MODULE_API void *xrealloc (void *, Bytecount size) ATTRIBUTE_MALLOC;
|
|
2367
|
1075 MODULE_API Chbyte *xstrdup (const Chbyte *) ATTRIBUTE_MALLOC;
|
|
|
1076
|
|
|
1077 /* Basic free function */
|
|
|
1078
|
|
|
1079 MODULE_API void xfree_1 (void *);
|
|
|
1080 #ifdef ERROR_CHECK_MALLOC
|
|
|
1081 /* This used to use a temporary variable, which both avoided the multiple
|
|
|
1082 evaluation and obviated the need for the TYPE argument. But that triggered
|
|
|
1083 complaints under strict aliasing. #### There should be a better way. */
|
|
|
1084 #define xfree(lvalue, type) do \
|
|
|
1085 { \
|
|
|
1086 xfree_1 (lvalue); \
|
|
|
1087 VOIDP_CAST (lvalue) = (void *) 0xDEADBEEF; \
|
|
|
1088 } while (0)
|
|
|
1089 #else
|
|
|
1090 #define xfree(lvalue,type) xfree_1 (lvalue)
|
|
|
1091 #endif /* ERROR_CHECK_MALLOC */
|
|
|
1092
|
|
|
1093 /* ------------------------ stack allocation -------------------------- */
|
|
|
1094
|
|
|
1095 /* Allocating excessively large blocks on the stack can cause crashes.
|
|
851
|
1096 We provide MALLOC_OR_ALLOCA() below for places where it's likely that
|
|
|
1097 large amounts will be allocated; it mallocs the block if it's too big.
|
|
|
1098 Unfortunately, that requires a call to unbind_to() at the end of the
|
|
|
1099 function, and it's not feasible to rewrite all calls to alloca() this
|
|
|
1100 way.
|
|
|
1101
|
|
|
1102 Instead, we use the portable C alloca() substitute in alloca.c above a
|
|
|
1103 certain size. This actually uses malloc(), but checks the current stack
|
|
|
1104 pointer to see if data from previous alloca() calls needs to be freed.
|
|
|
1105 However, this can lead to large heap sizes -- especially since cleanup
|
|
|
1106 can only happen in a parent function, and will never happen if (as will
|
|
|
1107 often be the case) it's the same function in the same place in the code
|
|
|
1108 that keeps tripping the alloca() limit.
|
|
|
1109
|
|
|
1110 So we set up a system to periodically force cleanup. Currently we
|
|
|
1111 do cleanup:
|
|
|
1112
|
|
|
1113 -- Only when there's C alloca() data, and then
|
|
|
1114 -- Every stack alloca() or allocation of Lisp data, every call to
|
|
|
1115 next_event_internal() [typically near the top of the stack],
|
|
|
1116 or every 10th funcall
|
|
|
1117
|
|
|
1118 This should not be a big penalty because
|
|
|
1119
|
|
|
1120 (a) If there are few C alloca() chunks, checking them will be fast
|
|
|
1121 (b) If not, we've allocated a huge amount of heap space (remember, each
|
|
|
1122 chunk represents > 256K of heap), and we really want them gone
|
|
|
1123 */
|
|
|
1124
|
|
|
1125 /* We use a larger maximum when the choice is alloca() vs. the C alloca()
|
|
|
1126 substitute than when the choice is vs. malloc(), because in the former
|
|
|
1127 case, our alternative choice is less palatable because the memory may
|
|
|
1128 not be freed for awhile. */
|
|
|
1129
|
|
|
1130 #define MAX_ALLOCA_VS_C_ALLOCA 262144
|
|
|
1131 #define MAX_ALLOCA_VS_MALLOC 65536
|
|
|
1132
|
|
|
1133 #define MAX_FUNCALLS_BETWEEN_ALLOCA_CLEANUP 10
|
|
|
1134
|
|
1632
|
1135 extern MODULE_API Bytecount __temp_alloca_size__;
|
|
851
|
1136 extern Bytecount funcall_alloca_count;
|
|
|
1137
|
|
1333
|
1138 #ifdef ERROR_CHECK_MALLOC
|
|
1632
|
1139 extern MODULE_API int regex_malloc_disallowed;
|
|
1333
|
1140 #define REGEX_MALLOC_CHECK() assert (!regex_malloc_disallowed)
|
|
|
1141 #else
|
|
|
1142 #define REGEX_MALLOC_CHECK() ((void) 0)
|
|
|
1143 #endif
|
|
|
1144
|
|
851
|
1145 /* Do stack or heap alloca() depending on size.
|
|
|
1146
|
|
|
1147 NOTE: The use of a global temporary like this is unsafe if ALLOCA() occurs
|
|
|
1148 twice anywhere in the same expression; but that seems highly unlikely. The
|
|
|
1149 alternative is to force all callers to declare a local temporary if the
|
|
|
1150 expression has side effects -- something easy to forget. */
|
|
|
1151
|
|
|
1152 #define ALLOCA(size) \
|
|
1333
|
1153 (REGEX_MALLOC_CHECK (), \
|
|
|
1154 __temp_alloca_size__ = (size), \
|
|
851
|
1155 __temp_alloca_size__ > MAX_ALLOCA_VS_C_ALLOCA ? \
|
|
|
1156 xemacs_c_alloca (__temp_alloca_size__) : \
|
|
|
1157 (need_to_check_c_alloca ? xemacs_c_alloca (0) : 0, \
|
|
|
1158 alloca (__temp_alloca_size__)))
|
|
|
1159
|
|
1318
|
1160 /* Version of ALLOCA() that is guaranteed to work inside of function calls
|
|
|
1161 (i.e., we call the C alloca if regular alloca() is broken inside of
|
|
|
1162 function calls). */
|
|
|
1163 #ifdef BROKEN_ALLOCA_IN_FUNCTION_CALLS
|
|
|
1164 #define ALLOCA_FUNCALL_OK(size) xemacs_c_alloca (size)
|
|
|
1165 #else
|
|
|
1166 #define ALLOCA_FUNCALL_OK(size) ALLOCA (size)
|
|
|
1167 #endif
|
|
|
1168
|
|
2367
|
1169 MODULE_API void *xemacs_c_alloca (unsigned int size) ATTRIBUTE_MALLOC;
|
|
|
1170
|
|
|
1171 MODULE_API int record_unwind_protect_freeing (void *ptr);
|
|
|
1172
|
|
|
1173 DECLARE_INLINE_HEADER (
|
|
|
1174 void *
|
|
|
1175 xmalloc_and_record_unwind (Bytecount size)
|
|
|
1176 )
|
|
|
1177 {
|
|
|
1178 void *ptr = xmalloc (size);
|
|
|
1179 record_unwind_protect_freeing (ptr);
|
|
|
1180 return ptr;
|
|
|
1181 }
|
|
|
1182
|
|
851
|
1183 /* WARNING: If you use this, you must unbind_to() at the end of your
|
|
|
1184 function! */
|
|
|
1185
|
|
|
1186 #define MALLOC_OR_ALLOCA(size) \
|
|
1333
|
1187 (REGEX_MALLOC_CHECK (), \
|
|
|
1188 __temp_alloca_size__ = (size), \
|
|
851
|
1189 __temp_alloca_size__ > MAX_ALLOCA_VS_MALLOC ? \
|
|
|
1190 xmalloc_and_record_unwind (__temp_alloca_size__) : \
|
|
|
1191 (need_to_check_c_alloca ? xemacs_c_alloca (0) : 0, \
|
|
|
1192 alloca (__temp_alloca_size__)))
|
|
793
|
1193
|
|
2367
|
1194 /* -------------- convenience functions for memory allocation ------------- */
|
|
|
1195
|
|
|
1196 #define countof(x) ((int) (sizeof(x)/sizeof((x)[0])))
|
|
|
1197 #define xnew(type) ((type *) xmalloc (sizeof (type)))
|
|
|
1198 #define xnew_array(type, len) ((type *) xmalloc ((len) * sizeof (type)))
|
|
|
1199 #define xnew_and_zero(type) ((type *) xmalloc_and_zero (sizeof (type)))
|
|
|
1200 #define xzero(lvalue) ((void) memset (&(lvalue), '\0', sizeof (lvalue)))
|
|
|
1201 #define xnew_array_and_zero(type, len) ((type *) xmalloc_and_zero ((len) * sizeof (type)))
|
|
|
1202
|
|
|
1203 #define alloca_new(type) ((type *) ALLOCA (sizeof (type)))
|
|
|
1204 #define alloca_array(type, len) ((type *) ALLOCA ((len) * sizeof (type)))
|
|
|
1205
|
|
|
1206 #define alloca_itexts(num) alloca_array (Itext, num)
|
|
|
1207 #define alloca_ibytes(num) alloca_array (Ibyte, num)
|
|
|
1208 #define alloca_extbytes(num) alloca_array (Extbyte, num)
|
|
|
1209 #define alloca_rawbytes(num) alloca_array (Rawbyte, num)
|
|
|
1210 #define alloca_binbytes(num) alloca_array (Binbyte, num)
|
|
|
1211 #define alloca_ascbytes(num) alloca_array (Ascbyte, num)
|
|
|
1212 #define xmalloc_itexts(num) xnew_array (Itext, num)
|
|
|
1213 #define xnew_ibytes(num) xnew_array (Ibyte, num)
|
|
|
1214 #define xnew_extbytes(num) xnew_array (Extbyte, num)
|
|
|
1215 #define xnew_rawbytes(num) xnew_array (Rawbyte, num)
|
|
|
1216 #define xnew_binbytes(num) xnew_array (Binbyte, num)
|
|
|
1217 #define xnew_ascbytes(num) xnew_array (Ascbyte, num)
|
|
|
1218
|
|
|
1219 /* Make an alloca'd copy of a Ibyte * */
|
|
|
1220 #define IBYTE_STRING_TO_ALLOCA(p, lval) \
|
|
|
1221 do { \
|
|
|
1222 Ibyte **_bsta_ = (Ibyte **) &(lval); \
|
|
|
1223 const Ibyte *_bsta_2 = (p); \
|
|
|
1224 Bytecount _bsta_3 = qxestrlen (_bsta_2); \
|
|
|
1225 *_bsta_ = alloca_ibytes (1 + _bsta_3); \
|
|
|
1226 memcpy (*_bsta_, _bsta_2, 1 + _bsta_3); \
|
|
|
1227 } while (0)
|
|
|
1228
|
|
|
1229 /* ----------------- convenience functions for reallocation --------------- */
|
|
|
1230
|
|
|
1231 #define XREALLOC_ARRAY(ptr, type, len) \
|
|
|
1232 ((void) (ptr = (type *) xrealloc (ptr, (len) * sizeof (type))))
|
|
|
1233
|
|
793
|
1234 /* also generally useful if you want to avoid arbitrary size limits
|
|
|
1235 but don't need a full dynamic array. Assumes that BASEVAR points
|
|
|
1236 to a malloced array of TYPE objects (or possibly a NULL pointer,
|
|
|
1237 if SIZEVAR is 0), with the total size stored in SIZEVAR. This
|
|
|
1238 macro will realloc BASEVAR as necessary so that it can hold at
|
|
|
1239 least NEEDED_SIZE objects. The reallocing is done by doubling,
|
|
|
1240 which ensures constant amortized time per element. */
|
|
|
1241 #define DO_REALLOC(basevar, sizevar, needed_size, type) do { \
|
|
|
1242 Bytecount do_realloc_needed_size = (needed_size); \
|
|
1333
|
1243 REGEX_MALLOC_CHECK (); \
|
|
793
|
1244 if ((sizevar) < do_realloc_needed_size) \
|
|
|
1245 { \
|
|
|
1246 if ((sizevar) < 32) \
|
|
|
1247 (sizevar) = 32; \
|
|
|
1248 while ((sizevar) < do_realloc_needed_size) \
|
|
|
1249 (sizevar) *= 2; \
|
|
|
1250 XREALLOC_ARRAY (basevar, type, (sizevar)); \
|
|
|
1251 } \
|
|
|
1252 } while (0)
|
|
|
1253
|
|
|
1254 /* ------------------------ dynamic arrays ------------------- */
|
|
|
1255
|
|
3092
|
1256 #ifndef NEW_GC
|
|
1318
|
1257 #ifdef ERROR_CHECK_STRUCTURES
|
|
|
1258 #define Dynarr_declare(type) \
|
|
|
1259 type *base; \
|
|
|
1260 int locked; \
|
|
|
1261 int elsize; \
|
|
|
1262 int cur; \
|
|
|
1263 int largest; \
|
|
|
1264 int max
|
|
|
1265 #else
|
|
793
|
1266 #define Dynarr_declare(type) \
|
|
|
1267 type *base; \
|
|
|
1268 int elsize; \
|
|
|
1269 int cur; \
|
|
|
1270 int largest; \
|
|
|
1271 int max
|
|
1318
|
1272 #endif /* ERROR_CHECK_STRUCTURES */
|
|
793
|
1273
|
|
|
1274 typedef struct dynarr
|
|
|
1275 {
|
|
|
1276 Dynarr_declare (void);
|
|
|
1277 } Dynarr;
|
|
|
1278
|
|
1632
|
1279 MODULE_API void *Dynarr_newf (int elsize);
|
|
2367
|
1280 MODULE_API void Dynarr_resize (void *dy, Elemcount size);
|
|
1632
|
1281 MODULE_API void Dynarr_insert_many (void *d, const void *el, int len, int start);
|
|
|
1282 MODULE_API void Dynarr_delete_many (void *d, int start, int len);
|
|
|
1283 MODULE_API void Dynarr_free (void *d);
|
|
793
|
1284
|
|
|
1285 #define Dynarr_new(type) ((type##_dynarr *) Dynarr_newf (sizeof (type)))
|
|
|
1286 #define Dynarr_new2(dynarr_type, type) \
|
|
|
1287 ((dynarr_type *) Dynarr_newf (sizeof (type)))
|
|
|
1288 #define Dynarr_at(d, pos) ((d)->base[pos])
|
|
|
1289 #define Dynarr_atp(d, pos) (&Dynarr_at (d, pos))
|
|
|
1290 #define Dynarr_begin(d) Dynarr_atp (d, 0)
|
|
819
|
1291 #define Dynarr_end(d) Dynarr_atp (d, Dynarr_length (d) - 1)
|
|
793
|
1292 #define Dynarr_sizeof(d) ((d)->cur * (d)->elsize)
|
|
|
1293
|
|
800
|
1294 #ifdef ERROR_CHECK_STRUCTURES
|
|
793
|
1295 DECLARE_INLINE_HEADER (
|
|
|
1296 Dynarr *
|
|
2367
|
1297 Dynarr_verify_1 (void *d, const Ascbyte *file, int line)
|
|
793
|
1298 )
|
|
|
1299 {
|
|
|
1300 Dynarr *dy = (Dynarr *) d;
|
|
|
1301 assert_at_line (dy->cur >= 0 && dy->cur <= dy->largest &&
|
|
|
1302 dy->largest <= dy->max, file, line);
|
|
|
1303 return dy;
|
|
|
1304 }
|
|
|
1305
|
|
1318
|
1306 DECLARE_INLINE_HEADER (
|
|
|
1307 Dynarr *
|
|
2367
|
1308 Dynarr_verify_mod_1 (void *d, const Ascbyte *file, int line)
|
|
1318
|
1309 )
|
|
|
1310 {
|
|
|
1311 Dynarr *dy = (Dynarr *) d;
|
|
|
1312 assert_at_line (!dy->locked, file, line);
|
|
|
1313 assert_at_line (dy->cur >= 0 && dy->cur <= dy->largest &&
|
|
|
1314 dy->largest <= dy->max, file, line);
|
|
|
1315 return dy;
|
|
|
1316 }
|
|
|
1317
|
|
793
|
1318 #define Dynarr_verify(d) Dynarr_verify_1 (d, __FILE__, __LINE__)
|
|
1318
|
1319 #define Dynarr_verify_mod(d) Dynarr_verify_mod_1 (d, __FILE__, __LINE__)
|
|
|
1320 #define Dynarr_lock(d) (Dynarr_verify_mod (d)->locked = 1)
|
|
|
1321 #define Dynarr_unlock(d) ((d)->locked = 0)
|
|
793
|
1322 #else
|
|
|
1323 #define Dynarr_verify(d) (d)
|
|
1318
|
1324 #define Dynarr_verify_mod(d) (d)
|
|
|
1325 #define Dynarr_lock(d)
|
|
|
1326 #define Dynarr_unlock(d)
|
|
800
|
1327 #endif /* ERROR_CHECK_STRUCTURES */
|
|
793
|
1328
|
|
|
1329 #define Dynarr_length(d) (Dynarr_verify (d)->cur)
|
|
|
1330 #define Dynarr_largest(d) (Dynarr_verify (d)->largest)
|
|
1318
|
1331 #define Dynarr_reset(d) (Dynarr_verify_mod (d)->cur = 0)
|
|
793
|
1332 #define Dynarr_add_many(d, el, len) Dynarr_insert_many (d, el, len, (d)->cur)
|
|
|
1333 #define Dynarr_insert_many_at_start(d, el, len) \
|
|
|
1334 Dynarr_insert_many (d, el, len, 0)
|
|
|
1335 #define Dynarr_add_literal_string(d, s) Dynarr_add_many (d, s, sizeof (s) - 1)
|
|
1318
|
1336 #define Dynarr_add_lisp_string(d, s, codesys) \
|
|
|
1337 do { \
|
|
|
1338 Lisp_Object dyna_ls_s = (s); \
|
|
|
1339 Lisp_Object dyna_ls_cs = (codesys); \
|
|
|
1340 Extbyte *dyna_ls_eb; \
|
|
|
1341 Bytecount dyna_ls_bc; \
|
|
|
1342 \
|
|
|
1343 LISP_STRING_TO_SIZED_EXTERNAL (dyna_ls_s, dyna_ls_eb, \
|
|
|
1344 dyna_ls_bc, dyna_ls_cs); \
|
|
|
1345 Dynarr_add_many (d, dyna_ls_eb, dyna_ls_bc); \
|
|
793
|
1346 } while (0)
|
|
|
1347
|
|
1318
|
1348 #define Dynarr_add(d, el) ( \
|
|
|
1349 Dynarr_verify_mod (d)->cur >= (d)->max ? Dynarr_resize ((d), (d)->cur+1) : \
|
|
|
1350 (void) 0, \
|
|
|
1351 ((d)->base)[(d)->cur++] = (el), \
|
|
793
|
1352 (d)->cur > (d)->largest ? (d)->largest = (d)->cur : (int) 0)
|
|
|
1353
|
|
|
1354 /* The following defines will get you into real trouble if you aren't
|
|
|
1355 careful. But they can save a lot of execution time when used wisely. */
|
|
1318
|
1356 #define Dynarr_increment(d) (Dynarr_verify_mod (d)->cur++)
|
|
|
1357 #define Dynarr_set_size(d, n) (Dynarr_verify_mod (d)->cur = n)
|
|
|
1358
|
|
|
1359 #define Dynarr_pop(d) \
|
|
|
1360 (assert ((d)->cur > 0), Dynarr_verify_mod (d)->cur--, \
|
|
|
1361 Dynarr_at (d, (d)->cur))
|
|
|
1362 #define Dynarr_delete(d, i) Dynarr_delete_many (d, i, 1)
|
|
793
|
1363 #define Dynarr_delete_by_pointer(d, p) \
|
|
|
1364 Dynarr_delete_many (d, (p) - ((d)->base), 1)
|
|
|
1365
|
|
1318
|
1366 #define Dynarr_delete_object(d, el) \
|
|
|
1367 do \
|
|
|
1368 { \
|
|
|
1369 REGISTER int i; \
|
|
|
1370 for (i = Dynarr_length (d) - 1; i >= 0; i--) \
|
|
|
1371 { \
|
|
|
1372 if (el == Dynarr_at (d, i)) \
|
|
|
1373 Dynarr_delete_many (d, i, 1); \
|
|
|
1374 } \
|
|
996
|
1375 } while (0)
|
|
|
1376
|
|
793
|
1377 #ifdef MEMORY_USAGE_STATS
|
|
|
1378 struct overhead_stats;
|
|
|
1379 Bytecount Dynarr_memory_usage (void *d, struct overhead_stats *stats);
|
|
|
1380 #endif
|
|
428
|
1381
|
|
2367
|
1382 void *stack_like_malloc (Bytecount size);
|
|
|
1383 void stack_like_free (void *val);
|
|
3092
|
1384 #endif /* not NEW_GC */
|
|
2367
|
1385
|
|
|
1386 /************************************************************************/
|
|
|
1387 /** Definitions of more complex types **/
|
|
|
1388 /************************************************************************/
|
|
428
|
1389
|
|
647
|
1390 /* Note that the simplest typedefs are near the top of this file. */
|
|
|
1391
|
|
428
|
1392 /* We put typedefs here so that prototype declarations don't choke.
|
|
|
1393 Note that we don't actually declare the structures here (except
|
|
|
1394 maybe for simple structures like Dynarrs); that keeps them private
|
|
|
1395 to the routines that actually use them. */
|
|
|
1396
|
|
771
|
1397 /* ------------------------------- */
|
|
|
1398 /* Error_Behavior typedefs */
|
|
|
1399 /* ------------------------------- */
|
|
|
1400
|
|
800
|
1401 #ifndef ERROR_CHECK_TYPES
|
|
771
|
1402
|
|
|
1403 typedef enum error_behavior
|
|
428
|
1404 {
|
|
771
|
1405 ERROR_ME,
|
|
|
1406 ERROR_ME_NOT,
|
|
793
|
1407 ERROR_ME_WARN,
|
|
|
1408 ERROR_ME_DEBUG_WARN
|
|
771
|
1409 } Error_Behavior;
|
|
|
1410
|
|
|
1411 #define ERRB_EQ(a, b) ((a) == (b))
|
|
|
1412
|
|
|
1413 #else
|
|
|
1414
|
|
|
1415 /* By defining it like this, we provide strict type-checking
|
|
|
1416 for code that lazily uses ints. */
|
|
|
1417
|
|
|
1418 typedef struct _error_behavior_struct_
|
|
428
|
1419 {
|
|
771
|
1420 int really_unlikely_name_to_have_accidentally_in_a_non_errb_structure;
|
|
|
1421 } Error_Behavior;
|
|
|
1422
|
|
|
1423 extern Error_Behavior ERROR_ME;
|
|
|
1424 extern Error_Behavior ERROR_ME_NOT;
|
|
|
1425 extern Error_Behavior ERROR_ME_WARN;
|
|
793
|
1426 extern Error_Behavior ERROR_ME_DEBUG_WARN;
|
|
771
|
1427
|
|
|
1428 #define ERRB_EQ(a, b) \
|
|
|
1429 ((a).really_unlikely_name_to_have_accidentally_in_a_non_errb_structure == \
|
|
|
1430 (b).really_unlikely_name_to_have_accidentally_in_a_non_errb_structure)
|
|
|
1431
|
|
|
1432 #endif
|
|
|
1433
|
|
|
1434 /* ------------------------------- */
|
|
|
1435 /* Empty structures and typedefs */
|
|
|
1436 /* ------------------------------- */
|
|
428
|
1437
|
|
|
1438 struct buffer; /* "buffer.h" */
|
|
|
1439 struct console; /* "console.h" */
|
|
|
1440 struct device; /* "device.h" */
|
|
|
1441 struct extent_fragment;
|
|
|
1442 struct extent;
|
|
|
1443 struct frame; /* "frame.h" */
|
|
|
1444 struct window; /* "window.h" */
|
|
771
|
1445 struct utimbuf; /* "systime.h" or <utime.h> */
|
|
428
|
1446 struct display_line;
|
|
|
1447 struct display_glyph_area;
|
|
|
1448 struct display_box;
|
|
|
1449 struct redisplay_info;
|
|
|
1450 struct window_mirror;
|
|
|
1451 struct scrollbar_instance;
|
|
|
1452 struct font_metric_info;
|
|
|
1453 struct face_cachel;
|
|
|
1454 struct console_type_entry;
|
|
|
1455
|
|
771
|
1456 /* This is shared by process.h, events.h and others in future.
|
|
|
1457 See events.h for description */
|
|
|
1458 typedef unsigned int USID;
|
|
|
1459 typedef int face_index;
|
|
|
1460 typedef int glyph_index;
|
|
1726
|
1461 typedef struct lstream Lstream; /* lstream.h */
|
|
872
|
1462 typedef struct extent *EXTENT; /* extents-impl.h */
|
|
771
|
1463 typedef struct Lisp_Event Lisp_Event; /* "events.h" */
|
|
872
|
1464 typedef struct Lisp_Face Lisp_Face; /* "faces-impl.h" */
|
|
771
|
1465 typedef struct Lisp_Process Lisp_Process; /* "procimpl.h" */
|
|
872
|
1466 typedef struct Lisp_Color_Instance Lisp_Color_Instance; /* objects-impl.h */
|
|
|
1467 typedef struct Lisp_Font_Instance Lisp_Font_Instance; /* objects-impl.h */
|
|
1726
|
1468 typedef struct Lisp_Image_Instance Lisp_Image_Instance; /* glyphs.h */
|
|
771
|
1469 typedef struct Lisp_Gui_Item Lisp_Gui_Item;
|
|
|
1470
|
|
3092
|
1471 #ifndef NEW_GC
|
|
771
|
1472 /* ------------------------------- */
|
|
|
1473 /* Dynarr typedefs */
|
|
|
1474 /* ------------------------------- */
|
|
|
1475
|
|
|
1476 /* Dynarr typedefs -- basic types first */
|
|
|
1477
|
|
428
|
1478 typedef struct
|
|
|
1479 {
|
|
867
|
1480 Dynarr_declare (Ibyte);
|
|
|
1481 } Ibyte_dynarr;
|
|
428
|
1482
|
|
|
1483 typedef struct
|
|
|
1484 {
|
|
|
1485 Dynarr_declare (Extbyte);
|
|
|
1486 } Extbyte_dynarr;
|
|
|
1487
|
|
|
1488 typedef struct
|
|
|
1489 {
|
|
867
|
1490 Dynarr_declare (Ichar);
|
|
|
1491 } Ichar_dynarr;
|
|
428
|
1492
|
|
|
1493 typedef struct
|
|
|
1494 {
|
|
|
1495 Dynarr_declare (char);
|
|
|
1496 } char_dynarr;
|
|
|
1497
|
|
771
|
1498 typedef struct
|
|
|
1499 {
|
|
|
1500 Dynarr_declare (char *);
|
|
|
1501 } char_ptr_dynarr;
|
|
|
1502
|
|
428
|
1503 typedef unsigned char unsigned_char;
|
|
|
1504 typedef struct
|
|
|
1505 {
|
|
|
1506 Dynarr_declare (unsigned char);
|
|
|
1507 } unsigned_char_dynarr;
|
|
|
1508
|
|
|
1509 typedef unsigned long unsigned_long;
|
|
|
1510 typedef struct
|
|
|
1511 {
|
|
|
1512 Dynarr_declare (unsigned long);
|
|
|
1513 } unsigned_long_dynarr;
|
|
|
1514
|
|
|
1515 typedef struct
|
|
|
1516 {
|
|
|
1517 Dynarr_declare (int);
|
|
|
1518 } int_dynarr;
|
|
|
1519
|
|
|
1520 typedef struct
|
|
|
1521 {
|
|
665
|
1522 Dynarr_declare (Charbpos);
|
|
|
1523 } Charbpos_dynarr;
|
|
428
|
1524
|
|
|
1525 typedef struct
|
|
|
1526 {
|
|
665
|
1527 Dynarr_declare (Bytebpos);
|
|
|
1528 } Bytebpos_dynarr;
|
|
428
|
1529
|
|
|
1530 typedef struct
|
|
|
1531 {
|
|
|
1532 Dynarr_declare (Charcount);
|
|
|
1533 } Charcount_dynarr;
|
|
|
1534
|
|
|
1535 typedef struct
|
|
|
1536 {
|
|
|
1537 Dynarr_declare (Bytecount);
|
|
|
1538 } Bytecount_dynarr;
|
|
|
1539
|
|
771
|
1540 /* Dynarr typedefs -- more complex types */
|
|
|
1541
|
|
|
1542 typedef struct
|
|
|
1543 {
|
|
|
1544 Dynarr_declare (struct face_cachel);
|
|
|
1545 } face_cachel_dynarr;
|
|
|
1546
|
|
|
1547 typedef struct
|
|
|
1548 {
|
|
|
1549 Dynarr_declare (struct glyph_cachel);
|
|
|
1550 } glyph_cachel_dynarr;
|
|
|
1551
|
|
428
|
1552 typedef struct
|
|
|
1553 {
|
|
|
1554 Dynarr_declare (struct console_type_entry);
|
|
|
1555 } console_type_entry_dynarr;
|
|
3092
|
1556 #endif /* not NEW_GC */
|
|
428
|
1557
|
|
771
|
1558 /* ------------------------------- */
|
|
|
1559 /* enum typedefs */
|
|
|
1560 /* ------------------------------- */
|
|
|
1561
|
|
428
|
1562 enum run_hooks_condition
|
|
|
1563 {
|
|
|
1564 RUN_HOOKS_TO_COMPLETION,
|
|
|
1565 RUN_HOOKS_UNTIL_SUCCESS,
|
|
|
1566 RUN_HOOKS_UNTIL_FAILURE
|
|
|
1567 };
|
|
|
1568
|
|
|
1569 #ifdef HAVE_TOOLBARS
|
|
|
1570 enum toolbar_pos
|
|
|
1571 {
|
|
|
1572 TOP_TOOLBAR,
|
|
|
1573 BOTTOM_TOOLBAR,
|
|
|
1574 LEFT_TOOLBAR,
|
|
|
1575 RIGHT_TOOLBAR
|
|
|
1576 };
|
|
|
1577 #endif
|
|
|
1578
|
|
|
1579 enum edge_style
|
|
|
1580 {
|
|
|
1581 EDGE_ETCHED_IN,
|
|
|
1582 EDGE_ETCHED_OUT,
|
|
|
1583 EDGE_BEVEL_IN,
|
|
|
1584 EDGE_BEVEL_OUT
|
|
|
1585 };
|
|
|
1586
|
|
|
1587 enum munge_me_out_the_door
|
|
|
1588 {
|
|
|
1589 MUNGE_ME_FUNCTION_KEY,
|
|
|
1590 MUNGE_ME_KEY_TRANSLATION
|
|
|
1591 };
|
|
|
1592
|
|
771
|
1593 /* ------------------------------- */
|
|
|
1594 /* misc */
|
|
|
1595 /* ------------------------------- */
|
|
|
1596
|
|
|
1597 #ifdef MEMORY_USAGE_STATS
|
|
|
1598
|
|
|
1599 /* This structure is used to keep statistics on the amount of memory
|
|
|
1600 in use.
|
|
|
1601
|
|
|
1602 WAS_REQUESTED stores the actual amount of memory that was requested
|
|
|
1603 of the allocation function. The *_OVERHEAD fields store the
|
|
|
1604 additional amount of memory that was grabbed by the functions to
|
|
|
1605 facilitate allocation, reallocation, etc. MALLOC_OVERHEAD is for
|
|
|
1606 memory allocated with malloc(); DYNARR_OVERHEAD is for dynamic
|
|
|
1607 arrays; GAP_OVERHEAD is for gap arrays. Note that for (e.g.)
|
|
|
1608 dynamic arrays, there is both MALLOC_OVERHEAD and DYNARR_OVERHEAD
|
|
|
1609 memory: The dynamic array allocates memory above and beyond what
|
|
|
1610 was asked of it, and when it in turns allocates memory using
|
|
|
1611 malloc(), malloc() allocates memory beyond what it was asked
|
|
|
1612 to allocate.
|
|
|
1613
|
|
|
1614 Functions that accept a structure of this sort do not initialize
|
|
|
1615 the fields to 0, and add any existing values to whatever was there
|
|
|
1616 before; this way, you can get a cumulative effect. */
|
|
|
1617
|
|
|
1618 struct overhead_stats
|
|
|
1619 {
|
|
|
1620 int was_requested;
|
|
|
1621 int malloc_overhead;
|
|
|
1622 int dynarr_overhead;
|
|
|
1623 int gap_overhead;
|
|
|
1624 };
|
|
|
1625
|
|
|
1626 #endif /* MEMORY_USAGE_STATS */
|
|
|
1627
|
|
428
|
1628
|
|
|
1629 /************************************************************************/
|
|
|
1630 /* Definition of Lisp_Object data type */
|
|
|
1631 /************************************************************************/
|
|
|
1632
|
|
|
1633 /* Define the fundamental Lisp data structures */
|
|
|
1634
|
|
|
1635 /* This is the set of Lisp data types */
|
|
|
1636
|
|
|
1637 enum Lisp_Type
|
|
|
1638 {
|
|
|
1639 Lisp_Type_Record,
|
|
|
1640 Lisp_Type_Int_Even,
|
|
|
1641 Lisp_Type_Char,
|
|
|
1642 Lisp_Type_Int_Odd
|
|
|
1643 };
|
|
|
1644
|
|
|
1645 #define POINTER_TYPE_P(type) ((type) == Lisp_Type_Record)
|
|
|
1646
|
|
|
1647 /* Overridden by m/next.h */
|
|
|
1648 #ifndef ASSERT_VALID_POINTER
|
|
|
1649 # define ASSERT_VALID_POINTER(pnt) (assert ((((EMACS_UINT) pnt) & 3) == 0))
|
|
|
1650 #endif
|
|
|
1651
|
|
|
1652 #define GCMARKBITS 0
|
|
|
1653 #define GCTYPEBITS 2
|
|
|
1654 #define GCBITS 2
|
|
|
1655 #define INT_GCBITS 1
|
|
|
1656
|
|
|
1657 #define INT_VALBITS (BITS_PER_EMACS_INT - INT_GCBITS)
|
|
|
1658 #define VALBITS (BITS_PER_EMACS_INT - GCBITS)
|
|
542
|
1659 #define EMACS_INT_MAX ((EMACS_INT) ((1UL << (INT_VALBITS - 1)) -1UL))
|
|
442
|
1660 #define EMACS_INT_MIN (-(EMACS_INT_MAX) - 1)
|
|
802
|
1661 /* WARNING: evaluates its arg twice. */
|
|
|
1662 #define NUMBER_FITS_IN_AN_EMACS_INT(num) \
|
|
|
1663 ((num) <= EMACS_INT_MAX && (num) >= EMACS_INT_MIN)
|
|
428
|
1664
|
|
|
1665 #ifdef USE_UNION_TYPE
|
|
|
1666 # include "lisp-union.h"
|
|
|
1667 #else /* !USE_UNION_TYPE */
|
|
|
1668 # include "lisp-disunion.h"
|
|
|
1669 #endif /* !USE_UNION_TYPE */
|
|
|
1670
|
|
|
1671 #define XPNTR(x) ((void *) XPNTRVAL(x))
|
|
|
1672
|
|
3092
|
1673 #ifndef NEW_GC
|
|
428
|
1674 /* WARNING WARNING WARNING. You must ensure on your own that proper
|
|
|
1675 GC protection is provided for the elements in this array. */
|
|
|
1676 typedef struct
|
|
|
1677 {
|
|
|
1678 Dynarr_declare (Lisp_Object);
|
|
|
1679 } Lisp_Object_dynarr;
|
|
|
1680
|
|
452
|
1681 typedef struct
|
|
|
1682 {
|
|
|
1683 Dynarr_declare (Lisp_Object *);
|
|
|
1684 } Lisp_Object_ptr_dynarr;
|
|
3092
|
1685 #endif /* not NEW_GC */
|
|
452
|
1686
|
|
428
|
1687 /* Close your eyes now lest you vomit or spontaneously combust ... */
|
|
|
1688
|
|
|
1689 #define HACKEQ_UNSAFE(obj1, obj2) \
|
|
|
1690 (EQ (obj1, obj2) || (!POINTER_TYPE_P (XTYPE (obj1)) \
|
|
|
1691 && !POINTER_TYPE_P (XTYPE (obj2)) \
|
|
|
1692 && XCHAR_OR_INT (obj1) == XCHAR_OR_INT (obj2)))
|
|
|
1693
|
|
|
1694 #ifdef DEBUG_XEMACS
|
|
1632
|
1695 extern MODULE_API int debug_issue_ebola_notices;
|
|
|
1696 MODULE_API int eq_with_ebola_notice (Lisp_Object, Lisp_Object);
|
|
428
|
1697 #define EQ_WITH_EBOLA_NOTICE(obj1, obj2) \
|
|
|
1698 (debug_issue_ebola_notices ? eq_with_ebola_notice (obj1, obj2) \
|
|
|
1699 : EQ (obj1, obj2))
|
|
|
1700 #else
|
|
|
1701 #define EQ_WITH_EBOLA_NOTICE(obj1, obj2) EQ (obj1, obj2)
|
|
|
1702 #endif
|
|
|
1703
|
|
|
1704 /* OK, you can open them again */
|
|
|
1705
|
|
1743
|
1706 END_C_DECLS
|
|
1650
|
1707
|
|
428
|
1708 /************************************************************************/
|
|
442
|
1709 /** Definitions of basic Lisp objects **/
|
|
428
|
1710 /************************************************************************/
|
|
|
1711
|
|
|
1712 #include "lrecord.h"
|
|
|
1713
|
|
1743
|
1714 BEGIN_C_DECLS
|
|
1650
|
1715
|
|
3092
|
1716 #ifdef NEW_GC
|
|
|
1717 /* ------------------------ dynamic arrays ------------------- */
|
|
|
1718
|
|
|
1719 #ifdef ERROR_CHECK_STRUCTURES
|
|
|
1720 #define Dynarr_declare(type) \
|
|
|
1721 struct lrecord_header header; \
|
|
|
1722 type *base; \
|
|
|
1723 const struct lrecord_implementation *lisp_imp; \
|
|
|
1724 int locked; \
|
|
|
1725 int elsize; \
|
|
|
1726 int cur; \
|
|
|
1727 int largest; \
|
|
|
1728 int max
|
|
|
1729 #else
|
|
|
1730 #define Dynarr_declare(type) \
|
|
|
1731 struct lrecord_header header; \
|
|
|
1732 type *base; \
|
|
|
1733 const struct lrecord_implementation *lisp_imp; \
|
|
|
1734 int elsize; \
|
|
|
1735 int cur; \
|
|
|
1736 int largest; \
|
|
|
1737 int max
|
|
|
1738 #endif /* ERROR_CHECK_STRUCTURES */
|
|
|
1739
|
|
|
1740 typedef struct dynarr
|
|
|
1741 {
|
|
|
1742 Dynarr_declare (void);
|
|
|
1743 } Dynarr;
|
|
|
1744
|
|
|
1745 MODULE_API void *Dynarr_newf (int elsize);
|
|
|
1746 MODULE_API void Dynarr_resize (void *dy, Elemcount size);
|
|
|
1747 MODULE_API void Dynarr_insert_many (void *d, const void *el, int len, int start);
|
|
|
1748 MODULE_API void Dynarr_delete_many (void *d, int start, int len);
|
|
|
1749 MODULE_API void Dynarr_free (void *d);
|
|
|
1750
|
|
|
1751 MODULE_API void *Dynarr_lisp_newf (int elsize,
|
|
|
1752 const struct lrecord_implementation
|
|
|
1753 *dynarr_imp,
|
|
|
1754 const struct lrecord_implementation *imp);
|
|
|
1755
|
|
|
1756 #define Dynarr_lisp_new(type, dynarr_imp, imp) \
|
|
|
1757 ((type##_dynarr *) Dynarr_lisp_newf (sizeof (type), dynarr_imp, imp))
|
|
|
1758 #define Dynarr_lisp_new2(dynarr_type, type, dynarr_imp, imp) \
|
|
|
1759 ((dynarr_type *) Dynarr_lisp_newf (sizeof (type)), dynarr_imp, imp)
|
|
|
1760 #define Dynarr_new(type) ((type##_dynarr *) Dynarr_newf (sizeof (type)))
|
|
|
1761 #define Dynarr_new2(dynarr_type, type) \
|
|
|
1762 ((dynarr_type *) Dynarr_newf (sizeof (type)))
|
|
|
1763 #define Dynarr_at(d, pos) ((d)->base[pos])
|
|
|
1764 #define Dynarr_atp(d, pos) (&Dynarr_at (d, pos))
|
|
|
1765 #define Dynarr_begin(d) Dynarr_atp (d, 0)
|
|
|
1766 #define Dynarr_end(d) Dynarr_atp (d, Dynarr_length (d) - 1)
|
|
|
1767 #define Dynarr_sizeof(d) ((d)->cur * (d)->elsize)
|
|
|
1768
|
|
|
1769 #ifdef ERROR_CHECK_STRUCTURES
|
|
|
1770 DECLARE_INLINE_HEADER (
|
|
|
1771 Dynarr *
|
|
|
1772 Dynarr_verify_1 (void *d, const Ascbyte *file, int line)
|
|
|
1773 )
|
|
|
1774 {
|
|
|
1775 Dynarr *dy = (Dynarr *) d;
|
|
|
1776 assert_at_line (dy->cur >= 0 && dy->cur <= dy->largest &&
|
|
|
1777 dy->largest <= dy->max, file, line);
|
|
|
1778 return dy;
|
|
|
1779 }
|
|
|
1780
|
|
|
1781 DECLARE_INLINE_HEADER (
|
|
|
1782 Dynarr *
|
|
|
1783 Dynarr_verify_mod_1 (void *d, const Ascbyte *file, int line)
|
|
|
1784 )
|
|
|
1785 {
|
|
|
1786 Dynarr *dy = (Dynarr *) d;
|
|
|
1787 assert_at_line (!dy->locked, file, line);
|
|
|
1788 assert_at_line (dy->cur >= 0 && dy->cur <= dy->largest &&
|
|
|
1789 dy->largest <= dy->max, file, line);
|
|
|
1790 return dy;
|
|
|
1791 }
|
|
|
1792
|
|
|
1793 #define Dynarr_verify(d) Dynarr_verify_1 (d, __FILE__, __LINE__)
|
|
|
1794 #define Dynarr_verify_mod(d) Dynarr_verify_mod_1 (d, __FILE__, __LINE__)
|
|
|
1795 #define Dynarr_lock(d) (Dynarr_verify_mod (d)->locked = 1)
|
|
|
1796 #define Dynarr_unlock(d) ((d)->locked = 0)
|
|
|
1797 #else
|
|
|
1798 #define Dynarr_verify(d) (d)
|
|
|
1799 #define Dynarr_verify_mod(d) (d)
|
|
|
1800 #define Dynarr_lock(d)
|
|
|
1801 #define Dynarr_unlock(d)
|
|
|
1802 #endif /* ERROR_CHECK_STRUCTURES */
|
|
|
1803
|
|
|
1804 #define Dynarr_length(d) (Dynarr_verify (d)->cur)
|
|
|
1805 #define Dynarr_largest(d) (Dynarr_verify (d)->largest)
|
|
|
1806 #define Dynarr_reset(d) (Dynarr_verify_mod (d)->cur = 0)
|
|
|
1807 #define Dynarr_add_many(d, el, len) Dynarr_insert_many (d, el, len, (d)->cur)
|
|
|
1808 #define Dynarr_insert_many_at_start(d, el, len) \
|
|
|
1809 Dynarr_insert_many (d, el, len, 0)
|
|
|
1810 #define Dynarr_add_literal_string(d, s) Dynarr_add_many (d, s, sizeof (s) - 1)
|
|
|
1811 #define Dynarr_add_lisp_string(d, s, codesys) \
|
|
|
1812 do { \
|
|
|
1813 Lisp_Object dyna_ls_s = (s); \
|
|
|
1814 Lisp_Object dyna_ls_cs = (codesys); \
|
|
|
1815 Extbyte *dyna_ls_eb; \
|
|
|
1816 Bytecount dyna_ls_bc; \
|
|
|
1817 \
|
|
|
1818 LISP_STRING_TO_SIZED_EXTERNAL (dyna_ls_s, dyna_ls_eb, \
|
|
|
1819 dyna_ls_bc, dyna_ls_cs); \
|
|
|
1820 Dynarr_add_many (d, dyna_ls_eb, dyna_ls_bc); \
|
|
|
1821 } while (0)
|
|
|
1822
|
|
|
1823 #if 1
|
|
|
1824 #define Dynarr_add(d, el) \
|
|
|
1825 do { \
|
|
|
1826 if (Dynarr_verify_mod (d)->cur >= (d)->max) \
|
|
|
1827 Dynarr_resize ((d), (d)->cur+1); \
|
|
|
1828 ((d)->base)[(d)->cur] = (el); \
|
|
|
1829 \
|
|
|
1830 if ((d)->lisp_imp) \
|
|
|
1831 set_lheader_implementation \
|
|
|
1832 ((struct lrecord_header *)&(((d)->base)[(d)->cur]), \
|
|
|
1833 (d)->lisp_imp); \
|
|
|
1834 \
|
|
|
1835 (d)->cur++; \
|
|
|
1836 if ((d)->cur > (d)->largest) \
|
|
|
1837 (d)->largest = (d)->cur; \
|
|
|
1838 } while (0)
|
|
|
1839 #else
|
|
|
1840 #define Dynarr_add(d, el) ( \
|
|
|
1841 Dynarr_verify_mod (d)->cur >= (d)->max ? Dynarr_resize ((d), (d)->cur+1) : \
|
|
|
1842 (void) 0, \
|
|
|
1843 ((d)->base)[(d)->cur++] = (el), \
|
|
|
1844 (d)->cur > (d)->largest ? (d)->largest = (d)->cur : (int) 0)
|
|
|
1845 #endif
|
|
|
1846
|
|
|
1847
|
|
|
1848 /* The following defines will get you into real trouble if you aren't
|
|
|
1849 careful. But they can save a lot of execution time when used wisely. */
|
|
|
1850 #define Dynarr_increment(d) (Dynarr_verify_mod (d)->cur++)
|
|
|
1851 #define Dynarr_set_size(d, n) (Dynarr_verify_mod (d)->cur = n)
|
|
|
1852
|
|
|
1853 #define Dynarr_pop(d) \
|
|
|
1854 (assert ((d)->cur > 0), Dynarr_verify_mod (d)->cur--, \
|
|
|
1855 Dynarr_at (d, (d)->cur))
|
|
|
1856 #define Dynarr_delete(d, i) Dynarr_delete_many (d, i, 1)
|
|
|
1857 #define Dynarr_delete_by_pointer(d, p) \
|
|
|
1858 Dynarr_delete_many (d, (p) - ((d)->base), 1)
|
|
|
1859
|
|
|
1860 #define Dynarr_delete_object(d, el) \
|
|
|
1861 do \
|
|
|
1862 { \
|
|
|
1863 REGISTER int i; \
|
|
|
1864 for (i = Dynarr_length (d) - 1; i >= 0; i--) \
|
|
|
1865 { \
|
|
|
1866 if (el == Dynarr_at (d, i)) \
|
|
|
1867 Dynarr_delete_many (d, i, 1); \
|
|
|
1868 } \
|
|
|
1869 } while (0)
|
|
|
1870
|
|
|
1871 #ifdef MEMORY_USAGE_STATS
|
|
|
1872 struct overhead_stats;
|
|
|
1873 Bytecount Dynarr_memory_usage (void *d, struct overhead_stats *stats);
|
|
|
1874 #endif
|
|
|
1875
|
|
|
1876 void *stack_like_malloc (Bytecount size);
|
|
|
1877 void stack_like_free (void *val);
|
|
|
1878
|
|
|
1879 /* ------------------------------- */
|
|
|
1880 /* Dynarr typedefs */
|
|
|
1881 /* ------------------------------- */
|
|
|
1882
|
|
|
1883 /* Dynarr typedefs -- basic types first */
|
|
|
1884
|
|
|
1885 typedef struct
|
|
|
1886 {
|
|
|
1887 Dynarr_declare (Ibyte);
|
|
|
1888 } Ibyte_dynarr;
|
|
|
1889
|
|
|
1890 typedef struct
|
|
|
1891 {
|
|
|
1892 Dynarr_declare (Extbyte);
|
|
|
1893 } Extbyte_dynarr;
|
|
|
1894
|
|
|
1895 typedef struct
|
|
|
1896 {
|
|
|
1897 Dynarr_declare (Ichar);
|
|
|
1898 } Ichar_dynarr;
|
|
|
1899
|
|
|
1900 typedef struct
|
|
|
1901 {
|
|
|
1902 Dynarr_declare (char);
|
|
|
1903 } char_dynarr;
|
|
|
1904
|
|
|
1905 typedef struct
|
|
|
1906 {
|
|
|
1907 Dynarr_declare (char *);
|
|
|
1908 } char_ptr_dynarr;
|
|
|
1909
|
|
|
1910 typedef unsigned char unsigned_char;
|
|
|
1911 typedef struct
|
|
|
1912 {
|
|
|
1913 Dynarr_declare (unsigned char);
|
|
|
1914 } unsigned_char_dynarr;
|
|
|
1915
|
|
|
1916 typedef unsigned long unsigned_long;
|
|
|
1917 typedef struct
|
|
|
1918 {
|
|
|
1919 Dynarr_declare (unsigned long);
|
|
|
1920 } unsigned_long_dynarr;
|
|
|
1921
|
|
|
1922 typedef struct
|
|
|
1923 {
|
|
|
1924 Dynarr_declare (int);
|
|
|
1925 } int_dynarr;
|
|
|
1926
|
|
|
1927 typedef struct
|
|
|
1928 {
|
|
|
1929 Dynarr_declare (Charbpos);
|
|
|
1930 } Charbpos_dynarr;
|
|
|
1931
|
|
|
1932 typedef struct
|
|
|
1933 {
|
|
|
1934 Dynarr_declare (Bytebpos);
|
|
|
1935 } Bytebpos_dynarr;
|
|
|
1936
|
|
|
1937 typedef struct
|
|
|
1938 {
|
|
|
1939 Dynarr_declare (Charcount);
|
|
|
1940 } Charcount_dynarr;
|
|
|
1941
|
|
|
1942 typedef struct
|
|
|
1943 {
|
|
|
1944 Dynarr_declare (Bytecount);
|
|
|
1945 } Bytecount_dynarr;
|
|
|
1946
|
|
|
1947 /* Dynarr typedefs -- more complex types */
|
|
|
1948
|
|
|
1949 typedef struct
|
|
|
1950 {
|
|
|
1951 Dynarr_declare (struct face_cachel);
|
|
|
1952 } face_cachel_dynarr;
|
|
|
1953
|
|
|
1954 DECLARE_LRECORD (face_cachel_dynarr, face_cachel_dynarr);
|
|
|
1955 #define XFACE_CACHEL_DYNARR(x) \
|
|
|
1956 XRECORD (x, face_cachel_dynarr, face_cachel_dynarr)
|
|
|
1957 #define wrap_face_cachel_dynarr(p) wrap_record (p, face_cachel_dynarr)
|
|
|
1958 #define FACE_CACHEL_DYNARRP(x) RECORDP (x, face_cachel_dynarr)
|
|
|
1959 #define CHECK_FACE_CACHEL_DYNARR(x) CHECK_RECORD (x, face_cachel_dynarr)
|
|
|
1960 #define CONCHECK_FACE_CACHEL_DYNARR(x) CONCHECK_RECORD (x, face_cachel_dynarr)
|
|
|
1961
|
|
|
1962 typedef struct
|
|
|
1963 {
|
|
|
1964 Dynarr_declare (struct glyph_cachel);
|
|
|
1965 } glyph_cachel_dynarr;
|
|
|
1966
|
|
|
1967 DECLARE_LRECORD (glyph_cachel_dynarr, glyph_cachel_dynarr);
|
|
|
1968 #define XGLYPH_CACHEL_DYNARR(x) \
|
|
|
1969 XRECORD (x, glyph_cachel_dynarr, glyph_cachel_dynarr)
|
|
|
1970 #define wrap_glyph_cachel_dynarr(p) wrap_record (p, glyph_cachel_dynarr)
|
|
|
1971 #define GLYPH_CACHEL_DYNARRP(x) RECORDP (x, glyph_cachel_dynarr)
|
|
|
1972 #define CHECK_GLYPH_CACHEL_DYNARR(x) CHECK_RECORD (x, glyph_cachel_dynarr)
|
|
|
1973 #define CONCHECK_GLYPH_CACHEL_DYNARR(x) \
|
|
|
1974 CONCHECK_RECORD (x, glyph_cachel_dynarr)
|
|
|
1975
|
|
|
1976 typedef struct
|
|
|
1977 {
|
|
|
1978 Dynarr_declare (struct console_type_entry);
|
|
|
1979 } console_type_entry_dynarr;
|
|
|
1980
|
|
|
1981 /* WARNING WARNING WARNING. You must ensure on your own that proper
|
|
|
1982 GC protection is provided for the elements in this array. */
|
|
|
1983 typedef struct
|
|
|
1984 {
|
|
|
1985 Dynarr_declare (Lisp_Object);
|
|
|
1986 } Lisp_Object_dynarr;
|
|
|
1987
|
|
|
1988 typedef struct
|
|
|
1989 {
|
|
|
1990 Dynarr_declare (Lisp_Object *);
|
|
|
1991 } Lisp_Object_ptr_dynarr;
|
|
|
1992 #endif /* NEW_GC */
|
|
|
1993
|
|
442
|
1994 /*------------------------------ unbound -------------------------------*/
|
|
428
|
1995
|
|
|
1996 /* Qunbound is a special Lisp_Object (actually of type
|
|
|
1997 symbol-value-forward), that can never be visible to
|
|
|
1998 the Lisp caller and thus can be used in the C code
|
|
|
1999 to mean "no such value". */
|
|
|
2000
|
|
|
2001 #define UNBOUNDP(val) EQ (val, Qunbound)
|
|
|
2002
|
|
771
|
2003 /* Evaluate expr, return it if it's not Qunbound. */
|
|
|
2004 #define RETURN_IF_NOT_UNBOUND(expr) do \
|
|
|
2005 { \
|
|
|
2006 Lisp_Object ret_nunb_val = (expr); \
|
|
|
2007 if (!UNBOUNDP (ret_nunb_val)) \
|
|
|
2008 RETURN_SANS_WARNINGS ret_nunb_val; \
|
|
|
2009 } while (0)
|
|
|
2010
|
|
442
|
2011 /*------------------------------- cons ---------------------------------*/
|
|
428
|
2012
|
|
|
2013 /* In a cons, the markbit of the car is the gc mark bit */
|
|
|
2014
|
|
|
2015 struct Lisp_Cons
|
|
|
2016 {
|
|
|
2017 struct lrecord_header lheader;
|
|
853
|
2018 Lisp_Object car_, cdr_;
|
|
428
|
2019 };
|
|
|
2020 typedef struct Lisp_Cons Lisp_Cons;
|
|
|
2021
|
|
|
2022 #if 0 /* FSFmacs */
|
|
|
2023 /* Like a cons, but records info on where the text lives that it was read from */
|
|
|
2024 /* This is not really in use now */
|
|
|
2025
|
|
|
2026 struct Lisp_Buffer_Cons
|
|
|
2027 {
|
|
|
2028 Lisp_Object car, cdr;
|
|
|
2029 struct buffer *buffer;
|
|
665
|
2030 int charbpos;
|
|
428
|
2031 };
|
|
|
2032 #endif
|
|
|
2033
|
|
1632
|
2034 DECLARE_MODULE_API_LRECORD (cons, Lisp_Cons);
|
|
428
|
2035 #define XCONS(x) XRECORD (x, cons, Lisp_Cons)
|
|
617
|
2036 #define wrap_cons(p) wrap_record (p, cons)
|
|
428
|
2037 #define CONSP(x) RECORDP (x, cons)
|
|
|
2038 #define CHECK_CONS(x) CHECK_RECORD (x, cons)
|
|
|
2039 #define CONCHECK_CONS(x) CONCHECK_RECORD (x, cons)
|
|
|
2040
|
|
2720
|
2041 #ifdef MC_ALLOC
|
|
|
2042 #define CONS_MARKED_P(c) MARKED_P (&((c)->lheader))
|
|
|
2043 #define MARK_CONS(c) MARK (&((c)->lheader))
|
|
|
2044 #else /* not MC_ALLOC */
|
|
428
|
2045 #define CONS_MARKED_P(c) MARKED_RECORD_HEADER_P(&((c)->lheader))
|
|
|
2046 #define MARK_CONS(c) MARK_RECORD_HEADER (&((c)->lheader))
|
|
2720
|
2047 #endif /* not MC_ALLOC */
|
|
428
|
2048
|
|
1632
|
2049 extern MODULE_API Lisp_Object Qnil;
|
|
428
|
2050
|
|
|
2051 #define NILP(x) EQ (x, Qnil)
|
|
853
|
2052 #define cons_car(a) ((a)->car_)
|
|
|
2053 #define cons_cdr(a) ((a)->cdr_)
|
|
|
2054 #define XCAR(a) (XCONS (a)->car_)
|
|
|
2055 #define XCDR(a) (XCONS (a)->cdr_)
|
|
1318
|
2056 #define XCADR(a) (XCAR (XCDR (a)))
|
|
|
2057 #define XCDDR(a) (XCDR (XCDR (a)))
|
|
|
2058 #define XCADDR(a) (XCAR (XCDDR (a)))
|
|
|
2059 #define XCDDDR(a) (XCDR (XCDDR (a)))
|
|
|
2060 #define XCADDDR(a) (XCAR (XCDDDR (a)))
|
|
|
2061 #define XCDDDDR(a) (XCDR (XCDDDR (a)))
|
|
|
2062 #define XCADDDDR(a) (XCAR (XCDDDDR (a)))
|
|
|
2063 #define XCDDDDDR(a) (XCDR (XCDDDDR (a)))
|
|
|
2064 #define XCADDDDDR(a) (XCAR (XCDDDDDR (a)))
|
|
|
2065 #define XCDDDDDDR(a) (XCDR (XCDDDDDR (a)))
|
|
|
2066 #define X1ST(a) XCAR (a)
|
|
|
2067 #define X2ND(a) XCADR (a)
|
|
|
2068 #define X3RD(a) XCADDR (a)
|
|
|
2069 #define X4TH(a) XCADDDR (a)
|
|
|
2070 #define X5TH(a) XCADDDDR (a)
|
|
|
2071 #define X6TH(a) XCADDDDDR (a)
|
|
|
2072
|
|
853
|
2073 #define XSETCAR(a, b) (XCONS (a)->car_ = (b))
|
|
|
2074 #define XSETCDR(a, b) (XCONS (a)->cdr_ = (b))
|
|
428
|
2075 #define LISTP(x) (CONSP(x) || NILP(x))
|
|
|
2076
|
|
|
2077 #define CHECK_LIST(x) do { \
|
|
|
2078 if (!LISTP (x)) \
|
|
|
2079 dead_wrong_type_argument (Qlistp, x); \
|
|
|
2080 } while (0)
|
|
|
2081
|
|
|
2082 #define CONCHECK_LIST(x) do { \
|
|
|
2083 if (!LISTP (x)) \
|
|
|
2084 x = wrong_type_argument (Qlistp, x); \
|
|
|
2085 } while (0)
|
|
|
2086
|
|
442
|
2087 /*---------------------- list traversal macros -------------------------*/
|
|
|
2088
|
|
|
2089 /* Note: These macros are for traversing through a list in some format,
|
|
|
2090 and executing code that you specify on each member of the list.
|
|
|
2091
|
|
|
2092 There are two kinds of macros, those requiring surrounding braces, and
|
|
|
2093 those not requiring this. Which type of macro will be indicated.
|
|
|
2094 The general format for using a brace-requiring macro is
|
|
|
2095
|
|
|
2096 {
|
|
|
2097 LIST_LOOP_3 (elt, list, tail)
|
|
|
2098 execute_code_here;
|
|
|
2099 }
|
|
|
2100
|
|
|
2101 or
|
|
|
2102
|
|
|
2103 {
|
|
|
2104 LIST_LOOP_3 (elt, list, tail)
|
|
|
2105 {
|
|
|
2106 execute_code_here;
|
|
|
2107 }
|
|
|
2108 }
|
|
|
2109
|
|
|
2110 You can put variable declarations between the brace and beginning of
|
|
|
2111 macro, but NOTHING ELSE.
|
|
|
2112
|
|
|
2113 The brace-requiring macros typically declare themselves any arguments
|
|
|
2114 that are initialized and iterated by the macros. If for some reason
|
|
|
2115 you need to declare these arguments yourself (e.g. to do something on
|
|
|
2116 them before the iteration starts, use the _NO_DECLARE versions of the
|
|
|
2117 macros.)
|
|
|
2118 */
|
|
|
2119
|
|
|
2120 /* There are two basic kinds of macros: those that handle "internal" lists
|
|
|
2121 that are known to be correctly structured (i.e. first element is a cons
|
|
|
2122 or nil, and the car of each cons is also a cons or nil, and there are
|
|
|
2123 no circularities), and those that handle "external" lists, where the
|
|
|
2124 list may have any sort of invalid formation. This is reflected in
|
|
|
2125 the names: those with "EXTERNAL_" work with external lists, and those
|
|
|
2126 without this prefix work with internal lists. The internal-list
|
|
|
2127 macros will hit an assertion failure if the structure is ill-formed;
|
|
|
2128 the external-list macros will signal an error in this case, either a
|
|
|
2129 malformed-list error or a circular-list error.
|
|
|
2130 */
|
|
|
2131
|
|
2367
|
2132 /* LIST_LOOP is a simple, old-fashioned macro. It doesn't require brace
|
|
|
2133 surrounding, and iterates through a list, which may or may not known to
|
|
|
2134 be syntactically correct. It accepts two args, TAIL (set progressively
|
|
|
2135 to each cons starting with the first), and LIST, the list to iterate
|
|
|
2136 over. TAIL needs to be defined by the caller.
|
|
442
|
2137
|
|
|
2138 In each iteration, you can retrieve the current list item using XCAR
|
|
|
2139 (tail), or destructively modify the list using XSETCAR (tail,
|
|
|
2140 ...). */
|
|
|
2141
|
|
428
|
2142 #define LIST_LOOP(tail, list) \
|
|
|
2143 for (tail = list; \
|
|
|
2144 !NILP (tail); \
|
|
|
2145 tail = XCDR (tail))
|
|
|
2146
|
|
442
|
2147 /* The following macros are the "core" macros for list traversal.
|
|
|
2148
|
|
|
2149 *** ALL OF THESE MACROS MUST BE DECLARED INSIDE BRACES -- SEE ABOVE. ***
|
|
|
2150
|
|
|
2151 LIST_LOOP_2 and EXTERNAL_LIST_LOOP_2 are the standard, most-often used
|
|
|
2152 macros. They take two arguments, an element variable ELT and the list
|
|
|
2153 LIST. ELT is automatically declared, and set to each element in turn
|
|
|
2154 from LIST.
|
|
|
2155
|
|
|
2156 LIST_LOOP_3 and EXTERNAL_LIST_LOOP_3 are the same, but they have a third
|
|
|
2157 argument TAIL, another automatically-declared variable. At each iteration,
|
|
|
2158 this one points to the cons cell for which ELT is the car.
|
|
|
2159
|
|
|
2160 EXTERNAL_LIST_LOOP_4 is like EXTERNAL_LIST_LOOP_3 but takes an additional
|
|
|
2161 LEN argument, again automatically declared, which counts the number of
|
|
|
2162 iterations gone by. It is 0 during the first iteration.
|
|
|
2163
|
|
|
2164 EXTERNAL_LIST_LOOP_4_NO_DECLARE is like EXTERNAL_LIST_LOOP_4 but none
|
|
|
2165 of the variables are automatically declared, and so you need to declare
|
|
|
2166 them yourself. (ELT and TAIL are Lisp_Objects, and LEN is an EMACS_INT.)
|
|
|
2167 */
|
|
|
2168
|
|
|
2169 #define LIST_LOOP_2(elt, list) \
|
|
|
2170 LIST_LOOP_3(elt, list, unused_tail_##elt)
|
|
|
2171
|
|
|
2172 #define LIST_LOOP_3(elt, list, tail) \
|
|
|
2173 Lisp_Object elt, tail; \
|
|
|
2174 for (tail = list; \
|
|
|
2175 NILP (tail) ? \
|
|
|
2176 0 : (elt = XCAR (tail), 1); \
|
|
|
2177 tail = XCDR (tail))
|
|
428
|
2178
|
|
|
2179 /* The following macros are for traversing lisp lists.
|
|
|
2180 Signal an error if LIST is not properly acyclic and nil-terminated.
|
|
|
2181
|
|
|
2182 Use tortoise/hare algorithm to check for cycles, but only if it
|
|
|
2183 looks like the list is getting too long. Not only is the hare
|
|
|
2184 faster than the tortoise; it even gets a head start! */
|
|
|
2185
|
|
|
2186 /* Optimized and safe macros for looping over external lists. */
|
|
|
2187 #define CIRCULAR_LIST_SUSPICION_LENGTH 1024
|
|
|
2188
|
|
|
2189 #define EXTERNAL_LIST_LOOP_1(list) \
|
|
|
2190 Lisp_Object ELL1_elt, ELL1_hare, ELL1_tortoise; \
|
|
442
|
2191 EMACS_INT ELL1_len; \
|
|
|
2192 PRIVATE_EXTERNAL_LIST_LOOP_6 (ELL1_elt, list, ELL1_len, ELL1_hare, \
|
|
428
|
2193 ELL1_tortoise, CIRCULAR_LIST_SUSPICION_LENGTH)
|
|
|
2194
|
|
|
2195 #define EXTERNAL_LIST_LOOP_2(elt, list) \
|
|
442
|
2196 Lisp_Object elt, hare_##elt, tortoise_##elt; \
|
|
|
2197 EMACS_INT len_##elt; \
|
|
|
2198 PRIVATE_EXTERNAL_LIST_LOOP_6 (elt, list, len_##elt, hare_##elt, \
|
|
428
|
2199 tortoise_##elt, CIRCULAR_LIST_SUSPICION_LENGTH)
|
|
|
2200
|
|
2367
|
2201
|
|
|
2202 #define GC_EXTERNAL_LIST_LOOP_2(elt, list) \
|
|
|
2203 do { \
|
|
|
2204 XGCDECL3 (elt); \
|
|
|
2205 Lisp_Object elt, hare_##elt, tortoise_##elt; \
|
|
|
2206 EMACS_INT len_##elt; \
|
|
|
2207 XGCPRO3 (elt, elt, hare_##elt, tortoise_##elt); \
|
|
|
2208 PRIVATE_EXTERNAL_LIST_LOOP_6 (elt, list, len_##elt, hare_##elt, \
|
|
|
2209 tortoise_##elt, \
|
|
|
2210 CIRCULAR_LIST_SUSPICION_LENGTH)
|
|
|
2211
|
|
|
2212 #define END_GC_EXTERNAL_LIST_LOOP(elt) \
|
|
|
2213 XUNGCPRO (elt); \
|
|
|
2214 } \
|
|
|
2215 while (0)
|
|
|
2216
|
|
428
|
2217 #define EXTERNAL_LIST_LOOP_3(elt, list, tail) \
|
|
442
|
2218 Lisp_Object elt, tail, tortoise_##elt; \
|
|
|
2219 EMACS_INT len_##elt; \
|
|
|
2220 PRIVATE_EXTERNAL_LIST_LOOP_6 (elt, list, len_##elt, tail, \
|
|
|
2221 tortoise_##elt, CIRCULAR_LIST_SUSPICION_LENGTH)
|
|
|
2222
|
|
|
2223 #define EXTERNAL_LIST_LOOP_4_NO_DECLARE(elt, list, tail, len) \
|
|
428
|
2224 Lisp_Object tortoise_##elt; \
|
|
442
|
2225 PRIVATE_EXTERNAL_LIST_LOOP_6 (elt, list, len, tail, \
|
|
428
|
2226 tortoise_##elt, CIRCULAR_LIST_SUSPICION_LENGTH)
|
|
|
2227
|
|
|
2228 #define EXTERNAL_LIST_LOOP_4(elt, list, tail, len) \
|
|
442
|
2229 Lisp_Object elt, tail, tortoise_##elt; \
|
|
|
2230 EMACS_INT len; \
|
|
|
2231 PRIVATE_EXTERNAL_LIST_LOOP_6 (elt, list, len, tail, \
|
|
428
|
2232 tortoise_##elt, CIRCULAR_LIST_SUSPICION_LENGTH)
|
|
|
2233
|
|
|
2234
|
|
444
|
2235 #define PRIVATE_EXTERNAL_LIST_LOOP_6(elt, list, len, hare, \
|
|
|
2236 tortoise, suspicion_length) \
|
|
|
2237 for (tortoise = hare = list, len = 0; \
|
|
|
2238 \
|
|
|
2239 (CONSP (hare) ? ((elt = XCAR (hare)), 1) : \
|
|
|
2240 (NILP (hare) ? 0 : \
|
|
|
2241 (signal_malformed_list_error (list), 0))); \
|
|
|
2242 \
|
|
|
2243 hare = XCDR (hare), \
|
|
|
2244 (void) \
|
|
|
2245 ((++len > suspicion_length) \
|
|
|
2246 && \
|
|
|
2247 ((((len & 1) != 0) && (tortoise = XCDR (tortoise), 0)), \
|
|
|
2248 (EQ (hare, tortoise) && (signal_circular_list_error (list), 0)))))
|
|
428
|
2249
|
|
442
|
2250 /* GET_LIST_LENGTH and GET_EXTERNAL_LIST_LENGTH:
|
|
|
2251
|
|
|
2252 These two macros return the length of LIST (either an internal or external
|
|
|
2253 list, according to which macro is used), stored into LEN (which must
|
|
|
2254 be declared by the caller). Circularities are trapped in external lists
|
|
|
2255 (and cause errors). Neither macro need be declared inside brackets. */
|
|
|
2256
|
|
|
2257 #define GET_LIST_LENGTH(list, len) do { \
|
|
|
2258 Lisp_Object GLL_tail; \
|
|
|
2259 for (GLL_tail = list, len = 0; \
|
|
|
2260 !NILP (GLL_tail); \
|
|
|
2261 GLL_tail = XCDR (GLL_tail), ++len) \
|
|
|
2262 DO_NOTHING; \
|
|
|
2263 } while (0)
|
|
|
2264
|
|
|
2265 #define GET_EXTERNAL_LIST_LENGTH(list, len) \
|
|
|
2266 do { \
|
|
|
2267 Lisp_Object GELL_elt, GELL_tail; \
|
|
|
2268 EXTERNAL_LIST_LOOP_4_NO_DECLARE (GELL_elt, list, GELL_tail, len) \
|
|
|
2269 ; \
|
|
|
2270 } while (0)
|
|
|
2271
|
|
|
2272 /* For a list that's known to be in valid list format, where we may
|
|
|
2273 be deleting the current element out of the list --
|
|
2500
|
2274 will ABORT() if the list is not in valid format */
|
|
442
|
2275 #define LIST_LOOP_DELETING(consvar, nextconsvar, list) \
|
|
|
2276 for (consvar = list; \
|
|
|
2277 !NILP (consvar) ? (nextconsvar = XCDR (consvar), 1) :0; \
|
|
|
2278 consvar = nextconsvar)
|
|
|
2279
|
|
|
2280 /* LIST_LOOP_DELETE_IF and EXTERNAL_LIST_LOOP_DELETE_IF:
|
|
|
2281
|
|
|
2282 These two macros delete all elements of LIST (either an internal or
|
|
|
2283 external list, according to which macro is used) satisfying
|
|
|
2284 CONDITION, a C expression referring to variable ELT. ELT is
|
|
|
2285 automatically declared. Circularities are trapped in external
|
|
|
2286 lists (and cause errors). Neither macro need be declared inside
|
|
|
2287 brackets. */
|
|
|
2288
|
|
|
2289 #define LIST_LOOP_DELETE_IF(elt, list, condition) do { \
|
|
|
2290 /* Do not use ##list when creating new variables because \
|
|
|
2291 that may not be just a variable name. */ \
|
|
|
2292 Lisp_Object prev_tail_##elt = Qnil; \
|
|
|
2293 LIST_LOOP_3 (elt, list, tail_##elt) \
|
|
|
2294 { \
|
|
|
2295 if (condition) \
|
|
|
2296 { \
|
|
|
2297 if (NILP (prev_tail_##elt)) \
|
|
|
2298 list = XCDR (tail_##elt); \
|
|
|
2299 else \
|
|
|
2300 XCDR (prev_tail_##elt) = XCDR (tail_##elt); \
|
|
|
2301 } \
|
|
|
2302 else \
|
|
|
2303 prev_tail_##elt = tail_##elt; \
|
|
|
2304 } \
|
|
|
2305 } while (0)
|
|
|
2306
|
|
|
2307 #define EXTERNAL_LIST_LOOP_DELETE_IF(elt, list, condition) do { \
|
|
|
2308 Lisp_Object prev_tail_##elt = Qnil; \
|
|
|
2309 EXTERNAL_LIST_LOOP_4 (elt, list, tail_##elt, len_##elt) \
|
|
|
2310 { \
|
|
|
2311 if (condition) \
|
|
|
2312 { \
|
|
|
2313 if (NILP (prev_tail_##elt)) \
|
|
|
2314 list = XCDR (tail_##elt); \
|
|
|
2315 else \
|
|
|
2316 XCDR (prev_tail_##elt) = XCDR (tail_##elt); \
|
|
|
2317 /* Keep tortoise from ever passing hare. */ \
|
|
|
2318 len_##elt = 0; \
|
|
|
2319 } \
|
|
|
2320 else \
|
|
|
2321 prev_tail_##elt = tail_##elt; \
|
|
|
2322 } \
|
|
|
2323 } while (0)
|
|
|
2324
|
|
|
2325
|
|
1204
|
2326 /* Macros for looping over internal alists.
|
|
|
2327
|
|
|
2328 *** ALL OF THESE MACROS MUST BE DECLARED INSIDE BRACES -- SEE ABOVE. ***
|
|
|
2329
|
|
|
2330 ALIST_LOOP_3 loops over an alist, at each iteration setting CAR and CDR
|
|
|
2331 to the car and cdr of the acons. CAR and CDR are automatically
|
|
|
2332 declared.
|
|
|
2333
|
|
|
2334 ALIST_LOOP_4 is similar to ALIST_LOOP_3 but contains an additional
|
|
|
2335 variable ACONS at the beginning for access to the acons itself.All of
|
|
|
2336 the variables ACONS, CAR and CDR are automatically declared.
|
|
|
2337 */
|
|
|
2338
|
|
|
2339 #define ALIST_LOOP_3(car, cdr, alist) \
|
|
|
2340 Lisp_Object _al3_acons_##car, car, cdr, _al3_tail_##car; \
|
|
|
2341 for (_al3_tail_##car = alist; \
|
|
|
2342 NILP (_al3_tail_##car) ? \
|
|
|
2343 0 : (_al3_acons_##car = XCAR (_al3_tail_##car), \
|
|
|
2344 car = XCAR (_al3_acons_##car), \
|
|
|
2345 cdr = XCDR (_al3_acons_##car), 1); \
|
|
|
2346 _al3_tail_##car = XCDR (_al3_tail_##car))
|
|
|
2347
|
|
|
2348 #define ALIST_LOOP_4(acons, car, cdr, list) \
|
|
|
2349 Lisp_Object acons, car, cdr, _al4_tail_##car; \
|
|
|
2350 for (_al4_tail_##car = list; \
|
|
|
2351 NILP (_al4_tail_##car) ? \
|
|
|
2352 0 : (elt = XCAR (_al4_tail_##car), car = XCAR (elt), \
|
|
|
2353 cdr = XCDR (elt), 1); \
|
|
|
2354 _al4_tail_##car = XCDR (tail))
|
|
|
2355
|
|
442
|
2356 /* Macros for looping over external alists.
|
|
|
2357
|
|
|
2358 *** ALL OF THESE MACROS MUST BE DECLARED INSIDE BRACES -- SEE ABOVE. ***
|
|
|
2359
|
|
|
2360 EXTERNAL_ALIST_LOOP_4 is similar to EXTERNAL_LIST_LOOP_2, but it
|
|
|
2361 assumes the elements are aconses (the elements in an alist) and
|
|
|
2362 sets two additional argument variables ELT_CAR and ELT_CDR to the
|
|
|
2363 car and cdr of the acons. All of the variables ELT, ELT_CAR and
|
|
|
2364 ELT_CDR are automatically declared.
|
|
|
2365
|
|
|
2366 EXTERNAL_ALIST_LOOP_5 adds a TAIL argument to EXTERNAL_ALIST_LOOP_4,
|
|
|
2367 just like EXTERNAL_LIST_LOOP_3 does, and again TAIL is automatically
|
|
|
2368 declared.
|
|
|
2369
|
|
|
2370 EXTERNAL_ALIST_LOOP_6 adds a LEN argument to EXTERNAL_ALIST_LOOP_5,
|
|
|
2371 just like EXTERNAL_LIST_LOOP_4 does, and again LEN is automatically
|
|
|
2372 declared.
|
|
|
2373
|
|
|
2374 EXTERNAL_ALIST_LOOP_6_NO_DECLARE does not declare any of its arguments,
|
|
|
2375 just like EXTERNAL_LIST_LOOP_4_NO_DECLARE, and so these must be declared
|
|
|
2376 manually.
|
|
|
2377 */
|
|
428
|
2378
|
|
|
2379 /* Optimized and safe macros for looping over external alists. */
|
|
|
2380 #define EXTERNAL_ALIST_LOOP_4(elt, elt_car, elt_cdr, list) \
|
|
442
|
2381 Lisp_Object elt, elt_car, elt_cdr; \
|
|
428
|
2382 Lisp_Object hare_##elt, tortoise_##elt; \
|
|
|
2383 EMACS_INT len_##elt; \
|
|
442
|
2384 PRIVATE_EXTERNAL_ALIST_LOOP_8 (elt, elt_car, elt_cdr, list, \
|
|
428
|
2385 len_##elt, hare_##elt, tortoise_##elt, \
|
|
|
2386 CIRCULAR_LIST_SUSPICION_LENGTH)
|
|
|
2387
|
|
|
2388 #define EXTERNAL_ALIST_LOOP_5(elt, elt_car, elt_cdr, list, tail) \
|
|
442
|
2389 Lisp_Object elt, elt_car, elt_cdr, tail; \
|
|
428
|
2390 Lisp_Object tortoise_##elt; \
|
|
|
2391 EMACS_INT len_##elt; \
|
|
442
|
2392 PRIVATE_EXTERNAL_ALIST_LOOP_8 (elt, elt_car, elt_cdr, list, \
|
|
428
|
2393 len_##elt, tail, tortoise_##elt, \
|
|
|
2394 CIRCULAR_LIST_SUSPICION_LENGTH) \
|
|
|
2395
|
|
|
2396 #define EXTERNAL_ALIST_LOOP_6(elt, elt_car, elt_cdr, list, tail, len) \
|
|
442
|
2397 Lisp_Object elt, elt_car, elt_cdr, tail; \
|
|
|
2398 EMACS_INT len; \
|
|
428
|
2399 Lisp_Object tortoise_##elt; \
|
|
442
|
2400 PRIVATE_EXTERNAL_ALIST_LOOP_8 (elt, elt_car, elt_cdr, list, \
|
|
428
|
2401 len, tail, tortoise_##elt, \
|
|
|
2402 CIRCULAR_LIST_SUSPICION_LENGTH)
|
|
|
2403
|
|
442
|
2404 #define EXTERNAL_ALIST_LOOP_6_NO_DECLARE(elt, elt_car, elt_cdr, list, \
|
|
|
2405 tail, len) \
|
|
|
2406 Lisp_Object tortoise_##elt; \
|
|
|
2407 PRIVATE_EXTERNAL_ALIST_LOOP_8 (elt, elt_car, elt_cdr, list, \
|
|
|
2408 len, tail, tortoise_##elt, \
|
|
|
2409 CIRCULAR_LIST_SUSPICION_LENGTH)
|
|
|
2410
|
|
|
2411
|
|
|
2412 #define PRIVATE_EXTERNAL_ALIST_LOOP_8(elt, elt_car, elt_cdr, list, len, \
|
|
|
2413 hare, tortoise, suspicion_length) \
|
|
|
2414 PRIVATE_EXTERNAL_LIST_LOOP_6 (elt, list, len, hare, tortoise, \
|
|
|
2415 suspicion_length) \
|
|
428
|
2416 if (CONSP (elt) ? (elt_car = XCAR (elt), elt_cdr = XCDR (elt), 0) :1) \
|
|
|
2417 continue; \
|
|
|
2418 else
|
|
|
2419
|
|
442
|
2420 /* Macros for looping over external property lists.
|
|
|
2421
|
|
|
2422 *** ALL OF THESE MACROS MUST BE DECLARED INSIDE BRACES -- SEE ABOVE. ***
|
|
|
2423
|
|
|
2424 EXTERNAL_PROPERTY_LIST_LOOP_3 maps over an external list assumed to
|
|
|
2425 be a property list, consisting of alternating pairs of keys
|
|
|
2426 (typically symbols or keywords) and values. Each iteration
|
|
|
2427 processes one such pair out of LIST, assigning the two elements to
|
|
|
2428 KEY and VALUE respectively. Malformed lists and circularities are
|
|
|
2429 trapped as usual, and in addition, property lists with an odd number
|
|
|
2430 of elements also signal an error.
|
|
|
2431
|
|
|
2432 EXTERNAL_PROPERTY_LIST_LOOP_4 adds a TAIL argument to
|
|
|
2433 EXTERNAL_PROPERTY_LIST_LOOP_3, just like EXTERNAL_LIST_LOOP_3 does,
|
|
|
2434 and again TAIL is automatically declared.
|
|
|
2435
|
|
|
2436 EXTERNAL_PROPERTY_LIST_LOOP_5 adds a LEN argument to
|
|
|
2437 EXTERNAL_PROPERTY_LIST_LOOP_4, just like EXTERNAL_LIST_LOOP_4 does,
|
|
|
2438 and again LEN is automatically declared. Note that in this case,
|
|
|
2439 LEN counts the iterations, NOT the total number of list elements
|
|
|
2440 processed, which is 2 * LEN.
|
|
|
2441
|
|
|
2442 EXTERNAL_PROPERTY_LIST_LOOP_5_NO_DECLARE does not declare any of its
|
|
|
2443 arguments, just like EXTERNAL_LIST_LOOP_4_NO_DECLARE, and so these
|
|
|
2444 must be declared manually. */
|
|
428
|
2445
|
|
|
2446 /* Optimized and safe macros for looping over external property lists. */
|
|
|
2447 #define EXTERNAL_PROPERTY_LIST_LOOP_3(key, value, list) \
|
|
|
2448 Lisp_Object key, value, hare_##key, tortoise_##key; \
|
|
442
|
2449 EMACS_INT len_##key; \
|
|
428
|
2450 EXTERNAL_PROPERTY_LIST_LOOP_7 (key, value, list, len_##key, hare_##key, \
|
|
|
2451 tortoise_##key, CIRCULAR_LIST_SUSPICION_LENGTH)
|
|
|
2452
|
|
|
2453 #define EXTERNAL_PROPERTY_LIST_LOOP_4(key, value, list, tail) \
|
|
|
2454 Lisp_Object key, value, tail, tortoise_##key; \
|
|
442
|
2455 EMACS_INT len_##key; \
|
|
428
|
2456 EXTERNAL_PROPERTY_LIST_LOOP_7 (key, value, list, len_##key, tail, \
|
|
|
2457 tortoise_##key, CIRCULAR_LIST_SUSPICION_LENGTH)
|
|
|
2458
|
|
|
2459 #define EXTERNAL_PROPERTY_LIST_LOOP_5(key, value, list, tail, len) \
|
|
|
2460 Lisp_Object key, value, tail, tortoise_##key; \
|
|
|
2461 EMACS_INT len; \
|
|
|
2462 EXTERNAL_PROPERTY_LIST_LOOP_7 (key, value, list, len, tail, \
|
|
|
2463 tortoise_##key, CIRCULAR_LIST_SUSPICION_LENGTH)
|
|
|
2464
|
|
442
|
2465 #define EXTERNAL_PROPERTY_LIST_LOOP_5_NO_DECLARE(key, value, list, \
|
|
|
2466 tail, len) \
|
|
|
2467 Lisp_Object tortoise_##key; \
|
|
|
2468 EXTERNAL_PROPERTY_LIST_LOOP_7 (key, value, list, len, tail, \
|
|
|
2469 tortoise_##key, CIRCULAR_LIST_SUSPICION_LENGTH)
|
|
|
2470
|
|
428
|
2471
|
|
|
2472 #define EXTERNAL_PROPERTY_LIST_LOOP_7(key, value, list, len, hare, \
|
|
|
2473 tortoise, suspicion_length) \
|
|
|
2474 for (tortoise = hare = list, len = 0; \
|
|
|
2475 \
|
|
|
2476 ((CONSP (hare) && \
|
|
|
2477 (key = XCAR (hare), \
|
|
|
2478 hare = XCDR (hare), \
|
|
442
|
2479 (CONSP (hare) ? 1 : \
|
|
|
2480 (signal_malformed_property_list_error (list), 0)))) ? \
|
|
428
|
2481 (value = XCAR (hare), 1) : \
|
|
|
2482 (NILP (hare) ? 0 : \
|
|
|
2483 (signal_malformed_property_list_error (list), 0))); \
|
|
|
2484 \
|
|
|
2485 hare = XCDR (hare), \
|
|
|
2486 ((++len < suspicion_length) ? \
|
|
|
2487 ((void) 0) : \
|
|
|
2488 (((len & 1) ? \
|
|
|
2489 ((void) (tortoise = XCDR (XCDR (tortoise)))) : \
|
|
|
2490 ((void) 0)) \
|
|
|
2491 , \
|
|
|
2492 (EQ (hare, tortoise) ? \
|
|
|
2493 ((void) signal_circular_property_list_error (list)) : \
|
|
|
2494 ((void) 0)))))
|
|
|
2495
|
|
2421
|
2496 #define PRIVATE_PROPERTY_LIST_LOOP_4(tail, key, value, plist) \
|
|
|
2497 for (tail = plist; \
|
|
|
2498 NILP (tail) ? 0 : \
|
|
|
2499 (key = XCAR (tail), tail = XCDR (tail), \
|
|
|
2500 value = XCAR (tail), tail = XCDR (tail), 1); \
|
|
428
|
2501 )
|
|
|
2502
|
|
2421
|
2503 #define PROPERTY_LIST_LOOP_3(key, value, plist) \
|
|
|
2504 Lisp_Object key, value, tail_##key; \
|
|
|
2505 PRIVATE_PROPERTY_LIST_LOOP_4 (tail_##key, key, value, plist)
|
|
|
2506
|
|
|
2507 #define GC_PROPERTY_LIST_LOOP_3(key, value, plist) \
|
|
|
2508 do { \
|
|
|
2509 XGCDECL3 (key); \
|
|
|
2510 Lisp_Object key, value, tail_##key; \
|
|
|
2511 XGCPRO3 (key, key, value, tail_##key); \
|
|
|
2512 PRIVATE_PROPERTY_LIST_LOOP_4 (tail_##key, key, value, plist)
|
|
|
2513
|
|
|
2514 #define END_GC_PROPERTY_LIST_LOOP(key) \
|
|
|
2515 XUNGCPRO (key); \
|
|
|
2516 } \
|
|
|
2517 while (0)
|
|
|
2518
|
|
428
|
2519 /* Return 1 if LIST is properly acyclic and nil-terminated, else 0. */
|
|
826
|
2520 DECLARE_INLINE_HEADER (
|
|
|
2521 int
|
|
428
|
2522 TRUE_LIST_P (Lisp_Object object)
|
|
826
|
2523 )
|
|
428
|
2524 {
|
|
|
2525 Lisp_Object hare, tortoise;
|
|
|
2526 EMACS_INT len;
|
|
|
2527
|
|
|
2528 for (hare = tortoise = object, len = 0;
|
|
|
2529 CONSP (hare);
|
|
|
2530 hare = XCDR (hare), len++)
|
|
|
2531 {
|
|
|
2532 if (len < CIRCULAR_LIST_SUSPICION_LENGTH)
|
|
|
2533 continue;
|
|
|
2534
|
|
|
2535 if (len & 1)
|
|
|
2536 tortoise = XCDR (tortoise);
|
|
|
2537 else if (EQ (hare, tortoise))
|
|
|
2538 return 0;
|
|
|
2539 }
|
|
|
2540
|
|
|
2541 return NILP (hare);
|
|
|
2542 }
|
|
|
2543
|
|
|
2544 /* Signal an error if LIST is not properly acyclic and nil-terminated. */
|
|
|
2545 #define CHECK_TRUE_LIST(list) do { \
|
|
|
2546 Lisp_Object CTL_list = (list); \
|
|
|
2547 Lisp_Object CTL_hare, CTL_tortoise; \
|
|
436
|
2548 EMACS_INT CTL_len; \
|
|
428
|
2549 \
|
|
|
2550 for (CTL_hare = CTL_tortoise = CTL_list, CTL_len = 0; \
|
|
|
2551 CONSP (CTL_hare); \
|
|
|
2552 CTL_hare = XCDR (CTL_hare), CTL_len++) \
|
|
|
2553 { \
|
|
|
2554 if (CTL_len < CIRCULAR_LIST_SUSPICION_LENGTH) \
|
|
|
2555 continue; \
|
|
|
2556 \
|
|
|
2557 if (CTL_len & 1) \
|
|
|
2558 CTL_tortoise = XCDR (CTL_tortoise); \
|
|
|
2559 else if (EQ (CTL_hare, CTL_tortoise)) \
|
|
|
2560 Fsignal (Qcircular_list, list1 (CTL_list)); \
|
|
|
2561 } \
|
|
|
2562 \
|
|
|
2563 if (! NILP (CTL_hare)) \
|
|
|
2564 signal_malformed_list_error (CTL_list); \
|
|
|
2565 } while (0)
|
|
|
2566
|
|
442
|
2567 /*------------------------------ string --------------------------------*/
|
|
428
|
2568
|
|
3092
|
2569 #ifdef NEW_GC
|
|
|
2570 struct Lisp_String_Direct_Data
|
|
|
2571 {
|
|
|
2572 struct lrecord_header header;
|
|
|
2573 Bytecount size;
|
|
|
2574 Ibyte data[1];
|
|
|
2575 };
|
|
|
2576 typedef struct Lisp_String_Direct_Data Lisp_String_Direct_Data;
|
|
|
2577
|
|
|
2578 DECLARE_MODULE_API_LRECORD (string_direct_data, Lisp_String_Direct_Data);
|
|
|
2579 #define XSTRING_DIRECT_DATA(x) \
|
|
|
2580 XRECORD (x, string_direct_data, Lisp_String_Direct_Data)
|
|
|
2581 #define wrap_string_direct_data(p) wrap_record (p, string_direct_data)
|
|
|
2582 #define STRING_DIRECT_DATAP(x) RECORDP (x, string_direct_data)
|
|
|
2583 #define CHECK_STRING_DIRECT_DATA(x) CHECK_RECORD (x, string_direct_data)
|
|
|
2584 #define CONCHECK_STRING_DIRECT_DATA(x) CONCHECK_RECORD (x, string_direct_data)
|
|
|
2585
|
|
|
2586 #define XSTRING_DIRECT_DATA_SIZE(x) XSTRING_DIRECT_DATA (x)->size
|
|
|
2587 #define XSTRING_DIRECT_DATA_DATA(x) XSTRING_DIRECT_DATA (x)->data
|
|
|
2588
|
|
|
2589
|
|
|
2590 struct Lisp_String_Indirect_Data
|
|
|
2591 {
|
|
|
2592 struct lrecord_header header;
|
|
|
2593 Bytecount size;
|
|
|
2594 Ibyte *data;
|
|
|
2595 };
|
|
|
2596 typedef struct Lisp_String_Indirect_Data Lisp_String_Indirect_Data;
|
|
|
2597
|
|
|
2598 DECLARE_MODULE_API_LRECORD (string_indirect_data, Lisp_String_Indirect_Data);
|
|
|
2599 #define XSTRING_INDIRECT_DATA(x) \
|
|
|
2600 XRECORD (x, string_indirect_data, Lisp_String_Indirect_Data)
|
|
|
2601 #define wrap_string_indirect_data(p) wrap_record (p, string_indirect_data)
|
|
|
2602 #define STRING_INDIRECT_DATAP(x) RECORDP (x, string_indirect_data)
|
|
|
2603 #define CHECK_STRING_INDIRECT_DATA(x) CHECK_RECORD (x, string_indirect_data)
|
|
|
2604 #define CONCHECK_STRING_INDIRECT_DATA(x) \
|
|
|
2605 CONCHECK_RECORD (x, string_indirect_data)
|
|
|
2606
|
|
|
2607 #define XSTRING_INDIRECT_DATA_SIZE(x) XSTRING_INDIRECT_DATA (x)->size
|
|
|
2608 #define XSTRING_INDIRECT_DATA_DATA(x) XSTRING_INDIRECT_DATA (x)->data
|
|
|
2609
|
|
|
2610
|
|
|
2611 #define XSTRING_DATA_SIZE(s) ((s)->indirect)? \
|
|
|
2612 XSTRING_INDIRECT_DATA_SIZE ((s)->data_object): \
|
|
|
2613 XSTRING_DIRECT_DATA_SIZE ((s)->data_object)
|
|
|
2614 #define XSTRING_DATA_DATA(s) ((s)->indirect)? \
|
|
|
2615 XSTRING_INDIRECT_DATA_DATA ((s)->data_object): \
|
|
|
2616 XSTRING_DIRECT_DATA_DATA ((s)->data_object)
|
|
|
2617
|
|
|
2618 #define XSET_STRING_DATA_SIZE(s, len) \
|
|
|
2619 if ((s)->indirect) \
|
|
|
2620 XSTRING_INDIRECT_DATA_SIZE ((s)->data_object) = len; \
|
|
|
2621 else \
|
|
|
2622 XSTRING_DIRECT_DATA_SIZE ((s)->data_object) = len
|
|
|
2623 #define XSET_STRING_DATA_DATA(s, ptr) \
|
|
|
2624 if ((s)->indirect) \
|
|
|
2625 XSTRING_INDIRECT_DATA_DATA ((s)->data_object) = ptr; \
|
|
|
2626 else \
|
|
|
2627 XSTRING_DIRECT_DATA_DATA ((s)->data_object) = ptr
|
|
|
2628 #endif /* NEW_GC */
|
|
|
2629
|
|
428
|
2630 struct Lisp_String
|
|
|
2631 {
|
|
771
|
2632 union
|
|
|
2633 {
|
|
|
2634 struct lrecord_header lheader;
|
|
|
2635 struct
|
|
|
2636 {
|
|
|
2637 /* WARNING: Everything before ascii_begin must agree exactly with
|
|
|
2638 struct lrecord_header */
|
|
|
2639 unsigned int type :8;
|
|
2720
|
2640 #ifdef MC_ALLOC
|
|
|
2641 unsigned int lisp_readonly :1;
|
|
|
2642 unsigned int free :1;
|
|
|
2643 /* Number of chars at beginning of string that are one byte in length
|
|
|
2644 (byte_ascii_p) */
|
|
|
2645 unsigned int ascii_begin :22;
|
|
|
2646 #else /* not MC_ALLOC */
|
|
771
|
2647 unsigned int mark :1;
|
|
|
2648 unsigned int c_readonly :1;
|
|
|
2649 unsigned int lisp_readonly :1;
|
|
|
2650 /* Number of chars at beginning of string that are one byte in length
|
|
826
|
2651 (byte_ascii_p) */
|
|
771
|
2652 unsigned int ascii_begin :21;
|
|
2720
|
2653 #endif /* not MC_ALLOC */
|
|
771
|
2654 } v;
|
|
|
2655 } u;
|
|
3092
|
2656 #ifdef NEW_GC
|
|
|
2657 int indirect;
|
|
|
2658 Lisp_Object data_object;
|
|
|
2659 #else /* not NEW_GC */
|
|
793
|
2660 Bytecount size_;
|
|
867
|
2661 Ibyte *data_;
|
|
3092
|
2662 #endif /* not NEW_GC */
|
|
428
|
2663 Lisp_Object plist;
|
|
|
2664 };
|
|
|
2665 typedef struct Lisp_String Lisp_String;
|
|
|
2666
|
|
3063
|
2667 #ifdef MC_ALLOC
|
|
|
2668 #define MAX_STRING_ASCII_BEGIN ((1 << 22) - 1)
|
|
|
2669 #else
|
|
851
|
2670 #define MAX_STRING_ASCII_BEGIN ((1 << 21) - 1)
|
|
3063
|
2671 #endif
|
|
771
|
2672
|
|
1632
|
2673 DECLARE_MODULE_API_LRECORD (string, Lisp_String);
|
|
428
|
2674 #define XSTRING(x) XRECORD (x, string, Lisp_String)
|
|
617
|
2675 #define wrap_string(p) wrap_record (p, string)
|
|
428
|
2676 #define STRINGP(x) RECORDP (x, string)
|
|
|
2677 #define CHECK_STRING(x) CHECK_RECORD (x, string)
|
|
|
2678 #define CONCHECK_STRING(x) CONCHECK_RECORD (x, string)
|
|
|
2679
|
|
826
|
2680 /* Most basic macros for strings -- basically just accessing or setting
|
|
|
2681 fields -- are here. Everything else is in text.h, since they depend on
|
|
|
2682 stuff there. */
|
|
428
|
2683
|
|
793
|
2684 /* Operations on Lisp_String *'s; only ones left */
|
|
3092
|
2685 #ifdef NEW_GC
|
|
|
2686 #define set_lispstringp_indirect(s) ((s)->indirect = 1)
|
|
|
2687 #define set_lispstringp_length(s, len) XSET_STRING_DATA_SIZE (s, len)
|
|
|
2688 #define set_lispstringp_data(s, ptr) XSET_STRING_DATA_DATA (s, ptr)
|
|
|
2689 #else /* not NEW_GC */
|
|
826
|
2690 #define set_lispstringp_length(s, len) ((void) ((s)->size_ = (len)))
|
|
|
2691 #define set_lispstringp_data(s, ptr) ((void) ((s)->data_ = (ptr)))
|
|
3092
|
2692 #endif /* not NEW_GC */
|
|
826
|
2693
|
|
|
2694 /* Operations on strings as Lisp_Objects. Don't manipulate Lisp_String *'s
|
|
|
2695 in any new code. */
|
|
3092
|
2696 #ifdef NEW_GC
|
|
|
2697 #define STRING_DATA_OBJECT(s) ((s)->data_object)
|
|
|
2698 #define XSTRING_DATA_OBJECT(s) (STRING_DATA_OBJECT (XSTRING (s)))
|
|
|
2699 #define XSTRING_LENGTH(s) (XSTRING_DATA_SIZE (XSTRING (s)))
|
|
|
2700 #else /* not NEW_GC */
|
|
793
|
2701 #define XSTRING_LENGTH(s) (XSTRING (s)->size_)
|
|
3092
|
2702 #endif /* not NEW_GC */
|
|
793
|
2703 #define XSTRING_PLIST(s) (XSTRING (s)->plist)
|
|
3092
|
2704 #ifdef NEW_GC
|
|
|
2705 #define XSTRING_DATA(s) (XSTRING_DATA_DATA (XSTRING (s)))
|
|
|
2706 #else /* not NEW_GC */
|
|
793
|
2707 #define XSTRING_DATA(s) (XSTRING (s)->data_ + 0)
|
|
3092
|
2708 #endif /* not NEW_GC */
|
|
793
|
2709 #define XSTRING_ASCII_BEGIN(s) (XSTRING (s)->u.v.ascii_begin + 0)
|
|
826
|
2710 #define XSET_STRING_LENGTH(s, ptr) set_lispstringp_length (XSTRING (s), ptr)
|
|
|
2711 #define XSET_STRING_DATA(s, ptr) set_lispstringp_data (XSTRING (s), ptr)
|
|
771
|
2712 /* WARNING: If you modify an existing string, you must call
|
|
|
2713 bump_string_modiff() afterwards. */
|
|
793
|
2714 #define XSET_STRING_ASCII_BEGIN(s, val) \
|
|
|
2715 ((void) (XSTRING (s)->u.v.ascii_begin = (val)))
|
|
826
|
2716 #define XSTRING_FORMAT(s) FORMAT_DEFAULT
|
|
428
|
2717
|
|
456
|
2718 /* Return the true aligned size of a struct whose last member is a
|
|
|
2719 variable-length array field. (this is known as the "struct hack") */
|
|
|
2720 /* Implementation: in practice, structtype and fieldtype usually have
|
|
|
2721 the same alignment, but we can't be sure. We need to use
|
|
|
2722 ALIGN_SIZE to be absolutely sure of getting the correct alignment.
|
|
|
2723 To help the compiler's optimizer, we use a ternary expression that
|
|
|
2724 only a very stupid compiler would fail to correctly simplify. */
|
|
|
2725 #define FLEXIBLE_ARRAY_STRUCT_SIZEOF(structtype, \
|
|
|
2726 fieldtype, \
|
|
|
2727 fieldname, \
|
|
|
2728 array_length) \
|
|
|
2729 (ALIGNOF (structtype) == ALIGNOF (fieldtype) \
|
|
|
2730 ? (offsetof (structtype, fieldname) + \
|
|
|
2731 (offsetof (structtype, fieldname[1]) - \
|
|
|
2732 offsetof (structtype, fieldname[0])) * \
|
|
|
2733 (array_length)) \
|
|
826
|
2734 : (ALIGN_FOR_TYPE \
|
|
456
|
2735 ((offsetof (structtype, fieldname) + \
|
|
|
2736 (offsetof (structtype, fieldname[1]) - \
|
|
|
2737 offsetof (structtype, fieldname[0])) * \
|
|
|
2738 (array_length)), \
|
|
826
|
2739 structtype)))
|
|
442
|
2740
|
|
|
2741 /*------------------------------ vector --------------------------------*/
|
|
428
|
2742
|
|
|
2743 struct Lisp_Vector
|
|
|
2744 {
|
|
3017
|
2745 struct LCRECORD_HEADER header;
|
|
428
|
2746 long size;
|
|
|
2747 Lisp_Object contents[1];
|
|
|
2748 };
|
|
|
2749 typedef struct Lisp_Vector Lisp_Vector;
|
|
|
2750
|
|
|
2751 DECLARE_LRECORD (vector, Lisp_Vector);
|
|
|
2752 #define XVECTOR(x) XRECORD (x, vector, Lisp_Vector)
|
|
617
|
2753 #define wrap_vector(p) wrap_record (p, vector)
|
|
428
|
2754 #define VECTORP(x) RECORDP (x, vector)
|
|
|
2755 #define CHECK_VECTOR(x) CHECK_RECORD (x, vector)
|
|
|
2756 #define CONCHECK_VECTOR(x) CONCHECK_RECORD (x, vector)
|
|
|
2757
|
|
|
2758 #define vector_length(v) ((v)->size)
|
|
|
2759 #define XVECTOR_LENGTH(s) vector_length (XVECTOR (s))
|
|
|
2760 #define vector_data(v) ((v)->contents)
|
|
|
2761 #define XVECTOR_DATA(s) vector_data (XVECTOR (s))
|
|
|
2762
|
|
442
|
2763 /*---------------------------- bit vectors -----------------------------*/
|
|
428
|
2764
|
|
|
2765 #if (LONGBITS < 16)
|
|
|
2766 #error What the hell?!
|
|
|
2767 #elif (LONGBITS < 32)
|
|
|
2768 # define LONGBITS_LOG2 4
|
|
|
2769 # define LONGBITS_POWER_OF_2 16
|
|
|
2770 #elif (LONGBITS < 64)
|
|
|
2771 # define LONGBITS_LOG2 5
|
|
|
2772 # define LONGBITS_POWER_OF_2 32
|
|
|
2773 #elif (LONGBITS < 128)
|
|
|
2774 # define LONGBITS_LOG2 6
|
|
|
2775 # define LONGBITS_POWER_OF_2 64
|
|
|
2776 #else
|
|
|
2777 #error You really have 128-bit integers?!
|
|
|
2778 #endif
|
|
|
2779
|
|
|
2780 struct Lisp_Bit_Vector
|
|
|
2781 {
|
|
3017
|
2782 struct LCRECORD_HEADER lheader;
|
|
665
|
2783 Elemcount size;
|
|
428
|
2784 unsigned long bits[1];
|
|
|
2785 };
|
|
|
2786 typedef struct Lisp_Bit_Vector Lisp_Bit_Vector;
|
|
|
2787
|
|
|
2788 DECLARE_LRECORD (bit_vector, Lisp_Bit_Vector);
|
|
|
2789 #define XBIT_VECTOR(x) XRECORD (x, bit_vector, Lisp_Bit_Vector)
|
|
617
|
2790 #define wrap_bit_vector(p) wrap_record (p, bit_vector)
|
|
428
|
2791 #define BIT_VECTORP(x) RECORDP (x, bit_vector)
|
|
|
2792 #define CHECK_BIT_VECTOR(x) CHECK_RECORD (x, bit_vector)
|
|
|
2793 #define CONCHECK_BIT_VECTOR(x) CONCHECK_RECORD (x, bit_vector)
|
|
|
2794
|
|
|
2795 #define BITP(x) (INTP (x) && (XINT (x) == 0 || XINT (x) == 1))
|
|
|
2796
|
|
|
2797 #define CHECK_BIT(x) do { \
|
|
|
2798 if (!BITP (x)) \
|
|
|
2799 dead_wrong_type_argument (Qbitp, x);\
|
|
|
2800 } while (0)
|
|
|
2801
|
|
|
2802 #define CONCHECK_BIT(x) do { \
|
|
|
2803 if (!BITP (x)) \
|
|
|
2804 x = wrong_type_argument (Qbitp, x); \
|
|
|
2805 } while (0)
|
|
|
2806
|
|
|
2807 #define bit_vector_length(v) ((v)->size)
|
|
|
2808
|
|
826
|
2809 DECLARE_INLINE_HEADER (
|
|
|
2810 int
|
|
665
|
2811 bit_vector_bit (Lisp_Bit_Vector *v, Elemcount n)
|
|
826
|
2812 )
|
|
428
|
2813 {
|
|
|
2814 return ((v->bits[n >> LONGBITS_LOG2] >> (n & (LONGBITS_POWER_OF_2 - 1)))
|
|
|
2815 & 1);
|
|
|
2816 }
|
|
|
2817
|
|
826
|
2818 DECLARE_INLINE_HEADER (
|
|
|
2819 void
|
|
665
|
2820 set_bit_vector_bit (Lisp_Bit_Vector *v, Elemcount n, int value)
|
|
826
|
2821 )
|
|
428
|
2822 {
|
|
|
2823 if (value)
|
|
|
2824 v->bits[n >> LONGBITS_LOG2] |= (1UL << (n & (LONGBITS_POWER_OF_2 - 1)));
|
|
|
2825 else
|
|
|
2826 v->bits[n >> LONGBITS_LOG2] &= ~(1UL << (n & (LONGBITS_POWER_OF_2 - 1)));
|
|
|
2827 }
|
|
|
2828
|
|
|
2829 /* Number of longs required to hold LEN bits */
|
|
|
2830 #define BIT_VECTOR_LONG_STORAGE(len) \
|
|
|
2831 (((len) + LONGBITS_POWER_OF_2 - 1) >> LONGBITS_LOG2)
|
|
|
2832
|
|
853
|
2833
|
|
442
|
2834 /*------------------------------ symbol --------------------------------*/
|
|
428
|
2835
|
|
440
|
2836 typedef struct Lisp_Symbol Lisp_Symbol;
|
|
428
|
2837 struct Lisp_Symbol
|
|
|
2838 {
|
|
|
2839 struct lrecord_header lheader;
|
|
|
2840 /* next symbol in this obarray bucket */
|
|
440
|
2841 Lisp_Symbol *next;
|
|
793
|
2842 Lisp_Object name;
|
|
428
|
2843 Lisp_Object value;
|
|
|
2844 Lisp_Object function;
|
|
|
2845 Lisp_Object plist;
|
|
|
2846 };
|
|
|
2847
|
|
|
2848 #define SYMBOL_IS_KEYWORD(sym) \
|
|
826
|
2849 ((string_byte (symbol_name (XSYMBOL (sym)), 0) == ':') \
|
|
428
|
2850 && EQ (sym, oblookup (Vobarray, \
|
|
793
|
2851 XSTRING_DATA (symbol_name (XSYMBOL (sym))), \
|
|
|
2852 XSTRING_LENGTH (symbol_name (XSYMBOL (sym))))))
|
|
428
|
2853 #define KEYWORDP(obj) (SYMBOLP (obj) && SYMBOL_IS_KEYWORD (obj))
|
|
|
2854
|
|
1632
|
2855 DECLARE_MODULE_API_LRECORD (symbol, Lisp_Symbol);
|
|
428
|
2856 #define XSYMBOL(x) XRECORD (x, symbol, Lisp_Symbol)
|
|
617
|
2857 #define wrap_symbol(p) wrap_record (p, symbol)
|
|
428
|
2858 #define SYMBOLP(x) RECORDP (x, symbol)
|
|
|
2859 #define CHECK_SYMBOL(x) CHECK_RECORD (x, symbol)
|
|
|
2860 #define CONCHECK_SYMBOL(x) CONCHECK_RECORD (x, symbol)
|
|
|
2861
|
|
|
2862 #define symbol_next(s) ((s)->next)
|
|
|
2863 #define symbol_name(s) ((s)->name)
|
|
|
2864 #define symbol_value(s) ((s)->value)
|
|
|
2865 #define symbol_function(s) ((s)->function)
|
|
|
2866 #define symbol_plist(s) ((s)->plist)
|
|
|
2867
|
|
793
|
2868 #define XSYMBOL_NEXT(s) (XSYMBOL (s)->next)
|
|
|
2869 #define XSYMBOL_NAME(s) (XSYMBOL (s)->name)
|
|
|
2870 #define XSYMBOL_VALUE(s) (XSYMBOL (s)->value)
|
|
|
2871 #define XSYMBOL_FUNCTION(s) (XSYMBOL (s)->function)
|
|
|
2872 #define XSYMBOL_PLIST(s) (XSYMBOL (s)->plist)
|
|
|
2873
|
|
|
2874
|
|
442
|
2875 /*------------------------------- subr ---------------------------------*/
|
|
428
|
2876
|
|
853
|
2877 /* A function that takes no arguments and returns a Lisp_Object.
|
|
|
2878 We could define such types for n arguments, if needed. */
|
|
428
|
2879 typedef Lisp_Object (*lisp_fn_t) (void);
|
|
|
2880
|
|
|
2881 struct Lisp_Subr
|
|
|
2882 {
|
|
|
2883 struct lrecord_header lheader;
|
|
442
|
2884 short min_args;
|
|
|
2885 short max_args;
|
|
|
2886 const char *prompt;
|
|
|
2887 const char *doc;
|
|
|
2888 const char *name;
|
|
428
|
2889 lisp_fn_t subr_fn;
|
|
|
2890 };
|
|
|
2891 typedef struct Lisp_Subr Lisp_Subr;
|
|
|
2892
|
|
|
2893 DECLARE_LRECORD (subr, Lisp_Subr);
|
|
|
2894 #define XSUBR(x) XRECORD (x, subr, Lisp_Subr)
|
|
617
|
2895 #define wrap_subr(p) wrap_record (p, subr)
|
|
428
|
2896 #define SUBRP(x) RECORDP (x, subr)
|
|
|
2897 #define CHECK_SUBR(x) CHECK_RECORD (x, subr)
|
|
|
2898 #define CONCHECK_SUBR(x) CONCHECK_RECORD (x, subr)
|
|
|
2899
|
|
436
|
2900 #define subr_function(subr) ((subr)->subr_fn)
|
|
|
2901 #define SUBR_FUNCTION(subr,max_args) \
|
|
|
2902 ((Lisp_Object (*) (EXFUN_##max_args)) (subr)->subr_fn)
|
|
|
2903 #define subr_name(subr) ((subr)->name)
|
|
428
|
2904
|
|
442
|
2905 /*------------------------------ marker --------------------------------*/
|
|
|
2906
|
|
428
|
2907
|
|
440
|
2908 typedef struct Lisp_Marker Lisp_Marker;
|
|
428
|
2909 struct Lisp_Marker
|
|
|
2910 {
|
|
|
2911 struct lrecord_header lheader;
|
|
440
|
2912 Lisp_Marker *next;
|
|
|
2913 Lisp_Marker *prev;
|
|
428
|
2914 struct buffer *buffer;
|
|
665
|
2915 Membpos membpos;
|
|
428
|
2916 char insertion_type;
|
|
|
2917 };
|
|
|
2918
|
|
1632
|
2919 DECLARE_MODULE_API_LRECORD (marker, Lisp_Marker);
|
|
428
|
2920 #define XMARKER(x) XRECORD (x, marker, Lisp_Marker)
|
|
617
|
2921 #define wrap_marker(p) wrap_record (p, marker)
|
|
428
|
2922 #define MARKERP(x) RECORDP (x, marker)
|
|
|
2923 #define CHECK_MARKER(x) CHECK_RECORD (x, marker)
|
|
|
2924 #define CONCHECK_MARKER(x) CONCHECK_RECORD (x, marker)
|
|
|
2925
|
|
|
2926 /* The second check was looking for GCed markers still in use */
|
|
2500
|
2927 /* if (INTP (XMARKER (x)->lheader.next.v)) ABORT (); */
|
|
428
|
2928
|
|
|
2929 #define marker_next(m) ((m)->next)
|
|
|
2930 #define marker_prev(m) ((m)->prev)
|
|
|
2931
|
|
3063
|
2932 /*-------------------basic int (no connection to char)------------------*/
|
|
|
2933
|
|
|
2934 #define ZEROP(x) EQ (x, Qzero)
|
|
428
|
2935
|
|
800
|
2936 #ifdef ERROR_CHECK_TYPES
|
|
428
|
2937
|
|
3063
|
2938 #define XINT(x) XINT_1 (x, __FILE__, __LINE__)
|
|
|
2939
|
|
|
2940 DECLARE_INLINE_HEADER (
|
|
|
2941 EMACS_INT
|
|
|
2942 XINT_1 (Lisp_Object obj, const Ascbyte *file, int line)
|
|
|
2943 )
|
|
|
2944 {
|
|
|
2945 assert_at_line (INTP (obj), file, line);
|
|
|
2946 return XREALINT (obj);
|
|
|
2947 }
|
|
|
2948
|
|
|
2949 #else /* no error checking */
|
|
|
2950
|
|
|
2951 #define XINT(obj) XREALINT (obj)
|
|
|
2952
|
|
|
2953 #endif /* no error checking */
|
|
|
2954
|
|
|
2955 #define CHECK_INT(x) do { \
|
|
|
2956 if (!INTP (x)) \
|
|
|
2957 dead_wrong_type_argument (Qintegerp, x); \
|
|
|
2958 } while (0)
|
|
|
2959
|
|
|
2960 #define CONCHECK_INT(x) do { \
|
|
|
2961 if (!INTP (x)) \
|
|
|
2962 x = wrong_type_argument (Qintegerp, x); \
|
|
|
2963 } while (0)
|
|
|
2964
|
|
|
2965 #define NATNUMP(x) (INTP (x) && XINT (x) >= 0)
|
|
|
2966
|
|
|
2967 #define CHECK_NATNUM(x) do { \
|
|
|
2968 if (!NATNUMP (x)) \
|
|
|
2969 dead_wrong_type_argument (Qnatnump, x); \
|
|
|
2970 } while (0)
|
|
|
2971
|
|
|
2972 #define CONCHECK_NATNUM(x) do { \
|
|
|
2973 if (!NATNUMP (x)) \
|
|
|
2974 x = wrong_type_argument (Qnatnump, x); \
|
|
|
2975 } while (0)
|
|
|
2976
|
|
|
2977 /*------------------------------- char ---------------------------------*/
|
|
|
2978
|
|
|
2979 /* NOTE: There are basic functions for converting between a character and
|
|
|
2980 the string representation of a character in text.h, as well as lots of
|
|
|
2981 other character-related stuff. There are other functions/macros for
|
|
|
2982 working with Ichars in charset.h, for retrieving the charset of an
|
|
|
2983 Ichar, the length of an Ichar when converted to text, etc.
|
|
|
2984 */
|
|
|
2985
|
|
|
2986 #ifdef MULE
|
|
|
2987
|
|
|
2988 MODULE_API int non_ascii_valid_ichar_p (Ichar ch);
|
|
|
2989
|
|
|
2990 /* Return whether the given Ichar is valid.
|
|
|
2991 */
|
|
|
2992
|
|
|
2993 DECLARE_INLINE_HEADER (
|
|
|
2994 int
|
|
|
2995 valid_ichar_p (Ichar ch)
|
|
|
2996 )
|
|
|
2997 {
|
|
|
2998 return (! (ch & ~0xFF)) || non_ascii_valid_ichar_p (ch);
|
|
|
2999 }
|
|
|
3000
|
|
|
3001 #else /* not MULE */
|
|
|
3002
|
|
|
3003 /* This works when CH is negative, and correctly returns non-zero only when CH
|
|
|
3004 is in the range [0, 255], inclusive. */
|
|
|
3005 #define valid_ichar_p(ch) (! (ch & ~0xFF))
|
|
|
3006
|
|
|
3007 #endif /* not MULE */
|
|
|
3008
|
|
|
3009 #ifdef ERROR_CHECK_TYPES
|
|
|
3010
|
|
|
3011 DECLARE_INLINE_HEADER (
|
|
|
3012 int
|
|
|
3013 CHARP_1 (Lisp_Object obj, const Ascbyte *file, int line)
|
|
|
3014 )
|
|
|
3015 {
|
|
|
3016 if (XTYPE (obj) != Lisp_Type_Char)
|
|
|
3017 return 0;
|
|
|
3018 assert_at_line (valid_ichar_p (XCHARVAL (obj)), file, line);
|
|
|
3019 return 1;
|
|
|
3020 }
|
|
|
3021
|
|
|
3022 #define CHARP(x) CHARP_1 (x, __FILE__, __LINE__)
|
|
|
3023
|
|
826
|
3024 DECLARE_INLINE_HEADER (
|
|
867
|
3025 Ichar
|
|
2367
|
3026 XCHAR_1 (Lisp_Object obj, const Ascbyte *file, int line)
|
|
826
|
3027 )
|
|
428
|
3028 {
|
|
3063
|
3029 Ichar ch;
|
|
788
|
3030 assert_at_line (CHARP (obj), file, line);
|
|
3063
|
3031 ch = XCHARVAL (obj);
|
|
|
3032 assert_at_line (valid_ichar_p (ch), file, line);
|
|
|
3033 return ch;
|
|
428
|
3034 }
|
|
|
3035
|
|
788
|
3036 #define XCHAR(x) XCHAR_1 (x, __FILE__, __LINE__)
|
|
|
3037
|
|
3063
|
3038 #else /* not ERROR_CHECK_TYPES */
|
|
|
3039
|
|
|
3040 #define CHARP(x) (XTYPE (x) == Lisp_Type_Char)
|
|
|
3041 #define XCHAR(x) ((Ichar) XCHARVAL (x))
|
|
|
3042
|
|
|
3043 #endif /* (else) not ERROR_CHECK_TYPES */
|
|
|
3044
|
|
|
3045 #define CONCHECK_CHAR(x) do { \
|
|
|
3046 if (!CHARP (x)) \
|
|
|
3047 x = wrong_type_argument (Qcharacterp, x); \
|
|
|
3048 } while (0)
|
|
|
3049
|
|
|
3050 #define CHECK_CHAR(x) do { \
|
|
|
3051 if (!CHARP (x)) \
|
|
|
3052 dead_wrong_type_argument (Qcharacterp, x); \
|
|
|
3053 } while (0)
|
|
|
3054
|
|
|
3055
|
|
|
3056 DECLARE_INLINE_HEADER (
|
|
|
3057 Lisp_Object
|
|
|
3058 make_char (Ichar val)
|
|
|
3059 )
|
|
|
3060 {
|
|
|
3061 type_checking_assert (valid_ichar_p (val));
|
|
|
3062 /* This is defined in lisp-union.h or lisp-disunion.h */
|
|
|
3063 return make_char_1 (val);
|
|
|
3064 }
|
|
|
3065
|
|
|
3066 /*------------------------- int-char connection ------------------------*/
|
|
|
3067
|
|
|
3068 #ifdef ERROR_CHECK_TYPES
|
|
|
3069
|
|
|
3070 #define XCHAR_OR_INT(x) XCHAR_OR_INT_1 (x, __FILE__, __LINE__)
|
|
|
3071
|
|
|
3072 DECLARE_INLINE_HEADER (
|
|
|
3073 EMACS_INT
|
|
|
3074 XCHAR_OR_INT_1 (Lisp_Object obj, const Ascbyte *file, int line)
|
|
|
3075 )
|
|
|
3076 {
|
|
|
3077 assert_at_line (INTP (obj) || CHARP (obj), file, line);
|
|
|
3078 return CHARP (obj) ? XCHAR (obj) : XINT (obj);
|
|
|
3079 }
|
|
|
3080
|
|
788
|
3081 #else /* no error checking */
|
|
|
3082
|
|
3063
|
3083 #define XCHAR_OR_INT(obj) (CHARP (obj) ? XCHAR (obj) : XINT (obj))
|
|
788
|
3084
|
|
|
3085 #endif /* no error checking */
|
|
428
|
3086
|
|
3063
|
3087 /* True of X is an integer whose value is the valid integral equivalent of a
|
|
|
3088 character. */
|
|
|
3089
|
|
|
3090 #define CHAR_INTP(x) (INTP (x) && valid_ichar_p (XINT (x)))
|
|
|
3091
|
|
|
3092 /* True of X is a character or an integral value that can be converted into a
|
|
|
3093 character. */
|
|
|
3094 #define CHAR_OR_CHAR_INTP(x) (CHARP (x) || CHAR_INTP (x))
|
|
|
3095
|
|
|
3096 DECLARE_INLINE_HEADER (
|
|
|
3097 Ichar
|
|
|
3098 XCHAR_OR_CHAR_INT (Lisp_Object obj)
|
|
|
3099 )
|
|
|
3100 {
|
|
|
3101 return CHARP (obj) ? XCHAR (obj) : XINT (obj);
|
|
|
3102 }
|
|
|
3103
|
|
|
3104 /* Signal an error if CH is not a valid character or integer Lisp_Object.
|
|
|
3105 If CH is an integer Lisp_Object, convert it to a character Lisp_Object,
|
|
|
3106 but merely by repackaging, without performing tests for char validity.
|
|
|
3107 */
|
|
|
3108
|
|
|
3109 #define CHECK_CHAR_COERCE_INT(x) do { \
|
|
|
3110 if (CHARP (x)) \
|
|
|
3111 ; \
|
|
|
3112 else if (CHAR_INTP (x)) \
|
|
|
3113 x = make_char (XINT (x)); \
|
|
|
3114 else \
|
|
|
3115 x = wrong_type_argument (Qcharacterp, x); \
|
|
|
3116 } while (0)
|
|
|
3117
|
|
|
3118 /* next three always continuable because they coerce their arguments. */
|
|
|
3119 #define CHECK_INT_COERCE_CHAR(x) do { \
|
|
|
3120 if (INTP (x)) \
|
|
|
3121 ; \
|
|
|
3122 else if (CHARP (x)) \
|
|
|
3123 x = make_int (XCHAR (x)); \
|
|
|
3124 else \
|
|
|
3125 x = wrong_type_argument (Qinteger_or_char_p, x); \
|
|
|
3126 } while (0)
|
|
|
3127
|
|
|
3128 #define CHECK_INT_COERCE_MARKER(x) do { \
|
|
|
3129 if (INTP (x)) \
|
|
|
3130 ; \
|
|
|
3131 else if (MARKERP (x)) \
|
|
|
3132 x = make_int (marker_position (x)); \
|
|
|
3133 else \
|
|
|
3134 x = wrong_type_argument (Qinteger_or_marker_p, x); \
|
|
|
3135 } while (0)
|
|
|
3136
|
|
|
3137 #define CHECK_INT_COERCE_CHAR_OR_MARKER(x) do { \
|
|
|
3138 if (INTP (x)) \
|
|
|
3139 ; \
|
|
|
3140 else if (CHARP (x)) \
|
|
|
3141 x = make_int (XCHAR (x)); \
|
|
|
3142 else if (MARKERP (x)) \
|
|
|
3143 x = make_int (marker_position (x)); \
|
|
|
3144 else \
|
|
|
3145 x = wrong_type_argument (Qinteger_char_or_marker_p, x); \
|
|
|
3146 } while (0)
|
|
428
|
3147
|
|
442
|
3148 /*------------------------------ float ---------------------------------*/
|
|
428
|
3149
|
|
|
3150 /* Note: the 'unused_next_' field exists only to ensure that the
|
|
|
3151 `next' pointer fits within the structure, for the purposes of the
|
|
|
3152 free list. This makes a difference in the unlikely case of
|
|
|
3153 sizeof(double) being smaller than sizeof(void *). */
|
|
|
3154
|
|
|
3155 struct Lisp_Float
|
|
|
3156 {
|
|
|
3157 struct lrecord_header lheader;
|
|
|
3158 union { double d; struct Lisp_Float *unused_next_; } data;
|
|
|
3159 };
|
|
|
3160 typedef struct Lisp_Float Lisp_Float;
|
|
|
3161
|
|
|
3162 DECLARE_LRECORD (float, Lisp_Float);
|
|
|
3163 #define XFLOAT(x) XRECORD (x, float, Lisp_Float)
|
|
617
|
3164 #define wrap_float(p) wrap_record (p, float)
|
|
428
|
3165 #define FLOATP(x) RECORDP (x, float)
|
|
|
3166 #define CHECK_FLOAT(x) CHECK_RECORD (x, float)
|
|
|
3167 #define CONCHECK_FLOAT(x) CONCHECK_RECORD (x, float)
|
|
|
3168
|
|
|
3169 #define float_data(f) ((f)->data.d)
|
|
|
3170 #define XFLOAT_DATA(x) float_data (XFLOAT (x))
|
|
|
3171
|
|
|
3172 #define XFLOATINT(n) extract_float (n)
|
|
|
3173
|
|
|
3174 #define CHECK_INT_OR_FLOAT(x) do { \
|
|
|
3175 if (!INT_OR_FLOATP (x)) \
|
|
|
3176 dead_wrong_type_argument (Qnumberp, x); \
|
|
|
3177 } while (0)
|
|
|
3178
|
|
|
3179 #define CONCHECK_INT_OR_FLOAT(x) do { \
|
|
|
3180 if (!INT_OR_FLOATP (x)) \
|
|
|
3181 x = wrong_type_argument (Qnumberp, x); \
|
|
|
3182 } while (0)
|
|
|
3183
|
|
|
3184 # define INT_OR_FLOATP(x) (INTP (x) || FLOATP (x))
|
|
|
3185
|
|
442
|
3186 /*--------------------------- readonly objects -------------------------*/
|
|
440
|
3187
|
|
2720
|
3188 #ifndef MC_ALLOC
|
|
428
|
3189 #define CHECK_C_WRITEABLE(obj) \
|
|
|
3190 do { if (c_readonly (obj)) c_write_error (obj); } while (0)
|
|
|
3191
|
|
2720
|
3192 #define C_READONLY(obj) (C_READONLY_RECORD_HEADER_P(XRECORD_LHEADER (obj)))
|
|
|
3193 #endif /* not MC_ALLOC */
|
|
|
3194
|
|
428
|
3195 #define CHECK_LISP_WRITEABLE(obj) \
|
|
|
3196 do { if (lisp_readonly (obj)) lisp_write_error (obj); } while (0)
|
|
|
3197
|
|
|
3198 #define LISP_READONLY(obj) (LISP_READONLY_RECORD_HEADER_P(XRECORD_LHEADER (obj)))
|
|
|
3199
|
|
980
|
3200 /*----------------------------- structures ----------------------------*/
|
|
428
|
3201
|
|
|
3202 typedef struct structure_keyword_entry structure_keyword_entry;
|
|
|
3203 struct structure_keyword_entry
|
|
|
3204 {
|
|
|
3205 Lisp_Object keyword;
|
|
|
3206 int (*validate) (Lisp_Object keyword, Lisp_Object value,
|
|
578
|
3207 Error_Behavior errb);
|
|
428
|
3208 };
|
|
|
3209
|
|
|
3210 typedef struct
|
|
|
3211 {
|
|
|
3212 Dynarr_declare (structure_keyword_entry);
|
|
|
3213 } structure_keyword_entry_dynarr;
|
|
|
3214
|
|
|
3215 typedef struct structure_type structure_type;
|
|
|
3216 struct structure_type
|
|
|
3217 {
|
|
|
3218 Lisp_Object type;
|
|
|
3219 structure_keyword_entry_dynarr *keywords;
|
|
578
|
3220 int (*validate) (Lisp_Object data, Error_Behavior errb);
|
|
428
|
3221 Lisp_Object (*instantiate) (Lisp_Object data);
|
|
|
3222 };
|
|
|
3223
|
|
|
3224 typedef struct
|
|
|
3225 {
|
|
|
3226 Dynarr_declare (structure_type);
|
|
|
3227 } structure_type_dynarr;
|
|
|
3228
|
|
|
3229 struct structure_type *define_structure_type (Lisp_Object type,
|
|
|
3230 int (*validate)
|
|
|
3231 (Lisp_Object data,
|
|
578
|
3232 Error_Behavior errb),
|
|
428
|
3233 Lisp_Object (*instantiate)
|
|
|
3234 (Lisp_Object data));
|
|
|
3235 void define_structure_type_keyword (struct structure_type *st,
|
|
|
3236 Lisp_Object keyword,
|
|
|
3237 int (*validate) (Lisp_Object keyword,
|
|
|
3238 Lisp_Object value,
|
|
578
|
3239 Error_Behavior errb));
|
|
428
|
3240
|
|
858
|
3241 /*---------------------------- weak boxes ------------------------------*/
|
|
|
3242
|
|
|
3243 struct weak_box
|
|
|
3244 {
|
|
3017
|
3245 struct LCRECORD_HEADER header;
|
|
858
|
3246 Lisp_Object value;
|
|
|
3247
|
|
|
3248 Lisp_Object next_weak_box; /* don't mark through this! */
|
|
|
3249 };
|
|
|
3250
|
|
|
3251 void prune_weak_boxes (void);
|
|
|
3252 Lisp_Object make_weak_box (Lisp_Object value);
|
|
|
3253 Lisp_Object weak_box_ref (Lisp_Object value);
|
|
|
3254
|
|
|
3255 DECLARE_LRECORD (weak_box, struct weak_box);
|
|
|
3256 #define XWEAK_BOX(x) XRECORD (x, weak_box, struct weak_box)
|
|
|
3257 #define XSET_WEAK_BOX(x, v) (XWEAK_BOX (x)->value = (v))
|
|
|
3258 #define wrap_weak_box(p) wrap_record (p, weak_box)
|
|
|
3259 #define WEAK_BOXP(x) RECORDP (x, weak_box)
|
|
|
3260 #define CHECK_WEAK_BOX(x) CHECK_RECORD (x, weak_box)
|
|
|
3261 #define CONCHECK_WEAK_BOX(x) CONCHECK_RECORD (x, weak_box)
|
|
|
3262
|
|
888
|
3263 /*--------------------------- ephemerons ----------------------------*/
|
|
|
3264
|
|
|
3265 struct ephemeron
|
|
|
3266 {
|
|
3017
|
3267 struct LCRECORD_HEADER header;
|
|
888
|
3268
|
|
|
3269 Lisp_Object key;
|
|
|
3270
|
|
|
3271 /* This field holds a pair. The cdr of this cons points to the next
|
|
|
3272 ephemeron in Vall_ephemerons. The car points to another pair
|
|
|
3273 whose car is the value and whose cdr is the finalizer.
|
|
|
3274
|
|
|
3275 This representation makes it very easy to unlink an ephemeron
|
|
|
3276 from Vall_ephemerons and chain it into
|
|
|
3277 Vall_ephemerons_to_finalize. */
|
|
|
3278
|
|
|
3279 Lisp_Object cons_chain;
|
|
|
3280
|
|
|
3281 Lisp_Object value;
|
|
|
3282 };
|
|
|
3283
|
|
|
3284 void prune_ephemerons (void);
|
|
|
3285 Lisp_Object ephemeron_value(Lisp_Object ephi);
|
|
1590
|
3286 void init_marking_ephemerons(void);
|
|
|
3287 int continue_marking_ephemerons(void);
|
|
888
|
3288 int finish_marking_ephemerons(void);
|
|
|
3289 Lisp_Object zap_finalize_list(void);
|
|
|
3290 Lisp_Object make_ephemeron(Lisp_Object key, Lisp_Object value, Lisp_Object finalizer);
|
|
|
3291
|
|
|
3292 DECLARE_LRECORD(ephemeron, struct ephemeron);
|
|
|
3293 #define XEPHEMERON(x) XRECORD (x, ephemeron, struct ephemeron)
|
|
|
3294 #define XEPHEMERON_REF(x) (XEPHEMERON (x)->value)
|
|
|
3295 #define XEPHEMERON_NEXT(x) (XCDR (XEPHEMERON(x)->cons_chain))
|
|
|
3296 #define XEPHEMERON_FINALIZER(x) (XCDR (XCAR (XEPHEMERON (x)->cons_chain)))
|
|
|
3297 #define XSET_EPHEMERON_NEXT(x, n) (XSETCDR (XEPHEMERON(x)->cons_chain, n))
|
|
|
3298 #define XSET_EPHEMERON_VALUE(x, v) (XEPHEMERON(x)->value = (v))
|
|
|
3299 #define XSET_EPHEMERON_KEY(x, k) (XEPHEMERON(x)->key = (k))
|
|
|
3300 #define wrap_ephemeron(p) wrap_record (p, ephemeron)
|
|
|
3301 #define EPHEMERONP(x) RECORDP (x, ephemeron)
|
|
|
3302 #define CHECK_EPHEMERON(x) CHECK_RECORD (x, ephemeron)
|
|
|
3303 #define CONCHECK_EPHEMERON(x) CONCHECK_RECORD (x, ephemeron)
|
|
|
3304
|
|
858
|
3305
|
|
442
|
3306 /*---------------------------- weak lists ------------------------------*/
|
|
428
|
3307
|
|
|
3308 enum weak_list_type
|
|
|
3309 {
|
|
|
3310 /* element disappears if it's unmarked. */
|
|
|
3311 WEAK_LIST_SIMPLE,
|
|
|
3312 /* element disappears if it's a cons and either its car or
|
|
|
3313 cdr is unmarked. */
|
|
|
3314 WEAK_LIST_ASSOC,
|
|
|
3315 /* element disappears if it's a cons and its car is unmarked. */
|
|
|
3316 WEAK_LIST_KEY_ASSOC,
|
|
|
3317 /* element disappears if it's a cons and its cdr is unmarked. */
|
|
442
|
3318 WEAK_LIST_VALUE_ASSOC,
|
|
|
3319 /* element disappears if it's a cons and neither its car nor
|
|
|
3320 its cdr is marked. */
|
|
|
3321 WEAK_LIST_FULL_ASSOC
|
|
428
|
3322 };
|
|
|
3323
|
|
|
3324 struct weak_list
|
|
|
3325 {
|
|
3017
|
3326 struct LCRECORD_HEADER header;
|
|
428
|
3327 Lisp_Object list; /* don't mark through this! */
|
|
|
3328 enum weak_list_type type;
|
|
|
3329 Lisp_Object next_weak; /* don't mark through this! */
|
|
|
3330 };
|
|
|
3331
|
|
|
3332 DECLARE_LRECORD (weak_list, struct weak_list);
|
|
|
3333 #define XWEAK_LIST(x) XRECORD (x, weak_list, struct weak_list)
|
|
617
|
3334 #define wrap_weak_list(p) wrap_record (p, weak_list)
|
|
428
|
3335 #define WEAK_LISTP(x) RECORDP (x, weak_list)
|
|
|
3336 #define CHECK_WEAK_LIST(x) CHECK_RECORD (x, weak_list)
|
|
|
3337 #define CONCHECK_WEAK_LIST(x) CONCHECK_RECORD (x, weak_list)
|
|
|
3338
|
|
|
3339 #define weak_list_list(w) ((w)->list)
|
|
|
3340 #define XWEAK_LIST_LIST(w) (XWEAK_LIST (w)->list)
|
|
|
3341
|
|
|
3342 Lisp_Object make_weak_list (enum weak_list_type type);
|
|
|
3343 /* The following two are only called by the garbage collector */
|
|
|
3344 int finish_marking_weak_lists (void);
|
|
|
3345 void prune_weak_lists (void);
|
|
|
3346
|
|
1743
|
3347 END_C_DECLS
|
|
428
|
3348
|
|
|
3349 /************************************************************************/
|
|
771
|
3350 /* Definitions related to the format of text and of characters */
|
|
|
3351 /************************************************************************/
|
|
|
3352
|
|
|
3353 /* Note:
|
|
|
3354
|
|
|
3355 "internally formatted text" and the term "internal format" in
|
|
|
3356 general are likely to refer to the format of text in buffers and
|
|
|
3357 strings; "externally formatted text" and the term "external format"
|
|
|
3358 refer to any text format used in the O.S. or elsewhere outside of
|
|
|
3359 XEmacs. The format of text and of a character are related and
|
|
|
3360 there must be a one-to-one relationship (hopefully through a
|
|
|
3361 relatively simple algorithmic means of conversion) between a string
|
|
|
3362 of text and an equivalent array of characters, but the conversion
|
|
|
3363 between the two is NOT necessarily trivial.
|
|
|
3364
|
|
|
3365 In a non-Mule XEmacs, allowed characters are numbered 0 through
|
|
|
3366 255, where no fixed meaning is assigned to them, but (when
|
|
|
3367 representing text, rather than bytes in a binary file) in practice
|
|
|
3368 the lower half represents ASCII and the upper half some other 8-bit
|
|
|
3369 character set (chosen by setting the font, case tables, syntax
|
|
|
3370 tables, etc. appropriately for the character set through ad-hoc
|
|
|
3371 means such as the `iso-8859-1' file and the
|
|
|
3372 `standard-display-european' function).
|
|
|
3373
|
|
|
3374 #### Finish this.
|
|
|
3375
|
|
|
3376 */
|
|
|
3377 #include "text.h"
|
|
|
3378
|
|
|
3379
|
|
|
3380 /************************************************************************/
|
|
428
|
3381 /* Definitions of primitive Lisp functions and variables */
|
|
|
3382 /************************************************************************/
|
|
|
3383
|
|
|
3384
|
|
|
3385 /* DEFUN - Define a built-in Lisp-visible C function or `subr'.
|
|
|
3386 `lname' should be the name to give the function in Lisp,
|
|
|
3387 as a null-terminated C string.
|
|
|
3388 `Fname' should be the C equivalent of `lname', using only characters
|
|
|
3389 valid in a C identifier, with an "F" prepended.
|
|
|
3390 The name of the C constant structure that records information
|
|
|
3391 on this function for internal use is "S" concatenated with Fname.
|
|
|
3392 `min_args' should be a number, the minimum number of arguments allowed.
|
|
|
3393 `max_args' should be a number, the maximum number of arguments allowed,
|
|
|
3394 or else MANY or UNEVALLED.
|
|
|
3395 MANY means pass a vector of evaluated arguments,
|
|
|
3396 in the form of an integer number-of-arguments
|
|
|
3397 followed by the address of a vector of Lisp_Objects
|
|
|
3398 which contains the argument values.
|
|
|
3399 UNEVALLED means pass the list of unevaluated arguments.
|
|
|
3400 `prompt' says how to read arguments for an interactive call.
|
|
|
3401 See the doc string for `interactive'.
|
|
|
3402 A null string means call interactively with no arguments.
|
|
|
3403 `arglist' are the comma-separated arguments (always Lisp_Objects) for
|
|
|
3404 the function.
|
|
|
3405 The docstring for the function is placed as a "C" comment between
|
|
|
3406 the prompt and the `args' argument. make-docfile reads the
|
|
|
3407 comment and creates the DOC file from it.
|
|
|
3408 */
|
|
|
3409
|
|
|
3410 #define EXFUN_0 void
|
|
|
3411 #define EXFUN_1 Lisp_Object
|
|
|
3412 #define EXFUN_2 Lisp_Object,Lisp_Object
|
|
|
3413 #define EXFUN_3 Lisp_Object,Lisp_Object,Lisp_Object
|
|
|
3414 #define EXFUN_4 Lisp_Object,Lisp_Object,Lisp_Object,Lisp_Object
|
|
|
3415 #define EXFUN_5 Lisp_Object,Lisp_Object,Lisp_Object,Lisp_Object,Lisp_Object
|
|
|
3416 #define EXFUN_6 Lisp_Object,Lisp_Object,Lisp_Object,Lisp_Object,Lisp_Object, \
|
|
|
3417 Lisp_Object
|
|
|
3418 #define EXFUN_7 Lisp_Object,Lisp_Object,Lisp_Object,Lisp_Object,Lisp_Object, \
|
|
|
3419 Lisp_Object,Lisp_Object
|
|
|
3420 #define EXFUN_8 Lisp_Object,Lisp_Object,Lisp_Object,Lisp_Object,Lisp_Object, \
|
|
|
3421 Lisp_Object,Lisp_Object,Lisp_Object
|
|
|
3422 #define EXFUN_MANY int, Lisp_Object*
|
|
|
3423 #define EXFUN_UNEVALLED Lisp_Object
|
|
|
3424 #define EXFUN(sym, max_args) Lisp_Object sym (EXFUN_##max_args)
|
|
2268
|
3425 #define EXFUN_NORETURN(sym, max_args) \
|
|
|
3426 DECLARE_DOESNT_RETURN_TYPE (Lisp_Object, sym (EXFUN_##max_args))
|
|
428
|
3427
|
|
|
3428 #define SUBR_MAX_ARGS 8
|
|
|
3429 #define MANY -2
|
|
|
3430 #define UNEVALLED -1
|
|
|
3431
|
|
|
3432 /* Can't be const, because then subr->doc is read-only and
|
|
|
3433 Snarf_documentation chokes */
|
|
|
3434
|
|
2720
|
3435 #ifdef MC_ALLOC
|
|
|
3436 #define DEFUN(lname, Fname, min_args, max_args, prompt, arglist) \
|
|
|
3437 Lisp_Object Fname (EXFUN_##max_args); \
|
|
|
3438 static struct Lisp_Subr MC_ALLOC_S##Fname = \
|
|
|
3439 { \
|
|
|
3440 { /* struct lrecord_header */ \
|
|
|
3441 lrecord_type_subr, /* lrecord_type_index */ \
|
|
|
3442 1, /* lisp_readonly bit */ \
|
|
|
3443 0, /* free */ \
|
|
|
3444 0 /* uid */ \
|
|
|
3445 }, \
|
|
|
3446 min_args, \
|
|
|
3447 max_args, \
|
|
|
3448 prompt, \
|
|
|
3449 0, /* doc string */ \
|
|
|
3450 lname, \
|
|
|
3451 (lisp_fn_t) Fname \
|
|
|
3452 }; \
|
|
2814
|
3453 static struct Lisp_Subr *S##Fname; \
|
|
2720
|
3454 Lisp_Object Fname (DEFUN_##max_args arglist)
|
|
|
3455
|
|
|
3456 #define DEFUN_NORETURN(lname, Fname, min_args, max_args, prompt, arglist) \
|
|
|
3457 DECLARE_DOESNT_RETURN_TYPE (Lisp_Object, Fname (EXFUN_##max_args)); \
|
|
|
3458 static struct Lisp_Subr MC_ALLOC_S##Fname = \
|
|
|
3459 { \
|
|
|
3460 { /* struct lrecord_header */ \
|
|
|
3461 lrecord_type_subr, /* lrecord_type_index */ \
|
|
|
3462 1, /* lisp_readonly bit */ \
|
|
|
3463 0, /* free */ \
|
|
|
3464 0 /* uid */ \
|
|
|
3465 }, \
|
|
|
3466 min_args, \
|
|
|
3467 max_args, \
|
|
|
3468 prompt, \
|
|
|
3469 0, /* doc string */ \
|
|
|
3470 lname, \
|
|
|
3471 (lisp_fn_t) Fname \
|
|
|
3472 }; \
|
|
2814
|
3473 static struct Lisp_Subr *S##Fname; \
|
|
2720
|
3474 DOESNT_RETURN_TYPE (Lisp_Object) Fname (DEFUN_##max_args arglist)
|
|
2834
|
3475 #define GET_DEFUN_LISP_OBJECT(Fname) \
|
|
|
3476 wrap_subr (S##Fname);
|
|
2720
|
3477 #else /* not MC_ALLOC */
|
|
428
|
3478 #define DEFUN(lname, Fname, min_args, max_args, prompt, arglist) \
|
|
|
3479 Lisp_Object Fname (EXFUN_##max_args); \
|
|
442
|
3480 static struct Lisp_Subr S##Fname = \
|
|
|
3481 { \
|
|
|
3482 { /* struct lrecord_header */ \
|
|
|
3483 lrecord_type_subr, /* lrecord_type_index */ \
|
|
|
3484 1, /* mark bit */ \
|
|
|
3485 1, /* c_readonly bit */ \
|
|
1111
|
3486 1, /* lisp_readonly bit */ \
|
|
|
3487 0 /* unused */ \
|
|
442
|
3488 }, \
|
|
|
3489 min_args, \
|
|
|
3490 max_args, \
|
|
|
3491 prompt, \
|
|
|
3492 0, /* doc string */ \
|
|
|
3493 lname, \
|
|
|
3494 (lisp_fn_t) Fname \
|
|
|
3495 }; \
|
|
428
|
3496 Lisp_Object Fname (DEFUN_##max_args arglist)
|
|
|
3497
|
|
2268
|
3498 #define DEFUN_NORETURN(lname, Fname, min_args, max_args, prompt, arglist) \
|
|
|
3499 DECLARE_DOESNT_RETURN_TYPE (Lisp_Object, Fname (EXFUN_##max_args)); \
|
|
|
3500 static struct Lisp_Subr S##Fname = \
|
|
|
3501 { \
|
|
|
3502 { /* struct lrecord_header */ \
|
|
|
3503 lrecord_type_subr, /* lrecord_type_index */ \
|
|
|
3504 1, /* mark bit */ \
|
|
|
3505 1, /* c_readonly bit */ \
|
|
|
3506 1, /* lisp_readonly bit */ \
|
|
|
3507 0 /* unused */ \
|
|
|
3508 }, \
|
|
|
3509 min_args, \
|
|
|
3510 max_args, \
|
|
|
3511 prompt, \
|
|
|
3512 0, /* doc string */ \
|
|
|
3513 lname, \
|
|
|
3514 (lisp_fn_t) Fname \
|
|
|
3515 }; \
|
|
|
3516 DOESNT_RETURN_TYPE (Lisp_Object) Fname (DEFUN_##max_args arglist)
|
|
2834
|
3517 #define GET_DEFUN_LISP_OBJECT(Fname) \
|
|
|
3518 wrap_subr (&S##Fname);
|
|
2720
|
3519 #endif /* not MC_ALLOC */
|
|
2268
|
3520
|
|
428
|
3521 /* Heavy ANSI C preprocessor hackery to get DEFUN to declare a
|
|
|
3522 prototype that matches max_args, and add the obligatory
|
|
|
3523 `Lisp_Object' type declaration to the formal C arguments. */
|
|
|
3524
|
|
|
3525 #define DEFUN_MANY(named_int, named_Lisp_Object) named_int, named_Lisp_Object
|
|
|
3526 #define DEFUN_UNEVALLED(args) Lisp_Object args
|
|
|
3527 #define DEFUN_0() void
|
|
|
3528 #define DEFUN_1(a) Lisp_Object a
|
|
|
3529 #define DEFUN_2(a,b) DEFUN_1(a), Lisp_Object b
|
|
|
3530 #define DEFUN_3(a,b,c) DEFUN_2(a,b), Lisp_Object c
|
|
|
3531 #define DEFUN_4(a,b,c,d) DEFUN_3(a,b,c), Lisp_Object d
|
|
|
3532 #define DEFUN_5(a,b,c,d,e) DEFUN_4(a,b,c,d), Lisp_Object e
|
|
|
3533 #define DEFUN_6(a,b,c,d,e,f) DEFUN_5(a,b,c,d,e), Lisp_Object f
|
|
|
3534 #define DEFUN_7(a,b,c,d,e,f,g) DEFUN_6(a,b,c,d,e,f), Lisp_Object g
|
|
|
3535 #define DEFUN_8(a,b,c,d,e,f,g,h) DEFUN_7(a,b,c,d,e,f,g),Lisp_Object h
|
|
|
3536
|
|
|
3537 /* WARNING: If you add defines here for higher values of max_args,
|
|
|
3538 make sure to also fix the clauses in PRIMITIVE_FUNCALL(),
|
|
|
3539 and change the define of SUBR_MAX_ARGS above. */
|
|
|
3540
|
|
|
3541 #include "symeval.h"
|
|
|
3542
|
|
1743
|
3543 BEGIN_C_DECLS
|
|
1650
|
3544
|
|
428
|
3545 /* `specpdl' is the special binding/unwind-protect stack.
|
|
|
3546
|
|
|
3547 Knuth says (see the Jargon File):
|
|
|
3548 At MIT, `pdl' [abbreviation for `Push Down List'] used to
|
|
|
3549 be a more common synonym for `stack'.
|
|
|
3550 Everywhere else `stack' seems to be the preferred term.
|
|
|
3551
|
|
|
3552 specpdl_depth is the current depth of `specpdl'.
|
|
771
|
3553 Save this for use later as arg to `unbind_to_1'. */
|
|
1632
|
3554 extern MODULE_API int specpdl_depth_counter;
|
|
428
|
3555 #define specpdl_depth() specpdl_depth_counter
|
|
|
3556
|
|
442
|
3557
|
|
|
3558 #define CHECK_FUNCTION(fun) do { \
|
|
|
3559 while (NILP (Ffunctionp (fun))) \
|
|
|
3560 signal_invalid_function_error (fun); \
|
|
|
3561 } while (0)
|
|
|
3562
|
|
428
|
3563
|
|
|
3564 /************************************************************************/
|
|
|
3565 /* Checking for QUIT */
|
|
|
3566 /************************************************************************/
|
|
|
3567
|
|
1123
|
3568 /* NOTE NOTE NOTE: Invoking QUIT can cause random Lisp code to be executed!
|
|
|
3569 This can happen in numerous ways. For example, on many platforms, QUIT
|
|
|
3570 needs to drain the event queue to see whether there's a C-g in the works.
|
|
|
3571 A side effect of this is that, if there's a menu-press event, menu filters
|
|
|
3572 (i.e. Lisp code) will be invoked. Lisp code could also happen if there's
|
|
|
3573 an asynchronous timeout, or if the debugger is invoked as a result of
|
|
|
3574 debug-on-quit and the user returns by hitting `r', etc. etc.
|
|
|
3575
|
|
|
3576 However, GC CANNOT HAPPEN. It is forbidden everywhere within the QUIT-
|
|
|
3577 processing code, because most callers cannot tolerate GC during QUIT
|
|
|
3578 since it's just too prevalent. */
|
|
|
3579
|
|
853
|
3580 /* The exact workings of this mechanism are described in detail in signal.c. */
|
|
|
3581
|
|
428
|
3582 /* Asynchronous events set something_happened, and then are processed
|
|
|
3583 within the QUIT macro. At this point, we are guaranteed to not be in
|
|
|
3584 any sensitive code. */
|
|
|
3585
|
|
1632
|
3586 extern MODULE_API volatile int something_happened;
|
|
|
3587 extern MODULE_API int dont_check_for_quit;
|
|
|
3588 MODULE_API void check_what_happened (void);
|
|
|
3589
|
|
|
3590 extern MODULE_API volatile int quit_check_signal_happened;
|
|
428
|
3591 extern volatile int quit_check_signal_tick_count;
|
|
1632
|
3592 MODULE_API void check_quit (void);
|
|
|
3593
|
|
|
3594 MODULE_API void signal_quit (void);
|
|
428
|
3595
|
|
853
|
3596 int begin_dont_check_for_quit (void);
|
|
|
3597 int begin_do_check_for_quit (void);
|
|
|
3598
|
|
|
3599 /* Nonzero if the values of `quit-flag' and `inhibit-quit' indicate
|
|
|
3600 that a quit should be signalled. */
|
|
771
|
3601 #define QUIT_FLAG_SAYS_SHOULD_QUIT \
|
|
|
3602 (!NILP (Vquit_flag) && \
|
|
|
3603 (NILP (Vinhibit_quit) \
|
|
|
3604 || (EQ (Vquit_flag, Qcritical) && !dont_check_for_quit)))
|
|
|
3605
|
|
853
|
3606 /* Nonzero if ought to quit now. This is the "efficient" version, which
|
|
|
3607 respects the flags set to indicate whether the full quit check should
|
|
|
3608 be done. Therefore it may be inaccurate (i.e. lagging reality), esp.
|
|
|
3609 when poll for quit is used.
|
|
|
3610
|
|
|
3611 This is defined for code that wants to allow quitting, but needs to
|
|
|
3612 do some cleanup if that happens. (You could always register the cleanup
|
|
|
3613 code using record_unwind_protect(), but sometimes it makes more sense
|
|
|
3614 to do it using QUITP.) To use this macro, just call it at the
|
|
|
3615 appropriate time, and if its value is non-zero, do your cleanup code
|
|
|
3616 and then call QUIT.
|
|
|
3617
|
|
|
3618 A different version (below) is used for the actual QUIT macro. */
|
|
428
|
3619 #define QUITP \
|
|
853
|
3620 ((quit_check_signal_happened ? check_quit () : (void) 0), \
|
|
771
|
3621 QUIT_FLAG_SAYS_SHOULD_QUIT)
|
|
428
|
3622
|
|
853
|
3623 /* This is the version actually called by QUIT. The difference
|
|
|
3624 between it and QUITP is that it also has side effects in that it
|
|
|
3625 will handle anything else that has recently signalled itself
|
|
|
3626 asynchronously and wants to be handled now. Currently this
|
|
|
3627 includes executing asynchronous timeouts that may have been set
|
|
|
3628 from Lisp or from the poll-for-quit or poll-for-sigchld
|
|
|
3629 timers. (#### It seems that, to be slightly more accurate, we
|
|
|
3630 should also process poll-for-quit timers in the above version.
|
|
|
3631 However, this mechanism is inherently approximate, so it really
|
|
|
3632 doesn't matter much.) In the future, it might also include doing a
|
|
|
3633 thread context switch. Callers of QUITP generally don't except
|
|
1123
|
3634 random side effects to happen (#### unfortunately, random side effects
|
|
|
3635 can happen anyway, e.g. through menu filters -- see comment above),
|
|
|
3636 so we have this different version. */
|
|
428
|
3637 #define INTERNAL_QUITP \
|
|
853
|
3638 ((something_happened ? check_what_happened () : (void) 0), \
|
|
771
|
3639 QUIT_FLAG_SAYS_SHOULD_QUIT)
|
|
428
|
3640
|
|
|
3641 /* Check quit-flag and quit if it is non-nil. Also do any other things
|
|
853
|
3642 that are triggered by asynchronous events and might want to be
|
|
|
3643 handled. */
|
|
428
|
3644 #define QUIT do { if (INTERNAL_QUITP) signal_quit (); } while (0)
|
|
|
3645
|
|
|
3646
|
|
|
3647 /************************************************************************/
|
|
|
3648 /* hashing */
|
|
|
3649 /************************************************************************/
|
|
|
3650
|
|
|
3651 /* #### for a 64-bit machine, we should substitute a prime just over 2^32 */
|
|
|
3652 #define GOOD_HASH 65599 /* prime number just over 2^16; Dragon book, p. 435 */
|
|
|
3653 #define HASH2(a,b) (GOOD_HASH * (a) + (b))
|
|
|
3654 #define HASH3(a,b,c) (GOOD_HASH * HASH2 (a,b) + (c))
|
|
|
3655 #define HASH4(a,b,c,d) (GOOD_HASH * HASH3 (a,b,c) + (d))
|
|
|
3656 #define HASH5(a,b,c,d,e) (GOOD_HASH * HASH4 (a,b,c,d) + (e))
|
|
|
3657 #define HASH6(a,b,c,d,e,f) (GOOD_HASH * HASH5 (a,b,c,d,e) + (f))
|
|
|
3658 #define HASH7(a,b,c,d,e,f,g) (GOOD_HASH * HASH6 (a,b,c,d,e,f) + (g))
|
|
|
3659 #define HASH8(a,b,c,d,e,f,g,h) (GOOD_HASH * HASH7 (a,b,c,d,e,f,g) + (h))
|
|
|
3660 #define HASH9(a,b,c,d,e,f,g,h,i) (GOOD_HASH * HASH8 (a,b,c,d,e,f,g,h) + (i))
|
|
|
3661
|
|
|
3662 #define LISP_HASH(obj) ((unsigned long) LISP_TO_VOID (obj))
|
|
2516
|
3663 Hashcode memory_hash (const void *xv, Bytecount size);
|
|
|
3664 Hashcode internal_hash (Lisp_Object obj, int depth);
|
|
|
3665 Hashcode internal_array_hash (Lisp_Object *arr, int size, int depth);
|
|
428
|
3666
|
|
|
3667
|
|
|
3668 /************************************************************************/
|
|
|
3669 /* String translation */
|
|
|
3670 /************************************************************************/
|
|
|
3671
|
|
771
|
3672 /* When support for message translation exists, GETTEXT() translates a
|
|
|
3673 string from English into the language defined by
|
|
|
3674 `current-language-environment'. This is done by looking the string
|
|
|
3675 up in a large predefined table; if no translation is found, the
|
|
|
3676 original string is returned, and the failure is possibly logged so
|
|
|
3677 that the translation can later be entered into the table.
|
|
|
3678
|
|
|
3679 In addition to this, there is a mechanism to snarf message strings
|
|
|
3680 out of the source code so that they can be entered into the tables.
|
|
|
3681 This is what make-msgfile.lex does.
|
|
|
3682
|
|
|
3683 Handling `format' strings is more difficult: The format string
|
|
|
3684 should get translated, but not under all circumstances. When the
|
|
|
3685 format string is a Lisp string, what should happen is that
|
|
|
3686 Fformat() should format the untranslated args[0] and return that,
|
|
|
3687 and also call Fgettext() on args[0] and, if that is different,
|
|
|
3688 format it and store it in the `string-translatable' property of the
|
|
|
3689 returned string. See Fgettext().
|
|
|
3690
|
|
|
3691 CGETTEXT() is the same as GETTEXT() but works with char * strings
|
|
867
|
3692 instead of Ibyte * strings.
|
|
771
|
3693
|
|
|
3694 build_msg_string() is a shorthand for build_string (GETTEXT (x)).
|
|
|
3695 build_msg_intstring() is a shorthand for build_intstring (GETTEXT (x)).
|
|
|
3696 */
|
|
|
3697
|
|
|
3698 #define GETTEXT(x) (x)
|
|
|
3699 #define CGETTEXT(x) (x)
|
|
|
3700 #define LISP_GETTEXT(x) (x)
|
|
428
|
3701
|
|
|
3702 /* DEFER_GETTEXT is used to identify strings which are translated when
|
|
|
3703 they are referenced instead of when they are defined.
|
|
|
3704 These include Qerror_messages and initialized arrays of strings.
|
|
|
3705 */
|
|
|
3706 #define DEFER_GETTEXT(x) (x)
|
|
|
3707
|
|
|
3708
|
|
|
3709 /************************************************************************/
|
|
|
3710 /* Garbage collection / GC-protection */
|
|
|
3711 /************************************************************************/
|
|
|
3712
|
|
|
3713 /* Structure for recording stack slots that need marking */
|
|
|
3714
|
|
|
3715 /* This is a chain of structures, each of which points at a Lisp_Object
|
|
|
3716 variable whose value should be marked in garbage collection.
|
|
|
3717 Normally every link of the chain is an automatic variable of a function,
|
|
|
3718 and its `val' points to some argument or local variable of the function.
|
|
|
3719 On exit to the function, the chain is set back to the value it had on
|
|
|
3720 entry. This way, no link remains in the chain when the stack frame
|
|
|
3721 containing the link disappears.
|
|
|
3722
|
|
|
3723 Every function that can call Feval must protect in this fashion all
|
|
|
3724 Lisp_Object variables whose contents will be used again. */
|
|
|
3725
|
|
1632
|
3726 extern MODULE_API struct gcpro *gcprolist;
|
|
428
|
3727
|
|
1743
|
3728 END_C_DECLS
|
|
1650
|
3729
|
|
1204
|
3730 /* #### Catching insufficient gcpro:
|
|
|
3731
|
|
|
3732 The C++ code below catches GCPRO without UNGCPRO or vice-versa.
|
|
|
3733 Catching cases where there's no GCPRO or UNGCPRO but should be, however,
|
|
|
3734 is much harder, but could be done:
|
|
|
3735
|
|
|
3736 1. Lisp_Object becomes a real object. Its creator and destructor need to
|
|
|
3737 figure out whether the object is on the stack (by looking at the range
|
|
|
3738 that `this' is within), and if so, add the pointer to a list of all
|
|
|
3739 stack-based Lisp_Objects.
|
|
|
3740
|
|
|
3741 2. The assignment method needs to do reference-counting on actual Lisp
|
|
|
3742 objects -- in particular, we need to know if there are any references
|
|
|
3743 to a Lisp object that are *NOT* from stack-based Lisp_Objects.
|
|
|
3744
|
|
|
3745 3. When we get to a point in the code where we might garbage collect --
|
|
|
3746 i.e. Ffuncall(), Feval(), or Fgarbage_collect() is called -- we look
|
|
|
3747 at our list of stack-based Lisp_Objects, and if there are any that
|
|
|
3748 point to Lisp objects with no non-stack references, see if there are
|
|
|
3749 any gcpros pointing to the object, and if not, set a flag indicating
|
|
|
3750 that the object is "destroyed". (Don't abort yet because the function
|
|
|
3751 might not use the object any more.)
|
|
|
3752
|
|
|
3753 4. When we detag a pointer using XFOO(), abort if its "destroyed" flag
|
|
|
3754 is set.
|
|
|
3755
|
|
|
3756 --ben
|
|
|
3757 */
|
|
|
3758
|
|
428
|
3759 struct gcpro
|
|
|
3760 {
|
|
|
3761 struct gcpro *next;
|
|
771
|
3762 const Lisp_Object *var; /* Address of first protected variable */
|
|
428
|
3763 int nvars; /* Number of consecutive protected variables */
|
|
1204
|
3764 #if defined (__cplusplus) && defined (ERROR_CHECK_GC)
|
|
|
3765 /* Try to catch GCPRO without UNGCPRO, or vice-versa. G++ complains (at
|
|
|
3766 least with sufficient numbers of warnings enabled, i.e. -Weffc++) if a
|
|
|
3767 copy constructor or assignment operator is not defined. */
|
|
|
3768 gcpro () : next (0), var (0), nvars (0) { }
|
|
|
3769 gcpro (const gcpro& g) : next (g.next), var (g.var), nvars (g.nvars) { }
|
|
|
3770 gcpro& operator= (const gcpro& g) { next = g.next; var = g.var;
|
|
|
3771 nvars = g.nvars;
|
|
|
3772 return *this;}
|
|
|
3773 ~gcpro () { assert (!next); }
|
|
|
3774 #endif /* defined (__cplusplus) && defined (ERROR_CHECK_GC) */
|
|
428
|
3775 };
|
|
|
3776
|
|
|
3777 /* Normally, you declare variables gcpro1, gcpro2, ... and use the
|
|
|
3778 GCPROn() macros. However, if you need to have nested gcpro's,
|
|
|
3779 declare ngcpro1, ngcpro2, ... and use NGCPROn(). If you need
|
|
|
3780 to nest another level, use nngcpro1, nngcpro2, ... and use
|
|
|
3781 NNGCPROn(). If you need to nest yet another level, create
|
|
|
3782 the appropriate macros. */
|
|
|
3783
|
|
1123
|
3784 /* NOTE: About comments like "This function does not GC": These are there to
|
|
|
3785 try to track whether GCPROing is necessary. Strictly speaking, some
|
|
|
3786 functions that say this might actually GC, but only when it is never
|
|
|
3787 possible to return (more specifically, in the process of signalling an
|
|
|
3788 error, the debugger may be invoked, and could GC). For GCPRO purposes,
|
|
|
3789 you only have to worry about functions that can GC and then return.
|
|
|
3790 The QUIT macro cannot GC any more, although this wasn't true at some point,
|
|
|
3791 and so some "This function can GC" comments may be inaccurate.
|
|
|
3792 */
|
|
|
3793
|
|
1743
|
3794 BEGIN_C_DECLS
|
|
1650
|
3795
|
|
2367
|
3796 #define XGCDECL1(x) struct gcpro x##cpro1
|
|
|
3797 #define XGCDECL2(x) struct gcpro x##cpro1, x##cpro2
|
|
|
3798 #define XGCDECL3(x) struct gcpro x##cpro1, x##cpro2, x##cpro3
|
|
|
3799 #define XGCDECL4(x) struct gcpro x##cpro1, x##cpro2, x##cpro3, x##cpro4
|
|
|
3800 #define XGCDECL5(x) struct gcpro x##cpro1, x##cpro2, x##cpro3, x##cpro4, x##cpro5
|
|
|
3801
|
|
428
|
3802 #ifdef DEBUG_GCPRO
|
|
|
3803
|
|
2367
|
3804 MODULE_API void debug_gcpro1 (Ascbyte *, int, struct gcpro *, Lisp_Object *);
|
|
|
3805 MODULE_API void debug_gcpro2 (Ascbyte *, int, struct gcpro *, struct gcpro *,
|
|
1632
|
3806 Lisp_Object *, Lisp_Object *);
|
|
2367
|
3807 MODULE_API void debug_gcpro3 (Ascbyte *, int, struct gcpro *, struct gcpro *,
|
|
1632
|
3808 struct gcpro *, Lisp_Object *, Lisp_Object *,
|
|
|
3809 Lisp_Object *);
|
|
2367
|
3810 MODULE_API void debug_gcpro4 (Ascbyte *, int, struct gcpro *, struct gcpro *,
|
|
1632
|
3811 struct gcpro *, struct gcpro *, Lisp_Object *,
|
|
|
3812 Lisp_Object *, Lisp_Object *, Lisp_Object *);
|
|
2367
|
3813 MODULE_API void debug_gcpro5 (Ascbyte *, int, struct gcpro *, struct gcpro *,
|
|
1632
|
3814 struct gcpro *, struct gcpro *, struct gcpro *,
|
|
|
3815 Lisp_Object *, Lisp_Object *, Lisp_Object *,
|
|
|
3816 Lisp_Object *, Lisp_Object *);
|
|
2367
|
3817 MODULE_API void debug_ungcpro(Ascbyte *, int, struct gcpro *);
|
|
|
3818
|
|
|
3819 #define XGCPRO1(x,v) \
|
|
|
3820 debug_gcpro1 (__FILE__, __LINE__,&x##cpro1,&v)
|
|
|
3821 #define XGCPRO2(x,v1,v2) \
|
|
|
3822 debug_gcpro2 (__FILE__, __LINE__,&x##cpro1,&x##cpro2,&v1,&v2)
|
|
|
3823 #define XGCPRO3(x,v1,v2,v3) \
|
|
|
3824 debug_gcpro3 (__FILE__, __LINE__,&x##cpro1,&x##cpro2,&x##cpro3, \
|
|
|
3825 &v1,&v2,&v3)
|
|
|
3826 #define XGCPRO4(x,v1,v2,v3,v4) \
|
|
|
3827 debug_gcpro4 (__FILE__, __LINE__,&x##cpro1,&x##cpro2,&x##cpro3, \
|
|
|
3828 &x##cpro4, \
|
|
428
|
3829 &v1,&v2,&v3,&v4)
|
|
2367
|
3830 #define XGCPRO5(x,v1,v2,v3,v4,v5) \
|
|
|
3831 debug_gcpro5 (__FILE__, __LINE__,&x##cpro1,&x##cpro2,&x##cpro3, \
|
|
|
3832 &x##cpro4,&x##cpro5, \
|
|
428
|
3833 &v1,&v2,&v3,&v4,&v5)
|
|
2367
|
3834 #define XUNGCPRO(x) \
|
|
|
3835 debug_ungcpro(__FILE__, __LINE__,&x##cpro1)
|
|
428
|
3836
|
|
|
3837 #else /* ! DEBUG_GCPRO */
|
|
|
3838
|
|
2367
|
3839 #define XGCPRO1(x, var1) ((void) ( \
|
|
|
3840 x##cpro1.next = gcprolist, x##cpro1.var = &var1, x##cpro1.nvars = 1, \
|
|
|
3841 gcprolist = &x##cpro1 ))
|
|
|
3842
|
|
|
3843 #define XGCPRO2(x, var1, var2) ((void) ( \
|
|
|
3844 x##cpro1.next = gcprolist, x##cpro1.var = &var1, x##cpro1.nvars = 1, \
|
|
|
3845 x##cpro2.next = &x##cpro1, x##cpro2.var = &var2, x##cpro2.nvars = 1, \
|
|
|
3846 gcprolist = &x##cpro2 ))
|
|
|
3847
|
|
|
3848 #define XGCPRO3(x, var1, var2, var3) ((void) ( \
|
|
|
3849 x##cpro1.next = gcprolist, x##cpro1.var = &var1, x##cpro1.nvars = 1, \
|
|
|
3850 x##cpro2.next = &x##cpro1, x##cpro2.var = &var2, x##cpro2.nvars = 1, \
|
|
|
3851 x##cpro3.next = &x##cpro2, x##cpro3.var = &var3, x##cpro3.nvars = 1, \
|
|
|
3852 gcprolist = &x##cpro3 ))
|
|
|
3853
|
|
|
3854 #define XGCPRO4(x, var1, var2, var3, var4) ((void) ( \
|
|
|
3855 x##cpro1.next = gcprolist, x##cpro1.var = &var1, x##cpro1.nvars = 1, \
|
|
|
3856 x##cpro2.next = &x##cpro1, x##cpro2.var = &var2, x##cpro2.nvars = 1, \
|
|
|
3857 x##cpro3.next = &x##cpro2, x##cpro3.var = &var3, x##cpro3.nvars = 1, \
|
|
|
3858 x##cpro4.next = &x##cpro3, x##cpro4.var = &var4, x##cpro4.nvars = 1, \
|
|
|
3859 gcprolist = &x##cpro4 ))
|
|
|
3860
|
|
|
3861 #define XGCPRO5(x, var1, var2, var3, var4, var5) ((void) ( \
|
|
|
3862 x##cpro1.next = gcprolist, x##cpro1.var = &var1, x##cpro1.nvars = 1, \
|
|
|
3863 x##cpro2.next = &x##cpro1, x##cpro2.var = &var2, x##cpro2.nvars = 1, \
|
|
|
3864 x##cpro3.next = &x##cpro2, x##cpro3.var = &var3, x##cpro3.nvars = 1, \
|
|
|
3865 x##cpro4.next = &x##cpro3, x##cpro4.var = &var4, x##cpro4.nvars = 1, \
|
|
|
3866 x##cpro5.next = &x##cpro4, x##cpro5.var = &var5, x##cpro5.nvars = 1, \
|
|
|
3867 gcprolist = &x##cpro5 ))
|
|
|
3868
|
|
|
3869 #define XGCPRO1_ARRAY(x, array, n) ((void) ( \
|
|
|
3870 x##cpro1.next = gcprolist, x##cpro1.var = array, x##cpro1.nvars = n, \
|
|
|
3871 gcprolist = &x##cpro1 ))
|
|
|
3872
|
|
|
3873 #define XGCPRO2_ARRAY(x, array1, n1, array2, n2) ((void) ( \
|
|
|
3874 x##cpro1.next = gcprolist, x##cpro1.var = array1, x##cpro1.nvars = n1, \
|
|
|
3875 x##cpro2.next = &x##cpro1, x##cpro2.var = array2, x##cpro2.nvars = n2, \
|
|
|
3876 gcprolist = &x##cpro2 ))
|
|
|
3877
|
|
|
3878 #define XGCPRO3_ARRAY(x, array1, n1, array2, n2, array3, n3) ((void) ( \
|
|
|
3879 x##cpro1.next = gcprolist, x##cpro1.var = array1, x##cpro1.nvars = n1, \
|
|
|
3880 x##cpro2.next = &x##cpro1, x##cpro2.var = array2, x##cpro2.nvars = n2, \
|
|
|
3881 x##cpro3.next = &x##cpro2, x##cpro3.var = array3, x##cpro3.nvars = n3, \
|
|
|
3882 gcprolist = &x##cpro3 ))
|
|
853
|
3883
|
|
1204
|
3884 #if defined (__cplusplus) && defined (ERROR_CHECK_GC)
|
|
|
3885 /* We need to reset each gcpro to avoid triggering the assert() in
|
|
|
3886 ~gcpro(). This happens in UNGCPRO and longjmp(). */
|
|
|
3887 #define UNWIND_GCPRO_TO(val) \
|
|
|
3888 do \
|
|
|
3889 { \
|
|
|
3890 struct gcpro *__gcpro_stop = (val); \
|
|
|
3891 /* Try to catch UNGCPRO without GCPRO. We arrange for there to be a \
|
|
|
3892 sentinel at the end of the gcprolist, so it should never be NULL. */ \
|
|
|
3893 assert (__gcpro_stop); \
|
|
|
3894 while (gcprolist != __gcpro_stop) \
|
|
|
3895 { \
|
|
|
3896 struct gcpro *__gcpro_next = gcprolist->next; \
|
|
|
3897 gcprolist->next = 0; \
|
|
|
3898 gcprolist = __gcpro_next; \
|
|
|
3899 assert (gcprolist); \
|
|
|
3900 } \
|
|
|
3901 } while (0)
|
|
|
3902 #else
|
|
|
3903 #define UNWIND_GCPRO_TO(val) (gcprolist = (val))
|
|
|
3904 #endif /* defined (__cplusplus) && defined (ERROR_CHECK_GC) */
|
|
|
3905
|
|
2367
|
3906 #define XUNGCPRO(x) UNWIND_GCPRO_TO (x##cpro1.next)
|
|
428
|
3907
|
|
|
3908 #endif /* ! DEBUG_GCPRO */
|
|
|
3909
|
|
2367
|
3910 #define GCDECL1 XGCDECL1 (g)
|
|
|
3911 #define GCDECL2 XGCDECL2 (g)
|
|
|
3912 #define GCDECL3 XGCDECL3 (g)
|
|
|
3913 #define GCDECL4 XGCDECL4 (g)
|
|
|
3914 #define GCDECL5 XGCDECL5 (g)
|
|
|
3915
|
|
|
3916 #define GCPRO1(a) XGCPRO1 (g,a)
|
|
|
3917 #define GCPRO2(a,b) XGCPRO2 (g,a,b)
|
|
|
3918 #define GCPRO3(a,b,c) XGCPRO3 (g,a,b,c)
|
|
|
3919 #define GCPRO4(a,b,c,d) XGCPRO4 (g,a,b,c,d)
|
|
|
3920 #define GCPRO5(a,b,c,d,e) XGCPRO5 (g,a,b,c,d,e)
|
|
|
3921
|
|
|
3922 #define GCPRO1_ARRAY(a1,n1) XGCPRO1_ARRAY(g,a1,n1)
|
|
|
3923 #define GCPRO2_ARRAY(a1,n1,a2,n2) XGCPRO2_ARRAY (g,a1,n1,a2,n2)
|
|
|
3924 #define GCPRO3_ARRAY(a1,n1,a2,n2,a3,n3) XGCPRO3_ARRAY (g,a1,n1,a2,n2,a3,n3)
|
|
|
3925
|
|
|
3926 #define UNGCPRO XUNGCPRO (g)
|
|
|
3927
|
|
|
3928 #define NGCDECL1 XGCDECL1 (ng)
|
|
|
3929 #define NGCDECL2 XGCDECL2 (ng)
|
|
|
3930 #define NGCDECL3 XGCDECL3 (ng)
|
|
|
3931 #define NGCDECL4 XGCDECL4 (ng)
|
|
|
3932 #define NGCDECL5 XGCDECL5 (ng)
|
|
|
3933
|
|
|
3934 #define NGCPRO1(a) XGCPRO1 (ng,a)
|
|
|
3935 #define NGCPRO2(a,b) XGCPRO2 (ng,a,b)
|
|
|
3936 #define NGCPRO3(a,b,c) XGCPRO3 (ng,a,b,c)
|
|
|
3937 #define NGCPRO4(a,b,c,d) XGCPRO4 (ng,a,b,c,d)
|
|
|
3938 #define NGCPRO5(a,b,c,d,e) XGCPRO5 (ng,a,b,c,d,e)
|
|
|
3939
|
|
|
3940 #define NGCPRO1_ARRAY(a1,n1) XGCPRO1_ARRAY(ng,a1,n1)
|
|
|
3941 #define NGCPRO2_ARRAY(a1,n1,a2,n2) XGCPRO2_ARRAY (ng,a1,n1,a2,n2)
|
|
|
3942 #define NGCPRO3_ARRAY(a1,n1,a2,n2,a3,n3) XGCPRO3_ARRAY (ng,a1,n1,a2,n2,a3,n3)
|
|
|
3943
|
|
|
3944 #define NUNGCPRO XUNGCPRO (ng)
|
|
|
3945
|
|
|
3946 #define NNGCDECL1 XGCDECL1 (nng)
|
|
|
3947 #define NNGCDECL2 XGCDECL2 (nng)
|
|
|
3948 #define NNGCDECL3 XGCDECL3 (nng)
|
|
|
3949 #define NNGCDECL4 XGCDECL4 (nng)
|
|
|
3950 #define NNGCDECL5 XGCDECL5 (nng)
|
|
|
3951
|
|
|
3952 #define NNGCPRO1(a) XGCPRO1 (nng,a)
|
|
|
3953 #define NNGCPRO2(a,b) XGCPRO2 (nng,a,b)
|
|
|
3954 #define NNGCPRO3(a,b,c) XGCPRO3 (nng,a,b,c)
|
|
|
3955 #define NNGCPRO4(a,b,c,d) XGCPRO4 (nng,a,b,c,d)
|
|
|
3956 #define NNGCPRO5(a,b,c,d,e) XGCPRO5 (nng,a,b,c,d,e)
|
|
|
3957
|
|
|
3958 #define NNGCPRO1_ARRAY(a1,n1) XGCPRO1_ARRAY(nng,a1,n1)
|
|
|
3959 #define NNGCPRO2_ARRAY(a1,n1,a2,n2) XGCPRO2_ARRAY (nng,a1,n1,a2,n2)
|
|
|
3960 #define NNGCPRO3_ARRAY(a1,n1,a2,n2,a3,n3) XGCPRO3_ARRAY (nng,a1,n1,a2,n2,a3,n3)
|
|
|
3961
|
|
|
3962 #define NNUNGCPRO XUNGCPRO (nng)
|
|
|
3963
|
|
428
|
3964 /* Evaluate expr, UNGCPRO, and then return the value of expr. */
|
|
|
3965 #define RETURN_UNGCPRO(expr) do \
|
|
|
3966 { \
|
|
|
3967 Lisp_Object ret_ungc_val = (expr); \
|
|
|
3968 UNGCPRO; \
|
|
|
3969 RETURN_SANS_WARNINGS ret_ungc_val; \
|
|
|
3970 } while (0)
|
|
|
3971
|
|
|
3972 /* Evaluate expr, NUNGCPRO, UNGCPRO, and then return the value of expr. */
|
|
|
3973 #define RETURN_NUNGCPRO(expr) do \
|
|
|
3974 { \
|
|
|
3975 Lisp_Object ret_ungc_val = (expr); \
|
|
|
3976 NUNGCPRO; \
|
|
|
3977 UNGCPRO; \
|
|
|
3978 RETURN_SANS_WARNINGS ret_ungc_val; \
|
|
|
3979 } while (0)
|
|
|
3980
|
|
|
3981 /* Evaluate expr, NNUNGCPRO, NUNGCPRO, UNGCPRO, and then return the
|
|
|
3982 value of expr. */
|
|
|
3983 #define RETURN_NNUNGCPRO(expr) do \
|
|
|
3984 { \
|
|
|
3985 Lisp_Object ret_ungc_val = (expr); \
|
|
|
3986 NNUNGCPRO; \
|
|
|
3987 NUNGCPRO; \
|
|
|
3988 UNGCPRO; \
|
|
|
3989 RETURN_SANS_WARNINGS ret_ungc_val; \
|
|
|
3990 } while (0)
|
|
|
3991
|
|
452
|
3992 extern Lisp_Object_ptr_dynarr *staticpros;
|
|
3092
|
3993 extern Lisp_Object_ptr_dynarr *staticpros_nodump;
|
|
771
|
3994 #ifdef DEBUG_XEMACS
|
|
|
3995
|
|
|
3996 /* Help debug crashes gc-marking a staticpro'ed object. */
|
|
|
3997
|
|
2367
|
3998 MODULE_API void staticpro_1 (Lisp_Object *, Ascbyte *);
|
|
|
3999 MODULE_API void staticpro_nodump_1 (Lisp_Object *, Ascbyte *);
|
|
771
|
4000 #define staticpro(ptr) staticpro_1 (ptr, #ptr)
|
|
|
4001 #define staticpro_nodump(ptr) staticpro_nodump_1 (ptr, #ptr)
|
|
|
4002
|
|
996
|
4003 #ifdef HAVE_SHLIB
|
|
2367
|
4004 MODULE_API void unstaticpro_nodump_1 (Lisp_Object *, Ascbyte *);
|
|
996
|
4005 #define unstaticpro_nodump(ptr) unstaticpro_nodump_1 (ptr, #ptr)
|
|
|
4006 #endif
|
|
|
4007
|
|
771
|
4008 #else
|
|
611
|
4009
|
|
428
|
4010 /* Call staticpro (&var) to protect static variable `var'. */
|
|
1632
|
4011 MODULE_API void staticpro (Lisp_Object *);
|
|
428
|
4012
|
|
|
4013 /* Call staticpro_nodump (&var) to protect static variable `var'. */
|
|
|
4014 /* var will not be saved at dump time */
|
|
1632
|
4015 MODULE_API void staticpro_nodump (Lisp_Object *);
|
|
428
|
4016
|
|
996
|
4017 #ifdef HAVE_SHLIB
|
|
|
4018 /* Call unstaticpro_nodump (&var) to stop protecting static variable `var'. */
|
|
1632
|
4019 MODULE_API void unstaticpro_nodump (Lisp_Object *);
|
|
996
|
4020 #endif
|
|
|
4021
|
|
771
|
4022 #endif
|
|
|
4023
|
|
2720
|
4024 #ifdef MC_ALLOC
|
|
|
4025 extern Lisp_Object_dynarr *mcpros;
|
|
|
4026 #ifdef DEBUG_XEMACS
|
|
|
4027 /* Help debug crashes gc-marking a mcpro'ed object. */
|
|
|
4028 MODULE_API void mcpro_1 (Lisp_Object, char *);
|
|
|
4029 #define mcpro(ptr) mcpro_1 (ptr, #ptr)
|
|
|
4030 #else /* not DEBUG_XEMACS */
|
|
|
4031 /* Call mcpro (&var) to protect mc variable `var'. */
|
|
|
4032 MODULE_API void mcpro (Lisp_Object);
|
|
|
4033 #endif /* not DEBUG_XEMACS */
|
|
|
4034 #endif /* MC_ALLOC */
|
|
|
4035
|
|
771
|
4036 void register_post_gc_action (void (*fun) (void *), void *arg);
|
|
|
4037 int begin_gc_forbidden (void);
|
|
|
4038 void end_gc_forbidden (int count);
|
|
1957
|
4039 extern int gc_currently_forbidden;
|
|
771
|
4040
|
|
1743
|
4041 END_C_DECLS
|
|
1650
|
4042
|
|
771
|
4043
|
|
|
4044 /************************************************************************/
|
|
|
4045 /* Misc definitions */
|
|
|
4046 /************************************************************************/
|
|
442
|
4047
|
|
|
4048 /************************************************************************/
|
|
1983
|
4049 /* Other numeric types */
|
|
|
4050 /************************************************************************/
|
|
|
4051 #ifdef WITH_NUMBER_TYPES
|
|
|
4052 #include "number.h"
|
|
1986
|
4053 #else
|
|
|
4054 #define make_integer(x) make_int(x)
|
|
1983
|
4055 #endif
|
|
|
4056
|
|
|
4057
|
|
|
4058 /************************************************************************/
|
|
442
|
4059 /* prototypes */
|
|
|
4060 /************************************************************************/
|
|
|
4061
|
|
|
4062 /* NOTE: Prototypes should go HERE, not in various header files, unless
|
|
|
4063 they specifically reference a type that's not defined in lisp.h.
|
|
|
4064 (And even then, you might consider adding the type to lisp.h.)
|
|
|
4065
|
|
|
4066 The idea is that header files typically contain the innards of objects,
|
|
|
4067 and we want to minimize the number of "dependencies" of one file on
|
|
|
4068 the specifics of such objects. Putting prototypes here minimizes the
|
|
|
4069 number of header files that need to be included -- good for a number
|
|
|
4070 of reasons. --ben */
|
|
|
4071
|
|
|
4072 /*--------------- prototypes for various public c functions ------------*/
|
|
|
4073
|
|
|
4074 /* Prototypes for all init/syms_of/vars_of initialization functions. */
|
|
|
4075 #include "symsinit.h"
|
|
|
4076
|
|
1743
|
4077 BEGIN_C_DECLS
|
|
1650
|
4078
|
|
826
|
4079 /* Defined in abbrev.c */
|
|
1632
|
4080 MODULE_API EXFUN (Fexpand_abbrev, 0);
|
|
826
|
4081
|
|
428
|
4082 /* Defined in alloc.c */
|
|
1632
|
4083 MODULE_API EXFUN (Fcons, 2);
|
|
|
4084 MODULE_API EXFUN (Flist, MANY);
|
|
826
|
4085 EXFUN (Fmake_byte_code, MANY);
|
|
1632
|
4086 MODULE_API EXFUN (Fmake_list, 2);
|
|
|
4087 MODULE_API EXFUN (Fmake_string, 2);
|
|
|
4088 MODULE_API EXFUN (Fmake_symbol, 1);
|
|
|
4089 MODULE_API EXFUN (Fmake_vector, 2);
|
|
|
4090 MODULE_API EXFUN (Fvector, MANY);
|
|
826
|
4091
|
|
2720
|
4092 #ifndef MC_ALLOC
|
|
428
|
4093 void release_breathing_space (void);
|
|
2720
|
4094 #endif /* not MC_ALLOC */
|
|
428
|
4095 Lisp_Object noseeum_cons (Lisp_Object, Lisp_Object);
|
|
1632
|
4096 MODULE_API Lisp_Object make_vector (Elemcount, Lisp_Object);
|
|
|
4097 MODULE_API Lisp_Object vector1 (Lisp_Object);
|
|
|
4098 MODULE_API Lisp_Object vector2 (Lisp_Object, Lisp_Object);
|
|
|
4099 MODULE_API Lisp_Object vector3 (Lisp_Object, Lisp_Object, Lisp_Object);
|
|
665
|
4100 Lisp_Object make_bit_vector (Elemcount, Lisp_Object);
|
|
|
4101 Lisp_Object make_bit_vector_from_byte_vector (unsigned char *, Elemcount);
|
|
428
|
4102 Lisp_Object noseeum_make_marker (void);
|
|
3092
|
4103 #ifndef NEW_GC
|
|
428
|
4104 void garbage_collect_1 (void);
|
|
3092
|
4105 #endif /* not NEW_GC */
|
|
1632
|
4106 MODULE_API Lisp_Object acons (Lisp_Object, Lisp_Object, Lisp_Object);
|
|
|
4107 MODULE_API Lisp_Object cons3 (Lisp_Object, Lisp_Object, Lisp_Object);
|
|
|
4108 MODULE_API Lisp_Object list1 (Lisp_Object);
|
|
|
4109 MODULE_API Lisp_Object list2 (Lisp_Object, Lisp_Object);
|
|
|
4110 MODULE_API Lisp_Object list3 (Lisp_Object, Lisp_Object, Lisp_Object);
|
|
|
4111 MODULE_API Lisp_Object list4 (Lisp_Object, Lisp_Object, Lisp_Object,
|
|
|
4112 Lisp_Object);
|
|
|
4113 MODULE_API Lisp_Object list5 (Lisp_Object, Lisp_Object, Lisp_Object, Lisp_Object,
|
|
|
4114 Lisp_Object);
|
|
|
4115 MODULE_API Lisp_Object list6 (Lisp_Object, Lisp_Object, Lisp_Object, Lisp_Object,
|
|
|
4116 Lisp_Object, Lisp_Object);
|
|
428
|
4117 DECLARE_DOESNT_RETURN (memory_full (void));
|
|
|
4118 void disksave_object_finalization (void);
|
|
|
4119 extern int purify_flag;
|
|
3092
|
4120 #ifndef NEW_GC
|
|
428
|
4121 extern EMACS_INT gc_generation_number[1];
|
|
3092
|
4122 #endif /* not NEW_GC */
|
|
428
|
4123 int c_readonly (Lisp_Object);
|
|
|
4124 int lisp_readonly (Lisp_Object);
|
|
1632
|
4125 MODULE_API void copy_lisp_object (Lisp_Object dst, Lisp_Object src);
|
|
|
4126 MODULE_API Lisp_Object build_intstring (const Ibyte *);
|
|
|
4127 MODULE_API Lisp_Object build_string (const CIbyte *);
|
|
|
4128 MODULE_API Lisp_Object build_ext_string (const Extbyte *, Lisp_Object);
|
|
|
4129 MODULE_API Lisp_Object build_msg_intstring (const Ibyte *);
|
|
|
4130 MODULE_API Lisp_Object build_msg_string (const CIbyte *);
|
|
|
4131 MODULE_API Lisp_Object make_string (const Ibyte *, Bytecount);
|
|
|
4132 MODULE_API Lisp_Object make_ext_string (const Extbyte *, EMACS_INT, Lisp_Object);
|
|
771
|
4133 void init_string_ascii_begin (Lisp_Object string);
|
|
428
|
4134 Lisp_Object make_uninit_string (Bytecount);
|
|
1632
|
4135 MODULE_API Lisp_Object make_float (double);
|
|
867
|
4136 Lisp_Object make_string_nocopy (const Ibyte *, Bytecount);
|
|
853
|
4137 void free_cons (Lisp_Object);
|
|
428
|
4138 void free_list (Lisp_Object);
|
|
|
4139 void free_alist (Lisp_Object);
|
|
1204
|
4140 void free_marker (Lisp_Object);
|
|
428
|
4141 int object_dead_p (Lisp_Object);
|
|
|
4142 void mark_object (Lisp_Object obj);
|
|
3092
|
4143 #ifndef NEW_GC
|
|
1598
|
4144 #ifdef USE_KKCC
|
|
2645
|
4145 #ifdef DEBUG_XEMACS
|
|
|
4146 void kkcc_gc_stack_push_lisp_object_1 (Lisp_Object obj, int level, int pos);
|
|
|
4147 #define kkcc_gc_stack_push_lisp_object(obj, level, pos) \
|
|
|
4148 kkcc_gc_stack_push_lisp_object_1 (obj, level, pos)
|
|
|
4149 void kkcc_backtrace (void);
|
|
|
4150 #else
|
|
|
4151 void kkcc_gc_stack_push_lisp_object_1 (Lisp_Object obj);
|
|
|
4152 #define kkcc_gc_stack_push_lisp_object(obj, level, pos) \
|
|
|
4153 kkcc_gc_stack_push_lisp_object_1 (obj)
|
|
|
4154 #define kkcc_backtrace()
|
|
|
4155 #endif
|
|
1598
|
4156 #endif /* USE_KKCC */
|
|
3092
|
4157 #endif /* not NEW_GC */
|
|
428
|
4158 int marked_p (Lisp_Object obj);
|
|
851
|
4159 extern int funcall_allocation_flag;
|
|
814
|
4160 extern int need_to_garbage_collect;
|
|
1632
|
4161 extern MODULE_API int need_to_check_c_alloca;
|
|
888
|
4162 extern int need_to_signal_post_gc;
|
|
1333
|
4163 extern Lisp_Object Qpost_gc_hook, Qgarbage_collecting;
|
|
851
|
4164 void recompute_funcall_allocation_flag (void);
|
|
428
|
4165
|
|
|
4166 #ifdef MEMORY_USAGE_STATS
|
|
665
|
4167 Bytecount malloced_storage_size (void *, Bytecount, struct overhead_stats *);
|
|
|
4168 Bytecount fixed_type_block_overhead (Bytecount);
|
|
428
|
4169 #endif
|
|
1204
|
4170
|
|
|
4171 #ifdef EVENT_DATA_AS_OBJECTS
|
|
|
4172 Lisp_Object make_key_data (void);
|
|
|
4173 Lisp_Object make_button_data (void);
|
|
|
4174 Lisp_Object make_motion_data (void);
|
|
|
4175 Lisp_Object make_process_data (void);
|
|
|
4176 Lisp_Object make_timeout_data (void);
|
|
|
4177 Lisp_Object make_magic_data (void);
|
|
|
4178 Lisp_Object make_magic_eval_data (void);
|
|
|
4179 Lisp_Object make_eval_data (void);
|
|
|
4180 Lisp_Object make_misc_user_data (void);
|
|
|
4181 void free_key_data (Lisp_Object);
|
|
|
4182 void free_button_data (Lisp_Object);
|
|
|
4183 void free_motion_data (Lisp_Object);
|
|
|
4184 void free_process_data (Lisp_Object);
|
|
|
4185 void free_timeout_data (Lisp_Object);
|
|
|
4186 void free_magic_data (Lisp_Object);
|
|
|
4187 void free_magic_eval_data (Lisp_Object);
|
|
|
4188 void free_eval_data (Lisp_Object);
|
|
|
4189 void free_misc_user_data (Lisp_Object);
|
|
|
4190 #endif /* EVENT_DATA_AS_OBJECTS */
|
|
934
|
4191
|
|
428
|
4192 /* Defined in buffer.c */
|
|
|
4193 Lisp_Object get_truename_buffer (Lisp_Object);
|
|
|
4194 void switch_to_buffer (Lisp_Object, Lisp_Object);
|
|
|
4195 extern int find_file_compare_truenames;
|
|
|
4196 extern int find_file_use_truenames;
|
|
867
|
4197 Ibyte *get_initial_directory (Ibyte *pathname, Bytecount size);
|
|
771
|
4198 void set_buffer_internal (struct buffer *b);
|
|
|
4199 struct buffer *decode_buffer (Lisp_Object buffer, int allow_string);
|
|
|
4200
|
|
|
4201 void record_buffer (Lisp_Object buf);
|
|
|
4202 Lisp_Object get_buffer (Lisp_Object name,
|
|
|
4203 int error_if_deleted_or_does_not_exist);
|
|
|
4204 int map_over_sharing_buffers (struct buffer *buf,
|
|
|
4205 int (*mapfun) (struct buffer *buf,
|
|
|
4206 void *closure),
|
|
|
4207 void *closure);
|
|
1204
|
4208 void cleanup_buffer_undo_lists (void);
|
|
771
|
4209
|
|
|
4210 extern struct buffer *current_buffer;
|
|
|
4211
|
|
|
4212 extern void init_initial_directory (void); /* initialize initial_directory */
|
|
|
4213
|
|
|
4214 EXFUN (Fbuffer_disable_undo, 1);
|
|
1632
|
4215 MODULE_API EXFUN (Fbuffer_modified_p, 1);
|
|
|
4216 MODULE_API EXFUN (Fbuffer_name, 1);
|
|
|
4217 MODULE_API EXFUN (Fcurrent_buffer, 0);
|
|
771
|
4218 EXFUN (Ferase_buffer, 1);
|
|
|
4219 EXFUN (Fget_buffer, 1);
|
|
|
4220 EXFUN (Fget_buffer_create, 1);
|
|
|
4221 EXFUN (Fget_file_buffer, 1);
|
|
1632
|
4222 MODULE_API EXFUN (Fkill_buffer, 1);
|
|
771
|
4223 EXFUN (Fother_buffer, 3);
|
|
|
4224 EXFUN (Frecord_buffer, 1);
|
|
1632
|
4225 MODULE_API EXFUN (Fset_buffer, 1);
|
|
771
|
4226 EXFUN (Fset_buffer_modified_p, 2);
|
|
|
4227
|
|
|
4228 extern Lisp_Object QSscratch, Qafter_change_function, Qafter_change_functions;
|
|
|
4229 extern Lisp_Object Qbefore_change_function, Qbefore_change_functions;
|
|
|
4230 extern Lisp_Object Qbuffer_or_string_p, Qdefault_directory, Qfirst_change_hook;
|
|
|
4231 extern Lisp_Object Qpermanent_local, Vafter_change_function;
|
|
|
4232 extern Lisp_Object Vafter_change_functions, Vbefore_change_function;
|
|
|
4233 extern Lisp_Object Vbefore_change_functions, Vbuffer_alist, Vbuffer_defaults;
|
|
|
4234 extern Lisp_Object Vinhibit_read_only, Vtransient_mark_mode;
|
|
428
|
4235
|
|
563
|
4236 /* Defined in bytecode.c */
|
|
826
|
4237 EXFUN (Fbyte_code, 3);
|
|
|
4238
|
|
593
|
4239 DECLARE_DOESNT_RETURN (invalid_byte_code
|
|
867
|
4240 (const CIbyte *reason, Lisp_Object frob));
|
|
563
|
4241
|
|
826
|
4242 /* Defined in callint.c */
|
|
|
4243 EXFUN (Fcall_interactively, 3);
|
|
|
4244 EXFUN (Fprefix_numeric_value, 1);
|
|
|
4245
|
|
|
4246 /* Defined in casefiddle.c */
|
|
|
4247 EXFUN (Fdowncase, 2);
|
|
|
4248 EXFUN (Fupcase, 2);
|
|
|
4249 EXFUN (Fupcase_initials, 2);
|
|
|
4250 EXFUN (Fupcase_initials_region, 3);
|
|
|
4251 EXFUN (Fupcase_region, 3);
|
|
|
4252
|
|
|
4253 /* Defined in casetab.c */
|
|
|
4254 EXFUN (Fset_standard_case_table, 1);
|
|
|
4255
|
|
|
4256 /* Defined in chartab.c */
|
|
|
4257 EXFUN (Freset_char_table, 1);
|
|
|
4258
|
|
|
4259 /* Defined in cmds.c */
|
|
|
4260 EXFUN (Fbeginning_of_line, 2);
|
|
|
4261 EXFUN (Fend_of_line, 2);
|
|
|
4262 EXFUN (Fforward_char, 2);
|
|
|
4263 EXFUN (Fforward_line, 2);
|
|
|
4264
|
|
428
|
4265 /* Defined in data.c */
|
|
826
|
4266 EXFUN (Fadd1, 1);
|
|
|
4267 EXFUN (Faref, 2);
|
|
|
4268 EXFUN (Faset, 3);
|
|
|
4269 EXFUN (Fcar, 1);
|
|
|
4270 EXFUN (Fcar_safe, 1);
|
|
|
4271 EXFUN (Fcdr, 1);
|
|
919
|
4272 EXFUN (Fcdr_safe, 1);
|
|
826
|
4273 EXFUN (Fgeq, MANY);
|
|
|
4274 EXFUN (Fgtr, MANY);
|
|
|
4275 EXFUN (Findirect_function, 1);
|
|
|
4276 EXFUN (Fleq, MANY);
|
|
|
4277 EXFUN (Flistp, 1);
|
|
|
4278 EXFUN (Flss, MANY);
|
|
|
4279 EXFUN (Fmax, MANY);
|
|
|
4280 EXFUN (Fmin, MANY);
|
|
|
4281 EXFUN (Fminus, MANY);
|
|
|
4282 EXFUN (Fnumber_to_string, 1);
|
|
|
4283 EXFUN (Fplus, MANY);
|
|
|
4284 EXFUN (Fquo, MANY);
|
|
|
4285 EXFUN (Frem, 2);
|
|
|
4286 EXFUN (Fsetcar, 2);
|
|
|
4287 EXFUN (Fsetcdr, 2);
|
|
|
4288 EXFUN (Fsub1, 1);
|
|
|
4289 EXFUN (Fsubr_max_args, 1);
|
|
|
4290 EXFUN (Fsubr_min_args, 1);
|
|
|
4291 EXFUN (Ftimes, MANY);
|
|
|
4292
|
|
428
|
4293 DECLARE_DOESNT_RETURN (c_write_error (Lisp_Object));
|
|
|
4294 DECLARE_DOESNT_RETURN (lisp_write_error (Lisp_Object));
|
|
|
4295 DECLARE_DOESNT_RETURN (args_out_of_range (Lisp_Object, Lisp_Object));
|
|
|
4296 DECLARE_DOESNT_RETURN (args_out_of_range_3 (Lisp_Object, Lisp_Object,
|
|
|
4297 Lisp_Object));
|
|
1632
|
4298 MODULE_API Lisp_Object wrong_type_argument (Lisp_Object, Lisp_Object);
|
|
|
4299 MODULE_API
|
|
428
|
4300 DECLARE_DOESNT_RETURN (dead_wrong_type_argument (Lisp_Object, Lisp_Object));
|
|
|
4301 void check_int_range (EMACS_INT, EMACS_INT, EMACS_INT);
|
|
|
4302
|
|
771
|
4303 EXFUN (Fint_to_char, 1);
|
|
|
4304 EXFUN (Fchar_to_int, 1);
|
|
|
4305
|
|
428
|
4306 enum arith_comparison {
|
|
|
4307 arith_equal,
|
|
|
4308 arith_notequal,
|
|
|
4309 arith_less,
|
|
|
4310 arith_grtr,
|
|
|
4311 arith_less_or_equal,
|
|
|
4312 arith_grtr_or_equal };
|
|
|
4313 Lisp_Object arithcompare (Lisp_Object, Lisp_Object, enum arith_comparison);
|
|
|
4314
|
|
707
|
4315 /* Do NOT use word_to_lisp or wasteful_word_to_lisp to decode time_t's
|
|
|
4316 unless you KNOW arg is non-negative. They cannot return negative
|
|
|
4317 values! Use make_time. */
|
|
428
|
4318 Lisp_Object word_to_lisp (unsigned int);
|
|
|
4319 unsigned int lisp_to_word (Lisp_Object);
|
|
|
4320
|
|
|
4321 /* Defined in dired.c */
|
|
867
|
4322 Lisp_Object make_directory_hash_table (const Ibyte *);
|
|
428
|
4323 Lisp_Object wasteful_word_to_lisp (unsigned int);
|
|
|
4324
|
|
|
4325 /* Defined in doc.c */
|
|
826
|
4326 EXFUN (Fsubstitute_command_keys, 1);
|
|
|
4327
|
|
814
|
4328 Lisp_Object unparesseuxify_doc_string (int fd, EMACS_INT position,
|
|
867
|
4329 Ibyte *name_nonreloc,
|
|
814
|
4330 Lisp_Object name_reloc,
|
|
|
4331 int standard_doc_file);
|
|
428
|
4332 Lisp_Object read_doc_string (Lisp_Object);
|
|
|
4333
|
|
|
4334 /* Defined in doprnt.c */
|
|
867
|
4335 Bytecount emacs_doprnt_va (Lisp_Object stream, const Ibyte *format_nonreloc,
|
|
771
|
4336 Bytecount format_length, Lisp_Object format_reloc,
|
|
|
4337 va_list vargs);
|
|
867
|
4338 Bytecount emacs_doprnt (Lisp_Object stream, const Ibyte *format_nonreloc,
|
|
771
|
4339 Bytecount format_length, Lisp_Object format_reloc,
|
|
|
4340 int nargs, const Lisp_Object *largs, ...);
|
|
867
|
4341 Lisp_Object emacs_vsprintf_string_lisp (const CIbyte *format_nonreloc,
|
|
771
|
4342 Lisp_Object format_reloc, int nargs,
|
|
|
4343 const Lisp_Object *largs);
|
|
867
|
4344 Lisp_Object emacs_sprintf_string_lisp (const CIbyte *format_nonreloc,
|
|
771
|
4345 Lisp_Object format_reloc, int nargs, ...);
|
|
867
|
4346 Ibyte *emacs_vsprintf_malloc_lisp (const CIbyte *format_nonreloc,
|
|
771
|
4347 Lisp_Object format_reloc, int nargs,
|
|
|
4348 const Lisp_Object *largs,
|
|
|
4349 Bytecount *len_out);
|
|
867
|
4350 Ibyte *emacs_sprintf_malloc_lisp (Bytecount *len_out,
|
|
|
4351 const CIbyte *format_nonreloc,
|
|
771
|
4352 Lisp_Object format_reloc, int nargs, ...);
|
|
867
|
4353 Lisp_Object emacs_vsprintf_string (const CIbyte *format, va_list vargs);
|
|
|
4354 Lisp_Object emacs_sprintf_string (const CIbyte *format, ...)
|
|
771
|
4355 PRINTF_ARGS (1, 2);
|
|
867
|
4356 Ibyte *emacs_vsprintf_malloc (const CIbyte *format, va_list vargs,
|
|
771
|
4357 Bytecount *len_out);
|
|
867
|
4358 Ibyte *emacs_sprintf_malloc (Bytecount *len_out, const CIbyte *format, ...)
|
|
771
|
4359 PRINTF_ARGS (2, 3);
|
|
867
|
4360 Bytecount emacs_vsprintf (Ibyte *output, const CIbyte *format,
|
|
771
|
4361 va_list vargs);
|
|
867
|
4362 Bytecount emacs_sprintf (Ibyte *output, const CIbyte *format, ...)
|
|
771
|
4363 PRINTF_ARGS (2, 3);
|
|
|
4364
|
|
428
|
4365
|
|
|
4366 /* Defined in editfns.c */
|
|
826
|
4367 EXFUN (Fbobp, 1);
|
|
|
4368 EXFUN (Fbolp, 1);
|
|
|
4369 EXFUN (Fbuffer_substring, 3);
|
|
|
4370 EXFUN (Fchar_after, 2);
|
|
|
4371 EXFUN (Fchar_to_string, 1);
|
|
|
4372 EXFUN (Fdelete_region, 3);
|
|
|
4373 EXFUN (Feobp, 1);
|
|
|
4374 EXFUN (Feolp, 1);
|
|
|
4375 EXFUN (Ffollowing_char, 1);
|
|
|
4376 EXFUN (Fformat, MANY);
|
|
|
4377 EXFUN (Fgoto_char, 2);
|
|
|
4378 EXFUN (Finsert, MANY);
|
|
|
4379 EXFUN (Finsert_buffer_substring, 3);
|
|
|
4380 EXFUN (Finsert_char, 4);
|
|
|
4381 EXFUN (Fnarrow_to_region, 3);
|
|
|
4382 EXFUN (Fpoint, 1);
|
|
|
4383 EXFUN (Fpoint_marker, 2);
|
|
|
4384 EXFUN (Fpoint_max, 1);
|
|
|
4385 EXFUN (Fpoint_min, 1);
|
|
|
4386 EXFUN (Fpreceding_char, 1);
|
|
|
4387 EXFUN (Fsystem_name, 0);
|
|
|
4388 EXFUN (Fuser_home_directory, 0);
|
|
|
4389 EXFUN (Fuser_login_name, 1);
|
|
|
4390 EXFUN (Fwiden, 1);
|
|
|
4391
|
|
428
|
4392 void uncache_home_directory (void);
|
|
867
|
4393 Ibyte *get_home_directory (void);
|
|
|
4394 Ibyte *user_login_name (uid_t *);
|
|
428
|
4395 void buffer_insert1 (struct buffer *, Lisp_Object);
|
|
665
|
4396 Lisp_Object make_string_from_buffer (struct buffer *, Charbpos, Charcount);
|
|
|
4397 Lisp_Object make_string_from_buffer_no_extents (struct buffer *, Charbpos, Charcount);
|
|
707
|
4398 Lisp_Object make_time (time_t);
|
|
428
|
4399 Lisp_Object save_excursion_save (void);
|
|
844
|
4400 Lisp_Object save_restriction_save (struct buffer *buf);
|
|
428
|
4401 Lisp_Object save_excursion_restore (Lisp_Object);
|
|
|
4402 Lisp_Object save_restriction_restore (Lisp_Object);
|
|
771
|
4403 void widen_buffer (struct buffer *b, int no_clip);
|
|
|
4404 int beginning_of_line_p (struct buffer *b, Charbpos pt);
|
|
428
|
4405
|
|
|
4406 /* Defined in emacsfns.c */
|
|
|
4407 Lisp_Object save_current_buffer_restore (Lisp_Object);
|
|
|
4408
|
|
|
4409 /* Defined in emacs.c */
|
|
2268
|
4410 EXFUN_NORETURN (Fkill_emacs, 1);
|
|
826
|
4411 EXFUN (Frunning_temacs_p, 0);
|
|
1123
|
4412 EXFUN (Fforce_debugging_signal, 1);
|
|
826
|
4413
|
|
428
|
4414 SIGTYPE fatal_error_signal (int);
|
|
2367
|
4415 Lisp_Object make_arg_list (int, Wexttext **);
|
|
|
4416 void make_argc_argv (Lisp_Object, int *, Wexttext ***);
|
|
|
4417 void free_argc_argv (Wexttext **);
|
|
771
|
4418 Lisp_Object split_external_path (const Extbyte *path);
|
|
867
|
4419 Lisp_Object split_env_path (const CIbyte *evarname, const Ibyte *default_);
|
|
771
|
4420
|
|
428
|
4421 /* Nonzero means don't do interactive redisplay and don't change tty modes */
|
|
442
|
4422 extern int noninteractive, noninteractive1;
|
|
2367
|
4423 extern int inhibit_non_essential_conversion_operations;
|
|
428
|
4424 extern int preparing_for_armageddon;
|
|
458
|
4425 extern Fixnum emacs_priority;
|
|
428
|
4426 extern int suppress_early_error_handler_backtrace;
|
|
771
|
4427 void debug_break (void);
|
|
|
4428 int debug_can_access_memory (void *ptr, Bytecount len);
|
|
2210
|
4429 DECLARE_DOESNT_RETURN (really_abort (void));
|
|
776
|
4430 void zero_out_command_line_status_vars (void);
|
|
428
|
4431
|
|
826
|
4432 /* Defined in emodules.c */
|
|
996
|
4433 #ifdef HAVE_SHLIB
|
|
826
|
4434 EXFUN (Flist_modules, 0);
|
|
|
4435 EXFUN (Fload_module, 3);
|
|
996
|
4436 extern int unloading_module;
|
|
|
4437 #endif
|
|
826
|
4438
|
|
428
|
4439 /* Defined in eval.c */
|
|
1706
|
4440 MODULE_API EXFUN (Fapply, MANY);
|
|
826
|
4441 EXFUN (Fbacktrace, 2);
|
|
|
4442 EXFUN (Fcommand_execute, 3);
|
|
|
4443 EXFUN (Fcommandp, 1);
|
|
1706
|
4444 MODULE_API EXFUN (Feval, 1);
|
|
|
4445 MODULE_API EXFUN (Ffuncall, MANY);
|
|
826
|
4446 EXFUN (Ffunctionp, 1);
|
|
|
4447 EXFUN (Finteractive_p, 0);
|
|
|
4448 EXFUN (Fprogn, UNEVALLED);
|
|
1706
|
4449 MODULE_API EXFUN (Fsignal, 2);
|
|
2268
|
4450 MODULE_API EXFUN_NORETURN (Fthrow, 2);
|
|
1706
|
4451 MODULE_API EXFUN (Fcall_with_condition_handler, MANY);
|
|
853
|
4452 EXFUN (Ffunction_max_args, 1);
|
|
|
4453 EXFUN (Ffunction_min_args, 1);
|
|
826
|
4454
|
|
1632
|
4455 MODULE_API DECLARE_DOESNT_RETURN (signal_error_1 (Lisp_Object, Lisp_Object));
|
|
563
|
4456 void maybe_signal_error_1 (Lisp_Object, Lisp_Object, Lisp_Object,
|
|
578
|
4457 Error_Behavior);
|
|
563
|
4458 Lisp_Object maybe_signal_continuable_error_1 (Lisp_Object, Lisp_Object,
|
|
578
|
4459 Lisp_Object, Error_Behavior);
|
|
1743
|
4460 MODULE_API DECLARE_DOESNT_RETURN (signal_ferror (Lisp_Object, const CIbyte *,
|
|
|
4461 ...)) PRINTF_ARGS(2, 3);
|
|
578
|
4462 void maybe_signal_ferror (Lisp_Object, Lisp_Object, Error_Behavior,
|
|
867
|
4463 const CIbyte *, ...) PRINTF_ARGS (4, 5);
|
|
|
4464 Lisp_Object signal_continuable_ferror (Lisp_Object, const CIbyte *, ...)
|
|
442
|
4465 PRINTF_ARGS (2, 3);
|
|
563
|
4466 Lisp_Object maybe_signal_continuable_ferror (Lisp_Object, Lisp_Object,
|
|
578
|
4467 Error_Behavior,
|
|
867
|
4468 const CIbyte *, ...)
|
|
442
|
4469 PRINTF_ARGS (4, 5);
|
|
563
|
4470
|
|
867
|
4471 Lisp_Object build_error_data (const CIbyte *reason, Lisp_Object frob);
|
|
|
4472 DECLARE_DOESNT_RETURN (signal_error (Lisp_Object, const CIbyte *,
|
|
563
|
4473 Lisp_Object));
|
|
867
|
4474 void maybe_signal_error (Lisp_Object, const CIbyte *, Lisp_Object,
|
|
578
|
4475 Lisp_Object, Error_Behavior);
|
|
867
|
4476 Lisp_Object signal_continuable_error (Lisp_Object, const CIbyte *,
|
|
563
|
4477 Lisp_Object);
|
|
867
|
4478 Lisp_Object maybe_signal_continuable_error (Lisp_Object, const CIbyte *,
|
|
563
|
4479 Lisp_Object,
|
|
578
|
4480 Lisp_Object, Error_Behavior);
|
|
1743
|
4481 DECLARE_DOESNT_RETURN (signal_ferror_with_frob (Lisp_Object, Lisp_Object,
|
|
|
4482 const CIbyte *, ...))
|
|
|
4483 PRINTF_ARGS(3, 4);
|
|
563
|
4484 void maybe_signal_ferror_with_frob (Lisp_Object, Lisp_Object, Lisp_Object,
|
|
578
|
4485 Error_Behavior,
|
|
867
|
4486 const CIbyte *, ...) PRINTF_ARGS (5, 6);
|
|
563
|
4487 Lisp_Object signal_continuable_ferror_with_frob (Lisp_Object, Lisp_Object,
|
|
867
|
4488 const CIbyte *,
|
|
563
|
4489 ...) PRINTF_ARGS (3, 4);
|
|
|
4490 Lisp_Object maybe_signal_continuable_ferror_with_frob (Lisp_Object,
|
|
|
4491 Lisp_Object,
|
|
|
4492 Lisp_Object,
|
|
578
|
4493 Error_Behavior,
|
|
867
|
4494 const CIbyte *, ...)
|
|
442
|
4495 PRINTF_ARGS (5, 6);
|
|
867
|
4496 DECLARE_DOESNT_RETURN (signal_error_2 (Lisp_Object, const CIbyte *,
|
|
563
|
4497 Lisp_Object, Lisp_Object));
|
|
867
|
4498 void maybe_signal_error_2 (Lisp_Object, const CIbyte *, Lisp_Object,
|
|
578
|
4499 Lisp_Object, Lisp_Object, Error_Behavior);
|
|
867
|
4500 Lisp_Object signal_continuable_error_2 (Lisp_Object, const CIbyte *,
|
|
563
|
4501 Lisp_Object, Lisp_Object);
|
|
867
|
4502 Lisp_Object maybe_signal_continuable_error_2 (Lisp_Object, const CIbyte *,
|
|
563
|
4503 Lisp_Object, Lisp_Object,
|
|
|
4504 Lisp_Object,
|
|
578
|
4505 Error_Behavior);
|
|
563
|
4506
|
|
|
4507
|
|
1927
|
4508 MODULE_API DECLARE_DOESNT_RETURN (signal_malformed_list_error (Lisp_Object));
|
|
|
4509 MODULE_API DECLARE_DOESNT_RETURN (signal_malformed_property_list_error
|
|
|
4510 (Lisp_Object));
|
|
|
4511 MODULE_API DECLARE_DOESNT_RETURN (signal_circular_list_error (Lisp_Object));
|
|
|
4512 MODULE_API DECLARE_DOESNT_RETURN (signal_circular_property_list_error
|
|
|
4513 (Lisp_Object));
|
|
436
|
4514
|
|
867
|
4515 DECLARE_DOESNT_RETURN (syntax_error (const CIbyte *reason,
|
|
609
|
4516 Lisp_Object frob));
|
|
867
|
4517 DECLARE_DOESNT_RETURN (syntax_error_2 (const CIbyte *reason,
|
|
609
|
4518 Lisp_Object frob1,
|
|
442
|
4519 Lisp_Object frob2));
|
|
867
|
4520 void maybe_syntax_error (const CIbyte *, Lisp_Object, Lisp_Object,
|
|
578
|
4521 Error_Behavior);
|
|
867
|
4522 DECLARE_DOESNT_RETURN (sferror (const CIbyte *reason, Lisp_Object frob));
|
|
|
4523 DECLARE_DOESNT_RETURN (sferror_2 (const CIbyte *reason, Lisp_Object frob1,
|
|
563
|
4524 Lisp_Object frob2));
|
|
867
|
4525 void maybe_sferror (const CIbyte *, Lisp_Object, Lisp_Object,
|
|
578
|
4526 Error_Behavior);
|
|
1632
|
4527 MODULE_API DECLARE_DOESNT_RETURN (invalid_argument (const CIbyte *reason,
|
|
|
4528 Lisp_Object frob));
|
|
|
4529 MODULE_API DECLARE_DOESNT_RETURN (invalid_argument_2 (const CIbyte *reason,
|
|
|
4530 Lisp_Object frob1,
|
|
|
4531 Lisp_Object frob2));
|
|
867
|
4532 void maybe_invalid_argument (const CIbyte *, Lisp_Object, Lisp_Object,
|
|
578
|
4533 Error_Behavior);
|
|
1632
|
4534 MODULE_API DECLARE_DOESNT_RETURN (invalid_operation (const CIbyte *reason,
|
|
|
4535 Lisp_Object frob));
|
|
|
4536 MODULE_API DECLARE_DOESNT_RETURN (invalid_operation_2 (const CIbyte *reason,
|
|
|
4537 Lisp_Object frob1,
|
|
|
4538 Lisp_Object frob2));
|
|
|
4539 MODULE_API void maybe_invalid_operation (const CIbyte *, Lisp_Object,
|
|
|
4540 Lisp_Object, Error_Behavior);
|
|
867
|
4541 DECLARE_DOESNT_RETURN (invalid_state (const CIbyte *reason,
|
|
563
|
4542 Lisp_Object frob));
|
|
867
|
4543 DECLARE_DOESNT_RETURN (invalid_state_2 (const CIbyte *reason,
|
|
563
|
4544 Lisp_Object frob1,
|
|
|
4545 Lisp_Object frob2));
|
|
867
|
4546 void maybe_invalid_state (const CIbyte *, Lisp_Object, Lisp_Object,
|
|
609
|
4547 Error_Behavior);
|
|
867
|
4548 DECLARE_DOESNT_RETURN (invalid_change (const CIbyte *reason,
|
|
563
|
4549 Lisp_Object frob));
|
|
867
|
4550 DECLARE_DOESNT_RETURN (invalid_change_2 (const CIbyte *reason,
|
|
563
|
4551 Lisp_Object frob1,
|
|
|
4552 Lisp_Object frob2));
|
|
867
|
4553 void maybe_invalid_change (const CIbyte *, Lisp_Object, Lisp_Object,
|
|
609
|
4554 Error_Behavior);
|
|
1632
|
4555 MODULE_API DECLARE_DOESNT_RETURN (invalid_constant (const CIbyte *reason,
|
|
|
4556 Lisp_Object frob));
|
|
867
|
4557 DECLARE_DOESNT_RETURN (invalid_constant_2 (const CIbyte *reason,
|
|
563
|
4558 Lisp_Object frob1,
|
|
|
4559 Lisp_Object frob2));
|
|
867
|
4560 void maybe_invalid_constant (const CIbyte *, Lisp_Object, Lisp_Object,
|
|
578
|
4561 Error_Behavior);
|
|
867
|
4562 DECLARE_DOESNT_RETURN (wtaerror (const CIbyte *reason, Lisp_Object frob));
|
|
1632
|
4563 MODULE_API DECLARE_DOESNT_RETURN (out_of_memory (const CIbyte *reason,
|
|
|
4564 Lisp_Object frob));
|
|
867
|
4565 DECLARE_DOESNT_RETURN (stack_overflow (const CIbyte *reason,
|
|
442
|
4566 Lisp_Object frob));
|
|
1743
|
4567 MODULE_API DECLARE_DOESNT_RETURN (printing_unreadable_object (const CIbyte *,
|
|
|
4568 ...))
|
|
|
4569 PRINTF_ARGS (1, 2);
|
|
442
|
4570
|
|
436
|
4571 Lisp_Object signal_void_function_error (Lisp_Object);
|
|
|
4572 Lisp_Object signal_invalid_function_error (Lisp_Object);
|
|
|
4573 Lisp_Object signal_wrong_number_of_arguments_error (Lisp_Object, int);
|
|
|
4574
|
|
428
|
4575 Lisp_Object run_hook_with_args_in_buffer (struct buffer *, int, Lisp_Object *,
|
|
|
4576 enum run_hooks_condition);
|
|
|
4577 Lisp_Object run_hook_with_args (int, Lisp_Object *, enum run_hooks_condition);
|
|
|
4578 void va_run_hook_with_args (Lisp_Object, int, ...);
|
|
|
4579 void va_run_hook_with_args_in_buffer (struct buffer *, Lisp_Object, int, ...);
|
|
|
4580 Lisp_Object run_hook (Lisp_Object);
|
|
1706
|
4581 MODULE_API Lisp_Object apply1 (Lisp_Object, Lisp_Object);
|
|
|
4582 MODULE_API Lisp_Object call0 (Lisp_Object);
|
|
|
4583 MODULE_API Lisp_Object call1 (Lisp_Object, Lisp_Object);
|
|
|
4584 MODULE_API Lisp_Object call2 (Lisp_Object, Lisp_Object, Lisp_Object);
|
|
|
4585 MODULE_API Lisp_Object call3 (Lisp_Object, Lisp_Object, Lisp_Object,
|
|
|
4586 Lisp_Object);
|
|
|
4587 MODULE_API Lisp_Object call4 (Lisp_Object, Lisp_Object, Lisp_Object,
|
|
|
4588 Lisp_Object, Lisp_Object);
|
|
|
4589 MODULE_API Lisp_Object call5 (Lisp_Object, Lisp_Object, Lisp_Object,
|
|
|
4590 Lisp_Object, Lisp_Object, Lisp_Object);
|
|
|
4591 MODULE_API Lisp_Object call6 (Lisp_Object, Lisp_Object, Lisp_Object,
|
|
|
4592 Lisp_Object, Lisp_Object, Lisp_Object,
|
|
|
4593 Lisp_Object);
|
|
|
4594 MODULE_API Lisp_Object call7 (Lisp_Object, Lisp_Object, Lisp_Object,
|
|
|
4595 Lisp_Object, Lisp_Object, Lisp_Object,
|
|
|
4596 Lisp_Object, Lisp_Object);
|
|
|
4597 MODULE_API Lisp_Object call8 (Lisp_Object, Lisp_Object, Lisp_Object,
|
|
|
4598 Lisp_Object, Lisp_Object, Lisp_Object,
|
|
|
4599 Lisp_Object, Lisp_Object, Lisp_Object);
|
|
428
|
4600 Lisp_Object call0_in_buffer (struct buffer *, Lisp_Object);
|
|
|
4601 Lisp_Object call1_in_buffer (struct buffer *, Lisp_Object, Lisp_Object);
|
|
|
4602 Lisp_Object call2_in_buffer (struct buffer *, Lisp_Object, Lisp_Object,
|
|
|
4603 Lisp_Object);
|
|
|
4604 Lisp_Object call3_in_buffer (struct buffer *, Lisp_Object, Lisp_Object,
|
|
|
4605 Lisp_Object, Lisp_Object);
|
|
|
4606 Lisp_Object call4_in_buffer (struct buffer *, Lisp_Object, Lisp_Object,
|
|
|
4607 Lisp_Object, Lisp_Object, Lisp_Object);
|
|
|
4608 Lisp_Object call5_in_buffer (struct buffer *, Lisp_Object, Lisp_Object,
|
|
|
4609 Lisp_Object, Lisp_Object, Lisp_Object,
|
|
|
4610 Lisp_Object);
|
|
|
4611 Lisp_Object call6_in_buffer (struct buffer *, Lisp_Object, Lisp_Object,
|
|
|
4612 Lisp_Object, Lisp_Object, Lisp_Object,
|
|
|
4613 Lisp_Object, Lisp_Object);
|
|
|
4614 Lisp_Object eval_in_buffer (struct buffer *, Lisp_Object);
|
|
853
|
4615
|
|
|
4616 struct call_trapping_problems_result
|
|
|
4617 {
|
|
|
4618 int caught_error, caught_throw;
|
|
|
4619 Lisp_Object error_conditions, data;
|
|
|
4620 Lisp_Object backtrace;
|
|
|
4621 Lisp_Object thrown_tag;
|
|
|
4622 Lisp_Object thrown_value;
|
|
|
4623 };
|
|
|
4624
|
|
|
4625 #define NO_INHIBIT_ERRORS (1<<0)
|
|
|
4626 #define NO_INHIBIT_THROWS (1<<1)
|
|
|
4627 #define INTERNAL_INHIBIT_ERRORS (1<<0)
|
|
|
4628 #define INTERNAL_INHIBIT_THROWS (1<<1)
|
|
|
4629 #define INHIBIT_WARNING_ISSUE (1<<2)
|
|
|
4630 #define ISSUE_WARNINGS_AT_DEBUG_LEVEL (1<<3)
|
|
|
4631 #define INHIBIT_QUIT (1<<4)
|
|
|
4632 #define UNINHIBIT_QUIT (1<<5)
|
|
|
4633 #define INHIBIT_GC (1<<6)
|
|
|
4634 #define INHIBIT_EXISTING_PERMANENT_DISPLAY_OBJECT_DELETION (1<<7)
|
|
|
4635 #define INHIBIT_EXISTING_CODING_SYSTEM_DELETION (1<<8)
|
|
|
4636 #define INHIBIT_EXISTING_CHARSET_DELETION (1<<9)
|
|
|
4637 #define INHIBIT_PERMANENT_DISPLAY_OBJECT_CREATION (1<<10)
|
|
|
4638 #define INHIBIT_CODING_SYSTEM_CREATION (1<<11)
|
|
|
4639 #define INHIBIT_CHARSET_CREATION (1<<12)
|
|
|
4640 #define INHIBIT_EXISTING_BUFFER_TEXT_MODIFICATION (1<<13)
|
|
|
4641 #define INHIBIT_ANY_CHANGE_AFFECTING_REDISPLAY (1<<14)
|
|
|
4642 #define INHIBIT_ENTERING_DEBUGGER (1<<15)
|
|
|
4643 #define CALL_WITH_SUSPENDED_ERRORS (1<<16)
|
|
1333
|
4644 #define POSTPONE_WARNING_ISSUE (1<<17)
|
|
853
|
4645
|
|
|
4646 enum check_allowed_operation
|
|
|
4647 {
|
|
|
4648 OPERATION_DELETE_OBJECT,
|
|
|
4649 OPERATION_CREATE_OBJECT,
|
|
|
4650 OPERATION_MODIFY_BUFFER_TEXT,
|
|
1429
|
4651 OPERATION_MODIFY_OBJECT_PROPERTY
|
|
853
|
4652 };
|
|
|
4653
|
|
|
4654 int get_inhibit_flags (void);
|
|
|
4655 void check_allowed_operation (int what, Lisp_Object obj, Lisp_Object prop);
|
|
|
4656 void note_object_created (Lisp_Object obj);
|
|
|
4657 void note_object_deleted (Lisp_Object obj);
|
|
|
4658 Lisp_Object call_with_condition_handler (Lisp_Object (*handler) (Lisp_Object,
|
|
|
4659 Lisp_Object,
|
|
|
4660 Lisp_Object),
|
|
|
4661 Lisp_Object handler_arg,
|
|
|
4662 Lisp_Object (*fun) (Lisp_Object),
|
|
|
4663 Lisp_Object arg);
|
|
1318
|
4664 int set_trapping_problems_flags (int flags);
|
|
853
|
4665 Lisp_Object call_trapping_problems (Lisp_Object warning_class,
|
|
2367
|
4666 const Ascbyte *warning_string,
|
|
853
|
4667 int flags,
|
|
|
4668 struct call_trapping_problems_result
|
|
|
4669 *problem,
|
|
|
4670 Lisp_Object (*fun) (void *),
|
|
|
4671 void *arg);
|
|
|
4672 Lisp_Object va_call_trapping_problems (Lisp_Object warning_class,
|
|
2367
|
4673 const Ascbyte *warning_string,
|
|
853
|
4674 int flags,
|
|
|
4675 struct call_trapping_problems_result
|
|
|
4676 *problem,
|
|
|
4677 lisp_fn_t fun, int nargs, ...);
|
|
2367
|
4678 Lisp_Object call0_trapping_problems (const Ascbyte *, Lisp_Object, int);
|
|
|
4679 Lisp_Object call1_trapping_problems (const Ascbyte *, Lisp_Object, Lisp_Object,
|
|
853
|
4680 int);
|
|
2367
|
4681 Lisp_Object call2_trapping_problems (const Ascbyte *, Lisp_Object, Lisp_Object,
|
|
853
|
4682 Lisp_Object, int);
|
|
2367
|
4683 Lisp_Object call3_trapping_problems (const Ascbyte *, Lisp_Object, Lisp_Object,
|
|
853
|
4684 Lisp_Object, Lisp_Object, int);
|
|
2367
|
4685 Lisp_Object call4_trapping_problems (const Ascbyte *, Lisp_Object, Lisp_Object,
|
|
853
|
4686 Lisp_Object, Lisp_Object, Lisp_Object,
|
|
|
4687 int);
|
|
2367
|
4688 Lisp_Object call5_trapping_problems (const Ascbyte *, Lisp_Object, Lisp_Object,
|
|
853
|
4689 Lisp_Object, Lisp_Object, Lisp_Object,
|
|
|
4690 Lisp_Object, int);
|
|
2367
|
4691 Lisp_Object eval_in_buffer_trapping_problems (const Ascbyte *, struct buffer *,
|
|
853
|
4692 Lisp_Object, int);
|
|
1333
|
4693 Lisp_Object run_hook_trapping_problems (Lisp_Object, Lisp_Object, int);
|
|
|
4694 Lisp_Object safe_run_hook_trapping_problems (Lisp_Object, Lisp_Object, int);
|
|
|
4695 Lisp_Object run_hook_with_args_in_buffer_trapping_problems (Lisp_Object,
|
|
|
4696 struct buffer *,
|
|
|
4697 int nargs,
|
|
853
|
4698 Lisp_Object *args,
|
|
|
4699 enum
|
|
|
4700 run_hooks_condition
|
|
|
4701 cond, int flags);
|
|
1333
|
4702 Lisp_Object run_hook_with_args_trapping_problems (Lisp_Object,
|
|
853
|
4703 int nargs,
|
|
|
4704 Lisp_Object *args,
|
|
|
4705 enum run_hooks_condition
|
|
|
4706 cond,
|
|
|
4707 int flags);
|
|
1333
|
4708 Lisp_Object va_run_hook_with_args_trapping_problems (Lisp_Object,
|
|
853
|
4709 Lisp_Object hook_var,
|
|
|
4710 int nargs, ...);
|
|
1333
|
4711 Lisp_Object va_run_hook_with_args_in_buffer_trapping_problems (Lisp_Object,
|
|
|
4712 struct buffer *,
|
|
|
4713 Lisp_Object,
|
|
853
|
4714 int nargs, ...);
|
|
|
4715 Lisp_Object call_with_suspended_errors (lisp_fn_t, Lisp_Object,
|
|
|
4716 Lisp_Object,
|
|
578
|
4717 Error_Behavior, int, ...);
|
|
428
|
4718 /* C Code should be using internal_catch, record_unwind_p, condition_case_1 */
|
|
1318
|
4719 int proper_redisplay_wrapping_in_place (void);
|
|
428
|
4720 Lisp_Object internal_catch (Lisp_Object, Lisp_Object (*) (Lisp_Object),
|
|
853
|
4721 Lisp_Object, int * volatile,
|
|
2532
|
4722 Lisp_Object * volatile,
|
|
853
|
4723 Lisp_Object * volatile);
|
|
428
|
4724 Lisp_Object condition_case_1 (Lisp_Object,
|
|
|
4725 Lisp_Object (*) (Lisp_Object),
|
|
|
4726 Lisp_Object,
|
|
|
4727 Lisp_Object (*) (Lisp_Object, Lisp_Object),
|
|
|
4728 Lisp_Object);
|
|
|
4729 Lisp_Object condition_case_3 (Lisp_Object, Lisp_Object, Lisp_Object);
|
|
1632
|
4730 MODULE_API Lisp_Object unbind_to_1 (int, Lisp_Object);
|
|
771
|
4731 #define unbind_to(obj) unbind_to_1 (obj, Qnil)
|
|
428
|
4732 void specbind (Lisp_Object, Lisp_Object);
|
|
1632
|
4733 MODULE_API int record_unwind_protect (Lisp_Object (*) (Lisp_Object),
|
|
|
4734 Lisp_Object);
|
|
771
|
4735 int record_unwind_protect_freeing_dynarr (void *ptr);
|
|
1333
|
4736 int record_unwind_protect_restoring_int (int *addr, int val);
|
|
802
|
4737 int internal_bind_int (int *addr, int newval);
|
|
|
4738 int internal_bind_lisp_object (Lisp_Object *addr, Lisp_Object newval);
|
|
970
|
4739 void do_autoload (Lisp_Object, Lisp_Object); /* GCPROs both arguments */
|
|
428
|
4740 Lisp_Object un_autoload (Lisp_Object);
|
|
|
4741 void warn_when_safe_lispobj (Lisp_Object, Lisp_Object, Lisp_Object);
|
|
1632
|
4742 MODULE_API void warn_when_safe (Lisp_Object, Lisp_Object, const CIbyte *,
|
|
|
4743 ...) PRINTF_ARGS (3, 4);
|
|
1292
|
4744 extern int backtrace_with_internal_sections;
|
|
428
|
4745
|
|
1315
|
4746 extern Lisp_Object Vstack_trace_on_error;
|
|
428
|
4747
|
|
|
4748 /* Defined in event-stream.c */
|
|
826
|
4749 EXFUN (Faccept_process_output, 3);
|
|
|
4750 EXFUN (Fadd_timeout, 4);
|
|
|
4751 EXFUN (Fdisable_timeout, 1);
|
|
|
4752 EXFUN (Fdiscard_input, 0);
|
|
|
4753 EXFUN (Fdispatch_event, 1);
|
|
|
4754 EXFUN (Fenqueue_eval_event, 2);
|
|
|
4755 EXFUN (Fnext_event, 2);
|
|
|
4756 EXFUN (Fread_key_sequence, 3);
|
|
|
4757 EXFUN (Fsit_for, 2);
|
|
|
4758 EXFUN (Fsleep_for, 1);
|
|
|
4759
|
|
428
|
4760 void wait_delaying_user_input (int (*) (void *), void *);
|
|
1268
|
4761 int detect_input_pending (int how_many);
|
|
428
|
4762 void reset_this_command_keys (Lisp_Object, int);
|
|
|
4763 Lisp_Object enqueue_misc_user_event (Lisp_Object, Lisp_Object, Lisp_Object);
|
|
|
4764 Lisp_Object enqueue_misc_user_event_pos (Lisp_Object, Lisp_Object,
|
|
|
4765 Lisp_Object, int, int, int, int);
|
|
442
|
4766 extern int modifier_keys_are_sticky;
|
|
428
|
4767
|
|
|
4768 /* Defined in event-Xt.c */
|
|
|
4769 void signal_special_Xt_user_event (Lisp_Object, Lisp_Object, Lisp_Object);
|
|
|
4770
|
|
|
4771
|
|
|
4772 /* Defined in events.c */
|
|
826
|
4773 EXFUN (Fcopy_event, 2);
|
|
2862
|
4774 EXFUN (Fevent_to_character, 4);
|
|
826
|
4775
|
|
428
|
4776 void clear_event_resource (void);
|
|
|
4777 Lisp_Object allocate_event (void);
|
|
|
4778
|
|
771
|
4779 EXFUN (Fevent_x_pixel, 1);
|
|
|
4780 EXFUN (Fevent_y_pixel, 1);
|
|
|
4781
|
|
|
4782
|
|
|
4783 /* Defined in file-coding.c */
|
|
|
4784 EXFUN (Fcoding_category_list, 0);
|
|
|
4785 EXFUN (Fcoding_category_system, 1);
|
|
|
4786 EXFUN (Fcoding_priority_list, 0);
|
|
|
4787 EXFUN (Fcoding_system_description, 1);
|
|
|
4788 EXFUN (Fcoding_system_documentation, 1);
|
|
|
4789 EXFUN (Fcoding_system_list, 1);
|
|
|
4790 EXFUN (Fcoding_system_name, 1);
|
|
|
4791 EXFUN (Fcoding_system_p, 1);
|
|
|
4792 EXFUN (Fcoding_system_property, 2);
|
|
|
4793 EXFUN (Fcoding_system_type, 1);
|
|
|
4794 EXFUN (Fcopy_coding_system, 2);
|
|
|
4795 EXFUN (Fdecode_big5_char, 1);
|
|
|
4796 EXFUN (Fdecode_coding_region, 4);
|
|
|
4797 EXFUN (Fdecode_shift_jis_char, 1);
|
|
|
4798 EXFUN (Fdefine_coding_system_alias, 2);
|
|
|
4799 EXFUN (Fdetect_coding_region, 3);
|
|
|
4800 EXFUN (Fdefault_encoding_detection_enabled_p, 0);
|
|
|
4801 EXFUN (Fencode_big5_char, 1);
|
|
|
4802 EXFUN (Fencode_coding_region, 4);
|
|
|
4803 EXFUN (Fencode_shift_jis_char, 1);
|
|
|
4804 EXFUN (Ffind_coding_system, 1);
|
|
|
4805 EXFUN (Fget_coding_system, 1);
|
|
|
4806 EXFUN (Fmake_coding_system, 4);
|
|
|
4807 EXFUN (Fset_coding_category_system, 2);
|
|
|
4808 EXFUN (Fset_coding_priority_list, 1);
|
|
|
4809 EXFUN (Fsubsidiary_coding_system, 2);
|
|
|
4810
|
|
|
4811 extern Lisp_Object Qshift_jis, Qiso2022, Qbig5, Qccl;
|
|
|
4812 extern Lisp_Object Qcharset_g0;
|
|
|
4813 extern Lisp_Object Qcharset_g1, Qcharset_g2, Qcharset_g3, Qcoding_system_error;
|
|
|
4814 extern Lisp_Object Qcoding_systemp, Qcr, Qcrlf, Qdecode, Qencode;
|
|
|
4815 extern Lisp_Object Qeol_cr, Qeol_crlf, Qeol_lf, Qeol_type, Qescape_quoted;
|
|
|
4816 extern Lisp_Object Qforce_g0_on_output, Qforce_g1_on_output;
|
|
|
4817 extern Lisp_Object Qforce_g2_on_output, Qforce_g3_on_output;
|
|
|
4818 extern Lisp_Object Qinput_charset_conversion, Qlf, Qlock_shift;
|
|
|
4819 extern Lisp_Object Qmnemonic, Qno_ascii_cntl, Qno_ascii_eol;
|
|
|
4820 extern Lisp_Object Qno_conversion, Qraw_text;
|
|
|
4821 extern Lisp_Object Qno_iso6429, Qoutput_charset_conversion;
|
|
|
4822 extern Lisp_Object Qpost_read_conversion, Qpre_write_conversion, Qseven;
|
|
|
4823 extern Lisp_Object Qshort, Vcoding_system_for_read;
|
|
|
4824 extern Lisp_Object Vcoding_system_for_write;
|
|
|
4825 extern Lisp_Object Vfile_name_coding_system, Vkeyboard_coding_system;
|
|
|
4826 extern Lisp_Object Vterminal_coding_system;
|
|
|
4827 extern Lisp_Object Qcanonicalize_after_coding;
|
|
|
4828 int coding_system_is_for_text_file (Lisp_Object coding_system);
|
|
|
4829 Lisp_Object find_coding_system_for_text_file (Lisp_Object name, int eol_wrap);
|
|
1632
|
4830 MODULE_API Lisp_Object get_coding_system_for_text_file (Lisp_Object name,
|
|
|
4831 int eol_wrap);
|
|
771
|
4832 int coding_system_is_binary (Lisp_Object coding_system);
|
|
|
4833
|
|
|
4834
|
|
428
|
4835 /* Defined in fileio.c */
|
|
826
|
4836 EXFUN (Fdirectory_file_name, 1);
|
|
|
4837 EXFUN (Fdo_auto_save, 2);
|
|
|
4838 EXFUN (Fexpand_file_name, 2);
|
|
|
4839 EXFUN (Ffile_accessible_directory_p, 1);
|
|
|
4840 EXFUN (Ffile_directory_p, 1);
|
|
|
4841 EXFUN (Ffile_executable_p, 1);
|
|
|
4842 EXFUN (Ffile_exists_p, 1);
|
|
|
4843 EXFUN (Ffile_name_absolute_p, 1);
|
|
|
4844 EXFUN (Ffile_name_as_directory, 1);
|
|
|
4845 EXFUN (Ffile_name_directory, 1);
|
|
|
4846 EXFUN (Ffile_name_nondirectory, 1);
|
|
|
4847 EXFUN (Ffile_readable_p, 1);
|
|
|
4848 EXFUN (Ffile_symlink_p, 1);
|
|
|
4849 EXFUN (Ffile_truename, 2);
|
|
|
4850 EXFUN (Ffind_file_name_handler, 2);
|
|
|
4851 EXFUN (Finsert_file_contents_internal, 7);
|
|
|
4852 EXFUN (Fmake_temp_name, 1);
|
|
|
4853 EXFUN (Fsubstitute_in_file_name, 1);
|
|
|
4854 EXFUN (Funhandled_file_name_directory, 1);
|
|
|
4855 EXFUN (Fverify_visited_file_modtime, 1);
|
|
|
4856
|
|
428
|
4857 void record_auto_save (void);
|
|
|
4858 void force_auto_save_soon (void);
|
|
563
|
4859 DECLARE_DOESNT_RETURN (report_error_with_errno (Lisp_Object errtype,
|
|
867
|
4860 const CIbyte *string,
|
|
563
|
4861 Lisp_Object data));
|
|
|
4862 DECLARE_DOESNT_RETURN (report_file_type_error (Lisp_Object errtype,
|
|
|
4863 Lisp_Object oserrmess,
|
|
867
|
4864 const CIbyte *string,
|
|
563
|
4865 Lisp_Object data));
|
|
867
|
4866 DECLARE_DOESNT_RETURN (report_file_error (const CIbyte *, Lisp_Object));
|
|
428
|
4867 Lisp_Object lisp_strerror (int);
|
|
|
4868 Lisp_Object expand_and_dir_to_file (Lisp_Object, Lisp_Object);
|
|
|
4869 int internal_delete_file (Lisp_Object);
|
|
2526
|
4870 Ibyte *find_end_of_directory_component (const Ibyte *path,
|
|
|
4871 Bytecount len);
|
|
428
|
4872
|
|
|
4873 /* Defined in filelock.c */
|
|
826
|
4874 EXFUN (Funlock_buffer, 0);
|
|
|
4875
|
|
428
|
4876 void lock_file (Lisp_Object);
|
|
|
4877 void unlock_file (Lisp_Object);
|
|
|
4878 void unlock_all_files (void);
|
|
|
4879 void unlock_buffer (struct buffer *);
|
|
|
4880
|
|
|
4881 /* Defined in floatfns.c */
|
|
826
|
4882 EXFUN (Ftruncate, 1);
|
|
|
4883
|
|
428
|
4884 double extract_float (Lisp_Object);
|
|
|
4885
|
|
|
4886 /* Defined in fns.c */
|
|
1632
|
4887 MODULE_API EXFUN (Fappend, MANY);
|
|
826
|
4888 EXFUN (Fassoc, 2);
|
|
|
4889 EXFUN (Fassq, 2);
|
|
|
4890 EXFUN (Fcanonicalize_lax_plist, 2);
|
|
|
4891 EXFUN (Fcanonicalize_plist, 2);
|
|
|
4892 EXFUN (Fcheck_valid_plist, 1);
|
|
|
4893 EXFUN (Fconcat, MANY);
|
|
|
4894 EXFUN (Fcopy_alist, 1);
|
|
|
4895 EXFUN (Fcopy_list, 1);
|
|
|
4896 EXFUN (Fcopy_sequence, 1);
|
|
|
4897 EXFUN (Fcopy_tree, 2);
|
|
|
4898 EXFUN (Fdelete, 2);
|
|
|
4899 EXFUN (Fdelq, 2);
|
|
|
4900 EXFUN (Fdestructive_alist_to_plist, 1);
|
|
|
4901 EXFUN (Felt, 2);
|
|
1632
|
4902 MODULE_API EXFUN (Fequal, 2);
|
|
|
4903 MODULE_API EXFUN (Fget, 3);
|
|
826
|
4904 EXFUN (Flast, 2);
|
|
|
4905 EXFUN (Flax_plist_get, 3);
|
|
|
4906 EXFUN (Flax_plist_remprop, 2);
|
|
1632
|
4907 MODULE_API EXFUN (Flength, 1);
|
|
826
|
4908 EXFUN (Fmapcar, 2);
|
|
|
4909 EXFUN (Fmember, 2);
|
|
|
4910 EXFUN (Fmemq, 2);
|
|
|
4911 EXFUN (Fnconc, MANY);
|
|
1632
|
4912 MODULE_API EXFUN (Fnreverse, 1);
|
|
826
|
4913 EXFUN (Fnthcdr, 2);
|
|
|
4914 EXFUN (Fold_assq, 2);
|
|
|
4915 EXFUN (Fold_equal, 2);
|
|
|
4916 EXFUN (Fold_member, 2);
|
|
|
4917 EXFUN (Fold_memq, 2);
|
|
|
4918 EXFUN (Fplist_get, 3);
|
|
|
4919 EXFUN (Fplist_member, 2);
|
|
|
4920 EXFUN (Fplist_put, 3);
|
|
1632
|
4921 MODULE_API EXFUN (Fprovide, 1);
|
|
|
4922 MODULE_API EXFUN (Fput, 3);
|
|
826
|
4923 EXFUN (Frassq, 2);
|
|
|
4924 EXFUN (Fremassq, 2);
|
|
|
4925 EXFUN (Freplace_list, 2);
|
|
1632
|
4926 MODULE_API EXFUN (Freverse, 1);
|
|
1268
|
4927 EXFUN (Fsafe_length, 1);
|
|
826
|
4928 EXFUN (Fsort, 2);
|
|
|
4929 EXFUN (Fstring_equal, 2);
|
|
|
4930 EXFUN (Fstring_lessp, 2);
|
|
|
4931 EXFUN (Fsubstring, 3);
|
|
|
4932 EXFUN (Fvalid_plist_p, 1);
|
|
|
4933
|
|
428
|
4934 Lisp_Object list_sort (Lisp_Object, Lisp_Object,
|
|
|
4935 int (*) (Lisp_Object, Lisp_Object, Lisp_Object));
|
|
|
4936 Lisp_Object merge (Lisp_Object, Lisp_Object, Lisp_Object);
|
|
|
4937
|
|
|
4938 void bump_string_modiff (Lisp_Object);
|
|
|
4939 Lisp_Object memq_no_quit (Lisp_Object, Lisp_Object);
|
|
|
4940 Lisp_Object assoc_no_quit (Lisp_Object, Lisp_Object);
|
|
|
4941 Lisp_Object assq_no_quit (Lisp_Object, Lisp_Object);
|
|
|
4942 Lisp_Object rassq_no_quit (Lisp_Object, Lisp_Object);
|
|
|
4943 Lisp_Object delq_no_quit (Lisp_Object, Lisp_Object);
|
|
|
4944 Lisp_Object delq_no_quit_and_free_cons (Lisp_Object, Lisp_Object);
|
|
|
4945 Lisp_Object remassoc_no_quit (Lisp_Object, Lisp_Object);
|
|
|
4946 Lisp_Object remassq_no_quit (Lisp_Object, Lisp_Object);
|
|
|
4947 Lisp_Object remrassq_no_quit (Lisp_Object, Lisp_Object);
|
|
|
4948
|
|
|
4949 int plists_differ (Lisp_Object, Lisp_Object, int, int, int);
|
|
|
4950 Lisp_Object internal_plist_get (Lisp_Object, Lisp_Object);
|
|
|
4951 void internal_plist_put (Lisp_Object *, Lisp_Object, Lisp_Object);
|
|
|
4952 int internal_remprop (Lisp_Object *, Lisp_Object);
|
|
|
4953 Lisp_Object external_plist_get (Lisp_Object *, Lisp_Object,
|
|
578
|
4954 int, Error_Behavior);
|
|
428
|
4955 void external_plist_put (Lisp_Object *, Lisp_Object,
|
|
578
|
4956 Lisp_Object, int, Error_Behavior);
|
|
|
4957 int external_remprop (Lisp_Object *, Lisp_Object, int, Error_Behavior);
|
|
853
|
4958 int internal_equal_trapping_problems (Lisp_Object warning_class,
|
|
2367
|
4959 const Ascbyte *warning_string,
|
|
853
|
4960 int flags,
|
|
|
4961 struct call_trapping_problems_result *p,
|
|
|
4962 int retval,
|
|
|
4963 Lisp_Object obj1, Lisp_Object obj2,
|
|
|
4964 int depth);
|
|
428
|
4965 int internal_equal (Lisp_Object, Lisp_Object, int);
|
|
801
|
4966 int internal_equalp (Lisp_Object obj1, Lisp_Object obj2, int depth);
|
|
428
|
4967 Lisp_Object concat2 (Lisp_Object, Lisp_Object);
|
|
|
4968 Lisp_Object concat3 (Lisp_Object, Lisp_Object, Lisp_Object);
|
|
|
4969 Lisp_Object vconcat2 (Lisp_Object, Lisp_Object);
|
|
|
4970 Lisp_Object vconcat3 (Lisp_Object, Lisp_Object, Lisp_Object);
|
|
|
4971 Lisp_Object nconc2 (Lisp_Object, Lisp_Object);
|
|
|
4972 Lisp_Object bytecode_nconc2 (Lisp_Object *);
|
|
442
|
4973 void check_losing_bytecode (const char *, Lisp_Object);
|
|
428
|
4974
|
|
771
|
4975 Lisp_Object add_suffix_to_symbol (Lisp_Object symbol,
|
|
2367
|
4976 const Ascbyte *ascii_string);
|
|
|
4977 Lisp_Object add_prefix_to_symbol (const Ascbyte *ascii_string,
|
|
771
|
4978 Lisp_Object symbol);
|
|
|
4979
|
|
826
|
4980 /* Defined in free-hook.c */
|
|
|
4981 EXFUN (Freally_free, 1);
|
|
|
4982
|
|
428
|
4983 /* Defined in glyphs.c */
|
|
826
|
4984 EXFUN (Fmake_glyph_internal, 1);
|
|
|
4985
|
|
578
|
4986 Error_Behavior decode_error_behavior_flag (Lisp_Object);
|
|
|
4987 Lisp_Object encode_error_behavior_flag (Error_Behavior);
|
|
428
|
4988
|
|
563
|
4989 /* Defined in glyphs-shared.c */
|
|
|
4990 void shared_resource_validate (Lisp_Object instantiator);
|
|
|
4991 Lisp_Object shared_resource_normalize (Lisp_Object inst,
|
|
|
4992 Lisp_Object console_type,
|
|
|
4993 Lisp_Object dest_mask,
|
|
|
4994 Lisp_Object tag);
|
|
|
4995 extern Lisp_Object Q_resource_type, Q_resource_id;
|
|
|
4996
|
|
|
4997 /* Defined in gui.c */
|
|
2367
|
4998 DECLARE_DOESNT_RETURN (gui_error (const Ascbyte *reason,
|
|
563
|
4999 Lisp_Object frob));
|
|
2367
|
5000 DECLARE_DOESNT_RETURN (gui_error_2 (const Ascbyte *reason,
|
|
569
|
5001 Lisp_Object frob0, Lisp_Object frob1));
|
|
428
|
5002 /* Defined in indent.c */
|
|
826
|
5003 EXFUN (Findent_to, 3);
|
|
|
5004 EXFUN (Fvertical_motion, 3);
|
|
|
5005
|
|
|
5006 int byte_spaces_at_point (struct buffer *, Bytebpos);
|
|
665
|
5007 int column_at_point (struct buffer *, Charbpos, int);
|
|
793
|
5008 int string_column_at_point (Lisp_Object, Charbpos, int);
|
|
428
|
5009 int current_column (struct buffer *);
|
|
|
5010 void invalidate_current_column (void);
|
|
665
|
5011 Charbpos vmotion (struct window *, Charbpos, int, int *);
|
|
|
5012 Charbpos vmotion_pixels (Lisp_Object, Charbpos, int, int, int *);
|
|
428
|
5013
|
|
771
|
5014 /* Defined in insdel.c */
|
|
|
5015 void set_buffer_point (struct buffer *buf, Charbpos pos, Bytebpos bipos);
|
|
|
5016
|
|
826
|
5017 /* Defined in intl.c */
|
|
|
5018 EXFUN (Fgettext, 1);
|
|
|
5019
|
|
428
|
5020 /* Defined in keymap.c */
|
|
826
|
5021 EXFUN (Fdefine_key, 3);
|
|
|
5022 EXFUN (Fkey_description, 1);
|
|
|
5023 EXFUN (Flookup_key, 3);
|
|
|
5024 EXFUN (Fmake_sparse_keymap, 1);
|
|
|
5025
|
|
793
|
5026 void where_is_to_char (Lisp_Object, Eistring *);
|
|
428
|
5027
|
|
|
5028 /* Defined in lread.c */
|
|
826
|
5029 EXFUN (Fread, 1);
|
|
|
5030
|
|
428
|
5031 void ebolify_bytecode_constants (Lisp_Object);
|
|
|
5032 void close_load_descs (void);
|
|
|
5033 int locate_file (Lisp_Object, Lisp_Object, Lisp_Object, Lisp_Object *, int);
|
|
|
5034 EXFUN (Flocate_file_clear_hashing, 1);
|
|
442
|
5035 int isfloat_string (const char *);
|
|
1983
|
5036 #ifdef HAVE_RATIO
|
|
|
5037 int isratio_string (const char *);
|
|
|
5038 #endif
|
|
428
|
5039
|
|
|
5040 /* Well, I've decided to enable this. -- ben */
|
|
|
5041 /* And I've decided to make it work right. -- sb */
|
|
|
5042 #define LOADHIST
|
|
|
5043 /* Define the following symbol to enable load history of dumped files */
|
|
|
5044 #define LOADHIST_DUMPED
|
|
|
5045 /* Define the following symbol to enable load history of C source */
|
|
|
5046 #define LOADHIST_BUILTIN
|
|
|
5047
|
|
|
5048 #ifdef LOADHIST /* this is just a stupid idea */
|
|
|
5049 #define LOADHIST_ATTACH(x) \
|
|
|
5050 do { if (initialized) Vcurrent_load_list = Fcons (x, Vcurrent_load_list); } \
|
|
|
5051 while (0)
|
|
|
5052 #else /*! LOADHIST */
|
|
|
5053 # define LOADHIST_ATTACH(x)
|
|
|
5054 #endif /*! LOADHIST */
|
|
|
5055
|
|
826
|
5056 /* Defined in macros.c */
|
|
|
5057 EXFUN (Fexecute_kbd_macro, 2);
|
|
|
5058
|
|
428
|
5059 /* Defined in marker.c */
|
|
826
|
5060 EXFUN (Fcopy_marker, 2);
|
|
|
5061 EXFUN (Fmake_marker, 0);
|
|
|
5062 EXFUN (Fmarker_buffer, 1);
|
|
|
5063 EXFUN (Fmarker_position, 1);
|
|
|
5064 EXFUN (Fset_marker, 3);
|
|
|
5065 EXFUN (Fset_marker_insertion_type, 2);
|
|
|
5066
|
|
|
5067 Bytebpos byte_marker_position (Lisp_Object);
|
|
665
|
5068 Charbpos marker_position (Lisp_Object);
|
|
826
|
5069 void set_byte_marker_position (Lisp_Object, Bytebpos);
|
|
665
|
5070 void set_marker_position (Lisp_Object, Charbpos);
|
|
428
|
5071 void unchain_marker (Lisp_Object);
|
|
|
5072 Lisp_Object noseeum_copy_marker (Lisp_Object, Lisp_Object);
|
|
|
5073 Lisp_Object set_marker_restricted (Lisp_Object, Lisp_Object, Lisp_Object);
|
|
|
5074 #ifdef MEMORY_USAGE_STATS
|
|
|
5075 int compute_buffer_marker_usage (struct buffer *, struct overhead_stats *);
|
|
|
5076 #endif
|
|
771
|
5077 void init_buffer_markers (struct buffer *b);
|
|
|
5078 void uninit_buffer_markers (struct buffer *b);
|
|
428
|
5079
|
|
|
5080 /* Defined in minibuf.c */
|
|
|
5081 extern int minibuf_level;
|
|
867
|
5082 Charcount scmp_1 (const Ibyte *, const Ibyte *, Charcount, int);
|
|
428
|
5083 #define scmp(s1, s2, len) scmp_1 (s1, s2, len, completion_ignore_case)
|
|
|
5084 extern int completion_ignore_case;
|
|
867
|
5085 int regexp_ignore_completion_p (const Ibyte *, Lisp_Object,
|
|
428
|
5086 Bytecount, Bytecount);
|
|
|
5087 Lisp_Object clear_echo_area (struct frame *, Lisp_Object, int);
|
|
|
5088 Lisp_Object clear_echo_area_from_print (struct frame *, Lisp_Object, int);
|
|
867
|
5089 void echo_area_append (struct frame *, const Ibyte *, Lisp_Object,
|
|
428
|
5090 Bytecount, Bytecount, Lisp_Object);
|
|
867
|
5091 void echo_area_message (struct frame *, const Ibyte *, Lisp_Object,
|
|
428
|
5092 Bytecount, Bytecount, Lisp_Object);
|
|
|
5093 Lisp_Object echo_area_status (struct frame *);
|
|
|
5094 int echo_area_active (struct frame *);
|
|
|
5095 Lisp_Object echo_area_contents (struct frame *);
|
|
867
|
5096 void message_internal (const Ibyte *, Lisp_Object, Bytecount, Bytecount);
|
|
|
5097 void message_append_internal (const Ibyte *, Lisp_Object,
|
|
428
|
5098 Bytecount, Bytecount);
|
|
1632
|
5099 MODULE_API void message (const char *, ...) PRINTF_ARGS (1, 2);
|
|
442
|
5100 void message_append (const char *, ...) PRINTF_ARGS (1, 2);
|
|
|
5101 void message_no_translate (const char *, ...) PRINTF_ARGS (1, 2);
|
|
428
|
5102 void clear_message (void);
|
|
|
5103
|
|
771
|
5104 /* Defined in mule-charset.c */
|
|
826
|
5105 EXFUN (Fmake_charset, 3);
|
|
|
5106
|
|
771
|
5107 extern Lisp_Object Ql2r, Qr2l;
|
|
|
5108
|
|
428
|
5109 /* Defined in print.c */
|
|
826
|
5110 EXFUN (Fdisplay_error, 2);
|
|
|
5111 EXFUN (Ferror_message_string, 1);
|
|
|
5112 EXFUN (Fprin1, 2);
|
|
|
5113 EXFUN (Fprin1_to_string, 2);
|
|
|
5114 EXFUN (Fprinc, 2);
|
|
|
5115 EXFUN (Fprint, 2);
|
|
|
5116
|
|
771
|
5117
|
|
|
5118 /* Lower-level ways to output data: */
|
|
3085
|
5119 void default_object_printer (Lisp_Object, Lisp_Object, int);
|
|
771
|
5120 void print_internal (Lisp_Object, Lisp_Object, int);
|
|
428
|
5121 void debug_print (Lisp_Object);
|
|
1204
|
5122 void debug_p4 (Lisp_Object obj);
|
|
|
5123 void debug_p3 (Lisp_Object obj);
|
|
|
5124 void debug_short_backtrace (int);
|
|
|
5125 void debug_backtrace (void);
|
|
428
|
5126 /* NOTE: Do not call this with the data of a Lisp_String. Use princ.
|
|
|
5127 * Note: stream should be defaulted before calling
|
|
|
5128 * (eg Qnil means stdout, not Vstandard_output, etc) */
|
|
1632
|
5129 MODULE_API void write_c_string (Lisp_Object stream, const CIbyte *str);
|
|
771
|
5130 /* Same goes for this function. */
|
|
1632
|
5131 MODULE_API void write_string (Lisp_Object stream, const Ibyte *str);
|
|
428
|
5132 /* Same goes for this function. */
|
|
867
|
5133 void write_string_1 (Lisp_Object stream, const Ibyte *str, Bytecount size);
|
|
826
|
5134 void write_eistring (Lisp_Object stream, const Eistring *ei);
|
|
771
|
5135
|
|
|
5136 /* Higher-level (printf-style) ways to output data: */
|
|
1632
|
5137 MODULE_API void write_fmt_string (Lisp_Object stream, const CIbyte *fmt, ...);
|
|
|
5138 MODULE_API void write_fmt_string_lisp (Lisp_Object stream, const CIbyte *fmt,
|
|
|
5139 int nargs, ...);
|
|
867
|
5140 void stderr_out (const CIbyte *, ...) PRINTF_ARGS (1, 2);
|
|
|
5141 void stderr_out_lisp (const CIbyte *, int nargs, ...);
|
|
|
5142 void stdout_out (const CIbyte *, ...) PRINTF_ARGS (1, 2);
|
|
1346
|
5143 void external_out (int dest, const CIbyte *fmt, ...) PRINTF_ARGS (2, 3);
|
|
867
|
5144 void debug_out (const CIbyte *, ...) PRINTF_ARGS (1, 2);
|
|
1743
|
5145 DECLARE_DOESNT_RETURN (fatal (const CIbyte *, ...)) PRINTF_ARGS(1, 2);
|
|
771
|
5146
|
|
|
5147 /* Internal functions: */
|
|
1261
|
5148 Lisp_Object canonicalize_printcharfun (Lisp_Object printcharfun);
|
|
771
|
5149 void temp_output_buffer_setup (Lisp_Object);
|
|
|
5150 void temp_output_buffer_show (Lisp_Object, Lisp_Object);
|
|
428
|
5151 void print_cons (Lisp_Object, Lisp_Object, int);
|
|
|
5152 void print_vector (Lisp_Object, Lisp_Object, int);
|
|
|
5153 void print_string (Lisp_Object, Lisp_Object, int);
|
|
771
|
5154 void print_symbol (Lisp_Object, Lisp_Object, int);
|
|
|
5155 void print_float (Lisp_Object, Lisp_Object, int);
|
|
603
|
5156 /* The number of bytes required to store the decimal printed
|
|
|
5157 representation of an integral type. Add a few bytes for truncation,
|
|
|
5158 optional sign prefix, and null byte terminator.
|
|
614
|
5159 2.40824 == log (256) / log (10).
|
|
|
5160
|
|
|
5161 We don't use floating point since Sun cc (buggily?) cannot use
|
|
|
5162 floating point computations to define a compile-time integral
|
|
|
5163 constant. */
|
|
603
|
5164 #define DECIMAL_PRINT_SIZE(integral_type) \
|
|
614
|
5165 (((2410824 * sizeof (integral_type)) / 1000000) + 3)
|
|
577
|
5166 void long_to_string (char *, long);
|
|
428
|
5167 extern int print_escape_newlines;
|
|
1632
|
5168 extern MODULE_API int print_readably;
|
|
428
|
5169 Lisp_Object internal_with_output_to_temp_buffer (Lisp_Object,
|
|
|
5170 Lisp_Object (*) (Lisp_Object),
|
|
|
5171 Lisp_Object, Lisp_Object);
|
|
|
5172 void float_to_string (char *, double);
|
|
|
5173 void internal_object_printer (Lisp_Object, Lisp_Object, int);
|
|
|
5174
|
|
|
5175 /* Defined in rangetab.c */
|
|
826
|
5176 EXFUN (Fclear_range_table, 1);
|
|
|
5177 EXFUN (Fget_range_table, 3);
|
|
2421
|
5178 EXFUN (Fmake_range_table, 1);
|
|
826
|
5179 EXFUN (Fput_range_table, 4);
|
|
|
5180
|
|
2421
|
5181 extern Lisp_Object Qstart_closed_end_open;
|
|
|
5182 extern Lisp_Object Qstart_open_end_open;
|
|
|
5183 extern Lisp_Object Qstart_closed_end_closed;
|
|
|
5184 extern Lisp_Object Qstart_open_end_closed;
|
|
|
5185
|
|
428
|
5186 void put_range_table (Lisp_Object, EMACS_INT, EMACS_INT, Lisp_Object);
|
|
|
5187 int unified_range_table_bytes_needed (Lisp_Object);
|
|
|
5188 int unified_range_table_bytes_used (void *);
|
|
|
5189 void unified_range_table_copy_data (Lisp_Object, void *);
|
|
|
5190 Lisp_Object unified_range_table_lookup (void *, EMACS_INT, Lisp_Object);
|
|
|
5191 int unified_range_table_nentries (void *);
|
|
|
5192 void unified_range_table_get_range (void *, int, EMACS_INT *, EMACS_INT *,
|
|
|
5193 Lisp_Object *);
|
|
|
5194
|
|
|
5195 /* Defined in search.c */
|
|
826
|
5196 EXFUN (Fmatch_beginning, 1);
|
|
|
5197 EXFUN (Fmatch_end, 1);
|
|
|
5198 EXFUN (Fskip_chars_backward, 3);
|
|
|
5199 EXFUN (Fskip_chars_forward, 3);
|
|
|
5200 EXFUN (Fstring_match, 4);
|
|
|
5201
|
|
428
|
5202 struct re_pattern_buffer;
|
|
|
5203 struct re_registers;
|
|
867
|
5204 Charbpos scan_buffer (struct buffer *, Ichar, Charbpos, Charbpos, EMACS_INT,
|
|
826
|
5205 EMACS_INT *, int);
|
|
665
|
5206 Charbpos find_next_newline (struct buffer *, Charbpos, int);
|
|
|
5207 Charbpos find_next_newline_no_quit (struct buffer *, Charbpos, int);
|
|
826
|
5208 Bytebpos byte_find_next_newline_no_quit (struct buffer *, Bytebpos, int);
|
|
867
|
5209 Bytecount byte_find_next_ichar_in_string (Lisp_Object, Ichar, Bytecount,
|
|
826
|
5210 EMACS_INT);
|
|
665
|
5211 Charbpos find_before_next_newline (struct buffer *, Charbpos, Charbpos, int);
|
|
826
|
5212 struct re_pattern_buffer *compile_pattern (Lisp_Object pattern,
|
|
|
5213 struct re_registers *regp,
|
|
|
5214 Lisp_Object translate,
|
|
|
5215 Lisp_Object searchobj,
|
|
|
5216 struct buffer *searchbuf,
|
|
|
5217 int posix, Error_Behavior errb);
|
|
867
|
5218 Bytecount fast_string_match (Lisp_Object, const Ibyte *,
|
|
428
|
5219 Lisp_Object, Bytecount,
|
|
578
|
5220 Bytecount, int, Error_Behavior, int);
|
|
428
|
5221 Bytecount fast_lisp_string_match (Lisp_Object, Lisp_Object);
|
|
507
|
5222 extern Fixnum warn_about_possibly_incompatible_back_references;
|
|
502
|
5223
|
|
428
|
5224
|
|
|
5225 /* Defined in signal.c */
|
|
|
5226 void init_interrupts_late (void);
|
|
|
5227
|
|
|
5228 /* Defined in sound.c */
|
|
826
|
5229 EXFUN (Fding, 3);
|
|
|
5230
|
|
428
|
5231 void init_device_sound (struct device *);
|
|
2367
|
5232 DECLARE_DOESNT_RETURN (report_sound_error (const Ascbyte *, Lisp_Object));
|
|
428
|
5233
|
|
|
5234 /* Defined in specifier.c */
|
|
826
|
5235 EXFUN (Fadd_spec_to_specifier, 5);
|
|
|
5236 EXFUN (Fspecifier_spec_list, 4);
|
|
|
5237
|
|
428
|
5238 Lisp_Object specifier_instance (Lisp_Object, Lisp_Object, Lisp_Object,
|
|
578
|
5239 Error_Behavior, int, int, Lisp_Object);
|
|
428
|
5240 Lisp_Object specifier_instance_no_quit (Lisp_Object, Lisp_Object, Lisp_Object,
|
|
578
|
5241 Error_Behavior, int, Lisp_Object);
|
|
428
|
5242
|
|
|
5243 /* Defined in symbols.c */
|
|
826
|
5244 EXFUN (Fboundp, 1);
|
|
|
5245 EXFUN (Fbuilt_in_variable_type, 1);
|
|
|
5246 EXFUN (Fdefault_boundp, 1);
|
|
|
5247 EXFUN (Fdefault_value, 1);
|
|
|
5248 EXFUN (Ffboundp, 1);
|
|
|
5249 EXFUN (Ffset, 2);
|
|
|
5250 EXFUN (Fintern, 2);
|
|
|
5251 EXFUN (Fintern_soft, 2);
|
|
|
5252 EXFUN (Fkill_local_variable, 1);
|
|
|
5253 EXFUN (Fset, 2);
|
|
|
5254 EXFUN (Fset_default, 2);
|
|
|
5255 EXFUN (Fsymbol_function, 1);
|
|
|
5256 EXFUN (Fsymbol_name, 1);
|
|
|
5257 EXFUN (Fsymbol_plist, 1);
|
|
|
5258 EXFUN (Fsymbol_value, 1);
|
|
|
5259
|
|
867
|
5260 unsigned int hash_string (const Ibyte *, Bytecount);
|
|
|
5261 Lisp_Object intern_int (const Ibyte *str);
|
|
1632
|
5262 MODULE_API Lisp_Object intern (const CIbyte *str);
|
|
867
|
5263 Lisp_Object intern_converting_underscores_to_dashes (const CIbyte *str);
|
|
|
5264 Lisp_Object oblookup (Lisp_Object, const Ibyte *, Bytecount);
|
|
428
|
5265 void map_obarray (Lisp_Object, int (*) (Lisp_Object, void *), void *);
|
|
|
5266 Lisp_Object indirect_function (Lisp_Object, int);
|
|
|
5267 Lisp_Object symbol_value_in_buffer (Lisp_Object, Lisp_Object);
|
|
|
5268 void kill_buffer_local_variables (struct buffer *);
|
|
|
5269 int symbol_value_buffer_local_info (Lisp_Object, struct buffer *);
|
|
|
5270 Lisp_Object find_symbol_value (Lisp_Object);
|
|
|
5271 Lisp_Object find_symbol_value_quickly (Lisp_Object, int);
|
|
|
5272 Lisp_Object top_level_value (Lisp_Object);
|
|
|
5273 void reject_constant_symbols (Lisp_Object sym, Lisp_Object newval,
|
|
|
5274 int function_p,
|
|
|
5275 Lisp_Object follow_past_lisp_magic);
|
|
|
5276
|
|
|
5277 /* Defined in syntax.c */
|
|
665
|
5278 Charbpos scan_words (struct buffer *, Charbpos, int);
|
|
826
|
5279 EXFUN (Fchar_syntax, 2);
|
|
|
5280 EXFUN (Fforward_word, 2);
|
|
|
5281 extern Lisp_Object Vstandard_syntax_table;
|
|
|
5282 void signal_syntax_table_extent_changed (EXTENT extent);
|
|
|
5283 void signal_syntax_table_extent_adjust (struct buffer *buf);
|
|
|
5284 void init_buffer_syntax_cache (struct buffer *buf);
|
|
|
5285 void mark_buffer_syntax_cache (struct buffer *buf);
|
|
|
5286 void uninit_buffer_syntax_cache (struct buffer *buf);
|
|
|
5287 extern Lisp_Object Qsyntax_table;
|
|
428
|
5288
|
|
771
|
5289 /* Defined in sysdep.c */
|
|
|
5290 long get_random (void);
|
|
|
5291 void seed_random (long arg);
|
|
|
5292
|
|
|
5293 /* Defined in text.c */
|
|
867
|
5294 void find_charsets_in_ibyte_string (unsigned char *charsets,
|
|
|
5295 const Ibyte *str,
|
|
771
|
5296 Bytecount len);
|
|
867
|
5297 void find_charsets_in_ichar_string (unsigned char *charsets,
|
|
|
5298 const Ichar *str,
|
|
771
|
5299 Charcount len);
|
|
867
|
5300 int ibyte_string_displayed_columns (const Ibyte *str, Bytecount len);
|
|
|
5301 int ichar_string_displayed_columns (const Ichar *str, Charcount len);
|
|
|
5302 Charcount ibyte_string_nonascii_chars (const Ibyte *str, Bytecount len);
|
|
|
5303 void convert_ibyte_string_into_ichar_dynarr (const Ibyte *str,
|
|
771
|
5304 Bytecount len,
|
|
867
|
5305 Ichar_dynarr *dyn);
|
|
|
5306 Charcount convert_ibyte_string_into_ichar_string (const Ibyte *str,
|
|
771
|
5307 Bytecount len,
|
|
867
|
5308 Ichar *arr);
|
|
|
5309 void convert_ichar_string_into_ibyte_dynarr (Ichar *arr, int nels,
|
|
|
5310 Ibyte_dynarr *dyn);
|
|
|
5311 Ibyte *convert_ichar_string_into_malloced_string (Ichar *arr, int nels,
|
|
771
|
5312 Bytecount *len_out);
|
|
867
|
5313 Bytecount copy_text_between_formats (const Ibyte *src, Bytecount srclen,
|
|
826
|
5314 Internal_Format srcfmt,
|
|
|
5315 Lisp_Object srcobj,
|
|
867
|
5316 Ibyte *dst, Bytecount dstlen,
|
|
826
|
5317 Internal_Format dstfmt,
|
|
|
5318 Lisp_Object dstobj,
|
|
|
5319 Bytecount *src_used);
|
|
|
5320 Bytecount copy_buffer_text_out (struct buffer *buf, Bytebpos pos,
|
|
867
|
5321 Bytecount len, Ibyte *dst, Bytecount dstlen,
|
|
826
|
5322 Internal_Format dstfmt, Lisp_Object dstobj,
|
|
|
5323 Bytecount *src_used);
|
|
771
|
5324
|
|
|
5325 /* flags for get_buffer_pos_char(), get_buffer_range_char(), etc. */
|
|
|
5326 /* At most one of GB_COERCE_RANGE and GB_NO_ERROR_IF_BAD should be
|
|
|
5327 specified. At most one of GB_NEGATIVE_FROM_END and GB_NO_ERROR_IF_BAD
|
|
|
5328 should be specified. */
|
|
|
5329
|
|
|
5330 #define GB_ALLOW_PAST_ACCESSIBLE (1 << 0)
|
|
|
5331 #define GB_ALLOW_NIL (1 << 1)
|
|
|
5332 #define GB_CHECK_ORDER (1 << 2)
|
|
|
5333 #define GB_COERCE_RANGE (1 << 3)
|
|
|
5334 #define GB_NO_ERROR_IF_BAD (1 << 4)
|
|
|
5335 #define GB_NEGATIVE_FROM_END (1 << 5)
|
|
|
5336 #define GB_HISTORICAL_STRING_BEHAVIOR (GB_NEGATIVE_FROM_END | GB_ALLOW_NIL)
|
|
|
5337
|
|
|
5338 Charbpos get_buffer_pos_char (struct buffer *b, Lisp_Object pos,
|
|
|
5339 unsigned int flags);
|
|
|
5340 Bytebpos get_buffer_pos_byte (struct buffer *b, Lisp_Object pos,
|
|
|
5341 unsigned int flags);
|
|
|
5342 void get_buffer_range_char (struct buffer *b, Lisp_Object from, Lisp_Object to,
|
|
|
5343 Charbpos *from_out, Charbpos *to_out,
|
|
|
5344 unsigned int flags);
|
|
|
5345 void get_buffer_range_byte (struct buffer *b, Lisp_Object from, Lisp_Object to,
|
|
|
5346 Bytebpos *from_out, Bytebpos *to_out,
|
|
|
5347 unsigned int flags);
|
|
|
5348 Charcount get_string_pos_char (Lisp_Object string, Lisp_Object pos,
|
|
|
5349 unsigned int flags);
|
|
|
5350 Bytecount get_string_pos_byte (Lisp_Object string, Lisp_Object pos,
|
|
|
5351 unsigned int flags);
|
|
|
5352 void get_string_range_char (Lisp_Object string, Lisp_Object from,
|
|
|
5353 Lisp_Object to, Charcount *from_out,
|
|
|
5354 Charcount *to_out, unsigned int flags);
|
|
|
5355 void get_string_range_byte (Lisp_Object string, Lisp_Object from,
|
|
|
5356 Lisp_Object to, Bytecount *from_out,
|
|
|
5357 Bytecount *to_out, unsigned int flags);
|
|
826
|
5358 Charxpos get_buffer_or_string_pos_char (Lisp_Object object, Lisp_Object pos,
|
|
|
5359 unsigned int flags);
|
|
|
5360 Bytexpos get_buffer_or_string_pos_byte (Lisp_Object object, Lisp_Object pos,
|
|
|
5361 unsigned int flags);
|
|
771
|
5362 void get_buffer_or_string_range_char (Lisp_Object object, Lisp_Object from,
|
|
826
|
5363 Lisp_Object to, Charxpos *from_out,
|
|
|
5364 Charxpos *to_out, unsigned int flags);
|
|
771
|
5365 void get_buffer_or_string_range_byte (Lisp_Object object, Lisp_Object from,
|
|
826
|
5366 Lisp_Object to, Bytexpos *from_out,
|
|
|
5367 Bytexpos *to_out, unsigned int flags);
|
|
|
5368 Charxpos buffer_or_string_accessible_begin_char (Lisp_Object object);
|
|
|
5369 Charxpos buffer_or_string_accessible_end_char (Lisp_Object object);
|
|
|
5370 Bytexpos buffer_or_string_accessible_begin_byte (Lisp_Object object);
|
|
|
5371 Bytexpos buffer_or_string_accessible_end_byte (Lisp_Object object);
|
|
|
5372 Charxpos buffer_or_string_absolute_begin_char (Lisp_Object object);
|
|
|
5373 Charxpos buffer_or_string_absolute_end_char (Lisp_Object object);
|
|
|
5374 Bytexpos buffer_or_string_absolute_begin_byte (Lisp_Object object);
|
|
|
5375 Bytexpos buffer_or_string_absolute_end_byte (Lisp_Object object);
|
|
|
5376 Charbpos charbpos_clip_to_bounds (Charbpos lower, Charbpos num,
|
|
|
5377 Charbpos upper);
|
|
|
5378 Bytebpos bytebpos_clip_to_bounds (Bytebpos lower, Bytebpos num,
|
|
|
5379 Bytebpos upper);
|
|
|
5380 Charxpos charxpos_clip_to_bounds (Charxpos lower, Charxpos num,
|
|
|
5381 Charxpos upper);
|
|
|
5382 Bytexpos bytexpos_clip_to_bounds (Bytexpos lower, Bytexpos num,
|
|
|
5383 Bytexpos upper);
|
|
|
5384 Charxpos buffer_or_string_clip_to_accessible_char (Lisp_Object object,
|
|
|
5385 Charxpos pos);
|
|
|
5386 Bytexpos buffer_or_string_clip_to_accessible_byte (Lisp_Object object,
|
|
|
5387 Bytexpos pos);
|
|
|
5388 Charxpos buffer_or_string_clip_to_absolute_char (Lisp_Object object,
|
|
|
5389 Charxpos pos);
|
|
|
5390 Bytexpos buffer_or_string_clip_to_absolute_byte (Lisp_Object object,
|
|
|
5391 Bytexpos pos);
|
|
|
5392
|
|
771
|
5393
|
|
|
5394 #ifdef ENABLE_COMPOSITE_CHARS
|
|
|
5395
|
|
867
|
5396 Ichar lookup_composite_char (Ibyte *str, int len);
|
|
|
5397 Lisp_Object composite_char_string (Ichar ch);
|
|
771
|
5398 #endif /* ENABLE_COMPOSITE_CHARS */
|
|
|
5399
|
|
|
5400 EXFUN (Ffind_charset, 1);
|
|
|
5401 EXFUN (Fget_charset, 1);
|
|
|
5402 EXFUN (Fcharset_list, 0);
|
|
|
5403
|
|
|
5404 extern Lisp_Object Vcharset_ascii;
|
|
|
5405 extern Lisp_Object Vcharset_control_1;
|
|
|
5406 extern Lisp_Object Vcharset_latin_iso8859_1;
|
|
|
5407 extern Lisp_Object Vcharset_latin_iso8859_2;
|
|
|
5408 extern Lisp_Object Vcharset_latin_iso8859_3;
|
|
|
5409 extern Lisp_Object Vcharset_latin_iso8859_4;
|
|
|
5410 extern Lisp_Object Vcharset_thai_tis620;
|
|
|
5411 extern Lisp_Object Vcharset_greek_iso8859_7;
|
|
|
5412 extern Lisp_Object Vcharset_arabic_iso8859_6;
|
|
|
5413 extern Lisp_Object Vcharset_hebrew_iso8859_8;
|
|
|
5414 extern Lisp_Object Vcharset_katakana_jisx0201;
|
|
|
5415 extern Lisp_Object Vcharset_latin_jisx0201;
|
|
|
5416 extern Lisp_Object Vcharset_cyrillic_iso8859_5;
|
|
|
5417 extern Lisp_Object Vcharset_latin_iso8859_9;
|
|
|
5418 extern Lisp_Object Vcharset_japanese_jisx0208_1978;
|
|
|
5419 extern Lisp_Object Vcharset_chinese_gb2312;
|
|
|
5420 extern Lisp_Object Vcharset_japanese_jisx0208;
|
|
|
5421 extern Lisp_Object Vcharset_korean_ksc5601;
|
|
|
5422 extern Lisp_Object Vcharset_japanese_jisx0212;
|
|
|
5423 extern Lisp_Object Vcharset_chinese_cns11643_1;
|
|
|
5424 extern Lisp_Object Vcharset_chinese_cns11643_2;
|
|
|
5425 extern Lisp_Object Vcharset_chinese_big5_1;
|
|
|
5426 extern Lisp_Object Vcharset_chinese_big5_2;
|
|
|
5427 extern Lisp_Object Vcharset_composite;
|
|
|
5428
|
|
867
|
5429 Ichar Lstream_get_ichar_1 (Lstream *stream, int first_char);
|
|
|
5430 int Lstream_fput_ichar (Lstream *stream, Ichar ch);
|
|
|
5431 void Lstream_funget_ichar (Lstream *stream, Ichar ch);
|
|
|
5432
|
|
|
5433 DECLARE_INLINE_HEADER (Ibyte *qxestrdup (const Ibyte *s))
|
|
771
|
5434 {
|
|
2367
|
5435 return (Ibyte *) xstrdup ((const Chbyte *) s);
|
|
771
|
5436 }
|
|
|
5437
|
|
867
|
5438 DECLARE_INLINE_HEADER (Bytecount qxestrlen (const Ibyte *s))
|
|
771
|
5439 {
|
|
2367
|
5440 return strlen ((const Chbyte *) s);
|
|
771
|
5441 }
|
|
|
5442
|
|
867
|
5443 DECLARE_INLINE_HEADER (Charcount qxestrcharlen (const Ibyte *s))
|
|
771
|
5444 {
|
|
|
5445 return bytecount_to_charcount (s, qxestrlen (s));
|
|
|
5446 }
|
|
|
5447
|
|
867
|
5448 DECLARE_INLINE_HEADER (int qxestrcmp (const Ibyte *s1,
|
|
|
5449 const Ibyte *s2))
|
|
771
|
5450 {
|
|
2367
|
5451 return strcmp ((const Chbyte *) s1, (const Chbyte *) s2);
|
|
771
|
5452 }
|
|
|
5453
|
|
2367
|
5454 DECLARE_INLINE_HEADER (int qxestrcmp_ascii (const Ibyte *s1,
|
|
|
5455 const Ascbyte *s2))
|
|
771
|
5456 {
|
|
2367
|
5457 return strcmp ((const Chbyte *) s1, s2);
|
|
771
|
5458 }
|
|
|
5459
|
|
867
|
5460 DECLARE_INLINE_HEADER (int qxestrncmp (const Ibyte *string1,
|
|
|
5461 const Ibyte *string2,
|
|
771
|
5462 Bytecount count))
|
|
|
5463 {
|
|
2367
|
5464 return strncmp ((const Chbyte *) string1, (const Chbyte *) string2,
|
|
771
|
5465 (size_t) count);
|
|
|
5466 }
|
|
|
5467
|
|
2367
|
5468 DECLARE_INLINE_HEADER (int qxestrncmp_ascii (const Ibyte *string1,
|
|
|
5469 const Ascbyte *string2,
|
|
|
5470 Bytecount count))
|
|
771
|
5471 {
|
|
2367
|
5472 return strncmp ((const Chbyte *) string1, string2, (size_t) count);
|
|
771
|
5473 }
|
|
|
5474
|
|
867
|
5475 DECLARE_INLINE_HEADER (Ibyte *qxestrcpy (Ibyte *strDest,
|
|
2367
|
5476 const Ibyte *strSource))
|
|
771
|
5477 {
|
|
2367
|
5478 return (Ibyte *) strcpy ((Chbyte *) strDest, (const Chbyte *) strSource);
|
|
771
|
5479 }
|
|
|
5480
|
|
2367
|
5481 DECLARE_INLINE_HEADER (Ibyte *qxestrcpy_ascii (Ibyte *strDest,
|
|
|
5482 const Ascbyte *strSource))
|
|
771
|
5483 {
|
|
2367
|
5484 return (Ibyte *) strcpy ((Chbyte *) strDest, strSource);
|
|
771
|
5485 }
|
|
|
5486
|
|
867
|
5487 DECLARE_INLINE_HEADER (Ibyte *qxestrncpy (Ibyte *strDest,
|
|
2367
|
5488 const Ibyte *strSource,
|
|
|
5489 Bytecount count))
|
|
771
|
5490 {
|
|
2367
|
5491 return (Ibyte *) strncpy ((Chbyte *) strDest, (const Chbyte *) strSource,
|
|
771
|
5492 (size_t) count);
|
|
|
5493 }
|
|
|
5494
|
|
2367
|
5495 DECLARE_INLINE_HEADER (Ibyte *qxestrncpy_ascii (Ibyte *strDest,
|
|
|
5496 const Ascbyte *strSource,
|
|
|
5497 Bytecount count))
|
|
771
|
5498 {
|
|
2367
|
5499 return (Ibyte *) strncpy ((Chbyte *) strDest, strSource, (size_t) count);
|
|
771
|
5500 }
|
|
|
5501
|
|
867
|
5502 DECLARE_INLINE_HEADER (Ibyte *qxestrcat (Ibyte *strDest,
|
|
2367
|
5503 const Ibyte *strSource))
|
|
771
|
5504 {
|
|
2367
|
5505 return (Ibyte *) strcat ((Chbyte *) strDest, (const Chbyte *) strSource);
|
|
771
|
5506 }
|
|
|
5507
|
|
2367
|
5508 DECLARE_INLINE_HEADER (Ibyte *qxestrcat_ascii (Ibyte *strDest,
|
|
|
5509 const Ascbyte *strSource))
|
|
771
|
5510 {
|
|
2367
|
5511 return (Ibyte *) strcat ((Chbyte *) strDest, strSource);
|
|
771
|
5512 }
|
|
|
5513
|
|
867
|
5514 DECLARE_INLINE_HEADER (Ibyte *qxestrncat (Ibyte *strDest,
|
|
2367
|
5515 const Ibyte *strSource,
|
|
|
5516 Bytecount count))
|
|
771
|
5517 {
|
|
2367
|
5518 return (Ibyte *) strncat ((Chbyte *) strDest, (const Chbyte *) strSource,
|
|
771
|
5519 (size_t) count);
|
|
|
5520 }
|
|
|
5521
|
|
2367
|
5522 DECLARE_INLINE_HEADER (Ibyte *qxestrncat_ascii (Ibyte *strDest,
|
|
|
5523 const Ascbyte *strSource,
|
|
|
5524 Bytecount count))
|
|
771
|
5525 {
|
|
2367
|
5526 return (Ibyte *) strncat ((Chbyte *) strDest, strSource, (size_t) count);
|
|
771
|
5527 }
|
|
|
5528
|
|
867
|
5529 DECLARE_INLINE_HEADER (Ibyte *qxestrchr (const Ibyte *s, Ichar c))
|
|
771
|
5530 {
|
|
|
5531 assert (c >= 0 && c <= 255);
|
|
2367
|
5532 return (Ibyte *) strchr ((const Chbyte *) s, c);
|
|
771
|
5533 }
|
|
|
5534
|
|
867
|
5535 DECLARE_INLINE_HEADER (Ibyte *qxestrrchr (const Ibyte *s, Ichar c))
|
|
771
|
5536 {
|
|
|
5537 assert (c >= 0 && c <= 255);
|
|
2367
|
5538 return (Ibyte *) strrchr ((const Chbyte *) s, c);
|
|
771
|
5539 }
|
|
|
5540
|
|
867
|
5541 DECLARE_INLINE_HEADER (Ibyte *qxestrstr (const Ibyte *string1,
|
|
2367
|
5542 const Ibyte *string2))
|
|
771
|
5543 {
|
|
2367
|
5544 return (Ibyte *) strstr ((const Chbyte *) string1, (const Chbyte *) string2);
|
|
771
|
5545 }
|
|
|
5546
|
|
867
|
5547 DECLARE_INLINE_HEADER (Bytecount qxestrcspn (const Ibyte *string,
|
|
|
5548 const CIbyte *strCharSet))
|
|
771
|
5549 {
|
|
2367
|
5550 return (Bytecount) strcspn ((const Chbyte *) string, strCharSet);
|
|
771
|
5551 }
|
|
|
5552
|
|
867
|
5553 DECLARE_INLINE_HEADER (Bytecount qxestrspn (const Ibyte *string,
|
|
|
5554 const CIbyte *strCharSet))
|
|
771
|
5555 {
|
|
2367
|
5556 return (Bytecount) strspn ((const Chbyte *) string, strCharSet);
|
|
771
|
5557 }
|
|
|
5558
|
|
867
|
5559 DECLARE_INLINE_HEADER (Ibyte *qxestrpbrk (const Ibyte *string,
|
|
2367
|
5560 const CIbyte *strCharSet))
|
|
771
|
5561 {
|
|
2367
|
5562 return (Ibyte *) strpbrk ((const Chbyte *) string, strCharSet);
|
|
771
|
5563 }
|
|
|
5564
|
|
867
|
5565 DECLARE_INLINE_HEADER (Ibyte *qxestrtok (Ibyte *strToken,
|
|
2367
|
5566 const CIbyte *strDelimit))
|
|
771
|
5567 {
|
|
2367
|
5568 return (Ibyte *) strtok ((Chbyte *) strToken, strDelimit);
|
|
771
|
5569 }
|
|
|
5570
|
|
867
|
5571 DECLARE_INLINE_HEADER (double qxestrtod (const Ibyte *nptr,
|
|
|
5572 Ibyte **endptr))
|
|
771
|
5573 {
|
|
2367
|
5574 return strtod ((const Chbyte *) nptr, (Chbyte **) endptr);
|
|
771
|
5575 }
|
|
|
5576
|
|
867
|
5577 DECLARE_INLINE_HEADER (long qxestrtol (const Ibyte *nptr, Ibyte **endptr,
|
|
771
|
5578 int base))
|
|
|
5579 {
|
|
2367
|
5580 return strtol ((const Chbyte *) nptr, (Chbyte **) endptr, base);
|
|
771
|
5581 }
|
|
|
5582
|
|
867
|
5583 DECLARE_INLINE_HEADER (unsigned long qxestrtoul (const Ibyte *nptr,
|
|
|
5584 Ibyte **endptr,
|
|
771
|
5585 int base))
|
|
|
5586 {
|
|
2367
|
5587 return strtoul ((const Chbyte *) nptr, (Chbyte **) endptr, base);
|
|
771
|
5588 }
|
|
|
5589
|
|
867
|
5590 DECLARE_INLINE_HEADER (int qxeatoi (const Ibyte *string))
|
|
771
|
5591 {
|
|
2367
|
5592 return atoi ((const Chbyte *) string);
|
|
771
|
5593 }
|
|
|
5594
|
|
1204
|
5595 DECLARE_INLINE_HEADER (Ibyte *qxestrupr (Ibyte *s))
|
|
|
5596 {
|
|
2367
|
5597 return (Ibyte *) strupr ((Chbyte *) s);
|
|
1204
|
5598 }
|
|
|
5599
|
|
|
5600 DECLARE_INLINE_HEADER (Ibyte *qxestrlwr (Ibyte *s))
|
|
|
5601 {
|
|
2367
|
5602 return (Ibyte *) strlwr ((Chbyte *) s);
|
|
1204
|
5603 }
|
|
|
5604
|
|
867
|
5605 int qxesprintf (Ibyte *buffer, const CIbyte *format, ...)
|
|
771
|
5606 PRINTF_ARGS (2, 3);
|
|
|
5607
|
|
2367
|
5608 DECLARE_INLINE_HEADER (int qxesscanf_ascii_1 (Ibyte *buffer,
|
|
|
5609 const Ascbyte *format,
|
|
|
5610 void *ptr))
|
|
|
5611 {
|
|
|
5612 /* #### DAMNIT! No vsscanf! */
|
|
|
5613 return sscanf ((Chbyte *) buffer, format, ptr);
|
|
|
5614 }
|
|
|
5615
|
|
771
|
5616 /* Do not use POSIX locale routines. Not Mule-correct. */
|
|
|
5617 #define qxestrcoll DO NOT USE.
|
|
|
5618 #define qxestrxfrm DO NOT USE.
|
|
|
5619
|
|
867
|
5620 int qxestrcasecmp (const Ibyte *s1, const Ibyte *s2);
|
|
2367
|
5621 int qxestrcasecmp_ascii (const Ibyte *s1, const Ascbyte *s2);
|
|
867
|
5622 int qxestrcasecmp_i18n (const Ibyte *s1, const Ibyte *s2);
|
|
2367
|
5623 int ascii_strcasecmp (const Ascbyte *s1, const Ascbyte *s2);
|
|
771
|
5624 int lisp_strcasecmp (Lisp_Object s1, Lisp_Object s2);
|
|
|
5625 int lisp_strcasecmp_i18n (Lisp_Object s1, Lisp_Object s2);
|
|
867
|
5626 int qxestrncasecmp (const Ibyte *s1, const Ibyte *s2, Bytecount len);
|
|
2367
|
5627 int qxestrncasecmp_ascii (const Ibyte *s1, const Ascbyte *s2,
|
|
|
5628 Bytecount len);
|
|
867
|
5629 int qxestrncasecmp_i18n (const Ibyte *s1, const Ibyte *s2, Bytecount len);
|
|
2367
|
5630 int ascii_strncasecmp (const Ascbyte *s1, const Ascbyte *s2,
|
|
771
|
5631 Bytecount len);
|
|
867
|
5632 int qxememcmp (const Ibyte *s1, const Ibyte *s2, Bytecount len);
|
|
|
5633 int qxememcmp4 (const Ibyte *s1, Bytecount len1,
|
|
|
5634 const Ibyte *s2, Bytecount len2);
|
|
|
5635 int qxememcasecmp (const Ibyte *s1, const Ibyte *s2, Bytecount len);
|
|
|
5636 int qxememcasecmp4 (const Ibyte *s1, Bytecount len1,
|
|
|
5637 const Ibyte *s2, Bytecount len2);
|
|
|
5638 int qxetextcmp (const Ibyte *s1, Bytecount len1,
|
|
|
5639 const Ibyte *s2, Bytecount len2);
|
|
|
5640 int qxetextcmp_matching (const Ibyte *s1, Bytecount len1,
|
|
|
5641 const Ibyte *s2, Bytecount len2,
|
|
801
|
5642 Charcount *matching);
|
|
867
|
5643 int qxetextcasecmp (const Ibyte *s1, Bytecount len1,
|
|
|
5644 const Ibyte *s2, Bytecount len2);
|
|
|
5645 int qxetextcasecmp_matching (const Ibyte *s1, Bytecount len1,
|
|
|
5646 const Ibyte *s2, Bytecount len2,
|
|
801
|
5647 Charcount *matching);
|
|
771
|
5648
|
|
|
5649 void buffer_mule_signal_inserted_region (struct buffer *buf, Charbpos start,
|
|
|
5650 Bytecount bytelength,
|
|
|
5651 Charcount charlength);
|
|
|
5652 void buffer_mule_signal_deleted_region (struct buffer *buf, Charbpos start,
|
|
826
|
5653 Charbpos end, Bytebpos byte_start,
|
|
|
5654 Bytebpos byte_end);
|
|
771
|
5655
|
|
2367
|
5656 typedef struct
|
|
|
5657 {
|
|
|
5658 const char *srctext;
|
|
|
5659 void *dst;
|
|
|
5660 Bytecount dst_size;
|
|
|
5661 } alloca_convert_vals;
|
|
|
5662
|
|
|
5663 typedef struct
|
|
|
5664 {
|
|
|
5665 Dynarr_declare (alloca_convert_vals);
|
|
|
5666 } alloca_convert_vals_dynarr;
|
|
|
5667
|
|
|
5668 extern alloca_convert_vals_dynarr *active_alloca_convert;
|
|
|
5669
|
|
|
5670 MODULE_API int find_pos_of_existing_active_alloca_convert (const char *
|
|
|
5671 srctext);
|
|
|
5672
|
|
771
|
5673 /* Defined in unicode.c */
|
|
1204
|
5674 extern const struct sized_memory_description to_unicode_description;
|
|
|
5675 extern const struct sized_memory_description from_unicode_description;
|
|
771
|
5676 void init_charset_unicode_tables (Lisp_Object charset);
|
|
|
5677 void free_charset_unicode_tables (Lisp_Object charset);
|
|
|
5678 void recalculate_unicode_precedence (void);
|
|
|
5679 extern Lisp_Object Qunicode;
|
|
|
5680 extern Lisp_Object Qutf_16, Qutf_8, Qucs_4, Qutf_7;
|
|
|
5681 #ifdef MEMORY_USAGE_STATS
|
|
|
5682 Bytecount compute_from_unicode_table_size (Lisp_Object charset,
|
|
|
5683 struct overhead_stats *stats);
|
|
|
5684 Bytecount compute_to_unicode_table_size (Lisp_Object charset,
|
|
|
5685 struct overhead_stats *stats);
|
|
|
5686 #endif /* MEMORY_USAGE_STATS */
|
|
|
5687
|
|
428
|
5688 /* Defined in undo.c */
|
|
826
|
5689 EXFUN (Fundo_boundary, 0);
|
|
|
5690
|
|
428
|
5691 Lisp_Object truncate_undo_list (Lisp_Object, int, int);
|
|
|
5692 void record_extent (Lisp_Object, int);
|
|
665
|
5693 void record_insert (struct buffer *, Charbpos, Charcount);
|
|
|
5694 void record_delete (struct buffer *, Charbpos, Charcount);
|
|
|
5695 void record_change (struct buffer *, Charbpos, Charcount);
|
|
428
|
5696
|
|
|
5697 /* Defined in unex*.c */
|
|
814
|
5698 #ifdef WIN32_NATIVE
|
|
867
|
5699 int unexec (Ibyte *, Ibyte *, uintptr_t, uintptr_t, uintptr_t);
|
|
814
|
5700 #else
|
|
|
5701 int unexec (Extbyte *, Extbyte *, uintptr_t, uintptr_t, uintptr_t);
|
|
|
5702 #endif
|
|
428
|
5703 #ifdef RUN_TIME_REMAP
|
|
|
5704 int run_time_remap (char *);
|
|
|
5705 #endif
|
|
|
5706
|
|
|
5707 /* Defined in vm-limit.c */
|
|
442
|
5708 void memory_warnings (void *, void (*) (const char *));
|
|
428
|
5709
|
|
442
|
5710 /*--------------- prototypes for constant symbols ------------*/
|
|
|
5711
|
|
826
|
5712 /* #### We should get rid of this and put the prototypes back up there in
|
|
|
5713 #### the per-file stuff, where they belong. */
|
|
|
5714
|
|
771
|
5715 /* Use the following when you have to add a bunch of symbols. */
|
|
|
5716
|
|
|
5717 /*
|
|
|
5718
|
|
|
5719 (defun redo-symbols (beg end)
|
|
|
5720 "Snarf any symbols out of the region and print them into a temporary buffer,
|
|
|
5721 which is displayed when the function finishes. The symbols are laid out with
|
|
|
5722 `extern Lisp_Object ' before each one, with as many as can fit on one line
|
|
|
5723 \(the maximum line width is controlled by the constant `max-line-length' in the
|
|
|
5724 code)."
|
|
|
5725 (interactive "r")
|
|
|
5726 (save-excursion
|
|
|
5727 (goto-char beg)
|
|
|
5728 (let (syms)
|
|
|
5729 (while (re-search-forward "\\s-\\(Q[A-Za-z_0-9]+\\)" end t)
|
|
|
5730 (push (match-string 1) syms))
|
|
|
5731 (setq syms (sort syms #'string-lessp))
|
|
|
5732 (with-output-to-temp-buffer "*Symbols*"
|
|
|
5733 (let* ((col 0)
|
|
|
5734 (start "extern Lisp_Object ")
|
|
|
5735 (startlen (length start))
|
|
|
5736 ;; with a default-width frame of 80 chars, you can only fit
|
|
|
5737 ;; 79 before wrapping. you can see this to a lower value if
|
|
|
5738 ;; you don't want it right up against the right margin.
|
|
|
5739 (max-line-length 79))
|
|
|
5740 (dolist (sym syms)
|
|
|
5741 (cond (;; if something already on line (this will always be the
|
|
|
5742 ;; case except the very first iteration), see what
|
|
|
5743 ;; space we've got. (need to take into account 2
|
|
|
5744 ;; for the comma+space, 1 for the semicolon at the
|
|
|
5745 ;; end.) if enough space, do it.
|
|
|
5746 (and (> col 0) (< (+ col (length sym) 2)
|
|
|
5747 (1- max-line-length)))
|
|
|
5748 (princ ", ")
|
|
|
5749 (princ sym)
|
|
|
5750 (incf col 2)
|
|
|
5751 (incf col (length sym)))
|
|
|
5752 (t
|
|
|
5753 ;; either we're first iteration or we ran out of space.
|
|
|
5754 ;; if the latter, terminate the previous line. this
|
|
|
5755 ;; loop is written on purpose so that it always prints
|
|
|
5756 ;; at least one item, even if that would go over.
|
|
|
5757 (when (> col 0)
|
|
|
5758 (princ ";\n")
|
|
|
5759 (setq col 0))
|
|
|
5760 (princ start)
|
|
|
5761 (incf col startlen)
|
|
|
5762 (princ sym)
|
|
|
5763 (incf col (length sym)))))
|
|
|
5764 ;; finally terminate the last line.
|
|
|
5765 (princ ";\n"))))))
|
|
|
5766
|
|
|
5767 */
|
|
|
5768
|
|
814
|
5769 extern Lisp_Object Qactivate_menubar_hook, Qand_optional, Qand_rest;
|
|
|
5770 extern Lisp_Object Qarith_error, Qarrayp, Qautoload, Qbackground;
|
|
|
5771 extern Lisp_Object Qbackground_pixmap, Qbeginning_of_buffer, Qbitp, Qblinking;
|
|
|
5772 extern Lisp_Object Qbuffer_glyph_p, Qbuffer_live_p, Qbuffer_read_only;
|
|
|
5773 extern Lisp_Object Qbyte_code, Qcall_interactively, Qcategory_designator_p;
|
|
|
5774 extern Lisp_Object Qcategory_table_value_p, Qcdr, Qchar_or_string_p;
|
|
|
5775 extern Lisp_Object Qcharacterp, Qcircular_list, Qcircular_property_list;
|
|
|
5776 extern Lisp_Object Qcolor_pixmap_image_instance_p, Qcommandp;
|
|
|
5777 extern Lisp_Object Qcompletion_ignore_case, Qconsole_live_p, Qconst_specifier;
|
|
|
5778 extern Lisp_Object Qconversion_error, Qcurrent_menubar;
|
|
771
|
5779 extern Lisp_Object Qcyclic_variable_indirection, Qdefun, Qdevice_live_p, Qdim;
|
|
|
5780 extern Lisp_Object Qdirection, Qdisabled, Qdisabled_command_hook;
|
|
930
|
5781 extern Lisp_Object Qdisplay_table, Qdll_error, Qdomain_error, Qediting_error;
|
|
771
|
5782 extern Lisp_Object Qend_of_buffer, Qend_of_file, Qend_open, Qerror;
|
|
|
5783 extern Lisp_Object Qerror_conditions, Qerror_lacks_explanatory_string;
|
|
|
5784 extern Lisp_Object Qerror_message, Qevent_live_p, Qexit, Qextent_live_p;
|
|
996
|
5785 extern Lisp_Object Qexternal_debugging_output, Qfeaturep, Qfile_error;
|
|
|
5786 extern Lisp_Object Qfile_name_sans_extension, Qfinal;
|
|
1111
|
5787 extern Lisp_Object Qforeground, Qformat, Qframe_live_p, Qgraphic;
|
|
771
|
5788 extern Lisp_Object Qgui_error, Qicon_glyph_p, Qidentity, Qinhibit_quit;
|
|
|
5789 extern Lisp_Object Qinhibit_read_only, Qinteger_char_or_marker_p;
|
|
1632
|
5790 extern Lisp_Object Qinteger_or_char_p, Qinteger_or_marker_p;
|
|
|
5791 extern Lisp_Object Qinteractive, Qinternal_error;
|
|
771
|
5792 extern Lisp_Object Qinvalid_byte_code, Qinvalid_change, Qinvalid_constant;
|
|
|
5793 extern Lisp_Object Qinvalid_function, Qinvalid_operation;
|
|
|
5794 extern Lisp_Object Qinvalid_read_syntax, Qinvalid_state, Qio_error, Qlambda;
|
|
1111
|
5795 extern Lisp_Object Qlayout, Qlist_formation_error, Qlistp, Qload;
|
|
771
|
5796 extern Lisp_Object Qlong_name, Qmacro, Qmakunbound, Qmalformed_list;
|
|
996
|
5797 extern Lisp_Object Qmalformed_property_list, Qmark, Qmodule;
|
|
771
|
5798 extern Lisp_Object Qmono_pixmap_image_instance_p, Qmouse_leave_buffer_hook;
|
|
|
5799 extern Lisp_Object Qnative_layout, Qnatnump, Qnetwork_error, Qno_catch;
|
|
1983
|
5800 extern Lisp_Object Qnonnegativep, Qnothing_image_instance_p;
|
|
|
5801 extern Lisp_Object Qnumber_char_or_marker_p, Qnumberp, Qout_of_memory;
|
|
442
|
5802 extern Lisp_Object Qoverflow_error, Qpoint, Qpointer_glyph_p;
|
|
771
|
5803 extern Lisp_Object Qpointer_image_instance_p, Qprint_length;
|
|
563
|
5804 extern Lisp_Object Qprint_string_length, Qprinting_unreadable_object;
|
|
1632
|
5805 extern Lisp_Object Qprogn, Qquit, Qquote, Qrange_error;
|
|
771
|
5806 extern Lisp_Object Qread_char, Qread_from_minibuffer;
|
|
|
5807 extern Lisp_Object Qreally_early_error_handler, Qregion_beginning;
|
|
|
5808 extern Lisp_Object Qregion_end, Qregistry, Qreverse_direction_charset;
|
|
|
5809 extern Lisp_Object Qrun_hooks, Qsans_modifiers, Qsave_buffers_kill_emacs;
|
|
|
5810 extern Lisp_Object Qself_insert_command, Qself_insert_defer_undo, Qsequencep;
|
|
|
5811 extern Lisp_Object Qset, Qsetting_constant, Qshort_name, Qsingularity_error;
|
|
|
5812 extern Lisp_Object Qsound_error, Qstack_overflow, Qstandard_input;
|
|
|
5813 extern Lisp_Object Qstandard_output, Qstart_open, Qstring_lessp;
|
|
|
5814 extern Lisp_Object Qstructure_formation_error, Qsubwindow;
|
|
1632
|
5815 extern Lisp_Object Qsubwindow_image_instance_p;
|
|
771
|
5816 extern Lisp_Object Qtext_conversion_error, Qtext_image_instance_p, Qtop_level;
|
|
1632
|
5817 extern Lisp_Object Qtrue_list_p, Qunderflow_error, Qunderline;
|
|
771
|
5818 extern Lisp_Object Quser_files_and_directories, Qvalues;
|
|
|
5819 extern Lisp_Object Qvariable_documentation, Qvariable_domain, Qvoid_function;
|
|
|
5820 extern Lisp_Object Qvoid_variable, Qwindow_live_p, Qwrong_number_of_arguments;
|
|
442
|
5821 extern Lisp_Object Qwrong_type_argument, Qyes_or_no_p;
|
|
|
5822
|
|
1632
|
5823 extern MODULE_API Lisp_Object Qintegerp, Qinvalid_argument, Qprocess_error;
|
|
|
5824 extern MODULE_API Lisp_Object Qsyntax_error, Qt, Qunbound;
|
|
|
5825
|
|
442
|
5826 #define SYMBOL(fou) extern Lisp_Object fou
|
|
1632
|
5827 #define SYMBOL_MODULE_API(fou) extern MODULE_API Lisp_Object fou
|
|
442
|
5828 #define SYMBOL_KEYWORD(la_cle_est_fou) extern Lisp_Object la_cle_est_fou
|
|
|
5829 #define SYMBOL_GENERAL(tout_le_monde, est_fou) \
|
|
|
5830 extern Lisp_Object tout_le_monde
|
|
|
5831
|
|
|
5832 #include "general-slots.h"
|
|
|
5833
|
|
|
5834 #undef SYMBOL
|
|
1632
|
5835 #undef SYMBOL_MODULE_API
|
|
442
|
5836 #undef SYMBOL_KEYWORD
|
|
|
5837 #undef SYMBOL_GENERAL
|
|
|
5838
|
|
|
5839 /*--------------- prototypes for variables of type Lisp_Object ------------*/
|
|
|
5840
|
|
826
|
5841 /* #### We should get rid of this and put the prototypes back up there in
|
|
|
5842 #### the per-file stuff, where they belong. */
|
|
|
5843
|
|
446
|
5844 extern Lisp_Object Vactivate_menubar_hook;
|
|
|
5845 extern Lisp_Object Vautoload_queue, Vblank_menubar;
|
|
771
|
5846 extern Lisp_Object Vcommand_history;
|
|
428
|
5847 extern Lisp_Object Vcommand_line_args, Vconfigure_info_directory;
|
|
|
5848 extern Lisp_Object Vconfigure_site_directory, Vconfigure_site_module_directory;
|
|
|
5849 extern Lisp_Object Vconsole_list, Vcontrolling_terminal;
|
|
|
5850 extern Lisp_Object Vcurrent_compiled_function_annotation, Vcurrent_load_list;
|
|
|
5851 extern Lisp_Object Vcurrent_mouse_event, Vcurrent_prefix_arg, Vdata_directory;
|
|
434
|
5852 extern Lisp_Object Vdirectory_sep_char, Vdisabled_command_hook;
|
|
|
5853 extern Lisp_Object Vdoc_directory, Vinternal_doc_file_name;
|
|
428
|
5854 extern Lisp_Object Vecho_area_buffer, Vemacs_major_version;
|
|
|
5855 extern Lisp_Object Vemacs_minor_version, Vexec_directory, Vexec_path;
|
|
|
5856 extern Lisp_Object Vexecuting_macro, Vfeatures, Vfile_domain;
|
|
1927
|
5857 extern Lisp_Object Vinvocation_directory, Vinvocation_name;
|
|
771
|
5858 extern Lisp_Object Vlast_command, Vlast_command_char;
|
|
428
|
5859 extern Lisp_Object Vlast_command_event, Vlast_input_event;
|
|
2548
|
5860 extern Lisp_Object Vload_file_name_internal, Vload_history;
|
|
428
|
5861 extern Lisp_Object Vload_path, Vmark_even_if_inactive, Vmenubar_configuration;
|
|
|
5862 extern Lisp_Object Vminibuf_preprompt, Vminibuf_prompt, Vminibuffer_zero;
|
|
|
5863 extern Lisp_Object Vmodule_directory, Vmswindows_downcase_file_names;
|
|
|
5864 extern Lisp_Object Vmswindows_get_true_file_attributes, Vobarray;
|
|
|
5865 extern Lisp_Object Vprint_length, Vprint_level, Vprocess_environment;
|
|
|
5866 extern Lisp_Object Vrecent_keys_ring, Vshell_file_name, Vsite_directory;
|
|
|
5867 extern Lisp_Object Vsite_module_directory;
|
|
|
5868 extern Lisp_Object Vstandard_input, Vstandard_output, Vstdio_str;
|
|
771
|
5869 extern Lisp_Object Vsynchronous_sounds, Vsystem_name;
|
|
428
|
5870 extern Lisp_Object Vthis_command_keys, Vunread_command_event;
|
|
|
5871 extern Lisp_Object Vx_initial_argv_list;
|
|
|
5872
|
|
1927
|
5873 extern MODULE_API Lisp_Object Vinhibit_quit, Vquit_flag;
|
|
|
5874
|
|
1743
|
5875 END_C_DECLS
|
|
1650
|
5876
|
|
440
|
5877 #endif /* INCLUDED_lisp_h_ */
|
