1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
3 Copyright (C) 1985-1986, 1988, 1993-1995, 1997-2012
4 Free Software Foundation, Inc.
6 This file is part of GNU Emacs.
8 GNU Emacs is free software: you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation, either version 3 of the License, or
11 (at your option) any later version.
13 GNU Emacs is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>. */
23 #define LISP_INLINE EXTERN_INLINE
26 #include <limits.h> /* For CHAR_BIT. */
28 #ifdef ENABLE_CHECKING
29 #include <signal.h> /* For SIGABRT. */
38 #include "intervals.h"
40 #include "character.h"
45 #include "blockinput.h"
46 #include "termhooks.h" /* For struct terminal. */
50 /* GC_CHECK_MARKED_OBJECTS means do sanity checks on allocated objects.
51 Doable only if GC_MARK_STACK. */
53 # undef GC_CHECK_MARKED_OBJECTS
56 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
57 memory. Can do this only if using gmalloc.c and if not checking
60 #if (defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC \
61 || defined GC_CHECK_MARKED_OBJECTS)
62 #undef GC_MALLOC_CHECK
79 #ifdef DOUG_LEA_MALLOC
83 /* Specify maximum number of areas to mmap. It would be nice to use a
84 value that explicitly means "no limit". */
86 #define MMAP_MAX_AREAS 100000000
88 #endif /* not DOUG_LEA_MALLOC */
90 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
91 to a struct Lisp_String. */
93 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
94 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
95 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
97 #define VECTOR_MARK(V) ((V)->header.size |= ARRAY_MARK_FLAG)
98 #define VECTOR_UNMARK(V) ((V)->header.size &= ~ARRAY_MARK_FLAG)
99 #define VECTOR_MARKED_P(V) (((V)->header.size & ARRAY_MARK_FLAG) != 0)
101 /* Default value of gc_cons_threshold (see below). */
103 #define GC_DEFAULT_THRESHOLD (100000 * word_size)
105 /* Global variables. */
106 struct emacs_globals globals
;
108 /* Number of bytes of consing done since the last gc. */
110 EMACS_INT consing_since_gc
;
112 /* Similar minimum, computed from Vgc_cons_percentage. */
114 EMACS_INT gc_relative_threshold
;
116 /* Minimum number of bytes of consing since GC before next GC,
117 when memory is full. */
119 EMACS_INT memory_full_cons_threshold
;
121 /* True during GC. */
125 /* True means abort if try to GC.
126 This is for code which is written on the assumption that
127 no GC will happen, so as to verify that assumption. */
131 /* Number of live and free conses etc. */
133 static EMACS_INT total_conses
, total_markers
, total_symbols
, total_buffers
;
134 static EMACS_INT total_free_conses
, total_free_markers
, total_free_symbols
;
135 static EMACS_INT total_free_floats
, total_floats
;
137 /* Points to memory space allocated as "spare", to be freed if we run
138 out of memory. We keep one large block, four cons-blocks, and
139 two string blocks. */
141 static char *spare_memory
[7];
143 /* Amount of spare memory to keep in large reserve block, or to see
144 whether this much is available when malloc fails on a larger request. */
146 #define SPARE_MEMORY (1 << 14)
148 /* Initialize it to a nonzero value to force it into data space
149 (rather than bss space). That way unexec will remap it into text
150 space (pure), on some systems. We have not implemented the
151 remapping on more recent systems because this is less important
152 nowadays than in the days of small memories and timesharing. */
154 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
155 #define PUREBEG (char *) pure
157 /* Pointer to the pure area, and its size. */
159 static char *purebeg
;
160 static ptrdiff_t pure_size
;
162 /* Number of bytes of pure storage used before pure storage overflowed.
163 If this is non-zero, this implies that an overflow occurred. */
165 static ptrdiff_t pure_bytes_used_before_overflow
;
167 /* True if P points into pure space. */
169 #define PURE_POINTER_P(P) \
170 ((uintptr_t) (P) - (uintptr_t) purebeg <= pure_size)
172 /* Index in pure at which next pure Lisp object will be allocated.. */
174 static ptrdiff_t pure_bytes_used_lisp
;
176 /* Number of bytes allocated for non-Lisp objects in pure storage. */
178 static ptrdiff_t pure_bytes_used_non_lisp
;
180 /* If nonzero, this is a warning delivered by malloc and not yet
183 const char *pending_malloc_warning
;
185 /* Maximum amount of C stack to save when a GC happens. */
187 #ifndef MAX_SAVE_STACK
188 #define MAX_SAVE_STACK 16000
191 /* Buffer in which we save a copy of the C stack at each GC. */
193 #if MAX_SAVE_STACK > 0
194 static char *stack_copy
;
195 static ptrdiff_t stack_copy_size
;
198 static Lisp_Object Qconses
;
199 static Lisp_Object Qsymbols
;
200 static Lisp_Object Qmiscs
;
201 static Lisp_Object Qstrings
;
202 static Lisp_Object Qvectors
;
203 static Lisp_Object Qfloats
;
204 static Lisp_Object Qintervals
;
205 static Lisp_Object Qbuffers
;
206 static Lisp_Object Qstring_bytes
, Qvector_slots
, Qheap
;
207 static Lisp_Object Qgc_cons_threshold
;
208 Lisp_Object Qautomatic_gc
;
209 Lisp_Object Qchar_table_extra_slots
;
211 /* Hook run after GC has finished. */
213 static Lisp_Object Qpost_gc_hook
;
215 static void mark_terminals (void);
216 static void gc_sweep (void);
217 static Lisp_Object
make_pure_vector (ptrdiff_t);
218 static void mark_glyph_matrix (struct glyph_matrix
*);
219 static void mark_face_cache (struct face_cache
*);
220 static void mark_buffer (struct buffer
*);
222 #if !defined REL_ALLOC || defined SYSTEM_MALLOC
223 static void refill_memory_reserve (void);
225 static struct Lisp_String
*allocate_string (void);
226 static void compact_small_strings (void);
227 static void free_large_strings (void);
228 static void sweep_strings (void);
229 static void free_misc (Lisp_Object
);
230 extern Lisp_Object
which_symbols (Lisp_Object
, EMACS_INT
) EXTERNALLY_VISIBLE
;
232 /* When scanning the C stack for live Lisp objects, Emacs keeps track
233 of what memory allocated via lisp_malloc is intended for what
234 purpose. This enumeration specifies the type of memory. */
245 /* We used to keep separate mem_types for subtypes of vectors such as
246 process, hash_table, frame, terminal, and window, but we never made
247 use of the distinction, so it only caused source-code complexity
248 and runtime slowdown. Minor but pointless. */
250 /* Special type to denote vector blocks. */
251 MEM_TYPE_VECTOR_BLOCK
,
252 /* Special type to denote reserved memory. */
256 static void *lisp_malloc (size_t, enum mem_type
);
259 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
261 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
262 #include <stdio.h> /* For fprintf. */
265 /* A unique object in pure space used to make some Lisp objects
266 on free lists recognizable in O(1). */
268 static Lisp_Object Vdead
;
269 #define DEADP(x) EQ (x, Vdead)
271 #ifdef GC_MALLOC_CHECK
273 enum mem_type allocated_mem_type
;
275 #endif /* GC_MALLOC_CHECK */
277 /* A node in the red-black tree describing allocated memory containing
278 Lisp data. Each such block is recorded with its start and end
279 address when it is allocated, and removed from the tree when it
282 A red-black tree is a balanced binary tree with the following
285 1. Every node is either red or black.
286 2. Every leaf is black.
287 3. If a node is red, then both of its children are black.
288 4. Every simple path from a node to a descendant leaf contains
289 the same number of black nodes.
290 5. The root is always black.
292 When nodes are inserted into the tree, or deleted from the tree,
293 the tree is "fixed" so that these properties are always true.
295 A red-black tree with N internal nodes has height at most 2
296 log(N+1). Searches, insertions and deletions are done in O(log N).
297 Please see a text book about data structures for a detailed
298 description of red-black trees. Any book worth its salt should
303 /* Children of this node. These pointers are never NULL. When there
304 is no child, the value is MEM_NIL, which points to a dummy node. */
305 struct mem_node
*left
, *right
;
307 /* The parent of this node. In the root node, this is NULL. */
308 struct mem_node
*parent
;
310 /* Start and end of allocated region. */
314 enum {MEM_BLACK
, MEM_RED
} color
;
320 /* Base address of stack. Set in main. */
322 Lisp_Object
*stack_base
;
324 /* Root of the tree describing allocated Lisp memory. */
326 static struct mem_node
*mem_root
;
328 /* Lowest and highest known address in the heap. */
330 static void *min_heap_address
, *max_heap_address
;
332 /* Sentinel node of the tree. */
334 static struct mem_node mem_z
;
335 #define MEM_NIL &mem_z
337 static struct Lisp_Vector
*allocate_vectorlike (ptrdiff_t);
338 static void lisp_free (void *);
339 static void mark_stack (void);
340 static bool live_vector_p (struct mem_node
*, void *);
341 static bool live_buffer_p (struct mem_node
*, void *);
342 static bool live_string_p (struct mem_node
*, void *);
343 static bool live_cons_p (struct mem_node
*, void *);
344 static bool live_symbol_p (struct mem_node
*, void *);
345 static bool live_float_p (struct mem_node
*, void *);
346 static bool live_misc_p (struct mem_node
*, void *);
347 static void mark_maybe_object (Lisp_Object
);
348 static void mark_memory (void *, void *);
349 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
350 static void mem_init (void);
351 static struct mem_node
*mem_insert (void *, void *, enum mem_type
);
352 static void mem_insert_fixup (struct mem_node
*);
353 static void mem_rotate_left (struct mem_node
*);
354 static void mem_rotate_right (struct mem_node
*);
355 static void mem_delete (struct mem_node
*);
356 static void mem_delete_fixup (struct mem_node
*);
357 static inline struct mem_node
*mem_find (void *);
361 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
362 static void check_gcpros (void);
365 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
371 /* Recording what needs to be marked for gc. */
373 struct gcpro
*gcprolist
;
375 /* Addresses of staticpro'd variables. Initialize it to a nonzero
376 value; otherwise some compilers put it into BSS. */
378 #define NSTATICS 0x650
379 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
381 /* Index of next unused slot in staticvec. */
383 static int staticidx
;
385 static void *pure_alloc (size_t, int);
388 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
389 ALIGNMENT must be a power of 2. */
391 #define ALIGN(ptr, ALIGNMENT) \
392 ((void *) (((uintptr_t) (ptr) + (ALIGNMENT) - 1) \
393 & ~ ((ALIGNMENT) - 1)))
397 /************************************************************************
399 ************************************************************************/
401 /* Function malloc calls this if it finds we are near exhausting storage. */
404 malloc_warning (const char *str
)
406 pending_malloc_warning
= str
;
410 /* Display an already-pending malloc warning. */
413 display_malloc_warning (void)
415 call3 (intern ("display-warning"),
417 build_string (pending_malloc_warning
),
418 intern ("emergency"));
419 pending_malloc_warning
= 0;
422 /* Called if we can't allocate relocatable space for a buffer. */
425 buffer_memory_full (ptrdiff_t nbytes
)
427 /* If buffers use the relocating allocator, no need to free
428 spare_memory, because we may have plenty of malloc space left
429 that we could get, and if we don't, the malloc that fails will
430 itself cause spare_memory to be freed. If buffers don't use the
431 relocating allocator, treat this like any other failing
435 memory_full (nbytes
);
438 /* This used to call error, but if we've run out of memory, we could
439 get infinite recursion trying to build the string. */
440 xsignal (Qnil
, Vmemory_signal_data
);
443 /* A common multiple of the positive integers A and B. Ideally this
444 would be the least common multiple, but there's no way to do that
445 as a constant expression in C, so do the best that we can easily do. */
446 #define COMMON_MULTIPLE(a, b) \
447 ((a) % (b) == 0 ? (a) : (b) % (a) == 0 ? (b) : (a) * (b))
449 #ifndef XMALLOC_OVERRUN_CHECK
450 #define XMALLOC_OVERRUN_CHECK_OVERHEAD 0
453 /* Check for overrun in malloc'ed buffers by wrapping a header and trailer
456 The header consists of XMALLOC_OVERRUN_CHECK_SIZE fixed bytes
457 followed by XMALLOC_OVERRUN_SIZE_SIZE bytes containing the original
458 block size in little-endian order. The trailer consists of
459 XMALLOC_OVERRUN_CHECK_SIZE fixed bytes.
461 The header is used to detect whether this block has been allocated
462 through these functions, as some low-level libc functions may
463 bypass the malloc hooks. */
465 #define XMALLOC_OVERRUN_CHECK_SIZE 16
466 #define XMALLOC_OVERRUN_CHECK_OVERHEAD \
467 (2 * XMALLOC_OVERRUN_CHECK_SIZE + XMALLOC_OVERRUN_SIZE_SIZE)
469 /* Define XMALLOC_OVERRUN_SIZE_SIZE so that (1) it's large enough to
470 hold a size_t value and (2) the header size is a multiple of the
471 alignment that Emacs needs for C types and for USE_LSB_TAG. */
472 #define XMALLOC_BASE_ALIGNMENT \
473 alignof (union { long double d; intmax_t i; void *p; })
476 # define XMALLOC_HEADER_ALIGNMENT \
477 COMMON_MULTIPLE (GCALIGNMENT, XMALLOC_BASE_ALIGNMENT)
479 # define XMALLOC_HEADER_ALIGNMENT XMALLOC_BASE_ALIGNMENT
481 #define XMALLOC_OVERRUN_SIZE_SIZE \
482 (((XMALLOC_OVERRUN_CHECK_SIZE + sizeof (size_t) \
483 + XMALLOC_HEADER_ALIGNMENT - 1) \
484 / XMALLOC_HEADER_ALIGNMENT * XMALLOC_HEADER_ALIGNMENT) \
485 - XMALLOC_OVERRUN_CHECK_SIZE)
487 static char const xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
] =
488 { '\x9a', '\x9b', '\xae', '\xaf',
489 '\xbf', '\xbe', '\xce', '\xcf',
490 '\xea', '\xeb', '\xec', '\xed',
491 '\xdf', '\xde', '\x9c', '\x9d' };
493 static char const xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
494 { '\xaa', '\xab', '\xac', '\xad',
495 '\xba', '\xbb', '\xbc', '\xbd',
496 '\xca', '\xcb', '\xcc', '\xcd',
497 '\xda', '\xdb', '\xdc', '\xdd' };
499 /* Insert and extract the block size in the header. */
502 xmalloc_put_size (unsigned char *ptr
, size_t size
)
505 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
507 *--ptr
= size
& ((1 << CHAR_BIT
) - 1);
513 xmalloc_get_size (unsigned char *ptr
)
517 ptr
-= XMALLOC_OVERRUN_SIZE_SIZE
;
518 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
527 /* Like malloc, but wraps allocated block with header and trailer. */
530 overrun_check_malloc (size_t size
)
532 register unsigned char *val
;
533 if (SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
< size
)
536 val
= malloc (size
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
539 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
540 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
541 xmalloc_put_size (val
, size
);
542 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
543 XMALLOC_OVERRUN_CHECK_SIZE
);
549 /* Like realloc, but checks old block for overrun, and wraps new block
550 with header and trailer. */
553 overrun_check_realloc (void *block
, size_t size
)
555 register unsigned char *val
= (unsigned char *) block
;
556 if (SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
< size
)
560 && memcmp (xmalloc_overrun_check_header
,
561 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
562 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
564 size_t osize
= xmalloc_get_size (val
);
565 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
566 XMALLOC_OVERRUN_CHECK_SIZE
))
568 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
569 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
570 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
573 val
= realloc (val
, size
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
577 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
578 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
579 xmalloc_put_size (val
, size
);
580 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
581 XMALLOC_OVERRUN_CHECK_SIZE
);
586 /* Like free, but checks block for overrun. */
589 overrun_check_free (void *block
)
591 unsigned char *val
= (unsigned char *) block
;
594 && memcmp (xmalloc_overrun_check_header
,
595 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
596 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
598 size_t osize
= xmalloc_get_size (val
);
599 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
600 XMALLOC_OVERRUN_CHECK_SIZE
))
602 #ifdef XMALLOC_CLEAR_FREE_MEMORY
603 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
604 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
606 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
607 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
608 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
618 #define malloc overrun_check_malloc
619 #define realloc overrun_check_realloc
620 #define free overrun_check_free
623 /* If compiled with XMALLOC_BLOCK_INPUT_CHECK, define a symbol
624 BLOCK_INPUT_IN_MEMORY_ALLOCATORS that is visible to the debugger.
625 If that variable is set, block input while in one of Emacs's memory
626 allocation functions. There should be no need for this debugging
627 option, since signal handlers do not allocate memory, but Emacs
628 formerly allocated memory in signal handlers and this compile-time
629 option remains as a way to help debug the issue should it rear its
631 #ifdef XMALLOC_BLOCK_INPUT_CHECK
632 bool block_input_in_memory_allocators EXTERNALLY_VISIBLE
;
634 malloc_block_input (void)
636 if (block_input_in_memory_allocators
)
640 malloc_unblock_input (void)
642 if (block_input_in_memory_allocators
)
645 # define MALLOC_BLOCK_INPUT malloc_block_input ()
646 # define MALLOC_UNBLOCK_INPUT malloc_unblock_input ()
648 # define MALLOC_BLOCK_INPUT ((void) 0)
649 # define MALLOC_UNBLOCK_INPUT ((void) 0)
652 #define MALLOC_PROBE(size) \
654 if (profiler_memory_running) \
655 malloc_probe (size); \
659 /* Like malloc but check for no memory and block interrupt input.. */
662 xmalloc (size_t size
)
668 MALLOC_UNBLOCK_INPUT
;
676 /* Like the above, but zeroes out the memory just allocated. */
679 xzalloc (size_t size
)
685 MALLOC_UNBLOCK_INPUT
;
689 memset (val
, 0, size
);
694 /* Like realloc but check for no memory and block interrupt input.. */
697 xrealloc (void *block
, size_t size
)
702 /* We must call malloc explicitly when BLOCK is 0, since some
703 reallocs don't do this. */
707 val
= realloc (block
, size
);
708 MALLOC_UNBLOCK_INPUT
;
717 /* Like free but block interrupt input. */
726 MALLOC_UNBLOCK_INPUT
;
727 /* We don't call refill_memory_reserve here
728 because in practice the call in r_alloc_free seems to suffice. */
732 /* Other parts of Emacs pass large int values to allocator functions
733 expecting ptrdiff_t. This is portable in practice, but check it to
735 verify (INT_MAX
<= PTRDIFF_MAX
);
738 /* Allocate an array of NITEMS items, each of size ITEM_SIZE.
739 Signal an error on memory exhaustion, and block interrupt input. */
742 xnmalloc (ptrdiff_t nitems
, ptrdiff_t item_size
)
744 eassert (0 <= nitems
&& 0 < item_size
);
745 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
746 memory_full (SIZE_MAX
);
747 return xmalloc (nitems
* item_size
);
751 /* Reallocate an array PA to make it of NITEMS items, each of size ITEM_SIZE.
752 Signal an error on memory exhaustion, and block interrupt input. */
755 xnrealloc (void *pa
, ptrdiff_t nitems
, ptrdiff_t item_size
)
757 eassert (0 <= nitems
&& 0 < item_size
);
758 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
759 memory_full (SIZE_MAX
);
760 return xrealloc (pa
, nitems
* item_size
);
764 /* Grow PA, which points to an array of *NITEMS items, and return the
765 location of the reallocated array, updating *NITEMS to reflect its
766 new size. The new array will contain at least NITEMS_INCR_MIN more
767 items, but will not contain more than NITEMS_MAX items total.
768 ITEM_SIZE is the size of each item, in bytes.
770 ITEM_SIZE and NITEMS_INCR_MIN must be positive. *NITEMS must be
771 nonnegative. If NITEMS_MAX is -1, it is treated as if it were
774 If PA is null, then allocate a new array instead of reallocating
775 the old one. Thus, to grow an array A without saving its old
776 contents, invoke xfree (A) immediately followed by xgrowalloc (0,
779 Block interrupt input as needed. If memory exhaustion occurs, set
780 *NITEMS to zero if PA is null, and signal an error (i.e., do not
784 xpalloc (void *pa
, ptrdiff_t *nitems
, ptrdiff_t nitems_incr_min
,
785 ptrdiff_t nitems_max
, ptrdiff_t item_size
)
787 /* The approximate size to use for initial small allocation
788 requests. This is the largest "small" request for the GNU C
790 enum { DEFAULT_MXFAST
= 64 * sizeof (size_t) / 4 };
792 /* If the array is tiny, grow it to about (but no greater than)
793 DEFAULT_MXFAST bytes. Otherwise, grow it by about 50%. */
794 ptrdiff_t n
= *nitems
;
795 ptrdiff_t tiny_max
= DEFAULT_MXFAST
/ item_size
- n
;
796 ptrdiff_t half_again
= n
>> 1;
797 ptrdiff_t incr_estimate
= max (tiny_max
, half_again
);
799 /* Adjust the increment according to three constraints: NITEMS_INCR_MIN,
800 NITEMS_MAX, and what the C language can represent safely. */
801 ptrdiff_t C_language_max
= min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
;
802 ptrdiff_t n_max
= (0 <= nitems_max
&& nitems_max
< C_language_max
803 ? nitems_max
: C_language_max
);
804 ptrdiff_t nitems_incr_max
= n_max
- n
;
805 ptrdiff_t incr
= max (nitems_incr_min
, min (incr_estimate
, nitems_incr_max
));
807 eassert (0 < item_size
&& 0 < nitems_incr_min
&& 0 <= n
&& -1 <= nitems_max
);
810 if (nitems_incr_max
< incr
)
811 memory_full (SIZE_MAX
);
813 pa
= xrealloc (pa
, n
* item_size
);
819 /* Like strdup, but uses xmalloc. */
822 xstrdup (const char *s
)
824 size_t len
= strlen (s
) + 1;
825 char *p
= xmalloc (len
);
831 /* Unwind for SAFE_ALLOCA */
834 safe_alloca_unwind (Lisp_Object arg
)
836 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
845 /* Return a newly allocated memory block of SIZE bytes, remembering
846 to free it when unwinding. */
848 record_xmalloc (size_t size
)
850 void *p
= xmalloc (size
);
851 record_unwind_protect (safe_alloca_unwind
, make_save_value (p
, 0));
856 /* Like malloc but used for allocating Lisp data. NBYTES is the
857 number of bytes to allocate, TYPE describes the intended use of the
858 allocated memory block (for strings, for conses, ...). */
861 void *lisp_malloc_loser EXTERNALLY_VISIBLE
;
865 lisp_malloc (size_t nbytes
, enum mem_type type
)
871 #ifdef GC_MALLOC_CHECK
872 allocated_mem_type
= type
;
875 val
= malloc (nbytes
);
878 /* If the memory just allocated cannot be addressed thru a Lisp
879 object's pointer, and it needs to be,
880 that's equivalent to running out of memory. */
881 if (val
&& type
!= MEM_TYPE_NON_LISP
)
884 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
885 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
887 lisp_malloc_loser
= val
;
894 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
895 if (val
&& type
!= MEM_TYPE_NON_LISP
)
896 mem_insert (val
, (char *) val
+ nbytes
, type
);
899 MALLOC_UNBLOCK_INPUT
;
901 memory_full (nbytes
);
902 MALLOC_PROBE (nbytes
);
906 /* Free BLOCK. This must be called to free memory allocated with a
907 call to lisp_malloc. */
910 lisp_free (void *block
)
914 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
915 mem_delete (mem_find (block
));
917 MALLOC_UNBLOCK_INPUT
;
920 /***** Allocation of aligned blocks of memory to store Lisp data. *****/
922 /* The entry point is lisp_align_malloc which returns blocks of at most
923 BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
925 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
926 #define USE_POSIX_MEMALIGN 1
929 /* BLOCK_ALIGN has to be a power of 2. */
930 #define BLOCK_ALIGN (1 << 10)
932 /* Padding to leave at the end of a malloc'd block. This is to give
933 malloc a chance to minimize the amount of memory wasted to alignment.
934 It should be tuned to the particular malloc library used.
935 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
936 posix_memalign on the other hand would ideally prefer a value of 4
937 because otherwise, there's 1020 bytes wasted between each ablocks.
938 In Emacs, testing shows that those 1020 can most of the time be
939 efficiently used by malloc to place other objects, so a value of 0 can
940 still preferable unless you have a lot of aligned blocks and virtually
942 #define BLOCK_PADDING 0
943 #define BLOCK_BYTES \
944 (BLOCK_ALIGN - sizeof (struct ablocks *) - BLOCK_PADDING)
946 /* Internal data structures and constants. */
948 #define ABLOCKS_SIZE 16
950 /* An aligned block of memory. */
955 char payload
[BLOCK_BYTES
];
956 struct ablock
*next_free
;
958 /* `abase' is the aligned base of the ablocks. */
959 /* It is overloaded to hold the virtual `busy' field that counts
960 the number of used ablock in the parent ablocks.
961 The first ablock has the `busy' field, the others have the `abase'
962 field. To tell the difference, we assume that pointers will have
963 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
964 is used to tell whether the real base of the parent ablocks is `abase'
965 (if not, the word before the first ablock holds a pointer to the
967 struct ablocks
*abase
;
968 /* The padding of all but the last ablock is unused. The padding of
969 the last ablock in an ablocks is not allocated. */
971 char padding
[BLOCK_PADDING
];
975 /* A bunch of consecutive aligned blocks. */
978 struct ablock blocks
[ABLOCKS_SIZE
];
981 /* Size of the block requested from malloc or posix_memalign. */
982 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
984 #define ABLOCK_ABASE(block) \
985 (((uintptr_t) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
986 ? (struct ablocks *)(block) \
989 /* Virtual `busy' field. */
990 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
992 /* Pointer to the (not necessarily aligned) malloc block. */
993 #ifdef USE_POSIX_MEMALIGN
994 #define ABLOCKS_BASE(abase) (abase)
996 #define ABLOCKS_BASE(abase) \
997 (1 & (intptr_t) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
1000 /* The list of free ablock. */
1001 static struct ablock
*free_ablock
;
1003 /* Allocate an aligned block of nbytes.
1004 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
1005 smaller or equal to BLOCK_BYTES. */
1007 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
1010 struct ablocks
*abase
;
1012 eassert (nbytes
<= BLOCK_BYTES
);
1016 #ifdef GC_MALLOC_CHECK
1017 allocated_mem_type
= type
;
1023 intptr_t aligned
; /* int gets warning casting to 64-bit pointer. */
1025 #ifdef DOUG_LEA_MALLOC
1026 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1027 because mapped region contents are not preserved in
1029 mallopt (M_MMAP_MAX
, 0);
1032 #ifdef USE_POSIX_MEMALIGN
1034 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1040 base
= malloc (ABLOCKS_BYTES
);
1041 abase
= ALIGN (base
, BLOCK_ALIGN
);
1046 MALLOC_UNBLOCK_INPUT
;
1047 memory_full (ABLOCKS_BYTES
);
1050 aligned
= (base
== abase
);
1052 ((void**)abase
)[-1] = base
;
1054 #ifdef DOUG_LEA_MALLOC
1055 /* Back to a reasonable maximum of mmap'ed areas. */
1056 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1060 /* If the memory just allocated cannot be addressed thru a Lisp
1061 object's pointer, and it needs to be, that's equivalent to
1062 running out of memory. */
1063 if (type
!= MEM_TYPE_NON_LISP
)
1066 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1067 XSETCONS (tem
, end
);
1068 if ((char *) XCONS (tem
) != end
)
1070 lisp_malloc_loser
= base
;
1072 MALLOC_UNBLOCK_INPUT
;
1073 memory_full (SIZE_MAX
);
1078 /* Initialize the blocks and put them on the free list.
1079 If `base' was not properly aligned, we can't use the last block. */
1080 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1082 abase
->blocks
[i
].abase
= abase
;
1083 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1084 free_ablock
= &abase
->blocks
[i
];
1086 ABLOCKS_BUSY (abase
) = (struct ablocks
*) aligned
;
1088 eassert (0 == ((uintptr_t) abase
) % BLOCK_ALIGN
);
1089 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1090 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1091 eassert (ABLOCKS_BASE (abase
) == base
);
1092 eassert (aligned
== (intptr_t) ABLOCKS_BUSY (abase
));
1095 abase
= ABLOCK_ABASE (free_ablock
);
1096 ABLOCKS_BUSY (abase
) =
1097 (struct ablocks
*) (2 + (intptr_t) ABLOCKS_BUSY (abase
));
1099 free_ablock
= free_ablock
->x
.next_free
;
1101 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1102 if (type
!= MEM_TYPE_NON_LISP
)
1103 mem_insert (val
, (char *) val
+ nbytes
, type
);
1106 MALLOC_UNBLOCK_INPUT
;
1108 MALLOC_PROBE (nbytes
);
1110 eassert (0 == ((uintptr_t) val
) % BLOCK_ALIGN
);
1115 lisp_align_free (void *block
)
1117 struct ablock
*ablock
= block
;
1118 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1121 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1122 mem_delete (mem_find (block
));
1124 /* Put on free list. */
1125 ablock
->x
.next_free
= free_ablock
;
1126 free_ablock
= ablock
;
1127 /* Update busy count. */
1128 ABLOCKS_BUSY (abase
)
1129 = (struct ablocks
*) (-2 + (intptr_t) ABLOCKS_BUSY (abase
));
1131 if (2 > (intptr_t) ABLOCKS_BUSY (abase
))
1132 { /* All the blocks are free. */
1133 int i
= 0, aligned
= (intptr_t) ABLOCKS_BUSY (abase
);
1134 struct ablock
**tem
= &free_ablock
;
1135 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1139 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1142 *tem
= (*tem
)->x
.next_free
;
1145 tem
= &(*tem
)->x
.next_free
;
1147 eassert ((aligned
& 1) == aligned
);
1148 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1149 #ifdef USE_POSIX_MEMALIGN
1150 eassert ((uintptr_t) ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1152 free (ABLOCKS_BASE (abase
));
1154 MALLOC_UNBLOCK_INPUT
;
1158 /***********************************************************************
1160 ***********************************************************************/
1162 /* Number of intervals allocated in an interval_block structure.
1163 The 1020 is 1024 minus malloc overhead. */
1165 #define INTERVAL_BLOCK_SIZE \
1166 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1168 /* Intervals are allocated in chunks in form of an interval_block
1171 struct interval_block
1173 /* Place `intervals' first, to preserve alignment. */
1174 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1175 struct interval_block
*next
;
1178 /* Current interval block. Its `next' pointer points to older
1181 static struct interval_block
*interval_block
;
1183 /* Index in interval_block above of the next unused interval
1186 static int interval_block_index
= INTERVAL_BLOCK_SIZE
;
1188 /* Number of free and live intervals. */
1190 static EMACS_INT total_free_intervals
, total_intervals
;
1192 /* List of free intervals. */
1194 static INTERVAL interval_free_list
;
1196 /* Return a new interval. */
1199 make_interval (void)
1205 if (interval_free_list
)
1207 val
= interval_free_list
;
1208 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1212 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1214 struct interval_block
*newi
1215 = lisp_malloc (sizeof *newi
, MEM_TYPE_NON_LISP
);
1217 newi
->next
= interval_block
;
1218 interval_block
= newi
;
1219 interval_block_index
= 0;
1220 total_free_intervals
+= INTERVAL_BLOCK_SIZE
;
1222 val
= &interval_block
->intervals
[interval_block_index
++];
1225 MALLOC_UNBLOCK_INPUT
;
1227 consing_since_gc
+= sizeof (struct interval
);
1229 total_free_intervals
--;
1230 RESET_INTERVAL (val
);
1236 /* Mark Lisp objects in interval I. */
1239 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1241 /* Intervals should never be shared. So, if extra internal checking is
1242 enabled, GC aborts if it seems to have visited an interval twice. */
1243 eassert (!i
->gcmarkbit
);
1245 mark_object (i
->plist
);
1248 /* Mark the interval tree rooted in I. */
1250 #define MARK_INTERVAL_TREE(i) \
1252 if (i && !i->gcmarkbit) \
1253 traverse_intervals_noorder (i, mark_interval, Qnil); \
1256 /***********************************************************************
1258 ***********************************************************************/
1260 /* Lisp_Strings are allocated in string_block structures. When a new
1261 string_block is allocated, all the Lisp_Strings it contains are
1262 added to a free-list string_free_list. When a new Lisp_String is
1263 needed, it is taken from that list. During the sweep phase of GC,
1264 string_blocks that are entirely free are freed, except two which
1267 String data is allocated from sblock structures. Strings larger
1268 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1269 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1271 Sblocks consist internally of sdata structures, one for each
1272 Lisp_String. The sdata structure points to the Lisp_String it
1273 belongs to. The Lisp_String points back to the `u.data' member of
1274 its sdata structure.
1276 When a Lisp_String is freed during GC, it is put back on
1277 string_free_list, and its `data' member and its sdata's `string'
1278 pointer is set to null. The size of the string is recorded in the
1279 `u.nbytes' member of the sdata. So, sdata structures that are no
1280 longer used, can be easily recognized, and it's easy to compact the
1281 sblocks of small strings which we do in compact_small_strings. */
1283 /* Size in bytes of an sblock structure used for small strings. This
1284 is 8192 minus malloc overhead. */
1286 #define SBLOCK_SIZE 8188
1288 /* Strings larger than this are considered large strings. String data
1289 for large strings is allocated from individual sblocks. */
1291 #define LARGE_STRING_BYTES 1024
1293 /* Structure describing string memory sub-allocated from an sblock.
1294 This is where the contents of Lisp strings are stored. */
1298 /* Back-pointer to the string this sdata belongs to. If null, this
1299 structure is free, and the NBYTES member of the union below
1300 contains the string's byte size (the same value that STRING_BYTES
1301 would return if STRING were non-null). If non-null, STRING_BYTES
1302 (STRING) is the size of the data, and DATA contains the string's
1304 struct Lisp_String
*string
;
1306 #ifdef GC_CHECK_STRING_BYTES
1309 unsigned char data
[1];
1311 #define SDATA_NBYTES(S) (S)->nbytes
1312 #define SDATA_DATA(S) (S)->data
1313 #define SDATA_SELECTOR(member) member
1315 #else /* not GC_CHECK_STRING_BYTES */
1319 /* When STRING is non-null. */
1320 unsigned char data
[1];
1322 /* When STRING is null. */
1326 #define SDATA_NBYTES(S) (S)->u.nbytes
1327 #define SDATA_DATA(S) (S)->u.data
1328 #define SDATA_SELECTOR(member) u.member
1330 #endif /* not GC_CHECK_STRING_BYTES */
1332 #define SDATA_DATA_OFFSET offsetof (struct sdata, SDATA_SELECTOR (data))
1336 /* Structure describing a block of memory which is sub-allocated to
1337 obtain string data memory for strings. Blocks for small strings
1338 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1339 as large as needed. */
1344 struct sblock
*next
;
1346 /* Pointer to the next free sdata block. This points past the end
1347 of the sblock if there isn't any space left in this block. */
1348 struct sdata
*next_free
;
1350 /* Start of data. */
1351 struct sdata first_data
;
1354 /* Number of Lisp strings in a string_block structure. The 1020 is
1355 1024 minus malloc overhead. */
1357 #define STRING_BLOCK_SIZE \
1358 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1360 /* Structure describing a block from which Lisp_String structures
1365 /* Place `strings' first, to preserve alignment. */
1366 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1367 struct string_block
*next
;
1370 /* Head and tail of the list of sblock structures holding Lisp string
1371 data. We always allocate from current_sblock. The NEXT pointers
1372 in the sblock structures go from oldest_sblock to current_sblock. */
1374 static struct sblock
*oldest_sblock
, *current_sblock
;
1376 /* List of sblocks for large strings. */
1378 static struct sblock
*large_sblocks
;
1380 /* List of string_block structures. */
1382 static struct string_block
*string_blocks
;
1384 /* Free-list of Lisp_Strings. */
1386 static struct Lisp_String
*string_free_list
;
1388 /* Number of live and free Lisp_Strings. */
1390 static EMACS_INT total_strings
, total_free_strings
;
1392 /* Number of bytes used by live strings. */
1394 static EMACS_INT total_string_bytes
;
1396 /* Given a pointer to a Lisp_String S which is on the free-list
1397 string_free_list, return a pointer to its successor in the
1400 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1402 /* Return a pointer to the sdata structure belonging to Lisp string S.
1403 S must be live, i.e. S->data must not be null. S->data is actually
1404 a pointer to the `u.data' member of its sdata structure; the
1405 structure starts at a constant offset in front of that. */
1407 #define SDATA_OF_STRING(S) ((struct sdata *) ((S)->data - SDATA_DATA_OFFSET))
1410 #ifdef GC_CHECK_STRING_OVERRUN
1412 /* We check for overrun in string data blocks by appending a small
1413 "cookie" after each allocated string data block, and check for the
1414 presence of this cookie during GC. */
1416 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1417 static char const string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1418 { '\xde', '\xad', '\xbe', '\xef' };
1421 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1424 /* Value is the size of an sdata structure large enough to hold NBYTES
1425 bytes of string data. The value returned includes a terminating
1426 NUL byte, the size of the sdata structure, and padding. */
1428 #ifdef GC_CHECK_STRING_BYTES
1430 #define SDATA_SIZE(NBYTES) \
1431 ((SDATA_DATA_OFFSET \
1433 + sizeof (ptrdiff_t) - 1) \
1434 & ~(sizeof (ptrdiff_t) - 1))
1436 #else /* not GC_CHECK_STRING_BYTES */
1438 /* The 'max' reserves space for the nbytes union member even when NBYTES + 1 is
1439 less than the size of that member. The 'max' is not needed when
1440 SDATA_DATA_OFFSET is a multiple of sizeof (ptrdiff_t), because then the
1441 alignment code reserves enough space. */
1443 #define SDATA_SIZE(NBYTES) \
1444 ((SDATA_DATA_OFFSET \
1445 + (SDATA_DATA_OFFSET % sizeof (ptrdiff_t) == 0 \
1447 : max (NBYTES, sizeof (ptrdiff_t) - 1)) \
1449 + sizeof (ptrdiff_t) - 1) \
1450 & ~(sizeof (ptrdiff_t) - 1))
1452 #endif /* not GC_CHECK_STRING_BYTES */
1454 /* Extra bytes to allocate for each string. */
1456 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1458 /* Exact bound on the number of bytes in a string, not counting the
1459 terminating null. A string cannot contain more bytes than
1460 STRING_BYTES_BOUND, nor can it be so long that the size_t
1461 arithmetic in allocate_string_data would overflow while it is
1462 calculating a value to be passed to malloc. */
1463 static ptrdiff_t const STRING_BYTES_MAX
=
1464 min (STRING_BYTES_BOUND
,
1465 ((SIZE_MAX
- XMALLOC_OVERRUN_CHECK_OVERHEAD
1467 - offsetof (struct sblock
, first_data
)
1468 - SDATA_DATA_OFFSET
)
1469 & ~(sizeof (EMACS_INT
) - 1)));
1471 /* Initialize string allocation. Called from init_alloc_once. */
1476 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1477 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1481 #ifdef GC_CHECK_STRING_BYTES
1483 static int check_string_bytes_count
;
1485 /* Like STRING_BYTES, but with debugging check. Can be
1486 called during GC, so pay attention to the mark bit. */
1489 string_bytes (struct Lisp_String
*s
)
1492 (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1494 if (!PURE_POINTER_P (s
)
1496 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1501 /* Check validity of Lisp strings' string_bytes member in B. */
1504 check_sblock (struct sblock
*b
)
1506 struct sdata
*from
, *end
, *from_end
;
1510 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1512 /* Compute the next FROM here because copying below may
1513 overwrite data we need to compute it. */
1516 /* Check that the string size recorded in the string is the
1517 same as the one recorded in the sdata structure. */
1518 nbytes
= SDATA_SIZE (from
->string
? string_bytes (from
->string
)
1519 : SDATA_NBYTES (from
));
1520 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1525 /* Check validity of Lisp strings' string_bytes member. ALL_P
1526 means check all strings, otherwise check only most
1527 recently allocated strings. Used for hunting a bug. */
1530 check_string_bytes (bool all_p
)
1536 for (b
= large_sblocks
; b
; b
= b
->next
)
1538 struct Lisp_String
*s
= b
->first_data
.string
;
1543 for (b
= oldest_sblock
; b
; b
= b
->next
)
1546 else if (current_sblock
)
1547 check_sblock (current_sblock
);
1550 #else /* not GC_CHECK_STRING_BYTES */
1552 #define check_string_bytes(all) ((void) 0)
1554 #endif /* GC_CHECK_STRING_BYTES */
1556 #ifdef GC_CHECK_STRING_FREE_LIST
1558 /* Walk through the string free list looking for bogus next pointers.
1559 This may catch buffer overrun from a previous string. */
1562 check_string_free_list (void)
1564 struct Lisp_String
*s
;
1566 /* Pop a Lisp_String off the free-list. */
1567 s
= string_free_list
;
1570 if ((uintptr_t) s
< 1024)
1572 s
= NEXT_FREE_LISP_STRING (s
);
1576 #define check_string_free_list()
1579 /* Return a new Lisp_String. */
1581 static struct Lisp_String
*
1582 allocate_string (void)
1584 struct Lisp_String
*s
;
1588 /* If the free-list is empty, allocate a new string_block, and
1589 add all the Lisp_Strings in it to the free-list. */
1590 if (string_free_list
== NULL
)
1592 struct string_block
*b
= lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1595 b
->next
= string_blocks
;
1598 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1601 /* Every string on a free list should have NULL data pointer. */
1603 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1604 string_free_list
= s
;
1607 total_free_strings
+= STRING_BLOCK_SIZE
;
1610 check_string_free_list ();
1612 /* Pop a Lisp_String off the free-list. */
1613 s
= string_free_list
;
1614 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1616 MALLOC_UNBLOCK_INPUT
;
1618 --total_free_strings
;
1621 consing_since_gc
+= sizeof *s
;
1623 #ifdef GC_CHECK_STRING_BYTES
1624 if (!noninteractive
)
1626 if (++check_string_bytes_count
== 200)
1628 check_string_bytes_count
= 0;
1629 check_string_bytes (1);
1632 check_string_bytes (0);
1634 #endif /* GC_CHECK_STRING_BYTES */
1640 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1641 plus a NUL byte at the end. Allocate an sdata structure for S, and
1642 set S->data to its `u.data' member. Store a NUL byte at the end of
1643 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1644 S->data if it was initially non-null. */
1647 allocate_string_data (struct Lisp_String
*s
,
1648 EMACS_INT nchars
, EMACS_INT nbytes
)
1650 struct sdata
*data
, *old_data
;
1652 ptrdiff_t needed
, old_nbytes
;
1654 if (STRING_BYTES_MAX
< nbytes
)
1657 /* Determine the number of bytes needed to store NBYTES bytes
1659 needed
= SDATA_SIZE (nbytes
);
1662 old_data
= SDATA_OF_STRING (s
);
1663 old_nbytes
= STRING_BYTES (s
);
1670 if (nbytes
> LARGE_STRING_BYTES
)
1672 size_t size
= offsetof (struct sblock
, first_data
) + needed
;
1674 #ifdef DOUG_LEA_MALLOC
1675 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1676 because mapped region contents are not preserved in
1679 In case you think of allowing it in a dumped Emacs at the
1680 cost of not being able to re-dump, there's another reason:
1681 mmap'ed data typically have an address towards the top of the
1682 address space, which won't fit into an EMACS_INT (at least on
1683 32-bit systems with the current tagging scheme). --fx */
1684 mallopt (M_MMAP_MAX
, 0);
1687 b
= lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1689 #ifdef DOUG_LEA_MALLOC
1690 /* Back to a reasonable maximum of mmap'ed areas. */
1691 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1694 b
->next_free
= &b
->first_data
;
1695 b
->first_data
.string
= NULL
;
1696 b
->next
= large_sblocks
;
1699 else if (current_sblock
== NULL
1700 || (((char *) current_sblock
+ SBLOCK_SIZE
1701 - (char *) current_sblock
->next_free
)
1702 < (needed
+ GC_STRING_EXTRA
)))
1704 /* Not enough room in the current sblock. */
1705 b
= lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1706 b
->next_free
= &b
->first_data
;
1707 b
->first_data
.string
= NULL
;
1711 current_sblock
->next
= b
;
1719 data
= b
->next_free
;
1720 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
1722 MALLOC_UNBLOCK_INPUT
;
1725 s
->data
= SDATA_DATA (data
);
1726 #ifdef GC_CHECK_STRING_BYTES
1727 SDATA_NBYTES (data
) = nbytes
;
1730 s
->size_byte
= nbytes
;
1731 s
->data
[nbytes
] = '\0';
1732 #ifdef GC_CHECK_STRING_OVERRUN
1733 memcpy ((char *) data
+ needed
, string_overrun_cookie
,
1734 GC_STRING_OVERRUN_COOKIE_SIZE
);
1737 /* Note that Faset may call to this function when S has already data
1738 assigned. In this case, mark data as free by setting it's string
1739 back-pointer to null, and record the size of the data in it. */
1742 SDATA_NBYTES (old_data
) = old_nbytes
;
1743 old_data
->string
= NULL
;
1746 consing_since_gc
+= needed
;
1750 /* Sweep and compact strings. */
1753 sweep_strings (void)
1755 struct string_block
*b
, *next
;
1756 struct string_block
*live_blocks
= NULL
;
1758 string_free_list
= NULL
;
1759 total_strings
= total_free_strings
= 0;
1760 total_string_bytes
= 0;
1762 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1763 for (b
= string_blocks
; b
; b
= next
)
1766 struct Lisp_String
*free_list_before
= string_free_list
;
1770 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1772 struct Lisp_String
*s
= b
->strings
+ i
;
1776 /* String was not on free-list before. */
1777 if (STRING_MARKED_P (s
))
1779 /* String is live; unmark it and its intervals. */
1782 /* Do not use string_(set|get)_intervals here. */
1783 s
->intervals
= balance_intervals (s
->intervals
);
1786 total_string_bytes
+= STRING_BYTES (s
);
1790 /* String is dead. Put it on the free-list. */
1791 struct sdata
*data
= SDATA_OF_STRING (s
);
1793 /* Save the size of S in its sdata so that we know
1794 how large that is. Reset the sdata's string
1795 back-pointer so that we know it's free. */
1796 #ifdef GC_CHECK_STRING_BYTES
1797 if (string_bytes (s
) != SDATA_NBYTES (data
))
1800 data
->u
.nbytes
= STRING_BYTES (s
);
1802 data
->string
= NULL
;
1804 /* Reset the strings's `data' member so that we
1808 /* Put the string on the free-list. */
1809 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1810 string_free_list
= s
;
1816 /* S was on the free-list before. Put it there again. */
1817 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1818 string_free_list
= s
;
1823 /* Free blocks that contain free Lisp_Strings only, except
1824 the first two of them. */
1825 if (nfree
== STRING_BLOCK_SIZE
1826 && total_free_strings
> STRING_BLOCK_SIZE
)
1829 string_free_list
= free_list_before
;
1833 total_free_strings
+= nfree
;
1834 b
->next
= live_blocks
;
1839 check_string_free_list ();
1841 string_blocks
= live_blocks
;
1842 free_large_strings ();
1843 compact_small_strings ();
1845 check_string_free_list ();
1849 /* Free dead large strings. */
1852 free_large_strings (void)
1854 struct sblock
*b
, *next
;
1855 struct sblock
*live_blocks
= NULL
;
1857 for (b
= large_sblocks
; b
; b
= next
)
1861 if (b
->first_data
.string
== NULL
)
1865 b
->next
= live_blocks
;
1870 large_sblocks
= live_blocks
;
1874 /* Compact data of small strings. Free sblocks that don't contain
1875 data of live strings after compaction. */
1878 compact_small_strings (void)
1880 struct sblock
*b
, *tb
, *next
;
1881 struct sdata
*from
, *to
, *end
, *tb_end
;
1882 struct sdata
*to_end
, *from_end
;
1884 /* TB is the sblock we copy to, TO is the sdata within TB we copy
1885 to, and TB_END is the end of TB. */
1887 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1888 to
= &tb
->first_data
;
1890 /* Step through the blocks from the oldest to the youngest. We
1891 expect that old blocks will stabilize over time, so that less
1892 copying will happen this way. */
1893 for (b
= oldest_sblock
; b
; b
= b
->next
)
1896 eassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
1898 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1900 /* Compute the next FROM here because copying below may
1901 overwrite data we need to compute it. */
1903 struct Lisp_String
*s
= from
->string
;
1905 #ifdef GC_CHECK_STRING_BYTES
1906 /* Check that the string size recorded in the string is the
1907 same as the one recorded in the sdata structure. */
1908 if (s
&& string_bytes (s
) != SDATA_NBYTES (from
))
1910 #endif /* GC_CHECK_STRING_BYTES */
1912 nbytes
= s
? STRING_BYTES (s
) : SDATA_NBYTES (from
);
1913 eassert (nbytes
<= LARGE_STRING_BYTES
);
1915 nbytes
= SDATA_SIZE (nbytes
);
1916 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1918 #ifdef GC_CHECK_STRING_OVERRUN
1919 if (memcmp (string_overrun_cookie
,
1920 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
1921 GC_STRING_OVERRUN_COOKIE_SIZE
))
1925 /* Non-NULL S means it's alive. Copy its data. */
1928 /* If TB is full, proceed with the next sblock. */
1929 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
1930 if (to_end
> tb_end
)
1934 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1935 to
= &tb
->first_data
;
1936 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
1939 /* Copy, and update the string's `data' pointer. */
1942 eassert (tb
!= b
|| to
< from
);
1943 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
1944 to
->string
->data
= SDATA_DATA (to
);
1947 /* Advance past the sdata we copied to. */
1953 /* The rest of the sblocks following TB don't contain live data, so
1954 we can free them. */
1955 for (b
= tb
->next
; b
; b
= next
)
1963 current_sblock
= tb
;
1967 string_overflow (void)
1969 error ("Maximum string size exceeded");
1972 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
1973 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
1974 LENGTH must be an integer.
1975 INIT must be an integer that represents a character. */)
1976 (Lisp_Object length
, Lisp_Object init
)
1978 register Lisp_Object val
;
1979 register unsigned char *p
, *end
;
1983 CHECK_NATNUM (length
);
1984 CHECK_CHARACTER (init
);
1986 c
= XFASTINT (init
);
1987 if (ASCII_CHAR_P (c
))
1989 nbytes
= XINT (length
);
1990 val
= make_uninit_string (nbytes
);
1992 end
= p
+ SCHARS (val
);
1998 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
1999 int len
= CHAR_STRING (c
, str
);
2000 EMACS_INT string_len
= XINT (length
);
2002 if (string_len
> STRING_BYTES_MAX
/ len
)
2004 nbytes
= len
* string_len
;
2005 val
= make_uninit_multibyte_string (string_len
, nbytes
);
2010 memcpy (p
, str
, len
);
2020 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2021 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2022 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2023 (Lisp_Object length
, Lisp_Object init
)
2025 register Lisp_Object val
;
2026 struct Lisp_Bool_Vector
*p
;
2027 ptrdiff_t length_in_chars
;
2028 EMACS_INT length_in_elts
;
2030 int extra_bool_elts
= ((bool_header_size
- header_size
+ word_size
- 1)
2033 CHECK_NATNUM (length
);
2035 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2037 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2039 val
= Fmake_vector (make_number (length_in_elts
+ extra_bool_elts
), Qnil
);
2041 /* No Lisp_Object to trace in there. */
2042 XSETPVECTYPESIZE (XVECTOR (val
), PVEC_BOOL_VECTOR
, 0);
2044 p
= XBOOL_VECTOR (val
);
2045 p
->size
= XFASTINT (length
);
2047 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2048 / BOOL_VECTOR_BITS_PER_CHAR
);
2049 if (length_in_chars
)
2051 memset (p
->data
, ! NILP (init
) ? -1 : 0, length_in_chars
);
2053 /* Clear any extraneous bits in the last byte. */
2054 p
->data
[length_in_chars
- 1]
2055 &= (1 << ((XFASTINT (length
) - 1) % BOOL_VECTOR_BITS_PER_CHAR
+ 1)) - 1;
2062 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2063 of characters from the contents. This string may be unibyte or
2064 multibyte, depending on the contents. */
2067 make_string (const char *contents
, ptrdiff_t nbytes
)
2069 register Lisp_Object val
;
2070 ptrdiff_t nchars
, multibyte_nbytes
;
2072 parse_str_as_multibyte ((const unsigned char *) contents
, nbytes
,
2073 &nchars
, &multibyte_nbytes
);
2074 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2075 /* CONTENTS contains no multibyte sequences or contains an invalid
2076 multibyte sequence. We must make unibyte string. */
2077 val
= make_unibyte_string (contents
, nbytes
);
2079 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2084 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2087 make_unibyte_string (const char *contents
, ptrdiff_t length
)
2089 register Lisp_Object val
;
2090 val
= make_uninit_string (length
);
2091 memcpy (SDATA (val
), contents
, length
);
2096 /* Make a multibyte string from NCHARS characters occupying NBYTES
2097 bytes at CONTENTS. */
2100 make_multibyte_string (const char *contents
,
2101 ptrdiff_t nchars
, ptrdiff_t nbytes
)
2103 register Lisp_Object val
;
2104 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2105 memcpy (SDATA (val
), contents
, nbytes
);
2110 /* Make a string from NCHARS characters occupying NBYTES bytes at
2111 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2114 make_string_from_bytes (const char *contents
,
2115 ptrdiff_t nchars
, ptrdiff_t nbytes
)
2117 register Lisp_Object val
;
2118 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2119 memcpy (SDATA (val
), contents
, nbytes
);
2120 if (SBYTES (val
) == SCHARS (val
))
2121 STRING_SET_UNIBYTE (val
);
2126 /* Make a string from NCHARS characters occupying NBYTES bytes at
2127 CONTENTS. The argument MULTIBYTE controls whether to label the
2128 string as multibyte. If NCHARS is negative, it counts the number of
2129 characters by itself. */
2132 make_specified_string (const char *contents
,
2133 ptrdiff_t nchars
, ptrdiff_t nbytes
, bool multibyte
)
2140 nchars
= multibyte_chars_in_text ((const unsigned char *) contents
,
2145 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2146 memcpy (SDATA (val
), contents
, nbytes
);
2148 STRING_SET_UNIBYTE (val
);
2153 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2154 occupying LENGTH bytes. */
2157 make_uninit_string (EMACS_INT length
)
2162 return empty_unibyte_string
;
2163 val
= make_uninit_multibyte_string (length
, length
);
2164 STRING_SET_UNIBYTE (val
);
2169 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2170 which occupy NBYTES bytes. */
2173 make_uninit_multibyte_string (EMACS_INT nchars
, EMACS_INT nbytes
)
2176 struct Lisp_String
*s
;
2181 return empty_multibyte_string
;
2183 s
= allocate_string ();
2184 s
->intervals
= NULL
;
2185 allocate_string_data (s
, nchars
, nbytes
);
2186 XSETSTRING (string
, s
);
2187 string_chars_consed
+= nbytes
;
2191 /* Print arguments to BUF according to a FORMAT, then return
2192 a Lisp_String initialized with the data from BUF. */
2195 make_formatted_string (char *buf
, const char *format
, ...)
2200 va_start (ap
, format
);
2201 length
= vsprintf (buf
, format
, ap
);
2203 return make_string (buf
, length
);
2207 /***********************************************************************
2209 ***********************************************************************/
2211 /* We store float cells inside of float_blocks, allocating a new
2212 float_block with malloc whenever necessary. Float cells reclaimed
2213 by GC are put on a free list to be reallocated before allocating
2214 any new float cells from the latest float_block. */
2216 #define FLOAT_BLOCK_SIZE \
2217 (((BLOCK_BYTES - sizeof (struct float_block *) \
2218 /* The compiler might add padding at the end. */ \
2219 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2220 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2222 #define GETMARKBIT(block,n) \
2223 (((block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2224 >> ((n) % (sizeof (int) * CHAR_BIT))) \
2227 #define SETMARKBIT(block,n) \
2228 (block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2229 |= 1 << ((n) % (sizeof (int) * CHAR_BIT))
2231 #define UNSETMARKBIT(block,n) \
2232 (block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2233 &= ~(1 << ((n) % (sizeof (int) * CHAR_BIT)))
2235 #define FLOAT_BLOCK(fptr) \
2236 ((struct float_block *) (((uintptr_t) (fptr)) & ~(BLOCK_ALIGN - 1)))
2238 #define FLOAT_INDEX(fptr) \
2239 ((((uintptr_t) (fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2243 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2244 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2245 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof (int) * CHAR_BIT
)];
2246 struct float_block
*next
;
2249 #define FLOAT_MARKED_P(fptr) \
2250 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2252 #define FLOAT_MARK(fptr) \
2253 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2255 #define FLOAT_UNMARK(fptr) \
2256 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2258 /* Current float_block. */
2260 static struct float_block
*float_block
;
2262 /* Index of first unused Lisp_Float in the current float_block. */
2264 static int float_block_index
= FLOAT_BLOCK_SIZE
;
2266 /* Free-list of Lisp_Floats. */
2268 static struct Lisp_Float
*float_free_list
;
2270 /* Return a new float object with value FLOAT_VALUE. */
2273 make_float (double float_value
)
2275 register Lisp_Object val
;
2279 if (float_free_list
)
2281 /* We use the data field for chaining the free list
2282 so that we won't use the same field that has the mark bit. */
2283 XSETFLOAT (val
, float_free_list
);
2284 float_free_list
= float_free_list
->u
.chain
;
2288 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2290 struct float_block
*new
2291 = lisp_align_malloc (sizeof *new, MEM_TYPE_FLOAT
);
2292 new->next
= float_block
;
2293 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2295 float_block_index
= 0;
2296 total_free_floats
+= FLOAT_BLOCK_SIZE
;
2298 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2299 float_block_index
++;
2302 MALLOC_UNBLOCK_INPUT
;
2304 XFLOAT_INIT (val
, float_value
);
2305 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2306 consing_since_gc
+= sizeof (struct Lisp_Float
);
2308 total_free_floats
--;
2314 /***********************************************************************
2316 ***********************************************************************/
2318 /* We store cons cells inside of cons_blocks, allocating a new
2319 cons_block with malloc whenever necessary. Cons cells reclaimed by
2320 GC are put on a free list to be reallocated before allocating
2321 any new cons cells from the latest cons_block. */
2323 #define CONS_BLOCK_SIZE \
2324 (((BLOCK_BYTES - sizeof (struct cons_block *) \
2325 /* The compiler might add padding at the end. */ \
2326 - (sizeof (struct Lisp_Cons) - sizeof (int))) * CHAR_BIT) \
2327 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2329 #define CONS_BLOCK(fptr) \
2330 ((struct cons_block *) ((uintptr_t) (fptr) & ~(BLOCK_ALIGN - 1)))
2332 #define CONS_INDEX(fptr) \
2333 (((uintptr_t) (fptr) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2337 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2338 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2339 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof (int) * CHAR_BIT
)];
2340 struct cons_block
*next
;
2343 #define CONS_MARKED_P(fptr) \
2344 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2346 #define CONS_MARK(fptr) \
2347 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2349 #define CONS_UNMARK(fptr) \
2350 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2352 /* Current cons_block. */
2354 static struct cons_block
*cons_block
;
2356 /* Index of first unused Lisp_Cons in the current block. */
2358 static int cons_block_index
= CONS_BLOCK_SIZE
;
2360 /* Free-list of Lisp_Cons structures. */
2362 static struct Lisp_Cons
*cons_free_list
;
2364 /* Explicitly free a cons cell by putting it on the free-list. */
2367 free_cons (struct Lisp_Cons
*ptr
)
2369 ptr
->u
.chain
= cons_free_list
;
2373 cons_free_list
= ptr
;
2374 consing_since_gc
-= sizeof *ptr
;
2375 total_free_conses
++;
2378 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2379 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2380 (Lisp_Object car
, Lisp_Object cdr
)
2382 register Lisp_Object val
;
2388 /* We use the cdr for chaining the free list
2389 so that we won't use the same field that has the mark bit. */
2390 XSETCONS (val
, cons_free_list
);
2391 cons_free_list
= cons_free_list
->u
.chain
;
2395 if (cons_block_index
== CONS_BLOCK_SIZE
)
2397 struct cons_block
*new
2398 = lisp_align_malloc (sizeof *new, MEM_TYPE_CONS
);
2399 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2400 new->next
= cons_block
;
2402 cons_block_index
= 0;
2403 total_free_conses
+= CONS_BLOCK_SIZE
;
2405 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2409 MALLOC_UNBLOCK_INPUT
;
2413 eassert (!CONS_MARKED_P (XCONS (val
)));
2414 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2415 total_free_conses
--;
2416 cons_cells_consed
++;
2420 #ifdef GC_CHECK_CONS_LIST
2421 /* Get an error now if there's any junk in the cons free list. */
2423 check_cons_list (void)
2425 struct Lisp_Cons
*tail
= cons_free_list
;
2428 tail
= tail
->u
.chain
;
2432 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2435 list1 (Lisp_Object arg1
)
2437 return Fcons (arg1
, Qnil
);
2441 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2443 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2448 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2450 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2455 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2457 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2462 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2464 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2465 Fcons (arg5
, Qnil
)))));
2468 /* Make a list of COUNT Lisp_Objects, where ARG is the
2469 first one. Allocate conses from pure space if TYPE
2470 is CONSTYPE_PURE, or allocate as usual if type is CONSTYPE_HEAP. */
2473 listn (enum constype type
, ptrdiff_t count
, Lisp_Object arg
, ...)
2477 Lisp_Object val
, *objp
;
2479 /* Change to SAFE_ALLOCA if you hit this eassert. */
2480 eassert (count
<= MAX_ALLOCA
/ word_size
);
2482 objp
= alloca (count
* word_size
);
2485 for (i
= 1; i
< count
; i
++)
2486 objp
[i
] = va_arg (ap
, Lisp_Object
);
2489 for (val
= Qnil
, i
= count
- 1; i
>= 0; i
--)
2491 if (type
== CONSTYPE_PURE
)
2492 val
= pure_cons (objp
[i
], val
);
2493 else if (type
== CONSTYPE_HEAP
)
2494 val
= Fcons (objp
[i
], val
);
2501 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2502 doc
: /* Return a newly created list with specified arguments as elements.
2503 Any number of arguments, even zero arguments, are allowed.
2504 usage: (list &rest OBJECTS) */)
2505 (ptrdiff_t nargs
, Lisp_Object
*args
)
2507 register Lisp_Object val
;
2513 val
= Fcons (args
[nargs
], val
);
2519 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2520 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2521 (register Lisp_Object length
, Lisp_Object init
)
2523 register Lisp_Object val
;
2524 register EMACS_INT size
;
2526 CHECK_NATNUM (length
);
2527 size
= XFASTINT (length
);
2532 val
= Fcons (init
, val
);
2537 val
= Fcons (init
, val
);
2542 val
= Fcons (init
, val
);
2547 val
= Fcons (init
, val
);
2552 val
= Fcons (init
, val
);
2567 /***********************************************************************
2569 ***********************************************************************/
2571 /* This value is balanced well enough to avoid too much internal overhead
2572 for the most common cases; it's not required to be a power of two, but
2573 it's expected to be a mult-of-ROUNDUP_SIZE (see below). */
2575 #define VECTOR_BLOCK_SIZE 4096
2577 /* Align allocation request sizes to be a multiple of ROUNDUP_SIZE. */
2580 roundup_size
= COMMON_MULTIPLE (word_size
, USE_LSB_TAG
? GCALIGNMENT
: 1)
2583 /* ROUNDUP_SIZE must be a power of 2. */
2584 verify ((roundup_size
& (roundup_size
- 1)) == 0);
2586 /* Verify assumptions described above. */
2587 verify ((VECTOR_BLOCK_SIZE
% roundup_size
) == 0);
2588 verify (VECTOR_BLOCK_SIZE
<= (1 << PSEUDOVECTOR_SIZE_BITS
));
2590 /* Round up X to nearest mult-of-ROUNDUP_SIZE. */
2592 #define vroundup(x) (((x) + (roundup_size - 1)) & ~(roundup_size - 1))
2594 /* Rounding helps to maintain alignment constraints if USE_LSB_TAG. */
2596 #define VECTOR_BLOCK_BYTES (VECTOR_BLOCK_SIZE - vroundup (sizeof (void *)))
2598 /* Size of the minimal vector allocated from block. */
2600 #define VBLOCK_BYTES_MIN vroundup (sizeof (struct Lisp_Vector))
2602 /* Size of the largest vector allocated from block. */
2604 #define VBLOCK_BYTES_MAX \
2605 vroundup ((VECTOR_BLOCK_BYTES / 2) - word_size)
2607 /* We maintain one free list for each possible block-allocated
2608 vector size, and this is the number of free lists we have. */
2610 #define VECTOR_MAX_FREE_LIST_INDEX \
2611 ((VECTOR_BLOCK_BYTES - VBLOCK_BYTES_MIN) / roundup_size + 1)
2613 /* Common shortcut to advance vector pointer over a block data. */
2615 #define ADVANCE(v, nbytes) ((struct Lisp_Vector *) ((char *) (v) + (nbytes)))
2617 /* Common shortcut to calculate NBYTES-vector index in VECTOR_FREE_LISTS. */
2619 #define VINDEX(nbytes) (((nbytes) - VBLOCK_BYTES_MIN) / roundup_size)
2621 /* Common shortcut to setup vector on a free list. */
2623 #define SETUP_ON_FREE_LIST(v, nbytes, index) \
2625 XSETPVECTYPESIZE (v, PVEC_FREE, nbytes); \
2626 eassert ((nbytes) % roundup_size == 0); \
2627 (index) = VINDEX (nbytes); \
2628 eassert ((index) < VECTOR_MAX_FREE_LIST_INDEX); \
2629 (v)->header.next.vector = vector_free_lists[index]; \
2630 vector_free_lists[index] = (v); \
2631 total_free_vector_slots += (nbytes) / word_size; \
2636 char data
[VECTOR_BLOCK_BYTES
];
2637 struct vector_block
*next
;
2640 /* Chain of vector blocks. */
2642 static struct vector_block
*vector_blocks
;
2644 /* Vector free lists, where NTH item points to a chain of free
2645 vectors of the same NBYTES size, so NTH == VINDEX (NBYTES). */
2647 static struct Lisp_Vector
*vector_free_lists
[VECTOR_MAX_FREE_LIST_INDEX
];
2649 /* Singly-linked list of large vectors. */
2651 static struct Lisp_Vector
*large_vectors
;
2653 /* The only vector with 0 slots, allocated from pure space. */
2655 Lisp_Object zero_vector
;
2657 /* Number of live vectors. */
2659 static EMACS_INT total_vectors
;
2661 /* Total size of live and free vectors, in Lisp_Object units. */
2663 static EMACS_INT total_vector_slots
, total_free_vector_slots
;
2665 /* Get a new vector block. */
2667 static struct vector_block
*
2668 allocate_vector_block (void)
2670 struct vector_block
*block
= xmalloc (sizeof *block
);
2672 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
2673 mem_insert (block
->data
, block
->data
+ VECTOR_BLOCK_BYTES
,
2674 MEM_TYPE_VECTOR_BLOCK
);
2677 block
->next
= vector_blocks
;
2678 vector_blocks
= block
;
2682 /* Called once to initialize vector allocation. */
2687 zero_vector
= make_pure_vector (0);
2690 /* Allocate vector from a vector block. */
2692 static struct Lisp_Vector
*
2693 allocate_vector_from_block (size_t nbytes
)
2695 struct Lisp_Vector
*vector
, *rest
;
2696 struct vector_block
*block
;
2697 size_t index
, restbytes
;
2699 eassert (VBLOCK_BYTES_MIN
<= nbytes
&& nbytes
<= VBLOCK_BYTES_MAX
);
2700 eassert (nbytes
% roundup_size
== 0);
2702 /* First, try to allocate from a free list
2703 containing vectors of the requested size. */
2704 index
= VINDEX (nbytes
);
2705 if (vector_free_lists
[index
])
2707 vector
= vector_free_lists
[index
];
2708 vector_free_lists
[index
] = vector
->header
.next
.vector
;
2709 vector
->header
.next
.nbytes
= nbytes
;
2710 total_free_vector_slots
-= nbytes
/ word_size
;
2714 /* Next, check free lists containing larger vectors. Since
2715 we will split the result, we should have remaining space
2716 large enough to use for one-slot vector at least. */
2717 for (index
= VINDEX (nbytes
+ VBLOCK_BYTES_MIN
);
2718 index
< VECTOR_MAX_FREE_LIST_INDEX
; index
++)
2719 if (vector_free_lists
[index
])
2721 /* This vector is larger than requested. */
2722 vector
= vector_free_lists
[index
];
2723 vector_free_lists
[index
] = vector
->header
.next
.vector
;
2724 vector
->header
.next
.nbytes
= nbytes
;
2725 total_free_vector_slots
-= nbytes
/ word_size
;
2727 /* Excess bytes are used for the smaller vector,
2728 which should be set on an appropriate free list. */
2729 restbytes
= index
* roundup_size
+ VBLOCK_BYTES_MIN
- nbytes
;
2730 eassert (restbytes
% roundup_size
== 0);
2731 rest
= ADVANCE (vector
, nbytes
);
2732 SETUP_ON_FREE_LIST (rest
, restbytes
, index
);
2736 /* Finally, need a new vector block. */
2737 block
= allocate_vector_block ();
2739 /* New vector will be at the beginning of this block. */
2740 vector
= (struct Lisp_Vector
*) block
->data
;
2741 vector
->header
.next
.nbytes
= nbytes
;
2743 /* If the rest of space from this block is large enough
2744 for one-slot vector at least, set up it on a free list. */
2745 restbytes
= VECTOR_BLOCK_BYTES
- nbytes
;
2746 if (restbytes
>= VBLOCK_BYTES_MIN
)
2748 eassert (restbytes
% roundup_size
== 0);
2749 rest
= ADVANCE (vector
, nbytes
);
2750 SETUP_ON_FREE_LIST (rest
, restbytes
, index
);
2755 /* Nonzero if VECTOR pointer is valid pointer inside BLOCK. */
2757 #define VECTOR_IN_BLOCK(vector, block) \
2758 ((char *) (vector) <= (block)->data \
2759 + VECTOR_BLOCK_BYTES - VBLOCK_BYTES_MIN)
2761 /* Number of bytes used by vector-block-allocated object. This is the only
2762 place where we actually use the `nbytes' field of the vector-header.
2763 I.e. we could get rid of the `nbytes' field by computing it based on the
2766 #define PSEUDOVECTOR_NBYTES(vector) \
2767 (PSEUDOVECTOR_TYPEP (&vector->header, PVEC_FREE) \
2768 ? vector->header.size & PSEUDOVECTOR_SIZE_MASK \
2769 : vector->header.next.nbytes)
2771 /* Reclaim space used by unmarked vectors. */
2774 sweep_vectors (void)
2776 struct vector_block
*block
= vector_blocks
, **bprev
= &vector_blocks
;
2777 struct Lisp_Vector
*vector
, *next
, **vprev
= &large_vectors
;
2779 total_vectors
= total_vector_slots
= total_free_vector_slots
= 0;
2780 memset (vector_free_lists
, 0, sizeof (vector_free_lists
));
2782 /* Looking through vector blocks. */
2784 for (block
= vector_blocks
; block
; block
= *bprev
)
2786 bool free_this_block
= 0;
2788 for (vector
= (struct Lisp_Vector
*) block
->data
;
2789 VECTOR_IN_BLOCK (vector
, block
); vector
= next
)
2791 if (VECTOR_MARKED_P (vector
))
2793 VECTOR_UNMARK (vector
);
2795 total_vector_slots
+= vector
->header
.next
.nbytes
/ word_size
;
2796 next
= ADVANCE (vector
, vector
->header
.next
.nbytes
);
2800 ptrdiff_t nbytes
= PSEUDOVECTOR_NBYTES (vector
);
2801 ptrdiff_t total_bytes
= nbytes
;
2803 next
= ADVANCE (vector
, nbytes
);
2805 /* While NEXT is not marked, try to coalesce with VECTOR,
2806 thus making VECTOR of the largest possible size. */
2808 while (VECTOR_IN_BLOCK (next
, block
))
2810 if (VECTOR_MARKED_P (next
))
2812 nbytes
= PSEUDOVECTOR_NBYTES (next
);
2813 total_bytes
+= nbytes
;
2814 next
= ADVANCE (next
, nbytes
);
2817 eassert (total_bytes
% roundup_size
== 0);
2819 if (vector
== (struct Lisp_Vector
*) block
->data
2820 && !VECTOR_IN_BLOCK (next
, block
))
2821 /* This block should be freed because all of it's
2822 space was coalesced into the only free vector. */
2823 free_this_block
= 1;
2827 SETUP_ON_FREE_LIST (vector
, total_bytes
, tmp
);
2832 if (free_this_block
)
2834 *bprev
= block
->next
;
2835 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
2836 mem_delete (mem_find (block
->data
));
2841 bprev
= &block
->next
;
2844 /* Sweep large vectors. */
2846 for (vector
= large_vectors
; vector
; vector
= *vprev
)
2848 if (VECTOR_MARKED_P (vector
))
2850 VECTOR_UNMARK (vector
);
2852 if (vector
->header
.size
& PSEUDOVECTOR_FLAG
)
2854 struct Lisp_Bool_Vector
*b
= (struct Lisp_Bool_Vector
*) vector
;
2856 /* All non-bool pseudovectors are small enough to be allocated
2857 from vector blocks. This code should be redesigned if some
2858 pseudovector type grows beyond VBLOCK_BYTES_MAX. */
2859 eassert (PSEUDOVECTOR_TYPEP (&vector
->header
, PVEC_BOOL_VECTOR
));
2862 += (bool_header_size
2863 + ((b
->size
+ BOOL_VECTOR_BITS_PER_CHAR
- 1)
2864 / BOOL_VECTOR_BITS_PER_CHAR
)) / word_size
;
2868 += header_size
/ word_size
+ vector
->header
.size
;
2869 vprev
= &vector
->header
.next
.vector
;
2873 *vprev
= vector
->header
.next
.vector
;
2879 /* Value is a pointer to a newly allocated Lisp_Vector structure
2880 with room for LEN Lisp_Objects. */
2882 static struct Lisp_Vector
*
2883 allocate_vectorlike (ptrdiff_t len
)
2885 struct Lisp_Vector
*p
;
2890 p
= XVECTOR (zero_vector
);
2893 size_t nbytes
= header_size
+ len
* word_size
;
2895 #ifdef DOUG_LEA_MALLOC
2896 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2897 because mapped region contents are not preserved in
2899 mallopt (M_MMAP_MAX
, 0);
2902 if (nbytes
<= VBLOCK_BYTES_MAX
)
2903 p
= allocate_vector_from_block (vroundup (nbytes
));
2906 p
= lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
2907 p
->header
.next
.vector
= large_vectors
;
2911 #ifdef DOUG_LEA_MALLOC
2912 /* Back to a reasonable maximum of mmap'ed areas. */
2913 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2916 consing_since_gc
+= nbytes
;
2917 vector_cells_consed
+= len
;
2920 MALLOC_UNBLOCK_INPUT
;
2926 /* Allocate a vector with LEN slots. */
2928 struct Lisp_Vector
*
2929 allocate_vector (EMACS_INT len
)
2931 struct Lisp_Vector
*v
;
2932 ptrdiff_t nbytes_max
= min (PTRDIFF_MAX
, SIZE_MAX
);
2934 if (min ((nbytes_max
- header_size
) / word_size
, MOST_POSITIVE_FIXNUM
) < len
)
2935 memory_full (SIZE_MAX
);
2936 v
= allocate_vectorlike (len
);
2937 v
->header
.size
= len
;
2942 /* Allocate other vector-like structures. */
2944 struct Lisp_Vector
*
2945 allocate_pseudovector (int memlen
, int lisplen
, int tag
)
2947 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2950 /* Only the first lisplen slots will be traced normally by the GC. */
2951 for (i
= 0; i
< lisplen
; ++i
)
2952 v
->contents
[i
] = Qnil
;
2954 XSETPVECTYPESIZE (v
, tag
, lisplen
);
2959 allocate_buffer (void)
2961 struct buffer
*b
= lisp_malloc (sizeof *b
, MEM_TYPE_BUFFER
);
2963 XSETPVECTYPESIZE (b
, PVEC_BUFFER
, (offsetof (struct buffer
, own_text
)
2964 - header_size
) / word_size
);
2965 /* Put B on the chain of all buffers including killed ones. */
2966 b
->header
.next
.buffer
= all_buffers
;
2968 /* Note that the rest fields of B are not initialized. */
2972 struct Lisp_Hash_Table
*
2973 allocate_hash_table (void)
2975 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
2979 allocate_window (void)
2983 w
= ALLOCATE_PSEUDOVECTOR (struct window
, current_matrix
, PVEC_WINDOW
);
2984 /* Users assumes that non-Lisp data is zeroed. */
2985 memset (&w
->current_matrix
, 0,
2986 sizeof (*w
) - offsetof (struct window
, current_matrix
));
2991 allocate_terminal (void)
2995 t
= ALLOCATE_PSEUDOVECTOR (struct terminal
, next_terminal
, PVEC_TERMINAL
);
2996 /* Users assumes that non-Lisp data is zeroed. */
2997 memset (&t
->next_terminal
, 0,
2998 sizeof (*t
) - offsetof (struct terminal
, next_terminal
));
3003 allocate_frame (void)
3007 f
= ALLOCATE_PSEUDOVECTOR (struct frame
, face_cache
, PVEC_FRAME
);
3008 /* Users assumes that non-Lisp data is zeroed. */
3009 memset (&f
->face_cache
, 0,
3010 sizeof (*f
) - offsetof (struct frame
, face_cache
));
3014 struct Lisp_Process
*
3015 allocate_process (void)
3017 struct Lisp_Process
*p
;
3019 p
= ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
3020 /* Users assumes that non-Lisp data is zeroed. */
3022 sizeof (*p
) - offsetof (struct Lisp_Process
, pid
));
3026 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3027 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3028 See also the function `vector'. */)
3029 (register Lisp_Object length
, Lisp_Object init
)
3032 register ptrdiff_t sizei
;
3033 register ptrdiff_t i
;
3034 register struct Lisp_Vector
*p
;
3036 CHECK_NATNUM (length
);
3038 p
= allocate_vector (XFASTINT (length
));
3039 sizei
= XFASTINT (length
);
3040 for (i
= 0; i
< sizei
; i
++)
3041 p
->contents
[i
] = init
;
3043 XSETVECTOR (vector
, p
);
3048 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3049 doc
: /* Return a newly created vector with specified arguments as elements.
3050 Any number of arguments, even zero arguments, are allowed.
3051 usage: (vector &rest OBJECTS) */)
3052 (ptrdiff_t nargs
, Lisp_Object
*args
)
3054 register Lisp_Object len
, val
;
3056 register struct Lisp_Vector
*p
;
3058 XSETFASTINT (len
, nargs
);
3059 val
= Fmake_vector (len
, Qnil
);
3061 for (i
= 0; i
< nargs
; i
++)
3062 p
->contents
[i
] = args
[i
];
3067 make_byte_code (struct Lisp_Vector
*v
)
3069 if (v
->header
.size
> 1 && STRINGP (v
->contents
[1])
3070 && STRING_MULTIBYTE (v
->contents
[1]))
3071 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3072 earlier because they produced a raw 8-bit string for byte-code
3073 and now such a byte-code string is loaded as multibyte while
3074 raw 8-bit characters converted to multibyte form. Thus, now we
3075 must convert them back to the original unibyte form. */
3076 v
->contents
[1] = Fstring_as_unibyte (v
->contents
[1]);
3077 XSETPVECTYPE (v
, PVEC_COMPILED
);
3080 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3081 doc
: /* Create a byte-code object with specified arguments as elements.
3082 The arguments should be the ARGLIST, bytecode-string BYTE-CODE, constant
3083 vector CONSTANTS, maximum stack size DEPTH, (optional) DOCSTRING,
3084 and (optional) INTERACTIVE-SPEC.
3085 The first four arguments are required; at most six have any
3087 The ARGLIST can be either like the one of `lambda', in which case the arguments
3088 will be dynamically bound before executing the byte code, or it can be an
3089 integer of the form NNNNNNNRMMMMMMM where the 7bit MMMMMMM specifies the
3090 minimum number of arguments, the 7-bit NNNNNNN specifies the maximum number
3091 of arguments (ignoring &rest) and the R bit specifies whether there is a &rest
3092 argument to catch the left-over arguments. If such an integer is used, the
3093 arguments will not be dynamically bound but will be instead pushed on the
3094 stack before executing the byte-code.
3095 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3096 (ptrdiff_t nargs
, Lisp_Object
*args
)
3098 register Lisp_Object len
, val
;
3100 register struct Lisp_Vector
*p
;
3102 /* We used to purecopy everything here, if purify-flga was set. This worked
3103 OK for Emacs-23, but with Emacs-24's lexical binding code, it can be
3104 dangerous, since make-byte-code is used during execution to build
3105 closures, so any closure built during the preload phase would end up
3106 copied into pure space, including its free variables, which is sometimes
3107 just wasteful and other times plainly wrong (e.g. those free vars may want
3110 XSETFASTINT (len
, nargs
);
3111 val
= Fmake_vector (len
, Qnil
);
3114 for (i
= 0; i
< nargs
; i
++)
3115 p
->contents
[i
] = args
[i
];
3117 XSETCOMPILED (val
, p
);
3123 /***********************************************************************
3125 ***********************************************************************/
3127 /* Like struct Lisp_Symbol, but padded so that the size is a multiple
3128 of the required alignment if LSB tags are used. */
3130 union aligned_Lisp_Symbol
3132 struct Lisp_Symbol s
;
3134 unsigned char c
[(sizeof (struct Lisp_Symbol
) + GCALIGNMENT
- 1)
3139 /* Each symbol_block is just under 1020 bytes long, since malloc
3140 really allocates in units of powers of two and uses 4 bytes for its
3143 #define SYMBOL_BLOCK_SIZE \
3144 ((1020 - sizeof (struct symbol_block *)) / sizeof (union aligned_Lisp_Symbol))
3148 /* Place `symbols' first, to preserve alignment. */
3149 union aligned_Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3150 struct symbol_block
*next
;
3153 /* Current symbol block and index of first unused Lisp_Symbol
3156 static struct symbol_block
*symbol_block
;
3157 static int symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3159 /* List of free symbols. */
3161 static struct Lisp_Symbol
*symbol_free_list
;
3163 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3164 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3165 Its value and function definition are void, and its property list is nil. */)
3168 register Lisp_Object val
;
3169 register struct Lisp_Symbol
*p
;
3171 CHECK_STRING (name
);
3175 if (symbol_free_list
)
3177 XSETSYMBOL (val
, symbol_free_list
);
3178 symbol_free_list
= symbol_free_list
->next
;
3182 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3184 struct symbol_block
*new
3185 = lisp_malloc (sizeof *new, MEM_TYPE_SYMBOL
);
3186 new->next
= symbol_block
;
3188 symbol_block_index
= 0;
3189 total_free_symbols
+= SYMBOL_BLOCK_SIZE
;
3191 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
].s
);
3192 symbol_block_index
++;
3195 MALLOC_UNBLOCK_INPUT
;
3198 set_symbol_name (val
, name
);
3199 set_symbol_plist (val
, Qnil
);
3200 p
->redirect
= SYMBOL_PLAINVAL
;
3201 SET_SYMBOL_VAL (p
, Qunbound
);
3202 set_symbol_function (val
, Qunbound
);
3203 set_symbol_next (val
, NULL
);
3205 p
->interned
= SYMBOL_UNINTERNED
;
3207 p
->declared_special
= 0;
3208 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3210 total_free_symbols
--;
3216 /***********************************************************************
3217 Marker (Misc) Allocation
3218 ***********************************************************************/
3220 /* Like union Lisp_Misc, but padded so that its size is a multiple of
3221 the required alignment when LSB tags are used. */
3223 union aligned_Lisp_Misc
3227 unsigned char c
[(sizeof (union Lisp_Misc
) + GCALIGNMENT
- 1)
3232 /* Allocation of markers and other objects that share that structure.
3233 Works like allocation of conses. */
3235 #define MARKER_BLOCK_SIZE \
3236 ((1020 - sizeof (struct marker_block *)) / sizeof (union aligned_Lisp_Misc))
3240 /* Place `markers' first, to preserve alignment. */
3241 union aligned_Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3242 struct marker_block
*next
;
3245 static struct marker_block
*marker_block
;
3246 static int marker_block_index
= MARKER_BLOCK_SIZE
;
3248 static union Lisp_Misc
*marker_free_list
;
3250 /* Return a newly allocated Lisp_Misc object of specified TYPE. */
3253 allocate_misc (enum Lisp_Misc_Type type
)
3259 if (marker_free_list
)
3261 XSETMISC (val
, marker_free_list
);
3262 marker_free_list
= marker_free_list
->u_free
.chain
;
3266 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3268 struct marker_block
*new = lisp_malloc (sizeof *new, MEM_TYPE_MISC
);
3269 new->next
= marker_block
;
3271 marker_block_index
= 0;
3272 total_free_markers
+= MARKER_BLOCK_SIZE
;
3274 XSETMISC (val
, &marker_block
->markers
[marker_block_index
].m
);
3275 marker_block_index
++;
3278 MALLOC_UNBLOCK_INPUT
;
3280 --total_free_markers
;
3281 consing_since_gc
+= sizeof (union Lisp_Misc
);
3282 misc_objects_consed
++;
3283 XMISCTYPE (val
) = type
;
3284 XMISCANY (val
)->gcmarkbit
= 0;
3288 /* Free a Lisp_Misc object */
3291 free_misc (Lisp_Object misc
)
3293 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3294 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3295 marker_free_list
= XMISC (misc
);
3296 consing_since_gc
-= sizeof (union Lisp_Misc
);
3297 total_free_markers
++;
3300 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3301 INTEGER. This is used to package C values to call record_unwind_protect.
3302 The unwind function can get the C values back using XSAVE_VALUE. */
3305 make_save_value (void *pointer
, ptrdiff_t integer
)
3307 register Lisp_Object val
;
3308 register struct Lisp_Save_Value
*p
;
3310 val
= allocate_misc (Lisp_Misc_Save_Value
);
3311 p
= XSAVE_VALUE (val
);
3312 p
->pointer
= pointer
;
3313 p
->integer
= integer
;
3318 /* Return a Lisp_Misc_Overlay object with specified START, END and PLIST. */
3321 build_overlay (Lisp_Object start
, Lisp_Object end
, Lisp_Object plist
)
3323 register Lisp_Object overlay
;
3325 overlay
= allocate_misc (Lisp_Misc_Overlay
);
3326 OVERLAY_START (overlay
) = start
;
3327 OVERLAY_END (overlay
) = end
;
3328 set_overlay_plist (overlay
, plist
);
3329 XOVERLAY (overlay
)->next
= NULL
;
3333 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3334 doc
: /* Return a newly allocated marker which does not point at any place. */)
3337 register Lisp_Object val
;
3338 register struct Lisp_Marker
*p
;
3340 val
= allocate_misc (Lisp_Misc_Marker
);
3346 p
->insertion_type
= 0;
3350 /* Return a newly allocated marker which points into BUF
3351 at character position CHARPOS and byte position BYTEPOS. */
3354 build_marker (struct buffer
*buf
, ptrdiff_t charpos
, ptrdiff_t bytepos
)
3357 struct Lisp_Marker
*m
;
3359 /* No dead buffers here. */
3360 eassert (BUFFER_LIVE_P (buf
));
3362 /* Every character is at least one byte. */
3363 eassert (charpos
<= bytepos
);
3365 obj
= allocate_misc (Lisp_Misc_Marker
);
3368 m
->charpos
= charpos
;
3369 m
->bytepos
= bytepos
;
3370 m
->insertion_type
= 0;
3371 m
->next
= BUF_MARKERS (buf
);
3372 BUF_MARKERS (buf
) = m
;
3376 /* Put MARKER back on the free list after using it temporarily. */
3379 free_marker (Lisp_Object marker
)
3381 unchain_marker (XMARKER (marker
));
3386 /* Return a newly created vector or string with specified arguments as
3387 elements. If all the arguments are characters that can fit
3388 in a string of events, make a string; otherwise, make a vector.
3390 Any number of arguments, even zero arguments, are allowed. */
3393 make_event_array (register int nargs
, Lisp_Object
*args
)
3397 for (i
= 0; i
< nargs
; i
++)
3398 /* The things that fit in a string
3399 are characters that are in 0...127,
3400 after discarding the meta bit and all the bits above it. */
3401 if (!INTEGERP (args
[i
])
3402 || (XINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3403 return Fvector (nargs
, args
);
3405 /* Since the loop exited, we know that all the things in it are
3406 characters, so we can make a string. */
3410 result
= Fmake_string (make_number (nargs
), make_number (0));
3411 for (i
= 0; i
< nargs
; i
++)
3413 SSET (result
, i
, XINT (args
[i
]));
3414 /* Move the meta bit to the right place for a string char. */
3415 if (XINT (args
[i
]) & CHAR_META
)
3416 SSET (result
, i
, SREF (result
, i
) | 0x80);
3425 /************************************************************************
3426 Memory Full Handling
3427 ************************************************************************/
3430 /* Called if malloc (NBYTES) returns zero. If NBYTES == SIZE_MAX,
3431 there may have been size_t overflow so that malloc was never
3432 called, or perhaps malloc was invoked successfully but the
3433 resulting pointer had problems fitting into a tagged EMACS_INT. In
3434 either case this counts as memory being full even though malloc did
3438 memory_full (size_t nbytes
)
3440 /* Do not go into hysterics merely because a large request failed. */
3441 bool enough_free_memory
= 0;
3442 if (SPARE_MEMORY
< nbytes
)
3447 p
= malloc (SPARE_MEMORY
);
3451 enough_free_memory
= 1;
3453 MALLOC_UNBLOCK_INPUT
;
3456 if (! enough_free_memory
)
3462 memory_full_cons_threshold
= sizeof (struct cons_block
);
3464 /* The first time we get here, free the spare memory. */
3465 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3466 if (spare_memory
[i
])
3469 free (spare_memory
[i
]);
3470 else if (i
>= 1 && i
<= 4)
3471 lisp_align_free (spare_memory
[i
]);
3473 lisp_free (spare_memory
[i
]);
3474 spare_memory
[i
] = 0;
3478 /* This used to call error, but if we've run out of memory, we could
3479 get infinite recursion trying to build the string. */
3480 xsignal (Qnil
, Vmemory_signal_data
);
3483 /* If we released our reserve (due to running out of memory),
3484 and we have a fair amount free once again,
3485 try to set aside another reserve in case we run out once more.
3487 This is called when a relocatable block is freed in ralloc.c,
3488 and also directly from this file, in case we're not using ralloc.c. */
3491 refill_memory_reserve (void)
3493 #ifndef SYSTEM_MALLOC
3494 if (spare_memory
[0] == 0)
3495 spare_memory
[0] = malloc (SPARE_MEMORY
);
3496 if (spare_memory
[1] == 0)
3497 spare_memory
[1] = lisp_align_malloc (sizeof (struct cons_block
),
3499 if (spare_memory
[2] == 0)
3500 spare_memory
[2] = lisp_align_malloc (sizeof (struct cons_block
),
3502 if (spare_memory
[3] == 0)
3503 spare_memory
[3] = lisp_align_malloc (sizeof (struct cons_block
),
3505 if (spare_memory
[4] == 0)
3506 spare_memory
[4] = lisp_align_malloc (sizeof (struct cons_block
),
3508 if (spare_memory
[5] == 0)
3509 spare_memory
[5] = lisp_malloc (sizeof (struct string_block
),
3511 if (spare_memory
[6] == 0)
3512 spare_memory
[6] = lisp_malloc (sizeof (struct string_block
),
3514 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3515 Vmemory_full
= Qnil
;
3519 /************************************************************************
3521 ************************************************************************/
3523 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3525 /* Conservative C stack marking requires a method to identify possibly
3526 live Lisp objects given a pointer value. We do this by keeping
3527 track of blocks of Lisp data that are allocated in a red-black tree
3528 (see also the comment of mem_node which is the type of nodes in
3529 that tree). Function lisp_malloc adds information for an allocated
3530 block to the red-black tree with calls to mem_insert, and function
3531 lisp_free removes it with mem_delete. Functions live_string_p etc
3532 call mem_find to lookup information about a given pointer in the
3533 tree, and use that to determine if the pointer points to a Lisp
3536 /* Initialize this part of alloc.c. */
3541 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3542 mem_z
.parent
= NULL
;
3543 mem_z
.color
= MEM_BLACK
;
3544 mem_z
.start
= mem_z
.end
= NULL
;
3549 /* Value is a pointer to the mem_node containing START. Value is
3550 MEM_NIL if there is no node in the tree containing START. */
3552 static inline struct mem_node
*
3553 mem_find (void *start
)
3557 if (start
< min_heap_address
|| start
> max_heap_address
)
3560 /* Make the search always successful to speed up the loop below. */
3561 mem_z
.start
= start
;
3562 mem_z
.end
= (char *) start
+ 1;
3565 while (start
< p
->start
|| start
>= p
->end
)
3566 p
= start
< p
->start
? p
->left
: p
->right
;
3571 /* Insert a new node into the tree for a block of memory with start
3572 address START, end address END, and type TYPE. Value is a
3573 pointer to the node that was inserted. */
3575 static struct mem_node
*
3576 mem_insert (void *start
, void *end
, enum mem_type type
)
3578 struct mem_node
*c
, *parent
, *x
;
3580 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3581 min_heap_address
= start
;
3582 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3583 max_heap_address
= end
;
3585 /* See where in the tree a node for START belongs. In this
3586 particular application, it shouldn't happen that a node is already
3587 present. For debugging purposes, let's check that. */
3591 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3593 while (c
!= MEM_NIL
)
3595 if (start
>= c
->start
&& start
< c
->end
)
3598 c
= start
< c
->start
? c
->left
: c
->right
;
3601 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3603 while (c
!= MEM_NIL
)
3606 c
= start
< c
->start
? c
->left
: c
->right
;
3609 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3611 /* Create a new node. */
3612 #ifdef GC_MALLOC_CHECK
3613 x
= malloc (sizeof *x
);
3617 x
= xmalloc (sizeof *x
);
3623 x
->left
= x
->right
= MEM_NIL
;
3626 /* Insert it as child of PARENT or install it as root. */
3629 if (start
< parent
->start
)
3637 /* Re-establish red-black tree properties. */
3638 mem_insert_fixup (x
);
3644 /* Re-establish the red-black properties of the tree, and thereby
3645 balance the tree, after node X has been inserted; X is always red. */
3648 mem_insert_fixup (struct mem_node
*x
)
3650 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3652 /* X is red and its parent is red. This is a violation of
3653 red-black tree property #3. */
3655 if (x
->parent
== x
->parent
->parent
->left
)
3657 /* We're on the left side of our grandparent, and Y is our
3659 struct mem_node
*y
= x
->parent
->parent
->right
;
3661 if (y
->color
== MEM_RED
)
3663 /* Uncle and parent are red but should be black because
3664 X is red. Change the colors accordingly and proceed
3665 with the grandparent. */
3666 x
->parent
->color
= MEM_BLACK
;
3667 y
->color
= MEM_BLACK
;
3668 x
->parent
->parent
->color
= MEM_RED
;
3669 x
= x
->parent
->parent
;
3673 /* Parent and uncle have different colors; parent is
3674 red, uncle is black. */
3675 if (x
== x
->parent
->right
)
3678 mem_rotate_left (x
);
3681 x
->parent
->color
= MEM_BLACK
;
3682 x
->parent
->parent
->color
= MEM_RED
;
3683 mem_rotate_right (x
->parent
->parent
);
3688 /* This is the symmetrical case of above. */
3689 struct mem_node
*y
= x
->parent
->parent
->left
;
3691 if (y
->color
== MEM_RED
)
3693 x
->parent
->color
= MEM_BLACK
;
3694 y
->color
= MEM_BLACK
;
3695 x
->parent
->parent
->color
= MEM_RED
;
3696 x
= x
->parent
->parent
;
3700 if (x
== x
->parent
->left
)
3703 mem_rotate_right (x
);
3706 x
->parent
->color
= MEM_BLACK
;
3707 x
->parent
->parent
->color
= MEM_RED
;
3708 mem_rotate_left (x
->parent
->parent
);
3713 /* The root may have been changed to red due to the algorithm. Set
3714 it to black so that property #5 is satisfied. */
3715 mem_root
->color
= MEM_BLACK
;
3726 mem_rotate_left (struct mem_node
*x
)
3730 /* Turn y's left sub-tree into x's right sub-tree. */
3733 if (y
->left
!= MEM_NIL
)
3734 y
->left
->parent
= x
;
3736 /* Y's parent was x's parent. */
3738 y
->parent
= x
->parent
;
3740 /* Get the parent to point to y instead of x. */
3743 if (x
== x
->parent
->left
)
3744 x
->parent
->left
= y
;
3746 x
->parent
->right
= y
;
3751 /* Put x on y's left. */
3765 mem_rotate_right (struct mem_node
*x
)
3767 struct mem_node
*y
= x
->left
;
3770 if (y
->right
!= MEM_NIL
)
3771 y
->right
->parent
= x
;
3774 y
->parent
= x
->parent
;
3777 if (x
== x
->parent
->right
)
3778 x
->parent
->right
= y
;
3780 x
->parent
->left
= y
;
3791 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3794 mem_delete (struct mem_node
*z
)
3796 struct mem_node
*x
, *y
;
3798 if (!z
|| z
== MEM_NIL
)
3801 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3806 while (y
->left
!= MEM_NIL
)
3810 if (y
->left
!= MEM_NIL
)
3815 x
->parent
= y
->parent
;
3818 if (y
== y
->parent
->left
)
3819 y
->parent
->left
= x
;
3821 y
->parent
->right
= x
;
3828 z
->start
= y
->start
;
3833 if (y
->color
== MEM_BLACK
)
3834 mem_delete_fixup (x
);
3836 #ifdef GC_MALLOC_CHECK
3844 /* Re-establish the red-black properties of the tree, after a
3848 mem_delete_fixup (struct mem_node
*x
)
3850 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3852 if (x
== x
->parent
->left
)
3854 struct mem_node
*w
= x
->parent
->right
;
3856 if (w
->color
== MEM_RED
)
3858 w
->color
= MEM_BLACK
;
3859 x
->parent
->color
= MEM_RED
;
3860 mem_rotate_left (x
->parent
);
3861 w
= x
->parent
->right
;
3864 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3871 if (w
->right
->color
== MEM_BLACK
)
3873 w
->left
->color
= MEM_BLACK
;
3875 mem_rotate_right (w
);
3876 w
= x
->parent
->right
;
3878 w
->color
= x
->parent
->color
;
3879 x
->parent
->color
= MEM_BLACK
;
3880 w
->right
->color
= MEM_BLACK
;
3881 mem_rotate_left (x
->parent
);
3887 struct mem_node
*w
= x
->parent
->left
;
3889 if (w
->color
== MEM_RED
)
3891 w
->color
= MEM_BLACK
;
3892 x
->parent
->color
= MEM_RED
;
3893 mem_rotate_right (x
->parent
);
3894 w
= x
->parent
->left
;
3897 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3904 if (w
->left
->color
== MEM_BLACK
)
3906 w
->right
->color
= MEM_BLACK
;
3908 mem_rotate_left (w
);
3909 w
= x
->parent
->left
;
3912 w
->color
= x
->parent
->color
;
3913 x
->parent
->color
= MEM_BLACK
;
3914 w
->left
->color
= MEM_BLACK
;
3915 mem_rotate_right (x
->parent
);
3921 x
->color
= MEM_BLACK
;
3925 /* Value is non-zero if P is a pointer to a live Lisp string on
3926 the heap. M is a pointer to the mem_block for P. */
3929 live_string_p (struct mem_node
*m
, void *p
)
3931 if (m
->type
== MEM_TYPE_STRING
)
3933 struct string_block
*b
= (struct string_block
*) m
->start
;
3934 ptrdiff_t offset
= (char *) p
- (char *) &b
->strings
[0];
3936 /* P must point to the start of a Lisp_String structure, and it
3937 must not be on the free-list. */
3939 && offset
% sizeof b
->strings
[0] == 0
3940 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3941 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3948 /* Value is non-zero if P is a pointer to a live Lisp cons on
3949 the heap. M is a pointer to the mem_block for P. */
3952 live_cons_p (struct mem_node
*m
, void *p
)
3954 if (m
->type
== MEM_TYPE_CONS
)
3956 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3957 ptrdiff_t offset
= (char *) p
- (char *) &b
->conses
[0];
3959 /* P must point to the start of a Lisp_Cons, not be
3960 one of the unused cells in the current cons block,
3961 and not be on the free-list. */
3963 && offset
% sizeof b
->conses
[0] == 0
3964 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3966 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3967 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3974 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3975 the heap. M is a pointer to the mem_block for P. */
3978 live_symbol_p (struct mem_node
*m
, void *p
)
3980 if (m
->type
== MEM_TYPE_SYMBOL
)
3982 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3983 ptrdiff_t offset
= (char *) p
- (char *) &b
->symbols
[0];
3985 /* P must point to the start of a Lisp_Symbol, not be
3986 one of the unused cells in the current symbol block,
3987 and not be on the free-list. */
3989 && offset
% sizeof b
->symbols
[0] == 0
3990 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3991 && (b
!= symbol_block
3992 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3993 && !EQ (((struct Lisp_Symbol
*)p
)->function
, Vdead
));
4000 /* Value is non-zero if P is a pointer to a live Lisp float on
4001 the heap. M is a pointer to the mem_block for P. */
4004 live_float_p (struct mem_node
*m
, void *p
)
4006 if (m
->type
== MEM_TYPE_FLOAT
)
4008 struct float_block
*b
= (struct float_block
*) m
->start
;
4009 ptrdiff_t offset
= (char *) p
- (char *) &b
->floats
[0];
4011 /* P must point to the start of a Lisp_Float and not be
4012 one of the unused cells in the current float block. */
4014 && offset
% sizeof b
->floats
[0] == 0
4015 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
4016 && (b
!= float_block
4017 || offset
/ sizeof b
->floats
[0] < float_block_index
));
4024 /* Value is non-zero if P is a pointer to a live Lisp Misc on
4025 the heap. M is a pointer to the mem_block for P. */
4028 live_misc_p (struct mem_node
*m
, void *p
)
4030 if (m
->type
== MEM_TYPE_MISC
)
4032 struct marker_block
*b
= (struct marker_block
*) m
->start
;
4033 ptrdiff_t offset
= (char *) p
- (char *) &b
->markers
[0];
4035 /* P must point to the start of a Lisp_Misc, not be
4036 one of the unused cells in the current misc block,
4037 and not be on the free-list. */
4039 && offset
% sizeof b
->markers
[0] == 0
4040 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4041 && (b
!= marker_block
4042 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4043 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
4050 /* Value is non-zero if P is a pointer to a live vector-like object.
4051 M is a pointer to the mem_block for P. */
4054 live_vector_p (struct mem_node
*m
, void *p
)
4056 if (m
->type
== MEM_TYPE_VECTOR_BLOCK
)
4058 /* This memory node corresponds to a vector block. */
4059 struct vector_block
*block
= (struct vector_block
*) m
->start
;
4060 struct Lisp_Vector
*vector
= (struct Lisp_Vector
*) block
->data
;
4062 /* P is in the block's allocation range. Scan the block
4063 up to P and see whether P points to the start of some
4064 vector which is not on a free list. FIXME: check whether
4065 some allocation patterns (probably a lot of short vectors)
4066 may cause a substantial overhead of this loop. */
4067 while (VECTOR_IN_BLOCK (vector
, block
)
4068 && vector
<= (struct Lisp_Vector
*) p
)
4070 if (PSEUDOVECTOR_TYPEP (&vector
->header
, PVEC_FREE
))
4071 vector
= ADVANCE (vector
, (vector
->header
.size
4072 & PSEUDOVECTOR_SIZE_MASK
));
4073 else if (vector
== p
)
4076 vector
= ADVANCE (vector
, vector
->header
.next
.nbytes
);
4079 else if (m
->type
== MEM_TYPE_VECTORLIKE
&& p
== m
->start
)
4080 /* This memory node corresponds to a large vector. */
4086 /* Value is non-zero if P is a pointer to a live buffer. M is a
4087 pointer to the mem_block for P. */
4090 live_buffer_p (struct mem_node
*m
, void *p
)
4092 /* P must point to the start of the block, and the buffer
4093 must not have been killed. */
4094 return (m
->type
== MEM_TYPE_BUFFER
4096 && !NILP (((struct buffer
*) p
)->INTERNAL_FIELD (name
)));
4099 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4103 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4105 /* Array of objects that are kept alive because the C stack contains
4106 a pattern that looks like a reference to them . */
4108 #define MAX_ZOMBIES 10
4109 static Lisp_Object zombies
[MAX_ZOMBIES
];
4111 /* Number of zombie objects. */
4113 static EMACS_INT nzombies
;
4115 /* Number of garbage collections. */
4117 static EMACS_INT ngcs
;
4119 /* Average percentage of zombies per collection. */
4121 static double avg_zombies
;
4123 /* Max. number of live and zombie objects. */
4125 static EMACS_INT max_live
, max_zombies
;
4127 /* Average number of live objects per GC. */
4129 static double avg_live
;
4131 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4132 doc
: /* Show information about live and zombie objects. */)
4135 Lisp_Object args
[8], zombie_list
= Qnil
;
4137 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); i
++)
4138 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4139 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4140 args
[1] = make_number (ngcs
);
4141 args
[2] = make_float (avg_live
);
4142 args
[3] = make_float (avg_zombies
);
4143 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4144 args
[5] = make_number (max_live
);
4145 args
[6] = make_number (max_zombies
);
4146 args
[7] = zombie_list
;
4147 return Fmessage (8, args
);
4150 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4153 /* Mark OBJ if we can prove it's a Lisp_Object. */
4156 mark_maybe_object (Lisp_Object obj
)
4164 po
= (void *) XPNTR (obj
);
4171 switch (XTYPE (obj
))
4174 mark_p
= (live_string_p (m
, po
)
4175 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4179 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4183 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4187 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4190 case Lisp_Vectorlike
:
4191 /* Note: can't check BUFFERP before we know it's a
4192 buffer because checking that dereferences the pointer
4193 PO which might point anywhere. */
4194 if (live_vector_p (m
, po
))
4195 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4196 else if (live_buffer_p (m
, po
))
4197 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4201 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4210 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4211 if (nzombies
< MAX_ZOMBIES
)
4212 zombies
[nzombies
] = obj
;
4221 /* If P points to Lisp data, mark that as live if it isn't already
4225 mark_maybe_pointer (void *p
)
4229 /* Quickly rule out some values which can't point to Lisp data.
4230 USE_LSB_TAG needs Lisp data to be aligned on multiples of GCALIGNMENT.
4231 Otherwise, assume that Lisp data is aligned on even addresses. */
4232 if ((intptr_t) p
% (USE_LSB_TAG
? GCALIGNMENT
: 2))
4238 Lisp_Object obj
= Qnil
;
4242 case MEM_TYPE_NON_LISP
:
4243 case MEM_TYPE_SPARE
:
4244 /* Nothing to do; not a pointer to Lisp memory. */
4247 case MEM_TYPE_BUFFER
:
4248 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P ((struct buffer
*)p
))
4249 XSETVECTOR (obj
, p
);
4253 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4257 case MEM_TYPE_STRING
:
4258 if (live_string_p (m
, p
)
4259 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4260 XSETSTRING (obj
, p
);
4264 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4268 case MEM_TYPE_SYMBOL
:
4269 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4270 XSETSYMBOL (obj
, p
);
4273 case MEM_TYPE_FLOAT
:
4274 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4278 case MEM_TYPE_VECTORLIKE
:
4279 case MEM_TYPE_VECTOR_BLOCK
:
4280 if (live_vector_p (m
, p
))
4283 XSETVECTOR (tem
, p
);
4284 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4299 /* Alignment of pointer values. Use alignof, as it sometimes returns
4300 a smaller alignment than GCC's __alignof__ and mark_memory might
4301 miss objects if __alignof__ were used. */
4302 #define GC_POINTER_ALIGNMENT alignof (void *)
4304 /* Define POINTERS_MIGHT_HIDE_IN_OBJECTS to 1 if marking via C pointers does
4305 not suffice, which is the typical case. A host where a Lisp_Object is
4306 wider than a pointer might allocate a Lisp_Object in non-adjacent halves.
4307 If USE_LSB_TAG, the bottom half is not a valid pointer, but it should
4308 suffice to widen it to to a Lisp_Object and check it that way. */
4309 #if USE_LSB_TAG || VAL_MAX < UINTPTR_MAX
4310 # if !USE_LSB_TAG && VAL_MAX < UINTPTR_MAX >> GCTYPEBITS
4311 /* If tag bits straddle pointer-word boundaries, neither mark_maybe_pointer
4312 nor mark_maybe_object can follow the pointers. This should not occur on
4313 any practical porting target. */
4314 # error "MSB type bits straddle pointer-word boundaries"
4316 /* Marking via C pointers does not suffice, because Lisp_Objects contain
4317 pointer words that hold pointers ORed with type bits. */
4318 # define POINTERS_MIGHT_HIDE_IN_OBJECTS 1
4320 /* Marking via C pointers suffices, because Lisp_Objects contain pointer
4321 words that hold unmodified pointers. */
4322 # define POINTERS_MIGHT_HIDE_IN_OBJECTS 0
4325 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4326 or END+OFFSET..START. */
4329 mark_memory (void *start
, void *end
)
4330 #if defined (__clang__) && defined (__has_feature)
4331 #if __has_feature(address_sanitizer)
4332 /* Do not allow -faddress-sanitizer to check this function, since it
4333 crosses the function stack boundary, and thus would yield many
4335 __attribute__((no_address_safety_analysis
))
4342 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4346 /* Make START the pointer to the start of the memory region,
4347 if it isn't already. */
4355 /* Mark Lisp data pointed to. This is necessary because, in some
4356 situations, the C compiler optimizes Lisp objects away, so that
4357 only a pointer to them remains. Example:
4359 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4362 Lisp_Object obj = build_string ("test");
4363 struct Lisp_String *s = XSTRING (obj);
4364 Fgarbage_collect ();
4365 fprintf (stderr, "test `%s'\n", s->data);
4369 Here, `obj' isn't really used, and the compiler optimizes it
4370 away. The only reference to the life string is through the
4373 for (pp
= start
; (void *) pp
< end
; pp
++)
4374 for (i
= 0; i
< sizeof *pp
; i
+= GC_POINTER_ALIGNMENT
)
4376 void *p
= *(void **) ((char *) pp
+ i
);
4377 mark_maybe_pointer (p
);
4378 if (POINTERS_MIGHT_HIDE_IN_OBJECTS
)
4379 mark_maybe_object (XIL ((intptr_t) p
));
4383 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4384 the GCC system configuration. In gcc 3.2, the only systems for
4385 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4386 by others?) and ns32k-pc532-min. */
4388 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4390 static bool setjmp_tested_p
;
4391 static int longjmps_done
;
4393 #define SETJMP_WILL_LIKELY_WORK "\
4395 Emacs garbage collector has been changed to use conservative stack\n\
4396 marking. Emacs has determined that the method it uses to do the\n\
4397 marking will likely work on your system, but this isn't sure.\n\
4399 If you are a system-programmer, or can get the help of a local wizard\n\
4400 who is, please take a look at the function mark_stack in alloc.c, and\n\
4401 verify that the methods used are appropriate for your system.\n\
4403 Please mail the result to <emacs-devel@gnu.org>.\n\
4406 #define SETJMP_WILL_NOT_WORK "\
4408 Emacs garbage collector has been changed to use conservative stack\n\
4409 marking. Emacs has determined that the default method it uses to do the\n\
4410 marking will not work on your system. We will need a system-dependent\n\
4411 solution for your system.\n\
4413 Please take a look at the function mark_stack in alloc.c, and\n\
4414 try to find a way to make it work on your system.\n\
4416 Note that you may get false negatives, depending on the compiler.\n\
4417 In particular, you need to use -O with GCC for this test.\n\
4419 Please mail the result to <emacs-devel@gnu.org>.\n\
4423 /* Perform a quick check if it looks like setjmp saves registers in a
4424 jmp_buf. Print a message to stderr saying so. When this test
4425 succeeds, this is _not_ a proof that setjmp is sufficient for
4426 conservative stack marking. Only the sources or a disassembly
4436 /* Arrange for X to be put in a register. */
4442 if (longjmps_done
== 1)
4444 /* Came here after the longjmp at the end of the function.
4446 If x == 1, the longjmp has restored the register to its
4447 value before the setjmp, and we can hope that setjmp
4448 saves all such registers in the jmp_buf, although that
4451 For other values of X, either something really strange is
4452 taking place, or the setjmp just didn't save the register. */
4455 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4458 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4465 if (longjmps_done
== 1)
4466 sys_longjmp (jbuf
, 1);
4469 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4472 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4474 /* Abort if anything GCPRO'd doesn't survive the GC. */
4482 for (p
= gcprolist
; p
; p
= p
->next
)
4483 for (i
= 0; i
< p
->nvars
; ++i
)
4484 if (!survives_gc_p (p
->var
[i
]))
4485 /* FIXME: It's not necessarily a bug. It might just be that the
4486 GCPRO is unnecessary or should release the object sooner. */
4490 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4497 fprintf (stderr
, "\nZombies kept alive = %"pI
"d:\n", nzombies
);
4498 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4500 fprintf (stderr
, " %d = ", i
);
4501 debug_print (zombies
[i
]);
4505 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4508 /* Mark live Lisp objects on the C stack.
4510 There are several system-dependent problems to consider when
4511 porting this to new architectures:
4515 We have to mark Lisp objects in CPU registers that can hold local
4516 variables or are used to pass parameters.
4518 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4519 something that either saves relevant registers on the stack, or
4520 calls mark_maybe_object passing it each register's contents.
4522 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4523 implementation assumes that calling setjmp saves registers we need
4524 to see in a jmp_buf which itself lies on the stack. This doesn't
4525 have to be true! It must be verified for each system, possibly
4526 by taking a look at the source code of setjmp.
4528 If __builtin_unwind_init is available (defined by GCC >= 2.8) we
4529 can use it as a machine independent method to store all registers
4530 to the stack. In this case the macros described in the previous
4531 two paragraphs are not used.
4535 Architectures differ in the way their processor stack is organized.
4536 For example, the stack might look like this
4539 | Lisp_Object | size = 4
4541 | something else | size = 2
4543 | Lisp_Object | size = 4
4547 In such a case, not every Lisp_Object will be aligned equally. To
4548 find all Lisp_Object on the stack it won't be sufficient to walk
4549 the stack in steps of 4 bytes. Instead, two passes will be
4550 necessary, one starting at the start of the stack, and a second
4551 pass starting at the start of the stack + 2. Likewise, if the
4552 minimal alignment of Lisp_Objects on the stack is 1, four passes
4553 would be necessary, each one starting with one byte more offset
4554 from the stack start. */
4561 #ifdef HAVE___BUILTIN_UNWIND_INIT
4562 /* Force callee-saved registers and register windows onto the stack.
4563 This is the preferred method if available, obviating the need for
4564 machine dependent methods. */
4565 __builtin_unwind_init ();
4567 #else /* not HAVE___BUILTIN_UNWIND_INIT */
4568 #ifndef GC_SAVE_REGISTERS_ON_STACK
4569 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4570 union aligned_jmpbuf
{
4574 volatile bool stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4576 /* This trick flushes the register windows so that all the state of
4577 the process is contained in the stack. */
4578 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4579 needed on ia64 too. See mach_dep.c, where it also says inline
4580 assembler doesn't work with relevant proprietary compilers. */
4582 #if defined (__sparc64__) && defined (__FreeBSD__)
4583 /* FreeBSD does not have a ta 3 handler. */
4590 /* Save registers that we need to see on the stack. We need to see
4591 registers used to hold register variables and registers used to
4593 #ifdef GC_SAVE_REGISTERS_ON_STACK
4594 GC_SAVE_REGISTERS_ON_STACK (end
);
4595 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4597 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4598 setjmp will definitely work, test it
4599 and print a message with the result
4601 if (!setjmp_tested_p
)
4603 setjmp_tested_p
= 1;
4606 #endif /* GC_SETJMP_WORKS */
4609 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4610 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4611 #endif /* not HAVE___BUILTIN_UNWIND_INIT */
4613 /* This assumes that the stack is a contiguous region in memory. If
4614 that's not the case, something has to be done here to iterate
4615 over the stack segments. */
4616 mark_memory (stack_base
, end
);
4618 /* Allow for marking a secondary stack, like the register stack on the
4620 #ifdef GC_MARK_SECONDARY_STACK
4621 GC_MARK_SECONDARY_STACK ();
4624 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4629 #endif /* GC_MARK_STACK != 0 */
4632 /* Determine whether it is safe to access memory at address P. */
4634 valid_pointer_p (void *p
)
4637 return w32_valid_pointer_p (p
, 16);
4641 /* Obviously, we cannot just access it (we would SEGV trying), so we
4642 trick the o/s to tell us whether p is a valid pointer.
4643 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4644 not validate p in that case. */
4648 bool valid
= emacs_write (fd
[1], (char *) p
, 16) == 16;
4649 emacs_close (fd
[1]);
4650 emacs_close (fd
[0]);
4658 /* Return 2 if OBJ is a killed or special buffer object.
4659 Return 1 if OBJ is a valid lisp object.
4660 Return 0 if OBJ is NOT a valid lisp object.
4661 Return -1 if we cannot validate OBJ.
4662 This function can be quite slow,
4663 so it should only be used in code for manual debugging. */
4666 valid_lisp_object_p (Lisp_Object obj
)
4676 p
= (void *) XPNTR (obj
);
4677 if (PURE_POINTER_P (p
))
4680 if (p
== &buffer_defaults
|| p
== &buffer_local_symbols
)
4684 return valid_pointer_p (p
);
4691 int valid
= valid_pointer_p (p
);
4703 case MEM_TYPE_NON_LISP
:
4704 case MEM_TYPE_SPARE
:
4707 case MEM_TYPE_BUFFER
:
4708 return live_buffer_p (m
, p
) ? 1 : 2;
4711 return live_cons_p (m
, p
);
4713 case MEM_TYPE_STRING
:
4714 return live_string_p (m
, p
);
4717 return live_misc_p (m
, p
);
4719 case MEM_TYPE_SYMBOL
:
4720 return live_symbol_p (m
, p
);
4722 case MEM_TYPE_FLOAT
:
4723 return live_float_p (m
, p
);
4725 case MEM_TYPE_VECTORLIKE
:
4726 case MEM_TYPE_VECTOR_BLOCK
:
4727 return live_vector_p (m
, p
);
4740 /***********************************************************************
4741 Pure Storage Management
4742 ***********************************************************************/
4744 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4745 pointer to it. TYPE is the Lisp type for which the memory is
4746 allocated. TYPE < 0 means it's not used for a Lisp object. */
4749 pure_alloc (size_t size
, int type
)
4753 size_t alignment
= GCALIGNMENT
;
4755 size_t alignment
= alignof (EMACS_INT
);
4757 /* Give Lisp_Floats an extra alignment. */
4758 if (type
== Lisp_Float
)
4759 alignment
= alignof (struct Lisp_Float
);
4765 /* Allocate space for a Lisp object from the beginning of the free
4766 space with taking account of alignment. */
4767 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4768 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4772 /* Allocate space for a non-Lisp object from the end of the free
4774 pure_bytes_used_non_lisp
+= size
;
4775 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4777 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4779 if (pure_bytes_used
<= pure_size
)
4782 /* Don't allocate a large amount here,
4783 because it might get mmap'd and then its address
4784 might not be usable. */
4785 purebeg
= xmalloc (10000);
4787 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4788 pure_bytes_used
= 0;
4789 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4794 /* Print a warning if PURESIZE is too small. */
4797 check_pure_size (void)
4799 if (pure_bytes_used_before_overflow
)
4800 message (("emacs:0:Pure Lisp storage overflow (approx. %"pI
"d"
4802 pure_bytes_used
+ pure_bytes_used_before_overflow
);
4806 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4807 the non-Lisp data pool of the pure storage, and return its start
4808 address. Return NULL if not found. */
4811 find_string_data_in_pure (const char *data
, ptrdiff_t nbytes
)
4814 ptrdiff_t skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4815 const unsigned char *p
;
4818 if (pure_bytes_used_non_lisp
<= nbytes
)
4821 /* Set up the Boyer-Moore table. */
4823 for (i
= 0; i
< 256; i
++)
4826 p
= (const unsigned char *) data
;
4828 bm_skip
[*p
++] = skip
;
4830 last_char_skip
= bm_skip
['\0'];
4832 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4833 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4835 /* See the comments in the function `boyer_moore' (search.c) for the
4836 use of `infinity'. */
4837 infinity
= pure_bytes_used_non_lisp
+ 1;
4838 bm_skip
['\0'] = infinity
;
4840 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
4844 /* Check the last character (== '\0'). */
4847 start
+= bm_skip
[*(p
+ start
)];
4849 while (start
<= start_max
);
4851 if (start
< infinity
)
4852 /* Couldn't find the last character. */
4855 /* No less than `infinity' means we could find the last
4856 character at `p[start - infinity]'. */
4859 /* Check the remaining characters. */
4860 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4862 return non_lisp_beg
+ start
;
4864 start
+= last_char_skip
;
4866 while (start
<= start_max
);
4872 /* Return a string allocated in pure space. DATA is a buffer holding
4873 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4874 means make the result string multibyte.
4876 Must get an error if pure storage is full, since if it cannot hold
4877 a large string it may be able to hold conses that point to that
4878 string; then the string is not protected from gc. */
4881 make_pure_string (const char *data
,
4882 ptrdiff_t nchars
, ptrdiff_t nbytes
, bool multibyte
)
4885 struct Lisp_String
*s
= pure_alloc (sizeof *s
, Lisp_String
);
4886 s
->data
= (unsigned char *) find_string_data_in_pure (data
, nbytes
);
4887 if (s
->data
== NULL
)
4889 s
->data
= pure_alloc (nbytes
+ 1, -1);
4890 memcpy (s
->data
, data
, nbytes
);
4891 s
->data
[nbytes
] = '\0';
4894 s
->size_byte
= multibyte
? nbytes
: -1;
4895 s
->intervals
= NULL
;
4896 XSETSTRING (string
, s
);
4900 /* Return a string allocated in pure space. Do not
4901 allocate the string data, just point to DATA. */
4904 make_pure_c_string (const char *data
, ptrdiff_t nchars
)
4907 struct Lisp_String
*s
= pure_alloc (sizeof *s
, Lisp_String
);
4910 s
->data
= (unsigned char *) data
;
4911 s
->intervals
= NULL
;
4912 XSETSTRING (string
, s
);
4916 /* Return a cons allocated from pure space. Give it pure copies
4917 of CAR as car and CDR as cdr. */
4920 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
4923 struct Lisp_Cons
*p
= pure_alloc (sizeof *p
, Lisp_Cons
);
4925 XSETCAR (new, Fpurecopy (car
));
4926 XSETCDR (new, Fpurecopy (cdr
));
4931 /* Value is a float object with value NUM allocated from pure space. */
4934 make_pure_float (double num
)
4937 struct Lisp_Float
*p
= pure_alloc (sizeof *p
, Lisp_Float
);
4939 XFLOAT_INIT (new, num
);
4944 /* Return a vector with room for LEN Lisp_Objects allocated from
4948 make_pure_vector (ptrdiff_t len
)
4951 size_t size
= header_size
+ len
* word_size
;
4952 struct Lisp_Vector
*p
= pure_alloc (size
, Lisp_Vectorlike
);
4953 XSETVECTOR (new, p
);
4954 XVECTOR (new)->header
.size
= len
;
4959 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4960 doc
: /* Make a copy of object OBJ in pure storage.
4961 Recursively copies contents of vectors and cons cells.
4962 Does not copy symbols. Copies strings without text properties. */)
4963 (register Lisp_Object obj
)
4965 if (NILP (Vpurify_flag
))
4968 if (PURE_POINTER_P (XPNTR (obj
)))
4971 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4973 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
4979 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
4980 else if (FLOATP (obj
))
4981 obj
= make_pure_float (XFLOAT_DATA (obj
));
4982 else if (STRINGP (obj
))
4983 obj
= make_pure_string (SSDATA (obj
), SCHARS (obj
),
4985 STRING_MULTIBYTE (obj
));
4986 else if (COMPILEDP (obj
) || VECTORP (obj
))
4988 register struct Lisp_Vector
*vec
;
4989 register ptrdiff_t i
;
4993 if (size
& PSEUDOVECTOR_FLAG
)
4994 size
&= PSEUDOVECTOR_SIZE_MASK
;
4995 vec
= XVECTOR (make_pure_vector (size
));
4996 for (i
= 0; i
< size
; i
++)
4997 vec
->contents
[i
] = Fpurecopy (AREF (obj
, i
));
4998 if (COMPILEDP (obj
))
5000 XSETPVECTYPE (vec
, PVEC_COMPILED
);
5001 XSETCOMPILED (obj
, vec
);
5004 XSETVECTOR (obj
, vec
);
5006 else if (MARKERP (obj
))
5007 error ("Attempt to copy a marker to pure storage");
5009 /* Not purified, don't hash-cons. */
5012 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
5013 Fputhash (obj
, obj
, Vpurify_flag
);
5020 /***********************************************************************
5022 ***********************************************************************/
5024 /* Put an entry in staticvec, pointing at the variable with address
5028 staticpro (Lisp_Object
*varaddress
)
5030 staticvec
[staticidx
++] = varaddress
;
5031 if (staticidx
>= NSTATICS
)
5036 /***********************************************************************
5038 ***********************************************************************/
5040 /* Temporarily prevent garbage collection. */
5043 inhibit_garbage_collection (void)
5045 ptrdiff_t count
= SPECPDL_INDEX ();
5047 specbind (Qgc_cons_threshold
, make_number (MOST_POSITIVE_FIXNUM
));
5051 /* Used to avoid possible overflows when
5052 converting from C to Lisp integers. */
5054 static inline Lisp_Object
5055 bounded_number (EMACS_INT number
)
5057 return make_number (min (MOST_POSITIVE_FIXNUM
, number
));
5060 /* Calculate total bytes of live objects. */
5063 total_bytes_of_live_objects (void)
5066 tot
+= total_conses
* sizeof (struct Lisp_Cons
);
5067 tot
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5068 tot
+= total_markers
* sizeof (union Lisp_Misc
);
5069 tot
+= total_string_bytes
;
5070 tot
+= total_vector_slots
* word_size
;
5071 tot
+= total_floats
* sizeof (struct Lisp_Float
);
5072 tot
+= total_intervals
* sizeof (struct interval
);
5073 tot
+= total_strings
* sizeof (struct Lisp_String
);
5077 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
5078 doc
: /* Reclaim storage for Lisp objects no longer needed.
5079 Garbage collection happens automatically if you cons more than
5080 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
5081 `garbage-collect' normally returns a list with info on amount of space in use,
5082 where each entry has the form (NAME SIZE USED FREE), where:
5083 - NAME is a symbol describing the kind of objects this entry represents,
5084 - SIZE is the number of bytes used by each one,
5085 - USED is the number of those objects that were found live in the heap,
5086 - FREE is the number of those objects that are not live but that Emacs
5087 keeps around for future allocations (maybe because it does not know how
5088 to return them to the OS).
5089 However, if there was overflow in pure space, `garbage-collect'
5090 returns nil, because real GC can't be done.
5091 See Info node `(elisp)Garbage Collection'. */)
5094 struct specbinding
*bind
;
5095 struct buffer
*nextb
;
5096 char stack_top_variable
;
5099 ptrdiff_t count
= SPECPDL_INDEX ();
5101 Lisp_Object retval
= Qnil
;
5102 size_t tot_before
= 0;
5103 struct backtrace backtrace
;
5108 /* Can't GC if pure storage overflowed because we can't determine
5109 if something is a pure object or not. */
5110 if (pure_bytes_used_before_overflow
)
5113 /* Record this function, so it appears on the profiler's backtraces. */
5114 backtrace
.next
= backtrace_list
;
5115 backtrace
.function
= Qautomatic_gc
;
5116 backtrace
.args
= &Qnil
;
5117 backtrace
.nargs
= 0;
5118 backtrace
.debug_on_exit
= 0;
5119 backtrace_list
= &backtrace
;
5123 /* Don't keep undo information around forever.
5124 Do this early on, so it is no problem if the user quits. */
5125 FOR_EACH_BUFFER (nextb
)
5126 compact_buffer (nextb
);
5128 if (profiler_memory_running
)
5129 tot_before
= total_bytes_of_live_objects ();
5131 start
= current_emacs_time ();
5133 /* In case user calls debug_print during GC,
5134 don't let that cause a recursive GC. */
5135 consing_since_gc
= 0;
5137 /* Save what's currently displayed in the echo area. */
5138 message_p
= push_message ();
5139 record_unwind_protect (pop_message_unwind
, Qnil
);
5141 /* Save a copy of the contents of the stack, for debugging. */
5142 #if MAX_SAVE_STACK > 0
5143 if (NILP (Vpurify_flag
))
5146 ptrdiff_t stack_size
;
5147 if (&stack_top_variable
< stack_bottom
)
5149 stack
= &stack_top_variable
;
5150 stack_size
= stack_bottom
- &stack_top_variable
;
5154 stack
= stack_bottom
;
5155 stack_size
= &stack_top_variable
- stack_bottom
;
5157 if (stack_size
<= MAX_SAVE_STACK
)
5159 if (stack_copy_size
< stack_size
)
5161 stack_copy
= xrealloc (stack_copy
, stack_size
);
5162 stack_copy_size
= stack_size
;
5164 memcpy (stack_copy
, stack
, stack_size
);
5167 #endif /* MAX_SAVE_STACK > 0 */
5169 if (garbage_collection_messages
)
5170 message1_nolog ("Garbage collecting...");
5174 shrink_regexp_cache ();
5178 /* Mark all the special slots that serve as the roots of accessibility. */
5180 mark_buffer (&buffer_defaults
);
5181 mark_buffer (&buffer_local_symbols
);
5183 for (i
= 0; i
< staticidx
; i
++)
5184 mark_object (*staticvec
[i
]);
5186 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
5188 mark_object (bind
->symbol
);
5189 mark_object (bind
->old_value
);
5198 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5199 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5203 register struct gcpro
*tail
;
5204 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5205 for (i
= 0; i
< tail
->nvars
; i
++)
5206 mark_object (tail
->var
[i
]);
5210 struct catchtag
*catch;
5211 struct handler
*handler
;
5213 for (catch = catchlist
; catch; catch = catch->next
)
5215 mark_object (catch->tag
);
5216 mark_object (catch->val
);
5218 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5220 mark_object (handler
->handler
);
5221 mark_object (handler
->var
);
5227 #ifdef HAVE_WINDOW_SYSTEM
5228 mark_fringe_data ();
5231 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5235 /* Everything is now marked, except for the things that require special
5236 finalization, i.e. the undo_list.
5237 Look thru every buffer's undo list
5238 for elements that update markers that were not marked,
5240 FOR_EACH_BUFFER (nextb
)
5242 /* If a buffer's undo list is Qt, that means that undo is
5243 turned off in that buffer. Calling truncate_undo_list on
5244 Qt tends to return NULL, which effectively turns undo back on.
5245 So don't call truncate_undo_list if undo_list is Qt. */
5246 if (! EQ (nextb
->INTERNAL_FIELD (undo_list
), Qt
))
5248 Lisp_Object tail
, prev
;
5249 tail
= nextb
->INTERNAL_FIELD (undo_list
);
5251 while (CONSP (tail
))
5253 if (CONSP (XCAR (tail
))
5254 && MARKERP (XCAR (XCAR (tail
)))
5255 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5258 nextb
->INTERNAL_FIELD (undo_list
) = tail
= XCDR (tail
);
5262 XSETCDR (prev
, tail
);
5272 /* Now that we have stripped the elements that need not be in the
5273 undo_list any more, we can finally mark the list. */
5274 mark_object (nextb
->INTERNAL_FIELD (undo_list
));
5279 /* Clear the mark bits that we set in certain root slots. */
5281 unmark_byte_stack ();
5282 VECTOR_UNMARK (&buffer_defaults
);
5283 VECTOR_UNMARK (&buffer_local_symbols
);
5285 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5295 consing_since_gc
= 0;
5296 if (gc_cons_threshold
< GC_DEFAULT_THRESHOLD
/ 10)
5297 gc_cons_threshold
= GC_DEFAULT_THRESHOLD
/ 10;
5299 gc_relative_threshold
= 0;
5300 if (FLOATP (Vgc_cons_percentage
))
5301 { /* Set gc_cons_combined_threshold. */
5302 double tot
= total_bytes_of_live_objects ();
5304 tot
*= XFLOAT_DATA (Vgc_cons_percentage
);
5307 if (tot
< TYPE_MAXIMUM (EMACS_INT
))
5308 gc_relative_threshold
= tot
;
5310 gc_relative_threshold
= TYPE_MAXIMUM (EMACS_INT
);
5314 if (garbage_collection_messages
)
5316 if (message_p
|| minibuf_level
> 0)
5319 message1_nolog ("Garbage collecting...done");
5322 unbind_to (count
, Qnil
);
5324 Lisp_Object total
[11];
5325 int total_size
= 10;
5327 total
[0] = list4 (Qconses
, make_number (sizeof (struct Lisp_Cons
)),
5328 bounded_number (total_conses
),
5329 bounded_number (total_free_conses
));
5331 total
[1] = list4 (Qsymbols
, make_number (sizeof (struct Lisp_Symbol
)),
5332 bounded_number (total_symbols
),
5333 bounded_number (total_free_symbols
));
5335 total
[2] = list4 (Qmiscs
, make_number (sizeof (union Lisp_Misc
)),
5336 bounded_number (total_markers
),
5337 bounded_number (total_free_markers
));
5339 total
[3] = list4 (Qstrings
, make_number (sizeof (struct Lisp_String
)),
5340 bounded_number (total_strings
),
5341 bounded_number (total_free_strings
));
5343 total
[4] = list3 (Qstring_bytes
, make_number (1),
5344 bounded_number (total_string_bytes
));
5346 total
[5] = list3 (Qvectors
, make_number (sizeof (struct Lisp_Vector
)),
5347 bounded_number (total_vectors
));
5349 total
[6] = list4 (Qvector_slots
, make_number (word_size
),
5350 bounded_number (total_vector_slots
),
5351 bounded_number (total_free_vector_slots
));
5353 total
[7] = list4 (Qfloats
, make_number (sizeof (struct Lisp_Float
)),
5354 bounded_number (total_floats
),
5355 bounded_number (total_free_floats
));
5357 total
[8] = list4 (Qintervals
, make_number (sizeof (struct interval
)),
5358 bounded_number (total_intervals
),
5359 bounded_number (total_free_intervals
));
5361 total
[9] = list3 (Qbuffers
, make_number (sizeof (struct buffer
)),
5362 bounded_number (total_buffers
));
5364 #ifdef DOUG_LEA_MALLOC
5366 total
[10] = list4 (Qheap
, make_number (1024),
5367 bounded_number ((mallinfo ().uordblks
+ 1023) >> 10),
5368 bounded_number ((mallinfo ().fordblks
+ 1023) >> 10));
5370 retval
= Flist (total_size
, total
);
5373 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5375 /* Compute average percentage of zombies. */
5377 = (total_conses
+ total_symbols
+ total_markers
+ total_strings
5378 + total_vectors
+ total_floats
+ total_intervals
+ total_buffers
);
5380 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5381 max_live
= max (nlive
, max_live
);
5382 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5383 max_zombies
= max (nzombies
, max_zombies
);
5388 if (!NILP (Vpost_gc_hook
))
5390 ptrdiff_t gc_count
= inhibit_garbage_collection ();
5391 safe_run_hooks (Qpost_gc_hook
);
5392 unbind_to (gc_count
, Qnil
);
5395 /* Accumulate statistics. */
5396 if (FLOATP (Vgc_elapsed
))
5398 EMACS_TIME since_start
= sub_emacs_time (current_emacs_time (), start
);
5399 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
)
5400 + EMACS_TIME_TO_DOUBLE (since_start
));
5405 /* Collect profiling data. */
5406 if (profiler_memory_running
)
5409 size_t tot_after
= total_bytes_of_live_objects ();
5410 if (tot_before
> tot_after
)
5411 swept
= tot_before
- tot_after
;
5412 malloc_probe (swept
);
5415 backtrace_list
= backtrace
.next
;
5420 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5421 only interesting objects referenced from glyphs are strings. */
5424 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5426 struct glyph_row
*row
= matrix
->rows
;
5427 struct glyph_row
*end
= row
+ matrix
->nrows
;
5429 for (; row
< end
; ++row
)
5433 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5435 struct glyph
*glyph
= row
->glyphs
[area
];
5436 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5438 for (; glyph
< end_glyph
; ++glyph
)
5439 if (STRINGP (glyph
->object
)
5440 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5441 mark_object (glyph
->object
);
5447 /* Mark Lisp faces in the face cache C. */
5450 mark_face_cache (struct face_cache
*c
)
5455 for (i
= 0; i
< c
->used
; ++i
)
5457 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5461 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5462 mark_object (face
->lface
[j
]);
5470 /* Mark reference to a Lisp_Object.
5471 If the object referred to has not been seen yet, recursively mark
5472 all the references contained in it. */
5474 #define LAST_MARKED_SIZE 500
5475 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5476 static int last_marked_index
;
5478 /* For debugging--call abort when we cdr down this many
5479 links of a list, in mark_object. In debugging,
5480 the call to abort will hit a breakpoint.
5481 Normally this is zero and the check never goes off. */
5482 ptrdiff_t mark_object_loop_halt EXTERNALLY_VISIBLE
;
5485 mark_vectorlike (struct Lisp_Vector
*ptr
)
5487 ptrdiff_t size
= ptr
->header
.size
;
5490 eassert (!VECTOR_MARKED_P (ptr
));
5491 VECTOR_MARK (ptr
); /* Else mark it. */
5492 if (size
& PSEUDOVECTOR_FLAG
)
5493 size
&= PSEUDOVECTOR_SIZE_MASK
;
5495 /* Note that this size is not the memory-footprint size, but only
5496 the number of Lisp_Object fields that we should trace.
5497 The distinction is used e.g. by Lisp_Process which places extra
5498 non-Lisp_Object fields at the end of the structure... */
5499 for (i
= 0; i
< size
; i
++) /* ...and then mark its elements. */
5500 mark_object (ptr
->contents
[i
]);
5503 /* Like mark_vectorlike but optimized for char-tables (and
5504 sub-char-tables) assuming that the contents are mostly integers or
5508 mark_char_table (struct Lisp_Vector
*ptr
)
5510 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5513 eassert (!VECTOR_MARKED_P (ptr
));
5515 for (i
= 0; i
< size
; i
++)
5517 Lisp_Object val
= ptr
->contents
[i
];
5519 if (INTEGERP (val
) || (SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
))
5521 if (SUB_CHAR_TABLE_P (val
))
5523 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5524 mark_char_table (XVECTOR (val
));
5531 /* Mark the chain of overlays starting at PTR. */
5534 mark_overlay (struct Lisp_Overlay
*ptr
)
5536 for (; ptr
&& !ptr
->gcmarkbit
; ptr
= ptr
->next
)
5539 mark_object (ptr
->start
);
5540 mark_object (ptr
->end
);
5541 mark_object (ptr
->plist
);
5545 /* Mark Lisp_Objects and special pointers in BUFFER. */
5548 mark_buffer (struct buffer
*buffer
)
5550 /* This is handled much like other pseudovectors... */
5551 mark_vectorlike ((struct Lisp_Vector
*) buffer
);
5553 /* ...but there are some buffer-specific things. */
5555 MARK_INTERVAL_TREE (buffer_intervals (buffer
));
5557 /* For now, we just don't mark the undo_list. It's done later in
5558 a special way just before the sweep phase, and after stripping
5559 some of its elements that are not needed any more. */
5561 mark_overlay (buffer
->overlays_before
);
5562 mark_overlay (buffer
->overlays_after
);
5564 /* If this is an indirect buffer, mark its base buffer. */
5565 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5566 mark_buffer (buffer
->base_buffer
);
5569 /* Remove killed buffers or items whose car is a killed buffer from
5570 LIST, and mark other items. Return changed LIST, which is marked. */
5573 mark_discard_killed_buffers (Lisp_Object list
)
5575 Lisp_Object tail
, *prev
= &list
;
5577 for (tail
= list
; CONSP (tail
) && !CONS_MARKED_P (XCONS (tail
));
5580 Lisp_Object tem
= XCAR (tail
);
5583 if (BUFFERP (tem
) && !BUFFER_LIVE_P (XBUFFER (tem
)))
5584 *prev
= XCDR (tail
);
5587 CONS_MARK (XCONS (tail
));
5588 mark_object (XCAR (tail
));
5589 prev
= &XCDR_AS_LVALUE (tail
);
5596 /* Determine type of generic Lisp_Object and mark it accordingly. */
5599 mark_object (Lisp_Object arg
)
5601 register Lisp_Object obj
= arg
;
5602 #ifdef GC_CHECK_MARKED_OBJECTS
5606 ptrdiff_t cdr_count
= 0;
5610 if (PURE_POINTER_P (XPNTR (obj
)))
5613 last_marked
[last_marked_index
++] = obj
;
5614 if (last_marked_index
== LAST_MARKED_SIZE
)
5615 last_marked_index
= 0;
5617 /* Perform some sanity checks on the objects marked here. Abort if
5618 we encounter an object we know is bogus. This increases GC time
5619 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5620 #ifdef GC_CHECK_MARKED_OBJECTS
5622 po
= (void *) XPNTR (obj
);
5624 /* Check that the object pointed to by PO is known to be a Lisp
5625 structure allocated from the heap. */
5626 #define CHECK_ALLOCATED() \
5628 m = mem_find (po); \
5633 /* Check that the object pointed to by PO is live, using predicate
5635 #define CHECK_LIVE(LIVEP) \
5637 if (!LIVEP (m, po)) \
5641 /* Check both of the above conditions. */
5642 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5644 CHECK_ALLOCATED (); \
5645 CHECK_LIVE (LIVEP); \
5648 #else /* not GC_CHECK_MARKED_OBJECTS */
5650 #define CHECK_LIVE(LIVEP) (void) 0
5651 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5653 #endif /* not GC_CHECK_MARKED_OBJECTS */
5655 switch (XTYPE (obj
))
5659 register struct Lisp_String
*ptr
= XSTRING (obj
);
5660 if (STRING_MARKED_P (ptr
))
5662 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5664 MARK_INTERVAL_TREE (ptr
->intervals
);
5665 #ifdef GC_CHECK_STRING_BYTES
5666 /* Check that the string size recorded in the string is the
5667 same as the one recorded in the sdata structure. */
5669 #endif /* GC_CHECK_STRING_BYTES */
5673 case Lisp_Vectorlike
:
5675 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5676 register ptrdiff_t pvectype
;
5678 if (VECTOR_MARKED_P (ptr
))
5681 #ifdef GC_CHECK_MARKED_OBJECTS
5683 if (m
== MEM_NIL
&& !SUBRP (obj
))
5685 #endif /* GC_CHECK_MARKED_OBJECTS */
5687 if (ptr
->header
.size
& PSEUDOVECTOR_FLAG
)
5688 pvectype
= ((ptr
->header
.size
& PVEC_TYPE_MASK
)
5689 >> PSEUDOVECTOR_SIZE_BITS
);
5693 if (pvectype
!= PVEC_SUBR
&& pvectype
!= PVEC_BUFFER
)
5694 CHECK_LIVE (live_vector_p
);
5699 #ifdef GC_CHECK_MARKED_OBJECTS
5708 #endif /* GC_CHECK_MARKED_OBJECTS */
5709 mark_buffer ((struct buffer
*) ptr
);
5713 { /* We could treat this just like a vector, but it is better
5714 to save the COMPILED_CONSTANTS element for last and avoid
5716 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5720 for (i
= 0; i
< size
; i
++)
5721 if (i
!= COMPILED_CONSTANTS
)
5722 mark_object (ptr
->contents
[i
]);
5723 if (size
> COMPILED_CONSTANTS
)
5725 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5732 mark_vectorlike (ptr
);
5733 mark_face_cache (((struct frame
*) ptr
)->face_cache
);
5738 struct window
*w
= (struct window
*) ptr
;
5739 bool leaf
= NILP (w
->hchild
) && NILP (w
->vchild
);
5741 mark_vectorlike (ptr
);
5743 /* Mark glyphs for leaf windows. Marking window
5744 matrices is sufficient because frame matrices
5745 use the same glyph memory. */
5746 if (leaf
&& w
->current_matrix
)
5748 mark_glyph_matrix (w
->current_matrix
);
5749 mark_glyph_matrix (w
->desired_matrix
);
5752 /* Filter out killed buffers from both buffer lists
5753 in attempt to help GC to reclaim killed buffers faster.
5754 We can do it elsewhere for live windows, but this is the
5755 best place to do it for dead windows. */
5757 (w
, mark_discard_killed_buffers (w
->prev_buffers
));
5759 (w
, mark_discard_killed_buffers (w
->next_buffers
));
5763 case PVEC_HASH_TABLE
:
5765 struct Lisp_Hash_Table
*h
= (struct Lisp_Hash_Table
*) ptr
;
5767 mark_vectorlike (ptr
);
5768 /* If hash table is not weak, mark all keys and values.
5769 For weak tables, mark only the vector. */
5771 mark_object (h
->key_and_value
);
5773 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5777 case PVEC_CHAR_TABLE
:
5778 mark_char_table (ptr
);
5781 case PVEC_BOOL_VECTOR
:
5782 /* No Lisp_Objects to mark in a bool vector. */
5793 mark_vectorlike (ptr
);
5800 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5801 struct Lisp_Symbol
*ptrx
;
5805 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5807 mark_object (ptr
->function
);
5808 mark_object (ptr
->plist
);
5809 switch (ptr
->redirect
)
5811 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
5812 case SYMBOL_VARALIAS
:
5815 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
5819 case SYMBOL_LOCALIZED
:
5821 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
5822 Lisp_Object where
= blv
->where
;
5823 /* If the value is set up for a killed buffer or deleted
5824 frame, restore it's global binding. If the value is
5825 forwarded to a C variable, either it's not a Lisp_Object
5826 var, or it's staticpro'd already. */
5827 if ((BUFFERP (where
) && !BUFFER_LIVE_P (XBUFFER (where
)))
5828 || (FRAMEP (where
) && !FRAME_LIVE_P (XFRAME (where
))))
5829 swap_in_global_binding (ptr
);
5830 mark_object (blv
->where
);
5831 mark_object (blv
->valcell
);
5832 mark_object (blv
->defcell
);
5835 case SYMBOL_FORWARDED
:
5836 /* If the value is forwarded to a buffer or keyboard field,
5837 these are marked when we see the corresponding object.
5838 And if it's forwarded to a C variable, either it's not
5839 a Lisp_Object var, or it's staticpro'd already. */
5841 default: emacs_abort ();
5843 if (!PURE_POINTER_P (XSTRING (ptr
->name
)))
5844 MARK_STRING (XSTRING (ptr
->name
));
5845 MARK_INTERVAL_TREE (string_intervals (ptr
->name
));
5850 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun. */
5851 XSETSYMBOL (obj
, ptrx
);
5858 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5860 if (XMISCANY (obj
)->gcmarkbit
)
5863 switch (XMISCTYPE (obj
))
5865 case Lisp_Misc_Marker
:
5866 /* DO NOT mark thru the marker's chain.
5867 The buffer's markers chain does not preserve markers from gc;
5868 instead, markers are removed from the chain when freed by gc. */
5869 XMISCANY (obj
)->gcmarkbit
= 1;
5872 case Lisp_Misc_Save_Value
:
5873 XMISCANY (obj
)->gcmarkbit
= 1;
5876 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5877 /* If DOGC is set, POINTER is the address of a memory
5878 area containing INTEGER potential Lisp_Objects. */
5881 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5883 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5884 mark_maybe_object (*p
);
5890 case Lisp_Misc_Overlay
:
5891 mark_overlay (XOVERLAY (obj
));
5901 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5902 if (CONS_MARKED_P (ptr
))
5904 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5906 /* If the cdr is nil, avoid recursion for the car. */
5907 if (EQ (ptr
->u
.cdr
, Qnil
))
5913 mark_object (ptr
->car
);
5916 if (cdr_count
== mark_object_loop_halt
)
5922 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5923 FLOAT_MARK (XFLOAT (obj
));
5934 #undef CHECK_ALLOCATED
5935 #undef CHECK_ALLOCATED_AND_LIVE
5937 /* Mark the Lisp pointers in the terminal objects.
5938 Called by Fgarbage_collect. */
5941 mark_terminals (void)
5944 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5946 eassert (t
->name
!= NULL
);
5947 #ifdef HAVE_WINDOW_SYSTEM
5948 /* If a terminal object is reachable from a stacpro'ed object,
5949 it might have been marked already. Make sure the image cache
5951 mark_image_cache (t
->image_cache
);
5952 #endif /* HAVE_WINDOW_SYSTEM */
5953 if (!VECTOR_MARKED_P (t
))
5954 mark_vectorlike ((struct Lisp_Vector
*)t
);
5960 /* Value is non-zero if OBJ will survive the current GC because it's
5961 either marked or does not need to be marked to survive. */
5964 survives_gc_p (Lisp_Object obj
)
5968 switch (XTYPE (obj
))
5975 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5979 survives_p
= XMISCANY (obj
)->gcmarkbit
;
5983 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5986 case Lisp_Vectorlike
:
5987 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5991 survives_p
= CONS_MARKED_P (XCONS (obj
));
5995 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
6002 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
6007 /* Sweep: find all structures not marked, and free them. */
6012 /* Remove or mark entries in weak hash tables.
6013 This must be done before any object is unmarked. */
6014 sweep_weak_hash_tables ();
6017 check_string_bytes (!noninteractive
);
6019 /* Put all unmarked conses on free list */
6021 register struct cons_block
*cblk
;
6022 struct cons_block
**cprev
= &cons_block
;
6023 register int lim
= cons_block_index
;
6024 EMACS_INT num_free
= 0, num_used
= 0;
6028 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
6032 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
6034 /* Scan the mark bits an int at a time. */
6035 for (i
= 0; i
< ilim
; i
++)
6037 if (cblk
->gcmarkbits
[i
] == -1)
6039 /* Fast path - all cons cells for this int are marked. */
6040 cblk
->gcmarkbits
[i
] = 0;
6041 num_used
+= BITS_PER_INT
;
6045 /* Some cons cells for this int are not marked.
6046 Find which ones, and free them. */
6047 int start
, pos
, stop
;
6049 start
= i
* BITS_PER_INT
;
6051 if (stop
> BITS_PER_INT
)
6052 stop
= BITS_PER_INT
;
6055 for (pos
= start
; pos
< stop
; pos
++)
6057 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
6060 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
6061 cons_free_list
= &cblk
->conses
[pos
];
6063 cons_free_list
->car
= Vdead
;
6069 CONS_UNMARK (&cblk
->conses
[pos
]);
6075 lim
= CONS_BLOCK_SIZE
;
6076 /* If this block contains only free conses and we have already
6077 seen more than two blocks worth of free conses then deallocate
6079 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
6081 *cprev
= cblk
->next
;
6082 /* Unhook from the free list. */
6083 cons_free_list
= cblk
->conses
[0].u
.chain
;
6084 lisp_align_free (cblk
);
6088 num_free
+= this_free
;
6089 cprev
= &cblk
->next
;
6092 total_conses
= num_used
;
6093 total_free_conses
= num_free
;
6096 /* Put all unmarked floats on free list */
6098 register struct float_block
*fblk
;
6099 struct float_block
**fprev
= &float_block
;
6100 register int lim
= float_block_index
;
6101 EMACS_INT num_free
= 0, num_used
= 0;
6103 float_free_list
= 0;
6105 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
6109 for (i
= 0; i
< lim
; i
++)
6110 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
6113 fblk
->floats
[i
].u
.chain
= float_free_list
;
6114 float_free_list
= &fblk
->floats
[i
];
6119 FLOAT_UNMARK (&fblk
->floats
[i
]);
6121 lim
= FLOAT_BLOCK_SIZE
;
6122 /* If this block contains only free floats and we have already
6123 seen more than two blocks worth of free floats then deallocate
6125 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
6127 *fprev
= fblk
->next
;
6128 /* Unhook from the free list. */
6129 float_free_list
= fblk
->floats
[0].u
.chain
;
6130 lisp_align_free (fblk
);
6134 num_free
+= this_free
;
6135 fprev
= &fblk
->next
;
6138 total_floats
= num_used
;
6139 total_free_floats
= num_free
;
6142 /* Put all unmarked intervals on free list */
6144 register struct interval_block
*iblk
;
6145 struct interval_block
**iprev
= &interval_block
;
6146 register int lim
= interval_block_index
;
6147 EMACS_INT num_free
= 0, num_used
= 0;
6149 interval_free_list
= 0;
6151 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
6156 for (i
= 0; i
< lim
; i
++)
6158 if (!iblk
->intervals
[i
].gcmarkbit
)
6160 set_interval_parent (&iblk
->intervals
[i
], interval_free_list
);
6161 interval_free_list
= &iblk
->intervals
[i
];
6167 iblk
->intervals
[i
].gcmarkbit
= 0;
6170 lim
= INTERVAL_BLOCK_SIZE
;
6171 /* If this block contains only free intervals and we have already
6172 seen more than two blocks worth of free intervals then
6173 deallocate this block. */
6174 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
6176 *iprev
= iblk
->next
;
6177 /* Unhook from the free list. */
6178 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
6183 num_free
+= this_free
;
6184 iprev
= &iblk
->next
;
6187 total_intervals
= num_used
;
6188 total_free_intervals
= num_free
;
6191 /* Put all unmarked symbols on free list */
6193 register struct symbol_block
*sblk
;
6194 struct symbol_block
**sprev
= &symbol_block
;
6195 register int lim
= symbol_block_index
;
6196 EMACS_INT num_free
= 0, num_used
= 0;
6198 symbol_free_list
= NULL
;
6200 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
6203 union aligned_Lisp_Symbol
*sym
= sblk
->symbols
;
6204 union aligned_Lisp_Symbol
*end
= sym
+ lim
;
6206 for (; sym
< end
; ++sym
)
6208 /* Check if the symbol was created during loadup. In such a case
6209 it might be pointed to by pure bytecode which we don't trace,
6210 so we conservatively assume that it is live. */
6211 bool pure_p
= PURE_POINTER_P (XSTRING (sym
->s
.name
));
6213 if (!sym
->s
.gcmarkbit
&& !pure_p
)
6215 if (sym
->s
.redirect
== SYMBOL_LOCALIZED
)
6216 xfree (SYMBOL_BLV (&sym
->s
));
6217 sym
->s
.next
= symbol_free_list
;
6218 symbol_free_list
= &sym
->s
;
6220 symbol_free_list
->function
= Vdead
;
6228 UNMARK_STRING (XSTRING (sym
->s
.name
));
6229 sym
->s
.gcmarkbit
= 0;
6233 lim
= SYMBOL_BLOCK_SIZE
;
6234 /* If this block contains only free symbols and we have already
6235 seen more than two blocks worth of free symbols then deallocate
6237 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6239 *sprev
= sblk
->next
;
6240 /* Unhook from the free list. */
6241 symbol_free_list
= sblk
->symbols
[0].s
.next
;
6246 num_free
+= this_free
;
6247 sprev
= &sblk
->next
;
6250 total_symbols
= num_used
;
6251 total_free_symbols
= num_free
;
6254 /* Put all unmarked misc's on free list.
6255 For a marker, first unchain it from the buffer it points into. */
6257 register struct marker_block
*mblk
;
6258 struct marker_block
**mprev
= &marker_block
;
6259 register int lim
= marker_block_index
;
6260 EMACS_INT num_free
= 0, num_used
= 0;
6262 marker_free_list
= 0;
6264 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6269 for (i
= 0; i
< lim
; i
++)
6271 if (!mblk
->markers
[i
].m
.u_any
.gcmarkbit
)
6273 if (mblk
->markers
[i
].m
.u_any
.type
== Lisp_Misc_Marker
)
6274 unchain_marker (&mblk
->markers
[i
].m
.u_marker
);
6275 /* Set the type of the freed object to Lisp_Misc_Free.
6276 We could leave the type alone, since nobody checks it,
6277 but this might catch bugs faster. */
6278 mblk
->markers
[i
].m
.u_marker
.type
= Lisp_Misc_Free
;
6279 mblk
->markers
[i
].m
.u_free
.chain
= marker_free_list
;
6280 marker_free_list
= &mblk
->markers
[i
].m
;
6286 mblk
->markers
[i
].m
.u_any
.gcmarkbit
= 0;
6289 lim
= MARKER_BLOCK_SIZE
;
6290 /* If this block contains only free markers and we have already
6291 seen more than two blocks worth of free markers then deallocate
6293 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6295 *mprev
= mblk
->next
;
6296 /* Unhook from the free list. */
6297 marker_free_list
= mblk
->markers
[0].m
.u_free
.chain
;
6302 num_free
+= this_free
;
6303 mprev
= &mblk
->next
;
6307 total_markers
= num_used
;
6308 total_free_markers
= num_free
;
6311 /* Free all unmarked buffers */
6313 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6317 if (!VECTOR_MARKED_P (buffer
))
6320 prev
->header
.next
= buffer
->header
.next
;
6322 all_buffers
= buffer
->header
.next
.buffer
;
6323 next
= buffer
->header
.next
.buffer
;
6329 VECTOR_UNMARK (buffer
);
6330 /* Do not use buffer_(set|get)_intervals here. */
6331 buffer
->text
->intervals
= balance_intervals (buffer
->text
->intervals
);
6333 prev
= buffer
, buffer
= buffer
->header
.next
.buffer
;
6338 check_string_bytes (!noninteractive
);
6344 /* Debugging aids. */
6346 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6347 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6348 This may be helpful in debugging Emacs's memory usage.
6349 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6354 XSETINT (end
, (intptr_t) (char *) sbrk (0) / 1024);
6359 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6360 doc
: /* Return a list of counters that measure how much consing there has been.
6361 Each of these counters increments for a certain kind of object.
6362 The counters wrap around from the largest positive integer to zero.
6363 Garbage collection does not decrease them.
6364 The elements of the value are as follows:
6365 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6366 All are in units of 1 = one object consed
6367 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6369 MISCS include overlays, markers, and some internal types.
6370 Frames, windows, buffers, and subprocesses count as vectors
6371 (but the contents of a buffer's text do not count here). */)
6374 return listn (CONSTYPE_HEAP
, 8,
6375 bounded_number (cons_cells_consed
),
6376 bounded_number (floats_consed
),
6377 bounded_number (vector_cells_consed
),
6378 bounded_number (symbols_consed
),
6379 bounded_number (string_chars_consed
),
6380 bounded_number (misc_objects_consed
),
6381 bounded_number (intervals_consed
),
6382 bounded_number (strings_consed
));
6385 /* Find at most FIND_MAX symbols which have OBJ as their value or
6386 function. This is used in gdbinit's `xwhichsymbols' command. */
6389 which_symbols (Lisp_Object obj
, EMACS_INT find_max
)
6391 struct symbol_block
*sblk
;
6392 ptrdiff_t gc_count
= inhibit_garbage_collection ();
6393 Lisp_Object found
= Qnil
;
6397 for (sblk
= symbol_block
; sblk
; sblk
= sblk
->next
)
6399 union aligned_Lisp_Symbol
*aligned_sym
= sblk
->symbols
;
6402 for (bn
= 0; bn
< SYMBOL_BLOCK_SIZE
; bn
++, aligned_sym
++)
6404 struct Lisp_Symbol
*sym
= &aligned_sym
->s
;
6408 if (sblk
== symbol_block
&& bn
>= symbol_block_index
)
6411 XSETSYMBOL (tem
, sym
);
6412 val
= find_symbol_value (tem
);
6414 || EQ (sym
->function
, obj
)
6415 || (!NILP (sym
->function
)
6416 && COMPILEDP (sym
->function
)
6417 && EQ (AREF (sym
->function
, COMPILED_BYTECODE
), obj
))
6420 && EQ (AREF (val
, COMPILED_BYTECODE
), obj
)))
6422 found
= Fcons (tem
, found
);
6423 if (--find_max
== 0)
6431 unbind_to (gc_count
, Qnil
);
6435 #ifdef ENABLE_CHECKING
6437 bool suppress_checking
;
6440 die (const char *msg
, const char *file
, int line
)
6442 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6444 terminate_due_to_signal (SIGABRT
, INT_MAX
);
6448 /* Initialization */
6451 init_alloc_once (void)
6453 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6455 pure_size
= PURESIZE
;
6457 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6459 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6462 #ifdef DOUG_LEA_MALLOC
6463 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6464 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6465 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6470 refill_memory_reserve ();
6471 gc_cons_threshold
= GC_DEFAULT_THRESHOLD
;
6478 byte_stack_list
= 0;
6480 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6481 setjmp_tested_p
= longjmps_done
= 0;
6484 Vgc_elapsed
= make_float (0.0);
6489 syms_of_alloc (void)
6491 DEFVAR_INT ("gc-cons-threshold", gc_cons_threshold
,
6492 doc
: /* Number of bytes of consing between garbage collections.
6493 Garbage collection can happen automatically once this many bytes have been
6494 allocated since the last garbage collection. All data types count.
6496 Garbage collection happens automatically only when `eval' is called.
6498 By binding this temporarily to a large number, you can effectively
6499 prevent garbage collection during a part of the program.
6500 See also `gc-cons-percentage'. */);
6502 DEFVAR_LISP ("gc-cons-percentage", Vgc_cons_percentage
,
6503 doc
: /* Portion of the heap used for allocation.
6504 Garbage collection can happen automatically once this portion of the heap
6505 has been allocated since the last garbage collection.
6506 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6507 Vgc_cons_percentage
= make_float (0.1);
6509 DEFVAR_INT ("pure-bytes-used", pure_bytes_used
,
6510 doc
: /* Number of bytes of shareable Lisp data allocated so far. */);
6512 DEFVAR_INT ("cons-cells-consed", cons_cells_consed
,
6513 doc
: /* Number of cons cells that have been consed so far. */);
6515 DEFVAR_INT ("floats-consed", floats_consed
,
6516 doc
: /* Number of floats that have been consed so far. */);
6518 DEFVAR_INT ("vector-cells-consed", vector_cells_consed
,
6519 doc
: /* Number of vector cells that have been consed so far. */);
6521 DEFVAR_INT ("symbols-consed", symbols_consed
,
6522 doc
: /* Number of symbols that have been consed so far. */);
6524 DEFVAR_INT ("string-chars-consed", string_chars_consed
,
6525 doc
: /* Number of string characters that have been consed so far. */);
6527 DEFVAR_INT ("misc-objects-consed", misc_objects_consed
,
6528 doc
: /* Number of miscellaneous objects that have been consed so far.
6529 These include markers and overlays, plus certain objects not visible
6532 DEFVAR_INT ("intervals-consed", intervals_consed
,
6533 doc
: /* Number of intervals that have been consed so far. */);
6535 DEFVAR_INT ("strings-consed", strings_consed
,
6536 doc
: /* Number of strings that have been consed so far. */);
6538 DEFVAR_LISP ("purify-flag", Vpurify_flag
,
6539 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6540 This means that certain objects should be allocated in shared (pure) space.
6541 It can also be set to a hash-table, in which case this table is used to
6542 do hash-consing of the objects allocated to pure space. */);
6544 DEFVAR_BOOL ("garbage-collection-messages", garbage_collection_messages
,
6545 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6546 garbage_collection_messages
= 0;
6548 DEFVAR_LISP ("post-gc-hook", Vpost_gc_hook
,
6549 doc
: /* Hook run after garbage collection has finished. */);
6550 Vpost_gc_hook
= Qnil
;
6551 DEFSYM (Qpost_gc_hook
, "post-gc-hook");
6553 DEFVAR_LISP ("memory-signal-data", Vmemory_signal_data
,
6554 doc
: /* Precomputed `signal' argument for memory-full error. */);
6555 /* We build this in advance because if we wait until we need it, we might
6556 not be able to allocate the memory to hold it. */
6558 = listn (CONSTYPE_PURE
, 2, Qerror
,
6559 build_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
6561 DEFVAR_LISP ("memory-full", Vmemory_full
,
6562 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6563 Vmemory_full
= Qnil
;
6565 DEFSYM (Qconses
, "conses");
6566 DEFSYM (Qsymbols
, "symbols");
6567 DEFSYM (Qmiscs
, "miscs");
6568 DEFSYM (Qstrings
, "strings");
6569 DEFSYM (Qvectors
, "vectors");
6570 DEFSYM (Qfloats
, "floats");
6571 DEFSYM (Qintervals
, "intervals");
6572 DEFSYM (Qbuffers
, "buffers");
6573 DEFSYM (Qstring_bytes
, "string-bytes");
6574 DEFSYM (Qvector_slots
, "vector-slots");
6575 DEFSYM (Qheap
, "heap");
6576 DEFSYM (Qautomatic_gc
, "Automatic GC");
6578 DEFSYM (Qgc_cons_threshold
, "gc-cons-threshold");
6579 DEFSYM (Qchar_table_extra_slots
, "char-table-extra-slots");
6581 DEFVAR_LISP ("gc-elapsed", Vgc_elapsed
,
6582 doc
: /* Accumulated time elapsed in garbage collections.
6583 The time is in seconds as a floating point value. */);
6584 DEFVAR_INT ("gcs-done", gcs_done
,
6585 doc
: /* Accumulated number of garbage collections done. */);
6590 defsubr (&Smake_byte_code
);
6591 defsubr (&Smake_list
);
6592 defsubr (&Smake_vector
);
6593 defsubr (&Smake_string
);
6594 defsubr (&Smake_bool_vector
);
6595 defsubr (&Smake_symbol
);
6596 defsubr (&Smake_marker
);
6597 defsubr (&Spurecopy
);
6598 defsubr (&Sgarbage_collect
);
6599 defsubr (&Smemory_limit
);
6600 defsubr (&Smemory_use_counts
);
6602 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6603 defsubr (&Sgc_status
);
6607 /* When compiled with GCC, GDB might say "No enum type named
6608 pvec_type" if we don't have at least one symbol with that type, and
6609 then xbacktrace could fail. Similarly for the other enums and
6613 enum CHARTAB_SIZE_BITS CHARTAB_SIZE_BITS
;
6614 enum CHAR_TABLE_STANDARD_SLOTS CHAR_TABLE_STANDARD_SLOTS
;
6615 enum char_bits char_bits
;
6616 enum CHECK_LISP_OBJECT_TYPE CHECK_LISP_OBJECT_TYPE
;
6617 enum DEFAULT_HASH_SIZE DEFAULT_HASH_SIZE
;
6618 enum enum_USE_LSB_TAG enum_USE_LSB_TAG
;
6619 enum FLOAT_TO_STRING_BUFSIZE FLOAT_TO_STRING_BUFSIZE
;
6620 enum Lisp_Bits Lisp_Bits
;
6621 enum Lisp_Compiled Lisp_Compiled
;
6622 enum maxargs maxargs
;
6623 enum MAX_ALLOCA MAX_ALLOCA
;
6624 enum More_Lisp_Bits More_Lisp_Bits
;
6625 enum pvec_type pvec_type
;
6627 enum lsb_bits lsb_bits
;
6629 } const EXTERNALLY_VISIBLE gdb_make_enums_visible
= {0};