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