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_terminals (void);
274 static void gc_sweep (void);
275 static Lisp_Object
make_pure_vector (ptrdiff_t);
276 static void mark_glyph_matrix (struct glyph_matrix
*);
277 static void mark_face_cache (struct face_cache
*);
279 #if !defined REL_ALLOC || defined SYSTEM_MALLOC
280 static void refill_memory_reserve (void);
282 static struct Lisp_String
*allocate_string (void);
283 static void compact_small_strings (void);
284 static void free_large_strings (void);
285 static void sweep_strings (void);
286 static void free_misc (Lisp_Object
);
287 extern Lisp_Object
which_symbols (Lisp_Object
, EMACS_INT
) EXTERNALLY_VISIBLE
;
289 /* When scanning the C stack for live Lisp objects, Emacs keeps track
290 of what memory allocated via lisp_malloc is intended for what
291 purpose. This enumeration specifies the type of memory. */
302 /* We used to keep separate mem_types for subtypes of vectors such as
303 process, hash_table, frame, terminal, and window, but we never made
304 use of the distinction, so it only caused source-code complexity
305 and runtime slowdown. Minor but pointless. */
307 /* Special type to denote vector blocks. */
308 MEM_TYPE_VECTOR_BLOCK
311 static void *lisp_malloc (size_t, enum mem_type
);
314 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
316 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
317 #include <stdio.h> /* For fprintf. */
320 /* A unique object in pure space used to make some Lisp objects
321 on free lists recognizable in O(1). */
323 static Lisp_Object Vdead
;
324 #define DEADP(x) EQ (x, Vdead)
326 #ifdef GC_MALLOC_CHECK
328 enum mem_type allocated_mem_type
;
330 #endif /* GC_MALLOC_CHECK */
332 /* A node in the red-black tree describing allocated memory containing
333 Lisp data. Each such block is recorded with its start and end
334 address when it is allocated, and removed from the tree when it
337 A red-black tree is a balanced binary tree with the following
340 1. Every node is either red or black.
341 2. Every leaf is black.
342 3. If a node is red, then both of its children are black.
343 4. Every simple path from a node to a descendant leaf contains
344 the same number of black nodes.
345 5. The root is always black.
347 When nodes are inserted into the tree, or deleted from the tree,
348 the tree is "fixed" so that these properties are always true.
350 A red-black tree with N internal nodes has height at most 2
351 log(N+1). Searches, insertions and deletions are done in O(log N).
352 Please see a text book about data structures for a detailed
353 description of red-black trees. Any book worth its salt should
358 /* Children of this node. These pointers are never NULL. When there
359 is no child, the value is MEM_NIL, which points to a dummy node. */
360 struct mem_node
*left
, *right
;
362 /* The parent of this node. In the root node, this is NULL. */
363 struct mem_node
*parent
;
365 /* Start and end of allocated region. */
369 enum {MEM_BLACK
, MEM_RED
} color
;
375 /* Base address of stack. Set in main. */
377 Lisp_Object
*stack_base
;
379 /* Root of the tree describing allocated Lisp memory. */
381 static struct mem_node
*mem_root
;
383 /* Lowest and highest known address in the heap. */
385 static void *min_heap_address
, *max_heap_address
;
387 /* Sentinel node of the tree. */
389 static struct mem_node mem_z
;
390 #define MEM_NIL &mem_z
392 static struct Lisp_Vector
*allocate_vectorlike (ptrdiff_t);
393 static void lisp_free (void *);
394 static void mark_stack (void);
395 static int live_vector_p (struct mem_node
*, void *);
396 static int live_buffer_p (struct mem_node
*, void *);
397 static int live_string_p (struct mem_node
*, void *);
398 static int live_cons_p (struct mem_node
*, void *);
399 static int live_symbol_p (struct mem_node
*, void *);
400 static int live_float_p (struct mem_node
*, void *);
401 static int live_misc_p (struct mem_node
*, void *);
402 static void mark_maybe_object (Lisp_Object
);
403 static void mark_memory (void *, void *);
404 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
405 static void mem_init (void);
406 static struct mem_node
*mem_insert (void *, void *, enum mem_type
);
407 static void mem_insert_fixup (struct mem_node
*);
409 static void mem_rotate_left (struct mem_node
*);
410 static void mem_rotate_right (struct mem_node
*);
411 static void mem_delete (struct mem_node
*);
412 static void mem_delete_fixup (struct mem_node
*);
413 static inline struct mem_node
*mem_find (void *);
416 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
417 static void check_gcpros (void);
420 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
426 /* Recording what needs to be marked for gc. */
428 struct gcpro
*gcprolist
;
430 /* Addresses of staticpro'd variables. Initialize it to a nonzero
431 value; otherwise some compilers put it into BSS. */
433 #define NSTATICS 0x650
434 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
436 /* Index of next unused slot in staticvec. */
438 static int staticidx
= 0;
440 static void *pure_alloc (size_t, int);
443 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
444 ALIGNMENT must be a power of 2. */
446 #define ALIGN(ptr, ALIGNMENT) \
447 ((void *) (((uintptr_t) (ptr) + (ALIGNMENT) - 1) \
448 & ~ ((ALIGNMENT) - 1)))
452 /************************************************************************
454 ************************************************************************/
456 /* Function malloc calls this if it finds we are near exhausting storage. */
459 malloc_warning (const char *str
)
461 pending_malloc_warning
= str
;
465 /* Display an already-pending malloc warning. */
468 display_malloc_warning (void)
470 call3 (intern ("display-warning"),
472 build_string (pending_malloc_warning
),
473 intern ("emergency"));
474 pending_malloc_warning
= 0;
477 /* Called if we can't allocate relocatable space for a buffer. */
480 buffer_memory_full (ptrdiff_t nbytes
)
482 /* If buffers use the relocating allocator, no need to free
483 spare_memory, because we may have plenty of malloc space left
484 that we could get, and if we don't, the malloc that fails will
485 itself cause spare_memory to be freed. If buffers don't use the
486 relocating allocator, treat this like any other failing
490 memory_full (nbytes
);
493 /* This used to call error, but if we've run out of memory, we could
494 get infinite recursion trying to build the string. */
495 xsignal (Qnil
, Vmemory_signal_data
);
498 /* A common multiple of the positive integers A and B. Ideally this
499 would be the least common multiple, but there's no way to do that
500 as a constant expression in C, so do the best that we can easily do. */
501 #define COMMON_MULTIPLE(a, b) \
502 ((a) % (b) == 0 ? (a) : (b) % (a) == 0 ? (b) : (a) * (b))
504 #ifndef XMALLOC_OVERRUN_CHECK
505 #define XMALLOC_OVERRUN_CHECK_OVERHEAD 0
508 /* Check for overrun in malloc'ed buffers by wrapping a header and trailer
511 The header consists of XMALLOC_OVERRUN_CHECK_SIZE fixed bytes
512 followed by XMALLOC_OVERRUN_SIZE_SIZE bytes containing the original
513 block size in little-endian order. The trailer consists of
514 XMALLOC_OVERRUN_CHECK_SIZE fixed bytes.
516 The header is used to detect whether this block has been allocated
517 through these functions, as some low-level libc functions may
518 bypass the malloc hooks. */
520 #define XMALLOC_OVERRUN_CHECK_SIZE 16
521 #define XMALLOC_OVERRUN_CHECK_OVERHEAD \
522 (2 * XMALLOC_OVERRUN_CHECK_SIZE + XMALLOC_OVERRUN_SIZE_SIZE)
524 /* Define XMALLOC_OVERRUN_SIZE_SIZE so that (1) it's large enough to
525 hold a size_t value and (2) the header size is a multiple of the
526 alignment that Emacs needs for C types and for USE_LSB_TAG. */
527 #define XMALLOC_BASE_ALIGNMENT \
530 union { long double d; intmax_t i; void *p; } u; \
536 # define XMALLOC_HEADER_ALIGNMENT \
537 COMMON_MULTIPLE (1 << GCTYPEBITS, XMALLOC_BASE_ALIGNMENT)
539 # define XMALLOC_HEADER_ALIGNMENT XMALLOC_BASE_ALIGNMENT
541 #define XMALLOC_OVERRUN_SIZE_SIZE \
542 (((XMALLOC_OVERRUN_CHECK_SIZE + sizeof (size_t) \
543 + XMALLOC_HEADER_ALIGNMENT - 1) \
544 / XMALLOC_HEADER_ALIGNMENT * XMALLOC_HEADER_ALIGNMENT) \
545 - XMALLOC_OVERRUN_CHECK_SIZE)
547 static char const xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
] =
548 { '\x9a', '\x9b', '\xae', '\xaf',
549 '\xbf', '\xbe', '\xce', '\xcf',
550 '\xea', '\xeb', '\xec', '\xed',
551 '\xdf', '\xde', '\x9c', '\x9d' };
553 static char const xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
554 { '\xaa', '\xab', '\xac', '\xad',
555 '\xba', '\xbb', '\xbc', '\xbd',
556 '\xca', '\xcb', '\xcc', '\xcd',
557 '\xda', '\xdb', '\xdc', '\xdd' };
559 /* Insert and extract the block size in the header. */
562 xmalloc_put_size (unsigned char *ptr
, size_t size
)
565 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
567 *--ptr
= size
& ((1 << CHAR_BIT
) - 1);
573 xmalloc_get_size (unsigned char *ptr
)
577 ptr
-= XMALLOC_OVERRUN_SIZE_SIZE
;
578 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
587 /* The call depth in overrun_check functions. For example, this might happen:
589 overrun_check_malloc()
590 -> malloc -> (via hook)_-> emacs_blocked_malloc
591 -> overrun_check_malloc
592 call malloc (hooks are NULL, so real malloc is called).
593 malloc returns 10000.
594 add overhead, return 10016.
595 <- (back in overrun_check_malloc)
596 add overhead again, return 10032
597 xmalloc returns 10032.
602 overrun_check_free(10032)
604 free(10016) <- crash, because 10000 is the original pointer. */
606 static ptrdiff_t check_depth
;
608 /* Like malloc, but wraps allocated block with header and trailer. */
611 overrun_check_malloc (size_t size
)
613 register unsigned char *val
;
614 int overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_OVERHEAD
: 0;
615 if (SIZE_MAX
- overhead
< size
)
618 val
= (unsigned char *) malloc (size
+ overhead
);
619 if (val
&& check_depth
== 1)
621 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
622 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
623 xmalloc_put_size (val
, size
);
624 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
625 XMALLOC_OVERRUN_CHECK_SIZE
);
632 /* Like realloc, but checks old block for overrun, and wraps new block
633 with header and trailer. */
636 overrun_check_realloc (void *block
, size_t size
)
638 register unsigned char *val
= (unsigned char *) block
;
639 int overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_OVERHEAD
: 0;
640 if (SIZE_MAX
- overhead
< size
)
645 && memcmp (xmalloc_overrun_check_header
,
646 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
647 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
649 size_t osize
= xmalloc_get_size (val
);
650 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
651 XMALLOC_OVERRUN_CHECK_SIZE
))
653 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
654 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
655 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
658 val
= realloc (val
, size
+ overhead
);
660 if (val
&& check_depth
== 1)
662 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
663 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
664 xmalloc_put_size (val
, size
);
665 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
666 XMALLOC_OVERRUN_CHECK_SIZE
);
672 /* Like free, but checks block for overrun. */
675 overrun_check_free (void *block
)
677 unsigned char *val
= (unsigned char *) block
;
682 && memcmp (xmalloc_overrun_check_header
,
683 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
684 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
686 size_t osize
= xmalloc_get_size (val
);
687 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
688 XMALLOC_OVERRUN_CHECK_SIZE
))
690 #ifdef XMALLOC_CLEAR_FREE_MEMORY
691 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
692 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
694 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
695 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
696 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
707 #define malloc overrun_check_malloc
708 #define realloc overrun_check_realloc
709 #define free overrun_check_free
713 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
714 there's no need to block input around malloc. */
715 #define MALLOC_BLOCK_INPUT ((void)0)
716 #define MALLOC_UNBLOCK_INPUT ((void)0)
718 #define MALLOC_BLOCK_INPUT BLOCK_INPUT
719 #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT
722 /* Like malloc but check for no memory and block interrupt input.. */
725 xmalloc (size_t size
)
731 MALLOC_UNBLOCK_INPUT
;
739 /* Like realloc but check for no memory and block interrupt input.. */
742 xrealloc (void *block
, size_t size
)
747 /* We must call malloc explicitly when BLOCK is 0, since some
748 reallocs don't do this. */
752 val
= realloc (block
, size
);
753 MALLOC_UNBLOCK_INPUT
;
761 /* Like free but block interrupt input. */
770 MALLOC_UNBLOCK_INPUT
;
771 /* We don't call refill_memory_reserve here
772 because that duplicates doing so in emacs_blocked_free
773 and the criterion should go there. */
777 /* Other parts of Emacs pass large int values to allocator functions
778 expecting ptrdiff_t. This is portable in practice, but check it to
780 verify (INT_MAX
<= PTRDIFF_MAX
);
783 /* Allocate an array of NITEMS items, each of size ITEM_SIZE.
784 Signal an error on memory exhaustion, and block interrupt input. */
787 xnmalloc (ptrdiff_t nitems
, ptrdiff_t item_size
)
789 eassert (0 <= nitems
&& 0 < item_size
);
790 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
791 memory_full (SIZE_MAX
);
792 return xmalloc (nitems
* item_size
);
796 /* Reallocate an array PA to make it of NITEMS items, each of size ITEM_SIZE.
797 Signal an error on memory exhaustion, and block interrupt input. */
800 xnrealloc (void *pa
, ptrdiff_t nitems
, ptrdiff_t item_size
)
802 eassert (0 <= nitems
&& 0 < item_size
);
803 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
804 memory_full (SIZE_MAX
);
805 return xrealloc (pa
, nitems
* item_size
);
809 /* Grow PA, which points to an array of *NITEMS items, and return the
810 location of the reallocated array, updating *NITEMS to reflect its
811 new size. The new array will contain at least NITEMS_INCR_MIN more
812 items, but will not contain more than NITEMS_MAX items total.
813 ITEM_SIZE is the size of each item, in bytes.
815 ITEM_SIZE and NITEMS_INCR_MIN must be positive. *NITEMS must be
816 nonnegative. If NITEMS_MAX is -1, it is treated as if it were
819 If PA is null, then allocate a new array instead of reallocating
820 the old one. Thus, to grow an array A without saving its old
821 contents, invoke xfree (A) immediately followed by xgrowalloc (0,
824 Block interrupt input as needed. If memory exhaustion occurs, set
825 *NITEMS to zero if PA is null, and signal an error (i.e., do not
829 xpalloc (void *pa
, ptrdiff_t *nitems
, ptrdiff_t nitems_incr_min
,
830 ptrdiff_t nitems_max
, ptrdiff_t item_size
)
832 /* The approximate size to use for initial small allocation
833 requests. This is the largest "small" request for the GNU C
835 enum { DEFAULT_MXFAST
= 64 * sizeof (size_t) / 4 };
837 /* If the array is tiny, grow it to about (but no greater than)
838 DEFAULT_MXFAST bytes. Otherwise, grow it by about 50%. */
839 ptrdiff_t n
= *nitems
;
840 ptrdiff_t tiny_max
= DEFAULT_MXFAST
/ item_size
- n
;
841 ptrdiff_t half_again
= n
>> 1;
842 ptrdiff_t incr_estimate
= max (tiny_max
, half_again
);
844 /* Adjust the increment according to three constraints: NITEMS_INCR_MIN,
845 NITEMS_MAX, and what the C language can represent safely. */
846 ptrdiff_t C_language_max
= min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
;
847 ptrdiff_t n_max
= (0 <= nitems_max
&& nitems_max
< C_language_max
848 ? nitems_max
: C_language_max
);
849 ptrdiff_t nitems_incr_max
= n_max
- n
;
850 ptrdiff_t incr
= max (nitems_incr_min
, min (incr_estimate
, nitems_incr_max
));
852 eassert (0 < item_size
&& 0 < nitems_incr_min
&& 0 <= n
&& -1 <= nitems_max
);
855 if (nitems_incr_max
< incr
)
856 memory_full (SIZE_MAX
);
858 pa
= xrealloc (pa
, n
* item_size
);
864 /* Like strdup, but uses xmalloc. */
867 xstrdup (const char *s
)
869 size_t len
= strlen (s
) + 1;
870 char *p
= (char *) xmalloc (len
);
876 /* Unwind for SAFE_ALLOCA */
879 safe_alloca_unwind (Lisp_Object arg
)
881 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
891 /* Like malloc but used for allocating Lisp data. NBYTES is the
892 number of bytes to allocate, TYPE describes the intended use of the
893 allocated memory block (for strings, for conses, ...). */
896 void *lisp_malloc_loser EXTERNALLY_VISIBLE
;
900 lisp_malloc (size_t nbytes
, enum mem_type type
)
906 #ifdef GC_MALLOC_CHECK
907 allocated_mem_type
= type
;
910 val
= (void *) malloc (nbytes
);
913 /* If the memory just allocated cannot be addressed thru a Lisp
914 object's pointer, and it needs to be,
915 that's equivalent to running out of memory. */
916 if (val
&& type
!= MEM_TYPE_NON_LISP
)
919 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
920 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
922 lisp_malloc_loser
= val
;
929 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
930 if (val
&& type
!= MEM_TYPE_NON_LISP
)
931 mem_insert (val
, (char *) val
+ nbytes
, type
);
934 MALLOC_UNBLOCK_INPUT
;
936 memory_full (nbytes
);
940 /* Free BLOCK. This must be called to free memory allocated with a
941 call to lisp_malloc. */
944 lisp_free (void *block
)
948 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
949 mem_delete (mem_find (block
));
951 MALLOC_UNBLOCK_INPUT
;
954 /***** Allocation of aligned blocks of memory to store Lisp data. *****/
956 /* The entry point is lisp_align_malloc which returns blocks of at most
957 BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
959 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
960 #define USE_POSIX_MEMALIGN 1
963 /* BLOCK_ALIGN has to be a power of 2. */
964 #define BLOCK_ALIGN (1 << 10)
966 /* Padding to leave at the end of a malloc'd block. This is to give
967 malloc a chance to minimize the amount of memory wasted to alignment.
968 It should be tuned to the particular malloc library used.
969 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
970 posix_memalign on the other hand would ideally prefer a value of 4
971 because otherwise, there's 1020 bytes wasted between each ablocks.
972 In Emacs, testing shows that those 1020 can most of the time be
973 efficiently used by malloc to place other objects, so a value of 0 can
974 still preferable unless you have a lot of aligned blocks and virtually
976 #define BLOCK_PADDING 0
977 #define BLOCK_BYTES \
978 (BLOCK_ALIGN - sizeof (struct ablocks *) - BLOCK_PADDING)
980 /* Internal data structures and constants. */
982 #define ABLOCKS_SIZE 16
984 /* An aligned block of memory. */
989 char payload
[BLOCK_BYTES
];
990 struct ablock
*next_free
;
992 /* `abase' is the aligned base of the ablocks. */
993 /* It is overloaded to hold the virtual `busy' field that counts
994 the number of used ablock in the parent ablocks.
995 The first ablock has the `busy' field, the others have the `abase'
996 field. To tell the difference, we assume that pointers will have
997 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
998 is used to tell whether the real base of the parent ablocks is `abase'
999 (if not, the word before the first ablock holds a pointer to the
1001 struct ablocks
*abase
;
1002 /* The padding of all but the last ablock is unused. The padding of
1003 the last ablock in an ablocks is not allocated. */
1005 char padding
[BLOCK_PADDING
];
1009 /* A bunch of consecutive aligned blocks. */
1012 struct ablock blocks
[ABLOCKS_SIZE
];
1015 /* Size of the block requested from malloc or posix_memalign. */
1016 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
1018 #define ABLOCK_ABASE(block) \
1019 (((uintptr_t) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
1020 ? (struct ablocks *)(block) \
1023 /* Virtual `busy' field. */
1024 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
1026 /* Pointer to the (not necessarily aligned) malloc block. */
1027 #ifdef USE_POSIX_MEMALIGN
1028 #define ABLOCKS_BASE(abase) (abase)
1030 #define ABLOCKS_BASE(abase) \
1031 (1 & (intptr_t) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
1034 /* The list of free ablock. */
1035 static struct ablock
*free_ablock
;
1037 /* Allocate an aligned block of nbytes.
1038 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
1039 smaller or equal to BLOCK_BYTES. */
1041 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
1044 struct ablocks
*abase
;
1046 eassert (nbytes
<= BLOCK_BYTES
);
1050 #ifdef GC_MALLOC_CHECK
1051 allocated_mem_type
= type
;
1057 intptr_t aligned
; /* int gets warning casting to 64-bit pointer. */
1059 #ifdef DOUG_LEA_MALLOC
1060 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1061 because mapped region contents are not preserved in
1063 mallopt (M_MMAP_MAX
, 0);
1066 #ifdef USE_POSIX_MEMALIGN
1068 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1074 base
= malloc (ABLOCKS_BYTES
);
1075 abase
= ALIGN (base
, BLOCK_ALIGN
);
1080 MALLOC_UNBLOCK_INPUT
;
1081 memory_full (ABLOCKS_BYTES
);
1084 aligned
= (base
== abase
);
1086 ((void**)abase
)[-1] = base
;
1088 #ifdef DOUG_LEA_MALLOC
1089 /* Back to a reasonable maximum of mmap'ed areas. */
1090 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1094 /* If the memory just allocated cannot be addressed thru a Lisp
1095 object's pointer, and it needs to be, that's equivalent to
1096 running out of memory. */
1097 if (type
!= MEM_TYPE_NON_LISP
)
1100 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1101 XSETCONS (tem
, end
);
1102 if ((char *) XCONS (tem
) != end
)
1104 lisp_malloc_loser
= base
;
1106 MALLOC_UNBLOCK_INPUT
;
1107 memory_full (SIZE_MAX
);
1112 /* Initialize the blocks and put them on the free list.
1113 If `base' was not properly aligned, we can't use the last block. */
1114 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1116 abase
->blocks
[i
].abase
= abase
;
1117 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1118 free_ablock
= &abase
->blocks
[i
];
1120 ABLOCKS_BUSY (abase
) = (struct ablocks
*) aligned
;
1122 eassert (0 == ((uintptr_t) abase
) % BLOCK_ALIGN
);
1123 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1124 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1125 eassert (ABLOCKS_BASE (abase
) == base
);
1126 eassert (aligned
== (intptr_t) ABLOCKS_BUSY (abase
));
1129 abase
= ABLOCK_ABASE (free_ablock
);
1130 ABLOCKS_BUSY (abase
) =
1131 (struct ablocks
*) (2 + (intptr_t) ABLOCKS_BUSY (abase
));
1133 free_ablock
= free_ablock
->x
.next_free
;
1135 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1136 if (type
!= MEM_TYPE_NON_LISP
)
1137 mem_insert (val
, (char *) val
+ nbytes
, type
);
1140 MALLOC_UNBLOCK_INPUT
;
1142 eassert (0 == ((uintptr_t) val
) % BLOCK_ALIGN
);
1147 lisp_align_free (void *block
)
1149 struct ablock
*ablock
= block
;
1150 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1153 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1154 mem_delete (mem_find (block
));
1156 /* Put on free list. */
1157 ablock
->x
.next_free
= free_ablock
;
1158 free_ablock
= ablock
;
1159 /* Update busy count. */
1160 ABLOCKS_BUSY (abase
)
1161 = (struct ablocks
*) (-2 + (intptr_t) ABLOCKS_BUSY (abase
));
1163 if (2 > (intptr_t) ABLOCKS_BUSY (abase
))
1164 { /* All the blocks are free. */
1165 int i
= 0, aligned
= (intptr_t) ABLOCKS_BUSY (abase
);
1166 struct ablock
**tem
= &free_ablock
;
1167 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1171 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1174 *tem
= (*tem
)->x
.next_free
;
1177 tem
= &(*tem
)->x
.next_free
;
1179 eassert ((aligned
& 1) == aligned
);
1180 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1181 #ifdef USE_POSIX_MEMALIGN
1182 eassert ((uintptr_t) ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1184 free (ABLOCKS_BASE (abase
));
1186 MALLOC_UNBLOCK_INPUT
;
1190 #ifndef SYSTEM_MALLOC
1192 /* Arranging to disable input signals while we're in malloc.
1194 This only works with GNU malloc. To help out systems which can't
1195 use GNU malloc, all the calls to malloc, realloc, and free
1196 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1197 pair; unfortunately, we have no idea what C library functions
1198 might call malloc, so we can't really protect them unless you're
1199 using GNU malloc. Fortunately, most of the major operating systems
1200 can use GNU malloc. */
1203 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
1204 there's no need to block input around malloc. */
1206 #ifndef DOUG_LEA_MALLOC
1207 extern void * (*__malloc_hook
) (size_t, const void *);
1208 extern void * (*__realloc_hook
) (void *, size_t, const void *);
1209 extern void (*__free_hook
) (void *, const void *);
1210 /* Else declared in malloc.h, perhaps with an extra arg. */
1211 #endif /* DOUG_LEA_MALLOC */
1212 static void * (*old_malloc_hook
) (size_t, const void *);
1213 static void * (*old_realloc_hook
) (void *, size_t, const void*);
1214 static void (*old_free_hook
) (void*, const void*);
1216 #ifdef DOUG_LEA_MALLOC
1217 # define BYTES_USED (mallinfo ().uordblks)
1219 # define BYTES_USED _bytes_used
1222 #ifdef GC_MALLOC_CHECK
1223 static int dont_register_blocks
;
1226 static size_t bytes_used_when_reconsidered
;
1228 /* Value of _bytes_used, when spare_memory was freed. */
1230 static size_t bytes_used_when_full
;
1232 /* This function is used as the hook for free to call. */
1235 emacs_blocked_free (void *ptr
, const void *ptr2
)
1239 #ifdef GC_MALLOC_CHECK
1245 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1248 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1253 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1257 #endif /* GC_MALLOC_CHECK */
1259 __free_hook
= old_free_hook
;
1262 /* If we released our reserve (due to running out of memory),
1263 and we have a fair amount free once again,
1264 try to set aside another reserve in case we run out once more. */
1265 if (! NILP (Vmemory_full
)
1266 /* Verify there is enough space that even with the malloc
1267 hysteresis this call won't run out again.
1268 The code here is correct as long as SPARE_MEMORY
1269 is substantially larger than the block size malloc uses. */
1270 && (bytes_used_when_full
1271 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1272 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1273 refill_memory_reserve ();
1275 __free_hook
= emacs_blocked_free
;
1276 UNBLOCK_INPUT_ALLOC
;
1280 /* This function is the malloc hook that Emacs uses. */
1283 emacs_blocked_malloc (size_t size
, const void *ptr
)
1288 __malloc_hook
= old_malloc_hook
;
1289 #ifdef DOUG_LEA_MALLOC
1290 /* Segfaults on my system. --lorentey */
1291 /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */
1293 __malloc_extra_blocks
= malloc_hysteresis
;
1296 value
= (void *) malloc (size
);
1298 #ifdef GC_MALLOC_CHECK
1300 struct mem_node
*m
= mem_find (value
);
1303 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1305 fprintf (stderr
, "Region in use is %p...%p, %td bytes, type %d\n",
1306 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1311 if (!dont_register_blocks
)
1313 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1314 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1317 #endif /* GC_MALLOC_CHECK */
1319 __malloc_hook
= emacs_blocked_malloc
;
1320 UNBLOCK_INPUT_ALLOC
;
1322 /* fprintf (stderr, "%p malloc\n", value); */
1327 /* This function is the realloc hook that Emacs uses. */
1330 emacs_blocked_realloc (void *ptr
, size_t size
, const void *ptr2
)
1335 __realloc_hook
= old_realloc_hook
;
1337 #ifdef GC_MALLOC_CHECK
1340 struct mem_node
*m
= mem_find (ptr
);
1341 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1344 "Realloc of %p which wasn't allocated with malloc\n",
1352 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1354 /* Prevent malloc from registering blocks. */
1355 dont_register_blocks
= 1;
1356 #endif /* GC_MALLOC_CHECK */
1358 value
= (void *) realloc (ptr
, size
);
1360 #ifdef GC_MALLOC_CHECK
1361 dont_register_blocks
= 0;
1364 struct mem_node
*m
= mem_find (value
);
1367 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1371 /* Can't handle zero size regions in the red-black tree. */
1372 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1375 /* fprintf (stderr, "%p <- realloc\n", value); */
1376 #endif /* GC_MALLOC_CHECK */
1378 __realloc_hook
= emacs_blocked_realloc
;
1379 UNBLOCK_INPUT_ALLOC
;
1386 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1387 normal malloc. Some thread implementations need this as they call
1388 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1389 calls malloc because it is the first call, and we have an endless loop. */
1392 reset_malloc_hooks (void)
1394 __free_hook
= old_free_hook
;
1395 __malloc_hook
= old_malloc_hook
;
1396 __realloc_hook
= old_realloc_hook
;
1398 #endif /* HAVE_PTHREAD */
1401 /* Called from main to set up malloc to use our hooks. */
1404 uninterrupt_malloc (void)
1407 #ifdef DOUG_LEA_MALLOC
1408 pthread_mutexattr_t attr
;
1410 /* GLIBC has a faster way to do this, but let's keep it portable.
1411 This is according to the Single UNIX Specification. */
1412 pthread_mutexattr_init (&attr
);
1413 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1414 pthread_mutex_init (&alloc_mutex
, &attr
);
1415 #else /* !DOUG_LEA_MALLOC */
1416 /* Some systems such as Solaris 2.6 don't have a recursive mutex,
1417 and the bundled gmalloc.c doesn't require it. */
1418 pthread_mutex_init (&alloc_mutex
, NULL
);
1419 #endif /* !DOUG_LEA_MALLOC */
1420 #endif /* HAVE_PTHREAD */
1422 if (__free_hook
!= emacs_blocked_free
)
1423 old_free_hook
= __free_hook
;
1424 __free_hook
= emacs_blocked_free
;
1426 if (__malloc_hook
!= emacs_blocked_malloc
)
1427 old_malloc_hook
= __malloc_hook
;
1428 __malloc_hook
= emacs_blocked_malloc
;
1430 if (__realloc_hook
!= emacs_blocked_realloc
)
1431 old_realloc_hook
= __realloc_hook
;
1432 __realloc_hook
= emacs_blocked_realloc
;
1435 #endif /* not SYNC_INPUT */
1436 #endif /* not SYSTEM_MALLOC */
1440 /***********************************************************************
1442 ***********************************************************************/
1444 /* Number of intervals allocated in an interval_block structure.
1445 The 1020 is 1024 minus malloc overhead. */
1447 #define INTERVAL_BLOCK_SIZE \
1448 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1450 /* Intervals are allocated in chunks in form of an interval_block
1453 struct interval_block
1455 /* Place `intervals' first, to preserve alignment. */
1456 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1457 struct interval_block
*next
;
1460 /* Current interval block. Its `next' pointer points to older
1463 static struct interval_block
*interval_block
;
1465 /* Index in interval_block above of the next unused interval
1468 static int interval_block_index
;
1470 /* Number of free and live intervals. */
1472 static EMACS_INT total_free_intervals
, total_intervals
;
1474 /* List of free intervals. */
1476 static INTERVAL interval_free_list
;
1479 /* Initialize interval allocation. */
1482 init_intervals (void)
1484 interval_block
= NULL
;
1485 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1486 interval_free_list
= 0;
1490 /* Return a new interval. */
1493 make_interval (void)
1497 /* eassert (!handling_signal); */
1501 if (interval_free_list
)
1503 val
= interval_free_list
;
1504 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1508 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1510 register struct interval_block
*newi
;
1512 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1515 newi
->next
= interval_block
;
1516 interval_block
= newi
;
1517 interval_block_index
= 0;
1519 val
= &interval_block
->intervals
[interval_block_index
++];
1522 MALLOC_UNBLOCK_INPUT
;
1524 consing_since_gc
+= sizeof (struct interval
);
1526 RESET_INTERVAL (val
);
1532 /* Mark Lisp objects in interval I. */
1535 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1537 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1539 mark_object (i
->plist
);
1543 /* Mark the interval tree rooted in TREE. Don't call this directly;
1544 use the macro MARK_INTERVAL_TREE instead. */
1547 mark_interval_tree (register INTERVAL tree
)
1549 /* No need to test if this tree has been marked already; this
1550 function is always called through the MARK_INTERVAL_TREE macro,
1551 which takes care of that. */
1553 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1557 /* Mark the interval tree rooted in I. */
1559 #define MARK_INTERVAL_TREE(i) \
1561 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1562 mark_interval_tree (i); \
1566 #define UNMARK_BALANCE_INTERVALS(i) \
1568 if (! NULL_INTERVAL_P (i)) \
1569 (i) = balance_intervals (i); \
1572 /***********************************************************************
1574 ***********************************************************************/
1576 /* Lisp_Strings are allocated in string_block structures. When a new
1577 string_block is allocated, all the Lisp_Strings it contains are
1578 added to a free-list string_free_list. When a new Lisp_String is
1579 needed, it is taken from that list. During the sweep phase of GC,
1580 string_blocks that are entirely free are freed, except two which
1583 String data is allocated from sblock structures. Strings larger
1584 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1585 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1587 Sblocks consist internally of sdata structures, one for each
1588 Lisp_String. The sdata structure points to the Lisp_String it
1589 belongs to. The Lisp_String points back to the `u.data' member of
1590 its sdata structure.
1592 When a Lisp_String is freed during GC, it is put back on
1593 string_free_list, and its `data' member and its sdata's `string'
1594 pointer is set to null. The size of the string is recorded in the
1595 `u.nbytes' member of the sdata. So, sdata structures that are no
1596 longer used, can be easily recognized, and it's easy to compact the
1597 sblocks of small strings which we do in compact_small_strings. */
1599 /* Size in bytes of an sblock structure used for small strings. This
1600 is 8192 minus malloc overhead. */
1602 #define SBLOCK_SIZE 8188
1604 /* Strings larger than this are considered large strings. String data
1605 for large strings is allocated from individual sblocks. */
1607 #define LARGE_STRING_BYTES 1024
1609 /* Structure describing string memory sub-allocated from an sblock.
1610 This is where the contents of Lisp strings are stored. */
1614 /* Back-pointer to the string this sdata belongs to. If null, this
1615 structure is free, and the NBYTES member of the union below
1616 contains the string's byte size (the same value that STRING_BYTES
1617 would return if STRING were non-null). If non-null, STRING_BYTES
1618 (STRING) is the size of the data, and DATA contains the string's
1620 struct Lisp_String
*string
;
1622 #ifdef GC_CHECK_STRING_BYTES
1625 unsigned char data
[1];
1627 #define SDATA_NBYTES(S) (S)->nbytes
1628 #define SDATA_DATA(S) (S)->data
1629 #define SDATA_SELECTOR(member) member
1631 #else /* not GC_CHECK_STRING_BYTES */
1635 /* When STRING is non-null. */
1636 unsigned char data
[1];
1638 /* When STRING is null. */
1642 #define SDATA_NBYTES(S) (S)->u.nbytes
1643 #define SDATA_DATA(S) (S)->u.data
1644 #define SDATA_SELECTOR(member) u.member
1646 #endif /* not GC_CHECK_STRING_BYTES */
1648 #define SDATA_DATA_OFFSET offsetof (struct sdata, SDATA_SELECTOR (data))
1652 /* Structure describing a block of memory which is sub-allocated to
1653 obtain string data memory for strings. Blocks for small strings
1654 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1655 as large as needed. */
1660 struct sblock
*next
;
1662 /* Pointer to the next free sdata block. This points past the end
1663 of the sblock if there isn't any space left in this block. */
1664 struct sdata
*next_free
;
1666 /* Start of data. */
1667 struct sdata first_data
;
1670 /* Number of Lisp strings in a string_block structure. The 1020 is
1671 1024 minus malloc overhead. */
1673 #define STRING_BLOCK_SIZE \
1674 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1676 /* Structure describing a block from which Lisp_String structures
1681 /* Place `strings' first, to preserve alignment. */
1682 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1683 struct string_block
*next
;
1686 /* Head and tail of the list of sblock structures holding Lisp string
1687 data. We always allocate from current_sblock. The NEXT pointers
1688 in the sblock structures go from oldest_sblock to current_sblock. */
1690 static struct sblock
*oldest_sblock
, *current_sblock
;
1692 /* List of sblocks for large strings. */
1694 static struct sblock
*large_sblocks
;
1696 /* List of string_block structures. */
1698 static struct string_block
*string_blocks
;
1700 /* Free-list of Lisp_Strings. */
1702 static struct Lisp_String
*string_free_list
;
1704 /* Number of live and free Lisp_Strings. */
1706 static EMACS_INT total_strings
, total_free_strings
;
1708 /* Number of bytes used by live strings. */
1710 static EMACS_INT total_string_size
;
1712 /* Given a pointer to a Lisp_String S which is on the free-list
1713 string_free_list, return a pointer to its successor in the
1716 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1718 /* Return a pointer to the sdata structure belonging to Lisp string S.
1719 S must be live, i.e. S->data must not be null. S->data is actually
1720 a pointer to the `u.data' member of its sdata structure; the
1721 structure starts at a constant offset in front of that. */
1723 #define SDATA_OF_STRING(S) ((struct sdata *) ((S)->data - SDATA_DATA_OFFSET))
1726 #ifdef GC_CHECK_STRING_OVERRUN
1728 /* We check for overrun in string data blocks by appending a small
1729 "cookie" after each allocated string data block, and check for the
1730 presence of this cookie during GC. */
1732 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1733 static char const string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1734 { '\xde', '\xad', '\xbe', '\xef' };
1737 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1740 /* Value is the size of an sdata structure large enough to hold NBYTES
1741 bytes of string data. The value returned includes a terminating
1742 NUL byte, the size of the sdata structure, and padding. */
1744 #ifdef GC_CHECK_STRING_BYTES
1746 #define SDATA_SIZE(NBYTES) \
1747 ((SDATA_DATA_OFFSET \
1749 + sizeof (ptrdiff_t) - 1) \
1750 & ~(sizeof (ptrdiff_t) - 1))
1752 #else /* not GC_CHECK_STRING_BYTES */
1754 /* The 'max' reserves space for the nbytes union member even when NBYTES + 1 is
1755 less than the size of that member. The 'max' is not needed when
1756 SDATA_DATA_OFFSET is a multiple of sizeof (ptrdiff_t), because then the
1757 alignment code reserves enough space. */
1759 #define SDATA_SIZE(NBYTES) \
1760 ((SDATA_DATA_OFFSET \
1761 + (SDATA_DATA_OFFSET % sizeof (ptrdiff_t) == 0 \
1763 : max (NBYTES, sizeof (ptrdiff_t) - 1)) \
1765 + sizeof (ptrdiff_t) - 1) \
1766 & ~(sizeof (ptrdiff_t) - 1))
1768 #endif /* not GC_CHECK_STRING_BYTES */
1770 /* Extra bytes to allocate for each string. */
1772 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1774 /* Exact bound on the number of bytes in a string, not counting the
1775 terminating null. A string cannot contain more bytes than
1776 STRING_BYTES_BOUND, nor can it be so long that the size_t
1777 arithmetic in allocate_string_data would overflow while it is
1778 calculating a value to be passed to malloc. */
1779 #define STRING_BYTES_MAX \
1780 min (STRING_BYTES_BOUND, \
1781 ((SIZE_MAX - XMALLOC_OVERRUN_CHECK_OVERHEAD \
1783 - offsetof (struct sblock, first_data) \
1784 - SDATA_DATA_OFFSET) \
1785 & ~(sizeof (EMACS_INT) - 1)))
1787 /* Initialize string allocation. Called from init_alloc_once. */
1792 total_strings
= total_free_strings
= total_string_size
= 0;
1793 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1794 string_blocks
= NULL
;
1795 string_free_list
= NULL
;
1796 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1797 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1801 #ifdef GC_CHECK_STRING_BYTES
1803 static int check_string_bytes_count
;
1805 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1808 /* Like GC_STRING_BYTES, but with debugging check. */
1811 string_bytes (struct Lisp_String
*s
)
1814 (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1816 if (!PURE_POINTER_P (s
)
1818 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1823 /* Check validity of Lisp strings' string_bytes member in B. */
1826 check_sblock (struct sblock
*b
)
1828 struct sdata
*from
, *end
, *from_end
;
1832 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1834 /* Compute the next FROM here because copying below may
1835 overwrite data we need to compute it. */
1838 /* Check that the string size recorded in the string is the
1839 same as the one recorded in the sdata structure. */
1841 CHECK_STRING_BYTES (from
->string
);
1844 nbytes
= GC_STRING_BYTES (from
->string
);
1846 nbytes
= SDATA_NBYTES (from
);
1848 nbytes
= SDATA_SIZE (nbytes
);
1849 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1854 /* Check validity of Lisp strings' string_bytes member. ALL_P
1855 non-zero means check all strings, otherwise check only most
1856 recently allocated strings. Used for hunting a bug. */
1859 check_string_bytes (int all_p
)
1865 for (b
= large_sblocks
; b
; b
= b
->next
)
1867 struct Lisp_String
*s
= b
->first_data
.string
;
1869 CHECK_STRING_BYTES (s
);
1872 for (b
= oldest_sblock
; b
; b
= b
->next
)
1876 check_sblock (current_sblock
);
1879 #endif /* GC_CHECK_STRING_BYTES */
1881 #ifdef GC_CHECK_STRING_FREE_LIST
1883 /* Walk through the string free list looking for bogus next pointers.
1884 This may catch buffer overrun from a previous string. */
1887 check_string_free_list (void)
1889 struct Lisp_String
*s
;
1891 /* Pop a Lisp_String off the free-list. */
1892 s
= string_free_list
;
1895 if ((uintptr_t) s
< 1024)
1897 s
= NEXT_FREE_LISP_STRING (s
);
1901 #define check_string_free_list()
1904 /* Return a new Lisp_String. */
1906 static struct Lisp_String
*
1907 allocate_string (void)
1909 struct Lisp_String
*s
;
1911 /* eassert (!handling_signal); */
1915 /* If the free-list is empty, allocate a new string_block, and
1916 add all the Lisp_Strings in it to the free-list. */
1917 if (string_free_list
== NULL
)
1919 struct string_block
*b
;
1922 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1923 b
->next
= string_blocks
;
1926 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1929 /* Every string on a free list should have NULL data pointer. */
1931 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1932 string_free_list
= s
;
1935 total_free_strings
+= STRING_BLOCK_SIZE
;
1938 check_string_free_list ();
1940 /* Pop a Lisp_String off the free-list. */
1941 s
= string_free_list
;
1942 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1944 MALLOC_UNBLOCK_INPUT
;
1946 --total_free_strings
;
1949 consing_since_gc
+= sizeof *s
;
1951 #ifdef GC_CHECK_STRING_BYTES
1952 if (!noninteractive
)
1954 if (++check_string_bytes_count
== 200)
1956 check_string_bytes_count
= 0;
1957 check_string_bytes (1);
1960 check_string_bytes (0);
1962 #endif /* GC_CHECK_STRING_BYTES */
1968 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1969 plus a NUL byte at the end. Allocate an sdata structure for S, and
1970 set S->data to its `u.data' member. Store a NUL byte at the end of
1971 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1972 S->data if it was initially non-null. */
1975 allocate_string_data (struct Lisp_String
*s
,
1976 EMACS_INT nchars
, EMACS_INT nbytes
)
1982 if (STRING_BYTES_MAX
< nbytes
)
1985 /* Determine the number of bytes needed to store NBYTES bytes
1987 needed
= SDATA_SIZE (nbytes
);
1991 if (nbytes
> LARGE_STRING_BYTES
)
1993 size_t size
= offsetof (struct sblock
, first_data
) + needed
;
1995 #ifdef DOUG_LEA_MALLOC
1996 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1997 because mapped region contents are not preserved in
2000 In case you think of allowing it in a dumped Emacs at the
2001 cost of not being able to re-dump, there's another reason:
2002 mmap'ed data typically have an address towards the top of the
2003 address space, which won't fit into an EMACS_INT (at least on
2004 32-bit systems with the current tagging scheme). --fx */
2005 mallopt (M_MMAP_MAX
, 0);
2008 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
2010 #ifdef DOUG_LEA_MALLOC
2011 /* Back to a reasonable maximum of mmap'ed areas. */
2012 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2015 b
->next_free
= &b
->first_data
;
2016 b
->first_data
.string
= NULL
;
2017 b
->next
= large_sblocks
;
2020 else if (current_sblock
== NULL
2021 || (((char *) current_sblock
+ SBLOCK_SIZE
2022 - (char *) current_sblock
->next_free
)
2023 < (needed
+ GC_STRING_EXTRA
)))
2025 /* Not enough room in the current sblock. */
2026 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
2027 b
->next_free
= &b
->first_data
;
2028 b
->first_data
.string
= NULL
;
2032 current_sblock
->next
= b
;
2040 data
= b
->next_free
;
2041 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
2043 MALLOC_UNBLOCK_INPUT
;
2046 s
->data
= SDATA_DATA (data
);
2047 #ifdef GC_CHECK_STRING_BYTES
2048 SDATA_NBYTES (data
) = nbytes
;
2051 s
->size_byte
= nbytes
;
2052 s
->data
[nbytes
] = '\0';
2053 #ifdef GC_CHECK_STRING_OVERRUN
2054 memcpy ((char *) data
+ needed
, string_overrun_cookie
,
2055 GC_STRING_OVERRUN_COOKIE_SIZE
);
2057 consing_since_gc
+= needed
;
2061 /* Sweep and compact strings. */
2064 sweep_strings (void)
2066 struct string_block
*b
, *next
;
2067 struct string_block
*live_blocks
= NULL
;
2069 string_free_list
= NULL
;
2070 total_strings
= total_free_strings
= 0;
2071 total_string_size
= 0;
2073 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2074 for (b
= string_blocks
; b
; b
= next
)
2077 struct Lisp_String
*free_list_before
= string_free_list
;
2081 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2083 struct Lisp_String
*s
= b
->strings
+ i
;
2087 /* String was not on free-list before. */
2088 if (STRING_MARKED_P (s
))
2090 /* String is live; unmark it and its intervals. */
2093 if (!NULL_INTERVAL_P (s
->intervals
))
2094 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2097 total_string_size
+= STRING_BYTES (s
);
2101 /* String is dead. Put it on the free-list. */
2102 struct sdata
*data
= SDATA_OF_STRING (s
);
2104 /* Save the size of S in its sdata so that we know
2105 how large that is. Reset the sdata's string
2106 back-pointer so that we know it's free. */
2107 #ifdef GC_CHECK_STRING_BYTES
2108 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2111 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2113 data
->string
= NULL
;
2115 /* Reset the strings's `data' member so that we
2119 /* Put the string on the free-list. */
2120 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2121 string_free_list
= s
;
2127 /* S was on the free-list before. Put it there again. */
2128 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2129 string_free_list
= s
;
2134 /* Free blocks that contain free Lisp_Strings only, except
2135 the first two of them. */
2136 if (nfree
== STRING_BLOCK_SIZE
2137 && total_free_strings
> STRING_BLOCK_SIZE
)
2140 string_free_list
= free_list_before
;
2144 total_free_strings
+= nfree
;
2145 b
->next
= live_blocks
;
2150 check_string_free_list ();
2152 string_blocks
= live_blocks
;
2153 free_large_strings ();
2154 compact_small_strings ();
2156 check_string_free_list ();
2160 /* Free dead large strings. */
2163 free_large_strings (void)
2165 struct sblock
*b
, *next
;
2166 struct sblock
*live_blocks
= NULL
;
2168 for (b
= large_sblocks
; b
; b
= next
)
2172 if (b
->first_data
.string
== NULL
)
2176 b
->next
= live_blocks
;
2181 large_sblocks
= live_blocks
;
2185 /* Compact data of small strings. Free sblocks that don't contain
2186 data of live strings after compaction. */
2189 compact_small_strings (void)
2191 struct sblock
*b
, *tb
, *next
;
2192 struct sdata
*from
, *to
, *end
, *tb_end
;
2193 struct sdata
*to_end
, *from_end
;
2195 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2196 to, and TB_END is the end of TB. */
2198 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2199 to
= &tb
->first_data
;
2201 /* Step through the blocks from the oldest to the youngest. We
2202 expect that old blocks will stabilize over time, so that less
2203 copying will happen this way. */
2204 for (b
= oldest_sblock
; b
; b
= b
->next
)
2207 eassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2209 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2211 /* Compute the next FROM here because copying below may
2212 overwrite data we need to compute it. */
2215 #ifdef GC_CHECK_STRING_BYTES
2216 /* Check that the string size recorded in the string is the
2217 same as the one recorded in the sdata structure. */
2219 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2221 #endif /* GC_CHECK_STRING_BYTES */
2224 nbytes
= GC_STRING_BYTES (from
->string
);
2226 nbytes
= SDATA_NBYTES (from
);
2228 if (nbytes
> LARGE_STRING_BYTES
)
2231 nbytes
= SDATA_SIZE (nbytes
);
2232 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2234 #ifdef GC_CHECK_STRING_OVERRUN
2235 if (memcmp (string_overrun_cookie
,
2236 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
2237 GC_STRING_OVERRUN_COOKIE_SIZE
))
2241 /* FROM->string non-null means it's alive. Copy its data. */
2244 /* If TB is full, proceed with the next sblock. */
2245 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2246 if (to_end
> tb_end
)
2250 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2251 to
= &tb
->first_data
;
2252 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2255 /* Copy, and update the string's `data' pointer. */
2258 eassert (tb
!= b
|| to
< from
);
2259 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
2260 to
->string
->data
= SDATA_DATA (to
);
2263 /* Advance past the sdata we copied to. */
2269 /* The rest of the sblocks following TB don't contain live data, so
2270 we can free them. */
2271 for (b
= tb
->next
; b
; b
= next
)
2279 current_sblock
= tb
;
2283 string_overflow (void)
2285 error ("Maximum string size exceeded");
2288 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2289 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2290 LENGTH must be an integer.
2291 INIT must be an integer that represents a character. */)
2292 (Lisp_Object length
, Lisp_Object init
)
2294 register Lisp_Object val
;
2295 register unsigned char *p
, *end
;
2299 CHECK_NATNUM (length
);
2300 CHECK_CHARACTER (init
);
2302 c
= XFASTINT (init
);
2303 if (ASCII_CHAR_P (c
))
2305 nbytes
= XINT (length
);
2306 val
= make_uninit_string (nbytes
);
2308 end
= p
+ SCHARS (val
);
2314 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2315 int len
= CHAR_STRING (c
, str
);
2316 EMACS_INT string_len
= XINT (length
);
2318 if (string_len
> STRING_BYTES_MAX
/ len
)
2320 nbytes
= len
* string_len
;
2321 val
= make_uninit_multibyte_string (string_len
, nbytes
);
2326 memcpy (p
, str
, len
);
2336 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2337 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2338 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2339 (Lisp_Object length
, Lisp_Object init
)
2341 register Lisp_Object val
;
2342 struct Lisp_Bool_Vector
*p
;
2343 ptrdiff_t length_in_chars
;
2344 EMACS_INT length_in_elts
;
2347 CHECK_NATNUM (length
);
2349 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2351 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2353 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2354 slot `size' of the struct Lisp_Bool_Vector. */
2355 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2357 /* No Lisp_Object to trace in there. */
2358 XSETPVECTYPESIZE (XVECTOR (val
), PVEC_BOOL_VECTOR
, 0);
2360 p
= XBOOL_VECTOR (val
);
2361 p
->size
= XFASTINT (length
);
2363 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2364 / BOOL_VECTOR_BITS_PER_CHAR
);
2365 if (length_in_chars
)
2367 memset (p
->data
, ! NILP (init
) ? -1 : 0, length_in_chars
);
2369 /* Clear any extraneous bits in the last byte. */
2370 p
->data
[length_in_chars
- 1]
2371 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2378 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2379 of characters from the contents. This string may be unibyte or
2380 multibyte, depending on the contents. */
2383 make_string (const char *contents
, ptrdiff_t nbytes
)
2385 register Lisp_Object val
;
2386 ptrdiff_t nchars
, multibyte_nbytes
;
2388 parse_str_as_multibyte ((const unsigned char *) contents
, nbytes
,
2389 &nchars
, &multibyte_nbytes
);
2390 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2391 /* CONTENTS contains no multibyte sequences or contains an invalid
2392 multibyte sequence. We must make unibyte string. */
2393 val
= make_unibyte_string (contents
, nbytes
);
2395 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2400 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2403 make_unibyte_string (const char *contents
, ptrdiff_t length
)
2405 register Lisp_Object val
;
2406 val
= make_uninit_string (length
);
2407 memcpy (SDATA (val
), contents
, length
);
2412 /* Make a multibyte string from NCHARS characters occupying NBYTES
2413 bytes at CONTENTS. */
2416 make_multibyte_string (const char *contents
,
2417 ptrdiff_t nchars
, ptrdiff_t nbytes
)
2419 register Lisp_Object val
;
2420 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2421 memcpy (SDATA (val
), contents
, nbytes
);
2426 /* Make a string from NCHARS characters occupying NBYTES bytes at
2427 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2430 make_string_from_bytes (const char *contents
,
2431 ptrdiff_t nchars
, ptrdiff_t nbytes
)
2433 register Lisp_Object val
;
2434 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2435 memcpy (SDATA (val
), contents
, nbytes
);
2436 if (SBYTES (val
) == SCHARS (val
))
2437 STRING_SET_UNIBYTE (val
);
2442 /* Make a string from NCHARS characters occupying NBYTES bytes at
2443 CONTENTS. The argument MULTIBYTE controls whether to label the
2444 string as multibyte. If NCHARS is negative, it counts the number of
2445 characters by itself. */
2448 make_specified_string (const char *contents
,
2449 ptrdiff_t nchars
, ptrdiff_t nbytes
, int multibyte
)
2451 register Lisp_Object val
;
2456 nchars
= multibyte_chars_in_text ((const unsigned char *) contents
,
2461 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2462 memcpy (SDATA (val
), contents
, nbytes
);
2464 STRING_SET_UNIBYTE (val
);
2469 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2470 occupying LENGTH bytes. */
2473 make_uninit_string (EMACS_INT length
)
2478 return empty_unibyte_string
;
2479 val
= make_uninit_multibyte_string (length
, length
);
2480 STRING_SET_UNIBYTE (val
);
2485 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2486 which occupy NBYTES bytes. */
2489 make_uninit_multibyte_string (EMACS_INT nchars
, EMACS_INT nbytes
)
2492 struct Lisp_String
*s
;
2497 return empty_multibyte_string
;
2499 s
= allocate_string ();
2500 s
->intervals
= NULL_INTERVAL
;
2501 allocate_string_data (s
, nchars
, nbytes
);
2502 XSETSTRING (string
, s
);
2503 string_chars_consed
+= nbytes
;
2509 /***********************************************************************
2511 ***********************************************************************/
2513 /* We store float cells inside of float_blocks, allocating a new
2514 float_block with malloc whenever necessary. Float cells reclaimed
2515 by GC are put on a free list to be reallocated before allocating
2516 any new float cells from the latest float_block. */
2518 #define FLOAT_BLOCK_SIZE \
2519 (((BLOCK_BYTES - sizeof (struct float_block *) \
2520 /* The compiler might add padding at the end. */ \
2521 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2522 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2524 #define GETMARKBIT(block,n) \
2525 (((block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2526 >> ((n) % (sizeof (int) * CHAR_BIT))) \
2529 #define SETMARKBIT(block,n) \
2530 (block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2531 |= 1 << ((n) % (sizeof (int) * CHAR_BIT))
2533 #define UNSETMARKBIT(block,n) \
2534 (block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2535 &= ~(1 << ((n) % (sizeof (int) * CHAR_BIT)))
2537 #define FLOAT_BLOCK(fptr) \
2538 ((struct float_block *) (((uintptr_t) (fptr)) & ~(BLOCK_ALIGN - 1)))
2540 #define FLOAT_INDEX(fptr) \
2541 ((((uintptr_t) (fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2545 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2546 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2547 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof (int) * CHAR_BIT
)];
2548 struct float_block
*next
;
2551 #define FLOAT_MARKED_P(fptr) \
2552 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2554 #define FLOAT_MARK(fptr) \
2555 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2557 #define FLOAT_UNMARK(fptr) \
2558 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2560 /* Current float_block. */
2562 static struct float_block
*float_block
;
2564 /* Index of first unused Lisp_Float in the current float_block. */
2566 static int float_block_index
;
2568 /* Free-list of Lisp_Floats. */
2570 static struct Lisp_Float
*float_free_list
;
2573 /* Initialize float allocation. */
2579 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2580 float_free_list
= 0;
2584 /* Return a new float object with value FLOAT_VALUE. */
2587 make_float (double float_value
)
2589 register Lisp_Object val
;
2591 /* eassert (!handling_signal); */
2595 if (float_free_list
)
2597 /* We use the data field for chaining the free list
2598 so that we won't use the same field that has the mark bit. */
2599 XSETFLOAT (val
, float_free_list
);
2600 float_free_list
= float_free_list
->u
.chain
;
2604 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2606 register struct float_block
*new;
2608 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2610 new->next
= float_block
;
2611 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2613 float_block_index
= 0;
2615 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2616 float_block_index
++;
2619 MALLOC_UNBLOCK_INPUT
;
2621 XFLOAT_INIT (val
, float_value
);
2622 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2623 consing_since_gc
+= sizeof (struct Lisp_Float
);
2630 /***********************************************************************
2632 ***********************************************************************/
2634 /* We store cons cells inside of cons_blocks, allocating a new
2635 cons_block with malloc whenever necessary. Cons cells reclaimed by
2636 GC are put on a free list to be reallocated before allocating
2637 any new cons cells from the latest cons_block. */
2639 #define CONS_BLOCK_SIZE \
2640 (((BLOCK_BYTES - sizeof (struct cons_block *) \
2641 /* The compiler might add padding at the end. */ \
2642 - (sizeof (struct Lisp_Cons) - sizeof (int))) * CHAR_BIT) \
2643 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2645 #define CONS_BLOCK(fptr) \
2646 ((struct cons_block *) ((uintptr_t) (fptr) & ~(BLOCK_ALIGN - 1)))
2648 #define CONS_INDEX(fptr) \
2649 (((uintptr_t) (fptr) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2653 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2654 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2655 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof (int) * CHAR_BIT
)];
2656 struct cons_block
*next
;
2659 #define CONS_MARKED_P(fptr) \
2660 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2662 #define CONS_MARK(fptr) \
2663 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2665 #define CONS_UNMARK(fptr) \
2666 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2668 /* Current cons_block. */
2670 static struct cons_block
*cons_block
;
2672 /* Index of first unused Lisp_Cons in the current block. */
2674 static int cons_block_index
;
2676 /* Free-list of Lisp_Cons structures. */
2678 static struct Lisp_Cons
*cons_free_list
;
2681 /* Initialize cons allocation. */
2687 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2692 /* Explicitly free a cons cell by putting it on the free-list. */
2695 free_cons (struct Lisp_Cons
*ptr
)
2697 ptr
->u
.chain
= cons_free_list
;
2701 cons_free_list
= ptr
;
2704 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2705 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2706 (Lisp_Object car
, Lisp_Object cdr
)
2708 register Lisp_Object val
;
2710 /* eassert (!handling_signal); */
2716 /* We use the cdr for chaining the free list
2717 so that we won't use the same field that has the mark bit. */
2718 XSETCONS (val
, cons_free_list
);
2719 cons_free_list
= cons_free_list
->u
.chain
;
2723 if (cons_block_index
== CONS_BLOCK_SIZE
)
2725 register struct cons_block
*new;
2726 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2728 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2729 new->next
= cons_block
;
2731 cons_block_index
= 0;
2733 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2737 MALLOC_UNBLOCK_INPUT
;
2741 eassert (!CONS_MARKED_P (XCONS (val
)));
2742 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2743 cons_cells_consed
++;
2747 #ifdef GC_CHECK_CONS_LIST
2748 /* Get an error now if there's any junk in the cons free list. */
2750 check_cons_list (void)
2752 struct Lisp_Cons
*tail
= cons_free_list
;
2755 tail
= tail
->u
.chain
;
2759 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2762 list1 (Lisp_Object arg1
)
2764 return Fcons (arg1
, Qnil
);
2768 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2770 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2775 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2777 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2782 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2784 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2789 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2791 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2792 Fcons (arg5
, Qnil
)))));
2796 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2797 doc
: /* Return a newly created list with specified arguments as elements.
2798 Any number of arguments, even zero arguments, are allowed.
2799 usage: (list &rest OBJECTS) */)
2800 (ptrdiff_t nargs
, Lisp_Object
*args
)
2802 register Lisp_Object val
;
2808 val
= Fcons (args
[nargs
], val
);
2814 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2815 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2816 (register Lisp_Object length
, Lisp_Object init
)
2818 register Lisp_Object val
;
2819 register EMACS_INT size
;
2821 CHECK_NATNUM (length
);
2822 size
= XFASTINT (length
);
2827 val
= Fcons (init
, val
);
2832 val
= Fcons (init
, val
);
2837 val
= Fcons (init
, val
);
2842 val
= Fcons (init
, val
);
2847 val
= Fcons (init
, val
);
2862 /***********************************************************************
2864 ***********************************************************************/
2866 /* This value is balanced well enough to avoid too much internal overhead
2867 for the most common cases; it's not required to be a power of two, but
2868 it's expected to be a mult-of-ROUNDUP_SIZE (see below). */
2870 #define VECTOR_BLOCK_SIZE 4096
2872 /* Handy constants for vectorlike objects. */
2875 header_size
= offsetof (struct Lisp_Vector
, contents
),
2876 word_size
= sizeof (Lisp_Object
),
2877 roundup_size
= COMMON_MULTIPLE (sizeof (Lisp_Object
),
2878 USE_LSB_TAG
? 1 << GCTYPEBITS
: 1)
2881 /* ROUNDUP_SIZE must be a power of 2. */
2882 verify ((roundup_size
& (roundup_size
- 1)) == 0);
2884 /* Round up X to nearest mult-of-ROUNDUP_SIZE. */
2886 #define vroundup(x) (((x) + (roundup_size - 1)) & ~(roundup_size - 1))
2888 /* Rounding helps to maintain alignment constraints if USE_LSB_TAG. */
2890 #define VECTOR_BLOCK_BYTES (VECTOR_BLOCK_SIZE - vroundup (sizeof (void *)))
2892 /* Size of the minimal vector allocated from block. */
2894 #define VBLOCK_BYTES_MIN vroundup (sizeof (struct Lisp_Vector))
2896 /* Size of the largest vector allocated from block. */
2898 #define VBLOCK_BYTES_MAX \
2899 vroundup ((VECTOR_BLOCK_BYTES / 2) - sizeof (Lisp_Object))
2901 /* We maintain one free list for each possible block-allocated
2902 vector size, and this is the number of free lists we have. */
2904 #define VECTOR_MAX_FREE_LIST_INDEX \
2905 ((VECTOR_BLOCK_BYTES - VBLOCK_BYTES_MIN) / roundup_size + 1)
2907 /* When the vector is on a free list, vectorlike_header.SIZE is set to
2908 this special value ORed with vector's memory footprint size. */
2910 #define VECTOR_FREE_LIST_FLAG (~(ARRAY_MARK_FLAG | PSEUDOVECTOR_FLAG \
2911 | (VECTOR_BLOCK_SIZE - 1)))
2913 /* Common shortcut to advance vector pointer over a block data. */
2915 #define ADVANCE(v, nbytes) ((struct Lisp_Vector *) ((char *) (v) + (nbytes)))
2917 /* Common shortcut to calculate NBYTES-vector index in VECTOR_FREE_LISTS. */
2919 #define VINDEX(nbytes) (((nbytes) - VBLOCK_BYTES_MIN) / roundup_size)
2921 /* Common shortcut to setup vector on a free list. */
2923 #define SETUP_ON_FREE_LIST(v, nbytes, index) \
2925 (v)->header.size = VECTOR_FREE_LIST_FLAG | (nbytes); \
2926 eassert ((nbytes) % roundup_size == 0); \
2927 (index) = VINDEX (nbytes); \
2928 eassert ((index) < VECTOR_MAX_FREE_LIST_INDEX); \
2929 (v)->header.next.vector = vector_free_lists[index]; \
2930 vector_free_lists[index] = (v); \
2935 char data
[VECTOR_BLOCK_BYTES
];
2936 struct vector_block
*next
;
2939 /* Chain of vector blocks. */
2941 static struct vector_block
*vector_blocks
;
2943 /* Vector free lists, where NTH item points to a chain of free
2944 vectors of the same NBYTES size, so NTH == VINDEX (NBYTES). */
2946 static struct Lisp_Vector
*vector_free_lists
[VECTOR_MAX_FREE_LIST_INDEX
];
2948 /* Singly-linked list of large vectors. */
2950 static struct Lisp_Vector
*large_vectors
;
2952 /* The only vector with 0 slots, allocated from pure space. */
2954 static struct Lisp_Vector
*zero_vector
;
2956 /* Get a new vector block. */
2958 static struct vector_block
*
2959 allocate_vector_block (void)
2961 struct vector_block
*block
;
2963 #ifdef DOUG_LEA_MALLOC
2964 mallopt (M_MMAP_MAX
, 0);
2967 block
= xmalloc (sizeof (struct vector_block
));
2969 #ifdef DOUG_LEA_MALLOC
2970 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2973 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
2974 mem_insert (block
->data
, block
->data
+ VECTOR_BLOCK_BYTES
,
2975 MEM_TYPE_VECTOR_BLOCK
);
2978 block
->next
= vector_blocks
;
2979 vector_blocks
= block
;
2983 /* Called once to initialize vector allocation. */
2988 zero_vector
= pure_alloc (header_size
, Lisp_Vectorlike
);
2989 zero_vector
->header
.size
= 0;
2992 /* Allocate vector from a vector block. */
2994 static struct Lisp_Vector
*
2995 allocate_vector_from_block (size_t nbytes
)
2997 struct Lisp_Vector
*vector
, *rest
;
2998 struct vector_block
*block
;
2999 size_t index
, restbytes
;
3001 eassert (VBLOCK_BYTES_MIN
<= nbytes
&& nbytes
<= VBLOCK_BYTES_MAX
);
3002 eassert (nbytes
% roundup_size
== 0);
3004 /* First, try to allocate from a free list
3005 containing vectors of the requested size. */
3006 index
= VINDEX (nbytes
);
3007 if (vector_free_lists
[index
])
3009 vector
= vector_free_lists
[index
];
3010 vector_free_lists
[index
] = vector
->header
.next
.vector
;
3011 vector
->header
.next
.nbytes
= nbytes
;
3015 /* Next, check free lists containing larger vectors. Since
3016 we will split the result, we should have remaining space
3017 large enough to use for one-slot vector at least. */
3018 for (index
= VINDEX (nbytes
+ VBLOCK_BYTES_MIN
);
3019 index
< VECTOR_MAX_FREE_LIST_INDEX
; index
++)
3020 if (vector_free_lists
[index
])
3022 /* This vector is larger than requested. */
3023 vector
= vector_free_lists
[index
];
3024 vector_free_lists
[index
] = vector
->header
.next
.vector
;
3025 vector
->header
.next
.nbytes
= nbytes
;
3027 /* Excess bytes are used for the smaller vector,
3028 which should be set on an appropriate free list. */
3029 restbytes
= index
* roundup_size
+ VBLOCK_BYTES_MIN
- nbytes
;
3030 eassert (restbytes
% roundup_size
== 0);
3031 rest
= ADVANCE (vector
, nbytes
);
3032 SETUP_ON_FREE_LIST (rest
, restbytes
, index
);
3036 /* Finally, need a new vector block. */
3037 block
= allocate_vector_block ();
3039 /* New vector will be at the beginning of this block. */
3040 vector
= (struct Lisp_Vector
*) block
->data
;
3041 vector
->header
.next
.nbytes
= nbytes
;
3043 /* If the rest of space from this block is large enough
3044 for one-slot vector at least, set up it on a free list. */
3045 restbytes
= VECTOR_BLOCK_BYTES
- nbytes
;
3046 if (restbytes
>= VBLOCK_BYTES_MIN
)
3048 eassert (restbytes
% roundup_size
== 0);
3049 rest
= ADVANCE (vector
, nbytes
);
3050 SETUP_ON_FREE_LIST (rest
, restbytes
, index
);
3055 /* Return how many Lisp_Objects can be stored in V. */
3057 #define VECTOR_SIZE(v) ((v)->header.size & PSEUDOVECTOR_FLAG ? \
3058 (PSEUDOVECTOR_SIZE_MASK & (v)->header.size) : \
3061 /* Nonzero if VECTOR pointer is valid pointer inside BLOCK. */
3063 #define VECTOR_IN_BLOCK(vector, block) \
3064 ((char *) (vector) <= (block)->data \
3065 + VECTOR_BLOCK_BYTES - VBLOCK_BYTES_MIN)
3067 /* Reclaim space used by unmarked vectors. */
3070 sweep_vectors (void)
3072 struct vector_block
*block
= vector_blocks
, **bprev
= &vector_blocks
;
3073 struct Lisp_Vector
*vector
, *next
, **vprev
= &large_vectors
;
3075 total_vector_size
= 0;
3076 memset (vector_free_lists
, 0, sizeof (vector_free_lists
));
3078 /* Looking through vector blocks. */
3080 for (block
= vector_blocks
; block
; block
= *bprev
)
3082 int free_this_block
= 0;
3084 for (vector
= (struct Lisp_Vector
*) block
->data
;
3085 VECTOR_IN_BLOCK (vector
, block
); vector
= next
)
3087 if (VECTOR_MARKED_P (vector
))
3089 VECTOR_UNMARK (vector
);
3090 total_vector_size
+= VECTOR_SIZE (vector
);
3091 next
= ADVANCE (vector
, vector
->header
.next
.nbytes
);
3097 if ((vector
->header
.size
& VECTOR_FREE_LIST_FLAG
)
3098 == VECTOR_FREE_LIST_FLAG
)
3099 vector
->header
.next
.nbytes
=
3100 vector
->header
.size
& (VECTOR_BLOCK_SIZE
- 1);
3102 next
= ADVANCE (vector
, vector
->header
.next
.nbytes
);
3104 /* While NEXT is not marked, try to coalesce with VECTOR,
3105 thus making VECTOR of the largest possible size. */
3107 while (VECTOR_IN_BLOCK (next
, block
))
3109 if (VECTOR_MARKED_P (next
))
3111 if ((next
->header
.size
& VECTOR_FREE_LIST_FLAG
)
3112 == VECTOR_FREE_LIST_FLAG
)
3113 nbytes
= next
->header
.size
& (VECTOR_BLOCK_SIZE
- 1);
3115 nbytes
= next
->header
.next
.nbytes
;
3116 vector
->header
.next
.nbytes
+= nbytes
;
3117 next
= ADVANCE (next
, nbytes
);
3120 eassert (vector
->header
.next
.nbytes
% roundup_size
== 0);
3122 if (vector
== (struct Lisp_Vector
*) block
->data
3123 && !VECTOR_IN_BLOCK (next
, block
))
3124 /* This block should be freed because all of it's
3125 space was coalesced into the only free vector. */
3126 free_this_block
= 1;
3128 SETUP_ON_FREE_LIST (vector
, vector
->header
.next
.nbytes
, nbytes
);
3132 if (free_this_block
)
3134 *bprev
= block
->next
;
3135 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
3136 mem_delete (mem_find (block
->data
));
3141 bprev
= &block
->next
;
3144 /* Sweep large vectors. */
3146 for (vector
= large_vectors
; vector
; vector
= *vprev
)
3148 if (VECTOR_MARKED_P (vector
))
3150 VECTOR_UNMARK (vector
);
3151 total_vector_size
+= VECTOR_SIZE (vector
);
3152 vprev
= &vector
->header
.next
.vector
;
3156 *vprev
= vector
->header
.next
.vector
;
3162 /* Value is a pointer to a newly allocated Lisp_Vector structure
3163 with room for LEN Lisp_Objects. */
3165 static struct Lisp_Vector
*
3166 allocate_vectorlike (ptrdiff_t len
)
3168 struct Lisp_Vector
*p
;
3173 #ifdef DOUG_LEA_MALLOC
3174 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
3175 because mapped region contents are not preserved in
3177 mallopt (M_MMAP_MAX
, 0);
3180 /* This gets triggered by code which I haven't bothered to fix. --Stef */
3181 /* eassert (!handling_signal); */
3185 MALLOC_UNBLOCK_INPUT
;
3189 nbytes
= header_size
+ len
* word_size
;
3191 if (nbytes
<= VBLOCK_BYTES_MAX
)
3192 p
= allocate_vector_from_block (vroundup (nbytes
));
3195 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
3196 p
->header
.next
.vector
= large_vectors
;
3200 #ifdef DOUG_LEA_MALLOC
3201 /* Back to a reasonable maximum of mmap'ed areas. */
3202 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
3205 consing_since_gc
+= nbytes
;
3206 vector_cells_consed
+= len
;
3208 MALLOC_UNBLOCK_INPUT
;
3214 /* Allocate a vector with LEN slots. */
3216 struct Lisp_Vector
*
3217 allocate_vector (EMACS_INT len
)
3219 struct Lisp_Vector
*v
;
3220 ptrdiff_t nbytes_max
= min (PTRDIFF_MAX
, SIZE_MAX
);
3222 if (min ((nbytes_max
- header_size
) / word_size
, MOST_POSITIVE_FIXNUM
) < len
)
3223 memory_full (SIZE_MAX
);
3224 v
= allocate_vectorlike (len
);
3225 v
->header
.size
= len
;
3230 /* Allocate other vector-like structures. */
3232 struct Lisp_Vector
*
3233 allocate_pseudovector (int memlen
, int lisplen
, int tag
)
3235 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
3238 /* Only the first lisplen slots will be traced normally by the GC. */
3239 for (i
= 0; i
< lisplen
; ++i
)
3240 v
->contents
[i
] = Qnil
;
3242 XSETPVECTYPESIZE (v
, tag
, lisplen
);
3247 allocate_buffer (void)
3249 struct buffer
*b
= lisp_malloc (sizeof (struct buffer
), MEM_TYPE_BUFFER
);
3251 XSETPVECTYPESIZE (b
, PVEC_BUFFER
, (offsetof (struct buffer
, own_text
)
3252 - header_size
) / word_size
);
3253 /* Note that the fields of B are not initialized. */
3257 struct Lisp_Hash_Table
*
3258 allocate_hash_table (void)
3260 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
3264 allocate_window (void)
3268 w
= ALLOCATE_PSEUDOVECTOR (struct window
, current_matrix
, PVEC_WINDOW
);
3269 /* Users assumes that non-Lisp data is zeroed. */
3270 memset (&w
->current_matrix
, 0,
3271 sizeof (*w
) - offsetof (struct window
, current_matrix
));
3276 allocate_terminal (void)
3280 t
= ALLOCATE_PSEUDOVECTOR (struct terminal
, next_terminal
, PVEC_TERMINAL
);
3281 /* Users assumes that non-Lisp data is zeroed. */
3282 memset (&t
->next_terminal
, 0,
3283 sizeof (*t
) - offsetof (struct terminal
, next_terminal
));
3288 allocate_frame (void)
3292 f
= ALLOCATE_PSEUDOVECTOR (struct frame
, face_cache
, PVEC_FRAME
);
3293 /* Users assumes that non-Lisp data is zeroed. */
3294 memset (&f
->face_cache
, 0,
3295 sizeof (*f
) - offsetof (struct frame
, face_cache
));
3299 struct Lisp_Process
*
3300 allocate_process (void)
3302 struct Lisp_Process
*p
;
3304 p
= ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
3305 /* Users assumes that non-Lisp data is zeroed. */
3307 sizeof (*p
) - offsetof (struct Lisp_Process
, pid
));
3311 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3312 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3313 See also the function `vector'. */)
3314 (register Lisp_Object length
, Lisp_Object init
)
3317 register ptrdiff_t sizei
;
3318 register ptrdiff_t i
;
3319 register struct Lisp_Vector
*p
;
3321 CHECK_NATNUM (length
);
3323 p
= allocate_vector (XFASTINT (length
));
3324 sizei
= XFASTINT (length
);
3325 for (i
= 0; i
< sizei
; i
++)
3326 p
->contents
[i
] = init
;
3328 XSETVECTOR (vector
, p
);
3333 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3334 doc
: /* Return a newly created vector with specified arguments as elements.
3335 Any number of arguments, even zero arguments, are allowed.
3336 usage: (vector &rest OBJECTS) */)
3337 (ptrdiff_t nargs
, Lisp_Object
*args
)
3339 register Lisp_Object len
, val
;
3341 register struct Lisp_Vector
*p
;
3343 XSETFASTINT (len
, nargs
);
3344 val
= Fmake_vector (len
, Qnil
);
3346 for (i
= 0; i
< nargs
; i
++)
3347 p
->contents
[i
] = args
[i
];
3352 make_byte_code (struct Lisp_Vector
*v
)
3354 if (v
->header
.size
> 1 && STRINGP (v
->contents
[1])
3355 && STRING_MULTIBYTE (v
->contents
[1]))
3356 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3357 earlier because they produced a raw 8-bit string for byte-code
3358 and now such a byte-code string is loaded as multibyte while
3359 raw 8-bit characters converted to multibyte form. Thus, now we
3360 must convert them back to the original unibyte form. */
3361 v
->contents
[1] = Fstring_as_unibyte (v
->contents
[1]);
3362 XSETPVECTYPE (v
, PVEC_COMPILED
);
3365 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3366 doc
: /* Create a byte-code object with specified arguments as elements.
3367 The arguments should be the ARGLIST, bytecode-string BYTE-CODE, constant
3368 vector CONSTANTS, maximum stack size DEPTH, (optional) DOCSTRING,
3369 and (optional) INTERACTIVE-SPEC.
3370 The first four arguments are required; at most six have any
3372 The ARGLIST can be either like the one of `lambda', in which case the arguments
3373 will be dynamically bound before executing the byte code, or it can be an
3374 integer of the form NNNNNNNRMMMMMMM where the 7bit MMMMMMM specifies the
3375 minimum number of arguments, the 7-bit NNNNNNN specifies the maximum number
3376 of arguments (ignoring &rest) and the R bit specifies whether there is a &rest
3377 argument to catch the left-over arguments. If such an integer is used, the
3378 arguments will not be dynamically bound but will be instead pushed on the
3379 stack before executing the byte-code.
3380 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3381 (ptrdiff_t nargs
, Lisp_Object
*args
)
3383 register Lisp_Object len
, val
;
3385 register struct Lisp_Vector
*p
;
3387 /* We used to purecopy everything here, if purify-flga was set. This worked
3388 OK for Emacs-23, but with Emacs-24's lexical binding code, it can be
3389 dangerous, since make-byte-code is used during execution to build
3390 closures, so any closure built during the preload phase would end up
3391 copied into pure space, including its free variables, which is sometimes
3392 just wasteful and other times plainly wrong (e.g. those free vars may want
3395 XSETFASTINT (len
, nargs
);
3396 val
= Fmake_vector (len
, Qnil
);
3399 for (i
= 0; i
< nargs
; i
++)
3400 p
->contents
[i
] = args
[i
];
3402 XSETCOMPILED (val
, p
);
3408 /***********************************************************************
3410 ***********************************************************************/
3412 /* Like struct Lisp_Symbol, but padded so that the size is a multiple
3413 of the required alignment if LSB tags are used. */
3415 union aligned_Lisp_Symbol
3417 struct Lisp_Symbol s
;
3419 unsigned char c
[(sizeof (struct Lisp_Symbol
) + (1 << GCTYPEBITS
) - 1)
3420 & -(1 << GCTYPEBITS
)];
3424 /* Each symbol_block is just under 1020 bytes long, since malloc
3425 really allocates in units of powers of two and uses 4 bytes for its
3428 #define SYMBOL_BLOCK_SIZE \
3429 ((1020 - sizeof (struct symbol_block *)) / sizeof (union aligned_Lisp_Symbol))
3433 /* Place `symbols' first, to preserve alignment. */
3434 union aligned_Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3435 struct symbol_block
*next
;
3438 /* Current symbol block and index of first unused Lisp_Symbol
3441 static struct symbol_block
*symbol_block
;
3442 static int symbol_block_index
;
3444 /* List of free symbols. */
3446 static struct Lisp_Symbol
*symbol_free_list
;
3449 /* Initialize symbol allocation. */
3454 symbol_block
= NULL
;
3455 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3456 symbol_free_list
= 0;
3460 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3461 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3462 Its value and function definition are void, and its property list is nil. */)
3465 register Lisp_Object val
;
3466 register struct Lisp_Symbol
*p
;
3468 CHECK_STRING (name
);
3470 /* eassert (!handling_signal); */
3474 if (symbol_free_list
)
3476 XSETSYMBOL (val
, symbol_free_list
);
3477 symbol_free_list
= symbol_free_list
->next
;
3481 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3483 struct symbol_block
*new;
3484 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3486 new->next
= symbol_block
;
3488 symbol_block_index
= 0;
3490 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
].s
);
3491 symbol_block_index
++;
3494 MALLOC_UNBLOCK_INPUT
;
3499 p
->redirect
= SYMBOL_PLAINVAL
;
3500 SET_SYMBOL_VAL (p
, Qunbound
);
3501 p
->function
= Qunbound
;
3504 p
->interned
= SYMBOL_UNINTERNED
;
3506 p
->declared_special
= 0;
3507 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3514 /***********************************************************************
3515 Marker (Misc) Allocation
3516 ***********************************************************************/
3518 /* Like union Lisp_Misc, but padded so that its size is a multiple of
3519 the required alignment when LSB tags are used. */
3521 union aligned_Lisp_Misc
3525 unsigned char c
[(sizeof (union Lisp_Misc
) + (1 << GCTYPEBITS
) - 1)
3526 & -(1 << GCTYPEBITS
)];
3530 /* Allocation of markers and other objects that share that structure.
3531 Works like allocation of conses. */
3533 #define MARKER_BLOCK_SIZE \
3534 ((1020 - sizeof (struct marker_block *)) / sizeof (union aligned_Lisp_Misc))
3538 /* Place `markers' first, to preserve alignment. */
3539 union aligned_Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3540 struct marker_block
*next
;
3543 static struct marker_block
*marker_block
;
3544 static int marker_block_index
;
3546 static union Lisp_Misc
*marker_free_list
;
3551 marker_block
= NULL
;
3552 marker_block_index
= MARKER_BLOCK_SIZE
;
3553 marker_free_list
= 0;
3556 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3559 allocate_misc (void)
3563 /* eassert (!handling_signal); */
3567 if (marker_free_list
)
3569 XSETMISC (val
, marker_free_list
);
3570 marker_free_list
= marker_free_list
->u_free
.chain
;
3574 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3576 struct marker_block
*new;
3577 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3579 new->next
= marker_block
;
3581 marker_block_index
= 0;
3582 total_free_markers
+= MARKER_BLOCK_SIZE
;
3584 XSETMISC (val
, &marker_block
->markers
[marker_block_index
].m
);
3585 marker_block_index
++;
3588 MALLOC_UNBLOCK_INPUT
;
3590 --total_free_markers
;
3591 consing_since_gc
+= sizeof (union Lisp_Misc
);
3592 misc_objects_consed
++;
3593 XMISCANY (val
)->gcmarkbit
= 0;
3597 /* Free a Lisp_Misc object */
3600 free_misc (Lisp_Object misc
)
3602 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3603 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3604 marker_free_list
= XMISC (misc
);
3606 total_free_markers
++;
3609 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3610 INTEGER. This is used to package C values to call record_unwind_protect.
3611 The unwind function can get the C values back using XSAVE_VALUE. */
3614 make_save_value (void *pointer
, ptrdiff_t integer
)
3616 register Lisp_Object val
;
3617 register struct Lisp_Save_Value
*p
;
3619 val
= allocate_misc ();
3620 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3621 p
= XSAVE_VALUE (val
);
3622 p
->pointer
= pointer
;
3623 p
->integer
= integer
;
3628 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3629 doc
: /* Return a newly allocated marker which does not point at any place. */)
3632 register Lisp_Object val
;
3633 register struct Lisp_Marker
*p
;
3635 val
= allocate_misc ();
3636 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3642 p
->insertion_type
= 0;
3646 /* Put MARKER back on the free list after using it temporarily. */
3649 free_marker (Lisp_Object marker
)
3651 unchain_marker (XMARKER (marker
));
3656 /* Return a newly created vector or string with specified arguments as
3657 elements. If all the arguments are characters that can fit
3658 in a string of events, make a string; otherwise, make a vector.
3660 Any number of arguments, even zero arguments, are allowed. */
3663 make_event_array (register int nargs
, Lisp_Object
*args
)
3667 for (i
= 0; i
< nargs
; i
++)
3668 /* The things that fit in a string
3669 are characters that are in 0...127,
3670 after discarding the meta bit and all the bits above it. */
3671 if (!INTEGERP (args
[i
])
3672 || (XINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3673 return Fvector (nargs
, args
);
3675 /* Since the loop exited, we know that all the things in it are
3676 characters, so we can make a string. */
3680 result
= Fmake_string (make_number (nargs
), make_number (0));
3681 for (i
= 0; i
< nargs
; i
++)
3683 SSET (result
, i
, XINT (args
[i
]));
3684 /* Move the meta bit to the right place for a string char. */
3685 if (XINT (args
[i
]) & CHAR_META
)
3686 SSET (result
, i
, SREF (result
, i
) | 0x80);
3695 /************************************************************************
3696 Memory Full Handling
3697 ************************************************************************/
3700 /* Called if malloc (NBYTES) returns zero. If NBYTES == SIZE_MAX,
3701 there may have been size_t overflow so that malloc was never
3702 called, or perhaps malloc was invoked successfully but the
3703 resulting pointer had problems fitting into a tagged EMACS_INT. In
3704 either case this counts as memory being full even though malloc did
3708 memory_full (size_t nbytes
)
3710 /* Do not go into hysterics merely because a large request failed. */
3711 int enough_free_memory
= 0;
3712 if (SPARE_MEMORY
< nbytes
)
3717 p
= malloc (SPARE_MEMORY
);
3721 enough_free_memory
= 1;
3723 MALLOC_UNBLOCK_INPUT
;
3726 if (! enough_free_memory
)
3732 memory_full_cons_threshold
= sizeof (struct cons_block
);
3734 /* The first time we get here, free the spare memory. */
3735 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3736 if (spare_memory
[i
])
3739 free (spare_memory
[i
]);
3740 else if (i
>= 1 && i
<= 4)
3741 lisp_align_free (spare_memory
[i
]);
3743 lisp_free (spare_memory
[i
]);
3744 spare_memory
[i
] = 0;
3747 /* Record the space now used. When it decreases substantially,
3748 we can refill the memory reserve. */
3749 #if !defined SYSTEM_MALLOC && !defined SYNC_INPUT
3750 bytes_used_when_full
= BYTES_USED
;
3754 /* This used to call error, but if we've run out of memory, we could
3755 get infinite recursion trying to build the string. */
3756 xsignal (Qnil
, Vmemory_signal_data
);
3759 /* If we released our reserve (due to running out of memory),
3760 and we have a fair amount free once again,
3761 try to set aside another reserve in case we run out once more.
3763 This is called when a relocatable block is freed in ralloc.c,
3764 and also directly from this file, in case we're not using ralloc.c. */
3767 refill_memory_reserve (void)
3769 #ifndef SYSTEM_MALLOC
3770 if (spare_memory
[0] == 0)
3771 spare_memory
[0] = (char *) malloc (SPARE_MEMORY
);
3772 if (spare_memory
[1] == 0)
3773 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3775 if (spare_memory
[2] == 0)
3776 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3778 if (spare_memory
[3] == 0)
3779 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3781 if (spare_memory
[4] == 0)
3782 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3784 if (spare_memory
[5] == 0)
3785 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3787 if (spare_memory
[6] == 0)
3788 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3790 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3791 Vmemory_full
= Qnil
;
3795 /************************************************************************
3797 ************************************************************************/
3799 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3801 /* Conservative C stack marking requires a method to identify possibly
3802 live Lisp objects given a pointer value. We do this by keeping
3803 track of blocks of Lisp data that are allocated in a red-black tree
3804 (see also the comment of mem_node which is the type of nodes in
3805 that tree). Function lisp_malloc adds information for an allocated
3806 block to the red-black tree with calls to mem_insert, and function
3807 lisp_free removes it with mem_delete. Functions live_string_p etc
3808 call mem_find to lookup information about a given pointer in the
3809 tree, and use that to determine if the pointer points to a Lisp
3812 /* Initialize this part of alloc.c. */
3817 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3818 mem_z
.parent
= NULL
;
3819 mem_z
.color
= MEM_BLACK
;
3820 mem_z
.start
= mem_z
.end
= NULL
;
3825 /* Value is a pointer to the mem_node containing START. Value is
3826 MEM_NIL if there is no node in the tree containing START. */
3828 static inline struct mem_node
*
3829 mem_find (void *start
)
3833 if (start
< min_heap_address
|| start
> max_heap_address
)
3836 /* Make the search always successful to speed up the loop below. */
3837 mem_z
.start
= start
;
3838 mem_z
.end
= (char *) start
+ 1;
3841 while (start
< p
->start
|| start
>= p
->end
)
3842 p
= start
< p
->start
? p
->left
: p
->right
;
3847 /* Insert a new node into the tree for a block of memory with start
3848 address START, end address END, and type TYPE. Value is a
3849 pointer to the node that was inserted. */
3851 static struct mem_node
*
3852 mem_insert (void *start
, void *end
, enum mem_type type
)
3854 struct mem_node
*c
, *parent
, *x
;
3856 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3857 min_heap_address
= start
;
3858 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3859 max_heap_address
= end
;
3861 /* See where in the tree a node for START belongs. In this
3862 particular application, it shouldn't happen that a node is already
3863 present. For debugging purposes, let's check that. */
3867 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3869 while (c
!= MEM_NIL
)
3871 if (start
>= c
->start
&& start
< c
->end
)
3874 c
= start
< c
->start
? c
->left
: c
->right
;
3877 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3879 while (c
!= MEM_NIL
)
3882 c
= start
< c
->start
? c
->left
: c
->right
;
3885 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3887 /* Create a new node. */
3888 #ifdef GC_MALLOC_CHECK
3889 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3893 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3899 x
->left
= x
->right
= MEM_NIL
;
3902 /* Insert it as child of PARENT or install it as root. */
3905 if (start
< parent
->start
)
3913 /* Re-establish red-black tree properties. */
3914 mem_insert_fixup (x
);
3920 /* Re-establish the red-black properties of the tree, and thereby
3921 balance the tree, after node X has been inserted; X is always red. */
3924 mem_insert_fixup (struct mem_node
*x
)
3926 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3928 /* X is red and its parent is red. This is a violation of
3929 red-black tree property #3. */
3931 if (x
->parent
== x
->parent
->parent
->left
)
3933 /* We're on the left side of our grandparent, and Y is our
3935 struct mem_node
*y
= x
->parent
->parent
->right
;
3937 if (y
->color
== MEM_RED
)
3939 /* Uncle and parent are red but should be black because
3940 X is red. Change the colors accordingly and proceed
3941 with the grandparent. */
3942 x
->parent
->color
= MEM_BLACK
;
3943 y
->color
= MEM_BLACK
;
3944 x
->parent
->parent
->color
= MEM_RED
;
3945 x
= x
->parent
->parent
;
3949 /* Parent and uncle have different colors; parent is
3950 red, uncle is black. */
3951 if (x
== x
->parent
->right
)
3954 mem_rotate_left (x
);
3957 x
->parent
->color
= MEM_BLACK
;
3958 x
->parent
->parent
->color
= MEM_RED
;
3959 mem_rotate_right (x
->parent
->parent
);
3964 /* This is the symmetrical case of above. */
3965 struct mem_node
*y
= x
->parent
->parent
->left
;
3967 if (y
->color
== MEM_RED
)
3969 x
->parent
->color
= MEM_BLACK
;
3970 y
->color
= MEM_BLACK
;
3971 x
->parent
->parent
->color
= MEM_RED
;
3972 x
= x
->parent
->parent
;
3976 if (x
== x
->parent
->left
)
3979 mem_rotate_right (x
);
3982 x
->parent
->color
= MEM_BLACK
;
3983 x
->parent
->parent
->color
= MEM_RED
;
3984 mem_rotate_left (x
->parent
->parent
);
3989 /* The root may have been changed to red due to the algorithm. Set
3990 it to black so that property #5 is satisfied. */
3991 mem_root
->color
= MEM_BLACK
;
4002 mem_rotate_left (struct mem_node
*x
)
4006 /* Turn y's left sub-tree into x's right sub-tree. */
4009 if (y
->left
!= MEM_NIL
)
4010 y
->left
->parent
= x
;
4012 /* Y's parent was x's parent. */
4014 y
->parent
= x
->parent
;
4016 /* Get the parent to point to y instead of x. */
4019 if (x
== x
->parent
->left
)
4020 x
->parent
->left
= y
;
4022 x
->parent
->right
= y
;
4027 /* Put x on y's left. */
4041 mem_rotate_right (struct mem_node
*x
)
4043 struct mem_node
*y
= x
->left
;
4046 if (y
->right
!= MEM_NIL
)
4047 y
->right
->parent
= x
;
4050 y
->parent
= x
->parent
;
4053 if (x
== x
->parent
->right
)
4054 x
->parent
->right
= y
;
4056 x
->parent
->left
= y
;
4067 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
4070 mem_delete (struct mem_node
*z
)
4072 struct mem_node
*x
, *y
;
4074 if (!z
|| z
== MEM_NIL
)
4077 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
4082 while (y
->left
!= MEM_NIL
)
4086 if (y
->left
!= MEM_NIL
)
4091 x
->parent
= y
->parent
;
4094 if (y
== y
->parent
->left
)
4095 y
->parent
->left
= x
;
4097 y
->parent
->right
= x
;
4104 z
->start
= y
->start
;
4109 if (y
->color
== MEM_BLACK
)
4110 mem_delete_fixup (x
);
4112 #ifdef GC_MALLOC_CHECK
4120 /* Re-establish the red-black properties of the tree, after a
4124 mem_delete_fixup (struct mem_node
*x
)
4126 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
4128 if (x
== x
->parent
->left
)
4130 struct mem_node
*w
= x
->parent
->right
;
4132 if (w
->color
== MEM_RED
)
4134 w
->color
= MEM_BLACK
;
4135 x
->parent
->color
= MEM_RED
;
4136 mem_rotate_left (x
->parent
);
4137 w
= x
->parent
->right
;
4140 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
4147 if (w
->right
->color
== MEM_BLACK
)
4149 w
->left
->color
= MEM_BLACK
;
4151 mem_rotate_right (w
);
4152 w
= x
->parent
->right
;
4154 w
->color
= x
->parent
->color
;
4155 x
->parent
->color
= MEM_BLACK
;
4156 w
->right
->color
= MEM_BLACK
;
4157 mem_rotate_left (x
->parent
);
4163 struct mem_node
*w
= x
->parent
->left
;
4165 if (w
->color
== MEM_RED
)
4167 w
->color
= MEM_BLACK
;
4168 x
->parent
->color
= MEM_RED
;
4169 mem_rotate_right (x
->parent
);
4170 w
= x
->parent
->left
;
4173 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
4180 if (w
->left
->color
== MEM_BLACK
)
4182 w
->right
->color
= MEM_BLACK
;
4184 mem_rotate_left (w
);
4185 w
= x
->parent
->left
;
4188 w
->color
= x
->parent
->color
;
4189 x
->parent
->color
= MEM_BLACK
;
4190 w
->left
->color
= MEM_BLACK
;
4191 mem_rotate_right (x
->parent
);
4197 x
->color
= MEM_BLACK
;
4201 /* Value is non-zero if P is a pointer to a live Lisp string on
4202 the heap. M is a pointer to the mem_block for P. */
4205 live_string_p (struct mem_node
*m
, void *p
)
4207 if (m
->type
== MEM_TYPE_STRING
)
4209 struct string_block
*b
= (struct string_block
*) m
->start
;
4210 ptrdiff_t offset
= (char *) p
- (char *) &b
->strings
[0];
4212 /* P must point to the start of a Lisp_String structure, and it
4213 must not be on the free-list. */
4215 && offset
% sizeof b
->strings
[0] == 0
4216 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
4217 && ((struct Lisp_String
*) p
)->data
!= NULL
);
4224 /* Value is non-zero if P is a pointer to a live Lisp cons on
4225 the heap. M is a pointer to the mem_block for P. */
4228 live_cons_p (struct mem_node
*m
, void *p
)
4230 if (m
->type
== MEM_TYPE_CONS
)
4232 struct cons_block
*b
= (struct cons_block
*) m
->start
;
4233 ptrdiff_t offset
= (char *) p
- (char *) &b
->conses
[0];
4235 /* P must point to the start of a Lisp_Cons, not be
4236 one of the unused cells in the current cons block,
4237 and not be on the free-list. */
4239 && offset
% sizeof b
->conses
[0] == 0
4240 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
4242 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
4243 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
4250 /* Value is non-zero if P is a pointer to a live Lisp symbol on
4251 the heap. M is a pointer to the mem_block for P. */
4254 live_symbol_p (struct mem_node
*m
, void *p
)
4256 if (m
->type
== MEM_TYPE_SYMBOL
)
4258 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
4259 ptrdiff_t offset
= (char *) p
- (char *) &b
->symbols
[0];
4261 /* P must point to the start of a Lisp_Symbol, not be
4262 one of the unused cells in the current symbol block,
4263 and not be on the free-list. */
4265 && offset
% sizeof b
->symbols
[0] == 0
4266 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
4267 && (b
!= symbol_block
4268 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
4269 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
4276 /* Value is non-zero if P is a pointer to a live Lisp float on
4277 the heap. M is a pointer to the mem_block for P. */
4280 live_float_p (struct mem_node
*m
, void *p
)
4282 if (m
->type
== MEM_TYPE_FLOAT
)
4284 struct float_block
*b
= (struct float_block
*) m
->start
;
4285 ptrdiff_t offset
= (char *) p
- (char *) &b
->floats
[0];
4287 /* P must point to the start of a Lisp_Float and not be
4288 one of the unused cells in the current float block. */
4290 && offset
% sizeof b
->floats
[0] == 0
4291 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
4292 && (b
!= float_block
4293 || offset
/ sizeof b
->floats
[0] < float_block_index
));
4300 /* Value is non-zero if P is a pointer to a live Lisp Misc on
4301 the heap. M is a pointer to the mem_block for P. */
4304 live_misc_p (struct mem_node
*m
, void *p
)
4306 if (m
->type
== MEM_TYPE_MISC
)
4308 struct marker_block
*b
= (struct marker_block
*) m
->start
;
4309 ptrdiff_t offset
= (char *) p
- (char *) &b
->markers
[0];
4311 /* P must point to the start of a Lisp_Misc, not be
4312 one of the unused cells in the current misc block,
4313 and not be on the free-list. */
4315 && offset
% sizeof b
->markers
[0] == 0
4316 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4317 && (b
!= marker_block
4318 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4319 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
4326 /* Value is non-zero if P is a pointer to a live vector-like object.
4327 M is a pointer to the mem_block for P. */
4330 live_vector_p (struct mem_node
*m
, void *p
)
4332 if (m
->type
== MEM_TYPE_VECTOR_BLOCK
)
4334 /* This memory node corresponds to a vector block. */
4335 struct vector_block
*block
= (struct vector_block
*) m
->start
;
4336 struct Lisp_Vector
*vector
= (struct Lisp_Vector
*) block
->data
;
4338 /* P is in the block's allocation range. Scan the block
4339 up to P and see whether P points to the start of some
4340 vector which is not on a free list. FIXME: check whether
4341 some allocation patterns (probably a lot of short vectors)
4342 may cause a substantial overhead of this loop. */
4343 while (VECTOR_IN_BLOCK (vector
, block
)
4344 && vector
<= (struct Lisp_Vector
*) p
)
4346 if ((vector
->header
.size
& VECTOR_FREE_LIST_FLAG
)
4347 == VECTOR_FREE_LIST_FLAG
)
4348 vector
= ADVANCE (vector
, (vector
->header
.size
4349 & (VECTOR_BLOCK_SIZE
- 1)));
4350 else if (vector
== p
)
4353 vector
= ADVANCE (vector
, vector
->header
.next
.nbytes
);
4356 else if (m
->type
== MEM_TYPE_VECTORLIKE
&& p
== m
->start
)
4357 /* This memory node corresponds to a large vector. */
4363 /* Value is non-zero if P is a pointer to a live buffer. M is a
4364 pointer to the mem_block for P. */
4367 live_buffer_p (struct mem_node
*m
, void *p
)
4369 /* P must point to the start of the block, and the buffer
4370 must not have been killed. */
4371 return (m
->type
== MEM_TYPE_BUFFER
4373 && !NILP (((struct buffer
*) p
)->BUFFER_INTERNAL_FIELD (name
)));
4376 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4380 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4382 /* Array of objects that are kept alive because the C stack contains
4383 a pattern that looks like a reference to them . */
4385 #define MAX_ZOMBIES 10
4386 static Lisp_Object zombies
[MAX_ZOMBIES
];
4388 /* Number of zombie objects. */
4390 static EMACS_INT nzombies
;
4392 /* Number of garbage collections. */
4394 static EMACS_INT ngcs
;
4396 /* Average percentage of zombies per collection. */
4398 static double avg_zombies
;
4400 /* Max. number of live and zombie objects. */
4402 static EMACS_INT max_live
, max_zombies
;
4404 /* Average number of live objects per GC. */
4406 static double avg_live
;
4408 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4409 doc
: /* Show information about live and zombie objects. */)
4412 Lisp_Object args
[8], zombie_list
= Qnil
;
4414 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); i
++)
4415 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4416 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4417 args
[1] = make_number (ngcs
);
4418 args
[2] = make_float (avg_live
);
4419 args
[3] = make_float (avg_zombies
);
4420 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4421 args
[5] = make_number (max_live
);
4422 args
[6] = make_number (max_zombies
);
4423 args
[7] = zombie_list
;
4424 return Fmessage (8, args
);
4427 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4430 /* Mark OBJ if we can prove it's a Lisp_Object. */
4433 mark_maybe_object (Lisp_Object obj
)
4441 po
= (void *) XPNTR (obj
);
4448 switch (XTYPE (obj
))
4451 mark_p
= (live_string_p (m
, po
)
4452 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4456 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4460 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4464 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4467 case Lisp_Vectorlike
:
4468 /* Note: can't check BUFFERP before we know it's a
4469 buffer because checking that dereferences the pointer
4470 PO which might point anywhere. */
4471 if (live_vector_p (m
, po
))
4472 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4473 else if (live_buffer_p (m
, po
))
4474 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4478 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4487 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4488 if (nzombies
< MAX_ZOMBIES
)
4489 zombies
[nzombies
] = obj
;
4498 /* If P points to Lisp data, mark that as live if it isn't already
4502 mark_maybe_pointer (void *p
)
4506 /* Quickly rule out some values which can't point to Lisp data.
4507 USE_LSB_TAG needs Lisp data to be aligned on multiples of 1 << GCTYPEBITS.
4508 Otherwise, assume that Lisp data is aligned on even addresses. */
4509 if ((intptr_t) p
% (USE_LSB_TAG
? 1 << GCTYPEBITS
: 2))
4515 Lisp_Object obj
= Qnil
;
4519 case MEM_TYPE_NON_LISP
:
4520 /* Nothing to do; not a pointer to Lisp memory. */
4523 case MEM_TYPE_BUFFER
:
4524 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P ((struct buffer
*)p
))
4525 XSETVECTOR (obj
, p
);
4529 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4533 case MEM_TYPE_STRING
:
4534 if (live_string_p (m
, p
)
4535 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4536 XSETSTRING (obj
, p
);
4540 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4544 case MEM_TYPE_SYMBOL
:
4545 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4546 XSETSYMBOL (obj
, p
);
4549 case MEM_TYPE_FLOAT
:
4550 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4554 case MEM_TYPE_VECTORLIKE
:
4555 case MEM_TYPE_VECTOR_BLOCK
:
4556 if (live_vector_p (m
, p
))
4559 XSETVECTOR (tem
, p
);
4560 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4575 /* Alignment of pointer values. Use offsetof, as it sometimes returns
4576 a smaller alignment than GCC's __alignof__ and mark_memory might
4577 miss objects if __alignof__ were used. */
4578 #define GC_POINTER_ALIGNMENT offsetof (struct {char a; void *b;}, b)
4580 /* Define POINTERS_MIGHT_HIDE_IN_OBJECTS to 1 if marking via C pointers does
4581 not suffice, which is the typical case. A host where a Lisp_Object is
4582 wider than a pointer might allocate a Lisp_Object in non-adjacent halves.
4583 If USE_LSB_TAG, the bottom half is not a valid pointer, but it should
4584 suffice to widen it to to a Lisp_Object and check it that way. */
4585 #if USE_LSB_TAG || VAL_MAX < UINTPTR_MAX
4586 # if !USE_LSB_TAG && VAL_MAX < UINTPTR_MAX >> GCTYPEBITS
4587 /* If tag bits straddle pointer-word boundaries, neither mark_maybe_pointer
4588 nor mark_maybe_object can follow the pointers. This should not occur on
4589 any practical porting target. */
4590 # error "MSB type bits straddle pointer-word boundaries"
4592 /* Marking via C pointers does not suffice, because Lisp_Objects contain
4593 pointer words that hold pointers ORed with type bits. */
4594 # define POINTERS_MIGHT_HIDE_IN_OBJECTS 1
4596 /* Marking via C pointers suffices, because Lisp_Objects contain pointer
4597 words that hold unmodified pointers. */
4598 # define POINTERS_MIGHT_HIDE_IN_OBJECTS 0
4601 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4602 or END+OFFSET..START. */
4605 mark_memory (void *start
, void *end
)
4607 /* Do not allow -faddress-sanitizer to check this function, since it
4608 crosses the function stack boundary, and thus would yield many
4610 __attribute__((no_address_safety_analysis
))
4616 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4620 /* Make START the pointer to the start of the memory region,
4621 if it isn't already. */
4629 /* Mark Lisp data pointed to. This is necessary because, in some
4630 situations, the C compiler optimizes Lisp objects away, so that
4631 only a pointer to them remains. Example:
4633 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4636 Lisp_Object obj = build_string ("test");
4637 struct Lisp_String *s = XSTRING (obj);
4638 Fgarbage_collect ();
4639 fprintf (stderr, "test `%s'\n", s->data);
4643 Here, `obj' isn't really used, and the compiler optimizes it
4644 away. The only reference to the life string is through the
4647 for (pp
= start
; (void *) pp
< end
; pp
++)
4648 for (i
= 0; i
< sizeof *pp
; i
+= GC_POINTER_ALIGNMENT
)
4650 void *p
= *(void **) ((char *) pp
+ i
);
4651 mark_maybe_pointer (p
);
4652 if (POINTERS_MIGHT_HIDE_IN_OBJECTS
)
4653 mark_maybe_object (XIL ((intptr_t) p
));
4657 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4658 the GCC system configuration. In gcc 3.2, the only systems for
4659 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4660 by others?) and ns32k-pc532-min. */
4662 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4664 static int setjmp_tested_p
, longjmps_done
;
4666 #define SETJMP_WILL_LIKELY_WORK "\
4668 Emacs garbage collector has been changed to use conservative stack\n\
4669 marking. Emacs has determined that the method it uses to do the\n\
4670 marking will likely work on your system, but this isn't sure.\n\
4672 If you are a system-programmer, or can get the help of a local wizard\n\
4673 who is, please take a look at the function mark_stack in alloc.c, and\n\
4674 verify that the methods used are appropriate for your system.\n\
4676 Please mail the result to <emacs-devel@gnu.org>.\n\
4679 #define SETJMP_WILL_NOT_WORK "\
4681 Emacs garbage collector has been changed to use conservative stack\n\
4682 marking. Emacs has determined that the default method it uses to do the\n\
4683 marking will not work on your system. We will need a system-dependent\n\
4684 solution for your system.\n\
4686 Please take a look at the function mark_stack in alloc.c, and\n\
4687 try to find a way to make it work on your system.\n\
4689 Note that you may get false negatives, depending on the compiler.\n\
4690 In particular, you need to use -O with GCC for this test.\n\
4692 Please mail the result to <emacs-devel@gnu.org>.\n\
4696 /* Perform a quick check if it looks like setjmp saves registers in a
4697 jmp_buf. Print a message to stderr saying so. When this test
4698 succeeds, this is _not_ a proof that setjmp is sufficient for
4699 conservative stack marking. Only the sources or a disassembly
4710 /* Arrange for X to be put in a register. */
4716 if (longjmps_done
== 1)
4718 /* Came here after the longjmp at the end of the function.
4720 If x == 1, the longjmp has restored the register to its
4721 value before the setjmp, and we can hope that setjmp
4722 saves all such registers in the jmp_buf, although that
4725 For other values of X, either something really strange is
4726 taking place, or the setjmp just didn't save the register. */
4729 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4732 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4739 if (longjmps_done
== 1)
4743 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4746 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4748 /* Abort if anything GCPRO'd doesn't survive the GC. */
4756 for (p
= gcprolist
; p
; p
= p
->next
)
4757 for (i
= 0; i
< p
->nvars
; ++i
)
4758 if (!survives_gc_p (p
->var
[i
]))
4759 /* FIXME: It's not necessarily a bug. It might just be that the
4760 GCPRO is unnecessary or should release the object sooner. */
4764 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4771 fprintf (stderr
, "\nZombies kept alive = %"pI
"d:\n", nzombies
);
4772 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4774 fprintf (stderr
, " %d = ", i
);
4775 debug_print (zombies
[i
]);
4779 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4782 /* Mark live Lisp objects on the C stack.
4784 There are several system-dependent problems to consider when
4785 porting this to new architectures:
4789 We have to mark Lisp objects in CPU registers that can hold local
4790 variables or are used to pass parameters.
4792 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4793 something that either saves relevant registers on the stack, or
4794 calls mark_maybe_object passing it each register's contents.
4796 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4797 implementation assumes that calling setjmp saves registers we need
4798 to see in a jmp_buf which itself lies on the stack. This doesn't
4799 have to be true! It must be verified for each system, possibly
4800 by taking a look at the source code of setjmp.
4802 If __builtin_unwind_init is available (defined by GCC >= 2.8) we
4803 can use it as a machine independent method to store all registers
4804 to the stack. In this case the macros described in the previous
4805 two paragraphs are not used.
4809 Architectures differ in the way their processor stack is organized.
4810 For example, the stack might look like this
4813 | Lisp_Object | size = 4
4815 | something else | size = 2
4817 | Lisp_Object | size = 4
4821 In such a case, not every Lisp_Object will be aligned equally. To
4822 find all Lisp_Object on the stack it won't be sufficient to walk
4823 the stack in steps of 4 bytes. Instead, two passes will be
4824 necessary, one starting at the start of the stack, and a second
4825 pass starting at the start of the stack + 2. Likewise, if the
4826 minimal alignment of Lisp_Objects on the stack is 1, four passes
4827 would be necessary, each one starting with one byte more offset
4828 from the stack start. */
4835 #ifdef HAVE___BUILTIN_UNWIND_INIT
4836 /* Force callee-saved registers and register windows onto the stack.
4837 This is the preferred method if available, obviating the need for
4838 machine dependent methods. */
4839 __builtin_unwind_init ();
4841 #else /* not HAVE___BUILTIN_UNWIND_INIT */
4842 #ifndef GC_SAVE_REGISTERS_ON_STACK
4843 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4844 union aligned_jmpbuf
{
4848 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4850 /* This trick flushes the register windows so that all the state of
4851 the process is contained in the stack. */
4852 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4853 needed on ia64 too. See mach_dep.c, where it also says inline
4854 assembler doesn't work with relevant proprietary compilers. */
4856 #if defined (__sparc64__) && defined (__FreeBSD__)
4857 /* FreeBSD does not have a ta 3 handler. */
4864 /* Save registers that we need to see on the stack. We need to see
4865 registers used to hold register variables and registers used to
4867 #ifdef GC_SAVE_REGISTERS_ON_STACK
4868 GC_SAVE_REGISTERS_ON_STACK (end
);
4869 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4871 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4872 setjmp will definitely work, test it
4873 and print a message with the result
4875 if (!setjmp_tested_p
)
4877 setjmp_tested_p
= 1;
4880 #endif /* GC_SETJMP_WORKS */
4883 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4884 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4885 #endif /* not HAVE___BUILTIN_UNWIND_INIT */
4887 /* This assumes that the stack is a contiguous region in memory. If
4888 that's not the case, something has to be done here to iterate
4889 over the stack segments. */
4890 mark_memory (stack_base
, end
);
4892 /* Allow for marking a secondary stack, like the register stack on the
4894 #ifdef GC_MARK_SECONDARY_STACK
4895 GC_MARK_SECONDARY_STACK ();
4898 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4903 #endif /* GC_MARK_STACK != 0 */
4906 /* Determine whether it is safe to access memory at address P. */
4908 valid_pointer_p (void *p
)
4911 return w32_valid_pointer_p (p
, 16);
4915 /* Obviously, we cannot just access it (we would SEGV trying), so we
4916 trick the o/s to tell us whether p is a valid pointer.
4917 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4918 not validate p in that case. */
4922 int valid
= (emacs_write (fd
[1], (char *) p
, 16) == 16);
4923 emacs_close (fd
[1]);
4924 emacs_close (fd
[0]);
4932 /* Return 1 if OBJ is a valid lisp object.
4933 Return 0 if OBJ is NOT a valid lisp object.
4934 Return -1 if we cannot validate OBJ.
4935 This function can be quite slow,
4936 so it should only be used in code for manual debugging. */
4939 valid_lisp_object_p (Lisp_Object obj
)
4949 p
= (void *) XPNTR (obj
);
4950 if (PURE_POINTER_P (p
))
4954 return valid_pointer_p (p
);
4961 int valid
= valid_pointer_p (p
);
4973 case MEM_TYPE_NON_LISP
:
4976 case MEM_TYPE_BUFFER
:
4977 return live_buffer_p (m
, p
);
4980 return live_cons_p (m
, p
);
4982 case MEM_TYPE_STRING
:
4983 return live_string_p (m
, p
);
4986 return live_misc_p (m
, p
);
4988 case MEM_TYPE_SYMBOL
:
4989 return live_symbol_p (m
, p
);
4991 case MEM_TYPE_FLOAT
:
4992 return live_float_p (m
, p
);
4994 case MEM_TYPE_VECTORLIKE
:
4995 case MEM_TYPE_VECTOR_BLOCK
:
4996 return live_vector_p (m
, p
);
5009 /***********************************************************************
5010 Pure Storage Management
5011 ***********************************************************************/
5013 /* Allocate room for SIZE bytes from pure Lisp storage and return a
5014 pointer to it. TYPE is the Lisp type for which the memory is
5015 allocated. TYPE < 0 means it's not used for a Lisp object. */
5018 pure_alloc (size_t size
, int type
)
5022 size_t alignment
= (1 << GCTYPEBITS
);
5024 size_t alignment
= sizeof (EMACS_INT
);
5026 /* Give Lisp_Floats an extra alignment. */
5027 if (type
== Lisp_Float
)
5029 #if defined __GNUC__ && __GNUC__ >= 2
5030 alignment
= __alignof (struct Lisp_Float
);
5032 alignment
= sizeof (struct Lisp_Float
);
5040 /* Allocate space for a Lisp object from the beginning of the free
5041 space with taking account of alignment. */
5042 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
5043 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
5047 /* Allocate space for a non-Lisp object from the end of the free
5049 pure_bytes_used_non_lisp
+= size
;
5050 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
5052 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
5054 if (pure_bytes_used
<= pure_size
)
5057 /* Don't allocate a large amount here,
5058 because it might get mmap'd and then its address
5059 might not be usable. */
5060 purebeg
= (char *) xmalloc (10000);
5062 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
5063 pure_bytes_used
= 0;
5064 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
5069 /* Print a warning if PURESIZE is too small. */
5072 check_pure_size (void)
5074 if (pure_bytes_used_before_overflow
)
5075 message (("emacs:0:Pure Lisp storage overflow (approx. %"pI
"d"
5077 pure_bytes_used
+ pure_bytes_used_before_overflow
);
5081 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
5082 the non-Lisp data pool of the pure storage, and return its start
5083 address. Return NULL if not found. */
5086 find_string_data_in_pure (const char *data
, ptrdiff_t nbytes
)
5089 ptrdiff_t skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
5090 const unsigned char *p
;
5093 if (pure_bytes_used_non_lisp
<= nbytes
)
5096 /* Set up the Boyer-Moore table. */
5098 for (i
= 0; i
< 256; i
++)
5101 p
= (const unsigned char *) data
;
5103 bm_skip
[*p
++] = skip
;
5105 last_char_skip
= bm_skip
['\0'];
5107 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
5108 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
5110 /* See the comments in the function `boyer_moore' (search.c) for the
5111 use of `infinity'. */
5112 infinity
= pure_bytes_used_non_lisp
+ 1;
5113 bm_skip
['\0'] = infinity
;
5115 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
5119 /* Check the last character (== '\0'). */
5122 start
+= bm_skip
[*(p
+ start
)];
5124 while (start
<= start_max
);
5126 if (start
< infinity
)
5127 /* Couldn't find the last character. */
5130 /* No less than `infinity' means we could find the last
5131 character at `p[start - infinity]'. */
5134 /* Check the remaining characters. */
5135 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
5137 return non_lisp_beg
+ start
;
5139 start
+= last_char_skip
;
5141 while (start
<= start_max
);
5147 /* Return a string allocated in pure space. DATA is a buffer holding
5148 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
5149 non-zero means make the result string multibyte.
5151 Must get an error if pure storage is full, since if it cannot hold
5152 a large string it may be able to hold conses that point to that
5153 string; then the string is not protected from gc. */
5156 make_pure_string (const char *data
,
5157 ptrdiff_t nchars
, ptrdiff_t nbytes
, int multibyte
)
5160 struct Lisp_String
*s
;
5162 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
5163 s
->data
= (unsigned char *) find_string_data_in_pure (data
, nbytes
);
5164 if (s
->data
== NULL
)
5166 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
5167 memcpy (s
->data
, data
, nbytes
);
5168 s
->data
[nbytes
] = '\0';
5171 s
->size_byte
= multibyte
? nbytes
: -1;
5172 s
->intervals
= NULL_INTERVAL
;
5173 XSETSTRING (string
, s
);
5177 /* Return a string a string allocated in pure space. Do not allocate
5178 the string data, just point to DATA. */
5181 make_pure_c_string (const char *data
)
5184 struct Lisp_String
*s
;
5185 ptrdiff_t nchars
= strlen (data
);
5187 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
5190 s
->data
= (unsigned char *) data
;
5191 s
->intervals
= NULL_INTERVAL
;
5192 XSETSTRING (string
, s
);
5196 /* Return a cons allocated from pure space. Give it pure copies
5197 of CAR as car and CDR as cdr. */
5200 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
5202 register Lisp_Object
new;
5203 struct Lisp_Cons
*p
;
5205 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
5207 XSETCAR (new, Fpurecopy (car
));
5208 XSETCDR (new, Fpurecopy (cdr
));
5213 /* Value is a float object with value NUM allocated from pure space. */
5216 make_pure_float (double num
)
5218 register Lisp_Object
new;
5219 struct Lisp_Float
*p
;
5221 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
5223 XFLOAT_INIT (new, num
);
5228 /* Return a vector with room for LEN Lisp_Objects allocated from
5232 make_pure_vector (ptrdiff_t len
)
5235 struct Lisp_Vector
*p
;
5236 size_t size
= (offsetof (struct Lisp_Vector
, contents
)
5237 + len
* sizeof (Lisp_Object
));
5239 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
5240 XSETVECTOR (new, p
);
5241 XVECTOR (new)->header
.size
= len
;
5246 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
5247 doc
: /* Make a copy of object OBJ in pure storage.
5248 Recursively copies contents of vectors and cons cells.
5249 Does not copy symbols. Copies strings without text properties. */)
5250 (register Lisp_Object obj
)
5252 if (NILP (Vpurify_flag
))
5255 if (PURE_POINTER_P (XPNTR (obj
)))
5258 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
5260 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
5266 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
5267 else if (FLOATP (obj
))
5268 obj
= make_pure_float (XFLOAT_DATA (obj
));
5269 else if (STRINGP (obj
))
5270 obj
= make_pure_string (SSDATA (obj
), SCHARS (obj
),
5272 STRING_MULTIBYTE (obj
));
5273 else if (COMPILEDP (obj
) || VECTORP (obj
))
5275 register struct Lisp_Vector
*vec
;
5276 register ptrdiff_t i
;
5280 if (size
& PSEUDOVECTOR_FLAG
)
5281 size
&= PSEUDOVECTOR_SIZE_MASK
;
5282 vec
= XVECTOR (make_pure_vector (size
));
5283 for (i
= 0; i
< size
; i
++)
5284 vec
->contents
[i
] = Fpurecopy (AREF (obj
, i
));
5285 if (COMPILEDP (obj
))
5287 XSETPVECTYPE (vec
, PVEC_COMPILED
);
5288 XSETCOMPILED (obj
, vec
);
5291 XSETVECTOR (obj
, vec
);
5293 else if (MARKERP (obj
))
5294 error ("Attempt to copy a marker to pure storage");
5296 /* Not purified, don't hash-cons. */
5299 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
5300 Fputhash (obj
, obj
, Vpurify_flag
);
5307 /***********************************************************************
5309 ***********************************************************************/
5311 /* Put an entry in staticvec, pointing at the variable with address
5315 staticpro (Lisp_Object
*varaddress
)
5317 staticvec
[staticidx
++] = varaddress
;
5318 if (staticidx
>= NSTATICS
)
5323 /***********************************************************************
5325 ***********************************************************************/
5327 /* Temporarily prevent garbage collection. */
5330 inhibit_garbage_collection (void)
5332 ptrdiff_t count
= SPECPDL_INDEX ();
5334 specbind (Qgc_cons_threshold
, make_number (MOST_POSITIVE_FIXNUM
));
5339 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
5340 doc
: /* Reclaim storage for Lisp objects no longer needed.
5341 Garbage collection happens automatically if you cons more than
5342 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
5343 `garbage-collect' normally returns a list with info on amount of space in use:
5344 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
5345 (USED-MISCS . FREE-MISCS) USED-STRING-CHARS USED-VECTOR-SLOTS
5346 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
5347 (USED-STRINGS . FREE-STRINGS))
5348 However, if there was overflow in pure space, `garbage-collect'
5349 returns nil, because real GC can't be done.
5350 See Info node `(elisp)Garbage Collection'. */)
5353 register struct specbinding
*bind
;
5354 char stack_top_variable
;
5357 Lisp_Object total
[8];
5358 ptrdiff_t count
= SPECPDL_INDEX ();
5359 EMACS_TIME t1
, t2
, t3
;
5364 /* Can't GC if pure storage overflowed because we can't determine
5365 if something is a pure object or not. */
5366 if (pure_bytes_used_before_overflow
)
5371 /* Don't keep undo information around forever.
5372 Do this early on, so it is no problem if the user quits. */
5374 register struct buffer
*nextb
= all_buffers
;
5378 /* If a buffer's undo list is Qt, that means that undo is
5379 turned off in that buffer. Calling truncate_undo_list on
5380 Qt tends to return NULL, which effectively turns undo back on.
5381 So don't call truncate_undo_list if undo_list is Qt. */
5382 if (! NILP (nextb
->BUFFER_INTERNAL_FIELD (name
))
5383 && ! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
5384 truncate_undo_list (nextb
);
5386 /* Shrink buffer gaps, but skip indirect and dead buffers. */
5387 if (nextb
->base_buffer
== 0 && !NILP (nextb
->BUFFER_INTERNAL_FIELD (name
))
5388 && ! nextb
->text
->inhibit_shrinking
)
5390 /* If a buffer's gap size is more than 10% of the buffer
5391 size, or larger than 2000 bytes, then shrink it
5392 accordingly. Keep a minimum size of 20 bytes. */
5393 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
5395 if (nextb
->text
->gap_size
> size
)
5397 struct buffer
*save_current
= current_buffer
;
5398 current_buffer
= nextb
;
5399 make_gap (-(nextb
->text
->gap_size
- size
));
5400 current_buffer
= save_current
;
5404 nextb
= nextb
->header
.next
.buffer
;
5408 EMACS_GET_TIME (t1
);
5410 /* In case user calls debug_print during GC,
5411 don't let that cause a recursive GC. */
5412 consing_since_gc
= 0;
5414 /* Save what's currently displayed in the echo area. */
5415 message_p
= push_message ();
5416 record_unwind_protect (pop_message_unwind
, Qnil
);
5418 /* Save a copy of the contents of the stack, for debugging. */
5419 #if MAX_SAVE_STACK > 0
5420 if (NILP (Vpurify_flag
))
5423 ptrdiff_t stack_size
;
5424 if (&stack_top_variable
< stack_bottom
)
5426 stack
= &stack_top_variable
;
5427 stack_size
= stack_bottom
- &stack_top_variable
;
5431 stack
= stack_bottom
;
5432 stack_size
= &stack_top_variable
- stack_bottom
;
5434 if (stack_size
<= MAX_SAVE_STACK
)
5436 if (stack_copy_size
< stack_size
)
5438 stack_copy
= (char *) xrealloc (stack_copy
, stack_size
);
5439 stack_copy_size
= stack_size
;
5441 memcpy (stack_copy
, stack
, stack_size
);
5444 #endif /* MAX_SAVE_STACK > 0 */
5446 if (garbage_collection_messages
)
5447 message1_nolog ("Garbage collecting...");
5451 shrink_regexp_cache ();
5455 /* clear_marks (); */
5457 /* Mark all the special slots that serve as the roots of accessibility. */
5459 for (i
= 0; i
< staticidx
; i
++)
5460 mark_object (*staticvec
[i
]);
5462 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
5464 mark_object (bind
->symbol
);
5465 mark_object (bind
->old_value
);
5473 extern void xg_mark_data (void);
5478 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5479 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5483 register struct gcpro
*tail
;
5484 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5485 for (i
= 0; i
< tail
->nvars
; i
++)
5486 mark_object (tail
->var
[i
]);
5490 struct catchtag
*catch;
5491 struct handler
*handler
;
5493 for (catch = catchlist
; catch; catch = catch->next
)
5495 mark_object (catch->tag
);
5496 mark_object (catch->val
);
5498 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5500 mark_object (handler
->handler
);
5501 mark_object (handler
->var
);
5507 #ifdef HAVE_WINDOW_SYSTEM
5508 mark_fringe_data ();
5511 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5515 /* Everything is now marked, except for the things that require special
5516 finalization, i.e. the undo_list.
5517 Look thru every buffer's undo list
5518 for elements that update markers that were not marked,
5521 register struct buffer
*nextb
= all_buffers
;
5525 /* If a buffer's undo list is Qt, that means that undo is
5526 turned off in that buffer. Calling truncate_undo_list on
5527 Qt tends to return NULL, which effectively turns undo back on.
5528 So don't call truncate_undo_list if undo_list is Qt. */
5529 if (! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
5531 Lisp_Object tail
, prev
;
5532 tail
= nextb
->BUFFER_INTERNAL_FIELD (undo_list
);
5534 while (CONSP (tail
))
5536 if (CONSP (XCAR (tail
))
5537 && MARKERP (XCAR (XCAR (tail
)))
5538 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5541 nextb
->BUFFER_INTERNAL_FIELD (undo_list
) = tail
= XCDR (tail
);
5545 XSETCDR (prev
, tail
);
5555 /* Now that we have stripped the elements that need not be in the
5556 undo_list any more, we can finally mark the list. */
5557 mark_object (nextb
->BUFFER_INTERNAL_FIELD (undo_list
));
5559 nextb
= nextb
->header
.next
.buffer
;
5565 /* Clear the mark bits that we set in certain root slots. */
5567 unmark_byte_stack ();
5568 VECTOR_UNMARK (&buffer_defaults
);
5569 VECTOR_UNMARK (&buffer_local_symbols
);
5571 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5579 /* clear_marks (); */
5582 consing_since_gc
= 0;
5583 if (gc_cons_threshold
< 10000)
5584 gc_cons_threshold
= 10000;
5586 gc_relative_threshold
= 0;
5587 if (FLOATP (Vgc_cons_percentage
))
5588 { /* Set gc_cons_combined_threshold. */
5591 tot
+= total_conses
* sizeof (struct Lisp_Cons
);
5592 tot
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5593 tot
+= total_markers
* sizeof (union Lisp_Misc
);
5594 tot
+= total_string_size
;
5595 tot
+= total_vector_size
* sizeof (Lisp_Object
);
5596 tot
+= total_floats
* sizeof (struct Lisp_Float
);
5597 tot
+= total_intervals
* sizeof (struct interval
);
5598 tot
+= total_strings
* sizeof (struct Lisp_String
);
5600 tot
*= XFLOAT_DATA (Vgc_cons_percentage
);
5603 if (tot
< TYPE_MAXIMUM (EMACS_INT
))
5604 gc_relative_threshold
= tot
;
5606 gc_relative_threshold
= TYPE_MAXIMUM (EMACS_INT
);
5610 if (garbage_collection_messages
)
5612 if (message_p
|| minibuf_level
> 0)
5615 message1_nolog ("Garbage collecting...done");
5618 unbind_to (count
, Qnil
);
5620 total
[0] = Fcons (make_number (total_conses
),
5621 make_number (total_free_conses
));
5622 total
[1] = Fcons (make_number (total_symbols
),
5623 make_number (total_free_symbols
));
5624 total
[2] = Fcons (make_number (total_markers
),
5625 make_number (total_free_markers
));
5626 total
[3] = make_number (total_string_size
);
5627 total
[4] = make_number (total_vector_size
);
5628 total
[5] = Fcons (make_number (total_floats
),
5629 make_number (total_free_floats
));
5630 total
[6] = Fcons (make_number (total_intervals
),
5631 make_number (total_free_intervals
));
5632 total
[7] = Fcons (make_number (total_strings
),
5633 make_number (total_free_strings
));
5635 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5637 /* Compute average percentage of zombies. */
5640 for (i
= 0; i
< 7; ++i
)
5641 if (CONSP (total
[i
]))
5642 nlive
+= XFASTINT (XCAR (total
[i
]));
5644 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5645 max_live
= max (nlive
, max_live
);
5646 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5647 max_zombies
= max (nzombies
, max_zombies
);
5652 if (!NILP (Vpost_gc_hook
))
5654 ptrdiff_t gc_count
= inhibit_garbage_collection ();
5655 safe_run_hooks (Qpost_gc_hook
);
5656 unbind_to (gc_count
, Qnil
);
5659 /* Accumulate statistics. */
5660 if (FLOATP (Vgc_elapsed
))
5662 EMACS_GET_TIME (t2
);
5663 EMACS_SUB_TIME (t3
, t2
, t1
);
5664 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
)
5665 + EMACS_TIME_TO_DOUBLE (t3
));
5670 return Flist (sizeof total
/ sizeof *total
, total
);
5674 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5675 only interesting objects referenced from glyphs are strings. */
5678 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5680 struct glyph_row
*row
= matrix
->rows
;
5681 struct glyph_row
*end
= row
+ matrix
->nrows
;
5683 for (; row
< end
; ++row
)
5687 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5689 struct glyph
*glyph
= row
->glyphs
[area
];
5690 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5692 for (; glyph
< end_glyph
; ++glyph
)
5693 if (STRINGP (glyph
->object
)
5694 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5695 mark_object (glyph
->object
);
5701 /* Mark Lisp faces in the face cache C. */
5704 mark_face_cache (struct face_cache
*c
)
5709 for (i
= 0; i
< c
->used
; ++i
)
5711 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5715 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5716 mark_object (face
->lface
[j
]);
5724 /* Mark reference to a Lisp_Object.
5725 If the object referred to has not been seen yet, recursively mark
5726 all the references contained in it. */
5728 #define LAST_MARKED_SIZE 500
5729 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5730 static int last_marked_index
;
5732 /* For debugging--call abort when we cdr down this many
5733 links of a list, in mark_object. In debugging,
5734 the call to abort will hit a breakpoint.
5735 Normally this is zero and the check never goes off. */
5736 ptrdiff_t mark_object_loop_halt EXTERNALLY_VISIBLE
;
5739 mark_vectorlike (struct Lisp_Vector
*ptr
)
5741 ptrdiff_t size
= ptr
->header
.size
;
5744 eassert (!VECTOR_MARKED_P (ptr
));
5745 VECTOR_MARK (ptr
); /* Else mark it */
5746 if (size
& PSEUDOVECTOR_FLAG
)
5747 size
&= PSEUDOVECTOR_SIZE_MASK
;
5749 /* Note that this size is not the memory-footprint size, but only
5750 the number of Lisp_Object fields that we should trace.
5751 The distinction is used e.g. by Lisp_Process which places extra
5752 non-Lisp_Object fields at the end of the structure. */
5753 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5754 mark_object (ptr
->contents
[i
]);
5757 /* Like mark_vectorlike but optimized for char-tables (and
5758 sub-char-tables) assuming that the contents are mostly integers or
5762 mark_char_table (struct Lisp_Vector
*ptr
)
5764 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5767 eassert (!VECTOR_MARKED_P (ptr
));
5769 for (i
= 0; i
< size
; i
++)
5771 Lisp_Object val
= ptr
->contents
[i
];
5773 if (INTEGERP (val
) || (SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
))
5775 if (SUB_CHAR_TABLE_P (val
))
5777 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5778 mark_char_table (XVECTOR (val
));
5785 /* Mark the chain of overlays starting at PTR. */
5788 mark_overlay (struct Lisp_Overlay
*ptr
)
5790 for (; ptr
&& !ptr
->gcmarkbit
; ptr
= ptr
->next
)
5793 mark_object (ptr
->start
);
5794 mark_object (ptr
->end
);
5795 mark_object (ptr
->plist
);
5799 /* Mark Lisp_Objects and special pointers in BUFFER. */
5802 mark_buffer (struct buffer
*buffer
)
5804 /* This is handled much like other pseudovectors... */
5805 mark_vectorlike ((struct Lisp_Vector
*) buffer
);
5807 /* ...but there are some buffer-specific things. */
5809 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5811 /* For now, we just don't mark the undo_list. It's done later in
5812 a special way just before the sweep phase, and after stripping
5813 some of its elements that are not needed any more. */
5815 mark_overlay (buffer
->overlays_before
);
5816 mark_overlay (buffer
->overlays_after
);
5818 /* If this is an indirect buffer, mark its base buffer. */
5819 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5820 mark_buffer (buffer
->base_buffer
);
5823 /* Determine type of generic Lisp_Object and mark it accordingly. */
5826 mark_object (Lisp_Object arg
)
5828 register Lisp_Object obj
= arg
;
5829 #ifdef GC_CHECK_MARKED_OBJECTS
5833 ptrdiff_t cdr_count
= 0;
5837 if (PURE_POINTER_P (XPNTR (obj
)))
5840 last_marked
[last_marked_index
++] = obj
;
5841 if (last_marked_index
== LAST_MARKED_SIZE
)
5842 last_marked_index
= 0;
5844 /* Perform some sanity checks on the objects marked here. Abort if
5845 we encounter an object we know is bogus. This increases GC time
5846 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5847 #ifdef GC_CHECK_MARKED_OBJECTS
5849 po
= (void *) XPNTR (obj
);
5851 /* Check that the object pointed to by PO is known to be a Lisp
5852 structure allocated from the heap. */
5853 #define CHECK_ALLOCATED() \
5855 m = mem_find (po); \
5860 /* Check that the object pointed to by PO is live, using predicate
5862 #define CHECK_LIVE(LIVEP) \
5864 if (!LIVEP (m, po)) \
5868 /* Check both of the above conditions. */
5869 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5871 CHECK_ALLOCATED (); \
5872 CHECK_LIVE (LIVEP); \
5875 #else /* not GC_CHECK_MARKED_OBJECTS */
5877 #define CHECK_LIVE(LIVEP) (void) 0
5878 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5880 #endif /* not GC_CHECK_MARKED_OBJECTS */
5882 switch (SWITCH_ENUM_CAST (XTYPE (obj
)))
5886 register struct Lisp_String
*ptr
= XSTRING (obj
);
5887 if (STRING_MARKED_P (ptr
))
5889 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5890 MARK_INTERVAL_TREE (ptr
->intervals
);
5892 #ifdef GC_CHECK_STRING_BYTES
5893 /* Check that the string size recorded in the string is the
5894 same as the one recorded in the sdata structure. */
5895 CHECK_STRING_BYTES (ptr
);
5896 #endif /* GC_CHECK_STRING_BYTES */
5900 case Lisp_Vectorlike
:
5902 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5903 register ptrdiff_t pvectype
;
5905 if (VECTOR_MARKED_P (ptr
))
5908 #ifdef GC_CHECK_MARKED_OBJECTS
5910 if (m
== MEM_NIL
&& !SUBRP (obj
)
5911 && po
!= &buffer_defaults
5912 && po
!= &buffer_local_symbols
)
5914 #endif /* GC_CHECK_MARKED_OBJECTS */
5916 if (ptr
->header
.size
& PSEUDOVECTOR_FLAG
)
5917 pvectype
= ptr
->header
.size
& PVEC_TYPE_MASK
;
5921 if (pvectype
!= PVEC_SUBR
&& pvectype
!= PVEC_BUFFER
)
5922 CHECK_LIVE (live_vector_p
);
5924 if (pvectype
== PVEC_BUFFER
)
5926 #ifdef GC_CHECK_MARKED_OBJECTS
5927 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5929 struct buffer
*b
= all_buffers
;
5930 for (; b
&& b
!= po
; b
= b
->header
.next
.buffer
)
5935 #endif /* GC_CHECK_MARKED_OBJECTS */
5936 mark_buffer ((struct buffer
*) ptr
);
5939 else if (pvectype
== PVEC_COMPILED
)
5940 /* We could treat this just like a vector, but it is better
5941 to save the COMPILED_CONSTANTS element for last and avoid
5944 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5948 for (i
= 0; i
< size
; i
++)
5949 if (i
!= COMPILED_CONSTANTS
)
5950 mark_object (ptr
->contents
[i
]);
5951 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5955 else if (pvectype
== PVEC_FRAME
)
5957 mark_vectorlike (ptr
);
5958 mark_face_cache (((struct frame
*) ptr
)->face_cache
);
5961 else if (pvectype
== PVEC_WINDOW
)
5963 struct window
*w
= (struct window
*) ptr
;
5965 mark_vectorlike (ptr
);
5966 /* Mark glyphs for leaf windows. Marking window
5967 matrices is sufficient because frame matrices
5968 use the same glyph memory. */
5969 if (NILP (w
->hchild
) && NILP (w
->vchild
) && w
->current_matrix
)
5971 mark_glyph_matrix (w
->current_matrix
);
5972 mark_glyph_matrix (w
->desired_matrix
);
5976 else if (pvectype
== PVEC_HASH_TABLE
)
5978 struct Lisp_Hash_Table
*h
= (struct Lisp_Hash_Table
*) ptr
;
5980 mark_vectorlike (ptr
);
5981 /* If hash table is not weak, mark all keys and values.
5982 For weak tables, mark only the vector. */
5984 mark_object (h
->key_and_value
);
5986 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5989 else if (pvectype
== PVEC_CHAR_TABLE
)
5990 mark_char_table (ptr
);
5992 else if (pvectype
== PVEC_BOOL_VECTOR
)
5993 /* No Lisp_Objects to mark in a bool vector. */
5996 else if (pvectype
!= PVEC_SUBR
)
5997 mark_vectorlike (ptr
);
6003 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
6004 struct Lisp_Symbol
*ptrx
;
6008 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
6010 mark_object (ptr
->function
);
6011 mark_object (ptr
->plist
);
6012 switch (ptr
->redirect
)
6014 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
6015 case SYMBOL_VARALIAS
:
6018 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
6022 case SYMBOL_LOCALIZED
:
6024 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
6025 /* If the value is forwarded to a buffer or keyboard field,
6026 these are marked when we see the corresponding object.
6027 And if it's forwarded to a C variable, either it's not
6028 a Lisp_Object var, or it's staticpro'd already. */
6029 mark_object (blv
->where
);
6030 mark_object (blv
->valcell
);
6031 mark_object (blv
->defcell
);
6034 case SYMBOL_FORWARDED
:
6035 /* If the value is forwarded to a buffer or keyboard field,
6036 these are marked when we see the corresponding object.
6037 And if it's forwarded to a C variable, either it's not
6038 a Lisp_Object var, or it's staticpro'd already. */
6042 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
6043 MARK_STRING (XSTRING (ptr
->xname
));
6044 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
6049 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
6050 XSETSYMBOL (obj
, ptrx
);
6057 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
6059 if (XMISCTYPE (obj
) == Lisp_Misc_Overlay
)
6060 mark_overlay (XOVERLAY (obj
));
6063 if (XMISCANY (obj
)->gcmarkbit
)
6065 XMISCANY (obj
)->gcmarkbit
= 1;
6067 /* Note that we don't mark thru the marker's
6068 chain. The buffer's markers chain does not
6069 preserve markers from GC; instead, markers
6070 are removed from the chain when freed by GC. */
6073 if (XMISCTYPE (obj
) == Lisp_Misc_Save_Value
)
6075 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
6076 /* If DOGC is set, POINTER is the address of a memory
6077 area containing INTEGER potential Lisp_Objects. */
6080 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
6082 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
6083 mark_maybe_object (*p
);
6092 register struct Lisp_Cons
*ptr
= XCONS (obj
);
6093 if (CONS_MARKED_P (ptr
))
6095 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
6097 /* If the cdr is nil, avoid recursion for the car. */
6098 if (EQ (ptr
->u
.cdr
, Qnil
))
6104 mark_object (ptr
->car
);
6107 if (cdr_count
== mark_object_loop_halt
)
6113 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
6114 FLOAT_MARK (XFLOAT (obj
));
6125 #undef CHECK_ALLOCATED
6126 #undef CHECK_ALLOCATED_AND_LIVE
6128 /* Mark the Lisp pointers in the terminal objects.
6129 Called by Fgarbage_collect. */
6132 mark_terminals (void)
6135 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
6137 eassert (t
->name
!= NULL
);
6138 #ifdef HAVE_WINDOW_SYSTEM
6139 /* If a terminal object is reachable from a stacpro'ed object,
6140 it might have been marked already. Make sure the image cache
6142 mark_image_cache (t
->image_cache
);
6143 #endif /* HAVE_WINDOW_SYSTEM */
6144 if (!VECTOR_MARKED_P (t
))
6145 mark_vectorlike ((struct Lisp_Vector
*)t
);
6151 /* Value is non-zero if OBJ will survive the current GC because it's
6152 either marked or does not need to be marked to survive. */
6155 survives_gc_p (Lisp_Object obj
)
6159 switch (XTYPE (obj
))
6166 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
6170 survives_p
= XMISCANY (obj
)->gcmarkbit
;
6174 survives_p
= STRING_MARKED_P (XSTRING (obj
));
6177 case Lisp_Vectorlike
:
6178 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
6182 survives_p
= CONS_MARKED_P (XCONS (obj
));
6186 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
6193 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
6198 /* Sweep: find all structures not marked, and free them. */
6203 /* Remove or mark entries in weak hash tables.
6204 This must be done before any object is unmarked. */
6205 sweep_weak_hash_tables ();
6208 #ifdef GC_CHECK_STRING_BYTES
6209 if (!noninteractive
)
6210 check_string_bytes (1);
6213 /* Put all unmarked conses on free list */
6215 register struct cons_block
*cblk
;
6216 struct cons_block
**cprev
= &cons_block
;
6217 register int lim
= cons_block_index
;
6218 EMACS_INT num_free
= 0, num_used
= 0;
6222 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
6226 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
6228 /* Scan the mark bits an int at a time. */
6229 for (i
= 0; i
< ilim
; i
++)
6231 if (cblk
->gcmarkbits
[i
] == -1)
6233 /* Fast path - all cons cells for this int are marked. */
6234 cblk
->gcmarkbits
[i
] = 0;
6235 num_used
+= BITS_PER_INT
;
6239 /* Some cons cells for this int are not marked.
6240 Find which ones, and free them. */
6241 int start
, pos
, stop
;
6243 start
= i
* BITS_PER_INT
;
6245 if (stop
> BITS_PER_INT
)
6246 stop
= BITS_PER_INT
;
6249 for (pos
= start
; pos
< stop
; pos
++)
6251 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
6254 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
6255 cons_free_list
= &cblk
->conses
[pos
];
6257 cons_free_list
->car
= Vdead
;
6263 CONS_UNMARK (&cblk
->conses
[pos
]);
6269 lim
= CONS_BLOCK_SIZE
;
6270 /* If this block contains only free conses and we have already
6271 seen more than two blocks worth of free conses then deallocate
6273 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
6275 *cprev
= cblk
->next
;
6276 /* Unhook from the free list. */
6277 cons_free_list
= cblk
->conses
[0].u
.chain
;
6278 lisp_align_free (cblk
);
6282 num_free
+= this_free
;
6283 cprev
= &cblk
->next
;
6286 total_conses
= num_used
;
6287 total_free_conses
= num_free
;
6290 /* Put all unmarked floats on free list */
6292 register struct float_block
*fblk
;
6293 struct float_block
**fprev
= &float_block
;
6294 register int lim
= float_block_index
;
6295 EMACS_INT num_free
= 0, num_used
= 0;
6297 float_free_list
= 0;
6299 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
6303 for (i
= 0; i
< lim
; i
++)
6304 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
6307 fblk
->floats
[i
].u
.chain
= float_free_list
;
6308 float_free_list
= &fblk
->floats
[i
];
6313 FLOAT_UNMARK (&fblk
->floats
[i
]);
6315 lim
= FLOAT_BLOCK_SIZE
;
6316 /* If this block contains only free floats and we have already
6317 seen more than two blocks worth of free floats then deallocate
6319 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
6321 *fprev
= fblk
->next
;
6322 /* Unhook from the free list. */
6323 float_free_list
= fblk
->floats
[0].u
.chain
;
6324 lisp_align_free (fblk
);
6328 num_free
+= this_free
;
6329 fprev
= &fblk
->next
;
6332 total_floats
= num_used
;
6333 total_free_floats
= num_free
;
6336 /* Put all unmarked intervals on free list */
6338 register struct interval_block
*iblk
;
6339 struct interval_block
**iprev
= &interval_block
;
6340 register int lim
= interval_block_index
;
6341 EMACS_INT num_free
= 0, num_used
= 0;
6343 interval_free_list
= 0;
6345 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
6350 for (i
= 0; i
< lim
; i
++)
6352 if (!iblk
->intervals
[i
].gcmarkbit
)
6354 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
6355 interval_free_list
= &iblk
->intervals
[i
];
6361 iblk
->intervals
[i
].gcmarkbit
= 0;
6364 lim
= INTERVAL_BLOCK_SIZE
;
6365 /* If this block contains only free intervals and we have already
6366 seen more than two blocks worth of free intervals then
6367 deallocate this block. */
6368 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
6370 *iprev
= iblk
->next
;
6371 /* Unhook from the free list. */
6372 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
6377 num_free
+= this_free
;
6378 iprev
= &iblk
->next
;
6381 total_intervals
= num_used
;
6382 total_free_intervals
= num_free
;
6385 /* Put all unmarked symbols on free list */
6387 register struct symbol_block
*sblk
;
6388 struct symbol_block
**sprev
= &symbol_block
;
6389 register int lim
= symbol_block_index
;
6390 EMACS_INT num_free
= 0, num_used
= 0;
6392 symbol_free_list
= NULL
;
6394 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
6397 union aligned_Lisp_Symbol
*sym
= sblk
->symbols
;
6398 union aligned_Lisp_Symbol
*end
= sym
+ lim
;
6400 for (; sym
< end
; ++sym
)
6402 /* Check if the symbol was created during loadup. In such a case
6403 it might be pointed to by pure bytecode which we don't trace,
6404 so we conservatively assume that it is live. */
6405 int pure_p
= PURE_POINTER_P (XSTRING (sym
->s
.xname
));
6407 if (!sym
->s
.gcmarkbit
&& !pure_p
)
6409 if (sym
->s
.redirect
== SYMBOL_LOCALIZED
)
6410 xfree (SYMBOL_BLV (&sym
->s
));
6411 sym
->s
.next
= symbol_free_list
;
6412 symbol_free_list
= &sym
->s
;
6414 symbol_free_list
->function
= Vdead
;
6422 UNMARK_STRING (XSTRING (sym
->s
.xname
));
6423 sym
->s
.gcmarkbit
= 0;
6427 lim
= SYMBOL_BLOCK_SIZE
;
6428 /* If this block contains only free symbols and we have already
6429 seen more than two blocks worth of free symbols then deallocate
6431 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6433 *sprev
= sblk
->next
;
6434 /* Unhook from the free list. */
6435 symbol_free_list
= sblk
->symbols
[0].s
.next
;
6440 num_free
+= this_free
;
6441 sprev
= &sblk
->next
;
6444 total_symbols
= num_used
;
6445 total_free_symbols
= num_free
;
6448 /* Put all unmarked misc's on free list.
6449 For a marker, first unchain it from the buffer it points into. */
6451 register struct marker_block
*mblk
;
6452 struct marker_block
**mprev
= &marker_block
;
6453 register int lim
= marker_block_index
;
6454 EMACS_INT num_free
= 0, num_used
= 0;
6456 marker_free_list
= 0;
6458 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6463 for (i
= 0; i
< lim
; i
++)
6465 if (!mblk
->markers
[i
].m
.u_any
.gcmarkbit
)
6467 if (mblk
->markers
[i
].m
.u_any
.type
== Lisp_Misc_Marker
)
6468 unchain_marker (&mblk
->markers
[i
].m
.u_marker
);
6469 /* Set the type of the freed object to Lisp_Misc_Free.
6470 We could leave the type alone, since nobody checks it,
6471 but this might catch bugs faster. */
6472 mblk
->markers
[i
].m
.u_marker
.type
= Lisp_Misc_Free
;
6473 mblk
->markers
[i
].m
.u_free
.chain
= marker_free_list
;
6474 marker_free_list
= &mblk
->markers
[i
].m
;
6480 mblk
->markers
[i
].m
.u_any
.gcmarkbit
= 0;
6483 lim
= MARKER_BLOCK_SIZE
;
6484 /* If this block contains only free markers and we have already
6485 seen more than two blocks worth of free markers then deallocate
6487 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6489 *mprev
= mblk
->next
;
6490 /* Unhook from the free list. */
6491 marker_free_list
= mblk
->markers
[0].m
.u_free
.chain
;
6496 num_free
+= this_free
;
6497 mprev
= &mblk
->next
;
6501 total_markers
= num_used
;
6502 total_free_markers
= num_free
;
6505 /* Free all unmarked buffers */
6507 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6510 if (!VECTOR_MARKED_P (buffer
))
6513 prev
->header
.next
= buffer
->header
.next
;
6515 all_buffers
= buffer
->header
.next
.buffer
;
6516 next
= buffer
->header
.next
.buffer
;
6522 VECTOR_UNMARK (buffer
);
6523 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6524 prev
= buffer
, buffer
= buffer
->header
.next
.buffer
;
6530 #ifdef GC_CHECK_STRING_BYTES
6531 if (!noninteractive
)
6532 check_string_bytes (1);
6539 /* Debugging aids. */
6541 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6542 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6543 This may be helpful in debugging Emacs's memory usage.
6544 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6549 XSETINT (end
, (intptr_t) (char *) sbrk (0) / 1024);
6554 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6555 doc
: /* Return a list of counters that measure how much consing there has been.
6556 Each of these counters increments for a certain kind of object.
6557 The counters wrap around from the largest positive integer to zero.
6558 Garbage collection does not decrease them.
6559 The elements of the value are as follows:
6560 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6561 All are in units of 1 = one object consed
6562 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6564 MISCS include overlays, markers, and some internal types.
6565 Frames, windows, buffers, and subprocesses count as vectors
6566 (but the contents of a buffer's text do not count here). */)
6569 Lisp_Object consed
[8];
6571 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6572 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6573 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6574 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6575 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6576 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6577 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6578 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6580 return Flist (8, consed
);
6583 /* Find at most FIND_MAX symbols which have OBJ as their value or
6584 function. This is used in gdbinit's `xwhichsymbols' command. */
6587 which_symbols (Lisp_Object obj
, EMACS_INT find_max
)
6589 struct symbol_block
*sblk
;
6590 ptrdiff_t gc_count
= inhibit_garbage_collection ();
6591 Lisp_Object found
= Qnil
;
6595 for (sblk
= symbol_block
; sblk
; sblk
= sblk
->next
)
6597 union aligned_Lisp_Symbol
*aligned_sym
= sblk
->symbols
;
6600 for (bn
= 0; bn
< SYMBOL_BLOCK_SIZE
; bn
++, aligned_sym
++)
6602 struct Lisp_Symbol
*sym
= &aligned_sym
->s
;
6606 if (sblk
== symbol_block
&& bn
>= symbol_block_index
)
6609 XSETSYMBOL (tem
, sym
);
6610 val
= find_symbol_value (tem
);
6612 || EQ (sym
->function
, obj
)
6613 || (!NILP (sym
->function
)
6614 && COMPILEDP (sym
->function
)
6615 && EQ (AREF (sym
->function
, COMPILED_BYTECODE
), obj
))
6618 && EQ (AREF (val
, COMPILED_BYTECODE
), obj
)))
6620 found
= Fcons (tem
, found
);
6621 if (--find_max
== 0)
6629 unbind_to (gc_count
, Qnil
);
6633 #ifdef ENABLE_CHECKING
6634 int suppress_checking
;
6637 die (const char *msg
, const char *file
, int line
)
6639 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6645 /* Initialization */
6648 init_alloc_once (void)
6650 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6652 pure_size
= PURESIZE
;
6653 pure_bytes_used
= 0;
6654 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6655 pure_bytes_used_before_overflow
= 0;
6657 /* Initialize the list of free aligned blocks. */
6660 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6662 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6665 ignore_warnings
= 1;
6666 #ifdef DOUG_LEA_MALLOC
6667 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6668 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6669 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6678 init_weak_hash_tables ();
6681 malloc_hysteresis
= 32;
6683 malloc_hysteresis
= 0;
6686 refill_memory_reserve ();
6688 ignore_warnings
= 0;
6690 byte_stack_list
= 0;
6692 consing_since_gc
= 0;
6693 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6694 gc_relative_threshold
= 0;
6701 byte_stack_list
= 0;
6703 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6704 setjmp_tested_p
= longjmps_done
= 0;
6707 Vgc_elapsed
= make_float (0.0);
6712 syms_of_alloc (void)
6714 DEFVAR_INT ("gc-cons-threshold", gc_cons_threshold
,
6715 doc
: /* Number of bytes of consing between garbage collections.
6716 Garbage collection can happen automatically once this many bytes have been
6717 allocated since the last garbage collection. All data types count.
6719 Garbage collection happens automatically only when `eval' is called.
6721 By binding this temporarily to a large number, you can effectively
6722 prevent garbage collection during a part of the program.
6723 See also `gc-cons-percentage'. */);
6725 DEFVAR_LISP ("gc-cons-percentage", Vgc_cons_percentage
,
6726 doc
: /* Portion of the heap used for allocation.
6727 Garbage collection can happen automatically once this portion of the heap
6728 has been allocated since the last garbage collection.
6729 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6730 Vgc_cons_percentage
= make_float (0.1);
6732 DEFVAR_INT ("pure-bytes-used", pure_bytes_used
,
6733 doc
: /* Number of bytes of shareable Lisp data allocated so far. */);
6735 DEFVAR_INT ("cons-cells-consed", cons_cells_consed
,
6736 doc
: /* Number of cons cells that have been consed so far. */);
6738 DEFVAR_INT ("floats-consed", floats_consed
,
6739 doc
: /* Number of floats that have been consed so far. */);
6741 DEFVAR_INT ("vector-cells-consed", vector_cells_consed
,
6742 doc
: /* Number of vector cells that have been consed so far. */);
6744 DEFVAR_INT ("symbols-consed", symbols_consed
,
6745 doc
: /* Number of symbols that have been consed so far. */);
6747 DEFVAR_INT ("string-chars-consed", string_chars_consed
,
6748 doc
: /* Number of string characters that have been consed so far. */);
6750 DEFVAR_INT ("misc-objects-consed", misc_objects_consed
,
6751 doc
: /* Number of miscellaneous objects that have been consed so far.
6752 These include markers and overlays, plus certain objects not visible
6755 DEFVAR_INT ("intervals-consed", intervals_consed
,
6756 doc
: /* Number of intervals that have been consed so far. */);
6758 DEFVAR_INT ("strings-consed", strings_consed
,
6759 doc
: /* Number of strings that have been consed so far. */);
6761 DEFVAR_LISP ("purify-flag", Vpurify_flag
,
6762 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6763 This means that certain objects should be allocated in shared (pure) space.
6764 It can also be set to a hash-table, in which case this table is used to
6765 do hash-consing of the objects allocated to pure space. */);
6767 DEFVAR_BOOL ("garbage-collection-messages", garbage_collection_messages
,
6768 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6769 garbage_collection_messages
= 0;
6771 DEFVAR_LISP ("post-gc-hook", Vpost_gc_hook
,
6772 doc
: /* Hook run after garbage collection has finished. */);
6773 Vpost_gc_hook
= Qnil
;
6774 DEFSYM (Qpost_gc_hook
, "post-gc-hook");
6776 DEFVAR_LISP ("memory-signal-data", Vmemory_signal_data
,
6777 doc
: /* Precomputed `signal' argument for memory-full error. */);
6778 /* We build this in advance because if we wait until we need it, we might
6779 not be able to allocate the memory to hold it. */
6781 = pure_cons (Qerror
,
6782 pure_cons (make_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"), Qnil
));
6784 DEFVAR_LISP ("memory-full", Vmemory_full
,
6785 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6786 Vmemory_full
= Qnil
;
6788 DEFSYM (Qgc_cons_threshold
, "gc-cons-threshold");
6789 DEFSYM (Qchar_table_extra_slots
, "char-table-extra-slots");
6791 DEFVAR_LISP ("gc-elapsed", Vgc_elapsed
,
6792 doc
: /* Accumulated time elapsed in garbage collections.
6793 The time is in seconds as a floating point value. */);
6794 DEFVAR_INT ("gcs-done", gcs_done
,
6795 doc
: /* Accumulated number of garbage collections done. */);
6800 defsubr (&Smake_byte_code
);
6801 defsubr (&Smake_list
);
6802 defsubr (&Smake_vector
);
6803 defsubr (&Smake_string
);
6804 defsubr (&Smake_bool_vector
);
6805 defsubr (&Smake_symbol
);
6806 defsubr (&Smake_marker
);
6807 defsubr (&Spurecopy
);
6808 defsubr (&Sgarbage_collect
);
6809 defsubr (&Smemory_limit
);
6810 defsubr (&Smemory_use_counts
);
6812 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6813 defsubr (&Sgc_status
);