1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
3 Copyright (C) 1985-1986, 1988, 1993-1995, 1997-2012
4 Free Software Foundation, Inc.
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
77 #include "w32heap.h" /* for sbrk */
80 #ifdef DOUG_LEA_MALLOC
84 /* Specify maximum number of areas to mmap. It would be nice to use a
85 value that explicitly means "no limit". */
87 #define MMAP_MAX_AREAS 100000000
89 #endif /* not DOUG_LEA_MALLOC */
91 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
92 to a struct Lisp_String. */
94 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
95 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
96 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
98 #define VECTOR_MARK(V) ((V)->header.size |= ARRAY_MARK_FLAG)
99 #define VECTOR_UNMARK(V) ((V)->header.size &= ~ARRAY_MARK_FLAG)
100 #define VECTOR_MARKED_P(V) (((V)->header.size & ARRAY_MARK_FLAG) != 0)
102 /* Default value of gc_cons_threshold (see below). */
104 #define GC_DEFAULT_THRESHOLD (100000 * word_size)
106 /* Global variables. */
107 struct emacs_globals globals
;
109 /* Number of bytes of consing done since the last gc. */
111 EMACS_INT consing_since_gc
;
113 /* Similar minimum, computed from Vgc_cons_percentage. */
115 EMACS_INT gc_relative_threshold
;
117 /* Minimum number of bytes of consing since GC before next GC,
118 when memory is full. */
120 EMACS_INT memory_full_cons_threshold
;
122 /* True during GC. */
126 /* True means abort if try to GC.
127 This is for code which is written on the assumption that
128 no GC will happen, so as to verify that assumption. */
132 /* Number of live and free conses etc. */
134 static EMACS_INT total_conses
, total_markers
, total_symbols
, total_buffers
;
135 static EMACS_INT total_free_conses
, total_free_markers
, total_free_symbols
;
136 static EMACS_INT total_free_floats
, total_floats
;
138 /* Points to memory space allocated as "spare", to be freed if we run
139 out of memory. We keep one large block, four cons-blocks, and
140 two string blocks. */
142 static char *spare_memory
[7];
144 /* Amount of spare memory to keep in large reserve block, or to see
145 whether this much is available when malloc fails on a larger request. */
147 #define SPARE_MEMORY (1 << 14)
149 /* Initialize it to a nonzero value to force it into data space
150 (rather than bss space). That way unexec will remap it into text
151 space (pure), on some systems. We have not implemented the
152 remapping on more recent systems because this is less important
153 nowadays than in the days of small memories and timesharing. */
155 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
156 #define PUREBEG (char *) pure
158 /* Pointer to the pure area, and its size. */
160 static char *purebeg
;
161 static ptrdiff_t pure_size
;
163 /* Number of bytes of pure storage used before pure storage overflowed.
164 If this is non-zero, this implies that an overflow occurred. */
166 static ptrdiff_t pure_bytes_used_before_overflow
;
168 /* True if P points into pure space. */
170 #define PURE_POINTER_P(P) \
171 ((uintptr_t) (P) - (uintptr_t) purebeg <= pure_size)
173 /* Index in pure at which next pure Lisp object will be allocated.. */
175 static ptrdiff_t pure_bytes_used_lisp
;
177 /* Number of bytes allocated for non-Lisp objects in pure storage. */
179 static ptrdiff_t pure_bytes_used_non_lisp
;
181 /* If nonzero, this is a warning delivered by malloc and not yet
184 const char *pending_malloc_warning
;
186 /* Maximum amount of C stack to save when a GC happens. */
188 #ifndef MAX_SAVE_STACK
189 #define MAX_SAVE_STACK 16000
192 /* Buffer in which we save a copy of the C stack at each GC. */
194 #if MAX_SAVE_STACK > 0
195 static char *stack_copy
;
196 static ptrdiff_t stack_copy_size
;
199 static Lisp_Object Qconses
;
200 static Lisp_Object Qsymbols
;
201 static Lisp_Object Qmiscs
;
202 static Lisp_Object Qstrings
;
203 static Lisp_Object Qvectors
;
204 static Lisp_Object Qfloats
;
205 static Lisp_Object Qintervals
;
206 static Lisp_Object Qbuffers
;
207 static Lisp_Object Qstring_bytes
, Qvector_slots
, Qheap
;
208 static Lisp_Object Qgc_cons_threshold
;
209 Lisp_Object Qautomatic_gc
;
210 Lisp_Object Qchar_table_extra_slots
;
212 /* Hook run after GC has finished. */
214 static Lisp_Object Qpost_gc_hook
;
216 static void mark_terminals (void);
217 static void gc_sweep (void);
218 static Lisp_Object
make_pure_vector (ptrdiff_t);
219 static void mark_buffer (struct buffer
*);
221 #if !defined REL_ALLOC || defined SYSTEM_MALLOC
222 static void refill_memory_reserve (void);
224 static void compact_small_strings (void);
225 static void free_large_strings (void);
226 static void free_misc (Lisp_Object
);
227 extern Lisp_Object
which_symbols (Lisp_Object
, EMACS_INT
) EXTERNALLY_VISIBLE
;
229 /* When scanning the C stack for live Lisp objects, Emacs keeps track of
230 what memory allocated via lisp_malloc and lisp_align_malloc is intended
231 for what purpose. This enumeration specifies the type of memory. */
242 /* Since all non-bool pseudovectors are small enough to be
243 allocated from vector blocks, this memory type denotes
244 large regular vectors and large bool pseudovectors. */
246 /* Special type to denote vector blocks. */
247 MEM_TYPE_VECTOR_BLOCK
,
248 /* Special type to denote reserved memory. */
252 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
254 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
255 #include <stdio.h> /* For fprintf. */
258 /* A unique object in pure space used to make some Lisp objects
259 on free lists recognizable in O(1). */
261 static Lisp_Object Vdead
;
262 #define DEADP(x) EQ (x, Vdead)
264 #ifdef GC_MALLOC_CHECK
266 enum mem_type allocated_mem_type
;
268 #endif /* GC_MALLOC_CHECK */
270 /* A node in the red-black tree describing allocated memory containing
271 Lisp data. Each such block is recorded with its start and end
272 address when it is allocated, and removed from the tree when it
275 A red-black tree is a balanced binary tree with the following
278 1. Every node is either red or black.
279 2. Every leaf is black.
280 3. If a node is red, then both of its children are black.
281 4. Every simple path from a node to a descendant leaf contains
282 the same number of black nodes.
283 5. The root is always black.
285 When nodes are inserted into the tree, or deleted from the tree,
286 the tree is "fixed" so that these properties are always true.
288 A red-black tree with N internal nodes has height at most 2
289 log(N+1). Searches, insertions and deletions are done in O(log N).
290 Please see a text book about data structures for a detailed
291 description of red-black trees. Any book worth its salt should
296 /* Children of this node. These pointers are never NULL. When there
297 is no child, the value is MEM_NIL, which points to a dummy node. */
298 struct mem_node
*left
, *right
;
300 /* The parent of this node. In the root node, this is NULL. */
301 struct mem_node
*parent
;
303 /* Start and end of allocated region. */
307 enum {MEM_BLACK
, MEM_RED
} color
;
313 /* Base address of stack. Set in main. */
315 Lisp_Object
*stack_base
;
317 /* Root of the tree describing allocated Lisp memory. */
319 static struct mem_node
*mem_root
;
321 /* Lowest and highest known address in the heap. */
323 static void *min_heap_address
, *max_heap_address
;
325 /* Sentinel node of the tree. */
327 static struct mem_node mem_z
;
328 #define MEM_NIL &mem_z
330 static struct Lisp_Vector
*allocate_vectorlike (ptrdiff_t);
331 static void lisp_free (void *);
332 static void mark_stack (void);
333 static bool live_vector_p (struct mem_node
*, void *);
334 static bool live_buffer_p (struct mem_node
*, void *);
335 static bool live_string_p (struct mem_node
*, void *);
336 static bool live_cons_p (struct mem_node
*, void *);
337 static bool live_symbol_p (struct mem_node
*, void *);
338 static bool live_float_p (struct mem_node
*, void *);
339 static bool live_misc_p (struct mem_node
*, void *);
340 static void mark_maybe_object (Lisp_Object
);
341 static void mark_memory (void *, void *);
342 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
343 static void mem_init (void);
344 static struct mem_node
*mem_insert (void *, void *, enum mem_type
);
345 static void mem_insert_fixup (struct mem_node
*);
346 static void mem_rotate_left (struct mem_node
*);
347 static void mem_rotate_right (struct mem_node
*);
348 static void mem_delete (struct mem_node
*);
349 static void mem_delete_fixup (struct mem_node
*);
350 static struct mem_node
*mem_find (void *);
354 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
355 static void check_gcpros (void);
358 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
364 /* Recording what needs to be marked for gc. */
366 struct gcpro
*gcprolist
;
368 /* Addresses of staticpro'd variables. Initialize it to a nonzero
369 value; otherwise some compilers put it into BSS. */
371 #define NSTATICS 0x800
372 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
374 /* Index of next unused slot in staticvec. */
376 static int staticidx
;
378 static void *pure_alloc (size_t, int);
381 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
382 ALIGNMENT must be a power of 2. */
384 #define ALIGN(ptr, ALIGNMENT) \
385 ((void *) (((uintptr_t) (ptr) + (ALIGNMENT) - 1) \
386 & ~ ((ALIGNMENT) - 1)))
390 /************************************************************************
392 ************************************************************************/
394 /* Function malloc calls this if it finds we are near exhausting storage. */
397 malloc_warning (const char *str
)
399 pending_malloc_warning
= str
;
403 /* Display an already-pending malloc warning. */
406 display_malloc_warning (void)
408 call3 (intern ("display-warning"),
410 build_string (pending_malloc_warning
),
411 intern ("emergency"));
412 pending_malloc_warning
= 0;
415 /* Called if we can't allocate relocatable space for a buffer. */
418 buffer_memory_full (ptrdiff_t nbytes
)
420 /* If buffers use the relocating allocator, no need to free
421 spare_memory, because we may have plenty of malloc space left
422 that we could get, and if we don't, the malloc that fails will
423 itself cause spare_memory to be freed. If buffers don't use the
424 relocating allocator, treat this like any other failing
428 memory_full (nbytes
);
431 /* This used to call error, but if we've run out of memory, we could
432 get infinite recursion trying to build the string. */
433 xsignal (Qnil
, Vmemory_signal_data
);
436 /* A common multiple of the positive integers A and B. Ideally this
437 would be the least common multiple, but there's no way to do that
438 as a constant expression in C, so do the best that we can easily do. */
439 #define COMMON_MULTIPLE(a, b) \
440 ((a) % (b) == 0 ? (a) : (b) % (a) == 0 ? (b) : (a) * (b))
442 #ifndef XMALLOC_OVERRUN_CHECK
443 #define XMALLOC_OVERRUN_CHECK_OVERHEAD 0
446 /* Check for overrun in malloc'ed buffers by wrapping a header and trailer
449 The header consists of XMALLOC_OVERRUN_CHECK_SIZE fixed bytes
450 followed by XMALLOC_OVERRUN_SIZE_SIZE bytes containing the original
451 block size in little-endian order. The trailer consists of
452 XMALLOC_OVERRUN_CHECK_SIZE fixed bytes.
454 The header is used to detect whether this block has been allocated
455 through these functions, as some low-level libc functions may
456 bypass the malloc hooks. */
458 #define XMALLOC_OVERRUN_CHECK_SIZE 16
459 #define XMALLOC_OVERRUN_CHECK_OVERHEAD \
460 (2 * XMALLOC_OVERRUN_CHECK_SIZE + XMALLOC_OVERRUN_SIZE_SIZE)
462 /* Define XMALLOC_OVERRUN_SIZE_SIZE so that (1) it's large enough to
463 hold a size_t value and (2) the header size is a multiple of the
464 alignment that Emacs needs for C types and for USE_LSB_TAG. */
465 #define XMALLOC_BASE_ALIGNMENT \
466 alignof (union { long double d; intmax_t i; void *p; })
469 # define XMALLOC_HEADER_ALIGNMENT \
470 COMMON_MULTIPLE (GCALIGNMENT, XMALLOC_BASE_ALIGNMENT)
472 # define XMALLOC_HEADER_ALIGNMENT XMALLOC_BASE_ALIGNMENT
474 #define XMALLOC_OVERRUN_SIZE_SIZE \
475 (((XMALLOC_OVERRUN_CHECK_SIZE + sizeof (size_t) \
476 + XMALLOC_HEADER_ALIGNMENT - 1) \
477 / XMALLOC_HEADER_ALIGNMENT * XMALLOC_HEADER_ALIGNMENT) \
478 - XMALLOC_OVERRUN_CHECK_SIZE)
480 static char const xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
] =
481 { '\x9a', '\x9b', '\xae', '\xaf',
482 '\xbf', '\xbe', '\xce', '\xcf',
483 '\xea', '\xeb', '\xec', '\xed',
484 '\xdf', '\xde', '\x9c', '\x9d' };
486 static char const xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
487 { '\xaa', '\xab', '\xac', '\xad',
488 '\xba', '\xbb', '\xbc', '\xbd',
489 '\xca', '\xcb', '\xcc', '\xcd',
490 '\xda', '\xdb', '\xdc', '\xdd' };
492 /* Insert and extract the block size in the header. */
495 xmalloc_put_size (unsigned char *ptr
, size_t size
)
498 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
500 *--ptr
= size
& ((1 << CHAR_BIT
) - 1);
506 xmalloc_get_size (unsigned char *ptr
)
510 ptr
-= XMALLOC_OVERRUN_SIZE_SIZE
;
511 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
520 /* Like malloc, but wraps allocated block with header and trailer. */
523 overrun_check_malloc (size_t size
)
525 register unsigned char *val
;
526 if (SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
< size
)
529 val
= malloc (size
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
532 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
533 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
534 xmalloc_put_size (val
, size
);
535 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
536 XMALLOC_OVERRUN_CHECK_SIZE
);
542 /* Like realloc, but checks old block for overrun, and wraps new block
543 with header and trailer. */
546 overrun_check_realloc (void *block
, size_t size
)
548 register unsigned char *val
= (unsigned char *) block
;
549 if (SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
< size
)
553 && memcmp (xmalloc_overrun_check_header
,
554 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
555 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
557 size_t osize
= xmalloc_get_size (val
);
558 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
559 XMALLOC_OVERRUN_CHECK_SIZE
))
561 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
562 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
563 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
566 val
= realloc (val
, size
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
570 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
571 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
572 xmalloc_put_size (val
, size
);
573 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
574 XMALLOC_OVERRUN_CHECK_SIZE
);
579 /* Like free, but checks block for overrun. */
582 overrun_check_free (void *block
)
584 unsigned char *val
= (unsigned char *) block
;
587 && memcmp (xmalloc_overrun_check_header
,
588 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
589 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
591 size_t osize
= xmalloc_get_size (val
);
592 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
593 XMALLOC_OVERRUN_CHECK_SIZE
))
595 #ifdef XMALLOC_CLEAR_FREE_MEMORY
596 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
597 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
599 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
600 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
601 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
611 #define malloc overrun_check_malloc
612 #define realloc overrun_check_realloc
613 #define free overrun_check_free
616 /* If compiled with XMALLOC_BLOCK_INPUT_CHECK, define a symbol
617 BLOCK_INPUT_IN_MEMORY_ALLOCATORS that is visible to the debugger.
618 If that variable is set, block input while in one of Emacs's memory
619 allocation functions. There should be no need for this debugging
620 option, since signal handlers do not allocate memory, but Emacs
621 formerly allocated memory in signal handlers and this compile-time
622 option remains as a way to help debug the issue should it rear its
624 #ifdef XMALLOC_BLOCK_INPUT_CHECK
625 bool block_input_in_memory_allocators EXTERNALLY_VISIBLE
;
627 malloc_block_input (void)
629 if (block_input_in_memory_allocators
)
633 malloc_unblock_input (void)
635 if (block_input_in_memory_allocators
)
638 # define MALLOC_BLOCK_INPUT malloc_block_input ()
639 # define MALLOC_UNBLOCK_INPUT malloc_unblock_input ()
641 # define MALLOC_BLOCK_INPUT ((void) 0)
642 # define MALLOC_UNBLOCK_INPUT ((void) 0)
645 #define MALLOC_PROBE(size) \
647 if (profiler_memory_running) \
648 malloc_probe (size); \
652 /* Like malloc but check for no memory and block interrupt input.. */
655 xmalloc (size_t size
)
661 MALLOC_UNBLOCK_INPUT
;
669 /* Like the above, but zeroes out the memory just allocated. */
672 xzalloc (size_t size
)
678 MALLOC_UNBLOCK_INPUT
;
682 memset (val
, 0, size
);
687 /* Like realloc but check for no memory and block interrupt input.. */
690 xrealloc (void *block
, size_t size
)
695 /* We must call malloc explicitly when BLOCK is 0, since some
696 reallocs don't do this. */
700 val
= realloc (block
, size
);
701 MALLOC_UNBLOCK_INPUT
;
710 /* Like free but block interrupt input. */
719 MALLOC_UNBLOCK_INPUT
;
720 /* We don't call refill_memory_reserve here
721 because in practice the call in r_alloc_free seems to suffice. */
725 /* Other parts of Emacs pass large int values to allocator functions
726 expecting ptrdiff_t. This is portable in practice, but check it to
728 verify (INT_MAX
<= PTRDIFF_MAX
);
731 /* Allocate an array of NITEMS items, each of size ITEM_SIZE.
732 Signal an error on memory exhaustion, and block interrupt input. */
735 xnmalloc (ptrdiff_t nitems
, ptrdiff_t item_size
)
737 eassert (0 <= nitems
&& 0 < item_size
);
738 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
739 memory_full (SIZE_MAX
);
740 return xmalloc (nitems
* item_size
);
744 /* Reallocate an array PA to make it of NITEMS items, each of size ITEM_SIZE.
745 Signal an error on memory exhaustion, and block interrupt input. */
748 xnrealloc (void *pa
, ptrdiff_t nitems
, ptrdiff_t item_size
)
750 eassert (0 <= nitems
&& 0 < item_size
);
751 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
752 memory_full (SIZE_MAX
);
753 return xrealloc (pa
, nitems
* item_size
);
757 /* Grow PA, which points to an array of *NITEMS items, and return the
758 location of the reallocated array, updating *NITEMS to reflect its
759 new size. The new array will contain at least NITEMS_INCR_MIN more
760 items, but will not contain more than NITEMS_MAX items total.
761 ITEM_SIZE is the size of each item, in bytes.
763 ITEM_SIZE and NITEMS_INCR_MIN must be positive. *NITEMS must be
764 nonnegative. If NITEMS_MAX is -1, it is treated as if it were
767 If PA is null, then allocate a new array instead of reallocating
768 the old one. Thus, to grow an array A without saving its old
769 contents, invoke xfree (A) immediately followed by xgrowalloc (0,
772 Block interrupt input as needed. If memory exhaustion occurs, set
773 *NITEMS to zero if PA is null, and signal an error (i.e., do not
777 xpalloc (void *pa
, ptrdiff_t *nitems
, ptrdiff_t nitems_incr_min
,
778 ptrdiff_t nitems_max
, ptrdiff_t item_size
)
780 /* The approximate size to use for initial small allocation
781 requests. This is the largest "small" request for the GNU C
783 enum { DEFAULT_MXFAST
= 64 * sizeof (size_t) / 4 };
785 /* If the array is tiny, grow it to about (but no greater than)
786 DEFAULT_MXFAST bytes. Otherwise, grow it by about 50%. */
787 ptrdiff_t n
= *nitems
;
788 ptrdiff_t tiny_max
= DEFAULT_MXFAST
/ item_size
- n
;
789 ptrdiff_t half_again
= n
>> 1;
790 ptrdiff_t incr_estimate
= max (tiny_max
, half_again
);
792 /* Adjust the increment according to three constraints: NITEMS_INCR_MIN,
793 NITEMS_MAX, and what the C language can represent safely. */
794 ptrdiff_t C_language_max
= min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
;
795 ptrdiff_t n_max
= (0 <= nitems_max
&& nitems_max
< C_language_max
796 ? nitems_max
: C_language_max
);
797 ptrdiff_t nitems_incr_max
= n_max
- n
;
798 ptrdiff_t incr
= max (nitems_incr_min
, min (incr_estimate
, nitems_incr_max
));
800 eassert (0 < item_size
&& 0 < nitems_incr_min
&& 0 <= n
&& -1 <= nitems_max
);
803 if (nitems_incr_max
< incr
)
804 memory_full (SIZE_MAX
);
806 pa
= xrealloc (pa
, n
* item_size
);
812 /* Like strdup, but uses xmalloc. */
815 xstrdup (const char *s
)
817 size_t len
= strlen (s
) + 1;
818 char *p
= xmalloc (len
);
824 /* Unwind for SAFE_ALLOCA */
827 safe_alloca_unwind (Lisp_Object arg
)
829 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
838 /* Return a newly allocated memory block of SIZE bytes, remembering
839 to free it when unwinding. */
841 record_xmalloc (size_t size
)
843 void *p
= xmalloc (size
);
844 record_unwind_protect (safe_alloca_unwind
, make_save_value (p
, 0));
849 /* Like malloc but used for allocating Lisp data. NBYTES is the
850 number of bytes to allocate, TYPE describes the intended use of the
851 allocated memory block (for strings, for conses, ...). */
854 void *lisp_malloc_loser EXTERNALLY_VISIBLE
;
858 lisp_malloc (size_t nbytes
, enum mem_type type
)
864 #ifdef GC_MALLOC_CHECK
865 allocated_mem_type
= type
;
868 val
= malloc (nbytes
);
871 /* If the memory just allocated cannot be addressed thru a Lisp
872 object's pointer, and it needs to be,
873 that's equivalent to running out of memory. */
874 if (val
&& type
!= MEM_TYPE_NON_LISP
)
877 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
878 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
880 lisp_malloc_loser
= val
;
887 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
888 if (val
&& type
!= MEM_TYPE_NON_LISP
)
889 mem_insert (val
, (char *) val
+ nbytes
, type
);
892 MALLOC_UNBLOCK_INPUT
;
894 memory_full (nbytes
);
895 MALLOC_PROBE (nbytes
);
899 /* Free BLOCK. This must be called to free memory allocated with a
900 call to lisp_malloc. */
903 lisp_free (void *block
)
907 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
908 mem_delete (mem_find (block
));
910 MALLOC_UNBLOCK_INPUT
;
913 /***** Allocation of aligned blocks of memory to store Lisp data. *****/
915 /* The entry point is lisp_align_malloc which returns blocks of at most
916 BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
918 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
919 #define USE_POSIX_MEMALIGN 1
922 /* BLOCK_ALIGN has to be a power of 2. */
923 #define BLOCK_ALIGN (1 << 10)
925 /* Padding to leave at the end of a malloc'd block. This is to give
926 malloc a chance to minimize the amount of memory wasted to alignment.
927 It should be tuned to the particular malloc library used.
928 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
929 posix_memalign on the other hand would ideally prefer a value of 4
930 because otherwise, there's 1020 bytes wasted between each ablocks.
931 In Emacs, testing shows that those 1020 can most of the time be
932 efficiently used by malloc to place other objects, so a value of 0 can
933 still preferable unless you have a lot of aligned blocks and virtually
935 #define BLOCK_PADDING 0
936 #define BLOCK_BYTES \
937 (BLOCK_ALIGN - sizeof (struct ablocks *) - BLOCK_PADDING)
939 /* Internal data structures and constants. */
941 #define ABLOCKS_SIZE 16
943 /* An aligned block of memory. */
948 char payload
[BLOCK_BYTES
];
949 struct ablock
*next_free
;
951 /* `abase' is the aligned base of the ablocks. */
952 /* It is overloaded to hold the virtual `busy' field that counts
953 the number of used ablock in the parent ablocks.
954 The first ablock has the `busy' field, the others have the `abase'
955 field. To tell the difference, we assume that pointers will have
956 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
957 is used to tell whether the real base of the parent ablocks is `abase'
958 (if not, the word before the first ablock holds a pointer to the
960 struct ablocks
*abase
;
961 /* The padding of all but the last ablock is unused. The padding of
962 the last ablock in an ablocks is not allocated. */
964 char padding
[BLOCK_PADDING
];
968 /* A bunch of consecutive aligned blocks. */
971 struct ablock blocks
[ABLOCKS_SIZE
];
974 /* Size of the block requested from malloc or posix_memalign. */
975 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
977 #define ABLOCK_ABASE(block) \
978 (((uintptr_t) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
979 ? (struct ablocks *)(block) \
982 /* Virtual `busy' field. */
983 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
985 /* Pointer to the (not necessarily aligned) malloc block. */
986 #ifdef USE_POSIX_MEMALIGN
987 #define ABLOCKS_BASE(abase) (abase)
989 #define ABLOCKS_BASE(abase) \
990 (1 & (intptr_t) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
993 /* The list of free ablock. */
994 static struct ablock
*free_ablock
;
996 /* Allocate an aligned block of nbytes.
997 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
998 smaller or equal to BLOCK_BYTES. */
1000 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
1003 struct ablocks
*abase
;
1005 eassert (nbytes
<= BLOCK_BYTES
);
1009 #ifdef GC_MALLOC_CHECK
1010 allocated_mem_type
= type
;
1016 intptr_t aligned
; /* int gets warning casting to 64-bit pointer. */
1018 #ifdef DOUG_LEA_MALLOC
1019 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1020 because mapped region contents are not preserved in
1022 mallopt (M_MMAP_MAX
, 0);
1025 #ifdef USE_POSIX_MEMALIGN
1027 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1033 base
= malloc (ABLOCKS_BYTES
);
1034 abase
= ALIGN (base
, BLOCK_ALIGN
);
1039 MALLOC_UNBLOCK_INPUT
;
1040 memory_full (ABLOCKS_BYTES
);
1043 aligned
= (base
== abase
);
1045 ((void**)abase
)[-1] = base
;
1047 #ifdef DOUG_LEA_MALLOC
1048 /* Back to a reasonable maximum of mmap'ed areas. */
1049 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1053 /* If the memory just allocated cannot be addressed thru a Lisp
1054 object's pointer, and it needs to be, that's equivalent to
1055 running out of memory. */
1056 if (type
!= MEM_TYPE_NON_LISP
)
1059 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1060 XSETCONS (tem
, end
);
1061 if ((char *) XCONS (tem
) != end
)
1063 lisp_malloc_loser
= base
;
1065 MALLOC_UNBLOCK_INPUT
;
1066 memory_full (SIZE_MAX
);
1071 /* Initialize the blocks and put them on the free list.
1072 If `base' was not properly aligned, we can't use the last block. */
1073 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1075 abase
->blocks
[i
].abase
= abase
;
1076 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1077 free_ablock
= &abase
->blocks
[i
];
1079 ABLOCKS_BUSY (abase
) = (struct ablocks
*) aligned
;
1081 eassert (0 == ((uintptr_t) abase
) % BLOCK_ALIGN
);
1082 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1083 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1084 eassert (ABLOCKS_BASE (abase
) == base
);
1085 eassert (aligned
== (intptr_t) ABLOCKS_BUSY (abase
));
1088 abase
= ABLOCK_ABASE (free_ablock
);
1089 ABLOCKS_BUSY (abase
) =
1090 (struct ablocks
*) (2 + (intptr_t) ABLOCKS_BUSY (abase
));
1092 free_ablock
= free_ablock
->x
.next_free
;
1094 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1095 if (type
!= MEM_TYPE_NON_LISP
)
1096 mem_insert (val
, (char *) val
+ nbytes
, type
);
1099 MALLOC_UNBLOCK_INPUT
;
1101 MALLOC_PROBE (nbytes
);
1103 eassert (0 == ((uintptr_t) val
) % BLOCK_ALIGN
);
1108 lisp_align_free (void *block
)
1110 struct ablock
*ablock
= block
;
1111 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1114 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1115 mem_delete (mem_find (block
));
1117 /* Put on free list. */
1118 ablock
->x
.next_free
= free_ablock
;
1119 free_ablock
= ablock
;
1120 /* Update busy count. */
1121 ABLOCKS_BUSY (abase
)
1122 = (struct ablocks
*) (-2 + (intptr_t) ABLOCKS_BUSY (abase
));
1124 if (2 > (intptr_t) ABLOCKS_BUSY (abase
))
1125 { /* All the blocks are free. */
1126 int i
= 0, aligned
= (intptr_t) ABLOCKS_BUSY (abase
);
1127 struct ablock
**tem
= &free_ablock
;
1128 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1132 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1135 *tem
= (*tem
)->x
.next_free
;
1138 tem
= &(*tem
)->x
.next_free
;
1140 eassert ((aligned
& 1) == aligned
);
1141 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1142 #ifdef USE_POSIX_MEMALIGN
1143 eassert ((uintptr_t) ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1145 free (ABLOCKS_BASE (abase
));
1147 MALLOC_UNBLOCK_INPUT
;
1151 /***********************************************************************
1153 ***********************************************************************/
1155 /* Number of intervals allocated in an interval_block structure.
1156 The 1020 is 1024 minus malloc overhead. */
1158 #define INTERVAL_BLOCK_SIZE \
1159 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1161 /* Intervals are allocated in chunks in form of an interval_block
1164 struct interval_block
1166 /* Place `intervals' first, to preserve alignment. */
1167 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1168 struct interval_block
*next
;
1171 /* Current interval block. Its `next' pointer points to older
1174 static struct interval_block
*interval_block
;
1176 /* Index in interval_block above of the next unused interval
1179 static int interval_block_index
= INTERVAL_BLOCK_SIZE
;
1181 /* Number of free and live intervals. */
1183 static EMACS_INT total_free_intervals
, total_intervals
;
1185 /* List of free intervals. */
1187 static INTERVAL interval_free_list
;
1189 /* Return a new interval. */
1192 make_interval (void)
1198 if (interval_free_list
)
1200 val
= interval_free_list
;
1201 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1205 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1207 struct interval_block
*newi
1208 = lisp_malloc (sizeof *newi
, MEM_TYPE_NON_LISP
);
1210 newi
->next
= interval_block
;
1211 interval_block
= newi
;
1212 interval_block_index
= 0;
1213 total_free_intervals
+= INTERVAL_BLOCK_SIZE
;
1215 val
= &interval_block
->intervals
[interval_block_index
++];
1218 MALLOC_UNBLOCK_INPUT
;
1220 consing_since_gc
+= sizeof (struct interval
);
1222 total_free_intervals
--;
1223 RESET_INTERVAL (val
);
1229 /* Mark Lisp objects in interval I. */
1232 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1234 /* Intervals should never be shared. So, if extra internal checking is
1235 enabled, GC aborts if it seems to have visited an interval twice. */
1236 eassert (!i
->gcmarkbit
);
1238 mark_object (i
->plist
);
1241 /* Mark the interval tree rooted in I. */
1243 #define MARK_INTERVAL_TREE(i) \
1245 if (i && !i->gcmarkbit) \
1246 traverse_intervals_noorder (i, mark_interval, Qnil); \
1249 /***********************************************************************
1251 ***********************************************************************/
1253 /* Lisp_Strings are allocated in string_block structures. When a new
1254 string_block is allocated, all the Lisp_Strings it contains are
1255 added to a free-list string_free_list. When a new Lisp_String is
1256 needed, it is taken from that list. During the sweep phase of GC,
1257 string_blocks that are entirely free are freed, except two which
1260 String data is allocated from sblock structures. Strings larger
1261 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1262 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1264 Sblocks consist internally of sdata structures, one for each
1265 Lisp_String. The sdata structure points to the Lisp_String it
1266 belongs to. The Lisp_String points back to the `u.data' member of
1267 its sdata structure.
1269 When a Lisp_String is freed during GC, it is put back on
1270 string_free_list, and its `data' member and its sdata's `string'
1271 pointer is set to null. The size of the string is recorded in the
1272 `u.nbytes' member of the sdata. So, sdata structures that are no
1273 longer used, can be easily recognized, and it's easy to compact the
1274 sblocks of small strings which we do in compact_small_strings. */
1276 /* Size in bytes of an sblock structure used for small strings. This
1277 is 8192 minus malloc overhead. */
1279 #define SBLOCK_SIZE 8188
1281 /* Strings larger than this are considered large strings. String data
1282 for large strings is allocated from individual sblocks. */
1284 #define LARGE_STRING_BYTES 1024
1286 /* Structure describing string memory sub-allocated from an sblock.
1287 This is where the contents of Lisp strings are stored. */
1291 /* Back-pointer to the string this sdata belongs to. If null, this
1292 structure is free, and the NBYTES member of the union below
1293 contains the string's byte size (the same value that STRING_BYTES
1294 would return if STRING were non-null). If non-null, STRING_BYTES
1295 (STRING) is the size of the data, and DATA contains the string's
1297 struct Lisp_String
*string
;
1299 #ifdef GC_CHECK_STRING_BYTES
1302 unsigned char data
[1];
1304 #define SDATA_NBYTES(S) (S)->nbytes
1305 #define SDATA_DATA(S) (S)->data
1306 #define SDATA_SELECTOR(member) member
1308 #else /* not GC_CHECK_STRING_BYTES */
1312 /* When STRING is non-null. */
1313 unsigned char data
[1];
1315 /* When STRING is null. */
1319 #define SDATA_NBYTES(S) (S)->u.nbytes
1320 #define SDATA_DATA(S) (S)->u.data
1321 #define SDATA_SELECTOR(member) u.member
1323 #endif /* not GC_CHECK_STRING_BYTES */
1325 #define SDATA_DATA_OFFSET offsetof (struct sdata, SDATA_SELECTOR (data))
1329 /* Structure describing a block of memory which is sub-allocated to
1330 obtain string data memory for strings. Blocks for small strings
1331 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1332 as large as needed. */
1337 struct sblock
*next
;
1339 /* Pointer to the next free sdata block. This points past the end
1340 of the sblock if there isn't any space left in this block. */
1341 struct sdata
*next_free
;
1343 /* Start of data. */
1344 struct sdata first_data
;
1347 /* Number of Lisp strings in a string_block structure. The 1020 is
1348 1024 minus malloc overhead. */
1350 #define STRING_BLOCK_SIZE \
1351 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1353 /* Structure describing a block from which Lisp_String structures
1358 /* Place `strings' first, to preserve alignment. */
1359 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1360 struct string_block
*next
;
1363 /* Head and tail of the list of sblock structures holding Lisp string
1364 data. We always allocate from current_sblock. The NEXT pointers
1365 in the sblock structures go from oldest_sblock to current_sblock. */
1367 static struct sblock
*oldest_sblock
, *current_sblock
;
1369 /* List of sblocks for large strings. */
1371 static struct sblock
*large_sblocks
;
1373 /* List of string_block structures. */
1375 static struct string_block
*string_blocks
;
1377 /* Free-list of Lisp_Strings. */
1379 static struct Lisp_String
*string_free_list
;
1381 /* Number of live and free Lisp_Strings. */
1383 static EMACS_INT total_strings
, total_free_strings
;
1385 /* Number of bytes used by live strings. */
1387 static EMACS_INT total_string_bytes
;
1389 /* Given a pointer to a Lisp_String S which is on the free-list
1390 string_free_list, return a pointer to its successor in the
1393 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1395 /* Return a pointer to the sdata structure belonging to Lisp string S.
1396 S must be live, i.e. S->data must not be null. S->data is actually
1397 a pointer to the `u.data' member of its sdata structure; the
1398 structure starts at a constant offset in front of that. */
1400 #define SDATA_OF_STRING(S) ((struct sdata *) ((S)->data - SDATA_DATA_OFFSET))
1403 #ifdef GC_CHECK_STRING_OVERRUN
1405 /* We check for overrun in string data blocks by appending a small
1406 "cookie" after each allocated string data block, and check for the
1407 presence of this cookie during GC. */
1409 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1410 static char const string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1411 { '\xde', '\xad', '\xbe', '\xef' };
1414 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1417 /* Value is the size of an sdata structure large enough to hold NBYTES
1418 bytes of string data. The value returned includes a terminating
1419 NUL byte, the size of the sdata structure, and padding. */
1421 #ifdef GC_CHECK_STRING_BYTES
1423 #define SDATA_SIZE(NBYTES) \
1424 ((SDATA_DATA_OFFSET \
1426 + sizeof (ptrdiff_t) - 1) \
1427 & ~(sizeof (ptrdiff_t) - 1))
1429 #else /* not GC_CHECK_STRING_BYTES */
1431 /* The 'max' reserves space for the nbytes union member even when NBYTES + 1 is
1432 less than the size of that member. The 'max' is not needed when
1433 SDATA_DATA_OFFSET is a multiple of sizeof (ptrdiff_t), because then the
1434 alignment code reserves enough space. */
1436 #define SDATA_SIZE(NBYTES) \
1437 ((SDATA_DATA_OFFSET \
1438 + (SDATA_DATA_OFFSET % sizeof (ptrdiff_t) == 0 \
1440 : max (NBYTES, sizeof (ptrdiff_t) - 1)) \
1442 + sizeof (ptrdiff_t) - 1) \
1443 & ~(sizeof (ptrdiff_t) - 1))
1445 #endif /* not GC_CHECK_STRING_BYTES */
1447 /* Extra bytes to allocate for each string. */
1449 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1451 /* Exact bound on the number of bytes in a string, not counting the
1452 terminating null. A string cannot contain more bytes than
1453 STRING_BYTES_BOUND, nor can it be so long that the size_t
1454 arithmetic in allocate_string_data would overflow while it is
1455 calculating a value to be passed to malloc. */
1456 static ptrdiff_t const STRING_BYTES_MAX
=
1457 min (STRING_BYTES_BOUND
,
1458 ((SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
1460 - offsetof (struct sblock
, first_data
)
1461 - SDATA_DATA_OFFSET
)
1462 & ~(sizeof (EMACS_INT
) - 1)));
1464 /* Initialize string allocation. Called from init_alloc_once. */
1469 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1470 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1474 #ifdef GC_CHECK_STRING_BYTES
1476 static int check_string_bytes_count
;
1478 /* Like STRING_BYTES, but with debugging check. Can be
1479 called during GC, so pay attention to the mark bit. */
1482 string_bytes (struct Lisp_String
*s
)
1485 (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1487 if (!PURE_POINTER_P (s
)
1489 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1494 /* Check validity of Lisp strings' string_bytes member in B. */
1497 check_sblock (struct sblock
*b
)
1499 struct sdata
*from
, *end
, *from_end
;
1503 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1505 /* Compute the next FROM here because copying below may
1506 overwrite data we need to compute it. */
1509 /* Check that the string size recorded in the string is the
1510 same as the one recorded in the sdata structure. */
1511 nbytes
= SDATA_SIZE (from
->string
? string_bytes (from
->string
)
1512 : SDATA_NBYTES (from
));
1513 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1518 /* Check validity of Lisp strings' string_bytes member. ALL_P
1519 means check all strings, otherwise check only most
1520 recently allocated strings. Used for hunting a bug. */
1523 check_string_bytes (bool all_p
)
1529 for (b
= large_sblocks
; b
; b
= b
->next
)
1531 struct Lisp_String
*s
= b
->first_data
.string
;
1536 for (b
= oldest_sblock
; b
; b
= b
->next
)
1539 else if (current_sblock
)
1540 check_sblock (current_sblock
);
1543 #else /* not GC_CHECK_STRING_BYTES */
1545 #define check_string_bytes(all) ((void) 0)
1547 #endif /* GC_CHECK_STRING_BYTES */
1549 #ifdef GC_CHECK_STRING_FREE_LIST
1551 /* Walk through the string free list looking for bogus next pointers.
1552 This may catch buffer overrun from a previous string. */
1555 check_string_free_list (void)
1557 struct Lisp_String
*s
;
1559 /* Pop a Lisp_String off the free-list. */
1560 s
= string_free_list
;
1563 if ((uintptr_t) s
< 1024)
1565 s
= NEXT_FREE_LISP_STRING (s
);
1569 #define check_string_free_list()
1572 /* Return a new Lisp_String. */
1574 static struct Lisp_String
*
1575 allocate_string (void)
1577 struct Lisp_String
*s
;
1581 /* If the free-list is empty, allocate a new string_block, and
1582 add all the Lisp_Strings in it to the free-list. */
1583 if (string_free_list
== NULL
)
1585 struct string_block
*b
= lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1588 b
->next
= string_blocks
;
1591 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1594 /* Every string on a free list should have NULL data pointer. */
1596 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1597 string_free_list
= s
;
1600 total_free_strings
+= STRING_BLOCK_SIZE
;
1603 check_string_free_list ();
1605 /* Pop a Lisp_String off the free-list. */
1606 s
= string_free_list
;
1607 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1609 MALLOC_UNBLOCK_INPUT
;
1611 --total_free_strings
;
1614 consing_since_gc
+= sizeof *s
;
1616 #ifdef GC_CHECK_STRING_BYTES
1617 if (!noninteractive
)
1619 if (++check_string_bytes_count
== 200)
1621 check_string_bytes_count
= 0;
1622 check_string_bytes (1);
1625 check_string_bytes (0);
1627 #endif /* GC_CHECK_STRING_BYTES */
1633 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1634 plus a NUL byte at the end. Allocate an sdata structure for S, and
1635 set S->data to its `u.data' member. Store a NUL byte at the end of
1636 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1637 S->data if it was initially non-null. */
1640 allocate_string_data (struct Lisp_String
*s
,
1641 EMACS_INT nchars
, EMACS_INT nbytes
)
1643 struct sdata
*data
, *old_data
;
1645 ptrdiff_t needed
, old_nbytes
;
1647 if (STRING_BYTES_MAX
< nbytes
)
1650 /* Determine the number of bytes needed to store NBYTES bytes
1652 needed
= SDATA_SIZE (nbytes
);
1655 old_data
= SDATA_OF_STRING (s
);
1656 old_nbytes
= STRING_BYTES (s
);
1663 if (nbytes
> LARGE_STRING_BYTES
)
1665 size_t size
= offsetof (struct sblock
, first_data
) + needed
;
1667 #ifdef DOUG_LEA_MALLOC
1668 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1669 because mapped region contents are not preserved in
1672 In case you think of allowing it in a dumped Emacs at the
1673 cost of not being able to re-dump, there's another reason:
1674 mmap'ed data typically have an address towards the top of the
1675 address space, which won't fit into an EMACS_INT (at least on
1676 32-bit systems with the current tagging scheme). --fx */
1677 mallopt (M_MMAP_MAX
, 0);
1680 b
= lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1682 #ifdef DOUG_LEA_MALLOC
1683 /* Back to a reasonable maximum of mmap'ed areas. */
1684 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1687 b
->next_free
= &b
->first_data
;
1688 b
->first_data
.string
= NULL
;
1689 b
->next
= large_sblocks
;
1692 else if (current_sblock
== NULL
1693 || (((char *) current_sblock
+ SBLOCK_SIZE
1694 - (char *) current_sblock
->next_free
)
1695 < (needed
+ GC_STRING_EXTRA
)))
1697 /* Not enough room in the current sblock. */
1698 b
= lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1699 b
->next_free
= &b
->first_data
;
1700 b
->first_data
.string
= NULL
;
1704 current_sblock
->next
= b
;
1712 data
= b
->next_free
;
1713 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
1715 MALLOC_UNBLOCK_INPUT
;
1718 s
->data
= SDATA_DATA (data
);
1719 #ifdef GC_CHECK_STRING_BYTES
1720 SDATA_NBYTES (data
) = nbytes
;
1723 s
->size_byte
= nbytes
;
1724 s
->data
[nbytes
] = '\0';
1725 #ifdef GC_CHECK_STRING_OVERRUN
1726 memcpy ((char *) data
+ needed
, string_overrun_cookie
,
1727 GC_STRING_OVERRUN_COOKIE_SIZE
);
1730 /* Note that Faset may call to this function when S has already data
1731 assigned. In this case, mark data as free by setting it's string
1732 back-pointer to null, and record the size of the data in it. */
1735 SDATA_NBYTES (old_data
) = old_nbytes
;
1736 old_data
->string
= NULL
;
1739 consing_since_gc
+= needed
;
1743 /* Sweep and compact strings. */
1746 sweep_strings (void)
1748 struct string_block
*b
, *next
;
1749 struct string_block
*live_blocks
= NULL
;
1751 string_free_list
= NULL
;
1752 total_strings
= total_free_strings
= 0;
1753 total_string_bytes
= 0;
1755 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1756 for (b
= string_blocks
; b
; b
= next
)
1759 struct Lisp_String
*free_list_before
= string_free_list
;
1763 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1765 struct Lisp_String
*s
= b
->strings
+ i
;
1769 /* String was not on free-list before. */
1770 if (STRING_MARKED_P (s
))
1772 /* String is live; unmark it and its intervals. */
1775 /* Do not use string_(set|get)_intervals here. */
1776 s
->intervals
= balance_intervals (s
->intervals
);
1779 total_string_bytes
+= STRING_BYTES (s
);
1783 /* String is dead. Put it on the free-list. */
1784 struct sdata
*data
= SDATA_OF_STRING (s
);
1786 /* Save the size of S in its sdata so that we know
1787 how large that is. Reset the sdata's string
1788 back-pointer so that we know it's free. */
1789 #ifdef GC_CHECK_STRING_BYTES
1790 if (string_bytes (s
) != SDATA_NBYTES (data
))
1793 data
->u
.nbytes
= STRING_BYTES (s
);
1795 data
->string
= NULL
;
1797 /* Reset the strings's `data' member so that we
1801 /* Put the string on the free-list. */
1802 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1803 string_free_list
= s
;
1809 /* S was on the free-list before. Put it there again. */
1810 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1811 string_free_list
= s
;
1816 /* Free blocks that contain free Lisp_Strings only, except
1817 the first two of them. */
1818 if (nfree
== STRING_BLOCK_SIZE
1819 && total_free_strings
> STRING_BLOCK_SIZE
)
1822 string_free_list
= free_list_before
;
1826 total_free_strings
+= nfree
;
1827 b
->next
= live_blocks
;
1832 check_string_free_list ();
1834 string_blocks
= live_blocks
;
1835 free_large_strings ();
1836 compact_small_strings ();
1838 check_string_free_list ();
1842 /* Free dead large strings. */
1845 free_large_strings (void)
1847 struct sblock
*b
, *next
;
1848 struct sblock
*live_blocks
= NULL
;
1850 for (b
= large_sblocks
; b
; b
= next
)
1854 if (b
->first_data
.string
== NULL
)
1858 b
->next
= live_blocks
;
1863 large_sblocks
= live_blocks
;
1867 /* Compact data of small strings. Free sblocks that don't contain
1868 data of live strings after compaction. */
1871 compact_small_strings (void)
1873 struct sblock
*b
, *tb
, *next
;
1874 struct sdata
*from
, *to
, *end
, *tb_end
;
1875 struct sdata
*to_end
, *from_end
;
1877 /* TB is the sblock we copy to, TO is the sdata within TB we copy
1878 to, and TB_END is the end of TB. */
1880 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1881 to
= &tb
->first_data
;
1883 /* Step through the blocks from the oldest to the youngest. We
1884 expect that old blocks will stabilize over time, so that less
1885 copying will happen this way. */
1886 for (b
= oldest_sblock
; b
; b
= b
->next
)
1889 eassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
1891 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1893 /* Compute the next FROM here because copying below may
1894 overwrite data we need to compute it. */
1896 struct Lisp_String
*s
= from
->string
;
1898 #ifdef GC_CHECK_STRING_BYTES
1899 /* Check that the string size recorded in the string is the
1900 same as the one recorded in the sdata structure. */
1901 if (s
&& string_bytes (s
) != SDATA_NBYTES (from
))
1903 #endif /* GC_CHECK_STRING_BYTES */
1905 nbytes
= s
? STRING_BYTES (s
) : SDATA_NBYTES (from
);
1906 eassert (nbytes
<= LARGE_STRING_BYTES
);
1908 nbytes
= SDATA_SIZE (nbytes
);
1909 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1911 #ifdef GC_CHECK_STRING_OVERRUN
1912 if (memcmp (string_overrun_cookie
,
1913 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
1914 GC_STRING_OVERRUN_COOKIE_SIZE
))
1918 /* Non-NULL S means it's alive. Copy its data. */
1921 /* If TB is full, proceed with the next sblock. */
1922 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
1923 if (to_end
> tb_end
)
1927 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1928 to
= &tb
->first_data
;
1929 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
1932 /* Copy, and update the string's `data' pointer. */
1935 eassert (tb
!= b
|| to
< from
);
1936 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
1937 to
->string
->data
= SDATA_DATA (to
);
1940 /* Advance past the sdata we copied to. */
1946 /* The rest of the sblocks following TB don't contain live data, so
1947 we can free them. */
1948 for (b
= tb
->next
; b
; b
= next
)
1956 current_sblock
= tb
;
1960 string_overflow (void)
1962 error ("Maximum string size exceeded");
1965 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
1966 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
1967 LENGTH must be an integer.
1968 INIT must be an integer that represents a character. */)
1969 (Lisp_Object length
, Lisp_Object init
)
1971 register Lisp_Object val
;
1972 register unsigned char *p
, *end
;
1976 CHECK_NATNUM (length
);
1977 CHECK_CHARACTER (init
);
1979 c
= XFASTINT (init
);
1980 if (ASCII_CHAR_P (c
))
1982 nbytes
= XINT (length
);
1983 val
= make_uninit_string (nbytes
);
1985 end
= p
+ SCHARS (val
);
1991 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
1992 int len
= CHAR_STRING (c
, str
);
1993 EMACS_INT string_len
= XINT (length
);
1995 if (string_len
> STRING_BYTES_MAX
/ len
)
1997 nbytes
= len
* string_len
;
1998 val
= make_uninit_multibyte_string (string_len
, nbytes
);
2003 memcpy (p
, str
, len
);
2013 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2014 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2015 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2016 (Lisp_Object length
, Lisp_Object init
)
2018 register Lisp_Object val
;
2019 struct Lisp_Bool_Vector
*p
;
2020 ptrdiff_t length_in_chars
;
2021 EMACS_INT length_in_elts
;
2023 int extra_bool_elts
= ((bool_header_size
- header_size
+ word_size
- 1)
2026 CHECK_NATNUM (length
);
2028 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2030 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2032 val
= Fmake_vector (make_number (length_in_elts
+ extra_bool_elts
), Qnil
);
2034 /* No Lisp_Object to trace in there. */
2035 XSETPVECTYPESIZE (XVECTOR (val
), PVEC_BOOL_VECTOR
, 0, 0);
2037 p
= XBOOL_VECTOR (val
);
2038 p
->size
= XFASTINT (length
);
2040 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2041 / BOOL_VECTOR_BITS_PER_CHAR
);
2042 if (length_in_chars
)
2044 memset (p
->data
, ! NILP (init
) ? -1 : 0, length_in_chars
);
2046 /* Clear any extraneous bits in the last byte. */
2047 p
->data
[length_in_chars
- 1]
2048 &= (1 << ((XFASTINT (length
) - 1) % BOOL_VECTOR_BITS_PER_CHAR
+ 1)) - 1;
2055 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2056 of characters from the contents. This string may be unibyte or
2057 multibyte, depending on the contents. */
2060 make_string (const char *contents
, ptrdiff_t nbytes
)
2062 register Lisp_Object val
;
2063 ptrdiff_t nchars
, multibyte_nbytes
;
2065 parse_str_as_multibyte ((const unsigned char *) contents
, nbytes
,
2066 &nchars
, &multibyte_nbytes
);
2067 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2068 /* CONTENTS contains no multibyte sequences or contains an invalid
2069 multibyte sequence. We must make unibyte string. */
2070 val
= make_unibyte_string (contents
, nbytes
);
2072 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2077 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2080 make_unibyte_string (const char *contents
, ptrdiff_t length
)
2082 register Lisp_Object val
;
2083 val
= make_uninit_string (length
);
2084 memcpy (SDATA (val
), contents
, length
);
2089 /* Make a multibyte string from NCHARS characters occupying NBYTES
2090 bytes at CONTENTS. */
2093 make_multibyte_string (const char *contents
,
2094 ptrdiff_t nchars
, ptrdiff_t nbytes
)
2096 register Lisp_Object val
;
2097 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2098 memcpy (SDATA (val
), contents
, nbytes
);
2103 /* Make a string from NCHARS characters occupying NBYTES bytes at
2104 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2107 make_string_from_bytes (const char *contents
,
2108 ptrdiff_t nchars
, ptrdiff_t nbytes
)
2110 register Lisp_Object val
;
2111 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2112 memcpy (SDATA (val
), contents
, nbytes
);
2113 if (SBYTES (val
) == SCHARS (val
))
2114 STRING_SET_UNIBYTE (val
);
2119 /* Make a string from NCHARS characters occupying NBYTES bytes at
2120 CONTENTS. The argument MULTIBYTE controls whether to label the
2121 string as multibyte. If NCHARS is negative, it counts the number of
2122 characters by itself. */
2125 make_specified_string (const char *contents
,
2126 ptrdiff_t nchars
, ptrdiff_t nbytes
, bool multibyte
)
2133 nchars
= multibyte_chars_in_text ((const unsigned char *) contents
,
2138 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2139 memcpy (SDATA (val
), contents
, nbytes
);
2141 STRING_SET_UNIBYTE (val
);
2146 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2147 occupying LENGTH bytes. */
2150 make_uninit_string (EMACS_INT length
)
2155 return empty_unibyte_string
;
2156 val
= make_uninit_multibyte_string (length
, length
);
2157 STRING_SET_UNIBYTE (val
);
2162 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2163 which occupy NBYTES bytes. */
2166 make_uninit_multibyte_string (EMACS_INT nchars
, EMACS_INT nbytes
)
2169 struct Lisp_String
*s
;
2174 return empty_multibyte_string
;
2176 s
= allocate_string ();
2177 s
->intervals
= NULL
;
2178 allocate_string_data (s
, nchars
, nbytes
);
2179 XSETSTRING (string
, s
);
2180 string_chars_consed
+= nbytes
;
2184 /* Print arguments to BUF according to a FORMAT, then return
2185 a Lisp_String initialized with the data from BUF. */
2188 make_formatted_string (char *buf
, const char *format
, ...)
2193 va_start (ap
, format
);
2194 length
= vsprintf (buf
, format
, ap
);
2196 return make_string (buf
, length
);
2200 /***********************************************************************
2202 ***********************************************************************/
2204 /* We store float cells inside of float_blocks, allocating a new
2205 float_block with malloc whenever necessary. Float cells reclaimed
2206 by GC are put on a free list to be reallocated before allocating
2207 any new float cells from the latest float_block. */
2209 #define FLOAT_BLOCK_SIZE \
2210 (((BLOCK_BYTES - sizeof (struct float_block *) \
2211 /* The compiler might add padding at the end. */ \
2212 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2213 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2215 #define GETMARKBIT(block,n) \
2216 (((block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2217 >> ((n) % (sizeof (int) * CHAR_BIT))) \
2220 #define SETMARKBIT(block,n) \
2221 (block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2222 |= 1 << ((n) % (sizeof (int) * CHAR_BIT))
2224 #define UNSETMARKBIT(block,n) \
2225 (block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2226 &= ~(1 << ((n) % (sizeof (int) * CHAR_BIT)))
2228 #define FLOAT_BLOCK(fptr) \
2229 ((struct float_block *) (((uintptr_t) (fptr)) & ~(BLOCK_ALIGN - 1)))
2231 #define FLOAT_INDEX(fptr) \
2232 ((((uintptr_t) (fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2236 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2237 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2238 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof (int) * CHAR_BIT
)];
2239 struct float_block
*next
;
2242 #define FLOAT_MARKED_P(fptr) \
2243 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2245 #define FLOAT_MARK(fptr) \
2246 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2248 #define FLOAT_UNMARK(fptr) \
2249 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2251 /* Current float_block. */
2253 static struct float_block
*float_block
;
2255 /* Index of first unused Lisp_Float in the current float_block. */
2257 static int float_block_index
= FLOAT_BLOCK_SIZE
;
2259 /* Free-list of Lisp_Floats. */
2261 static struct Lisp_Float
*float_free_list
;
2263 /* Return a new float object with value FLOAT_VALUE. */
2266 make_float (double float_value
)
2268 register Lisp_Object val
;
2272 if (float_free_list
)
2274 /* We use the data field for chaining the free list
2275 so that we won't use the same field that has the mark bit. */
2276 XSETFLOAT (val
, float_free_list
);
2277 float_free_list
= float_free_list
->u
.chain
;
2281 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2283 struct float_block
*new
2284 = lisp_align_malloc (sizeof *new, MEM_TYPE_FLOAT
);
2285 new->next
= float_block
;
2286 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2288 float_block_index
= 0;
2289 total_free_floats
+= FLOAT_BLOCK_SIZE
;
2291 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2292 float_block_index
++;
2295 MALLOC_UNBLOCK_INPUT
;
2297 XFLOAT_INIT (val
, float_value
);
2298 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2299 consing_since_gc
+= sizeof (struct Lisp_Float
);
2301 total_free_floats
--;
2307 /***********************************************************************
2309 ***********************************************************************/
2311 /* We store cons cells inside of cons_blocks, allocating a new
2312 cons_block with malloc whenever necessary. Cons cells reclaimed by
2313 GC are put on a free list to be reallocated before allocating
2314 any new cons cells from the latest cons_block. */
2316 #define CONS_BLOCK_SIZE \
2317 (((BLOCK_BYTES - sizeof (struct cons_block *) \
2318 /* The compiler might add padding at the end. */ \
2319 - (sizeof (struct Lisp_Cons) - sizeof (int))) * CHAR_BIT) \
2320 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2322 #define CONS_BLOCK(fptr) \
2323 ((struct cons_block *) ((uintptr_t) (fptr) & ~(BLOCK_ALIGN - 1)))
2325 #define CONS_INDEX(fptr) \
2326 (((uintptr_t) (fptr) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2330 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2331 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2332 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof (int) * CHAR_BIT
)];
2333 struct cons_block
*next
;
2336 #define CONS_MARKED_P(fptr) \
2337 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2339 #define CONS_MARK(fptr) \
2340 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2342 #define CONS_UNMARK(fptr) \
2343 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2345 /* Current cons_block. */
2347 static struct cons_block
*cons_block
;
2349 /* Index of first unused Lisp_Cons in the current block. */
2351 static int cons_block_index
= CONS_BLOCK_SIZE
;
2353 /* Free-list of Lisp_Cons structures. */
2355 static struct Lisp_Cons
*cons_free_list
;
2357 /* Explicitly free a cons cell by putting it on the free-list. */
2360 free_cons (struct Lisp_Cons
*ptr
)
2362 ptr
->u
.chain
= cons_free_list
;
2366 cons_free_list
= ptr
;
2367 consing_since_gc
-= sizeof *ptr
;
2368 total_free_conses
++;
2371 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2372 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2373 (Lisp_Object car
, Lisp_Object cdr
)
2375 register Lisp_Object val
;
2381 /* We use the cdr for chaining the free list
2382 so that we won't use the same field that has the mark bit. */
2383 XSETCONS (val
, cons_free_list
);
2384 cons_free_list
= cons_free_list
->u
.chain
;
2388 if (cons_block_index
== CONS_BLOCK_SIZE
)
2390 struct cons_block
*new
2391 = lisp_align_malloc (sizeof *new, MEM_TYPE_CONS
);
2392 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2393 new->next
= cons_block
;
2395 cons_block_index
= 0;
2396 total_free_conses
+= CONS_BLOCK_SIZE
;
2398 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2402 MALLOC_UNBLOCK_INPUT
;
2406 eassert (!CONS_MARKED_P (XCONS (val
)));
2407 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2408 total_free_conses
--;
2409 cons_cells_consed
++;
2413 #ifdef GC_CHECK_CONS_LIST
2414 /* Get an error now if there's any junk in the cons free list. */
2416 check_cons_list (void)
2418 struct Lisp_Cons
*tail
= cons_free_list
;
2421 tail
= tail
->u
.chain
;
2425 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2428 list1 (Lisp_Object arg1
)
2430 return Fcons (arg1
, Qnil
);
2434 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2436 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2441 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2443 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2448 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2450 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2455 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2457 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2458 Fcons (arg5
, Qnil
)))));
2461 /* Make a list of COUNT Lisp_Objects, where ARG is the
2462 first one. Allocate conses from pure space if TYPE
2463 is CONSTYPE_PURE, or allocate as usual if type is CONSTYPE_HEAP. */
2466 listn (enum constype type
, ptrdiff_t count
, Lisp_Object arg
, ...)
2470 Lisp_Object val
, *objp
;
2472 /* Change to SAFE_ALLOCA if you hit this eassert. */
2473 eassert (count
<= MAX_ALLOCA
/ word_size
);
2475 objp
= alloca (count
* word_size
);
2478 for (i
= 1; i
< count
; i
++)
2479 objp
[i
] = va_arg (ap
, Lisp_Object
);
2482 for (val
= Qnil
, i
= count
- 1; i
>= 0; i
--)
2484 if (type
== CONSTYPE_PURE
)
2485 val
= pure_cons (objp
[i
], val
);
2486 else if (type
== CONSTYPE_HEAP
)
2487 val
= Fcons (objp
[i
], val
);
2494 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2495 doc
: /* Return a newly created list with specified arguments as elements.
2496 Any number of arguments, even zero arguments, are allowed.
2497 usage: (list &rest OBJECTS) */)
2498 (ptrdiff_t nargs
, Lisp_Object
*args
)
2500 register Lisp_Object val
;
2506 val
= Fcons (args
[nargs
], val
);
2512 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2513 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2514 (register Lisp_Object length
, Lisp_Object init
)
2516 register Lisp_Object val
;
2517 register EMACS_INT size
;
2519 CHECK_NATNUM (length
);
2520 size
= XFASTINT (length
);
2525 val
= Fcons (init
, val
);
2530 val
= Fcons (init
, val
);
2535 val
= Fcons (init
, val
);
2540 val
= Fcons (init
, val
);
2545 val
= Fcons (init
, val
);
2560 /***********************************************************************
2562 ***********************************************************************/
2564 /* This value is balanced well enough to avoid too much internal overhead
2565 for the most common cases; it's not required to be a power of two, but
2566 it's expected to be a mult-of-ROUNDUP_SIZE (see below). */
2568 #define VECTOR_BLOCK_SIZE 4096
2570 /* Align allocation request sizes to be a multiple of ROUNDUP_SIZE. */
2573 roundup_size
= COMMON_MULTIPLE (word_size
, USE_LSB_TAG
? GCALIGNMENT
: 1)
2576 /* ROUNDUP_SIZE must be a power of 2. */
2577 verify ((roundup_size
& (roundup_size
- 1)) == 0);
2579 /* Verify assumptions described above. */
2580 verify ((VECTOR_BLOCK_SIZE
% roundup_size
) == 0);
2581 verify (VECTOR_BLOCK_SIZE
<= (1 << PSEUDOVECTOR_SIZE_BITS
));
2583 /* Round up X to nearest mult-of-ROUNDUP_SIZE. */
2585 #define vroundup(x) (((x) + (roundup_size - 1)) & ~(roundup_size - 1))
2587 /* Rounding helps to maintain alignment constraints if USE_LSB_TAG. */
2589 #define VECTOR_BLOCK_BYTES (VECTOR_BLOCK_SIZE - vroundup (sizeof (void *)))
2591 /* Size of the minimal vector allocated from block. */
2593 #define VBLOCK_BYTES_MIN vroundup (sizeof (struct Lisp_Vector))
2595 /* Size of the largest vector allocated from block. */
2597 #define VBLOCK_BYTES_MAX \
2598 vroundup ((VECTOR_BLOCK_BYTES / 2) - word_size)
2600 /* We maintain one free list for each possible block-allocated
2601 vector size, and this is the number of free lists we have. */
2603 #define VECTOR_MAX_FREE_LIST_INDEX \
2604 ((VECTOR_BLOCK_BYTES - VBLOCK_BYTES_MIN) / roundup_size + 1)
2606 /* Common shortcut to advance vector pointer over a block data. */
2608 #define ADVANCE(v, nbytes) ((struct Lisp_Vector *) ((char *) (v) + (nbytes)))
2610 /* Common shortcut to calculate NBYTES-vector index in VECTOR_FREE_LISTS. */
2612 #define VINDEX(nbytes) (((nbytes) - VBLOCK_BYTES_MIN) / roundup_size)
2614 /* This special type is used to represent any block-allocated vectorlike
2615 object on the free list. */
2617 struct Lisp_Vectorlike_Free
2619 struct vectorlike_header header
;
2620 struct Lisp_Vector
*next
;
2623 /* When V is on the free list, it's always treated as Lisp_Vectorlike_Free. */
2625 #define NEXT_IN_FREE_LIST(v) ((struct Lisp_Vectorlike_Free *) v)->next
2627 /* Common shortcut to setup vector on a free list. */
2629 #define SETUP_ON_FREE_LIST(v, nbytes, tmp) \
2631 (tmp) = ((nbytes - header_size) / word_size); \
2632 XSETPVECTYPESIZE (v, PVEC_FREE, 0, (tmp)); \
2633 eassert ((nbytes) % roundup_size == 0); \
2634 (tmp) = VINDEX (nbytes); \
2635 eassert ((tmp) < VECTOR_MAX_FREE_LIST_INDEX); \
2636 NEXT_IN_FREE_LIST (v) = vector_free_lists[tmp]; \
2637 vector_free_lists[tmp] = (v); \
2638 total_free_vector_slots += (nbytes) / word_size; \
2641 /* This internal type is used to maintain the list of large vectors
2642 which are allocated at their own, e.g. outside of vector blocks. */
2647 struct large_vector
*vector
;
2649 /* We need to maintain ROUNDUP_SIZE alignment for the vector member. */
2650 unsigned char c
[vroundup (sizeof (struct large_vector
*))];
2653 struct Lisp_Vector v
;
2656 /* This internal type is used to maintain an underlying storage
2657 for small vectors. */
2661 char data
[VECTOR_BLOCK_BYTES
];
2662 struct vector_block
*next
;
2665 /* Chain of vector blocks. */
2667 static struct vector_block
*vector_blocks
;
2669 /* Vector free lists, where NTH item points to a chain of free
2670 vectors of the same NBYTES size, so NTH == VINDEX (NBYTES). */
2672 static struct Lisp_Vector
*vector_free_lists
[VECTOR_MAX_FREE_LIST_INDEX
];
2674 /* Singly-linked list of large vectors. */
2676 static struct large_vector
*large_vectors
;
2678 /* The only vector with 0 slots, allocated from pure space. */
2680 Lisp_Object zero_vector
;
2682 /* Number of live vectors. */
2684 static EMACS_INT total_vectors
;
2686 /* Total size of live and free vectors, in Lisp_Object units. */
2688 static EMACS_INT total_vector_slots
, total_free_vector_slots
;
2690 /* Get a new vector block. */
2692 static struct vector_block
*
2693 allocate_vector_block (void)
2695 struct vector_block
*block
= xmalloc (sizeof *block
);
2697 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
2698 mem_insert (block
->data
, block
->data
+ VECTOR_BLOCK_BYTES
,
2699 MEM_TYPE_VECTOR_BLOCK
);
2702 block
->next
= vector_blocks
;
2703 vector_blocks
= block
;
2707 /* Called once to initialize vector allocation. */
2712 zero_vector
= make_pure_vector (0);
2715 /* Allocate vector from a vector block. */
2717 static struct Lisp_Vector
*
2718 allocate_vector_from_block (size_t nbytes
)
2720 struct Lisp_Vector
*vector
;
2721 struct vector_block
*block
;
2722 size_t index
, restbytes
;
2724 eassert (VBLOCK_BYTES_MIN
<= nbytes
&& nbytes
<= VBLOCK_BYTES_MAX
);
2725 eassert (nbytes
% roundup_size
== 0);
2727 /* First, try to allocate from a free list
2728 containing vectors of the requested size. */
2729 index
= VINDEX (nbytes
);
2730 if (vector_free_lists
[index
])
2732 vector
= vector_free_lists
[index
];
2733 vector_free_lists
[index
] = NEXT_IN_FREE_LIST (vector
);
2734 total_free_vector_slots
-= nbytes
/ word_size
;
2738 /* Next, check free lists containing larger vectors. Since
2739 we will split the result, we should have remaining space
2740 large enough to use for one-slot vector at least. */
2741 for (index
= VINDEX (nbytes
+ VBLOCK_BYTES_MIN
);
2742 index
< VECTOR_MAX_FREE_LIST_INDEX
; index
++)
2743 if (vector_free_lists
[index
])
2745 /* This vector is larger than requested. */
2746 vector
= vector_free_lists
[index
];
2747 vector_free_lists
[index
] = NEXT_IN_FREE_LIST (vector
);
2748 total_free_vector_slots
-= nbytes
/ word_size
;
2750 /* Excess bytes are used for the smaller vector,
2751 which should be set on an appropriate free list. */
2752 restbytes
= index
* roundup_size
+ VBLOCK_BYTES_MIN
- nbytes
;
2753 eassert (restbytes
% roundup_size
== 0);
2754 SETUP_ON_FREE_LIST (ADVANCE (vector
, nbytes
), restbytes
, index
);
2758 /* Finally, need a new vector block. */
2759 block
= allocate_vector_block ();
2761 /* New vector will be at the beginning of this block. */
2762 vector
= (struct Lisp_Vector
*) block
->data
;
2764 /* If the rest of space from this block is large enough
2765 for one-slot vector at least, set up it on a free list. */
2766 restbytes
= VECTOR_BLOCK_BYTES
- nbytes
;
2767 if (restbytes
>= VBLOCK_BYTES_MIN
)
2769 eassert (restbytes
% roundup_size
== 0);
2770 SETUP_ON_FREE_LIST (ADVANCE (vector
, nbytes
), restbytes
, index
);
2775 /* Nonzero if VECTOR pointer is valid pointer inside BLOCK. */
2777 #define VECTOR_IN_BLOCK(vector, block) \
2778 ((char *) (vector) <= (block)->data \
2779 + VECTOR_BLOCK_BYTES - VBLOCK_BYTES_MIN)
2781 /* Return the memory footprint of V in bytes. */
2784 vector_nbytes (struct Lisp_Vector
*v
)
2786 ptrdiff_t size
= v
->header
.size
& ~ARRAY_MARK_FLAG
;
2788 if (size
& PSEUDOVECTOR_FLAG
)
2790 if (PSEUDOVECTOR_TYPEP (&v
->header
, PVEC_BOOL_VECTOR
))
2791 size
= (bool_header_size
2792 + (((struct Lisp_Bool_Vector
*) v
)->size
2793 + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2794 / BOOL_VECTOR_BITS_PER_CHAR
);
2797 + ((size
& PSEUDOVECTOR_SIZE_MASK
)
2798 + ((size
& PSEUDOVECTOR_REST_MASK
)
2799 >> PSEUDOVECTOR_SIZE_BITS
)) * word_size
);
2802 size
= header_size
+ size
* word_size
;
2803 return vroundup (size
);
2806 /* Reclaim space used by unmarked vectors. */
2809 sweep_vectors (void)
2811 struct vector_block
*block
= vector_blocks
, **bprev
= &vector_blocks
;
2812 struct large_vector
*lv
, **lvprev
= &large_vectors
;
2813 struct Lisp_Vector
*vector
, *next
;
2815 total_vectors
= total_vector_slots
= total_free_vector_slots
= 0;
2816 memset (vector_free_lists
, 0, sizeof (vector_free_lists
));
2818 /* Looking through vector blocks. */
2820 for (block
= vector_blocks
; block
; block
= *bprev
)
2822 bool free_this_block
= 0;
2825 for (vector
= (struct Lisp_Vector
*) block
->data
;
2826 VECTOR_IN_BLOCK (vector
, block
); vector
= next
)
2828 if (VECTOR_MARKED_P (vector
))
2830 VECTOR_UNMARK (vector
);
2832 nbytes
= vector_nbytes (vector
);
2833 total_vector_slots
+= nbytes
/ word_size
;
2834 next
= ADVANCE (vector
, nbytes
);
2838 ptrdiff_t total_bytes
;
2840 nbytes
= vector_nbytes (vector
);
2841 total_bytes
= nbytes
;
2842 next
= ADVANCE (vector
, nbytes
);
2844 /* While NEXT is not marked, try to coalesce with VECTOR,
2845 thus making VECTOR of the largest possible size. */
2847 while (VECTOR_IN_BLOCK (next
, block
))
2849 if (VECTOR_MARKED_P (next
))
2851 nbytes
= vector_nbytes (next
);
2852 total_bytes
+= nbytes
;
2853 next
= ADVANCE (next
, nbytes
);
2856 eassert (total_bytes
% roundup_size
== 0);
2858 if (vector
== (struct Lisp_Vector
*) block
->data
2859 && !VECTOR_IN_BLOCK (next
, block
))
2860 /* This block should be freed because all of it's
2861 space was coalesced into the only free vector. */
2862 free_this_block
= 1;
2866 SETUP_ON_FREE_LIST (vector
, total_bytes
, tmp
);
2871 if (free_this_block
)
2873 *bprev
= block
->next
;
2874 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
2875 mem_delete (mem_find (block
->data
));
2880 bprev
= &block
->next
;
2883 /* Sweep large vectors. */
2885 for (lv
= large_vectors
; lv
; lv
= *lvprev
)
2888 if (VECTOR_MARKED_P (vector
))
2890 VECTOR_UNMARK (vector
);
2892 if (vector
->header
.size
& PSEUDOVECTOR_FLAG
)
2894 struct Lisp_Bool_Vector
*b
= (struct Lisp_Bool_Vector
*) vector
;
2896 /* All non-bool pseudovectors are small enough to be allocated
2897 from vector blocks. This code should be redesigned if some
2898 pseudovector type grows beyond VBLOCK_BYTES_MAX. */
2899 eassert (PSEUDOVECTOR_TYPEP (&vector
->header
, PVEC_BOOL_VECTOR
));
2902 += (bool_header_size
2903 + ((b
->size
+ BOOL_VECTOR_BITS_PER_CHAR
- 1)
2904 / BOOL_VECTOR_BITS_PER_CHAR
)) / word_size
;
2908 += header_size
/ word_size
+ vector
->header
.size
;
2909 lvprev
= &lv
->next
.vector
;
2913 *lvprev
= lv
->next
.vector
;
2919 /* Value is a pointer to a newly allocated Lisp_Vector structure
2920 with room for LEN Lisp_Objects. */
2922 static struct Lisp_Vector
*
2923 allocate_vectorlike (ptrdiff_t len
)
2925 struct Lisp_Vector
*p
;
2930 p
= XVECTOR (zero_vector
);
2933 size_t nbytes
= header_size
+ len
* word_size
;
2935 #ifdef DOUG_LEA_MALLOC
2936 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2937 because mapped region contents are not preserved in
2939 mallopt (M_MMAP_MAX
, 0);
2942 if (nbytes
<= VBLOCK_BYTES_MAX
)
2943 p
= allocate_vector_from_block (vroundup (nbytes
));
2946 struct large_vector
*lv
2947 = lisp_malloc (sizeof (*lv
) + (len
- 1) * word_size
,
2948 MEM_TYPE_VECTORLIKE
);
2949 lv
->next
.vector
= large_vectors
;
2954 #ifdef DOUG_LEA_MALLOC
2955 /* Back to a reasonable maximum of mmap'ed areas. */
2956 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2959 consing_since_gc
+= nbytes
;
2960 vector_cells_consed
+= len
;
2963 MALLOC_UNBLOCK_INPUT
;
2969 /* Allocate a vector with LEN slots. */
2971 struct Lisp_Vector
*
2972 allocate_vector (EMACS_INT len
)
2974 struct Lisp_Vector
*v
;
2975 ptrdiff_t nbytes_max
= min (PTRDIFF_MAX
, SIZE_MAX
);
2977 if (min ((nbytes_max
- header_size
) / word_size
, MOST_POSITIVE_FIXNUM
) < len
)
2978 memory_full (SIZE_MAX
);
2979 v
= allocate_vectorlike (len
);
2980 v
->header
.size
= len
;
2985 /* Allocate other vector-like structures. */
2987 struct Lisp_Vector
*
2988 allocate_pseudovector (int memlen
, int lisplen
, enum pvec_type tag
)
2990 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2993 /* Catch bogus values. */
2994 eassert (tag
<= PVEC_FONT
);
2995 eassert (memlen
- lisplen
<= (1 << PSEUDOVECTOR_REST_BITS
) - 1);
2996 eassert (lisplen
<= (1 << PSEUDOVECTOR_SIZE_BITS
) - 1);
2998 /* Only the first lisplen slots will be traced normally by the GC. */
2999 for (i
= 0; i
< lisplen
; ++i
)
3000 v
->contents
[i
] = Qnil
;
3002 XSETPVECTYPESIZE (v
, tag
, lisplen
, memlen
- lisplen
);
3007 allocate_buffer (void)
3009 struct buffer
*b
= lisp_malloc (sizeof *b
, MEM_TYPE_BUFFER
);
3011 BUFFER_PVEC_INIT (b
);
3012 /* Put B on the chain of all buffers including killed ones. */
3013 b
->next
= all_buffers
;
3015 /* Note that the rest fields of B are not initialized. */
3019 struct Lisp_Hash_Table
*
3020 allocate_hash_table (void)
3022 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
3026 allocate_window (void)
3030 w
= ALLOCATE_PSEUDOVECTOR (struct window
, current_matrix
, PVEC_WINDOW
);
3031 /* Users assumes that non-Lisp data is zeroed. */
3032 memset (&w
->current_matrix
, 0,
3033 sizeof (*w
) - offsetof (struct window
, current_matrix
));
3038 allocate_terminal (void)
3042 t
= ALLOCATE_PSEUDOVECTOR (struct terminal
, next_terminal
, PVEC_TERMINAL
);
3043 /* Users assumes that non-Lisp data is zeroed. */
3044 memset (&t
->next_terminal
, 0,
3045 sizeof (*t
) - offsetof (struct terminal
, next_terminal
));
3050 allocate_frame (void)
3054 f
= ALLOCATE_PSEUDOVECTOR (struct frame
, face_cache
, PVEC_FRAME
);
3055 /* Users assumes that non-Lisp data is zeroed. */
3056 memset (&f
->face_cache
, 0,
3057 sizeof (*f
) - offsetof (struct frame
, face_cache
));
3061 struct Lisp_Process
*
3062 allocate_process (void)
3064 struct Lisp_Process
*p
;
3066 p
= ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
3067 /* Users assumes that non-Lisp data is zeroed. */
3069 sizeof (*p
) - offsetof (struct Lisp_Process
, pid
));
3073 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3074 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3075 See also the function `vector'. */)
3076 (register Lisp_Object length
, Lisp_Object init
)
3079 register ptrdiff_t sizei
;
3080 register ptrdiff_t i
;
3081 register struct Lisp_Vector
*p
;
3083 CHECK_NATNUM (length
);
3085 p
= allocate_vector (XFASTINT (length
));
3086 sizei
= XFASTINT (length
);
3087 for (i
= 0; i
< sizei
; i
++)
3088 p
->contents
[i
] = init
;
3090 XSETVECTOR (vector
, p
);
3095 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3096 doc
: /* Return a newly created vector with specified arguments as elements.
3097 Any number of arguments, even zero arguments, are allowed.
3098 usage: (vector &rest OBJECTS) */)
3099 (ptrdiff_t nargs
, Lisp_Object
*args
)
3101 register Lisp_Object len
, val
;
3103 register struct Lisp_Vector
*p
;
3105 XSETFASTINT (len
, nargs
);
3106 val
= Fmake_vector (len
, Qnil
);
3108 for (i
= 0; i
< nargs
; i
++)
3109 p
->contents
[i
] = args
[i
];
3114 make_byte_code (struct Lisp_Vector
*v
)
3116 if (v
->header
.size
> 1 && STRINGP (v
->contents
[1])
3117 && STRING_MULTIBYTE (v
->contents
[1]))
3118 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3119 earlier because they produced a raw 8-bit string for byte-code
3120 and now such a byte-code string is loaded as multibyte while
3121 raw 8-bit characters converted to multibyte form. Thus, now we
3122 must convert them back to the original unibyte form. */
3123 v
->contents
[1] = Fstring_as_unibyte (v
->contents
[1]);
3124 XSETPVECTYPE (v
, PVEC_COMPILED
);
3127 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3128 doc
: /* Create a byte-code object with specified arguments as elements.
3129 The arguments should be the ARGLIST, bytecode-string BYTE-CODE, constant
3130 vector CONSTANTS, maximum stack size DEPTH, (optional) DOCSTRING,
3131 and (optional) INTERACTIVE-SPEC.
3132 The first four arguments are required; at most six have any
3134 The ARGLIST can be either like the one of `lambda', in which case the arguments
3135 will be dynamically bound before executing the byte code, or it can be an
3136 integer of the form NNNNNNNRMMMMMMM where the 7bit MMMMMMM specifies the
3137 minimum number of arguments, the 7-bit NNNNNNN specifies the maximum number
3138 of arguments (ignoring &rest) and the R bit specifies whether there is a &rest
3139 argument to catch the left-over arguments. If such an integer is used, the
3140 arguments will not be dynamically bound but will be instead pushed on the
3141 stack before executing the byte-code.
3142 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3143 (ptrdiff_t nargs
, Lisp_Object
*args
)
3145 register Lisp_Object len
, val
;
3147 register struct Lisp_Vector
*p
;
3149 /* We used to purecopy everything here, if purify-flag was set. This worked
3150 OK for Emacs-23, but with Emacs-24's lexical binding code, it can be
3151 dangerous, since make-byte-code is used during execution to build
3152 closures, so any closure built during the preload phase would end up
3153 copied into pure space, including its free variables, which is sometimes
3154 just wasteful and other times plainly wrong (e.g. those free vars may want
3157 XSETFASTINT (len
, nargs
);
3158 val
= Fmake_vector (len
, Qnil
);
3161 for (i
= 0; i
< nargs
; i
++)
3162 p
->contents
[i
] = args
[i
];
3164 XSETCOMPILED (val
, p
);
3170 /***********************************************************************
3172 ***********************************************************************/
3174 /* Like struct Lisp_Symbol, but padded so that the size is a multiple
3175 of the required alignment if LSB tags are used. */
3177 union aligned_Lisp_Symbol
3179 struct Lisp_Symbol s
;
3181 unsigned char c
[(sizeof (struct Lisp_Symbol
) + GCALIGNMENT
- 1)
3186 /* Each symbol_block is just under 1020 bytes long, since malloc
3187 really allocates in units of powers of two and uses 4 bytes for its
3190 #define SYMBOL_BLOCK_SIZE \
3191 ((1020 - sizeof (struct symbol_block *)) / sizeof (union aligned_Lisp_Symbol))
3195 /* Place `symbols' first, to preserve alignment. */
3196 union aligned_Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3197 struct symbol_block
*next
;
3200 /* Current symbol block and index of first unused Lisp_Symbol
3203 static struct symbol_block
*symbol_block
;
3204 static int symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3206 /* List of free symbols. */
3208 static struct Lisp_Symbol
*symbol_free_list
;
3210 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3211 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3212 Its value and function definition are void, and its property list is nil. */)
3215 register Lisp_Object val
;
3216 register struct Lisp_Symbol
*p
;
3218 CHECK_STRING (name
);
3222 if (symbol_free_list
)
3224 XSETSYMBOL (val
, symbol_free_list
);
3225 symbol_free_list
= symbol_free_list
->next
;
3229 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3231 struct symbol_block
*new
3232 = lisp_malloc (sizeof *new, MEM_TYPE_SYMBOL
);
3233 new->next
= symbol_block
;
3235 symbol_block_index
= 0;
3236 total_free_symbols
+= SYMBOL_BLOCK_SIZE
;
3238 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
].s
);
3239 symbol_block_index
++;
3242 MALLOC_UNBLOCK_INPUT
;
3245 set_symbol_name (val
, name
);
3246 set_symbol_plist (val
, Qnil
);
3247 p
->redirect
= SYMBOL_PLAINVAL
;
3248 SET_SYMBOL_VAL (p
, Qunbound
);
3249 set_symbol_function (val
, Qunbound
);
3250 set_symbol_next (val
, NULL
);
3252 p
->interned
= SYMBOL_UNINTERNED
;
3254 p
->declared_special
= 0;
3255 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3257 total_free_symbols
--;
3263 /***********************************************************************
3264 Marker (Misc) Allocation
3265 ***********************************************************************/
3267 /* Like union Lisp_Misc, but padded so that its size is a multiple of
3268 the required alignment when LSB tags are used. */
3270 union aligned_Lisp_Misc
3274 unsigned char c
[(sizeof (union Lisp_Misc
) + GCALIGNMENT
- 1)
3279 /* Allocation of markers and other objects that share that structure.
3280 Works like allocation of conses. */
3282 #define MARKER_BLOCK_SIZE \
3283 ((1020 - sizeof (struct marker_block *)) / sizeof (union aligned_Lisp_Misc))
3287 /* Place `markers' first, to preserve alignment. */
3288 union aligned_Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3289 struct marker_block
*next
;
3292 static struct marker_block
*marker_block
;
3293 static int marker_block_index
= MARKER_BLOCK_SIZE
;
3295 static union Lisp_Misc
*marker_free_list
;
3297 /* Return a newly allocated Lisp_Misc object of specified TYPE. */
3300 allocate_misc (enum Lisp_Misc_Type type
)
3306 if (marker_free_list
)
3308 XSETMISC (val
, marker_free_list
);
3309 marker_free_list
= marker_free_list
->u_free
.chain
;
3313 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3315 struct marker_block
*new = lisp_malloc (sizeof *new, MEM_TYPE_MISC
);
3316 new->next
= marker_block
;
3318 marker_block_index
= 0;
3319 total_free_markers
+= MARKER_BLOCK_SIZE
;
3321 XSETMISC (val
, &marker_block
->markers
[marker_block_index
].m
);
3322 marker_block_index
++;
3325 MALLOC_UNBLOCK_INPUT
;
3327 --total_free_markers
;
3328 consing_since_gc
+= sizeof (union Lisp_Misc
);
3329 misc_objects_consed
++;
3330 XMISCTYPE (val
) = type
;
3331 XMISCANY (val
)->gcmarkbit
= 0;
3335 /* Free a Lisp_Misc object */
3338 free_misc (Lisp_Object misc
)
3340 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3341 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3342 marker_free_list
= XMISC (misc
);
3343 consing_since_gc
-= sizeof (union Lisp_Misc
);
3344 total_free_markers
++;
3347 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3348 INTEGER. This is used to package C values to call record_unwind_protect.
3349 The unwind function can get the C values back using XSAVE_VALUE. */
3352 make_save_value (void *pointer
, ptrdiff_t integer
)
3354 register Lisp_Object val
;
3355 register struct Lisp_Save_Value
*p
;
3357 val
= allocate_misc (Lisp_Misc_Save_Value
);
3358 p
= XSAVE_VALUE (val
);
3359 p
->pointer
= pointer
;
3360 p
->integer
= integer
;
3365 /* Return a Lisp_Misc_Overlay object with specified START, END and PLIST. */
3368 build_overlay (Lisp_Object start
, Lisp_Object end
, Lisp_Object plist
)
3370 register Lisp_Object overlay
;
3372 overlay
= allocate_misc (Lisp_Misc_Overlay
);
3373 OVERLAY_START (overlay
) = start
;
3374 OVERLAY_END (overlay
) = end
;
3375 set_overlay_plist (overlay
, plist
);
3376 XOVERLAY (overlay
)->next
= NULL
;
3380 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3381 doc
: /* Return a newly allocated marker which does not point at any place. */)
3384 register Lisp_Object val
;
3385 register struct Lisp_Marker
*p
;
3387 val
= allocate_misc (Lisp_Misc_Marker
);
3393 p
->insertion_type
= 0;
3397 /* Return a newly allocated marker which points into BUF
3398 at character position CHARPOS and byte position BYTEPOS. */
3401 build_marker (struct buffer
*buf
, ptrdiff_t charpos
, ptrdiff_t bytepos
)
3404 struct Lisp_Marker
*m
;
3406 /* No dead buffers here. */
3407 eassert (BUFFER_LIVE_P (buf
));
3409 /* Every character is at least one byte. */
3410 eassert (charpos
<= bytepos
);
3412 obj
= allocate_misc (Lisp_Misc_Marker
);
3415 m
->charpos
= charpos
;
3416 m
->bytepos
= bytepos
;
3417 m
->insertion_type
= 0;
3418 m
->next
= BUF_MARKERS (buf
);
3419 BUF_MARKERS (buf
) = m
;
3423 /* Put MARKER back on the free list after using it temporarily. */
3426 free_marker (Lisp_Object marker
)
3428 unchain_marker (XMARKER (marker
));
3433 /* Return a newly created vector or string with specified arguments as
3434 elements. If all the arguments are characters that can fit
3435 in a string of events, make a string; otherwise, make a vector.
3437 Any number of arguments, even zero arguments, are allowed. */
3440 make_event_array (register int nargs
, Lisp_Object
*args
)
3444 for (i
= 0; i
< nargs
; i
++)
3445 /* The things that fit in a string
3446 are characters that are in 0...127,
3447 after discarding the meta bit and all the bits above it. */
3448 if (!INTEGERP (args
[i
])
3449 || (XINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3450 return Fvector (nargs
, args
);
3452 /* Since the loop exited, we know that all the things in it are
3453 characters, so we can make a string. */
3457 result
= Fmake_string (make_number (nargs
), make_number (0));
3458 for (i
= 0; i
< nargs
; i
++)
3460 SSET (result
, i
, XINT (args
[i
]));
3461 /* Move the meta bit to the right place for a string char. */
3462 if (XINT (args
[i
]) & CHAR_META
)
3463 SSET (result
, i
, SREF (result
, i
) | 0x80);
3472 /************************************************************************
3473 Memory Full Handling
3474 ************************************************************************/
3477 /* Called if malloc (NBYTES) returns zero. If NBYTES == SIZE_MAX,
3478 there may have been size_t overflow so that malloc was never
3479 called, or perhaps malloc was invoked successfully but the
3480 resulting pointer had problems fitting into a tagged EMACS_INT. In
3481 either case this counts as memory being full even though malloc did
3485 memory_full (size_t nbytes
)
3487 /* Do not go into hysterics merely because a large request failed. */
3488 bool enough_free_memory
= 0;
3489 if (SPARE_MEMORY
< nbytes
)
3494 p
= malloc (SPARE_MEMORY
);
3498 enough_free_memory
= 1;
3500 MALLOC_UNBLOCK_INPUT
;
3503 if (! enough_free_memory
)
3509 memory_full_cons_threshold
= sizeof (struct cons_block
);
3511 /* The first time we get here, free the spare memory. */
3512 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3513 if (spare_memory
[i
])
3516 free (spare_memory
[i
]);
3517 else if (i
>= 1 && i
<= 4)
3518 lisp_align_free (spare_memory
[i
]);
3520 lisp_free (spare_memory
[i
]);
3521 spare_memory
[i
] = 0;
3525 /* This used to call error, but if we've run out of memory, we could
3526 get infinite recursion trying to build the string. */
3527 xsignal (Qnil
, Vmemory_signal_data
);
3530 /* If we released our reserve (due to running out of memory),
3531 and we have a fair amount free once again,
3532 try to set aside another reserve in case we run out once more.
3534 This is called when a relocatable block is freed in ralloc.c,
3535 and also directly from this file, in case we're not using ralloc.c. */
3538 refill_memory_reserve (void)
3540 #ifndef SYSTEM_MALLOC
3541 if (spare_memory
[0] == 0)
3542 spare_memory
[0] = malloc (SPARE_MEMORY
);
3543 if (spare_memory
[1] == 0)
3544 spare_memory
[1] = lisp_align_malloc (sizeof (struct cons_block
),
3546 if (spare_memory
[2] == 0)
3547 spare_memory
[2] = lisp_align_malloc (sizeof (struct cons_block
),
3549 if (spare_memory
[3] == 0)
3550 spare_memory
[3] = lisp_align_malloc (sizeof (struct cons_block
),
3552 if (spare_memory
[4] == 0)
3553 spare_memory
[4] = lisp_align_malloc (sizeof (struct cons_block
),
3555 if (spare_memory
[5] == 0)
3556 spare_memory
[5] = lisp_malloc (sizeof (struct string_block
),
3558 if (spare_memory
[6] == 0)
3559 spare_memory
[6] = lisp_malloc (sizeof (struct string_block
),
3561 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3562 Vmemory_full
= Qnil
;
3566 /************************************************************************
3568 ************************************************************************/
3570 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3572 /* Conservative C stack marking requires a method to identify possibly
3573 live Lisp objects given a pointer value. We do this by keeping
3574 track of blocks of Lisp data that are allocated in a red-black tree
3575 (see also the comment of mem_node which is the type of nodes in
3576 that tree). Function lisp_malloc adds information for an allocated
3577 block to the red-black tree with calls to mem_insert, and function
3578 lisp_free removes it with mem_delete. Functions live_string_p etc
3579 call mem_find to lookup information about a given pointer in the
3580 tree, and use that to determine if the pointer points to a Lisp
3583 /* Initialize this part of alloc.c. */
3588 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3589 mem_z
.parent
= NULL
;
3590 mem_z
.color
= MEM_BLACK
;
3591 mem_z
.start
= mem_z
.end
= NULL
;
3596 /* Value is a pointer to the mem_node containing START. Value is
3597 MEM_NIL if there is no node in the tree containing START. */
3599 static struct mem_node
*
3600 mem_find (void *start
)
3604 if (start
< min_heap_address
|| start
> max_heap_address
)
3607 /* Make the search always successful to speed up the loop below. */
3608 mem_z
.start
= start
;
3609 mem_z
.end
= (char *) start
+ 1;
3612 while (start
< p
->start
|| start
>= p
->end
)
3613 p
= start
< p
->start
? p
->left
: p
->right
;
3618 /* Insert a new node into the tree for a block of memory with start
3619 address START, end address END, and type TYPE. Value is a
3620 pointer to the node that was inserted. */
3622 static struct mem_node
*
3623 mem_insert (void *start
, void *end
, enum mem_type type
)
3625 struct mem_node
*c
, *parent
, *x
;
3627 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3628 min_heap_address
= start
;
3629 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3630 max_heap_address
= end
;
3632 /* See where in the tree a node for START belongs. In this
3633 particular application, it shouldn't happen that a node is already
3634 present. For debugging purposes, let's check that. */
3638 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3640 while (c
!= MEM_NIL
)
3642 if (start
>= c
->start
&& start
< c
->end
)
3645 c
= start
< c
->start
? c
->left
: c
->right
;
3648 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3650 while (c
!= MEM_NIL
)
3653 c
= start
< c
->start
? c
->left
: c
->right
;
3656 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3658 /* Create a new node. */
3659 #ifdef GC_MALLOC_CHECK
3660 x
= malloc (sizeof *x
);
3664 x
= xmalloc (sizeof *x
);
3670 x
->left
= x
->right
= MEM_NIL
;
3673 /* Insert it as child of PARENT or install it as root. */
3676 if (start
< parent
->start
)
3684 /* Re-establish red-black tree properties. */
3685 mem_insert_fixup (x
);
3691 /* Re-establish the red-black properties of the tree, and thereby
3692 balance the tree, after node X has been inserted; X is always red. */
3695 mem_insert_fixup (struct mem_node
*x
)
3697 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3699 /* X is red and its parent is red. This is a violation of
3700 red-black tree property #3. */
3702 if (x
->parent
== x
->parent
->parent
->left
)
3704 /* We're on the left side of our grandparent, and Y is our
3706 struct mem_node
*y
= x
->parent
->parent
->right
;
3708 if (y
->color
== MEM_RED
)
3710 /* Uncle and parent are red but should be black because
3711 X is red. Change the colors accordingly and proceed
3712 with the grandparent. */
3713 x
->parent
->color
= MEM_BLACK
;
3714 y
->color
= MEM_BLACK
;
3715 x
->parent
->parent
->color
= MEM_RED
;
3716 x
= x
->parent
->parent
;
3720 /* Parent and uncle have different colors; parent is
3721 red, uncle is black. */
3722 if (x
== x
->parent
->right
)
3725 mem_rotate_left (x
);
3728 x
->parent
->color
= MEM_BLACK
;
3729 x
->parent
->parent
->color
= MEM_RED
;
3730 mem_rotate_right (x
->parent
->parent
);
3735 /* This is the symmetrical case of above. */
3736 struct mem_node
*y
= x
->parent
->parent
->left
;
3738 if (y
->color
== MEM_RED
)
3740 x
->parent
->color
= MEM_BLACK
;
3741 y
->color
= MEM_BLACK
;
3742 x
->parent
->parent
->color
= MEM_RED
;
3743 x
= x
->parent
->parent
;
3747 if (x
== x
->parent
->left
)
3750 mem_rotate_right (x
);
3753 x
->parent
->color
= MEM_BLACK
;
3754 x
->parent
->parent
->color
= MEM_RED
;
3755 mem_rotate_left (x
->parent
->parent
);
3760 /* The root may have been changed to red due to the algorithm. Set
3761 it to black so that property #5 is satisfied. */
3762 mem_root
->color
= MEM_BLACK
;
3773 mem_rotate_left (struct mem_node
*x
)
3777 /* Turn y's left sub-tree into x's right sub-tree. */
3780 if (y
->left
!= MEM_NIL
)
3781 y
->left
->parent
= x
;
3783 /* Y's parent was x's parent. */
3785 y
->parent
= x
->parent
;
3787 /* Get the parent to point to y instead of x. */
3790 if (x
== x
->parent
->left
)
3791 x
->parent
->left
= y
;
3793 x
->parent
->right
= y
;
3798 /* Put x on y's left. */
3812 mem_rotate_right (struct mem_node
*x
)
3814 struct mem_node
*y
= x
->left
;
3817 if (y
->right
!= MEM_NIL
)
3818 y
->right
->parent
= x
;
3821 y
->parent
= x
->parent
;
3824 if (x
== x
->parent
->right
)
3825 x
->parent
->right
= y
;
3827 x
->parent
->left
= y
;
3838 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3841 mem_delete (struct mem_node
*z
)
3843 struct mem_node
*x
, *y
;
3845 if (!z
|| z
== MEM_NIL
)
3848 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3853 while (y
->left
!= MEM_NIL
)
3857 if (y
->left
!= MEM_NIL
)
3862 x
->parent
= y
->parent
;
3865 if (y
== y
->parent
->left
)
3866 y
->parent
->left
= x
;
3868 y
->parent
->right
= x
;
3875 z
->start
= y
->start
;
3880 if (y
->color
== MEM_BLACK
)
3881 mem_delete_fixup (x
);
3883 #ifdef GC_MALLOC_CHECK
3891 /* Re-establish the red-black properties of the tree, after a
3895 mem_delete_fixup (struct mem_node
*x
)
3897 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3899 if (x
== x
->parent
->left
)
3901 struct mem_node
*w
= x
->parent
->right
;
3903 if (w
->color
== MEM_RED
)
3905 w
->color
= MEM_BLACK
;
3906 x
->parent
->color
= MEM_RED
;
3907 mem_rotate_left (x
->parent
);
3908 w
= x
->parent
->right
;
3911 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3918 if (w
->right
->color
== MEM_BLACK
)
3920 w
->left
->color
= MEM_BLACK
;
3922 mem_rotate_right (w
);
3923 w
= x
->parent
->right
;
3925 w
->color
= x
->parent
->color
;
3926 x
->parent
->color
= MEM_BLACK
;
3927 w
->right
->color
= MEM_BLACK
;
3928 mem_rotate_left (x
->parent
);
3934 struct mem_node
*w
= x
->parent
->left
;
3936 if (w
->color
== MEM_RED
)
3938 w
->color
= MEM_BLACK
;
3939 x
->parent
->color
= MEM_RED
;
3940 mem_rotate_right (x
->parent
);
3941 w
= x
->parent
->left
;
3944 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3951 if (w
->left
->color
== MEM_BLACK
)
3953 w
->right
->color
= MEM_BLACK
;
3955 mem_rotate_left (w
);
3956 w
= x
->parent
->left
;
3959 w
->color
= x
->parent
->color
;
3960 x
->parent
->color
= MEM_BLACK
;
3961 w
->left
->color
= MEM_BLACK
;
3962 mem_rotate_right (x
->parent
);
3968 x
->color
= MEM_BLACK
;
3972 /* Value is non-zero if P is a pointer to a live Lisp string on
3973 the heap. M is a pointer to the mem_block for P. */
3976 live_string_p (struct mem_node
*m
, void *p
)
3978 if (m
->type
== MEM_TYPE_STRING
)
3980 struct string_block
*b
= (struct string_block
*) m
->start
;
3981 ptrdiff_t offset
= (char *) p
- (char *) &b
->strings
[0];
3983 /* P must point to the start of a Lisp_String structure, and it
3984 must not be on the free-list. */
3986 && offset
% sizeof b
->strings
[0] == 0
3987 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3988 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3995 /* Value is non-zero if P is a pointer to a live Lisp cons on
3996 the heap. M is a pointer to the mem_block for P. */
3999 live_cons_p (struct mem_node
*m
, void *p
)
4001 if (m
->type
== MEM_TYPE_CONS
)
4003 struct cons_block
*b
= (struct cons_block
*) m
->start
;
4004 ptrdiff_t offset
= (char *) p
- (char *) &b
->conses
[0];
4006 /* P must point to the start of a Lisp_Cons, not be
4007 one of the unused cells in the current cons block,
4008 and not be on the free-list. */
4010 && offset
% sizeof b
->conses
[0] == 0
4011 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
4013 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
4014 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
4021 /* Value is non-zero if P is a pointer to a live Lisp symbol on
4022 the heap. M is a pointer to the mem_block for P. */
4025 live_symbol_p (struct mem_node
*m
, void *p
)
4027 if (m
->type
== MEM_TYPE_SYMBOL
)
4029 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
4030 ptrdiff_t offset
= (char *) p
- (char *) &b
->symbols
[0];
4032 /* P must point to the start of a Lisp_Symbol, not be
4033 one of the unused cells in the current symbol block,
4034 and not be on the free-list. */
4036 && offset
% sizeof b
->symbols
[0] == 0
4037 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
4038 && (b
!= symbol_block
4039 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
4040 && !EQ (((struct Lisp_Symbol
*)p
)->function
, Vdead
));
4047 /* Value is non-zero if P is a pointer to a live Lisp float on
4048 the heap. M is a pointer to the mem_block for P. */
4051 live_float_p (struct mem_node
*m
, void *p
)
4053 if (m
->type
== MEM_TYPE_FLOAT
)
4055 struct float_block
*b
= (struct float_block
*) m
->start
;
4056 ptrdiff_t offset
= (char *) p
- (char *) &b
->floats
[0];
4058 /* P must point to the start of a Lisp_Float and not be
4059 one of the unused cells in the current float block. */
4061 && offset
% sizeof b
->floats
[0] == 0
4062 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
4063 && (b
!= float_block
4064 || offset
/ sizeof b
->floats
[0] < float_block_index
));
4071 /* Value is non-zero if P is a pointer to a live Lisp Misc on
4072 the heap. M is a pointer to the mem_block for P. */
4075 live_misc_p (struct mem_node
*m
, void *p
)
4077 if (m
->type
== MEM_TYPE_MISC
)
4079 struct marker_block
*b
= (struct marker_block
*) m
->start
;
4080 ptrdiff_t offset
= (char *) p
- (char *) &b
->markers
[0];
4082 /* P must point to the start of a Lisp_Misc, not be
4083 one of the unused cells in the current misc block,
4084 and not be on the free-list. */
4086 && offset
% sizeof b
->markers
[0] == 0
4087 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4088 && (b
!= marker_block
4089 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4090 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
4097 /* Value is non-zero if P is a pointer to a live vector-like object.
4098 M is a pointer to the mem_block for P. */
4101 live_vector_p (struct mem_node
*m
, void *p
)
4103 if (m
->type
== MEM_TYPE_VECTOR_BLOCK
)
4105 /* This memory node corresponds to a vector block. */
4106 struct vector_block
*block
= (struct vector_block
*) m
->start
;
4107 struct Lisp_Vector
*vector
= (struct Lisp_Vector
*) block
->data
;
4109 /* P is in the block's allocation range. Scan the block
4110 up to P and see whether P points to the start of some
4111 vector which is not on a free list. FIXME: check whether
4112 some allocation patterns (probably a lot of short vectors)
4113 may cause a substantial overhead of this loop. */
4114 while (VECTOR_IN_BLOCK (vector
, block
)
4115 && vector
<= (struct Lisp_Vector
*) p
)
4117 if (!PSEUDOVECTOR_TYPEP (&vector
->header
, PVEC_FREE
) && vector
== p
)
4120 vector
= ADVANCE (vector
, vector_nbytes (vector
));
4123 else if (m
->type
== MEM_TYPE_VECTORLIKE
4124 && (char *) p
== ((char *) m
->start
4125 + offsetof (struct large_vector
, v
)))
4126 /* This memory node corresponds to a large vector. */
4132 /* Value is non-zero if P is a pointer to a live buffer. M is a
4133 pointer to the mem_block for P. */
4136 live_buffer_p (struct mem_node
*m
, void *p
)
4138 /* P must point to the start of the block, and the buffer
4139 must not have been killed. */
4140 return (m
->type
== MEM_TYPE_BUFFER
4142 && !NILP (((struct buffer
*) p
)->INTERNAL_FIELD (name
)));
4145 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4149 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4151 /* Array of objects that are kept alive because the C stack contains
4152 a pattern that looks like a reference to them . */
4154 #define MAX_ZOMBIES 10
4155 static Lisp_Object zombies
[MAX_ZOMBIES
];
4157 /* Number of zombie objects. */
4159 static EMACS_INT nzombies
;
4161 /* Number of garbage collections. */
4163 static EMACS_INT ngcs
;
4165 /* Average percentage of zombies per collection. */
4167 static double avg_zombies
;
4169 /* Max. number of live and zombie objects. */
4171 static EMACS_INT max_live
, max_zombies
;
4173 /* Average number of live objects per GC. */
4175 static double avg_live
;
4177 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4178 doc
: /* Show information about live and zombie objects. */)
4181 Lisp_Object args
[8], zombie_list
= Qnil
;
4183 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); i
++)
4184 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4185 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4186 args
[1] = make_number (ngcs
);
4187 args
[2] = make_float (avg_live
);
4188 args
[3] = make_float (avg_zombies
);
4189 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4190 args
[5] = make_number (max_live
);
4191 args
[6] = make_number (max_zombies
);
4192 args
[7] = zombie_list
;
4193 return Fmessage (8, args
);
4196 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4199 /* Mark OBJ if we can prove it's a Lisp_Object. */
4202 mark_maybe_object (Lisp_Object obj
)
4210 po
= (void *) XPNTR (obj
);
4217 switch (XTYPE (obj
))
4220 mark_p
= (live_string_p (m
, po
)
4221 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4225 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4229 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4233 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4236 case Lisp_Vectorlike
:
4237 /* Note: can't check BUFFERP before we know it's a
4238 buffer because checking that dereferences the pointer
4239 PO which might point anywhere. */
4240 if (live_vector_p (m
, po
))
4241 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4242 else if (live_buffer_p (m
, po
))
4243 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4247 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4256 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4257 if (nzombies
< MAX_ZOMBIES
)
4258 zombies
[nzombies
] = obj
;
4267 /* If P points to Lisp data, mark that as live if it isn't already
4271 mark_maybe_pointer (void *p
)
4275 /* Quickly rule out some values which can't point to Lisp data.
4276 USE_LSB_TAG needs Lisp data to be aligned on multiples of GCALIGNMENT.
4277 Otherwise, assume that Lisp data is aligned on even addresses. */
4278 if ((intptr_t) p
% (USE_LSB_TAG
? GCALIGNMENT
: 2))
4284 Lisp_Object obj
= Qnil
;
4288 case MEM_TYPE_NON_LISP
:
4289 case MEM_TYPE_SPARE
:
4290 /* Nothing to do; not a pointer to Lisp memory. */
4293 case MEM_TYPE_BUFFER
:
4294 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P ((struct buffer
*)p
))
4295 XSETVECTOR (obj
, p
);
4299 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4303 case MEM_TYPE_STRING
:
4304 if (live_string_p (m
, p
)
4305 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4306 XSETSTRING (obj
, p
);
4310 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4314 case MEM_TYPE_SYMBOL
:
4315 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4316 XSETSYMBOL (obj
, p
);
4319 case MEM_TYPE_FLOAT
:
4320 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4324 case MEM_TYPE_VECTORLIKE
:
4325 case MEM_TYPE_VECTOR_BLOCK
:
4326 if (live_vector_p (m
, p
))
4329 XSETVECTOR (tem
, p
);
4330 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4345 /* Alignment of pointer values. Use alignof, as it sometimes returns
4346 a smaller alignment than GCC's __alignof__ and mark_memory might
4347 miss objects if __alignof__ were used. */
4348 #define GC_POINTER_ALIGNMENT alignof (void *)
4350 /* Define POINTERS_MIGHT_HIDE_IN_OBJECTS to 1 if marking via C pointers does
4351 not suffice, which is the typical case. A host where a Lisp_Object is
4352 wider than a pointer might allocate a Lisp_Object in non-adjacent halves.
4353 If USE_LSB_TAG, the bottom half is not a valid pointer, but it should
4354 suffice to widen it to to a Lisp_Object and check it that way. */
4355 #if USE_LSB_TAG || VAL_MAX < UINTPTR_MAX
4356 # if !USE_LSB_TAG && VAL_MAX < UINTPTR_MAX >> GCTYPEBITS
4357 /* If tag bits straddle pointer-word boundaries, neither mark_maybe_pointer
4358 nor mark_maybe_object can follow the pointers. This should not occur on
4359 any practical porting target. */
4360 # error "MSB type bits straddle pointer-word boundaries"
4362 /* Marking via C pointers does not suffice, because Lisp_Objects contain
4363 pointer words that hold pointers ORed with type bits. */
4364 # define POINTERS_MIGHT_HIDE_IN_OBJECTS 1
4366 /* Marking via C pointers suffices, because Lisp_Objects contain pointer
4367 words that hold unmodified pointers. */
4368 # define POINTERS_MIGHT_HIDE_IN_OBJECTS 0
4371 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4372 or END+OFFSET..START. */
4375 mark_memory (void *start
, void *end
)
4376 #if defined (__clang__) && defined (__has_feature)
4377 #if __has_feature(address_sanitizer)
4378 /* Do not allow -faddress-sanitizer to check this function, since it
4379 crosses the function stack boundary, and thus would yield many
4381 __attribute__((no_address_safety_analysis
))
4388 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4392 /* Make START the pointer to the start of the memory region,
4393 if it isn't already. */
4401 /* Mark Lisp data pointed to. This is necessary because, in some
4402 situations, the C compiler optimizes Lisp objects away, so that
4403 only a pointer to them remains. Example:
4405 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4408 Lisp_Object obj = build_string ("test");
4409 struct Lisp_String *s = XSTRING (obj);
4410 Fgarbage_collect ();
4411 fprintf (stderr, "test `%s'\n", s->data);
4415 Here, `obj' isn't really used, and the compiler optimizes it
4416 away. The only reference to the life string is through the
4419 for (pp
= start
; (void *) pp
< end
; pp
++)
4420 for (i
= 0; i
< sizeof *pp
; i
+= GC_POINTER_ALIGNMENT
)
4422 void *p
= *(void **) ((char *) pp
+ i
);
4423 mark_maybe_pointer (p
);
4424 if (POINTERS_MIGHT_HIDE_IN_OBJECTS
)
4425 mark_maybe_object (XIL ((intptr_t) p
));
4429 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4430 the GCC system configuration. In gcc 3.2, the only systems for
4431 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4432 by others?) and ns32k-pc532-min. */
4434 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4436 static bool setjmp_tested_p
;
4437 static int longjmps_done
;
4439 #define SETJMP_WILL_LIKELY_WORK "\
4441 Emacs garbage collector has been changed to use conservative stack\n\
4442 marking. Emacs has determined that the method it uses to do the\n\
4443 marking will likely work on your system, but this isn't sure.\n\
4445 If you are a system-programmer, or can get the help of a local wizard\n\
4446 who is, please take a look at the function mark_stack in alloc.c, and\n\
4447 verify that the methods used are appropriate for your system.\n\
4449 Please mail the result to <emacs-devel@gnu.org>.\n\
4452 #define SETJMP_WILL_NOT_WORK "\
4454 Emacs garbage collector has been changed to use conservative stack\n\
4455 marking. Emacs has determined that the default method it uses to do the\n\
4456 marking will not work on your system. We will need a system-dependent\n\
4457 solution for your system.\n\
4459 Please take a look at the function mark_stack in alloc.c, and\n\
4460 try to find a way to make it work on your system.\n\
4462 Note that you may get false negatives, depending on the compiler.\n\
4463 In particular, you need to use -O with GCC for this test.\n\
4465 Please mail the result to <emacs-devel@gnu.org>.\n\
4469 /* Perform a quick check if it looks like setjmp saves registers in a
4470 jmp_buf. Print a message to stderr saying so. When this test
4471 succeeds, this is _not_ a proof that setjmp is sufficient for
4472 conservative stack marking. Only the sources or a disassembly
4482 /* Arrange for X to be put in a register. */
4488 if (longjmps_done
== 1)
4490 /* Came here after the longjmp at the end of the function.
4492 If x == 1, the longjmp has restored the register to its
4493 value before the setjmp, and we can hope that setjmp
4494 saves all such registers in the jmp_buf, although that
4497 For other values of X, either something really strange is
4498 taking place, or the setjmp just didn't save the register. */
4501 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4504 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4511 if (longjmps_done
== 1)
4512 sys_longjmp (jbuf
, 1);
4515 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4518 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4520 /* Abort if anything GCPRO'd doesn't survive the GC. */
4528 for (p
= gcprolist
; p
; p
= p
->next
)
4529 for (i
= 0; i
< p
->nvars
; ++i
)
4530 if (!survives_gc_p (p
->var
[i
]))
4531 /* FIXME: It's not necessarily a bug. It might just be that the
4532 GCPRO is unnecessary or should release the object sooner. */
4536 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4543 fprintf (stderr
, "\nZombies kept alive = %"pI
"d:\n", nzombies
);
4544 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4546 fprintf (stderr
, " %d = ", i
);
4547 debug_print (zombies
[i
]);
4551 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4554 /* Mark live Lisp objects on the C stack.
4556 There are several system-dependent problems to consider when
4557 porting this to new architectures:
4561 We have to mark Lisp objects in CPU registers that can hold local
4562 variables or are used to pass parameters.
4564 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4565 something that either saves relevant registers on the stack, or
4566 calls mark_maybe_object passing it each register's contents.
4568 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4569 implementation assumes that calling setjmp saves registers we need
4570 to see in a jmp_buf which itself lies on the stack. This doesn't
4571 have to be true! It must be verified for each system, possibly
4572 by taking a look at the source code of setjmp.
4574 If __builtin_unwind_init is available (defined by GCC >= 2.8) we
4575 can use it as a machine independent method to store all registers
4576 to the stack. In this case the macros described in the previous
4577 two paragraphs are not used.
4581 Architectures differ in the way their processor stack is organized.
4582 For example, the stack might look like this
4585 | Lisp_Object | size = 4
4587 | something else | size = 2
4589 | Lisp_Object | size = 4
4593 In such a case, not every Lisp_Object will be aligned equally. To
4594 find all Lisp_Object on the stack it won't be sufficient to walk
4595 the stack in steps of 4 bytes. Instead, two passes will be
4596 necessary, one starting at the start of the stack, and a second
4597 pass starting at the start of the stack + 2. Likewise, if the
4598 minimal alignment of Lisp_Objects on the stack is 1, four passes
4599 would be necessary, each one starting with one byte more offset
4600 from the stack start. */
4607 #ifdef HAVE___BUILTIN_UNWIND_INIT
4608 /* Force callee-saved registers and register windows onto the stack.
4609 This is the preferred method if available, obviating the need for
4610 machine dependent methods. */
4611 __builtin_unwind_init ();
4613 #else /* not HAVE___BUILTIN_UNWIND_INIT */
4614 #ifndef GC_SAVE_REGISTERS_ON_STACK
4615 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4616 union aligned_jmpbuf
{
4620 volatile bool stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4622 /* This trick flushes the register windows so that all the state of
4623 the process is contained in the stack. */
4624 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4625 needed on ia64 too. See mach_dep.c, where it also says inline
4626 assembler doesn't work with relevant proprietary compilers. */
4628 #if defined (__sparc64__) && defined (__FreeBSD__)
4629 /* FreeBSD does not have a ta 3 handler. */
4636 /* Save registers that we need to see on the stack. We need to see
4637 registers used to hold register variables and registers used to
4639 #ifdef GC_SAVE_REGISTERS_ON_STACK
4640 GC_SAVE_REGISTERS_ON_STACK (end
);
4641 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4643 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4644 setjmp will definitely work, test it
4645 and print a message with the result
4647 if (!setjmp_tested_p
)
4649 setjmp_tested_p
= 1;
4652 #endif /* GC_SETJMP_WORKS */
4655 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4656 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4657 #endif /* not HAVE___BUILTIN_UNWIND_INIT */
4659 /* This assumes that the stack is a contiguous region in memory. If
4660 that's not the case, something has to be done here to iterate
4661 over the stack segments. */
4662 mark_memory (stack_base
, end
);
4664 /* Allow for marking a secondary stack, like the register stack on the
4666 #ifdef GC_MARK_SECONDARY_STACK
4667 GC_MARK_SECONDARY_STACK ();
4670 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4675 #endif /* GC_MARK_STACK != 0 */
4678 /* Determine whether it is safe to access memory at address P. */
4680 valid_pointer_p (void *p
)
4683 return w32_valid_pointer_p (p
, 16);
4687 /* Obviously, we cannot just access it (we would SEGV trying), so we
4688 trick the o/s to tell us whether p is a valid pointer.
4689 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4690 not validate p in that case. */
4694 bool valid
= emacs_write (fd
[1], (char *) p
, 16) == 16;
4695 emacs_close (fd
[1]);
4696 emacs_close (fd
[0]);
4704 /* Return 2 if OBJ is a killed or special buffer object.
4705 Return 1 if OBJ is a valid lisp object.
4706 Return 0 if OBJ is NOT a valid lisp object.
4707 Return -1 if we cannot validate OBJ.
4708 This function can be quite slow,
4709 so it should only be used in code for manual debugging. */
4712 valid_lisp_object_p (Lisp_Object obj
)
4722 p
= (void *) XPNTR (obj
);
4723 if (PURE_POINTER_P (p
))
4726 if (p
== &buffer_defaults
|| p
== &buffer_local_symbols
)
4730 return valid_pointer_p (p
);
4737 int valid
= valid_pointer_p (p
);
4749 case MEM_TYPE_NON_LISP
:
4750 case MEM_TYPE_SPARE
:
4753 case MEM_TYPE_BUFFER
:
4754 return live_buffer_p (m
, p
) ? 1 : 2;
4757 return live_cons_p (m
, p
);
4759 case MEM_TYPE_STRING
:
4760 return live_string_p (m
, p
);
4763 return live_misc_p (m
, p
);
4765 case MEM_TYPE_SYMBOL
:
4766 return live_symbol_p (m
, p
);
4768 case MEM_TYPE_FLOAT
:
4769 return live_float_p (m
, p
);
4771 case MEM_TYPE_VECTORLIKE
:
4772 case MEM_TYPE_VECTOR_BLOCK
:
4773 return live_vector_p (m
, p
);
4786 /***********************************************************************
4787 Pure Storage Management
4788 ***********************************************************************/
4790 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4791 pointer to it. TYPE is the Lisp type for which the memory is
4792 allocated. TYPE < 0 means it's not used for a Lisp object. */
4795 pure_alloc (size_t size
, int type
)
4799 size_t alignment
= GCALIGNMENT
;
4801 size_t alignment
= alignof (EMACS_INT
);
4803 /* Give Lisp_Floats an extra alignment. */
4804 if (type
== Lisp_Float
)
4805 alignment
= alignof (struct Lisp_Float
);
4811 /* Allocate space for a Lisp object from the beginning of the free
4812 space with taking account of alignment. */
4813 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4814 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4818 /* Allocate space for a non-Lisp object from the end of the free
4820 pure_bytes_used_non_lisp
+= size
;
4821 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4823 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4825 if (pure_bytes_used
<= pure_size
)
4828 /* Don't allocate a large amount here,
4829 because it might get mmap'd and then its address
4830 might not be usable. */
4831 purebeg
= xmalloc (10000);
4833 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4834 pure_bytes_used
= 0;
4835 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4840 /* Print a warning if PURESIZE is too small. */
4843 check_pure_size (void)
4845 if (pure_bytes_used_before_overflow
)
4846 message (("emacs:0:Pure Lisp storage overflow (approx. %"pI
"d"
4848 pure_bytes_used
+ pure_bytes_used_before_overflow
);
4852 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4853 the non-Lisp data pool of the pure storage, and return its start
4854 address. Return NULL if not found. */
4857 find_string_data_in_pure (const char *data
, ptrdiff_t nbytes
)
4860 ptrdiff_t skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4861 const unsigned char *p
;
4864 if (pure_bytes_used_non_lisp
<= nbytes
)
4867 /* Set up the Boyer-Moore table. */
4869 for (i
= 0; i
< 256; i
++)
4872 p
= (const unsigned char *) data
;
4874 bm_skip
[*p
++] = skip
;
4876 last_char_skip
= bm_skip
['\0'];
4878 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4879 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4881 /* See the comments in the function `boyer_moore' (search.c) for the
4882 use of `infinity'. */
4883 infinity
= pure_bytes_used_non_lisp
+ 1;
4884 bm_skip
['\0'] = infinity
;
4886 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
4890 /* Check the last character (== '\0'). */
4893 start
+= bm_skip
[*(p
+ start
)];
4895 while (start
<= start_max
);
4897 if (start
< infinity
)
4898 /* Couldn't find the last character. */
4901 /* No less than `infinity' means we could find the last
4902 character at `p[start - infinity]'. */
4905 /* Check the remaining characters. */
4906 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4908 return non_lisp_beg
+ start
;
4910 start
+= last_char_skip
;
4912 while (start
<= start_max
);
4918 /* Return a string allocated in pure space. DATA is a buffer holding
4919 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4920 means make the result string multibyte.
4922 Must get an error if pure storage is full, since if it cannot hold
4923 a large string it may be able to hold conses that point to that
4924 string; then the string is not protected from gc. */
4927 make_pure_string (const char *data
,
4928 ptrdiff_t nchars
, ptrdiff_t nbytes
, bool multibyte
)
4931 struct Lisp_String
*s
= pure_alloc (sizeof *s
, Lisp_String
);
4932 s
->data
= (unsigned char *) find_string_data_in_pure (data
, nbytes
);
4933 if (s
->data
== NULL
)
4935 s
->data
= pure_alloc (nbytes
+ 1, -1);
4936 memcpy (s
->data
, data
, nbytes
);
4937 s
->data
[nbytes
] = '\0';
4940 s
->size_byte
= multibyte
? nbytes
: -1;
4941 s
->intervals
= NULL
;
4942 XSETSTRING (string
, s
);
4946 /* Return a string allocated in pure space. Do not
4947 allocate the string data, just point to DATA. */
4950 make_pure_c_string (const char *data
, ptrdiff_t nchars
)
4953 struct Lisp_String
*s
= pure_alloc (sizeof *s
, Lisp_String
);
4956 s
->data
= (unsigned char *) data
;
4957 s
->intervals
= NULL
;
4958 XSETSTRING (string
, s
);
4962 /* Return a cons allocated from pure space. Give it pure copies
4963 of CAR as car and CDR as cdr. */
4966 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
4969 struct Lisp_Cons
*p
= pure_alloc (sizeof *p
, Lisp_Cons
);
4971 XSETCAR (new, Fpurecopy (car
));
4972 XSETCDR (new, Fpurecopy (cdr
));
4977 /* Value is a float object with value NUM allocated from pure space. */
4980 make_pure_float (double num
)
4983 struct Lisp_Float
*p
= pure_alloc (sizeof *p
, Lisp_Float
);
4985 XFLOAT_INIT (new, num
);
4990 /* Return a vector with room for LEN Lisp_Objects allocated from
4994 make_pure_vector (ptrdiff_t len
)
4997 size_t size
= header_size
+ len
* word_size
;
4998 struct Lisp_Vector
*p
= pure_alloc (size
, Lisp_Vectorlike
);
4999 XSETVECTOR (new, p
);
5000 XVECTOR (new)->header
.size
= len
;
5005 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
5006 doc
: /* Make a copy of object OBJ in pure storage.
5007 Recursively copies contents of vectors and cons cells.
5008 Does not copy symbols. Copies strings without text properties. */)
5009 (register Lisp_Object obj
)
5011 if (NILP (Vpurify_flag
))
5014 if (PURE_POINTER_P (XPNTR (obj
)))
5017 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
5019 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
5025 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
5026 else if (FLOATP (obj
))
5027 obj
= make_pure_float (XFLOAT_DATA (obj
));
5028 else if (STRINGP (obj
))
5029 obj
= make_pure_string (SSDATA (obj
), SCHARS (obj
),
5031 STRING_MULTIBYTE (obj
));
5032 else if (COMPILEDP (obj
) || VECTORP (obj
))
5034 register struct Lisp_Vector
*vec
;
5035 register ptrdiff_t i
;
5039 if (size
& PSEUDOVECTOR_FLAG
)
5040 size
&= PSEUDOVECTOR_SIZE_MASK
;
5041 vec
= XVECTOR (make_pure_vector (size
));
5042 for (i
= 0; i
< size
; i
++)
5043 vec
->contents
[i
] = Fpurecopy (AREF (obj
, i
));
5044 if (COMPILEDP (obj
))
5046 XSETPVECTYPE (vec
, PVEC_COMPILED
);
5047 XSETCOMPILED (obj
, vec
);
5050 XSETVECTOR (obj
, vec
);
5052 else if (MARKERP (obj
))
5053 error ("Attempt to copy a marker to pure storage");
5055 /* Not purified, don't hash-cons. */
5058 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
5059 Fputhash (obj
, obj
, Vpurify_flag
);
5066 /***********************************************************************
5068 ***********************************************************************/
5070 /* Put an entry in staticvec, pointing at the variable with address
5074 staticpro (Lisp_Object
*varaddress
)
5076 staticvec
[staticidx
++] = varaddress
;
5077 if (staticidx
>= NSTATICS
)
5078 fatal ("NSTATICS too small; try increasing and recompiling Emacs.");
5082 /***********************************************************************
5084 ***********************************************************************/
5086 /* Temporarily prevent garbage collection. */
5089 inhibit_garbage_collection (void)
5091 ptrdiff_t count
= SPECPDL_INDEX ();
5093 specbind (Qgc_cons_threshold
, make_number (MOST_POSITIVE_FIXNUM
));
5097 /* Used to avoid possible overflows when
5098 converting from C to Lisp integers. */
5101 bounded_number (EMACS_INT number
)
5103 return make_number (min (MOST_POSITIVE_FIXNUM
, number
));
5106 /* Calculate total bytes of live objects. */
5109 total_bytes_of_live_objects (void)
5112 tot
+= total_conses
* sizeof (struct Lisp_Cons
);
5113 tot
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5114 tot
+= total_markers
* sizeof (union Lisp_Misc
);
5115 tot
+= total_string_bytes
;
5116 tot
+= total_vector_slots
* word_size
;
5117 tot
+= total_floats
* sizeof (struct Lisp_Float
);
5118 tot
+= total_intervals
* sizeof (struct interval
);
5119 tot
+= total_strings
* sizeof (struct Lisp_String
);
5123 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
5124 doc
: /* Reclaim storage for Lisp objects no longer needed.
5125 Garbage collection happens automatically if you cons more than
5126 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
5127 `garbage-collect' normally returns a list with info on amount of space in use,
5128 where each entry has the form (NAME SIZE USED FREE), where:
5129 - NAME is a symbol describing the kind of objects this entry represents,
5130 - SIZE is the number of bytes used by each one,
5131 - USED is the number of those objects that were found live in the heap,
5132 - FREE is the number of those objects that are not live but that Emacs
5133 keeps around for future allocations (maybe because it does not know how
5134 to return them to the OS).
5135 However, if there was overflow in pure space, `garbage-collect'
5136 returns nil, because real GC can't be done.
5137 See Info node `(elisp)Garbage Collection'. */)
5140 struct specbinding
*bind
;
5141 struct buffer
*nextb
;
5142 char stack_top_variable
;
5145 ptrdiff_t count
= SPECPDL_INDEX ();
5147 Lisp_Object retval
= Qnil
;
5148 size_t tot_before
= 0;
5149 struct backtrace backtrace
;
5154 /* Can't GC if pure storage overflowed because we can't determine
5155 if something is a pure object or not. */
5156 if (pure_bytes_used_before_overflow
)
5159 /* Record this function, so it appears on the profiler's backtraces. */
5160 backtrace
.next
= backtrace_list
;
5161 backtrace
.function
= Qautomatic_gc
;
5162 backtrace
.args
= &Qnil
;
5163 backtrace
.nargs
= 0;
5164 backtrace
.debug_on_exit
= 0;
5165 backtrace_list
= &backtrace
;
5169 /* Don't keep undo information around forever.
5170 Do this early on, so it is no problem if the user quits. */
5171 FOR_EACH_BUFFER (nextb
)
5172 compact_buffer (nextb
);
5174 if (profiler_memory_running
)
5175 tot_before
= total_bytes_of_live_objects ();
5177 start
= current_emacs_time ();
5179 /* In case user calls debug_print during GC,
5180 don't let that cause a recursive GC. */
5181 consing_since_gc
= 0;
5183 /* Save what's currently displayed in the echo area. */
5184 message_p
= push_message ();
5185 record_unwind_protect (pop_message_unwind
, Qnil
);
5187 /* Save a copy of the contents of the stack, for debugging. */
5188 #if MAX_SAVE_STACK > 0
5189 if (NILP (Vpurify_flag
))
5192 ptrdiff_t stack_size
;
5193 if (&stack_top_variable
< stack_bottom
)
5195 stack
= &stack_top_variable
;
5196 stack_size
= stack_bottom
- &stack_top_variable
;
5200 stack
= stack_bottom
;
5201 stack_size
= &stack_top_variable
- stack_bottom
;
5203 if (stack_size
<= MAX_SAVE_STACK
)
5205 if (stack_copy_size
< stack_size
)
5207 stack_copy
= xrealloc (stack_copy
, stack_size
);
5208 stack_copy_size
= stack_size
;
5210 memcpy (stack_copy
, stack
, stack_size
);
5213 #endif /* MAX_SAVE_STACK > 0 */
5215 if (garbage_collection_messages
)
5216 message1_nolog ("Garbage collecting...");
5220 shrink_regexp_cache ();
5224 /* Mark all the special slots that serve as the roots of accessibility. */
5226 mark_buffer (&buffer_defaults
);
5227 mark_buffer (&buffer_local_symbols
);
5229 for (i
= 0; i
< staticidx
; i
++)
5230 mark_object (*staticvec
[i
]);
5232 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
5234 mark_object (bind
->symbol
);
5235 mark_object (bind
->old_value
);
5244 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5245 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5249 register struct gcpro
*tail
;
5250 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5251 for (i
= 0; i
< tail
->nvars
; i
++)
5252 mark_object (tail
->var
[i
]);
5256 struct catchtag
*catch;
5257 struct handler
*handler
;
5259 for (catch = catchlist
; catch; catch = catch->next
)
5261 mark_object (catch->tag
);
5262 mark_object (catch->val
);
5264 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5266 mark_object (handler
->handler
);
5267 mark_object (handler
->var
);
5273 #ifdef HAVE_WINDOW_SYSTEM
5274 mark_fringe_data ();
5277 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5281 /* Everything is now marked, except for the things that require special
5282 finalization, i.e. the undo_list.
5283 Look thru every buffer's undo list
5284 for elements that update markers that were not marked,
5286 FOR_EACH_BUFFER (nextb
)
5288 /* If a buffer's undo list is Qt, that means that undo is
5289 turned off in that buffer. Calling truncate_undo_list on
5290 Qt tends to return NULL, which effectively turns undo back on.
5291 So don't call truncate_undo_list if undo_list is Qt. */
5292 if (! EQ (nextb
->INTERNAL_FIELD (undo_list
), Qt
))
5294 Lisp_Object tail
, prev
;
5295 tail
= nextb
->INTERNAL_FIELD (undo_list
);
5297 while (CONSP (tail
))
5299 if (CONSP (XCAR (tail
))
5300 && MARKERP (XCAR (XCAR (tail
)))
5301 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5304 nextb
->INTERNAL_FIELD (undo_list
) = tail
= XCDR (tail
);
5308 XSETCDR (prev
, tail
);
5318 /* Now that we have stripped the elements that need not be in the
5319 undo_list any more, we can finally mark the list. */
5320 mark_object (nextb
->INTERNAL_FIELD (undo_list
));
5325 /* Clear the mark bits that we set in certain root slots. */
5327 unmark_byte_stack ();
5328 VECTOR_UNMARK (&buffer_defaults
);
5329 VECTOR_UNMARK (&buffer_local_symbols
);
5331 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5341 consing_since_gc
= 0;
5342 if (gc_cons_threshold
< GC_DEFAULT_THRESHOLD
/ 10)
5343 gc_cons_threshold
= GC_DEFAULT_THRESHOLD
/ 10;
5345 gc_relative_threshold
= 0;
5346 if (FLOATP (Vgc_cons_percentage
))
5347 { /* Set gc_cons_combined_threshold. */
5348 double tot
= total_bytes_of_live_objects ();
5350 tot
*= XFLOAT_DATA (Vgc_cons_percentage
);
5353 if (tot
< TYPE_MAXIMUM (EMACS_INT
))
5354 gc_relative_threshold
= tot
;
5356 gc_relative_threshold
= TYPE_MAXIMUM (EMACS_INT
);
5360 if (garbage_collection_messages
)
5362 if (message_p
|| minibuf_level
> 0)
5365 message1_nolog ("Garbage collecting...done");
5368 unbind_to (count
, Qnil
);
5370 Lisp_Object total
[11];
5371 int total_size
= 10;
5373 total
[0] = list4 (Qconses
, make_number (sizeof (struct Lisp_Cons
)),
5374 bounded_number (total_conses
),
5375 bounded_number (total_free_conses
));
5377 total
[1] = list4 (Qsymbols
, make_number (sizeof (struct Lisp_Symbol
)),
5378 bounded_number (total_symbols
),
5379 bounded_number (total_free_symbols
));
5381 total
[2] = list4 (Qmiscs
, make_number (sizeof (union Lisp_Misc
)),
5382 bounded_number (total_markers
),
5383 bounded_number (total_free_markers
));
5385 total
[3] = list4 (Qstrings
, make_number (sizeof (struct Lisp_String
)),
5386 bounded_number (total_strings
),
5387 bounded_number (total_free_strings
));
5389 total
[4] = list3 (Qstring_bytes
, make_number (1),
5390 bounded_number (total_string_bytes
));
5392 total
[5] = list3 (Qvectors
, make_number (sizeof (struct Lisp_Vector
)),
5393 bounded_number (total_vectors
));
5395 total
[6] = list4 (Qvector_slots
, make_number (word_size
),
5396 bounded_number (total_vector_slots
),
5397 bounded_number (total_free_vector_slots
));
5399 total
[7] = list4 (Qfloats
, make_number (sizeof (struct Lisp_Float
)),
5400 bounded_number (total_floats
),
5401 bounded_number (total_free_floats
));
5403 total
[8] = list4 (Qintervals
, make_number (sizeof (struct interval
)),
5404 bounded_number (total_intervals
),
5405 bounded_number (total_free_intervals
));
5407 total
[9] = list3 (Qbuffers
, make_number (sizeof (struct buffer
)),
5408 bounded_number (total_buffers
));
5410 #ifdef DOUG_LEA_MALLOC
5412 total
[10] = list4 (Qheap
, make_number (1024),
5413 bounded_number ((mallinfo ().uordblks
+ 1023) >> 10),
5414 bounded_number ((mallinfo ().fordblks
+ 1023) >> 10));
5416 retval
= Flist (total_size
, total
);
5419 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5421 /* Compute average percentage of zombies. */
5423 = (total_conses
+ total_symbols
+ total_markers
+ total_strings
5424 + total_vectors
+ total_floats
+ total_intervals
+ total_buffers
);
5426 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5427 max_live
= max (nlive
, max_live
);
5428 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5429 max_zombies
= max (nzombies
, max_zombies
);
5434 if (!NILP (Vpost_gc_hook
))
5436 ptrdiff_t gc_count
= inhibit_garbage_collection ();
5437 safe_run_hooks (Qpost_gc_hook
);
5438 unbind_to (gc_count
, Qnil
);
5441 /* Accumulate statistics. */
5442 if (FLOATP (Vgc_elapsed
))
5444 EMACS_TIME since_start
= sub_emacs_time (current_emacs_time (), start
);
5445 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
)
5446 + EMACS_TIME_TO_DOUBLE (since_start
));
5451 /* Collect profiling data. */
5452 if (profiler_memory_running
)
5455 size_t tot_after
= total_bytes_of_live_objects ();
5456 if (tot_before
> tot_after
)
5457 swept
= tot_before
- tot_after
;
5458 malloc_probe (swept
);
5461 backtrace_list
= backtrace
.next
;
5466 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5467 only interesting objects referenced from glyphs are strings. */
5470 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5472 struct glyph_row
*row
= matrix
->rows
;
5473 struct glyph_row
*end
= row
+ matrix
->nrows
;
5475 for (; row
< end
; ++row
)
5479 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5481 struct glyph
*glyph
= row
->glyphs
[area
];
5482 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5484 for (; glyph
< end_glyph
; ++glyph
)
5485 if (STRINGP (glyph
->object
)
5486 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5487 mark_object (glyph
->object
);
5493 /* Mark Lisp faces in the face cache C. */
5496 mark_face_cache (struct face_cache
*c
)
5501 for (i
= 0; i
< c
->used
; ++i
)
5503 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5507 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5508 mark_object (face
->lface
[j
]);
5516 /* Mark reference to a Lisp_Object.
5517 If the object referred to has not been seen yet, recursively mark
5518 all the references contained in it. */
5520 #define LAST_MARKED_SIZE 500
5521 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5522 static int last_marked_index
;
5524 /* For debugging--call abort when we cdr down this many
5525 links of a list, in mark_object. In debugging,
5526 the call to abort will hit a breakpoint.
5527 Normally this is zero and the check never goes off. */
5528 ptrdiff_t mark_object_loop_halt EXTERNALLY_VISIBLE
;
5531 mark_vectorlike (struct Lisp_Vector
*ptr
)
5533 ptrdiff_t size
= ptr
->header
.size
;
5536 eassert (!VECTOR_MARKED_P (ptr
));
5537 VECTOR_MARK (ptr
); /* Else mark it. */
5538 if (size
& PSEUDOVECTOR_FLAG
)
5539 size
&= PSEUDOVECTOR_SIZE_MASK
;
5541 /* Note that this size is not the memory-footprint size, but only
5542 the number of Lisp_Object fields that we should trace.
5543 The distinction is used e.g. by Lisp_Process which places extra
5544 non-Lisp_Object fields at the end of the structure... */
5545 for (i
= 0; i
< size
; i
++) /* ...and then mark its elements. */
5546 mark_object (ptr
->contents
[i
]);
5549 /* Like mark_vectorlike but optimized for char-tables (and
5550 sub-char-tables) assuming that the contents are mostly integers or
5554 mark_char_table (struct Lisp_Vector
*ptr
)
5556 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5559 eassert (!VECTOR_MARKED_P (ptr
));
5561 for (i
= 0; i
< size
; i
++)
5563 Lisp_Object val
= ptr
->contents
[i
];
5565 if (INTEGERP (val
) || (SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
))
5567 if (SUB_CHAR_TABLE_P (val
))
5569 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5570 mark_char_table (XVECTOR (val
));
5577 /* Mark the chain of overlays starting at PTR. */
5580 mark_overlay (struct Lisp_Overlay
*ptr
)
5582 for (; ptr
&& !ptr
->gcmarkbit
; ptr
= ptr
->next
)
5585 mark_object (ptr
->start
);
5586 mark_object (ptr
->end
);
5587 mark_object (ptr
->plist
);
5591 /* Mark Lisp_Objects and special pointers in BUFFER. */
5594 mark_buffer (struct buffer
*buffer
)
5596 /* This is handled much like other pseudovectors... */
5597 mark_vectorlike ((struct Lisp_Vector
*) buffer
);
5599 /* ...but there are some buffer-specific things. */
5601 MARK_INTERVAL_TREE (buffer_intervals (buffer
));
5603 /* For now, we just don't mark the undo_list. It's done later in
5604 a special way just before the sweep phase, and after stripping
5605 some of its elements that are not needed any more. */
5607 mark_overlay (buffer
->overlays_before
);
5608 mark_overlay (buffer
->overlays_after
);
5610 /* If this is an indirect buffer, mark its base buffer. */
5611 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5612 mark_buffer (buffer
->base_buffer
);
5615 /* Remove killed buffers or items whose car is a killed buffer from
5616 LIST, and mark other items. Return changed LIST, which is marked. */
5619 mark_discard_killed_buffers (Lisp_Object list
)
5621 Lisp_Object tail
, *prev
= &list
;
5623 for (tail
= list
; CONSP (tail
) && !CONS_MARKED_P (XCONS (tail
));
5626 Lisp_Object tem
= XCAR (tail
);
5629 if (BUFFERP (tem
) && !BUFFER_LIVE_P (XBUFFER (tem
)))
5630 *prev
= XCDR (tail
);
5633 CONS_MARK (XCONS (tail
));
5634 mark_object (XCAR (tail
));
5635 prev
= &XCDR_AS_LVALUE (tail
);
5642 /* Determine type of generic Lisp_Object and mark it accordingly. */
5645 mark_object (Lisp_Object arg
)
5647 register Lisp_Object obj
= arg
;
5648 #ifdef GC_CHECK_MARKED_OBJECTS
5652 ptrdiff_t cdr_count
= 0;
5656 if (PURE_POINTER_P (XPNTR (obj
)))
5659 last_marked
[last_marked_index
++] = obj
;
5660 if (last_marked_index
== LAST_MARKED_SIZE
)
5661 last_marked_index
= 0;
5663 /* Perform some sanity checks on the objects marked here. Abort if
5664 we encounter an object we know is bogus. This increases GC time
5665 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5666 #ifdef GC_CHECK_MARKED_OBJECTS
5668 po
= (void *) XPNTR (obj
);
5670 /* Check that the object pointed to by PO is known to be a Lisp
5671 structure allocated from the heap. */
5672 #define CHECK_ALLOCATED() \
5674 m = mem_find (po); \
5679 /* Check that the object pointed to by PO is live, using predicate
5681 #define CHECK_LIVE(LIVEP) \
5683 if (!LIVEP (m, po)) \
5687 /* Check both of the above conditions. */
5688 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5690 CHECK_ALLOCATED (); \
5691 CHECK_LIVE (LIVEP); \
5694 #else /* not GC_CHECK_MARKED_OBJECTS */
5696 #define CHECK_LIVE(LIVEP) (void) 0
5697 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5699 #endif /* not GC_CHECK_MARKED_OBJECTS */
5701 switch (XTYPE (obj
))
5705 register struct Lisp_String
*ptr
= XSTRING (obj
);
5706 if (STRING_MARKED_P (ptr
))
5708 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5710 MARK_INTERVAL_TREE (ptr
->intervals
);
5711 #ifdef GC_CHECK_STRING_BYTES
5712 /* Check that the string size recorded in the string is the
5713 same as the one recorded in the sdata structure. */
5715 #endif /* GC_CHECK_STRING_BYTES */
5719 case Lisp_Vectorlike
:
5721 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5722 register ptrdiff_t pvectype
;
5724 if (VECTOR_MARKED_P (ptr
))
5727 #ifdef GC_CHECK_MARKED_OBJECTS
5729 if (m
== MEM_NIL
&& !SUBRP (obj
))
5731 #endif /* GC_CHECK_MARKED_OBJECTS */
5733 if (ptr
->header
.size
& PSEUDOVECTOR_FLAG
)
5734 pvectype
= ((ptr
->header
.size
& PVEC_TYPE_MASK
)
5735 >> PSEUDOVECTOR_AREA_BITS
);
5737 pvectype
= PVEC_NORMAL_VECTOR
;
5739 if (pvectype
!= PVEC_SUBR
&& pvectype
!= PVEC_BUFFER
)
5740 CHECK_LIVE (live_vector_p
);
5745 #ifdef GC_CHECK_MARKED_OBJECTS
5754 #endif /* GC_CHECK_MARKED_OBJECTS */
5755 mark_buffer ((struct buffer
*) ptr
);
5759 { /* We could treat this just like a vector, but it is better
5760 to save the COMPILED_CONSTANTS element for last and avoid
5762 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5766 for (i
= 0; i
< size
; i
++)
5767 if (i
!= COMPILED_CONSTANTS
)
5768 mark_object (ptr
->contents
[i
]);
5769 if (size
> COMPILED_CONSTANTS
)
5771 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5778 mark_vectorlike (ptr
);
5779 mark_face_cache (((struct frame
*) ptr
)->face_cache
);
5784 struct window
*w
= (struct window
*) ptr
;
5785 bool leaf
= NILP (w
->hchild
) && NILP (w
->vchild
);
5787 mark_vectorlike (ptr
);
5789 /* Mark glyphs for leaf windows. Marking window
5790 matrices is sufficient because frame matrices
5791 use the same glyph memory. */
5792 if (leaf
&& w
->current_matrix
)
5794 mark_glyph_matrix (w
->current_matrix
);
5795 mark_glyph_matrix (w
->desired_matrix
);
5798 /* Filter out killed buffers from both buffer lists
5799 in attempt to help GC to reclaim killed buffers faster.
5800 We can do it elsewhere for live windows, but this is the
5801 best place to do it for dead windows. */
5803 (w
, mark_discard_killed_buffers (w
->prev_buffers
));
5805 (w
, mark_discard_killed_buffers (w
->next_buffers
));
5809 case PVEC_HASH_TABLE
:
5811 struct Lisp_Hash_Table
*h
= (struct Lisp_Hash_Table
*) ptr
;
5813 mark_vectorlike (ptr
);
5814 mark_object (h
->test
.name
);
5815 mark_object (h
->test
.user_hash_function
);
5816 mark_object (h
->test
.user_cmp_function
);
5817 /* If hash table is not weak, mark all keys and values.
5818 For weak tables, mark only the vector. */
5820 mark_object (h
->key_and_value
);
5822 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5826 case PVEC_CHAR_TABLE
:
5827 mark_char_table (ptr
);
5830 case PVEC_BOOL_VECTOR
:
5831 /* No Lisp_Objects to mark in a bool vector. */
5842 mark_vectorlike (ptr
);
5849 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5850 struct Lisp_Symbol
*ptrx
;
5854 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5856 mark_object (ptr
->function
);
5857 mark_object (ptr
->plist
);
5858 switch (ptr
->redirect
)
5860 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
5861 case SYMBOL_VARALIAS
:
5864 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
5868 case SYMBOL_LOCALIZED
:
5870 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
5871 Lisp_Object where
= blv
->where
;
5872 /* If the value is set up for a killed buffer or deleted
5873 frame, restore it's global binding. If the value is
5874 forwarded to a C variable, either it's not a Lisp_Object
5875 var, or it's staticpro'd already. */
5876 if ((BUFFERP (where
) && !BUFFER_LIVE_P (XBUFFER (where
)))
5877 || (FRAMEP (where
) && !FRAME_LIVE_P (XFRAME (where
))))
5878 swap_in_global_binding (ptr
);
5879 mark_object (blv
->where
);
5880 mark_object (blv
->valcell
);
5881 mark_object (blv
->defcell
);
5884 case SYMBOL_FORWARDED
:
5885 /* If the value is forwarded to a buffer or keyboard field,
5886 these are marked when we see the corresponding object.
5887 And if it's forwarded to a C variable, either it's not
5888 a Lisp_Object var, or it's staticpro'd already. */
5890 default: emacs_abort ();
5892 if (!PURE_POINTER_P (XSTRING (ptr
->name
)))
5893 MARK_STRING (XSTRING (ptr
->name
));
5894 MARK_INTERVAL_TREE (string_intervals (ptr
->name
));
5899 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun. */
5900 XSETSYMBOL (obj
, ptrx
);
5907 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5909 if (XMISCANY (obj
)->gcmarkbit
)
5912 switch (XMISCTYPE (obj
))
5914 case Lisp_Misc_Marker
:
5915 /* DO NOT mark thru the marker's chain.
5916 The buffer's markers chain does not preserve markers from gc;
5917 instead, markers are removed from the chain when freed by gc. */
5918 XMISCANY (obj
)->gcmarkbit
= 1;
5921 case Lisp_Misc_Save_Value
:
5922 XMISCANY (obj
)->gcmarkbit
= 1;
5925 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5926 /* If DOGC is set, POINTER is the address of a memory
5927 area containing INTEGER potential Lisp_Objects. */
5930 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5932 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5933 mark_maybe_object (*p
);
5939 case Lisp_Misc_Overlay
:
5940 mark_overlay (XOVERLAY (obj
));
5950 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5951 if (CONS_MARKED_P (ptr
))
5953 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5955 /* If the cdr is nil, avoid recursion for the car. */
5956 if (EQ (ptr
->u
.cdr
, Qnil
))
5962 mark_object (ptr
->car
);
5965 if (cdr_count
== mark_object_loop_halt
)
5971 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5972 FLOAT_MARK (XFLOAT (obj
));
5983 #undef CHECK_ALLOCATED
5984 #undef CHECK_ALLOCATED_AND_LIVE
5986 /* Mark the Lisp pointers in the terminal objects.
5987 Called by Fgarbage_collect. */
5990 mark_terminals (void)
5993 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5995 eassert (t
->name
!= NULL
);
5996 #ifdef HAVE_WINDOW_SYSTEM
5997 /* If a terminal object is reachable from a stacpro'ed object,
5998 it might have been marked already. Make sure the image cache
6000 mark_image_cache (t
->image_cache
);
6001 #endif /* HAVE_WINDOW_SYSTEM */
6002 if (!VECTOR_MARKED_P (t
))
6003 mark_vectorlike ((struct Lisp_Vector
*)t
);
6009 /* Value is non-zero if OBJ will survive the current GC because it's
6010 either marked or does not need to be marked to survive. */
6013 survives_gc_p (Lisp_Object obj
)
6017 switch (XTYPE (obj
))
6024 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
6028 survives_p
= XMISCANY (obj
)->gcmarkbit
;
6032 survives_p
= STRING_MARKED_P (XSTRING (obj
));
6035 case Lisp_Vectorlike
:
6036 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
6040 survives_p
= CONS_MARKED_P (XCONS (obj
));
6044 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
6051 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
6056 /* Sweep: find all structures not marked, and free them. */
6061 /* Remove or mark entries in weak hash tables.
6062 This must be done before any object is unmarked. */
6063 sweep_weak_hash_tables ();
6066 check_string_bytes (!noninteractive
);
6068 /* Put all unmarked conses on free list */
6070 register struct cons_block
*cblk
;
6071 struct cons_block
**cprev
= &cons_block
;
6072 register int lim
= cons_block_index
;
6073 EMACS_INT num_free
= 0, num_used
= 0;
6077 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
6081 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
6083 /* Scan the mark bits an int at a time. */
6084 for (i
= 0; i
< ilim
; i
++)
6086 if (cblk
->gcmarkbits
[i
] == -1)
6088 /* Fast path - all cons cells for this int are marked. */
6089 cblk
->gcmarkbits
[i
] = 0;
6090 num_used
+= BITS_PER_INT
;
6094 /* Some cons cells for this int are not marked.
6095 Find which ones, and free them. */
6096 int start
, pos
, stop
;
6098 start
= i
* BITS_PER_INT
;
6100 if (stop
> BITS_PER_INT
)
6101 stop
= BITS_PER_INT
;
6104 for (pos
= start
; pos
< stop
; pos
++)
6106 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
6109 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
6110 cons_free_list
= &cblk
->conses
[pos
];
6112 cons_free_list
->car
= Vdead
;
6118 CONS_UNMARK (&cblk
->conses
[pos
]);
6124 lim
= CONS_BLOCK_SIZE
;
6125 /* If this block contains only free conses and we have already
6126 seen more than two blocks worth of free conses then deallocate
6128 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
6130 *cprev
= cblk
->next
;
6131 /* Unhook from the free list. */
6132 cons_free_list
= cblk
->conses
[0].u
.chain
;
6133 lisp_align_free (cblk
);
6137 num_free
+= this_free
;
6138 cprev
= &cblk
->next
;
6141 total_conses
= num_used
;
6142 total_free_conses
= num_free
;
6145 /* Put all unmarked floats on free list */
6147 register struct float_block
*fblk
;
6148 struct float_block
**fprev
= &float_block
;
6149 register int lim
= float_block_index
;
6150 EMACS_INT num_free
= 0, num_used
= 0;
6152 float_free_list
= 0;
6154 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
6158 for (i
= 0; i
< lim
; i
++)
6159 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
6162 fblk
->floats
[i
].u
.chain
= float_free_list
;
6163 float_free_list
= &fblk
->floats
[i
];
6168 FLOAT_UNMARK (&fblk
->floats
[i
]);
6170 lim
= FLOAT_BLOCK_SIZE
;
6171 /* If this block contains only free floats and we have already
6172 seen more than two blocks worth of free floats then deallocate
6174 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
6176 *fprev
= fblk
->next
;
6177 /* Unhook from the free list. */
6178 float_free_list
= fblk
->floats
[0].u
.chain
;
6179 lisp_align_free (fblk
);
6183 num_free
+= this_free
;
6184 fprev
= &fblk
->next
;
6187 total_floats
= num_used
;
6188 total_free_floats
= num_free
;
6191 /* Put all unmarked intervals on free list */
6193 register struct interval_block
*iblk
;
6194 struct interval_block
**iprev
= &interval_block
;
6195 register int lim
= interval_block_index
;
6196 EMACS_INT num_free
= 0, num_used
= 0;
6198 interval_free_list
= 0;
6200 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
6205 for (i
= 0; i
< lim
; i
++)
6207 if (!iblk
->intervals
[i
].gcmarkbit
)
6209 set_interval_parent (&iblk
->intervals
[i
], interval_free_list
);
6210 interval_free_list
= &iblk
->intervals
[i
];
6216 iblk
->intervals
[i
].gcmarkbit
= 0;
6219 lim
= INTERVAL_BLOCK_SIZE
;
6220 /* If this block contains only free intervals and we have already
6221 seen more than two blocks worth of free intervals then
6222 deallocate this block. */
6223 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
6225 *iprev
= iblk
->next
;
6226 /* Unhook from the free list. */
6227 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
6232 num_free
+= this_free
;
6233 iprev
= &iblk
->next
;
6236 total_intervals
= num_used
;
6237 total_free_intervals
= num_free
;
6240 /* Put all unmarked symbols on free list */
6242 register struct symbol_block
*sblk
;
6243 struct symbol_block
**sprev
= &symbol_block
;
6244 register int lim
= symbol_block_index
;
6245 EMACS_INT num_free
= 0, num_used
= 0;
6247 symbol_free_list
= NULL
;
6249 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
6252 union aligned_Lisp_Symbol
*sym
= sblk
->symbols
;
6253 union aligned_Lisp_Symbol
*end
= sym
+ lim
;
6255 for (; sym
< end
; ++sym
)
6257 /* Check if the symbol was created during loadup. In such a case
6258 it might be pointed to by pure bytecode which we don't trace,
6259 so we conservatively assume that it is live. */
6260 bool pure_p
= PURE_POINTER_P (XSTRING (sym
->s
.name
));
6262 if (!sym
->s
.gcmarkbit
&& !pure_p
)
6264 if (sym
->s
.redirect
== SYMBOL_LOCALIZED
)
6265 xfree (SYMBOL_BLV (&sym
->s
));
6266 sym
->s
.next
= symbol_free_list
;
6267 symbol_free_list
= &sym
->s
;
6269 symbol_free_list
->function
= Vdead
;
6277 UNMARK_STRING (XSTRING (sym
->s
.name
));
6278 sym
->s
.gcmarkbit
= 0;
6282 lim
= SYMBOL_BLOCK_SIZE
;
6283 /* If this block contains only free symbols and we have already
6284 seen more than two blocks worth of free symbols then deallocate
6286 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6288 *sprev
= sblk
->next
;
6289 /* Unhook from the free list. */
6290 symbol_free_list
= sblk
->symbols
[0].s
.next
;
6295 num_free
+= this_free
;
6296 sprev
= &sblk
->next
;
6299 total_symbols
= num_used
;
6300 total_free_symbols
= num_free
;
6303 /* Put all unmarked misc's on free list.
6304 For a marker, first unchain it from the buffer it points into. */
6306 register struct marker_block
*mblk
;
6307 struct marker_block
**mprev
= &marker_block
;
6308 register int lim
= marker_block_index
;
6309 EMACS_INT num_free
= 0, num_used
= 0;
6311 marker_free_list
= 0;
6313 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6318 for (i
= 0; i
< lim
; i
++)
6320 if (!mblk
->markers
[i
].m
.u_any
.gcmarkbit
)
6322 if (mblk
->markers
[i
].m
.u_any
.type
== Lisp_Misc_Marker
)
6323 unchain_marker (&mblk
->markers
[i
].m
.u_marker
);
6324 /* Set the type of the freed object to Lisp_Misc_Free.
6325 We could leave the type alone, since nobody checks it,
6326 but this might catch bugs faster. */
6327 mblk
->markers
[i
].m
.u_marker
.type
= Lisp_Misc_Free
;
6328 mblk
->markers
[i
].m
.u_free
.chain
= marker_free_list
;
6329 marker_free_list
= &mblk
->markers
[i
].m
;
6335 mblk
->markers
[i
].m
.u_any
.gcmarkbit
= 0;
6338 lim
= MARKER_BLOCK_SIZE
;
6339 /* If this block contains only free markers and we have already
6340 seen more than two blocks worth of free markers then deallocate
6342 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6344 *mprev
= mblk
->next
;
6345 /* Unhook from the free list. */
6346 marker_free_list
= mblk
->markers
[0].m
.u_free
.chain
;
6351 num_free
+= this_free
;
6352 mprev
= &mblk
->next
;
6356 total_markers
= num_used
;
6357 total_free_markers
= num_free
;
6360 /* Free all unmarked buffers */
6362 register struct buffer
*buffer
, **bprev
= &all_buffers
;
6365 for (buffer
= all_buffers
; buffer
; buffer
= *bprev
)
6366 if (!VECTOR_MARKED_P (buffer
))
6368 *bprev
= buffer
->next
;
6373 VECTOR_UNMARK (buffer
);
6374 /* Do not use buffer_(set|get)_intervals here. */
6375 buffer
->text
->intervals
= balance_intervals (buffer
->text
->intervals
);
6377 bprev
= &buffer
->next
;
6382 check_string_bytes (!noninteractive
);
6388 /* Debugging aids. */
6390 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6391 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6392 This may be helpful in debugging Emacs's memory usage.
6393 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6398 XSETINT (end
, (intptr_t) (char *) sbrk (0) / 1024);
6403 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6404 doc
: /* Return a list of counters that measure how much consing there has been.
6405 Each of these counters increments for a certain kind of object.
6406 The counters wrap around from the largest positive integer to zero.
6407 Garbage collection does not decrease them.
6408 The elements of the value are as follows:
6409 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6410 All are in units of 1 = one object consed
6411 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6413 MISCS include overlays, markers, and some internal types.
6414 Frames, windows, buffers, and subprocesses count as vectors
6415 (but the contents of a buffer's text do not count here). */)
6418 return listn (CONSTYPE_HEAP
, 8,
6419 bounded_number (cons_cells_consed
),
6420 bounded_number (floats_consed
),
6421 bounded_number (vector_cells_consed
),
6422 bounded_number (symbols_consed
),
6423 bounded_number (string_chars_consed
),
6424 bounded_number (misc_objects_consed
),
6425 bounded_number (intervals_consed
),
6426 bounded_number (strings_consed
));
6429 /* Find at most FIND_MAX symbols which have OBJ as their value or
6430 function. This is used in gdbinit's `xwhichsymbols' command. */
6433 which_symbols (Lisp_Object obj
, EMACS_INT find_max
)
6435 struct symbol_block
*sblk
;
6436 ptrdiff_t gc_count
= inhibit_garbage_collection ();
6437 Lisp_Object found
= Qnil
;
6441 for (sblk
= symbol_block
; sblk
; sblk
= sblk
->next
)
6443 union aligned_Lisp_Symbol
*aligned_sym
= sblk
->symbols
;
6446 for (bn
= 0; bn
< SYMBOL_BLOCK_SIZE
; bn
++, aligned_sym
++)
6448 struct Lisp_Symbol
*sym
= &aligned_sym
->s
;
6452 if (sblk
== symbol_block
&& bn
>= symbol_block_index
)
6455 XSETSYMBOL (tem
, sym
);
6456 val
= find_symbol_value (tem
);
6458 || EQ (sym
->function
, obj
)
6459 || (!NILP (sym
->function
)
6460 && COMPILEDP (sym
->function
)
6461 && EQ (AREF (sym
->function
, COMPILED_BYTECODE
), obj
))
6464 && EQ (AREF (val
, COMPILED_BYTECODE
), obj
)))
6466 found
= Fcons (tem
, found
);
6467 if (--find_max
== 0)
6475 unbind_to (gc_count
, Qnil
);
6479 #ifdef ENABLE_CHECKING
6481 bool suppress_checking
;
6484 die (const char *msg
, const char *file
, int line
)
6486 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6488 terminate_due_to_signal (SIGABRT
, INT_MAX
);
6492 /* Initialization */
6495 init_alloc_once (void)
6497 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6499 pure_size
= PURESIZE
;
6501 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6503 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6506 #ifdef DOUG_LEA_MALLOC
6507 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6508 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6509 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6514 refill_memory_reserve ();
6515 gc_cons_threshold
= GC_DEFAULT_THRESHOLD
;
6522 byte_stack_list
= 0;
6524 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6525 setjmp_tested_p
= longjmps_done
= 0;
6528 Vgc_elapsed
= make_float (0.0);
6533 syms_of_alloc (void)
6535 DEFVAR_INT ("gc-cons-threshold", gc_cons_threshold
,
6536 doc
: /* Number of bytes of consing between garbage collections.
6537 Garbage collection can happen automatically once this many bytes have been
6538 allocated since the last garbage collection. All data types count.
6540 Garbage collection happens automatically only when `eval' is called.
6542 By binding this temporarily to a large number, you can effectively
6543 prevent garbage collection during a part of the program.
6544 See also `gc-cons-percentage'. */);
6546 DEFVAR_LISP ("gc-cons-percentage", Vgc_cons_percentage
,
6547 doc
: /* Portion of the heap used for allocation.
6548 Garbage collection can happen automatically once this portion of the heap
6549 has been allocated since the last garbage collection.
6550 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6551 Vgc_cons_percentage
= make_float (0.1);
6553 DEFVAR_INT ("pure-bytes-used", pure_bytes_used
,
6554 doc
: /* Number of bytes of shareable Lisp data allocated so far. */);
6556 DEFVAR_INT ("cons-cells-consed", cons_cells_consed
,
6557 doc
: /* Number of cons cells that have been consed so far. */);
6559 DEFVAR_INT ("floats-consed", floats_consed
,
6560 doc
: /* Number of floats that have been consed so far. */);
6562 DEFVAR_INT ("vector-cells-consed", vector_cells_consed
,
6563 doc
: /* Number of vector cells that have been consed so far. */);
6565 DEFVAR_INT ("symbols-consed", symbols_consed
,
6566 doc
: /* Number of symbols that have been consed so far. */);
6568 DEFVAR_INT ("string-chars-consed", string_chars_consed
,
6569 doc
: /* Number of string characters that have been consed so far. */);
6571 DEFVAR_INT ("misc-objects-consed", misc_objects_consed
,
6572 doc
: /* Number of miscellaneous objects that have been consed so far.
6573 These include markers and overlays, plus certain objects not visible
6576 DEFVAR_INT ("intervals-consed", intervals_consed
,
6577 doc
: /* Number of intervals that have been consed so far. */);
6579 DEFVAR_INT ("strings-consed", strings_consed
,
6580 doc
: /* Number of strings that have been consed so far. */);
6582 DEFVAR_LISP ("purify-flag", Vpurify_flag
,
6583 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6584 This means that certain objects should be allocated in shared (pure) space.
6585 It can also be set to a hash-table, in which case this table is used to
6586 do hash-consing of the objects allocated to pure space. */);
6588 DEFVAR_BOOL ("garbage-collection-messages", garbage_collection_messages
,
6589 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6590 garbage_collection_messages
= 0;
6592 DEFVAR_LISP ("post-gc-hook", Vpost_gc_hook
,
6593 doc
: /* Hook run after garbage collection has finished. */);
6594 Vpost_gc_hook
= Qnil
;
6595 DEFSYM (Qpost_gc_hook
, "post-gc-hook");
6597 DEFVAR_LISP ("memory-signal-data", Vmemory_signal_data
,
6598 doc
: /* Precomputed `signal' argument for memory-full error. */);
6599 /* We build this in advance because if we wait until we need it, we might
6600 not be able to allocate the memory to hold it. */
6602 = listn (CONSTYPE_PURE
, 2, Qerror
,
6603 build_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
6605 DEFVAR_LISP ("memory-full", Vmemory_full
,
6606 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6607 Vmemory_full
= Qnil
;
6609 DEFSYM (Qconses
, "conses");
6610 DEFSYM (Qsymbols
, "symbols");
6611 DEFSYM (Qmiscs
, "miscs");
6612 DEFSYM (Qstrings
, "strings");
6613 DEFSYM (Qvectors
, "vectors");
6614 DEFSYM (Qfloats
, "floats");
6615 DEFSYM (Qintervals
, "intervals");
6616 DEFSYM (Qbuffers
, "buffers");
6617 DEFSYM (Qstring_bytes
, "string-bytes");
6618 DEFSYM (Qvector_slots
, "vector-slots");
6619 DEFSYM (Qheap
, "heap");
6620 DEFSYM (Qautomatic_gc
, "Automatic GC");
6622 DEFSYM (Qgc_cons_threshold
, "gc-cons-threshold");
6623 DEFSYM (Qchar_table_extra_slots
, "char-table-extra-slots");
6625 DEFVAR_LISP ("gc-elapsed", Vgc_elapsed
,
6626 doc
: /* Accumulated time elapsed in garbage collections.
6627 The time is in seconds as a floating point value. */);
6628 DEFVAR_INT ("gcs-done", gcs_done
,
6629 doc
: /* Accumulated number of garbage collections done. */);
6634 defsubr (&Smake_byte_code
);
6635 defsubr (&Smake_list
);
6636 defsubr (&Smake_vector
);
6637 defsubr (&Smake_string
);
6638 defsubr (&Smake_bool_vector
);
6639 defsubr (&Smake_symbol
);
6640 defsubr (&Smake_marker
);
6641 defsubr (&Spurecopy
);
6642 defsubr (&Sgarbage_collect
);
6643 defsubr (&Smemory_limit
);
6644 defsubr (&Smemory_use_counts
);
6646 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6647 defsubr (&Sgc_status
);
6651 /* When compiled with GCC, GDB might say "No enum type named
6652 pvec_type" if we don't have at least one symbol with that type, and
6653 then xbacktrace could fail. Similarly for the other enums and
6654 their values. Some non-GCC compilers don't like these constructs. */
6658 enum CHARTAB_SIZE_BITS CHARTAB_SIZE_BITS
;
6659 enum CHAR_TABLE_STANDARD_SLOTS CHAR_TABLE_STANDARD_SLOTS
;
6660 enum char_bits char_bits
;
6661 enum CHECK_LISP_OBJECT_TYPE CHECK_LISP_OBJECT_TYPE
;
6662 enum DEFAULT_HASH_SIZE DEFAULT_HASH_SIZE
;
6663 enum enum_USE_LSB_TAG enum_USE_LSB_TAG
;
6664 enum FLOAT_TO_STRING_BUFSIZE FLOAT_TO_STRING_BUFSIZE
;
6665 enum Lisp_Bits Lisp_Bits
;
6666 enum Lisp_Compiled Lisp_Compiled
;
6667 enum maxargs maxargs
;
6668 enum MAX_ALLOCA MAX_ALLOCA
;
6669 enum More_Lisp_Bits More_Lisp_Bits
;
6670 enum pvec_type pvec_type
;
6672 enum lsb_bits lsb_bits
;
6674 } const EXTERNALLY_VISIBLE gdb_make_enums_visible
= {0};
6675 #endif /* __GNUC__ */