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 #include <limits.h> /* For CHAR_BIT. */
32 /* This file is part of the core Lisp implementation, and thus must
33 deal with the real data structures. If the Lisp implementation is
34 replaced, this file likely will not be used. */
36 #undef HIDE_LISP_IMPLEMENTATION
39 #include "intervals.h"
41 #include "character.h"
46 #include "blockinput.h"
47 #include "syssignal.h"
48 #include "termhooks.h" /* For struct terminal. */
52 /* GC_CHECK_MARKED_OBJECTS means do sanity checks on allocated objects.
53 Doable only if GC_MARK_STACK. */
55 # undef GC_CHECK_MARKED_OBJECTS
58 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
59 memory. Can do this only if using gmalloc.c and if not checking
62 #if (defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC \
63 || defined GC_CHECK_MARKED_OBJECTS)
64 #undef GC_MALLOC_CHECK
78 #ifdef DOUG_LEA_MALLOC
82 /* Specify maximum number of areas to mmap. It would be nice to use a
83 value that explicitly means "no limit". */
85 #define MMAP_MAX_AREAS 100000000
87 #else /* not DOUG_LEA_MALLOC */
89 /* The following come from gmalloc.c. */
91 extern size_t _bytes_used
;
92 extern size_t __malloc_extra_blocks
;
93 extern void *_malloc_internal (size_t);
94 extern void _free_internal (void *);
96 #endif /* not DOUG_LEA_MALLOC */
98 #if ! defined SYSTEM_MALLOC && ! defined SYNC_INPUT
101 /* When GTK uses the file chooser dialog, different backends can be loaded
102 dynamically. One such a backend is the Gnome VFS backend that gets loaded
103 if you run Gnome. That backend creates several threads and also allocates
106 Also, gconf and gsettings may create several threads.
108 If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_*
109 functions below are called from malloc, there is a chance that one
110 of these threads preempts the Emacs main thread and the hook variables
111 end up in an inconsistent state. So we have a mutex to prevent that (note
112 that the backend handles concurrent access to malloc within its own threads
113 but Emacs code running in the main thread is not included in that control).
115 When UNBLOCK_INPUT is called, reinvoke_input_signal may be called. If this
116 happens in one of the backend threads we will have two threads that tries
117 to run Emacs code at once, and the code is not prepared for that.
118 To prevent that, we only call BLOCK/UNBLOCK from the main thread. */
120 static pthread_mutex_t alloc_mutex
;
122 #define BLOCK_INPUT_ALLOC \
125 if (pthread_equal (pthread_self (), main_thread)) \
127 pthread_mutex_lock (&alloc_mutex); \
130 #define UNBLOCK_INPUT_ALLOC \
133 pthread_mutex_unlock (&alloc_mutex); \
134 if (pthread_equal (pthread_self (), main_thread)) \
139 #else /* ! defined HAVE_PTHREAD */
141 #define BLOCK_INPUT_ALLOC BLOCK_INPUT
142 #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT
144 #endif /* ! defined HAVE_PTHREAD */
145 #endif /* ! defined SYSTEM_MALLOC && ! defined SYNC_INPUT */
147 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
148 to a struct Lisp_String. */
150 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
151 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
152 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
154 #define VECTOR_MARK(V) ((V)->header.size |= ARRAY_MARK_FLAG)
155 #define VECTOR_UNMARK(V) ((V)->header.size &= ~ARRAY_MARK_FLAG)
156 #define VECTOR_MARKED_P(V) (((V)->header.size & ARRAY_MARK_FLAG) != 0)
158 /* Value is the number of bytes of S, a pointer to a struct Lisp_String.
159 Be careful during GC, because S->size contains the mark bit for
162 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
164 /* Global variables. */
165 struct emacs_globals globals
;
167 /* Number of bytes of consing done since the last gc. */
169 EMACS_INT consing_since_gc
;
171 /* Similar minimum, computed from Vgc_cons_percentage. */
173 EMACS_INT gc_relative_threshold
;
175 /* Minimum number of bytes of consing since GC before next GC,
176 when memory is full. */
178 EMACS_INT memory_full_cons_threshold
;
180 /* Nonzero during GC. */
184 /* Nonzero means abort if try to GC.
185 This is for code which is written on the assumption that
186 no GC will happen, so as to verify that assumption. */
190 /* Number of live and free conses etc. */
192 static EMACS_INT total_conses
, total_markers
, total_symbols
, total_vector_size
;
193 static EMACS_INT total_free_conses
, total_free_markers
, total_free_symbols
;
194 static EMACS_INT total_free_floats
, total_floats
;
196 /* Points to memory space allocated as "spare", to be freed if we run
197 out of memory. We keep one large block, four cons-blocks, and
198 two string blocks. */
200 static char *spare_memory
[7];
202 /* Amount of spare memory to keep in large reserve block, or to see
203 whether this much is available when malloc fails on a larger request. */
205 #define SPARE_MEMORY (1 << 14)
207 /* Number of extra blocks malloc should get when it needs more core. */
209 static int malloc_hysteresis
;
211 /* Initialize it to a nonzero value to force it into data space
212 (rather than bss space). That way unexec will remap it into text
213 space (pure), on some systems. We have not implemented the
214 remapping on more recent systems because this is less important
215 nowadays than in the days of small memories and timesharing. */
217 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
218 #define PUREBEG (char *) pure
220 /* Pointer to the pure area, and its size. */
222 static char *purebeg
;
223 static ptrdiff_t pure_size
;
225 /* Number of bytes of pure storage used before pure storage overflowed.
226 If this is non-zero, this implies that an overflow occurred. */
228 static ptrdiff_t pure_bytes_used_before_overflow
;
230 /* Value is non-zero if P points into pure space. */
232 #define PURE_POINTER_P(P) \
233 ((uintptr_t) (P) - (uintptr_t) purebeg <= pure_size)
235 /* Index in pure at which next pure Lisp object will be allocated.. */
237 static ptrdiff_t pure_bytes_used_lisp
;
239 /* Number of bytes allocated for non-Lisp objects in pure storage. */
241 static ptrdiff_t pure_bytes_used_non_lisp
;
243 /* If nonzero, this is a warning delivered by malloc and not yet
246 const char *pending_malloc_warning
;
248 /* Maximum amount of C stack to save when a GC happens. */
250 #ifndef MAX_SAVE_STACK
251 #define MAX_SAVE_STACK 16000
254 /* Buffer in which we save a copy of the C stack at each GC. */
256 #if MAX_SAVE_STACK > 0
257 static char *stack_copy
;
258 static ptrdiff_t stack_copy_size
;
261 /* Non-zero means ignore malloc warnings. Set during initialization.
262 Currently not used. */
264 static int ignore_warnings
;
266 static Lisp_Object Qgc_cons_threshold
;
267 Lisp_Object Qchar_table_extra_slots
;
269 /* Hook run after GC has finished. */
271 static Lisp_Object Qpost_gc_hook
;
273 static void mark_buffer (Lisp_Object
);
274 static void mark_terminals (void);
275 static void gc_sweep (void);
276 static Lisp_Object
make_pure_vector (ptrdiff_t);
277 static void mark_glyph_matrix (struct glyph_matrix
*);
278 static void mark_face_cache (struct face_cache
*);
280 #if !defined REL_ALLOC || defined SYSTEM_MALLOC
281 static void refill_memory_reserve (void);
283 static struct Lisp_String
*allocate_string (void);
284 static void compact_small_strings (void);
285 static void free_large_strings (void);
286 static void sweep_strings (void);
287 static void free_misc (Lisp_Object
);
288 extern Lisp_Object
which_symbols (Lisp_Object
, EMACS_INT
) EXTERNALLY_VISIBLE
;
290 /* When scanning the C stack for live Lisp objects, Emacs keeps track
291 of what memory allocated via lisp_malloc is intended for what
292 purpose. This enumeration specifies the type of memory. */
303 /* We used to keep separate mem_types for subtypes of vectors such as
304 process, hash_table, frame, terminal, and window, but we never made
305 use of the distinction, so it only caused source-code complexity
306 and runtime slowdown. Minor but pointless. */
308 /* Special type to denote vector blocks. */
309 MEM_TYPE_VECTOR_BLOCK
312 static void *lisp_malloc (size_t, enum mem_type
);
315 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
317 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
318 #include <stdio.h> /* For fprintf. */
321 /* A unique object in pure space used to make some Lisp objects
322 on free lists recognizable in O(1). */
324 static Lisp_Object Vdead
;
325 #define DEADP(x) EQ (x, Vdead)
327 #ifdef GC_MALLOC_CHECK
329 enum mem_type allocated_mem_type
;
331 #endif /* GC_MALLOC_CHECK */
333 /* A node in the red-black tree describing allocated memory containing
334 Lisp data. Each such block is recorded with its start and end
335 address when it is allocated, and removed from the tree when it
338 A red-black tree is a balanced binary tree with the following
341 1. Every node is either red or black.
342 2. Every leaf is black.
343 3. If a node is red, then both of its children are black.
344 4. Every simple path from a node to a descendant leaf contains
345 the same number of black nodes.
346 5. The root is always black.
348 When nodes are inserted into the tree, or deleted from the tree,
349 the tree is "fixed" so that these properties are always true.
351 A red-black tree with N internal nodes has height at most 2
352 log(N+1). Searches, insertions and deletions are done in O(log N).
353 Please see a text book about data structures for a detailed
354 description of red-black trees. Any book worth its salt should
359 /* Children of this node. These pointers are never NULL. When there
360 is no child, the value is MEM_NIL, which points to a dummy node. */
361 struct mem_node
*left
, *right
;
363 /* The parent of this node. In the root node, this is NULL. */
364 struct mem_node
*parent
;
366 /* Start and end of allocated region. */
370 enum {MEM_BLACK
, MEM_RED
} color
;
376 /* Base address of stack. Set in main. */
378 Lisp_Object
*stack_base
;
380 /* Root of the tree describing allocated Lisp memory. */
382 static struct mem_node
*mem_root
;
384 /* Lowest and highest known address in the heap. */
386 static void *min_heap_address
, *max_heap_address
;
388 /* Sentinel node of the tree. */
390 static struct mem_node mem_z
;
391 #define MEM_NIL &mem_z
393 static struct Lisp_Vector
*allocate_vectorlike (ptrdiff_t);
394 static void lisp_free (void *);
395 static void mark_stack (void);
396 static int live_vector_p (struct mem_node
*, void *);
397 static int live_buffer_p (struct mem_node
*, void *);
398 static int live_string_p (struct mem_node
*, void *);
399 static int live_cons_p (struct mem_node
*, void *);
400 static int live_symbol_p (struct mem_node
*, void *);
401 static int live_float_p (struct mem_node
*, void *);
402 static int live_misc_p (struct mem_node
*, void *);
403 static void mark_maybe_object (Lisp_Object
);
404 static void mark_memory (void *, void *);
405 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
406 static void mem_init (void);
407 static struct mem_node
*mem_insert (void *, void *, enum mem_type
);
408 static void mem_insert_fixup (struct mem_node
*);
410 static void mem_rotate_left (struct mem_node
*);
411 static void mem_rotate_right (struct mem_node
*);
412 static void mem_delete (struct mem_node
*);
413 static void mem_delete_fixup (struct mem_node
*);
414 static inline struct mem_node
*mem_find (void *);
417 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
418 static void check_gcpros (void);
421 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
427 /* Recording what needs to be marked for gc. */
429 struct gcpro
*gcprolist
;
431 /* Addresses of staticpro'd variables. Initialize it to a nonzero
432 value; otherwise some compilers put it into BSS. */
434 #define NSTATICS 0x650
435 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
437 /* Index of next unused slot in staticvec. */
439 static int staticidx
= 0;
441 static void *pure_alloc (size_t, int);
444 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
445 ALIGNMENT must be a power of 2. */
447 #define ALIGN(ptr, ALIGNMENT) \
448 ((void *) (((uintptr_t) (ptr) + (ALIGNMENT) - 1) \
449 & ~ ((ALIGNMENT) - 1)))
453 /************************************************************************
455 ************************************************************************/
457 /* Function malloc calls this if it finds we are near exhausting storage. */
460 malloc_warning (const char *str
)
462 pending_malloc_warning
= str
;
466 /* Display an already-pending malloc warning. */
469 display_malloc_warning (void)
471 call3 (intern ("display-warning"),
473 build_string (pending_malloc_warning
),
474 intern ("emergency"));
475 pending_malloc_warning
= 0;
478 /* Called if we can't allocate relocatable space for a buffer. */
481 buffer_memory_full (ptrdiff_t nbytes
)
483 /* If buffers use the relocating allocator, no need to free
484 spare_memory, because we may have plenty of malloc space left
485 that we could get, and if we don't, the malloc that fails will
486 itself cause spare_memory to be freed. If buffers don't use the
487 relocating allocator, treat this like any other failing
491 memory_full (nbytes
);
494 /* This used to call error, but if we've run out of memory, we could
495 get infinite recursion trying to build the string. */
496 xsignal (Qnil
, Vmemory_signal_data
);
499 /* A common multiple of the positive integers A and B. Ideally this
500 would be the least common multiple, but there's no way to do that
501 as a constant expression in C, so do the best that we can easily do. */
502 #define COMMON_MULTIPLE(a, b) \
503 ((a) % (b) == 0 ? (a) : (b) % (a) == 0 ? (b) : (a) * (b))
505 #ifndef XMALLOC_OVERRUN_CHECK
506 #define XMALLOC_OVERRUN_CHECK_OVERHEAD 0
509 /* Check for overrun in malloc'ed buffers by wrapping a header and trailer
512 The header consists of XMALLOC_OVERRUN_CHECK_SIZE fixed bytes
513 followed by XMALLOC_OVERRUN_SIZE_SIZE bytes containing the original
514 block size in little-endian order. The trailer consists of
515 XMALLOC_OVERRUN_CHECK_SIZE fixed bytes.
517 The header is used to detect whether this block has been allocated
518 through these functions, as some low-level libc functions may
519 bypass the malloc hooks. */
521 #define XMALLOC_OVERRUN_CHECK_SIZE 16
522 #define XMALLOC_OVERRUN_CHECK_OVERHEAD \
523 (2 * XMALLOC_OVERRUN_CHECK_SIZE + XMALLOC_OVERRUN_SIZE_SIZE)
525 /* Define XMALLOC_OVERRUN_SIZE_SIZE so that (1) it's large enough to
526 hold a size_t value and (2) the header size is a multiple of the
527 alignment that Emacs needs for C types and for USE_LSB_TAG. */
528 #define XMALLOC_BASE_ALIGNMENT \
531 union { long double d; intmax_t i; void *p; } u; \
537 # define XMALLOC_HEADER_ALIGNMENT \
538 COMMON_MULTIPLE (1 << GCTYPEBITS, XMALLOC_BASE_ALIGNMENT)
540 # define XMALLOC_HEADER_ALIGNMENT XMALLOC_BASE_ALIGNMENT
542 #define XMALLOC_OVERRUN_SIZE_SIZE \
543 (((XMALLOC_OVERRUN_CHECK_SIZE + sizeof (size_t) \
544 + XMALLOC_HEADER_ALIGNMENT - 1) \
545 / XMALLOC_HEADER_ALIGNMENT * XMALLOC_HEADER_ALIGNMENT) \
546 - XMALLOC_OVERRUN_CHECK_SIZE)
548 static char const xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
] =
549 { '\x9a', '\x9b', '\xae', '\xaf',
550 '\xbf', '\xbe', '\xce', '\xcf',
551 '\xea', '\xeb', '\xec', '\xed',
552 '\xdf', '\xde', '\x9c', '\x9d' };
554 static char const xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
555 { '\xaa', '\xab', '\xac', '\xad',
556 '\xba', '\xbb', '\xbc', '\xbd',
557 '\xca', '\xcb', '\xcc', '\xcd',
558 '\xda', '\xdb', '\xdc', '\xdd' };
560 /* Insert and extract the block size in the header. */
563 xmalloc_put_size (unsigned char *ptr
, size_t size
)
566 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
568 *--ptr
= size
& ((1 << CHAR_BIT
) - 1);
574 xmalloc_get_size (unsigned char *ptr
)
578 ptr
-= XMALLOC_OVERRUN_SIZE_SIZE
;
579 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
588 /* The call depth in overrun_check functions. For example, this might happen:
590 overrun_check_malloc()
591 -> malloc -> (via hook)_-> emacs_blocked_malloc
592 -> overrun_check_malloc
593 call malloc (hooks are NULL, so real malloc is called).
594 malloc returns 10000.
595 add overhead, return 10016.
596 <- (back in overrun_check_malloc)
597 add overhead again, return 10032
598 xmalloc returns 10032.
603 overrun_check_free(10032)
605 free(10016) <- crash, because 10000 is the original pointer. */
607 static ptrdiff_t check_depth
;
609 /* Like malloc, but wraps allocated block with header and trailer. */
612 overrun_check_malloc (size_t size
)
614 register unsigned char *val
;
615 int overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_OVERHEAD
: 0;
616 if (SIZE_MAX
- overhead
< size
)
619 val
= (unsigned char *) malloc (size
+ overhead
);
620 if (val
&& check_depth
== 1)
622 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
623 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
624 xmalloc_put_size (val
, size
);
625 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
626 XMALLOC_OVERRUN_CHECK_SIZE
);
633 /* Like realloc, but checks old block for overrun, and wraps new block
634 with header and trailer. */
637 overrun_check_realloc (void *block
, size_t size
)
639 register unsigned char *val
= (unsigned char *) block
;
640 int overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_OVERHEAD
: 0;
641 if (SIZE_MAX
- overhead
< size
)
646 && memcmp (xmalloc_overrun_check_header
,
647 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
648 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
650 size_t osize
= xmalloc_get_size (val
);
651 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
652 XMALLOC_OVERRUN_CHECK_SIZE
))
654 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
655 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
656 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
659 val
= realloc (val
, size
+ overhead
);
661 if (val
&& check_depth
== 1)
663 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
664 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
665 xmalloc_put_size (val
, size
);
666 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
667 XMALLOC_OVERRUN_CHECK_SIZE
);
673 /* Like free, but checks block for overrun. */
676 overrun_check_free (void *block
)
678 unsigned char *val
= (unsigned char *) block
;
683 && memcmp (xmalloc_overrun_check_header
,
684 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
685 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
687 size_t osize
= xmalloc_get_size (val
);
688 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
689 XMALLOC_OVERRUN_CHECK_SIZE
))
691 #ifdef XMALLOC_CLEAR_FREE_MEMORY
692 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
693 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
695 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
696 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
697 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
708 #define malloc overrun_check_malloc
709 #define realloc overrun_check_realloc
710 #define free overrun_check_free
714 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
715 there's no need to block input around malloc. */
716 #define MALLOC_BLOCK_INPUT ((void)0)
717 #define MALLOC_UNBLOCK_INPUT ((void)0)
719 #define MALLOC_BLOCK_INPUT BLOCK_INPUT
720 #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT
723 /* Like malloc but check for no memory and block interrupt input.. */
726 xmalloc (size_t size
)
732 MALLOC_UNBLOCK_INPUT
;
740 /* Like realloc but check for no memory and block interrupt input.. */
743 xrealloc (void *block
, size_t size
)
748 /* We must call malloc explicitly when BLOCK is 0, since some
749 reallocs don't do this. */
753 val
= realloc (block
, size
);
754 MALLOC_UNBLOCK_INPUT
;
762 /* Like free but block interrupt input. */
771 MALLOC_UNBLOCK_INPUT
;
772 /* We don't call refill_memory_reserve here
773 because that duplicates doing so in emacs_blocked_free
774 and the criterion should go there. */
778 /* Other parts of Emacs pass large int values to allocator functions
779 expecting ptrdiff_t. This is portable in practice, but check it to
781 verify (INT_MAX
<= PTRDIFF_MAX
);
784 /* Allocate an array of NITEMS items, each of size ITEM_SIZE.
785 Signal an error on memory exhaustion, and block interrupt input. */
788 xnmalloc (ptrdiff_t nitems
, ptrdiff_t item_size
)
790 xassert (0 <= nitems
&& 0 < item_size
);
791 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
792 memory_full (SIZE_MAX
);
793 return xmalloc (nitems
* item_size
);
797 /* Reallocate an array PA to make it of NITEMS items, each of size ITEM_SIZE.
798 Signal an error on memory exhaustion, and block interrupt input. */
801 xnrealloc (void *pa
, ptrdiff_t nitems
, ptrdiff_t item_size
)
803 xassert (0 <= nitems
&& 0 < item_size
);
804 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
805 memory_full (SIZE_MAX
);
806 return xrealloc (pa
, nitems
* item_size
);
810 /* Grow PA, which points to an array of *NITEMS items, and return the
811 location of the reallocated array, updating *NITEMS to reflect its
812 new size. The new array will contain at least NITEMS_INCR_MIN more
813 items, but will not contain more than NITEMS_MAX items total.
814 ITEM_SIZE is the size of each item, in bytes.
816 ITEM_SIZE and NITEMS_INCR_MIN must be positive. *NITEMS must be
817 nonnegative. If NITEMS_MAX is -1, it is treated as if it were
820 If PA is null, then allocate a new array instead of reallocating
821 the old one. Thus, to grow an array A without saving its old
822 contents, invoke xfree (A) immediately followed by xgrowalloc (0,
825 Block interrupt input as needed. If memory exhaustion occurs, set
826 *NITEMS to zero if PA is null, and signal an error (i.e., do not
830 xpalloc (void *pa
, ptrdiff_t *nitems
, ptrdiff_t nitems_incr_min
,
831 ptrdiff_t nitems_max
, ptrdiff_t item_size
)
833 /* The approximate size to use for initial small allocation
834 requests. This is the largest "small" request for the GNU C
836 enum { DEFAULT_MXFAST
= 64 * sizeof (size_t) / 4 };
838 /* If the array is tiny, grow it to about (but no greater than)
839 DEFAULT_MXFAST bytes. Otherwise, grow it by about 50%. */
840 ptrdiff_t n
= *nitems
;
841 ptrdiff_t tiny_max
= DEFAULT_MXFAST
/ item_size
- n
;
842 ptrdiff_t half_again
= n
>> 1;
843 ptrdiff_t incr_estimate
= max (tiny_max
, half_again
);
845 /* Adjust the increment according to three constraints: NITEMS_INCR_MIN,
846 NITEMS_MAX, and what the C language can represent safely. */
847 ptrdiff_t C_language_max
= min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
;
848 ptrdiff_t n_max
= (0 <= nitems_max
&& nitems_max
< C_language_max
849 ? nitems_max
: C_language_max
);
850 ptrdiff_t nitems_incr_max
= n_max
- n
;
851 ptrdiff_t incr
= max (nitems_incr_min
, min (incr_estimate
, nitems_incr_max
));
853 xassert (0 < item_size
&& 0 < nitems_incr_min
&& 0 <= n
&& -1 <= nitems_max
);
856 if (nitems_incr_max
< incr
)
857 memory_full (SIZE_MAX
);
859 pa
= xrealloc (pa
, n
* item_size
);
865 /* Like strdup, but uses xmalloc. */
868 xstrdup (const char *s
)
870 size_t len
= strlen (s
) + 1;
871 char *p
= (char *) xmalloc (len
);
877 /* Unwind for SAFE_ALLOCA */
880 safe_alloca_unwind (Lisp_Object arg
)
882 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
892 /* Like malloc but used for allocating Lisp data. NBYTES is the
893 number of bytes to allocate, TYPE describes the intended use of the
894 allocated memory block (for strings, for conses, ...). */
897 void *lisp_malloc_loser EXTERNALLY_VISIBLE
;
901 lisp_malloc (size_t nbytes
, enum mem_type type
)
907 #ifdef GC_MALLOC_CHECK
908 allocated_mem_type
= type
;
911 val
= (void *) malloc (nbytes
);
914 /* If the memory just allocated cannot be addressed thru a Lisp
915 object's pointer, and it needs to be,
916 that's equivalent to running out of memory. */
917 if (val
&& type
!= MEM_TYPE_NON_LISP
)
920 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
921 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
923 lisp_malloc_loser
= val
;
930 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
931 if (val
&& type
!= MEM_TYPE_NON_LISP
)
932 mem_insert (val
, (char *) val
+ nbytes
, type
);
935 MALLOC_UNBLOCK_INPUT
;
937 memory_full (nbytes
);
941 /* Free BLOCK. This must be called to free memory allocated with a
942 call to lisp_malloc. */
945 lisp_free (void *block
)
949 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
950 mem_delete (mem_find (block
));
952 MALLOC_UNBLOCK_INPUT
;
955 /***** Allocation of aligned blocks of memory to store Lisp data. *****/
957 /* The entry point is lisp_align_malloc which returns blocks of at most
958 BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
960 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
961 #define USE_POSIX_MEMALIGN 1
964 /* BLOCK_ALIGN has to be a power of 2. */
965 #define BLOCK_ALIGN (1 << 10)
967 /* Padding to leave at the end of a malloc'd block. This is to give
968 malloc a chance to minimize the amount of memory wasted to alignment.
969 It should be tuned to the particular malloc library used.
970 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
971 posix_memalign on the other hand would ideally prefer a value of 4
972 because otherwise, there's 1020 bytes wasted between each ablocks.
973 In Emacs, testing shows that those 1020 can most of the time be
974 efficiently used by malloc to place other objects, so a value of 0 can
975 still preferable unless you have a lot of aligned blocks and virtually
977 #define BLOCK_PADDING 0
978 #define BLOCK_BYTES \
979 (BLOCK_ALIGN - sizeof (struct ablocks *) - BLOCK_PADDING)
981 /* Internal data structures and constants. */
983 #define ABLOCKS_SIZE 16
985 /* An aligned block of memory. */
990 char payload
[BLOCK_BYTES
];
991 struct ablock
*next_free
;
993 /* `abase' is the aligned base of the ablocks. */
994 /* It is overloaded to hold the virtual `busy' field that counts
995 the number of used ablock in the parent ablocks.
996 The first ablock has the `busy' field, the others have the `abase'
997 field. To tell the difference, we assume that pointers will have
998 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
999 is used to tell whether the real base of the parent ablocks is `abase'
1000 (if not, the word before the first ablock holds a pointer to the
1002 struct ablocks
*abase
;
1003 /* The padding of all but the last ablock is unused. The padding of
1004 the last ablock in an ablocks is not allocated. */
1006 char padding
[BLOCK_PADDING
];
1010 /* A bunch of consecutive aligned blocks. */
1013 struct ablock blocks
[ABLOCKS_SIZE
];
1016 /* Size of the block requested from malloc or posix_memalign. */
1017 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
1019 #define ABLOCK_ABASE(block) \
1020 (((uintptr_t) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
1021 ? (struct ablocks *)(block) \
1024 /* Virtual `busy' field. */
1025 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
1027 /* Pointer to the (not necessarily aligned) malloc block. */
1028 #ifdef USE_POSIX_MEMALIGN
1029 #define ABLOCKS_BASE(abase) (abase)
1031 #define ABLOCKS_BASE(abase) \
1032 (1 & (intptr_t) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
1035 /* The list of free ablock. */
1036 static struct ablock
*free_ablock
;
1038 /* Allocate an aligned block of nbytes.
1039 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
1040 smaller or equal to BLOCK_BYTES. */
1042 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
1045 struct ablocks
*abase
;
1047 eassert (nbytes
<= BLOCK_BYTES
);
1051 #ifdef GC_MALLOC_CHECK
1052 allocated_mem_type
= type
;
1058 intptr_t aligned
; /* int gets warning casting to 64-bit pointer. */
1060 #ifdef DOUG_LEA_MALLOC
1061 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1062 because mapped region contents are not preserved in
1064 mallopt (M_MMAP_MAX
, 0);
1067 #ifdef USE_POSIX_MEMALIGN
1069 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1075 base
= malloc (ABLOCKS_BYTES
);
1076 abase
= ALIGN (base
, BLOCK_ALIGN
);
1081 MALLOC_UNBLOCK_INPUT
;
1082 memory_full (ABLOCKS_BYTES
);
1085 aligned
= (base
== abase
);
1087 ((void**)abase
)[-1] = base
;
1089 #ifdef DOUG_LEA_MALLOC
1090 /* Back to a reasonable maximum of mmap'ed areas. */
1091 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1095 /* If the memory just allocated cannot be addressed thru a Lisp
1096 object's pointer, and it needs to be, that's equivalent to
1097 running out of memory. */
1098 if (type
!= MEM_TYPE_NON_LISP
)
1101 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1102 XSETCONS (tem
, end
);
1103 if ((char *) XCONS (tem
) != end
)
1105 lisp_malloc_loser
= base
;
1107 MALLOC_UNBLOCK_INPUT
;
1108 memory_full (SIZE_MAX
);
1113 /* Initialize the blocks and put them on the free list.
1114 If `base' was not properly aligned, we can't use the last block. */
1115 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1117 abase
->blocks
[i
].abase
= abase
;
1118 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1119 free_ablock
= &abase
->blocks
[i
];
1121 ABLOCKS_BUSY (abase
) = (struct ablocks
*) aligned
;
1123 eassert (0 == ((uintptr_t) abase
) % BLOCK_ALIGN
);
1124 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1125 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1126 eassert (ABLOCKS_BASE (abase
) == base
);
1127 eassert (aligned
== (intptr_t) ABLOCKS_BUSY (abase
));
1130 abase
= ABLOCK_ABASE (free_ablock
);
1131 ABLOCKS_BUSY (abase
) =
1132 (struct ablocks
*) (2 + (intptr_t) ABLOCKS_BUSY (abase
));
1134 free_ablock
= free_ablock
->x
.next_free
;
1136 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1137 if (type
!= MEM_TYPE_NON_LISP
)
1138 mem_insert (val
, (char *) val
+ nbytes
, type
);
1141 MALLOC_UNBLOCK_INPUT
;
1143 eassert (0 == ((uintptr_t) val
) % BLOCK_ALIGN
);
1148 lisp_align_free (void *block
)
1150 struct ablock
*ablock
= block
;
1151 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1154 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1155 mem_delete (mem_find (block
));
1157 /* Put on free list. */
1158 ablock
->x
.next_free
= free_ablock
;
1159 free_ablock
= ablock
;
1160 /* Update busy count. */
1161 ABLOCKS_BUSY (abase
)
1162 = (struct ablocks
*) (-2 + (intptr_t) ABLOCKS_BUSY (abase
));
1164 if (2 > (intptr_t) ABLOCKS_BUSY (abase
))
1165 { /* All the blocks are free. */
1166 int i
= 0, aligned
= (intptr_t) ABLOCKS_BUSY (abase
);
1167 struct ablock
**tem
= &free_ablock
;
1168 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1172 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1175 *tem
= (*tem
)->x
.next_free
;
1178 tem
= &(*tem
)->x
.next_free
;
1180 eassert ((aligned
& 1) == aligned
);
1181 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1182 #ifdef USE_POSIX_MEMALIGN
1183 eassert ((uintptr_t) ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1185 free (ABLOCKS_BASE (abase
));
1187 MALLOC_UNBLOCK_INPUT
;
1190 /* Return a new buffer structure allocated from the heap with
1191 a call to lisp_malloc. */
1194 allocate_buffer (void)
1197 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1199 XSETPVECTYPESIZE (b
, PVEC_BUFFER
,
1200 ((sizeof (struct buffer
) + sizeof (EMACS_INT
) - 1)
1201 / sizeof (EMACS_INT
)));
1206 #ifndef SYSTEM_MALLOC
1208 /* Arranging to disable input signals while we're in malloc.
1210 This only works with GNU malloc. To help out systems which can't
1211 use GNU malloc, all the calls to malloc, realloc, and free
1212 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1213 pair; unfortunately, we have no idea what C library functions
1214 might call malloc, so we can't really protect them unless you're
1215 using GNU malloc. Fortunately, most of the major operating systems
1216 can use GNU malloc. */
1219 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
1220 there's no need to block input around malloc. */
1222 #ifndef DOUG_LEA_MALLOC
1223 extern void * (*__malloc_hook
) (size_t, const void *);
1224 extern void * (*__realloc_hook
) (void *, size_t, const void *);
1225 extern void (*__free_hook
) (void *, const void *);
1226 /* Else declared in malloc.h, perhaps with an extra arg. */
1227 #endif /* DOUG_LEA_MALLOC */
1228 static void * (*old_malloc_hook
) (size_t, const void *);
1229 static void * (*old_realloc_hook
) (void *, size_t, const void*);
1230 static void (*old_free_hook
) (void*, const void*);
1232 #ifdef DOUG_LEA_MALLOC
1233 # define BYTES_USED (mallinfo ().uordblks)
1235 # define BYTES_USED _bytes_used
1238 #ifdef GC_MALLOC_CHECK
1239 static int dont_register_blocks
;
1242 static size_t bytes_used_when_reconsidered
;
1244 /* Value of _bytes_used, when spare_memory was freed. */
1246 static size_t bytes_used_when_full
;
1248 /* This function is used as the hook for free to call. */
1251 emacs_blocked_free (void *ptr
, const void *ptr2
)
1255 #ifdef GC_MALLOC_CHECK
1261 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1264 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1269 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1273 #endif /* GC_MALLOC_CHECK */
1275 __free_hook
= old_free_hook
;
1278 /* If we released our reserve (due to running out of memory),
1279 and we have a fair amount free once again,
1280 try to set aside another reserve in case we run out once more. */
1281 if (! NILP (Vmemory_full
)
1282 /* Verify there is enough space that even with the malloc
1283 hysteresis this call won't run out again.
1284 The code here is correct as long as SPARE_MEMORY
1285 is substantially larger than the block size malloc uses. */
1286 && (bytes_used_when_full
1287 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1288 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1289 refill_memory_reserve ();
1291 __free_hook
= emacs_blocked_free
;
1292 UNBLOCK_INPUT_ALLOC
;
1296 /* This function is the malloc hook that Emacs uses. */
1299 emacs_blocked_malloc (size_t size
, const void *ptr
)
1304 __malloc_hook
= old_malloc_hook
;
1305 #ifdef DOUG_LEA_MALLOC
1306 /* Segfaults on my system. --lorentey */
1307 /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */
1309 __malloc_extra_blocks
= malloc_hysteresis
;
1312 value
= (void *) malloc (size
);
1314 #ifdef GC_MALLOC_CHECK
1316 struct mem_node
*m
= mem_find (value
);
1319 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1321 fprintf (stderr
, "Region in use is %p...%p, %td bytes, type %d\n",
1322 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1327 if (!dont_register_blocks
)
1329 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1330 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1333 #endif /* GC_MALLOC_CHECK */
1335 __malloc_hook
= emacs_blocked_malloc
;
1336 UNBLOCK_INPUT_ALLOC
;
1338 /* fprintf (stderr, "%p malloc\n", value); */
1343 /* This function is the realloc hook that Emacs uses. */
1346 emacs_blocked_realloc (void *ptr
, size_t size
, const void *ptr2
)
1351 __realloc_hook
= old_realloc_hook
;
1353 #ifdef GC_MALLOC_CHECK
1356 struct mem_node
*m
= mem_find (ptr
);
1357 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1360 "Realloc of %p which wasn't allocated with malloc\n",
1368 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1370 /* Prevent malloc from registering blocks. */
1371 dont_register_blocks
= 1;
1372 #endif /* GC_MALLOC_CHECK */
1374 value
= (void *) realloc (ptr
, size
);
1376 #ifdef GC_MALLOC_CHECK
1377 dont_register_blocks
= 0;
1380 struct mem_node
*m
= mem_find (value
);
1383 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1387 /* Can't handle zero size regions in the red-black tree. */
1388 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1391 /* fprintf (stderr, "%p <- realloc\n", value); */
1392 #endif /* GC_MALLOC_CHECK */
1394 __realloc_hook
= emacs_blocked_realloc
;
1395 UNBLOCK_INPUT_ALLOC
;
1402 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1403 normal malloc. Some thread implementations need this as they call
1404 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1405 calls malloc because it is the first call, and we have an endless loop. */
1408 reset_malloc_hooks (void)
1410 __free_hook
= old_free_hook
;
1411 __malloc_hook
= old_malloc_hook
;
1412 __realloc_hook
= old_realloc_hook
;
1414 #endif /* HAVE_PTHREAD */
1417 /* Called from main to set up malloc to use our hooks. */
1420 uninterrupt_malloc (void)
1423 #ifdef DOUG_LEA_MALLOC
1424 pthread_mutexattr_t attr
;
1426 /* GLIBC has a faster way to do this, but let's keep it portable.
1427 This is according to the Single UNIX Specification. */
1428 pthread_mutexattr_init (&attr
);
1429 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1430 pthread_mutex_init (&alloc_mutex
, &attr
);
1431 #else /* !DOUG_LEA_MALLOC */
1432 /* Some systems such as Solaris 2.6 don't have a recursive mutex,
1433 and the bundled gmalloc.c doesn't require it. */
1434 pthread_mutex_init (&alloc_mutex
, NULL
);
1435 #endif /* !DOUG_LEA_MALLOC */
1436 #endif /* HAVE_PTHREAD */
1438 if (__free_hook
!= emacs_blocked_free
)
1439 old_free_hook
= __free_hook
;
1440 __free_hook
= emacs_blocked_free
;
1442 if (__malloc_hook
!= emacs_blocked_malloc
)
1443 old_malloc_hook
= __malloc_hook
;
1444 __malloc_hook
= emacs_blocked_malloc
;
1446 if (__realloc_hook
!= emacs_blocked_realloc
)
1447 old_realloc_hook
= __realloc_hook
;
1448 __realloc_hook
= emacs_blocked_realloc
;
1451 #endif /* not SYNC_INPUT */
1452 #endif /* not SYSTEM_MALLOC */
1456 /***********************************************************************
1458 ***********************************************************************/
1460 /* Number of intervals allocated in an interval_block structure.
1461 The 1020 is 1024 minus malloc overhead. */
1463 #define INTERVAL_BLOCK_SIZE \
1464 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1466 /* Intervals are allocated in chunks in form of an interval_block
1469 struct interval_block
1471 /* Place `intervals' first, to preserve alignment. */
1472 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1473 struct interval_block
*next
;
1476 /* Current interval block. Its `next' pointer points to older
1479 static struct interval_block
*interval_block
;
1481 /* Index in interval_block above of the next unused interval
1484 static int interval_block_index
;
1486 /* Number of free and live intervals. */
1488 static EMACS_INT total_free_intervals
, total_intervals
;
1490 /* List of free intervals. */
1492 static INTERVAL interval_free_list
;
1495 /* Initialize interval allocation. */
1498 init_intervals (void)
1500 interval_block
= NULL
;
1501 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1502 interval_free_list
= 0;
1506 /* Return a new interval. */
1509 make_interval (void)
1513 /* eassert (!handling_signal); */
1517 if (interval_free_list
)
1519 val
= interval_free_list
;
1520 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1524 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1526 register struct interval_block
*newi
;
1528 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1531 newi
->next
= interval_block
;
1532 interval_block
= newi
;
1533 interval_block_index
= 0;
1535 val
= &interval_block
->intervals
[interval_block_index
++];
1538 MALLOC_UNBLOCK_INPUT
;
1540 consing_since_gc
+= sizeof (struct interval
);
1542 RESET_INTERVAL (val
);
1548 /* Mark Lisp objects in interval I. */
1551 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1553 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1555 mark_object (i
->plist
);
1559 /* Mark the interval tree rooted in TREE. Don't call this directly;
1560 use the macro MARK_INTERVAL_TREE instead. */
1563 mark_interval_tree (register INTERVAL tree
)
1565 /* No need to test if this tree has been marked already; this
1566 function is always called through the MARK_INTERVAL_TREE macro,
1567 which takes care of that. */
1569 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1573 /* Mark the interval tree rooted in I. */
1575 #define MARK_INTERVAL_TREE(i) \
1577 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1578 mark_interval_tree (i); \
1582 #define UNMARK_BALANCE_INTERVALS(i) \
1584 if (! NULL_INTERVAL_P (i)) \
1585 (i) = balance_intervals (i); \
1588 /***********************************************************************
1590 ***********************************************************************/
1592 /* Lisp_Strings are allocated in string_block structures. When a new
1593 string_block is allocated, all the Lisp_Strings it contains are
1594 added to a free-list string_free_list. When a new Lisp_String is
1595 needed, it is taken from that list. During the sweep phase of GC,
1596 string_blocks that are entirely free are freed, except two which
1599 String data is allocated from sblock structures. Strings larger
1600 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1601 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1603 Sblocks consist internally of sdata structures, one for each
1604 Lisp_String. The sdata structure points to the Lisp_String it
1605 belongs to. The Lisp_String points back to the `u.data' member of
1606 its sdata structure.
1608 When a Lisp_String is freed during GC, it is put back on
1609 string_free_list, and its `data' member and its sdata's `string'
1610 pointer is set to null. The size of the string is recorded in the
1611 `u.nbytes' member of the sdata. So, sdata structures that are no
1612 longer used, can be easily recognized, and it's easy to compact the
1613 sblocks of small strings which we do in compact_small_strings. */
1615 /* Size in bytes of an sblock structure used for small strings. This
1616 is 8192 minus malloc overhead. */
1618 #define SBLOCK_SIZE 8188
1620 /* Strings larger than this are considered large strings. String data
1621 for large strings is allocated from individual sblocks. */
1623 #define LARGE_STRING_BYTES 1024
1625 /* Structure describing string memory sub-allocated from an sblock.
1626 This is where the contents of Lisp strings are stored. */
1630 /* Back-pointer to the string this sdata belongs to. If null, this
1631 structure is free, and the NBYTES member of the union below
1632 contains the string's byte size (the same value that STRING_BYTES
1633 would return if STRING were non-null). If non-null, STRING_BYTES
1634 (STRING) is the size of the data, and DATA contains the string's
1636 struct Lisp_String
*string
;
1638 #ifdef GC_CHECK_STRING_BYTES
1641 unsigned char data
[1];
1643 #define SDATA_NBYTES(S) (S)->nbytes
1644 #define SDATA_DATA(S) (S)->data
1645 #define SDATA_SELECTOR(member) member
1647 #else /* not GC_CHECK_STRING_BYTES */
1651 /* When STRING is non-null. */
1652 unsigned char data
[1];
1654 /* When STRING is null. */
1658 #define SDATA_NBYTES(S) (S)->u.nbytes
1659 #define SDATA_DATA(S) (S)->u.data
1660 #define SDATA_SELECTOR(member) u.member
1662 #endif /* not GC_CHECK_STRING_BYTES */
1664 #define SDATA_DATA_OFFSET offsetof (struct sdata, SDATA_SELECTOR (data))
1668 /* Structure describing a block of memory which is sub-allocated to
1669 obtain string data memory for strings. Blocks for small strings
1670 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1671 as large as needed. */
1676 struct sblock
*next
;
1678 /* Pointer to the next free sdata block. This points past the end
1679 of the sblock if there isn't any space left in this block. */
1680 struct sdata
*next_free
;
1682 /* Start of data. */
1683 struct sdata first_data
;
1686 /* Number of Lisp strings in a string_block structure. The 1020 is
1687 1024 minus malloc overhead. */
1689 #define STRING_BLOCK_SIZE \
1690 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1692 /* Structure describing a block from which Lisp_String structures
1697 /* Place `strings' first, to preserve alignment. */
1698 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1699 struct string_block
*next
;
1702 /* Head and tail of the list of sblock structures holding Lisp string
1703 data. We always allocate from current_sblock. The NEXT pointers
1704 in the sblock structures go from oldest_sblock to current_sblock. */
1706 static struct sblock
*oldest_sblock
, *current_sblock
;
1708 /* List of sblocks for large strings. */
1710 static struct sblock
*large_sblocks
;
1712 /* List of string_block structures. */
1714 static struct string_block
*string_blocks
;
1716 /* Free-list of Lisp_Strings. */
1718 static struct Lisp_String
*string_free_list
;
1720 /* Number of live and free Lisp_Strings. */
1722 static EMACS_INT total_strings
, total_free_strings
;
1724 /* Number of bytes used by live strings. */
1726 static EMACS_INT total_string_size
;
1728 /* Given a pointer to a Lisp_String S which is on the free-list
1729 string_free_list, return a pointer to its successor in the
1732 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1734 /* Return a pointer to the sdata structure belonging to Lisp string S.
1735 S must be live, i.e. S->data must not be null. S->data is actually
1736 a pointer to the `u.data' member of its sdata structure; the
1737 structure starts at a constant offset in front of that. */
1739 #define SDATA_OF_STRING(S) ((struct sdata *) ((S)->data - SDATA_DATA_OFFSET))
1742 #ifdef GC_CHECK_STRING_OVERRUN
1744 /* We check for overrun in string data blocks by appending a small
1745 "cookie" after each allocated string data block, and check for the
1746 presence of this cookie during GC. */
1748 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1749 static char const string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1750 { '\xde', '\xad', '\xbe', '\xef' };
1753 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1756 /* Value is the size of an sdata structure large enough to hold NBYTES
1757 bytes of string data. The value returned includes a terminating
1758 NUL byte, the size of the sdata structure, and padding. */
1760 #ifdef GC_CHECK_STRING_BYTES
1762 #define SDATA_SIZE(NBYTES) \
1763 ((SDATA_DATA_OFFSET \
1765 + sizeof (ptrdiff_t) - 1) \
1766 & ~(sizeof (ptrdiff_t) - 1))
1768 #else /* not GC_CHECK_STRING_BYTES */
1770 /* The 'max' reserves space for the nbytes union member even when NBYTES + 1 is
1771 less than the size of that member. The 'max' is not needed when
1772 SDATA_DATA_OFFSET is a multiple of sizeof (ptrdiff_t), because then the
1773 alignment code reserves enough space. */
1775 #define SDATA_SIZE(NBYTES) \
1776 ((SDATA_DATA_OFFSET \
1777 + (SDATA_DATA_OFFSET % sizeof (ptrdiff_t) == 0 \
1779 : max (NBYTES, sizeof (ptrdiff_t) - 1)) \
1781 + sizeof (ptrdiff_t) - 1) \
1782 & ~(sizeof (ptrdiff_t) - 1))
1784 #endif /* not GC_CHECK_STRING_BYTES */
1786 /* Extra bytes to allocate for each string. */
1788 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1790 /* Exact bound on the number of bytes in a string, not counting the
1791 terminating null. A string cannot contain more bytes than
1792 STRING_BYTES_BOUND, nor can it be so long that the size_t
1793 arithmetic in allocate_string_data would overflow while it is
1794 calculating a value to be passed to malloc. */
1795 #define STRING_BYTES_MAX \
1796 min (STRING_BYTES_BOUND, \
1797 ((SIZE_MAX - XMALLOC_OVERRUN_CHECK_OVERHEAD \
1799 - offsetof (struct sblock, first_data) \
1800 - SDATA_DATA_OFFSET) \
1801 & ~(sizeof (EMACS_INT) - 1)))
1803 /* Initialize string allocation. Called from init_alloc_once. */
1808 total_strings
= total_free_strings
= total_string_size
= 0;
1809 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1810 string_blocks
= NULL
;
1811 string_free_list
= NULL
;
1812 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1813 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1817 #ifdef GC_CHECK_STRING_BYTES
1819 static int check_string_bytes_count
;
1821 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1824 /* Like GC_STRING_BYTES, but with debugging check. */
1827 string_bytes (struct Lisp_String
*s
)
1830 (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1832 if (!PURE_POINTER_P (s
)
1834 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1839 /* Check validity of Lisp strings' string_bytes member in B. */
1842 check_sblock (struct sblock
*b
)
1844 struct sdata
*from
, *end
, *from_end
;
1848 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1850 /* Compute the next FROM here because copying below may
1851 overwrite data we need to compute it. */
1854 /* Check that the string size recorded in the string is the
1855 same as the one recorded in the sdata structure. */
1857 CHECK_STRING_BYTES (from
->string
);
1860 nbytes
= GC_STRING_BYTES (from
->string
);
1862 nbytes
= SDATA_NBYTES (from
);
1864 nbytes
= SDATA_SIZE (nbytes
);
1865 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1870 /* Check validity of Lisp strings' string_bytes member. ALL_P
1871 non-zero means check all strings, otherwise check only most
1872 recently allocated strings. Used for hunting a bug. */
1875 check_string_bytes (int all_p
)
1881 for (b
= large_sblocks
; b
; b
= b
->next
)
1883 struct Lisp_String
*s
= b
->first_data
.string
;
1885 CHECK_STRING_BYTES (s
);
1888 for (b
= oldest_sblock
; b
; b
= b
->next
)
1892 check_sblock (current_sblock
);
1895 #endif /* GC_CHECK_STRING_BYTES */
1897 #ifdef GC_CHECK_STRING_FREE_LIST
1899 /* Walk through the string free list looking for bogus next pointers.
1900 This may catch buffer overrun from a previous string. */
1903 check_string_free_list (void)
1905 struct Lisp_String
*s
;
1907 /* Pop a Lisp_String off the free-list. */
1908 s
= string_free_list
;
1911 if ((uintptr_t) s
< 1024)
1913 s
= NEXT_FREE_LISP_STRING (s
);
1917 #define check_string_free_list()
1920 /* Return a new Lisp_String. */
1922 static struct Lisp_String
*
1923 allocate_string (void)
1925 struct Lisp_String
*s
;
1927 /* eassert (!handling_signal); */
1931 /* If the free-list is empty, allocate a new string_block, and
1932 add all the Lisp_Strings in it to the free-list. */
1933 if (string_free_list
== NULL
)
1935 struct string_block
*b
;
1938 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1939 memset (b
, 0, sizeof *b
);
1940 b
->next
= string_blocks
;
1943 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1946 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1947 string_free_list
= s
;
1950 total_free_strings
+= STRING_BLOCK_SIZE
;
1953 check_string_free_list ();
1955 /* Pop a Lisp_String off the free-list. */
1956 s
= string_free_list
;
1957 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1959 MALLOC_UNBLOCK_INPUT
;
1961 /* Probably not strictly necessary, but play it safe. */
1962 memset (s
, 0, sizeof *s
);
1964 --total_free_strings
;
1967 consing_since_gc
+= sizeof *s
;
1969 #ifdef GC_CHECK_STRING_BYTES
1970 if (!noninteractive
)
1972 if (++check_string_bytes_count
== 200)
1974 check_string_bytes_count
= 0;
1975 check_string_bytes (1);
1978 check_string_bytes (0);
1980 #endif /* GC_CHECK_STRING_BYTES */
1986 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1987 plus a NUL byte at the end. Allocate an sdata structure for S, and
1988 set S->data to its `u.data' member. Store a NUL byte at the end of
1989 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1990 S->data if it was initially non-null. */
1993 allocate_string_data (struct Lisp_String
*s
,
1994 EMACS_INT nchars
, EMACS_INT nbytes
)
1996 struct sdata
*data
, *old_data
;
1998 ptrdiff_t needed
, old_nbytes
;
2000 if (STRING_BYTES_MAX
< nbytes
)
2003 /* Determine the number of bytes needed to store NBYTES bytes
2005 needed
= SDATA_SIZE (nbytes
);
2006 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
2007 old_nbytes
= GC_STRING_BYTES (s
);
2011 if (nbytes
> LARGE_STRING_BYTES
)
2013 size_t size
= offsetof (struct sblock
, first_data
) + needed
;
2015 #ifdef DOUG_LEA_MALLOC
2016 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2017 because mapped region contents are not preserved in
2020 In case you think of allowing it in a dumped Emacs at the
2021 cost of not being able to re-dump, there's another reason:
2022 mmap'ed data typically have an address towards the top of the
2023 address space, which won't fit into an EMACS_INT (at least on
2024 32-bit systems with the current tagging scheme). --fx */
2025 mallopt (M_MMAP_MAX
, 0);
2028 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
2030 #ifdef DOUG_LEA_MALLOC
2031 /* Back to a reasonable maximum of mmap'ed areas. */
2032 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2035 b
->next_free
= &b
->first_data
;
2036 b
->first_data
.string
= NULL
;
2037 b
->next
= large_sblocks
;
2040 else if (current_sblock
== NULL
2041 || (((char *) current_sblock
+ SBLOCK_SIZE
2042 - (char *) current_sblock
->next_free
)
2043 < (needed
+ GC_STRING_EXTRA
)))
2045 /* Not enough room in the current sblock. */
2046 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
2047 b
->next_free
= &b
->first_data
;
2048 b
->first_data
.string
= NULL
;
2052 current_sblock
->next
= b
;
2060 data
= b
->next_free
;
2061 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
2063 MALLOC_UNBLOCK_INPUT
;
2066 s
->data
= SDATA_DATA (data
);
2067 #ifdef GC_CHECK_STRING_BYTES
2068 SDATA_NBYTES (data
) = nbytes
;
2071 s
->size_byte
= nbytes
;
2072 s
->data
[nbytes
] = '\0';
2073 #ifdef GC_CHECK_STRING_OVERRUN
2074 memcpy ((char *) data
+ needed
, string_overrun_cookie
,
2075 GC_STRING_OVERRUN_COOKIE_SIZE
);
2078 /* If S had already data assigned, mark that as free by setting its
2079 string back-pointer to null, and recording the size of the data
2083 SDATA_NBYTES (old_data
) = old_nbytes
;
2084 old_data
->string
= NULL
;
2087 consing_since_gc
+= needed
;
2091 /* Sweep and compact strings. */
2094 sweep_strings (void)
2096 struct string_block
*b
, *next
;
2097 struct string_block
*live_blocks
= NULL
;
2099 string_free_list
= NULL
;
2100 total_strings
= total_free_strings
= 0;
2101 total_string_size
= 0;
2103 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2104 for (b
= string_blocks
; b
; b
= next
)
2107 struct Lisp_String
*free_list_before
= string_free_list
;
2111 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2113 struct Lisp_String
*s
= b
->strings
+ i
;
2117 /* String was not on free-list before. */
2118 if (STRING_MARKED_P (s
))
2120 /* String is live; unmark it and its intervals. */
2123 if (!NULL_INTERVAL_P (s
->intervals
))
2124 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2127 total_string_size
+= STRING_BYTES (s
);
2131 /* String is dead. Put it on the free-list. */
2132 struct sdata
*data
= SDATA_OF_STRING (s
);
2134 /* Save the size of S in its sdata so that we know
2135 how large that is. Reset the sdata's string
2136 back-pointer so that we know it's free. */
2137 #ifdef GC_CHECK_STRING_BYTES
2138 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2141 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2143 data
->string
= NULL
;
2145 /* Reset the strings's `data' member so that we
2149 /* Put the string on the free-list. */
2150 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2151 string_free_list
= s
;
2157 /* S was on the free-list before. Put it there again. */
2158 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2159 string_free_list
= s
;
2164 /* Free blocks that contain free Lisp_Strings only, except
2165 the first two of them. */
2166 if (nfree
== STRING_BLOCK_SIZE
2167 && total_free_strings
> STRING_BLOCK_SIZE
)
2170 string_free_list
= free_list_before
;
2174 total_free_strings
+= nfree
;
2175 b
->next
= live_blocks
;
2180 check_string_free_list ();
2182 string_blocks
= live_blocks
;
2183 free_large_strings ();
2184 compact_small_strings ();
2186 check_string_free_list ();
2190 /* Free dead large strings. */
2193 free_large_strings (void)
2195 struct sblock
*b
, *next
;
2196 struct sblock
*live_blocks
= NULL
;
2198 for (b
= large_sblocks
; b
; b
= next
)
2202 if (b
->first_data
.string
== NULL
)
2206 b
->next
= live_blocks
;
2211 large_sblocks
= live_blocks
;
2215 /* Compact data of small strings. Free sblocks that don't contain
2216 data of live strings after compaction. */
2219 compact_small_strings (void)
2221 struct sblock
*b
, *tb
, *next
;
2222 struct sdata
*from
, *to
, *end
, *tb_end
;
2223 struct sdata
*to_end
, *from_end
;
2225 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2226 to, and TB_END is the end of TB. */
2228 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2229 to
= &tb
->first_data
;
2231 /* Step through the blocks from the oldest to the youngest. We
2232 expect that old blocks will stabilize over time, so that less
2233 copying will happen this way. */
2234 for (b
= oldest_sblock
; b
; b
= b
->next
)
2237 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2239 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2241 /* Compute the next FROM here because copying below may
2242 overwrite data we need to compute it. */
2245 #ifdef GC_CHECK_STRING_BYTES
2246 /* Check that the string size recorded in the string is the
2247 same as the one recorded in the sdata structure. */
2249 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2251 #endif /* GC_CHECK_STRING_BYTES */
2254 nbytes
= GC_STRING_BYTES (from
->string
);
2256 nbytes
= SDATA_NBYTES (from
);
2258 if (nbytes
> LARGE_STRING_BYTES
)
2261 nbytes
= SDATA_SIZE (nbytes
);
2262 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2264 #ifdef GC_CHECK_STRING_OVERRUN
2265 if (memcmp (string_overrun_cookie
,
2266 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
2267 GC_STRING_OVERRUN_COOKIE_SIZE
))
2271 /* FROM->string non-null means it's alive. Copy its data. */
2274 /* If TB is full, proceed with the next sblock. */
2275 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2276 if (to_end
> tb_end
)
2280 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2281 to
= &tb
->first_data
;
2282 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2285 /* Copy, and update the string's `data' pointer. */
2288 xassert (tb
!= b
|| to
< from
);
2289 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
2290 to
->string
->data
= SDATA_DATA (to
);
2293 /* Advance past the sdata we copied to. */
2299 /* The rest of the sblocks following TB don't contain live data, so
2300 we can free them. */
2301 for (b
= tb
->next
; b
; b
= next
)
2309 current_sblock
= tb
;
2313 string_overflow (void)
2315 error ("Maximum string size exceeded");
2318 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2319 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2320 LENGTH must be an integer.
2321 INIT must be an integer that represents a character. */)
2322 (Lisp_Object length
, Lisp_Object init
)
2324 register Lisp_Object val
;
2325 register unsigned char *p
, *end
;
2329 CHECK_NATNUM (length
);
2330 CHECK_CHARACTER (init
);
2332 c
= XFASTINT (init
);
2333 if (ASCII_CHAR_P (c
))
2335 nbytes
= XINT (length
);
2336 val
= make_uninit_string (nbytes
);
2338 end
= p
+ SCHARS (val
);
2344 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2345 int len
= CHAR_STRING (c
, str
);
2346 EMACS_INT string_len
= XINT (length
);
2348 if (string_len
> STRING_BYTES_MAX
/ len
)
2350 nbytes
= len
* string_len
;
2351 val
= make_uninit_multibyte_string (string_len
, nbytes
);
2356 memcpy (p
, str
, len
);
2366 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2367 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2368 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2369 (Lisp_Object length
, Lisp_Object init
)
2371 register Lisp_Object val
;
2372 struct Lisp_Bool_Vector
*p
;
2373 ptrdiff_t length_in_chars
;
2374 EMACS_INT length_in_elts
;
2377 CHECK_NATNUM (length
);
2379 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2381 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2383 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2384 slot `size' of the struct Lisp_Bool_Vector. */
2385 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2387 /* No Lisp_Object to trace in there. */
2388 XSETPVECTYPESIZE (XVECTOR (val
), PVEC_BOOL_VECTOR
, 0);
2390 p
= XBOOL_VECTOR (val
);
2391 p
->size
= XFASTINT (length
);
2393 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2394 / BOOL_VECTOR_BITS_PER_CHAR
);
2395 if (length_in_chars
)
2397 memset (p
->data
, ! NILP (init
) ? -1 : 0, length_in_chars
);
2399 /* Clear any extraneous bits in the last byte. */
2400 p
->data
[length_in_chars
- 1]
2401 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2408 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2409 of characters from the contents. This string may be unibyte or
2410 multibyte, depending on the contents. */
2413 make_string (const char *contents
, ptrdiff_t nbytes
)
2415 register Lisp_Object val
;
2416 ptrdiff_t nchars
, multibyte_nbytes
;
2418 parse_str_as_multibyte ((const unsigned char *) contents
, nbytes
,
2419 &nchars
, &multibyte_nbytes
);
2420 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2421 /* CONTENTS contains no multibyte sequences or contains an invalid
2422 multibyte sequence. We must make unibyte string. */
2423 val
= make_unibyte_string (contents
, nbytes
);
2425 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2430 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2433 make_unibyte_string (const char *contents
, ptrdiff_t length
)
2435 register Lisp_Object val
;
2436 val
= make_uninit_string (length
);
2437 memcpy (SDATA (val
), contents
, length
);
2442 /* Make a multibyte string from NCHARS characters occupying NBYTES
2443 bytes at CONTENTS. */
2446 make_multibyte_string (const char *contents
,
2447 ptrdiff_t nchars
, ptrdiff_t nbytes
)
2449 register Lisp_Object val
;
2450 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2451 memcpy (SDATA (val
), contents
, nbytes
);
2456 /* Make a string from NCHARS characters occupying NBYTES bytes at
2457 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2460 make_string_from_bytes (const char *contents
,
2461 ptrdiff_t nchars
, ptrdiff_t nbytes
)
2463 register Lisp_Object val
;
2464 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2465 memcpy (SDATA (val
), contents
, nbytes
);
2466 if (SBYTES (val
) == SCHARS (val
))
2467 STRING_SET_UNIBYTE (val
);
2472 /* Make a string from NCHARS characters occupying NBYTES bytes at
2473 CONTENTS. The argument MULTIBYTE controls whether to label the
2474 string as multibyte. If NCHARS is negative, it counts the number of
2475 characters by itself. */
2478 make_specified_string (const char *contents
,
2479 ptrdiff_t nchars
, ptrdiff_t nbytes
, int multibyte
)
2481 register Lisp_Object val
;
2486 nchars
= multibyte_chars_in_text ((const unsigned char *) contents
,
2491 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2492 memcpy (SDATA (val
), contents
, nbytes
);
2494 STRING_SET_UNIBYTE (val
);
2499 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2500 occupying LENGTH bytes. */
2503 make_uninit_string (EMACS_INT length
)
2508 return empty_unibyte_string
;
2509 val
= make_uninit_multibyte_string (length
, length
);
2510 STRING_SET_UNIBYTE (val
);
2515 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2516 which occupy NBYTES bytes. */
2519 make_uninit_multibyte_string (EMACS_INT nchars
, EMACS_INT nbytes
)
2522 struct Lisp_String
*s
;
2527 return empty_multibyte_string
;
2529 s
= allocate_string ();
2530 allocate_string_data (s
, nchars
, nbytes
);
2531 XSETSTRING (string
, s
);
2532 string_chars_consed
+= nbytes
;
2538 /***********************************************************************
2540 ***********************************************************************/
2542 /* We store float cells inside of float_blocks, allocating a new
2543 float_block with malloc whenever necessary. Float cells reclaimed
2544 by GC are put on a free list to be reallocated before allocating
2545 any new float cells from the latest float_block. */
2547 #define FLOAT_BLOCK_SIZE \
2548 (((BLOCK_BYTES - sizeof (struct float_block *) \
2549 /* The compiler might add padding at the end. */ \
2550 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2551 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2553 #define GETMARKBIT(block,n) \
2554 (((block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2555 >> ((n) % (sizeof (int) * CHAR_BIT))) \
2558 #define SETMARKBIT(block,n) \
2559 (block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2560 |= 1 << ((n) % (sizeof (int) * CHAR_BIT))
2562 #define UNSETMARKBIT(block,n) \
2563 (block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2564 &= ~(1 << ((n) % (sizeof (int) * CHAR_BIT)))
2566 #define FLOAT_BLOCK(fptr) \
2567 ((struct float_block *) (((uintptr_t) (fptr)) & ~(BLOCK_ALIGN - 1)))
2569 #define FLOAT_INDEX(fptr) \
2570 ((((uintptr_t) (fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2574 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2575 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2576 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof (int) * CHAR_BIT
)];
2577 struct float_block
*next
;
2580 #define FLOAT_MARKED_P(fptr) \
2581 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2583 #define FLOAT_MARK(fptr) \
2584 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2586 #define FLOAT_UNMARK(fptr) \
2587 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2589 /* Current float_block. */
2591 static struct float_block
*float_block
;
2593 /* Index of first unused Lisp_Float in the current float_block. */
2595 static int float_block_index
;
2597 /* Free-list of Lisp_Floats. */
2599 static struct Lisp_Float
*float_free_list
;
2602 /* Initialize float allocation. */
2608 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2609 float_free_list
= 0;
2613 /* Return a new float object with value FLOAT_VALUE. */
2616 make_float (double float_value
)
2618 register Lisp_Object val
;
2620 /* eassert (!handling_signal); */
2624 if (float_free_list
)
2626 /* We use the data field for chaining the free list
2627 so that we won't use the same field that has the mark bit. */
2628 XSETFLOAT (val
, float_free_list
);
2629 float_free_list
= float_free_list
->u
.chain
;
2633 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2635 register struct float_block
*new;
2637 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2639 new->next
= float_block
;
2640 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2642 float_block_index
= 0;
2644 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2645 float_block_index
++;
2648 MALLOC_UNBLOCK_INPUT
;
2650 XFLOAT_INIT (val
, float_value
);
2651 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2652 consing_since_gc
+= sizeof (struct Lisp_Float
);
2659 /***********************************************************************
2661 ***********************************************************************/
2663 /* We store cons cells inside of cons_blocks, allocating a new
2664 cons_block with malloc whenever necessary. Cons cells reclaimed by
2665 GC are put on a free list to be reallocated before allocating
2666 any new cons cells from the latest cons_block. */
2668 #define CONS_BLOCK_SIZE \
2669 (((BLOCK_BYTES - sizeof (struct cons_block *) \
2670 /* The compiler might add padding at the end. */ \
2671 - (sizeof (struct Lisp_Cons) - sizeof (int))) * CHAR_BIT) \
2672 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2674 #define CONS_BLOCK(fptr) \
2675 ((struct cons_block *) ((uintptr_t) (fptr) & ~(BLOCK_ALIGN - 1)))
2677 #define CONS_INDEX(fptr) \
2678 (((uintptr_t) (fptr) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2682 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2683 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2684 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof (int) * CHAR_BIT
)];
2685 struct cons_block
*next
;
2688 #define CONS_MARKED_P(fptr) \
2689 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2691 #define CONS_MARK(fptr) \
2692 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2694 #define CONS_UNMARK(fptr) \
2695 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2697 /* Current cons_block. */
2699 static struct cons_block
*cons_block
;
2701 /* Index of first unused Lisp_Cons in the current block. */
2703 static int cons_block_index
;
2705 /* Free-list of Lisp_Cons structures. */
2707 static struct Lisp_Cons
*cons_free_list
;
2710 /* Initialize cons allocation. */
2716 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2721 /* Explicitly free a cons cell by putting it on the free-list. */
2724 free_cons (struct Lisp_Cons
*ptr
)
2726 ptr
->u
.chain
= cons_free_list
;
2730 cons_free_list
= ptr
;
2733 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2734 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2735 (Lisp_Object car
, Lisp_Object cdr
)
2737 register Lisp_Object val
;
2739 /* eassert (!handling_signal); */
2745 /* We use the cdr for chaining the free list
2746 so that we won't use the same field that has the mark bit. */
2747 XSETCONS (val
, cons_free_list
);
2748 cons_free_list
= cons_free_list
->u
.chain
;
2752 if (cons_block_index
== CONS_BLOCK_SIZE
)
2754 register struct cons_block
*new;
2755 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2757 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2758 new->next
= cons_block
;
2760 cons_block_index
= 0;
2762 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2766 MALLOC_UNBLOCK_INPUT
;
2770 eassert (!CONS_MARKED_P (XCONS (val
)));
2771 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2772 cons_cells_consed
++;
2776 #ifdef GC_CHECK_CONS_LIST
2777 /* Get an error now if there's any junk in the cons free list. */
2779 check_cons_list (void)
2781 struct Lisp_Cons
*tail
= cons_free_list
;
2784 tail
= tail
->u
.chain
;
2788 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2791 list1 (Lisp_Object arg1
)
2793 return Fcons (arg1
, Qnil
);
2797 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2799 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2804 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2806 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2811 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2813 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2818 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2820 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2821 Fcons (arg5
, Qnil
)))));
2825 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2826 doc
: /* Return a newly created list with specified arguments as elements.
2827 Any number of arguments, even zero arguments, are allowed.
2828 usage: (list &rest OBJECTS) */)
2829 (ptrdiff_t nargs
, Lisp_Object
*args
)
2831 register Lisp_Object val
;
2837 val
= Fcons (args
[nargs
], val
);
2843 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2844 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2845 (register Lisp_Object length
, Lisp_Object init
)
2847 register Lisp_Object val
;
2848 register EMACS_INT size
;
2850 CHECK_NATNUM (length
);
2851 size
= XFASTINT (length
);
2856 val
= Fcons (init
, val
);
2861 val
= Fcons (init
, val
);
2866 val
= Fcons (init
, val
);
2871 val
= Fcons (init
, val
);
2876 val
= Fcons (init
, val
);
2891 /***********************************************************************
2893 ***********************************************************************/
2895 /* This value is balanced well enough to avoid too much internal overhead
2896 for the most common cases; it's not required to be a power of two, but
2897 it's expected to be a mult-of-ROUNDUP_SIZE (see below). */
2899 #define VECTOR_BLOCK_SIZE 4096
2901 /* Handy constants for vectorlike objects. */
2904 header_size
= offsetof (struct Lisp_Vector
, contents
),
2905 word_size
= sizeof (Lisp_Object
),
2906 roundup_size
= COMMON_MULTIPLE (sizeof (Lisp_Object
),
2907 USE_LSB_TAG
? 1 << GCTYPEBITS
: 1)
2910 /* ROUNDUP_SIZE must be a power of 2. */
2911 verify ((roundup_size
& (roundup_size
- 1)) == 0);
2913 /* Round up X to nearest mult-of-ROUNDUP_SIZE. */
2915 #define vroundup(x) (((x) + (roundup_size - 1)) & ~(roundup_size - 1))
2917 /* Rounding helps to maintain alignment constraints if USE_LSB_TAG. */
2919 #define VECTOR_BLOCK_BYTES (VECTOR_BLOCK_SIZE - vroundup (sizeof (void *)))
2921 /* Size of the minimal vector allocated from block. */
2923 #define VBLOCK_BYTES_MIN vroundup (sizeof (struct Lisp_Vector))
2925 /* Size of the largest vector allocated from block. */
2927 #define VBLOCK_BYTES_MAX \
2928 vroundup ((VECTOR_BLOCK_BYTES / 2) - sizeof (Lisp_Object))
2930 /* We maintain one free list for each possible block-allocated
2931 vector size, and this is the number of free lists we have. */
2933 #define VECTOR_MAX_FREE_LIST_INDEX \
2934 ((VECTOR_BLOCK_BYTES - VBLOCK_BYTES_MIN) / roundup_size + 1)
2936 /* When the vector is on a free list, vectorlike_header.SIZE is set to
2937 this special value ORed with vector's memory footprint size. */
2939 #define VECTOR_FREE_LIST_FLAG (~(ARRAY_MARK_FLAG | PSEUDOVECTOR_FLAG \
2940 | (VECTOR_BLOCK_SIZE - 1)))
2942 /* Common shortcut to advance vector pointer over a block data. */
2944 #define ADVANCE(v, nbytes) ((struct Lisp_Vector *) ((char *) (v) + (nbytes)))
2946 /* Common shortcut to calculate NBYTES-vector index in VECTOR_FREE_LISTS. */
2948 #define VINDEX(nbytes) (((nbytes) - VBLOCK_BYTES_MIN) / roundup_size)
2950 /* Common shortcut to setup vector on a free list. */
2952 #define SETUP_ON_FREE_LIST(v, nbytes, index) \
2954 (v)->header.size = VECTOR_FREE_LIST_FLAG | (nbytes); \
2955 eassert ((nbytes) % roundup_size == 0); \
2956 (index) = VINDEX (nbytes); \
2957 eassert ((index) < VECTOR_MAX_FREE_LIST_INDEX); \
2958 (v)->header.next.vector = vector_free_lists[index]; \
2959 vector_free_lists[index] = (v); \
2964 char data
[VECTOR_BLOCK_BYTES
];
2965 struct vector_block
*next
;
2968 /* Chain of vector blocks. */
2970 static struct vector_block
*vector_blocks
;
2972 /* Vector free lists, where NTH item points to a chain of free
2973 vectors of the same NBYTES size, so NTH == VINDEX (NBYTES). */
2975 static struct Lisp_Vector
*vector_free_lists
[VECTOR_MAX_FREE_LIST_INDEX
];
2977 /* Singly-linked list of large vectors. */
2979 static struct Lisp_Vector
*large_vectors
;
2981 /* The only vector with 0 slots, allocated from pure space. */
2983 static struct Lisp_Vector
*zero_vector
;
2985 /* Get a new vector block. */
2987 static struct vector_block
*
2988 allocate_vector_block (void)
2990 struct vector_block
*block
;
2992 #ifdef DOUG_LEA_MALLOC
2993 mallopt (M_MMAP_MAX
, 0);
2996 block
= xmalloc (sizeof (struct vector_block
));
2998 #ifdef DOUG_LEA_MALLOC
2999 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
3002 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
3003 mem_insert (block
->data
, block
->data
+ VECTOR_BLOCK_BYTES
,
3004 MEM_TYPE_VECTOR_BLOCK
);
3007 block
->next
= vector_blocks
;
3008 vector_blocks
= block
;
3012 /* Called once to initialize vector allocation. */
3017 zero_vector
= pure_alloc (header_size
, Lisp_Vectorlike
);
3018 zero_vector
->header
.size
= 0;
3021 /* Allocate vector from a vector block. */
3023 static struct Lisp_Vector
*
3024 allocate_vector_from_block (size_t nbytes
)
3026 struct Lisp_Vector
*vector
, *rest
;
3027 struct vector_block
*block
;
3028 size_t index
, restbytes
;
3030 eassert (VBLOCK_BYTES_MIN
<= nbytes
&& nbytes
<= VBLOCK_BYTES_MAX
);
3031 eassert (nbytes
% roundup_size
== 0);
3033 /* First, try to allocate from a free list
3034 containing vectors of the requested size. */
3035 index
= VINDEX (nbytes
);
3036 if (vector_free_lists
[index
])
3038 vector
= vector_free_lists
[index
];
3039 vector_free_lists
[index
] = vector
->header
.next
.vector
;
3040 vector
->header
.next
.nbytes
= nbytes
;
3044 /* Next, check free lists containing larger vectors. Since
3045 we will split the result, we should have remaining space
3046 large enough to use for one-slot vector at least. */
3047 for (index
= VINDEX (nbytes
+ VBLOCK_BYTES_MIN
);
3048 index
< VECTOR_MAX_FREE_LIST_INDEX
; index
++)
3049 if (vector_free_lists
[index
])
3051 /* This vector is larger than requested. */
3052 vector
= vector_free_lists
[index
];
3053 vector_free_lists
[index
] = vector
->header
.next
.vector
;
3054 vector
->header
.next
.nbytes
= nbytes
;
3056 /* Excess bytes are used for the smaller vector,
3057 which should be set on an appropriate free list. */
3058 restbytes
= index
* roundup_size
+ VBLOCK_BYTES_MIN
- nbytes
;
3059 eassert (restbytes
% roundup_size
== 0);
3060 rest
= ADVANCE (vector
, nbytes
);
3061 SETUP_ON_FREE_LIST (rest
, restbytes
, index
);
3065 /* Finally, need a new vector block. */
3066 block
= allocate_vector_block ();
3068 /* New vector will be at the beginning of this block. */
3069 vector
= (struct Lisp_Vector
*) block
->data
;
3070 vector
->header
.next
.nbytes
= nbytes
;
3072 /* If the rest of space from this block is large enough
3073 for one-slot vector at least, set up it on a free list. */
3074 restbytes
= VECTOR_BLOCK_BYTES
- nbytes
;
3075 if (restbytes
>= VBLOCK_BYTES_MIN
)
3077 eassert (restbytes
% roundup_size
== 0);
3078 rest
= ADVANCE (vector
, nbytes
);
3079 SETUP_ON_FREE_LIST (rest
, restbytes
, index
);
3084 /* Return how many Lisp_Objects can be stored in V. */
3086 #define VECTOR_SIZE(v) ((v)->header.size & PSEUDOVECTOR_FLAG ? \
3087 (PSEUDOVECTOR_SIZE_MASK & (v)->header.size) : \
3090 /* Nonzero if VECTOR pointer is valid pointer inside BLOCK. */
3092 #define VECTOR_IN_BLOCK(vector, block) \
3093 ((char *) (vector) <= (block)->data \
3094 + VECTOR_BLOCK_BYTES - VBLOCK_BYTES_MIN)
3096 /* Reclaim space used by unmarked vectors. */
3099 sweep_vectors (void)
3101 struct vector_block
*block
= vector_blocks
, **bprev
= &vector_blocks
;
3102 struct Lisp_Vector
*vector
, *next
, **vprev
= &large_vectors
;
3104 total_vector_size
= 0;
3105 memset (vector_free_lists
, 0, sizeof (vector_free_lists
));
3107 /* Looking through vector blocks. */
3109 for (block
= vector_blocks
; block
; block
= *bprev
)
3111 int free_this_block
= 0;
3113 for (vector
= (struct Lisp_Vector
*) block
->data
;
3114 VECTOR_IN_BLOCK (vector
, block
); vector
= next
)
3116 if (VECTOR_MARKED_P (vector
))
3118 VECTOR_UNMARK (vector
);
3119 total_vector_size
+= VECTOR_SIZE (vector
);
3120 next
= ADVANCE (vector
, vector
->header
.next
.nbytes
);
3126 if ((vector
->header
.size
& VECTOR_FREE_LIST_FLAG
)
3127 == VECTOR_FREE_LIST_FLAG
)
3128 vector
->header
.next
.nbytes
=
3129 vector
->header
.size
& (VECTOR_BLOCK_SIZE
- 1);
3131 next
= ADVANCE (vector
, vector
->header
.next
.nbytes
);
3133 /* While NEXT is not marked, try to coalesce with VECTOR,
3134 thus making VECTOR of the largest possible size. */
3136 while (VECTOR_IN_BLOCK (next
, block
))
3138 if (VECTOR_MARKED_P (next
))
3140 if ((next
->header
.size
& VECTOR_FREE_LIST_FLAG
)
3141 == VECTOR_FREE_LIST_FLAG
)
3142 nbytes
= next
->header
.size
& (VECTOR_BLOCK_SIZE
- 1);
3144 nbytes
= next
->header
.next
.nbytes
;
3145 vector
->header
.next
.nbytes
+= nbytes
;
3146 next
= ADVANCE (next
, nbytes
);
3149 eassert (vector
->header
.next
.nbytes
% roundup_size
== 0);
3151 if (vector
== (struct Lisp_Vector
*) block
->data
3152 && !VECTOR_IN_BLOCK (next
, block
))
3153 /* This block should be freed because all of it's
3154 space was coalesced into the only free vector. */
3155 free_this_block
= 1;
3157 SETUP_ON_FREE_LIST (vector
, vector
->header
.next
.nbytes
, nbytes
);
3161 if (free_this_block
)
3163 *bprev
= block
->next
;
3164 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
3165 mem_delete (mem_find (block
->data
));
3170 bprev
= &block
->next
;
3173 /* Sweep large vectors. */
3175 for (vector
= large_vectors
; vector
; vector
= *vprev
)
3177 if (VECTOR_MARKED_P (vector
))
3179 VECTOR_UNMARK (vector
);
3180 total_vector_size
+= VECTOR_SIZE (vector
);
3181 vprev
= &vector
->header
.next
.vector
;
3185 *vprev
= vector
->header
.next
.vector
;
3191 /* Value is a pointer to a newly allocated Lisp_Vector structure
3192 with room for LEN Lisp_Objects. */
3194 static struct Lisp_Vector
*
3195 allocate_vectorlike (ptrdiff_t len
)
3197 struct Lisp_Vector
*p
;
3202 #ifdef DOUG_LEA_MALLOC
3203 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
3204 because mapped region contents are not preserved in
3206 mallopt (M_MMAP_MAX
, 0);
3209 /* This gets triggered by code which I haven't bothered to fix. --Stef */
3210 /* eassert (!handling_signal); */
3214 MALLOC_UNBLOCK_INPUT
;
3218 nbytes
= header_size
+ len
* word_size
;
3220 if (nbytes
<= VBLOCK_BYTES_MAX
)
3221 p
= allocate_vector_from_block (vroundup (nbytes
));
3224 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
3225 p
->header
.next
.vector
= large_vectors
;
3229 #ifdef DOUG_LEA_MALLOC
3230 /* Back to a reasonable maximum of mmap'ed areas. */
3231 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
3234 consing_since_gc
+= nbytes
;
3235 vector_cells_consed
+= len
;
3237 MALLOC_UNBLOCK_INPUT
;
3243 /* Allocate a vector with LEN slots. */
3245 struct Lisp_Vector
*
3246 allocate_vector (EMACS_INT len
)
3248 struct Lisp_Vector
*v
;
3249 ptrdiff_t nbytes_max
= min (PTRDIFF_MAX
, SIZE_MAX
);
3251 if (min ((nbytes_max
- header_size
) / word_size
, MOST_POSITIVE_FIXNUM
) < len
)
3252 memory_full (SIZE_MAX
);
3253 v
= allocate_vectorlike (len
);
3254 v
->header
.size
= len
;
3259 /* Allocate other vector-like structures. */
3261 struct Lisp_Vector
*
3262 allocate_pseudovector (int memlen
, int lisplen
, int tag
)
3264 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
3267 /* Only the first lisplen slots will be traced normally by the GC. */
3268 for (i
= 0; i
< lisplen
; ++i
)
3269 v
->contents
[i
] = Qnil
;
3271 XSETPVECTYPESIZE (v
, tag
, lisplen
);
3275 struct Lisp_Hash_Table
*
3276 allocate_hash_table (void)
3278 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
3282 allocate_window (void)
3286 w
= ALLOCATE_PSEUDOVECTOR (struct window
, current_matrix
, PVEC_WINDOW
);
3287 /* Users assumes that non-Lisp data is zeroed. */
3288 memset (&w
->current_matrix
, 0,
3289 sizeof (*w
) - offsetof (struct window
, current_matrix
));
3294 allocate_terminal (void)
3298 t
= ALLOCATE_PSEUDOVECTOR (struct terminal
, next_terminal
, PVEC_TERMINAL
);
3299 /* Users assumes that non-Lisp data is zeroed. */
3300 memset (&t
->next_terminal
, 0,
3301 sizeof (*t
) - offsetof (struct terminal
, next_terminal
));
3306 allocate_frame (void)
3310 f
= ALLOCATE_PSEUDOVECTOR (struct frame
, face_cache
, PVEC_FRAME
);
3311 /* Users assumes that non-Lisp data is zeroed. */
3312 memset (&f
->face_cache
, 0,
3313 sizeof (*f
) - offsetof (struct frame
, face_cache
));
3317 struct Lisp_Process
*
3318 allocate_process (void)
3320 struct Lisp_Process
*p
;
3322 p
= ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
3323 /* Users assumes that non-Lisp data is zeroed. */
3325 sizeof (*p
) - offsetof (struct Lisp_Process
, pid
));
3329 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3330 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3331 See also the function `vector'. */)
3332 (register Lisp_Object length
, Lisp_Object init
)
3335 register ptrdiff_t sizei
;
3336 register ptrdiff_t i
;
3337 register struct Lisp_Vector
*p
;
3339 CHECK_NATNUM (length
);
3341 p
= allocate_vector (XFASTINT (length
));
3342 sizei
= XFASTINT (length
);
3343 for (i
= 0; i
< sizei
; i
++)
3344 p
->contents
[i
] = init
;
3346 XSETVECTOR (vector
, p
);
3351 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3352 doc
: /* Return a newly created vector with specified arguments as elements.
3353 Any number of arguments, even zero arguments, are allowed.
3354 usage: (vector &rest OBJECTS) */)
3355 (ptrdiff_t nargs
, Lisp_Object
*args
)
3357 register Lisp_Object len
, val
;
3359 register struct Lisp_Vector
*p
;
3361 XSETFASTINT (len
, nargs
);
3362 val
= Fmake_vector (len
, Qnil
);
3364 for (i
= 0; i
< nargs
; i
++)
3365 p
->contents
[i
] = args
[i
];
3370 make_byte_code (struct Lisp_Vector
*v
)
3372 if (v
->header
.size
> 1 && STRINGP (v
->contents
[1])
3373 && STRING_MULTIBYTE (v
->contents
[1]))
3374 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3375 earlier because they produced a raw 8-bit string for byte-code
3376 and now such a byte-code string is loaded as multibyte while
3377 raw 8-bit characters converted to multibyte form. Thus, now we
3378 must convert them back to the original unibyte form. */
3379 v
->contents
[1] = Fstring_as_unibyte (v
->contents
[1]);
3380 XSETPVECTYPE (v
, PVEC_COMPILED
);
3383 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3384 doc
: /* Create a byte-code object with specified arguments as elements.
3385 The arguments should be the ARGLIST, bytecode-string BYTE-CODE, constant
3386 vector CONSTANTS, maximum stack size DEPTH, (optional) DOCSTRING,
3387 and (optional) INTERACTIVE-SPEC.
3388 The first four arguments are required; at most six have any
3390 The ARGLIST can be either like the one of `lambda', in which case the arguments
3391 will be dynamically bound before executing the byte code, or it can be an
3392 integer of the form NNNNNNNRMMMMMMM where the 7bit MMMMMMM specifies the
3393 minimum number of arguments, the 7-bit NNNNNNN specifies the maximum number
3394 of arguments (ignoring &rest) and the R bit specifies whether there is a &rest
3395 argument to catch the left-over arguments. If such an integer is used, the
3396 arguments will not be dynamically bound but will be instead pushed on the
3397 stack before executing the byte-code.
3398 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3399 (ptrdiff_t nargs
, Lisp_Object
*args
)
3401 register Lisp_Object len
, val
;
3403 register struct Lisp_Vector
*p
;
3405 /* We used to purecopy everything here, if purify-flga was set. This worked
3406 OK for Emacs-23, but with Emacs-24's lexical binding code, it can be
3407 dangerous, since make-byte-code is used during execution to build
3408 closures, so any closure built during the preload phase would end up
3409 copied into pure space, including its free variables, which is sometimes
3410 just wasteful and other times plainly wrong (e.g. those free vars may want
3413 XSETFASTINT (len
, nargs
);
3414 val
= Fmake_vector (len
, Qnil
);
3417 for (i
= 0; i
< nargs
; i
++)
3418 p
->contents
[i
] = args
[i
];
3420 XSETCOMPILED (val
, p
);
3426 /***********************************************************************
3428 ***********************************************************************/
3430 /* Like struct Lisp_Symbol, but padded so that the size is a multiple
3431 of the required alignment if LSB tags are used. */
3433 union aligned_Lisp_Symbol
3435 struct Lisp_Symbol s
;
3437 unsigned char c
[(sizeof (struct Lisp_Symbol
) + (1 << GCTYPEBITS
) - 1)
3438 & -(1 << GCTYPEBITS
)];
3442 /* Each symbol_block is just under 1020 bytes long, since malloc
3443 really allocates in units of powers of two and uses 4 bytes for its
3446 #define SYMBOL_BLOCK_SIZE \
3447 ((1020 - sizeof (struct symbol_block *)) / sizeof (union aligned_Lisp_Symbol))
3451 /* Place `symbols' first, to preserve alignment. */
3452 union aligned_Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3453 struct symbol_block
*next
;
3456 /* Current symbol block and index of first unused Lisp_Symbol
3459 static struct symbol_block
*symbol_block
;
3460 static int symbol_block_index
;
3462 /* List of free symbols. */
3464 static struct Lisp_Symbol
*symbol_free_list
;
3467 /* Initialize symbol allocation. */
3472 symbol_block
= NULL
;
3473 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3474 symbol_free_list
= 0;
3478 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3479 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3480 Its value and function definition are void, and its property list is nil. */)
3483 register Lisp_Object val
;
3484 register struct Lisp_Symbol
*p
;
3486 CHECK_STRING (name
);
3488 /* eassert (!handling_signal); */
3492 if (symbol_free_list
)
3494 XSETSYMBOL (val
, symbol_free_list
);
3495 symbol_free_list
= symbol_free_list
->next
;
3499 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3501 struct symbol_block
*new;
3502 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3504 new->next
= symbol_block
;
3506 symbol_block_index
= 0;
3508 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
].s
);
3509 symbol_block_index
++;
3512 MALLOC_UNBLOCK_INPUT
;
3517 p
->redirect
= SYMBOL_PLAINVAL
;
3518 SET_SYMBOL_VAL (p
, Qunbound
);
3519 p
->function
= Qunbound
;
3522 p
->interned
= SYMBOL_UNINTERNED
;
3524 p
->declared_special
= 0;
3525 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3532 /***********************************************************************
3533 Marker (Misc) Allocation
3534 ***********************************************************************/
3536 /* Like union Lisp_Misc, but padded so that its size is a multiple of
3537 the required alignment when LSB tags are used. */
3539 union aligned_Lisp_Misc
3543 unsigned char c
[(sizeof (union Lisp_Misc
) + (1 << GCTYPEBITS
) - 1)
3544 & -(1 << GCTYPEBITS
)];
3548 /* Allocation of markers and other objects that share that structure.
3549 Works like allocation of conses. */
3551 #define MARKER_BLOCK_SIZE \
3552 ((1020 - sizeof (struct marker_block *)) / sizeof (union aligned_Lisp_Misc))
3556 /* Place `markers' first, to preserve alignment. */
3557 union aligned_Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3558 struct marker_block
*next
;
3561 static struct marker_block
*marker_block
;
3562 static int marker_block_index
;
3564 static union Lisp_Misc
*marker_free_list
;
3569 marker_block
= NULL
;
3570 marker_block_index
= MARKER_BLOCK_SIZE
;
3571 marker_free_list
= 0;
3574 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3577 allocate_misc (void)
3581 /* eassert (!handling_signal); */
3585 if (marker_free_list
)
3587 XSETMISC (val
, marker_free_list
);
3588 marker_free_list
= marker_free_list
->u_free
.chain
;
3592 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3594 struct marker_block
*new;
3595 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3597 new->next
= marker_block
;
3599 marker_block_index
= 0;
3600 total_free_markers
+= MARKER_BLOCK_SIZE
;
3602 XSETMISC (val
, &marker_block
->markers
[marker_block_index
].m
);
3603 marker_block_index
++;
3606 MALLOC_UNBLOCK_INPUT
;
3608 --total_free_markers
;
3609 consing_since_gc
+= sizeof (union Lisp_Misc
);
3610 misc_objects_consed
++;
3611 XMISCANY (val
)->gcmarkbit
= 0;
3615 /* Free a Lisp_Misc object */
3618 free_misc (Lisp_Object misc
)
3620 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3621 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3622 marker_free_list
= XMISC (misc
);
3624 total_free_markers
++;
3627 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3628 INTEGER. This is used to package C values to call record_unwind_protect.
3629 The unwind function can get the C values back using XSAVE_VALUE. */
3632 make_save_value (void *pointer
, ptrdiff_t integer
)
3634 register Lisp_Object val
;
3635 register struct Lisp_Save_Value
*p
;
3637 val
= allocate_misc ();
3638 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3639 p
= XSAVE_VALUE (val
);
3640 p
->pointer
= pointer
;
3641 p
->integer
= integer
;
3646 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3647 doc
: /* Return a newly allocated marker which does not point at any place. */)
3650 register Lisp_Object val
;
3651 register struct Lisp_Marker
*p
;
3653 val
= allocate_misc ();
3654 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3660 p
->insertion_type
= 0;
3664 /* Put MARKER back on the free list after using it temporarily. */
3667 free_marker (Lisp_Object marker
)
3669 unchain_marker (XMARKER (marker
));
3674 /* Return a newly created vector or string with specified arguments as
3675 elements. If all the arguments are characters that can fit
3676 in a string of events, make a string; otherwise, make a vector.
3678 Any number of arguments, even zero arguments, are allowed. */
3681 make_event_array (register int nargs
, Lisp_Object
*args
)
3685 for (i
= 0; i
< nargs
; i
++)
3686 /* The things that fit in a string
3687 are characters that are in 0...127,
3688 after discarding the meta bit and all the bits above it. */
3689 if (!INTEGERP (args
[i
])
3690 || (XINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3691 return Fvector (nargs
, args
);
3693 /* Since the loop exited, we know that all the things in it are
3694 characters, so we can make a string. */
3698 result
= Fmake_string (make_number (nargs
), make_number (0));
3699 for (i
= 0; i
< nargs
; i
++)
3701 SSET (result
, i
, XINT (args
[i
]));
3702 /* Move the meta bit to the right place for a string char. */
3703 if (XINT (args
[i
]) & CHAR_META
)
3704 SSET (result
, i
, SREF (result
, i
) | 0x80);
3713 /************************************************************************
3714 Memory Full Handling
3715 ************************************************************************/
3718 /* Called if malloc (NBYTES) returns zero. If NBYTES == SIZE_MAX,
3719 there may have been size_t overflow so that malloc was never
3720 called, or perhaps malloc was invoked successfully but the
3721 resulting pointer had problems fitting into a tagged EMACS_INT. In
3722 either case this counts as memory being full even though malloc did
3726 memory_full (size_t nbytes
)
3728 /* Do not go into hysterics merely because a large request failed. */
3729 int enough_free_memory
= 0;
3730 if (SPARE_MEMORY
< nbytes
)
3735 p
= malloc (SPARE_MEMORY
);
3739 enough_free_memory
= 1;
3741 MALLOC_UNBLOCK_INPUT
;
3744 if (! enough_free_memory
)
3750 memory_full_cons_threshold
= sizeof (struct cons_block
);
3752 /* The first time we get here, free the spare memory. */
3753 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3754 if (spare_memory
[i
])
3757 free (spare_memory
[i
]);
3758 else if (i
>= 1 && i
<= 4)
3759 lisp_align_free (spare_memory
[i
]);
3761 lisp_free (spare_memory
[i
]);
3762 spare_memory
[i
] = 0;
3765 /* Record the space now used. When it decreases substantially,
3766 we can refill the memory reserve. */
3767 #if !defined SYSTEM_MALLOC && !defined SYNC_INPUT
3768 bytes_used_when_full
= BYTES_USED
;
3772 /* This used to call error, but if we've run out of memory, we could
3773 get infinite recursion trying to build the string. */
3774 xsignal (Qnil
, Vmemory_signal_data
);
3777 /* If we released our reserve (due to running out of memory),
3778 and we have a fair amount free once again,
3779 try to set aside another reserve in case we run out once more.
3781 This is called when a relocatable block is freed in ralloc.c,
3782 and also directly from this file, in case we're not using ralloc.c. */
3785 refill_memory_reserve (void)
3787 #ifndef SYSTEM_MALLOC
3788 if (spare_memory
[0] == 0)
3789 spare_memory
[0] = (char *) malloc (SPARE_MEMORY
);
3790 if (spare_memory
[1] == 0)
3791 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3793 if (spare_memory
[2] == 0)
3794 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3796 if (spare_memory
[3] == 0)
3797 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3799 if (spare_memory
[4] == 0)
3800 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3802 if (spare_memory
[5] == 0)
3803 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3805 if (spare_memory
[6] == 0)
3806 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3808 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3809 Vmemory_full
= Qnil
;
3813 /************************************************************************
3815 ************************************************************************/
3817 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3819 /* Conservative C stack marking requires a method to identify possibly
3820 live Lisp objects given a pointer value. We do this by keeping
3821 track of blocks of Lisp data that are allocated in a red-black tree
3822 (see also the comment of mem_node which is the type of nodes in
3823 that tree). Function lisp_malloc adds information for an allocated
3824 block to the red-black tree with calls to mem_insert, and function
3825 lisp_free removes it with mem_delete. Functions live_string_p etc
3826 call mem_find to lookup information about a given pointer in the
3827 tree, and use that to determine if the pointer points to a Lisp
3830 /* Initialize this part of alloc.c. */
3835 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3836 mem_z
.parent
= NULL
;
3837 mem_z
.color
= MEM_BLACK
;
3838 mem_z
.start
= mem_z
.end
= NULL
;
3843 /* Value is a pointer to the mem_node containing START. Value is
3844 MEM_NIL if there is no node in the tree containing START. */
3846 static inline struct mem_node
*
3847 mem_find (void *start
)
3851 if (start
< min_heap_address
|| start
> max_heap_address
)
3854 /* Make the search always successful to speed up the loop below. */
3855 mem_z
.start
= start
;
3856 mem_z
.end
= (char *) start
+ 1;
3859 while (start
< p
->start
|| start
>= p
->end
)
3860 p
= start
< p
->start
? p
->left
: p
->right
;
3865 /* Insert a new node into the tree for a block of memory with start
3866 address START, end address END, and type TYPE. Value is a
3867 pointer to the node that was inserted. */
3869 static struct mem_node
*
3870 mem_insert (void *start
, void *end
, enum mem_type type
)
3872 struct mem_node
*c
, *parent
, *x
;
3874 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3875 min_heap_address
= start
;
3876 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3877 max_heap_address
= end
;
3879 /* See where in the tree a node for START belongs. In this
3880 particular application, it shouldn't happen that a node is already
3881 present. For debugging purposes, let's check that. */
3885 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3887 while (c
!= MEM_NIL
)
3889 if (start
>= c
->start
&& start
< c
->end
)
3892 c
= start
< c
->start
? c
->left
: c
->right
;
3895 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3897 while (c
!= MEM_NIL
)
3900 c
= start
< c
->start
? c
->left
: c
->right
;
3903 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3905 /* Create a new node. */
3906 #ifdef GC_MALLOC_CHECK
3907 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3911 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3917 x
->left
= x
->right
= MEM_NIL
;
3920 /* Insert it as child of PARENT or install it as root. */
3923 if (start
< parent
->start
)
3931 /* Re-establish red-black tree properties. */
3932 mem_insert_fixup (x
);
3938 /* Re-establish the red-black properties of the tree, and thereby
3939 balance the tree, after node X has been inserted; X is always red. */
3942 mem_insert_fixup (struct mem_node
*x
)
3944 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3946 /* X is red and its parent is red. This is a violation of
3947 red-black tree property #3. */
3949 if (x
->parent
== x
->parent
->parent
->left
)
3951 /* We're on the left side of our grandparent, and Y is our
3953 struct mem_node
*y
= x
->parent
->parent
->right
;
3955 if (y
->color
== MEM_RED
)
3957 /* Uncle and parent are red but should be black because
3958 X is red. Change the colors accordingly and proceed
3959 with the grandparent. */
3960 x
->parent
->color
= MEM_BLACK
;
3961 y
->color
= MEM_BLACK
;
3962 x
->parent
->parent
->color
= MEM_RED
;
3963 x
= x
->parent
->parent
;
3967 /* Parent and uncle have different colors; parent is
3968 red, uncle is black. */
3969 if (x
== x
->parent
->right
)
3972 mem_rotate_left (x
);
3975 x
->parent
->color
= MEM_BLACK
;
3976 x
->parent
->parent
->color
= MEM_RED
;
3977 mem_rotate_right (x
->parent
->parent
);
3982 /* This is the symmetrical case of above. */
3983 struct mem_node
*y
= x
->parent
->parent
->left
;
3985 if (y
->color
== MEM_RED
)
3987 x
->parent
->color
= MEM_BLACK
;
3988 y
->color
= MEM_BLACK
;
3989 x
->parent
->parent
->color
= MEM_RED
;
3990 x
= x
->parent
->parent
;
3994 if (x
== x
->parent
->left
)
3997 mem_rotate_right (x
);
4000 x
->parent
->color
= MEM_BLACK
;
4001 x
->parent
->parent
->color
= MEM_RED
;
4002 mem_rotate_left (x
->parent
->parent
);
4007 /* The root may have been changed to red due to the algorithm. Set
4008 it to black so that property #5 is satisfied. */
4009 mem_root
->color
= MEM_BLACK
;
4020 mem_rotate_left (struct mem_node
*x
)
4024 /* Turn y's left sub-tree into x's right sub-tree. */
4027 if (y
->left
!= MEM_NIL
)
4028 y
->left
->parent
= x
;
4030 /* Y's parent was x's parent. */
4032 y
->parent
= x
->parent
;
4034 /* Get the parent to point to y instead of x. */
4037 if (x
== x
->parent
->left
)
4038 x
->parent
->left
= y
;
4040 x
->parent
->right
= y
;
4045 /* Put x on y's left. */
4059 mem_rotate_right (struct mem_node
*x
)
4061 struct mem_node
*y
= x
->left
;
4064 if (y
->right
!= MEM_NIL
)
4065 y
->right
->parent
= x
;
4068 y
->parent
= x
->parent
;
4071 if (x
== x
->parent
->right
)
4072 x
->parent
->right
= y
;
4074 x
->parent
->left
= y
;
4085 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
4088 mem_delete (struct mem_node
*z
)
4090 struct mem_node
*x
, *y
;
4092 if (!z
|| z
== MEM_NIL
)
4095 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
4100 while (y
->left
!= MEM_NIL
)
4104 if (y
->left
!= MEM_NIL
)
4109 x
->parent
= y
->parent
;
4112 if (y
== y
->parent
->left
)
4113 y
->parent
->left
= x
;
4115 y
->parent
->right
= x
;
4122 z
->start
= y
->start
;
4127 if (y
->color
== MEM_BLACK
)
4128 mem_delete_fixup (x
);
4130 #ifdef GC_MALLOC_CHECK
4138 /* Re-establish the red-black properties of the tree, after a
4142 mem_delete_fixup (struct mem_node
*x
)
4144 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
4146 if (x
== x
->parent
->left
)
4148 struct mem_node
*w
= x
->parent
->right
;
4150 if (w
->color
== MEM_RED
)
4152 w
->color
= MEM_BLACK
;
4153 x
->parent
->color
= MEM_RED
;
4154 mem_rotate_left (x
->parent
);
4155 w
= x
->parent
->right
;
4158 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
4165 if (w
->right
->color
== MEM_BLACK
)
4167 w
->left
->color
= MEM_BLACK
;
4169 mem_rotate_right (w
);
4170 w
= x
->parent
->right
;
4172 w
->color
= x
->parent
->color
;
4173 x
->parent
->color
= MEM_BLACK
;
4174 w
->right
->color
= MEM_BLACK
;
4175 mem_rotate_left (x
->parent
);
4181 struct mem_node
*w
= x
->parent
->left
;
4183 if (w
->color
== MEM_RED
)
4185 w
->color
= MEM_BLACK
;
4186 x
->parent
->color
= MEM_RED
;
4187 mem_rotate_right (x
->parent
);
4188 w
= x
->parent
->left
;
4191 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
4198 if (w
->left
->color
== MEM_BLACK
)
4200 w
->right
->color
= MEM_BLACK
;
4202 mem_rotate_left (w
);
4203 w
= x
->parent
->left
;
4206 w
->color
= x
->parent
->color
;
4207 x
->parent
->color
= MEM_BLACK
;
4208 w
->left
->color
= MEM_BLACK
;
4209 mem_rotate_right (x
->parent
);
4215 x
->color
= MEM_BLACK
;
4219 /* Value is non-zero if P is a pointer to a live Lisp string on
4220 the heap. M is a pointer to the mem_block for P. */
4223 live_string_p (struct mem_node
*m
, void *p
)
4225 if (m
->type
== MEM_TYPE_STRING
)
4227 struct string_block
*b
= (struct string_block
*) m
->start
;
4228 ptrdiff_t offset
= (char *) p
- (char *) &b
->strings
[0];
4230 /* P must point to the start of a Lisp_String structure, and it
4231 must not be on the free-list. */
4233 && offset
% sizeof b
->strings
[0] == 0
4234 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
4235 && ((struct Lisp_String
*) p
)->data
!= NULL
);
4242 /* Value is non-zero if P is a pointer to a live Lisp cons on
4243 the heap. M is a pointer to the mem_block for P. */
4246 live_cons_p (struct mem_node
*m
, void *p
)
4248 if (m
->type
== MEM_TYPE_CONS
)
4250 struct cons_block
*b
= (struct cons_block
*) m
->start
;
4251 ptrdiff_t offset
= (char *) p
- (char *) &b
->conses
[0];
4253 /* P must point to the start of a Lisp_Cons, not be
4254 one of the unused cells in the current cons block,
4255 and not be on the free-list. */
4257 && offset
% sizeof b
->conses
[0] == 0
4258 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
4260 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
4261 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
4268 /* Value is non-zero if P is a pointer to a live Lisp symbol on
4269 the heap. M is a pointer to the mem_block for P. */
4272 live_symbol_p (struct mem_node
*m
, void *p
)
4274 if (m
->type
== MEM_TYPE_SYMBOL
)
4276 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
4277 ptrdiff_t offset
= (char *) p
- (char *) &b
->symbols
[0];
4279 /* P must point to the start of a Lisp_Symbol, not be
4280 one of the unused cells in the current symbol block,
4281 and not be on the free-list. */
4283 && offset
% sizeof b
->symbols
[0] == 0
4284 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
4285 && (b
!= symbol_block
4286 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
4287 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
4294 /* Value is non-zero if P is a pointer to a live Lisp float on
4295 the heap. M is a pointer to the mem_block for P. */
4298 live_float_p (struct mem_node
*m
, void *p
)
4300 if (m
->type
== MEM_TYPE_FLOAT
)
4302 struct float_block
*b
= (struct float_block
*) m
->start
;
4303 ptrdiff_t offset
= (char *) p
- (char *) &b
->floats
[0];
4305 /* P must point to the start of a Lisp_Float and not be
4306 one of the unused cells in the current float block. */
4308 && offset
% sizeof b
->floats
[0] == 0
4309 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
4310 && (b
!= float_block
4311 || offset
/ sizeof b
->floats
[0] < float_block_index
));
4318 /* Value is non-zero if P is a pointer to a live Lisp Misc on
4319 the heap. M is a pointer to the mem_block for P. */
4322 live_misc_p (struct mem_node
*m
, void *p
)
4324 if (m
->type
== MEM_TYPE_MISC
)
4326 struct marker_block
*b
= (struct marker_block
*) m
->start
;
4327 ptrdiff_t offset
= (char *) p
- (char *) &b
->markers
[0];
4329 /* P must point to the start of a Lisp_Misc, not be
4330 one of the unused cells in the current misc block,
4331 and not be on the free-list. */
4333 && offset
% sizeof b
->markers
[0] == 0
4334 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4335 && (b
!= marker_block
4336 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4337 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
4344 /* Value is non-zero if P is a pointer to a live vector-like object.
4345 M is a pointer to the mem_block for P. */
4348 live_vector_p (struct mem_node
*m
, void *p
)
4350 if (m
->type
== MEM_TYPE_VECTOR_BLOCK
)
4352 /* This memory node corresponds to a vector block. */
4353 struct vector_block
*block
= (struct vector_block
*) m
->start
;
4354 struct Lisp_Vector
*vector
= (struct Lisp_Vector
*) block
->data
;
4356 /* P is in the block's allocation range. Scan the block
4357 up to P and see whether P points to the start of some
4358 vector which is not on a free list. FIXME: check whether
4359 some allocation patterns (probably a lot of short vectors)
4360 may cause a substantial overhead of this loop. */
4361 while (VECTOR_IN_BLOCK (vector
, block
)
4362 && vector
<= (struct Lisp_Vector
*) p
)
4364 if ((vector
->header
.size
& VECTOR_FREE_LIST_FLAG
)
4365 == VECTOR_FREE_LIST_FLAG
)
4366 vector
= ADVANCE (vector
, (vector
->header
.size
4367 & (VECTOR_BLOCK_SIZE
- 1)));
4368 else if (vector
== p
)
4371 vector
= ADVANCE (vector
, vector
->header
.next
.nbytes
);
4374 else if (m
->type
== MEM_TYPE_VECTORLIKE
&& p
== m
->start
)
4375 /* This memory node corresponds to a large vector. */
4381 /* Value is non-zero if P is a pointer to a live buffer. M is a
4382 pointer to the mem_block for P. */
4385 live_buffer_p (struct mem_node
*m
, void *p
)
4387 /* P must point to the start of the block, and the buffer
4388 must not have been killed. */
4389 return (m
->type
== MEM_TYPE_BUFFER
4391 && !NILP (((struct buffer
*) p
)->BUFFER_INTERNAL_FIELD (name
)));
4394 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4398 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4400 /* Array of objects that are kept alive because the C stack contains
4401 a pattern that looks like a reference to them . */
4403 #define MAX_ZOMBIES 10
4404 static Lisp_Object zombies
[MAX_ZOMBIES
];
4406 /* Number of zombie objects. */
4408 static EMACS_INT nzombies
;
4410 /* Number of garbage collections. */
4412 static EMACS_INT ngcs
;
4414 /* Average percentage of zombies per collection. */
4416 static double avg_zombies
;
4418 /* Max. number of live and zombie objects. */
4420 static EMACS_INT max_live
, max_zombies
;
4422 /* Average number of live objects per GC. */
4424 static double avg_live
;
4426 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4427 doc
: /* Show information about live and zombie objects. */)
4430 Lisp_Object args
[8], zombie_list
= Qnil
;
4432 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); i
++)
4433 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4434 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4435 args
[1] = make_number (ngcs
);
4436 args
[2] = make_float (avg_live
);
4437 args
[3] = make_float (avg_zombies
);
4438 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4439 args
[5] = make_number (max_live
);
4440 args
[6] = make_number (max_zombies
);
4441 args
[7] = zombie_list
;
4442 return Fmessage (8, args
);
4445 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4448 /* Mark OBJ if we can prove it's a Lisp_Object. */
4451 mark_maybe_object (Lisp_Object obj
)
4459 po
= (void *) XPNTR (obj
);
4466 switch (XTYPE (obj
))
4469 mark_p
= (live_string_p (m
, po
)
4470 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4474 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4478 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4482 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4485 case Lisp_Vectorlike
:
4486 /* Note: can't check BUFFERP before we know it's a
4487 buffer because checking that dereferences the pointer
4488 PO which might point anywhere. */
4489 if (live_vector_p (m
, po
))
4490 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4491 else if (live_buffer_p (m
, po
))
4492 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4496 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4505 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4506 if (nzombies
< MAX_ZOMBIES
)
4507 zombies
[nzombies
] = obj
;
4516 /* If P points to Lisp data, mark that as live if it isn't already
4520 mark_maybe_pointer (void *p
)
4524 /* Quickly rule out some values which can't point to Lisp data.
4525 USE_LSB_TAG needs Lisp data to be aligned on multiples of 1 << GCTYPEBITS.
4526 Otherwise, assume that Lisp data is aligned on even addresses. */
4527 if ((intptr_t) p
% (USE_LSB_TAG
? 1 << GCTYPEBITS
: 2))
4533 Lisp_Object obj
= Qnil
;
4537 case MEM_TYPE_NON_LISP
:
4538 /* Nothing to do; not a pointer to Lisp memory. */
4541 case MEM_TYPE_BUFFER
:
4542 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P ((struct buffer
*)p
))
4543 XSETVECTOR (obj
, p
);
4547 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4551 case MEM_TYPE_STRING
:
4552 if (live_string_p (m
, p
)
4553 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4554 XSETSTRING (obj
, p
);
4558 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4562 case MEM_TYPE_SYMBOL
:
4563 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4564 XSETSYMBOL (obj
, p
);
4567 case MEM_TYPE_FLOAT
:
4568 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4572 case MEM_TYPE_VECTORLIKE
:
4573 case MEM_TYPE_VECTOR_BLOCK
:
4574 if (live_vector_p (m
, p
))
4577 XSETVECTOR (tem
, p
);
4578 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4593 /* Alignment of pointer values. Use offsetof, as it sometimes returns
4594 a smaller alignment than GCC's __alignof__ and mark_memory might
4595 miss objects if __alignof__ were used. */
4596 #define GC_POINTER_ALIGNMENT offsetof (struct {char a; void *b;}, b)
4598 /* Define POINTERS_MIGHT_HIDE_IN_OBJECTS to 1 if marking via C pointers does
4599 not suffice, which is the typical case. A host where a Lisp_Object is
4600 wider than a pointer might allocate a Lisp_Object in non-adjacent halves.
4601 If USE_LSB_TAG, the bottom half is not a valid pointer, but it should
4602 suffice to widen it to to a Lisp_Object and check it that way. */
4603 #if USE_LSB_TAG || VAL_MAX < UINTPTR_MAX
4604 # if !USE_LSB_TAG && VAL_MAX < UINTPTR_MAX >> GCTYPEBITS
4605 /* If tag bits straddle pointer-word boundaries, neither mark_maybe_pointer
4606 nor mark_maybe_object can follow the pointers. This should not occur on
4607 any practical porting target. */
4608 # error "MSB type bits straddle pointer-word boundaries"
4610 /* Marking via C pointers does not suffice, because Lisp_Objects contain
4611 pointer words that hold pointers ORed with type bits. */
4612 # define POINTERS_MIGHT_HIDE_IN_OBJECTS 1
4614 /* Marking via C pointers suffices, because Lisp_Objects contain pointer
4615 words that hold unmodified pointers. */
4616 # define POINTERS_MIGHT_HIDE_IN_OBJECTS 0
4619 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4620 or END+OFFSET..START. */
4623 mark_memory (void *start
, void *end
)
4628 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4632 /* Make START the pointer to the start of the memory region,
4633 if it isn't already. */
4641 /* Mark Lisp data pointed to. This is necessary because, in some
4642 situations, the C compiler optimizes Lisp objects away, so that
4643 only a pointer to them remains. Example:
4645 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4648 Lisp_Object obj = build_string ("test");
4649 struct Lisp_String *s = XSTRING (obj);
4650 Fgarbage_collect ();
4651 fprintf (stderr, "test `%s'\n", s->data);
4655 Here, `obj' isn't really used, and the compiler optimizes it
4656 away. The only reference to the life string is through the
4659 for (pp
= start
; (void *) pp
< end
; pp
++)
4660 for (i
= 0; i
< sizeof *pp
; i
+= GC_POINTER_ALIGNMENT
)
4662 void *p
= *(void **) ((char *) pp
+ i
);
4663 mark_maybe_pointer (p
);
4664 if (POINTERS_MIGHT_HIDE_IN_OBJECTS
)
4665 mark_maybe_object (XIL ((intptr_t) p
));
4669 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4670 the GCC system configuration. In gcc 3.2, the only systems for
4671 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4672 by others?) and ns32k-pc532-min. */
4674 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4676 static int setjmp_tested_p
, longjmps_done
;
4678 #define SETJMP_WILL_LIKELY_WORK "\
4680 Emacs garbage collector has been changed to use conservative stack\n\
4681 marking. Emacs has determined that the method it uses to do the\n\
4682 marking will likely work on your system, but this isn't sure.\n\
4684 If you are a system-programmer, or can get the help of a local wizard\n\
4685 who is, please take a look at the function mark_stack in alloc.c, and\n\
4686 verify that the methods used are appropriate for your system.\n\
4688 Please mail the result to <emacs-devel@gnu.org>.\n\
4691 #define SETJMP_WILL_NOT_WORK "\
4693 Emacs garbage collector has been changed to use conservative stack\n\
4694 marking. Emacs has determined that the default method it uses to do the\n\
4695 marking will not work on your system. We will need a system-dependent\n\
4696 solution for your system.\n\
4698 Please take a look at the function mark_stack in alloc.c, and\n\
4699 try to find a way to make it work on your system.\n\
4701 Note that you may get false negatives, depending on the compiler.\n\
4702 In particular, you need to use -O with GCC for this test.\n\
4704 Please mail the result to <emacs-devel@gnu.org>.\n\
4708 /* Perform a quick check if it looks like setjmp saves registers in a
4709 jmp_buf. Print a message to stderr saying so. When this test
4710 succeeds, this is _not_ a proof that setjmp is sufficient for
4711 conservative stack marking. Only the sources or a disassembly
4722 /* Arrange for X to be put in a register. */
4728 if (longjmps_done
== 1)
4730 /* Came here after the longjmp at the end of the function.
4732 If x == 1, the longjmp has restored the register to its
4733 value before the setjmp, and we can hope that setjmp
4734 saves all such registers in the jmp_buf, although that
4737 For other values of X, either something really strange is
4738 taking place, or the setjmp just didn't save the register. */
4741 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4744 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4751 if (longjmps_done
== 1)
4755 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4758 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4760 /* Abort if anything GCPRO'd doesn't survive the GC. */
4768 for (p
= gcprolist
; p
; p
= p
->next
)
4769 for (i
= 0; i
< p
->nvars
; ++i
)
4770 if (!survives_gc_p (p
->var
[i
]))
4771 /* FIXME: It's not necessarily a bug. It might just be that the
4772 GCPRO is unnecessary or should release the object sooner. */
4776 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4783 fprintf (stderr
, "\nZombies kept alive = %"pI
"d:\n", nzombies
);
4784 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4786 fprintf (stderr
, " %d = ", i
);
4787 debug_print (zombies
[i
]);
4791 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4794 /* Mark live Lisp objects on the C stack.
4796 There are several system-dependent problems to consider when
4797 porting this to new architectures:
4801 We have to mark Lisp objects in CPU registers that can hold local
4802 variables or are used to pass parameters.
4804 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4805 something that either saves relevant registers on the stack, or
4806 calls mark_maybe_object passing it each register's contents.
4808 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4809 implementation assumes that calling setjmp saves registers we need
4810 to see in a jmp_buf which itself lies on the stack. This doesn't
4811 have to be true! It must be verified for each system, possibly
4812 by taking a look at the source code of setjmp.
4814 If __builtin_unwind_init is available (defined by GCC >= 2.8) we
4815 can use it as a machine independent method to store all registers
4816 to the stack. In this case the macros described in the previous
4817 two paragraphs are not used.
4821 Architectures differ in the way their processor stack is organized.
4822 For example, the stack might look like this
4825 | Lisp_Object | size = 4
4827 | something else | size = 2
4829 | Lisp_Object | size = 4
4833 In such a case, not every Lisp_Object will be aligned equally. To
4834 find all Lisp_Object on the stack it won't be sufficient to walk
4835 the stack in steps of 4 bytes. Instead, two passes will be
4836 necessary, one starting at the start of the stack, and a second
4837 pass starting at the start of the stack + 2. Likewise, if the
4838 minimal alignment of Lisp_Objects on the stack is 1, four passes
4839 would be necessary, each one starting with one byte more offset
4840 from the stack start. */
4847 #ifdef HAVE___BUILTIN_UNWIND_INIT
4848 /* Force callee-saved registers and register windows onto the stack.
4849 This is the preferred method if available, obviating the need for
4850 machine dependent methods. */
4851 __builtin_unwind_init ();
4853 #else /* not HAVE___BUILTIN_UNWIND_INIT */
4854 #ifndef GC_SAVE_REGISTERS_ON_STACK
4855 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4856 union aligned_jmpbuf
{
4860 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4862 /* This trick flushes the register windows so that all the state of
4863 the process is contained in the stack. */
4864 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4865 needed on ia64 too. See mach_dep.c, where it also says inline
4866 assembler doesn't work with relevant proprietary compilers. */
4868 #if defined (__sparc64__) && defined (__FreeBSD__)
4869 /* FreeBSD does not have a ta 3 handler. */
4876 /* Save registers that we need to see on the stack. We need to see
4877 registers used to hold register variables and registers used to
4879 #ifdef GC_SAVE_REGISTERS_ON_STACK
4880 GC_SAVE_REGISTERS_ON_STACK (end
);
4881 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4883 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4884 setjmp will definitely work, test it
4885 and print a message with the result
4887 if (!setjmp_tested_p
)
4889 setjmp_tested_p
= 1;
4892 #endif /* GC_SETJMP_WORKS */
4895 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4896 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4897 #endif /* not HAVE___BUILTIN_UNWIND_INIT */
4899 /* This assumes that the stack is a contiguous region in memory. If
4900 that's not the case, something has to be done here to iterate
4901 over the stack segments. */
4902 mark_memory (stack_base
, end
);
4904 /* Allow for marking a secondary stack, like the register stack on the
4906 #ifdef GC_MARK_SECONDARY_STACK
4907 GC_MARK_SECONDARY_STACK ();
4910 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4915 #endif /* GC_MARK_STACK != 0 */
4918 /* Determine whether it is safe to access memory at address P. */
4920 valid_pointer_p (void *p
)
4923 return w32_valid_pointer_p (p
, 16);
4927 /* Obviously, we cannot just access it (we would SEGV trying), so we
4928 trick the o/s to tell us whether p is a valid pointer.
4929 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4930 not validate p in that case. */
4934 int valid
= (emacs_write (fd
[1], (char *) p
, 16) == 16);
4935 emacs_close (fd
[1]);
4936 emacs_close (fd
[0]);
4944 /* Return 1 if OBJ is a valid lisp object.
4945 Return 0 if OBJ is NOT a valid lisp object.
4946 Return -1 if we cannot validate OBJ.
4947 This function can be quite slow,
4948 so it should only be used in code for manual debugging. */
4951 valid_lisp_object_p (Lisp_Object obj
)
4961 p
= (void *) XPNTR (obj
);
4962 if (PURE_POINTER_P (p
))
4966 return valid_pointer_p (p
);
4973 int valid
= valid_pointer_p (p
);
4985 case MEM_TYPE_NON_LISP
:
4988 case MEM_TYPE_BUFFER
:
4989 return live_buffer_p (m
, p
);
4992 return live_cons_p (m
, p
);
4994 case MEM_TYPE_STRING
:
4995 return live_string_p (m
, p
);
4998 return live_misc_p (m
, p
);
5000 case MEM_TYPE_SYMBOL
:
5001 return live_symbol_p (m
, p
);
5003 case MEM_TYPE_FLOAT
:
5004 return live_float_p (m
, p
);
5006 case MEM_TYPE_VECTORLIKE
:
5007 case MEM_TYPE_VECTOR_BLOCK
:
5008 return live_vector_p (m
, p
);
5021 /***********************************************************************
5022 Pure Storage Management
5023 ***********************************************************************/
5025 /* Allocate room for SIZE bytes from pure Lisp storage and return a
5026 pointer to it. TYPE is the Lisp type for which the memory is
5027 allocated. TYPE < 0 means it's not used for a Lisp object. */
5030 pure_alloc (size_t size
, int type
)
5034 size_t alignment
= (1 << GCTYPEBITS
);
5036 size_t alignment
= sizeof (EMACS_INT
);
5038 /* Give Lisp_Floats an extra alignment. */
5039 if (type
== Lisp_Float
)
5041 #if defined __GNUC__ && __GNUC__ >= 2
5042 alignment
= __alignof (struct Lisp_Float
);
5044 alignment
= sizeof (struct Lisp_Float
);
5052 /* Allocate space for a Lisp object from the beginning of the free
5053 space with taking account of alignment. */
5054 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
5055 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
5059 /* Allocate space for a non-Lisp object from the end of the free
5061 pure_bytes_used_non_lisp
+= size
;
5062 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
5064 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
5066 if (pure_bytes_used
<= pure_size
)
5069 /* Don't allocate a large amount here,
5070 because it might get mmap'd and then its address
5071 might not be usable. */
5072 purebeg
= (char *) xmalloc (10000);
5074 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
5075 pure_bytes_used
= 0;
5076 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
5081 /* Print a warning if PURESIZE is too small. */
5084 check_pure_size (void)
5086 if (pure_bytes_used_before_overflow
)
5087 message (("emacs:0:Pure Lisp storage overflow (approx. %"pI
"d"
5089 pure_bytes_used
+ pure_bytes_used_before_overflow
);
5093 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
5094 the non-Lisp data pool of the pure storage, and return its start
5095 address. Return NULL if not found. */
5098 find_string_data_in_pure (const char *data
, ptrdiff_t nbytes
)
5101 ptrdiff_t skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
5102 const unsigned char *p
;
5105 if (pure_bytes_used_non_lisp
<= nbytes
)
5108 /* Set up the Boyer-Moore table. */
5110 for (i
= 0; i
< 256; i
++)
5113 p
= (const unsigned char *) data
;
5115 bm_skip
[*p
++] = skip
;
5117 last_char_skip
= bm_skip
['\0'];
5119 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
5120 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
5122 /* See the comments in the function `boyer_moore' (search.c) for the
5123 use of `infinity'. */
5124 infinity
= pure_bytes_used_non_lisp
+ 1;
5125 bm_skip
['\0'] = infinity
;
5127 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
5131 /* Check the last character (== '\0'). */
5134 start
+= bm_skip
[*(p
+ start
)];
5136 while (start
<= start_max
);
5138 if (start
< infinity
)
5139 /* Couldn't find the last character. */
5142 /* No less than `infinity' means we could find the last
5143 character at `p[start - infinity]'. */
5146 /* Check the remaining characters. */
5147 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
5149 return non_lisp_beg
+ start
;
5151 start
+= last_char_skip
;
5153 while (start
<= start_max
);
5159 /* Return a string allocated in pure space. DATA is a buffer holding
5160 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
5161 non-zero means make the result string multibyte.
5163 Must get an error if pure storage is full, since if it cannot hold
5164 a large string it may be able to hold conses that point to that
5165 string; then the string is not protected from gc. */
5168 make_pure_string (const char *data
,
5169 ptrdiff_t nchars
, ptrdiff_t nbytes
, int multibyte
)
5172 struct Lisp_String
*s
;
5174 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
5175 s
->data
= (unsigned char *) find_string_data_in_pure (data
, nbytes
);
5176 if (s
->data
== NULL
)
5178 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
5179 memcpy (s
->data
, data
, nbytes
);
5180 s
->data
[nbytes
] = '\0';
5183 s
->size_byte
= multibyte
? nbytes
: -1;
5184 s
->intervals
= NULL_INTERVAL
;
5185 XSETSTRING (string
, s
);
5189 /* Return a string a string allocated in pure space. Do not allocate
5190 the string data, just point to DATA. */
5193 make_pure_c_string (const char *data
)
5196 struct Lisp_String
*s
;
5197 ptrdiff_t nchars
= strlen (data
);
5199 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
5202 s
->data
= (unsigned char *) data
;
5203 s
->intervals
= NULL_INTERVAL
;
5204 XSETSTRING (string
, s
);
5208 /* Return a cons allocated from pure space. Give it pure copies
5209 of CAR as car and CDR as cdr. */
5212 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
5214 register Lisp_Object
new;
5215 struct Lisp_Cons
*p
;
5217 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
5219 XSETCAR (new, Fpurecopy (car
));
5220 XSETCDR (new, Fpurecopy (cdr
));
5225 /* Value is a float object with value NUM allocated from pure space. */
5228 make_pure_float (double num
)
5230 register Lisp_Object
new;
5231 struct Lisp_Float
*p
;
5233 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
5235 XFLOAT_INIT (new, num
);
5240 /* Return a vector with room for LEN Lisp_Objects allocated from
5244 make_pure_vector (ptrdiff_t len
)
5247 struct Lisp_Vector
*p
;
5248 size_t size
= (offsetof (struct Lisp_Vector
, contents
)
5249 + len
* sizeof (Lisp_Object
));
5251 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
5252 XSETVECTOR (new, p
);
5253 XVECTOR (new)->header
.size
= len
;
5258 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
5259 doc
: /* Make a copy of object OBJ in pure storage.
5260 Recursively copies contents of vectors and cons cells.
5261 Does not copy symbols. Copies strings without text properties. */)
5262 (register Lisp_Object obj
)
5264 if (NILP (Vpurify_flag
))
5267 if (PURE_POINTER_P (XPNTR (obj
)))
5270 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
5272 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
5278 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
5279 else if (FLOATP (obj
))
5280 obj
= make_pure_float (XFLOAT_DATA (obj
));
5281 else if (STRINGP (obj
))
5282 obj
= make_pure_string (SSDATA (obj
), SCHARS (obj
),
5284 STRING_MULTIBYTE (obj
));
5285 else if (COMPILEDP (obj
) || VECTORP (obj
))
5287 register struct Lisp_Vector
*vec
;
5288 register ptrdiff_t i
;
5292 if (size
& PSEUDOVECTOR_FLAG
)
5293 size
&= PSEUDOVECTOR_SIZE_MASK
;
5294 vec
= XVECTOR (make_pure_vector (size
));
5295 for (i
= 0; i
< size
; i
++)
5296 vec
->contents
[i
] = Fpurecopy (AREF (obj
, i
));
5297 if (COMPILEDP (obj
))
5299 XSETPVECTYPE (vec
, PVEC_COMPILED
);
5300 XSETCOMPILED (obj
, vec
);
5303 XSETVECTOR (obj
, vec
);
5305 else if (MARKERP (obj
))
5306 error ("Attempt to copy a marker to pure storage");
5308 /* Not purified, don't hash-cons. */
5311 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
5312 Fputhash (obj
, obj
, Vpurify_flag
);
5319 /***********************************************************************
5321 ***********************************************************************/
5323 /* Put an entry in staticvec, pointing at the variable with address
5327 staticpro (Lisp_Object
*varaddress
)
5329 staticvec
[staticidx
++] = varaddress
;
5330 if (staticidx
>= NSTATICS
)
5335 /***********************************************************************
5337 ***********************************************************************/
5339 /* Temporarily prevent garbage collection. */
5342 inhibit_garbage_collection (void)
5344 ptrdiff_t count
= SPECPDL_INDEX ();
5346 specbind (Qgc_cons_threshold
, make_number (MOST_POSITIVE_FIXNUM
));
5351 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
5352 doc
: /* Reclaim storage for Lisp objects no longer needed.
5353 Garbage collection happens automatically if you cons more than
5354 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
5355 `garbage-collect' normally returns a list with info on amount of space in use:
5356 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
5357 (USED-MISCS . FREE-MISCS) USED-STRING-CHARS USED-VECTOR-SLOTS
5358 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
5359 (USED-STRINGS . FREE-STRINGS))
5360 However, if there was overflow in pure space, `garbage-collect'
5361 returns nil, because real GC can't be done.
5362 See Info node `(elisp)Garbage Collection'. */)
5365 register struct specbinding
*bind
;
5366 char stack_top_variable
;
5369 Lisp_Object total
[8];
5370 ptrdiff_t count
= SPECPDL_INDEX ();
5371 EMACS_TIME t1
, t2
, t3
;
5376 /* Can't GC if pure storage overflowed because we can't determine
5377 if something is a pure object or not. */
5378 if (pure_bytes_used_before_overflow
)
5383 /* Don't keep undo information around forever.
5384 Do this early on, so it is no problem if the user quits. */
5386 register struct buffer
*nextb
= all_buffers
;
5390 /* If a buffer's undo list is Qt, that means that undo is
5391 turned off in that buffer. Calling truncate_undo_list on
5392 Qt tends to return NULL, which effectively turns undo back on.
5393 So don't call truncate_undo_list if undo_list is Qt. */
5394 if (! NILP (nextb
->BUFFER_INTERNAL_FIELD (name
)) && ! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
5395 truncate_undo_list (nextb
);
5397 /* Shrink buffer gaps, but skip indirect and dead buffers. */
5398 if (nextb
->base_buffer
== 0 && !NILP (nextb
->BUFFER_INTERNAL_FIELD (name
))
5399 && ! nextb
->text
->inhibit_shrinking
)
5401 /* If a buffer's gap size is more than 10% of the buffer
5402 size, or larger than 2000 bytes, then shrink it
5403 accordingly. Keep a minimum size of 20 bytes. */
5404 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
5406 if (nextb
->text
->gap_size
> size
)
5408 struct buffer
*save_current
= current_buffer
;
5409 current_buffer
= nextb
;
5410 make_gap (-(nextb
->text
->gap_size
- size
));
5411 current_buffer
= save_current
;
5415 nextb
= nextb
->header
.next
.buffer
;
5419 EMACS_GET_TIME (t1
);
5421 /* In case user calls debug_print during GC,
5422 don't let that cause a recursive GC. */
5423 consing_since_gc
= 0;
5425 /* Save what's currently displayed in the echo area. */
5426 message_p
= push_message ();
5427 record_unwind_protect (pop_message_unwind
, Qnil
);
5429 /* Save a copy of the contents of the stack, for debugging. */
5430 #if MAX_SAVE_STACK > 0
5431 if (NILP (Vpurify_flag
))
5434 ptrdiff_t stack_size
;
5435 if (&stack_top_variable
< stack_bottom
)
5437 stack
= &stack_top_variable
;
5438 stack_size
= stack_bottom
- &stack_top_variable
;
5442 stack
= stack_bottom
;
5443 stack_size
= &stack_top_variable
- stack_bottom
;
5445 if (stack_size
<= MAX_SAVE_STACK
)
5447 if (stack_copy_size
< stack_size
)
5449 stack_copy
= (char *) xrealloc (stack_copy
, stack_size
);
5450 stack_copy_size
= stack_size
;
5452 memcpy (stack_copy
, stack
, stack_size
);
5455 #endif /* MAX_SAVE_STACK > 0 */
5457 if (garbage_collection_messages
)
5458 message1_nolog ("Garbage collecting...");
5462 shrink_regexp_cache ();
5466 /* clear_marks (); */
5468 /* Mark all the special slots that serve as the roots of accessibility. */
5470 for (i
= 0; i
< staticidx
; i
++)
5471 mark_object (*staticvec
[i
]);
5473 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
5475 mark_object (bind
->symbol
);
5476 mark_object (bind
->old_value
);
5484 extern void xg_mark_data (void);
5489 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5490 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5494 register struct gcpro
*tail
;
5495 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5496 for (i
= 0; i
< tail
->nvars
; i
++)
5497 mark_object (tail
->var
[i
]);
5501 struct catchtag
*catch;
5502 struct handler
*handler
;
5504 for (catch = catchlist
; catch; catch = catch->next
)
5506 mark_object (catch->tag
);
5507 mark_object (catch->val
);
5509 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5511 mark_object (handler
->handler
);
5512 mark_object (handler
->var
);
5518 #ifdef HAVE_WINDOW_SYSTEM
5519 mark_fringe_data ();
5522 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5526 /* Everything is now marked, except for the things that require special
5527 finalization, i.e. the undo_list.
5528 Look thru every buffer's undo list
5529 for elements that update markers that were not marked,
5532 register struct buffer
*nextb
= all_buffers
;
5536 /* If a buffer's undo list is Qt, that means that undo is
5537 turned off in that buffer. Calling truncate_undo_list on
5538 Qt tends to return NULL, which effectively turns undo back on.
5539 So don't call truncate_undo_list if undo_list is Qt. */
5540 if (! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
5542 Lisp_Object tail
, prev
;
5543 tail
= nextb
->BUFFER_INTERNAL_FIELD (undo_list
);
5545 while (CONSP (tail
))
5547 if (CONSP (XCAR (tail
))
5548 && MARKERP (XCAR (XCAR (tail
)))
5549 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5552 nextb
->BUFFER_INTERNAL_FIELD (undo_list
) = tail
= XCDR (tail
);
5556 XSETCDR (prev
, tail
);
5566 /* Now that we have stripped the elements that need not be in the
5567 undo_list any more, we can finally mark the list. */
5568 mark_object (nextb
->BUFFER_INTERNAL_FIELD (undo_list
));
5570 nextb
= nextb
->header
.next
.buffer
;
5576 /* Clear the mark bits that we set in certain root slots. */
5578 unmark_byte_stack ();
5579 VECTOR_UNMARK (&buffer_defaults
);
5580 VECTOR_UNMARK (&buffer_local_symbols
);
5582 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5590 /* clear_marks (); */
5593 consing_since_gc
= 0;
5594 if (gc_cons_threshold
< 10000)
5595 gc_cons_threshold
= 10000;
5597 gc_relative_threshold
= 0;
5598 if (FLOATP (Vgc_cons_percentage
))
5599 { /* Set gc_cons_combined_threshold. */
5602 tot
+= total_conses
* sizeof (struct Lisp_Cons
);
5603 tot
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5604 tot
+= total_markers
* sizeof (union Lisp_Misc
);
5605 tot
+= total_string_size
;
5606 tot
+= total_vector_size
* sizeof (Lisp_Object
);
5607 tot
+= total_floats
* sizeof (struct Lisp_Float
);
5608 tot
+= total_intervals
* sizeof (struct interval
);
5609 tot
+= total_strings
* sizeof (struct Lisp_String
);
5611 tot
*= XFLOAT_DATA (Vgc_cons_percentage
);
5614 if (tot
< TYPE_MAXIMUM (EMACS_INT
))
5615 gc_relative_threshold
= tot
;
5617 gc_relative_threshold
= TYPE_MAXIMUM (EMACS_INT
);
5621 if (garbage_collection_messages
)
5623 if (message_p
|| minibuf_level
> 0)
5626 message1_nolog ("Garbage collecting...done");
5629 unbind_to (count
, Qnil
);
5631 total
[0] = Fcons (make_number (total_conses
),
5632 make_number (total_free_conses
));
5633 total
[1] = Fcons (make_number (total_symbols
),
5634 make_number (total_free_symbols
));
5635 total
[2] = Fcons (make_number (total_markers
),
5636 make_number (total_free_markers
));
5637 total
[3] = make_number (total_string_size
);
5638 total
[4] = make_number (total_vector_size
);
5639 total
[5] = Fcons (make_number (total_floats
),
5640 make_number (total_free_floats
));
5641 total
[6] = Fcons (make_number (total_intervals
),
5642 make_number (total_free_intervals
));
5643 total
[7] = Fcons (make_number (total_strings
),
5644 make_number (total_free_strings
));
5646 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5648 /* Compute average percentage of zombies. */
5651 for (i
= 0; i
< 7; ++i
)
5652 if (CONSP (total
[i
]))
5653 nlive
+= XFASTINT (XCAR (total
[i
]));
5655 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5656 max_live
= max (nlive
, max_live
);
5657 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5658 max_zombies
= max (nzombies
, max_zombies
);
5663 if (!NILP (Vpost_gc_hook
))
5665 ptrdiff_t gc_count
= inhibit_garbage_collection ();
5666 safe_run_hooks (Qpost_gc_hook
);
5667 unbind_to (gc_count
, Qnil
);
5670 /* Accumulate statistics. */
5671 if (FLOATP (Vgc_elapsed
))
5673 EMACS_GET_TIME (t2
);
5674 EMACS_SUB_TIME (t3
, t2
, t1
);
5675 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
)
5676 + EMACS_TIME_TO_DOUBLE (t3
));
5681 return Flist (sizeof total
/ sizeof *total
, total
);
5685 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5686 only interesting objects referenced from glyphs are strings. */
5689 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5691 struct glyph_row
*row
= matrix
->rows
;
5692 struct glyph_row
*end
= row
+ matrix
->nrows
;
5694 for (; row
< end
; ++row
)
5698 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5700 struct glyph
*glyph
= row
->glyphs
[area
];
5701 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5703 for (; glyph
< end_glyph
; ++glyph
)
5704 if (STRINGP (glyph
->object
)
5705 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5706 mark_object (glyph
->object
);
5712 /* Mark Lisp faces in the face cache C. */
5715 mark_face_cache (struct face_cache
*c
)
5720 for (i
= 0; i
< c
->used
; ++i
)
5722 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5726 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5727 mark_object (face
->lface
[j
]);
5735 /* Mark reference to a Lisp_Object.
5736 If the object referred to has not been seen yet, recursively mark
5737 all the references contained in it. */
5739 #define LAST_MARKED_SIZE 500
5740 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5741 static int last_marked_index
;
5743 /* For debugging--call abort when we cdr down this many
5744 links of a list, in mark_object. In debugging,
5745 the call to abort will hit a breakpoint.
5746 Normally this is zero and the check never goes off. */
5747 ptrdiff_t mark_object_loop_halt EXTERNALLY_VISIBLE
;
5750 mark_vectorlike (struct Lisp_Vector
*ptr
)
5752 ptrdiff_t size
= ptr
->header
.size
;
5755 eassert (!VECTOR_MARKED_P (ptr
));
5756 VECTOR_MARK (ptr
); /* Else mark it */
5757 if (size
& PSEUDOVECTOR_FLAG
)
5758 size
&= PSEUDOVECTOR_SIZE_MASK
;
5760 /* Note that this size is not the memory-footprint size, but only
5761 the number of Lisp_Object fields that we should trace.
5762 The distinction is used e.g. by Lisp_Process which places extra
5763 non-Lisp_Object fields at the end of the structure. */
5764 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5765 mark_object (ptr
->contents
[i
]);
5768 /* Like mark_vectorlike but optimized for char-tables (and
5769 sub-char-tables) assuming that the contents are mostly integers or
5773 mark_char_table (struct Lisp_Vector
*ptr
)
5775 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5778 eassert (!VECTOR_MARKED_P (ptr
));
5780 for (i
= 0; i
< size
; i
++)
5782 Lisp_Object val
= ptr
->contents
[i
];
5784 if (INTEGERP (val
) || (SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
))
5786 if (SUB_CHAR_TABLE_P (val
))
5788 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5789 mark_char_table (XVECTOR (val
));
5797 mark_object (Lisp_Object arg
)
5799 register Lisp_Object obj
= arg
;
5800 #ifdef GC_CHECK_MARKED_OBJECTS
5804 ptrdiff_t cdr_count
= 0;
5808 if (PURE_POINTER_P (XPNTR (obj
)))
5811 last_marked
[last_marked_index
++] = obj
;
5812 if (last_marked_index
== LAST_MARKED_SIZE
)
5813 last_marked_index
= 0;
5815 /* Perform some sanity checks on the objects marked here. Abort if
5816 we encounter an object we know is bogus. This increases GC time
5817 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5818 #ifdef GC_CHECK_MARKED_OBJECTS
5820 po
= (void *) XPNTR (obj
);
5822 /* Check that the object pointed to by PO is known to be a Lisp
5823 structure allocated from the heap. */
5824 #define CHECK_ALLOCATED() \
5826 m = mem_find (po); \
5831 /* Check that the object pointed to by PO is live, using predicate
5833 #define CHECK_LIVE(LIVEP) \
5835 if (!LIVEP (m, po)) \
5839 /* Check both of the above conditions. */
5840 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5842 CHECK_ALLOCATED (); \
5843 CHECK_LIVE (LIVEP); \
5846 #else /* not GC_CHECK_MARKED_OBJECTS */
5848 #define CHECK_LIVE(LIVEP) (void) 0
5849 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5851 #endif /* not GC_CHECK_MARKED_OBJECTS */
5853 switch (SWITCH_ENUM_CAST (XTYPE (obj
)))
5857 register struct Lisp_String
*ptr
= XSTRING (obj
);
5858 if (STRING_MARKED_P (ptr
))
5860 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5861 MARK_INTERVAL_TREE (ptr
->intervals
);
5863 #ifdef GC_CHECK_STRING_BYTES
5864 /* Check that the string size recorded in the string is the
5865 same as the one recorded in the sdata structure. */
5866 CHECK_STRING_BYTES (ptr
);
5867 #endif /* GC_CHECK_STRING_BYTES */
5871 case Lisp_Vectorlike
:
5872 if (VECTOR_MARKED_P (XVECTOR (obj
)))
5874 #ifdef GC_CHECK_MARKED_OBJECTS
5876 if (m
== MEM_NIL
&& !SUBRP (obj
)
5877 && po
!= &buffer_defaults
5878 && po
!= &buffer_local_symbols
)
5880 #endif /* GC_CHECK_MARKED_OBJECTS */
5884 #ifdef GC_CHECK_MARKED_OBJECTS
5885 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5888 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->header
.next
.buffer
)
5893 #endif /* GC_CHECK_MARKED_OBJECTS */
5896 else if (SUBRP (obj
))
5898 else if (COMPILEDP (obj
))
5899 /* We could treat this just like a vector, but it is better to
5900 save the COMPILED_CONSTANTS element for last and avoid
5903 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5904 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5907 CHECK_LIVE (live_vector_p
);
5908 VECTOR_MARK (ptr
); /* Else mark it */
5909 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5911 if (i
!= COMPILED_CONSTANTS
)
5912 mark_object (ptr
->contents
[i
]);
5914 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5917 else if (FRAMEP (obj
))
5919 register struct frame
*ptr
= XFRAME (obj
);
5920 mark_vectorlike (XVECTOR (obj
));
5921 mark_face_cache (ptr
->face_cache
);
5923 else if (WINDOWP (obj
))
5925 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5926 struct window
*w
= XWINDOW (obj
);
5927 mark_vectorlike (ptr
);
5928 /* Mark glyphs for leaf windows. Marking window matrices is
5929 sufficient because frame matrices use the same glyph
5931 if (NILP (w
->hchild
)
5933 && w
->current_matrix
)
5935 mark_glyph_matrix (w
->current_matrix
);
5936 mark_glyph_matrix (w
->desired_matrix
);
5939 else if (HASH_TABLE_P (obj
))
5941 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5942 mark_vectorlike ((struct Lisp_Vector
*)h
);
5943 /* If hash table is not weak, mark all keys and values.
5944 For weak tables, mark only the vector. */
5946 mark_object (h
->key_and_value
);
5948 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5950 else if (CHAR_TABLE_P (obj
))
5951 mark_char_table (XVECTOR (obj
));
5953 mark_vectorlike (XVECTOR (obj
));
5958 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5959 struct Lisp_Symbol
*ptrx
;
5963 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5965 mark_object (ptr
->function
);
5966 mark_object (ptr
->plist
);
5967 switch (ptr
->redirect
)
5969 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
5970 case SYMBOL_VARALIAS
:
5973 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
5977 case SYMBOL_LOCALIZED
:
5979 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
5980 /* If the value is forwarded to a buffer or keyboard field,
5981 these are marked when we see the corresponding object.
5982 And if it's forwarded to a C variable, either it's not
5983 a Lisp_Object var, or it's staticpro'd already. */
5984 mark_object (blv
->where
);
5985 mark_object (blv
->valcell
);
5986 mark_object (blv
->defcell
);
5989 case SYMBOL_FORWARDED
:
5990 /* If the value is forwarded to a buffer or keyboard field,
5991 these are marked when we see the corresponding object.
5992 And if it's forwarded to a C variable, either it's not
5993 a Lisp_Object var, or it's staticpro'd already. */
5997 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5998 MARK_STRING (XSTRING (ptr
->xname
));
5999 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
6004 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
6005 XSETSYMBOL (obj
, ptrx
);
6012 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
6013 if (XMISCANY (obj
)->gcmarkbit
)
6015 XMISCANY (obj
)->gcmarkbit
= 1;
6017 switch (XMISCTYPE (obj
))
6020 case Lisp_Misc_Marker
:
6021 /* DO NOT mark thru the marker's chain.
6022 The buffer's markers chain does not preserve markers from gc;
6023 instead, markers are removed from the chain when freed by gc. */
6026 case Lisp_Misc_Save_Value
:
6029 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
6030 /* If DOGC is set, POINTER is the address of a memory
6031 area containing INTEGER potential Lisp_Objects. */
6034 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
6036 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
6037 mark_maybe_object (*p
);
6043 case Lisp_Misc_Overlay
:
6045 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
6046 mark_object (ptr
->start
);
6047 mark_object (ptr
->end
);
6048 mark_object (ptr
->plist
);
6051 XSETMISC (obj
, ptr
->next
);
6064 register struct Lisp_Cons
*ptr
= XCONS (obj
);
6065 if (CONS_MARKED_P (ptr
))
6067 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
6069 /* If the cdr is nil, avoid recursion for the car. */
6070 if (EQ (ptr
->u
.cdr
, Qnil
))
6076 mark_object (ptr
->car
);
6079 if (cdr_count
== mark_object_loop_halt
)
6085 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
6086 FLOAT_MARK (XFLOAT (obj
));
6097 #undef CHECK_ALLOCATED
6098 #undef CHECK_ALLOCATED_AND_LIVE
6101 /* Mark the pointers in a buffer structure. */
6104 mark_buffer (Lisp_Object buf
)
6106 register struct buffer
*buffer
= XBUFFER (buf
);
6107 register Lisp_Object
*ptr
, tmp
;
6108 Lisp_Object base_buffer
;
6110 eassert (!VECTOR_MARKED_P (buffer
));
6111 VECTOR_MARK (buffer
);
6113 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
6115 /* For now, we just don't mark the undo_list. It's done later in
6116 a special way just before the sweep phase, and after stripping
6117 some of its elements that are not needed any more. */
6119 if (buffer
->overlays_before
)
6121 XSETMISC (tmp
, buffer
->overlays_before
);
6124 if (buffer
->overlays_after
)
6126 XSETMISC (tmp
, buffer
->overlays_after
);
6130 /* buffer-local Lisp variables start at `undo_list',
6131 tho only the ones from `name' on are GC'd normally. */
6132 for (ptr
= &buffer
->BUFFER_INTERNAL_FIELD (name
);
6133 ptr
<= &PER_BUFFER_VALUE (buffer
,
6134 PER_BUFFER_VAR_OFFSET (LAST_FIELD_PER_BUFFER
));
6138 /* If this is an indirect buffer, mark its base buffer. */
6139 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
6141 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
6142 mark_buffer (base_buffer
);
6146 /* Mark the Lisp pointers in the terminal objects.
6147 Called by Fgarbage_collect. */
6150 mark_terminals (void)
6153 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
6155 eassert (t
->name
!= NULL
);
6156 #ifdef HAVE_WINDOW_SYSTEM
6157 /* If a terminal object is reachable from a stacpro'ed object,
6158 it might have been marked already. Make sure the image cache
6160 mark_image_cache (t
->image_cache
);
6161 #endif /* HAVE_WINDOW_SYSTEM */
6162 if (!VECTOR_MARKED_P (t
))
6163 mark_vectorlike ((struct Lisp_Vector
*)t
);
6169 /* Value is non-zero if OBJ will survive the current GC because it's
6170 either marked or does not need to be marked to survive. */
6173 survives_gc_p (Lisp_Object obj
)
6177 switch (XTYPE (obj
))
6184 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
6188 survives_p
= XMISCANY (obj
)->gcmarkbit
;
6192 survives_p
= STRING_MARKED_P (XSTRING (obj
));
6195 case Lisp_Vectorlike
:
6196 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
6200 survives_p
= CONS_MARKED_P (XCONS (obj
));
6204 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
6211 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
6216 /* Sweep: find all structures not marked, and free them. */
6221 /* Remove or mark entries in weak hash tables.
6222 This must be done before any object is unmarked. */
6223 sweep_weak_hash_tables ();
6226 #ifdef GC_CHECK_STRING_BYTES
6227 if (!noninteractive
)
6228 check_string_bytes (1);
6231 /* Put all unmarked conses on free list */
6233 register struct cons_block
*cblk
;
6234 struct cons_block
**cprev
= &cons_block
;
6235 register int lim
= cons_block_index
;
6236 EMACS_INT num_free
= 0, num_used
= 0;
6240 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
6244 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
6246 /* Scan the mark bits an int at a time. */
6247 for (i
= 0; i
< ilim
; i
++)
6249 if (cblk
->gcmarkbits
[i
] == -1)
6251 /* Fast path - all cons cells for this int are marked. */
6252 cblk
->gcmarkbits
[i
] = 0;
6253 num_used
+= BITS_PER_INT
;
6257 /* Some cons cells for this int are not marked.
6258 Find which ones, and free them. */
6259 int start
, pos
, stop
;
6261 start
= i
* BITS_PER_INT
;
6263 if (stop
> BITS_PER_INT
)
6264 stop
= BITS_PER_INT
;
6267 for (pos
= start
; pos
< stop
; pos
++)
6269 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
6272 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
6273 cons_free_list
= &cblk
->conses
[pos
];
6275 cons_free_list
->car
= Vdead
;
6281 CONS_UNMARK (&cblk
->conses
[pos
]);
6287 lim
= CONS_BLOCK_SIZE
;
6288 /* If this block contains only free conses and we have already
6289 seen more than two blocks worth of free conses then deallocate
6291 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
6293 *cprev
= cblk
->next
;
6294 /* Unhook from the free list. */
6295 cons_free_list
= cblk
->conses
[0].u
.chain
;
6296 lisp_align_free (cblk
);
6300 num_free
+= this_free
;
6301 cprev
= &cblk
->next
;
6304 total_conses
= num_used
;
6305 total_free_conses
= num_free
;
6308 /* Put all unmarked floats on free list */
6310 register struct float_block
*fblk
;
6311 struct float_block
**fprev
= &float_block
;
6312 register int lim
= float_block_index
;
6313 EMACS_INT num_free
= 0, num_used
= 0;
6315 float_free_list
= 0;
6317 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
6321 for (i
= 0; i
< lim
; i
++)
6322 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
6325 fblk
->floats
[i
].u
.chain
= float_free_list
;
6326 float_free_list
= &fblk
->floats
[i
];
6331 FLOAT_UNMARK (&fblk
->floats
[i
]);
6333 lim
= FLOAT_BLOCK_SIZE
;
6334 /* If this block contains only free floats and we have already
6335 seen more than two blocks worth of free floats then deallocate
6337 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
6339 *fprev
= fblk
->next
;
6340 /* Unhook from the free list. */
6341 float_free_list
= fblk
->floats
[0].u
.chain
;
6342 lisp_align_free (fblk
);
6346 num_free
+= this_free
;
6347 fprev
= &fblk
->next
;
6350 total_floats
= num_used
;
6351 total_free_floats
= num_free
;
6354 /* Put all unmarked intervals on free list */
6356 register struct interval_block
*iblk
;
6357 struct interval_block
**iprev
= &interval_block
;
6358 register int lim
= interval_block_index
;
6359 EMACS_INT num_free
= 0, num_used
= 0;
6361 interval_free_list
= 0;
6363 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
6368 for (i
= 0; i
< lim
; i
++)
6370 if (!iblk
->intervals
[i
].gcmarkbit
)
6372 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
6373 interval_free_list
= &iblk
->intervals
[i
];
6379 iblk
->intervals
[i
].gcmarkbit
= 0;
6382 lim
= INTERVAL_BLOCK_SIZE
;
6383 /* If this block contains only free intervals and we have already
6384 seen more than two blocks worth of free intervals then
6385 deallocate this block. */
6386 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
6388 *iprev
= iblk
->next
;
6389 /* Unhook from the free list. */
6390 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
6395 num_free
+= this_free
;
6396 iprev
= &iblk
->next
;
6399 total_intervals
= num_used
;
6400 total_free_intervals
= num_free
;
6403 /* Put all unmarked symbols on free list */
6405 register struct symbol_block
*sblk
;
6406 struct symbol_block
**sprev
= &symbol_block
;
6407 register int lim
= symbol_block_index
;
6408 EMACS_INT num_free
= 0, num_used
= 0;
6410 symbol_free_list
= NULL
;
6412 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
6415 union aligned_Lisp_Symbol
*sym
= sblk
->symbols
;
6416 union aligned_Lisp_Symbol
*end
= sym
+ lim
;
6418 for (; sym
< end
; ++sym
)
6420 /* Check if the symbol was created during loadup. In such a case
6421 it might be pointed to by pure bytecode which we don't trace,
6422 so we conservatively assume that it is live. */
6423 int pure_p
= PURE_POINTER_P (XSTRING (sym
->s
.xname
));
6425 if (!sym
->s
.gcmarkbit
&& !pure_p
)
6427 if (sym
->s
.redirect
== SYMBOL_LOCALIZED
)
6428 xfree (SYMBOL_BLV (&sym
->s
));
6429 sym
->s
.next
= symbol_free_list
;
6430 symbol_free_list
= &sym
->s
;
6432 symbol_free_list
->function
= Vdead
;
6440 UNMARK_STRING (XSTRING (sym
->s
.xname
));
6441 sym
->s
.gcmarkbit
= 0;
6445 lim
= SYMBOL_BLOCK_SIZE
;
6446 /* If this block contains only free symbols and we have already
6447 seen more than two blocks worth of free symbols then deallocate
6449 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6451 *sprev
= sblk
->next
;
6452 /* Unhook from the free list. */
6453 symbol_free_list
= sblk
->symbols
[0].s
.next
;
6458 num_free
+= this_free
;
6459 sprev
= &sblk
->next
;
6462 total_symbols
= num_used
;
6463 total_free_symbols
= num_free
;
6466 /* Put all unmarked misc's on free list.
6467 For a marker, first unchain it from the buffer it points into. */
6469 register struct marker_block
*mblk
;
6470 struct marker_block
**mprev
= &marker_block
;
6471 register int lim
= marker_block_index
;
6472 EMACS_INT num_free
= 0, num_used
= 0;
6474 marker_free_list
= 0;
6476 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6481 for (i
= 0; i
< lim
; i
++)
6483 if (!mblk
->markers
[i
].m
.u_any
.gcmarkbit
)
6485 if (mblk
->markers
[i
].m
.u_any
.type
== Lisp_Misc_Marker
)
6486 unchain_marker (&mblk
->markers
[i
].m
.u_marker
);
6487 /* Set the type of the freed object to Lisp_Misc_Free.
6488 We could leave the type alone, since nobody checks it,
6489 but this might catch bugs faster. */
6490 mblk
->markers
[i
].m
.u_marker
.type
= Lisp_Misc_Free
;
6491 mblk
->markers
[i
].m
.u_free
.chain
= marker_free_list
;
6492 marker_free_list
= &mblk
->markers
[i
].m
;
6498 mblk
->markers
[i
].m
.u_any
.gcmarkbit
= 0;
6501 lim
= MARKER_BLOCK_SIZE
;
6502 /* If this block contains only free markers and we have already
6503 seen more than two blocks worth of free markers then deallocate
6505 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6507 *mprev
= mblk
->next
;
6508 /* Unhook from the free list. */
6509 marker_free_list
= mblk
->markers
[0].m
.u_free
.chain
;
6514 num_free
+= this_free
;
6515 mprev
= &mblk
->next
;
6519 total_markers
= num_used
;
6520 total_free_markers
= num_free
;
6523 /* Free all unmarked buffers */
6525 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6528 if (!VECTOR_MARKED_P (buffer
))
6531 prev
->header
.next
= buffer
->header
.next
;
6533 all_buffers
= buffer
->header
.next
.buffer
;
6534 next
= buffer
->header
.next
.buffer
;
6540 VECTOR_UNMARK (buffer
);
6541 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6542 prev
= buffer
, buffer
= buffer
->header
.next
.buffer
;
6548 #ifdef GC_CHECK_STRING_BYTES
6549 if (!noninteractive
)
6550 check_string_bytes (1);
6557 /* Debugging aids. */
6559 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6560 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6561 This may be helpful in debugging Emacs's memory usage.
6562 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6567 XSETINT (end
, (intptr_t) (char *) sbrk (0) / 1024);
6572 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6573 doc
: /* Return a list of counters that measure how much consing there has been.
6574 Each of these counters increments for a certain kind of object.
6575 The counters wrap around from the largest positive integer to zero.
6576 Garbage collection does not decrease them.
6577 The elements of the value are as follows:
6578 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6579 All are in units of 1 = one object consed
6580 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6582 MISCS include overlays, markers, and some internal types.
6583 Frames, windows, buffers, and subprocesses count as vectors
6584 (but the contents of a buffer's text do not count here). */)
6587 Lisp_Object consed
[8];
6589 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6590 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6591 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6592 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6593 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6594 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6595 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6596 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6598 return Flist (8, consed
);
6601 /* Find at most FIND_MAX symbols which have OBJ as their value or
6602 function. This is used in gdbinit's `xwhichsymbols' command. */
6605 which_symbols (Lisp_Object obj
, EMACS_INT find_max
)
6607 struct symbol_block
*sblk
;
6608 ptrdiff_t gc_count
= inhibit_garbage_collection ();
6609 Lisp_Object found
= Qnil
;
6613 for (sblk
= symbol_block
; sblk
; sblk
= sblk
->next
)
6615 union aligned_Lisp_Symbol
*aligned_sym
= sblk
->symbols
;
6618 for (bn
= 0; bn
< SYMBOL_BLOCK_SIZE
; bn
++, aligned_sym
++)
6620 struct Lisp_Symbol
*sym
= &aligned_sym
->s
;
6624 if (sblk
== symbol_block
&& bn
>= symbol_block_index
)
6627 XSETSYMBOL (tem
, sym
);
6628 val
= find_symbol_value (tem
);
6630 || EQ (sym
->function
, obj
)
6631 || (!NILP (sym
->function
)
6632 && COMPILEDP (sym
->function
)
6633 && EQ (AREF (sym
->function
, COMPILED_BYTECODE
), obj
))
6636 && EQ (AREF (val
, COMPILED_BYTECODE
), obj
)))
6638 found
= Fcons (tem
, found
);
6639 if (--find_max
== 0)
6647 unbind_to (gc_count
, Qnil
);
6651 #ifdef ENABLE_CHECKING
6652 int suppress_checking
;
6655 die (const char *msg
, const char *file
, int line
)
6657 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6663 /* Initialization */
6666 init_alloc_once (void)
6668 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6670 pure_size
= PURESIZE
;
6671 pure_bytes_used
= 0;
6672 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6673 pure_bytes_used_before_overflow
= 0;
6675 /* Initialize the list of free aligned blocks. */
6678 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6680 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6683 ignore_warnings
= 1;
6684 #ifdef DOUG_LEA_MALLOC
6685 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6686 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6687 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6696 init_weak_hash_tables ();
6699 malloc_hysteresis
= 32;
6701 malloc_hysteresis
= 0;
6704 refill_memory_reserve ();
6706 ignore_warnings
= 0;
6708 byte_stack_list
= 0;
6710 consing_since_gc
= 0;
6711 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6712 gc_relative_threshold
= 0;
6719 byte_stack_list
= 0;
6721 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6722 setjmp_tested_p
= longjmps_done
= 0;
6725 Vgc_elapsed
= make_float (0.0);
6730 syms_of_alloc (void)
6732 DEFVAR_INT ("gc-cons-threshold", gc_cons_threshold
,
6733 doc
: /* Number of bytes of consing between garbage collections.
6734 Garbage collection can happen automatically once this many bytes have been
6735 allocated since the last garbage collection. All data types count.
6737 Garbage collection happens automatically only when `eval' is called.
6739 By binding this temporarily to a large number, you can effectively
6740 prevent garbage collection during a part of the program.
6741 See also `gc-cons-percentage'. */);
6743 DEFVAR_LISP ("gc-cons-percentage", Vgc_cons_percentage
,
6744 doc
: /* Portion of the heap used for allocation.
6745 Garbage collection can happen automatically once this portion of the heap
6746 has been allocated since the last garbage collection.
6747 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6748 Vgc_cons_percentage
= make_float (0.1);
6750 DEFVAR_INT ("pure-bytes-used", pure_bytes_used
,
6751 doc
: /* Number of bytes of shareable Lisp data allocated so far. */);
6753 DEFVAR_INT ("cons-cells-consed", cons_cells_consed
,
6754 doc
: /* Number of cons cells that have been consed so far. */);
6756 DEFVAR_INT ("floats-consed", floats_consed
,
6757 doc
: /* Number of floats that have been consed so far. */);
6759 DEFVAR_INT ("vector-cells-consed", vector_cells_consed
,
6760 doc
: /* Number of vector cells that have been consed so far. */);
6762 DEFVAR_INT ("symbols-consed", symbols_consed
,
6763 doc
: /* Number of symbols that have been consed so far. */);
6765 DEFVAR_INT ("string-chars-consed", string_chars_consed
,
6766 doc
: /* Number of string characters that have been consed so far. */);
6768 DEFVAR_INT ("misc-objects-consed", misc_objects_consed
,
6769 doc
: /* Number of miscellaneous objects that have been consed so far.
6770 These include markers and overlays, plus certain objects not visible
6773 DEFVAR_INT ("intervals-consed", intervals_consed
,
6774 doc
: /* Number of intervals that have been consed so far. */);
6776 DEFVAR_INT ("strings-consed", strings_consed
,
6777 doc
: /* Number of strings that have been consed so far. */);
6779 DEFVAR_LISP ("purify-flag", Vpurify_flag
,
6780 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6781 This means that certain objects should be allocated in shared (pure) space.
6782 It can also be set to a hash-table, in which case this table is used to
6783 do hash-consing of the objects allocated to pure space. */);
6785 DEFVAR_BOOL ("garbage-collection-messages", garbage_collection_messages
,
6786 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6787 garbage_collection_messages
= 0;
6789 DEFVAR_LISP ("post-gc-hook", Vpost_gc_hook
,
6790 doc
: /* Hook run after garbage collection has finished. */);
6791 Vpost_gc_hook
= Qnil
;
6792 DEFSYM (Qpost_gc_hook
, "post-gc-hook");
6794 DEFVAR_LISP ("memory-signal-data", Vmemory_signal_data
,
6795 doc
: /* Precomputed `signal' argument for memory-full error. */);
6796 /* We build this in advance because if we wait until we need it, we might
6797 not be able to allocate the memory to hold it. */
6799 = pure_cons (Qerror
,
6800 pure_cons (make_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"), Qnil
));
6802 DEFVAR_LISP ("memory-full", Vmemory_full
,
6803 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6804 Vmemory_full
= Qnil
;
6806 DEFSYM (Qgc_cons_threshold
, "gc-cons-threshold");
6807 DEFSYM (Qchar_table_extra_slots
, "char-table-extra-slots");
6809 DEFVAR_LISP ("gc-elapsed", Vgc_elapsed
,
6810 doc
: /* Accumulated time elapsed in garbage collections.
6811 The time is in seconds as a floating point value. */);
6812 DEFVAR_INT ("gcs-done", gcs_done
,
6813 doc
: /* Accumulated number of garbage collections done. */);
6818 defsubr (&Smake_byte_code
);
6819 defsubr (&Smake_list
);
6820 defsubr (&Smake_vector
);
6821 defsubr (&Smake_string
);
6822 defsubr (&Smake_bool_vector
);
6823 defsubr (&Smake_symbol
);
6824 defsubr (&Smake_marker
);
6825 defsubr (&Spurecopy
);
6826 defsubr (&Sgarbage_collect
);
6827 defsubr (&Smemory_limit
);
6828 defsubr (&Smemory_use_counts
);
6830 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6831 defsubr (&Sgc_status
);