|
428
|
1 /* The "lrecord" structure (header of a compound lisp object).
|
|
|
2 Copyright (C) 1993, 1994, 1995 Free Software Foundation, Inc.
|
|
788
|
3 Copyright (C) 1996, 2001, 2002 Ben Wing.
|
|
428
|
4
|
|
|
5 This file is part of XEmacs.
|
|
|
6
|
|
|
7 XEmacs is free software; you can redistribute it and/or modify it
|
|
|
8 under the terms of the GNU General Public License as published by the
|
|
|
9 Free Software Foundation; either version 2, or (at your option) any
|
|
|
10 later version.
|
|
|
11
|
|
|
12 XEmacs is distributed in the hope that it will be useful, but WITHOUT
|
|
|
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
15 for more details.
|
|
|
16
|
|
|
17 You should have received a copy of the GNU General Public License
|
|
|
18 along with XEmacs; see the file COPYING. If not, write to
|
|
|
19 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
20 Boston, MA 02111-1307, USA. */
|
|
|
21
|
|
|
22 /* Synched up with: Not in FSF. */
|
|
|
23
|
|
440
|
24 #ifndef INCLUDED_lrecord_h_
|
|
|
25 #define INCLUDED_lrecord_h_
|
|
428
|
26
|
|
|
27 /* The "lrecord" type of Lisp object is used for all object types
|
|
|
28 other than a few simple ones. This allows many types to be
|
|
442
|
29 implemented but only a few bits required in a Lisp object for type
|
|
|
30 information. (The tradeoff is that each object has its type marked
|
|
|
31 in it, thereby increasing its size.) All lrecords begin with a
|
|
|
32 `struct lrecord_header', which identifies the lisp object type, by
|
|
|
33 providing an index into a table of `struct lrecord_implementation',
|
|
|
34 which describes the behavior of the lisp object. It also contains
|
|
|
35 some other data bits.
|
|
428
|
36
|
|
|
37 Lrecords are of two types: straight lrecords, and lcrecords.
|
|
|
38 Straight lrecords are used for those types of objects that have
|
|
|
39 their own allocation routines (typically allocated out of 2K chunks
|
|
|
40 of memory called `frob blocks'). These objects have a `struct
|
|
|
41 lrecord_header' at the top, containing only the bits needed to find
|
|
|
42 the lrecord_implementation for the object. There are special
|
|
|
43 routines in alloc.c to deal with each such object type.
|
|
|
44
|
|
442
|
45 Lcrecords are used for less common sorts of objects that don't do
|
|
|
46 their own allocation. Each such object is malloc()ed individually,
|
|
|
47 and the objects are chained together through a `next' pointer.
|
|
|
48 Lcrecords have a `struct lcrecord_header' at the top, which
|
|
|
49 contains a `struct lrecord_header' and a `next' pointer, and are
|
|
|
50 allocated using alloc_lcrecord().
|
|
428
|
51
|
|
|
52 Creating a new lcrecord type is fairly easy; just follow the
|
|
|
53 lead of some existing type (e.g. hash tables). Note that you
|
|
|
54 do not need to supply all the methods (see below); reasonable
|
|
|
55 defaults are provided for many of them. Alternatively, if you're
|
|
|
56 just looking for a way of encapsulating data (which possibly
|
|
|
57 could contain Lisp_Objects in it), you may well be able to use
|
|
|
58 the opaque type. */
|
|
|
59
|
|
|
60 struct lrecord_header
|
|
|
61 {
|
|
|
62 /* index into lrecord_implementations_table[] */
|
|
442
|
63 unsigned int type :8;
|
|
|
64
|
|
|
65 /* If `mark' is 0 after the GC mark phase, the object will be freed
|
|
|
66 during the GC sweep phase. There are 2 ways that `mark' can be 1:
|
|
|
67 - by being referenced from other objects during the GC mark phase
|
|
|
68 - because it is permanently on, for c_readonly objects */
|
|
|
69 unsigned int mark :1;
|
|
|
70
|
|
|
71 /* 1 if the object resides in logically read-only space, and does not
|
|
|
72 reference other non-c_readonly objects.
|
|
|
73 Invariant: if (c_readonly == 1), then (mark == 1 && lisp_readonly == 1) */
|
|
|
74 unsigned int c_readonly :1;
|
|
|
75
|
|
428
|
76 /* 1 if the object is readonly from lisp */
|
|
442
|
77 unsigned int lisp_readonly :1;
|
|
771
|
78
|
|
|
79 unsigned int unused :21;
|
|
428
|
80 };
|
|
|
81
|
|
|
82 struct lrecord_implementation;
|
|
442
|
83 int lrecord_type_index (const struct lrecord_implementation *implementation);
|
|
428
|
84
|
|
430
|
85 #define set_lheader_implementation(header,imp) do { \
|
|
428
|
86 struct lrecord_header* SLI_header = (header); \
|
|
442
|
87 SLI_header->type = (imp)->lrecord_type_index; \
|
|
430
|
88 SLI_header->mark = 0; \
|
|
|
89 SLI_header->c_readonly = 0; \
|
|
|
90 SLI_header->lisp_readonly = 0; \
|
|
428
|
91 } while (0)
|
|
|
92
|
|
|
93 struct lcrecord_header
|
|
|
94 {
|
|
|
95 struct lrecord_header lheader;
|
|
|
96
|
|
442
|
97 /* The `next' field is normally used to chain all lcrecords together
|
|
428
|
98 so that the GC can find (and free) all of them.
|
|
442
|
99 `alloc_lcrecord' threads lcrecords together.
|
|
428
|
100
|
|
|
101 The `next' field may be used for other purposes as long as some
|
|
|
102 other mechanism is provided for letting the GC do its work.
|
|
|
103
|
|
|
104 For example, the event and marker object types allocate members
|
|
|
105 out of memory chunks, and are able to find all unmarked members
|
|
|
106 by sweeping through the elements of the list of chunks. */
|
|
|
107 struct lcrecord_header *next;
|
|
|
108
|
|
|
109 /* The `uid' field is just for debugging/printing convenience.
|
|
|
110 Having this slot doesn't hurt us much spacewise, since an
|
|
|
111 lcrecord already has the above slots plus malloc overhead. */
|
|
|
112 unsigned int uid :31;
|
|
|
113
|
|
|
114 /* The `free' field is a flag that indicates whether this lcrecord
|
|
|
115 is on a "free list". Free lists are used to minimize the number
|
|
|
116 of calls to malloc() when we're repeatedly allocating and freeing
|
|
|
117 a number of the same sort of lcrecord. Lcrecords on a free list
|
|
|
118 always get marked in a different fashion, so we can use this flag
|
|
|
119 as a sanity check to make sure that free lists only have freed
|
|
|
120 lcrecords and there are no freed lcrecords elsewhere. */
|
|
|
121 unsigned int free :1;
|
|
|
122 };
|
|
|
123
|
|
|
124 /* Used for lcrecords in an lcrecord-list. */
|
|
|
125 struct free_lcrecord_header
|
|
|
126 {
|
|
|
127 struct lcrecord_header lcheader;
|
|
|
128 Lisp_Object chain;
|
|
|
129 };
|
|
|
130
|
|
442
|
131 enum lrecord_type
|
|
|
132 {
|
|
|
133 /* Symbol value magic types come first to make SYMBOL_VALUE_MAGIC_P fast.
|
|
|
134 #### This should be replaced by a symbol_value_magic_p flag
|
|
|
135 in the Lisp_Symbol lrecord_header. */
|
|
|
136 lrecord_type_symbol_value_forward,
|
|
|
137 lrecord_type_symbol_value_varalias,
|
|
|
138 lrecord_type_symbol_value_lisp_magic,
|
|
|
139 lrecord_type_symbol_value_buffer_local,
|
|
|
140 lrecord_type_max_symbol_value_magic = lrecord_type_symbol_value_buffer_local,
|
|
|
141
|
|
|
142 lrecord_type_symbol,
|
|
|
143 lrecord_type_subr,
|
|
|
144 lrecord_type_cons,
|
|
|
145 lrecord_type_vector,
|
|
|
146 lrecord_type_string,
|
|
|
147 lrecord_type_lcrecord_list,
|
|
|
148 lrecord_type_compiled_function,
|
|
|
149 lrecord_type_weak_list,
|
|
|
150 lrecord_type_bit_vector,
|
|
|
151 lrecord_type_float,
|
|
|
152 lrecord_type_hash_table,
|
|
|
153 lrecord_type_lstream,
|
|
|
154 lrecord_type_process,
|
|
|
155 lrecord_type_charset,
|
|
|
156 lrecord_type_coding_system,
|
|
|
157 lrecord_type_char_table,
|
|
|
158 lrecord_type_char_table_entry,
|
|
|
159 lrecord_type_range_table,
|
|
|
160 lrecord_type_opaque,
|
|
|
161 lrecord_type_opaque_ptr,
|
|
|
162 lrecord_type_buffer,
|
|
|
163 lrecord_type_extent,
|
|
|
164 lrecord_type_extent_info,
|
|
|
165 lrecord_type_extent_auxiliary,
|
|
|
166 lrecord_type_marker,
|
|
|
167 lrecord_type_event,
|
|
|
168 lrecord_type_keymap,
|
|
|
169 lrecord_type_command_builder,
|
|
|
170 lrecord_type_timeout,
|
|
|
171 lrecord_type_specifier,
|
|
|
172 lrecord_type_console,
|
|
|
173 lrecord_type_device,
|
|
|
174 lrecord_type_frame,
|
|
|
175 lrecord_type_window,
|
|
617
|
176 lrecord_type_window_mirror,
|
|
442
|
177 lrecord_type_window_configuration,
|
|
|
178 lrecord_type_gui_item,
|
|
|
179 lrecord_type_popup_data,
|
|
|
180 lrecord_type_toolbar_button,
|
|
617
|
181 lrecord_type_scrollbar_instance,
|
|
442
|
182 lrecord_type_color_instance,
|
|
|
183 lrecord_type_font_instance,
|
|
|
184 lrecord_type_image_instance,
|
|
|
185 lrecord_type_glyph,
|
|
|
186 lrecord_type_face,
|
|
|
187 lrecord_type_database,
|
|
|
188 lrecord_type_tooltalk_message,
|
|
|
189 lrecord_type_tooltalk_pattern,
|
|
|
190 lrecord_type_ldap,
|
|
|
191 lrecord_type_pgconn,
|
|
|
192 lrecord_type_pgresult,
|
|
|
193 lrecord_type_devmode,
|
|
|
194 lrecord_type_mswindows_dialog_id,
|
|
446
|
195 lrecord_type_case_table,
|
|
462
|
196 lrecord_type_emacs_ffi,
|
|
|
197 lrecord_type_emacs_gtk_object,
|
|
|
198 lrecord_type_emacs_gtk_boxed,
|
|
858
|
199 lrecord_type_weak_box,
|
|
888
|
200 lrecord_type_ephemeron,
|
|
454
|
201 lrecord_type_free, /* only used for "free" lrecords */
|
|
|
202 lrecord_type_undefined, /* only used for debugging */
|
|
442
|
203 lrecord_type_last_built_in_type /* must be last */
|
|
|
204 };
|
|
|
205
|
|
647
|
206 extern int lrecord_type_count;
|
|
428
|
207
|
|
|
208 struct lrecord_implementation
|
|
|
209 {
|
|
442
|
210 const char *name;
|
|
|
211
|
|
|
212 /* `marker' is called at GC time, to make sure that all Lisp_Objects
|
|
428
|
213 pointed to by this object get properly marked. It should call
|
|
|
214 the mark_object function on all Lisp_Objects in the object. If
|
|
|
215 the return value is non-nil, it should be a Lisp_Object to be
|
|
|
216 marked (don't call the mark_object function explicitly on it,
|
|
|
217 because the GC routines will do this). Doing it this way reduces
|
|
|
218 recursion, so the object returned should preferably be the one
|
|
|
219 with the deepest level of Lisp_Object pointers. This function
|
|
|
220 can be NULL, meaning no GC marking is necessary. */
|
|
|
221 Lisp_Object (*marker) (Lisp_Object);
|
|
442
|
222
|
|
|
223 /* `printer' converts the object to a printed representation.
|
|
|
224 This can be NULL; in this case default_object_printer() will be
|
|
|
225 used instead. */
|
|
428
|
226 void (*printer) (Lisp_Object, Lisp_Object printcharfun, int escapeflag);
|
|
442
|
227
|
|
|
228 /* `finalizer' is called at GC time when the object is about to
|
|
428
|
229 be freed, and at dump time (FOR_DISKSAVE will be non-zero in this
|
|
|
230 case). It should perform any necessary cleanup (e.g. freeing
|
|
442
|
231 malloc()ed memory). This can be NULL, meaning no special
|
|
428
|
232 finalization is necessary.
|
|
|
233
|
|
442
|
234 WARNING: remember that `finalizer' is called at dump time even
|
|
428
|
235 though the object is not being freed. */
|
|
|
236 void (*finalizer) (void *header, int for_disksave);
|
|
442
|
237
|
|
428
|
238 /* This can be NULL, meaning compare objects with EQ(). */
|
|
|
239 int (*equal) (Lisp_Object obj1, Lisp_Object obj2, int depth);
|
|
442
|
240
|
|
|
241 /* `hash' generates hash values for use with hash tables that have
|
|
|
242 `equal' as their test function. This can be NULL, meaning use
|
|
|
243 the Lisp_Object itself as the hash. But, you must still satisfy
|
|
|
244 the constraint that if two objects are `equal', then they *must*
|
|
|
245 hash to the same value in order for hash tables to work properly.
|
|
|
246 This means that `hash' can be NULL only if the `equal' method is
|
|
|
247 also NULL. */
|
|
428
|
248 unsigned long (*hash) (Lisp_Object, int);
|
|
|
249
|
|
|
250 /* External data layout description */
|
|
|
251 const struct lrecord_description *description;
|
|
|
252
|
|
442
|
253 /* These functions allow any object type to have builtin property
|
|
|
254 lists that can be manipulated from the lisp level with
|
|
|
255 `get', `put', `remprop', and `object-plist'. */
|
|
428
|
256 Lisp_Object (*getprop) (Lisp_Object obj, Lisp_Object prop);
|
|
|
257 int (*putprop) (Lisp_Object obj, Lisp_Object prop, Lisp_Object val);
|
|
|
258 int (*remprop) (Lisp_Object obj, Lisp_Object prop);
|
|
|
259 Lisp_Object (*plist) (Lisp_Object obj);
|
|
|
260
|
|
442
|
261 /* Only one of `static_size' and `size_in_bytes_method' is non-0.
|
|
|
262 If both are 0, this type is not instantiable by alloc_lcrecord(). */
|
|
665
|
263 Bytecount static_size;
|
|
|
264 Bytecount (*size_in_bytes_method) (const void *header);
|
|
442
|
265
|
|
|
266 /* The (constant) index into lrecord_implementations_table */
|
|
|
267 enum lrecord_type lrecord_type_index;
|
|
|
268
|
|
428
|
269 /* A "basic" lrecord is any lrecord that's not an lcrecord, i.e.
|
|
|
270 one that does not have an lcrecord_header at the front and which
|
|
|
271 is (usually) allocated in frob blocks. We only use this flag for
|
|
|
272 some consistency checking, and that only when error-checking is
|
|
|
273 enabled. */
|
|
442
|
274 unsigned int basic_p :1;
|
|
428
|
275 };
|
|
|
276
|
|
617
|
277 /* All the built-in lisp object types are enumerated in `enum lrecord_type'.
|
|
442
|
278 Additional ones may be defined by a module (none yet). We leave some
|
|
|
279 room in `lrecord_implementations_table' for such new lisp object types. */
|
|
|
280 #define MODULE_DEFINABLE_TYPE_COUNT 32
|
|
|
281
|
|
647
|
282 extern const struct lrecord_implementation *lrecord_implementations_table[lrecord_type_last_built_in_type + MODULE_DEFINABLE_TYPE_COUNT];
|
|
428
|
283
|
|
|
284 #define XRECORD_LHEADER_IMPLEMENTATION(obj) \
|
|
442
|
285 LHEADER_IMPLEMENTATION (XRECORD_LHEADER (obj))
|
|
|
286 #define LHEADER_IMPLEMENTATION(lh) lrecord_implementations_table[(lh)->type]
|
|
428
|
287
|
|
|
288 extern int gc_in_progress;
|
|
|
289
|
|
442
|
290 #define MARKED_RECORD_P(obj) (XRECORD_LHEADER (obj)->mark)
|
|
428
|
291 #define MARKED_RECORD_HEADER_P(lheader) ((lheader)->mark)
|
|
|
292 #define MARK_RECORD_HEADER(lheader) ((void) ((lheader)->mark = 1))
|
|
|
293 #define UNMARK_RECORD_HEADER(lheader) ((void) ((lheader)->mark = 0))
|
|
|
294
|
|
|
295 #define C_READONLY_RECORD_HEADER_P(lheader) ((lheader)->c_readonly)
|
|
|
296 #define LISP_READONLY_RECORD_HEADER_P(lheader) ((lheader)->lisp_readonly)
|
|
442
|
297 #define SET_C_READONLY_RECORD_HEADER(lheader) do { \
|
|
|
298 struct lrecord_header *SCRRH_lheader = (lheader); \
|
|
|
299 SCRRH_lheader->c_readonly = 1; \
|
|
|
300 SCRRH_lheader->lisp_readonly = 1; \
|
|
|
301 SCRRH_lheader->mark = 1; \
|
|
|
302 } while (0)
|
|
428
|
303 #define SET_LISP_READONLY_RECORD_HEADER(lheader) \
|
|
|
304 ((void) ((lheader)->lisp_readonly = 1))
|
|
442
|
305 #define RECORD_MARKER(lheader) lrecord_markers[(lheader)->type]
|
|
428
|
306
|
|
|
307 /* External description stuff
|
|
|
308
|
|
771
|
309 PLEASE NOTE: Both lrecord_description and struct_description are
|
|
|
310 badly misnamed. In reality, an lrecord_description is nothing more
|
|
|
311 than a list of the elements in a block of memory that need
|
|
|
312 relocating or other special handling, and a struct_description is
|
|
|
313 no more than an lrecord_description plus the size of the block of
|
|
|
314 memory. (In fact, a struct_description can now have its size given
|
|
|
315 as zero, i.e. unspecified, meaning that the last element in the
|
|
|
316 structure is noted in the list and the size of the block can
|
|
|
317 therefore be computed from it.) The names stem from the fact
|
|
|
318 lrecord_descriptions are used to describe lrecords (the size of the
|
|
|
319 lrecord is elsewhere in its description, attached to its methods,
|
|
|
320 so it does not need to be given here), while struct_descriptions
|
|
|
321 are used to describe C structs; but both are used in various
|
|
|
322 additional ways. Much better terms would be memory_description and
|
|
|
323 sized_memory_description.
|
|
428
|
324
|
|
771
|
325 An lrecord_description is an array of values. (This is actually
|
|
|
326 misnamed, in that it does not just describe lrecords, but any
|
|
|
327 blocks of memory.) The first value of each line is a type, the
|
|
|
328 second the offset in the lrecord structure. The third and
|
|
|
329 following elements are parameters; their presence, type and number
|
|
|
330 is type-dependent.
|
|
|
331
|
|
|
332 The description ends with a "XD_END", "XD_SPECIFIER_END" or
|
|
|
333 "XD_CODING_SYSTEM_END" record.
|
|
|
334
|
|
|
335 The top-level description of an lrecord or lcrecord does not need
|
|
|
336 to describe every element, just the ones that need to be relocated,
|
|
|
337 since the size of the lrecord is known. (The same goes for nested
|
|
|
338 structures, whenever the structure size is given, rather than being
|
|
|
339 defaulted by specifying 0 for the size.)
|
|
|
340
|
|
814
|
341 A struct_description is used for describing nested "structures". (Again
|
|
|
342 a misnomer, since it can be used for any blocks of memory, not just
|
|
|
343 structures.) It just contains a size for the memory block, a pointer to
|
|
|
344 an lrecord_description, and (for unions only) a union constant,
|
|
|
345 described below. The size can be 0, in which case the size will be
|
|
|
346 determined from the largest offset logically referenced (i.e. last
|
|
|
347 offset mentioned + size of that object). This is useful for stretchy
|
|
|
348 arrays.
|
|
428
|
349
|
|
|
350 Some example descriptions :
|
|
440
|
351
|
|
814
|
352 struct Lisp_String
|
|
|
353 {
|
|
|
354 struct lrecord_header lheader;
|
|
|
355 Bytecount size;
|
|
867
|
356 Ibyte *data;
|
|
814
|
357 Lisp_Object plist;
|
|
|
358 };
|
|
|
359
|
|
428
|
360 static const struct lrecord_description cons_description[] = {
|
|
440
|
361 { XD_LISP_OBJECT, offsetof (Lisp_Cons, car) },
|
|
|
362 { XD_LISP_OBJECT, offsetof (Lisp_Cons, cdr) },
|
|
428
|
363 { XD_END }
|
|
|
364 };
|
|
|
365
|
|
440
|
366 Which means "two lisp objects starting at the 'car' and 'cdr' elements"
|
|
428
|
367
|
|
814
|
368 static const struct lrecord_description string_description[] = {
|
|
|
369 { XD_BYTECOUNT, offsetof (Lisp_String, size) },
|
|
|
370 { XD_OPAQUE_DATA_PTR, offsetof (Lisp_String, data), XD_INDIRECT(0, 1) },
|
|
|
371 { XD_LISP_OBJECT, offsetof (Lisp_String, plist) },
|
|
|
372 { XD_END }
|
|
|
373 };
|
|
|
374
|
|
|
375 "A pointer to string data at 'data', the size of the pointed array being
|
|
|
376 the value of the size variable plus 1, and one lisp object at 'plist'"
|
|
|
377
|
|
|
378 If your object has a pointer to an array of Lisp_Objects in it, something
|
|
|
379 like this:
|
|
|
380
|
|
|
381 struct Lisp_Foo
|
|
|
382 {
|
|
|
383 ...;
|
|
|
384 int count;
|
|
|
385 Lisp_Object *objects;
|
|
|
386 ...;
|
|
|
387 }
|
|
|
388
|
|
|
389 You'd use XD_STRUCT_PTR, something like:
|
|
|
390
|
|
|
391 static const struct lrecord_description lo_description_1[] = {
|
|
|
392 { XD_LISP_OBJECT, 0 },
|
|
|
393 { XD_END }
|
|
|
394 };
|
|
|
395
|
|
|
396 static const struct struct_description lo_description = {
|
|
|
397 sizeof (Lisp_Object),
|
|
|
398 lo_description_1
|
|
|
399 };
|
|
|
400
|
|
|
401 static const struct lrecord_description foo_description[] = {
|
|
|
402 ...
|
|
|
403 { XD_INT, offsetof (Lisp_Foo, count) },
|
|
|
404 { XD_STRUCT_PTR, offsetof (Lisp_Foo, objects),
|
|
|
405 XD_INDIRECT (0, 0), &lo_description },
|
|
|
406 ...
|
|
|
407 };
|
|
|
408
|
|
|
409
|
|
|
410 Another example of XD_STRUCT_PTR:
|
|
428
|
411
|
|
814
|
412 typedef struct hentry
|
|
|
413 {
|
|
|
414 Lisp_Object key;
|
|
|
415 Lisp_Object value;
|
|
|
416 } hentry;
|
|
|
417
|
|
|
418 struct Lisp_Hash_Table
|
|
|
419 {
|
|
|
420 struct lcrecord_header header;
|
|
|
421 Elemcount size;
|
|
|
422 Elemcount count;
|
|
|
423 Elemcount rehash_count;
|
|
|
424 double rehash_size;
|
|
|
425 double rehash_threshold;
|
|
|
426 Elemcount golden_ratio;
|
|
|
427 hash_table_hash_function_t hash_function;
|
|
|
428 hash_table_test_function_t test_function;
|
|
|
429 hentry *hentries;
|
|
|
430 enum hash_table_weakness weakness;
|
|
|
431 Lisp_Object next_weak; // Used to chain together all of the weak
|
|
|
432 // hash tables. Don't mark through this.
|
|
|
433 };
|
|
|
434
|
|
|
435 static const struct lrecord_description hentry_description_1[] = {
|
|
|
436 { XD_LISP_OBJECT, offsetof (hentry, key) },
|
|
|
437 { XD_LISP_OBJECT, offsetof (hentry, value) },
|
|
|
438 { XD_END }
|
|
|
439 };
|
|
|
440
|
|
|
441 static const struct struct_description hentry_description = {
|
|
|
442 sizeof (hentry),
|
|
|
443 hentry_description_1
|
|
|
444 };
|
|
|
445
|
|
|
446 const struct lrecord_description hash_table_description[] = {
|
|
|
447 { XD_ELEMCOUNT, offsetof (Lisp_Hash_Table, size) },
|
|
|
448 { XD_STRUCT_PTR, offsetof (Lisp_Hash_Table, hentries), XD_INDIRECT(0, 1),
|
|
|
449 &hentry_description },
|
|
|
450 { XD_LO_LINK, offsetof (Lisp_Hash_Table, next_weak) },
|
|
|
451 { XD_END }
|
|
|
452 };
|
|
|
453
|
|
|
454 Note that we don't need to declare all the elements in the structure, just
|
|
|
455 the ones that need to be relocated (Lisp_Objects and structures) or that
|
|
|
456 need to be referenced as counts for relocated objects.
|
|
|
457
|
|
|
458
|
|
|
459 The existing types :
|
|
|
460
|
|
|
461
|
|
428
|
462 XD_LISP_OBJECT
|
|
440
|
463 A Lisp object. This is also the type to use for pointers to other lrecords.
|
|
428
|
464
|
|
440
|
465 XD_LISP_OBJECT_ARRAY
|
|
771
|
466 An array of Lisp objects or (equivalently) pointers to lrecords.
|
|
|
467 The parameter (i.e. third element) is the count. This would be declared
|
|
|
468 as Lisp_Object foo[666]. For something declared as Lisp_Object *foo,
|
|
|
469 use XD_STRUCT_PTR, whose description parameter is a struct_description
|
|
|
470 consisting of only XD_LISP_OBJECT and XD_END.
|
|
440
|
471
|
|
428
|
472 XD_LO_LINK
|
|
771
|
473 Weak link in a linked list of objects of the same type. This is a
|
|
|
474 link that does NOT generate a GC reference. Thus the pdumper will
|
|
|
475 not automatically add the referenced object to the table of all
|
|
|
476 objects to be dumped, and when storing and loading the dumped data
|
|
|
477 will automatically prune unreferenced objects in the chain and link
|
|
|
478 each referenced object to the next referenced object, even if it's
|
|
|
479 many links away. We also need to special handling of a similar
|
|
|
480 nature for the root of the chain, which will be a staticpro()ed
|
|
|
481 object.
|
|
432
|
482
|
|
428
|
483 XD_OPAQUE_PTR
|
|
|
484 Pointer to undumpable data. Must be NULL when dumping.
|
|
|
485
|
|
|
486 XD_STRUCT_PTR
|
|
771
|
487 Pointer to block of described memory. (This is misnamed: It is NOT
|
|
|
488 necessarily a pointer to a struct foo.) Parameters are number of
|
|
|
489 contiguous blocks and struct_description.
|
|
|
490
|
|
|
491 XD_STRUCT_ARRAY
|
|
|
492 Array of blocks of described memory. Parameters are number of
|
|
|
493 structures and struct_description. This differs from XD_STRUCT_PTR
|
|
|
494 in that the parameter is declared as struct foo[666] instead of
|
|
|
495 struct *foo. In other words, the block of memory holding the
|
|
|
496 structures is within the containing structure, rather than being
|
|
|
497 elsewhere, with a pointer in the containing structure.
|
|
428
|
498
|
|
|
499 XD_OPAQUE_DATA_PTR
|
|
|
500 Pointer to dumpable opaque data. Parameter is the size of the data.
|
|
|
501 Pointed data must be relocatable without changes.
|
|
|
502
|
|
771
|
503 XD_UNION
|
|
|
504 Union of two or more different types of data. Parameters are a
|
|
|
505 constant which determines which type the data is (this is usually an
|
|
|
506 XD_INDIRECT, referring to one of the fields in the structure), and
|
|
|
507 an array of struct_descriptions, whose values are used as follows,
|
|
|
508 which is *DIFFERENT* from their usage in XD_STRUCT_PTR: the first
|
|
|
509 field is a constant, which is compared to the first parameter of the
|
|
|
510 XD_UNION descriptor to determine if this description applies to the
|
|
|
511 data at the given offset, and the second is a pointer to a *SINGLE*
|
|
|
512 lrecord_description structure, describing the data being pointed at
|
|
|
513 when the associated constant matches. You can go ahead and create
|
|
|
514 an array of lrecord_description structures and put an XD_END on it,
|
|
|
515 but only the first one is used. If the data being pointed at is a
|
|
|
516 structure, you *MAY NOT* substitute an array of lrecord_description
|
|
|
517 structures describing the structure; instead, use a single
|
|
|
518 lrecord_description structure with an XD_STRUCT_PTR in it, and point
|
|
|
519 it in turn to the description of the structure. See charset.h for a
|
|
|
520 description of how to use XD_UNION. (In other words, if the constant
|
|
|
521 matches, the lrecord_description pointed at will in essence be
|
|
|
522 substituted for the XD_UNION declaration.)
|
|
|
523
|
|
428
|
524 XD_C_STRING
|
|
|
525 Pointer to a C string.
|
|
|
526
|
|
|
527 XD_DOC_STRING
|
|
|
528 Pointer to a doc string (C string if positive, opaque value if negative)
|
|
|
529
|
|
|
530 XD_INT_RESET
|
|
|
531 An integer which will be reset to a given value in the dump file.
|
|
|
532
|
|
771
|
533
|
|
665
|
534 XD_ELEMCOUNT
|
|
|
535 Elemcount value. Used for counts.
|
|
647
|
536
|
|
665
|
537 XD_BYTECOUNT
|
|
|
538 Bytecount value. Used for counts.
|
|
647
|
539
|
|
665
|
540 XD_HASHCODE
|
|
|
541 Hashcode value. Used for the results of hashing functions.
|
|
428
|
542
|
|
|
543 XD_INT
|
|
|
544 int value. Used for counts.
|
|
|
545
|
|
|
546 XD_LONG
|
|
|
547 long value. Used for counts.
|
|
|
548
|
|
771
|
549 XD_BYTECOUNT
|
|
|
550 bytecount value. Used for counts.
|
|
|
551
|
|
428
|
552 XD_END
|
|
|
553 Special type indicating the end of the array.
|
|
|
554
|
|
|
555 XD_SPECIFIER_END
|
|
|
556 Special type indicating the end of the array for a specifier. Extra
|
|
771
|
557 description, describing the specifier-type-specific data at the end
|
|
|
558 of the specifier object, is going to be fetched from the specifier
|
|
|
559 methods. This should occur exactly once, in the description of the
|
|
|
560 specifier object, and the dump code knows how to special-case this
|
|
|
561 by fetching the specifier_methods pointer from the appropriate place
|
|
|
562 in the memory block (which will, of course, be a struct
|
|
|
563 Lisp_Specifier), fetching the description of the
|
|
|
564 specifier-type-specific data from this, and continuing processing
|
|
|
565 the memory block.
|
|
|
566
|
|
|
567 XD_CODING_SYSTEM_END
|
|
|
568 Special type indicating the end of the array for a coding system.
|
|
|
569 Extra description is going to be fetched from the coding system
|
|
|
570 methods. Works just like XD_SPECIFIER_END.
|
|
428
|
571
|
|
|
572
|
|
|
573 Special macros:
|
|
|
574 XD_INDIRECT(line, delta)
|
|
|
575 Usable where a "count" or "size" is requested. Gives the value of
|
|
|
576 the element which is at line number 'line' in the description (count
|
|
|
577 starts at zero) and adds delta to it.
|
|
|
578 */
|
|
|
579
|
|
647
|
580 enum lrecord_description_type
|
|
|
581 {
|
|
440
|
582 XD_LISP_OBJECT_ARRAY,
|
|
428
|
583 XD_LISP_OBJECT,
|
|
|
584 XD_LO_LINK,
|
|
|
585 XD_OPAQUE_PTR,
|
|
|
586 XD_STRUCT_PTR,
|
|
771
|
587 XD_STRUCT_ARRAY,
|
|
428
|
588 XD_OPAQUE_DATA_PTR,
|
|
771
|
589 XD_UNION,
|
|
428
|
590 XD_C_STRING,
|
|
|
591 XD_DOC_STRING,
|
|
|
592 XD_INT_RESET,
|
|
665
|
593 XD_BYTECOUNT,
|
|
|
594 XD_ELEMCOUNT,
|
|
|
595 XD_HASHCODE,
|
|
428
|
596 XD_INT,
|
|
|
597 XD_LONG,
|
|
|
598 XD_END,
|
|
771
|
599 XD_SPECIFIER_END,
|
|
|
600 XD_CODING_SYSTEM_END
|
|
428
|
601 };
|
|
|
602
|
|
647
|
603 struct lrecord_description
|
|
|
604 {
|
|
428
|
605 enum lrecord_description_type type;
|
|
|
606 int offset;
|
|
|
607 EMACS_INT data1;
|
|
|
608 const struct struct_description *data2;
|
|
|
609 };
|
|
|
610
|
|
647
|
611 struct struct_description
|
|
|
612 {
|
|
665
|
613 Bytecount size;
|
|
428
|
614 const struct lrecord_description *description;
|
|
|
615 };
|
|
|
616
|
|
|
617 #define XD_INDIRECT(val, delta) (-1-((val)|(delta<<8)))
|
|
|
618
|
|
|
619 #define XD_IS_INDIRECT(code) (code<0)
|
|
|
620 #define XD_INDIRECT_VAL(code) ((-1-code) & 255)
|
|
|
621 #define XD_INDIRECT_DELTA(code) (((-1-code)>>8) & 255)
|
|
|
622
|
|
|
623 #define XD_DYNARR_DESC(base_type, sub_desc) \
|
|
440
|
624 { XD_STRUCT_PTR, offsetof (base_type, base), XD_INDIRECT(1, 0), sub_desc }, \
|
|
|
625 { XD_INT, offsetof (base_type, cur) }, \
|
|
|
626 { XD_INT_RESET, offsetof (base_type, max), XD_INDIRECT(1, 0) }
|
|
428
|
627
|
|
|
628 /* DEFINE_LRECORD_IMPLEMENTATION is for objects with constant size.
|
|
|
629 DEFINE_LRECORD_SEQUENCE_IMPLEMENTATION is for objects whose size varies.
|
|
|
630 */
|
|
|
631
|
|
800
|
632 #if defined (ERROR_CHECK_TYPES)
|
|
|
633 # define DECLARE_ERROR_CHECK_TYPES(c_name, structtype)
|
|
428
|
634 #else
|
|
800
|
635 # define DECLARE_ERROR_CHECK_TYPES(c_name, structtype)
|
|
428
|
636 #endif
|
|
|
637
|
|
|
638 #define DEFINE_BASIC_LRECORD_IMPLEMENTATION(name,c_name,marker,printer,nuker,equal,hash,desc,structtype) \
|
|
|
639 DEFINE_BASIC_LRECORD_IMPLEMENTATION_WITH_PROPS(name,c_name,marker,printer,nuker,equal,hash,desc,0,0,0,0,structtype)
|
|
|
640
|
|
442
|
641 #define DEFINE_BASIC_LRECORD_IMPLEMENTATION_WITH_PROPS(name,c_name,marker,printer,nuker,equal,hash,desc,getprop,putprop,remprop,plist,structtype) \
|
|
|
642 MAKE_LRECORD_IMPLEMENTATION(name,c_name,marker,printer,nuker,equal,hash,desc,getprop,putprop,remprop,plist,sizeof(structtype),0,1,structtype)
|
|
428
|
643
|
|
|
644 #define DEFINE_LRECORD_IMPLEMENTATION(name,c_name,marker,printer,nuker,equal,hash,desc,structtype) \
|
|
|
645 DEFINE_LRECORD_IMPLEMENTATION_WITH_PROPS(name,c_name,marker,printer,nuker,equal,hash,desc,0,0,0,0,structtype)
|
|
|
646
|
|
442
|
647 #define DEFINE_LRECORD_IMPLEMENTATION_WITH_PROPS(name,c_name,marker,printer,nuker,equal,hash,desc,getprop,putprop,remprop,plist,structtype) \
|
|
|
648 MAKE_LRECORD_IMPLEMENTATION(name,c_name,marker,printer,nuker,equal,hash,desc,getprop,putprop,remprop,plist,sizeof (structtype),0,0,structtype)
|
|
428
|
649
|
|
|
650 #define DEFINE_LRECORD_SEQUENCE_IMPLEMENTATION(name,c_name,marker,printer,nuker,equal,hash,desc,sizer,structtype) \
|
|
|
651 DEFINE_LRECORD_SEQUENCE_IMPLEMENTATION_WITH_PROPS(name,c_name,marker,printer,nuker,equal,hash,desc,0,0,0,0,sizer,structtype)
|
|
|
652
|
|
442
|
653 #define DEFINE_BASIC_LRECORD_SEQUENCE_IMPLEMENTATION(name,c_name,marker,printer,nuker,equal,hash,desc,sizer,structtype) \
|
|
|
654 MAKE_LRECORD_IMPLEMENTATION(name,c_name,marker,printer,nuker,equal,hash,desc,0,0,0,0,0,sizer,1,structtype)
|
|
428
|
655
|
|
442
|
656 #define DEFINE_LRECORD_SEQUENCE_IMPLEMENTATION_WITH_PROPS(name,c_name,marker,printer,nuker,equal,hash,desc,getprop,putprop,remprop,plist,sizer,structtype) \
|
|
771
|
657 MAKE_LRECORD_IMPLEMENTATION(name,c_name,marker,printer,nuker,equal,hash,desc,getprop,putprop,remprop,plist,0,sizer,0,structtype)
|
|
442
|
658
|
|
|
659 #define MAKE_LRECORD_IMPLEMENTATION(name,c_name,marker,printer,nuker,equal,hash,desc,getprop,putprop,remprop,plist,size,sizer,basic_p,structtype) \
|
|
800
|
660 DECLARE_ERROR_CHECK_TYPES(c_name, structtype) \
|
|
442
|
661 const struct lrecord_implementation lrecord_##c_name = \
|
|
428
|
662 { name, marker, printer, nuker, equal, hash, desc, \
|
|
442
|
663 getprop, putprop, remprop, plist, size, sizer, \
|
|
|
664 lrecord_type_##c_name, basic_p }
|
|
|
665
|
|
|
666 #define DEFINE_EXTERNAL_LRECORD_IMPLEMENTATION(name,c_name,marker,printer,nuker,equal,hash,desc,structtype) \
|
|
|
667 DEFINE_EXTERNAL_LRECORD_IMPLEMENTATION_WITH_PROPS(name,c_name,marker,printer,nuker,equal,hash,desc,0,0,0,0,structtype)
|
|
|
668
|
|
|
669 #define DEFINE_EXTERNAL_LRECORD_IMPLEMENTATION_WITH_PROPS(name,c_name,marker,printer,nuker,equal,hash,desc,getprop,putprop,remprop,plist,structtype) \
|
|
|
670 MAKE_EXTERNAL_LRECORD_IMPLEMENTATION(name,c_name,marker,printer,nuker,equal,hash,desc,getprop,putprop,remprop,plist,sizeof (structtype),0,0,structtype)
|
|
|
671
|
|
|
672 #define DEFINE_EXTERNAL_LRECORD_SEQUENCE_IMPLEMENTATION(name,c_name,marker,printer,nuker,equal,hash,desc,sizer,structtype) \
|
|
|
673 DEFINE_EXTERNAL_LRECORD_SEQUENCE_IMPLEMENTATION_WITH_PROPS(name,c_name,marker,printer,nuker,equal,hash,desc,0,0,0,0,sizer,structtype)
|
|
|
674
|
|
|
675 #define DEFINE_EXTERNAL_LRECORD_SEQUENCE_IMPLEMENTATION_WITH_PROPS(name,c_name,marker,printer,nuker,equal,hash,desc,getprop,putprop,remprop,plist,sizer,structtype) \
|
|
|
676 MAKE_EXTERNAL_LRECORD_IMPLEMENTATION(name,c_name,marker,printer,nuker,equal,hash,desc,getprop,putprop,remprop,plist,0,sizer,0,structtype)
|
|
|
677
|
|
|
678 #define MAKE_EXTERNAL_LRECORD_IMPLEMENTATION(name,c_name,marker,printer,nuker,equal,hash,desc,getprop,putprop,remprop,plist,size,sizer,basic_p,structtype) \
|
|
800
|
679 DECLARE_ERROR_CHECK_TYPES(c_name, structtype) \
|
|
647
|
680 int lrecord_type_##c_name; \
|
|
444
|
681 struct lrecord_implementation lrecord_##c_name = \
|
|
442
|
682 { name, marker, printer, nuker, equal, hash, desc, \
|
|
|
683 getprop, putprop, remprop, plist, size, sizer, \
|
|
444
|
684 lrecord_type_last_built_in_type, basic_p }
|
|
442
|
685
|
|
|
686
|
|
|
687 extern Lisp_Object (*lrecord_markers[]) (Lisp_Object);
|
|
|
688
|
|
|
689 #define INIT_LRECORD_IMPLEMENTATION(type) do { \
|
|
|
690 lrecord_implementations_table[lrecord_type_##type] = &lrecord_##type; \
|
|
|
691 lrecord_markers[lrecord_type_##type] = \
|
|
|
692 lrecord_implementations_table[lrecord_type_##type]->marker; \
|
|
|
693 } while (0)
|
|
428
|
694
|
|
444
|
695 #define INIT_EXTERNAL_LRECORD_IMPLEMENTATION(type) do { \
|
|
|
696 lrecord_type_##type = lrecord_type_count++; \
|
|
|
697 lrecord_##type.lrecord_type_index = lrecord_type_##type; \
|
|
|
698 INIT_LRECORD_IMPLEMENTATION(type); \
|
|
|
699 } while (0)
|
|
|
700
|
|
428
|
701 #define LRECORDP(a) (XTYPE (a) == Lisp_Type_Record)
|
|
|
702 #define XRECORD_LHEADER(a) ((struct lrecord_header *) XPNTR (a))
|
|
|
703
|
|
|
704 #define RECORD_TYPEP(x, ty) \
|
|
647
|
705 (LRECORDP (x) && (XRECORD_LHEADER (x)->type == (unsigned int) (ty)))
|
|
442
|
706
|
|
|
707 /* Steps to create a new object:
|
|
|
708
|
|
|
709 1. Declare the struct for your object in a header file somewhere.
|
|
|
710 Remember that it must begin with
|
|
|
711
|
|
|
712 struct lcrecord_header header;
|
|
|
713
|
|
793
|
714 2. Put the "standard junk" (DECLARE_RECORD()/XFOO/etc.) below the
|
|
617
|
715 struct definition -- see below.
|
|
442
|
716
|
|
|
717 3. Add this header file to inline.c.
|
|
|
718
|
|
|
719 4. Create the methods for your object. Note that technically you don't
|
|
|
720 need any, but you will almost always want at least a mark method.
|
|
|
721
|
|
|
722 5. Define your object with DEFINE_LRECORD_IMPLEMENTATION() or some
|
|
|
723 variant.
|
|
|
724
|
|
|
725 6. Include the header file in the .c file where you defined the object.
|
|
|
726
|
|
|
727 7. Put a call to INIT_LRECORD_IMPLEMENTATION() for the object in the
|
|
|
728 .c file's syms_of_foo() function.
|
|
|
729
|
|
|
730 8. Add a type enum for the object to enum lrecord_type, earlier in this
|
|
|
731 file.
|
|
|
732
|
|
|
733 An example:
|
|
428
|
734
|
|
442
|
735 ------------------------------ in toolbar.h -----------------------------
|
|
|
736
|
|
|
737 struct toolbar_button
|
|
|
738 {
|
|
|
739 struct lcrecord_header header;
|
|
|
740
|
|
|
741 Lisp_Object next;
|
|
|
742 Lisp_Object frame;
|
|
|
743
|
|
|
744 Lisp_Object up_glyph;
|
|
|
745 Lisp_Object down_glyph;
|
|
|
746 Lisp_Object disabled_glyph;
|
|
|
747
|
|
|
748 Lisp_Object cap_up_glyph;
|
|
|
749 Lisp_Object cap_down_glyph;
|
|
|
750 Lisp_Object cap_disabled_glyph;
|
|
|
751
|
|
|
752 Lisp_Object callback;
|
|
|
753 Lisp_Object enabled_p;
|
|
|
754 Lisp_Object help_string;
|
|
|
755
|
|
|
756 char enabled;
|
|
|
757 char down;
|
|
|
758 char pushright;
|
|
|
759 char blank;
|
|
|
760
|
|
|
761 int x, y;
|
|
|
762 int width, height;
|
|
|
763 int dirty;
|
|
|
764 int vertical;
|
|
|
765 int border_width;
|
|
|
766 };
|
|
428
|
767
|
|
617
|
768 [[ the standard junk: ]]
|
|
|
769
|
|
442
|
770 DECLARE_LRECORD (toolbar_button, struct toolbar_button);
|
|
|
771 #define XTOOLBAR_BUTTON(x) XRECORD (x, toolbar_button, struct toolbar_button)
|
|
617
|
772 #define wrap_toolbar_button(p) wrap_record (p, toolbar_button)
|
|
442
|
773 #define TOOLBAR_BUTTONP(x) RECORDP (x, toolbar_button)
|
|
|
774 #define CHECK_TOOLBAR_BUTTON(x) CHECK_RECORD (x, toolbar_button)
|
|
|
775 #define CONCHECK_TOOLBAR_BUTTON(x) CONCHECK_RECORD (x, toolbar_button)
|
|
|
776
|
|
|
777 ------------------------------ in toolbar.c -----------------------------
|
|
|
778
|
|
|
779 #include "toolbar.h"
|
|
|
780
|
|
|
781 ...
|
|
|
782
|
|
|
783 static Lisp_Object
|
|
|
784 mark_toolbar_button (Lisp_Object obj)
|
|
|
785 {
|
|
|
786 struct toolbar_button *data = XTOOLBAR_BUTTON (obj);
|
|
|
787 mark_object (data->next);
|
|
|
788 mark_object (data->frame);
|
|
|
789 mark_object (data->up_glyph);
|
|
|
790 mark_object (data->down_glyph);
|
|
|
791 mark_object (data->disabled_glyph);
|
|
|
792 mark_object (data->cap_up_glyph);
|
|
|
793 mark_object (data->cap_down_glyph);
|
|
|
794 mark_object (data->cap_disabled_glyph);
|
|
|
795 mark_object (data->callback);
|
|
|
796 mark_object (data->enabled_p);
|
|
|
797 return data->help_string;
|
|
|
798 }
|
|
|
799
|
|
617
|
800 [[ If your object should never escape to Lisp, declare its print method
|
|
|
801 as internal_object_printer instead of 0. ]]
|
|
|
802
|
|
442
|
803 DEFINE_LRECORD_IMPLEMENTATION ("toolbar-button", toolbar_button,
|
|
617
|
804 mark_toolbar_button, 0,
|
|
|
805 0, 0, 0, 0, struct toolbar_button);
|
|
442
|
806
|
|
|
807 ...
|
|
|
808
|
|
|
809 void
|
|
|
810 syms_of_toolbar (void)
|
|
|
811 {
|
|
|
812 INIT_LRECORD_IMPLEMENTATION (toolbar_button);
|
|
|
813
|
|
|
814 ...;
|
|
|
815 }
|
|
|
816
|
|
|
817 ------------------------------ in inline.c -----------------------------
|
|
|
818
|
|
|
819 #ifdef HAVE_TOOLBARS
|
|
|
820 #include "toolbar.h"
|
|
|
821 #endif
|
|
|
822
|
|
|
823 ------------------------------ in lrecord.h -----------------------------
|
|
|
824
|
|
|
825 enum lrecord_type
|
|
|
826 {
|
|
|
827 ...
|
|
|
828 lrecord_type_toolbar_button,
|
|
|
829 ...
|
|
|
830 };
|
|
|
831
|
|
|
832 */
|
|
|
833
|
|
|
834 /*
|
|
|
835
|
|
|
836 Note: Object types defined in external dynamically-loaded modules (not
|
|
|
837 part of the XEmacs main source code) should use DECLARE_EXTERNAL_LRECORD
|
|
|
838 and DEFINE_EXTERNAL_LRECORD_IMPLEMENTATION rather than DECLARE_LRECORD
|
|
|
839 and DEFINE_LRECORD_IMPLEMENTATION.
|
|
|
840
|
|
|
841 */
|
|
|
842
|
|
428
|
843
|
|
800
|
844 #ifdef ERROR_CHECK_TYPES
|
|
428
|
845
|
|
788
|
846 # define DECLARE_LRECORD(c_name, structtype) \
|
|
|
847 extern const struct lrecord_implementation lrecord_##c_name; \
|
|
826
|
848 DECLARE_INLINE_HEADER ( \
|
|
|
849 structtype * \
|
|
788
|
850 error_check_##c_name (Lisp_Object obj, const char *file, int line) \
|
|
826
|
851 ) \
|
|
788
|
852 { \
|
|
|
853 assert_at_line (RECORD_TYPEP (obj, lrecord_type_##c_name), file, line); \
|
|
|
854 return (structtype *) XPNTR (obj); \
|
|
|
855 } \
|
|
428
|
856 extern Lisp_Object Q##c_name##p
|
|
|
857
|
|
788
|
858 # define DECLARE_EXTERNAL_LRECORD(c_name, structtype) \
|
|
|
859 extern int lrecord_type_##c_name; \
|
|
|
860 extern struct lrecord_implementation lrecord_##c_name; \
|
|
826
|
861 DECLARE_INLINE_HEADER ( \
|
|
|
862 structtype * \
|
|
788
|
863 error_check_##c_name (Lisp_Object obj, const char *file, int line) \
|
|
826
|
864 ) \
|
|
788
|
865 { \
|
|
|
866 assert_at_line (RECORD_TYPEP (obj, lrecord_type_##c_name), file, line); \
|
|
|
867 return (structtype *) XPNTR (obj); \
|
|
|
868 } \
|
|
444
|
869 extern Lisp_Object Q##c_name##p
|
|
442
|
870
|
|
788
|
871 # define DECLARE_NONRECORD(c_name, type_enum, structtype) \
|
|
826
|
872 DECLARE_INLINE_HEADER ( \
|
|
|
873 structtype * \
|
|
788
|
874 error_check_##c_name (Lisp_Object obj, const char *file, int line) \
|
|
826
|
875 ) \
|
|
788
|
876 { \
|
|
|
877 assert_at_line (XTYPE (obj) == type_enum, file, line); \
|
|
|
878 return (structtype *) XPNTR (obj); \
|
|
|
879 } \
|
|
428
|
880 extern Lisp_Object Q##c_name##p
|
|
|
881
|
|
788
|
882 # define XRECORD(x, c_name, structtype) \
|
|
|
883 error_check_##c_name (x, __FILE__, __LINE__)
|
|
|
884 # define XNONRECORD(x, c_name, type_enum, structtype) \
|
|
|
885 error_check_##c_name (x, __FILE__, __LINE__)
|
|
428
|
886
|
|
826
|
887 DECLARE_INLINE_HEADER (
|
|
|
888 Lisp_Object
|
|
800
|
889 wrap_record_1 (const void *ptr, enum lrecord_type ty, const char *file,
|
|
|
890 int line)
|
|
826
|
891 )
|
|
617
|
892 {
|
|
793
|
893 Lisp_Object obj = wrap_pointer_1 (ptr);
|
|
|
894
|
|
788
|
895 assert_at_line (RECORD_TYPEP (obj, ty), file, line);
|
|
617
|
896 return obj;
|
|
|
897 }
|
|
|
898
|
|
788
|
899 #define wrap_record(ptr, ty) \
|
|
|
900 wrap_record_1 (ptr, lrecord_type_##ty, __FILE__, __LINE__)
|
|
617
|
901
|
|
800
|
902 #else /* not ERROR_CHECK_TYPES */
|
|
428
|
903
|
|
|
904 # define DECLARE_LRECORD(c_name, structtype) \
|
|
|
905 extern Lisp_Object Q##c_name##p; \
|
|
442
|
906 extern const struct lrecord_implementation lrecord_##c_name
|
|
|
907 # define DECLARE_EXTERNAL_LRECORD(c_name, structtype) \
|
|
|
908 extern Lisp_Object Q##c_name##p; \
|
|
647
|
909 extern int lrecord_type_##c_name; \
|
|
444
|
910 extern struct lrecord_implementation lrecord_##c_name
|
|
428
|
911 # define DECLARE_NONRECORD(c_name, type_enum, structtype) \
|
|
|
912 extern Lisp_Object Q##c_name##p
|
|
|
913 # define XRECORD(x, c_name, structtype) ((structtype *) XPNTR (x))
|
|
|
914 # define XNONRECORD(x, c_name, type_enum, structtype) \
|
|
|
915 ((structtype *) XPNTR (x))
|
|
617
|
916 /* wrap_pointer_1 is so named as a suggestion not to use it unless you
|
|
|
917 know what you're doing. */
|
|
|
918 #define wrap_record(ptr, ty) wrap_pointer_1 (ptr)
|
|
428
|
919
|
|
800
|
920 #endif /* not ERROR_CHECK_TYPES */
|
|
428
|
921
|
|
442
|
922 #define RECORDP(x, c_name) RECORD_TYPEP (x, lrecord_type_##c_name)
|
|
428
|
923
|
|
|
924 /* Note: we now have two different kinds of type-checking macros.
|
|
|
925 The "old" kind has now been renamed CONCHECK_foo. The reason for
|
|
|
926 this is that the CONCHECK_foo macros signal a continuable error,
|
|
|
927 allowing the user (through debug-on-error) to substitute a different
|
|
|
928 value and return from the signal, which causes the lvalue argument
|
|
|
929 to get changed. Quite a lot of code would crash if that happened,
|
|
|
930 because it did things like
|
|
|
931
|
|
|
932 foo = XCAR (list);
|
|
|
933 CHECK_STRING (foo);
|
|
|
934
|
|
|
935 and later on did XSTRING (XCAR (list)), assuming that the type
|
|
|
936 is correct (when it might be wrong, if the user substituted a
|
|
|
937 correct value in the debugger).
|
|
|
938
|
|
|
939 To get around this, I made all the CHECK_foo macros signal a
|
|
|
940 non-continuable error. Places where a continuable error is OK
|
|
|
941 (generally only when called directly on the argument of a Lisp
|
|
|
942 primitive) should be changed to use CONCHECK().
|
|
|
943
|
|
|
944 FSF Emacs does not have this problem because RMS took the cheesy
|
|
|
945 way out and disabled returning from a signal entirely. */
|
|
|
946
|
|
|
947 #define CONCHECK_RECORD(x, c_name) do { \
|
|
442
|
948 if (!RECORD_TYPEP (x, lrecord_type_##c_name)) \
|
|
428
|
949 x = wrong_type_argument (Q##c_name##p, x); \
|
|
|
950 } while (0)
|
|
|
951 #define CONCHECK_NONRECORD(x, lisp_enum, predicate) do {\
|
|
|
952 if (XTYPE (x) != lisp_enum) \
|
|
|
953 x = wrong_type_argument (predicate, x); \
|
|
|
954 } while (0)
|
|
|
955 #define CHECK_RECORD(x, c_name) do { \
|
|
442
|
956 if (!RECORD_TYPEP (x, lrecord_type_##c_name)) \
|
|
428
|
957 dead_wrong_type_argument (Q##c_name##p, x); \
|
|
|
958 } while (0)
|
|
|
959 #define CHECK_NONRECORD(x, lisp_enum, predicate) do { \
|
|
|
960 if (XTYPE (x) != lisp_enum) \
|
|
|
961 dead_wrong_type_argument (predicate, x); \
|
|
|
962 } while (0)
|
|
|
963
|
|
826
|
964 /* Various ways of allocating lcrecords. All bytes (except lcrecord
|
|
|
965 header) are zeroed in returned structure. */
|
|
|
966
|
|
665
|
967 void *alloc_lcrecord (Bytecount size,
|
|
647
|
968 const struct lrecord_implementation *);
|
|
428
|
969
|
|
771
|
970 void *alloc_automanaged_lcrecord (Bytecount size,
|
|
|
971 const struct lrecord_implementation *);
|
|
|
972
|
|
|
973 #define alloc_unmanaged_lcrecord_type(type, lrecord_implementation) \
|
|
|
974 ((type *) alloc_lcrecord (sizeof (type), lrecord_implementation))
|
|
|
975
|
|
428
|
976 #define alloc_lcrecord_type(type, lrecord_implementation) \
|
|
771
|
977 ((type *) alloc_automanaged_lcrecord (sizeof (type), lrecord_implementation))
|
|
|
978
|
|
|
979 void free_lcrecord (Lisp_Object rec);
|
|
|
980
|
|
428
|
981
|
|
|
982 /* Copy the data from one lcrecord structure into another, but don't
|
|
|
983 overwrite the header information. */
|
|
|
984
|
|
771
|
985 #define copy_sized_lcrecord(dst, src, size) \
|
|
430
|
986 memcpy ((char *) (dst) + sizeof (struct lcrecord_header), \
|
|
|
987 (char *) (src) + sizeof (struct lcrecord_header), \
|
|
771
|
988 (size) - sizeof (struct lcrecord_header))
|
|
|
989
|
|
|
990 #define copy_lcrecord(dst, src) copy_sized_lcrecord (dst, src, sizeof (*(dst)))
|
|
428
|
991
|
|
771
|
992 #define zero_sized_lcrecord(lcr, size) \
|
|
430
|
993 memset ((char *) (lcr) + sizeof (struct lcrecord_header), 0, \
|
|
771
|
994 (size) - sizeof (struct lcrecord_header))
|
|
|
995
|
|
|
996 #define zero_lcrecord(lcr) zero_sized_lcrecord(lcr, sizeof (*(lcr)))
|
|
428
|
997
|
|
440
|
998 #endif /* INCLUDED_lrecord_h_ */
|
