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