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