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" |
e54daa22 | 56 | #include "charset.h" |
e065a56e | 57 | #include "syssignal.h" |
4a729fd8 | 58 | #include "termhooks.h" /* For struct terminal. */ |
34400008 | 59 | #include <setjmp.h> |
e065a56e | 60 | |
ad5f3636 DL |
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 | 195 | /* Minimum number of bytes of consing since GC before next GC. */ |
310ea200 | 196 | |
31ade731 | 197 | EMACS_INT gc_cons_threshold; |
7146af97 | 198 | |
974aae61 RS |
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 | |
382d38fa | 505 | #define NSTATICS 1280 |
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 | |
d7489312 | 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 | |
831b476c | 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 | } | |
831b476c | 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) \ |
03bb6a06 | 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 | { | |
d7489312 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 | ||
4532fdde RS |
1035 | if (base == 0) |
1036 | { | |
dafc79fa | 1037 | MALLOC_UNBLOCK_INPUT; |
4532fdde RS |
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 | ||
831b476c | 1050 | #ifndef USE_LSB_TAG |
f4446bbf GM |
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; |
f4446bbf GM |
1064 | memory_full (); |
1065 | } | |
1066 | } | |
831b476c | 1067 | #endif |
f4446bbf | 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 | } | |
03bb6a06 | 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); | |
03bb6a06 | 1083 | eassert (aligned == (long) ABLOCKS_BUSY (abase)); |
ab6780cd SM |
1084 | } |
1085 | ||
1086 | abase = ABLOCK_ABASE (free_ablock); | |
03bb6a06 | 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. */ | |
03bb6a06 | 1119 | ABLOCKS_BUSY (abase) = (struct ablocks *) (-2 + (long) ABLOCKS_BUSY (abase)); |
d2db1c32 | 1120 | |
03bb6a06 | 1121 | if (2 > (long) ABLOCKS_BUSY (abase)) |
ab6780cd | 1122 | { /* All the blocks are free. */ |
03bb6a06 | 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 | { |
d05b383a | 1410 | /* Place `intervals' first, to preserve alignment. */ |
2e471eb5 | 1411 | struct interval intervals[INTERVAL_BLOCK_SIZE]; |
d05b383a | 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 | { | |
0930c1a1 SM |
1443 | interval_block = NULL; |
1444 | interval_block_index = INTERVAL_BLOCK_SIZE; | |
d5e35230 | 1445 | interval_free_list = 0; |
0930c1a1 | 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 | { |
d05b383a | 1657 | /* Place `strings' first, to preserve alignment. */ |
19bcad1f | 1658 | struct Lisp_String strings[STRING_BLOCK_SIZE]; |
d05b383a | 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); | |
2289 | if (SINGLE_BYTE_CHAR_P (c)) | |
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 SM |
2343 | XVECTOR (val)->size = 0; /* No Lisp_Object to trace in there. */ |
2344 | XSETPVECTYPE (XVECTOR (val), PVEC_BOOL_VECTOR); | |
2345 | ||
2346 | p = XBOOL_VECTOR (val); | |
2e471eb5 | 2347 | p->size = XFASTINT (length); |
177c0ea7 | 2348 | |
2e471eb5 GM |
2349 | real_init = (NILP (init) ? 0 : -1); |
2350 | for (i = 0; i < length_in_chars ; i++) | |
2351 | p->data[i] = real_init; | |
177c0ea7 | 2352 | |
2e471eb5 | 2353 | /* Clear the extraneous bits in the last byte. */ |
a097329f | 2354 | if (XINT (length) != length_in_chars * BOOL_VECTOR_BITS_PER_CHAR) |
d2029e5b | 2355 | p->data[length_in_chars - 1] |
a097329f | 2356 | &= (1 << (XINT (length) % BOOL_VECTOR_BITS_PER_CHAR)) - 1; |
2e471eb5 GM |
2357 | |
2358 | return val; | |
2359 | } | |
2360 | ||
2361 | ||
2362 | /* Make a string from NBYTES bytes at CONTENTS, and compute the number | |
2363 | of characters from the contents. This string may be unibyte or | |
2364 | multibyte, depending on the contents. */ | |
2365 | ||
2366 | Lisp_Object | |
2367 | make_string (contents, nbytes) | |
943b873e | 2368 | const char *contents; |
2e471eb5 GM |
2369 | int nbytes; |
2370 | { | |
2371 | register Lisp_Object val; | |
9eac9d59 KH |
2372 | int nchars, multibyte_nbytes; |
2373 | ||
2374 | parse_str_as_multibyte (contents, nbytes, &nchars, &multibyte_nbytes); | |
9eac9d59 KH |
2375 | if (nbytes == nchars || nbytes != multibyte_nbytes) |
2376 | /* CONTENTS contains no multibyte sequences or contains an invalid | |
2377 | multibyte sequence. We must make unibyte string. */ | |
495a6df3 KH |
2378 | val = make_unibyte_string (contents, nbytes); |
2379 | else | |
2380 | val = make_multibyte_string (contents, nchars, nbytes); | |
2e471eb5 GM |
2381 | return val; |
2382 | } | |
2383 | ||
2384 | ||
2385 | /* Make an unibyte string from LENGTH bytes at CONTENTS. */ | |
2386 | ||
2387 | Lisp_Object | |
2388 | make_unibyte_string (contents, length) | |
943b873e | 2389 | const char *contents; |
2e471eb5 GM |
2390 | int length; |
2391 | { | |
2392 | register Lisp_Object val; | |
2393 | val = make_uninit_string (length); | |
d5db4077 KR |
2394 | bcopy (contents, SDATA (val), length); |
2395 | STRING_SET_UNIBYTE (val); | |
2e471eb5 GM |
2396 | return val; |
2397 | } | |
2398 | ||
2399 | ||
2400 | /* Make a multibyte string from NCHARS characters occupying NBYTES | |
2401 | bytes at CONTENTS. */ | |
2402 | ||
2403 | Lisp_Object | |
2404 | make_multibyte_string (contents, nchars, nbytes) | |
943b873e | 2405 | const char *contents; |
2e471eb5 GM |
2406 | int nchars, nbytes; |
2407 | { | |
2408 | register Lisp_Object val; | |
2409 | val = make_uninit_multibyte_string (nchars, nbytes); | |
d5db4077 | 2410 | bcopy (contents, SDATA (val), nbytes); |
2e471eb5 GM |
2411 | return val; |
2412 | } | |
2413 | ||
2414 | ||
2415 | /* Make a string from NCHARS characters occupying NBYTES bytes at | |
2416 | CONTENTS. It is a multibyte string if NBYTES != NCHARS. */ | |
2417 | ||
2418 | Lisp_Object | |
2419 | make_string_from_bytes (contents, nchars, nbytes) | |
fcbb914b | 2420 | const char *contents; |
2e471eb5 GM |
2421 | int nchars, nbytes; |
2422 | { | |
2423 | register Lisp_Object val; | |
2424 | val = make_uninit_multibyte_string (nchars, nbytes); | |
d5db4077 KR |
2425 | bcopy (contents, SDATA (val), nbytes); |
2426 | if (SBYTES (val) == SCHARS (val)) | |
2427 | STRING_SET_UNIBYTE (val); | |
2e471eb5 GM |
2428 | return val; |
2429 | } | |
2430 | ||
2431 | ||
2432 | /* Make a string from NCHARS characters occupying NBYTES bytes at | |
2433 | CONTENTS. The argument MULTIBYTE controls whether to label the | |
229b28c4 KH |
2434 | string as multibyte. If NCHARS is negative, it counts the number of |
2435 | characters by itself. */ | |
2e471eb5 GM |
2436 | |
2437 | Lisp_Object | |
2438 | make_specified_string (contents, nchars, nbytes, multibyte) | |
fcbb914b | 2439 | const char *contents; |
2e471eb5 GM |
2440 | int nchars, nbytes; |
2441 | int multibyte; | |
2442 | { | |
2443 | register Lisp_Object val; | |
229b28c4 KH |
2444 | |
2445 | if (nchars < 0) | |
2446 | { | |
2447 | if (multibyte) | |
2448 | nchars = multibyte_chars_in_text (contents, nbytes); | |
2449 | else | |
2450 | nchars = nbytes; | |
2451 | } | |
2e471eb5 | 2452 | val = make_uninit_multibyte_string (nchars, nbytes); |
d5db4077 | 2453 | bcopy (contents, SDATA (val), nbytes); |
2e471eb5 | 2454 | if (!multibyte) |
d5db4077 | 2455 | STRING_SET_UNIBYTE (val); |
2e471eb5 GM |
2456 | return val; |
2457 | } | |
2458 | ||
2459 | ||
2460 | /* Make a string from the data at STR, treating it as multibyte if the | |
2461 | data warrants. */ | |
2462 | ||
2463 | Lisp_Object | |
2464 | build_string (str) | |
943b873e | 2465 | const char *str; |
2e471eb5 GM |
2466 | { |
2467 | return make_string (str, strlen (str)); | |
2468 | } | |
2469 | ||
2470 | ||
2471 | /* Return an unibyte Lisp_String set up to hold LENGTH characters | |
2472 | occupying LENGTH bytes. */ | |
2473 | ||
2474 | Lisp_Object | |
2475 | make_uninit_string (length) | |
2476 | int length; | |
2477 | { | |
2478 | Lisp_Object val; | |
4d774b0f JB |
2479 | |
2480 | if (!length) | |
2481 | return empty_unibyte_string; | |
2e471eb5 | 2482 | val = make_uninit_multibyte_string (length, length); |
d5db4077 | 2483 | STRING_SET_UNIBYTE (val); |
2e471eb5 GM |
2484 | return val; |
2485 | } | |
2486 | ||
2487 | ||
2488 | /* Return a multibyte Lisp_String set up to hold NCHARS characters | |
2489 | which occupy NBYTES bytes. */ | |
2490 | ||
2491 | Lisp_Object | |
2492 | make_uninit_multibyte_string (nchars, nbytes) | |
2493 | int nchars, nbytes; | |
2494 | { | |
2495 | Lisp_Object string; | |
2496 | struct Lisp_String *s; | |
2497 | ||
2498 | if (nchars < 0) | |
2499 | abort (); | |
4d774b0f JB |
2500 | if (!nbytes) |
2501 | return empty_multibyte_string; | |
2e471eb5 GM |
2502 | |
2503 | s = allocate_string (); | |
2504 | allocate_string_data (s, nchars, nbytes); | |
2505 | XSETSTRING (string, s); | |
2506 | string_chars_consed += nbytes; | |
2507 | return string; | |
2508 | } | |
2509 | ||
2510 | ||
2511 | \f | |
2512 | /*********************************************************************** | |
2513 | Float Allocation | |
2514 | ***********************************************************************/ | |
2515 | ||
2e471eb5 GM |
2516 | /* We store float cells inside of float_blocks, allocating a new |
2517 | float_block with malloc whenever necessary. Float cells reclaimed | |
2518 | by GC are put on a free list to be reallocated before allocating | |
ab6780cd | 2519 | any new float cells from the latest float_block. */ |
2e471eb5 | 2520 | |
d05b383a SM |
2521 | #define FLOAT_BLOCK_SIZE \ |
2522 | (((BLOCK_BYTES - sizeof (struct float_block *) \ | |
2523 | /* The compiler might add padding at the end. */ \ | |
2524 | - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \ | |
ab6780cd SM |
2525 | / (sizeof (struct Lisp_Float) * CHAR_BIT + 1)) |
2526 | ||
2527 | #define GETMARKBIT(block,n) \ | |
2528 | (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \ | |
2529 | >> ((n) % (sizeof(int) * CHAR_BIT))) \ | |
2530 | & 1) | |
2531 | ||
2532 | #define SETMARKBIT(block,n) \ | |
2533 | (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \ | |
2534 | |= 1 << ((n) % (sizeof(int) * CHAR_BIT)) | |
2535 | ||
2536 | #define UNSETMARKBIT(block,n) \ | |
2537 | (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \ | |
2538 | &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT))) | |
2539 | ||
2540 | #define FLOAT_BLOCK(fptr) \ | |
2541 | ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1))) | |
2542 | ||
2543 | #define FLOAT_INDEX(fptr) \ | |
2544 | ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float)) | |
2e471eb5 GM |
2545 | |
2546 | struct float_block | |
2547 | { | |
ab6780cd | 2548 | /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */ |
2e471eb5 | 2549 | struct Lisp_Float floats[FLOAT_BLOCK_SIZE]; |
ab6780cd SM |
2550 | int gcmarkbits[1 + FLOAT_BLOCK_SIZE / (sizeof(int) * CHAR_BIT)]; |
2551 | struct float_block *next; | |
2e471eb5 GM |
2552 | }; |
2553 | ||
ab6780cd SM |
2554 | #define FLOAT_MARKED_P(fptr) \ |
2555 | GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr))) | |
2556 | ||
2557 | #define FLOAT_MARK(fptr) \ | |
2558 | SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr))) | |
2559 | ||
2560 | #define FLOAT_UNMARK(fptr) \ | |
2561 | UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr))) | |
2562 | ||
34400008 GM |
2563 | /* Current float_block. */ |
2564 | ||
2e471eb5 | 2565 | struct float_block *float_block; |
34400008 GM |
2566 | |
2567 | /* Index of first unused Lisp_Float in the current float_block. */ | |
2568 | ||
2e471eb5 GM |
2569 | int float_block_index; |
2570 | ||
2571 | /* Total number of float blocks now in use. */ | |
2572 | ||
2573 | int n_float_blocks; | |
2574 | ||
34400008 GM |
2575 | /* Free-list of Lisp_Floats. */ |
2576 | ||
2e471eb5 GM |
2577 | struct Lisp_Float *float_free_list; |
2578 | ||
34400008 | 2579 | |
966533c9 | 2580 | /* Initialize float allocation. */ |
34400008 | 2581 | |
2e471eb5 GM |
2582 | void |
2583 | init_float () | |
2584 | { | |
08b7c2cb SM |
2585 | float_block = NULL; |
2586 | float_block_index = FLOAT_BLOCK_SIZE; /* Force alloc of new float_block. */ | |
2e471eb5 | 2587 | float_free_list = 0; |
08b7c2cb | 2588 | n_float_blocks = 0; |
2e471eb5 GM |
2589 | } |
2590 | ||
34400008 GM |
2591 | |
2592 | /* Explicitly free a float cell by putting it on the free-list. */ | |
2e471eb5 GM |
2593 | |
2594 | void | |
2595 | free_float (ptr) | |
2596 | struct Lisp_Float *ptr; | |
2597 | { | |
28a099a4 | 2598 | ptr->u.chain = float_free_list; |
2e471eb5 GM |
2599 | float_free_list = ptr; |
2600 | } | |
2601 | ||
34400008 GM |
2602 | |
2603 | /* Return a new float object with value FLOAT_VALUE. */ | |
2604 | ||
2e471eb5 GM |
2605 | Lisp_Object |
2606 | make_float (float_value) | |
2607 | double float_value; | |
2608 | { | |
2609 | register Lisp_Object val; | |
2610 | ||
e2984df0 CY |
2611 | /* eassert (!handling_signal); */ |
2612 | ||
dafc79fa | 2613 | MALLOC_BLOCK_INPUT; |
cfb2f32e | 2614 | |
2e471eb5 GM |
2615 | if (float_free_list) |
2616 | { | |
2617 | /* We use the data field for chaining the free list | |
2618 | so that we won't use the same field that has the mark bit. */ | |
2619 | XSETFLOAT (val, float_free_list); | |
28a099a4 | 2620 | float_free_list = float_free_list->u.chain; |
2e471eb5 GM |
2621 | } |
2622 | else | |
2623 | { | |
2624 | if (float_block_index == FLOAT_BLOCK_SIZE) | |
2625 | { | |
2626 | register struct float_block *new; | |
2627 | ||
ab6780cd SM |
2628 | new = (struct float_block *) lisp_align_malloc (sizeof *new, |
2629 | MEM_TYPE_FLOAT); | |
2e471eb5 | 2630 | new->next = float_block; |
a0668126 | 2631 | bzero ((char *) new->gcmarkbits, sizeof new->gcmarkbits); |
2e471eb5 GM |
2632 | float_block = new; |
2633 | float_block_index = 0; | |
2634 | n_float_blocks++; | |
2635 | } | |
a0668126 SM |
2636 | XSETFLOAT (val, &float_block->floats[float_block_index]); |
2637 | float_block_index++; | |
2e471eb5 | 2638 | } |
177c0ea7 | 2639 | |
dafc79fa | 2640 | MALLOC_UNBLOCK_INPUT; |
e2984df0 | 2641 | |
2e471eb5 | 2642 | XFLOAT_DATA (val) = float_value; |
a0668126 | 2643 | eassert (!FLOAT_MARKED_P (XFLOAT (val))); |
2e471eb5 GM |
2644 | consing_since_gc += sizeof (struct Lisp_Float); |
2645 | floats_consed++; | |
2646 | return val; | |
2647 | } | |
2648 | ||
2e471eb5 GM |
2649 | |
2650 | \f | |
2651 | /*********************************************************************** | |
2652 | Cons Allocation | |
2653 | ***********************************************************************/ | |
2654 | ||
2655 | /* We store cons cells inside of cons_blocks, allocating a new | |
2656 | cons_block with malloc whenever necessary. Cons cells reclaimed by | |
2657 | GC are put on a free list to be reallocated before allocating | |
08b7c2cb | 2658 | any new cons cells from the latest cons_block. */ |
2e471eb5 GM |
2659 | |
2660 | #define CONS_BLOCK_SIZE \ | |
08b7c2cb SM |
2661 | (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \ |
2662 | / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1)) | |
2663 | ||
2664 | #define CONS_BLOCK(fptr) \ | |
2665 | ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1))) | |
2666 | ||
2667 | #define CONS_INDEX(fptr) \ | |
2668 | ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons)) | |
2e471eb5 GM |
2669 | |
2670 | struct cons_block | |
2671 | { | |
08b7c2cb | 2672 | /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */ |
2e471eb5 | 2673 | struct Lisp_Cons conses[CONS_BLOCK_SIZE]; |
08b7c2cb SM |
2674 | int gcmarkbits[1 + CONS_BLOCK_SIZE / (sizeof(int) * CHAR_BIT)]; |
2675 | struct cons_block *next; | |
2e471eb5 GM |
2676 | }; |
2677 | ||
08b7c2cb SM |
2678 | #define CONS_MARKED_P(fptr) \ |
2679 | GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr))) | |
2680 | ||
2681 | #define CONS_MARK(fptr) \ | |
2682 | SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr))) | |
2683 | ||
2684 | #define CONS_UNMARK(fptr) \ | |
2685 | UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr))) | |
2686 | ||
34400008 GM |
2687 | /* Current cons_block. */ |
2688 | ||
2e471eb5 | 2689 | struct cons_block *cons_block; |
34400008 GM |
2690 | |
2691 | /* Index of first unused Lisp_Cons in the current block. */ | |
2692 | ||
2e471eb5 GM |
2693 | int cons_block_index; |
2694 | ||
34400008 GM |
2695 | /* Free-list of Lisp_Cons structures. */ |
2696 | ||
2e471eb5 GM |
2697 | struct Lisp_Cons *cons_free_list; |
2698 | ||
2699 | /* Total number of cons blocks now in use. */ | |
2700 | ||
2701 | int n_cons_blocks; | |
2702 | ||
34400008 GM |
2703 | |
2704 | /* Initialize cons allocation. */ | |
2705 | ||
2e471eb5 GM |
2706 | void |
2707 | init_cons () | |
2708 | { | |
08b7c2cb SM |
2709 | cons_block = NULL; |
2710 | cons_block_index = CONS_BLOCK_SIZE; /* Force alloc of new cons_block. */ | |
2e471eb5 | 2711 | cons_free_list = 0; |
08b7c2cb | 2712 | n_cons_blocks = 0; |
2e471eb5 GM |
2713 | } |
2714 | ||
34400008 GM |
2715 | |
2716 | /* Explicitly free a cons cell by putting it on the free-list. */ | |
2e471eb5 GM |
2717 | |
2718 | void | |
2719 | free_cons (ptr) | |
2720 | struct Lisp_Cons *ptr; | |
2721 | { | |
28a099a4 | 2722 | ptr->u.chain = cons_free_list; |
34400008 GM |
2723 | #if GC_MARK_STACK |
2724 | ptr->car = Vdead; | |
2725 | #endif | |
2e471eb5 GM |
2726 | cons_free_list = ptr; |
2727 | } | |
2728 | ||
2729 | DEFUN ("cons", Fcons, Scons, 2, 2, 0, | |
a6266d23 | 2730 | doc: /* Create a new cons, give it CAR and CDR as components, and return it. */) |
7ee72033 | 2731 | (car, cdr) |
2e471eb5 GM |
2732 | Lisp_Object car, cdr; |
2733 | { | |
2734 | register Lisp_Object val; | |
2735 | ||
e2984df0 CY |
2736 | /* eassert (!handling_signal); */ |
2737 | ||
dafc79fa | 2738 | MALLOC_BLOCK_INPUT; |
cfb2f32e | 2739 | |
2e471eb5 GM |
2740 | if (cons_free_list) |
2741 | { | |
2742 | /* We use the cdr for chaining the free list | |
2743 | so that we won't use the same field that has the mark bit. */ | |
2744 | XSETCONS (val, cons_free_list); | |
28a099a4 | 2745 | cons_free_list = cons_free_list->u.chain; |
2e471eb5 GM |
2746 | } |
2747 | else | |
2748 | { | |
2749 | if (cons_block_index == CONS_BLOCK_SIZE) | |
2750 | { | |
2751 | register struct cons_block *new; | |
08b7c2cb SM |
2752 | new = (struct cons_block *) lisp_align_malloc (sizeof *new, |
2753 | MEM_TYPE_CONS); | |
a0668126 | 2754 | bzero ((char *) new->gcmarkbits, sizeof new->gcmarkbits); |
2e471eb5 GM |
2755 | new->next = cons_block; |
2756 | cons_block = new; | |
2757 | cons_block_index = 0; | |
2758 | n_cons_blocks++; | |
2759 | } | |
a0668126 SM |
2760 | XSETCONS (val, &cons_block->conses[cons_block_index]); |
2761 | cons_block_index++; | |
2e471eb5 | 2762 | } |
177c0ea7 | 2763 | |
dafc79fa | 2764 | MALLOC_UNBLOCK_INPUT; |
e2984df0 | 2765 | |
f3fbd155 KR |
2766 | XSETCAR (val, car); |
2767 | XSETCDR (val, cdr); | |
a0668126 | 2768 | eassert (!CONS_MARKED_P (XCONS (val))); |
2e471eb5 GM |
2769 | consing_since_gc += sizeof (struct Lisp_Cons); |
2770 | cons_cells_consed++; | |
2771 | return val; | |
2772 | } | |
2773 | ||
e3e56238 RS |
2774 | /* Get an error now if there's any junk in the cons free list. */ |
2775 | void | |
2776 | check_cons_list () | |
2777 | { | |
212f33f1 | 2778 | #ifdef GC_CHECK_CONS_LIST |
e3e56238 RS |
2779 | struct Lisp_Cons *tail = cons_free_list; |
2780 | ||
e3e56238 | 2781 | while (tail) |
28a099a4 | 2782 | tail = tail->u.chain; |
e3e56238 RS |
2783 | #endif |
2784 | } | |
34400008 | 2785 | |
9b306d37 KS |
2786 | /* Make a list of 1, 2, 3, 4 or 5 specified objects. */ |
2787 | ||
2788 | Lisp_Object | |
2789 | list1 (arg1) | |
2790 | Lisp_Object arg1; | |
2791 | { | |
2792 | return Fcons (arg1, Qnil); | |
2793 | } | |
2e471eb5 GM |
2794 | |
2795 | Lisp_Object | |
2796 | list2 (arg1, arg2) | |
2797 | Lisp_Object arg1, arg2; | |
2798 | { | |
2799 | return Fcons (arg1, Fcons (arg2, Qnil)); | |
2800 | } | |
2801 | ||
34400008 | 2802 | |
2e471eb5 GM |
2803 | Lisp_Object |
2804 | list3 (arg1, arg2, arg3) | |
2805 | Lisp_Object arg1, arg2, arg3; | |
2806 | { | |
2807 | return Fcons (arg1, Fcons (arg2, Fcons (arg3, Qnil))); | |
2808 | } | |
2809 | ||
34400008 | 2810 | |
2e471eb5 GM |
2811 | Lisp_Object |
2812 | list4 (arg1, arg2, arg3, arg4) | |
2813 | Lisp_Object arg1, arg2, arg3, arg4; | |
2814 | { | |
2815 | return Fcons (arg1, Fcons (arg2, Fcons (arg3, Fcons (arg4, Qnil)))); | |
2816 | } | |
2817 | ||
34400008 | 2818 | |
2e471eb5 GM |
2819 | Lisp_Object |
2820 | list5 (arg1, arg2, arg3, arg4, arg5) | |
2821 | Lisp_Object arg1, arg2, arg3, arg4, arg5; | |
2822 | { | |
2823 | return Fcons (arg1, Fcons (arg2, Fcons (arg3, Fcons (arg4, | |
2824 | Fcons (arg5, Qnil))))); | |
2825 | } | |
2826 | ||
34400008 | 2827 | |
2e471eb5 | 2828 | DEFUN ("list", Flist, Slist, 0, MANY, 0, |
eae936e2 | 2829 | doc: /* Return a newly created list with specified arguments as elements. |
ae8e8122 MB |
2830 | Any number of arguments, even zero arguments, are allowed. |
2831 | usage: (list &rest OBJECTS) */) | |
7ee72033 | 2832 | (nargs, args) |
2e471eb5 GM |
2833 | int nargs; |
2834 | register Lisp_Object *args; | |
2835 | { | |
2836 | register Lisp_Object val; | |
2837 | val = Qnil; | |
2838 | ||
2839 | while (nargs > 0) | |
2840 | { | |
2841 | nargs--; | |
2842 | val = Fcons (args[nargs], val); | |
2843 | } | |
2844 | return val; | |
2845 | } | |
2846 | ||
34400008 | 2847 | |
2e471eb5 | 2848 | DEFUN ("make-list", Fmake_list, Smake_list, 2, 2, 0, |
a6266d23 | 2849 | doc: /* Return a newly created list of length LENGTH, with each element being INIT. */) |
7ee72033 | 2850 | (length, init) |
2e471eb5 GM |
2851 | register Lisp_Object length, init; |
2852 | { | |
2853 | register Lisp_Object val; | |
2854 | register int size; | |
2855 | ||
b7826503 | 2856 | CHECK_NATNUM (length); |
2e471eb5 GM |
2857 | size = XFASTINT (length); |
2858 | ||
2859 | val = Qnil; | |
ce070307 GM |
2860 | while (size > 0) |
2861 | { | |
2862 | val = Fcons (init, val); | |
2863 | --size; | |
2864 | ||
2865 | if (size > 0) | |
2866 | { | |
2867 | val = Fcons (init, val); | |
2868 | --size; | |
177c0ea7 | 2869 | |
ce070307 GM |
2870 | if (size > 0) |
2871 | { | |
2872 | val = Fcons (init, val); | |
2873 | --size; | |
177c0ea7 | 2874 | |
ce070307 GM |
2875 | if (size > 0) |
2876 | { | |
2877 | val = Fcons (init, val); | |
2878 | --size; | |
177c0ea7 | 2879 | |
ce070307 GM |
2880 | if (size > 0) |
2881 | { | |
2882 | val = Fcons (init, val); | |
2883 | --size; | |
2884 | } | |
2885 | } | |
2886 | } | |
2887 | } | |
2888 | ||
2889 | QUIT; | |
2890 | } | |
177c0ea7 | 2891 | |
7146af97 JB |
2892 | return val; |
2893 | } | |
2e471eb5 GM |
2894 | |
2895 | ||
7146af97 | 2896 | \f |
2e471eb5 GM |
2897 | /*********************************************************************** |
2898 | Vector Allocation | |
2899 | ***********************************************************************/ | |
7146af97 | 2900 | |
34400008 GM |
2901 | /* Singly-linked list of all vectors. */ |
2902 | ||
7146af97 JB |
2903 | struct Lisp_Vector *all_vectors; |
2904 | ||
2e471eb5 GM |
2905 | /* Total number of vector-like objects now in use. */ |
2906 | ||
c8099634 RS |
2907 | int n_vectors; |
2908 | ||
34400008 GM |
2909 | |
2910 | /* Value is a pointer to a newly allocated Lisp_Vector structure | |
2911 | with room for LEN Lisp_Objects. */ | |
2912 | ||
ece93c02 | 2913 | static struct Lisp_Vector * |
9c545a55 | 2914 | allocate_vectorlike (len) |
1825c68d KH |
2915 | EMACS_INT len; |
2916 | { | |
2917 | struct Lisp_Vector *p; | |
675d5130 | 2918 | size_t nbytes; |
1825c68d | 2919 | |
dafc79fa SM |
2920 | MALLOC_BLOCK_INPUT; |
2921 | ||
d1658221 | 2922 | #ifdef DOUG_LEA_MALLOC |
f8608968 GM |
2923 | /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed |
2924 | because mapped region contents are not preserved in | |
2925 | a dumped Emacs. */ | |
d1658221 RS |
2926 | mallopt (M_MMAP_MAX, 0); |
2927 | #endif | |
177c0ea7 | 2928 | |
cfb2f32e SM |
2929 | /* This gets triggered by code which I haven't bothered to fix. --Stef */ |
2930 | /* eassert (!handling_signal); */ | |
2931 | ||
34400008 | 2932 | nbytes = sizeof *p + (len - 1) * sizeof p->contents[0]; |
9c545a55 | 2933 | p = (struct Lisp_Vector *) lisp_malloc (nbytes, MEM_TYPE_VECTORLIKE); |
177c0ea7 | 2934 | |
d1658221 | 2935 | #ifdef DOUG_LEA_MALLOC |
34400008 | 2936 | /* Back to a reasonable maximum of mmap'ed areas. */ |
81d492d5 | 2937 | mallopt (M_MMAP_MAX, MMAP_MAX_AREAS); |
d1658221 | 2938 | #endif |
177c0ea7 | 2939 | |
34400008 | 2940 | consing_since_gc += nbytes; |
310ea200 | 2941 | vector_cells_consed += len; |
1825c68d KH |
2942 | |
2943 | p->next = all_vectors; | |
2944 | all_vectors = p; | |
e2984df0 | 2945 | |
dafc79fa | 2946 | MALLOC_UNBLOCK_INPUT; |
e2984df0 | 2947 | |
34400008 | 2948 | ++n_vectors; |
1825c68d KH |
2949 | return p; |
2950 | } | |
2951 | ||
34400008 | 2952 | |
ece93c02 GM |
2953 | /* Allocate a vector with NSLOTS slots. */ |
2954 | ||
2955 | struct Lisp_Vector * | |
2956 | allocate_vector (nslots) | |
2957 | EMACS_INT nslots; | |
2958 | { | |
9c545a55 | 2959 | struct Lisp_Vector *v = allocate_vectorlike (nslots); |
ece93c02 GM |
2960 | v->size = nslots; |
2961 | return v; | |
2962 | } | |
2963 | ||
2964 | ||
2965 | /* Allocate other vector-like structures. */ | |
2966 | ||
d2029e5b SM |
2967 | static struct Lisp_Vector * |
2968 | allocate_pseudovector (memlen, lisplen, tag) | |
2969 | int memlen, lisplen; | |
2970 | EMACS_INT tag; | |
2971 | { | |
2972 | struct Lisp_Vector *v = allocate_vectorlike (memlen); | |
2973 | EMACS_INT i; | |
2974 | ||
2975 | /* Only the first lisplen slots will be traced normally by the GC. */ | |
2976 | v->size = lisplen; | |
2977 | for (i = 0; i < lisplen; ++i) | |
2978 | v->contents[i] = Qnil; | |
2979 | ||
2980 | XSETPVECTYPE (v, tag); /* Add the appropriate tag. */ | |
2981 | return v; | |
2982 | } | |
2983 | #define ALLOCATE_PSEUDOVECTOR(typ,field,tag) \ | |
2984 | ((typ*) \ | |
2985 | allocate_pseudovector \ | |
2986 | (VECSIZE (typ), PSEUDOVECSIZE (typ, field), tag)) | |
2987 | ||
ece93c02 GM |
2988 | struct Lisp_Hash_Table * |
2989 | allocate_hash_table () | |
2990 | { | |
2991 | EMACS_INT len = VECSIZE (struct Lisp_Hash_Table); | |
9c545a55 | 2992 | struct Lisp_Vector *v = allocate_vectorlike (len); |
ece93c02 | 2993 | EMACS_INT i; |
177c0ea7 | 2994 | |
ece93c02 GM |
2995 | v->size = len; |
2996 | for (i = 0; i < len; ++i) | |
2997 | v->contents[i] = Qnil; | |
177c0ea7 | 2998 | |
ece93c02 GM |
2999 | return (struct Lisp_Hash_Table *) v; |
3000 | } | |
d2029e5b SM |
3001 | |
3002 | ||
ece93c02 GM |
3003 | struct window * |
3004 | allocate_window () | |
3005 | { | |
d2029e5b | 3006 | return ALLOCATE_PSEUDOVECTOR(struct window, current_matrix, PVEC_WINDOW); |
ece93c02 GM |
3007 | } |
3008 | ||
3009 | ||
4a729fd8 SM |
3010 | struct terminal * |
3011 | allocate_terminal () | |
3012 | { | |
d2029e5b SM |
3013 | struct terminal *t = ALLOCATE_PSEUDOVECTOR (struct terminal, |
3014 | next_terminal, PVEC_TERMINAL); | |
3015 | /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */ | |
3016 | bzero (&(t->next_terminal), | |
3017 | ((char*)(t+1)) - ((char*)&(t->next_terminal))); | |
4a729fd8 | 3018 | |
d2029e5b | 3019 | return t; |
4a729fd8 SM |
3020 | } |
3021 | ||
ece93c02 GM |
3022 | struct frame * |
3023 | allocate_frame () | |
3024 | { | |
d2029e5b SM |
3025 | struct frame *f = ALLOCATE_PSEUDOVECTOR (struct frame, |
3026 | face_cache, PVEC_FRAME); | |
3027 | /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */ | |
3028 | bzero (&(f->face_cache), | |
3029 | ((char*)(f+1)) - ((char*)&(f->face_cache))); | |
3030 | return f; | |
ece93c02 GM |
3031 | } |
3032 | ||
3033 | ||
3034 | struct Lisp_Process * | |
3035 | allocate_process () | |
3036 | { | |
d2029e5b | 3037 | return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process, pid, PVEC_PROCESS); |
ece93c02 GM |
3038 | } |
3039 | ||
3040 | ||
d2029e5b | 3041 | /* Only used for PVEC_WINDOW_CONFIGURATION. */ |
ece93c02 GM |
3042 | struct Lisp_Vector * |
3043 | allocate_other_vector (len) | |
3044 | EMACS_INT len; | |
3045 | { | |
9c545a55 | 3046 | struct Lisp_Vector *v = allocate_vectorlike (len); |
ece93c02 | 3047 | EMACS_INT i; |
177c0ea7 | 3048 | |
ece93c02 GM |
3049 | for (i = 0; i < len; ++i) |
3050 | v->contents[i] = Qnil; | |
3051 | v->size = len; | |
177c0ea7 | 3052 | |
ece93c02 GM |
3053 | return v; |
3054 | } | |
3055 | ||
3056 | ||
7146af97 | 3057 | DEFUN ("make-vector", Fmake_vector, Smake_vector, 2, 2, 0, |
a6266d23 | 3058 | doc: /* Return a newly created vector of length LENGTH, with each element being INIT. |
7ee72033 MB |
3059 | See also the function `vector'. */) |
3060 | (length, init) | |
7146af97 JB |
3061 | register Lisp_Object length, init; |
3062 | { | |
1825c68d KH |
3063 | Lisp_Object vector; |
3064 | register EMACS_INT sizei; | |
3065 | register int index; | |
7146af97 JB |
3066 | register struct Lisp_Vector *p; |
3067 | ||
b7826503 | 3068 | CHECK_NATNUM (length); |
c9dad5ed | 3069 | sizei = XFASTINT (length); |
7146af97 | 3070 | |
ece93c02 | 3071 | p = allocate_vector (sizei); |
7146af97 JB |
3072 | for (index = 0; index < sizei; index++) |
3073 | p->contents[index] = init; | |
3074 | ||
1825c68d | 3075 | XSETVECTOR (vector, p); |
7146af97 JB |
3076 | return vector; |
3077 | } | |
3078 | ||
34400008 | 3079 | |
a59de17b | 3080 | DEFUN ("make-char-table", Fmake_char_table, Smake_char_table, 1, 2, 0, |
a6266d23 | 3081 | doc: /* Return a newly created char-table, with purpose PURPOSE. |
228299fa GM |
3082 | Each element is initialized to INIT, which defaults to nil. |
3083 | PURPOSE should be a symbol which has a `char-table-extra-slots' property. | |
7ee72033 MB |
3084 | The property's value should be an integer between 0 and 10. */) |
3085 | (purpose, init) | |
a59de17b | 3086 | register Lisp_Object purpose, init; |
7b07587b RS |
3087 | { |
3088 | Lisp_Object vector; | |
a59de17b | 3089 | Lisp_Object n; |
b7826503 | 3090 | CHECK_SYMBOL (purpose); |
0551bde3 | 3091 | n = Fget (purpose, Qchar_table_extra_slots); |
b7826503 | 3092 | CHECK_NUMBER (n); |
7b07587b RS |
3093 | if (XINT (n) < 0 || XINT (n) > 10) |
3094 | args_out_of_range (n, Qnil); | |
3095 | /* Add 2 to the size for the defalt and parent slots. */ | |
3096 | vector = Fmake_vector (make_number (CHAR_TABLE_STANDARD_SLOTS + XINT (n)), | |
3097 | init); | |
d2029e5b | 3098 | XSETPVECTYPE (XVECTOR (vector), PVEC_CHAR_TABLE); |
0551bde3 | 3099 | XCHAR_TABLE (vector)->top = Qt; |
c96a008c | 3100 | XCHAR_TABLE (vector)->parent = Qnil; |
a59de17b | 3101 | XCHAR_TABLE (vector)->purpose = purpose; |
7b07587b RS |
3102 | XSETCHAR_TABLE (vector, XCHAR_TABLE (vector)); |
3103 | return vector; | |
3104 | } | |
3105 | ||
34400008 | 3106 | |
2a7a8e99 | 3107 | /* Return a newly created sub char table with slots initialized by INIT. |
0551bde3 KH |
3108 | Since a sub char table does not appear as a top level Emacs Lisp |
3109 | object, we don't need a Lisp interface to make it. */ | |
3110 | ||
3111 | Lisp_Object | |
2a7a8e99 KH |
3112 | make_sub_char_table (init) |
3113 | Lisp_Object init; | |
0551bde3 KH |
3114 | { |
3115 | Lisp_Object vector | |
2a7a8e99 | 3116 | = Fmake_vector (make_number (SUB_CHAR_TABLE_STANDARD_SLOTS), init); |
d2029e5b | 3117 | XSETPVECTYPE (XVECTOR (vector), PVEC_CHAR_TABLE); |
0551bde3 | 3118 | XCHAR_TABLE (vector)->top = Qnil; |
2a7a8e99 | 3119 | XCHAR_TABLE (vector)->defalt = Qnil; |
0551bde3 KH |
3120 | XSETCHAR_TABLE (vector, XCHAR_TABLE (vector)); |
3121 | return vector; | |
3122 | } | |
3123 | ||
34400008 | 3124 | |
7146af97 | 3125 | DEFUN ("vector", Fvector, Svector, 0, MANY, 0, |
eae936e2 | 3126 | doc: /* Return a newly created vector with specified arguments as elements. |
ae8e8122 MB |
3127 | Any number of arguments, even zero arguments, are allowed. |
3128 | usage: (vector &rest OBJECTS) */) | |
7ee72033 | 3129 | (nargs, args) |
7146af97 JB |
3130 | register int nargs; |
3131 | Lisp_Object *args; | |
3132 | { | |
3133 | register Lisp_Object len, val; | |
3134 | register int index; | |
3135 | register struct Lisp_Vector *p; | |
3136 | ||
67ba9986 | 3137 | XSETFASTINT (len, nargs); |
7146af97 JB |
3138 | val = Fmake_vector (len, Qnil); |
3139 | p = XVECTOR (val); | |
3140 | for (index = 0; index < nargs; index++) | |
3141 | p->contents[index] = args[index]; | |
3142 | return val; | |
3143 | } | |
3144 | ||
34400008 | 3145 | |
7146af97 | 3146 | DEFUN ("make-byte-code", Fmake_byte_code, Smake_byte_code, 4, MANY, 0, |
a6266d23 | 3147 | doc: /* Create a byte-code object with specified arguments as elements. |
228299fa GM |
3148 | The arguments should be the arglist, bytecode-string, constant vector, |
3149 | stack size, (optional) doc string, and (optional) interactive spec. | |
3150 | The first four arguments are required; at most six have any | |
ae8e8122 | 3151 | significance. |
92cc28b2 | 3152 | usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */) |
7ee72033 | 3153 | (nargs, args) |
7146af97 JB |
3154 | register int nargs; |
3155 | Lisp_Object *args; | |
3156 | { | |
3157 | register Lisp_Object len, val; | |
3158 | register int index; | |
3159 | register struct Lisp_Vector *p; | |
3160 | ||
67ba9986 | 3161 | XSETFASTINT (len, nargs); |
265a9e55 | 3162 | if (!NILP (Vpurify_flag)) |
5a053ea9 | 3163 | val = make_pure_vector ((EMACS_INT) nargs); |
7146af97 JB |
3164 | else |
3165 | val = Fmake_vector (len, Qnil); | |
9eac9d59 KH |
3166 | |
3167 | if (STRINGP (args[1]) && STRING_MULTIBYTE (args[1])) | |
3168 | /* BYTECODE-STRING must have been produced by Emacs 20.2 or the | |
3169 | earlier because they produced a raw 8-bit string for byte-code | |
3170 | and now such a byte-code string is loaded as multibyte while | |
3171 | raw 8-bit characters converted to multibyte form. Thus, now we | |
3172 | must convert them back to the original unibyte form. */ | |
3173 | args[1] = Fstring_as_unibyte (args[1]); | |
3174 | ||
7146af97 JB |
3175 | p = XVECTOR (val); |
3176 | for (index = 0; index < nargs; index++) | |
3177 | { | |
265a9e55 | 3178 | if (!NILP (Vpurify_flag)) |
7146af97 JB |
3179 | args[index] = Fpurecopy (args[index]); |
3180 | p->contents[index] = args[index]; | |
3181 | } | |
d2029e5b | 3182 | XSETPVECTYPE (p, PVEC_COMPILED); |
50aee051 | 3183 | XSETCOMPILED (val, p); |
7146af97 JB |
3184 | return val; |
3185 | } | |
2e471eb5 | 3186 | |
34400008 | 3187 | |
7146af97 | 3188 | \f |
2e471eb5 GM |
3189 | /*********************************************************************** |
3190 | Symbol Allocation | |
3191 | ***********************************************************************/ | |
7146af97 | 3192 | |
2e471eb5 GM |
3193 | /* Each symbol_block is just under 1020 bytes long, since malloc |
3194 | really allocates in units of powers of two and uses 4 bytes for its | |
3195 | own overhead. */ | |
7146af97 JB |
3196 | |
3197 | #define SYMBOL_BLOCK_SIZE \ | |
3198 | ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol)) | |
3199 | ||
3200 | struct symbol_block | |
2e471eb5 | 3201 | { |
d05b383a | 3202 | /* Place `symbols' first, to preserve alignment. */ |
2e471eb5 | 3203 | struct Lisp_Symbol symbols[SYMBOL_BLOCK_SIZE]; |
d05b383a | 3204 | struct symbol_block *next; |
2e471eb5 | 3205 | }; |
7146af97 | 3206 | |
34400008 GM |
3207 | /* Current symbol block and index of first unused Lisp_Symbol |
3208 | structure in it. */ | |
3209 | ||
7146af97 JB |
3210 | struct symbol_block *symbol_block; |
3211 | int symbol_block_index; | |
3212 | ||
34400008 GM |
3213 | /* List of free symbols. */ |
3214 | ||
7146af97 JB |
3215 | struct Lisp_Symbol *symbol_free_list; |
3216 | ||
c8099634 | 3217 | /* Total number of symbol blocks now in use. */ |
2e471eb5 | 3218 | |
c8099634 RS |
3219 | int n_symbol_blocks; |
3220 | ||
34400008 GM |
3221 | |
3222 | /* Initialize symbol allocation. */ | |
3223 | ||
7146af97 JB |
3224 | void |
3225 | init_symbol () | |
3226 | { | |
0930c1a1 SM |
3227 | symbol_block = NULL; |
3228 | symbol_block_index = SYMBOL_BLOCK_SIZE; | |
7146af97 | 3229 | symbol_free_list = 0; |
0930c1a1 | 3230 | n_symbol_blocks = 0; |
7146af97 JB |
3231 | } |
3232 | ||
34400008 | 3233 | |
7146af97 | 3234 | DEFUN ("make-symbol", Fmake_symbol, Smake_symbol, 1, 1, 0, |
a6266d23 | 3235 | doc: /* Return a newly allocated uninterned symbol whose name is NAME. |
7ee72033 MB |
3236 | Its value and function definition are void, and its property list is nil. */) |
3237 | (name) | |
54ee42dd | 3238 | Lisp_Object name; |
7146af97 JB |
3239 | { |
3240 | register Lisp_Object val; | |
3241 | register struct Lisp_Symbol *p; | |
3242 | ||
b7826503 | 3243 | CHECK_STRING (name); |
7146af97 | 3244 | |
537407f0 | 3245 | /* eassert (!handling_signal); */ |
cfb2f32e | 3246 | |
dafc79fa | 3247 | MALLOC_BLOCK_INPUT; |
e2984df0 | 3248 | |
7146af97 JB |
3249 | if (symbol_free_list) |
3250 | { | |
45d12a89 | 3251 | XSETSYMBOL (val, symbol_free_list); |
28a099a4 | 3252 | symbol_free_list = symbol_free_list->next; |
7146af97 JB |
3253 | } |
3254 | else | |
3255 | { | |
3256 | if (symbol_block_index == SYMBOL_BLOCK_SIZE) | |
3257 | { | |
3c06d205 | 3258 | struct symbol_block *new; |
34400008 GM |
3259 | new = (struct symbol_block *) lisp_malloc (sizeof *new, |
3260 | MEM_TYPE_SYMBOL); | |
7146af97 JB |
3261 | new->next = symbol_block; |
3262 | symbol_block = new; | |
3263 | symbol_block_index = 0; | |
c8099634 | 3264 | n_symbol_blocks++; |
7146af97 | 3265 | } |
a0668126 SM |
3266 | XSETSYMBOL (val, &symbol_block->symbols[symbol_block_index]); |
3267 | symbol_block_index++; | |
7146af97 | 3268 | } |
177c0ea7 | 3269 | |
dafc79fa | 3270 | MALLOC_UNBLOCK_INPUT; |
e2984df0 | 3271 | |
7146af97 | 3272 | p = XSYMBOL (val); |
8fe5665d | 3273 | p->xname = name; |
7146af97 | 3274 | p->plist = Qnil; |
2e471eb5 GM |
3275 | p->value = Qunbound; |
3276 | p->function = Qunbound; | |
9e713715 | 3277 | p->next = NULL; |
2336fe58 | 3278 | p->gcmarkbit = 0; |
9e713715 GM |
3279 | p->interned = SYMBOL_UNINTERNED; |
3280 | p->constant = 0; | |
3281 | p->indirect_variable = 0; | |
2e471eb5 GM |
3282 | consing_since_gc += sizeof (struct Lisp_Symbol); |
3283 | symbols_consed++; | |
7146af97 JB |
3284 | return val; |
3285 | } | |
3286 | ||
3f25e183 | 3287 | |
2e471eb5 GM |
3288 | \f |
3289 | /*********************************************************************** | |
34400008 | 3290 | Marker (Misc) Allocation |
2e471eb5 | 3291 | ***********************************************************************/ |
3f25e183 | 3292 | |
2e471eb5 GM |
3293 | /* Allocation of markers and other objects that share that structure. |
3294 | Works like allocation of conses. */ | |
c0696668 | 3295 | |
2e471eb5 GM |
3296 | #define MARKER_BLOCK_SIZE \ |
3297 | ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc)) | |
3298 | ||
3299 | struct marker_block | |
c0696668 | 3300 | { |
d05b383a | 3301 | /* Place `markers' first, to preserve alignment. */ |
2e471eb5 | 3302 | union Lisp_Misc markers[MARKER_BLOCK_SIZE]; |
d05b383a | 3303 | struct marker_block *next; |
2e471eb5 | 3304 | }; |
c0696668 | 3305 | |
2e471eb5 GM |
3306 | struct marker_block *marker_block; |
3307 | int marker_block_index; | |
c0696668 | 3308 | |
2e471eb5 | 3309 | union Lisp_Misc *marker_free_list; |
c0696668 | 3310 | |
2e471eb5 | 3311 | /* Total number of marker blocks now in use. */ |
3f25e183 | 3312 | |
2e471eb5 GM |
3313 | int n_marker_blocks; |
3314 | ||
3315 | void | |
3316 | init_marker () | |
3f25e183 | 3317 | { |
0930c1a1 SM |
3318 | marker_block = NULL; |
3319 | marker_block_index = MARKER_BLOCK_SIZE; | |
2e471eb5 | 3320 | marker_free_list = 0; |
0930c1a1 | 3321 | n_marker_blocks = 0; |
3f25e183 RS |
3322 | } |
3323 | ||
2e471eb5 GM |
3324 | /* Return a newly allocated Lisp_Misc object, with no substructure. */ |
3325 | ||
3f25e183 | 3326 | Lisp_Object |
2e471eb5 | 3327 | allocate_misc () |
7146af97 | 3328 | { |
2e471eb5 | 3329 | Lisp_Object val; |
7146af97 | 3330 | |
e2984df0 CY |
3331 | /* eassert (!handling_signal); */ |
3332 | ||
dafc79fa | 3333 | MALLOC_BLOCK_INPUT; |
cfb2f32e | 3334 | |
2e471eb5 | 3335 | if (marker_free_list) |
7146af97 | 3336 | { |
2e471eb5 GM |
3337 | XSETMISC (val, marker_free_list); |
3338 | marker_free_list = marker_free_list->u_free.chain; | |
7146af97 JB |
3339 | } |
3340 | else | |
7146af97 | 3341 | { |
2e471eb5 GM |
3342 | if (marker_block_index == MARKER_BLOCK_SIZE) |
3343 | { | |
3344 | struct marker_block *new; | |
34400008 GM |
3345 | new = (struct marker_block *) lisp_malloc (sizeof *new, |
3346 | MEM_TYPE_MISC); | |
2e471eb5 GM |
3347 | new->next = marker_block; |
3348 | marker_block = new; | |
3349 | marker_block_index = 0; | |
3350 | n_marker_blocks++; | |
7b7990cc | 3351 | total_free_markers += MARKER_BLOCK_SIZE; |
2e471eb5 | 3352 | } |
a0668126 SM |
3353 | XSETMISC (val, &marker_block->markers[marker_block_index]); |
3354 | marker_block_index++; | |
7146af97 | 3355 | } |
177c0ea7 | 3356 | |
dafc79fa | 3357 | MALLOC_UNBLOCK_INPUT; |
e2984df0 | 3358 | |
7b7990cc | 3359 | --total_free_markers; |
2e471eb5 GM |
3360 | consing_since_gc += sizeof (union Lisp_Misc); |
3361 | misc_objects_consed++; | |
2336fe58 | 3362 | XMARKER (val)->gcmarkbit = 0; |
2e471eb5 GM |
3363 | return val; |
3364 | } | |
3365 | ||
7b7990cc KS |
3366 | /* Free a Lisp_Misc object */ |
3367 | ||
3368 | void | |
3369 | free_misc (misc) | |
3370 | Lisp_Object misc; | |
3371 | { | |
3372 | XMISC (misc)->u_marker.type = Lisp_Misc_Free; | |
3373 | XMISC (misc)->u_free.chain = marker_free_list; | |
3374 | marker_free_list = XMISC (misc); | |
3375 | ||
3376 | total_free_markers++; | |
3377 | } | |
3378 | ||
42172a6b RS |
3379 | /* Return a Lisp_Misc_Save_Value object containing POINTER and |
3380 | INTEGER. This is used to package C values to call record_unwind_protect. | |
3381 | The unwind function can get the C values back using XSAVE_VALUE. */ | |
3382 | ||
3383 | Lisp_Object | |
3384 | make_save_value (pointer, integer) | |
3385 | void *pointer; | |
3386 | int integer; | |
3387 | { | |
3388 | register Lisp_Object val; | |
3389 | register struct Lisp_Save_Value *p; | |
3390 | ||
3391 | val = allocate_misc (); | |
3392 | XMISCTYPE (val) = Lisp_Misc_Save_Value; | |
3393 | p = XSAVE_VALUE (val); | |
3394 | p->pointer = pointer; | |
3395 | p->integer = integer; | |
b766f870 | 3396 | p->dogc = 0; |
42172a6b RS |
3397 | return val; |
3398 | } | |
3399 | ||
2e471eb5 | 3400 | DEFUN ("make-marker", Fmake_marker, Smake_marker, 0, 0, 0, |
a6266d23 | 3401 | doc: /* Return a newly allocated marker which does not point at any place. */) |
7ee72033 | 3402 | () |
2e471eb5 GM |
3403 | { |
3404 | register Lisp_Object val; | |
3405 | register struct Lisp_Marker *p; | |
7146af97 | 3406 | |
2e471eb5 GM |
3407 | val = allocate_misc (); |
3408 | XMISCTYPE (val) = Lisp_Misc_Marker; | |
3409 | p = XMARKER (val); | |
3410 | p->buffer = 0; | |
3411 | p->bytepos = 0; | |
3412 | p->charpos = 0; | |
ef89c2ce | 3413 | p->next = NULL; |
2e471eb5 | 3414 | p->insertion_type = 0; |
7146af97 JB |
3415 | return val; |
3416 | } | |
2e471eb5 GM |
3417 | |
3418 | /* Put MARKER back on the free list after using it temporarily. */ | |
3419 | ||
3420 | void | |
3421 | free_marker (marker) | |
3422 | Lisp_Object marker; | |
3423 | { | |
ef89c2ce | 3424 | unchain_marker (XMARKER (marker)); |
7b7990cc | 3425 | free_misc (marker); |
2e471eb5 GM |
3426 | } |
3427 | ||
c0696668 | 3428 | \f |
7146af97 | 3429 | /* Return a newly created vector or string with specified arguments as |
736471d1 RS |
3430 | elements. If all the arguments are characters that can fit |
3431 | in a string of events, make a string; otherwise, make a vector. | |
3432 | ||
3433 | Any number of arguments, even zero arguments, are allowed. */ | |
7146af97 JB |
3434 | |
3435 | Lisp_Object | |
736471d1 | 3436 | make_event_array (nargs, args) |
7146af97 JB |
3437 | register int nargs; |
3438 | Lisp_Object *args; | |
3439 | { | |
3440 | int i; | |
3441 | ||
3442 | for (i = 0; i < nargs; i++) | |
736471d1 | 3443 | /* The things that fit in a string |
c9ca4659 RS |
3444 | are characters that are in 0...127, |
3445 | after discarding the meta bit and all the bits above it. */ | |
e687453f | 3446 | if (!INTEGERP (args[i]) |
c9ca4659 | 3447 | || (XUINT (args[i]) & ~(-CHAR_META)) >= 0200) |
7146af97 JB |
3448 | return Fvector (nargs, args); |
3449 | ||
3450 | /* Since the loop exited, we know that all the things in it are | |
3451 | characters, so we can make a string. */ | |
3452 | { | |
c13ccad2 | 3453 | Lisp_Object result; |
177c0ea7 | 3454 | |
50aee051 | 3455 | result = Fmake_string (make_number (nargs), make_number (0)); |
7146af97 | 3456 | for (i = 0; i < nargs; i++) |
736471d1 | 3457 | { |
46e7e6b0 | 3458 | SSET (result, i, XINT (args[i])); |
736471d1 RS |
3459 | /* Move the meta bit to the right place for a string char. */ |
3460 | if (XINT (args[i]) & CHAR_META) | |
46e7e6b0 | 3461 | SSET (result, i, SREF (result, i) | 0x80); |
736471d1 | 3462 | } |
177c0ea7 | 3463 | |
7146af97 JB |
3464 | return result; |
3465 | } | |
3466 | } | |
2e471eb5 GM |
3467 | |
3468 | ||
7146af97 | 3469 | \f |
24d8a105 RS |
3470 | /************************************************************************ |
3471 | Memory Full Handling | |
3472 | ************************************************************************/ | |
3473 | ||
3474 | ||
3475 | /* Called if malloc returns zero. */ | |
3476 | ||
3477 | void | |
3478 | memory_full () | |
3479 | { | |
3480 | int i; | |
3481 | ||
3482 | Vmemory_full = Qt; | |
3483 | ||
3484 | memory_full_cons_threshold = sizeof (struct cons_block); | |
3485 | ||
3486 | /* The first time we get here, free the spare memory. */ | |
3487 | for (i = 0; i < sizeof (spare_memory) / sizeof (char *); i++) | |
3488 | if (spare_memory[i]) | |
3489 | { | |
3490 | if (i == 0) | |
3491 | free (spare_memory[i]); | |
3492 | else if (i >= 1 && i <= 4) | |
3493 | lisp_align_free (spare_memory[i]); | |
3494 | else | |
3495 | lisp_free (spare_memory[i]); | |
3496 | spare_memory[i] = 0; | |
3497 | } | |
3498 | ||
3499 | /* Record the space now used. When it decreases substantially, | |
3500 | we can refill the memory reserve. */ | |
3501 | #ifndef SYSTEM_MALLOC | |
3502 | bytes_used_when_full = BYTES_USED; | |
3503 | #endif | |
3504 | ||
3505 | /* This used to call error, but if we've run out of memory, we could | |
3506 | get infinite recursion trying to build the string. */ | |
9b306d37 | 3507 | xsignal (Qnil, Vmemory_signal_data); |
24d8a105 RS |
3508 | } |
3509 | ||
3510 | /* If we released our reserve (due to running out of memory), | |
3511 | and we have a fair amount free once again, | |
3512 | try to set aside another reserve in case we run out once more. | |
3513 | ||
3514 | This is called when a relocatable block is freed in ralloc.c, | |
3515 | and also directly from this file, in case we're not using ralloc.c. */ | |
3516 | ||
3517 | void | |
3518 | refill_memory_reserve () | |
3519 | { | |
3520 | #ifndef SYSTEM_MALLOC | |
3521 | if (spare_memory[0] == 0) | |
3522 | spare_memory[0] = (char *) malloc ((size_t) SPARE_MEMORY); | |
3523 | if (spare_memory[1] == 0) | |
3524 | spare_memory[1] = (char *) lisp_align_malloc (sizeof (struct cons_block), | |
3525 | MEM_TYPE_CONS); | |
3526 | if (spare_memory[2] == 0) | |
3527 | spare_memory[2] = (char *) lisp_align_malloc (sizeof (struct cons_block), | |
3528 | MEM_TYPE_CONS); | |
3529 | if (spare_memory[3] == 0) | |
3530 | spare_memory[3] = (char *) lisp_align_malloc (sizeof (struct cons_block), | |
3531 | MEM_TYPE_CONS); | |
3532 | if (spare_memory[4] == 0) | |
3533 | spare_memory[4] = (char *) lisp_align_malloc (sizeof (struct cons_block), | |
3534 | MEM_TYPE_CONS); | |
3535 | if (spare_memory[5] == 0) | |
3536 | spare_memory[5] = (char *) lisp_malloc (sizeof (struct string_block), | |
3537 | MEM_TYPE_STRING); | |
3538 | if (spare_memory[6] == 0) | |
3539 | spare_memory[6] = (char *) lisp_malloc (sizeof (struct string_block), | |
3540 | MEM_TYPE_STRING); | |
3541 | if (spare_memory[0] && spare_memory[1] && spare_memory[5]) | |
3542 | Vmemory_full = Qnil; | |
3543 | #endif | |
3544 | } | |
3545 | \f | |
34400008 GM |
3546 | /************************************************************************ |
3547 | C Stack Marking | |
3548 | ************************************************************************/ | |
3549 | ||
13c844fb GM |
3550 | #if GC_MARK_STACK || defined GC_MALLOC_CHECK |
3551 | ||
71cf5fa0 GM |
3552 | /* Conservative C stack marking requires a method to identify possibly |
3553 | live Lisp objects given a pointer value. We do this by keeping | |
3554 | track of blocks of Lisp data that are allocated in a red-black tree | |
3555 | (see also the comment of mem_node which is the type of nodes in | |
3556 | that tree). Function lisp_malloc adds information for an allocated | |
3557 | block to the red-black tree with calls to mem_insert, and function | |
3558 | lisp_free removes it with mem_delete. Functions live_string_p etc | |
3559 | call mem_find to lookup information about a given pointer in the | |
3560 | tree, and use that to determine if the pointer points to a Lisp | |
3561 | object or not. */ | |
3562 | ||
34400008 GM |
3563 | /* Initialize this part of alloc.c. */ |
3564 | ||
3565 | static void | |
3566 | mem_init () | |
3567 | { | |
3568 | mem_z.left = mem_z.right = MEM_NIL; | |
3569 | mem_z.parent = NULL; | |
3570 | mem_z.color = MEM_BLACK; | |
3571 | mem_z.start = mem_z.end = NULL; | |
3572 | mem_root = MEM_NIL; | |
3573 | } | |
3574 | ||
3575 | ||
3576 | /* Value is a pointer to the mem_node containing START. Value is | |
3577 | MEM_NIL if there is no node in the tree containing START. */ | |
3578 | ||
3579 | static INLINE struct mem_node * | |
3580 | mem_find (start) | |
3581 | void *start; | |
3582 | { | |
3583 | struct mem_node *p; | |
3584 | ||
ece93c02 GM |
3585 | if (start < min_heap_address || start > max_heap_address) |
3586 | return MEM_NIL; | |
3587 | ||
34400008 GM |
3588 | /* Make the search always successful to speed up the loop below. */ |
3589 | mem_z.start = start; | |
3590 | mem_z.end = (char *) start + 1; | |
3591 | ||
3592 | p = mem_root; | |
3593 | while (start < p->start || start >= p->end) | |
3594 | p = start < p->start ? p->left : p->right; | |
3595 | return p; | |
3596 | } | |
3597 | ||
3598 | ||
3599 | /* Insert a new node into the tree for a block of memory with start | |
3600 | address START, end address END, and type TYPE. Value is a | |
3601 | pointer to the node that was inserted. */ | |
3602 | ||
3603 | static struct mem_node * | |
3604 | mem_insert (start, end, type) | |
3605 | void *start, *end; | |
3606 | enum mem_type type; | |
3607 | { | |
3608 | struct mem_node *c, *parent, *x; | |
3609 | ||
add3c3ea | 3610 | if (min_heap_address == NULL || start < min_heap_address) |
ece93c02 | 3611 | min_heap_address = start; |
add3c3ea | 3612 | if (max_heap_address == NULL || end > max_heap_address) |
ece93c02 GM |
3613 | max_heap_address = end; |
3614 | ||
34400008 GM |
3615 | /* See where in the tree a node for START belongs. In this |
3616 | particular application, it shouldn't happen that a node is already | |
3617 | present. For debugging purposes, let's check that. */ | |
3618 | c = mem_root; | |
3619 | parent = NULL; | |
3620 | ||
3621 | #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS | |
177c0ea7 | 3622 | |
34400008 GM |
3623 | while (c != MEM_NIL) |
3624 | { | |
3625 | if (start >= c->start && start < c->end) | |
3626 | abort (); | |
3627 | parent = c; | |
3628 | c = start < c->start ? c->left : c->right; | |
3629 | } | |
177c0ea7 | 3630 | |
34400008 | 3631 | #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */ |
177c0ea7 | 3632 | |
34400008 GM |
3633 | while (c != MEM_NIL) |
3634 | { | |
3635 | parent = c; | |
3636 | c = start < c->start ? c->left : c->right; | |
3637 | } | |
177c0ea7 | 3638 | |
34400008 GM |
3639 | #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */ |
3640 | ||
3641 | /* Create a new node. */ | |
877935b1 GM |
3642 | #ifdef GC_MALLOC_CHECK |
3643 | x = (struct mem_node *) _malloc_internal (sizeof *x); | |
3644 | if (x == NULL) | |
3645 | abort (); | |
3646 | #else | |
34400008 | 3647 | x = (struct mem_node *) xmalloc (sizeof *x); |
877935b1 | 3648 | #endif |
34400008 GM |
3649 | x->start = start; |
3650 | x->end = end; | |
3651 | x->type = type; | |
3652 | x->parent = parent; | |
3653 | x->left = x->right = MEM_NIL; | |
3654 | x->color = MEM_RED; | |
3655 | ||
3656 | /* Insert it as child of PARENT or install it as root. */ | |
3657 | if (parent) | |
3658 | { | |
3659 | if (start < parent->start) | |
3660 | parent->left = x; | |
3661 | else | |
3662 | parent->right = x; | |
3663 | } | |
177c0ea7 | 3664 | else |
34400008 GM |
3665 | mem_root = x; |
3666 | ||
3667 | /* Re-establish red-black tree properties. */ | |
3668 | mem_insert_fixup (x); | |
877935b1 | 3669 | |
34400008 GM |
3670 | return x; |
3671 | } | |
3672 | ||
3673 | ||
3674 | /* Re-establish the red-black properties of the tree, and thereby | |
3675 | balance the tree, after node X has been inserted; X is always red. */ | |
3676 | ||
3677 | static void | |
3678 | mem_insert_fixup (x) | |
3679 | struct mem_node *x; | |
3680 | { | |
3681 | while (x != mem_root && x->parent->color == MEM_RED) | |
3682 | { | |
3683 | /* X is red and its parent is red. This is a violation of | |
3684 | red-black tree property #3. */ | |
177c0ea7 | 3685 | |
34400008 GM |
3686 | if (x->parent == x->parent->parent->left) |
3687 | { | |
3688 | /* We're on the left side of our grandparent, and Y is our | |
3689 | "uncle". */ | |
3690 | struct mem_node *y = x->parent->parent->right; | |
177c0ea7 | 3691 | |
34400008 GM |
3692 | if (y->color == MEM_RED) |
3693 | { | |
3694 | /* Uncle and parent are red but should be black because | |
3695 | X is red. Change the colors accordingly and proceed | |
3696 | with the grandparent. */ | |
3697 | x->parent->color = MEM_BLACK; | |
3698 | y->color = MEM_BLACK; | |
3699 | x->parent->parent->color = MEM_RED; | |
3700 | x = x->parent->parent; | |
3701 | } | |
3702 | else | |
3703 | { | |
3704 | /* Parent and uncle have different colors; parent is | |
3705 | red, uncle is black. */ | |
3706 | if (x == x->parent->right) | |
3707 | { | |
3708 | x = x->parent; | |
3709 | mem_rotate_left (x); | |
3710 | } | |
3711 | ||
3712 | x->parent->color = MEM_BLACK; | |
3713 | x->parent->parent->color = MEM_RED; | |
3714 | mem_rotate_right (x->parent->parent); | |
3715 | } | |
3716 | } | |
3717 | else | |
3718 | { | |
3719 | /* This is the symmetrical case of above. */ | |
3720 | struct mem_node *y = x->parent->parent->left; | |
177c0ea7 | 3721 | |
34400008 GM |
3722 | if (y->color == MEM_RED) |
3723 | { | |
3724 | x->parent->color = MEM_BLACK; | |
3725 | y->color = MEM_BLACK; | |
3726 | x->parent->parent->color = MEM_RED; | |
3727 | x = x->parent->parent; | |
3728 | } | |
3729 | else | |
3730 | { | |
3731 | if (x == x->parent->left) | |
3732 | { | |
3733 | x = x->parent; | |
3734 | mem_rotate_right (x); | |
3735 | } | |
177c0ea7 | 3736 | |
34400008 GM |
3737 | x->parent->color = MEM_BLACK; |
3738 | x->parent->parent->color = MEM_RED; | |
3739 | mem_rotate_left (x->parent->parent); | |
3740 | } | |
3741 | } | |
3742 | } | |
3743 | ||
3744 | /* The root may have been changed to red due to the algorithm. Set | |
3745 | it to black so that property #5 is satisfied. */ | |
3746 | mem_root->color = MEM_BLACK; | |
3747 | } | |
3748 | ||
3749 | ||
177c0ea7 JB |
3750 | /* (x) (y) |
3751 | / \ / \ | |
34400008 GM |
3752 | a (y) ===> (x) c |
3753 | / \ / \ | |
3754 | b c a b */ | |
3755 | ||
3756 | static void | |
3757 | mem_rotate_left (x) | |
3758 | struct mem_node *x; | |
3759 | { | |
3760 | struct mem_node *y; | |
3761 | ||
3762 | /* Turn y's left sub-tree into x's right sub-tree. */ | |
3763 | y = x->right; | |
3764 | x->right = y->left; | |
3765 | if (y->left != MEM_NIL) | |
3766 | y->left->parent = x; | |
3767 | ||
3768 | /* Y's parent was x's parent. */ | |
3769 | if (y != MEM_NIL) | |
3770 | y->parent = x->parent; | |
3771 | ||
3772 | /* Get the parent to point to y instead of x. */ | |
3773 | if (x->parent) | |
3774 | { | |
3775 | if (x == x->parent->left) | |
3776 | x->parent->left = y; | |
3777 | else | |
3778 | x->parent->right = y; | |
3779 | } | |
3780 | else | |
3781 | mem_root = y; | |
3782 | ||
3783 | /* Put x on y's left. */ | |
3784 | y->left = x; | |
3785 | if (x != MEM_NIL) | |
3786 | x->parent = y; | |
3787 | } | |
3788 | ||
3789 | ||
177c0ea7 JB |
3790 | /* (x) (Y) |
3791 | / \ / \ | |
3792 | (y) c ===> a (x) | |
3793 | / \ / \ | |
34400008 GM |
3794 | a b b c */ |
3795 | ||
3796 | static void | |
3797 | mem_rotate_right (x) | |
3798 | struct mem_node *x; | |
3799 | { | |
3800 | struct mem_node *y = x->left; | |
3801 | ||
3802 | x->left = y->right; | |
3803 | if (y->right != MEM_NIL) | |
3804 | y->right->parent = x; | |
177c0ea7 | 3805 | |
34400008 GM |
3806 | if (y != MEM_NIL) |
3807 | y->parent = x->parent; | |
3808 | if (x->parent) | |
3809 | { | |
3810 | if (x == x->parent->right) | |
3811 | x->parent->right = y; | |
3812 | else | |
3813 | x->parent->left = y; | |
3814 | } | |
3815 | else | |
3816 | mem_root = y; | |
177c0ea7 | 3817 | |
34400008 GM |
3818 | y->right = x; |
3819 | if (x != MEM_NIL) | |
3820 | x->parent = y; | |
3821 | } | |
3822 | ||
3823 | ||
3824 | /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */ | |
3825 | ||
3826 | static void | |
3827 | mem_delete (z) | |
3828 | struct mem_node *z; | |
3829 | { | |
3830 | struct mem_node *x, *y; | |
3831 | ||
3832 | if (!z || z == MEM_NIL) | |
3833 | return; | |
3834 | ||
3835 | if (z->left == MEM_NIL || z->right == MEM_NIL) | |
3836 | y = z; | |
3837 | else | |
3838 | { | |
3839 | y = z->right; | |
3840 | while (y->left != MEM_NIL) | |
3841 | y = y->left; | |
3842 | } | |
3843 | ||
3844 | if (y->left != MEM_NIL) | |
3845 | x = y->left; | |
3846 | else | |
3847 | x = y->right; | |
3848 | ||
3849 | x->parent = y->parent; | |
3850 | if (y->parent) | |
3851 | { | |
3852 | if (y == y->parent->left) | |
3853 | y->parent->left = x; | |
3854 | else | |
3855 | y->parent->right = x; | |
3856 | } | |
3857 | else | |
3858 | mem_root = x; | |
3859 | ||
3860 | if (y != z) | |
3861 | { | |
3862 | z->start = y->start; | |
3863 | z->end = y->end; | |
3864 | z->type = y->type; | |
3865 | } | |
177c0ea7 | 3866 | |
34400008 GM |
3867 | if (y->color == MEM_BLACK) |
3868 | mem_delete_fixup (x); | |
877935b1 GM |
3869 | |
3870 | #ifdef GC_MALLOC_CHECK | |
3871 | _free_internal (y); | |
3872 | #else | |
34400008 | 3873 | xfree (y); |
877935b1 | 3874 | #endif |
34400008 GM |
3875 | } |
3876 | ||
3877 | ||
3878 | /* Re-establish the red-black properties of the tree, after a | |
3879 | deletion. */ | |
3880 | ||
3881 | static void | |
3882 | mem_delete_fixup (x) | |
3883 | struct mem_node *x; | |
3884 | { | |
3885 | while (x != mem_root && x->color == MEM_BLACK) | |
3886 | { | |
3887 | if (x == x->parent->left) | |
3888 | { | |
3889 | struct mem_node *w = x->parent->right; | |
177c0ea7 | 3890 | |
34400008 GM |
3891 | if (w->color == MEM_RED) |
3892 | { | |
3893 | w->color = MEM_BLACK; | |
3894 | x->parent->color = MEM_RED; | |
3895 | mem_rotate_left (x->parent); | |
3896 | w = x->parent->right; | |
3897 | } | |
177c0ea7 | 3898 | |
34400008 GM |
3899 | if (w->left->color == MEM_BLACK && w->right->color == MEM_BLACK) |
3900 | { | |
3901 | w->color = MEM_RED; | |
3902 | x = x->parent; | |
3903 | } | |
3904 | else | |
3905 | { | |
3906 | if (w->right->color == MEM_BLACK) | |
3907 | { | |
3908 | w->left->color = MEM_BLACK; | |
3909 | w->color = MEM_RED; | |
3910 | mem_rotate_right (w); | |
3911 | w = x->parent->right; | |
3912 | } | |
3913 | w->color = x->parent->color; | |
3914 | x->parent->color = MEM_BLACK; | |
3915 | w->right->color = MEM_BLACK; | |
3916 | mem_rotate_left (x->parent); | |
3917 | x = mem_root; | |
3918 | } | |
3919 | } | |
3920 | else | |
3921 | { | |
3922 | struct mem_node *w = x->parent->left; | |
177c0ea7 | 3923 | |
34400008 GM |
3924 | if (w->color == MEM_RED) |
3925 | { | |
3926 | w->color = MEM_BLACK; | |
3927 | x->parent->color = MEM_RED; | |
3928 | mem_rotate_right (x->parent); | |
3929 | w = x->parent->left; | |
3930 | } | |
177c0ea7 | 3931 | |
34400008 GM |
3932 | if (w->right->color == MEM_BLACK && w->left->color == MEM_BLACK) |
3933 | { | |
3934 | w->color = MEM_RED; | |
3935 | x = x->parent; | |
3936 | } | |
3937 | else | |
3938 | { | |
3939 | if (w->left->color == MEM_BLACK) | |
3940 | { | |
3941 | w->right->color = MEM_BLACK; | |
3942 | w->color = MEM_RED; | |
3943 | mem_rotate_left (w); | |
3944 | w = x->parent->left; | |
3945 | } | |
177c0ea7 | 3946 | |
34400008 GM |
3947 | w->color = x->parent->color; |
3948 | x->parent->color = MEM_BLACK; | |
3949 | w->left->color = MEM_BLACK; | |
3950 | mem_rotate_right (x->parent); | |
3951 | x = mem_root; | |
3952 | } | |
3953 | } | |
3954 | } | |
177c0ea7 | 3955 | |
34400008 GM |
3956 | x->color = MEM_BLACK; |
3957 | } | |
3958 | ||
3959 | ||
3960 | /* Value is non-zero if P is a pointer to a live Lisp string on | |
3961 | the heap. M is a pointer to the mem_block for P. */ | |
3962 | ||
3963 | static INLINE int | |
3964 | live_string_p (m, p) | |
3965 | struct mem_node *m; | |
3966 | void *p; | |
3967 | { | |
3968 | if (m->type == MEM_TYPE_STRING) | |
3969 | { | |
3970 | struct string_block *b = (struct string_block *) m->start; | |
3971 | int offset = (char *) p - (char *) &b->strings[0]; | |
3972 | ||
3973 | /* P must point to the start of a Lisp_String structure, and it | |
3974 | must not be on the free-list. */ | |
176bc847 GM |
3975 | return (offset >= 0 |
3976 | && offset % sizeof b->strings[0] == 0 | |
d05b383a | 3977 | && offset < (STRING_BLOCK_SIZE * sizeof b->strings[0]) |
34400008 GM |
3978 | && ((struct Lisp_String *) p)->data != NULL); |
3979 | } | |
3980 | else | |
3981 | return 0; | |
3982 | } | |
3983 | ||
3984 | ||
3985 | /* Value is non-zero if P is a pointer to a live Lisp cons on | |
3986 | the heap. M is a pointer to the mem_block for P. */ | |
3987 | ||
3988 | static INLINE int | |
3989 | live_cons_p (m, p) | |
3990 | struct mem_node *m; | |
3991 | void *p; | |
3992 | { | |
3993 | if (m->type == MEM_TYPE_CONS) | |
3994 | { | |
3995 | struct cons_block *b = (struct cons_block *) m->start; | |
3996 | int offset = (char *) p - (char *) &b->conses[0]; | |
3997 | ||
3998 | /* P must point to the start of a Lisp_Cons, not be | |
3999 | one of the unused cells in the current cons block, | |
4000 | and not be on the free-list. */ | |
176bc847 GM |
4001 | return (offset >= 0 |
4002 | && offset % sizeof b->conses[0] == 0 | |
d05b383a | 4003 | && offset < (CONS_BLOCK_SIZE * sizeof b->conses[0]) |
34400008 GM |
4004 | && (b != cons_block |
4005 | || offset / sizeof b->conses[0] < cons_block_index) | |
4006 | && !EQ (((struct Lisp_Cons *) p)->car, Vdead)); | |
4007 | } | |
4008 | else | |
4009 | return 0; | |
4010 | } | |
4011 | ||
4012 | ||
4013 | /* Value is non-zero if P is a pointer to a live Lisp symbol on | |
4014 | the heap. M is a pointer to the mem_block for P. */ | |
4015 | ||
4016 | static INLINE int | |
4017 | live_symbol_p (m, p) | |
4018 | struct mem_node *m; | |
4019 | void *p; | |
4020 | { | |
4021 | if (m->type == MEM_TYPE_SYMBOL) | |
4022 | { | |
4023 | struct symbol_block *b = (struct symbol_block *) m->start; | |
4024 | int offset = (char *) p - (char *) &b->symbols[0]; | |
177c0ea7 | 4025 | |
34400008 GM |
4026 | /* P must point to the start of a Lisp_Symbol, not be |
4027 | one of the unused cells in the current symbol block, | |
4028 | and not be on the free-list. */ | |
176bc847 GM |
4029 | return (offset >= 0 |
4030 | && offset % sizeof b->symbols[0] == 0 | |
d05b383a | 4031 | && offset < (SYMBOL_BLOCK_SIZE * sizeof b->symbols[0]) |
34400008 GM |
4032 | && (b != symbol_block |
4033 | || offset / sizeof b->symbols[0] < symbol_block_index) | |
4034 | && !EQ (((struct Lisp_Symbol *) p)->function, Vdead)); | |
4035 | } | |
4036 | else | |
4037 | return 0; | |
4038 | } | |
4039 | ||
4040 | ||
4041 | /* Value is non-zero if P is a pointer to a live Lisp float on | |
4042 | the heap. M is a pointer to the mem_block for P. */ | |
4043 | ||
4044 | static INLINE int | |
4045 | live_float_p (m, p) | |
4046 | struct mem_node *m; | |
4047 | void *p; | |
4048 | { | |
4049 | if (m->type == MEM_TYPE_FLOAT) | |
4050 | { | |
4051 | struct float_block *b = (struct float_block *) m->start; | |
4052 | int offset = (char *) p - (char *) &b->floats[0]; | |
177c0ea7 | 4053 | |
ab6780cd SM |
4054 | /* P must point to the start of a Lisp_Float and not be |
4055 | one of the unused cells in the current float block. */ | |
176bc847 GM |
4056 | return (offset >= 0 |
4057 | && offset % sizeof b->floats[0] == 0 | |
d05b383a | 4058 | && offset < (FLOAT_BLOCK_SIZE * sizeof b->floats[0]) |
34400008 | 4059 | && (b != float_block |
ab6780cd | 4060 | || offset / sizeof b->floats[0] < float_block_index)); |
34400008 GM |
4061 | } |
4062 | else | |
4063 | return 0; | |
4064 | } | |
4065 | ||
4066 | ||
4067 | /* Value is non-zero if P is a pointer to a live Lisp Misc on | |
4068 | the heap. M is a pointer to the mem_block for P. */ | |
4069 | ||
4070 | static INLINE int | |
4071 | live_misc_p (m, p) | |
4072 | struct mem_node *m; | |
4073 | void *p; | |
4074 | { | |
4075 | if (m->type == MEM_TYPE_MISC) | |
4076 | { | |
4077 | struct marker_block *b = (struct marker_block *) m->start; | |
4078 | int offset = (char *) p - (char *) &b->markers[0]; | |
177c0ea7 | 4079 | |
34400008 GM |
4080 | /* P must point to the start of a Lisp_Misc, not be |
4081 | one of the unused cells in the current misc block, | |
4082 | and not be on the free-list. */ | |
176bc847 GM |
4083 | return (offset >= 0 |
4084 | && offset % sizeof b->markers[0] == 0 | |
d05b383a | 4085 | && offset < (MARKER_BLOCK_SIZE * sizeof b->markers[0]) |
34400008 GM |
4086 | && (b != marker_block |
4087 | || offset / sizeof b->markers[0] < marker_block_index) | |
4088 | && ((union Lisp_Misc *) p)->u_marker.type != Lisp_Misc_Free); | |
4089 | } | |
4090 | else | |
4091 | return 0; | |
4092 | } | |
4093 | ||
4094 | ||
4095 | /* Value is non-zero if P is a pointer to a live vector-like object. | |
4096 | M is a pointer to the mem_block for P. */ | |
4097 | ||
4098 | static INLINE int | |
4099 | live_vector_p (m, p) | |
4100 | struct mem_node *m; | |
4101 | void *p; | |
4102 | { | |
9c545a55 | 4103 | return (p == m->start && m->type == MEM_TYPE_VECTORLIKE); |
34400008 GM |
4104 | } |
4105 | ||
4106 | ||
2336fe58 | 4107 | /* Value is non-zero if P is a pointer to a live buffer. M is a |
34400008 GM |
4108 | pointer to the mem_block for P. */ |
4109 | ||
4110 | static INLINE int | |
4111 | live_buffer_p (m, p) | |
4112 | struct mem_node *m; | |
4113 | void *p; | |
4114 | { | |
4115 | /* P must point to the start of the block, and the buffer | |
4116 | must not have been killed. */ | |
4117 | return (m->type == MEM_TYPE_BUFFER | |
4118 | && p == m->start | |
4119 | && !NILP (((struct buffer *) p)->name)); | |
4120 | } | |
4121 | ||
13c844fb GM |
4122 | #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */ |
4123 | ||
4124 | #if GC_MARK_STACK | |
4125 | ||
34400008 GM |
4126 | #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES |
4127 | ||
4128 | /* Array of objects that are kept alive because the C stack contains | |
4129 | a pattern that looks like a reference to them . */ | |
4130 | ||
4131 | #define MAX_ZOMBIES 10 | |
4132 | static Lisp_Object zombies[MAX_ZOMBIES]; | |
4133 | ||
4134 | /* Number of zombie objects. */ | |
4135 | ||
4136 | static int nzombies; | |
4137 | ||
4138 | /* Number of garbage collections. */ | |
4139 | ||
4140 | static int ngcs; | |
4141 | ||
4142 | /* Average percentage of zombies per collection. */ | |
4143 | ||
4144 | static double avg_zombies; | |
4145 | ||
4146 | /* Max. number of live and zombie objects. */ | |
4147 | ||
4148 | static int max_live, max_zombies; | |
4149 | ||
4150 | /* Average number of live objects per GC. */ | |
4151 | ||
4152 | static double avg_live; | |
4153 | ||
4154 | DEFUN ("gc-status", Fgc_status, Sgc_status, 0, 0, "", | |
7ee72033 MB |
4155 | doc: /* Show information about live and zombie objects. */) |
4156 | () | |
34400008 | 4157 | { |
83fc9c63 DL |
4158 | Lisp_Object args[8], zombie_list = Qnil; |
4159 | int i; | |
4160 | for (i = 0; i < nzombies; i++) | |
4161 | zombie_list = Fcons (zombies[i], zombie_list); | |
4162 | args[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S"); | |
34400008 GM |
4163 | args[1] = make_number (ngcs); |
4164 | args[2] = make_float (avg_live); | |
4165 | args[3] = make_float (avg_zombies); | |
4166 | args[4] = make_float (avg_zombies / avg_live / 100); | |
4167 | args[5] = make_number (max_live); | |
4168 | args[6] = make_number (max_zombies); | |
83fc9c63 DL |
4169 | args[7] = zombie_list; |
4170 | return Fmessage (8, args); | |
34400008 GM |
4171 | } |
4172 | ||
4173 | #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */ | |
4174 | ||
4175 | ||
182ff242 GM |
4176 | /* Mark OBJ if we can prove it's a Lisp_Object. */ |
4177 | ||
4178 | static INLINE void | |
4179 | mark_maybe_object (obj) | |
4180 | Lisp_Object obj; | |
4181 | { | |
4182 | void *po = (void *) XPNTR (obj); | |
4183 | struct mem_node *m = mem_find (po); | |
177c0ea7 | 4184 | |
182ff242 GM |
4185 | if (m != MEM_NIL) |
4186 | { | |
4187 | int mark_p = 0; | |
4188 | ||
4189 | switch (XGCTYPE (obj)) | |
4190 | { | |
4191 | case Lisp_String: | |
4192 | mark_p = (live_string_p (m, po) | |
4193 | && !STRING_MARKED_P ((struct Lisp_String *) po)); | |
4194 | break; | |
4195 | ||
4196 | case Lisp_Cons: | |
08b7c2cb | 4197 | mark_p = (live_cons_p (m, po) && !CONS_MARKED_P (XCONS (obj))); |
182ff242 GM |
4198 | break; |
4199 | ||
4200 | case Lisp_Symbol: | |
2336fe58 | 4201 | mark_p = (live_symbol_p (m, po) && !XSYMBOL (obj)->gcmarkbit); |
182ff242 GM |
4202 | break; |
4203 | ||
4204 | case Lisp_Float: | |
ab6780cd | 4205 | mark_p = (live_float_p (m, po) && !FLOAT_MARKED_P (XFLOAT (obj))); |
182ff242 GM |
4206 | break; |
4207 | ||
4208 | case Lisp_Vectorlike: | |
4209 | /* Note: can't check GC_BUFFERP before we know it's a | |
4210 | buffer because checking that dereferences the pointer | |
4211 | PO which might point anywhere. */ | |
4212 | if (live_vector_p (m, po)) | |
3ef06d12 | 4213 | mark_p = !GC_SUBRP (obj) && !VECTOR_MARKED_P (XVECTOR (obj)); |
182ff242 | 4214 | else if (live_buffer_p (m, po)) |
3ef06d12 | 4215 | mark_p = GC_BUFFERP (obj) && !VECTOR_MARKED_P (XBUFFER (obj)); |
182ff242 GM |
4216 | break; |
4217 | ||
4218 | case Lisp_Misc: | |
2336fe58 | 4219 | mark_p = (live_misc_p (m, po) && !XMARKER (obj)->gcmarkbit); |
182ff242 | 4220 | break; |
6bbd7a29 GM |
4221 | |
4222 | case Lisp_Int: | |
31d929e5 | 4223 | case Lisp_Type_Limit: |
6bbd7a29 | 4224 | break; |
182ff242 GM |
4225 | } |
4226 | ||
4227 | if (mark_p) | |
4228 | { | |
4229 | #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES | |
4230 | if (nzombies < MAX_ZOMBIES) | |
83fc9c63 | 4231 | zombies[nzombies] = obj; |
182ff242 GM |
4232 | ++nzombies; |
4233 | #endif | |
49723c04 | 4234 | mark_object (obj); |
182ff242 GM |
4235 | } |
4236 | } | |
4237 | } | |
ece93c02 GM |
4238 | |
4239 | ||
4240 | /* If P points to Lisp data, mark that as live if it isn't already | |
4241 | marked. */ | |
4242 | ||
4243 | static INLINE void | |
4244 | mark_maybe_pointer (p) | |
4245 | void *p; | |
4246 | { | |
4247 | struct mem_node *m; | |
4248 | ||
5045e68e SM |
4249 | /* Quickly rule out some values which can't point to Lisp data. */ |
4250 | if ((EMACS_INT) p % | |
4251 | #ifdef USE_LSB_TAG | |
4252 | 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */ | |
4253 | #else | |
4254 | 2 /* We assume that Lisp data is aligned on even addresses. */ | |
4255 | #endif | |
4256 | ) | |
ece93c02 | 4257 | return; |
177c0ea7 | 4258 | |
ece93c02 GM |
4259 | m = mem_find (p); |
4260 | if (m != MEM_NIL) | |
4261 | { | |
4262 | Lisp_Object obj = Qnil; | |
177c0ea7 | 4263 | |
ece93c02 GM |
4264 | switch (m->type) |
4265 | { | |
4266 | case MEM_TYPE_NON_LISP: | |
2fe50224 | 4267 | /* Nothing to do; not a pointer to Lisp memory. */ |
ece93c02 | 4268 | break; |
177c0ea7 | 4269 | |
ece93c02 | 4270 | case MEM_TYPE_BUFFER: |
3ef06d12 | 4271 | if (live_buffer_p (m, p) && !VECTOR_MARKED_P((struct buffer *)p)) |
ece93c02 GM |
4272 | XSETVECTOR (obj, p); |
4273 | break; | |
177c0ea7 | 4274 | |
ece93c02 | 4275 | case MEM_TYPE_CONS: |
08b7c2cb | 4276 | if (live_cons_p (m, p) && !CONS_MARKED_P ((struct Lisp_Cons *) p)) |
ece93c02 GM |
4277 | XSETCONS (obj, p); |
4278 | break; | |
177c0ea7 | 4279 | |
ece93c02 GM |
4280 | case MEM_TYPE_STRING: |
4281 | if (live_string_p (m, p) | |
4282 | && !STRING_MARKED_P ((struct Lisp_String *) p)) | |
4283 | XSETSTRING (obj, p); | |
4284 | break; | |
4285 | ||
4286 | case MEM_TYPE_MISC: | |
2336fe58 SM |
4287 | if (live_misc_p (m, p) && !((struct Lisp_Free *) p)->gcmarkbit) |
4288 | XSETMISC (obj, p); | |
ece93c02 | 4289 | break; |
177c0ea7 | 4290 | |
ece93c02 | 4291 | case MEM_TYPE_SYMBOL: |
2336fe58 | 4292 | if (live_symbol_p (m, p) && !((struct Lisp_Symbol *) p)->gcmarkbit) |
ece93c02 GM |
4293 | XSETSYMBOL (obj, p); |
4294 | break; | |
177c0ea7 | 4295 | |
ece93c02 | 4296 | case MEM_TYPE_FLOAT: |
ab6780cd | 4297 | if (live_float_p (m, p) && !FLOAT_MARKED_P (p)) |
ece93c02 GM |
4298 | XSETFLOAT (obj, p); |
4299 | break; | |
177c0ea7 | 4300 | |
9c545a55 | 4301 | case MEM_TYPE_VECTORLIKE: |
ece93c02 GM |
4302 | if (live_vector_p (m, p)) |
4303 | { | |
4304 | Lisp_Object tem; | |
4305 | XSETVECTOR (tem, p); | |
3ef06d12 | 4306 | if (!GC_SUBRP (tem) && !VECTOR_MARKED_P (XVECTOR (tem))) |
ece93c02 GM |
4307 | obj = tem; |
4308 | } | |
4309 | break; | |
4310 | ||
4311 | default: | |
4312 | abort (); | |
4313 | } | |
4314 | ||
4315 | if (!GC_NILP (obj)) | |
49723c04 | 4316 | mark_object (obj); |
ece93c02 GM |
4317 | } |
4318 | } | |
4319 | ||
4320 | ||
55a314a5 YM |
4321 | /* Mark Lisp objects referenced from the address range START+OFFSET..END |
4322 | or END+OFFSET..START. */ | |
34400008 | 4323 | |
177c0ea7 | 4324 | static void |
55a314a5 | 4325 | mark_memory (start, end, offset) |
34400008 | 4326 | void *start, *end; |
55a314a5 | 4327 | int offset; |
34400008 GM |
4328 | { |
4329 | Lisp_Object *p; | |
ece93c02 | 4330 | void **pp; |
34400008 GM |
4331 | |
4332 | #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES | |
4333 | nzombies = 0; | |
4334 | #endif | |
4335 | ||
4336 | /* Make START the pointer to the start of the memory region, | |
4337 | if it isn't already. */ | |
4338 | if (end < start) | |
4339 | { | |
4340 | void *tem = start; | |
4341 | start = end; | |
4342 | end = tem; | |
4343 | } | |
ece93c02 GM |
4344 | |
4345 | /* Mark Lisp_Objects. */ | |
55a314a5 | 4346 | for (p = (Lisp_Object *) ((char *) start + offset); (void *) p < end; ++p) |
182ff242 | 4347 | mark_maybe_object (*p); |
ece93c02 GM |
4348 | |
4349 | /* Mark Lisp data pointed to. This is necessary because, in some | |
4350 | situations, the C compiler optimizes Lisp objects away, so that | |
4351 | only a pointer to them remains. Example: | |
4352 | ||
4353 | DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "") | |
7ee72033 | 4354 | () |
ece93c02 GM |
4355 | { |
4356 | Lisp_Object obj = build_string ("test"); | |
4357 | struct Lisp_String *s = XSTRING (obj); | |
4358 | Fgarbage_collect (); | |
4359 | fprintf (stderr, "test `%s'\n", s->data); | |
4360 | return Qnil; | |
4361 | } | |
4362 | ||
4363 | Here, `obj' isn't really used, and the compiler optimizes it | |
4364 | away. The only reference to the life string is through the | |
4365 | pointer `s'. */ | |
177c0ea7 | 4366 | |
55a314a5 | 4367 | for (pp = (void **) ((char *) start + offset); (void *) pp < end; ++pp) |
ece93c02 | 4368 | mark_maybe_pointer (*pp); |
182ff242 GM |
4369 | } |
4370 | ||
30f637f8 DL |
4371 | /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in |
4372 | the GCC system configuration. In gcc 3.2, the only systems for | |
4373 | which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included | |
4374 | by others?) and ns32k-pc532-min. */ | |
182ff242 GM |
4375 | |
4376 | #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS | |
4377 | ||
4378 | static int setjmp_tested_p, longjmps_done; | |
4379 | ||
4380 | #define SETJMP_WILL_LIKELY_WORK "\ | |
4381 | \n\ | |
4382 | Emacs garbage collector has been changed to use conservative stack\n\ | |
4383 | marking. Emacs has determined that the method it uses to do the\n\ | |
4384 | marking will likely work on your system, but this isn't sure.\n\ | |
4385 | \n\ | |
4386 | If you are a system-programmer, or can get the help of a local wizard\n\ | |
4387 | who is, please take a look at the function mark_stack in alloc.c, and\n\ | |
4388 | verify that the methods used are appropriate for your system.\n\ | |
4389 | \n\ | |
d191623b | 4390 | Please mail the result to <emacs-devel@gnu.org>.\n\ |
182ff242 GM |
4391 | " |
4392 | ||
4393 | #define SETJMP_WILL_NOT_WORK "\ | |
4394 | \n\ | |
4395 | Emacs garbage collector has been changed to use conservative stack\n\ | |
4396 | marking. Emacs has determined that the default method it uses to do the\n\ | |
4397 | marking will not work on your system. We will need a system-dependent\n\ | |
4398 | solution for your system.\n\ | |
4399 | \n\ | |
4400 | Please take a look at the function mark_stack in alloc.c, and\n\ | |
4401 | try to find a way to make it work on your system.\n\ | |
30f637f8 DL |
4402 | \n\ |
4403 | Note that you may get false negatives, depending on the compiler.\n\ | |
4404 | In particular, you need to use -O with GCC for this test.\n\ | |
4405 | \n\ | |
d191623b | 4406 | Please mail the result to <emacs-devel@gnu.org>.\n\ |
182ff242 GM |
4407 | " |
4408 | ||
4409 | ||
4410 | /* Perform a quick check if it looks like setjmp saves registers in a | |
4411 | jmp_buf. Print a message to stderr saying so. When this test | |
4412 | succeeds, this is _not_ a proof that setjmp is sufficient for | |
4413 | conservative stack marking. Only the sources or a disassembly | |
4414 | can prove that. */ | |
4415 | ||
4416 | static void | |
4417 | test_setjmp () | |
4418 | { | |
4419 | char buf[10]; | |
4420 | register int x; | |
4421 | jmp_buf jbuf; | |
4422 | int result = 0; | |
4423 | ||
4424 | /* Arrange for X to be put in a register. */ | |
4425 | sprintf (buf, "1"); | |
4426 | x = strlen (buf); | |
4427 | x = 2 * x - 1; | |
4428 | ||
4429 | setjmp (jbuf); | |
4430 | if (longjmps_done == 1) | |
34400008 | 4431 | { |
182ff242 | 4432 | /* Came here after the longjmp at the end of the function. |
34400008 | 4433 | |
182ff242 GM |
4434 | If x == 1, the longjmp has restored the register to its |
4435 | value before the setjmp, and we can hope that setjmp | |
4436 | saves all such registers in the jmp_buf, although that | |
4437 | isn't sure. | |
34400008 | 4438 | |
182ff242 GM |
4439 | For other values of X, either something really strange is |
4440 | taking place, or the setjmp just didn't save the register. */ | |
4441 | ||
4442 | if (x == 1) | |
4443 | fprintf (stderr, SETJMP_WILL_LIKELY_WORK); | |
4444 | else | |
4445 | { | |
4446 | fprintf (stderr, SETJMP_WILL_NOT_WORK); | |
4447 | exit (1); | |
34400008 GM |
4448 | } |
4449 | } | |
182ff242 GM |
4450 | |
4451 | ++longjmps_done; | |
4452 | x = 2; | |
4453 | if (longjmps_done == 1) | |
4454 | longjmp (jbuf, 1); | |
34400008 GM |
4455 | } |
4456 | ||
182ff242 GM |
4457 | #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */ |
4458 | ||
34400008 GM |
4459 | |
4460 | #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS | |
4461 | ||
4462 | /* Abort if anything GCPRO'd doesn't survive the GC. */ | |
4463 | ||
4464 | static void | |
4465 | check_gcpros () | |
4466 | { | |
4467 | struct gcpro *p; | |
4468 | int i; | |
4469 | ||
4470 | for (p = gcprolist; p; p = p->next) | |
4471 | for (i = 0; i < p->nvars; ++i) | |
4472 | if (!survives_gc_p (p->var[i])) | |
92cc28b2 SM |
4473 | /* FIXME: It's not necessarily a bug. It might just be that the |
4474 | GCPRO is unnecessary or should release the object sooner. */ | |
34400008 GM |
4475 | abort (); |
4476 | } | |
4477 | ||
4478 | #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES | |
4479 | ||
4480 | static void | |
4481 | dump_zombies () | |
4482 | { | |
4483 | int i; | |
4484 | ||
4485 | fprintf (stderr, "\nZombies kept alive = %d:\n", nzombies); | |
4486 | for (i = 0; i < min (MAX_ZOMBIES, nzombies); ++i) | |
4487 | { | |
4488 | fprintf (stderr, " %d = ", i); | |
4489 | debug_print (zombies[i]); | |
4490 | } | |
4491 | } | |
4492 | ||
4493 | #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */ | |
4494 | ||
4495 | ||
182ff242 GM |
4496 | /* Mark live Lisp objects on the C stack. |
4497 | ||
4498 | There are several system-dependent problems to consider when | |
4499 | porting this to new architectures: | |
4500 | ||
4501 | Processor Registers | |
4502 | ||
4503 | We have to mark Lisp objects in CPU registers that can hold local | |
4504 | variables or are used to pass parameters. | |
4505 | ||
4506 | If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to | |
4507 | something that either saves relevant registers on the stack, or | |
4508 | calls mark_maybe_object passing it each register's contents. | |
4509 | ||
4510 | If GC_SAVE_REGISTERS_ON_STACK is not defined, the current | |
4511 | implementation assumes that calling setjmp saves registers we need | |
4512 | to see in a jmp_buf which itself lies on the stack. This doesn't | |
4513 | have to be true! It must be verified for each system, possibly | |
4514 | by taking a look at the source code of setjmp. | |
4515 | ||
4516 | Stack Layout | |
4517 | ||
4518 | Architectures differ in the way their processor stack is organized. | |
4519 | For example, the stack might look like this | |
4520 | ||
4521 | +----------------+ | |
4522 | | Lisp_Object | size = 4 | |
4523 | +----------------+ | |
4524 | | something else | size = 2 | |
4525 | +----------------+ | |
4526 | | Lisp_Object | size = 4 | |
4527 | +----------------+ | |
4528 | | ... | | |
4529 | ||
4530 | In such a case, not every Lisp_Object will be aligned equally. To | |
4531 | find all Lisp_Object on the stack it won't be sufficient to walk | |
4532 | the stack in steps of 4 bytes. Instead, two passes will be | |
4533 | necessary, one starting at the start of the stack, and a second | |
4534 | pass starting at the start of the stack + 2. Likewise, if the | |
4535 | minimal alignment of Lisp_Objects on the stack is 1, four passes | |
4536 | would be necessary, each one starting with one byte more offset | |
4537 | from the stack start. | |
4538 | ||
4539 | The current code assumes by default that Lisp_Objects are aligned | |
4540 | equally on the stack. */ | |
34400008 GM |
4541 | |
4542 | static void | |
4543 | mark_stack () | |
4544 | { | |
630909a5 | 4545 | int i; |
55a314a5 YM |
4546 | /* jmp_buf may not be aligned enough on darwin-ppc64 */ |
4547 | union aligned_jmpbuf { | |
4548 | Lisp_Object o; | |
4549 | jmp_buf j; | |
4550 | } j; | |
6bbd7a29 | 4551 | volatile int stack_grows_down_p = (char *) &j > (char *) stack_base; |
34400008 GM |
4552 | void *end; |
4553 | ||
4554 | /* This trick flushes the register windows so that all the state of | |
4555 | the process is contained in the stack. */ | |
ab6780cd | 4556 | /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is |
422eec7e DL |
4557 | needed on ia64 too. See mach_dep.c, where it also says inline |
4558 | assembler doesn't work with relevant proprietary compilers. */ | |
34400008 GM |
4559 | #ifdef sparc |
4560 | asm ("ta 3"); | |
4561 | #endif | |
177c0ea7 | 4562 | |
34400008 GM |
4563 | /* Save registers that we need to see on the stack. We need to see |
4564 | registers used to hold register variables and registers used to | |
4565 | pass parameters. */ | |
4566 | #ifdef GC_SAVE_REGISTERS_ON_STACK | |
4567 | GC_SAVE_REGISTERS_ON_STACK (end); | |
182ff242 | 4568 | #else /* not GC_SAVE_REGISTERS_ON_STACK */ |
177c0ea7 | 4569 | |
182ff242 GM |
4570 | #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that |
4571 | setjmp will definitely work, test it | |
4572 | and print a message with the result | |
4573 | of the test. */ | |
4574 | if (!setjmp_tested_p) | |
4575 | { | |
4576 | setjmp_tested_p = 1; | |
4577 | test_setjmp (); | |
4578 | } | |
4579 | #endif /* GC_SETJMP_WORKS */ | |
177c0ea7 | 4580 | |
55a314a5 | 4581 | setjmp (j.j); |
34400008 | 4582 | end = stack_grows_down_p ? (char *) &j + sizeof j : (char *) &j; |
182ff242 | 4583 | #endif /* not GC_SAVE_REGISTERS_ON_STACK */ |
34400008 GM |
4584 | |
4585 | /* This assumes that the stack is a contiguous region in memory. If | |
182ff242 GM |
4586 | that's not the case, something has to be done here to iterate |
4587 | over the stack segments. */ | |
630909a5 | 4588 | #ifndef GC_LISP_OBJECT_ALIGNMENT |
422eec7e DL |
4589 | #ifdef __GNUC__ |
4590 | #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object) | |
4591 | #else | |
630909a5 | 4592 | #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object) |
422eec7e | 4593 | #endif |
182ff242 | 4594 | #endif |
24452cd5 | 4595 | for (i = 0; i < sizeof (Lisp_Object); i += GC_LISP_OBJECT_ALIGNMENT) |
55a314a5 | 4596 | mark_memory (stack_base, end, i); |
4dec23ff AS |
4597 | /* Allow for marking a secondary stack, like the register stack on the |
4598 | ia64. */ | |
4599 | #ifdef GC_MARK_SECONDARY_STACK | |
4600 | GC_MARK_SECONDARY_STACK (); | |
4601 | #endif | |
34400008 GM |
4602 | |
4603 | #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS | |
4604 | check_gcpros (); | |
4605 | #endif | |
4606 | } | |
4607 | ||
34400008 GM |
4608 | #endif /* GC_MARK_STACK != 0 */ |
4609 | ||
4610 | ||
7ffb6955 | 4611 | /* Determine whether it is safe to access memory at address P. */ |
69b9efaa RS |
4612 | int |
4613 | valid_pointer_p (p) | |
7ffb6955 KS |
4614 | void *p; |
4615 | { | |
f892cf9c EZ |
4616 | #ifdef WINDOWSNT |
4617 | return w32_valid_pointer_p (p, 16); | |
4618 | #else | |
7ffb6955 KS |
4619 | int fd; |
4620 | ||
4621 | /* Obviously, we cannot just access it (we would SEGV trying), so we | |
4622 | trick the o/s to tell us whether p is a valid pointer. | |
4623 | Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may | |
4624 | not validate p in that case. */ | |
4625 | ||
4626 | if ((fd = emacs_open ("__Valid__Lisp__Object__", O_CREAT | O_WRONLY | O_TRUNC, 0666)) >= 0) | |
4627 | { | |
4628 | int valid = (emacs_write (fd, (char *)p, 16) == 16); | |
4629 | emacs_close (fd); | |
4630 | unlink ("__Valid__Lisp__Object__"); | |
4631 | return valid; | |
4632 | } | |
4633 | ||
4634 | return -1; | |
f892cf9c | 4635 | #endif |
7ffb6955 | 4636 | } |
3cd55735 KS |
4637 | |
4638 | /* Return 1 if OBJ is a valid lisp object. | |
4639 | Return 0 if OBJ is NOT a valid lisp object. | |
4640 | Return -1 if we cannot validate OBJ. | |
7c0ab7d9 RS |
4641 | This function can be quite slow, |
4642 | so it should only be used in code for manual debugging. */ | |
3cd55735 KS |
4643 | |
4644 | int | |
4645 | valid_lisp_object_p (obj) | |
4646 | Lisp_Object obj; | |
4647 | { | |
de7124a7 | 4648 | void *p; |
7ffb6955 | 4649 | #if GC_MARK_STACK |
3cd55735 | 4650 | struct mem_node *m; |
de7124a7 | 4651 | #endif |
3cd55735 KS |
4652 | |
4653 | if (INTEGERP (obj)) | |
4654 | return 1; | |
4655 | ||
4656 | p = (void *) XPNTR (obj); | |
3cd55735 KS |
4657 | if (PURE_POINTER_P (p)) |
4658 | return 1; | |
4659 | ||
de7124a7 | 4660 | #if !GC_MARK_STACK |
7ffb6955 | 4661 | return valid_pointer_p (p); |
de7124a7 KS |
4662 | #else |
4663 | ||
3cd55735 KS |
4664 | m = mem_find (p); |
4665 | ||
4666 | if (m == MEM_NIL) | |
7ffb6955 KS |
4667 | { |
4668 | int valid = valid_pointer_p (p); | |
4669 | if (valid <= 0) | |
4670 | return valid; | |
4671 | ||
4672 | if (SUBRP (obj)) | |
4673 | return 1; | |
4674 | ||
4675 | return 0; | |
4676 | } | |
3cd55735 KS |
4677 | |
4678 | switch (m->type) | |
4679 | { | |
4680 | case MEM_TYPE_NON_LISP: | |
4681 | return 0; | |
4682 | ||
4683 | case MEM_TYPE_BUFFER: | |
4684 | return live_buffer_p (m, p); | |
4685 | ||
4686 | case MEM_TYPE_CONS: | |
4687 | return live_cons_p (m, p); | |
4688 | ||
4689 | case MEM_TYPE_STRING: | |
4690 | return live_string_p (m, p); | |
4691 | ||
4692 | case MEM_TYPE_MISC: | |
4693 | return live_misc_p (m, p); | |
4694 | ||
4695 | case MEM_TYPE_SYMBOL: | |
4696 | return live_symbol_p (m, p); | |
4697 | ||
4698 | case MEM_TYPE_FLOAT: | |
4699 | return live_float_p (m, p); | |
4700 | ||
9c545a55 | 4701 | case MEM_TYPE_VECTORLIKE: |
3cd55735 KS |
4702 | return live_vector_p (m, p); |
4703 | ||
4704 | default: | |
4705 | break; | |
4706 | } | |
4707 | ||
4708 | return 0; | |
4709 | #endif | |
4710 | } | |
4711 | ||
4712 | ||
4713 | ||
34400008 | 4714 | \f |
2e471eb5 GM |
4715 | /*********************************************************************** |
4716 | Pure Storage Management | |
4717 | ***********************************************************************/ | |
4718 | ||
1f0b3fd2 GM |
4719 | /* Allocate room for SIZE bytes from pure Lisp storage and return a |
4720 | pointer to it. TYPE is the Lisp type for which the memory is | |
e5bc14d4 | 4721 | allocated. TYPE < 0 means it's not used for a Lisp object. */ |
1f0b3fd2 GM |
4722 | |
4723 | static POINTER_TYPE * | |
4724 | pure_alloc (size, type) | |
4725 | size_t size; | |
4726 | int type; | |
4727 | { | |
1f0b3fd2 | 4728 | POINTER_TYPE *result; |
831b476c SM |
4729 | #ifdef USE_LSB_TAG |
4730 | size_t alignment = (1 << GCTYPEBITS); | |
4731 | #else | |
44117420 | 4732 | size_t alignment = sizeof (EMACS_INT); |
1f0b3fd2 GM |
4733 | |
4734 | /* Give Lisp_Floats an extra alignment. */ | |
4735 | if (type == Lisp_Float) | |
4736 | { | |
1f0b3fd2 GM |
4737 | #if defined __GNUC__ && __GNUC__ >= 2 |
4738 | alignment = __alignof (struct Lisp_Float); | |
4739 | #else | |
4740 | alignment = sizeof (struct Lisp_Float); | |
4741 | #endif | |
9e713715 | 4742 | } |
831b476c | 4743 | #endif |
1f0b3fd2 | 4744 | |
44117420 | 4745 | again: |
e5bc14d4 YM |
4746 | if (type >= 0) |
4747 | { | |
4748 | /* Allocate space for a Lisp object from the beginning of the free | |
4749 | space with taking account of alignment. */ | |
4750 | result = ALIGN (purebeg + pure_bytes_used_lisp, alignment); | |
4751 | pure_bytes_used_lisp = ((char *)result - (char *)purebeg) + size; | |
4752 | } | |
4753 | else | |
4754 | { | |
4755 | /* Allocate space for a non-Lisp object from the end of the free | |
4756 | space. */ | |
4757 | pure_bytes_used_non_lisp += size; | |
4758 | result = purebeg + pure_size - pure_bytes_used_non_lisp; | |
4759 | } | |
4760 | pure_bytes_used = pure_bytes_used_lisp + pure_bytes_used_non_lisp; | |
44117420 KS |
4761 | |
4762 | if (pure_bytes_used <= pure_size) | |
4763 | return result; | |
4764 | ||
4765 | /* Don't allocate a large amount here, | |
4766 | because it might get mmap'd and then its address | |
4767 | might not be usable. */ | |
4768 | purebeg = (char *) xmalloc (10000); | |
4769 | pure_size = 10000; | |
4770 | pure_bytes_used_before_overflow += pure_bytes_used - size; | |
4771 | pure_bytes_used = 0; | |
e5bc14d4 | 4772 | pure_bytes_used_lisp = pure_bytes_used_non_lisp = 0; |
44117420 | 4773 | goto again; |
1f0b3fd2 GM |
4774 | } |
4775 | ||
4776 | ||
852f8cdc | 4777 | /* Print a warning if PURESIZE is too small. */ |
9e713715 GM |
4778 | |
4779 | void | |
4780 | check_pure_size () | |
4781 | { | |
4782 | if (pure_bytes_used_before_overflow) | |
2aee5ca3 | 4783 | message ("emacs:0:Pure Lisp storage overflow (approx. %d bytes needed)", |
a4d35afd | 4784 | (int) (pure_bytes_used + pure_bytes_used_before_overflow)); |
9e713715 GM |
4785 | } |
4786 | ||
4787 | ||
79fd0489 YM |
4788 | /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from |
4789 | the non-Lisp data pool of the pure storage, and return its start | |
4790 | address. Return NULL if not found. */ | |
4791 | ||
4792 | static char * | |
4793 | find_string_data_in_pure (data, nbytes) | |
4794 | char *data; | |
4795 | int nbytes; | |
4796 | { | |
4797 | int i, skip, bm_skip[256], last_char_skip, infinity, start, start_max; | |
4798 | unsigned char *p; | |
4799 | char *non_lisp_beg; | |
4800 | ||
4801 | if (pure_bytes_used_non_lisp < nbytes + 1) | |
4802 | return NULL; | |
4803 | ||
4804 | /* Set up the Boyer-Moore table. */ | |
4805 | skip = nbytes + 1; | |
4806 | for (i = 0; i < 256; i++) | |
4807 | bm_skip[i] = skip; | |
4808 | ||
4809 | p = (unsigned char *) data; | |
4810 | while (--skip > 0) | |
4811 | bm_skip[*p++] = skip; | |
4812 | ||
4813 | last_char_skip = bm_skip['\0']; | |
4814 | ||
4815 | non_lisp_beg = purebeg + pure_size - pure_bytes_used_non_lisp; | |
4816 | start_max = pure_bytes_used_non_lisp - (nbytes + 1); | |
4817 | ||
4818 | /* See the comments in the function `boyer_moore' (search.c) for the | |
4819 | use of `infinity'. */ | |
4820 | infinity = pure_bytes_used_non_lisp + 1; | |
4821 | bm_skip['\0'] = infinity; | |
4822 | ||
4823 | p = (unsigned char *) non_lisp_beg + nbytes; | |
4824 | start = 0; | |
4825 | do | |
4826 | { | |
4827 | /* Check the last character (== '\0'). */ | |
4828 | do | |
4829 | { | |
4830 | start += bm_skip[*(p + start)]; | |
4831 | } | |
4832 | while (start <= start_max); | |
4833 | ||
4834 | if (start < infinity) | |
4835 | /* Couldn't find the last character. */ | |
4836 | return NULL; | |
4837 | ||
4838 | /* No less than `infinity' means we could find the last | |
4839 | character at `p[start - infinity]'. */ | |
4840 | start -= infinity; | |
4841 | ||
4842 | /* Check the remaining characters. */ | |
4843 | if (memcmp (data, non_lisp_beg + start, nbytes) == 0) | |
4844 | /* Found. */ | |
4845 | return non_lisp_beg + start; | |
4846 | ||
4847 | start += last_char_skip; | |
4848 | } | |
4849 | while (start <= start_max); | |
4850 | ||
4851 | return NULL; | |
4852 | } | |
4853 | ||
4854 | ||
2e471eb5 GM |
4855 | /* Return a string allocated in pure space. DATA is a buffer holding |
4856 | NCHARS characters, and NBYTES bytes of string data. MULTIBYTE | |
4857 | non-zero means make the result string multibyte. | |
1a4f1e2c | 4858 | |
2e471eb5 GM |
4859 | Must get an error if pure storage is full, since if it cannot hold |
4860 | a large string it may be able to hold conses that point to that | |
4861 | string; then the string is not protected from gc. */ | |
7146af97 JB |
4862 | |
4863 | Lisp_Object | |
2e471eb5 | 4864 | make_pure_string (data, nchars, nbytes, multibyte) |
7146af97 | 4865 | char *data; |
2e471eb5 | 4866 | int nchars, nbytes; |
c0696668 | 4867 | int multibyte; |
7146af97 | 4868 | { |
2e471eb5 GM |
4869 | Lisp_Object string; |
4870 | struct Lisp_String *s; | |
c0696668 | 4871 | |
1f0b3fd2 | 4872 | s = (struct Lisp_String *) pure_alloc (sizeof *s, Lisp_String); |
79fd0489 YM |
4873 | s->data = find_string_data_in_pure (data, nbytes); |
4874 | if (s->data == NULL) | |
4875 | { | |
4876 | s->data = (unsigned char *) pure_alloc (nbytes + 1, -1); | |
4877 | bcopy (data, s->data, nbytes); | |
4878 | s->data[nbytes] = '\0'; | |
4879 | } | |
2e471eb5 GM |
4880 | s->size = nchars; |
4881 | s->size_byte = multibyte ? nbytes : -1; | |
2e471eb5 | 4882 | s->intervals = NULL_INTERVAL; |
2e471eb5 GM |
4883 | XSETSTRING (string, s); |
4884 | return string; | |
7146af97 JB |
4885 | } |
4886 | ||
2e471eb5 | 4887 | |
34400008 GM |
4888 | /* Return a cons allocated from pure space. Give it pure copies |
4889 | of CAR as car and CDR as cdr. */ | |
4890 | ||
7146af97 JB |
4891 | Lisp_Object |
4892 | pure_cons (car, cdr) | |
4893 | Lisp_Object car, cdr; | |
4894 | { | |
4895 | register Lisp_Object new; | |
1f0b3fd2 | 4896 | struct Lisp_Cons *p; |
7146af97 | 4897 | |
1f0b3fd2 GM |
4898 | p = (struct Lisp_Cons *) pure_alloc (sizeof *p, Lisp_Cons); |
4899 | XSETCONS (new, p); | |
f3fbd155 KR |
4900 | XSETCAR (new, Fpurecopy (car)); |
4901 | XSETCDR (new, Fpurecopy (cdr)); | |
7146af97 JB |
4902 | return new; |
4903 | } | |
4904 | ||
7146af97 | 4905 | |
34400008 GM |
4906 | /* Value is a float object with value NUM allocated from pure space. */ |
4907 | ||
7146af97 JB |
4908 | Lisp_Object |
4909 | make_pure_float (num) | |
4910 | double num; | |
4911 | { | |
4912 | register Lisp_Object new; | |
1f0b3fd2 | 4913 | struct Lisp_Float *p; |
7146af97 | 4914 | |
1f0b3fd2 GM |
4915 | p = (struct Lisp_Float *) pure_alloc (sizeof *p, Lisp_Float); |
4916 | XSETFLOAT (new, p); | |
70949dac | 4917 | XFLOAT_DATA (new) = num; |
7146af97 JB |
4918 | return new; |
4919 | } | |
4920 | ||
34400008 GM |
4921 | |
4922 | /* Return a vector with room for LEN Lisp_Objects allocated from | |
4923 | pure space. */ | |
4924 | ||
7146af97 JB |
4925 | Lisp_Object |
4926 | make_pure_vector (len) | |
42607681 | 4927 | EMACS_INT len; |
7146af97 | 4928 | { |
1f0b3fd2 GM |
4929 | Lisp_Object new; |
4930 | struct Lisp_Vector *p; | |
4931 | size_t size = sizeof *p + (len - 1) * sizeof (Lisp_Object); | |
7146af97 | 4932 | |
1f0b3fd2 GM |
4933 | p = (struct Lisp_Vector *) pure_alloc (size, Lisp_Vectorlike); |
4934 | XSETVECTOR (new, p); | |
7146af97 JB |
4935 | XVECTOR (new)->size = len; |
4936 | return new; | |
4937 | } | |
4938 | ||
34400008 | 4939 | |
7146af97 | 4940 | DEFUN ("purecopy", Fpurecopy, Spurecopy, 1, 1, 0, |
909e3b33 | 4941 | doc: /* Make a copy of object OBJ in pure storage. |
228299fa | 4942 | Recursively copies contents of vectors and cons cells. |
7ee72033 MB |
4943 | Does not copy symbols. Copies strings without text properties. */) |
4944 | (obj) | |
7146af97 JB |
4945 | register Lisp_Object obj; |
4946 | { | |
265a9e55 | 4947 | if (NILP (Vpurify_flag)) |
7146af97 JB |
4948 | return obj; |
4949 | ||
1f0b3fd2 | 4950 | if (PURE_POINTER_P (XPNTR (obj))) |
7146af97 JB |
4951 | return obj; |
4952 | ||
d6dd74bb | 4953 | if (CONSP (obj)) |
70949dac | 4954 | return pure_cons (XCAR (obj), XCDR (obj)); |
d6dd74bb | 4955 | else if (FLOATP (obj)) |
70949dac | 4956 | return make_pure_float (XFLOAT_DATA (obj)); |
d6dd74bb | 4957 | else if (STRINGP (obj)) |
d5db4077 KR |
4958 | return make_pure_string (SDATA (obj), SCHARS (obj), |
4959 | SBYTES (obj), | |
c0696668 | 4960 | STRING_MULTIBYTE (obj)); |
d6dd74bb KH |
4961 | else if (COMPILEDP (obj) || VECTORP (obj)) |
4962 | { | |
4963 | register struct Lisp_Vector *vec; | |
41b867ea AS |
4964 | register int i; |
4965 | EMACS_INT size; | |
d6dd74bb KH |
4966 | |
4967 | size = XVECTOR (obj)->size; | |
7d535c68 KH |
4968 | if (size & PSEUDOVECTOR_FLAG) |
4969 | size &= PSEUDOVECTOR_SIZE_MASK; | |
41b867ea | 4970 | vec = XVECTOR (make_pure_vector (size)); |
d6dd74bb KH |
4971 | for (i = 0; i < size; i++) |
4972 | vec->contents[i] = Fpurecopy (XVECTOR (obj)->contents[i]); | |
4973 | if (COMPILEDP (obj)) | |
4974 | XSETCOMPILED (obj, vec); | |
4975 | else | |
4976 | XSETVECTOR (obj, vec); | |
7146af97 JB |
4977 | return obj; |
4978 | } | |
d6dd74bb KH |
4979 | else if (MARKERP (obj)) |
4980 | error ("Attempt to copy a marker to pure storage"); | |
6bbd7a29 GM |
4981 | |
4982 | return obj; | |
7146af97 | 4983 | } |
2e471eb5 | 4984 | |
34400008 | 4985 | |
7146af97 | 4986 | \f |
34400008 GM |
4987 | /*********************************************************************** |
4988 | Protection from GC | |
4989 | ***********************************************************************/ | |
4990 | ||
2e471eb5 GM |
4991 | /* Put an entry in staticvec, pointing at the variable with address |
4992 | VARADDRESS. */ | |
7146af97 JB |
4993 | |
4994 | void | |
4995 | staticpro (varaddress) | |
4996 | Lisp_Object *varaddress; | |
4997 | { | |
4998 | staticvec[staticidx++] = varaddress; | |
4999 | if (staticidx >= NSTATICS) | |
5000 | abort (); | |
5001 | } | |
5002 | ||
5003 | struct catchtag | |
2e471eb5 | 5004 | { |
7146af97 JB |
5005 | Lisp_Object tag; |
5006 | Lisp_Object val; | |
5007 | struct catchtag *next; | |
2e471eb5 | 5008 | }; |
7146af97 | 5009 | |
7146af97 | 5010 | \f |
34400008 GM |
5011 | /*********************************************************************** |
5012 | Protection from GC | |
5013 | ***********************************************************************/ | |
1a4f1e2c | 5014 | |
e8197642 RS |
5015 | /* Temporarily prevent garbage collection. */ |
5016 | ||
5017 | int | |
5018 | inhibit_garbage_collection () | |
5019 | { | |
aed13378 | 5020 | int count = SPECPDL_INDEX (); |
54defd0d AS |
5021 | int nbits = min (VALBITS, BITS_PER_INT); |
5022 | ||
5023 | specbind (Qgc_cons_threshold, make_number (((EMACS_INT) 1 << (nbits - 1)) - 1)); | |
e8197642 RS |
5024 | return count; |
5025 | } | |
5026 | ||
34400008 | 5027 | |
7146af97 | 5028 | DEFUN ("garbage-collect", Fgarbage_collect, Sgarbage_collect, 0, 0, "", |
7ee72033 | 5029 | doc: /* Reclaim storage for Lisp objects no longer needed. |
e1e37596 RS |
5030 | Garbage collection happens automatically if you cons more than |
5031 | `gc-cons-threshold' bytes of Lisp data since previous garbage collection. | |
5032 | `garbage-collect' normally returns a list with info on amount of space in use: | |
228299fa GM |
5033 | ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS) |
5034 | (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS | |
5035 | (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS) | |
5036 | (USED-STRINGS . FREE-STRINGS)) | |
e1e37596 RS |
5037 | However, if there was overflow in pure space, `garbage-collect' |
5038 | returns nil, because real GC can't be done. */) | |
7ee72033 | 5039 | () |
7146af97 | 5040 | { |
7146af97 JB |
5041 | register struct specbinding *bind; |
5042 | struct catchtag *catch; | |
5043 | struct handler *handler; | |
7146af97 JB |
5044 | char stack_top_variable; |
5045 | register int i; | |
6efc7df7 | 5046 | int message_p; |
96117bc7 | 5047 | Lisp_Object total[8]; |
331379bf | 5048 | int count = SPECPDL_INDEX (); |
2c5bd608 DL |
5049 | EMACS_TIME t1, t2, t3; |
5050 | ||
3de0effb RS |
5051 | if (abort_on_gc) |
5052 | abort (); | |
5053 | ||
9e713715 GM |
5054 | /* Can't GC if pure storage overflowed because we can't determine |
5055 | if something is a pure object or not. */ | |
5056 | if (pure_bytes_used_before_overflow) | |
5057 | return Qnil; | |
5058 | ||
bbc012e0 KS |
5059 | CHECK_CONS_LIST (); |
5060 | ||
3c7e66a8 RS |
5061 | /* Don't keep undo information around forever. |
5062 | Do this early on, so it is no problem if the user quits. */ | |
5063 | { | |
5064 | register struct buffer *nextb = all_buffers; | |
5065 | ||
5066 | while (nextb) | |
5067 | { | |
5068 | /* If a buffer's undo list is Qt, that means that undo is | |
5069 | turned off in that buffer. Calling truncate_undo_list on | |
5070 | Qt tends to return NULL, which effectively turns undo back on. | |
5071 | So don't call truncate_undo_list if undo_list is Qt. */ | |
303b0412 | 5072 | if (! NILP (nextb->name) && ! EQ (nextb->undo_list, Qt)) |
3c7e66a8 RS |
5073 | truncate_undo_list (nextb); |
5074 | ||
5075 | /* Shrink buffer gaps, but skip indirect and dead buffers. */ | |
5076 | if (nextb->base_buffer == 0 && !NILP (nextb->name)) | |
5077 | { | |
5078 | /* If a buffer's gap size is more than 10% of the buffer | |
5079 | size, or larger than 2000 bytes, then shrink it | |
5080 | accordingly. Keep a minimum size of 20 bytes. */ | |
5081 | int size = min (2000, max (20, (nextb->text->z_byte / 10))); | |
5082 | ||
5083 | if (nextb->text->gap_size > size) | |
5084 | { | |
5085 | struct buffer *save_current = current_buffer; | |
5086 | current_buffer = nextb; | |
5087 | make_gap (-(nextb->text->gap_size - size)); | |
5088 | current_buffer = save_current; | |
5089 | } | |
5090 | } | |
5091 | ||
5092 | nextb = nextb->next; | |
5093 | } | |
5094 | } | |
5095 | ||
5096 | EMACS_GET_TIME (t1); | |
5097 | ||
58595309 KH |
5098 | /* In case user calls debug_print during GC, |
5099 | don't let that cause a recursive GC. */ | |
5100 | consing_since_gc = 0; | |
5101 | ||
6efc7df7 GM |
5102 | /* Save what's currently displayed in the echo area. */ |
5103 | message_p = push_message (); | |
c55b0da6 | 5104 | record_unwind_protect (pop_message_unwind, Qnil); |
41c28a37 | 5105 | |
7146af97 JB |
5106 | /* Save a copy of the contents of the stack, for debugging. */ |
5107 | #if MAX_SAVE_STACK > 0 | |
265a9e55 | 5108 | if (NILP (Vpurify_flag)) |
7146af97 JB |
5109 | { |
5110 | i = &stack_top_variable - stack_bottom; | |
5111 | if (i < 0) i = -i; | |
5112 | if (i < MAX_SAVE_STACK) | |
5113 | { | |
5114 | if (stack_copy == 0) | |
9ac0d9e0 | 5115 | stack_copy = (char *) xmalloc (stack_copy_size = i); |
7146af97 | 5116 | else if (stack_copy_size < i) |
9ac0d9e0 | 5117 | stack_copy = (char *) xrealloc (stack_copy, (stack_copy_size = i)); |
7146af97 JB |
5118 | if (stack_copy) |
5119 | { | |
42607681 | 5120 | if ((EMACS_INT) (&stack_top_variable - stack_bottom) > 0) |
7146af97 JB |
5121 | bcopy (stack_bottom, stack_copy, i); |
5122 | else | |
5123 | bcopy (&stack_top_variable, stack_copy, i); | |
5124 | } | |
5125 | } | |
5126 | } | |
5127 | #endif /* MAX_SAVE_STACK > 0 */ | |
5128 | ||
299585ee | 5129 | if (garbage_collection_messages) |
691c4285 | 5130 | message1_nolog ("Garbage collecting..."); |
7146af97 | 5131 | |
6e0fca1d RS |
5132 | BLOCK_INPUT; |
5133 | ||
eec7b73d RS |
5134 | shrink_regexp_cache (); |
5135 | ||
7146af97 JB |
5136 | gc_in_progress = 1; |
5137 | ||
c23baf9f | 5138 | /* clear_marks (); */ |
7146af97 | 5139 | |
0930c1a1 | 5140 | /* Mark all the special slots that serve as the roots of accessibility. */ |
7146af97 JB |
5141 | |
5142 | for (i = 0; i < staticidx; i++) | |
49723c04 | 5143 | mark_object (*staticvec[i]); |
34400008 | 5144 | |
126f9c02 SM |
5145 | for (bind = specpdl; bind != specpdl_ptr; bind++) |
5146 | { | |
5147 | mark_object (bind->symbol); | |
5148 | mark_object (bind->old_value); | |
5149 | } | |
6ed8eeff | 5150 | mark_terminals (); |
126f9c02 | 5151 | mark_kboards (); |
98a92e2d | 5152 | mark_ttys (); |
126f9c02 SM |
5153 | |
5154 | #ifdef USE_GTK | |
5155 | { | |
5156 | extern void xg_mark_data (); | |
5157 | xg_mark_data (); | |
5158 | } | |
5159 | #endif | |
5160 | ||
34400008 GM |
5161 | #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \ |
5162 | || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS) | |
5163 | mark_stack (); | |
5164 | #else | |
acf5f7d3 SM |
5165 | { |
5166 | register struct gcpro *tail; | |
5167 | for (tail = gcprolist; tail; tail = tail->next) | |
5168 | for (i = 0; i < tail->nvars; i++) | |
0930c1a1 | 5169 | mark_object (tail->var[i]); |
acf5f7d3 | 5170 | } |
34400008 | 5171 | #endif |
177c0ea7 | 5172 | |
630686c8 | 5173 | mark_byte_stack (); |
7146af97 JB |
5174 | for (catch = catchlist; catch; catch = catch->next) |
5175 | { | |
49723c04 SM |
5176 | mark_object (catch->tag); |
5177 | mark_object (catch->val); | |
177c0ea7 | 5178 | } |
7146af97 JB |
5179 | for (handler = handlerlist; handler; handler = handler->next) |
5180 | { | |
49723c04 SM |
5181 | mark_object (handler->handler); |
5182 | mark_object (handler->var); | |
177c0ea7 | 5183 | } |
b40ea20a | 5184 | mark_backtrace (); |
7146af97 | 5185 | |
454d7973 KS |
5186 | #ifdef HAVE_WINDOW_SYSTEM |
5187 | mark_fringe_data (); | |
5188 | #endif | |
5189 | ||
74c35a48 SM |
5190 | #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES |
5191 | mark_stack (); | |
5192 | #endif | |
5193 | ||
c37adf23 SM |
5194 | /* Everything is now marked, except for the things that require special |
5195 | finalization, i.e. the undo_list. | |
5196 | Look thru every buffer's undo list | |
5197 | for elements that update markers that were not marked, | |
5198 | and delete them. */ | |
4c315bda RS |
5199 | { |
5200 | register struct buffer *nextb = all_buffers; | |
5201 | ||
5202 | while (nextb) | |
5203 | { | |
5204 | /* If a buffer's undo list is Qt, that means that undo is | |
c37adf23 SM |
5205 | turned off in that buffer. Calling truncate_undo_list on |
5206 | Qt tends to return NULL, which effectively turns undo back on. | |
5207 | So don't call truncate_undo_list if undo_list is Qt. */ | |
4c315bda RS |
5208 | if (! EQ (nextb->undo_list, Qt)) |
5209 | { | |
c37adf23 | 5210 | Lisp_Object tail, prev; |
4c315bda RS |
5211 | tail = nextb->undo_list; |
5212 | prev = Qnil; | |
5213 | while (CONSP (tail)) | |
5214 | { | |
c37adf23 SM |
5215 | if (GC_CONSP (XCAR (tail)) |
5216 | && GC_MARKERP (XCAR (XCAR (tail))) | |
5217 | && !XMARKER (XCAR (XCAR (tail)))->gcmarkbit) | |
4c315bda RS |
5218 | { |
5219 | if (NILP (prev)) | |
c37adf23 | 5220 | nextb->undo_list = tail = XCDR (tail); |
4c315bda | 5221 | else |
f3fbd155 | 5222 | { |
c37adf23 | 5223 | tail = XCDR (tail); |
f3fbd155 KR |
5224 | XSETCDR (prev, tail); |
5225 | } | |
4c315bda RS |
5226 | } |
5227 | else | |
5228 | { | |
5229 | prev = tail; | |
70949dac | 5230 | tail = XCDR (tail); |
4c315bda RS |
5231 | } |
5232 | } | |
5233 | } | |
c37adf23 SM |
5234 | /* Now that we have stripped the elements that need not be in the |
5235 | undo_list any more, we can finally mark the list. */ | |
5236 | mark_object (nextb->undo_list); | |
4c315bda RS |
5237 | |
5238 | nextb = nextb->next; | |
5239 | } | |
5240 | } | |
5241 | ||
c37adf23 | 5242 | gc_sweep (); |
6b67a518 | 5243 | |
7146af97 JB |
5244 | /* Clear the mark bits that we set in certain root slots. */ |
5245 | ||
033a5fa3 | 5246 | unmark_byte_stack (); |
3ef06d12 SM |
5247 | VECTOR_UNMARK (&buffer_defaults); |
5248 | VECTOR_UNMARK (&buffer_local_symbols); | |
7146af97 | 5249 | |
34400008 GM |
5250 | #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0 |
5251 | dump_zombies (); | |
5252 | #endif | |
5253 | ||
6e0fca1d RS |
5254 | UNBLOCK_INPUT; |
5255 | ||
bbc012e0 KS |
5256 | CHECK_CONS_LIST (); |
5257 | ||
c23baf9f | 5258 | /* clear_marks (); */ |
7146af97 JB |
5259 | gc_in_progress = 0; |
5260 | ||
5261 | consing_since_gc = 0; | |
5262 | if (gc_cons_threshold < 10000) | |
5263 | gc_cons_threshold = 10000; | |
5264 | ||
96f077ad SM |
5265 | if (FLOATP (Vgc_cons_percentage)) |
5266 | { /* Set gc_cons_combined_threshold. */ | |
5267 | EMACS_INT total = 0; | |
974aae61 | 5268 | |
96f077ad SM |
5269 | total += total_conses * sizeof (struct Lisp_Cons); |
5270 | total += total_symbols * sizeof (struct Lisp_Symbol); | |
5271 | total += total_markers * sizeof (union Lisp_Misc); | |
5272 | total += total_string_size; | |
5273 | total += total_vector_size * sizeof (Lisp_Object); | |
5274 | total += total_floats * sizeof (struct Lisp_Float); | |
5275 | total += total_intervals * sizeof (struct interval); | |
5276 | total += total_strings * sizeof (struct Lisp_String); | |
3cd55735 | 5277 | |
974aae61 | 5278 | gc_relative_threshold = total * XFLOAT_DATA (Vgc_cons_percentage); |
96f077ad | 5279 | } |
974aae61 RS |
5280 | else |
5281 | gc_relative_threshold = 0; | |
96f077ad | 5282 | |
299585ee RS |
5283 | if (garbage_collection_messages) |
5284 | { | |
6efc7df7 GM |
5285 | if (message_p || minibuf_level > 0) |
5286 | restore_message (); | |
299585ee RS |
5287 | else |
5288 | message1_nolog ("Garbage collecting...done"); | |
5289 | } | |
7146af97 | 5290 | |
98edb5ff | 5291 | unbind_to (count, Qnil); |
2e471eb5 GM |
5292 | |
5293 | total[0] = Fcons (make_number (total_conses), | |
5294 | make_number (total_free_conses)); | |
5295 | total[1] = Fcons (make_number (total_symbols), | |
5296 | make_number (total_free_symbols)); | |
5297 | total[2] = Fcons (make_number (total_markers), | |
5298 | make_number (total_free_markers)); | |
96117bc7 GM |
5299 | total[3] = make_number (total_string_size); |
5300 | total[4] = make_number (total_vector_size); | |
5301 | total[5] = Fcons (make_number (total_floats), | |
2e471eb5 | 5302 | make_number (total_free_floats)); |
96117bc7 | 5303 | total[6] = Fcons (make_number (total_intervals), |
2e471eb5 | 5304 | make_number (total_free_intervals)); |
96117bc7 | 5305 | total[7] = Fcons (make_number (total_strings), |
2e471eb5 GM |
5306 | make_number (total_free_strings)); |
5307 | ||
34400008 | 5308 | #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES |
7146af97 | 5309 | { |
34400008 GM |
5310 | /* Compute average percentage of zombies. */ |
5311 | double nlive = 0; | |
177c0ea7 | 5312 | |
34400008 | 5313 | for (i = 0; i < 7; ++i) |
83fc9c63 DL |
5314 | if (CONSP (total[i])) |
5315 | nlive += XFASTINT (XCAR (total[i])); | |
34400008 GM |
5316 | |
5317 | avg_live = (avg_live * ngcs + nlive) / (ngcs + 1); | |
5318 | max_live = max (nlive, max_live); | |
5319 | avg_zombies = (avg_zombies * ngcs + nzombies) / (ngcs + 1); | |
5320 | max_zombies = max (nzombies, max_zombies); | |
5321 | ++ngcs; | |
5322 | } | |
5323 | #endif | |
7146af97 | 5324 | |
9e713715 GM |
5325 | if (!NILP (Vpost_gc_hook)) |
5326 | { | |
5327 | int count = inhibit_garbage_collection (); | |
5328 | safe_run_hooks (Qpost_gc_hook); | |
5329 | unbind_to (count, Qnil); | |
5330 | } | |
2c5bd608 DL |
5331 | |
5332 | /* Accumulate statistics. */ | |
5333 | EMACS_GET_TIME (t2); | |
5334 | EMACS_SUB_TIME (t3, t2, t1); | |
5335 | if (FLOATP (Vgc_elapsed)) | |
69ab9f85 SM |
5336 | Vgc_elapsed = make_float (XFLOAT_DATA (Vgc_elapsed) + |
5337 | EMACS_SECS (t3) + | |
5338 | EMACS_USECS (t3) * 1.0e-6); | |
2c5bd608 DL |
5339 | gcs_done++; |
5340 | ||
96117bc7 | 5341 | return Flist (sizeof total / sizeof *total, total); |
7146af97 | 5342 | } |
34400008 | 5343 | |
41c28a37 | 5344 | |
3770920e GM |
5345 | /* Mark Lisp objects in glyph matrix MATRIX. Currently the |
5346 | only interesting objects referenced from glyphs are strings. */ | |
41c28a37 GM |
5347 | |
5348 | static void | |
5349 | mark_glyph_matrix (matrix) | |
5350 | struct glyph_matrix *matrix; | |
5351 | { | |
5352 | struct glyph_row *row = matrix->rows; | |
5353 | struct glyph_row *end = row + matrix->nrows; | |
5354 | ||
2e471eb5 GM |
5355 | for (; row < end; ++row) |
5356 | if (row->enabled_p) | |
5357 | { | |
5358 | int area; | |
5359 | for (area = LEFT_MARGIN_AREA; area < LAST_AREA; ++area) | |
5360 | { | |
5361 | struct glyph *glyph = row->glyphs[area]; | |
5362 | struct glyph *end_glyph = glyph + row->used[area]; | |
177c0ea7 | 5363 | |
2e471eb5 GM |
5364 | for (; glyph < end_glyph; ++glyph) |
5365 | if (GC_STRINGP (glyph->object) | |
5366 | && !STRING_MARKED_P (XSTRING (glyph->object))) | |
49723c04 | 5367 | mark_object (glyph->object); |
2e471eb5 GM |
5368 | } |
5369 | } | |
41c28a37 GM |
5370 | } |
5371 | ||
34400008 | 5372 | |
41c28a37 GM |
5373 | /* Mark Lisp faces in the face cache C. */ |
5374 | ||
5375 | static void | |
5376 | mark_face_cache (c) | |
5377 | struct face_cache *c; | |
5378 | { | |
5379 | if (c) | |
5380 | { | |
5381 | int i, j; | |
5382 | for (i = 0; i < c->used; ++i) | |
5383 | { | |
5384 | struct face *face = FACE_FROM_ID (c->f, i); | |
5385 | ||
5386 | if (face) | |
5387 | { | |
5388 | for (j = 0; j < LFACE_VECTOR_SIZE; ++j) | |
49723c04 | 5389 | mark_object (face->lface[j]); |
41c28a37 GM |
5390 | } |
5391 | } | |
5392 | } | |
5393 | } | |
5394 | ||
5395 | ||
5396 | #ifdef HAVE_WINDOW_SYSTEM | |
5397 | ||
5398 | /* Mark Lisp objects in image IMG. */ | |
5399 | ||
5400 | static void | |
5401 | mark_image (img) | |
5402 | struct image *img; | |
5403 | { | |
49723c04 | 5404 | mark_object (img->spec); |
177c0ea7 | 5405 | |
3e60b029 | 5406 | if (!NILP (img->data.lisp_val)) |
49723c04 | 5407 | mark_object (img->data.lisp_val); |
41c28a37 GM |
5408 | } |
5409 | ||
5410 | ||
5411 | /* Mark Lisp objects in image cache of frame F. It's done this way so | |
5412 | that we don't have to include xterm.h here. */ | |
5413 | ||
5414 | static void | |
5415 | mark_image_cache (f) | |
5416 | struct frame *f; | |
5417 | { | |
5418 | forall_images_in_image_cache (f, mark_image); | |
5419 | } | |
5420 | ||
5421 | #endif /* HAVE_X_WINDOWS */ | |
5422 | ||
5423 | ||
7146af97 | 5424 | \f |
1a4f1e2c | 5425 | /* Mark reference to a Lisp_Object. |
2e471eb5 GM |
5426 | If the object referred to has not been seen yet, recursively mark |
5427 | all the references contained in it. */ | |
7146af97 | 5428 | |
785cd37f | 5429 | #define LAST_MARKED_SIZE 500 |
49723c04 | 5430 | Lisp_Object last_marked[LAST_MARKED_SIZE]; |
785cd37f RS |
5431 | int last_marked_index; |
5432 | ||
1342fc6f RS |
5433 | /* For debugging--call abort when we cdr down this many |
5434 | links of a list, in mark_object. In debugging, | |
5435 | the call to abort will hit a breakpoint. | |
5436 | Normally this is zero and the check never goes off. */ | |
5437 | int mark_object_loop_halt; | |
5438 | ||
d2029e5b SM |
5439 | /* Return non-zero if the object was not yet marked. */ |
5440 | static int | |
5441 | mark_vectorlike (ptr) | |
5442 | struct Lisp_Vector *ptr; | |
5443 | { | |
5444 | register EMACS_INT size = ptr->size; | |
5445 | register int i; | |
5446 | ||
5447 | if (VECTOR_MARKED_P (ptr)) | |
5448 | return 0; /* Already marked */ | |
5449 | VECTOR_MARK (ptr); /* Else mark it */ | |
5450 | if (size & PSEUDOVECTOR_FLAG) | |
5451 | size &= PSEUDOVECTOR_SIZE_MASK; | |
5452 | ||
5453 | /* Note that this size is not the memory-footprint size, but only | |
5454 | the number of Lisp_Object fields that we should trace. | |
5455 | The distinction is used e.g. by Lisp_Process which places extra | |
5456 | non-Lisp_Object fields at the end of the structure. */ | |
5457 | for (i = 0; i < size; i++) /* and then mark its elements */ | |
5458 | mark_object (ptr->contents[i]); | |
5459 | return 1; | |
5460 | } | |
5461 | ||
41c28a37 | 5462 | void |
49723c04 SM |
5463 | mark_object (arg) |
5464 | Lisp_Object arg; | |
7146af97 | 5465 | { |
49723c04 | 5466 | register Lisp_Object obj = arg; |
4f5c1376 GM |
5467 | #ifdef GC_CHECK_MARKED_OBJECTS |
5468 | void *po; | |
5469 | struct mem_node *m; | |
5470 | #endif | |
1342fc6f | 5471 | int cdr_count = 0; |
7146af97 | 5472 | |
9149e743 | 5473 | loop: |
7146af97 | 5474 | |
1f0b3fd2 | 5475 | if (PURE_POINTER_P (XPNTR (obj))) |
7146af97 JB |
5476 | return; |
5477 | ||
49723c04 | 5478 | last_marked[last_marked_index++] = obj; |
785cd37f RS |
5479 | if (last_marked_index == LAST_MARKED_SIZE) |
5480 | last_marked_index = 0; | |
5481 | ||
4f5c1376 GM |
5482 | /* Perform some sanity checks on the objects marked here. Abort if |
5483 | we encounter an object we know is bogus. This increases GC time | |
5484 | by ~80%, and requires compilation with GC_MARK_STACK != 0. */ | |
5485 | #ifdef GC_CHECK_MARKED_OBJECTS | |
5486 | ||
5487 | po = (void *) XPNTR (obj); | |
5488 | ||
5489 | /* Check that the object pointed to by PO is known to be a Lisp | |
5490 | structure allocated from the heap. */ | |
5491 | #define CHECK_ALLOCATED() \ | |
5492 | do { \ | |
5493 | m = mem_find (po); \ | |
5494 | if (m == MEM_NIL) \ | |
5495 | abort (); \ | |
5496 | } while (0) | |
5497 | ||
5498 | /* Check that the object pointed to by PO is live, using predicate | |
5499 | function LIVEP. */ | |
5500 | #define CHECK_LIVE(LIVEP) \ | |
5501 | do { \ | |
5502 | if (!LIVEP (m, po)) \ | |
5503 | abort (); \ | |
5504 | } while (0) | |
5505 | ||
5506 | /* Check both of the above conditions. */ | |
5507 | #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \ | |
5508 | do { \ | |
5509 | CHECK_ALLOCATED (); \ | |
5510 | CHECK_LIVE (LIVEP); \ | |
5511 | } while (0) \ | |
177c0ea7 | 5512 | |
4f5c1376 | 5513 | #else /* not GC_CHECK_MARKED_OBJECTS */ |
177c0ea7 | 5514 | |
4f5c1376 GM |
5515 | #define CHECK_ALLOCATED() (void) 0 |
5516 | #define CHECK_LIVE(LIVEP) (void) 0 | |
5517 | #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0 | |
177c0ea7 | 5518 | |
4f5c1376 GM |
5519 | #endif /* not GC_CHECK_MARKED_OBJECTS */ |
5520 | ||
0220c518 | 5521 | switch (SWITCH_ENUM_CAST (XGCTYPE (obj))) |
7146af97 JB |
5522 | { |
5523 | case Lisp_String: | |
5524 | { | |
5525 | register struct Lisp_String *ptr = XSTRING (obj); | |
4f5c1376 | 5526 | CHECK_ALLOCATED_AND_LIVE (live_string_p); |
d5e35230 | 5527 | MARK_INTERVAL_TREE (ptr->intervals); |
2e471eb5 | 5528 | MARK_STRING (ptr); |
361b097f | 5529 | #ifdef GC_CHECK_STRING_BYTES |
676a7251 GM |
5530 | /* Check that the string size recorded in the string is the |
5531 | same as the one recorded in the sdata structure. */ | |
5532 | CHECK_STRING_BYTES (ptr); | |
361b097f | 5533 | #endif /* GC_CHECK_STRING_BYTES */ |
7146af97 JB |
5534 | } |
5535 | break; | |
5536 | ||
76437631 | 5537 | case Lisp_Vectorlike: |
4f5c1376 GM |
5538 | #ifdef GC_CHECK_MARKED_OBJECTS |
5539 | m = mem_find (po); | |
5540 | if (m == MEM_NIL && !GC_SUBRP (obj) | |
5541 | && po != &buffer_defaults | |
5542 | && po != &buffer_local_symbols) | |
5543 | abort (); | |
5544 | #endif /* GC_CHECK_MARKED_OBJECTS */ | |
177c0ea7 | 5545 | |
30e3190a | 5546 | if (GC_BUFFERP (obj)) |
6b552283 | 5547 | { |
3ef06d12 | 5548 | if (!VECTOR_MARKED_P (XBUFFER (obj))) |
4f5c1376 GM |
5549 | { |
5550 | #ifdef GC_CHECK_MARKED_OBJECTS | |
5551 | if (po != &buffer_defaults && po != &buffer_local_symbols) | |
5552 | { | |
5553 | struct buffer *b; | |
5554 | for (b = all_buffers; b && b != po; b = b->next) | |
5555 | ; | |
5556 | if (b == NULL) | |
5557 | abort (); | |
5558 | } | |
5559 | #endif /* GC_CHECK_MARKED_OBJECTS */ | |
5560 | mark_buffer (obj); | |
5561 | } | |
6b552283 | 5562 | } |
30e3190a | 5563 | else if (GC_SUBRP (obj)) |
169ee243 RS |
5564 | break; |
5565 | else if (GC_COMPILEDP (obj)) | |
2e471eb5 GM |
5566 | /* We could treat this just like a vector, but it is better to |
5567 | save the COMPILED_CONSTANTS element for last and avoid | |
5568 | recursion there. */ | |
169ee243 RS |
5569 | { |
5570 | register struct Lisp_Vector *ptr = XVECTOR (obj); | |
5571 | register EMACS_INT size = ptr->size; | |
169ee243 RS |
5572 | register int i; |
5573 | ||
3ef06d12 | 5574 | if (VECTOR_MARKED_P (ptr)) |
169ee243 | 5575 | break; /* Already marked */ |
177c0ea7 | 5576 | |
4f5c1376 | 5577 | CHECK_LIVE (live_vector_p); |
3ef06d12 | 5578 | VECTOR_MARK (ptr); /* Else mark it */ |
76437631 | 5579 | size &= PSEUDOVECTOR_SIZE_MASK; |
169ee243 RS |
5580 | for (i = 0; i < size; i++) /* and then mark its elements */ |
5581 | { | |
5582 | if (i != COMPILED_CONSTANTS) | |
49723c04 | 5583 | mark_object (ptr->contents[i]); |
169ee243 | 5584 | } |
49723c04 | 5585 | obj = ptr->contents[COMPILED_CONSTANTS]; |
169ee243 RS |
5586 | goto loop; |
5587 | } | |
169ee243 RS |
5588 | else if (GC_FRAMEP (obj)) |
5589 | { | |
c70bbf06 | 5590 | register struct frame *ptr = XFRAME (obj); |
d2029e5b SM |
5591 | if (mark_vectorlike (XVECTOR (obj))) |
5592 | { | |
5b2f56df | 5593 | mark_face_cache (ptr->face_cache); |
41c28a37 | 5594 | #ifdef HAVE_WINDOW_SYSTEM |
5b2f56df | 5595 | mark_image_cache (ptr); |
41c28a37 | 5596 | #endif /* HAVE_WINDOW_SYSTEM */ |
5b2f56df | 5597 | } |
707788bd | 5598 | } |
41c28a37 GM |
5599 | else if (GC_WINDOWP (obj)) |
5600 | { | |
5601 | register struct Lisp_Vector *ptr = XVECTOR (obj); | |
5602 | struct window *w = XWINDOW (obj); | |
d2029e5b SM |
5603 | if (mark_vectorlike (ptr)) |
5604 | { | |
5b2f56df SM |
5605 | /* Mark glyphs for leaf windows. Marking window matrices is |
5606 | sufficient because frame matrices use the same glyph | |
5607 | memory. */ | |
d2029e5b SM |
5608 | if (NILP (w->hchild) |
5609 | && NILP (w->vchild) | |
5610 | && w->current_matrix) | |
5611 | { | |
5612 | mark_glyph_matrix (w->current_matrix); | |
5b2f56df SM |
5613 | mark_glyph_matrix (w->desired_matrix); |
5614 | } | |
41c28a37 GM |
5615 | } |
5616 | } | |
5617 | else if (GC_HASH_TABLE_P (obj)) | |
5618 | { | |
5619 | struct Lisp_Hash_Table *h = XHASH_TABLE (obj); | |
177c0ea7 | 5620 | |
41c28a37 | 5621 | /* Stop if already marked. */ |
3ef06d12 | 5622 | if (VECTOR_MARKED_P (h)) |
41c28a37 | 5623 | break; |
177c0ea7 | 5624 | |
41c28a37 | 5625 | /* Mark it. */ |
4f5c1376 | 5626 | CHECK_LIVE (live_vector_p); |
3ef06d12 | 5627 | VECTOR_MARK (h); |
41c28a37 GM |
5628 | |
5629 | /* Mark contents. */ | |
94a877ef | 5630 | /* Do not mark next_free or next_weak. |
177c0ea7 | 5631 | Being in the next_weak chain |
94a877ef RS |
5632 | should not keep the hash table alive. |
5633 | No need to mark `count' since it is an integer. */ | |
49723c04 SM |
5634 | mark_object (h->test); |
5635 | mark_object (h->weak); | |
5636 | mark_object (h->rehash_size); | |
5637 | mark_object (h->rehash_threshold); | |
5638 | mark_object (h->hash); | |
5639 | mark_object (h->next); | |
5640 | mark_object (h->index); | |
5641 | mark_object (h->user_hash_function); | |
5642 | mark_object (h->user_cmp_function); | |
41c28a37 GM |
5643 | |
5644 | /* If hash table is not weak, mark all keys and values. | |
5645 | For weak tables, mark only the vector. */ | |
5646 | if (GC_NILP (h->weak)) | |
d2029e5b SM |
5647 | mark_object (h->key_and_value); |
5648 | else | |
5649 | VECTOR_MARK (XVECTOR (h->key_and_value)); | |
5650 | } | |
41c28a37 | 5651 | } |
04ff9756 | 5652 | else |
d2029e5b | 5653 | mark_vectorlike (XVECTOR (obj)); |
169ee243 | 5654 | break; |
7146af97 | 5655 | |
7146af97 JB |
5656 | case Lisp_Symbol: |
5657 | { | |
c70bbf06 | 5658 | register struct Lisp_Symbol *ptr = XSYMBOL (obj); |
7146af97 JB |
5659 | struct Lisp_Symbol *ptrx; |
5660 | ||
2336fe58 | 5661 | if (ptr->gcmarkbit) break; |
4f5c1376 | 5662 | CHECK_ALLOCATED_AND_LIVE (live_symbol_p); |
2336fe58 | 5663 | ptr->gcmarkbit = 1; |
49723c04 SM |
5664 | mark_object (ptr->value); |
5665 | mark_object (ptr->function); | |
5666 | mark_object (ptr->plist); | |
34400008 | 5667 | |
8fe5665d KR |
5668 | if (!PURE_POINTER_P (XSTRING (ptr->xname))) |
5669 | MARK_STRING (XSTRING (ptr->xname)); | |
d5db4077 | 5670 | MARK_INTERVAL_TREE (STRING_INTERVALS (ptr->xname)); |
177c0ea7 | 5671 | |
1c6bb482 RS |
5672 | /* Note that we do not mark the obarray of the symbol. |
5673 | It is safe not to do so because nothing accesses that | |
5674 | slot except to check whether it is nil. */ | |
7146af97 JB |
5675 | ptr = ptr->next; |
5676 | if (ptr) | |
5677 | { | |
b0846f52 | 5678 | ptrx = ptr; /* Use of ptrx avoids compiler bug on Sun */ |
7146af97 | 5679 | XSETSYMBOL (obj, ptrx); |
49723c04 | 5680 | goto loop; |
7146af97 JB |
5681 | } |
5682 | } | |
5683 | break; | |
5684 | ||
a0a38eb7 | 5685 | case Lisp_Misc: |
4f5c1376 | 5686 | CHECK_ALLOCATED_AND_LIVE (live_misc_p); |
2336fe58 SM |
5687 | if (XMARKER (obj)->gcmarkbit) |
5688 | break; | |
5689 | XMARKER (obj)->gcmarkbit = 1; | |
b766f870 | 5690 | |
a5da44fe | 5691 | switch (XMISCTYPE (obj)) |
a0a38eb7 | 5692 | { |
465edf35 KH |
5693 | case Lisp_Misc_Buffer_Local_Value: |
5694 | case Lisp_Misc_Some_Buffer_Local_Value: | |
5695 | { | |
5696 | register struct Lisp_Buffer_Local_Value *ptr | |
5697 | = XBUFFER_LOCAL_VALUE (obj); | |
465edf35 KH |
5698 | /* If the cdr is nil, avoid recursion for the car. */ |
5699 | if (EQ (ptr->cdr, Qnil)) | |
5700 | { | |
49723c04 | 5701 | obj = ptr->realvalue; |
465edf35 KH |
5702 | goto loop; |
5703 | } | |
49723c04 SM |
5704 | mark_object (ptr->realvalue); |
5705 | mark_object (ptr->buffer); | |
5706 | mark_object (ptr->frame); | |
5707 | obj = ptr->cdr; | |
465edf35 KH |
5708 | goto loop; |
5709 | } | |
5710 | ||
2336fe58 SM |
5711 | case Lisp_Misc_Marker: |
5712 | /* DO NOT mark thru the marker's chain. | |
5713 | The buffer's markers chain does not preserve markers from gc; | |
5714 | instead, markers are removed from the chain when freed by gc. */ | |
b766f870 KS |
5715 | break; |
5716 | ||
c8616056 KH |
5717 | case Lisp_Misc_Intfwd: |
5718 | case Lisp_Misc_Boolfwd: | |
5719 | case Lisp_Misc_Objfwd: | |
5720 | case Lisp_Misc_Buffer_Objfwd: | |
b875d3f7 | 5721 | case Lisp_Misc_Kboard_Objfwd: |
c8616056 KH |
5722 | /* Don't bother with Lisp_Buffer_Objfwd, |
5723 | since all markable slots in current buffer marked anyway. */ | |
5724 | /* Don't need to do Lisp_Objfwd, since the places they point | |
5725 | are protected with staticpro. */ | |
b766f870 KS |
5726 | break; |
5727 | ||
f29181dc | 5728 | case Lisp_Misc_Save_Value: |
9ea306d1 | 5729 | #if GC_MARK_STACK |
b766f870 KS |
5730 | { |
5731 | register struct Lisp_Save_Value *ptr = XSAVE_VALUE (obj); | |
5732 | /* If DOGC is set, POINTER is the address of a memory | |
5733 | area containing INTEGER potential Lisp_Objects. */ | |
5734 | if (ptr->dogc) | |
5735 | { | |
5736 | Lisp_Object *p = (Lisp_Object *) ptr->pointer; | |
5737 | int nelt; | |
5738 | for (nelt = ptr->integer; nelt > 0; nelt--, p++) | |
5739 | mark_maybe_object (*p); | |
5740 | } | |
5741 | } | |
9ea306d1 | 5742 | #endif |
c8616056 KH |
5743 | break; |
5744 | ||
e202fa34 KH |
5745 | case Lisp_Misc_Overlay: |
5746 | { | |
5747 | struct Lisp_Overlay *ptr = XOVERLAY (obj); | |
49723c04 SM |
5748 | mark_object (ptr->start); |
5749 | mark_object (ptr->end); | |
f54253ec SM |
5750 | mark_object (ptr->plist); |
5751 | if (ptr->next) | |
5752 | { | |
5753 | XSETMISC (obj, ptr->next); | |
5754 | goto loop; | |
5755 | } | |
e202fa34 KH |
5756 | } |
5757 | break; | |
5758 | ||
a0a38eb7 KH |
5759 | default: |
5760 | abort (); | |
5761 | } | |
7146af97 JB |
5762 | break; |
5763 | ||
5764 | case Lisp_Cons: | |
7146af97 JB |
5765 | { |
5766 | register struct Lisp_Cons *ptr = XCONS (obj); | |
08b7c2cb | 5767 | if (CONS_MARKED_P (ptr)) break; |
4f5c1376 | 5768 | CHECK_ALLOCATED_AND_LIVE (live_cons_p); |
08b7c2cb | 5769 | CONS_MARK (ptr); |
c54ca951 | 5770 | /* If the cdr is nil, avoid recursion for the car. */ |
28a099a4 | 5771 | if (EQ (ptr->u.cdr, Qnil)) |
c54ca951 | 5772 | { |
49723c04 | 5773 | obj = ptr->car; |
1342fc6f | 5774 | cdr_count = 0; |
c54ca951 RS |
5775 | goto loop; |
5776 | } | |
49723c04 | 5777 | mark_object (ptr->car); |
28a099a4 | 5778 | obj = ptr->u.cdr; |
1342fc6f RS |
5779 | cdr_count++; |
5780 | if (cdr_count == mark_object_loop_halt) | |
5781 | abort (); | |
7146af97 JB |
5782 | goto loop; |
5783 | } | |
5784 | ||
7146af97 | 5785 | case Lisp_Float: |
4f5c1376 | 5786 | CHECK_ALLOCATED_AND_LIVE (live_float_p); |
ab6780cd | 5787 | FLOAT_MARK (XFLOAT (obj)); |
7146af97 | 5788 | break; |
7146af97 | 5789 | |
7146af97 | 5790 | case Lisp_Int: |
7146af97 JB |
5791 | break; |
5792 | ||
5793 | default: | |
5794 | abort (); | |
5795 | } | |
4f5c1376 GM |
5796 | |
5797 | #undef CHECK_LIVE | |
5798 | #undef CHECK_ALLOCATED | |
5799 | #undef CHECK_ALLOCATED_AND_LIVE | |
7146af97 JB |
5800 | } |
5801 | ||
5802 | /* Mark the pointers in a buffer structure. */ | |
5803 | ||
5804 | static void | |
5805 | mark_buffer (buf) | |
5806 | Lisp_Object buf; | |
5807 | { | |
7146af97 | 5808 | register struct buffer *buffer = XBUFFER (buf); |
f54253ec | 5809 | register Lisp_Object *ptr, tmp; |
30e3190a | 5810 | Lisp_Object base_buffer; |
7146af97 | 5811 | |
3ef06d12 | 5812 | VECTOR_MARK (buffer); |
7146af97 | 5813 | |
30e3190a | 5814 | MARK_INTERVAL_TREE (BUF_INTERVALS (buffer)); |
d5e35230 | 5815 | |
c37adf23 SM |
5816 | /* For now, we just don't mark the undo_list. It's done later in |
5817 | a special way just before the sweep phase, and after stripping | |
5818 | some of its elements that are not needed any more. */ | |
4c315bda | 5819 | |
f54253ec SM |
5820 | if (buffer->overlays_before) |
5821 | { | |
5822 | XSETMISC (tmp, buffer->overlays_before); | |
5823 | mark_object (tmp); | |
5824 | } | |
5825 | if (buffer->overlays_after) | |
5826 | { | |
5827 | XSETMISC (tmp, buffer->overlays_after); | |
5828 | mark_object (tmp); | |
5829 | } | |
5830 | ||
3ef06d12 | 5831 | for (ptr = &buffer->name; |
7146af97 JB |
5832 | (char *)ptr < (char *)buffer + sizeof (struct buffer); |
5833 | ptr++) | |
49723c04 | 5834 | mark_object (*ptr); |
30e3190a RS |
5835 | |
5836 | /* If this is an indirect buffer, mark its base buffer. */ | |
349bd9ed | 5837 | if (buffer->base_buffer && !VECTOR_MARKED_P (buffer->base_buffer)) |
30e3190a | 5838 | { |
177c0ea7 | 5839 | XSETBUFFER (base_buffer, buffer->base_buffer); |
30e3190a RS |
5840 | mark_buffer (base_buffer); |
5841 | } | |
7146af97 | 5842 | } |
084b1a0c | 5843 | |
4a729fd8 SM |
5844 | /* Mark the Lisp pointers in the terminal objects. |
5845 | Called by the Fgarbage_collector. */ | |
5846 | ||
4a729fd8 SM |
5847 | static void |
5848 | mark_terminals (void) | |
5849 | { | |
5850 | struct terminal *t; | |
5851 | for (t = terminal_list; t; t = t->next_terminal) | |
5852 | { | |
5853 | eassert (t->name != NULL); | |
d2029e5b | 5854 | mark_vectorlike ((struct Lisp_Vector *)tmp); |
4a729fd8 SM |
5855 | } |
5856 | } | |
5857 | ||
5858 | ||
084b1a0c | 5859 | |
41c28a37 GM |
5860 | /* Value is non-zero if OBJ will survive the current GC because it's |
5861 | either marked or does not need to be marked to survive. */ | |
5862 | ||
5863 | int | |
5864 | survives_gc_p (obj) | |
5865 | Lisp_Object obj; | |
5866 | { | |
5867 | int survives_p; | |
177c0ea7 | 5868 | |
41c28a37 GM |
5869 | switch (XGCTYPE (obj)) |
5870 | { | |
5871 | case Lisp_Int: | |
5872 | survives_p = 1; | |
5873 | break; | |
5874 | ||
5875 | case Lisp_Symbol: | |
2336fe58 | 5876 | survives_p = XSYMBOL (obj)->gcmarkbit; |
41c28a37 GM |
5877 | break; |
5878 | ||
5879 | case Lisp_Misc: | |
ef89c2ce | 5880 | survives_p = XMARKER (obj)->gcmarkbit; |
41c28a37 GM |
5881 | break; |
5882 | ||
5883 | case Lisp_String: | |
08b7c2cb | 5884 | survives_p = STRING_MARKED_P (XSTRING (obj)); |
41c28a37 GM |
5885 | break; |
5886 | ||
5887 | case Lisp_Vectorlike: | |
08b7c2cb | 5888 | survives_p = GC_SUBRP (obj) || VECTOR_MARKED_P (XVECTOR (obj)); |
41c28a37 GM |
5889 | break; |
5890 | ||
5891 | case Lisp_Cons: | |
08b7c2cb | 5892 | survives_p = CONS_MARKED_P (XCONS (obj)); |
41c28a37 GM |
5893 | break; |
5894 | ||
41c28a37 | 5895 | case Lisp_Float: |
ab6780cd | 5896 | survives_p = FLOAT_MARKED_P (XFLOAT (obj)); |
41c28a37 | 5897 | break; |
41c28a37 GM |
5898 | |
5899 | default: | |
5900 | abort (); | |
5901 | } | |
5902 | ||
34400008 | 5903 | return survives_p || PURE_POINTER_P ((void *) XPNTR (obj)); |
41c28a37 GM |
5904 | } |
5905 | ||
5906 | ||
7146af97 | 5907 | \f |
1a4f1e2c | 5908 | /* Sweep: find all structures not marked, and free them. */ |
7146af97 JB |
5909 | |
5910 | static void | |
5911 | gc_sweep () | |
5912 | { | |
c37adf23 SM |
5913 | /* Remove or mark entries in weak hash tables. |
5914 | This must be done before any object is unmarked. */ | |
5915 | sweep_weak_hash_tables (); | |
5916 | ||
5917 | sweep_strings (); | |
5918 | #ifdef GC_CHECK_STRING_BYTES | |
5919 | if (!noninteractive) | |
5920 | check_string_bytes (1); | |
5921 | #endif | |
5922 | ||
7146af97 JB |
5923 | /* Put all unmarked conses on free list */ |
5924 | { | |
5925 | register struct cons_block *cblk; | |
6ca94ac9 | 5926 | struct cons_block **cprev = &cons_block; |
7146af97 JB |
5927 | register int lim = cons_block_index; |
5928 | register int num_free = 0, num_used = 0; | |
5929 | ||
5930 | cons_free_list = 0; | |
177c0ea7 | 5931 | |
6ca94ac9 | 5932 | for (cblk = cons_block; cblk; cblk = *cprev) |
7146af97 | 5933 | { |
3ae2e3a3 | 5934 | register int i = 0; |
6ca94ac9 | 5935 | int this_free = 0; |
3ae2e3a3 RS |
5936 | int ilim = (lim + BITS_PER_INT - 1) / BITS_PER_INT; |
5937 | ||
5938 | /* Scan the mark bits an int at a time. */ | |
5939 | for (i = 0; i <= ilim; i++) | |
5940 | { | |
5941 | if (cblk->gcmarkbits[i] == -1) | |
5942 | { | |
5943 | /* Fast path - all cons cells for this int are marked. */ | |
5944 | cblk->gcmarkbits[i] = 0; | |
5945 | num_used += BITS_PER_INT; | |
5946 | } | |
5947 | else | |
5948 | { | |
5949 | /* Some cons cells for this int are not marked. | |
5950 | Find which ones, and free them. */ | |
5951 | int start, pos, stop; | |
5952 | ||
5953 | start = i * BITS_PER_INT; | |
5954 | stop = lim - start; | |
5955 | if (stop > BITS_PER_INT) | |
5956 | stop = BITS_PER_INT; | |
5957 | stop += start; | |
5958 | ||
5959 | for (pos = start; pos < stop; pos++) | |
5960 | { | |
5961 | if (!CONS_MARKED_P (&cblk->conses[pos])) | |
5962 | { | |
5963 | this_free++; | |
5964 | cblk->conses[pos].u.chain = cons_free_list; | |
5965 | cons_free_list = &cblk->conses[pos]; | |
34400008 | 5966 | #if GC_MARK_STACK |
3ae2e3a3 | 5967 | cons_free_list->car = Vdead; |
34400008 | 5968 | #endif |
3ae2e3a3 RS |
5969 | } |
5970 | else | |
5971 | { | |
5972 | num_used++; | |
5973 | CONS_UNMARK (&cblk->conses[pos]); | |
5974 | } | |
5975 | } | |
5976 | } | |
5977 | } | |
5978 | ||
7146af97 | 5979 | lim = CONS_BLOCK_SIZE; |
6ca94ac9 KH |
5980 | /* If this block contains only free conses and we have already |
5981 | seen more than two blocks worth of free conses then deallocate | |
5982 | this block. */ | |
6feef451 | 5983 | if (this_free == CONS_BLOCK_SIZE && num_free > CONS_BLOCK_SIZE) |
6ca94ac9 | 5984 | { |
6ca94ac9 KH |
5985 | *cprev = cblk->next; |
5986 | /* Unhook from the free list. */ | |
28a099a4 | 5987 | cons_free_list = cblk->conses[0].u.chain; |
08b7c2cb | 5988 | lisp_align_free (cblk); |
c8099634 | 5989 | n_cons_blocks--; |
6ca94ac9 KH |
5990 | } |
5991 | else | |
6feef451 AS |
5992 | { |
5993 | num_free += this_free; | |
5994 | cprev = &cblk->next; | |
5995 | } | |
7146af97 JB |
5996 | } |
5997 | total_conses = num_used; | |
5998 | total_free_conses = num_free; | |
5999 | } | |
6000 | ||
7146af97 JB |
6001 | /* Put all unmarked floats on free list */ |
6002 | { | |
6003 | register struct float_block *fblk; | |
6ca94ac9 | 6004 | struct float_block **fprev = &float_block; |
7146af97 JB |
6005 | register int lim = float_block_index; |
6006 | register int num_free = 0, num_used = 0; | |
6007 | ||
6008 | float_free_list = 0; | |
177c0ea7 | 6009 | |
6ca94ac9 | 6010 | for (fblk = float_block; fblk; fblk = *fprev) |
7146af97 JB |
6011 | { |
6012 | register int i; | |
6ca94ac9 | 6013 | int this_free = 0; |
7146af97 | 6014 | for (i = 0; i < lim; i++) |
ab6780cd | 6015 | if (!FLOAT_MARKED_P (&fblk->floats[i])) |
7146af97 | 6016 | { |
6ca94ac9 | 6017 | this_free++; |
28a099a4 | 6018 | fblk->floats[i].u.chain = float_free_list; |
7146af97 JB |
6019 | float_free_list = &fblk->floats[i]; |
6020 | } | |
6021 | else | |
6022 | { | |
6023 | num_used++; | |
ab6780cd | 6024 | FLOAT_UNMARK (&fblk->floats[i]); |
7146af97 JB |
6025 | } |
6026 | lim = FLOAT_BLOCK_SIZE; | |
6ca94ac9 KH |
6027 | /* If this block contains only free floats and we have already |
6028 | seen more than two blocks worth of free floats then deallocate | |
6029 | this block. */ | |
6feef451 | 6030 | if (this_free == FLOAT_BLOCK_SIZE && num_free > FLOAT_BLOCK_SIZE) |
6ca94ac9 | 6031 | { |
6ca94ac9 KH |
6032 | *fprev = fblk->next; |
6033 | /* Unhook from the free list. */ | |
28a099a4 | 6034 | float_free_list = fblk->floats[0].u.chain; |
ab6780cd | 6035 | lisp_align_free (fblk); |
c8099634 | 6036 | n_float_blocks--; |
6ca94ac9 KH |
6037 | } |
6038 | else | |
6feef451 AS |
6039 | { |
6040 | num_free += this_free; | |
6041 | fprev = &fblk->next; | |
6042 | } | |
7146af97 JB |
6043 | } |
6044 | total_floats = num_used; | |
6045 | total_free_floats = num_free; | |
6046 | } | |
7146af97 | 6047 | |
d5e35230 JA |
6048 | /* Put all unmarked intervals on free list */ |
6049 | { | |
6050 | register struct interval_block *iblk; | |
6ca94ac9 | 6051 | struct interval_block **iprev = &interval_block; |
d5e35230 JA |
6052 | register int lim = interval_block_index; |
6053 | register int num_free = 0, num_used = 0; | |
6054 | ||
6055 | interval_free_list = 0; | |
6056 | ||
6ca94ac9 | 6057 | for (iblk = interval_block; iblk; iblk = *iprev) |
d5e35230 JA |
6058 | { |
6059 | register int i; | |
6ca94ac9 | 6060 | int this_free = 0; |
d5e35230 JA |
6061 | |
6062 | for (i = 0; i < lim; i++) | |
6063 | { | |
2336fe58 | 6064 | if (!iblk->intervals[i].gcmarkbit) |
d5e35230 | 6065 | { |
439d5cb4 | 6066 | SET_INTERVAL_PARENT (&iblk->intervals[i], interval_free_list); |
d5e35230 | 6067 | interval_free_list = &iblk->intervals[i]; |
6ca94ac9 | 6068 | this_free++; |
d5e35230 JA |
6069 | } |
6070 | else | |
6071 | { | |
6072 | num_used++; | |
2336fe58 | 6073 | iblk->intervals[i].gcmarkbit = 0; |
d5e35230 JA |
6074 | } |
6075 | } | |
6076 | lim = INTERVAL_BLOCK_SIZE; | |
6ca94ac9 KH |
6077 | /* If this block contains only free intervals and we have already |
6078 | seen more than two blocks worth of free intervals then | |
6079 | deallocate this block. */ | |
6feef451 | 6080 | if (this_free == INTERVAL_BLOCK_SIZE && num_free > INTERVAL_BLOCK_SIZE) |
6ca94ac9 | 6081 | { |
6ca94ac9 KH |
6082 | *iprev = iblk->next; |
6083 | /* Unhook from the free list. */ | |
439d5cb4 | 6084 | interval_free_list = INTERVAL_PARENT (&iblk->intervals[0]); |
c8099634 RS |
6085 | lisp_free (iblk); |
6086 | n_interval_blocks--; | |
6ca94ac9 KH |
6087 | } |
6088 | else | |
6feef451 AS |
6089 | { |
6090 | num_free += this_free; | |
6091 | iprev = &iblk->next; | |
6092 | } | |
d5e35230 JA |
6093 | } |
6094 | total_intervals = num_used; | |
6095 | total_free_intervals = num_free; | |
6096 | } | |
d5e35230 | 6097 | |
7146af97 JB |
6098 | /* Put all unmarked symbols on free list */ |
6099 | { | |
6100 | register struct symbol_block *sblk; | |
6ca94ac9 | 6101 | struct symbol_block **sprev = &symbol_block; |
7146af97 JB |
6102 | register int lim = symbol_block_index; |
6103 | register int num_free = 0, num_used = 0; | |
6104 | ||
d285b373 | 6105 | symbol_free_list = NULL; |
177c0ea7 | 6106 | |
6ca94ac9 | 6107 | for (sblk = symbol_block; sblk; sblk = *sprev) |
7146af97 | 6108 | { |
6ca94ac9 | 6109 | int this_free = 0; |
d285b373 GM |
6110 | struct Lisp_Symbol *sym = sblk->symbols; |
6111 | struct Lisp_Symbol *end = sym + lim; | |
6112 | ||
6113 | for (; sym < end; ++sym) | |
6114 | { | |
20035321 SM |
6115 | /* Check if the symbol was created during loadup. In such a case |
6116 | it might be pointed to by pure bytecode which we don't trace, | |
6117 | so we conservatively assume that it is live. */ | |
8fe5665d | 6118 | int pure_p = PURE_POINTER_P (XSTRING (sym->xname)); |
177c0ea7 | 6119 | |
2336fe58 | 6120 | if (!sym->gcmarkbit && !pure_p) |
d285b373 | 6121 | { |
28a099a4 | 6122 | sym->next = symbol_free_list; |
d285b373 | 6123 | symbol_free_list = sym; |
34400008 | 6124 | #if GC_MARK_STACK |
d285b373 | 6125 | symbol_free_list->function = Vdead; |
34400008 | 6126 | #endif |
d285b373 GM |
6127 | ++this_free; |
6128 | } | |
6129 | else | |
6130 | { | |
6131 | ++num_used; | |
6132 | if (!pure_p) | |
8fe5665d | 6133 | UNMARK_STRING (XSTRING (sym->xname)); |
2336fe58 | 6134 | sym->gcmarkbit = 0; |
d285b373 GM |
6135 | } |
6136 | } | |
177c0ea7 | 6137 | |
7146af97 | 6138 | lim = SYMBOL_BLOCK_SIZE; |
6ca94ac9 KH |
6139 | /* If this block contains only free symbols and we have already |
6140 | seen more than two blocks worth of free symbols then deallocate | |
6141 | this block. */ | |
6feef451 | 6142 | if (this_free == SYMBOL_BLOCK_SIZE && num_free > SYMBOL_BLOCK_SIZE) |
6ca94ac9 | 6143 | { |
6ca94ac9 KH |
6144 | *sprev = sblk->next; |
6145 | /* Unhook from the free list. */ | |
28a099a4 | 6146 | symbol_free_list = sblk->symbols[0].next; |
c8099634 RS |
6147 | lisp_free (sblk); |
6148 | n_symbol_blocks--; | |
6ca94ac9 KH |
6149 | } |
6150 | else | |
6feef451 AS |
6151 | { |
6152 | num_free += this_free; | |
6153 | sprev = &sblk->next; | |
6154 | } | |
7146af97 JB |
6155 | } |
6156 | total_symbols = num_used; | |
6157 | total_free_symbols = num_free; | |
6158 | } | |
6159 | ||
a9faeabe RS |
6160 | /* Put all unmarked misc's on free list. |
6161 | For a marker, first unchain it from the buffer it points into. */ | |
7146af97 JB |
6162 | { |
6163 | register struct marker_block *mblk; | |
6ca94ac9 | 6164 | struct marker_block **mprev = &marker_block; |
7146af97 JB |
6165 | register int lim = marker_block_index; |
6166 | register int num_free = 0, num_used = 0; | |
6167 | ||
6168 | marker_free_list = 0; | |
177c0ea7 | 6169 | |
6ca94ac9 | 6170 | for (mblk = marker_block; mblk; mblk = *mprev) |
7146af97 JB |
6171 | { |
6172 | register int i; | |
6ca94ac9 | 6173 | int this_free = 0; |
fa05e253 | 6174 | |
7146af97 | 6175 | for (i = 0; i < lim; i++) |
465edf35 | 6176 | { |
2336fe58 | 6177 | if (!mblk->markers[i].u_marker.gcmarkbit) |
465edf35 | 6178 | { |
a5da44fe | 6179 | if (mblk->markers[i].u_marker.type == Lisp_Misc_Marker) |
ef89c2ce | 6180 | unchain_marker (&mblk->markers[i].u_marker); |
fa05e253 RS |
6181 | /* Set the type of the freed object to Lisp_Misc_Free. |
6182 | We could leave the type alone, since nobody checks it, | |
465edf35 | 6183 | but this might catch bugs faster. */ |
a5da44fe | 6184 | mblk->markers[i].u_marker.type = Lisp_Misc_Free; |
465edf35 KH |
6185 | mblk->markers[i].u_free.chain = marker_free_list; |
6186 | marker_free_list = &mblk->markers[i]; | |
6ca94ac9 | 6187 | this_free++; |
465edf35 KH |
6188 | } |
6189 | else | |
6190 | { | |
6191 | num_used++; | |
2336fe58 | 6192 | mblk->markers[i].u_marker.gcmarkbit = 0; |
465edf35 KH |
6193 | } |
6194 | } | |
7146af97 | 6195 | lim = MARKER_BLOCK_SIZE; |
6ca94ac9 KH |
6196 | /* If this block contains only free markers and we have already |
6197 | seen more than two blocks worth of free markers then deallocate | |
6198 | this block. */ | |
6feef451 | 6199 | if (this_free == MARKER_BLOCK_SIZE && num_free > MARKER_BLOCK_SIZE) |
6ca94ac9 | 6200 | { |
6ca94ac9 KH |
6201 | *mprev = mblk->next; |
6202 | /* Unhook from the free list. */ | |
6203 | marker_free_list = mblk->markers[0].u_free.chain; | |
c37adf23 | 6204 | lisp_free (mblk); |
c8099634 | 6205 | n_marker_blocks--; |
6ca94ac9 KH |
6206 | } |
6207 | else | |
6feef451 AS |
6208 | { |
6209 | num_free += this_free; | |
6210 | mprev = &mblk->next; | |
6211 | } | |
7146af97 JB |
6212 | } |
6213 | ||
6214 | total_markers = num_used; | |
6215 | total_free_markers = num_free; | |
6216 | } | |
6217 | ||
6218 | /* Free all unmarked buffers */ | |
6219 | { | |
6220 | register struct buffer *buffer = all_buffers, *prev = 0, *next; | |
6221 | ||
6222 | while (buffer) | |
3ef06d12 | 6223 | if (!VECTOR_MARKED_P (buffer)) |
7146af97 JB |
6224 | { |
6225 | if (prev) | |
6226 | prev->next = buffer->next; | |
6227 | else | |
6228 | all_buffers = buffer->next; | |
6229 | next = buffer->next; | |
34400008 | 6230 | lisp_free (buffer); |
7146af97 JB |
6231 | buffer = next; |
6232 | } | |
6233 | else | |
6234 | { | |
3ef06d12 | 6235 | VECTOR_UNMARK (buffer); |
30e3190a | 6236 | UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer)); |
7146af97 JB |
6237 | prev = buffer, buffer = buffer->next; |
6238 | } | |
6239 | } | |
6240 | ||
7146af97 JB |
6241 | /* Free all unmarked vectors */ |
6242 | { | |
6243 | register struct Lisp_Vector *vector = all_vectors, *prev = 0, *next; | |
6244 | total_vector_size = 0; | |
6245 | ||
6246 | while (vector) | |
3ef06d12 | 6247 | if (!VECTOR_MARKED_P (vector)) |
7146af97 JB |
6248 | { |
6249 | if (prev) | |
6250 | prev->next = vector->next; | |
6251 | else | |
6252 | all_vectors = vector->next; | |
6253 | next = vector->next; | |
c8099634 RS |
6254 | lisp_free (vector); |
6255 | n_vectors--; | |
7146af97 | 6256 | vector = next; |
41c28a37 | 6257 | |
7146af97 JB |
6258 | } |
6259 | else | |
6260 | { | |
3ef06d12 | 6261 | VECTOR_UNMARK (vector); |
fa05e253 RS |
6262 | if (vector->size & PSEUDOVECTOR_FLAG) |
6263 | total_vector_size += (PSEUDOVECTOR_SIZE_MASK & vector->size); | |
6264 | else | |
6265 | total_vector_size += vector->size; | |
7146af97 JB |
6266 | prev = vector, vector = vector->next; |
6267 | } | |
6268 | } | |
177c0ea7 | 6269 | |
676a7251 GM |
6270 | #ifdef GC_CHECK_STRING_BYTES |
6271 | if (!noninteractive) | |
6272 | check_string_bytes (1); | |
6273 | #endif | |
7146af97 | 6274 | } |
7146af97 | 6275 | |
7146af97 | 6276 | |
7146af97 | 6277 | |
7146af97 | 6278 | \f |
20d24714 JB |
6279 | /* Debugging aids. */ |
6280 | ||
31ce1c91 | 6281 | DEFUN ("memory-limit", Fmemory_limit, Smemory_limit, 0, 0, 0, |
a6266d23 | 6282 | doc: /* Return the address of the last byte Emacs has allocated, divided by 1024. |
228299fa | 6283 | This may be helpful in debugging Emacs's memory usage. |
7ee72033 MB |
6284 | We divide the value by 1024 to make sure it fits in a Lisp integer. */) |
6285 | () | |
20d24714 JB |
6286 | { |
6287 | Lisp_Object end; | |
6288 | ||
45d12a89 | 6289 | XSETINT (end, (EMACS_INT) sbrk (0) / 1024); |
20d24714 JB |
6290 | |
6291 | return end; | |
6292 | } | |
6293 | ||
310ea200 | 6294 | DEFUN ("memory-use-counts", Fmemory_use_counts, Smemory_use_counts, 0, 0, 0, |
a6266d23 | 6295 | doc: /* Return a list of counters that measure how much consing there has been. |
228299fa GM |
6296 | Each of these counters increments for a certain kind of object. |
6297 | The counters wrap around from the largest positive integer to zero. | |
6298 | Garbage collection does not decrease them. | |
6299 | The elements of the value are as follows: | |
6300 | (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS) | |
6301 | All are in units of 1 = one object consed | |
6302 | except for VECTOR-CELLS and STRING-CHARS, which count the total length of | |
6303 | objects consed. | |
6304 | MISCS include overlays, markers, and some internal types. | |
6305 | Frames, windows, buffers, and subprocesses count as vectors | |
7ee72033 MB |
6306 | (but the contents of a buffer's text do not count here). */) |
6307 | () | |
310ea200 | 6308 | { |
2e471eb5 | 6309 | Lisp_Object consed[8]; |
310ea200 | 6310 | |
78e985eb GM |
6311 | consed[0] = make_number (min (MOST_POSITIVE_FIXNUM, cons_cells_consed)); |
6312 | consed[1] = make_number (min (MOST_POSITIVE_FIXNUM, floats_consed)); | |
6313 | consed[2] = make_number (min (MOST_POSITIVE_FIXNUM, vector_cells_consed)); | |
6314 | consed[3] = make_number (min (MOST_POSITIVE_FIXNUM, symbols_consed)); | |
6315 | consed[4] = make_number (min (MOST_POSITIVE_FIXNUM, string_chars_consed)); | |
6316 | consed[5] = make_number (min (MOST_POSITIVE_FIXNUM, misc_objects_consed)); | |
6317 | consed[6] = make_number (min (MOST_POSITIVE_FIXNUM, intervals_consed)); | |
6318 | consed[7] = make_number (min (MOST_POSITIVE_FIXNUM, strings_consed)); | |
310ea200 | 6319 | |
2e471eb5 | 6320 | return Flist (8, consed); |
310ea200 | 6321 | } |
e0b8c689 KR |
6322 | |
6323 | int suppress_checking; | |
6324 | void | |
6325 | die (msg, file, line) | |
6326 | const char *msg; | |
6327 | const char *file; | |
6328 | int line; | |
6329 | { | |
6330 | fprintf (stderr, "\r\nEmacs fatal error: %s:%d: %s\r\n", | |
6331 | file, line, msg); | |
6332 | abort (); | |
6333 | } | |
20d24714 | 6334 | \f |
7146af97 JB |
6335 | /* Initialization */ |
6336 | ||
dfcf069d | 6337 | void |
7146af97 JB |
6338 | init_alloc_once () |
6339 | { | |
6340 | /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */ | |
9e713715 GM |
6341 | purebeg = PUREBEG; |
6342 | pure_size = PURESIZE; | |
1f0b3fd2 | 6343 | pure_bytes_used = 0; |
e5bc14d4 | 6344 | pure_bytes_used_lisp = pure_bytes_used_non_lisp = 0; |
9e713715 GM |
6345 | pure_bytes_used_before_overflow = 0; |
6346 | ||
ab6780cd SM |
6347 | /* Initialize the list of free aligned blocks. */ |
6348 | free_ablock = NULL; | |
6349 | ||
877935b1 | 6350 | #if GC_MARK_STACK || defined GC_MALLOC_CHECK |
34400008 GM |
6351 | mem_init (); |
6352 | Vdead = make_pure_string ("DEAD", 4, 4, 0); | |
6353 | #endif | |
9e713715 | 6354 | |
7146af97 JB |
6355 | all_vectors = 0; |
6356 | ignore_warnings = 1; | |
d1658221 RS |
6357 | #ifdef DOUG_LEA_MALLOC |
6358 | mallopt (M_TRIM_THRESHOLD, 128*1024); /* trim threshold */ | |
6359 | mallopt (M_MMAP_THRESHOLD, 64*1024); /* mmap threshold */ | |
81d492d5 | 6360 | mallopt (M_MMAP_MAX, MMAP_MAX_AREAS); /* max. number of mmap'ed areas */ |
d1658221 | 6361 | #endif |
7146af97 JB |
6362 | init_strings (); |
6363 | init_cons (); | |
6364 | init_symbol (); | |
6365 | init_marker (); | |
7146af97 | 6366 | init_float (); |
34400008 | 6367 | init_intervals (); |
d5e35230 | 6368 | |
276cbe5a RS |
6369 | #ifdef REL_ALLOC |
6370 | malloc_hysteresis = 32; | |
6371 | #else | |
6372 | malloc_hysteresis = 0; | |
6373 | #endif | |
6374 | ||
24d8a105 | 6375 | refill_memory_reserve (); |
276cbe5a | 6376 | |
7146af97 JB |
6377 | ignore_warnings = 0; |
6378 | gcprolist = 0; | |
630686c8 | 6379 | byte_stack_list = 0; |
7146af97 JB |
6380 | staticidx = 0; |
6381 | consing_since_gc = 0; | |
7d179cea | 6382 | gc_cons_threshold = 100000 * sizeof (Lisp_Object); |
974aae61 RS |
6383 | gc_relative_threshold = 0; |
6384 | ||
7146af97 JB |
6385 | #ifdef VIRT_ADDR_VARIES |
6386 | malloc_sbrk_unused = 1<<22; /* A large number */ | |
6387 | malloc_sbrk_used = 100000; /* as reasonable as any number */ | |
6388 | #endif /* VIRT_ADDR_VARIES */ | |
6389 | } | |
6390 | ||
dfcf069d | 6391 | void |
7146af97 JB |
6392 | init_alloc () |
6393 | { | |
6394 | gcprolist = 0; | |
630686c8 | 6395 | byte_stack_list = 0; |
182ff242 GM |
6396 | #if GC_MARK_STACK |
6397 | #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS | |
6398 | setjmp_tested_p = longjmps_done = 0; | |
6399 | #endif | |
6400 | #endif | |
2c5bd608 DL |
6401 | Vgc_elapsed = make_float (0.0); |
6402 | gcs_done = 0; | |
7146af97 JB |
6403 | } |
6404 | ||
6405 | void | |
6406 | syms_of_alloc () | |
6407 | { | |
7ee72033 | 6408 | DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold, |
a6266d23 | 6409 | doc: /* *Number of bytes of consing between garbage collections. |
228299fa GM |
6410 | Garbage collection can happen automatically once this many bytes have been |
6411 | allocated since the last garbage collection. All data types count. | |
7146af97 | 6412 | |
228299fa | 6413 | Garbage collection happens automatically only when `eval' is called. |
7146af97 | 6414 | |
228299fa | 6415 | By binding this temporarily to a large number, you can effectively |
96f077ad SM |
6416 | prevent garbage collection during a part of the program. |
6417 | See also `gc-cons-percentage'. */); | |
6418 | ||
6419 | DEFVAR_LISP ("gc-cons-percentage", &Vgc_cons_percentage, | |
6420 | doc: /* *Portion of the heap used for allocation. | |
6421 | Garbage collection can happen automatically once this portion of the heap | |
6422 | has been allocated since the last garbage collection. | |
6423 | If this portion is smaller than `gc-cons-threshold', this is ignored. */); | |
6424 | Vgc_cons_percentage = make_float (0.1); | |
0819585c | 6425 | |
7ee72033 | 6426 | DEFVAR_INT ("pure-bytes-used", &pure_bytes_used, |
a6266d23 | 6427 | doc: /* Number of bytes of sharable Lisp data allocated so far. */); |
0819585c | 6428 | |
7ee72033 | 6429 | DEFVAR_INT ("cons-cells-consed", &cons_cells_consed, |
a6266d23 | 6430 | doc: /* Number of cons cells that have been consed so far. */); |
0819585c | 6431 | |
7ee72033 | 6432 | DEFVAR_INT ("floats-consed", &floats_consed, |
a6266d23 | 6433 | doc: /* Number of floats that have been consed so far. */); |
0819585c | 6434 | |
7ee72033 | 6435 | DEFVAR_INT ("vector-cells-consed", &vector_cells_consed, |
a6266d23 | 6436 | doc: /* Number of vector cells that have been consed so far. */); |
0819585c | 6437 | |
7ee72033 | 6438 | DEFVAR_INT ("symbols-consed", &symbols_consed, |
a6266d23 | 6439 | doc: /* Number of symbols that have been consed so far. */); |
0819585c | 6440 | |
7ee72033 | 6441 | DEFVAR_INT ("string-chars-consed", &string_chars_consed, |
a6266d23 | 6442 | doc: /* Number of string characters that have been consed so far. */); |
0819585c | 6443 | |
7ee72033 | 6444 | DEFVAR_INT ("misc-objects-consed", &misc_objects_consed, |
a6266d23 | 6445 | doc: /* Number of miscellaneous objects that have been consed so far. */); |
2e471eb5 | 6446 | |
7ee72033 | 6447 | DEFVAR_INT ("intervals-consed", &intervals_consed, |
a6266d23 | 6448 | doc: /* Number of intervals that have been consed so far. */); |
7146af97 | 6449 | |
7ee72033 | 6450 | DEFVAR_INT ("strings-consed", &strings_consed, |
a6266d23 | 6451 | doc: /* Number of strings that have been consed so far. */); |
228299fa | 6452 | |
7ee72033 | 6453 | DEFVAR_LISP ("purify-flag", &Vpurify_flag, |
a6266d23 | 6454 | doc: /* Non-nil means loading Lisp code in order to dump an executable. |
228299fa GM |
6455 | This means that certain objects should be allocated in shared (pure) space. */); |
6456 | ||
7ee72033 | 6457 | DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages, |
a6266d23 | 6458 | doc: /* Non-nil means display messages at start and end of garbage collection. */); |
299585ee RS |
6459 | garbage_collection_messages = 0; |
6460 | ||
7ee72033 | 6461 | DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook, |
a6266d23 | 6462 | doc: /* Hook run after garbage collection has finished. */); |
9e713715 GM |
6463 | Vpost_gc_hook = Qnil; |
6464 | Qpost_gc_hook = intern ("post-gc-hook"); | |
6465 | staticpro (&Qpost_gc_hook); | |
6466 | ||
74a54b04 RS |
6467 | DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data, |
6468 | doc: /* Precomputed `signal' argument for memory-full error. */); | |
bcb61d60 KH |
6469 | /* We build this in advance because if we wait until we need it, we might |
6470 | not be able to allocate the memory to hold it. */ | |
74a54b04 RS |
6471 | Vmemory_signal_data |
6472 | = list2 (Qerror, | |
6473 | build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs")); | |
6474 | ||
6475 | DEFVAR_LISP ("memory-full", &Vmemory_full, | |
24d8a105 | 6476 | doc: /* Non-nil means Emacs cannot get much more Lisp memory. */); |
74a54b04 | 6477 | Vmemory_full = Qnil; |
bcb61d60 | 6478 | |
e8197642 RS |
6479 | staticpro (&Qgc_cons_threshold); |
6480 | Qgc_cons_threshold = intern ("gc-cons-threshold"); | |
6481 | ||
a59de17b RS |
6482 | staticpro (&Qchar_table_extra_slots); |
6483 | Qchar_table_extra_slots = intern ("char-table-extra-slots"); | |
6484 | ||
2c5bd608 DL |
6485 | DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed, |
6486 | doc: /* Accumulated time elapsed in garbage collections. | |
e7415487 | 6487 | The time is in seconds as a floating point value. */); |
2c5bd608 | 6488 | DEFVAR_INT ("gcs-done", &gcs_done, |
e7415487 | 6489 | doc: /* Accumulated number of garbage collections done. */); |
2c5bd608 | 6490 | |
7146af97 JB |
6491 | defsubr (&Scons); |
6492 | defsubr (&Slist); | |
6493 | defsubr (&Svector); | |
6494 | defsubr (&Smake_byte_code); | |
6495 | defsubr (&Smake_list); | |
6496 | defsubr (&Smake_vector); | |
7b07587b | 6497 | defsubr (&Smake_char_table); |
7146af97 | 6498 | defsubr (&Smake_string); |
7b07587b | 6499 | defsubr (&Smake_bool_vector); |
7146af97 JB |
6500 | defsubr (&Smake_symbol); |
6501 | defsubr (&Smake_marker); | |
6502 | defsubr (&Spurecopy); | |
6503 | defsubr (&Sgarbage_collect); | |
20d24714 | 6504 | defsubr (&Smemory_limit); |
310ea200 | 6505 | defsubr (&Smemory_use_counts); |
34400008 GM |
6506 | |
6507 | #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES | |
6508 | defsubr (&Sgc_status); | |
6509 | #endif | |
7146af97 | 6510 | } |
ab5796a9 MB |
6511 | |
6512 | /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857 | |
6513 | (do not change this comment) */ |