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