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