Commit | Line | Data |
---|---|---|
7146af97 | 1 | /* Storage allocation and gc for GNU Emacs Lisp interpreter. |
73b0cd50 | 2 | Copyright (C) 1985-1986, 1988, 1993-1995, 1997-2011 |
8cabe764 | 3 | Free Software Foundation, Inc. |
7146af97 JB |
4 | |
5 | This file is part of GNU Emacs. | |
6 | ||
9ec0b715 | 7 | GNU Emacs is free software: you can redistribute it and/or modify |
7146af97 | 8 | it under the terms of the GNU General Public License as published by |
9ec0b715 GM |
9 | the Free Software Foundation, either version 3 of the License, or |
10 | (at your option) any later version. | |
7146af97 JB |
11 | |
12 | GNU Emacs is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
9ec0b715 | 18 | along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>. */ |
7146af97 | 19 | |
18160b98 | 20 | #include <config.h> |
e9b309ac | 21 | #include <stdio.h> |
ab6780cd | 22 | #include <limits.h> /* For CHAR_BIT. */ |
d7306fe6 | 23 | #include <setjmp.h> |
92939d31 | 24 | |
4455ad75 RS |
25 | #ifdef ALLOC_DEBUG |
26 | #undef INLINE | |
27 | #endif | |
28 | ||
68c45bf0 | 29 | #include <signal.h> |
92939d31 | 30 | |
aa477689 JD |
31 | #ifdef HAVE_GTK_AND_PTHREAD |
32 | #include <pthread.h> | |
33 | #endif | |
34 | ||
7539e11f KR |
35 | /* This file is part of the core Lisp implementation, and thus must |
36 | deal with the real data structures. If the Lisp implementation is | |
37 | replaced, this file likely will not be used. */ | |
2e471eb5 | 38 | |
7539e11f | 39 | #undef HIDE_LISP_IMPLEMENTATION |
7146af97 | 40 | #include "lisp.h" |
ece93c02 | 41 | #include "process.h" |
d5e35230 | 42 | #include "intervals.h" |
4c0be5f4 | 43 | #include "puresize.h" |
7146af97 JB |
44 | #include "buffer.h" |
45 | #include "window.h" | |
2538fae4 | 46 | #include "keyboard.h" |
502b9b64 | 47 | #include "frame.h" |
9ac0d9e0 | 48 | #include "blockinput.h" |
9d80e883 | 49 | #include "character.h" |
e065a56e | 50 | #include "syssignal.h" |
4a729fd8 | 51 | #include "termhooks.h" /* For struct terminal. */ |
34400008 | 52 | #include <setjmp.h> |
e065a56e | 53 | |
6b61353c KH |
54 | /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd |
55 | memory. Can do this only if using gmalloc.c. */ | |
56 | ||
57 | #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC | |
58 | #undef GC_MALLOC_CHECK | |
59 | #endif | |
60 | ||
bf952fb6 | 61 | #include <unistd.h> |
4004364e | 62 | #ifndef HAVE_UNISTD_H |
bf952fb6 DL |
63 | extern POINTER_TYPE *sbrk (); |
64 | #endif | |
ee1eea5c | 65 | |
de7124a7 | 66 | #include <fcntl.h> |
de7124a7 | 67 | |
69666f77 | 68 | #ifdef WINDOWSNT |
f892cf9c | 69 | #include "w32.h" |
69666f77 EZ |
70 | #endif |
71 | ||
d1658221 | 72 | #ifdef DOUG_LEA_MALLOC |
2e471eb5 | 73 | |
d1658221 | 74 | #include <malloc.h> |
3e60b029 DL |
75 | /* malloc.h #defines this as size_t, at least in glibc2. */ |
76 | #ifndef __malloc_size_t | |
d1658221 | 77 | #define __malloc_size_t int |
3e60b029 | 78 | #endif |
81d492d5 | 79 | |
2e471eb5 GM |
80 | /* Specify maximum number of areas to mmap. It would be nice to use a |
81 | value that explicitly means "no limit". */ | |
82 | ||
81d492d5 RS |
83 | #define MMAP_MAX_AREAS 100000000 |
84 | ||
2e471eb5 GM |
85 | #else /* not DOUG_LEA_MALLOC */ |
86 | ||
276cbe5a RS |
87 | /* The following come from gmalloc.c. */ |
88 | ||
276cbe5a | 89 | #define __malloc_size_t size_t |
276cbe5a | 90 | extern __malloc_size_t _bytes_used; |
3e60b029 | 91 | extern __malloc_size_t __malloc_extra_blocks; |
2e471eb5 GM |
92 | |
93 | #endif /* not DOUG_LEA_MALLOC */ | |
276cbe5a | 94 | |
7bc26fdb PE |
95 | #if ! defined SYSTEM_MALLOC && ! defined SYNC_INPUT |
96 | #ifdef HAVE_GTK_AND_PTHREAD | |
aa477689 | 97 | |
f415cacd JD |
98 | /* When GTK uses the file chooser dialog, different backends can be loaded |
99 | dynamically. One such a backend is the Gnome VFS backend that gets loaded | |
100 | if you run Gnome. That backend creates several threads and also allocates | |
101 | memory with malloc. | |
102 | ||
103 | If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_* | |
104 | functions below are called from malloc, there is a chance that one | |
105 | of these threads preempts the Emacs main thread and the hook variables | |
333f1b6f | 106 | end up in an inconsistent state. So we have a mutex to prevent that (note |
f415cacd JD |
107 | that the backend handles concurrent access to malloc within its own threads |
108 | but Emacs code running in the main thread is not included in that control). | |
109 | ||
026cdede | 110 | When UNBLOCK_INPUT is called, reinvoke_input_signal may be called. If this |
f415cacd JD |
111 | happens in one of the backend threads we will have two threads that tries |
112 | to run Emacs code at once, and the code is not prepared for that. | |
113 | To prevent that, we only call BLOCK/UNBLOCK from the main thread. */ | |
114 | ||
aa477689 | 115 | static pthread_mutex_t alloc_mutex; |
aa477689 | 116 | |
959dc601 JD |
117 | #define BLOCK_INPUT_ALLOC \ |
118 | do \ | |
119 | { \ | |
120 | if (pthread_equal (pthread_self (), main_thread)) \ | |
86302e37 | 121 | BLOCK_INPUT; \ |
959dc601 JD |
122 | pthread_mutex_lock (&alloc_mutex); \ |
123 | } \ | |
aa477689 | 124 | while (0) |
959dc601 JD |
125 | #define UNBLOCK_INPUT_ALLOC \ |
126 | do \ | |
127 | { \ | |
128 | pthread_mutex_unlock (&alloc_mutex); \ | |
129 | if (pthread_equal (pthread_self (), main_thread)) \ | |
86302e37 | 130 | UNBLOCK_INPUT; \ |
959dc601 | 131 | } \ |
aa477689 JD |
132 | while (0) |
133 | ||
7bc26fdb | 134 | #else /* ! defined HAVE_GTK_AND_PTHREAD */ |
aa477689 JD |
135 | |
136 | #define BLOCK_INPUT_ALLOC BLOCK_INPUT | |
137 | #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT | |
138 | ||
7bc26fdb PE |
139 | #endif /* ! defined HAVE_GTK_AND_PTHREAD */ |
140 | #endif /* ! defined SYSTEM_MALLOC && ! defined SYNC_INPUT */ | |
aa477689 | 141 | |
2e471eb5 GM |
142 | /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer |
143 | to a struct Lisp_String. */ | |
144 | ||
7cdee936 SM |
145 | #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG) |
146 | #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG) | |
b059de99 | 147 | #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0) |
2e471eb5 | 148 | |
eab3844f PE |
149 | #define VECTOR_MARK(V) ((V)->header.size |= ARRAY_MARK_FLAG) |
150 | #define VECTOR_UNMARK(V) ((V)->header.size &= ~ARRAY_MARK_FLAG) | |
151 | #define VECTOR_MARKED_P(V) (((V)->header.size & ARRAY_MARK_FLAG) != 0) | |
3ef06d12 | 152 | |
7bc26fdb PE |
153 | /* Value is the number of bytes of S, a pointer to a struct Lisp_String. |
154 | Be careful during GC, because S->size contains the mark bit for | |
2e471eb5 GM |
155 | strings. */ |
156 | ||
3ef06d12 | 157 | #define GC_STRING_BYTES(S) (STRING_BYTES (S)) |
2e471eb5 | 158 | |
29208e82 TT |
159 | /* Global variables. */ |
160 | struct emacs_globals globals; | |
161 | ||
2e471eb5 GM |
162 | /* Number of bytes of consing done since the last gc. */ |
163 | ||
7146af97 JB |
164 | int consing_since_gc; |
165 | ||
974aae61 RS |
166 | /* Similar minimum, computed from Vgc_cons_percentage. */ |
167 | ||
168 | EMACS_INT gc_relative_threshold; | |
310ea200 | 169 | |
24d8a105 RS |
170 | /* Minimum number of bytes of consing since GC before next GC, |
171 | when memory is full. */ | |
172 | ||
173 | EMACS_INT memory_full_cons_threshold; | |
174 | ||
2e471eb5 GM |
175 | /* Nonzero during GC. */ |
176 | ||
7146af97 JB |
177 | int gc_in_progress; |
178 | ||
3de0effb RS |
179 | /* Nonzero means abort if try to GC. |
180 | This is for code which is written on the assumption that | |
181 | no GC will happen, so as to verify that assumption. */ | |
182 | ||
183 | int abort_on_gc; | |
184 | ||
34400008 GM |
185 | /* Number of live and free conses etc. */ |
186 | ||
187 | static int total_conses, total_markers, total_symbols, total_vector_size; | |
188 | static int total_free_conses, total_free_markers, total_free_symbols; | |
189 | static int total_free_floats, total_floats; | |
fd27a537 | 190 | |
2e471eb5 | 191 | /* Points to memory space allocated as "spare", to be freed if we run |
24d8a105 RS |
192 | out of memory. We keep one large block, four cons-blocks, and |
193 | two string blocks. */ | |
2e471eb5 | 194 | |
d3d47262 | 195 | static char *spare_memory[7]; |
276cbe5a | 196 | |
4e75f29d | 197 | #ifndef SYSTEM_MALLOC |
24d8a105 | 198 | /* Amount of spare memory to keep in large reserve block. */ |
2e471eb5 | 199 | |
276cbe5a | 200 | #define SPARE_MEMORY (1 << 14) |
4e75f29d | 201 | #endif |
276cbe5a RS |
202 | |
203 | /* Number of extra blocks malloc should get when it needs more core. */ | |
2e471eb5 | 204 | |
276cbe5a RS |
205 | static int malloc_hysteresis; |
206 | ||
1b8950e5 RS |
207 | /* Initialize it to a nonzero value to force it into data space |
208 | (rather than bss space). That way unexec will remap it into text | |
209 | space (pure), on some systems. We have not implemented the | |
210 | remapping on more recent systems because this is less important | |
211 | nowadays than in the days of small memories and timesharing. */ | |
2e471eb5 | 212 | |
244ed907 PE |
213 | #ifndef VIRT_ADDR_VARIES |
214 | static | |
215 | #endif | |
2c4685ee | 216 | EMACS_INT pure[(PURESIZE + sizeof (EMACS_INT) - 1) / sizeof (EMACS_INT)] = {1,}; |
7146af97 | 217 | #define PUREBEG (char *) pure |
2e471eb5 | 218 | |
9e713715 | 219 | /* Pointer to the pure area, and its size. */ |
2e471eb5 | 220 | |
9e713715 GM |
221 | static char *purebeg; |
222 | static size_t pure_size; | |
223 | ||
224 | /* Number of bytes of pure storage used before pure storage overflowed. | |
225 | If this is non-zero, this implies that an overflow occurred. */ | |
226 | ||
227 | static size_t pure_bytes_used_before_overflow; | |
7146af97 | 228 | |
34400008 GM |
229 | /* Value is non-zero if P points into pure space. */ |
230 | ||
231 | #define PURE_POINTER_P(P) \ | |
232 | (((PNTR_COMPARISON_TYPE) (P) \ | |
9e713715 | 233 | < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \ |
34400008 | 234 | && ((PNTR_COMPARISON_TYPE) (P) \ |
9e713715 | 235 | >= (PNTR_COMPARISON_TYPE) purebeg)) |
34400008 | 236 | |
e5bc14d4 YM |
237 | /* Index in pure at which next pure Lisp object will be allocated.. */ |
238 | ||
239 | static EMACS_INT pure_bytes_used_lisp; | |
240 | ||
241 | /* Number of bytes allocated for non-Lisp objects in pure storage. */ | |
242 | ||
243 | static EMACS_INT pure_bytes_used_non_lisp; | |
244 | ||
2e471eb5 GM |
245 | /* If nonzero, this is a warning delivered by malloc and not yet |
246 | displayed. */ | |
247 | ||
a8fe7202 | 248 | const char *pending_malloc_warning; |
7146af97 JB |
249 | |
250 | /* Maximum amount of C stack to save when a GC happens. */ | |
251 | ||
252 | #ifndef MAX_SAVE_STACK | |
253 | #define MAX_SAVE_STACK 16000 | |
254 | #endif | |
255 | ||
256 | /* Buffer in which we save a copy of the C stack at each GC. */ | |
257 | ||
dd3f25f7 | 258 | #if MAX_SAVE_STACK > 0 |
d3d47262 | 259 | static char *stack_copy; |
dd3f25f7 PE |
260 | static size_t stack_copy_size; |
261 | #endif | |
7146af97 | 262 | |
2e471eb5 GM |
263 | /* Non-zero means ignore malloc warnings. Set during initialization. |
264 | Currently not used. */ | |
265 | ||
d3d47262 | 266 | static int ignore_warnings; |
350273a4 | 267 | |
955cbe7b PE |
268 | static Lisp_Object Qgc_cons_threshold; |
269 | Lisp_Object Qchar_table_extra_slots; | |
e8197642 | 270 | |
9e713715 GM |
271 | /* Hook run after GC has finished. */ |
272 | ||
955cbe7b | 273 | static Lisp_Object Qpost_gc_hook; |
2c5bd608 | 274 | |
f57e2426 J |
275 | static void mark_buffer (Lisp_Object); |
276 | static void mark_terminals (void); | |
f57e2426 J |
277 | static void gc_sweep (void); |
278 | static void mark_glyph_matrix (struct glyph_matrix *); | |
279 | static void mark_face_cache (struct face_cache *); | |
41c28a37 | 280 | |
69003fd8 PE |
281 | #if !defined REL_ALLOC || defined SYSTEM_MALLOC |
282 | static void refill_memory_reserve (void); | |
283 | #endif | |
f57e2426 J |
284 | static struct Lisp_String *allocate_string (void); |
285 | static void compact_small_strings (void); | |
286 | static void free_large_strings (void); | |
287 | static void sweep_strings (void); | |
244ed907 | 288 | static void free_misc (Lisp_Object); |
34400008 | 289 | |
34400008 GM |
290 | /* When scanning the C stack for live Lisp objects, Emacs keeps track |
291 | of what memory allocated via lisp_malloc is intended for what | |
292 | purpose. This enumeration specifies the type of memory. */ | |
293 | ||
294 | enum mem_type | |
295 | { | |
296 | MEM_TYPE_NON_LISP, | |
297 | MEM_TYPE_BUFFER, | |
298 | MEM_TYPE_CONS, | |
299 | MEM_TYPE_STRING, | |
300 | MEM_TYPE_MISC, | |
301 | MEM_TYPE_SYMBOL, | |
302 | MEM_TYPE_FLOAT, | |
9c545a55 SM |
303 | /* We used to keep separate mem_types for subtypes of vectors such as |
304 | process, hash_table, frame, terminal, and window, but we never made | |
305 | use of the distinction, so it only caused source-code complexity | |
306 | and runtime slowdown. Minor but pointless. */ | |
307 | MEM_TYPE_VECTORLIKE | |
34400008 GM |
308 | }; |
309 | ||
f57e2426 J |
310 | static POINTER_TYPE *lisp_align_malloc (size_t, enum mem_type); |
311 | static POINTER_TYPE *lisp_malloc (size_t, enum mem_type); | |
225ccad6 | 312 | |
24d8a105 | 313 | |
877935b1 | 314 | #if GC_MARK_STACK || defined GC_MALLOC_CHECK |
0b378936 GM |
315 | |
316 | #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES | |
317 | #include <stdio.h> /* For fprintf. */ | |
318 | #endif | |
319 | ||
320 | /* A unique object in pure space used to make some Lisp objects | |
321 | on free lists recognizable in O(1). */ | |
322 | ||
d3d47262 | 323 | static Lisp_Object Vdead; |
0b378936 | 324 | |
877935b1 GM |
325 | #ifdef GC_MALLOC_CHECK |
326 | ||
327 | enum mem_type allocated_mem_type; | |
d3d47262 | 328 | static int dont_register_blocks; |
877935b1 GM |
329 | |
330 | #endif /* GC_MALLOC_CHECK */ | |
331 | ||
332 | /* A node in the red-black tree describing allocated memory containing | |
333 | Lisp data. Each such block is recorded with its start and end | |
334 | address when it is allocated, and removed from the tree when it | |
335 | is freed. | |
336 | ||
337 | A red-black tree is a balanced binary tree with the following | |
338 | properties: | |
339 | ||
340 | 1. Every node is either red or black. | |
341 | 2. Every leaf is black. | |
342 | 3. If a node is red, then both of its children are black. | |
343 | 4. Every simple path from a node to a descendant leaf contains | |
344 | the same number of black nodes. | |
345 | 5. The root is always black. | |
346 | ||
347 | When nodes are inserted into the tree, or deleted from the tree, | |
348 | the tree is "fixed" so that these properties are always true. | |
349 | ||
350 | A red-black tree with N internal nodes has height at most 2 | |
351 | log(N+1). Searches, insertions and deletions are done in O(log N). | |
352 | Please see a text book about data structures for a detailed | |
353 | description of red-black trees. Any book worth its salt should | |
354 | describe them. */ | |
355 | ||
356 | struct mem_node | |
357 | { | |
9f7d9210 RS |
358 | /* Children of this node. These pointers are never NULL. When there |
359 | is no child, the value is MEM_NIL, which points to a dummy node. */ | |
360 | struct mem_node *left, *right; | |
361 | ||
362 | /* The parent of this node. In the root node, this is NULL. */ | |
363 | struct mem_node *parent; | |
877935b1 GM |
364 | |
365 | /* Start and end of allocated region. */ | |
366 | void *start, *end; | |
367 | ||
368 | /* Node color. */ | |
369 | enum {MEM_BLACK, MEM_RED} color; | |
177c0ea7 | 370 | |
877935b1 GM |
371 | /* Memory type. */ |
372 | enum mem_type type; | |
373 | }; | |
374 | ||
375 | /* Base address of stack. Set in main. */ | |
376 | ||
377 | Lisp_Object *stack_base; | |
378 | ||
379 | /* Root of the tree describing allocated Lisp memory. */ | |
380 | ||
381 | static struct mem_node *mem_root; | |
382 | ||
ece93c02 GM |
383 | /* Lowest and highest known address in the heap. */ |
384 | ||
385 | static void *min_heap_address, *max_heap_address; | |
386 | ||
877935b1 GM |
387 | /* Sentinel node of the tree. */ |
388 | ||
389 | static struct mem_node mem_z; | |
390 | #define MEM_NIL &mem_z | |
391 | ||
f57e2426 J |
392 | static struct Lisp_Vector *allocate_vectorlike (EMACS_INT); |
393 | static void lisp_free (POINTER_TYPE *); | |
394 | static void mark_stack (void); | |
395 | static int live_vector_p (struct mem_node *, void *); | |
396 | static int live_buffer_p (struct mem_node *, void *); | |
397 | static int live_string_p (struct mem_node *, void *); | |
398 | static int live_cons_p (struct mem_node *, void *); | |
399 | static int live_symbol_p (struct mem_node *, void *); | |
400 | static int live_float_p (struct mem_node *, void *); | |
401 | static int live_misc_p (struct mem_node *, void *); | |
402 | static void mark_maybe_object (Lisp_Object); | |
403 | static void mark_memory (void *, void *, int); | |
404 | static void mem_init (void); | |
405 | static struct mem_node *mem_insert (void *, void *, enum mem_type); | |
406 | static void mem_insert_fixup (struct mem_node *); | |
407 | static void mem_rotate_left (struct mem_node *); | |
408 | static void mem_rotate_right (struct mem_node *); | |
409 | static void mem_delete (struct mem_node *); | |
410 | static void mem_delete_fixup (struct mem_node *); | |
411 | static INLINE struct mem_node *mem_find (void *); | |
34400008 | 412 | |
34400008 GM |
413 | |
414 | #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS | |
f57e2426 | 415 | static void check_gcpros (void); |
34400008 GM |
416 | #endif |
417 | ||
877935b1 | 418 | #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */ |
34400008 | 419 | |
1f0b3fd2 GM |
420 | /* Recording what needs to be marked for gc. */ |
421 | ||
422 | struct gcpro *gcprolist; | |
423 | ||
379b98b1 PE |
424 | /* Addresses of staticpro'd variables. Initialize it to a nonzero |
425 | value; otherwise some compilers put it into BSS. */ | |
1f0b3fd2 | 426 | |
0078170f | 427 | #define NSTATICS 0x640 |
d3d47262 | 428 | static Lisp_Object *staticvec[NSTATICS] = {&Vpurify_flag}; |
1f0b3fd2 GM |
429 | |
430 | /* Index of next unused slot in staticvec. */ | |
431 | ||
d3d47262 | 432 | static int staticidx = 0; |
1f0b3fd2 | 433 | |
f57e2426 | 434 | static POINTER_TYPE *pure_alloc (size_t, int); |
1f0b3fd2 GM |
435 | |
436 | ||
437 | /* Value is SZ rounded up to the next multiple of ALIGNMENT. | |
438 | ALIGNMENT must be a power of 2. */ | |
439 | ||
ab6780cd SM |
440 | #define ALIGN(ptr, ALIGNMENT) \ |
441 | ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \ | |
442 | & ~((ALIGNMENT) - 1))) | |
1f0b3fd2 | 443 | |
ece93c02 | 444 | |
7146af97 | 445 | \f |
34400008 GM |
446 | /************************************************************************ |
447 | Malloc | |
448 | ************************************************************************/ | |
449 | ||
4455ad75 | 450 | /* Function malloc calls this if it finds we are near exhausting storage. */ |
d457598b AS |
451 | |
452 | void | |
a8fe7202 | 453 | malloc_warning (const char *str) |
7146af97 JB |
454 | { |
455 | pending_malloc_warning = str; | |
456 | } | |
457 | ||
34400008 | 458 | |
4455ad75 | 459 | /* Display an already-pending malloc warning. */ |
34400008 | 460 | |
d457598b | 461 | void |
971de7fb | 462 | display_malloc_warning (void) |
7146af97 | 463 | { |
4455ad75 RS |
464 | call3 (intern ("display-warning"), |
465 | intern ("alloc"), | |
466 | build_string (pending_malloc_warning), | |
467 | intern ("emergency")); | |
7146af97 | 468 | pending_malloc_warning = 0; |
7146af97 | 469 | } |
49efed3a | 470 | \f |
276cbe5a RS |
471 | /* Called if we can't allocate relocatable space for a buffer. */ |
472 | ||
473 | void | |
971de7fb | 474 | buffer_memory_full (void) |
276cbe5a | 475 | { |
2e471eb5 GM |
476 | /* If buffers use the relocating allocator, no need to free |
477 | spare_memory, because we may have plenty of malloc space left | |
478 | that we could get, and if we don't, the malloc that fails will | |
479 | itself cause spare_memory to be freed. If buffers don't use the | |
480 | relocating allocator, treat this like any other failing | |
481 | malloc. */ | |
276cbe5a RS |
482 | |
483 | #ifndef REL_ALLOC | |
484 | memory_full (); | |
485 | #endif | |
486 | ||
2e471eb5 GM |
487 | /* This used to call error, but if we've run out of memory, we could |
488 | get infinite recursion trying to build the string. */ | |
9b306d37 | 489 | xsignal (Qnil, Vmemory_signal_data); |
7146af97 JB |
490 | } |
491 | ||
34400008 | 492 | |
212f33f1 KS |
493 | #ifdef XMALLOC_OVERRUN_CHECK |
494 | ||
bdbed949 KS |
495 | /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header |
496 | and a 16 byte trailer around each block. | |
497 | ||
498 | The header consists of 12 fixed bytes + a 4 byte integer contaning the | |
499 | original block size, while the trailer consists of 16 fixed bytes. | |
500 | ||
501 | The header is used to detect whether this block has been allocated | |
502 | through these functions -- as it seems that some low-level libc | |
503 | functions may bypass the malloc hooks. | |
504 | */ | |
505 | ||
506 | ||
212f33f1 | 507 | #define XMALLOC_OVERRUN_CHECK_SIZE 16 |
bdbed949 | 508 | |
212f33f1 KS |
509 | static char xmalloc_overrun_check_header[XMALLOC_OVERRUN_CHECK_SIZE-4] = |
510 | { 0x9a, 0x9b, 0xae, 0xaf, | |
511 | 0xbf, 0xbe, 0xce, 0xcf, | |
512 | 0xea, 0xeb, 0xec, 0xed }; | |
513 | ||
514 | static char xmalloc_overrun_check_trailer[XMALLOC_OVERRUN_CHECK_SIZE] = | |
515 | { 0xaa, 0xab, 0xac, 0xad, | |
516 | 0xba, 0xbb, 0xbc, 0xbd, | |
517 | 0xca, 0xcb, 0xcc, 0xcd, | |
518 | 0xda, 0xdb, 0xdc, 0xdd }; | |
519 | ||
bdbed949 KS |
520 | /* Macros to insert and extract the block size in the header. */ |
521 | ||
522 | #define XMALLOC_PUT_SIZE(ptr, size) \ | |
523 | (ptr[-1] = (size & 0xff), \ | |
524 | ptr[-2] = ((size >> 8) & 0xff), \ | |
525 | ptr[-3] = ((size >> 16) & 0xff), \ | |
526 | ptr[-4] = ((size >> 24) & 0xff)) | |
527 | ||
528 | #define XMALLOC_GET_SIZE(ptr) \ | |
529 | (size_t)((unsigned)(ptr[-1]) | \ | |
530 | ((unsigned)(ptr[-2]) << 8) | \ | |
531 | ((unsigned)(ptr[-3]) << 16) | \ | |
532 | ((unsigned)(ptr[-4]) << 24)) | |
533 | ||
534 | ||
d8f165a8 JD |
535 | /* The call depth in overrun_check functions. For example, this might happen: |
536 | xmalloc() | |
537 | overrun_check_malloc() | |
538 | -> malloc -> (via hook)_-> emacs_blocked_malloc | |
539 | -> overrun_check_malloc | |
540 | call malloc (hooks are NULL, so real malloc is called). | |
541 | malloc returns 10000. | |
542 | add overhead, return 10016. | |
543 | <- (back in overrun_check_malloc) | |
857ae68b | 544 | add overhead again, return 10032 |
d8f165a8 | 545 | xmalloc returns 10032. |
857ae68b JD |
546 | |
547 | (time passes). | |
548 | ||
d8f165a8 JD |
549 | xfree(10032) |
550 | overrun_check_free(10032) | |
551 | decrease overhed | |
552 | free(10016) <- crash, because 10000 is the original pointer. */ | |
857ae68b JD |
553 | |
554 | static int check_depth; | |
555 | ||
bdbed949 KS |
556 | /* Like malloc, but wraps allocated block with header and trailer. */ |
557 | ||
2538aa2f | 558 | static POINTER_TYPE * |
e7974947 | 559 | overrun_check_malloc (size_t size) |
212f33f1 | 560 | { |
bdbed949 | 561 | register unsigned char *val; |
857ae68b | 562 | size_t overhead = ++check_depth == 1 ? XMALLOC_OVERRUN_CHECK_SIZE*2 : 0; |
212f33f1 | 563 | |
857ae68b JD |
564 | val = (unsigned char *) malloc (size + overhead); |
565 | if (val && check_depth == 1) | |
212f33f1 | 566 | { |
72af86bd AS |
567 | memcpy (val, xmalloc_overrun_check_header, |
568 | XMALLOC_OVERRUN_CHECK_SIZE - 4); | |
212f33f1 | 569 | val += XMALLOC_OVERRUN_CHECK_SIZE; |
bdbed949 | 570 | XMALLOC_PUT_SIZE(val, size); |
72af86bd AS |
571 | memcpy (val + size, xmalloc_overrun_check_trailer, |
572 | XMALLOC_OVERRUN_CHECK_SIZE); | |
212f33f1 | 573 | } |
857ae68b | 574 | --check_depth; |
212f33f1 KS |
575 | return (POINTER_TYPE *)val; |
576 | } | |
577 | ||
bdbed949 KS |
578 | |
579 | /* Like realloc, but checks old block for overrun, and wraps new block | |
580 | with header and trailer. */ | |
581 | ||
2538aa2f | 582 | static POINTER_TYPE * |
e7974947 | 583 | overrun_check_realloc (POINTER_TYPE *block, size_t size) |
212f33f1 | 584 | { |
e7974947 | 585 | register unsigned char *val = (unsigned char *) block; |
857ae68b | 586 | size_t overhead = ++check_depth == 1 ? XMALLOC_OVERRUN_CHECK_SIZE*2 : 0; |
212f33f1 KS |
587 | |
588 | if (val | |
857ae68b | 589 | && check_depth == 1 |
72af86bd AS |
590 | && memcmp (xmalloc_overrun_check_header, |
591 | val - XMALLOC_OVERRUN_CHECK_SIZE, | |
592 | XMALLOC_OVERRUN_CHECK_SIZE - 4) == 0) | |
212f33f1 | 593 | { |
bdbed949 | 594 | size_t osize = XMALLOC_GET_SIZE (val); |
72af86bd AS |
595 | if (memcmp (xmalloc_overrun_check_trailer, val + osize, |
596 | XMALLOC_OVERRUN_CHECK_SIZE)) | |
212f33f1 | 597 | abort (); |
72af86bd | 598 | memset (val + osize, 0, XMALLOC_OVERRUN_CHECK_SIZE); |
212f33f1 | 599 | val -= XMALLOC_OVERRUN_CHECK_SIZE; |
72af86bd | 600 | memset (val, 0, XMALLOC_OVERRUN_CHECK_SIZE); |
212f33f1 KS |
601 | } |
602 | ||
857ae68b | 603 | val = (unsigned char *) realloc ((POINTER_TYPE *)val, size + overhead); |
212f33f1 | 604 | |
857ae68b | 605 | if (val && check_depth == 1) |
212f33f1 | 606 | { |
72af86bd AS |
607 | memcpy (val, xmalloc_overrun_check_header, |
608 | XMALLOC_OVERRUN_CHECK_SIZE - 4); | |
212f33f1 | 609 | val += XMALLOC_OVERRUN_CHECK_SIZE; |
bdbed949 | 610 | XMALLOC_PUT_SIZE(val, size); |
72af86bd AS |
611 | memcpy (val + size, xmalloc_overrun_check_trailer, |
612 | XMALLOC_OVERRUN_CHECK_SIZE); | |
212f33f1 | 613 | } |
857ae68b | 614 | --check_depth; |
212f33f1 KS |
615 | return (POINTER_TYPE *)val; |
616 | } | |
617 | ||
bdbed949 KS |
618 | /* Like free, but checks block for overrun. */ |
619 | ||
2538aa2f | 620 | static void |
e7974947 | 621 | overrun_check_free (POINTER_TYPE *block) |
212f33f1 | 622 | { |
e7974947 | 623 | unsigned char *val = (unsigned char *) block; |
212f33f1 | 624 | |
857ae68b | 625 | ++check_depth; |
212f33f1 | 626 | if (val |
857ae68b | 627 | && check_depth == 1 |
72af86bd AS |
628 | && memcmp (xmalloc_overrun_check_header, |
629 | val - XMALLOC_OVERRUN_CHECK_SIZE, | |
630 | XMALLOC_OVERRUN_CHECK_SIZE - 4) == 0) | |
212f33f1 | 631 | { |
bdbed949 | 632 | size_t osize = XMALLOC_GET_SIZE (val); |
72af86bd AS |
633 | if (memcmp (xmalloc_overrun_check_trailer, val + osize, |
634 | XMALLOC_OVERRUN_CHECK_SIZE)) | |
212f33f1 | 635 | abort (); |
454d7973 KS |
636 | #ifdef XMALLOC_CLEAR_FREE_MEMORY |
637 | val -= XMALLOC_OVERRUN_CHECK_SIZE; | |
638 | memset (val, 0xff, osize + XMALLOC_OVERRUN_CHECK_SIZE*2); | |
639 | #else | |
72af86bd | 640 | memset (val + osize, 0, XMALLOC_OVERRUN_CHECK_SIZE); |
212f33f1 | 641 | val -= XMALLOC_OVERRUN_CHECK_SIZE; |
72af86bd | 642 | memset (val, 0, XMALLOC_OVERRUN_CHECK_SIZE); |
454d7973 | 643 | #endif |
212f33f1 KS |
644 | } |
645 | ||
646 | free (val); | |
857ae68b | 647 | --check_depth; |
212f33f1 KS |
648 | } |
649 | ||
650 | #undef malloc | |
651 | #undef realloc | |
652 | #undef free | |
653 | #define malloc overrun_check_malloc | |
654 | #define realloc overrun_check_realloc | |
655 | #define free overrun_check_free | |
656 | #endif | |
657 | ||
dafc79fa SM |
658 | #ifdef SYNC_INPUT |
659 | /* When using SYNC_INPUT, we don't call malloc from a signal handler, so | |
660 | there's no need to block input around malloc. */ | |
661 | #define MALLOC_BLOCK_INPUT ((void)0) | |
662 | #define MALLOC_UNBLOCK_INPUT ((void)0) | |
663 | #else | |
664 | #define MALLOC_BLOCK_INPUT BLOCK_INPUT | |
665 | #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT | |
666 | #endif | |
bdbed949 | 667 | |
34400008 | 668 | /* Like malloc but check for no memory and block interrupt input.. */ |
7146af97 | 669 | |
c971ff9a | 670 | POINTER_TYPE * |
971de7fb | 671 | xmalloc (size_t size) |
7146af97 | 672 | { |
c971ff9a | 673 | register POINTER_TYPE *val; |
7146af97 | 674 | |
dafc79fa | 675 | MALLOC_BLOCK_INPUT; |
c971ff9a | 676 | val = (POINTER_TYPE *) malloc (size); |
dafc79fa | 677 | MALLOC_UNBLOCK_INPUT; |
7146af97 | 678 | |
2e471eb5 GM |
679 | if (!val && size) |
680 | memory_full (); | |
7146af97 JB |
681 | return val; |
682 | } | |
683 | ||
34400008 GM |
684 | |
685 | /* Like realloc but check for no memory and block interrupt input.. */ | |
686 | ||
c971ff9a | 687 | POINTER_TYPE * |
971de7fb | 688 | xrealloc (POINTER_TYPE *block, size_t size) |
7146af97 | 689 | { |
c971ff9a | 690 | register POINTER_TYPE *val; |
7146af97 | 691 | |
dafc79fa | 692 | MALLOC_BLOCK_INPUT; |
56d2031b JB |
693 | /* We must call malloc explicitly when BLOCK is 0, since some |
694 | reallocs don't do this. */ | |
695 | if (! block) | |
c971ff9a | 696 | val = (POINTER_TYPE *) malloc (size); |
f048679d | 697 | else |
c971ff9a | 698 | val = (POINTER_TYPE *) realloc (block, size); |
dafc79fa | 699 | MALLOC_UNBLOCK_INPUT; |
7146af97 JB |
700 | |
701 | if (!val && size) memory_full (); | |
702 | return val; | |
703 | } | |
9ac0d9e0 | 704 | |
34400008 | 705 | |
005ca5c7 | 706 | /* Like free but block interrupt input. */ |
34400008 | 707 | |
9ac0d9e0 | 708 | void |
971de7fb | 709 | xfree (POINTER_TYPE *block) |
9ac0d9e0 | 710 | { |
70fdbb46 JM |
711 | if (!block) |
712 | return; | |
dafc79fa | 713 | MALLOC_BLOCK_INPUT; |
9ac0d9e0 | 714 | free (block); |
dafc79fa | 715 | MALLOC_UNBLOCK_INPUT; |
24d8a105 RS |
716 | /* We don't call refill_memory_reserve here |
717 | because that duplicates doing so in emacs_blocked_free | |
718 | and the criterion should go there. */ | |
9ac0d9e0 JB |
719 | } |
720 | ||
c8099634 | 721 | |
dca7c6a8 GM |
722 | /* Like strdup, but uses xmalloc. */ |
723 | ||
724 | char * | |
971de7fb | 725 | xstrdup (const char *s) |
dca7c6a8 | 726 | { |
675d5130 | 727 | size_t len = strlen (s) + 1; |
dca7c6a8 | 728 | char *p = (char *) xmalloc (len); |
72af86bd | 729 | memcpy (p, s, len); |
dca7c6a8 GM |
730 | return p; |
731 | } | |
732 | ||
733 | ||
f61bef8b KS |
734 | /* Unwind for SAFE_ALLOCA */ |
735 | ||
736 | Lisp_Object | |
971de7fb | 737 | safe_alloca_unwind (Lisp_Object arg) |
f61bef8b | 738 | { |
b766f870 KS |
739 | register struct Lisp_Save_Value *p = XSAVE_VALUE (arg); |
740 | ||
741 | p->dogc = 0; | |
742 | xfree (p->pointer); | |
743 | p->pointer = 0; | |
7b7990cc | 744 | free_misc (arg); |
f61bef8b KS |
745 | return Qnil; |
746 | } | |
747 | ||
748 | ||
34400008 GM |
749 | /* Like malloc but used for allocating Lisp data. NBYTES is the |
750 | number of bytes to allocate, TYPE describes the intended use of the | |
751 | allcated memory block (for strings, for conses, ...). */ | |
752 | ||
212f33f1 | 753 | #ifndef USE_LSB_TAG |
918a23a7 | 754 | static void *lisp_malloc_loser; |
212f33f1 | 755 | #endif |
918a23a7 | 756 | |
675d5130 | 757 | static POINTER_TYPE * |
971de7fb | 758 | lisp_malloc (size_t nbytes, enum mem_type type) |
c8099634 | 759 | { |
34400008 | 760 | register void *val; |
c8099634 | 761 | |
dafc79fa | 762 | MALLOC_BLOCK_INPUT; |
877935b1 GM |
763 | |
764 | #ifdef GC_MALLOC_CHECK | |
765 | allocated_mem_type = type; | |
766 | #endif | |
177c0ea7 | 767 | |
34400008 | 768 | val = (void *) malloc (nbytes); |
c8099634 | 769 | |
6b61353c | 770 | #ifndef USE_LSB_TAG |
918a23a7 RS |
771 | /* If the memory just allocated cannot be addressed thru a Lisp |
772 | object's pointer, and it needs to be, | |
773 | that's equivalent to running out of memory. */ | |
774 | if (val && type != MEM_TYPE_NON_LISP) | |
775 | { | |
776 | Lisp_Object tem; | |
777 | XSETCONS (tem, (char *) val + nbytes - 1); | |
778 | if ((char *) XCONS (tem) != (char *) val + nbytes - 1) | |
779 | { | |
780 | lisp_malloc_loser = val; | |
781 | free (val); | |
782 | val = 0; | |
783 | } | |
784 | } | |
6b61353c | 785 | #endif |
918a23a7 | 786 | |
877935b1 | 787 | #if GC_MARK_STACK && !defined GC_MALLOC_CHECK |
dca7c6a8 | 788 | if (val && type != MEM_TYPE_NON_LISP) |
34400008 GM |
789 | mem_insert (val, (char *) val + nbytes, type); |
790 | #endif | |
177c0ea7 | 791 | |
dafc79fa | 792 | MALLOC_UNBLOCK_INPUT; |
dca7c6a8 GM |
793 | if (!val && nbytes) |
794 | memory_full (); | |
c8099634 RS |
795 | return val; |
796 | } | |
797 | ||
34400008 GM |
798 | /* Free BLOCK. This must be called to free memory allocated with a |
799 | call to lisp_malloc. */ | |
800 | ||
bf952fb6 | 801 | static void |
971de7fb | 802 | lisp_free (POINTER_TYPE *block) |
c8099634 | 803 | { |
dafc79fa | 804 | MALLOC_BLOCK_INPUT; |
c8099634 | 805 | free (block); |
877935b1 | 806 | #if GC_MARK_STACK && !defined GC_MALLOC_CHECK |
34400008 GM |
807 | mem_delete (mem_find (block)); |
808 | #endif | |
dafc79fa | 809 | MALLOC_UNBLOCK_INPUT; |
c8099634 | 810 | } |
34400008 | 811 | |
ab6780cd SM |
812 | /* Allocation of aligned blocks of memory to store Lisp data. */ |
813 | /* The entry point is lisp_align_malloc which returns blocks of at most */ | |
814 | /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */ | |
815 | ||
349a4500 SM |
816 | /* Use posix_memalloc if the system has it and we're using the system's |
817 | malloc (because our gmalloc.c routines don't have posix_memalign although | |
818 | its memalloc could be used). */ | |
b4181b01 KS |
819 | #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC) |
820 | #define USE_POSIX_MEMALIGN 1 | |
821 | #endif | |
ab6780cd SM |
822 | |
823 | /* BLOCK_ALIGN has to be a power of 2. */ | |
824 | #define BLOCK_ALIGN (1 << 10) | |
ab6780cd SM |
825 | |
826 | /* Padding to leave at the end of a malloc'd block. This is to give | |
827 | malloc a chance to minimize the amount of memory wasted to alignment. | |
828 | It should be tuned to the particular malloc library used. | |
19bcad1f SM |
829 | On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best. |
830 | posix_memalign on the other hand would ideally prefer a value of 4 | |
831 | because otherwise, there's 1020 bytes wasted between each ablocks. | |
f501ccb4 SM |
832 | In Emacs, testing shows that those 1020 can most of the time be |
833 | efficiently used by malloc to place other objects, so a value of 0 can | |
834 | still preferable unless you have a lot of aligned blocks and virtually | |
835 | nothing else. */ | |
19bcad1f SM |
836 | #define BLOCK_PADDING 0 |
837 | #define BLOCK_BYTES \ | |
0b432f21 | 838 | (BLOCK_ALIGN - sizeof (struct ablocks *) - BLOCK_PADDING) |
19bcad1f SM |
839 | |
840 | /* Internal data structures and constants. */ | |
841 | ||
ab6780cd SM |
842 | #define ABLOCKS_SIZE 16 |
843 | ||
844 | /* An aligned block of memory. */ | |
845 | struct ablock | |
846 | { | |
847 | union | |
848 | { | |
849 | char payload[BLOCK_BYTES]; | |
850 | struct ablock *next_free; | |
851 | } x; | |
852 | /* `abase' is the aligned base of the ablocks. */ | |
853 | /* It is overloaded to hold the virtual `busy' field that counts | |
854 | the number of used ablock in the parent ablocks. | |
855 | The first ablock has the `busy' field, the others have the `abase' | |
856 | field. To tell the difference, we assume that pointers will have | |
857 | integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy' | |
858 | is used to tell whether the real base of the parent ablocks is `abase' | |
859 | (if not, the word before the first ablock holds a pointer to the | |
860 | real base). */ | |
861 | struct ablocks *abase; | |
862 | /* The padding of all but the last ablock is unused. The padding of | |
863 | the last ablock in an ablocks is not allocated. */ | |
19bcad1f SM |
864 | #if BLOCK_PADDING |
865 | char padding[BLOCK_PADDING]; | |
ebb8d410 | 866 | #endif |
ab6780cd SM |
867 | }; |
868 | ||
869 | /* A bunch of consecutive aligned blocks. */ | |
870 | struct ablocks | |
871 | { | |
872 | struct ablock blocks[ABLOCKS_SIZE]; | |
873 | }; | |
874 | ||
875 | /* Size of the block requested from malloc or memalign. */ | |
19bcad1f | 876 | #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING) |
ab6780cd SM |
877 | |
878 | #define ABLOCK_ABASE(block) \ | |
879 | (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \ | |
880 | ? (struct ablocks *)(block) \ | |
881 | : (block)->abase) | |
882 | ||
883 | /* Virtual `busy' field. */ | |
884 | #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase) | |
885 | ||
886 | /* Pointer to the (not necessarily aligned) malloc block. */ | |
349a4500 | 887 | #ifdef USE_POSIX_MEMALIGN |
19bcad1f SM |
888 | #define ABLOCKS_BASE(abase) (abase) |
889 | #else | |
ab6780cd | 890 | #define ABLOCKS_BASE(abase) \ |
005ca5c7 | 891 | (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1]) |
19bcad1f | 892 | #endif |
ab6780cd SM |
893 | |
894 | /* The list of free ablock. */ | |
895 | static struct ablock *free_ablock; | |
896 | ||
897 | /* Allocate an aligned block of nbytes. | |
898 | Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be | |
899 | smaller or equal to BLOCK_BYTES. */ | |
900 | static POINTER_TYPE * | |
971de7fb | 901 | lisp_align_malloc (size_t nbytes, enum mem_type type) |
ab6780cd SM |
902 | { |
903 | void *base, *val; | |
904 | struct ablocks *abase; | |
905 | ||
906 | eassert (nbytes <= BLOCK_BYTES); | |
907 | ||
dafc79fa | 908 | MALLOC_BLOCK_INPUT; |
ab6780cd SM |
909 | |
910 | #ifdef GC_MALLOC_CHECK | |
911 | allocated_mem_type = type; | |
912 | #endif | |
913 | ||
914 | if (!free_ablock) | |
915 | { | |
005ca5c7 DL |
916 | int i; |
917 | EMACS_INT aligned; /* int gets warning casting to 64-bit pointer. */ | |
ab6780cd SM |
918 | |
919 | #ifdef DOUG_LEA_MALLOC | |
920 | /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed | |
921 | because mapped region contents are not preserved in | |
922 | a dumped Emacs. */ | |
923 | mallopt (M_MMAP_MAX, 0); | |
924 | #endif | |
925 | ||
349a4500 | 926 | #ifdef USE_POSIX_MEMALIGN |
19bcad1f SM |
927 | { |
928 | int err = posix_memalign (&base, BLOCK_ALIGN, ABLOCKS_BYTES); | |
ab349c19 RS |
929 | if (err) |
930 | base = NULL; | |
931 | abase = base; | |
19bcad1f SM |
932 | } |
933 | #else | |
ab6780cd SM |
934 | base = malloc (ABLOCKS_BYTES); |
935 | abase = ALIGN (base, BLOCK_ALIGN); | |
ab349c19 RS |
936 | #endif |
937 | ||
6b61353c KH |
938 | if (base == 0) |
939 | { | |
dafc79fa | 940 | MALLOC_UNBLOCK_INPUT; |
6b61353c KH |
941 | memory_full (); |
942 | } | |
ab6780cd SM |
943 | |
944 | aligned = (base == abase); | |
945 | if (!aligned) | |
946 | ((void**)abase)[-1] = base; | |
947 | ||
948 | #ifdef DOUG_LEA_MALLOC | |
949 | /* Back to a reasonable maximum of mmap'ed areas. */ | |
950 | mallopt (M_MMAP_MAX, MMAP_MAX_AREAS); | |
951 | #endif | |
952 | ||
6b61353c | 953 | #ifndef USE_LSB_TAG |
8f924df7 KH |
954 | /* If the memory just allocated cannot be addressed thru a Lisp |
955 | object's pointer, and it needs to be, that's equivalent to | |
956 | running out of memory. */ | |
957 | if (type != MEM_TYPE_NON_LISP) | |
958 | { | |
959 | Lisp_Object tem; | |
960 | char *end = (char *) base + ABLOCKS_BYTES - 1; | |
961 | XSETCONS (tem, end); | |
962 | if ((char *) XCONS (tem) != end) | |
963 | { | |
964 | lisp_malloc_loser = base; | |
965 | free (base); | |
dafc79fa | 966 | MALLOC_UNBLOCK_INPUT; |
8f924df7 KH |
967 | memory_full (); |
968 | } | |
969 | } | |
6b61353c | 970 | #endif |
8f924df7 | 971 | |
ab6780cd SM |
972 | /* Initialize the blocks and put them on the free list. |
973 | Is `base' was not properly aligned, we can't use the last block. */ | |
974 | for (i = 0; i < (aligned ? ABLOCKS_SIZE : ABLOCKS_SIZE - 1); i++) | |
975 | { | |
976 | abase->blocks[i].abase = abase; | |
977 | abase->blocks[i].x.next_free = free_ablock; | |
978 | free_ablock = &abase->blocks[i]; | |
979 | } | |
005ca5c7 | 980 | ABLOCKS_BUSY (abase) = (struct ablocks *) (long) aligned; |
ab6780cd | 981 | |
19bcad1f | 982 | eassert (0 == ((EMACS_UINT)abase) % BLOCK_ALIGN); |
ab6780cd SM |
983 | eassert (ABLOCK_ABASE (&abase->blocks[3]) == abase); /* 3 is arbitrary */ |
984 | eassert (ABLOCK_ABASE (&abase->blocks[0]) == abase); | |
985 | eassert (ABLOCKS_BASE (abase) == base); | |
005ca5c7 | 986 | eassert (aligned == (long) ABLOCKS_BUSY (abase)); |
ab6780cd SM |
987 | } |
988 | ||
989 | abase = ABLOCK_ABASE (free_ablock); | |
005ca5c7 | 990 | ABLOCKS_BUSY (abase) = (struct ablocks *) (2 + (long) ABLOCKS_BUSY (abase)); |
ab6780cd SM |
991 | val = free_ablock; |
992 | free_ablock = free_ablock->x.next_free; | |
993 | ||
ab6780cd SM |
994 | #if GC_MARK_STACK && !defined GC_MALLOC_CHECK |
995 | if (val && type != MEM_TYPE_NON_LISP) | |
996 | mem_insert (val, (char *) val + nbytes, type); | |
997 | #endif | |
998 | ||
dafc79fa | 999 | MALLOC_UNBLOCK_INPUT; |
ab6780cd SM |
1000 | if (!val && nbytes) |
1001 | memory_full (); | |
1002 | ||
1003 | eassert (0 == ((EMACS_UINT)val) % BLOCK_ALIGN); | |
1004 | return val; | |
1005 | } | |
1006 | ||
1007 | static void | |
971de7fb | 1008 | lisp_align_free (POINTER_TYPE *block) |
ab6780cd SM |
1009 | { |
1010 | struct ablock *ablock = block; | |
1011 | struct ablocks *abase = ABLOCK_ABASE (ablock); | |
1012 | ||
dafc79fa | 1013 | MALLOC_BLOCK_INPUT; |
ab6780cd SM |
1014 | #if GC_MARK_STACK && !defined GC_MALLOC_CHECK |
1015 | mem_delete (mem_find (block)); | |
1016 | #endif | |
1017 | /* Put on free list. */ | |
1018 | ablock->x.next_free = free_ablock; | |
1019 | free_ablock = ablock; | |
1020 | /* Update busy count. */ | |
005ca5c7 | 1021 | ABLOCKS_BUSY (abase) = (struct ablocks *) (-2 + (long) ABLOCKS_BUSY (abase)); |
d2db1c32 | 1022 | |
005ca5c7 | 1023 | if (2 > (long) ABLOCKS_BUSY (abase)) |
ab6780cd | 1024 | { /* All the blocks are free. */ |
005ca5c7 | 1025 | int i = 0, aligned = (long) ABLOCKS_BUSY (abase); |
ab6780cd SM |
1026 | struct ablock **tem = &free_ablock; |
1027 | struct ablock *atop = &abase->blocks[aligned ? ABLOCKS_SIZE : ABLOCKS_SIZE - 1]; | |
1028 | ||
1029 | while (*tem) | |
1030 | { | |
1031 | if (*tem >= (struct ablock *) abase && *tem < atop) | |
1032 | { | |
1033 | i++; | |
1034 | *tem = (*tem)->x.next_free; | |
1035 | } | |
1036 | else | |
1037 | tem = &(*tem)->x.next_free; | |
1038 | } | |
1039 | eassert ((aligned & 1) == aligned); | |
1040 | eassert (i == (aligned ? ABLOCKS_SIZE : ABLOCKS_SIZE - 1)); | |
349a4500 | 1041 | #ifdef USE_POSIX_MEMALIGN |
cfb2f32e SM |
1042 | eassert ((unsigned long)ABLOCKS_BASE (abase) % BLOCK_ALIGN == 0); |
1043 | #endif | |
ab6780cd SM |
1044 | free (ABLOCKS_BASE (abase)); |
1045 | } | |
dafc79fa | 1046 | MALLOC_UNBLOCK_INPUT; |
ab6780cd | 1047 | } |
3ef06d12 SM |
1048 | |
1049 | /* Return a new buffer structure allocated from the heap with | |
1050 | a call to lisp_malloc. */ | |
1051 | ||
1052 | struct buffer * | |
971de7fb | 1053 | allocate_buffer (void) |
3ef06d12 SM |
1054 | { |
1055 | struct buffer *b | |
1056 | = (struct buffer *) lisp_malloc (sizeof (struct buffer), | |
1057 | MEM_TYPE_BUFFER); | |
eab3844f PE |
1058 | XSETPVECTYPESIZE (b, PVEC_BUFFER, |
1059 | ((sizeof (struct buffer) + sizeof (EMACS_INT) - 1) | |
1060 | / sizeof (EMACS_INT))); | |
3ef06d12 SM |
1061 | return b; |
1062 | } | |
1063 | ||
9ac0d9e0 | 1064 | \f |
026cdede SM |
1065 | #ifndef SYSTEM_MALLOC |
1066 | ||
9ac0d9e0 JB |
1067 | /* Arranging to disable input signals while we're in malloc. |
1068 | ||
1069 | This only works with GNU malloc. To help out systems which can't | |
1070 | use GNU malloc, all the calls to malloc, realloc, and free | |
1071 | elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT | |
026cdede | 1072 | pair; unfortunately, we have no idea what C library functions |
9ac0d9e0 | 1073 | might call malloc, so we can't really protect them unless you're |
2c5bd608 DL |
1074 | using GNU malloc. Fortunately, most of the major operating systems |
1075 | can use GNU malloc. */ | |
9ac0d9e0 | 1076 | |
026cdede | 1077 | #ifndef SYNC_INPUT |
dafc79fa SM |
1078 | /* When using SYNC_INPUT, we don't call malloc from a signal handler, so |
1079 | there's no need to block input around malloc. */ | |
026cdede | 1080 | |
b3303f74 | 1081 | #ifndef DOUG_LEA_MALLOC |
f57e2426 J |
1082 | extern void * (*__malloc_hook) (size_t, const void *); |
1083 | extern void * (*__realloc_hook) (void *, size_t, const void *); | |
1084 | extern void (*__free_hook) (void *, const void *); | |
b3303f74 DL |
1085 | /* Else declared in malloc.h, perhaps with an extra arg. */ |
1086 | #endif /* DOUG_LEA_MALLOC */ | |
f57e2426 J |
1087 | static void * (*old_malloc_hook) (size_t, const void *); |
1088 | static void * (*old_realloc_hook) (void *, size_t, const void*); | |
1089 | static void (*old_free_hook) (void*, const void*); | |
9ac0d9e0 | 1090 | |
4e75f29d PE |
1091 | #ifdef DOUG_LEA_MALLOC |
1092 | # define BYTES_USED (mallinfo ().uordblks) | |
1093 | #else | |
1094 | # define BYTES_USED _bytes_used | |
1095 | #endif | |
1096 | ||
ef1b0ba7 SM |
1097 | static __malloc_size_t bytes_used_when_reconsidered; |
1098 | ||
4e75f29d PE |
1099 | /* Value of _bytes_used, when spare_memory was freed. */ |
1100 | ||
1101 | static __malloc_size_t bytes_used_when_full; | |
1102 | ||
276cbe5a RS |
1103 | /* This function is used as the hook for free to call. */ |
1104 | ||
9ac0d9e0 | 1105 | static void |
7c3320d8 | 1106 | emacs_blocked_free (void *ptr, const void *ptr2) |
9ac0d9e0 | 1107 | { |
aa477689 | 1108 | BLOCK_INPUT_ALLOC; |
877935b1 GM |
1109 | |
1110 | #ifdef GC_MALLOC_CHECK | |
a83fee2c GM |
1111 | if (ptr) |
1112 | { | |
1113 | struct mem_node *m; | |
177c0ea7 | 1114 | |
a83fee2c GM |
1115 | m = mem_find (ptr); |
1116 | if (m == MEM_NIL || m->start != ptr) | |
1117 | { | |
1118 | fprintf (stderr, | |
1119 | "Freeing `%p' which wasn't allocated with malloc\n", ptr); | |
1120 | abort (); | |
1121 | } | |
1122 | else | |
1123 | { | |
1124 | /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */ | |
1125 | mem_delete (m); | |
1126 | } | |
1127 | } | |
877935b1 | 1128 | #endif /* GC_MALLOC_CHECK */ |
177c0ea7 | 1129 | |
9ac0d9e0 JB |
1130 | __free_hook = old_free_hook; |
1131 | free (ptr); | |
177c0ea7 | 1132 | |
276cbe5a RS |
1133 | /* If we released our reserve (due to running out of memory), |
1134 | and we have a fair amount free once again, | |
1135 | try to set aside another reserve in case we run out once more. */ | |
24d8a105 | 1136 | if (! NILP (Vmemory_full) |
276cbe5a RS |
1137 | /* Verify there is enough space that even with the malloc |
1138 | hysteresis this call won't run out again. | |
1139 | The code here is correct as long as SPARE_MEMORY | |
1140 | is substantially larger than the block size malloc uses. */ | |
1141 | && (bytes_used_when_full | |
4d74a5fc | 1142 | > ((bytes_used_when_reconsidered = BYTES_USED) |
bccfb310 | 1143 | + max (malloc_hysteresis, 4) * SPARE_MEMORY))) |
24d8a105 | 1144 | refill_memory_reserve (); |
276cbe5a | 1145 | |
b0846f52 | 1146 | __free_hook = emacs_blocked_free; |
aa477689 | 1147 | UNBLOCK_INPUT_ALLOC; |
9ac0d9e0 JB |
1148 | } |
1149 | ||
34400008 | 1150 | |
276cbe5a RS |
1151 | /* This function is the malloc hook that Emacs uses. */ |
1152 | ||
9ac0d9e0 | 1153 | static void * |
7c3320d8 | 1154 | emacs_blocked_malloc (size_t size, const void *ptr) |
9ac0d9e0 JB |
1155 | { |
1156 | void *value; | |
1157 | ||
aa477689 | 1158 | BLOCK_INPUT_ALLOC; |
9ac0d9e0 | 1159 | __malloc_hook = old_malloc_hook; |
1177ecf6 | 1160 | #ifdef DOUG_LEA_MALLOC |
5665a02f KL |
1161 | /* Segfaults on my system. --lorentey */ |
1162 | /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */ | |
1177ecf6 | 1163 | #else |
d1658221 | 1164 | __malloc_extra_blocks = malloc_hysteresis; |
1177ecf6 | 1165 | #endif |
877935b1 | 1166 | |
2756d8ee | 1167 | value = (void *) malloc (size); |
877935b1 GM |
1168 | |
1169 | #ifdef GC_MALLOC_CHECK | |
1170 | { | |
1171 | struct mem_node *m = mem_find (value); | |
1172 | if (m != MEM_NIL) | |
1173 | { | |
1174 | fprintf (stderr, "Malloc returned %p which is already in use\n", | |
1175 | value); | |
1176 | fprintf (stderr, "Region in use is %p...%p, %u bytes, type %d\n", | |
1177 | m->start, m->end, (char *) m->end - (char *) m->start, | |
1178 | m->type); | |
1179 | abort (); | |
1180 | } | |
1181 | ||
1182 | if (!dont_register_blocks) | |
1183 | { | |
1184 | mem_insert (value, (char *) value + max (1, size), allocated_mem_type); | |
1185 | allocated_mem_type = MEM_TYPE_NON_LISP; | |
1186 | } | |
1187 | } | |
1188 | #endif /* GC_MALLOC_CHECK */ | |
177c0ea7 | 1189 | |
b0846f52 | 1190 | __malloc_hook = emacs_blocked_malloc; |
aa477689 | 1191 | UNBLOCK_INPUT_ALLOC; |
9ac0d9e0 | 1192 | |
877935b1 | 1193 | /* fprintf (stderr, "%p malloc\n", value); */ |
9ac0d9e0 JB |
1194 | return value; |
1195 | } | |
1196 | ||
34400008 GM |
1197 | |
1198 | /* This function is the realloc hook that Emacs uses. */ | |
1199 | ||
9ac0d9e0 | 1200 | static void * |
7c3320d8 | 1201 | emacs_blocked_realloc (void *ptr, size_t size, const void *ptr2) |
9ac0d9e0 JB |
1202 | { |
1203 | void *value; | |
1204 | ||
aa477689 | 1205 | BLOCK_INPUT_ALLOC; |
9ac0d9e0 | 1206 | __realloc_hook = old_realloc_hook; |
877935b1 GM |
1207 | |
1208 | #ifdef GC_MALLOC_CHECK | |
1209 | if (ptr) | |
1210 | { | |
1211 | struct mem_node *m = mem_find (ptr); | |
1212 | if (m == MEM_NIL || m->start != ptr) | |
1213 | { | |
1214 | fprintf (stderr, | |
1215 | "Realloc of %p which wasn't allocated with malloc\n", | |
1216 | ptr); | |
1217 | abort (); | |
1218 | } | |
1219 | ||
1220 | mem_delete (m); | |
1221 | } | |
177c0ea7 | 1222 | |
877935b1 | 1223 | /* fprintf (stderr, "%p -> realloc\n", ptr); */ |
177c0ea7 | 1224 | |
877935b1 GM |
1225 | /* Prevent malloc from registering blocks. */ |
1226 | dont_register_blocks = 1; | |
1227 | #endif /* GC_MALLOC_CHECK */ | |
1228 | ||
2756d8ee | 1229 | value = (void *) realloc (ptr, size); |
877935b1 GM |
1230 | |
1231 | #ifdef GC_MALLOC_CHECK | |
1232 | dont_register_blocks = 0; | |
1233 | ||
1234 | { | |
1235 | struct mem_node *m = mem_find (value); | |
1236 | if (m != MEM_NIL) | |
1237 | { | |
1238 | fprintf (stderr, "Realloc returns memory that is already in use\n"); | |
1239 | abort (); | |
1240 | } | |
1241 | ||
1242 | /* Can't handle zero size regions in the red-black tree. */ | |
1243 | mem_insert (value, (char *) value + max (size, 1), MEM_TYPE_NON_LISP); | |
1244 | } | |
177c0ea7 | 1245 | |
877935b1 GM |
1246 | /* fprintf (stderr, "%p <- realloc\n", value); */ |
1247 | #endif /* GC_MALLOC_CHECK */ | |
177c0ea7 | 1248 | |
b0846f52 | 1249 | __realloc_hook = emacs_blocked_realloc; |
aa477689 | 1250 | UNBLOCK_INPUT_ALLOC; |
9ac0d9e0 JB |
1251 | |
1252 | return value; | |
1253 | } | |
1254 | ||
34400008 | 1255 | |
aa477689 JD |
1256 | #ifdef HAVE_GTK_AND_PTHREAD |
1257 | /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a | |
1258 | normal malloc. Some thread implementations need this as they call | |
1259 | malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then | |
1260 | calls malloc because it is the first call, and we have an endless loop. */ | |
1261 | ||
1262 | void | |
1263 | reset_malloc_hooks () | |
1264 | { | |
4d580af2 AS |
1265 | __free_hook = old_free_hook; |
1266 | __malloc_hook = old_malloc_hook; | |
1267 | __realloc_hook = old_realloc_hook; | |
aa477689 JD |
1268 | } |
1269 | #endif /* HAVE_GTK_AND_PTHREAD */ | |
1270 | ||
1271 | ||
34400008 GM |
1272 | /* Called from main to set up malloc to use our hooks. */ |
1273 | ||
9ac0d9e0 | 1274 | void |
7c3320d8 | 1275 | uninterrupt_malloc (void) |
9ac0d9e0 | 1276 | { |
aa477689 | 1277 | #ifdef HAVE_GTK_AND_PTHREAD |
a1b41389 | 1278 | #ifdef DOUG_LEA_MALLOC |
aa477689 JD |
1279 | pthread_mutexattr_t attr; |
1280 | ||
1281 | /* GLIBC has a faster way to do this, but lets keep it portable. | |
1282 | This is according to the Single UNIX Specification. */ | |
1283 | pthread_mutexattr_init (&attr); | |
1284 | pthread_mutexattr_settype (&attr, PTHREAD_MUTEX_RECURSIVE); | |
1285 | pthread_mutex_init (&alloc_mutex, &attr); | |
a1b41389 | 1286 | #else /* !DOUG_LEA_MALLOC */ |
ce5b453a | 1287 | /* Some systems such as Solaris 2.6 don't have a recursive mutex, |
a1b41389 YM |
1288 | and the bundled gmalloc.c doesn't require it. */ |
1289 | pthread_mutex_init (&alloc_mutex, NULL); | |
1290 | #endif /* !DOUG_LEA_MALLOC */ | |
aa477689 JD |
1291 | #endif /* HAVE_GTK_AND_PTHREAD */ |
1292 | ||
c8099634 RS |
1293 | if (__free_hook != emacs_blocked_free) |
1294 | old_free_hook = __free_hook; | |
b0846f52 | 1295 | __free_hook = emacs_blocked_free; |
9ac0d9e0 | 1296 | |
c8099634 RS |
1297 | if (__malloc_hook != emacs_blocked_malloc) |
1298 | old_malloc_hook = __malloc_hook; | |
b0846f52 | 1299 | __malloc_hook = emacs_blocked_malloc; |
9ac0d9e0 | 1300 | |
c8099634 RS |
1301 | if (__realloc_hook != emacs_blocked_realloc) |
1302 | old_realloc_hook = __realloc_hook; | |
b0846f52 | 1303 | __realloc_hook = emacs_blocked_realloc; |
9ac0d9e0 | 1304 | } |
2e471eb5 | 1305 | |
026cdede | 1306 | #endif /* not SYNC_INPUT */ |
2e471eb5 GM |
1307 | #endif /* not SYSTEM_MALLOC */ |
1308 | ||
1309 | ||
7146af97 | 1310 | \f |
2e471eb5 GM |
1311 | /*********************************************************************** |
1312 | Interval Allocation | |
1313 | ***********************************************************************/ | |
1a4f1e2c | 1314 | |
34400008 GM |
1315 | /* Number of intervals allocated in an interval_block structure. |
1316 | The 1020 is 1024 minus malloc overhead. */ | |
1317 | ||
d5e35230 JA |
1318 | #define INTERVAL_BLOCK_SIZE \ |
1319 | ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval)) | |
1320 | ||
34400008 GM |
1321 | /* Intervals are allocated in chunks in form of an interval_block |
1322 | structure. */ | |
1323 | ||
d5e35230 | 1324 | struct interval_block |
2e471eb5 | 1325 | { |
6b61353c | 1326 | /* Place `intervals' first, to preserve alignment. */ |
2e471eb5 | 1327 | struct interval intervals[INTERVAL_BLOCK_SIZE]; |
6b61353c | 1328 | struct interval_block *next; |
2e471eb5 | 1329 | }; |
d5e35230 | 1330 | |
34400008 GM |
1331 | /* Current interval block. Its `next' pointer points to older |
1332 | blocks. */ | |
1333 | ||
d3d47262 | 1334 | static struct interval_block *interval_block; |
34400008 GM |
1335 | |
1336 | /* Index in interval_block above of the next unused interval | |
1337 | structure. */ | |
1338 | ||
d5e35230 | 1339 | static int interval_block_index; |
34400008 GM |
1340 | |
1341 | /* Number of free and live intervals. */ | |
1342 | ||
2e471eb5 | 1343 | static int total_free_intervals, total_intervals; |
d5e35230 | 1344 | |
34400008 GM |
1345 | /* List of free intervals. */ |
1346 | ||
244ed907 | 1347 | static INTERVAL interval_free_list; |
d5e35230 | 1348 | |
c8099634 | 1349 | /* Total number of interval blocks now in use. */ |
2e471eb5 | 1350 | |
d3d47262 | 1351 | static int n_interval_blocks; |
c8099634 | 1352 | |
34400008 GM |
1353 | |
1354 | /* Initialize interval allocation. */ | |
1355 | ||
d5e35230 | 1356 | static void |
971de7fb | 1357 | init_intervals (void) |
d5e35230 | 1358 | { |
005ca5c7 DL |
1359 | interval_block = NULL; |
1360 | interval_block_index = INTERVAL_BLOCK_SIZE; | |
d5e35230 | 1361 | interval_free_list = 0; |
005ca5c7 | 1362 | n_interval_blocks = 0; |
d5e35230 JA |
1363 | } |
1364 | ||
34400008 GM |
1365 | |
1366 | /* Return a new interval. */ | |
d5e35230 JA |
1367 | |
1368 | INTERVAL | |
971de7fb | 1369 | make_interval (void) |
d5e35230 JA |
1370 | { |
1371 | INTERVAL val; | |
1372 | ||
e2984df0 CY |
1373 | /* eassert (!handling_signal); */ |
1374 | ||
dafc79fa | 1375 | MALLOC_BLOCK_INPUT; |
cfb2f32e | 1376 | |
d5e35230 JA |
1377 | if (interval_free_list) |
1378 | { | |
1379 | val = interval_free_list; | |
439d5cb4 | 1380 | interval_free_list = INTERVAL_PARENT (interval_free_list); |
d5e35230 JA |
1381 | } |
1382 | else | |
1383 | { | |
1384 | if (interval_block_index == INTERVAL_BLOCK_SIZE) | |
1385 | { | |
3c06d205 KH |
1386 | register struct interval_block *newi; |
1387 | ||
34400008 GM |
1388 | newi = (struct interval_block *) lisp_malloc (sizeof *newi, |
1389 | MEM_TYPE_NON_LISP); | |
d5e35230 | 1390 | |
d5e35230 JA |
1391 | newi->next = interval_block; |
1392 | interval_block = newi; | |
1393 | interval_block_index = 0; | |
c8099634 | 1394 | n_interval_blocks++; |
d5e35230 JA |
1395 | } |
1396 | val = &interval_block->intervals[interval_block_index++]; | |
1397 | } | |
e2984df0 | 1398 | |
dafc79fa | 1399 | MALLOC_UNBLOCK_INPUT; |
e2984df0 | 1400 | |
d5e35230 | 1401 | consing_since_gc += sizeof (struct interval); |
310ea200 | 1402 | intervals_consed++; |
d5e35230 | 1403 | RESET_INTERVAL (val); |
2336fe58 | 1404 | val->gcmarkbit = 0; |
d5e35230 JA |
1405 | return val; |
1406 | } | |
1407 | ||
34400008 GM |
1408 | |
1409 | /* Mark Lisp objects in interval I. */ | |
d5e35230 JA |
1410 | |
1411 | static void | |
971de7fb | 1412 | mark_interval (register INTERVAL i, Lisp_Object dummy) |
d5e35230 | 1413 | { |
2336fe58 SM |
1414 | eassert (!i->gcmarkbit); /* Intervals are never shared. */ |
1415 | i->gcmarkbit = 1; | |
49723c04 | 1416 | mark_object (i->plist); |
d5e35230 JA |
1417 | } |
1418 | ||
34400008 GM |
1419 | |
1420 | /* Mark the interval tree rooted in TREE. Don't call this directly; | |
1421 | use the macro MARK_INTERVAL_TREE instead. */ | |
1422 | ||
d5e35230 | 1423 | static void |
971de7fb | 1424 | mark_interval_tree (register INTERVAL tree) |
d5e35230 | 1425 | { |
e8720644 JB |
1426 | /* No need to test if this tree has been marked already; this |
1427 | function is always called through the MARK_INTERVAL_TREE macro, | |
1428 | which takes care of that. */ | |
1429 | ||
1e934989 | 1430 | traverse_intervals_noorder (tree, mark_interval, Qnil); |
d5e35230 JA |
1431 | } |
1432 | ||
34400008 GM |
1433 | |
1434 | /* Mark the interval tree rooted in I. */ | |
1435 | ||
e8720644 JB |
1436 | #define MARK_INTERVAL_TREE(i) \ |
1437 | do { \ | |
2336fe58 | 1438 | if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \ |
e8720644 JB |
1439 | mark_interval_tree (i); \ |
1440 | } while (0) | |
d5e35230 | 1441 | |
34400008 | 1442 | |
2e471eb5 GM |
1443 | #define UNMARK_BALANCE_INTERVALS(i) \ |
1444 | do { \ | |
1445 | if (! NULL_INTERVAL_P (i)) \ | |
2336fe58 | 1446 | (i) = balance_intervals (i); \ |
2e471eb5 | 1447 | } while (0) |
d5e35230 | 1448 | |
cc2d8c6b | 1449 | \f |
6e5cb96f | 1450 | /* Number support. If USE_LISP_UNION_TYPE is in effect, we |
cc2d8c6b KR |
1451 | can't create number objects in macros. */ |
1452 | #ifndef make_number | |
1453 | Lisp_Object | |
c566235d | 1454 | make_number (EMACS_INT n) |
cc2d8c6b KR |
1455 | { |
1456 | Lisp_Object obj; | |
1457 | obj.s.val = n; | |
1458 | obj.s.type = Lisp_Int; | |
1459 | return obj; | |
1460 | } | |
1461 | #endif | |
d5e35230 | 1462 | \f |
2e471eb5 GM |
1463 | /*********************************************************************** |
1464 | String Allocation | |
1465 | ***********************************************************************/ | |
1a4f1e2c | 1466 | |
2e471eb5 GM |
1467 | /* Lisp_Strings are allocated in string_block structures. When a new |
1468 | string_block is allocated, all the Lisp_Strings it contains are | |
e0fead5d | 1469 | added to a free-list string_free_list. When a new Lisp_String is |
2e471eb5 GM |
1470 | needed, it is taken from that list. During the sweep phase of GC, |
1471 | string_blocks that are entirely free are freed, except two which | |
1472 | we keep. | |
7146af97 | 1473 | |
2e471eb5 GM |
1474 | String data is allocated from sblock structures. Strings larger |
1475 | than LARGE_STRING_BYTES, get their own sblock, data for smaller | |
1476 | strings is sub-allocated out of sblocks of size SBLOCK_SIZE. | |
7146af97 | 1477 | |
2e471eb5 GM |
1478 | Sblocks consist internally of sdata structures, one for each |
1479 | Lisp_String. The sdata structure points to the Lisp_String it | |
1480 | belongs to. The Lisp_String points back to the `u.data' member of | |
1481 | its sdata structure. | |
7146af97 | 1482 | |
2e471eb5 GM |
1483 | When a Lisp_String is freed during GC, it is put back on |
1484 | string_free_list, and its `data' member and its sdata's `string' | |
1485 | pointer is set to null. The size of the string is recorded in the | |
1486 | `u.nbytes' member of the sdata. So, sdata structures that are no | |
1487 | longer used, can be easily recognized, and it's easy to compact the | |
1488 | sblocks of small strings which we do in compact_small_strings. */ | |
7146af97 | 1489 | |
2e471eb5 GM |
1490 | /* Size in bytes of an sblock structure used for small strings. This |
1491 | is 8192 minus malloc overhead. */ | |
7146af97 | 1492 | |
2e471eb5 | 1493 | #define SBLOCK_SIZE 8188 |
c8099634 | 1494 | |
2e471eb5 GM |
1495 | /* Strings larger than this are considered large strings. String data |
1496 | for large strings is allocated from individual sblocks. */ | |
7146af97 | 1497 | |
2e471eb5 GM |
1498 | #define LARGE_STRING_BYTES 1024 |
1499 | ||
1500 | /* Structure describing string memory sub-allocated from an sblock. | |
1501 | This is where the contents of Lisp strings are stored. */ | |
1502 | ||
1503 | struct sdata | |
7146af97 | 1504 | { |
2e471eb5 GM |
1505 | /* Back-pointer to the string this sdata belongs to. If null, this |
1506 | structure is free, and the NBYTES member of the union below | |
34400008 | 1507 | contains the string's byte size (the same value that STRING_BYTES |
2e471eb5 GM |
1508 | would return if STRING were non-null). If non-null, STRING_BYTES |
1509 | (STRING) is the size of the data, and DATA contains the string's | |
1510 | contents. */ | |
1511 | struct Lisp_String *string; | |
7146af97 | 1512 | |
31d929e5 | 1513 | #ifdef GC_CHECK_STRING_BYTES |
177c0ea7 | 1514 | |
31d929e5 GM |
1515 | EMACS_INT nbytes; |
1516 | unsigned char data[1]; | |
177c0ea7 | 1517 | |
31d929e5 GM |
1518 | #define SDATA_NBYTES(S) (S)->nbytes |
1519 | #define SDATA_DATA(S) (S)->data | |
36372bf9 | 1520 | #define SDATA_SELECTOR(member) member |
177c0ea7 | 1521 | |
31d929e5 GM |
1522 | #else /* not GC_CHECK_STRING_BYTES */ |
1523 | ||
2e471eb5 GM |
1524 | union |
1525 | { | |
83998b7a | 1526 | /* When STRING is non-null. */ |
2e471eb5 GM |
1527 | unsigned char data[1]; |
1528 | ||
1529 | /* When STRING is null. */ | |
1530 | EMACS_INT nbytes; | |
1531 | } u; | |
177c0ea7 | 1532 | |
31d929e5 GM |
1533 | #define SDATA_NBYTES(S) (S)->u.nbytes |
1534 | #define SDATA_DATA(S) (S)->u.data | |
36372bf9 | 1535 | #define SDATA_SELECTOR(member) u.member |
31d929e5 GM |
1536 | |
1537 | #endif /* not GC_CHECK_STRING_BYTES */ | |
36372bf9 PE |
1538 | |
1539 | #define SDATA_DATA_OFFSET offsetof (struct sdata, SDATA_SELECTOR (data)) | |
2e471eb5 GM |
1540 | }; |
1541 | ||
31d929e5 | 1542 | |
2e471eb5 GM |
1543 | /* Structure describing a block of memory which is sub-allocated to |
1544 | obtain string data memory for strings. Blocks for small strings | |
1545 | are of fixed size SBLOCK_SIZE. Blocks for large strings are made | |
1546 | as large as needed. */ | |
1547 | ||
1548 | struct sblock | |
7146af97 | 1549 | { |
2e471eb5 GM |
1550 | /* Next in list. */ |
1551 | struct sblock *next; | |
7146af97 | 1552 | |
2e471eb5 GM |
1553 | /* Pointer to the next free sdata block. This points past the end |
1554 | of the sblock if there isn't any space left in this block. */ | |
1555 | struct sdata *next_free; | |
1556 | ||
1557 | /* Start of data. */ | |
1558 | struct sdata first_data; | |
1559 | }; | |
1560 | ||
1561 | /* Number of Lisp strings in a string_block structure. The 1020 is | |
1562 | 1024 minus malloc overhead. */ | |
1563 | ||
19bcad1f | 1564 | #define STRING_BLOCK_SIZE \ |
2e471eb5 GM |
1565 | ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String)) |
1566 | ||
1567 | /* Structure describing a block from which Lisp_String structures | |
1568 | are allocated. */ | |
1569 | ||
1570 | struct string_block | |
7146af97 | 1571 | { |
6b61353c | 1572 | /* Place `strings' first, to preserve alignment. */ |
19bcad1f | 1573 | struct Lisp_String strings[STRING_BLOCK_SIZE]; |
6b61353c | 1574 | struct string_block *next; |
2e471eb5 | 1575 | }; |
7146af97 | 1576 | |
2e471eb5 GM |
1577 | /* Head and tail of the list of sblock structures holding Lisp string |
1578 | data. We always allocate from current_sblock. The NEXT pointers | |
1579 | in the sblock structures go from oldest_sblock to current_sblock. */ | |
3c06d205 | 1580 | |
2e471eb5 | 1581 | static struct sblock *oldest_sblock, *current_sblock; |
7146af97 | 1582 | |
2e471eb5 | 1583 | /* List of sblocks for large strings. */ |
7146af97 | 1584 | |
2e471eb5 | 1585 | static struct sblock *large_sblocks; |
7146af97 | 1586 | |
2e471eb5 | 1587 | /* List of string_block structures, and how many there are. */ |
7146af97 | 1588 | |
2e471eb5 GM |
1589 | static struct string_block *string_blocks; |
1590 | static int n_string_blocks; | |
7146af97 | 1591 | |
2e471eb5 | 1592 | /* Free-list of Lisp_Strings. */ |
7146af97 | 1593 | |
2e471eb5 | 1594 | static struct Lisp_String *string_free_list; |
7146af97 | 1595 | |
2e471eb5 | 1596 | /* Number of live and free Lisp_Strings. */ |
c8099634 | 1597 | |
2e471eb5 | 1598 | static int total_strings, total_free_strings; |
7146af97 | 1599 | |
2e471eb5 GM |
1600 | /* Number of bytes used by live strings. */ |
1601 | ||
14162469 | 1602 | static EMACS_INT total_string_size; |
2e471eb5 GM |
1603 | |
1604 | /* Given a pointer to a Lisp_String S which is on the free-list | |
1605 | string_free_list, return a pointer to its successor in the | |
1606 | free-list. */ | |
1607 | ||
1608 | #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S)) | |
1609 | ||
1610 | /* Return a pointer to the sdata structure belonging to Lisp string S. | |
1611 | S must be live, i.e. S->data must not be null. S->data is actually | |
1612 | a pointer to the `u.data' member of its sdata structure; the | |
1613 | structure starts at a constant offset in front of that. */ | |
177c0ea7 | 1614 | |
36372bf9 | 1615 | #define SDATA_OF_STRING(S) ((struct sdata *) ((S)->data - SDATA_DATA_OFFSET)) |
31d929e5 | 1616 | |
212f33f1 KS |
1617 | |
1618 | #ifdef GC_CHECK_STRING_OVERRUN | |
bdbed949 KS |
1619 | |
1620 | /* We check for overrun in string data blocks by appending a small | |
1621 | "cookie" after each allocated string data block, and check for the | |
8349069c | 1622 | presence of this cookie during GC. */ |
bdbed949 KS |
1623 | |
1624 | #define GC_STRING_OVERRUN_COOKIE_SIZE 4 | |
bfd1c781 PE |
1625 | static char const string_overrun_cookie[GC_STRING_OVERRUN_COOKIE_SIZE] = |
1626 | { '\xde', '\xad', '\xbe', '\xef' }; | |
bdbed949 | 1627 | |
212f33f1 | 1628 | #else |
bdbed949 | 1629 | #define GC_STRING_OVERRUN_COOKIE_SIZE 0 |
212f33f1 KS |
1630 | #endif |
1631 | ||
2e471eb5 GM |
1632 | /* Value is the size of an sdata structure large enough to hold NBYTES |
1633 | bytes of string data. The value returned includes a terminating | |
1634 | NUL byte, the size of the sdata structure, and padding. */ | |
1635 | ||
31d929e5 GM |
1636 | #ifdef GC_CHECK_STRING_BYTES |
1637 | ||
2e471eb5 | 1638 | #define SDATA_SIZE(NBYTES) \ |
36372bf9 | 1639 | ((SDATA_DATA_OFFSET \ |
2e471eb5 GM |
1640 | + (NBYTES) + 1 \ |
1641 | + sizeof (EMACS_INT) - 1) \ | |
1642 | & ~(sizeof (EMACS_INT) - 1)) | |
1643 | ||
31d929e5 GM |
1644 | #else /* not GC_CHECK_STRING_BYTES */ |
1645 | ||
f2d3008d PE |
1646 | /* The 'max' reserves space for the nbytes union member even when NBYTES + 1 is |
1647 | less than the size of that member. The 'max' is not needed when | |
1648 | SDATA_DATA_OFFSET is a multiple of sizeof (EMACS_INT), because then the | |
1649 | alignment code reserves enough space. */ | |
1650 | ||
1651 | #define SDATA_SIZE(NBYTES) \ | |
1652 | ((SDATA_DATA_OFFSET \ | |
1653 | + (SDATA_DATA_OFFSET % sizeof (EMACS_INT) == 0 \ | |
1654 | ? NBYTES \ | |
1655 | : max (NBYTES, sizeof (EMACS_INT) - 1)) \ | |
1656 | + 1 \ | |
1657 | + sizeof (EMACS_INT) - 1) \ | |
31d929e5 GM |
1658 | & ~(sizeof (EMACS_INT) - 1)) |
1659 | ||
1660 | #endif /* not GC_CHECK_STRING_BYTES */ | |
2e471eb5 | 1661 | |
bdbed949 KS |
1662 | /* Extra bytes to allocate for each string. */ |
1663 | ||
1664 | #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE) | |
1665 | ||
2e471eb5 | 1666 | /* Initialize string allocation. Called from init_alloc_once. */ |
d457598b | 1667 | |
d3d47262 | 1668 | static void |
971de7fb | 1669 | init_strings (void) |
7146af97 | 1670 | { |
2e471eb5 GM |
1671 | total_strings = total_free_strings = total_string_size = 0; |
1672 | oldest_sblock = current_sblock = large_sblocks = NULL; | |
1673 | string_blocks = NULL; | |
1674 | n_string_blocks = 0; | |
1675 | string_free_list = NULL; | |
4d774b0f JB |
1676 | empty_unibyte_string = make_pure_string ("", 0, 0, 0); |
1677 | empty_multibyte_string = make_pure_string ("", 0, 0, 1); | |
7146af97 JB |
1678 | } |
1679 | ||
2e471eb5 | 1680 | |
361b097f GM |
1681 | #ifdef GC_CHECK_STRING_BYTES |
1682 | ||
361b097f GM |
1683 | static int check_string_bytes_count; |
1684 | ||
676a7251 GM |
1685 | #define CHECK_STRING_BYTES(S) STRING_BYTES (S) |
1686 | ||
1687 | ||
1688 | /* Like GC_STRING_BYTES, but with debugging check. */ | |
1689 | ||
14162469 EZ |
1690 | EMACS_INT |
1691 | string_bytes (struct Lisp_String *s) | |
676a7251 | 1692 | { |
14162469 EZ |
1693 | EMACS_INT nbytes = |
1694 | (s->size_byte < 0 ? s->size & ~ARRAY_MARK_FLAG : s->size_byte); | |
1695 | ||
676a7251 GM |
1696 | if (!PURE_POINTER_P (s) |
1697 | && s->data | |
1698 | && nbytes != SDATA_NBYTES (SDATA_OF_STRING (s))) | |
1699 | abort (); | |
1700 | return nbytes; | |
1701 | } | |
177c0ea7 | 1702 | |
2c5bd608 | 1703 | /* Check validity of Lisp strings' string_bytes member in B. */ |
676a7251 | 1704 | |
d3d47262 | 1705 | static void |
d0f4e1f5 | 1706 | check_sblock (struct sblock *b) |
361b097f | 1707 | { |
676a7251 | 1708 | struct sdata *from, *end, *from_end; |
177c0ea7 | 1709 | |
676a7251 | 1710 | end = b->next_free; |
177c0ea7 | 1711 | |
676a7251 | 1712 | for (from = &b->first_data; from < end; from = from_end) |
361b097f | 1713 | { |
676a7251 GM |
1714 | /* Compute the next FROM here because copying below may |
1715 | overwrite data we need to compute it. */ | |
14162469 | 1716 | EMACS_INT nbytes; |
177c0ea7 | 1717 | |
676a7251 GM |
1718 | /* Check that the string size recorded in the string is the |
1719 | same as the one recorded in the sdata structure. */ | |
1720 | if (from->string) | |
1721 | CHECK_STRING_BYTES (from->string); | |
177c0ea7 | 1722 | |
676a7251 GM |
1723 | if (from->string) |
1724 | nbytes = GC_STRING_BYTES (from->string); | |
1725 | else | |
1726 | nbytes = SDATA_NBYTES (from); | |
177c0ea7 | 1727 | |
676a7251 | 1728 | nbytes = SDATA_SIZE (nbytes); |
212f33f1 | 1729 | from_end = (struct sdata *) ((char *) from + nbytes + GC_STRING_EXTRA); |
676a7251 GM |
1730 | } |
1731 | } | |
361b097f | 1732 | |
676a7251 GM |
1733 | |
1734 | /* Check validity of Lisp strings' string_bytes member. ALL_P | |
1735 | non-zero means check all strings, otherwise check only most | |
1736 | recently allocated strings. Used for hunting a bug. */ | |
1737 | ||
d3d47262 | 1738 | static void |
d0f4e1f5 | 1739 | check_string_bytes (int all_p) |
676a7251 GM |
1740 | { |
1741 | if (all_p) | |
1742 | { | |
1743 | struct sblock *b; | |
1744 | ||
1745 | for (b = large_sblocks; b; b = b->next) | |
1746 | { | |
1747 | struct Lisp_String *s = b->first_data.string; | |
1748 | if (s) | |
1749 | CHECK_STRING_BYTES (s); | |
361b097f | 1750 | } |
177c0ea7 | 1751 | |
676a7251 GM |
1752 | for (b = oldest_sblock; b; b = b->next) |
1753 | check_sblock (b); | |
361b097f | 1754 | } |
676a7251 GM |
1755 | else |
1756 | check_sblock (current_sblock); | |
361b097f GM |
1757 | } |
1758 | ||
1759 | #endif /* GC_CHECK_STRING_BYTES */ | |
1760 | ||
212f33f1 KS |
1761 | #ifdef GC_CHECK_STRING_FREE_LIST |
1762 | ||
bdbed949 KS |
1763 | /* Walk through the string free list looking for bogus next pointers. |
1764 | This may catch buffer overrun from a previous string. */ | |
1765 | ||
212f33f1 | 1766 | static void |
d0f4e1f5 | 1767 | check_string_free_list (void) |
212f33f1 KS |
1768 | { |
1769 | struct Lisp_String *s; | |
1770 | ||
1771 | /* Pop a Lisp_String off the free-list. */ | |
1772 | s = string_free_list; | |
1773 | while (s != NULL) | |
1774 | { | |
14162469 | 1775 | if ((unsigned long)s < 1024) |
212f33f1 KS |
1776 | abort(); |
1777 | s = NEXT_FREE_LISP_STRING (s); | |
1778 | } | |
1779 | } | |
1780 | #else | |
1781 | #define check_string_free_list() | |
1782 | #endif | |
361b097f | 1783 | |
2e471eb5 GM |
1784 | /* Return a new Lisp_String. */ |
1785 | ||
1786 | static struct Lisp_String * | |
971de7fb | 1787 | allocate_string (void) |
7146af97 | 1788 | { |
2e471eb5 | 1789 | struct Lisp_String *s; |
7146af97 | 1790 | |
e2984df0 CY |
1791 | /* eassert (!handling_signal); */ |
1792 | ||
dafc79fa | 1793 | MALLOC_BLOCK_INPUT; |
cfb2f32e | 1794 | |
2e471eb5 GM |
1795 | /* If the free-list is empty, allocate a new string_block, and |
1796 | add all the Lisp_Strings in it to the free-list. */ | |
1797 | if (string_free_list == NULL) | |
7146af97 | 1798 | { |
2e471eb5 GM |
1799 | struct string_block *b; |
1800 | int i; | |
1801 | ||
34400008 | 1802 | b = (struct string_block *) lisp_malloc (sizeof *b, MEM_TYPE_STRING); |
72af86bd | 1803 | memset (b, 0, sizeof *b); |
2e471eb5 GM |
1804 | b->next = string_blocks; |
1805 | string_blocks = b; | |
1806 | ++n_string_blocks; | |
1807 | ||
19bcad1f | 1808 | for (i = STRING_BLOCK_SIZE - 1; i >= 0; --i) |
7146af97 | 1809 | { |
2e471eb5 GM |
1810 | s = b->strings + i; |
1811 | NEXT_FREE_LISP_STRING (s) = string_free_list; | |
1812 | string_free_list = s; | |
7146af97 | 1813 | } |
2e471eb5 | 1814 | |
19bcad1f | 1815 | total_free_strings += STRING_BLOCK_SIZE; |
7146af97 | 1816 | } |
c0f51373 | 1817 | |
bdbed949 | 1818 | check_string_free_list (); |
212f33f1 | 1819 | |
2e471eb5 GM |
1820 | /* Pop a Lisp_String off the free-list. */ |
1821 | s = string_free_list; | |
1822 | string_free_list = NEXT_FREE_LISP_STRING (s); | |
c0f51373 | 1823 | |
dafc79fa | 1824 | MALLOC_UNBLOCK_INPUT; |
e2984df0 | 1825 | |
2e471eb5 | 1826 | /* Probably not strictly necessary, but play it safe. */ |
72af86bd | 1827 | memset (s, 0, sizeof *s); |
c0f51373 | 1828 | |
2e471eb5 GM |
1829 | --total_free_strings; |
1830 | ++total_strings; | |
1831 | ++strings_consed; | |
1832 | consing_since_gc += sizeof *s; | |
c0f51373 | 1833 | |
361b097f | 1834 | #ifdef GC_CHECK_STRING_BYTES |
e39a993c | 1835 | if (!noninteractive) |
361b097f | 1836 | { |
676a7251 GM |
1837 | if (++check_string_bytes_count == 200) |
1838 | { | |
1839 | check_string_bytes_count = 0; | |
1840 | check_string_bytes (1); | |
1841 | } | |
1842 | else | |
1843 | check_string_bytes (0); | |
361b097f | 1844 | } |
676a7251 | 1845 | #endif /* GC_CHECK_STRING_BYTES */ |
361b097f | 1846 | |
2e471eb5 | 1847 | return s; |
c0f51373 | 1848 | } |
7146af97 | 1849 | |
7146af97 | 1850 | |
2e471eb5 GM |
1851 | /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes, |
1852 | plus a NUL byte at the end. Allocate an sdata structure for S, and | |
1853 | set S->data to its `u.data' member. Store a NUL byte at the end of | |
1854 | S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free | |
1855 | S->data if it was initially non-null. */ | |
7146af97 | 1856 | |
2e471eb5 | 1857 | void |
413d18e7 EZ |
1858 | allocate_string_data (struct Lisp_String *s, |
1859 | EMACS_INT nchars, EMACS_INT nbytes) | |
7146af97 | 1860 | { |
5c5fecb3 | 1861 | struct sdata *data, *old_data; |
2e471eb5 | 1862 | struct sblock *b; |
14162469 | 1863 | EMACS_INT needed, old_nbytes; |
7146af97 | 1864 | |
2e471eb5 GM |
1865 | /* Determine the number of bytes needed to store NBYTES bytes |
1866 | of string data. */ | |
1867 | needed = SDATA_SIZE (nbytes); | |
e2984df0 CY |
1868 | old_data = s->data ? SDATA_OF_STRING (s) : NULL; |
1869 | old_nbytes = GC_STRING_BYTES (s); | |
1870 | ||
dafc79fa | 1871 | MALLOC_BLOCK_INPUT; |
7146af97 | 1872 | |
2e471eb5 GM |
1873 | if (nbytes > LARGE_STRING_BYTES) |
1874 | { | |
36372bf9 | 1875 | size_t size = offsetof (struct sblock, first_data) + needed; |
2e471eb5 GM |
1876 | |
1877 | #ifdef DOUG_LEA_MALLOC | |
f8608968 GM |
1878 | /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed |
1879 | because mapped region contents are not preserved in | |
d36b182f DL |
1880 | a dumped Emacs. |
1881 | ||
1882 | In case you think of allowing it in a dumped Emacs at the | |
1883 | cost of not being able to re-dump, there's another reason: | |
1884 | mmap'ed data typically have an address towards the top of the | |
1885 | address space, which won't fit into an EMACS_INT (at least on | |
1886 | 32-bit systems with the current tagging scheme). --fx */ | |
2e471eb5 GM |
1887 | mallopt (M_MMAP_MAX, 0); |
1888 | #endif | |
1889 | ||
212f33f1 | 1890 | b = (struct sblock *) lisp_malloc (size + GC_STRING_EXTRA, MEM_TYPE_NON_LISP); |
177c0ea7 | 1891 | |
2e471eb5 GM |
1892 | #ifdef DOUG_LEA_MALLOC |
1893 | /* Back to a reasonable maximum of mmap'ed areas. */ | |
1894 | mallopt (M_MMAP_MAX, MMAP_MAX_AREAS); | |
1895 | #endif | |
177c0ea7 | 1896 | |
2e471eb5 GM |
1897 | b->next_free = &b->first_data; |
1898 | b->first_data.string = NULL; | |
1899 | b->next = large_sblocks; | |
1900 | large_sblocks = b; | |
1901 | } | |
1902 | else if (current_sblock == NULL | |
1903 | || (((char *) current_sblock + SBLOCK_SIZE | |
1904 | - (char *) current_sblock->next_free) | |
212f33f1 | 1905 | < (needed + GC_STRING_EXTRA))) |
2e471eb5 GM |
1906 | { |
1907 | /* Not enough room in the current sblock. */ | |
34400008 | 1908 | b = (struct sblock *) lisp_malloc (SBLOCK_SIZE, MEM_TYPE_NON_LISP); |
2e471eb5 GM |
1909 | b->next_free = &b->first_data; |
1910 | b->first_data.string = NULL; | |
1911 | b->next = NULL; | |
1912 | ||
1913 | if (current_sblock) | |
1914 | current_sblock->next = b; | |
1915 | else | |
1916 | oldest_sblock = b; | |
1917 | current_sblock = b; | |
1918 | } | |
1919 | else | |
1920 | b = current_sblock; | |
5c5fecb3 | 1921 | |
2e471eb5 | 1922 | data = b->next_free; |
a0b08700 CY |
1923 | b->next_free = (struct sdata *) ((char *) data + needed + GC_STRING_EXTRA); |
1924 | ||
dafc79fa | 1925 | MALLOC_UNBLOCK_INPUT; |
e2984df0 | 1926 | |
2e471eb5 | 1927 | data->string = s; |
31d929e5 GM |
1928 | s->data = SDATA_DATA (data); |
1929 | #ifdef GC_CHECK_STRING_BYTES | |
1930 | SDATA_NBYTES (data) = nbytes; | |
1931 | #endif | |
2e471eb5 GM |
1932 | s->size = nchars; |
1933 | s->size_byte = nbytes; | |
1934 | s->data[nbytes] = '\0'; | |
212f33f1 | 1935 | #ifdef GC_CHECK_STRING_OVERRUN |
000098c1 PE |
1936 | memcpy ((char *) data + needed, string_overrun_cookie, |
1937 | GC_STRING_OVERRUN_COOKIE_SIZE); | |
212f33f1 | 1938 | #endif |
177c0ea7 | 1939 | |
5c5fecb3 GM |
1940 | /* If S had already data assigned, mark that as free by setting its |
1941 | string back-pointer to null, and recording the size of the data | |
00c9c33c | 1942 | in it. */ |
5c5fecb3 GM |
1943 | if (old_data) |
1944 | { | |
31d929e5 | 1945 | SDATA_NBYTES (old_data) = old_nbytes; |
5c5fecb3 GM |
1946 | old_data->string = NULL; |
1947 | } | |
1948 | ||
2e471eb5 GM |
1949 | consing_since_gc += needed; |
1950 | } | |
1951 | ||
1952 | ||
1953 | /* Sweep and compact strings. */ | |
1954 | ||
1955 | static void | |
971de7fb | 1956 | sweep_strings (void) |
2e471eb5 GM |
1957 | { |
1958 | struct string_block *b, *next; | |
1959 | struct string_block *live_blocks = NULL; | |
177c0ea7 | 1960 | |
2e471eb5 GM |
1961 | string_free_list = NULL; |
1962 | total_strings = total_free_strings = 0; | |
1963 | total_string_size = 0; | |
1964 | ||
1965 | /* Scan strings_blocks, free Lisp_Strings that aren't marked. */ | |
1966 | for (b = string_blocks; b; b = next) | |
1967 | { | |
1968 | int i, nfree = 0; | |
1969 | struct Lisp_String *free_list_before = string_free_list; | |
1970 | ||
1971 | next = b->next; | |
1972 | ||
19bcad1f | 1973 | for (i = 0; i < STRING_BLOCK_SIZE; ++i) |
2e471eb5 GM |
1974 | { |
1975 | struct Lisp_String *s = b->strings + i; | |
1976 | ||
1977 | if (s->data) | |
1978 | { | |
1979 | /* String was not on free-list before. */ | |
1980 | if (STRING_MARKED_P (s)) | |
1981 | { | |
1982 | /* String is live; unmark it and its intervals. */ | |
1983 | UNMARK_STRING (s); | |
177c0ea7 | 1984 | |
2e471eb5 GM |
1985 | if (!NULL_INTERVAL_P (s->intervals)) |
1986 | UNMARK_BALANCE_INTERVALS (s->intervals); | |
1987 | ||
1988 | ++total_strings; | |
1989 | total_string_size += STRING_BYTES (s); | |
1990 | } | |
1991 | else | |
1992 | { | |
1993 | /* String is dead. Put it on the free-list. */ | |
1994 | struct sdata *data = SDATA_OF_STRING (s); | |
1995 | ||
1996 | /* Save the size of S in its sdata so that we know | |
1997 | how large that is. Reset the sdata's string | |
1998 | back-pointer so that we know it's free. */ | |
31d929e5 GM |
1999 | #ifdef GC_CHECK_STRING_BYTES |
2000 | if (GC_STRING_BYTES (s) != SDATA_NBYTES (data)) | |
2001 | abort (); | |
2002 | #else | |
2e471eb5 | 2003 | data->u.nbytes = GC_STRING_BYTES (s); |
31d929e5 | 2004 | #endif |
2e471eb5 GM |
2005 | data->string = NULL; |
2006 | ||
2007 | /* Reset the strings's `data' member so that we | |
2008 | know it's free. */ | |
2009 | s->data = NULL; | |
2010 | ||
2011 | /* Put the string on the free-list. */ | |
2012 | NEXT_FREE_LISP_STRING (s) = string_free_list; | |
2013 | string_free_list = s; | |
2014 | ++nfree; | |
2015 | } | |
2016 | } | |
2017 | else | |
2018 | { | |
2019 | /* S was on the free-list before. Put it there again. */ | |
2020 | NEXT_FREE_LISP_STRING (s) = string_free_list; | |
2021 | string_free_list = s; | |
2022 | ++nfree; | |
2023 | } | |
2024 | } | |
2025 | ||
34400008 | 2026 | /* Free blocks that contain free Lisp_Strings only, except |
2e471eb5 | 2027 | the first two of them. */ |
19bcad1f SM |
2028 | if (nfree == STRING_BLOCK_SIZE |
2029 | && total_free_strings > STRING_BLOCK_SIZE) | |
2e471eb5 GM |
2030 | { |
2031 | lisp_free (b); | |
2032 | --n_string_blocks; | |
2033 | string_free_list = free_list_before; | |
2034 | } | |
2035 | else | |
2036 | { | |
2037 | total_free_strings += nfree; | |
2038 | b->next = live_blocks; | |
2039 | live_blocks = b; | |
2040 | } | |
2041 | } | |
2042 | ||
bdbed949 | 2043 | check_string_free_list (); |
212f33f1 | 2044 | |
2e471eb5 GM |
2045 | string_blocks = live_blocks; |
2046 | free_large_strings (); | |
2047 | compact_small_strings (); | |
212f33f1 | 2048 | |
bdbed949 | 2049 | check_string_free_list (); |
2e471eb5 GM |
2050 | } |
2051 | ||
2052 | ||
2053 | /* Free dead large strings. */ | |
2054 | ||
2055 | static void | |
971de7fb | 2056 | free_large_strings (void) |
2e471eb5 GM |
2057 | { |
2058 | struct sblock *b, *next; | |
2059 | struct sblock *live_blocks = NULL; | |
177c0ea7 | 2060 | |
2e471eb5 GM |
2061 | for (b = large_sblocks; b; b = next) |
2062 | { | |
2063 | next = b->next; | |
2064 | ||
2065 | if (b->first_data.string == NULL) | |
2066 | lisp_free (b); | |
2067 | else | |
2068 | { | |
2069 | b->next = live_blocks; | |
2070 | live_blocks = b; | |
2071 | } | |
2072 | } | |
2073 | ||
2074 | large_sblocks = live_blocks; | |
2075 | } | |
2076 | ||
2077 | ||
2078 | /* Compact data of small strings. Free sblocks that don't contain | |
2079 | data of live strings after compaction. */ | |
2080 | ||
2081 | static void | |
971de7fb | 2082 | compact_small_strings (void) |
2e471eb5 GM |
2083 | { |
2084 | struct sblock *b, *tb, *next; | |
2085 | struct sdata *from, *to, *end, *tb_end; | |
2086 | struct sdata *to_end, *from_end; | |
2087 | ||
2088 | /* TB is the sblock we copy to, TO is the sdata within TB we copy | |
2089 | to, and TB_END is the end of TB. */ | |
2090 | tb = oldest_sblock; | |
2091 | tb_end = (struct sdata *) ((char *) tb + SBLOCK_SIZE); | |
2092 | to = &tb->first_data; | |
2093 | ||
2094 | /* Step through the blocks from the oldest to the youngest. We | |
2095 | expect that old blocks will stabilize over time, so that less | |
2096 | copying will happen this way. */ | |
2097 | for (b = oldest_sblock; b; b = b->next) | |
2098 | { | |
2099 | end = b->next_free; | |
2100 | xassert ((char *) end <= (char *) b + SBLOCK_SIZE); | |
177c0ea7 | 2101 | |
2e471eb5 GM |
2102 | for (from = &b->first_data; from < end; from = from_end) |
2103 | { | |
2104 | /* Compute the next FROM here because copying below may | |
2105 | overwrite data we need to compute it. */ | |
14162469 | 2106 | EMACS_INT nbytes; |
2e471eb5 | 2107 | |
31d929e5 GM |
2108 | #ifdef GC_CHECK_STRING_BYTES |
2109 | /* Check that the string size recorded in the string is the | |
2110 | same as the one recorded in the sdata structure. */ | |
2111 | if (from->string | |
2112 | && GC_STRING_BYTES (from->string) != SDATA_NBYTES (from)) | |
2113 | abort (); | |
2114 | #endif /* GC_CHECK_STRING_BYTES */ | |
177c0ea7 | 2115 | |
2e471eb5 GM |
2116 | if (from->string) |
2117 | nbytes = GC_STRING_BYTES (from->string); | |
2118 | else | |
31d929e5 | 2119 | nbytes = SDATA_NBYTES (from); |
177c0ea7 | 2120 | |
212f33f1 KS |
2121 | if (nbytes > LARGE_STRING_BYTES) |
2122 | abort (); | |
212f33f1 | 2123 | |
2e471eb5 | 2124 | nbytes = SDATA_SIZE (nbytes); |
212f33f1 KS |
2125 | from_end = (struct sdata *) ((char *) from + nbytes + GC_STRING_EXTRA); |
2126 | ||
2127 | #ifdef GC_CHECK_STRING_OVERRUN | |
72af86bd AS |
2128 | if (memcmp (string_overrun_cookie, |
2129 | (char *) from_end - GC_STRING_OVERRUN_COOKIE_SIZE, | |
2130 | GC_STRING_OVERRUN_COOKIE_SIZE)) | |
212f33f1 KS |
2131 | abort (); |
2132 | #endif | |
177c0ea7 | 2133 | |
2e471eb5 GM |
2134 | /* FROM->string non-null means it's alive. Copy its data. */ |
2135 | if (from->string) | |
2136 | { | |
2137 | /* If TB is full, proceed with the next sblock. */ | |
212f33f1 | 2138 | to_end = (struct sdata *) ((char *) to + nbytes + GC_STRING_EXTRA); |
2e471eb5 GM |
2139 | if (to_end > tb_end) |
2140 | { | |
2141 | tb->next_free = to; | |
2142 | tb = tb->next; | |
2143 | tb_end = (struct sdata *) ((char *) tb + SBLOCK_SIZE); | |
2144 | to = &tb->first_data; | |
212f33f1 | 2145 | to_end = (struct sdata *) ((char *) to + nbytes + GC_STRING_EXTRA); |
2e471eb5 | 2146 | } |
177c0ea7 | 2147 | |
2e471eb5 GM |
2148 | /* Copy, and update the string's `data' pointer. */ |
2149 | if (from != to) | |
2150 | { | |
3c616cfa | 2151 | xassert (tb != b || to < from); |
72af86bd | 2152 | memmove (to, from, nbytes + GC_STRING_EXTRA); |
31d929e5 | 2153 | to->string->data = SDATA_DATA (to); |
2e471eb5 GM |
2154 | } |
2155 | ||
2156 | /* Advance past the sdata we copied to. */ | |
2157 | to = to_end; | |
2158 | } | |
2159 | } | |
2160 | } | |
2161 | ||
2162 | /* The rest of the sblocks following TB don't contain live data, so | |
2163 | we can free them. */ | |
2164 | for (b = tb->next; b; b = next) | |
2165 | { | |
2166 | next = b->next; | |
2167 | lisp_free (b); | |
2168 | } | |
2169 | ||
2170 | tb->next_free = to; | |
2171 | tb->next = NULL; | |
2172 | current_sblock = tb; | |
2173 | } | |
2174 | ||
2175 | ||
a7ca3326 | 2176 | DEFUN ("make-string", Fmake_string, Smake_string, 2, 2, 0, |
69623621 RS |
2177 | doc: /* Return a newly created string of length LENGTH, with INIT in each element. |
2178 | LENGTH must be an integer. | |
2179 | INIT must be an integer that represents a character. */) | |
5842a27b | 2180 | (Lisp_Object length, Lisp_Object init) |
2e471eb5 GM |
2181 | { |
2182 | register Lisp_Object val; | |
2183 | register unsigned char *p, *end; | |
14162469 EZ |
2184 | int c; |
2185 | EMACS_INT nbytes; | |
2e471eb5 | 2186 | |
b7826503 PJ |
2187 | CHECK_NATNUM (length); |
2188 | CHECK_NUMBER (init); | |
2e471eb5 GM |
2189 | |
2190 | c = XINT (init); | |
830ff83b | 2191 | if (ASCII_CHAR_P (c)) |
2e471eb5 GM |
2192 | { |
2193 | nbytes = XINT (length); | |
2194 | val = make_uninit_string (nbytes); | |
d5db4077 KR |
2195 | p = SDATA (val); |
2196 | end = p + SCHARS (val); | |
2e471eb5 GM |
2197 | while (p != end) |
2198 | *p++ = c; | |
2199 | } | |
2200 | else | |
2201 | { | |
d942b71c | 2202 | unsigned char str[MAX_MULTIBYTE_LENGTH]; |
2e471eb5 | 2203 | int len = CHAR_STRING (c, str); |
14162469 | 2204 | EMACS_INT string_len = XINT (length); |
2e471eb5 | 2205 | |
14162469 EZ |
2206 | if (string_len > MOST_POSITIVE_FIXNUM / len) |
2207 | error ("Maximum string size exceeded"); | |
2208 | nbytes = len * string_len; | |
2209 | val = make_uninit_multibyte_string (string_len, nbytes); | |
d5db4077 | 2210 | p = SDATA (val); |
2e471eb5 GM |
2211 | end = p + nbytes; |
2212 | while (p != end) | |
2213 | { | |
72af86bd | 2214 | memcpy (p, str, len); |
2e471eb5 GM |
2215 | p += len; |
2216 | } | |
2217 | } | |
177c0ea7 | 2218 | |
2e471eb5 GM |
2219 | *p = 0; |
2220 | return val; | |
2221 | } | |
2222 | ||
2223 | ||
a7ca3326 | 2224 | DEFUN ("make-bool-vector", Fmake_bool_vector, Smake_bool_vector, 2, 2, 0, |
909e3b33 | 2225 | doc: /* Return a new bool-vector of length LENGTH, using INIT for each element. |
7ee72033 | 2226 | LENGTH must be a number. INIT matters only in whether it is t or nil. */) |
5842a27b | 2227 | (Lisp_Object length, Lisp_Object init) |
2e471eb5 GM |
2228 | { |
2229 | register Lisp_Object val; | |
2230 | struct Lisp_Bool_Vector *p; | |
2231 | int real_init, i; | |
14162469 EZ |
2232 | EMACS_INT length_in_chars, length_in_elts; |
2233 | int bits_per_value; | |
2e471eb5 | 2234 | |
b7826503 | 2235 | CHECK_NATNUM (length); |
2e471eb5 | 2236 | |
a097329f | 2237 | bits_per_value = sizeof (EMACS_INT) * BOOL_VECTOR_BITS_PER_CHAR; |
2e471eb5 GM |
2238 | |
2239 | length_in_elts = (XFASTINT (length) + bits_per_value - 1) / bits_per_value; | |
a097329f AS |
2240 | length_in_chars = ((XFASTINT (length) + BOOL_VECTOR_BITS_PER_CHAR - 1) |
2241 | / BOOL_VECTOR_BITS_PER_CHAR); | |
2e471eb5 GM |
2242 | |
2243 | /* We must allocate one more elements than LENGTH_IN_ELTS for the | |
2244 | slot `size' of the struct Lisp_Bool_Vector. */ | |
2245 | val = Fmake_vector (make_number (length_in_elts + 1), Qnil); | |
177c0ea7 | 2246 | |
eab3844f PE |
2247 | /* No Lisp_Object to trace in there. */ |
2248 | XSETPVECTYPESIZE (XVECTOR (val), PVEC_BOOL_VECTOR, 0); | |
d2029e5b SM |
2249 | |
2250 | p = XBOOL_VECTOR (val); | |
2e471eb5 | 2251 | p->size = XFASTINT (length); |
177c0ea7 | 2252 | |
2e471eb5 GM |
2253 | real_init = (NILP (init) ? 0 : -1); |
2254 | for (i = 0; i < length_in_chars ; i++) | |
2255 | p->data[i] = real_init; | |
177c0ea7 | 2256 | |
2e471eb5 | 2257 | /* Clear the extraneous bits in the last byte. */ |
a097329f | 2258 | if (XINT (length) != length_in_chars * BOOL_VECTOR_BITS_PER_CHAR) |
d2029e5b | 2259 | p->data[length_in_chars - 1] |
a097329f | 2260 | &= (1 << (XINT (length) % BOOL_VECTOR_BITS_PER_CHAR)) - 1; |
2e471eb5 GM |
2261 | |
2262 | return val; | |
2263 | } | |
2264 | ||
2265 | ||
2266 | /* Make a string from NBYTES bytes at CONTENTS, and compute the number | |
2267 | of characters from the contents. This string may be unibyte or | |
2268 | multibyte, depending on the contents. */ | |
2269 | ||
2270 | Lisp_Object | |
14162469 | 2271 | make_string (const char *contents, EMACS_INT nbytes) |
2e471eb5 GM |
2272 | { |
2273 | register Lisp_Object val; | |
14162469 | 2274 | EMACS_INT nchars, multibyte_nbytes; |
9eac9d59 | 2275 | |
90256841 PE |
2276 | parse_str_as_multibyte ((const unsigned char *) contents, nbytes, |
2277 | &nchars, &multibyte_nbytes); | |
9eac9d59 KH |
2278 | if (nbytes == nchars || nbytes != multibyte_nbytes) |
2279 | /* CONTENTS contains no multibyte sequences or contains an invalid | |
2280 | multibyte sequence. We must make unibyte string. */ | |
495a6df3 KH |
2281 | val = make_unibyte_string (contents, nbytes); |
2282 | else | |
2283 | val = make_multibyte_string (contents, nchars, nbytes); | |
2e471eb5 GM |
2284 | return val; |
2285 | } | |
2286 | ||
2287 | ||
2288 | /* Make an unibyte string from LENGTH bytes at CONTENTS. */ | |
2289 | ||
2290 | Lisp_Object | |
14162469 | 2291 | make_unibyte_string (const char *contents, EMACS_INT length) |
2e471eb5 GM |
2292 | { |
2293 | register Lisp_Object val; | |
2294 | val = make_uninit_string (length); | |
72af86bd | 2295 | memcpy (SDATA (val), contents, length); |
2e471eb5 GM |
2296 | return val; |
2297 | } | |
2298 | ||
2299 | ||
2300 | /* Make a multibyte string from NCHARS characters occupying NBYTES | |
2301 | bytes at CONTENTS. */ | |
2302 | ||
2303 | Lisp_Object | |
14162469 EZ |
2304 | make_multibyte_string (const char *contents, |
2305 | EMACS_INT nchars, EMACS_INT nbytes) | |
2e471eb5 GM |
2306 | { |
2307 | register Lisp_Object val; | |
2308 | val = make_uninit_multibyte_string (nchars, nbytes); | |
72af86bd | 2309 | memcpy (SDATA (val), contents, nbytes); |
2e471eb5 GM |
2310 | return val; |
2311 | } | |
2312 | ||
2313 | ||
2314 | /* Make a string from NCHARS characters occupying NBYTES bytes at | |
2315 | CONTENTS. It is a multibyte string if NBYTES != NCHARS. */ | |
2316 | ||
2317 | Lisp_Object | |
14162469 EZ |
2318 | make_string_from_bytes (const char *contents, |
2319 | EMACS_INT nchars, EMACS_INT nbytes) | |
2e471eb5 GM |
2320 | { |
2321 | register Lisp_Object val; | |
2322 | val = make_uninit_multibyte_string (nchars, nbytes); | |
72af86bd | 2323 | memcpy (SDATA (val), contents, nbytes); |
d5db4077 KR |
2324 | if (SBYTES (val) == SCHARS (val)) |
2325 | STRING_SET_UNIBYTE (val); | |
2e471eb5 GM |
2326 | return val; |
2327 | } | |
2328 | ||
2329 | ||
2330 | /* Make a string from NCHARS characters occupying NBYTES bytes at | |
2331 | CONTENTS. The argument MULTIBYTE controls whether to label the | |
229b28c4 KH |
2332 | string as multibyte. If NCHARS is negative, it counts the number of |
2333 | characters by itself. */ | |
2e471eb5 GM |
2334 | |
2335 | Lisp_Object | |
14162469 EZ |
2336 | make_specified_string (const char *contents, |
2337 | EMACS_INT nchars, EMACS_INT nbytes, int multibyte) | |
2e471eb5 GM |
2338 | { |
2339 | register Lisp_Object val; | |
229b28c4 KH |
2340 | |
2341 | if (nchars < 0) | |
2342 | { | |
2343 | if (multibyte) | |
90256841 PE |
2344 | nchars = multibyte_chars_in_text ((const unsigned char *) contents, |
2345 | nbytes); | |
229b28c4 KH |
2346 | else |
2347 | nchars = nbytes; | |
2348 | } | |
2e471eb5 | 2349 | val = make_uninit_multibyte_string (nchars, nbytes); |
72af86bd | 2350 | memcpy (SDATA (val), contents, nbytes); |
2e471eb5 | 2351 | if (!multibyte) |
d5db4077 | 2352 | STRING_SET_UNIBYTE (val); |
2e471eb5 GM |
2353 | return val; |
2354 | } | |
2355 | ||
2356 | ||
2357 | /* Make a string from the data at STR, treating it as multibyte if the | |
2358 | data warrants. */ | |
2359 | ||
2360 | Lisp_Object | |
971de7fb | 2361 | build_string (const char *str) |
2e471eb5 GM |
2362 | { |
2363 | return make_string (str, strlen (str)); | |
2364 | } | |
2365 | ||
2366 | ||
2367 | /* Return an unibyte Lisp_String set up to hold LENGTH characters | |
2368 | occupying LENGTH bytes. */ | |
2369 | ||
2370 | Lisp_Object | |
413d18e7 | 2371 | make_uninit_string (EMACS_INT length) |
2e471eb5 GM |
2372 | { |
2373 | Lisp_Object val; | |
4d774b0f JB |
2374 | |
2375 | if (!length) | |
2376 | return empty_unibyte_string; | |
2e471eb5 | 2377 | val = make_uninit_multibyte_string (length, length); |
d5db4077 | 2378 | STRING_SET_UNIBYTE (val); |
2e471eb5 GM |
2379 | return val; |
2380 | } | |
2381 | ||
2382 | ||
2383 | /* Return a multibyte Lisp_String set up to hold NCHARS characters | |
2384 | which occupy NBYTES bytes. */ | |
2385 | ||
2386 | Lisp_Object | |
413d18e7 | 2387 | make_uninit_multibyte_string (EMACS_INT nchars, EMACS_INT nbytes) |
2e471eb5 GM |
2388 | { |
2389 | Lisp_Object string; | |
2390 | struct Lisp_String *s; | |
2391 | ||
2392 | if (nchars < 0) | |
2393 | abort (); | |
4d774b0f JB |
2394 | if (!nbytes) |
2395 | return empty_multibyte_string; | |
2e471eb5 GM |
2396 | |
2397 | s = allocate_string (); | |
2398 | allocate_string_data (s, nchars, nbytes); | |
2399 | XSETSTRING (string, s); | |
2400 | string_chars_consed += nbytes; | |
2401 | return string; | |
2402 | } | |
2403 | ||
2404 | ||
2405 | \f | |
2406 | /*********************************************************************** | |
2407 | Float Allocation | |
2408 | ***********************************************************************/ | |
2409 | ||
2e471eb5 GM |
2410 | /* We store float cells inside of float_blocks, allocating a new |
2411 | float_block with malloc whenever necessary. Float cells reclaimed | |
2412 | by GC are put on a free list to be reallocated before allocating | |
ab6780cd | 2413 | any new float cells from the latest float_block. */ |
2e471eb5 | 2414 | |
6b61353c KH |
2415 | #define FLOAT_BLOCK_SIZE \ |
2416 | (((BLOCK_BYTES - sizeof (struct float_block *) \ | |
2417 | /* The compiler might add padding at the end. */ \ | |
2418 | - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \ | |
ab6780cd SM |
2419 | / (sizeof (struct Lisp_Float) * CHAR_BIT + 1)) |
2420 | ||
2421 | #define GETMARKBIT(block,n) \ | |
2422 | (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \ | |
2423 | >> ((n) % (sizeof(int) * CHAR_BIT))) \ | |
2424 | & 1) | |
2425 | ||
2426 | #define SETMARKBIT(block,n) \ | |
2427 | (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \ | |
2428 | |= 1 << ((n) % (sizeof(int) * CHAR_BIT)) | |
2429 | ||
2430 | #define UNSETMARKBIT(block,n) \ | |
2431 | (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \ | |
2432 | &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT))) | |
2433 | ||
2434 | #define FLOAT_BLOCK(fptr) \ | |
2435 | ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1))) | |
2436 | ||
2437 | #define FLOAT_INDEX(fptr) \ | |
2438 | ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float)) | |
2e471eb5 GM |
2439 | |
2440 | struct float_block | |
2441 | { | |
ab6780cd | 2442 | /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */ |
2e471eb5 | 2443 | struct Lisp_Float floats[FLOAT_BLOCK_SIZE]; |
ab6780cd SM |
2444 | int gcmarkbits[1 + FLOAT_BLOCK_SIZE / (sizeof(int) * CHAR_BIT)]; |
2445 | struct float_block *next; | |
2e471eb5 GM |
2446 | }; |
2447 | ||
ab6780cd SM |
2448 | #define FLOAT_MARKED_P(fptr) \ |
2449 | GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr))) | |
2450 | ||
2451 | #define FLOAT_MARK(fptr) \ | |
2452 | SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr))) | |
2453 | ||
2454 | #define FLOAT_UNMARK(fptr) \ | |
2455 | UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr))) | |
2456 | ||
34400008 GM |
2457 | /* Current float_block. */ |
2458 | ||
244ed907 | 2459 | static struct float_block *float_block; |
34400008 GM |
2460 | |
2461 | /* Index of first unused Lisp_Float in the current float_block. */ | |
2462 | ||
244ed907 | 2463 | static int float_block_index; |
2e471eb5 GM |
2464 | |
2465 | /* Total number of float blocks now in use. */ | |
2466 | ||
244ed907 | 2467 | static int n_float_blocks; |
2e471eb5 | 2468 | |
34400008 GM |
2469 | /* Free-list of Lisp_Floats. */ |
2470 | ||
244ed907 | 2471 | static struct Lisp_Float *float_free_list; |
2e471eb5 | 2472 | |
34400008 | 2473 | |
966533c9 | 2474 | /* Initialize float allocation. */ |
34400008 | 2475 | |
d3d47262 | 2476 | static void |
971de7fb | 2477 | init_float (void) |
2e471eb5 | 2478 | { |
08b7c2cb SM |
2479 | float_block = NULL; |
2480 | float_block_index = FLOAT_BLOCK_SIZE; /* Force alloc of new float_block. */ | |
2e471eb5 | 2481 | float_free_list = 0; |
08b7c2cb | 2482 | n_float_blocks = 0; |
2e471eb5 GM |
2483 | } |
2484 | ||
34400008 | 2485 | |
34400008 GM |
2486 | /* Return a new float object with value FLOAT_VALUE. */ |
2487 | ||
2e471eb5 | 2488 | Lisp_Object |
971de7fb | 2489 | make_float (double float_value) |
2e471eb5 GM |
2490 | { |
2491 | register Lisp_Object val; | |
2492 | ||
e2984df0 CY |
2493 | /* eassert (!handling_signal); */ |
2494 | ||
dafc79fa | 2495 | MALLOC_BLOCK_INPUT; |
cfb2f32e | 2496 | |
2e471eb5 GM |
2497 | if (float_free_list) |
2498 | { | |
2499 | /* We use the data field for chaining the free list | |
2500 | so that we won't use the same field that has the mark bit. */ | |
2501 | XSETFLOAT (val, float_free_list); | |
28a099a4 | 2502 | float_free_list = float_free_list->u.chain; |
2e471eb5 GM |
2503 | } |
2504 | else | |
2505 | { | |
2506 | if (float_block_index == FLOAT_BLOCK_SIZE) | |
2507 | { | |
2508 | register struct float_block *new; | |
2509 | ||
ab6780cd SM |
2510 | new = (struct float_block *) lisp_align_malloc (sizeof *new, |
2511 | MEM_TYPE_FLOAT); | |
2e471eb5 | 2512 | new->next = float_block; |
72af86bd | 2513 | memset (new->gcmarkbits, 0, sizeof new->gcmarkbits); |
2e471eb5 GM |
2514 | float_block = new; |
2515 | float_block_index = 0; | |
2516 | n_float_blocks++; | |
2517 | } | |
6b61353c KH |
2518 | XSETFLOAT (val, &float_block->floats[float_block_index]); |
2519 | float_block_index++; | |
2e471eb5 | 2520 | } |
177c0ea7 | 2521 | |
dafc79fa | 2522 | MALLOC_UNBLOCK_INPUT; |
e2984df0 | 2523 | |
f601cdf3 | 2524 | XFLOAT_INIT (val, float_value); |
6b61353c | 2525 | eassert (!FLOAT_MARKED_P (XFLOAT (val))); |
2e471eb5 GM |
2526 | consing_since_gc += sizeof (struct Lisp_Float); |
2527 | floats_consed++; | |
2528 | return val; | |
2529 | } | |
2530 | ||
2e471eb5 GM |
2531 | |
2532 | \f | |
2533 | /*********************************************************************** | |
2534 | Cons Allocation | |
2535 | ***********************************************************************/ | |
2536 | ||
2537 | /* We store cons cells inside of cons_blocks, allocating a new | |
2538 | cons_block with malloc whenever necessary. Cons cells reclaimed by | |
2539 | GC are put on a free list to be reallocated before allocating | |
08b7c2cb | 2540 | any new cons cells from the latest cons_block. */ |
2e471eb5 GM |
2541 | |
2542 | #define CONS_BLOCK_SIZE \ | |
08b7c2cb SM |
2543 | (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \ |
2544 | / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1)) | |
2545 | ||
2546 | #define CONS_BLOCK(fptr) \ | |
2547 | ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1))) | |
2548 | ||
2549 | #define CONS_INDEX(fptr) \ | |
2550 | ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons)) | |
2e471eb5 GM |
2551 | |
2552 | struct cons_block | |
2553 | { | |
08b7c2cb | 2554 | /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */ |
2e471eb5 | 2555 | struct Lisp_Cons conses[CONS_BLOCK_SIZE]; |
08b7c2cb SM |
2556 | int gcmarkbits[1 + CONS_BLOCK_SIZE / (sizeof(int) * CHAR_BIT)]; |
2557 | struct cons_block *next; | |
2e471eb5 GM |
2558 | }; |
2559 | ||
08b7c2cb SM |
2560 | #define CONS_MARKED_P(fptr) \ |
2561 | GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr))) | |
2562 | ||
2563 | #define CONS_MARK(fptr) \ | |
2564 | SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr))) | |
2565 | ||
2566 | #define CONS_UNMARK(fptr) \ | |
2567 | UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr))) | |
2568 | ||
34400008 GM |
2569 | /* Current cons_block. */ |
2570 | ||
244ed907 | 2571 | static struct cons_block *cons_block; |
34400008 GM |
2572 | |
2573 | /* Index of first unused Lisp_Cons in the current block. */ | |
2574 | ||
244ed907 | 2575 | static int cons_block_index; |
2e471eb5 | 2576 | |
34400008 GM |
2577 | /* Free-list of Lisp_Cons structures. */ |
2578 | ||
244ed907 | 2579 | static struct Lisp_Cons *cons_free_list; |
2e471eb5 GM |
2580 | |
2581 | /* Total number of cons blocks now in use. */ | |
2582 | ||
d3d47262 | 2583 | static int n_cons_blocks; |
2e471eb5 | 2584 | |
34400008 GM |
2585 | |
2586 | /* Initialize cons allocation. */ | |
2587 | ||
d3d47262 | 2588 | static void |
971de7fb | 2589 | init_cons (void) |
2e471eb5 | 2590 | { |
08b7c2cb SM |
2591 | cons_block = NULL; |
2592 | cons_block_index = CONS_BLOCK_SIZE; /* Force alloc of new cons_block. */ | |
2e471eb5 | 2593 | cons_free_list = 0; |
08b7c2cb | 2594 | n_cons_blocks = 0; |
2e471eb5 GM |
2595 | } |
2596 | ||
34400008 GM |
2597 | |
2598 | /* Explicitly free a cons cell by putting it on the free-list. */ | |
2e471eb5 GM |
2599 | |
2600 | void | |
971de7fb | 2601 | free_cons (struct Lisp_Cons *ptr) |
2e471eb5 | 2602 | { |
28a099a4 | 2603 | ptr->u.chain = cons_free_list; |
34400008 GM |
2604 | #if GC_MARK_STACK |
2605 | ptr->car = Vdead; | |
2606 | #endif | |
2e471eb5 GM |
2607 | cons_free_list = ptr; |
2608 | } | |
2609 | ||
a7ca3326 | 2610 | DEFUN ("cons", Fcons, Scons, 2, 2, 0, |
a6266d23 | 2611 | doc: /* Create a new cons, give it CAR and CDR as components, and return it. */) |
5842a27b | 2612 | (Lisp_Object car, Lisp_Object cdr) |
2e471eb5 GM |
2613 | { |
2614 | register Lisp_Object val; | |
2615 | ||
e2984df0 CY |
2616 | /* eassert (!handling_signal); */ |
2617 | ||
dafc79fa | 2618 | MALLOC_BLOCK_INPUT; |
cfb2f32e | 2619 | |
2e471eb5 GM |
2620 | if (cons_free_list) |
2621 | { | |
2622 | /* We use the cdr for chaining the free list | |
2623 | so that we won't use the same field that has the mark bit. */ | |
2624 | XSETCONS (val, cons_free_list); | |
28a099a4 | 2625 | cons_free_list = cons_free_list->u.chain; |
2e471eb5 GM |
2626 | } |
2627 | else | |
2628 | { | |
2629 | if (cons_block_index == CONS_BLOCK_SIZE) | |
2630 | { | |
2631 | register struct cons_block *new; | |
08b7c2cb SM |
2632 | new = (struct cons_block *) lisp_align_malloc (sizeof *new, |
2633 | MEM_TYPE_CONS); | |
72af86bd | 2634 | memset (new->gcmarkbits, 0, sizeof new->gcmarkbits); |
2e471eb5 GM |
2635 | new->next = cons_block; |
2636 | cons_block = new; | |
2637 | cons_block_index = 0; | |
2638 | n_cons_blocks++; | |
2639 | } | |
6b61353c KH |
2640 | XSETCONS (val, &cons_block->conses[cons_block_index]); |
2641 | cons_block_index++; | |
2e471eb5 | 2642 | } |
177c0ea7 | 2643 | |
dafc79fa | 2644 | MALLOC_UNBLOCK_INPUT; |
e2984df0 | 2645 | |
f3fbd155 KR |
2646 | XSETCAR (val, car); |
2647 | XSETCDR (val, cdr); | |
6b61353c | 2648 | eassert (!CONS_MARKED_P (XCONS (val))); |
2e471eb5 GM |
2649 | consing_since_gc += sizeof (struct Lisp_Cons); |
2650 | cons_cells_consed++; | |
2651 | return val; | |
2652 | } | |
2653 | ||
e5aab7e7 | 2654 | #ifdef GC_CHECK_CONS_LIST |
e3e56238 RS |
2655 | /* Get an error now if there's any junk in the cons free list. */ |
2656 | void | |
971de7fb | 2657 | check_cons_list (void) |
e3e56238 RS |
2658 | { |
2659 | struct Lisp_Cons *tail = cons_free_list; | |
2660 | ||
e3e56238 | 2661 | while (tail) |
28a099a4 | 2662 | tail = tail->u.chain; |
e3e56238 | 2663 | } |
e5aab7e7 | 2664 | #endif |
34400008 | 2665 | |
9b306d37 KS |
2666 | /* Make a list of 1, 2, 3, 4 or 5 specified objects. */ |
2667 | ||
2668 | Lisp_Object | |
971de7fb | 2669 | list1 (Lisp_Object arg1) |
9b306d37 KS |
2670 | { |
2671 | return Fcons (arg1, Qnil); | |
2672 | } | |
2e471eb5 GM |
2673 | |
2674 | Lisp_Object | |
971de7fb | 2675 | list2 (Lisp_Object arg1, Lisp_Object arg2) |
2e471eb5 GM |
2676 | { |
2677 | return Fcons (arg1, Fcons (arg2, Qnil)); | |
2678 | } | |
2679 | ||
34400008 | 2680 | |
2e471eb5 | 2681 | Lisp_Object |
971de7fb | 2682 | list3 (Lisp_Object arg1, Lisp_Object arg2, Lisp_Object arg3) |
2e471eb5 GM |
2683 | { |
2684 | return Fcons (arg1, Fcons (arg2, Fcons (arg3, Qnil))); | |
2685 | } | |
2686 | ||
34400008 | 2687 | |
2e471eb5 | 2688 | Lisp_Object |
971de7fb | 2689 | list4 (Lisp_Object arg1, Lisp_Object arg2, Lisp_Object arg3, Lisp_Object arg4) |
2e471eb5 GM |
2690 | { |
2691 | return Fcons (arg1, Fcons (arg2, Fcons (arg3, Fcons (arg4, Qnil)))); | |
2692 | } | |
2693 | ||
34400008 | 2694 | |
2e471eb5 | 2695 | Lisp_Object |
971de7fb | 2696 | list5 (Lisp_Object arg1, Lisp_Object arg2, Lisp_Object arg3, Lisp_Object arg4, Lisp_Object arg5) |
2e471eb5 GM |
2697 | { |
2698 | return Fcons (arg1, Fcons (arg2, Fcons (arg3, Fcons (arg4, | |
2699 | Fcons (arg5, Qnil))))); | |
2700 | } | |
2701 | ||
34400008 | 2702 | |
a7ca3326 | 2703 | DEFUN ("list", Flist, Slist, 0, MANY, 0, |
eae936e2 | 2704 | doc: /* Return a newly created list with specified arguments as elements. |
ae8e8122 MB |
2705 | Any number of arguments, even zero arguments, are allowed. |
2706 | usage: (list &rest OBJECTS) */) | |
c5101a77 | 2707 | (size_t nargs, register Lisp_Object *args) |
2e471eb5 GM |
2708 | { |
2709 | register Lisp_Object val; | |
2710 | val = Qnil; | |
2711 | ||
2712 | while (nargs > 0) | |
2713 | { | |
2714 | nargs--; | |
2715 | val = Fcons (args[nargs], val); | |
2716 | } | |
2717 | return val; | |
2718 | } | |
2719 | ||
34400008 | 2720 | |
a7ca3326 | 2721 | DEFUN ("make-list", Fmake_list, Smake_list, 2, 2, 0, |
a6266d23 | 2722 | doc: /* Return a newly created list of length LENGTH, with each element being INIT. */) |
5842a27b | 2723 | (register Lisp_Object length, Lisp_Object init) |
2e471eb5 GM |
2724 | { |
2725 | register Lisp_Object val; | |
14162469 | 2726 | register EMACS_INT size; |
2e471eb5 | 2727 | |
b7826503 | 2728 | CHECK_NATNUM (length); |
2e471eb5 GM |
2729 | size = XFASTINT (length); |
2730 | ||
2731 | val = Qnil; | |
ce070307 GM |
2732 | while (size > 0) |
2733 | { | |
2734 | val = Fcons (init, val); | |
2735 | --size; | |
2736 | ||
2737 | if (size > 0) | |
2738 | { | |
2739 | val = Fcons (init, val); | |
2740 | --size; | |
177c0ea7 | 2741 | |
ce070307 GM |
2742 | if (size > 0) |
2743 | { | |
2744 | val = Fcons (init, val); | |
2745 | --size; | |
177c0ea7 | 2746 | |
ce070307 GM |
2747 | if (size > 0) |
2748 | { | |
2749 | val = Fcons (init, val); | |
2750 | --size; | |
177c0ea7 | 2751 | |
ce070307 GM |
2752 | if (size > 0) |
2753 | { | |
2754 | val = Fcons (init, val); | |
2755 | --size; | |
2756 | } | |
2757 | } | |
2758 | } | |
2759 | } | |
2760 | ||
2761 | QUIT; | |
2762 | } | |
177c0ea7 | 2763 | |
7146af97 JB |
2764 | return val; |
2765 | } | |
2e471eb5 GM |
2766 | |
2767 | ||
7146af97 | 2768 | \f |
2e471eb5 GM |
2769 | /*********************************************************************** |
2770 | Vector Allocation | |
2771 | ***********************************************************************/ | |
7146af97 | 2772 | |
34400008 GM |
2773 | /* Singly-linked list of all vectors. */ |
2774 | ||
d3d47262 | 2775 | static struct Lisp_Vector *all_vectors; |
7146af97 | 2776 | |
2e471eb5 GM |
2777 | /* Total number of vector-like objects now in use. */ |
2778 | ||
d3d47262 | 2779 | static int n_vectors; |
c8099634 | 2780 | |
34400008 GM |
2781 | |
2782 | /* Value is a pointer to a newly allocated Lisp_Vector structure | |
2783 | with room for LEN Lisp_Objects. */ | |
2784 | ||
ece93c02 | 2785 | static struct Lisp_Vector * |
971de7fb | 2786 | allocate_vectorlike (EMACS_INT len) |
1825c68d KH |
2787 | { |
2788 | struct Lisp_Vector *p; | |
675d5130 | 2789 | size_t nbytes; |
1825c68d | 2790 | |
dafc79fa SM |
2791 | MALLOC_BLOCK_INPUT; |
2792 | ||
d1658221 | 2793 | #ifdef DOUG_LEA_MALLOC |
f8608968 GM |
2794 | /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed |
2795 | because mapped region contents are not preserved in | |
2796 | a dumped Emacs. */ | |
d1658221 RS |
2797 | mallopt (M_MMAP_MAX, 0); |
2798 | #endif | |
177c0ea7 | 2799 | |
cfb2f32e SM |
2800 | /* This gets triggered by code which I haven't bothered to fix. --Stef */ |
2801 | /* eassert (!handling_signal); */ | |
2802 | ||
36372bf9 PE |
2803 | nbytes = (offsetof (struct Lisp_Vector, contents) |
2804 | + len * sizeof p->contents[0]); | |
9c545a55 | 2805 | p = (struct Lisp_Vector *) lisp_malloc (nbytes, MEM_TYPE_VECTORLIKE); |
177c0ea7 | 2806 | |
d1658221 | 2807 | #ifdef DOUG_LEA_MALLOC |
34400008 | 2808 | /* Back to a reasonable maximum of mmap'ed areas. */ |
81d492d5 | 2809 | mallopt (M_MMAP_MAX, MMAP_MAX_AREAS); |
d1658221 | 2810 | #endif |
177c0ea7 | 2811 | |
34400008 | 2812 | consing_since_gc += nbytes; |
310ea200 | 2813 | vector_cells_consed += len; |
1825c68d | 2814 | |
eab3844f | 2815 | p->header.next.vector = all_vectors; |
1825c68d | 2816 | all_vectors = p; |
e2984df0 | 2817 | |
dafc79fa | 2818 | MALLOC_UNBLOCK_INPUT; |
e2984df0 | 2819 | |
34400008 | 2820 | ++n_vectors; |
1825c68d KH |
2821 | return p; |
2822 | } | |
2823 | ||
34400008 | 2824 | |
ece93c02 GM |
2825 | /* Allocate a vector with NSLOTS slots. */ |
2826 | ||
2827 | struct Lisp_Vector * | |
971de7fb | 2828 | allocate_vector (EMACS_INT nslots) |
ece93c02 | 2829 | { |
9c545a55 | 2830 | struct Lisp_Vector *v = allocate_vectorlike (nslots); |
eab3844f | 2831 | v->header.size = nslots; |
ece93c02 GM |
2832 | return v; |
2833 | } | |
2834 | ||
2835 | ||
2836 | /* Allocate other vector-like structures. */ | |
2837 | ||
30f95089 | 2838 | struct Lisp_Vector * |
971de7fb | 2839 | allocate_pseudovector (int memlen, int lisplen, EMACS_INT tag) |
ece93c02 | 2840 | { |
d2029e5b | 2841 | struct Lisp_Vector *v = allocate_vectorlike (memlen); |
ece93c02 | 2842 | EMACS_INT i; |
177c0ea7 | 2843 | |
d2029e5b | 2844 | /* Only the first lisplen slots will be traced normally by the GC. */ |
d2029e5b | 2845 | for (i = 0; i < lisplen; ++i) |
ece93c02 | 2846 | v->contents[i] = Qnil; |
177c0ea7 | 2847 | |
eab3844f | 2848 | XSETPVECTYPESIZE (v, tag, lisplen); |
d2029e5b SM |
2849 | return v; |
2850 | } | |
d2029e5b | 2851 | |
ece93c02 | 2852 | struct Lisp_Hash_Table * |
878f97ff | 2853 | allocate_hash_table (void) |
ece93c02 | 2854 | { |
878f97ff | 2855 | return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table, count, PVEC_HASH_TABLE); |
ece93c02 GM |
2856 | } |
2857 | ||
2858 | ||
2859 | struct window * | |
971de7fb | 2860 | allocate_window (void) |
ece93c02 | 2861 | { |
d2029e5b | 2862 | return ALLOCATE_PSEUDOVECTOR(struct window, current_matrix, PVEC_WINDOW); |
ece93c02 | 2863 | } |
177c0ea7 | 2864 | |
177c0ea7 | 2865 | |
4a729fd8 | 2866 | struct terminal * |
971de7fb | 2867 | allocate_terminal (void) |
4a729fd8 | 2868 | { |
d2029e5b SM |
2869 | struct terminal *t = ALLOCATE_PSEUDOVECTOR (struct terminal, |
2870 | next_terminal, PVEC_TERMINAL); | |
2871 | /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */ | |
72af86bd AS |
2872 | memset (&t->next_terminal, 0, |
2873 | (char*) (t + 1) - (char*) &t->next_terminal); | |
ece93c02 | 2874 | |
d2029e5b | 2875 | return t; |
4a729fd8 | 2876 | } |
ece93c02 GM |
2877 | |
2878 | struct frame * | |
971de7fb | 2879 | allocate_frame (void) |
ece93c02 | 2880 | { |
d2029e5b SM |
2881 | struct frame *f = ALLOCATE_PSEUDOVECTOR (struct frame, |
2882 | face_cache, PVEC_FRAME); | |
2883 | /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */ | |
72af86bd AS |
2884 | memset (&f->face_cache, 0, |
2885 | (char *) (f + 1) - (char *) &f->face_cache); | |
d2029e5b | 2886 | return f; |
ece93c02 GM |
2887 | } |
2888 | ||
2889 | ||
2890 | struct Lisp_Process * | |
971de7fb | 2891 | allocate_process (void) |
ece93c02 | 2892 | { |
d2029e5b | 2893 | return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process, pid, PVEC_PROCESS); |
ece93c02 GM |
2894 | } |
2895 | ||
2896 | ||
a7ca3326 | 2897 | DEFUN ("make-vector", Fmake_vector, Smake_vector, 2, 2, 0, |
a6266d23 | 2898 | doc: /* Return a newly created vector of length LENGTH, with each element being INIT. |
7ee72033 | 2899 | See also the function `vector'. */) |
5842a27b | 2900 | (register Lisp_Object length, Lisp_Object init) |
7146af97 | 2901 | { |
1825c68d KH |
2902 | Lisp_Object vector; |
2903 | register EMACS_INT sizei; | |
ae35e756 | 2904 | register EMACS_INT i; |
7146af97 JB |
2905 | register struct Lisp_Vector *p; |
2906 | ||
b7826503 | 2907 | CHECK_NATNUM (length); |
c9dad5ed | 2908 | sizei = XFASTINT (length); |
7146af97 | 2909 | |
ece93c02 | 2910 | p = allocate_vector (sizei); |
ae35e756 PE |
2911 | for (i = 0; i < sizei; i++) |
2912 | p->contents[i] = init; | |
7146af97 | 2913 | |
1825c68d | 2914 | XSETVECTOR (vector, p); |
7146af97 JB |
2915 | return vector; |
2916 | } | |
2917 | ||
34400008 | 2918 | |
a7ca3326 | 2919 | DEFUN ("vector", Fvector, Svector, 0, MANY, 0, |
eae936e2 | 2920 | doc: /* Return a newly created vector with specified arguments as elements. |
ae8e8122 MB |
2921 | Any number of arguments, even zero arguments, are allowed. |
2922 | usage: (vector &rest OBJECTS) */) | |
c5101a77 | 2923 | (register size_t nargs, Lisp_Object *args) |
7146af97 JB |
2924 | { |
2925 | register Lisp_Object len, val; | |
c5101a77 | 2926 | register size_t i; |
7146af97 JB |
2927 | register struct Lisp_Vector *p; |
2928 | ||
67ba9986 | 2929 | XSETFASTINT (len, nargs); |
7146af97 JB |
2930 | val = Fmake_vector (len, Qnil); |
2931 | p = XVECTOR (val); | |
ae35e756 PE |
2932 | for (i = 0; i < nargs; i++) |
2933 | p->contents[i] = args[i]; | |
7146af97 JB |
2934 | return val; |
2935 | } | |
2936 | ||
34400008 | 2937 | |
a7ca3326 | 2938 | DEFUN ("make-byte-code", Fmake_byte_code, Smake_byte_code, 4, MANY, 0, |
a6266d23 | 2939 | doc: /* Create a byte-code object with specified arguments as elements. |
e2abe5a1 SM |
2940 | The arguments should be the ARGLIST, bytecode-string BYTE-CODE, constant |
2941 | vector CONSTANTS, maximum stack size DEPTH, (optional) DOCSTRING, | |
2942 | and (optional) INTERACTIVE-SPEC. | |
228299fa | 2943 | The first four arguments are required; at most six have any |
ae8e8122 | 2944 | significance. |
e2abe5a1 SM |
2945 | The ARGLIST can be either like the one of `lambda', in which case the arguments |
2946 | will be dynamically bound before executing the byte code, or it can be an | |
2947 | integer of the form NNNNNNNRMMMMMMM where the 7bit MMMMMMM specifies the | |
2948 | minimum number of arguments, the 7-bit NNNNNNN specifies the maximum number | |
2949 | of arguments (ignoring &rest) and the R bit specifies whether there is a &rest | |
2950 | argument to catch the left-over arguments. If such an integer is used, the | |
2951 | arguments will not be dynamically bound but will be instead pushed on the | |
2952 | stack before executing the byte-code. | |
92cc28b2 | 2953 | usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */) |
c5101a77 | 2954 | (register size_t nargs, Lisp_Object *args) |
7146af97 JB |
2955 | { |
2956 | register Lisp_Object len, val; | |
c5101a77 | 2957 | register size_t i; |
7146af97 JB |
2958 | register struct Lisp_Vector *p; |
2959 | ||
67ba9986 | 2960 | XSETFASTINT (len, nargs); |
265a9e55 | 2961 | if (!NILP (Vpurify_flag)) |
5a053ea9 | 2962 | val = make_pure_vector ((EMACS_INT) nargs); |
7146af97 JB |
2963 | else |
2964 | val = Fmake_vector (len, Qnil); | |
9eac9d59 | 2965 | |
b1feb9b4 | 2966 | if (nargs > 1 && STRINGP (args[1]) && STRING_MULTIBYTE (args[1])) |
9eac9d59 KH |
2967 | /* BYTECODE-STRING must have been produced by Emacs 20.2 or the |
2968 | earlier because they produced a raw 8-bit string for byte-code | |
2969 | and now such a byte-code string is loaded as multibyte while | |
2970 | raw 8-bit characters converted to multibyte form. Thus, now we | |
2971 | must convert them back to the original unibyte form. */ | |
2972 | args[1] = Fstring_as_unibyte (args[1]); | |
2973 | ||
7146af97 | 2974 | p = XVECTOR (val); |
ae35e756 | 2975 | for (i = 0; i < nargs; i++) |
7146af97 | 2976 | { |
265a9e55 | 2977 | if (!NILP (Vpurify_flag)) |
ae35e756 PE |
2978 | args[i] = Fpurecopy (args[i]); |
2979 | p->contents[i] = args[i]; | |
7146af97 | 2980 | } |
876c194c SM |
2981 | XSETPVECTYPE (p, PVEC_COMPILED); |
2982 | XSETCOMPILED (val, p); | |
7146af97 JB |
2983 | return val; |
2984 | } | |
2e471eb5 | 2985 | |
34400008 | 2986 | |
7146af97 | 2987 | \f |
2e471eb5 GM |
2988 | /*********************************************************************** |
2989 | Symbol Allocation | |
2990 | ***********************************************************************/ | |
7146af97 | 2991 | |
2e471eb5 GM |
2992 | /* Each symbol_block is just under 1020 bytes long, since malloc |
2993 | really allocates in units of powers of two and uses 4 bytes for its | |
2994 | own overhead. */ | |
7146af97 JB |
2995 | |
2996 | #define SYMBOL_BLOCK_SIZE \ | |
2997 | ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol)) | |
2998 | ||
2999 | struct symbol_block | |
2e471eb5 | 3000 | { |
6b61353c | 3001 | /* Place `symbols' first, to preserve alignment. */ |
2e471eb5 | 3002 | struct Lisp_Symbol symbols[SYMBOL_BLOCK_SIZE]; |
6b61353c | 3003 | struct symbol_block *next; |
2e471eb5 | 3004 | }; |
7146af97 | 3005 | |
34400008 GM |
3006 | /* Current symbol block and index of first unused Lisp_Symbol |
3007 | structure in it. */ | |
3008 | ||
d3d47262 JB |
3009 | static struct symbol_block *symbol_block; |
3010 | static int symbol_block_index; | |
7146af97 | 3011 | |
34400008 GM |
3012 | /* List of free symbols. */ |
3013 | ||
d3d47262 | 3014 | static struct Lisp_Symbol *symbol_free_list; |
7146af97 | 3015 | |
c8099634 | 3016 | /* Total number of symbol blocks now in use. */ |
2e471eb5 | 3017 | |
d3d47262 | 3018 | static int n_symbol_blocks; |
c8099634 | 3019 | |
34400008 GM |
3020 | |
3021 | /* Initialize symbol allocation. */ | |
3022 | ||
d3d47262 | 3023 | static void |
971de7fb | 3024 | init_symbol (void) |
7146af97 | 3025 | { |
005ca5c7 DL |
3026 | symbol_block = NULL; |
3027 | symbol_block_index = SYMBOL_BLOCK_SIZE; | |
7146af97 | 3028 | symbol_free_list = 0; |
005ca5c7 | 3029 | n_symbol_blocks = 0; |
7146af97 JB |
3030 | } |
3031 | ||
34400008 | 3032 | |
a7ca3326 | 3033 | DEFUN ("make-symbol", Fmake_symbol, Smake_symbol, 1, 1, 0, |
a6266d23 | 3034 | doc: /* Return a newly allocated uninterned symbol whose name is NAME. |
7ee72033 | 3035 | Its value and function definition are void, and its property list is nil. */) |
5842a27b | 3036 | (Lisp_Object name) |
7146af97 JB |
3037 | { |
3038 | register Lisp_Object val; | |
3039 | register struct Lisp_Symbol *p; | |
3040 | ||
b7826503 | 3041 | CHECK_STRING (name); |
7146af97 | 3042 | |
537407f0 | 3043 | /* eassert (!handling_signal); */ |
cfb2f32e | 3044 | |
dafc79fa | 3045 | MALLOC_BLOCK_INPUT; |
e2984df0 | 3046 | |
7146af97 JB |
3047 | if (symbol_free_list) |
3048 | { | |
45d12a89 | 3049 | XSETSYMBOL (val, symbol_free_list); |
28a099a4 | 3050 | symbol_free_list = symbol_free_list->next; |
7146af97 JB |
3051 | } |
3052 | else | |
3053 | { | |
3054 | if (symbol_block_index == SYMBOL_BLOCK_SIZE) | |
3055 | { | |
3c06d205 | 3056 | struct symbol_block *new; |
34400008 GM |
3057 | new = (struct symbol_block *) lisp_malloc (sizeof *new, |
3058 | MEM_TYPE_SYMBOL); | |
7146af97 JB |
3059 | new->next = symbol_block; |
3060 | symbol_block = new; | |
3061 | symbol_block_index = 0; | |
c8099634 | 3062 | n_symbol_blocks++; |
7146af97 | 3063 | } |
6b61353c KH |
3064 | XSETSYMBOL (val, &symbol_block->symbols[symbol_block_index]); |
3065 | symbol_block_index++; | |
7146af97 | 3066 | } |
177c0ea7 | 3067 | |
dafc79fa | 3068 | MALLOC_UNBLOCK_INPUT; |
e2984df0 | 3069 | |
7146af97 | 3070 | p = XSYMBOL (val); |
8fe5665d | 3071 | p->xname = name; |
7146af97 | 3072 | p->plist = Qnil; |
ce5b453a SM |
3073 | p->redirect = SYMBOL_PLAINVAL; |
3074 | SET_SYMBOL_VAL (p, Qunbound); | |
2e471eb5 | 3075 | p->function = Qunbound; |
9e713715 | 3076 | p->next = NULL; |
2336fe58 | 3077 | p->gcmarkbit = 0; |
9e713715 GM |
3078 | p->interned = SYMBOL_UNINTERNED; |
3079 | p->constant = 0; | |
b9598260 | 3080 | p->declared_special = 0; |
2e471eb5 GM |
3081 | consing_since_gc += sizeof (struct Lisp_Symbol); |
3082 | symbols_consed++; | |
7146af97 JB |
3083 | return val; |
3084 | } | |
3085 | ||
3f25e183 | 3086 | |
2e471eb5 GM |
3087 | \f |
3088 | /*********************************************************************** | |
34400008 | 3089 | Marker (Misc) Allocation |
2e471eb5 | 3090 | ***********************************************************************/ |
3f25e183 | 3091 | |
2e471eb5 GM |
3092 | /* Allocation of markers and other objects that share that structure. |
3093 | Works like allocation of conses. */ | |
c0696668 | 3094 | |
2e471eb5 GM |
3095 | #define MARKER_BLOCK_SIZE \ |
3096 | ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc)) | |
3097 | ||
3098 | struct marker_block | |
c0696668 | 3099 | { |
6b61353c | 3100 | /* Place `markers' first, to preserve alignment. */ |
2e471eb5 | 3101 | union Lisp_Misc markers[MARKER_BLOCK_SIZE]; |
6b61353c | 3102 | struct marker_block *next; |
2e471eb5 | 3103 | }; |
c0696668 | 3104 | |
d3d47262 JB |
3105 | static struct marker_block *marker_block; |
3106 | static int marker_block_index; | |
c0696668 | 3107 | |
d3d47262 | 3108 | static union Lisp_Misc *marker_free_list; |
c0696668 | 3109 | |
2e471eb5 | 3110 | /* Total number of marker blocks now in use. */ |
3f25e183 | 3111 | |
d3d47262 | 3112 | static int n_marker_blocks; |
2e471eb5 | 3113 | |
d3d47262 | 3114 | static void |
971de7fb | 3115 | init_marker (void) |
3f25e183 | 3116 | { |
005ca5c7 DL |
3117 | marker_block = NULL; |
3118 | marker_block_index = MARKER_BLOCK_SIZE; | |
2e471eb5 | 3119 | marker_free_list = 0; |
005ca5c7 | 3120 | n_marker_blocks = 0; |
3f25e183 RS |
3121 | } |
3122 | ||
2e471eb5 GM |
3123 | /* Return a newly allocated Lisp_Misc object, with no substructure. */ |
3124 | ||
3f25e183 | 3125 | Lisp_Object |
971de7fb | 3126 | allocate_misc (void) |
7146af97 | 3127 | { |
2e471eb5 | 3128 | Lisp_Object val; |
7146af97 | 3129 | |
e2984df0 CY |
3130 | /* eassert (!handling_signal); */ |
3131 | ||
dafc79fa | 3132 | MALLOC_BLOCK_INPUT; |
cfb2f32e | 3133 | |
2e471eb5 | 3134 | if (marker_free_list) |
7146af97 | 3135 | { |
2e471eb5 GM |
3136 | XSETMISC (val, marker_free_list); |
3137 | marker_free_list = marker_free_list->u_free.chain; | |
7146af97 JB |
3138 | } |
3139 | else | |
7146af97 | 3140 | { |
2e471eb5 GM |
3141 | if (marker_block_index == MARKER_BLOCK_SIZE) |
3142 | { | |
3143 | struct marker_block *new; | |
34400008 GM |
3144 | new = (struct marker_block *) lisp_malloc (sizeof *new, |
3145 | MEM_TYPE_MISC); | |
2e471eb5 GM |
3146 | new->next = marker_block; |
3147 | marker_block = new; | |
3148 | marker_block_index = 0; | |
3149 | n_marker_blocks++; | |
7b7990cc | 3150 | total_free_markers += MARKER_BLOCK_SIZE; |
2e471eb5 | 3151 | } |
6b61353c KH |
3152 | XSETMISC (val, &marker_block->markers[marker_block_index]); |
3153 | marker_block_index++; | |
7146af97 | 3154 | } |
177c0ea7 | 3155 | |
dafc79fa | 3156 | MALLOC_UNBLOCK_INPUT; |
e2984df0 | 3157 | |
7b7990cc | 3158 | --total_free_markers; |
2e471eb5 GM |
3159 | consing_since_gc += sizeof (union Lisp_Misc); |
3160 | misc_objects_consed++; | |
67ee9f6e | 3161 | XMISCANY (val)->gcmarkbit = 0; |
2e471eb5 GM |
3162 | return val; |
3163 | } | |
3164 | ||
7b7990cc KS |
3165 | /* Free a Lisp_Misc object */ |
3166 | ||
244ed907 | 3167 | static void |
971de7fb | 3168 | free_misc (Lisp_Object misc) |
7b7990cc | 3169 | { |
d314756e | 3170 | XMISCTYPE (misc) = Lisp_Misc_Free; |
7b7990cc KS |
3171 | XMISC (misc)->u_free.chain = marker_free_list; |
3172 | marker_free_list = XMISC (misc); | |
3173 | ||
3174 | total_free_markers++; | |
3175 | } | |
3176 | ||
42172a6b RS |
3177 | /* Return a Lisp_Misc_Save_Value object containing POINTER and |
3178 | INTEGER. This is used to package C values to call record_unwind_protect. | |
3179 | The unwind function can get the C values back using XSAVE_VALUE. */ | |
3180 | ||
3181 | Lisp_Object | |
971de7fb | 3182 | make_save_value (void *pointer, int integer) |
42172a6b RS |
3183 | { |
3184 | register Lisp_Object val; | |
3185 | register struct Lisp_Save_Value *p; | |
3186 | ||
3187 | val = allocate_misc (); | |
3188 | XMISCTYPE (val) = Lisp_Misc_Save_Value; | |
3189 | p = XSAVE_VALUE (val); | |
3190 | p->pointer = pointer; | |
3191 | p->integer = integer; | |
b766f870 | 3192 | p->dogc = 0; |
42172a6b RS |
3193 | return val; |
3194 | } | |
3195 | ||
a7ca3326 | 3196 | DEFUN ("make-marker", Fmake_marker, Smake_marker, 0, 0, 0, |
a6266d23 | 3197 | doc: /* Return a newly allocated marker which does not point at any place. */) |
5842a27b | 3198 | (void) |
2e471eb5 GM |
3199 | { |
3200 | register Lisp_Object val; | |
3201 | register struct Lisp_Marker *p; | |
7146af97 | 3202 | |
2e471eb5 GM |
3203 | val = allocate_misc (); |
3204 | XMISCTYPE (val) = Lisp_Misc_Marker; | |
3205 | p = XMARKER (val); | |
3206 | p->buffer = 0; | |
3207 | p->bytepos = 0; | |
3208 | p->charpos = 0; | |
ef89c2ce | 3209 | p->next = NULL; |
2e471eb5 | 3210 | p->insertion_type = 0; |
7146af97 JB |
3211 | return val; |
3212 | } | |
2e471eb5 GM |
3213 | |
3214 | /* Put MARKER back on the free list after using it temporarily. */ | |
3215 | ||
3216 | void | |
971de7fb | 3217 | free_marker (Lisp_Object marker) |
2e471eb5 | 3218 | { |
ef89c2ce | 3219 | unchain_marker (XMARKER (marker)); |
7b7990cc | 3220 | free_misc (marker); |
2e471eb5 GM |
3221 | } |
3222 | ||
c0696668 | 3223 | \f |
7146af97 | 3224 | /* Return a newly created vector or string with specified arguments as |
736471d1 RS |
3225 | elements. If all the arguments are characters that can fit |
3226 | in a string of events, make a string; otherwise, make a vector. | |
3227 | ||
3228 | Any number of arguments, even zero arguments, are allowed. */ | |
7146af97 JB |
3229 | |
3230 | Lisp_Object | |
971de7fb | 3231 | make_event_array (register int nargs, Lisp_Object *args) |
7146af97 JB |
3232 | { |
3233 | int i; | |
3234 | ||
3235 | for (i = 0; i < nargs; i++) | |
736471d1 | 3236 | /* The things that fit in a string |
c9ca4659 RS |
3237 | are characters that are in 0...127, |
3238 | after discarding the meta bit and all the bits above it. */ | |
e687453f | 3239 | if (!INTEGERP (args[i]) |
c9ca4659 | 3240 | || (XUINT (args[i]) & ~(-CHAR_META)) >= 0200) |
7146af97 JB |
3241 | return Fvector (nargs, args); |
3242 | ||
3243 | /* Since the loop exited, we know that all the things in it are | |
3244 | characters, so we can make a string. */ | |
3245 | { | |
c13ccad2 | 3246 | Lisp_Object result; |
177c0ea7 | 3247 | |
50aee051 | 3248 | result = Fmake_string (make_number (nargs), make_number (0)); |
7146af97 | 3249 | for (i = 0; i < nargs; i++) |
736471d1 | 3250 | { |
46e7e6b0 | 3251 | SSET (result, i, XINT (args[i])); |
736471d1 RS |
3252 | /* Move the meta bit to the right place for a string char. */ |
3253 | if (XINT (args[i]) & CHAR_META) | |
46e7e6b0 | 3254 | SSET (result, i, SREF (result, i) | 0x80); |
736471d1 | 3255 | } |
177c0ea7 | 3256 | |
7146af97 JB |
3257 | return result; |
3258 | } | |
3259 | } | |
2e471eb5 GM |
3260 | |
3261 | ||
7146af97 | 3262 | \f |
24d8a105 RS |
3263 | /************************************************************************ |
3264 | Memory Full Handling | |
3265 | ************************************************************************/ | |
3266 | ||
3267 | ||
3268 | /* Called if malloc returns zero. */ | |
3269 | ||
3270 | void | |
971de7fb | 3271 | memory_full (void) |
24d8a105 RS |
3272 | { |
3273 | int i; | |
3274 | ||
3275 | Vmemory_full = Qt; | |
3276 | ||
3277 | memory_full_cons_threshold = sizeof (struct cons_block); | |
3278 | ||
3279 | /* The first time we get here, free the spare memory. */ | |
3280 | for (i = 0; i < sizeof (spare_memory) / sizeof (char *); i++) | |
3281 | if (spare_memory[i]) | |
3282 | { | |
3283 | if (i == 0) | |
3284 | free (spare_memory[i]); | |
3285 | else if (i >= 1 && i <= 4) | |
3286 | lisp_align_free (spare_memory[i]); | |
3287 | else | |
3288 | lisp_free (spare_memory[i]); | |
3289 | spare_memory[i] = 0; | |
3290 | } | |
3291 | ||
3292 | /* Record the space now used. When it decreases substantially, | |
3293 | we can refill the memory reserve. */ | |
4e75f29d | 3294 | #if !defined SYSTEM_MALLOC && !defined SYNC_INPUT |
24d8a105 RS |
3295 | bytes_used_when_full = BYTES_USED; |
3296 | #endif | |
3297 | ||
3298 | /* This used to call error, but if we've run out of memory, we could | |
3299 | get infinite recursion trying to build the string. */ | |
9b306d37 | 3300 | xsignal (Qnil, Vmemory_signal_data); |
24d8a105 RS |
3301 | } |
3302 | ||
3303 | /* If we released our reserve (due to running out of memory), | |
3304 | and we have a fair amount free once again, | |
3305 | try to set aside another reserve in case we run out once more. | |
3306 | ||
3307 | This is called when a relocatable block is freed in ralloc.c, | |
3308 | and also directly from this file, in case we're not using ralloc.c. */ | |
3309 | ||
3310 | void | |
971de7fb | 3311 | refill_memory_reserve (void) |
24d8a105 RS |
3312 | { |
3313 | #ifndef SYSTEM_MALLOC | |
3314 | if (spare_memory[0] == 0) | |
3315 | spare_memory[0] = (char *) malloc ((size_t) SPARE_MEMORY); | |
3316 | if (spare_memory[1] == 0) | |
3317 | spare_memory[1] = (char *) lisp_align_malloc (sizeof (struct cons_block), | |
3318 | MEM_TYPE_CONS); | |
3319 | if (spare_memory[2] == 0) | |
3320 | spare_memory[2] = (char *) lisp_align_malloc (sizeof (struct cons_block), | |
3321 | MEM_TYPE_CONS); | |
3322 | if (spare_memory[3] == 0) | |
3323 | spare_memory[3] = (char *) lisp_align_malloc (sizeof (struct cons_block), | |
3324 | MEM_TYPE_CONS); | |
3325 | if (spare_memory[4] == 0) | |
3326 | spare_memory[4] = (char *) lisp_align_malloc (sizeof (struct cons_block), | |
3327 | MEM_TYPE_CONS); | |
3328 | if (spare_memory[5] == 0) | |
3329 | spare_memory[5] = (char *) lisp_malloc (sizeof (struct string_block), | |
3330 | MEM_TYPE_STRING); | |
3331 | if (spare_memory[6] == 0) | |
3332 | spare_memory[6] = (char *) lisp_malloc (sizeof (struct string_block), | |
3333 | MEM_TYPE_STRING); | |
3334 | if (spare_memory[0] && spare_memory[1] && spare_memory[5]) | |
3335 | Vmemory_full = Qnil; | |
3336 | #endif | |
3337 | } | |
3338 | \f | |
34400008 GM |
3339 | /************************************************************************ |
3340 | C Stack Marking | |
3341 | ************************************************************************/ | |
3342 | ||
13c844fb GM |
3343 | #if GC_MARK_STACK || defined GC_MALLOC_CHECK |
3344 | ||
71cf5fa0 GM |
3345 | /* Conservative C stack marking requires a method to identify possibly |
3346 | live Lisp objects given a pointer value. We do this by keeping | |
3347 | track of blocks of Lisp data that are allocated in a red-black tree | |
3348 | (see also the comment of mem_node which is the type of nodes in | |
3349 | that tree). Function lisp_malloc adds information for an allocated | |
3350 | block to the red-black tree with calls to mem_insert, and function | |
3351 | lisp_free removes it with mem_delete. Functions live_string_p etc | |
3352 | call mem_find to lookup information about a given pointer in the | |
3353 | tree, and use that to determine if the pointer points to a Lisp | |
3354 | object or not. */ | |
3355 | ||
34400008 GM |
3356 | /* Initialize this part of alloc.c. */ |
3357 | ||
3358 | static void | |
971de7fb | 3359 | mem_init (void) |
34400008 GM |
3360 | { |
3361 | mem_z.left = mem_z.right = MEM_NIL; | |
3362 | mem_z.parent = NULL; | |
3363 | mem_z.color = MEM_BLACK; | |
3364 | mem_z.start = mem_z.end = NULL; | |
3365 | mem_root = MEM_NIL; | |
3366 | } | |
3367 | ||
3368 | ||
3369 | /* Value is a pointer to the mem_node containing START. Value is | |
3370 | MEM_NIL if there is no node in the tree containing START. */ | |
3371 | ||
3372 | static INLINE struct mem_node * | |
971de7fb | 3373 | mem_find (void *start) |
34400008 GM |
3374 | { |
3375 | struct mem_node *p; | |
3376 | ||
ece93c02 GM |
3377 | if (start < min_heap_address || start > max_heap_address) |
3378 | return MEM_NIL; | |
3379 | ||
34400008 GM |
3380 | /* Make the search always successful to speed up the loop below. */ |
3381 | mem_z.start = start; | |
3382 | mem_z.end = (char *) start + 1; | |
3383 | ||
3384 | p = mem_root; | |
3385 | while (start < p->start || start >= p->end) | |
3386 | p = start < p->start ? p->left : p->right; | |
3387 | return p; | |
3388 | } | |
3389 | ||
3390 | ||
3391 | /* Insert a new node into the tree for a block of memory with start | |
3392 | address START, end address END, and type TYPE. Value is a | |
3393 | pointer to the node that was inserted. */ | |
3394 | ||
3395 | static struct mem_node * | |
971de7fb | 3396 | mem_insert (void *start, void *end, enum mem_type type) |
34400008 GM |
3397 | { |
3398 | struct mem_node *c, *parent, *x; | |
3399 | ||
add3c3ea | 3400 | if (min_heap_address == NULL || start < min_heap_address) |
ece93c02 | 3401 | min_heap_address = start; |
add3c3ea | 3402 | if (max_heap_address == NULL || end > max_heap_address) |
ece93c02 GM |
3403 | max_heap_address = end; |
3404 | ||
34400008 GM |
3405 | /* See where in the tree a node for START belongs. In this |
3406 | particular application, it shouldn't happen that a node is already | |
3407 | present. For debugging purposes, let's check that. */ | |
3408 | c = mem_root; | |
3409 | parent = NULL; | |
3410 | ||
3411 | #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS | |
177c0ea7 | 3412 | |
34400008 GM |
3413 | while (c != MEM_NIL) |
3414 | { | |
3415 | if (start >= c->start && start < c->end) | |
3416 | abort (); | |
3417 | parent = c; | |
3418 | c = start < c->start ? c->left : c->right; | |
3419 | } | |
177c0ea7 | 3420 | |
34400008 | 3421 | #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */ |
177c0ea7 | 3422 | |
34400008 GM |
3423 | while (c != MEM_NIL) |
3424 | { | |
3425 | parent = c; | |
3426 | c = start < c->start ? c->left : c->right; | |
3427 | } | |
177c0ea7 | 3428 | |
34400008 GM |
3429 | #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */ |
3430 | ||
3431 | /* Create a new node. */ | |
877935b1 GM |
3432 | #ifdef GC_MALLOC_CHECK |
3433 | x = (struct mem_node *) _malloc_internal (sizeof *x); | |
3434 | if (x == NULL) | |
3435 | abort (); | |
3436 | #else | |
34400008 | 3437 | x = (struct mem_node *) xmalloc (sizeof *x); |
877935b1 | 3438 | #endif |
34400008 GM |
3439 | x->start = start; |
3440 | x->end = end; | |
3441 | x->type = type; | |
3442 | x->parent = parent; | |
3443 | x->left = x->right = MEM_NIL; | |
3444 | x->color = MEM_RED; | |
3445 | ||
3446 | /* Insert it as child of PARENT or install it as root. */ | |
3447 | if (parent) | |
3448 | { | |
3449 | if (start < parent->start) | |
3450 | parent->left = x; | |
3451 | else | |
3452 | parent->right = x; | |
3453 | } | |
177c0ea7 | 3454 | else |
34400008 GM |
3455 | mem_root = x; |
3456 | ||
3457 | /* Re-establish red-black tree properties. */ | |
3458 | mem_insert_fixup (x); | |
877935b1 | 3459 | |
34400008 GM |
3460 | return x; |
3461 | } | |
3462 | ||
3463 | ||
3464 | /* Re-establish the red-black properties of the tree, and thereby | |
3465 | balance the tree, after node X has been inserted; X is always red. */ | |
3466 | ||
3467 | static void | |
971de7fb | 3468 | mem_insert_fixup (struct mem_node *x) |
34400008 GM |
3469 | { |
3470 | while (x != mem_root && x->parent->color == MEM_RED) | |
3471 | { | |
3472 | /* X is red and its parent is red. This is a violation of | |
3473 | red-black tree property #3. */ | |
177c0ea7 | 3474 | |
34400008 GM |
3475 | if (x->parent == x->parent->parent->left) |
3476 | { | |
3477 | /* We're on the left side of our grandparent, and Y is our | |
3478 | "uncle". */ | |
3479 | struct mem_node *y = x->parent->parent->right; | |
177c0ea7 | 3480 | |
34400008 GM |
3481 | if (y->color == MEM_RED) |
3482 | { | |
3483 | /* Uncle and parent are red but should be black because | |
3484 | X is red. Change the colors accordingly and proceed | |
3485 | with the grandparent. */ | |
3486 | x->parent->color = MEM_BLACK; | |
3487 | y->color = MEM_BLACK; | |
3488 | x->parent->parent->color = MEM_RED; | |
3489 | x = x->parent->parent; | |
3490 | } | |
3491 | else | |
3492 | { | |
3493 | /* Parent and uncle have different colors; parent is | |
3494 | red, uncle is black. */ | |
3495 | if (x == x->parent->right) | |
3496 | { | |
3497 | x = x->parent; | |
3498 | mem_rotate_left (x); | |
3499 | } | |
3500 | ||
3501 | x->parent->color = MEM_BLACK; | |
3502 | x->parent->parent->color = MEM_RED; | |
3503 | mem_rotate_right (x->parent->parent); | |
3504 | } | |
3505 | } | |
3506 | else | |
3507 | { | |
3508 | /* This is the symmetrical case of above. */ | |
3509 | struct mem_node *y = x->parent->parent->left; | |
177c0ea7 | 3510 | |
34400008 GM |
3511 | if (y->color == MEM_RED) |
3512 | { | |
3513 | x->parent->color = MEM_BLACK; | |
3514 | y->color = MEM_BLACK; | |
3515 | x->parent->parent->color = MEM_RED; | |
3516 | x = x->parent->parent; | |
3517 | } | |
3518 | else | |
3519 | { | |
3520 | if (x == x->parent->left) | |
3521 | { | |
3522 | x = x->parent; | |
3523 | mem_rotate_right (x); | |
3524 | } | |
177c0ea7 | 3525 | |
34400008 GM |
3526 | x->parent->color = MEM_BLACK; |
3527 | x->parent->parent->color = MEM_RED; | |
3528 | mem_rotate_left (x->parent->parent); | |
3529 | } | |
3530 | } | |
3531 | } | |
3532 | ||
3533 | /* The root may have been changed to red due to the algorithm. Set | |
3534 | it to black so that property #5 is satisfied. */ | |
3535 | mem_root->color = MEM_BLACK; | |
3536 | } | |
3537 | ||
3538 | ||
177c0ea7 JB |
3539 | /* (x) (y) |
3540 | / \ / \ | |
34400008 GM |
3541 | a (y) ===> (x) c |
3542 | / \ / \ | |
3543 | b c a b */ | |
3544 | ||
3545 | static void | |
971de7fb | 3546 | mem_rotate_left (struct mem_node *x) |
34400008 GM |
3547 | { |
3548 | struct mem_node *y; | |
3549 | ||
3550 | /* Turn y's left sub-tree into x's right sub-tree. */ | |
3551 | y = x->right; | |
3552 | x->right = y->left; | |
3553 | if (y->left != MEM_NIL) | |
3554 | y->left->parent = x; | |
3555 | ||
3556 | /* Y's parent was x's parent. */ | |
3557 | if (y != MEM_NIL) | |
3558 | y->parent = x->parent; | |
3559 | ||
3560 | /* Get the parent to point to y instead of x. */ | |
3561 | if (x->parent) | |
3562 | { | |
3563 | if (x == x->parent->left) | |
3564 | x->parent->left = y; | |
3565 | else | |
3566 | x->parent->right = y; | |
3567 | } | |
3568 | else | |
3569 | mem_root = y; | |
3570 | ||
3571 | /* Put x on y's left. */ | |
3572 | y->left = x; | |
3573 | if (x != MEM_NIL) | |
3574 | x->parent = y; | |
3575 | } | |
3576 | ||
3577 | ||
177c0ea7 JB |
3578 | /* (x) (Y) |
3579 | / \ / \ | |
3580 | (y) c ===> a (x) | |
3581 | / \ / \ | |
34400008 GM |
3582 | a b b c */ |
3583 | ||
3584 | static void | |
971de7fb | 3585 | mem_rotate_right (struct mem_node *x) |
34400008 GM |
3586 | { |
3587 | struct mem_node *y = x->left; | |
3588 | ||
3589 | x->left = y->right; | |
3590 | if (y->right != MEM_NIL) | |
3591 | y->right->parent = x; | |
177c0ea7 | 3592 | |
34400008 GM |
3593 | if (y != MEM_NIL) |
3594 | y->parent = x->parent; | |
3595 | if (x->parent) | |
3596 | { | |
3597 | if (x == x->parent->right) | |
3598 | x->parent->right = y; | |
3599 | else | |
3600 | x->parent->left = y; | |
3601 | } | |
3602 | else | |
3603 | mem_root = y; | |
177c0ea7 | 3604 | |
34400008 GM |
3605 | y->right = x; |
3606 | if (x != MEM_NIL) | |
3607 | x->parent = y; | |
3608 | } | |
3609 | ||
3610 | ||
3611 | /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */ | |
3612 | ||
3613 | static void | |
971de7fb | 3614 | mem_delete (struct mem_node *z) |
34400008 GM |
3615 | { |
3616 | struct mem_node *x, *y; | |
3617 | ||
3618 | if (!z || z == MEM_NIL) | |
3619 | return; | |
3620 | ||
3621 | if (z->left == MEM_NIL || z->right == MEM_NIL) | |
3622 | y = z; | |
3623 | else | |
3624 | { | |
3625 | y = z->right; | |
3626 | while (y->left != MEM_NIL) | |
3627 | y = y->left; | |
3628 | } | |
3629 | ||
3630 | if (y->left != MEM_NIL) | |
3631 | x = y->left; | |
3632 | else | |
3633 | x = y->right; | |
3634 | ||
3635 | x->parent = y->parent; | |
3636 | if (y->parent) | |
3637 | { | |
3638 | if (y == y->parent->left) | |
3639 | y->parent->left = x; | |
3640 | else | |
3641 | y->parent->right = x; | |
3642 | } | |
3643 | else | |
3644 | mem_root = x; | |
3645 | ||
3646 | if (y != z) | |
3647 | { | |
3648 | z->start = y->start; | |
3649 | z->end = y->end; | |
3650 | z->type = y->type; | |
3651 | } | |
177c0ea7 | 3652 | |
34400008 GM |
3653 | if (y->color == MEM_BLACK) |
3654 | mem_delete_fixup (x); | |
877935b1 GM |
3655 | |
3656 | #ifdef GC_MALLOC_CHECK | |
3657 | _free_internal (y); | |
3658 | #else | |
34400008 | 3659 | xfree (y); |
877935b1 | 3660 | #endif |
34400008 GM |
3661 | } |
3662 | ||
3663 | ||
3664 | /* Re-establish the red-black properties of the tree, after a | |
3665 | deletion. */ | |
3666 | ||
3667 | static void | |
971de7fb | 3668 | mem_delete_fixup (struct mem_node *x) |
34400008 GM |
3669 | { |
3670 | while (x != mem_root && x->color == MEM_BLACK) | |
3671 | { | |
3672 | if (x == x->parent->left) | |
3673 | { | |
3674 | struct mem_node *w = x->parent->right; | |
177c0ea7 | 3675 | |
34400008 GM |
3676 | if (w->color == MEM_RED) |
3677 | { | |
3678 | w->color = MEM_BLACK; | |
3679 | x->parent->color = MEM_RED; | |
3680 | mem_rotate_left (x->parent); | |
3681 | w = x->parent->right; | |
3682 | } | |
177c0ea7 | 3683 | |
34400008 GM |
3684 | if (w->left->color == MEM_BLACK && w->right->color == MEM_BLACK) |
3685 | { | |
3686 | w->color = MEM_RED; | |
3687 | x = x->parent; | |
3688 | } | |
3689 | else | |
3690 | { | |
3691 | if (w->right->color == MEM_BLACK) | |
3692 | { | |
3693 | w->left->color = MEM_BLACK; | |
3694 | w->color = MEM_RED; | |
3695 | mem_rotate_right (w); | |
3696 | w = x->parent->right; | |
3697 | } | |
3698 | w->color = x->parent->color; | |
3699 | x->parent->color = MEM_BLACK; | |
3700 | w->right->color = MEM_BLACK; | |
3701 | mem_rotate_left (x->parent); | |
3702 | x = mem_root; | |
3703 | } | |
3704 | } | |
3705 | else | |
3706 | { | |
3707 | struct mem_node *w = x->parent->left; | |
177c0ea7 | 3708 | |
34400008 GM |
3709 | if (w->color == MEM_RED) |
3710 | { | |
3711 | w->color = MEM_BLACK; | |
3712 | x->parent->color = MEM_RED; | |
3713 | mem_rotate_right (x->parent); | |
3714 | w = x->parent->left; | |
3715 | } | |
177c0ea7 | 3716 | |
34400008 GM |
3717 | if (w->right->color == MEM_BLACK && w->left->color == MEM_BLACK) |
3718 | { | |
3719 | w->color = MEM_RED; | |
3720 | x = x->parent; | |
3721 | } | |
3722 | else | |
3723 | { | |
3724 | if (w->left->color == MEM_BLACK) | |
3725 | { | |
3726 | w->right->color = MEM_BLACK; | |
3727 | w->color = MEM_RED; | |
3728 | mem_rotate_left (w); | |
3729 | w = x->parent->left; | |
3730 | } | |
177c0ea7 | 3731 | |
34400008 GM |
3732 | w->color = x->parent->color; |
3733 | x->parent->color = MEM_BLACK; | |
3734 | w->left->color = MEM_BLACK; | |
3735 | mem_rotate_right (x->parent); | |
3736 | x = mem_root; | |
3737 | } | |
3738 | } | |
3739 | } | |
177c0ea7 | 3740 | |
34400008 GM |
3741 | x->color = MEM_BLACK; |
3742 | } | |
3743 | ||
3744 | ||
3745 | /* Value is non-zero if P is a pointer to a live Lisp string on | |
3746 | the heap. M is a pointer to the mem_block for P. */ | |
3747 | ||
3748 | static INLINE int | |
971de7fb | 3749 | live_string_p (struct mem_node *m, void *p) |
34400008 GM |
3750 | { |
3751 | if (m->type == MEM_TYPE_STRING) | |
3752 | { | |
3753 | struct string_block *b = (struct string_block *) m->start; | |
14162469 | 3754 | ptrdiff_t offset = (char *) p - (char *) &b->strings[0]; |
34400008 GM |
3755 | |
3756 | /* P must point to the start of a Lisp_String structure, and it | |
3757 | must not be on the free-list. */ | |
176bc847 GM |
3758 | return (offset >= 0 |
3759 | && offset % sizeof b->strings[0] == 0 | |
6b61353c | 3760 | && offset < (STRING_BLOCK_SIZE * sizeof b->strings[0]) |
34400008 GM |
3761 | && ((struct Lisp_String *) p)->data != NULL); |
3762 | } | |
3763 | else | |
3764 | return 0; | |
3765 | } | |
3766 | ||
3767 | ||
3768 | /* Value is non-zero if P is a pointer to a live Lisp cons on | |
3769 | the heap. M is a pointer to the mem_block for P. */ | |
3770 | ||
3771 | static INLINE int | |
971de7fb | 3772 | live_cons_p (struct mem_node *m, void *p) |
34400008 GM |
3773 | { |
3774 | if (m->type == MEM_TYPE_CONS) | |
3775 | { | |
3776 | struct cons_block *b = (struct cons_block *) m->start; | |
14162469 | 3777 | ptrdiff_t offset = (char *) p - (char *) &b->conses[0]; |
34400008 GM |
3778 | |
3779 | /* P must point to the start of a Lisp_Cons, not be | |
3780 | one of the unused cells in the current cons block, | |
3781 | and not be on the free-list. */ | |
176bc847 GM |
3782 | return (offset >= 0 |
3783 | && offset % sizeof b->conses[0] == 0 | |
6b61353c | 3784 | && offset < (CONS_BLOCK_SIZE * sizeof b->conses[0]) |
34400008 GM |
3785 | && (b != cons_block |
3786 | || offset / sizeof b->conses[0] < cons_block_index) | |
3787 | && !EQ (((struct Lisp_Cons *) p)->car, Vdead)); | |
3788 | } | |
3789 | else | |
3790 | return 0; | |
3791 | } | |
3792 | ||
3793 | ||
3794 | /* Value is non-zero if P is a pointer to a live Lisp symbol on | |
3795 | the heap. M is a pointer to the mem_block for P. */ | |
3796 | ||
3797 | static INLINE int | |
971de7fb | 3798 | live_symbol_p (struct mem_node *m, void *p) |
34400008 GM |
3799 | { |
3800 | if (m->type == MEM_TYPE_SYMBOL) | |
3801 | { | |
3802 | struct symbol_block *b = (struct symbol_block *) m->start; | |
14162469 | 3803 | ptrdiff_t offset = (char *) p - (char *) &b->symbols[0]; |
177c0ea7 | 3804 | |
34400008 GM |
3805 | /* P must point to the start of a Lisp_Symbol, not be |
3806 | one of the unused cells in the current symbol block, | |
3807 | and not be on the free-list. */ | |
176bc847 GM |
3808 | return (offset >= 0 |
3809 | && offset % sizeof b->symbols[0] == 0 | |
6b61353c | 3810 | && offset < (SYMBOL_BLOCK_SIZE * sizeof b->symbols[0]) |
34400008 GM |
3811 | && (b != symbol_block |
3812 | || offset / sizeof b->symbols[0] < symbol_block_index) | |
3813 | && !EQ (((struct Lisp_Symbol *) p)->function, Vdead)); | |
3814 | } | |
3815 | else | |
3816 | return 0; | |
3817 | } | |
3818 | ||
3819 | ||
3820 | /* Value is non-zero if P is a pointer to a live Lisp float on | |
3821 | the heap. M is a pointer to the mem_block for P. */ | |
3822 | ||
3823 | static INLINE int | |
971de7fb | 3824 | live_float_p (struct mem_node *m, void *p) |
34400008 GM |
3825 | { |
3826 | if (m->type == MEM_TYPE_FLOAT) | |
3827 | { | |
3828 | struct float_block *b = (struct float_block *) m->start; | |
14162469 | 3829 | ptrdiff_t offset = (char *) p - (char *) &b->floats[0]; |
177c0ea7 | 3830 | |
ab6780cd SM |
3831 | /* P must point to the start of a Lisp_Float and not be |
3832 | one of the unused cells in the current float block. */ | |
176bc847 GM |
3833 | return (offset >= 0 |
3834 | && offset % sizeof b->floats[0] == 0 | |
6b61353c | 3835 | && offset < (FLOAT_BLOCK_SIZE * sizeof b->floats[0]) |
34400008 | 3836 | && (b != float_block |
ab6780cd | 3837 | || offset / sizeof b->floats[0] < float_block_index)); |
34400008 GM |
3838 | } |
3839 | else | |
3840 | return 0; | |
3841 | } | |
3842 | ||
3843 | ||
3844 | /* Value is non-zero if P is a pointer to a live Lisp Misc on | |
3845 | the heap. M is a pointer to the mem_block for P. */ | |
3846 | ||
3847 | static INLINE int | |
971de7fb | 3848 | live_misc_p (struct mem_node *m, void *p) |
34400008 GM |
3849 | { |
3850 | if (m->type == MEM_TYPE_MISC) | |
3851 | { | |
3852 | struct marker_block *b = (struct marker_block *) m->start; | |
14162469 | 3853 | ptrdiff_t offset = (char *) p - (char *) &b->markers[0]; |
177c0ea7 | 3854 | |
34400008 GM |
3855 | /* P must point to the start of a Lisp_Misc, not be |
3856 | one of the unused cells in the current misc block, | |
3857 | and not be on the free-list. */ | |
176bc847 GM |
3858 | return (offset >= 0 |
3859 | && offset % sizeof b->markers[0] == 0 | |
6b61353c | 3860 | && offset < (MARKER_BLOCK_SIZE * sizeof b->markers[0]) |
34400008 GM |
3861 | && (b != marker_block |
3862 | || offset / sizeof b->markers[0] < marker_block_index) | |
d314756e | 3863 | && ((union Lisp_Misc *) p)->u_any.type != Lisp_Misc_Free); |
34400008 GM |
3864 | } |
3865 | else | |
3866 | return 0; | |
3867 | } | |
3868 | ||
3869 | ||
3870 | /* Value is non-zero if P is a pointer to a live vector-like object. | |
3871 | M is a pointer to the mem_block for P. */ | |
3872 | ||
3873 | static INLINE int | |
971de7fb | 3874 | live_vector_p (struct mem_node *m, void *p) |
34400008 | 3875 | { |
9c545a55 | 3876 | return (p == m->start && m->type == MEM_TYPE_VECTORLIKE); |
34400008 GM |
3877 | } |
3878 | ||
3879 | ||
2336fe58 | 3880 | /* Value is non-zero if P is a pointer to a live buffer. M is a |
34400008 GM |
3881 | pointer to the mem_block for P. */ |
3882 | ||
3883 | static INLINE int | |
971de7fb | 3884 | live_buffer_p (struct mem_node *m, void *p) |
34400008 GM |
3885 | { |
3886 | /* P must point to the start of the block, and the buffer | |
3887 | must not have been killed. */ | |
3888 | return (m->type == MEM_TYPE_BUFFER | |
3889 | && p == m->start | |
5d8ea120 | 3890 | && !NILP (((struct buffer *) p)->BUFFER_INTERNAL_FIELD (name))); |
34400008 GM |
3891 | } |
3892 | ||
13c844fb GM |
3893 | #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */ |
3894 | ||
3895 | #if GC_MARK_STACK | |
3896 | ||
34400008 GM |
3897 | #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES |
3898 | ||
3899 | /* Array of objects that are kept alive because the C stack contains | |
3900 | a pattern that looks like a reference to them . */ | |
3901 | ||
3902 | #define MAX_ZOMBIES 10 | |
3903 | static Lisp_Object zombies[MAX_ZOMBIES]; | |
3904 | ||
3905 | /* Number of zombie objects. */ | |
3906 | ||
3907 | static int nzombies; | |
3908 | ||
3909 | /* Number of garbage collections. */ | |
3910 | ||
3911 | static int ngcs; | |
3912 | ||
3913 | /* Average percentage of zombies per collection. */ | |
3914 | ||
3915 | static double avg_zombies; | |
3916 | ||
3917 | /* Max. number of live and zombie objects. */ | |
3918 | ||
3919 | static int max_live, max_zombies; | |
3920 | ||
3921 | /* Average number of live objects per GC. */ | |
3922 | ||
3923 | static double avg_live; | |
3924 | ||
a7ca3326 | 3925 | DEFUN ("gc-status", Fgc_status, Sgc_status, 0, 0, "", |
7ee72033 | 3926 | doc: /* Show information about live and zombie objects. */) |
5842a27b | 3927 | (void) |
34400008 | 3928 | { |
83fc9c63 DL |
3929 | Lisp_Object args[8], zombie_list = Qnil; |
3930 | int i; | |
3931 | for (i = 0; i < nzombies; i++) | |
3932 | zombie_list = Fcons (zombies[i], zombie_list); | |
3933 | args[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S"); | |
34400008 GM |
3934 | args[1] = make_number (ngcs); |
3935 | args[2] = make_float (avg_live); | |
3936 | args[3] = make_float (avg_zombies); | |
3937 | args[4] = make_float (avg_zombies / avg_live / 100); | |
3938 | args[5] = make_number (max_live); | |
3939 | args[6] = make_number (max_zombies); | |
83fc9c63 DL |
3940 | args[7] = zombie_list; |
3941 | return Fmessage (8, args); | |
34400008 GM |
3942 | } |
3943 | ||
3944 | #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */ | |
3945 | ||
3946 | ||
182ff242 GM |
3947 | /* Mark OBJ if we can prove it's a Lisp_Object. */ |
3948 | ||
3949 | static INLINE void | |
971de7fb | 3950 | mark_maybe_object (Lisp_Object obj) |
182ff242 | 3951 | { |
b609f591 YM |
3952 | void *po; |
3953 | struct mem_node *m; | |
3954 | ||
3955 | if (INTEGERP (obj)) | |
3956 | return; | |
3957 | ||
3958 | po = (void *) XPNTR (obj); | |
3959 | m = mem_find (po); | |
177c0ea7 | 3960 | |
182ff242 GM |
3961 | if (m != MEM_NIL) |
3962 | { | |
3963 | int mark_p = 0; | |
3964 | ||
8e50cc2d | 3965 | switch (XTYPE (obj)) |
182ff242 GM |
3966 | { |
3967 | case Lisp_String: | |
3968 | mark_p = (live_string_p (m, po) | |
3969 | && !STRING_MARKED_P ((struct Lisp_String *) po)); | |
3970 | break; | |
3971 | ||
3972 | case Lisp_Cons: | |
08b7c2cb | 3973 | mark_p = (live_cons_p (m, po) && !CONS_MARKED_P (XCONS (obj))); |
182ff242 GM |
3974 | break; |
3975 | ||
3976 | case Lisp_Symbol: | |
2336fe58 | 3977 | mark_p = (live_symbol_p (m, po) && !XSYMBOL (obj)->gcmarkbit); |
182ff242 GM |
3978 | break; |
3979 | ||
3980 | case Lisp_Float: | |
ab6780cd | 3981 | mark_p = (live_float_p (m, po) && !FLOAT_MARKED_P (XFLOAT (obj))); |
182ff242 GM |
3982 | break; |
3983 | ||
3984 | case Lisp_Vectorlike: | |
8e50cc2d | 3985 | /* Note: can't check BUFFERP before we know it's a |
182ff242 GM |
3986 | buffer because checking that dereferences the pointer |
3987 | PO which might point anywhere. */ | |
3988 | if (live_vector_p (m, po)) | |
8e50cc2d | 3989 | mark_p = !SUBRP (obj) && !VECTOR_MARKED_P (XVECTOR (obj)); |
182ff242 | 3990 | else if (live_buffer_p (m, po)) |
8e50cc2d | 3991 | mark_p = BUFFERP (obj) && !VECTOR_MARKED_P (XBUFFER (obj)); |
182ff242 GM |
3992 | break; |
3993 | ||
3994 | case Lisp_Misc: | |
67ee9f6e | 3995 | mark_p = (live_misc_p (m, po) && !XMISCANY (obj)->gcmarkbit); |
182ff242 | 3996 | break; |
6bbd7a29 | 3997 | |
2de9f71c | 3998 | default: |
6bbd7a29 | 3999 | break; |
182ff242 GM |
4000 | } |
4001 | ||
4002 | if (mark_p) | |
4003 | { | |
4004 | #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES | |
4005 | if (nzombies < MAX_ZOMBIES) | |
83fc9c63 | 4006 | zombies[nzombies] = obj; |
182ff242 GM |
4007 | ++nzombies; |
4008 | #endif | |
49723c04 | 4009 | mark_object (obj); |
182ff242 GM |
4010 | } |
4011 | } | |
4012 | } | |
ece93c02 GM |
4013 | |
4014 | ||
4015 | /* If P points to Lisp data, mark that as live if it isn't already | |
4016 | marked. */ | |
4017 | ||
4018 | static INLINE void | |
971de7fb | 4019 | mark_maybe_pointer (void *p) |
ece93c02 GM |
4020 | { |
4021 | struct mem_node *m; | |
4022 | ||
5045e68e SM |
4023 | /* Quickly rule out some values which can't point to Lisp data. */ |
4024 | if ((EMACS_INT) p % | |
4025 | #ifdef USE_LSB_TAG | |
4026 | 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */ | |
4027 | #else | |
4028 | 2 /* We assume that Lisp data is aligned on even addresses. */ | |
4029 | #endif | |
4030 | ) | |
ece93c02 | 4031 | return; |
177c0ea7 | 4032 | |
ece93c02 GM |
4033 | m = mem_find (p); |
4034 | if (m != MEM_NIL) | |
4035 | { | |
4036 | Lisp_Object obj = Qnil; | |
177c0ea7 | 4037 | |
ece93c02 GM |
4038 | switch (m->type) |
4039 | { | |
4040 | case MEM_TYPE_NON_LISP: | |
2fe50224 | 4041 | /* Nothing to do; not a pointer to Lisp memory. */ |
ece93c02 | 4042 | break; |
177c0ea7 | 4043 | |
ece93c02 | 4044 | case MEM_TYPE_BUFFER: |
3ef06d12 | 4045 | if (live_buffer_p (m, p) && !VECTOR_MARKED_P((struct buffer *)p)) |
ece93c02 GM |
4046 | XSETVECTOR (obj, p); |
4047 | break; | |
177c0ea7 | 4048 | |
ece93c02 | 4049 | case MEM_TYPE_CONS: |
08b7c2cb | 4050 | if (live_cons_p (m, p) && !CONS_MARKED_P ((struct Lisp_Cons *) p)) |
ece93c02 GM |
4051 | XSETCONS (obj, p); |
4052 | break; | |
177c0ea7 | 4053 | |
ece93c02 GM |
4054 | case MEM_TYPE_STRING: |
4055 | if (live_string_p (m, p) | |
4056 | && !STRING_MARKED_P ((struct Lisp_String *) p)) | |
4057 | XSETSTRING (obj, p); | |
4058 | break; | |
4059 | ||
4060 | case MEM_TYPE_MISC: | |
2336fe58 SM |
4061 | if (live_misc_p (m, p) && !((struct Lisp_Free *) p)->gcmarkbit) |
4062 | XSETMISC (obj, p); | |
ece93c02 | 4063 | break; |
177c0ea7 | 4064 | |
ece93c02 | 4065 | case MEM_TYPE_SYMBOL: |
2336fe58 | 4066 | if (live_symbol_p (m, p) && !((struct Lisp_Symbol *) p)->gcmarkbit) |
ece93c02 GM |
4067 | XSETSYMBOL (obj, p); |
4068 | break; | |
177c0ea7 | 4069 | |
ece93c02 | 4070 | case MEM_TYPE_FLOAT: |
ab6780cd | 4071 | if (live_float_p (m, p) && !FLOAT_MARKED_P (p)) |
ece93c02 GM |
4072 | XSETFLOAT (obj, p); |
4073 | break; | |
177c0ea7 | 4074 | |
9c545a55 | 4075 | case MEM_TYPE_VECTORLIKE: |
ece93c02 GM |
4076 | if (live_vector_p (m, p)) |
4077 | { | |
4078 | Lisp_Object tem; | |
4079 | XSETVECTOR (tem, p); | |
8e50cc2d | 4080 | if (!SUBRP (tem) && !VECTOR_MARKED_P (XVECTOR (tem))) |
ece93c02 GM |
4081 | obj = tem; |
4082 | } | |
4083 | break; | |
4084 | ||
4085 | default: | |
4086 | abort (); | |
4087 | } | |
4088 | ||
8e50cc2d | 4089 | if (!NILP (obj)) |
49723c04 | 4090 | mark_object (obj); |
ece93c02 GM |
4091 | } |
4092 | } | |
4093 | ||
4094 | ||
55a314a5 YM |
4095 | /* Mark Lisp objects referenced from the address range START+OFFSET..END |
4096 | or END+OFFSET..START. */ | |
34400008 | 4097 | |
177c0ea7 | 4098 | static void |
971de7fb | 4099 | mark_memory (void *start, void *end, int offset) |
34400008 GM |
4100 | { |
4101 | Lisp_Object *p; | |
ece93c02 | 4102 | void **pp; |
34400008 GM |
4103 | |
4104 | #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES | |
4105 | nzombies = 0; | |
4106 | #endif | |
4107 | ||
4108 | /* Make START the pointer to the start of the memory region, | |
4109 | if it isn't already. */ | |
4110 | if (end < start) | |
4111 | { | |
4112 | void *tem = start; | |
4113 | start = end; | |
4114 | end = tem; | |
4115 | } | |
ece93c02 GM |
4116 | |
4117 | /* Mark Lisp_Objects. */ | |
55a314a5 | 4118 | for (p = (Lisp_Object *) ((char *) start + offset); (void *) p < end; ++p) |
182ff242 | 4119 | mark_maybe_object (*p); |
ece93c02 GM |
4120 | |
4121 | /* Mark Lisp data pointed to. This is necessary because, in some | |
4122 | situations, the C compiler optimizes Lisp objects away, so that | |
4123 | only a pointer to them remains. Example: | |
4124 | ||
4125 | DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "") | |
7ee72033 | 4126 | () |
ece93c02 GM |
4127 | { |
4128 | Lisp_Object obj = build_string ("test"); | |
4129 | struct Lisp_String *s = XSTRING (obj); | |
4130 | Fgarbage_collect (); | |
4131 | fprintf (stderr, "test `%s'\n", s->data); | |
4132 | return Qnil; | |
4133 | } | |
4134 | ||
4135 | Here, `obj' isn't really used, and the compiler optimizes it | |
4136 | away. The only reference to the life string is through the | |
4137 | pointer `s'. */ | |
177c0ea7 | 4138 | |
55a314a5 | 4139 | for (pp = (void **) ((char *) start + offset); (void *) pp < end; ++pp) |
ece93c02 | 4140 | mark_maybe_pointer (*pp); |
182ff242 GM |
4141 | } |
4142 | ||
30f637f8 DL |
4143 | /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in |
4144 | the GCC system configuration. In gcc 3.2, the only systems for | |
4145 | which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included | |
4146 | by others?) and ns32k-pc532-min. */ | |
182ff242 GM |
4147 | |
4148 | #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS | |
4149 | ||
4150 | static int setjmp_tested_p, longjmps_done; | |
4151 | ||
4152 | #define SETJMP_WILL_LIKELY_WORK "\ | |
4153 | \n\ | |
4154 | Emacs garbage collector has been changed to use conservative stack\n\ | |
4155 | marking. Emacs has determined that the method it uses to do the\n\ | |
4156 | marking will likely work on your system, but this isn't sure.\n\ | |
4157 | \n\ | |
4158 | If you are a system-programmer, or can get the help of a local wizard\n\ | |
4159 | who is, please take a look at the function mark_stack in alloc.c, and\n\ | |
4160 | verify that the methods used are appropriate for your system.\n\ | |
4161 | \n\ | |
d191623b | 4162 | Please mail the result to <emacs-devel@gnu.org>.\n\ |
182ff242 GM |
4163 | " |
4164 | ||
4165 | #define SETJMP_WILL_NOT_WORK "\ | |
4166 | \n\ | |
4167 | Emacs garbage collector has been changed to use conservative stack\n\ | |
4168 | marking. Emacs has determined that the default method it uses to do the\n\ | |
4169 | marking will not work on your system. We will need a system-dependent\n\ | |
4170 | solution for your system.\n\ | |
4171 | \n\ | |
4172 | Please take a look at the function mark_stack in alloc.c, and\n\ | |
4173 | try to find a way to make it work on your system.\n\ | |
30f637f8 DL |
4174 | \n\ |
4175 | Note that you may get false negatives, depending on the compiler.\n\ | |
4176 | In particular, you need to use -O with GCC for this test.\n\ | |
4177 | \n\ | |
d191623b | 4178 | Please mail the result to <emacs-devel@gnu.org>.\n\ |
182ff242 GM |
4179 | " |
4180 | ||
4181 | ||
4182 | /* Perform a quick check if it looks like setjmp saves registers in a | |
4183 | jmp_buf. Print a message to stderr saying so. When this test | |
4184 | succeeds, this is _not_ a proof that setjmp is sufficient for | |
4185 | conservative stack marking. Only the sources or a disassembly | |
4186 | can prove that. */ | |
4187 | ||
4188 | static void | |
2018939f | 4189 | test_setjmp (void) |
182ff242 GM |
4190 | { |
4191 | char buf[10]; | |
4192 | register int x; | |
4193 | jmp_buf jbuf; | |
4194 | int result = 0; | |
4195 | ||
4196 | /* Arrange for X to be put in a register. */ | |
4197 | sprintf (buf, "1"); | |
4198 | x = strlen (buf); | |
4199 | x = 2 * x - 1; | |
4200 | ||
4201 | setjmp (jbuf); | |
4202 | if (longjmps_done == 1) | |
34400008 | 4203 | { |
182ff242 | 4204 | /* Came here after the longjmp at the end of the function. |
34400008 | 4205 | |
182ff242 GM |
4206 | If x == 1, the longjmp has restored the register to its |
4207 | value before the setjmp, and we can hope that setjmp | |
4208 | saves all such registers in the jmp_buf, although that | |
4209 | isn't sure. | |
34400008 | 4210 | |
182ff242 GM |
4211 | For other values of X, either something really strange is |
4212 | taking place, or the setjmp just didn't save the register. */ | |
4213 | ||
4214 | if (x == 1) | |
4215 | fprintf (stderr, SETJMP_WILL_LIKELY_WORK); | |
4216 | else | |
4217 | { | |
4218 | fprintf (stderr, SETJMP_WILL_NOT_WORK); | |
4219 | exit (1); | |
34400008 GM |
4220 | } |
4221 | } | |
182ff242 GM |
4222 | |
4223 | ++longjmps_done; | |
4224 | x = 2; | |
4225 | if (longjmps_done == 1) | |
4226 | longjmp (jbuf, 1); | |
34400008 GM |
4227 | } |
4228 | ||
182ff242 GM |
4229 | #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */ |
4230 | ||
34400008 GM |
4231 | |
4232 | #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS | |
4233 | ||
4234 | /* Abort if anything GCPRO'd doesn't survive the GC. */ | |
4235 | ||
4236 | static void | |
2018939f | 4237 | check_gcpros (void) |
34400008 GM |
4238 | { |
4239 | struct gcpro *p; | |
c5101a77 | 4240 | size_t i; |
34400008 GM |
4241 | |
4242 | for (p = gcprolist; p; p = p->next) | |
4243 | for (i = 0; i < p->nvars; ++i) | |
4244 | if (!survives_gc_p (p->var[i])) | |
92cc28b2 SM |
4245 | /* FIXME: It's not necessarily a bug. It might just be that the |
4246 | GCPRO is unnecessary or should release the object sooner. */ | |
34400008 GM |
4247 | abort (); |
4248 | } | |
4249 | ||
4250 | #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES | |
4251 | ||
4252 | static void | |
2018939f | 4253 | dump_zombies (void) |
34400008 GM |
4254 | { |
4255 | int i; | |
4256 | ||
4257 | fprintf (stderr, "\nZombies kept alive = %d:\n", nzombies); | |
4258 | for (i = 0; i < min (MAX_ZOMBIES, nzombies); ++i) | |
4259 | { | |
4260 | fprintf (stderr, " %d = ", i); | |
4261 | debug_print (zombies[i]); | |
4262 | } | |
4263 | } | |
4264 | ||
4265 | #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */ | |
4266 | ||
4267 | ||
182ff242 GM |
4268 | /* Mark live Lisp objects on the C stack. |
4269 | ||
4270 | There are several system-dependent problems to consider when | |
4271 | porting this to new architectures: | |
4272 | ||
4273 | Processor Registers | |
4274 | ||
4275 | We have to mark Lisp objects in CPU registers that can hold local | |
4276 | variables or are used to pass parameters. | |
4277 | ||
4278 | If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to | |
4279 | something that either saves relevant registers on the stack, or | |
4280 | calls mark_maybe_object passing it each register's contents. | |
4281 | ||
4282 | If GC_SAVE_REGISTERS_ON_STACK is not defined, the current | |
4283 | implementation assumes that calling setjmp saves registers we need | |
4284 | to see in a jmp_buf which itself lies on the stack. This doesn't | |
4285 | have to be true! It must be verified for each system, possibly | |
4286 | by taking a look at the source code of setjmp. | |
4287 | ||
2018939f AS |
4288 | If __builtin_unwind_init is available (defined by GCC >= 2.8) we |
4289 | can use it as a machine independent method to store all registers | |
4290 | to the stack. In this case the macros described in the previous | |
4291 | two paragraphs are not used. | |
4292 | ||
182ff242 GM |
4293 | Stack Layout |
4294 | ||
4295 | Architectures differ in the way their processor stack is organized. | |
4296 | For example, the stack might look like this | |
4297 | ||
4298 | +----------------+ | |
4299 | | Lisp_Object | size = 4 | |
4300 | +----------------+ | |
4301 | | something else | size = 2 | |
4302 | +----------------+ | |
4303 | | Lisp_Object | size = 4 | |
4304 | +----------------+ | |
4305 | | ... | | |
4306 | ||
4307 | In such a case, not every Lisp_Object will be aligned equally. To | |
4308 | find all Lisp_Object on the stack it won't be sufficient to walk | |
4309 | the stack in steps of 4 bytes. Instead, two passes will be | |
4310 | necessary, one starting at the start of the stack, and a second | |
4311 | pass starting at the start of the stack + 2. Likewise, if the | |
4312 | minimal alignment of Lisp_Objects on the stack is 1, four passes | |
4313 | would be necessary, each one starting with one byte more offset | |
4314 | from the stack start. | |
4315 | ||
4316 | The current code assumes by default that Lisp_Objects are aligned | |
4317 | equally on the stack. */ | |
34400008 GM |
4318 | |
4319 | static void | |
971de7fb | 4320 | mark_stack (void) |
34400008 | 4321 | { |
630909a5 | 4322 | int i; |
34400008 GM |
4323 | void *end; |
4324 | ||
2018939f AS |
4325 | #ifdef HAVE___BUILTIN_UNWIND_INIT |
4326 | /* Force callee-saved registers and register windows onto the stack. | |
4327 | This is the preferred method if available, obviating the need for | |
4328 | machine dependent methods. */ | |
4329 | __builtin_unwind_init (); | |
4330 | end = &end; | |
4331 | #else /* not HAVE___BUILTIN_UNWIND_INIT */ | |
dff45157 PE |
4332 | #ifndef GC_SAVE_REGISTERS_ON_STACK |
4333 | /* jmp_buf may not be aligned enough on darwin-ppc64 */ | |
4334 | union aligned_jmpbuf { | |
4335 | Lisp_Object o; | |
4336 | jmp_buf j; | |
4337 | } j; | |
4338 | volatile int stack_grows_down_p = (char *) &j > (char *) stack_base; | |
4339 | #endif | |
34400008 GM |
4340 | /* This trick flushes the register windows so that all the state of |
4341 | the process is contained in the stack. */ | |
ab6780cd | 4342 | /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is |
422eec7e DL |
4343 | needed on ia64 too. See mach_dep.c, where it also says inline |
4344 | assembler doesn't work with relevant proprietary compilers. */ | |
4a00783e | 4345 | #ifdef __sparc__ |
4d18a7a2 DN |
4346 | #if defined (__sparc64__) && defined (__FreeBSD__) |
4347 | /* FreeBSD does not have a ta 3 handler. */ | |
4c1616be CY |
4348 | asm ("flushw"); |
4349 | #else | |
34400008 | 4350 | asm ("ta 3"); |
4c1616be | 4351 | #endif |
34400008 | 4352 | #endif |
177c0ea7 | 4353 | |
34400008 GM |
4354 | /* Save registers that we need to see on the stack. We need to see |
4355 | registers used to hold register variables and registers used to | |
4356 | pass parameters. */ | |
4357 | #ifdef GC_SAVE_REGISTERS_ON_STACK | |
4358 | GC_SAVE_REGISTERS_ON_STACK (end); | |
182ff242 | 4359 | #else /* not GC_SAVE_REGISTERS_ON_STACK */ |
177c0ea7 | 4360 | |
182ff242 GM |
4361 | #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that |
4362 | setjmp will definitely work, test it | |
4363 | and print a message with the result | |
4364 | of the test. */ | |
4365 | if (!setjmp_tested_p) | |
4366 | { | |
4367 | setjmp_tested_p = 1; | |
4368 | test_setjmp (); | |
4369 | } | |
4370 | #endif /* GC_SETJMP_WORKS */ | |
177c0ea7 | 4371 | |
55a314a5 | 4372 | setjmp (j.j); |
34400008 | 4373 | end = stack_grows_down_p ? (char *) &j + sizeof j : (char *) &j; |
182ff242 | 4374 | #endif /* not GC_SAVE_REGISTERS_ON_STACK */ |
2018939f | 4375 | #endif /* not HAVE___BUILTIN_UNWIND_INIT */ |
34400008 GM |
4376 | |
4377 | /* This assumes that the stack is a contiguous region in memory. If | |
182ff242 GM |
4378 | that's not the case, something has to be done here to iterate |
4379 | over the stack segments. */ | |
630909a5 | 4380 | #ifndef GC_LISP_OBJECT_ALIGNMENT |
422eec7e DL |
4381 | #ifdef __GNUC__ |
4382 | #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object) | |
4383 | #else | |
630909a5 | 4384 | #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object) |
422eec7e | 4385 | #endif |
182ff242 | 4386 | #endif |
24452cd5 | 4387 | for (i = 0; i < sizeof (Lisp_Object); i += GC_LISP_OBJECT_ALIGNMENT) |
55a314a5 | 4388 | mark_memory (stack_base, end, i); |
4dec23ff AS |
4389 | /* Allow for marking a secondary stack, like the register stack on the |
4390 | ia64. */ | |
4391 | #ifdef GC_MARK_SECONDARY_STACK | |
4392 | GC_MARK_SECONDARY_STACK (); | |
4393 | #endif | |
34400008 GM |
4394 | |
4395 | #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS | |
4396 | check_gcpros (); | |
4397 | #endif | |
4398 | } | |
4399 | ||
34400008 GM |
4400 | #endif /* GC_MARK_STACK != 0 */ |
4401 | ||
4402 | ||
7ffb6955 | 4403 | /* Determine whether it is safe to access memory at address P. */ |
d3d47262 | 4404 | static int |
971de7fb | 4405 | valid_pointer_p (void *p) |
7ffb6955 | 4406 | { |
f892cf9c EZ |
4407 | #ifdef WINDOWSNT |
4408 | return w32_valid_pointer_p (p, 16); | |
4409 | #else | |
7ffb6955 KS |
4410 | int fd; |
4411 | ||
4412 | /* Obviously, we cannot just access it (we would SEGV trying), so we | |
4413 | trick the o/s to tell us whether p is a valid pointer. | |
4414 | Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may | |
4415 | not validate p in that case. */ | |
4416 | ||
4417 | if ((fd = emacs_open ("__Valid__Lisp__Object__", O_CREAT | O_WRONLY | O_TRUNC, 0666)) >= 0) | |
4418 | { | |
4419 | int valid = (emacs_write (fd, (char *)p, 16) == 16); | |
4420 | emacs_close (fd); | |
4421 | unlink ("__Valid__Lisp__Object__"); | |
4422 | return valid; | |
4423 | } | |
4424 | ||
4425 | return -1; | |
f892cf9c | 4426 | #endif |
7ffb6955 | 4427 | } |
3cd55735 KS |
4428 | |
4429 | /* Return 1 if OBJ is a valid lisp object. | |
4430 | Return 0 if OBJ is NOT a valid lisp object. | |
4431 | Return -1 if we cannot validate OBJ. | |
7c0ab7d9 RS |
4432 | This function can be quite slow, |
4433 | so it should only be used in code for manual debugging. */ | |
3cd55735 KS |
4434 | |
4435 | int | |
971de7fb | 4436 | valid_lisp_object_p (Lisp_Object obj) |
3cd55735 | 4437 | { |
de7124a7 | 4438 | void *p; |
7ffb6955 | 4439 | #if GC_MARK_STACK |
3cd55735 | 4440 | struct mem_node *m; |
de7124a7 | 4441 | #endif |
3cd55735 KS |
4442 | |
4443 | if (INTEGERP (obj)) | |
4444 | return 1; | |
4445 | ||
4446 | p = (void *) XPNTR (obj); | |
3cd55735 KS |
4447 | if (PURE_POINTER_P (p)) |
4448 | return 1; | |
4449 | ||
de7124a7 | 4450 | #if !GC_MARK_STACK |
7ffb6955 | 4451 | return valid_pointer_p (p); |
de7124a7 KS |
4452 | #else |
4453 | ||
3cd55735 KS |
4454 | m = mem_find (p); |
4455 | ||
4456 | if (m == MEM_NIL) | |
7ffb6955 KS |
4457 | { |
4458 | int valid = valid_pointer_p (p); | |
4459 | if (valid <= 0) | |
4460 | return valid; | |
4461 | ||
4462 | if (SUBRP (obj)) | |
4463 | return 1; | |
4464 | ||
4465 | return 0; | |
4466 | } | |
3cd55735 KS |
4467 | |
4468 | switch (m->type) | |
4469 | { | |
4470 | case MEM_TYPE_NON_LISP: | |
4471 | return 0; | |
4472 | ||
4473 | case MEM_TYPE_BUFFER: | |
4474 | return live_buffer_p (m, p); | |
4475 | ||
4476 | case MEM_TYPE_CONS: | |
4477 | return live_cons_p (m, p); | |
4478 | ||
4479 | case MEM_TYPE_STRING: | |
4480 | return live_string_p (m, p); | |
4481 | ||
4482 | case MEM_TYPE_MISC: | |
4483 | return live_misc_p (m, p); | |
4484 | ||
4485 | case MEM_TYPE_SYMBOL: | |
4486 | return live_symbol_p (m, p); | |
4487 | ||
4488 | case MEM_TYPE_FLOAT: | |
4489 | return live_float_p (m, p); | |
4490 | ||
9c545a55 | 4491 | case MEM_TYPE_VECTORLIKE: |
3cd55735 KS |
4492 | return live_vector_p (m, p); |
4493 | ||
4494 | default: | |
4495 | break; | |
4496 | } | |
4497 | ||
4498 | return 0; | |
4499 | #endif | |
4500 | } | |
4501 | ||
4502 | ||
4503 | ||
34400008 | 4504 | \f |
2e471eb5 GM |
4505 | /*********************************************************************** |
4506 | Pure Storage Management | |
4507 | ***********************************************************************/ | |
4508 | ||
1f0b3fd2 GM |
4509 | /* Allocate room for SIZE bytes from pure Lisp storage and return a |
4510 | pointer to it. TYPE is the Lisp type for which the memory is | |
e5bc14d4 | 4511 | allocated. TYPE < 0 means it's not used for a Lisp object. */ |
1f0b3fd2 GM |
4512 | |
4513 | static POINTER_TYPE * | |
971de7fb | 4514 | pure_alloc (size_t size, int type) |
1f0b3fd2 | 4515 | { |
1f0b3fd2 | 4516 | POINTER_TYPE *result; |
6b61353c KH |
4517 | #ifdef USE_LSB_TAG |
4518 | size_t alignment = (1 << GCTYPEBITS); | |
4519 | #else | |
44117420 | 4520 | size_t alignment = sizeof (EMACS_INT); |
1f0b3fd2 GM |
4521 | |
4522 | /* Give Lisp_Floats an extra alignment. */ | |
4523 | if (type == Lisp_Float) | |
4524 | { | |
1f0b3fd2 GM |
4525 | #if defined __GNUC__ && __GNUC__ >= 2 |
4526 | alignment = __alignof (struct Lisp_Float); | |
4527 | #else | |
4528 | alignment = sizeof (struct Lisp_Float); | |
4529 | #endif | |
9e713715 | 4530 | } |
6b61353c | 4531 | #endif |
1f0b3fd2 | 4532 | |
44117420 | 4533 | again: |
e5bc14d4 YM |
4534 | if (type >= 0) |
4535 | { | |
4536 | /* Allocate space for a Lisp object from the beginning of the free | |
4537 | space with taking account of alignment. */ | |
4538 | result = ALIGN (purebeg + pure_bytes_used_lisp, alignment); | |
4539 | pure_bytes_used_lisp = ((char *)result - (char *)purebeg) + size; | |
4540 | } | |
4541 | else | |
4542 | { | |
4543 | /* Allocate space for a non-Lisp object from the end of the free | |
4544 | space. */ | |
4545 | pure_bytes_used_non_lisp += size; | |
4546 | result = purebeg + pure_size - pure_bytes_used_non_lisp; | |
4547 | } | |
4548 | pure_bytes_used = pure_bytes_used_lisp + pure_bytes_used_non_lisp; | |
44117420 KS |
4549 | |
4550 | if (pure_bytes_used <= pure_size) | |
4551 | return result; | |
4552 | ||
4553 | /* Don't allocate a large amount here, | |
4554 | because it might get mmap'd and then its address | |
4555 | might not be usable. */ | |
4556 | purebeg = (char *) xmalloc (10000); | |
4557 | pure_size = 10000; | |
4558 | pure_bytes_used_before_overflow += pure_bytes_used - size; | |
4559 | pure_bytes_used = 0; | |
e5bc14d4 | 4560 | pure_bytes_used_lisp = pure_bytes_used_non_lisp = 0; |
44117420 | 4561 | goto again; |
1f0b3fd2 GM |
4562 | } |
4563 | ||
4564 | ||
852f8cdc | 4565 | /* Print a warning if PURESIZE is too small. */ |
9e713715 GM |
4566 | |
4567 | void | |
971de7fb | 4568 | check_pure_size (void) |
9e713715 GM |
4569 | { |
4570 | if (pure_bytes_used_before_overflow) | |
c2982e87 PE |
4571 | message (("emacs:0:Pure Lisp storage overflow (approx. %"pI"d" |
4572 | " bytes needed)"), | |
4573 | pure_bytes_used + pure_bytes_used_before_overflow); | |
9e713715 GM |
4574 | } |
4575 | ||
4576 | ||
79fd0489 YM |
4577 | /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from |
4578 | the non-Lisp data pool of the pure storage, and return its start | |
4579 | address. Return NULL if not found. */ | |
4580 | ||
4581 | static char * | |
14162469 | 4582 | find_string_data_in_pure (const char *data, EMACS_INT nbytes) |
79fd0489 | 4583 | { |
14162469 EZ |
4584 | int i; |
4585 | EMACS_INT skip, bm_skip[256], last_char_skip, infinity, start, start_max; | |
2aff7c53 | 4586 | const unsigned char *p; |
79fd0489 YM |
4587 | char *non_lisp_beg; |
4588 | ||
4589 | if (pure_bytes_used_non_lisp < nbytes + 1) | |
4590 | return NULL; | |
4591 | ||
4592 | /* Set up the Boyer-Moore table. */ | |
4593 | skip = nbytes + 1; | |
4594 | for (i = 0; i < 256; i++) | |
4595 | bm_skip[i] = skip; | |
4596 | ||
2aff7c53 | 4597 | p = (const unsigned char *) data; |
79fd0489 YM |
4598 | while (--skip > 0) |
4599 | bm_skip[*p++] = skip; | |
4600 | ||
4601 | last_char_skip = bm_skip['\0']; | |
4602 | ||
4603 | non_lisp_beg = purebeg + pure_size - pure_bytes_used_non_lisp; | |
4604 | start_max = pure_bytes_used_non_lisp - (nbytes + 1); | |
4605 | ||
4606 | /* See the comments in the function `boyer_moore' (search.c) for the | |
4607 | use of `infinity'. */ | |
4608 | infinity = pure_bytes_used_non_lisp + 1; | |
4609 | bm_skip['\0'] = infinity; | |
4610 | ||
2aff7c53 | 4611 | p = (const unsigned char *) non_lisp_beg + nbytes; |
79fd0489 YM |
4612 | start = 0; |
4613 | do | |
4614 | { | |
4615 | /* Check the last character (== '\0'). */ | |
4616 | do | |
4617 | { | |
4618 | start += bm_skip[*(p + start)]; | |
4619 | } | |
4620 | while (start <= start_max); | |
4621 | ||
4622 | if (start < infinity) | |
4623 | /* Couldn't find the last character. */ | |
4624 | return NULL; | |
4625 | ||
4626 | /* No less than `infinity' means we could find the last | |
4627 | character at `p[start - infinity]'. */ | |
4628 | start -= infinity; | |
4629 | ||
4630 | /* Check the remaining characters. */ | |
4631 | if (memcmp (data, non_lisp_beg + start, nbytes) == 0) | |
4632 | /* Found. */ | |
4633 | return non_lisp_beg + start; | |
4634 | ||
4635 | start += last_char_skip; | |
4636 | } | |
4637 | while (start <= start_max); | |
4638 | ||
4639 | return NULL; | |
4640 | } | |
4641 | ||
4642 | ||
2e471eb5 GM |
4643 | /* Return a string allocated in pure space. DATA is a buffer holding |
4644 | NCHARS characters, and NBYTES bytes of string data. MULTIBYTE | |
4645 | non-zero means make the result string multibyte. | |
1a4f1e2c | 4646 | |
2e471eb5 GM |
4647 | Must get an error if pure storage is full, since if it cannot hold |
4648 | a large string it may be able to hold conses that point to that | |
4649 | string; then the string is not protected from gc. */ | |
7146af97 JB |
4650 | |
4651 | Lisp_Object | |
14162469 EZ |
4652 | make_pure_string (const char *data, |
4653 | EMACS_INT nchars, EMACS_INT nbytes, int multibyte) | |
7146af97 | 4654 | { |
2e471eb5 GM |
4655 | Lisp_Object string; |
4656 | struct Lisp_String *s; | |
c0696668 | 4657 | |
1f0b3fd2 | 4658 | s = (struct Lisp_String *) pure_alloc (sizeof *s, Lisp_String); |
90256841 | 4659 | s->data = (unsigned char *) find_string_data_in_pure (data, nbytes); |
79fd0489 YM |
4660 | if (s->data == NULL) |
4661 | { | |
4662 | s->data = (unsigned char *) pure_alloc (nbytes + 1, -1); | |
72af86bd | 4663 | memcpy (s->data, data, nbytes); |
79fd0489 YM |
4664 | s->data[nbytes] = '\0'; |
4665 | } | |
2e471eb5 GM |
4666 | s->size = nchars; |
4667 | s->size_byte = multibyte ? nbytes : -1; | |
2e471eb5 | 4668 | s->intervals = NULL_INTERVAL; |
2e471eb5 GM |
4669 | XSETSTRING (string, s); |
4670 | return string; | |
7146af97 JB |
4671 | } |
4672 | ||
a56eaaef DN |
4673 | /* Return a string a string allocated in pure space. Do not allocate |
4674 | the string data, just point to DATA. */ | |
4675 | ||
4676 | Lisp_Object | |
4677 | make_pure_c_string (const char *data) | |
4678 | { | |
4679 | Lisp_Object string; | |
4680 | struct Lisp_String *s; | |
14162469 | 4681 | EMACS_INT nchars = strlen (data); |
a56eaaef DN |
4682 | |
4683 | s = (struct Lisp_String *) pure_alloc (sizeof *s, Lisp_String); | |
4684 | s->size = nchars; | |
4685 | s->size_byte = -1; | |
323637a2 | 4686 | s->data = (unsigned char *) data; |
a56eaaef DN |
4687 | s->intervals = NULL_INTERVAL; |
4688 | XSETSTRING (string, s); | |
4689 | return string; | |
4690 | } | |
2e471eb5 | 4691 | |
34400008 GM |
4692 | /* Return a cons allocated from pure space. Give it pure copies |
4693 | of CAR as car and CDR as cdr. */ | |
4694 | ||
7146af97 | 4695 | Lisp_Object |
971de7fb | 4696 | pure_cons (Lisp_Object car, Lisp_Object cdr) |
7146af97 JB |
4697 | { |
4698 | register Lisp_Object new; | |
1f0b3fd2 | 4699 | struct Lisp_Cons *p; |
7146af97 | 4700 | |
1f0b3fd2 GM |
4701 | p = (struct Lisp_Cons *) pure_alloc (sizeof *p, Lisp_Cons); |
4702 | XSETCONS (new, p); | |
f3fbd155 KR |
4703 | XSETCAR (new, Fpurecopy (car)); |
4704 | XSETCDR (new, Fpurecopy (cdr)); | |
7146af97 JB |
4705 | return new; |
4706 | } | |
4707 | ||
7146af97 | 4708 | |
34400008 GM |
4709 | /* Value is a float object with value NUM allocated from pure space. */ |
4710 | ||
d3d47262 | 4711 | static Lisp_Object |
971de7fb | 4712 | make_pure_float (double num) |
7146af97 JB |
4713 | { |
4714 | register Lisp_Object new; | |
1f0b3fd2 | 4715 | struct Lisp_Float *p; |
7146af97 | 4716 | |
1f0b3fd2 GM |
4717 | p = (struct Lisp_Float *) pure_alloc (sizeof *p, Lisp_Float); |
4718 | XSETFLOAT (new, p); | |
f601cdf3 | 4719 | XFLOAT_INIT (new, num); |
7146af97 JB |
4720 | return new; |
4721 | } | |
4722 | ||
34400008 GM |
4723 | |
4724 | /* Return a vector with room for LEN Lisp_Objects allocated from | |
4725 | pure space. */ | |
4726 | ||
7146af97 | 4727 | Lisp_Object |
971de7fb | 4728 | make_pure_vector (EMACS_INT len) |
7146af97 | 4729 | { |
1f0b3fd2 GM |
4730 | Lisp_Object new; |
4731 | struct Lisp_Vector *p; | |
36372bf9 PE |
4732 | size_t size = (offsetof (struct Lisp_Vector, contents) |
4733 | + len * sizeof (Lisp_Object)); | |
7146af97 | 4734 | |
1f0b3fd2 GM |
4735 | p = (struct Lisp_Vector *) pure_alloc (size, Lisp_Vectorlike); |
4736 | XSETVECTOR (new, p); | |
eab3844f | 4737 | XVECTOR (new)->header.size = len; |
7146af97 JB |
4738 | return new; |
4739 | } | |
4740 | ||
34400008 | 4741 | |
a7ca3326 | 4742 | DEFUN ("purecopy", Fpurecopy, Spurecopy, 1, 1, 0, |
909e3b33 | 4743 | doc: /* Make a copy of object OBJ in pure storage. |
228299fa | 4744 | Recursively copies contents of vectors and cons cells. |
7ee72033 | 4745 | Does not copy symbols. Copies strings without text properties. */) |
5842a27b | 4746 | (register Lisp_Object obj) |
7146af97 | 4747 | { |
265a9e55 | 4748 | if (NILP (Vpurify_flag)) |
7146af97 JB |
4749 | return obj; |
4750 | ||
1f0b3fd2 | 4751 | if (PURE_POINTER_P (XPNTR (obj))) |
7146af97 JB |
4752 | return obj; |
4753 | ||
e9515805 SM |
4754 | if (HASH_TABLE_P (Vpurify_flag)) /* Hash consing. */ |
4755 | { | |
4756 | Lisp_Object tmp = Fgethash (obj, Vpurify_flag, Qnil); | |
4757 | if (!NILP (tmp)) | |
4758 | return tmp; | |
4759 | } | |
4760 | ||
d6dd74bb | 4761 | if (CONSP (obj)) |
e9515805 | 4762 | obj = pure_cons (XCAR (obj), XCDR (obj)); |
d6dd74bb | 4763 | else if (FLOATP (obj)) |
e9515805 | 4764 | obj = make_pure_float (XFLOAT_DATA (obj)); |
d6dd74bb | 4765 | else if (STRINGP (obj)) |
42a5b22f | 4766 | obj = make_pure_string (SSDATA (obj), SCHARS (obj), |
e9515805 SM |
4767 | SBYTES (obj), |
4768 | STRING_MULTIBYTE (obj)); | |
876c194c | 4769 | else if (COMPILEDP (obj) || VECTORP (obj)) |
d6dd74bb KH |
4770 | { |
4771 | register struct Lisp_Vector *vec; | |
14162469 | 4772 | register EMACS_INT i; |
6b61353c | 4773 | EMACS_INT size; |
d6dd74bb | 4774 | |
eab3844f | 4775 | size = XVECTOR_SIZE (obj); |
7d535c68 KH |
4776 | if (size & PSEUDOVECTOR_FLAG) |
4777 | size &= PSEUDOVECTOR_SIZE_MASK; | |
6b61353c | 4778 | vec = XVECTOR (make_pure_vector (size)); |
d6dd74bb KH |
4779 | for (i = 0; i < size; i++) |
4780 | vec->contents[i] = Fpurecopy (XVECTOR (obj)->contents[i]); | |
876c194c | 4781 | if (COMPILEDP (obj)) |
985773c9 | 4782 | { |
876c194c SM |
4783 | XSETPVECTYPE (vec, PVEC_COMPILED); |
4784 | XSETCOMPILED (obj, vec); | |
985773c9 | 4785 | } |
d6dd74bb KH |
4786 | else |
4787 | XSETVECTOR (obj, vec); | |
7146af97 | 4788 | } |
d6dd74bb KH |
4789 | else if (MARKERP (obj)) |
4790 | error ("Attempt to copy a marker to pure storage"); | |
e9515805 SM |
4791 | else |
4792 | /* Not purified, don't hash-cons. */ | |
4793 | return obj; | |
4794 | ||
4795 | if (HASH_TABLE_P (Vpurify_flag)) /* Hash consing. */ | |
4796 | Fputhash (obj, obj, Vpurify_flag); | |
6bbd7a29 GM |
4797 | |
4798 | return obj; | |
7146af97 | 4799 | } |
2e471eb5 | 4800 | |
34400008 | 4801 | |
7146af97 | 4802 | \f |
34400008 GM |
4803 | /*********************************************************************** |
4804 | Protection from GC | |
4805 | ***********************************************************************/ | |
4806 | ||
2e471eb5 GM |
4807 | /* Put an entry in staticvec, pointing at the variable with address |
4808 | VARADDRESS. */ | |
7146af97 JB |
4809 | |
4810 | void | |
971de7fb | 4811 | staticpro (Lisp_Object *varaddress) |
7146af97 JB |
4812 | { |
4813 | staticvec[staticidx++] = varaddress; | |
4814 | if (staticidx >= NSTATICS) | |
4815 | abort (); | |
4816 | } | |
4817 | ||
7146af97 | 4818 | \f |
34400008 GM |
4819 | /*********************************************************************** |
4820 | Protection from GC | |
4821 | ***********************************************************************/ | |
1a4f1e2c | 4822 | |
e8197642 RS |
4823 | /* Temporarily prevent garbage collection. */ |
4824 | ||
4825 | int | |
971de7fb | 4826 | inhibit_garbage_collection (void) |
e8197642 | 4827 | { |
aed13378 | 4828 | int count = SPECPDL_INDEX (); |
54defd0d AS |
4829 | int nbits = min (VALBITS, BITS_PER_INT); |
4830 | ||
4831 | specbind (Qgc_cons_threshold, make_number (((EMACS_INT) 1 << (nbits - 1)) - 1)); | |
e8197642 RS |
4832 | return count; |
4833 | } | |
4834 | ||
34400008 | 4835 | |
a7ca3326 | 4836 | DEFUN ("garbage-collect", Fgarbage_collect, Sgarbage_collect, 0, 0, "", |
7ee72033 | 4837 | doc: /* Reclaim storage for Lisp objects no longer needed. |
e1e37596 RS |
4838 | Garbage collection happens automatically if you cons more than |
4839 | `gc-cons-threshold' bytes of Lisp data since previous garbage collection. | |
4840 | `garbage-collect' normally returns a list with info on amount of space in use: | |
228299fa GM |
4841 | ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS) |
4842 | (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS | |
4843 | (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS) | |
4844 | (USED-STRINGS . FREE-STRINGS)) | |
e1e37596 RS |
4845 | However, if there was overflow in pure space, `garbage-collect' |
4846 | returns nil, because real GC can't be done. */) | |
5842a27b | 4847 | (void) |
7146af97 | 4848 | { |
7146af97 | 4849 | register struct specbinding *bind; |
7146af97 | 4850 | char stack_top_variable; |
c5101a77 | 4851 | register size_t i; |
6efc7df7 | 4852 | int message_p; |
96117bc7 | 4853 | Lisp_Object total[8]; |
331379bf | 4854 | int count = SPECPDL_INDEX (); |
2c5bd608 DL |
4855 | EMACS_TIME t1, t2, t3; |
4856 | ||
3de0effb RS |
4857 | if (abort_on_gc) |
4858 | abort (); | |
4859 | ||
9e713715 GM |
4860 | /* Can't GC if pure storage overflowed because we can't determine |
4861 | if something is a pure object or not. */ | |
4862 | if (pure_bytes_used_before_overflow) | |
4863 | return Qnil; | |
4864 | ||
bbc012e0 KS |
4865 | CHECK_CONS_LIST (); |
4866 | ||
3c7e66a8 RS |
4867 | /* Don't keep undo information around forever. |
4868 | Do this early on, so it is no problem if the user quits. */ | |
4869 | { | |
4870 | register struct buffer *nextb = all_buffers; | |
4871 | ||
4872 | while (nextb) | |
4873 | { | |
4874 | /* If a buffer's undo list is Qt, that means that undo is | |
4875 | turned off in that buffer. Calling truncate_undo_list on | |
4876 | Qt tends to return NULL, which effectively turns undo back on. | |
4877 | So don't call truncate_undo_list if undo_list is Qt. */ | |
5d8ea120 | 4878 | if (! NILP (nextb->BUFFER_INTERNAL_FIELD (name)) && ! EQ (nextb->BUFFER_INTERNAL_FIELD (undo_list), Qt)) |
3c7e66a8 RS |
4879 | truncate_undo_list (nextb); |
4880 | ||
4881 | /* Shrink buffer gaps, but skip indirect and dead buffers. */ | |
5d8ea120 | 4882 | if (nextb->base_buffer == 0 && !NILP (nextb->BUFFER_INTERNAL_FIELD (name)) |
dc7b4525 | 4883 | && ! nextb->text->inhibit_shrinking) |
3c7e66a8 RS |
4884 | { |
4885 | /* If a buffer's gap size is more than 10% of the buffer | |
4886 | size, or larger than 2000 bytes, then shrink it | |
4887 | accordingly. Keep a minimum size of 20 bytes. */ | |
4888 | int size = min (2000, max (20, (nextb->text->z_byte / 10))); | |
4889 | ||
4890 | if (nextb->text->gap_size > size) | |
4891 | { | |
4892 | struct buffer *save_current = current_buffer; | |
4893 | current_buffer = nextb; | |
4894 | make_gap (-(nextb->text->gap_size - size)); | |
4895 | current_buffer = save_current; | |
4896 | } | |
4897 | } | |
4898 | ||
eab3844f | 4899 | nextb = nextb->header.next.buffer; |
3c7e66a8 RS |
4900 | } |
4901 | } | |
4902 | ||
4903 | EMACS_GET_TIME (t1); | |
4904 | ||
58595309 KH |
4905 | /* In case user calls debug_print during GC, |
4906 | don't let that cause a recursive GC. */ | |
4907 | consing_since_gc = 0; | |
4908 | ||
6efc7df7 GM |
4909 | /* Save what's currently displayed in the echo area. */ |
4910 | message_p = push_message (); | |
c55b0da6 | 4911 | record_unwind_protect (pop_message_unwind, Qnil); |
41c28a37 | 4912 | |
7146af97 JB |
4913 | /* Save a copy of the contents of the stack, for debugging. */ |
4914 | #if MAX_SAVE_STACK > 0 | |
265a9e55 | 4915 | if (NILP (Vpurify_flag)) |
7146af97 | 4916 | { |
dd3f25f7 PE |
4917 | char *stack; |
4918 | size_t stack_size; | |
4919 | if (&stack_top_variable < stack_bottom) | |
7146af97 | 4920 | { |
dd3f25f7 PE |
4921 | stack = &stack_top_variable; |
4922 | stack_size = stack_bottom - &stack_top_variable; | |
4923 | } | |
4924 | else | |
4925 | { | |
4926 | stack = stack_bottom; | |
4927 | stack_size = &stack_top_variable - stack_bottom; | |
4928 | } | |
4929 | if (stack_size <= MAX_SAVE_STACK) | |
7146af97 | 4930 | { |
dd3f25f7 | 4931 | if (stack_copy_size < stack_size) |
7146af97 | 4932 | { |
dd3f25f7 PE |
4933 | stack_copy = (char *) xrealloc (stack_copy, stack_size); |
4934 | stack_copy_size = stack_size; | |
7146af97 | 4935 | } |
dd3f25f7 | 4936 | memcpy (stack_copy, stack, stack_size); |
7146af97 JB |
4937 | } |
4938 | } | |
4939 | #endif /* MAX_SAVE_STACK > 0 */ | |
4940 | ||
299585ee | 4941 | if (garbage_collection_messages) |
691c4285 | 4942 | message1_nolog ("Garbage collecting..."); |
7146af97 | 4943 | |
6e0fca1d RS |
4944 | BLOCK_INPUT; |
4945 | ||
eec7b73d RS |
4946 | shrink_regexp_cache (); |
4947 | ||
7146af97 JB |
4948 | gc_in_progress = 1; |
4949 | ||
c23baf9f | 4950 | /* clear_marks (); */ |
7146af97 | 4951 | |
005ca5c7 | 4952 | /* Mark all the special slots that serve as the roots of accessibility. */ |
7146af97 JB |
4953 | |
4954 | for (i = 0; i < staticidx; i++) | |
49723c04 | 4955 | mark_object (*staticvec[i]); |
34400008 | 4956 | |
126f9c02 SM |
4957 | for (bind = specpdl; bind != specpdl_ptr; bind++) |
4958 | { | |
4959 | mark_object (bind->symbol); | |
4960 | mark_object (bind->old_value); | |
4961 | } | |
6ed8eeff | 4962 | mark_terminals (); |
126f9c02 | 4963 | mark_kboards (); |
98a92e2d | 4964 | mark_ttys (); |
126f9c02 SM |
4965 | |
4966 | #ifdef USE_GTK | |
4967 | { | |
dd4c5104 | 4968 | extern void xg_mark_data (void); |
126f9c02 SM |
4969 | xg_mark_data (); |
4970 | } | |
4971 | #endif | |
4972 | ||
34400008 GM |
4973 | #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \ |
4974 | || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS) | |
4975 | mark_stack (); | |
4976 | #else | |
acf5f7d3 SM |
4977 | { |
4978 | register struct gcpro *tail; | |
4979 | for (tail = gcprolist; tail; tail = tail->next) | |
4980 | for (i = 0; i < tail->nvars; i++) | |
005ca5c7 | 4981 | mark_object (tail->var[i]); |
acf5f7d3 | 4982 | } |
3e21b6a7 | 4983 | mark_byte_stack (); |
b286858c SM |
4984 | { |
4985 | struct catchtag *catch; | |
4986 | struct handler *handler; | |
177c0ea7 | 4987 | |
7146af97 JB |
4988 | for (catch = catchlist; catch; catch = catch->next) |
4989 | { | |
49723c04 SM |
4990 | mark_object (catch->tag); |
4991 | mark_object (catch->val); | |
177c0ea7 | 4992 | } |
7146af97 JB |
4993 | for (handler = handlerlist; handler; handler = handler->next) |
4994 | { | |
49723c04 SM |
4995 | mark_object (handler->handler); |
4996 | mark_object (handler->var); | |
177c0ea7 | 4997 | } |
b286858c | 4998 | } |
b40ea20a | 4999 | mark_backtrace (); |
b286858c | 5000 | #endif |
7146af97 | 5001 | |
454d7973 KS |
5002 | #ifdef HAVE_WINDOW_SYSTEM |
5003 | mark_fringe_data (); | |
5004 | #endif | |
5005 | ||
74c35a48 SM |
5006 | #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES |
5007 | mark_stack (); | |
5008 | #endif | |
5009 | ||
c37adf23 SM |
5010 | /* Everything is now marked, except for the things that require special |
5011 | finalization, i.e. the undo_list. | |
5012 | Look thru every buffer's undo list | |
4c315bda RS |
5013 | for elements that update markers that were not marked, |
5014 | and delete them. */ | |
5015 | { | |
5016 | register struct buffer *nextb = all_buffers; | |
5017 | ||
5018 | while (nextb) | |
5019 | { | |
5020 | /* If a buffer's undo list is Qt, that means that undo is | |
5021 | turned off in that buffer. Calling truncate_undo_list on | |
5022 | Qt tends to return NULL, which effectively turns undo back on. | |
5023 | So don't call truncate_undo_list if undo_list is Qt. */ | |
5d8ea120 | 5024 | if (! EQ (nextb->BUFFER_INTERNAL_FIELD (undo_list), Qt)) |
4c315bda RS |
5025 | { |
5026 | Lisp_Object tail, prev; | |
5d8ea120 | 5027 | tail = nextb->BUFFER_INTERNAL_FIELD (undo_list); |
4c315bda RS |
5028 | prev = Qnil; |
5029 | while (CONSP (tail)) | |
5030 | { | |
8e50cc2d SM |
5031 | if (CONSP (XCAR (tail)) |
5032 | && MARKERP (XCAR (XCAR (tail))) | |
2336fe58 | 5033 | && !XMARKER (XCAR (XCAR (tail)))->gcmarkbit) |
4c315bda RS |
5034 | { |
5035 | if (NILP (prev)) | |
5d8ea120 | 5036 | nextb->BUFFER_INTERNAL_FIELD (undo_list) = tail = XCDR (tail); |
4c315bda | 5037 | else |
f3fbd155 KR |
5038 | { |
5039 | tail = XCDR (tail); | |
5040 | XSETCDR (prev, tail); | |
5041 | } | |
4c315bda RS |
5042 | } |
5043 | else | |
5044 | { | |
5045 | prev = tail; | |
70949dac | 5046 | tail = XCDR (tail); |
4c315bda RS |
5047 | } |
5048 | } | |
5049 | } | |
c37adf23 SM |
5050 | /* Now that we have stripped the elements that need not be in the |
5051 | undo_list any more, we can finally mark the list. */ | |
5d8ea120 | 5052 | mark_object (nextb->BUFFER_INTERNAL_FIELD (undo_list)); |
4c315bda | 5053 | |
eab3844f | 5054 | nextb = nextb->header.next.buffer; |
4c315bda RS |
5055 | } |
5056 | } | |
5057 | ||
7146af97 JB |
5058 | gc_sweep (); |
5059 | ||
5060 | /* Clear the mark bits that we set in certain root slots. */ | |
5061 | ||
033a5fa3 | 5062 | unmark_byte_stack (); |
3ef06d12 SM |
5063 | VECTOR_UNMARK (&buffer_defaults); |
5064 | VECTOR_UNMARK (&buffer_local_symbols); | |
7146af97 | 5065 | |
34400008 GM |
5066 | #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0 |
5067 | dump_zombies (); | |
5068 | #endif | |
5069 | ||
6e0fca1d RS |
5070 | UNBLOCK_INPUT; |
5071 | ||
bbc012e0 KS |
5072 | CHECK_CONS_LIST (); |
5073 | ||
c23baf9f | 5074 | /* clear_marks (); */ |
7146af97 JB |
5075 | gc_in_progress = 0; |
5076 | ||
5077 | consing_since_gc = 0; | |
5078 | if (gc_cons_threshold < 10000) | |
5079 | gc_cons_threshold = 10000; | |
5080 | ||
96f077ad SM |
5081 | if (FLOATP (Vgc_cons_percentage)) |
5082 | { /* Set gc_cons_combined_threshold. */ | |
ae35e756 PE |
5083 | EMACS_INT tot = 0; |
5084 | ||
5085 | tot += total_conses * sizeof (struct Lisp_Cons); | |
5086 | tot += total_symbols * sizeof (struct Lisp_Symbol); | |
5087 | tot += total_markers * sizeof (union Lisp_Misc); | |
5088 | tot += total_string_size; | |
5089 | tot += total_vector_size * sizeof (Lisp_Object); | |
5090 | tot += total_floats * sizeof (struct Lisp_Float); | |
5091 | tot += total_intervals * sizeof (struct interval); | |
5092 | tot += total_strings * sizeof (struct Lisp_String); | |
5093 | ||
5094 | gc_relative_threshold = tot * XFLOAT_DATA (Vgc_cons_percentage); | |
96f077ad | 5095 | } |
974aae61 RS |
5096 | else |
5097 | gc_relative_threshold = 0; | |
96f077ad | 5098 | |
299585ee RS |
5099 | if (garbage_collection_messages) |
5100 | { | |
6efc7df7 GM |
5101 | if (message_p || minibuf_level > 0) |
5102 | restore_message (); | |
299585ee RS |
5103 | else |
5104 | message1_nolog ("Garbage collecting...done"); | |
5105 | } | |
7146af97 | 5106 | |
98edb5ff | 5107 | unbind_to (count, Qnil); |
2e471eb5 GM |
5108 | |
5109 | total[0] = Fcons (make_number (total_conses), | |
5110 | make_number (total_free_conses)); | |
5111 | total[1] = Fcons (make_number (total_symbols), | |
5112 | make_number (total_free_symbols)); | |
5113 | total[2] = Fcons (make_number (total_markers), | |
5114 | make_number (total_free_markers)); | |
96117bc7 GM |
5115 | total[3] = make_number (total_string_size); |
5116 | total[4] = make_number (total_vector_size); | |
5117 | total[5] = Fcons (make_number (total_floats), | |
2e471eb5 | 5118 | make_number (total_free_floats)); |
96117bc7 | 5119 | total[6] = Fcons (make_number (total_intervals), |
2e471eb5 | 5120 | make_number (total_free_intervals)); |
96117bc7 | 5121 | total[7] = Fcons (make_number (total_strings), |
2e471eb5 GM |
5122 | make_number (total_free_strings)); |
5123 | ||
34400008 | 5124 | #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES |
7146af97 | 5125 | { |
34400008 GM |
5126 | /* Compute average percentage of zombies. */ |
5127 | double nlive = 0; | |
177c0ea7 | 5128 | |
34400008 | 5129 | for (i = 0; i < 7; ++i) |
83fc9c63 DL |
5130 | if (CONSP (total[i])) |
5131 | nlive += XFASTINT (XCAR (total[i])); | |
34400008 GM |
5132 | |
5133 | avg_live = (avg_live * ngcs + nlive) / (ngcs + 1); | |
5134 | max_live = max (nlive, max_live); | |
5135 | avg_zombies = (avg_zombies * ngcs + nzombies) / (ngcs + 1); | |
5136 | max_zombies = max (nzombies, max_zombies); | |
5137 | ++ngcs; | |
5138 | } | |
5139 | #endif | |
7146af97 | 5140 | |
9e713715 GM |
5141 | if (!NILP (Vpost_gc_hook)) |
5142 | { | |
ae35e756 | 5143 | int gc_count = inhibit_garbage_collection (); |
9e713715 | 5144 | safe_run_hooks (Qpost_gc_hook); |
ae35e756 | 5145 | unbind_to (gc_count, Qnil); |
9e713715 | 5146 | } |
2c5bd608 DL |
5147 | |
5148 | /* Accumulate statistics. */ | |
5149 | EMACS_GET_TIME (t2); | |
5150 | EMACS_SUB_TIME (t3, t2, t1); | |
5151 | if (FLOATP (Vgc_elapsed)) | |
69ab9f85 SM |
5152 | Vgc_elapsed = make_float (XFLOAT_DATA (Vgc_elapsed) + |
5153 | EMACS_SECS (t3) + | |
5154 | EMACS_USECS (t3) * 1.0e-6); | |
2c5bd608 DL |
5155 | gcs_done++; |
5156 | ||
96117bc7 | 5157 | return Flist (sizeof total / sizeof *total, total); |
7146af97 | 5158 | } |
34400008 | 5159 | |
41c28a37 | 5160 | |
3770920e GM |
5161 | /* Mark Lisp objects in glyph matrix MATRIX. Currently the |
5162 | only interesting objects referenced from glyphs are strings. */ | |
41c28a37 GM |
5163 | |
5164 | static void | |
971de7fb | 5165 | mark_glyph_matrix (struct glyph_matrix *matrix) |
41c28a37 GM |
5166 | { |
5167 | struct glyph_row *row = matrix->rows; | |
5168 | struct glyph_row *end = row + matrix->nrows; | |
5169 | ||
2e471eb5 GM |
5170 | for (; row < end; ++row) |
5171 | if (row->enabled_p) | |
5172 | { | |
5173 | int area; | |
5174 | for (area = LEFT_MARGIN_AREA; area < LAST_AREA; ++area) | |
5175 | { | |
5176 | struct glyph *glyph = row->glyphs[area]; | |
5177 | struct glyph *end_glyph = glyph + row->used[area]; | |
177c0ea7 | 5178 | |
2e471eb5 | 5179 | for (; glyph < end_glyph; ++glyph) |
8e50cc2d | 5180 | if (STRINGP (glyph->object) |
2e471eb5 | 5181 | && !STRING_MARKED_P (XSTRING (glyph->object))) |
49723c04 | 5182 | mark_object (glyph->object); |
2e471eb5 GM |
5183 | } |
5184 | } | |
41c28a37 GM |
5185 | } |
5186 | ||
34400008 | 5187 | |
41c28a37 GM |
5188 | /* Mark Lisp faces in the face cache C. */ |
5189 | ||
5190 | static void | |
971de7fb | 5191 | mark_face_cache (struct face_cache *c) |
41c28a37 GM |
5192 | { |
5193 | if (c) | |
5194 | { | |
5195 | int i, j; | |
5196 | for (i = 0; i < c->used; ++i) | |
5197 | { | |
5198 | struct face *face = FACE_FROM_ID (c->f, i); | |
5199 | ||
5200 | if (face) | |
5201 | { | |
5202 | for (j = 0; j < LFACE_VECTOR_SIZE; ++j) | |
49723c04 | 5203 | mark_object (face->lface[j]); |
41c28a37 GM |
5204 | } |
5205 | } | |
5206 | } | |
5207 | } | |
5208 | ||
5209 | ||
7146af97 | 5210 | \f |
1a4f1e2c | 5211 | /* Mark reference to a Lisp_Object. |
2e471eb5 GM |
5212 | If the object referred to has not been seen yet, recursively mark |
5213 | all the references contained in it. */ | |
7146af97 | 5214 | |
785cd37f | 5215 | #define LAST_MARKED_SIZE 500 |
d3d47262 | 5216 | static Lisp_Object last_marked[LAST_MARKED_SIZE]; |
244ed907 | 5217 | static int last_marked_index; |
785cd37f | 5218 | |
1342fc6f RS |
5219 | /* For debugging--call abort when we cdr down this many |
5220 | links of a list, in mark_object. In debugging, | |
5221 | the call to abort will hit a breakpoint. | |
5222 | Normally this is zero and the check never goes off. */ | |
b895abce | 5223 | static size_t mark_object_loop_halt; |
1342fc6f | 5224 | |
8f11f7ec | 5225 | static void |
971de7fb | 5226 | mark_vectorlike (struct Lisp_Vector *ptr) |
d2029e5b | 5227 | { |
eab3844f | 5228 | register EMACS_UINT size = ptr->header.size; |
14162469 | 5229 | register EMACS_UINT i; |
d2029e5b | 5230 | |
8f11f7ec | 5231 | eassert (!VECTOR_MARKED_P (ptr)); |
d2029e5b SM |
5232 | VECTOR_MARK (ptr); /* Else mark it */ |
5233 | if (size & PSEUDOVECTOR_FLAG) | |
5234 | size &= PSEUDOVECTOR_SIZE_MASK; | |
d3d47262 | 5235 | |
d2029e5b SM |
5236 | /* Note that this size is not the memory-footprint size, but only |
5237 | the number of Lisp_Object fields that we should trace. | |
5238 | The distinction is used e.g. by Lisp_Process which places extra | |
5239 | non-Lisp_Object fields at the end of the structure. */ | |
5240 | for (i = 0; i < size; i++) /* and then mark its elements */ | |
5241 | mark_object (ptr->contents[i]); | |
d2029e5b SM |
5242 | } |
5243 | ||
58026347 KH |
5244 | /* Like mark_vectorlike but optimized for char-tables (and |
5245 | sub-char-tables) assuming that the contents are mostly integers or | |
5246 | symbols. */ | |
5247 | ||
5248 | static void | |
971de7fb | 5249 | mark_char_table (struct Lisp_Vector *ptr) |
58026347 | 5250 | { |
eab3844f | 5251 | register EMACS_UINT size = ptr->header.size & PSEUDOVECTOR_SIZE_MASK; |
14162469 | 5252 | register EMACS_UINT i; |
58026347 | 5253 | |
8f11f7ec | 5254 | eassert (!VECTOR_MARKED_P (ptr)); |
58026347 KH |
5255 | VECTOR_MARK (ptr); |
5256 | for (i = 0; i < size; i++) | |
5257 | { | |
5258 | Lisp_Object val = ptr->contents[i]; | |
5259 | ||
ef1b0ba7 | 5260 | if (INTEGERP (val) || (SYMBOLP (val) && XSYMBOL (val)->gcmarkbit)) |
58026347 KH |
5261 | continue; |
5262 | if (SUB_CHAR_TABLE_P (val)) | |
5263 | { | |
5264 | if (! VECTOR_MARKED_P (XVECTOR (val))) | |
5265 | mark_char_table (XVECTOR (val)); | |
5266 | } | |
5267 | else | |
5268 | mark_object (val); | |
5269 | } | |
5270 | } | |
5271 | ||
41c28a37 | 5272 | void |
971de7fb | 5273 | mark_object (Lisp_Object arg) |
7146af97 | 5274 | { |
49723c04 | 5275 | register Lisp_Object obj = arg; |
4f5c1376 GM |
5276 | #ifdef GC_CHECK_MARKED_OBJECTS |
5277 | void *po; | |
5278 | struct mem_node *m; | |
5279 | #endif | |
b895abce | 5280 | size_t cdr_count = 0; |
7146af97 | 5281 | |
9149e743 | 5282 | loop: |
7146af97 | 5283 | |
1f0b3fd2 | 5284 | if (PURE_POINTER_P (XPNTR (obj))) |
7146af97 JB |
5285 | return; |
5286 | ||
49723c04 | 5287 | last_marked[last_marked_index++] = obj; |
785cd37f RS |
5288 | if (last_marked_index == LAST_MARKED_SIZE) |
5289 | last_marked_index = 0; | |
5290 | ||
4f5c1376 GM |
5291 | /* Perform some sanity checks on the objects marked here. Abort if |
5292 | we encounter an object we know is bogus. This increases GC time | |
5293 | by ~80%, and requires compilation with GC_MARK_STACK != 0. */ | |
5294 | #ifdef GC_CHECK_MARKED_OBJECTS | |
5295 | ||
5296 | po = (void *) XPNTR (obj); | |
5297 | ||
5298 | /* Check that the object pointed to by PO is known to be a Lisp | |
5299 | structure allocated from the heap. */ | |
5300 | #define CHECK_ALLOCATED() \ | |
5301 | do { \ | |
5302 | m = mem_find (po); \ | |
5303 | if (m == MEM_NIL) \ | |
5304 | abort (); \ | |
5305 | } while (0) | |
5306 | ||
5307 | /* Check that the object pointed to by PO is live, using predicate | |
5308 | function LIVEP. */ | |
5309 | #define CHECK_LIVE(LIVEP) \ | |
5310 | do { \ | |
5311 | if (!LIVEP (m, po)) \ | |
5312 | abort (); \ | |
5313 | } while (0) | |
5314 | ||
5315 | /* Check both of the above conditions. */ | |
5316 | #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \ | |
5317 | do { \ | |
5318 | CHECK_ALLOCATED (); \ | |
5319 | CHECK_LIVE (LIVEP); \ | |
5320 | } while (0) \ | |
177c0ea7 | 5321 | |
4f5c1376 | 5322 | #else /* not GC_CHECK_MARKED_OBJECTS */ |
177c0ea7 | 5323 | |
4f5c1376 GM |
5324 | #define CHECK_LIVE(LIVEP) (void) 0 |
5325 | #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0 | |
177c0ea7 | 5326 | |
4f5c1376 GM |
5327 | #endif /* not GC_CHECK_MARKED_OBJECTS */ |
5328 | ||
8e50cc2d | 5329 | switch (SWITCH_ENUM_CAST (XTYPE (obj))) |
7146af97 JB |
5330 | { |
5331 | case Lisp_String: | |
5332 | { | |
5333 | register struct Lisp_String *ptr = XSTRING (obj); | |
8f11f7ec SM |
5334 | if (STRING_MARKED_P (ptr)) |
5335 | break; | |
4f5c1376 | 5336 | CHECK_ALLOCATED_AND_LIVE (live_string_p); |
d5e35230 | 5337 | MARK_INTERVAL_TREE (ptr->intervals); |
2e471eb5 | 5338 | MARK_STRING (ptr); |
361b097f | 5339 | #ifdef GC_CHECK_STRING_BYTES |
676a7251 GM |
5340 | /* Check that the string size recorded in the string is the |
5341 | same as the one recorded in the sdata structure. */ | |
5342 | CHECK_STRING_BYTES (ptr); | |
361b097f | 5343 | #endif /* GC_CHECK_STRING_BYTES */ |
7146af97 JB |
5344 | } |
5345 | break; | |
5346 | ||
76437631 | 5347 | case Lisp_Vectorlike: |
8f11f7ec SM |
5348 | if (VECTOR_MARKED_P (XVECTOR (obj))) |
5349 | break; | |
4f5c1376 GM |
5350 | #ifdef GC_CHECK_MARKED_OBJECTS |
5351 | m = mem_find (po); | |
8e50cc2d | 5352 | if (m == MEM_NIL && !SUBRP (obj) |
4f5c1376 GM |
5353 | && po != &buffer_defaults |
5354 | && po != &buffer_local_symbols) | |
5355 | abort (); | |
5356 | #endif /* GC_CHECK_MARKED_OBJECTS */ | |
177c0ea7 | 5357 | |
8e50cc2d | 5358 | if (BUFFERP (obj)) |
6b552283 | 5359 | { |
4f5c1376 | 5360 | #ifdef GC_CHECK_MARKED_OBJECTS |
8f11f7ec SM |
5361 | if (po != &buffer_defaults && po != &buffer_local_symbols) |
5362 | { | |
5363 | struct buffer *b; | |
eab3844f | 5364 | for (b = all_buffers; b && b != po; b = b->header.next) |
8f11f7ec SM |
5365 | ; |
5366 | if (b == NULL) | |
5367 | abort (); | |
4f5c1376 | 5368 | } |
8f11f7ec SM |
5369 | #endif /* GC_CHECK_MARKED_OBJECTS */ |
5370 | mark_buffer (obj); | |
6b552283 | 5371 | } |
8e50cc2d | 5372 | else if (SUBRP (obj)) |
169ee243 | 5373 | break; |
876c194c | 5374 | else if (COMPILEDP (obj)) |
2e471eb5 GM |
5375 | /* We could treat this just like a vector, but it is better to |
5376 | save the COMPILED_CONSTANTS element for last and avoid | |
5377 | recursion there. */ | |
169ee243 RS |
5378 | { |
5379 | register struct Lisp_Vector *ptr = XVECTOR (obj); | |
eab3844f | 5380 | register EMACS_UINT size = ptr->header.size; |
14162469 | 5381 | register EMACS_UINT i; |
169ee243 | 5382 | |
4f5c1376 | 5383 | CHECK_LIVE (live_vector_p); |
3ef06d12 | 5384 | VECTOR_MARK (ptr); /* Else mark it */ |
76437631 | 5385 | size &= PSEUDOVECTOR_SIZE_MASK; |
169ee243 RS |
5386 | for (i = 0; i < size; i++) /* and then mark its elements */ |
5387 | { | |
5388 | if (i != COMPILED_CONSTANTS) | |
49723c04 | 5389 | mark_object (ptr->contents[i]); |
169ee243 | 5390 | } |
49723c04 | 5391 | obj = ptr->contents[COMPILED_CONSTANTS]; |
169ee243 RS |
5392 | goto loop; |
5393 | } | |
8e50cc2d | 5394 | else if (FRAMEP (obj)) |
169ee243 | 5395 | { |
c70bbf06 | 5396 | register struct frame *ptr = XFRAME (obj); |
8f11f7ec SM |
5397 | mark_vectorlike (XVECTOR (obj)); |
5398 | mark_face_cache (ptr->face_cache); | |
707788bd | 5399 | } |
8e50cc2d | 5400 | else if (WINDOWP (obj)) |
41c28a37 GM |
5401 | { |
5402 | register struct Lisp_Vector *ptr = XVECTOR (obj); | |
5403 | struct window *w = XWINDOW (obj); | |
8f11f7ec SM |
5404 | mark_vectorlike (ptr); |
5405 | /* Mark glyphs for leaf windows. Marking window matrices is | |
5406 | sufficient because frame matrices use the same glyph | |
5407 | memory. */ | |
5408 | if (NILP (w->hchild) | |
5409 | && NILP (w->vchild) | |
5410 | && w->current_matrix) | |
41c28a37 | 5411 | { |
8f11f7ec SM |
5412 | mark_glyph_matrix (w->current_matrix); |
5413 | mark_glyph_matrix (w->desired_matrix); | |
41c28a37 GM |
5414 | } |
5415 | } | |
8e50cc2d | 5416 | else if (HASH_TABLE_P (obj)) |
41c28a37 GM |
5417 | { |
5418 | struct Lisp_Hash_Table *h = XHASH_TABLE (obj); | |
8f11f7ec SM |
5419 | mark_vectorlike ((struct Lisp_Vector *)h); |
5420 | /* If hash table is not weak, mark all keys and values. | |
5421 | For weak tables, mark only the vector. */ | |
5422 | if (NILP (h->weak)) | |
5423 | mark_object (h->key_and_value); | |
5424 | else | |
5425 | VECTOR_MARK (XVECTOR (h->key_and_value)); | |
41c28a37 | 5426 | } |
58026347 | 5427 | else if (CHAR_TABLE_P (obj)) |
8f11f7ec | 5428 | mark_char_table (XVECTOR (obj)); |
04ff9756 | 5429 | else |
d2029e5b | 5430 | mark_vectorlike (XVECTOR (obj)); |
169ee243 | 5431 | break; |
7146af97 | 5432 | |
7146af97 JB |
5433 | case Lisp_Symbol: |
5434 | { | |
c70bbf06 | 5435 | register struct Lisp_Symbol *ptr = XSYMBOL (obj); |
7146af97 JB |
5436 | struct Lisp_Symbol *ptrx; |
5437 | ||
8f11f7ec SM |
5438 | if (ptr->gcmarkbit) |
5439 | break; | |
4f5c1376 | 5440 | CHECK_ALLOCATED_AND_LIVE (live_symbol_p); |
2336fe58 | 5441 | ptr->gcmarkbit = 1; |
49723c04 SM |
5442 | mark_object (ptr->function); |
5443 | mark_object (ptr->plist); | |
ce5b453a SM |
5444 | switch (ptr->redirect) |
5445 | { | |
5446 | case SYMBOL_PLAINVAL: mark_object (SYMBOL_VAL (ptr)); break; | |
5447 | case SYMBOL_VARALIAS: | |
5448 | { | |
5449 | Lisp_Object tem; | |
5450 | XSETSYMBOL (tem, SYMBOL_ALIAS (ptr)); | |
5451 | mark_object (tem); | |
5452 | break; | |
5453 | } | |
5454 | case SYMBOL_LOCALIZED: | |
5455 | { | |
5456 | struct Lisp_Buffer_Local_Value *blv = SYMBOL_BLV (ptr); | |
5457 | /* If the value is forwarded to a buffer or keyboard field, | |
5458 | these are marked when we see the corresponding object. | |
5459 | And if it's forwarded to a C variable, either it's not | |
5460 | a Lisp_Object var, or it's staticpro'd already. */ | |
5461 | mark_object (blv->where); | |
5462 | mark_object (blv->valcell); | |
5463 | mark_object (blv->defcell); | |
5464 | break; | |
5465 | } | |
5466 | case SYMBOL_FORWARDED: | |
5467 | /* If the value is forwarded to a buffer or keyboard field, | |
5468 | these are marked when we see the corresponding object. | |
5469 | And if it's forwarded to a C variable, either it's not | |
5470 | a Lisp_Object var, or it's staticpro'd already. */ | |
5471 | break; | |
5472 | default: abort (); | |
5473 | } | |
8fe5665d KR |
5474 | if (!PURE_POINTER_P (XSTRING (ptr->xname))) |
5475 | MARK_STRING (XSTRING (ptr->xname)); | |
d5db4077 | 5476 | MARK_INTERVAL_TREE (STRING_INTERVALS (ptr->xname)); |
177c0ea7 | 5477 | |
7146af97 JB |
5478 | ptr = ptr->next; |
5479 | if (ptr) | |
5480 | { | |
b0846f52 | 5481 | ptrx = ptr; /* Use of ptrx avoids compiler bug on Sun */ |
7146af97 | 5482 | XSETSYMBOL (obj, ptrx); |
49723c04 | 5483 | goto loop; |
7146af97 JB |
5484 | } |
5485 | } | |
5486 | break; | |
5487 | ||
a0a38eb7 | 5488 | case Lisp_Misc: |
4f5c1376 | 5489 | CHECK_ALLOCATED_AND_LIVE (live_misc_p); |
67ee9f6e | 5490 | if (XMISCANY (obj)->gcmarkbit) |
2336fe58 | 5491 | break; |
67ee9f6e | 5492 | XMISCANY (obj)->gcmarkbit = 1; |
b766f870 | 5493 | |
a5da44fe | 5494 | switch (XMISCTYPE (obj)) |
a0a38eb7 | 5495 | { |
465edf35 | 5496 | |
2336fe58 SM |
5497 | case Lisp_Misc_Marker: |
5498 | /* DO NOT mark thru the marker's chain. | |
5499 | The buffer's markers chain does not preserve markers from gc; | |
5500 | instead, markers are removed from the chain when freed by gc. */ | |
b766f870 KS |
5501 | break; |
5502 | ||
8f924df7 | 5503 | case Lisp_Misc_Save_Value: |
9ea306d1 | 5504 | #if GC_MARK_STACK |
b766f870 KS |
5505 | { |
5506 | register struct Lisp_Save_Value *ptr = XSAVE_VALUE (obj); | |
5507 | /* If DOGC is set, POINTER is the address of a memory | |
5508 | area containing INTEGER potential Lisp_Objects. */ | |
5509 | if (ptr->dogc) | |
5510 | { | |
5511 | Lisp_Object *p = (Lisp_Object *) ptr->pointer; | |
5512 | int nelt; | |
5513 | for (nelt = ptr->integer; nelt > 0; nelt--, p++) | |
5514 | mark_maybe_object (*p); | |
5515 | } | |
5516 | } | |
9ea306d1 | 5517 | #endif |
c8616056 KH |
5518 | break; |
5519 | ||
e202fa34 KH |
5520 | case Lisp_Misc_Overlay: |
5521 | { | |
5522 | struct Lisp_Overlay *ptr = XOVERLAY (obj); | |
49723c04 SM |
5523 | mark_object (ptr->start); |
5524 | mark_object (ptr->end); | |
f54253ec SM |
5525 | mark_object (ptr->plist); |
5526 | if (ptr->next) | |
5527 | { | |
5528 | XSETMISC (obj, ptr->next); | |
5529 | goto loop; | |
5530 | } | |
e202fa34 KH |
5531 | } |
5532 | break; | |
5533 | ||
a0a38eb7 KH |
5534 | default: |
5535 | abort (); | |
5536 | } | |
7146af97 JB |
5537 | break; |
5538 | ||
5539 | case Lisp_Cons: | |
7146af97 JB |
5540 | { |
5541 | register struct Lisp_Cons *ptr = XCONS (obj); | |
8f11f7ec SM |
5542 | if (CONS_MARKED_P (ptr)) |
5543 | break; | |
4f5c1376 | 5544 | CHECK_ALLOCATED_AND_LIVE (live_cons_p); |
08b7c2cb | 5545 | CONS_MARK (ptr); |
c54ca951 | 5546 | /* If the cdr is nil, avoid recursion for the car. */ |
28a099a4 | 5547 | if (EQ (ptr->u.cdr, Qnil)) |
c54ca951 | 5548 | { |
49723c04 | 5549 | obj = ptr->car; |
1342fc6f | 5550 | cdr_count = 0; |
c54ca951 RS |
5551 | goto loop; |
5552 | } | |
49723c04 | 5553 | mark_object (ptr->car); |
28a099a4 | 5554 | obj = ptr->u.cdr; |
1342fc6f RS |
5555 | cdr_count++; |
5556 | if (cdr_count == mark_object_loop_halt) | |
5557 | abort (); | |
7146af97 JB |
5558 | goto loop; |
5559 | } | |
5560 | ||
7146af97 | 5561 | case Lisp_Float: |
4f5c1376 | 5562 | CHECK_ALLOCATED_AND_LIVE (live_float_p); |
ab6780cd | 5563 | FLOAT_MARK (XFLOAT (obj)); |
7146af97 | 5564 | break; |
7146af97 | 5565 | |
2de9f71c | 5566 | case_Lisp_Int: |
7146af97 JB |
5567 | break; |
5568 | ||
5569 | default: | |
5570 | abort (); | |
5571 | } | |
4f5c1376 GM |
5572 | |
5573 | #undef CHECK_LIVE | |
5574 | #undef CHECK_ALLOCATED | |
5575 | #undef CHECK_ALLOCATED_AND_LIVE | |
7146af97 JB |
5576 | } |
5577 | ||
5578 | /* Mark the pointers in a buffer structure. */ | |
5579 | ||
5580 | static void | |
971de7fb | 5581 | mark_buffer (Lisp_Object buf) |
7146af97 | 5582 | { |
7146af97 | 5583 | register struct buffer *buffer = XBUFFER (buf); |
f54253ec | 5584 | register Lisp_Object *ptr, tmp; |
30e3190a | 5585 | Lisp_Object base_buffer; |
7146af97 | 5586 | |
8f11f7ec | 5587 | eassert (!VECTOR_MARKED_P (buffer)); |
3ef06d12 | 5588 | VECTOR_MARK (buffer); |
7146af97 | 5589 | |
30e3190a | 5590 | MARK_INTERVAL_TREE (BUF_INTERVALS (buffer)); |
d5e35230 | 5591 | |
c37adf23 SM |
5592 | /* For now, we just don't mark the undo_list. It's done later in |
5593 | a special way just before the sweep phase, and after stripping | |
5594 | some of its elements that are not needed any more. */ | |
4c315bda | 5595 | |
f54253ec SM |
5596 | if (buffer->overlays_before) |
5597 | { | |
5598 | XSETMISC (tmp, buffer->overlays_before); | |
5599 | mark_object (tmp); | |
5600 | } | |
5601 | if (buffer->overlays_after) | |
5602 | { | |
5603 | XSETMISC (tmp, buffer->overlays_after); | |
5604 | mark_object (tmp); | |
5605 | } | |
5606 | ||
9ce376f9 SM |
5607 | /* buffer-local Lisp variables start at `undo_list', |
5608 | tho only the ones from `name' on are GC'd normally. */ | |
5d8ea120 | 5609 | for (ptr = &buffer->BUFFER_INTERNAL_FIELD (name); |
7146af97 JB |
5610 | (char *)ptr < (char *)buffer + sizeof (struct buffer); |
5611 | ptr++) | |
49723c04 | 5612 | mark_object (*ptr); |
30e3190a RS |
5613 | |
5614 | /* If this is an indirect buffer, mark its base buffer. */ | |
349bd9ed | 5615 | if (buffer->base_buffer && !VECTOR_MARKED_P (buffer->base_buffer)) |
30e3190a | 5616 | { |
177c0ea7 | 5617 | XSETBUFFER (base_buffer, buffer->base_buffer); |
30e3190a RS |
5618 | mark_buffer (base_buffer); |
5619 | } | |
7146af97 | 5620 | } |
084b1a0c | 5621 | |
4a729fd8 SM |
5622 | /* Mark the Lisp pointers in the terminal objects. |
5623 | Called by the Fgarbage_collector. */ | |
5624 | ||
4a729fd8 SM |
5625 | static void |
5626 | mark_terminals (void) | |
5627 | { | |
5628 | struct terminal *t; | |
5629 | for (t = terminal_list; t; t = t->next_terminal) | |
5630 | { | |
5631 | eassert (t->name != NULL); | |
354884c4 | 5632 | #ifdef HAVE_WINDOW_SYSTEM |
96ad0af7 YM |
5633 | /* If a terminal object is reachable from a stacpro'ed object, |
5634 | it might have been marked already. Make sure the image cache | |
5635 | gets marked. */ | |
5636 | mark_image_cache (t->image_cache); | |
354884c4 | 5637 | #endif /* HAVE_WINDOW_SYSTEM */ |
96ad0af7 YM |
5638 | if (!VECTOR_MARKED_P (t)) |
5639 | mark_vectorlike ((struct Lisp_Vector *)t); | |
4a729fd8 SM |
5640 | } |
5641 | } | |
5642 | ||
5643 | ||
084b1a0c | 5644 | |
41c28a37 GM |
5645 | /* Value is non-zero if OBJ will survive the current GC because it's |
5646 | either marked or does not need to be marked to survive. */ | |
5647 | ||
5648 | int | |
971de7fb | 5649 | survives_gc_p (Lisp_Object obj) |
41c28a37 GM |
5650 | { |
5651 | int survives_p; | |
177c0ea7 | 5652 | |
8e50cc2d | 5653 | switch (XTYPE (obj)) |
41c28a37 | 5654 | { |
2de9f71c | 5655 | case_Lisp_Int: |
41c28a37 GM |
5656 | survives_p = 1; |
5657 | break; | |
5658 | ||
5659 | case Lisp_Symbol: | |
2336fe58 | 5660 | survives_p = XSYMBOL (obj)->gcmarkbit; |
41c28a37 GM |
5661 | break; |
5662 | ||
5663 | case Lisp_Misc: | |
67ee9f6e | 5664 | survives_p = XMISCANY (obj)->gcmarkbit; |
41c28a37 GM |
5665 | break; |
5666 | ||
5667 | case Lisp_String: | |
08b7c2cb | 5668 | survives_p = STRING_MARKED_P (XSTRING (obj)); |
41c28a37 GM |
5669 | break; |
5670 | ||
5671 | case Lisp_Vectorlike: | |
8e50cc2d | 5672 | survives_p = SUBRP (obj) || VECTOR_MARKED_P (XVECTOR (obj)); |
41c28a37 GM |
5673 | break; |
5674 | ||
5675 | case Lisp_Cons: | |
08b7c2cb | 5676 | survives_p = CONS_MARKED_P (XCONS (obj)); |
41c28a37 GM |
5677 | break; |
5678 | ||
41c28a37 | 5679 | case Lisp_Float: |
ab6780cd | 5680 | survives_p = FLOAT_MARKED_P (XFLOAT (obj)); |
41c28a37 | 5681 | break; |
41c28a37 GM |
5682 | |
5683 | default: | |
5684 | abort (); | |
5685 | } | |
5686 | ||
34400008 | 5687 | return survives_p || PURE_POINTER_P ((void *) XPNTR (obj)); |
41c28a37 GM |
5688 | } |
5689 | ||
5690 | ||
7146af97 | 5691 | \f |
1a4f1e2c | 5692 | /* Sweep: find all structures not marked, and free them. */ |
7146af97 JB |
5693 | |
5694 | static void | |
971de7fb | 5695 | gc_sweep (void) |
7146af97 | 5696 | { |
41c28a37 GM |
5697 | /* Remove or mark entries in weak hash tables. |
5698 | This must be done before any object is unmarked. */ | |
5699 | sweep_weak_hash_tables (); | |
5700 | ||
2e471eb5 | 5701 | sweep_strings (); |
676a7251 GM |
5702 | #ifdef GC_CHECK_STRING_BYTES |
5703 | if (!noninteractive) | |
5704 | check_string_bytes (1); | |
5705 | #endif | |
7146af97 JB |
5706 | |
5707 | /* Put all unmarked conses on free list */ | |
5708 | { | |
5709 | register struct cons_block *cblk; | |
6ca94ac9 | 5710 | struct cons_block **cprev = &cons_block; |
7146af97 JB |
5711 | register int lim = cons_block_index; |
5712 | register int num_free = 0, num_used = 0; | |
5713 | ||
5714 | cons_free_list = 0; | |
177c0ea7 | 5715 | |
6ca94ac9 | 5716 | for (cblk = cons_block; cblk; cblk = *cprev) |
7146af97 | 5717 | { |
3ae2e3a3 | 5718 | register int i = 0; |
6ca94ac9 | 5719 | int this_free = 0; |
3ae2e3a3 RS |
5720 | int ilim = (lim + BITS_PER_INT - 1) / BITS_PER_INT; |
5721 | ||
5722 | /* Scan the mark bits an int at a time. */ | |
5723 | for (i = 0; i <= ilim; i++) | |
5724 | { | |
5725 | if (cblk->gcmarkbits[i] == -1) | |
5726 | { | |
5727 | /* Fast path - all cons cells for this int are marked. */ | |
5728 | cblk->gcmarkbits[i] = 0; | |
5729 | num_used += BITS_PER_INT; | |
5730 | } | |
5731 | else | |
5732 | { | |
5733 | /* Some cons cells for this int are not marked. | |
5734 | Find which ones, and free them. */ | |
5735 | int start, pos, stop; | |
5736 | ||
5737 | start = i * BITS_PER_INT; | |
5738 | stop = lim - start; | |
5739 | if (stop > BITS_PER_INT) | |
5740 | stop = BITS_PER_INT; | |
5741 | stop += start; | |
5742 | ||
5743 | for (pos = start; pos < stop; pos++) | |
5744 | { | |
5745 | if (!CONS_MARKED_P (&cblk->conses[pos])) | |
5746 | { | |
5747 | this_free++; | |
5748 | cblk->conses[pos].u.chain = cons_free_list; | |
5749 | cons_free_list = &cblk->conses[pos]; | |
34400008 | 5750 | #if GC_MARK_STACK |
3ae2e3a3 | 5751 | cons_free_list->car = Vdead; |
34400008 | 5752 | #endif |
3ae2e3a3 RS |
5753 | } |
5754 | else | |
5755 | { | |
5756 | num_used++; | |
5757 | CONS_UNMARK (&cblk->conses[pos]); | |
5758 | } | |
5759 | } | |
5760 | } | |
5761 | } | |
5762 | ||
7146af97 | 5763 | lim = CONS_BLOCK_SIZE; |
6ca94ac9 KH |
5764 | /* If this block contains only free conses and we have already |
5765 | seen more than two blocks worth of free conses then deallocate | |
5766 | this block. */ | |
6feef451 | 5767 | if (this_free == CONS_BLOCK_SIZE && num_free > CONS_BLOCK_SIZE) |
6ca94ac9 | 5768 | { |
6ca94ac9 KH |
5769 | *cprev = cblk->next; |
5770 | /* Unhook from the free list. */ | |
28a099a4 | 5771 | cons_free_list = cblk->conses[0].u.chain; |
08b7c2cb | 5772 | lisp_align_free (cblk); |
c8099634 | 5773 | n_cons_blocks--; |
6ca94ac9 KH |
5774 | } |
5775 | else | |
6feef451 AS |
5776 | { |
5777 | num_free += this_free; | |
5778 | cprev = &cblk->next; | |
5779 | } | |
7146af97 JB |
5780 | } |
5781 | total_conses = num_used; | |
5782 | total_free_conses = num_free; | |
5783 | } | |
5784 | ||
7146af97 JB |
5785 | /* Put all unmarked floats on free list */ |
5786 | { | |
5787 | register struct float_block *fblk; | |
6ca94ac9 | 5788 | struct float_block **fprev = &float_block; |
7146af97 JB |
5789 | register int lim = float_block_index; |
5790 | register int num_free = 0, num_used = 0; | |
5791 | ||
5792 | float_free_list = 0; | |
177c0ea7 | 5793 | |
6ca94ac9 | 5794 | for (fblk = float_block; fblk; fblk = *fprev) |
7146af97 JB |
5795 | { |
5796 | register int i; | |
6ca94ac9 | 5797 | int this_free = 0; |
7146af97 | 5798 | for (i = 0; i < lim; i++) |
ab6780cd | 5799 | if (!FLOAT_MARKED_P (&fblk->floats[i])) |
7146af97 | 5800 | { |
6ca94ac9 | 5801 | this_free++; |
28a099a4 | 5802 | fblk->floats[i].u.chain = float_free_list; |
7146af97 JB |
5803 | float_free_list = &fblk->floats[i]; |
5804 | } | |
5805 | else | |
5806 | { | |
5807 | num_used++; | |
ab6780cd | 5808 | FLOAT_UNMARK (&fblk->floats[i]); |
7146af97 JB |
5809 | } |
5810 | lim = FLOAT_BLOCK_SIZE; | |
6ca94ac9 KH |
5811 | /* If this block contains only free floats and we have already |
5812 | seen more than two blocks worth of free floats then deallocate | |
5813 | this block. */ | |
6feef451 | 5814 | if (this_free == FLOAT_BLOCK_SIZE && num_free > FLOAT_BLOCK_SIZE) |
6ca94ac9 | 5815 | { |
6ca94ac9 KH |
5816 | *fprev = fblk->next; |
5817 | /* Unhook from the free list. */ | |
28a099a4 | 5818 | float_free_list = fblk->floats[0].u.chain; |
ab6780cd | 5819 | lisp_align_free (fblk); |
c8099634 | 5820 | n_float_blocks--; |
6ca94ac9 KH |
5821 | } |
5822 | else | |
6feef451 AS |
5823 | { |
5824 | num_free += this_free; | |
5825 | fprev = &fblk->next; | |
5826 | } | |
7146af97 JB |
5827 | } |
5828 | total_floats = num_used; | |
5829 | total_free_floats = num_free; | |
5830 | } | |
7146af97 | 5831 | |
d5e35230 JA |
5832 | /* Put all unmarked intervals on free list */ |
5833 | { | |
5834 | register struct interval_block *iblk; | |
6ca94ac9 | 5835 | struct interval_block **iprev = &interval_block; |
d5e35230 JA |
5836 | register int lim = interval_block_index; |
5837 | register int num_free = 0, num_used = 0; | |
5838 | ||
5839 | interval_free_list = 0; | |
5840 | ||
6ca94ac9 | 5841 | for (iblk = interval_block; iblk; iblk = *iprev) |
d5e35230 JA |
5842 | { |
5843 | register int i; | |
6ca94ac9 | 5844 | int this_free = 0; |
d5e35230 JA |
5845 | |
5846 | for (i = 0; i < lim; i++) | |
5847 | { | |
2336fe58 | 5848 | if (!iblk->intervals[i].gcmarkbit) |
d5e35230 | 5849 | { |
439d5cb4 | 5850 | SET_INTERVAL_PARENT (&iblk->intervals[i], interval_free_list); |
d5e35230 | 5851 | interval_free_list = &iblk->intervals[i]; |
6ca94ac9 | 5852 | this_free++; |
d5e35230 JA |
5853 | } |
5854 | else | |
5855 | { | |
5856 | num_used++; | |
2336fe58 | 5857 | iblk->intervals[i].gcmarkbit = 0; |
d5e35230 JA |
5858 | } |
5859 | } | |
5860 | lim = INTERVAL_BLOCK_SIZE; | |
6ca94ac9 KH |
5861 | /* If this block contains only free intervals and we have already |
5862 | seen more than two blocks worth of free intervals then | |
5863 | deallocate this block. */ | |
6feef451 | 5864 | if (this_free == INTERVAL_BLOCK_SIZE && num_free > INTERVAL_BLOCK_SIZE) |
6ca94ac9 | 5865 | { |
6ca94ac9 KH |
5866 | *iprev = iblk->next; |
5867 | /* Unhook from the free list. */ | |
439d5cb4 | 5868 | interval_free_list = INTERVAL_PARENT (&iblk->intervals[0]); |
c8099634 RS |
5869 | lisp_free (iblk); |
5870 | n_interval_blocks--; | |
6ca94ac9 KH |
5871 | } |
5872 | else | |
6feef451 AS |
5873 | { |
5874 | num_free += this_free; | |
5875 | iprev = &iblk->next; | |
5876 | } | |
d5e35230 JA |
5877 | } |
5878 | total_intervals = num_used; | |
5879 | total_free_intervals = num_free; | |
5880 | } | |
d5e35230 | 5881 | |
7146af97 JB |
5882 | /* Put all unmarked symbols on free list */ |
5883 | { | |
5884 | register struct symbol_block *sblk; | |
6ca94ac9 | 5885 | struct symbol_block **sprev = &symbol_block; |
7146af97 JB |
5886 | register int lim = symbol_block_index; |
5887 | register int num_free = 0, num_used = 0; | |
5888 | ||
d285b373 | 5889 | symbol_free_list = NULL; |
177c0ea7 | 5890 | |
6ca94ac9 | 5891 | for (sblk = symbol_block; sblk; sblk = *sprev) |
7146af97 | 5892 | { |
6ca94ac9 | 5893 | int this_free = 0; |
d285b373 GM |
5894 | struct Lisp_Symbol *sym = sblk->symbols; |
5895 | struct Lisp_Symbol *end = sym + lim; | |
5896 | ||
5897 | for (; sym < end; ++sym) | |
5898 | { | |
20035321 SM |
5899 | /* Check if the symbol was created during loadup. In such a case |
5900 | it might be pointed to by pure bytecode which we don't trace, | |
5901 | so we conservatively assume that it is live. */ | |
8fe5665d | 5902 | int pure_p = PURE_POINTER_P (XSTRING (sym->xname)); |
177c0ea7 | 5903 | |
2336fe58 | 5904 | if (!sym->gcmarkbit && !pure_p) |
d285b373 | 5905 | { |
ce5b453a SM |
5906 | if (sym->redirect == SYMBOL_LOCALIZED) |
5907 | xfree (SYMBOL_BLV (sym)); | |
28a099a4 | 5908 | sym->next = symbol_free_list; |
d285b373 | 5909 | symbol_free_list = sym; |
34400008 | 5910 | #if GC_MARK_STACK |
d285b373 | 5911 | symbol_free_list->function = Vdead; |
34400008 | 5912 | #endif |
d285b373 GM |
5913 | ++this_free; |
5914 | } | |
5915 | else | |
5916 | { | |
5917 | ++num_used; | |
5918 | if (!pure_p) | |
8fe5665d | 5919 | UNMARK_STRING (XSTRING (sym->xname)); |
2336fe58 | 5920 | sym->gcmarkbit = 0; |
d285b373 GM |
5921 | } |
5922 | } | |
177c0ea7 | 5923 | |
7146af97 | 5924 | lim = SYMBOL_BLOCK_SIZE; |
6ca94ac9 KH |
5925 | /* If this block contains only free symbols and we have already |
5926 | seen more than two blocks worth of free symbols then deallocate | |
5927 | this block. */ | |
6feef451 | 5928 | if (this_free == SYMBOL_BLOCK_SIZE && num_free > SYMBOL_BLOCK_SIZE) |
6ca94ac9 | 5929 | { |
6ca94ac9 KH |
5930 | *sprev = sblk->next; |
5931 | /* Unhook from the free list. */ | |
28a099a4 | 5932 | symbol_free_list = sblk->symbols[0].next; |
c8099634 RS |
5933 | lisp_free (sblk); |
5934 | n_symbol_blocks--; | |
6ca94ac9 KH |
5935 | } |
5936 | else | |
6feef451 AS |
5937 | { |
5938 | num_free += this_free; | |
5939 | sprev = &sblk->next; | |
5940 | } | |
7146af97 JB |
5941 | } |
5942 | total_symbols = num_used; | |
5943 | total_free_symbols = num_free; | |
5944 | } | |
5945 | ||
a9faeabe RS |
5946 | /* Put all unmarked misc's on free list. |
5947 | For a marker, first unchain it from the buffer it points into. */ | |
7146af97 JB |
5948 | { |
5949 | register struct marker_block *mblk; | |
6ca94ac9 | 5950 | struct marker_block **mprev = &marker_block; |
7146af97 JB |
5951 | register int lim = marker_block_index; |
5952 | register int num_free = 0, num_used = 0; | |
5953 | ||
5954 | marker_free_list = 0; | |
177c0ea7 | 5955 | |
6ca94ac9 | 5956 | for (mblk = marker_block; mblk; mblk = *mprev) |
7146af97 JB |
5957 | { |
5958 | register int i; | |
6ca94ac9 | 5959 | int this_free = 0; |
fa05e253 | 5960 | |
7146af97 | 5961 | for (i = 0; i < lim; i++) |
465edf35 | 5962 | { |
d314756e | 5963 | if (!mblk->markers[i].u_any.gcmarkbit) |
465edf35 | 5964 | { |
d314756e | 5965 | if (mblk->markers[i].u_any.type == Lisp_Misc_Marker) |
ef89c2ce | 5966 | unchain_marker (&mblk->markers[i].u_marker); |
fa05e253 RS |
5967 | /* Set the type of the freed object to Lisp_Misc_Free. |
5968 | We could leave the type alone, since nobody checks it, | |
465edf35 | 5969 | but this might catch bugs faster. */ |
a5da44fe | 5970 | mblk->markers[i].u_marker.type = Lisp_Misc_Free; |
465edf35 KH |
5971 | mblk->markers[i].u_free.chain = marker_free_list; |
5972 | marker_free_list = &mblk->markers[i]; | |
6ca94ac9 | 5973 | this_free++; |
465edf35 KH |
5974 | } |
5975 | else | |
5976 | { | |
5977 | num_used++; | |
d314756e | 5978 | mblk->markers[i].u_any.gcmarkbit = 0; |
465edf35 KH |
5979 | } |
5980 | } | |
7146af97 | 5981 | lim = MARKER_BLOCK_SIZE; |
6ca94ac9 KH |
5982 | /* If this block contains only free markers and we have already |
5983 | seen more than two blocks worth of free markers then deallocate | |
5984 | this block. */ | |
6feef451 | 5985 | if (this_free == MARKER_BLOCK_SIZE && num_free > MARKER_BLOCK_SIZE) |
6ca94ac9 | 5986 | { |
6ca94ac9 KH |
5987 | *mprev = mblk->next; |
5988 | /* Unhook from the free list. */ | |
5989 | marker_free_list = mblk->markers[0].u_free.chain; | |
c8099634 RS |
5990 | lisp_free (mblk); |
5991 | n_marker_blocks--; | |
6ca94ac9 KH |
5992 | } |
5993 | else | |
6feef451 AS |
5994 | { |
5995 | num_free += this_free; | |
5996 | mprev = &mblk->next; | |
5997 | } | |
7146af97 JB |
5998 | } |
5999 | ||
6000 | total_markers = num_used; | |
6001 | total_free_markers = num_free; | |
6002 | } | |
6003 | ||
6004 | /* Free all unmarked buffers */ | |
6005 | { | |
6006 | register struct buffer *buffer = all_buffers, *prev = 0, *next; | |
6007 | ||
6008 | while (buffer) | |
3ef06d12 | 6009 | if (!VECTOR_MARKED_P (buffer)) |
7146af97 JB |
6010 | { |
6011 | if (prev) | |
eab3844f | 6012 | prev->header.next = buffer->header.next; |
7146af97 | 6013 | else |
eab3844f PE |
6014 | all_buffers = buffer->header.next.buffer; |
6015 | next = buffer->header.next.buffer; | |
34400008 | 6016 | lisp_free (buffer); |
7146af97 JB |
6017 | buffer = next; |
6018 | } | |
6019 | else | |
6020 | { | |
3ef06d12 | 6021 | VECTOR_UNMARK (buffer); |
30e3190a | 6022 | UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer)); |
eab3844f | 6023 | prev = buffer, buffer = buffer->header.next.buffer; |
7146af97 JB |
6024 | } |
6025 | } | |
6026 | ||
7146af97 JB |
6027 | /* Free all unmarked vectors */ |
6028 | { | |
6029 | register struct Lisp_Vector *vector = all_vectors, *prev = 0, *next; | |
6030 | total_vector_size = 0; | |
6031 | ||
6032 | while (vector) | |
3ef06d12 | 6033 | if (!VECTOR_MARKED_P (vector)) |
7146af97 JB |
6034 | { |
6035 | if (prev) | |
eab3844f | 6036 | prev->header.next = vector->header.next; |
7146af97 | 6037 | else |
eab3844f PE |
6038 | all_vectors = vector->header.next.vector; |
6039 | next = vector->header.next.vector; | |
c8099634 RS |
6040 | lisp_free (vector); |
6041 | n_vectors--; | |
7146af97 | 6042 | vector = next; |
41c28a37 | 6043 | |
7146af97 JB |
6044 | } |
6045 | else | |
6046 | { | |
3ef06d12 | 6047 | VECTOR_UNMARK (vector); |
eab3844f PE |
6048 | if (vector->header.size & PSEUDOVECTOR_FLAG) |
6049 | total_vector_size += PSEUDOVECTOR_SIZE_MASK & vector->header.size; | |
fa05e253 | 6050 | else |
eab3844f PE |
6051 | total_vector_size += vector->header.size; |
6052 | prev = vector, vector = vector->header.next.vector; | |
7146af97 JB |
6053 | } |
6054 | } | |
177c0ea7 | 6055 | |
676a7251 GM |
6056 | #ifdef GC_CHECK_STRING_BYTES |
6057 | if (!noninteractive) | |
6058 | check_string_bytes (1); | |
6059 | #endif | |
7146af97 | 6060 | } |
7146af97 | 6061 | |
7146af97 | 6062 | |
7146af97 | 6063 | |
7146af97 | 6064 | \f |
20d24714 JB |
6065 | /* Debugging aids. */ |
6066 | ||
31ce1c91 | 6067 | DEFUN ("memory-limit", Fmemory_limit, Smemory_limit, 0, 0, 0, |
a6266d23 | 6068 | doc: /* Return the address of the last byte Emacs has allocated, divided by 1024. |
228299fa | 6069 | This may be helpful in debugging Emacs's memory usage. |
7ee72033 | 6070 | We divide the value by 1024 to make sure it fits in a Lisp integer. */) |
5842a27b | 6071 | (void) |
20d24714 JB |
6072 | { |
6073 | Lisp_Object end; | |
6074 | ||
d40d4be1 | 6075 | XSETINT (end, (EMACS_INT) (char *) sbrk (0) / 1024); |
20d24714 JB |
6076 | |
6077 | return end; | |
6078 | } | |
6079 | ||
310ea200 | 6080 | DEFUN ("memory-use-counts", Fmemory_use_counts, Smemory_use_counts, 0, 0, 0, |
a6266d23 | 6081 | doc: /* Return a list of counters that measure how much consing there has been. |
228299fa GM |
6082 | Each of these counters increments for a certain kind of object. |
6083 | The counters wrap around from the largest positive integer to zero. | |
6084 | Garbage collection does not decrease them. | |
6085 | The elements of the value are as follows: | |
6086 | (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS) | |
6087 | All are in units of 1 = one object consed | |
6088 | except for VECTOR-CELLS and STRING-CHARS, which count the total length of | |
6089 | objects consed. | |
6090 | MISCS include overlays, markers, and some internal types. | |
6091 | Frames, windows, buffers, and subprocesses count as vectors | |
7ee72033 | 6092 | (but the contents of a buffer's text do not count here). */) |
5842a27b | 6093 | (void) |
310ea200 | 6094 | { |
2e471eb5 | 6095 | Lisp_Object consed[8]; |
310ea200 | 6096 | |
78e985eb GM |
6097 | consed[0] = make_number (min (MOST_POSITIVE_FIXNUM, cons_cells_consed)); |
6098 | consed[1] = make_number (min (MOST_POSITIVE_FIXNUM, floats_consed)); | |
6099 | consed[2] = make_number (min (MOST_POSITIVE_FIXNUM, vector_cells_consed)); | |
6100 | consed[3] = make_number (min (MOST_POSITIVE_FIXNUM, symbols_consed)); | |
6101 | consed[4] = make_number (min (MOST_POSITIVE_FIXNUM, string_chars_consed)); | |
6102 | consed[5] = make_number (min (MOST_POSITIVE_FIXNUM, misc_objects_consed)); | |
6103 | consed[6] = make_number (min (MOST_POSITIVE_FIXNUM, intervals_consed)); | |
6104 | consed[7] = make_number (min (MOST_POSITIVE_FIXNUM, strings_consed)); | |
310ea200 | 6105 | |
2e471eb5 | 6106 | return Flist (8, consed); |
310ea200 | 6107 | } |
e0b8c689 | 6108 | |
244ed907 | 6109 | #ifdef ENABLE_CHECKING |
e0b8c689 | 6110 | int suppress_checking; |
d3d47262 | 6111 | |
e0b8c689 | 6112 | void |
971de7fb | 6113 | die (const char *msg, const char *file, int line) |
e0b8c689 | 6114 | { |
67ee9f6e | 6115 | fprintf (stderr, "\r\n%s:%d: Emacs fatal error: %s\r\n", |
e0b8c689 KR |
6116 | file, line, msg); |
6117 | abort (); | |
6118 | } | |
244ed907 | 6119 | #endif |
20d24714 | 6120 | \f |
7146af97 JB |
6121 | /* Initialization */ |
6122 | ||
dfcf069d | 6123 | void |
971de7fb | 6124 | init_alloc_once (void) |
7146af97 JB |
6125 | { |
6126 | /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */ | |
9e713715 GM |
6127 | purebeg = PUREBEG; |
6128 | pure_size = PURESIZE; | |
1f0b3fd2 | 6129 | pure_bytes_used = 0; |
e5bc14d4 | 6130 | pure_bytes_used_lisp = pure_bytes_used_non_lisp = 0; |
9e713715 GM |
6131 | pure_bytes_used_before_overflow = 0; |
6132 | ||
ab6780cd SM |
6133 | /* Initialize the list of free aligned blocks. */ |
6134 | free_ablock = NULL; | |
6135 | ||
877935b1 | 6136 | #if GC_MARK_STACK || defined GC_MALLOC_CHECK |
34400008 GM |
6137 | mem_init (); |
6138 | Vdead = make_pure_string ("DEAD", 4, 4, 0); | |
6139 | #endif | |
9e713715 | 6140 | |
7146af97 JB |
6141 | all_vectors = 0; |
6142 | ignore_warnings = 1; | |
d1658221 RS |
6143 | #ifdef DOUG_LEA_MALLOC |
6144 | mallopt (M_TRIM_THRESHOLD, 128*1024); /* trim threshold */ | |
6145 | mallopt (M_MMAP_THRESHOLD, 64*1024); /* mmap threshold */ | |
81d492d5 | 6146 | mallopt (M_MMAP_MAX, MMAP_MAX_AREAS); /* max. number of mmap'ed areas */ |
d1658221 | 6147 | #endif |
7146af97 JB |
6148 | init_strings (); |
6149 | init_cons (); | |
6150 | init_symbol (); | |
6151 | init_marker (); | |
7146af97 | 6152 | init_float (); |
34400008 | 6153 | init_intervals (); |
5ac58e4c | 6154 | init_weak_hash_tables (); |
d5e35230 | 6155 | |
276cbe5a RS |
6156 | #ifdef REL_ALLOC |
6157 | malloc_hysteresis = 32; | |
6158 | #else | |
6159 | malloc_hysteresis = 0; | |
6160 | #endif | |
6161 | ||
24d8a105 | 6162 | refill_memory_reserve (); |
276cbe5a | 6163 | |
7146af97 JB |
6164 | ignore_warnings = 0; |
6165 | gcprolist = 0; | |
630686c8 | 6166 | byte_stack_list = 0; |
7146af97 JB |
6167 | staticidx = 0; |
6168 | consing_since_gc = 0; | |
7d179cea | 6169 | gc_cons_threshold = 100000 * sizeof (Lisp_Object); |
974aae61 | 6170 | gc_relative_threshold = 0; |
7146af97 JB |
6171 | } |
6172 | ||
dfcf069d | 6173 | void |
971de7fb | 6174 | init_alloc (void) |
7146af97 JB |
6175 | { |
6176 | gcprolist = 0; | |
630686c8 | 6177 | byte_stack_list = 0; |
182ff242 GM |
6178 | #if GC_MARK_STACK |
6179 | #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS | |
6180 | setjmp_tested_p = longjmps_done = 0; | |
6181 | #endif | |
6182 | #endif | |
2c5bd608 DL |
6183 | Vgc_elapsed = make_float (0.0); |
6184 | gcs_done = 0; | |
7146af97 JB |
6185 | } |
6186 | ||
6187 | void | |
971de7fb | 6188 | syms_of_alloc (void) |
7146af97 | 6189 | { |
29208e82 | 6190 | DEFVAR_INT ("gc-cons-threshold", gc_cons_threshold, |
a6266d23 | 6191 | doc: /* *Number of bytes of consing between garbage collections. |
228299fa GM |
6192 | Garbage collection can happen automatically once this many bytes have been |
6193 | allocated since the last garbage collection. All data types count. | |
7146af97 | 6194 | |
228299fa | 6195 | Garbage collection happens automatically only when `eval' is called. |
7146af97 | 6196 | |
228299fa | 6197 | By binding this temporarily to a large number, you can effectively |
96f077ad SM |
6198 | prevent garbage collection during a part of the program. |
6199 | See also `gc-cons-percentage'. */); | |
6200 | ||
29208e82 | 6201 | DEFVAR_LISP ("gc-cons-percentage", Vgc_cons_percentage, |
96f077ad SM |
6202 | doc: /* *Portion of the heap used for allocation. |
6203 | Garbage collection can happen automatically once this portion of the heap | |
6204 | has been allocated since the last garbage collection. | |
6205 | If this portion is smaller than `gc-cons-threshold', this is ignored. */); | |
6206 | Vgc_cons_percentage = make_float (0.1); | |
0819585c | 6207 | |
29208e82 | 6208 | DEFVAR_INT ("pure-bytes-used", pure_bytes_used, |
a6266d23 | 6209 | doc: /* Number of bytes of sharable Lisp data allocated so far. */); |
0819585c | 6210 | |
29208e82 | 6211 | DEFVAR_INT ("cons-cells-consed", cons_cells_consed, |
a6266d23 | 6212 | doc: /* Number of cons cells that have been consed so far. */); |
0819585c | 6213 | |
29208e82 | 6214 | DEFVAR_INT ("floats-consed", floats_consed, |
a6266d23 | 6215 | doc: /* Number of floats that have been consed so far. */); |
0819585c | 6216 | |
29208e82 | 6217 | DEFVAR_INT ("vector-cells-consed", vector_cells_consed, |
a6266d23 | 6218 | doc: /* Number of vector cells that have been consed so far. */); |
0819585c | 6219 | |
29208e82 | 6220 | DEFVAR_INT ("symbols-consed", symbols_consed, |
a6266d23 | 6221 | doc: /* Number of symbols that have been consed so far. */); |
0819585c | 6222 | |
29208e82 | 6223 | DEFVAR_INT ("string-chars-consed", string_chars_consed, |
a6266d23 | 6224 | doc: /* Number of string characters that have been consed so far. */); |
0819585c | 6225 | |
29208e82 | 6226 | DEFVAR_INT ("misc-objects-consed", misc_objects_consed, |
a6266d23 | 6227 | doc: /* Number of miscellaneous objects that have been consed so far. */); |
2e471eb5 | 6228 | |
29208e82 | 6229 | DEFVAR_INT ("intervals-consed", intervals_consed, |
a6266d23 | 6230 | doc: /* Number of intervals that have been consed so far. */); |
7146af97 | 6231 | |
29208e82 | 6232 | DEFVAR_INT ("strings-consed", strings_consed, |
a6266d23 | 6233 | doc: /* Number of strings that have been consed so far. */); |
228299fa | 6234 | |
29208e82 | 6235 | DEFVAR_LISP ("purify-flag", Vpurify_flag, |
a6266d23 | 6236 | doc: /* Non-nil means loading Lisp code in order to dump an executable. |
e9515805 SM |
6237 | This means that certain objects should be allocated in shared (pure) space. |
6238 | It can also be set to a hash-table, in which case this table is used to | |
6239 | do hash-consing of the objects allocated to pure space. */); | |
228299fa | 6240 | |
29208e82 | 6241 | DEFVAR_BOOL ("garbage-collection-messages", garbage_collection_messages, |
a6266d23 | 6242 | doc: /* Non-nil means display messages at start and end of garbage collection. */); |
299585ee RS |
6243 | garbage_collection_messages = 0; |
6244 | ||
29208e82 | 6245 | DEFVAR_LISP ("post-gc-hook", Vpost_gc_hook, |
a6266d23 | 6246 | doc: /* Hook run after garbage collection has finished. */); |
9e713715 | 6247 | Vpost_gc_hook = Qnil; |
d67b4f80 | 6248 | Qpost_gc_hook = intern_c_string ("post-gc-hook"); |
9e713715 GM |
6249 | staticpro (&Qpost_gc_hook); |
6250 | ||
29208e82 | 6251 | DEFVAR_LISP ("memory-signal-data", Vmemory_signal_data, |
74a54b04 | 6252 | doc: /* Precomputed `signal' argument for memory-full error. */); |
bcb61d60 KH |
6253 | /* We build this in advance because if we wait until we need it, we might |
6254 | not be able to allocate the memory to hold it. */ | |
74a54b04 | 6255 | Vmemory_signal_data |
f4265f6c DN |
6256 | = pure_cons (Qerror, |
6257 | pure_cons (make_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"), Qnil)); | |
74a54b04 | 6258 | |
29208e82 | 6259 | DEFVAR_LISP ("memory-full", Vmemory_full, |
24d8a105 | 6260 | doc: /* Non-nil means Emacs cannot get much more Lisp memory. */); |
74a54b04 | 6261 | Vmemory_full = Qnil; |
bcb61d60 | 6262 | |
e8197642 | 6263 | staticpro (&Qgc_cons_threshold); |
d67b4f80 | 6264 | Qgc_cons_threshold = intern_c_string ("gc-cons-threshold"); |
e8197642 | 6265 | |
a59de17b | 6266 | staticpro (&Qchar_table_extra_slots); |
d67b4f80 | 6267 | Qchar_table_extra_slots = intern_c_string ("char-table-extra-slots"); |
a59de17b | 6268 | |
29208e82 | 6269 | DEFVAR_LISP ("gc-elapsed", Vgc_elapsed, |
2c5bd608 | 6270 | doc: /* Accumulated time elapsed in garbage collections. |
e7415487 | 6271 | The time is in seconds as a floating point value. */); |
29208e82 | 6272 | DEFVAR_INT ("gcs-done", gcs_done, |
e7415487 | 6273 | doc: /* Accumulated number of garbage collections done. */); |
2c5bd608 | 6274 | |
7146af97 JB |
6275 | defsubr (&Scons); |
6276 | defsubr (&Slist); | |
6277 | defsubr (&Svector); | |
6278 | defsubr (&Smake_byte_code); | |
6279 | defsubr (&Smake_list); | |
6280 | defsubr (&Smake_vector); | |
6281 | defsubr (&Smake_string); | |
7b07587b | 6282 | defsubr (&Smake_bool_vector); |
7146af97 JB |
6283 | defsubr (&Smake_symbol); |
6284 | defsubr (&Smake_marker); | |
6285 | defsubr (&Spurecopy); | |
6286 | defsubr (&Sgarbage_collect); | |
20d24714 | 6287 | defsubr (&Smemory_limit); |
310ea200 | 6288 | defsubr (&Smemory_use_counts); |
34400008 GM |
6289 | |
6290 | #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES | |
6291 | defsubr (&Sgc_status); | |
6292 | #endif | |
7146af97 | 6293 | } |