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