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