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