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