1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
3 Copyright (C) 1985-1986, 1988, 1993-1995, 1997-2014 Free Software
6 This file is part of GNU Emacs.
8 GNU Emacs is free software: you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation, either version 3 of the License, or
11 (at your option) any later version.
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.
18 You should have received a copy of the GNU General Public License
19 along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>. */
24 #include <limits.h> /* For CHAR_BIT. */
26 #ifdef ENABLE_CHECKING
27 #include <signal.h> /* For SIGABRT. */
36 #include "intervals.h"
38 #include "character.h"
43 #include "blockinput.h"
44 #include "termhooks.h" /* For struct terminal. */
45 #ifdef HAVE_WINDOW_SYSTEM
47 #endif /* HAVE_WINDOW_SYSTEM */
50 #include <execinfo.h> /* For backtrace. */
52 #ifdef HAVE_LINUX_SYSINFO
53 #include <sys/sysinfo.h>
56 #if (defined ENABLE_CHECKING \
57 && defined HAVE_VALGRIND_VALGRIND_H \
58 && !defined USE_VALGRIND)
59 # define USE_VALGRIND 1
63 #include <valgrind/valgrind.h>
64 #include <valgrind/memcheck.h>
65 static bool valgrind_p
;
68 /* GC_CHECK_MARKED_OBJECTS means do sanity checks on allocated objects.
69 Doable only if GC_MARK_STACK. */
71 # undef GC_CHECK_MARKED_OBJECTS
74 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
75 memory. Can do this only if using gmalloc.c and if not checking
78 #if (defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC \
79 || defined GC_CHECK_MARKED_OBJECTS)
80 #undef GC_MALLOC_CHECK
91 #include "w32heap.h" /* for sbrk */
94 #ifdef DOUG_LEA_MALLOC
98 /* Specify maximum number of areas to mmap. It would be nice to use a
99 value that explicitly means "no limit". */
101 #define MMAP_MAX_AREAS 100000000
103 #endif /* not DOUG_LEA_MALLOC */
105 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
106 to a struct Lisp_String. */
108 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
109 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
110 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
112 #define VECTOR_MARK(V) ((V)->header.size |= ARRAY_MARK_FLAG)
113 #define VECTOR_UNMARK(V) ((V)->header.size &= ~ARRAY_MARK_FLAG)
114 #define VECTOR_MARKED_P(V) (((V)->header.size & ARRAY_MARK_FLAG) != 0)
116 /* Default value of gc_cons_threshold (see below). */
118 #define GC_DEFAULT_THRESHOLD (100000 * word_size)
120 /* Global variables. */
121 struct emacs_globals globals
;
123 /* Number of bytes of consing done since the last gc. */
125 EMACS_INT consing_since_gc
;
127 /* Similar minimum, computed from Vgc_cons_percentage. */
129 EMACS_INT gc_relative_threshold
;
131 /* Minimum number of bytes of consing since GC before next GC,
132 when memory is full. */
134 EMACS_INT memory_full_cons_threshold
;
136 /* True during GC. */
140 /* True means abort if try to GC.
141 This is for code which is written on the assumption that
142 no GC will happen, so as to verify that assumption. */
146 /* Number of live and free conses etc. */
148 static EMACS_INT total_conses
, total_markers
, total_symbols
, total_buffers
;
149 static EMACS_INT total_free_conses
, total_free_markers
, total_free_symbols
;
150 static EMACS_INT total_free_floats
, total_floats
;
152 /* Points to memory space allocated as "spare", to be freed if we run
153 out of memory. We keep one large block, four cons-blocks, and
154 two string blocks. */
156 static char *spare_memory
[7];
158 /* Amount of spare memory to keep in large reserve block, or to see
159 whether this much is available when malloc fails on a larger request. */
161 #define SPARE_MEMORY (1 << 14)
163 /* Initialize it to a nonzero value to force it into data space
164 (rather than bss space). That way unexec will remap it into text
165 space (pure), on some systems. We have not implemented the
166 remapping on more recent systems because this is less important
167 nowadays than in the days of small memories and timesharing. */
169 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
170 #define PUREBEG (char *) pure
172 /* Pointer to the pure area, and its size. */
174 static char *purebeg
;
175 static ptrdiff_t pure_size
;
177 /* Number of bytes of pure storage used before pure storage overflowed.
178 If this is non-zero, this implies that an overflow occurred. */
180 static ptrdiff_t pure_bytes_used_before_overflow
;
182 /* True if P points into pure space. */
184 #define PURE_POINTER_P(P) \
185 ((uintptr_t) (P) - (uintptr_t) purebeg <= pure_size)
187 /* Index in pure at which next pure Lisp object will be allocated.. */
189 static ptrdiff_t pure_bytes_used_lisp
;
191 /* Number of bytes allocated for non-Lisp objects in pure storage. */
193 static ptrdiff_t pure_bytes_used_non_lisp
;
195 /* If nonzero, this is a warning delivered by malloc and not yet
198 const char *pending_malloc_warning
;
200 #if 0 /* Normally, pointer sanity only on request... */
201 #ifdef ENABLE_CHECKING
202 #define SUSPICIOUS_OBJECT_CHECKING 1
206 /* ... but unconditionally use SUSPICIOUS_OBJECT_CHECKING while the GC
207 bug is unresolved. */
208 #define SUSPICIOUS_OBJECT_CHECKING 1
210 #ifdef SUSPICIOUS_OBJECT_CHECKING
211 struct suspicious_free_record
213 void *suspicious_object
;
214 void *backtrace
[128];
216 static void *suspicious_objects
[32];
217 static int suspicious_object_index
;
218 struct suspicious_free_record suspicious_free_history
[64] EXTERNALLY_VISIBLE
;
219 static int suspicious_free_history_index
;
220 /* Find the first currently-monitored suspicious pointer in range
221 [begin,end) or NULL if no such pointer exists. */
222 static void *find_suspicious_object_in_range (void *begin
, void *end
);
223 static void detect_suspicious_free (void *ptr
);
225 # define find_suspicious_object_in_range(begin, end) NULL
226 # define detect_suspicious_free(ptr) (void)
229 /* Maximum amount of C stack to save when a GC happens. */
231 #ifndef MAX_SAVE_STACK
232 #define MAX_SAVE_STACK 16000
235 /* Buffer in which we save a copy of the C stack at each GC. */
237 #if MAX_SAVE_STACK > 0
238 static char *stack_copy
;
239 static ptrdiff_t stack_copy_size
;
241 /* Copy to DEST a block of memory from SRC of size SIZE bytes,
242 avoiding any address sanitization. */
244 static void * ATTRIBUTE_NO_SANITIZE_ADDRESS
245 no_sanitize_memcpy (void *dest
, void const *src
, size_t size
)
247 if (! ADDRESS_SANITIZER
)
248 return memcpy (dest
, src
, size
);
254 for (i
= 0; i
< size
; i
++)
260 #endif /* MAX_SAVE_STACK > 0 */
262 static Lisp_Object Qconses
;
263 static Lisp_Object Qsymbols
;
264 static Lisp_Object Qmiscs
;
265 static Lisp_Object Qstrings
;
266 static Lisp_Object Qvectors
;
267 static Lisp_Object Qfloats
;
268 static Lisp_Object Qintervals
;
269 static Lisp_Object Qbuffers
;
270 static Lisp_Object Qstring_bytes
, Qvector_slots
, Qheap
;
271 static Lisp_Object Qgc_cons_threshold
;
272 Lisp_Object Qautomatic_gc
;
273 Lisp_Object Qchar_table_extra_slots
;
275 /* Hook run after GC has finished. */
277 static Lisp_Object Qpost_gc_hook
;
279 static void mark_terminals (void);
280 static void gc_sweep (void);
281 static Lisp_Object
make_pure_vector (ptrdiff_t);
282 static void mark_buffer (struct buffer
*);
284 #if !defined REL_ALLOC || defined SYSTEM_MALLOC
285 static void refill_memory_reserve (void);
287 static void compact_small_strings (void);
288 static void free_large_strings (void);
289 extern Lisp_Object
which_symbols (Lisp_Object
, EMACS_INT
) EXTERNALLY_VISIBLE
;
291 /* When scanning the C stack for live Lisp objects, Emacs keeps track of
292 what memory allocated via lisp_malloc and lisp_align_malloc is intended
293 for what purpose. This enumeration specifies the type of memory. */
304 /* Since all non-bool pseudovectors are small enough to be
305 allocated from vector blocks, this memory type denotes
306 large regular vectors and large bool pseudovectors. */
308 /* Special type to denote vector blocks. */
309 MEM_TYPE_VECTOR_BLOCK
,
310 /* Special type to denote reserved memory. */
314 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
316 /* A unique object in pure space used to make some Lisp objects
317 on free lists recognizable in O(1). */
319 static Lisp_Object Vdead
;
320 #define DEADP(x) EQ (x, Vdead)
322 #ifdef GC_MALLOC_CHECK
324 enum mem_type allocated_mem_type
;
326 #endif /* GC_MALLOC_CHECK */
328 /* A node in the red-black tree describing allocated memory containing
329 Lisp data. Each such block is recorded with its start and end
330 address when it is allocated, and removed from the tree when it
333 A red-black tree is a balanced binary tree with the following
336 1. Every node is either red or black.
337 2. Every leaf is black.
338 3. If a node is red, then both of its children are black.
339 4. Every simple path from a node to a descendant leaf contains
340 the same number of black nodes.
341 5. The root is always black.
343 When nodes are inserted into the tree, or deleted from the tree,
344 the tree is "fixed" so that these properties are always true.
346 A red-black tree with N internal nodes has height at most 2
347 log(N+1). Searches, insertions and deletions are done in O(log N).
348 Please see a text book about data structures for a detailed
349 description of red-black trees. Any book worth its salt should
354 /* Children of this node. These pointers are never NULL. When there
355 is no child, the value is MEM_NIL, which points to a dummy node. */
356 struct mem_node
*left
, *right
;
358 /* The parent of this node. In the root node, this is NULL. */
359 struct mem_node
*parent
;
361 /* Start and end of allocated region. */
365 enum {MEM_BLACK
, MEM_RED
} color
;
371 /* Base address of stack. Set in main. */
373 Lisp_Object
*stack_base
;
375 /* Root of the tree describing allocated Lisp memory. */
377 static struct mem_node
*mem_root
;
379 /* Lowest and highest known address in the heap. */
381 static void *min_heap_address
, *max_heap_address
;
383 /* Sentinel node of the tree. */
385 static struct mem_node mem_z
;
386 #define MEM_NIL &mem_z
388 static struct mem_node
*mem_insert (void *, void *, enum mem_type
);
389 static void mem_insert_fixup (struct mem_node
*);
390 static void mem_rotate_left (struct mem_node
*);
391 static void mem_rotate_right (struct mem_node
*);
392 static void mem_delete (struct mem_node
*);
393 static void mem_delete_fixup (struct mem_node
*);
394 static struct mem_node
*mem_find (void *);
396 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
402 /* Recording what needs to be marked for gc. */
404 struct gcpro
*gcprolist
;
406 /* Addresses of staticpro'd variables. Initialize it to a nonzero
407 value; otherwise some compilers put it into BSS. */
409 enum { NSTATICS
= 2048 };
410 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
412 /* Index of next unused slot in staticvec. */
414 static int staticidx
;
416 static void *pure_alloc (size_t, int);
418 /* Return X rounded to the next multiple of Y. Arguments should not
419 have side effects, as they are evaluated more than once. Assume X
420 + Y - 1 does not overflow. Tune for Y being a power of 2. */
422 #define ROUNDUP(x, y) ((y) & ((y) - 1) \
423 ? ((x) + (y) - 1) - ((x) + (y) - 1) % (y) \
424 : ((x) + (y) - 1) & ~ ((y) - 1))
426 /* Return PTR rounded up to the next multiple of ALIGNMENT. */
429 ALIGN (void *ptr
, int alignment
)
431 return (void *) ROUNDUP ((uintptr_t) ptr
, alignment
);
435 XFLOAT_INIT (Lisp_Object f
, double n
)
437 XFLOAT (f
)->u
.data
= n
;
441 pointers_fit_in_lispobj_p (void)
443 return (UINTPTR_MAX
<= VAL_MAX
) || USE_LSB_TAG
;
447 mmap_lisp_allowed_p (void)
449 /* If we can't store all memory addresses in our lisp objects, it's
450 risky to let the heap use mmap and give us addresses from all
451 over our address space. We also can't use mmap for lisp objects
452 if we might dump: unexec doesn't preserve the contents of mmaped
454 return pointers_fit_in_lispobj_p () && !might_dump
;
458 /************************************************************************
460 ************************************************************************/
462 /* Function malloc calls this if it finds we are near exhausting storage. */
465 malloc_warning (const char *str
)
467 pending_malloc_warning
= str
;
471 /* Display an already-pending malloc warning. */
474 display_malloc_warning (void)
476 call3 (intern ("display-warning"),
478 build_string (pending_malloc_warning
),
479 intern ("emergency"));
480 pending_malloc_warning
= 0;
483 /* Called if we can't allocate relocatable space for a buffer. */
486 buffer_memory_full (ptrdiff_t nbytes
)
488 /* If buffers use the relocating allocator, no need to free
489 spare_memory, because we may have plenty of malloc space left
490 that we could get, and if we don't, the malloc that fails will
491 itself cause spare_memory to be freed. If buffers don't use the
492 relocating allocator, treat this like any other failing
496 memory_full (nbytes
);
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. */
500 xsignal (Qnil
, Vmemory_signal_data
);
504 /* A common multiple of the positive integers A and B. Ideally this
505 would be the least common multiple, but there's no way to do that
506 as a constant expression in C, so do the best that we can easily do. */
507 #define COMMON_MULTIPLE(a, b) \
508 ((a) % (b) == 0 ? (a) : (b) % (a) == 0 ? (b) : (a) * (b))
510 #ifndef XMALLOC_OVERRUN_CHECK
511 #define XMALLOC_OVERRUN_CHECK_OVERHEAD 0
514 /* Check for overrun in malloc'ed buffers by wrapping a header and trailer
517 The header consists of XMALLOC_OVERRUN_CHECK_SIZE fixed bytes
518 followed by XMALLOC_OVERRUN_SIZE_SIZE bytes containing the original
519 block size in little-endian order. The trailer consists of
520 XMALLOC_OVERRUN_CHECK_SIZE fixed bytes.
522 The header is used to detect whether this block has been allocated
523 through these functions, as some low-level libc functions may
524 bypass the malloc hooks. */
526 #define XMALLOC_OVERRUN_CHECK_SIZE 16
527 #define XMALLOC_OVERRUN_CHECK_OVERHEAD \
528 (2 * XMALLOC_OVERRUN_CHECK_SIZE + XMALLOC_OVERRUN_SIZE_SIZE)
530 /* Define XMALLOC_OVERRUN_SIZE_SIZE so that (1) it's large enough to
531 hold a size_t value and (2) the header size is a multiple of the
532 alignment that Emacs needs for C types and for USE_LSB_TAG. */
533 #define XMALLOC_BASE_ALIGNMENT \
534 alignof (union { long double d; intmax_t i; void *p; })
537 # define XMALLOC_HEADER_ALIGNMENT \
538 COMMON_MULTIPLE (GCALIGNMENT, XMALLOC_BASE_ALIGNMENT)
540 # define XMALLOC_HEADER_ALIGNMENT XMALLOC_BASE_ALIGNMENT
542 #define XMALLOC_OVERRUN_SIZE_SIZE \
543 (((XMALLOC_OVERRUN_CHECK_SIZE + sizeof (size_t) \
544 + XMALLOC_HEADER_ALIGNMENT - 1) \
545 / XMALLOC_HEADER_ALIGNMENT * XMALLOC_HEADER_ALIGNMENT) \
546 - XMALLOC_OVERRUN_CHECK_SIZE)
548 static char const xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
] =
549 { '\x9a', '\x9b', '\xae', '\xaf',
550 '\xbf', '\xbe', '\xce', '\xcf',
551 '\xea', '\xeb', '\xec', '\xed',
552 '\xdf', '\xde', '\x9c', '\x9d' };
554 static char const xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
555 { '\xaa', '\xab', '\xac', '\xad',
556 '\xba', '\xbb', '\xbc', '\xbd',
557 '\xca', '\xcb', '\xcc', '\xcd',
558 '\xda', '\xdb', '\xdc', '\xdd' };
560 /* Insert and extract the block size in the header. */
563 xmalloc_put_size (unsigned char *ptr
, size_t size
)
566 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
568 *--ptr
= size
& ((1 << CHAR_BIT
) - 1);
574 xmalloc_get_size (unsigned char *ptr
)
578 ptr
-= XMALLOC_OVERRUN_SIZE_SIZE
;
579 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
588 /* Like malloc, but wraps allocated block with header and trailer. */
591 overrun_check_malloc (size_t size
)
593 register unsigned char *val
;
594 if (SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
< size
)
597 val
= malloc (size
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
600 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
601 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
602 xmalloc_put_size (val
, size
);
603 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
604 XMALLOC_OVERRUN_CHECK_SIZE
);
610 /* Like realloc, but checks old block for overrun, and wraps new block
611 with header and trailer. */
614 overrun_check_realloc (void *block
, size_t size
)
616 register unsigned char *val
= (unsigned char *) block
;
617 if (SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
< size
)
621 && memcmp (xmalloc_overrun_check_header
,
622 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
623 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
625 size_t osize
= xmalloc_get_size (val
);
626 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
627 XMALLOC_OVERRUN_CHECK_SIZE
))
629 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
630 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
631 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
634 val
= realloc (val
, size
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
638 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
639 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
640 xmalloc_put_size (val
, size
);
641 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
642 XMALLOC_OVERRUN_CHECK_SIZE
);
647 /* Like free, but checks block for overrun. */
650 overrun_check_free (void *block
)
652 unsigned char *val
= (unsigned char *) block
;
655 && memcmp (xmalloc_overrun_check_header
,
656 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
657 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
659 size_t osize
= xmalloc_get_size (val
);
660 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
661 XMALLOC_OVERRUN_CHECK_SIZE
))
663 #ifdef XMALLOC_CLEAR_FREE_MEMORY
664 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
665 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
667 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
668 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
669 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
679 #define malloc overrun_check_malloc
680 #define realloc overrun_check_realloc
681 #define free overrun_check_free
684 /* If compiled with XMALLOC_BLOCK_INPUT_CHECK, define a symbol
685 BLOCK_INPUT_IN_MEMORY_ALLOCATORS that is visible to the debugger.
686 If that variable is set, block input while in one of Emacs's memory
687 allocation functions. There should be no need for this debugging
688 option, since signal handlers do not allocate memory, but Emacs
689 formerly allocated memory in signal handlers and this compile-time
690 option remains as a way to help debug the issue should it rear its
692 #ifdef XMALLOC_BLOCK_INPUT_CHECK
693 bool block_input_in_memory_allocators EXTERNALLY_VISIBLE
;
695 malloc_block_input (void)
697 if (block_input_in_memory_allocators
)
701 malloc_unblock_input (void)
703 if (block_input_in_memory_allocators
)
706 # define MALLOC_BLOCK_INPUT malloc_block_input ()
707 # define MALLOC_UNBLOCK_INPUT malloc_unblock_input ()
709 # define MALLOC_BLOCK_INPUT ((void) 0)
710 # define MALLOC_UNBLOCK_INPUT ((void) 0)
713 #define MALLOC_PROBE(size) \
715 if (profiler_memory_running) \
716 malloc_probe (size); \
720 /* Like malloc but check for no memory and block interrupt input.. */
723 xmalloc (size_t size
)
729 MALLOC_UNBLOCK_INPUT
;
737 /* Like the above, but zeroes out the memory just allocated. */
740 xzalloc (size_t size
)
746 MALLOC_UNBLOCK_INPUT
;
750 memset (val
, 0, size
);
755 /* Like realloc but check for no memory and block interrupt input.. */
758 xrealloc (void *block
, size_t size
)
763 /* We must call malloc explicitly when BLOCK is 0, since some
764 reallocs don't do this. */
768 val
= realloc (block
, size
);
769 MALLOC_UNBLOCK_INPUT
;
778 /* Like free but block interrupt input. */
787 MALLOC_UNBLOCK_INPUT
;
788 /* We don't call refill_memory_reserve here
789 because in practice the call in r_alloc_free seems to suffice. */
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
796 verify (INT_MAX
<= PTRDIFF_MAX
);
799 /* Allocate an array of NITEMS items, each of size ITEM_SIZE.
800 Signal an error on memory exhaustion, and block interrupt input. */
803 xnmalloc (ptrdiff_t nitems
, ptrdiff_t item_size
)
805 eassert (0 <= nitems
&& 0 < item_size
);
806 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
807 memory_full (SIZE_MAX
);
808 return xmalloc (nitems
* item_size
);
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. */
816 xnrealloc (void *pa
, ptrdiff_t nitems
, ptrdiff_t item_size
)
818 eassert (0 <= nitems
&& 0 < item_size
);
819 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
820 memory_full (SIZE_MAX
);
821 return xrealloc (pa
, nitems
* item_size
);
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.
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
835 If PA is null, then allocate a new array instead of reallocating
838 Block interrupt input as needed. If memory exhaustion occurs, set
839 *NITEMS to zero if PA is null, and signal an error (i.e., do not
842 Thus, to grow an array A without saving its old contents, do
843 { xfree (A); A = NULL; A = xpalloc (NULL, &AITEMS, ...); }.
844 The A = NULL avoids a dangling pointer if xpalloc exhausts memory
845 and signals an error, and later this code is reexecuted and
846 attempts to free A. */
849 xpalloc (void *pa
, ptrdiff_t *nitems
, ptrdiff_t nitems_incr_min
,
850 ptrdiff_t nitems_max
, ptrdiff_t item_size
)
852 /* The approximate size to use for initial small allocation
853 requests. This is the largest "small" request for the GNU C
855 enum { DEFAULT_MXFAST
= 64 * sizeof (size_t) / 4 };
857 /* If the array is tiny, grow it to about (but no greater than)
858 DEFAULT_MXFAST bytes. Otherwise, grow it by about 50%. */
859 ptrdiff_t n
= *nitems
;
860 ptrdiff_t tiny_max
= DEFAULT_MXFAST
/ item_size
- n
;
861 ptrdiff_t half_again
= n
>> 1;
862 ptrdiff_t incr_estimate
= max (tiny_max
, half_again
);
864 /* Adjust the increment according to three constraints: NITEMS_INCR_MIN,
865 NITEMS_MAX, and what the C language can represent safely. */
866 ptrdiff_t C_language_max
= min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
;
867 ptrdiff_t n_max
= (0 <= nitems_max
&& nitems_max
< C_language_max
868 ? nitems_max
: C_language_max
);
869 ptrdiff_t nitems_incr_max
= n_max
- n
;
870 ptrdiff_t incr
= max (nitems_incr_min
, min (incr_estimate
, nitems_incr_max
));
872 eassert (0 < item_size
&& 0 < nitems_incr_min
&& 0 <= n
&& -1 <= nitems_max
);
875 if (nitems_incr_max
< incr
)
876 memory_full (SIZE_MAX
);
878 pa
= xrealloc (pa
, n
* item_size
);
884 /* Like strdup, but uses xmalloc. */
887 xstrdup (const char *s
)
891 size
= strlen (s
) + 1;
892 return memcpy (xmalloc (size
), s
, size
);
895 /* Like above, but duplicates Lisp string to C string. */
898 xlispstrdup (Lisp_Object string
)
900 ptrdiff_t size
= SBYTES (string
) + 1;
901 return memcpy (xmalloc (size
), SSDATA (string
), size
);
904 /* Assign to *PTR a copy of STRING, freeing any storage *PTR formerly
905 pointed to. If STRING is null, assign it without copying anything.
906 Allocate before freeing, to avoid a dangling pointer if allocation
910 dupstring (char **ptr
, char const *string
)
913 *ptr
= string
? xstrdup (string
) : 0;
918 /* Like putenv, but (1) use the equivalent of xmalloc and (2) the
919 argument is a const pointer. */
922 xputenv (char const *string
)
924 if (putenv ((char *) string
) != 0)
928 /* Return a newly allocated memory block of SIZE bytes, remembering
929 to free it when unwinding. */
931 record_xmalloc (size_t size
)
933 void *p
= xmalloc (size
);
934 record_unwind_protect_ptr (xfree
, p
);
939 /* Like malloc but used for allocating Lisp data. NBYTES is the
940 number of bytes to allocate, TYPE describes the intended use of the
941 allocated memory block (for strings, for conses, ...). */
944 void *lisp_malloc_loser EXTERNALLY_VISIBLE
;
948 lisp_malloc (size_t nbytes
, enum mem_type type
)
954 #ifdef GC_MALLOC_CHECK
955 allocated_mem_type
= type
;
958 val
= malloc (nbytes
);
961 /* If the memory just allocated cannot be addressed thru a Lisp
962 object's pointer, and it needs to be,
963 that's equivalent to running out of memory. */
964 if (val
&& type
!= MEM_TYPE_NON_LISP
)
967 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
968 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
970 lisp_malloc_loser
= val
;
977 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
978 if (val
&& type
!= MEM_TYPE_NON_LISP
)
979 mem_insert (val
, (char *) val
+ nbytes
, type
);
982 MALLOC_UNBLOCK_INPUT
;
984 memory_full (nbytes
);
985 MALLOC_PROBE (nbytes
);
989 /* Free BLOCK. This must be called to free memory allocated with a
990 call to lisp_malloc. */
993 lisp_free (void *block
)
997 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
998 mem_delete (mem_find (block
));
1000 MALLOC_UNBLOCK_INPUT
;
1003 /***** Allocation of aligned blocks of memory to store Lisp data. *****/
1005 /* The entry point is lisp_align_malloc which returns blocks of at most
1006 BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
1008 /* Use aligned_alloc if it or a simple substitute is available.
1009 Address sanitization breaks aligned allocation, as of gcc 4.8.2 and
1010 clang 3.3 anyway. */
1012 #if ! ADDRESS_SANITIZER
1013 # if !defined SYSTEM_MALLOC && !defined DOUG_LEA_MALLOC
1014 # define USE_ALIGNED_ALLOC 1
1015 /* Defined in gmalloc.c. */
1016 void *aligned_alloc (size_t, size_t);
1017 # elif defined HAVE_ALIGNED_ALLOC
1018 # define USE_ALIGNED_ALLOC 1
1019 # elif defined HAVE_POSIX_MEMALIGN
1020 # define USE_ALIGNED_ALLOC 1
1022 aligned_alloc (size_t alignment
, size_t size
)
1025 return posix_memalign (&p
, alignment
, size
) == 0 ? p
: 0;
1030 /* BLOCK_ALIGN has to be a power of 2. */
1031 #define BLOCK_ALIGN (1 << 10)
1033 /* Padding to leave at the end of a malloc'd block. This is to give
1034 malloc a chance to minimize the amount of memory wasted to alignment.
1035 It should be tuned to the particular malloc library used.
1036 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
1037 aligned_alloc on the other hand would ideally prefer a value of 4
1038 because otherwise, there's 1020 bytes wasted between each ablocks.
1039 In Emacs, testing shows that those 1020 can most of the time be
1040 efficiently used by malloc to place other objects, so a value of 0 can
1041 still preferable unless you have a lot of aligned blocks and virtually
1043 #define BLOCK_PADDING 0
1044 #define BLOCK_BYTES \
1045 (BLOCK_ALIGN - sizeof (struct ablocks *) - BLOCK_PADDING)
1047 /* Internal data structures and constants. */
1049 #define ABLOCKS_SIZE 16
1051 /* An aligned block of memory. */
1056 char payload
[BLOCK_BYTES
];
1057 struct ablock
*next_free
;
1059 /* `abase' is the aligned base of the ablocks. */
1060 /* It is overloaded to hold the virtual `busy' field that counts
1061 the number of used ablock in the parent ablocks.
1062 The first ablock has the `busy' field, the others have the `abase'
1063 field. To tell the difference, we assume that pointers will have
1064 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
1065 is used to tell whether the real base of the parent ablocks is `abase'
1066 (if not, the word before the first ablock holds a pointer to the
1068 struct ablocks
*abase
;
1069 /* The padding of all but the last ablock is unused. The padding of
1070 the last ablock in an ablocks is not allocated. */
1072 char padding
[BLOCK_PADDING
];
1076 /* A bunch of consecutive aligned blocks. */
1079 struct ablock blocks
[ABLOCKS_SIZE
];
1082 /* Size of the block requested from malloc or aligned_alloc. */
1083 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
1085 #define ABLOCK_ABASE(block) \
1086 (((uintptr_t) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
1087 ? (struct ablocks *)(block) \
1090 /* Virtual `busy' field. */
1091 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
1093 /* Pointer to the (not necessarily aligned) malloc block. */
1094 #ifdef USE_ALIGNED_ALLOC
1095 #define ABLOCKS_BASE(abase) (abase)
1097 #define ABLOCKS_BASE(abase) \
1098 (1 & (intptr_t) ABLOCKS_BUSY (abase) ? abase : ((void **)abase)[-1])
1101 /* The list of free ablock. */
1102 static struct ablock
*free_ablock
;
1104 /* Allocate an aligned block of nbytes.
1105 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
1106 smaller or equal to BLOCK_BYTES. */
1108 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
1111 struct ablocks
*abase
;
1113 eassert (nbytes
<= BLOCK_BYTES
);
1117 #ifdef GC_MALLOC_CHECK
1118 allocated_mem_type
= type
;
1124 intptr_t aligned
; /* int gets warning casting to 64-bit pointer. */
1126 #ifdef DOUG_LEA_MALLOC
1127 if (!mmap_lisp_allowed_p ())
1128 mallopt (M_MMAP_MAX
, 0);
1131 #ifdef USE_ALIGNED_ALLOC
1132 abase
= base
= aligned_alloc (BLOCK_ALIGN
, ABLOCKS_BYTES
);
1134 base
= malloc (ABLOCKS_BYTES
);
1135 abase
= ALIGN (base
, BLOCK_ALIGN
);
1140 MALLOC_UNBLOCK_INPUT
;
1141 memory_full (ABLOCKS_BYTES
);
1144 aligned
= (base
== abase
);
1146 ((void **) abase
)[-1] = base
;
1148 #ifdef DOUG_LEA_MALLOC
1149 if (!mmap_lisp_allowed_p ())
1150 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1154 /* If the memory just allocated cannot be addressed thru a Lisp
1155 object's pointer, and it needs to be, that's equivalent to
1156 running out of memory. */
1157 if (type
!= MEM_TYPE_NON_LISP
)
1160 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1161 XSETCONS (tem
, end
);
1162 if ((char *) XCONS (tem
) != end
)
1164 lisp_malloc_loser
= base
;
1166 MALLOC_UNBLOCK_INPUT
;
1167 memory_full (SIZE_MAX
);
1172 /* Initialize the blocks and put them on the free list.
1173 If `base' was not properly aligned, we can't use the last block. */
1174 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1176 abase
->blocks
[i
].abase
= abase
;
1177 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1178 free_ablock
= &abase
->blocks
[i
];
1180 ABLOCKS_BUSY (abase
) = (struct ablocks
*) aligned
;
1182 eassert (0 == ((uintptr_t) abase
) % BLOCK_ALIGN
);
1183 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1184 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1185 eassert (ABLOCKS_BASE (abase
) == base
);
1186 eassert (aligned
== (intptr_t) ABLOCKS_BUSY (abase
));
1189 abase
= ABLOCK_ABASE (free_ablock
);
1190 ABLOCKS_BUSY (abase
)
1191 = (struct ablocks
*) (2 + (intptr_t) ABLOCKS_BUSY (abase
));
1193 free_ablock
= free_ablock
->x
.next_free
;
1195 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1196 if (type
!= MEM_TYPE_NON_LISP
)
1197 mem_insert (val
, (char *) val
+ nbytes
, type
);
1200 MALLOC_UNBLOCK_INPUT
;
1202 MALLOC_PROBE (nbytes
);
1204 eassert (0 == ((uintptr_t) val
) % BLOCK_ALIGN
);
1209 lisp_align_free (void *block
)
1211 struct ablock
*ablock
= block
;
1212 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1215 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1216 mem_delete (mem_find (block
));
1218 /* Put on free list. */
1219 ablock
->x
.next_free
= free_ablock
;
1220 free_ablock
= ablock
;
1221 /* Update busy count. */
1222 ABLOCKS_BUSY (abase
)
1223 = (struct ablocks
*) (-2 + (intptr_t) ABLOCKS_BUSY (abase
));
1225 if (2 > (intptr_t) ABLOCKS_BUSY (abase
))
1226 { /* All the blocks are free. */
1227 int i
= 0, aligned
= (intptr_t) ABLOCKS_BUSY (abase
);
1228 struct ablock
**tem
= &free_ablock
;
1229 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1233 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1236 *tem
= (*tem
)->x
.next_free
;
1239 tem
= &(*tem
)->x
.next_free
;
1241 eassert ((aligned
& 1) == aligned
);
1242 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1243 #ifdef USE_POSIX_MEMALIGN
1244 eassert ((uintptr_t) ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1246 free (ABLOCKS_BASE (abase
));
1248 MALLOC_UNBLOCK_INPUT
;
1252 /***********************************************************************
1254 ***********************************************************************/
1256 /* Number of intervals allocated in an interval_block structure.
1257 The 1020 is 1024 minus malloc overhead. */
1259 #define INTERVAL_BLOCK_SIZE \
1260 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1262 /* Intervals are allocated in chunks in the form of an interval_block
1265 struct interval_block
1267 /* Place `intervals' first, to preserve alignment. */
1268 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1269 struct interval_block
*next
;
1272 /* Current interval block. Its `next' pointer points to older
1275 static struct interval_block
*interval_block
;
1277 /* Index in interval_block above of the next unused interval
1280 static int interval_block_index
= INTERVAL_BLOCK_SIZE
;
1282 /* Number of free and live intervals. */
1284 static EMACS_INT total_free_intervals
, total_intervals
;
1286 /* List of free intervals. */
1288 static INTERVAL interval_free_list
;
1290 /* Return a new interval. */
1293 make_interval (void)
1299 if (interval_free_list
)
1301 val
= interval_free_list
;
1302 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1306 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1308 struct interval_block
*newi
1309 = lisp_malloc (sizeof *newi
, MEM_TYPE_NON_LISP
);
1311 newi
->next
= interval_block
;
1312 interval_block
= newi
;
1313 interval_block_index
= 0;
1314 total_free_intervals
+= INTERVAL_BLOCK_SIZE
;
1316 val
= &interval_block
->intervals
[interval_block_index
++];
1319 MALLOC_UNBLOCK_INPUT
;
1321 consing_since_gc
+= sizeof (struct interval
);
1323 total_free_intervals
--;
1324 RESET_INTERVAL (val
);
1330 /* Mark Lisp objects in interval I. */
1333 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1335 /* Intervals should never be shared. So, if extra internal checking is
1336 enabled, GC aborts if it seems to have visited an interval twice. */
1337 eassert (!i
->gcmarkbit
);
1339 mark_object (i
->plist
);
1342 /* Mark the interval tree rooted in I. */
1344 #define MARK_INTERVAL_TREE(i) \
1346 if (i && !i->gcmarkbit) \
1347 traverse_intervals_noorder (i, mark_interval, Qnil); \
1350 /***********************************************************************
1352 ***********************************************************************/
1354 /* Lisp_Strings are allocated in string_block structures. When a new
1355 string_block is allocated, all the Lisp_Strings it contains are
1356 added to a free-list string_free_list. When a new Lisp_String is
1357 needed, it is taken from that list. During the sweep phase of GC,
1358 string_blocks that are entirely free are freed, except two which
1361 String data is allocated from sblock structures. Strings larger
1362 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1363 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1365 Sblocks consist internally of sdata structures, one for each
1366 Lisp_String. The sdata structure points to the Lisp_String it
1367 belongs to. The Lisp_String points back to the `u.data' member of
1368 its sdata structure.
1370 When a Lisp_String is freed during GC, it is put back on
1371 string_free_list, and its `data' member and its sdata's `string'
1372 pointer is set to null. The size of the string is recorded in the
1373 `n.nbytes' member of the sdata. So, sdata structures that are no
1374 longer used, can be easily recognized, and it's easy to compact the
1375 sblocks of small strings which we do in compact_small_strings. */
1377 /* Size in bytes of an sblock structure used for small strings. This
1378 is 8192 minus malloc overhead. */
1380 #define SBLOCK_SIZE 8188
1382 /* Strings larger than this are considered large strings. String data
1383 for large strings is allocated from individual sblocks. */
1385 #define LARGE_STRING_BYTES 1024
1387 /* The SDATA typedef is a struct or union describing string memory
1388 sub-allocated from an sblock. This is where the contents of Lisp
1389 strings are stored. */
1393 /* Back-pointer to the string this sdata belongs to. If null, this
1394 structure is free, and NBYTES (in this structure or in the union below)
1395 contains the string's byte size (the same value that STRING_BYTES
1396 would return if STRING were non-null). If non-null, STRING_BYTES
1397 (STRING) is the size of the data, and DATA contains the string's
1399 struct Lisp_String
*string
;
1401 #ifdef GC_CHECK_STRING_BYTES
1405 unsigned char data
[FLEXIBLE_ARRAY_MEMBER
];
1408 #ifdef GC_CHECK_STRING_BYTES
1410 typedef struct sdata sdata
;
1411 #define SDATA_NBYTES(S) (S)->nbytes
1412 #define SDATA_DATA(S) (S)->data
1418 struct Lisp_String
*string
;
1420 /* When STRING is nonnull, this union is actually of type 'struct sdata',
1421 which has a flexible array member. However, if implemented by
1422 giving this union a member of type 'struct sdata', the union
1423 could not be the last (flexible) member of 'struct sblock',
1424 because C99 prohibits a flexible array member from having a type
1425 that is itself a flexible array. So, comment this member out here,
1426 but remember that the option's there when using this union. */
1431 /* When STRING is null. */
1434 struct Lisp_String
*string
;
1439 #define SDATA_NBYTES(S) (S)->n.nbytes
1440 #define SDATA_DATA(S) ((struct sdata *) (S))->data
1442 #endif /* not GC_CHECK_STRING_BYTES */
1444 enum { SDATA_DATA_OFFSET
= offsetof (struct sdata
, data
) };
1446 /* Structure describing a block of memory which is sub-allocated to
1447 obtain string data memory for strings. Blocks for small strings
1448 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1449 as large as needed. */
1454 struct sblock
*next
;
1456 /* Pointer to the next free sdata block. This points past the end
1457 of the sblock if there isn't any space left in this block. */
1461 sdata data
[FLEXIBLE_ARRAY_MEMBER
];
1464 /* Number of Lisp strings in a string_block structure. The 1020 is
1465 1024 minus malloc overhead. */
1467 #define STRING_BLOCK_SIZE \
1468 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1470 /* Structure describing a block from which Lisp_String structures
1475 /* Place `strings' first, to preserve alignment. */
1476 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1477 struct string_block
*next
;
1480 /* Head and tail of the list of sblock structures holding Lisp string
1481 data. We always allocate from current_sblock. The NEXT pointers
1482 in the sblock structures go from oldest_sblock to current_sblock. */
1484 static struct sblock
*oldest_sblock
, *current_sblock
;
1486 /* List of sblocks for large strings. */
1488 static struct sblock
*large_sblocks
;
1490 /* List of string_block structures. */
1492 static struct string_block
*string_blocks
;
1494 /* Free-list of Lisp_Strings. */
1496 static struct Lisp_String
*string_free_list
;
1498 /* Number of live and free Lisp_Strings. */
1500 static EMACS_INT total_strings
, total_free_strings
;
1502 /* Number of bytes used by live strings. */
1504 static EMACS_INT total_string_bytes
;
1506 /* Given a pointer to a Lisp_String S which is on the free-list
1507 string_free_list, return a pointer to its successor in the
1510 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1512 /* Return a pointer to the sdata structure belonging to Lisp string S.
1513 S must be live, i.e. S->data must not be null. S->data is actually
1514 a pointer to the `u.data' member of its sdata structure; the
1515 structure starts at a constant offset in front of that. */
1517 #define SDATA_OF_STRING(S) ((sdata *) ((S)->data - SDATA_DATA_OFFSET))
1520 #ifdef GC_CHECK_STRING_OVERRUN
1522 /* We check for overrun in string data blocks by appending a small
1523 "cookie" after each allocated string data block, and check for the
1524 presence of this cookie during GC. */
1526 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1527 static char const string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1528 { '\xde', '\xad', '\xbe', '\xef' };
1531 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1534 /* Value is the size of an sdata structure large enough to hold NBYTES
1535 bytes of string data. The value returned includes a terminating
1536 NUL byte, the size of the sdata structure, and padding. */
1538 #ifdef GC_CHECK_STRING_BYTES
1540 #define SDATA_SIZE(NBYTES) \
1541 ((SDATA_DATA_OFFSET \
1543 + sizeof (ptrdiff_t) - 1) \
1544 & ~(sizeof (ptrdiff_t) - 1))
1546 #else /* not GC_CHECK_STRING_BYTES */
1548 /* The 'max' reserves space for the nbytes union member even when NBYTES + 1 is
1549 less than the size of that member. The 'max' is not needed when
1550 SDATA_DATA_OFFSET is a multiple of sizeof (ptrdiff_t), because then the
1551 alignment code reserves enough space. */
1553 #define SDATA_SIZE(NBYTES) \
1554 ((SDATA_DATA_OFFSET \
1555 + (SDATA_DATA_OFFSET % sizeof (ptrdiff_t) == 0 \
1557 : max (NBYTES, sizeof (ptrdiff_t) - 1)) \
1559 + sizeof (ptrdiff_t) - 1) \
1560 & ~(sizeof (ptrdiff_t) - 1))
1562 #endif /* not GC_CHECK_STRING_BYTES */
1564 /* Extra bytes to allocate for each string. */
1566 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1568 /* Exact bound on the number of bytes in a string, not counting the
1569 terminating null. A string cannot contain more bytes than
1570 STRING_BYTES_BOUND, nor can it be so long that the size_t
1571 arithmetic in allocate_string_data would overflow while it is
1572 calculating a value to be passed to malloc. */
1573 static ptrdiff_t const STRING_BYTES_MAX
=
1574 min (STRING_BYTES_BOUND
,
1575 ((SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
1577 - offsetof (struct sblock
, data
)
1578 - SDATA_DATA_OFFSET
)
1579 & ~(sizeof (EMACS_INT
) - 1)));
1581 /* Initialize string allocation. Called from init_alloc_once. */
1586 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1587 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1591 #ifdef GC_CHECK_STRING_BYTES
1593 static int check_string_bytes_count
;
1595 /* Like STRING_BYTES, but with debugging check. Can be
1596 called during GC, so pay attention to the mark bit. */
1599 string_bytes (struct Lisp_String
*s
)
1602 (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1604 if (!PURE_POINTER_P (s
)
1606 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1611 /* Check validity of Lisp strings' string_bytes member in B. */
1614 check_sblock (struct sblock
*b
)
1616 sdata
*from
, *end
, *from_end
;
1620 for (from
= b
->data
; from
< end
; from
= from_end
)
1622 /* Compute the next FROM here because copying below may
1623 overwrite data we need to compute it. */
1626 /* Check that the string size recorded in the string is the
1627 same as the one recorded in the sdata structure. */
1628 nbytes
= SDATA_SIZE (from
->string
? string_bytes (from
->string
)
1629 : SDATA_NBYTES (from
));
1630 from_end
= (sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1635 /* Check validity of Lisp strings' string_bytes member. ALL_P
1636 means check all strings, otherwise check only most
1637 recently allocated strings. Used for hunting a bug. */
1640 check_string_bytes (bool all_p
)
1646 for (b
= large_sblocks
; b
; b
= b
->next
)
1648 struct Lisp_String
*s
= b
->data
[0].string
;
1653 for (b
= oldest_sblock
; b
; b
= b
->next
)
1656 else if (current_sblock
)
1657 check_sblock (current_sblock
);
1660 #else /* not GC_CHECK_STRING_BYTES */
1662 #define check_string_bytes(all) ((void) 0)
1664 #endif /* GC_CHECK_STRING_BYTES */
1666 #ifdef GC_CHECK_STRING_FREE_LIST
1668 /* Walk through the string free list looking for bogus next pointers.
1669 This may catch buffer overrun from a previous string. */
1672 check_string_free_list (void)
1674 struct Lisp_String
*s
;
1676 /* Pop a Lisp_String off the free-list. */
1677 s
= string_free_list
;
1680 if ((uintptr_t) s
< 1024)
1682 s
= NEXT_FREE_LISP_STRING (s
);
1686 #define check_string_free_list()
1689 /* Return a new Lisp_String. */
1691 static struct Lisp_String
*
1692 allocate_string (void)
1694 struct Lisp_String
*s
;
1698 /* If the free-list is empty, allocate a new string_block, and
1699 add all the Lisp_Strings in it to the free-list. */
1700 if (string_free_list
== NULL
)
1702 struct string_block
*b
= lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1705 b
->next
= string_blocks
;
1708 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1711 /* Every string on a free list should have NULL data pointer. */
1713 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1714 string_free_list
= s
;
1717 total_free_strings
+= STRING_BLOCK_SIZE
;
1720 check_string_free_list ();
1722 /* Pop a Lisp_String off the free-list. */
1723 s
= string_free_list
;
1724 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1726 MALLOC_UNBLOCK_INPUT
;
1728 --total_free_strings
;
1731 consing_since_gc
+= sizeof *s
;
1733 #ifdef GC_CHECK_STRING_BYTES
1734 if (!noninteractive
)
1736 if (++check_string_bytes_count
== 200)
1738 check_string_bytes_count
= 0;
1739 check_string_bytes (1);
1742 check_string_bytes (0);
1744 #endif /* GC_CHECK_STRING_BYTES */
1750 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1751 plus a NUL byte at the end. Allocate an sdata structure for S, and
1752 set S->data to its `u.data' member. Store a NUL byte at the end of
1753 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1754 S->data if it was initially non-null. */
1757 allocate_string_data (struct Lisp_String
*s
,
1758 EMACS_INT nchars
, EMACS_INT nbytes
)
1760 sdata
*data
, *old_data
;
1762 ptrdiff_t needed
, old_nbytes
;
1764 if (STRING_BYTES_MAX
< nbytes
)
1767 /* Determine the number of bytes needed to store NBYTES bytes
1769 needed
= SDATA_SIZE (nbytes
);
1772 old_data
= SDATA_OF_STRING (s
);
1773 old_nbytes
= STRING_BYTES (s
);
1780 if (nbytes
> LARGE_STRING_BYTES
)
1782 size_t size
= offsetof (struct sblock
, data
) + needed
;
1784 #ifdef DOUG_LEA_MALLOC
1785 if (!mmap_lisp_allowed_p ())
1786 mallopt (M_MMAP_MAX
, 0);
1789 b
= lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1791 #ifdef DOUG_LEA_MALLOC
1792 if (!mmap_lisp_allowed_p ())
1793 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1796 b
->next_free
= b
->data
;
1797 b
->data
[0].string
= NULL
;
1798 b
->next
= large_sblocks
;
1801 else if (current_sblock
== NULL
1802 || (((char *) current_sblock
+ SBLOCK_SIZE
1803 - (char *) current_sblock
->next_free
)
1804 < (needed
+ GC_STRING_EXTRA
)))
1806 /* Not enough room in the current sblock. */
1807 b
= lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1808 b
->next_free
= b
->data
;
1809 b
->data
[0].string
= NULL
;
1813 current_sblock
->next
= b
;
1821 data
= b
->next_free
;
1822 b
->next_free
= (sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
1824 MALLOC_UNBLOCK_INPUT
;
1827 s
->data
= SDATA_DATA (data
);
1828 #ifdef GC_CHECK_STRING_BYTES
1829 SDATA_NBYTES (data
) = nbytes
;
1832 s
->size_byte
= nbytes
;
1833 s
->data
[nbytes
] = '\0';
1834 #ifdef GC_CHECK_STRING_OVERRUN
1835 memcpy ((char *) data
+ needed
, string_overrun_cookie
,
1836 GC_STRING_OVERRUN_COOKIE_SIZE
);
1839 /* Note that Faset may call to this function when S has already data
1840 assigned. In this case, mark data as free by setting it's string
1841 back-pointer to null, and record the size of the data in it. */
1844 SDATA_NBYTES (old_data
) = old_nbytes
;
1845 old_data
->string
= NULL
;
1848 consing_since_gc
+= needed
;
1852 /* Sweep and compact strings. */
1854 NO_INLINE
/* For better stack traces */
1856 sweep_strings (void)
1858 struct string_block
*b
, *next
;
1859 struct string_block
*live_blocks
= NULL
;
1861 string_free_list
= NULL
;
1862 total_strings
= total_free_strings
= 0;
1863 total_string_bytes
= 0;
1865 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1866 for (b
= string_blocks
; b
; b
= next
)
1869 struct Lisp_String
*free_list_before
= string_free_list
;
1873 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1875 struct Lisp_String
*s
= b
->strings
+ i
;
1879 /* String was not on free-list before. */
1880 if (STRING_MARKED_P (s
))
1882 /* String is live; unmark it and its intervals. */
1885 /* Do not use string_(set|get)_intervals here. */
1886 s
->intervals
= balance_intervals (s
->intervals
);
1889 total_string_bytes
+= STRING_BYTES (s
);
1893 /* String is dead. Put it on the free-list. */
1894 sdata
*data
= SDATA_OF_STRING (s
);
1896 /* Save the size of S in its sdata so that we know
1897 how large that is. Reset the sdata's string
1898 back-pointer so that we know it's free. */
1899 #ifdef GC_CHECK_STRING_BYTES
1900 if (string_bytes (s
) != SDATA_NBYTES (data
))
1903 data
->n
.nbytes
= STRING_BYTES (s
);
1905 data
->string
= NULL
;
1907 /* Reset the strings's `data' member so that we
1911 /* Put the string on the free-list. */
1912 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1913 string_free_list
= s
;
1919 /* S was on the free-list before. Put it there again. */
1920 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1921 string_free_list
= s
;
1926 /* Free blocks that contain free Lisp_Strings only, except
1927 the first two of them. */
1928 if (nfree
== STRING_BLOCK_SIZE
1929 && total_free_strings
> STRING_BLOCK_SIZE
)
1932 string_free_list
= free_list_before
;
1936 total_free_strings
+= nfree
;
1937 b
->next
= live_blocks
;
1942 check_string_free_list ();
1944 string_blocks
= live_blocks
;
1945 free_large_strings ();
1946 compact_small_strings ();
1948 check_string_free_list ();
1952 /* Free dead large strings. */
1955 free_large_strings (void)
1957 struct sblock
*b
, *next
;
1958 struct sblock
*live_blocks
= NULL
;
1960 for (b
= large_sblocks
; b
; b
= next
)
1964 if (b
->data
[0].string
== NULL
)
1968 b
->next
= live_blocks
;
1973 large_sblocks
= live_blocks
;
1977 /* Compact data of small strings. Free sblocks that don't contain
1978 data of live strings after compaction. */
1981 compact_small_strings (void)
1983 struct sblock
*b
, *tb
, *next
;
1984 sdata
*from
, *to
, *end
, *tb_end
;
1985 sdata
*to_end
, *from_end
;
1987 /* TB is the sblock we copy to, TO is the sdata within TB we copy
1988 to, and TB_END is the end of TB. */
1990 tb_end
= (sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1993 /* Step through the blocks from the oldest to the youngest. We
1994 expect that old blocks will stabilize over time, so that less
1995 copying will happen this way. */
1996 for (b
= oldest_sblock
; b
; b
= b
->next
)
1999 eassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2001 for (from
= b
->data
; from
< end
; from
= from_end
)
2003 /* Compute the next FROM here because copying below may
2004 overwrite data we need to compute it. */
2006 struct Lisp_String
*s
= from
->string
;
2008 #ifdef GC_CHECK_STRING_BYTES
2009 /* Check that the string size recorded in the string is the
2010 same as the one recorded in the sdata structure. */
2011 if (s
&& string_bytes (s
) != SDATA_NBYTES (from
))
2013 #endif /* GC_CHECK_STRING_BYTES */
2015 nbytes
= s
? STRING_BYTES (s
) : SDATA_NBYTES (from
);
2016 eassert (nbytes
<= LARGE_STRING_BYTES
);
2018 nbytes
= SDATA_SIZE (nbytes
);
2019 from_end
= (sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2021 #ifdef GC_CHECK_STRING_OVERRUN
2022 if (memcmp (string_overrun_cookie
,
2023 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
2024 GC_STRING_OVERRUN_COOKIE_SIZE
))
2028 /* Non-NULL S means it's alive. Copy its data. */
2031 /* If TB is full, proceed with the next sblock. */
2032 to_end
= (sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2033 if (to_end
> tb_end
)
2037 tb_end
= (sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2039 to_end
= (sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2042 /* Copy, and update the string's `data' pointer. */
2045 eassert (tb
!= b
|| to
< from
);
2046 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
2047 to
->string
->data
= SDATA_DATA (to
);
2050 /* Advance past the sdata we copied to. */
2056 /* The rest of the sblocks following TB don't contain live data, so
2057 we can free them. */
2058 for (b
= tb
->next
; b
; b
= next
)
2066 current_sblock
= tb
;
2070 string_overflow (void)
2072 error ("Maximum string size exceeded");
2075 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2076 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2077 LENGTH must be an integer.
2078 INIT must be an integer that represents a character. */)
2079 (Lisp_Object length
, Lisp_Object init
)
2081 register Lisp_Object val
;
2085 CHECK_NATNUM (length
);
2086 CHECK_CHARACTER (init
);
2088 c
= XFASTINT (init
);
2089 if (ASCII_CHAR_P (c
))
2091 nbytes
= XINT (length
);
2092 val
= make_uninit_string (nbytes
);
2093 memset (SDATA (val
), c
, nbytes
);
2094 SDATA (val
)[nbytes
] = 0;
2098 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2099 ptrdiff_t len
= CHAR_STRING (c
, str
);
2100 EMACS_INT string_len
= XINT (length
);
2101 unsigned char *p
, *beg
, *end
;
2103 if (string_len
> STRING_BYTES_MAX
/ len
)
2105 nbytes
= len
* string_len
;
2106 val
= make_uninit_multibyte_string (string_len
, nbytes
);
2107 for (beg
= SDATA (val
), p
= beg
, end
= beg
+ nbytes
; p
< end
; p
+= len
)
2109 /* First time we just copy `str' to the data of `val'. */
2111 memcpy (p
, str
, len
);
2114 /* Next time we copy largest possible chunk from
2115 initialized to uninitialized part of `val'. */
2116 len
= min (p
- beg
, end
- p
);
2117 memcpy (p
, beg
, len
);
2126 /* Fill A with 1 bits if INIT is non-nil, and with 0 bits otherwise.
2130 bool_vector_fill (Lisp_Object a
, Lisp_Object init
)
2132 EMACS_INT nbits
= bool_vector_size (a
);
2135 unsigned char *data
= bool_vector_uchar_data (a
);
2136 int pattern
= NILP (init
) ? 0 : (1 << BOOL_VECTOR_BITS_PER_CHAR
) - 1;
2137 ptrdiff_t nbytes
= bool_vector_bytes (nbits
);
2138 int last_mask
= ~ (~0u << ((nbits
- 1) % BOOL_VECTOR_BITS_PER_CHAR
+ 1));
2139 memset (data
, pattern
, nbytes
- 1);
2140 data
[nbytes
- 1] = pattern
& last_mask
;
2145 /* Return a newly allocated, uninitialized bool vector of size NBITS. */
2148 make_uninit_bool_vector (EMACS_INT nbits
)
2151 EMACS_INT words
= bool_vector_words (nbits
);
2152 EMACS_INT word_bytes
= words
* sizeof (bits_word
);
2153 EMACS_INT needed_elements
= ((bool_header_size
- header_size
+ word_bytes
2156 struct Lisp_Bool_Vector
*p
2157 = (struct Lisp_Bool_Vector
*) allocate_vector (needed_elements
);
2158 XSETVECTOR (val
, p
);
2159 XSETPVECTYPESIZE (XVECTOR (val
), PVEC_BOOL_VECTOR
, 0, 0);
2162 /* Clear padding at the end. */
2164 p
->data
[words
- 1] = 0;
2169 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2170 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2171 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2172 (Lisp_Object length
, Lisp_Object init
)
2176 CHECK_NATNUM (length
);
2177 val
= make_uninit_bool_vector (XFASTINT (length
));
2178 return bool_vector_fill (val
, init
);
2181 DEFUN ("bool-vector", Fbool_vector
, Sbool_vector
, 0, MANY
, 0,
2182 doc
: /* Return a new bool-vector with specified arguments as elements.
2183 Any number of arguments, even zero arguments, are allowed.
2184 usage: (bool-vector &rest OBJECTS) */)
2185 (ptrdiff_t nargs
, Lisp_Object
*args
)
2190 vector
= make_uninit_bool_vector (nargs
);
2191 for (i
= 0; i
< nargs
; i
++)
2192 bool_vector_set (vector
, i
, !NILP (args
[i
]));
2197 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2198 of characters from the contents. This string may be unibyte or
2199 multibyte, depending on the contents. */
2202 make_string (const char *contents
, ptrdiff_t nbytes
)
2204 register Lisp_Object val
;
2205 ptrdiff_t nchars
, multibyte_nbytes
;
2207 parse_str_as_multibyte ((const unsigned char *) contents
, nbytes
,
2208 &nchars
, &multibyte_nbytes
);
2209 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2210 /* CONTENTS contains no multibyte sequences or contains an invalid
2211 multibyte sequence. We must make unibyte string. */
2212 val
= make_unibyte_string (contents
, nbytes
);
2214 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2219 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2222 make_unibyte_string (const char *contents
, ptrdiff_t length
)
2224 register Lisp_Object val
;
2225 val
= make_uninit_string (length
);
2226 memcpy (SDATA (val
), contents
, length
);
2231 /* Make a multibyte string from NCHARS characters occupying NBYTES
2232 bytes at CONTENTS. */
2235 make_multibyte_string (const char *contents
,
2236 ptrdiff_t nchars
, ptrdiff_t nbytes
)
2238 register Lisp_Object val
;
2239 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2240 memcpy (SDATA (val
), contents
, nbytes
);
2245 /* Make a string from NCHARS characters occupying NBYTES bytes at
2246 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2249 make_string_from_bytes (const char *contents
,
2250 ptrdiff_t nchars
, ptrdiff_t nbytes
)
2252 register Lisp_Object val
;
2253 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2254 memcpy (SDATA (val
), contents
, nbytes
);
2255 if (SBYTES (val
) == SCHARS (val
))
2256 STRING_SET_UNIBYTE (val
);
2261 /* Make a string from NCHARS characters occupying NBYTES bytes at
2262 CONTENTS. The argument MULTIBYTE controls whether to label the
2263 string as multibyte. If NCHARS is negative, it counts the number of
2264 characters by itself. */
2267 make_specified_string (const char *contents
,
2268 ptrdiff_t nchars
, ptrdiff_t nbytes
, bool multibyte
)
2275 nchars
= multibyte_chars_in_text ((const unsigned char *) contents
,
2280 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2281 memcpy (SDATA (val
), contents
, nbytes
);
2283 STRING_SET_UNIBYTE (val
);
2288 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2289 occupying LENGTH bytes. */
2292 make_uninit_string (EMACS_INT length
)
2297 return empty_unibyte_string
;
2298 val
= make_uninit_multibyte_string (length
, length
);
2299 STRING_SET_UNIBYTE (val
);
2304 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2305 which occupy NBYTES bytes. */
2308 make_uninit_multibyte_string (EMACS_INT nchars
, EMACS_INT nbytes
)
2311 struct Lisp_String
*s
;
2316 return empty_multibyte_string
;
2318 s
= allocate_string ();
2319 s
->intervals
= NULL
;
2320 allocate_string_data (s
, nchars
, nbytes
);
2321 XSETSTRING (string
, s
);
2322 string_chars_consed
+= nbytes
;
2326 /* Print arguments to BUF according to a FORMAT, then return
2327 a Lisp_String initialized with the data from BUF. */
2330 make_formatted_string (char *buf
, const char *format
, ...)
2335 va_start (ap
, format
);
2336 length
= vsprintf (buf
, format
, ap
);
2338 return make_string (buf
, length
);
2342 /***********************************************************************
2344 ***********************************************************************/
2346 /* We store float cells inside of float_blocks, allocating a new
2347 float_block with malloc whenever necessary. Float cells reclaimed
2348 by GC are put on a free list to be reallocated before allocating
2349 any new float cells from the latest float_block. */
2351 #define FLOAT_BLOCK_SIZE \
2352 (((BLOCK_BYTES - sizeof (struct float_block *) \
2353 /* The compiler might add padding at the end. */ \
2354 - (sizeof (struct Lisp_Float) - sizeof (bits_word))) * CHAR_BIT) \
2355 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2357 #define GETMARKBIT(block,n) \
2358 (((block)->gcmarkbits[(n) / BITS_PER_BITS_WORD] \
2359 >> ((n) % BITS_PER_BITS_WORD)) \
2362 #define SETMARKBIT(block,n) \
2363 ((block)->gcmarkbits[(n) / BITS_PER_BITS_WORD] \
2364 |= (bits_word) 1 << ((n) % BITS_PER_BITS_WORD))
2366 #define UNSETMARKBIT(block,n) \
2367 ((block)->gcmarkbits[(n) / BITS_PER_BITS_WORD] \
2368 &= ~((bits_word) 1 << ((n) % BITS_PER_BITS_WORD)))
2370 #define FLOAT_BLOCK(fptr) \
2371 ((struct float_block *) (((uintptr_t) (fptr)) & ~(BLOCK_ALIGN - 1)))
2373 #define FLOAT_INDEX(fptr) \
2374 ((((uintptr_t) (fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2378 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2379 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2380 bits_word gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ BITS_PER_BITS_WORD
];
2381 struct float_block
*next
;
2384 #define FLOAT_MARKED_P(fptr) \
2385 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2387 #define FLOAT_MARK(fptr) \
2388 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2390 #define FLOAT_UNMARK(fptr) \
2391 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2393 /* Current float_block. */
2395 static struct float_block
*float_block
;
2397 /* Index of first unused Lisp_Float in the current float_block. */
2399 static int float_block_index
= FLOAT_BLOCK_SIZE
;
2401 /* Free-list of Lisp_Floats. */
2403 static struct Lisp_Float
*float_free_list
;
2405 /* Return a new float object with value FLOAT_VALUE. */
2408 make_float (double float_value
)
2410 register Lisp_Object val
;
2414 if (float_free_list
)
2416 /* We use the data field for chaining the free list
2417 so that we won't use the same field that has the mark bit. */
2418 XSETFLOAT (val
, float_free_list
);
2419 float_free_list
= float_free_list
->u
.chain
;
2423 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2425 struct float_block
*new
2426 = lisp_align_malloc (sizeof *new, MEM_TYPE_FLOAT
);
2427 new->next
= float_block
;
2428 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2430 float_block_index
= 0;
2431 total_free_floats
+= FLOAT_BLOCK_SIZE
;
2433 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2434 float_block_index
++;
2437 MALLOC_UNBLOCK_INPUT
;
2439 XFLOAT_INIT (val
, float_value
);
2440 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2441 consing_since_gc
+= sizeof (struct Lisp_Float
);
2443 total_free_floats
--;
2449 /***********************************************************************
2451 ***********************************************************************/
2453 /* We store cons cells inside of cons_blocks, allocating a new
2454 cons_block with malloc whenever necessary. Cons cells reclaimed by
2455 GC are put on a free list to be reallocated before allocating
2456 any new cons cells from the latest cons_block. */
2458 #define CONS_BLOCK_SIZE \
2459 (((BLOCK_BYTES - sizeof (struct cons_block *) \
2460 /* The compiler might add padding at the end. */ \
2461 - (sizeof (struct Lisp_Cons) - sizeof (bits_word))) * CHAR_BIT) \
2462 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2464 #define CONS_BLOCK(fptr) \
2465 ((struct cons_block *) ((uintptr_t) (fptr) & ~(BLOCK_ALIGN - 1)))
2467 #define CONS_INDEX(fptr) \
2468 (((uintptr_t) (fptr) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2472 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2473 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2474 bits_word gcmarkbits
[1 + CONS_BLOCK_SIZE
/ BITS_PER_BITS_WORD
];
2475 struct cons_block
*next
;
2478 #define CONS_MARKED_P(fptr) \
2479 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2481 #define CONS_MARK(fptr) \
2482 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2484 #define CONS_UNMARK(fptr) \
2485 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2487 /* Current cons_block. */
2489 static struct cons_block
*cons_block
;
2491 /* Index of first unused Lisp_Cons in the current block. */
2493 static int cons_block_index
= CONS_BLOCK_SIZE
;
2495 /* Free-list of Lisp_Cons structures. */
2497 static struct Lisp_Cons
*cons_free_list
;
2499 /* Explicitly free a cons cell by putting it on the free-list. */
2502 free_cons (struct Lisp_Cons
*ptr
)
2504 ptr
->u
.chain
= cons_free_list
;
2508 cons_free_list
= ptr
;
2509 consing_since_gc
-= sizeof *ptr
;
2510 total_free_conses
++;
2513 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2514 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2515 (Lisp_Object car
, Lisp_Object cdr
)
2517 register Lisp_Object val
;
2523 /* We use the cdr for chaining the free list
2524 so that we won't use the same field that has the mark bit. */
2525 XSETCONS (val
, cons_free_list
);
2526 cons_free_list
= cons_free_list
->u
.chain
;
2530 if (cons_block_index
== CONS_BLOCK_SIZE
)
2532 struct cons_block
*new
2533 = lisp_align_malloc (sizeof *new, MEM_TYPE_CONS
);
2534 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2535 new->next
= cons_block
;
2537 cons_block_index
= 0;
2538 total_free_conses
+= CONS_BLOCK_SIZE
;
2540 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2544 MALLOC_UNBLOCK_INPUT
;
2548 eassert (!CONS_MARKED_P (XCONS (val
)));
2549 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2550 total_free_conses
--;
2551 cons_cells_consed
++;
2555 #ifdef GC_CHECK_CONS_LIST
2556 /* Get an error now if there's any junk in the cons free list. */
2558 check_cons_list (void)
2560 struct Lisp_Cons
*tail
= cons_free_list
;
2563 tail
= tail
->u
.chain
;
2567 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2570 list1 (Lisp_Object arg1
)
2572 return Fcons (arg1
, Qnil
);
2576 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2578 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2583 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2585 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2590 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2592 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2597 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2599 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2600 Fcons (arg5
, Qnil
)))));
2603 /* Make a list of COUNT Lisp_Objects, where ARG is the
2604 first one. Allocate conses from pure space if TYPE
2605 is CONSTYPE_PURE, or allocate as usual if type is CONSTYPE_HEAP. */
2608 listn (enum constype type
, ptrdiff_t count
, Lisp_Object arg
, ...)
2612 Lisp_Object val
, *objp
;
2614 /* Change to SAFE_ALLOCA if you hit this eassert. */
2615 eassert (count
<= MAX_ALLOCA
/ word_size
);
2617 objp
= alloca (count
* word_size
);
2620 for (i
= 1; i
< count
; i
++)
2621 objp
[i
] = va_arg (ap
, Lisp_Object
);
2624 for (val
= Qnil
, i
= count
- 1; i
>= 0; i
--)
2626 if (type
== CONSTYPE_PURE
)
2627 val
= pure_cons (objp
[i
], val
);
2628 else if (type
== CONSTYPE_HEAP
)
2629 val
= Fcons (objp
[i
], val
);
2636 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2637 doc
: /* Return a newly created list with specified arguments as elements.
2638 Any number of arguments, even zero arguments, are allowed.
2639 usage: (list &rest OBJECTS) */)
2640 (ptrdiff_t nargs
, Lisp_Object
*args
)
2642 register Lisp_Object val
;
2648 val
= Fcons (args
[nargs
], val
);
2654 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2655 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2656 (register Lisp_Object length
, Lisp_Object init
)
2658 register Lisp_Object val
;
2659 register EMACS_INT size
;
2661 CHECK_NATNUM (length
);
2662 size
= XFASTINT (length
);
2667 val
= Fcons (init
, val
);
2672 val
= Fcons (init
, val
);
2677 val
= Fcons (init
, val
);
2682 val
= Fcons (init
, val
);
2687 val
= Fcons (init
, val
);
2702 /***********************************************************************
2704 ***********************************************************************/
2706 /* Sometimes a vector's contents are merely a pointer internally used
2707 in vector allocation code. On the rare platforms where a null
2708 pointer cannot be tagged, represent it with a Lisp 0.
2709 Usually you don't want to touch this. */
2711 static struct Lisp_Vector
*
2712 next_vector (struct Lisp_Vector
*v
)
2714 return XUNTAG (v
->contents
[0], 0);
2718 set_next_vector (struct Lisp_Vector
*v
, struct Lisp_Vector
*p
)
2720 v
->contents
[0] = make_lisp_ptr (p
, 0);
2723 /* This value is balanced well enough to avoid too much internal overhead
2724 for the most common cases; it's not required to be a power of two, but
2725 it's expected to be a mult-of-ROUNDUP_SIZE (see below). */
2727 #define VECTOR_BLOCK_SIZE 4096
2731 /* Alignment of struct Lisp_Vector objects. */
2732 vector_alignment
= COMMON_MULTIPLE (ALIGNOF_STRUCT_LISP_VECTOR
,
2733 USE_LSB_TAG
? GCALIGNMENT
: 1),
2735 /* Vector size requests are a multiple of this. */
2736 roundup_size
= COMMON_MULTIPLE (vector_alignment
, word_size
)
2739 /* Verify assumptions described above. */
2740 verify ((VECTOR_BLOCK_SIZE
% roundup_size
) == 0);
2741 verify (VECTOR_BLOCK_SIZE
<= (1 << PSEUDOVECTOR_SIZE_BITS
));
2743 /* Round up X to nearest mult-of-ROUNDUP_SIZE --- use at compile time. */
2744 #define vroundup_ct(x) ROUNDUP (x, roundup_size)
2745 /* Round up X to nearest mult-of-ROUNDUP_SIZE --- use at runtime. */
2746 #define vroundup(x) (eassume ((x) >= 0), vroundup_ct (x))
2748 /* Rounding helps to maintain alignment constraints if USE_LSB_TAG. */
2750 #define VECTOR_BLOCK_BYTES (VECTOR_BLOCK_SIZE - vroundup_ct (sizeof (void *)))
2752 /* Size of the minimal vector allocated from block. */
2754 #define VBLOCK_BYTES_MIN vroundup_ct (header_size + sizeof (Lisp_Object))
2756 /* Size of the largest vector allocated from block. */
2758 #define VBLOCK_BYTES_MAX \
2759 vroundup ((VECTOR_BLOCK_BYTES / 2) - word_size)
2761 /* We maintain one free list for each possible block-allocated
2762 vector size, and this is the number of free lists we have. */
2764 #define VECTOR_MAX_FREE_LIST_INDEX \
2765 ((VECTOR_BLOCK_BYTES - VBLOCK_BYTES_MIN) / roundup_size + 1)
2767 /* Common shortcut to advance vector pointer over a block data. */
2769 #define ADVANCE(v, nbytes) ((struct Lisp_Vector *) ((char *) (v) + (nbytes)))
2771 /* Common shortcut to calculate NBYTES-vector index in VECTOR_FREE_LISTS. */
2773 #define VINDEX(nbytes) (((nbytes) - VBLOCK_BYTES_MIN) / roundup_size)
2775 /* Common shortcut to setup vector on a free list. */
2777 #define SETUP_ON_FREE_LIST(v, nbytes, tmp) \
2779 (tmp) = ((nbytes - header_size) / word_size); \
2780 XSETPVECTYPESIZE (v, PVEC_FREE, 0, (tmp)); \
2781 eassert ((nbytes) % roundup_size == 0); \
2782 (tmp) = VINDEX (nbytes); \
2783 eassert ((tmp) < VECTOR_MAX_FREE_LIST_INDEX); \
2784 set_next_vector (v, vector_free_lists[tmp]); \
2785 vector_free_lists[tmp] = (v); \
2786 total_free_vector_slots += (nbytes) / word_size; \
2789 /* This internal type is used to maintain the list of large vectors
2790 which are allocated at their own, e.g. outside of vector blocks.
2792 struct large_vector itself cannot contain a struct Lisp_Vector, as
2793 the latter contains a flexible array member and C99 does not allow
2794 such structs to be nested. Instead, each struct large_vector
2795 object LV is followed by a struct Lisp_Vector, which is at offset
2796 large_vector_offset from LV, and whose address is therefore
2797 large_vector_vec (&LV). */
2801 struct large_vector
*next
;
2806 large_vector_offset
= ROUNDUP (sizeof (struct large_vector
), vector_alignment
)
2809 static struct Lisp_Vector
*
2810 large_vector_vec (struct large_vector
*p
)
2812 return (struct Lisp_Vector
*) ((char *) p
+ large_vector_offset
);
2815 /* This internal type is used to maintain an underlying storage
2816 for small vectors. */
2820 char data
[VECTOR_BLOCK_BYTES
];
2821 struct vector_block
*next
;
2824 /* Chain of vector blocks. */
2826 static struct vector_block
*vector_blocks
;
2828 /* Vector free lists, where NTH item points to a chain of free
2829 vectors of the same NBYTES size, so NTH == VINDEX (NBYTES). */
2831 static struct Lisp_Vector
*vector_free_lists
[VECTOR_MAX_FREE_LIST_INDEX
];
2833 /* Singly-linked list of large vectors. */
2835 static struct large_vector
*large_vectors
;
2837 /* The only vector with 0 slots, allocated from pure space. */
2839 Lisp_Object zero_vector
;
2841 /* Number of live vectors. */
2843 static EMACS_INT total_vectors
;
2845 /* Total size of live and free vectors, in Lisp_Object units. */
2847 static EMACS_INT total_vector_slots
, total_free_vector_slots
;
2849 /* Get a new vector block. */
2851 static struct vector_block
*
2852 allocate_vector_block (void)
2854 struct vector_block
*block
= xmalloc (sizeof *block
);
2856 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
2857 mem_insert (block
->data
, block
->data
+ VECTOR_BLOCK_BYTES
,
2858 MEM_TYPE_VECTOR_BLOCK
);
2861 block
->next
= vector_blocks
;
2862 vector_blocks
= block
;
2866 /* Called once to initialize vector allocation. */
2871 zero_vector
= make_pure_vector (0);
2874 /* Allocate vector from a vector block. */
2876 static struct Lisp_Vector
*
2877 allocate_vector_from_block (size_t nbytes
)
2879 struct Lisp_Vector
*vector
;
2880 struct vector_block
*block
;
2881 size_t index
, restbytes
;
2883 eassert (VBLOCK_BYTES_MIN
<= nbytes
&& nbytes
<= VBLOCK_BYTES_MAX
);
2884 eassert (nbytes
% roundup_size
== 0);
2886 /* First, try to allocate from a free list
2887 containing vectors of the requested size. */
2888 index
= VINDEX (nbytes
);
2889 if (vector_free_lists
[index
])
2891 vector
= vector_free_lists
[index
];
2892 vector_free_lists
[index
] = next_vector (vector
);
2893 total_free_vector_slots
-= nbytes
/ word_size
;
2897 /* Next, check free lists containing larger vectors. Since
2898 we will split the result, we should have remaining space
2899 large enough to use for one-slot vector at least. */
2900 for (index
= VINDEX (nbytes
+ VBLOCK_BYTES_MIN
);
2901 index
< VECTOR_MAX_FREE_LIST_INDEX
; index
++)
2902 if (vector_free_lists
[index
])
2904 /* This vector is larger than requested. */
2905 vector
= vector_free_lists
[index
];
2906 vector_free_lists
[index
] = next_vector (vector
);
2907 total_free_vector_slots
-= nbytes
/ word_size
;
2909 /* Excess bytes are used for the smaller vector,
2910 which should be set on an appropriate free list. */
2911 restbytes
= index
* roundup_size
+ VBLOCK_BYTES_MIN
- nbytes
;
2912 eassert (restbytes
% roundup_size
== 0);
2913 SETUP_ON_FREE_LIST (ADVANCE (vector
, nbytes
), restbytes
, index
);
2917 /* Finally, need a new vector block. */
2918 block
= allocate_vector_block ();
2920 /* New vector will be at the beginning of this block. */
2921 vector
= (struct Lisp_Vector
*) block
->data
;
2923 /* If the rest of space from this block is large enough
2924 for one-slot vector at least, set up it on a free list. */
2925 restbytes
= VECTOR_BLOCK_BYTES
- nbytes
;
2926 if (restbytes
>= VBLOCK_BYTES_MIN
)
2928 eassert (restbytes
% roundup_size
== 0);
2929 SETUP_ON_FREE_LIST (ADVANCE (vector
, nbytes
), restbytes
, index
);
2934 /* Nonzero if VECTOR pointer is valid pointer inside BLOCK. */
2936 #define VECTOR_IN_BLOCK(vector, block) \
2937 ((char *) (vector) <= (block)->data \
2938 + VECTOR_BLOCK_BYTES - VBLOCK_BYTES_MIN)
2940 /* Return the memory footprint of V in bytes. */
2943 vector_nbytes (struct Lisp_Vector
*v
)
2945 ptrdiff_t size
= v
->header
.size
& ~ARRAY_MARK_FLAG
;
2948 if (size
& PSEUDOVECTOR_FLAG
)
2950 if (PSEUDOVECTOR_TYPEP (&v
->header
, PVEC_BOOL_VECTOR
))
2952 struct Lisp_Bool_Vector
*bv
= (struct Lisp_Bool_Vector
*) v
;
2953 ptrdiff_t word_bytes
= (bool_vector_words (bv
->size
)
2954 * sizeof (bits_word
));
2955 ptrdiff_t boolvec_bytes
= bool_header_size
+ word_bytes
;
2956 verify (header_size
<= bool_header_size
);
2957 nwords
= (boolvec_bytes
- header_size
+ word_size
- 1) / word_size
;
2960 nwords
= ((size
& PSEUDOVECTOR_SIZE_MASK
)
2961 + ((size
& PSEUDOVECTOR_REST_MASK
)
2962 >> PSEUDOVECTOR_SIZE_BITS
));
2966 return vroundup (header_size
+ word_size
* nwords
);
2969 /* Release extra resources still in use by VECTOR, which may be any
2970 vector-like object. For now, this is used just to free data in
2974 cleanup_vector (struct Lisp_Vector
*vector
)
2976 detect_suspicious_free (vector
);
2977 if (PSEUDOVECTOR_TYPEP (&vector
->header
, PVEC_FONT
)
2978 && ((vector
->header
.size
& PSEUDOVECTOR_SIZE_MASK
)
2979 == FONT_OBJECT_MAX
))
2981 struct font_driver
*drv
= ((struct font
*) vector
)->driver
;
2983 /* The font driver might sometimes be NULL, e.g. if Emacs was
2984 interrupted before it had time to set it up. */
2987 /* Attempt to catch subtle bugs like Bug#16140. */
2988 eassert (valid_font_driver (drv
));
2989 drv
->close ((struct font
*) vector
);
2994 /* Reclaim space used by unmarked vectors. */
2996 NO_INLINE
/* For better stack traces */
2998 sweep_vectors (void)
3000 struct vector_block
*block
, **bprev
= &vector_blocks
;
3001 struct large_vector
*lv
, **lvprev
= &large_vectors
;
3002 struct Lisp_Vector
*vector
, *next
;
3004 total_vectors
= total_vector_slots
= total_free_vector_slots
= 0;
3005 memset (vector_free_lists
, 0, sizeof (vector_free_lists
));
3007 /* Looking through vector blocks. */
3009 for (block
= vector_blocks
; block
; block
= *bprev
)
3011 bool free_this_block
= 0;
3014 for (vector
= (struct Lisp_Vector
*) block
->data
;
3015 VECTOR_IN_BLOCK (vector
, block
); vector
= next
)
3017 if (VECTOR_MARKED_P (vector
))
3019 VECTOR_UNMARK (vector
);
3021 nbytes
= vector_nbytes (vector
);
3022 total_vector_slots
+= nbytes
/ word_size
;
3023 next
= ADVANCE (vector
, nbytes
);
3027 ptrdiff_t total_bytes
;
3029 cleanup_vector (vector
);
3030 nbytes
= vector_nbytes (vector
);
3031 total_bytes
= nbytes
;
3032 next
= ADVANCE (vector
, nbytes
);
3034 /* While NEXT is not marked, try to coalesce with VECTOR,
3035 thus making VECTOR of the largest possible size. */
3037 while (VECTOR_IN_BLOCK (next
, block
))
3039 if (VECTOR_MARKED_P (next
))
3041 cleanup_vector (next
);
3042 nbytes
= vector_nbytes (next
);
3043 total_bytes
+= nbytes
;
3044 next
= ADVANCE (next
, nbytes
);
3047 eassert (total_bytes
% roundup_size
== 0);
3049 if (vector
== (struct Lisp_Vector
*) block
->data
3050 && !VECTOR_IN_BLOCK (next
, block
))
3051 /* This block should be freed because all of its
3052 space was coalesced into the only free vector. */
3053 free_this_block
= 1;
3057 SETUP_ON_FREE_LIST (vector
, total_bytes
, tmp
);
3062 if (free_this_block
)
3064 *bprev
= block
->next
;
3065 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
3066 mem_delete (mem_find (block
->data
));
3071 bprev
= &block
->next
;
3074 /* Sweep large vectors. */
3076 for (lv
= large_vectors
; lv
; lv
= *lvprev
)
3078 vector
= large_vector_vec (lv
);
3079 if (VECTOR_MARKED_P (vector
))
3081 VECTOR_UNMARK (vector
);
3083 if (vector
->header
.size
& PSEUDOVECTOR_FLAG
)
3085 /* All non-bool pseudovectors are small enough to be allocated
3086 from vector blocks. This code should be redesigned if some
3087 pseudovector type grows beyond VBLOCK_BYTES_MAX. */
3088 eassert (PSEUDOVECTOR_TYPEP (&vector
->header
, PVEC_BOOL_VECTOR
));
3089 total_vector_slots
+= vector_nbytes (vector
) / word_size
;
3093 += header_size
/ word_size
+ vector
->header
.size
;
3104 /* Value is a pointer to a newly allocated Lisp_Vector structure
3105 with room for LEN Lisp_Objects. */
3107 static struct Lisp_Vector
*
3108 allocate_vectorlike (ptrdiff_t len
)
3110 struct Lisp_Vector
*p
;
3115 p
= XVECTOR (zero_vector
);
3118 size_t nbytes
= header_size
+ len
* word_size
;
3120 #ifdef DOUG_LEA_MALLOC
3121 if (!mmap_lisp_allowed_p ())
3122 mallopt (M_MMAP_MAX
, 0);
3125 if (nbytes
<= VBLOCK_BYTES_MAX
)
3126 p
= allocate_vector_from_block (vroundup (nbytes
));
3129 struct large_vector
*lv
3130 = lisp_malloc ((large_vector_offset
+ header_size
3132 MEM_TYPE_VECTORLIKE
);
3133 lv
->next
= large_vectors
;
3135 p
= large_vector_vec (lv
);
3138 #ifdef DOUG_LEA_MALLOC
3139 if (!mmap_lisp_allowed_p ())
3140 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
3143 if (find_suspicious_object_in_range (p
, (char *) p
+ nbytes
))
3146 consing_since_gc
+= nbytes
;
3147 vector_cells_consed
+= len
;
3150 MALLOC_UNBLOCK_INPUT
;
3156 /* Allocate a vector with LEN slots. */
3158 struct Lisp_Vector
*
3159 allocate_vector (EMACS_INT len
)
3161 struct Lisp_Vector
*v
;
3162 ptrdiff_t nbytes_max
= min (PTRDIFF_MAX
, SIZE_MAX
);
3164 if (min ((nbytes_max
- header_size
) / word_size
, MOST_POSITIVE_FIXNUM
) < len
)
3165 memory_full (SIZE_MAX
);
3166 v
= allocate_vectorlike (len
);
3167 v
->header
.size
= len
;
3172 /* Allocate other vector-like structures. */
3174 struct Lisp_Vector
*
3175 allocate_pseudovector (int memlen
, int lisplen
, enum pvec_type tag
)
3177 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
3180 /* Catch bogus values. */
3181 eassert (tag
<= PVEC_FONT
);
3182 eassert (memlen
- lisplen
<= (1 << PSEUDOVECTOR_REST_BITS
) - 1);
3183 eassert (lisplen
<= (1 << PSEUDOVECTOR_SIZE_BITS
) - 1);
3185 /* Only the first lisplen slots will be traced normally by the GC. */
3186 for (i
= 0; i
< lisplen
; ++i
)
3187 v
->contents
[i
] = Qnil
;
3189 XSETPVECTYPESIZE (v
, tag
, lisplen
, memlen
- lisplen
);
3194 allocate_buffer (void)
3196 struct buffer
*b
= lisp_malloc (sizeof *b
, MEM_TYPE_BUFFER
);
3198 BUFFER_PVEC_INIT (b
);
3199 /* Put B on the chain of all buffers including killed ones. */
3200 b
->next
= all_buffers
;
3202 /* Note that the rest fields of B are not initialized. */
3206 struct Lisp_Hash_Table
*
3207 allocate_hash_table (void)
3209 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
3213 allocate_window (void)
3217 w
= ALLOCATE_PSEUDOVECTOR (struct window
, current_matrix
, PVEC_WINDOW
);
3218 /* Users assumes that non-Lisp data is zeroed. */
3219 memset (&w
->current_matrix
, 0,
3220 sizeof (*w
) - offsetof (struct window
, current_matrix
));
3225 allocate_terminal (void)
3229 t
= ALLOCATE_PSEUDOVECTOR (struct terminal
, next_terminal
, PVEC_TERMINAL
);
3230 /* Users assumes that non-Lisp data is zeroed. */
3231 memset (&t
->next_terminal
, 0,
3232 sizeof (*t
) - offsetof (struct terminal
, next_terminal
));
3237 allocate_frame (void)
3241 f
= ALLOCATE_PSEUDOVECTOR (struct frame
, face_cache
, PVEC_FRAME
);
3242 /* Users assumes that non-Lisp data is zeroed. */
3243 memset (&f
->face_cache
, 0,
3244 sizeof (*f
) - offsetof (struct frame
, face_cache
));
3248 struct Lisp_Process
*
3249 allocate_process (void)
3251 struct Lisp_Process
*p
;
3253 p
= ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
3254 /* Users assumes that non-Lisp data is zeroed. */
3256 sizeof (*p
) - offsetof (struct Lisp_Process
, pid
));
3260 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3261 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3262 See also the function `vector'. */)
3263 (register Lisp_Object length
, Lisp_Object init
)
3266 register ptrdiff_t sizei
;
3267 register ptrdiff_t i
;
3268 register struct Lisp_Vector
*p
;
3270 CHECK_NATNUM (length
);
3272 p
= allocate_vector (XFASTINT (length
));
3273 sizei
= XFASTINT (length
);
3274 for (i
= 0; i
< sizei
; i
++)
3275 p
->contents
[i
] = init
;
3277 XSETVECTOR (vector
, p
);
3282 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3283 doc
: /* Return a newly created vector with specified arguments as elements.
3284 Any number of arguments, even zero arguments, are allowed.
3285 usage: (vector &rest OBJECTS) */)
3286 (ptrdiff_t nargs
, Lisp_Object
*args
)
3289 register Lisp_Object val
= make_uninit_vector (nargs
);
3290 register struct Lisp_Vector
*p
= XVECTOR (val
);
3292 for (i
= 0; i
< nargs
; i
++)
3293 p
->contents
[i
] = args
[i
];
3298 make_byte_code (struct Lisp_Vector
*v
)
3300 /* Don't allow the global zero_vector to become a byte code object. */
3301 eassert (0 < v
->header
.size
);
3303 if (v
->header
.size
> 1 && STRINGP (v
->contents
[1])
3304 && STRING_MULTIBYTE (v
->contents
[1]))
3305 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3306 earlier because they produced a raw 8-bit string for byte-code
3307 and now such a byte-code string is loaded as multibyte while
3308 raw 8-bit characters converted to multibyte form. Thus, now we
3309 must convert them back to the original unibyte form. */
3310 v
->contents
[1] = Fstring_as_unibyte (v
->contents
[1]);
3311 XSETPVECTYPE (v
, PVEC_COMPILED
);
3314 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3315 doc
: /* Create a byte-code object with specified arguments as elements.
3316 The arguments should be the ARGLIST, bytecode-string BYTE-CODE, constant
3317 vector CONSTANTS, maximum stack size DEPTH, (optional) DOCSTRING,
3318 and (optional) INTERACTIVE-SPEC.
3319 The first four arguments are required; at most six have any
3321 The ARGLIST can be either like the one of `lambda', in which case the arguments
3322 will be dynamically bound before executing the byte code, or it can be an
3323 integer of the form NNNNNNNRMMMMMMM where the 7bit MMMMMMM specifies the
3324 minimum number of arguments, the 7-bit NNNNNNN specifies the maximum number
3325 of arguments (ignoring &rest) and the R bit specifies whether there is a &rest
3326 argument to catch the left-over arguments. If such an integer is used, the
3327 arguments will not be dynamically bound but will be instead pushed on the
3328 stack before executing the byte-code.
3329 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3330 (ptrdiff_t nargs
, Lisp_Object
*args
)
3333 register Lisp_Object val
= make_uninit_vector (nargs
);
3334 register struct Lisp_Vector
*p
= XVECTOR (val
);
3336 /* We used to purecopy everything here, if purify-flag was set. This worked
3337 OK for Emacs-23, but with Emacs-24's lexical binding code, it can be
3338 dangerous, since make-byte-code is used during execution to build
3339 closures, so any closure built during the preload phase would end up
3340 copied into pure space, including its free variables, which is sometimes
3341 just wasteful and other times plainly wrong (e.g. those free vars may want
3344 for (i
= 0; i
< nargs
; i
++)
3345 p
->contents
[i
] = args
[i
];
3347 XSETCOMPILED (val
, p
);
3353 /***********************************************************************
3355 ***********************************************************************/
3357 /* Like struct Lisp_Symbol, but padded so that the size is a multiple
3358 of the required alignment if LSB tags are used. */
3360 union aligned_Lisp_Symbol
3362 struct Lisp_Symbol s
;
3364 unsigned char c
[(sizeof (struct Lisp_Symbol
) + GCALIGNMENT
- 1)
3369 /* Each symbol_block is just under 1020 bytes long, since malloc
3370 really allocates in units of powers of two and uses 4 bytes for its
3373 #define SYMBOL_BLOCK_SIZE \
3374 ((1020 - sizeof (struct symbol_block *)) / sizeof (union aligned_Lisp_Symbol))
3378 /* Place `symbols' first, to preserve alignment. */
3379 union aligned_Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3380 struct symbol_block
*next
;
3383 /* Current symbol block and index of first unused Lisp_Symbol
3386 static struct symbol_block
*symbol_block
;
3387 static int symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3388 /* Pointer to the first symbol_block that contains pinned symbols.
3389 Tests for 24.4 showed that at dump-time, Emacs contains about 15K symbols,
3390 10K of which are pinned (and all but 250 of them are interned in obarray),
3391 whereas a "typical session" has in the order of 30K symbols.
3392 `symbol_block_pinned' lets mark_pinned_symbols scan only 15K symbols rather
3393 than 30K to find the 10K symbols we need to mark. */
3394 static struct symbol_block
*symbol_block_pinned
;
3396 /* List of free symbols. */
3398 static struct Lisp_Symbol
*symbol_free_list
;
3401 set_symbol_name (Lisp_Object sym
, Lisp_Object name
)
3403 XSYMBOL (sym
)->name
= name
;
3406 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3407 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3408 Its value is void, and its function definition and property list are nil. */)
3411 register Lisp_Object val
;
3412 register struct Lisp_Symbol
*p
;
3414 CHECK_STRING (name
);
3418 if (symbol_free_list
)
3420 XSETSYMBOL (val
, symbol_free_list
);
3421 symbol_free_list
= symbol_free_list
->next
;
3425 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3427 struct symbol_block
*new
3428 = lisp_malloc (sizeof *new, MEM_TYPE_SYMBOL
);
3429 new->next
= symbol_block
;
3431 symbol_block_index
= 0;
3432 total_free_symbols
+= SYMBOL_BLOCK_SIZE
;
3434 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
].s
);
3435 symbol_block_index
++;
3438 MALLOC_UNBLOCK_INPUT
;
3441 set_symbol_name (val
, name
);
3442 set_symbol_plist (val
, Qnil
);
3443 p
->redirect
= SYMBOL_PLAINVAL
;
3444 SET_SYMBOL_VAL (p
, Qunbound
);
3445 set_symbol_function (val
, Qnil
);
3446 set_symbol_next (val
, NULL
);
3447 p
->gcmarkbit
= false;
3448 p
->interned
= SYMBOL_UNINTERNED
;
3450 p
->declared_special
= false;
3452 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3454 total_free_symbols
--;
3460 /***********************************************************************
3461 Marker (Misc) Allocation
3462 ***********************************************************************/
3464 /* Like union Lisp_Misc, but padded so that its size is a multiple of
3465 the required alignment when LSB tags are used. */
3467 union aligned_Lisp_Misc
3471 unsigned char c
[(sizeof (union Lisp_Misc
) + GCALIGNMENT
- 1)
3476 /* Allocation of markers and other objects that share that structure.
3477 Works like allocation of conses. */
3479 #define MARKER_BLOCK_SIZE \
3480 ((1020 - sizeof (struct marker_block *)) / sizeof (union aligned_Lisp_Misc))
3484 /* Place `markers' first, to preserve alignment. */
3485 union aligned_Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3486 struct marker_block
*next
;
3489 static struct marker_block
*marker_block
;
3490 static int marker_block_index
= MARKER_BLOCK_SIZE
;
3492 static union Lisp_Misc
*marker_free_list
;
3494 /* Return a newly allocated Lisp_Misc object of specified TYPE. */
3497 allocate_misc (enum Lisp_Misc_Type type
)
3503 if (marker_free_list
)
3505 XSETMISC (val
, marker_free_list
);
3506 marker_free_list
= marker_free_list
->u_free
.chain
;
3510 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3512 struct marker_block
*new = lisp_malloc (sizeof *new, MEM_TYPE_MISC
);
3513 new->next
= marker_block
;
3515 marker_block_index
= 0;
3516 total_free_markers
+= MARKER_BLOCK_SIZE
;
3518 XSETMISC (val
, &marker_block
->markers
[marker_block_index
].m
);
3519 marker_block_index
++;
3522 MALLOC_UNBLOCK_INPUT
;
3524 --total_free_markers
;
3525 consing_since_gc
+= sizeof (union Lisp_Misc
);
3526 misc_objects_consed
++;
3527 XMISCANY (val
)->type
= type
;
3528 XMISCANY (val
)->gcmarkbit
= 0;
3532 /* Free a Lisp_Misc object. */
3535 free_misc (Lisp_Object misc
)
3537 XMISCANY (misc
)->type
= Lisp_Misc_Free
;
3538 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3539 marker_free_list
= XMISC (misc
);
3540 consing_since_gc
-= sizeof (union Lisp_Misc
);
3541 total_free_markers
++;
3544 /* Verify properties of Lisp_Save_Value's representation
3545 that are assumed here and elsewhere. */
3547 verify (SAVE_UNUSED
== 0);
3548 verify (((SAVE_INTEGER
| SAVE_POINTER
| SAVE_FUNCPOINTER
| SAVE_OBJECT
)
3552 /* Return Lisp_Save_Value objects for the various combinations
3553 that callers need. */
3556 make_save_int_int_int (ptrdiff_t a
, ptrdiff_t b
, ptrdiff_t c
)
3558 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3559 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3560 p
->save_type
= SAVE_TYPE_INT_INT_INT
;
3561 p
->data
[0].integer
= a
;
3562 p
->data
[1].integer
= b
;
3563 p
->data
[2].integer
= c
;
3568 make_save_obj_obj_obj_obj (Lisp_Object a
, Lisp_Object b
, Lisp_Object c
,
3571 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3572 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3573 p
->save_type
= SAVE_TYPE_OBJ_OBJ_OBJ_OBJ
;
3574 p
->data
[0].object
= a
;
3575 p
->data
[1].object
= b
;
3576 p
->data
[2].object
= c
;
3577 p
->data
[3].object
= d
;
3582 make_save_ptr (void *a
)
3584 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3585 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3586 p
->save_type
= SAVE_POINTER
;
3587 p
->data
[0].pointer
= a
;
3592 make_save_ptr_int (void *a
, ptrdiff_t b
)
3594 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3595 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3596 p
->save_type
= SAVE_TYPE_PTR_INT
;
3597 p
->data
[0].pointer
= a
;
3598 p
->data
[1].integer
= b
;
3602 #if ! (defined USE_X_TOOLKIT || defined USE_GTK)
3604 make_save_ptr_ptr (void *a
, void *b
)
3606 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3607 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3608 p
->save_type
= SAVE_TYPE_PTR_PTR
;
3609 p
->data
[0].pointer
= a
;
3610 p
->data
[1].pointer
= b
;
3616 make_save_funcptr_ptr_obj (void (*a
) (void), void *b
, Lisp_Object c
)
3618 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3619 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3620 p
->save_type
= SAVE_TYPE_FUNCPTR_PTR_OBJ
;
3621 p
->data
[0].funcpointer
= a
;
3622 p
->data
[1].pointer
= b
;
3623 p
->data
[2].object
= c
;
3627 /* Return a Lisp_Save_Value object that represents an array A
3628 of N Lisp objects. */
3631 make_save_memory (Lisp_Object
*a
, ptrdiff_t n
)
3633 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3634 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3635 p
->save_type
= SAVE_TYPE_MEMORY
;
3636 p
->data
[0].pointer
= a
;
3637 p
->data
[1].integer
= n
;
3641 /* Free a Lisp_Save_Value object. Do not use this function
3642 if SAVE contains pointer other than returned by xmalloc. */
3645 free_save_value (Lisp_Object save
)
3647 xfree (XSAVE_POINTER (save
, 0));
3651 /* Return a Lisp_Misc_Overlay object with specified START, END and PLIST. */
3654 build_overlay (Lisp_Object start
, Lisp_Object end
, Lisp_Object plist
)
3656 register Lisp_Object overlay
;
3658 overlay
= allocate_misc (Lisp_Misc_Overlay
);
3659 OVERLAY_START (overlay
) = start
;
3660 OVERLAY_END (overlay
) = end
;
3661 set_overlay_plist (overlay
, plist
);
3662 XOVERLAY (overlay
)->next
= NULL
;
3666 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3667 doc
: /* Return a newly allocated marker which does not point at any place. */)
3670 register Lisp_Object val
;
3671 register struct Lisp_Marker
*p
;
3673 val
= allocate_misc (Lisp_Misc_Marker
);
3679 p
->insertion_type
= 0;
3680 p
->need_adjustment
= 0;
3684 /* Return a newly allocated marker which points into BUF
3685 at character position CHARPOS and byte position BYTEPOS. */
3688 build_marker (struct buffer
*buf
, ptrdiff_t charpos
, ptrdiff_t bytepos
)
3691 struct Lisp_Marker
*m
;
3693 /* No dead buffers here. */
3694 eassert (BUFFER_LIVE_P (buf
));
3696 /* Every character is at least one byte. */
3697 eassert (charpos
<= bytepos
);
3699 obj
= allocate_misc (Lisp_Misc_Marker
);
3702 m
->charpos
= charpos
;
3703 m
->bytepos
= bytepos
;
3704 m
->insertion_type
= 0;
3705 m
->need_adjustment
= 0;
3706 m
->next
= BUF_MARKERS (buf
);
3707 BUF_MARKERS (buf
) = m
;
3711 /* Put MARKER back on the free list after using it temporarily. */
3714 free_marker (Lisp_Object marker
)
3716 unchain_marker (XMARKER (marker
));
3721 /* Return a newly created vector or string with specified arguments as
3722 elements. If all the arguments are characters that can fit
3723 in a string of events, make a string; otherwise, make a vector.
3725 Any number of arguments, even zero arguments, are allowed. */
3728 make_event_array (ptrdiff_t nargs
, Lisp_Object
*args
)
3732 for (i
= 0; i
< nargs
; i
++)
3733 /* The things that fit in a string
3734 are characters that are in 0...127,
3735 after discarding the meta bit and all the bits above it. */
3736 if (!INTEGERP (args
[i
])
3737 || (XINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3738 return Fvector (nargs
, args
);
3740 /* Since the loop exited, we know that all the things in it are
3741 characters, so we can make a string. */
3745 result
= Fmake_string (make_number (nargs
), make_number (0));
3746 for (i
= 0; i
< nargs
; i
++)
3748 SSET (result
, i
, XINT (args
[i
]));
3749 /* Move the meta bit to the right place for a string char. */
3750 if (XINT (args
[i
]) & CHAR_META
)
3751 SSET (result
, i
, SREF (result
, i
) | 0x80);
3760 /************************************************************************
3761 Memory Full Handling
3762 ************************************************************************/
3765 /* Called if malloc (NBYTES) returns zero. If NBYTES == SIZE_MAX,
3766 there may have been size_t overflow so that malloc was never
3767 called, or perhaps malloc was invoked successfully but the
3768 resulting pointer had problems fitting into a tagged EMACS_INT. In
3769 either case this counts as memory being full even though malloc did
3773 memory_full (size_t nbytes
)
3775 /* Do not go into hysterics merely because a large request failed. */
3776 bool enough_free_memory
= 0;
3777 if (SPARE_MEMORY
< nbytes
)
3782 p
= malloc (SPARE_MEMORY
);
3786 enough_free_memory
= 1;
3788 MALLOC_UNBLOCK_INPUT
;
3791 if (! enough_free_memory
)
3797 memory_full_cons_threshold
= sizeof (struct cons_block
);
3799 /* The first time we get here, free the spare memory. */
3800 for (i
= 0; i
< ARRAYELTS (spare_memory
); i
++)
3801 if (spare_memory
[i
])
3804 free (spare_memory
[i
]);
3805 else if (i
>= 1 && i
<= 4)
3806 lisp_align_free (spare_memory
[i
]);
3808 lisp_free (spare_memory
[i
]);
3809 spare_memory
[i
] = 0;
3813 /* This used to call error, but if we've run out of memory, we could
3814 get infinite recursion trying to build the string. */
3815 xsignal (Qnil
, Vmemory_signal_data
);
3818 /* If we released our reserve (due to running out of memory),
3819 and we have a fair amount free once again,
3820 try to set aside another reserve in case we run out once more.
3822 This is called when a relocatable block is freed in ralloc.c,
3823 and also directly from this file, in case we're not using ralloc.c. */
3826 refill_memory_reserve (void)
3828 #ifndef SYSTEM_MALLOC
3829 if (spare_memory
[0] == 0)
3830 spare_memory
[0] = malloc (SPARE_MEMORY
);
3831 if (spare_memory
[1] == 0)
3832 spare_memory
[1] = lisp_align_malloc (sizeof (struct cons_block
),
3834 if (spare_memory
[2] == 0)
3835 spare_memory
[2] = lisp_align_malloc (sizeof (struct cons_block
),
3837 if (spare_memory
[3] == 0)
3838 spare_memory
[3] = lisp_align_malloc (sizeof (struct cons_block
),
3840 if (spare_memory
[4] == 0)
3841 spare_memory
[4] = lisp_align_malloc (sizeof (struct cons_block
),
3843 if (spare_memory
[5] == 0)
3844 spare_memory
[5] = lisp_malloc (sizeof (struct string_block
),
3846 if (spare_memory
[6] == 0)
3847 spare_memory
[6] = lisp_malloc (sizeof (struct string_block
),
3849 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3850 Vmemory_full
= Qnil
;
3854 /************************************************************************
3856 ************************************************************************/
3858 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3860 /* Conservative C stack marking requires a method to identify possibly
3861 live Lisp objects given a pointer value. We do this by keeping
3862 track of blocks of Lisp data that are allocated in a red-black tree
3863 (see also the comment of mem_node which is the type of nodes in
3864 that tree). Function lisp_malloc adds information for an allocated
3865 block to the red-black tree with calls to mem_insert, and function
3866 lisp_free removes it with mem_delete. Functions live_string_p etc
3867 call mem_find to lookup information about a given pointer in the
3868 tree, and use that to determine if the pointer points to a Lisp
3871 /* Initialize this part of alloc.c. */
3876 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3877 mem_z
.parent
= NULL
;
3878 mem_z
.color
= MEM_BLACK
;
3879 mem_z
.start
= mem_z
.end
= NULL
;
3884 /* Value is a pointer to the mem_node containing START. Value is
3885 MEM_NIL if there is no node in the tree containing START. */
3887 static struct mem_node
*
3888 mem_find (void *start
)
3892 if (start
< min_heap_address
|| start
> max_heap_address
)
3895 /* Make the search always successful to speed up the loop below. */
3896 mem_z
.start
= start
;
3897 mem_z
.end
= (char *) start
+ 1;
3900 while (start
< p
->start
|| start
>= p
->end
)
3901 p
= start
< p
->start
? p
->left
: p
->right
;
3906 /* Insert a new node into the tree for a block of memory with start
3907 address START, end address END, and type TYPE. Value is a
3908 pointer to the node that was inserted. */
3910 static struct mem_node
*
3911 mem_insert (void *start
, void *end
, enum mem_type type
)
3913 struct mem_node
*c
, *parent
, *x
;
3915 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3916 min_heap_address
= start
;
3917 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3918 max_heap_address
= end
;
3920 /* See where in the tree a node for START belongs. In this
3921 particular application, it shouldn't happen that a node is already
3922 present. For debugging purposes, let's check that. */
3926 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3928 while (c
!= MEM_NIL
)
3930 if (start
>= c
->start
&& start
< c
->end
)
3933 c
= start
< c
->start
? c
->left
: c
->right
;
3936 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3938 while (c
!= MEM_NIL
)
3941 c
= start
< c
->start
? c
->left
: c
->right
;
3944 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3946 /* Create a new node. */
3947 #ifdef GC_MALLOC_CHECK
3948 x
= malloc (sizeof *x
);
3952 x
= xmalloc (sizeof *x
);
3958 x
->left
= x
->right
= MEM_NIL
;
3961 /* Insert it as child of PARENT or install it as root. */
3964 if (start
< parent
->start
)
3972 /* Re-establish red-black tree properties. */
3973 mem_insert_fixup (x
);
3979 /* Re-establish the red-black properties of the tree, and thereby
3980 balance the tree, after node X has been inserted; X is always red. */
3983 mem_insert_fixup (struct mem_node
*x
)
3985 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3987 /* X is red and its parent is red. This is a violation of
3988 red-black tree property #3. */
3990 if (x
->parent
== x
->parent
->parent
->left
)
3992 /* We're on the left side of our grandparent, and Y is our
3994 struct mem_node
*y
= x
->parent
->parent
->right
;
3996 if (y
->color
== MEM_RED
)
3998 /* Uncle and parent are red but should be black because
3999 X is red. Change the colors accordingly and proceed
4000 with the grandparent. */
4001 x
->parent
->color
= MEM_BLACK
;
4002 y
->color
= MEM_BLACK
;
4003 x
->parent
->parent
->color
= MEM_RED
;
4004 x
= x
->parent
->parent
;
4008 /* Parent and uncle have different colors; parent is
4009 red, uncle is black. */
4010 if (x
== x
->parent
->right
)
4013 mem_rotate_left (x
);
4016 x
->parent
->color
= MEM_BLACK
;
4017 x
->parent
->parent
->color
= MEM_RED
;
4018 mem_rotate_right (x
->parent
->parent
);
4023 /* This is the symmetrical case of above. */
4024 struct mem_node
*y
= x
->parent
->parent
->left
;
4026 if (y
->color
== MEM_RED
)
4028 x
->parent
->color
= MEM_BLACK
;
4029 y
->color
= MEM_BLACK
;
4030 x
->parent
->parent
->color
= MEM_RED
;
4031 x
= x
->parent
->parent
;
4035 if (x
== x
->parent
->left
)
4038 mem_rotate_right (x
);
4041 x
->parent
->color
= MEM_BLACK
;
4042 x
->parent
->parent
->color
= MEM_RED
;
4043 mem_rotate_left (x
->parent
->parent
);
4048 /* The root may have been changed to red due to the algorithm. Set
4049 it to black so that property #5 is satisfied. */
4050 mem_root
->color
= MEM_BLACK
;
4061 mem_rotate_left (struct mem_node
*x
)
4065 /* Turn y's left sub-tree into x's right sub-tree. */
4068 if (y
->left
!= MEM_NIL
)
4069 y
->left
->parent
= x
;
4071 /* Y's parent was x's parent. */
4073 y
->parent
= x
->parent
;
4075 /* Get the parent to point to y instead of x. */
4078 if (x
== x
->parent
->left
)
4079 x
->parent
->left
= y
;
4081 x
->parent
->right
= y
;
4086 /* Put x on y's left. */
4100 mem_rotate_right (struct mem_node
*x
)
4102 struct mem_node
*y
= x
->left
;
4105 if (y
->right
!= MEM_NIL
)
4106 y
->right
->parent
= x
;
4109 y
->parent
= x
->parent
;
4112 if (x
== x
->parent
->right
)
4113 x
->parent
->right
= y
;
4115 x
->parent
->left
= y
;
4126 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
4129 mem_delete (struct mem_node
*z
)
4131 struct mem_node
*x
, *y
;
4133 if (!z
|| z
== MEM_NIL
)
4136 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
4141 while (y
->left
!= MEM_NIL
)
4145 if (y
->left
!= MEM_NIL
)
4150 x
->parent
= y
->parent
;
4153 if (y
== y
->parent
->left
)
4154 y
->parent
->left
= x
;
4156 y
->parent
->right
= x
;
4163 z
->start
= y
->start
;
4168 if (y
->color
== MEM_BLACK
)
4169 mem_delete_fixup (x
);
4171 #ifdef GC_MALLOC_CHECK
4179 /* Re-establish the red-black properties of the tree, after a
4183 mem_delete_fixup (struct mem_node
*x
)
4185 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
4187 if (x
== x
->parent
->left
)
4189 struct mem_node
*w
= x
->parent
->right
;
4191 if (w
->color
== MEM_RED
)
4193 w
->color
= MEM_BLACK
;
4194 x
->parent
->color
= MEM_RED
;
4195 mem_rotate_left (x
->parent
);
4196 w
= x
->parent
->right
;
4199 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
4206 if (w
->right
->color
== MEM_BLACK
)
4208 w
->left
->color
= MEM_BLACK
;
4210 mem_rotate_right (w
);
4211 w
= x
->parent
->right
;
4213 w
->color
= x
->parent
->color
;
4214 x
->parent
->color
= MEM_BLACK
;
4215 w
->right
->color
= MEM_BLACK
;
4216 mem_rotate_left (x
->parent
);
4222 struct mem_node
*w
= x
->parent
->left
;
4224 if (w
->color
== MEM_RED
)
4226 w
->color
= MEM_BLACK
;
4227 x
->parent
->color
= MEM_RED
;
4228 mem_rotate_right (x
->parent
);
4229 w
= x
->parent
->left
;
4232 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
4239 if (w
->left
->color
== MEM_BLACK
)
4241 w
->right
->color
= MEM_BLACK
;
4243 mem_rotate_left (w
);
4244 w
= x
->parent
->left
;
4247 w
->color
= x
->parent
->color
;
4248 x
->parent
->color
= MEM_BLACK
;
4249 w
->left
->color
= MEM_BLACK
;
4250 mem_rotate_right (x
->parent
);
4256 x
->color
= MEM_BLACK
;
4260 /* Value is non-zero if P is a pointer to a live Lisp string on
4261 the heap. M is a pointer to the mem_block for P. */
4264 live_string_p (struct mem_node
*m
, void *p
)
4266 if (m
->type
== MEM_TYPE_STRING
)
4268 struct string_block
*b
= m
->start
;
4269 ptrdiff_t offset
= (char *) p
- (char *) &b
->strings
[0];
4271 /* P must point to the start of a Lisp_String structure, and it
4272 must not be on the free-list. */
4274 && offset
% sizeof b
->strings
[0] == 0
4275 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
4276 && ((struct Lisp_String
*) p
)->data
!= NULL
);
4283 /* Value is non-zero if P is a pointer to a live Lisp cons on
4284 the heap. M is a pointer to the mem_block for P. */
4287 live_cons_p (struct mem_node
*m
, void *p
)
4289 if (m
->type
== MEM_TYPE_CONS
)
4291 struct cons_block
*b
= m
->start
;
4292 ptrdiff_t offset
= (char *) p
- (char *) &b
->conses
[0];
4294 /* P must point to the start of a Lisp_Cons, not be
4295 one of the unused cells in the current cons block,
4296 and not be on the free-list. */
4298 && offset
% sizeof b
->conses
[0] == 0
4299 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
4301 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
4302 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
4309 /* Value is non-zero if P is a pointer to a live Lisp symbol on
4310 the heap. M is a pointer to the mem_block for P. */
4313 live_symbol_p (struct mem_node
*m
, void *p
)
4315 if (m
->type
== MEM_TYPE_SYMBOL
)
4317 struct symbol_block
*b
= m
->start
;
4318 ptrdiff_t offset
= (char *) p
- (char *) &b
->symbols
[0];
4320 /* P must point to the start of a Lisp_Symbol, not be
4321 one of the unused cells in the current symbol block,
4322 and not be on the free-list. */
4324 && offset
% sizeof b
->symbols
[0] == 0
4325 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
4326 && (b
!= symbol_block
4327 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
4328 && !EQ (((struct Lisp_Symbol
*)p
)->function
, Vdead
));
4335 /* Value is non-zero if P is a pointer to a live Lisp float on
4336 the heap. M is a pointer to the mem_block for P. */
4339 live_float_p (struct mem_node
*m
, void *p
)
4341 if (m
->type
== MEM_TYPE_FLOAT
)
4343 struct float_block
*b
= m
->start
;
4344 ptrdiff_t offset
= (char *) p
- (char *) &b
->floats
[0];
4346 /* P must point to the start of a Lisp_Float and not be
4347 one of the unused cells in the current float block. */
4349 && offset
% sizeof b
->floats
[0] == 0
4350 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
4351 && (b
!= float_block
4352 || offset
/ sizeof b
->floats
[0] < float_block_index
));
4359 /* Value is non-zero if P is a pointer to a live Lisp Misc on
4360 the heap. M is a pointer to the mem_block for P. */
4363 live_misc_p (struct mem_node
*m
, void *p
)
4365 if (m
->type
== MEM_TYPE_MISC
)
4367 struct marker_block
*b
= m
->start
;
4368 ptrdiff_t offset
= (char *) p
- (char *) &b
->markers
[0];
4370 /* P must point to the start of a Lisp_Misc, not be
4371 one of the unused cells in the current misc block,
4372 and not be on the free-list. */
4374 && offset
% sizeof b
->markers
[0] == 0
4375 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4376 && (b
!= marker_block
4377 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4378 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
4385 /* Value is non-zero if P is a pointer to a live vector-like object.
4386 M is a pointer to the mem_block for P. */
4389 live_vector_p (struct mem_node
*m
, void *p
)
4391 if (m
->type
== MEM_TYPE_VECTOR_BLOCK
)
4393 /* This memory node corresponds to a vector block. */
4394 struct vector_block
*block
= m
->start
;
4395 struct Lisp_Vector
*vector
= (struct Lisp_Vector
*) block
->data
;
4397 /* P is in the block's allocation range. Scan the block
4398 up to P and see whether P points to the start of some
4399 vector which is not on a free list. FIXME: check whether
4400 some allocation patterns (probably a lot of short vectors)
4401 may cause a substantial overhead of this loop. */
4402 while (VECTOR_IN_BLOCK (vector
, block
)
4403 && vector
<= (struct Lisp_Vector
*) p
)
4405 if (!PSEUDOVECTOR_TYPEP (&vector
->header
, PVEC_FREE
) && vector
== p
)
4408 vector
= ADVANCE (vector
, vector_nbytes (vector
));
4411 else if (m
->type
== MEM_TYPE_VECTORLIKE
&& p
== large_vector_vec (m
->start
))
4412 /* This memory node corresponds to a large vector. */
4418 /* Value is non-zero if P is a pointer to a live buffer. M is a
4419 pointer to the mem_block for P. */
4422 live_buffer_p (struct mem_node
*m
, void *p
)
4424 /* P must point to the start of the block, and the buffer
4425 must not have been killed. */
4426 return (m
->type
== MEM_TYPE_BUFFER
4428 && !NILP (((struct buffer
*) p
)->INTERNAL_FIELD (name
)));
4431 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4435 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4437 /* Currently not used, but may be called from gdb. */
4439 void dump_zombies (void) EXTERNALLY_VISIBLE
;
4441 /* Array of objects that are kept alive because the C stack contains
4442 a pattern that looks like a reference to them. */
4444 #define MAX_ZOMBIES 10
4445 static Lisp_Object zombies
[MAX_ZOMBIES
];
4447 /* Number of zombie objects. */
4449 static EMACS_INT nzombies
;
4451 /* Number of garbage collections. */
4453 static EMACS_INT ngcs
;
4455 /* Average percentage of zombies per collection. */
4457 static double avg_zombies
;
4459 /* Max. number of live and zombie objects. */
4461 static EMACS_INT max_live
, max_zombies
;
4463 /* Average number of live objects per GC. */
4465 static double avg_live
;
4467 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4468 doc
: /* Show information about live and zombie objects. */)
4471 Lisp_Object args
[8], zombie_list
= Qnil
;
4473 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); i
++)
4474 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4475 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4476 args
[1] = make_number (ngcs
);
4477 args
[2] = make_float (avg_live
);
4478 args
[3] = make_float (avg_zombies
);
4479 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4480 args
[5] = make_number (max_live
);
4481 args
[6] = make_number (max_zombies
);
4482 args
[7] = zombie_list
;
4483 return Fmessage (8, args
);
4486 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4489 /* Mark OBJ if we can prove it's a Lisp_Object. */
4492 mark_maybe_object (Lisp_Object obj
)
4499 VALGRIND_MAKE_MEM_DEFINED (&obj
, sizeof (obj
));
4505 po
= (void *) XPNTR (obj
);
4512 switch (XTYPE (obj
))
4515 mark_p
= (live_string_p (m
, po
)
4516 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4520 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4524 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4528 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4531 case Lisp_Vectorlike
:
4532 /* Note: can't check BUFFERP before we know it's a
4533 buffer because checking that dereferences the pointer
4534 PO which might point anywhere. */
4535 if (live_vector_p (m
, po
))
4536 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4537 else if (live_buffer_p (m
, po
))
4538 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4542 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4551 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4552 if (nzombies
< MAX_ZOMBIES
)
4553 zombies
[nzombies
] = obj
;
4561 /* Return true if P can point to Lisp data, and false otherwise.
4562 USE_LSB_TAG needs Lisp data to be aligned on multiples of GCALIGNMENT.
4563 Otherwise, assume that Lisp data is aligned on even addresses. */
4566 maybe_lisp_pointer (void *p
)
4568 return !((intptr_t) p
% (USE_LSB_TAG
? GCALIGNMENT
: 2));
4571 /* If P points to Lisp data, mark that as live if it isn't already
4575 mark_maybe_pointer (void *p
)
4581 VALGRIND_MAKE_MEM_DEFINED (&p
, sizeof (p
));
4584 if (!maybe_lisp_pointer (p
))
4590 Lisp_Object obj
= Qnil
;
4594 case MEM_TYPE_NON_LISP
:
4595 case MEM_TYPE_SPARE
:
4596 /* Nothing to do; not a pointer to Lisp memory. */
4599 case MEM_TYPE_BUFFER
:
4600 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P ((struct buffer
*)p
))
4601 XSETVECTOR (obj
, p
);
4605 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4609 case MEM_TYPE_STRING
:
4610 if (live_string_p (m
, p
)
4611 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4612 XSETSTRING (obj
, p
);
4616 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4620 case MEM_TYPE_SYMBOL
:
4621 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4622 XSETSYMBOL (obj
, p
);
4625 case MEM_TYPE_FLOAT
:
4626 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4630 case MEM_TYPE_VECTORLIKE
:
4631 case MEM_TYPE_VECTOR_BLOCK
:
4632 if (live_vector_p (m
, p
))
4635 XSETVECTOR (tem
, p
);
4636 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4651 /* Alignment of pointer values. Use alignof, as it sometimes returns
4652 a smaller alignment than GCC's __alignof__ and mark_memory might
4653 miss objects if __alignof__ were used. */
4654 #define GC_POINTER_ALIGNMENT alignof (void *)
4656 /* Define POINTERS_MIGHT_HIDE_IN_OBJECTS to 1 if marking via C pointers does
4657 not suffice, which is the typical case. A host where a Lisp_Object is
4658 wider than a pointer might allocate a Lisp_Object in non-adjacent halves.
4659 If USE_LSB_TAG, the bottom half is not a valid pointer, but it should
4660 suffice to widen it to to a Lisp_Object and check it that way. */
4661 #if USE_LSB_TAG || VAL_MAX < UINTPTR_MAX
4662 # if !USE_LSB_TAG && VAL_MAX < UINTPTR_MAX >> GCTYPEBITS
4663 /* If tag bits straddle pointer-word boundaries, neither mark_maybe_pointer
4664 nor mark_maybe_object can follow the pointers. This should not occur on
4665 any practical porting target. */
4666 # error "MSB type bits straddle pointer-word boundaries"
4668 /* Marking via C pointers does not suffice, because Lisp_Objects contain
4669 pointer words that hold pointers ORed with type bits. */
4670 # define POINTERS_MIGHT_HIDE_IN_OBJECTS 1
4672 /* Marking via C pointers suffices, because Lisp_Objects contain pointer
4673 words that hold unmodified pointers. */
4674 # define POINTERS_MIGHT_HIDE_IN_OBJECTS 0
4677 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4678 or END+OFFSET..START. */
4680 static void ATTRIBUTE_NO_SANITIZE_ADDRESS
4681 mark_memory (void *start
, void *end
)
4686 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4690 /* Make START the pointer to the start of the memory region,
4691 if it isn't already. */
4699 /* Mark Lisp data pointed to. This is necessary because, in some
4700 situations, the C compiler optimizes Lisp objects away, so that
4701 only a pointer to them remains. Example:
4703 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4706 Lisp_Object obj = build_string ("test");
4707 struct Lisp_String *s = XSTRING (obj);
4708 Fgarbage_collect ();
4709 fprintf (stderr, "test `%s'\n", s->data);
4713 Here, `obj' isn't really used, and the compiler optimizes it
4714 away. The only reference to the life string is through the
4717 for (pp
= start
; (void *) pp
< end
; pp
++)
4718 for (i
= 0; i
< sizeof *pp
; i
+= GC_POINTER_ALIGNMENT
)
4720 void *p
= *(void **) ((char *) pp
+ i
);
4721 mark_maybe_pointer (p
);
4722 if (POINTERS_MIGHT_HIDE_IN_OBJECTS
)
4723 mark_maybe_object (XIL ((intptr_t) p
));
4727 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4729 static bool setjmp_tested_p
;
4730 static int longjmps_done
;
4732 #define SETJMP_WILL_LIKELY_WORK "\
4734 Emacs garbage collector has been changed to use conservative stack\n\
4735 marking. Emacs has determined that the method it uses to do the\n\
4736 marking will likely work on your system, but this isn't sure.\n\
4738 If you are a system-programmer, or can get the help of a local wizard\n\
4739 who is, please take a look at the function mark_stack in alloc.c, and\n\
4740 verify that the methods used are appropriate for your system.\n\
4742 Please mail the result to <emacs-devel@gnu.org>.\n\
4745 #define SETJMP_WILL_NOT_WORK "\
4747 Emacs garbage collector has been changed to use conservative stack\n\
4748 marking. Emacs has determined that the default method it uses to do the\n\
4749 marking will not work on your system. We will need a system-dependent\n\
4750 solution for your system.\n\
4752 Please take a look at the function mark_stack in alloc.c, and\n\
4753 try to find a way to make it work on your system.\n\
4755 Note that you may get false negatives, depending on the compiler.\n\
4756 In particular, you need to use -O with GCC for this test.\n\
4758 Please mail the result to <emacs-devel@gnu.org>.\n\
4762 /* Perform a quick check if it looks like setjmp saves registers in a
4763 jmp_buf. Print a message to stderr saying so. When this test
4764 succeeds, this is _not_ a proof that setjmp is sufficient for
4765 conservative stack marking. Only the sources or a disassembly
4775 /* Arrange for X to be put in a register. */
4781 if (longjmps_done
== 1)
4783 /* Came here after the longjmp at the end of the function.
4785 If x == 1, the longjmp has restored the register to its
4786 value before the setjmp, and we can hope that setjmp
4787 saves all such registers in the jmp_buf, although that
4790 For other values of X, either something really strange is
4791 taking place, or the setjmp just didn't save the register. */
4794 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4797 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4804 if (longjmps_done
== 1)
4805 sys_longjmp (jbuf
, 1);
4808 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4811 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4813 /* Abort if anything GCPRO'd doesn't survive the GC. */
4821 for (p
= gcprolist
; p
; p
= p
->next
)
4822 for (i
= 0; i
< p
->nvars
; ++i
)
4823 if (!survives_gc_p (p
->var
[i
]))
4824 /* FIXME: It's not necessarily a bug. It might just be that the
4825 GCPRO is unnecessary or should release the object sooner. */
4829 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4836 fprintf (stderr
, "\nZombies kept alive = %"pI
"d:\n", nzombies
);
4837 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4839 fprintf (stderr
, " %d = ", i
);
4840 debug_print (zombies
[i
]);
4844 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4847 /* Mark live Lisp objects on the C stack.
4849 There are several system-dependent problems to consider when
4850 porting this to new architectures:
4854 We have to mark Lisp objects in CPU registers that can hold local
4855 variables or are used to pass parameters.
4857 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4858 something that either saves relevant registers on the stack, or
4859 calls mark_maybe_object passing it each register's contents.
4861 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4862 implementation assumes that calling setjmp saves registers we need
4863 to see in a jmp_buf which itself lies on the stack. This doesn't
4864 have to be true! It must be verified for each system, possibly
4865 by taking a look at the source code of setjmp.
4867 If __builtin_unwind_init is available (defined by GCC >= 2.8) we
4868 can use it as a machine independent method to store all registers
4869 to the stack. In this case the macros described in the previous
4870 two paragraphs are not used.
4874 Architectures differ in the way their processor stack is organized.
4875 For example, the stack might look like this
4878 | Lisp_Object | size = 4
4880 | something else | size = 2
4882 | Lisp_Object | size = 4
4886 In such a case, not every Lisp_Object will be aligned equally. To
4887 find all Lisp_Object on the stack it won't be sufficient to walk
4888 the stack in steps of 4 bytes. Instead, two passes will be
4889 necessary, one starting at the start of the stack, and a second
4890 pass starting at the start of the stack + 2. Likewise, if the
4891 minimal alignment of Lisp_Objects on the stack is 1, four passes
4892 would be necessary, each one starting with one byte more offset
4893 from the stack start. */
4896 mark_stack (void *end
)
4899 /* This assumes that the stack is a contiguous region in memory. If
4900 that's not the case, something has to be done here to iterate
4901 over the stack segments. */
4902 mark_memory (stack_base
, end
);
4904 /* Allow for marking a secondary stack, like the register stack on the
4906 #ifdef GC_MARK_SECONDARY_STACK
4907 GC_MARK_SECONDARY_STACK ();
4910 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4915 #else /* GC_MARK_STACK == 0 */
4917 #define mark_maybe_object(obj) emacs_abort ()
4919 #endif /* GC_MARK_STACK != 0 */
4922 /* Determine whether it is safe to access memory at address P. */
4924 valid_pointer_p (void *p
)
4927 return w32_valid_pointer_p (p
, 16);
4931 /* Obviously, we cannot just access it (we would SEGV trying), so we
4932 trick the o/s to tell us whether p is a valid pointer.
4933 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4934 not validate p in that case. */
4936 if (emacs_pipe (fd
) == 0)
4938 bool valid
= emacs_write (fd
[1], p
, 16) == 16;
4939 emacs_close (fd
[1]);
4940 emacs_close (fd
[0]);
4948 /* Return 2 if OBJ is a killed or special buffer object, 1 if OBJ is a
4949 valid lisp object, 0 if OBJ is NOT a valid lisp object, or -1 if we
4950 cannot validate OBJ. This function can be quite slow, so its primary
4951 use is the manual debugging. The only exception is print_object, where
4952 we use it to check whether the memory referenced by the pointer of
4953 Lisp_Save_Value object contains valid objects. */
4956 valid_lisp_object_p (Lisp_Object obj
)
4966 p
= (void *) XPNTR (obj
);
4967 if (PURE_POINTER_P (p
))
4970 if (p
== &buffer_defaults
|| p
== &buffer_local_symbols
)
4974 return valid_pointer_p (p
);
4981 int valid
= valid_pointer_p (p
);
4993 case MEM_TYPE_NON_LISP
:
4994 case MEM_TYPE_SPARE
:
4997 case MEM_TYPE_BUFFER
:
4998 return live_buffer_p (m
, p
) ? 1 : 2;
5001 return live_cons_p (m
, p
);
5003 case MEM_TYPE_STRING
:
5004 return live_string_p (m
, p
);
5007 return live_misc_p (m
, p
);
5009 case MEM_TYPE_SYMBOL
:
5010 return live_symbol_p (m
, p
);
5012 case MEM_TYPE_FLOAT
:
5013 return live_float_p (m
, p
);
5015 case MEM_TYPE_VECTORLIKE
:
5016 case MEM_TYPE_VECTOR_BLOCK
:
5017 return live_vector_p (m
, p
);
5027 /* If GC_MARK_STACK, return 1 if STR is a relocatable data of Lisp_String
5028 (i.e. there is a non-pure Lisp_Object X so that SDATA (X) == STR) and 0
5029 if not. Otherwise we can't rely on valid_lisp_object_p and return -1.
5030 This function is slow and should be used for debugging purposes. */
5033 relocatable_string_data_p (const char *str
)
5035 if (PURE_POINTER_P (str
))
5041 = (struct sdata
*) (str
- offsetof (struct sdata
, data
));
5043 if (valid_pointer_p (sdata
)
5044 && valid_pointer_p (sdata
->string
)
5045 && maybe_lisp_pointer (sdata
->string
))
5046 return (valid_lisp_object_p
5047 (make_lisp_ptr (sdata
->string
, Lisp_String
))
5048 && (const char *) sdata
->string
->data
== str
);
5051 #endif /* GC_MARK_STACK */
5055 /***********************************************************************
5056 Pure Storage Management
5057 ***********************************************************************/
5059 /* Allocate room for SIZE bytes from pure Lisp storage and return a
5060 pointer to it. TYPE is the Lisp type for which the memory is
5061 allocated. TYPE < 0 means it's not used for a Lisp object. */
5064 pure_alloc (size_t size
, int type
)
5068 size_t alignment
= GCALIGNMENT
;
5070 size_t alignment
= alignof (EMACS_INT
);
5072 /* Give Lisp_Floats an extra alignment. */
5073 if (type
== Lisp_Float
)
5074 alignment
= alignof (struct Lisp_Float
);
5080 /* Allocate space for a Lisp object from the beginning of the free
5081 space with taking account of alignment. */
5082 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
5083 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
5087 /* Allocate space for a non-Lisp object from the end of the free
5089 pure_bytes_used_non_lisp
+= size
;
5090 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
5092 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
5094 if (pure_bytes_used
<= pure_size
)
5097 /* Don't allocate a large amount here,
5098 because it might get mmap'd and then its address
5099 might not be usable. */
5100 purebeg
= xmalloc (10000);
5102 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
5103 pure_bytes_used
= 0;
5104 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
5109 /* Print a warning if PURESIZE is too small. */
5112 check_pure_size (void)
5114 if (pure_bytes_used_before_overflow
)
5115 message (("emacs:0:Pure Lisp storage overflow (approx. %"pI
"d"
5117 pure_bytes_used
+ pure_bytes_used_before_overflow
);
5121 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
5122 the non-Lisp data pool of the pure storage, and return its start
5123 address. Return NULL if not found. */
5126 find_string_data_in_pure (const char *data
, ptrdiff_t nbytes
)
5129 ptrdiff_t skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
5130 const unsigned char *p
;
5133 if (pure_bytes_used_non_lisp
<= nbytes
)
5136 /* Set up the Boyer-Moore table. */
5138 for (i
= 0; i
< 256; i
++)
5141 p
= (const unsigned char *) data
;
5143 bm_skip
[*p
++] = skip
;
5145 last_char_skip
= bm_skip
['\0'];
5147 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
5148 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
5150 /* See the comments in the function `boyer_moore' (search.c) for the
5151 use of `infinity'. */
5152 infinity
= pure_bytes_used_non_lisp
+ 1;
5153 bm_skip
['\0'] = infinity
;
5155 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
5159 /* Check the last character (== '\0'). */
5162 start
+= bm_skip
[*(p
+ start
)];
5164 while (start
<= start_max
);
5166 if (start
< infinity
)
5167 /* Couldn't find the last character. */
5170 /* No less than `infinity' means we could find the last
5171 character at `p[start - infinity]'. */
5174 /* Check the remaining characters. */
5175 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
5177 return non_lisp_beg
+ start
;
5179 start
+= last_char_skip
;
5181 while (start
<= start_max
);
5187 /* Return a string allocated in pure space. DATA is a buffer holding
5188 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
5189 means make the result string multibyte.
5191 Must get an error if pure storage is full, since if it cannot hold
5192 a large string it may be able to hold conses that point to that
5193 string; then the string is not protected from gc. */
5196 make_pure_string (const char *data
,
5197 ptrdiff_t nchars
, ptrdiff_t nbytes
, bool multibyte
)
5200 struct Lisp_String
*s
= pure_alloc (sizeof *s
, Lisp_String
);
5201 s
->data
= (unsigned char *) find_string_data_in_pure (data
, nbytes
);
5202 if (s
->data
== NULL
)
5204 s
->data
= pure_alloc (nbytes
+ 1, -1);
5205 memcpy (s
->data
, data
, nbytes
);
5206 s
->data
[nbytes
] = '\0';
5209 s
->size_byte
= multibyte
? nbytes
: -1;
5210 s
->intervals
= NULL
;
5211 XSETSTRING (string
, s
);
5215 /* Return a string allocated in pure space. Do not
5216 allocate the string data, just point to DATA. */
5219 make_pure_c_string (const char *data
, ptrdiff_t nchars
)
5222 struct Lisp_String
*s
= pure_alloc (sizeof *s
, Lisp_String
);
5225 s
->data
= (unsigned char *) data
;
5226 s
->intervals
= NULL
;
5227 XSETSTRING (string
, s
);
5231 static Lisp_Object
purecopy (Lisp_Object obj
);
5233 /* Return a cons allocated from pure space. Give it pure copies
5234 of CAR as car and CDR as cdr. */
5237 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
5240 struct Lisp_Cons
*p
= pure_alloc (sizeof *p
, Lisp_Cons
);
5242 XSETCAR (new, purecopy (car
));
5243 XSETCDR (new, purecopy (cdr
));
5248 /* Value is a float object with value NUM allocated from pure space. */
5251 make_pure_float (double num
)
5254 struct Lisp_Float
*p
= pure_alloc (sizeof *p
, Lisp_Float
);
5256 XFLOAT_INIT (new, num
);
5261 /* Return a vector with room for LEN Lisp_Objects allocated from
5265 make_pure_vector (ptrdiff_t len
)
5268 size_t size
= header_size
+ len
* word_size
;
5269 struct Lisp_Vector
*p
= pure_alloc (size
, Lisp_Vectorlike
);
5270 XSETVECTOR (new, p
);
5271 XVECTOR (new)->header
.size
= len
;
5276 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
5277 doc
: /* Make a copy of object OBJ in pure storage.
5278 Recursively copies contents of vectors and cons cells.
5279 Does not copy symbols. Copies strings without text properties. */)
5280 (register Lisp_Object obj
)
5282 if (NILP (Vpurify_flag
))
5284 else if (MARKERP (obj
) || OVERLAYP (obj
)
5285 || HASH_TABLE_P (obj
) || SYMBOLP (obj
))
5286 /* Can't purify those. */
5289 return purecopy (obj
);
5293 purecopy (Lisp_Object obj
)
5295 if (PURE_POINTER_P (XPNTR (obj
)) || INTEGERP (obj
) || SUBRP (obj
))
5296 return obj
; /* Already pure. */
5298 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
5300 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
5306 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
5307 else if (FLOATP (obj
))
5308 obj
= make_pure_float (XFLOAT_DATA (obj
));
5309 else if (STRINGP (obj
))
5310 obj
= make_pure_string (SSDATA (obj
), SCHARS (obj
),
5312 STRING_MULTIBYTE (obj
));
5313 else if (COMPILEDP (obj
) || VECTORP (obj
))
5315 register struct Lisp_Vector
*vec
;
5316 register ptrdiff_t i
;
5320 if (size
& PSEUDOVECTOR_FLAG
)
5321 size
&= PSEUDOVECTOR_SIZE_MASK
;
5322 vec
= XVECTOR (make_pure_vector (size
));
5323 for (i
= 0; i
< size
; i
++)
5324 vec
->contents
[i
] = purecopy (AREF (obj
, i
));
5325 if (COMPILEDP (obj
))
5327 XSETPVECTYPE (vec
, PVEC_COMPILED
);
5328 XSETCOMPILED (obj
, vec
);
5331 XSETVECTOR (obj
, vec
);
5333 else if (SYMBOLP (obj
))
5335 if (!XSYMBOL (obj
)->pinned
)
5336 { /* We can't purify them, but they appear in many pure objects.
5337 Mark them as `pinned' so we know to mark them at every GC cycle. */
5338 XSYMBOL (obj
)->pinned
= true;
5339 symbol_block_pinned
= symbol_block
;
5345 Lisp_Object args
[2];
5346 args
[0] = build_pure_c_string ("Don't know how to purify: %S");
5348 Fsignal (Qerror
, (Fcons (Fformat (2, args
), Qnil
)));
5351 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
5352 Fputhash (obj
, obj
, Vpurify_flag
);
5359 /***********************************************************************
5361 ***********************************************************************/
5363 /* Put an entry in staticvec, pointing at the variable with address
5367 staticpro (Lisp_Object
*varaddress
)
5369 if (staticidx
>= NSTATICS
)
5370 fatal ("NSTATICS too small; try increasing and recompiling Emacs.");
5371 staticvec
[staticidx
++] = varaddress
;
5375 /***********************************************************************
5377 ***********************************************************************/
5379 /* Temporarily prevent garbage collection. */
5382 inhibit_garbage_collection (void)
5384 ptrdiff_t count
= SPECPDL_INDEX ();
5386 specbind (Qgc_cons_threshold
, make_number (MOST_POSITIVE_FIXNUM
));
5390 /* Used to avoid possible overflows when
5391 converting from C to Lisp integers. */
5394 bounded_number (EMACS_INT number
)
5396 return make_number (min (MOST_POSITIVE_FIXNUM
, number
));
5399 /* Calculate total bytes of live objects. */
5402 total_bytes_of_live_objects (void)
5405 tot
+= total_conses
* sizeof (struct Lisp_Cons
);
5406 tot
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5407 tot
+= total_markers
* sizeof (union Lisp_Misc
);
5408 tot
+= total_string_bytes
;
5409 tot
+= total_vector_slots
* word_size
;
5410 tot
+= total_floats
* sizeof (struct Lisp_Float
);
5411 tot
+= total_intervals
* sizeof (struct interval
);
5412 tot
+= total_strings
* sizeof (struct Lisp_String
);
5416 #ifdef HAVE_WINDOW_SYSTEM
5418 /* This code has a few issues on MS-Windows, see Bug#15876 and Bug#16140. */
5420 #if !defined (HAVE_NTGUI)
5422 /* Remove unmarked font-spec and font-entity objects from ENTRY, which is
5423 (DRIVER-TYPE NUM-FRAMES FONT-CACHE-DATA ...), and return changed entry. */
5426 compact_font_cache_entry (Lisp_Object entry
)
5428 Lisp_Object tail
, *prev
= &entry
;
5430 for (tail
= entry
; CONSP (tail
); tail
= XCDR (tail
))
5433 Lisp_Object obj
= XCAR (tail
);
5435 /* Consider OBJ if it is (font-spec . [font-entity font-entity ...]). */
5436 if (CONSP (obj
) && FONT_SPEC_P (XCAR (obj
))
5437 && !VECTOR_MARKED_P (XFONT_SPEC (XCAR (obj
)))
5438 && VECTORP (XCDR (obj
)))
5440 ptrdiff_t i
, size
= ASIZE (XCDR (obj
)) & ~ARRAY_MARK_FLAG
;
5442 /* If font-spec is not marked, most likely all font-entities
5443 are not marked too. But we must be sure that nothing is
5444 marked within OBJ before we really drop it. */
5445 for (i
= 0; i
< size
; i
++)
5446 if (VECTOR_MARKED_P (XFONT_ENTITY (AREF (XCDR (obj
), i
))))
5453 *prev
= XCDR (tail
);
5455 prev
= xcdr_addr (tail
);
5460 #endif /* not HAVE_NTGUI */
5462 /* Compact font caches on all terminals and mark
5463 everything which is still here after compaction. */
5466 compact_font_caches (void)
5470 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5472 Lisp_Object cache
= TERMINAL_FONT_CACHE (t
);
5473 #if !defined (HAVE_NTGUI)
5478 for (entry
= XCDR (cache
); CONSP (entry
); entry
= XCDR (entry
))
5479 XSETCAR (entry
, compact_font_cache_entry (XCAR (entry
)));
5481 #endif /* not HAVE_NTGUI */
5482 mark_object (cache
);
5486 #else /* not HAVE_WINDOW_SYSTEM */
5488 #define compact_font_caches() (void)(0)
5490 #endif /* HAVE_WINDOW_SYSTEM */
5492 /* Remove (MARKER . DATA) entries with unmarked MARKER
5493 from buffer undo LIST and return changed list. */
5496 compact_undo_list (Lisp_Object list
)
5498 Lisp_Object tail
, *prev
= &list
;
5500 for (tail
= list
; CONSP (tail
); tail
= XCDR (tail
))
5502 if (CONSP (XCAR (tail
))
5503 && MARKERP (XCAR (XCAR (tail
)))
5504 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5505 *prev
= XCDR (tail
);
5507 prev
= xcdr_addr (tail
);
5513 mark_pinned_symbols (void)
5515 struct symbol_block
*sblk
;
5516 int lim
= (symbol_block_pinned
== symbol_block
5517 ? symbol_block_index
: SYMBOL_BLOCK_SIZE
);
5519 for (sblk
= symbol_block_pinned
; sblk
; sblk
= sblk
->next
)
5521 union aligned_Lisp_Symbol
*sym
= sblk
->symbols
, *end
= sym
+ lim
;
5522 for (; sym
< end
; ++sym
)
5524 mark_object (make_lisp_ptr (&sym
->s
, Lisp_Symbol
));
5526 lim
= SYMBOL_BLOCK_SIZE
;
5530 /* Subroutine of Fgarbage_collect that does most of the work. It is a
5531 separate function so that we could limit mark_stack in searching
5532 the stack frames below this function, thus avoiding the rare cases
5533 where mark_stack finds values that look like live Lisp objects on
5534 portions of stack that couldn't possibly contain such live objects.
5535 For more details of this, see the discussion at
5536 http://lists.gnu.org/archive/html/emacs-devel/2014-05/msg00270.html. */
5538 garbage_collect_1 (void *end
)
5540 struct buffer
*nextb
;
5541 char stack_top_variable
;
5544 ptrdiff_t count
= SPECPDL_INDEX ();
5545 struct timespec start
;
5546 Lisp_Object retval
= Qnil
;
5547 size_t tot_before
= 0;
5552 /* Can't GC if pure storage overflowed because we can't determine
5553 if something is a pure object or not. */
5554 if (pure_bytes_used_before_overflow
)
5557 /* Record this function, so it appears on the profiler's backtraces. */
5558 record_in_backtrace (Qautomatic_gc
, &Qnil
, 0);
5562 /* Don't keep undo information around forever.
5563 Do this early on, so it is no problem if the user quits. */
5564 FOR_EACH_BUFFER (nextb
)
5565 compact_buffer (nextb
);
5567 if (profiler_memory_running
)
5568 tot_before
= total_bytes_of_live_objects ();
5570 start
= current_timespec ();
5572 /* In case user calls debug_print during GC,
5573 don't let that cause a recursive GC. */
5574 consing_since_gc
= 0;
5576 /* Save what's currently displayed in the echo area. */
5577 message_p
= push_message ();
5578 record_unwind_protect_void (pop_message_unwind
);
5580 /* Save a copy of the contents of the stack, for debugging. */
5581 #if MAX_SAVE_STACK > 0
5582 if (NILP (Vpurify_flag
))
5585 ptrdiff_t stack_size
;
5586 if (&stack_top_variable
< stack_bottom
)
5588 stack
= &stack_top_variable
;
5589 stack_size
= stack_bottom
- &stack_top_variable
;
5593 stack
= stack_bottom
;
5594 stack_size
= &stack_top_variable
- stack_bottom
;
5596 if (stack_size
<= MAX_SAVE_STACK
)
5598 if (stack_copy_size
< stack_size
)
5600 stack_copy
= xrealloc (stack_copy
, stack_size
);
5601 stack_copy_size
= stack_size
;
5603 no_sanitize_memcpy (stack_copy
, stack
, stack_size
);
5606 #endif /* MAX_SAVE_STACK > 0 */
5608 if (garbage_collection_messages
)
5609 message1_nolog ("Garbage collecting...");
5613 shrink_regexp_cache ();
5617 /* Mark all the special slots that serve as the roots of accessibility. */
5619 mark_buffer (&buffer_defaults
);
5620 mark_buffer (&buffer_local_symbols
);
5622 for (i
= 0; i
< staticidx
; i
++)
5623 mark_object (*staticvec
[i
]);
5625 mark_pinned_symbols ();
5634 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5635 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5639 register struct gcpro
*tail
;
5640 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5641 for (i
= 0; i
< tail
->nvars
; i
++)
5642 mark_object (tail
->var
[i
]);
5647 struct handler
*handler
;
5648 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5650 mark_object (handler
->tag_or_ch
);
5651 mark_object (handler
->val
);
5654 #ifdef HAVE_WINDOW_SYSTEM
5655 mark_fringe_data ();
5658 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5662 /* Everything is now marked, except for the data in font caches
5663 and undo lists. They're compacted by removing an items which
5664 aren't reachable otherwise. */
5666 compact_font_caches ();
5668 FOR_EACH_BUFFER (nextb
)
5670 if (!EQ (BVAR (nextb
, undo_list
), Qt
))
5671 bset_undo_list (nextb
, compact_undo_list (BVAR (nextb
, undo_list
)));
5672 /* Now that we have stripped the elements that need not be
5673 in the undo_list any more, we can finally mark the list. */
5674 mark_object (BVAR (nextb
, undo_list
));
5679 /* Clear the mark bits that we set in certain root slots. */
5681 unmark_byte_stack ();
5682 VECTOR_UNMARK (&buffer_defaults
);
5683 VECTOR_UNMARK (&buffer_local_symbols
);
5685 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5695 consing_since_gc
= 0;
5696 if (gc_cons_threshold
< GC_DEFAULT_THRESHOLD
/ 10)
5697 gc_cons_threshold
= GC_DEFAULT_THRESHOLD
/ 10;
5699 gc_relative_threshold
= 0;
5700 if (FLOATP (Vgc_cons_percentage
))
5701 { /* Set gc_cons_combined_threshold. */
5702 double tot
= total_bytes_of_live_objects ();
5704 tot
*= XFLOAT_DATA (Vgc_cons_percentage
);
5707 if (tot
< TYPE_MAXIMUM (EMACS_INT
))
5708 gc_relative_threshold
= tot
;
5710 gc_relative_threshold
= TYPE_MAXIMUM (EMACS_INT
);
5714 if (garbage_collection_messages
)
5716 if (message_p
|| minibuf_level
> 0)
5719 message1_nolog ("Garbage collecting...done");
5722 unbind_to (count
, Qnil
);
5724 Lisp_Object total
[11];
5725 int total_size
= 10;
5727 total
[0] = list4 (Qconses
, make_number (sizeof (struct Lisp_Cons
)),
5728 bounded_number (total_conses
),
5729 bounded_number (total_free_conses
));
5731 total
[1] = list4 (Qsymbols
, make_number (sizeof (struct Lisp_Symbol
)),
5732 bounded_number (total_symbols
),
5733 bounded_number (total_free_symbols
));
5735 total
[2] = list4 (Qmiscs
, make_number (sizeof (union Lisp_Misc
)),
5736 bounded_number (total_markers
),
5737 bounded_number (total_free_markers
));
5739 total
[3] = list4 (Qstrings
, make_number (sizeof (struct Lisp_String
)),
5740 bounded_number (total_strings
),
5741 bounded_number (total_free_strings
));
5743 total
[4] = list3 (Qstring_bytes
, make_number (1),
5744 bounded_number (total_string_bytes
));
5746 total
[5] = list3 (Qvectors
,
5747 make_number (header_size
+ sizeof (Lisp_Object
)),
5748 bounded_number (total_vectors
));
5750 total
[6] = list4 (Qvector_slots
, make_number (word_size
),
5751 bounded_number (total_vector_slots
),
5752 bounded_number (total_free_vector_slots
));
5754 total
[7] = list4 (Qfloats
, make_number (sizeof (struct Lisp_Float
)),
5755 bounded_number (total_floats
),
5756 bounded_number (total_free_floats
));
5758 total
[8] = list4 (Qintervals
, make_number (sizeof (struct interval
)),
5759 bounded_number (total_intervals
),
5760 bounded_number (total_free_intervals
));
5762 total
[9] = list3 (Qbuffers
, make_number (sizeof (struct buffer
)),
5763 bounded_number (total_buffers
));
5765 #ifdef DOUG_LEA_MALLOC
5767 total
[10] = list4 (Qheap
, make_number (1024),
5768 bounded_number ((mallinfo ().uordblks
+ 1023) >> 10),
5769 bounded_number ((mallinfo ().fordblks
+ 1023) >> 10));
5771 retval
= Flist (total_size
, total
);
5774 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5776 /* Compute average percentage of zombies. */
5778 = (total_conses
+ total_symbols
+ total_markers
+ total_strings
5779 + total_vectors
+ total_floats
+ total_intervals
+ total_buffers
);
5781 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5782 max_live
= max (nlive
, max_live
);
5783 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5784 max_zombies
= max (nzombies
, max_zombies
);
5789 if (!NILP (Vpost_gc_hook
))
5791 ptrdiff_t gc_count
= inhibit_garbage_collection ();
5792 safe_run_hooks (Qpost_gc_hook
);
5793 unbind_to (gc_count
, Qnil
);
5796 /* Accumulate statistics. */
5797 if (FLOATP (Vgc_elapsed
))
5799 struct timespec since_start
= timespec_sub (current_timespec (), start
);
5800 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
)
5801 + timespectod (since_start
));
5806 /* Collect profiling data. */
5807 if (profiler_memory_running
)
5810 size_t tot_after
= total_bytes_of_live_objects ();
5811 if (tot_before
> tot_after
)
5812 swept
= tot_before
- tot_after
;
5813 malloc_probe (swept
);
5819 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
5820 doc
: /* Reclaim storage for Lisp objects no longer needed.
5821 Garbage collection happens automatically if you cons more than
5822 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
5823 `garbage-collect' normally returns a list with info on amount of space in use,
5824 where each entry has the form (NAME SIZE USED FREE), where:
5825 - NAME is a symbol describing the kind of objects this entry represents,
5826 - SIZE is the number of bytes used by each one,
5827 - USED is the number of those objects that were found live in the heap,
5828 - FREE is the number of those objects that are not live but that Emacs
5829 keeps around for future allocations (maybe because it does not know how
5830 to return them to the OS).
5831 However, if there was overflow in pure space, `garbage-collect'
5832 returns nil, because real GC can't be done.
5833 See Info node `(elisp)Garbage Collection'. */)
5836 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5837 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS \
5838 || GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES)
5841 #ifdef HAVE___BUILTIN_UNWIND_INIT
5842 /* Force callee-saved registers and register windows onto the stack.
5843 This is the preferred method if available, obviating the need for
5844 machine dependent methods. */
5845 __builtin_unwind_init ();
5847 #else /* not HAVE___BUILTIN_UNWIND_INIT */
5848 #ifndef GC_SAVE_REGISTERS_ON_STACK
5849 /* jmp_buf may not be aligned enough on darwin-ppc64 */
5850 union aligned_jmpbuf
{
5854 volatile bool stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
5856 /* This trick flushes the register windows so that all the state of
5857 the process is contained in the stack. */
5858 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
5859 needed on ia64 too. See mach_dep.c, where it also says inline
5860 assembler doesn't work with relevant proprietary compilers. */
5862 #if defined (__sparc64__) && defined (__FreeBSD__)
5863 /* FreeBSD does not have a ta 3 handler. */
5870 /* Save registers that we need to see on the stack. We need to see
5871 registers used to hold register variables and registers used to
5873 #ifdef GC_SAVE_REGISTERS_ON_STACK
5874 GC_SAVE_REGISTERS_ON_STACK (end
);
5875 #else /* not GC_SAVE_REGISTERS_ON_STACK */
5877 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
5878 setjmp will definitely work, test it
5879 and print a message with the result
5881 if (!setjmp_tested_p
)
5883 setjmp_tested_p
= 1;
5886 #endif /* GC_SETJMP_WORKS */
5889 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
5890 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
5891 #endif /* not HAVE___BUILTIN_UNWIND_INIT */
5892 return garbage_collect_1 (end
);
5893 #elif (GC_MARK_STACK == GC_USE_GCPROS_AS_BEFORE)
5894 /* Old GCPROs-based method without stack marking. */
5895 return garbage_collect_1 (NULL
);
5898 #endif /* GC_MARK_STACK */
5901 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5902 only interesting objects referenced from glyphs are strings. */
5905 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5907 struct glyph_row
*row
= matrix
->rows
;
5908 struct glyph_row
*end
= row
+ matrix
->nrows
;
5910 for (; row
< end
; ++row
)
5914 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5916 struct glyph
*glyph
= row
->glyphs
[area
];
5917 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5919 for (; glyph
< end_glyph
; ++glyph
)
5920 if (STRINGP (glyph
->object
)
5921 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5922 mark_object (glyph
->object
);
5927 /* Mark reference to a Lisp_Object.
5928 If the object referred to has not been seen yet, recursively mark
5929 all the references contained in it. */
5931 #define LAST_MARKED_SIZE 500
5932 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5933 static int last_marked_index
;
5935 /* For debugging--call abort when we cdr down this many
5936 links of a list, in mark_object. In debugging,
5937 the call to abort will hit a breakpoint.
5938 Normally this is zero and the check never goes off. */
5939 ptrdiff_t mark_object_loop_halt EXTERNALLY_VISIBLE
;
5942 mark_vectorlike (struct Lisp_Vector
*ptr
)
5944 ptrdiff_t size
= ptr
->header
.size
;
5947 eassert (!VECTOR_MARKED_P (ptr
));
5948 VECTOR_MARK (ptr
); /* Else mark it. */
5949 if (size
& PSEUDOVECTOR_FLAG
)
5950 size
&= PSEUDOVECTOR_SIZE_MASK
;
5952 /* Note that this size is not the memory-footprint size, but only
5953 the number of Lisp_Object fields that we should trace.
5954 The distinction is used e.g. by Lisp_Process which places extra
5955 non-Lisp_Object fields at the end of the structure... */
5956 for (i
= 0; i
< size
; i
++) /* ...and then mark its elements. */
5957 mark_object (ptr
->contents
[i
]);
5960 /* Like mark_vectorlike but optimized for char-tables (and
5961 sub-char-tables) assuming that the contents are mostly integers or
5965 mark_char_table (struct Lisp_Vector
*ptr
, enum pvec_type pvectype
)
5967 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5968 /* Consult the Lisp_Sub_Char_Table layout before changing this. */
5969 int i
, idx
= (pvectype
== PVEC_SUB_CHAR_TABLE
? SUB_CHAR_TABLE_OFFSET
: 0);
5971 eassert (!VECTOR_MARKED_P (ptr
));
5973 for (i
= idx
; i
< size
; i
++)
5975 Lisp_Object val
= ptr
->contents
[i
];
5977 if (INTEGERP (val
) || (SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
))
5979 if (SUB_CHAR_TABLE_P (val
))
5981 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5982 mark_char_table (XVECTOR (val
), PVEC_SUB_CHAR_TABLE
);
5989 NO_INLINE
/* To reduce stack depth in mark_object. */
5991 mark_compiled (struct Lisp_Vector
*ptr
)
5993 int i
, size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5996 for (i
= 0; i
< size
; i
++)
5997 if (i
!= COMPILED_CONSTANTS
)
5998 mark_object (ptr
->contents
[i
]);
5999 return size
> COMPILED_CONSTANTS
? ptr
->contents
[COMPILED_CONSTANTS
] : Qnil
;
6002 /* Mark the chain of overlays starting at PTR. */
6005 mark_overlay (struct Lisp_Overlay
*ptr
)
6007 for (; ptr
&& !ptr
->gcmarkbit
; ptr
= ptr
->next
)
6010 mark_object (ptr
->start
);
6011 mark_object (ptr
->end
);
6012 mark_object (ptr
->plist
);
6016 /* Mark Lisp_Objects and special pointers in BUFFER. */
6019 mark_buffer (struct buffer
*buffer
)
6021 /* This is handled much like other pseudovectors... */
6022 mark_vectorlike ((struct Lisp_Vector
*) buffer
);
6024 /* ...but there are some buffer-specific things. */
6026 MARK_INTERVAL_TREE (buffer_intervals (buffer
));
6028 /* For now, we just don't mark the undo_list. It's done later in
6029 a special way just before the sweep phase, and after stripping
6030 some of its elements that are not needed any more. */
6032 mark_overlay (buffer
->overlays_before
);
6033 mark_overlay (buffer
->overlays_after
);
6035 /* If this is an indirect buffer, mark its base buffer. */
6036 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
6037 mark_buffer (buffer
->base_buffer
);
6040 /* Mark Lisp faces in the face cache C. */
6042 NO_INLINE
/* To reduce stack depth in mark_object. */
6044 mark_face_cache (struct face_cache
*c
)
6049 for (i
= 0; i
< c
->used
; ++i
)
6051 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
6055 if (face
->font
&& !VECTOR_MARKED_P (face
->font
))
6056 mark_vectorlike ((struct Lisp_Vector
*) face
->font
);
6058 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
6059 mark_object (face
->lface
[j
]);
6065 NO_INLINE
/* To reduce stack depth in mark_object. */
6067 mark_localized_symbol (struct Lisp_Symbol
*ptr
)
6069 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
6070 Lisp_Object where
= blv
->where
;
6071 /* If the value is set up for a killed buffer or deleted
6072 frame, restore its global binding. If the value is
6073 forwarded to a C variable, either it's not a Lisp_Object
6074 var, or it's staticpro'd already. */
6075 if ((BUFFERP (where
) && !BUFFER_LIVE_P (XBUFFER (where
)))
6076 || (FRAMEP (where
) && !FRAME_LIVE_P (XFRAME (where
))))
6077 swap_in_global_binding (ptr
);
6078 mark_object (blv
->where
);
6079 mark_object (blv
->valcell
);
6080 mark_object (blv
->defcell
);
6083 NO_INLINE
/* To reduce stack depth in mark_object. */
6085 mark_save_value (struct Lisp_Save_Value
*ptr
)
6087 /* If `save_type' is zero, `data[0].pointer' is the address
6088 of a memory area containing `data[1].integer' potential
6090 if (GC_MARK_STACK
&& ptr
->save_type
== SAVE_TYPE_MEMORY
)
6092 Lisp_Object
*p
= ptr
->data
[0].pointer
;
6094 for (nelt
= ptr
->data
[1].integer
; nelt
> 0; nelt
--, p
++)
6095 mark_maybe_object (*p
);
6099 /* Find Lisp_Objects in `data[N]' slots and mark them. */
6101 for (i
= 0; i
< SAVE_VALUE_SLOTS
; i
++)
6102 if (save_type (ptr
, i
) == SAVE_OBJECT
)
6103 mark_object (ptr
->data
[i
].object
);
6107 /* Remove killed buffers or items whose car is a killed buffer from
6108 LIST, and mark other items. Return changed LIST, which is marked. */
6111 mark_discard_killed_buffers (Lisp_Object list
)
6113 Lisp_Object tail
, *prev
= &list
;
6115 for (tail
= list
; CONSP (tail
) && !CONS_MARKED_P (XCONS (tail
));
6118 Lisp_Object tem
= XCAR (tail
);
6121 if (BUFFERP (tem
) && !BUFFER_LIVE_P (XBUFFER (tem
)))
6122 *prev
= XCDR (tail
);
6125 CONS_MARK (XCONS (tail
));
6126 mark_object (XCAR (tail
));
6127 prev
= xcdr_addr (tail
);
6134 /* Determine type of generic Lisp_Object and mark it accordingly.
6136 This function implements a straightforward depth-first marking
6137 algorithm and so the recursion depth may be very high (a few
6138 tens of thousands is not uncommon). To minimize stack usage,
6139 a few cold paths are moved out to NO_INLINE functions above.
6140 In general, inlining them doesn't help you to gain more speed. */
6143 mark_object (Lisp_Object arg
)
6145 register Lisp_Object obj
= arg
;
6146 #ifdef GC_CHECK_MARKED_OBJECTS
6150 ptrdiff_t cdr_count
= 0;
6154 if (PURE_POINTER_P (XPNTR (obj
)))
6157 last_marked
[last_marked_index
++] = obj
;
6158 if (last_marked_index
== LAST_MARKED_SIZE
)
6159 last_marked_index
= 0;
6161 /* Perform some sanity checks on the objects marked here. Abort if
6162 we encounter an object we know is bogus. This increases GC time
6163 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
6164 #ifdef GC_CHECK_MARKED_OBJECTS
6166 po
= (void *) XPNTR (obj
);
6168 /* Check that the object pointed to by PO is known to be a Lisp
6169 structure allocated from the heap. */
6170 #define CHECK_ALLOCATED() \
6172 m = mem_find (po); \
6177 /* Check that the object pointed to by PO is live, using predicate
6179 #define CHECK_LIVE(LIVEP) \
6181 if (!LIVEP (m, po)) \
6185 /* Check both of the above conditions. */
6186 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
6188 CHECK_ALLOCATED (); \
6189 CHECK_LIVE (LIVEP); \
6192 #else /* not GC_CHECK_MARKED_OBJECTS */
6194 #define CHECK_LIVE(LIVEP) (void) 0
6195 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
6197 #endif /* not GC_CHECK_MARKED_OBJECTS */
6199 switch (XTYPE (obj
))
6203 register struct Lisp_String
*ptr
= XSTRING (obj
);
6204 if (STRING_MARKED_P (ptr
))
6206 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
6208 MARK_INTERVAL_TREE (ptr
->intervals
);
6209 #ifdef GC_CHECK_STRING_BYTES
6210 /* Check that the string size recorded in the string is the
6211 same as the one recorded in the sdata structure. */
6213 #endif /* GC_CHECK_STRING_BYTES */
6217 case Lisp_Vectorlike
:
6219 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
6220 register ptrdiff_t pvectype
;
6222 if (VECTOR_MARKED_P (ptr
))
6225 #ifdef GC_CHECK_MARKED_OBJECTS
6227 if (m
== MEM_NIL
&& !SUBRP (obj
))
6229 #endif /* GC_CHECK_MARKED_OBJECTS */
6231 if (ptr
->header
.size
& PSEUDOVECTOR_FLAG
)
6232 pvectype
= ((ptr
->header
.size
& PVEC_TYPE_MASK
)
6233 >> PSEUDOVECTOR_AREA_BITS
);
6235 pvectype
= PVEC_NORMAL_VECTOR
;
6237 if (pvectype
!= PVEC_SUBR
&& pvectype
!= PVEC_BUFFER
)
6238 CHECK_LIVE (live_vector_p
);
6243 #ifdef GC_CHECK_MARKED_OBJECTS
6252 #endif /* GC_CHECK_MARKED_OBJECTS */
6253 mark_buffer ((struct buffer
*) ptr
);
6257 /* Although we could treat this just like a vector, mark_compiled
6258 returns the COMPILED_CONSTANTS element, which is marked at the
6259 next iteration of goto-loop here. This is done to avoid a few
6260 recursive calls to mark_object. */
6261 obj
= mark_compiled (ptr
);
6268 struct frame
*f
= (struct frame
*) ptr
;
6270 mark_vectorlike (ptr
);
6271 mark_face_cache (f
->face_cache
);
6272 #ifdef HAVE_WINDOW_SYSTEM
6273 if (FRAME_WINDOW_P (f
) && FRAME_X_OUTPUT (f
))
6275 struct font
*font
= FRAME_FONT (f
);
6277 if (font
&& !VECTOR_MARKED_P (font
))
6278 mark_vectorlike ((struct Lisp_Vector
*) font
);
6286 struct window
*w
= (struct window
*) ptr
;
6288 mark_vectorlike (ptr
);
6290 /* Mark glyph matrices, if any. Marking window
6291 matrices is sufficient because frame matrices
6292 use the same glyph memory. */
6293 if (w
->current_matrix
)
6295 mark_glyph_matrix (w
->current_matrix
);
6296 mark_glyph_matrix (w
->desired_matrix
);
6299 /* Filter out killed buffers from both buffer lists
6300 in attempt to help GC to reclaim killed buffers faster.
6301 We can do it elsewhere for live windows, but this is the
6302 best place to do it for dead windows. */
6304 (w
, mark_discard_killed_buffers (w
->prev_buffers
));
6306 (w
, mark_discard_killed_buffers (w
->next_buffers
));
6310 case PVEC_HASH_TABLE
:
6312 struct Lisp_Hash_Table
*h
= (struct Lisp_Hash_Table
*) ptr
;
6314 mark_vectorlike (ptr
);
6315 mark_object (h
->test
.name
);
6316 mark_object (h
->test
.user_hash_function
);
6317 mark_object (h
->test
.user_cmp_function
);
6318 /* If hash table is not weak, mark all keys and values.
6319 For weak tables, mark only the vector. */
6321 mark_object (h
->key_and_value
);
6323 VECTOR_MARK (XVECTOR (h
->key_and_value
));
6327 case PVEC_CHAR_TABLE
:
6328 case PVEC_SUB_CHAR_TABLE
:
6329 mark_char_table (ptr
, (enum pvec_type
) pvectype
);
6332 case PVEC_BOOL_VECTOR
:
6333 /* No Lisp_Objects to mark in a bool vector. */
6344 mark_vectorlike (ptr
);
6351 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
6355 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
6357 /* Attempt to catch bogus objects. */
6358 eassert (valid_lisp_object_p (ptr
->function
) >= 1);
6359 mark_object (ptr
->function
);
6360 mark_object (ptr
->plist
);
6361 switch (ptr
->redirect
)
6363 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
6364 case SYMBOL_VARALIAS
:
6367 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
6371 case SYMBOL_LOCALIZED
:
6372 mark_localized_symbol (ptr
);
6374 case SYMBOL_FORWARDED
:
6375 /* If the value is forwarded to a buffer or keyboard field,
6376 these are marked when we see the corresponding object.
6377 And if it's forwarded to a C variable, either it's not
6378 a Lisp_Object var, or it's staticpro'd already. */
6380 default: emacs_abort ();
6382 if (!PURE_POINTER_P (XSTRING (ptr
->name
)))
6383 MARK_STRING (XSTRING (ptr
->name
));
6384 MARK_INTERVAL_TREE (string_intervals (ptr
->name
));
6385 /* Inner loop to mark next symbol in this bucket, if any. */
6393 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
6395 if (XMISCANY (obj
)->gcmarkbit
)
6398 switch (XMISCTYPE (obj
))
6400 case Lisp_Misc_Marker
:
6401 /* DO NOT mark thru the marker's chain.
6402 The buffer's markers chain does not preserve markers from gc;
6403 instead, markers are removed from the chain when freed by gc. */
6404 XMISCANY (obj
)->gcmarkbit
= 1;
6407 case Lisp_Misc_Save_Value
:
6408 XMISCANY (obj
)->gcmarkbit
= 1;
6409 mark_save_value (XSAVE_VALUE (obj
));
6412 case Lisp_Misc_Overlay
:
6413 mark_overlay (XOVERLAY (obj
));
6423 register struct Lisp_Cons
*ptr
= XCONS (obj
);
6424 if (CONS_MARKED_P (ptr
))
6426 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
6428 /* If the cdr is nil, avoid recursion for the car. */
6429 if (EQ (ptr
->u
.cdr
, Qnil
))
6435 mark_object (ptr
->car
);
6438 if (cdr_count
== mark_object_loop_halt
)
6444 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
6445 FLOAT_MARK (XFLOAT (obj
));
6456 #undef CHECK_ALLOCATED
6457 #undef CHECK_ALLOCATED_AND_LIVE
6459 /* Mark the Lisp pointers in the terminal objects.
6460 Called by Fgarbage_collect. */
6463 mark_terminals (void)
6466 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
6468 eassert (t
->name
!= NULL
);
6469 #ifdef HAVE_WINDOW_SYSTEM
6470 /* If a terminal object is reachable from a stacpro'ed object,
6471 it might have been marked already. Make sure the image cache
6473 mark_image_cache (t
->image_cache
);
6474 #endif /* HAVE_WINDOW_SYSTEM */
6475 if (!VECTOR_MARKED_P (t
))
6476 mark_vectorlike ((struct Lisp_Vector
*)t
);
6482 /* Value is non-zero if OBJ will survive the current GC because it's
6483 either marked or does not need to be marked to survive. */
6486 survives_gc_p (Lisp_Object obj
)
6490 switch (XTYPE (obj
))
6497 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
6501 survives_p
= XMISCANY (obj
)->gcmarkbit
;
6505 survives_p
= STRING_MARKED_P (XSTRING (obj
));
6508 case Lisp_Vectorlike
:
6509 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
6513 survives_p
= CONS_MARKED_P (XCONS (obj
));
6517 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
6524 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
6530 NO_INLINE
/* For better stack traces */
6534 struct cons_block
*cblk
;
6535 struct cons_block
**cprev
= &cons_block
;
6536 int lim
= cons_block_index
;
6537 EMACS_INT num_free
= 0, num_used
= 0;
6541 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
6545 int ilim
= (lim
+ BITS_PER_BITS_WORD
- 1) / BITS_PER_BITS_WORD
;
6547 /* Scan the mark bits an int at a time. */
6548 for (i
= 0; i
< ilim
; i
++)
6550 if (cblk
->gcmarkbits
[i
] == BITS_WORD_MAX
)
6552 /* Fast path - all cons cells for this int are marked. */
6553 cblk
->gcmarkbits
[i
] = 0;
6554 num_used
+= BITS_PER_BITS_WORD
;
6558 /* Some cons cells for this int are not marked.
6559 Find which ones, and free them. */
6560 int start
, pos
, stop
;
6562 start
= i
* BITS_PER_BITS_WORD
;
6564 if (stop
> BITS_PER_BITS_WORD
)
6565 stop
= BITS_PER_BITS_WORD
;
6568 for (pos
= start
; pos
< stop
; pos
++)
6570 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
6573 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
6574 cons_free_list
= &cblk
->conses
[pos
];
6576 cons_free_list
->car
= Vdead
;
6582 CONS_UNMARK (&cblk
->conses
[pos
]);
6588 lim
= CONS_BLOCK_SIZE
;
6589 /* If this block contains only free conses and we have already
6590 seen more than two blocks worth of free conses then deallocate
6592 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
6594 *cprev
= cblk
->next
;
6595 /* Unhook from the free list. */
6596 cons_free_list
= cblk
->conses
[0].u
.chain
;
6597 lisp_align_free (cblk
);
6601 num_free
+= this_free
;
6602 cprev
= &cblk
->next
;
6605 total_conses
= num_used
;
6606 total_free_conses
= num_free
;
6609 NO_INLINE
/* For better stack traces */
6613 register struct float_block
*fblk
;
6614 struct float_block
**fprev
= &float_block
;
6615 register int lim
= float_block_index
;
6616 EMACS_INT num_free
= 0, num_used
= 0;
6618 float_free_list
= 0;
6620 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
6624 for (i
= 0; i
< lim
; i
++)
6625 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
6628 fblk
->floats
[i
].u
.chain
= float_free_list
;
6629 float_free_list
= &fblk
->floats
[i
];
6634 FLOAT_UNMARK (&fblk
->floats
[i
]);
6636 lim
= FLOAT_BLOCK_SIZE
;
6637 /* If this block contains only free floats and we have already
6638 seen more than two blocks worth of free floats then deallocate
6640 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
6642 *fprev
= fblk
->next
;
6643 /* Unhook from the free list. */
6644 float_free_list
= fblk
->floats
[0].u
.chain
;
6645 lisp_align_free (fblk
);
6649 num_free
+= this_free
;
6650 fprev
= &fblk
->next
;
6653 total_floats
= num_used
;
6654 total_free_floats
= num_free
;
6657 NO_INLINE
/* For better stack traces */
6659 sweep_intervals (void)
6661 register struct interval_block
*iblk
;
6662 struct interval_block
**iprev
= &interval_block
;
6663 register int lim
= interval_block_index
;
6664 EMACS_INT num_free
= 0, num_used
= 0;
6666 interval_free_list
= 0;
6668 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
6673 for (i
= 0; i
< lim
; i
++)
6675 if (!iblk
->intervals
[i
].gcmarkbit
)
6677 set_interval_parent (&iblk
->intervals
[i
], interval_free_list
);
6678 interval_free_list
= &iblk
->intervals
[i
];
6684 iblk
->intervals
[i
].gcmarkbit
= 0;
6687 lim
= INTERVAL_BLOCK_SIZE
;
6688 /* If this block contains only free intervals and we have already
6689 seen more than two blocks worth of free intervals then
6690 deallocate this block. */
6691 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
6693 *iprev
= iblk
->next
;
6694 /* Unhook from the free list. */
6695 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
6700 num_free
+= this_free
;
6701 iprev
= &iblk
->next
;
6704 total_intervals
= num_used
;
6705 total_free_intervals
= num_free
;
6708 NO_INLINE
/* For better stack traces */
6710 sweep_symbols (void)
6712 register struct symbol_block
*sblk
;
6713 struct symbol_block
**sprev
= &symbol_block
;
6714 register int lim
= symbol_block_index
;
6715 EMACS_INT num_free
= 0, num_used
= 0;
6717 symbol_free_list
= NULL
;
6719 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
6722 union aligned_Lisp_Symbol
*sym
= sblk
->symbols
;
6723 union aligned_Lisp_Symbol
*end
= sym
+ lim
;
6725 for (; sym
< end
; ++sym
)
6727 if (!sym
->s
.gcmarkbit
)
6729 if (sym
->s
.redirect
== SYMBOL_LOCALIZED
)
6730 xfree (SYMBOL_BLV (&sym
->s
));
6731 sym
->s
.next
= symbol_free_list
;
6732 symbol_free_list
= &sym
->s
;
6734 symbol_free_list
->function
= Vdead
;
6741 sym
->s
.gcmarkbit
= 0;
6742 /* Attempt to catch bogus objects. */
6743 eassert (valid_lisp_object_p (sym
->s
.function
) >= 1);
6747 lim
= SYMBOL_BLOCK_SIZE
;
6748 /* If this block contains only free symbols and we have already
6749 seen more than two blocks worth of free symbols then deallocate
6751 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6753 *sprev
= sblk
->next
;
6754 /* Unhook from the free list. */
6755 symbol_free_list
= sblk
->symbols
[0].s
.next
;
6760 num_free
+= this_free
;
6761 sprev
= &sblk
->next
;
6764 total_symbols
= num_used
;
6765 total_free_symbols
= num_free
;
6768 NO_INLINE
/* For better stack traces */
6772 register struct marker_block
*mblk
;
6773 struct marker_block
**mprev
= &marker_block
;
6774 register int lim
= marker_block_index
;
6775 EMACS_INT num_free
= 0, num_used
= 0;
6777 /* Put all unmarked misc's on free list. For a marker, first
6778 unchain it from the buffer it points into. */
6780 marker_free_list
= 0;
6782 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6787 for (i
= 0; i
< lim
; i
++)
6789 if (!mblk
->markers
[i
].m
.u_any
.gcmarkbit
)
6791 if (mblk
->markers
[i
].m
.u_any
.type
== Lisp_Misc_Marker
)
6792 unchain_marker (&mblk
->markers
[i
].m
.u_marker
);
6793 /* Set the type of the freed object to Lisp_Misc_Free.
6794 We could leave the type alone, since nobody checks it,
6795 but this might catch bugs faster. */
6796 mblk
->markers
[i
].m
.u_marker
.type
= Lisp_Misc_Free
;
6797 mblk
->markers
[i
].m
.u_free
.chain
= marker_free_list
;
6798 marker_free_list
= &mblk
->markers
[i
].m
;
6804 mblk
->markers
[i
].m
.u_any
.gcmarkbit
= 0;
6807 lim
= MARKER_BLOCK_SIZE
;
6808 /* If this block contains only free markers and we have already
6809 seen more than two blocks worth of free markers then deallocate
6811 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6813 *mprev
= mblk
->next
;
6814 /* Unhook from the free list. */
6815 marker_free_list
= mblk
->markers
[0].m
.u_free
.chain
;
6820 num_free
+= this_free
;
6821 mprev
= &mblk
->next
;
6825 total_markers
= num_used
;
6826 total_free_markers
= num_free
;
6829 NO_INLINE
/* For better stack traces */
6831 sweep_buffers (void)
6833 register struct buffer
*buffer
, **bprev
= &all_buffers
;
6836 for (buffer
= all_buffers
; buffer
; buffer
= *bprev
)
6837 if (!VECTOR_MARKED_P (buffer
))
6839 *bprev
= buffer
->next
;
6844 VECTOR_UNMARK (buffer
);
6845 /* Do not use buffer_(set|get)_intervals here. */
6846 buffer
->text
->intervals
= balance_intervals (buffer
->text
->intervals
);
6848 bprev
= &buffer
->next
;
6852 /* Sweep: find all structures not marked, and free them. */
6856 /* Remove or mark entries in weak hash tables.
6857 This must be done before any object is unmarked. */
6858 sweep_weak_hash_tables ();
6861 check_string_bytes (!noninteractive
);
6869 check_string_bytes (!noninteractive
);
6872 DEFUN ("memory-info", Fmemory_info
, Smemory_info
, 0, 0, 0,
6873 doc
: /* Return a list of (TOTAL-RAM FREE-RAM TOTAL-SWAP FREE-SWAP).
6874 All values are in Kbytes. If there is no swap space, last two
6875 values are zero. If the system is not supported, return nil. */)
6878 #if defined HAVE_LINUX_SYSINFO
6884 #ifdef LINUX_SYSINFO_UNIT
6885 units
= si
.mem_unit
;
6889 return list4i ((uintmax_t) si
.totalram
* units
/ 1024,
6890 (uintmax_t) si
.freeram
* units
/ 1024,
6891 (uintmax_t) si
.totalswap
* units
/ 1024,
6892 (uintmax_t) si
.freeswap
* units
/ 1024);
6893 #elif defined WINDOWSNT
6894 unsigned long long totalram
, freeram
, totalswap
, freeswap
;
6896 if (w32_memory_info (&totalram
, &freeram
, &totalswap
, &freeswap
) == 0)
6897 return list4i ((uintmax_t) totalram
/ 1024,
6898 (uintmax_t) freeram
/ 1024,
6899 (uintmax_t) totalswap
/ 1024,
6900 (uintmax_t) freeswap
/ 1024);
6903 #else /* not HAVE_LINUX_SYSINFO, not WINDOWSNT */
6904 /* FIXME: add more systems. */
6906 #endif /* HAVE_LINUX_SYSINFO */
6909 /* Debugging aids. */
6911 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6912 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6913 This may be helpful in debugging Emacs's memory usage.
6914 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6920 /* Avoid warning. sbrk has no relation to memory allocated anyway. */
6923 XSETINT (end
, (intptr_t) (char *) sbrk (0) / 1024);
6929 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6930 doc
: /* Return a list of counters that measure how much consing there has been.
6931 Each of these counters increments for a certain kind of object.
6932 The counters wrap around from the largest positive integer to zero.
6933 Garbage collection does not decrease them.
6934 The elements of the value are as follows:
6935 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6936 All are in units of 1 = one object consed
6937 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6939 MISCS include overlays, markers, and some internal types.
6940 Frames, windows, buffers, and subprocesses count as vectors
6941 (but the contents of a buffer's text do not count here). */)
6944 return listn (CONSTYPE_HEAP
, 8,
6945 bounded_number (cons_cells_consed
),
6946 bounded_number (floats_consed
),
6947 bounded_number (vector_cells_consed
),
6948 bounded_number (symbols_consed
),
6949 bounded_number (string_chars_consed
),
6950 bounded_number (misc_objects_consed
),
6951 bounded_number (intervals_consed
),
6952 bounded_number (strings_consed
));
6955 /* Find at most FIND_MAX symbols which have OBJ as their value or
6956 function. This is used in gdbinit's `xwhichsymbols' command. */
6959 which_symbols (Lisp_Object obj
, EMACS_INT find_max
)
6961 struct symbol_block
*sblk
;
6962 ptrdiff_t gc_count
= inhibit_garbage_collection ();
6963 Lisp_Object found
= Qnil
;
6967 for (sblk
= symbol_block
; sblk
; sblk
= sblk
->next
)
6969 union aligned_Lisp_Symbol
*aligned_sym
= sblk
->symbols
;
6972 for (bn
= 0; bn
< SYMBOL_BLOCK_SIZE
; bn
++, aligned_sym
++)
6974 struct Lisp_Symbol
*sym
= &aligned_sym
->s
;
6978 if (sblk
== symbol_block
&& bn
>= symbol_block_index
)
6981 XSETSYMBOL (tem
, sym
);
6982 val
= find_symbol_value (tem
);
6984 || EQ (sym
->function
, obj
)
6985 || (!NILP (sym
->function
)
6986 && COMPILEDP (sym
->function
)
6987 && EQ (AREF (sym
->function
, COMPILED_BYTECODE
), obj
))
6990 && EQ (AREF (val
, COMPILED_BYTECODE
), obj
)))
6992 found
= Fcons (tem
, found
);
6993 if (--find_max
== 0)
7001 unbind_to (gc_count
, Qnil
);
7005 #ifdef SUSPICIOUS_OBJECT_CHECKING
7008 find_suspicious_object_in_range (void *begin
, void *end
)
7010 char *begin_a
= begin
;
7014 for (i
= 0; i
< ARRAYELTS (suspicious_objects
); ++i
)
7016 char *suspicious_object
= suspicious_objects
[i
];
7017 if (begin_a
<= suspicious_object
&& suspicious_object
< end_a
)
7018 return suspicious_object
;
7025 note_suspicious_free (void* ptr
)
7027 struct suspicious_free_record
* rec
;
7029 rec
= &suspicious_free_history
[suspicious_free_history_index
++];
7030 if (suspicious_free_history_index
==
7031 ARRAYELTS (suspicious_free_history
))
7033 suspicious_free_history_index
= 0;
7036 memset (rec
, 0, sizeof (*rec
));
7037 rec
->suspicious_object
= ptr
;
7038 backtrace (&rec
->backtrace
[0], ARRAYELTS (rec
->backtrace
));
7042 detect_suspicious_free (void* ptr
)
7046 eassert (ptr
!= NULL
);
7048 for (i
= 0; i
< ARRAYELTS (suspicious_objects
); ++i
)
7049 if (suspicious_objects
[i
] == ptr
)
7051 note_suspicious_free (ptr
);
7052 suspicious_objects
[i
] = NULL
;
7056 #endif /* SUSPICIOUS_OBJECT_CHECKING */
7058 DEFUN ("suspicious-object", Fsuspicious_object
, Ssuspicious_object
, 1, 1, 0,
7059 doc
: /* Return OBJ, maybe marking it for extra scrutiny.
7060 If Emacs is compiled with suspicous object checking, capture
7061 a stack trace when OBJ is freed in order to help track down
7062 garbage collection bugs. Otherwise, do nothing and return OBJ. */)
7065 #ifdef SUSPICIOUS_OBJECT_CHECKING
7066 /* Right now, we care only about vectors. */
7067 if (VECTORLIKEP (obj
))
7069 suspicious_objects
[suspicious_object_index
++] = XVECTOR (obj
);
7070 if (suspicious_object_index
== ARRAYELTS (suspicious_objects
))
7071 suspicious_object_index
= 0;
7077 #ifdef ENABLE_CHECKING
7079 bool suppress_checking
;
7082 die (const char *msg
, const char *file
, int line
)
7084 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: assertion failed: %s\r\n",
7086 terminate_due_to_signal (SIGABRT
, INT_MAX
);
7090 /* Initialization. */
7093 init_alloc_once (void)
7095 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
7097 pure_size
= PURESIZE
;
7099 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
7101 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
7104 #ifdef DOUG_LEA_MALLOC
7105 mallopt (M_TRIM_THRESHOLD
, 128 * 1024); /* Trim threshold. */
7106 mallopt (M_MMAP_THRESHOLD
, 64 * 1024); /* Mmap threshold. */
7107 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* Max. number of mmap'ed areas. */
7112 refill_memory_reserve ();
7113 gc_cons_threshold
= GC_DEFAULT_THRESHOLD
;
7120 byte_stack_list
= 0;
7122 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
7123 setjmp_tested_p
= longjmps_done
= 0;
7126 Vgc_elapsed
= make_float (0.0);
7130 valgrind_p
= RUNNING_ON_VALGRIND
!= 0;
7135 syms_of_alloc (void)
7137 DEFVAR_INT ("gc-cons-threshold", gc_cons_threshold
,
7138 doc
: /* Number of bytes of consing between garbage collections.
7139 Garbage collection can happen automatically once this many bytes have been
7140 allocated since the last garbage collection. All data types count.
7142 Garbage collection happens automatically only when `eval' is called.
7144 By binding this temporarily to a large number, you can effectively
7145 prevent garbage collection during a part of the program.
7146 See also `gc-cons-percentage'. */);
7148 DEFVAR_LISP ("gc-cons-percentage", Vgc_cons_percentage
,
7149 doc
: /* Portion of the heap used for allocation.
7150 Garbage collection can happen automatically once this portion of the heap
7151 has been allocated since the last garbage collection.
7152 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
7153 Vgc_cons_percentage
= make_float (0.1);
7155 DEFVAR_INT ("pure-bytes-used", pure_bytes_used
,
7156 doc
: /* Number of bytes of shareable Lisp data allocated so far. */);
7158 DEFVAR_INT ("cons-cells-consed", cons_cells_consed
,
7159 doc
: /* Number of cons cells that have been consed so far. */);
7161 DEFVAR_INT ("floats-consed", floats_consed
,
7162 doc
: /* Number of floats that have been consed so far. */);
7164 DEFVAR_INT ("vector-cells-consed", vector_cells_consed
,
7165 doc
: /* Number of vector cells that have been consed so far. */);
7167 DEFVAR_INT ("symbols-consed", symbols_consed
,
7168 doc
: /* Number of symbols that have been consed so far. */);
7170 DEFVAR_INT ("string-chars-consed", string_chars_consed
,
7171 doc
: /* Number of string characters that have been consed so far. */);
7173 DEFVAR_INT ("misc-objects-consed", misc_objects_consed
,
7174 doc
: /* Number of miscellaneous objects that have been consed so far.
7175 These include markers and overlays, plus certain objects not visible
7178 DEFVAR_INT ("intervals-consed", intervals_consed
,
7179 doc
: /* Number of intervals that have been consed so far. */);
7181 DEFVAR_INT ("strings-consed", strings_consed
,
7182 doc
: /* Number of strings that have been consed so far. */);
7184 DEFVAR_LISP ("purify-flag", Vpurify_flag
,
7185 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
7186 This means that certain objects should be allocated in shared (pure) space.
7187 It can also be set to a hash-table, in which case this table is used to
7188 do hash-consing of the objects allocated to pure space. */);
7190 DEFVAR_BOOL ("garbage-collection-messages", garbage_collection_messages
,
7191 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
7192 garbage_collection_messages
= 0;
7194 DEFVAR_LISP ("post-gc-hook", Vpost_gc_hook
,
7195 doc
: /* Hook run after garbage collection has finished. */);
7196 Vpost_gc_hook
= Qnil
;
7197 DEFSYM (Qpost_gc_hook
, "post-gc-hook");
7199 DEFVAR_LISP ("memory-signal-data", Vmemory_signal_data
,
7200 doc
: /* Precomputed `signal' argument for memory-full error. */);
7201 /* We build this in advance because if we wait until we need it, we might
7202 not be able to allocate the memory to hold it. */
7204 = listn (CONSTYPE_PURE
, 2, Qerror
,
7205 build_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
7207 DEFVAR_LISP ("memory-full", Vmemory_full
,
7208 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
7209 Vmemory_full
= Qnil
;
7211 DEFSYM (Qconses
, "conses");
7212 DEFSYM (Qsymbols
, "symbols");
7213 DEFSYM (Qmiscs
, "miscs");
7214 DEFSYM (Qstrings
, "strings");
7215 DEFSYM (Qvectors
, "vectors");
7216 DEFSYM (Qfloats
, "floats");
7217 DEFSYM (Qintervals
, "intervals");
7218 DEFSYM (Qbuffers
, "buffers");
7219 DEFSYM (Qstring_bytes
, "string-bytes");
7220 DEFSYM (Qvector_slots
, "vector-slots");
7221 DEFSYM (Qheap
, "heap");
7222 DEFSYM (Qautomatic_gc
, "Automatic GC");
7224 DEFSYM (Qgc_cons_threshold
, "gc-cons-threshold");
7225 DEFSYM (Qchar_table_extra_slots
, "char-table-extra-slots");
7227 DEFVAR_LISP ("gc-elapsed", Vgc_elapsed
,
7228 doc
: /* Accumulated time elapsed in garbage collections.
7229 The time is in seconds as a floating point value. */);
7230 DEFVAR_INT ("gcs-done", gcs_done
,
7231 doc
: /* Accumulated number of garbage collections done. */);
7236 defsubr (&Sbool_vector
);
7237 defsubr (&Smake_byte_code
);
7238 defsubr (&Smake_list
);
7239 defsubr (&Smake_vector
);
7240 defsubr (&Smake_string
);
7241 defsubr (&Smake_bool_vector
);
7242 defsubr (&Smake_symbol
);
7243 defsubr (&Smake_marker
);
7244 defsubr (&Spurecopy
);
7245 defsubr (&Sgarbage_collect
);
7246 defsubr (&Smemory_limit
);
7247 defsubr (&Smemory_info
);
7248 defsubr (&Smemory_use_counts
);
7249 defsubr (&Ssuspicious_object
);
7251 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
7252 defsubr (&Sgc_status
);
7256 /* When compiled with GCC, GDB might say "No enum type named
7257 pvec_type" if we don't have at least one symbol with that type, and
7258 then xbacktrace could fail. Similarly for the other enums and
7259 their values. Some non-GCC compilers don't like these constructs. */
7263 enum CHARTAB_SIZE_BITS CHARTAB_SIZE_BITS
;
7264 enum char_table_specials char_table_specials
;
7265 enum char_bits char_bits
;
7266 enum CHECK_LISP_OBJECT_TYPE CHECK_LISP_OBJECT_TYPE
;
7267 enum DEFAULT_HASH_SIZE DEFAULT_HASH_SIZE
;
7268 enum Lisp_Bits Lisp_Bits
;
7269 enum Lisp_Compiled Lisp_Compiled
;
7270 enum maxargs maxargs
;
7271 enum MAX_ALLOCA MAX_ALLOCA
;
7272 enum More_Lisp_Bits More_Lisp_Bits
;
7273 enum pvec_type pvec_type
;
7274 } const EXTERNALLY_VISIBLE gdb_make_enums_visible
= {0};
7275 #endif /* __GNUC__ */