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