|
428
|
1 /* Storage allocation and gc for XEmacs Lisp interpreter.
|
|
|
2 Copyright (C) 1985-1998 Free Software Foundation, Inc.
|
|
|
3 Copyright (C) 1995 Sun Microsystems, Inc.
|
|
1265
|
4 Copyright (C) 1995, 1996, 2001, 2002, 2003 Ben Wing.
|
|
428
|
5
|
|
|
6 This file is part of XEmacs.
|
|
|
7
|
|
|
8 XEmacs is free software; you can redistribute it and/or modify it
|
|
|
9 under the terms of the GNU General Public License as published by the
|
|
|
10 Free Software Foundation; either version 2, or (at your option) any
|
|
|
11 later version.
|
|
|
12
|
|
|
13 XEmacs is distributed in the hope that it will be useful, but WITHOUT
|
|
|
14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
16 for more details.
|
|
|
17
|
|
|
18 You should have received a copy of the GNU General Public License
|
|
|
19 along with XEmacs; see the file COPYING. If not, write to
|
|
|
20 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
21 Boston, MA 02111-1307, USA. */
|
|
|
22
|
|
|
23 /* Synched up with: FSF 19.28, Mule 2.0. Substantially different from
|
|
|
24 FSF. */
|
|
|
25
|
|
|
26 /* Authorship:
|
|
|
27
|
|
|
28 FSF: Original version; a long time ago.
|
|
|
29 Mly: Significantly rewritten to use new 3-bit tags and
|
|
|
30 nicely abstracted object definitions, for 19.8.
|
|
|
31 JWZ: Improved code to keep track of purespace usage and
|
|
|
32 issue nice purespace and GC stats.
|
|
|
33 Ben Wing: Cleaned up frob-block lrecord code, added error-checking
|
|
|
34 and various changes for Mule, for 19.12.
|
|
|
35 Added bit vectors for 19.13.
|
|
|
36 Added lcrecord lists for 19.14.
|
|
|
37 slb: Lots of work on the purification and dump time code.
|
|
|
38 Synched Doug Lea malloc support from Emacs 20.2.
|
|
442
|
39 og: Killed the purespace. Portable dumper (moved to dumper.c)
|
|
428
|
40 */
|
|
|
41
|
|
|
42 #include <config.h>
|
|
|
43 #include "lisp.h"
|
|
|
44
|
|
|
45 #include "backtrace.h"
|
|
|
46 #include "buffer.h"
|
|
|
47 #include "bytecode.h"
|
|
|
48 #include "chartab.h"
|
|
|
49 #include "device.h"
|
|
|
50 #include "elhash.h"
|
|
|
51 #include "events.h"
|
|
872
|
52 #include "extents-impl.h"
|
|
1204
|
53 #include "file-coding.h"
|
|
872
|
54 #include "frame-impl.h"
|
|
428
|
55 #include "glyphs.h"
|
|
|
56 #include "opaque.h"
|
|
1204
|
57 #include "lstream.h"
|
|
872
|
58 #include "process.h"
|
|
1292
|
59 #include "profile.h"
|
|
428
|
60 #include "redisplay.h"
|
|
|
61 #include "specifier.h"
|
|
|
62 #include "sysfile.h"
|
|
442
|
63 #include "sysdep.h"
|
|
428
|
64 #include "window.h"
|
|
|
65 #include "console-stream.h"
|
|
|
66
|
|
|
67 #ifdef DOUG_LEA_MALLOC
|
|
|
68 #include <malloc.h>
|
|
|
69 #endif
|
|
|
70
|
|
|
71 EXFUN (Fgarbage_collect, 0);
|
|
|
72
|
|
814
|
73 static void recompute_need_to_garbage_collect (void);
|
|
|
74
|
|
428
|
75 #if 0 /* this is _way_ too slow to be part of the standard debug options */
|
|
|
76 #if defined(DEBUG_XEMACS) && defined(MULE)
|
|
|
77 #define VERIFY_STRING_CHARS_INTEGRITY
|
|
|
78 #endif
|
|
|
79 #endif
|
|
|
80
|
|
|
81 /* Define this to use malloc/free with no freelist for all datatypes,
|
|
|
82 the hope being that some debugging tools may help detect
|
|
|
83 freed memory references */
|
|
|
84 #ifdef USE_DEBUG_MALLOC /* Taking the above comment at face value -slb */
|
|
|
85 #include <dmalloc.h>
|
|
|
86 #define ALLOC_NO_POOLS
|
|
|
87 #endif
|
|
|
88
|
|
|
89 #ifdef DEBUG_XEMACS
|
|
458
|
90 static Fixnum debug_allocation;
|
|
|
91 static Fixnum debug_allocation_backtrace_length;
|
|
428
|
92 #endif
|
|
|
93
|
|
|
94 /* Number of bytes of consing done since the last gc */
|
|
814
|
95 static EMACS_INT consing_since_gc;
|
|
1292
|
96 EMACS_UINT total_consing;
|
|
|
97
|
|
814
|
98 int need_to_garbage_collect;
|
|
851
|
99 int need_to_check_c_alloca;
|
|
887
|
100 int need_to_signal_post_gc;
|
|
851
|
101 int funcall_allocation_flag;
|
|
|
102 Bytecount __temp_alloca_size__;
|
|
|
103 Bytecount funcall_alloca_count;
|
|
814
|
104
|
|
|
105 /* Determine now whether we need to garbage collect or not, to make
|
|
|
106 Ffuncall() faster */
|
|
|
107 #define INCREMENT_CONS_COUNTER_1(size) \
|
|
|
108 do \
|
|
|
109 { \
|
|
|
110 consing_since_gc += (size); \
|
|
1292
|
111 total_consing += (size); \
|
|
|
112 if (profiling_active) \
|
|
|
113 profile_record_consing (size); \
|
|
814
|
114 recompute_need_to_garbage_collect (); \
|
|
|
115 } while (0)
|
|
428
|
116
|
|
|
117 #define debug_allocation_backtrace() \
|
|
|
118 do { \
|
|
|
119 if (debug_allocation_backtrace_length > 0) \
|
|
|
120 debug_short_backtrace (debug_allocation_backtrace_length); \
|
|
|
121 } while (0)
|
|
|
122
|
|
|
123 #ifdef DEBUG_XEMACS
|
|
801
|
124 #define INCREMENT_CONS_COUNTER(foosize, type) \
|
|
|
125 do { \
|
|
|
126 if (debug_allocation) \
|
|
|
127 { \
|
|
|
128 stderr_out ("allocating %s (size %ld)\n", type, \
|
|
|
129 (long) foosize); \
|
|
|
130 debug_allocation_backtrace (); \
|
|
|
131 } \
|
|
|
132 INCREMENT_CONS_COUNTER_1 (foosize); \
|
|
428
|
133 } while (0)
|
|
|
134 #define NOSEEUM_INCREMENT_CONS_COUNTER(foosize, type) \
|
|
|
135 do { \
|
|
|
136 if (debug_allocation > 1) \
|
|
|
137 { \
|
|
801
|
138 stderr_out ("allocating noseeum %s (size %ld)\n", type, \
|
|
|
139 (long) foosize); \
|
|
428
|
140 debug_allocation_backtrace (); \
|
|
|
141 } \
|
|
|
142 INCREMENT_CONS_COUNTER_1 (foosize); \
|
|
|
143 } while (0)
|
|
|
144 #else
|
|
|
145 #define INCREMENT_CONS_COUNTER(size, type) INCREMENT_CONS_COUNTER_1 (size)
|
|
|
146 #define NOSEEUM_INCREMENT_CONS_COUNTER(size, type) \
|
|
|
147 INCREMENT_CONS_COUNTER_1 (size)
|
|
|
148 #endif
|
|
|
149
|
|
|
150 #define DECREMENT_CONS_COUNTER(size) do { \
|
|
|
151 consing_since_gc -= (size); \
|
|
1292
|
152 total_consing -= (size); \
|
|
|
153 if (profiling_active) \
|
|
|
154 profile_record_unconsing (size); \
|
|
428
|
155 if (consing_since_gc < 0) \
|
|
|
156 consing_since_gc = 0; \
|
|
814
|
157 recompute_need_to_garbage_collect (); \
|
|
428
|
158 } while (0)
|
|
|
159
|
|
|
160 /* Number of bytes of consing since gc before another gc should be done. */
|
|
801
|
161 static EMACS_INT gc_cons_threshold;
|
|
|
162
|
|
|
163 /* Percentage of consing of total data size before another GC. */
|
|
|
164 static EMACS_INT gc_cons_percentage;
|
|
|
165
|
|
|
166 #ifdef ERROR_CHECK_GC
|
|
853
|
167 int always_gc; /* Debugging hack; equivalent to
|
|
|
168 (setq gc-cons-thresold -1) */
|
|
801
|
169 #else
|
|
|
170 #define always_gc 0
|
|
|
171 #endif
|
|
428
|
172
|
|
|
173 /* Nonzero during gc */
|
|
|
174 int gc_in_progress;
|
|
|
175
|
|
1154
|
176 /* Nonzero means display messages at beginning and end of GC. */
|
|
|
177
|
|
|
178 int garbage_collection_messages;
|
|
|
179
|
|
428
|
180 /* Number of times GC has happened at this level or below.
|
|
|
181 * Level 0 is most volatile, contrary to usual convention.
|
|
|
182 * (Of course, there's only one level at present) */
|
|
|
183 EMACS_INT gc_generation_number[1];
|
|
|
184
|
|
|
185 /* This is just for use by the printer, to allow things to print uniquely */
|
|
|
186 static int lrecord_uid_counter;
|
|
|
187
|
|
|
188 /* Nonzero when calling certain hooks or doing other things where
|
|
|
189 a GC would be bad */
|
|
1318
|
190 static int gc_currently_forbidden;
|
|
428
|
191
|
|
|
192 /* Hooks. */
|
|
|
193 Lisp_Object Vpre_gc_hook, Qpre_gc_hook;
|
|
|
194 Lisp_Object Vpost_gc_hook, Qpost_gc_hook;
|
|
|
195
|
|
|
196 /* "Garbage collecting" */
|
|
|
197 Lisp_Object Vgc_message;
|
|
|
198 Lisp_Object Vgc_pointer_glyph;
|
|
771
|
199 static const Char_ASCII gc_default_message[] = "Garbage collecting";
|
|
428
|
200 Lisp_Object Qgarbage_collecting;
|
|
|
201
|
|
1292
|
202 static Lisp_Object QSin_garbage_collection;
|
|
|
203
|
|
428
|
204 /* Non-zero means we're in the process of doing the dump */
|
|
|
205 int purify_flag;
|
|
|
206
|
|
1204
|
207 /* Non-zero means we're pdumping out or in */
|
|
|
208 #ifdef PDUMP
|
|
|
209 int in_pdump;
|
|
|
210 #endif
|
|
|
211
|
|
800
|
212 #ifdef ERROR_CHECK_TYPES
|
|
428
|
213
|
|
793
|
214 Error_Behavior ERROR_ME, ERROR_ME_NOT, ERROR_ME_WARN, ERROR_ME_DEBUG_WARN;
|
|
428
|
215
|
|
|
216 #endif
|
|
|
217
|
|
801
|
218 /* Very cheesy ways of figuring out how much memory is being used for
|
|
|
219 data. #### Need better (system-dependent) ways. */
|
|
|
220 void *minimum_address_seen;
|
|
|
221 void *maximum_address_seen;
|
|
|
222
|
|
428
|
223 int
|
|
|
224 c_readonly (Lisp_Object obj)
|
|
|
225 {
|
|
|
226 return POINTER_TYPE_P (XTYPE (obj)) && C_READONLY (obj);
|
|
|
227 }
|
|
|
228
|
|
|
229 int
|
|
|
230 lisp_readonly (Lisp_Object obj)
|
|
|
231 {
|
|
|
232 return POINTER_TYPE_P (XTYPE (obj)) && LISP_READONLY (obj);
|
|
|
233 }
|
|
|
234
|
|
|
235
|
|
|
236 /* Maximum amount of C stack to save when a GC happens. */
|
|
|
237
|
|
|
238 #ifndef MAX_SAVE_STACK
|
|
|
239 #define MAX_SAVE_STACK 0 /* 16000 */
|
|
|
240 #endif
|
|
|
241
|
|
|
242 /* Non-zero means ignore malloc warnings. Set during initialization. */
|
|
|
243 int ignore_malloc_warnings;
|
|
|
244
|
|
|
245
|
|
|
246 static void *breathing_space;
|
|
|
247
|
|
|
248 void
|
|
|
249 release_breathing_space (void)
|
|
|
250 {
|
|
|
251 if (breathing_space)
|
|
|
252 {
|
|
|
253 void *tmp = breathing_space;
|
|
|
254 breathing_space = 0;
|
|
|
255 xfree (tmp);
|
|
|
256 }
|
|
|
257 }
|
|
|
258
|
|
|
259 /* malloc calls this if it finds we are near exhausting storage */
|
|
|
260 void
|
|
442
|
261 malloc_warning (const char *str)
|
|
428
|
262 {
|
|
|
263 if (ignore_malloc_warnings)
|
|
|
264 return;
|
|
|
265
|
|
|
266 warn_when_safe
|
|
793
|
267 (Qmemory, Qemergency,
|
|
428
|
268 "%s\n"
|
|
|
269 "Killing some buffers may delay running out of memory.\n"
|
|
|
270 "However, certainly by the time you receive the 95%% warning,\n"
|
|
|
271 "you should clean up, kill this Emacs, and start a new one.",
|
|
|
272 str);
|
|
|
273 }
|
|
|
274
|
|
|
275 /* Called if malloc returns zero */
|
|
|
276 DOESNT_RETURN
|
|
|
277 memory_full (void)
|
|
|
278 {
|
|
|
279 /* Force a GC next time eval is called.
|
|
|
280 It's better to loop garbage-collecting (we might reclaim enough
|
|
|
281 to win) than to loop beeping and barfing "Memory exhausted"
|
|
|
282 */
|
|
|
283 consing_since_gc = gc_cons_threshold + 1;
|
|
814
|
284 recompute_need_to_garbage_collect ();
|
|
428
|
285 release_breathing_space ();
|
|
|
286
|
|
|
287 /* Flush some histories which might conceivably contain garbalogical
|
|
|
288 inhibitors. */
|
|
|
289 if (!NILP (Fboundp (Qvalues)))
|
|
|
290 Fset (Qvalues, Qnil);
|
|
|
291 Vcommand_history = Qnil;
|
|
|
292
|
|
563
|
293 out_of_memory ("Memory exhausted", Qunbound);
|
|
428
|
294 }
|
|
|
295
|
|
801
|
296 static void
|
|
|
297 set_alloc_mins_and_maxes (void *val, Bytecount size)
|
|
|
298 {
|
|
|
299 if (!val)
|
|
|
300 return;
|
|
|
301 if ((char *) val + size > (char *) maximum_address_seen)
|
|
|
302 maximum_address_seen = (char *) val + size;
|
|
|
303 if (!minimum_address_seen)
|
|
|
304 minimum_address_seen =
|
|
|
305 #if SIZEOF_VOID_P == 8
|
|
|
306 (void *) 0xFFFFFFFFFFFFFFFF;
|
|
|
307 #else
|
|
|
308 (void *) 0xFFFFFFFF;
|
|
|
309 #endif
|
|
|
310 if ((char *) val < (char *) minimum_address_seen)
|
|
|
311 minimum_address_seen = (char *) val;
|
|
|
312 }
|
|
|
313
|
|
|
314 /* like malloc and realloc but check for no memory left. */
|
|
428
|
315
|
|
1315
|
316 #ifdef ERROR_CHECK_MALLOC
|
|
1292
|
317 static int in_malloc;
|
|
1333
|
318 extern int regex_malloc_disallowed;
|
|
1315
|
319 #endif
|
|
1292
|
320
|
|
428
|
321 #undef xmalloc
|
|
|
322 void *
|
|
665
|
323 xmalloc (Bytecount size)
|
|
428
|
324 {
|
|
1292
|
325 void *val;
|
|
|
326 #ifdef ERROR_CHECK_MALLOC
|
|
|
327 assert (!in_malloc);
|
|
1333
|
328 assert (!regex_malloc_disallowed);
|
|
1292
|
329 in_malloc = 1;
|
|
|
330 #endif
|
|
|
331 val = malloc (size);
|
|
|
332 #ifdef ERROR_CHECK_MALLOC
|
|
|
333 in_malloc = 0;
|
|
|
334 #endif
|
|
428
|
335 if (!val && (size != 0)) memory_full ();
|
|
801
|
336 set_alloc_mins_and_maxes (val, size);
|
|
428
|
337 return val;
|
|
|
338 }
|
|
|
339
|
|
|
340 #undef xcalloc
|
|
|
341 static void *
|
|
665
|
342 xcalloc (Elemcount nelem, Bytecount elsize)
|
|
428
|
343 {
|
|
1292
|
344 void *val;
|
|
|
345 #ifdef ERROR_CHECK_MALLOC
|
|
|
346 assert (!in_malloc);
|
|
1333
|
347 assert (!regex_malloc_disallowed);
|
|
1292
|
348 in_malloc = 1;
|
|
|
349 #endif
|
|
|
350 val= calloc (nelem, elsize);
|
|
|
351 #ifdef ERROR_CHECK_MALLOC
|
|
|
352 in_malloc = 0;
|
|
|
353 #endif
|
|
428
|
354
|
|
|
355 if (!val && (nelem != 0)) memory_full ();
|
|
801
|
356 set_alloc_mins_and_maxes (val, nelem * elsize);
|
|
428
|
357 return val;
|
|
|
358 }
|
|
|
359
|
|
|
360 void *
|
|
665
|
361 xmalloc_and_zero (Bytecount size)
|
|
428
|
362 {
|
|
|
363 return xcalloc (size, sizeof (char));
|
|
|
364 }
|
|
|
365
|
|
|
366 #undef xrealloc
|
|
|
367 void *
|
|
665
|
368 xrealloc (void *block, Bytecount size)
|
|
428
|
369 {
|
|
1292
|
370 #ifdef ERROR_CHECK_MALLOC
|
|
|
371 assert (!in_malloc);
|
|
1333
|
372 assert (!regex_malloc_disallowed);
|
|
1292
|
373 in_malloc = 1;
|
|
|
374 #endif
|
|
551
|
375 block = realloc (block, size);
|
|
1292
|
376 #ifdef ERROR_CHECK_MALLOC
|
|
|
377 in_malloc = 0;
|
|
|
378 #endif
|
|
551
|
379
|
|
|
380 if (!block && (size != 0)) memory_full ();
|
|
801
|
381 set_alloc_mins_and_maxes (block, size);
|
|
551
|
382 return block;
|
|
428
|
383 }
|
|
|
384
|
|
|
385 void
|
|
|
386 #ifdef ERROR_CHECK_MALLOC
|
|
|
387 xfree_1 (void *block)
|
|
|
388 #else
|
|
|
389 xfree (void *block)
|
|
|
390 #endif
|
|
|
391 {
|
|
|
392 #ifdef ERROR_CHECK_MALLOC
|
|
|
393 /* Unbelievably, calling free() on 0xDEADBEEF doesn't cause an
|
|
|
394 error until much later on for many system mallocs, such as
|
|
|
395 the one that comes with Solaris 2.3. FMH!! */
|
|
|
396 assert (block != (void *) 0xDEADBEEF);
|
|
|
397 assert (block);
|
|
1292
|
398 assert (!in_malloc);
|
|
1333
|
399 assert (!regex_malloc_disallowed);
|
|
1292
|
400 in_malloc = 1;
|
|
428
|
401 #endif /* ERROR_CHECK_MALLOC */
|
|
|
402 free (block);
|
|
1292
|
403 #ifdef ERROR_CHECK_MALLOC
|
|
|
404 in_malloc = 0;
|
|
|
405 #endif
|
|
428
|
406 }
|
|
|
407
|
|
|
408 #ifdef ERROR_CHECK_GC
|
|
|
409
|
|
|
410 static void
|
|
665
|
411 deadbeef_memory (void *ptr, Bytecount size)
|
|
428
|
412 {
|
|
826
|
413 UINT_32_BIT *ptr4 = (UINT_32_BIT *) ptr;
|
|
665
|
414 Bytecount beefs = size >> 2;
|
|
428
|
415
|
|
|
416 /* In practice, size will always be a multiple of four. */
|
|
|
417 while (beefs--)
|
|
1204
|
418 (*ptr4++) = 0xDEADBEEF; /* -559038737 base 10 */
|
|
428
|
419 }
|
|
|
420
|
|
|
421 #else /* !ERROR_CHECK_GC */
|
|
|
422
|
|
|
423
|
|
|
424 #define deadbeef_memory(ptr, size)
|
|
|
425
|
|
|
426 #endif /* !ERROR_CHECK_GC */
|
|
|
427
|
|
|
428 #undef xstrdup
|
|
|
429 char *
|
|
442
|
430 xstrdup (const char *str)
|
|
428
|
431 {
|
|
|
432 int len = strlen (str) + 1; /* for stupid terminating 0 */
|
|
|
433 void *val = xmalloc (len);
|
|
771
|
434
|
|
428
|
435 if (val == 0) return 0;
|
|
|
436 return (char *) memcpy (val, str, len);
|
|
|
437 }
|
|
|
438
|
|
|
439 #ifdef NEED_STRDUP
|
|
|
440 char *
|
|
442
|
441 strdup (const char *s)
|
|
428
|
442 {
|
|
|
443 return xstrdup (s);
|
|
|
444 }
|
|
|
445 #endif /* NEED_STRDUP */
|
|
|
446
|
|
|
447
|
|
|
448 static void *
|
|
665
|
449 allocate_lisp_storage (Bytecount size)
|
|
428
|
450 {
|
|
793
|
451 void *val = xmalloc (size);
|
|
|
452 /* We don't increment the cons counter anymore. Calling functions do
|
|
|
453 that now because we have two different kinds of cons counters -- one
|
|
|
454 for normal objects, and one for no-see-um conses (and possibly others
|
|
|
455 similar) where the conses are used totally internally, never escape,
|
|
|
456 and are created and then freed and shouldn't logically increment the
|
|
|
457 cons counting. #### (Or perhaps, we should decrement it when an object
|
|
|
458 get freed?) */
|
|
|
459
|
|
|
460 /* But we do now (as of 3-27-02) go and zero out the memory. This is a
|
|
|
461 good thing, as it will guarantee we won't get any intermittent bugs
|
|
1204
|
462 coming from an uninitiated field. The speed loss is unnoticeable,
|
|
|
463 esp. as the objects are not large -- large stuff like buffer text and
|
|
|
464 redisplay structures are allocated separately. */
|
|
793
|
465 memset (val, 0, size);
|
|
851
|
466
|
|
|
467 if (need_to_check_c_alloca)
|
|
|
468 xemacs_c_alloca (0);
|
|
|
469
|
|
793
|
470 return val;
|
|
428
|
471 }
|
|
|
472
|
|
|
473
|
|
442
|
474 /* lcrecords are chained together through their "next" field.
|
|
|
475 After doing the mark phase, GC will walk this linked list
|
|
|
476 and free any lcrecord which hasn't been marked. */
|
|
428
|
477 static struct lcrecord_header *all_lcrecords;
|
|
|
478
|
|
1204
|
479 /* The most basic of the lcrecord allocation functions. Not usually called
|
|
|
480 directly. Allocates an lrecord not managed by any lcrecord-list, of a
|
|
|
481 specified size. See lrecord.h. */
|
|
|
482
|
|
428
|
483 void *
|
|
1204
|
484 basic_alloc_lcrecord (Bytecount size,
|
|
|
485 const struct lrecord_implementation *implementation)
|
|
428
|
486 {
|
|
|
487 struct lcrecord_header *lcheader;
|
|
|
488
|
|
442
|
489 type_checking_assert
|
|
|
490 ((implementation->static_size == 0 ?
|
|
|
491 implementation->size_in_bytes_method != NULL :
|
|
|
492 implementation->static_size == size)
|
|
|
493 &&
|
|
|
494 (! implementation->basic_p)
|
|
|
495 &&
|
|
|
496 (! (implementation->hash == NULL && implementation->equal != NULL)));
|
|
428
|
497
|
|
|
498 lcheader = (struct lcrecord_header *) allocate_lisp_storage (size);
|
|
442
|
499 set_lheader_implementation (&lcheader->lheader, implementation);
|
|
428
|
500 lcheader->next = all_lcrecords;
|
|
|
501 #if 1 /* mly prefers to see small ID numbers */
|
|
|
502 lcheader->uid = lrecord_uid_counter++;
|
|
|
503 #else /* jwz prefers to see real addrs */
|
|
|
504 lcheader->uid = (int) &lcheader;
|
|
|
505 #endif
|
|
|
506 lcheader->free = 0;
|
|
|
507 all_lcrecords = lcheader;
|
|
|
508 INCREMENT_CONS_COUNTER (size, implementation->name);
|
|
|
509 return lcheader;
|
|
|
510 }
|
|
|
511
|
|
|
512 #if 0 /* Presently unused */
|
|
|
513 /* Very, very poor man's EGC?
|
|
|
514 * This may be slow and thrash pages all over the place.
|
|
|
515 * Only call it if you really feel you must (and if the
|
|
|
516 * lrecord was fairly recently allocated).
|
|
|
517 * Otherwise, just let the GC do its job -- that's what it's there for
|
|
|
518 */
|
|
|
519 void
|
|
771
|
520 very_old_free_lcrecord (struct lcrecord_header *lcrecord)
|
|
428
|
521 {
|
|
|
522 if (all_lcrecords == lcrecord)
|
|
|
523 {
|
|
|
524 all_lcrecords = lcrecord->next;
|
|
|
525 }
|
|
|
526 else
|
|
|
527 {
|
|
|
528 struct lrecord_header *header = all_lcrecords;
|
|
|
529 for (;;)
|
|
|
530 {
|
|
|
531 struct lrecord_header *next = header->next;
|
|
|
532 if (next == lcrecord)
|
|
|
533 {
|
|
|
534 header->next = lrecord->next;
|
|
|
535 break;
|
|
|
536 }
|
|
|
537 else if (next == 0)
|
|
|
538 abort ();
|
|
|
539 else
|
|
|
540 header = next;
|
|
|
541 }
|
|
|
542 }
|
|
|
543 if (lrecord->implementation->finalizer)
|
|
|
544 lrecord->implementation->finalizer (lrecord, 0);
|
|
|
545 xfree (lrecord);
|
|
|
546 return;
|
|
|
547 }
|
|
|
548 #endif /* Unused */
|
|
|
549
|
|
|
550
|
|
|
551 static void
|
|
|
552 disksave_object_finalization_1 (void)
|
|
|
553 {
|
|
|
554 struct lcrecord_header *header;
|
|
|
555
|
|
|
556 for (header = all_lcrecords; header; header = header->next)
|
|
|
557 {
|
|
442
|
558 if (LHEADER_IMPLEMENTATION (&header->lheader)->finalizer &&
|
|
428
|
559 !header->free)
|
|
442
|
560 LHEADER_IMPLEMENTATION (&header->lheader)->finalizer (header, 1);
|
|
428
|
561 }
|
|
|
562 }
|
|
|
563
|
|
1204
|
564 /* Bitwise copy all parts of a Lisp object other than the header */
|
|
|
565
|
|
|
566 void
|
|
|
567 copy_lisp_object (Lisp_Object dst, Lisp_Object src)
|
|
|
568 {
|
|
|
569 const struct lrecord_implementation *imp =
|
|
|
570 XRECORD_LHEADER_IMPLEMENTATION (src);
|
|
|
571 Bytecount size = lisp_object_size (src);
|
|
|
572
|
|
|
573 assert (imp == XRECORD_LHEADER_IMPLEMENTATION (dst));
|
|
|
574 assert (size == lisp_object_size (dst));
|
|
|
575
|
|
|
576 if (imp->basic_p)
|
|
|
577 memcpy ((char *) XRECORD_LHEADER (dst) + sizeof (struct lrecord_header),
|
|
|
578 (char *) XRECORD_LHEADER (src) + sizeof (struct lrecord_header),
|
|
|
579 size - sizeof (struct lrecord_header));
|
|
|
580 else
|
|
|
581 memcpy ((char *) XRECORD_LHEADER (dst) + sizeof (struct lcrecord_header),
|
|
|
582 (char *) XRECORD_LHEADER (src) + sizeof (struct lcrecord_header),
|
|
|
583 size - sizeof (struct lcrecord_header));
|
|
|
584 }
|
|
|
585
|
|
428
|
586
|
|
|
587 /************************************************************************/
|
|
|
588 /* Debugger support */
|
|
|
589 /************************************************************************/
|
|
|
590 /* Give gdb/dbx enough information to decode Lisp Objects. We make
|
|
|
591 sure certain symbols are always defined, so gdb doesn't complain
|
|
438
|
592 about expressions in src/.gdbinit. See src/.gdbinit or src/.dbxrc
|
|
|
593 to see how this is used. */
|
|
428
|
594
|
|
458
|
595 EMACS_UINT dbg_valmask = ((1UL << VALBITS) - 1) << GCBITS;
|
|
|
596 EMACS_UINT dbg_typemask = (1UL << GCTYPEBITS) - 1;
|
|
428
|
597
|
|
|
598 #ifdef USE_UNION_TYPE
|
|
458
|
599 unsigned char dbg_USE_UNION_TYPE = 1;
|
|
428
|
600 #else
|
|
458
|
601 unsigned char dbg_USE_UNION_TYPE = 0;
|
|
428
|
602 #endif
|
|
|
603
|
|
458
|
604 unsigned char dbg_valbits = VALBITS;
|
|
|
605 unsigned char dbg_gctypebits = GCTYPEBITS;
|
|
|
606
|
|
|
607 /* On some systems, the above definitions will be optimized away by
|
|
|
608 the compiler or linker unless they are referenced in some function. */
|
|
|
609 long dbg_inhibit_dbg_symbol_deletion (void);
|
|
|
610 long
|
|
|
611 dbg_inhibit_dbg_symbol_deletion (void)
|
|
|
612 {
|
|
|
613 return
|
|
|
614 (dbg_valmask +
|
|
|
615 dbg_typemask +
|
|
|
616 dbg_USE_UNION_TYPE +
|
|
|
617 dbg_valbits +
|
|
|
618 dbg_gctypebits);
|
|
|
619 }
|
|
428
|
620
|
|
|
621 /* Macros turned into functions for ease of debugging.
|
|
|
622 Debuggers don't know about macros! */
|
|
|
623 int dbg_eq (Lisp_Object obj1, Lisp_Object obj2);
|
|
|
624 int
|
|
|
625 dbg_eq (Lisp_Object obj1, Lisp_Object obj2)
|
|
|
626 {
|
|
|
627 return EQ (obj1, obj2);
|
|
|
628 }
|
|
|
629
|
|
|
630
|
|
|
631 /************************************************************************/
|
|
|
632 /* Fixed-size type macros */
|
|
|
633 /************************************************************************/
|
|
|
634
|
|
|
635 /* For fixed-size types that are commonly used, we malloc() large blocks
|
|
|
636 of memory at a time and subdivide them into chunks of the correct
|
|
|
637 size for an object of that type. This is more efficient than
|
|
|
638 malloc()ing each object separately because we save on malloc() time
|
|
|
639 and overhead due to the fewer number of malloc()ed blocks, and
|
|
|
640 also because we don't need any extra pointers within each object
|
|
|
641 to keep them threaded together for GC purposes. For less common
|
|
|
642 (and frequently large-size) types, we use lcrecords, which are
|
|
|
643 malloc()ed individually and chained together through a pointer
|
|
|
644 in the lcrecord header. lcrecords do not need to be fixed-size
|
|
|
645 (i.e. two objects of the same type need not have the same size;
|
|
|
646 however, the size of a particular object cannot vary dynamically).
|
|
|
647 It is also much easier to create a new lcrecord type because no
|
|
|
648 additional code needs to be added to alloc.c. Finally, lcrecords
|
|
|
649 may be more efficient when there are only a small number of them.
|
|
|
650
|
|
|
651 The types that are stored in these large blocks (or "frob blocks")
|
|
|
652 are cons, float, compiled-function, symbol, marker, extent, event,
|
|
|
653 and string.
|
|
|
654
|
|
|
655 Note that strings are special in that they are actually stored in
|
|
|
656 two parts: a structure containing information about the string, and
|
|
|
657 the actual data associated with the string. The former structure
|
|
|
658 (a struct Lisp_String) is a fixed-size structure and is managed the
|
|
|
659 same way as all the other such types. This structure contains a
|
|
|
660 pointer to the actual string data, which is stored in structures of
|
|
|
661 type struct string_chars_block. Each string_chars_block consists
|
|
|
662 of a pointer to a struct Lisp_String, followed by the data for that
|
|
440
|
663 string, followed by another pointer to a Lisp_String, followed by
|
|
|
664 the data for that string, etc. At GC time, the data in these
|
|
|
665 blocks is compacted by searching sequentially through all the
|
|
428
|
666 blocks and compressing out any holes created by unmarked strings.
|
|
|
667 Strings that are more than a certain size (bigger than the size of
|
|
|
668 a string_chars_block, although something like half as big might
|
|
|
669 make more sense) are malloc()ed separately and not stored in
|
|
|
670 string_chars_blocks. Furthermore, no one string stretches across
|
|
|
671 two string_chars_blocks.
|
|
|
672
|
|
1204
|
673 Vectors are each malloc()ed separately as lcrecords.
|
|
428
|
674
|
|
|
675 In the following discussion, we use conses, but it applies equally
|
|
|
676 well to the other fixed-size types.
|
|
|
677
|
|
|
678 We store cons cells inside of cons_blocks, allocating a new
|
|
|
679 cons_block with malloc() whenever necessary. Cons cells reclaimed
|
|
|
680 by GC are put on a free list to be reallocated before allocating
|
|
|
681 any new cons cells from the latest cons_block. Each cons_block is
|
|
|
682 just under 2^n - MALLOC_OVERHEAD bytes long, since malloc (at least
|
|
|
683 the versions in malloc.c and gmalloc.c) really allocates in units
|
|
|
684 of powers of two and uses 4 bytes for its own overhead.
|
|
|
685
|
|
|
686 What GC actually does is to search through all the cons_blocks,
|
|
|
687 from the most recently allocated to the oldest, and put all
|
|
|
688 cons cells that are not marked (whether or not they're already
|
|
|
689 free) on a cons_free_list. The cons_free_list is a stack, and
|
|
|
690 so the cons cells in the oldest-allocated cons_block end up
|
|
|
691 at the head of the stack and are the first to be reallocated.
|
|
|
692 If any cons_block is entirely free, it is freed with free()
|
|
|
693 and its cons cells removed from the cons_free_list. Because
|
|
|
694 the cons_free_list ends up basically in memory order, we have
|
|
|
695 a high locality of reference (assuming a reasonable turnover
|
|
|
696 of allocating and freeing) and have a reasonable probability
|
|
|
697 of entirely freeing up cons_blocks that have been more recently
|
|
|
698 allocated. This stage is called the "sweep stage" of GC, and
|
|
|
699 is executed after the "mark stage", which involves starting
|
|
|
700 from all places that are known to point to in-use Lisp objects
|
|
|
701 (e.g. the obarray, where are all symbols are stored; the
|
|
|
702 current catches and condition-cases; the backtrace list of
|
|
|
703 currently executing functions; the gcpro list; etc.) and
|
|
|
704 recursively marking all objects that are accessible.
|
|
|
705
|
|
454
|
706 At the beginning of the sweep stage, the conses in the cons blocks
|
|
|
707 are in one of three states: in use and marked, in use but not
|
|
|
708 marked, and not in use (already freed). Any conses that are marked
|
|
|
709 have been marked in the mark stage just executed, because as part
|
|
|
710 of the sweep stage we unmark any marked objects. The way we tell
|
|
|
711 whether or not a cons cell is in use is through the LRECORD_FREE_P
|
|
|
712 macro. This uses a special lrecord type `lrecord_type_free',
|
|
|
713 which is never associated with any valid object.
|
|
|
714
|
|
|
715 Conses on the free_cons_list are threaded through a pointer stored
|
|
|
716 in the conses themselves. Because the cons is still in a
|
|
|
717 cons_block and needs to remain marked as not in use for the next
|
|
|
718 time that GC happens, we need room to store both the "free"
|
|
|
719 indicator and the chaining pointer. So this pointer is stored
|
|
|
720 after the lrecord header (actually where C places a pointer after
|
|
|
721 the lrecord header; they are not necessarily contiguous). This
|
|
|
722 implies that all fixed-size types must be big enough to contain at
|
|
|
723 least one pointer. This is true for all current fixed-size types,
|
|
|
724 with the possible exception of Lisp_Floats, for which we define the
|
|
|
725 meat of the struct using a union of a pointer and a double to
|
|
|
726 ensure adequate space for the free list chain pointer.
|
|
428
|
727
|
|
|
728 Some types of objects need additional "finalization" done
|
|
|
729 when an object is converted from in use to not in use;
|
|
|
730 this is the purpose of the ADDITIONAL_FREE_type macro.
|
|
|
731 For example, markers need to be removed from the chain
|
|
|
732 of markers that is kept in each buffer. This is because
|
|
|
733 markers in a buffer automatically disappear if the marker
|
|
|
734 is no longer referenced anywhere (the same does not
|
|
|
735 apply to extents, however).
|
|
|
736
|
|
|
737 WARNING: Things are in an extremely bizarre state when
|
|
|
738 the ADDITIONAL_FREE_type macros are called, so beware!
|
|
|
739
|
|
454
|
740 When ERROR_CHECK_GC is defined, we do things differently so as to
|
|
|
741 maximize our chances of catching places where there is insufficient
|
|
|
742 GCPROing. The thing we want to avoid is having an object that
|
|
|
743 we're using but didn't GCPRO get freed by GC and then reallocated
|
|
|
744 while we're in the process of using it -- this will result in
|
|
|
745 something seemingly unrelated getting trashed, and is extremely
|
|
|
746 difficult to track down. If the object gets freed but not
|
|
|
747 reallocated, we can usually catch this because we set most of the
|
|
|
748 bytes of a freed object to 0xDEADBEEF. (The lisp object type is set
|
|
|
749 to the invalid type `lrecord_type_free', however, and a pointer
|
|
|
750 used to chain freed objects together is stored after the lrecord
|
|
|
751 header; we play some tricks with this pointer to make it more
|
|
428
|
752 bogus, so crashes are more likely to occur right away.)
|
|
|
753
|
|
|
754 We want freed objects to stay free as long as possible,
|
|
|
755 so instead of doing what we do above, we maintain the
|
|
|
756 free objects in a first-in first-out queue. We also
|
|
|
757 don't recompute the free list each GC, unlike above;
|
|
|
758 this ensures that the queue ordering is preserved.
|
|
|
759 [This means that we are likely to have worse locality
|
|
|
760 of reference, and that we can never free a frob block
|
|
|
761 once it's allocated. (Even if we know that all cells
|
|
|
762 in it are free, there's no easy way to remove all those
|
|
|
763 cells from the free list because the objects on the
|
|
|
764 free list are unlikely to be in memory order.)]
|
|
|
765 Furthermore, we never take objects off the free list
|
|
|
766 unless there's a large number (usually 1000, but
|
|
|
767 varies depending on type) of them already on the list.
|
|
|
768 This way, we ensure that an object that gets freed will
|
|
|
769 remain free for the next 1000 (or whatever) times that
|
|
440
|
770 an object of that type is allocated. */
|
|
428
|
771
|
|
|
772 #ifndef MALLOC_OVERHEAD
|
|
|
773 #ifdef GNU_MALLOC
|
|
|
774 #define MALLOC_OVERHEAD 0
|
|
|
775 #elif defined (rcheck)
|
|
|
776 #define MALLOC_OVERHEAD 20
|
|
|
777 #else
|
|
|
778 #define MALLOC_OVERHEAD 8
|
|
|
779 #endif
|
|
|
780 #endif /* MALLOC_OVERHEAD */
|
|
|
781
|
|
|
782 #if !defined(HAVE_MMAP) || defined(DOUG_LEA_MALLOC)
|
|
|
783 /* If we released our reserve (due to running out of memory),
|
|
|
784 and we have a fair amount free once again,
|
|
|
785 try to set aside another reserve in case we run out once more.
|
|
|
786
|
|
|
787 This is called when a relocatable block is freed in ralloc.c. */
|
|
|
788 void refill_memory_reserve (void);
|
|
|
789 void
|
|
442
|
790 refill_memory_reserve (void)
|
|
428
|
791 {
|
|
|
792 if (breathing_space == 0)
|
|
|
793 breathing_space = (char *) malloc (4096 - MALLOC_OVERHEAD);
|
|
|
794 }
|
|
|
795 #endif
|
|
|
796
|
|
|
797 #ifdef ALLOC_NO_POOLS
|
|
|
798 # define TYPE_ALLOC_SIZE(type, structtype) 1
|
|
|
799 #else
|
|
|
800 # define TYPE_ALLOC_SIZE(type, structtype) \
|
|
|
801 ((2048 - MALLOC_OVERHEAD - sizeof (struct type##_block *)) \
|
|
|
802 / sizeof (structtype))
|
|
|
803 #endif /* ALLOC_NO_POOLS */
|
|
|
804
|
|
|
805 #define DECLARE_FIXED_TYPE_ALLOC(type, structtype) \
|
|
|
806 \
|
|
|
807 struct type##_block \
|
|
|
808 { \
|
|
|
809 struct type##_block *prev; \
|
|
|
810 structtype block[TYPE_ALLOC_SIZE (type, structtype)]; \
|
|
|
811 }; \
|
|
|
812 \
|
|
|
813 static struct type##_block *current_##type##_block; \
|
|
|
814 static int current_##type##_block_index; \
|
|
|
815 \
|
|
454
|
816 static Lisp_Free *type##_free_list; \
|
|
|
817 static Lisp_Free *type##_free_list_tail; \
|
|
428
|
818 \
|
|
|
819 static void \
|
|
|
820 init_##type##_alloc (void) \
|
|
|
821 { \
|
|
|
822 current_##type##_block = 0; \
|
|
|
823 current_##type##_block_index = \
|
|
|
824 countof (current_##type##_block->block); \
|
|
|
825 type##_free_list = 0; \
|
|
|
826 type##_free_list_tail = 0; \
|
|
|
827 } \
|
|
|
828 \
|
|
|
829 static int gc_count_num_##type##_in_use; \
|
|
|
830 static int gc_count_num_##type##_freelist
|
|
|
831
|
|
|
832 #define ALLOCATE_FIXED_TYPE_FROM_BLOCK(type, result) do { \
|
|
|
833 if (current_##type##_block_index \
|
|
|
834 == countof (current_##type##_block->block)) \
|
|
|
835 { \
|
|
|
836 struct type##_block *AFTFB_new = (struct type##_block *) \
|
|
|
837 allocate_lisp_storage (sizeof (struct type##_block)); \
|
|
|
838 AFTFB_new->prev = current_##type##_block; \
|
|
|
839 current_##type##_block = AFTFB_new; \
|
|
|
840 current_##type##_block_index = 0; \
|
|
|
841 } \
|
|
|
842 (result) = \
|
|
|
843 &(current_##type##_block->block[current_##type##_block_index++]); \
|
|
|
844 } while (0)
|
|
|
845
|
|
|
846 /* Allocate an instance of a type that is stored in blocks.
|
|
|
847 TYPE is the "name" of the type, STRUCTTYPE is the corresponding
|
|
|
848 structure type. */
|
|
|
849
|
|
|
850 #ifdef ERROR_CHECK_GC
|
|
|
851
|
|
|
852 /* Note: if you get crashes in this function, suspect incorrect calls
|
|
|
853 to free_cons() and friends. This happened once because the cons
|
|
|
854 cell was not GC-protected and was getting collected before
|
|
|
855 free_cons() was called. */
|
|
|
856
|
|
454
|
857 #define ALLOCATE_FIXED_TYPE_1(type, structtype, result) do { \
|
|
|
858 if (gc_count_num_##type##_freelist > \
|
|
|
859 MINIMUM_ALLOWED_FIXED_TYPE_CELLS_##type) \
|
|
|
860 { \
|
|
|
861 result = (structtype *) type##_free_list; \
|
|
1204
|
862 assert (LRECORD_FREE_P (result)); \
|
|
|
863 /* Before actually using the chain pointer, we complement \
|
|
|
864 all its bits; see PUT_FIXED_TYPE_ON_FREE_LIST(). */ \
|
|
454
|
865 type##_free_list = (Lisp_Free *) \
|
|
|
866 (~ (EMACS_UINT) (type##_free_list->chain)); \
|
|
|
867 gc_count_num_##type##_freelist--; \
|
|
|
868 } \
|
|
|
869 else \
|
|
|
870 ALLOCATE_FIXED_TYPE_FROM_BLOCK (type, result); \
|
|
|
871 MARK_LRECORD_AS_NOT_FREE (result); \
|
|
428
|
872 } while (0)
|
|
|
873
|
|
|
874 #else /* !ERROR_CHECK_GC */
|
|
|
875
|
|
454
|
876 #define ALLOCATE_FIXED_TYPE_1(type, structtype, result) do { \
|
|
428
|
877 if (type##_free_list) \
|
|
|
878 { \
|
|
454
|
879 result = (structtype *) type##_free_list; \
|
|
|
880 type##_free_list = type##_free_list->chain; \
|
|
428
|
881 } \
|
|
|
882 else \
|
|
|
883 ALLOCATE_FIXED_TYPE_FROM_BLOCK (type, result); \
|
|
454
|
884 MARK_LRECORD_AS_NOT_FREE (result); \
|
|
428
|
885 } while (0)
|
|
|
886
|
|
|
887 #endif /* !ERROR_CHECK_GC */
|
|
|
888
|
|
454
|
889
|
|
428
|
890 #define ALLOCATE_FIXED_TYPE(type, structtype, result) \
|
|
|
891 do \
|
|
|
892 { \
|
|
|
893 ALLOCATE_FIXED_TYPE_1 (type, structtype, result); \
|
|
|
894 INCREMENT_CONS_COUNTER (sizeof (structtype), #type); \
|
|
|
895 } while (0)
|
|
|
896
|
|
|
897 #define NOSEEUM_ALLOCATE_FIXED_TYPE(type, structtype, result) \
|
|
|
898 do \
|
|
|
899 { \
|
|
|
900 ALLOCATE_FIXED_TYPE_1 (type, structtype, result); \
|
|
|
901 NOSEEUM_INCREMENT_CONS_COUNTER (sizeof (structtype), #type); \
|
|
|
902 } while (0)
|
|
|
903
|
|
454
|
904
|
|
|
905 /* Lisp_Free is the type to represent a free list member inside a frob
|
|
|
906 block of any lisp object type. */
|
|
|
907 typedef struct Lisp_Free
|
|
|
908 {
|
|
|
909 struct lrecord_header lheader;
|
|
|
910 struct Lisp_Free *chain;
|
|
|
911 } Lisp_Free;
|
|
|
912
|
|
|
913 #define LRECORD_FREE_P(ptr) \
|
|
771
|
914 (((struct lrecord_header *) ptr)->type == lrecord_type_free)
|
|
454
|
915
|
|
|
916 #define MARK_LRECORD_AS_FREE(ptr) \
|
|
771
|
917 ((void) (((struct lrecord_header *) ptr)->type = lrecord_type_free))
|
|
454
|
918
|
|
|
919 #ifdef ERROR_CHECK_GC
|
|
|
920 #define MARK_LRECORD_AS_NOT_FREE(ptr) \
|
|
771
|
921 ((void) (((struct lrecord_header *) ptr)->type = lrecord_type_undefined))
|
|
428
|
922 #else
|
|
454
|
923 #define MARK_LRECORD_AS_NOT_FREE(ptr) DO_NOTHING
|
|
428
|
924 #endif
|
|
|
925
|
|
|
926 #ifdef ERROR_CHECK_GC
|
|
|
927
|
|
454
|
928 #define PUT_FIXED_TYPE_ON_FREE_LIST(type, structtype, ptr) do { \
|
|
|
929 if (type##_free_list_tail) \
|
|
|
930 { \
|
|
|
931 /* When we store the chain pointer, we complement all \
|
|
|
932 its bits; this should significantly increase its \
|
|
|
933 bogosity in case someone tries to use the value, and \
|
|
|
934 should make us crash faster if someone overwrites the \
|
|
|
935 pointer because when it gets un-complemented in \
|
|
|
936 ALLOCATED_FIXED_TYPE(), the resulting pointer will be \
|
|
|
937 extremely bogus. */ \
|
|
|
938 type##_free_list_tail->chain = \
|
|
|
939 (Lisp_Free *) ~ (EMACS_UINT) (ptr); \
|
|
|
940 } \
|
|
|
941 else \
|
|
|
942 type##_free_list = (Lisp_Free *) (ptr); \
|
|
|
943 type##_free_list_tail = (Lisp_Free *) (ptr); \
|
|
|
944 } while (0)
|
|
428
|
945
|
|
|
946 #else /* !ERROR_CHECK_GC */
|
|
|
947
|
|
454
|
948 #define PUT_FIXED_TYPE_ON_FREE_LIST(type, structtype, ptr) do { \
|
|
|
949 ((Lisp_Free *) (ptr))->chain = type##_free_list; \
|
|
|
950 type##_free_list = (Lisp_Free *) (ptr); \
|
|
|
951 } while (0) \
|
|
428
|
952
|
|
|
953 #endif /* !ERROR_CHECK_GC */
|
|
|
954
|
|
|
955 /* TYPE and STRUCTTYPE are the same as in ALLOCATE_FIXED_TYPE(). */
|
|
|
956
|
|
|
957 #define FREE_FIXED_TYPE(type, structtype, ptr) do { \
|
|
|
958 structtype *FFT_ptr = (ptr); \
|
|
1204
|
959 gc_checking_assert (!LRECORD_FREE_P (FFT_ptr)); \
|
|
428
|
960 ADDITIONAL_FREE_##type (FFT_ptr); \
|
|
|
961 deadbeef_memory (FFT_ptr, sizeof (structtype)); \
|
|
|
962 PUT_FIXED_TYPE_ON_FREE_LIST (type, structtype, FFT_ptr); \
|
|
454
|
963 MARK_LRECORD_AS_FREE (FFT_ptr); \
|
|
428
|
964 } while (0)
|
|
|
965
|
|
|
966 /* Like FREE_FIXED_TYPE() but used when we are explicitly
|
|
|
967 freeing a structure through free_cons(), free_marker(), etc.
|
|
|
968 rather than through the normal process of sweeping.
|
|
|
969 We attempt to undo the changes made to the allocation counters
|
|
|
970 as a result of this structure being allocated. This is not
|
|
|
971 completely necessary but helps keep things saner: e.g. this way,
|
|
|
972 repeatedly allocating and freeing a cons will not result in
|
|
|
973 the consing-since-gc counter advancing, which would cause a GC
|
|
1204
|
974 and somewhat defeat the purpose of explicitly freeing.
|
|
|
975
|
|
|
976 We also disable this mechanism entirely when ALLOC_NO_POOLS is
|
|
|
977 set, which is used for Purify and the like. */
|
|
|
978
|
|
|
979 #ifndef ALLOC_NO_POOLS
|
|
428
|
980 #define FREE_FIXED_TYPE_WHEN_NOT_IN_GC(type, structtype, ptr) \
|
|
|
981 do { FREE_FIXED_TYPE (type, structtype, ptr); \
|
|
|
982 DECREMENT_CONS_COUNTER (sizeof (structtype)); \
|
|
|
983 gc_count_num_##type##_freelist++; \
|
|
|
984 } while (0)
|
|
1204
|
985 #else
|
|
|
986 #define FREE_FIXED_TYPE_WHEN_NOT_IN_GC(type, structtype, ptr)
|
|
|
987 #endif
|
|
428
|
988
|
|
|
989
|
|
|
990
|
|
|
991 /************************************************************************/
|
|
|
992 /* Cons allocation */
|
|
|
993 /************************************************************************/
|
|
|
994
|
|
440
|
995 DECLARE_FIXED_TYPE_ALLOC (cons, Lisp_Cons);
|
|
428
|
996 /* conses are used and freed so often that we set this really high */
|
|
|
997 /* #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_cons 20000 */
|
|
|
998 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_cons 2000
|
|
|
999
|
|
|
1000 static Lisp_Object
|
|
|
1001 mark_cons (Lisp_Object obj)
|
|
|
1002 {
|
|
|
1003 if (NILP (XCDR (obj)))
|
|
|
1004 return XCAR (obj);
|
|
|
1005
|
|
|
1006 mark_object (XCAR (obj));
|
|
|
1007 return XCDR (obj);
|
|
|
1008 }
|
|
|
1009
|
|
|
1010 static int
|
|
|
1011 cons_equal (Lisp_Object ob1, Lisp_Object ob2, int depth)
|
|
|
1012 {
|
|
442
|
1013 depth++;
|
|
|
1014 while (internal_equal (XCAR (ob1), XCAR (ob2), depth))
|
|
428
|
1015 {
|
|
|
1016 ob1 = XCDR (ob1);
|
|
|
1017 ob2 = XCDR (ob2);
|
|
|
1018 if (! CONSP (ob1) || ! CONSP (ob2))
|
|
442
|
1019 return internal_equal (ob1, ob2, depth);
|
|
428
|
1020 }
|
|
|
1021 return 0;
|
|
|
1022 }
|
|
|
1023
|
|
1204
|
1024 static const struct memory_description cons_description[] = {
|
|
853
|
1025 { XD_LISP_OBJECT, offsetof (Lisp_Cons, car_) },
|
|
|
1026 { XD_LISP_OBJECT, offsetof (Lisp_Cons, cdr_) },
|
|
428
|
1027 { XD_END }
|
|
|
1028 };
|
|
|
1029
|
|
934
|
1030 DEFINE_BASIC_LRECORD_IMPLEMENTATION ("cons", cons,
|
|
|
1031 1, /*dumpable-flag*/
|
|
|
1032 mark_cons, print_cons, 0,
|
|
|
1033 cons_equal,
|
|
|
1034 /*
|
|
|
1035 * No `hash' method needed.
|
|
|
1036 * internal_hash knows how to
|
|
|
1037 * handle conses.
|
|
|
1038 */
|
|
|
1039 0,
|
|
|
1040 cons_description,
|
|
|
1041 Lisp_Cons);
|
|
428
|
1042
|
|
|
1043 DEFUN ("cons", Fcons, 2, 2, 0, /*
|
|
|
1044 Create a new cons, give it CAR and CDR as components, and return it.
|
|
|
1045 */
|
|
|
1046 (car, cdr))
|
|
|
1047 {
|
|
|
1048 /* This cannot GC. */
|
|
|
1049 Lisp_Object val;
|
|
440
|
1050 Lisp_Cons *c;
|
|
|
1051
|
|
|
1052 ALLOCATE_FIXED_TYPE (cons, Lisp_Cons, c);
|
|
442
|
1053 set_lheader_implementation (&c->lheader, &lrecord_cons);
|
|
793
|
1054 val = wrap_cons (c);
|
|
853
|
1055 XSETCAR (val, car);
|
|
|
1056 XSETCDR (val, cdr);
|
|
428
|
1057 return val;
|
|
|
1058 }
|
|
|
1059
|
|
|
1060 /* This is identical to Fcons() but it used for conses that we're
|
|
|
1061 going to free later, and is useful when trying to track down
|
|
|
1062 "real" consing. */
|
|
|
1063 Lisp_Object
|
|
|
1064 noseeum_cons (Lisp_Object car, Lisp_Object cdr)
|
|
|
1065 {
|
|
|
1066 Lisp_Object val;
|
|
440
|
1067 Lisp_Cons *c;
|
|
|
1068
|
|
|
1069 NOSEEUM_ALLOCATE_FIXED_TYPE (cons, Lisp_Cons, c);
|
|
442
|
1070 set_lheader_implementation (&c->lheader, &lrecord_cons);
|
|
793
|
1071 val = wrap_cons (c);
|
|
428
|
1072 XCAR (val) = car;
|
|
|
1073 XCDR (val) = cdr;
|
|
|
1074 return val;
|
|
|
1075 }
|
|
|
1076
|
|
|
1077 DEFUN ("list", Flist, 0, MANY, 0, /*
|
|
|
1078 Return a newly created list with specified arguments as elements.
|
|
|
1079 Any number of arguments, even zero arguments, are allowed.
|
|
|
1080 */
|
|
|
1081 (int nargs, Lisp_Object *args))
|
|
|
1082 {
|
|
|
1083 Lisp_Object val = Qnil;
|
|
|
1084 Lisp_Object *argp = args + nargs;
|
|
|
1085
|
|
|
1086 while (argp > args)
|
|
|
1087 val = Fcons (*--argp, val);
|
|
|
1088 return val;
|
|
|
1089 }
|
|
|
1090
|
|
|
1091 Lisp_Object
|
|
|
1092 list1 (Lisp_Object obj0)
|
|
|
1093 {
|
|
|
1094 /* This cannot GC. */
|
|
|
1095 return Fcons (obj0, Qnil);
|
|
|
1096 }
|
|
|
1097
|
|
|
1098 Lisp_Object
|
|
|
1099 list2 (Lisp_Object obj0, Lisp_Object obj1)
|
|
|
1100 {
|
|
|
1101 /* This cannot GC. */
|
|
|
1102 return Fcons (obj0, Fcons (obj1, Qnil));
|
|
|
1103 }
|
|
|
1104
|
|
|
1105 Lisp_Object
|
|
|
1106 list3 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2)
|
|
|
1107 {
|
|
|
1108 /* This cannot GC. */
|
|
|
1109 return Fcons (obj0, Fcons (obj1, Fcons (obj2, Qnil)));
|
|
|
1110 }
|
|
|
1111
|
|
|
1112 Lisp_Object
|
|
|
1113 cons3 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2)
|
|
|
1114 {
|
|
|
1115 /* This cannot GC. */
|
|
|
1116 return Fcons (obj0, Fcons (obj1, obj2));
|
|
|
1117 }
|
|
|
1118
|
|
|
1119 Lisp_Object
|
|
|
1120 acons (Lisp_Object key, Lisp_Object value, Lisp_Object alist)
|
|
|
1121 {
|
|
|
1122 return Fcons (Fcons (key, value), alist);
|
|
|
1123 }
|
|
|
1124
|
|
|
1125 Lisp_Object
|
|
|
1126 list4 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2, Lisp_Object obj3)
|
|
|
1127 {
|
|
|
1128 /* This cannot GC. */
|
|
|
1129 return Fcons (obj0, Fcons (obj1, Fcons (obj2, Fcons (obj3, Qnil))));
|
|
|
1130 }
|
|
|
1131
|
|
|
1132 Lisp_Object
|
|
|
1133 list5 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2, Lisp_Object obj3,
|
|
|
1134 Lisp_Object obj4)
|
|
|
1135 {
|
|
|
1136 /* This cannot GC. */
|
|
|
1137 return Fcons (obj0, Fcons (obj1, Fcons (obj2, Fcons (obj3, Fcons (obj4, Qnil)))));
|
|
|
1138 }
|
|
|
1139
|
|
|
1140 Lisp_Object
|
|
|
1141 list6 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2, Lisp_Object obj3,
|
|
|
1142 Lisp_Object obj4, Lisp_Object obj5)
|
|
|
1143 {
|
|
|
1144 /* This cannot GC. */
|
|
|
1145 return Fcons (obj0, Fcons (obj1, Fcons (obj2, Fcons (obj3, Fcons (obj4, Fcons (obj5, Qnil))))));
|
|
|
1146 }
|
|
|
1147
|
|
|
1148 DEFUN ("make-list", Fmake_list, 2, 2, 0, /*
|
|
444
|
1149 Return a new list of length LENGTH, with each element being OBJECT.
|
|
428
|
1150 */
|
|
444
|
1151 (length, object))
|
|
428
|
1152 {
|
|
|
1153 CHECK_NATNUM (length);
|
|
|
1154
|
|
|
1155 {
|
|
|
1156 Lisp_Object val = Qnil;
|
|
647
|
1157 EMACS_INT size = XINT (length);
|
|
428
|
1158
|
|
|
1159 while (size--)
|
|
444
|
1160 val = Fcons (object, val);
|
|
428
|
1161 return val;
|
|
|
1162 }
|
|
|
1163 }
|
|
|
1164
|
|
|
1165
|
|
|
1166 /************************************************************************/
|
|
|
1167 /* Float allocation */
|
|
|
1168 /************************************************************************/
|
|
|
1169
|
|
440
|
1170 DECLARE_FIXED_TYPE_ALLOC (float, Lisp_Float);
|
|
428
|
1171 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_float 1000
|
|
|
1172
|
|
|
1173 Lisp_Object
|
|
|
1174 make_float (double float_value)
|
|
|
1175 {
|
|
440
|
1176 Lisp_Float *f;
|
|
|
1177
|
|
|
1178 ALLOCATE_FIXED_TYPE (float, Lisp_Float, f);
|
|
|
1179
|
|
|
1180 /* Avoid dump-time `uninitialized memory read' purify warnings. */
|
|
|
1181 if (sizeof (struct lrecord_header) + sizeof (double) != sizeof (*f))
|
|
|
1182 xzero (*f);
|
|
|
1183
|
|
442
|
1184 set_lheader_implementation (&f->lheader, &lrecord_float);
|
|
428
|
1185 float_data (f) = float_value;
|
|
793
|
1186 return wrap_float (f);
|
|
428
|
1187 }
|
|
|
1188
|
|
|
1189
|
|
|
1190 /************************************************************************/
|
|
|
1191 /* Vector allocation */
|
|
|
1192 /************************************************************************/
|
|
|
1193
|
|
|
1194 static Lisp_Object
|
|
|
1195 mark_vector (Lisp_Object obj)
|
|
|
1196 {
|
|
|
1197 Lisp_Vector *ptr = XVECTOR (obj);
|
|
|
1198 int len = vector_length (ptr);
|
|
|
1199 int i;
|
|
|
1200
|
|
|
1201 for (i = 0; i < len - 1; i++)
|
|
|
1202 mark_object (ptr->contents[i]);
|
|
|
1203 return (len > 0) ? ptr->contents[len - 1] : Qnil;
|
|
|
1204 }
|
|
|
1205
|
|
665
|
1206 static Bytecount
|
|
442
|
1207 size_vector (const void *lheader)
|
|
428
|
1208 {
|
|
456
|
1209 return FLEXIBLE_ARRAY_STRUCT_SIZEOF (Lisp_Vector, Lisp_Object, contents,
|
|
442
|
1210 ((Lisp_Vector *) lheader)->size);
|
|
428
|
1211 }
|
|
|
1212
|
|
|
1213 static int
|
|
|
1214 vector_equal (Lisp_Object obj1, Lisp_Object obj2, int depth)
|
|
|
1215 {
|
|
|
1216 int len = XVECTOR_LENGTH (obj1);
|
|
|
1217 if (len != XVECTOR_LENGTH (obj2))
|
|
|
1218 return 0;
|
|
|
1219
|
|
|
1220 {
|
|
|
1221 Lisp_Object *ptr1 = XVECTOR_DATA (obj1);
|
|
|
1222 Lisp_Object *ptr2 = XVECTOR_DATA (obj2);
|
|
|
1223 while (len--)
|
|
|
1224 if (!internal_equal (*ptr1++, *ptr2++, depth + 1))
|
|
|
1225 return 0;
|
|
|
1226 }
|
|
|
1227 return 1;
|
|
|
1228 }
|
|
|
1229
|
|
665
|
1230 static Hashcode
|
|
442
|
1231 vector_hash (Lisp_Object obj, int depth)
|
|
|
1232 {
|
|
|
1233 return HASH2 (XVECTOR_LENGTH (obj),
|
|
|
1234 internal_array_hash (XVECTOR_DATA (obj),
|
|
|
1235 XVECTOR_LENGTH (obj),
|
|
|
1236 depth + 1));
|
|
|
1237 }
|
|
|
1238
|
|
1204
|
1239 static const struct memory_description vector_description[] = {
|
|
440
|
1240 { XD_LONG, offsetof (Lisp_Vector, size) },
|
|
|
1241 { XD_LISP_OBJECT_ARRAY, offsetof (Lisp_Vector, contents), XD_INDIRECT(0, 0) },
|
|
428
|
1242 { XD_END }
|
|
|
1243 };
|
|
|
1244
|
|
1204
|
1245 DEFINE_LRECORD_SEQUENCE_IMPLEMENTATION ("vector", vector,
|
|
|
1246 1, /*dumpable-flag*/
|
|
|
1247 mark_vector, print_vector, 0,
|
|
|
1248 vector_equal,
|
|
|
1249 vector_hash,
|
|
|
1250 vector_description,
|
|
|
1251 size_vector, Lisp_Vector);
|
|
428
|
1252 /* #### should allocate `small' vectors from a frob-block */
|
|
|
1253 static Lisp_Vector *
|
|
665
|
1254 make_vector_internal (Elemcount sizei)
|
|
428
|
1255 {
|
|
1204
|
1256 /* no `next' field; we use lcrecords */
|
|
665
|
1257 Bytecount sizem = FLEXIBLE_ARRAY_STRUCT_SIZEOF (Lisp_Vector, Lisp_Object,
|
|
1204
|
1258 contents, sizei);
|
|
|
1259 Lisp_Vector *p =
|
|
|
1260 (Lisp_Vector *) basic_alloc_lcrecord (sizem, &lrecord_vector);
|
|
428
|
1261
|
|
|
1262 p->size = sizei;
|
|
|
1263 return p;
|
|
|
1264 }
|
|
|
1265
|
|
|
1266 Lisp_Object
|
|
665
|
1267 make_vector (Elemcount length, Lisp_Object object)
|
|
428
|
1268 {
|
|
|
1269 Lisp_Vector *vecp = make_vector_internal (length);
|
|
|
1270 Lisp_Object *p = vector_data (vecp);
|
|
|
1271
|
|
|
1272 while (length--)
|
|
444
|
1273 *p++ = object;
|
|
428
|
1274
|
|
793
|
1275 return wrap_vector (vecp);
|
|
428
|
1276 }
|
|
|
1277
|
|
|
1278 DEFUN ("make-vector", Fmake_vector, 2, 2, 0, /*
|
|
444
|
1279 Return a new vector of length LENGTH, with each element being OBJECT.
|
|
428
|
1280 See also the function `vector'.
|
|
|
1281 */
|
|
444
|
1282 (length, object))
|
|
428
|
1283 {
|
|
|
1284 CONCHECK_NATNUM (length);
|
|
444
|
1285 return make_vector (XINT (length), object);
|
|
428
|
1286 }
|
|
|
1287
|
|
|
1288 DEFUN ("vector", Fvector, 0, MANY, 0, /*
|
|
|
1289 Return a newly created vector with specified arguments as elements.
|
|
|
1290 Any number of arguments, even zero arguments, are allowed.
|
|
|
1291 */
|
|
|
1292 (int nargs, Lisp_Object *args))
|
|
|
1293 {
|
|
|
1294 Lisp_Vector *vecp = make_vector_internal (nargs);
|
|
|
1295 Lisp_Object *p = vector_data (vecp);
|
|
|
1296
|
|
|
1297 while (nargs--)
|
|
|
1298 *p++ = *args++;
|
|
|
1299
|
|
793
|
1300 return wrap_vector (vecp);
|
|
428
|
1301 }
|
|
|
1302
|
|
|
1303 Lisp_Object
|
|
|
1304 vector1 (Lisp_Object obj0)
|
|
|
1305 {
|
|
|
1306 return Fvector (1, &obj0);
|
|
|
1307 }
|
|
|
1308
|
|
|
1309 Lisp_Object
|
|
|
1310 vector2 (Lisp_Object obj0, Lisp_Object obj1)
|
|
|
1311 {
|
|
|
1312 Lisp_Object args[2];
|
|
|
1313 args[0] = obj0;
|
|
|
1314 args[1] = obj1;
|
|
|
1315 return Fvector (2, args);
|
|
|
1316 }
|
|
|
1317
|
|
|
1318 Lisp_Object
|
|
|
1319 vector3 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2)
|
|
|
1320 {
|
|
|
1321 Lisp_Object args[3];
|
|
|
1322 args[0] = obj0;
|
|
|
1323 args[1] = obj1;
|
|
|
1324 args[2] = obj2;
|
|
|
1325 return Fvector (3, args);
|
|
|
1326 }
|
|
|
1327
|
|
|
1328 #if 0 /* currently unused */
|
|
|
1329
|
|
|
1330 Lisp_Object
|
|
|
1331 vector4 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2,
|
|
|
1332 Lisp_Object obj3)
|
|
|
1333 {
|
|
|
1334 Lisp_Object args[4];
|
|
|
1335 args[0] = obj0;
|
|
|
1336 args[1] = obj1;
|
|
|
1337 args[2] = obj2;
|
|
|
1338 args[3] = obj3;
|
|
|
1339 return Fvector (4, args);
|
|
|
1340 }
|
|
|
1341
|
|
|
1342 Lisp_Object
|
|
|
1343 vector5 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2,
|
|
|
1344 Lisp_Object obj3, Lisp_Object obj4)
|
|
|
1345 {
|
|
|
1346 Lisp_Object args[5];
|
|
|
1347 args[0] = obj0;
|
|
|
1348 args[1] = obj1;
|
|
|
1349 args[2] = obj2;
|
|
|
1350 args[3] = obj3;
|
|
|
1351 args[4] = obj4;
|
|
|
1352 return Fvector (5, args);
|
|
|
1353 }
|
|
|
1354
|
|
|
1355 Lisp_Object
|
|
|
1356 vector6 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2,
|
|
|
1357 Lisp_Object obj3, Lisp_Object obj4, Lisp_Object obj5)
|
|
|
1358 {
|
|
|
1359 Lisp_Object args[6];
|
|
|
1360 args[0] = obj0;
|
|
|
1361 args[1] = obj1;
|
|
|
1362 args[2] = obj2;
|
|
|
1363 args[3] = obj3;
|
|
|
1364 args[4] = obj4;
|
|
|
1365 args[5] = obj5;
|
|
|
1366 return Fvector (6, args);
|
|
|
1367 }
|
|
|
1368
|
|
|
1369 Lisp_Object
|
|
|
1370 vector7 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2,
|
|
|
1371 Lisp_Object obj3, Lisp_Object obj4, Lisp_Object obj5,
|
|
|
1372 Lisp_Object obj6)
|
|
|
1373 {
|
|
|
1374 Lisp_Object args[7];
|
|
|
1375 args[0] = obj0;
|
|
|
1376 args[1] = obj1;
|
|
|
1377 args[2] = obj2;
|
|
|
1378 args[3] = obj3;
|
|
|
1379 args[4] = obj4;
|
|
|
1380 args[5] = obj5;
|
|
|
1381 args[6] = obj6;
|
|
|
1382 return Fvector (7, args);
|
|
|
1383 }
|
|
|
1384
|
|
|
1385 Lisp_Object
|
|
|
1386 vector8 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2,
|
|
|
1387 Lisp_Object obj3, Lisp_Object obj4, Lisp_Object obj5,
|
|
|
1388 Lisp_Object obj6, Lisp_Object obj7)
|
|
|
1389 {
|
|
|
1390 Lisp_Object args[8];
|
|
|
1391 args[0] = obj0;
|
|
|
1392 args[1] = obj1;
|
|
|
1393 args[2] = obj2;
|
|
|
1394 args[3] = obj3;
|
|
|
1395 args[4] = obj4;
|
|
|
1396 args[5] = obj5;
|
|
|
1397 args[6] = obj6;
|
|
|
1398 args[7] = obj7;
|
|
|
1399 return Fvector (8, args);
|
|
|
1400 }
|
|
|
1401 #endif /* unused */
|
|
|
1402
|
|
|
1403 /************************************************************************/
|
|
|
1404 /* Bit Vector allocation */
|
|
|
1405 /************************************************************************/
|
|
|
1406
|
|
|
1407 /* #### should allocate `small' bit vectors from a frob-block */
|
|
440
|
1408 static Lisp_Bit_Vector *
|
|
665
|
1409 make_bit_vector_internal (Elemcount sizei)
|
|
428
|
1410 {
|
|
1204
|
1411 /* no `next' field; we use lcrecords */
|
|
665
|
1412 Elemcount num_longs = BIT_VECTOR_LONG_STORAGE (sizei);
|
|
|
1413 Bytecount sizem = FLEXIBLE_ARRAY_STRUCT_SIZEOF (Lisp_Bit_Vector,
|
|
1204
|
1414 unsigned long,
|
|
|
1415 bits, num_longs);
|
|
|
1416 Lisp_Bit_Vector *p = (Lisp_Bit_Vector *)
|
|
|
1417 basic_alloc_lcrecord (sizem, &lrecord_bit_vector);
|
|
428
|
1418
|
|
|
1419 bit_vector_length (p) = sizei;
|
|
|
1420 return p;
|
|
|
1421 }
|
|
|
1422
|
|
|
1423 Lisp_Object
|
|
665
|
1424 make_bit_vector (Elemcount length, Lisp_Object bit)
|
|
428
|
1425 {
|
|
440
|
1426 Lisp_Bit_Vector *p = make_bit_vector_internal (length);
|
|
665
|
1427 Elemcount num_longs = BIT_VECTOR_LONG_STORAGE (length);
|
|
428
|
1428
|
|
444
|
1429 CHECK_BIT (bit);
|
|
|
1430
|
|
|
1431 if (ZEROP (bit))
|
|
428
|
1432 memset (p->bits, 0, num_longs * sizeof (long));
|
|
|
1433 else
|
|
|
1434 {
|
|
665
|
1435 Elemcount bits_in_last = length & (LONGBITS_POWER_OF_2 - 1);
|
|
428
|
1436 memset (p->bits, ~0, num_longs * sizeof (long));
|
|
|
1437 /* But we have to make sure that the unused bits in the
|
|
|
1438 last long are 0, so that equal/hash is easy. */
|
|
|
1439 if (bits_in_last)
|
|
|
1440 p->bits[num_longs - 1] &= (1 << bits_in_last) - 1;
|
|
|
1441 }
|
|
|
1442
|
|
793
|
1443 return wrap_bit_vector (p);
|
|
428
|
1444 }
|
|
|
1445
|
|
|
1446 Lisp_Object
|
|
665
|
1447 make_bit_vector_from_byte_vector (unsigned char *bytevec, Elemcount length)
|
|
428
|
1448 {
|
|
665
|
1449 Elemcount i;
|
|
428
|
1450 Lisp_Bit_Vector *p = make_bit_vector_internal (length);
|
|
|
1451
|
|
|
1452 for (i = 0; i < length; i++)
|
|
|
1453 set_bit_vector_bit (p, i, bytevec[i]);
|
|
|
1454
|
|
793
|
1455 return wrap_bit_vector (p);
|
|
428
|
1456 }
|
|
|
1457
|
|
|
1458 DEFUN ("make-bit-vector", Fmake_bit_vector, 2, 2, 0, /*
|
|
444
|
1459 Return a new bit vector of length LENGTH. with each bit set to BIT.
|
|
|
1460 BIT must be one of the integers 0 or 1. See also the function `bit-vector'.
|
|
428
|
1461 */
|
|
444
|
1462 (length, bit))
|
|
428
|
1463 {
|
|
|
1464 CONCHECK_NATNUM (length);
|
|
|
1465
|
|
444
|
1466 return make_bit_vector (XINT (length), bit);
|
|
428
|
1467 }
|
|
|
1468
|
|
|
1469 DEFUN ("bit-vector", Fbit_vector, 0, MANY, 0, /*
|
|
|
1470 Return a newly created bit vector with specified arguments as elements.
|
|
|
1471 Any number of arguments, even zero arguments, are allowed.
|
|
444
|
1472 Each argument must be one of the integers 0 or 1.
|
|
428
|
1473 */
|
|
|
1474 (int nargs, Lisp_Object *args))
|
|
|
1475 {
|
|
|
1476 int i;
|
|
|
1477 Lisp_Bit_Vector *p = make_bit_vector_internal (nargs);
|
|
|
1478
|
|
|
1479 for (i = 0; i < nargs; i++)
|
|
|
1480 {
|
|
|
1481 CHECK_BIT (args[i]);
|
|
|
1482 set_bit_vector_bit (p, i, !ZEROP (args[i]));
|
|
|
1483 }
|
|
|
1484
|
|
793
|
1485 return wrap_bit_vector (p);
|
|
428
|
1486 }
|
|
|
1487
|
|
|
1488
|
|
|
1489 /************************************************************************/
|
|
|
1490 /* Compiled-function allocation */
|
|
|
1491 /************************************************************************/
|
|
|
1492
|
|
|
1493 DECLARE_FIXED_TYPE_ALLOC (compiled_function, Lisp_Compiled_Function);
|
|
|
1494 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_compiled_function 1000
|
|
|
1495
|
|
|
1496 static Lisp_Object
|
|
|
1497 make_compiled_function (void)
|
|
|
1498 {
|
|
|
1499 Lisp_Compiled_Function *f;
|
|
|
1500
|
|
|
1501 ALLOCATE_FIXED_TYPE (compiled_function, Lisp_Compiled_Function, f);
|
|
442
|
1502 set_lheader_implementation (&f->lheader, &lrecord_compiled_function);
|
|
428
|
1503
|
|
|
1504 f->stack_depth = 0;
|
|
|
1505 f->specpdl_depth = 0;
|
|
|
1506 f->flags.documentationp = 0;
|
|
|
1507 f->flags.interactivep = 0;
|
|
|
1508 f->flags.domainp = 0; /* I18N3 */
|
|
|
1509 f->instructions = Qzero;
|
|
|
1510 f->constants = Qzero;
|
|
|
1511 f->arglist = Qnil;
|
|
|
1512 f->doc_and_interactive = Qnil;
|
|
|
1513 #ifdef COMPILED_FUNCTION_ANNOTATION_HACK
|
|
|
1514 f->annotated = Qnil;
|
|
|
1515 #endif
|
|
793
|
1516 return wrap_compiled_function (f);
|
|
428
|
1517 }
|
|
|
1518
|
|
|
1519 DEFUN ("make-byte-code", Fmake_byte_code, 4, MANY, 0, /*
|
|
|
1520 Return a new compiled-function object.
|
|
|
1521 Usage: (arglist instructions constants stack-depth
|
|
|
1522 &optional doc-string interactive)
|
|
|
1523 Note that, unlike all other emacs-lisp functions, calling this with five
|
|
|
1524 arguments is NOT the same as calling it with six arguments, the last of
|
|
|
1525 which is nil. If the INTERACTIVE arg is specified as nil, then that means
|
|
|
1526 that this function was defined with `(interactive)'. If the arg is not
|
|
|
1527 specified, then that means the function is not interactive.
|
|
|
1528 This is terrible behavior which is retained for compatibility with old
|
|
|
1529 `.elc' files which expect these semantics.
|
|
|
1530 */
|
|
|
1531 (int nargs, Lisp_Object *args))
|
|
|
1532 {
|
|
|
1533 /* In a non-insane world this function would have this arglist...
|
|
|
1534 (arglist instructions constants stack_depth &optional doc_string interactive)
|
|
|
1535 */
|
|
|
1536 Lisp_Object fun = make_compiled_function ();
|
|
|
1537 Lisp_Compiled_Function *f = XCOMPILED_FUNCTION (fun);
|
|
|
1538
|
|
|
1539 Lisp_Object arglist = args[0];
|
|
|
1540 Lisp_Object instructions = args[1];
|
|
|
1541 Lisp_Object constants = args[2];
|
|
|
1542 Lisp_Object stack_depth = args[3];
|
|
|
1543 Lisp_Object doc_string = (nargs > 4) ? args[4] : Qnil;
|
|
|
1544 Lisp_Object interactive = (nargs > 5) ? args[5] : Qunbound;
|
|
|
1545
|
|
|
1546 if (nargs < 4 || nargs > 6)
|
|
|
1547 return Fsignal (Qwrong_number_of_arguments,
|
|
|
1548 list2 (intern ("make-byte-code"), make_int (nargs)));
|
|
|
1549
|
|
|
1550 /* Check for valid formal parameter list now, to allow us to use
|
|
|
1551 SPECBIND_FAST_UNSAFE() later in funcall_compiled_function(). */
|
|
|
1552 {
|
|
814
|
1553 EXTERNAL_LIST_LOOP_2 (symbol, arglist)
|
|
428
|
1554 {
|
|
|
1555 CHECK_SYMBOL (symbol);
|
|
|
1556 if (EQ (symbol, Qt) ||
|
|
|
1557 EQ (symbol, Qnil) ||
|
|
|
1558 SYMBOL_IS_KEYWORD (symbol))
|
|
563
|
1559 invalid_constant_2
|
|
428
|
1560 ("Invalid constant symbol in formal parameter list",
|
|
|
1561 symbol, arglist);
|
|
|
1562 }
|
|
|
1563 }
|
|
|
1564 f->arglist = arglist;
|
|
|
1565
|
|
814
|
1566 {
|
|
|
1567 int minargs = 0, maxargs = 0, totalargs = 0;
|
|
|
1568 int optional_p = 0, rest_p = 0, i = 0;
|
|
|
1569 {
|
|
|
1570 LIST_LOOP_2 (arg, arglist)
|
|
|
1571 {
|
|
|
1572 if (EQ (arg, Qand_optional))
|
|
|
1573 optional_p = 1;
|
|
|
1574 else if (EQ (arg, Qand_rest))
|
|
|
1575 rest_p = 1;
|
|
|
1576 else
|
|
|
1577 {
|
|
|
1578 if (rest_p)
|
|
|
1579 {
|
|
|
1580 maxargs = MANY;
|
|
|
1581 totalargs++;
|
|
|
1582 break;
|
|
|
1583 }
|
|
|
1584 if (!optional_p)
|
|
|
1585 minargs++;
|
|
|
1586 maxargs++;
|
|
|
1587 totalargs++;
|
|
|
1588 }
|
|
|
1589 }
|
|
|
1590 }
|
|
|
1591
|
|
945
|
1592 if (totalargs)
|
|
|
1593 f->args = xnew_array (Lisp_Object, totalargs);
|
|
814
|
1594
|
|
|
1595 {
|
|
|
1596 LIST_LOOP_2 (arg, arglist)
|
|
|
1597 {
|
|
|
1598 if (!EQ (arg, Qand_optional) && !EQ (arg, Qand_rest))
|
|
|
1599 f->args[i++] = arg;
|
|
|
1600 }
|
|
|
1601 }
|
|
|
1602
|
|
|
1603 f->max_args = maxargs;
|
|
|
1604 f->min_args = minargs;
|
|
|
1605 f->args_in_array = totalargs;
|
|
|
1606 }
|
|
|
1607
|
|
428
|
1608 /* `instructions' is a string or a cons (string . int) for a
|
|
|
1609 lazy-loaded function. */
|
|
|
1610 if (CONSP (instructions))
|
|
|
1611 {
|
|
|
1612 CHECK_STRING (XCAR (instructions));
|
|
|
1613 CHECK_INT (XCDR (instructions));
|
|
|
1614 }
|
|
|
1615 else
|
|
|
1616 {
|
|
|
1617 CHECK_STRING (instructions);
|
|
|
1618 }
|
|
|
1619 f->instructions = instructions;
|
|
|
1620
|
|
|
1621 if (!NILP (constants))
|
|
|
1622 CHECK_VECTOR (constants);
|
|
|
1623 f->constants = constants;
|
|
|
1624
|
|
|
1625 CHECK_NATNUM (stack_depth);
|
|
442
|
1626 f->stack_depth = (unsigned short) XINT (stack_depth);
|
|
428
|
1627
|
|
|
1628 #ifdef COMPILED_FUNCTION_ANNOTATION_HACK
|
|
|
1629 if (!NILP (Vcurrent_compiled_function_annotation))
|
|
|
1630 f->annotated = Fcopy (Vcurrent_compiled_function_annotation);
|
|
|
1631 else if (!NILP (Vload_file_name_internal_the_purecopy))
|
|
|
1632 f->annotated = Vload_file_name_internal_the_purecopy;
|
|
|
1633 else if (!NILP (Vload_file_name_internal))
|
|
|
1634 {
|
|
|
1635 struct gcpro gcpro1;
|
|
|
1636 GCPRO1 (fun); /* don't let fun get reaped */
|
|
|
1637 Vload_file_name_internal_the_purecopy =
|
|
|
1638 Ffile_name_nondirectory (Vload_file_name_internal);
|
|
|
1639 f->annotated = Vload_file_name_internal_the_purecopy;
|
|
|
1640 UNGCPRO;
|
|
|
1641 }
|
|
|
1642 #endif /* COMPILED_FUNCTION_ANNOTATION_HACK */
|
|
|
1643
|
|
|
1644 /* doc_string may be nil, string, int, or a cons (string . int).
|
|
|
1645 interactive may be list or string (or unbound). */
|
|
|
1646 f->doc_and_interactive = Qunbound;
|
|
|
1647 #ifdef I18N3
|
|
|
1648 if ((f->flags.domainp = !NILP (Vfile_domain)) != 0)
|
|
|
1649 f->doc_and_interactive = Vfile_domain;
|
|
|
1650 #endif
|
|
|
1651 if ((f->flags.interactivep = !UNBOUNDP (interactive)) != 0)
|
|
|
1652 {
|
|
|
1653 f->doc_and_interactive
|
|
|
1654 = (UNBOUNDP (f->doc_and_interactive) ? interactive :
|
|
|
1655 Fcons (interactive, f->doc_and_interactive));
|
|
|
1656 }
|
|
|
1657 if ((f->flags.documentationp = !NILP (doc_string)) != 0)
|
|
|
1658 {
|
|
|
1659 f->doc_and_interactive
|
|
|
1660 = (UNBOUNDP (f->doc_and_interactive) ? doc_string :
|
|
|
1661 Fcons (doc_string, f->doc_and_interactive));
|
|
|
1662 }
|
|
|
1663 if (UNBOUNDP (f->doc_and_interactive))
|
|
|
1664 f->doc_and_interactive = Qnil;
|
|
|
1665
|
|
|
1666 return fun;
|
|
|
1667 }
|
|
|
1668
|
|
|
1669
|
|
|
1670 /************************************************************************/
|
|
|
1671 /* Symbol allocation */
|
|
|
1672 /************************************************************************/
|
|
|
1673
|
|
440
|
1674 DECLARE_FIXED_TYPE_ALLOC (symbol, Lisp_Symbol);
|
|
428
|
1675 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_symbol 1000
|
|
|
1676
|
|
|
1677 DEFUN ("make-symbol", Fmake_symbol, 1, 1, 0, /*
|
|
|
1678 Return a newly allocated uninterned symbol whose name is NAME.
|
|
|
1679 Its value and function definition are void, and its property list is nil.
|
|
|
1680 */
|
|
|
1681 (name))
|
|
|
1682 {
|
|
440
|
1683 Lisp_Symbol *p;
|
|
428
|
1684
|
|
|
1685 CHECK_STRING (name);
|
|
|
1686
|
|
440
|
1687 ALLOCATE_FIXED_TYPE (symbol, Lisp_Symbol, p);
|
|
442
|
1688 set_lheader_implementation (&p->lheader, &lrecord_symbol);
|
|
793
|
1689 p->name = name;
|
|
428
|
1690 p->plist = Qnil;
|
|
|
1691 p->value = Qunbound;
|
|
|
1692 p->function = Qunbound;
|
|
|
1693 symbol_next (p) = 0;
|
|
793
|
1694 return wrap_symbol (p);
|
|
428
|
1695 }
|
|
|
1696
|
|
|
1697
|
|
|
1698 /************************************************************************/
|
|
|
1699 /* Extent allocation */
|
|
|
1700 /************************************************************************/
|
|
|
1701
|
|
|
1702 DECLARE_FIXED_TYPE_ALLOC (extent, struct extent);
|
|
|
1703 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_extent 1000
|
|
|
1704
|
|
|
1705 struct extent *
|
|
|
1706 allocate_extent (void)
|
|
|
1707 {
|
|
|
1708 struct extent *e;
|
|
|
1709
|
|
|
1710 ALLOCATE_FIXED_TYPE (extent, struct extent, e);
|
|
442
|
1711 set_lheader_implementation (&e->lheader, &lrecord_extent);
|
|
428
|
1712 extent_object (e) = Qnil;
|
|
|
1713 set_extent_start (e, -1);
|
|
|
1714 set_extent_end (e, -1);
|
|
|
1715 e->plist = Qnil;
|
|
|
1716
|
|
|
1717 xzero (e->flags);
|
|
|
1718
|
|
|
1719 extent_face (e) = Qnil;
|
|
|
1720 e->flags.end_open = 1; /* default is for endpoints to behave like markers */
|
|
|
1721 e->flags.detachable = 1;
|
|
|
1722
|
|
|
1723 return e;
|
|
|
1724 }
|
|
|
1725
|
|
|
1726
|
|
|
1727 /************************************************************************/
|
|
|
1728 /* Event allocation */
|
|
|
1729 /************************************************************************/
|
|
|
1730
|
|
440
|
1731 DECLARE_FIXED_TYPE_ALLOC (event, Lisp_Event);
|
|
428
|
1732 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_event 1000
|
|
|
1733
|
|
|
1734 Lisp_Object
|
|
|
1735 allocate_event (void)
|
|
|
1736 {
|
|
440
|
1737 Lisp_Event *e;
|
|
|
1738
|
|
|
1739 ALLOCATE_FIXED_TYPE (event, Lisp_Event, e);
|
|
442
|
1740 set_lheader_implementation (&e->lheader, &lrecord_event);
|
|
428
|
1741
|
|
793
|
1742 return wrap_event (e);
|
|
428
|
1743 }
|
|
|
1744
|
|
1204
|
1745 #ifdef EVENT_DATA_AS_OBJECTS
|
|
934
|
1746 DECLARE_FIXED_TYPE_ALLOC (key_data, Lisp_Key_Data);
|
|
|
1747 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_key_data 1000
|
|
|
1748
|
|
|
1749 Lisp_Object
|
|
1204
|
1750 make_key_data (void)
|
|
934
|
1751 {
|
|
|
1752 Lisp_Key_Data *d;
|
|
|
1753
|
|
|
1754 ALLOCATE_FIXED_TYPE (key_data, Lisp_Key_Data, d);
|
|
1204
|
1755 xzero (*d);
|
|
934
|
1756 set_lheader_implementation (&d->lheader, &lrecord_key_data);
|
|
1204
|
1757 d->keysym = Qnil;
|
|
|
1758
|
|
|
1759 return wrap_key_data (d);
|
|
934
|
1760 }
|
|
|
1761
|
|
|
1762 DECLARE_FIXED_TYPE_ALLOC (button_data, Lisp_Button_Data);
|
|
|
1763 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_button_data 1000
|
|
|
1764
|
|
|
1765 Lisp_Object
|
|
1204
|
1766 make_button_data (void)
|
|
934
|
1767 {
|
|
|
1768 Lisp_Button_Data *d;
|
|
|
1769
|
|
|
1770 ALLOCATE_FIXED_TYPE (button_data, Lisp_Button_Data, d);
|
|
1204
|
1771 xzero (*d);
|
|
934
|
1772 set_lheader_implementation (&d->lheader, &lrecord_button_data);
|
|
|
1773
|
|
1204
|
1774 return wrap_button_data (d);
|
|
934
|
1775 }
|
|
|
1776
|
|
|
1777 DECLARE_FIXED_TYPE_ALLOC (motion_data, Lisp_Motion_Data);
|
|
|
1778 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_motion_data 1000
|
|
|
1779
|
|
|
1780 Lisp_Object
|
|
1204
|
1781 make_motion_data (void)
|
|
934
|
1782 {
|
|
|
1783 Lisp_Motion_Data *d;
|
|
|
1784
|
|
|
1785 ALLOCATE_FIXED_TYPE (motion_data, Lisp_Motion_Data, d);
|
|
1204
|
1786 xzero (*d);
|
|
934
|
1787 set_lheader_implementation (&d->lheader, &lrecord_motion_data);
|
|
|
1788
|
|
1204
|
1789 return wrap_motion_data (d);
|
|
934
|
1790 }
|
|
|
1791
|
|
|
1792 DECLARE_FIXED_TYPE_ALLOC (process_data, Lisp_Process_Data);
|
|
|
1793 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_process_data 1000
|
|
|
1794
|
|
|
1795 Lisp_Object
|
|
1204
|
1796 make_process_data (void)
|
|
934
|
1797 {
|
|
|
1798 Lisp_Process_Data *d;
|
|
|
1799
|
|
|
1800 ALLOCATE_FIXED_TYPE (process_data, Lisp_Process_Data, d);
|
|
1204
|
1801 xzero (*d);
|
|
934
|
1802 set_lheader_implementation (&d->lheader, &lrecord_process_data);
|
|
1204
|
1803 d->process = Qnil;
|
|
|
1804
|
|
|
1805 return wrap_process_data (d);
|
|
934
|
1806 }
|
|
|
1807
|
|
|
1808 DECLARE_FIXED_TYPE_ALLOC (timeout_data, Lisp_Timeout_Data);
|
|
|
1809 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_timeout_data 1000
|
|
|
1810
|
|
|
1811 Lisp_Object
|
|
1204
|
1812 make_timeout_data (void)
|
|
934
|
1813 {
|
|
|
1814 Lisp_Timeout_Data *d;
|
|
|
1815
|
|
|
1816 ALLOCATE_FIXED_TYPE (timeout_data, Lisp_Timeout_Data, d);
|
|
1204
|
1817 xzero (*d);
|
|
934
|
1818 set_lheader_implementation (&d->lheader, &lrecord_timeout_data);
|
|
1204
|
1819 d->function = Qnil;
|
|
|
1820 d->object = Qnil;
|
|
|
1821
|
|
|
1822 return wrap_timeout_data (d);
|
|
934
|
1823 }
|
|
|
1824
|
|
|
1825 DECLARE_FIXED_TYPE_ALLOC (magic_data, Lisp_Magic_Data);
|
|
|
1826 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_magic_data 1000
|
|
|
1827
|
|
|
1828 Lisp_Object
|
|
1204
|
1829 make_magic_data (void)
|
|
934
|
1830 {
|
|
|
1831 Lisp_Magic_Data *d;
|
|
|
1832
|
|
|
1833 ALLOCATE_FIXED_TYPE (magic_data, Lisp_Magic_Data, d);
|
|
1204
|
1834 xzero (*d);
|
|
934
|
1835 set_lheader_implementation (&d->lheader, &lrecord_magic_data);
|
|
|
1836
|
|
1204
|
1837 return wrap_magic_data (d);
|
|
934
|
1838 }
|
|
|
1839
|
|
|
1840 DECLARE_FIXED_TYPE_ALLOC (magic_eval_data, Lisp_Magic_Eval_Data);
|
|
|
1841 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_magic_eval_data 1000
|
|
|
1842
|
|
|
1843 Lisp_Object
|
|
1204
|
1844 make_magic_eval_data (void)
|
|
934
|
1845 {
|
|
|
1846 Lisp_Magic_Eval_Data *d;
|
|
|
1847
|
|
|
1848 ALLOCATE_FIXED_TYPE (magic_eval_data, Lisp_Magic_Eval_Data, d);
|
|
1204
|
1849 xzero (*d);
|
|
934
|
1850 set_lheader_implementation (&d->lheader, &lrecord_magic_eval_data);
|
|
1204
|
1851 d->object = Qnil;
|
|
|
1852
|
|
|
1853 return wrap_magic_eval_data (d);
|
|
934
|
1854 }
|
|
|
1855
|
|
|
1856 DECLARE_FIXED_TYPE_ALLOC (eval_data, Lisp_Eval_Data);
|
|
|
1857 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_eval_data 1000
|
|
|
1858
|
|
|
1859 Lisp_Object
|
|
1204
|
1860 make_eval_data (void)
|
|
934
|
1861 {
|
|
|
1862 Lisp_Eval_Data *d;
|
|
|
1863
|
|
|
1864 ALLOCATE_FIXED_TYPE (eval_data, Lisp_Eval_Data, d);
|
|
1204
|
1865 xzero (*d);
|
|
934
|
1866 set_lheader_implementation (&d->lheader, &lrecord_eval_data);
|
|
1204
|
1867 d->function = Qnil;
|
|
|
1868 d->object = Qnil;
|
|
|
1869
|
|
|
1870 return wrap_eval_data (d);
|
|
934
|
1871 }
|
|
|
1872
|
|
|
1873 DECLARE_FIXED_TYPE_ALLOC (misc_user_data, Lisp_Misc_User_Data);
|
|
|
1874 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_misc_user_data 1000
|
|
|
1875
|
|
|
1876 Lisp_Object
|
|
1204
|
1877 make_misc_user_data (void)
|
|
934
|
1878 {
|
|
|
1879 Lisp_Misc_User_Data *d;
|
|
|
1880
|
|
|
1881 ALLOCATE_FIXED_TYPE (misc_user_data, Lisp_Misc_User_Data, d);
|
|
1204
|
1882 xzero (*d);
|
|
934
|
1883 set_lheader_implementation (&d->lheader, &lrecord_misc_user_data);
|
|
1204
|
1884 d->function = Qnil;
|
|
|
1885 d->object = Qnil;
|
|
|
1886
|
|
|
1887 return wrap_misc_user_data (d);
|
|
934
|
1888 }
|
|
1204
|
1889
|
|
|
1890 #endif /* EVENT_DATA_AS_OBJECTS */
|
|
428
|
1891
|
|
|
1892 /************************************************************************/
|
|
|
1893 /* Marker allocation */
|
|
|
1894 /************************************************************************/
|
|
|
1895
|
|
440
|
1896 DECLARE_FIXED_TYPE_ALLOC (marker, Lisp_Marker);
|
|
428
|
1897 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_marker 1000
|
|
|
1898
|
|
|
1899 DEFUN ("make-marker", Fmake_marker, 0, 0, 0, /*
|
|
|
1900 Return a new marker which does not point at any place.
|
|
|
1901 */
|
|
|
1902 ())
|
|
|
1903 {
|
|
440
|
1904 Lisp_Marker *p;
|
|
|
1905
|
|
|
1906 ALLOCATE_FIXED_TYPE (marker, Lisp_Marker, p);
|
|
442
|
1907 set_lheader_implementation (&p->lheader, &lrecord_marker);
|
|
428
|
1908 p->buffer = 0;
|
|
665
|
1909 p->membpos = 0;
|
|
428
|
1910 marker_next (p) = 0;
|
|
|
1911 marker_prev (p) = 0;
|
|
|
1912 p->insertion_type = 0;
|
|
793
|
1913 return wrap_marker (p);
|
|
428
|
1914 }
|
|
|
1915
|
|
|
1916 Lisp_Object
|
|
|
1917 noseeum_make_marker (void)
|
|
|
1918 {
|
|
440
|
1919 Lisp_Marker *p;
|
|
|
1920
|
|
|
1921 NOSEEUM_ALLOCATE_FIXED_TYPE (marker, Lisp_Marker, p);
|
|
442
|
1922 set_lheader_implementation (&p->lheader, &lrecord_marker);
|
|
428
|
1923 p->buffer = 0;
|
|
665
|
1924 p->membpos = 0;
|
|
428
|
1925 marker_next (p) = 0;
|
|
|
1926 marker_prev (p) = 0;
|
|
|
1927 p->insertion_type = 0;
|
|
793
|
1928 return wrap_marker (p);
|
|
428
|
1929 }
|
|
|
1930
|
|
|
1931
|
|
|
1932 /************************************************************************/
|
|
|
1933 /* String allocation */
|
|
|
1934 /************************************************************************/
|
|
|
1935
|
|
|
1936 /* The data for "short" strings generally resides inside of structs of type
|
|
|
1937 string_chars_block. The Lisp_String structure is allocated just like any
|
|
1204
|
1938 other basic lrecord, and these are freelisted when they get garbage
|
|
|
1939 collected. The data for short strings get compacted, but the data for
|
|
|
1940 large strings do not.
|
|
428
|
1941
|
|
|
1942 Previously Lisp_String structures were relocated, but this caused a lot
|
|
|
1943 of bus-errors because the C code didn't include enough GCPRO's for
|
|
|
1944 strings (since EVERY REFERENCE to a short string needed to be GCPRO'd so
|
|
|
1945 that the reference would get relocated).
|
|
|
1946
|
|
|
1947 This new method makes things somewhat bigger, but it is MUCH safer. */
|
|
|
1948
|
|
438
|
1949 DECLARE_FIXED_TYPE_ALLOC (string, Lisp_String);
|
|
428
|
1950 /* strings are used and freed quite often */
|
|
|
1951 /* #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_string 10000 */
|
|
|
1952 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_string 1000
|
|
|
1953
|
|
|
1954 static Lisp_Object
|
|
|
1955 mark_string (Lisp_Object obj)
|
|
|
1956 {
|
|
793
|
1957 if (CONSP (XSTRING_PLIST (obj)) && EXTENT_INFOP (XCAR (XSTRING_PLIST (obj))))
|
|
|
1958 flush_cached_extent_info (XCAR (XSTRING_PLIST (obj)));
|
|
|
1959 return XSTRING_PLIST (obj);
|
|
428
|
1960 }
|
|
|
1961
|
|
|
1962 static int
|
|
|
1963 string_equal (Lisp_Object obj1, Lisp_Object obj2, int depth)
|
|
|
1964 {
|
|
|
1965 Bytecount len;
|
|
|
1966 return (((len = XSTRING_LENGTH (obj1)) == XSTRING_LENGTH (obj2)) &&
|
|
|
1967 !memcmp (XSTRING_DATA (obj1), XSTRING_DATA (obj2), len));
|
|
|
1968 }
|
|
|
1969
|
|
1204
|
1970 static const struct memory_description string_description[] = {
|
|
793
|
1971 { XD_BYTECOUNT, offsetof (Lisp_String, size_) },
|
|
|
1972 { XD_OPAQUE_DATA_PTR, offsetof (Lisp_String, data_), XD_INDIRECT(0, 1) },
|
|
440
|
1973 { XD_LISP_OBJECT, offsetof (Lisp_String, plist) },
|
|
428
|
1974 { XD_END }
|
|
|
1975 };
|
|
|
1976
|
|
442
|
1977 /* We store the string's extent info as the first element of the string's
|
|
|
1978 property list; and the string's MODIFF as the first or second element
|
|
|
1979 of the string's property list (depending on whether the extent info
|
|
|
1980 is present), but only if the string has been modified. This is ugly
|
|
|
1981 but it reduces the memory allocated for the string in the vast
|
|
|
1982 majority of cases, where the string is never modified and has no
|
|
|
1983 extent info.
|
|
|
1984
|
|
|
1985 #### This means you can't use an int as a key in a string's plist. */
|
|
|
1986
|
|
|
1987 static Lisp_Object *
|
|
|
1988 string_plist_ptr (Lisp_Object string)
|
|
|
1989 {
|
|
793
|
1990 Lisp_Object *ptr = &XSTRING_PLIST (string);
|
|
442
|
1991
|
|
|
1992 if (CONSP (*ptr) && EXTENT_INFOP (XCAR (*ptr)))
|
|
|
1993 ptr = &XCDR (*ptr);
|
|
|
1994 if (CONSP (*ptr) && INTP (XCAR (*ptr)))
|
|
|
1995 ptr = &XCDR (*ptr);
|
|
|
1996 return ptr;
|
|
|
1997 }
|
|
|
1998
|
|
|
1999 static Lisp_Object
|
|
|
2000 string_getprop (Lisp_Object string, Lisp_Object property)
|
|
|
2001 {
|
|
|
2002 return external_plist_get (string_plist_ptr (string), property, 0, ERROR_ME);
|
|
|
2003 }
|
|
|
2004
|
|
|
2005 static int
|
|
|
2006 string_putprop (Lisp_Object string, Lisp_Object property, Lisp_Object value)
|
|
|
2007 {
|
|
|
2008 external_plist_put (string_plist_ptr (string), property, value, 0, ERROR_ME);
|
|
|
2009 return 1;
|
|
|
2010 }
|
|
|
2011
|
|
|
2012 static int
|
|
|
2013 string_remprop (Lisp_Object string, Lisp_Object property)
|
|
|
2014 {
|
|
|
2015 return external_remprop (string_plist_ptr (string), property, 0, ERROR_ME);
|
|
|
2016 }
|
|
|
2017
|
|
|
2018 static Lisp_Object
|
|
|
2019 string_plist (Lisp_Object string)
|
|
|
2020 {
|
|
|
2021 return *string_plist_ptr (string);
|
|
|
2022 }
|
|
|
2023
|
|
|
2024 /* No `finalize', or `hash' methods.
|
|
|
2025 internal_hash() already knows how to hash strings and finalization
|
|
|
2026 is done with the ADDITIONAL_FREE_string macro, which is the
|
|
|
2027 standard way to do finalization when using
|
|
|
2028 SWEEP_FIXED_TYPE_BLOCK(). */
|
|
934
|
2029 DEFINE_BASIC_LRECORD_IMPLEMENTATION_WITH_PROPS ("string", string,
|
|
|
2030 1, /*dumpable-flag*/
|
|
|
2031 mark_string, print_string,
|
|
|
2032 0, string_equal, 0,
|
|
|
2033 string_description,
|
|
|
2034 string_getprop,
|
|
|
2035 string_putprop,
|
|
|
2036 string_remprop,
|
|
|
2037 string_plist,
|
|
|
2038 Lisp_String);
|
|
428
|
2039 /* String blocks contain this many useful bytes. */
|
|
|
2040 #define STRING_CHARS_BLOCK_SIZE \
|
|
814
|
2041 ((Bytecount) (8192 - MALLOC_OVERHEAD - \
|
|
|
2042 ((2 * sizeof (struct string_chars_block *)) \
|
|
|
2043 + sizeof (EMACS_INT))))
|
|
428
|
2044 /* Block header for small strings. */
|
|
|
2045 struct string_chars_block
|
|
|
2046 {
|
|
|
2047 EMACS_INT pos;
|
|
|
2048 struct string_chars_block *next;
|
|
|
2049 struct string_chars_block *prev;
|
|
|
2050 /* Contents of string_chars_block->string_chars are interleaved
|
|
|
2051 string_chars structures (see below) and the actual string data */
|
|
|
2052 unsigned char string_chars[STRING_CHARS_BLOCK_SIZE];
|
|
|
2053 };
|
|
|
2054
|
|
|
2055 static struct string_chars_block *first_string_chars_block;
|
|
|
2056 static struct string_chars_block *current_string_chars_block;
|
|
|
2057
|
|
|
2058 /* If SIZE is the length of a string, this returns how many bytes
|
|
|
2059 * the string occupies in string_chars_block->string_chars
|
|
|
2060 * (including alignment padding).
|
|
|
2061 */
|
|
438
|
2062 #define STRING_FULLSIZE(size) \
|
|
826
|
2063 ALIGN_FOR_TYPE (((size) + 1 + sizeof (Lisp_String *)), Lisp_String *)
|
|
428
|
2064
|
|
|
2065 #define BIG_STRING_FULLSIZE_P(fullsize) ((fullsize) >= STRING_CHARS_BLOCK_SIZE)
|
|
|
2066 #define BIG_STRING_SIZE_P(size) (BIG_STRING_FULLSIZE_P (STRING_FULLSIZE(size)))
|
|
|
2067
|
|
454
|
2068 #define STRING_CHARS_FREE_P(ptr) ((ptr)->string == NULL)
|
|
|
2069 #define MARK_STRING_CHARS_AS_FREE(ptr) ((void) ((ptr)->string = NULL))
|
|
|
2070
|
|
428
|
2071 struct string_chars
|
|
|
2072 {
|
|
438
|
2073 Lisp_String *string;
|
|
428
|
2074 unsigned char chars[1];
|
|
|
2075 };
|
|
|
2076
|
|
|
2077 struct unused_string_chars
|
|
|
2078 {
|
|
438
|
2079 Lisp_String *string;
|
|
428
|
2080 EMACS_INT fullsize;
|
|
|
2081 };
|
|
|
2082
|
|
|
2083 static void
|
|
|
2084 init_string_chars_alloc (void)
|
|
|
2085 {
|
|
|
2086 first_string_chars_block = xnew (struct string_chars_block);
|
|
|
2087 first_string_chars_block->prev = 0;
|
|
|
2088 first_string_chars_block->next = 0;
|
|
|
2089 first_string_chars_block->pos = 0;
|
|
|
2090 current_string_chars_block = first_string_chars_block;
|
|
|
2091 }
|
|
|
2092
|
|
1550
|
2093 static Ibyte *
|
|
|
2094 allocate_big_string_chars (Bytecount length)
|
|
|
2095 {
|
|
|
2096 Ibyte *p = xnew_array (Ibyte, length);
|
|
|
2097 INCREMENT_CONS_COUNTER (length, "string chars");
|
|
|
2098 return p;
|
|
|
2099 }
|
|
|
2100
|
|
428
|
2101 static struct string_chars *
|
|
793
|
2102 allocate_string_chars_struct (Lisp_Object string_it_goes_with,
|
|
814
|
2103 Bytecount fullsize)
|
|
428
|
2104 {
|
|
|
2105 struct string_chars *s_chars;
|
|
|
2106
|
|
438
|
2107 if (fullsize <=
|
|
|
2108 (countof (current_string_chars_block->string_chars)
|
|
|
2109 - current_string_chars_block->pos))
|
|
428
|
2110 {
|
|
|
2111 /* This string can fit in the current string chars block */
|
|
|
2112 s_chars = (struct string_chars *)
|
|
|
2113 (current_string_chars_block->string_chars
|
|
|
2114 + current_string_chars_block->pos);
|
|
|
2115 current_string_chars_block->pos += fullsize;
|
|
|
2116 }
|
|
|
2117 else
|
|
|
2118 {
|
|
|
2119 /* Make a new current string chars block */
|
|
|
2120 struct string_chars_block *new_scb = xnew (struct string_chars_block);
|
|
|
2121
|
|
|
2122 current_string_chars_block->next = new_scb;
|
|
|
2123 new_scb->prev = current_string_chars_block;
|
|
|
2124 new_scb->next = 0;
|
|
|
2125 current_string_chars_block = new_scb;
|
|
|
2126 new_scb->pos = fullsize;
|
|
|
2127 s_chars = (struct string_chars *)
|
|
|
2128 current_string_chars_block->string_chars;
|
|
|
2129 }
|
|
|
2130
|
|
793
|
2131 s_chars->string = XSTRING (string_it_goes_with);
|
|
428
|
2132
|
|
|
2133 INCREMENT_CONS_COUNTER (fullsize, "string chars");
|
|
|
2134
|
|
|
2135 return s_chars;
|
|
|
2136 }
|
|
|
2137
|
|
771
|
2138 #ifdef SLEDGEHAMMER_CHECK_ASCII_BEGIN
|
|
|
2139 void
|
|
|
2140 sledgehammer_check_ascii_begin (Lisp_Object str)
|
|
|
2141 {
|
|
|
2142 Bytecount i;
|
|
|
2143
|
|
|
2144 for (i = 0; i < XSTRING_LENGTH (str); i++)
|
|
|
2145 {
|
|
826
|
2146 if (!byte_ascii_p (string_byte (str, i)))
|
|
771
|
2147 break;
|
|
|
2148 }
|
|
|
2149
|
|
|
2150 assert (i == (Bytecount) XSTRING_ASCII_BEGIN (str) ||
|
|
|
2151 (i > MAX_STRING_ASCII_BEGIN &&
|
|
|
2152 (Bytecount) XSTRING_ASCII_BEGIN (str) ==
|
|
|
2153 (Bytecount) MAX_STRING_ASCII_BEGIN));
|
|
|
2154 }
|
|
|
2155 #endif
|
|
|
2156
|
|
|
2157 /* You do NOT want to be calling this! (And if you do, you must call
|
|
851
|
2158 XSET_STRING_ASCII_BEGIN() after modifying the string.) Use ALLOCA ()
|
|
771
|
2159 instead and then call make_string() like the rest of the world. */
|
|
|
2160
|
|
428
|
2161 Lisp_Object
|
|
|
2162 make_uninit_string (Bytecount length)
|
|
|
2163 {
|
|
438
|
2164 Lisp_String *s;
|
|
814
|
2165 Bytecount fullsize = STRING_FULLSIZE (length);
|
|
428
|
2166
|
|
438
|
2167 assert (length >= 0 && fullsize > 0);
|
|
428
|
2168
|
|
|
2169 /* Allocate the string header */
|
|
438
|
2170 ALLOCATE_FIXED_TYPE (string, Lisp_String, s);
|
|
793
|
2171 xzero (*s);
|
|
771
|
2172 set_lheader_implementation (&s->u.lheader, &lrecord_string);
|
|
793
|
2173
|
|
826
|
2174 set_lispstringp_data (s, BIG_STRING_FULLSIZE_P (fullsize)
|
|
1550
|
2175 ? allocate_big_string_chars (length + 1)
|
|
793
|
2176 : allocate_string_chars_struct (wrap_string (s),
|
|
|
2177 fullsize)->chars);
|
|
438
|
2178
|
|
826
|
2179 set_lispstringp_length (s, length);
|
|
428
|
2180 s->plist = Qnil;
|
|
793
|
2181 set_string_byte (wrap_string (s), length, 0);
|
|
|
2182
|
|
|
2183 return wrap_string (s);
|
|
428
|
2184 }
|
|
|
2185
|
|
|
2186 #ifdef VERIFY_STRING_CHARS_INTEGRITY
|
|
|
2187 static void verify_string_chars_integrity (void);
|
|
|
2188 #endif
|
|
|
2189
|
|
|
2190 /* Resize the string S so that DELTA bytes can be inserted starting
|
|
|
2191 at POS. If DELTA < 0, it means deletion starting at POS. If
|
|
|
2192 POS < 0, resize the string but don't copy any characters. Use
|
|
|
2193 this if you're planning on completely overwriting the string.
|
|
|
2194 */
|
|
|
2195
|
|
|
2196 void
|
|
793
|
2197 resize_string (Lisp_Object s, Bytecount pos, Bytecount delta)
|
|
428
|
2198 {
|
|
438
|
2199 Bytecount oldfullsize, newfullsize;
|
|
428
|
2200 #ifdef VERIFY_STRING_CHARS_INTEGRITY
|
|
|
2201 verify_string_chars_integrity ();
|
|
|
2202 #endif
|
|
|
2203
|
|
800
|
2204 #ifdef ERROR_CHECK_TEXT
|
|
428
|
2205 if (pos >= 0)
|
|
|
2206 {
|
|
793
|
2207 assert (pos <= XSTRING_LENGTH (s));
|
|
428
|
2208 if (delta < 0)
|
|
793
|
2209 assert (pos + (-delta) <= XSTRING_LENGTH (s));
|
|
428
|
2210 }
|
|
|
2211 else
|
|
|
2212 {
|
|
|
2213 if (delta < 0)
|
|
793
|
2214 assert ((-delta) <= XSTRING_LENGTH (s));
|
|
428
|
2215 }
|
|
800
|
2216 #endif /* ERROR_CHECK_TEXT */
|
|
428
|
2217
|
|
|
2218 if (delta == 0)
|
|
|
2219 /* simplest case: no size change. */
|
|
|
2220 return;
|
|
438
|
2221
|
|
|
2222 if (pos >= 0 && delta < 0)
|
|
|
2223 /* If DELTA < 0, the functions below will delete the characters
|
|
|
2224 before POS. We want to delete characters *after* POS, however,
|
|
|
2225 so convert this to the appropriate form. */
|
|
|
2226 pos += -delta;
|
|
|
2227
|
|
793
|
2228 oldfullsize = STRING_FULLSIZE (XSTRING_LENGTH (s));
|
|
|
2229 newfullsize = STRING_FULLSIZE (XSTRING_LENGTH (s) + delta);
|
|
438
|
2230
|
|
|
2231 if (BIG_STRING_FULLSIZE_P (oldfullsize))
|
|
428
|
2232 {
|
|
438
|
2233 if (BIG_STRING_FULLSIZE_P (newfullsize))
|
|
428
|
2234 {
|
|
440
|
2235 /* Both strings are big. We can just realloc().
|
|
|
2236 But careful! If the string is shrinking, we have to
|
|
|
2237 memmove() _before_ realloc(), and if growing, we have to
|
|
|
2238 memmove() _after_ realloc() - otherwise the access is
|
|
|
2239 illegal, and we might crash. */
|
|
793
|
2240 Bytecount len = XSTRING_LENGTH (s) + 1 - pos;
|
|
440
|
2241
|
|
|
2242 if (delta < 0 && pos >= 0)
|
|
793
|
2243 memmove (XSTRING_DATA (s) + pos + delta,
|
|
|
2244 XSTRING_DATA (s) + pos, len);
|
|
|
2245 XSET_STRING_DATA
|
|
867
|
2246 (s, (Ibyte *) xrealloc (XSTRING_DATA (s),
|
|
793
|
2247 XSTRING_LENGTH (s) + delta + 1));
|
|
440
|
2248 if (delta > 0 && pos >= 0)
|
|
793
|
2249 memmove (XSTRING_DATA (s) + pos + delta, XSTRING_DATA (s) + pos,
|
|
|
2250 len);
|
|
1550
|
2251 /* Bump the cons counter.
|
|
|
2252 Conservative; Martin let the increment be delta. */
|
|
|
2253 INCREMENT_CONS_COUNTER (newfullsize, "string chars");
|
|
428
|
2254 }
|
|
438
|
2255 else /* String has been demoted from BIG_STRING. */
|
|
428
|
2256 {
|
|
867
|
2257 Ibyte *new_data =
|
|
438
|
2258 allocate_string_chars_struct (s, newfullsize)->chars;
|
|
867
|
2259 Ibyte *old_data = XSTRING_DATA (s);
|
|
438
|
2260
|
|
|
2261 if (pos >= 0)
|
|
|
2262 {
|
|
|
2263 memcpy (new_data, old_data, pos);
|
|
|
2264 memcpy (new_data + pos + delta, old_data + pos,
|
|
793
|
2265 XSTRING_LENGTH (s) + 1 - pos);
|
|
438
|
2266 }
|
|
793
|
2267 XSET_STRING_DATA (s, new_data);
|
|
438
|
2268 xfree (old_data);
|
|
|
2269 }
|
|
|
2270 }
|
|
|
2271 else /* old string is small */
|
|
|
2272 {
|
|
|
2273 if (oldfullsize == newfullsize)
|
|
|
2274 {
|
|
|
2275 /* special case; size change but the necessary
|
|
|
2276 allocation size won't change (up or down; code
|
|
|
2277 somewhere depends on there not being any unused
|
|
|
2278 allocation space, modulo any alignment
|
|
|
2279 constraints). */
|
|
428
|
2280 if (pos >= 0)
|
|
|
2281 {
|
|
867
|
2282 Ibyte *addroff = pos + XSTRING_DATA (s);
|
|
428
|
2283
|
|
|
2284 memmove (addroff + delta, addroff,
|
|
|
2285 /* +1 due to zero-termination. */
|
|
793
|
2286 XSTRING_LENGTH (s) + 1 - pos);
|
|
428
|
2287 }
|
|
|
2288 }
|
|
|
2289 else
|
|
|
2290 {
|
|
867
|
2291 Ibyte *old_data = XSTRING_DATA (s);
|
|
|
2292 Ibyte *new_data =
|
|
438
|
2293 BIG_STRING_FULLSIZE_P (newfullsize)
|
|
1550
|
2294 ? allocate_big_string_chars (XSTRING_LENGTH (s) + delta + 1)
|
|
438
|
2295 : allocate_string_chars_struct (s, newfullsize)->chars;
|
|
|
2296
|
|
428
|
2297 if (pos >= 0)
|
|
|
2298 {
|
|
438
|
2299 memcpy (new_data, old_data, pos);
|
|
|
2300 memcpy (new_data + pos + delta, old_data + pos,
|
|
793
|
2301 XSTRING_LENGTH (s) + 1 - pos);
|
|
428
|
2302 }
|
|
793
|
2303 XSET_STRING_DATA (s, new_data);
|
|
438
|
2304
|
|
|
2305 {
|
|
|
2306 /* We need to mark this chunk of the string_chars_block
|
|
|
2307 as unused so that compact_string_chars() doesn't
|
|
|
2308 freak. */
|
|
|
2309 struct string_chars *old_s_chars = (struct string_chars *)
|
|
|
2310 ((char *) old_data - offsetof (struct string_chars, chars));
|
|
|
2311 /* Sanity check to make sure we aren't hosed by strange
|
|
|
2312 alignment/padding. */
|
|
793
|
2313 assert (old_s_chars->string == XSTRING (s));
|
|
454
|
2314 MARK_STRING_CHARS_AS_FREE (old_s_chars);
|
|
438
|
2315 ((struct unused_string_chars *) old_s_chars)->fullsize =
|
|
|
2316 oldfullsize;
|
|
|
2317 }
|
|
428
|
2318 }
|
|
438
|
2319 }
|
|
|
2320
|
|
793
|
2321 XSET_STRING_LENGTH (s, XSTRING_LENGTH (s) + delta);
|
|
438
|
2322 /* If pos < 0, the string won't be zero-terminated.
|
|
|
2323 Terminate now just to make sure. */
|
|
793
|
2324 XSTRING_DATA (s)[XSTRING_LENGTH (s)] = '\0';
|
|
438
|
2325
|
|
|
2326 if (pos >= 0)
|
|
793
|
2327 /* We also have to adjust all of the extent indices after the
|
|
|
2328 place we did the change. We say "pos - 1" because
|
|
|
2329 adjust_extents() is exclusive of the starting position
|
|
|
2330 passed to it. */
|
|
|
2331 adjust_extents (s, pos - 1, XSTRING_LENGTH (s), delta);
|
|
428
|
2332
|
|
|
2333 #ifdef VERIFY_STRING_CHARS_INTEGRITY
|
|
|
2334 verify_string_chars_integrity ();
|
|
|
2335 #endif
|
|
|
2336 }
|
|
|
2337
|
|
|
2338 #ifdef MULE
|
|
|
2339
|
|
771
|
2340 /* WARNING: If you modify an existing string, you must call
|
|
|
2341 CHECK_LISP_WRITEABLE() before and bump_string_modiff() afterwards. */
|
|
428
|
2342 void
|
|
867
|
2343 set_string_char (Lisp_Object s, Charcount i, Ichar c)
|
|
428
|
2344 {
|
|
867
|
2345 Ibyte newstr[MAX_ICHAR_LEN];
|
|
771
|
2346 Bytecount bytoff = string_index_char_to_byte (s, i);
|
|
867
|
2347 Bytecount oldlen = itext_ichar_len (XSTRING_DATA (s) + bytoff);
|
|
|
2348 Bytecount newlen = set_itext_ichar (newstr, c);
|
|
428
|
2349
|
|
793
|
2350 sledgehammer_check_ascii_begin (s);
|
|
428
|
2351 if (oldlen != newlen)
|
|
|
2352 resize_string (s, bytoff, newlen - oldlen);
|
|
793
|
2353 /* Remember, XSTRING_DATA (s) might have changed so we can't cache it. */
|
|
|
2354 memcpy (XSTRING_DATA (s) + bytoff, newstr, newlen);
|
|
771
|
2355 if (oldlen != newlen)
|
|
|
2356 {
|
|
793
|
2357 if (newlen > 1 && i <= (Charcount) XSTRING_ASCII_BEGIN (s))
|
|
771
|
2358 /* Everything starting with the new char is no longer part of
|
|
|
2359 ascii_begin */
|
|
793
|
2360 XSET_STRING_ASCII_BEGIN (s, i);
|
|
|
2361 else if (newlen == 1 && i == (Charcount) XSTRING_ASCII_BEGIN (s))
|
|
771
|
2362 /* We've extended ascii_begin, and we have to figure out how much by */
|
|
|
2363 {
|
|
|
2364 Bytecount j;
|
|
814
|
2365 for (j = (Bytecount) i + 1; j < XSTRING_LENGTH (s); j++)
|
|
771
|
2366 {
|
|
826
|
2367 if (!byte_ascii_p (XSTRING_DATA (s)[j]))
|
|
771
|
2368 break;
|
|
|
2369 }
|
|
814
|
2370 XSET_STRING_ASCII_BEGIN (s, min (j, (Bytecount) MAX_STRING_ASCII_BEGIN));
|
|
771
|
2371 }
|
|
|
2372 }
|
|
793
|
2373 sledgehammer_check_ascii_begin (s);
|
|
428
|
2374 }
|
|
|
2375
|
|
|
2376 #endif /* MULE */
|
|
|
2377
|
|
|
2378 DEFUN ("make-string", Fmake_string, 2, 2, 0, /*
|
|
444
|
2379 Return a new string consisting of LENGTH copies of CHARACTER.
|
|
|
2380 LENGTH must be a non-negative integer.
|
|
428
|
2381 */
|
|
444
|
2382 (length, character))
|
|
428
|
2383 {
|
|
|
2384 CHECK_NATNUM (length);
|
|
444
|
2385 CHECK_CHAR_COERCE_INT (character);
|
|
428
|
2386 {
|
|
867
|
2387 Ibyte init_str[MAX_ICHAR_LEN];
|
|
|
2388 int len = set_itext_ichar (init_str, XCHAR (character));
|
|
428
|
2389 Lisp_Object val = make_uninit_string (len * XINT (length));
|
|
|
2390
|
|
|
2391 if (len == 1)
|
|
771
|
2392 {
|
|
|
2393 /* Optimize the single-byte case */
|
|
|
2394 memset (XSTRING_DATA (val), XCHAR (character), XSTRING_LENGTH (val));
|
|
793
|
2395 XSET_STRING_ASCII_BEGIN (val, min (MAX_STRING_ASCII_BEGIN,
|
|
|
2396 len * XINT (length)));
|
|
771
|
2397 }
|
|
428
|
2398 else
|
|
|
2399 {
|
|
647
|
2400 EMACS_INT i;
|
|
867
|
2401 Ibyte *ptr = XSTRING_DATA (val);
|
|
428
|
2402
|
|
|
2403 for (i = XINT (length); i; i--)
|
|
|
2404 {
|
|
867
|
2405 Ibyte *init_ptr = init_str;
|
|
428
|
2406 switch (len)
|
|
|
2407 {
|
|
|
2408 case 4: *ptr++ = *init_ptr++;
|
|
|
2409 case 3: *ptr++ = *init_ptr++;
|
|
|
2410 case 2: *ptr++ = *init_ptr++;
|
|
|
2411 case 1: *ptr++ = *init_ptr++;
|
|
|
2412 }
|
|
|
2413 }
|
|
|
2414 }
|
|
771
|
2415 sledgehammer_check_ascii_begin (val);
|
|
428
|
2416 return val;
|
|
|
2417 }
|
|
|
2418 }
|
|
|
2419
|
|
|
2420 DEFUN ("string", Fstring, 0, MANY, 0, /*
|
|
|
2421 Concatenate all the argument characters and make the result a string.
|
|
|
2422 */
|
|
|
2423 (int nargs, Lisp_Object *args))
|
|
|
2424 {
|
|
867
|
2425 Ibyte *storage = alloca_array (Ibyte, nargs * MAX_ICHAR_LEN);
|
|
|
2426 Ibyte *p = storage;
|
|
428
|
2427
|
|
|
2428 for (; nargs; nargs--, args++)
|
|
|
2429 {
|
|
|
2430 Lisp_Object lisp_char = *args;
|
|
|
2431 CHECK_CHAR_COERCE_INT (lisp_char);
|
|
867
|
2432 p += set_itext_ichar (p, XCHAR (lisp_char));
|
|
428
|
2433 }
|
|
|
2434 return make_string (storage, p - storage);
|
|
|
2435 }
|
|
|
2436
|
|
771
|
2437 /* Initialize the ascii_begin member of a string to the correct value. */
|
|
|
2438
|
|
|
2439 void
|
|
|
2440 init_string_ascii_begin (Lisp_Object string)
|
|
|
2441 {
|
|
|
2442 #ifdef MULE
|
|
|
2443 int i;
|
|
|
2444 Bytecount length = XSTRING_LENGTH (string);
|
|
867
|
2445 Ibyte *contents = XSTRING_DATA (string);
|
|
771
|
2446
|
|
|
2447 for (i = 0; i < length; i++)
|
|
|
2448 {
|
|
826
|
2449 if (!byte_ascii_p (contents[i]))
|
|
771
|
2450 break;
|
|
|
2451 }
|
|
793
|
2452 XSET_STRING_ASCII_BEGIN (string, min (i, MAX_STRING_ASCII_BEGIN));
|
|
771
|
2453 #else
|
|
793
|
2454 XSET_STRING_ASCII_BEGIN (string, min (XSTRING_LENGTH (string),
|
|
|
2455 MAX_STRING_ASCII_BEGIN));
|
|
771
|
2456 #endif
|
|
|
2457 sledgehammer_check_ascii_begin (string);
|
|
|
2458 }
|
|
428
|
2459
|
|
|
2460 /* Take some raw memory, which MUST already be in internal format,
|
|
|
2461 and package it up into a Lisp string. */
|
|
|
2462 Lisp_Object
|
|
867
|
2463 make_string (const Ibyte *contents, Bytecount length)
|
|
428
|
2464 {
|
|
|
2465 Lisp_Object val;
|
|
|
2466
|
|
|
2467 /* Make sure we find out about bad make_string's when they happen */
|
|
800
|
2468 #if defined (ERROR_CHECK_TEXT) && defined (MULE)
|
|
428
|
2469 bytecount_to_charcount (contents, length); /* Just for the assertions */
|
|
|
2470 #endif
|
|
|
2471
|
|
|
2472 val = make_uninit_string (length);
|
|
|
2473 memcpy (XSTRING_DATA (val), contents, length);
|
|
771
|
2474 init_string_ascii_begin (val);
|
|
|
2475 sledgehammer_check_ascii_begin (val);
|
|
428
|
2476 return val;
|
|
|
2477 }
|
|
|
2478
|
|
|
2479 /* Take some raw memory, encoded in some external data format,
|
|
|
2480 and convert it into a Lisp string. */
|
|
|
2481 Lisp_Object
|
|
442
|
2482 make_ext_string (const Extbyte *contents, EMACS_INT length,
|
|
440
|
2483 Lisp_Object coding_system)
|
|
428
|
2484 {
|
|
440
|
2485 Lisp_Object string;
|
|
|
2486 TO_INTERNAL_FORMAT (DATA, (contents, length),
|
|
|
2487 LISP_STRING, string,
|
|
|
2488 coding_system);
|
|
|
2489 return string;
|
|
428
|
2490 }
|
|
|
2491
|
|
|
2492 Lisp_Object
|
|
867
|
2493 build_intstring (const Ibyte *str)
|
|
771
|
2494 {
|
|
|
2495 /* Some strlen's crash and burn if passed null. */
|
|
814
|
2496 return make_string (str, (str ? qxestrlen (str) : (Bytecount) 0));
|
|
771
|
2497 }
|
|
|
2498
|
|
|
2499 Lisp_Object
|
|
867
|
2500 build_string (const CIbyte *str)
|
|
428
|
2501 {
|
|
|
2502 /* Some strlen's crash and burn if passed null. */
|
|
867
|
2503 return make_string ((const Ibyte *) str, (str ? strlen (str) : 0));
|
|
428
|
2504 }
|
|
|
2505
|
|
|
2506 Lisp_Object
|
|
593
|
2507 build_ext_string (const Extbyte *str, Lisp_Object coding_system)
|
|
428
|
2508 {
|
|
|
2509 /* Some strlen's crash and burn if passed null. */
|
|
442
|
2510 return make_ext_string ((const Extbyte *) str, (str ? strlen(str) : 0),
|
|
440
|
2511 coding_system);
|
|
428
|
2512 }
|
|
|
2513
|
|
|
2514 Lisp_Object
|
|
867
|
2515 build_msg_intstring (const Ibyte *str)
|
|
428
|
2516 {
|
|
771
|
2517 return build_intstring (GETTEXT (str));
|
|
|
2518 }
|
|
|
2519
|
|
|
2520 Lisp_Object
|
|
867
|
2521 build_msg_string (const CIbyte *str)
|
|
771
|
2522 {
|
|
|
2523 return build_string (CGETTEXT (str));
|
|
428
|
2524 }
|
|
|
2525
|
|
|
2526 Lisp_Object
|
|
867
|
2527 make_string_nocopy (const Ibyte *contents, Bytecount length)
|
|
428
|
2528 {
|
|
438
|
2529 Lisp_String *s;
|
|
428
|
2530 Lisp_Object val;
|
|
|
2531
|
|
|
2532 /* Make sure we find out about bad make_string_nocopy's when they happen */
|
|
800
|
2533 #if defined (ERROR_CHECK_TEXT) && defined (MULE)
|
|
428
|
2534 bytecount_to_charcount (contents, length); /* Just for the assertions */
|
|
|
2535 #endif
|
|
|
2536
|
|
|
2537 /* Allocate the string header */
|
|
438
|
2538 ALLOCATE_FIXED_TYPE (string, Lisp_String, s);
|
|
771
|
2539 set_lheader_implementation (&s->u.lheader, &lrecord_string);
|
|
|
2540 SET_C_READONLY_RECORD_HEADER (&s->u.lheader);
|
|
428
|
2541 s->plist = Qnil;
|
|
867
|
2542 set_lispstringp_data (s, (Ibyte *) contents);
|
|
826
|
2543 set_lispstringp_length (s, length);
|
|
793
|
2544 val = wrap_string (s);
|
|
771
|
2545 init_string_ascii_begin (val);
|
|
|
2546 sledgehammer_check_ascii_begin (val);
|
|
|
2547
|
|
428
|
2548 return val;
|
|
|
2549 }
|
|
|
2550
|
|
|
2551
|
|
|
2552 /************************************************************************/
|
|
|
2553 /* lcrecord lists */
|
|
|
2554 /************************************************************************/
|
|
|
2555
|
|
|
2556 /* Lcrecord lists are used to manage the allocation of particular
|
|
1204
|
2557 sorts of lcrecords, to avoid calling basic_alloc_lcrecord() (and thus
|
|
428
|
2558 malloc() and garbage-collection junk) as much as possible.
|
|
|
2559 It is similar to the Blocktype class.
|
|
|
2560
|
|
1204
|
2561 See detailed comment in lcrecord.h.
|
|
|
2562 */
|
|
|
2563
|
|
|
2564 const struct memory_description free_description[] = {
|
|
|
2565 { XD_LISP_OBJECT, offsetof (struct free_lcrecord_header, chain), 0, 0,
|
|
|
2566 XD_FLAG_FREE_LISP_OBJECT },
|
|
|
2567 { XD_END }
|
|
|
2568 };
|
|
|
2569
|
|
|
2570 DEFINE_LRECORD_IMPLEMENTATION ("free", free,
|
|
|
2571 0, /*dumpable-flag*/
|
|
|
2572 0, internal_object_printer,
|
|
|
2573 0, 0, 0, free_description,
|
|
|
2574 struct free_lcrecord_header);
|
|
|
2575
|
|
|
2576 const struct memory_description lcrecord_list_description[] = {
|
|
|
2577 { XD_LISP_OBJECT, offsetof (struct lcrecord_list, free), 0, 0,
|
|
|
2578 XD_FLAG_FREE_LISP_OBJECT },
|
|
|
2579 { XD_END }
|
|
|
2580 };
|
|
428
|
2581
|
|
|
2582 static Lisp_Object
|
|
|
2583 mark_lcrecord_list (Lisp_Object obj)
|
|
|
2584 {
|
|
|
2585 struct lcrecord_list *list = XLCRECORD_LIST (obj);
|
|
|
2586 Lisp_Object chain = list->free;
|
|
|
2587
|
|
|
2588 while (!NILP (chain))
|
|
|
2589 {
|
|
|
2590 struct lrecord_header *lheader = XRECORD_LHEADER (chain);
|
|
|
2591 struct free_lcrecord_header *free_header =
|
|
|
2592 (struct free_lcrecord_header *) lheader;
|
|
|
2593
|
|
442
|
2594 gc_checking_assert
|
|
|
2595 (/* There should be no other pointers to the free list. */
|
|
|
2596 ! MARKED_RECORD_HEADER_P (lheader)
|
|
|
2597 &&
|
|
|
2598 /* Only lcrecords should be here. */
|
|
1204
|
2599 ! list->implementation->basic_p
|
|
442
|
2600 &&
|
|
|
2601 /* Only free lcrecords should be here. */
|
|
|
2602 free_header->lcheader.free
|
|
|
2603 &&
|
|
|
2604 /* The type of the lcrecord must be right. */
|
|
1204
|
2605 lheader->type == lrecord_type_free
|
|
442
|
2606 &&
|
|
|
2607 /* So must the size. */
|
|
1204
|
2608 (list->implementation->static_size == 0 ||
|
|
|
2609 list->implementation->static_size == list->size)
|
|
442
|
2610 );
|
|
428
|
2611
|
|
|
2612 MARK_RECORD_HEADER (lheader);
|
|
|
2613 chain = free_header->chain;
|
|
|
2614 }
|
|
|
2615
|
|
|
2616 return Qnil;
|
|
|
2617 }
|
|
|
2618
|
|
934
|
2619 DEFINE_LRECORD_IMPLEMENTATION ("lcrecord-list", lcrecord_list,
|
|
|
2620 0, /*dumpable-flag*/
|
|
|
2621 mark_lcrecord_list, internal_object_printer,
|
|
1204
|
2622 0, 0, 0, lcrecord_list_description,
|
|
|
2623 struct lcrecord_list);
|
|
934
|
2624
|
|
428
|
2625 Lisp_Object
|
|
665
|
2626 make_lcrecord_list (Elemcount size,
|
|
442
|
2627 const struct lrecord_implementation *implementation)
|
|
428
|
2628 {
|
|
1204
|
2629 /* Don't use alloc_lcrecord_type() avoid infinite recursion
|
|
|
2630 allocating this, */
|
|
|
2631 struct lcrecord_list *p = (struct lcrecord_list *)
|
|
|
2632 basic_alloc_lcrecord (sizeof (struct lcrecord_list),
|
|
|
2633 &lrecord_lcrecord_list);
|
|
428
|
2634
|
|
|
2635 p->implementation = implementation;
|
|
|
2636 p->size = size;
|
|
|
2637 p->free = Qnil;
|
|
793
|
2638 return wrap_lcrecord_list (p);
|
|
428
|
2639 }
|
|
|
2640
|
|
|
2641 Lisp_Object
|
|
1204
|
2642 alloc_managed_lcrecord (Lisp_Object lcrecord_list)
|
|
428
|
2643 {
|
|
|
2644 struct lcrecord_list *list = XLCRECORD_LIST (lcrecord_list);
|
|
|
2645 if (!NILP (list->free))
|
|
|
2646 {
|
|
|
2647 Lisp_Object val = list->free;
|
|
|
2648 struct free_lcrecord_header *free_header =
|
|
|
2649 (struct free_lcrecord_header *) XPNTR (val);
|
|
1204
|
2650 struct lrecord_header *lheader = &free_header->lcheader.lheader;
|
|
428
|
2651
|
|
|
2652 #ifdef ERROR_CHECK_GC
|
|
1204
|
2653 /* Major overkill here. */
|
|
428
|
2654 /* There should be no other pointers to the free list. */
|
|
442
|
2655 assert (! MARKED_RECORD_HEADER_P (lheader));
|
|
428
|
2656 /* Only free lcrecords should be here. */
|
|
|
2657 assert (free_header->lcheader.free);
|
|
1204
|
2658 assert (lheader->type == lrecord_type_free);
|
|
|
2659 /* Only lcrecords should be here. */
|
|
|
2660 assert (! (list->implementation->basic_p));
|
|
|
2661 #if 0 /* Not used anymore, now that we set the type of the header to
|
|
|
2662 lrecord_type_free. */
|
|
428
|
2663 /* The type of the lcrecord must be right. */
|
|
442
|
2664 assert (LHEADER_IMPLEMENTATION (lheader) == list->implementation);
|
|
1204
|
2665 #endif /* 0 */
|
|
428
|
2666 /* So must the size. */
|
|
1204
|
2667 assert (list->implementation->static_size == 0 ||
|
|
|
2668 list->implementation->static_size == list->size);
|
|
428
|
2669 #endif /* ERROR_CHECK_GC */
|
|
442
|
2670
|
|
428
|
2671 list->free = free_header->chain;
|
|
|
2672 free_header->lcheader.free = 0;
|
|
1204
|
2673 /* Put back the correct type, as we set it to lrecord_type_free. */
|
|
|
2674 lheader->type = list->implementation->lrecord_type_index;
|
|
|
2675 zero_sized_lcrecord (free_header, list->size);
|
|
428
|
2676 return val;
|
|
|
2677 }
|
|
|
2678 else
|
|
1204
|
2679 return wrap_pointer_1 (basic_alloc_lcrecord (list->size,
|
|
|
2680 list->implementation));
|
|
428
|
2681 }
|
|
|
2682
|
|
771
|
2683 /* "Free" a Lisp object LCRECORD by placing it on its associated free list
|
|
1204
|
2684 LCRECORD_LIST; next time alloc_managed_lcrecord() is called with the
|
|
771
|
2685 same LCRECORD_LIST as its parameter, it will return an object from the
|
|
|
2686 free list, which may be this one. Be VERY VERY SURE there are no
|
|
|
2687 pointers to this object hanging around anywhere where they might be
|
|
|
2688 used!
|
|
|
2689
|
|
|
2690 The first thing this does before making any global state change is to
|
|
|
2691 call the finalize method of the object, if it exists. */
|
|
|
2692
|
|
428
|
2693 void
|
|
|
2694 free_managed_lcrecord (Lisp_Object lcrecord_list, Lisp_Object lcrecord)
|
|
|
2695 {
|
|
|
2696 struct lcrecord_list *list = XLCRECORD_LIST (lcrecord_list);
|
|
|
2697 struct free_lcrecord_header *free_header =
|
|
|
2698 (struct free_lcrecord_header *) XPNTR (lcrecord);
|
|
442
|
2699 struct lrecord_header *lheader = &free_header->lcheader.lheader;
|
|
|
2700 const struct lrecord_implementation *implementation
|
|
428
|
2701 = LHEADER_IMPLEMENTATION (lheader);
|
|
|
2702
|
|
771
|
2703 /* Finalizer methods may try to free objects within them, which typically
|
|
|
2704 won't be marked and thus are scheduled for demolition. Putting them
|
|
|
2705 on the free list would be very bad, as we'd have xfree()d memory in
|
|
|
2706 the list. Even if for some reason the objects are still live
|
|
|
2707 (generally a logic error!), we still will have problems putting such
|
|
|
2708 an object on the free list right now (e.g. we'd have to avoid calling
|
|
|
2709 the finalizer twice, etc.). So basically, those finalizers should not
|
|
|
2710 be freeing any objects if during GC. Abort now to catch those
|
|
|
2711 problems. */
|
|
|
2712 gc_checking_assert (!gc_in_progress);
|
|
|
2713
|
|
428
|
2714 /* Make sure the size is correct. This will catch, for example,
|
|
|
2715 putting a window configuration on the wrong free list. */
|
|
1204
|
2716 gc_checking_assert (detagged_lisp_object_size (lheader) == list->size);
|
|
771
|
2717 /* Make sure the object isn't already freed. */
|
|
|
2718 gc_checking_assert (!free_header->lcheader.free);
|
|
|
2719
|
|
428
|
2720 if (implementation->finalizer)
|
|
|
2721 implementation->finalizer (lheader, 0);
|
|
1204
|
2722 /* Yes, there are two ways to indicate freeness -- the type is
|
|
|
2723 lrecord_type_free or the ->free flag is set. We used to do only the
|
|
|
2724 latter; now we do the former as well for KKCC purposes. Probably
|
|
|
2725 safer in any case, as we will lose quicker this way than keeping
|
|
|
2726 around an lrecord of apparently correct type but bogus junk in it. */
|
|
|
2727 MARK_LRECORD_AS_FREE (lheader);
|
|
428
|
2728 free_header->chain = list->free;
|
|
|
2729 free_header->lcheader.free = 1;
|
|
|
2730 list->free = lcrecord;
|
|
|
2731 }
|
|
|
2732
|
|
771
|
2733 static Lisp_Object all_lcrecord_lists[countof (lrecord_implementations_table)];
|
|
|
2734
|
|
|
2735 void *
|
|
|
2736 alloc_automanaged_lcrecord (Bytecount size,
|
|
|
2737 const struct lrecord_implementation *imp)
|
|
|
2738 {
|
|
|
2739 if (EQ (all_lcrecord_lists[imp->lrecord_type_index], Qzero))
|
|
|
2740 all_lcrecord_lists[imp->lrecord_type_index] =
|
|
|
2741 make_lcrecord_list (size, imp);
|
|
|
2742
|
|
1204
|
2743 return XPNTR (alloc_managed_lcrecord
|
|
771
|
2744 (all_lcrecord_lists[imp->lrecord_type_index]));
|
|
|
2745 }
|
|
|
2746
|
|
|
2747 void
|
|
|
2748 free_lcrecord (Lisp_Object rec)
|
|
|
2749 {
|
|
|
2750 int type = XRECORD_LHEADER (rec)->type;
|
|
|
2751
|
|
|
2752 assert (!EQ (all_lcrecord_lists[type], Qzero));
|
|
|
2753
|
|
|
2754 free_managed_lcrecord (all_lcrecord_lists[type], rec);
|
|
|
2755 }
|
|
428
|
2756
|
|
|
2757
|
|
|
2758 DEFUN ("purecopy", Fpurecopy, 1, 1, 0, /*
|
|
|
2759 Kept for compatibility, returns its argument.
|
|
|
2760 Old:
|
|
|
2761 Make a copy of OBJECT in pure storage.
|
|
|
2762 Recursively copies contents of vectors and cons cells.
|
|
|
2763 Does not copy symbols.
|
|
|
2764 */
|
|
444
|
2765 (object))
|
|
428
|
2766 {
|
|
444
|
2767 return object;
|
|
428
|
2768 }
|
|
|
2769
|
|
|
2770
|
|
|
2771 /************************************************************************/
|
|
|
2772 /* Garbage Collection */
|
|
|
2773 /************************************************************************/
|
|
|
2774
|
|
442
|
2775 /* All the built-in lisp object types are enumerated in `enum lrecord_type'.
|
|
|
2776 Additional ones may be defined by a module (none yet). We leave some
|
|
|
2777 room in `lrecord_implementations_table' for such new lisp object types. */
|
|
647
|
2778 const struct lrecord_implementation *lrecord_implementations_table[(int)lrecord_type_last_built_in_type + MODULE_DEFINABLE_TYPE_COUNT];
|
|
|
2779 int lrecord_type_count = lrecord_type_last_built_in_type;
|
|
442
|
2780 /* Object marker functions are in the lrecord_implementation structure.
|
|
|
2781 But copying them to a parallel array is much more cache-friendly.
|
|
|
2782 This hack speeds up (garbage-collect) by about 5%. */
|
|
|
2783 Lisp_Object (*lrecord_markers[countof (lrecord_implementations_table)]) (Lisp_Object);
|
|
428
|
2784
|
|
|
2785 struct gcpro *gcprolist;
|
|
|
2786
|
|
771
|
2787 /* We want the staticpro list relocated, but not the pointers found
|
|
|
2788 therein, because they refer to locations in the global data segment, not
|
|
|
2789 in the heap; we only dump heap objects. Hence we use a trivial
|
|
|
2790 description, as for pointerless objects. (Note that the data segment
|
|
|
2791 objects, which are global variables like Qfoo or Vbar, themselves are
|
|
|
2792 pointers to heap objects. Each needs to be described to pdump as a
|
|
|
2793 "root pointer"; this happens in the call to staticpro(). */
|
|
1204
|
2794 static const struct memory_description staticpro_description_1[] = {
|
|
452
|
2795 { XD_END }
|
|
|
2796 };
|
|
|
2797
|
|
1204
|
2798 static const struct sized_memory_description staticpro_description = {
|
|
452
|
2799 sizeof (Lisp_Object *),
|
|
|
2800 staticpro_description_1
|
|
|
2801 };
|
|
|
2802
|
|
1204
|
2803 static const struct memory_description staticpros_description_1[] = {
|
|
452
|
2804 XD_DYNARR_DESC (Lisp_Object_ptr_dynarr, &staticpro_description),
|
|
|
2805 { XD_END }
|
|
|
2806 };
|
|
|
2807
|
|
1204
|
2808 static const struct sized_memory_description staticpros_description = {
|
|
452
|
2809 sizeof (Lisp_Object_ptr_dynarr),
|
|
|
2810 staticpros_description_1
|
|
|
2811 };
|
|
|
2812
|
|
771
|
2813 #ifdef DEBUG_XEMACS
|
|
|
2814
|
|
1204
|
2815 static const struct memory_description staticpro_one_name_description_1[] = {
|
|
771
|
2816 { XD_C_STRING, 0 },
|
|
|
2817 { XD_END }
|
|
|
2818 };
|
|
|
2819
|
|
1204
|
2820 static const struct sized_memory_description staticpro_one_name_description = {
|
|
771
|
2821 sizeof (char *),
|
|
|
2822 staticpro_one_name_description_1
|
|
|
2823 };
|
|
|
2824
|
|
1204
|
2825 static const struct memory_description staticpro_names_description_1[] = {
|
|
771
|
2826 XD_DYNARR_DESC (char_ptr_dynarr, &staticpro_one_name_description),
|
|
|
2827 { XD_END }
|
|
|
2828 };
|
|
|
2829
|
|
1204
|
2830
|
|
|
2831 extern const struct sized_memory_description staticpro_names_description;
|
|
|
2832
|
|
|
2833 const struct sized_memory_description staticpro_names_description = {
|
|
771
|
2834 sizeof (char_ptr_dynarr),
|
|
|
2835 staticpro_names_description_1
|
|
|
2836 };
|
|
|
2837
|
|
|
2838 /* Help debug crashes gc-marking a staticpro'ed object. */
|
|
|
2839
|
|
|
2840 Lisp_Object_ptr_dynarr *staticpros;
|
|
|
2841 char_ptr_dynarr *staticpro_names;
|
|
|
2842
|
|
|
2843 /* Mark the Lisp_Object at non-heap VARADDRESS as a root object for
|
|
|
2844 garbage collection, and for dumping. */
|
|
|
2845 void
|
|
|
2846 staticpro_1 (Lisp_Object *varaddress, char *varname)
|
|
|
2847 {
|
|
|
2848 Dynarr_add (staticpros, varaddress);
|
|
|
2849 Dynarr_add (staticpro_names, varname);
|
|
1204
|
2850 dump_add_root_lisp_object (varaddress);
|
|
771
|
2851 }
|
|
|
2852
|
|
|
2853
|
|
|
2854 Lisp_Object_ptr_dynarr *staticpros_nodump;
|
|
|
2855 char_ptr_dynarr *staticpro_nodump_names;
|
|
|
2856
|
|
|
2857 /* Mark the Lisp_Object at heap VARADDRESS as a root object for
|
|
|
2858 garbage collection, but not for dumping. (See below.) */
|
|
|
2859 void
|
|
|
2860 staticpro_nodump_1 (Lisp_Object *varaddress, char *varname)
|
|
|
2861 {
|
|
|
2862 Dynarr_add (staticpros_nodump, varaddress);
|
|
|
2863 Dynarr_add (staticpro_nodump_names, varname);
|
|
|
2864 }
|
|
|
2865
|
|
996
|
2866 #ifdef HAVE_SHLIB
|
|
|
2867 /* Stop treating the Lisp_Object at non-heap VARADDRESS as a root object
|
|
|
2868 for garbage collection, but not for dumping. */
|
|
|
2869 void
|
|
|
2870 unstaticpro_nodump_1 (Lisp_Object *varaddress, char *varname)
|
|
|
2871 {
|
|
|
2872 Dynarr_delete_object (staticpros, varaddress);
|
|
|
2873 Dynarr_delete_object (staticpro_names, varname);
|
|
|
2874 }
|
|
|
2875 #endif
|
|
|
2876
|
|
771
|
2877 #else /* not DEBUG_XEMACS */
|
|
|
2878
|
|
452
|
2879 Lisp_Object_ptr_dynarr *staticpros;
|
|
|
2880
|
|
|
2881 /* Mark the Lisp_Object at non-heap VARADDRESS as a root object for
|
|
|
2882 garbage collection, and for dumping. */
|
|
428
|
2883 void
|
|
|
2884 staticpro (Lisp_Object *varaddress)
|
|
|
2885 {
|
|
452
|
2886 Dynarr_add (staticpros, varaddress);
|
|
1204
|
2887 dump_add_root_lisp_object (varaddress);
|
|
428
|
2888 }
|
|
|
2889
|
|
442
|
2890
|
|
452
|
2891 Lisp_Object_ptr_dynarr *staticpros_nodump;
|
|
|
2892
|
|
771
|
2893 /* Mark the Lisp_Object at heap VARADDRESS as a root object for garbage
|
|
|
2894 collection, but not for dumping. This is used for objects where the
|
|
|
2895 only sure pointer is in the heap (rather than in the global data
|
|
|
2896 segment, as must be the case for pdump root pointers), but not inside of
|
|
|
2897 another Lisp object (where it will be marked as a result of that Lisp
|
|
|
2898 object's mark method). The call to staticpro_nodump() must occur *BOTH*
|
|
|
2899 at initialization time and at "reinitialization" time (startup, after
|
|
|
2900 pdump load.) (For example, this is the case with the predicate symbols
|
|
|
2901 for specifier and coding system types. The pointer to this symbol is
|
|
|
2902 inside of a methods structure, which is allocated on the heap. The
|
|
|
2903 methods structure will be written out to the pdump data file, and may be
|
|
|
2904 reloaded at a different address.)
|
|
|
2905
|
|
|
2906 #### The necessity for reinitialization is a bug in pdump. Pdump should
|
|
|
2907 automatically regenerate the staticpro()s for these symbols when it
|
|
|
2908 loads the data in. */
|
|
|
2909
|
|
428
|
2910 void
|
|
|
2911 staticpro_nodump (Lisp_Object *varaddress)
|
|
|
2912 {
|
|
452
|
2913 Dynarr_add (staticpros_nodump, varaddress);
|
|
428
|
2914 }
|
|
|
2915
|
|
996
|
2916 #ifdef HAVE_SHLIB
|
|
|
2917 /* Unmark the Lisp_Object at non-heap VARADDRESS as a root object for
|
|
|
2918 garbage collection, but not for dumping. */
|
|
|
2919 void
|
|
|
2920 unstaticpro_nodump (Lisp_Object *varaddress)
|
|
|
2921 {
|
|
|
2922 Dynarr_delete_object (staticpros, varaddress);
|
|
|
2923 }
|
|
|
2924 #endif
|
|
|
2925
|
|
771
|
2926 #endif /* not DEBUG_XEMACS */
|
|
|
2927
|
|
442
|
2928 #ifdef ERROR_CHECK_GC
|
|
|
2929 #define GC_CHECK_LHEADER_INVARIANTS(lheader) do { \
|
|
|
2930 struct lrecord_header * GCLI_lh = (lheader); \
|
|
|
2931 assert (GCLI_lh != 0); \
|
|
647
|
2932 assert (GCLI_lh->type < (unsigned int) lrecord_type_count); \
|
|
442
|
2933 assert (! C_READONLY_RECORD_HEADER_P (GCLI_lh) || \
|
|
|
2934 (MARKED_RECORD_HEADER_P (GCLI_lh) && \
|
|
|
2935 LISP_READONLY_RECORD_HEADER_P (GCLI_lh))); \
|
|
|
2936 } while (0)
|
|
|
2937 #else
|
|
|
2938 #define GC_CHECK_LHEADER_INVARIANTS(lheader)
|
|
|
2939 #endif
|
|
|
2940
|
|
934
|
2941
|
|
1204
|
2942 static const struct memory_description lisp_object_description_1[] = {
|
|
|
2943 { XD_LISP_OBJECT, 0 },
|
|
|
2944 { XD_END }
|
|
|
2945 };
|
|
|
2946
|
|
|
2947 const struct sized_memory_description lisp_object_description = {
|
|
|
2948 sizeof (Lisp_Object),
|
|
|
2949 lisp_object_description_1
|
|
|
2950 };
|
|
|
2951
|
|
|
2952 #if defined (USE_KKCC) || defined (PDUMP)
|
|
934
|
2953
|
|
1598
|
2954 /* the initial stack size in kkcc_gc_stack_entries */
|
|
|
2955 #define KKCC_INIT_GC_STACK_SIZE 16384
|
|
|
2956
|
|
|
2957 typedef struct
|
|
|
2958 {
|
|
|
2959 void *data;
|
|
|
2960 const struct memory_description *desc;
|
|
|
2961 } kkcc_gc_stack_entry;
|
|
|
2962
|
|
|
2963 static kkcc_gc_stack_entry *kkcc_gc_stack_ptr;
|
|
|
2964 static kkcc_gc_stack_entry *kkcc_gc_stack_top;
|
|
|
2965 static int kkcc_gc_stack_size;
|
|
|
2966 static int kkcc_gc_stack_count;
|
|
|
2967
|
|
|
2968 static void
|
|
|
2969 kkcc_gc_stack_init (void)
|
|
|
2970 {
|
|
|
2971 kkcc_gc_stack_size = KKCC_INIT_GC_STACK_SIZE;
|
|
|
2972 kkcc_gc_stack_ptr =
|
|
|
2973 malloc (kkcc_gc_stack_size * sizeof (kkcc_gc_stack_entry));
|
|
|
2974 if (!kkcc_gc_stack_ptr)
|
|
|
2975 {
|
|
|
2976 stderr_out ("stack init failed for size %d\n", kkcc_gc_stack_size);
|
|
|
2977 exit(23);
|
|
|
2978 }
|
|
|
2979 kkcc_gc_stack_top = kkcc_gc_stack_ptr - 1;
|
|
|
2980 kkcc_gc_stack_count = 0;
|
|
|
2981 }
|
|
|
2982
|
|
|
2983 static void
|
|
|
2984 kkcc_gc_stack_free (void)
|
|
|
2985 {
|
|
|
2986 free (kkcc_gc_stack_ptr);
|
|
|
2987 kkcc_gc_stack_ptr = 0;
|
|
|
2988 kkcc_gc_stack_top = 0;
|
|
|
2989 kkcc_gc_stack_size = 0;
|
|
|
2990 }
|
|
|
2991
|
|
|
2992 static void
|
|
|
2993 kkcc_gc_stack_realloc (void)
|
|
|
2994 {
|
|
|
2995 kkcc_gc_stack_size *= 2;
|
|
|
2996 kkcc_gc_stack_ptr =
|
|
|
2997 realloc (kkcc_gc_stack_ptr,
|
|
|
2998 kkcc_gc_stack_size * sizeof (kkcc_gc_stack_entry));
|
|
|
2999 if (!kkcc_gc_stack_ptr)
|
|
|
3000 {
|
|
|
3001 stderr_out ("stack realloc failed for size %d\n", kkcc_gc_stack_size);
|
|
|
3002 exit(23);
|
|
|
3003 }
|
|
|
3004 kkcc_gc_stack_top = kkcc_gc_stack_ptr + kkcc_gc_stack_count - 1;
|
|
|
3005 }
|
|
|
3006
|
|
|
3007 static int
|
|
|
3008 kkcc_gc_stack_full (void)
|
|
|
3009 {
|
|
|
3010 if (kkcc_gc_stack_count > (kkcc_gc_stack_size - 1))
|
|
|
3011 return 1;
|
|
|
3012 return 0;
|
|
|
3013 }
|
|
|
3014
|
|
|
3015 static int
|
|
|
3016 kkcc_gc_stack_empty (void)
|
|
|
3017 {
|
|
|
3018 if (kkcc_gc_stack_count == 0)
|
|
|
3019 return 1;
|
|
|
3020 return 0;
|
|
|
3021 }
|
|
|
3022
|
|
|
3023 static void
|
|
|
3024 kkcc_gc_stack_push (void *data, const struct memory_description *desc)
|
|
|
3025 {
|
|
|
3026 if (kkcc_gc_stack_full ())
|
|
|
3027 kkcc_gc_stack_realloc();
|
|
|
3028
|
|
|
3029 kkcc_gc_stack_top++;
|
|
|
3030 kkcc_gc_stack_count++;
|
|
|
3031 kkcc_gc_stack_top->data = data;
|
|
|
3032 kkcc_gc_stack_top->desc = desc;
|
|
|
3033 }
|
|
|
3034
|
|
|
3035 static kkcc_gc_stack_entry *
|
|
|
3036 kkcc_gc_stack_pop (void) //void *data, const struct memory_description *desc)
|
|
|
3037 {
|
|
|
3038 if (kkcc_gc_stack_empty ())
|
|
|
3039 return 0;
|
|
|
3040
|
|
|
3041 kkcc_gc_stack_top--;
|
|
|
3042 kkcc_gc_stack_count--;
|
|
|
3043
|
|
|
3044 return kkcc_gc_stack_top + 1;
|
|
|
3045 }
|
|
|
3046
|
|
|
3047 void
|
|
|
3048 kkcc_gc_stack_push_lisp_object (Lisp_Object obj)
|
|
|
3049 {
|
|
|
3050 if (XTYPE (obj) == Lisp_Type_Record)
|
|
|
3051 {
|
|
|
3052 struct lrecord_header *lheader = XRECORD_LHEADER (obj);
|
|
|
3053 const struct memory_description *desc;
|
|
|
3054 GC_CHECK_LHEADER_INVARIANTS (lheader);
|
|
|
3055 desc = LHEADER_IMPLEMENTATION (lheader)->description;
|
|
|
3056 if (! MARKED_RECORD_HEADER_P (lheader))
|
|
|
3057 {
|
|
|
3058 MARK_RECORD_HEADER (lheader);
|
|
|
3059 kkcc_gc_stack_push((void*) lheader, desc);
|
|
|
3060 }
|
|
|
3061 }
|
|
|
3062 }
|
|
|
3063
|
|
934
|
3064 /* This function extracts the value of a count variable described somewhere
|
|
|
3065 else in the description. It is converted corresponding to the type */
|
|
1204
|
3066 EMACS_INT
|
|
|
3067 lispdesc_indirect_count_1 (EMACS_INT code,
|
|
|
3068 const struct memory_description *idesc,
|
|
|
3069 const void *idata)
|
|
934
|
3070 {
|
|
|
3071 EMACS_INT count;
|
|
|
3072 const void *irdata;
|
|
|
3073
|
|
|
3074 int line = XD_INDIRECT_VAL (code);
|
|
|
3075 int delta = XD_INDIRECT_DELTA (code);
|
|
|
3076
|
|
1204
|
3077 irdata = ((char *) idata) +
|
|
|
3078 lispdesc_indirect_count (idesc[line].offset, idesc, idata);
|
|
934
|
3079 switch (idesc[line].type)
|
|
|
3080 {
|
|
|
3081 case XD_BYTECOUNT:
|
|
1204
|
3082 count = * (Bytecount *) irdata;
|
|
934
|
3083 break;
|
|
|
3084 case XD_ELEMCOUNT:
|
|
1204
|
3085 count = * (Elemcount *) irdata;
|
|
934
|
3086 break;
|
|
|
3087 case XD_HASHCODE:
|
|
1204
|
3088 count = * (Hashcode *) irdata;
|
|
934
|
3089 break;
|
|
|
3090 case XD_INT:
|
|
1204
|
3091 count = * (int *) irdata;
|
|
934
|
3092 break;
|
|
|
3093 case XD_LONG:
|
|
1204
|
3094 count = * (long *) irdata;
|
|
934
|
3095 break;
|
|
|
3096 default:
|
|
|
3097 stderr_out ("Unsupported count type : %d (line = %d, code = %ld)\n",
|
|
1204
|
3098 idesc[line].type, line, (long) code);
|
|
|
3099 #ifdef PDUMP
|
|
|
3100 if (in_pdump)
|
|
|
3101 pdump_backtrace ();
|
|
|
3102 #endif
|
|
934
|
3103 count = 0; /* warning suppression */
|
|
|
3104 abort ();
|
|
|
3105 }
|
|
|
3106 count += delta;
|
|
|
3107 return count;
|
|
|
3108 }
|
|
|
3109
|
|
1204
|
3110 /* SDESC is a "description map" (basically, a list of offsets used for
|
|
|
3111 successive indirections) and OBJ is the first object to indirect off of.
|
|
|
3112 Return the description ultimately found. */
|
|
|
3113
|
|
|
3114 const struct sized_memory_description *
|
|
|
3115 lispdesc_indirect_description_1 (const void *obj,
|
|
|
3116 const struct sized_memory_description *sdesc)
|
|
934
|
3117 {
|
|
|
3118 int pos;
|
|
|
3119
|
|
1204
|
3120 for (pos = 0; sdesc[pos].size >= 0; pos++)
|
|
|
3121 obj = * (const void **) ((const char *) obj + sdesc[pos].size);
|
|
|
3122
|
|
|
3123 return (const struct sized_memory_description *) obj;
|
|
|
3124 }
|
|
|
3125
|
|
|
3126 /* Compute the size of the data at RDATA, described by a single entry
|
|
|
3127 DESC1 in a description array. OBJ and DESC are used for
|
|
|
3128 XD_INDIRECT references. */
|
|
|
3129
|
|
|
3130 static Bytecount
|
|
|
3131 lispdesc_one_description_line_size (void *rdata,
|
|
|
3132 const struct memory_description *desc1,
|
|
|
3133 const void *obj,
|
|
|
3134 const struct memory_description *desc)
|
|
|
3135 {
|
|
|
3136 union_switcheroo:
|
|
|
3137 switch (desc1->type)
|
|
934
|
3138 {
|
|
1204
|
3139 case XD_LISP_OBJECT_ARRAY:
|
|
|
3140 {
|
|
|
3141 EMACS_INT val = lispdesc_indirect_count (desc1->data1, desc, obj);
|
|
|
3142 return (val * sizeof (Lisp_Object));
|
|
|
3143 }
|
|
|
3144 case XD_LISP_OBJECT:
|
|
|
3145 case XD_LO_LINK:
|
|
|
3146 return sizeof (Lisp_Object);
|
|
|
3147 case XD_OPAQUE_PTR:
|
|
|
3148 return sizeof (void *);
|
|
|
3149 case XD_STRUCT_PTR:
|
|
|
3150 {
|
|
|
3151 EMACS_INT val = lispdesc_indirect_count (desc1->data1, desc, obj);
|
|
|
3152 return val * sizeof (void *);
|
|
|
3153 }
|
|
|
3154 case XD_STRUCT_ARRAY:
|
|
|
3155 {
|
|
|
3156 EMACS_INT val = lispdesc_indirect_count (desc1->data1, desc, obj);
|
|
|
3157
|
|
|
3158 return (val *
|
|
|
3159 lispdesc_structure_size
|
|
|
3160 (rdata, lispdesc_indirect_description (obj, desc1->data2)));
|
|
|
3161 }
|
|
|
3162 case XD_OPAQUE_DATA_PTR:
|
|
|
3163 return sizeof (void *);
|
|
|
3164 case XD_UNION_DYNAMIC_SIZE:
|
|
|
3165 {
|
|
|
3166 /* If an explicit size was given in the first-level structure
|
|
|
3167 description, use it; else compute size based on current union
|
|
|
3168 constant. */
|
|
|
3169 const struct sized_memory_description *sdesc =
|
|
|
3170 lispdesc_indirect_description (obj, desc1->data2);
|
|
|
3171 if (sdesc->size)
|
|
|
3172 return sdesc->size;
|
|
|
3173 else
|
|
|
3174 {
|
|
|
3175 desc1 = lispdesc_process_xd_union (desc1, desc, obj);
|
|
|
3176 if (desc1)
|
|
|
3177 goto union_switcheroo;
|
|
934
|
3178 break;
|
|
1204
|
3179 }
|
|
|
3180 }
|
|
|
3181 case XD_UNION:
|
|
|
3182 {
|
|
|
3183 /* If an explicit size was given in the first-level structure
|
|
|
3184 description, use it; else compute size based on maximum of all
|
|
|
3185 possible structures. */
|
|
|
3186 const struct sized_memory_description *sdesc =
|
|
|
3187 lispdesc_indirect_description (obj, desc1->data2);
|
|
|
3188 if (sdesc->size)
|
|
|
3189 return sdesc->size;
|
|
|
3190 else
|
|
|
3191 {
|
|
|
3192 int count;
|
|
|
3193 Bytecount max_size = -1, size;
|
|
|
3194
|
|
|
3195 desc1 = sdesc->description;
|
|
|
3196
|
|
|
3197 for (count = 0; desc1[count].type != XD_END; count++)
|
|
|
3198 {
|
|
|
3199 size = lispdesc_one_description_line_size (rdata,
|
|
|
3200 &desc1[count],
|
|
|
3201 obj, desc);
|
|
|
3202 if (size > max_size)
|
|
|
3203 max_size = size;
|
|
|
3204 }
|
|
|
3205 return max_size;
|
|
|
3206 }
|
|
934
|
3207 }
|
|
1204
|
3208 case XD_C_STRING:
|
|
|
3209 return sizeof (void *);
|
|
|
3210 case XD_DOC_STRING:
|
|
|
3211 return sizeof (void *);
|
|
|
3212 case XD_INT_RESET:
|
|
|
3213 return sizeof (int);
|
|
|
3214 case XD_BYTECOUNT:
|
|
|
3215 return sizeof (Bytecount);
|
|
|
3216 case XD_ELEMCOUNT:
|
|
|
3217 return sizeof (Elemcount);
|
|
|
3218 case XD_HASHCODE:
|
|
|
3219 return sizeof (Hashcode);
|
|
|
3220 case XD_INT:
|
|
|
3221 return sizeof (int);
|
|
|
3222 case XD_LONG:
|
|
|
3223 return sizeof (long);
|
|
|
3224 default:
|
|
|
3225 stderr_out ("Unsupported dump type : %d\n", desc1->type);
|
|
|
3226 abort ();
|
|
934
|
3227 }
|
|
|
3228
|
|
1204
|
3229 return 0;
|
|
934
|
3230 }
|
|
|
3231
|
|
|
3232
|
|
1204
|
3233 /* Return the size of the memory block (NOT necessarily a structure!)
|
|
|
3234 described by SDESC and pointed to by OBJ. If SDESC records an
|
|
|
3235 explicit size (i.e. non-zero), it is simply returned; otherwise,
|
|
|
3236 the size is calculated by the maximum offset and the size of the
|
|
|
3237 object at that offset, rounded up to the maximum alignment. In
|
|
|
3238 this case, we may need the object, for example when retrieving an
|
|
|
3239 "indirect count" of an inlined array (the count is not constant,
|
|
|
3240 but is specified by one of the elements of the memory block). (It
|
|
|
3241 is generally not a problem if we return an overly large size -- we
|
|
|
3242 will simply end up reserving more space than necessary; but if the
|
|
|
3243 size is too small we could be in serious trouble, in particular
|
|
|
3244 with nested inlined structures, where there may be alignment
|
|
|
3245 padding in the middle of a block. #### In fact there is an (at
|
|
|
3246 least theoretical) problem with an overly large size -- we may
|
|
|
3247 trigger a protection fault when reading from invalid memory. We
|
|
|
3248 need to handle this -- perhaps in a stupid but dependable way,
|
|
|
3249 i.e. by trapping SIGSEGV and SIGBUS.) */
|
|
|
3250
|
|
|
3251 Bytecount
|
|
|
3252 lispdesc_structure_size (const void *obj,
|
|
|
3253 const struct sized_memory_description *sdesc)
|
|
934
|
3254 {
|
|
1204
|
3255 EMACS_INT max_offset = -1;
|
|
934
|
3256 int max_offset_pos = -1;
|
|
|
3257 int pos;
|
|
1204
|
3258 const struct memory_description *desc;
|
|
934
|
3259
|
|
|
3260 if (sdesc->size)
|
|
|
3261 return sdesc->size;
|
|
|
3262
|
|
|
3263 desc = sdesc->description;
|
|
|
3264
|
|
|
3265 for (pos = 0; desc[pos].type != XD_END; pos++)
|
|
|
3266 {
|
|
1204
|
3267 EMACS_INT offset = lispdesc_indirect_count (desc[pos].offset, desc, obj);
|
|
|
3268 if (offset == max_offset)
|
|
934
|
3269 {
|
|
|
3270 stderr_out ("Two relocatable elements at same offset?\n");
|
|
|
3271 abort ();
|
|
|
3272 }
|
|
1204
|
3273 else if (offset > max_offset)
|
|
934
|
3274 {
|
|
1204
|
3275 max_offset = offset;
|
|
934
|
3276 max_offset_pos = pos;
|
|
|
3277 }
|
|
|
3278 }
|
|
|
3279
|
|
|
3280 if (max_offset_pos < 0)
|
|
|
3281 return 0;
|
|
|
3282
|
|
1204
|
3283 {
|
|
|
3284 Bytecount size_at_max;
|
|
|
3285 size_at_max =
|
|
|
3286 lispdesc_one_description_line_size ((char *) obj + max_offset,
|
|
|
3287 &desc[max_offset_pos], obj, desc);
|
|
|
3288
|
|
|
3289 /* We have no way of knowing the required alignment for this structure,
|
|
|
3290 so just make it maximally aligned. */
|
|
|
3291 return MAX_ALIGN_SIZE (max_offset + size_at_max);
|
|
|
3292 }
|
|
|
3293 }
|
|
|
3294
|
|
|
3295 #endif /* defined (USE_KKCC) || defined (PDUMP) */
|
|
|
3296
|
|
1276
|
3297 #define GC_CHECK_NOT_FREE(lheader) \
|
|
|
3298 gc_checking_assert (LHEADER_IMPLEMENTATION (lheader)->basic_p || \
|
|
|
3299 ! ((struct lcrecord_header *) lheader)->free)
|
|
|
3300
|
|
1204
|
3301 #ifdef USE_KKCC
|
|
|
3302 /* The following functions implement the new mark algorithm.
|
|
|
3303 They mark objects according to their descriptions. They
|
|
|
3304 are modeled on the corresponding pdumper procedures. */
|
|
|
3305
|
|
1265
|
3306 #ifdef ERROR_CHECK_GC
|
|
|
3307 #define KKCC_DO_CHECK_FREE(obj, allow_free) \
|
|
|
3308 do \
|
|
|
3309 { \
|
|
|
3310 if (!allow_free && XTYPE (obj) == Lisp_Type_Record) \
|
|
|
3311 { \
|
|
|
3312 struct lrecord_header *lheader = XRECORD_LHEADER (obj); \
|
|
|
3313 GC_CHECK_NOT_FREE (lheader); \
|
|
|
3314 } \
|
|
|
3315 } while (0)
|
|
|
3316 #else
|
|
|
3317 #define KKCC_DO_CHECK_FREE(obj, allow_free)
|
|
|
3318 #endif
|
|
1204
|
3319
|
|
|
3320 #ifdef ERROR_CHECK_GC
|
|
1598
|
3321 static void
|
|
1204
|
3322 mark_object_maybe_checking_free (Lisp_Object obj, int allow_free)
|
|
|
3323 {
|
|
1265
|
3324 KKCC_DO_CHECK_FREE (obj, allow_free);
|
|
1598
|
3325 #ifdef USE_KKCC
|
|
|
3326 kkcc_gc_stack_push_lisp_object (obj);
|
|
|
3327 #else /* NOT USE_KKCC */
|
|
1204
|
3328 mark_object (obj);
|
|
1598
|
3329 #endif /* NOT USE_KKCC */
|
|
1204
|
3330 }
|
|
|
3331 #else
|
|
1242
|
3332 #define mark_object_maybe_checking_free(obj, allow_free) mark_object (obj)
|
|
1204
|
3333 #endif /* ERROR_CHECK_GC */
|
|
|
3334
|
|
934
|
3335
|
|
|
3336 /* This function loops all elements of a struct pointer and calls
|
|
|
3337 mark_with_description with each element. */
|
|
|
3338 static void
|
|
|
3339 mark_struct_contents (const void *data,
|
|
1204
|
3340 const struct sized_memory_description *sdesc,
|
|
|
3341 int count)
|
|
934
|
3342 {
|
|
|
3343 int i;
|
|
|
3344 Bytecount elsize;
|
|
1204
|
3345 elsize = lispdesc_structure_size (data, sdesc);
|
|
934
|
3346
|
|
|
3347 for (i = 0; i < count; i++)
|
|
|
3348 {
|
|
1598
|
3349 kkcc_gc_stack_push (((char *) data) + elsize * i, sdesc->description);
|
|
934
|
3350 }
|
|
|
3351 }
|
|
|
3352
|
|
1598
|
3353
|
|
|
3354 /* This function implements the KKCC mark algorithm.
|
|
|
3355 Instead of calling mark_object, all the alive Lisp_Objects are pushed
|
|
|
3356 on the kkcc_gc_stack. This function processes all elements on the stack
|
|
|
3357 according to their descriptions. */
|
|
|
3358 static void
|
|
|
3359 kkcc_marking (void)
|
|
|
3360 {
|
|
|
3361 kkcc_gc_stack_entry *stack_entry = 0;
|
|
|
3362 void *data = 0;
|
|
|
3363 const struct memory_description *desc = 0;
|
|
|
3364 int pos;
|
|
|
3365
|
|
|
3366 while ((stack_entry = kkcc_gc_stack_pop ()) != 0)
|
|
|
3367 {
|
|
|
3368 data = stack_entry->data;
|
|
|
3369 desc = stack_entry->desc;
|
|
|
3370
|
|
|
3371 for (pos = 0; desc[pos].type != XD_END; pos++)
|
|
|
3372 {
|
|
|
3373 const struct memory_description *desc1 = &desc[pos];
|
|
|
3374 const void *rdata =
|
|
|
3375 (const char *) data + lispdesc_indirect_count (desc1->offset,
|
|
|
3376 desc, data);
|
|
|
3377 union_switcheroo:
|
|
|
3378
|
|
|
3379 /* If the flag says don't mark, then don't mark. */
|
|
|
3380 if ((desc1->flags) & XD_FLAG_NO_KKCC)
|
|
|
3381 continue;
|
|
|
3382
|
|
|
3383 switch (desc1->type)
|
|
|
3384 {
|
|
|
3385 case XD_BYTECOUNT:
|
|
|
3386 case XD_ELEMCOUNT:
|
|
|
3387 case XD_HASHCODE:
|
|
|
3388 case XD_INT:
|
|
|
3389 case XD_LONG:
|
|
|
3390 case XD_INT_RESET:
|
|
|
3391 case XD_LO_LINK:
|
|
|
3392 case XD_OPAQUE_PTR:
|
|
|
3393 case XD_OPAQUE_DATA_PTR:
|
|
|
3394 case XD_C_STRING:
|
|
|
3395 case XD_DOC_STRING:
|
|
|
3396 break;
|
|
|
3397 case XD_LISP_OBJECT:
|
|
|
3398 {
|
|
|
3399 const Lisp_Object *stored_obj = (const Lisp_Object *) rdata;
|
|
|
3400
|
|
|
3401 /* Because of the way that tagged objects work (pointers and
|
|
|
3402 Lisp_Objects have the same representation), XD_LISP_OBJECT
|
|
|
3403 can be used for untagged pointers. They might be NULL,
|
|
|
3404 though. */
|
|
|
3405 if (EQ (*stored_obj, Qnull_pointer))
|
|
|
3406 break;
|
|
|
3407 mark_object_maybe_checking_free
|
|
|
3408 (*stored_obj, (desc1->flags) & XD_FLAG_FREE_LISP_OBJECT);
|
|
|
3409
|
|
|
3410 break;
|
|
|
3411 }
|
|
|
3412 case XD_LISP_OBJECT_ARRAY:
|
|
|
3413 {
|
|
|
3414 int i;
|
|
|
3415 EMACS_INT count =
|
|
|
3416 lispdesc_indirect_count (desc1->data1, desc, data);
|
|
|
3417
|
|
|
3418 for (i = 0; i < count; i++)
|
|
|
3419 {
|
|
|
3420 const Lisp_Object *stored_obj =
|
|
|
3421 (const Lisp_Object *) rdata + i;
|
|
|
3422
|
|
|
3423 if (EQ (*stored_obj, Qnull_pointer))
|
|
|
3424 break;
|
|
|
3425
|
|
|
3426 mark_object_maybe_checking_free
|
|
|
3427 (*stored_obj, (desc1->flags) & XD_FLAG_FREE_LISP_OBJECT);
|
|
|
3428 }
|
|
|
3429 break;
|
|
|
3430 }
|
|
|
3431 case XD_STRUCT_PTR:
|
|
|
3432 {
|
|
|
3433 EMACS_INT count = lispdesc_indirect_count (desc1->data1, desc,
|
|
|
3434 data);
|
|
|
3435 const struct sized_memory_description *sdesc =
|
|
|
3436 lispdesc_indirect_description (data, desc1->data2);
|
|
|
3437 const char *dobj = * (const char **) rdata;
|
|
|
3438 if (dobj)
|
|
|
3439 mark_struct_contents (dobj, sdesc, count);
|
|
|
3440 break;
|
|
|
3441 }
|
|
|
3442 case XD_STRUCT_ARRAY:
|
|
|
3443 {
|
|
|
3444 EMACS_INT count = lispdesc_indirect_count (desc1->data1, desc,
|
|
|
3445 data);
|
|
|
3446 const struct sized_memory_description *sdesc =
|
|
|
3447 lispdesc_indirect_description (data, desc1->data2);
|
|
|
3448
|
|
|
3449 mark_struct_contents (rdata, sdesc, count);
|
|
|
3450 break;
|
|
|
3451 }
|
|
|
3452 case XD_UNION:
|
|
|
3453 case XD_UNION_DYNAMIC_SIZE:
|
|
|
3454 desc1 = lispdesc_process_xd_union (desc1, desc, data);
|
|
|
3455 if (desc1)
|
|
|
3456 goto union_switcheroo;
|
|
|
3457 break;
|
|
|
3458
|
|
|
3459 default:
|
|
|
3460 stderr_out ("Unsupported description type : %d\n", desc1->type);
|
|
|
3461 abort ();
|
|
|
3462 }
|
|
|
3463 }
|
|
|
3464 }
|
|
|
3465 }
|
|
934
|
3466 #endif /* USE_KKCC */
|
|
|
3467
|
|
428
|
3468 /* Mark reference to a Lisp_Object. If the object referred to has not been
|
|
|
3469 seen yet, recursively mark all the references contained in it. */
|
|
|
3470
|
|
|
3471 void
|
|
|
3472 mark_object (Lisp_Object obj)
|
|
|
3473 {
|
|
1598
|
3474 #ifdef USE_KKCC
|
|
|
3475 /* this code should never be reached when configured for KKCC */
|
|
|
3476 stderr_out ("KKCC: Invalid mark_object call.\n");
|
|
|
3477 stderr_out ("Replace mark_object with kkcc_gc_stack_push_lisp_object.\n");
|
|
|
3478 abort ();
|
|
|
3479 #endif /* USE_KKCC */
|
|
|
3480
|
|
428
|
3481 tail_recurse:
|
|
|
3482
|
|
|
3483 /* Checks we used to perform */
|
|
|
3484 /* if (EQ (obj, Qnull_pointer)) return; */
|
|
|
3485 /* if (!POINTER_TYPE_P (XGCTYPE (obj))) return; */
|
|
|
3486 /* if (PURIFIED (XPNTR (obj))) return; */
|
|
|
3487
|
|
|
3488 if (XTYPE (obj) == Lisp_Type_Record)
|
|
|
3489 {
|
|
|
3490 struct lrecord_header *lheader = XRECORD_LHEADER (obj);
|
|
442
|
3491
|
|
|
3492 GC_CHECK_LHEADER_INVARIANTS (lheader);
|
|
|
3493
|
|
1204
|
3494 /* We handle this separately, above, so we can mark free objects */
|
|
1265
|
3495 GC_CHECK_NOT_FREE (lheader);
|
|
1204
|
3496
|
|
442
|
3497 /* All c_readonly objects have their mark bit set,
|
|
|
3498 so that we only need to check the mark bit here. */
|
|
|
3499 if (! MARKED_RECORD_HEADER_P (lheader))
|
|
428
|
3500 {
|
|
|
3501 MARK_RECORD_HEADER (lheader);
|
|
442
|
3502
|
|
1598
|
3503 if (RECORD_MARKER (lheader))
|
|
|
3504 {
|
|
|
3505 obj = RECORD_MARKER (lheader) (obj);
|
|
|
3506 if (!NILP (obj)) goto tail_recurse;
|
|
|
3507 }
|
|
428
|
3508 }
|
|
|
3509 }
|
|
|
3510 }
|
|
|
3511
|
|
|
3512
|
|
|
3513 static int gc_count_num_short_string_in_use;
|
|
647
|
3514 static Bytecount gc_count_string_total_size;
|
|
|
3515 static Bytecount gc_count_short_string_total_size;
|
|
428
|
3516
|
|
|
3517 /* static int gc_count_total_records_used, gc_count_records_total_size; */
|
|
|
3518
|
|
|
3519
|
|
|
3520 /* stats on lcrecords in use - kinda kludgy */
|
|
|
3521
|
|
|
3522 static struct
|
|
|
3523 {
|
|
|
3524 int instances_in_use;
|
|
|
3525 int bytes_in_use;
|
|
|
3526 int instances_freed;
|
|
|
3527 int bytes_freed;
|
|
|
3528 int instances_on_free_list;
|
|
707
|
3529 } lcrecord_stats [countof (lrecord_implementations_table)
|
|
|
3530 + MODULE_DEFINABLE_TYPE_COUNT];
|
|
428
|
3531
|
|
|
3532 static void
|
|
442
|
3533 tick_lcrecord_stats (const struct lrecord_header *h, int free_p)
|
|
428
|
3534 {
|
|
647
|
3535 int type_index = h->type;
|
|
428
|
3536
|
|
|
3537 if (((struct lcrecord_header *) h)->free)
|
|
|
3538 {
|
|
442
|
3539 gc_checking_assert (!free_p);
|
|
428
|
3540 lcrecord_stats[type_index].instances_on_free_list++;
|
|
|
3541 }
|
|
|
3542 else
|
|
|
3543 {
|
|
1204
|
3544 Bytecount sz = detagged_lisp_object_size (h);
|
|
|
3545
|
|
428
|
3546 if (free_p)
|
|
|
3547 {
|
|
|
3548 lcrecord_stats[type_index].instances_freed++;
|
|
|
3549 lcrecord_stats[type_index].bytes_freed += sz;
|
|
|
3550 }
|
|
|
3551 else
|
|
|
3552 {
|
|
|
3553 lcrecord_stats[type_index].instances_in_use++;
|
|
|
3554 lcrecord_stats[type_index].bytes_in_use += sz;
|
|
|
3555 }
|
|
|
3556 }
|
|
|
3557 }
|
|
|
3558
|
|
|
3559
|
|
|
3560 /* Free all unmarked records */
|
|
|
3561 static void
|
|
|
3562 sweep_lcrecords_1 (struct lcrecord_header **prev, int *used)
|
|
|
3563 {
|
|
|
3564 struct lcrecord_header *header;
|
|
|
3565 int num_used = 0;
|
|
|
3566 /* int total_size = 0; */
|
|
|
3567
|
|
|
3568 xzero (lcrecord_stats); /* Reset all statistics to 0. */
|
|
|
3569
|
|
|
3570 /* First go through and call all the finalize methods.
|
|
|
3571 Then go through and free the objects. There used to
|
|
|
3572 be only one loop here, with the call to the finalizer
|
|
|
3573 occurring directly before the xfree() below. That
|
|
|
3574 is marginally faster but much less safe -- if the
|
|
|
3575 finalize method for an object needs to reference any
|
|
|
3576 other objects contained within it (and many do),
|
|
|
3577 we could easily be screwed by having already freed that
|
|
|
3578 other object. */
|
|
|
3579
|
|
|
3580 for (header = *prev; header; header = header->next)
|
|
|
3581 {
|
|
|
3582 struct lrecord_header *h = &(header->lheader);
|
|
442
|
3583
|
|
|
3584 GC_CHECK_LHEADER_INVARIANTS (h);
|
|
|
3585
|
|
|
3586 if (! MARKED_RECORD_HEADER_P (h) && ! header->free)
|
|
428
|
3587 {
|
|
|
3588 if (LHEADER_IMPLEMENTATION (h)->finalizer)
|
|
|
3589 LHEADER_IMPLEMENTATION (h)->finalizer (h, 0);
|
|
|
3590 }
|
|
|
3591 }
|
|
|
3592
|
|
|
3593 for (header = *prev; header; )
|
|
|
3594 {
|
|
|
3595 struct lrecord_header *h = &(header->lheader);
|
|
442
|
3596 if (MARKED_RECORD_HEADER_P (h))
|
|
428
|
3597 {
|
|
442
|
3598 if (! C_READONLY_RECORD_HEADER_P (h))
|
|
428
|
3599 UNMARK_RECORD_HEADER (h);
|
|
|
3600 num_used++;
|
|
|
3601 /* total_size += n->implementation->size_in_bytes (h);*/
|
|
440
|
3602 /* #### May modify header->next on a C_READONLY lcrecord */
|
|
428
|
3603 prev = &(header->next);
|
|
|
3604 header = *prev;
|
|
|
3605 tick_lcrecord_stats (h, 0);
|
|
|
3606 }
|
|
|
3607 else
|
|
|
3608 {
|
|
|
3609 struct lcrecord_header *next = header->next;
|
|
|
3610 *prev = next;
|
|
|
3611 tick_lcrecord_stats (h, 1);
|
|
|
3612 /* used to call finalizer right here. */
|
|
|
3613 xfree (header);
|
|
|
3614 header = next;
|
|
|
3615 }
|
|
|
3616 }
|
|
|
3617 *used = num_used;
|
|
|
3618 /* *total = total_size; */
|
|
|
3619 }
|
|
|
3620
|
|
|
3621 /* And the Lord said: Thou shalt use the `c-backslash-region' command
|
|
|
3622 to make macros prettier. */
|
|
|
3623
|
|
|
3624 #ifdef ERROR_CHECK_GC
|
|
|
3625
|
|
771
|
3626 #define SWEEP_FIXED_TYPE_BLOCK_1(typename, obj_type, lheader) \
|
|
428
|
3627 do { \
|
|
|
3628 struct typename##_block *SFTB_current; \
|
|
|
3629 int SFTB_limit; \
|
|
|
3630 int num_free = 0, num_used = 0; \
|
|
|
3631 \
|
|
444
|
3632 for (SFTB_current = current_##typename##_block, \
|
|
428
|
3633 SFTB_limit = current_##typename##_block_index; \
|
|
|
3634 SFTB_current; \
|
|
|
3635 ) \
|
|
|
3636 { \
|
|
|
3637 int SFTB_iii; \
|
|
|
3638 \
|
|
|
3639 for (SFTB_iii = 0; SFTB_iii < SFTB_limit; SFTB_iii++) \
|
|
|
3640 { \
|
|
|
3641 obj_type *SFTB_victim = &(SFTB_current->block[SFTB_iii]); \
|
|
|
3642 \
|
|
454
|
3643 if (LRECORD_FREE_P (SFTB_victim)) \
|
|
428
|
3644 { \
|
|
|
3645 num_free++; \
|
|
|
3646 } \
|
|
|
3647 else if (C_READONLY_RECORD_HEADER_P (&SFTB_victim->lheader)) \
|
|
|
3648 { \
|
|
|
3649 num_used++; \
|
|
|
3650 } \
|
|
442
|
3651 else if (! MARKED_RECORD_HEADER_P (&SFTB_victim->lheader)) \
|
|
428
|
3652 { \
|
|
|
3653 num_free++; \
|
|
|
3654 FREE_FIXED_TYPE (typename, obj_type, SFTB_victim); \
|
|
|
3655 } \
|
|
|
3656 else \
|
|
|
3657 { \
|
|
|
3658 num_used++; \
|
|
|
3659 UNMARK_##typename (SFTB_victim); \
|
|
|
3660 } \
|
|
|
3661 } \
|
|
|
3662 SFTB_current = SFTB_current->prev; \
|
|
|
3663 SFTB_limit = countof (current_##typename##_block->block); \
|
|
|
3664 } \
|
|
|
3665 \
|
|
|
3666 gc_count_num_##typename##_in_use = num_used; \
|
|
|
3667 gc_count_num_##typename##_freelist = num_free; \
|
|
|
3668 } while (0)
|
|
|
3669
|
|
|
3670 #else /* !ERROR_CHECK_GC */
|
|
|
3671
|
|
771
|
3672 #define SWEEP_FIXED_TYPE_BLOCK_1(typename, obj_type, lheader) \
|
|
|
3673 do { \
|
|
|
3674 struct typename##_block *SFTB_current; \
|
|
|
3675 struct typename##_block **SFTB_prev; \
|
|
|
3676 int SFTB_limit; \
|
|
|
3677 int num_free = 0, num_used = 0; \
|
|
|
3678 \
|
|
|
3679 typename##_free_list = 0; \
|
|
|
3680 \
|
|
|
3681 for (SFTB_prev = ¤t_##typename##_block, \
|
|
|
3682 SFTB_current = current_##typename##_block, \
|
|
|
3683 SFTB_limit = current_##typename##_block_index; \
|
|
|
3684 SFTB_current; \
|
|
|
3685 ) \
|
|
|
3686 { \
|
|
|
3687 int SFTB_iii; \
|
|
|
3688 int SFTB_empty = 1; \
|
|
|
3689 Lisp_Free *SFTB_old_free_list = typename##_free_list; \
|
|
|
3690 \
|
|
|
3691 for (SFTB_iii = 0; SFTB_iii < SFTB_limit; SFTB_iii++) \
|
|
|
3692 { \
|
|
|
3693 obj_type *SFTB_victim = &(SFTB_current->block[SFTB_iii]); \
|
|
|
3694 \
|
|
|
3695 if (LRECORD_FREE_P (SFTB_victim)) \
|
|
|
3696 { \
|
|
|
3697 num_free++; \
|
|
|
3698 PUT_FIXED_TYPE_ON_FREE_LIST (typename, obj_type, SFTB_victim); \
|
|
|
3699 } \
|
|
|
3700 else if (C_READONLY_RECORD_HEADER_P (&SFTB_victim->lheader)) \
|
|
|
3701 { \
|
|
|
3702 SFTB_empty = 0; \
|
|
|
3703 num_used++; \
|
|
|
3704 } \
|
|
|
3705 else if (! MARKED_RECORD_HEADER_P (&SFTB_victim->lheader)) \
|
|
|
3706 { \
|
|
|
3707 num_free++; \
|
|
|
3708 FREE_FIXED_TYPE (typename, obj_type, SFTB_victim); \
|
|
|
3709 } \
|
|
|
3710 else \
|
|
|
3711 { \
|
|
|
3712 SFTB_empty = 0; \
|
|
|
3713 num_used++; \
|
|
|
3714 UNMARK_##typename (SFTB_victim); \
|
|
|
3715 } \
|
|
|
3716 } \
|
|
|
3717 if (!SFTB_empty) \
|
|
|
3718 { \
|
|
|
3719 SFTB_prev = &(SFTB_current->prev); \
|
|
|
3720 SFTB_current = SFTB_current->prev; \
|
|
|
3721 } \
|
|
|
3722 else if (SFTB_current == current_##typename##_block \
|
|
|
3723 && !SFTB_current->prev) \
|
|
|
3724 { \
|
|
|
3725 /* No real point in freeing sole allocation block */ \
|
|
|
3726 break; \
|
|
|
3727 } \
|
|
|
3728 else \
|
|
|
3729 { \
|
|
|
3730 struct typename##_block *SFTB_victim_block = SFTB_current; \
|
|
|
3731 if (SFTB_victim_block == current_##typename##_block) \
|
|
|
3732 current_##typename##_block_index \
|
|
|
3733 = countof (current_##typename##_block->block); \
|
|
|
3734 SFTB_current = SFTB_current->prev; \
|
|
|
3735 { \
|
|
|
3736 *SFTB_prev = SFTB_current; \
|
|
|
3737 xfree (SFTB_victim_block); \
|
|
|
3738 /* Restore free list to what it was before victim was swept */ \
|
|
|
3739 typename##_free_list = SFTB_old_free_list; \
|
|
|
3740 num_free -= SFTB_limit; \
|
|
|
3741 } \
|
|
|
3742 } \
|
|
|
3743 SFTB_limit = countof (current_##typename##_block->block); \
|
|
|
3744 } \
|
|
|
3745 \
|
|
|
3746 gc_count_num_##typename##_in_use = num_used; \
|
|
|
3747 gc_count_num_##typename##_freelist = num_free; \
|
|
428
|
3748 } while (0)
|
|
|
3749
|
|
|
3750 #endif /* !ERROR_CHECK_GC */
|
|
|
3751
|
|
771
|
3752 #define SWEEP_FIXED_TYPE_BLOCK(typename, obj_type) \
|
|
|
3753 SWEEP_FIXED_TYPE_BLOCK_1 (typename, obj_type, lheader)
|
|
|
3754
|
|
428
|
3755
|
|
|
3756
|
|
|
3757
|
|
|
3758 static void
|
|
|
3759 sweep_conses (void)
|
|
|
3760 {
|
|
|
3761 #define UNMARK_cons(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
3762 #define ADDITIONAL_FREE_cons(ptr)
|
|
|
3763
|
|
440
|
3764 SWEEP_FIXED_TYPE_BLOCK (cons, Lisp_Cons);
|
|
428
|
3765 }
|
|
|
3766
|
|
|
3767 /* Explicitly free a cons cell. */
|
|
|
3768 void
|
|
853
|
3769 free_cons (Lisp_Object cons)
|
|
428
|
3770 {
|
|
853
|
3771 Lisp_Cons *ptr = XCONS (cons);
|
|
|
3772
|
|
428
|
3773 #ifdef ERROR_CHECK_GC
|
|
|
3774 /* If the CAR is not an int, then it will be a pointer, which will
|
|
|
3775 always be four-byte aligned. If this cons cell has already been
|
|
|
3776 placed on the free list, however, its car will probably contain
|
|
|
3777 a chain pointer to the next cons on the list, which has cleverly
|
|
|
3778 had all its 0's and 1's inverted. This allows for a quick
|
|
1204
|
3779 check to make sure we're not freeing something already freed.
|
|
|
3780
|
|
|
3781 NOTE: This check may not be necessary. Freeing an object sets its
|
|
|
3782 type to lrecord_type_free, which will trip up the XCONS() above -- as
|
|
|
3783 well as a check in FREE_FIXED_TYPE(). */
|
|
853
|
3784 if (POINTER_TYPE_P (XTYPE (cons_car (ptr))))
|
|
|
3785 ASSERT_VALID_POINTER (XPNTR (cons_car (ptr)));
|
|
428
|
3786 #endif /* ERROR_CHECK_GC */
|
|
|
3787
|
|
440
|
3788 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (cons, Lisp_Cons, ptr);
|
|
428
|
3789 }
|
|
|
3790
|
|
|
3791 /* explicitly free a list. You **must make sure** that you have
|
|
|
3792 created all the cons cells that make up this list and that there
|
|
|
3793 are no pointers to any of these cons cells anywhere else. If there
|
|
|
3794 are, you will lose. */
|
|
|
3795
|
|
|
3796 void
|
|
|
3797 free_list (Lisp_Object list)
|
|
|
3798 {
|
|
|
3799 Lisp_Object rest, next;
|
|
|
3800
|
|
|
3801 for (rest = list; !NILP (rest); rest = next)
|
|
|
3802 {
|
|
|
3803 next = XCDR (rest);
|
|
853
|
3804 free_cons (rest);
|
|
428
|
3805 }
|
|
|
3806 }
|
|
|
3807
|
|
|
3808 /* explicitly free an alist. You **must make sure** that you have
|
|
|
3809 created all the cons cells that make up this alist and that there
|
|
|
3810 are no pointers to any of these cons cells anywhere else. If there
|
|
|
3811 are, you will lose. */
|
|
|
3812
|
|
|
3813 void
|
|
|
3814 free_alist (Lisp_Object alist)
|
|
|
3815 {
|
|
|
3816 Lisp_Object rest, next;
|
|
|
3817
|
|
|
3818 for (rest = alist; !NILP (rest); rest = next)
|
|
|
3819 {
|
|
|
3820 next = XCDR (rest);
|
|
853
|
3821 free_cons (XCAR (rest));
|
|
|
3822 free_cons (rest);
|
|
428
|
3823 }
|
|
|
3824 }
|
|
|
3825
|
|
|
3826 static void
|
|
|
3827 sweep_compiled_functions (void)
|
|
|
3828 {
|
|
|
3829 #define UNMARK_compiled_function(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
945
|
3830 #define ADDITIONAL_FREE_compiled_function(ptr) \
|
|
|
3831 if (ptr->args_in_array) xfree (ptr->args)
|
|
428
|
3832
|
|
|
3833 SWEEP_FIXED_TYPE_BLOCK (compiled_function, Lisp_Compiled_Function);
|
|
|
3834 }
|
|
|
3835
|
|
|
3836 static void
|
|
|
3837 sweep_floats (void)
|
|
|
3838 {
|
|
|
3839 #define UNMARK_float(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
3840 #define ADDITIONAL_FREE_float(ptr)
|
|
|
3841
|
|
440
|
3842 SWEEP_FIXED_TYPE_BLOCK (float, Lisp_Float);
|
|
428
|
3843 }
|
|
|
3844
|
|
|
3845 static void
|
|
|
3846 sweep_symbols (void)
|
|
|
3847 {
|
|
|
3848 #define UNMARK_symbol(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
3849 #define ADDITIONAL_FREE_symbol(ptr)
|
|
|
3850
|
|
440
|
3851 SWEEP_FIXED_TYPE_BLOCK (symbol, Lisp_Symbol);
|
|
428
|
3852 }
|
|
|
3853
|
|
|
3854 static void
|
|
|
3855 sweep_extents (void)
|
|
|
3856 {
|
|
|
3857 #define UNMARK_extent(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
3858 #define ADDITIONAL_FREE_extent(ptr)
|
|
|
3859
|
|
|
3860 SWEEP_FIXED_TYPE_BLOCK (extent, struct extent);
|
|
|
3861 }
|
|
|
3862
|
|
|
3863 static void
|
|
|
3864 sweep_events (void)
|
|
|
3865 {
|
|
|
3866 #define UNMARK_event(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
3867 #define ADDITIONAL_FREE_event(ptr)
|
|
|
3868
|
|
440
|
3869 SWEEP_FIXED_TYPE_BLOCK (event, Lisp_Event);
|
|
428
|
3870 }
|
|
|
3871
|
|
1204
|
3872 #ifdef EVENT_DATA_AS_OBJECTS
|
|
934
|
3873
|
|
|
3874 static void
|
|
|
3875 sweep_key_data (void)
|
|
|
3876 {
|
|
|
3877 #define UNMARK_key_data(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
3878 #define ADDITIONAL_FREE_key_data(ptr)
|
|
|
3879
|
|
|
3880 SWEEP_FIXED_TYPE_BLOCK (key_data, Lisp_Key_Data);
|
|
|
3881 }
|
|
|
3882
|
|
1204
|
3883 void
|
|
|
3884 free_key_data (Lisp_Object ptr)
|
|
|
3885 {
|
|
|
3886 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (key_data, Lisp_Key_Data, XKEY_DATA (ptr));
|
|
|
3887 }
|
|
|
3888
|
|
934
|
3889 static void
|
|
|
3890 sweep_button_data (void)
|
|
|
3891 {
|
|
|
3892 #define UNMARK_button_data(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
3893 #define ADDITIONAL_FREE_button_data(ptr)
|
|
|
3894
|
|
|
3895 SWEEP_FIXED_TYPE_BLOCK (button_data, Lisp_Button_Data);
|
|
|
3896 }
|
|
|
3897
|
|
1204
|
3898 void
|
|
|
3899 free_button_data (Lisp_Object ptr)
|
|
|
3900 {
|
|
|
3901 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (button_data, Lisp_Button_Data, XBUTTON_DATA (ptr));
|
|
|
3902 }
|
|
|
3903
|
|
934
|
3904 static void
|
|
|
3905 sweep_motion_data (void)
|
|
|
3906 {
|
|
|
3907 #define UNMARK_motion_data(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
3908 #define ADDITIONAL_FREE_motion_data(ptr)
|
|
|
3909
|
|
|
3910 SWEEP_FIXED_TYPE_BLOCK (motion_data, Lisp_Motion_Data);
|
|
|
3911 }
|
|
|
3912
|
|
1204
|
3913 void
|
|
|
3914 free_motion_data (Lisp_Object ptr)
|
|
|
3915 {
|
|
|
3916 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (motion_data, Lisp_Motion_Data, XMOTION_DATA (ptr));
|
|
|
3917 }
|
|
|
3918
|
|
934
|
3919 static void
|
|
|
3920 sweep_process_data (void)
|
|
|
3921 {
|
|
|
3922 #define UNMARK_process_data(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
3923 #define ADDITIONAL_FREE_process_data(ptr)
|
|
|
3924
|
|
|
3925 SWEEP_FIXED_TYPE_BLOCK (process_data, Lisp_Process_Data);
|
|
|
3926 }
|
|
|
3927
|
|
1204
|
3928 void
|
|
|
3929 free_process_data (Lisp_Object ptr)
|
|
|
3930 {
|
|
|
3931 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (process_data, Lisp_Process_Data, XPROCESS_DATA (ptr));
|
|
|
3932 }
|
|
|
3933
|
|
934
|
3934 static void
|
|
|
3935 sweep_timeout_data (void)
|
|
|
3936 {
|
|
|
3937 #define UNMARK_timeout_data(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
3938 #define ADDITIONAL_FREE_timeout_data(ptr)
|
|
|
3939
|
|
|
3940 SWEEP_FIXED_TYPE_BLOCK (timeout_data, Lisp_Timeout_Data);
|
|
|
3941 }
|
|
|
3942
|
|
1204
|
3943 void
|
|
|
3944 free_timeout_data (Lisp_Object ptr)
|
|
|
3945 {
|
|
|
3946 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (timeout_data, Lisp_Timeout_Data, XTIMEOUT_DATA (ptr));
|
|
|
3947 }
|
|
|
3948
|
|
934
|
3949 static void
|
|
|
3950 sweep_magic_data (void)
|
|
|
3951 {
|
|
|
3952 #define UNMARK_magic_data(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
3953 #define ADDITIONAL_FREE_magic_data(ptr)
|
|
|
3954
|
|
|
3955 SWEEP_FIXED_TYPE_BLOCK (magic_data, Lisp_Magic_Data);
|
|
|
3956 }
|
|
|
3957
|
|
1204
|
3958 void
|
|
|
3959 free_magic_data (Lisp_Object ptr)
|
|
|
3960 {
|
|
|
3961 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (magic_data, Lisp_Magic_Data, XMAGIC_DATA (ptr));
|
|
|
3962 }
|
|
|
3963
|
|
934
|
3964 static void
|
|
|
3965 sweep_magic_eval_data (void)
|
|
|
3966 {
|
|
|
3967 #define UNMARK_magic_eval_data(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
3968 #define ADDITIONAL_FREE_magic_eval_data(ptr)
|
|
|
3969
|
|
|
3970 SWEEP_FIXED_TYPE_BLOCK (magic_eval_data, Lisp_Magic_Eval_Data);
|
|
|
3971 }
|
|
|
3972
|
|
1204
|
3973 void
|
|
|
3974 free_magic_eval_data (Lisp_Object ptr)
|
|
|
3975 {
|
|
|
3976 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (magic_eval_data, Lisp_Magic_Eval_Data, XMAGIC_EVAL_DATA (ptr));
|
|
|
3977 }
|
|
|
3978
|
|
934
|
3979 static void
|
|
|
3980 sweep_eval_data (void)
|
|
|
3981 {
|
|
|
3982 #define UNMARK_eval_data(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
3983 #define ADDITIONAL_FREE_eval_data(ptr)
|
|
|
3984
|
|
|
3985 SWEEP_FIXED_TYPE_BLOCK (eval_data, Lisp_Eval_Data);
|
|
|
3986 }
|
|
|
3987
|
|
1204
|
3988 void
|
|
|
3989 free_eval_data (Lisp_Object ptr)
|
|
|
3990 {
|
|
|
3991 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (eval_data, Lisp_Eval_Data, XEVAL_DATA (ptr));
|
|
|
3992 }
|
|
|
3993
|
|
934
|
3994 static void
|
|
|
3995 sweep_misc_user_data (void)
|
|
|
3996 {
|
|
|
3997 #define UNMARK_misc_user_data(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
3998 #define ADDITIONAL_FREE_misc_user_data(ptr)
|
|
|
3999
|
|
|
4000 SWEEP_FIXED_TYPE_BLOCK (misc_user_data, Lisp_Misc_User_Data);
|
|
|
4001 }
|
|
|
4002
|
|
1204
|
4003 void
|
|
|
4004 free_misc_user_data (Lisp_Object ptr)
|
|
|
4005 {
|
|
|
4006 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (misc_user_data, Lisp_Misc_User_Data, XMISC_USER_DATA (ptr));
|
|
|
4007 }
|
|
|
4008
|
|
|
4009 #endif /* EVENT_DATA_AS_OBJECTS */
|
|
934
|
4010
|
|
428
|
4011 static void
|
|
|
4012 sweep_markers (void)
|
|
|
4013 {
|
|
|
4014 #define UNMARK_marker(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
4015 #define ADDITIONAL_FREE_marker(ptr) \
|
|
|
4016 do { Lisp_Object tem; \
|
|
793
|
4017 tem = wrap_marker (ptr); \
|
|
428
|
4018 unchain_marker (tem); \
|
|
|
4019 } while (0)
|
|
|
4020
|
|
440
|
4021 SWEEP_FIXED_TYPE_BLOCK (marker, Lisp_Marker);
|
|
428
|
4022 }
|
|
|
4023
|
|
|
4024 /* Explicitly free a marker. */
|
|
|
4025 void
|
|
1204
|
4026 free_marker (Lisp_Object ptr)
|
|
428
|
4027 {
|
|
1204
|
4028 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (marker, Lisp_Marker, XMARKER (ptr));
|
|
428
|
4029 }
|
|
|
4030
|
|
|
4031
|
|
|
4032 #if defined (MULE) && defined (VERIFY_STRING_CHARS_INTEGRITY)
|
|
|
4033
|
|
|
4034 static void
|
|
|
4035 verify_string_chars_integrity (void)
|
|
|
4036 {
|
|
|
4037 struct string_chars_block *sb;
|
|
|
4038
|
|
|
4039 /* Scan each existing string block sequentially, string by string. */
|
|
|
4040 for (sb = first_string_chars_block; sb; sb = sb->next)
|
|
|
4041 {
|
|
|
4042 int pos = 0;
|
|
|
4043 /* POS is the index of the next string in the block. */
|
|
|
4044 while (pos < sb->pos)
|
|
|
4045 {
|
|
|
4046 struct string_chars *s_chars =
|
|
|
4047 (struct string_chars *) &(sb->string_chars[pos]);
|
|
438
|
4048 Lisp_String *string;
|
|
428
|
4049 int size;
|
|
|
4050 int fullsize;
|
|
|
4051
|
|
454
|
4052 /* If the string_chars struct is marked as free (i.e. the
|
|
|
4053 STRING pointer is NULL) then this is an unused chunk of
|
|
|
4054 string storage. (See below.) */
|
|
|
4055
|
|
|
4056 if (STRING_CHARS_FREE_P (s_chars))
|
|
428
|
4057 {
|
|
|
4058 fullsize = ((struct unused_string_chars *) s_chars)->fullsize;
|
|
|
4059 pos += fullsize;
|
|
|
4060 continue;
|
|
|
4061 }
|
|
|
4062
|
|
|
4063 string = s_chars->string;
|
|
|
4064 /* Must be 32-bit aligned. */
|
|
|
4065 assert ((((int) string) & 3) == 0);
|
|
|
4066
|
|
793
|
4067 size = string->size_;
|
|
428
|
4068 fullsize = STRING_FULLSIZE (size);
|
|
|
4069
|
|
|
4070 assert (!BIG_STRING_FULLSIZE_P (fullsize));
|
|
793
|
4071 assert (string->data_ == s_chars->chars);
|
|
428
|
4072 pos += fullsize;
|
|
|
4073 }
|
|
|
4074 assert (pos == sb->pos);
|
|
|
4075 }
|
|
|
4076 }
|
|
|
4077
|
|
1204
|
4078 #endif /* defined (MULE) && defined (VERIFY_STRING_CHARS_INTEGRITY) */
|
|
428
|
4079
|
|
|
4080 /* Compactify string chars, relocating the reference to each --
|
|
|
4081 free any empty string_chars_block we see. */
|
|
|
4082 static void
|
|
|
4083 compact_string_chars (void)
|
|
|
4084 {
|
|
|
4085 struct string_chars_block *to_sb = first_string_chars_block;
|
|
|
4086 int to_pos = 0;
|
|
|
4087 struct string_chars_block *from_sb;
|
|
|
4088
|
|
|
4089 /* Scan each existing string block sequentially, string by string. */
|
|
|
4090 for (from_sb = first_string_chars_block; from_sb; from_sb = from_sb->next)
|
|
|
4091 {
|
|
|
4092 int from_pos = 0;
|
|
|
4093 /* FROM_POS is the index of the next string in the block. */
|
|
|
4094 while (from_pos < from_sb->pos)
|
|
|
4095 {
|
|
|
4096 struct string_chars *from_s_chars =
|
|
|
4097 (struct string_chars *) &(from_sb->string_chars[from_pos]);
|
|
|
4098 struct string_chars *to_s_chars;
|
|
438
|
4099 Lisp_String *string;
|
|
428
|
4100 int size;
|
|
|
4101 int fullsize;
|
|
|
4102
|
|
454
|
4103 /* If the string_chars struct is marked as free (i.e. the
|
|
|
4104 STRING pointer is NULL) then this is an unused chunk of
|
|
|
4105 string storage. This happens under Mule when a string's
|
|
|
4106 size changes in such a way that its fullsize changes.
|
|
|
4107 (Strings can change size because a different-length
|
|
|
4108 character can be substituted for another character.)
|
|
|
4109 In this case, after the bogus string pointer is the
|
|
|
4110 "fullsize" of this entry, i.e. how many bytes to skip. */
|
|
|
4111
|
|
|
4112 if (STRING_CHARS_FREE_P (from_s_chars))
|
|
428
|
4113 {
|
|
|
4114 fullsize = ((struct unused_string_chars *) from_s_chars)->fullsize;
|
|
|
4115 from_pos += fullsize;
|
|
|
4116 continue;
|
|
|
4117 }
|
|
|
4118
|
|
|
4119 string = from_s_chars->string;
|
|
1204
|
4120 gc_checking_assert (!(LRECORD_FREE_P (string)));
|
|
428
|
4121
|
|
793
|
4122 size = string->size_;
|
|
428
|
4123 fullsize = STRING_FULLSIZE (size);
|
|
|
4124
|
|
442
|
4125 gc_checking_assert (! BIG_STRING_FULLSIZE_P (fullsize));
|
|
428
|
4126
|
|
|
4127 /* Just skip it if it isn't marked. */
|
|
771
|
4128 if (! MARKED_RECORD_HEADER_P (&(string->u.lheader)))
|
|
428
|
4129 {
|
|
|
4130 from_pos += fullsize;
|
|
|
4131 continue;
|
|
|
4132 }
|
|
|
4133
|
|
|
4134 /* If it won't fit in what's left of TO_SB, close TO_SB out
|
|
|
4135 and go on to the next string_chars_block. We know that TO_SB
|
|
|
4136 cannot advance past FROM_SB here since FROM_SB is large enough
|
|
|
4137 to currently contain this string. */
|
|
|
4138 if ((to_pos + fullsize) > countof (to_sb->string_chars))
|
|
|
4139 {
|
|
|
4140 to_sb->pos = to_pos;
|
|
|
4141 to_sb = to_sb->next;
|
|
|
4142 to_pos = 0;
|
|
|
4143 }
|
|
|
4144
|
|
|
4145 /* Compute new address of this string
|
|
|
4146 and update TO_POS for the space being used. */
|
|
|
4147 to_s_chars = (struct string_chars *) &(to_sb->string_chars[to_pos]);
|
|
|
4148
|
|
|
4149 /* Copy the string_chars to the new place. */
|
|
|
4150 if (from_s_chars != to_s_chars)
|
|
|
4151 memmove (to_s_chars, from_s_chars, fullsize);
|
|
|
4152
|
|
|
4153 /* Relocate FROM_S_CHARS's reference */
|
|
826
|
4154 set_lispstringp_data (string, &(to_s_chars->chars[0]));
|
|
428
|
4155
|
|
|
4156 from_pos += fullsize;
|
|
|
4157 to_pos += fullsize;
|
|
|
4158 }
|
|
|
4159 }
|
|
|
4160
|
|
|
4161 /* Set current to the last string chars block still used and
|
|
|
4162 free any that follow. */
|
|
|
4163 {
|
|
|
4164 struct string_chars_block *victim;
|
|
|
4165
|
|
|
4166 for (victim = to_sb->next; victim; )
|
|
|
4167 {
|
|
|
4168 struct string_chars_block *next = victim->next;
|
|
|
4169 xfree (victim);
|
|
|
4170 victim = next;
|
|
|
4171 }
|
|
|
4172
|
|
|
4173 current_string_chars_block = to_sb;
|
|
|
4174 current_string_chars_block->pos = to_pos;
|
|
|
4175 current_string_chars_block->next = 0;
|
|
|
4176 }
|
|
|
4177 }
|
|
|
4178
|
|
|
4179 #if 1 /* Hack to debug missing purecopy's */
|
|
|
4180 static int debug_string_purity;
|
|
|
4181
|
|
|
4182 static void
|
|
793
|
4183 debug_string_purity_print (Lisp_Object p)
|
|
428
|
4184 {
|
|
|
4185 Charcount i;
|
|
826
|
4186 Charcount s = string_char_length (p);
|
|
442
|
4187 stderr_out ("\"");
|
|
428
|
4188 for (i = 0; i < s; i++)
|
|
|
4189 {
|
|
867
|
4190 Ichar ch = string_ichar (p, i);
|
|
428
|
4191 if (ch < 32 || ch >= 126)
|
|
|
4192 stderr_out ("\\%03o", ch);
|
|
|
4193 else if (ch == '\\' || ch == '\"')
|
|
|
4194 stderr_out ("\\%c", ch);
|
|
|
4195 else
|
|
|
4196 stderr_out ("%c", ch);
|
|
|
4197 }
|
|
|
4198 stderr_out ("\"\n");
|
|
|
4199 }
|
|
|
4200 #endif /* 1 */
|
|
|
4201
|
|
|
4202
|
|
|
4203 static void
|
|
|
4204 sweep_strings (void)
|
|
|
4205 {
|
|
647
|
4206 int num_small_used = 0;
|
|
|
4207 Bytecount num_small_bytes = 0, num_bytes = 0;
|
|
428
|
4208 int debug = debug_string_purity;
|
|
|
4209
|
|
793
|
4210 #define UNMARK_string(ptr) do { \
|
|
|
4211 Lisp_String *p = (ptr); \
|
|
|
4212 Bytecount size = p->size_; \
|
|
|
4213 UNMARK_RECORD_HEADER (&(p->u.lheader)); \
|
|
|
4214 num_bytes += size; \
|
|
|
4215 if (!BIG_STRING_SIZE_P (size)) \
|
|
|
4216 { \
|
|
|
4217 num_small_bytes += size; \
|
|
|
4218 num_small_used++; \
|
|
|
4219 } \
|
|
|
4220 if (debug) \
|
|
|
4221 debug_string_purity_print (wrap_string (p)); \
|
|
438
|
4222 } while (0)
|
|
|
4223 #define ADDITIONAL_FREE_string(ptr) do { \
|
|
793
|
4224 Bytecount size = ptr->size_; \
|
|
438
|
4225 if (BIG_STRING_SIZE_P (size)) \
|
|
793
|
4226 xfree (ptr->data_); \
|
|
438
|
4227 } while (0)
|
|
|
4228
|
|
771
|
4229 SWEEP_FIXED_TYPE_BLOCK_1 (string, Lisp_String, u.lheader);
|
|
428
|
4230
|
|
|
4231 gc_count_num_short_string_in_use = num_small_used;
|
|
|
4232 gc_count_string_total_size = num_bytes;
|
|
|
4233 gc_count_short_string_total_size = num_small_bytes;
|
|
|
4234 }
|
|
|
4235
|
|
|
4236
|
|
|
4237 /* I hate duplicating all this crap! */
|
|
|
4238 int
|
|
|
4239 marked_p (Lisp_Object obj)
|
|
|
4240 {
|
|
|
4241 /* Checks we used to perform. */
|
|
|
4242 /* if (EQ (obj, Qnull_pointer)) return 1; */
|
|
|
4243 /* if (!POINTER_TYPE_P (XGCTYPE (obj))) return 1; */
|
|
|
4244 /* if (PURIFIED (XPNTR (obj))) return 1; */
|
|
|
4245
|
|
|
4246 if (XTYPE (obj) == Lisp_Type_Record)
|
|
|
4247 {
|
|
|
4248 struct lrecord_header *lheader = XRECORD_LHEADER (obj);
|
|
442
|
4249
|
|
|
4250 GC_CHECK_LHEADER_INVARIANTS (lheader);
|
|
|
4251
|
|
|
4252 return MARKED_RECORD_HEADER_P (lheader);
|
|
428
|
4253 }
|
|
|
4254 return 1;
|
|
|
4255 }
|
|
|
4256
|
|
|
4257 static void
|
|
|
4258 gc_sweep (void)
|
|
|
4259 {
|
|
|
4260 /* Free all unmarked records. Do this at the very beginning,
|
|
|
4261 before anything else, so that the finalize methods can safely
|
|
|
4262 examine items in the objects. sweep_lcrecords_1() makes
|
|
|
4263 sure to call all the finalize methods *before* freeing anything,
|
|
|
4264 to complete the safety. */
|
|
|
4265 {
|
|
|
4266 int ignored;
|
|
|
4267 sweep_lcrecords_1 (&all_lcrecords, &ignored);
|
|
|
4268 }
|
|
|
4269
|
|
|
4270 compact_string_chars ();
|
|
|
4271
|
|
|
4272 /* Finalize methods below (called through the ADDITIONAL_FREE_foo
|
|
|
4273 macros) must be *extremely* careful to make sure they're not
|
|
|
4274 referencing freed objects. The only two existing finalize
|
|
|
4275 methods (for strings and markers) pass muster -- the string
|
|
|
4276 finalizer doesn't look at anything but its own specially-
|
|
|
4277 created block, and the marker finalizer only looks at live
|
|
|
4278 buffers (which will never be freed) and at the markers before
|
|
|
4279 and after it in the chain (which, by induction, will never be
|
|
|
4280 freed because if so, they would have already removed themselves
|
|
|
4281 from the chain). */
|
|
|
4282
|
|
|
4283 /* Put all unmarked strings on free list, free'ing the string chars
|
|
|
4284 of large unmarked strings */
|
|
|
4285 sweep_strings ();
|
|
|
4286
|
|
|
4287 /* Put all unmarked conses on free list */
|
|
|
4288 sweep_conses ();
|
|
|
4289
|
|
|
4290 /* Free all unmarked compiled-function objects */
|
|
|
4291 sweep_compiled_functions ();
|
|
|
4292
|
|
|
4293 /* Put all unmarked floats on free list */
|
|
|
4294 sweep_floats ();
|
|
|
4295
|
|
|
4296 /* Put all unmarked symbols on free list */
|
|
|
4297 sweep_symbols ();
|
|
|
4298
|
|
|
4299 /* Put all unmarked extents on free list */
|
|
|
4300 sweep_extents ();
|
|
|
4301
|
|
|
4302 /* Put all unmarked markers on free list.
|
|
|
4303 Dechain each one first from the buffer into which it points. */
|
|
|
4304 sweep_markers ();
|
|
|
4305
|
|
|
4306 sweep_events ();
|
|
|
4307
|
|
1204
|
4308 #ifdef EVENT_DATA_AS_OBJECTS
|
|
934
|
4309 sweep_key_data ();
|
|
|
4310 sweep_button_data ();
|
|
|
4311 sweep_motion_data ();
|
|
|
4312 sweep_process_data ();
|
|
|
4313 sweep_timeout_data ();
|
|
|
4314 sweep_magic_data ();
|
|
|
4315 sweep_magic_eval_data ();
|
|
|
4316 sweep_eval_data ();
|
|
|
4317 sweep_misc_user_data ();
|
|
1204
|
4318 #endif /* EVENT_DATA_AS_OBJECTS */
|
|
934
|
4319
|
|
428
|
4320 #ifdef PDUMP
|
|
442
|
4321 pdump_objects_unmark ();
|
|
428
|
4322 #endif
|
|
|
4323 }
|
|
|
4324
|
|
|
4325 /* Clearing for disksave. */
|
|
|
4326
|
|
|
4327 void
|
|
|
4328 disksave_object_finalization (void)
|
|
|
4329 {
|
|
|
4330 /* It's important that certain information from the environment not get
|
|
|
4331 dumped with the executable (pathnames, environment variables, etc.).
|
|
|
4332 To make it easier to tell when this has happened with strings(1) we
|
|
|
4333 clear some known-to-be-garbage blocks of memory, so that leftover
|
|
|
4334 results of old evaluation don't look like potential problems.
|
|
|
4335 But first we set some notable variables to nil and do one more GC,
|
|
|
4336 to turn those strings into garbage.
|
|
440
|
4337 */
|
|
428
|
4338
|
|
|
4339 /* Yeah, this list is pretty ad-hoc... */
|
|
|
4340 Vprocess_environment = Qnil;
|
|
771
|
4341 env_initted = 0;
|
|
428
|
4342 Vexec_directory = Qnil;
|
|
|
4343 Vdata_directory = Qnil;
|
|
|
4344 Vsite_directory = Qnil;
|
|
|
4345 Vdoc_directory = Qnil;
|
|
|
4346 Vexec_path = Qnil;
|
|
|
4347 Vload_path = Qnil;
|
|
|
4348 /* Vdump_load_path = Qnil; */
|
|
|
4349 /* Release hash tables for locate_file */
|
|
|
4350 Flocate_file_clear_hashing (Qt);
|
|
771
|
4351 uncache_home_directory ();
|
|
776
|
4352 zero_out_command_line_status_vars ();
|
|
872
|
4353 clear_default_devices ();
|
|
428
|
4354
|
|
|
4355 #if defined(LOADHIST) && !(defined(LOADHIST_DUMPED) || \
|
|
|
4356 defined(LOADHIST_BUILTIN))
|
|
|
4357 Vload_history = Qnil;
|
|
|
4358 #endif
|
|
|
4359 Vshell_file_name = Qnil;
|
|
|
4360
|
|
|
4361 garbage_collect_1 ();
|
|
|
4362
|
|
|
4363 /* Run the disksave finalization methods of all live objects. */
|
|
|
4364 disksave_object_finalization_1 ();
|
|
|
4365
|
|
|
4366 /* Zero out the uninitialized (really, unused) part of the containers
|
|
|
4367 for the live strings. */
|
|
|
4368 {
|
|
|
4369 struct string_chars_block *scb;
|
|
|
4370 for (scb = first_string_chars_block; scb; scb = scb->next)
|
|
|
4371 {
|
|
|
4372 int count = sizeof (scb->string_chars) - scb->pos;
|
|
|
4373
|
|
|
4374 assert (count >= 0 && count < STRING_CHARS_BLOCK_SIZE);
|
|
440
|
4375 if (count != 0)
|
|
|
4376 {
|
|
|
4377 /* from the block's fill ptr to the end */
|
|
|
4378 memset ((scb->string_chars + scb->pos), 0, count);
|
|
|
4379 }
|
|
428
|
4380 }
|
|
|
4381 }
|
|
|
4382
|
|
|
4383 /* There, that ought to be enough... */
|
|
|
4384
|
|
|
4385 }
|
|
|
4386
|
|
|
4387
|
|
771
|
4388 int
|
|
|
4389 begin_gc_forbidden (void)
|
|
|
4390 {
|
|
853
|
4391 return internal_bind_int (&gc_currently_forbidden, 1);
|
|
771
|
4392 }
|
|
|
4393
|
|
|
4394 void
|
|
|
4395 end_gc_forbidden (int count)
|
|
|
4396 {
|
|
|
4397 unbind_to (count);
|
|
|
4398 }
|
|
|
4399
|
|
428
|
4400 /* Maybe we want to use this when doing a "panic" gc after memory_full()? */
|
|
|
4401 static int gc_hooks_inhibited;
|
|
|
4402
|
|
611
|
4403 struct post_gc_action
|
|
|
4404 {
|
|
|
4405 void (*fun) (void *);
|
|
|
4406 void *arg;
|
|
|
4407 };
|
|
|
4408
|
|
|
4409 typedef struct post_gc_action post_gc_action;
|
|
|
4410
|
|
|
4411 typedef struct
|
|
|
4412 {
|
|
|
4413 Dynarr_declare (post_gc_action);
|
|
|
4414 } post_gc_action_dynarr;
|
|
|
4415
|
|
|
4416 static post_gc_action_dynarr *post_gc_actions;
|
|
|
4417
|
|
|
4418 /* Register an action to be called at the end of GC.
|
|
|
4419 gc_in_progress is 0 when this is called.
|
|
|
4420 This is used when it is discovered that an action needs to be taken,
|
|
|
4421 but it's during GC, so it's not safe. (e.g. in a finalize method.)
|
|
|
4422
|
|
|
4423 As a general rule, do not use Lisp objects here.
|
|
|
4424 And NEVER signal an error.
|
|
|
4425 */
|
|
|
4426
|
|
|
4427 void
|
|
|
4428 register_post_gc_action (void (*fun) (void *), void *arg)
|
|
|
4429 {
|
|
|
4430 post_gc_action action;
|
|
|
4431
|
|
|
4432 if (!post_gc_actions)
|
|
|
4433 post_gc_actions = Dynarr_new (post_gc_action);
|
|
|
4434
|
|
|
4435 action.fun = fun;
|
|
|
4436 action.arg = arg;
|
|
|
4437
|
|
|
4438 Dynarr_add (post_gc_actions, action);
|
|
|
4439 }
|
|
|
4440
|
|
|
4441 static void
|
|
|
4442 run_post_gc_actions (void)
|
|
|
4443 {
|
|
|
4444 int i;
|
|
|
4445
|
|
|
4446 if (post_gc_actions)
|
|
|
4447 {
|
|
|
4448 for (i = 0; i < Dynarr_length (post_gc_actions); i++)
|
|
|
4449 {
|
|
|
4450 post_gc_action action = Dynarr_at (post_gc_actions, i);
|
|
|
4451 (action.fun) (action.arg);
|
|
|
4452 }
|
|
|
4453
|
|
|
4454 Dynarr_reset (post_gc_actions);
|
|
|
4455 }
|
|
|
4456 }
|
|
|
4457
|
|
428
|
4458
|
|
|
4459 void
|
|
|
4460 garbage_collect_1 (void)
|
|
|
4461 {
|
|
|
4462 #if MAX_SAVE_STACK > 0
|
|
|
4463 char stack_top_variable;
|
|
|
4464 extern char *stack_bottom;
|
|
|
4465 #endif
|
|
|
4466 struct frame *f;
|
|
|
4467 int speccount;
|
|
|
4468 int cursor_changed;
|
|
|
4469 Lisp_Object pre_gc_cursor;
|
|
|
4470 struct gcpro gcpro1;
|
|
1292
|
4471 PROFILE_DECLARE ();
|
|
428
|
4472
|
|
1123
|
4473 assert (!in_display || gc_currently_forbidden);
|
|
|
4474
|
|
428
|
4475 if (gc_in_progress
|
|
|
4476 || gc_currently_forbidden
|
|
|
4477 || in_display
|
|
|
4478 || preparing_for_armageddon)
|
|
|
4479 return;
|
|
|
4480
|
|
1292
|
4481 PROFILE_RECORD_ENTERING_SECTION (QSin_garbage_collection);
|
|
|
4482
|
|
428
|
4483 /* We used to call selected_frame() here.
|
|
|
4484
|
|
|
4485 The following functions cannot be called inside GC
|
|
|
4486 so we move to after the above tests. */
|
|
|
4487 {
|
|
|
4488 Lisp_Object frame;
|
|
|
4489 Lisp_Object device = Fselected_device (Qnil);
|
|
|
4490 if (NILP (device)) /* Could happen during startup, eg. if always_gc */
|
|
|
4491 return;
|
|
872
|
4492 frame = Fselected_frame (device);
|
|
428
|
4493 if (NILP (frame))
|
|
563
|
4494 invalid_state ("No frames exist on device", device);
|
|
428
|
4495 f = XFRAME (frame);
|
|
|
4496 }
|
|
|
4497
|
|
|
4498 pre_gc_cursor = Qnil;
|
|
|
4499 cursor_changed = 0;
|
|
|
4500
|
|
|
4501 GCPRO1 (pre_gc_cursor);
|
|
|
4502
|
|
|
4503 /* Very important to prevent GC during any of the following
|
|
|
4504 stuff that might run Lisp code; otherwise, we'll likely
|
|
|
4505 have infinite GC recursion. */
|
|
771
|
4506 speccount = begin_gc_forbidden ();
|
|
428
|
4507
|
|
887
|
4508 need_to_signal_post_gc = 0;
|
|
1318
|
4509 recompute_funcall_allocation_flag ();
|
|
887
|
4510
|
|
428
|
4511 if (!gc_hooks_inhibited)
|
|
853
|
4512 run_hook_trapping_problems
|
|
1333
|
4513 (Qgarbage_collecting, Qpre_gc_hook,
|
|
853
|
4514 INHIBIT_EXISTING_PERMANENT_DISPLAY_OBJECT_DELETION);
|
|
428
|
4515
|
|
|
4516 /* Now show the GC cursor/message. */
|
|
|
4517 if (!noninteractive)
|
|
|
4518 {
|
|
|
4519 if (FRAME_WIN_P (f))
|
|
|
4520 {
|
|
771
|
4521 Lisp_Object frame = wrap_frame (f);
|
|
428
|
4522 Lisp_Object cursor = glyph_image_instance (Vgc_pointer_glyph,
|
|
|
4523 FRAME_SELECTED_WINDOW (f),
|
|
|
4524 ERROR_ME_NOT, 1);
|
|
|
4525 pre_gc_cursor = f->pointer;
|
|
|
4526 if (POINTER_IMAGE_INSTANCEP (cursor)
|
|
|
4527 /* don't change if we don't know how to change back. */
|
|
|
4528 && POINTER_IMAGE_INSTANCEP (pre_gc_cursor))
|
|
|
4529 {
|
|
|
4530 cursor_changed = 1;
|
|
|
4531 Fset_frame_pointer (frame, cursor);
|
|
|
4532 }
|
|
|
4533 }
|
|
|
4534
|
|
|
4535 /* Don't print messages to the stream device. */
|
|
|
4536 if (!cursor_changed && !FRAME_STREAM_P (f))
|
|
|
4537 {
|
|
1154
|
4538 if (garbage_collection_messages)
|
|
|
4539 {
|
|
|
4540 Lisp_Object args[2], whole_msg;
|
|
|
4541 args[0] = (STRINGP (Vgc_message) ? Vgc_message :
|
|
|
4542 build_msg_string (gc_default_message));
|
|
|
4543 args[1] = build_string ("...");
|
|
|
4544 whole_msg = Fconcat (2, args);
|
|
|
4545 echo_area_message (f, (Ibyte *) 0, whole_msg, 0, -1,
|
|
|
4546 Qgarbage_collecting);
|
|
|
4547 }
|
|
428
|
4548 }
|
|
|
4549 }
|
|
|
4550
|
|
|
4551 /***** Now we actually start the garbage collection. */
|
|
|
4552
|
|
|
4553 gc_in_progress = 1;
|
|
771
|
4554 inhibit_non_essential_printing_operations = 1;
|
|
428
|
4555
|
|
|
4556 gc_generation_number[0]++;
|
|
|
4557
|
|
|
4558 #if MAX_SAVE_STACK > 0
|
|
|
4559
|
|
|
4560 /* Save a copy of the contents of the stack, for debugging. */
|
|
|
4561 if (!purify_flag)
|
|
|
4562 {
|
|
|
4563 /* Static buffer in which we save a copy of the C stack at each GC. */
|
|
|
4564 static char *stack_copy;
|
|
665
|
4565 static Bytecount stack_copy_size;
|
|
428
|
4566
|
|
|
4567 ptrdiff_t stack_diff = &stack_top_variable - stack_bottom;
|
|
665
|
4568 Bytecount stack_size = (stack_diff > 0 ? stack_diff : -stack_diff);
|
|
428
|
4569 if (stack_size < MAX_SAVE_STACK)
|
|
|
4570 {
|
|
|
4571 if (stack_copy_size < stack_size)
|
|
|
4572 {
|
|
|
4573 stack_copy = (char *) xrealloc (stack_copy, stack_size);
|
|
|
4574 stack_copy_size = stack_size;
|
|
|
4575 }
|
|
|
4576
|
|
|
4577 memcpy (stack_copy,
|
|
|
4578 stack_diff > 0 ? stack_bottom : &stack_top_variable,
|
|
|
4579 stack_size);
|
|
|
4580 }
|
|
|
4581 }
|
|
|
4582 #endif /* MAX_SAVE_STACK > 0 */
|
|
|
4583
|
|
|
4584 /* Do some totally ad-hoc resource clearing. */
|
|
|
4585 /* #### generalize this? */
|
|
|
4586 clear_event_resource ();
|
|
|
4587 cleanup_specifiers ();
|
|
1204
|
4588 cleanup_buffer_undo_lists ();
|
|
428
|
4589
|
|
|
4590 /* Mark all the special slots that serve as the roots of accessibility. */
|
|
|
4591
|
|
1598
|
4592 #ifdef USE_KKCC
|
|
|
4593 /* initialize kkcc stack */
|
|
|
4594 kkcc_gc_stack_init();
|
|
|
4595 #endif /* USE_KKCC */
|
|
|
4596
|
|
428
|
4597 { /* staticpro() */
|
|
452
|
4598 Lisp_Object **p = Dynarr_begin (staticpros);
|
|
665
|
4599 Elemcount count;
|
|
452
|
4600 for (count = Dynarr_length (staticpros); count; count--)
|
|
1598
|
4601 #ifdef USE_KKCC
|
|
|
4602 kkcc_gc_stack_push_lisp_object (**p++);
|
|
|
4603 #else /* NOT USE_KKCC */
|
|
452
|
4604 mark_object (**p++);
|
|
1598
|
4605 #endif /* NOT USE_KKCC */
|
|
452
|
4606 }
|
|
|
4607
|
|
|
4608 { /* staticpro_nodump() */
|
|
|
4609 Lisp_Object **p = Dynarr_begin (staticpros_nodump);
|
|
665
|
4610 Elemcount count;
|
|
452
|
4611 for (count = Dynarr_length (staticpros_nodump); count; count--)
|
|
1598
|
4612 #ifdef USE_KKCC
|
|
|
4613 kkcc_gc_stack_push_lisp_object (**p++);
|
|
|
4614 #else /* NOT USE_KKCC */
|
|
452
|
4615 mark_object (**p++);
|
|
1598
|
4616 #endif /* NOT USE_KKCC */
|
|
428
|
4617 }
|
|
|
4618
|
|
|
4619 { /* GCPRO() */
|
|
|
4620 struct gcpro *tail;
|
|
|
4621 int i;
|
|
|
4622 for (tail = gcprolist; tail; tail = tail->next)
|
|
|
4623 for (i = 0; i < tail->nvars; i++)
|
|
1598
|
4624 #ifdef USE_KKCC
|
|
|
4625 kkcc_gc_stack_push_lisp_object (tail->var[i]);
|
|
|
4626 #else /* NOT USE_KKCC */
|
|
428
|
4627 mark_object (tail->var[i]);
|
|
1598
|
4628 #endif /* NOT USE_KKCC */
|
|
428
|
4629 }
|
|
|
4630
|
|
|
4631 { /* specbind() */
|
|
|
4632 struct specbinding *bind;
|
|
|
4633 for (bind = specpdl; bind != specpdl_ptr; bind++)
|
|
|
4634 {
|
|
1598
|
4635 #ifdef USE_KKCC
|
|
|
4636 kkcc_gc_stack_push_lisp_object (bind->symbol);
|
|
|
4637 kkcc_gc_stack_push_lisp_object (bind->old_value);
|
|
|
4638 #else /* NOT USE_KKCC */
|
|
428
|
4639 mark_object (bind->symbol);
|
|
|
4640 mark_object (bind->old_value);
|
|
1598
|
4641 #endif /* NOT USE_KKCC */
|
|
428
|
4642 }
|
|
|
4643 }
|
|
|
4644
|
|
|
4645 {
|
|
|
4646 struct catchtag *catch;
|
|
|
4647 for (catch = catchlist; catch; catch = catch->next)
|
|
|
4648 {
|
|
1598
|
4649 #ifdef USE_KKCC
|
|
|
4650 kkcc_gc_stack_push_lisp_object (catch->tag);
|
|
|
4651 kkcc_gc_stack_push_lisp_object (catch->val);
|
|
|
4652 kkcc_gc_stack_push_lisp_object (catch->actual_tag);
|
|
|
4653 #else /* NOT USE_KKCC */
|
|
428
|
4654 mark_object (catch->tag);
|
|
|
4655 mark_object (catch->val);
|
|
853
|
4656 mark_object (catch->actual_tag);
|
|
1598
|
4657 #endif /* NOT USE_KKCC */
|
|
428
|
4658 }
|
|
|
4659 }
|
|
|
4660
|
|
|
4661 {
|
|
|
4662 struct backtrace *backlist;
|
|
|
4663 for (backlist = backtrace_list; backlist; backlist = backlist->next)
|
|
|
4664 {
|
|
|
4665 int nargs = backlist->nargs;
|
|
|
4666 int i;
|
|
|
4667
|
|
1598
|
4668 #ifdef USE_KKCC
|
|
|
4669 kkcc_gc_stack_push_lisp_object (*backlist->function);
|
|
|
4670 if (nargs < 0 /* nargs == UNEVALLED || nargs == MANY */
|
|
|
4671 /* might be fake (internal profiling entry) */
|
|
|
4672 && backlist->args)
|
|
|
4673 kkcc_gc_stack_push_lisp_object (backlist->args[0]);
|
|
|
4674 else
|
|
|
4675 for (i = 0; i < nargs; i++)
|
|
|
4676 kkcc_gc_stack_push_lisp_object (backlist->args[i]);
|
|
|
4677 #else /* NOT USE_KKCC */
|
|
428
|
4678 mark_object (*backlist->function);
|
|
1292
|
4679 if (nargs < 0 /* nargs == UNEVALLED || nargs == MANY */
|
|
|
4680 /* might be fake (internal profiling entry) */
|
|
|
4681 && backlist->args)
|
|
428
|
4682 mark_object (backlist->args[0]);
|
|
|
4683 else
|
|
|
4684 for (i = 0; i < nargs; i++)
|
|
|
4685 mark_object (backlist->args[i]);
|
|
1598
|
4686 #endif /* NOT USE_KKCC */
|
|
428
|
4687 }
|
|
|
4688 }
|
|
|
4689
|
|
|
4690 mark_profiling_info ();
|
|
|
4691
|
|
|
4692 /* OK, now do the after-mark stuff. This is for things that
|
|
|
4693 are only marked when something else is marked (e.g. weak hash tables).
|
|
|
4694 There may be complex dependencies between such objects -- e.g.
|
|
|
4695 a weak hash table might be unmarked, but after processing a later
|
|
|
4696 weak hash table, the former one might get marked. So we have to
|
|
|
4697 iterate until nothing more gets marked. */
|
|
1598
|
4698 #ifdef USE_KKCC
|
|
|
4699 kkcc_marking ();
|
|
|
4700 #endif /* USE_KKCC */
|
|
1590
|
4701 init_marking_ephemerons ();
|
|
428
|
4702 while (finish_marking_weak_hash_tables () > 0 ||
|
|
887
|
4703 finish_marking_weak_lists () > 0 ||
|
|
1590
|
4704 continue_marking_ephemerons () > 0)
|
|
|
4705 ;
|
|
|
4706
|
|
1598
|
4707 #ifdef USE_KKCC
|
|
|
4708 kkcc_marking ();
|
|
|
4709 kkcc_gc_stack_free ();
|
|
|
4710 #endif /* USE_KKCC */
|
|
|
4711
|
|
1590
|
4712 /* At this point, we know which objects need to be finalized: we
|
|
|
4713 still need to resurrect them */
|
|
|
4714
|
|
|
4715 while (finish_marking_ephemerons () > 0 ||
|
|
|
4716 finish_marking_weak_lists () > 0 ||
|
|
|
4717 finish_marking_weak_hash_tables () > 0)
|
|
428
|
4718 ;
|
|
|
4719
|
|
|
4720 /* And prune (this needs to be called after everything else has been
|
|
|
4721 marked and before we do any sweeping). */
|
|
|
4722 /* #### this is somewhat ad-hoc and should probably be an object
|
|
|
4723 method */
|
|
|
4724 prune_weak_hash_tables ();
|
|
|
4725 prune_weak_lists ();
|
|
|
4726 prune_specifiers ();
|
|
|
4727 prune_syntax_tables ();
|
|
|
4728
|
|
887
|
4729 prune_ephemerons ();
|
|
858
|
4730 prune_weak_boxes ();
|
|
|
4731
|
|
428
|
4732 gc_sweep ();
|
|
|
4733
|
|
|
4734 consing_since_gc = 0;
|
|
|
4735 #ifndef DEBUG_XEMACS
|
|
|
4736 /* Allow you to set it really fucking low if you really want ... */
|
|
|
4737 if (gc_cons_threshold < 10000)
|
|
|
4738 gc_cons_threshold = 10000;
|
|
|
4739 #endif
|
|
814
|
4740 recompute_need_to_garbage_collect ();
|
|
428
|
4741
|
|
771
|
4742 inhibit_non_essential_printing_operations = 0;
|
|
428
|
4743 gc_in_progress = 0;
|
|
|
4744
|
|
611
|
4745 run_post_gc_actions ();
|
|
|
4746
|
|
428
|
4747 /******* End of garbage collection ********/
|
|
|
4748
|
|
|
4749 /* Now remove the GC cursor/message */
|
|
|
4750 if (!noninteractive)
|
|
|
4751 {
|
|
|
4752 if (cursor_changed)
|
|
771
|
4753 Fset_frame_pointer (wrap_frame (f), pre_gc_cursor);
|
|
428
|
4754 else if (!FRAME_STREAM_P (f))
|
|
|
4755 {
|
|
|
4756 /* Show "...done" only if the echo area would otherwise be empty. */
|
|
|
4757 if (NILP (clear_echo_area (selected_frame (),
|
|
|
4758 Qgarbage_collecting, 0)))
|
|
|
4759 {
|
|
1154
|
4760 if (garbage_collection_messages)
|
|
|
4761 {
|
|
|
4762 Lisp_Object args[2], whole_msg;
|
|
|
4763 args[0] = (STRINGP (Vgc_message) ? Vgc_message :
|
|
|
4764 build_msg_string (gc_default_message));
|
|
|
4765 args[1] = build_msg_string ("... done");
|
|
|
4766 whole_msg = Fconcat (2, args);
|
|
|
4767 echo_area_message (selected_frame (), (Ibyte *) 0,
|
|
|
4768 whole_msg, 0, -1,
|
|
|
4769 Qgarbage_collecting);
|
|
|
4770 }
|
|
428
|
4771 }
|
|
|
4772 }
|
|
|
4773 }
|
|
|
4774
|
|
|
4775 /* now stop inhibiting GC */
|
|
771
|
4776 unbind_to (speccount);
|
|
428
|
4777
|
|
|
4778 if (!breathing_space)
|
|
|
4779 {
|
|
|
4780 breathing_space = malloc (4096 - MALLOC_OVERHEAD);
|
|
|
4781 }
|
|
|
4782
|
|
|
4783 UNGCPRO;
|
|
887
|
4784
|
|
|
4785 need_to_signal_post_gc = 1;
|
|
|
4786 funcall_allocation_flag = 1;
|
|
|
4787
|
|
1292
|
4788 PROFILE_RECORD_EXITING_SECTION (QSin_garbage_collection);
|
|
|
4789
|
|
428
|
4790 return;
|
|
|
4791 }
|
|
|
4792
|
|
|
4793 /* Debugging aids. */
|
|
|
4794
|
|
|
4795 static Lisp_Object
|
|
771
|
4796 gc_plist_hack (const Char_ASCII *name, int value, Lisp_Object tail)
|
|
428
|
4797 {
|
|
|
4798 /* C doesn't have local functions (or closures, or GC, or readable syntax,
|
|
|
4799 or portable numeric datatypes, or bit-vectors, or characters, or
|
|
|
4800 arrays, or exceptions, or ...) */
|
|
|
4801 return cons3 (intern (name), make_int (value), tail);
|
|
|
4802 }
|
|
|
4803
|
|
|
4804 #define HACK_O_MATIC(type, name, pl) do { \
|
|
|
4805 int s = 0; \
|
|
|
4806 struct type##_block *x = current_##type##_block; \
|
|
|
4807 while (x) { s += sizeof (*x) + MALLOC_OVERHEAD; x = x->prev; } \
|
|
|
4808 (pl) = gc_plist_hack ((name), s, (pl)); \
|
|
|
4809 } while (0)
|
|
|
4810
|
|
|
4811 DEFUN ("garbage-collect", Fgarbage_collect, 0, 0, "", /*
|
|
|
4812 Reclaim storage for Lisp objects no longer needed.
|
|
|
4813 Return info on amount of space in use:
|
|
|
4814 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
|
|
|
4815 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
|
|
|
4816 PLIST)
|
|
|
4817 where `PLIST' is a list of alternating keyword/value pairs providing
|
|
|
4818 more detailed information.
|
|
|
4819 Garbage collection happens automatically if you cons more than
|
|
|
4820 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
|
|
|
4821 */
|
|
|
4822 ())
|
|
|
4823 {
|
|
|
4824 Lisp_Object pl = Qnil;
|
|
647
|
4825 int i;
|
|
428
|
4826 int gc_count_vector_total_size = 0;
|
|
|
4827 garbage_collect_1 ();
|
|
|
4828
|
|
442
|
4829 for (i = 0; i < lrecord_type_count; i++)
|
|
428
|
4830 {
|
|
|
4831 if (lcrecord_stats[i].bytes_in_use != 0
|
|
|
4832 || lcrecord_stats[i].bytes_freed != 0
|
|
|
4833 || lcrecord_stats[i].instances_on_free_list != 0)
|
|
|
4834 {
|
|
|
4835 char buf [255];
|
|
442
|
4836 const char *name = lrecord_implementations_table[i]->name;
|
|
428
|
4837 int len = strlen (name);
|
|
|
4838 /* save this for the FSFmacs-compatible part of the summary */
|
|
460
|
4839 if (i == lrecord_type_vector)
|
|
428
|
4840 gc_count_vector_total_size =
|
|
|
4841 lcrecord_stats[i].bytes_in_use + lcrecord_stats[i].bytes_freed;
|
|
|
4842
|
|
|
4843 sprintf (buf, "%s-storage", name);
|
|
|
4844 pl = gc_plist_hack (buf, lcrecord_stats[i].bytes_in_use, pl);
|
|
|
4845 /* Okay, simple pluralization check for `symbol-value-varalias' */
|
|
|
4846 if (name[len-1] == 's')
|
|
|
4847 sprintf (buf, "%ses-freed", name);
|
|
|
4848 else
|
|
|
4849 sprintf (buf, "%ss-freed", name);
|
|
|
4850 if (lcrecord_stats[i].instances_freed != 0)
|
|
|
4851 pl = gc_plist_hack (buf, lcrecord_stats[i].instances_freed, pl);
|
|
|
4852 if (name[len-1] == 's')
|
|
|
4853 sprintf (buf, "%ses-on-free-list", name);
|
|
|
4854 else
|
|
|
4855 sprintf (buf, "%ss-on-free-list", name);
|
|
|
4856 if (lcrecord_stats[i].instances_on_free_list != 0)
|
|
|
4857 pl = gc_plist_hack (buf, lcrecord_stats[i].instances_on_free_list,
|
|
|
4858 pl);
|
|
|
4859 if (name[len-1] == 's')
|
|
|
4860 sprintf (buf, "%ses-used", name);
|
|
|
4861 else
|
|
|
4862 sprintf (buf, "%ss-used", name);
|
|
|
4863 pl = gc_plist_hack (buf, lcrecord_stats[i].instances_in_use, pl);
|
|
|
4864 }
|
|
|
4865 }
|
|
|
4866
|
|
|
4867 HACK_O_MATIC (extent, "extent-storage", pl);
|
|
|
4868 pl = gc_plist_hack ("extents-free", gc_count_num_extent_freelist, pl);
|
|
|
4869 pl = gc_plist_hack ("extents-used", gc_count_num_extent_in_use, pl);
|
|
|
4870 HACK_O_MATIC (event, "event-storage", pl);
|
|
|
4871 pl = gc_plist_hack ("events-free", gc_count_num_event_freelist, pl);
|
|
|
4872 pl = gc_plist_hack ("events-used", gc_count_num_event_in_use, pl);
|
|
|
4873 HACK_O_MATIC (marker, "marker-storage", pl);
|
|
|
4874 pl = gc_plist_hack ("markers-free", gc_count_num_marker_freelist, pl);
|
|
|
4875 pl = gc_plist_hack ("markers-used", gc_count_num_marker_in_use, pl);
|
|
|
4876 HACK_O_MATIC (float, "float-storage", pl);
|
|
|
4877 pl = gc_plist_hack ("floats-free", gc_count_num_float_freelist, pl);
|
|
|
4878 pl = gc_plist_hack ("floats-used", gc_count_num_float_in_use, pl);
|
|
|
4879 HACK_O_MATIC (string, "string-header-storage", pl);
|
|
|
4880 pl = gc_plist_hack ("long-strings-total-length",
|
|
|
4881 gc_count_string_total_size
|
|
|
4882 - gc_count_short_string_total_size, pl);
|
|
|
4883 HACK_O_MATIC (string_chars, "short-string-storage", pl);
|
|
|
4884 pl = gc_plist_hack ("short-strings-total-length",
|
|
|
4885 gc_count_short_string_total_size, pl);
|
|
|
4886 pl = gc_plist_hack ("strings-free", gc_count_num_string_freelist, pl);
|
|
|
4887 pl = gc_plist_hack ("long-strings-used",
|
|
|
4888 gc_count_num_string_in_use
|
|
|
4889 - gc_count_num_short_string_in_use, pl);
|
|
|
4890 pl = gc_plist_hack ("short-strings-used",
|
|
|
4891 gc_count_num_short_string_in_use, pl);
|
|
|
4892
|
|
|
4893 HACK_O_MATIC (compiled_function, "compiled-function-storage", pl);
|
|
|
4894 pl = gc_plist_hack ("compiled-functions-free",
|
|
|
4895 gc_count_num_compiled_function_freelist, pl);
|
|
|
4896 pl = gc_plist_hack ("compiled-functions-used",
|
|
|
4897 gc_count_num_compiled_function_in_use, pl);
|
|
|
4898
|
|
|
4899 HACK_O_MATIC (symbol, "symbol-storage", pl);
|
|
|
4900 pl = gc_plist_hack ("symbols-free", gc_count_num_symbol_freelist, pl);
|
|
|
4901 pl = gc_plist_hack ("symbols-used", gc_count_num_symbol_in_use, pl);
|
|
|
4902
|
|
|
4903 HACK_O_MATIC (cons, "cons-storage", pl);
|
|
|
4904 pl = gc_plist_hack ("conses-free", gc_count_num_cons_freelist, pl);
|
|
|
4905 pl = gc_plist_hack ("conses-used", gc_count_num_cons_in_use, pl);
|
|
|
4906
|
|
|
4907 /* The things we do for backwards-compatibility */
|
|
|
4908 return
|
|
|
4909 list6 (Fcons (make_int (gc_count_num_cons_in_use),
|
|
|
4910 make_int (gc_count_num_cons_freelist)),
|
|
|
4911 Fcons (make_int (gc_count_num_symbol_in_use),
|
|
|
4912 make_int (gc_count_num_symbol_freelist)),
|
|
|
4913 Fcons (make_int (gc_count_num_marker_in_use),
|
|
|
4914 make_int (gc_count_num_marker_freelist)),
|
|
|
4915 make_int (gc_count_string_total_size),
|
|
|
4916 make_int (gc_count_vector_total_size),
|
|
|
4917 pl);
|
|
|
4918 }
|
|
|
4919 #undef HACK_O_MATIC
|
|
|
4920
|
|
|
4921 DEFUN ("consing-since-gc", Fconsing_since_gc, 0, 0, "", /*
|
|
|
4922 Return the number of bytes consed since the last garbage collection.
|
|
|
4923 \"Consed\" is a misnomer in that this actually counts allocation
|
|
|
4924 of all different kinds of objects, not just conses.
|
|
|
4925
|
|
|
4926 If this value exceeds `gc-cons-threshold', a garbage collection happens.
|
|
|
4927 */
|
|
|
4928 ())
|
|
|
4929 {
|
|
|
4930 return make_int (consing_since_gc);
|
|
|
4931 }
|
|
|
4932
|
|
440
|
4933 #if 0
|
|
444
|
4934 DEFUN ("memory-limit", Fmemory_limit, 0, 0, 0, /*
|
|
801
|
4935 Return the address of the last byte XEmacs has allocated, divided by 1024.
|
|
|
4936 This may be helpful in debugging XEmacs's memory usage.
|
|
428
|
4937 The value is divided by 1024 to make sure it will fit in a lisp integer.
|
|
|
4938 */
|
|
|
4939 ())
|
|
|
4940 {
|
|
|
4941 return make_int ((EMACS_INT) sbrk (0) / 1024);
|
|
|
4942 }
|
|
440
|
4943 #endif
|
|
428
|
4944
|
|
801
|
4945 DEFUN ("memory-usage", Fmemory_usage, 0, 0, 0, /*
|
|
|
4946 Return the total number of bytes used by the data segment in XEmacs.
|
|
|
4947 This may be helpful in debugging XEmacs's memory usage.
|
|
|
4948 */
|
|
|
4949 ())
|
|
|
4950 {
|
|
|
4951 return make_int (total_data_usage ());
|
|
|
4952 }
|
|
|
4953
|
|
851
|
4954 void
|
|
|
4955 recompute_funcall_allocation_flag (void)
|
|
|
4956 {
|
|
887
|
4957 funcall_allocation_flag =
|
|
|
4958 need_to_garbage_collect ||
|
|
|
4959 need_to_check_c_alloca ||
|
|
|
4960 need_to_signal_post_gc;
|
|
851
|
4961 }
|
|
|
4962
|
|
801
|
4963 /* True if it's time to garbage collect now. */
|
|
814
|
4964 static void
|
|
|
4965 recompute_need_to_garbage_collect (void)
|
|
801
|
4966 {
|
|
|
4967 if (always_gc)
|
|
814
|
4968 need_to_garbage_collect = 1;
|
|
|
4969 else
|
|
|
4970 need_to_garbage_collect =
|
|
|
4971 (consing_since_gc > gc_cons_threshold
|
|
|
4972 #if 0 /* #### implement this better */
|
|
|
4973 &&
|
|
|
4974 (100 * consing_since_gc) / total_data_usage () >=
|
|
|
4975 gc_cons_percentage
|
|
|
4976 #endif /* 0 */
|
|
|
4977 );
|
|
851
|
4978 recompute_funcall_allocation_flag ();
|
|
801
|
4979 }
|
|
|
4980
|
|
428
|
4981
|
|
|
4982 int
|
|
|
4983 object_dead_p (Lisp_Object obj)
|
|
|
4984 {
|
|
|
4985 return ((BUFFERP (obj) && !BUFFER_LIVE_P (XBUFFER (obj))) ||
|
|
|
4986 (FRAMEP (obj) && !FRAME_LIVE_P (XFRAME (obj))) ||
|
|
|
4987 (WINDOWP (obj) && !WINDOW_LIVE_P (XWINDOW (obj))) ||
|
|
|
4988 (DEVICEP (obj) && !DEVICE_LIVE_P (XDEVICE (obj))) ||
|
|
|
4989 (CONSOLEP (obj) && !CONSOLE_LIVE_P (XCONSOLE (obj))) ||
|
|
|
4990 (EVENTP (obj) && !EVENT_LIVE_P (XEVENT (obj))) ||
|
|
|
4991 (EXTENTP (obj) && !EXTENT_LIVE_P (XEXTENT (obj))));
|
|
|
4992 }
|
|
|
4993
|
|
|
4994 #ifdef MEMORY_USAGE_STATS
|
|
|
4995
|
|
|
4996 /* Attempt to determine the actual amount of space that is used for
|
|
|
4997 the block allocated starting at PTR, supposedly of size "CLAIMED_SIZE".
|
|
|
4998
|
|
|
4999 It seems that the following holds:
|
|
|
5000
|
|
|
5001 1. When using the old allocator (malloc.c):
|
|
|
5002
|
|
|
5003 -- blocks are always allocated in chunks of powers of two. For
|
|
|
5004 each block, there is an overhead of 8 bytes if rcheck is not
|
|
|
5005 defined, 20 bytes if it is defined. In other words, a
|
|
|
5006 one-byte allocation needs 8 bytes of overhead for a total of
|
|
|
5007 9 bytes, and needs to have 16 bytes of memory chunked out for
|
|
|
5008 it.
|
|
|
5009
|
|
|
5010 2. When using the new allocator (gmalloc.c):
|
|
|
5011
|
|
|
5012 -- blocks are always allocated in chunks of powers of two up
|
|
|
5013 to 4096 bytes. Larger blocks are allocated in chunks of
|
|
|
5014 an integral multiple of 4096 bytes. The minimum block
|
|
|
5015 size is 2*sizeof (void *), or 16 bytes if SUNOS_LOCALTIME_BUG
|
|
|
5016 is defined. There is no per-block overhead, but there
|
|
|
5017 is an overhead of 3*sizeof (size_t) for each 4096 bytes
|
|
|
5018 allocated.
|
|
|
5019
|
|
|
5020 3. When using the system malloc, anything goes, but they are
|
|
|
5021 generally slower and more space-efficient than the GNU
|
|
|
5022 allocators. One possibly reasonable assumption to make
|
|
|
5023 for want of better data is that sizeof (void *), or maybe
|
|
|
5024 2 * sizeof (void *), is required as overhead and that
|
|
|
5025 blocks are allocated in the minimum required size except
|
|
|
5026 that some minimum block size is imposed (e.g. 16 bytes). */
|
|
|
5027
|
|
665
|
5028 Bytecount
|
|
|
5029 malloced_storage_size (void *ptr, Bytecount claimed_size,
|
|
428
|
5030 struct overhead_stats *stats)
|
|
|
5031 {
|
|
665
|
5032 Bytecount orig_claimed_size = claimed_size;
|
|
428
|
5033
|
|
|
5034 #ifdef GNU_MALLOC
|
|
665
|
5035 if (claimed_size < (Bytecount) (2 * sizeof (void *)))
|
|
428
|
5036 claimed_size = 2 * sizeof (void *);
|
|
|
5037 # ifdef SUNOS_LOCALTIME_BUG
|
|
|
5038 if (claimed_size < 16)
|
|
|
5039 claimed_size = 16;
|
|
|
5040 # endif
|
|
|
5041 if (claimed_size < 4096)
|
|
|
5042 {
|
|
|
5043 int log = 1;
|
|
|
5044
|
|
|
5045 /* compute the log base two, more or less, then use it to compute
|
|
|
5046 the block size needed. */
|
|
|
5047 claimed_size--;
|
|
|
5048 /* It's big, it's heavy, it's wood! */
|
|
|
5049 while ((claimed_size /= 2) != 0)
|
|
|
5050 ++log;
|
|
|
5051 claimed_size = 1;
|
|
|
5052 /* It's better than bad, it's good! */
|
|
|
5053 while (log > 0)
|
|
|
5054 {
|
|
|
5055 claimed_size *= 2;
|
|
|
5056 log--;
|
|
|
5057 }
|
|
|
5058 /* We have to come up with some average about the amount of
|
|
|
5059 blocks used. */
|
|
665
|
5060 if ((Bytecount) (rand () & 4095) < claimed_size)
|
|
428
|
5061 claimed_size += 3 * sizeof (void *);
|
|
|
5062 }
|
|
|
5063 else
|
|
|
5064 {
|
|
|
5065 claimed_size += 4095;
|
|
|
5066 claimed_size &= ~4095;
|
|
|
5067 claimed_size += (claimed_size / 4096) * 3 * sizeof (size_t);
|
|
|
5068 }
|
|
|
5069
|
|
|
5070 #elif defined (SYSTEM_MALLOC)
|
|
|
5071
|
|
|
5072 if (claimed_size < 16)
|
|
|
5073 claimed_size = 16;
|
|
|
5074 claimed_size += 2 * sizeof (void *);
|
|
|
5075
|
|
|
5076 #else /* old GNU allocator */
|
|
|
5077
|
|
|
5078 # ifdef rcheck /* #### may not be defined here */
|
|
|
5079 claimed_size += 20;
|
|
|
5080 # else
|
|
|
5081 claimed_size += 8;
|
|
|
5082 # endif
|
|
|
5083 {
|
|
|
5084 int log = 1;
|
|
|
5085
|
|
|
5086 /* compute the log base two, more or less, then use it to compute
|
|
|
5087 the block size needed. */
|
|
|
5088 claimed_size--;
|
|
|
5089 /* It's big, it's heavy, it's wood! */
|
|
|
5090 while ((claimed_size /= 2) != 0)
|
|
|
5091 ++log;
|
|
|
5092 claimed_size = 1;
|
|
|
5093 /* It's better than bad, it's good! */
|
|
|
5094 while (log > 0)
|
|
|
5095 {
|
|
|
5096 claimed_size *= 2;
|
|
|
5097 log--;
|
|
|
5098 }
|
|
|
5099 }
|
|
|
5100
|
|
|
5101 #endif /* old GNU allocator */
|
|
|
5102
|
|
|
5103 if (stats)
|
|
|
5104 {
|
|
|
5105 stats->was_requested += orig_claimed_size;
|
|
|
5106 stats->malloc_overhead += claimed_size - orig_claimed_size;
|
|
|
5107 }
|
|
|
5108 return claimed_size;
|
|
|
5109 }
|
|
|
5110
|
|
665
|
5111 Bytecount
|
|
|
5112 fixed_type_block_overhead (Bytecount size)
|
|
428
|
5113 {
|
|
665
|
5114 Bytecount per_block = TYPE_ALLOC_SIZE (cons, unsigned char);
|
|
|
5115 Bytecount overhead = 0;
|
|
|
5116 Bytecount storage_size = malloced_storage_size (0, per_block, 0);
|
|
428
|
5117 while (size >= per_block)
|
|
|
5118 {
|
|
|
5119 size -= per_block;
|
|
|
5120 overhead += sizeof (void *) + per_block - storage_size;
|
|
|
5121 }
|
|
|
5122 if (rand () % per_block < size)
|
|
|
5123 overhead += sizeof (void *) + per_block - storage_size;
|
|
|
5124 return overhead;
|
|
|
5125 }
|
|
|
5126
|
|
|
5127 #endif /* MEMORY_USAGE_STATS */
|
|
|
5128
|
|
|
5129
|
|
|
5130 /* Initialization */
|
|
771
|
5131 static void
|
|
1204
|
5132 common_init_alloc_early (void)
|
|
428
|
5133 {
|
|
771
|
5134 #ifndef Qzero
|
|
|
5135 Qzero = make_int (0); /* Only used if Lisp_Object is a union type */
|
|
|
5136 #endif
|
|
|
5137
|
|
|
5138 #ifndef Qnull_pointer
|
|
|
5139 /* C guarantees that Qnull_pointer will be initialized to all 0 bits,
|
|
|
5140 so the following is actually a no-op. */
|
|
793
|
5141 Qnull_pointer = wrap_pointer_1 (0);
|
|
771
|
5142 #endif
|
|
|
5143
|
|
428
|
5144 gc_generation_number[0] = 0;
|
|
|
5145 breathing_space = 0;
|
|
771
|
5146 Vgc_message = Qzero;
|
|
428
|
5147 all_lcrecords = 0;
|
|
|
5148 ignore_malloc_warnings = 1;
|
|
|
5149 #ifdef DOUG_LEA_MALLOC
|
|
|
5150 mallopt (M_TRIM_THRESHOLD, 128*1024); /* trim threshold */
|
|
|
5151 mallopt (M_MMAP_THRESHOLD, 64*1024); /* mmap threshold */
|
|
|
5152 #if 0 /* Moved to emacs.c */
|
|
|
5153 mallopt (M_MMAP_MAX, 64); /* max. number of mmap'ed areas */
|
|
|
5154 #endif
|
|
|
5155 #endif
|
|
|
5156 init_string_alloc ();
|
|
|
5157 init_string_chars_alloc ();
|
|
|
5158 init_cons_alloc ();
|
|
|
5159 init_symbol_alloc ();
|
|
|
5160 init_compiled_function_alloc ();
|
|
|
5161 init_float_alloc ();
|
|
|
5162 init_marker_alloc ();
|
|
|
5163 init_extent_alloc ();
|
|
|
5164 init_event_alloc ();
|
|
1204
|
5165 #ifdef EVENT_DATA_AS_OBJECTS
|
|
934
|
5166 init_key_data_alloc ();
|
|
|
5167 init_button_data_alloc ();
|
|
|
5168 init_motion_data_alloc ();
|
|
|
5169 init_process_data_alloc ();
|
|
|
5170 init_timeout_data_alloc ();
|
|
|
5171 init_magic_data_alloc ();
|
|
|
5172 init_magic_eval_data_alloc ();
|
|
|
5173 init_eval_data_alloc ();
|
|
|
5174 init_misc_user_data_alloc ();
|
|
1204
|
5175 #endif /* EVENT_DATA_AS_OBJECTS */
|
|
428
|
5176
|
|
|
5177 ignore_malloc_warnings = 0;
|
|
|
5178
|
|
452
|
5179 if (staticpros_nodump)
|
|
|
5180 Dynarr_free (staticpros_nodump);
|
|
|
5181 staticpros_nodump = Dynarr_new2 (Lisp_Object_ptr_dynarr, Lisp_Object *);
|
|
|
5182 Dynarr_resize (staticpros_nodump, 100); /* merely a small optimization */
|
|
771
|
5183 #ifdef DEBUG_XEMACS
|
|
|
5184 if (staticpro_nodump_names)
|
|
|
5185 Dynarr_free (staticpro_nodump_names);
|
|
|
5186 staticpro_nodump_names = Dynarr_new2 (char_ptr_dynarr, char *);
|
|
|
5187 Dynarr_resize (staticpro_nodump_names, 100); /* ditto */
|
|
|
5188 #endif
|
|
428
|
5189
|
|
|
5190 consing_since_gc = 0;
|
|
814
|
5191 need_to_garbage_collect = always_gc;
|
|
851
|
5192 need_to_check_c_alloca = 0;
|
|
|
5193 funcall_allocation_flag = 0;
|
|
|
5194 funcall_alloca_count = 0;
|
|
814
|
5195
|
|
428
|
5196 #if 1
|
|
|
5197 gc_cons_threshold = 500000; /* XEmacs change */
|
|
|
5198 #else
|
|
|
5199 gc_cons_threshold = 15000; /* debugging */
|
|
|
5200 #endif
|
|
801
|
5201 gc_cons_percentage = 0; /* #### 20; Don't have an accurate measure of
|
|
|
5202 memory usage on Windows; not verified on other
|
|
|
5203 systems */
|
|
428
|
5204 lrecord_uid_counter = 259;
|
|
|
5205 debug_string_purity = 0;
|
|
|
5206
|
|
|
5207 gc_currently_forbidden = 0;
|
|
|
5208 gc_hooks_inhibited = 0;
|
|
|
5209
|
|
800
|
5210 #ifdef ERROR_CHECK_TYPES
|
|
428
|
5211 ERROR_ME.really_unlikely_name_to_have_accidentally_in_a_non_errb_structure =
|
|
|
5212 666;
|
|
|
5213 ERROR_ME_NOT.
|
|
|
5214 really_unlikely_name_to_have_accidentally_in_a_non_errb_structure = 42;
|
|
|
5215 ERROR_ME_WARN.
|
|
|
5216 really_unlikely_name_to_have_accidentally_in_a_non_errb_structure =
|
|
|
5217 3333632;
|
|
793
|
5218 ERROR_ME_DEBUG_WARN.
|
|
|
5219 really_unlikely_name_to_have_accidentally_in_a_non_errb_structure =
|
|
|
5220 8675309;
|
|
800
|
5221 #endif /* ERROR_CHECK_TYPES */
|
|
428
|
5222 }
|
|
|
5223
|
|
771
|
5224 static void
|
|
|
5225 init_lcrecord_lists (void)
|
|
|
5226 {
|
|
|
5227 int i;
|
|
|
5228
|
|
|
5229 for (i = 0; i < countof (lrecord_implementations_table); i++)
|
|
|
5230 {
|
|
|
5231 all_lcrecord_lists[i] = Qzero; /* Qnil not yet set */
|
|
|
5232 staticpro_nodump (&all_lcrecord_lists[i]);
|
|
|
5233 }
|
|
|
5234 }
|
|
|
5235
|
|
|
5236 void
|
|
1204
|
5237 init_alloc_early (void)
|
|
771
|
5238 {
|
|
1204
|
5239 #if defined (__cplusplus) && defined (ERROR_CHECK_GC)
|
|
|
5240 static struct gcpro initial_gcpro;
|
|
|
5241
|
|
|
5242 initial_gcpro.next = 0;
|
|
|
5243 initial_gcpro.var = &Qnil;
|
|
|
5244 initial_gcpro.nvars = 1;
|
|
|
5245 gcprolist = &initial_gcpro;
|
|
|
5246 #else
|
|
|
5247 gcprolist = 0;
|
|
|
5248 #endif /* defined (__cplusplus) && defined (ERROR_CHECK_GC) */
|
|
|
5249 }
|
|
|
5250
|
|
|
5251 void
|
|
|
5252 reinit_alloc_early (void)
|
|
|
5253 {
|
|
|
5254 common_init_alloc_early ();
|
|
771
|
5255 init_lcrecord_lists ();
|
|
|
5256 }
|
|
|
5257
|
|
428
|
5258 void
|
|
|
5259 init_alloc_once_early (void)
|
|
|
5260 {
|
|
1204
|
5261 common_init_alloc_early ();
|
|
428
|
5262
|
|
442
|
5263 {
|
|
|
5264 int i;
|
|
|
5265 for (i = 0; i < countof (lrecord_implementations_table); i++)
|
|
|
5266 lrecord_implementations_table[i] = 0;
|
|
|
5267 }
|
|
|
5268
|
|
|
5269 INIT_LRECORD_IMPLEMENTATION (cons);
|
|
|
5270 INIT_LRECORD_IMPLEMENTATION (vector);
|
|
|
5271 INIT_LRECORD_IMPLEMENTATION (string);
|
|
|
5272 INIT_LRECORD_IMPLEMENTATION (lcrecord_list);
|
|
1204
|
5273 INIT_LRECORD_IMPLEMENTATION (free);
|
|
428
|
5274
|
|
452
|
5275 staticpros = Dynarr_new2 (Lisp_Object_ptr_dynarr, Lisp_Object *);
|
|
|
5276 Dynarr_resize (staticpros, 1410); /* merely a small optimization */
|
|
|
5277 dump_add_root_struct_ptr (&staticpros, &staticpros_description);
|
|
771
|
5278 #ifdef DEBUG_XEMACS
|
|
|
5279 staticpro_names = Dynarr_new2 (char_ptr_dynarr, char *);
|
|
|
5280 Dynarr_resize (staticpro_names, 1410); /* merely a small optimization */
|
|
|
5281 dump_add_root_struct_ptr (&staticpro_names, &staticpro_names_description);
|
|
|
5282 #endif
|
|
|
5283
|
|
|
5284 init_lcrecord_lists ();
|
|
428
|
5285 }
|
|
|
5286
|
|
|
5287 void
|
|
|
5288 syms_of_alloc (void)
|
|
|
5289 {
|
|
442
|
5290 DEFSYMBOL (Qpre_gc_hook);
|
|
|
5291 DEFSYMBOL (Qpost_gc_hook);
|
|
|
5292 DEFSYMBOL (Qgarbage_collecting);
|
|
428
|
5293
|
|
|
5294 DEFSUBR (Fcons);
|
|
|
5295 DEFSUBR (Flist);
|
|
|
5296 DEFSUBR (Fvector);
|
|
|
5297 DEFSUBR (Fbit_vector);
|
|
|
5298 DEFSUBR (Fmake_byte_code);
|
|
|
5299 DEFSUBR (Fmake_list);
|
|
|
5300 DEFSUBR (Fmake_vector);
|
|
|
5301 DEFSUBR (Fmake_bit_vector);
|
|
|
5302 DEFSUBR (Fmake_string);
|
|
|
5303 DEFSUBR (Fstring);
|
|
|
5304 DEFSUBR (Fmake_symbol);
|
|
|
5305 DEFSUBR (Fmake_marker);
|
|
|
5306 DEFSUBR (Fpurecopy);
|
|
|
5307 DEFSUBR (Fgarbage_collect);
|
|
440
|
5308 #if 0
|
|
428
|
5309 DEFSUBR (Fmemory_limit);
|
|
440
|
5310 #endif
|
|
801
|
5311 DEFSUBR (Fmemory_usage);
|
|
428
|
5312 DEFSUBR (Fconsing_since_gc);
|
|
|
5313 }
|
|
|
5314
|
|
|
5315 void
|
|
|
5316 vars_of_alloc (void)
|
|
|
5317 {
|
|
1292
|
5318 QSin_garbage_collection = build_msg_string ("(in garbage collection)");
|
|
|
5319 staticpro (&QSin_garbage_collection);
|
|
|
5320
|
|
428
|
5321 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold /*
|
|
|
5322 *Number of bytes of consing between garbage collections.
|
|
|
5323 \"Consing\" is a misnomer in that this actually counts allocation
|
|
|
5324 of all different kinds of objects, not just conses.
|
|
|
5325 Garbage collection can happen automatically once this many bytes have been
|
|
|
5326 allocated since the last garbage collection. All data types count.
|
|
|
5327
|
|
|
5328 Garbage collection happens automatically when `eval' or `funcall' are
|
|
|
5329 called. (Note that `funcall' is called implicitly as part of evaluation.)
|
|
|
5330 By binding this temporarily to a large number, you can effectively
|
|
|
5331 prevent garbage collection during a part of the program.
|
|
|
5332
|
|
853
|
5333 Normally, you cannot set this value less than 10,000 (if you do, it is
|
|
|
5334 automatically reset during the next garbage collection). However, if
|
|
|
5335 XEmacs was compiled with DEBUG_XEMACS, this does not happen, allowing
|
|
|
5336 you to set this value very low to track down problems with insufficient
|
|
|
5337 GCPRO'ing. If you set this to a negative number, garbage collection will
|
|
|
5338 happen at *EVERY* call to `eval' or `funcall'. This is an extremely
|
|
|
5339 effective way to check GCPRO problems, but be warned that your XEmacs
|
|
|
5340 will be unusable! You almost certainly won't have the patience to wait
|
|
|
5341 long enough to be able to set it back.
|
|
|
5342
|
|
428
|
5343 See also `consing-since-gc'.
|
|
|
5344 */ );
|
|
|
5345
|
|
801
|
5346 DEFVAR_INT ("gc-cons-percentage", &gc_cons_percentage /*
|
|
|
5347 *Percentage of memory allocated between garbage collections.
|
|
|
5348
|
|
|
5349 Garbage collection will happen if this percentage of the total amount of
|
|
|
5350 memory used for data has been allocated since the last garbage collection.
|
|
|
5351 However, it will not happen if less than `gc-cons-threshold' bytes have
|
|
|
5352 been allocated -- this sets an absolute minimum in case very little data
|
|
|
5353 has been allocated or the percentage is set very low. Set this to 0 to
|
|
|
5354 have garbage collection always happen after `gc-cons-threshold' bytes have
|
|
|
5355 been allocated, regardless of current memory usage.
|
|
|
5356
|
|
|
5357 Garbage collection happens automatically when `eval' or `funcall' are
|
|
|
5358 called. (Note that `funcall' is called implicitly as part of evaluation.)
|
|
|
5359 By binding this temporarily to a large number, you can effectively
|
|
|
5360 prevent garbage collection during a part of the program.
|
|
|
5361
|
|
|
5362 See also `consing-since-gc'.
|
|
|
5363 */ );
|
|
|
5364
|
|
428
|
5365 #ifdef DEBUG_XEMACS
|
|
|
5366 DEFVAR_INT ("debug-allocation", &debug_allocation /*
|
|
|
5367 If non-zero, print out information to stderr about all objects allocated.
|
|
|
5368 See also `debug-allocation-backtrace-length'.
|
|
|
5369 */ );
|
|
|
5370 debug_allocation = 0;
|
|
|
5371
|
|
|
5372 DEFVAR_INT ("debug-allocation-backtrace-length",
|
|
|
5373 &debug_allocation_backtrace_length /*
|
|
|
5374 Length (in stack frames) of short backtrace printed out by `debug-allocation'.
|
|
|
5375 */ );
|
|
|
5376 debug_allocation_backtrace_length = 2;
|
|
|
5377 #endif
|
|
|
5378
|
|
|
5379 DEFVAR_BOOL ("purify-flag", &purify_flag /*
|
|
|
5380 Non-nil means loading Lisp code in order to dump an executable.
|
|
|
5381 This means that certain objects should be allocated in readonly space.
|
|
|
5382 */ );
|
|
|
5383
|
|
1154
|
5384 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages /*
|
|
|
5385 Non-nil means display messages at start and end of garbage collection.
|
|
|
5386 */ );
|
|
|
5387 garbage_collection_messages = 0;
|
|
|
5388
|
|
428
|
5389 DEFVAR_LISP ("pre-gc-hook", &Vpre_gc_hook /*
|
|
|
5390 Function or functions to be run just before each garbage collection.
|
|
|
5391 Interrupts, garbage collection, and errors are inhibited while this hook
|
|
|
5392 runs, so be extremely careful in what you add here. In particular, avoid
|
|
|
5393 consing, and do not interact with the user.
|
|
|
5394 */ );
|
|
|
5395 Vpre_gc_hook = Qnil;
|
|
|
5396
|
|
|
5397 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook /*
|
|
|
5398 Function or functions to be run just after each garbage collection.
|
|
|
5399 Interrupts, garbage collection, and errors are inhibited while this hook
|
|
887
|
5400 runs. Each hook is called with one argument which is an alist with
|
|
|
5401 finalization data.
|
|
428
|
5402 */ );
|
|
|
5403 Vpost_gc_hook = Qnil;
|
|
|
5404
|
|
|
5405 DEFVAR_LISP ("gc-message", &Vgc_message /*
|
|
|
5406 String to print to indicate that a garbage collection is in progress.
|
|
|
5407 This is printed in the echo area. If the selected frame is on a
|
|
|
5408 window system and `gc-pointer-glyph' specifies a value (i.e. a pointer
|
|
|
5409 image instance) in the domain of the selected frame, the mouse pointer
|
|
|
5410 will change instead of this message being printed.
|
|
|
5411 */ );
|
|
|
5412 Vgc_message = build_string (gc_default_message);
|
|
|
5413
|
|
|
5414 DEFVAR_LISP ("gc-pointer-glyph", &Vgc_pointer_glyph /*
|
|
|
5415 Pointer glyph used to indicate that a garbage collection is in progress.
|
|
|
5416 If the selected window is on a window system and this glyph specifies a
|
|
|
5417 value (i.e. a pointer image instance) in the domain of the selected
|
|
|
5418 window, the pointer will be changed as specified during garbage collection.
|
|
|
5419 Otherwise, a message will be printed in the echo area, as controlled
|
|
|
5420 by `gc-message'.
|
|
|
5421 */ );
|
|
|
5422 }
|
|
|
5423
|
|
|
5424 void
|
|
|
5425 complex_vars_of_alloc (void)
|
|
|
5426 {
|
|
|
5427 Vgc_pointer_glyph = Fmake_glyph_internal (Qpointer);
|
|
|
5428 }
|
