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