1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
3 Copyright (C) 1985-1986, 1988, 1993-1995, 1997-2013 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/>. */
23 #define LISP_INLINE EXTERN_INLINE
26 #include <limits.h> /* For CHAR_BIT. */
28 #ifdef ENABLE_CHECKING
29 #include <signal.h> /* For SIGABRT. */
38 #include "intervals.h"
40 #include "character.h"
45 #include "blockinput.h"
46 #include "termhooks.h" /* For struct terminal. */
50 /* GC_CHECK_MARKED_OBJECTS means do sanity checks on allocated objects.
51 Doable only if GC_MARK_STACK. */
53 # undef GC_CHECK_MARKED_OBJECTS
56 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
57 memory. Can do this only if using gmalloc.c and if not checking
60 #if (defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC \
61 || defined GC_CHECK_MARKED_OBJECTS)
62 #undef GC_MALLOC_CHECK
73 #include "w32heap.h" /* for sbrk */
76 #ifdef DOUG_LEA_MALLOC
80 /* Specify maximum number of areas to mmap. It would be nice to use a
81 value that explicitly means "no limit". */
83 #define MMAP_MAX_AREAS 100000000
85 #endif /* not DOUG_LEA_MALLOC */
87 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
88 to a struct Lisp_String. */
90 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
91 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
92 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
94 #define VECTOR_MARK(V) ((V)->header.size |= ARRAY_MARK_FLAG)
95 #define VECTOR_UNMARK(V) ((V)->header.size &= ~ARRAY_MARK_FLAG)
96 #define VECTOR_MARKED_P(V) (((V)->header.size & ARRAY_MARK_FLAG) != 0)
98 /* Default value of gc_cons_threshold (see below). */
100 #define GC_DEFAULT_THRESHOLD (100000 * word_size)
102 /* Global variables. */
103 struct emacs_globals globals
;
105 /* Number of bytes of consing done since the last gc. */
107 EMACS_INT consing_since_gc
;
109 /* Similar minimum, computed from Vgc_cons_percentage. */
111 EMACS_INT gc_relative_threshold
;
113 /* Minimum number of bytes of consing since GC before next GC,
114 when memory is full. */
116 EMACS_INT memory_full_cons_threshold
;
118 /* True during GC. */
122 /* True means abort if try to GC.
123 This is for code which is written on the assumption that
124 no GC will happen, so as to verify that assumption. */
128 /* Number of live and free conses etc. */
130 static EMACS_INT total_conses
, total_markers
, total_symbols
, total_buffers
;
131 static EMACS_INT total_free_conses
, total_free_markers
, total_free_symbols
;
132 static EMACS_INT total_free_floats
, total_floats
;
134 /* Points to memory space allocated as "spare", to be freed if we run
135 out of memory. We keep one large block, four cons-blocks, and
136 two string blocks. */
138 static char *spare_memory
[7];
140 /* Amount of spare memory to keep in large reserve block, or to see
141 whether this much is available when malloc fails on a larger request. */
143 #define SPARE_MEMORY (1 << 14)
145 /* Initialize it to a nonzero value to force it into data space
146 (rather than bss space). That way unexec will remap it into text
147 space (pure), on some systems. We have not implemented the
148 remapping on more recent systems because this is less important
149 nowadays than in the days of small memories and timesharing. */
151 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
152 #define PUREBEG (char *) pure
154 /* Pointer to the pure area, and its size. */
156 static char *purebeg
;
157 static ptrdiff_t pure_size
;
159 /* Number of bytes of pure storage used before pure storage overflowed.
160 If this is non-zero, this implies that an overflow occurred. */
162 static ptrdiff_t pure_bytes_used_before_overflow
;
164 /* True if P points into pure space. */
166 #define PURE_POINTER_P(P) \
167 ((uintptr_t) (P) - (uintptr_t) purebeg <= pure_size)
169 /* Index in pure at which next pure Lisp object will be allocated.. */
171 static ptrdiff_t pure_bytes_used_lisp
;
173 /* Number of bytes allocated for non-Lisp objects in pure storage. */
175 static ptrdiff_t pure_bytes_used_non_lisp
;
177 /* If nonzero, this is a warning delivered by malloc and not yet
180 const char *pending_malloc_warning
;
182 /* Maximum amount of C stack to save when a GC happens. */
184 #ifndef MAX_SAVE_STACK
185 #define MAX_SAVE_STACK 16000
188 /* Buffer in which we save a copy of the C stack at each GC. */
190 #if MAX_SAVE_STACK > 0
191 static char *stack_copy
;
192 static ptrdiff_t stack_copy_size
;
195 static Lisp_Object Qconses
;
196 static Lisp_Object Qsymbols
;
197 static Lisp_Object Qmiscs
;
198 static Lisp_Object Qstrings
;
199 static Lisp_Object Qvectors
;
200 static Lisp_Object Qfloats
;
201 static Lisp_Object Qintervals
;
202 static Lisp_Object Qbuffers
;
203 static Lisp_Object Qstring_bytes
, Qvector_slots
, Qheap
;
204 static Lisp_Object Qgc_cons_threshold
;
205 Lisp_Object Qautomatic_gc
;
206 Lisp_Object Qchar_table_extra_slots
;
208 /* Hook run after GC has finished. */
210 static Lisp_Object Qpost_gc_hook
;
212 static void free_save_value (Lisp_Object
);
213 static void mark_terminals (void);
214 static void gc_sweep (void);
215 static Lisp_Object
make_pure_vector (ptrdiff_t);
216 static void mark_buffer (struct buffer
*);
218 #if !defined REL_ALLOC || defined SYSTEM_MALLOC
219 static void refill_memory_reserve (void);
221 static void compact_small_strings (void);
222 static void free_large_strings (void);
223 extern Lisp_Object
which_symbols (Lisp_Object
, EMACS_INT
) EXTERNALLY_VISIBLE
;
225 /* When scanning the C stack for live Lisp objects, Emacs keeps track of
226 what memory allocated via lisp_malloc and lisp_align_malloc is intended
227 for what purpose. This enumeration specifies the type of memory. */
238 /* Since all non-bool pseudovectors are small enough to be
239 allocated from vector blocks, this memory type denotes
240 large regular vectors and large bool pseudovectors. */
242 /* Special type to denote vector blocks. */
243 MEM_TYPE_VECTOR_BLOCK
,
244 /* Special type to denote reserved memory. */
248 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
250 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
251 #include <stdio.h> /* For fprintf. */
254 /* A unique object in pure space used to make some Lisp objects
255 on free lists recognizable in O(1). */
257 static Lisp_Object Vdead
;
258 #define DEADP(x) EQ (x, Vdead)
260 #ifdef GC_MALLOC_CHECK
262 enum mem_type allocated_mem_type
;
264 #endif /* GC_MALLOC_CHECK */
266 /* A node in the red-black tree describing allocated memory containing
267 Lisp data. Each such block is recorded with its start and end
268 address when it is allocated, and removed from the tree when it
271 A red-black tree is a balanced binary tree with the following
274 1. Every node is either red or black.
275 2. Every leaf is black.
276 3. If a node is red, then both of its children are black.
277 4. Every simple path from a node to a descendant leaf contains
278 the same number of black nodes.
279 5. The root is always black.
281 When nodes are inserted into the tree, or deleted from the tree,
282 the tree is "fixed" so that these properties are always true.
284 A red-black tree with N internal nodes has height at most 2
285 log(N+1). Searches, insertions and deletions are done in O(log N).
286 Please see a text book about data structures for a detailed
287 description of red-black trees. Any book worth its salt should
292 /* Children of this node. These pointers are never NULL. When there
293 is no child, the value is MEM_NIL, which points to a dummy node. */
294 struct mem_node
*left
, *right
;
296 /* The parent of this node. In the root node, this is NULL. */
297 struct mem_node
*parent
;
299 /* Start and end of allocated region. */
303 enum {MEM_BLACK
, MEM_RED
} color
;
309 /* Base address of stack. Set in main. */
311 Lisp_Object
*stack_base
;
313 /* Root of the tree describing allocated Lisp memory. */
315 static struct mem_node
*mem_root
;
317 /* Lowest and highest known address in the heap. */
319 static void *min_heap_address
, *max_heap_address
;
321 /* Sentinel node of the tree. */
323 static struct mem_node mem_z
;
324 #define MEM_NIL &mem_z
326 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
327 static struct mem_node
*mem_insert (void *, void *, enum mem_type
);
328 static void mem_insert_fixup (struct mem_node
*);
329 static void mem_rotate_left (struct mem_node
*);
330 static void mem_rotate_right (struct mem_node
*);
331 static void mem_delete (struct mem_node
*);
332 static void mem_delete_fixup (struct mem_node
*);
333 static struct mem_node
*mem_find (void *);
336 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
342 /* Recording what needs to be marked for gc. */
344 struct gcpro
*gcprolist
;
346 /* Addresses of staticpro'd variables. Initialize it to a nonzero
347 value; otherwise some compilers put it into BSS. */
349 #define NSTATICS 0x800
350 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
352 /* Index of next unused slot in staticvec. */
354 static int staticidx
;
356 static void *pure_alloc (size_t, int);
359 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
360 ALIGNMENT must be a power of 2. */
362 #define ALIGN(ptr, ALIGNMENT) \
363 ((void *) (((uintptr_t) (ptr) + (ALIGNMENT) - 1) \
364 & ~ ((ALIGNMENT) - 1)))
367 XFLOAT_INIT (Lisp_Object f
, double n
)
369 XFLOAT (f
)->u
.data
= n
;
373 /************************************************************************
375 ************************************************************************/
377 /* Function malloc calls this if it finds we are near exhausting storage. */
380 malloc_warning (const char *str
)
382 pending_malloc_warning
= str
;
386 /* Display an already-pending malloc warning. */
389 display_malloc_warning (void)
391 call3 (intern ("display-warning"),
393 build_string (pending_malloc_warning
),
394 intern ("emergency"));
395 pending_malloc_warning
= 0;
398 /* Called if we can't allocate relocatable space for a buffer. */
401 buffer_memory_full (ptrdiff_t nbytes
)
403 /* If buffers use the relocating allocator, no need to free
404 spare_memory, because we may have plenty of malloc space left
405 that we could get, and if we don't, the malloc that fails will
406 itself cause spare_memory to be freed. If buffers don't use the
407 relocating allocator, treat this like any other failing
411 memory_full (nbytes
);
413 /* This used to call error, but if we've run out of memory, we could
414 get infinite recursion trying to build the string. */
415 xsignal (Qnil
, Vmemory_signal_data
);
419 /* A common multiple of the positive integers A and B. Ideally this
420 would be the least common multiple, but there's no way to do that
421 as a constant expression in C, so do the best that we can easily do. */
422 #define COMMON_MULTIPLE(a, b) \
423 ((a) % (b) == 0 ? (a) : (b) % (a) == 0 ? (b) : (a) * (b))
425 #ifndef XMALLOC_OVERRUN_CHECK
426 #define XMALLOC_OVERRUN_CHECK_OVERHEAD 0
429 /* Check for overrun in malloc'ed buffers by wrapping a header and trailer
432 The header consists of XMALLOC_OVERRUN_CHECK_SIZE fixed bytes
433 followed by XMALLOC_OVERRUN_SIZE_SIZE bytes containing the original
434 block size in little-endian order. The trailer consists of
435 XMALLOC_OVERRUN_CHECK_SIZE fixed bytes.
437 The header is used to detect whether this block has been allocated
438 through these functions, as some low-level libc functions may
439 bypass the malloc hooks. */
441 #define XMALLOC_OVERRUN_CHECK_SIZE 16
442 #define XMALLOC_OVERRUN_CHECK_OVERHEAD \
443 (2 * XMALLOC_OVERRUN_CHECK_SIZE + XMALLOC_OVERRUN_SIZE_SIZE)
445 /* Define XMALLOC_OVERRUN_SIZE_SIZE so that (1) it's large enough to
446 hold a size_t value and (2) the header size is a multiple of the
447 alignment that Emacs needs for C types and for USE_LSB_TAG. */
448 #define XMALLOC_BASE_ALIGNMENT \
449 alignof (union { long double d; intmax_t i; void *p; })
452 # define XMALLOC_HEADER_ALIGNMENT \
453 COMMON_MULTIPLE (GCALIGNMENT, XMALLOC_BASE_ALIGNMENT)
455 # define XMALLOC_HEADER_ALIGNMENT XMALLOC_BASE_ALIGNMENT
457 #define XMALLOC_OVERRUN_SIZE_SIZE \
458 (((XMALLOC_OVERRUN_CHECK_SIZE + sizeof (size_t) \
459 + XMALLOC_HEADER_ALIGNMENT - 1) \
460 / XMALLOC_HEADER_ALIGNMENT * XMALLOC_HEADER_ALIGNMENT) \
461 - XMALLOC_OVERRUN_CHECK_SIZE)
463 static char const xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
] =
464 { '\x9a', '\x9b', '\xae', '\xaf',
465 '\xbf', '\xbe', '\xce', '\xcf',
466 '\xea', '\xeb', '\xec', '\xed',
467 '\xdf', '\xde', '\x9c', '\x9d' };
469 static char const xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
470 { '\xaa', '\xab', '\xac', '\xad',
471 '\xba', '\xbb', '\xbc', '\xbd',
472 '\xca', '\xcb', '\xcc', '\xcd',
473 '\xda', '\xdb', '\xdc', '\xdd' };
475 /* Insert and extract the block size in the header. */
478 xmalloc_put_size (unsigned char *ptr
, size_t size
)
481 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
483 *--ptr
= size
& ((1 << CHAR_BIT
) - 1);
489 xmalloc_get_size (unsigned char *ptr
)
493 ptr
-= XMALLOC_OVERRUN_SIZE_SIZE
;
494 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
503 /* Like malloc, but wraps allocated block with header and trailer. */
506 overrun_check_malloc (size_t size
)
508 register unsigned char *val
;
509 if (SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
< size
)
512 val
= malloc (size
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
515 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
516 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
517 xmalloc_put_size (val
, size
);
518 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
519 XMALLOC_OVERRUN_CHECK_SIZE
);
525 /* Like realloc, but checks old block for overrun, and wraps new block
526 with header and trailer. */
529 overrun_check_realloc (void *block
, size_t size
)
531 register unsigned char *val
= (unsigned char *) block
;
532 if (SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
< size
)
536 && memcmp (xmalloc_overrun_check_header
,
537 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
538 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
540 size_t osize
= xmalloc_get_size (val
);
541 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
542 XMALLOC_OVERRUN_CHECK_SIZE
))
544 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
545 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
546 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
549 val
= realloc (val
, size
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
553 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
554 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
555 xmalloc_put_size (val
, size
);
556 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
557 XMALLOC_OVERRUN_CHECK_SIZE
);
562 /* Like free, but checks block for overrun. */
565 overrun_check_free (void *block
)
567 unsigned char *val
= (unsigned char *) block
;
570 && memcmp (xmalloc_overrun_check_header
,
571 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
572 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
574 size_t osize
= xmalloc_get_size (val
);
575 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
576 XMALLOC_OVERRUN_CHECK_SIZE
))
578 #ifdef XMALLOC_CLEAR_FREE_MEMORY
579 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
580 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
582 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
583 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
584 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
594 #define malloc overrun_check_malloc
595 #define realloc overrun_check_realloc
596 #define free overrun_check_free
599 /* If compiled with XMALLOC_BLOCK_INPUT_CHECK, define a symbol
600 BLOCK_INPUT_IN_MEMORY_ALLOCATORS that is visible to the debugger.
601 If that variable is set, block input while in one of Emacs's memory
602 allocation functions. There should be no need for this debugging
603 option, since signal handlers do not allocate memory, but Emacs
604 formerly allocated memory in signal handlers and this compile-time
605 option remains as a way to help debug the issue should it rear its
607 #ifdef XMALLOC_BLOCK_INPUT_CHECK
608 bool block_input_in_memory_allocators EXTERNALLY_VISIBLE
;
610 malloc_block_input (void)
612 if (block_input_in_memory_allocators
)
616 malloc_unblock_input (void)
618 if (block_input_in_memory_allocators
)
621 # define MALLOC_BLOCK_INPUT malloc_block_input ()
622 # define MALLOC_UNBLOCK_INPUT malloc_unblock_input ()
624 # define MALLOC_BLOCK_INPUT ((void) 0)
625 # define MALLOC_UNBLOCK_INPUT ((void) 0)
628 #define MALLOC_PROBE(size) \
630 if (profiler_memory_running) \
631 malloc_probe (size); \
635 /* Like malloc but check for no memory and block interrupt input.. */
638 xmalloc (size_t size
)
644 MALLOC_UNBLOCK_INPUT
;
652 /* Like the above, but zeroes out the memory just allocated. */
655 xzalloc (size_t size
)
661 MALLOC_UNBLOCK_INPUT
;
665 memset (val
, 0, size
);
670 /* Like realloc but check for no memory and block interrupt input.. */
673 xrealloc (void *block
, size_t size
)
678 /* We must call malloc explicitly when BLOCK is 0, since some
679 reallocs don't do this. */
683 val
= realloc (block
, size
);
684 MALLOC_UNBLOCK_INPUT
;
693 /* Like free but block interrupt input. */
702 MALLOC_UNBLOCK_INPUT
;
703 /* We don't call refill_memory_reserve here
704 because in practice the call in r_alloc_free seems to suffice. */
708 /* Other parts of Emacs pass large int values to allocator functions
709 expecting ptrdiff_t. This is portable in practice, but check it to
711 verify (INT_MAX
<= PTRDIFF_MAX
);
714 /* Allocate an array of NITEMS items, each of size ITEM_SIZE.
715 Signal an error on memory exhaustion, and block interrupt input. */
718 xnmalloc (ptrdiff_t nitems
, ptrdiff_t item_size
)
720 eassert (0 <= nitems
&& 0 < item_size
);
721 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
722 memory_full (SIZE_MAX
);
723 return xmalloc (nitems
* item_size
);
727 /* Reallocate an array PA to make it of NITEMS items, each of size ITEM_SIZE.
728 Signal an error on memory exhaustion, and block interrupt input. */
731 xnrealloc (void *pa
, ptrdiff_t nitems
, ptrdiff_t item_size
)
733 eassert (0 <= nitems
&& 0 < item_size
);
734 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
735 memory_full (SIZE_MAX
);
736 return xrealloc (pa
, nitems
* item_size
);
740 /* Grow PA, which points to an array of *NITEMS items, and return the
741 location of the reallocated array, updating *NITEMS to reflect its
742 new size. The new array will contain at least NITEMS_INCR_MIN more
743 items, but will not contain more than NITEMS_MAX items total.
744 ITEM_SIZE is the size of each item, in bytes.
746 ITEM_SIZE and NITEMS_INCR_MIN must be positive. *NITEMS must be
747 nonnegative. If NITEMS_MAX is -1, it is treated as if it were
750 If PA is null, then allocate a new array instead of reallocating
753 Block interrupt input as needed. If memory exhaustion occurs, set
754 *NITEMS to zero if PA is null, and signal an error (i.e., do not
757 Thus, to grow an array A without saving its old contents, do
758 { xfree (A); A = NULL; A = xpalloc (NULL, &AITEMS, ...); }.
759 The A = NULL avoids a dangling pointer if xpalloc exhausts memory
760 and signals an error, and later this code is reexecuted and
761 attempts to free A. */
764 xpalloc (void *pa
, ptrdiff_t *nitems
, ptrdiff_t nitems_incr_min
,
765 ptrdiff_t nitems_max
, ptrdiff_t item_size
)
767 /* The approximate size to use for initial small allocation
768 requests. This is the largest "small" request for the GNU C
770 enum { DEFAULT_MXFAST
= 64 * sizeof (size_t) / 4 };
772 /* If the array is tiny, grow it to about (but no greater than)
773 DEFAULT_MXFAST bytes. Otherwise, grow it by about 50%. */
774 ptrdiff_t n
= *nitems
;
775 ptrdiff_t tiny_max
= DEFAULT_MXFAST
/ item_size
- n
;
776 ptrdiff_t half_again
= n
>> 1;
777 ptrdiff_t incr_estimate
= max (tiny_max
, half_again
);
779 /* Adjust the increment according to three constraints: NITEMS_INCR_MIN,
780 NITEMS_MAX, and what the C language can represent safely. */
781 ptrdiff_t C_language_max
= min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
;
782 ptrdiff_t n_max
= (0 <= nitems_max
&& nitems_max
< C_language_max
783 ? nitems_max
: C_language_max
);
784 ptrdiff_t nitems_incr_max
= n_max
- n
;
785 ptrdiff_t incr
= max (nitems_incr_min
, min (incr_estimate
, nitems_incr_max
));
787 eassert (0 < item_size
&& 0 < nitems_incr_min
&& 0 <= n
&& -1 <= nitems_max
);
790 if (nitems_incr_max
< incr
)
791 memory_full (SIZE_MAX
);
793 pa
= xrealloc (pa
, n
* item_size
);
799 /* Like strdup, but uses xmalloc. */
802 xstrdup (const char *s
)
804 size_t len
= strlen (s
) + 1;
805 char *p
= xmalloc (len
);
810 /* Like putenv, but (1) use the equivalent of xmalloc and (2) the
811 argument is a const pointer. */
814 xputenv (char const *string
)
816 if (putenv ((char *) string
) != 0)
820 /* Unwind for SAFE_ALLOCA */
823 safe_alloca_unwind (Lisp_Object arg
)
825 free_save_value (arg
);
829 /* Return a newly allocated memory block of SIZE bytes, remembering
830 to free it when unwinding. */
832 record_xmalloc (size_t size
)
834 void *p
= xmalloc (size
);
835 record_unwind_protect (safe_alloca_unwind
, make_save_pointer (p
));
840 /* Like malloc but used for allocating Lisp data. NBYTES is the
841 number of bytes to allocate, TYPE describes the intended use of the
842 allocated memory block (for strings, for conses, ...). */
845 void *lisp_malloc_loser EXTERNALLY_VISIBLE
;
849 lisp_malloc (size_t nbytes
, enum mem_type type
)
855 #ifdef GC_MALLOC_CHECK
856 allocated_mem_type
= type
;
859 val
= malloc (nbytes
);
862 /* If the memory just allocated cannot be addressed thru a Lisp
863 object's pointer, and it needs to be,
864 that's equivalent to running out of memory. */
865 if (val
&& type
!= MEM_TYPE_NON_LISP
)
868 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
869 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
871 lisp_malloc_loser
= val
;
878 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
879 if (val
&& type
!= MEM_TYPE_NON_LISP
)
880 mem_insert (val
, (char *) val
+ nbytes
, type
);
883 MALLOC_UNBLOCK_INPUT
;
885 memory_full (nbytes
);
886 MALLOC_PROBE (nbytes
);
890 /* Free BLOCK. This must be called to free memory allocated with a
891 call to lisp_malloc. */
894 lisp_free (void *block
)
898 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
899 mem_delete (mem_find (block
));
901 MALLOC_UNBLOCK_INPUT
;
904 /***** Allocation of aligned blocks of memory to store Lisp data. *****/
906 /* The entry point is lisp_align_malloc which returns blocks of at most
907 BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
909 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
910 #define USE_POSIX_MEMALIGN 1
913 /* BLOCK_ALIGN has to be a power of 2. */
914 #define BLOCK_ALIGN (1 << 10)
916 /* Padding to leave at the end of a malloc'd block. This is to give
917 malloc a chance to minimize the amount of memory wasted to alignment.
918 It should be tuned to the particular malloc library used.
919 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
920 posix_memalign on the other hand would ideally prefer a value of 4
921 because otherwise, there's 1020 bytes wasted between each ablocks.
922 In Emacs, testing shows that those 1020 can most of the time be
923 efficiently used by malloc to place other objects, so a value of 0 can
924 still preferable unless you have a lot of aligned blocks and virtually
926 #define BLOCK_PADDING 0
927 #define BLOCK_BYTES \
928 (BLOCK_ALIGN - sizeof (struct ablocks *) - BLOCK_PADDING)
930 /* Internal data structures and constants. */
932 #define ABLOCKS_SIZE 16
934 /* An aligned block of memory. */
939 char payload
[BLOCK_BYTES
];
940 struct ablock
*next_free
;
942 /* `abase' is the aligned base of the ablocks. */
943 /* It is overloaded to hold the virtual `busy' field that counts
944 the number of used ablock in the parent ablocks.
945 The first ablock has the `busy' field, the others have the `abase'
946 field. To tell the difference, we assume that pointers will have
947 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
948 is used to tell whether the real base of the parent ablocks is `abase'
949 (if not, the word before the first ablock holds a pointer to the
951 struct ablocks
*abase
;
952 /* The padding of all but the last ablock is unused. The padding of
953 the last ablock in an ablocks is not allocated. */
955 char padding
[BLOCK_PADDING
];
959 /* A bunch of consecutive aligned blocks. */
962 struct ablock blocks
[ABLOCKS_SIZE
];
965 /* Size of the block requested from malloc or posix_memalign. */
966 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
968 #define ABLOCK_ABASE(block) \
969 (((uintptr_t) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
970 ? (struct ablocks *)(block) \
973 /* Virtual `busy' field. */
974 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
976 /* Pointer to the (not necessarily aligned) malloc block. */
977 #ifdef USE_POSIX_MEMALIGN
978 #define ABLOCKS_BASE(abase) (abase)
980 #define ABLOCKS_BASE(abase) \
981 (1 & (intptr_t) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
984 /* The list of free ablock. */
985 static struct ablock
*free_ablock
;
987 /* Allocate an aligned block of nbytes.
988 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
989 smaller or equal to BLOCK_BYTES. */
991 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
994 struct ablocks
*abase
;
996 eassert (nbytes
<= BLOCK_BYTES
);
1000 #ifdef GC_MALLOC_CHECK
1001 allocated_mem_type
= type
;
1007 intptr_t aligned
; /* int gets warning casting to 64-bit pointer. */
1009 #ifdef DOUG_LEA_MALLOC
1010 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1011 because mapped region contents are not preserved in
1013 mallopt (M_MMAP_MAX
, 0);
1016 #ifdef USE_POSIX_MEMALIGN
1018 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1024 base
= malloc (ABLOCKS_BYTES
);
1025 abase
= ALIGN (base
, BLOCK_ALIGN
);
1030 MALLOC_UNBLOCK_INPUT
;
1031 memory_full (ABLOCKS_BYTES
);
1034 aligned
= (base
== abase
);
1036 ((void**)abase
)[-1] = base
;
1038 #ifdef DOUG_LEA_MALLOC
1039 /* Back to a reasonable maximum of mmap'ed areas. */
1040 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1044 /* If the memory just allocated cannot be addressed thru a Lisp
1045 object's pointer, and it needs to be, that's equivalent to
1046 running out of memory. */
1047 if (type
!= MEM_TYPE_NON_LISP
)
1050 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1051 XSETCONS (tem
, end
);
1052 if ((char *) XCONS (tem
) != end
)
1054 lisp_malloc_loser
= base
;
1056 MALLOC_UNBLOCK_INPUT
;
1057 memory_full (SIZE_MAX
);
1062 /* Initialize the blocks and put them on the free list.
1063 If `base' was not properly aligned, we can't use the last block. */
1064 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1066 abase
->blocks
[i
].abase
= abase
;
1067 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1068 free_ablock
= &abase
->blocks
[i
];
1070 ABLOCKS_BUSY (abase
) = (struct ablocks
*) aligned
;
1072 eassert (0 == ((uintptr_t) abase
) % BLOCK_ALIGN
);
1073 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1074 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1075 eassert (ABLOCKS_BASE (abase
) == base
);
1076 eassert (aligned
== (intptr_t) ABLOCKS_BUSY (abase
));
1079 abase
= ABLOCK_ABASE (free_ablock
);
1080 ABLOCKS_BUSY (abase
) =
1081 (struct ablocks
*) (2 + (intptr_t) ABLOCKS_BUSY (abase
));
1083 free_ablock
= free_ablock
->x
.next_free
;
1085 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1086 if (type
!= MEM_TYPE_NON_LISP
)
1087 mem_insert (val
, (char *) val
+ nbytes
, type
);
1090 MALLOC_UNBLOCK_INPUT
;
1092 MALLOC_PROBE (nbytes
);
1094 eassert (0 == ((uintptr_t) val
) % BLOCK_ALIGN
);
1099 lisp_align_free (void *block
)
1101 struct ablock
*ablock
= block
;
1102 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1105 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1106 mem_delete (mem_find (block
));
1108 /* Put on free list. */
1109 ablock
->x
.next_free
= free_ablock
;
1110 free_ablock
= ablock
;
1111 /* Update busy count. */
1112 ABLOCKS_BUSY (abase
)
1113 = (struct ablocks
*) (-2 + (intptr_t) ABLOCKS_BUSY (abase
));
1115 if (2 > (intptr_t) ABLOCKS_BUSY (abase
))
1116 { /* All the blocks are free. */
1117 int i
= 0, aligned
= (intptr_t) ABLOCKS_BUSY (abase
);
1118 struct ablock
**tem
= &free_ablock
;
1119 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1123 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1126 *tem
= (*tem
)->x
.next_free
;
1129 tem
= &(*tem
)->x
.next_free
;
1131 eassert ((aligned
& 1) == aligned
);
1132 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1133 #ifdef USE_POSIX_MEMALIGN
1134 eassert ((uintptr_t) ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1136 free (ABLOCKS_BASE (abase
));
1138 MALLOC_UNBLOCK_INPUT
;
1142 /***********************************************************************
1144 ***********************************************************************/
1146 /* Number of intervals allocated in an interval_block structure.
1147 The 1020 is 1024 minus malloc overhead. */
1149 #define INTERVAL_BLOCK_SIZE \
1150 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1152 /* Intervals are allocated in chunks in the form of an interval_block
1155 struct interval_block
1157 /* Place `intervals' first, to preserve alignment. */
1158 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1159 struct interval_block
*next
;
1162 /* Current interval block. Its `next' pointer points to older
1165 static struct interval_block
*interval_block
;
1167 /* Index in interval_block above of the next unused interval
1170 static int interval_block_index
= INTERVAL_BLOCK_SIZE
;
1172 /* Number of free and live intervals. */
1174 static EMACS_INT total_free_intervals
, total_intervals
;
1176 /* List of free intervals. */
1178 static INTERVAL interval_free_list
;
1180 /* Return a new interval. */
1183 make_interval (void)
1189 if (interval_free_list
)
1191 val
= interval_free_list
;
1192 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1196 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1198 struct interval_block
*newi
1199 = lisp_malloc (sizeof *newi
, MEM_TYPE_NON_LISP
);
1201 newi
->next
= interval_block
;
1202 interval_block
= newi
;
1203 interval_block_index
= 0;
1204 total_free_intervals
+= INTERVAL_BLOCK_SIZE
;
1206 val
= &interval_block
->intervals
[interval_block_index
++];
1209 MALLOC_UNBLOCK_INPUT
;
1211 consing_since_gc
+= sizeof (struct interval
);
1213 total_free_intervals
--;
1214 RESET_INTERVAL (val
);
1220 /* Mark Lisp objects in interval I. */
1223 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1225 /* Intervals should never be shared. So, if extra internal checking is
1226 enabled, GC aborts if it seems to have visited an interval twice. */
1227 eassert (!i
->gcmarkbit
);
1229 mark_object (i
->plist
);
1232 /* Mark the interval tree rooted in I. */
1234 #define MARK_INTERVAL_TREE(i) \
1236 if (i && !i->gcmarkbit) \
1237 traverse_intervals_noorder (i, mark_interval, Qnil); \
1240 /***********************************************************************
1242 ***********************************************************************/
1244 /* Lisp_Strings are allocated in string_block structures. When a new
1245 string_block is allocated, all the Lisp_Strings it contains are
1246 added to a free-list string_free_list. When a new Lisp_String is
1247 needed, it is taken from that list. During the sweep phase of GC,
1248 string_blocks that are entirely free are freed, except two which
1251 String data is allocated from sblock structures. Strings larger
1252 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1253 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1255 Sblocks consist internally of sdata structures, one for each
1256 Lisp_String. The sdata structure points to the Lisp_String it
1257 belongs to. The Lisp_String points back to the `u.data' member of
1258 its sdata structure.
1260 When a Lisp_String is freed during GC, it is put back on
1261 string_free_list, and its `data' member and its sdata's `string'
1262 pointer is set to null. The size of the string is recorded in the
1263 `n.nbytes' member of the sdata. So, sdata structures that are no
1264 longer used, can be easily recognized, and it's easy to compact the
1265 sblocks of small strings which we do in compact_small_strings. */
1267 /* Size in bytes of an sblock structure used for small strings. This
1268 is 8192 minus malloc overhead. */
1270 #define SBLOCK_SIZE 8188
1272 /* Strings larger than this are considered large strings. String data
1273 for large strings is allocated from individual sblocks. */
1275 #define LARGE_STRING_BYTES 1024
1277 /* Struct or union describing string memory sub-allocated from an sblock.
1278 This is where the contents of Lisp strings are stored. */
1280 #ifdef GC_CHECK_STRING_BYTES
1284 /* Back-pointer to the string this sdata belongs to. If null, this
1285 structure is free, and the NBYTES member of the union below
1286 contains the string's byte size (the same value that STRING_BYTES
1287 would return if STRING were non-null). If non-null, STRING_BYTES
1288 (STRING) is the size of the data, and DATA contains the string's
1290 struct Lisp_String
*string
;
1293 unsigned char data
[FLEXIBLE_ARRAY_MEMBER
];
1296 #define SDATA_NBYTES(S) (S)->nbytes
1297 #define SDATA_DATA(S) (S)->data
1298 #define SDATA_SELECTOR(member) member
1304 struct Lisp_String
*string
;
1306 /* When STRING is non-null. */
1309 struct Lisp_String
*string
;
1310 unsigned char data
[FLEXIBLE_ARRAY_MEMBER
];
1313 /* When STRING is null. */
1316 struct Lisp_String
*string
;
1321 #define SDATA_NBYTES(S) (S)->n.nbytes
1322 #define SDATA_DATA(S) (S)->u.data
1323 #define SDATA_SELECTOR(member) u.member
1325 #endif /* not GC_CHECK_STRING_BYTES */
1327 #define SDATA_DATA_OFFSET offsetof (sdata, SDATA_SELECTOR (data))
1330 /* Structure describing a block of memory which is sub-allocated to
1331 obtain string data memory for strings. Blocks for small strings
1332 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1333 as large as needed. */
1338 struct sblock
*next
;
1340 /* Pointer to the next free sdata block. This points past the end
1341 of the sblock if there isn't any space left in this block. */
1344 /* Start of data. */
1348 /* Number of Lisp strings in a string_block structure. The 1020 is
1349 1024 minus malloc overhead. */
1351 #define STRING_BLOCK_SIZE \
1352 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1354 /* Structure describing a block from which Lisp_String structures
1359 /* Place `strings' first, to preserve alignment. */
1360 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1361 struct string_block
*next
;
1364 /* Head and tail of the list of sblock structures holding Lisp string
1365 data. We always allocate from current_sblock. The NEXT pointers
1366 in the sblock structures go from oldest_sblock to current_sblock. */
1368 static struct sblock
*oldest_sblock
, *current_sblock
;
1370 /* List of sblocks for large strings. */
1372 static struct sblock
*large_sblocks
;
1374 /* List of string_block structures. */
1376 static struct string_block
*string_blocks
;
1378 /* Free-list of Lisp_Strings. */
1380 static struct Lisp_String
*string_free_list
;
1382 /* Number of live and free Lisp_Strings. */
1384 static EMACS_INT total_strings
, total_free_strings
;
1386 /* Number of bytes used by live strings. */
1388 static EMACS_INT total_string_bytes
;
1390 /* Given a pointer to a Lisp_String S which is on the free-list
1391 string_free_list, return a pointer to its successor in the
1394 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1396 /* Return a pointer to the sdata structure belonging to Lisp string S.
1397 S must be live, i.e. S->data must not be null. S->data is actually
1398 a pointer to the `u.data' member of its sdata structure; the
1399 structure starts at a constant offset in front of that. */
1401 #define SDATA_OF_STRING(S) ((sdata *) ((S)->data - SDATA_DATA_OFFSET))
1404 #ifdef GC_CHECK_STRING_OVERRUN
1406 /* We check for overrun in string data blocks by appending a small
1407 "cookie" after each allocated string data block, and check for the
1408 presence of this cookie during GC. */
1410 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1411 static char const string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1412 { '\xde', '\xad', '\xbe', '\xef' };
1415 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1418 /* Value is the size of an sdata structure large enough to hold NBYTES
1419 bytes of string data. The value returned includes a terminating
1420 NUL byte, the size of the sdata structure, and padding. */
1422 #ifdef GC_CHECK_STRING_BYTES
1424 #define SDATA_SIZE(NBYTES) \
1425 ((SDATA_DATA_OFFSET \
1427 + sizeof (ptrdiff_t) - 1) \
1428 & ~(sizeof (ptrdiff_t) - 1))
1430 #else /* not GC_CHECK_STRING_BYTES */
1432 /* The 'max' reserves space for the nbytes union member even when NBYTES + 1 is
1433 less than the size of that member. The 'max' is not needed when
1434 SDATA_DATA_OFFSET is a multiple of sizeof (ptrdiff_t), because then the
1435 alignment code reserves enough space. */
1437 #define SDATA_SIZE(NBYTES) \
1438 ((SDATA_DATA_OFFSET \
1439 + (SDATA_DATA_OFFSET % sizeof (ptrdiff_t) == 0 \
1441 : max (NBYTES, sizeof (ptrdiff_t) - 1)) \
1443 + sizeof (ptrdiff_t) - 1) \
1444 & ~(sizeof (ptrdiff_t) - 1))
1446 #endif /* not GC_CHECK_STRING_BYTES */
1448 /* Extra bytes to allocate for each string. */
1450 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1452 /* Exact bound on the number of bytes in a string, not counting the
1453 terminating null. A string cannot contain more bytes than
1454 STRING_BYTES_BOUND, nor can it be so long that the size_t
1455 arithmetic in allocate_string_data would overflow while it is
1456 calculating a value to be passed to malloc. */
1457 static ptrdiff_t const STRING_BYTES_MAX
=
1458 min (STRING_BYTES_BOUND
,
1459 ((SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
1461 - offsetof (struct sblock
, first_data
)
1462 - SDATA_DATA_OFFSET
)
1463 & ~(sizeof (EMACS_INT
) - 1)));
1465 /* Initialize string allocation. Called from init_alloc_once. */
1470 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1471 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1475 #ifdef GC_CHECK_STRING_BYTES
1477 static int check_string_bytes_count
;
1479 /* Like STRING_BYTES, but with debugging check. Can be
1480 called during GC, so pay attention to the mark bit. */
1483 string_bytes (struct Lisp_String
*s
)
1486 (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1488 if (!PURE_POINTER_P (s
)
1490 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1495 /* Check validity of Lisp strings' string_bytes member in B. */
1498 check_sblock (struct sblock
*b
)
1500 sdata
*from
, *end
, *from_end
;
1504 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1506 /* Compute the next FROM here because copying below may
1507 overwrite data we need to compute it. */
1510 /* Check that the string size recorded in the string is the
1511 same as the one recorded in the sdata structure. */
1512 nbytes
= SDATA_SIZE (from
->string
? string_bytes (from
->string
)
1513 : SDATA_NBYTES (from
));
1514 from_end
= (sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1519 /* Check validity of Lisp strings' string_bytes member. ALL_P
1520 means check all strings, otherwise check only most
1521 recently allocated strings. Used for hunting a bug. */
1524 check_string_bytes (bool all_p
)
1530 for (b
= large_sblocks
; b
; b
= b
->next
)
1532 struct Lisp_String
*s
= b
->first_data
.string
;
1537 for (b
= oldest_sblock
; b
; b
= b
->next
)
1540 else if (current_sblock
)
1541 check_sblock (current_sblock
);
1544 #else /* not GC_CHECK_STRING_BYTES */
1546 #define check_string_bytes(all) ((void) 0)
1548 #endif /* GC_CHECK_STRING_BYTES */
1550 #ifdef GC_CHECK_STRING_FREE_LIST
1552 /* Walk through the string free list looking for bogus next pointers.
1553 This may catch buffer overrun from a previous string. */
1556 check_string_free_list (void)
1558 struct Lisp_String
*s
;
1560 /* Pop a Lisp_String off the free-list. */
1561 s
= string_free_list
;
1564 if ((uintptr_t) s
< 1024)
1566 s
= NEXT_FREE_LISP_STRING (s
);
1570 #define check_string_free_list()
1573 /* Return a new Lisp_String. */
1575 static struct Lisp_String
*
1576 allocate_string (void)
1578 struct Lisp_String
*s
;
1582 /* If the free-list is empty, allocate a new string_block, and
1583 add all the Lisp_Strings in it to the free-list. */
1584 if (string_free_list
== NULL
)
1586 struct string_block
*b
= lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1589 b
->next
= string_blocks
;
1592 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1595 /* Every string on a free list should have NULL data pointer. */
1597 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1598 string_free_list
= s
;
1601 total_free_strings
+= STRING_BLOCK_SIZE
;
1604 check_string_free_list ();
1606 /* Pop a Lisp_String off the free-list. */
1607 s
= string_free_list
;
1608 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1610 MALLOC_UNBLOCK_INPUT
;
1612 --total_free_strings
;
1615 consing_since_gc
+= sizeof *s
;
1617 #ifdef GC_CHECK_STRING_BYTES
1618 if (!noninteractive
)
1620 if (++check_string_bytes_count
== 200)
1622 check_string_bytes_count
= 0;
1623 check_string_bytes (1);
1626 check_string_bytes (0);
1628 #endif /* GC_CHECK_STRING_BYTES */
1634 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1635 plus a NUL byte at the end. Allocate an sdata structure for S, and
1636 set S->data to its `u.data' member. Store a NUL byte at the end of
1637 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1638 S->data if it was initially non-null. */
1641 allocate_string_data (struct Lisp_String
*s
,
1642 EMACS_INT nchars
, EMACS_INT nbytes
)
1644 sdata
*data
, *old_data
;
1646 ptrdiff_t needed
, old_nbytes
;
1648 if (STRING_BYTES_MAX
< nbytes
)
1651 /* Determine the number of bytes needed to store NBYTES bytes
1653 needed
= SDATA_SIZE (nbytes
);
1656 old_data
= SDATA_OF_STRING (s
);
1657 old_nbytes
= STRING_BYTES (s
);
1664 if (nbytes
> LARGE_STRING_BYTES
)
1666 size_t size
= offsetof (struct sblock
, first_data
) + needed
;
1668 #ifdef DOUG_LEA_MALLOC
1669 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1670 because mapped region contents are not preserved in
1673 In case you think of allowing it in a dumped Emacs at the
1674 cost of not being able to re-dump, there's another reason:
1675 mmap'ed data typically have an address towards the top of the
1676 address space, which won't fit into an EMACS_INT (at least on
1677 32-bit systems with the current tagging scheme). --fx */
1678 mallopt (M_MMAP_MAX
, 0);
1681 b
= lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1683 #ifdef DOUG_LEA_MALLOC
1684 /* Back to a reasonable maximum of mmap'ed areas. */
1685 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1688 b
->next_free
= &b
->first_data
;
1689 b
->first_data
.string
= NULL
;
1690 b
->next
= large_sblocks
;
1693 else if (current_sblock
== NULL
1694 || (((char *) current_sblock
+ SBLOCK_SIZE
1695 - (char *) current_sblock
->next_free
)
1696 < (needed
+ GC_STRING_EXTRA
)))
1698 /* Not enough room in the current sblock. */
1699 b
= lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1700 b
->next_free
= &b
->first_data
;
1701 b
->first_data
.string
= NULL
;
1705 current_sblock
->next
= b
;
1713 data
= b
->next_free
;
1714 b
->next_free
= (sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
1716 MALLOC_UNBLOCK_INPUT
;
1719 s
->data
= SDATA_DATA (data
);
1720 #ifdef GC_CHECK_STRING_BYTES
1721 SDATA_NBYTES (data
) = nbytes
;
1724 s
->size_byte
= nbytes
;
1725 s
->data
[nbytes
] = '\0';
1726 #ifdef GC_CHECK_STRING_OVERRUN
1727 memcpy ((char *) data
+ needed
, string_overrun_cookie
,
1728 GC_STRING_OVERRUN_COOKIE_SIZE
);
1731 /* Note that Faset may call to this function when S has already data
1732 assigned. In this case, mark data as free by setting it's string
1733 back-pointer to null, and record the size of the data in it. */
1736 SDATA_NBYTES (old_data
) = old_nbytes
;
1737 old_data
->string
= NULL
;
1740 consing_since_gc
+= needed
;
1744 /* Sweep and compact strings. */
1747 sweep_strings (void)
1749 struct string_block
*b
, *next
;
1750 struct string_block
*live_blocks
= NULL
;
1752 string_free_list
= NULL
;
1753 total_strings
= total_free_strings
= 0;
1754 total_string_bytes
= 0;
1756 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1757 for (b
= string_blocks
; b
; b
= next
)
1760 struct Lisp_String
*free_list_before
= string_free_list
;
1764 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1766 struct Lisp_String
*s
= b
->strings
+ i
;
1770 /* String was not on free-list before. */
1771 if (STRING_MARKED_P (s
))
1773 /* String is live; unmark it and its intervals. */
1776 /* Do not use string_(set|get)_intervals here. */
1777 s
->intervals
= balance_intervals (s
->intervals
);
1780 total_string_bytes
+= STRING_BYTES (s
);
1784 /* String is dead. Put it on the free-list. */
1785 sdata
*data
= SDATA_OF_STRING (s
);
1787 /* Save the size of S in its sdata so that we know
1788 how large that is. Reset the sdata's string
1789 back-pointer so that we know it's free. */
1790 #ifdef GC_CHECK_STRING_BYTES
1791 if (string_bytes (s
) != SDATA_NBYTES (data
))
1794 data
->n
.nbytes
= STRING_BYTES (s
);
1796 data
->string
= NULL
;
1798 /* Reset the strings's `data' member so that we
1802 /* Put the string on the free-list. */
1803 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1804 string_free_list
= s
;
1810 /* S was on the free-list before. Put it there again. */
1811 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1812 string_free_list
= s
;
1817 /* Free blocks that contain free Lisp_Strings only, except
1818 the first two of them. */
1819 if (nfree
== STRING_BLOCK_SIZE
1820 && total_free_strings
> STRING_BLOCK_SIZE
)
1823 string_free_list
= free_list_before
;
1827 total_free_strings
+= nfree
;
1828 b
->next
= live_blocks
;
1833 check_string_free_list ();
1835 string_blocks
= live_blocks
;
1836 free_large_strings ();
1837 compact_small_strings ();
1839 check_string_free_list ();
1843 /* Free dead large strings. */
1846 free_large_strings (void)
1848 struct sblock
*b
, *next
;
1849 struct sblock
*live_blocks
= NULL
;
1851 for (b
= large_sblocks
; b
; b
= next
)
1855 if (b
->first_data
.string
== NULL
)
1859 b
->next
= live_blocks
;
1864 large_sblocks
= live_blocks
;
1868 /* Compact data of small strings. Free sblocks that don't contain
1869 data of live strings after compaction. */
1872 compact_small_strings (void)
1874 struct sblock
*b
, *tb
, *next
;
1875 sdata
*from
, *to
, *end
, *tb_end
;
1876 sdata
*to_end
, *from_end
;
1878 /* TB is the sblock we copy to, TO is the sdata within TB we copy
1879 to, and TB_END is the end of TB. */
1881 tb_end
= (sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1882 to
= &tb
->first_data
;
1884 /* Step through the blocks from the oldest to the youngest. We
1885 expect that old blocks will stabilize over time, so that less
1886 copying will happen this way. */
1887 for (b
= oldest_sblock
; b
; b
= b
->next
)
1890 eassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
1892 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1894 /* Compute the next FROM here because copying below may
1895 overwrite data we need to compute it. */
1897 struct Lisp_String
*s
= from
->string
;
1899 #ifdef GC_CHECK_STRING_BYTES
1900 /* Check that the string size recorded in the string is the
1901 same as the one recorded in the sdata structure. */
1902 if (s
&& string_bytes (s
) != SDATA_NBYTES (from
))
1904 #endif /* GC_CHECK_STRING_BYTES */
1906 nbytes
= s
? STRING_BYTES (s
) : SDATA_NBYTES (from
);
1907 eassert (nbytes
<= LARGE_STRING_BYTES
);
1909 nbytes
= SDATA_SIZE (nbytes
);
1910 from_end
= (sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1912 #ifdef GC_CHECK_STRING_OVERRUN
1913 if (memcmp (string_overrun_cookie
,
1914 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
1915 GC_STRING_OVERRUN_COOKIE_SIZE
))
1919 /* Non-NULL S means it's alive. Copy its data. */
1922 /* If TB is full, proceed with the next sblock. */
1923 to_end
= (sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
1924 if (to_end
> tb_end
)
1928 tb_end
= (sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1929 to
= &tb
->first_data
;
1930 to_end
= (sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
1933 /* Copy, and update the string's `data' pointer. */
1936 eassert (tb
!= b
|| to
< from
);
1937 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
1938 to
->string
->data
= SDATA_DATA (to
);
1941 /* Advance past the sdata we copied to. */
1947 /* The rest of the sblocks following TB don't contain live data, so
1948 we can free them. */
1949 for (b
= tb
->next
; b
; b
= next
)
1957 current_sblock
= tb
;
1961 string_overflow (void)
1963 error ("Maximum string size exceeded");
1966 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
1967 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
1968 LENGTH must be an integer.
1969 INIT must be an integer that represents a character. */)
1970 (Lisp_Object length
, Lisp_Object init
)
1972 register Lisp_Object val
;
1973 register unsigned char *p
, *end
;
1977 CHECK_NATNUM (length
);
1978 CHECK_CHARACTER (init
);
1980 c
= XFASTINT (init
);
1981 if (ASCII_CHAR_P (c
))
1983 nbytes
= XINT (length
);
1984 val
= make_uninit_string (nbytes
);
1986 end
= p
+ SCHARS (val
);
1992 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
1993 int len
= CHAR_STRING (c
, str
);
1994 EMACS_INT string_len
= XINT (length
);
1996 if (string_len
> STRING_BYTES_MAX
/ len
)
1998 nbytes
= len
* string_len
;
1999 val
= make_uninit_multibyte_string (string_len
, nbytes
);
2004 memcpy (p
, str
, len
);
2014 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2015 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2016 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2017 (Lisp_Object length
, Lisp_Object init
)
2019 register Lisp_Object val
;
2020 struct Lisp_Bool_Vector
*p
;
2021 ptrdiff_t length_in_chars
;
2022 EMACS_INT length_in_elts
;
2024 int extra_bool_elts
= ((bool_header_size
- header_size
+ word_size
- 1)
2027 CHECK_NATNUM (length
);
2029 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2031 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2033 val
= Fmake_vector (make_number (length_in_elts
+ extra_bool_elts
), Qnil
);
2035 /* No Lisp_Object to trace in there. */
2036 XSETPVECTYPESIZE (XVECTOR (val
), PVEC_BOOL_VECTOR
, 0, 0);
2038 p
= XBOOL_VECTOR (val
);
2039 p
->size
= XFASTINT (length
);
2041 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2042 / BOOL_VECTOR_BITS_PER_CHAR
);
2043 if (length_in_chars
)
2045 memset (p
->data
, ! NILP (init
) ? -1 : 0, length_in_chars
);
2047 /* Clear any extraneous bits in the last byte. */
2048 p
->data
[length_in_chars
- 1]
2049 &= (1 << ((XFASTINT (length
) - 1) % BOOL_VECTOR_BITS_PER_CHAR
+ 1)) - 1;
2056 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2057 of characters from the contents. This string may be unibyte or
2058 multibyte, depending on the contents. */
2061 make_string (const char *contents
, ptrdiff_t nbytes
)
2063 register Lisp_Object val
;
2064 ptrdiff_t nchars
, multibyte_nbytes
;
2066 parse_str_as_multibyte ((const unsigned char *) contents
, nbytes
,
2067 &nchars
, &multibyte_nbytes
);
2068 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2069 /* CONTENTS contains no multibyte sequences or contains an invalid
2070 multibyte sequence. We must make unibyte string. */
2071 val
= make_unibyte_string (contents
, nbytes
);
2073 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2078 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2081 make_unibyte_string (const char *contents
, ptrdiff_t length
)
2083 register Lisp_Object val
;
2084 val
= make_uninit_string (length
);
2085 memcpy (SDATA (val
), contents
, length
);
2090 /* Make a multibyte string from NCHARS characters occupying NBYTES
2091 bytes at CONTENTS. */
2094 make_multibyte_string (const char *contents
,
2095 ptrdiff_t nchars
, ptrdiff_t nbytes
)
2097 register Lisp_Object val
;
2098 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2099 memcpy (SDATA (val
), contents
, nbytes
);
2104 /* Make a string from NCHARS characters occupying NBYTES bytes at
2105 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2108 make_string_from_bytes (const char *contents
,
2109 ptrdiff_t nchars
, ptrdiff_t nbytes
)
2111 register Lisp_Object val
;
2112 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2113 memcpy (SDATA (val
), contents
, nbytes
);
2114 if (SBYTES (val
) == SCHARS (val
))
2115 STRING_SET_UNIBYTE (val
);
2120 /* Make a string from NCHARS characters occupying NBYTES bytes at
2121 CONTENTS. The argument MULTIBYTE controls whether to label the
2122 string as multibyte. If NCHARS is negative, it counts the number of
2123 characters by itself. */
2126 make_specified_string (const char *contents
,
2127 ptrdiff_t nchars
, ptrdiff_t nbytes
, bool multibyte
)
2134 nchars
= multibyte_chars_in_text ((const unsigned char *) contents
,
2139 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2140 memcpy (SDATA (val
), contents
, nbytes
);
2142 STRING_SET_UNIBYTE (val
);
2147 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2148 occupying LENGTH bytes. */
2151 make_uninit_string (EMACS_INT length
)
2156 return empty_unibyte_string
;
2157 val
= make_uninit_multibyte_string (length
, length
);
2158 STRING_SET_UNIBYTE (val
);
2163 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2164 which occupy NBYTES bytes. */
2167 make_uninit_multibyte_string (EMACS_INT nchars
, EMACS_INT nbytes
)
2170 struct Lisp_String
*s
;
2175 return empty_multibyte_string
;
2177 s
= allocate_string ();
2178 s
->intervals
= NULL
;
2179 allocate_string_data (s
, nchars
, nbytes
);
2180 XSETSTRING (string
, s
);
2181 string_chars_consed
+= nbytes
;
2185 /* Print arguments to BUF according to a FORMAT, then return
2186 a Lisp_String initialized with the data from BUF. */
2189 make_formatted_string (char *buf
, const char *format
, ...)
2194 va_start (ap
, format
);
2195 length
= vsprintf (buf
, format
, ap
);
2197 return make_string (buf
, length
);
2201 /***********************************************************************
2203 ***********************************************************************/
2205 /* We store float cells inside of float_blocks, allocating a new
2206 float_block with malloc whenever necessary. Float cells reclaimed
2207 by GC are put on a free list to be reallocated before allocating
2208 any new float cells from the latest float_block. */
2210 #define FLOAT_BLOCK_SIZE \
2211 (((BLOCK_BYTES - sizeof (struct float_block *) \
2212 /* The compiler might add padding at the end. */ \
2213 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2214 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2216 #define GETMARKBIT(block,n) \
2217 (((block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2218 >> ((n) % (sizeof (int) * CHAR_BIT))) \
2221 #define SETMARKBIT(block,n) \
2222 (block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2223 |= 1 << ((n) % (sizeof (int) * CHAR_BIT))
2225 #define UNSETMARKBIT(block,n) \
2226 (block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2227 &= ~(1 << ((n) % (sizeof (int) * CHAR_BIT)))
2229 #define FLOAT_BLOCK(fptr) \
2230 ((struct float_block *) (((uintptr_t) (fptr)) & ~(BLOCK_ALIGN - 1)))
2232 #define FLOAT_INDEX(fptr) \
2233 ((((uintptr_t) (fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2237 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2238 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2239 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof (int) * CHAR_BIT
)];
2240 struct float_block
*next
;
2243 #define FLOAT_MARKED_P(fptr) \
2244 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2246 #define FLOAT_MARK(fptr) \
2247 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2249 #define FLOAT_UNMARK(fptr) \
2250 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2252 /* Current float_block. */
2254 static struct float_block
*float_block
;
2256 /* Index of first unused Lisp_Float in the current float_block. */
2258 static int float_block_index
= FLOAT_BLOCK_SIZE
;
2260 /* Free-list of Lisp_Floats. */
2262 static struct Lisp_Float
*float_free_list
;
2264 /* Return a new float object with value FLOAT_VALUE. */
2267 make_float (double float_value
)
2269 register Lisp_Object val
;
2273 if (float_free_list
)
2275 /* We use the data field for chaining the free list
2276 so that we won't use the same field that has the mark bit. */
2277 XSETFLOAT (val
, float_free_list
);
2278 float_free_list
= float_free_list
->u
.chain
;
2282 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2284 struct float_block
*new
2285 = lisp_align_malloc (sizeof *new, MEM_TYPE_FLOAT
);
2286 new->next
= float_block
;
2287 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2289 float_block_index
= 0;
2290 total_free_floats
+= FLOAT_BLOCK_SIZE
;
2292 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2293 float_block_index
++;
2296 MALLOC_UNBLOCK_INPUT
;
2298 XFLOAT_INIT (val
, float_value
);
2299 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2300 consing_since_gc
+= sizeof (struct Lisp_Float
);
2302 total_free_floats
--;
2308 /***********************************************************************
2310 ***********************************************************************/
2312 /* We store cons cells inside of cons_blocks, allocating a new
2313 cons_block with malloc whenever necessary. Cons cells reclaimed by
2314 GC are put on a free list to be reallocated before allocating
2315 any new cons cells from the latest cons_block. */
2317 #define CONS_BLOCK_SIZE \
2318 (((BLOCK_BYTES - sizeof (struct cons_block *) \
2319 /* The compiler might add padding at the end. */ \
2320 - (sizeof (struct Lisp_Cons) - sizeof (int))) * CHAR_BIT) \
2321 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2323 #define CONS_BLOCK(fptr) \
2324 ((struct cons_block *) ((uintptr_t) (fptr) & ~(BLOCK_ALIGN - 1)))
2326 #define CONS_INDEX(fptr) \
2327 (((uintptr_t) (fptr) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2331 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2332 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2333 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof (int) * CHAR_BIT
)];
2334 struct cons_block
*next
;
2337 #define CONS_MARKED_P(fptr) \
2338 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2340 #define CONS_MARK(fptr) \
2341 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2343 #define CONS_UNMARK(fptr) \
2344 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2346 /* Current cons_block. */
2348 static struct cons_block
*cons_block
;
2350 /* Index of first unused Lisp_Cons in the current block. */
2352 static int cons_block_index
= CONS_BLOCK_SIZE
;
2354 /* Free-list of Lisp_Cons structures. */
2356 static struct Lisp_Cons
*cons_free_list
;
2358 /* Explicitly free a cons cell by putting it on the free-list. */
2361 free_cons (struct Lisp_Cons
*ptr
)
2363 ptr
->u
.chain
= cons_free_list
;
2367 cons_free_list
= ptr
;
2368 consing_since_gc
-= sizeof *ptr
;
2369 total_free_conses
++;
2372 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2373 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2374 (Lisp_Object car
, Lisp_Object cdr
)
2376 register Lisp_Object val
;
2382 /* We use the cdr for chaining the free list
2383 so that we won't use the same field that has the mark bit. */
2384 XSETCONS (val
, cons_free_list
);
2385 cons_free_list
= cons_free_list
->u
.chain
;
2389 if (cons_block_index
== CONS_BLOCK_SIZE
)
2391 struct cons_block
*new
2392 = lisp_align_malloc (sizeof *new, MEM_TYPE_CONS
);
2393 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2394 new->next
= cons_block
;
2396 cons_block_index
= 0;
2397 total_free_conses
+= CONS_BLOCK_SIZE
;
2399 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2403 MALLOC_UNBLOCK_INPUT
;
2407 eassert (!CONS_MARKED_P (XCONS (val
)));
2408 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2409 total_free_conses
--;
2410 cons_cells_consed
++;
2414 #ifdef GC_CHECK_CONS_LIST
2415 /* Get an error now if there's any junk in the cons free list. */
2417 check_cons_list (void)
2419 struct Lisp_Cons
*tail
= cons_free_list
;
2422 tail
= tail
->u
.chain
;
2426 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2429 list1 (Lisp_Object arg1
)
2431 return Fcons (arg1
, Qnil
);
2435 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2437 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2442 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2444 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2449 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2451 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2456 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2458 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2459 Fcons (arg5
, Qnil
)))));
2462 /* Make a list of COUNT Lisp_Objects, where ARG is the
2463 first one. Allocate conses from pure space if TYPE
2464 is CONSTYPE_PURE, or allocate as usual if type is CONSTYPE_HEAP. */
2467 listn (enum constype type
, ptrdiff_t count
, Lisp_Object arg
, ...)
2471 Lisp_Object val
, *objp
;
2473 /* Change to SAFE_ALLOCA if you hit this eassert. */
2474 eassert (count
<= MAX_ALLOCA
/ word_size
);
2476 objp
= alloca (count
* word_size
);
2479 for (i
= 1; i
< count
; i
++)
2480 objp
[i
] = va_arg (ap
, Lisp_Object
);
2483 for (val
= Qnil
, i
= count
- 1; i
>= 0; i
--)
2485 if (type
== CONSTYPE_PURE
)
2486 val
= pure_cons (objp
[i
], val
);
2487 else if (type
== CONSTYPE_HEAP
)
2488 val
= Fcons (objp
[i
], val
);
2495 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2496 doc
: /* Return a newly created list with specified arguments as elements.
2497 Any number of arguments, even zero arguments, are allowed.
2498 usage: (list &rest OBJECTS) */)
2499 (ptrdiff_t nargs
, Lisp_Object
*args
)
2501 register Lisp_Object val
;
2507 val
= Fcons (args
[nargs
], val
);
2513 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2514 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2515 (register Lisp_Object length
, Lisp_Object init
)
2517 register Lisp_Object val
;
2518 register EMACS_INT size
;
2520 CHECK_NATNUM (length
);
2521 size
= XFASTINT (length
);
2526 val
= Fcons (init
, val
);
2531 val
= Fcons (init
, val
);
2536 val
= Fcons (init
, val
);
2541 val
= Fcons (init
, val
);
2546 val
= Fcons (init
, val
);
2561 /***********************************************************************
2563 ***********************************************************************/
2565 /* This value is balanced well enough to avoid too much internal overhead
2566 for the most common cases; it's not required to be a power of two, but
2567 it's expected to be a mult-of-ROUNDUP_SIZE (see below). */
2569 #define VECTOR_BLOCK_SIZE 4096
2571 /* Align allocation request sizes to be a multiple of ROUNDUP_SIZE. */
2574 roundup_size
= COMMON_MULTIPLE (word_size
, USE_LSB_TAG
? GCALIGNMENT
: 1)
2577 /* ROUNDUP_SIZE must be a power of 2. */
2578 verify ((roundup_size
& (roundup_size
- 1)) == 0);
2580 /* Verify assumptions described above. */
2581 verify ((VECTOR_BLOCK_SIZE
% roundup_size
) == 0);
2582 verify (VECTOR_BLOCK_SIZE
<= (1 << PSEUDOVECTOR_SIZE_BITS
));
2584 /* Round up X to nearest mult-of-ROUNDUP_SIZE. */
2586 #define vroundup(x) (((x) + (roundup_size - 1)) & ~(roundup_size - 1))
2588 /* Rounding helps to maintain alignment constraints if USE_LSB_TAG. */
2590 #define VECTOR_BLOCK_BYTES (VECTOR_BLOCK_SIZE - vroundup (sizeof (void *)))
2592 /* Size of the minimal vector allocated from block. */
2594 #define VBLOCK_BYTES_MIN vroundup (header_size + sizeof (Lisp_Object))
2596 /* Size of the largest vector allocated from block. */
2598 #define VBLOCK_BYTES_MAX \
2599 vroundup ((VECTOR_BLOCK_BYTES / 2) - word_size)
2601 /* We maintain one free list for each possible block-allocated
2602 vector size, and this is the number of free lists we have. */
2604 #define VECTOR_MAX_FREE_LIST_INDEX \
2605 ((VECTOR_BLOCK_BYTES - VBLOCK_BYTES_MIN) / roundup_size + 1)
2607 /* Common shortcut to advance vector pointer over a block data. */
2609 #define ADVANCE(v, nbytes) ((struct Lisp_Vector *) ((char *) (v) + (nbytes)))
2611 /* Common shortcut to calculate NBYTES-vector index in VECTOR_FREE_LISTS. */
2613 #define VINDEX(nbytes) (((nbytes) - VBLOCK_BYTES_MIN) / roundup_size)
2615 /* Get and set the next field in block-allocated vectorlike objects on
2616 the free list. Doing it this way respects C's aliasing rules.
2617 We could instead make 'contents' a union, but that would mean
2618 changes everywhere that the code uses 'contents'. */
2619 static struct Lisp_Vector
*
2620 next_in_free_list (struct Lisp_Vector
*v
)
2622 intptr_t i
= XLI (v
->contents
[0]);
2623 return (struct Lisp_Vector
*) i
;
2626 set_next_in_free_list (struct Lisp_Vector
*v
, struct Lisp_Vector
*next
)
2628 v
->contents
[0] = XIL ((intptr_t) next
);
2631 /* Common shortcut to setup vector on a free list. */
2633 #define SETUP_ON_FREE_LIST(v, nbytes, tmp) \
2635 (tmp) = ((nbytes - header_size) / word_size); \
2636 XSETPVECTYPESIZE (v, PVEC_FREE, 0, (tmp)); \
2637 eassert ((nbytes) % roundup_size == 0); \
2638 (tmp) = VINDEX (nbytes); \
2639 eassert ((tmp) < VECTOR_MAX_FREE_LIST_INDEX); \
2640 set_next_in_free_list (v, vector_free_lists[tmp]); \
2641 vector_free_lists[tmp] = (v); \
2642 total_free_vector_slots += (nbytes) / word_size; \
2645 /* This internal type is used to maintain the list of large vectors
2646 which are allocated at their own, e.g. outside of vector blocks. */
2651 struct large_vector
*vector
;
2653 /* We need to maintain ROUNDUP_SIZE alignment for the vector member. */
2654 unsigned char c
[vroundup (sizeof (struct large_vector
*))];
2657 struct Lisp_Vector v
;
2660 /* This internal type is used to maintain an underlying storage
2661 for small vectors. */
2665 char data
[VECTOR_BLOCK_BYTES
];
2666 struct vector_block
*next
;
2669 /* Chain of vector blocks. */
2671 static struct vector_block
*vector_blocks
;
2673 /* Vector free lists, where NTH item points to a chain of free
2674 vectors of the same NBYTES size, so NTH == VINDEX (NBYTES). */
2676 static struct Lisp_Vector
*vector_free_lists
[VECTOR_MAX_FREE_LIST_INDEX
];
2678 /* Singly-linked list of large vectors. */
2680 static struct large_vector
*large_vectors
;
2682 /* The only vector with 0 slots, allocated from pure space. */
2684 Lisp_Object zero_vector
;
2686 /* Number of live vectors. */
2688 static EMACS_INT total_vectors
;
2690 /* Total size of live and free vectors, in Lisp_Object units. */
2692 static EMACS_INT total_vector_slots
, total_free_vector_slots
;
2694 /* Get a new vector block. */
2696 static struct vector_block
*
2697 allocate_vector_block (void)
2699 struct vector_block
*block
= xmalloc (sizeof *block
);
2701 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
2702 mem_insert (block
->data
, block
->data
+ VECTOR_BLOCK_BYTES
,
2703 MEM_TYPE_VECTOR_BLOCK
);
2706 block
->next
= vector_blocks
;
2707 vector_blocks
= block
;
2711 /* Called once to initialize vector allocation. */
2716 zero_vector
= make_pure_vector (0);
2719 /* Allocate vector from a vector block. */
2721 static struct Lisp_Vector
*
2722 allocate_vector_from_block (size_t nbytes
)
2724 struct Lisp_Vector
*vector
;
2725 struct vector_block
*block
;
2726 size_t index
, restbytes
;
2728 eassert (VBLOCK_BYTES_MIN
<= nbytes
&& nbytes
<= VBLOCK_BYTES_MAX
);
2729 eassert (nbytes
% roundup_size
== 0);
2731 /* First, try to allocate from a free list
2732 containing vectors of the requested size. */
2733 index
= VINDEX (nbytes
);
2734 if (vector_free_lists
[index
])
2736 vector
= vector_free_lists
[index
];
2737 vector_free_lists
[index
] = next_in_free_list (vector
);
2738 total_free_vector_slots
-= nbytes
/ word_size
;
2742 /* Next, check free lists containing larger vectors. Since
2743 we will split the result, we should have remaining space
2744 large enough to use for one-slot vector at least. */
2745 for (index
= VINDEX (nbytes
+ VBLOCK_BYTES_MIN
);
2746 index
< VECTOR_MAX_FREE_LIST_INDEX
; index
++)
2747 if (vector_free_lists
[index
])
2749 /* This vector is larger than requested. */
2750 vector
= vector_free_lists
[index
];
2751 vector_free_lists
[index
] = next_in_free_list (vector
);
2752 total_free_vector_slots
-= nbytes
/ word_size
;
2754 /* Excess bytes are used for the smaller vector,
2755 which should be set on an appropriate free list. */
2756 restbytes
= index
* roundup_size
+ VBLOCK_BYTES_MIN
- nbytes
;
2757 eassert (restbytes
% roundup_size
== 0);
2758 SETUP_ON_FREE_LIST (ADVANCE (vector
, nbytes
), restbytes
, index
);
2762 /* Finally, need a new vector block. */
2763 block
= allocate_vector_block ();
2765 /* New vector will be at the beginning of this block. */
2766 vector
= (struct Lisp_Vector
*) block
->data
;
2768 /* If the rest of space from this block is large enough
2769 for one-slot vector at least, set up it on a free list. */
2770 restbytes
= VECTOR_BLOCK_BYTES
- nbytes
;
2771 if (restbytes
>= VBLOCK_BYTES_MIN
)
2773 eassert (restbytes
% roundup_size
== 0);
2774 SETUP_ON_FREE_LIST (ADVANCE (vector
, nbytes
), restbytes
, index
);
2779 /* Nonzero if VECTOR pointer is valid pointer inside BLOCK. */
2781 #define VECTOR_IN_BLOCK(vector, block) \
2782 ((char *) (vector) <= (block)->data \
2783 + VECTOR_BLOCK_BYTES - VBLOCK_BYTES_MIN)
2785 /* Return the memory footprint of V in bytes. */
2788 vector_nbytes (struct Lisp_Vector
*v
)
2790 ptrdiff_t size
= v
->header
.size
& ~ARRAY_MARK_FLAG
;
2792 if (size
& PSEUDOVECTOR_FLAG
)
2794 if (PSEUDOVECTOR_TYPEP (&v
->header
, PVEC_BOOL_VECTOR
))
2795 size
= (bool_header_size
2796 + (((struct Lisp_Bool_Vector
*) v
)->size
2797 + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2798 / BOOL_VECTOR_BITS_PER_CHAR
);
2801 + ((size
& PSEUDOVECTOR_SIZE_MASK
)
2802 + ((size
& PSEUDOVECTOR_REST_MASK
)
2803 >> PSEUDOVECTOR_SIZE_BITS
)) * word_size
);
2806 size
= header_size
+ size
* word_size
;
2807 return vroundup (size
);
2810 /* Reclaim space used by unmarked vectors. */
2813 sweep_vectors (void)
2815 struct vector_block
*block
= vector_blocks
, **bprev
= &vector_blocks
;
2816 struct large_vector
*lv
, **lvprev
= &large_vectors
;
2817 struct Lisp_Vector
*vector
, *next
;
2819 total_vectors
= total_vector_slots
= total_free_vector_slots
= 0;
2820 memset (vector_free_lists
, 0, sizeof (vector_free_lists
));
2822 /* Looking through vector blocks. */
2824 for (block
= vector_blocks
; block
; block
= *bprev
)
2826 bool free_this_block
= 0;
2829 for (vector
= (struct Lisp_Vector
*) block
->data
;
2830 VECTOR_IN_BLOCK (vector
, block
); vector
= next
)
2832 if (VECTOR_MARKED_P (vector
))
2834 VECTOR_UNMARK (vector
);
2836 nbytes
= vector_nbytes (vector
);
2837 total_vector_slots
+= nbytes
/ word_size
;
2838 next
= ADVANCE (vector
, nbytes
);
2842 ptrdiff_t total_bytes
;
2844 nbytes
= vector_nbytes (vector
);
2845 total_bytes
= nbytes
;
2846 next
= ADVANCE (vector
, nbytes
);
2848 /* While NEXT is not marked, try to coalesce with VECTOR,
2849 thus making VECTOR of the largest possible size. */
2851 while (VECTOR_IN_BLOCK (next
, block
))
2853 if (VECTOR_MARKED_P (next
))
2855 nbytes
= vector_nbytes (next
);
2856 total_bytes
+= nbytes
;
2857 next
= ADVANCE (next
, nbytes
);
2860 eassert (total_bytes
% roundup_size
== 0);
2862 if (vector
== (struct Lisp_Vector
*) block
->data
2863 && !VECTOR_IN_BLOCK (next
, block
))
2864 /* This block should be freed because all of it's
2865 space was coalesced into the only free vector. */
2866 free_this_block
= 1;
2870 SETUP_ON_FREE_LIST (vector
, total_bytes
, tmp
);
2875 if (free_this_block
)
2877 *bprev
= block
->next
;
2878 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
2879 mem_delete (mem_find (block
->data
));
2884 bprev
= &block
->next
;
2887 /* Sweep large vectors. */
2889 for (lv
= large_vectors
; lv
; lv
= *lvprev
)
2892 if (VECTOR_MARKED_P (vector
))
2894 VECTOR_UNMARK (vector
);
2896 if (vector
->header
.size
& PSEUDOVECTOR_FLAG
)
2898 struct Lisp_Bool_Vector
*b
= (struct Lisp_Bool_Vector
*) vector
;
2900 /* All non-bool pseudovectors are small enough to be allocated
2901 from vector blocks. This code should be redesigned if some
2902 pseudovector type grows beyond VBLOCK_BYTES_MAX. */
2903 eassert (PSEUDOVECTOR_TYPEP (&vector
->header
, PVEC_BOOL_VECTOR
));
2906 += (bool_header_size
2907 + ((b
->size
+ BOOL_VECTOR_BITS_PER_CHAR
- 1)
2908 / BOOL_VECTOR_BITS_PER_CHAR
)) / word_size
;
2912 += header_size
/ word_size
+ vector
->header
.size
;
2913 lvprev
= &lv
->next
.vector
;
2917 *lvprev
= lv
->next
.vector
;
2923 /* Value is a pointer to a newly allocated Lisp_Vector structure
2924 with room for LEN Lisp_Objects. */
2926 static struct Lisp_Vector
*
2927 allocate_vectorlike (ptrdiff_t len
)
2929 struct Lisp_Vector
*p
;
2934 p
= XVECTOR (zero_vector
);
2937 size_t nbytes
= header_size
+ len
* word_size
;
2939 #ifdef DOUG_LEA_MALLOC
2940 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2941 because mapped region contents are not preserved in
2943 mallopt (M_MMAP_MAX
, 0);
2946 if (nbytes
<= VBLOCK_BYTES_MAX
)
2947 p
= allocate_vector_from_block (vroundup (nbytes
));
2950 struct large_vector
*lv
2951 = lisp_malloc ((offsetof (struct large_vector
, v
.contents
)
2953 MEM_TYPE_VECTORLIKE
);
2954 lv
->next
.vector
= large_vectors
;
2959 #ifdef DOUG_LEA_MALLOC
2960 /* Back to a reasonable maximum of mmap'ed areas. */
2961 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2964 consing_since_gc
+= nbytes
;
2965 vector_cells_consed
+= len
;
2968 MALLOC_UNBLOCK_INPUT
;
2974 /* Allocate a vector with LEN slots. */
2976 struct Lisp_Vector
*
2977 allocate_vector (EMACS_INT len
)
2979 struct Lisp_Vector
*v
;
2980 ptrdiff_t nbytes_max
= min (PTRDIFF_MAX
, SIZE_MAX
);
2982 if (min ((nbytes_max
- header_size
) / word_size
, MOST_POSITIVE_FIXNUM
) < len
)
2983 memory_full (SIZE_MAX
);
2984 v
= allocate_vectorlike (len
);
2985 v
->header
.size
= len
;
2990 /* Allocate other vector-like structures. */
2992 struct Lisp_Vector
*
2993 allocate_pseudovector (int memlen
, int lisplen
, enum pvec_type tag
)
2995 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2998 /* Catch bogus values. */
2999 eassert (tag
<= PVEC_FONT
);
3000 eassert (memlen
- lisplen
<= (1 << PSEUDOVECTOR_REST_BITS
) - 1);
3001 eassert (lisplen
<= (1 << PSEUDOVECTOR_SIZE_BITS
) - 1);
3003 /* Only the first lisplen slots will be traced normally by the GC. */
3004 for (i
= 0; i
< lisplen
; ++i
)
3005 v
->contents
[i
] = Qnil
;
3007 XSETPVECTYPESIZE (v
, tag
, lisplen
, memlen
- lisplen
);
3012 allocate_buffer (void)
3014 struct buffer
*b
= lisp_malloc (sizeof *b
, MEM_TYPE_BUFFER
);
3016 BUFFER_PVEC_INIT (b
);
3017 /* Put B on the chain of all buffers including killed ones. */
3018 b
->next
= all_buffers
;
3020 /* Note that the rest fields of B are not initialized. */
3024 struct Lisp_Hash_Table
*
3025 allocate_hash_table (void)
3027 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
3031 allocate_window (void)
3035 w
= ALLOCATE_PSEUDOVECTOR (struct window
, current_matrix
, PVEC_WINDOW
);
3036 /* Users assumes that non-Lisp data is zeroed. */
3037 memset (&w
->current_matrix
, 0,
3038 sizeof (*w
) - offsetof (struct window
, current_matrix
));
3043 allocate_terminal (void)
3047 t
= ALLOCATE_PSEUDOVECTOR (struct terminal
, next_terminal
, PVEC_TERMINAL
);
3048 /* Users assumes that non-Lisp data is zeroed. */
3049 memset (&t
->next_terminal
, 0,
3050 sizeof (*t
) - offsetof (struct terminal
, next_terminal
));
3055 allocate_frame (void)
3059 f
= ALLOCATE_PSEUDOVECTOR (struct frame
, face_cache
, PVEC_FRAME
);
3060 /* Users assumes that non-Lisp data is zeroed. */
3061 memset (&f
->face_cache
, 0,
3062 sizeof (*f
) - offsetof (struct frame
, face_cache
));
3066 struct Lisp_Process
*
3067 allocate_process (void)
3069 struct Lisp_Process
*p
;
3071 p
= ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
3072 /* Users assumes that non-Lisp data is zeroed. */
3074 sizeof (*p
) - offsetof (struct Lisp_Process
, pid
));
3078 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3079 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3080 See also the function `vector'. */)
3081 (register Lisp_Object length
, Lisp_Object init
)
3084 register ptrdiff_t sizei
;
3085 register ptrdiff_t i
;
3086 register struct Lisp_Vector
*p
;
3088 CHECK_NATNUM (length
);
3090 p
= allocate_vector (XFASTINT (length
));
3091 sizei
= XFASTINT (length
);
3092 for (i
= 0; i
< sizei
; i
++)
3093 p
->contents
[i
] = init
;
3095 XSETVECTOR (vector
, p
);
3100 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3101 doc
: /* Return a newly created vector with specified arguments as elements.
3102 Any number of arguments, even zero arguments, are allowed.
3103 usage: (vector &rest OBJECTS) */)
3104 (ptrdiff_t nargs
, Lisp_Object
*args
)
3107 register Lisp_Object val
= make_uninit_vector (nargs
);
3108 register struct Lisp_Vector
*p
= XVECTOR (val
);
3110 for (i
= 0; i
< nargs
; i
++)
3111 p
->contents
[i
] = args
[i
];
3116 make_byte_code (struct Lisp_Vector
*v
)
3118 if (v
->header
.size
> 1 && STRINGP (v
->contents
[1])
3119 && STRING_MULTIBYTE (v
->contents
[1]))
3120 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3121 earlier because they produced a raw 8-bit string for byte-code
3122 and now such a byte-code string is loaded as multibyte while
3123 raw 8-bit characters converted to multibyte form. Thus, now we
3124 must convert them back to the original unibyte form. */
3125 v
->contents
[1] = Fstring_as_unibyte (v
->contents
[1]);
3126 XSETPVECTYPE (v
, PVEC_COMPILED
);
3129 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3130 doc
: /* Create a byte-code object with specified arguments as elements.
3131 The arguments should be the ARGLIST, bytecode-string BYTE-CODE, constant
3132 vector CONSTANTS, maximum stack size DEPTH, (optional) DOCSTRING,
3133 and (optional) INTERACTIVE-SPEC.
3134 The first four arguments are required; at most six have any
3136 The ARGLIST can be either like the one of `lambda', in which case the arguments
3137 will be dynamically bound before executing the byte code, or it can be an
3138 integer of the form NNNNNNNRMMMMMMM where the 7bit MMMMMMM specifies the
3139 minimum number of arguments, the 7-bit NNNNNNN specifies the maximum number
3140 of arguments (ignoring &rest) and the R bit specifies whether there is a &rest
3141 argument to catch the left-over arguments. If such an integer is used, the
3142 arguments will not be dynamically bound but will be instead pushed on the
3143 stack before executing the byte-code.
3144 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3145 (ptrdiff_t nargs
, Lisp_Object
*args
)
3148 register Lisp_Object val
= make_uninit_vector (nargs
);
3149 register struct Lisp_Vector
*p
= XVECTOR (val
);
3151 /* We used to purecopy everything here, if purify-flag was set. This worked
3152 OK for Emacs-23, but with Emacs-24's lexical binding code, it can be
3153 dangerous, since make-byte-code is used during execution to build
3154 closures, so any closure built during the preload phase would end up
3155 copied into pure space, including its free variables, which is sometimes
3156 just wasteful and other times plainly wrong (e.g. those free vars may want
3159 for (i
= 0; i
< nargs
; i
++)
3160 p
->contents
[i
] = args
[i
];
3162 XSETCOMPILED (val
, p
);
3168 /***********************************************************************
3170 ***********************************************************************/
3172 /* Like struct Lisp_Symbol, but padded so that the size is a multiple
3173 of the required alignment if LSB tags are used. */
3175 union aligned_Lisp_Symbol
3177 struct Lisp_Symbol s
;
3179 unsigned char c
[(sizeof (struct Lisp_Symbol
) + GCALIGNMENT
- 1)
3184 /* Each symbol_block is just under 1020 bytes long, since malloc
3185 really allocates in units of powers of two and uses 4 bytes for its
3188 #define SYMBOL_BLOCK_SIZE \
3189 ((1020 - sizeof (struct symbol_block *)) / sizeof (union aligned_Lisp_Symbol))
3193 /* Place `symbols' first, to preserve alignment. */
3194 union aligned_Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3195 struct symbol_block
*next
;
3198 /* Current symbol block and index of first unused Lisp_Symbol
3201 static struct symbol_block
*symbol_block
;
3202 static int symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3204 /* List of free symbols. */
3206 static struct Lisp_Symbol
*symbol_free_list
;
3209 set_symbol_name (Lisp_Object sym
, Lisp_Object name
)
3211 XSYMBOL (sym
)->name
= name
;
3214 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3215 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3216 Its value is void, and its function definition and property list are nil. */)
3219 register Lisp_Object val
;
3220 register struct Lisp_Symbol
*p
;
3222 CHECK_STRING (name
);
3226 if (symbol_free_list
)
3228 XSETSYMBOL (val
, symbol_free_list
);
3229 symbol_free_list
= symbol_free_list
->next
;
3233 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3235 struct symbol_block
*new
3236 = lisp_malloc (sizeof *new, MEM_TYPE_SYMBOL
);
3237 new->next
= symbol_block
;
3239 symbol_block_index
= 0;
3240 total_free_symbols
+= SYMBOL_BLOCK_SIZE
;
3242 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
].s
);
3243 symbol_block_index
++;
3246 MALLOC_UNBLOCK_INPUT
;
3249 set_symbol_name (val
, name
);
3250 set_symbol_plist (val
, Qnil
);
3251 p
->redirect
= SYMBOL_PLAINVAL
;
3252 SET_SYMBOL_VAL (p
, Qunbound
);
3253 set_symbol_function (val
, Qnil
);
3254 set_symbol_next (val
, NULL
);
3256 p
->interned
= SYMBOL_UNINTERNED
;
3258 p
->declared_special
= 0;
3259 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3261 total_free_symbols
--;
3267 /***********************************************************************
3268 Marker (Misc) Allocation
3269 ***********************************************************************/
3271 /* Like union Lisp_Misc, but padded so that its size is a multiple of
3272 the required alignment when LSB tags are used. */
3274 union aligned_Lisp_Misc
3278 unsigned char c
[(sizeof (union Lisp_Misc
) + GCALIGNMENT
- 1)
3283 /* Allocation of markers and other objects that share that structure.
3284 Works like allocation of conses. */
3286 #define MARKER_BLOCK_SIZE \
3287 ((1020 - sizeof (struct marker_block *)) / sizeof (union aligned_Lisp_Misc))
3291 /* Place `markers' first, to preserve alignment. */
3292 union aligned_Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3293 struct marker_block
*next
;
3296 static struct marker_block
*marker_block
;
3297 static int marker_block_index
= MARKER_BLOCK_SIZE
;
3299 static union Lisp_Misc
*marker_free_list
;
3301 /* Return a newly allocated Lisp_Misc object of specified TYPE. */
3304 allocate_misc (enum Lisp_Misc_Type type
)
3310 if (marker_free_list
)
3312 XSETMISC (val
, marker_free_list
);
3313 marker_free_list
= marker_free_list
->u_free
.chain
;
3317 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3319 struct marker_block
*new = lisp_malloc (sizeof *new, MEM_TYPE_MISC
);
3320 new->next
= marker_block
;
3322 marker_block_index
= 0;
3323 total_free_markers
+= MARKER_BLOCK_SIZE
;
3325 XSETMISC (val
, &marker_block
->markers
[marker_block_index
].m
);
3326 marker_block_index
++;
3329 MALLOC_UNBLOCK_INPUT
;
3331 --total_free_markers
;
3332 consing_since_gc
+= sizeof (union Lisp_Misc
);
3333 misc_objects_consed
++;
3334 XMISCANY (val
)->type
= type
;
3335 XMISCANY (val
)->gcmarkbit
= 0;
3339 /* Free a Lisp_Misc object. */
3342 free_misc (Lisp_Object misc
)
3344 XMISCANY (misc
)->type
= Lisp_Misc_Free
;
3345 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3346 marker_free_list
= XMISC (misc
);
3347 consing_since_gc
-= sizeof (union Lisp_Misc
);
3348 total_free_markers
++;
3351 /* Verify properties of Lisp_Save_Value's representation
3352 that are assumed here and elsewhere. */
3354 verify (SAVE_UNUSED
== 0);
3355 verify ((SAVE_INTEGER
| SAVE_POINTER
| SAVE_OBJECT
) >> SAVE_SLOT_BITS
== 0);
3357 /* Return a Lisp_Save_Value object with the data saved according to
3358 DATA_TYPE. DATA_TYPE should be one of SAVE_TYPE_INT_INT, etc. */
3361 make_save_value (enum Lisp_Save_Type save_type
, ...)
3365 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3366 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3368 eassert (0 < save_type
3369 && (save_type
< 1 << (SAVE_TYPE_BITS
- 1)
3370 || save_type
== SAVE_TYPE_MEMORY
));
3371 p
->save_type
= save_type
;
3372 va_start (ap
, save_type
);
3373 save_type
&= ~ (1 << (SAVE_TYPE_BITS
- 1));
3375 for (i
= 0; save_type
; i
++, save_type
>>= SAVE_SLOT_BITS
)
3376 switch (save_type
& ((1 << SAVE_SLOT_BITS
) - 1))
3379 p
->data
[i
].pointer
= va_arg (ap
, void *);
3383 p
->data
[i
].integer
= va_arg (ap
, ptrdiff_t);
3387 p
->data
[i
].object
= va_arg (ap
, Lisp_Object
);
3398 /* The most common task it to save just one C pointer. */
3401 make_save_pointer (void *pointer
)
3403 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3404 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3405 p
->save_type
= SAVE_POINTER
;
3406 p
->data
[0].pointer
= pointer
;
3410 /* Free a Lisp_Save_Value object. Do not use this function
3411 if SAVE contains pointer other than returned by xmalloc. */
3414 free_save_value (Lisp_Object save
)
3416 xfree (XSAVE_POINTER (save
, 0));
3420 /* Return a Lisp_Misc_Overlay object with specified START, END and PLIST. */
3423 build_overlay (Lisp_Object start
, Lisp_Object end
, Lisp_Object plist
)
3425 register Lisp_Object overlay
;
3427 overlay
= allocate_misc (Lisp_Misc_Overlay
);
3428 OVERLAY_START (overlay
) = start
;
3429 OVERLAY_END (overlay
) = end
;
3430 set_overlay_plist (overlay
, plist
);
3431 XOVERLAY (overlay
)->next
= NULL
;
3435 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3436 doc
: /* Return a newly allocated marker which does not point at any place. */)
3439 register Lisp_Object val
;
3440 register struct Lisp_Marker
*p
;
3442 val
= allocate_misc (Lisp_Misc_Marker
);
3448 p
->insertion_type
= 0;
3452 /* Return a newly allocated marker which points into BUF
3453 at character position CHARPOS and byte position BYTEPOS. */
3456 build_marker (struct buffer
*buf
, ptrdiff_t charpos
, ptrdiff_t bytepos
)
3459 struct Lisp_Marker
*m
;
3461 /* No dead buffers here. */
3462 eassert (BUFFER_LIVE_P (buf
));
3464 /* Every character is at least one byte. */
3465 eassert (charpos
<= bytepos
);
3467 obj
= allocate_misc (Lisp_Misc_Marker
);
3470 m
->charpos
= charpos
;
3471 m
->bytepos
= bytepos
;
3472 m
->insertion_type
= 0;
3473 m
->next
= BUF_MARKERS (buf
);
3474 BUF_MARKERS (buf
) = m
;
3478 /* Put MARKER back on the free list after using it temporarily. */
3481 free_marker (Lisp_Object marker
)
3483 unchain_marker (XMARKER (marker
));
3488 /* Return a newly created vector or string with specified arguments as
3489 elements. If all the arguments are characters that can fit
3490 in a string of events, make a string; otherwise, make a vector.
3492 Any number of arguments, even zero arguments, are allowed. */
3495 make_event_array (register int nargs
, Lisp_Object
*args
)
3499 for (i
= 0; i
< nargs
; i
++)
3500 /* The things that fit in a string
3501 are characters that are in 0...127,
3502 after discarding the meta bit and all the bits above it. */
3503 if (!INTEGERP (args
[i
])
3504 || (XINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3505 return Fvector (nargs
, args
);
3507 /* Since the loop exited, we know that all the things in it are
3508 characters, so we can make a string. */
3512 result
= Fmake_string (make_number (nargs
), make_number (0));
3513 for (i
= 0; i
< nargs
; i
++)
3515 SSET (result
, i
, XINT (args
[i
]));
3516 /* Move the meta bit to the right place for a string char. */
3517 if (XINT (args
[i
]) & CHAR_META
)
3518 SSET (result
, i
, SREF (result
, i
) | 0x80);
3527 /************************************************************************
3528 Memory Full Handling
3529 ************************************************************************/
3532 /* Called if malloc (NBYTES) returns zero. If NBYTES == SIZE_MAX,
3533 there may have been size_t overflow so that malloc was never
3534 called, or perhaps malloc was invoked successfully but the
3535 resulting pointer had problems fitting into a tagged EMACS_INT. In
3536 either case this counts as memory being full even though malloc did
3540 memory_full (size_t nbytes
)
3542 /* Do not go into hysterics merely because a large request failed. */
3543 bool enough_free_memory
= 0;
3544 if (SPARE_MEMORY
< nbytes
)
3549 p
= malloc (SPARE_MEMORY
);
3553 enough_free_memory
= 1;
3555 MALLOC_UNBLOCK_INPUT
;
3558 if (! enough_free_memory
)
3564 memory_full_cons_threshold
= sizeof (struct cons_block
);
3566 /* The first time we get here, free the spare memory. */
3567 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3568 if (spare_memory
[i
])
3571 free (spare_memory
[i
]);
3572 else if (i
>= 1 && i
<= 4)
3573 lisp_align_free (spare_memory
[i
]);
3575 lisp_free (spare_memory
[i
]);
3576 spare_memory
[i
] = 0;
3580 /* This used to call error, but if we've run out of memory, we could
3581 get infinite recursion trying to build the string. */
3582 xsignal (Qnil
, Vmemory_signal_data
);
3585 /* If we released our reserve (due to running out of memory),
3586 and we have a fair amount free once again,
3587 try to set aside another reserve in case we run out once more.
3589 This is called when a relocatable block is freed in ralloc.c,
3590 and also directly from this file, in case we're not using ralloc.c. */
3593 refill_memory_reserve (void)
3595 #ifndef SYSTEM_MALLOC
3596 if (spare_memory
[0] == 0)
3597 spare_memory
[0] = malloc (SPARE_MEMORY
);
3598 if (spare_memory
[1] == 0)
3599 spare_memory
[1] = lisp_align_malloc (sizeof (struct cons_block
),
3601 if (spare_memory
[2] == 0)
3602 spare_memory
[2] = lisp_align_malloc (sizeof (struct cons_block
),
3604 if (spare_memory
[3] == 0)
3605 spare_memory
[3] = lisp_align_malloc (sizeof (struct cons_block
),
3607 if (spare_memory
[4] == 0)
3608 spare_memory
[4] = lisp_align_malloc (sizeof (struct cons_block
),
3610 if (spare_memory
[5] == 0)
3611 spare_memory
[5] = lisp_malloc (sizeof (struct string_block
),
3613 if (spare_memory
[6] == 0)
3614 spare_memory
[6] = lisp_malloc (sizeof (struct string_block
),
3616 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3617 Vmemory_full
= Qnil
;
3621 /************************************************************************
3623 ************************************************************************/
3625 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3627 /* Conservative C stack marking requires a method to identify possibly
3628 live Lisp objects given a pointer value. We do this by keeping
3629 track of blocks of Lisp data that are allocated in a red-black tree
3630 (see also the comment of mem_node which is the type of nodes in
3631 that tree). Function lisp_malloc adds information for an allocated
3632 block to the red-black tree with calls to mem_insert, and function
3633 lisp_free removes it with mem_delete. Functions live_string_p etc
3634 call mem_find to lookup information about a given pointer in the
3635 tree, and use that to determine if the pointer points to a Lisp
3638 /* Initialize this part of alloc.c. */
3643 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3644 mem_z
.parent
= NULL
;
3645 mem_z
.color
= MEM_BLACK
;
3646 mem_z
.start
= mem_z
.end
= NULL
;
3651 /* Value is a pointer to the mem_node containing START. Value is
3652 MEM_NIL if there is no node in the tree containing START. */
3654 static struct mem_node
*
3655 mem_find (void *start
)
3659 if (start
< min_heap_address
|| start
> max_heap_address
)
3662 /* Make the search always successful to speed up the loop below. */
3663 mem_z
.start
= start
;
3664 mem_z
.end
= (char *) start
+ 1;
3667 while (start
< p
->start
|| start
>= p
->end
)
3668 p
= start
< p
->start
? p
->left
: p
->right
;
3673 /* Insert a new node into the tree for a block of memory with start
3674 address START, end address END, and type TYPE. Value is a
3675 pointer to the node that was inserted. */
3677 static struct mem_node
*
3678 mem_insert (void *start
, void *end
, enum mem_type type
)
3680 struct mem_node
*c
, *parent
, *x
;
3682 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3683 min_heap_address
= start
;
3684 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3685 max_heap_address
= end
;
3687 /* See where in the tree a node for START belongs. In this
3688 particular application, it shouldn't happen that a node is already
3689 present. For debugging purposes, let's check that. */
3693 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3695 while (c
!= MEM_NIL
)
3697 if (start
>= c
->start
&& start
< c
->end
)
3700 c
= start
< c
->start
? c
->left
: c
->right
;
3703 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3705 while (c
!= MEM_NIL
)
3708 c
= start
< c
->start
? c
->left
: c
->right
;
3711 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3713 /* Create a new node. */
3714 #ifdef GC_MALLOC_CHECK
3715 x
= malloc (sizeof *x
);
3719 x
= xmalloc (sizeof *x
);
3725 x
->left
= x
->right
= MEM_NIL
;
3728 /* Insert it as child of PARENT or install it as root. */
3731 if (start
< parent
->start
)
3739 /* Re-establish red-black tree properties. */
3740 mem_insert_fixup (x
);
3746 /* Re-establish the red-black properties of the tree, and thereby
3747 balance the tree, after node X has been inserted; X is always red. */
3750 mem_insert_fixup (struct mem_node
*x
)
3752 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3754 /* X is red and its parent is red. This is a violation of
3755 red-black tree property #3. */
3757 if (x
->parent
== x
->parent
->parent
->left
)
3759 /* We're on the left side of our grandparent, and Y is our
3761 struct mem_node
*y
= x
->parent
->parent
->right
;
3763 if (y
->color
== MEM_RED
)
3765 /* Uncle and parent are red but should be black because
3766 X is red. Change the colors accordingly and proceed
3767 with the grandparent. */
3768 x
->parent
->color
= MEM_BLACK
;
3769 y
->color
= MEM_BLACK
;
3770 x
->parent
->parent
->color
= MEM_RED
;
3771 x
= x
->parent
->parent
;
3775 /* Parent and uncle have different colors; parent is
3776 red, uncle is black. */
3777 if (x
== x
->parent
->right
)
3780 mem_rotate_left (x
);
3783 x
->parent
->color
= MEM_BLACK
;
3784 x
->parent
->parent
->color
= MEM_RED
;
3785 mem_rotate_right (x
->parent
->parent
);
3790 /* This is the symmetrical case of above. */
3791 struct mem_node
*y
= x
->parent
->parent
->left
;
3793 if (y
->color
== MEM_RED
)
3795 x
->parent
->color
= MEM_BLACK
;
3796 y
->color
= MEM_BLACK
;
3797 x
->parent
->parent
->color
= MEM_RED
;
3798 x
= x
->parent
->parent
;
3802 if (x
== x
->parent
->left
)
3805 mem_rotate_right (x
);
3808 x
->parent
->color
= MEM_BLACK
;
3809 x
->parent
->parent
->color
= MEM_RED
;
3810 mem_rotate_left (x
->parent
->parent
);
3815 /* The root may have been changed to red due to the algorithm. Set
3816 it to black so that property #5 is satisfied. */
3817 mem_root
->color
= MEM_BLACK
;
3828 mem_rotate_left (struct mem_node
*x
)
3832 /* Turn y's left sub-tree into x's right sub-tree. */
3835 if (y
->left
!= MEM_NIL
)
3836 y
->left
->parent
= x
;
3838 /* Y's parent was x's parent. */
3840 y
->parent
= x
->parent
;
3842 /* Get the parent to point to y instead of x. */
3845 if (x
== x
->parent
->left
)
3846 x
->parent
->left
= y
;
3848 x
->parent
->right
= y
;
3853 /* Put x on y's left. */
3867 mem_rotate_right (struct mem_node
*x
)
3869 struct mem_node
*y
= x
->left
;
3872 if (y
->right
!= MEM_NIL
)
3873 y
->right
->parent
= x
;
3876 y
->parent
= x
->parent
;
3879 if (x
== x
->parent
->right
)
3880 x
->parent
->right
= y
;
3882 x
->parent
->left
= y
;
3893 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3896 mem_delete (struct mem_node
*z
)
3898 struct mem_node
*x
, *y
;
3900 if (!z
|| z
== MEM_NIL
)
3903 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3908 while (y
->left
!= MEM_NIL
)
3912 if (y
->left
!= MEM_NIL
)
3917 x
->parent
= y
->parent
;
3920 if (y
== y
->parent
->left
)
3921 y
->parent
->left
= x
;
3923 y
->parent
->right
= x
;
3930 z
->start
= y
->start
;
3935 if (y
->color
== MEM_BLACK
)
3936 mem_delete_fixup (x
);
3938 #ifdef GC_MALLOC_CHECK
3946 /* Re-establish the red-black properties of the tree, after a
3950 mem_delete_fixup (struct mem_node
*x
)
3952 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3954 if (x
== x
->parent
->left
)
3956 struct mem_node
*w
= x
->parent
->right
;
3958 if (w
->color
== MEM_RED
)
3960 w
->color
= MEM_BLACK
;
3961 x
->parent
->color
= MEM_RED
;
3962 mem_rotate_left (x
->parent
);
3963 w
= x
->parent
->right
;
3966 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3973 if (w
->right
->color
== MEM_BLACK
)
3975 w
->left
->color
= MEM_BLACK
;
3977 mem_rotate_right (w
);
3978 w
= x
->parent
->right
;
3980 w
->color
= x
->parent
->color
;
3981 x
->parent
->color
= MEM_BLACK
;
3982 w
->right
->color
= MEM_BLACK
;
3983 mem_rotate_left (x
->parent
);
3989 struct mem_node
*w
= x
->parent
->left
;
3991 if (w
->color
== MEM_RED
)
3993 w
->color
= MEM_BLACK
;
3994 x
->parent
->color
= MEM_RED
;
3995 mem_rotate_right (x
->parent
);
3996 w
= x
->parent
->left
;
3999 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
4006 if (w
->left
->color
== MEM_BLACK
)
4008 w
->right
->color
= MEM_BLACK
;
4010 mem_rotate_left (w
);
4011 w
= x
->parent
->left
;
4014 w
->color
= x
->parent
->color
;
4015 x
->parent
->color
= MEM_BLACK
;
4016 w
->left
->color
= MEM_BLACK
;
4017 mem_rotate_right (x
->parent
);
4023 x
->color
= MEM_BLACK
;
4027 /* Value is non-zero if P is a pointer to a live Lisp string on
4028 the heap. M is a pointer to the mem_block for P. */
4031 live_string_p (struct mem_node
*m
, void *p
)
4033 if (m
->type
== MEM_TYPE_STRING
)
4035 struct string_block
*b
= (struct string_block
*) m
->start
;
4036 ptrdiff_t offset
= (char *) p
- (char *) &b
->strings
[0];
4038 /* P must point to the start of a Lisp_String structure, and it
4039 must not be on the free-list. */
4041 && offset
% sizeof b
->strings
[0] == 0
4042 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
4043 && ((struct Lisp_String
*) p
)->data
!= NULL
);
4050 /* Value is non-zero if P is a pointer to a live Lisp cons on
4051 the heap. M is a pointer to the mem_block for P. */
4054 live_cons_p (struct mem_node
*m
, void *p
)
4056 if (m
->type
== MEM_TYPE_CONS
)
4058 struct cons_block
*b
= (struct cons_block
*) m
->start
;
4059 ptrdiff_t offset
= (char *) p
- (char *) &b
->conses
[0];
4061 /* P must point to the start of a Lisp_Cons, not be
4062 one of the unused cells in the current cons block,
4063 and not be on the free-list. */
4065 && offset
% sizeof b
->conses
[0] == 0
4066 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
4068 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
4069 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
4076 /* Value is non-zero if P is a pointer to a live Lisp symbol on
4077 the heap. M is a pointer to the mem_block for P. */
4080 live_symbol_p (struct mem_node
*m
, void *p
)
4082 if (m
->type
== MEM_TYPE_SYMBOL
)
4084 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
4085 ptrdiff_t offset
= (char *) p
- (char *) &b
->symbols
[0];
4087 /* P must point to the start of a Lisp_Symbol, not be
4088 one of the unused cells in the current symbol block,
4089 and not be on the free-list. */
4091 && offset
% sizeof b
->symbols
[0] == 0
4092 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
4093 && (b
!= symbol_block
4094 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
4095 && !EQ (((struct Lisp_Symbol
*)p
)->function
, Vdead
));
4102 /* Value is non-zero if P is a pointer to a live Lisp float on
4103 the heap. M is a pointer to the mem_block for P. */
4106 live_float_p (struct mem_node
*m
, void *p
)
4108 if (m
->type
== MEM_TYPE_FLOAT
)
4110 struct float_block
*b
= (struct float_block
*) m
->start
;
4111 ptrdiff_t offset
= (char *) p
- (char *) &b
->floats
[0];
4113 /* P must point to the start of a Lisp_Float and not be
4114 one of the unused cells in the current float block. */
4116 && offset
% sizeof b
->floats
[0] == 0
4117 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
4118 && (b
!= float_block
4119 || offset
/ sizeof b
->floats
[0] < float_block_index
));
4126 /* Value is non-zero if P is a pointer to a live Lisp Misc on
4127 the heap. M is a pointer to the mem_block for P. */
4130 live_misc_p (struct mem_node
*m
, void *p
)
4132 if (m
->type
== MEM_TYPE_MISC
)
4134 struct marker_block
*b
= (struct marker_block
*) m
->start
;
4135 ptrdiff_t offset
= (char *) p
- (char *) &b
->markers
[0];
4137 /* P must point to the start of a Lisp_Misc, not be
4138 one of the unused cells in the current misc block,
4139 and not be on the free-list. */
4141 && offset
% sizeof b
->markers
[0] == 0
4142 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4143 && (b
!= marker_block
4144 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4145 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
4152 /* Value is non-zero if P is a pointer to a live vector-like object.
4153 M is a pointer to the mem_block for P. */
4156 live_vector_p (struct mem_node
*m
, void *p
)
4158 if (m
->type
== MEM_TYPE_VECTOR_BLOCK
)
4160 /* This memory node corresponds to a vector block. */
4161 struct vector_block
*block
= (struct vector_block
*) m
->start
;
4162 struct Lisp_Vector
*vector
= (struct Lisp_Vector
*) block
->data
;
4164 /* P is in the block's allocation range. Scan the block
4165 up to P and see whether P points to the start of some
4166 vector which is not on a free list. FIXME: check whether
4167 some allocation patterns (probably a lot of short vectors)
4168 may cause a substantial overhead of this loop. */
4169 while (VECTOR_IN_BLOCK (vector
, block
)
4170 && vector
<= (struct Lisp_Vector
*) p
)
4172 if (!PSEUDOVECTOR_TYPEP (&vector
->header
, PVEC_FREE
) && vector
== p
)
4175 vector
= ADVANCE (vector
, vector_nbytes (vector
));
4178 else if (m
->type
== MEM_TYPE_VECTORLIKE
4179 && (char *) p
== ((char *) m
->start
4180 + offsetof (struct large_vector
, v
)))
4181 /* This memory node corresponds to a large vector. */
4187 /* Value is non-zero if P is a pointer to a live buffer. M is a
4188 pointer to the mem_block for P. */
4191 live_buffer_p (struct mem_node
*m
, void *p
)
4193 /* P must point to the start of the block, and the buffer
4194 must not have been killed. */
4195 return (m
->type
== MEM_TYPE_BUFFER
4197 && !NILP (((struct buffer
*) p
)->INTERNAL_FIELD (name
)));
4200 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4204 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4206 /* Array of objects that are kept alive because the C stack contains
4207 a pattern that looks like a reference to them . */
4209 #define MAX_ZOMBIES 10
4210 static Lisp_Object zombies
[MAX_ZOMBIES
];
4212 /* Number of zombie objects. */
4214 static EMACS_INT nzombies
;
4216 /* Number of garbage collections. */
4218 static EMACS_INT ngcs
;
4220 /* Average percentage of zombies per collection. */
4222 static double avg_zombies
;
4224 /* Max. number of live and zombie objects. */
4226 static EMACS_INT max_live
, max_zombies
;
4228 /* Average number of live objects per GC. */
4230 static double avg_live
;
4232 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4233 doc
: /* Show information about live and zombie objects. */)
4236 Lisp_Object args
[8], zombie_list
= Qnil
;
4238 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); i
++)
4239 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4240 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4241 args
[1] = make_number (ngcs
);
4242 args
[2] = make_float (avg_live
);
4243 args
[3] = make_float (avg_zombies
);
4244 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4245 args
[5] = make_number (max_live
);
4246 args
[6] = make_number (max_zombies
);
4247 args
[7] = zombie_list
;
4248 return Fmessage (8, args
);
4251 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4254 /* Mark OBJ if we can prove it's a Lisp_Object. */
4257 mark_maybe_object (Lisp_Object obj
)
4265 po
= (void *) XPNTR (obj
);
4272 switch (XTYPE (obj
))
4275 mark_p
= (live_string_p (m
, po
)
4276 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4280 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4284 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4288 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4291 case Lisp_Vectorlike
:
4292 /* Note: can't check BUFFERP before we know it's a
4293 buffer because checking that dereferences the pointer
4294 PO which might point anywhere. */
4295 if (live_vector_p (m
, po
))
4296 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4297 else if (live_buffer_p (m
, po
))
4298 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4302 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4311 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4312 if (nzombies
< MAX_ZOMBIES
)
4313 zombies
[nzombies
] = obj
;
4322 /* If P points to Lisp data, mark that as live if it isn't already
4326 mark_maybe_pointer (void *p
)
4330 /* Quickly rule out some values which can't point to Lisp data.
4331 USE_LSB_TAG needs Lisp data to be aligned on multiples of GCALIGNMENT.
4332 Otherwise, assume that Lisp data is aligned on even addresses. */
4333 if ((intptr_t) p
% (USE_LSB_TAG
? GCALIGNMENT
: 2))
4339 Lisp_Object obj
= Qnil
;
4343 case MEM_TYPE_NON_LISP
:
4344 case MEM_TYPE_SPARE
:
4345 /* Nothing to do; not a pointer to Lisp memory. */
4348 case MEM_TYPE_BUFFER
:
4349 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P ((struct buffer
*)p
))
4350 XSETVECTOR (obj
, p
);
4354 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4358 case MEM_TYPE_STRING
:
4359 if (live_string_p (m
, p
)
4360 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4361 XSETSTRING (obj
, p
);
4365 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4369 case MEM_TYPE_SYMBOL
:
4370 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4371 XSETSYMBOL (obj
, p
);
4374 case MEM_TYPE_FLOAT
:
4375 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4379 case MEM_TYPE_VECTORLIKE
:
4380 case MEM_TYPE_VECTOR_BLOCK
:
4381 if (live_vector_p (m
, p
))
4384 XSETVECTOR (tem
, p
);
4385 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4400 /* Alignment of pointer values. Use alignof, as it sometimes returns
4401 a smaller alignment than GCC's __alignof__ and mark_memory might
4402 miss objects if __alignof__ were used. */
4403 #define GC_POINTER_ALIGNMENT alignof (void *)
4405 /* Define POINTERS_MIGHT_HIDE_IN_OBJECTS to 1 if marking via C pointers does
4406 not suffice, which is the typical case. A host where a Lisp_Object is
4407 wider than a pointer might allocate a Lisp_Object in non-adjacent halves.
4408 If USE_LSB_TAG, the bottom half is not a valid pointer, but it should
4409 suffice to widen it to to a Lisp_Object and check it that way. */
4410 #if USE_LSB_TAG || VAL_MAX < UINTPTR_MAX
4411 # if !USE_LSB_TAG && VAL_MAX < UINTPTR_MAX >> GCTYPEBITS
4412 /* If tag bits straddle pointer-word boundaries, neither mark_maybe_pointer
4413 nor mark_maybe_object can follow the pointers. This should not occur on
4414 any practical porting target. */
4415 # error "MSB type bits straddle pointer-word boundaries"
4417 /* Marking via C pointers does not suffice, because Lisp_Objects contain
4418 pointer words that hold pointers ORed with type bits. */
4419 # define POINTERS_MIGHT_HIDE_IN_OBJECTS 1
4421 /* Marking via C pointers suffices, because Lisp_Objects contain pointer
4422 words that hold unmodified pointers. */
4423 # define POINTERS_MIGHT_HIDE_IN_OBJECTS 0
4426 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4427 or END+OFFSET..START. */
4430 mark_memory (void *start
, void *end
)
4431 #if defined (__clang__) && defined (__has_feature)
4432 #if __has_feature(address_sanitizer)
4433 /* Do not allow -faddress-sanitizer to check this function, since it
4434 crosses the function stack boundary, and thus would yield many
4436 __attribute__((no_address_safety_analysis
))
4443 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4447 /* Make START the pointer to the start of the memory region,
4448 if it isn't already. */
4456 /* Mark Lisp data pointed to. This is necessary because, in some
4457 situations, the C compiler optimizes Lisp objects away, so that
4458 only a pointer to them remains. Example:
4460 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4463 Lisp_Object obj = build_string ("test");
4464 struct Lisp_String *s = XSTRING (obj);
4465 Fgarbage_collect ();
4466 fprintf (stderr, "test `%s'\n", s->data);
4470 Here, `obj' isn't really used, and the compiler optimizes it
4471 away. The only reference to the life string is through the
4474 for (pp
= start
; (void *) pp
< end
; pp
++)
4475 for (i
= 0; i
< sizeof *pp
; i
+= GC_POINTER_ALIGNMENT
)
4477 void *p
= *(void **) ((char *) pp
+ i
);
4478 mark_maybe_pointer (p
);
4479 if (POINTERS_MIGHT_HIDE_IN_OBJECTS
)
4480 mark_maybe_object (XIL ((intptr_t) p
));
4484 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4486 static bool setjmp_tested_p
;
4487 static int longjmps_done
;
4489 #define SETJMP_WILL_LIKELY_WORK "\
4491 Emacs garbage collector has been changed to use conservative stack\n\
4492 marking. Emacs has determined that the method it uses to do the\n\
4493 marking will likely work on your system, but this isn't sure.\n\
4495 If you are a system-programmer, or can get the help of a local wizard\n\
4496 who is, please take a look at the function mark_stack in alloc.c, and\n\
4497 verify that the methods used are appropriate for your system.\n\
4499 Please mail the result to <emacs-devel@gnu.org>.\n\
4502 #define SETJMP_WILL_NOT_WORK "\
4504 Emacs garbage collector has been changed to use conservative stack\n\
4505 marking. Emacs has determined that the default method it uses to do the\n\
4506 marking will not work on your system. We will need a system-dependent\n\
4507 solution for your system.\n\
4509 Please take a look at the function mark_stack in alloc.c, and\n\
4510 try to find a way to make it work on your system.\n\
4512 Note that you may get false negatives, depending on the compiler.\n\
4513 In particular, you need to use -O with GCC for this test.\n\
4515 Please mail the result to <emacs-devel@gnu.org>.\n\
4519 /* Perform a quick check if it looks like setjmp saves registers in a
4520 jmp_buf. Print a message to stderr saying so. When this test
4521 succeeds, this is _not_ a proof that setjmp is sufficient for
4522 conservative stack marking. Only the sources or a disassembly
4532 /* Arrange for X to be put in a register. */
4538 if (longjmps_done
== 1)
4540 /* Came here after the longjmp at the end of the function.
4542 If x == 1, the longjmp has restored the register to its
4543 value before the setjmp, and we can hope that setjmp
4544 saves all such registers in the jmp_buf, although that
4547 For other values of X, either something really strange is
4548 taking place, or the setjmp just didn't save the register. */
4551 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4554 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4561 if (longjmps_done
== 1)
4562 sys_longjmp (jbuf
, 1);
4565 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4568 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4570 /* Abort if anything GCPRO'd doesn't survive the GC. */
4578 for (p
= gcprolist
; p
; p
= p
->next
)
4579 for (i
= 0; i
< p
->nvars
; ++i
)
4580 if (!survives_gc_p (p
->var
[i
]))
4581 /* FIXME: It's not necessarily a bug. It might just be that the
4582 GCPRO is unnecessary or should release the object sooner. */
4586 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4593 fprintf (stderr
, "\nZombies kept alive = %"pI
"d:\n", nzombies
);
4594 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4596 fprintf (stderr
, " %d = ", i
);
4597 debug_print (zombies
[i
]);
4601 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4604 /* Mark live Lisp objects on the C stack.
4606 There are several system-dependent problems to consider when
4607 porting this to new architectures:
4611 We have to mark Lisp objects in CPU registers that can hold local
4612 variables or are used to pass parameters.
4614 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4615 something that either saves relevant registers on the stack, or
4616 calls mark_maybe_object passing it each register's contents.
4618 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4619 implementation assumes that calling setjmp saves registers we need
4620 to see in a jmp_buf which itself lies on the stack. This doesn't
4621 have to be true! It must be verified for each system, possibly
4622 by taking a look at the source code of setjmp.
4624 If __builtin_unwind_init is available (defined by GCC >= 2.8) we
4625 can use it as a machine independent method to store all registers
4626 to the stack. In this case the macros described in the previous
4627 two paragraphs are not used.
4631 Architectures differ in the way their processor stack is organized.
4632 For example, the stack might look like this
4635 | Lisp_Object | size = 4
4637 | something else | size = 2
4639 | Lisp_Object | size = 4
4643 In such a case, not every Lisp_Object will be aligned equally. To
4644 find all Lisp_Object on the stack it won't be sufficient to walk
4645 the stack in steps of 4 bytes. Instead, two passes will be
4646 necessary, one starting at the start of the stack, and a second
4647 pass starting at the start of the stack + 2. Likewise, if the
4648 minimal alignment of Lisp_Objects on the stack is 1, four passes
4649 would be necessary, each one starting with one byte more offset
4650 from the stack start. */
4657 #ifdef HAVE___BUILTIN_UNWIND_INIT
4658 /* Force callee-saved registers and register windows onto the stack.
4659 This is the preferred method if available, obviating the need for
4660 machine dependent methods. */
4661 __builtin_unwind_init ();
4663 #else /* not HAVE___BUILTIN_UNWIND_INIT */
4664 #ifndef GC_SAVE_REGISTERS_ON_STACK
4665 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4666 union aligned_jmpbuf
{
4670 volatile bool stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4672 /* This trick flushes the register windows so that all the state of
4673 the process is contained in the stack. */
4674 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4675 needed on ia64 too. See mach_dep.c, where it also says inline
4676 assembler doesn't work with relevant proprietary compilers. */
4678 #if defined (__sparc64__) && defined (__FreeBSD__)
4679 /* FreeBSD does not have a ta 3 handler. */
4686 /* Save registers that we need to see on the stack. We need to see
4687 registers used to hold register variables and registers used to
4689 #ifdef GC_SAVE_REGISTERS_ON_STACK
4690 GC_SAVE_REGISTERS_ON_STACK (end
);
4691 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4693 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4694 setjmp will definitely work, test it
4695 and print a message with the result
4697 if (!setjmp_tested_p
)
4699 setjmp_tested_p
= 1;
4702 #endif /* GC_SETJMP_WORKS */
4705 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4706 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4707 #endif /* not HAVE___BUILTIN_UNWIND_INIT */
4709 /* This assumes that the stack is a contiguous region in memory. If
4710 that's not the case, something has to be done here to iterate
4711 over the stack segments. */
4712 mark_memory (stack_base
, end
);
4714 /* Allow for marking a secondary stack, like the register stack on the
4716 #ifdef GC_MARK_SECONDARY_STACK
4717 GC_MARK_SECONDARY_STACK ();
4720 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4725 #endif /* GC_MARK_STACK != 0 */
4728 /* Determine whether it is safe to access memory at address P. */
4730 valid_pointer_p (void *p
)
4733 return w32_valid_pointer_p (p
, 16);
4737 /* Obviously, we cannot just access it (we would SEGV trying), so we
4738 trick the o/s to tell us whether p is a valid pointer.
4739 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4740 not validate p in that case. */
4744 bool valid
= emacs_write (fd
[1], (char *) p
, 16) == 16;
4745 emacs_close (fd
[1]);
4746 emacs_close (fd
[0]);
4754 /* Return 2 if OBJ is a killed or special buffer object, 1 if OBJ is a
4755 valid lisp object, 0 if OBJ is NOT a valid lisp object, or -1 if we
4756 cannot validate OBJ. This function can be quite slow, so its primary
4757 use is the manual debugging. The only exception is print_object, where
4758 we use it to check whether the memory referenced by the pointer of
4759 Lisp_Save_Value object contains valid objects. */
4762 valid_lisp_object_p (Lisp_Object obj
)
4772 p
= (void *) XPNTR (obj
);
4773 if (PURE_POINTER_P (p
))
4776 if (p
== &buffer_defaults
|| p
== &buffer_local_symbols
)
4780 return valid_pointer_p (p
);
4787 int valid
= valid_pointer_p (p
);
4799 case MEM_TYPE_NON_LISP
:
4800 case MEM_TYPE_SPARE
:
4803 case MEM_TYPE_BUFFER
:
4804 return live_buffer_p (m
, p
) ? 1 : 2;
4807 return live_cons_p (m
, p
);
4809 case MEM_TYPE_STRING
:
4810 return live_string_p (m
, p
);
4813 return live_misc_p (m
, p
);
4815 case MEM_TYPE_SYMBOL
:
4816 return live_symbol_p (m
, p
);
4818 case MEM_TYPE_FLOAT
:
4819 return live_float_p (m
, p
);
4821 case MEM_TYPE_VECTORLIKE
:
4822 case MEM_TYPE_VECTOR_BLOCK
:
4823 return live_vector_p (m
, p
);
4836 /***********************************************************************
4837 Pure Storage Management
4838 ***********************************************************************/
4840 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4841 pointer to it. TYPE is the Lisp type for which the memory is
4842 allocated. TYPE < 0 means it's not used for a Lisp object. */
4845 pure_alloc (size_t size
, int type
)
4849 size_t alignment
= GCALIGNMENT
;
4851 size_t alignment
= alignof (EMACS_INT
);
4853 /* Give Lisp_Floats an extra alignment. */
4854 if (type
== Lisp_Float
)
4855 alignment
= alignof (struct Lisp_Float
);
4861 /* Allocate space for a Lisp object from the beginning of the free
4862 space with taking account of alignment. */
4863 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4864 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4868 /* Allocate space for a non-Lisp object from the end of the free
4870 pure_bytes_used_non_lisp
+= size
;
4871 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4873 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4875 if (pure_bytes_used
<= pure_size
)
4878 /* Don't allocate a large amount here,
4879 because it might get mmap'd and then its address
4880 might not be usable. */
4881 purebeg
= xmalloc (10000);
4883 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4884 pure_bytes_used
= 0;
4885 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4890 /* Print a warning if PURESIZE is too small. */
4893 check_pure_size (void)
4895 if (pure_bytes_used_before_overflow
)
4896 message (("emacs:0:Pure Lisp storage overflow (approx. %"pI
"d"
4898 pure_bytes_used
+ pure_bytes_used_before_overflow
);
4902 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4903 the non-Lisp data pool of the pure storage, and return its start
4904 address. Return NULL if not found. */
4907 find_string_data_in_pure (const char *data
, ptrdiff_t nbytes
)
4910 ptrdiff_t skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4911 const unsigned char *p
;
4914 if (pure_bytes_used_non_lisp
<= nbytes
)
4917 /* Set up the Boyer-Moore table. */
4919 for (i
= 0; i
< 256; i
++)
4922 p
= (const unsigned char *) data
;
4924 bm_skip
[*p
++] = skip
;
4926 last_char_skip
= bm_skip
['\0'];
4928 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4929 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4931 /* See the comments in the function `boyer_moore' (search.c) for the
4932 use of `infinity'. */
4933 infinity
= pure_bytes_used_non_lisp
+ 1;
4934 bm_skip
['\0'] = infinity
;
4936 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
4940 /* Check the last character (== '\0'). */
4943 start
+= bm_skip
[*(p
+ start
)];
4945 while (start
<= start_max
);
4947 if (start
< infinity
)
4948 /* Couldn't find the last character. */
4951 /* No less than `infinity' means we could find the last
4952 character at `p[start - infinity]'. */
4955 /* Check the remaining characters. */
4956 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4958 return non_lisp_beg
+ start
;
4960 start
+= last_char_skip
;
4962 while (start
<= start_max
);
4968 /* Return a string allocated in pure space. DATA is a buffer holding
4969 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4970 means make the result string multibyte.
4972 Must get an error if pure storage is full, since if it cannot hold
4973 a large string it may be able to hold conses that point to that
4974 string; then the string is not protected from gc. */
4977 make_pure_string (const char *data
,
4978 ptrdiff_t nchars
, ptrdiff_t nbytes
, bool multibyte
)
4981 struct Lisp_String
*s
= pure_alloc (sizeof *s
, Lisp_String
);
4982 s
->data
= (unsigned char *) find_string_data_in_pure (data
, nbytes
);
4983 if (s
->data
== NULL
)
4985 s
->data
= pure_alloc (nbytes
+ 1, -1);
4986 memcpy (s
->data
, data
, nbytes
);
4987 s
->data
[nbytes
] = '\0';
4990 s
->size_byte
= multibyte
? nbytes
: -1;
4991 s
->intervals
= NULL
;
4992 XSETSTRING (string
, s
);
4996 /* Return a string allocated in pure space. Do not
4997 allocate the string data, just point to DATA. */
5000 make_pure_c_string (const char *data
, ptrdiff_t nchars
)
5003 struct Lisp_String
*s
= pure_alloc (sizeof *s
, Lisp_String
);
5006 s
->data
= (unsigned char *) data
;
5007 s
->intervals
= NULL
;
5008 XSETSTRING (string
, s
);
5012 /* Return a cons allocated from pure space. Give it pure copies
5013 of CAR as car and CDR as cdr. */
5016 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
5019 struct Lisp_Cons
*p
= pure_alloc (sizeof *p
, Lisp_Cons
);
5021 XSETCAR (new, Fpurecopy (car
));
5022 XSETCDR (new, Fpurecopy (cdr
));
5027 /* Value is a float object with value NUM allocated from pure space. */
5030 make_pure_float (double num
)
5033 struct Lisp_Float
*p
= pure_alloc (sizeof *p
, Lisp_Float
);
5035 XFLOAT_INIT (new, num
);
5040 /* Return a vector with room for LEN Lisp_Objects allocated from
5044 make_pure_vector (ptrdiff_t len
)
5047 size_t size
= header_size
+ len
* word_size
;
5048 struct Lisp_Vector
*p
= pure_alloc (size
, Lisp_Vectorlike
);
5049 XSETVECTOR (new, p
);
5050 XVECTOR (new)->header
.size
= len
;
5055 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
5056 doc
: /* Make a copy of object OBJ in pure storage.
5057 Recursively copies contents of vectors and cons cells.
5058 Does not copy symbols. Copies strings without text properties. */)
5059 (register Lisp_Object obj
)
5061 if (NILP (Vpurify_flag
))
5064 if (PURE_POINTER_P (XPNTR (obj
)))
5067 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
5069 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
5075 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
5076 else if (FLOATP (obj
))
5077 obj
= make_pure_float (XFLOAT_DATA (obj
));
5078 else if (STRINGP (obj
))
5079 obj
= make_pure_string (SSDATA (obj
), SCHARS (obj
),
5081 STRING_MULTIBYTE (obj
));
5082 else if (COMPILEDP (obj
) || VECTORP (obj
))
5084 register struct Lisp_Vector
*vec
;
5085 register ptrdiff_t i
;
5089 if (size
& PSEUDOVECTOR_FLAG
)
5090 size
&= PSEUDOVECTOR_SIZE_MASK
;
5091 vec
= XVECTOR (make_pure_vector (size
));
5092 for (i
= 0; i
< size
; i
++)
5093 vec
->contents
[i
] = Fpurecopy (AREF (obj
, i
));
5094 if (COMPILEDP (obj
))
5096 XSETPVECTYPE (vec
, PVEC_COMPILED
);
5097 XSETCOMPILED (obj
, vec
);
5100 XSETVECTOR (obj
, vec
);
5102 else if (MARKERP (obj
))
5103 error ("Attempt to copy a marker to pure storage");
5105 /* Not purified, don't hash-cons. */
5108 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
5109 Fputhash (obj
, obj
, Vpurify_flag
);
5116 /***********************************************************************
5118 ***********************************************************************/
5120 /* Put an entry in staticvec, pointing at the variable with address
5124 staticpro (Lisp_Object
*varaddress
)
5126 staticvec
[staticidx
++] = varaddress
;
5127 if (staticidx
>= NSTATICS
)
5128 fatal ("NSTATICS too small; try increasing and recompiling Emacs.");
5132 /***********************************************************************
5134 ***********************************************************************/
5136 /* Temporarily prevent garbage collection. */
5139 inhibit_garbage_collection (void)
5141 ptrdiff_t count
= SPECPDL_INDEX ();
5143 specbind (Qgc_cons_threshold
, make_number (MOST_POSITIVE_FIXNUM
));
5147 /* Used to avoid possible overflows when
5148 converting from C to Lisp integers. */
5151 bounded_number (EMACS_INT number
)
5153 return make_number (min (MOST_POSITIVE_FIXNUM
, number
));
5156 /* Calculate total bytes of live objects. */
5159 total_bytes_of_live_objects (void)
5162 tot
+= total_conses
* sizeof (struct Lisp_Cons
);
5163 tot
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5164 tot
+= total_markers
* sizeof (union Lisp_Misc
);
5165 tot
+= total_string_bytes
;
5166 tot
+= total_vector_slots
* word_size
;
5167 tot
+= total_floats
* sizeof (struct Lisp_Float
);
5168 tot
+= total_intervals
* sizeof (struct interval
);
5169 tot
+= total_strings
* sizeof (struct Lisp_String
);
5173 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
5174 doc
: /* Reclaim storage for Lisp objects no longer needed.
5175 Garbage collection happens automatically if you cons more than
5176 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
5177 `garbage-collect' normally returns a list with info on amount of space in use,
5178 where each entry has the form (NAME SIZE USED FREE), where:
5179 - NAME is a symbol describing the kind of objects this entry represents,
5180 - SIZE is the number of bytes used by each one,
5181 - USED is the number of those objects that were found live in the heap,
5182 - FREE is the number of those objects that are not live but that Emacs
5183 keeps around for future allocations (maybe because it does not know how
5184 to return them to the OS).
5185 However, if there was overflow in pure space, `garbage-collect'
5186 returns nil, because real GC can't be done.
5187 See Info node `(elisp)Garbage Collection'. */)
5190 struct buffer
*nextb
;
5191 char stack_top_variable
;
5194 ptrdiff_t count
= SPECPDL_INDEX ();
5196 Lisp_Object retval
= Qnil
;
5197 size_t tot_before
= 0;
5202 /* Can't GC if pure storage overflowed because we can't determine
5203 if something is a pure object or not. */
5204 if (pure_bytes_used_before_overflow
)
5207 /* Record this function, so it appears on the profiler's backtraces. */
5208 record_in_backtrace (Qautomatic_gc
, &Qnil
, 0);
5212 /* Don't keep undo information around forever.
5213 Do this early on, so it is no problem if the user quits. */
5214 FOR_EACH_BUFFER (nextb
)
5215 compact_buffer (nextb
);
5217 if (profiler_memory_running
)
5218 tot_before
= total_bytes_of_live_objects ();
5220 start
= current_emacs_time ();
5222 /* In case user calls debug_print during GC,
5223 don't let that cause a recursive GC. */
5224 consing_since_gc
= 0;
5226 /* Save what's currently displayed in the echo area. */
5227 message_p
= push_message ();
5228 record_unwind_protect (pop_message_unwind
, Qnil
);
5230 /* Save a copy of the contents of the stack, for debugging. */
5231 #if MAX_SAVE_STACK > 0
5232 if (NILP (Vpurify_flag
))
5235 ptrdiff_t stack_size
;
5236 if (&stack_top_variable
< stack_bottom
)
5238 stack
= &stack_top_variable
;
5239 stack_size
= stack_bottom
- &stack_top_variable
;
5243 stack
= stack_bottom
;
5244 stack_size
= &stack_top_variable
- stack_bottom
;
5246 if (stack_size
<= MAX_SAVE_STACK
)
5248 if (stack_copy_size
< stack_size
)
5250 stack_copy
= xrealloc (stack_copy
, stack_size
);
5251 stack_copy_size
= stack_size
;
5253 memcpy (stack_copy
, stack
, stack_size
);
5256 #endif /* MAX_SAVE_STACK > 0 */
5258 if (garbage_collection_messages
)
5259 message1_nolog ("Garbage collecting...");
5263 shrink_regexp_cache ();
5267 /* Mark all the special slots that serve as the roots of accessibility. */
5269 mark_buffer (&buffer_defaults
);
5270 mark_buffer (&buffer_local_symbols
);
5272 for (i
= 0; i
< staticidx
; i
++)
5273 mark_object (*staticvec
[i
]);
5283 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5284 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5288 register struct gcpro
*tail
;
5289 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5290 for (i
= 0; i
< tail
->nvars
; i
++)
5291 mark_object (tail
->var
[i
]);
5295 struct catchtag
*catch;
5296 struct handler
*handler
;
5298 for (catch = catchlist
; catch; catch = catch->next
)
5300 mark_object (catch->tag
);
5301 mark_object (catch->val
);
5303 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5305 mark_object (handler
->handler
);
5306 mark_object (handler
->var
);
5311 #ifdef HAVE_WINDOW_SYSTEM
5312 mark_fringe_data ();
5315 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5319 /* Everything is now marked, except for the things that require special
5320 finalization, i.e. the undo_list.
5321 Look thru every buffer's undo list
5322 for elements that update markers that were not marked,
5324 FOR_EACH_BUFFER (nextb
)
5326 /* If a buffer's undo list is Qt, that means that undo is
5327 turned off in that buffer. Calling truncate_undo_list on
5328 Qt tends to return NULL, which effectively turns undo back on.
5329 So don't call truncate_undo_list if undo_list is Qt. */
5330 if (! EQ (nextb
->INTERNAL_FIELD (undo_list
), Qt
))
5332 Lisp_Object tail
, prev
;
5333 tail
= nextb
->INTERNAL_FIELD (undo_list
);
5335 while (CONSP (tail
))
5337 if (CONSP (XCAR (tail
))
5338 && MARKERP (XCAR (XCAR (tail
)))
5339 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5342 nextb
->INTERNAL_FIELD (undo_list
) = tail
= XCDR (tail
);
5346 XSETCDR (prev
, tail
);
5356 /* Now that we have stripped the elements that need not be in the
5357 undo_list any more, we can finally mark the list. */
5358 mark_object (nextb
->INTERNAL_FIELD (undo_list
));
5363 /* Clear the mark bits that we set in certain root slots. */
5365 unmark_byte_stack ();
5366 VECTOR_UNMARK (&buffer_defaults
);
5367 VECTOR_UNMARK (&buffer_local_symbols
);
5369 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5379 consing_since_gc
= 0;
5380 if (gc_cons_threshold
< GC_DEFAULT_THRESHOLD
/ 10)
5381 gc_cons_threshold
= GC_DEFAULT_THRESHOLD
/ 10;
5383 gc_relative_threshold
= 0;
5384 if (FLOATP (Vgc_cons_percentage
))
5385 { /* Set gc_cons_combined_threshold. */
5386 double tot
= total_bytes_of_live_objects ();
5388 tot
*= XFLOAT_DATA (Vgc_cons_percentage
);
5391 if (tot
< TYPE_MAXIMUM (EMACS_INT
))
5392 gc_relative_threshold
= tot
;
5394 gc_relative_threshold
= TYPE_MAXIMUM (EMACS_INT
);
5398 if (garbage_collection_messages
)
5400 if (message_p
|| minibuf_level
> 0)
5403 message1_nolog ("Garbage collecting...done");
5406 unbind_to (count
, Qnil
);
5408 Lisp_Object total
[11];
5409 int total_size
= 10;
5411 total
[0] = list4 (Qconses
, make_number (sizeof (struct Lisp_Cons
)),
5412 bounded_number (total_conses
),
5413 bounded_number (total_free_conses
));
5415 total
[1] = list4 (Qsymbols
, make_number (sizeof (struct Lisp_Symbol
)),
5416 bounded_number (total_symbols
),
5417 bounded_number (total_free_symbols
));
5419 total
[2] = list4 (Qmiscs
, make_number (sizeof (union Lisp_Misc
)),
5420 bounded_number (total_markers
),
5421 bounded_number (total_free_markers
));
5423 total
[3] = list4 (Qstrings
, make_number (sizeof (struct Lisp_String
)),
5424 bounded_number (total_strings
),
5425 bounded_number (total_free_strings
));
5427 total
[4] = list3 (Qstring_bytes
, make_number (1),
5428 bounded_number (total_string_bytes
));
5430 total
[5] = list3 (Qvectors
,
5431 make_number (header_size
+ sizeof (Lisp_Object
)),
5432 bounded_number (total_vectors
));
5434 total
[6] = list4 (Qvector_slots
, make_number (word_size
),
5435 bounded_number (total_vector_slots
),
5436 bounded_number (total_free_vector_slots
));
5438 total
[7] = list4 (Qfloats
, make_number (sizeof (struct Lisp_Float
)),
5439 bounded_number (total_floats
),
5440 bounded_number (total_free_floats
));
5442 total
[8] = list4 (Qintervals
, make_number (sizeof (struct interval
)),
5443 bounded_number (total_intervals
),
5444 bounded_number (total_free_intervals
));
5446 total
[9] = list3 (Qbuffers
, make_number (sizeof (struct buffer
)),
5447 bounded_number (total_buffers
));
5449 #ifdef DOUG_LEA_MALLOC
5451 total
[10] = list4 (Qheap
, make_number (1024),
5452 bounded_number ((mallinfo ().uordblks
+ 1023) >> 10),
5453 bounded_number ((mallinfo ().fordblks
+ 1023) >> 10));
5455 retval
= Flist (total_size
, total
);
5458 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5460 /* Compute average percentage of zombies. */
5462 = (total_conses
+ total_symbols
+ total_markers
+ total_strings
5463 + total_vectors
+ total_floats
+ total_intervals
+ total_buffers
);
5465 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5466 max_live
= max (nlive
, max_live
);
5467 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5468 max_zombies
= max (nzombies
, max_zombies
);
5473 if (!NILP (Vpost_gc_hook
))
5475 ptrdiff_t gc_count
= inhibit_garbage_collection ();
5476 safe_run_hooks (Qpost_gc_hook
);
5477 unbind_to (gc_count
, Qnil
);
5480 /* Accumulate statistics. */
5481 if (FLOATP (Vgc_elapsed
))
5483 EMACS_TIME since_start
= sub_emacs_time (current_emacs_time (), start
);
5484 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
)
5485 + EMACS_TIME_TO_DOUBLE (since_start
));
5490 /* Collect profiling data. */
5491 if (profiler_memory_running
)
5494 size_t tot_after
= total_bytes_of_live_objects ();
5495 if (tot_before
> tot_after
)
5496 swept
= tot_before
- tot_after
;
5497 malloc_probe (swept
);
5504 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5505 only interesting objects referenced from glyphs are strings. */
5508 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5510 struct glyph_row
*row
= matrix
->rows
;
5511 struct glyph_row
*end
= row
+ matrix
->nrows
;
5513 for (; row
< end
; ++row
)
5517 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5519 struct glyph
*glyph
= row
->glyphs
[area
];
5520 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5522 for (; glyph
< end_glyph
; ++glyph
)
5523 if (STRINGP (glyph
->object
)
5524 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5525 mark_object (glyph
->object
);
5531 /* Mark Lisp faces in the face cache C. */
5534 mark_face_cache (struct face_cache
*c
)
5539 for (i
= 0; i
< c
->used
; ++i
)
5541 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5545 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5546 mark_object (face
->lface
[j
]);
5554 /* Mark reference to a Lisp_Object.
5555 If the object referred to has not been seen yet, recursively mark
5556 all the references contained in it. */
5558 #define LAST_MARKED_SIZE 500
5559 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5560 static int last_marked_index
;
5562 /* For debugging--call abort when we cdr down this many
5563 links of a list, in mark_object. In debugging,
5564 the call to abort will hit a breakpoint.
5565 Normally this is zero and the check never goes off. */
5566 ptrdiff_t mark_object_loop_halt EXTERNALLY_VISIBLE
;
5569 mark_vectorlike (struct Lisp_Vector
*ptr
)
5571 ptrdiff_t size
= ptr
->header
.size
;
5574 eassert (!VECTOR_MARKED_P (ptr
));
5575 VECTOR_MARK (ptr
); /* Else mark it. */
5576 if (size
& PSEUDOVECTOR_FLAG
)
5577 size
&= PSEUDOVECTOR_SIZE_MASK
;
5579 /* Note that this size is not the memory-footprint size, but only
5580 the number of Lisp_Object fields that we should trace.
5581 The distinction is used e.g. by Lisp_Process which places extra
5582 non-Lisp_Object fields at the end of the structure... */
5583 for (i
= 0; i
< size
; i
++) /* ...and then mark its elements. */
5584 mark_object (ptr
->contents
[i
]);
5587 /* Like mark_vectorlike but optimized for char-tables (and
5588 sub-char-tables) assuming that the contents are mostly integers or
5592 mark_char_table (struct Lisp_Vector
*ptr
)
5594 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5597 eassert (!VECTOR_MARKED_P (ptr
));
5599 for (i
= 0; i
< size
; i
++)
5601 Lisp_Object val
= ptr
->contents
[i
];
5603 if (INTEGERP (val
) || (SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
))
5605 if (SUB_CHAR_TABLE_P (val
))
5607 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5608 mark_char_table (XVECTOR (val
));
5615 /* Mark the chain of overlays starting at PTR. */
5618 mark_overlay (struct Lisp_Overlay
*ptr
)
5620 for (; ptr
&& !ptr
->gcmarkbit
; ptr
= ptr
->next
)
5623 mark_object (ptr
->start
);
5624 mark_object (ptr
->end
);
5625 mark_object (ptr
->plist
);
5629 /* Mark Lisp_Objects and special pointers in BUFFER. */
5632 mark_buffer (struct buffer
*buffer
)
5634 /* This is handled much like other pseudovectors... */
5635 mark_vectorlike ((struct Lisp_Vector
*) buffer
);
5637 /* ...but there are some buffer-specific things. */
5639 MARK_INTERVAL_TREE (buffer_intervals (buffer
));
5641 /* For now, we just don't mark the undo_list. It's done later in
5642 a special way just before the sweep phase, and after stripping
5643 some of its elements that are not needed any more. */
5645 mark_overlay (buffer
->overlays_before
);
5646 mark_overlay (buffer
->overlays_after
);
5648 /* If this is an indirect buffer, mark its base buffer. */
5649 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5650 mark_buffer (buffer
->base_buffer
);
5653 /* Remove killed buffers or items whose car is a killed buffer from
5654 LIST, and mark other items. Return changed LIST, which is marked. */
5657 mark_discard_killed_buffers (Lisp_Object list
)
5659 Lisp_Object tail
, *prev
= &list
;
5661 for (tail
= list
; CONSP (tail
) && !CONS_MARKED_P (XCONS (tail
));
5664 Lisp_Object tem
= XCAR (tail
);
5667 if (BUFFERP (tem
) && !BUFFER_LIVE_P (XBUFFER (tem
)))
5668 *prev
= XCDR (tail
);
5671 CONS_MARK (XCONS (tail
));
5672 mark_object (XCAR (tail
));
5673 prev
= xcdr_addr (tail
);
5680 /* Determine type of generic Lisp_Object and mark it accordingly. */
5683 mark_object (Lisp_Object arg
)
5685 register Lisp_Object obj
= arg
;
5686 #ifdef GC_CHECK_MARKED_OBJECTS
5690 ptrdiff_t cdr_count
= 0;
5694 if (PURE_POINTER_P (XPNTR (obj
)))
5697 last_marked
[last_marked_index
++] = obj
;
5698 if (last_marked_index
== LAST_MARKED_SIZE
)
5699 last_marked_index
= 0;
5701 /* Perform some sanity checks on the objects marked here. Abort if
5702 we encounter an object we know is bogus. This increases GC time
5703 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5704 #ifdef GC_CHECK_MARKED_OBJECTS
5706 po
= (void *) XPNTR (obj
);
5708 /* Check that the object pointed to by PO is known to be a Lisp
5709 structure allocated from the heap. */
5710 #define CHECK_ALLOCATED() \
5712 m = mem_find (po); \
5717 /* Check that the object pointed to by PO is live, using predicate
5719 #define CHECK_LIVE(LIVEP) \
5721 if (!LIVEP (m, po)) \
5725 /* Check both of the above conditions. */
5726 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5728 CHECK_ALLOCATED (); \
5729 CHECK_LIVE (LIVEP); \
5732 #else /* not GC_CHECK_MARKED_OBJECTS */
5734 #define CHECK_LIVE(LIVEP) (void) 0
5735 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5737 #endif /* not GC_CHECK_MARKED_OBJECTS */
5739 switch (XTYPE (obj
))
5743 register struct Lisp_String
*ptr
= XSTRING (obj
);
5744 if (STRING_MARKED_P (ptr
))
5746 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5748 MARK_INTERVAL_TREE (ptr
->intervals
);
5749 #ifdef GC_CHECK_STRING_BYTES
5750 /* Check that the string size recorded in the string is the
5751 same as the one recorded in the sdata structure. */
5753 #endif /* GC_CHECK_STRING_BYTES */
5757 case Lisp_Vectorlike
:
5759 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5760 register ptrdiff_t pvectype
;
5762 if (VECTOR_MARKED_P (ptr
))
5765 #ifdef GC_CHECK_MARKED_OBJECTS
5767 if (m
== MEM_NIL
&& !SUBRP (obj
))
5769 #endif /* GC_CHECK_MARKED_OBJECTS */
5771 if (ptr
->header
.size
& PSEUDOVECTOR_FLAG
)
5772 pvectype
= ((ptr
->header
.size
& PVEC_TYPE_MASK
)
5773 >> PSEUDOVECTOR_AREA_BITS
);
5775 pvectype
= PVEC_NORMAL_VECTOR
;
5777 if (pvectype
!= PVEC_SUBR
&& pvectype
!= PVEC_BUFFER
)
5778 CHECK_LIVE (live_vector_p
);
5783 #ifdef GC_CHECK_MARKED_OBJECTS
5792 #endif /* GC_CHECK_MARKED_OBJECTS */
5793 mark_buffer ((struct buffer
*) ptr
);
5797 { /* We could treat this just like a vector, but it is better
5798 to save the COMPILED_CONSTANTS element for last and avoid
5800 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5804 for (i
= 0; i
< size
; i
++)
5805 if (i
!= COMPILED_CONSTANTS
)
5806 mark_object (ptr
->contents
[i
]);
5807 if (size
> COMPILED_CONSTANTS
)
5809 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5816 mark_vectorlike (ptr
);
5817 mark_face_cache (((struct frame
*) ptr
)->face_cache
);
5822 struct window
*w
= (struct window
*) ptr
;
5824 mark_vectorlike (ptr
);
5826 /* Mark glyph matrices, if any. Marking window
5827 matrices is sufficient because frame matrices
5828 use the same glyph memory. */
5829 if (w
->current_matrix
)
5831 mark_glyph_matrix (w
->current_matrix
);
5832 mark_glyph_matrix (w
->desired_matrix
);
5835 /* Filter out killed buffers from both buffer lists
5836 in attempt to help GC to reclaim killed buffers faster.
5837 We can do it elsewhere for live windows, but this is the
5838 best place to do it for dead windows. */
5840 (w
, mark_discard_killed_buffers (w
->prev_buffers
));
5842 (w
, mark_discard_killed_buffers (w
->next_buffers
));
5846 case PVEC_HASH_TABLE
:
5848 struct Lisp_Hash_Table
*h
= (struct Lisp_Hash_Table
*) ptr
;
5850 mark_vectorlike (ptr
);
5851 mark_object (h
->test
.name
);
5852 mark_object (h
->test
.user_hash_function
);
5853 mark_object (h
->test
.user_cmp_function
);
5854 /* If hash table is not weak, mark all keys and values.
5855 For weak tables, mark only the vector. */
5857 mark_object (h
->key_and_value
);
5859 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5863 case PVEC_CHAR_TABLE
:
5864 mark_char_table (ptr
);
5867 case PVEC_BOOL_VECTOR
:
5868 /* No Lisp_Objects to mark in a bool vector. */
5879 mark_vectorlike (ptr
);
5886 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5887 struct Lisp_Symbol
*ptrx
;
5891 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5893 mark_object (ptr
->function
);
5894 mark_object (ptr
->plist
);
5895 switch (ptr
->redirect
)
5897 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
5898 case SYMBOL_VARALIAS
:
5901 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
5905 case SYMBOL_LOCALIZED
:
5907 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
5908 Lisp_Object where
= blv
->where
;
5909 /* If the value is set up for a killed buffer or deleted
5910 frame, restore it's global binding. If the value is
5911 forwarded to a C variable, either it's not a Lisp_Object
5912 var, or it's staticpro'd already. */
5913 if ((BUFFERP (where
) && !BUFFER_LIVE_P (XBUFFER (where
)))
5914 || (FRAMEP (where
) && !FRAME_LIVE_P (XFRAME (where
))))
5915 swap_in_global_binding (ptr
);
5916 mark_object (blv
->where
);
5917 mark_object (blv
->valcell
);
5918 mark_object (blv
->defcell
);
5921 case SYMBOL_FORWARDED
:
5922 /* If the value is forwarded to a buffer or keyboard field,
5923 these are marked when we see the corresponding object.
5924 And if it's forwarded to a C variable, either it's not
5925 a Lisp_Object var, or it's staticpro'd already. */
5927 default: emacs_abort ();
5929 if (!PURE_POINTER_P (XSTRING (ptr
->name
)))
5930 MARK_STRING (XSTRING (ptr
->name
));
5931 MARK_INTERVAL_TREE (string_intervals (ptr
->name
));
5936 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun. */
5937 XSETSYMBOL (obj
, ptrx
);
5944 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5946 if (XMISCANY (obj
)->gcmarkbit
)
5949 switch (XMISCTYPE (obj
))
5951 case Lisp_Misc_Marker
:
5952 /* DO NOT mark thru the marker's chain.
5953 The buffer's markers chain does not preserve markers from gc;
5954 instead, markers are removed from the chain when freed by gc. */
5955 XMISCANY (obj
)->gcmarkbit
= 1;
5958 case Lisp_Misc_Save_Value
:
5959 XMISCANY (obj
)->gcmarkbit
= 1;
5961 struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5962 /* If `save_type' is zero, `data[0].pointer' is the address
5963 of a memory area containing `data[1].integer' potential
5965 if (GC_MARK_STACK
&& ptr
->save_type
== SAVE_TYPE_MEMORY
)
5967 Lisp_Object
*p
= ptr
->data
[0].pointer
;
5969 for (nelt
= ptr
->data
[1].integer
; nelt
> 0; nelt
--, p
++)
5970 mark_maybe_object (*p
);
5974 /* Find Lisp_Objects in `data[N]' slots and mark them. */
5976 for (i
= 0; i
< SAVE_VALUE_SLOTS
; i
++)
5977 if (save_type (ptr
, i
) == SAVE_OBJECT
)
5978 mark_object (ptr
->data
[i
].object
);
5983 case Lisp_Misc_Overlay
:
5984 mark_overlay (XOVERLAY (obj
));
5994 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5995 if (CONS_MARKED_P (ptr
))
5997 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5999 /* If the cdr is nil, avoid recursion for the car. */
6000 if (EQ (ptr
->u
.cdr
, Qnil
))
6006 mark_object (ptr
->car
);
6009 if (cdr_count
== mark_object_loop_halt
)
6015 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
6016 FLOAT_MARK (XFLOAT (obj
));
6027 #undef CHECK_ALLOCATED
6028 #undef CHECK_ALLOCATED_AND_LIVE
6030 /* Mark the Lisp pointers in the terminal objects.
6031 Called by Fgarbage_collect. */
6034 mark_terminals (void)
6037 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
6039 eassert (t
->name
!= NULL
);
6040 #ifdef HAVE_WINDOW_SYSTEM
6041 /* If a terminal object is reachable from a stacpro'ed object,
6042 it might have been marked already. Make sure the image cache
6044 mark_image_cache (t
->image_cache
);
6045 #endif /* HAVE_WINDOW_SYSTEM */
6046 if (!VECTOR_MARKED_P (t
))
6047 mark_vectorlike ((struct Lisp_Vector
*)t
);
6053 /* Value is non-zero if OBJ will survive the current GC because it's
6054 either marked or does not need to be marked to survive. */
6057 survives_gc_p (Lisp_Object obj
)
6061 switch (XTYPE (obj
))
6068 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
6072 survives_p
= XMISCANY (obj
)->gcmarkbit
;
6076 survives_p
= STRING_MARKED_P (XSTRING (obj
));
6079 case Lisp_Vectorlike
:
6080 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
6084 survives_p
= CONS_MARKED_P (XCONS (obj
));
6088 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
6095 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
6100 /* Sweep: find all structures not marked, and free them. */
6105 /* Remove or mark entries in weak hash tables.
6106 This must be done before any object is unmarked. */
6107 sweep_weak_hash_tables ();
6110 check_string_bytes (!noninteractive
);
6112 /* Put all unmarked conses on free list */
6114 register struct cons_block
*cblk
;
6115 struct cons_block
**cprev
= &cons_block
;
6116 register int lim
= cons_block_index
;
6117 EMACS_INT num_free
= 0, num_used
= 0;
6121 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
6125 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
6127 /* Scan the mark bits an int at a time. */
6128 for (i
= 0; i
< ilim
; i
++)
6130 if (cblk
->gcmarkbits
[i
] == -1)
6132 /* Fast path - all cons cells for this int are marked. */
6133 cblk
->gcmarkbits
[i
] = 0;
6134 num_used
+= BITS_PER_INT
;
6138 /* Some cons cells for this int are not marked.
6139 Find which ones, and free them. */
6140 int start
, pos
, stop
;
6142 start
= i
* BITS_PER_INT
;
6144 if (stop
> BITS_PER_INT
)
6145 stop
= BITS_PER_INT
;
6148 for (pos
= start
; pos
< stop
; pos
++)
6150 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
6153 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
6154 cons_free_list
= &cblk
->conses
[pos
];
6156 cons_free_list
->car
= Vdead
;
6162 CONS_UNMARK (&cblk
->conses
[pos
]);
6168 lim
= CONS_BLOCK_SIZE
;
6169 /* If this block contains only free conses and we have already
6170 seen more than two blocks worth of free conses then deallocate
6172 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
6174 *cprev
= cblk
->next
;
6175 /* Unhook from the free list. */
6176 cons_free_list
= cblk
->conses
[0].u
.chain
;
6177 lisp_align_free (cblk
);
6181 num_free
+= this_free
;
6182 cprev
= &cblk
->next
;
6185 total_conses
= num_used
;
6186 total_free_conses
= num_free
;
6189 /* Put all unmarked floats on free list */
6191 register struct float_block
*fblk
;
6192 struct float_block
**fprev
= &float_block
;
6193 register int lim
= float_block_index
;
6194 EMACS_INT num_free
= 0, num_used
= 0;
6196 float_free_list
= 0;
6198 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
6202 for (i
= 0; i
< lim
; i
++)
6203 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
6206 fblk
->floats
[i
].u
.chain
= float_free_list
;
6207 float_free_list
= &fblk
->floats
[i
];
6212 FLOAT_UNMARK (&fblk
->floats
[i
]);
6214 lim
= FLOAT_BLOCK_SIZE
;
6215 /* If this block contains only free floats and we have already
6216 seen more than two blocks worth of free floats then deallocate
6218 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
6220 *fprev
= fblk
->next
;
6221 /* Unhook from the free list. */
6222 float_free_list
= fblk
->floats
[0].u
.chain
;
6223 lisp_align_free (fblk
);
6227 num_free
+= this_free
;
6228 fprev
= &fblk
->next
;
6231 total_floats
= num_used
;
6232 total_free_floats
= num_free
;
6235 /* Put all unmarked intervals on free list */
6237 register struct interval_block
*iblk
;
6238 struct interval_block
**iprev
= &interval_block
;
6239 register int lim
= interval_block_index
;
6240 EMACS_INT num_free
= 0, num_used
= 0;
6242 interval_free_list
= 0;
6244 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
6249 for (i
= 0; i
< lim
; i
++)
6251 if (!iblk
->intervals
[i
].gcmarkbit
)
6253 set_interval_parent (&iblk
->intervals
[i
], interval_free_list
);
6254 interval_free_list
= &iblk
->intervals
[i
];
6260 iblk
->intervals
[i
].gcmarkbit
= 0;
6263 lim
= INTERVAL_BLOCK_SIZE
;
6264 /* If this block contains only free intervals and we have already
6265 seen more than two blocks worth of free intervals then
6266 deallocate this block. */
6267 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
6269 *iprev
= iblk
->next
;
6270 /* Unhook from the free list. */
6271 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
6276 num_free
+= this_free
;
6277 iprev
= &iblk
->next
;
6280 total_intervals
= num_used
;
6281 total_free_intervals
= num_free
;
6284 /* Put all unmarked symbols on free list */
6286 register struct symbol_block
*sblk
;
6287 struct symbol_block
**sprev
= &symbol_block
;
6288 register int lim
= symbol_block_index
;
6289 EMACS_INT num_free
= 0, num_used
= 0;
6291 symbol_free_list
= NULL
;
6293 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
6296 union aligned_Lisp_Symbol
*sym
= sblk
->symbols
;
6297 union aligned_Lisp_Symbol
*end
= sym
+ lim
;
6299 for (; sym
< end
; ++sym
)
6301 /* Check if the symbol was created during loadup. In such a case
6302 it might be pointed to by pure bytecode which we don't trace,
6303 so we conservatively assume that it is live. */
6304 bool pure_p
= PURE_POINTER_P (XSTRING (sym
->s
.name
));
6306 if (!sym
->s
.gcmarkbit
&& !pure_p
)
6308 if (sym
->s
.redirect
== SYMBOL_LOCALIZED
)
6309 xfree (SYMBOL_BLV (&sym
->s
));
6310 sym
->s
.next
= symbol_free_list
;
6311 symbol_free_list
= &sym
->s
;
6313 symbol_free_list
->function
= Vdead
;
6321 UNMARK_STRING (XSTRING (sym
->s
.name
));
6322 sym
->s
.gcmarkbit
= 0;
6326 lim
= SYMBOL_BLOCK_SIZE
;
6327 /* If this block contains only free symbols and we have already
6328 seen more than two blocks worth of free symbols then deallocate
6330 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6332 *sprev
= sblk
->next
;
6333 /* Unhook from the free list. */
6334 symbol_free_list
= sblk
->symbols
[0].s
.next
;
6339 num_free
+= this_free
;
6340 sprev
= &sblk
->next
;
6343 total_symbols
= num_used
;
6344 total_free_symbols
= num_free
;
6347 /* Put all unmarked misc's on free list.
6348 For a marker, first unchain it from the buffer it points into. */
6350 register struct marker_block
*mblk
;
6351 struct marker_block
**mprev
= &marker_block
;
6352 register int lim
= marker_block_index
;
6353 EMACS_INT num_free
= 0, num_used
= 0;
6355 marker_free_list
= 0;
6357 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6362 for (i
= 0; i
< lim
; i
++)
6364 if (!mblk
->markers
[i
].m
.u_any
.gcmarkbit
)
6366 if (mblk
->markers
[i
].m
.u_any
.type
== Lisp_Misc_Marker
)
6367 unchain_marker (&mblk
->markers
[i
].m
.u_marker
);
6368 /* Set the type of the freed object to Lisp_Misc_Free.
6369 We could leave the type alone, since nobody checks it,
6370 but this might catch bugs faster. */
6371 mblk
->markers
[i
].m
.u_marker
.type
= Lisp_Misc_Free
;
6372 mblk
->markers
[i
].m
.u_free
.chain
= marker_free_list
;
6373 marker_free_list
= &mblk
->markers
[i
].m
;
6379 mblk
->markers
[i
].m
.u_any
.gcmarkbit
= 0;
6382 lim
= MARKER_BLOCK_SIZE
;
6383 /* If this block contains only free markers and we have already
6384 seen more than two blocks worth of free markers then deallocate
6386 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6388 *mprev
= mblk
->next
;
6389 /* Unhook from the free list. */
6390 marker_free_list
= mblk
->markers
[0].m
.u_free
.chain
;
6395 num_free
+= this_free
;
6396 mprev
= &mblk
->next
;
6400 total_markers
= num_used
;
6401 total_free_markers
= num_free
;
6404 /* Free all unmarked buffers */
6406 register struct buffer
*buffer
, **bprev
= &all_buffers
;
6409 for (buffer
= all_buffers
; buffer
; buffer
= *bprev
)
6410 if (!VECTOR_MARKED_P (buffer
))
6412 *bprev
= buffer
->next
;
6417 VECTOR_UNMARK (buffer
);
6418 /* Do not use buffer_(set|get)_intervals here. */
6419 buffer
->text
->intervals
= balance_intervals (buffer
->text
->intervals
);
6421 bprev
= &buffer
->next
;
6426 check_string_bytes (!noninteractive
);
6432 /* Debugging aids. */
6434 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6435 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6436 This may be helpful in debugging Emacs's memory usage.
6437 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6442 XSETINT (end
, (intptr_t) (char *) sbrk (0) / 1024);
6447 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6448 doc
: /* Return a list of counters that measure how much consing there has been.
6449 Each of these counters increments for a certain kind of object.
6450 The counters wrap around from the largest positive integer to zero.
6451 Garbage collection does not decrease them.
6452 The elements of the value are as follows:
6453 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6454 All are in units of 1 = one object consed
6455 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6457 MISCS include overlays, markers, and some internal types.
6458 Frames, windows, buffers, and subprocesses count as vectors
6459 (but the contents of a buffer's text do not count here). */)
6462 return listn (CONSTYPE_HEAP
, 8,
6463 bounded_number (cons_cells_consed
),
6464 bounded_number (floats_consed
),
6465 bounded_number (vector_cells_consed
),
6466 bounded_number (symbols_consed
),
6467 bounded_number (string_chars_consed
),
6468 bounded_number (misc_objects_consed
),
6469 bounded_number (intervals_consed
),
6470 bounded_number (strings_consed
));
6473 /* Find at most FIND_MAX symbols which have OBJ as their value or
6474 function. This is used in gdbinit's `xwhichsymbols' command. */
6477 which_symbols (Lisp_Object obj
, EMACS_INT find_max
)
6479 struct symbol_block
*sblk
;
6480 ptrdiff_t gc_count
= inhibit_garbage_collection ();
6481 Lisp_Object found
= Qnil
;
6485 for (sblk
= symbol_block
; sblk
; sblk
= sblk
->next
)
6487 union aligned_Lisp_Symbol
*aligned_sym
= sblk
->symbols
;
6490 for (bn
= 0; bn
< SYMBOL_BLOCK_SIZE
; bn
++, aligned_sym
++)
6492 struct Lisp_Symbol
*sym
= &aligned_sym
->s
;
6496 if (sblk
== symbol_block
&& bn
>= symbol_block_index
)
6499 XSETSYMBOL (tem
, sym
);
6500 val
= find_symbol_value (tem
);
6502 || EQ (sym
->function
, obj
)
6503 || (!NILP (sym
->function
)
6504 && COMPILEDP (sym
->function
)
6505 && EQ (AREF (sym
->function
, COMPILED_BYTECODE
), obj
))
6508 && EQ (AREF (val
, COMPILED_BYTECODE
), obj
)))
6510 found
= Fcons (tem
, found
);
6511 if (--find_max
== 0)
6519 unbind_to (gc_count
, Qnil
);
6523 #ifdef ENABLE_CHECKING
6525 bool suppress_checking
;
6528 die (const char *msg
, const char *file
, int line
)
6530 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: assertion failed: %s\r\n",
6532 terminate_due_to_signal (SIGABRT
, INT_MAX
);
6536 /* Initialization. */
6539 init_alloc_once (void)
6541 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6543 pure_size
= PURESIZE
;
6545 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6547 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6550 #ifdef DOUG_LEA_MALLOC
6551 mallopt (M_TRIM_THRESHOLD
, 128 * 1024); /* Trim threshold. */
6552 mallopt (M_MMAP_THRESHOLD
, 64 * 1024); /* Mmap threshold. */
6553 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* Max. number of mmap'ed areas. */
6558 refill_memory_reserve ();
6559 gc_cons_threshold
= GC_DEFAULT_THRESHOLD
;
6566 byte_stack_list
= 0;
6568 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6569 setjmp_tested_p
= longjmps_done
= 0;
6572 Vgc_elapsed
= make_float (0.0);
6577 syms_of_alloc (void)
6579 DEFVAR_INT ("gc-cons-threshold", gc_cons_threshold
,
6580 doc
: /* Number of bytes of consing between garbage collections.
6581 Garbage collection can happen automatically once this many bytes have been
6582 allocated since the last garbage collection. All data types count.
6584 Garbage collection happens automatically only when `eval' is called.
6586 By binding this temporarily to a large number, you can effectively
6587 prevent garbage collection during a part of the program.
6588 See also `gc-cons-percentage'. */);
6590 DEFVAR_LISP ("gc-cons-percentage", Vgc_cons_percentage
,
6591 doc
: /* Portion of the heap used for allocation.
6592 Garbage collection can happen automatically once this portion of the heap
6593 has been allocated since the last garbage collection.
6594 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6595 Vgc_cons_percentage
= make_float (0.1);
6597 DEFVAR_INT ("pure-bytes-used", pure_bytes_used
,
6598 doc
: /* Number of bytes of shareable Lisp data allocated so far. */);
6600 DEFVAR_INT ("cons-cells-consed", cons_cells_consed
,
6601 doc
: /* Number of cons cells that have been consed so far. */);
6603 DEFVAR_INT ("floats-consed", floats_consed
,
6604 doc
: /* Number of floats that have been consed so far. */);
6606 DEFVAR_INT ("vector-cells-consed", vector_cells_consed
,
6607 doc
: /* Number of vector cells that have been consed so far. */);
6609 DEFVAR_INT ("symbols-consed", symbols_consed
,
6610 doc
: /* Number of symbols that have been consed so far. */);
6612 DEFVAR_INT ("string-chars-consed", string_chars_consed
,
6613 doc
: /* Number of string characters that have been consed so far. */);
6615 DEFVAR_INT ("misc-objects-consed", misc_objects_consed
,
6616 doc
: /* Number of miscellaneous objects that have been consed so far.
6617 These include markers and overlays, plus certain objects not visible
6620 DEFVAR_INT ("intervals-consed", intervals_consed
,
6621 doc
: /* Number of intervals that have been consed so far. */);
6623 DEFVAR_INT ("strings-consed", strings_consed
,
6624 doc
: /* Number of strings that have been consed so far. */);
6626 DEFVAR_LISP ("purify-flag", Vpurify_flag
,
6627 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6628 This means that certain objects should be allocated in shared (pure) space.
6629 It can also be set to a hash-table, in which case this table is used to
6630 do hash-consing of the objects allocated to pure space. */);
6632 DEFVAR_BOOL ("garbage-collection-messages", garbage_collection_messages
,
6633 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6634 garbage_collection_messages
= 0;
6636 DEFVAR_LISP ("post-gc-hook", Vpost_gc_hook
,
6637 doc
: /* Hook run after garbage collection has finished. */);
6638 Vpost_gc_hook
= Qnil
;
6639 DEFSYM (Qpost_gc_hook
, "post-gc-hook");
6641 DEFVAR_LISP ("memory-signal-data", Vmemory_signal_data
,
6642 doc
: /* Precomputed `signal' argument for memory-full error. */);
6643 /* We build this in advance because if we wait until we need it, we might
6644 not be able to allocate the memory to hold it. */
6646 = listn (CONSTYPE_PURE
, 2, Qerror
,
6647 build_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
6649 DEFVAR_LISP ("memory-full", Vmemory_full
,
6650 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6651 Vmemory_full
= Qnil
;
6653 DEFSYM (Qconses
, "conses");
6654 DEFSYM (Qsymbols
, "symbols");
6655 DEFSYM (Qmiscs
, "miscs");
6656 DEFSYM (Qstrings
, "strings");
6657 DEFSYM (Qvectors
, "vectors");
6658 DEFSYM (Qfloats
, "floats");
6659 DEFSYM (Qintervals
, "intervals");
6660 DEFSYM (Qbuffers
, "buffers");
6661 DEFSYM (Qstring_bytes
, "string-bytes");
6662 DEFSYM (Qvector_slots
, "vector-slots");
6663 DEFSYM (Qheap
, "heap");
6664 DEFSYM (Qautomatic_gc
, "Automatic GC");
6666 DEFSYM (Qgc_cons_threshold
, "gc-cons-threshold");
6667 DEFSYM (Qchar_table_extra_slots
, "char-table-extra-slots");
6669 DEFVAR_LISP ("gc-elapsed", Vgc_elapsed
,
6670 doc
: /* Accumulated time elapsed in garbage collections.
6671 The time is in seconds as a floating point value. */);
6672 DEFVAR_INT ("gcs-done", gcs_done
,
6673 doc
: /* Accumulated number of garbage collections done. */);
6678 defsubr (&Smake_byte_code
);
6679 defsubr (&Smake_list
);
6680 defsubr (&Smake_vector
);
6681 defsubr (&Smake_string
);
6682 defsubr (&Smake_bool_vector
);
6683 defsubr (&Smake_symbol
);
6684 defsubr (&Smake_marker
);
6685 defsubr (&Spurecopy
);
6686 defsubr (&Sgarbage_collect
);
6687 defsubr (&Smemory_limit
);
6688 defsubr (&Smemory_use_counts
);
6690 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6691 defsubr (&Sgc_status
);
6695 /* When compiled with GCC, GDB might say "No enum type named
6696 pvec_type" if we don't have at least one symbol with that type, and
6697 then xbacktrace could fail. Similarly for the other enums and
6698 their values. Some non-GCC compilers don't like these constructs. */
6702 enum CHARTAB_SIZE_BITS CHARTAB_SIZE_BITS
;
6703 enum CHAR_TABLE_STANDARD_SLOTS CHAR_TABLE_STANDARD_SLOTS
;
6704 enum char_bits char_bits
;
6705 enum CHECK_LISP_OBJECT_TYPE CHECK_LISP_OBJECT_TYPE
;
6706 enum DEFAULT_HASH_SIZE DEFAULT_HASH_SIZE
;
6707 enum enum_USE_LSB_TAG enum_USE_LSB_TAG
;
6708 enum FLOAT_TO_STRING_BUFSIZE FLOAT_TO_STRING_BUFSIZE
;
6709 enum Lisp_Bits Lisp_Bits
;
6710 enum Lisp_Compiled Lisp_Compiled
;
6711 enum maxargs maxargs
;
6712 enum MAX_ALLOCA MAX_ALLOCA
;
6713 enum More_Lisp_Bits More_Lisp_Bits
;
6714 enum pvec_type pvec_type
;
6715 } const EXTERNALLY_VISIBLE gdb_make_enums_visible
= {0};
6716 #endif /* __GNUC__ */