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