1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
3 Copyright (C) 1985-1986, 1988, 1993-1995, 1997-2013 Free Software
6 This file is part of GNU Emacs.
8 GNU Emacs is free software: you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation, either version 3 of the License, or
11 (at your option) any later version.
13 GNU Emacs is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>. */
23 #define LISP_INLINE EXTERN_INLINE
26 #include <limits.h> /* For CHAR_BIT. */
28 #ifdef ENABLE_CHECKING
29 #include <signal.h> /* For SIGABRT. */
38 #include "intervals.h"
40 #include "character.h"
45 #include "blockinput.h"
46 #include "termhooks.h" /* For struct terminal. */
50 /* GC_CHECK_MARKED_OBJECTS means do sanity checks on allocated objects.
51 Doable only if GC_MARK_STACK. */
53 # undef GC_CHECK_MARKED_OBJECTS
56 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
57 memory. Can do this only if using gmalloc.c and if not checking
60 #if (defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC \
61 || defined GC_CHECK_MARKED_OBJECTS)
62 #undef GC_MALLOC_CHECK
73 #include "w32heap.h" /* for sbrk */
76 #ifdef DOUG_LEA_MALLOC
80 /* Specify maximum number of areas to mmap. It would be nice to use a
81 value that explicitly means "no limit". */
83 #define MMAP_MAX_AREAS 100000000
85 #endif /* not DOUG_LEA_MALLOC */
87 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
88 to a struct Lisp_String. */
90 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
91 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
92 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
94 #define VECTOR_MARK(V) ((V)->header.size |= ARRAY_MARK_FLAG)
95 #define VECTOR_UNMARK(V) ((V)->header.size &= ~ARRAY_MARK_FLAG)
96 #define VECTOR_MARKED_P(V) (((V)->header.size & ARRAY_MARK_FLAG) != 0)
98 /* Default value of gc_cons_threshold (see below). */
100 #define GC_DEFAULT_THRESHOLD (100000 * word_size)
102 /* Global variables. */
103 struct emacs_globals globals
;
105 /* Number of bytes of consing done since the last gc. */
107 EMACS_INT consing_since_gc
;
109 /* Similar minimum, computed from Vgc_cons_percentage. */
111 EMACS_INT gc_relative_threshold
;
113 /* Minimum number of bytes of consing since GC before next GC,
114 when memory is full. */
116 EMACS_INT memory_full_cons_threshold
;
118 /* True during GC. */
122 /* True means abort if try to GC.
123 This is for code which is written on the assumption that
124 no GC will happen, so as to verify that assumption. */
128 /* Number of live and free conses etc. */
130 static EMACS_INT total_conses
, total_markers
, total_symbols
, total_buffers
;
131 static EMACS_INT total_free_conses
, total_free_markers
, total_free_symbols
;
132 static EMACS_INT total_free_floats
, total_floats
;
134 /* Points to memory space allocated as "spare", to be freed if we run
135 out of memory. We keep one large block, four cons-blocks, and
136 two string blocks. */
138 static char *spare_memory
[7];
140 /* Amount of spare memory to keep in large reserve block, or to see
141 whether this much is available when malloc fails on a larger request. */
143 #define SPARE_MEMORY (1 << 14)
145 /* Initialize it to a nonzero value to force it into data space
146 (rather than bss space). That way unexec will remap it into text
147 space (pure), on some systems. We have not implemented the
148 remapping on more recent systems because this is less important
149 nowadays than in the days of small memories and timesharing. */
151 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
152 #define PUREBEG (char *) pure
154 /* Pointer to the pure area, and its size. */
156 static char *purebeg
;
157 static ptrdiff_t pure_size
;
159 /* Number of bytes of pure storage used before pure storage overflowed.
160 If this is non-zero, this implies that an overflow occurred. */
162 static ptrdiff_t pure_bytes_used_before_overflow
;
164 /* True if P points into pure space. */
166 #define PURE_POINTER_P(P) \
167 ((uintptr_t) (P) - (uintptr_t) purebeg <= pure_size)
169 /* Index in pure at which next pure Lisp object will be allocated.. */
171 static ptrdiff_t pure_bytes_used_lisp
;
173 /* Number of bytes allocated for non-Lisp objects in pure storage. */
175 static ptrdiff_t pure_bytes_used_non_lisp
;
177 /* If nonzero, this is a warning delivered by malloc and not yet
180 const char *pending_malloc_warning
;
182 /* Maximum amount of C stack to save when a GC happens. */
184 #ifndef MAX_SAVE_STACK
185 #define MAX_SAVE_STACK 16000
188 /* Buffer in which we save a copy of the C stack at each GC. */
190 #if MAX_SAVE_STACK > 0
191 static char *stack_copy
;
192 static ptrdiff_t stack_copy_size
;
195 static Lisp_Object Qconses
;
196 static Lisp_Object Qsymbols
;
197 static Lisp_Object Qmiscs
;
198 static Lisp_Object Qstrings
;
199 static Lisp_Object Qvectors
;
200 static Lisp_Object Qfloats
;
201 static Lisp_Object Qintervals
;
202 static Lisp_Object Qbuffers
;
203 static Lisp_Object Qstring_bytes
, Qvector_slots
, Qheap
;
204 static Lisp_Object Qgc_cons_threshold
;
205 Lisp_Object Qautomatic_gc
;
206 Lisp_Object Qchar_table_extra_slots
;
208 /* Hook run after GC has finished. */
210 static Lisp_Object Qpost_gc_hook
;
212 static void mark_terminals (void);
213 static void gc_sweep (void);
214 static Lisp_Object
make_pure_vector (ptrdiff_t);
215 static void mark_buffer (struct buffer
*);
217 #if !defined REL_ALLOC || defined SYSTEM_MALLOC
218 static void refill_memory_reserve (void);
220 static void compact_small_strings (void);
221 static void free_large_strings (void);
222 extern Lisp_Object
which_symbols (Lisp_Object
, EMACS_INT
) EXTERNALLY_VISIBLE
;
224 /* When scanning the C stack for live Lisp objects, Emacs keeps track of
225 what memory allocated via lisp_malloc and lisp_align_malloc is intended
226 for what purpose. This enumeration specifies the type of memory. */
237 /* Since all non-bool pseudovectors are small enough to be
238 allocated from vector blocks, this memory type denotes
239 large regular vectors and large bool pseudovectors. */
241 /* Special type to denote vector blocks. */
242 MEM_TYPE_VECTOR_BLOCK
,
243 /* Special type to denote reserved memory. */
247 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
249 /* A unique object in pure space used to make some Lisp objects
250 on free lists recognizable in O(1). */
252 static Lisp_Object Vdead
;
253 #define DEADP(x) EQ (x, Vdead)
255 #ifdef GC_MALLOC_CHECK
257 enum mem_type allocated_mem_type
;
259 #endif /* GC_MALLOC_CHECK */
261 /* A node in the red-black tree describing allocated memory containing
262 Lisp data. Each such block is recorded with its start and end
263 address when it is allocated, and removed from the tree when it
266 A red-black tree is a balanced binary tree with the following
269 1. Every node is either red or black.
270 2. Every leaf is black.
271 3. If a node is red, then both of its children are black.
272 4. Every simple path from a node to a descendant leaf contains
273 the same number of black nodes.
274 5. The root is always black.
276 When nodes are inserted into the tree, or deleted from the tree,
277 the tree is "fixed" so that these properties are always true.
279 A red-black tree with N internal nodes has height at most 2
280 log(N+1). Searches, insertions and deletions are done in O(log N).
281 Please see a text book about data structures for a detailed
282 description of red-black trees. Any book worth its salt should
287 /* Children of this node. These pointers are never NULL. When there
288 is no child, the value is MEM_NIL, which points to a dummy node. */
289 struct mem_node
*left
, *right
;
291 /* The parent of this node. In the root node, this is NULL. */
292 struct mem_node
*parent
;
294 /* Start and end of allocated region. */
298 enum {MEM_BLACK
, MEM_RED
} color
;
304 /* Base address of stack. Set in main. */
306 Lisp_Object
*stack_base
;
308 /* Root of the tree describing allocated Lisp memory. */
310 static struct mem_node
*mem_root
;
312 /* Lowest and highest known address in the heap. */
314 static void *min_heap_address
, *max_heap_address
;
316 /* Sentinel node of the tree. */
318 static struct mem_node mem_z
;
319 #define MEM_NIL &mem_z
321 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
322 static struct mem_node
*mem_insert (void *, void *, enum mem_type
);
323 static void mem_insert_fixup (struct mem_node
*);
324 static void mem_rotate_left (struct mem_node
*);
325 static void mem_rotate_right (struct mem_node
*);
326 static void mem_delete (struct mem_node
*);
327 static void mem_delete_fixup (struct mem_node
*);
328 static struct mem_node
*mem_find (void *);
331 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
337 /* Recording what needs to be marked for gc. */
339 struct gcpro
*gcprolist
;
341 /* Addresses of staticpro'd variables. Initialize it to a nonzero
342 value; otherwise some compilers put it into BSS. */
344 #define NSTATICS 0x800
345 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
347 /* Index of next unused slot in staticvec. */
349 static int staticidx
;
351 static void *pure_alloc (size_t, int);
354 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
355 ALIGNMENT must be a power of 2. */
357 #define ALIGN(ptr, ALIGNMENT) \
358 ((void *) (((uintptr_t) (ptr) + (ALIGNMENT) - 1) \
359 & ~ ((ALIGNMENT) - 1)))
362 XFLOAT_INIT (Lisp_Object f
, double n
)
364 XFLOAT (f
)->u
.data
= n
;
368 /************************************************************************
370 ************************************************************************/
372 /* Function malloc calls this if it finds we are near exhausting storage. */
375 malloc_warning (const char *str
)
377 pending_malloc_warning
= str
;
381 /* Display an already-pending malloc warning. */
384 display_malloc_warning (void)
386 call3 (intern ("display-warning"),
388 build_string (pending_malloc_warning
),
389 intern ("emergency"));
390 pending_malloc_warning
= 0;
393 /* Called if we can't allocate relocatable space for a buffer. */
396 buffer_memory_full (ptrdiff_t nbytes
)
398 /* If buffers use the relocating allocator, no need to free
399 spare_memory, because we may have plenty of malloc space left
400 that we could get, and if we don't, the malloc that fails will
401 itself cause spare_memory to be freed. If buffers don't use the
402 relocating allocator, treat this like any other failing
406 memory_full (nbytes
);
408 /* This used to call error, but if we've run out of memory, we could
409 get infinite recursion trying to build the string. */
410 xsignal (Qnil
, Vmemory_signal_data
);
414 /* A common multiple of the positive integers A and B. Ideally this
415 would be the least common multiple, but there's no way to do that
416 as a constant expression in C, so do the best that we can easily do. */
417 #define COMMON_MULTIPLE(a, b) \
418 ((a) % (b) == 0 ? (a) : (b) % (a) == 0 ? (b) : (a) * (b))
420 #ifndef XMALLOC_OVERRUN_CHECK
421 #define XMALLOC_OVERRUN_CHECK_OVERHEAD 0
424 /* Check for overrun in malloc'ed buffers by wrapping a header and trailer
427 The header consists of XMALLOC_OVERRUN_CHECK_SIZE fixed bytes
428 followed by XMALLOC_OVERRUN_SIZE_SIZE bytes containing the original
429 block size in little-endian order. The trailer consists of
430 XMALLOC_OVERRUN_CHECK_SIZE fixed bytes.
432 The header is used to detect whether this block has been allocated
433 through these functions, as some low-level libc functions may
434 bypass the malloc hooks. */
436 #define XMALLOC_OVERRUN_CHECK_SIZE 16
437 #define XMALLOC_OVERRUN_CHECK_OVERHEAD \
438 (2 * XMALLOC_OVERRUN_CHECK_SIZE + XMALLOC_OVERRUN_SIZE_SIZE)
440 /* Define XMALLOC_OVERRUN_SIZE_SIZE so that (1) it's large enough to
441 hold a size_t value and (2) the header size is a multiple of the
442 alignment that Emacs needs for C types and for USE_LSB_TAG. */
443 #define XMALLOC_BASE_ALIGNMENT \
444 alignof (union { long double d; intmax_t i; void *p; })
447 # define XMALLOC_HEADER_ALIGNMENT \
448 COMMON_MULTIPLE (GCALIGNMENT, XMALLOC_BASE_ALIGNMENT)
450 # define XMALLOC_HEADER_ALIGNMENT XMALLOC_BASE_ALIGNMENT
452 #define XMALLOC_OVERRUN_SIZE_SIZE \
453 (((XMALLOC_OVERRUN_CHECK_SIZE + sizeof (size_t) \
454 + XMALLOC_HEADER_ALIGNMENT - 1) \
455 / XMALLOC_HEADER_ALIGNMENT * XMALLOC_HEADER_ALIGNMENT) \
456 - XMALLOC_OVERRUN_CHECK_SIZE)
458 static char const xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
] =
459 { '\x9a', '\x9b', '\xae', '\xaf',
460 '\xbf', '\xbe', '\xce', '\xcf',
461 '\xea', '\xeb', '\xec', '\xed',
462 '\xdf', '\xde', '\x9c', '\x9d' };
464 static char const xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
465 { '\xaa', '\xab', '\xac', '\xad',
466 '\xba', '\xbb', '\xbc', '\xbd',
467 '\xca', '\xcb', '\xcc', '\xcd',
468 '\xda', '\xdb', '\xdc', '\xdd' };
470 /* Insert and extract the block size in the header. */
473 xmalloc_put_size (unsigned char *ptr
, size_t size
)
476 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
478 *--ptr
= size
& ((1 << CHAR_BIT
) - 1);
484 xmalloc_get_size (unsigned char *ptr
)
488 ptr
-= XMALLOC_OVERRUN_SIZE_SIZE
;
489 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
498 /* Like malloc, but wraps allocated block with header and trailer. */
501 overrun_check_malloc (size_t size
)
503 register unsigned char *val
;
504 if (SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
< size
)
507 val
= malloc (size
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
510 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
511 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
512 xmalloc_put_size (val
, size
);
513 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
514 XMALLOC_OVERRUN_CHECK_SIZE
);
520 /* Like realloc, but checks old block for overrun, and wraps new block
521 with header and trailer. */
524 overrun_check_realloc (void *block
, size_t size
)
526 register unsigned char *val
= (unsigned char *) block
;
527 if (SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
< size
)
531 && memcmp (xmalloc_overrun_check_header
,
532 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
533 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
535 size_t osize
= xmalloc_get_size (val
);
536 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
537 XMALLOC_OVERRUN_CHECK_SIZE
))
539 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
540 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
541 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
544 val
= realloc (val
, size
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
548 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
549 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
550 xmalloc_put_size (val
, size
);
551 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
552 XMALLOC_OVERRUN_CHECK_SIZE
);
557 /* Like free, but checks block for overrun. */
560 overrun_check_free (void *block
)
562 unsigned char *val
= (unsigned char *) block
;
565 && memcmp (xmalloc_overrun_check_header
,
566 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
567 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
569 size_t osize
= xmalloc_get_size (val
);
570 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
571 XMALLOC_OVERRUN_CHECK_SIZE
))
573 #ifdef XMALLOC_CLEAR_FREE_MEMORY
574 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
575 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
577 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
578 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
579 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
589 #define malloc overrun_check_malloc
590 #define realloc overrun_check_realloc
591 #define free overrun_check_free
594 /* If compiled with XMALLOC_BLOCK_INPUT_CHECK, define a symbol
595 BLOCK_INPUT_IN_MEMORY_ALLOCATORS that is visible to the debugger.
596 If that variable is set, block input while in one of Emacs's memory
597 allocation functions. There should be no need for this debugging
598 option, since signal handlers do not allocate memory, but Emacs
599 formerly allocated memory in signal handlers and this compile-time
600 option remains as a way to help debug the issue should it rear its
602 #ifdef XMALLOC_BLOCK_INPUT_CHECK
603 bool block_input_in_memory_allocators EXTERNALLY_VISIBLE
;
605 malloc_block_input (void)
607 if (block_input_in_memory_allocators
)
611 malloc_unblock_input (void)
613 if (block_input_in_memory_allocators
)
616 # define MALLOC_BLOCK_INPUT malloc_block_input ()
617 # define MALLOC_UNBLOCK_INPUT malloc_unblock_input ()
619 # define MALLOC_BLOCK_INPUT ((void) 0)
620 # define MALLOC_UNBLOCK_INPUT ((void) 0)
623 #define MALLOC_PROBE(size) \
625 if (profiler_memory_running) \
626 malloc_probe (size); \
630 /* Like malloc but check for no memory and block interrupt input.. */
633 xmalloc (size_t size
)
639 MALLOC_UNBLOCK_INPUT
;
647 /* Like the above, but zeroes out the memory just allocated. */
650 xzalloc (size_t size
)
656 MALLOC_UNBLOCK_INPUT
;
660 memset (val
, 0, size
);
665 /* Like realloc but check for no memory and block interrupt input.. */
668 xrealloc (void *block
, size_t size
)
673 /* We must call malloc explicitly when BLOCK is 0, since some
674 reallocs don't do this. */
678 val
= realloc (block
, size
);
679 MALLOC_UNBLOCK_INPUT
;
688 /* Like free but block interrupt input. */
697 MALLOC_UNBLOCK_INPUT
;
698 /* We don't call refill_memory_reserve here
699 because in practice the call in r_alloc_free seems to suffice. */
703 /* Other parts of Emacs pass large int values to allocator functions
704 expecting ptrdiff_t. This is portable in practice, but check it to
706 verify (INT_MAX
<= PTRDIFF_MAX
);
709 /* Allocate an array of NITEMS items, each of size ITEM_SIZE.
710 Signal an error on memory exhaustion, and block interrupt input. */
713 xnmalloc (ptrdiff_t nitems
, ptrdiff_t item_size
)
715 eassert (0 <= nitems
&& 0 < item_size
);
716 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
717 memory_full (SIZE_MAX
);
718 return xmalloc (nitems
* item_size
);
722 /* Reallocate an array PA to make it of NITEMS items, each of size ITEM_SIZE.
723 Signal an error on memory exhaustion, and block interrupt input. */
726 xnrealloc (void *pa
, ptrdiff_t nitems
, ptrdiff_t item_size
)
728 eassert (0 <= nitems
&& 0 < item_size
);
729 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
730 memory_full (SIZE_MAX
);
731 return xrealloc (pa
, nitems
* item_size
);
735 /* Grow PA, which points to an array of *NITEMS items, and return the
736 location of the reallocated array, updating *NITEMS to reflect its
737 new size. The new array will contain at least NITEMS_INCR_MIN more
738 items, but will not contain more than NITEMS_MAX items total.
739 ITEM_SIZE is the size of each item, in bytes.
741 ITEM_SIZE and NITEMS_INCR_MIN must be positive. *NITEMS must be
742 nonnegative. If NITEMS_MAX is -1, it is treated as if it were
745 If PA is null, then allocate a new array instead of reallocating
748 Block interrupt input as needed. If memory exhaustion occurs, set
749 *NITEMS to zero if PA is null, and signal an error (i.e., do not
752 Thus, to grow an array A without saving its old contents, do
753 { xfree (A); A = NULL; A = xpalloc (NULL, &AITEMS, ...); }.
754 The A = NULL avoids a dangling pointer if xpalloc exhausts memory
755 and signals an error, and later this code is reexecuted and
756 attempts to free A. */
759 xpalloc (void *pa
, ptrdiff_t *nitems
, ptrdiff_t nitems_incr_min
,
760 ptrdiff_t nitems_max
, ptrdiff_t item_size
)
762 /* The approximate size to use for initial small allocation
763 requests. This is the largest "small" request for the GNU C
765 enum { DEFAULT_MXFAST
= 64 * sizeof (size_t) / 4 };
767 /* If the array is tiny, grow it to about (but no greater than)
768 DEFAULT_MXFAST bytes. Otherwise, grow it by about 50%. */
769 ptrdiff_t n
= *nitems
;
770 ptrdiff_t tiny_max
= DEFAULT_MXFAST
/ item_size
- n
;
771 ptrdiff_t half_again
= n
>> 1;
772 ptrdiff_t incr_estimate
= max (tiny_max
, half_again
);
774 /* Adjust the increment according to three constraints: NITEMS_INCR_MIN,
775 NITEMS_MAX, and what the C language can represent safely. */
776 ptrdiff_t C_language_max
= min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
;
777 ptrdiff_t n_max
= (0 <= nitems_max
&& nitems_max
< C_language_max
778 ? nitems_max
: C_language_max
);
779 ptrdiff_t nitems_incr_max
= n_max
- n
;
780 ptrdiff_t incr
= max (nitems_incr_min
, min (incr_estimate
, nitems_incr_max
));
782 eassert (0 < item_size
&& 0 < nitems_incr_min
&& 0 <= n
&& -1 <= nitems_max
);
785 if (nitems_incr_max
< incr
)
786 memory_full (SIZE_MAX
);
788 pa
= xrealloc (pa
, n
* item_size
);
794 /* Like strdup, but uses xmalloc. */
797 xstrdup (const char *s
)
799 size_t len
= strlen (s
) + 1;
800 char *p
= xmalloc (len
);
805 /* Like putenv, but (1) use the equivalent of xmalloc and (2) the
806 argument is a const pointer. */
809 xputenv (char const *string
)
811 if (putenv ((char *) string
) != 0)
815 /* Return a newly allocated memory block of SIZE bytes, remembering
816 to free it when unwinding. */
818 record_xmalloc (size_t size
)
820 void *p
= xmalloc (size
);
821 record_unwind_protect_ptr (xfree
, p
);
826 /* Like malloc but used for allocating Lisp data. NBYTES is the
827 number of bytes to allocate, TYPE describes the intended use of the
828 allocated memory block (for strings, for conses, ...). */
831 void *lisp_malloc_loser EXTERNALLY_VISIBLE
;
835 lisp_malloc (size_t nbytes
, enum mem_type type
)
841 #ifdef GC_MALLOC_CHECK
842 allocated_mem_type
= type
;
845 val
= malloc (nbytes
);
848 /* If the memory just allocated cannot be addressed thru a Lisp
849 object's pointer, and it needs to be,
850 that's equivalent to running out of memory. */
851 if (val
&& type
!= MEM_TYPE_NON_LISP
)
854 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
855 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
857 lisp_malloc_loser
= val
;
864 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
865 if (val
&& type
!= MEM_TYPE_NON_LISP
)
866 mem_insert (val
, (char *) val
+ nbytes
, type
);
869 MALLOC_UNBLOCK_INPUT
;
871 memory_full (nbytes
);
872 MALLOC_PROBE (nbytes
);
876 /* Free BLOCK. This must be called to free memory allocated with a
877 call to lisp_malloc. */
880 lisp_free (void *block
)
884 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
885 mem_delete (mem_find (block
));
887 MALLOC_UNBLOCK_INPUT
;
890 /***** Allocation of aligned blocks of memory to store Lisp data. *****/
892 /* The entry point is lisp_align_malloc which returns blocks of at most
893 BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
895 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
896 #define USE_POSIX_MEMALIGN 1
899 /* BLOCK_ALIGN has to be a power of 2. */
900 #define BLOCK_ALIGN (1 << 10)
902 /* Padding to leave at the end of a malloc'd block. This is to give
903 malloc a chance to minimize the amount of memory wasted to alignment.
904 It should be tuned to the particular malloc library used.
905 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
906 posix_memalign on the other hand would ideally prefer a value of 4
907 because otherwise, there's 1020 bytes wasted between each ablocks.
908 In Emacs, testing shows that those 1020 can most of the time be
909 efficiently used by malloc to place other objects, so a value of 0 can
910 still preferable unless you have a lot of aligned blocks and virtually
912 #define BLOCK_PADDING 0
913 #define BLOCK_BYTES \
914 (BLOCK_ALIGN - sizeof (struct ablocks *) - BLOCK_PADDING)
916 /* Internal data structures and constants. */
918 #define ABLOCKS_SIZE 16
920 /* An aligned block of memory. */
925 char payload
[BLOCK_BYTES
];
926 struct ablock
*next_free
;
928 /* `abase' is the aligned base of the ablocks. */
929 /* It is overloaded to hold the virtual `busy' field that counts
930 the number of used ablock in the parent ablocks.
931 The first ablock has the `busy' field, the others have the `abase'
932 field. To tell the difference, we assume that pointers will have
933 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
934 is used to tell whether the real base of the parent ablocks is `abase'
935 (if not, the word before the first ablock holds a pointer to the
937 struct ablocks
*abase
;
938 /* The padding of all but the last ablock is unused. The padding of
939 the last ablock in an ablocks is not allocated. */
941 char padding
[BLOCK_PADDING
];
945 /* A bunch of consecutive aligned blocks. */
948 struct ablock blocks
[ABLOCKS_SIZE
];
951 /* Size of the block requested from malloc or posix_memalign. */
952 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
954 #define ABLOCK_ABASE(block) \
955 (((uintptr_t) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
956 ? (struct ablocks *)(block) \
959 /* Virtual `busy' field. */
960 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
962 /* Pointer to the (not necessarily aligned) malloc block. */
963 #ifdef USE_POSIX_MEMALIGN
964 #define ABLOCKS_BASE(abase) (abase)
966 #define ABLOCKS_BASE(abase) \
967 (1 & (intptr_t) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
970 /* The list of free ablock. */
971 static struct ablock
*free_ablock
;
973 /* Allocate an aligned block of nbytes.
974 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
975 smaller or equal to BLOCK_BYTES. */
977 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
980 struct ablocks
*abase
;
982 eassert (nbytes
<= BLOCK_BYTES
);
986 #ifdef GC_MALLOC_CHECK
987 allocated_mem_type
= type
;
993 intptr_t aligned
; /* int gets warning casting to 64-bit pointer. */
995 #ifdef DOUG_LEA_MALLOC
996 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
997 because mapped region contents are not preserved in
999 mallopt (M_MMAP_MAX
, 0);
1002 #ifdef USE_POSIX_MEMALIGN
1004 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1010 base
= malloc (ABLOCKS_BYTES
);
1011 abase
= ALIGN (base
, BLOCK_ALIGN
);
1016 MALLOC_UNBLOCK_INPUT
;
1017 memory_full (ABLOCKS_BYTES
);
1020 aligned
= (base
== abase
);
1022 ((void**)abase
)[-1] = base
;
1024 #ifdef DOUG_LEA_MALLOC
1025 /* Back to a reasonable maximum of mmap'ed areas. */
1026 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1030 /* If the memory just allocated cannot be addressed thru a Lisp
1031 object's pointer, and it needs to be, that's equivalent to
1032 running out of memory. */
1033 if (type
!= MEM_TYPE_NON_LISP
)
1036 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1037 XSETCONS (tem
, end
);
1038 if ((char *) XCONS (tem
) != end
)
1040 lisp_malloc_loser
= base
;
1042 MALLOC_UNBLOCK_INPUT
;
1043 memory_full (SIZE_MAX
);
1048 /* Initialize the blocks and put them on the free list.
1049 If `base' was not properly aligned, we can't use the last block. */
1050 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1052 abase
->blocks
[i
].abase
= abase
;
1053 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1054 free_ablock
= &abase
->blocks
[i
];
1056 ABLOCKS_BUSY (abase
) = (struct ablocks
*) aligned
;
1058 eassert (0 == ((uintptr_t) abase
) % BLOCK_ALIGN
);
1059 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1060 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1061 eassert (ABLOCKS_BASE (abase
) == base
);
1062 eassert (aligned
== (intptr_t) ABLOCKS_BUSY (abase
));
1065 abase
= ABLOCK_ABASE (free_ablock
);
1066 ABLOCKS_BUSY (abase
) =
1067 (struct ablocks
*) (2 + (intptr_t) ABLOCKS_BUSY (abase
));
1069 free_ablock
= free_ablock
->x
.next_free
;
1071 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1072 if (type
!= MEM_TYPE_NON_LISP
)
1073 mem_insert (val
, (char *) val
+ nbytes
, type
);
1076 MALLOC_UNBLOCK_INPUT
;
1078 MALLOC_PROBE (nbytes
);
1080 eassert (0 == ((uintptr_t) val
) % BLOCK_ALIGN
);
1085 lisp_align_free (void *block
)
1087 struct ablock
*ablock
= block
;
1088 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1091 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1092 mem_delete (mem_find (block
));
1094 /* Put on free list. */
1095 ablock
->x
.next_free
= free_ablock
;
1096 free_ablock
= ablock
;
1097 /* Update busy count. */
1098 ABLOCKS_BUSY (abase
)
1099 = (struct ablocks
*) (-2 + (intptr_t) ABLOCKS_BUSY (abase
));
1101 if (2 > (intptr_t) ABLOCKS_BUSY (abase
))
1102 { /* All the blocks are free. */
1103 int i
= 0, aligned
= (intptr_t) ABLOCKS_BUSY (abase
);
1104 struct ablock
**tem
= &free_ablock
;
1105 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1109 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1112 *tem
= (*tem
)->x
.next_free
;
1115 tem
= &(*tem
)->x
.next_free
;
1117 eassert ((aligned
& 1) == aligned
);
1118 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1119 #ifdef USE_POSIX_MEMALIGN
1120 eassert ((uintptr_t) ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1122 free (ABLOCKS_BASE (abase
));
1124 MALLOC_UNBLOCK_INPUT
;
1128 /***********************************************************************
1130 ***********************************************************************/
1132 /* Number of intervals allocated in an interval_block structure.
1133 The 1020 is 1024 minus malloc overhead. */
1135 #define INTERVAL_BLOCK_SIZE \
1136 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1138 /* Intervals are allocated in chunks in the form of an interval_block
1141 struct interval_block
1143 /* Place `intervals' first, to preserve alignment. */
1144 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1145 struct interval_block
*next
;
1148 /* Current interval block. Its `next' pointer points to older
1151 static struct interval_block
*interval_block
;
1153 /* Index in interval_block above of the next unused interval
1156 static int interval_block_index
= INTERVAL_BLOCK_SIZE
;
1158 /* Number of free and live intervals. */
1160 static EMACS_INT total_free_intervals
, total_intervals
;
1162 /* List of free intervals. */
1164 static INTERVAL interval_free_list
;
1166 /* Return a new interval. */
1169 make_interval (void)
1175 if (interval_free_list
)
1177 val
= interval_free_list
;
1178 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1182 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1184 struct interval_block
*newi
1185 = lisp_malloc (sizeof *newi
, MEM_TYPE_NON_LISP
);
1187 newi
->next
= interval_block
;
1188 interval_block
= newi
;
1189 interval_block_index
= 0;
1190 total_free_intervals
+= INTERVAL_BLOCK_SIZE
;
1192 val
= &interval_block
->intervals
[interval_block_index
++];
1195 MALLOC_UNBLOCK_INPUT
;
1197 consing_since_gc
+= sizeof (struct interval
);
1199 total_free_intervals
--;
1200 RESET_INTERVAL (val
);
1206 /* Mark Lisp objects in interval I. */
1209 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1211 /* Intervals should never be shared. So, if extra internal checking is
1212 enabled, GC aborts if it seems to have visited an interval twice. */
1213 eassert (!i
->gcmarkbit
);
1215 mark_object (i
->plist
);
1218 /* Mark the interval tree rooted in I. */
1220 #define MARK_INTERVAL_TREE(i) \
1222 if (i && !i->gcmarkbit) \
1223 traverse_intervals_noorder (i, mark_interval, Qnil); \
1226 /***********************************************************************
1228 ***********************************************************************/
1230 /* Lisp_Strings are allocated in string_block structures. When a new
1231 string_block is allocated, all the Lisp_Strings it contains are
1232 added to a free-list string_free_list. When a new Lisp_String is
1233 needed, it is taken from that list. During the sweep phase of GC,
1234 string_blocks that are entirely free are freed, except two which
1237 String data is allocated from sblock structures. Strings larger
1238 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1239 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1241 Sblocks consist internally of sdata structures, one for each
1242 Lisp_String. The sdata structure points to the Lisp_String it
1243 belongs to. The Lisp_String points back to the `u.data' member of
1244 its sdata structure.
1246 When a Lisp_String is freed during GC, it is put back on
1247 string_free_list, and its `data' member and its sdata's `string'
1248 pointer is set to null. The size of the string is recorded in the
1249 `n.nbytes' member of the sdata. So, sdata structures that are no
1250 longer used, can be easily recognized, and it's easy to compact the
1251 sblocks of small strings which we do in compact_small_strings. */
1253 /* Size in bytes of an sblock structure used for small strings. This
1254 is 8192 minus malloc overhead. */
1256 #define SBLOCK_SIZE 8188
1258 /* Strings larger than this are considered large strings. String data
1259 for large strings is allocated from individual sblocks. */
1261 #define LARGE_STRING_BYTES 1024
1263 /* Struct or union describing string memory sub-allocated from an sblock.
1264 This is where the contents of Lisp strings are stored. */
1266 #ifdef GC_CHECK_STRING_BYTES
1270 /* Back-pointer to the string this sdata belongs to. If null, this
1271 structure is free, and the NBYTES member of the union below
1272 contains the string's byte size (the same value that STRING_BYTES
1273 would return if STRING were non-null). If non-null, STRING_BYTES
1274 (STRING) is the size of the data, and DATA contains the string's
1276 struct Lisp_String
*string
;
1279 unsigned char data
[FLEXIBLE_ARRAY_MEMBER
];
1282 #define SDATA_NBYTES(S) (S)->nbytes
1283 #define SDATA_DATA(S) (S)->data
1284 #define SDATA_SELECTOR(member) member
1290 struct Lisp_String
*string
;
1292 /* When STRING is non-null. */
1295 struct Lisp_String
*string
;
1296 unsigned char data
[FLEXIBLE_ARRAY_MEMBER
];
1299 /* When STRING is null. */
1302 struct Lisp_String
*string
;
1307 #define SDATA_NBYTES(S) (S)->n.nbytes
1308 #define SDATA_DATA(S) (S)->u.data
1309 #define SDATA_SELECTOR(member) u.member
1311 #endif /* not GC_CHECK_STRING_BYTES */
1313 #define SDATA_DATA_OFFSET offsetof (sdata, SDATA_SELECTOR (data))
1316 /* Structure describing a block of memory which is sub-allocated to
1317 obtain string data memory for strings. Blocks for small strings
1318 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1319 as large as needed. */
1324 struct sblock
*next
;
1326 /* Pointer to the next free sdata block. This points past the end
1327 of the sblock if there isn't any space left in this block. */
1330 /* Start of data. */
1334 /* Number of Lisp strings in a string_block structure. The 1020 is
1335 1024 minus malloc overhead. */
1337 #define STRING_BLOCK_SIZE \
1338 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1340 /* Structure describing a block from which Lisp_String structures
1345 /* Place `strings' first, to preserve alignment. */
1346 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1347 struct string_block
*next
;
1350 /* Head and tail of the list of sblock structures holding Lisp string
1351 data. We always allocate from current_sblock. The NEXT pointers
1352 in the sblock structures go from oldest_sblock to current_sblock. */
1354 static struct sblock
*oldest_sblock
, *current_sblock
;
1356 /* List of sblocks for large strings. */
1358 static struct sblock
*large_sblocks
;
1360 /* List of string_block structures. */
1362 static struct string_block
*string_blocks
;
1364 /* Free-list of Lisp_Strings. */
1366 static struct Lisp_String
*string_free_list
;
1368 /* Number of live and free Lisp_Strings. */
1370 static EMACS_INT total_strings
, total_free_strings
;
1372 /* Number of bytes used by live strings. */
1374 static EMACS_INT total_string_bytes
;
1376 /* Given a pointer to a Lisp_String S which is on the free-list
1377 string_free_list, return a pointer to its successor in the
1380 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1382 /* Return a pointer to the sdata structure belonging to Lisp string S.
1383 S must be live, i.e. S->data must not be null. S->data is actually
1384 a pointer to the `u.data' member of its sdata structure; the
1385 structure starts at a constant offset in front of that. */
1387 #define SDATA_OF_STRING(S) ((sdata *) ((S)->data - SDATA_DATA_OFFSET))
1390 #ifdef GC_CHECK_STRING_OVERRUN
1392 /* We check for overrun in string data blocks by appending a small
1393 "cookie" after each allocated string data block, and check for the
1394 presence of this cookie during GC. */
1396 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1397 static char const string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1398 { '\xde', '\xad', '\xbe', '\xef' };
1401 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1404 /* Value is the size of an sdata structure large enough to hold NBYTES
1405 bytes of string data. The value returned includes a terminating
1406 NUL byte, the size of the sdata structure, and padding. */
1408 #ifdef GC_CHECK_STRING_BYTES
1410 #define SDATA_SIZE(NBYTES) \
1411 ((SDATA_DATA_OFFSET \
1413 + sizeof (ptrdiff_t) - 1) \
1414 & ~(sizeof (ptrdiff_t) - 1))
1416 #else /* not GC_CHECK_STRING_BYTES */
1418 /* The 'max' reserves space for the nbytes union member even when NBYTES + 1 is
1419 less than the size of that member. The 'max' is not needed when
1420 SDATA_DATA_OFFSET is a multiple of sizeof (ptrdiff_t), because then the
1421 alignment code reserves enough space. */
1423 #define SDATA_SIZE(NBYTES) \
1424 ((SDATA_DATA_OFFSET \
1425 + (SDATA_DATA_OFFSET % sizeof (ptrdiff_t) == 0 \
1427 : max (NBYTES, sizeof (ptrdiff_t) - 1)) \
1429 + sizeof (ptrdiff_t) - 1) \
1430 & ~(sizeof (ptrdiff_t) - 1))
1432 #endif /* not GC_CHECK_STRING_BYTES */
1434 /* Extra bytes to allocate for each string. */
1436 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1438 /* Exact bound on the number of bytes in a string, not counting the
1439 terminating null. A string cannot contain more bytes than
1440 STRING_BYTES_BOUND, nor can it be so long that the size_t
1441 arithmetic in allocate_string_data would overflow while it is
1442 calculating a value to be passed to malloc. */
1443 static ptrdiff_t const STRING_BYTES_MAX
=
1444 min (STRING_BYTES_BOUND
,
1445 ((SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
1447 - offsetof (struct sblock
, first_data
)
1448 - SDATA_DATA_OFFSET
)
1449 & ~(sizeof (EMACS_INT
) - 1)));
1451 /* Initialize string allocation. Called from init_alloc_once. */
1456 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1457 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1461 #ifdef GC_CHECK_STRING_BYTES
1463 static int check_string_bytes_count
;
1465 /* Like STRING_BYTES, but with debugging check. Can be
1466 called during GC, so pay attention to the mark bit. */
1469 string_bytes (struct Lisp_String
*s
)
1472 (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1474 if (!PURE_POINTER_P (s
)
1476 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1481 /* Check validity of Lisp strings' string_bytes member in B. */
1484 check_sblock (struct sblock
*b
)
1486 sdata
*from
, *end
, *from_end
;
1490 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1492 /* Compute the next FROM here because copying below may
1493 overwrite data we need to compute it. */
1496 /* Check that the string size recorded in the string is the
1497 same as the one recorded in the sdata structure. */
1498 nbytes
= SDATA_SIZE (from
->string
? string_bytes (from
->string
)
1499 : SDATA_NBYTES (from
));
1500 from_end
= (sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1505 /* Check validity of Lisp strings' string_bytes member. ALL_P
1506 means check all strings, otherwise check only most
1507 recently allocated strings. Used for hunting a bug. */
1510 check_string_bytes (bool all_p
)
1516 for (b
= large_sblocks
; b
; b
= b
->next
)
1518 struct Lisp_String
*s
= b
->first_data
.string
;
1523 for (b
= oldest_sblock
; b
; b
= b
->next
)
1526 else if (current_sblock
)
1527 check_sblock (current_sblock
);
1530 #else /* not GC_CHECK_STRING_BYTES */
1532 #define check_string_bytes(all) ((void) 0)
1534 #endif /* GC_CHECK_STRING_BYTES */
1536 #ifdef GC_CHECK_STRING_FREE_LIST
1538 /* Walk through the string free list looking for bogus next pointers.
1539 This may catch buffer overrun from a previous string. */
1542 check_string_free_list (void)
1544 struct Lisp_String
*s
;
1546 /* Pop a Lisp_String off the free-list. */
1547 s
= string_free_list
;
1550 if ((uintptr_t) s
< 1024)
1552 s
= NEXT_FREE_LISP_STRING (s
);
1556 #define check_string_free_list()
1559 /* Return a new Lisp_String. */
1561 static struct Lisp_String
*
1562 allocate_string (void)
1564 struct Lisp_String
*s
;
1568 /* If the free-list is empty, allocate a new string_block, and
1569 add all the Lisp_Strings in it to the free-list. */
1570 if (string_free_list
== NULL
)
1572 struct string_block
*b
= lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1575 b
->next
= string_blocks
;
1578 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1581 /* Every string on a free list should have NULL data pointer. */
1583 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1584 string_free_list
= s
;
1587 total_free_strings
+= STRING_BLOCK_SIZE
;
1590 check_string_free_list ();
1592 /* Pop a Lisp_String off the free-list. */
1593 s
= string_free_list
;
1594 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1596 MALLOC_UNBLOCK_INPUT
;
1598 --total_free_strings
;
1601 consing_since_gc
+= sizeof *s
;
1603 #ifdef GC_CHECK_STRING_BYTES
1604 if (!noninteractive
)
1606 if (++check_string_bytes_count
== 200)
1608 check_string_bytes_count
= 0;
1609 check_string_bytes (1);
1612 check_string_bytes (0);
1614 #endif /* GC_CHECK_STRING_BYTES */
1620 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1621 plus a NUL byte at the end. Allocate an sdata structure for S, and
1622 set S->data to its `u.data' member. Store a NUL byte at the end of
1623 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1624 S->data if it was initially non-null. */
1627 allocate_string_data (struct Lisp_String
*s
,
1628 EMACS_INT nchars
, EMACS_INT nbytes
)
1630 sdata
*data
, *old_data
;
1632 ptrdiff_t needed
, old_nbytes
;
1634 if (STRING_BYTES_MAX
< nbytes
)
1637 /* Determine the number of bytes needed to store NBYTES bytes
1639 needed
= SDATA_SIZE (nbytes
);
1642 old_data
= SDATA_OF_STRING (s
);
1643 old_nbytes
= STRING_BYTES (s
);
1650 if (nbytes
> LARGE_STRING_BYTES
)
1652 size_t size
= offsetof (struct sblock
, first_data
) + needed
;
1654 #ifdef DOUG_LEA_MALLOC
1655 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1656 because mapped region contents are not preserved in
1659 In case you think of allowing it in a dumped Emacs at the
1660 cost of not being able to re-dump, there's another reason:
1661 mmap'ed data typically have an address towards the top of the
1662 address space, which won't fit into an EMACS_INT (at least on
1663 32-bit systems with the current tagging scheme). --fx */
1664 mallopt (M_MMAP_MAX
, 0);
1667 b
= lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1669 #ifdef DOUG_LEA_MALLOC
1670 /* Back to a reasonable maximum of mmap'ed areas. */
1671 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1674 b
->next_free
= &b
->first_data
;
1675 b
->first_data
.string
= NULL
;
1676 b
->next
= large_sblocks
;
1679 else if (current_sblock
== NULL
1680 || (((char *) current_sblock
+ SBLOCK_SIZE
1681 - (char *) current_sblock
->next_free
)
1682 < (needed
+ GC_STRING_EXTRA
)))
1684 /* Not enough room in the current sblock. */
1685 b
= lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1686 b
->next_free
= &b
->first_data
;
1687 b
->first_data
.string
= NULL
;
1691 current_sblock
->next
= b
;
1699 data
= b
->next_free
;
1700 b
->next_free
= (sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
1702 MALLOC_UNBLOCK_INPUT
;
1705 s
->data
= SDATA_DATA (data
);
1706 #ifdef GC_CHECK_STRING_BYTES
1707 SDATA_NBYTES (data
) = nbytes
;
1710 s
->size_byte
= nbytes
;
1711 s
->data
[nbytes
] = '\0';
1712 #ifdef GC_CHECK_STRING_OVERRUN
1713 memcpy ((char *) data
+ needed
, string_overrun_cookie
,
1714 GC_STRING_OVERRUN_COOKIE_SIZE
);
1717 /* Note that Faset may call to this function when S has already data
1718 assigned. In this case, mark data as free by setting it's string
1719 back-pointer to null, and record the size of the data in it. */
1722 SDATA_NBYTES (old_data
) = old_nbytes
;
1723 old_data
->string
= NULL
;
1726 consing_since_gc
+= needed
;
1730 /* Sweep and compact strings. */
1733 sweep_strings (void)
1735 struct string_block
*b
, *next
;
1736 struct string_block
*live_blocks
= NULL
;
1738 string_free_list
= NULL
;
1739 total_strings
= total_free_strings
= 0;
1740 total_string_bytes
= 0;
1742 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1743 for (b
= string_blocks
; b
; b
= next
)
1746 struct Lisp_String
*free_list_before
= string_free_list
;
1750 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1752 struct Lisp_String
*s
= b
->strings
+ i
;
1756 /* String was not on free-list before. */
1757 if (STRING_MARKED_P (s
))
1759 /* String is live; unmark it and its intervals. */
1762 /* Do not use string_(set|get)_intervals here. */
1763 s
->intervals
= balance_intervals (s
->intervals
);
1766 total_string_bytes
+= STRING_BYTES (s
);
1770 /* String is dead. Put it on the free-list. */
1771 sdata
*data
= SDATA_OF_STRING (s
);
1773 /* Save the size of S in its sdata so that we know
1774 how large that is. Reset the sdata's string
1775 back-pointer so that we know it's free. */
1776 #ifdef GC_CHECK_STRING_BYTES
1777 if (string_bytes (s
) != SDATA_NBYTES (data
))
1780 data
->n
.nbytes
= STRING_BYTES (s
);
1782 data
->string
= NULL
;
1784 /* Reset the strings's `data' member so that we
1788 /* Put the string on the free-list. */
1789 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1790 string_free_list
= s
;
1796 /* S was on the free-list before. Put it there again. */
1797 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1798 string_free_list
= s
;
1803 /* Free blocks that contain free Lisp_Strings only, except
1804 the first two of them. */
1805 if (nfree
== STRING_BLOCK_SIZE
1806 && total_free_strings
> STRING_BLOCK_SIZE
)
1809 string_free_list
= free_list_before
;
1813 total_free_strings
+= nfree
;
1814 b
->next
= live_blocks
;
1819 check_string_free_list ();
1821 string_blocks
= live_blocks
;
1822 free_large_strings ();
1823 compact_small_strings ();
1825 check_string_free_list ();
1829 /* Free dead large strings. */
1832 free_large_strings (void)
1834 struct sblock
*b
, *next
;
1835 struct sblock
*live_blocks
= NULL
;
1837 for (b
= large_sblocks
; b
; b
= next
)
1841 if (b
->first_data
.string
== NULL
)
1845 b
->next
= live_blocks
;
1850 large_sblocks
= live_blocks
;
1854 /* Compact data of small strings. Free sblocks that don't contain
1855 data of live strings after compaction. */
1858 compact_small_strings (void)
1860 struct sblock
*b
, *tb
, *next
;
1861 sdata
*from
, *to
, *end
, *tb_end
;
1862 sdata
*to_end
, *from_end
;
1864 /* TB is the sblock we copy to, TO is the sdata within TB we copy
1865 to, and TB_END is the end of TB. */
1867 tb_end
= (sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1868 to
= &tb
->first_data
;
1870 /* Step through the blocks from the oldest to the youngest. We
1871 expect that old blocks will stabilize over time, so that less
1872 copying will happen this way. */
1873 for (b
= oldest_sblock
; b
; b
= b
->next
)
1876 eassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
1878 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1880 /* Compute the next FROM here because copying below may
1881 overwrite data we need to compute it. */
1883 struct Lisp_String
*s
= from
->string
;
1885 #ifdef GC_CHECK_STRING_BYTES
1886 /* Check that the string size recorded in the string is the
1887 same as the one recorded in the sdata structure. */
1888 if (s
&& string_bytes (s
) != SDATA_NBYTES (from
))
1890 #endif /* GC_CHECK_STRING_BYTES */
1892 nbytes
= s
? STRING_BYTES (s
) : SDATA_NBYTES (from
);
1893 eassert (nbytes
<= LARGE_STRING_BYTES
);
1895 nbytes
= SDATA_SIZE (nbytes
);
1896 from_end
= (sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1898 #ifdef GC_CHECK_STRING_OVERRUN
1899 if (memcmp (string_overrun_cookie
,
1900 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
1901 GC_STRING_OVERRUN_COOKIE_SIZE
))
1905 /* Non-NULL S means it's alive. Copy its data. */
1908 /* If TB is full, proceed with the next sblock. */
1909 to_end
= (sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
1910 if (to_end
> tb_end
)
1914 tb_end
= (sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1915 to
= &tb
->first_data
;
1916 to_end
= (sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
1919 /* Copy, and update the string's `data' pointer. */
1922 eassert (tb
!= b
|| to
< from
);
1923 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
1924 to
->string
->data
= SDATA_DATA (to
);
1927 /* Advance past the sdata we copied to. */
1933 /* The rest of the sblocks following TB don't contain live data, so
1934 we can free them. */
1935 for (b
= tb
->next
; b
; b
= next
)
1943 current_sblock
= tb
;
1947 string_overflow (void)
1949 error ("Maximum string size exceeded");
1952 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
1953 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
1954 LENGTH must be an integer.
1955 INIT must be an integer that represents a character. */)
1956 (Lisp_Object length
, Lisp_Object init
)
1958 register Lisp_Object val
;
1959 register unsigned char *p
, *end
;
1963 CHECK_NATNUM (length
);
1964 CHECK_CHARACTER (init
);
1966 c
= XFASTINT (init
);
1967 if (ASCII_CHAR_P (c
))
1969 nbytes
= XINT (length
);
1970 val
= make_uninit_string (nbytes
);
1972 end
= p
+ SCHARS (val
);
1978 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
1979 int len
= CHAR_STRING (c
, str
);
1980 EMACS_INT string_len
= XINT (length
);
1982 if (string_len
> STRING_BYTES_MAX
/ len
)
1984 nbytes
= len
* string_len
;
1985 val
= make_uninit_multibyte_string (string_len
, nbytes
);
1990 memcpy (p
, str
, len
);
2000 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2001 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2002 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2003 (Lisp_Object length
, Lisp_Object init
)
2005 register Lisp_Object val
;
2006 struct Lisp_Bool_Vector
*p
;
2007 ptrdiff_t length_in_chars
;
2008 EMACS_INT length_in_elts
;
2010 int extra_bool_elts
= ((bool_header_size
- header_size
+ word_size
- 1)
2013 CHECK_NATNUM (length
);
2015 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2017 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2019 val
= Fmake_vector (make_number (length_in_elts
+ extra_bool_elts
), Qnil
);
2021 /* No Lisp_Object to trace in there. */
2022 XSETPVECTYPESIZE (XVECTOR (val
), PVEC_BOOL_VECTOR
, 0, 0);
2024 p
= XBOOL_VECTOR (val
);
2025 p
->size
= XFASTINT (length
);
2027 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2028 / BOOL_VECTOR_BITS_PER_CHAR
);
2029 if (length_in_chars
)
2031 memset (p
->data
, ! NILP (init
) ? -1 : 0, length_in_chars
);
2033 /* Clear any extraneous bits in the last byte. */
2034 p
->data
[length_in_chars
- 1]
2035 &= (1 << ((XFASTINT (length
) - 1) % BOOL_VECTOR_BITS_PER_CHAR
+ 1)) - 1;
2042 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2043 of characters from the contents. This string may be unibyte or
2044 multibyte, depending on the contents. */
2047 make_string (const char *contents
, ptrdiff_t nbytes
)
2049 register Lisp_Object val
;
2050 ptrdiff_t nchars
, multibyte_nbytes
;
2052 parse_str_as_multibyte ((const unsigned char *) contents
, nbytes
,
2053 &nchars
, &multibyte_nbytes
);
2054 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2055 /* CONTENTS contains no multibyte sequences or contains an invalid
2056 multibyte sequence. We must make unibyte string. */
2057 val
= make_unibyte_string (contents
, nbytes
);
2059 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2064 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2067 make_unibyte_string (const char *contents
, ptrdiff_t length
)
2069 register Lisp_Object val
;
2070 val
= make_uninit_string (length
);
2071 memcpy (SDATA (val
), contents
, length
);
2076 /* Make a multibyte string from NCHARS characters occupying NBYTES
2077 bytes at CONTENTS. */
2080 make_multibyte_string (const char *contents
,
2081 ptrdiff_t nchars
, ptrdiff_t nbytes
)
2083 register Lisp_Object val
;
2084 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2085 memcpy (SDATA (val
), contents
, nbytes
);
2090 /* Make a string from NCHARS characters occupying NBYTES bytes at
2091 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2094 make_string_from_bytes (const char *contents
,
2095 ptrdiff_t nchars
, ptrdiff_t nbytes
)
2097 register Lisp_Object val
;
2098 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2099 memcpy (SDATA (val
), contents
, nbytes
);
2100 if (SBYTES (val
) == SCHARS (val
))
2101 STRING_SET_UNIBYTE (val
);
2106 /* Make a string from NCHARS characters occupying NBYTES bytes at
2107 CONTENTS. The argument MULTIBYTE controls whether to label the
2108 string as multibyte. If NCHARS is negative, it counts the number of
2109 characters by itself. */
2112 make_specified_string (const char *contents
,
2113 ptrdiff_t nchars
, ptrdiff_t nbytes
, bool multibyte
)
2120 nchars
= multibyte_chars_in_text ((const unsigned char *) contents
,
2125 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2126 memcpy (SDATA (val
), contents
, nbytes
);
2128 STRING_SET_UNIBYTE (val
);
2133 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2134 occupying LENGTH bytes. */
2137 make_uninit_string (EMACS_INT length
)
2142 return empty_unibyte_string
;
2143 val
= make_uninit_multibyte_string (length
, length
);
2144 STRING_SET_UNIBYTE (val
);
2149 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2150 which occupy NBYTES bytes. */
2153 make_uninit_multibyte_string (EMACS_INT nchars
, EMACS_INT nbytes
)
2156 struct Lisp_String
*s
;
2161 return empty_multibyte_string
;
2163 s
= allocate_string ();
2164 s
->intervals
= NULL
;
2165 allocate_string_data (s
, nchars
, nbytes
);
2166 XSETSTRING (string
, s
);
2167 string_chars_consed
+= nbytes
;
2171 /* Print arguments to BUF according to a FORMAT, then return
2172 a Lisp_String initialized with the data from BUF. */
2175 make_formatted_string (char *buf
, const char *format
, ...)
2180 va_start (ap
, format
);
2181 length
= vsprintf (buf
, format
, ap
);
2183 return make_string (buf
, length
);
2187 /***********************************************************************
2189 ***********************************************************************/
2191 /* We store float cells inside of float_blocks, allocating a new
2192 float_block with malloc whenever necessary. Float cells reclaimed
2193 by GC are put on a free list to be reallocated before allocating
2194 any new float cells from the latest float_block. */
2196 #define FLOAT_BLOCK_SIZE \
2197 (((BLOCK_BYTES - sizeof (struct float_block *) \
2198 /* The compiler might add padding at the end. */ \
2199 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2200 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2202 #define GETMARKBIT(block,n) \
2203 (((block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2204 >> ((n) % (sizeof (int) * CHAR_BIT))) \
2207 #define SETMARKBIT(block,n) \
2208 (block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2209 |= 1 << ((n) % (sizeof (int) * CHAR_BIT))
2211 #define UNSETMARKBIT(block,n) \
2212 (block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2213 &= ~(1 << ((n) % (sizeof (int) * CHAR_BIT)))
2215 #define FLOAT_BLOCK(fptr) \
2216 ((struct float_block *) (((uintptr_t) (fptr)) & ~(BLOCK_ALIGN - 1)))
2218 #define FLOAT_INDEX(fptr) \
2219 ((((uintptr_t) (fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2223 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2224 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2225 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof (int) * CHAR_BIT
)];
2226 struct float_block
*next
;
2229 #define FLOAT_MARKED_P(fptr) \
2230 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2232 #define FLOAT_MARK(fptr) \
2233 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2235 #define FLOAT_UNMARK(fptr) \
2236 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2238 /* Current float_block. */
2240 static struct float_block
*float_block
;
2242 /* Index of first unused Lisp_Float in the current float_block. */
2244 static int float_block_index
= FLOAT_BLOCK_SIZE
;
2246 /* Free-list of Lisp_Floats. */
2248 static struct Lisp_Float
*float_free_list
;
2250 /* Return a new float object with value FLOAT_VALUE. */
2253 make_float (double float_value
)
2255 register Lisp_Object val
;
2259 if (float_free_list
)
2261 /* We use the data field for chaining the free list
2262 so that we won't use the same field that has the mark bit. */
2263 XSETFLOAT (val
, float_free_list
);
2264 float_free_list
= float_free_list
->u
.chain
;
2268 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2270 struct float_block
*new
2271 = lisp_align_malloc (sizeof *new, MEM_TYPE_FLOAT
);
2272 new->next
= float_block
;
2273 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2275 float_block_index
= 0;
2276 total_free_floats
+= FLOAT_BLOCK_SIZE
;
2278 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2279 float_block_index
++;
2282 MALLOC_UNBLOCK_INPUT
;
2284 XFLOAT_INIT (val
, float_value
);
2285 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2286 consing_since_gc
+= sizeof (struct Lisp_Float
);
2288 total_free_floats
--;
2294 /***********************************************************************
2296 ***********************************************************************/
2298 /* We store cons cells inside of cons_blocks, allocating a new
2299 cons_block with malloc whenever necessary. Cons cells reclaimed by
2300 GC are put on a free list to be reallocated before allocating
2301 any new cons cells from the latest cons_block. */
2303 #define CONS_BLOCK_SIZE \
2304 (((BLOCK_BYTES - sizeof (struct cons_block *) \
2305 /* The compiler might add padding at the end. */ \
2306 - (sizeof (struct Lisp_Cons) - sizeof (int))) * CHAR_BIT) \
2307 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2309 #define CONS_BLOCK(fptr) \
2310 ((struct cons_block *) ((uintptr_t) (fptr) & ~(BLOCK_ALIGN - 1)))
2312 #define CONS_INDEX(fptr) \
2313 (((uintptr_t) (fptr) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2317 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2318 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2319 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof (int) * CHAR_BIT
)];
2320 struct cons_block
*next
;
2323 #define CONS_MARKED_P(fptr) \
2324 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2326 #define CONS_MARK(fptr) \
2327 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2329 #define CONS_UNMARK(fptr) \
2330 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2332 /* Current cons_block. */
2334 static struct cons_block
*cons_block
;
2336 /* Index of first unused Lisp_Cons in the current block. */
2338 static int cons_block_index
= CONS_BLOCK_SIZE
;
2340 /* Free-list of Lisp_Cons structures. */
2342 static struct Lisp_Cons
*cons_free_list
;
2344 /* Explicitly free a cons cell by putting it on the free-list. */
2347 free_cons (struct Lisp_Cons
*ptr
)
2349 ptr
->u
.chain
= cons_free_list
;
2353 cons_free_list
= ptr
;
2354 consing_since_gc
-= sizeof *ptr
;
2355 total_free_conses
++;
2358 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2359 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2360 (Lisp_Object car
, Lisp_Object cdr
)
2362 register Lisp_Object val
;
2368 /* We use the cdr for chaining the free list
2369 so that we won't use the same field that has the mark bit. */
2370 XSETCONS (val
, cons_free_list
);
2371 cons_free_list
= cons_free_list
->u
.chain
;
2375 if (cons_block_index
== CONS_BLOCK_SIZE
)
2377 struct cons_block
*new
2378 = lisp_align_malloc (sizeof *new, MEM_TYPE_CONS
);
2379 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2380 new->next
= cons_block
;
2382 cons_block_index
= 0;
2383 total_free_conses
+= CONS_BLOCK_SIZE
;
2385 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2389 MALLOC_UNBLOCK_INPUT
;
2393 eassert (!CONS_MARKED_P (XCONS (val
)));
2394 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2395 total_free_conses
--;
2396 cons_cells_consed
++;
2400 #ifdef GC_CHECK_CONS_LIST
2401 /* Get an error now if there's any junk in the cons free list. */
2403 check_cons_list (void)
2405 struct Lisp_Cons
*tail
= cons_free_list
;
2408 tail
= tail
->u
.chain
;
2412 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2415 list1 (Lisp_Object arg1
)
2417 return Fcons (arg1
, Qnil
);
2421 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2423 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2428 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2430 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2435 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2437 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2442 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2444 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2445 Fcons (arg5
, Qnil
)))));
2448 /* Make a list of COUNT Lisp_Objects, where ARG is the
2449 first one. Allocate conses from pure space if TYPE
2450 is CONSTYPE_PURE, or allocate as usual if type is CONSTYPE_HEAP. */
2453 listn (enum constype type
, ptrdiff_t count
, Lisp_Object arg
, ...)
2457 Lisp_Object val
, *objp
;
2459 /* Change to SAFE_ALLOCA if you hit this eassert. */
2460 eassert (count
<= MAX_ALLOCA
/ word_size
);
2462 objp
= alloca (count
* word_size
);
2465 for (i
= 1; i
< count
; i
++)
2466 objp
[i
] = va_arg (ap
, Lisp_Object
);
2469 for (val
= Qnil
, i
= count
- 1; i
>= 0; i
--)
2471 if (type
== CONSTYPE_PURE
)
2472 val
= pure_cons (objp
[i
], val
);
2473 else if (type
== CONSTYPE_HEAP
)
2474 val
= Fcons (objp
[i
], val
);
2481 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2482 doc
: /* Return a newly created list with specified arguments as elements.
2483 Any number of arguments, even zero arguments, are allowed.
2484 usage: (list &rest OBJECTS) */)
2485 (ptrdiff_t nargs
, Lisp_Object
*args
)
2487 register Lisp_Object val
;
2493 val
= Fcons (args
[nargs
], val
);
2499 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2500 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2501 (register Lisp_Object length
, Lisp_Object init
)
2503 register Lisp_Object val
;
2504 register EMACS_INT size
;
2506 CHECK_NATNUM (length
);
2507 size
= XFASTINT (length
);
2512 val
= Fcons (init
, val
);
2517 val
= Fcons (init
, val
);
2522 val
= Fcons (init
, val
);
2527 val
= Fcons (init
, val
);
2532 val
= Fcons (init
, val
);
2547 /***********************************************************************
2549 ***********************************************************************/
2551 /* This value is balanced well enough to avoid too much internal overhead
2552 for the most common cases; it's not required to be a power of two, but
2553 it's expected to be a mult-of-ROUNDUP_SIZE (see below). */
2555 #define VECTOR_BLOCK_SIZE 4096
2557 /* Align allocation request sizes to be a multiple of ROUNDUP_SIZE. */
2560 roundup_size
= COMMON_MULTIPLE (word_size
, USE_LSB_TAG
? GCALIGNMENT
: 1)
2563 /* ROUNDUP_SIZE must be a power of 2. */
2564 verify ((roundup_size
& (roundup_size
- 1)) == 0);
2566 /* Verify assumptions described above. */
2567 verify ((VECTOR_BLOCK_SIZE
% roundup_size
) == 0);
2568 verify (VECTOR_BLOCK_SIZE
<= (1 << PSEUDOVECTOR_SIZE_BITS
));
2570 /* Round up X to nearest mult-of-ROUNDUP_SIZE. */
2572 #define vroundup(x) (((x) + (roundup_size - 1)) & ~(roundup_size - 1))
2574 /* Rounding helps to maintain alignment constraints if USE_LSB_TAG. */
2576 #define VECTOR_BLOCK_BYTES (VECTOR_BLOCK_SIZE - vroundup (sizeof (void *)))
2578 /* Size of the minimal vector allocated from block. */
2580 #define VBLOCK_BYTES_MIN vroundup (header_size + sizeof (Lisp_Object))
2582 /* Size of the largest vector allocated from block. */
2584 #define VBLOCK_BYTES_MAX \
2585 vroundup ((VECTOR_BLOCK_BYTES / 2) - word_size)
2587 /* We maintain one free list for each possible block-allocated
2588 vector size, and this is the number of free lists we have. */
2590 #define VECTOR_MAX_FREE_LIST_INDEX \
2591 ((VECTOR_BLOCK_BYTES - VBLOCK_BYTES_MIN) / roundup_size + 1)
2593 /* Common shortcut to advance vector pointer over a block data. */
2595 #define ADVANCE(v, nbytes) ((struct Lisp_Vector *) ((char *) (v) + (nbytes)))
2597 /* Common shortcut to calculate NBYTES-vector index in VECTOR_FREE_LISTS. */
2599 #define VINDEX(nbytes) (((nbytes) - VBLOCK_BYTES_MIN) / roundup_size)
2601 /* Get and set the next field in block-allocated vectorlike objects on
2602 the free list. Doing it this way respects C's aliasing rules.
2603 We could instead make 'contents' a union, but that would mean
2604 changes everywhere that the code uses 'contents'. */
2605 static struct Lisp_Vector
*
2606 next_in_free_list (struct Lisp_Vector
*v
)
2608 intptr_t i
= XLI (v
->contents
[0]);
2609 return (struct Lisp_Vector
*) i
;
2612 set_next_in_free_list (struct Lisp_Vector
*v
, struct Lisp_Vector
*next
)
2614 v
->contents
[0] = XIL ((intptr_t) next
);
2617 /* Common shortcut to setup vector on a free list. */
2619 #define SETUP_ON_FREE_LIST(v, nbytes, tmp) \
2621 (tmp) = ((nbytes - header_size) / word_size); \
2622 XSETPVECTYPESIZE (v, PVEC_FREE, 0, (tmp)); \
2623 eassert ((nbytes) % roundup_size == 0); \
2624 (tmp) = VINDEX (nbytes); \
2625 eassert ((tmp) < VECTOR_MAX_FREE_LIST_INDEX); \
2626 set_next_in_free_list (v, vector_free_lists[tmp]); \
2627 vector_free_lists[tmp] = (v); \
2628 total_free_vector_slots += (nbytes) / word_size; \
2631 /* This internal type is used to maintain the list of large vectors
2632 which are allocated at their own, e.g. outside of vector blocks. */
2637 struct large_vector
*vector
;
2639 /* We need to maintain ROUNDUP_SIZE alignment for the vector member. */
2640 unsigned char c
[vroundup (sizeof (struct large_vector
*))];
2643 struct Lisp_Vector v
;
2646 /* This internal type is used to maintain an underlying storage
2647 for small vectors. */
2651 char data
[VECTOR_BLOCK_BYTES
];
2652 struct vector_block
*next
;
2655 /* Chain of vector blocks. */
2657 static struct vector_block
*vector_blocks
;
2659 /* Vector free lists, where NTH item points to a chain of free
2660 vectors of the same NBYTES size, so NTH == VINDEX (NBYTES). */
2662 static struct Lisp_Vector
*vector_free_lists
[VECTOR_MAX_FREE_LIST_INDEX
];
2664 /* Singly-linked list of large vectors. */
2666 static struct large_vector
*large_vectors
;
2668 /* The only vector with 0 slots, allocated from pure space. */
2670 Lisp_Object zero_vector
;
2672 /* Number of live vectors. */
2674 static EMACS_INT total_vectors
;
2676 /* Total size of live and free vectors, in Lisp_Object units. */
2678 static EMACS_INT total_vector_slots
, total_free_vector_slots
;
2680 /* Get a new vector block. */
2682 static struct vector_block
*
2683 allocate_vector_block (void)
2685 struct vector_block
*block
= xmalloc (sizeof *block
);
2687 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
2688 mem_insert (block
->data
, block
->data
+ VECTOR_BLOCK_BYTES
,
2689 MEM_TYPE_VECTOR_BLOCK
);
2692 block
->next
= vector_blocks
;
2693 vector_blocks
= block
;
2697 /* Called once to initialize vector allocation. */
2702 zero_vector
= make_pure_vector (0);
2705 /* Allocate vector from a vector block. */
2707 static struct Lisp_Vector
*
2708 allocate_vector_from_block (size_t nbytes
)
2710 struct Lisp_Vector
*vector
;
2711 struct vector_block
*block
;
2712 size_t index
, restbytes
;
2714 eassert (VBLOCK_BYTES_MIN
<= nbytes
&& nbytes
<= VBLOCK_BYTES_MAX
);
2715 eassert (nbytes
% roundup_size
== 0);
2717 /* First, try to allocate from a free list
2718 containing vectors of the requested size. */
2719 index
= VINDEX (nbytes
);
2720 if (vector_free_lists
[index
])
2722 vector
= vector_free_lists
[index
];
2723 vector_free_lists
[index
] = next_in_free_list (vector
);
2724 total_free_vector_slots
-= nbytes
/ word_size
;
2728 /* Next, check free lists containing larger vectors. Since
2729 we will split the result, we should have remaining space
2730 large enough to use for one-slot vector at least. */
2731 for (index
= VINDEX (nbytes
+ VBLOCK_BYTES_MIN
);
2732 index
< VECTOR_MAX_FREE_LIST_INDEX
; index
++)
2733 if (vector_free_lists
[index
])
2735 /* This vector is larger than requested. */
2736 vector
= vector_free_lists
[index
];
2737 vector_free_lists
[index
] = next_in_free_list (vector
);
2738 total_free_vector_slots
-= nbytes
/ word_size
;
2740 /* Excess bytes are used for the smaller vector,
2741 which should be set on an appropriate free list. */
2742 restbytes
= index
* roundup_size
+ VBLOCK_BYTES_MIN
- nbytes
;
2743 eassert (restbytes
% roundup_size
== 0);
2744 SETUP_ON_FREE_LIST (ADVANCE (vector
, nbytes
), restbytes
, index
);
2748 /* Finally, need a new vector block. */
2749 block
= allocate_vector_block ();
2751 /* New vector will be at the beginning of this block. */
2752 vector
= (struct Lisp_Vector
*) block
->data
;
2754 /* If the rest of space from this block is large enough
2755 for one-slot vector at least, set up it on a free list. */
2756 restbytes
= VECTOR_BLOCK_BYTES
- nbytes
;
2757 if (restbytes
>= VBLOCK_BYTES_MIN
)
2759 eassert (restbytes
% roundup_size
== 0);
2760 SETUP_ON_FREE_LIST (ADVANCE (vector
, nbytes
), restbytes
, index
);
2765 /* Nonzero if VECTOR pointer is valid pointer inside BLOCK. */
2767 #define VECTOR_IN_BLOCK(vector, block) \
2768 ((char *) (vector) <= (block)->data \
2769 + VECTOR_BLOCK_BYTES - VBLOCK_BYTES_MIN)
2771 /* Return the memory footprint of V in bytes. */
2774 vector_nbytes (struct Lisp_Vector
*v
)
2776 ptrdiff_t size
= v
->header
.size
& ~ARRAY_MARK_FLAG
;
2778 if (size
& PSEUDOVECTOR_FLAG
)
2780 if (PSEUDOVECTOR_TYPEP (&v
->header
, PVEC_BOOL_VECTOR
))
2781 size
= (bool_header_size
2782 + (((struct Lisp_Bool_Vector
*) v
)->size
2783 + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2784 / BOOL_VECTOR_BITS_PER_CHAR
);
2787 + ((size
& PSEUDOVECTOR_SIZE_MASK
)
2788 + ((size
& PSEUDOVECTOR_REST_MASK
)
2789 >> PSEUDOVECTOR_SIZE_BITS
)) * word_size
);
2792 size
= header_size
+ size
* word_size
;
2793 return vroundup (size
);
2796 /* Reclaim space used by unmarked vectors. */
2799 sweep_vectors (void)
2801 struct vector_block
*block
= vector_blocks
, **bprev
= &vector_blocks
;
2802 struct large_vector
*lv
, **lvprev
= &large_vectors
;
2803 struct Lisp_Vector
*vector
, *next
;
2805 total_vectors
= total_vector_slots
= total_free_vector_slots
= 0;
2806 memset (vector_free_lists
, 0, sizeof (vector_free_lists
));
2808 /* Looking through vector blocks. */
2810 for (block
= vector_blocks
; block
; block
= *bprev
)
2812 bool free_this_block
= 0;
2815 for (vector
= (struct Lisp_Vector
*) block
->data
;
2816 VECTOR_IN_BLOCK (vector
, block
); vector
= next
)
2818 if (VECTOR_MARKED_P (vector
))
2820 VECTOR_UNMARK (vector
);
2822 nbytes
= vector_nbytes (vector
);
2823 total_vector_slots
+= nbytes
/ word_size
;
2824 next
= ADVANCE (vector
, nbytes
);
2828 ptrdiff_t total_bytes
;
2830 nbytes
= vector_nbytes (vector
);
2831 total_bytes
= nbytes
;
2832 next
= ADVANCE (vector
, nbytes
);
2834 /* While NEXT is not marked, try to coalesce with VECTOR,
2835 thus making VECTOR of the largest possible size. */
2837 while (VECTOR_IN_BLOCK (next
, block
))
2839 if (VECTOR_MARKED_P (next
))
2841 nbytes
= vector_nbytes (next
);
2842 total_bytes
+= nbytes
;
2843 next
= ADVANCE (next
, nbytes
);
2846 eassert (total_bytes
% roundup_size
== 0);
2848 if (vector
== (struct Lisp_Vector
*) block
->data
2849 && !VECTOR_IN_BLOCK (next
, block
))
2850 /* This block should be freed because all of it's
2851 space was coalesced into the only free vector. */
2852 free_this_block
= 1;
2856 SETUP_ON_FREE_LIST (vector
, total_bytes
, tmp
);
2861 if (free_this_block
)
2863 *bprev
= block
->next
;
2864 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
2865 mem_delete (mem_find (block
->data
));
2870 bprev
= &block
->next
;
2873 /* Sweep large vectors. */
2875 for (lv
= large_vectors
; lv
; lv
= *lvprev
)
2878 if (VECTOR_MARKED_P (vector
))
2880 VECTOR_UNMARK (vector
);
2882 if (vector
->header
.size
& PSEUDOVECTOR_FLAG
)
2884 struct Lisp_Bool_Vector
*b
= (struct Lisp_Bool_Vector
*) vector
;
2886 /* All non-bool pseudovectors are small enough to be allocated
2887 from vector blocks. This code should be redesigned if some
2888 pseudovector type grows beyond VBLOCK_BYTES_MAX. */
2889 eassert (PSEUDOVECTOR_TYPEP (&vector
->header
, PVEC_BOOL_VECTOR
));
2892 += (bool_header_size
2893 + ((b
->size
+ BOOL_VECTOR_BITS_PER_CHAR
- 1)
2894 / BOOL_VECTOR_BITS_PER_CHAR
)) / word_size
;
2898 += header_size
/ word_size
+ vector
->header
.size
;
2899 lvprev
= &lv
->next
.vector
;
2903 *lvprev
= lv
->next
.vector
;
2909 /* Value is a pointer to a newly allocated Lisp_Vector structure
2910 with room for LEN Lisp_Objects. */
2912 static struct Lisp_Vector
*
2913 allocate_vectorlike (ptrdiff_t len
)
2915 struct Lisp_Vector
*p
;
2920 p
= XVECTOR (zero_vector
);
2923 size_t nbytes
= header_size
+ len
* word_size
;
2925 #ifdef DOUG_LEA_MALLOC
2926 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2927 because mapped region contents are not preserved in
2929 mallopt (M_MMAP_MAX
, 0);
2932 if (nbytes
<= VBLOCK_BYTES_MAX
)
2933 p
= allocate_vector_from_block (vroundup (nbytes
));
2936 struct large_vector
*lv
2937 = lisp_malloc ((offsetof (struct large_vector
, v
.contents
)
2939 MEM_TYPE_VECTORLIKE
);
2940 lv
->next
.vector
= large_vectors
;
2945 #ifdef DOUG_LEA_MALLOC
2946 /* Back to a reasonable maximum of mmap'ed areas. */
2947 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2950 consing_since_gc
+= nbytes
;
2951 vector_cells_consed
+= len
;
2954 MALLOC_UNBLOCK_INPUT
;
2960 /* Allocate a vector with LEN slots. */
2962 struct Lisp_Vector
*
2963 allocate_vector (EMACS_INT len
)
2965 struct Lisp_Vector
*v
;
2966 ptrdiff_t nbytes_max
= min (PTRDIFF_MAX
, SIZE_MAX
);
2968 if (min ((nbytes_max
- header_size
) / word_size
, MOST_POSITIVE_FIXNUM
) < len
)
2969 memory_full (SIZE_MAX
);
2970 v
= allocate_vectorlike (len
);
2971 v
->header
.size
= len
;
2976 /* Allocate other vector-like structures. */
2978 struct Lisp_Vector
*
2979 allocate_pseudovector (int memlen
, int lisplen
, enum pvec_type tag
)
2981 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2984 /* Catch bogus values. */
2985 eassert (tag
<= PVEC_FONT
);
2986 eassert (memlen
- lisplen
<= (1 << PSEUDOVECTOR_REST_BITS
) - 1);
2987 eassert (lisplen
<= (1 << PSEUDOVECTOR_SIZE_BITS
) - 1);
2989 /* Only the first lisplen slots will be traced normally by the GC. */
2990 for (i
= 0; i
< lisplen
; ++i
)
2991 v
->contents
[i
] = Qnil
;
2993 XSETPVECTYPESIZE (v
, tag
, lisplen
, memlen
- lisplen
);
2998 allocate_buffer (void)
3000 struct buffer
*b
= lisp_malloc (sizeof *b
, MEM_TYPE_BUFFER
);
3002 BUFFER_PVEC_INIT (b
);
3003 /* Put B on the chain of all buffers including killed ones. */
3004 b
->next
= all_buffers
;
3006 /* Note that the rest fields of B are not initialized. */
3010 struct Lisp_Hash_Table
*
3011 allocate_hash_table (void)
3013 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
3017 allocate_window (void)
3021 w
= ALLOCATE_PSEUDOVECTOR (struct window
, current_matrix
, PVEC_WINDOW
);
3022 /* Users assumes that non-Lisp data is zeroed. */
3023 memset (&w
->current_matrix
, 0,
3024 sizeof (*w
) - offsetof (struct window
, current_matrix
));
3029 allocate_terminal (void)
3033 t
= ALLOCATE_PSEUDOVECTOR (struct terminal
, next_terminal
, PVEC_TERMINAL
);
3034 /* Users assumes that non-Lisp data is zeroed. */
3035 memset (&t
->next_terminal
, 0,
3036 sizeof (*t
) - offsetof (struct terminal
, next_terminal
));
3041 allocate_frame (void)
3045 f
= ALLOCATE_PSEUDOVECTOR (struct frame
, face_cache
, PVEC_FRAME
);
3046 /* Users assumes that non-Lisp data is zeroed. */
3047 memset (&f
->face_cache
, 0,
3048 sizeof (*f
) - offsetof (struct frame
, face_cache
));
3052 struct Lisp_Process
*
3053 allocate_process (void)
3055 struct Lisp_Process
*p
;
3057 p
= ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
3058 /* Users assumes that non-Lisp data is zeroed. */
3060 sizeof (*p
) - offsetof (struct Lisp_Process
, pid
));
3064 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3065 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3066 See also the function `vector'. */)
3067 (register Lisp_Object length
, Lisp_Object init
)
3070 register ptrdiff_t sizei
;
3071 register ptrdiff_t i
;
3072 register struct Lisp_Vector
*p
;
3074 CHECK_NATNUM (length
);
3076 p
= allocate_vector (XFASTINT (length
));
3077 sizei
= XFASTINT (length
);
3078 for (i
= 0; i
< sizei
; i
++)
3079 p
->contents
[i
] = init
;
3081 XSETVECTOR (vector
, p
);
3086 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3087 doc
: /* Return a newly created vector with specified arguments as elements.
3088 Any number of arguments, even zero arguments, are allowed.
3089 usage: (vector &rest OBJECTS) */)
3090 (ptrdiff_t nargs
, Lisp_Object
*args
)
3093 register Lisp_Object val
= make_uninit_vector (nargs
);
3094 register struct Lisp_Vector
*p
= XVECTOR (val
);
3096 for (i
= 0; i
< nargs
; i
++)
3097 p
->contents
[i
] = args
[i
];
3102 make_byte_code (struct Lisp_Vector
*v
)
3104 if (v
->header
.size
> 1 && STRINGP (v
->contents
[1])
3105 && STRING_MULTIBYTE (v
->contents
[1]))
3106 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3107 earlier because they produced a raw 8-bit string for byte-code
3108 and now such a byte-code string is loaded as multibyte while
3109 raw 8-bit characters converted to multibyte form. Thus, now we
3110 must convert them back to the original unibyte form. */
3111 v
->contents
[1] = Fstring_as_unibyte (v
->contents
[1]);
3112 XSETPVECTYPE (v
, PVEC_COMPILED
);
3115 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3116 doc
: /* Create a byte-code object with specified arguments as elements.
3117 The arguments should be the ARGLIST, bytecode-string BYTE-CODE, constant
3118 vector CONSTANTS, maximum stack size DEPTH, (optional) DOCSTRING,
3119 and (optional) INTERACTIVE-SPEC.
3120 The first four arguments are required; at most six have any
3122 The ARGLIST can be either like the one of `lambda', in which case the arguments
3123 will be dynamically bound before executing the byte code, or it can be an
3124 integer of the form NNNNNNNRMMMMMMM where the 7bit MMMMMMM specifies the
3125 minimum number of arguments, the 7-bit NNNNNNN specifies the maximum number
3126 of arguments (ignoring &rest) and the R bit specifies whether there is a &rest
3127 argument to catch the left-over arguments. If such an integer is used, the
3128 arguments will not be dynamically bound but will be instead pushed on the
3129 stack before executing the byte-code.
3130 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3131 (ptrdiff_t nargs
, Lisp_Object
*args
)
3134 register Lisp_Object val
= make_uninit_vector (nargs
);
3135 register struct Lisp_Vector
*p
= XVECTOR (val
);
3137 /* We used to purecopy everything here, if purify-flag was set. This worked
3138 OK for Emacs-23, but with Emacs-24's lexical binding code, it can be
3139 dangerous, since make-byte-code is used during execution to build
3140 closures, so any closure built during the preload phase would end up
3141 copied into pure space, including its free variables, which is sometimes
3142 just wasteful and other times plainly wrong (e.g. those free vars may want
3145 for (i
= 0; i
< nargs
; i
++)
3146 p
->contents
[i
] = args
[i
];
3148 XSETCOMPILED (val
, p
);
3154 /***********************************************************************
3156 ***********************************************************************/
3158 /* Like struct Lisp_Symbol, but padded so that the size is a multiple
3159 of the required alignment if LSB tags are used. */
3161 union aligned_Lisp_Symbol
3163 struct Lisp_Symbol s
;
3165 unsigned char c
[(sizeof (struct Lisp_Symbol
) + GCALIGNMENT
- 1)
3170 /* Each symbol_block is just under 1020 bytes long, since malloc
3171 really allocates in units of powers of two and uses 4 bytes for its
3174 #define SYMBOL_BLOCK_SIZE \
3175 ((1020 - sizeof (struct symbol_block *)) / sizeof (union aligned_Lisp_Symbol))
3179 /* Place `symbols' first, to preserve alignment. */
3180 union aligned_Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3181 struct symbol_block
*next
;
3184 /* Current symbol block and index of first unused Lisp_Symbol
3187 static struct symbol_block
*symbol_block
;
3188 static int symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3190 /* List of free symbols. */
3192 static struct Lisp_Symbol
*symbol_free_list
;
3195 set_symbol_name (Lisp_Object sym
, Lisp_Object name
)
3197 XSYMBOL (sym
)->name
= name
;
3200 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3201 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3202 Its value is void, and its function definition and property list are nil. */)
3205 register Lisp_Object val
;
3206 register struct Lisp_Symbol
*p
;
3208 CHECK_STRING (name
);
3212 if (symbol_free_list
)
3214 XSETSYMBOL (val
, symbol_free_list
);
3215 symbol_free_list
= symbol_free_list
->next
;
3219 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3221 struct symbol_block
*new
3222 = lisp_malloc (sizeof *new, MEM_TYPE_SYMBOL
);
3223 new->next
= symbol_block
;
3225 symbol_block_index
= 0;
3226 total_free_symbols
+= SYMBOL_BLOCK_SIZE
;
3228 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
].s
);
3229 symbol_block_index
++;
3232 MALLOC_UNBLOCK_INPUT
;
3235 set_symbol_name (val
, name
);
3236 set_symbol_plist (val
, Qnil
);
3237 p
->redirect
= SYMBOL_PLAINVAL
;
3238 SET_SYMBOL_VAL (p
, Qunbound
);
3239 set_symbol_function (val
, Qnil
);
3240 set_symbol_next (val
, NULL
);
3242 p
->interned
= SYMBOL_UNINTERNED
;
3244 p
->declared_special
= 0;
3245 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3247 total_free_symbols
--;
3253 /***********************************************************************
3254 Marker (Misc) Allocation
3255 ***********************************************************************/
3257 /* Like union Lisp_Misc, but padded so that its size is a multiple of
3258 the required alignment when LSB tags are used. */
3260 union aligned_Lisp_Misc
3264 unsigned char c
[(sizeof (union Lisp_Misc
) + GCALIGNMENT
- 1)
3269 /* Allocation of markers and other objects that share that structure.
3270 Works like allocation of conses. */
3272 #define MARKER_BLOCK_SIZE \
3273 ((1020 - sizeof (struct marker_block *)) / sizeof (union aligned_Lisp_Misc))
3277 /* Place `markers' first, to preserve alignment. */
3278 union aligned_Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3279 struct marker_block
*next
;
3282 static struct marker_block
*marker_block
;
3283 static int marker_block_index
= MARKER_BLOCK_SIZE
;
3285 static union Lisp_Misc
*marker_free_list
;
3287 /* Return a newly allocated Lisp_Misc object of specified TYPE. */
3290 allocate_misc (enum Lisp_Misc_Type type
)
3296 if (marker_free_list
)
3298 XSETMISC (val
, marker_free_list
);
3299 marker_free_list
= marker_free_list
->u_free
.chain
;
3303 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3305 struct marker_block
*new = lisp_malloc (sizeof *new, MEM_TYPE_MISC
);
3306 new->next
= marker_block
;
3308 marker_block_index
= 0;
3309 total_free_markers
+= MARKER_BLOCK_SIZE
;
3311 XSETMISC (val
, &marker_block
->markers
[marker_block_index
].m
);
3312 marker_block_index
++;
3315 MALLOC_UNBLOCK_INPUT
;
3317 --total_free_markers
;
3318 consing_since_gc
+= sizeof (union Lisp_Misc
);
3319 misc_objects_consed
++;
3320 XMISCANY (val
)->type
= type
;
3321 XMISCANY (val
)->gcmarkbit
= 0;
3325 /* Free a Lisp_Misc object. */
3328 free_misc (Lisp_Object misc
)
3330 XMISCANY (misc
)->type
= Lisp_Misc_Free
;
3331 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3332 marker_free_list
= XMISC (misc
);
3333 consing_since_gc
-= sizeof (union Lisp_Misc
);
3334 total_free_markers
++;
3337 /* Verify properties of Lisp_Save_Value's representation
3338 that are assumed here and elsewhere. */
3340 verify (SAVE_UNUSED
== 0);
3341 verify (((SAVE_INTEGER
| SAVE_POINTER
| SAVE_FUNCPOINTER
| SAVE_OBJECT
)
3345 /* Return Lisp_Save_Value objects for the various combinations
3346 that callers need. */
3349 make_save_int_int_int (ptrdiff_t a
, ptrdiff_t b
, ptrdiff_t c
)
3351 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3352 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3353 p
->save_type
= SAVE_TYPE_INT_INT_INT
;
3354 p
->data
[0].integer
= a
;
3355 p
->data
[1].integer
= b
;
3356 p
->data
[2].integer
= c
;
3361 make_save_obj_obj_obj_obj (Lisp_Object a
, Lisp_Object b
, Lisp_Object c
,
3364 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3365 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3366 p
->save_type
= SAVE_TYPE_OBJ_OBJ_OBJ_OBJ
;
3367 p
->data
[0].object
= a
;
3368 p
->data
[1].object
= b
;
3369 p
->data
[2].object
= c
;
3370 p
->data
[3].object
= d
;
3374 #if defined HAVE_NS || defined DOS_NT
3376 make_save_ptr (void *a
)
3378 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3379 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3380 p
->save_type
= SAVE_POINTER
;
3381 p
->data
[0].pointer
= a
;
3387 make_save_ptr_int (void *a
, ptrdiff_t b
)
3389 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3390 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3391 p
->save_type
= SAVE_TYPE_PTR_INT
;
3392 p
->data
[0].pointer
= a
;
3393 p
->data
[1].integer
= b
;
3398 make_save_funcptr_ptr_obj (void (*a
) (void), void *b
, Lisp_Object c
)
3400 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3401 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3402 p
->save_type
= SAVE_TYPE_FUNCPTR_PTR_OBJ
;
3403 p
->data
[0].funcpointer
= a
;
3404 p
->data
[1].pointer
= b
;
3405 p
->data
[2].object
= c
;
3409 /* Return a Lisp_Save_Value object that represents an array A
3410 of N Lisp objects. */
3413 make_save_memory (Lisp_Object
*a
, ptrdiff_t n
)
3415 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3416 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3417 p
->save_type
= SAVE_TYPE_MEMORY
;
3418 p
->data
[0].pointer
= a
;
3419 p
->data
[1].integer
= n
;
3423 /* Free a Lisp_Save_Value object. Do not use this function
3424 if SAVE contains pointer other than returned by xmalloc. */
3427 free_save_value (Lisp_Object save
)
3429 xfree (XSAVE_POINTER (save
, 0));
3433 /* Return a Lisp_Misc_Overlay object with specified START, END and PLIST. */
3436 build_overlay (Lisp_Object start
, Lisp_Object end
, Lisp_Object plist
)
3438 register Lisp_Object overlay
;
3440 overlay
= allocate_misc (Lisp_Misc_Overlay
);
3441 OVERLAY_START (overlay
) = start
;
3442 OVERLAY_END (overlay
) = end
;
3443 set_overlay_plist (overlay
, plist
);
3444 XOVERLAY (overlay
)->next
= NULL
;
3448 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3449 doc
: /* Return a newly allocated marker which does not point at any place. */)
3452 register Lisp_Object val
;
3453 register struct Lisp_Marker
*p
;
3455 val
= allocate_misc (Lisp_Misc_Marker
);
3461 p
->insertion_type
= 0;
3465 /* Return a newly allocated marker which points into BUF
3466 at character position CHARPOS and byte position BYTEPOS. */
3469 build_marker (struct buffer
*buf
, ptrdiff_t charpos
, ptrdiff_t bytepos
)
3472 struct Lisp_Marker
*m
;
3474 /* No dead buffers here. */
3475 eassert (BUFFER_LIVE_P (buf
));
3477 /* Every character is at least one byte. */
3478 eassert (charpos
<= bytepos
);
3480 obj
= allocate_misc (Lisp_Misc_Marker
);
3483 m
->charpos
= charpos
;
3484 m
->bytepos
= bytepos
;
3485 m
->insertion_type
= 0;
3486 m
->next
= BUF_MARKERS (buf
);
3487 BUF_MARKERS (buf
) = m
;
3491 /* Put MARKER back on the free list after using it temporarily. */
3494 free_marker (Lisp_Object marker
)
3496 unchain_marker (XMARKER (marker
));
3501 /* Return a newly created vector or string with specified arguments as
3502 elements. If all the arguments are characters that can fit
3503 in a string of events, make a string; otherwise, make a vector.
3505 Any number of arguments, even zero arguments, are allowed. */
3508 make_event_array (register int nargs
, Lisp_Object
*args
)
3512 for (i
= 0; i
< nargs
; i
++)
3513 /* The things that fit in a string
3514 are characters that are in 0...127,
3515 after discarding the meta bit and all the bits above it. */
3516 if (!INTEGERP (args
[i
])
3517 || (XINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3518 return Fvector (nargs
, args
);
3520 /* Since the loop exited, we know that all the things in it are
3521 characters, so we can make a string. */
3525 result
= Fmake_string (make_number (nargs
), make_number (0));
3526 for (i
= 0; i
< nargs
; i
++)
3528 SSET (result
, i
, XINT (args
[i
]));
3529 /* Move the meta bit to the right place for a string char. */
3530 if (XINT (args
[i
]) & CHAR_META
)
3531 SSET (result
, i
, SREF (result
, i
) | 0x80);
3540 /************************************************************************
3541 Memory Full Handling
3542 ************************************************************************/
3545 /* Called if malloc (NBYTES) returns zero. If NBYTES == SIZE_MAX,
3546 there may have been size_t overflow so that malloc was never
3547 called, or perhaps malloc was invoked successfully but the
3548 resulting pointer had problems fitting into a tagged EMACS_INT. In
3549 either case this counts as memory being full even though malloc did
3553 memory_full (size_t nbytes
)
3555 /* Do not go into hysterics merely because a large request failed. */
3556 bool enough_free_memory
= 0;
3557 if (SPARE_MEMORY
< nbytes
)
3562 p
= malloc (SPARE_MEMORY
);
3566 enough_free_memory
= 1;
3568 MALLOC_UNBLOCK_INPUT
;
3571 if (! enough_free_memory
)
3577 memory_full_cons_threshold
= sizeof (struct cons_block
);
3579 /* The first time we get here, free the spare memory. */
3580 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3581 if (spare_memory
[i
])
3584 free (spare_memory
[i
]);
3585 else if (i
>= 1 && i
<= 4)
3586 lisp_align_free (spare_memory
[i
]);
3588 lisp_free (spare_memory
[i
]);
3589 spare_memory
[i
] = 0;
3593 /* This used to call error, but if we've run out of memory, we could
3594 get infinite recursion trying to build the string. */
3595 xsignal (Qnil
, Vmemory_signal_data
);
3598 /* If we released our reserve (due to running out of memory),
3599 and we have a fair amount free once again,
3600 try to set aside another reserve in case we run out once more.
3602 This is called when a relocatable block is freed in ralloc.c,
3603 and also directly from this file, in case we're not using ralloc.c. */
3606 refill_memory_reserve (void)
3608 #ifndef SYSTEM_MALLOC
3609 if (spare_memory
[0] == 0)
3610 spare_memory
[0] = malloc (SPARE_MEMORY
);
3611 if (spare_memory
[1] == 0)
3612 spare_memory
[1] = lisp_align_malloc (sizeof (struct cons_block
),
3614 if (spare_memory
[2] == 0)
3615 spare_memory
[2] = lisp_align_malloc (sizeof (struct cons_block
),
3617 if (spare_memory
[3] == 0)
3618 spare_memory
[3] = lisp_align_malloc (sizeof (struct cons_block
),
3620 if (spare_memory
[4] == 0)
3621 spare_memory
[4] = lisp_align_malloc (sizeof (struct cons_block
),
3623 if (spare_memory
[5] == 0)
3624 spare_memory
[5] = lisp_malloc (sizeof (struct string_block
),
3626 if (spare_memory
[6] == 0)
3627 spare_memory
[6] = lisp_malloc (sizeof (struct string_block
),
3629 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3630 Vmemory_full
= Qnil
;
3634 /************************************************************************
3636 ************************************************************************/
3638 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3640 /* Conservative C stack marking requires a method to identify possibly
3641 live Lisp objects given a pointer value. We do this by keeping
3642 track of blocks of Lisp data that are allocated in a red-black tree
3643 (see also the comment of mem_node which is the type of nodes in
3644 that tree). Function lisp_malloc adds information for an allocated
3645 block to the red-black tree with calls to mem_insert, and function
3646 lisp_free removes it with mem_delete. Functions live_string_p etc
3647 call mem_find to lookup information about a given pointer in the
3648 tree, and use that to determine if the pointer points to a Lisp
3651 /* Initialize this part of alloc.c. */
3656 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3657 mem_z
.parent
= NULL
;
3658 mem_z
.color
= MEM_BLACK
;
3659 mem_z
.start
= mem_z
.end
= NULL
;
3664 /* Value is a pointer to the mem_node containing START. Value is
3665 MEM_NIL if there is no node in the tree containing START. */
3667 static struct mem_node
*
3668 mem_find (void *start
)
3672 if (start
< min_heap_address
|| start
> max_heap_address
)
3675 /* Make the search always successful to speed up the loop below. */
3676 mem_z
.start
= start
;
3677 mem_z
.end
= (char *) start
+ 1;
3680 while (start
< p
->start
|| start
>= p
->end
)
3681 p
= start
< p
->start
? p
->left
: p
->right
;
3686 /* Insert a new node into the tree for a block of memory with start
3687 address START, end address END, and type TYPE. Value is a
3688 pointer to the node that was inserted. */
3690 static struct mem_node
*
3691 mem_insert (void *start
, void *end
, enum mem_type type
)
3693 struct mem_node
*c
, *parent
, *x
;
3695 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3696 min_heap_address
= start
;
3697 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3698 max_heap_address
= end
;
3700 /* See where in the tree a node for START belongs. In this
3701 particular application, it shouldn't happen that a node is already
3702 present. For debugging purposes, let's check that. */
3706 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3708 while (c
!= MEM_NIL
)
3710 if (start
>= c
->start
&& start
< c
->end
)
3713 c
= start
< c
->start
? c
->left
: c
->right
;
3716 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3718 while (c
!= MEM_NIL
)
3721 c
= start
< c
->start
? c
->left
: c
->right
;
3724 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3726 /* Create a new node. */
3727 #ifdef GC_MALLOC_CHECK
3728 x
= malloc (sizeof *x
);
3732 x
= xmalloc (sizeof *x
);
3738 x
->left
= x
->right
= MEM_NIL
;
3741 /* Insert it as child of PARENT or install it as root. */
3744 if (start
< parent
->start
)
3752 /* Re-establish red-black tree properties. */
3753 mem_insert_fixup (x
);
3759 /* Re-establish the red-black properties of the tree, and thereby
3760 balance the tree, after node X has been inserted; X is always red. */
3763 mem_insert_fixup (struct mem_node
*x
)
3765 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3767 /* X is red and its parent is red. This is a violation of
3768 red-black tree property #3. */
3770 if (x
->parent
== x
->parent
->parent
->left
)
3772 /* We're on the left side of our grandparent, and Y is our
3774 struct mem_node
*y
= x
->parent
->parent
->right
;
3776 if (y
->color
== MEM_RED
)
3778 /* Uncle and parent are red but should be black because
3779 X is red. Change the colors accordingly and proceed
3780 with the grandparent. */
3781 x
->parent
->color
= MEM_BLACK
;
3782 y
->color
= MEM_BLACK
;
3783 x
->parent
->parent
->color
= MEM_RED
;
3784 x
= x
->parent
->parent
;
3788 /* Parent and uncle have different colors; parent is
3789 red, uncle is black. */
3790 if (x
== x
->parent
->right
)
3793 mem_rotate_left (x
);
3796 x
->parent
->color
= MEM_BLACK
;
3797 x
->parent
->parent
->color
= MEM_RED
;
3798 mem_rotate_right (x
->parent
->parent
);
3803 /* This is the symmetrical case of above. */
3804 struct mem_node
*y
= x
->parent
->parent
->left
;
3806 if (y
->color
== MEM_RED
)
3808 x
->parent
->color
= MEM_BLACK
;
3809 y
->color
= MEM_BLACK
;
3810 x
->parent
->parent
->color
= MEM_RED
;
3811 x
= x
->parent
->parent
;
3815 if (x
== x
->parent
->left
)
3818 mem_rotate_right (x
);
3821 x
->parent
->color
= MEM_BLACK
;
3822 x
->parent
->parent
->color
= MEM_RED
;
3823 mem_rotate_left (x
->parent
->parent
);
3828 /* The root may have been changed to red due to the algorithm. Set
3829 it to black so that property #5 is satisfied. */
3830 mem_root
->color
= MEM_BLACK
;
3841 mem_rotate_left (struct mem_node
*x
)
3845 /* Turn y's left sub-tree into x's right sub-tree. */
3848 if (y
->left
!= MEM_NIL
)
3849 y
->left
->parent
= x
;
3851 /* Y's parent was x's parent. */
3853 y
->parent
= x
->parent
;
3855 /* Get the parent to point to y instead of x. */
3858 if (x
== x
->parent
->left
)
3859 x
->parent
->left
= y
;
3861 x
->parent
->right
= y
;
3866 /* Put x on y's left. */
3880 mem_rotate_right (struct mem_node
*x
)
3882 struct mem_node
*y
= x
->left
;
3885 if (y
->right
!= MEM_NIL
)
3886 y
->right
->parent
= x
;
3889 y
->parent
= x
->parent
;
3892 if (x
== x
->parent
->right
)
3893 x
->parent
->right
= y
;
3895 x
->parent
->left
= y
;
3906 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3909 mem_delete (struct mem_node
*z
)
3911 struct mem_node
*x
, *y
;
3913 if (!z
|| z
== MEM_NIL
)
3916 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3921 while (y
->left
!= MEM_NIL
)
3925 if (y
->left
!= MEM_NIL
)
3930 x
->parent
= y
->parent
;
3933 if (y
== y
->parent
->left
)
3934 y
->parent
->left
= x
;
3936 y
->parent
->right
= x
;
3943 z
->start
= y
->start
;
3948 if (y
->color
== MEM_BLACK
)
3949 mem_delete_fixup (x
);
3951 #ifdef GC_MALLOC_CHECK
3959 /* Re-establish the red-black properties of the tree, after a
3963 mem_delete_fixup (struct mem_node
*x
)
3965 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3967 if (x
== x
->parent
->left
)
3969 struct mem_node
*w
= x
->parent
->right
;
3971 if (w
->color
== MEM_RED
)
3973 w
->color
= MEM_BLACK
;
3974 x
->parent
->color
= MEM_RED
;
3975 mem_rotate_left (x
->parent
);
3976 w
= x
->parent
->right
;
3979 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3986 if (w
->right
->color
== MEM_BLACK
)
3988 w
->left
->color
= MEM_BLACK
;
3990 mem_rotate_right (w
);
3991 w
= x
->parent
->right
;
3993 w
->color
= x
->parent
->color
;
3994 x
->parent
->color
= MEM_BLACK
;
3995 w
->right
->color
= MEM_BLACK
;
3996 mem_rotate_left (x
->parent
);
4002 struct mem_node
*w
= x
->parent
->left
;
4004 if (w
->color
== MEM_RED
)
4006 w
->color
= MEM_BLACK
;
4007 x
->parent
->color
= MEM_RED
;
4008 mem_rotate_right (x
->parent
);
4009 w
= x
->parent
->left
;
4012 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
4019 if (w
->left
->color
== MEM_BLACK
)
4021 w
->right
->color
= MEM_BLACK
;
4023 mem_rotate_left (w
);
4024 w
= x
->parent
->left
;
4027 w
->color
= x
->parent
->color
;
4028 x
->parent
->color
= MEM_BLACK
;
4029 w
->left
->color
= MEM_BLACK
;
4030 mem_rotate_right (x
->parent
);
4036 x
->color
= MEM_BLACK
;
4040 /* Value is non-zero if P is a pointer to a live Lisp string on
4041 the heap. M is a pointer to the mem_block for P. */
4044 live_string_p (struct mem_node
*m
, void *p
)
4046 if (m
->type
== MEM_TYPE_STRING
)
4048 struct string_block
*b
= (struct string_block
*) m
->start
;
4049 ptrdiff_t offset
= (char *) p
- (char *) &b
->strings
[0];
4051 /* P must point to the start of a Lisp_String structure, and it
4052 must not be on the free-list. */
4054 && offset
% sizeof b
->strings
[0] == 0
4055 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
4056 && ((struct Lisp_String
*) p
)->data
!= NULL
);
4063 /* Value is non-zero if P is a pointer to a live Lisp cons on
4064 the heap. M is a pointer to the mem_block for P. */
4067 live_cons_p (struct mem_node
*m
, void *p
)
4069 if (m
->type
== MEM_TYPE_CONS
)
4071 struct cons_block
*b
= (struct cons_block
*) m
->start
;
4072 ptrdiff_t offset
= (char *) p
- (char *) &b
->conses
[0];
4074 /* P must point to the start of a Lisp_Cons, not be
4075 one of the unused cells in the current cons block,
4076 and not be on the free-list. */
4078 && offset
% sizeof b
->conses
[0] == 0
4079 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
4081 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
4082 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
4089 /* Value is non-zero if P is a pointer to a live Lisp symbol on
4090 the heap. M is a pointer to the mem_block for P. */
4093 live_symbol_p (struct mem_node
*m
, void *p
)
4095 if (m
->type
== MEM_TYPE_SYMBOL
)
4097 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
4098 ptrdiff_t offset
= (char *) p
- (char *) &b
->symbols
[0];
4100 /* P must point to the start of a Lisp_Symbol, not be
4101 one of the unused cells in the current symbol block,
4102 and not be on the free-list. */
4104 && offset
% sizeof b
->symbols
[0] == 0
4105 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
4106 && (b
!= symbol_block
4107 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
4108 && !EQ (((struct Lisp_Symbol
*)p
)->function
, Vdead
));
4115 /* Value is non-zero if P is a pointer to a live Lisp float on
4116 the heap. M is a pointer to the mem_block for P. */
4119 live_float_p (struct mem_node
*m
, void *p
)
4121 if (m
->type
== MEM_TYPE_FLOAT
)
4123 struct float_block
*b
= (struct float_block
*) m
->start
;
4124 ptrdiff_t offset
= (char *) p
- (char *) &b
->floats
[0];
4126 /* P must point to the start of a Lisp_Float and not be
4127 one of the unused cells in the current float block. */
4129 && offset
% sizeof b
->floats
[0] == 0
4130 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
4131 && (b
!= float_block
4132 || offset
/ sizeof b
->floats
[0] < float_block_index
));
4139 /* Value is non-zero if P is a pointer to a live Lisp Misc on
4140 the heap. M is a pointer to the mem_block for P. */
4143 live_misc_p (struct mem_node
*m
, void *p
)
4145 if (m
->type
== MEM_TYPE_MISC
)
4147 struct marker_block
*b
= (struct marker_block
*) m
->start
;
4148 ptrdiff_t offset
= (char *) p
- (char *) &b
->markers
[0];
4150 /* P must point to the start of a Lisp_Misc, not be
4151 one of the unused cells in the current misc block,
4152 and not be on the free-list. */
4154 && offset
% sizeof b
->markers
[0] == 0
4155 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4156 && (b
!= marker_block
4157 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4158 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
4165 /* Value is non-zero if P is a pointer to a live vector-like object.
4166 M is a pointer to the mem_block for P. */
4169 live_vector_p (struct mem_node
*m
, void *p
)
4171 if (m
->type
== MEM_TYPE_VECTOR_BLOCK
)
4173 /* This memory node corresponds to a vector block. */
4174 struct vector_block
*block
= (struct vector_block
*) m
->start
;
4175 struct Lisp_Vector
*vector
= (struct Lisp_Vector
*) block
->data
;
4177 /* P is in the block's allocation range. Scan the block
4178 up to P and see whether P points to the start of some
4179 vector which is not on a free list. FIXME: check whether
4180 some allocation patterns (probably a lot of short vectors)
4181 may cause a substantial overhead of this loop. */
4182 while (VECTOR_IN_BLOCK (vector
, block
)
4183 && vector
<= (struct Lisp_Vector
*) p
)
4185 if (!PSEUDOVECTOR_TYPEP (&vector
->header
, PVEC_FREE
) && vector
== p
)
4188 vector
= ADVANCE (vector
, vector_nbytes (vector
));
4191 else if (m
->type
== MEM_TYPE_VECTORLIKE
4192 && (char *) p
== ((char *) m
->start
4193 + offsetof (struct large_vector
, v
)))
4194 /* This memory node corresponds to a large vector. */
4200 /* Value is non-zero if P is a pointer to a live buffer. M is a
4201 pointer to the mem_block for P. */
4204 live_buffer_p (struct mem_node
*m
, void *p
)
4206 /* P must point to the start of the block, and the buffer
4207 must not have been killed. */
4208 return (m
->type
== MEM_TYPE_BUFFER
4210 && !NILP (((struct buffer
*) p
)->INTERNAL_FIELD (name
)));
4213 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4217 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4219 /* Array of objects that are kept alive because the C stack contains
4220 a pattern that looks like a reference to them . */
4222 #define MAX_ZOMBIES 10
4223 static Lisp_Object zombies
[MAX_ZOMBIES
];
4225 /* Number of zombie objects. */
4227 static EMACS_INT nzombies
;
4229 /* Number of garbage collections. */
4231 static EMACS_INT ngcs
;
4233 /* Average percentage of zombies per collection. */
4235 static double avg_zombies
;
4237 /* Max. number of live and zombie objects. */
4239 static EMACS_INT max_live
, max_zombies
;
4241 /* Average number of live objects per GC. */
4243 static double avg_live
;
4245 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4246 doc
: /* Show information about live and zombie objects. */)
4249 Lisp_Object args
[8], zombie_list
= Qnil
;
4251 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); i
++)
4252 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4253 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4254 args
[1] = make_number (ngcs
);
4255 args
[2] = make_float (avg_live
);
4256 args
[3] = make_float (avg_zombies
);
4257 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4258 args
[5] = make_number (max_live
);
4259 args
[6] = make_number (max_zombies
);
4260 args
[7] = zombie_list
;
4261 return Fmessage (8, args
);
4264 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4267 /* Mark OBJ if we can prove it's a Lisp_Object. */
4270 mark_maybe_object (Lisp_Object obj
)
4278 po
= (void *) XPNTR (obj
);
4285 switch (XTYPE (obj
))
4288 mark_p
= (live_string_p (m
, po
)
4289 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4293 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4297 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4301 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4304 case Lisp_Vectorlike
:
4305 /* Note: can't check BUFFERP before we know it's a
4306 buffer because checking that dereferences the pointer
4307 PO which might point anywhere. */
4308 if (live_vector_p (m
, po
))
4309 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4310 else if (live_buffer_p (m
, po
))
4311 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4315 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4324 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4325 if (nzombies
< MAX_ZOMBIES
)
4326 zombies
[nzombies
] = obj
;
4335 /* If P points to Lisp data, mark that as live if it isn't already
4339 mark_maybe_pointer (void *p
)
4343 /* Quickly rule out some values which can't point to Lisp data.
4344 USE_LSB_TAG needs Lisp data to be aligned on multiples of GCALIGNMENT.
4345 Otherwise, assume that Lisp data is aligned on even addresses. */
4346 if ((intptr_t) p
% (USE_LSB_TAG
? GCALIGNMENT
: 2))
4352 Lisp_Object obj
= Qnil
;
4356 case MEM_TYPE_NON_LISP
:
4357 case MEM_TYPE_SPARE
:
4358 /* Nothing to do; not a pointer to Lisp memory. */
4361 case MEM_TYPE_BUFFER
:
4362 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P ((struct buffer
*)p
))
4363 XSETVECTOR (obj
, p
);
4367 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4371 case MEM_TYPE_STRING
:
4372 if (live_string_p (m
, p
)
4373 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4374 XSETSTRING (obj
, p
);
4378 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4382 case MEM_TYPE_SYMBOL
:
4383 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4384 XSETSYMBOL (obj
, p
);
4387 case MEM_TYPE_FLOAT
:
4388 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4392 case MEM_TYPE_VECTORLIKE
:
4393 case MEM_TYPE_VECTOR_BLOCK
:
4394 if (live_vector_p (m
, p
))
4397 XSETVECTOR (tem
, p
);
4398 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4413 /* Alignment of pointer values. Use alignof, as it sometimes returns
4414 a smaller alignment than GCC's __alignof__ and mark_memory might
4415 miss objects if __alignof__ were used. */
4416 #define GC_POINTER_ALIGNMENT alignof (void *)
4418 /* Define POINTERS_MIGHT_HIDE_IN_OBJECTS to 1 if marking via C pointers does
4419 not suffice, which is the typical case. A host where a Lisp_Object is
4420 wider than a pointer might allocate a Lisp_Object in non-adjacent halves.
4421 If USE_LSB_TAG, the bottom half is not a valid pointer, but it should
4422 suffice to widen it to to a Lisp_Object and check it that way. */
4423 #if USE_LSB_TAG || VAL_MAX < UINTPTR_MAX
4424 # if !USE_LSB_TAG && VAL_MAX < UINTPTR_MAX >> GCTYPEBITS
4425 /* If tag bits straddle pointer-word boundaries, neither mark_maybe_pointer
4426 nor mark_maybe_object can follow the pointers. This should not occur on
4427 any practical porting target. */
4428 # error "MSB type bits straddle pointer-word boundaries"
4430 /* Marking via C pointers does not suffice, because Lisp_Objects contain
4431 pointer words that hold pointers ORed with type bits. */
4432 # define POINTERS_MIGHT_HIDE_IN_OBJECTS 1
4434 /* Marking via C pointers suffices, because Lisp_Objects contain pointer
4435 words that hold unmodified pointers. */
4436 # define POINTERS_MIGHT_HIDE_IN_OBJECTS 0
4439 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4440 or END+OFFSET..START. */
4443 mark_memory (void *start
, void *end
)
4444 #if defined (__clang__) && defined (__has_feature)
4445 #if __has_feature(address_sanitizer)
4446 /* Do not allow -faddress-sanitizer to check this function, since it
4447 crosses the function stack boundary, and thus would yield many
4449 __attribute__((no_address_safety_analysis
))
4456 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4460 /* Make START the pointer to the start of the memory region,
4461 if it isn't already. */
4469 /* Mark Lisp data pointed to. This is necessary because, in some
4470 situations, the C compiler optimizes Lisp objects away, so that
4471 only a pointer to them remains. Example:
4473 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4476 Lisp_Object obj = build_string ("test");
4477 struct Lisp_String *s = XSTRING (obj);
4478 Fgarbage_collect ();
4479 fprintf (stderr, "test `%s'\n", s->data);
4483 Here, `obj' isn't really used, and the compiler optimizes it
4484 away. The only reference to the life string is through the
4487 for (pp
= start
; (void *) pp
< end
; pp
++)
4488 for (i
= 0; i
< sizeof *pp
; i
+= GC_POINTER_ALIGNMENT
)
4490 void *p
= *(void **) ((char *) pp
+ i
);
4491 mark_maybe_pointer (p
);
4492 if (POINTERS_MIGHT_HIDE_IN_OBJECTS
)
4493 mark_maybe_object (XIL ((intptr_t) p
));
4497 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4499 static bool setjmp_tested_p
;
4500 static int longjmps_done
;
4502 #define SETJMP_WILL_LIKELY_WORK "\
4504 Emacs garbage collector has been changed to use conservative stack\n\
4505 marking. Emacs has determined that the method it uses to do the\n\
4506 marking will likely work on your system, but this isn't sure.\n\
4508 If you are a system-programmer, or can get the help of a local wizard\n\
4509 who is, please take a look at the function mark_stack in alloc.c, and\n\
4510 verify that the methods used are appropriate for your system.\n\
4512 Please mail the result to <emacs-devel@gnu.org>.\n\
4515 #define SETJMP_WILL_NOT_WORK "\
4517 Emacs garbage collector has been changed to use conservative stack\n\
4518 marking. Emacs has determined that the default method it uses to do the\n\
4519 marking will not work on your system. We will need a system-dependent\n\
4520 solution for your system.\n\
4522 Please take a look at the function mark_stack in alloc.c, and\n\
4523 try to find a way to make it work on your system.\n\
4525 Note that you may get false negatives, depending on the compiler.\n\
4526 In particular, you need to use -O with GCC for this test.\n\
4528 Please mail the result to <emacs-devel@gnu.org>.\n\
4532 /* Perform a quick check if it looks like setjmp saves registers in a
4533 jmp_buf. Print a message to stderr saying so. When this test
4534 succeeds, this is _not_ a proof that setjmp is sufficient for
4535 conservative stack marking. Only the sources or a disassembly
4545 /* Arrange for X to be put in a register. */
4551 if (longjmps_done
== 1)
4553 /* Came here after the longjmp at the end of the function.
4555 If x == 1, the longjmp has restored the register to its
4556 value before the setjmp, and we can hope that setjmp
4557 saves all such registers in the jmp_buf, although that
4560 For other values of X, either something really strange is
4561 taking place, or the setjmp just didn't save the register. */
4564 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4567 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4574 if (longjmps_done
== 1)
4575 sys_longjmp (jbuf
, 1);
4578 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4581 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4583 /* Abort if anything GCPRO'd doesn't survive the GC. */
4591 for (p
= gcprolist
; p
; p
= p
->next
)
4592 for (i
= 0; i
< p
->nvars
; ++i
)
4593 if (!survives_gc_p (p
->var
[i
]))
4594 /* FIXME: It's not necessarily a bug. It might just be that the
4595 GCPRO is unnecessary or should release the object sooner. */
4599 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4606 fprintf (stderr
, "\nZombies kept alive = %"pI
"d:\n", nzombies
);
4607 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4609 fprintf (stderr
, " %d = ", i
);
4610 debug_print (zombies
[i
]);
4614 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4617 /* Mark live Lisp objects on the C stack.
4619 There are several system-dependent problems to consider when
4620 porting this to new architectures:
4624 We have to mark Lisp objects in CPU registers that can hold local
4625 variables or are used to pass parameters.
4627 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4628 something that either saves relevant registers on the stack, or
4629 calls mark_maybe_object passing it each register's contents.
4631 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4632 implementation assumes that calling setjmp saves registers we need
4633 to see in a jmp_buf which itself lies on the stack. This doesn't
4634 have to be true! It must be verified for each system, possibly
4635 by taking a look at the source code of setjmp.
4637 If __builtin_unwind_init is available (defined by GCC >= 2.8) we
4638 can use it as a machine independent method to store all registers
4639 to the stack. In this case the macros described in the previous
4640 two paragraphs are not used.
4644 Architectures differ in the way their processor stack is organized.
4645 For example, the stack might look like this
4648 | Lisp_Object | size = 4
4650 | something else | size = 2
4652 | Lisp_Object | size = 4
4656 In such a case, not every Lisp_Object will be aligned equally. To
4657 find all Lisp_Object on the stack it won't be sufficient to walk
4658 the stack in steps of 4 bytes. Instead, two passes will be
4659 necessary, one starting at the start of the stack, and a second
4660 pass starting at the start of the stack + 2. Likewise, if the
4661 minimal alignment of Lisp_Objects on the stack is 1, four passes
4662 would be necessary, each one starting with one byte more offset
4663 from the stack start. */
4670 #ifdef HAVE___BUILTIN_UNWIND_INIT
4671 /* Force callee-saved registers and register windows onto the stack.
4672 This is the preferred method if available, obviating the need for
4673 machine dependent methods. */
4674 __builtin_unwind_init ();
4676 #else /* not HAVE___BUILTIN_UNWIND_INIT */
4677 #ifndef GC_SAVE_REGISTERS_ON_STACK
4678 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4679 union aligned_jmpbuf
{
4683 volatile bool stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4685 /* This trick flushes the register windows so that all the state of
4686 the process is contained in the stack. */
4687 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4688 needed on ia64 too. See mach_dep.c, where it also says inline
4689 assembler doesn't work with relevant proprietary compilers. */
4691 #if defined (__sparc64__) && defined (__FreeBSD__)
4692 /* FreeBSD does not have a ta 3 handler. */
4699 /* Save registers that we need to see on the stack. We need to see
4700 registers used to hold register variables and registers used to
4702 #ifdef GC_SAVE_REGISTERS_ON_STACK
4703 GC_SAVE_REGISTERS_ON_STACK (end
);
4704 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4706 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4707 setjmp will definitely work, test it
4708 and print a message with the result
4710 if (!setjmp_tested_p
)
4712 setjmp_tested_p
= 1;
4715 #endif /* GC_SETJMP_WORKS */
4718 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4719 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4720 #endif /* not HAVE___BUILTIN_UNWIND_INIT */
4722 /* This assumes that the stack is a contiguous region in memory. If
4723 that's not the case, something has to be done here to iterate
4724 over the stack segments. */
4725 mark_memory (stack_base
, end
);
4727 /* Allow for marking a secondary stack, like the register stack on the
4729 #ifdef GC_MARK_SECONDARY_STACK
4730 GC_MARK_SECONDARY_STACK ();
4733 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4738 #endif /* GC_MARK_STACK != 0 */
4741 /* Determine whether it is safe to access memory at address P. */
4743 valid_pointer_p (void *p
)
4746 return w32_valid_pointer_p (p
, 16);
4750 /* Obviously, we cannot just access it (we would SEGV trying), so we
4751 trick the o/s to tell us whether p is a valid pointer.
4752 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4753 not validate p in that case. */
4755 if (emacs_pipe (fd
) == 0)
4757 bool valid
= emacs_write (fd
[1], (char *) p
, 16) == 16;
4758 emacs_close (fd
[1]);
4759 emacs_close (fd
[0]);
4767 /* Return 2 if OBJ is a killed or special buffer object, 1 if OBJ is a
4768 valid lisp object, 0 if OBJ is NOT a valid lisp object, or -1 if we
4769 cannot validate OBJ. This function can be quite slow, so its primary
4770 use is the manual debugging. The only exception is print_object, where
4771 we use it to check whether the memory referenced by the pointer of
4772 Lisp_Save_Value object contains valid objects. */
4775 valid_lisp_object_p (Lisp_Object obj
)
4785 p
= (void *) XPNTR (obj
);
4786 if (PURE_POINTER_P (p
))
4789 if (p
== &buffer_defaults
|| p
== &buffer_local_symbols
)
4793 return valid_pointer_p (p
);
4800 int valid
= valid_pointer_p (p
);
4812 case MEM_TYPE_NON_LISP
:
4813 case MEM_TYPE_SPARE
:
4816 case MEM_TYPE_BUFFER
:
4817 return live_buffer_p (m
, p
) ? 1 : 2;
4820 return live_cons_p (m
, p
);
4822 case MEM_TYPE_STRING
:
4823 return live_string_p (m
, p
);
4826 return live_misc_p (m
, p
);
4828 case MEM_TYPE_SYMBOL
:
4829 return live_symbol_p (m
, p
);
4831 case MEM_TYPE_FLOAT
:
4832 return live_float_p (m
, p
);
4834 case MEM_TYPE_VECTORLIKE
:
4835 case MEM_TYPE_VECTOR_BLOCK
:
4836 return live_vector_p (m
, p
);
4849 /***********************************************************************
4850 Pure Storage Management
4851 ***********************************************************************/
4853 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4854 pointer to it. TYPE is the Lisp type for which the memory is
4855 allocated. TYPE < 0 means it's not used for a Lisp object. */
4858 pure_alloc (size_t size
, int type
)
4862 size_t alignment
= GCALIGNMENT
;
4864 size_t alignment
= alignof (EMACS_INT
);
4866 /* Give Lisp_Floats an extra alignment. */
4867 if (type
== Lisp_Float
)
4868 alignment
= alignof (struct Lisp_Float
);
4874 /* Allocate space for a Lisp object from the beginning of the free
4875 space with taking account of alignment. */
4876 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4877 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4881 /* Allocate space for a non-Lisp object from the end of the free
4883 pure_bytes_used_non_lisp
+= size
;
4884 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4886 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4888 if (pure_bytes_used
<= pure_size
)
4891 /* Don't allocate a large amount here,
4892 because it might get mmap'd and then its address
4893 might not be usable. */
4894 purebeg
= xmalloc (10000);
4896 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4897 pure_bytes_used
= 0;
4898 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4903 /* Print a warning if PURESIZE is too small. */
4906 check_pure_size (void)
4908 if (pure_bytes_used_before_overflow
)
4909 message (("emacs:0:Pure Lisp storage overflow (approx. %"pI
"d"
4911 pure_bytes_used
+ pure_bytes_used_before_overflow
);
4915 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4916 the non-Lisp data pool of the pure storage, and return its start
4917 address. Return NULL if not found. */
4920 find_string_data_in_pure (const char *data
, ptrdiff_t nbytes
)
4923 ptrdiff_t skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4924 const unsigned char *p
;
4927 if (pure_bytes_used_non_lisp
<= nbytes
)
4930 /* Set up the Boyer-Moore table. */
4932 for (i
= 0; i
< 256; i
++)
4935 p
= (const unsigned char *) data
;
4937 bm_skip
[*p
++] = skip
;
4939 last_char_skip
= bm_skip
['\0'];
4941 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4942 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4944 /* See the comments in the function `boyer_moore' (search.c) for the
4945 use of `infinity'. */
4946 infinity
= pure_bytes_used_non_lisp
+ 1;
4947 bm_skip
['\0'] = infinity
;
4949 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
4953 /* Check the last character (== '\0'). */
4956 start
+= bm_skip
[*(p
+ start
)];
4958 while (start
<= start_max
);
4960 if (start
< infinity
)
4961 /* Couldn't find the last character. */
4964 /* No less than `infinity' means we could find the last
4965 character at `p[start - infinity]'. */
4968 /* Check the remaining characters. */
4969 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4971 return non_lisp_beg
+ start
;
4973 start
+= last_char_skip
;
4975 while (start
<= start_max
);
4981 /* Return a string allocated in pure space. DATA is a buffer holding
4982 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4983 means make the result string multibyte.
4985 Must get an error if pure storage is full, since if it cannot hold
4986 a large string it may be able to hold conses that point to that
4987 string; then the string is not protected from gc. */
4990 make_pure_string (const char *data
,
4991 ptrdiff_t nchars
, ptrdiff_t nbytes
, bool multibyte
)
4994 struct Lisp_String
*s
= pure_alloc (sizeof *s
, Lisp_String
);
4995 s
->data
= (unsigned char *) find_string_data_in_pure (data
, nbytes
);
4996 if (s
->data
== NULL
)
4998 s
->data
= pure_alloc (nbytes
+ 1, -1);
4999 memcpy (s
->data
, data
, nbytes
);
5000 s
->data
[nbytes
] = '\0';
5003 s
->size_byte
= multibyte
? nbytes
: -1;
5004 s
->intervals
= NULL
;
5005 XSETSTRING (string
, s
);
5009 /* Return a string allocated in pure space. Do not
5010 allocate the string data, just point to DATA. */
5013 make_pure_c_string (const char *data
, ptrdiff_t nchars
)
5016 struct Lisp_String
*s
= pure_alloc (sizeof *s
, Lisp_String
);
5019 s
->data
= (unsigned char *) data
;
5020 s
->intervals
= NULL
;
5021 XSETSTRING (string
, s
);
5025 /* Return a cons allocated from pure space. Give it pure copies
5026 of CAR as car and CDR as cdr. */
5029 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
5032 struct Lisp_Cons
*p
= pure_alloc (sizeof *p
, Lisp_Cons
);
5034 XSETCAR (new, Fpurecopy (car
));
5035 XSETCDR (new, Fpurecopy (cdr
));
5040 /* Value is a float object with value NUM allocated from pure space. */
5043 make_pure_float (double num
)
5046 struct Lisp_Float
*p
= pure_alloc (sizeof *p
, Lisp_Float
);
5048 XFLOAT_INIT (new, num
);
5053 /* Return a vector with room for LEN Lisp_Objects allocated from
5057 make_pure_vector (ptrdiff_t len
)
5060 size_t size
= header_size
+ len
* word_size
;
5061 struct Lisp_Vector
*p
= pure_alloc (size
, Lisp_Vectorlike
);
5062 XSETVECTOR (new, p
);
5063 XVECTOR (new)->header
.size
= len
;
5068 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
5069 doc
: /* Make a copy of object OBJ in pure storage.
5070 Recursively copies contents of vectors and cons cells.
5071 Does not copy symbols. Copies strings without text properties. */)
5072 (register Lisp_Object obj
)
5074 if (NILP (Vpurify_flag
))
5077 if (PURE_POINTER_P (XPNTR (obj
)))
5080 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
5082 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
5088 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
5089 else if (FLOATP (obj
))
5090 obj
= make_pure_float (XFLOAT_DATA (obj
));
5091 else if (STRINGP (obj
))
5092 obj
= make_pure_string (SSDATA (obj
), SCHARS (obj
),
5094 STRING_MULTIBYTE (obj
));
5095 else if (COMPILEDP (obj
) || VECTORP (obj
))
5097 register struct Lisp_Vector
*vec
;
5098 register ptrdiff_t i
;
5102 if (size
& PSEUDOVECTOR_FLAG
)
5103 size
&= PSEUDOVECTOR_SIZE_MASK
;
5104 vec
= XVECTOR (make_pure_vector (size
));
5105 for (i
= 0; i
< size
; i
++)
5106 vec
->contents
[i
] = Fpurecopy (AREF (obj
, i
));
5107 if (COMPILEDP (obj
))
5109 XSETPVECTYPE (vec
, PVEC_COMPILED
);
5110 XSETCOMPILED (obj
, vec
);
5113 XSETVECTOR (obj
, vec
);
5115 else if (MARKERP (obj
))
5116 error ("Attempt to copy a marker to pure storage");
5118 /* Not purified, don't hash-cons. */
5121 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
5122 Fputhash (obj
, obj
, Vpurify_flag
);
5129 /***********************************************************************
5131 ***********************************************************************/
5133 /* Put an entry in staticvec, pointing at the variable with address
5137 staticpro (Lisp_Object
*varaddress
)
5139 staticvec
[staticidx
++] = varaddress
;
5140 if (staticidx
>= NSTATICS
)
5141 fatal ("NSTATICS too small; try increasing and recompiling Emacs.");
5145 /***********************************************************************
5147 ***********************************************************************/
5149 /* Temporarily prevent garbage collection. */
5152 inhibit_garbage_collection (void)
5154 ptrdiff_t count
= SPECPDL_INDEX ();
5156 specbind (Qgc_cons_threshold
, make_number (MOST_POSITIVE_FIXNUM
));
5160 /* Used to avoid possible overflows when
5161 converting from C to Lisp integers. */
5164 bounded_number (EMACS_INT number
)
5166 return make_number (min (MOST_POSITIVE_FIXNUM
, number
));
5169 /* Calculate total bytes of live objects. */
5172 total_bytes_of_live_objects (void)
5175 tot
+= total_conses
* sizeof (struct Lisp_Cons
);
5176 tot
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5177 tot
+= total_markers
* sizeof (union Lisp_Misc
);
5178 tot
+= total_string_bytes
;
5179 tot
+= total_vector_slots
* word_size
;
5180 tot
+= total_floats
* sizeof (struct Lisp_Float
);
5181 tot
+= total_intervals
* sizeof (struct interval
);
5182 tot
+= total_strings
* sizeof (struct Lisp_String
);
5186 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
5187 doc
: /* Reclaim storage for Lisp objects no longer needed.
5188 Garbage collection happens automatically if you cons more than
5189 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
5190 `garbage-collect' normally returns a list with info on amount of space in use,
5191 where each entry has the form (NAME SIZE USED FREE), where:
5192 - NAME is a symbol describing the kind of objects this entry represents,
5193 - SIZE is the number of bytes used by each one,
5194 - USED is the number of those objects that were found live in the heap,
5195 - FREE is the number of those objects that are not live but that Emacs
5196 keeps around for future allocations (maybe because it does not know how
5197 to return them to the OS).
5198 However, if there was overflow in pure space, `garbage-collect'
5199 returns nil, because real GC can't be done.
5200 See Info node `(elisp)Garbage Collection'. */)
5203 struct buffer
*nextb
;
5204 char stack_top_variable
;
5207 ptrdiff_t count
= SPECPDL_INDEX ();
5209 Lisp_Object retval
= Qnil
;
5210 size_t tot_before
= 0;
5215 /* Can't GC if pure storage overflowed because we can't determine
5216 if something is a pure object or not. */
5217 if (pure_bytes_used_before_overflow
)
5220 /* Record this function, so it appears on the profiler's backtraces. */
5221 record_in_backtrace (Qautomatic_gc
, &Qnil
, 0);
5225 /* Don't keep undo information around forever.
5226 Do this early on, so it is no problem if the user quits. */
5227 FOR_EACH_BUFFER (nextb
)
5228 compact_buffer (nextb
);
5230 if (profiler_memory_running
)
5231 tot_before
= total_bytes_of_live_objects ();
5233 start
= current_emacs_time ();
5235 /* In case user calls debug_print during GC,
5236 don't let that cause a recursive GC. */
5237 consing_since_gc
= 0;
5239 /* Save what's currently displayed in the echo area. */
5240 message_p
= push_message ();
5241 record_unwind_protect_void (pop_message_unwind
);
5243 /* Save a copy of the contents of the stack, for debugging. */
5244 #if MAX_SAVE_STACK > 0
5245 if (NILP (Vpurify_flag
))
5248 ptrdiff_t stack_size
;
5249 if (&stack_top_variable
< stack_bottom
)
5251 stack
= &stack_top_variable
;
5252 stack_size
= stack_bottom
- &stack_top_variable
;
5256 stack
= stack_bottom
;
5257 stack_size
= &stack_top_variable
- stack_bottom
;
5259 if (stack_size
<= MAX_SAVE_STACK
)
5261 if (stack_copy_size
< stack_size
)
5263 stack_copy
= xrealloc (stack_copy
, stack_size
);
5264 stack_copy_size
= stack_size
;
5266 memcpy (stack_copy
, stack
, stack_size
);
5269 #endif /* MAX_SAVE_STACK > 0 */
5271 if (garbage_collection_messages
)
5272 message1_nolog ("Garbage collecting...");
5276 shrink_regexp_cache ();
5280 /* Mark all the special slots that serve as the roots of accessibility. */
5282 mark_buffer (&buffer_defaults
);
5283 mark_buffer (&buffer_local_symbols
);
5285 for (i
= 0; i
< staticidx
; i
++)
5286 mark_object (*staticvec
[i
]);
5296 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5297 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5301 register struct gcpro
*tail
;
5302 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5303 for (i
= 0; i
< tail
->nvars
; i
++)
5304 mark_object (tail
->var
[i
]);
5308 struct catchtag
*catch;
5309 struct handler
*handler
;
5311 for (catch = catchlist
; catch; catch = catch->next
)
5313 mark_object (catch->tag
);
5314 mark_object (catch->val
);
5316 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5318 mark_object (handler
->handler
);
5319 mark_object (handler
->var
);
5324 #ifdef HAVE_WINDOW_SYSTEM
5325 mark_fringe_data ();
5328 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5332 /* Everything is now marked, except for the things that require special
5333 finalization, i.e. the undo_list.
5334 Look thru every buffer's undo list
5335 for elements that update markers that were not marked,
5337 FOR_EACH_BUFFER (nextb
)
5339 /* If a buffer's undo list is Qt, that means that undo is
5340 turned off in that buffer. Calling truncate_undo_list on
5341 Qt tends to return NULL, which effectively turns undo back on.
5342 So don't call truncate_undo_list if undo_list is Qt. */
5343 if (! EQ (nextb
->INTERNAL_FIELD (undo_list
), Qt
))
5345 Lisp_Object tail
, prev
;
5346 tail
= nextb
->INTERNAL_FIELD (undo_list
);
5348 while (CONSP (tail
))
5350 if (CONSP (XCAR (tail
))
5351 && MARKERP (XCAR (XCAR (tail
)))
5352 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5355 nextb
->INTERNAL_FIELD (undo_list
) = tail
= XCDR (tail
);
5359 XSETCDR (prev
, tail
);
5369 /* Now that we have stripped the elements that need not be in the
5370 undo_list any more, we can finally mark the list. */
5371 mark_object (nextb
->INTERNAL_FIELD (undo_list
));
5376 /* Clear the mark bits that we set in certain root slots. */
5378 unmark_byte_stack ();
5379 VECTOR_UNMARK (&buffer_defaults
);
5380 VECTOR_UNMARK (&buffer_local_symbols
);
5382 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5392 consing_since_gc
= 0;
5393 if (gc_cons_threshold
< GC_DEFAULT_THRESHOLD
/ 10)
5394 gc_cons_threshold
= GC_DEFAULT_THRESHOLD
/ 10;
5396 gc_relative_threshold
= 0;
5397 if (FLOATP (Vgc_cons_percentage
))
5398 { /* Set gc_cons_combined_threshold. */
5399 double tot
= total_bytes_of_live_objects ();
5401 tot
*= XFLOAT_DATA (Vgc_cons_percentage
);
5404 if (tot
< TYPE_MAXIMUM (EMACS_INT
))
5405 gc_relative_threshold
= tot
;
5407 gc_relative_threshold
= TYPE_MAXIMUM (EMACS_INT
);
5411 if (garbage_collection_messages
)
5413 if (message_p
|| minibuf_level
> 0)
5416 message1_nolog ("Garbage collecting...done");
5419 unbind_to (count
, Qnil
);
5421 Lisp_Object total
[11];
5422 int total_size
= 10;
5424 total
[0] = list4 (Qconses
, make_number (sizeof (struct Lisp_Cons
)),
5425 bounded_number (total_conses
),
5426 bounded_number (total_free_conses
));
5428 total
[1] = list4 (Qsymbols
, make_number (sizeof (struct Lisp_Symbol
)),
5429 bounded_number (total_symbols
),
5430 bounded_number (total_free_symbols
));
5432 total
[2] = list4 (Qmiscs
, make_number (sizeof (union Lisp_Misc
)),
5433 bounded_number (total_markers
),
5434 bounded_number (total_free_markers
));
5436 total
[3] = list4 (Qstrings
, make_number (sizeof (struct Lisp_String
)),
5437 bounded_number (total_strings
),
5438 bounded_number (total_free_strings
));
5440 total
[4] = list3 (Qstring_bytes
, make_number (1),
5441 bounded_number (total_string_bytes
));
5443 total
[5] = list3 (Qvectors
,
5444 make_number (header_size
+ sizeof (Lisp_Object
)),
5445 bounded_number (total_vectors
));
5447 total
[6] = list4 (Qvector_slots
, make_number (word_size
),
5448 bounded_number (total_vector_slots
),
5449 bounded_number (total_free_vector_slots
));
5451 total
[7] = list4 (Qfloats
, make_number (sizeof (struct Lisp_Float
)),
5452 bounded_number (total_floats
),
5453 bounded_number (total_free_floats
));
5455 total
[8] = list4 (Qintervals
, make_number (sizeof (struct interval
)),
5456 bounded_number (total_intervals
),
5457 bounded_number (total_free_intervals
));
5459 total
[9] = list3 (Qbuffers
, make_number (sizeof (struct buffer
)),
5460 bounded_number (total_buffers
));
5462 #ifdef DOUG_LEA_MALLOC
5464 total
[10] = list4 (Qheap
, make_number (1024),
5465 bounded_number ((mallinfo ().uordblks
+ 1023) >> 10),
5466 bounded_number ((mallinfo ().fordblks
+ 1023) >> 10));
5468 retval
= Flist (total_size
, total
);
5471 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5473 /* Compute average percentage of zombies. */
5475 = (total_conses
+ total_symbols
+ total_markers
+ total_strings
5476 + total_vectors
+ total_floats
+ total_intervals
+ total_buffers
);
5478 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5479 max_live
= max (nlive
, max_live
);
5480 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5481 max_zombies
= max (nzombies
, max_zombies
);
5486 if (!NILP (Vpost_gc_hook
))
5488 ptrdiff_t gc_count
= inhibit_garbage_collection ();
5489 safe_run_hooks (Qpost_gc_hook
);
5490 unbind_to (gc_count
, Qnil
);
5493 /* Accumulate statistics. */
5494 if (FLOATP (Vgc_elapsed
))
5496 EMACS_TIME since_start
= sub_emacs_time (current_emacs_time (), start
);
5497 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
)
5498 + EMACS_TIME_TO_DOUBLE (since_start
));
5503 /* Collect profiling data. */
5504 if (profiler_memory_running
)
5507 size_t tot_after
= total_bytes_of_live_objects ();
5508 if (tot_before
> tot_after
)
5509 swept
= tot_before
- tot_after
;
5510 malloc_probe (swept
);
5517 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5518 only interesting objects referenced from glyphs are strings. */
5521 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5523 struct glyph_row
*row
= matrix
->rows
;
5524 struct glyph_row
*end
= row
+ matrix
->nrows
;
5526 for (; row
< end
; ++row
)
5530 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5532 struct glyph
*glyph
= row
->glyphs
[area
];
5533 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5535 for (; glyph
< end_glyph
; ++glyph
)
5536 if (STRINGP (glyph
->object
)
5537 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5538 mark_object (glyph
->object
);
5544 /* Mark Lisp faces in the face cache C. */
5547 mark_face_cache (struct face_cache
*c
)
5552 for (i
= 0; i
< c
->used
; ++i
)
5554 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5558 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5559 mark_object (face
->lface
[j
]);
5567 /* Mark reference to a Lisp_Object.
5568 If the object referred to has not been seen yet, recursively mark
5569 all the references contained in it. */
5571 #define LAST_MARKED_SIZE 500
5572 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5573 static int last_marked_index
;
5575 /* For debugging--call abort when we cdr down this many
5576 links of a list, in mark_object. In debugging,
5577 the call to abort will hit a breakpoint.
5578 Normally this is zero and the check never goes off. */
5579 ptrdiff_t mark_object_loop_halt EXTERNALLY_VISIBLE
;
5582 mark_vectorlike (struct Lisp_Vector
*ptr
)
5584 ptrdiff_t size
= ptr
->header
.size
;
5587 eassert (!VECTOR_MARKED_P (ptr
));
5588 VECTOR_MARK (ptr
); /* Else mark it. */
5589 if (size
& PSEUDOVECTOR_FLAG
)
5590 size
&= PSEUDOVECTOR_SIZE_MASK
;
5592 /* Note that this size is not the memory-footprint size, but only
5593 the number of Lisp_Object fields that we should trace.
5594 The distinction is used e.g. by Lisp_Process which places extra
5595 non-Lisp_Object fields at the end of the structure... */
5596 for (i
= 0; i
< size
; i
++) /* ...and then mark its elements. */
5597 mark_object (ptr
->contents
[i
]);
5600 /* Like mark_vectorlike but optimized for char-tables (and
5601 sub-char-tables) assuming that the contents are mostly integers or
5605 mark_char_table (struct Lisp_Vector
*ptr
)
5607 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5610 eassert (!VECTOR_MARKED_P (ptr
));
5612 for (i
= 0; i
< size
; i
++)
5614 Lisp_Object val
= ptr
->contents
[i
];
5616 if (INTEGERP (val
) || (SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
))
5618 if (SUB_CHAR_TABLE_P (val
))
5620 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5621 mark_char_table (XVECTOR (val
));
5628 /* Mark the chain of overlays starting at PTR. */
5631 mark_overlay (struct Lisp_Overlay
*ptr
)
5633 for (; ptr
&& !ptr
->gcmarkbit
; ptr
= ptr
->next
)
5636 mark_object (ptr
->start
);
5637 mark_object (ptr
->end
);
5638 mark_object (ptr
->plist
);
5642 /* Mark Lisp_Objects and special pointers in BUFFER. */
5645 mark_buffer (struct buffer
*buffer
)
5647 /* This is handled much like other pseudovectors... */
5648 mark_vectorlike ((struct Lisp_Vector
*) buffer
);
5650 /* ...but there are some buffer-specific things. */
5652 MARK_INTERVAL_TREE (buffer_intervals (buffer
));
5654 /* For now, we just don't mark the undo_list. It's done later in
5655 a special way just before the sweep phase, and after stripping
5656 some of its elements that are not needed any more. */
5658 mark_overlay (buffer
->overlays_before
);
5659 mark_overlay (buffer
->overlays_after
);
5661 /* If this is an indirect buffer, mark its base buffer. */
5662 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5663 mark_buffer (buffer
->base_buffer
);
5666 /* Remove killed buffers or items whose car is a killed buffer from
5667 LIST, and mark other items. Return changed LIST, which is marked. */
5670 mark_discard_killed_buffers (Lisp_Object list
)
5672 Lisp_Object tail
, *prev
= &list
;
5674 for (tail
= list
; CONSP (tail
) && !CONS_MARKED_P (XCONS (tail
));
5677 Lisp_Object tem
= XCAR (tail
);
5680 if (BUFFERP (tem
) && !BUFFER_LIVE_P (XBUFFER (tem
)))
5681 *prev
= XCDR (tail
);
5684 CONS_MARK (XCONS (tail
));
5685 mark_object (XCAR (tail
));
5686 prev
= xcdr_addr (tail
);
5693 /* Determine type of generic Lisp_Object and mark it accordingly. */
5696 mark_object (Lisp_Object arg
)
5698 register Lisp_Object obj
= arg
;
5699 #ifdef GC_CHECK_MARKED_OBJECTS
5703 ptrdiff_t cdr_count
= 0;
5707 if (PURE_POINTER_P (XPNTR (obj
)))
5710 last_marked
[last_marked_index
++] = obj
;
5711 if (last_marked_index
== LAST_MARKED_SIZE
)
5712 last_marked_index
= 0;
5714 /* Perform some sanity checks on the objects marked here. Abort if
5715 we encounter an object we know is bogus. This increases GC time
5716 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5717 #ifdef GC_CHECK_MARKED_OBJECTS
5719 po
= (void *) XPNTR (obj
);
5721 /* Check that the object pointed to by PO is known to be a Lisp
5722 structure allocated from the heap. */
5723 #define CHECK_ALLOCATED() \
5725 m = mem_find (po); \
5730 /* Check that the object pointed to by PO is live, using predicate
5732 #define CHECK_LIVE(LIVEP) \
5734 if (!LIVEP (m, po)) \
5738 /* Check both of the above conditions. */
5739 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5741 CHECK_ALLOCATED (); \
5742 CHECK_LIVE (LIVEP); \
5745 #else /* not GC_CHECK_MARKED_OBJECTS */
5747 #define CHECK_LIVE(LIVEP) (void) 0
5748 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5750 #endif /* not GC_CHECK_MARKED_OBJECTS */
5752 switch (XTYPE (obj
))
5756 register struct Lisp_String
*ptr
= XSTRING (obj
);
5757 if (STRING_MARKED_P (ptr
))
5759 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5761 MARK_INTERVAL_TREE (ptr
->intervals
);
5762 #ifdef GC_CHECK_STRING_BYTES
5763 /* Check that the string size recorded in the string is the
5764 same as the one recorded in the sdata structure. */
5766 #endif /* GC_CHECK_STRING_BYTES */
5770 case Lisp_Vectorlike
:
5772 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5773 register ptrdiff_t pvectype
;
5775 if (VECTOR_MARKED_P (ptr
))
5778 #ifdef GC_CHECK_MARKED_OBJECTS
5780 if (m
== MEM_NIL
&& !SUBRP (obj
))
5782 #endif /* GC_CHECK_MARKED_OBJECTS */
5784 if (ptr
->header
.size
& PSEUDOVECTOR_FLAG
)
5785 pvectype
= ((ptr
->header
.size
& PVEC_TYPE_MASK
)
5786 >> PSEUDOVECTOR_AREA_BITS
);
5788 pvectype
= PVEC_NORMAL_VECTOR
;
5790 if (pvectype
!= PVEC_SUBR
&& pvectype
!= PVEC_BUFFER
)
5791 CHECK_LIVE (live_vector_p
);
5796 #ifdef GC_CHECK_MARKED_OBJECTS
5805 #endif /* GC_CHECK_MARKED_OBJECTS */
5806 mark_buffer ((struct buffer
*) ptr
);
5810 { /* We could treat this just like a vector, but it is better
5811 to save the COMPILED_CONSTANTS element for last and avoid
5813 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5817 for (i
= 0; i
< size
; i
++)
5818 if (i
!= COMPILED_CONSTANTS
)
5819 mark_object (ptr
->contents
[i
]);
5820 if (size
> COMPILED_CONSTANTS
)
5822 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5829 mark_vectorlike (ptr
);
5830 mark_face_cache (((struct frame
*) ptr
)->face_cache
);
5835 struct window
*w
= (struct window
*) ptr
;
5837 mark_vectorlike (ptr
);
5839 /* Mark glyph matrices, if any. Marking window
5840 matrices is sufficient because frame matrices
5841 use the same glyph memory. */
5842 if (w
->current_matrix
)
5844 mark_glyph_matrix (w
->current_matrix
);
5845 mark_glyph_matrix (w
->desired_matrix
);
5848 /* Filter out killed buffers from both buffer lists
5849 in attempt to help GC to reclaim killed buffers faster.
5850 We can do it elsewhere for live windows, but this is the
5851 best place to do it for dead windows. */
5853 (w
, mark_discard_killed_buffers (w
->prev_buffers
));
5855 (w
, mark_discard_killed_buffers (w
->next_buffers
));
5859 case PVEC_HASH_TABLE
:
5861 struct Lisp_Hash_Table
*h
= (struct Lisp_Hash_Table
*) ptr
;
5863 mark_vectorlike (ptr
);
5864 mark_object (h
->test
.name
);
5865 mark_object (h
->test
.user_hash_function
);
5866 mark_object (h
->test
.user_cmp_function
);
5867 /* If hash table is not weak, mark all keys and values.
5868 For weak tables, mark only the vector. */
5870 mark_object (h
->key_and_value
);
5872 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5876 case PVEC_CHAR_TABLE
:
5877 mark_char_table (ptr
);
5880 case PVEC_BOOL_VECTOR
:
5881 /* No Lisp_Objects to mark in a bool vector. */
5892 mark_vectorlike (ptr
);
5899 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5900 struct Lisp_Symbol
*ptrx
;
5904 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5906 mark_object (ptr
->function
);
5907 mark_object (ptr
->plist
);
5908 switch (ptr
->redirect
)
5910 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
5911 case SYMBOL_VARALIAS
:
5914 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
5918 case SYMBOL_LOCALIZED
:
5920 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
5921 Lisp_Object where
= blv
->where
;
5922 /* If the value is set up for a killed buffer or deleted
5923 frame, restore it's global binding. If the value is
5924 forwarded to a C variable, either it's not a Lisp_Object
5925 var, or it's staticpro'd already. */
5926 if ((BUFFERP (where
) && !BUFFER_LIVE_P (XBUFFER (where
)))
5927 || (FRAMEP (where
) && !FRAME_LIVE_P (XFRAME (where
))))
5928 swap_in_global_binding (ptr
);
5929 mark_object (blv
->where
);
5930 mark_object (blv
->valcell
);
5931 mark_object (blv
->defcell
);
5934 case SYMBOL_FORWARDED
:
5935 /* If the value is forwarded to a buffer or keyboard field,
5936 these are marked when we see the corresponding object.
5937 And if it's forwarded to a C variable, either it's not
5938 a Lisp_Object var, or it's staticpro'd already. */
5940 default: emacs_abort ();
5942 if (!PURE_POINTER_P (XSTRING (ptr
->name
)))
5943 MARK_STRING (XSTRING (ptr
->name
));
5944 MARK_INTERVAL_TREE (string_intervals (ptr
->name
));
5949 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun. */
5950 XSETSYMBOL (obj
, ptrx
);
5957 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5959 if (XMISCANY (obj
)->gcmarkbit
)
5962 switch (XMISCTYPE (obj
))
5964 case Lisp_Misc_Marker
:
5965 /* DO NOT mark thru the marker's chain.
5966 The buffer's markers chain does not preserve markers from gc;
5967 instead, markers are removed from the chain when freed by gc. */
5968 XMISCANY (obj
)->gcmarkbit
= 1;
5971 case Lisp_Misc_Save_Value
:
5972 XMISCANY (obj
)->gcmarkbit
= 1;
5974 struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5975 /* If `save_type' is zero, `data[0].pointer' is the address
5976 of a memory area containing `data[1].integer' potential
5978 if (GC_MARK_STACK
&& ptr
->save_type
== SAVE_TYPE_MEMORY
)
5980 Lisp_Object
*p
= ptr
->data
[0].pointer
;
5982 for (nelt
= ptr
->data
[1].integer
; nelt
> 0; nelt
--, p
++)
5983 mark_maybe_object (*p
);
5987 /* Find Lisp_Objects in `data[N]' slots and mark them. */
5989 for (i
= 0; i
< SAVE_VALUE_SLOTS
; i
++)
5990 if (save_type (ptr
, i
) == SAVE_OBJECT
)
5991 mark_object (ptr
->data
[i
].object
);
5996 case Lisp_Misc_Overlay
:
5997 mark_overlay (XOVERLAY (obj
));
6007 register struct Lisp_Cons
*ptr
= XCONS (obj
);
6008 if (CONS_MARKED_P (ptr
))
6010 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
6012 /* If the cdr is nil, avoid recursion for the car. */
6013 if (EQ (ptr
->u
.cdr
, Qnil
))
6019 mark_object (ptr
->car
);
6022 if (cdr_count
== mark_object_loop_halt
)
6028 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
6029 FLOAT_MARK (XFLOAT (obj
));
6040 #undef CHECK_ALLOCATED
6041 #undef CHECK_ALLOCATED_AND_LIVE
6043 /* Mark the Lisp pointers in the terminal objects.
6044 Called by Fgarbage_collect. */
6047 mark_terminals (void)
6050 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
6052 eassert (t
->name
!= NULL
);
6053 #ifdef HAVE_WINDOW_SYSTEM
6054 /* If a terminal object is reachable from a stacpro'ed object,
6055 it might have been marked already. Make sure the image cache
6057 mark_image_cache (t
->image_cache
);
6058 #endif /* HAVE_WINDOW_SYSTEM */
6059 if (!VECTOR_MARKED_P (t
))
6060 mark_vectorlike ((struct Lisp_Vector
*)t
);
6066 /* Value is non-zero if OBJ will survive the current GC because it's
6067 either marked or does not need to be marked to survive. */
6070 survives_gc_p (Lisp_Object obj
)
6074 switch (XTYPE (obj
))
6081 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
6085 survives_p
= XMISCANY (obj
)->gcmarkbit
;
6089 survives_p
= STRING_MARKED_P (XSTRING (obj
));
6092 case Lisp_Vectorlike
:
6093 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
6097 survives_p
= CONS_MARKED_P (XCONS (obj
));
6101 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
6108 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
6113 /* Sweep: find all structures not marked, and free them. */
6118 /* Remove or mark entries in weak hash tables.
6119 This must be done before any object is unmarked. */
6120 sweep_weak_hash_tables ();
6123 check_string_bytes (!noninteractive
);
6125 /* Put all unmarked conses on free list */
6127 register struct cons_block
*cblk
;
6128 struct cons_block
**cprev
= &cons_block
;
6129 register int lim
= cons_block_index
;
6130 EMACS_INT num_free
= 0, num_used
= 0;
6134 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
6138 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
6140 /* Scan the mark bits an int at a time. */
6141 for (i
= 0; i
< ilim
; i
++)
6143 if (cblk
->gcmarkbits
[i
] == -1)
6145 /* Fast path - all cons cells for this int are marked. */
6146 cblk
->gcmarkbits
[i
] = 0;
6147 num_used
+= BITS_PER_INT
;
6151 /* Some cons cells for this int are not marked.
6152 Find which ones, and free them. */
6153 int start
, pos
, stop
;
6155 start
= i
* BITS_PER_INT
;
6157 if (stop
> BITS_PER_INT
)
6158 stop
= BITS_PER_INT
;
6161 for (pos
= start
; pos
< stop
; pos
++)
6163 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
6166 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
6167 cons_free_list
= &cblk
->conses
[pos
];
6169 cons_free_list
->car
= Vdead
;
6175 CONS_UNMARK (&cblk
->conses
[pos
]);
6181 lim
= CONS_BLOCK_SIZE
;
6182 /* If this block contains only free conses and we have already
6183 seen more than two blocks worth of free conses then deallocate
6185 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
6187 *cprev
= cblk
->next
;
6188 /* Unhook from the free list. */
6189 cons_free_list
= cblk
->conses
[0].u
.chain
;
6190 lisp_align_free (cblk
);
6194 num_free
+= this_free
;
6195 cprev
= &cblk
->next
;
6198 total_conses
= num_used
;
6199 total_free_conses
= num_free
;
6202 /* Put all unmarked floats on free list */
6204 register struct float_block
*fblk
;
6205 struct float_block
**fprev
= &float_block
;
6206 register int lim
= float_block_index
;
6207 EMACS_INT num_free
= 0, num_used
= 0;
6209 float_free_list
= 0;
6211 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
6215 for (i
= 0; i
< lim
; i
++)
6216 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
6219 fblk
->floats
[i
].u
.chain
= float_free_list
;
6220 float_free_list
= &fblk
->floats
[i
];
6225 FLOAT_UNMARK (&fblk
->floats
[i
]);
6227 lim
= FLOAT_BLOCK_SIZE
;
6228 /* If this block contains only free floats and we have already
6229 seen more than two blocks worth of free floats then deallocate
6231 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
6233 *fprev
= fblk
->next
;
6234 /* Unhook from the free list. */
6235 float_free_list
= fblk
->floats
[0].u
.chain
;
6236 lisp_align_free (fblk
);
6240 num_free
+= this_free
;
6241 fprev
= &fblk
->next
;
6244 total_floats
= num_used
;
6245 total_free_floats
= num_free
;
6248 /* Put all unmarked intervals on free list */
6250 register struct interval_block
*iblk
;
6251 struct interval_block
**iprev
= &interval_block
;
6252 register int lim
= interval_block_index
;
6253 EMACS_INT num_free
= 0, num_used
= 0;
6255 interval_free_list
= 0;
6257 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
6262 for (i
= 0; i
< lim
; i
++)
6264 if (!iblk
->intervals
[i
].gcmarkbit
)
6266 set_interval_parent (&iblk
->intervals
[i
], interval_free_list
);
6267 interval_free_list
= &iblk
->intervals
[i
];
6273 iblk
->intervals
[i
].gcmarkbit
= 0;
6276 lim
= INTERVAL_BLOCK_SIZE
;
6277 /* If this block contains only free intervals and we have already
6278 seen more than two blocks worth of free intervals then
6279 deallocate this block. */
6280 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
6282 *iprev
= iblk
->next
;
6283 /* Unhook from the free list. */
6284 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
6289 num_free
+= this_free
;
6290 iprev
= &iblk
->next
;
6293 total_intervals
= num_used
;
6294 total_free_intervals
= num_free
;
6297 /* Put all unmarked symbols on free list */
6299 register struct symbol_block
*sblk
;
6300 struct symbol_block
**sprev
= &symbol_block
;
6301 register int lim
= symbol_block_index
;
6302 EMACS_INT num_free
= 0, num_used
= 0;
6304 symbol_free_list
= NULL
;
6306 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
6309 union aligned_Lisp_Symbol
*sym
= sblk
->symbols
;
6310 union aligned_Lisp_Symbol
*end
= sym
+ lim
;
6312 for (; sym
< end
; ++sym
)
6314 /* Check if the symbol was created during loadup. In such a case
6315 it might be pointed to by pure bytecode which we don't trace,
6316 so we conservatively assume that it is live. */
6317 bool pure_p
= PURE_POINTER_P (XSTRING (sym
->s
.name
));
6319 if (!sym
->s
.gcmarkbit
&& !pure_p
)
6321 if (sym
->s
.redirect
== SYMBOL_LOCALIZED
)
6322 xfree (SYMBOL_BLV (&sym
->s
));
6323 sym
->s
.next
= symbol_free_list
;
6324 symbol_free_list
= &sym
->s
;
6326 symbol_free_list
->function
= Vdead
;
6334 UNMARK_STRING (XSTRING (sym
->s
.name
));
6335 sym
->s
.gcmarkbit
= 0;
6339 lim
= SYMBOL_BLOCK_SIZE
;
6340 /* If this block contains only free symbols and we have already
6341 seen more than two blocks worth of free symbols then deallocate
6343 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6345 *sprev
= sblk
->next
;
6346 /* Unhook from the free list. */
6347 symbol_free_list
= sblk
->symbols
[0].s
.next
;
6352 num_free
+= this_free
;
6353 sprev
= &sblk
->next
;
6356 total_symbols
= num_used
;
6357 total_free_symbols
= num_free
;
6360 /* Put all unmarked misc's on free list.
6361 For a marker, first unchain it from the buffer it points into. */
6363 register struct marker_block
*mblk
;
6364 struct marker_block
**mprev
= &marker_block
;
6365 register int lim
= marker_block_index
;
6366 EMACS_INT num_free
= 0, num_used
= 0;
6368 marker_free_list
= 0;
6370 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6375 for (i
= 0; i
< lim
; i
++)
6377 if (!mblk
->markers
[i
].m
.u_any
.gcmarkbit
)
6379 if (mblk
->markers
[i
].m
.u_any
.type
== Lisp_Misc_Marker
)
6380 unchain_marker (&mblk
->markers
[i
].m
.u_marker
);
6381 /* Set the type of the freed object to Lisp_Misc_Free.
6382 We could leave the type alone, since nobody checks it,
6383 but this might catch bugs faster. */
6384 mblk
->markers
[i
].m
.u_marker
.type
= Lisp_Misc_Free
;
6385 mblk
->markers
[i
].m
.u_free
.chain
= marker_free_list
;
6386 marker_free_list
= &mblk
->markers
[i
].m
;
6392 mblk
->markers
[i
].m
.u_any
.gcmarkbit
= 0;
6395 lim
= MARKER_BLOCK_SIZE
;
6396 /* If this block contains only free markers and we have already
6397 seen more than two blocks worth of free markers then deallocate
6399 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6401 *mprev
= mblk
->next
;
6402 /* Unhook from the free list. */
6403 marker_free_list
= mblk
->markers
[0].m
.u_free
.chain
;
6408 num_free
+= this_free
;
6409 mprev
= &mblk
->next
;
6413 total_markers
= num_used
;
6414 total_free_markers
= num_free
;
6417 /* Free all unmarked buffers */
6419 register struct buffer
*buffer
, **bprev
= &all_buffers
;
6422 for (buffer
= all_buffers
; buffer
; buffer
= *bprev
)
6423 if (!VECTOR_MARKED_P (buffer
))
6425 *bprev
= buffer
->next
;
6430 VECTOR_UNMARK (buffer
);
6431 /* Do not use buffer_(set|get)_intervals here. */
6432 buffer
->text
->intervals
= balance_intervals (buffer
->text
->intervals
);
6434 bprev
= &buffer
->next
;
6439 check_string_bytes (!noninteractive
);
6445 /* Debugging aids. */
6447 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6448 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6449 This may be helpful in debugging Emacs's memory usage.
6450 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6455 XSETINT (end
, (intptr_t) (char *) sbrk (0) / 1024);
6460 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6461 doc
: /* Return a list of counters that measure how much consing there has been.
6462 Each of these counters increments for a certain kind of object.
6463 The counters wrap around from the largest positive integer to zero.
6464 Garbage collection does not decrease them.
6465 The elements of the value are as follows:
6466 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6467 All are in units of 1 = one object consed
6468 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6470 MISCS include overlays, markers, and some internal types.
6471 Frames, windows, buffers, and subprocesses count as vectors
6472 (but the contents of a buffer's text do not count here). */)
6475 return listn (CONSTYPE_HEAP
, 8,
6476 bounded_number (cons_cells_consed
),
6477 bounded_number (floats_consed
),
6478 bounded_number (vector_cells_consed
),
6479 bounded_number (symbols_consed
),
6480 bounded_number (string_chars_consed
),
6481 bounded_number (misc_objects_consed
),
6482 bounded_number (intervals_consed
),
6483 bounded_number (strings_consed
));
6486 /* Find at most FIND_MAX symbols which have OBJ as their value or
6487 function. This is used in gdbinit's `xwhichsymbols' command. */
6490 which_symbols (Lisp_Object obj
, EMACS_INT find_max
)
6492 struct symbol_block
*sblk
;
6493 ptrdiff_t gc_count
= inhibit_garbage_collection ();
6494 Lisp_Object found
= Qnil
;
6498 for (sblk
= symbol_block
; sblk
; sblk
= sblk
->next
)
6500 union aligned_Lisp_Symbol
*aligned_sym
= sblk
->symbols
;
6503 for (bn
= 0; bn
< SYMBOL_BLOCK_SIZE
; bn
++, aligned_sym
++)
6505 struct Lisp_Symbol
*sym
= &aligned_sym
->s
;
6509 if (sblk
== symbol_block
&& bn
>= symbol_block_index
)
6512 XSETSYMBOL (tem
, sym
);
6513 val
= find_symbol_value (tem
);
6515 || EQ (sym
->function
, obj
)
6516 || (!NILP (sym
->function
)
6517 && COMPILEDP (sym
->function
)
6518 && EQ (AREF (sym
->function
, COMPILED_BYTECODE
), obj
))
6521 && EQ (AREF (val
, COMPILED_BYTECODE
), obj
)))
6523 found
= Fcons (tem
, found
);
6524 if (--find_max
== 0)
6532 unbind_to (gc_count
, Qnil
);
6536 #ifdef ENABLE_CHECKING
6538 bool suppress_checking
;
6541 die (const char *msg
, const char *file
, int line
)
6543 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: assertion failed: %s\r\n",
6545 terminate_due_to_signal (SIGABRT
, INT_MAX
);
6549 /* Initialization. */
6552 init_alloc_once (void)
6554 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6556 pure_size
= PURESIZE
;
6558 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6560 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6563 #ifdef DOUG_LEA_MALLOC
6564 mallopt (M_TRIM_THRESHOLD
, 128 * 1024); /* Trim threshold. */
6565 mallopt (M_MMAP_THRESHOLD
, 64 * 1024); /* Mmap threshold. */
6566 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* Max. number of mmap'ed areas. */
6571 refill_memory_reserve ();
6572 gc_cons_threshold
= GC_DEFAULT_THRESHOLD
;
6579 byte_stack_list
= 0;
6581 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6582 setjmp_tested_p
= longjmps_done
= 0;
6585 Vgc_elapsed
= make_float (0.0);
6590 syms_of_alloc (void)
6592 DEFVAR_INT ("gc-cons-threshold", gc_cons_threshold
,
6593 doc
: /* Number of bytes of consing between garbage collections.
6594 Garbage collection can happen automatically once this many bytes have been
6595 allocated since the last garbage collection. All data types count.
6597 Garbage collection happens automatically only when `eval' is called.
6599 By binding this temporarily to a large number, you can effectively
6600 prevent garbage collection during a part of the program.
6601 See also `gc-cons-percentage'. */);
6603 DEFVAR_LISP ("gc-cons-percentage", Vgc_cons_percentage
,
6604 doc
: /* Portion of the heap used for allocation.
6605 Garbage collection can happen automatically once this portion of the heap
6606 has been allocated since the last garbage collection.
6607 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6608 Vgc_cons_percentage
= make_float (0.1);
6610 DEFVAR_INT ("pure-bytes-used", pure_bytes_used
,
6611 doc
: /* Number of bytes of shareable Lisp data allocated so far. */);
6613 DEFVAR_INT ("cons-cells-consed", cons_cells_consed
,
6614 doc
: /* Number of cons cells that have been consed so far. */);
6616 DEFVAR_INT ("floats-consed", floats_consed
,
6617 doc
: /* Number of floats that have been consed so far. */);
6619 DEFVAR_INT ("vector-cells-consed", vector_cells_consed
,
6620 doc
: /* Number of vector cells that have been consed so far. */);
6622 DEFVAR_INT ("symbols-consed", symbols_consed
,
6623 doc
: /* Number of symbols that have been consed so far. */);
6625 DEFVAR_INT ("string-chars-consed", string_chars_consed
,
6626 doc
: /* Number of string characters that have been consed so far. */);
6628 DEFVAR_INT ("misc-objects-consed", misc_objects_consed
,
6629 doc
: /* Number of miscellaneous objects that have been consed so far.
6630 These include markers and overlays, plus certain objects not visible
6633 DEFVAR_INT ("intervals-consed", intervals_consed
,
6634 doc
: /* Number of intervals that have been consed so far. */);
6636 DEFVAR_INT ("strings-consed", strings_consed
,
6637 doc
: /* Number of strings that have been consed so far. */);
6639 DEFVAR_LISP ("purify-flag", Vpurify_flag
,
6640 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6641 This means that certain objects should be allocated in shared (pure) space.
6642 It can also be set to a hash-table, in which case this table is used to
6643 do hash-consing of the objects allocated to pure space. */);
6645 DEFVAR_BOOL ("garbage-collection-messages", garbage_collection_messages
,
6646 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6647 garbage_collection_messages
= 0;
6649 DEFVAR_LISP ("post-gc-hook", Vpost_gc_hook
,
6650 doc
: /* Hook run after garbage collection has finished. */);
6651 Vpost_gc_hook
= Qnil
;
6652 DEFSYM (Qpost_gc_hook
, "post-gc-hook");
6654 DEFVAR_LISP ("memory-signal-data", Vmemory_signal_data
,
6655 doc
: /* Precomputed `signal' argument for memory-full error. */);
6656 /* We build this in advance because if we wait until we need it, we might
6657 not be able to allocate the memory to hold it. */
6659 = listn (CONSTYPE_PURE
, 2, Qerror
,
6660 build_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
6662 DEFVAR_LISP ("memory-full", Vmemory_full
,
6663 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6664 Vmemory_full
= Qnil
;
6666 DEFSYM (Qconses
, "conses");
6667 DEFSYM (Qsymbols
, "symbols");
6668 DEFSYM (Qmiscs
, "miscs");
6669 DEFSYM (Qstrings
, "strings");
6670 DEFSYM (Qvectors
, "vectors");
6671 DEFSYM (Qfloats
, "floats");
6672 DEFSYM (Qintervals
, "intervals");
6673 DEFSYM (Qbuffers
, "buffers");
6674 DEFSYM (Qstring_bytes
, "string-bytes");
6675 DEFSYM (Qvector_slots
, "vector-slots");
6676 DEFSYM (Qheap
, "heap");
6677 DEFSYM (Qautomatic_gc
, "Automatic GC");
6679 DEFSYM (Qgc_cons_threshold
, "gc-cons-threshold");
6680 DEFSYM (Qchar_table_extra_slots
, "char-table-extra-slots");
6682 DEFVAR_LISP ("gc-elapsed", Vgc_elapsed
,
6683 doc
: /* Accumulated time elapsed in garbage collections.
6684 The time is in seconds as a floating point value. */);
6685 DEFVAR_INT ("gcs-done", gcs_done
,
6686 doc
: /* Accumulated number of garbage collections done. */);
6691 defsubr (&Smake_byte_code
);
6692 defsubr (&Smake_list
);
6693 defsubr (&Smake_vector
);
6694 defsubr (&Smake_string
);
6695 defsubr (&Smake_bool_vector
);
6696 defsubr (&Smake_symbol
);
6697 defsubr (&Smake_marker
);
6698 defsubr (&Spurecopy
);
6699 defsubr (&Sgarbage_collect
);
6700 defsubr (&Smemory_limit
);
6701 defsubr (&Smemory_use_counts
);
6703 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6704 defsubr (&Sgc_status
);
6708 /* When compiled with GCC, GDB might say "No enum type named
6709 pvec_type" if we don't have at least one symbol with that type, and
6710 then xbacktrace could fail. Similarly for the other enums and
6711 their values. Some non-GCC compilers don't like these constructs. */
6715 enum CHARTAB_SIZE_BITS CHARTAB_SIZE_BITS
;
6716 enum CHAR_TABLE_STANDARD_SLOTS CHAR_TABLE_STANDARD_SLOTS
;
6717 enum char_bits char_bits
;
6718 enum CHECK_LISP_OBJECT_TYPE CHECK_LISP_OBJECT_TYPE
;
6719 enum DEFAULT_HASH_SIZE DEFAULT_HASH_SIZE
;
6720 enum enum_USE_LSB_TAG enum_USE_LSB_TAG
;
6721 enum FLOAT_TO_STRING_BUFSIZE FLOAT_TO_STRING_BUFSIZE
;
6722 enum Lisp_Bits Lisp_Bits
;
6723 enum Lisp_Compiled Lisp_Compiled
;
6724 enum maxargs maxargs
;
6725 enum MAX_ALLOCA MAX_ALLOCA
;
6726 enum More_Lisp_Bits More_Lisp_Bits
;
6727 enum pvec_type pvec_type
;
6728 } const EXTERNALLY_VISIBLE gdb_make_enums_visible
= {0};
6729 #endif /* __GNUC__ */