|
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.
|
|
|
4 Copyright (C) 1995, 1996 Ben Wing.
|
|
|
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"
|
|
|
52 #include "extents.h"
|
|
|
53 #include "frame.h"
|
|
|
54 #include "glyphs.h"
|
|
|
55 #include "opaque.h"
|
|
|
56 #include "redisplay.h"
|
|
|
57 #include "specifier.h"
|
|
|
58 #include "sysfile.h"
|
|
442
|
59 #include "sysdep.h"
|
|
428
|
60 #include "window.h"
|
|
|
61 #include "console-stream.h"
|
|
|
62
|
|
|
63 #ifdef DOUG_LEA_MALLOC
|
|
|
64 #include <malloc.h>
|
|
|
65 #endif
|
|
|
66
|
|
|
67 #ifdef PDUMP
|
|
442
|
68 #include "dumper.h"
|
|
428
|
69 #endif
|
|
|
70
|
|
|
71 EXFUN (Fgarbage_collect, 0);
|
|
|
72
|
|
|
73 #if 0 /* this is _way_ too slow to be part of the standard debug options */
|
|
|
74 #if defined(DEBUG_XEMACS) && defined(MULE)
|
|
|
75 #define VERIFY_STRING_CHARS_INTEGRITY
|
|
|
76 #endif
|
|
|
77 #endif
|
|
|
78
|
|
|
79 /* Define this to use malloc/free with no freelist for all datatypes,
|
|
|
80 the hope being that some debugging tools may help detect
|
|
|
81 freed memory references */
|
|
|
82 #ifdef USE_DEBUG_MALLOC /* Taking the above comment at face value -slb */
|
|
|
83 #include <dmalloc.h>
|
|
|
84 #define ALLOC_NO_POOLS
|
|
|
85 #endif
|
|
|
86
|
|
|
87 #ifdef DEBUG_XEMACS
|
|
458
|
88 static Fixnum debug_allocation;
|
|
|
89 static Fixnum debug_allocation_backtrace_length;
|
|
428
|
90 #endif
|
|
|
91
|
|
|
92 /* Number of bytes of consing done since the last gc */
|
|
|
93 EMACS_INT consing_since_gc;
|
|
|
94 #define INCREMENT_CONS_COUNTER_1(size) (consing_since_gc += (size))
|
|
|
95
|
|
|
96 #define debug_allocation_backtrace() \
|
|
|
97 do { \
|
|
|
98 if (debug_allocation_backtrace_length > 0) \
|
|
|
99 debug_short_backtrace (debug_allocation_backtrace_length); \
|
|
|
100 } while (0)
|
|
|
101
|
|
|
102 #ifdef DEBUG_XEMACS
|
|
|
103 #define INCREMENT_CONS_COUNTER(foosize, type) \
|
|
|
104 do { \
|
|
|
105 if (debug_allocation) \
|
|
|
106 { \
|
|
|
107 stderr_out ("allocating %s (size %ld)\n", type, (long)foosize); \
|
|
|
108 debug_allocation_backtrace (); \
|
|
|
109 } \
|
|
|
110 INCREMENT_CONS_COUNTER_1 (foosize); \
|
|
|
111 } while (0)
|
|
|
112 #define NOSEEUM_INCREMENT_CONS_COUNTER(foosize, type) \
|
|
|
113 do { \
|
|
|
114 if (debug_allocation > 1) \
|
|
|
115 { \
|
|
|
116 stderr_out ("allocating noseeum %s (size %ld)\n", type, (long)foosize); \
|
|
|
117 debug_allocation_backtrace (); \
|
|
|
118 } \
|
|
|
119 INCREMENT_CONS_COUNTER_1 (foosize); \
|
|
|
120 } while (0)
|
|
|
121 #else
|
|
|
122 #define INCREMENT_CONS_COUNTER(size, type) INCREMENT_CONS_COUNTER_1 (size)
|
|
|
123 #define NOSEEUM_INCREMENT_CONS_COUNTER(size, type) \
|
|
|
124 INCREMENT_CONS_COUNTER_1 (size)
|
|
|
125 #endif
|
|
|
126
|
|
|
127 #define DECREMENT_CONS_COUNTER(size) do { \
|
|
|
128 consing_since_gc -= (size); \
|
|
|
129 if (consing_since_gc < 0) \
|
|
|
130 consing_since_gc = 0; \
|
|
|
131 } while (0)
|
|
|
132
|
|
|
133 /* Number of bytes of consing since gc before another gc should be done. */
|
|
|
134 EMACS_INT gc_cons_threshold;
|
|
|
135
|
|
|
136 /* Nonzero during gc */
|
|
|
137 int gc_in_progress;
|
|
|
138
|
|
|
139 /* Number of times GC has happened at this level or below.
|
|
|
140 * Level 0 is most volatile, contrary to usual convention.
|
|
|
141 * (Of course, there's only one level at present) */
|
|
|
142 EMACS_INT gc_generation_number[1];
|
|
|
143
|
|
|
144 /* This is just for use by the printer, to allow things to print uniquely */
|
|
|
145 static int lrecord_uid_counter;
|
|
|
146
|
|
|
147 /* Nonzero when calling certain hooks or doing other things where
|
|
|
148 a GC would be bad */
|
|
|
149 int gc_currently_forbidden;
|
|
|
150
|
|
|
151 /* Hooks. */
|
|
|
152 Lisp_Object Vpre_gc_hook, Qpre_gc_hook;
|
|
|
153 Lisp_Object Vpost_gc_hook, Qpost_gc_hook;
|
|
|
154
|
|
|
155 /* "Garbage collecting" */
|
|
|
156 Lisp_Object Vgc_message;
|
|
|
157 Lisp_Object Vgc_pointer_glyph;
|
|
442
|
158 static const char gc_default_message[] = "Garbage collecting";
|
|
428
|
159 Lisp_Object Qgarbage_collecting;
|
|
|
160
|
|
|
161 /* Non-zero means we're in the process of doing the dump */
|
|
|
162 int purify_flag;
|
|
|
163
|
|
|
164 #ifdef ERROR_CHECK_TYPECHECK
|
|
|
165
|
|
|
166 Error_behavior ERROR_ME, ERROR_ME_NOT, ERROR_ME_WARN;
|
|
|
167
|
|
|
168 #endif
|
|
|
169
|
|
|
170 int
|
|
|
171 c_readonly (Lisp_Object obj)
|
|
|
172 {
|
|
|
173 return POINTER_TYPE_P (XTYPE (obj)) && C_READONLY (obj);
|
|
|
174 }
|
|
|
175
|
|
|
176 int
|
|
|
177 lisp_readonly (Lisp_Object obj)
|
|
|
178 {
|
|
|
179 return POINTER_TYPE_P (XTYPE (obj)) && LISP_READONLY (obj);
|
|
|
180 }
|
|
|
181
|
|
|
182
|
|
|
183 /* Maximum amount of C stack to save when a GC happens. */
|
|
|
184
|
|
|
185 #ifndef MAX_SAVE_STACK
|
|
|
186 #define MAX_SAVE_STACK 0 /* 16000 */
|
|
|
187 #endif
|
|
|
188
|
|
|
189 /* Non-zero means ignore malloc warnings. Set during initialization. */
|
|
|
190 int ignore_malloc_warnings;
|
|
|
191
|
|
|
192
|
|
|
193 static void *breathing_space;
|
|
|
194
|
|
|
195 void
|
|
|
196 release_breathing_space (void)
|
|
|
197 {
|
|
|
198 if (breathing_space)
|
|
|
199 {
|
|
|
200 void *tmp = breathing_space;
|
|
|
201 breathing_space = 0;
|
|
|
202 xfree (tmp);
|
|
|
203 }
|
|
|
204 }
|
|
|
205
|
|
|
206 /* malloc calls this if it finds we are near exhausting storage */
|
|
|
207 void
|
|
442
|
208 malloc_warning (const char *str)
|
|
428
|
209 {
|
|
|
210 if (ignore_malloc_warnings)
|
|
|
211 return;
|
|
|
212
|
|
|
213 warn_when_safe
|
|
|
214 (Qmemory, Qcritical,
|
|
|
215 "%s\n"
|
|
|
216 "Killing some buffers may delay running out of memory.\n"
|
|
|
217 "However, certainly by the time you receive the 95%% warning,\n"
|
|
|
218 "you should clean up, kill this Emacs, and start a new one.",
|
|
|
219 str);
|
|
|
220 }
|
|
|
221
|
|
|
222 /* Called if malloc returns zero */
|
|
|
223 DOESNT_RETURN
|
|
|
224 memory_full (void)
|
|
|
225 {
|
|
|
226 /* Force a GC next time eval is called.
|
|
|
227 It's better to loop garbage-collecting (we might reclaim enough
|
|
|
228 to win) than to loop beeping and barfing "Memory exhausted"
|
|
|
229 */
|
|
|
230 consing_since_gc = gc_cons_threshold + 1;
|
|
|
231 release_breathing_space ();
|
|
|
232
|
|
|
233 /* Flush some histories which might conceivably contain garbalogical
|
|
|
234 inhibitors. */
|
|
|
235 if (!NILP (Fboundp (Qvalues)))
|
|
|
236 Fset (Qvalues, Qnil);
|
|
|
237 Vcommand_history = Qnil;
|
|
|
238
|
|
|
239 error ("Memory exhausted");
|
|
|
240 }
|
|
|
241
|
|
|
242 /* like malloc and realloc but check for no memory left, and block input. */
|
|
|
243
|
|
|
244 #undef xmalloc
|
|
|
245 void *
|
|
|
246 xmalloc (size_t size)
|
|
|
247 {
|
|
|
248 void *val = malloc (size);
|
|
|
249
|
|
|
250 if (!val && (size != 0)) memory_full ();
|
|
|
251 return val;
|
|
|
252 }
|
|
|
253
|
|
|
254 #undef xcalloc
|
|
|
255 static void *
|
|
|
256 xcalloc (size_t nelem, size_t elsize)
|
|
|
257 {
|
|
|
258 void *val = calloc (nelem, elsize);
|
|
|
259
|
|
|
260 if (!val && (nelem != 0)) memory_full ();
|
|
|
261 return val;
|
|
|
262 }
|
|
|
263
|
|
|
264 void *
|
|
|
265 xmalloc_and_zero (size_t size)
|
|
|
266 {
|
|
|
267 return xcalloc (size, sizeof (char));
|
|
|
268 }
|
|
|
269
|
|
|
270 #undef xrealloc
|
|
|
271 void *
|
|
|
272 xrealloc (void *block, size_t size)
|
|
|
273 {
|
|
|
274 /* We must call malloc explicitly when BLOCK is 0, since some
|
|
|
275 reallocs don't do this. */
|
|
|
276 void *val = block ? realloc (block, size) : malloc (size);
|
|
|
277
|
|
|
278 if (!val && (size != 0)) memory_full ();
|
|
|
279 return val;
|
|
|
280 }
|
|
|
281
|
|
|
282 void
|
|
|
283 #ifdef ERROR_CHECK_MALLOC
|
|
|
284 xfree_1 (void *block)
|
|
|
285 #else
|
|
|
286 xfree (void *block)
|
|
|
287 #endif
|
|
|
288 {
|
|
|
289 #ifdef ERROR_CHECK_MALLOC
|
|
|
290 /* Unbelievably, calling free() on 0xDEADBEEF doesn't cause an
|
|
|
291 error until much later on for many system mallocs, such as
|
|
|
292 the one that comes with Solaris 2.3. FMH!! */
|
|
|
293 assert (block != (void *) 0xDEADBEEF);
|
|
|
294 assert (block);
|
|
|
295 #endif /* ERROR_CHECK_MALLOC */
|
|
|
296 free (block);
|
|
|
297 }
|
|
|
298
|
|
|
299 #ifdef ERROR_CHECK_GC
|
|
|
300
|
|
|
301 #if SIZEOF_INT == 4
|
|
|
302 typedef unsigned int four_byte_t;
|
|
|
303 #elif SIZEOF_LONG == 4
|
|
|
304 typedef unsigned long four_byte_t;
|
|
|
305 #elif SIZEOF_SHORT == 4
|
|
|
306 typedef unsigned short four_byte_t;
|
|
|
307 #else
|
|
|
308 What kind of strange-ass system are we running on?
|
|
|
309 #endif
|
|
|
310
|
|
|
311 static void
|
|
|
312 deadbeef_memory (void *ptr, size_t size)
|
|
|
313 {
|
|
|
314 four_byte_t *ptr4 = (four_byte_t *) ptr;
|
|
|
315 size_t beefs = size >> 2;
|
|
|
316
|
|
|
317 /* In practice, size will always be a multiple of four. */
|
|
|
318 while (beefs--)
|
|
|
319 (*ptr4++) = 0xDEADBEEF;
|
|
|
320 }
|
|
|
321
|
|
|
322 #else /* !ERROR_CHECK_GC */
|
|
|
323
|
|
|
324
|
|
|
325 #define deadbeef_memory(ptr, size)
|
|
|
326
|
|
|
327 #endif /* !ERROR_CHECK_GC */
|
|
|
328
|
|
|
329 #undef xstrdup
|
|
|
330 char *
|
|
442
|
331 xstrdup (const char *str)
|
|
428
|
332 {
|
|
|
333 int len = strlen (str) + 1; /* for stupid terminating 0 */
|
|
|
334
|
|
|
335 void *val = xmalloc (len);
|
|
|
336 if (val == 0) return 0;
|
|
|
337 return (char *) memcpy (val, str, len);
|
|
|
338 }
|
|
|
339
|
|
|
340 #ifdef NEED_STRDUP
|
|
|
341 char *
|
|
442
|
342 strdup (const char *s)
|
|
428
|
343 {
|
|
|
344 return xstrdup (s);
|
|
|
345 }
|
|
|
346 #endif /* NEED_STRDUP */
|
|
|
347
|
|
|
348
|
|
|
349 static void *
|
|
|
350 allocate_lisp_storage (size_t size)
|
|
|
351 {
|
|
|
352 return xmalloc (size);
|
|
|
353 }
|
|
|
354
|
|
|
355
|
|
442
|
356 /* lcrecords are chained together through their "next" field.
|
|
|
357 After doing the mark phase, GC will walk this linked list
|
|
|
358 and free any lcrecord which hasn't been marked. */
|
|
428
|
359 static struct lcrecord_header *all_lcrecords;
|
|
|
360
|
|
|
361 void *
|
|
442
|
362 alloc_lcrecord (size_t size, const struct lrecord_implementation *implementation)
|
|
428
|
363 {
|
|
|
364 struct lcrecord_header *lcheader;
|
|
|
365
|
|
442
|
366 type_checking_assert
|
|
|
367 ((implementation->static_size == 0 ?
|
|
|
368 implementation->size_in_bytes_method != NULL :
|
|
|
369 implementation->static_size == size)
|
|
|
370 &&
|
|
|
371 (! implementation->basic_p)
|
|
|
372 &&
|
|
|
373 (! (implementation->hash == NULL && implementation->equal != NULL)));
|
|
428
|
374
|
|
|
375 lcheader = (struct lcrecord_header *) allocate_lisp_storage (size);
|
|
442
|
376 set_lheader_implementation (&lcheader->lheader, implementation);
|
|
428
|
377 lcheader->next = all_lcrecords;
|
|
|
378 #if 1 /* mly prefers to see small ID numbers */
|
|
|
379 lcheader->uid = lrecord_uid_counter++;
|
|
|
380 #else /* jwz prefers to see real addrs */
|
|
|
381 lcheader->uid = (int) &lcheader;
|
|
|
382 #endif
|
|
|
383 lcheader->free = 0;
|
|
|
384 all_lcrecords = lcheader;
|
|
|
385 INCREMENT_CONS_COUNTER (size, implementation->name);
|
|
|
386 return lcheader;
|
|
|
387 }
|
|
|
388
|
|
|
389 #if 0 /* Presently unused */
|
|
|
390 /* Very, very poor man's EGC?
|
|
|
391 * This may be slow and thrash pages all over the place.
|
|
|
392 * Only call it if you really feel you must (and if the
|
|
|
393 * lrecord was fairly recently allocated).
|
|
|
394 * Otherwise, just let the GC do its job -- that's what it's there for
|
|
|
395 */
|
|
|
396 void
|
|
|
397 free_lcrecord (struct lcrecord_header *lcrecord)
|
|
|
398 {
|
|
|
399 if (all_lcrecords == lcrecord)
|
|
|
400 {
|
|
|
401 all_lcrecords = lcrecord->next;
|
|
|
402 }
|
|
|
403 else
|
|
|
404 {
|
|
|
405 struct lrecord_header *header = all_lcrecords;
|
|
|
406 for (;;)
|
|
|
407 {
|
|
|
408 struct lrecord_header *next = header->next;
|
|
|
409 if (next == lcrecord)
|
|
|
410 {
|
|
|
411 header->next = lrecord->next;
|
|
|
412 break;
|
|
|
413 }
|
|
|
414 else if (next == 0)
|
|
|
415 abort ();
|
|
|
416 else
|
|
|
417 header = next;
|
|
|
418 }
|
|
|
419 }
|
|
|
420 if (lrecord->implementation->finalizer)
|
|
|
421 lrecord->implementation->finalizer (lrecord, 0);
|
|
|
422 xfree (lrecord);
|
|
|
423 return;
|
|
|
424 }
|
|
|
425 #endif /* Unused */
|
|
|
426
|
|
|
427
|
|
|
428 static void
|
|
|
429 disksave_object_finalization_1 (void)
|
|
|
430 {
|
|
|
431 struct lcrecord_header *header;
|
|
|
432
|
|
|
433 for (header = all_lcrecords; header; header = header->next)
|
|
|
434 {
|
|
442
|
435 if (LHEADER_IMPLEMENTATION (&header->lheader)->finalizer &&
|
|
428
|
436 !header->free)
|
|
442
|
437 LHEADER_IMPLEMENTATION (&header->lheader)->finalizer (header, 1);
|
|
428
|
438 }
|
|
|
439 }
|
|
|
440
|
|
|
441
|
|
|
442 /************************************************************************/
|
|
|
443 /* Debugger support */
|
|
|
444 /************************************************************************/
|
|
|
445 /* Give gdb/dbx enough information to decode Lisp Objects. We make
|
|
|
446 sure certain symbols are always defined, so gdb doesn't complain
|
|
438
|
447 about expressions in src/.gdbinit. See src/.gdbinit or src/.dbxrc
|
|
|
448 to see how this is used. */
|
|
428
|
449
|
|
458
|
450 EMACS_UINT dbg_valmask = ((1UL << VALBITS) - 1) << GCBITS;
|
|
|
451 EMACS_UINT dbg_typemask = (1UL << GCTYPEBITS) - 1;
|
|
428
|
452
|
|
|
453 #ifdef USE_UNION_TYPE
|
|
458
|
454 unsigned char dbg_USE_UNION_TYPE = 1;
|
|
428
|
455 #else
|
|
458
|
456 unsigned char dbg_USE_UNION_TYPE = 0;
|
|
428
|
457 #endif
|
|
|
458
|
|
458
|
459 unsigned char dbg_valbits = VALBITS;
|
|
|
460 unsigned char dbg_gctypebits = GCTYPEBITS;
|
|
|
461
|
|
|
462 /* On some systems, the above definitions will be optimized away by
|
|
|
463 the compiler or linker unless they are referenced in some function. */
|
|
|
464 long dbg_inhibit_dbg_symbol_deletion (void);
|
|
|
465 long
|
|
|
466 dbg_inhibit_dbg_symbol_deletion (void)
|
|
|
467 {
|
|
|
468 return
|
|
|
469 (dbg_valmask +
|
|
|
470 dbg_typemask +
|
|
|
471 dbg_USE_UNION_TYPE +
|
|
|
472 dbg_valbits +
|
|
|
473 dbg_gctypebits);
|
|
|
474 }
|
|
428
|
475
|
|
|
476 /* Macros turned into functions for ease of debugging.
|
|
|
477 Debuggers don't know about macros! */
|
|
|
478 int dbg_eq (Lisp_Object obj1, Lisp_Object obj2);
|
|
|
479 int
|
|
|
480 dbg_eq (Lisp_Object obj1, Lisp_Object obj2)
|
|
|
481 {
|
|
|
482 return EQ (obj1, obj2);
|
|
|
483 }
|
|
|
484
|
|
|
485
|
|
|
486 /************************************************************************/
|
|
|
487 /* Fixed-size type macros */
|
|
|
488 /************************************************************************/
|
|
|
489
|
|
|
490 /* For fixed-size types that are commonly used, we malloc() large blocks
|
|
|
491 of memory at a time and subdivide them into chunks of the correct
|
|
|
492 size for an object of that type. This is more efficient than
|
|
|
493 malloc()ing each object separately because we save on malloc() time
|
|
|
494 and overhead due to the fewer number of malloc()ed blocks, and
|
|
|
495 also because we don't need any extra pointers within each object
|
|
|
496 to keep them threaded together for GC purposes. For less common
|
|
|
497 (and frequently large-size) types, we use lcrecords, which are
|
|
|
498 malloc()ed individually and chained together through a pointer
|
|
|
499 in the lcrecord header. lcrecords do not need to be fixed-size
|
|
|
500 (i.e. two objects of the same type need not have the same size;
|
|
|
501 however, the size of a particular object cannot vary dynamically).
|
|
|
502 It is also much easier to create a new lcrecord type because no
|
|
|
503 additional code needs to be added to alloc.c. Finally, lcrecords
|
|
|
504 may be more efficient when there are only a small number of them.
|
|
|
505
|
|
|
506 The types that are stored in these large blocks (or "frob blocks")
|
|
|
507 are cons, float, compiled-function, symbol, marker, extent, event,
|
|
|
508 and string.
|
|
|
509
|
|
|
510 Note that strings are special in that they are actually stored in
|
|
|
511 two parts: a structure containing information about the string, and
|
|
|
512 the actual data associated with the string. The former structure
|
|
|
513 (a struct Lisp_String) is a fixed-size structure and is managed the
|
|
|
514 same way as all the other such types. This structure contains a
|
|
|
515 pointer to the actual string data, which is stored in structures of
|
|
|
516 type struct string_chars_block. Each string_chars_block consists
|
|
|
517 of a pointer to a struct Lisp_String, followed by the data for that
|
|
440
|
518 string, followed by another pointer to a Lisp_String, followed by
|
|
|
519 the data for that string, etc. At GC time, the data in these
|
|
|
520 blocks is compacted by searching sequentially through all the
|
|
428
|
521 blocks and compressing out any holes created by unmarked strings.
|
|
|
522 Strings that are more than a certain size (bigger than the size of
|
|
|
523 a string_chars_block, although something like half as big might
|
|
|
524 make more sense) are malloc()ed separately and not stored in
|
|
|
525 string_chars_blocks. Furthermore, no one string stretches across
|
|
|
526 two string_chars_blocks.
|
|
|
527
|
|
|
528 Vectors are each malloc()ed separately, similar to lcrecords.
|
|
|
529
|
|
|
530 In the following discussion, we use conses, but it applies equally
|
|
|
531 well to the other fixed-size types.
|
|
|
532
|
|
|
533 We store cons cells inside of cons_blocks, allocating a new
|
|
|
534 cons_block with malloc() whenever necessary. Cons cells reclaimed
|
|
|
535 by GC are put on a free list to be reallocated before allocating
|
|
|
536 any new cons cells from the latest cons_block. Each cons_block is
|
|
|
537 just under 2^n - MALLOC_OVERHEAD bytes long, since malloc (at least
|
|
|
538 the versions in malloc.c and gmalloc.c) really allocates in units
|
|
|
539 of powers of two and uses 4 bytes for its own overhead.
|
|
|
540
|
|
|
541 What GC actually does is to search through all the cons_blocks,
|
|
|
542 from the most recently allocated to the oldest, and put all
|
|
|
543 cons cells that are not marked (whether or not they're already
|
|
|
544 free) on a cons_free_list. The cons_free_list is a stack, and
|
|
|
545 so the cons cells in the oldest-allocated cons_block end up
|
|
|
546 at the head of the stack and are the first to be reallocated.
|
|
|
547 If any cons_block is entirely free, it is freed with free()
|
|
|
548 and its cons cells removed from the cons_free_list. Because
|
|
|
549 the cons_free_list ends up basically in memory order, we have
|
|
|
550 a high locality of reference (assuming a reasonable turnover
|
|
|
551 of allocating and freeing) and have a reasonable probability
|
|
|
552 of entirely freeing up cons_blocks that have been more recently
|
|
|
553 allocated. This stage is called the "sweep stage" of GC, and
|
|
|
554 is executed after the "mark stage", which involves starting
|
|
|
555 from all places that are known to point to in-use Lisp objects
|
|
|
556 (e.g. the obarray, where are all symbols are stored; the
|
|
|
557 current catches and condition-cases; the backtrace list of
|
|
|
558 currently executing functions; the gcpro list; etc.) and
|
|
|
559 recursively marking all objects that are accessible.
|
|
|
560
|
|
454
|
561 At the beginning of the sweep stage, the conses in the cons blocks
|
|
|
562 are in one of three states: in use and marked, in use but not
|
|
|
563 marked, and not in use (already freed). Any conses that are marked
|
|
|
564 have been marked in the mark stage just executed, because as part
|
|
|
565 of the sweep stage we unmark any marked objects. The way we tell
|
|
|
566 whether or not a cons cell is in use is through the LRECORD_FREE_P
|
|
|
567 macro. This uses a special lrecord type `lrecord_type_free',
|
|
|
568 which is never associated with any valid object.
|
|
|
569
|
|
|
570 Conses on the free_cons_list are threaded through a pointer stored
|
|
|
571 in the conses themselves. Because the cons is still in a
|
|
|
572 cons_block and needs to remain marked as not in use for the next
|
|
|
573 time that GC happens, we need room to store both the "free"
|
|
|
574 indicator and the chaining pointer. So this pointer is stored
|
|
|
575 after the lrecord header (actually where C places a pointer after
|
|
|
576 the lrecord header; they are not necessarily contiguous). This
|
|
|
577 implies that all fixed-size types must be big enough to contain at
|
|
|
578 least one pointer. This is true for all current fixed-size types,
|
|
|
579 with the possible exception of Lisp_Floats, for which we define the
|
|
|
580 meat of the struct using a union of a pointer and a double to
|
|
|
581 ensure adequate space for the free list chain pointer.
|
|
428
|
582
|
|
|
583 Some types of objects need additional "finalization" done
|
|
|
584 when an object is converted from in use to not in use;
|
|
|
585 this is the purpose of the ADDITIONAL_FREE_type macro.
|
|
|
586 For example, markers need to be removed from the chain
|
|
|
587 of markers that is kept in each buffer. This is because
|
|
|
588 markers in a buffer automatically disappear if the marker
|
|
|
589 is no longer referenced anywhere (the same does not
|
|
|
590 apply to extents, however).
|
|
|
591
|
|
|
592 WARNING: Things are in an extremely bizarre state when
|
|
|
593 the ADDITIONAL_FREE_type macros are called, so beware!
|
|
|
594
|
|
454
|
595 When ERROR_CHECK_GC is defined, we do things differently so as to
|
|
|
596 maximize our chances of catching places where there is insufficient
|
|
|
597 GCPROing. The thing we want to avoid is having an object that
|
|
|
598 we're using but didn't GCPRO get freed by GC and then reallocated
|
|
|
599 while we're in the process of using it -- this will result in
|
|
|
600 something seemingly unrelated getting trashed, and is extremely
|
|
|
601 difficult to track down. If the object gets freed but not
|
|
|
602 reallocated, we can usually catch this because we set most of the
|
|
|
603 bytes of a freed object to 0xDEADBEEF. (The lisp object type is set
|
|
|
604 to the invalid type `lrecord_type_free', however, and a pointer
|
|
|
605 used to chain freed objects together is stored after the lrecord
|
|
|
606 header; we play some tricks with this pointer to make it more
|
|
428
|
607 bogus, so crashes are more likely to occur right away.)
|
|
|
608
|
|
|
609 We want freed objects to stay free as long as possible,
|
|
|
610 so instead of doing what we do above, we maintain the
|
|
|
611 free objects in a first-in first-out queue. We also
|
|
|
612 don't recompute the free list each GC, unlike above;
|
|
|
613 this ensures that the queue ordering is preserved.
|
|
|
614 [This means that we are likely to have worse locality
|
|
|
615 of reference, and that we can never free a frob block
|
|
|
616 once it's allocated. (Even if we know that all cells
|
|
|
617 in it are free, there's no easy way to remove all those
|
|
|
618 cells from the free list because the objects on the
|
|
|
619 free list are unlikely to be in memory order.)]
|
|
|
620 Furthermore, we never take objects off the free list
|
|
|
621 unless there's a large number (usually 1000, but
|
|
|
622 varies depending on type) of them already on the list.
|
|
|
623 This way, we ensure that an object that gets freed will
|
|
|
624 remain free for the next 1000 (or whatever) times that
|
|
440
|
625 an object of that type is allocated. */
|
|
428
|
626
|
|
|
627 #ifndef MALLOC_OVERHEAD
|
|
|
628 #ifdef GNU_MALLOC
|
|
|
629 #define MALLOC_OVERHEAD 0
|
|
|
630 #elif defined (rcheck)
|
|
|
631 #define MALLOC_OVERHEAD 20
|
|
|
632 #else
|
|
|
633 #define MALLOC_OVERHEAD 8
|
|
|
634 #endif
|
|
|
635 #endif /* MALLOC_OVERHEAD */
|
|
|
636
|
|
|
637 #if !defined(HAVE_MMAP) || defined(DOUG_LEA_MALLOC)
|
|
|
638 /* If we released our reserve (due to running out of memory),
|
|
|
639 and we have a fair amount free once again,
|
|
|
640 try to set aside another reserve in case we run out once more.
|
|
|
641
|
|
|
642 This is called when a relocatable block is freed in ralloc.c. */
|
|
|
643 void refill_memory_reserve (void);
|
|
|
644 void
|
|
442
|
645 refill_memory_reserve (void)
|
|
428
|
646 {
|
|
|
647 if (breathing_space == 0)
|
|
|
648 breathing_space = (char *) malloc (4096 - MALLOC_OVERHEAD);
|
|
|
649 }
|
|
|
650 #endif
|
|
|
651
|
|
|
652 #ifdef ALLOC_NO_POOLS
|
|
|
653 # define TYPE_ALLOC_SIZE(type, structtype) 1
|
|
|
654 #else
|
|
|
655 # define TYPE_ALLOC_SIZE(type, structtype) \
|
|
|
656 ((2048 - MALLOC_OVERHEAD - sizeof (struct type##_block *)) \
|
|
|
657 / sizeof (structtype))
|
|
|
658 #endif /* ALLOC_NO_POOLS */
|
|
|
659
|
|
|
660 #define DECLARE_FIXED_TYPE_ALLOC(type, structtype) \
|
|
|
661 \
|
|
|
662 struct type##_block \
|
|
|
663 { \
|
|
|
664 struct type##_block *prev; \
|
|
|
665 structtype block[TYPE_ALLOC_SIZE (type, structtype)]; \
|
|
|
666 }; \
|
|
|
667 \
|
|
|
668 static struct type##_block *current_##type##_block; \
|
|
|
669 static int current_##type##_block_index; \
|
|
|
670 \
|
|
454
|
671 static Lisp_Free *type##_free_list; \
|
|
|
672 static Lisp_Free *type##_free_list_tail; \
|
|
428
|
673 \
|
|
|
674 static void \
|
|
|
675 init_##type##_alloc (void) \
|
|
|
676 { \
|
|
|
677 current_##type##_block = 0; \
|
|
|
678 current_##type##_block_index = \
|
|
|
679 countof (current_##type##_block->block); \
|
|
|
680 type##_free_list = 0; \
|
|
|
681 type##_free_list_tail = 0; \
|
|
|
682 } \
|
|
|
683 \
|
|
|
684 static int gc_count_num_##type##_in_use; \
|
|
|
685 static int gc_count_num_##type##_freelist
|
|
|
686
|
|
|
687 #define ALLOCATE_FIXED_TYPE_FROM_BLOCK(type, result) do { \
|
|
|
688 if (current_##type##_block_index \
|
|
|
689 == countof (current_##type##_block->block)) \
|
|
|
690 { \
|
|
|
691 struct type##_block *AFTFB_new = (struct type##_block *) \
|
|
|
692 allocate_lisp_storage (sizeof (struct type##_block)); \
|
|
|
693 AFTFB_new->prev = current_##type##_block; \
|
|
|
694 current_##type##_block = AFTFB_new; \
|
|
|
695 current_##type##_block_index = 0; \
|
|
|
696 } \
|
|
|
697 (result) = \
|
|
|
698 &(current_##type##_block->block[current_##type##_block_index++]); \
|
|
|
699 } while (0)
|
|
|
700
|
|
|
701 /* Allocate an instance of a type that is stored in blocks.
|
|
|
702 TYPE is the "name" of the type, STRUCTTYPE is the corresponding
|
|
|
703 structure type. */
|
|
|
704
|
|
|
705 #ifdef ERROR_CHECK_GC
|
|
|
706
|
|
|
707 /* Note: if you get crashes in this function, suspect incorrect calls
|
|
|
708 to free_cons() and friends. This happened once because the cons
|
|
|
709 cell was not GC-protected and was getting collected before
|
|
|
710 free_cons() was called. */
|
|
|
711
|
|
454
|
712 #define ALLOCATE_FIXED_TYPE_1(type, structtype, result) do { \
|
|
|
713 if (gc_count_num_##type##_freelist > \
|
|
|
714 MINIMUM_ALLOWED_FIXED_TYPE_CELLS_##type) \
|
|
|
715 { \
|
|
|
716 result = (structtype *) type##_free_list; \
|
|
|
717 /* Before actually using the chain pointer, \
|
|
|
718 we complement all its bits; see FREE_FIXED_TYPE(). */ \
|
|
|
719 type##_free_list = (Lisp_Free *) \
|
|
|
720 (~ (EMACS_UINT) (type##_free_list->chain)); \
|
|
|
721 gc_count_num_##type##_freelist--; \
|
|
|
722 } \
|
|
|
723 else \
|
|
|
724 ALLOCATE_FIXED_TYPE_FROM_BLOCK (type, result); \
|
|
|
725 MARK_LRECORD_AS_NOT_FREE (result); \
|
|
428
|
726 } while (0)
|
|
|
727
|
|
|
728 #else /* !ERROR_CHECK_GC */
|
|
|
729
|
|
454
|
730 #define ALLOCATE_FIXED_TYPE_1(type, structtype, result) do { \
|
|
428
|
731 if (type##_free_list) \
|
|
|
732 { \
|
|
454
|
733 result = (structtype *) type##_free_list; \
|
|
|
734 type##_free_list = type##_free_list->chain; \
|
|
428
|
735 } \
|
|
|
736 else \
|
|
|
737 ALLOCATE_FIXED_TYPE_FROM_BLOCK (type, result); \
|
|
454
|
738 MARK_LRECORD_AS_NOT_FREE (result); \
|
|
428
|
739 } while (0)
|
|
|
740
|
|
|
741 #endif /* !ERROR_CHECK_GC */
|
|
|
742
|
|
454
|
743
|
|
428
|
744 #define ALLOCATE_FIXED_TYPE(type, structtype, result) \
|
|
|
745 do \
|
|
|
746 { \
|
|
|
747 ALLOCATE_FIXED_TYPE_1 (type, structtype, result); \
|
|
|
748 INCREMENT_CONS_COUNTER (sizeof (structtype), #type); \
|
|
|
749 } while (0)
|
|
|
750
|
|
|
751 #define NOSEEUM_ALLOCATE_FIXED_TYPE(type, structtype, result) \
|
|
|
752 do \
|
|
|
753 { \
|
|
|
754 ALLOCATE_FIXED_TYPE_1 (type, structtype, result); \
|
|
|
755 NOSEEUM_INCREMENT_CONS_COUNTER (sizeof (structtype), #type); \
|
|
|
756 } while (0)
|
|
|
757
|
|
454
|
758
|
|
|
759 /* Lisp_Free is the type to represent a free list member inside a frob
|
|
|
760 block of any lisp object type. */
|
|
|
761 typedef struct Lisp_Free
|
|
|
762 {
|
|
|
763 struct lrecord_header lheader;
|
|
|
764 struct Lisp_Free *chain;
|
|
|
765 } Lisp_Free;
|
|
|
766
|
|
|
767 #define LRECORD_FREE_P(ptr) \
|
|
|
768 ((ptr)->lheader.type == lrecord_type_free)
|
|
|
769
|
|
|
770 #define MARK_LRECORD_AS_FREE(ptr) \
|
|
|
771 ((void) ((ptr)->lheader.type = lrecord_type_free))
|
|
|
772
|
|
|
773 #ifdef ERROR_CHECK_GC
|
|
|
774 #define MARK_LRECORD_AS_NOT_FREE(ptr) \
|
|
|
775 ((void) ((ptr)->lheader.type = lrecord_type_undefined))
|
|
428
|
776 #else
|
|
454
|
777 #define MARK_LRECORD_AS_NOT_FREE(ptr) DO_NOTHING
|
|
428
|
778 #endif
|
|
|
779
|
|
|
780 #ifdef ERROR_CHECK_GC
|
|
|
781
|
|
454
|
782 #define PUT_FIXED_TYPE_ON_FREE_LIST(type, structtype, ptr) do { \
|
|
|
783 if (type##_free_list_tail) \
|
|
|
784 { \
|
|
|
785 /* When we store the chain pointer, we complement all \
|
|
|
786 its bits; this should significantly increase its \
|
|
|
787 bogosity in case someone tries to use the value, and \
|
|
|
788 should make us crash faster if someone overwrites the \
|
|
|
789 pointer because when it gets un-complemented in \
|
|
|
790 ALLOCATED_FIXED_TYPE(), the resulting pointer will be \
|
|
|
791 extremely bogus. */ \
|
|
|
792 type##_free_list_tail->chain = \
|
|
|
793 (Lisp_Free *) ~ (EMACS_UINT) (ptr); \
|
|
|
794 } \
|
|
|
795 else \
|
|
|
796 type##_free_list = (Lisp_Free *) (ptr); \
|
|
|
797 type##_free_list_tail = (Lisp_Free *) (ptr); \
|
|
|
798 } while (0)
|
|
428
|
799
|
|
|
800 #else /* !ERROR_CHECK_GC */
|
|
|
801
|
|
454
|
802 #define PUT_FIXED_TYPE_ON_FREE_LIST(type, structtype, ptr) do { \
|
|
|
803 ((Lisp_Free *) (ptr))->chain = type##_free_list; \
|
|
|
804 type##_free_list = (Lisp_Free *) (ptr); \
|
|
|
805 } while (0) \
|
|
428
|
806
|
|
|
807 #endif /* !ERROR_CHECK_GC */
|
|
|
808
|
|
|
809 /* TYPE and STRUCTTYPE are the same as in ALLOCATE_FIXED_TYPE(). */
|
|
|
810
|
|
|
811 #define FREE_FIXED_TYPE(type, structtype, ptr) do { \
|
|
|
812 structtype *FFT_ptr = (ptr); \
|
|
|
813 ADDITIONAL_FREE_##type (FFT_ptr); \
|
|
|
814 deadbeef_memory (FFT_ptr, sizeof (structtype)); \
|
|
|
815 PUT_FIXED_TYPE_ON_FREE_LIST (type, structtype, FFT_ptr); \
|
|
454
|
816 MARK_LRECORD_AS_FREE (FFT_ptr); \
|
|
428
|
817 } while (0)
|
|
|
818
|
|
|
819 /* Like FREE_FIXED_TYPE() but used when we are explicitly
|
|
|
820 freeing a structure through free_cons(), free_marker(), etc.
|
|
|
821 rather than through the normal process of sweeping.
|
|
|
822 We attempt to undo the changes made to the allocation counters
|
|
|
823 as a result of this structure being allocated. This is not
|
|
|
824 completely necessary but helps keep things saner: e.g. this way,
|
|
|
825 repeatedly allocating and freeing a cons will not result in
|
|
|
826 the consing-since-gc counter advancing, which would cause a GC
|
|
|
827 and somewhat defeat the purpose of explicitly freeing. */
|
|
|
828
|
|
|
829 #define FREE_FIXED_TYPE_WHEN_NOT_IN_GC(type, structtype, ptr) \
|
|
|
830 do { FREE_FIXED_TYPE (type, structtype, ptr); \
|
|
|
831 DECREMENT_CONS_COUNTER (sizeof (structtype)); \
|
|
|
832 gc_count_num_##type##_freelist++; \
|
|
|
833 } while (0)
|
|
|
834
|
|
|
835
|
|
|
836
|
|
|
837 /************************************************************************/
|
|
|
838 /* Cons allocation */
|
|
|
839 /************************************************************************/
|
|
|
840
|
|
440
|
841 DECLARE_FIXED_TYPE_ALLOC (cons, Lisp_Cons);
|
|
428
|
842 /* conses are used and freed so often that we set this really high */
|
|
|
843 /* #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_cons 20000 */
|
|
|
844 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_cons 2000
|
|
|
845
|
|
|
846 static Lisp_Object
|
|
|
847 mark_cons (Lisp_Object obj)
|
|
|
848 {
|
|
|
849 if (NILP (XCDR (obj)))
|
|
|
850 return XCAR (obj);
|
|
|
851
|
|
|
852 mark_object (XCAR (obj));
|
|
|
853 return XCDR (obj);
|
|
|
854 }
|
|
|
855
|
|
|
856 static int
|
|
|
857 cons_equal (Lisp_Object ob1, Lisp_Object ob2, int depth)
|
|
|
858 {
|
|
442
|
859 depth++;
|
|
|
860 while (internal_equal (XCAR (ob1), XCAR (ob2), depth))
|
|
428
|
861 {
|
|
|
862 ob1 = XCDR (ob1);
|
|
|
863 ob2 = XCDR (ob2);
|
|
|
864 if (! CONSP (ob1) || ! CONSP (ob2))
|
|
442
|
865 return internal_equal (ob1, ob2, depth);
|
|
428
|
866 }
|
|
|
867 return 0;
|
|
|
868 }
|
|
|
869
|
|
|
870 static const struct lrecord_description cons_description[] = {
|
|
440
|
871 { XD_LISP_OBJECT, offsetof (Lisp_Cons, car) },
|
|
|
872 { XD_LISP_OBJECT, offsetof (Lisp_Cons, cdr) },
|
|
428
|
873 { XD_END }
|
|
|
874 };
|
|
|
875
|
|
|
876 DEFINE_BASIC_LRECORD_IMPLEMENTATION ("cons", cons,
|
|
|
877 mark_cons, print_cons, 0,
|
|
|
878 cons_equal,
|
|
|
879 /*
|
|
|
880 * No `hash' method needed.
|
|
|
881 * internal_hash knows how to
|
|
|
882 * handle conses.
|
|
|
883 */
|
|
|
884 0,
|
|
|
885 cons_description,
|
|
440
|
886 Lisp_Cons);
|
|
428
|
887
|
|
|
888 DEFUN ("cons", Fcons, 2, 2, 0, /*
|
|
|
889 Create a new cons, give it CAR and CDR as components, and return it.
|
|
|
890 */
|
|
|
891 (car, cdr))
|
|
|
892 {
|
|
|
893 /* This cannot GC. */
|
|
|
894 Lisp_Object val;
|
|
440
|
895 Lisp_Cons *c;
|
|
|
896
|
|
|
897 ALLOCATE_FIXED_TYPE (cons, Lisp_Cons, c);
|
|
442
|
898 set_lheader_implementation (&c->lheader, &lrecord_cons);
|
|
428
|
899 XSETCONS (val, c);
|
|
|
900 c->car = car;
|
|
|
901 c->cdr = cdr;
|
|
|
902 return val;
|
|
|
903 }
|
|
|
904
|
|
|
905 /* This is identical to Fcons() but it used for conses that we're
|
|
|
906 going to free later, and is useful when trying to track down
|
|
|
907 "real" consing. */
|
|
|
908 Lisp_Object
|
|
|
909 noseeum_cons (Lisp_Object car, Lisp_Object cdr)
|
|
|
910 {
|
|
|
911 Lisp_Object val;
|
|
440
|
912 Lisp_Cons *c;
|
|
|
913
|
|
|
914 NOSEEUM_ALLOCATE_FIXED_TYPE (cons, Lisp_Cons, c);
|
|
442
|
915 set_lheader_implementation (&c->lheader, &lrecord_cons);
|
|
428
|
916 XSETCONS (val, c);
|
|
|
917 XCAR (val) = car;
|
|
|
918 XCDR (val) = cdr;
|
|
|
919 return val;
|
|
|
920 }
|
|
|
921
|
|
|
922 DEFUN ("list", Flist, 0, MANY, 0, /*
|
|
|
923 Return a newly created list with specified arguments as elements.
|
|
|
924 Any number of arguments, even zero arguments, are allowed.
|
|
|
925 */
|
|
|
926 (int nargs, Lisp_Object *args))
|
|
|
927 {
|
|
|
928 Lisp_Object val = Qnil;
|
|
|
929 Lisp_Object *argp = args + nargs;
|
|
|
930
|
|
|
931 while (argp > args)
|
|
|
932 val = Fcons (*--argp, val);
|
|
|
933 return val;
|
|
|
934 }
|
|
|
935
|
|
|
936 Lisp_Object
|
|
|
937 list1 (Lisp_Object obj0)
|
|
|
938 {
|
|
|
939 /* This cannot GC. */
|
|
|
940 return Fcons (obj0, Qnil);
|
|
|
941 }
|
|
|
942
|
|
|
943 Lisp_Object
|
|
|
944 list2 (Lisp_Object obj0, Lisp_Object obj1)
|
|
|
945 {
|
|
|
946 /* This cannot GC. */
|
|
|
947 return Fcons (obj0, Fcons (obj1, Qnil));
|
|
|
948 }
|
|
|
949
|
|
|
950 Lisp_Object
|
|
|
951 list3 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2)
|
|
|
952 {
|
|
|
953 /* This cannot GC. */
|
|
|
954 return Fcons (obj0, Fcons (obj1, Fcons (obj2, Qnil)));
|
|
|
955 }
|
|
|
956
|
|
|
957 Lisp_Object
|
|
|
958 cons3 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2)
|
|
|
959 {
|
|
|
960 /* This cannot GC. */
|
|
|
961 return Fcons (obj0, Fcons (obj1, obj2));
|
|
|
962 }
|
|
|
963
|
|
|
964 Lisp_Object
|
|
|
965 acons (Lisp_Object key, Lisp_Object value, Lisp_Object alist)
|
|
|
966 {
|
|
|
967 return Fcons (Fcons (key, value), alist);
|
|
|
968 }
|
|
|
969
|
|
|
970 Lisp_Object
|
|
|
971 list4 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2, Lisp_Object obj3)
|
|
|
972 {
|
|
|
973 /* This cannot GC. */
|
|
|
974 return Fcons (obj0, Fcons (obj1, Fcons (obj2, Fcons (obj3, Qnil))));
|
|
|
975 }
|
|
|
976
|
|
|
977 Lisp_Object
|
|
|
978 list5 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2, Lisp_Object obj3,
|
|
|
979 Lisp_Object obj4)
|
|
|
980 {
|
|
|
981 /* This cannot GC. */
|
|
|
982 return Fcons (obj0, Fcons (obj1, Fcons (obj2, Fcons (obj3, Fcons (obj4, Qnil)))));
|
|
|
983 }
|
|
|
984
|
|
|
985 Lisp_Object
|
|
|
986 list6 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2, Lisp_Object obj3,
|
|
|
987 Lisp_Object obj4, Lisp_Object obj5)
|
|
|
988 {
|
|
|
989 /* This cannot GC. */
|
|
|
990 return Fcons (obj0, Fcons (obj1, Fcons (obj2, Fcons (obj3, Fcons (obj4, Fcons (obj5, Qnil))))));
|
|
|
991 }
|
|
|
992
|
|
|
993 DEFUN ("make-list", Fmake_list, 2, 2, 0, /*
|
|
444
|
994 Return a new list of length LENGTH, with each element being OBJECT.
|
|
428
|
995 */
|
|
444
|
996 (length, object))
|
|
428
|
997 {
|
|
|
998 CHECK_NATNUM (length);
|
|
|
999
|
|
|
1000 {
|
|
|
1001 Lisp_Object val = Qnil;
|
|
|
1002 size_t size = XINT (length);
|
|
|
1003
|
|
|
1004 while (size--)
|
|
444
|
1005 val = Fcons (object, val);
|
|
428
|
1006 return val;
|
|
|
1007 }
|
|
|
1008 }
|
|
|
1009
|
|
|
1010
|
|
|
1011 /************************************************************************/
|
|
|
1012 /* Float allocation */
|
|
|
1013 /************************************************************************/
|
|
|
1014
|
|
|
1015 #ifdef LISP_FLOAT_TYPE
|
|
|
1016
|
|
440
|
1017 DECLARE_FIXED_TYPE_ALLOC (float, Lisp_Float);
|
|
428
|
1018 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_float 1000
|
|
|
1019
|
|
|
1020 Lisp_Object
|
|
|
1021 make_float (double float_value)
|
|
|
1022 {
|
|
|
1023 Lisp_Object val;
|
|
440
|
1024 Lisp_Float *f;
|
|
|
1025
|
|
|
1026 ALLOCATE_FIXED_TYPE (float, Lisp_Float, f);
|
|
|
1027
|
|
|
1028 /* Avoid dump-time `uninitialized memory read' purify warnings. */
|
|
|
1029 if (sizeof (struct lrecord_header) + sizeof (double) != sizeof (*f))
|
|
|
1030 xzero (*f);
|
|
|
1031
|
|
442
|
1032 set_lheader_implementation (&f->lheader, &lrecord_float);
|
|
428
|
1033 float_data (f) = float_value;
|
|
|
1034 XSETFLOAT (val, f);
|
|
|
1035 return val;
|
|
|
1036 }
|
|
|
1037
|
|
|
1038 #endif /* LISP_FLOAT_TYPE */
|
|
|
1039
|
|
|
1040
|
|
|
1041 /************************************************************************/
|
|
|
1042 /* Vector allocation */
|
|
|
1043 /************************************************************************/
|
|
|
1044
|
|
|
1045 static Lisp_Object
|
|
|
1046 mark_vector (Lisp_Object obj)
|
|
|
1047 {
|
|
|
1048 Lisp_Vector *ptr = XVECTOR (obj);
|
|
|
1049 int len = vector_length (ptr);
|
|
|
1050 int i;
|
|
|
1051
|
|
|
1052 for (i = 0; i < len - 1; i++)
|
|
|
1053 mark_object (ptr->contents[i]);
|
|
|
1054 return (len > 0) ? ptr->contents[len - 1] : Qnil;
|
|
|
1055 }
|
|
|
1056
|
|
|
1057 static size_t
|
|
442
|
1058 size_vector (const void *lheader)
|
|
428
|
1059 {
|
|
456
|
1060 return FLEXIBLE_ARRAY_STRUCT_SIZEOF (Lisp_Vector, Lisp_Object, contents,
|
|
442
|
1061 ((Lisp_Vector *) lheader)->size);
|
|
428
|
1062 }
|
|
|
1063
|
|
|
1064 static int
|
|
|
1065 vector_equal (Lisp_Object obj1, Lisp_Object obj2, int depth)
|
|
|
1066 {
|
|
|
1067 int len = XVECTOR_LENGTH (obj1);
|
|
|
1068 if (len != XVECTOR_LENGTH (obj2))
|
|
|
1069 return 0;
|
|
|
1070
|
|
|
1071 {
|
|
|
1072 Lisp_Object *ptr1 = XVECTOR_DATA (obj1);
|
|
|
1073 Lisp_Object *ptr2 = XVECTOR_DATA (obj2);
|
|
|
1074 while (len--)
|
|
|
1075 if (!internal_equal (*ptr1++, *ptr2++, depth + 1))
|
|
|
1076 return 0;
|
|
|
1077 }
|
|
|
1078 return 1;
|
|
|
1079 }
|
|
|
1080
|
|
442
|
1081 static hashcode_t
|
|
|
1082 vector_hash (Lisp_Object obj, int depth)
|
|
|
1083 {
|
|
|
1084 return HASH2 (XVECTOR_LENGTH (obj),
|
|
|
1085 internal_array_hash (XVECTOR_DATA (obj),
|
|
|
1086 XVECTOR_LENGTH (obj),
|
|
|
1087 depth + 1));
|
|
|
1088 }
|
|
|
1089
|
|
428
|
1090 static const struct lrecord_description vector_description[] = {
|
|
440
|
1091 { XD_LONG, offsetof (Lisp_Vector, size) },
|
|
|
1092 { XD_LISP_OBJECT_ARRAY, offsetof (Lisp_Vector, contents), XD_INDIRECT(0, 0) },
|
|
428
|
1093 { XD_END }
|
|
|
1094 };
|
|
|
1095
|
|
|
1096 DEFINE_LRECORD_SEQUENCE_IMPLEMENTATION("vector", vector,
|
|
|
1097 mark_vector, print_vector, 0,
|
|
|
1098 vector_equal,
|
|
442
|
1099 vector_hash,
|
|
428
|
1100 vector_description,
|
|
|
1101 size_vector, Lisp_Vector);
|
|
|
1102
|
|
|
1103 /* #### should allocate `small' vectors from a frob-block */
|
|
|
1104 static Lisp_Vector *
|
|
|
1105 make_vector_internal (size_t sizei)
|
|
|
1106 {
|
|
|
1107 /* no vector_next */
|
|
456
|
1108 size_t sizem = FLEXIBLE_ARRAY_STRUCT_SIZEOF (Lisp_Vector, Lisp_Object,
|
|
|
1109 contents, sizei);
|
|
428
|
1110 Lisp_Vector *p = (Lisp_Vector *) alloc_lcrecord (sizem, &lrecord_vector);
|
|
|
1111
|
|
|
1112 p->size = sizei;
|
|
|
1113 return p;
|
|
|
1114 }
|
|
|
1115
|
|
|
1116 Lisp_Object
|
|
444
|
1117 make_vector (size_t length, Lisp_Object object)
|
|
428
|
1118 {
|
|
|
1119 Lisp_Vector *vecp = make_vector_internal (length);
|
|
|
1120 Lisp_Object *p = vector_data (vecp);
|
|
|
1121
|
|
|
1122 while (length--)
|
|
444
|
1123 *p++ = object;
|
|
428
|
1124
|
|
|
1125 {
|
|
|
1126 Lisp_Object vector;
|
|
|
1127 XSETVECTOR (vector, vecp);
|
|
|
1128 return vector;
|
|
|
1129 }
|
|
|
1130 }
|
|
|
1131
|
|
|
1132 DEFUN ("make-vector", Fmake_vector, 2, 2, 0, /*
|
|
444
|
1133 Return a new vector of length LENGTH, with each element being OBJECT.
|
|
428
|
1134 See also the function `vector'.
|
|
|
1135 */
|
|
444
|
1136 (length, object))
|
|
428
|
1137 {
|
|
|
1138 CONCHECK_NATNUM (length);
|
|
444
|
1139 return make_vector (XINT (length), object);
|
|
428
|
1140 }
|
|
|
1141
|
|
|
1142 DEFUN ("vector", Fvector, 0, MANY, 0, /*
|
|
|
1143 Return a newly created vector with specified arguments as elements.
|
|
|
1144 Any number of arguments, even zero arguments, are allowed.
|
|
|
1145 */
|
|
|
1146 (int nargs, Lisp_Object *args))
|
|
|
1147 {
|
|
|
1148 Lisp_Vector *vecp = make_vector_internal (nargs);
|
|
|
1149 Lisp_Object *p = vector_data (vecp);
|
|
|
1150
|
|
|
1151 while (nargs--)
|
|
|
1152 *p++ = *args++;
|
|
|
1153
|
|
|
1154 {
|
|
|
1155 Lisp_Object vector;
|
|
|
1156 XSETVECTOR (vector, vecp);
|
|
|
1157 return vector;
|
|
|
1158 }
|
|
|
1159 }
|
|
|
1160
|
|
|
1161 Lisp_Object
|
|
|
1162 vector1 (Lisp_Object obj0)
|
|
|
1163 {
|
|
|
1164 return Fvector (1, &obj0);
|
|
|
1165 }
|
|
|
1166
|
|
|
1167 Lisp_Object
|
|
|
1168 vector2 (Lisp_Object obj0, Lisp_Object obj1)
|
|
|
1169 {
|
|
|
1170 Lisp_Object args[2];
|
|
|
1171 args[0] = obj0;
|
|
|
1172 args[1] = obj1;
|
|
|
1173 return Fvector (2, args);
|
|
|
1174 }
|
|
|
1175
|
|
|
1176 Lisp_Object
|
|
|
1177 vector3 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2)
|
|
|
1178 {
|
|
|
1179 Lisp_Object args[3];
|
|
|
1180 args[0] = obj0;
|
|
|
1181 args[1] = obj1;
|
|
|
1182 args[2] = obj2;
|
|
|
1183 return Fvector (3, args);
|
|
|
1184 }
|
|
|
1185
|
|
|
1186 #if 0 /* currently unused */
|
|
|
1187
|
|
|
1188 Lisp_Object
|
|
|
1189 vector4 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2,
|
|
|
1190 Lisp_Object obj3)
|
|
|
1191 {
|
|
|
1192 Lisp_Object args[4];
|
|
|
1193 args[0] = obj0;
|
|
|
1194 args[1] = obj1;
|
|
|
1195 args[2] = obj2;
|
|
|
1196 args[3] = obj3;
|
|
|
1197 return Fvector (4, args);
|
|
|
1198 }
|
|
|
1199
|
|
|
1200 Lisp_Object
|
|
|
1201 vector5 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2,
|
|
|
1202 Lisp_Object obj3, Lisp_Object obj4)
|
|
|
1203 {
|
|
|
1204 Lisp_Object args[5];
|
|
|
1205 args[0] = obj0;
|
|
|
1206 args[1] = obj1;
|
|
|
1207 args[2] = obj2;
|
|
|
1208 args[3] = obj3;
|
|
|
1209 args[4] = obj4;
|
|
|
1210 return Fvector (5, args);
|
|
|
1211 }
|
|
|
1212
|
|
|
1213 Lisp_Object
|
|
|
1214 vector6 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2,
|
|
|
1215 Lisp_Object obj3, Lisp_Object obj4, Lisp_Object obj5)
|
|
|
1216 {
|
|
|
1217 Lisp_Object args[6];
|
|
|
1218 args[0] = obj0;
|
|
|
1219 args[1] = obj1;
|
|
|
1220 args[2] = obj2;
|
|
|
1221 args[3] = obj3;
|
|
|
1222 args[4] = obj4;
|
|
|
1223 args[5] = obj5;
|
|
|
1224 return Fvector (6, args);
|
|
|
1225 }
|
|
|
1226
|
|
|
1227 Lisp_Object
|
|
|
1228 vector7 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2,
|
|
|
1229 Lisp_Object obj3, Lisp_Object obj4, Lisp_Object obj5,
|
|
|
1230 Lisp_Object obj6)
|
|
|
1231 {
|
|
|
1232 Lisp_Object args[7];
|
|
|
1233 args[0] = obj0;
|
|
|
1234 args[1] = obj1;
|
|
|
1235 args[2] = obj2;
|
|
|
1236 args[3] = obj3;
|
|
|
1237 args[4] = obj4;
|
|
|
1238 args[5] = obj5;
|
|
|
1239 args[6] = obj6;
|
|
|
1240 return Fvector (7, args);
|
|
|
1241 }
|
|
|
1242
|
|
|
1243 Lisp_Object
|
|
|
1244 vector8 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2,
|
|
|
1245 Lisp_Object obj3, Lisp_Object obj4, Lisp_Object obj5,
|
|
|
1246 Lisp_Object obj6, Lisp_Object obj7)
|
|
|
1247 {
|
|
|
1248 Lisp_Object args[8];
|
|
|
1249 args[0] = obj0;
|
|
|
1250 args[1] = obj1;
|
|
|
1251 args[2] = obj2;
|
|
|
1252 args[3] = obj3;
|
|
|
1253 args[4] = obj4;
|
|
|
1254 args[5] = obj5;
|
|
|
1255 args[6] = obj6;
|
|
|
1256 args[7] = obj7;
|
|
|
1257 return Fvector (8, args);
|
|
|
1258 }
|
|
|
1259 #endif /* unused */
|
|
|
1260
|
|
|
1261 /************************************************************************/
|
|
|
1262 /* Bit Vector allocation */
|
|
|
1263 /************************************************************************/
|
|
|
1264
|
|
|
1265 static Lisp_Object all_bit_vectors;
|
|
|
1266
|
|
|
1267 /* #### should allocate `small' bit vectors from a frob-block */
|
|
440
|
1268 static Lisp_Bit_Vector *
|
|
428
|
1269 make_bit_vector_internal (size_t sizei)
|
|
|
1270 {
|
|
|
1271 size_t num_longs = BIT_VECTOR_LONG_STORAGE (sizei);
|
|
456
|
1272 size_t sizem = FLEXIBLE_ARRAY_STRUCT_SIZEOF (Lisp_Bit_Vector, unsigned long,
|
|
|
1273 bits, num_longs);
|
|
428
|
1274 Lisp_Bit_Vector *p = (Lisp_Bit_Vector *) allocate_lisp_storage (sizem);
|
|
442
|
1275 set_lheader_implementation (&p->lheader, &lrecord_bit_vector);
|
|
428
|
1276
|
|
|
1277 INCREMENT_CONS_COUNTER (sizem, "bit-vector");
|
|
|
1278
|
|
|
1279 bit_vector_length (p) = sizei;
|
|
|
1280 bit_vector_next (p) = all_bit_vectors;
|
|
|
1281 /* make sure the extra bits in the last long are 0; the calling
|
|
|
1282 functions might not set them. */
|
|
|
1283 p->bits[num_longs - 1] = 0;
|
|
|
1284 XSETBIT_VECTOR (all_bit_vectors, p);
|
|
|
1285 return p;
|
|
|
1286 }
|
|
|
1287
|
|
|
1288 Lisp_Object
|
|
444
|
1289 make_bit_vector (size_t length, Lisp_Object bit)
|
|
428
|
1290 {
|
|
440
|
1291 Lisp_Bit_Vector *p = make_bit_vector_internal (length);
|
|
428
|
1292 size_t num_longs = BIT_VECTOR_LONG_STORAGE (length);
|
|
|
1293
|
|
444
|
1294 CHECK_BIT (bit);
|
|
|
1295
|
|
|
1296 if (ZEROP (bit))
|
|
428
|
1297 memset (p->bits, 0, num_longs * sizeof (long));
|
|
|
1298 else
|
|
|
1299 {
|
|
|
1300 size_t bits_in_last = length & (LONGBITS_POWER_OF_2 - 1);
|
|
|
1301 memset (p->bits, ~0, num_longs * sizeof (long));
|
|
|
1302 /* But we have to make sure that the unused bits in the
|
|
|
1303 last long are 0, so that equal/hash is easy. */
|
|
|
1304 if (bits_in_last)
|
|
|
1305 p->bits[num_longs - 1] &= (1 << bits_in_last) - 1;
|
|
|
1306 }
|
|
|
1307
|
|
|
1308 {
|
|
|
1309 Lisp_Object bit_vector;
|
|
|
1310 XSETBIT_VECTOR (bit_vector, p);
|
|
|
1311 return bit_vector;
|
|
|
1312 }
|
|
|
1313 }
|
|
|
1314
|
|
|
1315 Lisp_Object
|
|
|
1316 make_bit_vector_from_byte_vector (unsigned char *bytevec, size_t length)
|
|
|
1317 {
|
|
|
1318 int i;
|
|
|
1319 Lisp_Bit_Vector *p = make_bit_vector_internal (length);
|
|
|
1320
|
|
|
1321 for (i = 0; i < length; i++)
|
|
|
1322 set_bit_vector_bit (p, i, bytevec[i]);
|
|
|
1323
|
|
|
1324 {
|
|
|
1325 Lisp_Object bit_vector;
|
|
|
1326 XSETBIT_VECTOR (bit_vector, p);
|
|
|
1327 return bit_vector;
|
|
|
1328 }
|
|
|
1329 }
|
|
|
1330
|
|
|
1331 DEFUN ("make-bit-vector", Fmake_bit_vector, 2, 2, 0, /*
|
|
444
|
1332 Return a new bit vector of length LENGTH. with each bit set to BIT.
|
|
|
1333 BIT must be one of the integers 0 or 1. See also the function `bit-vector'.
|
|
428
|
1334 */
|
|
444
|
1335 (length, bit))
|
|
428
|
1336 {
|
|
|
1337 CONCHECK_NATNUM (length);
|
|
|
1338
|
|
444
|
1339 return make_bit_vector (XINT (length), bit);
|
|
428
|
1340 }
|
|
|
1341
|
|
|
1342 DEFUN ("bit-vector", Fbit_vector, 0, MANY, 0, /*
|
|
|
1343 Return a newly created bit vector with specified arguments as elements.
|
|
|
1344 Any number of arguments, even zero arguments, are allowed.
|
|
444
|
1345 Each argument must be one of the integers 0 or 1.
|
|
428
|
1346 */
|
|
|
1347 (int nargs, Lisp_Object *args))
|
|
|
1348 {
|
|
|
1349 int i;
|
|
|
1350 Lisp_Bit_Vector *p = make_bit_vector_internal (nargs);
|
|
|
1351
|
|
|
1352 for (i = 0; i < nargs; i++)
|
|
|
1353 {
|
|
|
1354 CHECK_BIT (args[i]);
|
|
|
1355 set_bit_vector_bit (p, i, !ZEROP (args[i]));
|
|
|
1356 }
|
|
|
1357
|
|
|
1358 {
|
|
|
1359 Lisp_Object bit_vector;
|
|
|
1360 XSETBIT_VECTOR (bit_vector, p);
|
|
|
1361 return bit_vector;
|
|
|
1362 }
|
|
|
1363 }
|
|
|
1364
|
|
|
1365
|
|
|
1366 /************************************************************************/
|
|
|
1367 /* Compiled-function allocation */
|
|
|
1368 /************************************************************************/
|
|
|
1369
|
|
|
1370 DECLARE_FIXED_TYPE_ALLOC (compiled_function, Lisp_Compiled_Function);
|
|
|
1371 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_compiled_function 1000
|
|
|
1372
|
|
|
1373 static Lisp_Object
|
|
|
1374 make_compiled_function (void)
|
|
|
1375 {
|
|
|
1376 Lisp_Compiled_Function *f;
|
|
|
1377 Lisp_Object fun;
|
|
|
1378
|
|
|
1379 ALLOCATE_FIXED_TYPE (compiled_function, Lisp_Compiled_Function, f);
|
|
442
|
1380 set_lheader_implementation (&f->lheader, &lrecord_compiled_function);
|
|
428
|
1381
|
|
|
1382 f->stack_depth = 0;
|
|
|
1383 f->specpdl_depth = 0;
|
|
|
1384 f->flags.documentationp = 0;
|
|
|
1385 f->flags.interactivep = 0;
|
|
|
1386 f->flags.domainp = 0; /* I18N3 */
|
|
|
1387 f->instructions = Qzero;
|
|
|
1388 f->constants = Qzero;
|
|
|
1389 f->arglist = Qnil;
|
|
|
1390 f->doc_and_interactive = Qnil;
|
|
|
1391 #ifdef COMPILED_FUNCTION_ANNOTATION_HACK
|
|
|
1392 f->annotated = Qnil;
|
|
|
1393 #endif
|
|
|
1394 XSETCOMPILED_FUNCTION (fun, f);
|
|
|
1395 return fun;
|
|
|
1396 }
|
|
|
1397
|
|
|
1398 DEFUN ("make-byte-code", Fmake_byte_code, 4, MANY, 0, /*
|
|
|
1399 Return a new compiled-function object.
|
|
|
1400 Usage: (arglist instructions constants stack-depth
|
|
|
1401 &optional doc-string interactive)
|
|
|
1402 Note that, unlike all other emacs-lisp functions, calling this with five
|
|
|
1403 arguments is NOT the same as calling it with six arguments, the last of
|
|
|
1404 which is nil. If the INTERACTIVE arg is specified as nil, then that means
|
|
|
1405 that this function was defined with `(interactive)'. If the arg is not
|
|
|
1406 specified, then that means the function is not interactive.
|
|
|
1407 This is terrible behavior which is retained for compatibility with old
|
|
|
1408 `.elc' files which expect these semantics.
|
|
|
1409 */
|
|
|
1410 (int nargs, Lisp_Object *args))
|
|
|
1411 {
|
|
|
1412 /* In a non-insane world this function would have this arglist...
|
|
|
1413 (arglist instructions constants stack_depth &optional doc_string interactive)
|
|
|
1414 */
|
|
|
1415 Lisp_Object fun = make_compiled_function ();
|
|
|
1416 Lisp_Compiled_Function *f = XCOMPILED_FUNCTION (fun);
|
|
|
1417
|
|
|
1418 Lisp_Object arglist = args[0];
|
|
|
1419 Lisp_Object instructions = args[1];
|
|
|
1420 Lisp_Object constants = args[2];
|
|
|
1421 Lisp_Object stack_depth = args[3];
|
|
|
1422 Lisp_Object doc_string = (nargs > 4) ? args[4] : Qnil;
|
|
|
1423 Lisp_Object interactive = (nargs > 5) ? args[5] : Qunbound;
|
|
|
1424
|
|
|
1425 if (nargs < 4 || nargs > 6)
|
|
|
1426 return Fsignal (Qwrong_number_of_arguments,
|
|
|
1427 list2 (intern ("make-byte-code"), make_int (nargs)));
|
|
|
1428
|
|
|
1429 /* Check for valid formal parameter list now, to allow us to use
|
|
|
1430 SPECBIND_FAST_UNSAFE() later in funcall_compiled_function(). */
|
|
|
1431 {
|
|
|
1432 EXTERNAL_LIST_LOOP_3 (symbol, arglist, tail)
|
|
|
1433 {
|
|
|
1434 CHECK_SYMBOL (symbol);
|
|
|
1435 if (EQ (symbol, Qt) ||
|
|
|
1436 EQ (symbol, Qnil) ||
|
|
|
1437 SYMBOL_IS_KEYWORD (symbol))
|
|
|
1438 signal_simple_error_2
|
|
|
1439 ("Invalid constant symbol in formal parameter list",
|
|
|
1440 symbol, arglist);
|
|
|
1441 }
|
|
|
1442 }
|
|
|
1443 f->arglist = arglist;
|
|
|
1444
|
|
|
1445 /* `instructions' is a string or a cons (string . int) for a
|
|
|
1446 lazy-loaded function. */
|
|
|
1447 if (CONSP (instructions))
|
|
|
1448 {
|
|
|
1449 CHECK_STRING (XCAR (instructions));
|
|
|
1450 CHECK_INT (XCDR (instructions));
|
|
|
1451 }
|
|
|
1452 else
|
|
|
1453 {
|
|
|
1454 CHECK_STRING (instructions);
|
|
|
1455 }
|
|
|
1456 f->instructions = instructions;
|
|
|
1457
|
|
|
1458 if (!NILP (constants))
|
|
|
1459 CHECK_VECTOR (constants);
|
|
|
1460 f->constants = constants;
|
|
|
1461
|
|
|
1462 CHECK_NATNUM (stack_depth);
|
|
442
|
1463 f->stack_depth = (unsigned short) XINT (stack_depth);
|
|
428
|
1464
|
|
|
1465 #ifdef COMPILED_FUNCTION_ANNOTATION_HACK
|
|
|
1466 if (!NILP (Vcurrent_compiled_function_annotation))
|
|
|
1467 f->annotated = Fcopy (Vcurrent_compiled_function_annotation);
|
|
|
1468 else if (!NILP (Vload_file_name_internal_the_purecopy))
|
|
|
1469 f->annotated = Vload_file_name_internal_the_purecopy;
|
|
|
1470 else if (!NILP (Vload_file_name_internal))
|
|
|
1471 {
|
|
|
1472 struct gcpro gcpro1;
|
|
|
1473 GCPRO1 (fun); /* don't let fun get reaped */
|
|
|
1474 Vload_file_name_internal_the_purecopy =
|
|
|
1475 Ffile_name_nondirectory (Vload_file_name_internal);
|
|
|
1476 f->annotated = Vload_file_name_internal_the_purecopy;
|
|
|
1477 UNGCPRO;
|
|
|
1478 }
|
|
|
1479 #endif /* COMPILED_FUNCTION_ANNOTATION_HACK */
|
|
|
1480
|
|
|
1481 /* doc_string may be nil, string, int, or a cons (string . int).
|
|
|
1482 interactive may be list or string (or unbound). */
|
|
|
1483 f->doc_and_interactive = Qunbound;
|
|
|
1484 #ifdef I18N3
|
|
|
1485 if ((f->flags.domainp = !NILP (Vfile_domain)) != 0)
|
|
|
1486 f->doc_and_interactive = Vfile_domain;
|
|
|
1487 #endif
|
|
|
1488 if ((f->flags.interactivep = !UNBOUNDP (interactive)) != 0)
|
|
|
1489 {
|
|
|
1490 f->doc_and_interactive
|
|
|
1491 = (UNBOUNDP (f->doc_and_interactive) ? interactive :
|
|
|
1492 Fcons (interactive, f->doc_and_interactive));
|
|
|
1493 }
|
|
|
1494 if ((f->flags.documentationp = !NILP (doc_string)) != 0)
|
|
|
1495 {
|
|
|
1496 f->doc_and_interactive
|
|
|
1497 = (UNBOUNDP (f->doc_and_interactive) ? doc_string :
|
|
|
1498 Fcons (doc_string, f->doc_and_interactive));
|
|
|
1499 }
|
|
|
1500 if (UNBOUNDP (f->doc_and_interactive))
|
|
|
1501 f->doc_and_interactive = Qnil;
|
|
|
1502
|
|
|
1503 return fun;
|
|
|
1504 }
|
|
|
1505
|
|
|
1506
|
|
|
1507 /************************************************************************/
|
|
|
1508 /* Symbol allocation */
|
|
|
1509 /************************************************************************/
|
|
|
1510
|
|
440
|
1511 DECLARE_FIXED_TYPE_ALLOC (symbol, Lisp_Symbol);
|
|
428
|
1512 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_symbol 1000
|
|
|
1513
|
|
|
1514 DEFUN ("make-symbol", Fmake_symbol, 1, 1, 0, /*
|
|
|
1515 Return a newly allocated uninterned symbol whose name is NAME.
|
|
|
1516 Its value and function definition are void, and its property list is nil.
|
|
|
1517 */
|
|
|
1518 (name))
|
|
|
1519 {
|
|
|
1520 Lisp_Object val;
|
|
440
|
1521 Lisp_Symbol *p;
|
|
428
|
1522
|
|
|
1523 CHECK_STRING (name);
|
|
|
1524
|
|
440
|
1525 ALLOCATE_FIXED_TYPE (symbol, Lisp_Symbol, p);
|
|
442
|
1526 set_lheader_implementation (&p->lheader, &lrecord_symbol);
|
|
428
|
1527 p->name = XSTRING (name);
|
|
|
1528 p->plist = Qnil;
|
|
|
1529 p->value = Qunbound;
|
|
|
1530 p->function = Qunbound;
|
|
|
1531 symbol_next (p) = 0;
|
|
|
1532 XSETSYMBOL (val, p);
|
|
|
1533 return val;
|
|
|
1534 }
|
|
|
1535
|
|
|
1536
|
|
|
1537 /************************************************************************/
|
|
|
1538 /* Extent allocation */
|
|
|
1539 /************************************************************************/
|
|
|
1540
|
|
|
1541 DECLARE_FIXED_TYPE_ALLOC (extent, struct extent);
|
|
|
1542 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_extent 1000
|
|
|
1543
|
|
|
1544 struct extent *
|
|
|
1545 allocate_extent (void)
|
|
|
1546 {
|
|
|
1547 struct extent *e;
|
|
|
1548
|
|
|
1549 ALLOCATE_FIXED_TYPE (extent, struct extent, e);
|
|
442
|
1550 set_lheader_implementation (&e->lheader, &lrecord_extent);
|
|
428
|
1551 extent_object (e) = Qnil;
|
|
|
1552 set_extent_start (e, -1);
|
|
|
1553 set_extent_end (e, -1);
|
|
|
1554 e->plist = Qnil;
|
|
|
1555
|
|
|
1556 xzero (e->flags);
|
|
|
1557
|
|
|
1558 extent_face (e) = Qnil;
|
|
|
1559 e->flags.end_open = 1; /* default is for endpoints to behave like markers */
|
|
|
1560 e->flags.detachable = 1;
|
|
|
1561
|
|
|
1562 return e;
|
|
|
1563 }
|
|
|
1564
|
|
|
1565
|
|
|
1566 /************************************************************************/
|
|
|
1567 /* Event allocation */
|
|
|
1568 /************************************************************************/
|
|
|
1569
|
|
440
|
1570 DECLARE_FIXED_TYPE_ALLOC (event, Lisp_Event);
|
|
428
|
1571 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_event 1000
|
|
|
1572
|
|
|
1573 Lisp_Object
|
|
|
1574 allocate_event (void)
|
|
|
1575 {
|
|
|
1576 Lisp_Object val;
|
|
440
|
1577 Lisp_Event *e;
|
|
|
1578
|
|
|
1579 ALLOCATE_FIXED_TYPE (event, Lisp_Event, e);
|
|
442
|
1580 set_lheader_implementation (&e->lheader, &lrecord_event);
|
|
428
|
1581
|
|
|
1582 XSETEVENT (val, e);
|
|
|
1583 return val;
|
|
|
1584 }
|
|
|
1585
|
|
|
1586
|
|
|
1587 /************************************************************************/
|
|
|
1588 /* Marker allocation */
|
|
|
1589 /************************************************************************/
|
|
|
1590
|
|
440
|
1591 DECLARE_FIXED_TYPE_ALLOC (marker, Lisp_Marker);
|
|
428
|
1592 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_marker 1000
|
|
|
1593
|
|
|
1594 DEFUN ("make-marker", Fmake_marker, 0, 0, 0, /*
|
|
|
1595 Return a new marker which does not point at any place.
|
|
|
1596 */
|
|
|
1597 ())
|
|
|
1598 {
|
|
|
1599 Lisp_Object val;
|
|
440
|
1600 Lisp_Marker *p;
|
|
|
1601
|
|
|
1602 ALLOCATE_FIXED_TYPE (marker, Lisp_Marker, p);
|
|
442
|
1603 set_lheader_implementation (&p->lheader, &lrecord_marker);
|
|
428
|
1604 p->buffer = 0;
|
|
|
1605 p->memind = 0;
|
|
|
1606 marker_next (p) = 0;
|
|
|
1607 marker_prev (p) = 0;
|
|
|
1608 p->insertion_type = 0;
|
|
|
1609 XSETMARKER (val, p);
|
|
|
1610 return val;
|
|
|
1611 }
|
|
|
1612
|
|
|
1613 Lisp_Object
|
|
|
1614 noseeum_make_marker (void)
|
|
|
1615 {
|
|
|
1616 Lisp_Object val;
|
|
440
|
1617 Lisp_Marker *p;
|
|
|
1618
|
|
|
1619 NOSEEUM_ALLOCATE_FIXED_TYPE (marker, Lisp_Marker, p);
|
|
442
|
1620 set_lheader_implementation (&p->lheader, &lrecord_marker);
|
|
428
|
1621 p->buffer = 0;
|
|
|
1622 p->memind = 0;
|
|
|
1623 marker_next (p) = 0;
|
|
|
1624 marker_prev (p) = 0;
|
|
|
1625 p->insertion_type = 0;
|
|
|
1626 XSETMARKER (val, p);
|
|
|
1627 return val;
|
|
|
1628 }
|
|
|
1629
|
|
|
1630
|
|
|
1631 /************************************************************************/
|
|
|
1632 /* String allocation */
|
|
|
1633 /************************************************************************/
|
|
|
1634
|
|
|
1635 /* The data for "short" strings generally resides inside of structs of type
|
|
|
1636 string_chars_block. The Lisp_String structure is allocated just like any
|
|
|
1637 other Lisp object (except for vectors), and these are freelisted when
|
|
|
1638 they get garbage collected. The data for short strings get compacted,
|
|
|
1639 but the data for large strings do not.
|
|
|
1640
|
|
|
1641 Previously Lisp_String structures were relocated, but this caused a lot
|
|
|
1642 of bus-errors because the C code didn't include enough GCPRO's for
|
|
|
1643 strings (since EVERY REFERENCE to a short string needed to be GCPRO'd so
|
|
|
1644 that the reference would get relocated).
|
|
|
1645
|
|
|
1646 This new method makes things somewhat bigger, but it is MUCH safer. */
|
|
|
1647
|
|
438
|
1648 DECLARE_FIXED_TYPE_ALLOC (string, Lisp_String);
|
|
428
|
1649 /* strings are used and freed quite often */
|
|
|
1650 /* #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_string 10000 */
|
|
|
1651 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_string 1000
|
|
|
1652
|
|
|
1653 static Lisp_Object
|
|
|
1654 mark_string (Lisp_Object obj)
|
|
|
1655 {
|
|
438
|
1656 Lisp_String *ptr = XSTRING (obj);
|
|
428
|
1657
|
|
|
1658 if (CONSP (ptr->plist) && EXTENT_INFOP (XCAR (ptr->plist)))
|
|
|
1659 flush_cached_extent_info (XCAR (ptr->plist));
|
|
|
1660 return ptr->plist;
|
|
|
1661 }
|
|
|
1662
|
|
|
1663 static int
|
|
|
1664 string_equal (Lisp_Object obj1, Lisp_Object obj2, int depth)
|
|
|
1665 {
|
|
|
1666 Bytecount len;
|
|
|
1667 return (((len = XSTRING_LENGTH (obj1)) == XSTRING_LENGTH (obj2)) &&
|
|
|
1668 !memcmp (XSTRING_DATA (obj1), XSTRING_DATA (obj2), len));
|
|
|
1669 }
|
|
|
1670
|
|
|
1671 static const struct lrecord_description string_description[] = {
|
|
440
|
1672 { XD_BYTECOUNT, offsetof (Lisp_String, size) },
|
|
|
1673 { XD_OPAQUE_DATA_PTR, offsetof (Lisp_String, data), XD_INDIRECT(0, 1) },
|
|
|
1674 { XD_LISP_OBJECT, offsetof (Lisp_String, plist) },
|
|
428
|
1675 { XD_END }
|
|
|
1676 };
|
|
|
1677
|
|
442
|
1678 /* We store the string's extent info as the first element of the string's
|
|
|
1679 property list; and the string's MODIFF as the first or second element
|
|
|
1680 of the string's property list (depending on whether the extent info
|
|
|
1681 is present), but only if the string has been modified. This is ugly
|
|
|
1682 but it reduces the memory allocated for the string in the vast
|
|
|
1683 majority of cases, where the string is never modified and has no
|
|
|
1684 extent info.
|
|
|
1685
|
|
|
1686 #### This means you can't use an int as a key in a string's plist. */
|
|
|
1687
|
|
|
1688 static Lisp_Object *
|
|
|
1689 string_plist_ptr (Lisp_Object string)
|
|
|
1690 {
|
|
|
1691 Lisp_Object *ptr = &XSTRING (string)->plist;
|
|
|
1692
|
|
|
1693 if (CONSP (*ptr) && EXTENT_INFOP (XCAR (*ptr)))
|
|
|
1694 ptr = &XCDR (*ptr);
|
|
|
1695 if (CONSP (*ptr) && INTP (XCAR (*ptr)))
|
|
|
1696 ptr = &XCDR (*ptr);
|
|
|
1697 return ptr;
|
|
|
1698 }
|
|
|
1699
|
|
|
1700 static Lisp_Object
|
|
|
1701 string_getprop (Lisp_Object string, Lisp_Object property)
|
|
|
1702 {
|
|
|
1703 return external_plist_get (string_plist_ptr (string), property, 0, ERROR_ME);
|
|
|
1704 }
|
|
|
1705
|
|
|
1706 static int
|
|
|
1707 string_putprop (Lisp_Object string, Lisp_Object property, Lisp_Object value)
|
|
|
1708 {
|
|
|
1709 external_plist_put (string_plist_ptr (string), property, value, 0, ERROR_ME);
|
|
|
1710 return 1;
|
|
|
1711 }
|
|
|
1712
|
|
|
1713 static int
|
|
|
1714 string_remprop (Lisp_Object string, Lisp_Object property)
|
|
|
1715 {
|
|
|
1716 return external_remprop (string_plist_ptr (string), property, 0, ERROR_ME);
|
|
|
1717 }
|
|
|
1718
|
|
|
1719 static Lisp_Object
|
|
|
1720 string_plist (Lisp_Object string)
|
|
|
1721 {
|
|
|
1722 return *string_plist_ptr (string);
|
|
|
1723 }
|
|
|
1724
|
|
|
1725 /* No `finalize', or `hash' methods.
|
|
|
1726 internal_hash() already knows how to hash strings and finalization
|
|
|
1727 is done with the ADDITIONAL_FREE_string macro, which is the
|
|
|
1728 standard way to do finalization when using
|
|
|
1729 SWEEP_FIXED_TYPE_BLOCK(). */
|
|
|
1730 DEFINE_BASIC_LRECORD_IMPLEMENTATION_WITH_PROPS ("string", string,
|
|
|
1731 mark_string, print_string,
|
|
|
1732 0, string_equal, 0,
|
|
|
1733 string_description,
|
|
|
1734 string_getprop,
|
|
|
1735 string_putprop,
|
|
|
1736 string_remprop,
|
|
|
1737 string_plist,
|
|
|
1738 Lisp_String);
|
|
428
|
1739
|
|
|
1740 /* String blocks contain this many useful bytes. */
|
|
|
1741 #define STRING_CHARS_BLOCK_SIZE \
|
|
|
1742 ((Bytecount) (8192 - MALLOC_OVERHEAD - \
|
|
|
1743 ((2 * sizeof (struct string_chars_block *)) \
|
|
|
1744 + sizeof (EMACS_INT))))
|
|
|
1745 /* Block header for small strings. */
|
|
|
1746 struct string_chars_block
|
|
|
1747 {
|
|
|
1748 EMACS_INT pos;
|
|
|
1749 struct string_chars_block *next;
|
|
|
1750 struct string_chars_block *prev;
|
|
|
1751 /* Contents of string_chars_block->string_chars are interleaved
|
|
|
1752 string_chars structures (see below) and the actual string data */
|
|
|
1753 unsigned char string_chars[STRING_CHARS_BLOCK_SIZE];
|
|
|
1754 };
|
|
|
1755
|
|
|
1756 static struct string_chars_block *first_string_chars_block;
|
|
|
1757 static struct string_chars_block *current_string_chars_block;
|
|
|
1758
|
|
|
1759 /* If SIZE is the length of a string, this returns how many bytes
|
|
|
1760 * the string occupies in string_chars_block->string_chars
|
|
|
1761 * (including alignment padding).
|
|
|
1762 */
|
|
438
|
1763 #define STRING_FULLSIZE(size) \
|
|
|
1764 ALIGN_SIZE (((size) + 1 + sizeof (Lisp_String *)),\
|
|
|
1765 ALIGNOF (Lisp_String *))
|
|
428
|
1766
|
|
|
1767 #define BIG_STRING_FULLSIZE_P(fullsize) ((fullsize) >= STRING_CHARS_BLOCK_SIZE)
|
|
|
1768 #define BIG_STRING_SIZE_P(size) (BIG_STRING_FULLSIZE_P (STRING_FULLSIZE(size)))
|
|
|
1769
|
|
454
|
1770 #define STRING_CHARS_FREE_P(ptr) ((ptr)->string == NULL)
|
|
|
1771 #define MARK_STRING_CHARS_AS_FREE(ptr) ((void) ((ptr)->string = NULL))
|
|
|
1772
|
|
428
|
1773 struct string_chars
|
|
|
1774 {
|
|
438
|
1775 Lisp_String *string;
|
|
428
|
1776 unsigned char chars[1];
|
|
|
1777 };
|
|
|
1778
|
|
|
1779 struct unused_string_chars
|
|
|
1780 {
|
|
438
|
1781 Lisp_String *string;
|
|
428
|
1782 EMACS_INT fullsize;
|
|
|
1783 };
|
|
|
1784
|
|
|
1785 static void
|
|
|
1786 init_string_chars_alloc (void)
|
|
|
1787 {
|
|
|
1788 first_string_chars_block = xnew (struct string_chars_block);
|
|
|
1789 first_string_chars_block->prev = 0;
|
|
|
1790 first_string_chars_block->next = 0;
|
|
|
1791 first_string_chars_block->pos = 0;
|
|
|
1792 current_string_chars_block = first_string_chars_block;
|
|
|
1793 }
|
|
|
1794
|
|
|
1795 static struct string_chars *
|
|
438
|
1796 allocate_string_chars_struct (Lisp_String *string_it_goes_with,
|
|
428
|
1797 EMACS_INT fullsize)
|
|
|
1798 {
|
|
|
1799 struct string_chars *s_chars;
|
|
|
1800
|
|
438
|
1801 if (fullsize <=
|
|
|
1802 (countof (current_string_chars_block->string_chars)
|
|
|
1803 - current_string_chars_block->pos))
|
|
428
|
1804 {
|
|
|
1805 /* This string can fit in the current string chars block */
|
|
|
1806 s_chars = (struct string_chars *)
|
|
|
1807 (current_string_chars_block->string_chars
|
|
|
1808 + current_string_chars_block->pos);
|
|
|
1809 current_string_chars_block->pos += fullsize;
|
|
|
1810 }
|
|
|
1811 else
|
|
|
1812 {
|
|
|
1813 /* Make a new current string chars block */
|
|
|
1814 struct string_chars_block *new_scb = xnew (struct string_chars_block);
|
|
|
1815
|
|
|
1816 current_string_chars_block->next = new_scb;
|
|
|
1817 new_scb->prev = current_string_chars_block;
|
|
|
1818 new_scb->next = 0;
|
|
|
1819 current_string_chars_block = new_scb;
|
|
|
1820 new_scb->pos = fullsize;
|
|
|
1821 s_chars = (struct string_chars *)
|
|
|
1822 current_string_chars_block->string_chars;
|
|
|
1823 }
|
|
|
1824
|
|
|
1825 s_chars->string = string_it_goes_with;
|
|
|
1826
|
|
|
1827 INCREMENT_CONS_COUNTER (fullsize, "string chars");
|
|
|
1828
|
|
|
1829 return s_chars;
|
|
|
1830 }
|
|
|
1831
|
|
|
1832 Lisp_Object
|
|
|
1833 make_uninit_string (Bytecount length)
|
|
|
1834 {
|
|
438
|
1835 Lisp_String *s;
|
|
428
|
1836 EMACS_INT fullsize = STRING_FULLSIZE (length);
|
|
|
1837 Lisp_Object val;
|
|
|
1838
|
|
438
|
1839 assert (length >= 0 && fullsize > 0);
|
|
428
|
1840
|
|
|
1841 /* Allocate the string header */
|
|
438
|
1842 ALLOCATE_FIXED_TYPE (string, Lisp_String, s);
|
|
442
|
1843 set_lheader_implementation (&s->lheader, &lrecord_string);
|
|
428
|
1844
|
|
438
|
1845 set_string_data (s, BIG_STRING_FULLSIZE_P (fullsize)
|
|
|
1846 ? xnew_array (Bufbyte, length + 1)
|
|
|
1847 : allocate_string_chars_struct (s, fullsize)->chars);
|
|
|
1848
|
|
428
|
1849 set_string_length (s, length);
|
|
|
1850 s->plist = Qnil;
|
|
|
1851
|
|
|
1852 set_string_byte (s, length, 0);
|
|
|
1853
|
|
|
1854 XSETSTRING (val, s);
|
|
|
1855 return val;
|
|
|
1856 }
|
|
|
1857
|
|
|
1858 #ifdef VERIFY_STRING_CHARS_INTEGRITY
|
|
|
1859 static void verify_string_chars_integrity (void);
|
|
|
1860 #endif
|
|
|
1861
|
|
|
1862 /* Resize the string S so that DELTA bytes can be inserted starting
|
|
|
1863 at POS. If DELTA < 0, it means deletion starting at POS. If
|
|
|
1864 POS < 0, resize the string but don't copy any characters. Use
|
|
|
1865 this if you're planning on completely overwriting the string.
|
|
|
1866 */
|
|
|
1867
|
|
|
1868 void
|
|
438
|
1869 resize_string (Lisp_String *s, Bytecount pos, Bytecount delta)
|
|
428
|
1870 {
|
|
438
|
1871 Bytecount oldfullsize, newfullsize;
|
|
428
|
1872 #ifdef VERIFY_STRING_CHARS_INTEGRITY
|
|
|
1873 verify_string_chars_integrity ();
|
|
|
1874 #endif
|
|
|
1875
|
|
|
1876 #ifdef ERROR_CHECK_BUFPOS
|
|
|
1877 if (pos >= 0)
|
|
|
1878 {
|
|
|
1879 assert (pos <= string_length (s));
|
|
|
1880 if (delta < 0)
|
|
|
1881 assert (pos + (-delta) <= string_length (s));
|
|
|
1882 }
|
|
|
1883 else
|
|
|
1884 {
|
|
|
1885 if (delta < 0)
|
|
|
1886 assert ((-delta) <= string_length (s));
|
|
|
1887 }
|
|
|
1888 #endif /* ERROR_CHECK_BUFPOS */
|
|
|
1889
|
|
|
1890 if (delta == 0)
|
|
|
1891 /* simplest case: no size change. */
|
|
|
1892 return;
|
|
438
|
1893
|
|
|
1894 if (pos >= 0 && delta < 0)
|
|
|
1895 /* If DELTA < 0, the functions below will delete the characters
|
|
|
1896 before POS. We want to delete characters *after* POS, however,
|
|
|
1897 so convert this to the appropriate form. */
|
|
|
1898 pos += -delta;
|
|
|
1899
|
|
|
1900 oldfullsize = STRING_FULLSIZE (string_length (s));
|
|
|
1901 newfullsize = STRING_FULLSIZE (string_length (s) + delta);
|
|
|
1902
|
|
|
1903 if (BIG_STRING_FULLSIZE_P (oldfullsize))
|
|
428
|
1904 {
|
|
438
|
1905 if (BIG_STRING_FULLSIZE_P (newfullsize))
|
|
428
|
1906 {
|
|
440
|
1907 /* Both strings are big. We can just realloc().
|
|
|
1908 But careful! If the string is shrinking, we have to
|
|
|
1909 memmove() _before_ realloc(), and if growing, we have to
|
|
|
1910 memmove() _after_ realloc() - otherwise the access is
|
|
|
1911 illegal, and we might crash. */
|
|
|
1912 Bytecount len = string_length (s) + 1 - pos;
|
|
|
1913
|
|
|
1914 if (delta < 0 && pos >= 0)
|
|
|
1915 memmove (string_data (s) + pos + delta, string_data (s) + pos, len);
|
|
438
|
1916 set_string_data (s, (Bufbyte *) xrealloc (string_data (s),
|
|
|
1917 string_length (s) + delta + 1));
|
|
440
|
1918 if (delta > 0 && pos >= 0)
|
|
|
1919 memmove (string_data (s) + pos + delta, string_data (s) + pos, len);
|
|
428
|
1920 }
|
|
438
|
1921 else /* String has been demoted from BIG_STRING. */
|
|
428
|
1922 {
|
|
438
|
1923 Bufbyte *new_data =
|
|
|
1924 allocate_string_chars_struct (s, newfullsize)->chars;
|
|
|
1925 Bufbyte *old_data = string_data (s);
|
|
|
1926
|
|
|
1927 if (pos >= 0)
|
|
|
1928 {
|
|
|
1929 memcpy (new_data, old_data, pos);
|
|
|
1930 memcpy (new_data + pos + delta, old_data + pos,
|
|
|
1931 string_length (s) + 1 - pos);
|
|
|
1932 }
|
|
|
1933 set_string_data (s, new_data);
|
|
|
1934 xfree (old_data);
|
|
|
1935 }
|
|
|
1936 }
|
|
|
1937 else /* old string is small */
|
|
|
1938 {
|
|
|
1939 if (oldfullsize == newfullsize)
|
|
|
1940 {
|
|
|
1941 /* special case; size change but the necessary
|
|
|
1942 allocation size won't change (up or down; code
|
|
|
1943 somewhere depends on there not being any unused
|
|
|
1944 allocation space, modulo any alignment
|
|
|
1945 constraints). */
|
|
428
|
1946 if (pos >= 0)
|
|
|
1947 {
|
|
|
1948 Bufbyte *addroff = pos + string_data (s);
|
|
|
1949
|
|
|
1950 memmove (addroff + delta, addroff,
|
|
|
1951 /* +1 due to zero-termination. */
|
|
|
1952 string_length (s) + 1 - pos);
|
|
|
1953 }
|
|
|
1954 }
|
|
|
1955 else
|
|
|
1956 {
|
|
438
|
1957 Bufbyte *old_data = string_data (s);
|
|
|
1958 Bufbyte *new_data =
|
|
|
1959 BIG_STRING_FULLSIZE_P (newfullsize)
|
|
|
1960 ? xnew_array (Bufbyte, string_length (s) + delta + 1)
|
|
|
1961 : allocate_string_chars_struct (s, newfullsize)->chars;
|
|
|
1962
|
|
428
|
1963 if (pos >= 0)
|
|
|
1964 {
|
|
438
|
1965 memcpy (new_data, old_data, pos);
|
|
|
1966 memcpy (new_data + pos + delta, old_data + pos,
|
|
428
|
1967 string_length (s) + 1 - pos);
|
|
|
1968 }
|
|
438
|
1969 set_string_data (s, new_data);
|
|
|
1970
|
|
|
1971 {
|
|
|
1972 /* We need to mark this chunk of the string_chars_block
|
|
|
1973 as unused so that compact_string_chars() doesn't
|
|
|
1974 freak. */
|
|
|
1975 struct string_chars *old_s_chars = (struct string_chars *)
|
|
|
1976 ((char *) old_data - offsetof (struct string_chars, chars));
|
|
|
1977 /* Sanity check to make sure we aren't hosed by strange
|
|
|
1978 alignment/padding. */
|
|
|
1979 assert (old_s_chars->string == s);
|
|
454
|
1980 MARK_STRING_CHARS_AS_FREE (old_s_chars);
|
|
438
|
1981 ((struct unused_string_chars *) old_s_chars)->fullsize =
|
|
|
1982 oldfullsize;
|
|
|
1983 }
|
|
428
|
1984 }
|
|
438
|
1985 }
|
|
|
1986
|
|
|
1987 set_string_length (s, string_length (s) + delta);
|
|
|
1988 /* If pos < 0, the string won't be zero-terminated.
|
|
|
1989 Terminate now just to make sure. */
|
|
|
1990 string_data (s)[string_length (s)] = '\0';
|
|
|
1991
|
|
|
1992 if (pos >= 0)
|
|
|
1993 {
|
|
|
1994 Lisp_Object string;
|
|
|
1995
|
|
|
1996 XSETSTRING (string, s);
|
|
|
1997 /* We also have to adjust all of the extent indices after the
|
|
|
1998 place we did the change. We say "pos - 1" because
|
|
|
1999 adjust_extents() is exclusive of the starting position
|
|
|
2000 passed to it. */
|
|
|
2001 adjust_extents (string, pos - 1, string_length (s),
|
|
|
2002 delta);
|
|
428
|
2003 }
|
|
|
2004
|
|
|
2005 #ifdef VERIFY_STRING_CHARS_INTEGRITY
|
|
|
2006 verify_string_chars_integrity ();
|
|
|
2007 #endif
|
|
|
2008 }
|
|
|
2009
|
|
|
2010 #ifdef MULE
|
|
|
2011
|
|
|
2012 void
|
|
438
|
2013 set_string_char (Lisp_String *s, Charcount i, Emchar c)
|
|
428
|
2014 {
|
|
|
2015 Bufbyte newstr[MAX_EMCHAR_LEN];
|
|
|
2016 Bytecount bytoff = charcount_to_bytecount (string_data (s), i);
|
|
|
2017 Bytecount oldlen = charcount_to_bytecount (string_data (s) + bytoff, 1);
|
|
|
2018 Bytecount newlen = set_charptr_emchar (newstr, c);
|
|
|
2019
|
|
|
2020 if (oldlen != newlen)
|
|
|
2021 resize_string (s, bytoff, newlen - oldlen);
|
|
|
2022 /* Remember, string_data (s) might have changed so we can't cache it. */
|
|
|
2023 memcpy (string_data (s) + bytoff, newstr, newlen);
|
|
|
2024 }
|
|
|
2025
|
|
|
2026 #endif /* MULE */
|
|
|
2027
|
|
|
2028 DEFUN ("make-string", Fmake_string, 2, 2, 0, /*
|
|
444
|
2029 Return a new string consisting of LENGTH copies of CHARACTER.
|
|
|
2030 LENGTH must be a non-negative integer.
|
|
428
|
2031 */
|
|
444
|
2032 (length, character))
|
|
428
|
2033 {
|
|
|
2034 CHECK_NATNUM (length);
|
|
444
|
2035 CHECK_CHAR_COERCE_INT (character);
|
|
428
|
2036 {
|
|
|
2037 Bufbyte init_str[MAX_EMCHAR_LEN];
|
|
444
|
2038 int len = set_charptr_emchar (init_str, XCHAR (character));
|
|
428
|
2039 Lisp_Object val = make_uninit_string (len * XINT (length));
|
|
|
2040
|
|
|
2041 if (len == 1)
|
|
|
2042 /* Optimize the single-byte case */
|
|
444
|
2043 memset (XSTRING_DATA (val), XCHAR (character), XSTRING_LENGTH (val));
|
|
428
|
2044 else
|
|
|
2045 {
|
|
|
2046 size_t i;
|
|
|
2047 Bufbyte *ptr = XSTRING_DATA (val);
|
|
|
2048
|
|
|
2049 for (i = XINT (length); i; i--)
|
|
|
2050 {
|
|
|
2051 Bufbyte *init_ptr = init_str;
|
|
|
2052 switch (len)
|
|
|
2053 {
|
|
|
2054 case 4: *ptr++ = *init_ptr++;
|
|
|
2055 case 3: *ptr++ = *init_ptr++;
|
|
|
2056 case 2: *ptr++ = *init_ptr++;
|
|
|
2057 case 1: *ptr++ = *init_ptr++;
|
|
|
2058 }
|
|
|
2059 }
|
|
|
2060 }
|
|
|
2061 return val;
|
|
|
2062 }
|
|
|
2063 }
|
|
|
2064
|
|
|
2065 DEFUN ("string", Fstring, 0, MANY, 0, /*
|
|
|
2066 Concatenate all the argument characters and make the result a string.
|
|
|
2067 */
|
|
|
2068 (int nargs, Lisp_Object *args))
|
|
|
2069 {
|
|
|
2070 Bufbyte *storage = alloca_array (Bufbyte, nargs * MAX_EMCHAR_LEN);
|
|
|
2071 Bufbyte *p = storage;
|
|
|
2072
|
|
|
2073 for (; nargs; nargs--, args++)
|
|
|
2074 {
|
|
|
2075 Lisp_Object lisp_char = *args;
|
|
|
2076 CHECK_CHAR_COERCE_INT (lisp_char);
|
|
|
2077 p += set_charptr_emchar (p, XCHAR (lisp_char));
|
|
|
2078 }
|
|
|
2079 return make_string (storage, p - storage);
|
|
|
2080 }
|
|
|
2081
|
|
|
2082
|
|
|
2083 /* Take some raw memory, which MUST already be in internal format,
|
|
|
2084 and package it up into a Lisp string. */
|
|
|
2085 Lisp_Object
|
|
442
|
2086 make_string (const Bufbyte *contents, Bytecount length)
|
|
428
|
2087 {
|
|
|
2088 Lisp_Object val;
|
|
|
2089
|
|
|
2090 /* Make sure we find out about bad make_string's when they happen */
|
|
|
2091 #if defined (ERROR_CHECK_BUFPOS) && defined (MULE)
|
|
|
2092 bytecount_to_charcount (contents, length); /* Just for the assertions */
|
|
|
2093 #endif
|
|
|
2094
|
|
|
2095 val = make_uninit_string (length);
|
|
|
2096 memcpy (XSTRING_DATA (val), contents, length);
|
|
|
2097 return val;
|
|
|
2098 }
|
|
|
2099
|
|
|
2100 /* Take some raw memory, encoded in some external data format,
|
|
|
2101 and convert it into a Lisp string. */
|
|
|
2102 Lisp_Object
|
|
442
|
2103 make_ext_string (const Extbyte *contents, EMACS_INT length,
|
|
440
|
2104 Lisp_Object coding_system)
|
|
428
|
2105 {
|
|
440
|
2106 Lisp_Object string;
|
|
|
2107 TO_INTERNAL_FORMAT (DATA, (contents, length),
|
|
|
2108 LISP_STRING, string,
|
|
|
2109 coding_system);
|
|
|
2110 return string;
|
|
428
|
2111 }
|
|
|
2112
|
|
|
2113 Lisp_Object
|
|
442
|
2114 build_string (const char *str)
|
|
428
|
2115 {
|
|
|
2116 /* Some strlen's crash and burn if passed null. */
|
|
442
|
2117 return make_string ((const Bufbyte *) str, (str ? strlen(str) : 0));
|
|
428
|
2118 }
|
|
|
2119
|
|
|
2120 Lisp_Object
|
|
442
|
2121 build_ext_string (const char *str, Lisp_Object coding_system)
|
|
428
|
2122 {
|
|
|
2123 /* Some strlen's crash and burn if passed null. */
|
|
442
|
2124 return make_ext_string ((const Extbyte *) str, (str ? strlen(str) : 0),
|
|
440
|
2125 coding_system);
|
|
428
|
2126 }
|
|
|
2127
|
|
|
2128 Lisp_Object
|
|
442
|
2129 build_translated_string (const char *str)
|
|
428
|
2130 {
|
|
|
2131 return build_string (GETTEXT (str));
|
|
|
2132 }
|
|
|
2133
|
|
|
2134 Lisp_Object
|
|
442
|
2135 make_string_nocopy (const Bufbyte *contents, Bytecount length)
|
|
428
|
2136 {
|
|
438
|
2137 Lisp_String *s;
|
|
428
|
2138 Lisp_Object val;
|
|
|
2139
|
|
|
2140 /* Make sure we find out about bad make_string_nocopy's when they happen */
|
|
|
2141 #if defined (ERROR_CHECK_BUFPOS) && defined (MULE)
|
|
|
2142 bytecount_to_charcount (contents, length); /* Just for the assertions */
|
|
|
2143 #endif
|
|
|
2144
|
|
|
2145 /* Allocate the string header */
|
|
438
|
2146 ALLOCATE_FIXED_TYPE (string, Lisp_String, s);
|
|
442
|
2147 set_lheader_implementation (&s->lheader, &lrecord_string);
|
|
428
|
2148 SET_C_READONLY_RECORD_HEADER (&s->lheader);
|
|
|
2149 s->plist = Qnil;
|
|
|
2150 set_string_data (s, (Bufbyte *)contents);
|
|
|
2151 set_string_length (s, length);
|
|
|
2152
|
|
|
2153 XSETSTRING (val, s);
|
|
|
2154 return val;
|
|
|
2155 }
|
|
|
2156
|
|
|
2157
|
|
|
2158 /************************************************************************/
|
|
|
2159 /* lcrecord lists */
|
|
|
2160 /************************************************************************/
|
|
|
2161
|
|
|
2162 /* Lcrecord lists are used to manage the allocation of particular
|
|
|
2163 sorts of lcrecords, to avoid calling alloc_lcrecord() (and thus
|
|
|
2164 malloc() and garbage-collection junk) as much as possible.
|
|
|
2165 It is similar to the Blocktype class.
|
|
|
2166
|
|
|
2167 It works like this:
|
|
|
2168
|
|
|
2169 1) Create an lcrecord-list object using make_lcrecord_list().
|
|
|
2170 This is often done at initialization. Remember to staticpro_nodump
|
|
|
2171 this object! The arguments to make_lcrecord_list() are the
|
|
|
2172 same as would be passed to alloc_lcrecord().
|
|
|
2173 2) Instead of calling alloc_lcrecord(), call allocate_managed_lcrecord()
|
|
|
2174 and pass the lcrecord-list earlier created.
|
|
|
2175 3) When done with the lcrecord, call free_managed_lcrecord().
|
|
|
2176 The standard freeing caveats apply: ** make sure there are no
|
|
|
2177 pointers to the object anywhere! **
|
|
|
2178 4) Calling free_managed_lcrecord() is just like kissing the
|
|
|
2179 lcrecord goodbye as if it were garbage-collected. This means:
|
|
|
2180 -- the contents of the freed lcrecord are undefined, and the
|
|
|
2181 contents of something produced by allocate_managed_lcrecord()
|
|
|
2182 are undefined, just like for alloc_lcrecord().
|
|
|
2183 -- the mark method for the lcrecord's type will *NEVER* be called
|
|
|
2184 on freed lcrecords.
|
|
|
2185 -- the finalize method for the lcrecord's type will be called
|
|
|
2186 at the time that free_managed_lcrecord() is called.
|
|
|
2187
|
|
|
2188 */
|
|
|
2189
|
|
|
2190 static Lisp_Object
|
|
|
2191 mark_lcrecord_list (Lisp_Object obj)
|
|
|
2192 {
|
|
|
2193 struct lcrecord_list *list = XLCRECORD_LIST (obj);
|
|
|
2194 Lisp_Object chain = list->free;
|
|
|
2195
|
|
|
2196 while (!NILP (chain))
|
|
|
2197 {
|
|
|
2198 struct lrecord_header *lheader = XRECORD_LHEADER (chain);
|
|
|
2199 struct free_lcrecord_header *free_header =
|
|
|
2200 (struct free_lcrecord_header *) lheader;
|
|
|
2201
|
|
442
|
2202 gc_checking_assert
|
|
|
2203 (/* There should be no other pointers to the free list. */
|
|
|
2204 ! MARKED_RECORD_HEADER_P (lheader)
|
|
|
2205 &&
|
|
|
2206 /* Only lcrecords should be here. */
|
|
|
2207 ! LHEADER_IMPLEMENTATION (lheader)->basic_p
|
|
|
2208 &&
|
|
|
2209 /* Only free lcrecords should be here. */
|
|
|
2210 free_header->lcheader.free
|
|
|
2211 &&
|
|
|
2212 /* The type of the lcrecord must be right. */
|
|
|
2213 LHEADER_IMPLEMENTATION (lheader) == list->implementation
|
|
|
2214 &&
|
|
|
2215 /* So must the size. */
|
|
|
2216 (LHEADER_IMPLEMENTATION (lheader)->static_size == 0 ||
|
|
|
2217 LHEADER_IMPLEMENTATION (lheader)->static_size == list->size)
|
|
|
2218 );
|
|
428
|
2219
|
|
|
2220 MARK_RECORD_HEADER (lheader);
|
|
|
2221 chain = free_header->chain;
|
|
|
2222 }
|
|
|
2223
|
|
|
2224 return Qnil;
|
|
|
2225 }
|
|
|
2226
|
|
|
2227 DEFINE_LRECORD_IMPLEMENTATION ("lcrecord-list", lcrecord_list,
|
|
|
2228 mark_lcrecord_list, internal_object_printer,
|
|
|
2229 0, 0, 0, 0, struct lcrecord_list);
|
|
|
2230 Lisp_Object
|
|
|
2231 make_lcrecord_list (size_t size,
|
|
442
|
2232 const struct lrecord_implementation *implementation)
|
|
428
|
2233 {
|
|
|
2234 struct lcrecord_list *p = alloc_lcrecord_type (struct lcrecord_list,
|
|
|
2235 &lrecord_lcrecord_list);
|
|
|
2236 Lisp_Object val;
|
|
|
2237
|
|
|
2238 p->implementation = implementation;
|
|
|
2239 p->size = size;
|
|
|
2240 p->free = Qnil;
|
|
|
2241 XSETLCRECORD_LIST (val, p);
|
|
|
2242 return val;
|
|
|
2243 }
|
|
|
2244
|
|
|
2245 Lisp_Object
|
|
|
2246 allocate_managed_lcrecord (Lisp_Object lcrecord_list)
|
|
|
2247 {
|
|
|
2248 struct lcrecord_list *list = XLCRECORD_LIST (lcrecord_list);
|
|
|
2249 if (!NILP (list->free))
|
|
|
2250 {
|
|
|
2251 Lisp_Object val = list->free;
|
|
|
2252 struct free_lcrecord_header *free_header =
|
|
|
2253 (struct free_lcrecord_header *) XPNTR (val);
|
|
|
2254
|
|
|
2255 #ifdef ERROR_CHECK_GC
|
|
442
|
2256 struct lrecord_header *lheader = &free_header->lcheader.lheader;
|
|
428
|
2257
|
|
|
2258 /* There should be no other pointers to the free list. */
|
|
442
|
2259 assert (! MARKED_RECORD_HEADER_P (lheader));
|
|
428
|
2260 /* Only lcrecords should be here. */
|
|
442
|
2261 assert (! LHEADER_IMPLEMENTATION (lheader)->basic_p);
|
|
428
|
2262 /* Only free lcrecords should be here. */
|
|
|
2263 assert (free_header->lcheader.free);
|
|
|
2264 /* The type of the lcrecord must be right. */
|
|
442
|
2265 assert (LHEADER_IMPLEMENTATION (lheader) == list->implementation);
|
|
428
|
2266 /* So must the size. */
|
|
442
|
2267 assert (LHEADER_IMPLEMENTATION (lheader)->static_size == 0 ||
|
|
|
2268 LHEADER_IMPLEMENTATION (lheader)->static_size == list->size);
|
|
428
|
2269 #endif /* ERROR_CHECK_GC */
|
|
442
|
2270
|
|
428
|
2271 list->free = free_header->chain;
|
|
|
2272 free_header->lcheader.free = 0;
|
|
|
2273 return val;
|
|
|
2274 }
|
|
|
2275 else
|
|
|
2276 {
|
|
|
2277 Lisp_Object val;
|
|
|
2278
|
|
442
|
2279 XSETOBJ (val, alloc_lcrecord (list->size, list->implementation));
|
|
428
|
2280 return val;
|
|
|
2281 }
|
|
|
2282 }
|
|
|
2283
|
|
|
2284 void
|
|
|
2285 free_managed_lcrecord (Lisp_Object lcrecord_list, Lisp_Object lcrecord)
|
|
|
2286 {
|
|
|
2287 struct lcrecord_list *list = XLCRECORD_LIST (lcrecord_list);
|
|
|
2288 struct free_lcrecord_header *free_header =
|
|
|
2289 (struct free_lcrecord_header *) XPNTR (lcrecord);
|
|
442
|
2290 struct lrecord_header *lheader = &free_header->lcheader.lheader;
|
|
|
2291 const struct lrecord_implementation *implementation
|
|
428
|
2292 = LHEADER_IMPLEMENTATION (lheader);
|
|
|
2293
|
|
|
2294 /* Make sure the size is correct. This will catch, for example,
|
|
|
2295 putting a window configuration on the wrong free list. */
|
|
442
|
2296 gc_checking_assert ((implementation->size_in_bytes_method ?
|
|
|
2297 implementation->size_in_bytes_method (lheader) :
|
|
|
2298 implementation->static_size)
|
|
|
2299 == list->size);
|
|
428
|
2300
|
|
|
2301 if (implementation->finalizer)
|
|
|
2302 implementation->finalizer (lheader, 0);
|
|
|
2303 free_header->chain = list->free;
|
|
|
2304 free_header->lcheader.free = 1;
|
|
|
2305 list->free = lcrecord;
|
|
|
2306 }
|
|
|
2307
|
|
|
2308
|
|
|
2309
|
|
|
2310
|
|
|
2311 DEFUN ("purecopy", Fpurecopy, 1, 1, 0, /*
|
|
|
2312 Kept for compatibility, returns its argument.
|
|
|
2313 Old:
|
|
|
2314 Make a copy of OBJECT in pure storage.
|
|
|
2315 Recursively copies contents of vectors and cons cells.
|
|
|
2316 Does not copy symbols.
|
|
|
2317 */
|
|
444
|
2318 (object))
|
|
428
|
2319 {
|
|
444
|
2320 return object;
|
|
428
|
2321 }
|
|
|
2322
|
|
|
2323
|
|
|
2324 /************************************************************************/
|
|
|
2325 /* Garbage Collection */
|
|
|
2326 /************************************************************************/
|
|
|
2327
|
|
442
|
2328 /* All the built-in lisp object types are enumerated in `enum lrecord_type'.
|
|
|
2329 Additional ones may be defined by a module (none yet). We leave some
|
|
|
2330 room in `lrecord_implementations_table' for such new lisp object types. */
|
|
|
2331 const struct lrecord_implementation *lrecord_implementations_table[(unsigned int)lrecord_type_last_built_in_type + MODULE_DEFINABLE_TYPE_COUNT];
|
|
|
2332 unsigned int lrecord_type_count = (unsigned int)lrecord_type_last_built_in_type;
|
|
|
2333 /* Object marker functions are in the lrecord_implementation structure.
|
|
|
2334 But copying them to a parallel array is much more cache-friendly.
|
|
|
2335 This hack speeds up (garbage-collect) by about 5%. */
|
|
|
2336 Lisp_Object (*lrecord_markers[countof (lrecord_implementations_table)]) (Lisp_Object);
|
|
428
|
2337
|
|
|
2338 struct gcpro *gcprolist;
|
|
|
2339
|
|
452
|
2340 /* We want the staticpros relocated, but not the pointers found therein.
|
|
|
2341 Hence we use a trivial description, as for pointerless objects. */
|
|
|
2342 static const struct lrecord_description staticpro_description_1[] = {
|
|
|
2343 { XD_END }
|
|
|
2344 };
|
|
|
2345
|
|
|
2346 static const struct struct_description staticpro_description = {
|
|
|
2347 sizeof (Lisp_Object *),
|
|
|
2348 staticpro_description_1
|
|
|
2349 };
|
|
|
2350
|
|
|
2351 static const struct lrecord_description staticpros_description_1[] = {
|
|
|
2352 XD_DYNARR_DESC (Lisp_Object_ptr_dynarr, &staticpro_description),
|
|
|
2353 { XD_END }
|
|
|
2354 };
|
|
|
2355
|
|
|
2356 static const struct struct_description staticpros_description = {
|
|
|
2357 sizeof (Lisp_Object_ptr_dynarr),
|
|
|
2358 staticpros_description_1
|
|
|
2359 };
|
|
|
2360
|
|
|
2361 Lisp_Object_ptr_dynarr *staticpros;
|
|
|
2362
|
|
|
2363 /* Mark the Lisp_Object at non-heap VARADDRESS as a root object for
|
|
|
2364 garbage collection, and for dumping. */
|
|
428
|
2365 void
|
|
|
2366 staticpro (Lisp_Object *varaddress)
|
|
|
2367 {
|
|
452
|
2368 Dynarr_add (staticpros, varaddress);
|
|
|
2369 dump_add_root_object (varaddress);
|
|
428
|
2370 }
|
|
|
2371
|
|
442
|
2372
|
|
452
|
2373 Lisp_Object_ptr_dynarr *staticpros_nodump;
|
|
|
2374
|
|
|
2375 /* Mark the Lisp_Object at non-heap VARADDRESS as a root object for
|
|
|
2376 garbage collection, but not for dumping. */
|
|
428
|
2377 void
|
|
|
2378 staticpro_nodump (Lisp_Object *varaddress)
|
|
|
2379 {
|
|
452
|
2380 Dynarr_add (staticpros_nodump, varaddress);
|
|
428
|
2381 }
|
|
|
2382
|
|
442
|
2383 #ifdef ERROR_CHECK_GC
|
|
|
2384 #define GC_CHECK_LHEADER_INVARIANTS(lheader) do { \
|
|
|
2385 struct lrecord_header * GCLI_lh = (lheader); \
|
|
|
2386 assert (GCLI_lh != 0); \
|
|
|
2387 assert (GCLI_lh->type < lrecord_type_count); \
|
|
|
2388 assert (! C_READONLY_RECORD_HEADER_P (GCLI_lh) || \
|
|
|
2389 (MARKED_RECORD_HEADER_P (GCLI_lh) && \
|
|
|
2390 LISP_READONLY_RECORD_HEADER_P (GCLI_lh))); \
|
|
|
2391 } while (0)
|
|
|
2392 #else
|
|
|
2393 #define GC_CHECK_LHEADER_INVARIANTS(lheader)
|
|
|
2394 #endif
|
|
|
2395
|
|
428
|
2396
|
|
|
2397 /* Mark reference to a Lisp_Object. If the object referred to has not been
|
|
|
2398 seen yet, recursively mark all the references contained in it. */
|
|
|
2399
|
|
|
2400 void
|
|
|
2401 mark_object (Lisp_Object obj)
|
|
|
2402 {
|
|
|
2403 tail_recurse:
|
|
|
2404
|
|
|
2405 /* Checks we used to perform */
|
|
|
2406 /* if (EQ (obj, Qnull_pointer)) return; */
|
|
|
2407 /* if (!POINTER_TYPE_P (XGCTYPE (obj))) return; */
|
|
|
2408 /* if (PURIFIED (XPNTR (obj))) return; */
|
|
|
2409
|
|
|
2410 if (XTYPE (obj) == Lisp_Type_Record)
|
|
|
2411 {
|
|
|
2412 struct lrecord_header *lheader = XRECORD_LHEADER (obj);
|
|
442
|
2413
|
|
|
2414 GC_CHECK_LHEADER_INVARIANTS (lheader);
|
|
|
2415
|
|
|
2416 gc_checking_assert (LHEADER_IMPLEMENTATION (lheader)->basic_p ||
|
|
|
2417 ! ((struct lcrecord_header *) lheader)->free);
|
|
|
2418
|
|
|
2419 /* All c_readonly objects have their mark bit set,
|
|
|
2420 so that we only need to check the mark bit here. */
|
|
|
2421 if (! MARKED_RECORD_HEADER_P (lheader))
|
|
428
|
2422 {
|
|
|
2423 MARK_RECORD_HEADER (lheader);
|
|
442
|
2424
|
|
|
2425 if (RECORD_MARKER (lheader))
|
|
428
|
2426 {
|
|
442
|
2427 obj = RECORD_MARKER (lheader) (obj);
|
|
428
|
2428 if (!NILP (obj)) goto tail_recurse;
|
|
|
2429 }
|
|
|
2430 }
|
|
|
2431 }
|
|
|
2432 }
|
|
|
2433
|
|
|
2434 /* mark all of the conses in a list and mark the final cdr; but
|
|
|
2435 DO NOT mark the cars.
|
|
|
2436
|
|
|
2437 Use only for internal lists! There should never be other pointers
|
|
|
2438 to the cons cells, because if so, the cars will remain unmarked
|
|
|
2439 even when they maybe should be marked. */
|
|
|
2440 void
|
|
|
2441 mark_conses_in_list (Lisp_Object obj)
|
|
|
2442 {
|
|
|
2443 Lisp_Object rest;
|
|
|
2444
|
|
|
2445 for (rest = obj; CONSP (rest); rest = XCDR (rest))
|
|
|
2446 {
|
|
|
2447 if (CONS_MARKED_P (XCONS (rest)))
|
|
|
2448 return;
|
|
|
2449 MARK_CONS (XCONS (rest));
|
|
|
2450 }
|
|
|
2451
|
|
|
2452 mark_object (rest);
|
|
|
2453 }
|
|
|
2454
|
|
|
2455
|
|
|
2456 /* Find all structures not marked, and free them. */
|
|
|
2457
|
|
|
2458 static int gc_count_num_bit_vector_used, gc_count_bit_vector_total_size;
|
|
|
2459 static int gc_count_bit_vector_storage;
|
|
|
2460 static int gc_count_num_short_string_in_use;
|
|
|
2461 static int gc_count_string_total_size;
|
|
|
2462 static int gc_count_short_string_total_size;
|
|
|
2463
|
|
|
2464 /* static int gc_count_total_records_used, gc_count_records_total_size; */
|
|
|
2465
|
|
|
2466
|
|
|
2467 /* stats on lcrecords in use - kinda kludgy */
|
|
|
2468
|
|
|
2469 static struct
|
|
|
2470 {
|
|
|
2471 int instances_in_use;
|
|
|
2472 int bytes_in_use;
|
|
|
2473 int instances_freed;
|
|
|
2474 int bytes_freed;
|
|
|
2475 int instances_on_free_list;
|
|
|
2476 } lcrecord_stats [countof (lrecord_implementations_table)];
|
|
|
2477
|
|
|
2478 static void
|
|
442
|
2479 tick_lcrecord_stats (const struct lrecord_header *h, int free_p)
|
|
428
|
2480 {
|
|
442
|
2481 unsigned int type_index = h->type;
|
|
428
|
2482
|
|
|
2483 if (((struct lcrecord_header *) h)->free)
|
|
|
2484 {
|
|
442
|
2485 gc_checking_assert (!free_p);
|
|
428
|
2486 lcrecord_stats[type_index].instances_on_free_list++;
|
|
|
2487 }
|
|
|
2488 else
|
|
|
2489 {
|
|
442
|
2490 const struct lrecord_implementation *implementation =
|
|
|
2491 LHEADER_IMPLEMENTATION (h);
|
|
|
2492
|
|
|
2493 size_t sz = (implementation->size_in_bytes_method ?
|
|
|
2494 implementation->size_in_bytes_method (h) :
|
|
|
2495 implementation->static_size);
|
|
428
|
2496 if (free_p)
|
|
|
2497 {
|
|
|
2498 lcrecord_stats[type_index].instances_freed++;
|
|
|
2499 lcrecord_stats[type_index].bytes_freed += sz;
|
|
|
2500 }
|
|
|
2501 else
|
|
|
2502 {
|
|
|
2503 lcrecord_stats[type_index].instances_in_use++;
|
|
|
2504 lcrecord_stats[type_index].bytes_in_use += sz;
|
|
|
2505 }
|
|
|
2506 }
|
|
|
2507 }
|
|
|
2508
|
|
|
2509
|
|
|
2510 /* Free all unmarked records */
|
|
|
2511 static void
|
|
|
2512 sweep_lcrecords_1 (struct lcrecord_header **prev, int *used)
|
|
|
2513 {
|
|
|
2514 struct lcrecord_header *header;
|
|
|
2515 int num_used = 0;
|
|
|
2516 /* int total_size = 0; */
|
|
|
2517
|
|
|
2518 xzero (lcrecord_stats); /* Reset all statistics to 0. */
|
|
|
2519
|
|
|
2520 /* First go through and call all the finalize methods.
|
|
|
2521 Then go through and free the objects. There used to
|
|
|
2522 be only one loop here, with the call to the finalizer
|
|
|
2523 occurring directly before the xfree() below. That
|
|
|
2524 is marginally faster but much less safe -- if the
|
|
|
2525 finalize method for an object needs to reference any
|
|
|
2526 other objects contained within it (and many do),
|
|
|
2527 we could easily be screwed by having already freed that
|
|
|
2528 other object. */
|
|
|
2529
|
|
|
2530 for (header = *prev; header; header = header->next)
|
|
|
2531 {
|
|
|
2532 struct lrecord_header *h = &(header->lheader);
|
|
442
|
2533
|
|
|
2534 GC_CHECK_LHEADER_INVARIANTS (h);
|
|
|
2535
|
|
|
2536 if (! MARKED_RECORD_HEADER_P (h) && ! header->free)
|
|
428
|
2537 {
|
|
|
2538 if (LHEADER_IMPLEMENTATION (h)->finalizer)
|
|
|
2539 LHEADER_IMPLEMENTATION (h)->finalizer (h, 0);
|
|
|
2540 }
|
|
|
2541 }
|
|
|
2542
|
|
|
2543 for (header = *prev; header; )
|
|
|
2544 {
|
|
|
2545 struct lrecord_header *h = &(header->lheader);
|
|
442
|
2546 if (MARKED_RECORD_HEADER_P (h))
|
|
428
|
2547 {
|
|
442
|
2548 if (! C_READONLY_RECORD_HEADER_P (h))
|
|
428
|
2549 UNMARK_RECORD_HEADER (h);
|
|
|
2550 num_used++;
|
|
|
2551 /* total_size += n->implementation->size_in_bytes (h);*/
|
|
440
|
2552 /* #### May modify header->next on a C_READONLY lcrecord */
|
|
428
|
2553 prev = &(header->next);
|
|
|
2554 header = *prev;
|
|
|
2555 tick_lcrecord_stats (h, 0);
|
|
|
2556 }
|
|
|
2557 else
|
|
|
2558 {
|
|
|
2559 struct lcrecord_header *next = header->next;
|
|
|
2560 *prev = next;
|
|
|
2561 tick_lcrecord_stats (h, 1);
|
|
|
2562 /* used to call finalizer right here. */
|
|
|
2563 xfree (header);
|
|
|
2564 header = next;
|
|
|
2565 }
|
|
|
2566 }
|
|
|
2567 *used = num_used;
|
|
|
2568 /* *total = total_size; */
|
|
|
2569 }
|
|
|
2570
|
|
|
2571
|
|
|
2572 static void
|
|
|
2573 sweep_bit_vectors_1 (Lisp_Object *prev,
|
|
|
2574 int *used, int *total, int *storage)
|
|
|
2575 {
|
|
|
2576 Lisp_Object bit_vector;
|
|
|
2577 int num_used = 0;
|
|
|
2578 int total_size = 0;
|
|
|
2579 int total_storage = 0;
|
|
|
2580
|
|
|
2581 /* BIT_VECTORP fails because the objects are marked, which changes
|
|
|
2582 their implementation */
|
|
|
2583 for (bit_vector = *prev; !EQ (bit_vector, Qzero); )
|
|
|
2584 {
|
|
|
2585 Lisp_Bit_Vector *v = XBIT_VECTOR (bit_vector);
|
|
|
2586 int len = v->size;
|
|
442
|
2587 if (MARKED_RECORD_P (bit_vector))
|
|
428
|
2588 {
|
|
442
|
2589 if (! C_READONLY_RECORD_HEADER_P(&(v->lheader)))
|
|
428
|
2590 UNMARK_RECORD_HEADER (&(v->lheader));
|
|
|
2591 total_size += len;
|
|
|
2592 total_storage +=
|
|
|
2593 MALLOC_OVERHEAD +
|
|
456
|
2594 FLEXIBLE_ARRAY_STRUCT_SIZEOF (Lisp_Bit_Vector, unsigned long,
|
|
|
2595 bits, BIT_VECTOR_LONG_STORAGE (len));
|
|
428
|
2596 num_used++;
|
|
440
|
2597 /* #### May modify next on a C_READONLY bitvector */
|
|
428
|
2598 prev = &(bit_vector_next (v));
|
|
|
2599 bit_vector = *prev;
|
|
|
2600 }
|
|
|
2601 else
|
|
|
2602 {
|
|
|
2603 Lisp_Object next = bit_vector_next (v);
|
|
|
2604 *prev = next;
|
|
|
2605 xfree (v);
|
|
|
2606 bit_vector = next;
|
|
|
2607 }
|
|
|
2608 }
|
|
|
2609 *used = num_used;
|
|
|
2610 *total = total_size;
|
|
|
2611 *storage = total_storage;
|
|
|
2612 }
|
|
|
2613
|
|
|
2614 /* And the Lord said: Thou shalt use the `c-backslash-region' command
|
|
|
2615 to make macros prettier. */
|
|
|
2616
|
|
|
2617 #ifdef ERROR_CHECK_GC
|
|
|
2618
|
|
|
2619 #define SWEEP_FIXED_TYPE_BLOCK(typename, obj_type) \
|
|
|
2620 do { \
|
|
|
2621 struct typename##_block *SFTB_current; \
|
|
|
2622 int SFTB_limit; \
|
|
|
2623 int num_free = 0, num_used = 0; \
|
|
|
2624 \
|
|
444
|
2625 for (SFTB_current = current_##typename##_block, \
|
|
428
|
2626 SFTB_limit = current_##typename##_block_index; \
|
|
|
2627 SFTB_current; \
|
|
|
2628 ) \
|
|
|
2629 { \
|
|
|
2630 int SFTB_iii; \
|
|
|
2631 \
|
|
|
2632 for (SFTB_iii = 0; SFTB_iii < SFTB_limit; SFTB_iii++) \
|
|
|
2633 { \
|
|
|
2634 obj_type *SFTB_victim = &(SFTB_current->block[SFTB_iii]); \
|
|
|
2635 \
|
|
454
|
2636 if (LRECORD_FREE_P (SFTB_victim)) \
|
|
428
|
2637 { \
|
|
|
2638 num_free++; \
|
|
|
2639 } \
|
|
|
2640 else if (C_READONLY_RECORD_HEADER_P (&SFTB_victim->lheader)) \
|
|
|
2641 { \
|
|
|
2642 num_used++; \
|
|
|
2643 } \
|
|
442
|
2644 else if (! MARKED_RECORD_HEADER_P (&SFTB_victim->lheader)) \
|
|
428
|
2645 { \
|
|
|
2646 num_free++; \
|
|
|
2647 FREE_FIXED_TYPE (typename, obj_type, SFTB_victim); \
|
|
|
2648 } \
|
|
|
2649 else \
|
|
|
2650 { \
|
|
|
2651 num_used++; \
|
|
|
2652 UNMARK_##typename (SFTB_victim); \
|
|
|
2653 } \
|
|
|
2654 } \
|
|
|
2655 SFTB_current = SFTB_current->prev; \
|
|
|
2656 SFTB_limit = countof (current_##typename##_block->block); \
|
|
|
2657 } \
|
|
|
2658 \
|
|
|
2659 gc_count_num_##typename##_in_use = num_used; \
|
|
|
2660 gc_count_num_##typename##_freelist = num_free; \
|
|
|
2661 } while (0)
|
|
|
2662
|
|
|
2663 #else /* !ERROR_CHECK_GC */
|
|
|
2664
|
|
|
2665 #define SWEEP_FIXED_TYPE_BLOCK(typename, obj_type) \
|
|
|
2666 do { \
|
|
|
2667 struct typename##_block *SFTB_current; \
|
|
|
2668 struct typename##_block **SFTB_prev; \
|
|
|
2669 int SFTB_limit; \
|
|
|
2670 int num_free = 0, num_used = 0; \
|
|
|
2671 \
|
|
|
2672 typename##_free_list = 0; \
|
|
|
2673 \
|
|
|
2674 for (SFTB_prev = ¤t_##typename##_block, \
|
|
|
2675 SFTB_current = current_##typename##_block, \
|
|
|
2676 SFTB_limit = current_##typename##_block_index; \
|
|
|
2677 SFTB_current; \
|
|
|
2678 ) \
|
|
|
2679 { \
|
|
|
2680 int SFTB_iii; \
|
|
|
2681 int SFTB_empty = 1; \
|
|
454
|
2682 Lisp_Free *SFTB_old_free_list = typename##_free_list; \
|
|
428
|
2683 \
|
|
|
2684 for (SFTB_iii = 0; SFTB_iii < SFTB_limit; SFTB_iii++) \
|
|
|
2685 { \
|
|
|
2686 obj_type *SFTB_victim = &(SFTB_current->block[SFTB_iii]); \
|
|
|
2687 \
|
|
454
|
2688 if (LRECORD_FREE_P (SFTB_victim)) \
|
|
428
|
2689 { \
|
|
|
2690 num_free++; \
|
|
|
2691 PUT_FIXED_TYPE_ON_FREE_LIST (typename, obj_type, SFTB_victim); \
|
|
|
2692 } \
|
|
|
2693 else if (C_READONLY_RECORD_HEADER_P (&SFTB_victim->lheader)) \
|
|
|
2694 { \
|
|
|
2695 SFTB_empty = 0; \
|
|
|
2696 num_used++; \
|
|
|
2697 } \
|
|
442
|
2698 else if (! MARKED_RECORD_HEADER_P (&SFTB_victim->lheader)) \
|
|
428
|
2699 { \
|
|
|
2700 num_free++; \
|
|
|
2701 FREE_FIXED_TYPE (typename, obj_type, SFTB_victim); \
|
|
|
2702 } \
|
|
|
2703 else \
|
|
|
2704 { \
|
|
|
2705 SFTB_empty = 0; \
|
|
|
2706 num_used++; \
|
|
|
2707 UNMARK_##typename (SFTB_victim); \
|
|
|
2708 } \
|
|
|
2709 } \
|
|
|
2710 if (!SFTB_empty) \
|
|
|
2711 { \
|
|
|
2712 SFTB_prev = &(SFTB_current->prev); \
|
|
|
2713 SFTB_current = SFTB_current->prev; \
|
|
|
2714 } \
|
|
|
2715 else if (SFTB_current == current_##typename##_block \
|
|
|
2716 && !SFTB_current->prev) \
|
|
|
2717 { \
|
|
|
2718 /* No real point in freeing sole allocation block */ \
|
|
|
2719 break; \
|
|
|
2720 } \
|
|
|
2721 else \
|
|
|
2722 { \
|
|
|
2723 struct typename##_block *SFTB_victim_block = SFTB_current; \
|
|
|
2724 if (SFTB_victim_block == current_##typename##_block) \
|
|
|
2725 current_##typename##_block_index \
|
|
|
2726 = countof (current_##typename##_block->block); \
|
|
|
2727 SFTB_current = SFTB_current->prev; \
|
|
|
2728 { \
|
|
|
2729 *SFTB_prev = SFTB_current; \
|
|
|
2730 xfree (SFTB_victim_block); \
|
|
|
2731 /* Restore free list to what it was before victim was swept */ \
|
|
|
2732 typename##_free_list = SFTB_old_free_list; \
|
|
|
2733 num_free -= SFTB_limit; \
|
|
|
2734 } \
|
|
|
2735 } \
|
|
|
2736 SFTB_limit = countof (current_##typename##_block->block); \
|
|
|
2737 } \
|
|
|
2738 \
|
|
|
2739 gc_count_num_##typename##_in_use = num_used; \
|
|
|
2740 gc_count_num_##typename##_freelist = num_free; \
|
|
|
2741 } while (0)
|
|
|
2742
|
|
|
2743 #endif /* !ERROR_CHECK_GC */
|
|
|
2744
|
|
|
2745
|
|
|
2746
|
|
|
2747
|
|
|
2748 static void
|
|
|
2749 sweep_conses (void)
|
|
|
2750 {
|
|
|
2751 #define UNMARK_cons(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
2752 #define ADDITIONAL_FREE_cons(ptr)
|
|
|
2753
|
|
440
|
2754 SWEEP_FIXED_TYPE_BLOCK (cons, Lisp_Cons);
|
|
428
|
2755 }
|
|
|
2756
|
|
|
2757 /* Explicitly free a cons cell. */
|
|
|
2758 void
|
|
440
|
2759 free_cons (Lisp_Cons *ptr)
|
|
428
|
2760 {
|
|
|
2761 #ifdef ERROR_CHECK_GC
|
|
|
2762 /* If the CAR is not an int, then it will be a pointer, which will
|
|
|
2763 always be four-byte aligned. If this cons cell has already been
|
|
|
2764 placed on the free list, however, its car will probably contain
|
|
|
2765 a chain pointer to the next cons on the list, which has cleverly
|
|
|
2766 had all its 0's and 1's inverted. This allows for a quick
|
|
|
2767 check to make sure we're not freeing something already freed. */
|
|
|
2768 if (POINTER_TYPE_P (XTYPE (ptr->car)))
|
|
|
2769 ASSERT_VALID_POINTER (XPNTR (ptr->car));
|
|
|
2770 #endif /* ERROR_CHECK_GC */
|
|
|
2771
|
|
|
2772 #ifndef ALLOC_NO_POOLS
|
|
440
|
2773 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (cons, Lisp_Cons, ptr);
|
|
428
|
2774 #endif /* ALLOC_NO_POOLS */
|
|
|
2775 }
|
|
|
2776
|
|
|
2777 /* explicitly free a list. You **must make sure** that you have
|
|
|
2778 created all the cons cells that make up this list and that there
|
|
|
2779 are no pointers to any of these cons cells anywhere else. If there
|
|
|
2780 are, you will lose. */
|
|
|
2781
|
|
|
2782 void
|
|
|
2783 free_list (Lisp_Object list)
|
|
|
2784 {
|
|
|
2785 Lisp_Object rest, next;
|
|
|
2786
|
|
|
2787 for (rest = list; !NILP (rest); rest = next)
|
|
|
2788 {
|
|
|
2789 next = XCDR (rest);
|
|
|
2790 free_cons (XCONS (rest));
|
|
|
2791 }
|
|
|
2792 }
|
|
|
2793
|
|
|
2794 /* explicitly free an alist. You **must make sure** that you have
|
|
|
2795 created all the cons cells that make up this alist and that there
|
|
|
2796 are no pointers to any of these cons cells anywhere else. If there
|
|
|
2797 are, you will lose. */
|
|
|
2798
|
|
|
2799 void
|
|
|
2800 free_alist (Lisp_Object alist)
|
|
|
2801 {
|
|
|
2802 Lisp_Object rest, next;
|
|
|
2803
|
|
|
2804 for (rest = alist; !NILP (rest); rest = next)
|
|
|
2805 {
|
|
|
2806 next = XCDR (rest);
|
|
|
2807 free_cons (XCONS (XCAR (rest)));
|
|
|
2808 free_cons (XCONS (rest));
|
|
|
2809 }
|
|
|
2810 }
|
|
|
2811
|
|
|
2812 static void
|
|
|
2813 sweep_compiled_functions (void)
|
|
|
2814 {
|
|
|
2815 #define UNMARK_compiled_function(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
2816 #define ADDITIONAL_FREE_compiled_function(ptr)
|
|
|
2817
|
|
|
2818 SWEEP_FIXED_TYPE_BLOCK (compiled_function, Lisp_Compiled_Function);
|
|
|
2819 }
|
|
|
2820
|
|
|
2821
|
|
|
2822 #ifdef LISP_FLOAT_TYPE
|
|
|
2823 static void
|
|
|
2824 sweep_floats (void)
|
|
|
2825 {
|
|
|
2826 #define UNMARK_float(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
2827 #define ADDITIONAL_FREE_float(ptr)
|
|
|
2828
|
|
440
|
2829 SWEEP_FIXED_TYPE_BLOCK (float, Lisp_Float);
|
|
428
|
2830 }
|
|
|
2831 #endif /* LISP_FLOAT_TYPE */
|
|
|
2832
|
|
|
2833 static void
|
|
|
2834 sweep_symbols (void)
|
|
|
2835 {
|
|
|
2836 #define UNMARK_symbol(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
2837 #define ADDITIONAL_FREE_symbol(ptr)
|
|
|
2838
|
|
440
|
2839 SWEEP_FIXED_TYPE_BLOCK (symbol, Lisp_Symbol);
|
|
428
|
2840 }
|
|
|
2841
|
|
|
2842 static void
|
|
|
2843 sweep_extents (void)
|
|
|
2844 {
|
|
|
2845 #define UNMARK_extent(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
2846 #define ADDITIONAL_FREE_extent(ptr)
|
|
|
2847
|
|
|
2848 SWEEP_FIXED_TYPE_BLOCK (extent, struct extent);
|
|
|
2849 }
|
|
|
2850
|
|
|
2851 static void
|
|
|
2852 sweep_events (void)
|
|
|
2853 {
|
|
|
2854 #define UNMARK_event(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
2855 #define ADDITIONAL_FREE_event(ptr)
|
|
|
2856
|
|
440
|
2857 SWEEP_FIXED_TYPE_BLOCK (event, Lisp_Event);
|
|
428
|
2858 }
|
|
|
2859
|
|
|
2860 static void
|
|
|
2861 sweep_markers (void)
|
|
|
2862 {
|
|
|
2863 #define UNMARK_marker(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
|
|
|
2864 #define ADDITIONAL_FREE_marker(ptr) \
|
|
|
2865 do { Lisp_Object tem; \
|
|
|
2866 XSETMARKER (tem, ptr); \
|
|
|
2867 unchain_marker (tem); \
|
|
|
2868 } while (0)
|
|
|
2869
|
|
440
|
2870 SWEEP_FIXED_TYPE_BLOCK (marker, Lisp_Marker);
|
|
428
|
2871 }
|
|
|
2872
|
|
|
2873 /* Explicitly free a marker. */
|
|
|
2874 void
|
|
440
|
2875 free_marker (Lisp_Marker *ptr)
|
|
428
|
2876 {
|
|
|
2877 /* Perhaps this will catch freeing an already-freed marker. */
|
|
444
|
2878 gc_checking_assert (ptr->lheader.type == lrecord_type_marker);
|
|
428
|
2879
|
|
|
2880 #ifndef ALLOC_NO_POOLS
|
|
440
|
2881 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (marker, Lisp_Marker, ptr);
|
|
428
|
2882 #endif /* ALLOC_NO_POOLS */
|
|
|
2883 }
|
|
|
2884
|
|
|
2885
|
|
|
2886 #if defined (MULE) && defined (VERIFY_STRING_CHARS_INTEGRITY)
|
|
|
2887
|
|
|
2888 static void
|
|
|
2889 verify_string_chars_integrity (void)
|
|
|
2890 {
|
|
|
2891 struct string_chars_block *sb;
|
|
|
2892
|
|
|
2893 /* Scan each existing string block sequentially, string by string. */
|
|
|
2894 for (sb = first_string_chars_block; sb; sb = sb->next)
|
|
|
2895 {
|
|
|
2896 int pos = 0;
|
|
|
2897 /* POS is the index of the next string in the block. */
|
|
|
2898 while (pos < sb->pos)
|
|
|
2899 {
|
|
|
2900 struct string_chars *s_chars =
|
|
|
2901 (struct string_chars *) &(sb->string_chars[pos]);
|
|
438
|
2902 Lisp_String *string;
|
|
428
|
2903 int size;
|
|
|
2904 int fullsize;
|
|
|
2905
|
|
454
|
2906 /* If the string_chars struct is marked as free (i.e. the
|
|
|
2907 STRING pointer is NULL) then this is an unused chunk of
|
|
|
2908 string storage. (See below.) */
|
|
|
2909
|
|
|
2910 if (STRING_CHARS_FREE_P (s_chars))
|
|
428
|
2911 {
|
|
|
2912 fullsize = ((struct unused_string_chars *) s_chars)->fullsize;
|
|
|
2913 pos += fullsize;
|
|
|
2914 continue;
|
|
|
2915 }
|
|
|
2916
|
|
|
2917 string = s_chars->string;
|
|
|
2918 /* Must be 32-bit aligned. */
|
|
|
2919 assert ((((int) string) & 3) == 0);
|
|
|
2920
|
|
|
2921 size = string_length (string);
|
|
|
2922 fullsize = STRING_FULLSIZE (size);
|
|
|
2923
|
|
|
2924 assert (!BIG_STRING_FULLSIZE_P (fullsize));
|
|
|
2925 assert (string_data (string) == s_chars->chars);
|
|
|
2926 pos += fullsize;
|
|
|
2927 }
|
|
|
2928 assert (pos == sb->pos);
|
|
|
2929 }
|
|
|
2930 }
|
|
|
2931
|
|
|
2932 #endif /* MULE && ERROR_CHECK_GC */
|
|
|
2933
|
|
|
2934 /* Compactify string chars, relocating the reference to each --
|
|
|
2935 free any empty string_chars_block we see. */
|
|
|
2936 static void
|
|
|
2937 compact_string_chars (void)
|
|
|
2938 {
|
|
|
2939 struct string_chars_block *to_sb = first_string_chars_block;
|
|
|
2940 int to_pos = 0;
|
|
|
2941 struct string_chars_block *from_sb;
|
|
|
2942
|
|
|
2943 /* Scan each existing string block sequentially, string by string. */
|
|
|
2944 for (from_sb = first_string_chars_block; from_sb; from_sb = from_sb->next)
|
|
|
2945 {
|
|
|
2946 int from_pos = 0;
|
|
|
2947 /* FROM_POS is the index of the next string in the block. */
|
|
|
2948 while (from_pos < from_sb->pos)
|
|
|
2949 {
|
|
|
2950 struct string_chars *from_s_chars =
|
|
|
2951 (struct string_chars *) &(from_sb->string_chars[from_pos]);
|
|
|
2952 struct string_chars *to_s_chars;
|
|
438
|
2953 Lisp_String *string;
|
|
428
|
2954 int size;
|
|
|
2955 int fullsize;
|
|
|
2956
|
|
454
|
2957 /* If the string_chars struct is marked as free (i.e. the
|
|
|
2958 STRING pointer is NULL) then this is an unused chunk of
|
|
|
2959 string storage. This happens under Mule when a string's
|
|
|
2960 size changes in such a way that its fullsize changes.
|
|
|
2961 (Strings can change size because a different-length
|
|
|
2962 character can be substituted for another character.)
|
|
|
2963 In this case, after the bogus string pointer is the
|
|
|
2964 "fullsize" of this entry, i.e. how many bytes to skip. */
|
|
|
2965
|
|
|
2966 if (STRING_CHARS_FREE_P (from_s_chars))
|
|
428
|
2967 {
|
|
|
2968 fullsize = ((struct unused_string_chars *) from_s_chars)->fullsize;
|
|
|
2969 from_pos += fullsize;
|
|
|
2970 continue;
|
|
|
2971 }
|
|
|
2972
|
|
|
2973 string = from_s_chars->string;
|
|
454
|
2974 assert (!(LRECORD_FREE_P (string)));
|
|
428
|
2975
|
|
|
2976 size = string_length (string);
|
|
|
2977 fullsize = STRING_FULLSIZE (size);
|
|
|
2978
|
|
442
|
2979 gc_checking_assert (! BIG_STRING_FULLSIZE_P (fullsize));
|
|
428
|
2980
|
|
|
2981 /* Just skip it if it isn't marked. */
|
|
|
2982 if (! MARKED_RECORD_HEADER_P (&(string->lheader)))
|
|
|
2983 {
|
|
|
2984 from_pos += fullsize;
|
|
|
2985 continue;
|
|
|
2986 }
|
|
|
2987
|
|
|
2988 /* If it won't fit in what's left of TO_SB, close TO_SB out
|
|
|
2989 and go on to the next string_chars_block. We know that TO_SB
|
|
|
2990 cannot advance past FROM_SB here since FROM_SB is large enough
|
|
|
2991 to currently contain this string. */
|
|
|
2992 if ((to_pos + fullsize) > countof (to_sb->string_chars))
|
|
|
2993 {
|
|
|
2994 to_sb->pos = to_pos;
|
|
|
2995 to_sb = to_sb->next;
|
|
|
2996 to_pos = 0;
|
|
|
2997 }
|
|
|
2998
|
|
|
2999 /* Compute new address of this string
|
|
|
3000 and update TO_POS for the space being used. */
|
|
|
3001 to_s_chars = (struct string_chars *) &(to_sb->string_chars[to_pos]);
|
|
|
3002
|
|
|
3003 /* Copy the string_chars to the new place. */
|
|
|
3004 if (from_s_chars != to_s_chars)
|
|
|
3005 memmove (to_s_chars, from_s_chars, fullsize);
|
|
|
3006
|
|
|
3007 /* Relocate FROM_S_CHARS's reference */
|
|
|
3008 set_string_data (string, &(to_s_chars->chars[0]));
|
|
|
3009
|
|
|
3010 from_pos += fullsize;
|
|
|
3011 to_pos += fullsize;
|
|
|
3012 }
|
|
|
3013 }
|
|
|
3014
|
|
|
3015 /* Set current to the last string chars block still used and
|
|
|
3016 free any that follow. */
|
|
|
3017 {
|
|
|
3018 struct string_chars_block *victim;
|
|
|
3019
|
|
|
3020 for (victim = to_sb->next; victim; )
|
|
|
3021 {
|
|
|
3022 struct string_chars_block *next = victim->next;
|
|
|
3023 xfree (victim);
|
|
|
3024 victim = next;
|
|
|
3025 }
|
|
|
3026
|
|
|
3027 current_string_chars_block = to_sb;
|
|
|
3028 current_string_chars_block->pos = to_pos;
|
|
|
3029 current_string_chars_block->next = 0;
|
|
|
3030 }
|
|
|
3031 }
|
|
|
3032
|
|
|
3033 #if 1 /* Hack to debug missing purecopy's */
|
|
|
3034 static int debug_string_purity;
|
|
|
3035
|
|
|
3036 static void
|
|
438
|
3037 debug_string_purity_print (Lisp_String *p)
|
|
428
|
3038 {
|
|
|
3039 Charcount i;
|
|
|
3040 Charcount s = string_char_length (p);
|
|
442
|
3041 stderr_out ("\"");
|
|
428
|
3042 for (i = 0; i < s; i++)
|
|
|
3043 {
|
|
|
3044 Emchar ch = string_char (p, i);
|
|
|
3045 if (ch < 32 || ch >= 126)
|
|
|
3046 stderr_out ("\\%03o", ch);
|
|
|
3047 else if (ch == '\\' || ch == '\"')
|
|
|
3048 stderr_out ("\\%c", ch);
|
|
|
3049 else
|
|
|
3050 stderr_out ("%c", ch);
|
|
|
3051 }
|
|
|
3052 stderr_out ("\"\n");
|
|
|
3053 }
|
|
|
3054 #endif /* 1 */
|
|
|
3055
|
|
|
3056
|
|
|
3057 static void
|
|
|
3058 sweep_strings (void)
|
|
|
3059 {
|
|
|
3060 int num_small_used = 0, num_small_bytes = 0, num_bytes = 0;
|
|
|
3061 int debug = debug_string_purity;
|
|
|
3062
|
|
438
|
3063 #define UNMARK_string(ptr) do { \
|
|
|
3064 Lisp_String *p = (ptr); \
|
|
|
3065 size_t size = string_length (p); \
|
|
|
3066 UNMARK_RECORD_HEADER (&(p->lheader)); \
|
|
|
3067 num_bytes += size; \
|
|
|
3068 if (!BIG_STRING_SIZE_P (size)) \
|
|
442
|
3069 { \
|
|
|
3070 num_small_bytes += size; \
|
|
|
3071 num_small_used++; \
|
|
438
|
3072 } \
|
|
|
3073 if (debug) \
|
|
|
3074 debug_string_purity_print (p); \
|
|
|
3075 } while (0)
|
|
|
3076 #define ADDITIONAL_FREE_string(ptr) do { \
|
|
|
3077 size_t size = string_length (ptr); \
|
|
|
3078 if (BIG_STRING_SIZE_P (size)) \
|
|
|
3079 xfree (ptr->data); \
|
|
|
3080 } while (0)
|
|
|
3081
|
|
|
3082 SWEEP_FIXED_TYPE_BLOCK (string, Lisp_String);
|
|
428
|
3083
|
|
|
3084 gc_count_num_short_string_in_use = num_small_used;
|
|
|
3085 gc_count_string_total_size = num_bytes;
|
|
|
3086 gc_count_short_string_total_size = num_small_bytes;
|
|
|
3087 }
|
|
|
3088
|
|
|
3089
|
|
|
3090 /* I hate duplicating all this crap! */
|
|
|
3091 int
|
|
|
3092 marked_p (Lisp_Object obj)
|
|
|
3093 {
|
|
|
3094 /* Checks we used to perform. */
|
|
|
3095 /* if (EQ (obj, Qnull_pointer)) return 1; */
|
|
|
3096 /* if (!POINTER_TYPE_P (XGCTYPE (obj))) return 1; */
|
|
|
3097 /* if (PURIFIED (XPNTR (obj))) return 1; */
|
|
|
3098
|
|
|
3099 if (XTYPE (obj) == Lisp_Type_Record)
|
|
|
3100 {
|
|
|
3101 struct lrecord_header *lheader = XRECORD_LHEADER (obj);
|
|
442
|
3102
|
|
|
3103 GC_CHECK_LHEADER_INVARIANTS (lheader);
|
|
|
3104
|
|
|
3105 return MARKED_RECORD_HEADER_P (lheader);
|
|
428
|
3106 }
|
|
|
3107 return 1;
|
|
|
3108 }
|
|
|
3109
|
|
|
3110 static void
|
|
|
3111 gc_sweep (void)
|
|
|
3112 {
|
|
|
3113 /* Free all unmarked records. Do this at the very beginning,
|
|
|
3114 before anything else, so that the finalize methods can safely
|
|
|
3115 examine items in the objects. sweep_lcrecords_1() makes
|
|
|
3116 sure to call all the finalize methods *before* freeing anything,
|
|
|
3117 to complete the safety. */
|
|
|
3118 {
|
|
|
3119 int ignored;
|
|
|
3120 sweep_lcrecords_1 (&all_lcrecords, &ignored);
|
|
|
3121 }
|
|
|
3122
|
|
|
3123 compact_string_chars ();
|
|
|
3124
|
|
|
3125 /* Finalize methods below (called through the ADDITIONAL_FREE_foo
|
|
|
3126 macros) must be *extremely* careful to make sure they're not
|
|
|
3127 referencing freed objects. The only two existing finalize
|
|
|
3128 methods (for strings and markers) pass muster -- the string
|
|
|
3129 finalizer doesn't look at anything but its own specially-
|
|
|
3130 created block, and the marker finalizer only looks at live
|
|
|
3131 buffers (which will never be freed) and at the markers before
|
|
|
3132 and after it in the chain (which, by induction, will never be
|
|
|
3133 freed because if so, they would have already removed themselves
|
|
|
3134 from the chain). */
|
|
|
3135
|
|
|
3136 /* Put all unmarked strings on free list, free'ing the string chars
|
|
|
3137 of large unmarked strings */
|
|
|
3138 sweep_strings ();
|
|
|
3139
|
|
|
3140 /* Put all unmarked conses on free list */
|
|
|
3141 sweep_conses ();
|
|
|
3142
|
|
|
3143 /* Free all unmarked bit vectors */
|
|
|
3144 sweep_bit_vectors_1 (&all_bit_vectors,
|
|
|
3145 &gc_count_num_bit_vector_used,
|
|
|
3146 &gc_count_bit_vector_total_size,
|
|
|
3147 &gc_count_bit_vector_storage);
|
|
|
3148
|
|
|
3149 /* Free all unmarked compiled-function objects */
|
|
|
3150 sweep_compiled_functions ();
|
|
|
3151
|
|
|
3152 #ifdef LISP_FLOAT_TYPE
|
|
|
3153 /* Put all unmarked floats on free list */
|
|
|
3154 sweep_floats ();
|
|
|
3155 #endif
|
|
|
3156
|
|
|
3157 /* Put all unmarked symbols on free list */
|
|
|
3158 sweep_symbols ();
|
|
|
3159
|
|
|
3160 /* Put all unmarked extents on free list */
|
|
|
3161 sweep_extents ();
|
|
|
3162
|
|
|
3163 /* Put all unmarked markers on free list.
|
|
|
3164 Dechain each one first from the buffer into which it points. */
|
|
|
3165 sweep_markers ();
|
|
|
3166
|
|
|
3167 sweep_events ();
|
|
|
3168
|
|
|
3169 #ifdef PDUMP
|
|
442
|
3170 pdump_objects_unmark ();
|
|
428
|
3171 #endif
|
|
|
3172 }
|
|
|
3173
|
|
|
3174 /* Clearing for disksave. */
|
|
|
3175
|
|
|
3176 void
|
|
|
3177 disksave_object_finalization (void)
|
|
|
3178 {
|
|
|
3179 /* It's important that certain information from the environment not get
|
|
|
3180 dumped with the executable (pathnames, environment variables, etc.).
|
|
|
3181 To make it easier to tell when this has happened with strings(1) we
|
|
|
3182 clear some known-to-be-garbage blocks of memory, so that leftover
|
|
|
3183 results of old evaluation don't look like potential problems.
|
|
|
3184 But first we set some notable variables to nil and do one more GC,
|
|
|
3185 to turn those strings into garbage.
|
|
440
|
3186 */
|
|
428
|
3187
|
|
|
3188 /* Yeah, this list is pretty ad-hoc... */
|
|
|
3189 Vprocess_environment = Qnil;
|
|
|
3190 Vexec_directory = Qnil;
|
|
|
3191 Vdata_directory = Qnil;
|
|
|
3192 Vsite_directory = Qnil;
|
|
|
3193 Vdoc_directory = Qnil;
|
|
|
3194 Vconfigure_info_directory = Qnil;
|
|
|
3195 Vexec_path = Qnil;
|
|
|
3196 Vload_path = Qnil;
|
|
|
3197 /* Vdump_load_path = Qnil; */
|
|
|
3198 /* Release hash tables for locate_file */
|
|
|
3199 Flocate_file_clear_hashing (Qt);
|
|
|
3200 uncache_home_directory();
|
|
|
3201
|
|
|
3202 #if defined(LOADHIST) && !(defined(LOADHIST_DUMPED) || \
|
|
|
3203 defined(LOADHIST_BUILTIN))
|
|
|
3204 Vload_history = Qnil;
|
|
|
3205 #endif
|
|
|
3206 Vshell_file_name = Qnil;
|
|
|
3207
|
|
|
3208 garbage_collect_1 ();
|
|
|
3209
|
|
|
3210 /* Run the disksave finalization methods of all live objects. */
|
|
|
3211 disksave_object_finalization_1 ();
|
|
|
3212
|
|
|
3213 /* Zero out the uninitialized (really, unused) part of the containers
|
|
|
3214 for the live strings. */
|
|
|
3215 {
|
|
|
3216 struct string_chars_block *scb;
|
|
|
3217 for (scb = first_string_chars_block; scb; scb = scb->next)
|
|
|
3218 {
|
|
|
3219 int count = sizeof (scb->string_chars) - scb->pos;
|
|
|
3220
|
|
|
3221 assert (count >= 0 && count < STRING_CHARS_BLOCK_SIZE);
|
|
440
|
3222 if (count != 0)
|
|
|
3223 {
|
|
|
3224 /* from the block's fill ptr to the end */
|
|
|
3225 memset ((scb->string_chars + scb->pos), 0, count);
|
|
|
3226 }
|
|
428
|
3227 }
|
|
|
3228 }
|
|
|
3229
|
|
|
3230 /* There, that ought to be enough... */
|
|
|
3231
|
|
|
3232 }
|
|
|
3233
|
|
|
3234
|
|
|
3235 Lisp_Object
|
|
|
3236 restore_gc_inhibit (Lisp_Object val)
|
|
|
3237 {
|
|
|
3238 gc_currently_forbidden = XINT (val);
|
|
|
3239 return val;
|
|
|
3240 }
|
|
|
3241
|
|
|
3242 /* Maybe we want to use this when doing a "panic" gc after memory_full()? */
|
|
|
3243 static int gc_hooks_inhibited;
|
|
|
3244
|
|
|
3245
|
|
|
3246 void
|
|
|
3247 garbage_collect_1 (void)
|
|
|
3248 {
|
|
|
3249 #if MAX_SAVE_STACK > 0
|
|
|
3250 char stack_top_variable;
|
|
|
3251 extern char *stack_bottom;
|
|
|
3252 #endif
|
|
|
3253 struct frame *f;
|
|
|
3254 int speccount;
|
|
|
3255 int cursor_changed;
|
|
|
3256 Lisp_Object pre_gc_cursor;
|
|
|
3257 struct gcpro gcpro1;
|
|
|
3258
|
|
|
3259 if (gc_in_progress
|
|
|
3260 || gc_currently_forbidden
|
|
|
3261 || in_display
|
|
|
3262 || preparing_for_armageddon)
|
|
|
3263 return;
|
|
|
3264
|
|
|
3265 /* We used to call selected_frame() here.
|
|
|
3266
|
|
|
3267 The following functions cannot be called inside GC
|
|
|
3268 so we move to after the above tests. */
|
|
|
3269 {
|
|
|
3270 Lisp_Object frame;
|
|
|
3271 Lisp_Object device = Fselected_device (Qnil);
|
|
|
3272 if (NILP (device)) /* Could happen during startup, eg. if always_gc */
|
|
|
3273 return;
|
|
|
3274 frame = DEVICE_SELECTED_FRAME (XDEVICE (device));
|
|
|
3275 if (NILP (frame))
|
|
|
3276 signal_simple_error ("No frames exist on device", device);
|
|
|
3277 f = XFRAME (frame);
|
|
|
3278 }
|
|
|
3279
|
|
|
3280 pre_gc_cursor = Qnil;
|
|
|
3281 cursor_changed = 0;
|
|
|
3282
|
|
|
3283 GCPRO1 (pre_gc_cursor);
|
|
|
3284
|
|
|
3285 /* Very important to prevent GC during any of the following
|
|
|
3286 stuff that might run Lisp code; otherwise, we'll likely
|
|
|
3287 have infinite GC recursion. */
|
|
|
3288 speccount = specpdl_depth ();
|
|
|
3289 record_unwind_protect (restore_gc_inhibit,
|
|
|
3290 make_int (gc_currently_forbidden));
|
|
|
3291 gc_currently_forbidden = 1;
|
|
|
3292
|
|
|
3293 if (!gc_hooks_inhibited)
|
|
|
3294 run_hook_trapping_errors ("Error in pre-gc-hook", Qpre_gc_hook);
|
|
|
3295
|
|
|
3296 /* Now show the GC cursor/message. */
|
|
|
3297 if (!noninteractive)
|
|
|
3298 {
|
|
|
3299 if (FRAME_WIN_P (f))
|
|
|
3300 {
|
|
|
3301 Lisp_Object frame = make_frame (f);
|
|
|
3302 Lisp_Object cursor = glyph_image_instance (Vgc_pointer_glyph,
|
|
|
3303 FRAME_SELECTED_WINDOW (f),
|
|
|
3304 ERROR_ME_NOT, 1);
|
|
|
3305 pre_gc_cursor = f->pointer;
|
|
|
3306 if (POINTER_IMAGE_INSTANCEP (cursor)
|
|
|
3307 /* don't change if we don't know how to change back. */
|
|
|
3308 && POINTER_IMAGE_INSTANCEP (pre_gc_cursor))
|
|
|
3309 {
|
|
|
3310 cursor_changed = 1;
|
|
|
3311 Fset_frame_pointer (frame, cursor);
|
|
|
3312 }
|
|
|
3313 }
|
|
|
3314
|
|
|
3315 /* Don't print messages to the stream device. */
|
|
|
3316 if (!cursor_changed && !FRAME_STREAM_P (f))
|
|
|
3317 {
|
|
|
3318 char *msg = (STRINGP (Vgc_message)
|
|
|
3319 ? GETTEXT ((char *) XSTRING_DATA (Vgc_message))
|
|
|
3320 : 0);
|
|
|
3321 Lisp_Object args[2], whole_msg;
|
|
|
3322 args[0] = build_string (msg ? msg :
|
|
442
|
3323 GETTEXT ((const char *) gc_default_message));
|
|
428
|
3324 args[1] = build_string ("...");
|
|
|
3325 whole_msg = Fconcat (2, args);
|
|
|
3326 echo_area_message (f, (Bufbyte *) 0, whole_msg, 0, -1,
|
|
|
3327 Qgarbage_collecting);
|
|
|
3328 }
|
|
|
3329 }
|
|
|
3330
|
|
|
3331 /***** Now we actually start the garbage collection. */
|
|
|
3332
|
|
|
3333 gc_in_progress = 1;
|
|
|
3334
|
|
|
3335 gc_generation_number[0]++;
|
|
|
3336
|
|
|
3337 #if MAX_SAVE_STACK > 0
|
|
|
3338
|
|
|
3339 /* Save a copy of the contents of the stack, for debugging. */
|
|
|
3340 if (!purify_flag)
|
|
|
3341 {
|
|
|
3342 /* Static buffer in which we save a copy of the C stack at each GC. */
|
|
|
3343 static char *stack_copy;
|
|
|
3344 static size_t stack_copy_size;
|
|
|
3345
|
|
|
3346 ptrdiff_t stack_diff = &stack_top_variable - stack_bottom;
|
|
|
3347 size_t stack_size = (stack_diff > 0 ? stack_diff : -stack_diff);
|
|
|
3348 if (stack_size < MAX_SAVE_STACK)
|
|
|
3349 {
|
|
|
3350 if (stack_copy_size < stack_size)
|
|
|
3351 {
|
|
|
3352 stack_copy = (char *) xrealloc (stack_copy, stack_size);
|
|
|
3353 stack_copy_size = stack_size;
|
|
|
3354 }
|
|
|
3355
|
|
|
3356 memcpy (stack_copy,
|
|
|
3357 stack_diff > 0 ? stack_bottom : &stack_top_variable,
|
|
|
3358 stack_size);
|
|
|
3359 }
|
|
|
3360 }
|
|
|
3361 #endif /* MAX_SAVE_STACK > 0 */
|
|
|
3362
|
|
|
3363 /* Do some totally ad-hoc resource clearing. */
|
|
|
3364 /* #### generalize this? */
|
|
|
3365 clear_event_resource ();
|
|
|
3366 cleanup_specifiers ();
|
|
|
3367
|
|
|
3368 /* Mark all the special slots that serve as the roots of accessibility. */
|
|
|
3369
|
|
|
3370 { /* staticpro() */
|
|
452
|
3371 Lisp_Object **p = Dynarr_begin (staticpros);
|
|
|
3372 size_t count;
|
|
|
3373 for (count = Dynarr_length (staticpros); count; count--)
|
|
|
3374 mark_object (**p++);
|
|
|
3375 }
|
|
|
3376
|
|
|
3377 { /* staticpro_nodump() */
|
|
|
3378 Lisp_Object **p = Dynarr_begin (staticpros_nodump);
|
|
|
3379 size_t count;
|
|
|
3380 for (count = Dynarr_length (staticpros_nodump); count; count--)
|
|
|
3381 mark_object (**p++);
|
|
428
|
3382 }
|
|
|
3383
|
|
|
3384 { /* GCPRO() */
|
|
|
3385 struct gcpro *tail;
|
|
|
3386 int i;
|
|
|
3387 for (tail = gcprolist; tail; tail = tail->next)
|
|
|
3388 for (i = 0; i < tail->nvars; i++)
|
|
|
3389 mark_object (tail->var[i]);
|
|
|
3390 }
|
|
|
3391
|
|
|
3392 { /* specbind() */
|
|
|
3393 struct specbinding *bind;
|
|
|
3394 for (bind = specpdl; bind != specpdl_ptr; bind++)
|
|
|
3395 {
|
|
|
3396 mark_object (bind->symbol);
|
|
|
3397 mark_object (bind->old_value);
|
|
|
3398 }
|
|
|
3399 }
|
|
|
3400
|
|
|
3401 {
|
|
|
3402 struct catchtag *catch;
|
|
|
3403 for (catch = catchlist; catch; catch = catch->next)
|
|
|
3404 {
|
|
|
3405 mark_object (catch->tag);
|
|
|
3406 mark_object (catch->val);
|
|
|
3407 }
|
|
|
3408 }
|
|
|
3409
|
|
|
3410 {
|
|
|
3411 struct backtrace *backlist;
|
|
|
3412 for (backlist = backtrace_list; backlist; backlist = backlist->next)
|
|
|
3413 {
|
|
|
3414 int nargs = backlist->nargs;
|
|
|
3415 int i;
|
|
|
3416
|
|
|
3417 mark_object (*backlist->function);
|
|
452
|
3418 if (nargs < 0 /* nargs == UNEVALLED || nargs == MANY */)
|
|
428
|
3419 mark_object (backlist->args[0]);
|
|
|
3420 else
|
|
|
3421 for (i = 0; i < nargs; i++)
|
|
|
3422 mark_object (backlist->args[i]);
|
|
|
3423 }
|
|
|
3424 }
|
|
|
3425
|
|
|
3426 mark_redisplay ();
|
|
|
3427 mark_profiling_info ();
|
|
|
3428
|
|
|
3429 /* OK, now do the after-mark stuff. This is for things that
|
|
|
3430 are only marked when something else is marked (e.g. weak hash tables).
|
|
|
3431 There may be complex dependencies between such objects -- e.g.
|
|
|
3432 a weak hash table might be unmarked, but after processing a later
|
|
|
3433 weak hash table, the former one might get marked. So we have to
|
|
|
3434 iterate until nothing more gets marked. */
|
|
|
3435
|
|
|
3436 while (finish_marking_weak_hash_tables () > 0 ||
|
|
|
3437 finish_marking_weak_lists () > 0)
|
|
|
3438 ;
|
|
|
3439
|
|
|
3440 /* And prune (this needs to be called after everything else has been
|
|
|
3441 marked and before we do any sweeping). */
|
|
|
3442 /* #### this is somewhat ad-hoc and should probably be an object
|
|
|
3443 method */
|
|
|
3444 prune_weak_hash_tables ();
|
|
|
3445 prune_weak_lists ();
|
|
|
3446 prune_specifiers ();
|
|
|
3447 prune_syntax_tables ();
|
|
|
3448
|
|
|
3449 gc_sweep ();
|
|
|
3450
|
|
|
3451 consing_since_gc = 0;
|
|
|
3452 #ifndef DEBUG_XEMACS
|
|
|
3453 /* Allow you to set it really fucking low if you really want ... */
|
|
|
3454 if (gc_cons_threshold < 10000)
|
|
|
3455 gc_cons_threshold = 10000;
|
|
|
3456 #endif
|
|
|
3457
|
|
|
3458 gc_in_progress = 0;
|
|
|
3459
|
|
|
3460 /******* End of garbage collection ********/
|
|
|
3461
|
|
|
3462 run_hook_trapping_errors ("Error in post-gc-hook", Qpost_gc_hook);
|
|
|
3463
|
|
|
3464 /* Now remove the GC cursor/message */
|
|
|
3465 if (!noninteractive)
|
|
|
3466 {
|
|
|
3467 if (cursor_changed)
|
|
|
3468 Fset_frame_pointer (make_frame (f), pre_gc_cursor);
|
|
|
3469 else if (!FRAME_STREAM_P (f))
|
|
|
3470 {
|
|
|
3471 char *msg = (STRINGP (Vgc_message)
|
|
|
3472 ? GETTEXT ((char *) XSTRING_DATA (Vgc_message))
|
|
|
3473 : 0);
|
|
|
3474
|
|
|
3475 /* Show "...done" only if the echo area would otherwise be empty. */
|
|
|
3476 if (NILP (clear_echo_area (selected_frame (),
|
|
|
3477 Qgarbage_collecting, 0)))
|
|
|
3478 {
|
|
|
3479 Lisp_Object args[2], whole_msg;
|
|
|
3480 args[0] = build_string (msg ? msg :
|
|
442
|
3481 GETTEXT ((const char *)
|
|
428
|
3482 gc_default_message));
|
|
|
3483 args[1] = build_string ("... done");
|
|
|
3484 whole_msg = Fconcat (2, args);
|
|
|
3485 echo_area_message (selected_frame (), (Bufbyte *) 0,
|
|
|
3486 whole_msg, 0, -1,
|
|
|
3487 Qgarbage_collecting);
|
|
|
3488 }
|
|
|
3489 }
|
|
|
3490 }
|
|
|
3491
|
|
|
3492 /* now stop inhibiting GC */
|
|
|
3493 unbind_to (speccount, Qnil);
|
|
|
3494
|
|
|
3495 if (!breathing_space)
|
|
|
3496 {
|
|
|
3497 breathing_space = malloc (4096 - MALLOC_OVERHEAD);
|
|
|
3498 }
|
|
|
3499
|
|
|
3500 UNGCPRO;
|
|
|
3501 return;
|
|
|
3502 }
|
|
|
3503
|
|
|
3504 /* Debugging aids. */
|
|
|
3505
|
|
|
3506 static Lisp_Object
|
|
442
|
3507 gc_plist_hack (const char *name, int value, Lisp_Object tail)
|
|
428
|
3508 {
|
|
|
3509 /* C doesn't have local functions (or closures, or GC, or readable syntax,
|
|
|
3510 or portable numeric datatypes, or bit-vectors, or characters, or
|
|
|
3511 arrays, or exceptions, or ...) */
|
|
|
3512 return cons3 (intern (name), make_int (value), tail);
|
|
|
3513 }
|
|
|
3514
|
|
|
3515 #define HACK_O_MATIC(type, name, pl) do { \
|
|
|
3516 int s = 0; \
|
|
|
3517 struct type##_block *x = current_##type##_block; \
|
|
|
3518 while (x) { s += sizeof (*x) + MALLOC_OVERHEAD; x = x->prev; } \
|
|
|
3519 (pl) = gc_plist_hack ((name), s, (pl)); \
|
|
|
3520 } while (0)
|
|
|
3521
|
|
|
3522 DEFUN ("garbage-collect", Fgarbage_collect, 0, 0, "", /*
|
|
|
3523 Reclaim storage for Lisp objects no longer needed.
|
|
|
3524 Return info on amount of space in use:
|
|
|
3525 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
|
|
|
3526 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
|
|
|
3527 PLIST)
|
|
|
3528 where `PLIST' is a list of alternating keyword/value pairs providing
|
|
|
3529 more detailed information.
|
|
|
3530 Garbage collection happens automatically if you cons more than
|
|
|
3531 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
|
|
|
3532 */
|
|
|
3533 ())
|
|
|
3534 {
|
|
|
3535 Lisp_Object pl = Qnil;
|
|
|
3536 int i;
|
|
|
3537 int gc_count_vector_total_size = 0;
|
|
|
3538
|
|
|
3539 garbage_collect_1 ();
|
|
|
3540
|
|
442
|
3541 for (i = 0; i < lrecord_type_count; i++)
|
|
428
|
3542 {
|
|
|
3543 if (lcrecord_stats[i].bytes_in_use != 0
|
|
|
3544 || lcrecord_stats[i].bytes_freed != 0
|
|
|
3545 || lcrecord_stats[i].instances_on_free_list != 0)
|
|
|
3546 {
|
|
|
3547 char buf [255];
|
|
442
|
3548 const char *name = lrecord_implementations_table[i]->name;
|
|
428
|
3549 int len = strlen (name);
|
|
|
3550 /* save this for the FSFmacs-compatible part of the summary */
|
|
442
|
3551 if (i == lrecord_vector.lrecord_type_index)
|
|
428
|
3552 gc_count_vector_total_size =
|
|
|
3553 lcrecord_stats[i].bytes_in_use + lcrecord_stats[i].bytes_freed;
|
|
|
3554
|
|
|
3555 sprintf (buf, "%s-storage", name);
|
|
|
3556 pl = gc_plist_hack (buf, lcrecord_stats[i].bytes_in_use, pl);
|
|
|
3557 /* Okay, simple pluralization check for `symbol-value-varalias' */
|
|
|
3558 if (name[len-1] == 's')
|
|
|
3559 sprintf (buf, "%ses-freed", name);
|
|
|
3560 else
|
|
|
3561 sprintf (buf, "%ss-freed", name);
|
|
|
3562 if (lcrecord_stats[i].instances_freed != 0)
|
|
|
3563 pl = gc_plist_hack (buf, lcrecord_stats[i].instances_freed, pl);
|
|
|
3564 if (name[len-1] == 's')
|
|
|
3565 sprintf (buf, "%ses-on-free-list", name);
|
|
|
3566 else
|
|
|
3567 sprintf (buf, "%ss-on-free-list", name);
|
|
|
3568 if (lcrecord_stats[i].instances_on_free_list != 0)
|
|
|
3569 pl = gc_plist_hack (buf, lcrecord_stats[i].instances_on_free_list,
|
|
|
3570 pl);
|
|
|
3571 if (name[len-1] == 's')
|
|
|
3572 sprintf (buf, "%ses-used", name);
|
|
|
3573 else
|
|
|
3574 sprintf (buf, "%ss-used", name);
|
|
|
3575 pl = gc_plist_hack (buf, lcrecord_stats[i].instances_in_use, pl);
|
|
|
3576 }
|
|
|
3577 }
|
|
|
3578
|
|
|
3579 HACK_O_MATIC (extent, "extent-storage", pl);
|
|
|
3580 pl = gc_plist_hack ("extents-free", gc_count_num_extent_freelist, pl);
|
|
|
3581 pl = gc_plist_hack ("extents-used", gc_count_num_extent_in_use, pl);
|
|
|
3582 HACK_O_MATIC (event, "event-storage", pl);
|
|
|
3583 pl = gc_plist_hack ("events-free", gc_count_num_event_freelist, pl);
|
|
|
3584 pl = gc_plist_hack ("events-used", gc_count_num_event_in_use, pl);
|
|
|
3585 HACK_O_MATIC (marker, "marker-storage", pl);
|
|
|
3586 pl = gc_plist_hack ("markers-free", gc_count_num_marker_freelist, pl);
|
|
|
3587 pl = gc_plist_hack ("markers-used", gc_count_num_marker_in_use, pl);
|
|
|
3588 #ifdef LISP_FLOAT_TYPE
|
|
|
3589 HACK_O_MATIC (float, "float-storage", pl);
|
|
|
3590 pl = gc_plist_hack ("floats-free", gc_count_num_float_freelist, pl);
|
|
|
3591 pl = gc_plist_hack ("floats-used", gc_count_num_float_in_use, pl);
|
|
|
3592 #endif /* LISP_FLOAT_TYPE */
|
|
|
3593 HACK_O_MATIC (string, "string-header-storage", pl);
|
|
|
3594 pl = gc_plist_hack ("long-strings-total-length",
|
|
|
3595 gc_count_string_total_size
|
|
|
3596 - gc_count_short_string_total_size, pl);
|
|
|
3597 HACK_O_MATIC (string_chars, "short-string-storage", pl);
|
|
|
3598 pl = gc_plist_hack ("short-strings-total-length",
|
|
|
3599 gc_count_short_string_total_size, pl);
|
|
|
3600 pl = gc_plist_hack ("strings-free", gc_count_num_string_freelist, pl);
|
|
|
3601 pl = gc_plist_hack ("long-strings-used",
|
|
|
3602 gc_count_num_string_in_use
|
|
|
3603 - gc_count_num_short_string_in_use, pl);
|
|
|
3604 pl = gc_plist_hack ("short-strings-used",
|
|
|
3605 gc_count_num_short_string_in_use, pl);
|
|
|
3606
|
|
|
3607 HACK_O_MATIC (compiled_function, "compiled-function-storage", pl);
|
|
|
3608 pl = gc_plist_hack ("compiled-functions-free",
|
|
|
3609 gc_count_num_compiled_function_freelist, pl);
|
|
|
3610 pl = gc_plist_hack ("compiled-functions-used",
|
|
|
3611 gc_count_num_compiled_function_in_use, pl);
|
|
|
3612
|
|
|
3613 pl = gc_plist_hack ("bit-vector-storage", gc_count_bit_vector_storage, pl);
|
|
|
3614 pl = gc_plist_hack ("bit-vectors-total-length",
|
|
|
3615 gc_count_bit_vector_total_size, pl);
|
|
|
3616 pl = gc_plist_hack ("bit-vectors-used", gc_count_num_bit_vector_used, pl);
|
|
|
3617
|
|
|
3618 HACK_O_MATIC (symbol, "symbol-storage", pl);
|
|
|
3619 pl = gc_plist_hack ("symbols-free", gc_count_num_symbol_freelist, pl);
|
|
|
3620 pl = gc_plist_hack ("symbols-used", gc_count_num_symbol_in_use, pl);
|
|
|
3621
|
|
|
3622 HACK_O_MATIC (cons, "cons-storage", pl);
|
|
|
3623 pl = gc_plist_hack ("conses-free", gc_count_num_cons_freelist, pl);
|
|
|
3624 pl = gc_plist_hack ("conses-used", gc_count_num_cons_in_use, pl);
|
|
|
3625
|
|
|
3626 /* The things we do for backwards-compatibility */
|
|
|
3627 return
|
|
|
3628 list6 (Fcons (make_int (gc_count_num_cons_in_use),
|
|
|
3629 make_int (gc_count_num_cons_freelist)),
|
|
|
3630 Fcons (make_int (gc_count_num_symbol_in_use),
|
|
|
3631 make_int (gc_count_num_symbol_freelist)),
|
|
|
3632 Fcons (make_int (gc_count_num_marker_in_use),
|
|
|
3633 make_int (gc_count_num_marker_freelist)),
|
|
|
3634 make_int (gc_count_string_total_size),
|
|
|
3635 make_int (gc_count_vector_total_size),
|
|
|
3636 pl);
|
|
|
3637 }
|
|
|
3638 #undef HACK_O_MATIC
|
|
|
3639
|
|
|
3640 DEFUN ("consing-since-gc", Fconsing_since_gc, 0, 0, "", /*
|
|
|
3641 Return the number of bytes consed since the last garbage collection.
|
|
|
3642 \"Consed\" is a misnomer in that this actually counts allocation
|
|
|
3643 of all different kinds of objects, not just conses.
|
|
|
3644
|
|
|
3645 If this value exceeds `gc-cons-threshold', a garbage collection happens.
|
|
|
3646 */
|
|
|
3647 ())
|
|
|
3648 {
|
|
|
3649 return make_int (consing_since_gc);
|
|
|
3650 }
|
|
|
3651
|
|
440
|
3652 #if 0
|
|
444
|
3653 DEFUN ("memory-limit", Fmemory_limit, 0, 0, 0, /*
|
|
428
|
3654 Return the address of the last byte Emacs has allocated, divided by 1024.
|
|
|
3655 This may be helpful in debugging Emacs's memory usage.
|
|
|
3656 The value is divided by 1024 to make sure it will fit in a lisp integer.
|
|
|
3657 */
|
|
|
3658 ())
|
|
|
3659 {
|
|
|
3660 return make_int ((EMACS_INT) sbrk (0) / 1024);
|
|
|
3661 }
|
|
440
|
3662 #endif
|
|
428
|
3663
|
|
|
3664
|
|
|
3665 int
|
|
|
3666 object_dead_p (Lisp_Object obj)
|
|
|
3667 {
|
|
|
3668 return ((BUFFERP (obj) && !BUFFER_LIVE_P (XBUFFER (obj))) ||
|
|
|
3669 (FRAMEP (obj) && !FRAME_LIVE_P (XFRAME (obj))) ||
|
|
|
3670 (WINDOWP (obj) && !WINDOW_LIVE_P (XWINDOW (obj))) ||
|
|
|
3671 (DEVICEP (obj) && !DEVICE_LIVE_P (XDEVICE (obj))) ||
|
|
|
3672 (CONSOLEP (obj) && !CONSOLE_LIVE_P (XCONSOLE (obj))) ||
|
|
|
3673 (EVENTP (obj) && !EVENT_LIVE_P (XEVENT (obj))) ||
|
|
|
3674 (EXTENTP (obj) && !EXTENT_LIVE_P (XEXTENT (obj))));
|
|
|
3675 }
|
|
|
3676
|
|
|
3677 #ifdef MEMORY_USAGE_STATS
|
|
|
3678
|
|
|
3679 /* Attempt to determine the actual amount of space that is used for
|
|
|
3680 the block allocated starting at PTR, supposedly of size "CLAIMED_SIZE".
|
|
|
3681
|
|
|
3682 It seems that the following holds:
|
|
|
3683
|
|
|
3684 1. When using the old allocator (malloc.c):
|
|
|
3685
|
|
|
3686 -- blocks are always allocated in chunks of powers of two. For
|
|
|
3687 each block, there is an overhead of 8 bytes if rcheck is not
|
|
|
3688 defined, 20 bytes if it is defined. In other words, a
|
|
|
3689 one-byte allocation needs 8 bytes of overhead for a total of
|
|
|
3690 9 bytes, and needs to have 16 bytes of memory chunked out for
|
|
|
3691 it.
|
|
|
3692
|
|
|
3693 2. When using the new allocator (gmalloc.c):
|
|
|
3694
|
|
|
3695 -- blocks are always allocated in chunks of powers of two up
|
|
|
3696 to 4096 bytes. Larger blocks are allocated in chunks of
|
|
|
3697 an integral multiple of 4096 bytes. The minimum block
|
|
|
3698 size is 2*sizeof (void *), or 16 bytes if SUNOS_LOCALTIME_BUG
|
|
|
3699 is defined. There is no per-block overhead, but there
|
|
|
3700 is an overhead of 3*sizeof (size_t) for each 4096 bytes
|
|
|
3701 allocated.
|
|
|
3702
|
|
|
3703 3. When using the system malloc, anything goes, but they are
|
|
|
3704 generally slower and more space-efficient than the GNU
|
|
|
3705 allocators. One possibly reasonable assumption to make
|
|
|
3706 for want of better data is that sizeof (void *), or maybe
|
|
|
3707 2 * sizeof (void *), is required as overhead and that
|
|
|
3708 blocks are allocated in the minimum required size except
|
|
|
3709 that some minimum block size is imposed (e.g. 16 bytes). */
|
|
|
3710
|
|
|
3711 size_t
|
|
|
3712 malloced_storage_size (void *ptr, size_t claimed_size,
|
|
|
3713 struct overhead_stats *stats)
|
|
|
3714 {
|
|
|
3715 size_t orig_claimed_size = claimed_size;
|
|
|
3716
|
|
|
3717 #ifdef GNU_MALLOC
|
|
|
3718
|
|
|
3719 if (claimed_size < 2 * sizeof (void *))
|
|
|
3720 claimed_size = 2 * sizeof (void *);
|
|
|
3721 # ifdef SUNOS_LOCALTIME_BUG
|
|
|
3722 if (claimed_size < 16)
|
|
|
3723 claimed_size = 16;
|
|
|
3724 # endif
|
|
|
3725 if (claimed_size < 4096)
|
|
|
3726 {
|
|
|
3727 int log = 1;
|
|
|
3728
|
|
|
3729 /* compute the log base two, more or less, then use it to compute
|
|
|
3730 the block size needed. */
|
|
|
3731 claimed_size--;
|
|
|
3732 /* It's big, it's heavy, it's wood! */
|
|
|
3733 while ((claimed_size /= 2) != 0)
|
|
|
3734 ++log;
|
|
|
3735 claimed_size = 1;
|
|
|
3736 /* It's better than bad, it's good! */
|
|
|
3737 while (log > 0)
|
|
|
3738 {
|
|
|
3739 claimed_size *= 2;
|
|
|
3740 log--;
|
|
|
3741 }
|
|
|
3742 /* We have to come up with some average about the amount of
|
|
|
3743 blocks used. */
|
|
|
3744 if ((size_t) (rand () & 4095) < claimed_size)
|
|
|
3745 claimed_size += 3 * sizeof (void *);
|
|
|
3746 }
|
|
|
3747 else
|
|
|
3748 {
|
|
|
3749 claimed_size += 4095;
|
|
|
3750 claimed_size &= ~4095;
|
|
|
3751 claimed_size += (claimed_size / 4096) * 3 * sizeof (size_t);
|
|
|
3752 }
|
|
|
3753
|
|
|
3754 #elif defined (SYSTEM_MALLOC)
|
|
|
3755
|
|
|
3756 if (claimed_size < 16)
|
|
|
3757 claimed_size = 16;
|
|
|
3758 claimed_size += 2 * sizeof (void *);
|
|
|
3759
|
|
|
3760 #else /* old GNU allocator */
|
|
|
3761
|
|
|
3762 # ifdef rcheck /* #### may not be defined here */
|
|
|
3763 claimed_size += 20;
|
|
|
3764 # else
|
|
|
3765 claimed_size += 8;
|
|
|
3766 # endif
|
|
|
3767 {
|
|
|
3768 int log = 1;
|
|
|
3769
|
|
|
3770 /* compute the log base two, more or less, then use it to compute
|
|
|
3771 the block size needed. */
|
|
|
3772 claimed_size--;
|
|
|
3773 /* It's big, it's heavy, it's wood! */
|
|
|
3774 while ((claimed_size /= 2) != 0)
|
|
|
3775 ++log;
|
|
|
3776 claimed_size = 1;
|
|
|
3777 /* It's better than bad, it's good! */
|
|
|
3778 while (log > 0)
|
|
|
3779 {
|
|
|
3780 claimed_size *= 2;
|
|
|
3781 log--;
|
|
|
3782 }
|
|
|
3783 }
|
|
|
3784
|
|
|
3785 #endif /* old GNU allocator */
|
|
|
3786
|
|
|
3787 if (stats)
|
|
|
3788 {
|
|
|
3789 stats->was_requested += orig_claimed_size;
|
|
|
3790 stats->malloc_overhead += claimed_size - orig_claimed_size;
|
|
|
3791 }
|
|
|
3792 return claimed_size;
|
|
|
3793 }
|
|
|
3794
|
|
|
3795 size_t
|
|
|
3796 fixed_type_block_overhead (size_t size)
|
|
|
3797 {
|
|
|
3798 size_t per_block = TYPE_ALLOC_SIZE (cons, unsigned char);
|
|
|
3799 size_t overhead = 0;
|
|
|
3800 size_t storage_size = malloced_storage_size (0, per_block, 0);
|
|
|
3801 while (size >= per_block)
|
|
|
3802 {
|
|
|
3803 size -= per_block;
|
|
|
3804 overhead += sizeof (void *) + per_block - storage_size;
|
|
|
3805 }
|
|
|
3806 if (rand () % per_block < size)
|
|
|
3807 overhead += sizeof (void *) + per_block - storage_size;
|
|
|
3808 return overhead;
|
|
|
3809 }
|
|
|
3810
|
|
|
3811 #endif /* MEMORY_USAGE_STATS */
|
|
|
3812
|
|
|
3813
|
|
|
3814 /* Initialization */
|
|
|
3815 void
|
|
|
3816 reinit_alloc_once_early (void)
|
|
|
3817 {
|
|
|
3818 gc_generation_number[0] = 0;
|
|
|
3819 breathing_space = 0;
|
|
|
3820 XSETINT (all_bit_vectors, 0); /* Qzero may not be set yet. */
|
|
|
3821 XSETINT (Vgc_message, 0);
|
|
|
3822 all_lcrecords = 0;
|
|
|
3823 ignore_malloc_warnings = 1;
|
|
|
3824 #ifdef DOUG_LEA_MALLOC
|
|
|
3825 mallopt (M_TRIM_THRESHOLD, 128*1024); /* trim threshold */
|
|
|
3826 mallopt (M_MMAP_THRESHOLD, 64*1024); /* mmap threshold */
|
|
|
3827 #if 0 /* Moved to emacs.c */
|
|
|
3828 mallopt (M_MMAP_MAX, 64); /* max. number of mmap'ed areas */
|
|
|
3829 #endif
|
|
|
3830 #endif
|
|
|
3831 init_string_alloc ();
|
|
|
3832 init_string_chars_alloc ();
|
|
|
3833 init_cons_alloc ();
|
|
|
3834 init_symbol_alloc ();
|
|
|
3835 init_compiled_function_alloc ();
|
|
|
3836 #ifdef LISP_FLOAT_TYPE
|
|
|
3837 init_float_alloc ();
|
|
|
3838 #endif /* LISP_FLOAT_TYPE */
|
|
|
3839 init_marker_alloc ();
|
|
|
3840 init_extent_alloc ();
|
|
|
3841 init_event_alloc ();
|
|
|
3842
|
|
|
3843 ignore_malloc_warnings = 0;
|
|
|
3844
|
|
452
|
3845 if (staticpros_nodump)
|
|
|
3846 Dynarr_free (staticpros_nodump);
|
|
|
3847 staticpros_nodump = Dynarr_new2 (Lisp_Object_ptr_dynarr, Lisp_Object *);
|
|
|
3848 Dynarr_resize (staticpros_nodump, 100); /* merely a small optimization */
|
|
428
|
3849
|
|
|
3850 consing_since_gc = 0;
|
|
|
3851 #if 1
|
|
|
3852 gc_cons_threshold = 500000; /* XEmacs change */
|
|
|
3853 #else
|
|
|
3854 gc_cons_threshold = 15000; /* debugging */
|
|
|
3855 #endif
|
|
|
3856 lrecord_uid_counter = 259;
|
|
|
3857 debug_string_purity = 0;
|
|
|
3858 gcprolist = 0;
|
|
|
3859
|
|
|
3860 gc_currently_forbidden = 0;
|
|
|
3861 gc_hooks_inhibited = 0;
|
|
|
3862
|
|
|
3863 #ifdef ERROR_CHECK_TYPECHECK
|
|
|
3864 ERROR_ME.really_unlikely_name_to_have_accidentally_in_a_non_errb_structure =
|
|
|
3865 666;
|
|
|
3866 ERROR_ME_NOT.
|
|
|
3867 really_unlikely_name_to_have_accidentally_in_a_non_errb_structure = 42;
|
|
|
3868 ERROR_ME_WARN.
|
|
|
3869 really_unlikely_name_to_have_accidentally_in_a_non_errb_structure =
|
|
|
3870 3333632;
|
|
|
3871 #endif /* ERROR_CHECK_TYPECHECK */
|
|
|
3872 }
|
|
|
3873
|
|
|
3874 void
|
|
|
3875 init_alloc_once_early (void)
|
|
|
3876 {
|
|
|
3877 reinit_alloc_once_early ();
|
|
|
3878
|
|
442
|
3879 {
|
|
|
3880 int i;
|
|
|
3881 for (i = 0; i < countof (lrecord_implementations_table); i++)
|
|
|
3882 lrecord_implementations_table[i] = 0;
|
|
|
3883 }
|
|
|
3884
|
|
|
3885 INIT_LRECORD_IMPLEMENTATION (cons);
|
|
|
3886 INIT_LRECORD_IMPLEMENTATION (vector);
|
|
|
3887 INIT_LRECORD_IMPLEMENTATION (string);
|
|
|
3888 INIT_LRECORD_IMPLEMENTATION (lcrecord_list);
|
|
428
|
3889
|
|
452
|
3890 staticpros = Dynarr_new2 (Lisp_Object_ptr_dynarr, Lisp_Object *);
|
|
|
3891 Dynarr_resize (staticpros, 1410); /* merely a small optimization */
|
|
|
3892 dump_add_root_struct_ptr (&staticpros, &staticpros_description);
|
|
428
|
3893 }
|
|
|
3894
|
|
|
3895 void
|
|
|
3896 reinit_alloc (void)
|
|
|
3897 {
|
|
|
3898 gcprolist = 0;
|
|
|
3899 }
|
|
|
3900
|
|
|
3901 void
|
|
|
3902 syms_of_alloc (void)
|
|
|
3903 {
|
|
442
|
3904 DEFSYMBOL (Qpre_gc_hook);
|
|
|
3905 DEFSYMBOL (Qpost_gc_hook);
|
|
|
3906 DEFSYMBOL (Qgarbage_collecting);
|
|
428
|
3907
|
|
|
3908 DEFSUBR (Fcons);
|
|
|
3909 DEFSUBR (Flist);
|
|
|
3910 DEFSUBR (Fvector);
|
|
|
3911 DEFSUBR (Fbit_vector);
|
|
|
3912 DEFSUBR (Fmake_byte_code);
|
|
|
3913 DEFSUBR (Fmake_list);
|
|
|
3914 DEFSUBR (Fmake_vector);
|
|
|
3915 DEFSUBR (Fmake_bit_vector);
|
|
|
3916 DEFSUBR (Fmake_string);
|
|
|
3917 DEFSUBR (Fstring);
|
|
|
3918 DEFSUBR (Fmake_symbol);
|
|
|
3919 DEFSUBR (Fmake_marker);
|
|
|
3920 DEFSUBR (Fpurecopy);
|
|
|
3921 DEFSUBR (Fgarbage_collect);
|
|
440
|
3922 #if 0
|
|
428
|
3923 DEFSUBR (Fmemory_limit);
|
|
440
|
3924 #endif
|
|
428
|
3925 DEFSUBR (Fconsing_since_gc);
|
|
|
3926 }
|
|
|
3927
|
|
|
3928 void
|
|
|
3929 vars_of_alloc (void)
|
|
|
3930 {
|
|
|
3931 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold /*
|
|
|
3932 *Number of bytes of consing between garbage collections.
|
|
|
3933 \"Consing\" is a misnomer in that this actually counts allocation
|
|
|
3934 of all different kinds of objects, not just conses.
|
|
|
3935 Garbage collection can happen automatically once this many bytes have been
|
|
|
3936 allocated since the last garbage collection. All data types count.
|
|
|
3937
|
|
|
3938 Garbage collection happens automatically when `eval' or `funcall' are
|
|
|
3939 called. (Note that `funcall' is called implicitly as part of evaluation.)
|
|
|
3940 By binding this temporarily to a large number, you can effectively
|
|
|
3941 prevent garbage collection during a part of the program.
|
|
|
3942
|
|
|
3943 See also `consing-since-gc'.
|
|
|
3944 */ );
|
|
|
3945
|
|
|
3946 #ifdef DEBUG_XEMACS
|
|
|
3947 DEFVAR_INT ("debug-allocation", &debug_allocation /*
|
|
|
3948 If non-zero, print out information to stderr about all objects allocated.
|
|
|
3949 See also `debug-allocation-backtrace-length'.
|
|
|
3950 */ );
|
|
|
3951 debug_allocation = 0;
|
|
|
3952
|
|
|
3953 DEFVAR_INT ("debug-allocation-backtrace-length",
|
|
|
3954 &debug_allocation_backtrace_length /*
|
|
|
3955 Length (in stack frames) of short backtrace printed out by `debug-allocation'.
|
|
|
3956 */ );
|
|
|
3957 debug_allocation_backtrace_length = 2;
|
|
|
3958 #endif
|
|
|
3959
|
|
|
3960 DEFVAR_BOOL ("purify-flag", &purify_flag /*
|
|
|
3961 Non-nil means loading Lisp code in order to dump an executable.
|
|
|
3962 This means that certain objects should be allocated in readonly space.
|
|
|
3963 */ );
|
|
|
3964
|
|
|
3965 DEFVAR_LISP ("pre-gc-hook", &Vpre_gc_hook /*
|
|
|
3966 Function or functions to be run just before each garbage collection.
|
|
|
3967 Interrupts, garbage collection, and errors are inhibited while this hook
|
|
|
3968 runs, so be extremely careful in what you add here. In particular, avoid
|
|
|
3969 consing, and do not interact with the user.
|
|
|
3970 */ );
|
|
|
3971 Vpre_gc_hook = Qnil;
|
|
|
3972
|
|
|
3973 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook /*
|
|
|
3974 Function or functions to be run just after each garbage collection.
|
|
|
3975 Interrupts, garbage collection, and errors are inhibited while this hook
|
|
|
3976 runs, so be extremely careful in what you add here. In particular, avoid
|
|
|
3977 consing, and do not interact with the user.
|
|
|
3978 */ );
|
|
|
3979 Vpost_gc_hook = Qnil;
|
|
|
3980
|
|
|
3981 DEFVAR_LISP ("gc-message", &Vgc_message /*
|
|
|
3982 String to print to indicate that a garbage collection is in progress.
|
|
|
3983 This is printed in the echo area. If the selected frame is on a
|
|
|
3984 window system and `gc-pointer-glyph' specifies a value (i.e. a pointer
|
|
|
3985 image instance) in the domain of the selected frame, the mouse pointer
|
|
|
3986 will change instead of this message being printed.
|
|
|
3987 */ );
|
|
|
3988 Vgc_message = build_string (gc_default_message);
|
|
|
3989
|
|
|
3990 DEFVAR_LISP ("gc-pointer-glyph", &Vgc_pointer_glyph /*
|
|
|
3991 Pointer glyph used to indicate that a garbage collection is in progress.
|
|
|
3992 If the selected window is on a window system and this glyph specifies a
|
|
|
3993 value (i.e. a pointer image instance) in the domain of the selected
|
|
|
3994 window, the pointer will be changed as specified during garbage collection.
|
|
|
3995 Otherwise, a message will be printed in the echo area, as controlled
|
|
|
3996 by `gc-message'.
|
|
|
3997 */ );
|
|
|
3998 }
|
|
|
3999
|
|
|
4000 void
|
|
|
4001 complex_vars_of_alloc (void)
|
|
|
4002 {
|
|
|
4003 Vgc_pointer_glyph = Fmake_glyph_internal (Qpointer);
|
|
|
4004 }
|
