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 /* Root of the tree describing allocated Lisp memory. */
306 static struct mem_node
*mem_root
;
308 /* Lowest and highest known address in the heap. */
310 static void *min_heap_address
, *max_heap_address
;
312 /* Sentinel node of the tree. */
314 static struct mem_node mem_z
;
315 #define MEM_NIL &mem_z
317 static struct mem_node
*mem_insert (void *, void *, enum mem_type
);
318 static void mem_insert_fixup (struct mem_node
*);
319 static void mem_rotate_left (struct mem_node
*);
320 static void mem_rotate_right (struct mem_node
*);
321 static void mem_delete (struct mem_node
*);
322 static void mem_delete_fixup (struct mem_node
*);
323 static struct mem_node
*mem_find (void *);
325 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
331 /* Addresses of staticpro'd variables. Initialize it to a nonzero
332 value; otherwise some compilers put it into BSS. */
334 enum { NSTATICS
= 2048 };
335 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
337 /* Index of next unused slot in staticvec. */
339 static int staticidx
;
341 static void *pure_alloc (size_t, int);
344 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
345 ALIGNMENT must be a power of 2. */
347 #define ALIGN(ptr, ALIGNMENT) \
348 ((void *) (((uintptr_t) (ptr) + (ALIGNMENT) - 1) \
349 & ~ ((ALIGNMENT) - 1)))
352 XFLOAT_INIT (Lisp_Object f
, double n
)
354 XFLOAT (f
)->u
.data
= n
;
358 /************************************************************************
360 ************************************************************************/
362 /* Function malloc calls this if it finds we are near exhausting storage. */
365 malloc_warning (const char *str
)
367 pending_malloc_warning
= str
;
371 /* Display an already-pending malloc warning. */
374 display_malloc_warning (void)
376 call3 (intern ("display-warning"),
378 build_string (pending_malloc_warning
),
379 intern ("emergency"));
380 pending_malloc_warning
= 0;
383 /* Called if we can't allocate relocatable space for a buffer. */
386 buffer_memory_full (ptrdiff_t nbytes
)
388 /* If buffers use the relocating allocator, no need to free
389 spare_memory, because we may have plenty of malloc space left
390 that we could get, and if we don't, the malloc that fails will
391 itself cause spare_memory to be freed. If buffers don't use the
392 relocating allocator, treat this like any other failing
396 memory_full (nbytes
);
398 /* This used to call error, but if we've run out of memory, we could
399 get infinite recursion trying to build the string. */
400 xsignal (Qnil
, Vmemory_signal_data
);
404 /* A common multiple of the positive integers A and B. Ideally this
405 would be the least common multiple, but there's no way to do that
406 as a constant expression in C, so do the best that we can easily do. */
407 #define COMMON_MULTIPLE(a, b) \
408 ((a) % (b) == 0 ? (a) : (b) % (a) == 0 ? (b) : (a) * (b))
410 #ifndef XMALLOC_OVERRUN_CHECK
411 #define XMALLOC_OVERRUN_CHECK_OVERHEAD 0
414 /* Check for overrun in malloc'ed buffers by wrapping a header and trailer
417 The header consists of XMALLOC_OVERRUN_CHECK_SIZE fixed bytes
418 followed by XMALLOC_OVERRUN_SIZE_SIZE bytes containing the original
419 block size in little-endian order. The trailer consists of
420 XMALLOC_OVERRUN_CHECK_SIZE fixed bytes.
422 The header is used to detect whether this block has been allocated
423 through these functions, as some low-level libc functions may
424 bypass the malloc hooks. */
426 #define XMALLOC_OVERRUN_CHECK_SIZE 16
427 #define XMALLOC_OVERRUN_CHECK_OVERHEAD \
428 (2 * XMALLOC_OVERRUN_CHECK_SIZE + XMALLOC_OVERRUN_SIZE_SIZE)
430 /* Define XMALLOC_OVERRUN_SIZE_SIZE so that (1) it's large enough to
431 hold a size_t value and (2) the header size is a multiple of the
432 alignment that Emacs needs for C types and for USE_LSB_TAG. */
433 #define XMALLOC_BASE_ALIGNMENT \
434 alignof (union { long double d; intmax_t i; void *p; })
437 # define XMALLOC_HEADER_ALIGNMENT \
438 COMMON_MULTIPLE (GCALIGNMENT, XMALLOC_BASE_ALIGNMENT)
440 # define XMALLOC_HEADER_ALIGNMENT XMALLOC_BASE_ALIGNMENT
442 #define XMALLOC_OVERRUN_SIZE_SIZE \
443 (((XMALLOC_OVERRUN_CHECK_SIZE + sizeof (size_t) \
444 + XMALLOC_HEADER_ALIGNMENT - 1) \
445 / XMALLOC_HEADER_ALIGNMENT * XMALLOC_HEADER_ALIGNMENT) \
446 - XMALLOC_OVERRUN_CHECK_SIZE)
448 static char const xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
] =
449 { '\x9a', '\x9b', '\xae', '\xaf',
450 '\xbf', '\xbe', '\xce', '\xcf',
451 '\xea', '\xeb', '\xec', '\xed',
452 '\xdf', '\xde', '\x9c', '\x9d' };
454 static char const xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
455 { '\xaa', '\xab', '\xac', '\xad',
456 '\xba', '\xbb', '\xbc', '\xbd',
457 '\xca', '\xcb', '\xcc', '\xcd',
458 '\xda', '\xdb', '\xdc', '\xdd' };
460 /* Insert and extract the block size in the header. */
463 xmalloc_put_size (unsigned char *ptr
, size_t size
)
466 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
468 *--ptr
= size
& ((1 << CHAR_BIT
) - 1);
474 xmalloc_get_size (unsigned char *ptr
)
478 ptr
-= XMALLOC_OVERRUN_SIZE_SIZE
;
479 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
488 /* Like malloc, but wraps allocated block with header and trailer. */
491 overrun_check_malloc (size_t size
)
493 register unsigned char *val
;
494 if (SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
< size
)
497 val
= malloc (size
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
500 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
501 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
502 xmalloc_put_size (val
, size
);
503 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
504 XMALLOC_OVERRUN_CHECK_SIZE
);
510 /* Like realloc, but checks old block for overrun, and wraps new block
511 with header and trailer. */
514 overrun_check_realloc (void *block
, size_t size
)
516 register unsigned char *val
= (unsigned char *) block
;
517 if (SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
< size
)
521 && memcmp (xmalloc_overrun_check_header
,
522 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
523 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
525 size_t osize
= xmalloc_get_size (val
);
526 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
527 XMALLOC_OVERRUN_CHECK_SIZE
))
529 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
530 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
531 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
534 val
= realloc (val
, size
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
538 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
539 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
540 xmalloc_put_size (val
, size
);
541 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
542 XMALLOC_OVERRUN_CHECK_SIZE
);
547 /* Like free, but checks block for overrun. */
550 overrun_check_free (void *block
)
552 unsigned char *val
= (unsigned char *) block
;
555 && memcmp (xmalloc_overrun_check_header
,
556 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
557 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
559 size_t osize
= xmalloc_get_size (val
);
560 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
561 XMALLOC_OVERRUN_CHECK_SIZE
))
563 #ifdef XMALLOC_CLEAR_FREE_MEMORY
564 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
565 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
567 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
568 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
569 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
579 #define malloc overrun_check_malloc
580 #define realloc overrun_check_realloc
581 #define free overrun_check_free
584 /* If compiled with XMALLOC_BLOCK_INPUT_CHECK, define a symbol
585 BLOCK_INPUT_IN_MEMORY_ALLOCATORS that is visible to the debugger.
586 If that variable is set, block input while in one of Emacs's memory
587 allocation functions. There should be no need for this debugging
588 option, since signal handlers do not allocate memory, but Emacs
589 formerly allocated memory in signal handlers and this compile-time
590 option remains as a way to help debug the issue should it rear its
592 #ifdef XMALLOC_BLOCK_INPUT_CHECK
593 bool block_input_in_memory_allocators EXTERNALLY_VISIBLE
;
595 malloc_block_input (void)
597 if (block_input_in_memory_allocators
)
601 malloc_unblock_input (void)
603 if (block_input_in_memory_allocators
)
606 # define MALLOC_BLOCK_INPUT malloc_block_input ()
607 # define MALLOC_UNBLOCK_INPUT malloc_unblock_input ()
609 # define MALLOC_BLOCK_INPUT ((void) 0)
610 # define MALLOC_UNBLOCK_INPUT ((void) 0)
613 #define MALLOC_PROBE(size) \
615 if (profiler_memory_running) \
616 malloc_probe (size); \
620 /* Like malloc but check for no memory and block interrupt input.. */
623 xmalloc (size_t size
)
629 MALLOC_UNBLOCK_INPUT
;
637 /* Like the above, but zeroes out the memory just allocated. */
640 xzalloc (size_t size
)
646 MALLOC_UNBLOCK_INPUT
;
650 memset (val
, 0, size
);
655 /* Like realloc but check for no memory and block interrupt input.. */
658 xrealloc (void *block
, size_t size
)
663 /* We must call malloc explicitly when BLOCK is 0, since some
664 reallocs don't do this. */
668 val
= realloc (block
, size
);
669 MALLOC_UNBLOCK_INPUT
;
678 /* Like free but block interrupt input. */
687 MALLOC_UNBLOCK_INPUT
;
688 /* We don't call refill_memory_reserve here
689 because in practice the call in r_alloc_free seems to suffice. */
693 /* Other parts of Emacs pass large int values to allocator functions
694 expecting ptrdiff_t. This is portable in practice, but check it to
696 verify (INT_MAX
<= PTRDIFF_MAX
);
699 /* Allocate an array of NITEMS items, each of size ITEM_SIZE.
700 Signal an error on memory exhaustion, and block interrupt input. */
703 xnmalloc (ptrdiff_t nitems
, ptrdiff_t item_size
)
705 eassert (0 <= nitems
&& 0 < item_size
);
706 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
707 memory_full (SIZE_MAX
);
708 return xmalloc (nitems
* item_size
);
712 /* Reallocate an array PA to make it of NITEMS items, each of size ITEM_SIZE.
713 Signal an error on memory exhaustion, and block interrupt input. */
716 xnrealloc (void *pa
, ptrdiff_t nitems
, ptrdiff_t item_size
)
718 eassert (0 <= nitems
&& 0 < item_size
);
719 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
720 memory_full (SIZE_MAX
);
721 return xrealloc (pa
, nitems
* item_size
);
725 /* Grow PA, which points to an array of *NITEMS items, and return the
726 location of the reallocated array, updating *NITEMS to reflect its
727 new size. The new array will contain at least NITEMS_INCR_MIN more
728 items, but will not contain more than NITEMS_MAX items total.
729 ITEM_SIZE is the size of each item, in bytes.
731 ITEM_SIZE and NITEMS_INCR_MIN must be positive. *NITEMS must be
732 nonnegative. If NITEMS_MAX is -1, it is treated as if it were
735 If PA is null, then allocate a new array instead of reallocating
738 Block interrupt input as needed. If memory exhaustion occurs, set
739 *NITEMS to zero if PA is null, and signal an error (i.e., do not
742 Thus, to grow an array A without saving its old contents, do
743 { xfree (A); A = NULL; A = xpalloc (NULL, &AITEMS, ...); }.
744 The A = NULL avoids a dangling pointer if xpalloc exhausts memory
745 and signals an error, and later this code is reexecuted and
746 attempts to free A. */
749 xpalloc (void *pa
, ptrdiff_t *nitems
, ptrdiff_t nitems_incr_min
,
750 ptrdiff_t nitems_max
, ptrdiff_t item_size
)
752 /* The approximate size to use for initial small allocation
753 requests. This is the largest "small" request for the GNU C
755 enum { DEFAULT_MXFAST
= 64 * sizeof (size_t) / 4 };
757 /* If the array is tiny, grow it to about (but no greater than)
758 DEFAULT_MXFAST bytes. Otherwise, grow it by about 50%. */
759 ptrdiff_t n
= *nitems
;
760 ptrdiff_t tiny_max
= DEFAULT_MXFAST
/ item_size
- n
;
761 ptrdiff_t half_again
= n
>> 1;
762 ptrdiff_t incr_estimate
= max (tiny_max
, half_again
);
764 /* Adjust the increment according to three constraints: NITEMS_INCR_MIN,
765 NITEMS_MAX, and what the C language can represent safely. */
766 ptrdiff_t C_language_max
= min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
;
767 ptrdiff_t n_max
= (0 <= nitems_max
&& nitems_max
< C_language_max
768 ? nitems_max
: C_language_max
);
769 ptrdiff_t nitems_incr_max
= n_max
- n
;
770 ptrdiff_t incr
= max (nitems_incr_min
, min (incr_estimate
, nitems_incr_max
));
772 eassert (0 < item_size
&& 0 < nitems_incr_min
&& 0 <= n
&& -1 <= nitems_max
);
775 if (nitems_incr_max
< incr
)
776 memory_full (SIZE_MAX
);
778 pa
= xrealloc (pa
, n
* item_size
);
784 /* Like strdup, but uses xmalloc. */
787 xstrdup (const char *s
)
791 size
= strlen (s
) + 1;
792 return memcpy (xmalloc (size
), s
, size
);
795 /* Like above, but duplicates Lisp string to C string. */
798 xlispstrdup (Lisp_Object string
)
800 ptrdiff_t size
= SBYTES (string
) + 1;
801 return memcpy (xmalloc (size
), SSDATA (string
), size
);
804 /* Like putenv, but (1) use the equivalent of xmalloc and (2) the
805 argument is a const pointer. */
808 xputenv (char const *string
)
810 if (putenv ((char *) string
) != 0)
814 /* Return a newly allocated memory block of SIZE bytes, remembering
815 to free it when unwinding. */
817 record_xmalloc (size_t size
)
819 void *p
= xmalloc (size
);
820 record_unwind_protect_ptr (xfree
, p
);
825 /* Like malloc but used for allocating Lisp data. NBYTES is the
826 number of bytes to allocate, TYPE describes the intended use of the
827 allocated memory block (for strings, for conses, ...). */
830 void *lisp_malloc_loser EXTERNALLY_VISIBLE
;
834 lisp_malloc (size_t nbytes
, enum mem_type type
)
840 #ifdef GC_MALLOC_CHECK
841 allocated_mem_type
= type
;
844 val
= malloc (nbytes
);
847 /* If the memory just allocated cannot be addressed thru a Lisp
848 object's pointer, and it needs to be,
849 that's equivalent to running out of memory. */
850 if (val
&& type
!= MEM_TYPE_NON_LISP
)
853 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
854 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
856 lisp_malloc_loser
= val
;
863 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
864 if (val
&& type
!= MEM_TYPE_NON_LISP
)
865 mem_insert (val
, (char *) val
+ nbytes
, type
);
868 MALLOC_UNBLOCK_INPUT
;
870 memory_full (nbytes
);
871 MALLOC_PROBE (nbytes
);
875 /* Free BLOCK. This must be called to free memory allocated with a
876 call to lisp_malloc. */
879 lisp_free (void *block
)
883 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
884 mem_delete (mem_find (block
));
886 MALLOC_UNBLOCK_INPUT
;
889 /***** Allocation of aligned blocks of memory to store Lisp data. *****/
891 /* The entry point is lisp_align_malloc which returns blocks of at most
892 BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
894 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
895 #define USE_POSIX_MEMALIGN 1
898 /* BLOCK_ALIGN has to be a power of 2. */
899 #define BLOCK_ALIGN (1 << 10)
901 /* Padding to leave at the end of a malloc'd block. This is to give
902 malloc a chance to minimize the amount of memory wasted to alignment.
903 It should be tuned to the particular malloc library used.
904 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
905 posix_memalign on the other hand would ideally prefer a value of 4
906 because otherwise, there's 1020 bytes wasted between each ablocks.
907 In Emacs, testing shows that those 1020 can most of the time be
908 efficiently used by malloc to place other objects, so a value of 0 can
909 still preferable unless you have a lot of aligned blocks and virtually
911 #define BLOCK_PADDING 0
912 #define BLOCK_BYTES \
913 (BLOCK_ALIGN - sizeof (struct ablocks *) - BLOCK_PADDING)
915 /* Internal data structures and constants. */
917 #define ABLOCKS_SIZE 16
919 /* An aligned block of memory. */
924 char payload
[BLOCK_BYTES
];
925 struct ablock
*next_free
;
927 /* `abase' is the aligned base of the ablocks. */
928 /* It is overloaded to hold the virtual `busy' field that counts
929 the number of used ablock in the parent ablocks.
930 The first ablock has the `busy' field, the others have the `abase'
931 field. To tell the difference, we assume that pointers will have
932 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
933 is used to tell whether the real base of the parent ablocks is `abase'
934 (if not, the word before the first ablock holds a pointer to the
936 struct ablocks
*abase
;
937 /* The padding of all but the last ablock is unused. The padding of
938 the last ablock in an ablocks is not allocated. */
940 char padding
[BLOCK_PADDING
];
944 /* A bunch of consecutive aligned blocks. */
947 struct ablock blocks
[ABLOCKS_SIZE
];
950 /* Size of the block requested from malloc or posix_memalign. */
951 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
953 #define ABLOCK_ABASE(block) \
954 (((uintptr_t) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
955 ? (struct ablocks *)(block) \
958 /* Virtual `busy' field. */
959 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
961 /* Pointer to the (not necessarily aligned) malloc block. */
962 #ifdef USE_POSIX_MEMALIGN
963 #define ABLOCKS_BASE(abase) (abase)
965 #define ABLOCKS_BASE(abase) \
966 (1 & (intptr_t) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
969 /* The list of free ablock. */
970 static struct ablock
*free_ablock
;
972 /* Allocate an aligned block of nbytes.
973 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
974 smaller or equal to BLOCK_BYTES. */
976 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
979 struct ablocks
*abase
;
981 eassert (nbytes
<= BLOCK_BYTES
);
985 #ifdef GC_MALLOC_CHECK
986 allocated_mem_type
= type
;
992 intptr_t aligned
; /* int gets warning casting to 64-bit pointer. */
994 #ifdef DOUG_LEA_MALLOC
995 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
996 because mapped region contents are not preserved in
998 mallopt (M_MMAP_MAX
, 0);
1001 #ifdef USE_POSIX_MEMALIGN
1003 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1009 base
= malloc (ABLOCKS_BYTES
);
1010 abase
= ALIGN (base
, BLOCK_ALIGN
);
1015 MALLOC_UNBLOCK_INPUT
;
1016 memory_full (ABLOCKS_BYTES
);
1019 aligned
= (base
== abase
);
1021 ((void**)abase
)[-1] = base
;
1023 #ifdef DOUG_LEA_MALLOC
1024 /* Back to a reasonable maximum of mmap'ed areas. */
1025 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1029 /* If the memory just allocated cannot be addressed thru a Lisp
1030 object's pointer, and it needs to be, that's equivalent to
1031 running out of memory. */
1032 if (type
!= MEM_TYPE_NON_LISP
)
1035 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1036 XSETCONS (tem
, end
);
1037 if ((char *) XCONS (tem
) != end
)
1039 lisp_malloc_loser
= base
;
1041 MALLOC_UNBLOCK_INPUT
;
1042 memory_full (SIZE_MAX
);
1047 /* Initialize the blocks and put them on the free list.
1048 If `base' was not properly aligned, we can't use the last block. */
1049 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1051 abase
->blocks
[i
].abase
= abase
;
1052 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1053 free_ablock
= &abase
->blocks
[i
];
1055 ABLOCKS_BUSY (abase
) = (struct ablocks
*) aligned
;
1057 eassert (0 == ((uintptr_t) abase
) % BLOCK_ALIGN
);
1058 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1059 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1060 eassert (ABLOCKS_BASE (abase
) == base
);
1061 eassert (aligned
== (intptr_t) ABLOCKS_BUSY (abase
));
1064 abase
= ABLOCK_ABASE (free_ablock
);
1065 ABLOCKS_BUSY (abase
) =
1066 (struct ablocks
*) (2 + (intptr_t) ABLOCKS_BUSY (abase
));
1068 free_ablock
= free_ablock
->x
.next_free
;
1070 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1071 if (type
!= MEM_TYPE_NON_LISP
)
1072 mem_insert (val
, (char *) val
+ nbytes
, type
);
1075 MALLOC_UNBLOCK_INPUT
;
1077 MALLOC_PROBE (nbytes
);
1079 eassert (0 == ((uintptr_t) val
) % BLOCK_ALIGN
);
1084 lisp_align_free (void *block
)
1086 struct ablock
*ablock
= block
;
1087 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1090 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1091 mem_delete (mem_find (block
));
1093 /* Put on free list. */
1094 ablock
->x
.next_free
= free_ablock
;
1095 free_ablock
= ablock
;
1096 /* Update busy count. */
1097 ABLOCKS_BUSY (abase
)
1098 = (struct ablocks
*) (-2 + (intptr_t) ABLOCKS_BUSY (abase
));
1100 if (2 > (intptr_t) ABLOCKS_BUSY (abase
))
1101 { /* All the blocks are free. */
1102 int i
= 0, aligned
= (intptr_t) ABLOCKS_BUSY (abase
);
1103 struct ablock
**tem
= &free_ablock
;
1104 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1108 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1111 *tem
= (*tem
)->x
.next_free
;
1114 tem
= &(*tem
)->x
.next_free
;
1116 eassert ((aligned
& 1) == aligned
);
1117 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1118 #ifdef USE_POSIX_MEMALIGN
1119 eassert ((uintptr_t) ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1121 free (ABLOCKS_BASE (abase
));
1123 MALLOC_UNBLOCK_INPUT
;
1127 /***********************************************************************
1129 ***********************************************************************/
1131 /* Number of intervals allocated in an interval_block structure.
1132 The 1020 is 1024 minus malloc overhead. */
1134 #define INTERVAL_BLOCK_SIZE \
1135 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1137 /* Intervals are allocated in chunks in the form of an interval_block
1140 struct interval_block
1142 /* Place `intervals' first, to preserve alignment. */
1143 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1144 struct interval_block
*next
;
1147 /* Current interval block. Its `next' pointer points to older
1150 static struct interval_block
*interval_block
;
1152 /* Index in interval_block above of the next unused interval
1155 static int interval_block_index
= INTERVAL_BLOCK_SIZE
;
1157 /* Number of free and live intervals. */
1159 static EMACS_INT total_free_intervals
, total_intervals
;
1161 /* List of free intervals. */
1163 static INTERVAL interval_free_list
;
1165 /* Return a new interval. */
1168 make_interval (void)
1174 if (interval_free_list
)
1176 val
= interval_free_list
;
1177 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1181 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1183 struct interval_block
*newi
1184 = lisp_malloc (sizeof *newi
, MEM_TYPE_NON_LISP
);
1186 newi
->next
= interval_block
;
1187 interval_block
= newi
;
1188 interval_block_index
= 0;
1189 total_free_intervals
+= INTERVAL_BLOCK_SIZE
;
1191 val
= &interval_block
->intervals
[interval_block_index
++];
1194 MALLOC_UNBLOCK_INPUT
;
1196 consing_since_gc
+= sizeof (struct interval
);
1198 total_free_intervals
--;
1199 RESET_INTERVAL (val
);
1205 /* Mark Lisp objects in interval I. */
1208 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1210 /* Intervals should never be shared. So, if extra internal checking is
1211 enabled, GC aborts if it seems to have visited an interval twice. */
1212 eassert (!i
->gcmarkbit
);
1214 mark_object (i
->plist
);
1217 /* Mark the interval tree rooted in I. */
1219 #define MARK_INTERVAL_TREE(i) \
1221 if (i && !i->gcmarkbit) \
1222 traverse_intervals_noorder (i, mark_interval, Qnil); \
1225 /***********************************************************************
1227 ***********************************************************************/
1229 /* Lisp_Strings are allocated in string_block structures. When a new
1230 string_block is allocated, all the Lisp_Strings it contains are
1231 added to a free-list string_free_list. When a new Lisp_String is
1232 needed, it is taken from that list. During the sweep phase of GC,
1233 string_blocks that are entirely free are freed, except two which
1236 String data is allocated from sblock structures. Strings larger
1237 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1238 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1240 Sblocks consist internally of sdata structures, one for each
1241 Lisp_String. The sdata structure points to the Lisp_String it
1242 belongs to. The Lisp_String points back to the `u.data' member of
1243 its sdata structure.
1245 When a Lisp_String is freed during GC, it is put back on
1246 string_free_list, and its `data' member and its sdata's `string'
1247 pointer is set to null. The size of the string is recorded in the
1248 `n.nbytes' member of the sdata. So, sdata structures that are no
1249 longer used, can be easily recognized, and it's easy to compact the
1250 sblocks of small strings which we do in compact_small_strings. */
1252 /* Size in bytes of an sblock structure used for small strings. This
1253 is 8192 minus malloc overhead. */
1255 #define SBLOCK_SIZE 8188
1257 /* Strings larger than this are considered large strings. String data
1258 for large strings is allocated from individual sblocks. */
1260 #define LARGE_STRING_BYTES 1024
1262 /* Struct or union describing string memory sub-allocated from an sblock.
1263 This is where the contents of Lisp strings are stored. */
1265 #ifdef GC_CHECK_STRING_BYTES
1269 /* Back-pointer to the string this sdata belongs to. If null, this
1270 structure is free, and the NBYTES member of the union below
1271 contains the string's byte size (the same value that STRING_BYTES
1272 would return if STRING were non-null). If non-null, STRING_BYTES
1273 (STRING) is the size of the data, and DATA contains the string's
1275 struct Lisp_String
*string
;
1278 unsigned char data
[FLEXIBLE_ARRAY_MEMBER
];
1281 #define SDATA_NBYTES(S) (S)->nbytes
1282 #define SDATA_DATA(S) (S)->data
1283 #define SDATA_SELECTOR(member) member
1289 struct Lisp_String
*string
;
1291 /* When STRING is non-null. */
1294 struct Lisp_String
*string
;
1295 unsigned char data
[FLEXIBLE_ARRAY_MEMBER
];
1298 /* When STRING is null. */
1301 struct Lisp_String
*string
;
1306 #define SDATA_NBYTES(S) (S)->n.nbytes
1307 #define SDATA_DATA(S) (S)->u.data
1308 #define SDATA_SELECTOR(member) u.member
1310 #endif /* not GC_CHECK_STRING_BYTES */
1312 #define SDATA_DATA_OFFSET offsetof (sdata, SDATA_SELECTOR (data))
1315 /* Structure describing a block of memory which is sub-allocated to
1316 obtain string data memory for strings. Blocks for small strings
1317 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1318 as large as needed. */
1323 struct sblock
*next
;
1325 /* Pointer to the next free sdata block. This points past the end
1326 of the sblock if there isn't any space left in this block. */
1329 /* Start of data. */
1333 /* Number of Lisp strings in a string_block structure. The 1020 is
1334 1024 minus malloc overhead. */
1336 #define STRING_BLOCK_SIZE \
1337 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1339 /* Structure describing a block from which Lisp_String structures
1344 /* Place `strings' first, to preserve alignment. */
1345 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1346 struct string_block
*next
;
1349 /* Head and tail of the list of sblock structures holding Lisp string
1350 data. We always allocate from current_sblock. The NEXT pointers
1351 in the sblock structures go from oldest_sblock to current_sblock. */
1353 static struct sblock
*oldest_sblock
, *current_sblock
;
1355 /* List of sblocks for large strings. */
1357 static struct sblock
*large_sblocks
;
1359 /* List of string_block structures. */
1361 static struct string_block
*string_blocks
;
1363 /* Free-list of Lisp_Strings. */
1365 static struct Lisp_String
*string_free_list
;
1367 /* Number of live and free Lisp_Strings. */
1369 static EMACS_INT total_strings
, total_free_strings
;
1371 /* Number of bytes used by live strings. */
1373 static EMACS_INT total_string_bytes
;
1375 /* Given a pointer to a Lisp_String S which is on the free-list
1376 string_free_list, return a pointer to its successor in the
1379 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1381 /* Return a pointer to the sdata structure belonging to Lisp string S.
1382 S must be live, i.e. S->data must not be null. S->data is actually
1383 a pointer to the `u.data' member of its sdata structure; the
1384 structure starts at a constant offset in front of that. */
1386 #define SDATA_OF_STRING(S) ((sdata *) ((S)->data - SDATA_DATA_OFFSET))
1389 #ifdef GC_CHECK_STRING_OVERRUN
1391 /* We check for overrun in string data blocks by appending a small
1392 "cookie" after each allocated string data block, and check for the
1393 presence of this cookie during GC. */
1395 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1396 static char const string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1397 { '\xde', '\xad', '\xbe', '\xef' };
1400 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1403 /* Value is the size of an sdata structure large enough to hold NBYTES
1404 bytes of string data. The value returned includes a terminating
1405 NUL byte, the size of the sdata structure, and padding. */
1407 #ifdef GC_CHECK_STRING_BYTES
1409 #define SDATA_SIZE(NBYTES) \
1410 ((SDATA_DATA_OFFSET \
1412 + sizeof (ptrdiff_t) - 1) \
1413 & ~(sizeof (ptrdiff_t) - 1))
1415 #else /* not GC_CHECK_STRING_BYTES */
1417 /* The 'max' reserves space for the nbytes union member even when NBYTES + 1 is
1418 less than the size of that member. The 'max' is not needed when
1419 SDATA_DATA_OFFSET is a multiple of sizeof (ptrdiff_t), because then the
1420 alignment code reserves enough space. */
1422 #define SDATA_SIZE(NBYTES) \
1423 ((SDATA_DATA_OFFSET \
1424 + (SDATA_DATA_OFFSET % sizeof (ptrdiff_t) == 0 \
1426 : max (NBYTES, sizeof (ptrdiff_t) - 1)) \
1428 + sizeof (ptrdiff_t) - 1) \
1429 & ~(sizeof (ptrdiff_t) - 1))
1431 #endif /* not GC_CHECK_STRING_BYTES */
1433 /* Extra bytes to allocate for each string. */
1435 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1437 /* Exact bound on the number of bytes in a string, not counting the
1438 terminating null. A string cannot contain more bytes than
1439 STRING_BYTES_BOUND, nor can it be so long that the size_t
1440 arithmetic in allocate_string_data would overflow while it is
1441 calculating a value to be passed to malloc. */
1442 static ptrdiff_t const STRING_BYTES_MAX
=
1443 min (STRING_BYTES_BOUND
,
1444 ((SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
1446 - offsetof (struct sblock
, first_data
)
1447 - SDATA_DATA_OFFSET
)
1448 & ~(sizeof (EMACS_INT
) - 1)));
1450 /* Initialize string allocation. Called from init_alloc_once. */
1455 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1456 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1460 #ifdef GC_CHECK_STRING_BYTES
1462 static int check_string_bytes_count
;
1464 /* Like STRING_BYTES, but with debugging check. Can be
1465 called during GC, so pay attention to the mark bit. */
1468 string_bytes (struct Lisp_String
*s
)
1471 (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1473 if (!PURE_POINTER_P (s
)
1475 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1480 /* Check validity of Lisp strings' string_bytes member in B. */
1483 check_sblock (struct sblock
*b
)
1485 sdata
*from
, *end
, *from_end
;
1489 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1491 /* Compute the next FROM here because copying below may
1492 overwrite data we need to compute it. */
1495 /* Check that the string size recorded in the string is the
1496 same as the one recorded in the sdata structure. */
1497 nbytes
= SDATA_SIZE (from
->string
? string_bytes (from
->string
)
1498 : SDATA_NBYTES (from
));
1499 from_end
= (sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1504 /* Check validity of Lisp strings' string_bytes member. ALL_P
1505 means check all strings, otherwise check only most
1506 recently allocated strings. Used for hunting a bug. */
1509 check_string_bytes (bool all_p
)
1515 for (b
= large_sblocks
; b
; b
= b
->next
)
1517 struct Lisp_String
*s
= b
->first_data
.string
;
1522 for (b
= oldest_sblock
; b
; b
= b
->next
)
1525 else if (current_sblock
)
1526 check_sblock (current_sblock
);
1529 #else /* not GC_CHECK_STRING_BYTES */
1531 #define check_string_bytes(all) ((void) 0)
1533 #endif /* GC_CHECK_STRING_BYTES */
1535 #ifdef GC_CHECK_STRING_FREE_LIST
1537 /* Walk through the string free list looking for bogus next pointers.
1538 This may catch buffer overrun from a previous string. */
1541 check_string_free_list (void)
1543 struct Lisp_String
*s
;
1545 /* Pop a Lisp_String off the free-list. */
1546 s
= string_free_list
;
1549 if ((uintptr_t) s
< 1024)
1551 s
= NEXT_FREE_LISP_STRING (s
);
1555 #define check_string_free_list()
1558 /* Return a new Lisp_String. */
1560 static struct Lisp_String
*
1561 allocate_string (void)
1563 struct Lisp_String
*s
;
1567 /* If the free-list is empty, allocate a new string_block, and
1568 add all the Lisp_Strings in it to the free-list. */
1569 if (string_free_list
== NULL
)
1571 struct string_block
*b
= lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1574 b
->next
= string_blocks
;
1577 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1580 /* Every string on a free list should have NULL data pointer. */
1582 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1583 string_free_list
= s
;
1586 total_free_strings
+= STRING_BLOCK_SIZE
;
1589 check_string_free_list ();
1591 /* Pop a Lisp_String off the free-list. */
1592 s
= string_free_list
;
1593 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1595 MALLOC_UNBLOCK_INPUT
;
1597 --total_free_strings
;
1600 consing_since_gc
+= sizeof *s
;
1602 #ifdef GC_CHECK_STRING_BYTES
1603 if (!noninteractive
)
1605 if (++check_string_bytes_count
== 200)
1607 check_string_bytes_count
= 0;
1608 check_string_bytes (1);
1611 check_string_bytes (0);
1613 #endif /* GC_CHECK_STRING_BYTES */
1619 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1620 plus a NUL byte at the end. Allocate an sdata structure for S, and
1621 set S->data to its `u.data' member. Store a NUL byte at the end of
1622 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1623 S->data if it was initially non-null. */
1626 allocate_string_data (struct Lisp_String
*s
,
1627 EMACS_INT nchars
, EMACS_INT nbytes
)
1629 sdata
*data
, *old_data
;
1631 ptrdiff_t needed
, old_nbytes
;
1633 if (STRING_BYTES_MAX
< nbytes
)
1636 /* Determine the number of bytes needed to store NBYTES bytes
1638 needed
= SDATA_SIZE (nbytes
);
1641 old_data
= SDATA_OF_STRING (s
);
1642 old_nbytes
= STRING_BYTES (s
);
1649 if (nbytes
> LARGE_STRING_BYTES
)
1651 size_t size
= offsetof (struct sblock
, first_data
) + needed
;
1653 #ifdef DOUG_LEA_MALLOC
1654 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1655 because mapped region contents are not preserved in
1658 In case you think of allowing it in a dumped Emacs at the
1659 cost of not being able to re-dump, there's another reason:
1660 mmap'ed data typically have an address towards the top of the
1661 address space, which won't fit into an EMACS_INT (at least on
1662 32-bit systems with the current tagging scheme). --fx */
1663 mallopt (M_MMAP_MAX
, 0);
1666 b
= lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1668 #ifdef DOUG_LEA_MALLOC
1669 /* Back to a reasonable maximum of mmap'ed areas. */
1670 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1673 b
->next_free
= &b
->first_data
;
1674 b
->first_data
.string
= NULL
;
1675 b
->next
= large_sblocks
;
1678 else if (current_sblock
== NULL
1679 || (((char *) current_sblock
+ SBLOCK_SIZE
1680 - (char *) current_sblock
->next_free
)
1681 < (needed
+ GC_STRING_EXTRA
)))
1683 /* Not enough room in the current sblock. */
1684 b
= lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1685 b
->next_free
= &b
->first_data
;
1686 b
->first_data
.string
= NULL
;
1690 current_sblock
->next
= b
;
1698 data
= b
->next_free
;
1699 b
->next_free
= (sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
1701 MALLOC_UNBLOCK_INPUT
;
1704 s
->data
= SDATA_DATA (data
);
1705 #ifdef GC_CHECK_STRING_BYTES
1706 SDATA_NBYTES (data
) = nbytes
;
1709 s
->size_byte
= nbytes
;
1710 s
->data
[nbytes
] = '\0';
1711 #ifdef GC_CHECK_STRING_OVERRUN
1712 memcpy ((char *) data
+ needed
, string_overrun_cookie
,
1713 GC_STRING_OVERRUN_COOKIE_SIZE
);
1716 /* Note that Faset may call to this function when S has already data
1717 assigned. In this case, mark data as free by setting it's string
1718 back-pointer to null, and record the size of the data in it. */
1721 SDATA_NBYTES (old_data
) = old_nbytes
;
1722 old_data
->string
= NULL
;
1725 consing_since_gc
+= needed
;
1729 /* Sweep and compact strings. */
1732 sweep_strings (void)
1734 struct string_block
*b
, *next
;
1735 struct string_block
*live_blocks
= NULL
;
1737 string_free_list
= NULL
;
1738 total_strings
= total_free_strings
= 0;
1739 total_string_bytes
= 0;
1741 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1742 for (b
= string_blocks
; b
; b
= next
)
1745 struct Lisp_String
*free_list_before
= string_free_list
;
1749 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1751 struct Lisp_String
*s
= b
->strings
+ i
;
1755 /* String was not on free-list before. */
1756 if (STRING_MARKED_P (s
))
1758 /* String is live; unmark it and its intervals. */
1761 /* Do not use string_(set|get)_intervals here. */
1762 s
->intervals
= balance_intervals (s
->intervals
);
1765 total_string_bytes
+= STRING_BYTES (s
);
1769 /* String is dead. Put it on the free-list. */
1770 sdata
*data
= SDATA_OF_STRING (s
);
1772 /* Save the size of S in its sdata so that we know
1773 how large that is. Reset the sdata's string
1774 back-pointer so that we know it's free. */
1775 #ifdef GC_CHECK_STRING_BYTES
1776 if (string_bytes (s
) != SDATA_NBYTES (data
))
1779 data
->n
.nbytes
= STRING_BYTES (s
);
1781 data
->string
= NULL
;
1783 /* Reset the strings's `data' member so that we
1787 /* Put the string on the free-list. */
1788 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1789 string_free_list
= s
;
1795 /* S was on the free-list before. Put it there again. */
1796 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1797 string_free_list
= s
;
1802 /* Free blocks that contain free Lisp_Strings only, except
1803 the first two of them. */
1804 if (nfree
== STRING_BLOCK_SIZE
1805 && total_free_strings
> STRING_BLOCK_SIZE
)
1808 string_free_list
= free_list_before
;
1812 total_free_strings
+= nfree
;
1813 b
->next
= live_blocks
;
1818 check_string_free_list ();
1820 string_blocks
= live_blocks
;
1821 free_large_strings ();
1822 compact_small_strings ();
1824 check_string_free_list ();
1828 /* Free dead large strings. */
1831 free_large_strings (void)
1833 struct sblock
*b
, *next
;
1834 struct sblock
*live_blocks
= NULL
;
1836 for (b
= large_sblocks
; b
; b
= next
)
1840 if (b
->first_data
.string
== NULL
)
1844 b
->next
= live_blocks
;
1849 large_sblocks
= live_blocks
;
1853 /* Compact data of small strings. Free sblocks that don't contain
1854 data of live strings after compaction. */
1857 compact_small_strings (void)
1859 struct sblock
*b
, *tb
, *next
;
1860 sdata
*from
, *to
, *end
, *tb_end
;
1861 sdata
*to_end
, *from_end
;
1863 /* TB is the sblock we copy to, TO is the sdata within TB we copy
1864 to, and TB_END is the end of TB. */
1866 tb_end
= (sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1867 to
= &tb
->first_data
;
1869 /* Step through the blocks from the oldest to the youngest. We
1870 expect that old blocks will stabilize over time, so that less
1871 copying will happen this way. */
1872 for (b
= oldest_sblock
; b
; b
= b
->next
)
1875 eassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
1877 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1879 /* Compute the next FROM here because copying below may
1880 overwrite data we need to compute it. */
1882 struct Lisp_String
*s
= from
->string
;
1884 #ifdef GC_CHECK_STRING_BYTES
1885 /* Check that the string size recorded in the string is the
1886 same as the one recorded in the sdata structure. */
1887 if (s
&& string_bytes (s
) != SDATA_NBYTES (from
))
1889 #endif /* GC_CHECK_STRING_BYTES */
1891 nbytes
= s
? STRING_BYTES (s
) : SDATA_NBYTES (from
);
1892 eassert (nbytes
<= LARGE_STRING_BYTES
);
1894 nbytes
= SDATA_SIZE (nbytes
);
1895 from_end
= (sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1897 #ifdef GC_CHECK_STRING_OVERRUN
1898 if (memcmp (string_overrun_cookie
,
1899 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
1900 GC_STRING_OVERRUN_COOKIE_SIZE
))
1904 /* Non-NULL S means it's alive. Copy its data. */
1907 /* If TB is full, proceed with the next sblock. */
1908 to_end
= (sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
1909 if (to_end
> tb_end
)
1913 tb_end
= (sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1914 to
= &tb
->first_data
;
1915 to_end
= (sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
1918 /* Copy, and update the string's `data' pointer. */
1921 eassert (tb
!= b
|| to
< from
);
1922 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
1923 to
->string
->data
= SDATA_DATA (to
);
1926 /* Advance past the sdata we copied to. */
1932 /* The rest of the sblocks following TB don't contain live data, so
1933 we can free them. */
1934 for (b
= tb
->next
; b
; b
= next
)
1942 current_sblock
= tb
;
1946 string_overflow (void)
1948 error ("Maximum string size exceeded");
1951 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
1952 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
1953 LENGTH must be an integer.
1954 INIT must be an integer that represents a character. */)
1955 (Lisp_Object length
, Lisp_Object init
)
1957 register Lisp_Object val
;
1958 register unsigned char *p
, *end
;
1962 CHECK_NATNUM (length
);
1963 CHECK_CHARACTER (init
);
1965 c
= XFASTINT (init
);
1966 if (ASCII_CHAR_P (c
))
1968 nbytes
= XINT (length
);
1969 val
= make_uninit_string (nbytes
);
1971 end
= p
+ SCHARS (val
);
1977 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
1978 int len
= CHAR_STRING (c
, str
);
1979 EMACS_INT string_len
= XINT (length
);
1981 if (string_len
> STRING_BYTES_MAX
/ len
)
1983 nbytes
= len
* string_len
;
1984 val
= make_uninit_multibyte_string (string_len
, nbytes
);
1989 memcpy (p
, str
, len
);
1999 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2000 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2001 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2002 (Lisp_Object length
, Lisp_Object init
)
2004 register Lisp_Object val
;
2005 struct Lisp_Bool_Vector
*p
;
2006 ptrdiff_t length_in_chars
;
2007 EMACS_INT length_in_elts
;
2009 int extra_bool_elts
= ((bool_header_size
- header_size
+ word_size
- 1)
2012 CHECK_NATNUM (length
);
2014 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2016 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2018 val
= Fmake_vector (make_number (length_in_elts
+ extra_bool_elts
), Qnil
);
2020 /* No Lisp_Object to trace in there. */
2021 XSETPVECTYPESIZE (XVECTOR (val
), PVEC_BOOL_VECTOR
, 0, 0);
2023 p
= XBOOL_VECTOR (val
);
2024 p
->size
= XFASTINT (length
);
2026 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2027 / BOOL_VECTOR_BITS_PER_CHAR
);
2028 if (length_in_chars
)
2030 memset (p
->data
, ! NILP (init
) ? -1 : 0, length_in_chars
);
2032 /* Clear any extraneous bits in the last byte. */
2033 p
->data
[length_in_chars
- 1]
2034 &= (1 << ((XFASTINT (length
) - 1) % BOOL_VECTOR_BITS_PER_CHAR
+ 1)) - 1;
2041 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2042 of characters from the contents. This string may be unibyte or
2043 multibyte, depending on the contents. */
2046 make_string (const char *contents
, ptrdiff_t nbytes
)
2048 register Lisp_Object val
;
2049 ptrdiff_t nchars
, multibyte_nbytes
;
2051 parse_str_as_multibyte ((const unsigned char *) contents
, nbytes
,
2052 &nchars
, &multibyte_nbytes
);
2053 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2054 /* CONTENTS contains no multibyte sequences or contains an invalid
2055 multibyte sequence. We must make unibyte string. */
2056 val
= make_unibyte_string (contents
, nbytes
);
2058 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2063 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2066 make_unibyte_string (const char *contents
, ptrdiff_t length
)
2068 register Lisp_Object val
;
2069 val
= make_uninit_string (length
);
2070 memcpy (SDATA (val
), contents
, length
);
2075 /* Make a multibyte string from NCHARS characters occupying NBYTES
2076 bytes at CONTENTS. */
2079 make_multibyte_string (const char *contents
,
2080 ptrdiff_t nchars
, ptrdiff_t nbytes
)
2082 register Lisp_Object val
;
2083 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2084 memcpy (SDATA (val
), contents
, nbytes
);
2089 /* Make a string from NCHARS characters occupying NBYTES bytes at
2090 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2093 make_string_from_bytes (const char *contents
,
2094 ptrdiff_t nchars
, ptrdiff_t nbytes
)
2096 register Lisp_Object val
;
2097 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2098 memcpy (SDATA (val
), contents
, nbytes
);
2099 if (SBYTES (val
) == SCHARS (val
))
2100 STRING_SET_UNIBYTE (val
);
2105 /* Make a string from NCHARS characters occupying NBYTES bytes at
2106 CONTENTS. The argument MULTIBYTE controls whether to label the
2107 string as multibyte. If NCHARS is negative, it counts the number of
2108 characters by itself. */
2111 make_specified_string (const char *contents
,
2112 ptrdiff_t nchars
, ptrdiff_t nbytes
, bool multibyte
)
2119 nchars
= multibyte_chars_in_text ((const unsigned char *) contents
,
2124 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2125 memcpy (SDATA (val
), contents
, nbytes
);
2127 STRING_SET_UNIBYTE (val
);
2132 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2133 occupying LENGTH bytes. */
2136 make_uninit_string (EMACS_INT length
)
2141 return empty_unibyte_string
;
2142 val
= make_uninit_multibyte_string (length
, length
);
2143 STRING_SET_UNIBYTE (val
);
2148 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2149 which occupy NBYTES bytes. */
2152 make_uninit_multibyte_string (EMACS_INT nchars
, EMACS_INT nbytes
)
2155 struct Lisp_String
*s
;
2160 return empty_multibyte_string
;
2162 s
= allocate_string ();
2163 s
->intervals
= NULL
;
2164 allocate_string_data (s
, nchars
, nbytes
);
2165 XSETSTRING (string
, s
);
2166 string_chars_consed
+= nbytes
;
2170 /* Print arguments to BUF according to a FORMAT, then return
2171 a Lisp_String initialized with the data from BUF. */
2174 make_formatted_string (char *buf
, const char *format
, ...)
2179 va_start (ap
, format
);
2180 length
= vsprintf (buf
, format
, ap
);
2182 return make_string (buf
, length
);
2186 /***********************************************************************
2188 ***********************************************************************/
2190 /* We store float cells inside of float_blocks, allocating a new
2191 float_block with malloc whenever necessary. Float cells reclaimed
2192 by GC are put on a free list to be reallocated before allocating
2193 any new float cells from the latest float_block. */
2195 #define FLOAT_BLOCK_SIZE \
2196 (((BLOCK_BYTES - sizeof (struct float_block *) \
2197 /* The compiler might add padding at the end. */ \
2198 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2199 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2201 #define GETMARKBIT(block,n) \
2202 (((block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2203 >> ((n) % (sizeof (int) * CHAR_BIT))) \
2206 #define SETMARKBIT(block,n) \
2207 (block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2208 |= 1 << ((n) % (sizeof (int) * CHAR_BIT))
2210 #define UNSETMARKBIT(block,n) \
2211 (block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2212 &= ~(1 << ((n) % (sizeof (int) * CHAR_BIT)))
2214 #define FLOAT_BLOCK(fptr) \
2215 ((struct float_block *) (((uintptr_t) (fptr)) & ~(BLOCK_ALIGN - 1)))
2217 #define FLOAT_INDEX(fptr) \
2218 ((((uintptr_t) (fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2222 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2223 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2224 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof (int) * CHAR_BIT
)];
2225 struct float_block
*next
;
2228 #define FLOAT_MARKED_P(fptr) \
2229 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2231 #define FLOAT_MARK(fptr) \
2232 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2234 #define FLOAT_UNMARK(fptr) \
2235 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2237 /* Current float_block. */
2239 static struct float_block
*float_block
;
2241 /* Index of first unused Lisp_Float in the current float_block. */
2243 static int float_block_index
= FLOAT_BLOCK_SIZE
;
2245 /* Free-list of Lisp_Floats. */
2247 static struct Lisp_Float
*float_free_list
;
2249 /* Return a new float object with value FLOAT_VALUE. */
2252 make_float (double float_value
)
2254 register Lisp_Object val
;
2258 if (float_free_list
)
2260 /* We use the data field for chaining the free list
2261 so that we won't use the same field that has the mark bit. */
2262 XSETFLOAT (val
, float_free_list
);
2263 float_free_list
= float_free_list
->u
.chain
;
2267 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2269 struct float_block
*new
2270 = lisp_align_malloc (sizeof *new, MEM_TYPE_FLOAT
);
2271 new->next
= float_block
;
2272 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2274 float_block_index
= 0;
2275 total_free_floats
+= FLOAT_BLOCK_SIZE
;
2277 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2278 float_block_index
++;
2281 MALLOC_UNBLOCK_INPUT
;
2283 XFLOAT_INIT (val
, float_value
);
2284 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2285 consing_since_gc
+= sizeof (struct Lisp_Float
);
2287 total_free_floats
--;
2293 /***********************************************************************
2295 ***********************************************************************/
2297 /* We store cons cells inside of cons_blocks, allocating a new
2298 cons_block with malloc whenever necessary. Cons cells reclaimed by
2299 GC are put on a free list to be reallocated before allocating
2300 any new cons cells from the latest cons_block. */
2302 #define CONS_BLOCK_SIZE \
2303 (((BLOCK_BYTES - sizeof (struct cons_block *) \
2304 /* The compiler might add padding at the end. */ \
2305 - (sizeof (struct Lisp_Cons) - sizeof (int))) * CHAR_BIT) \
2306 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2308 #define CONS_BLOCK(fptr) \
2309 ((struct cons_block *) ((uintptr_t) (fptr) & ~(BLOCK_ALIGN - 1)))
2311 #define CONS_INDEX(fptr) \
2312 (((uintptr_t) (fptr) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2316 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2317 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2318 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof (int) * CHAR_BIT
)];
2319 struct cons_block
*next
;
2322 #define CONS_MARKED_P(fptr) \
2323 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2325 #define CONS_MARK(fptr) \
2326 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2328 #define CONS_UNMARK(fptr) \
2329 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2331 /* Current cons_block. */
2333 static struct cons_block
*cons_block
;
2335 /* Index of first unused Lisp_Cons in the current block. */
2337 static int cons_block_index
= CONS_BLOCK_SIZE
;
2339 /* Free-list of Lisp_Cons structures. */
2341 static struct Lisp_Cons
*cons_free_list
;
2343 /* Explicitly free a cons cell by putting it on the free-list. */
2346 free_cons (struct Lisp_Cons
*ptr
)
2348 ptr
->u
.chain
= cons_free_list
;
2352 cons_free_list
= ptr
;
2353 consing_since_gc
-= sizeof *ptr
;
2354 total_free_conses
++;
2357 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2358 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2359 (Lisp_Object car
, Lisp_Object cdr
)
2361 register Lisp_Object val
;
2367 /* We use the cdr for chaining the free list
2368 so that we won't use the same field that has the mark bit. */
2369 XSETCONS (val
, cons_free_list
);
2370 cons_free_list
= cons_free_list
->u
.chain
;
2374 if (cons_block_index
== CONS_BLOCK_SIZE
)
2376 struct cons_block
*new
2377 = lisp_align_malloc (sizeof *new, MEM_TYPE_CONS
);
2378 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2379 new->next
= cons_block
;
2381 cons_block_index
= 0;
2382 total_free_conses
+= CONS_BLOCK_SIZE
;
2384 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2388 MALLOC_UNBLOCK_INPUT
;
2392 eassert (!CONS_MARKED_P (XCONS (val
)));
2393 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2394 total_free_conses
--;
2395 cons_cells_consed
++;
2399 #ifdef GC_CHECK_CONS_LIST
2400 /* Get an error now if there's any junk in the cons free list. */
2402 check_cons_list (void)
2404 struct Lisp_Cons
*tail
= cons_free_list
;
2407 tail
= tail
->u
.chain
;
2411 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2414 list1 (Lisp_Object arg1
)
2416 return Fcons (arg1
, Qnil
);
2420 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2422 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2427 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2429 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2434 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2436 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2441 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2443 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2444 Fcons (arg5
, Qnil
)))));
2447 /* Make a list of COUNT Lisp_Objects, where ARG is the
2448 first one. Allocate conses from pure space if TYPE
2449 is CONSTYPE_PURE, or allocate as usual if type is CONSTYPE_HEAP. */
2452 listn (enum constype type
, ptrdiff_t count
, Lisp_Object arg
, ...)
2456 Lisp_Object val
, *objp
;
2458 /* Change to SAFE_ALLOCA if you hit this eassert. */
2459 eassert (count
<= MAX_ALLOCA
/ word_size
);
2461 objp
= alloca (count
* word_size
);
2464 for (i
= 1; i
< count
; i
++)
2465 objp
[i
] = va_arg (ap
, Lisp_Object
);
2468 for (val
= Qnil
, i
= count
- 1; i
>= 0; i
--)
2470 if (type
== CONSTYPE_PURE
)
2471 val
= pure_cons (objp
[i
], val
);
2472 else if (type
== CONSTYPE_HEAP
)
2473 val
= Fcons (objp
[i
], val
);
2480 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2481 doc
: /* Return a newly created list with specified arguments as elements.
2482 Any number of arguments, even zero arguments, are allowed.
2483 usage: (list &rest OBJECTS) */)
2484 (ptrdiff_t nargs
, Lisp_Object
*args
)
2486 register Lisp_Object val
;
2492 val
= Fcons (args
[nargs
], val
);
2498 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2499 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2500 (register Lisp_Object length
, Lisp_Object init
)
2502 register Lisp_Object val
;
2503 register EMACS_INT size
;
2505 CHECK_NATNUM (length
);
2506 size
= XFASTINT (length
);
2511 val
= Fcons (init
, val
);
2516 val
= Fcons (init
, val
);
2521 val
= Fcons (init
, val
);
2526 val
= Fcons (init
, val
);
2531 val
= Fcons (init
, val
);
2546 /***********************************************************************
2548 ***********************************************************************/
2550 /* This value is balanced well enough to avoid too much internal overhead
2551 for the most common cases; it's not required to be a power of two, but
2552 it's expected to be a mult-of-ROUNDUP_SIZE (see below). */
2554 #define VECTOR_BLOCK_SIZE 4096
2556 /* Align allocation request sizes to be a multiple of ROUNDUP_SIZE. */
2559 roundup_size
= COMMON_MULTIPLE (word_size
, USE_LSB_TAG
? GCALIGNMENT
: 1)
2562 /* ROUNDUP_SIZE must be a power of 2. */
2563 verify ((roundup_size
& (roundup_size
- 1)) == 0);
2565 /* Verify assumptions described above. */
2566 verify ((VECTOR_BLOCK_SIZE
% roundup_size
) == 0);
2567 verify (VECTOR_BLOCK_SIZE
<= (1 << PSEUDOVECTOR_SIZE_BITS
));
2569 /* Round up X to nearest mult-of-ROUNDUP_SIZE. */
2571 #define vroundup(x) (((x) + (roundup_size - 1)) & ~(roundup_size - 1))
2573 /* Rounding helps to maintain alignment constraints if USE_LSB_TAG. */
2575 #define VECTOR_BLOCK_BYTES (VECTOR_BLOCK_SIZE - vroundup (sizeof (void *)))
2577 /* Size of the minimal vector allocated from block. */
2579 #define VBLOCK_BYTES_MIN vroundup (header_size + sizeof (Lisp_Object))
2581 /* Size of the largest vector allocated from block. */
2583 #define VBLOCK_BYTES_MAX \
2584 vroundup ((VECTOR_BLOCK_BYTES / 2) - word_size)
2586 /* We maintain one free list for each possible block-allocated
2587 vector size, and this is the number of free lists we have. */
2589 #define VECTOR_MAX_FREE_LIST_INDEX \
2590 ((VECTOR_BLOCK_BYTES - VBLOCK_BYTES_MIN) / roundup_size + 1)
2592 /* Common shortcut to advance vector pointer over a block data. */
2594 #define ADVANCE(v, nbytes) ((struct Lisp_Vector *) ((char *) (v) + (nbytes)))
2596 /* Common shortcut to calculate NBYTES-vector index in VECTOR_FREE_LISTS. */
2598 #define VINDEX(nbytes) (((nbytes) - VBLOCK_BYTES_MIN) / roundup_size)
2600 /* Get and set the next field in block-allocated vectorlike objects on
2601 the free list. Doing it this way respects C's aliasing rules.
2602 We could instead make 'contents' a union, but that would mean
2603 changes everywhere that the code uses 'contents'. */
2604 static struct Lisp_Vector
*
2605 next_in_free_list (struct Lisp_Vector
*v
)
2607 intptr_t i
= XLI (v
->contents
[0]);
2608 return (struct Lisp_Vector
*) i
;
2611 set_next_in_free_list (struct Lisp_Vector
*v
, struct Lisp_Vector
*next
)
2613 v
->contents
[0] = XIL ((intptr_t) next
);
2616 /* Common shortcut to setup vector on a free list. */
2618 #define SETUP_ON_FREE_LIST(v, nbytes, tmp) \
2620 (tmp) = ((nbytes - header_size) / word_size); \
2621 XSETPVECTYPESIZE (v, PVEC_FREE, 0, (tmp)); \
2622 eassert ((nbytes) % roundup_size == 0); \
2623 (tmp) = VINDEX (nbytes); \
2624 eassert ((tmp) < VECTOR_MAX_FREE_LIST_INDEX); \
2625 set_next_in_free_list (v, vector_free_lists[tmp]); \
2626 vector_free_lists[tmp] = (v); \
2627 total_free_vector_slots += (nbytes) / word_size; \
2630 /* This internal type is used to maintain the list of large vectors
2631 which are allocated at their own, e.g. outside of vector blocks. */
2636 struct large_vector
*vector
;
2638 /* We need to maintain ROUNDUP_SIZE alignment for the vector member. */
2639 unsigned char c
[vroundup (sizeof (struct large_vector
*))];
2642 struct Lisp_Vector v
;
2645 /* This internal type is used to maintain an underlying storage
2646 for small vectors. */
2650 char data
[VECTOR_BLOCK_BYTES
];
2651 struct vector_block
*next
;
2654 /* Chain of vector blocks. */
2656 static struct vector_block
*vector_blocks
;
2658 /* Vector free lists, where NTH item points to a chain of free
2659 vectors of the same NBYTES size, so NTH == VINDEX (NBYTES). */
2661 static struct Lisp_Vector
*vector_free_lists
[VECTOR_MAX_FREE_LIST_INDEX
];
2663 /* Singly-linked list of large vectors. */
2665 static struct large_vector
*large_vectors
;
2667 /* The only vector with 0 slots, allocated from pure space. */
2669 Lisp_Object zero_vector
;
2671 /* Number of live vectors. */
2673 static EMACS_INT total_vectors
;
2675 /* Total size of live and free vectors, in Lisp_Object units. */
2677 static EMACS_INT total_vector_slots
, total_free_vector_slots
;
2679 /* Get a new vector block. */
2681 static struct vector_block
*
2682 allocate_vector_block (void)
2684 struct vector_block
*block
= xmalloc (sizeof *block
);
2686 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
2687 mem_insert (block
->data
, block
->data
+ VECTOR_BLOCK_BYTES
,
2688 MEM_TYPE_VECTOR_BLOCK
);
2691 block
->next
= vector_blocks
;
2692 vector_blocks
= block
;
2696 /* Called once to initialize vector allocation. */
2701 zero_vector
= make_pure_vector (0);
2704 /* Allocate vector from a vector block. */
2706 static struct Lisp_Vector
*
2707 allocate_vector_from_block (size_t nbytes
)
2709 struct Lisp_Vector
*vector
;
2710 struct vector_block
*block
;
2711 size_t index
, restbytes
;
2713 eassert (VBLOCK_BYTES_MIN
<= nbytes
&& nbytes
<= VBLOCK_BYTES_MAX
);
2714 eassert (nbytes
% roundup_size
== 0);
2716 /* First, try to allocate from a free list
2717 containing vectors of the requested size. */
2718 index
= VINDEX (nbytes
);
2719 if (vector_free_lists
[index
])
2721 vector
= vector_free_lists
[index
];
2722 vector_free_lists
[index
] = next_in_free_list (vector
);
2723 total_free_vector_slots
-= nbytes
/ word_size
;
2727 /* Next, check free lists containing larger vectors. Since
2728 we will split the result, we should have remaining space
2729 large enough to use for one-slot vector at least. */
2730 for (index
= VINDEX (nbytes
+ VBLOCK_BYTES_MIN
);
2731 index
< VECTOR_MAX_FREE_LIST_INDEX
; index
++)
2732 if (vector_free_lists
[index
])
2734 /* This vector is larger than requested. */
2735 vector
= vector_free_lists
[index
];
2736 vector_free_lists
[index
] = next_in_free_list (vector
);
2737 total_free_vector_slots
-= nbytes
/ word_size
;
2739 /* Excess bytes are used for the smaller vector,
2740 which should be set on an appropriate free list. */
2741 restbytes
= index
* roundup_size
+ VBLOCK_BYTES_MIN
- nbytes
;
2742 eassert (restbytes
% roundup_size
== 0);
2743 SETUP_ON_FREE_LIST (ADVANCE (vector
, nbytes
), restbytes
, index
);
2747 /* Finally, need a new vector block. */
2748 block
= allocate_vector_block ();
2750 /* New vector will be at the beginning of this block. */
2751 vector
= (struct Lisp_Vector
*) block
->data
;
2753 /* If the rest of space from this block is large enough
2754 for one-slot vector at least, set up it on a free list. */
2755 restbytes
= VECTOR_BLOCK_BYTES
- nbytes
;
2756 if (restbytes
>= VBLOCK_BYTES_MIN
)
2758 eassert (restbytes
% roundup_size
== 0);
2759 SETUP_ON_FREE_LIST (ADVANCE (vector
, nbytes
), restbytes
, index
);
2764 /* Nonzero if VECTOR pointer is valid pointer inside BLOCK. */
2766 #define VECTOR_IN_BLOCK(vector, block) \
2767 ((char *) (vector) <= (block)->data \
2768 + VECTOR_BLOCK_BYTES - VBLOCK_BYTES_MIN)
2770 /* Return the memory footprint of V in bytes. */
2773 vector_nbytes (struct Lisp_Vector
*v
)
2775 ptrdiff_t size
= v
->header
.size
& ~ARRAY_MARK_FLAG
;
2777 if (size
& PSEUDOVECTOR_FLAG
)
2779 if (PSEUDOVECTOR_TYPEP (&v
->header
, PVEC_BOOL_VECTOR
))
2780 size
= (bool_header_size
2781 + (((struct Lisp_Bool_Vector
*) v
)->size
2782 + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2783 / BOOL_VECTOR_BITS_PER_CHAR
);
2786 + ((size
& PSEUDOVECTOR_SIZE_MASK
)
2787 + ((size
& PSEUDOVECTOR_REST_MASK
)
2788 >> PSEUDOVECTOR_SIZE_BITS
)) * word_size
);
2791 size
= header_size
+ size
* word_size
;
2792 return vroundup (size
);
2795 /* Reclaim space used by unmarked vectors. */
2798 sweep_vectors (void)
2800 struct vector_block
*block
= vector_blocks
, **bprev
= &vector_blocks
;
2801 struct large_vector
*lv
, **lvprev
= &large_vectors
;
2802 struct Lisp_Vector
*vector
, *next
;
2804 total_vectors
= total_vector_slots
= total_free_vector_slots
= 0;
2805 memset (vector_free_lists
, 0, sizeof (vector_free_lists
));
2807 /* Looking through vector blocks. */
2809 for (block
= vector_blocks
; block
; block
= *bprev
)
2811 bool free_this_block
= 0;
2814 for (vector
= (struct Lisp_Vector
*) block
->data
;
2815 VECTOR_IN_BLOCK (vector
, block
); vector
= next
)
2817 if (VECTOR_MARKED_P (vector
))
2819 VECTOR_UNMARK (vector
);
2821 nbytes
= vector_nbytes (vector
);
2822 total_vector_slots
+= nbytes
/ word_size
;
2823 next
= ADVANCE (vector
, nbytes
);
2827 ptrdiff_t total_bytes
;
2829 if (PSEUDOVECTOR_TYPEP (&vector
->header
, PVEC_THREAD
))
2830 finalize_one_thread ((struct thread_state
*) vector
);
2831 else if (PSEUDOVECTOR_TYPEP (&vector
->header
, PVEC_MUTEX
))
2832 finalize_one_mutex ((struct Lisp_Mutex
*) vector
);
2833 else if (PSEUDOVECTOR_TYPEP (&vector
->header
, PVEC_CONDVAR
))
2834 finalize_one_condvar ((struct Lisp_CondVar
*) vector
);
2836 nbytes
= vector_nbytes (vector
);
2837 total_bytes
= nbytes
;
2838 next
= ADVANCE (vector
, nbytes
);
2840 /* While NEXT is not marked, try to coalesce with VECTOR,
2841 thus making VECTOR of the largest possible size. */
2843 while (VECTOR_IN_BLOCK (next
, block
))
2845 if (VECTOR_MARKED_P (next
))
2847 nbytes
= vector_nbytes (next
);
2848 total_bytes
+= nbytes
;
2849 next
= ADVANCE (next
, nbytes
);
2852 eassert (total_bytes
% roundup_size
== 0);
2854 if (vector
== (struct Lisp_Vector
*) block
->data
2855 && !VECTOR_IN_BLOCK (next
, block
))
2856 /* This block should be freed because all of it's
2857 space was coalesced into the only free vector. */
2858 free_this_block
= 1;
2862 SETUP_ON_FREE_LIST (vector
, total_bytes
, tmp
);
2867 if (free_this_block
)
2869 *bprev
= block
->next
;
2870 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
2871 mem_delete (mem_find (block
->data
));
2876 bprev
= &block
->next
;
2879 /* Sweep large vectors. */
2881 for (lv
= large_vectors
; lv
; lv
= *lvprev
)
2884 if (VECTOR_MARKED_P (vector
))
2886 VECTOR_UNMARK (vector
);
2888 if (vector
->header
.size
& PSEUDOVECTOR_FLAG
)
2890 struct Lisp_Bool_Vector
*b
= (struct Lisp_Bool_Vector
*) vector
;
2892 /* All non-bool pseudovectors are small enough to be allocated
2893 from vector blocks. This code should be redesigned if some
2894 pseudovector type grows beyond VBLOCK_BYTES_MAX. */
2895 eassert (PSEUDOVECTOR_TYPEP (&vector
->header
, PVEC_BOOL_VECTOR
));
2898 += (bool_header_size
2899 + ((b
->size
+ BOOL_VECTOR_BITS_PER_CHAR
- 1)
2900 / BOOL_VECTOR_BITS_PER_CHAR
)) / word_size
;
2904 += header_size
/ word_size
+ vector
->header
.size
;
2905 lvprev
= &lv
->next
.vector
;
2909 *lvprev
= lv
->next
.vector
;
2915 /* Value is a pointer to a newly allocated Lisp_Vector structure
2916 with room for LEN Lisp_Objects. */
2918 static struct Lisp_Vector
*
2919 allocate_vectorlike (ptrdiff_t len
)
2921 struct Lisp_Vector
*p
;
2926 p
= XVECTOR (zero_vector
);
2929 size_t nbytes
= header_size
+ len
* word_size
;
2931 #ifdef DOUG_LEA_MALLOC
2932 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2933 because mapped region contents are not preserved in
2935 mallopt (M_MMAP_MAX
, 0);
2938 if (nbytes
<= VBLOCK_BYTES_MAX
)
2939 p
= allocate_vector_from_block (vroundup (nbytes
));
2942 struct large_vector
*lv
2943 = lisp_malloc ((offsetof (struct large_vector
, v
.contents
)
2945 MEM_TYPE_VECTORLIKE
);
2946 lv
->next
.vector
= large_vectors
;
2951 #ifdef DOUG_LEA_MALLOC
2952 /* Back to a reasonable maximum of mmap'ed areas. */
2953 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2956 consing_since_gc
+= nbytes
;
2957 vector_cells_consed
+= len
;
2960 MALLOC_UNBLOCK_INPUT
;
2966 /* Allocate a vector with LEN slots. */
2968 struct Lisp_Vector
*
2969 allocate_vector (EMACS_INT len
)
2971 struct Lisp_Vector
*v
;
2972 ptrdiff_t nbytes_max
= min (PTRDIFF_MAX
, SIZE_MAX
);
2974 if (min ((nbytes_max
- header_size
) / word_size
, MOST_POSITIVE_FIXNUM
) < len
)
2975 memory_full (SIZE_MAX
);
2976 v
= allocate_vectorlike (len
);
2977 v
->header
.size
= len
;
2982 /* Allocate other vector-like structures. */
2984 struct Lisp_Vector
*
2985 allocate_pseudovector (int memlen
, int lisplen
, enum pvec_type tag
)
2987 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2990 /* Catch bogus values. */
2991 eassert (tag
<= PVEC_FONT
);
2992 eassert (memlen
- lisplen
<= (1 << PSEUDOVECTOR_REST_BITS
) - 1);
2993 eassert (lisplen
<= (1 << PSEUDOVECTOR_SIZE_BITS
) - 1);
2995 /* Only the first lisplen slots will be traced normally by the GC. */
2996 for (i
= 0; i
< lisplen
; ++i
)
2997 v
->contents
[i
] = Qnil
;
2999 XSETPVECTYPESIZE (v
, tag
, lisplen
, memlen
- lisplen
);
3004 allocate_buffer (void)
3006 struct buffer
*b
= lisp_malloc (sizeof *b
, MEM_TYPE_BUFFER
);
3008 BUFFER_PVEC_INIT (b
);
3009 /* Put B on the chain of all buffers including killed ones. */
3010 b
->next
= all_buffers
;
3012 /* Note that the rest fields of B are not initialized. */
3016 struct Lisp_Hash_Table
*
3017 allocate_hash_table (void)
3019 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
3023 allocate_window (void)
3027 w
= ALLOCATE_PSEUDOVECTOR (struct window
, current_matrix
, PVEC_WINDOW
);
3028 /* Users assumes that non-Lisp data is zeroed. */
3029 memset (&w
->current_matrix
, 0,
3030 sizeof (*w
) - offsetof (struct window
, current_matrix
));
3035 allocate_terminal (void)
3039 t
= ALLOCATE_PSEUDOVECTOR (struct terminal
, next_terminal
, PVEC_TERMINAL
);
3040 /* Users assumes that non-Lisp data is zeroed. */
3041 memset (&t
->next_terminal
, 0,
3042 sizeof (*t
) - offsetof (struct terminal
, next_terminal
));
3047 allocate_frame (void)
3051 f
= ALLOCATE_PSEUDOVECTOR (struct frame
, face_cache
, PVEC_FRAME
);
3052 /* Users assumes that non-Lisp data is zeroed. */
3053 memset (&f
->face_cache
, 0,
3054 sizeof (*f
) - offsetof (struct frame
, face_cache
));
3058 struct Lisp_Process
*
3059 allocate_process (void)
3061 struct Lisp_Process
*p
;
3063 p
= ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
3064 /* Users assumes that non-Lisp data is zeroed. */
3066 sizeof (*p
) - offsetof (struct Lisp_Process
, pid
));
3070 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3071 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3072 See also the function `vector'. */)
3073 (register Lisp_Object length
, Lisp_Object init
)
3076 register ptrdiff_t sizei
;
3077 register ptrdiff_t i
;
3078 register struct Lisp_Vector
*p
;
3080 CHECK_NATNUM (length
);
3082 p
= allocate_vector (XFASTINT (length
));
3083 sizei
= XFASTINT (length
);
3084 for (i
= 0; i
< sizei
; i
++)
3085 p
->contents
[i
] = init
;
3087 XSETVECTOR (vector
, p
);
3092 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3093 doc
: /* Return a newly created vector with specified arguments as elements.
3094 Any number of arguments, even zero arguments, are allowed.
3095 usage: (vector &rest OBJECTS) */)
3096 (ptrdiff_t nargs
, Lisp_Object
*args
)
3099 register Lisp_Object val
= make_uninit_vector (nargs
);
3100 register struct Lisp_Vector
*p
= XVECTOR (val
);
3102 for (i
= 0; i
< nargs
; i
++)
3103 p
->contents
[i
] = args
[i
];
3108 make_byte_code (struct Lisp_Vector
*v
)
3110 if (v
->header
.size
> 1 && STRINGP (v
->contents
[1])
3111 && STRING_MULTIBYTE (v
->contents
[1]))
3112 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3113 earlier because they produced a raw 8-bit string for byte-code
3114 and now such a byte-code string is loaded as multibyte while
3115 raw 8-bit characters converted to multibyte form. Thus, now we
3116 must convert them back to the original unibyte form. */
3117 v
->contents
[1] = Fstring_as_unibyte (v
->contents
[1]);
3118 XSETPVECTYPE (v
, PVEC_COMPILED
);
3121 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3122 doc
: /* Create a byte-code object with specified arguments as elements.
3123 The arguments should be the ARGLIST, bytecode-string BYTE-CODE, constant
3124 vector CONSTANTS, maximum stack size DEPTH, (optional) DOCSTRING,
3125 and (optional) INTERACTIVE-SPEC.
3126 The first four arguments are required; at most six have any
3128 The ARGLIST can be either like the one of `lambda', in which case the arguments
3129 will be dynamically bound before executing the byte code, or it can be an
3130 integer of the form NNNNNNNRMMMMMMM where the 7bit MMMMMMM specifies the
3131 minimum number of arguments, the 7-bit NNNNNNN specifies the maximum number
3132 of arguments (ignoring &rest) and the R bit specifies whether there is a &rest
3133 argument to catch the left-over arguments. If such an integer is used, the
3134 arguments will not be dynamically bound but will be instead pushed on the
3135 stack before executing the byte-code.
3136 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3137 (ptrdiff_t nargs
, Lisp_Object
*args
)
3140 register Lisp_Object val
= make_uninit_vector (nargs
);
3141 register struct Lisp_Vector
*p
= XVECTOR (val
);
3143 /* We used to purecopy everything here, if purify-flag was set. This worked
3144 OK for Emacs-23, but with Emacs-24's lexical binding code, it can be
3145 dangerous, since make-byte-code is used during execution to build
3146 closures, so any closure built during the preload phase would end up
3147 copied into pure space, including its free variables, which is sometimes
3148 just wasteful and other times plainly wrong (e.g. those free vars may want
3151 for (i
= 0; i
< nargs
; i
++)
3152 p
->contents
[i
] = args
[i
];
3154 XSETCOMPILED (val
, p
);
3160 /***********************************************************************
3162 ***********************************************************************/
3164 /* Like struct Lisp_Symbol, but padded so that the size is a multiple
3165 of the required alignment if LSB tags are used. */
3167 union aligned_Lisp_Symbol
3169 struct Lisp_Symbol s
;
3171 unsigned char c
[(sizeof (struct Lisp_Symbol
) + GCALIGNMENT
- 1)
3176 /* Each symbol_block is just under 1020 bytes long, since malloc
3177 really allocates in units of powers of two and uses 4 bytes for its
3180 #define SYMBOL_BLOCK_SIZE \
3181 ((1020 - sizeof (struct symbol_block *)) / sizeof (union aligned_Lisp_Symbol))
3185 /* Place `symbols' first, to preserve alignment. */
3186 union aligned_Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3187 struct symbol_block
*next
;
3190 /* Current symbol block and index of first unused Lisp_Symbol
3193 static struct symbol_block
*symbol_block
;
3194 static int symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3196 /* List of free symbols. */
3198 static struct Lisp_Symbol
*symbol_free_list
;
3201 set_symbol_name (Lisp_Object sym
, Lisp_Object name
)
3203 XSYMBOL (sym
)->name
= name
;
3206 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3207 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3208 Its value is void, and its function definition and property list are nil. */)
3211 register Lisp_Object val
;
3212 register struct Lisp_Symbol
*p
;
3214 CHECK_STRING (name
);
3218 if (symbol_free_list
)
3220 XSETSYMBOL (val
, symbol_free_list
);
3221 symbol_free_list
= symbol_free_list
->next
;
3225 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3227 struct symbol_block
*new
3228 = lisp_malloc (sizeof *new, MEM_TYPE_SYMBOL
);
3229 new->next
= symbol_block
;
3231 symbol_block_index
= 0;
3232 total_free_symbols
+= SYMBOL_BLOCK_SIZE
;
3234 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
].s
);
3235 symbol_block_index
++;
3238 MALLOC_UNBLOCK_INPUT
;
3241 set_symbol_name (val
, name
);
3242 set_symbol_plist (val
, Qnil
);
3243 p
->redirect
= SYMBOL_PLAINVAL
;
3244 SET_SYMBOL_VAL (p
, Qunbound
);
3245 set_symbol_function (val
, Qnil
);
3246 set_symbol_next (val
, NULL
);
3248 p
->interned
= SYMBOL_UNINTERNED
;
3250 p
->declared_special
= 0;
3251 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3253 total_free_symbols
--;
3259 /***********************************************************************
3260 Marker (Misc) Allocation
3261 ***********************************************************************/
3263 /* Like union Lisp_Misc, but padded so that its size is a multiple of
3264 the required alignment when LSB tags are used. */
3266 union aligned_Lisp_Misc
3270 unsigned char c
[(sizeof (union Lisp_Misc
) + GCALIGNMENT
- 1)
3275 /* Allocation of markers and other objects that share that structure.
3276 Works like allocation of conses. */
3278 #define MARKER_BLOCK_SIZE \
3279 ((1020 - sizeof (struct marker_block *)) / sizeof (union aligned_Lisp_Misc))
3283 /* Place `markers' first, to preserve alignment. */
3284 union aligned_Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3285 struct marker_block
*next
;
3288 static struct marker_block
*marker_block
;
3289 static int marker_block_index
= MARKER_BLOCK_SIZE
;
3291 static union Lisp_Misc
*marker_free_list
;
3293 /* Return a newly allocated Lisp_Misc object of specified TYPE. */
3296 allocate_misc (enum Lisp_Misc_Type type
)
3302 if (marker_free_list
)
3304 XSETMISC (val
, marker_free_list
);
3305 marker_free_list
= marker_free_list
->u_free
.chain
;
3309 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3311 struct marker_block
*new = lisp_malloc (sizeof *new, MEM_TYPE_MISC
);
3312 new->next
= marker_block
;
3314 marker_block_index
= 0;
3315 total_free_markers
+= MARKER_BLOCK_SIZE
;
3317 XSETMISC (val
, &marker_block
->markers
[marker_block_index
].m
);
3318 marker_block_index
++;
3321 MALLOC_UNBLOCK_INPUT
;
3323 --total_free_markers
;
3324 consing_since_gc
+= sizeof (union Lisp_Misc
);
3325 misc_objects_consed
++;
3326 XMISCANY (val
)->type
= type
;
3327 XMISCANY (val
)->gcmarkbit
= 0;
3331 /* Free a Lisp_Misc object. */
3334 free_misc (Lisp_Object misc
)
3336 XMISCANY (misc
)->type
= Lisp_Misc_Free
;
3337 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3338 marker_free_list
= XMISC (misc
);
3339 consing_since_gc
-= sizeof (union Lisp_Misc
);
3340 total_free_markers
++;
3343 /* Verify properties of Lisp_Save_Value's representation
3344 that are assumed here and elsewhere. */
3346 verify (SAVE_UNUSED
== 0);
3347 verify (((SAVE_INTEGER
| SAVE_POINTER
| SAVE_FUNCPOINTER
| SAVE_OBJECT
)
3351 /* Return Lisp_Save_Value objects for the various combinations
3352 that callers need. */
3355 make_save_int_int_int (ptrdiff_t a
, ptrdiff_t b
, ptrdiff_t c
)
3357 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3358 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3359 p
->save_type
= SAVE_TYPE_INT_INT_INT
;
3360 p
->data
[0].integer
= a
;
3361 p
->data
[1].integer
= b
;
3362 p
->data
[2].integer
= c
;
3367 make_save_obj_obj_obj_obj (Lisp_Object a
, Lisp_Object b
, Lisp_Object c
,
3370 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3371 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3372 p
->save_type
= SAVE_TYPE_OBJ_OBJ_OBJ_OBJ
;
3373 p
->data
[0].object
= a
;
3374 p
->data
[1].object
= b
;
3375 p
->data
[2].object
= c
;
3376 p
->data
[3].object
= d
;
3380 #if defined HAVE_NS || defined HAVE_NTGUI
3382 make_save_ptr (void *a
)
3384 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3385 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3386 p
->save_type
= SAVE_POINTER
;
3387 p
->data
[0].pointer
= a
;
3393 make_save_ptr_int (void *a
, ptrdiff_t b
)
3395 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3396 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3397 p
->save_type
= SAVE_TYPE_PTR_INT
;
3398 p
->data
[0].pointer
= a
;
3399 p
->data
[1].integer
= b
;
3403 #if defined HAVE_MENUS && ! (defined USE_X_TOOLKIT || defined USE_GTK)
3405 make_save_ptr_ptr (void *a
, void *b
)
3407 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3408 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3409 p
->save_type
= SAVE_TYPE_PTR_PTR
;
3410 p
->data
[0].pointer
= a
;
3411 p
->data
[1].pointer
= b
;
3417 make_save_funcptr_ptr_obj (void (*a
) (void), void *b
, Lisp_Object c
)
3419 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3420 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3421 p
->save_type
= SAVE_TYPE_FUNCPTR_PTR_OBJ
;
3422 p
->data
[0].funcpointer
= a
;
3423 p
->data
[1].pointer
= b
;
3424 p
->data
[2].object
= c
;
3428 /* Return a Lisp_Save_Value object that represents an array A
3429 of N Lisp objects. */
3432 make_save_memory (Lisp_Object
*a
, ptrdiff_t n
)
3434 Lisp_Object val
= allocate_misc (Lisp_Misc_Save_Value
);
3435 struct Lisp_Save_Value
*p
= XSAVE_VALUE (val
);
3436 p
->save_type
= SAVE_TYPE_MEMORY
;
3437 p
->data
[0].pointer
= a
;
3438 p
->data
[1].integer
= n
;
3442 /* Free a Lisp_Save_Value object. Do not use this function
3443 if SAVE contains pointer other than returned by xmalloc. */
3446 free_save_value (Lisp_Object save
)
3448 xfree (XSAVE_POINTER (save
, 0));
3452 /* Return a Lisp_Misc_Overlay object with specified START, END and PLIST. */
3455 build_overlay (Lisp_Object start
, Lisp_Object end
, Lisp_Object plist
)
3457 register Lisp_Object overlay
;
3459 overlay
= allocate_misc (Lisp_Misc_Overlay
);
3460 OVERLAY_START (overlay
) = start
;
3461 OVERLAY_END (overlay
) = end
;
3462 set_overlay_plist (overlay
, plist
);
3463 XOVERLAY (overlay
)->next
= NULL
;
3467 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3468 doc
: /* Return a newly allocated marker which does not point at any place. */)
3471 register Lisp_Object val
;
3472 register struct Lisp_Marker
*p
;
3474 val
= allocate_misc (Lisp_Misc_Marker
);
3480 p
->insertion_type
= 0;
3484 /* Return a newly allocated marker which points into BUF
3485 at character position CHARPOS and byte position BYTEPOS. */
3488 build_marker (struct buffer
*buf
, ptrdiff_t charpos
, ptrdiff_t bytepos
)
3491 struct Lisp_Marker
*m
;
3493 /* No dead buffers here. */
3494 eassert (BUFFER_LIVE_P (buf
));
3496 /* Every character is at least one byte. */
3497 eassert (charpos
<= bytepos
);
3499 obj
= allocate_misc (Lisp_Misc_Marker
);
3502 m
->charpos
= charpos
;
3503 m
->bytepos
= bytepos
;
3504 m
->insertion_type
= 0;
3505 m
->next
= BUF_MARKERS (buf
);
3506 BUF_MARKERS (buf
) = m
;
3510 /* Put MARKER back on the free list after using it temporarily. */
3513 free_marker (Lisp_Object marker
)
3515 unchain_marker (XMARKER (marker
));
3520 /* Return a newly created vector or string with specified arguments as
3521 elements. If all the arguments are characters that can fit
3522 in a string of events, make a string; otherwise, make a vector.
3524 Any number of arguments, even zero arguments, are allowed. */
3527 make_event_array (register int nargs
, Lisp_Object
*args
)
3531 for (i
= 0; i
< nargs
; i
++)
3532 /* The things that fit in a string
3533 are characters that are in 0...127,
3534 after discarding the meta bit and all the bits above it. */
3535 if (!INTEGERP (args
[i
])
3536 || (XINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3537 return Fvector (nargs
, args
);
3539 /* Since the loop exited, we know that all the things in it are
3540 characters, so we can make a string. */
3544 result
= Fmake_string (make_number (nargs
), make_number (0));
3545 for (i
= 0; i
< nargs
; i
++)
3547 SSET (result
, i
, XINT (args
[i
]));
3548 /* Move the meta bit to the right place for a string char. */
3549 if (XINT (args
[i
]) & CHAR_META
)
3550 SSET (result
, i
, SREF (result
, i
) | 0x80);
3559 /************************************************************************
3560 Memory Full Handling
3561 ************************************************************************/
3564 /* Called if malloc (NBYTES) returns zero. If NBYTES == SIZE_MAX,
3565 there may have been size_t overflow so that malloc was never
3566 called, or perhaps malloc was invoked successfully but the
3567 resulting pointer had problems fitting into a tagged EMACS_INT. In
3568 either case this counts as memory being full even though malloc did
3572 memory_full (size_t nbytes
)
3574 /* Do not go into hysterics merely because a large request failed. */
3575 bool enough_free_memory
= 0;
3576 if (SPARE_MEMORY
< nbytes
)
3581 p
= malloc (SPARE_MEMORY
);
3585 enough_free_memory
= 1;
3587 MALLOC_UNBLOCK_INPUT
;
3590 if (! enough_free_memory
)
3596 memory_full_cons_threshold
= sizeof (struct cons_block
);
3598 /* The first time we get here, free the spare memory. */
3599 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3600 if (spare_memory
[i
])
3603 free (spare_memory
[i
]);
3604 else if (i
>= 1 && i
<= 4)
3605 lisp_align_free (spare_memory
[i
]);
3607 lisp_free (spare_memory
[i
]);
3608 spare_memory
[i
] = 0;
3612 /* This used to call error, but if we've run out of memory, we could
3613 get infinite recursion trying to build the string. */
3614 xsignal (Qnil
, Vmemory_signal_data
);
3617 /* If we released our reserve (due to running out of memory),
3618 and we have a fair amount free once again,
3619 try to set aside another reserve in case we run out once more.
3621 This is called when a relocatable block is freed in ralloc.c,
3622 and also directly from this file, in case we're not using ralloc.c. */
3625 refill_memory_reserve (void)
3627 #ifndef SYSTEM_MALLOC
3628 if (spare_memory
[0] == 0)
3629 spare_memory
[0] = malloc (SPARE_MEMORY
);
3630 if (spare_memory
[1] == 0)
3631 spare_memory
[1] = lisp_align_malloc (sizeof (struct cons_block
),
3633 if (spare_memory
[2] == 0)
3634 spare_memory
[2] = lisp_align_malloc (sizeof (struct cons_block
),
3636 if (spare_memory
[3] == 0)
3637 spare_memory
[3] = lisp_align_malloc (sizeof (struct cons_block
),
3639 if (spare_memory
[4] == 0)
3640 spare_memory
[4] = lisp_align_malloc (sizeof (struct cons_block
),
3642 if (spare_memory
[5] == 0)
3643 spare_memory
[5] = lisp_malloc (sizeof (struct string_block
),
3645 if (spare_memory
[6] == 0)
3646 spare_memory
[6] = lisp_malloc (sizeof (struct string_block
),
3648 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3649 Vmemory_full
= Qnil
;
3653 /************************************************************************
3655 ************************************************************************/
3657 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3659 /* Conservative C stack marking requires a method to identify possibly
3660 live Lisp objects given a pointer value. We do this by keeping
3661 track of blocks of Lisp data that are allocated in a red-black tree
3662 (see also the comment of mem_node which is the type of nodes in
3663 that tree). Function lisp_malloc adds information for an allocated
3664 block to the red-black tree with calls to mem_insert, and function
3665 lisp_free removes it with mem_delete. Functions live_string_p etc
3666 call mem_find to lookup information about a given pointer in the
3667 tree, and use that to determine if the pointer points to a Lisp
3670 /* Initialize this part of alloc.c. */
3675 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3676 mem_z
.parent
= NULL
;
3677 mem_z
.color
= MEM_BLACK
;
3678 mem_z
.start
= mem_z
.end
= NULL
;
3683 /* Value is a pointer to the mem_node containing START. Value is
3684 MEM_NIL if there is no node in the tree containing START. */
3686 static struct mem_node
*
3687 mem_find (void *start
)
3691 if (start
< min_heap_address
|| start
> max_heap_address
)
3694 /* Make the search always successful to speed up the loop below. */
3695 mem_z
.start
= start
;
3696 mem_z
.end
= (char *) start
+ 1;
3699 while (start
< p
->start
|| start
>= p
->end
)
3700 p
= start
< p
->start
? p
->left
: p
->right
;
3705 /* Insert a new node into the tree for a block of memory with start
3706 address START, end address END, and type TYPE. Value is a
3707 pointer to the node that was inserted. */
3709 static struct mem_node
*
3710 mem_insert (void *start
, void *end
, enum mem_type type
)
3712 struct mem_node
*c
, *parent
, *x
;
3714 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3715 min_heap_address
= start
;
3716 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3717 max_heap_address
= end
;
3719 /* See where in the tree a node for START belongs. In this
3720 particular application, it shouldn't happen that a node is already
3721 present. For debugging purposes, let's check that. */
3725 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3727 while (c
!= MEM_NIL
)
3729 if (start
>= c
->start
&& start
< c
->end
)
3732 c
= start
< c
->start
? c
->left
: c
->right
;
3735 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3737 while (c
!= MEM_NIL
)
3740 c
= start
< c
->start
? c
->left
: c
->right
;
3743 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3745 /* Create a new node. */
3746 #ifdef GC_MALLOC_CHECK
3747 x
= malloc (sizeof *x
);
3751 x
= xmalloc (sizeof *x
);
3757 x
->left
= x
->right
= MEM_NIL
;
3760 /* Insert it as child of PARENT or install it as root. */
3763 if (start
< parent
->start
)
3771 /* Re-establish red-black tree properties. */
3772 mem_insert_fixup (x
);
3778 /* Re-establish the red-black properties of the tree, and thereby
3779 balance the tree, after node X has been inserted; X is always red. */
3782 mem_insert_fixup (struct mem_node
*x
)
3784 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3786 /* X is red and its parent is red. This is a violation of
3787 red-black tree property #3. */
3789 if (x
->parent
== x
->parent
->parent
->left
)
3791 /* We're on the left side of our grandparent, and Y is our
3793 struct mem_node
*y
= x
->parent
->parent
->right
;
3795 if (y
->color
== MEM_RED
)
3797 /* Uncle and parent are red but should be black because
3798 X is red. Change the colors accordingly and proceed
3799 with the grandparent. */
3800 x
->parent
->color
= MEM_BLACK
;
3801 y
->color
= MEM_BLACK
;
3802 x
->parent
->parent
->color
= MEM_RED
;
3803 x
= x
->parent
->parent
;
3807 /* Parent and uncle have different colors; parent is
3808 red, uncle is black. */
3809 if (x
== x
->parent
->right
)
3812 mem_rotate_left (x
);
3815 x
->parent
->color
= MEM_BLACK
;
3816 x
->parent
->parent
->color
= MEM_RED
;
3817 mem_rotate_right (x
->parent
->parent
);
3822 /* This is the symmetrical case of above. */
3823 struct mem_node
*y
= x
->parent
->parent
->left
;
3825 if (y
->color
== MEM_RED
)
3827 x
->parent
->color
= MEM_BLACK
;
3828 y
->color
= MEM_BLACK
;
3829 x
->parent
->parent
->color
= MEM_RED
;
3830 x
= x
->parent
->parent
;
3834 if (x
== x
->parent
->left
)
3837 mem_rotate_right (x
);
3840 x
->parent
->color
= MEM_BLACK
;
3841 x
->parent
->parent
->color
= MEM_RED
;
3842 mem_rotate_left (x
->parent
->parent
);
3847 /* The root may have been changed to red due to the algorithm. Set
3848 it to black so that property #5 is satisfied. */
3849 mem_root
->color
= MEM_BLACK
;
3860 mem_rotate_left (struct mem_node
*x
)
3864 /* Turn y's left sub-tree into x's right sub-tree. */
3867 if (y
->left
!= MEM_NIL
)
3868 y
->left
->parent
= x
;
3870 /* Y's parent was x's parent. */
3872 y
->parent
= x
->parent
;
3874 /* Get the parent to point to y instead of x. */
3877 if (x
== x
->parent
->left
)
3878 x
->parent
->left
= y
;
3880 x
->parent
->right
= y
;
3885 /* Put x on y's left. */
3899 mem_rotate_right (struct mem_node
*x
)
3901 struct mem_node
*y
= x
->left
;
3904 if (y
->right
!= MEM_NIL
)
3905 y
->right
->parent
= x
;
3908 y
->parent
= x
->parent
;
3911 if (x
== x
->parent
->right
)
3912 x
->parent
->right
= y
;
3914 x
->parent
->left
= y
;
3925 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3928 mem_delete (struct mem_node
*z
)
3930 struct mem_node
*x
, *y
;
3932 if (!z
|| z
== MEM_NIL
)
3935 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3940 while (y
->left
!= MEM_NIL
)
3944 if (y
->left
!= MEM_NIL
)
3949 x
->parent
= y
->parent
;
3952 if (y
== y
->parent
->left
)
3953 y
->parent
->left
= x
;
3955 y
->parent
->right
= x
;
3962 z
->start
= y
->start
;
3967 if (y
->color
== MEM_BLACK
)
3968 mem_delete_fixup (x
);
3970 #ifdef GC_MALLOC_CHECK
3978 /* Re-establish the red-black properties of the tree, after a
3982 mem_delete_fixup (struct mem_node
*x
)
3984 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3986 if (x
== x
->parent
->left
)
3988 struct mem_node
*w
= x
->parent
->right
;
3990 if (w
->color
== MEM_RED
)
3992 w
->color
= MEM_BLACK
;
3993 x
->parent
->color
= MEM_RED
;
3994 mem_rotate_left (x
->parent
);
3995 w
= x
->parent
->right
;
3998 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
4005 if (w
->right
->color
== MEM_BLACK
)
4007 w
->left
->color
= MEM_BLACK
;
4009 mem_rotate_right (w
);
4010 w
= x
->parent
->right
;
4012 w
->color
= x
->parent
->color
;
4013 x
->parent
->color
= MEM_BLACK
;
4014 w
->right
->color
= MEM_BLACK
;
4015 mem_rotate_left (x
->parent
);
4021 struct mem_node
*w
= x
->parent
->left
;
4023 if (w
->color
== MEM_RED
)
4025 w
->color
= MEM_BLACK
;
4026 x
->parent
->color
= MEM_RED
;
4027 mem_rotate_right (x
->parent
);
4028 w
= x
->parent
->left
;
4031 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
4038 if (w
->left
->color
== MEM_BLACK
)
4040 w
->right
->color
= MEM_BLACK
;
4042 mem_rotate_left (w
);
4043 w
= x
->parent
->left
;
4046 w
->color
= x
->parent
->color
;
4047 x
->parent
->color
= MEM_BLACK
;
4048 w
->left
->color
= MEM_BLACK
;
4049 mem_rotate_right (x
->parent
);
4055 x
->color
= MEM_BLACK
;
4059 /* Value is non-zero if P is a pointer to a live Lisp string on
4060 the heap. M is a pointer to the mem_block for P. */
4063 live_string_p (struct mem_node
*m
, void *p
)
4065 if (m
->type
== MEM_TYPE_STRING
)
4067 struct string_block
*b
= m
->start
;
4068 ptrdiff_t offset
= (char *) p
- (char *) &b
->strings
[0];
4070 /* P must point to the start of a Lisp_String structure, and it
4071 must not be on the free-list. */
4073 && offset
% sizeof b
->strings
[0] == 0
4074 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
4075 && ((struct Lisp_String
*) p
)->data
!= NULL
);
4082 /* Value is non-zero if P is a pointer to a live Lisp cons on
4083 the heap. M is a pointer to the mem_block for P. */
4086 live_cons_p (struct mem_node
*m
, void *p
)
4088 if (m
->type
== MEM_TYPE_CONS
)
4090 struct cons_block
*b
= m
->start
;
4091 ptrdiff_t offset
= (char *) p
- (char *) &b
->conses
[0];
4093 /* P must point to the start of a Lisp_Cons, not be
4094 one of the unused cells in the current cons block,
4095 and not be on the free-list. */
4097 && offset
% sizeof b
->conses
[0] == 0
4098 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
4100 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
4101 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
4108 /* Value is non-zero if P is a pointer to a live Lisp symbol on
4109 the heap. M is a pointer to the mem_block for P. */
4112 live_symbol_p (struct mem_node
*m
, void *p
)
4114 if (m
->type
== MEM_TYPE_SYMBOL
)
4116 struct symbol_block
*b
= m
->start
;
4117 ptrdiff_t offset
= (char *) p
- (char *) &b
->symbols
[0];
4119 /* P must point to the start of a Lisp_Symbol, not be
4120 one of the unused cells in the current symbol block,
4121 and not be on the free-list. */
4123 && offset
% sizeof b
->symbols
[0] == 0
4124 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
4125 && (b
!= symbol_block
4126 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
4127 && !EQ (((struct Lisp_Symbol
*)p
)->function
, Vdead
));
4134 /* Value is non-zero if P is a pointer to a live Lisp float on
4135 the heap. M is a pointer to the mem_block for P. */
4138 live_float_p (struct mem_node
*m
, void *p
)
4140 if (m
->type
== MEM_TYPE_FLOAT
)
4142 struct float_block
*b
= m
->start
;
4143 ptrdiff_t offset
= (char *) p
- (char *) &b
->floats
[0];
4145 /* P must point to the start of a Lisp_Float and not be
4146 one of the unused cells in the current float block. */
4148 && offset
% sizeof b
->floats
[0] == 0
4149 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
4150 && (b
!= float_block
4151 || offset
/ sizeof b
->floats
[0] < float_block_index
));
4158 /* Value is non-zero if P is a pointer to a live Lisp Misc on
4159 the heap. M is a pointer to the mem_block for P. */
4162 live_misc_p (struct mem_node
*m
, void *p
)
4164 if (m
->type
== MEM_TYPE_MISC
)
4166 struct marker_block
*b
= m
->start
;
4167 ptrdiff_t offset
= (char *) p
- (char *) &b
->markers
[0];
4169 /* P must point to the start of a Lisp_Misc, not be
4170 one of the unused cells in the current misc block,
4171 and not be on the free-list. */
4173 && offset
% sizeof b
->markers
[0] == 0
4174 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4175 && (b
!= marker_block
4176 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4177 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
4184 /* Value is non-zero if P is a pointer to a live vector-like object.
4185 M is a pointer to the mem_block for P. */
4188 live_vector_p (struct mem_node
*m
, void *p
)
4190 if (m
->type
== MEM_TYPE_VECTOR_BLOCK
)
4192 /* This memory node corresponds to a vector block. */
4193 struct vector_block
*block
= m
->start
;
4194 struct Lisp_Vector
*vector
= (struct Lisp_Vector
*) block
->data
;
4196 /* P is in the block's allocation range. Scan the block
4197 up to P and see whether P points to the start of some
4198 vector which is not on a free list. FIXME: check whether
4199 some allocation patterns (probably a lot of short vectors)
4200 may cause a substantial overhead of this loop. */
4201 while (VECTOR_IN_BLOCK (vector
, block
)
4202 && vector
<= (struct Lisp_Vector
*) p
)
4204 if (!PSEUDOVECTOR_TYPEP (&vector
->header
, PVEC_FREE
) && vector
== p
)
4207 vector
= ADVANCE (vector
, vector_nbytes (vector
));
4210 else if (m
->type
== MEM_TYPE_VECTORLIKE
4211 && (char *) p
== ((char *) m
->start
4212 + offsetof (struct large_vector
, v
)))
4213 /* This memory node corresponds to a large vector. */
4219 /* Value is non-zero if P is a pointer to a live buffer. M is a
4220 pointer to the mem_block for P. */
4223 live_buffer_p (struct mem_node
*m
, void *p
)
4225 /* P must point to the start of the block, and the buffer
4226 must not have been killed. */
4227 return (m
->type
== MEM_TYPE_BUFFER
4229 && !NILP (((struct buffer
*) p
)->INTERNAL_FIELD (name
)));
4232 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4236 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4238 /* Currently not used, but may be called from gdb. */
4240 void dump_zombies (void) EXTERNALLY_VISIBLE
;
4242 /* Array of objects that are kept alive because the C stack contains
4243 a pattern that looks like a reference to them . */
4245 #define MAX_ZOMBIES 10
4246 static Lisp_Object zombies
[MAX_ZOMBIES
];
4248 /* Number of zombie objects. */
4250 static EMACS_INT nzombies
;
4252 /* Number of garbage collections. */
4254 static EMACS_INT ngcs
;
4256 /* Average percentage of zombies per collection. */
4258 static double avg_zombies
;
4260 /* Max. number of live and zombie objects. */
4262 static EMACS_INT max_live
, max_zombies
;
4264 /* Average number of live objects per GC. */
4266 static double avg_live
;
4268 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4269 doc
: /* Show information about live and zombie objects. */)
4272 Lisp_Object args
[8], zombie_list
= Qnil
;
4274 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); i
++)
4275 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4276 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4277 args
[1] = make_number (ngcs
);
4278 args
[2] = make_float (avg_live
);
4279 args
[3] = make_float (avg_zombies
);
4280 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4281 args
[5] = make_number (max_live
);
4282 args
[6] = make_number (max_zombies
);
4283 args
[7] = zombie_list
;
4284 return Fmessage (8, args
);
4287 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4290 /* Mark OBJ if we can prove it's a Lisp_Object. */
4293 mark_maybe_object (Lisp_Object obj
)
4301 po
= (void *) XPNTR (obj
);
4308 switch (XTYPE (obj
))
4311 mark_p
= (live_string_p (m
, po
)
4312 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4316 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4320 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4324 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4327 case Lisp_Vectorlike
:
4328 /* Note: can't check BUFFERP before we know it's a
4329 buffer because checking that dereferences the pointer
4330 PO which might point anywhere. */
4331 if (live_vector_p (m
, po
))
4332 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4333 else if (live_buffer_p (m
, po
))
4334 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4338 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4347 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4348 if (nzombies
< MAX_ZOMBIES
)
4349 zombies
[nzombies
] = obj
;
4358 /* If P points to Lisp data, mark that as live if it isn't already
4362 mark_maybe_pointer (void *p
)
4366 /* Quickly rule out some values which can't point to Lisp data.
4367 USE_LSB_TAG needs Lisp data to be aligned on multiples of GCALIGNMENT.
4368 Otherwise, assume that Lisp data is aligned on even addresses. */
4369 if ((intptr_t) p
% (USE_LSB_TAG
? GCALIGNMENT
: 2))
4375 Lisp_Object obj
= Qnil
;
4379 case MEM_TYPE_NON_LISP
:
4380 case MEM_TYPE_SPARE
:
4381 /* Nothing to do; not a pointer to Lisp memory. */
4384 case MEM_TYPE_BUFFER
:
4385 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P ((struct buffer
*)p
))
4386 XSETVECTOR (obj
, p
);
4390 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4394 case MEM_TYPE_STRING
:
4395 if (live_string_p (m
, p
)
4396 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4397 XSETSTRING (obj
, p
);
4401 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4405 case MEM_TYPE_SYMBOL
:
4406 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4407 XSETSYMBOL (obj
, p
);
4410 case MEM_TYPE_FLOAT
:
4411 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4415 case MEM_TYPE_VECTORLIKE
:
4416 case MEM_TYPE_VECTOR_BLOCK
:
4417 if (live_vector_p (m
, p
))
4420 XSETVECTOR (tem
, p
);
4421 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4436 /* Alignment of pointer values. Use alignof, as it sometimes returns
4437 a smaller alignment than GCC's __alignof__ and mark_memory might
4438 miss objects if __alignof__ were used. */
4439 #define GC_POINTER_ALIGNMENT alignof (void *)
4441 /* Define POINTERS_MIGHT_HIDE_IN_OBJECTS to 1 if marking via C pointers does
4442 not suffice, which is the typical case. A host where a Lisp_Object is
4443 wider than a pointer might allocate a Lisp_Object in non-adjacent halves.
4444 If USE_LSB_TAG, the bottom half is not a valid pointer, but it should
4445 suffice to widen it to to a Lisp_Object and check it that way. */
4446 #if USE_LSB_TAG || VAL_MAX < UINTPTR_MAX
4447 # if !USE_LSB_TAG && VAL_MAX < UINTPTR_MAX >> GCTYPEBITS
4448 /* If tag bits straddle pointer-word boundaries, neither mark_maybe_pointer
4449 nor mark_maybe_object can follow the pointers. This should not occur on
4450 any practical porting target. */
4451 # error "MSB type bits straddle pointer-word boundaries"
4453 /* Marking via C pointers does not suffice, because Lisp_Objects contain
4454 pointer words that hold pointers ORed with type bits. */
4455 # define POINTERS_MIGHT_HIDE_IN_OBJECTS 1
4457 /* Marking via C pointers suffices, because Lisp_Objects contain pointer
4458 words that hold unmodified pointers. */
4459 # define POINTERS_MIGHT_HIDE_IN_OBJECTS 0
4462 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4463 or END+OFFSET..START. */
4466 mark_memory (void *start
, void *end
)
4467 #if defined (__clang__) && defined (__has_feature)
4468 #if __has_feature(address_sanitizer)
4469 /* Do not allow -faddress-sanitizer to check this function, since it
4470 crosses the function stack boundary, and thus would yield many
4472 __attribute__((no_address_safety_analysis
))
4479 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4483 /* Make START the pointer to the start of the memory region,
4484 if it isn't already. */
4492 /* Mark Lisp data pointed to. This is necessary because, in some
4493 situations, the C compiler optimizes Lisp objects away, so that
4494 only a pointer to them remains. Example:
4496 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4499 Lisp_Object obj = build_string ("test");
4500 struct Lisp_String *s = XSTRING (obj);
4501 Fgarbage_collect ();
4502 fprintf (stderr, "test `%s'\n", s->data);
4506 Here, `obj' isn't really used, and the compiler optimizes it
4507 away. The only reference to the life string is through the
4510 for (pp
= start
; (void *) pp
< end
; pp
++)
4511 for (i
= 0; i
< sizeof *pp
; i
+= GC_POINTER_ALIGNMENT
)
4513 void *p
= *(void **) ((char *) pp
+ i
);
4514 mark_maybe_pointer (p
);
4515 if (POINTERS_MIGHT_HIDE_IN_OBJECTS
)
4516 mark_maybe_object (XIL ((intptr_t) p
));
4520 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4522 static bool setjmp_tested_p
;
4523 static int longjmps_done
;
4525 #define SETJMP_WILL_LIKELY_WORK "\
4527 Emacs garbage collector has been changed to use conservative stack\n\
4528 marking. Emacs has determined that the method it uses to do the\n\
4529 marking will likely work on your system, but this isn't sure.\n\
4531 If you are a system-programmer, or can get the help of a local wizard\n\
4532 who is, please take a look at the function mark_stack in alloc.c, and\n\
4533 verify that the methods used are appropriate for your system.\n\
4535 Please mail the result to <emacs-devel@gnu.org>.\n\
4538 #define SETJMP_WILL_NOT_WORK "\
4540 Emacs garbage collector has been changed to use conservative stack\n\
4541 marking. Emacs has determined that the default method it uses to do the\n\
4542 marking will not work on your system. We will need a system-dependent\n\
4543 solution for your system.\n\
4545 Please take a look at the function mark_stack in alloc.c, and\n\
4546 try to find a way to make it work on your system.\n\
4548 Note that you may get false negatives, depending on the compiler.\n\
4549 In particular, you need to use -O with GCC for this test.\n\
4551 Please mail the result to <emacs-devel@gnu.org>.\n\
4555 /* Perform a quick check if it looks like setjmp saves registers in a
4556 jmp_buf. Print a message to stderr saying so. When this test
4557 succeeds, this is _not_ a proof that setjmp is sufficient for
4558 conservative stack marking. Only the sources or a disassembly
4568 /* Arrange for X to be put in a register. */
4574 if (longjmps_done
== 1)
4576 /* Came here after the longjmp at the end of the function.
4578 If x == 1, the longjmp has restored the register to its
4579 value before the setjmp, and we can hope that setjmp
4580 saves all such registers in the jmp_buf, although that
4583 For other values of X, either something really strange is
4584 taking place, or the setjmp just didn't save the register. */
4587 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4590 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4597 if (longjmps_done
== 1)
4598 sys_longjmp (jbuf
, 1);
4601 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4604 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4606 /* Abort if anything GCPRO'd doesn't survive the GC. */
4614 for (p
= gcprolist
; p
; p
= p
->next
)
4615 for (i
= 0; i
< p
->nvars
; ++i
)
4616 if (!survives_gc_p (p
->var
[i
]))
4617 /* FIXME: It's not necessarily a bug. It might just be that the
4618 GCPRO is unnecessary or should release the object sooner. */
4622 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4629 fprintf (stderr
, "\nZombies kept alive = %"pI
"d:\n", nzombies
);
4630 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4632 fprintf (stderr
, " %d = ", i
);
4633 debug_print (zombies
[i
]);
4637 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4640 /* Mark live Lisp objects on the C stack.
4642 There are several system-dependent problems to consider when
4643 porting this to new architectures:
4647 We have to mark Lisp objects in CPU registers that can hold local
4648 variables or are used to pass parameters.
4650 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4651 something that either saves relevant registers on the stack, or
4652 calls mark_maybe_object passing it each register's contents.
4654 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4655 implementation assumes that calling setjmp saves registers we need
4656 to see in a jmp_buf which itself lies on the stack. This doesn't
4657 have to be true! It must be verified for each system, possibly
4658 by taking a look at the source code of setjmp.
4660 If __builtin_unwind_init is available (defined by GCC >= 2.8) we
4661 can use it as a machine independent method to store all registers
4662 to the stack. In this case the macros described in the previous
4663 two paragraphs are not used.
4667 Architectures differ in the way their processor stack is organized.
4668 For example, the stack might look like this
4671 | Lisp_Object | size = 4
4673 | something else | size = 2
4675 | Lisp_Object | size = 4
4679 In such a case, not every Lisp_Object will be aligned equally. To
4680 find all Lisp_Object on the stack it won't be sufficient to walk
4681 the stack in steps of 4 bytes. Instead, two passes will be
4682 necessary, one starting at the start of the stack, and a second
4683 pass starting at the start of the stack + 2. Likewise, if the
4684 minimal alignment of Lisp_Objects on the stack is 1, four passes
4685 would be necessary, each one starting with one byte more offset
4686 from the stack start. */
4689 mark_stack (char *bottom
, char *end
)
4691 /* This assumes that the stack is a contiguous region in memory. If
4692 that's not the case, something has to be done here to iterate
4693 over the stack segments. */
4694 mark_memory (bottom
, end
);
4696 /* Allow for marking a secondary stack, like the register stack on the
4698 #ifdef GC_MARK_SECONDARY_STACK
4699 GC_MARK_SECONDARY_STACK ();
4702 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4708 flush_stack_call_func (void (*func
) (void *arg
), void *arg
)
4711 struct thread_state
*self
= current_thread
;
4713 #ifdef HAVE___BUILTIN_UNWIND_INIT
4714 /* Force callee-saved registers and register windows onto the stack.
4715 This is the preferred method if available, obviating the need for
4716 machine dependent methods. */
4717 __builtin_unwind_init ();
4719 #else /* not HAVE___BUILTIN_UNWIND_INIT */
4720 #ifndef GC_SAVE_REGISTERS_ON_STACK
4721 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4722 union aligned_jmpbuf
{
4726 volatile bool stack_grows_down_p
= (char *) &j
> (char *) stack_bottom
;
4728 /* This trick flushes the register windows so that all the state of
4729 the process is contained in the stack. */
4730 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4731 needed on ia64 too. See mach_dep.c, where it also says inline
4732 assembler doesn't work with relevant proprietary compilers. */
4734 #if defined (__sparc64__) && defined (__FreeBSD__)
4735 /* FreeBSD does not have a ta 3 handler. */
4742 /* Save registers that we need to see on the stack. We need to see
4743 registers used to hold register variables and registers used to
4745 #ifdef GC_SAVE_REGISTERS_ON_STACK
4746 GC_SAVE_REGISTERS_ON_STACK (end
);
4747 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4749 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4750 setjmp will definitely work, test it
4751 and print a message with the result
4753 if (!setjmp_tested_p
)
4755 setjmp_tested_p
= 1;
4758 #endif /* GC_SETJMP_WORKS */
4761 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4762 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4763 #endif /* not HAVE___BUILTIN_UNWIND_INIT */
4765 self
->stack_top
= end
;
4768 eassert (current_thread
== self
);
4771 #else /* GC_MARK_STACK == 0 */
4773 #define mark_maybe_object(obj) emacs_abort ()
4775 #endif /* GC_MARK_STACK != 0 */
4778 /* Determine whether it is safe to access memory at address P. */
4780 valid_pointer_p (void *p
)
4783 return w32_valid_pointer_p (p
, 16);
4787 /* Obviously, we cannot just access it (we would SEGV trying), so we
4788 trick the o/s to tell us whether p is a valid pointer.
4789 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4790 not validate p in that case. */
4792 if (emacs_pipe (fd
) == 0)
4794 bool valid
= emacs_write (fd
[1], (char *) p
, 16) == 16;
4795 emacs_close (fd
[1]);
4796 emacs_close (fd
[0]);
4804 /* Return 2 if OBJ is a killed or special buffer object, 1 if OBJ is a
4805 valid lisp object, 0 if OBJ is NOT a valid lisp object, or -1 if we
4806 cannot validate OBJ. This function can be quite slow, so its primary
4807 use is the manual debugging. The only exception is print_object, where
4808 we use it to check whether the memory referenced by the pointer of
4809 Lisp_Save_Value object contains valid objects. */
4812 valid_lisp_object_p (Lisp_Object obj
)
4822 p
= (void *) XPNTR (obj
);
4823 if (PURE_POINTER_P (p
))
4826 if (p
== &buffer_defaults
|| p
== &buffer_local_symbols
)
4830 return valid_pointer_p (p
);
4837 int valid
= valid_pointer_p (p
);
4849 case MEM_TYPE_NON_LISP
:
4850 case MEM_TYPE_SPARE
:
4853 case MEM_TYPE_BUFFER
:
4854 return live_buffer_p (m
, p
) ? 1 : 2;
4857 return live_cons_p (m
, p
);
4859 case MEM_TYPE_STRING
:
4860 return live_string_p (m
, p
);
4863 return live_misc_p (m
, p
);
4865 case MEM_TYPE_SYMBOL
:
4866 return live_symbol_p (m
, p
);
4868 case MEM_TYPE_FLOAT
:
4869 return live_float_p (m
, p
);
4871 case MEM_TYPE_VECTORLIKE
:
4872 case MEM_TYPE_VECTOR_BLOCK
:
4873 return live_vector_p (m
, p
);
4886 /***********************************************************************
4887 Pure Storage Management
4888 ***********************************************************************/
4890 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4891 pointer to it. TYPE is the Lisp type for which the memory is
4892 allocated. TYPE < 0 means it's not used for a Lisp object. */
4895 pure_alloc (size_t size
, int type
)
4899 size_t alignment
= GCALIGNMENT
;
4901 size_t alignment
= alignof (EMACS_INT
);
4903 /* Give Lisp_Floats an extra alignment. */
4904 if (type
== Lisp_Float
)
4905 alignment
= alignof (struct Lisp_Float
);
4911 /* Allocate space for a Lisp object from the beginning of the free
4912 space with taking account of alignment. */
4913 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4914 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4918 /* Allocate space for a non-Lisp object from the end of the free
4920 pure_bytes_used_non_lisp
+= size
;
4921 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4923 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4925 if (pure_bytes_used
<= pure_size
)
4928 /* Don't allocate a large amount here,
4929 because it might get mmap'd and then its address
4930 might not be usable. */
4931 purebeg
= xmalloc (10000);
4933 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4934 pure_bytes_used
= 0;
4935 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4940 /* Print a warning if PURESIZE is too small. */
4943 check_pure_size (void)
4945 if (pure_bytes_used_before_overflow
)
4946 message (("emacs:0:Pure Lisp storage overflow (approx. %"pI
"d"
4948 pure_bytes_used
+ pure_bytes_used_before_overflow
);
4952 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4953 the non-Lisp data pool of the pure storage, and return its start
4954 address. Return NULL if not found. */
4957 find_string_data_in_pure (const char *data
, ptrdiff_t nbytes
)
4960 ptrdiff_t skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4961 const unsigned char *p
;
4964 if (pure_bytes_used_non_lisp
<= nbytes
)
4967 /* Set up the Boyer-Moore table. */
4969 for (i
= 0; i
< 256; i
++)
4972 p
= (const unsigned char *) data
;
4974 bm_skip
[*p
++] = skip
;
4976 last_char_skip
= bm_skip
['\0'];
4978 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4979 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4981 /* See the comments in the function `boyer_moore' (search.c) for the
4982 use of `infinity'. */
4983 infinity
= pure_bytes_used_non_lisp
+ 1;
4984 bm_skip
['\0'] = infinity
;
4986 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
4990 /* Check the last character (== '\0'). */
4993 start
+= bm_skip
[*(p
+ start
)];
4995 while (start
<= start_max
);
4997 if (start
< infinity
)
4998 /* Couldn't find the last character. */
5001 /* No less than `infinity' means we could find the last
5002 character at `p[start - infinity]'. */
5005 /* Check the remaining characters. */
5006 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
5008 return non_lisp_beg
+ start
;
5010 start
+= last_char_skip
;
5012 while (start
<= start_max
);
5018 /* Return a string allocated in pure space. DATA is a buffer holding
5019 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
5020 means make the result string multibyte.
5022 Must get an error if pure storage is full, since if it cannot hold
5023 a large string it may be able to hold conses that point to that
5024 string; then the string is not protected from gc. */
5027 make_pure_string (const char *data
,
5028 ptrdiff_t nchars
, ptrdiff_t nbytes
, bool multibyte
)
5031 struct Lisp_String
*s
= pure_alloc (sizeof *s
, Lisp_String
);
5032 s
->data
= (unsigned char *) find_string_data_in_pure (data
, nbytes
);
5033 if (s
->data
== NULL
)
5035 s
->data
= pure_alloc (nbytes
+ 1, -1);
5036 memcpy (s
->data
, data
, nbytes
);
5037 s
->data
[nbytes
] = '\0';
5040 s
->size_byte
= multibyte
? nbytes
: -1;
5041 s
->intervals
= NULL
;
5042 XSETSTRING (string
, s
);
5046 /* Return a string allocated in pure space. Do not
5047 allocate the string data, just point to DATA. */
5050 make_pure_c_string (const char *data
, ptrdiff_t nchars
)
5053 struct Lisp_String
*s
= pure_alloc (sizeof *s
, Lisp_String
);
5056 s
->data
= (unsigned char *) data
;
5057 s
->intervals
= NULL
;
5058 XSETSTRING (string
, s
);
5062 /* Return a cons allocated from pure space. Give it pure copies
5063 of CAR as car and CDR as cdr. */
5066 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
5069 struct Lisp_Cons
*p
= pure_alloc (sizeof *p
, Lisp_Cons
);
5071 XSETCAR (new, Fpurecopy (car
));
5072 XSETCDR (new, Fpurecopy (cdr
));
5077 /* Value is a float object with value NUM allocated from pure space. */
5080 make_pure_float (double num
)
5083 struct Lisp_Float
*p
= pure_alloc (sizeof *p
, Lisp_Float
);
5085 XFLOAT_INIT (new, num
);
5090 /* Return a vector with room for LEN Lisp_Objects allocated from
5094 make_pure_vector (ptrdiff_t len
)
5097 size_t size
= header_size
+ len
* word_size
;
5098 struct Lisp_Vector
*p
= pure_alloc (size
, Lisp_Vectorlike
);
5099 XSETVECTOR (new, p
);
5100 XVECTOR (new)->header
.size
= len
;
5105 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
5106 doc
: /* Make a copy of object OBJ in pure storage.
5107 Recursively copies contents of vectors and cons cells.
5108 Does not copy symbols. Copies strings without text properties. */)
5109 (register Lisp_Object obj
)
5111 if (NILP (Vpurify_flag
))
5114 if (PURE_POINTER_P (XPNTR (obj
)))
5117 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
5119 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
5125 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
5126 else if (FLOATP (obj
))
5127 obj
= make_pure_float (XFLOAT_DATA (obj
));
5128 else if (STRINGP (obj
))
5129 obj
= make_pure_string (SSDATA (obj
), SCHARS (obj
),
5131 STRING_MULTIBYTE (obj
));
5132 else if (COMPILEDP (obj
) || VECTORP (obj
))
5134 register struct Lisp_Vector
*vec
;
5135 register ptrdiff_t i
;
5139 if (size
& PSEUDOVECTOR_FLAG
)
5140 size
&= PSEUDOVECTOR_SIZE_MASK
;
5141 vec
= XVECTOR (make_pure_vector (size
));
5142 for (i
= 0; i
< size
; i
++)
5143 vec
->contents
[i
] = Fpurecopy (AREF (obj
, i
));
5144 if (COMPILEDP (obj
))
5146 XSETPVECTYPE (vec
, PVEC_COMPILED
);
5147 XSETCOMPILED (obj
, vec
);
5150 XSETVECTOR (obj
, vec
);
5152 else if (MARKERP (obj
))
5153 error ("Attempt to copy a marker to pure storage");
5155 /* Not purified, don't hash-cons. */
5158 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
5159 Fputhash (obj
, obj
, Vpurify_flag
);
5166 /***********************************************************************
5168 ***********************************************************************/
5170 /* Put an entry in staticvec, pointing at the variable with address
5174 staticpro (Lisp_Object
*varaddress
)
5176 if (staticidx
>= NSTATICS
)
5177 fatal ("NSTATICS too small; try increasing and recompiling Emacs.");
5178 staticvec
[staticidx
++] = varaddress
;
5182 /***********************************************************************
5184 ***********************************************************************/
5186 /* Temporarily prevent garbage collection. */
5189 inhibit_garbage_collection (void)
5191 ptrdiff_t count
= SPECPDL_INDEX ();
5193 specbind (Qgc_cons_threshold
, make_number (MOST_POSITIVE_FIXNUM
));
5197 /* Used to avoid possible overflows when
5198 converting from C to Lisp integers. */
5201 bounded_number (EMACS_INT number
)
5203 return make_number (min (MOST_POSITIVE_FIXNUM
, number
));
5206 /* Calculate total bytes of live objects. */
5209 total_bytes_of_live_objects (void)
5212 tot
+= total_conses
* sizeof (struct Lisp_Cons
);
5213 tot
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5214 tot
+= total_markers
* sizeof (union Lisp_Misc
);
5215 tot
+= total_string_bytes
;
5216 tot
+= total_vector_slots
* word_size
;
5217 tot
+= total_floats
* sizeof (struct Lisp_Float
);
5218 tot
+= total_intervals
* sizeof (struct interval
);
5219 tot
+= total_strings
* sizeof (struct Lisp_String
);
5223 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
5224 doc
: /* Reclaim storage for Lisp objects no longer needed.
5225 Garbage collection happens automatically if you cons more than
5226 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
5227 `garbage-collect' normally returns a list with info on amount of space in use,
5228 where each entry has the form (NAME SIZE USED FREE), where:
5229 - NAME is a symbol describing the kind of objects this entry represents,
5230 - SIZE is the number of bytes used by each one,
5231 - USED is the number of those objects that were found live in the heap,
5232 - FREE is the number of those objects that are not live but that Emacs
5233 keeps around for future allocations (maybe because it does not know how
5234 to return them to the OS).
5235 However, if there was overflow in pure space, `garbage-collect'
5236 returns nil, because real GC can't be done.
5237 See Info node `(elisp)Garbage Collection'. */)
5240 struct buffer
*nextb
;
5241 char stack_top_variable
;
5244 ptrdiff_t count
= SPECPDL_INDEX ();
5246 Lisp_Object retval
= Qnil
;
5247 size_t tot_before
= 0;
5252 /* Can't GC if pure storage overflowed because we can't determine
5253 if something is a pure object or not. */
5254 if (pure_bytes_used_before_overflow
)
5257 /* Record this function, so it appears on the profiler's backtraces. */
5258 record_in_backtrace (Qautomatic_gc
, &Qnil
, 0);
5262 /* Don't keep undo information around forever.
5263 Do this early on, so it is no problem if the user quits. */
5264 FOR_EACH_BUFFER (nextb
)
5265 compact_buffer (nextb
);
5267 if (profiler_memory_running
)
5268 tot_before
= total_bytes_of_live_objects ();
5270 start
= current_emacs_time ();
5272 /* In case user calls debug_print during GC,
5273 don't let that cause a recursive GC. */
5274 consing_since_gc
= 0;
5276 /* Save what's currently displayed in the echo area. */
5277 message_p
= push_message ();
5278 record_unwind_protect_void (pop_message_unwind
);
5280 /* Save a copy of the contents of the stack, for debugging. */
5281 #if MAX_SAVE_STACK > 0
5282 if (NILP (Vpurify_flag
))
5285 ptrdiff_t stack_size
;
5286 if (&stack_top_variable
< stack_bottom
)
5288 stack
= &stack_top_variable
;
5289 stack_size
= stack_bottom
- &stack_top_variable
;
5293 stack
= stack_bottom
;
5294 stack_size
= &stack_top_variable
- stack_bottom
;
5296 if (stack_size
<= MAX_SAVE_STACK
)
5298 if (stack_copy_size
< stack_size
)
5300 stack_copy
= xrealloc (stack_copy
, stack_size
);
5301 stack_copy_size
= stack_size
;
5303 memcpy (stack_copy
, stack
, stack_size
);
5306 #endif /* MAX_SAVE_STACK > 0 */
5308 if (garbage_collection_messages
)
5309 message1_nolog ("Garbage collecting...");
5313 shrink_regexp_cache ();
5317 /* Mark all the special slots that serve as the roots of accessibility. */
5319 mark_buffer (&buffer_defaults
);
5320 mark_buffer (&buffer_local_symbols
);
5322 for (i
= 0; i
< staticidx
; i
++)
5323 mark_object (*staticvec
[i
]);
5333 #ifdef HAVE_WINDOW_SYSTEM
5334 mark_fringe_data ();
5337 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5342 /* Everything is now marked, except for the things that require special
5343 finalization, i.e. the undo_list.
5344 Look thru every buffer's undo list
5345 for elements that update markers that were not marked,
5347 FOR_EACH_BUFFER (nextb
)
5349 /* If a buffer's undo list is Qt, that means that undo is
5350 turned off in that buffer. Calling truncate_undo_list on
5351 Qt tends to return NULL, which effectively turns undo back on.
5352 So don't call truncate_undo_list if undo_list is Qt. */
5353 if (! EQ (nextb
->INTERNAL_FIELD (undo_list
), Qt
))
5355 Lisp_Object tail
, prev
;
5356 tail
= nextb
->INTERNAL_FIELD (undo_list
);
5358 while (CONSP (tail
))
5360 if (CONSP (XCAR (tail
))
5361 && MARKERP (XCAR (XCAR (tail
)))
5362 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5365 nextb
->INTERNAL_FIELD (undo_list
) = tail
= XCDR (tail
);
5369 XSETCDR (prev
, tail
);
5379 /* Now that we have stripped the elements that need not be in the
5380 undo_list any more, we can finally mark the list. */
5381 mark_object (nextb
->INTERNAL_FIELD (undo_list
));
5386 /* Clear the mark bits that we set in certain root slots. */
5389 VECTOR_UNMARK (&buffer_defaults
);
5390 VECTOR_UNMARK (&buffer_local_symbols
);
5392 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5402 consing_since_gc
= 0;
5403 if (gc_cons_threshold
< GC_DEFAULT_THRESHOLD
/ 10)
5404 gc_cons_threshold
= GC_DEFAULT_THRESHOLD
/ 10;
5406 gc_relative_threshold
= 0;
5407 if (FLOATP (Vgc_cons_percentage
))
5408 { /* Set gc_cons_combined_threshold. */
5409 double tot
= total_bytes_of_live_objects ();
5411 tot
*= XFLOAT_DATA (Vgc_cons_percentage
);
5414 if (tot
< TYPE_MAXIMUM (EMACS_INT
))
5415 gc_relative_threshold
= tot
;
5417 gc_relative_threshold
= TYPE_MAXIMUM (EMACS_INT
);
5421 if (garbage_collection_messages
)
5423 if (message_p
|| minibuf_level
> 0)
5426 message1_nolog ("Garbage collecting...done");
5429 unbind_to (count
, Qnil
);
5431 Lisp_Object total
[11];
5432 int total_size
= 10;
5434 total
[0] = list4 (Qconses
, make_number (sizeof (struct Lisp_Cons
)),
5435 bounded_number (total_conses
),
5436 bounded_number (total_free_conses
));
5438 total
[1] = list4 (Qsymbols
, make_number (sizeof (struct Lisp_Symbol
)),
5439 bounded_number (total_symbols
),
5440 bounded_number (total_free_symbols
));
5442 total
[2] = list4 (Qmiscs
, make_number (sizeof (union Lisp_Misc
)),
5443 bounded_number (total_markers
),
5444 bounded_number (total_free_markers
));
5446 total
[3] = list4 (Qstrings
, make_number (sizeof (struct Lisp_String
)),
5447 bounded_number (total_strings
),
5448 bounded_number (total_free_strings
));
5450 total
[4] = list3 (Qstring_bytes
, make_number (1),
5451 bounded_number (total_string_bytes
));
5453 total
[5] = list3 (Qvectors
,
5454 make_number (header_size
+ sizeof (Lisp_Object
)),
5455 bounded_number (total_vectors
));
5457 total
[6] = list4 (Qvector_slots
, make_number (word_size
),
5458 bounded_number (total_vector_slots
),
5459 bounded_number (total_free_vector_slots
));
5461 total
[7] = list4 (Qfloats
, make_number (sizeof (struct Lisp_Float
)),
5462 bounded_number (total_floats
),
5463 bounded_number (total_free_floats
));
5465 total
[8] = list4 (Qintervals
, make_number (sizeof (struct interval
)),
5466 bounded_number (total_intervals
),
5467 bounded_number (total_free_intervals
));
5469 total
[9] = list3 (Qbuffers
, make_number (sizeof (struct buffer
)),
5470 bounded_number (total_buffers
));
5472 #ifdef DOUG_LEA_MALLOC
5474 total
[10] = list4 (Qheap
, make_number (1024),
5475 bounded_number ((mallinfo ().uordblks
+ 1023) >> 10),
5476 bounded_number ((mallinfo ().fordblks
+ 1023) >> 10));
5478 retval
= Flist (total_size
, total
);
5481 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5483 /* Compute average percentage of zombies. */
5485 = (total_conses
+ total_symbols
+ total_markers
+ total_strings
5486 + total_vectors
+ total_floats
+ total_intervals
+ total_buffers
);
5488 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5489 max_live
= max (nlive
, max_live
);
5490 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5491 max_zombies
= max (nzombies
, max_zombies
);
5496 if (!NILP (Vpost_gc_hook
))
5498 ptrdiff_t gc_count
= inhibit_garbage_collection ();
5499 safe_run_hooks (Qpost_gc_hook
);
5500 unbind_to (gc_count
, Qnil
);
5503 /* Accumulate statistics. */
5504 if (FLOATP (Vgc_elapsed
))
5506 EMACS_TIME since_start
= sub_emacs_time (current_emacs_time (), start
);
5507 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
)
5508 + EMACS_TIME_TO_DOUBLE (since_start
));
5513 /* Collect profiling data. */
5514 if (profiler_memory_running
)
5517 size_t tot_after
= total_bytes_of_live_objects ();
5518 if (tot_before
> tot_after
)
5519 swept
= tot_before
- tot_after
;
5520 malloc_probe (swept
);
5527 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5528 only interesting objects referenced from glyphs are strings. */
5531 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5533 struct glyph_row
*row
= matrix
->rows
;
5534 struct glyph_row
*end
= row
+ matrix
->nrows
;
5536 for (; row
< end
; ++row
)
5540 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5542 struct glyph
*glyph
= row
->glyphs
[area
];
5543 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5545 for (; glyph
< end_glyph
; ++glyph
)
5546 if (STRINGP (glyph
->object
)
5547 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5548 mark_object (glyph
->object
);
5554 /* Mark Lisp faces in the face cache C. */
5557 mark_face_cache (struct face_cache
*c
)
5562 for (i
= 0; i
< c
->used
; ++i
)
5564 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5568 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5569 mark_object (face
->lface
[j
]);
5577 /* Mark reference to a Lisp_Object.
5578 If the object referred to has not been seen yet, recursively mark
5579 all the references contained in it. */
5581 #define LAST_MARKED_SIZE 500
5582 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5583 static int last_marked_index
;
5585 /* For debugging--call abort when we cdr down this many
5586 links of a list, in mark_object. In debugging,
5587 the call to abort will hit a breakpoint.
5588 Normally this is zero and the check never goes off. */
5589 ptrdiff_t mark_object_loop_halt EXTERNALLY_VISIBLE
;
5592 mark_vectorlike (struct Lisp_Vector
*ptr
)
5594 ptrdiff_t size
= ptr
->header
.size
;
5597 eassert (!VECTOR_MARKED_P (ptr
));
5598 VECTOR_MARK (ptr
); /* Else mark it. */
5599 if (size
& PSEUDOVECTOR_FLAG
)
5600 size
&= PSEUDOVECTOR_SIZE_MASK
;
5602 /* Note that this size is not the memory-footprint size, but only
5603 the number of Lisp_Object fields that we should trace.
5604 The distinction is used e.g. by Lisp_Process which places extra
5605 non-Lisp_Object fields at the end of the structure... */
5606 for (i
= 0; i
< size
; i
++) /* ...and then mark its elements. */
5607 mark_object (ptr
->contents
[i
]);
5610 /* Like mark_vectorlike but optimized for char-tables (and
5611 sub-char-tables) assuming that the contents are mostly integers or
5615 mark_char_table (struct Lisp_Vector
*ptr
)
5617 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5620 eassert (!VECTOR_MARKED_P (ptr
));
5622 for (i
= 0; i
< size
; i
++)
5624 Lisp_Object val
= ptr
->contents
[i
];
5626 if (INTEGERP (val
) || (SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
))
5628 if (SUB_CHAR_TABLE_P (val
))
5630 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5631 mark_char_table (XVECTOR (val
));
5638 /* Mark the chain of overlays starting at PTR. */
5641 mark_overlay (struct Lisp_Overlay
*ptr
)
5643 for (; ptr
&& !ptr
->gcmarkbit
; ptr
= ptr
->next
)
5646 mark_object (ptr
->start
);
5647 mark_object (ptr
->end
);
5648 mark_object (ptr
->plist
);
5652 /* Mark Lisp_Objects and special pointers in BUFFER. */
5655 mark_buffer (struct buffer
*buffer
)
5657 /* This is handled much like other pseudovectors... */
5658 mark_vectorlike ((struct Lisp_Vector
*) buffer
);
5660 /* ...but there are some buffer-specific things. */
5662 MARK_INTERVAL_TREE (buffer_intervals (buffer
));
5664 /* For now, we just don't mark the undo_list. It's done later in
5665 a special way just before the sweep phase, and after stripping
5666 some of its elements that are not needed any more. */
5668 mark_overlay (buffer
->overlays_before
);
5669 mark_overlay (buffer
->overlays_after
);
5671 /* If this is an indirect buffer, mark its base buffer. */
5672 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5673 mark_buffer (buffer
->base_buffer
);
5676 /* Remove killed buffers or items whose car is a killed buffer from
5677 LIST, and mark other items. Return changed LIST, which is marked. */
5680 mark_discard_killed_buffers (Lisp_Object list
)
5682 Lisp_Object tail
, *prev
= &list
;
5684 for (tail
= list
; CONSP (tail
) && !CONS_MARKED_P (XCONS (tail
));
5687 Lisp_Object tem
= XCAR (tail
);
5690 if (BUFFERP (tem
) && !BUFFER_LIVE_P (XBUFFER (tem
)))
5691 *prev
= XCDR (tail
);
5694 CONS_MARK (XCONS (tail
));
5695 mark_object (XCAR (tail
));
5696 prev
= xcdr_addr (tail
);
5703 /* Determine type of generic Lisp_Object and mark it accordingly. */
5706 mark_object (Lisp_Object arg
)
5708 register Lisp_Object obj
= arg
;
5709 #ifdef GC_CHECK_MARKED_OBJECTS
5713 ptrdiff_t cdr_count
= 0;
5717 if (PURE_POINTER_P (XPNTR (obj
)))
5720 last_marked
[last_marked_index
++] = obj
;
5721 if (last_marked_index
== LAST_MARKED_SIZE
)
5722 last_marked_index
= 0;
5724 /* Perform some sanity checks on the objects marked here. Abort if
5725 we encounter an object we know is bogus. This increases GC time
5726 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5727 #ifdef GC_CHECK_MARKED_OBJECTS
5729 po
= (void *) XPNTR (obj
);
5731 /* Check that the object pointed to by PO is known to be a Lisp
5732 structure allocated from the heap. */
5733 #define CHECK_ALLOCATED() \
5735 m = mem_find (po); \
5740 /* Check that the object pointed to by PO is live, using predicate
5742 #define CHECK_LIVE(LIVEP) \
5744 if (!LIVEP (m, po)) \
5748 /* Check both of the above conditions. */
5749 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5751 CHECK_ALLOCATED (); \
5752 CHECK_LIVE (LIVEP); \
5755 #else /* not GC_CHECK_MARKED_OBJECTS */
5757 #define CHECK_LIVE(LIVEP) (void) 0
5758 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5760 #endif /* not GC_CHECK_MARKED_OBJECTS */
5762 switch (XTYPE (obj
))
5766 register struct Lisp_String
*ptr
= XSTRING (obj
);
5767 if (STRING_MARKED_P (ptr
))
5769 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5771 MARK_INTERVAL_TREE (ptr
->intervals
);
5772 #ifdef GC_CHECK_STRING_BYTES
5773 /* Check that the string size recorded in the string is the
5774 same as the one recorded in the sdata structure. */
5776 #endif /* GC_CHECK_STRING_BYTES */
5780 case Lisp_Vectorlike
:
5782 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5783 register ptrdiff_t pvectype
;
5785 if (VECTOR_MARKED_P (ptr
))
5788 #ifdef GC_CHECK_MARKED_OBJECTS
5790 if (m
== MEM_NIL
&& !SUBRP (obj
))
5792 #endif /* GC_CHECK_MARKED_OBJECTS */
5794 if (ptr
->header
.size
& PSEUDOVECTOR_FLAG
)
5795 pvectype
= ((ptr
->header
.size
& PVEC_TYPE_MASK
)
5796 >> PSEUDOVECTOR_AREA_BITS
);
5798 pvectype
= PVEC_NORMAL_VECTOR
;
5800 if (pvectype
!= PVEC_SUBR
&& pvectype
!= PVEC_BUFFER
)
5801 CHECK_LIVE (live_vector_p
);
5806 #ifdef GC_CHECK_MARKED_OBJECTS
5815 #endif /* GC_CHECK_MARKED_OBJECTS */
5816 mark_buffer ((struct buffer
*) ptr
);
5820 { /* We could treat this just like a vector, but it is better
5821 to save the COMPILED_CONSTANTS element for last and avoid
5823 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5827 for (i
= 0; i
< size
; i
++)
5828 if (i
!= COMPILED_CONSTANTS
)
5829 mark_object (ptr
->contents
[i
]);
5830 if (size
> COMPILED_CONSTANTS
)
5832 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5839 mark_vectorlike (ptr
);
5840 mark_face_cache (((struct frame
*) ptr
)->face_cache
);
5845 struct window
*w
= (struct window
*) ptr
;
5847 mark_vectorlike (ptr
);
5849 /* Mark glyph matrices, if any. Marking window
5850 matrices is sufficient because frame matrices
5851 use the same glyph memory. */
5852 if (w
->current_matrix
)
5854 mark_glyph_matrix (w
->current_matrix
);
5855 mark_glyph_matrix (w
->desired_matrix
);
5858 /* Filter out killed buffers from both buffer lists
5859 in attempt to help GC to reclaim killed buffers faster.
5860 We can do it elsewhere for live windows, but this is the
5861 best place to do it for dead windows. */
5863 (w
, mark_discard_killed_buffers (w
->prev_buffers
));
5865 (w
, mark_discard_killed_buffers (w
->next_buffers
));
5869 case PVEC_HASH_TABLE
:
5871 struct Lisp_Hash_Table
*h
= (struct Lisp_Hash_Table
*) ptr
;
5873 mark_vectorlike (ptr
);
5874 mark_object (h
->test
.name
);
5875 mark_object (h
->test
.user_hash_function
);
5876 mark_object (h
->test
.user_cmp_function
);
5877 /* If hash table is not weak, mark all keys and values.
5878 For weak tables, mark only the vector. */
5880 mark_object (h
->key_and_value
);
5882 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5886 case PVEC_CHAR_TABLE
:
5887 mark_char_table (ptr
);
5890 case PVEC_BOOL_VECTOR
:
5891 /* No Lisp_Objects to mark in a bool vector. */
5902 mark_vectorlike (ptr
);
5909 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5910 struct Lisp_Symbol
*ptrx
;
5914 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5916 mark_object (ptr
->function
);
5917 mark_object (ptr
->plist
);
5918 switch (ptr
->redirect
)
5920 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
5921 case SYMBOL_VARALIAS
:
5924 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
5928 case SYMBOL_LOCALIZED
:
5930 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
5931 Lisp_Object where
= blv
->where
;
5932 /* If the value is set up for a killed buffer or deleted
5933 frame, restore it's global binding. If the value is
5934 forwarded to a C variable, either it's not a Lisp_Object
5935 var, or it's staticpro'd already. */
5936 if ((BUFFERP (where
) && !BUFFER_LIVE_P (XBUFFER (where
)))
5937 || (FRAMEP (where
) && !FRAME_LIVE_P (XFRAME (where
))))
5938 swap_in_global_binding (ptr
);
5939 mark_object (blv
->where
);
5940 mark_object (blv
->valcell
);
5941 mark_object (blv
->defcell
);
5944 case SYMBOL_FORWARDED
:
5945 /* If the value is forwarded to a buffer or keyboard field,
5946 these are marked when we see the corresponding object.
5947 And if it's forwarded to a C variable, either it's not
5948 a Lisp_Object var, or it's staticpro'd already. */
5950 default: emacs_abort ();
5952 if (!PURE_POINTER_P (XSTRING (ptr
->name
)))
5953 MARK_STRING (XSTRING (ptr
->name
));
5954 MARK_INTERVAL_TREE (string_intervals (ptr
->name
));
5959 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun. */
5960 XSETSYMBOL (obj
, ptrx
);
5967 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5969 if (XMISCANY (obj
)->gcmarkbit
)
5972 switch (XMISCTYPE (obj
))
5974 case Lisp_Misc_Marker
:
5975 /* DO NOT mark thru the marker's chain.
5976 The buffer's markers chain does not preserve markers from gc;
5977 instead, markers are removed from the chain when freed by gc. */
5978 XMISCANY (obj
)->gcmarkbit
= 1;
5981 case Lisp_Misc_Save_Value
:
5982 XMISCANY (obj
)->gcmarkbit
= 1;
5984 struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5985 /* If `save_type' is zero, `data[0].pointer' is the address
5986 of a memory area containing `data[1].integer' potential
5988 if (GC_MARK_STACK
&& ptr
->save_type
== SAVE_TYPE_MEMORY
)
5990 Lisp_Object
*p
= ptr
->data
[0].pointer
;
5992 for (nelt
= ptr
->data
[1].integer
; nelt
> 0; nelt
--, p
++)
5993 mark_maybe_object (*p
);
5997 /* Find Lisp_Objects in `data[N]' slots and mark them. */
5999 for (i
= 0; i
< SAVE_VALUE_SLOTS
; i
++)
6000 if (save_type (ptr
, i
) == SAVE_OBJECT
)
6001 mark_object (ptr
->data
[i
].object
);
6006 case Lisp_Misc_Overlay
:
6007 mark_overlay (XOVERLAY (obj
));
6017 register struct Lisp_Cons
*ptr
= XCONS (obj
);
6018 if (CONS_MARKED_P (ptr
))
6020 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
6022 /* If the cdr is nil, avoid recursion for the car. */
6023 if (EQ (ptr
->u
.cdr
, Qnil
))
6029 mark_object (ptr
->car
);
6032 if (cdr_count
== mark_object_loop_halt
)
6038 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
6039 FLOAT_MARK (XFLOAT (obj
));
6050 #undef CHECK_ALLOCATED
6051 #undef CHECK_ALLOCATED_AND_LIVE
6053 /* Mark the Lisp pointers in the terminal objects.
6054 Called by Fgarbage_collect. */
6057 mark_terminals (void)
6060 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
6062 eassert (t
->name
!= NULL
);
6063 #ifdef HAVE_WINDOW_SYSTEM
6064 /* If a terminal object is reachable from a stacpro'ed object,
6065 it might have been marked already. Make sure the image cache
6067 mark_image_cache (t
->image_cache
);
6068 #endif /* HAVE_WINDOW_SYSTEM */
6069 if (!VECTOR_MARKED_P (t
))
6070 mark_vectorlike ((struct Lisp_Vector
*)t
);
6076 /* Value is non-zero if OBJ will survive the current GC because it's
6077 either marked or does not need to be marked to survive. */
6080 survives_gc_p (Lisp_Object obj
)
6084 switch (XTYPE (obj
))
6091 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
6095 survives_p
= XMISCANY (obj
)->gcmarkbit
;
6099 survives_p
= STRING_MARKED_P (XSTRING (obj
));
6102 case Lisp_Vectorlike
:
6103 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
6107 survives_p
= CONS_MARKED_P (XCONS (obj
));
6111 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
6118 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
6123 /* Sweep: find all structures not marked, and free them. */
6128 /* Remove or mark entries in weak hash tables.
6129 This must be done before any object is unmarked. */
6130 sweep_weak_hash_tables ();
6133 check_string_bytes (!noninteractive
);
6135 /* Put all unmarked conses on free list */
6137 register struct cons_block
*cblk
;
6138 struct cons_block
**cprev
= &cons_block
;
6139 register int lim
= cons_block_index
;
6140 EMACS_INT num_free
= 0, num_used
= 0;
6144 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
6148 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
6150 /* Scan the mark bits an int at a time. */
6151 for (i
= 0; i
< ilim
; i
++)
6153 if (cblk
->gcmarkbits
[i
] == -1)
6155 /* Fast path - all cons cells for this int are marked. */
6156 cblk
->gcmarkbits
[i
] = 0;
6157 num_used
+= BITS_PER_INT
;
6161 /* Some cons cells for this int are not marked.
6162 Find which ones, and free them. */
6163 int start
, pos
, stop
;
6165 start
= i
* BITS_PER_INT
;
6167 if (stop
> BITS_PER_INT
)
6168 stop
= BITS_PER_INT
;
6171 for (pos
= start
; pos
< stop
; pos
++)
6173 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
6176 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
6177 cons_free_list
= &cblk
->conses
[pos
];
6179 cons_free_list
->car
= Vdead
;
6185 CONS_UNMARK (&cblk
->conses
[pos
]);
6191 lim
= CONS_BLOCK_SIZE
;
6192 /* If this block contains only free conses and we have already
6193 seen more than two blocks worth of free conses then deallocate
6195 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
6197 *cprev
= cblk
->next
;
6198 /* Unhook from the free list. */
6199 cons_free_list
= cblk
->conses
[0].u
.chain
;
6200 lisp_align_free (cblk
);
6204 num_free
+= this_free
;
6205 cprev
= &cblk
->next
;
6208 total_conses
= num_used
;
6209 total_free_conses
= num_free
;
6212 /* Put all unmarked floats on free list */
6214 register struct float_block
*fblk
;
6215 struct float_block
**fprev
= &float_block
;
6216 register int lim
= float_block_index
;
6217 EMACS_INT num_free
= 0, num_used
= 0;
6219 float_free_list
= 0;
6221 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
6225 for (i
= 0; i
< lim
; i
++)
6226 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
6229 fblk
->floats
[i
].u
.chain
= float_free_list
;
6230 float_free_list
= &fblk
->floats
[i
];
6235 FLOAT_UNMARK (&fblk
->floats
[i
]);
6237 lim
= FLOAT_BLOCK_SIZE
;
6238 /* If this block contains only free floats and we have already
6239 seen more than two blocks worth of free floats then deallocate
6241 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
6243 *fprev
= fblk
->next
;
6244 /* Unhook from the free list. */
6245 float_free_list
= fblk
->floats
[0].u
.chain
;
6246 lisp_align_free (fblk
);
6250 num_free
+= this_free
;
6251 fprev
= &fblk
->next
;
6254 total_floats
= num_used
;
6255 total_free_floats
= num_free
;
6258 /* Put all unmarked intervals on free list */
6260 register struct interval_block
*iblk
;
6261 struct interval_block
**iprev
= &interval_block
;
6262 register int lim
= interval_block_index
;
6263 EMACS_INT num_free
= 0, num_used
= 0;
6265 interval_free_list
= 0;
6267 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
6272 for (i
= 0; i
< lim
; i
++)
6274 if (!iblk
->intervals
[i
].gcmarkbit
)
6276 set_interval_parent (&iblk
->intervals
[i
], interval_free_list
);
6277 interval_free_list
= &iblk
->intervals
[i
];
6283 iblk
->intervals
[i
].gcmarkbit
= 0;
6286 lim
= INTERVAL_BLOCK_SIZE
;
6287 /* If this block contains only free intervals and we have already
6288 seen more than two blocks worth of free intervals then
6289 deallocate this block. */
6290 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
6292 *iprev
= iblk
->next
;
6293 /* Unhook from the free list. */
6294 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
6299 num_free
+= this_free
;
6300 iprev
= &iblk
->next
;
6303 total_intervals
= num_used
;
6304 total_free_intervals
= num_free
;
6307 /* Put all unmarked symbols on free list */
6309 register struct symbol_block
*sblk
;
6310 struct symbol_block
**sprev
= &symbol_block
;
6311 register int lim
= symbol_block_index
;
6312 EMACS_INT num_free
= 0, num_used
= 0;
6314 symbol_free_list
= NULL
;
6316 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
6319 union aligned_Lisp_Symbol
*sym
= sblk
->symbols
;
6320 union aligned_Lisp_Symbol
*end
= sym
+ lim
;
6322 for (; sym
< end
; ++sym
)
6324 /* Check if the symbol was created during loadup. In such a case
6325 it might be pointed to by pure bytecode which we don't trace,
6326 so we conservatively assume that it is live. */
6327 bool pure_p
= PURE_POINTER_P (XSTRING (sym
->s
.name
));
6329 if (!sym
->s
.gcmarkbit
&& !pure_p
)
6331 if (sym
->s
.redirect
== SYMBOL_LOCALIZED
)
6332 xfree (SYMBOL_BLV (&sym
->s
));
6333 sym
->s
.next
= symbol_free_list
;
6334 symbol_free_list
= &sym
->s
;
6336 symbol_free_list
->function
= Vdead
;
6344 UNMARK_STRING (XSTRING (sym
->s
.name
));
6345 sym
->s
.gcmarkbit
= 0;
6349 lim
= SYMBOL_BLOCK_SIZE
;
6350 /* If this block contains only free symbols and we have already
6351 seen more than two blocks worth of free symbols then deallocate
6353 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6355 *sprev
= sblk
->next
;
6356 /* Unhook from the free list. */
6357 symbol_free_list
= sblk
->symbols
[0].s
.next
;
6362 num_free
+= this_free
;
6363 sprev
= &sblk
->next
;
6366 total_symbols
= num_used
;
6367 total_free_symbols
= num_free
;
6370 /* Put all unmarked misc's on free list.
6371 For a marker, first unchain it from the buffer it points into. */
6373 register struct marker_block
*mblk
;
6374 struct marker_block
**mprev
= &marker_block
;
6375 register int lim
= marker_block_index
;
6376 EMACS_INT num_free
= 0, num_used
= 0;
6378 marker_free_list
= 0;
6380 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6385 for (i
= 0; i
< lim
; i
++)
6387 if (!mblk
->markers
[i
].m
.u_any
.gcmarkbit
)
6389 if (mblk
->markers
[i
].m
.u_any
.type
== Lisp_Misc_Marker
)
6390 unchain_marker (&mblk
->markers
[i
].m
.u_marker
);
6391 /* Set the type of the freed object to Lisp_Misc_Free.
6392 We could leave the type alone, since nobody checks it,
6393 but this might catch bugs faster. */
6394 mblk
->markers
[i
].m
.u_marker
.type
= Lisp_Misc_Free
;
6395 mblk
->markers
[i
].m
.u_free
.chain
= marker_free_list
;
6396 marker_free_list
= &mblk
->markers
[i
].m
;
6402 mblk
->markers
[i
].m
.u_any
.gcmarkbit
= 0;
6405 lim
= MARKER_BLOCK_SIZE
;
6406 /* If this block contains only free markers and we have already
6407 seen more than two blocks worth of free markers then deallocate
6409 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6411 *mprev
= mblk
->next
;
6412 /* Unhook from the free list. */
6413 marker_free_list
= mblk
->markers
[0].m
.u_free
.chain
;
6418 num_free
+= this_free
;
6419 mprev
= &mblk
->next
;
6423 total_markers
= num_used
;
6424 total_free_markers
= num_free
;
6427 /* Free all unmarked buffers */
6429 register struct buffer
*buffer
, **bprev
= &all_buffers
;
6432 for (buffer
= all_buffers
; buffer
; buffer
= *bprev
)
6433 if (!VECTOR_MARKED_P (buffer
))
6435 *bprev
= buffer
->next
;
6440 VECTOR_UNMARK (buffer
);
6441 /* Do not use buffer_(set|get)_intervals here. */
6442 buffer
->text
->intervals
= balance_intervals (buffer
->text
->intervals
);
6444 bprev
= &buffer
->next
;
6449 check_string_bytes (!noninteractive
);
6455 /* Debugging aids. */
6457 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6458 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6459 This may be helpful in debugging Emacs's memory usage.
6460 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6465 XSETINT (end
, (intptr_t) (char *) sbrk (0) / 1024);
6470 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6471 doc
: /* Return a list of counters that measure how much consing there has been.
6472 Each of these counters increments for a certain kind of object.
6473 The counters wrap around from the largest positive integer to zero.
6474 Garbage collection does not decrease them.
6475 The elements of the value are as follows:
6476 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6477 All are in units of 1 = one object consed
6478 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6480 MISCS include overlays, markers, and some internal types.
6481 Frames, windows, buffers, and subprocesses count as vectors
6482 (but the contents of a buffer's text do not count here). */)
6485 return listn (CONSTYPE_HEAP
, 8,
6486 bounded_number (cons_cells_consed
),
6487 bounded_number (floats_consed
),
6488 bounded_number (vector_cells_consed
),
6489 bounded_number (symbols_consed
),
6490 bounded_number (string_chars_consed
),
6491 bounded_number (misc_objects_consed
),
6492 bounded_number (intervals_consed
),
6493 bounded_number (strings_consed
));
6496 /* Find at most FIND_MAX symbols which have OBJ as their value or
6497 function. This is used in gdbinit's `xwhichsymbols' command. */
6500 which_symbols (Lisp_Object obj
, EMACS_INT find_max
)
6502 struct symbol_block
*sblk
;
6503 ptrdiff_t gc_count
= inhibit_garbage_collection ();
6504 Lisp_Object found
= Qnil
;
6508 for (sblk
= symbol_block
; sblk
; sblk
= sblk
->next
)
6510 union aligned_Lisp_Symbol
*aligned_sym
= sblk
->symbols
;
6513 for (bn
= 0; bn
< SYMBOL_BLOCK_SIZE
; bn
++, aligned_sym
++)
6515 struct Lisp_Symbol
*sym
= &aligned_sym
->s
;
6519 if (sblk
== symbol_block
&& bn
>= symbol_block_index
)
6522 XSETSYMBOL (tem
, sym
);
6523 val
= find_symbol_value (tem
);
6525 || EQ (sym
->function
, obj
)
6526 || (!NILP (sym
->function
)
6527 && COMPILEDP (sym
->function
)
6528 && EQ (AREF (sym
->function
, COMPILED_BYTECODE
), obj
))
6531 && EQ (AREF (val
, COMPILED_BYTECODE
), obj
)))
6533 found
= Fcons (tem
, found
);
6534 if (--find_max
== 0)
6542 unbind_to (gc_count
, Qnil
);
6546 #ifdef ENABLE_CHECKING
6548 bool suppress_checking
;
6551 die (const char *msg
, const char *file
, int line
)
6553 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: assertion failed: %s\r\n",
6555 terminate_due_to_signal (SIGABRT
, INT_MAX
);
6559 /* Initialization. */
6562 init_alloc_once (void)
6564 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6566 pure_size
= PURESIZE
;
6568 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6570 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6573 #ifdef DOUG_LEA_MALLOC
6574 mallopt (M_TRIM_THRESHOLD
, 128 * 1024); /* Trim threshold. */
6575 mallopt (M_MMAP_THRESHOLD
, 64 * 1024); /* Mmap threshold. */
6576 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* Max. number of mmap'ed areas. */
6581 refill_memory_reserve ();
6582 gc_cons_threshold
= GC_DEFAULT_THRESHOLD
;
6589 byte_stack_list
= 0;
6591 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6592 setjmp_tested_p
= longjmps_done
= 0;
6595 Vgc_elapsed
= make_float (0.0);
6600 syms_of_alloc (void)
6602 DEFVAR_INT ("gc-cons-threshold", gc_cons_threshold
,
6603 doc
: /* Number of bytes of consing between garbage collections.
6604 Garbage collection can happen automatically once this many bytes have been
6605 allocated since the last garbage collection. All data types count.
6607 Garbage collection happens automatically only when `eval' is called.
6609 By binding this temporarily to a large number, you can effectively
6610 prevent garbage collection during a part of the program.
6611 See also `gc-cons-percentage'. */);
6613 DEFVAR_LISP ("gc-cons-percentage", Vgc_cons_percentage
,
6614 doc
: /* Portion of the heap used for allocation.
6615 Garbage collection can happen automatically once this portion of the heap
6616 has been allocated since the last garbage collection.
6617 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6618 Vgc_cons_percentage
= make_float (0.1);
6620 DEFVAR_INT ("pure-bytes-used", pure_bytes_used
,
6621 doc
: /* Number of bytes of shareable Lisp data allocated so far. */);
6623 DEFVAR_INT ("cons-cells-consed", cons_cells_consed
,
6624 doc
: /* Number of cons cells that have been consed so far. */);
6626 DEFVAR_INT ("floats-consed", floats_consed
,
6627 doc
: /* Number of floats that have been consed so far. */);
6629 DEFVAR_INT ("vector-cells-consed", vector_cells_consed
,
6630 doc
: /* Number of vector cells that have been consed so far. */);
6632 DEFVAR_INT ("symbols-consed", symbols_consed
,
6633 doc
: /* Number of symbols that have been consed so far. */);
6635 DEFVAR_INT ("string-chars-consed", string_chars_consed
,
6636 doc
: /* Number of string characters that have been consed so far. */);
6638 DEFVAR_INT ("misc-objects-consed", misc_objects_consed
,
6639 doc
: /* Number of miscellaneous objects that have been consed so far.
6640 These include markers and overlays, plus certain objects not visible
6643 DEFVAR_INT ("intervals-consed", intervals_consed
,
6644 doc
: /* Number of intervals that have been consed so far. */);
6646 DEFVAR_INT ("strings-consed", strings_consed
,
6647 doc
: /* Number of strings that have been consed so far. */);
6649 DEFVAR_LISP ("purify-flag", Vpurify_flag
,
6650 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6651 This means that certain objects should be allocated in shared (pure) space.
6652 It can also be set to a hash-table, in which case this table is used to
6653 do hash-consing of the objects allocated to pure space. */);
6655 DEFVAR_BOOL ("garbage-collection-messages", garbage_collection_messages
,
6656 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6657 garbage_collection_messages
= 0;
6659 DEFVAR_LISP ("post-gc-hook", Vpost_gc_hook
,
6660 doc
: /* Hook run after garbage collection has finished. */);
6661 Vpost_gc_hook
= Qnil
;
6662 DEFSYM (Qpost_gc_hook
, "post-gc-hook");
6664 DEFVAR_LISP ("memory-signal-data", Vmemory_signal_data
,
6665 doc
: /* Precomputed `signal' argument for memory-full error. */);
6666 /* We build this in advance because if we wait until we need it, we might
6667 not be able to allocate the memory to hold it. */
6669 = listn (CONSTYPE_PURE
, 2, Qerror
,
6670 build_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
6672 DEFVAR_LISP ("memory-full", Vmemory_full
,
6673 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6674 Vmemory_full
= Qnil
;
6676 DEFSYM (Qconses
, "conses");
6677 DEFSYM (Qsymbols
, "symbols");
6678 DEFSYM (Qmiscs
, "miscs");
6679 DEFSYM (Qstrings
, "strings");
6680 DEFSYM (Qvectors
, "vectors");
6681 DEFSYM (Qfloats
, "floats");
6682 DEFSYM (Qintervals
, "intervals");
6683 DEFSYM (Qbuffers
, "buffers");
6684 DEFSYM (Qstring_bytes
, "string-bytes");
6685 DEFSYM (Qvector_slots
, "vector-slots");
6686 DEFSYM (Qheap
, "heap");
6687 DEFSYM (Qautomatic_gc
, "Automatic GC");
6689 DEFSYM (Qgc_cons_threshold
, "gc-cons-threshold");
6690 DEFSYM (Qchar_table_extra_slots
, "char-table-extra-slots");
6692 DEFVAR_LISP ("gc-elapsed", Vgc_elapsed
,
6693 doc
: /* Accumulated time elapsed in garbage collections.
6694 The time is in seconds as a floating point value. */);
6695 DEFVAR_INT ("gcs-done", gcs_done
,
6696 doc
: /* Accumulated number of garbage collections done. */);
6701 defsubr (&Smake_byte_code
);
6702 defsubr (&Smake_list
);
6703 defsubr (&Smake_vector
);
6704 defsubr (&Smake_string
);
6705 defsubr (&Smake_bool_vector
);
6706 defsubr (&Smake_symbol
);
6707 defsubr (&Smake_marker
);
6708 defsubr (&Spurecopy
);
6709 defsubr (&Sgarbage_collect
);
6710 defsubr (&Smemory_limit
);
6711 defsubr (&Smemory_use_counts
);
6713 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6714 defsubr (&Sgc_status
);
6718 /* When compiled with GCC, GDB might say "No enum type named
6719 pvec_type" if we don't have at least one symbol with that type, and
6720 then xbacktrace could fail. Similarly for the other enums and
6721 their values. Some non-GCC compilers don't like these constructs. */
6725 enum CHARTAB_SIZE_BITS CHARTAB_SIZE_BITS
;
6726 enum CHAR_TABLE_STANDARD_SLOTS CHAR_TABLE_STANDARD_SLOTS
;
6727 enum char_bits char_bits
;
6728 enum CHECK_LISP_OBJECT_TYPE CHECK_LISP_OBJECT_TYPE
;
6729 enum DEFAULT_HASH_SIZE DEFAULT_HASH_SIZE
;
6730 enum enum_USE_LSB_TAG enum_USE_LSB_TAG
;
6731 enum FLOAT_TO_STRING_BUFSIZE FLOAT_TO_STRING_BUFSIZE
;
6732 enum Lisp_Bits Lisp_Bits
;
6733 enum Lisp_Compiled Lisp_Compiled
;
6734 enum maxargs maxargs
;
6735 enum MAX_ALLOCA MAX_ALLOCA
;
6736 enum More_Lisp_Bits More_Lisp_Bits
;
6737 enum pvec_type pvec_type
;
6738 } const EXTERNALLY_VISIBLE gdb_make_enums_visible
= {0};
6739 #endif /* __GNUC__ */