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>
57 #include "dosfns.h" /* For dos_memory_info. */
60 #if (defined ENABLE_CHECKING \
61 && defined HAVE_VALGRIND_VALGRIND_H \
62 && !defined USE_VALGRIND)
63 # define USE_VALGRIND 1
67 #include <valgrind/valgrind.h>
68 #include <valgrind/memcheck.h>
69 static bool valgrind_p
;
72 /* GC_CHECK_MARKED_OBJECTS means do sanity checks on allocated objects.
73 Doable only if GC_MARK_STACK. */
75 # undef GC_CHECK_MARKED_OBJECTS
78 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
79 memory. Can do this only if using gmalloc.c and if not checking
82 #if (defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC \
83 || defined HYBRID_MALLOC || defined GC_CHECK_MARKED_OBJECTS)
84 #undef GC_MALLOC_CHECK
95 #include "w32heap.h" /* for sbrk */
98 #ifdef DOUG_LEA_MALLOC
102 /* Specify maximum number of areas to mmap. It would be nice to use a
103 value that explicitly means "no limit". */
105 #define MMAP_MAX_AREAS 100000000
107 #endif /* not DOUG_LEA_MALLOC */
109 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
110 to a struct Lisp_String. */
112 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
113 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
114 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
116 #define VECTOR_MARK(V) ((V)->header.size |= ARRAY_MARK_FLAG)
117 #define VECTOR_UNMARK(V) ((V)->header.size &= ~ARRAY_MARK_FLAG)
118 #define VECTOR_MARKED_P(V) (((V)->header.size & ARRAY_MARK_FLAG) != 0)
120 /* Default value of gc_cons_threshold (see below). */
122 #define GC_DEFAULT_THRESHOLD (100000 * word_size)
124 /* Global variables. */
125 struct emacs_globals globals
;
127 /* Number of bytes of consing done since the last gc. */
129 EMACS_INT consing_since_gc
;
131 /* Similar minimum, computed from Vgc_cons_percentage. */
133 EMACS_INT gc_relative_threshold
;
135 /* Minimum number of bytes of consing since GC before next GC,
136 when memory is full. */
138 EMACS_INT memory_full_cons_threshold
;
140 /* True during GC. */
144 /* True means abort if try to GC.
145 This is for code which is written on the assumption that
146 no GC will happen, so as to verify that assumption. */
150 /* Number of live and free conses etc. */
152 static EMACS_INT total_conses
, total_markers
, total_symbols
, total_buffers
;
153 static EMACS_INT total_free_conses
, total_free_markers
, total_free_symbols
;
154 static EMACS_INT total_free_floats
, total_floats
;
156 /* Points to memory space allocated as "spare", to be freed if we run
157 out of memory. We keep one large block, four cons-blocks, and
158 two string blocks. */
160 static char *spare_memory
[7];
162 /* Amount of spare memory to keep in large reserve block, or to see
163 whether this much is available when malloc fails on a larger request. */
165 #define SPARE_MEMORY (1 << 14)
167 /* Initialize it to a nonzero value to force it into data space
168 (rather than bss space). That way unexec will remap it into text
169 space (pure), on some systems. We have not implemented the
170 remapping on more recent systems because this is less important
171 nowadays than in the days of small memories and timesharing. */
173 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
174 #define PUREBEG (char *) pure
176 /* Pointer to the pure area, and its size. */
178 static char *purebeg
;
179 static ptrdiff_t pure_size
;
181 /* Number of bytes of pure storage used before pure storage overflowed.
182 If this is non-zero, this implies that an overflow occurred. */
184 static ptrdiff_t pure_bytes_used_before_overflow
;
186 /* True if P points into pure space. */
188 #define PURE_POINTER_P(P) \
189 ((uintptr_t) (P) - (uintptr_t) purebeg <= pure_size)
191 /* Index in pure at which next pure Lisp object will be allocated.. */
193 static ptrdiff_t pure_bytes_used_lisp
;
195 /* Number of bytes allocated for non-Lisp objects in pure storage. */
197 static ptrdiff_t pure_bytes_used_non_lisp
;
199 /* If nonzero, this is a warning delivered by malloc and not yet
202 const char *pending_malloc_warning
;
204 #if 0 /* Normally, pointer sanity only on request... */
205 #ifdef ENABLE_CHECKING
206 #define SUSPICIOUS_OBJECT_CHECKING 1
210 /* ... but unconditionally use SUSPICIOUS_OBJECT_CHECKING while the GC
211 bug is unresolved. */
212 #define SUSPICIOUS_OBJECT_CHECKING 1
214 #ifdef SUSPICIOUS_OBJECT_CHECKING
215 struct suspicious_free_record
217 void *suspicious_object
;
218 void *backtrace
[128];
220 static void *suspicious_objects
[32];
221 static int suspicious_object_index
;
222 struct suspicious_free_record suspicious_free_history
[64] EXTERNALLY_VISIBLE
;
223 static int suspicious_free_history_index
;
224 /* Find the first currently-monitored suspicious pointer in range
225 [begin,end) or NULL if no such pointer exists. */
226 static void *find_suspicious_object_in_range (void *begin
, void *end
);
227 static void detect_suspicious_free (void *ptr
);
229 # define find_suspicious_object_in_range(begin, end) NULL
230 # define detect_suspicious_free(ptr) (void)
233 /* Maximum amount of C stack to save when a GC happens. */
235 #ifndef MAX_SAVE_STACK
236 #define MAX_SAVE_STACK 16000
239 /* Buffer in which we save a copy of the C stack at each GC. */
241 #if MAX_SAVE_STACK > 0
242 static char *stack_copy
;
243 static ptrdiff_t stack_copy_size
;
245 /* Copy to DEST a block of memory from SRC of size SIZE bytes,
246 avoiding any address sanitization. */
248 static void * ATTRIBUTE_NO_SANITIZE_ADDRESS
249 no_sanitize_memcpy (void *dest
, void const *src
, size_t size
)
251 if (! ADDRESS_SANITIZER
)
252 return memcpy (dest
, src
, size
);
258 for (i
= 0; i
< size
; i
++)
264 #endif /* MAX_SAVE_STACK > 0 */
266 static Lisp_Object Qconses
;
267 static Lisp_Object Qsymbols
;
268 static Lisp_Object Qmiscs
;
269 static Lisp_Object Qstrings
;
270 static Lisp_Object Qvectors
;
271 static Lisp_Object Qfloats
;
272 static Lisp_Object Qintervals
;
273 static Lisp_Object Qbuffers
;
274 static Lisp_Object Qstring_bytes
, Qvector_slots
, Qheap
;
275 static Lisp_Object Qgc_cons_threshold
;
276 Lisp_Object Qautomatic_gc
;
277 Lisp_Object Qchar_table_extra_slots
;
279 /* Hook run after GC has finished. */
281 static Lisp_Object Qpost_gc_hook
;
283 static void mark_terminals (void);
284 static void gc_sweep (void);
285 static Lisp_Object
make_pure_vector (ptrdiff_t);
286 static void mark_buffer (struct buffer
*);
288 #if !defined REL_ALLOC || defined SYSTEM_MALLOC || defined HYBRID_MALLOC
289 static void refill_memory_reserve (void);
291 static void compact_small_strings (void);
292 static void free_large_strings (void);
293 extern Lisp_Object
which_symbols (Lisp_Object
, EMACS_INT
) EXTERNALLY_VISIBLE
;
295 /* When scanning the C stack for live Lisp objects, Emacs keeps track of
296 what memory allocated via lisp_malloc and lisp_align_malloc is intended
297 for what purpose. This enumeration specifies the type of memory. */
308 /* Since all non-bool pseudovectors are small enough to be
309 allocated from vector blocks, this memory type denotes
310 large regular vectors and large bool pseudovectors. */
312 /* Special type to denote vector blocks. */
313 MEM_TYPE_VECTOR_BLOCK
,
314 /* Special type to denote reserved memory. */
318 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
320 /* A unique object in pure space used to make some Lisp objects
321 on free lists recognizable in O(1). */
323 static Lisp_Object Vdead
;
324 #define DEADP(x) EQ (x, Vdead)
326 #ifdef GC_MALLOC_CHECK
328 enum mem_type allocated_mem_type
;
330 #endif /* GC_MALLOC_CHECK */
332 /* A node in the red-black tree describing allocated memory containing
333 Lisp data. Each such block is recorded with its start and end
334 address when it is allocated, and removed from the tree when it
337 A red-black tree is a balanced binary tree with the following
340 1. Every node is either red or black.
341 2. Every leaf is black.
342 3. If a node is red, then both of its children are black.
343 4. Every simple path from a node to a descendant leaf contains
344 the same number of black nodes.
345 5. The root is always black.
347 When nodes are inserted into the tree, or deleted from the tree,
348 the tree is "fixed" so that these properties are always true.
350 A red-black tree with N internal nodes has height at most 2
351 log(N+1). Searches, insertions and deletions are done in O(log N).
352 Please see a text book about data structures for a detailed
353 description of red-black trees. Any book worth its salt should
358 /* Children of this node. These pointers are never NULL. When there
359 is no child, the value is MEM_NIL, which points to a dummy node. */
360 struct mem_node
*left
, *right
;
362 /* The parent of this node. In the root node, this is NULL. */
363 struct mem_node
*parent
;
365 /* Start and end of allocated region. */
369 enum {MEM_BLACK
, MEM_RED
} color
;
375 /* Base address of stack. Set in main. */
377 Lisp_Object
*stack_base
;
379 /* Root of the tree describing allocated Lisp memory. */
381 static struct mem_node
*mem_root
;
383 /* Lowest and highest known address in the heap. */
385 static void *min_heap_address
, *max_heap_address
;
387 /* Sentinel node of the tree. */
389 static struct mem_node mem_z
;
390 #define MEM_NIL &mem_z
392 static struct mem_node
*mem_insert (void *, void *, enum mem_type
);
393 static void mem_insert_fixup (struct mem_node
*);
394 static void mem_rotate_left (struct mem_node
*);
395 static void mem_rotate_right (struct mem_node
*);
396 static void mem_delete (struct mem_node
*);
397 static void mem_delete_fixup (struct mem_node
*);
398 static struct mem_node
*mem_find (void *);
400 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
406 /* Recording what needs to be marked for gc. */
408 struct gcpro
*gcprolist
;
410 /* Addresses of staticpro'd variables. Initialize it to a nonzero
411 value; otherwise some compilers put it into BSS. */
413 enum { NSTATICS
= 2048 };
414 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
416 /* Index of next unused slot in staticvec. */
418 static int staticidx
;
420 static void *pure_alloc (size_t, int);
422 /* Return X rounded to the next multiple of Y. Arguments should not
423 have side effects, as they are evaluated more than once. Assume X
424 + Y - 1 does not overflow. Tune for Y being a power of 2. */
426 #define ROUNDUP(x, y) ((y) & ((y) - 1) \
427 ? ((x) + (y) - 1) - ((x) + (y) - 1) % (y) \
428 : ((x) + (y) - 1) & ~ ((y) - 1))
430 /* Return PTR rounded up to the next multiple of ALIGNMENT. */
433 ALIGN (void *ptr
, int alignment
)
435 return (void *) ROUNDUP ((uintptr_t) ptr
, alignment
);
439 XFLOAT_INIT (Lisp_Object f
, double n
)
441 XFLOAT (f
)->u
.data
= n
;
445 pointers_fit_in_lispobj_p (void)
447 return (UINTPTR_MAX
<= VAL_MAX
) || USE_LSB_TAG
;
451 mmap_lisp_allowed_p (void)
453 /* If we can't store all memory addresses in our lisp objects, it's
454 risky to let the heap use mmap and give us addresses from all
455 over our address space. We also can't use mmap for lisp objects
456 if we might dump: unexec doesn't preserve the contents of mmapped
458 return pointers_fit_in_lispobj_p () && !might_dump
;
462 /************************************************************************
464 ************************************************************************/
466 /* Function malloc calls this if it finds we are near exhausting storage. */
469 malloc_warning (const char *str
)
471 pending_malloc_warning
= str
;
475 /* Display an already-pending malloc warning. */
478 display_malloc_warning (void)
480 call3 (intern ("display-warning"),
482 build_string (pending_malloc_warning
),
483 intern ("emergency"));
484 pending_malloc_warning
= 0;
487 /* Called if we can't allocate relocatable space for a buffer. */
490 buffer_memory_full (ptrdiff_t nbytes
)
492 /* If buffers use the relocating allocator, no need to free
493 spare_memory, because we may have plenty of malloc space left
494 that we could get, and if we don't, the malloc that fails will
495 itself cause spare_memory to be freed. If buffers don't use the
496 relocating allocator, treat this like any other failing
500 memory_full (nbytes
);
502 /* This used to call error, but if we've run out of memory, we could
503 get infinite recursion trying to build the string. */
504 xsignal (Qnil
, Vmemory_signal_data
);
508 /* A common multiple of the positive integers A and B. Ideally this
509 would be the least common multiple, but there's no way to do that
510 as a constant expression in C, so do the best that we can easily do. */
511 #define COMMON_MULTIPLE(a, b) \
512 ((a) % (b) == 0 ? (a) : (b) % (a) == 0 ? (b) : (a) * (b))
514 #ifndef XMALLOC_OVERRUN_CHECK
515 #define XMALLOC_OVERRUN_CHECK_OVERHEAD 0
518 /* Check for overrun in malloc'ed buffers by wrapping a header and trailer
521 The header consists of XMALLOC_OVERRUN_CHECK_SIZE fixed bytes
522 followed by XMALLOC_OVERRUN_SIZE_SIZE bytes containing the original
523 block size in little-endian order. The trailer consists of
524 XMALLOC_OVERRUN_CHECK_SIZE fixed bytes.
526 The header is used to detect whether this block has been allocated
527 through these functions, as some low-level libc functions may
528 bypass the malloc hooks. */
530 #define XMALLOC_OVERRUN_CHECK_SIZE 16
531 #define XMALLOC_OVERRUN_CHECK_OVERHEAD \
532 (2 * XMALLOC_OVERRUN_CHECK_SIZE + XMALLOC_OVERRUN_SIZE_SIZE)
534 /* Define XMALLOC_OVERRUN_SIZE_SIZE so that (1) it's large enough to
535 hold a size_t value and (2) the header size is a multiple of the
536 alignment that Emacs needs for C types and for USE_LSB_TAG. */
537 #define XMALLOC_BASE_ALIGNMENT alignof (max_align_t)
540 # define XMALLOC_HEADER_ALIGNMENT \
541 COMMON_MULTIPLE (GCALIGNMENT, XMALLOC_BASE_ALIGNMENT)
543 # define XMALLOC_HEADER_ALIGNMENT XMALLOC_BASE_ALIGNMENT
545 #define XMALLOC_OVERRUN_SIZE_SIZE \
546 (((XMALLOC_OVERRUN_CHECK_SIZE + sizeof (size_t) \
547 + XMALLOC_HEADER_ALIGNMENT - 1) \
548 / XMALLOC_HEADER_ALIGNMENT * XMALLOC_HEADER_ALIGNMENT) \
549 - XMALLOC_OVERRUN_CHECK_SIZE)
551 static char const xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
] =
552 { '\x9a', '\x9b', '\xae', '\xaf',
553 '\xbf', '\xbe', '\xce', '\xcf',
554 '\xea', '\xeb', '\xec', '\xed',
555 '\xdf', '\xde', '\x9c', '\x9d' };
557 static char const xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
558 { '\xaa', '\xab', '\xac', '\xad',
559 '\xba', '\xbb', '\xbc', '\xbd',
560 '\xca', '\xcb', '\xcc', '\xcd',
561 '\xda', '\xdb', '\xdc', '\xdd' };
563 /* Insert and extract the block size in the header. */
566 xmalloc_put_size (unsigned char *ptr
, size_t size
)
569 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
571 *--ptr
= size
& ((1 << CHAR_BIT
) - 1);
577 xmalloc_get_size (unsigned char *ptr
)
581 ptr
-= XMALLOC_OVERRUN_SIZE_SIZE
;
582 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
591 /* Like malloc, but wraps allocated block with header and trailer. */
594 overrun_check_malloc (size_t size
)
596 register unsigned char *val
;
597 if (SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
< size
)
600 val
= malloc (size
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
603 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
604 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
605 xmalloc_put_size (val
, size
);
606 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
607 XMALLOC_OVERRUN_CHECK_SIZE
);
613 /* Like realloc, but checks old block for overrun, and wraps new block
614 with header and trailer. */
617 overrun_check_realloc (void *block
, size_t size
)
619 register unsigned char *val
= (unsigned char *) block
;
620 if (SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
< size
)
624 && memcmp (xmalloc_overrun_check_header
,
625 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
626 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
628 size_t osize
= xmalloc_get_size (val
);
629 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
630 XMALLOC_OVERRUN_CHECK_SIZE
))
632 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
633 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
634 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
637 val
= realloc (val
, size
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
641 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
642 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
643 xmalloc_put_size (val
, size
);
644 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
645 XMALLOC_OVERRUN_CHECK_SIZE
);
650 /* Like free, but checks block for overrun. */
653 overrun_check_free (void *block
)
655 unsigned char *val
= (unsigned char *) block
;
658 && memcmp (xmalloc_overrun_check_header
,
659 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
660 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
662 size_t osize
= xmalloc_get_size (val
);
663 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
664 XMALLOC_OVERRUN_CHECK_SIZE
))
666 #ifdef XMALLOC_CLEAR_FREE_MEMORY
667 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
668 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
670 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
671 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
672 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
682 #define malloc overrun_check_malloc
683 #define realloc overrun_check_realloc
684 #define free overrun_check_free
687 /* If compiled with XMALLOC_BLOCK_INPUT_CHECK, define a symbol
688 BLOCK_INPUT_IN_MEMORY_ALLOCATORS that is visible to the debugger.
689 If that variable is set, block input while in one of Emacs's memory
690 allocation functions. There should be no need for this debugging
691 option, since signal handlers do not allocate memory, but Emacs
692 formerly allocated memory in signal handlers and this compile-time
693 option remains as a way to help debug the issue should it rear its
695 #ifdef XMALLOC_BLOCK_INPUT_CHECK
696 bool block_input_in_memory_allocators EXTERNALLY_VISIBLE
;
698 malloc_block_input (void)
700 if (block_input_in_memory_allocators
)
704 malloc_unblock_input (void)
706 if (block_input_in_memory_allocators
)
709 # define MALLOC_BLOCK_INPUT malloc_block_input ()
710 # define MALLOC_UNBLOCK_INPUT malloc_unblock_input ()
712 # define MALLOC_BLOCK_INPUT ((void) 0)
713 # define MALLOC_UNBLOCK_INPUT ((void) 0)
716 #define MALLOC_PROBE(size) \
718 if (profiler_memory_running) \
719 malloc_probe (size); \
723 /* Like malloc but check for no memory and block interrupt input.. */
726 xmalloc (size_t size
)
732 MALLOC_UNBLOCK_INPUT
;
740 /* Like the above, but zeroes out the memory just allocated. */
743 xzalloc (size_t size
)
749 MALLOC_UNBLOCK_INPUT
;
753 memset (val
, 0, size
);
758 /* Like realloc but check for no memory and block interrupt input.. */
761 xrealloc (void *block
, size_t size
)
766 /* We must call malloc explicitly when BLOCK is 0, since some
767 reallocs don't do this. */
771 val
= realloc (block
, size
);
772 MALLOC_UNBLOCK_INPUT
;
781 /* Like free but block interrupt input. */
790 MALLOC_UNBLOCK_INPUT
;
791 /* We don't call refill_memory_reserve here
792 because in practice the call in r_alloc_free seems to suffice. */
796 /* Other parts of Emacs pass large int values to allocator functions
797 expecting ptrdiff_t. This is portable in practice, but check it to
799 verify (INT_MAX
<= PTRDIFF_MAX
);
802 /* Allocate an array of NITEMS items, each of size ITEM_SIZE.
803 Signal an error on memory exhaustion, and block interrupt input. */
806 xnmalloc (ptrdiff_t nitems
, ptrdiff_t item_size
)
808 eassert (0 <= nitems
&& 0 < item_size
);
809 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
810 memory_full (SIZE_MAX
);
811 return xmalloc (nitems
* item_size
);
815 /* Reallocate an array PA to make it of NITEMS items, each of size ITEM_SIZE.
816 Signal an error on memory exhaustion, and block interrupt input. */
819 xnrealloc (void *pa
, ptrdiff_t nitems
, ptrdiff_t item_size
)
821 eassert (0 <= nitems
&& 0 < item_size
);
822 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
823 memory_full (SIZE_MAX
);
824 return xrealloc (pa
, nitems
* item_size
);
828 /* Grow PA, which points to an array of *NITEMS items, and return the
829 location of the reallocated array, updating *NITEMS to reflect its
830 new size. The new array will contain at least NITEMS_INCR_MIN more
831 items, but will not contain more than NITEMS_MAX items total.
832 ITEM_SIZE is the size of each item, in bytes.
834 ITEM_SIZE and NITEMS_INCR_MIN must be positive. *NITEMS must be
835 nonnegative. If NITEMS_MAX is -1, it is treated as if it were
838 If PA is null, then allocate a new array instead of reallocating
841 Block interrupt input as needed. If memory exhaustion occurs, set
842 *NITEMS to zero if PA is null, and signal an error (i.e., do not
845 Thus, to grow an array A without saving its old contents, do
846 { xfree (A); A = NULL; A = xpalloc (NULL, &AITEMS, ...); }.
847 The A = NULL avoids a dangling pointer if xpalloc exhausts memory
848 and signals an error, and later this code is reexecuted and
849 attempts to free A. */
852 xpalloc (void *pa
, ptrdiff_t *nitems
, ptrdiff_t nitems_incr_min
,
853 ptrdiff_t nitems_max
, ptrdiff_t item_size
)
855 /* The approximate size to use for initial small allocation
856 requests. This is the largest "small" request for the GNU C
858 enum { DEFAULT_MXFAST
= 64 * sizeof (size_t) / 4 };
860 /* If the array is tiny, grow it to about (but no greater than)
861 DEFAULT_MXFAST bytes. Otherwise, grow it by about 50%. */
862 ptrdiff_t n
= *nitems
;
863 ptrdiff_t tiny_max
= DEFAULT_MXFAST
/ item_size
- n
;
864 ptrdiff_t half_again
= n
>> 1;
865 ptrdiff_t incr_estimate
= max (tiny_max
, half_again
);
867 /* Adjust the increment according to three constraints: NITEMS_INCR_MIN,
868 NITEMS_MAX, and what the C language can represent safely. */
869 ptrdiff_t C_language_max
= min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
;
870 ptrdiff_t n_max
= (0 <= nitems_max
&& nitems_max
< C_language_max
871 ? nitems_max
: C_language_max
);
872 ptrdiff_t nitems_incr_max
= n_max
- n
;
873 ptrdiff_t incr
= max (nitems_incr_min
, min (incr_estimate
, nitems_incr_max
));
875 eassert (0 < item_size
&& 0 < nitems_incr_min
&& 0 <= n
&& -1 <= nitems_max
);
878 if (nitems_incr_max
< incr
)
879 memory_full (SIZE_MAX
);
881 pa
= xrealloc (pa
, n
* item_size
);
887 /* Like strdup, but uses xmalloc. */
890 xstrdup (const char *s
)
894 size
= strlen (s
) + 1;
895 return memcpy (xmalloc (size
), s
, size
);
898 /* Like above, but duplicates Lisp string to C string. */
901 xlispstrdup (Lisp_Object string
)
903 ptrdiff_t size
= SBYTES (string
) + 1;
904 return memcpy (xmalloc (size
), SSDATA (string
), size
);
907 /* Assign to *PTR a copy of STRING, freeing any storage *PTR formerly
908 pointed to. If STRING is null, assign it without copying anything.
909 Allocate before freeing, to avoid a dangling pointer if allocation
913 dupstring (char **ptr
, char const *string
)
916 *ptr
= string
? xstrdup (string
) : 0;
921 /* Like putenv, but (1) use the equivalent of xmalloc and (2) the
922 argument is a const pointer. */
925 xputenv (char const *string
)
927 if (putenv ((char *) string
) != 0)
931 /* Return a newly allocated memory block of SIZE bytes, remembering
932 to free it when unwinding. */
934 record_xmalloc (size_t size
)
936 void *p
= xmalloc (size
);
937 record_unwind_protect_ptr (xfree
, p
);
942 /* Like malloc but used for allocating Lisp data. NBYTES is the
943 number of bytes to allocate, TYPE describes the intended use of the
944 allocated memory block (for strings, for conses, ...). */
947 void *lisp_malloc_loser EXTERNALLY_VISIBLE
;
951 lisp_malloc (size_t nbytes
, enum mem_type type
)
957 #ifdef GC_MALLOC_CHECK
958 allocated_mem_type
= type
;
961 val
= malloc (nbytes
);
964 /* If the memory just allocated cannot be addressed thru a Lisp
965 object's pointer, and it needs to be,
966 that's equivalent to running out of memory. */
967 if (val
&& type
!= MEM_TYPE_NON_LISP
)
970 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
971 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
973 lisp_malloc_loser
= val
;
980 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
981 if (val
&& type
!= MEM_TYPE_NON_LISP
)
982 mem_insert (val
, (char *) val
+ nbytes
, type
);
985 MALLOC_UNBLOCK_INPUT
;
987 memory_full (nbytes
);
988 MALLOC_PROBE (nbytes
);
992 /* Free BLOCK. This must be called to free memory allocated with a
993 call to lisp_malloc. */
996 lisp_free (void *block
)
1000 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1001 mem_delete (mem_find (block
));
1003 MALLOC_UNBLOCK_INPUT
;
1006 /***** Allocation of aligned blocks of memory to store Lisp data. *****/
1008 /* The entry point is lisp_align_malloc which returns blocks of at most
1009 BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
1011 /* Use aligned_alloc if it or a simple substitute is available.
1012 Address sanitization breaks aligned allocation, as of gcc 4.8.2 and
1013 clang 3.3 anyway. */
1015 #if ! ADDRESS_SANITIZER
1016 # if !defined SYSTEM_MALLOC && !defined DOUG_LEA_MALLOC && !defined HYBRID_MALLOC
1017 # define USE_ALIGNED_ALLOC 1
1018 /* Defined in gmalloc.c. */
1019 void *aligned_alloc (size_t, size_t);
1020 # elif defined HYBRID_MALLOC
1021 # if defined ALIGNED_ALLOC || defined HAVE_POSIX_MEMALIGN
1022 # define USE_ALIGNED_ALLOC 1
1023 # define aligned_alloc hybrid_aligned_alloc
1024 /* Defined in gmalloc.c. */
1025 void *aligned_alloc (size_t, size_t);
1027 # elif defined HAVE_ALIGNED_ALLOC
1028 # define USE_ALIGNED_ALLOC 1
1029 # elif defined HAVE_POSIX_MEMALIGN
1030 # define USE_ALIGNED_ALLOC 1
1032 aligned_alloc (size_t alignment
, size_t size
)
1035 return posix_memalign (&p
, alignment
, size
) == 0 ? p
: 0;
1040 /* BLOCK_ALIGN has to be a power of 2. */
1041 #define BLOCK_ALIGN (1 << 10)
1043 /* Padding to leave at the end of a malloc'd block. This is to give
1044 malloc a chance to minimize the amount of memory wasted to alignment.
1045 It should be tuned to the particular malloc library used.
1046 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
1047 aligned_alloc on the other hand would ideally prefer a value of 4
1048 because otherwise, there's 1020 bytes wasted between each ablocks.
1049 In Emacs, testing shows that those 1020 can most of the time be
1050 efficiently used by malloc to place other objects, so a value of 0 can
1051 still preferable unless you have a lot of aligned blocks and virtually
1053 #define BLOCK_PADDING 0
1054 #define BLOCK_BYTES \
1055 (BLOCK_ALIGN - sizeof (struct ablocks *) - BLOCK_PADDING)
1057 /* Internal data structures and constants. */
1059 #define ABLOCKS_SIZE 16
1061 /* An aligned block of memory. */
1066 char payload
[BLOCK_BYTES
];
1067 struct ablock
*next_free
;
1069 /* `abase' is the aligned base of the ablocks. */
1070 /* It is overloaded to hold the virtual `busy' field that counts
1071 the number of used ablock in the parent ablocks.
1072 The first ablock has the `busy' field, the others have the `abase'
1073 field. To tell the difference, we assume that pointers will have
1074 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
1075 is used to tell whether the real base of the parent ablocks is `abase'
1076 (if not, the word before the first ablock holds a pointer to the
1078 struct ablocks
*abase
;
1079 /* The padding of all but the last ablock is unused. The padding of
1080 the last ablock in an ablocks is not allocated. */
1082 char padding
[BLOCK_PADDING
];
1086 /* A bunch of consecutive aligned blocks. */
1089 struct ablock blocks
[ABLOCKS_SIZE
];
1092 /* Size of the block requested from malloc or aligned_alloc. */
1093 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
1095 #define ABLOCK_ABASE(block) \
1096 (((uintptr_t) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
1097 ? (struct ablocks *)(block) \
1100 /* Virtual `busy' field. */
1101 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
1103 /* Pointer to the (not necessarily aligned) malloc block. */
1104 #ifdef USE_ALIGNED_ALLOC
1105 #define ABLOCKS_BASE(abase) (abase)
1107 #define ABLOCKS_BASE(abase) \
1108 (1 & (intptr_t) ABLOCKS_BUSY (abase) ? abase : ((void **)abase)[-1])
1111 /* The list of free ablock. */
1112 static struct ablock
*free_ablock
;
1114 /* Allocate an aligned block of nbytes.
1115 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
1116 smaller or equal to BLOCK_BYTES. */
1118 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
1121 struct ablocks
*abase
;
1123 eassert (nbytes
<= BLOCK_BYTES
);
1127 #ifdef GC_MALLOC_CHECK
1128 allocated_mem_type
= type
;
1134 intptr_t aligned
; /* int gets warning casting to 64-bit pointer. */
1136 #ifdef DOUG_LEA_MALLOC
1137 if (!mmap_lisp_allowed_p ())
1138 mallopt (M_MMAP_MAX
, 0);
1141 #ifdef USE_ALIGNED_ALLOC
1142 abase
= base
= aligned_alloc (BLOCK_ALIGN
, ABLOCKS_BYTES
);
1144 base
= malloc (ABLOCKS_BYTES
);
1145 abase
= ALIGN (base
, BLOCK_ALIGN
);
1150 MALLOC_UNBLOCK_INPUT
;
1151 memory_full (ABLOCKS_BYTES
);
1154 aligned
= (base
== abase
);
1156 ((void **) abase
)[-1] = base
;
1158 #ifdef DOUG_LEA_MALLOC
1159 if (!mmap_lisp_allowed_p ())
1160 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1164 /* If the memory just allocated cannot be addressed thru a Lisp
1165 object's pointer, and it needs to be, that's equivalent to
1166 running out of memory. */
1167 if (type
!= MEM_TYPE_NON_LISP
)
1170 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1171 XSETCONS (tem
, end
);
1172 if ((char *) XCONS (tem
) != end
)
1174 lisp_malloc_loser
= base
;
1176 MALLOC_UNBLOCK_INPUT
;
1177 memory_full (SIZE_MAX
);
1182 /* Initialize the blocks and put them on the free list.
1183 If `base' was not properly aligned, we can't use the last block. */
1184 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1186 abase
->blocks
[i
].abase
= abase
;
1187 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1188 free_ablock
= &abase
->blocks
[i
];
1190 ABLOCKS_BUSY (abase
) = (struct ablocks
*) aligned
;
1192 eassert (0 == ((uintptr_t) abase
) % BLOCK_ALIGN
);
1193 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1194 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1195 eassert (ABLOCKS_BASE (abase
) == base
);
1196 eassert (aligned
== (intptr_t) ABLOCKS_BUSY (abase
));
1199 abase
= ABLOCK_ABASE (free_ablock
);
1200 ABLOCKS_BUSY (abase
)
1201 = (struct ablocks
*) (2 + (intptr_t) ABLOCKS_BUSY (abase
));
1203 free_ablock
= free_ablock
->x
.next_free
;
1205 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1206 if (type
!= MEM_TYPE_NON_LISP
)
1207 mem_insert (val
, (char *) val
+ nbytes
, type
);
1210 MALLOC_UNBLOCK_INPUT
;
1212 MALLOC_PROBE (nbytes
);
1214 eassert (0 == ((uintptr_t) val
) % BLOCK_ALIGN
);
1219 lisp_align_free (void *block
)
1221 struct ablock
*ablock
= block
;
1222 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1225 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1226 mem_delete (mem_find (block
));
1228 /* Put on free list. */
1229 ablock
->x
.next_free
= free_ablock
;
1230 free_ablock
= ablock
;
1231 /* Update busy count. */
1232 ABLOCKS_BUSY (abase
)
1233 = (struct ablocks
*) (-2 + (intptr_t) ABLOCKS_BUSY (abase
));
1235 if (2 > (intptr_t) ABLOCKS_BUSY (abase
))
1236 { /* All the blocks are free. */
1237 int i
= 0, aligned
= (intptr_t) ABLOCKS_BUSY (abase
);
1238 struct ablock
**tem
= &free_ablock
;
1239 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1243 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1246 *tem
= (*tem
)->x
.next_free
;
1249 tem
= &(*tem
)->x
.next_free
;
1251 eassert ((aligned
& 1) == aligned
);
1252 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1253 #ifdef USE_POSIX_MEMALIGN
1254 eassert ((uintptr_t) ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1256 free (ABLOCKS_BASE (abase
));
1258 MALLOC_UNBLOCK_INPUT
;
1262 /***********************************************************************
1264 ***********************************************************************/
1266 /* Number of intervals allocated in an interval_block structure.
1267 The 1020 is 1024 minus malloc overhead. */
1269 #define INTERVAL_BLOCK_SIZE \
1270 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1272 /* Intervals are allocated in chunks in the form of an interval_block
1275 struct interval_block
1277 /* Place `intervals' first, to preserve alignment. */
1278 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1279 struct interval_block
*next
;
1282 /* Current interval block. Its `next' pointer points to older
1285 static struct interval_block
*interval_block
;
1287 /* Index in interval_block above of the next unused interval
1290 static int interval_block_index
= INTERVAL_BLOCK_SIZE
;
1292 /* Number of free and live intervals. */
1294 static EMACS_INT total_free_intervals
, total_intervals
;
1296 /* List of free intervals. */
1298 static INTERVAL interval_free_list
;
1300 /* Return a new interval. */
1303 make_interval (void)
1309 if (interval_free_list
)
1311 val
= interval_free_list
;
1312 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1316 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1318 struct interval_block
*newi
1319 = lisp_malloc (sizeof *newi
, MEM_TYPE_NON_LISP
);
1321 newi
->next
= interval_block
;
1322 interval_block
= newi
;
1323 interval_block_index
= 0;
1324 total_free_intervals
+= INTERVAL_BLOCK_SIZE
;
1326 val
= &interval_block
->intervals
[interval_block_index
++];
1329 MALLOC_UNBLOCK_INPUT
;
1331 consing_since_gc
+= sizeof (struct interval
);
1333 total_free_intervals
--;
1334 RESET_INTERVAL (val
);
1340 /* Mark Lisp objects in interval I. */
1343 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1345 /* Intervals should never be shared. So, if extra internal checking is
1346 enabled, GC aborts if it seems to have visited an interval twice. */
1347 eassert (!i
->gcmarkbit
);
1349 mark_object (i
->plist
);
1352 /* Mark the interval tree rooted in I. */
1354 #define MARK_INTERVAL_TREE(i) \
1356 if (i && !i->gcmarkbit) \
1357 traverse_intervals_noorder (i, mark_interval, Qnil); \
1360 /***********************************************************************
1362 ***********************************************************************/
1364 /* Lisp_Strings are allocated in string_block structures. When a new
1365 string_block is allocated, all the Lisp_Strings it contains are
1366 added to a free-list string_free_list. When a new Lisp_String is
1367 needed, it is taken from that list. During the sweep phase of GC,
1368 string_blocks that are entirely free are freed, except two which
1371 String data is allocated from sblock structures. Strings larger
1372 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1373 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1375 Sblocks consist internally of sdata structures, one for each
1376 Lisp_String. The sdata structure points to the Lisp_String it
1377 belongs to. The Lisp_String points back to the `u.data' member of
1378 its sdata structure.
1380 When a Lisp_String is freed during GC, it is put back on
1381 string_free_list, and its `data' member and its sdata's `string'
1382 pointer is set to null. The size of the string is recorded in the
1383 `n.nbytes' member of the sdata. So, sdata structures that are no
1384 longer used, can be easily recognized, and it's easy to compact the
1385 sblocks of small strings which we do in compact_small_strings. */
1387 /* Size in bytes of an sblock structure used for small strings. This
1388 is 8192 minus malloc overhead. */
1390 #define SBLOCK_SIZE 8188
1392 /* Strings larger than this are considered large strings. String data
1393 for large strings is allocated from individual sblocks. */
1395 #define LARGE_STRING_BYTES 1024
1397 /* The SDATA typedef is a struct or union describing string memory
1398 sub-allocated from an sblock. This is where the contents of Lisp
1399 strings are stored. */
1403 /* Back-pointer to the string this sdata belongs to. If null, this
1404 structure is free, and NBYTES (in this structure or in the union below)
1405 contains the string's byte size (the same value that STRING_BYTES
1406 would return if STRING were non-null). If non-null, STRING_BYTES
1407 (STRING) is the size of the data, and DATA contains the string's
1409 struct Lisp_String
*string
;
1411 #ifdef GC_CHECK_STRING_BYTES
1415 unsigned char data
[FLEXIBLE_ARRAY_MEMBER
];
1418 #ifdef GC_CHECK_STRING_BYTES
1420 typedef struct sdata sdata
;
1421 #define SDATA_NBYTES(S) (S)->nbytes
1422 #define SDATA_DATA(S) (S)->data
1428 struct Lisp_String
*string
;
1430 /* When STRING is nonnull, this union is actually of type 'struct sdata',
1431 which has a flexible array member. However, if implemented by
1432 giving this union a member of type 'struct sdata', the union
1433 could not be the last (flexible) member of 'struct sblock',
1434 because C99 prohibits a flexible array member from having a type
1435 that is itself a flexible array. So, comment this member out here,
1436 but remember that the option's there when using this union. */
1441 /* When STRING is null. */
1444 struct Lisp_String
*string
;
1449 #define SDATA_NBYTES(S) (S)->n.nbytes
1450 #define SDATA_DATA(S) ((struct sdata *) (S))->data
1452 #endif /* not GC_CHECK_STRING_BYTES */
1454 enum { SDATA_DATA_OFFSET
= offsetof (struct sdata
, data
) };
1456 /* Structure describing a block of memory which is sub-allocated to
1457 obtain string data memory for strings. Blocks for small strings
1458 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1459 as large as needed. */
1464 struct sblock
*next
;
1466 /* Pointer to the next free sdata block. This points past the end
1467 of the sblock if there isn't any space left in this block. */
1471 sdata data
[FLEXIBLE_ARRAY_MEMBER
];
1474 /* Number of Lisp strings in a string_block structure. The 1020 is
1475 1024 minus malloc overhead. */
1477 #define STRING_BLOCK_SIZE \
1478 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1480 /* Structure describing a block from which Lisp_String structures
1485 /* Place `strings' first, to preserve alignment. */
1486 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1487 struct string_block
*next
;
1490 /* Head and tail of the list of sblock structures holding Lisp string
1491 data. We always allocate from current_sblock. The NEXT pointers
1492 in the sblock structures go from oldest_sblock to current_sblock. */
1494 static struct sblock
*oldest_sblock
, *current_sblock
;
1496 /* List of sblocks for large strings. */
1498 static struct sblock
*large_sblocks
;
1500 /* List of string_block structures. */
1502 static struct string_block
*string_blocks
;
1504 /* Free-list of Lisp_Strings. */
1506 static struct Lisp_String
*string_free_list
;
1508 /* Number of live and free Lisp_Strings. */
1510 static EMACS_INT total_strings
, total_free_strings
;
1512 /* Number of bytes used by live strings. */
1514 static EMACS_INT total_string_bytes
;
1516 /* Given a pointer to a Lisp_String S which is on the free-list
1517 string_free_list, return a pointer to its successor in the
1520 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1522 /* Return a pointer to the sdata structure belonging to Lisp string S.
1523 S must be live, i.e. S->data must not be null. S->data is actually
1524 a pointer to the `u.data' member of its sdata structure; the
1525 structure starts at a constant offset in front of that. */
1527 #define SDATA_OF_STRING(S) ((sdata *) ((S)->data - SDATA_DATA_OFFSET))
1530 #ifdef GC_CHECK_STRING_OVERRUN
1532 /* We check for overrun in string data blocks by appending a small
1533 "cookie" after each allocated string data block, and check for the
1534 presence of this cookie during GC. */
1536 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1537 static char const string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1538 { '\xde', '\xad', '\xbe', '\xef' };
1541 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1544 /* Value is the size of an sdata structure large enough to hold NBYTES
1545 bytes of string data. The value returned includes a terminating
1546 NUL byte, the size of the sdata structure, and padding. */
1548 #ifdef GC_CHECK_STRING_BYTES
1550 #define SDATA_SIZE(NBYTES) \
1551 ((SDATA_DATA_OFFSET \
1553 + sizeof (ptrdiff_t) - 1) \
1554 & ~(sizeof (ptrdiff_t) - 1))
1556 #else /* not GC_CHECK_STRING_BYTES */
1558 /* The 'max' reserves space for the nbytes union member even when NBYTES + 1 is
1559 less than the size of that member. The 'max' is not needed when
1560 SDATA_DATA_OFFSET is a multiple of sizeof (ptrdiff_t), because then the
1561 alignment code reserves enough space. */
1563 #define SDATA_SIZE(NBYTES) \
1564 ((SDATA_DATA_OFFSET \
1565 + (SDATA_DATA_OFFSET % sizeof (ptrdiff_t) == 0 \
1567 : max (NBYTES, sizeof (ptrdiff_t) - 1)) \
1569 + sizeof (ptrdiff_t) - 1) \
1570 & ~(sizeof (ptrdiff_t) - 1))
1572 #endif /* not GC_CHECK_STRING_BYTES */
1574 /* Extra bytes to allocate for each string. */
1576 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1578 /* Exact bound on the number of bytes in a string, not counting the
1579 terminating null. A string cannot contain more bytes than
1580 STRING_BYTES_BOUND, nor can it be so long that the size_t
1581 arithmetic in allocate_string_data would overflow while it is
1582 calculating a value to be passed to malloc. */
1583 static ptrdiff_t const STRING_BYTES_MAX
=
1584 min (STRING_BYTES_BOUND
,
1585 ((SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
1587 - offsetof (struct sblock
, data
)
1588 - SDATA_DATA_OFFSET
)
1589 & ~(sizeof (EMACS_INT
) - 1)));
1591 /* Initialize string allocation. Called from init_alloc_once. */
1596 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1597 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1601 #ifdef GC_CHECK_STRING_BYTES
1603 static int check_string_bytes_count
;
1605 /* Like STRING_BYTES, but with debugging check. Can be
1606 called during GC, so pay attention to the mark bit. */
1609 string_bytes (struct Lisp_String
*s
)
1612 (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1614 if (!PURE_POINTER_P (s
)
1616 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1621 /* Check validity of Lisp strings' string_bytes member in B. */
1624 check_sblock (struct sblock
*b
)
1626 sdata
*from
, *end
, *from_end
;
1630 for (from
= b
->data
; from
< end
; from
= from_end
)
1632 /* Compute the next FROM here because copying below may
1633 overwrite data we need to compute it. */
1636 /* Check that the string size recorded in the string is the
1637 same as the one recorded in the sdata structure. */
1638 nbytes
= SDATA_SIZE (from
->string
? string_bytes (from
->string
)
1639 : SDATA_NBYTES (from
));
1640 from_end
= (sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1645 /* Check validity of Lisp strings' string_bytes member. ALL_P
1646 means check all strings, otherwise check only most
1647 recently allocated strings. Used for hunting a bug. */
1650 check_string_bytes (bool all_p
)
1656 for (b
= large_sblocks
; b
; b
= b
->next
)
1658 struct Lisp_String
*s
= b
->data
[0].string
;
1663 for (b
= oldest_sblock
; b
; b
= b
->next
)
1666 else if (current_sblock
)
1667 check_sblock (current_sblock
);
1670 #else /* not GC_CHECK_STRING_BYTES */
1672 #define check_string_bytes(all) ((void) 0)
1674 #endif /* GC_CHECK_STRING_BYTES */
1676 #ifdef GC_CHECK_STRING_FREE_LIST
1678 /* Walk through the string free list looking for bogus next pointers.
1679 This may catch buffer overrun from a previous string. */
1682 check_string_free_list (void)
1684 struct Lisp_String
*s
;
1686 /* Pop a Lisp_String off the free-list. */
1687 s
= string_free_list
;
1690 if ((uintptr_t) s
< 1024)
1692 s
= NEXT_FREE_LISP_STRING (s
);
1696 #define check_string_free_list()
1699 /* Return a new Lisp_String. */
1701 static struct Lisp_String
*
1702 allocate_string (void)
1704 struct Lisp_String
*s
;
1708 /* If the free-list is empty, allocate a new string_block, and
1709 add all the Lisp_Strings in it to the free-list. */
1710 if (string_free_list
== NULL
)
1712 struct string_block
*b
= lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1715 b
->next
= string_blocks
;
1718 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1721 /* Every string on a free list should have NULL data pointer. */
1723 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1724 string_free_list
= s
;
1727 total_free_strings
+= STRING_BLOCK_SIZE
;
1730 check_string_free_list ();
1732 /* Pop a Lisp_String off the free-list. */
1733 s
= string_free_list
;
1734 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1736 MALLOC_UNBLOCK_INPUT
;
1738 --total_free_strings
;
1741 consing_since_gc
+= sizeof *s
;
1743 #ifdef GC_CHECK_STRING_BYTES
1744 if (!noninteractive
)
1746 if (++check_string_bytes_count
== 200)
1748 check_string_bytes_count
= 0;
1749 check_string_bytes (1);
1752 check_string_bytes (0);
1754 #endif /* GC_CHECK_STRING_BYTES */
1760 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1761 plus a NUL byte at the end. Allocate an sdata structure for S, and
1762 set S->data to its `u.data' member. Store a NUL byte at the end of
1763 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1764 S->data if it was initially non-null. */
1767 allocate_string_data (struct Lisp_String
*s
,
1768 EMACS_INT nchars
, EMACS_INT nbytes
)
1770 sdata
*data
, *old_data
;
1772 ptrdiff_t needed
, old_nbytes
;
1774 if (STRING_BYTES_MAX
< nbytes
)
1777 /* Determine the number of bytes needed to store NBYTES bytes
1779 needed
= SDATA_SIZE (nbytes
);
1782 old_data
= SDATA_OF_STRING (s
);
1783 old_nbytes
= STRING_BYTES (s
);
1790 if (nbytes
> LARGE_STRING_BYTES
)
1792 size_t size
= offsetof (struct sblock
, data
) + needed
;
1794 #ifdef DOUG_LEA_MALLOC
1795 if (!mmap_lisp_allowed_p ())
1796 mallopt (M_MMAP_MAX
, 0);
1799 b
= lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1801 #ifdef DOUG_LEA_MALLOC
1802 if (!mmap_lisp_allowed_p ())
1803 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1806 b
->next_free
= b
->data
;
1807 b
->data
[0].string
= NULL
;
1808 b
->next
= large_sblocks
;
1811 else if (current_sblock
== NULL
1812 || (((char *) current_sblock
+ SBLOCK_SIZE
1813 - (char *) current_sblock
->next_free
)
1814 < (needed
+ GC_STRING_EXTRA
)))
1816 /* Not enough room in the current sblock. */
1817 b
= lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1818 b
->next_free
= b
->data
;
1819 b
->data
[0].string
= NULL
;
1823 current_sblock
->next
= b
;
1831 data
= b
->next_free
;
1832 b
->next_free
= (sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
1834 MALLOC_UNBLOCK_INPUT
;
1837 s
->data
= SDATA_DATA (data
);
1838 #ifdef GC_CHECK_STRING_BYTES
1839 SDATA_NBYTES (data
) = nbytes
;
1842 s
->size_byte
= nbytes
;
1843 s
->data
[nbytes
] = '\0';
1844 #ifdef GC_CHECK_STRING_OVERRUN
1845 memcpy ((char *) data
+ needed
, string_overrun_cookie
,
1846 GC_STRING_OVERRUN_COOKIE_SIZE
);
1849 /* Note that Faset may call to this function when S has already data
1850 assigned. In this case, mark data as free by setting it's string
1851 back-pointer to null, and record the size of the data in it. */
1854 SDATA_NBYTES (old_data
) = old_nbytes
;
1855 old_data
->string
= NULL
;
1858 consing_since_gc
+= needed
;
1862 /* Sweep and compact strings. */
1864 NO_INLINE
/* For better stack traces */
1866 sweep_strings (void)
1868 struct string_block
*b
, *next
;
1869 struct string_block
*live_blocks
= NULL
;
1871 string_free_list
= NULL
;
1872 total_strings
= total_free_strings
= 0;
1873 total_string_bytes
= 0;
1875 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1876 for (b
= string_blocks
; b
; b
= next
)
1879 struct Lisp_String
*free_list_before
= string_free_list
;
1883 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1885 struct Lisp_String
*s
= b
->strings
+ i
;
1889 /* String was not on free-list before. */
1890 if (STRING_MARKED_P (s
))
1892 /* String is live; unmark it and its intervals. */
1895 /* Do not use string_(set|get)_intervals here. */
1896 s
->intervals
= balance_intervals (s
->intervals
);
1899 total_string_bytes
+= STRING_BYTES (s
);
1903 /* String is dead. Put it on the free-list. */
1904 sdata
*data
= SDATA_OF_STRING (s
);
1906 /* Save the size of S in its sdata so that we know
1907 how large that is. Reset the sdata's string
1908 back-pointer so that we know it's free. */
1909 #ifdef GC_CHECK_STRING_BYTES
1910 if (string_bytes (s
) != SDATA_NBYTES (data
))
1913 data
->n
.nbytes
= STRING_BYTES (s
);
1915 data
->string
= NULL
;
1917 /* Reset the strings's `data' member so that we
1921 /* Put the string on the free-list. */
1922 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1923 string_free_list
= s
;
1929 /* S was on the free-list before. Put it there again. */
1930 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1931 string_free_list
= s
;
1936 /* Free blocks that contain free Lisp_Strings only, except
1937 the first two of them. */
1938 if (nfree
== STRING_BLOCK_SIZE
1939 && total_free_strings
> STRING_BLOCK_SIZE
)
1942 string_free_list
= free_list_before
;
1946 total_free_strings
+= nfree
;
1947 b
->next
= live_blocks
;
1952 check_string_free_list ();
1954 string_blocks
= live_blocks
;
1955 free_large_strings ();
1956 compact_small_strings ();
1958 check_string_free_list ();
1962 /* Free dead large strings. */
1965 free_large_strings (void)
1967 struct sblock
*b
, *next
;
1968 struct sblock
*live_blocks
= NULL
;
1970 for (b
= large_sblocks
; b
; b
= next
)
1974 if (b
->data
[0].string
== NULL
)
1978 b
->next
= live_blocks
;
1983 large_sblocks
= live_blocks
;
1987 /* Compact data of small strings. Free sblocks that don't contain
1988 data of live strings after compaction. */
1991 compact_small_strings (void)
1993 struct sblock
*b
, *tb
, *next
;
1994 sdata
*from
, *to
, *end
, *tb_end
;
1995 sdata
*to_end
, *from_end
;
1997 /* TB is the sblock we copy to, TO is the sdata within TB we copy
1998 to, and TB_END is the end of TB. */
2000 tb_end
= (sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2003 /* Step through the blocks from the oldest to the youngest. We
2004 expect that old blocks will stabilize over time, so that less
2005 copying will happen this way. */
2006 for (b
= oldest_sblock
; b
; b
= b
->next
)
2009 eassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2011 for (from
= b
->data
; from
< end
; from
= from_end
)
2013 /* Compute the next FROM here because copying below may
2014 overwrite data we need to compute it. */
2016 struct Lisp_String
*s
= from
->string
;
2018 #ifdef GC_CHECK_STRING_BYTES
2019 /* Check that the string size recorded in the string is the
2020 same as the one recorded in the sdata structure. */
2021 if (s
&& string_bytes (s
) != SDATA_NBYTES (from
))
2023 #endif /* GC_CHECK_STRING_BYTES */
2025 nbytes
= s
? STRING_BYTES (s
) : SDATA_NBYTES (from
);
2026 eassert (nbytes
<= LARGE_STRING_BYTES
);
2028 nbytes
= SDATA_SIZE (nbytes
);
2029 from_end
= (sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2031 #ifdef GC_CHECK_STRING_OVERRUN
2032 if (memcmp (string_overrun_cookie
,
2033 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
2034 GC_STRING_OVERRUN_COOKIE_SIZE
))
2038 /* Non-NULL S means it's alive. Copy its data. */
2041 /* If TB is full, proceed with the next sblock. */
2042 to_end
= (sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2043 if (to_end
> tb_end
)
2047 tb_end
= (sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2049 to_end
= (sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2052 /* Copy, and update the string's `data' pointer. */
2055 eassert (tb
!= b
|| to
< from
);
2056 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
2057 to
->string
->data
= SDATA_DATA (to
);
2060 /* Advance past the sdata we copied to. */
2066 /* The rest of the sblocks following TB don't contain live data, so
2067 we can free them. */
2068 for (b
= tb
->next
; b
; b
= next
)
2076 current_sblock
= tb
;
2080 string_overflow (void)
2082 error ("Maximum string size exceeded");
2085 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2086 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2087 LENGTH must be an integer.
2088 INIT must be an integer that represents a character. */)
2089 (Lisp_Object length
, Lisp_Object init
)
2091 register Lisp_Object val
;
2095 CHECK_NATNUM (length
);
2096 CHECK_CHARACTER (init
);
2098 c
= XFASTINT (init
);
2099 if (ASCII_CHAR_P (c
))
2101 nbytes
= XINT (length
);
2102 val
= make_uninit_string (nbytes
);
2103 memset (SDATA (val
), c
, nbytes
);
2104 SDATA (val
)[nbytes
] = 0;
2108 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2109 ptrdiff_t len
= CHAR_STRING (c
, str
);
2110 EMACS_INT string_len
= XINT (length
);
2111 unsigned char *p
, *beg
, *end
;
2113 if (string_len
> STRING_BYTES_MAX
/ len
)
2115 nbytes
= len
* string_len
;
2116 val
= make_uninit_multibyte_string (string_len
, nbytes
);
2117 for (beg
= SDATA (val
), p
= beg
, end
= beg
+ nbytes
; p
< end
; p
+= len
)
2119 /* First time we just copy `str' to the data of `val'. */
2121 memcpy (p
, str
, len
);
2124 /* Next time we copy largest possible chunk from
2125 initialized to uninitialized part of `val'. */
2126 len
= min (p
- beg
, end
- p
);
2127 memcpy (p
, beg
, len
);
2136 /* Fill A with 1 bits if INIT is non-nil, and with 0 bits otherwise.
2140 bool_vector_fill (Lisp_Object a
, Lisp_Object init
)
2142 EMACS_INT nbits
= bool_vector_size (a
);
2145 unsigned char *data
= bool_vector_uchar_data (a
);
2146 int pattern
= NILP (init
) ? 0 : (1 << BOOL_VECTOR_BITS_PER_CHAR
) - 1;
2147 ptrdiff_t nbytes
= bool_vector_bytes (nbits
);
2148 int last_mask
= ~ (~0u << ((nbits
- 1) % BOOL_VECTOR_BITS_PER_CHAR
+ 1));
2149 memset (data
, pattern
, nbytes
- 1);
2150 data
[nbytes
- 1] = pattern
& last_mask
;
2155 /* Return a newly allocated, uninitialized bool vector of size NBITS. */
2158 make_uninit_bool_vector (EMACS_INT nbits
)
2161 EMACS_INT words
= bool_vector_words (nbits
);
2162 EMACS_INT word_bytes
= words
* sizeof (bits_word
);
2163 EMACS_INT needed_elements
= ((bool_header_size
- header_size
+ word_bytes
2166 struct Lisp_Bool_Vector
*p
2167 = (struct Lisp_Bool_Vector
*) allocate_vector (needed_elements
);
2168 XSETVECTOR (val
, p
);
2169 XSETPVECTYPESIZE (XVECTOR (val
), PVEC_BOOL_VECTOR
, 0, 0);
2172 /* Clear padding at the end. */
2174 p
->data
[words
- 1] = 0;
2179 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2180 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2181 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2182 (Lisp_Object length
, Lisp_Object init
)
2186 CHECK_NATNUM (length
);
2187 val
= make_uninit_bool_vector (XFASTINT (length
));
2188 return bool_vector_fill (val
, init
);
2191 DEFUN ("bool-vector", Fbool_vector
, Sbool_vector
, 0, MANY
, 0,
2192 doc
: /* Return a new bool-vector with specified arguments as elements.
2193 Any number of arguments, even zero arguments, are allowed.
2194 usage: (bool-vector &rest OBJECTS) */)
2195 (ptrdiff_t nargs
, Lisp_Object
*args
)
2200 vector
= make_uninit_bool_vector (nargs
);
2201 for (i
= 0; i
< nargs
; i
++)
2202 bool_vector_set (vector
, i
, !NILP (args
[i
]));
2207 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2208 of characters from the contents. This string may be unibyte or
2209 multibyte, depending on the contents. */
2212 make_string (const char *contents
, ptrdiff_t nbytes
)
2214 register Lisp_Object val
;
2215 ptrdiff_t nchars
, multibyte_nbytes
;
2217 parse_str_as_multibyte ((const unsigned char *) contents
, nbytes
,
2218 &nchars
, &multibyte_nbytes
);
2219 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2220 /* CONTENTS contains no multibyte sequences or contains an invalid
2221 multibyte sequence. We must make unibyte string. */
2222 val
= make_unibyte_string (contents
, nbytes
);
2224 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2228 /* Make a unibyte string from LENGTH bytes at CONTENTS. */
2231 make_unibyte_string (const char *contents
, ptrdiff_t length
)
2233 register Lisp_Object val
;
2234 val
= make_uninit_string (length
);
2235 memcpy (SDATA (val
), contents
, length
);
2240 /* Make a multibyte string from NCHARS characters occupying NBYTES
2241 bytes at CONTENTS. */
2244 make_multibyte_string (const char *contents
,
2245 ptrdiff_t nchars
, ptrdiff_t nbytes
)
2247 register Lisp_Object val
;
2248 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2249 memcpy (SDATA (val
), contents
, nbytes
);
2254 /* Make a string from NCHARS characters occupying NBYTES bytes at
2255 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2258 make_string_from_bytes (const char *contents
,
2259 ptrdiff_t nchars
, ptrdiff_t nbytes
)
2261 register Lisp_Object val
;
2262 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2263 memcpy (SDATA (val
), contents
, nbytes
);
2264 if (SBYTES (val
) == SCHARS (val
))
2265 STRING_SET_UNIBYTE (val
);
2270 /* Make a string from NCHARS characters occupying NBYTES bytes at
2271 CONTENTS. The argument MULTIBYTE controls whether to label the
2272 string as multibyte. If NCHARS is negative, it counts the number of
2273 characters by itself. */
2276 make_specified_string (const char *contents
,
2277 ptrdiff_t nchars
, ptrdiff_t nbytes
, bool multibyte
)
2284 nchars
= multibyte_chars_in_text ((const unsigned char *) contents
,
2289 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2290 memcpy (SDATA (val
), contents
, nbytes
);
2292 STRING_SET_UNIBYTE (val
);
2297 /* Return a unibyte Lisp_String set up to hold LENGTH characters
2298 occupying LENGTH bytes. */
2301 make_uninit_string (EMACS_INT length
)
2306 return empty_unibyte_string
;
2307 val
= make_uninit_multibyte_string (length
, length
);
2308 STRING_SET_UNIBYTE (val
);
2313 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2314 which occupy NBYTES bytes. */
2317 make_uninit_multibyte_string (EMACS_INT nchars
, EMACS_INT nbytes
)
2320 struct Lisp_String
*s
;
2325 return empty_multibyte_string
;
2327 s
= allocate_string ();
2328 s
->intervals
= NULL
;
2329 allocate_string_data (s
, nchars
, nbytes
);
2330 XSETSTRING (string
, s
);
2331 string_chars_consed
+= nbytes
;
2335 /* Print arguments to BUF according to a FORMAT, then return
2336 a Lisp_String initialized with the data from BUF. */
2339 make_formatted_string (char *buf
, const char *format
, ...)
2344 va_start (ap
, format
);
2345 length
= vsprintf (buf
, format
, ap
);
2347 return make_string (buf
, length
);
2351 /***********************************************************************
2353 ***********************************************************************/
2355 /* We store float cells inside of float_blocks, allocating a new
2356 float_block with malloc whenever necessary. Float cells reclaimed
2357 by GC are put on a free list to be reallocated before allocating
2358 any new float cells from the latest float_block. */
2360 #define FLOAT_BLOCK_SIZE \
2361 (((BLOCK_BYTES - sizeof (struct float_block *) \
2362 /* The compiler might add padding at the end. */ \
2363 - (sizeof (struct Lisp_Float) - sizeof (bits_word))) * CHAR_BIT) \
2364 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2366 #define GETMARKBIT(block,n) \
2367 (((block)->gcmarkbits[(n) / BITS_PER_BITS_WORD] \
2368 >> ((n) % BITS_PER_BITS_WORD)) \
2371 #define SETMARKBIT(block,n) \
2372 ((block)->gcmarkbits[(n) / BITS_PER_BITS_WORD] \
2373 |= (bits_word) 1 << ((n) % BITS_PER_BITS_WORD))
2375 #define UNSETMARKBIT(block,n) \
2376 ((block)->gcmarkbits[(n) / BITS_PER_BITS_WORD] \
2377 &= ~((bits_word) 1 << ((n) % BITS_PER_BITS_WORD)))
2379 #define FLOAT_BLOCK(fptr) \
2380 ((struct float_block *) (((uintptr_t) (fptr)) & ~(BLOCK_ALIGN - 1)))
2382 #define FLOAT_INDEX(fptr) \
2383 ((((uintptr_t) (fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2387 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2388 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2389 bits_word gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ BITS_PER_BITS_WORD
];
2390 struct float_block
*next
;
2393 #define FLOAT_MARKED_P(fptr) \
2394 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2396 #define FLOAT_MARK(fptr) \
2397 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2399 #define FLOAT_UNMARK(fptr) \
2400 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2402 /* Current float_block. */
2404 static struct float_block
*float_block
;
2406 /* Index of first unused Lisp_Float in the current float_block. */
2408 static int float_block_index
= FLOAT_BLOCK_SIZE
;
2410 /* Free-list of Lisp_Floats. */
2412 static struct Lisp_Float
*float_free_list
;
2414 /* Return a new float object with value FLOAT_VALUE. */
2417 make_float (double float_value
)
2419 register Lisp_Object val
;
2423 if (float_free_list
)
2425 /* We use the data field for chaining the free list
2426 so that we won't use the same field that has the mark bit. */
2427 XSETFLOAT (val
, float_free_list
);
2428 float_free_list
= float_free_list
->u
.chain
;
2432 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2434 struct float_block
*new
2435 = lisp_align_malloc (sizeof *new, MEM_TYPE_FLOAT
);
2436 new->next
= float_block
;
2437 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2439 float_block_index
= 0;
2440 total_free_floats
+= FLOAT_BLOCK_SIZE
;
2442 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2443 float_block_index
++;
2446 MALLOC_UNBLOCK_INPUT
;
2448 XFLOAT_INIT (val
, float_value
);
2449 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2450 consing_since_gc
+= sizeof (struct Lisp_Float
);
2452 total_free_floats
--;
2458 /***********************************************************************
2460 ***********************************************************************/
2462 /* We store cons cells inside of cons_blocks, allocating a new
2463 cons_block with malloc whenever necessary. Cons cells reclaimed by
2464 GC are put on a free list to be reallocated before allocating
2465 any new cons cells from the latest cons_block. */
2467 #define CONS_BLOCK_SIZE \
2468 (((BLOCK_BYTES - sizeof (struct cons_block *) \
2469 /* The compiler might add padding at the end. */ \
2470 - (sizeof (struct Lisp_Cons) - sizeof (bits_word))) * CHAR_BIT) \
2471 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2473 #define CONS_BLOCK(fptr) \
2474 ((struct cons_block *) ((uintptr_t) (fptr) & ~(BLOCK_ALIGN - 1)))
2476 #define CONS_INDEX(fptr) \
2477 (((uintptr_t) (fptr) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2481 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2482 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2483 bits_word gcmarkbits
[1 + CONS_BLOCK_SIZE
/ BITS_PER_BITS_WORD
];
2484 struct cons_block
*next
;
2487 #define CONS_MARKED_P(fptr) \
2488 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2490 #define CONS_MARK(fptr) \
2491 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2493 #define CONS_UNMARK(fptr) \
2494 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2496 /* Current cons_block. */
2498 static struct cons_block
*cons_block
;
2500 /* Index of first unused Lisp_Cons in the current block. */
2502 static int cons_block_index
= CONS_BLOCK_SIZE
;
2504 /* Free-list of Lisp_Cons structures. */
2506 static struct Lisp_Cons
*cons_free_list
;
2508 /* Explicitly free a cons cell by putting it on the free-list. */
2511 free_cons (struct Lisp_Cons
*ptr
)
2513 ptr
->u
.chain
= cons_free_list
;
2517 cons_free_list
= ptr
;
2518 consing_since_gc
-= sizeof *ptr
;
2519 total_free_conses
++;
2522 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2523 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2524 (Lisp_Object car
, Lisp_Object cdr
)
2526 register Lisp_Object val
;
2532 /* We use the cdr for chaining the free list
2533 so that we won't use the same field that has the mark bit. */
2534 XSETCONS (val
, cons_free_list
);
2535 cons_free_list
= cons_free_list
->u
.chain
;
2539 if (cons_block_index
== CONS_BLOCK_SIZE
)
2541 struct cons_block
*new
2542 = lisp_align_malloc (sizeof *new, MEM_TYPE_CONS
);
2543 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2544 new->next
= cons_block
;
2546 cons_block_index
= 0;
2547 total_free_conses
+= CONS_BLOCK_SIZE
;
2549 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2553 MALLOC_UNBLOCK_INPUT
;
2557 eassert (!CONS_MARKED_P (XCONS (val
)));
2558 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2559 total_free_conses
--;
2560 cons_cells_consed
++;
2564 #ifdef GC_CHECK_CONS_LIST
2565 /* Get an error now if there's any junk in the cons free list. */
2567 check_cons_list (void)
2569 struct Lisp_Cons
*tail
= cons_free_list
;
2572 tail
= tail
->u
.chain
;
2576 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2579 list1 (Lisp_Object arg1
)
2581 return Fcons (arg1
, Qnil
);
2585 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2587 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2592 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2594 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2599 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2601 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2606 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2608 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2609 Fcons (arg5
, Qnil
)))));
2612 /* Make a list of COUNT Lisp_Objects, where ARG is the
2613 first one. Allocate conses from pure space if TYPE
2614 is CONSTYPE_PURE, or allocate as usual if type is CONSTYPE_HEAP. */
2617 listn (enum constype type
, ptrdiff_t count
, Lisp_Object arg
, ...)
2619 Lisp_Object (*cons
) (Lisp_Object
, Lisp_Object
);
2622 case CONSTYPE_PURE
: cons
= pure_cons
; break;
2623 case CONSTYPE_HEAP
: cons
= Fcons
; break;
2624 default: emacs_abort ();
2627 eassume (0 < count
);
2628 Lisp_Object val
= cons (arg
, Qnil
);
2629 Lisp_Object tail
= val
;
2633 for (ptrdiff_t i
= 1; i
< count
; i
++)
2635 Lisp_Object elem
= cons (va_arg (ap
, Lisp_Object
), Qnil
);
2636 XSETCDR (tail
, elem
);
2644 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2645 doc
: /* Return a newly created list with specified arguments as elements.
2646 Any number of arguments, even zero arguments, are allowed.
2647 usage: (list &rest OBJECTS) */)
2648 (ptrdiff_t nargs
, Lisp_Object
*args
)
2650 register Lisp_Object val
;
2656 val
= Fcons (args
[nargs
], val
);
2662 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2663 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2664 (register Lisp_Object length
, Lisp_Object init
)
2666 register Lisp_Object val
;
2667 register EMACS_INT size
;
2669 CHECK_NATNUM (length
);
2670 size
= XFASTINT (length
);
2675 val
= Fcons (init
, val
);
2680 val
= Fcons (init
, val
);
2685 val
= Fcons (init
, val
);
2690 val
= Fcons (init
, val
);
2695 val
= Fcons (init
, val
);
2710 /***********************************************************************
2712 ***********************************************************************/
2714 /* Sometimes a vector's contents are merely a pointer internally used
2715 in vector allocation code. On the rare platforms where a null
2716 pointer cannot be tagged, represent it with a Lisp 0.
2717 Usually you don't want to touch this. */
2719 static struct Lisp_Vector
*
2720 next_vector (struct Lisp_Vector
*v
)
2722 return XUNTAG (v
->contents
[0], 0);
2726 set_next_vector (struct Lisp_Vector
*v
, struct Lisp_Vector
*p
)
2728 v
->contents
[0] = make_lisp_ptr (p
, 0);
2731 /* This value is balanced well enough to avoid too much internal overhead
2732 for the most common cases; it's not required to be a power of two, but
2733 it's expected to be a mult-of-ROUNDUP_SIZE (see below). */
2735 #define VECTOR_BLOCK_SIZE 4096
2739 /* Alignment of struct Lisp_Vector objects. */
2740 vector_alignment
= COMMON_MULTIPLE (ALIGNOF_STRUCT_LISP_VECTOR
,
2741 USE_LSB_TAG
? GCALIGNMENT
: 1),
2743 /* Vector size requests are a multiple of this. */
2744 roundup_size
= COMMON_MULTIPLE (vector_alignment
, word_size
)
2747 /* Verify assumptions described above. */
2748 verify ((VECTOR_BLOCK_SIZE
% roundup_size
) == 0);
2749 verify (VECTOR_BLOCK_SIZE
<= (1 << PSEUDOVECTOR_SIZE_BITS
));
2751 /* Round up X to nearest mult-of-ROUNDUP_SIZE --- use at compile time. */
2752 #define vroundup_ct(x) ROUNDUP (x, roundup_size)
2753 /* Round up X to nearest mult-of-ROUNDUP_SIZE --- use at runtime. */
2754 #define vroundup(x) (eassume ((x) >= 0), vroundup_ct (x))
2756 /* Rounding helps to maintain alignment constraints if USE_LSB_TAG. */
2758 #define VECTOR_BLOCK_BYTES (VECTOR_BLOCK_SIZE - vroundup_ct (sizeof (void *)))
2760 /* Size of the minimal vector allocated from block. */
2762 #define VBLOCK_BYTES_MIN vroundup_ct (header_size + sizeof (Lisp_Object))
2764 /* Size of the largest vector allocated from block. */
2766 #define VBLOCK_BYTES_MAX \
2767 vroundup ((VECTOR_BLOCK_BYTES / 2) - word_size)
2769 /* We maintain one free list for each possible block-allocated
2770 vector size, and this is the number of free lists we have. */
2772 #define VECTOR_MAX_FREE_LIST_INDEX \
2773 ((VECTOR_BLOCK_BYTES - VBLOCK_BYTES_MIN) / roundup_size + 1)
2775 /* Common shortcut to advance vector pointer over a block data. */
2777 #define ADVANCE(v, nbytes) ((struct Lisp_Vector *) ((char *) (v) + (nbytes)))
2779 /* Common shortcut to calculate NBYTES-vector index in VECTOR_FREE_LISTS. */
2781 #define VINDEX(nbytes) (((nbytes) - VBLOCK_BYTES_MIN) / roundup_size)
2783 /* Common shortcut to setup vector on a free list. */
2785 #define SETUP_ON_FREE_LIST(v, nbytes, tmp) \
2787 (tmp) = ((nbytes - header_size) / word_size); \
2788 XSETPVECTYPESIZE (v, PVEC_FREE, 0, (tmp)); \
2789 eassert ((nbytes) % roundup_size == 0); \
2790 (tmp) = VINDEX (nbytes); \
2791 eassert ((tmp) < VECTOR_MAX_FREE_LIST_INDEX); \
2792 set_next_vector (v, vector_free_lists[tmp]); \
2793 vector_free_lists[tmp] = (v); \
2794 total_free_vector_slots += (nbytes) / word_size; \
2797 /* This internal type is used to maintain the list of large vectors
2798 which are allocated at their own, e.g. outside of vector blocks.
2800 struct large_vector itself cannot contain a struct Lisp_Vector, as
2801 the latter contains a flexible array member and C99 does not allow
2802 such structs to be nested. Instead, each struct large_vector
2803 object LV is followed by a struct Lisp_Vector, which is at offset
2804 large_vector_offset from LV, and whose address is therefore
2805 large_vector_vec (&LV). */
2809 struct large_vector
*next
;
2814 large_vector_offset
= ROUNDUP (sizeof (struct large_vector
), vector_alignment
)
2817 static struct Lisp_Vector
*
2818 large_vector_vec (struct large_vector
*p
)
2820 return (struct Lisp_Vector
*) ((char *) p
+ large_vector_offset
);
2823 /* This internal type is used to maintain an underlying storage
2824 for small vectors. */
2828 char data
[VECTOR_BLOCK_BYTES
];
2829 struct vector_block
*next
;
2832 /* Chain of vector blocks. */
2834 static struct vector_block
*vector_blocks
;
2836 /* Vector free lists, where NTH item points to a chain of free
2837 vectors of the same NBYTES size, so NTH == VINDEX (NBYTES). */
2839 static struct Lisp_Vector
*vector_free_lists
[VECTOR_MAX_FREE_LIST_INDEX
];
2841 /* Singly-linked list of large vectors. */
2843 static struct large_vector
*large_vectors
;
2845 /* The only vector with 0 slots, allocated from pure space. */
2847 Lisp_Object zero_vector
;
2849 /* Number of live vectors. */
2851 static EMACS_INT total_vectors
;
2853 /* Total size of live and free vectors, in Lisp_Object units. */
2855 static EMACS_INT total_vector_slots
, total_free_vector_slots
;
2857 /* Get a new vector block. */
2859 static struct vector_block
*
2860 allocate_vector_block (void)
2862 struct vector_block
*block
= xmalloc (sizeof *block
);
2864 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
2865 mem_insert (block
->data
, block
->data
+ VECTOR_BLOCK_BYTES
,
2866 MEM_TYPE_VECTOR_BLOCK
);
2869 block
->next
= vector_blocks
;
2870 vector_blocks
= block
;
2874 /* Called once to initialize vector allocation. */
2879 zero_vector
= make_pure_vector (0);
2882 /* Allocate vector from a vector block. */
2884 static struct Lisp_Vector
*
2885 allocate_vector_from_block (size_t nbytes
)
2887 struct Lisp_Vector
*vector
;
2888 struct vector_block
*block
;
2889 size_t index
, restbytes
;
2891 eassert (VBLOCK_BYTES_MIN
<= nbytes
&& nbytes
<= VBLOCK_BYTES_MAX
);
2892 eassert (nbytes
% roundup_size
== 0);
2894 /* First, try to allocate from a free list
2895 containing vectors of the requested size. */
2896 index
= VINDEX (nbytes
);
2897 if (vector_free_lists
[index
])
2899 vector
= vector_free_lists
[index
];
2900 vector_free_lists
[index
] = next_vector (vector
);
2901 total_free_vector_slots
-= nbytes
/ word_size
;
2905 /* Next, check free lists containing larger vectors. Since
2906 we will split the result, we should have remaining space
2907 large enough to use for one-slot vector at least. */
2908 for (index
= VINDEX (nbytes
+ VBLOCK_BYTES_MIN
);
2909 index
< VECTOR_MAX_FREE_LIST_INDEX
; index
++)
2910 if (vector_free_lists
[index
])
2912 /* This vector is larger than requested. */
2913 vector
= vector_free_lists
[index
];
2914 vector_free_lists
[index
] = next_vector (vector
);
2915 total_free_vector_slots
-= nbytes
/ word_size
;
2917 /* Excess bytes are used for the smaller vector,
2918 which should be set on an appropriate free list. */
2919 restbytes
= index
* roundup_size
+ VBLOCK_BYTES_MIN
- nbytes
;
2920 eassert (restbytes
% roundup_size
== 0);
2921 SETUP_ON_FREE_LIST (ADVANCE (vector
, nbytes
), restbytes
, index
);
2925 /* Finally, need a new vector block. */
2926 block
= allocate_vector_block ();
2928 /* New vector will be at the beginning of this block. */
2929 vector
= (struct Lisp_Vector
*) block
->data
;
2931 /* If the rest of space from this block is large enough
2932 for one-slot vector at least, set up it on a free list. */
2933 restbytes
= VECTOR_BLOCK_BYTES
- nbytes
;
2934 if (restbytes
>= VBLOCK_BYTES_MIN
)
2936 eassert (restbytes
% roundup_size
== 0);
2937 SETUP_ON_FREE_LIST (ADVANCE (vector
, nbytes
), restbytes
, index
);
2942 /* Nonzero if VECTOR pointer is valid pointer inside BLOCK. */
2944 #define VECTOR_IN_BLOCK(vector, block) \
2945 ((char *) (vector) <= (block)->data \
2946 + VECTOR_BLOCK_BYTES - VBLOCK_BYTES_MIN)
2948 /* Return the memory footprint of V in bytes. */
2951 vector_nbytes (struct Lisp_Vector
*v
)
2953 ptrdiff_t size
= v
->header
.size
& ~ARRAY_MARK_FLAG
;
2956 if (size
& PSEUDOVECTOR_FLAG
)
2958 if (PSEUDOVECTOR_TYPEP (&v
->header
, PVEC_BOOL_VECTOR
))
2960 struct Lisp_Bool_Vector
*bv
= (struct Lisp_Bool_Vector
*) v
;
2961 ptrdiff_t word_bytes
= (bool_vector_words (bv
->size
)
2962 * sizeof (bits_word
));
2963 ptrdiff_t boolvec_bytes
= bool_header_size
+ word_bytes
;
2964 verify (header_size
<= bool_header_size
);
2965 nwords
= (boolvec_bytes
- header_size
+ word_size
- 1) / word_size
;
2968 nwords
= ((size
& PSEUDOVECTOR_SIZE_MASK
)
2969 + ((size
& PSEUDOVECTOR_REST_MASK
)
2970 >> PSEUDOVECTOR_SIZE_BITS
));
2974 return vroundup (header_size
+ word_size
* nwords
);
2977 /* Release extra resources still in use by VECTOR, which may be any
2978 vector-like object. For now, this is used just to free data in
2982 cleanup_vector (struct Lisp_Vector
*vector
)
2984 detect_suspicious_free (vector
);
2985 if (PSEUDOVECTOR_TYPEP (&vector
->header
, PVEC_FONT
)
2986 && ((vector
->header
.size
& PSEUDOVECTOR_SIZE_MASK
)
2987 == FONT_OBJECT_MAX
))
2989 struct font_driver
*drv
= ((struct font
*) vector
)->driver
;
2991 /* The font driver might sometimes be NULL, e.g. if Emacs was
2992 interrupted before it had time to set it up. */
2995 /* Attempt to catch subtle bugs like Bug#16140. */
2996 eassert (valid_font_driver (drv
));
2997 drv
->close ((struct font
*) vector
);
3002 /* Reclaim space used by unmarked vectors. */
3004 NO_INLINE
/* For better stack traces */
3006 sweep_vectors (void)
3008 struct vector_block
*block
, **bprev
= &vector_blocks
;
3009 struct large_vector
*lv
, **lvprev
= &large_vectors
;
3010 struct Lisp_Vector
*vector
, *next
;
3012 total_vectors
= total_vector_slots
= total_free_vector_slots
= 0;
3013 memset (vector_free_lists
, 0, sizeof (vector_free_lists
));
3015 /* Looking through vector blocks. */
3017 for (block
= vector_blocks
; block
; block
= *bprev
)
3019 bool free_this_block
= 0;
3022 for (vector
= (struct Lisp_Vector
*) block
->data
;
3023 VECTOR_IN_BLOCK (vector
, block
); vector
= next
)
3025 if (VECTOR_MARKED_P (vector
))
3027 VECTOR_UNMARK (vector
);
3029 nbytes
= vector_nbytes (vector
);
3030 total_vector_slots
+= nbytes
/ word_size
;
3031 next
= ADVANCE (vector
, nbytes
);
3035 ptrdiff_t total_bytes
;
3037 cleanup_vector (vector
);
3038 nbytes
= vector_nbytes (vector
);
3039 total_bytes
= nbytes
;
3040 next
= ADVANCE (vector
, nbytes
);
3042 /* While NEXT is not marked, try to coalesce with VECTOR,
3043 thus making VECTOR of the largest possible size. */
3045 while (VECTOR_IN_BLOCK (next
, block
))
3047 if (VECTOR_MARKED_P (next
))
3049 cleanup_vector (next
);
3050 nbytes
= vector_nbytes (next
);
3051 total_bytes
+= nbytes
;
3052 next
= ADVANCE (next
, nbytes
);
3055 eassert (total_bytes
% roundup_size
== 0);
3057 if (vector
== (struct Lisp_Vector
*) block
->data
3058 && !VECTOR_IN_BLOCK (next
, block
))
3059 /* This block should be freed because all of its
3060 space was coalesced into the only free vector. */
3061 free_this_block
= 1;
3065 SETUP_ON_FREE_LIST (vector
, total_bytes
, tmp
);
3070 if (free_this_block
)
3072 *bprev
= block
->next
;
3073 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
3074 mem_delete (mem_find (block
->data
));
3079 bprev
= &block
->next
;
3082 /* Sweep large vectors. */
3084 for (lv
= large_vectors
; lv
; lv
= *lvprev
)
3086 vector
= large_vector_vec (lv
);
3087 if (VECTOR_MARKED_P (vector
))
3089 VECTOR_UNMARK (vector
);
3091 if (vector
->header
.size
& PSEUDOVECTOR_FLAG
)
3093 /* All non-bool pseudovectors are small enough to be allocated
3094 from vector blocks. This code should be redesigned if some
3095 pseudovector type grows beyond VBLOCK_BYTES_MAX. */
3096 eassert (PSEUDOVECTOR_TYPEP (&vector
->header
, PVEC_BOOL_VECTOR
));
3097 total_vector_slots
+= vector_nbytes (vector
) / word_size
;
3101 += header_size
/ word_size
+ vector
->header
.size
;
3112 /* Value is a pointer to a newly allocated Lisp_Vector structure
3113 with room for LEN Lisp_Objects. */
3115 static struct Lisp_Vector
*
3116 allocate_vectorlike (ptrdiff_t len
)
3118 struct Lisp_Vector
*p
;
3123 p
= XVECTOR (zero_vector
);
3126 size_t nbytes
= header_size
+ len
* word_size
;
3128 #ifdef DOUG_LEA_MALLOC
3129 if (!mmap_lisp_allowed_p ())
3130 mallopt (M_MMAP_MAX
, 0);
3133 if (nbytes
<= VBLOCK_BYTES_MAX
)
3134 p
= allocate_vector_from_block (vroundup (nbytes
));
3137 struct large_vector
*lv
3138 = lisp_malloc ((large_vector_offset
+ header_size
3140 MEM_TYPE_VECTORLIKE
);
3141 lv
->next
= large_vectors
;
3143 p
= large_vector_vec (lv
);
3146 #ifdef DOUG_LEA_MALLOC
3147 if (!mmap_lisp_allowed_p ())
3148 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
3151 if (find_suspicious_object_in_range (p
, (char *) p
+ nbytes
))
3154 consing_since_gc
+= nbytes
;
3155 vector_cells_consed
+= len
;
3158 MALLOC_UNBLOCK_INPUT
;
3164 /* Allocate a vector with LEN slots. */
3166 struct Lisp_Vector
*
3167 allocate_vector (EMACS_INT len
)
3169 struct Lisp_Vector
*v
;
3170 ptrdiff_t nbytes_max
= min (PTRDIFF_MAX
, SIZE_MAX
);
3172 if (min ((nbytes_max
- header_size
) / word_size
, MOST_POSITIVE_FIXNUM
) < len
)
3173 memory_full (SIZE_MAX
);
3174 v
= allocate_vectorlike (len
);
3175 v
->header
.size
= len
;
3180 /* Allocate other vector-like structures. */
3182 struct Lisp_Vector
*
3183 allocate_pseudovector (int memlen
, int lisplen
, enum pvec_type tag
)
3185 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
3188 /* Catch bogus values. */
3189 eassert (tag
<= PVEC_FONT
);
3190 eassert (memlen
- lisplen
<= (1 << PSEUDOVECTOR_REST_BITS
) - 1);
3191 eassert (lisplen
<= (1 << PSEUDOVECTOR_SIZE_BITS
) - 1);
3193 /* Only the first lisplen slots will be traced normally by the GC. */
3194 for (i
= 0; i
< lisplen
; ++i
)
3195 v
->contents
[i
] = Qnil
;
3197 XSETPVECTYPESIZE (v
, tag
, lisplen
, memlen
- lisplen
);
3202 allocate_buffer (void)
3204 struct buffer
*b
= lisp_malloc (sizeof *b
, MEM_TYPE_BUFFER
);
3206 BUFFER_PVEC_INIT (b
);
3207 /* Put B on the chain of all buffers including killed ones. */
3208 b
->next
= all_buffers
;
3210 /* Note that the rest fields of B are not initialized. */
3214 struct Lisp_Hash_Table
*
3215 allocate_hash_table (void)
3217 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
3221 allocate_window (void)
3225 w
= ALLOCATE_PSEUDOVECTOR (struct window
, current_matrix
, PVEC_WINDOW
);
3226 /* Users assumes that non-Lisp data is zeroed. */
3227 memset (&w
->current_matrix
, 0,
3228 sizeof (*w
) - offsetof (struct window
, current_matrix
));
3233 allocate_terminal (void)
3237 t
= ALLOCATE_PSEUDOVECTOR (struct terminal
, next_terminal
, PVEC_TERMINAL
);
3238 /* Users assumes that non-Lisp data is zeroed. */
3239 memset (&t
->next_terminal
, 0,
3240 sizeof (*t
) - offsetof (struct terminal
, next_terminal
));
3245 allocate_frame (void)
3249 f
= ALLOCATE_PSEUDOVECTOR (struct frame
, face_cache
, PVEC_FRAME
);
3250 /* Users assumes that non-Lisp data is zeroed. */
3251 memset (&f
->face_cache
, 0,
3252 sizeof (*f
) - offsetof (struct frame
, face_cache
));
3256 struct Lisp_Process
*
3257 allocate_process (void)
3259 struct Lisp_Process
*p
;
3261 p
= ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
3262 /* Users assumes that non-Lisp data is zeroed. */
3264 sizeof (*p
) - offsetof (struct Lisp_Process
, pid
));
3268 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3269 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3270 See also the function `vector'. */)
3271 (register Lisp_Object length
, Lisp_Object init
)
3274 register ptrdiff_t sizei
;
3275 register ptrdiff_t i
;
3276 register struct Lisp_Vector
*p
;
3278 CHECK_NATNUM (length
);
3280 p
= allocate_vector (XFASTINT (length
));
3281 sizei
= XFASTINT (length
);
3282 for (i
= 0; i
< sizei
; i
++)
3283 p
->contents
[i
] = init
;
3285 XSETVECTOR (vector
, p
);
3289 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3290 doc
: /* Return a newly created vector with specified arguments as elements.
3291 Any number of arguments, even zero arguments, are allowed.
3292 usage: (vector &rest OBJECTS) */)
3293 (ptrdiff_t nargs
, Lisp_Object
*args
)
3296 register Lisp_Object val
= make_uninit_vector (nargs
);
3297 register struct Lisp_Vector
*p
= XVECTOR (val
);
3299 for (i
= 0; i
< nargs
; i
++)
3300 p
->contents
[i
] = args
[i
];
3305 make_byte_code (struct Lisp_Vector
*v
)
3307 /* Don't allow the global zero_vector to become a byte code object. */
3308 eassert (0 < v
->header
.size
);
3310 if (v
->header
.size
> 1 && STRINGP (v
->contents
[1])
3311 && STRING_MULTIBYTE (v
->contents
[1]))
3312 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3313 earlier because they produced a raw 8-bit string for byte-code
3314 and now such a byte-code string is loaded as multibyte while
3315 raw 8-bit characters converted to multibyte form. Thus, now we
3316 must convert them back to the original unibyte form. */
3317 v
->contents
[1] = Fstring_as_unibyte (v
->contents
[1]);
3318 XSETPVECTYPE (v
, PVEC_COMPILED
);
3321 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3322 doc
: /* Create a byte-code object with specified arguments as elements.
3323 The arguments should be the ARGLIST, bytecode-string BYTE-CODE, constant
3324 vector CONSTANTS, maximum stack size DEPTH, (optional) DOCSTRING,
3325 and (optional) INTERACTIVE-SPEC.
3326 The first four arguments are required; at most six have any
3328 The ARGLIST can be either like the one of `lambda', in which case the arguments
3329 will be dynamically bound before executing the byte code, or it can be an
3330 integer of the form NNNNNNNRMMMMMMM where the 7bit MMMMMMM specifies the
3331 minimum number of arguments, the 7-bit NNNNNNN specifies the maximum number
3332 of arguments (ignoring &rest) and the R bit specifies whether there is a &rest
3333 argument to catch the left-over arguments. If such an integer is used, the
3334 arguments will not be dynamically bound but will be instead pushed on the
3335 stack before executing the byte-code.
3336 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3337 (ptrdiff_t nargs
, Lisp_Object
*args
)
3340 register Lisp_Object val
= make_uninit_vector (nargs
);
3341 register struct Lisp_Vector
*p
= XVECTOR (val
);
3343 /* We used to purecopy everything here, if purify-flag was set. This worked
3344 OK for Emacs-23, but with Emacs-24's lexical binding code, it can be
3345 dangerous, since make-byte-code is used during execution to build
3346 closures, so any closure built during the preload phase would end up
3347 copied into pure space, including its free variables, which is sometimes
3348 just wasteful and other times plainly wrong (e.g. those free vars may want
3351 for (i
= 0; i
< nargs
; i
++)
3352 p
->contents
[i
] = args
[i
];
3354 XSETCOMPILED (val
, p
);
3360 /***********************************************************************
3362 ***********************************************************************/
3364 /* Like struct Lisp_Symbol, but padded so that the size is a multiple
3365 of the required alignment if LSB tags are used. */
3367 union aligned_Lisp_Symbol
3369 struct Lisp_Symbol s
;
3371 unsigned char c
[(sizeof (struct Lisp_Symbol
) + GCALIGNMENT
- 1)
3376 /* Each symbol_block is just under 1020 bytes long, since malloc
3377 really allocates in units of powers of two and uses 4 bytes for its
3380 #define SYMBOL_BLOCK_SIZE \
3381 ((1020 - sizeof (struct symbol_block *)) / sizeof (union aligned_Lisp_Symbol))
3385 /* Place `symbols' first, to preserve alignment. */
3386 union aligned_Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3387 struct symbol_block
*next
;
3390 /* Current symbol block and index of first unused Lisp_Symbol
3393 static struct symbol_block
*symbol_block
;
3394 static int symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3395 /* Pointer to the first symbol_block that contains pinned symbols.
3396 Tests for 24.4 showed that at dump-time, Emacs contains about 15K symbols,
3397 10K of which are pinned (and all but 250 of them are interned in obarray),
3398 whereas a "typical session" has in the order of 30K symbols.
3399 `symbol_block_pinned' lets mark_pinned_symbols scan only 15K symbols rather
3400 than 30K to find the 10K symbols we need to mark. */
3401 static struct symbol_block
*symbol_block_pinned
;
3403 /* List of free symbols. */
3405 static struct Lisp_Symbol
*symbol_free_list
;
3408 set_symbol_name (Lisp_Object sym
, Lisp_Object name
)
3410 XSYMBOL (sym
)->name
= name
;
3413 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3414 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3415 Its value is void, and its function definition and property list are nil. */)
3418 register Lisp_Object val
;
3419 register struct Lisp_Symbol
*p
;
3421 CHECK_STRING (name
);
3425 if (symbol_free_list
)
3427 XSETSYMBOL (val
, symbol_free_list
);
3428 symbol_free_list
= symbol_free_list
->next
;
3432 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3434 struct symbol_block
*new
3435 = lisp_malloc (sizeof *new, MEM_TYPE_SYMBOL
);
3436 new->next
= symbol_block
;
3438 symbol_block_index
= 0;
3439 total_free_symbols
+= SYMBOL_BLOCK_SIZE
;
3441 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
].s
);
3442 symbol_block_index
++;
3445 MALLOC_UNBLOCK_INPUT
;
3448 set_symbol_name (val
, name
);
3449 set_symbol_plist (val
, Qnil
);
3450 p
->redirect
= SYMBOL_PLAINVAL
;
3451 SET_SYMBOL_VAL (p
, Qunbound
);
3452 set_symbol_function (val
, Qnil
);
3453 set_symbol_next (val
, NULL
);
3454 p
->gcmarkbit
= false;
3455 p
->interned
= SYMBOL_UNINTERNED
;
3457 p
->declared_special
= false;
3459 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3461 total_free_symbols
--;
3467 /***********************************************************************
3468 Marker (Misc) Allocation
3469 ***********************************************************************/
3471 /* Like union Lisp_Misc, but padded so that its size is a multiple of
3472 the required alignment when LSB tags are used. */
3474 union aligned_Lisp_Misc
3478 unsigned char c
[(sizeof (union Lisp_Misc
) + GCALIGNMENT
- 1)
3483 /* Allocation of markers and other objects that share that structure.
3484 Works like allocation of conses. */
3486 #define MARKER_BLOCK_SIZE \
3487 ((1020 - sizeof (struct marker_block *)) / sizeof (union aligned_Lisp_Misc))
3491 /* Place `markers' first, to preserve alignment. */
3492 union aligned_Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3493 struct marker_block
*next
;
3496 static struct marker_block
*marker_block
;
3497 static int marker_block_index
= MARKER_BLOCK_SIZE
;
3499 static union Lisp_Misc
*marker_free_list
;
3501 /* Return a newly allocated Lisp_Misc object of specified TYPE. */
3504 allocate_misc (enum Lisp_Misc_Type type
)
3510 if (marker_free_list
)
3512 XSETMISC (val
, marker_free_list
);
3513 marker_free_list
= marker_free_list
->u_free
.chain
;
3517 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3519 struct marker_block
*new = lisp_malloc (sizeof *new, MEM_TYPE_MISC
);
3520 new->next
= marker_block
;
3522 marker_block_index
= 0;
3523 total_free_markers
+= MARKER_BLOCK_SIZE
;
3525 XSETMISC (val
, &marker_block
->markers
[marker_block_index
].m
);
3526 marker_block_index
++;
3529 MALLOC_UNBLOCK_INPUT
;
3531 --total_free_markers
;
3532 consing_since_gc
+= sizeof (union Lisp_Misc
);
3533 misc_objects_consed
++;
3534 XMISCANY (val
)->type
= type
;
3535 XMISCANY (val
)->gcmarkbit
= 0;
3539 /* Free a Lisp_Misc object. */
3542 free_misc (Lisp_Object misc
)
3544 XMISCANY (misc
)->type
= Lisp_Misc_Free
;
3545 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3546 marker_free_list
= XMISC (misc
);
3547 consing_since_gc
-= sizeof (union Lisp_Misc
);
3548 total_free_markers
++;
3551 /* Verify properties of Lisp_Save_Value's representation
3552 that are assumed here and elsewhere. */
3554 verify (SAVE_UNUSED
== 0);
3555 verify (((SAVE_INTEGER
| SAVE_POINTER
| SAVE_FUNCPOINTER
| SAVE_OBJECT
)
3559 /* Return Lisp_Save_Value objects for the various combinations
3560 that callers need. */
3563 make_save_int_int_int (ptrdiff_t a
, ptrdiff_t b
, ptrdiff_t c
)
3565 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3566 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3567 p
->save_type
= SAVE_TYPE_INT_INT_INT
;
3568 p
->data
[0].integer
= a
;
3569 p
->data
[1].integer
= b
;
3570 p
->data
[2].integer
= c
;
3575 make_save_obj_obj_obj_obj (Lisp_Object a
, Lisp_Object b
, Lisp_Object c
,
3578 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3579 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3580 p
->save_type
= SAVE_TYPE_OBJ_OBJ_OBJ_OBJ
;
3581 p
->data
[0].object
= a
;
3582 p
->data
[1].object
= b
;
3583 p
->data
[2].object
= c
;
3584 p
->data
[3].object
= d
;
3589 make_save_ptr (void *a
)
3591 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3592 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3593 p
->save_type
= SAVE_POINTER
;
3594 p
->data
[0].pointer
= a
;
3599 make_save_ptr_int (void *a
, ptrdiff_t b
)
3601 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3602 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3603 p
->save_type
= SAVE_TYPE_PTR_INT
;
3604 p
->data
[0].pointer
= a
;
3605 p
->data
[1].integer
= b
;
3609 #if ! (defined USE_X_TOOLKIT || defined USE_GTK)
3611 make_save_ptr_ptr (void *a
, void *b
)
3613 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3614 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3615 p
->save_type
= SAVE_TYPE_PTR_PTR
;
3616 p
->data
[0].pointer
= a
;
3617 p
->data
[1].pointer
= b
;
3623 make_save_funcptr_ptr_obj (void (*a
) (void), void *b
, Lisp_Object c
)
3625 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3626 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3627 p
->save_type
= SAVE_TYPE_FUNCPTR_PTR_OBJ
;
3628 p
->data
[0].funcpointer
= a
;
3629 p
->data
[1].pointer
= b
;
3630 p
->data
[2].object
= c
;
3634 /* Return a Lisp_Save_Value object that represents an array A
3635 of N Lisp objects. */
3638 make_save_memory (Lisp_Object
*a
, ptrdiff_t n
)
3640 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3641 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3642 p
->save_type
= SAVE_TYPE_MEMORY
;
3643 p
->data
[0].pointer
= a
;
3644 p
->data
[1].integer
= n
;
3648 /* Free a Lisp_Save_Value object. Do not use this function
3649 if SAVE contains pointer other than returned by xmalloc. */
3652 free_save_value (Lisp_Object save
)
3654 xfree (XSAVE_POINTER (save
, 0));
3658 /* Return a Lisp_Misc_Overlay object with specified START, END and PLIST. */
3661 build_overlay (Lisp_Object start
, Lisp_Object end
, Lisp_Object plist
)
3663 register Lisp_Object overlay
;
3665 overlay
= allocate_misc (Lisp_Misc_Overlay
);
3666 OVERLAY_START (overlay
) = start
;
3667 OVERLAY_END (overlay
) = end
;
3668 set_overlay_plist (overlay
, plist
);
3669 XOVERLAY (overlay
)->next
= NULL
;
3673 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3674 doc
: /* Return a newly allocated marker which does not point at any place. */)
3677 register Lisp_Object val
;
3678 register struct Lisp_Marker
*p
;
3680 val
= allocate_misc (Lisp_Misc_Marker
);
3686 p
->insertion_type
= 0;
3687 p
->need_adjustment
= 0;
3691 /* Return a newly allocated marker which points into BUF
3692 at character position CHARPOS and byte position BYTEPOS. */
3695 build_marker (struct buffer
*buf
, ptrdiff_t charpos
, ptrdiff_t bytepos
)
3698 struct Lisp_Marker
*m
;
3700 /* No dead buffers here. */
3701 eassert (BUFFER_LIVE_P (buf
));
3703 /* Every character is at least one byte. */
3704 eassert (charpos
<= bytepos
);
3706 obj
= allocate_misc (Lisp_Misc_Marker
);
3709 m
->charpos
= charpos
;
3710 m
->bytepos
= bytepos
;
3711 m
->insertion_type
= 0;
3712 m
->need_adjustment
= 0;
3713 m
->next
= BUF_MARKERS (buf
);
3714 BUF_MARKERS (buf
) = m
;
3718 /* Put MARKER back on the free list after using it temporarily. */
3721 free_marker (Lisp_Object marker
)
3723 unchain_marker (XMARKER (marker
));
3728 /* Return a newly created vector or string with specified arguments as
3729 elements. If all the arguments are characters that can fit
3730 in a string of events, make a string; otherwise, make a vector.
3732 Any number of arguments, even zero arguments, are allowed. */
3735 make_event_array (ptrdiff_t nargs
, Lisp_Object
*args
)
3739 for (i
= 0; i
< nargs
; i
++)
3740 /* The things that fit in a string
3741 are characters that are in 0...127,
3742 after discarding the meta bit and all the bits above it. */
3743 if (!INTEGERP (args
[i
])
3744 || (XINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3745 return Fvector (nargs
, args
);
3747 /* Since the loop exited, we know that all the things in it are
3748 characters, so we can make a string. */
3752 result
= Fmake_string (make_number (nargs
), make_number (0));
3753 for (i
= 0; i
< nargs
; i
++)
3755 SSET (result
, i
, XINT (args
[i
]));
3756 /* Move the meta bit to the right place for a string char. */
3757 if (XINT (args
[i
]) & CHAR_META
)
3758 SSET (result
, i
, SREF (result
, i
) | 0x80);
3767 /************************************************************************
3768 Memory Full Handling
3769 ************************************************************************/
3772 /* Called if malloc (NBYTES) returns zero. If NBYTES == SIZE_MAX,
3773 there may have been size_t overflow so that malloc was never
3774 called, or perhaps malloc was invoked successfully but the
3775 resulting pointer had problems fitting into a tagged EMACS_INT. In
3776 either case this counts as memory being full even though malloc did
3780 memory_full (size_t nbytes
)
3782 /* Do not go into hysterics merely because a large request failed. */
3783 bool enough_free_memory
= 0;
3784 if (SPARE_MEMORY
< nbytes
)
3789 p
= malloc (SPARE_MEMORY
);
3793 enough_free_memory
= 1;
3795 MALLOC_UNBLOCK_INPUT
;
3798 if (! enough_free_memory
)
3804 memory_full_cons_threshold
= sizeof (struct cons_block
);
3806 /* The first time we get here, free the spare memory. */
3807 for (i
= 0; i
< ARRAYELTS (spare_memory
); i
++)
3808 if (spare_memory
[i
])
3811 free (spare_memory
[i
]);
3812 else if (i
>= 1 && i
<= 4)
3813 lisp_align_free (spare_memory
[i
]);
3815 lisp_free (spare_memory
[i
]);
3816 spare_memory
[i
] = 0;
3820 /* This used to call error, but if we've run out of memory, we could
3821 get infinite recursion trying to build the string. */
3822 xsignal (Qnil
, Vmemory_signal_data
);
3825 /* If we released our reserve (due to running out of memory),
3826 and we have a fair amount free once again,
3827 try to set aside another reserve in case we run out once more.
3829 This is called when a relocatable block is freed in ralloc.c,
3830 and also directly from this file, in case we're not using ralloc.c. */
3833 refill_memory_reserve (void)
3835 #if !defined SYSTEM_MALLOC && !defined HYBRID_MALLOC
3836 if (spare_memory
[0] == 0)
3837 spare_memory
[0] = malloc (SPARE_MEMORY
);
3838 if (spare_memory
[1] == 0)
3839 spare_memory
[1] = lisp_align_malloc (sizeof (struct cons_block
),
3841 if (spare_memory
[2] == 0)
3842 spare_memory
[2] = lisp_align_malloc (sizeof (struct cons_block
),
3844 if (spare_memory
[3] == 0)
3845 spare_memory
[3] = lisp_align_malloc (sizeof (struct cons_block
),
3847 if (spare_memory
[4] == 0)
3848 spare_memory
[4] = lisp_align_malloc (sizeof (struct cons_block
),
3850 if (spare_memory
[5] == 0)
3851 spare_memory
[5] = lisp_malloc (sizeof (struct string_block
),
3853 if (spare_memory
[6] == 0)
3854 spare_memory
[6] = lisp_malloc (sizeof (struct string_block
),
3856 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3857 Vmemory_full
= Qnil
;
3861 /************************************************************************
3863 ************************************************************************/
3865 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3867 /* Conservative C stack marking requires a method to identify possibly
3868 live Lisp objects given a pointer value. We do this by keeping
3869 track of blocks of Lisp data that are allocated in a red-black tree
3870 (see also the comment of mem_node which is the type of nodes in
3871 that tree). Function lisp_malloc adds information for an allocated
3872 block to the red-black tree with calls to mem_insert, and function
3873 lisp_free removes it with mem_delete. Functions live_string_p etc
3874 call mem_find to lookup information about a given pointer in the
3875 tree, and use that to determine if the pointer points to a Lisp
3878 /* Initialize this part of alloc.c. */
3883 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3884 mem_z
.parent
= NULL
;
3885 mem_z
.color
= MEM_BLACK
;
3886 mem_z
.start
= mem_z
.end
= NULL
;
3891 /* Value is a pointer to the mem_node containing START. Value is
3892 MEM_NIL if there is no node in the tree containing START. */
3894 static struct mem_node
*
3895 mem_find (void *start
)
3899 if (start
< min_heap_address
|| start
> max_heap_address
)
3902 /* Make the search always successful to speed up the loop below. */
3903 mem_z
.start
= start
;
3904 mem_z
.end
= (char *) start
+ 1;
3907 while (start
< p
->start
|| start
>= p
->end
)
3908 p
= start
< p
->start
? p
->left
: p
->right
;
3913 /* Insert a new node into the tree for a block of memory with start
3914 address START, end address END, and type TYPE. Value is a
3915 pointer to the node that was inserted. */
3917 static struct mem_node
*
3918 mem_insert (void *start
, void *end
, enum mem_type type
)
3920 struct mem_node
*c
, *parent
, *x
;
3922 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3923 min_heap_address
= start
;
3924 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3925 max_heap_address
= end
;
3927 /* See where in the tree a node for START belongs. In this
3928 particular application, it shouldn't happen that a node is already
3929 present. For debugging purposes, let's check that. */
3933 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3935 while (c
!= MEM_NIL
)
3937 if (start
>= c
->start
&& start
< c
->end
)
3940 c
= start
< c
->start
? c
->left
: c
->right
;
3943 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3945 while (c
!= MEM_NIL
)
3948 c
= start
< c
->start
? c
->left
: c
->right
;
3951 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3953 /* Create a new node. */
3954 #ifdef GC_MALLOC_CHECK
3955 x
= malloc (sizeof *x
);
3959 x
= xmalloc (sizeof *x
);
3965 x
->left
= x
->right
= MEM_NIL
;
3968 /* Insert it as child of PARENT or install it as root. */
3971 if (start
< parent
->start
)
3979 /* Re-establish red-black tree properties. */
3980 mem_insert_fixup (x
);
3986 /* Re-establish the red-black properties of the tree, and thereby
3987 balance the tree, after node X has been inserted; X is always red. */
3990 mem_insert_fixup (struct mem_node
*x
)
3992 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3994 /* X is red and its parent is red. This is a violation of
3995 red-black tree property #3. */
3997 if (x
->parent
== x
->parent
->parent
->left
)
3999 /* We're on the left side of our grandparent, and Y is our
4001 struct mem_node
*y
= x
->parent
->parent
->right
;
4003 if (y
->color
== MEM_RED
)
4005 /* Uncle and parent are red but should be black because
4006 X is red. Change the colors accordingly and proceed
4007 with the grandparent. */
4008 x
->parent
->color
= MEM_BLACK
;
4009 y
->color
= MEM_BLACK
;
4010 x
->parent
->parent
->color
= MEM_RED
;
4011 x
= x
->parent
->parent
;
4015 /* Parent and uncle have different colors; parent is
4016 red, uncle is black. */
4017 if (x
== x
->parent
->right
)
4020 mem_rotate_left (x
);
4023 x
->parent
->color
= MEM_BLACK
;
4024 x
->parent
->parent
->color
= MEM_RED
;
4025 mem_rotate_right (x
->parent
->parent
);
4030 /* This is the symmetrical case of above. */
4031 struct mem_node
*y
= x
->parent
->parent
->left
;
4033 if (y
->color
== MEM_RED
)
4035 x
->parent
->color
= MEM_BLACK
;
4036 y
->color
= MEM_BLACK
;
4037 x
->parent
->parent
->color
= MEM_RED
;
4038 x
= x
->parent
->parent
;
4042 if (x
== x
->parent
->left
)
4045 mem_rotate_right (x
);
4048 x
->parent
->color
= MEM_BLACK
;
4049 x
->parent
->parent
->color
= MEM_RED
;
4050 mem_rotate_left (x
->parent
->parent
);
4055 /* The root may have been changed to red due to the algorithm. Set
4056 it to black so that property #5 is satisfied. */
4057 mem_root
->color
= MEM_BLACK
;
4068 mem_rotate_left (struct mem_node
*x
)
4072 /* Turn y's left sub-tree into x's right sub-tree. */
4075 if (y
->left
!= MEM_NIL
)
4076 y
->left
->parent
= x
;
4078 /* Y's parent was x's parent. */
4080 y
->parent
= x
->parent
;
4082 /* Get the parent to point to y instead of x. */
4085 if (x
== x
->parent
->left
)
4086 x
->parent
->left
= y
;
4088 x
->parent
->right
= y
;
4093 /* Put x on y's left. */
4107 mem_rotate_right (struct mem_node
*x
)
4109 struct mem_node
*y
= x
->left
;
4112 if (y
->right
!= MEM_NIL
)
4113 y
->right
->parent
= x
;
4116 y
->parent
= x
->parent
;
4119 if (x
== x
->parent
->right
)
4120 x
->parent
->right
= y
;
4122 x
->parent
->left
= y
;
4133 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
4136 mem_delete (struct mem_node
*z
)
4138 struct mem_node
*x
, *y
;
4140 if (!z
|| z
== MEM_NIL
)
4143 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
4148 while (y
->left
!= MEM_NIL
)
4152 if (y
->left
!= MEM_NIL
)
4157 x
->parent
= y
->parent
;
4160 if (y
== y
->parent
->left
)
4161 y
->parent
->left
= x
;
4163 y
->parent
->right
= x
;
4170 z
->start
= y
->start
;
4175 if (y
->color
== MEM_BLACK
)
4176 mem_delete_fixup (x
);
4178 #ifdef GC_MALLOC_CHECK
4186 /* Re-establish the red-black properties of the tree, after a
4190 mem_delete_fixup (struct mem_node
*x
)
4192 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
4194 if (x
== x
->parent
->left
)
4196 struct mem_node
*w
= x
->parent
->right
;
4198 if (w
->color
== MEM_RED
)
4200 w
->color
= MEM_BLACK
;
4201 x
->parent
->color
= MEM_RED
;
4202 mem_rotate_left (x
->parent
);
4203 w
= x
->parent
->right
;
4206 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
4213 if (w
->right
->color
== MEM_BLACK
)
4215 w
->left
->color
= MEM_BLACK
;
4217 mem_rotate_right (w
);
4218 w
= x
->parent
->right
;
4220 w
->color
= x
->parent
->color
;
4221 x
->parent
->color
= MEM_BLACK
;
4222 w
->right
->color
= MEM_BLACK
;
4223 mem_rotate_left (x
->parent
);
4229 struct mem_node
*w
= x
->parent
->left
;
4231 if (w
->color
== MEM_RED
)
4233 w
->color
= MEM_BLACK
;
4234 x
->parent
->color
= MEM_RED
;
4235 mem_rotate_right (x
->parent
);
4236 w
= x
->parent
->left
;
4239 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
4246 if (w
->left
->color
== MEM_BLACK
)
4248 w
->right
->color
= MEM_BLACK
;
4250 mem_rotate_left (w
);
4251 w
= x
->parent
->left
;
4254 w
->color
= x
->parent
->color
;
4255 x
->parent
->color
= MEM_BLACK
;
4256 w
->left
->color
= MEM_BLACK
;
4257 mem_rotate_right (x
->parent
);
4263 x
->color
= MEM_BLACK
;
4267 /* Value is non-zero if P is a pointer to a live Lisp string on
4268 the heap. M is a pointer to the mem_block for P. */
4271 live_string_p (struct mem_node
*m
, void *p
)
4273 if (m
->type
== MEM_TYPE_STRING
)
4275 struct string_block
*b
= m
->start
;
4276 ptrdiff_t offset
= (char *) p
- (char *) &b
->strings
[0];
4278 /* P must point to the start of a Lisp_String structure, and it
4279 must not be on the free-list. */
4281 && offset
% sizeof b
->strings
[0] == 0
4282 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
4283 && ((struct Lisp_String
*) p
)->data
!= NULL
);
4290 /* Value is non-zero if P is a pointer to a live Lisp cons on
4291 the heap. M is a pointer to the mem_block for P. */
4294 live_cons_p (struct mem_node
*m
, void *p
)
4296 if (m
->type
== MEM_TYPE_CONS
)
4298 struct cons_block
*b
= m
->start
;
4299 ptrdiff_t offset
= (char *) p
- (char *) &b
->conses
[0];
4301 /* P must point to the start of a Lisp_Cons, not be
4302 one of the unused cells in the current cons block,
4303 and not be on the free-list. */
4305 && offset
% sizeof b
->conses
[0] == 0
4306 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
4308 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
4309 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
4316 /* Value is non-zero if P is a pointer to a live Lisp symbol on
4317 the heap. M is a pointer to the mem_block for P. */
4320 live_symbol_p (struct mem_node
*m
, void *p
)
4322 if (m
->type
== MEM_TYPE_SYMBOL
)
4324 struct symbol_block
*b
= m
->start
;
4325 ptrdiff_t offset
= (char *) p
- (char *) &b
->symbols
[0];
4327 /* P must point to the start of a Lisp_Symbol, not be
4328 one of the unused cells in the current symbol block,
4329 and not be on the free-list. */
4331 && offset
% sizeof b
->symbols
[0] == 0
4332 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
4333 && (b
!= symbol_block
4334 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
4335 && !EQ (((struct Lisp_Symbol
*)p
)->function
, Vdead
));
4342 /* Value is non-zero if P is a pointer to a live Lisp float on
4343 the heap. M is a pointer to the mem_block for P. */
4346 live_float_p (struct mem_node
*m
, void *p
)
4348 if (m
->type
== MEM_TYPE_FLOAT
)
4350 struct float_block
*b
= m
->start
;
4351 ptrdiff_t offset
= (char *) p
- (char *) &b
->floats
[0];
4353 /* P must point to the start of a Lisp_Float and not be
4354 one of the unused cells in the current float block. */
4356 && offset
% sizeof b
->floats
[0] == 0
4357 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
4358 && (b
!= float_block
4359 || offset
/ sizeof b
->floats
[0] < float_block_index
));
4366 /* Value is non-zero if P is a pointer to a live Lisp Misc on
4367 the heap. M is a pointer to the mem_block for P. */
4370 live_misc_p (struct mem_node
*m
, void *p
)
4372 if (m
->type
== MEM_TYPE_MISC
)
4374 struct marker_block
*b
= m
->start
;
4375 ptrdiff_t offset
= (char *) p
- (char *) &b
->markers
[0];
4377 /* P must point to the start of a Lisp_Misc, not be
4378 one of the unused cells in the current misc block,
4379 and not be on the free-list. */
4381 && offset
% sizeof b
->markers
[0] == 0
4382 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4383 && (b
!= marker_block
4384 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4385 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
4392 /* Value is non-zero if P is a pointer to a live vector-like object.
4393 M is a pointer to the mem_block for P. */
4396 live_vector_p (struct mem_node
*m
, void *p
)
4398 if (m
->type
== MEM_TYPE_VECTOR_BLOCK
)
4400 /* This memory node corresponds to a vector block. */
4401 struct vector_block
*block
= m
->start
;
4402 struct Lisp_Vector
*vector
= (struct Lisp_Vector
*) block
->data
;
4404 /* P is in the block's allocation range. Scan the block
4405 up to P and see whether P points to the start of some
4406 vector which is not on a free list. FIXME: check whether
4407 some allocation patterns (probably a lot of short vectors)
4408 may cause a substantial overhead of this loop. */
4409 while (VECTOR_IN_BLOCK (vector
, block
)
4410 && vector
<= (struct Lisp_Vector
*) p
)
4412 if (!PSEUDOVECTOR_TYPEP (&vector
->header
, PVEC_FREE
) && vector
== p
)
4415 vector
= ADVANCE (vector
, vector_nbytes (vector
));
4418 else if (m
->type
== MEM_TYPE_VECTORLIKE
&& p
== large_vector_vec (m
->start
))
4419 /* This memory node corresponds to a large vector. */
4425 /* Value is non-zero if P is a pointer to a live buffer. M is a
4426 pointer to the mem_block for P. */
4429 live_buffer_p (struct mem_node
*m
, void *p
)
4431 /* P must point to the start of the block, and the buffer
4432 must not have been killed. */
4433 return (m
->type
== MEM_TYPE_BUFFER
4435 && !NILP (((struct buffer
*) p
)->INTERNAL_FIELD (name
)));
4438 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4442 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4444 /* Currently not used, but may be called from gdb. */
4446 void dump_zombies (void) EXTERNALLY_VISIBLE
;
4448 /* Array of objects that are kept alive because the C stack contains
4449 a pattern that looks like a reference to them. */
4451 #define MAX_ZOMBIES 10
4452 static Lisp_Object zombies
[MAX_ZOMBIES
];
4454 /* Number of zombie objects. */
4456 static EMACS_INT nzombies
;
4458 /* Number of garbage collections. */
4460 static EMACS_INT ngcs
;
4462 /* Average percentage of zombies per collection. */
4464 static double avg_zombies
;
4466 /* Max. number of live and zombie objects. */
4468 static EMACS_INT max_live
, max_zombies
;
4470 /* Average number of live objects per GC. */
4472 static double avg_live
;
4474 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4475 doc
: /* Show information about live and zombie objects. */)
4478 Lisp_Object args
[8], zombie_list
= Qnil
;
4480 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); i
++)
4481 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4482 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4483 args
[1] = make_number (ngcs
);
4484 args
[2] = make_float (avg_live
);
4485 args
[3] = make_float (avg_zombies
);
4486 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4487 args
[5] = make_number (max_live
);
4488 args
[6] = make_number (max_zombies
);
4489 args
[7] = zombie_list
;
4490 return Fmessage (8, args
);
4493 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4496 /* Mark OBJ if we can prove it's a Lisp_Object. */
4499 mark_maybe_object (Lisp_Object obj
)
4506 VALGRIND_MAKE_MEM_DEFINED (&obj
, sizeof (obj
));
4512 po
= (void *) XPNTR (obj
);
4519 switch (XTYPE (obj
))
4522 mark_p
= (live_string_p (m
, po
)
4523 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4527 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4531 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4535 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4538 case Lisp_Vectorlike
:
4539 /* Note: can't check BUFFERP before we know it's a
4540 buffer because checking that dereferences the pointer
4541 PO which might point anywhere. */
4542 if (live_vector_p (m
, po
))
4543 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4544 else if (live_buffer_p (m
, po
))
4545 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4549 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4558 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4559 if (nzombies
< MAX_ZOMBIES
)
4560 zombies
[nzombies
] = obj
;
4568 /* Return true if P can point to Lisp data, and false otherwise.
4569 USE_LSB_TAG needs Lisp data to be aligned on multiples of GCALIGNMENT.
4570 Otherwise, assume that Lisp data is aligned on even addresses. */
4573 maybe_lisp_pointer (void *p
)
4575 return !((intptr_t) p
% (USE_LSB_TAG
? GCALIGNMENT
: 2));
4578 /* If P points to Lisp data, mark that as live if it isn't already
4582 mark_maybe_pointer (void *p
)
4588 VALGRIND_MAKE_MEM_DEFINED (&p
, sizeof (p
));
4591 if (!maybe_lisp_pointer (p
))
4597 Lisp_Object obj
= Qnil
;
4601 case MEM_TYPE_NON_LISP
:
4602 case MEM_TYPE_SPARE
:
4603 /* Nothing to do; not a pointer to Lisp memory. */
4606 case MEM_TYPE_BUFFER
:
4607 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P ((struct buffer
*)p
))
4608 XSETVECTOR (obj
, p
);
4612 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4616 case MEM_TYPE_STRING
:
4617 if (live_string_p (m
, p
)
4618 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4619 XSETSTRING (obj
, p
);
4623 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4627 case MEM_TYPE_SYMBOL
:
4628 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4629 XSETSYMBOL (obj
, p
);
4632 case MEM_TYPE_FLOAT
:
4633 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4637 case MEM_TYPE_VECTORLIKE
:
4638 case MEM_TYPE_VECTOR_BLOCK
:
4639 if (live_vector_p (m
, p
))
4642 XSETVECTOR (tem
, p
);
4643 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4658 /* Alignment of pointer values. Use alignof, as it sometimes returns
4659 a smaller alignment than GCC's __alignof__ and mark_memory might
4660 miss objects if __alignof__ were used. */
4661 #define GC_POINTER_ALIGNMENT alignof (void *)
4663 /* Define POINTERS_MIGHT_HIDE_IN_OBJECTS to 1 if marking via C pointers does
4664 not suffice, which is the typical case. A host where a Lisp_Object is
4665 wider than a pointer might allocate a Lisp_Object in non-adjacent halves.
4666 If USE_LSB_TAG, the bottom half is not a valid pointer, but it should
4667 suffice to widen it to to a Lisp_Object and check it that way. */
4668 #if USE_LSB_TAG || VAL_MAX < UINTPTR_MAX
4669 # if !USE_LSB_TAG && VAL_MAX < UINTPTR_MAX >> GCTYPEBITS
4670 /* If tag bits straddle pointer-word boundaries, neither mark_maybe_pointer
4671 nor mark_maybe_object can follow the pointers. This should not occur on
4672 any practical porting target. */
4673 # error "MSB type bits straddle pointer-word boundaries"
4675 /* Marking via C pointers does not suffice, because Lisp_Objects contain
4676 pointer words that hold pointers ORed with type bits. */
4677 # define POINTERS_MIGHT_HIDE_IN_OBJECTS 1
4679 /* Marking via C pointers suffices, because Lisp_Objects contain pointer
4680 words that hold unmodified pointers. */
4681 # define POINTERS_MIGHT_HIDE_IN_OBJECTS 0
4684 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4685 or END+OFFSET..START. */
4687 static void ATTRIBUTE_NO_SANITIZE_ADDRESS
4688 mark_memory (void *start
, void *end
)
4693 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4697 /* Make START the pointer to the start of the memory region,
4698 if it isn't already. */
4706 /* Mark Lisp data pointed to. This is necessary because, in some
4707 situations, the C compiler optimizes Lisp objects away, so that
4708 only a pointer to them remains. Example:
4710 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4713 Lisp_Object obj = build_string ("test");
4714 struct Lisp_String *s = XSTRING (obj);
4715 Fgarbage_collect ();
4716 fprintf (stderr, "test `%s'\n", s->data);
4720 Here, `obj' isn't really used, and the compiler optimizes it
4721 away. The only reference to the life string is through the
4724 for (pp
= start
; (void *) pp
< end
; pp
++)
4725 for (i
= 0; i
< sizeof *pp
; i
+= GC_POINTER_ALIGNMENT
)
4727 void *p
= *(void **) ((char *) pp
+ i
);
4728 mark_maybe_pointer (p
);
4729 if (POINTERS_MIGHT_HIDE_IN_OBJECTS
)
4730 mark_maybe_object (XIL ((intptr_t) p
));
4734 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4736 static bool setjmp_tested_p
;
4737 static int longjmps_done
;
4739 #define SETJMP_WILL_LIKELY_WORK "\
4741 Emacs garbage collector has been changed to use conservative stack\n\
4742 marking. Emacs has determined that the method it uses to do the\n\
4743 marking will likely work on your system, but this isn't sure.\n\
4745 If you are a system-programmer, or can get the help of a local wizard\n\
4746 who is, please take a look at the function mark_stack in alloc.c, and\n\
4747 verify that the methods used are appropriate for your system.\n\
4749 Please mail the result to <emacs-devel@gnu.org>.\n\
4752 #define SETJMP_WILL_NOT_WORK "\
4754 Emacs garbage collector has been changed to use conservative stack\n\
4755 marking. Emacs has determined that the default method it uses to do the\n\
4756 marking will not work on your system. We will need a system-dependent\n\
4757 solution for your system.\n\
4759 Please take a look at the function mark_stack in alloc.c, and\n\
4760 try to find a way to make it work on your system.\n\
4762 Note that you may get false negatives, depending on the compiler.\n\
4763 In particular, you need to use -O with GCC for this test.\n\
4765 Please mail the result to <emacs-devel@gnu.org>.\n\
4769 /* Perform a quick check if it looks like setjmp saves registers in a
4770 jmp_buf. Print a message to stderr saying so. When this test
4771 succeeds, this is _not_ a proof that setjmp is sufficient for
4772 conservative stack marking. Only the sources or a disassembly
4782 /* Arrange for X to be put in a register. */
4788 if (longjmps_done
== 1)
4790 /* Came here after the longjmp at the end of the function.
4792 If x == 1, the longjmp has restored the register to its
4793 value before the setjmp, and we can hope that setjmp
4794 saves all such registers in the jmp_buf, although that
4797 For other values of X, either something really strange is
4798 taking place, or the setjmp just didn't save the register. */
4801 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4804 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4811 if (longjmps_done
== 1)
4812 sys_longjmp (jbuf
, 1);
4815 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4818 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4820 /* Abort if anything GCPRO'd doesn't survive the GC. */
4828 for (p
= gcprolist
; p
; p
= p
->next
)
4829 for (i
= 0; i
< p
->nvars
; ++i
)
4830 if (!survives_gc_p (p
->var
[i
]))
4831 /* FIXME: It's not necessarily a bug. It might just be that the
4832 GCPRO is unnecessary or should release the object sooner. */
4836 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4843 fprintf (stderr
, "\nZombies kept alive = %"pI
"d:\n", nzombies
);
4844 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4846 fprintf (stderr
, " %d = ", i
);
4847 debug_print (zombies
[i
]);
4851 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4854 /* Mark live Lisp objects on the C stack.
4856 There are several system-dependent problems to consider when
4857 porting this to new architectures:
4861 We have to mark Lisp objects in CPU registers that can hold local
4862 variables or are used to pass parameters.
4864 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4865 something that either saves relevant registers on the stack, or
4866 calls mark_maybe_object passing it each register's contents.
4868 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4869 implementation assumes that calling setjmp saves registers we need
4870 to see in a jmp_buf which itself lies on the stack. This doesn't
4871 have to be true! It must be verified for each system, possibly
4872 by taking a look at the source code of setjmp.
4874 If __builtin_unwind_init is available (defined by GCC >= 2.8) we
4875 can use it as a machine independent method to store all registers
4876 to the stack. In this case the macros described in the previous
4877 two paragraphs are not used.
4881 Architectures differ in the way their processor stack is organized.
4882 For example, the stack might look like this
4885 | Lisp_Object | size = 4
4887 | something else | size = 2
4889 | Lisp_Object | size = 4
4893 In such a case, not every Lisp_Object will be aligned equally. To
4894 find all Lisp_Object on the stack it won't be sufficient to walk
4895 the stack in steps of 4 bytes. Instead, two passes will be
4896 necessary, one starting at the start of the stack, and a second
4897 pass starting at the start of the stack + 2. Likewise, if the
4898 minimal alignment of Lisp_Objects on the stack is 1, four passes
4899 would be necessary, each one starting with one byte more offset
4900 from the stack start. */
4903 mark_stack (void *end
)
4906 /* This assumes that the stack is a contiguous region in memory. If
4907 that's not the case, something has to be done here to iterate
4908 over the stack segments. */
4909 mark_memory (stack_base
, end
);
4911 /* Allow for marking a secondary stack, like the register stack on the
4913 #ifdef GC_MARK_SECONDARY_STACK
4914 GC_MARK_SECONDARY_STACK ();
4917 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4922 #else /* GC_MARK_STACK == 0 */
4924 #define mark_maybe_object(obj) emacs_abort ()
4926 #endif /* GC_MARK_STACK != 0 */
4929 /* Determine whether it is safe to access memory at address P. */
4931 valid_pointer_p (void *p
)
4934 return w32_valid_pointer_p (p
, 16);
4937 if (ADDRESS_SANITIZER
)
4942 /* Obviously, we cannot just access it (we would SEGV trying), so we
4943 trick the o/s to tell us whether p is a valid pointer.
4944 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4945 not validate p in that case. */
4947 if (emacs_pipe (fd
) == 0)
4949 bool valid
= emacs_write (fd
[1], p
, 16) == 16;
4950 emacs_close (fd
[1]);
4951 emacs_close (fd
[0]);
4959 /* Return 2 if OBJ is a killed or special buffer object, 1 if OBJ is a
4960 valid lisp object, 0 if OBJ is NOT a valid lisp object, or -1 if we
4961 cannot validate OBJ. This function can be quite slow, so its primary
4962 use is the manual debugging. The only exception is print_object, where
4963 we use it to check whether the memory referenced by the pointer of
4964 Lisp_Save_Value object contains valid objects. */
4967 valid_lisp_object_p (Lisp_Object obj
)
4977 p
= (void *) XPNTR (obj
);
4978 if (PURE_POINTER_P (p
))
4981 if (p
== &buffer_defaults
|| p
== &buffer_local_symbols
)
4985 return valid_pointer_p (p
);
4992 int valid
= valid_pointer_p (p
);
5004 case MEM_TYPE_NON_LISP
:
5005 case MEM_TYPE_SPARE
:
5008 case MEM_TYPE_BUFFER
:
5009 return live_buffer_p (m
, p
) ? 1 : 2;
5012 return live_cons_p (m
, p
);
5014 case MEM_TYPE_STRING
:
5015 return live_string_p (m
, p
);
5018 return live_misc_p (m
, p
);
5020 case MEM_TYPE_SYMBOL
:
5021 return live_symbol_p (m
, p
);
5023 case MEM_TYPE_FLOAT
:
5024 return live_float_p (m
, p
);
5026 case MEM_TYPE_VECTORLIKE
:
5027 case MEM_TYPE_VECTOR_BLOCK
:
5028 return live_vector_p (m
, p
);
5038 /* If GC_MARK_STACK, return 1 if STR is a relocatable data of Lisp_String
5039 (i.e. there is a non-pure Lisp_Object X so that SDATA (X) == STR) and 0
5040 if not. Otherwise we can't rely on valid_lisp_object_p and return -1.
5041 This function is slow and should be used for debugging purposes. */
5044 relocatable_string_data_p (const char *str
)
5046 if (PURE_POINTER_P (str
))
5052 = (struct sdata
*) (str
- offsetof (struct sdata
, data
));
5054 if (0 < valid_pointer_p (sdata
)
5055 && 0 < valid_pointer_p (sdata
->string
)
5056 && maybe_lisp_pointer (sdata
->string
))
5057 return (valid_lisp_object_p
5058 (make_lisp_ptr (sdata
->string
, Lisp_String
))
5059 && (const char *) sdata
->string
->data
== str
);
5062 #endif /* GC_MARK_STACK */
5066 /***********************************************************************
5067 Pure Storage Management
5068 ***********************************************************************/
5070 /* Allocate room for SIZE bytes from pure Lisp storage and return a
5071 pointer to it. TYPE is the Lisp type for which the memory is
5072 allocated. TYPE < 0 means it's not used for a Lisp object. */
5075 pure_alloc (size_t size
, int type
)
5079 size_t alignment
= GCALIGNMENT
;
5081 size_t alignment
= alignof (EMACS_INT
);
5083 /* Give Lisp_Floats an extra alignment. */
5084 if (type
== Lisp_Float
)
5085 alignment
= alignof (struct Lisp_Float
);
5091 /* Allocate space for a Lisp object from the beginning of the free
5092 space with taking account of alignment. */
5093 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
5094 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
5098 /* Allocate space for a non-Lisp object from the end of the free
5100 pure_bytes_used_non_lisp
+= size
;
5101 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
5103 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
5105 if (pure_bytes_used
<= pure_size
)
5108 /* Don't allocate a large amount here,
5109 because it might get mmap'd and then its address
5110 might not be usable. */
5111 purebeg
= xmalloc (10000);
5113 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
5114 pure_bytes_used
= 0;
5115 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
5120 /* Print a warning if PURESIZE is too small. */
5123 check_pure_size (void)
5125 if (pure_bytes_used_before_overflow
)
5126 message (("emacs:0:Pure Lisp storage overflow (approx. %"pI
"d"
5128 pure_bytes_used
+ pure_bytes_used_before_overflow
);
5132 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
5133 the non-Lisp data pool of the pure storage, and return its start
5134 address. Return NULL if not found. */
5137 find_string_data_in_pure (const char *data
, ptrdiff_t nbytes
)
5140 ptrdiff_t skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
5141 const unsigned char *p
;
5144 if (pure_bytes_used_non_lisp
<= nbytes
)
5147 /* Set up the Boyer-Moore table. */
5149 for (i
= 0; i
< 256; i
++)
5152 p
= (const unsigned char *) data
;
5154 bm_skip
[*p
++] = skip
;
5156 last_char_skip
= bm_skip
['\0'];
5158 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
5159 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
5161 /* See the comments in the function `boyer_moore' (search.c) for the
5162 use of `infinity'. */
5163 infinity
= pure_bytes_used_non_lisp
+ 1;
5164 bm_skip
['\0'] = infinity
;
5166 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
5170 /* Check the last character (== '\0'). */
5173 start
+= bm_skip
[*(p
+ start
)];
5175 while (start
<= start_max
);
5177 if (start
< infinity
)
5178 /* Couldn't find the last character. */
5181 /* No less than `infinity' means we could find the last
5182 character at `p[start - infinity]'. */
5185 /* Check the remaining characters. */
5186 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
5188 return non_lisp_beg
+ start
;
5190 start
+= last_char_skip
;
5192 while (start
<= start_max
);
5198 /* Return a string allocated in pure space. DATA is a buffer holding
5199 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
5200 means make the result string multibyte.
5202 Must get an error if pure storage is full, since if it cannot hold
5203 a large string it may be able to hold conses that point to that
5204 string; then the string is not protected from gc. */
5207 make_pure_string (const char *data
,
5208 ptrdiff_t nchars
, ptrdiff_t nbytes
, bool multibyte
)
5211 struct Lisp_String
*s
= pure_alloc (sizeof *s
, Lisp_String
);
5212 s
->data
= (unsigned char *) find_string_data_in_pure (data
, nbytes
);
5213 if (s
->data
== NULL
)
5215 s
->data
= pure_alloc (nbytes
+ 1, -1);
5216 memcpy (s
->data
, data
, nbytes
);
5217 s
->data
[nbytes
] = '\0';
5220 s
->size_byte
= multibyte
? nbytes
: -1;
5221 s
->intervals
= NULL
;
5222 XSETSTRING (string
, s
);
5226 /* Return a string allocated in pure space. Do not
5227 allocate the string data, just point to DATA. */
5230 make_pure_c_string (const char *data
, ptrdiff_t nchars
)
5233 struct Lisp_String
*s
= pure_alloc (sizeof *s
, Lisp_String
);
5236 s
->data
= (unsigned char *) data
;
5237 s
->intervals
= NULL
;
5238 XSETSTRING (string
, s
);
5242 static Lisp_Object
purecopy (Lisp_Object obj
);
5244 /* Return a cons allocated from pure space. Give it pure copies
5245 of CAR as car and CDR as cdr. */
5248 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
5251 struct Lisp_Cons
*p
= pure_alloc (sizeof *p
, Lisp_Cons
);
5253 XSETCAR (new, purecopy (car
));
5254 XSETCDR (new, purecopy (cdr
));
5259 /* Value is a float object with value NUM allocated from pure space. */
5262 make_pure_float (double num
)
5265 struct Lisp_Float
*p
= pure_alloc (sizeof *p
, Lisp_Float
);
5267 XFLOAT_INIT (new, num
);
5272 /* Return a vector with room for LEN Lisp_Objects allocated from
5276 make_pure_vector (ptrdiff_t len
)
5279 size_t size
= header_size
+ len
* word_size
;
5280 struct Lisp_Vector
*p
= pure_alloc (size
, Lisp_Vectorlike
);
5281 XSETVECTOR (new, p
);
5282 XVECTOR (new)->header
.size
= len
;
5287 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
5288 doc
: /* Make a copy of object OBJ in pure storage.
5289 Recursively copies contents of vectors and cons cells.
5290 Does not copy symbols. Copies strings without text properties. */)
5291 (register Lisp_Object obj
)
5293 if (NILP (Vpurify_flag
))
5295 else if (MARKERP (obj
) || OVERLAYP (obj
)
5296 || HASH_TABLE_P (obj
) || SYMBOLP (obj
))
5297 /* Can't purify those. */
5300 return purecopy (obj
);
5304 purecopy (Lisp_Object obj
)
5306 if (PURE_POINTER_P (XPNTR (obj
)) || INTEGERP (obj
) || SUBRP (obj
))
5307 return obj
; /* Already pure. */
5309 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
5311 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
5317 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
5318 else if (FLOATP (obj
))
5319 obj
= make_pure_float (XFLOAT_DATA (obj
));
5320 else if (STRINGP (obj
))
5321 obj
= make_pure_string (SSDATA (obj
), SCHARS (obj
),
5323 STRING_MULTIBYTE (obj
));
5324 else if (COMPILEDP (obj
) || VECTORP (obj
))
5326 register struct Lisp_Vector
*vec
;
5327 register ptrdiff_t i
;
5331 if (size
& PSEUDOVECTOR_FLAG
)
5332 size
&= PSEUDOVECTOR_SIZE_MASK
;
5333 vec
= XVECTOR (make_pure_vector (size
));
5334 for (i
= 0; i
< size
; i
++)
5335 vec
->contents
[i
] = purecopy (AREF (obj
, i
));
5336 if (COMPILEDP (obj
))
5338 XSETPVECTYPE (vec
, PVEC_COMPILED
);
5339 XSETCOMPILED (obj
, vec
);
5342 XSETVECTOR (obj
, vec
);
5344 else if (SYMBOLP (obj
))
5346 if (!XSYMBOL (obj
)->pinned
)
5347 { /* We can't purify them, but they appear in many pure objects.
5348 Mark them as `pinned' so we know to mark them at every GC cycle. */
5349 XSYMBOL (obj
)->pinned
= true;
5350 symbol_block_pinned
= symbol_block
;
5356 Lisp_Object args
[2];
5357 args
[0] = build_pure_c_string ("Don't know how to purify: %S");
5359 Fsignal (Qerror
, (Fcons (Fformat (2, args
), Qnil
)));
5362 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
5363 Fputhash (obj
, obj
, Vpurify_flag
);
5370 /***********************************************************************
5372 ***********************************************************************/
5374 /* Put an entry in staticvec, pointing at the variable with address
5378 staticpro (Lisp_Object
*varaddress
)
5380 if (staticidx
>= NSTATICS
)
5381 fatal ("NSTATICS too small; try increasing and recompiling Emacs.");
5382 staticvec
[staticidx
++] = varaddress
;
5386 /***********************************************************************
5388 ***********************************************************************/
5390 /* Temporarily prevent garbage collection. */
5393 inhibit_garbage_collection (void)
5395 ptrdiff_t count
= SPECPDL_INDEX ();
5397 specbind (Qgc_cons_threshold
, make_number (MOST_POSITIVE_FIXNUM
));
5401 /* Used to avoid possible overflows when
5402 converting from C to Lisp integers. */
5405 bounded_number (EMACS_INT number
)
5407 return make_number (min (MOST_POSITIVE_FIXNUM
, number
));
5410 /* Calculate total bytes of live objects. */
5413 total_bytes_of_live_objects (void)
5416 tot
+= total_conses
* sizeof (struct Lisp_Cons
);
5417 tot
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5418 tot
+= total_markers
* sizeof (union Lisp_Misc
);
5419 tot
+= total_string_bytes
;
5420 tot
+= total_vector_slots
* word_size
;
5421 tot
+= total_floats
* sizeof (struct Lisp_Float
);
5422 tot
+= total_intervals
* sizeof (struct interval
);
5423 tot
+= total_strings
* sizeof (struct Lisp_String
);
5427 #ifdef HAVE_WINDOW_SYSTEM
5429 /* This code has a few issues on MS-Windows, see Bug#15876 and Bug#16140. */
5431 #if !defined (HAVE_NTGUI)
5433 /* Remove unmarked font-spec and font-entity objects from ENTRY, which is
5434 (DRIVER-TYPE NUM-FRAMES FONT-CACHE-DATA ...), and return changed entry. */
5437 compact_font_cache_entry (Lisp_Object entry
)
5439 Lisp_Object tail
, *prev
= &entry
;
5441 for (tail
= entry
; CONSP (tail
); tail
= XCDR (tail
))
5444 Lisp_Object obj
= XCAR (tail
);
5446 /* Consider OBJ if it is (font-spec . [font-entity font-entity ...]). */
5447 if (CONSP (obj
) && FONT_SPEC_P (XCAR (obj
))
5448 && !VECTOR_MARKED_P (XFONT_SPEC (XCAR (obj
)))
5449 && VECTORP (XCDR (obj
)))
5451 ptrdiff_t i
, size
= ASIZE (XCDR (obj
)) & ~ARRAY_MARK_FLAG
;
5453 /* If font-spec is not marked, most likely all font-entities
5454 are not marked too. But we must be sure that nothing is
5455 marked within OBJ before we really drop it. */
5456 for (i
= 0; i
< size
; i
++)
5457 if (VECTOR_MARKED_P (XFONT_ENTITY (AREF (XCDR (obj
), i
))))
5464 *prev
= XCDR (tail
);
5466 prev
= xcdr_addr (tail
);
5471 #endif /* not HAVE_NTGUI */
5473 /* Compact font caches on all terminals and mark
5474 everything which is still here after compaction. */
5477 compact_font_caches (void)
5481 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5483 Lisp_Object cache
= TERMINAL_FONT_CACHE (t
);
5484 #if !defined (HAVE_NTGUI)
5489 for (entry
= XCDR (cache
); CONSP (entry
); entry
= XCDR (entry
))
5490 XSETCAR (entry
, compact_font_cache_entry (XCAR (entry
)));
5492 #endif /* not HAVE_NTGUI */
5493 mark_object (cache
);
5497 #else /* not HAVE_WINDOW_SYSTEM */
5499 #define compact_font_caches() (void)(0)
5501 #endif /* HAVE_WINDOW_SYSTEM */
5503 /* Remove (MARKER . DATA) entries with unmarked MARKER
5504 from buffer undo LIST and return changed list. */
5507 compact_undo_list (Lisp_Object list
)
5509 Lisp_Object tail
, *prev
= &list
;
5511 for (tail
= list
; CONSP (tail
); tail
= XCDR (tail
))
5513 if (CONSP (XCAR (tail
))
5514 && MARKERP (XCAR (XCAR (tail
)))
5515 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5516 *prev
= XCDR (tail
);
5518 prev
= xcdr_addr (tail
);
5524 mark_pinned_symbols (void)
5526 struct symbol_block
*sblk
;
5527 int lim
= (symbol_block_pinned
== symbol_block
5528 ? symbol_block_index
: SYMBOL_BLOCK_SIZE
);
5530 for (sblk
= symbol_block_pinned
; sblk
; sblk
= sblk
->next
)
5532 union aligned_Lisp_Symbol
*sym
= sblk
->symbols
, *end
= sym
+ lim
;
5533 for (; sym
< end
; ++sym
)
5535 mark_object (make_lisp_ptr (&sym
->s
, Lisp_Symbol
));
5537 lim
= SYMBOL_BLOCK_SIZE
;
5541 /* Subroutine of Fgarbage_collect that does most of the work. It is a
5542 separate function so that we could limit mark_stack in searching
5543 the stack frames below this function, thus avoiding the rare cases
5544 where mark_stack finds values that look like live Lisp objects on
5545 portions of stack that couldn't possibly contain such live objects.
5546 For more details of this, see the discussion at
5547 http://lists.gnu.org/archive/html/emacs-devel/2014-05/msg00270.html. */
5549 garbage_collect_1 (void *end
)
5551 struct buffer
*nextb
;
5552 char stack_top_variable
;
5555 ptrdiff_t count
= SPECPDL_INDEX ();
5556 struct timespec start
;
5557 Lisp_Object retval
= Qnil
;
5558 size_t tot_before
= 0;
5563 /* Can't GC if pure storage overflowed because we can't determine
5564 if something is a pure object or not. */
5565 if (pure_bytes_used_before_overflow
)
5568 /* Record this function, so it appears on the profiler's backtraces. */
5569 record_in_backtrace (Qautomatic_gc
, &Qnil
, 0);
5573 /* Don't keep undo information around forever.
5574 Do this early on, so it is no problem if the user quits. */
5575 FOR_EACH_BUFFER (nextb
)
5576 compact_buffer (nextb
);
5578 if (profiler_memory_running
)
5579 tot_before
= total_bytes_of_live_objects ();
5581 start
= current_timespec ();
5583 /* In case user calls debug_print during GC,
5584 don't let that cause a recursive GC. */
5585 consing_since_gc
= 0;
5587 /* Save what's currently displayed in the echo area. */
5588 message_p
= push_message ();
5589 record_unwind_protect_void (pop_message_unwind
);
5591 /* Save a copy of the contents of the stack, for debugging. */
5592 #if MAX_SAVE_STACK > 0
5593 if (NILP (Vpurify_flag
))
5596 ptrdiff_t stack_size
;
5597 if (&stack_top_variable
< stack_bottom
)
5599 stack
= &stack_top_variable
;
5600 stack_size
= stack_bottom
- &stack_top_variable
;
5604 stack
= stack_bottom
;
5605 stack_size
= &stack_top_variable
- stack_bottom
;
5607 if (stack_size
<= MAX_SAVE_STACK
)
5609 if (stack_copy_size
< stack_size
)
5611 stack_copy
= xrealloc (stack_copy
, stack_size
);
5612 stack_copy_size
= stack_size
;
5614 no_sanitize_memcpy (stack_copy
, stack
, stack_size
);
5617 #endif /* MAX_SAVE_STACK > 0 */
5619 if (garbage_collection_messages
)
5620 message1_nolog ("Garbage collecting...");
5624 shrink_regexp_cache ();
5628 /* Mark all the special slots that serve as the roots of accessibility. */
5630 mark_buffer (&buffer_defaults
);
5631 mark_buffer (&buffer_local_symbols
);
5633 for (i
= 0; i
< staticidx
; i
++)
5634 mark_object (*staticvec
[i
]);
5636 mark_pinned_symbols ();
5645 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5646 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5650 register struct gcpro
*tail
;
5651 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5652 for (i
= 0; i
< tail
->nvars
; i
++)
5653 mark_object (tail
->var
[i
]);
5658 struct handler
*handler
;
5659 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5661 mark_object (handler
->tag_or_ch
);
5662 mark_object (handler
->val
);
5665 #ifdef HAVE_WINDOW_SYSTEM
5666 mark_fringe_data ();
5669 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5673 /* Everything is now marked, except for the data in font caches
5674 and undo lists. They're compacted by removing an items which
5675 aren't reachable otherwise. */
5677 compact_font_caches ();
5679 FOR_EACH_BUFFER (nextb
)
5681 if (!EQ (BVAR (nextb
, undo_list
), Qt
))
5682 bset_undo_list (nextb
, compact_undo_list (BVAR (nextb
, undo_list
)));
5683 /* Now that we have stripped the elements that need not be
5684 in the undo_list any more, we can finally mark the list. */
5685 mark_object (BVAR (nextb
, undo_list
));
5690 /* Clear the mark bits that we set in certain root slots. */
5692 unmark_byte_stack ();
5693 VECTOR_UNMARK (&buffer_defaults
);
5694 VECTOR_UNMARK (&buffer_local_symbols
);
5696 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5706 consing_since_gc
= 0;
5707 if (gc_cons_threshold
< GC_DEFAULT_THRESHOLD
/ 10)
5708 gc_cons_threshold
= GC_DEFAULT_THRESHOLD
/ 10;
5710 gc_relative_threshold
= 0;
5711 if (FLOATP (Vgc_cons_percentage
))
5712 { /* Set gc_cons_combined_threshold. */
5713 double tot
= total_bytes_of_live_objects ();
5715 tot
*= XFLOAT_DATA (Vgc_cons_percentage
);
5718 if (tot
< TYPE_MAXIMUM (EMACS_INT
))
5719 gc_relative_threshold
= tot
;
5721 gc_relative_threshold
= TYPE_MAXIMUM (EMACS_INT
);
5725 if (garbage_collection_messages
)
5727 if (message_p
|| minibuf_level
> 0)
5730 message1_nolog ("Garbage collecting...done");
5733 unbind_to (count
, Qnil
);
5735 Lisp_Object total
[11];
5736 int total_size
= 10;
5738 total
[0] = list4 (Qconses
, make_number (sizeof (struct Lisp_Cons
)),
5739 bounded_number (total_conses
),
5740 bounded_number (total_free_conses
));
5742 total
[1] = list4 (Qsymbols
, make_number (sizeof (struct Lisp_Symbol
)),
5743 bounded_number (total_symbols
),
5744 bounded_number (total_free_symbols
));
5746 total
[2] = list4 (Qmiscs
, make_number (sizeof (union Lisp_Misc
)),
5747 bounded_number (total_markers
),
5748 bounded_number (total_free_markers
));
5750 total
[3] = list4 (Qstrings
, make_number (sizeof (struct Lisp_String
)),
5751 bounded_number (total_strings
),
5752 bounded_number (total_free_strings
));
5754 total
[4] = list3 (Qstring_bytes
, make_number (1),
5755 bounded_number (total_string_bytes
));
5757 total
[5] = list3 (Qvectors
,
5758 make_number (header_size
+ sizeof (Lisp_Object
)),
5759 bounded_number (total_vectors
));
5761 total
[6] = list4 (Qvector_slots
, make_number (word_size
),
5762 bounded_number (total_vector_slots
),
5763 bounded_number (total_free_vector_slots
));
5765 total
[7] = list4 (Qfloats
, make_number (sizeof (struct Lisp_Float
)),
5766 bounded_number (total_floats
),
5767 bounded_number (total_free_floats
));
5769 total
[8] = list4 (Qintervals
, make_number (sizeof (struct interval
)),
5770 bounded_number (total_intervals
),
5771 bounded_number (total_free_intervals
));
5773 total
[9] = list3 (Qbuffers
, make_number (sizeof (struct buffer
)),
5774 bounded_number (total_buffers
));
5776 #ifdef DOUG_LEA_MALLOC
5778 total
[10] = list4 (Qheap
, make_number (1024),
5779 bounded_number ((mallinfo ().uordblks
+ 1023) >> 10),
5780 bounded_number ((mallinfo ().fordblks
+ 1023) >> 10));
5782 retval
= Flist (total_size
, total
);
5785 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5787 /* Compute average percentage of zombies. */
5789 = (total_conses
+ total_symbols
+ total_markers
+ total_strings
5790 + total_vectors
+ total_floats
+ total_intervals
+ total_buffers
);
5792 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5793 max_live
= max (nlive
, max_live
);
5794 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5795 max_zombies
= max (nzombies
, max_zombies
);
5800 if (!NILP (Vpost_gc_hook
))
5802 ptrdiff_t gc_count
= inhibit_garbage_collection ();
5803 safe_run_hooks (Qpost_gc_hook
);
5804 unbind_to (gc_count
, Qnil
);
5807 /* Accumulate statistics. */
5808 if (FLOATP (Vgc_elapsed
))
5810 struct timespec since_start
= timespec_sub (current_timespec (), start
);
5811 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
)
5812 + timespectod (since_start
));
5817 /* Collect profiling data. */
5818 if (profiler_memory_running
)
5821 size_t tot_after
= total_bytes_of_live_objects ();
5822 if (tot_before
> tot_after
)
5823 swept
= tot_before
- tot_after
;
5824 malloc_probe (swept
);
5830 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
5831 doc
: /* Reclaim storage for Lisp objects no longer needed.
5832 Garbage collection happens automatically if you cons more than
5833 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
5834 `garbage-collect' normally returns a list with info on amount of space in use,
5835 where each entry has the form (NAME SIZE USED FREE), where:
5836 - NAME is a symbol describing the kind of objects this entry represents,
5837 - SIZE is the number of bytes used by each one,
5838 - USED is the number of those objects that were found live in the heap,
5839 - FREE is the number of those objects that are not live but that Emacs
5840 keeps around for future allocations (maybe because it does not know how
5841 to return them to the OS).
5842 However, if there was overflow in pure space, `garbage-collect'
5843 returns nil, because real GC can't be done.
5844 See Info node `(elisp)Garbage Collection'. */)
5847 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5848 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS \
5849 || GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES)
5852 #ifdef HAVE___BUILTIN_UNWIND_INIT
5853 /* Force callee-saved registers and register windows onto the stack.
5854 This is the preferred method if available, obviating the need for
5855 machine dependent methods. */
5856 __builtin_unwind_init ();
5858 #else /* not HAVE___BUILTIN_UNWIND_INIT */
5859 #ifndef GC_SAVE_REGISTERS_ON_STACK
5860 /* jmp_buf may not be aligned enough on darwin-ppc64 */
5861 union aligned_jmpbuf
{
5865 volatile bool stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
5867 /* This trick flushes the register windows so that all the state of
5868 the process is contained in the stack. */
5869 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
5870 needed on ia64 too. See mach_dep.c, where it also says inline
5871 assembler doesn't work with relevant proprietary compilers. */
5873 #if defined (__sparc64__) && defined (__FreeBSD__)
5874 /* FreeBSD does not have a ta 3 handler. */
5881 /* Save registers that we need to see on the stack. We need to see
5882 registers used to hold register variables and registers used to
5884 #ifdef GC_SAVE_REGISTERS_ON_STACK
5885 GC_SAVE_REGISTERS_ON_STACK (end
);
5886 #else /* not GC_SAVE_REGISTERS_ON_STACK */
5888 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
5889 setjmp will definitely work, test it
5890 and print a message with the result
5892 if (!setjmp_tested_p
)
5894 setjmp_tested_p
= 1;
5897 #endif /* GC_SETJMP_WORKS */
5900 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
5901 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
5902 #endif /* not HAVE___BUILTIN_UNWIND_INIT */
5903 return garbage_collect_1 (end
);
5904 #elif (GC_MARK_STACK == GC_USE_GCPROS_AS_BEFORE)
5905 /* Old GCPROs-based method without stack marking. */
5906 return garbage_collect_1 (NULL
);
5909 #endif /* GC_MARK_STACK */
5912 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5913 only interesting objects referenced from glyphs are strings. */
5916 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5918 struct glyph_row
*row
= matrix
->rows
;
5919 struct glyph_row
*end
= row
+ matrix
->nrows
;
5921 for (; row
< end
; ++row
)
5925 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5927 struct glyph
*glyph
= row
->glyphs
[area
];
5928 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5930 for (; glyph
< end_glyph
; ++glyph
)
5931 if (STRINGP (glyph
->object
)
5932 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5933 mark_object (glyph
->object
);
5938 /* Mark reference to a Lisp_Object.
5939 If the object referred to has not been seen yet, recursively mark
5940 all the references contained in it. */
5942 #define LAST_MARKED_SIZE 500
5943 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5944 static int last_marked_index
;
5946 /* For debugging--call abort when we cdr down this many
5947 links of a list, in mark_object. In debugging,
5948 the call to abort will hit a breakpoint.
5949 Normally this is zero and the check never goes off. */
5950 ptrdiff_t mark_object_loop_halt EXTERNALLY_VISIBLE
;
5953 mark_vectorlike (struct Lisp_Vector
*ptr
)
5955 ptrdiff_t size
= ptr
->header
.size
;
5958 eassert (!VECTOR_MARKED_P (ptr
));
5959 VECTOR_MARK (ptr
); /* Else mark it. */
5960 if (size
& PSEUDOVECTOR_FLAG
)
5961 size
&= PSEUDOVECTOR_SIZE_MASK
;
5963 /* Note that this size is not the memory-footprint size, but only
5964 the number of Lisp_Object fields that we should trace.
5965 The distinction is used e.g. by Lisp_Process which places extra
5966 non-Lisp_Object fields at the end of the structure... */
5967 for (i
= 0; i
< size
; i
++) /* ...and then mark its elements. */
5968 mark_object (ptr
->contents
[i
]);
5971 /* Like mark_vectorlike but optimized for char-tables (and
5972 sub-char-tables) assuming that the contents are mostly integers or
5976 mark_char_table (struct Lisp_Vector
*ptr
, enum pvec_type pvectype
)
5978 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5979 /* Consult the Lisp_Sub_Char_Table layout before changing this. */
5980 int i
, idx
= (pvectype
== PVEC_SUB_CHAR_TABLE
? SUB_CHAR_TABLE_OFFSET
: 0);
5982 eassert (!VECTOR_MARKED_P (ptr
));
5984 for (i
= idx
; i
< size
; i
++)
5986 Lisp_Object val
= ptr
->contents
[i
];
5988 if (INTEGERP (val
) || (SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
))
5990 if (SUB_CHAR_TABLE_P (val
))
5992 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5993 mark_char_table (XVECTOR (val
), PVEC_SUB_CHAR_TABLE
);
6000 NO_INLINE
/* To reduce stack depth in mark_object. */
6002 mark_compiled (struct Lisp_Vector
*ptr
)
6004 int i
, size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
6007 for (i
= 0; i
< size
; i
++)
6008 if (i
!= COMPILED_CONSTANTS
)
6009 mark_object (ptr
->contents
[i
]);
6010 return size
> COMPILED_CONSTANTS
? ptr
->contents
[COMPILED_CONSTANTS
] : Qnil
;
6013 /* Mark the chain of overlays starting at PTR. */
6016 mark_overlay (struct Lisp_Overlay
*ptr
)
6018 for (; ptr
&& !ptr
->gcmarkbit
; ptr
= ptr
->next
)
6021 /* These two are always markers and can be marked fast. */
6022 XMARKER (ptr
->start
)->gcmarkbit
= 1;
6023 XMARKER (ptr
->end
)->gcmarkbit
= 1;
6024 mark_object (ptr
->plist
);
6028 /* Mark Lisp_Objects and special pointers in BUFFER. */
6031 mark_buffer (struct buffer
*buffer
)
6033 /* This is handled much like other pseudovectors... */
6034 mark_vectorlike ((struct Lisp_Vector
*) buffer
);
6036 /* ...but there are some buffer-specific things. */
6038 MARK_INTERVAL_TREE (buffer_intervals (buffer
));
6040 /* For now, we just don't mark the undo_list. It's done later in
6041 a special way just before the sweep phase, and after stripping
6042 some of its elements that are not needed any more. */
6044 mark_overlay (buffer
->overlays_before
);
6045 mark_overlay (buffer
->overlays_after
);
6047 /* If this is an indirect buffer, mark its base buffer. */
6048 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
6049 mark_buffer (buffer
->base_buffer
);
6052 /* Mark Lisp faces in the face cache C. */
6054 NO_INLINE
/* To reduce stack depth in mark_object. */
6056 mark_face_cache (struct face_cache
*c
)
6061 for (i
= 0; i
< c
->used
; ++i
)
6063 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
6067 if (face
->font
&& !VECTOR_MARKED_P (face
->font
))
6068 mark_vectorlike ((struct Lisp_Vector
*) face
->font
);
6070 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
6071 mark_object (face
->lface
[j
]);
6077 NO_INLINE
/* To reduce stack depth in mark_object. */
6079 mark_localized_symbol (struct Lisp_Symbol
*ptr
)
6081 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
6082 Lisp_Object where
= blv
->where
;
6083 /* If the value is set up for a killed buffer or deleted
6084 frame, restore its global binding. If the value is
6085 forwarded to a C variable, either it's not a Lisp_Object
6086 var, or it's staticpro'd already. */
6087 if ((BUFFERP (where
) && !BUFFER_LIVE_P (XBUFFER (where
)))
6088 || (FRAMEP (where
) && !FRAME_LIVE_P (XFRAME (where
))))
6089 swap_in_global_binding (ptr
);
6090 mark_object (blv
->where
);
6091 mark_object (blv
->valcell
);
6092 mark_object (blv
->defcell
);
6095 NO_INLINE
/* To reduce stack depth in mark_object. */
6097 mark_save_value (struct Lisp_Save_Value
*ptr
)
6099 /* If `save_type' is zero, `data[0].pointer' is the address
6100 of a memory area containing `data[1].integer' potential
6102 if (GC_MARK_STACK
&& ptr
->save_type
== SAVE_TYPE_MEMORY
)
6104 Lisp_Object
*p
= ptr
->data
[0].pointer
;
6106 for (nelt
= ptr
->data
[1].integer
; nelt
> 0; nelt
--, p
++)
6107 mark_maybe_object (*p
);
6111 /* Find Lisp_Objects in `data[N]' slots and mark them. */
6113 for (i
= 0; i
< SAVE_VALUE_SLOTS
; i
++)
6114 if (save_type (ptr
, i
) == SAVE_OBJECT
)
6115 mark_object (ptr
->data
[i
].object
);
6119 /* Remove killed buffers or items whose car is a killed buffer from
6120 LIST, and mark other items. Return changed LIST, which is marked. */
6123 mark_discard_killed_buffers (Lisp_Object list
)
6125 Lisp_Object tail
, *prev
= &list
;
6127 for (tail
= list
; CONSP (tail
) && !CONS_MARKED_P (XCONS (tail
));
6130 Lisp_Object tem
= XCAR (tail
);
6133 if (BUFFERP (tem
) && !BUFFER_LIVE_P (XBUFFER (tem
)))
6134 *prev
= XCDR (tail
);
6137 CONS_MARK (XCONS (tail
));
6138 mark_object (XCAR (tail
));
6139 prev
= xcdr_addr (tail
);
6146 /* Determine type of generic Lisp_Object and mark it accordingly.
6148 This function implements a straightforward depth-first marking
6149 algorithm and so the recursion depth may be very high (a few
6150 tens of thousands is not uncommon). To minimize stack usage,
6151 a few cold paths are moved out to NO_INLINE functions above.
6152 In general, inlining them doesn't help you to gain more speed. */
6155 mark_object (Lisp_Object arg
)
6157 register Lisp_Object obj
= arg
;
6158 #ifdef GC_CHECK_MARKED_OBJECTS
6162 ptrdiff_t cdr_count
= 0;
6166 if (PURE_POINTER_P (XPNTR (obj
)))
6169 last_marked
[last_marked_index
++] = obj
;
6170 if (last_marked_index
== LAST_MARKED_SIZE
)
6171 last_marked_index
= 0;
6173 /* Perform some sanity checks on the objects marked here. Abort if
6174 we encounter an object we know is bogus. This increases GC time
6175 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
6176 #ifdef GC_CHECK_MARKED_OBJECTS
6178 po
= (void *) XPNTR (obj
);
6180 /* Check that the object pointed to by PO is known to be a Lisp
6181 structure allocated from the heap. */
6182 #define CHECK_ALLOCATED() \
6184 m = mem_find (po); \
6189 /* Check that the object pointed to by PO is live, using predicate
6191 #define CHECK_LIVE(LIVEP) \
6193 if (!LIVEP (m, po)) \
6197 /* Check both of the above conditions. */
6198 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
6200 CHECK_ALLOCATED (); \
6201 CHECK_LIVE (LIVEP); \
6204 #else /* not GC_CHECK_MARKED_OBJECTS */
6206 #define CHECK_LIVE(LIVEP) (void) 0
6207 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
6209 #endif /* not GC_CHECK_MARKED_OBJECTS */
6211 switch (XTYPE (obj
))
6215 register struct Lisp_String
*ptr
= XSTRING (obj
);
6216 if (STRING_MARKED_P (ptr
))
6218 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
6220 MARK_INTERVAL_TREE (ptr
->intervals
);
6221 #ifdef GC_CHECK_STRING_BYTES
6222 /* Check that the string size recorded in the string is the
6223 same as the one recorded in the sdata structure. */
6225 #endif /* GC_CHECK_STRING_BYTES */
6229 case Lisp_Vectorlike
:
6231 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
6232 register ptrdiff_t pvectype
;
6234 if (VECTOR_MARKED_P (ptr
))
6237 #ifdef GC_CHECK_MARKED_OBJECTS
6239 if (m
== MEM_NIL
&& !SUBRP (obj
))
6241 #endif /* GC_CHECK_MARKED_OBJECTS */
6243 if (ptr
->header
.size
& PSEUDOVECTOR_FLAG
)
6244 pvectype
= ((ptr
->header
.size
& PVEC_TYPE_MASK
)
6245 >> PSEUDOVECTOR_AREA_BITS
);
6247 pvectype
= PVEC_NORMAL_VECTOR
;
6249 if (pvectype
!= PVEC_SUBR
&& pvectype
!= PVEC_BUFFER
)
6250 CHECK_LIVE (live_vector_p
);
6255 #ifdef GC_CHECK_MARKED_OBJECTS
6264 #endif /* GC_CHECK_MARKED_OBJECTS */
6265 mark_buffer ((struct buffer
*) ptr
);
6269 /* Although we could treat this just like a vector, mark_compiled
6270 returns the COMPILED_CONSTANTS element, which is marked at the
6271 next iteration of goto-loop here. This is done to avoid a few
6272 recursive calls to mark_object. */
6273 obj
= mark_compiled (ptr
);
6280 struct frame
*f
= (struct frame
*) ptr
;
6282 mark_vectorlike (ptr
);
6283 mark_face_cache (f
->face_cache
);
6284 #ifdef HAVE_WINDOW_SYSTEM
6285 if (FRAME_WINDOW_P (f
) && FRAME_X_OUTPUT (f
))
6287 struct font
*font
= FRAME_FONT (f
);
6289 if (font
&& !VECTOR_MARKED_P (font
))
6290 mark_vectorlike ((struct Lisp_Vector
*) font
);
6298 struct window
*w
= (struct window
*) ptr
;
6300 mark_vectorlike (ptr
);
6302 /* Mark glyph matrices, if any. Marking window
6303 matrices is sufficient because frame matrices
6304 use the same glyph memory. */
6305 if (w
->current_matrix
)
6307 mark_glyph_matrix (w
->current_matrix
);
6308 mark_glyph_matrix (w
->desired_matrix
);
6311 /* Filter out killed buffers from both buffer lists
6312 in attempt to help GC to reclaim killed buffers faster.
6313 We can do it elsewhere for live windows, but this is the
6314 best place to do it for dead windows. */
6316 (w
, mark_discard_killed_buffers (w
->prev_buffers
));
6318 (w
, mark_discard_killed_buffers (w
->next_buffers
));
6322 case PVEC_HASH_TABLE
:
6324 struct Lisp_Hash_Table
*h
= (struct Lisp_Hash_Table
*) ptr
;
6326 mark_vectorlike (ptr
);
6327 mark_object (h
->test
.name
);
6328 mark_object (h
->test
.user_hash_function
);
6329 mark_object (h
->test
.user_cmp_function
);
6330 /* If hash table is not weak, mark all keys and values.
6331 For weak tables, mark only the vector. */
6333 mark_object (h
->key_and_value
);
6335 VECTOR_MARK (XVECTOR (h
->key_and_value
));
6339 case PVEC_CHAR_TABLE
:
6340 case PVEC_SUB_CHAR_TABLE
:
6341 mark_char_table (ptr
, (enum pvec_type
) pvectype
);
6344 case PVEC_BOOL_VECTOR
:
6345 /* No Lisp_Objects to mark in a bool vector. */
6356 mark_vectorlike (ptr
);
6363 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
6367 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
6369 /* Attempt to catch bogus objects. */
6370 eassert (valid_lisp_object_p (ptr
->function
));
6371 mark_object (ptr
->function
);
6372 mark_object (ptr
->plist
);
6373 switch (ptr
->redirect
)
6375 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
6376 case SYMBOL_VARALIAS
:
6379 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
6383 case SYMBOL_LOCALIZED
:
6384 mark_localized_symbol (ptr
);
6386 case SYMBOL_FORWARDED
:
6387 /* If the value is forwarded to a buffer or keyboard field,
6388 these are marked when we see the corresponding object.
6389 And if it's forwarded to a C variable, either it's not
6390 a Lisp_Object var, or it's staticpro'd already. */
6392 default: emacs_abort ();
6394 if (!PURE_POINTER_P (XSTRING (ptr
->name
)))
6395 MARK_STRING (XSTRING (ptr
->name
));
6396 MARK_INTERVAL_TREE (string_intervals (ptr
->name
));
6397 /* Inner loop to mark next symbol in this bucket, if any. */
6405 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
6407 if (XMISCANY (obj
)->gcmarkbit
)
6410 switch (XMISCTYPE (obj
))
6412 case Lisp_Misc_Marker
:
6413 /* DO NOT mark thru the marker's chain.
6414 The buffer's markers chain does not preserve markers from gc;
6415 instead, markers are removed from the chain when freed by gc. */
6416 XMISCANY (obj
)->gcmarkbit
= 1;
6419 case Lisp_Misc_Save_Value
:
6420 XMISCANY (obj
)->gcmarkbit
= 1;
6421 mark_save_value (XSAVE_VALUE (obj
));
6424 case Lisp_Misc_Overlay
:
6425 mark_overlay (XOVERLAY (obj
));
6435 register struct Lisp_Cons
*ptr
= XCONS (obj
);
6436 if (CONS_MARKED_P (ptr
))
6438 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
6440 /* If the cdr is nil, avoid recursion for the car. */
6441 if (EQ (ptr
->u
.cdr
, Qnil
))
6447 mark_object (ptr
->car
);
6450 if (cdr_count
== mark_object_loop_halt
)
6456 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
6457 FLOAT_MARK (XFLOAT (obj
));
6468 #undef CHECK_ALLOCATED
6469 #undef CHECK_ALLOCATED_AND_LIVE
6471 /* Mark the Lisp pointers in the terminal objects.
6472 Called by Fgarbage_collect. */
6475 mark_terminals (void)
6478 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
6480 eassert (t
->name
!= NULL
);
6481 #ifdef HAVE_WINDOW_SYSTEM
6482 /* If a terminal object is reachable from a stacpro'ed object,
6483 it might have been marked already. Make sure the image cache
6485 mark_image_cache (t
->image_cache
);
6486 #endif /* HAVE_WINDOW_SYSTEM */
6487 if (!VECTOR_MARKED_P (t
))
6488 mark_vectorlike ((struct Lisp_Vector
*)t
);
6494 /* Value is non-zero if OBJ will survive the current GC because it's
6495 either marked or does not need to be marked to survive. */
6498 survives_gc_p (Lisp_Object obj
)
6502 switch (XTYPE (obj
))
6509 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
6513 survives_p
= XMISCANY (obj
)->gcmarkbit
;
6517 survives_p
= STRING_MARKED_P (XSTRING (obj
));
6520 case Lisp_Vectorlike
:
6521 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
6525 survives_p
= CONS_MARKED_P (XCONS (obj
));
6529 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
6536 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
6542 NO_INLINE
/* For better stack traces */
6546 struct cons_block
*cblk
;
6547 struct cons_block
**cprev
= &cons_block
;
6548 int lim
= cons_block_index
;
6549 EMACS_INT num_free
= 0, num_used
= 0;
6553 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
6557 int ilim
= (lim
+ BITS_PER_BITS_WORD
- 1) / BITS_PER_BITS_WORD
;
6559 /* Scan the mark bits an int at a time. */
6560 for (i
= 0; i
< ilim
; i
++)
6562 if (cblk
->gcmarkbits
[i
] == BITS_WORD_MAX
)
6564 /* Fast path - all cons cells for this int are marked. */
6565 cblk
->gcmarkbits
[i
] = 0;
6566 num_used
+= BITS_PER_BITS_WORD
;
6570 /* Some cons cells for this int are not marked.
6571 Find which ones, and free them. */
6572 int start
, pos
, stop
;
6574 start
= i
* BITS_PER_BITS_WORD
;
6576 if (stop
> BITS_PER_BITS_WORD
)
6577 stop
= BITS_PER_BITS_WORD
;
6580 for (pos
= start
; pos
< stop
; pos
++)
6582 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
6585 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
6586 cons_free_list
= &cblk
->conses
[pos
];
6588 cons_free_list
->car
= Vdead
;
6594 CONS_UNMARK (&cblk
->conses
[pos
]);
6600 lim
= CONS_BLOCK_SIZE
;
6601 /* If this block contains only free conses and we have already
6602 seen more than two blocks worth of free conses then deallocate
6604 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
6606 *cprev
= cblk
->next
;
6607 /* Unhook from the free list. */
6608 cons_free_list
= cblk
->conses
[0].u
.chain
;
6609 lisp_align_free (cblk
);
6613 num_free
+= this_free
;
6614 cprev
= &cblk
->next
;
6617 total_conses
= num_used
;
6618 total_free_conses
= num_free
;
6621 NO_INLINE
/* For better stack traces */
6625 register struct float_block
*fblk
;
6626 struct float_block
**fprev
= &float_block
;
6627 register int lim
= float_block_index
;
6628 EMACS_INT num_free
= 0, num_used
= 0;
6630 float_free_list
= 0;
6632 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
6636 for (i
= 0; i
< lim
; i
++)
6637 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
6640 fblk
->floats
[i
].u
.chain
= float_free_list
;
6641 float_free_list
= &fblk
->floats
[i
];
6646 FLOAT_UNMARK (&fblk
->floats
[i
]);
6648 lim
= FLOAT_BLOCK_SIZE
;
6649 /* If this block contains only free floats and we have already
6650 seen more than two blocks worth of free floats then deallocate
6652 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
6654 *fprev
= fblk
->next
;
6655 /* Unhook from the free list. */
6656 float_free_list
= fblk
->floats
[0].u
.chain
;
6657 lisp_align_free (fblk
);
6661 num_free
+= this_free
;
6662 fprev
= &fblk
->next
;
6665 total_floats
= num_used
;
6666 total_free_floats
= num_free
;
6669 NO_INLINE
/* For better stack traces */
6671 sweep_intervals (void)
6673 register struct interval_block
*iblk
;
6674 struct interval_block
**iprev
= &interval_block
;
6675 register int lim
= interval_block_index
;
6676 EMACS_INT num_free
= 0, num_used
= 0;
6678 interval_free_list
= 0;
6680 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
6685 for (i
= 0; i
< lim
; i
++)
6687 if (!iblk
->intervals
[i
].gcmarkbit
)
6689 set_interval_parent (&iblk
->intervals
[i
], interval_free_list
);
6690 interval_free_list
= &iblk
->intervals
[i
];
6696 iblk
->intervals
[i
].gcmarkbit
= 0;
6699 lim
= INTERVAL_BLOCK_SIZE
;
6700 /* If this block contains only free intervals and we have already
6701 seen more than two blocks worth of free intervals then
6702 deallocate this block. */
6703 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
6705 *iprev
= iblk
->next
;
6706 /* Unhook from the free list. */
6707 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
6712 num_free
+= this_free
;
6713 iprev
= &iblk
->next
;
6716 total_intervals
= num_used
;
6717 total_free_intervals
= num_free
;
6720 NO_INLINE
/* For better stack traces */
6722 sweep_symbols (void)
6724 register struct symbol_block
*sblk
;
6725 struct symbol_block
**sprev
= &symbol_block
;
6726 register int lim
= symbol_block_index
;
6727 EMACS_INT num_free
= 0, num_used
= 0;
6729 symbol_free_list
= NULL
;
6731 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
6734 union aligned_Lisp_Symbol
*sym
= sblk
->symbols
;
6735 union aligned_Lisp_Symbol
*end
= sym
+ lim
;
6737 for (; sym
< end
; ++sym
)
6739 if (!sym
->s
.gcmarkbit
)
6741 if (sym
->s
.redirect
== SYMBOL_LOCALIZED
)
6742 xfree (SYMBOL_BLV (&sym
->s
));
6743 sym
->s
.next
= symbol_free_list
;
6744 symbol_free_list
= &sym
->s
;
6746 symbol_free_list
->function
= Vdead
;
6753 sym
->s
.gcmarkbit
= 0;
6754 /* Attempt to catch bogus objects. */
6755 eassert (valid_lisp_object_p (sym
->s
.function
));
6759 lim
= SYMBOL_BLOCK_SIZE
;
6760 /* If this block contains only free symbols and we have already
6761 seen more than two blocks worth of free symbols then deallocate
6763 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6765 *sprev
= sblk
->next
;
6766 /* Unhook from the free list. */
6767 symbol_free_list
= sblk
->symbols
[0].s
.next
;
6772 num_free
+= this_free
;
6773 sprev
= &sblk
->next
;
6776 total_symbols
= num_used
;
6777 total_free_symbols
= num_free
;
6780 NO_INLINE
/* For better stack traces */
6784 register struct marker_block
*mblk
;
6785 struct marker_block
**mprev
= &marker_block
;
6786 register int lim
= marker_block_index
;
6787 EMACS_INT num_free
= 0, num_used
= 0;
6789 /* Put all unmarked misc's on free list. For a marker, first
6790 unchain it from the buffer it points into. */
6792 marker_free_list
= 0;
6794 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6799 for (i
= 0; i
< lim
; i
++)
6801 if (!mblk
->markers
[i
].m
.u_any
.gcmarkbit
)
6803 if (mblk
->markers
[i
].m
.u_any
.type
== Lisp_Misc_Marker
)
6804 unchain_marker (&mblk
->markers
[i
].m
.u_marker
);
6805 /* Set the type of the freed object to Lisp_Misc_Free.
6806 We could leave the type alone, since nobody checks it,
6807 but this might catch bugs faster. */
6808 mblk
->markers
[i
].m
.u_marker
.type
= Lisp_Misc_Free
;
6809 mblk
->markers
[i
].m
.u_free
.chain
= marker_free_list
;
6810 marker_free_list
= &mblk
->markers
[i
].m
;
6816 mblk
->markers
[i
].m
.u_any
.gcmarkbit
= 0;
6819 lim
= MARKER_BLOCK_SIZE
;
6820 /* If this block contains only free markers and we have already
6821 seen more than two blocks worth of free markers then deallocate
6823 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6825 *mprev
= mblk
->next
;
6826 /* Unhook from the free list. */
6827 marker_free_list
= mblk
->markers
[0].m
.u_free
.chain
;
6832 num_free
+= this_free
;
6833 mprev
= &mblk
->next
;
6837 total_markers
= num_used
;
6838 total_free_markers
= num_free
;
6841 NO_INLINE
/* For better stack traces */
6843 sweep_buffers (void)
6845 register struct buffer
*buffer
, **bprev
= &all_buffers
;
6848 for (buffer
= all_buffers
; buffer
; buffer
= *bprev
)
6849 if (!VECTOR_MARKED_P (buffer
))
6851 *bprev
= buffer
->next
;
6856 VECTOR_UNMARK (buffer
);
6857 /* Do not use buffer_(set|get)_intervals here. */
6858 buffer
->text
->intervals
= balance_intervals (buffer
->text
->intervals
);
6860 bprev
= &buffer
->next
;
6864 /* Sweep: find all structures not marked, and free them. */
6868 /* Remove or mark entries in weak hash tables.
6869 This must be done before any object is unmarked. */
6870 sweep_weak_hash_tables ();
6873 check_string_bytes (!noninteractive
);
6881 check_string_bytes (!noninteractive
);
6884 DEFUN ("memory-info", Fmemory_info
, Smemory_info
, 0, 0, 0,
6885 doc
: /* Return a list of (TOTAL-RAM FREE-RAM TOTAL-SWAP FREE-SWAP).
6886 All values are in Kbytes. If there is no swap space,
6887 last two values are zero. If the system is not supported
6888 or memory information can't be obtained, return nil. */)
6891 #if defined HAVE_LINUX_SYSINFO
6897 #ifdef LINUX_SYSINFO_UNIT
6898 units
= si
.mem_unit
;
6902 return list4i ((uintmax_t) si
.totalram
* units
/ 1024,
6903 (uintmax_t) si
.freeram
* units
/ 1024,
6904 (uintmax_t) si
.totalswap
* units
/ 1024,
6905 (uintmax_t) si
.freeswap
* units
/ 1024);
6906 #elif defined WINDOWSNT
6907 unsigned long long totalram
, freeram
, totalswap
, freeswap
;
6909 if (w32_memory_info (&totalram
, &freeram
, &totalswap
, &freeswap
) == 0)
6910 return list4i ((uintmax_t) totalram
/ 1024,
6911 (uintmax_t) freeram
/ 1024,
6912 (uintmax_t) totalswap
/ 1024,
6913 (uintmax_t) freeswap
/ 1024);
6917 unsigned long totalram
, freeram
, totalswap
, freeswap
;
6919 if (dos_memory_info (&totalram
, &freeram
, &totalswap
, &freeswap
) == 0)
6920 return list4i ((uintmax_t) totalram
/ 1024,
6921 (uintmax_t) freeram
/ 1024,
6922 (uintmax_t) totalswap
/ 1024,
6923 (uintmax_t) freeswap
/ 1024);
6926 #else /* not HAVE_LINUX_SYSINFO, not WINDOWSNT, not MSDOS */
6927 /* FIXME: add more systems. */
6929 #endif /* HAVE_LINUX_SYSINFO, not WINDOWSNT, not MSDOS */
6932 /* Debugging aids. */
6934 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6935 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6936 This may be helpful in debugging Emacs's memory usage.
6937 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6943 /* Avoid warning. sbrk has no relation to memory allocated anyway. */
6946 XSETINT (end
, (intptr_t) (char *) sbrk (0) / 1024);
6952 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6953 doc
: /* Return a list of counters that measure how much consing there has been.
6954 Each of these counters increments for a certain kind of object.
6955 The counters wrap around from the largest positive integer to zero.
6956 Garbage collection does not decrease them.
6957 The elements of the value are as follows:
6958 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6959 All are in units of 1 = one object consed
6960 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6962 MISCS include overlays, markers, and some internal types.
6963 Frames, windows, buffers, and subprocesses count as vectors
6964 (but the contents of a buffer's text do not count here). */)
6967 return listn (CONSTYPE_HEAP
, 8,
6968 bounded_number (cons_cells_consed
),
6969 bounded_number (floats_consed
),
6970 bounded_number (vector_cells_consed
),
6971 bounded_number (symbols_consed
),
6972 bounded_number (string_chars_consed
),
6973 bounded_number (misc_objects_consed
),
6974 bounded_number (intervals_consed
),
6975 bounded_number (strings_consed
));
6978 /* Find at most FIND_MAX symbols which have OBJ as their value or
6979 function. This is used in gdbinit's `xwhichsymbols' command. */
6982 which_symbols (Lisp_Object obj
, EMACS_INT find_max
)
6984 struct symbol_block
*sblk
;
6985 ptrdiff_t gc_count
= inhibit_garbage_collection ();
6986 Lisp_Object found
= Qnil
;
6990 for (sblk
= symbol_block
; sblk
; sblk
= sblk
->next
)
6992 union aligned_Lisp_Symbol
*aligned_sym
= sblk
->symbols
;
6995 for (bn
= 0; bn
< SYMBOL_BLOCK_SIZE
; bn
++, aligned_sym
++)
6997 struct Lisp_Symbol
*sym
= &aligned_sym
->s
;
7001 if (sblk
== symbol_block
&& bn
>= symbol_block_index
)
7004 XSETSYMBOL (tem
, sym
);
7005 val
= find_symbol_value (tem
);
7007 || EQ (sym
->function
, obj
)
7008 || (!NILP (sym
->function
)
7009 && COMPILEDP (sym
->function
)
7010 && EQ (AREF (sym
->function
, COMPILED_BYTECODE
), obj
))
7013 && EQ (AREF (val
, COMPILED_BYTECODE
), obj
)))
7015 found
= Fcons (tem
, found
);
7016 if (--find_max
== 0)
7024 unbind_to (gc_count
, Qnil
);
7028 #ifdef SUSPICIOUS_OBJECT_CHECKING
7031 find_suspicious_object_in_range (void *begin
, void *end
)
7033 char *begin_a
= begin
;
7037 for (i
= 0; i
< ARRAYELTS (suspicious_objects
); ++i
)
7039 char *suspicious_object
= suspicious_objects
[i
];
7040 if (begin_a
<= suspicious_object
&& suspicious_object
< end_a
)
7041 return suspicious_object
;
7048 note_suspicious_free (void* ptr
)
7050 struct suspicious_free_record
* rec
;
7052 rec
= &suspicious_free_history
[suspicious_free_history_index
++];
7053 if (suspicious_free_history_index
==
7054 ARRAYELTS (suspicious_free_history
))
7056 suspicious_free_history_index
= 0;
7059 memset (rec
, 0, sizeof (*rec
));
7060 rec
->suspicious_object
= ptr
;
7061 backtrace (&rec
->backtrace
[0], ARRAYELTS (rec
->backtrace
));
7065 detect_suspicious_free (void* ptr
)
7069 eassert (ptr
!= NULL
);
7071 for (i
= 0; i
< ARRAYELTS (suspicious_objects
); ++i
)
7072 if (suspicious_objects
[i
] == ptr
)
7074 note_suspicious_free (ptr
);
7075 suspicious_objects
[i
] = NULL
;
7079 #endif /* SUSPICIOUS_OBJECT_CHECKING */
7081 DEFUN ("suspicious-object", Fsuspicious_object
, Ssuspicious_object
, 1, 1, 0,
7082 doc
: /* Return OBJ, maybe marking it for extra scrutiny.
7083 If Emacs is compiled with suspicious object checking, capture
7084 a stack trace when OBJ is freed in order to help track down
7085 garbage collection bugs. Otherwise, do nothing and return OBJ. */)
7088 #ifdef SUSPICIOUS_OBJECT_CHECKING
7089 /* Right now, we care only about vectors. */
7090 if (VECTORLIKEP (obj
))
7092 suspicious_objects
[suspicious_object_index
++] = XVECTOR (obj
);
7093 if (suspicious_object_index
== ARRAYELTS (suspicious_objects
))
7094 suspicious_object_index
= 0;
7100 #ifdef ENABLE_CHECKING
7102 bool suppress_checking
;
7105 die (const char *msg
, const char *file
, int line
)
7107 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: assertion failed: %s\r\n",
7109 terminate_due_to_signal (SIGABRT
, INT_MAX
);
7112 #endif /* ENABLE_CHECKING */
7114 #if defined (ENABLE_CHECKING) && USE_STACK_LISP_OBJECTS
7116 /* Debugging check whether STR is ASCII-only. */
7119 verify_ascii (const char *str
)
7121 const unsigned char *ptr
= (unsigned char *) str
, *end
= ptr
+ strlen (str
);
7124 int c
= STRING_CHAR_ADVANCE (ptr
);
7125 if (!ASCII_CHAR_P (c
))
7131 /* Stress alloca with inconveniently sized requests and check
7132 whether all allocated areas may be used for Lisp_Object. */
7134 NO_INLINE
static void
7135 verify_alloca (void)
7138 enum { ALLOCA_CHECK_MAX
= 256 };
7139 /* Start from size of the smallest Lisp object. */
7140 for (i
= sizeof (struct Lisp_Cons
); i
<= ALLOCA_CHECK_MAX
; i
++)
7142 void *ptr
= alloca (i
);
7143 make_lisp_ptr (ptr
, Lisp_Cons
);
7147 #else /* not ENABLE_CHECKING && USE_STACK_LISP_OBJECTS */
7149 #define verify_alloca() ((void) 0)
7151 #endif /* ENABLE_CHECKING && USE_STACK_LISP_OBJECTS */
7153 /* Initialization. */
7156 init_alloc_once (void)
7158 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
7160 pure_size
= PURESIZE
;
7164 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
7166 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
7169 #ifdef DOUG_LEA_MALLOC
7170 mallopt (M_TRIM_THRESHOLD
, 128 * 1024); /* Trim threshold. */
7171 mallopt (M_MMAP_THRESHOLD
, 64 * 1024); /* Mmap threshold. */
7172 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* Max. number of mmap'ed areas. */
7177 refill_memory_reserve ();
7178 gc_cons_threshold
= GC_DEFAULT_THRESHOLD
;
7185 byte_stack_list
= 0;
7187 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
7188 setjmp_tested_p
= longjmps_done
= 0;
7191 Vgc_elapsed
= make_float (0.0);
7195 valgrind_p
= RUNNING_ON_VALGRIND
!= 0;
7200 syms_of_alloc (void)
7202 DEFVAR_INT ("gc-cons-threshold", gc_cons_threshold
,
7203 doc
: /* Number of bytes of consing between garbage collections.
7204 Garbage collection can happen automatically once this many bytes have been
7205 allocated since the last garbage collection. All data types count.
7207 Garbage collection happens automatically only when `eval' is called.
7209 By binding this temporarily to a large number, you can effectively
7210 prevent garbage collection during a part of the program.
7211 See also `gc-cons-percentage'. */);
7213 DEFVAR_LISP ("gc-cons-percentage", Vgc_cons_percentage
,
7214 doc
: /* Portion of the heap used for allocation.
7215 Garbage collection can happen automatically once this portion of the heap
7216 has been allocated since the last garbage collection.
7217 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
7218 Vgc_cons_percentage
= make_float (0.1);
7220 DEFVAR_INT ("pure-bytes-used", pure_bytes_used
,
7221 doc
: /* Number of bytes of shareable Lisp data allocated so far. */);
7223 DEFVAR_INT ("cons-cells-consed", cons_cells_consed
,
7224 doc
: /* Number of cons cells that have been consed so far. */);
7226 DEFVAR_INT ("floats-consed", floats_consed
,
7227 doc
: /* Number of floats that have been consed so far. */);
7229 DEFVAR_INT ("vector-cells-consed", vector_cells_consed
,
7230 doc
: /* Number of vector cells that have been consed so far. */);
7232 DEFVAR_INT ("symbols-consed", symbols_consed
,
7233 doc
: /* Number of symbols that have been consed so far. */);
7235 DEFVAR_INT ("string-chars-consed", string_chars_consed
,
7236 doc
: /* Number of string characters that have been consed so far. */);
7238 DEFVAR_INT ("misc-objects-consed", misc_objects_consed
,
7239 doc
: /* Number of miscellaneous objects that have been consed so far.
7240 These include markers and overlays, plus certain objects not visible
7243 DEFVAR_INT ("intervals-consed", intervals_consed
,
7244 doc
: /* Number of intervals that have been consed so far. */);
7246 DEFVAR_INT ("strings-consed", strings_consed
,
7247 doc
: /* Number of strings that have been consed so far. */);
7249 DEFVAR_LISP ("purify-flag", Vpurify_flag
,
7250 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
7251 This means that certain objects should be allocated in shared (pure) space.
7252 It can also be set to a hash-table, in which case this table is used to
7253 do hash-consing of the objects allocated to pure space. */);
7255 DEFVAR_BOOL ("garbage-collection-messages", garbage_collection_messages
,
7256 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
7257 garbage_collection_messages
= 0;
7259 DEFVAR_LISP ("post-gc-hook", Vpost_gc_hook
,
7260 doc
: /* Hook run after garbage collection has finished. */);
7261 Vpost_gc_hook
= Qnil
;
7262 DEFSYM (Qpost_gc_hook
, "post-gc-hook");
7264 DEFVAR_LISP ("memory-signal-data", Vmemory_signal_data
,
7265 doc
: /* Precomputed `signal' argument for memory-full error. */);
7266 /* We build this in advance because if we wait until we need it, we might
7267 not be able to allocate the memory to hold it. */
7269 = listn (CONSTYPE_PURE
, 2, Qerror
,
7270 build_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
7272 DEFVAR_LISP ("memory-full", Vmemory_full
,
7273 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
7274 Vmemory_full
= Qnil
;
7276 DEFSYM (Qconses
, "conses");
7277 DEFSYM (Qsymbols
, "symbols");
7278 DEFSYM (Qmiscs
, "miscs");
7279 DEFSYM (Qstrings
, "strings");
7280 DEFSYM (Qvectors
, "vectors");
7281 DEFSYM (Qfloats
, "floats");
7282 DEFSYM (Qintervals
, "intervals");
7283 DEFSYM (Qbuffers
, "buffers");
7284 DEFSYM (Qstring_bytes
, "string-bytes");
7285 DEFSYM (Qvector_slots
, "vector-slots");
7286 DEFSYM (Qheap
, "heap");
7287 DEFSYM (Qautomatic_gc
, "Automatic GC");
7289 DEFSYM (Qgc_cons_threshold
, "gc-cons-threshold");
7290 DEFSYM (Qchar_table_extra_slots
, "char-table-extra-slots");
7292 DEFVAR_LISP ("gc-elapsed", Vgc_elapsed
,
7293 doc
: /* Accumulated time elapsed in garbage collections.
7294 The time is in seconds as a floating point value. */);
7295 DEFVAR_INT ("gcs-done", gcs_done
,
7296 doc
: /* Accumulated number of garbage collections done. */);
7301 defsubr (&Sbool_vector
);
7302 defsubr (&Smake_byte_code
);
7303 defsubr (&Smake_list
);
7304 defsubr (&Smake_vector
);
7305 defsubr (&Smake_string
);
7306 defsubr (&Smake_bool_vector
);
7307 defsubr (&Smake_symbol
);
7308 defsubr (&Smake_marker
);
7309 defsubr (&Spurecopy
);
7310 defsubr (&Sgarbage_collect
);
7311 defsubr (&Smemory_limit
);
7312 defsubr (&Smemory_info
);
7313 defsubr (&Smemory_use_counts
);
7314 defsubr (&Ssuspicious_object
);
7316 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
7317 defsubr (&Sgc_status
);
7321 /* When compiled with GCC, GDB might say "No enum type named
7322 pvec_type" if we don't have at least one symbol with that type, and
7323 then xbacktrace could fail. Similarly for the other enums and
7324 their values. Some non-GCC compilers don't like these constructs. */
7328 enum CHARTAB_SIZE_BITS CHARTAB_SIZE_BITS
;
7329 enum char_table_specials char_table_specials
;
7330 enum char_bits char_bits
;
7331 enum CHECK_LISP_OBJECT_TYPE CHECK_LISP_OBJECT_TYPE
;
7332 enum DEFAULT_HASH_SIZE DEFAULT_HASH_SIZE
;
7333 enum Lisp_Bits Lisp_Bits
;
7334 enum Lisp_Compiled Lisp_Compiled
;
7335 enum maxargs maxargs
;
7336 enum MAX_ALLOCA MAX_ALLOCA
;
7337 enum More_Lisp_Bits More_Lisp_Bits
;
7338 enum pvec_type pvec_type
;
7339 } const EXTERNALLY_VISIBLE gdb_make_enums_visible
= {0};
7340 #endif /* __GNUC__ */