1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
2 Copyright (C) 1985-1986, 1988, 1993-1995, 1997-2011
3 Free Software Foundation, Inc.
5 This file is part of GNU Emacs.
7 GNU Emacs is free software: you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation, either version 3 of the License, or
10 (at your option) any later version.
12 GNU Emacs is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>. */
22 #include <limits.h> /* For CHAR_BIT. */
31 /* This file is part of the core Lisp implementation, and thus must
32 deal with the real data structures. If the Lisp implementation is
33 replaced, this file likely will not be used. */
35 #undef HIDE_LISP_IMPLEMENTATION
38 #include "intervals.h"
44 #include "blockinput.h"
45 #include "character.h"
46 #include "syssignal.h"
47 #include "termhooks.h" /* For struct terminal. */
51 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
52 memory. Can do this only if using gmalloc.c. */
54 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
55 #undef GC_MALLOC_CHECK
60 extern POINTER_TYPE
*sbrk ();
69 #ifdef DOUG_LEA_MALLOC
73 /* Specify maximum number of areas to mmap. It would be nice to use a
74 value that explicitly means "no limit". */
76 #define MMAP_MAX_AREAS 100000000
78 #else /* not DOUG_LEA_MALLOC */
80 /* The following come from gmalloc.c. */
82 extern size_t _bytes_used
;
83 extern size_t __malloc_extra_blocks
;
85 #endif /* not DOUG_LEA_MALLOC */
87 #if ! defined SYSTEM_MALLOC && ! defined SYNC_INPUT
90 /* When GTK uses the file chooser dialog, different backends can be loaded
91 dynamically. One such a backend is the Gnome VFS backend that gets loaded
92 if you run Gnome. That backend creates several threads and also allocates
95 Also, gconf and gsettings may create several threads.
97 If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_*
98 functions below are called from malloc, there is a chance that one
99 of these threads preempts the Emacs main thread and the hook variables
100 end up in an inconsistent state. So we have a mutex to prevent that (note
101 that the backend handles concurrent access to malloc within its own threads
102 but Emacs code running in the main thread is not included in that control).
104 When UNBLOCK_INPUT is called, reinvoke_input_signal may be called. If this
105 happens in one of the backend threads we will have two threads that tries
106 to run Emacs code at once, and the code is not prepared for that.
107 To prevent that, we only call BLOCK/UNBLOCK from the main thread. */
109 static pthread_mutex_t alloc_mutex
;
111 #define BLOCK_INPUT_ALLOC \
114 if (pthread_equal (pthread_self (), main_thread)) \
116 pthread_mutex_lock (&alloc_mutex); \
119 #define UNBLOCK_INPUT_ALLOC \
122 pthread_mutex_unlock (&alloc_mutex); \
123 if (pthread_equal (pthread_self (), main_thread)) \
128 #else /* ! defined HAVE_PTHREAD */
130 #define BLOCK_INPUT_ALLOC BLOCK_INPUT
131 #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT
133 #endif /* ! defined HAVE_PTHREAD */
134 #endif /* ! defined SYSTEM_MALLOC && ! defined SYNC_INPUT */
136 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
137 to a struct Lisp_String. */
139 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
140 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
141 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
143 #define VECTOR_MARK(V) ((V)->header.size |= ARRAY_MARK_FLAG)
144 #define VECTOR_UNMARK(V) ((V)->header.size &= ~ARRAY_MARK_FLAG)
145 #define VECTOR_MARKED_P(V) (((V)->header.size & ARRAY_MARK_FLAG) != 0)
147 /* Value is the number of bytes of S, a pointer to a struct Lisp_String.
148 Be careful during GC, because S->size contains the mark bit for
151 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
153 /* Global variables. */
154 struct emacs_globals globals
;
156 /* Number of bytes of consing done since the last gc. */
158 EMACS_INT consing_since_gc
;
160 /* Similar minimum, computed from Vgc_cons_percentage. */
162 EMACS_INT gc_relative_threshold
;
164 /* Minimum number of bytes of consing since GC before next GC,
165 when memory is full. */
167 EMACS_INT memory_full_cons_threshold
;
169 /* Nonzero during GC. */
173 /* Nonzero means abort if try to GC.
174 This is for code which is written on the assumption that
175 no GC will happen, so as to verify that assumption. */
179 /* Number of live and free conses etc. */
181 static EMACS_INT total_conses
, total_markers
, total_symbols
, total_vector_size
;
182 static EMACS_INT total_free_conses
, total_free_markers
, total_free_symbols
;
183 static EMACS_INT total_free_floats
, total_floats
;
185 /* Points to memory space allocated as "spare", to be freed if we run
186 out of memory. We keep one large block, four cons-blocks, and
187 two string blocks. */
189 static char *spare_memory
[7];
191 /* Amount of spare memory to keep in large reserve block, or to see
192 whether this much is available when malloc fails on a larger request. */
194 #define SPARE_MEMORY (1 << 14)
196 /* Number of extra blocks malloc should get when it needs more core. */
198 static int malloc_hysteresis
;
200 /* Initialize it to a nonzero value to force it into data space
201 (rather than bss space). That way unexec will remap it into text
202 space (pure), on some systems. We have not implemented the
203 remapping on more recent systems because this is less important
204 nowadays than in the days of small memories and timesharing. */
206 #ifndef VIRT_ADDR_VARIES
209 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
210 #define PUREBEG (char *) pure
212 /* Pointer to the pure area, and its size. */
214 static char *purebeg
;
215 static ptrdiff_t pure_size
;
217 /* Number of bytes of pure storage used before pure storage overflowed.
218 If this is non-zero, this implies that an overflow occurred. */
220 static ptrdiff_t pure_bytes_used_before_overflow
;
222 /* Value is non-zero if P points into pure space. */
224 #define PURE_POINTER_P(P) \
225 (((PNTR_COMPARISON_TYPE) (P) \
226 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
227 && ((PNTR_COMPARISON_TYPE) (P) \
228 >= (PNTR_COMPARISON_TYPE) purebeg))
230 /* Index in pure at which next pure Lisp object will be allocated.. */
232 static EMACS_INT pure_bytes_used_lisp
;
234 /* Number of bytes allocated for non-Lisp objects in pure storage. */
236 static EMACS_INT pure_bytes_used_non_lisp
;
238 /* If nonzero, this is a warning delivered by malloc and not yet
241 const char *pending_malloc_warning
;
243 /* Maximum amount of C stack to save when a GC happens. */
245 #ifndef MAX_SAVE_STACK
246 #define MAX_SAVE_STACK 16000
249 /* Buffer in which we save a copy of the C stack at each GC. */
251 #if MAX_SAVE_STACK > 0
252 static char *stack_copy
;
253 static ptrdiff_t stack_copy_size
;
256 /* Non-zero means ignore malloc warnings. Set during initialization.
257 Currently not used. */
259 static int ignore_warnings
;
261 static Lisp_Object Qgc_cons_threshold
;
262 Lisp_Object Qchar_table_extra_slots
;
264 /* Hook run after GC has finished. */
266 static Lisp_Object Qpost_gc_hook
;
268 static void mark_buffer (Lisp_Object
);
269 static void mark_terminals (void);
270 static void gc_sweep (void);
271 static void mark_glyph_matrix (struct glyph_matrix
*);
272 static void mark_face_cache (struct face_cache
*);
274 #if !defined REL_ALLOC || defined SYSTEM_MALLOC
275 static void refill_memory_reserve (void);
277 static struct Lisp_String
*allocate_string (void);
278 static void compact_small_strings (void);
279 static void free_large_strings (void);
280 static void sweep_strings (void);
281 static void free_misc (Lisp_Object
);
283 /* When scanning the C stack for live Lisp objects, Emacs keeps track
284 of what memory allocated via lisp_malloc is intended for what
285 purpose. This enumeration specifies the type of memory. */
296 /* We used to keep separate mem_types for subtypes of vectors such as
297 process, hash_table, frame, terminal, and window, but we never made
298 use of the distinction, so it only caused source-code complexity
299 and runtime slowdown. Minor but pointless. */
303 static POINTER_TYPE
*lisp_align_malloc (size_t, enum mem_type
);
304 static POINTER_TYPE
*lisp_malloc (size_t, enum mem_type
);
307 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
309 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
310 #include <stdio.h> /* For fprintf. */
313 /* A unique object in pure space used to make some Lisp objects
314 on free lists recognizable in O(1). */
316 static Lisp_Object Vdead
;
318 #ifdef GC_MALLOC_CHECK
320 enum mem_type allocated_mem_type
;
321 static int dont_register_blocks
;
323 #endif /* GC_MALLOC_CHECK */
325 /* A node in the red-black tree describing allocated memory containing
326 Lisp data. Each such block is recorded with its start and end
327 address when it is allocated, and removed from the tree when it
330 A red-black tree is a balanced binary tree with the following
333 1. Every node is either red or black.
334 2. Every leaf is black.
335 3. If a node is red, then both of its children are black.
336 4. Every simple path from a node to a descendant leaf contains
337 the same number of black nodes.
338 5. The root is always black.
340 When nodes are inserted into the tree, or deleted from the tree,
341 the tree is "fixed" so that these properties are always true.
343 A red-black tree with N internal nodes has height at most 2
344 log(N+1). Searches, insertions and deletions are done in O(log N).
345 Please see a text book about data structures for a detailed
346 description of red-black trees. Any book worth its salt should
351 /* Children of this node. These pointers are never NULL. When there
352 is no child, the value is MEM_NIL, which points to a dummy node. */
353 struct mem_node
*left
, *right
;
355 /* The parent of this node. In the root node, this is NULL. */
356 struct mem_node
*parent
;
358 /* Start and end of allocated region. */
362 enum {MEM_BLACK
, MEM_RED
} color
;
368 /* Base address of stack. Set in main. */
370 Lisp_Object
*stack_base
;
372 /* Root of the tree describing allocated Lisp memory. */
374 static struct mem_node
*mem_root
;
376 /* Lowest and highest known address in the heap. */
378 static void *min_heap_address
, *max_heap_address
;
380 /* Sentinel node of the tree. */
382 static struct mem_node mem_z
;
383 #define MEM_NIL &mem_z
385 static struct Lisp_Vector
*allocate_vectorlike (EMACS_INT
);
386 static void lisp_free (POINTER_TYPE
*);
387 static void mark_stack (void);
388 static int live_vector_p (struct mem_node
*, void *);
389 static int live_buffer_p (struct mem_node
*, void *);
390 static int live_string_p (struct mem_node
*, void *);
391 static int live_cons_p (struct mem_node
*, void *);
392 static int live_symbol_p (struct mem_node
*, void *);
393 static int live_float_p (struct mem_node
*, void *);
394 static int live_misc_p (struct mem_node
*, void *);
395 static void mark_maybe_object (Lisp_Object
);
396 static void mark_memory (void *, void *, int);
397 static void mem_init (void);
398 static struct mem_node
*mem_insert (void *, void *, enum mem_type
);
399 static void mem_insert_fixup (struct mem_node
*);
400 static void mem_rotate_left (struct mem_node
*);
401 static void mem_rotate_right (struct mem_node
*);
402 static void mem_delete (struct mem_node
*);
403 static void mem_delete_fixup (struct mem_node
*);
404 static inline struct mem_node
*mem_find (void *);
407 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
408 static void check_gcpros (void);
411 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
413 /* Recording what needs to be marked for gc. */
415 struct gcpro
*gcprolist
;
417 /* Addresses of staticpro'd variables. Initialize it to a nonzero
418 value; otherwise some compilers put it into BSS. */
420 #define NSTATICS 0x640
421 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
423 /* Index of next unused slot in staticvec. */
425 static int staticidx
= 0;
427 static POINTER_TYPE
*pure_alloc (size_t, int);
430 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
431 ALIGNMENT must be a power of 2. */
433 #define ALIGN(ptr, ALIGNMENT) \
434 ((POINTER_TYPE *) ((((uintptr_t) (ptr)) + (ALIGNMENT) - 1) \
435 & ~((ALIGNMENT) - 1)))
439 /************************************************************************
441 ************************************************************************/
443 /* Function malloc calls this if it finds we are near exhausting storage. */
446 malloc_warning (const char *str
)
448 pending_malloc_warning
= str
;
452 /* Display an already-pending malloc warning. */
455 display_malloc_warning (void)
457 call3 (intern ("display-warning"),
459 build_string (pending_malloc_warning
),
460 intern ("emergency"));
461 pending_malloc_warning
= 0;
464 /* Called if we can't allocate relocatable space for a buffer. */
467 buffer_memory_full (EMACS_INT nbytes
)
469 /* If buffers use the relocating allocator, no need to free
470 spare_memory, because we may have plenty of malloc space left
471 that we could get, and if we don't, the malloc that fails will
472 itself cause spare_memory to be freed. If buffers don't use the
473 relocating allocator, treat this like any other failing
477 memory_full (nbytes
);
480 /* This used to call error, but if we've run out of memory, we could
481 get infinite recursion trying to build the string. */
482 xsignal (Qnil
, Vmemory_signal_data
);
486 #ifndef XMALLOC_OVERRUN_CHECK
487 #define XMALLOC_OVERRUN_CHECK_OVERHEAD 0
490 /* Check for overrun in malloc'ed buffers by wrapping a header and trailer
493 The header consists of XMALLOC_OVERRUN_CHECK_SIZE fixed bytes
494 followed by XMALLOC_OVERRUN_SIZE_SIZE bytes containing the original
495 block size in little-endian order. The trailer consists of
496 XMALLOC_OVERRUN_CHECK_SIZE fixed bytes.
498 The header is used to detect whether this block has been allocated
499 through these functions, as some low-level libc functions may
500 bypass the malloc hooks. */
502 #define XMALLOC_OVERRUN_CHECK_SIZE 16
503 #define XMALLOC_OVERRUN_CHECK_OVERHEAD \
504 (2 * XMALLOC_OVERRUN_CHECK_SIZE + XMALLOC_OVERRUN_SIZE_SIZE)
506 /* Define XMALLOC_OVERRUN_SIZE_SIZE so that (1) it's large enough to
507 hold a size_t value and (2) the header size is a multiple of the
508 alignment that Emacs needs for C types and for USE_LSB_TAG. */
509 #define XMALLOC_BASE_ALIGNMENT \
512 union { long double d; intmax_t i; void *p; } u; \
517 /* A common multiple of the positive integers A and B. Ideally this
518 would be the least common multiple, but there's no way to do that
519 as a constant expression in C, so do the best that we can easily do. */
520 # define COMMON_MULTIPLE(a, b) \
521 ((a) % (b) == 0 ? (a) : (b) % (a) == 0 ? (b) : (a) * (b))
522 # define XMALLOC_HEADER_ALIGNMENT \
523 COMMON_MULTIPLE (1 << GCTYPEBITS, XMALLOC_BASE_ALIGNMENT)
525 # define XMALLOC_HEADER_ALIGNMENT XMALLOC_BASE_ALIGNMENT
527 #define XMALLOC_OVERRUN_SIZE_SIZE \
528 (((XMALLOC_OVERRUN_CHECK_SIZE + sizeof (size_t) \
529 + XMALLOC_HEADER_ALIGNMENT - 1) \
530 / XMALLOC_HEADER_ALIGNMENT * XMALLOC_HEADER_ALIGNMENT) \
531 - XMALLOC_OVERRUN_CHECK_SIZE)
533 static char const xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
] =
534 { '\x9a', '\x9b', '\xae', '\xaf',
535 '\xbf', '\xbe', '\xce', '\xcf',
536 '\xea', '\xeb', '\xec', '\xed',
537 '\xdf', '\xde', '\x9c', '\x9d' };
539 static char const xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
540 { '\xaa', '\xab', '\xac', '\xad',
541 '\xba', '\xbb', '\xbc', '\xbd',
542 '\xca', '\xcb', '\xcc', '\xcd',
543 '\xda', '\xdb', '\xdc', '\xdd' };
545 /* Insert and extract the block size in the header. */
548 xmalloc_put_size (unsigned char *ptr
, size_t size
)
551 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
553 *--ptr
= size
& ((1 << CHAR_BIT
) - 1);
559 xmalloc_get_size (unsigned char *ptr
)
563 ptr
-= XMALLOC_OVERRUN_SIZE_SIZE
;
564 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
573 /* The call depth in overrun_check functions. For example, this might happen:
575 overrun_check_malloc()
576 -> malloc -> (via hook)_-> emacs_blocked_malloc
577 -> overrun_check_malloc
578 call malloc (hooks are NULL, so real malloc is called).
579 malloc returns 10000.
580 add overhead, return 10016.
581 <- (back in overrun_check_malloc)
582 add overhead again, return 10032
583 xmalloc returns 10032.
588 overrun_check_free(10032)
590 free(10016) <- crash, because 10000 is the original pointer. */
592 static ptrdiff_t check_depth
;
594 /* Like malloc, but wraps allocated block with header and trailer. */
596 static POINTER_TYPE
*
597 overrun_check_malloc (size_t size
)
599 register unsigned char *val
;
600 int overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_OVERHEAD
: 0;
601 if (SIZE_MAX
- overhead
< size
)
604 val
= (unsigned char *) malloc (size
+ overhead
);
605 if (val
&& check_depth
== 1)
607 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
608 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
609 xmalloc_put_size (val
, size
);
610 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
611 XMALLOC_OVERRUN_CHECK_SIZE
);
614 return (POINTER_TYPE
*)val
;
618 /* Like realloc, but checks old block for overrun, and wraps new block
619 with header and trailer. */
621 static POINTER_TYPE
*
622 overrun_check_realloc (POINTER_TYPE
*block
, size_t size
)
624 register unsigned char *val
= (unsigned char *) block
;
625 int overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_OVERHEAD
: 0;
626 if (SIZE_MAX
- overhead
< size
)
631 && memcmp (xmalloc_overrun_check_header
,
632 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
633 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
635 size_t osize
= xmalloc_get_size (val
);
636 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
637 XMALLOC_OVERRUN_CHECK_SIZE
))
639 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
640 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
641 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
644 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
646 if (val
&& check_depth
== 1)
648 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
649 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
650 xmalloc_put_size (val
, size
);
651 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
652 XMALLOC_OVERRUN_CHECK_SIZE
);
655 return (POINTER_TYPE
*)val
;
658 /* Like free, but checks block for overrun. */
661 overrun_check_free (POINTER_TYPE
*block
)
663 unsigned char *val
= (unsigned char *) block
;
668 && memcmp (xmalloc_overrun_check_header
,
669 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
670 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
672 size_t osize
= xmalloc_get_size (val
);
673 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
674 XMALLOC_OVERRUN_CHECK_SIZE
))
676 #ifdef XMALLOC_CLEAR_FREE_MEMORY
677 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
678 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
680 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
681 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
682 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
693 #define malloc overrun_check_malloc
694 #define realloc overrun_check_realloc
695 #define free overrun_check_free
699 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
700 there's no need to block input around malloc. */
701 #define MALLOC_BLOCK_INPUT ((void)0)
702 #define MALLOC_UNBLOCK_INPUT ((void)0)
704 #define MALLOC_BLOCK_INPUT BLOCK_INPUT
705 #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT
708 /* Like malloc but check for no memory and block interrupt input.. */
711 xmalloc (size_t size
)
713 register POINTER_TYPE
*val
;
716 val
= (POINTER_TYPE
*) malloc (size
);
717 MALLOC_UNBLOCK_INPUT
;
725 /* Like realloc but check for no memory and block interrupt input.. */
728 xrealloc (POINTER_TYPE
*block
, size_t size
)
730 register POINTER_TYPE
*val
;
733 /* We must call malloc explicitly when BLOCK is 0, since some
734 reallocs don't do this. */
736 val
= (POINTER_TYPE
*) malloc (size
);
738 val
= (POINTER_TYPE
*) realloc (block
, size
);
739 MALLOC_UNBLOCK_INPUT
;
747 /* Like free but block interrupt input. */
750 xfree (POINTER_TYPE
*block
)
756 MALLOC_UNBLOCK_INPUT
;
757 /* We don't call refill_memory_reserve here
758 because that duplicates doing so in emacs_blocked_free
759 and the criterion should go there. */
763 /* Other parts of Emacs pass large int values to allocator functions
764 expecting ptrdiff_t. This is portable in practice, but check it to
766 verify (INT_MAX
<= PTRDIFF_MAX
);
769 /* Allocate an array of NITEMS items, each of size ITEM_SIZE.
770 Signal an error on memory exhaustion, and block interrupt input. */
773 xnmalloc (ptrdiff_t nitems
, ptrdiff_t item_size
)
775 xassert (0 <= nitems
&& 0 < item_size
);
776 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
777 memory_full (SIZE_MAX
);
778 return xmalloc (nitems
* item_size
);
782 /* Reallocate an array PA to make it of NITEMS items, each of size ITEM_SIZE.
783 Signal an error on memory exhaustion, and block interrupt input. */
786 xnrealloc (void *pa
, ptrdiff_t nitems
, ptrdiff_t item_size
)
788 xassert (0 <= nitems
&& 0 < item_size
);
789 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
790 memory_full (SIZE_MAX
);
791 return xrealloc (pa
, nitems
* item_size
);
795 /* Grow PA, which points to an array of *NITEMS items, and return the
796 location of the reallocated array, updating *NITEMS to reflect its
797 new size. The new array will contain at least NITEMS_INCR_MIN more
798 items, but will not contain more than NITEMS_MAX items total.
799 ITEM_SIZE is the size of each item, in bytes.
801 ITEM_SIZE and NITEMS_INCR_MIN must be positive. *NITEMS must be
802 nonnegative. If NITEMS_MAX is -1, it is treated as if it were
805 If PA is null, then allocate a new array instead of reallocating
806 the old one. Thus, to grow an array A without saving its old
807 contents, invoke xfree (A) immediately followed by xgrowalloc (0,
810 Block interrupt input as needed. If memory exhaustion occurs, set
811 *NITEMS to zero if PA is null, and signal an error (i.e., do not
815 xpalloc (void *pa
, ptrdiff_t *nitems
, ptrdiff_t nitems_incr_min
,
816 ptrdiff_t nitems_max
, ptrdiff_t item_size
)
818 /* The approximate size to use for initial small allocation
819 requests. This is the largest "small" request for the GNU C
821 enum { DEFAULT_MXFAST
= 64 * sizeof (size_t) / 4 };
823 /* If the array is tiny, grow it to about (but no greater than)
824 DEFAULT_MXFAST bytes. Otherwise, grow it by about 50%. */
825 ptrdiff_t n
= *nitems
;
826 ptrdiff_t tiny_max
= DEFAULT_MXFAST
/ item_size
- n
;
827 ptrdiff_t half_again
= n
>> 1;
828 ptrdiff_t incr_estimate
= max (tiny_max
, half_again
);
830 /* Adjust the increment according to three constraints: NITEMS_INCR_MIN,
831 NITEMS_MAX, and what the C language can represent safely. */
832 ptrdiff_t C_language_max
= min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
;
833 ptrdiff_t n_max
= (0 <= nitems_max
&& nitems_max
< C_language_max
834 ? nitems_max
: C_language_max
);
835 ptrdiff_t nitems_incr_max
= n_max
- n
;
836 ptrdiff_t incr
= max (nitems_incr_min
, min (incr_estimate
, nitems_incr_max
));
838 xassert (0 < item_size
&& 0 < nitems_incr_min
&& 0 <= n
&& -1 <= nitems_max
);
841 if (nitems_incr_max
< incr
)
842 memory_full (SIZE_MAX
);
844 pa
= xrealloc (pa
, n
* item_size
);
850 /* Like strdup, but uses xmalloc. */
853 xstrdup (const char *s
)
855 size_t len
= strlen (s
) + 1;
856 char *p
= (char *) xmalloc (len
);
862 /* Unwind for SAFE_ALLOCA */
865 safe_alloca_unwind (Lisp_Object arg
)
867 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
877 /* Like malloc but used for allocating Lisp data. NBYTES is the
878 number of bytes to allocate, TYPE describes the intended use of the
879 allcated memory block (for strings, for conses, ...). */
882 static void *lisp_malloc_loser
;
885 static POINTER_TYPE
*
886 lisp_malloc (size_t nbytes
, enum mem_type type
)
892 #ifdef GC_MALLOC_CHECK
893 allocated_mem_type
= type
;
896 val
= (void *) malloc (nbytes
);
899 /* If the memory just allocated cannot be addressed thru a Lisp
900 object's pointer, and it needs to be,
901 that's equivalent to running out of memory. */
902 if (val
&& type
!= MEM_TYPE_NON_LISP
)
905 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
906 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
908 lisp_malloc_loser
= val
;
915 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
916 if (val
&& type
!= MEM_TYPE_NON_LISP
)
917 mem_insert (val
, (char *) val
+ nbytes
, type
);
920 MALLOC_UNBLOCK_INPUT
;
922 memory_full (nbytes
);
926 /* Free BLOCK. This must be called to free memory allocated with a
927 call to lisp_malloc. */
930 lisp_free (POINTER_TYPE
*block
)
934 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
935 mem_delete (mem_find (block
));
937 MALLOC_UNBLOCK_INPUT
;
940 /* Allocation of aligned blocks of memory to store Lisp data. */
941 /* The entry point is lisp_align_malloc which returns blocks of at most */
942 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
944 /* Use posix_memalloc if the system has it and we're using the system's
945 malloc (because our gmalloc.c routines don't have posix_memalign although
946 its memalloc could be used). */
947 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
948 #define USE_POSIX_MEMALIGN 1
951 /* BLOCK_ALIGN has to be a power of 2. */
952 #define BLOCK_ALIGN (1 << 10)
954 /* Padding to leave at the end of a malloc'd block. This is to give
955 malloc a chance to minimize the amount of memory wasted to alignment.
956 It should be tuned to the particular malloc library used.
957 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
958 posix_memalign on the other hand would ideally prefer a value of 4
959 because otherwise, there's 1020 bytes wasted between each ablocks.
960 In Emacs, testing shows that those 1020 can most of the time be
961 efficiently used by malloc to place other objects, so a value of 0 can
962 still preferable unless you have a lot of aligned blocks and virtually
964 #define BLOCK_PADDING 0
965 #define BLOCK_BYTES \
966 (BLOCK_ALIGN - sizeof (struct ablocks *) - BLOCK_PADDING)
968 /* Internal data structures and constants. */
970 #define ABLOCKS_SIZE 16
972 /* An aligned block of memory. */
977 char payload
[BLOCK_BYTES
];
978 struct ablock
*next_free
;
980 /* `abase' is the aligned base of the ablocks. */
981 /* It is overloaded to hold the virtual `busy' field that counts
982 the number of used ablock in the parent ablocks.
983 The first ablock has the `busy' field, the others have the `abase'
984 field. To tell the difference, we assume that pointers will have
985 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
986 is used to tell whether the real base of the parent ablocks is `abase'
987 (if not, the word before the first ablock holds a pointer to the
989 struct ablocks
*abase
;
990 /* The padding of all but the last ablock is unused. The padding of
991 the last ablock in an ablocks is not allocated. */
993 char padding
[BLOCK_PADDING
];
997 /* A bunch of consecutive aligned blocks. */
1000 struct ablock blocks
[ABLOCKS_SIZE
];
1003 /* Size of the block requested from malloc or memalign. */
1004 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
1006 #define ABLOCK_ABASE(block) \
1007 (((uintptr_t) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
1008 ? (struct ablocks *)(block) \
1011 /* Virtual `busy' field. */
1012 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
1014 /* Pointer to the (not necessarily aligned) malloc block. */
1015 #ifdef USE_POSIX_MEMALIGN
1016 #define ABLOCKS_BASE(abase) (abase)
1018 #define ABLOCKS_BASE(abase) \
1019 (1 & (intptr_t) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
1022 /* The list of free ablock. */
1023 static struct ablock
*free_ablock
;
1025 /* Allocate an aligned block of nbytes.
1026 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
1027 smaller or equal to BLOCK_BYTES. */
1028 static POINTER_TYPE
*
1029 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
1032 struct ablocks
*abase
;
1034 eassert (nbytes
<= BLOCK_BYTES
);
1038 #ifdef GC_MALLOC_CHECK
1039 allocated_mem_type
= type
;
1045 intptr_t aligned
; /* int gets warning casting to 64-bit pointer. */
1047 #ifdef DOUG_LEA_MALLOC
1048 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1049 because mapped region contents are not preserved in
1051 mallopt (M_MMAP_MAX
, 0);
1054 #ifdef USE_POSIX_MEMALIGN
1056 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1062 base
= malloc (ABLOCKS_BYTES
);
1063 abase
= ALIGN (base
, BLOCK_ALIGN
);
1068 MALLOC_UNBLOCK_INPUT
;
1069 memory_full (ABLOCKS_BYTES
);
1072 aligned
= (base
== abase
);
1074 ((void**)abase
)[-1] = base
;
1076 #ifdef DOUG_LEA_MALLOC
1077 /* Back to a reasonable maximum of mmap'ed areas. */
1078 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1082 /* If the memory just allocated cannot be addressed thru a Lisp
1083 object's pointer, and it needs to be, that's equivalent to
1084 running out of memory. */
1085 if (type
!= MEM_TYPE_NON_LISP
)
1088 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1089 XSETCONS (tem
, end
);
1090 if ((char *) XCONS (tem
) != end
)
1092 lisp_malloc_loser
= base
;
1094 MALLOC_UNBLOCK_INPUT
;
1095 memory_full (SIZE_MAX
);
1100 /* Initialize the blocks and put them on the free list.
1101 Is `base' was not properly aligned, we can't use the last block. */
1102 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1104 abase
->blocks
[i
].abase
= abase
;
1105 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1106 free_ablock
= &abase
->blocks
[i
];
1108 ABLOCKS_BUSY (abase
) = (struct ablocks
*) aligned
;
1110 eassert (0 == ((uintptr_t) abase
) % BLOCK_ALIGN
);
1111 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1112 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1113 eassert (ABLOCKS_BASE (abase
) == base
);
1114 eassert (aligned
== (intptr_t) ABLOCKS_BUSY (abase
));
1117 abase
= ABLOCK_ABASE (free_ablock
);
1118 ABLOCKS_BUSY (abase
) =
1119 (struct ablocks
*) (2 + (intptr_t) ABLOCKS_BUSY (abase
));
1121 free_ablock
= free_ablock
->x
.next_free
;
1123 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1124 if (type
!= MEM_TYPE_NON_LISP
)
1125 mem_insert (val
, (char *) val
+ nbytes
, type
);
1128 MALLOC_UNBLOCK_INPUT
;
1130 eassert (0 == ((uintptr_t) val
) % BLOCK_ALIGN
);
1135 lisp_align_free (POINTER_TYPE
*block
)
1137 struct ablock
*ablock
= block
;
1138 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1141 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1142 mem_delete (mem_find (block
));
1144 /* Put on free list. */
1145 ablock
->x
.next_free
= free_ablock
;
1146 free_ablock
= ablock
;
1147 /* Update busy count. */
1148 ABLOCKS_BUSY (abase
) =
1149 (struct ablocks
*) (-2 + (intptr_t) ABLOCKS_BUSY (abase
));
1151 if (2 > (intptr_t) ABLOCKS_BUSY (abase
))
1152 { /* All the blocks are free. */
1153 int i
= 0, aligned
= (intptr_t) ABLOCKS_BUSY (abase
);
1154 struct ablock
**tem
= &free_ablock
;
1155 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1159 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1162 *tem
= (*tem
)->x
.next_free
;
1165 tem
= &(*tem
)->x
.next_free
;
1167 eassert ((aligned
& 1) == aligned
);
1168 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1169 #ifdef USE_POSIX_MEMALIGN
1170 eassert ((uintptr_t) ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1172 free (ABLOCKS_BASE (abase
));
1174 MALLOC_UNBLOCK_INPUT
;
1177 /* Return a new buffer structure allocated from the heap with
1178 a call to lisp_malloc. */
1181 allocate_buffer (void)
1184 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1186 XSETPVECTYPESIZE (b
, PVEC_BUFFER
,
1187 ((sizeof (struct buffer
) + sizeof (EMACS_INT
) - 1)
1188 / sizeof (EMACS_INT
)));
1193 #ifndef SYSTEM_MALLOC
1195 /* Arranging to disable input signals while we're in malloc.
1197 This only works with GNU malloc. To help out systems which can't
1198 use GNU malloc, all the calls to malloc, realloc, and free
1199 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1200 pair; unfortunately, we have no idea what C library functions
1201 might call malloc, so we can't really protect them unless you're
1202 using GNU malloc. Fortunately, most of the major operating systems
1203 can use GNU malloc. */
1206 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
1207 there's no need to block input around malloc. */
1209 #ifndef DOUG_LEA_MALLOC
1210 extern void * (*__malloc_hook
) (size_t, const void *);
1211 extern void * (*__realloc_hook
) (void *, size_t, const void *);
1212 extern void (*__free_hook
) (void *, const void *);
1213 /* Else declared in malloc.h, perhaps with an extra arg. */
1214 #endif /* DOUG_LEA_MALLOC */
1215 static void * (*old_malloc_hook
) (size_t, const void *);
1216 static void * (*old_realloc_hook
) (void *, size_t, const void*);
1217 static void (*old_free_hook
) (void*, const void*);
1219 #ifdef DOUG_LEA_MALLOC
1220 # define BYTES_USED (mallinfo ().uordblks)
1222 # define BYTES_USED _bytes_used
1225 static size_t bytes_used_when_reconsidered
;
1227 /* Value of _bytes_used, when spare_memory was freed. */
1229 static size_t bytes_used_when_full
;
1231 /* This function is used as the hook for free to call. */
1234 emacs_blocked_free (void *ptr
, const void *ptr2
)
1238 #ifdef GC_MALLOC_CHECK
1244 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1247 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1252 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1256 #endif /* GC_MALLOC_CHECK */
1258 __free_hook
= old_free_hook
;
1261 /* If we released our reserve (due to running out of memory),
1262 and we have a fair amount free once again,
1263 try to set aside another reserve in case we run out once more. */
1264 if (! NILP (Vmemory_full
)
1265 /* Verify there is enough space that even with the malloc
1266 hysteresis this call won't run out again.
1267 The code here is correct as long as SPARE_MEMORY
1268 is substantially larger than the block size malloc uses. */
1269 && (bytes_used_when_full
1270 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1271 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1272 refill_memory_reserve ();
1274 __free_hook
= emacs_blocked_free
;
1275 UNBLOCK_INPUT_ALLOC
;
1279 /* This function is the malloc hook that Emacs uses. */
1282 emacs_blocked_malloc (size_t size
, const void *ptr
)
1287 __malloc_hook
= old_malloc_hook
;
1288 #ifdef DOUG_LEA_MALLOC
1289 /* Segfaults on my system. --lorentey */
1290 /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */
1292 __malloc_extra_blocks
= malloc_hysteresis
;
1295 value
= (void *) malloc (size
);
1297 #ifdef GC_MALLOC_CHECK
1299 struct mem_node
*m
= mem_find (value
);
1302 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1304 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1305 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1310 if (!dont_register_blocks
)
1312 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1313 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1316 #endif /* GC_MALLOC_CHECK */
1318 __malloc_hook
= emacs_blocked_malloc
;
1319 UNBLOCK_INPUT_ALLOC
;
1321 /* fprintf (stderr, "%p malloc\n", value); */
1326 /* This function is the realloc hook that Emacs uses. */
1329 emacs_blocked_realloc (void *ptr
, size_t size
, const void *ptr2
)
1334 __realloc_hook
= old_realloc_hook
;
1336 #ifdef GC_MALLOC_CHECK
1339 struct mem_node
*m
= mem_find (ptr
);
1340 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1343 "Realloc of %p which wasn't allocated with malloc\n",
1351 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1353 /* Prevent malloc from registering blocks. */
1354 dont_register_blocks
= 1;
1355 #endif /* GC_MALLOC_CHECK */
1357 value
= (void *) realloc (ptr
, size
);
1359 #ifdef GC_MALLOC_CHECK
1360 dont_register_blocks
= 0;
1363 struct mem_node
*m
= mem_find (value
);
1366 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1370 /* Can't handle zero size regions in the red-black tree. */
1371 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1374 /* fprintf (stderr, "%p <- realloc\n", value); */
1375 #endif /* GC_MALLOC_CHECK */
1377 __realloc_hook
= emacs_blocked_realloc
;
1378 UNBLOCK_INPUT_ALLOC
;
1385 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1386 normal malloc. Some thread implementations need this as they call
1387 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1388 calls malloc because it is the first call, and we have an endless loop. */
1391 reset_malloc_hooks (void)
1393 __free_hook
= old_free_hook
;
1394 __malloc_hook
= old_malloc_hook
;
1395 __realloc_hook
= old_realloc_hook
;
1397 #endif /* HAVE_PTHREAD */
1400 /* Called from main to set up malloc to use our hooks. */
1403 uninterrupt_malloc (void)
1406 #ifdef DOUG_LEA_MALLOC
1407 pthread_mutexattr_t attr
;
1409 /* GLIBC has a faster way to do this, but lets keep it portable.
1410 This is according to the Single UNIX Specification. */
1411 pthread_mutexattr_init (&attr
);
1412 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1413 pthread_mutex_init (&alloc_mutex
, &attr
);
1414 #else /* !DOUG_LEA_MALLOC */
1415 /* Some systems such as Solaris 2.6 don't have a recursive mutex,
1416 and the bundled gmalloc.c doesn't require it. */
1417 pthread_mutex_init (&alloc_mutex
, NULL
);
1418 #endif /* !DOUG_LEA_MALLOC */
1419 #endif /* HAVE_PTHREAD */
1421 if (__free_hook
!= emacs_blocked_free
)
1422 old_free_hook
= __free_hook
;
1423 __free_hook
= emacs_blocked_free
;
1425 if (__malloc_hook
!= emacs_blocked_malloc
)
1426 old_malloc_hook
= __malloc_hook
;
1427 __malloc_hook
= emacs_blocked_malloc
;
1429 if (__realloc_hook
!= emacs_blocked_realloc
)
1430 old_realloc_hook
= __realloc_hook
;
1431 __realloc_hook
= emacs_blocked_realloc
;
1434 #endif /* not SYNC_INPUT */
1435 #endif /* not SYSTEM_MALLOC */
1439 /***********************************************************************
1441 ***********************************************************************/
1443 /* Number of intervals allocated in an interval_block structure.
1444 The 1020 is 1024 minus malloc overhead. */
1446 #define INTERVAL_BLOCK_SIZE \
1447 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1449 /* Intervals are allocated in chunks in form of an interval_block
1452 struct interval_block
1454 /* Place `intervals' first, to preserve alignment. */
1455 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1456 struct interval_block
*next
;
1459 /* Current interval block. Its `next' pointer points to older
1462 static struct interval_block
*interval_block
;
1464 /* Index in interval_block above of the next unused interval
1467 static int interval_block_index
;
1469 /* Number of free and live intervals. */
1471 static EMACS_INT total_free_intervals
, total_intervals
;
1473 /* List of free intervals. */
1475 static INTERVAL interval_free_list
;
1478 /* Initialize interval allocation. */
1481 init_intervals (void)
1483 interval_block
= NULL
;
1484 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1485 interval_free_list
= 0;
1489 /* Return a new interval. */
1492 make_interval (void)
1496 /* eassert (!handling_signal); */
1500 if (interval_free_list
)
1502 val
= interval_free_list
;
1503 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1507 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1509 register struct interval_block
*newi
;
1511 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1514 newi
->next
= interval_block
;
1515 interval_block
= newi
;
1516 interval_block_index
= 0;
1518 val
= &interval_block
->intervals
[interval_block_index
++];
1521 MALLOC_UNBLOCK_INPUT
;
1523 consing_since_gc
+= sizeof (struct interval
);
1525 RESET_INTERVAL (val
);
1531 /* Mark Lisp objects in interval I. */
1534 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1536 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1538 mark_object (i
->plist
);
1542 /* Mark the interval tree rooted in TREE. Don't call this directly;
1543 use the macro MARK_INTERVAL_TREE instead. */
1546 mark_interval_tree (register INTERVAL tree
)
1548 /* No need to test if this tree has been marked already; this
1549 function is always called through the MARK_INTERVAL_TREE macro,
1550 which takes care of that. */
1552 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1556 /* Mark the interval tree rooted in I. */
1558 #define MARK_INTERVAL_TREE(i) \
1560 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1561 mark_interval_tree (i); \
1565 #define UNMARK_BALANCE_INTERVALS(i) \
1567 if (! NULL_INTERVAL_P (i)) \
1568 (i) = balance_intervals (i); \
1572 /* Number support. If USE_LISP_UNION_TYPE is in effect, we
1573 can't create number objects in macros. */
1576 make_number (EMACS_INT n
)
1580 obj
.s
.type
= Lisp_Int
;
1585 /***********************************************************************
1587 ***********************************************************************/
1589 /* Lisp_Strings are allocated in string_block structures. When a new
1590 string_block is allocated, all the Lisp_Strings it contains are
1591 added to a free-list string_free_list. When a new Lisp_String is
1592 needed, it is taken from that list. During the sweep phase of GC,
1593 string_blocks that are entirely free are freed, except two which
1596 String data is allocated from sblock structures. Strings larger
1597 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1598 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1600 Sblocks consist internally of sdata structures, one for each
1601 Lisp_String. The sdata structure points to the Lisp_String it
1602 belongs to. The Lisp_String points back to the `u.data' member of
1603 its sdata structure.
1605 When a Lisp_String is freed during GC, it is put back on
1606 string_free_list, and its `data' member and its sdata's `string'
1607 pointer is set to null. The size of the string is recorded in the
1608 `u.nbytes' member of the sdata. So, sdata structures that are no
1609 longer used, can be easily recognized, and it's easy to compact the
1610 sblocks of small strings which we do in compact_small_strings. */
1612 /* Size in bytes of an sblock structure used for small strings. This
1613 is 8192 minus malloc overhead. */
1615 #define SBLOCK_SIZE 8188
1617 /* Strings larger than this are considered large strings. String data
1618 for large strings is allocated from individual sblocks. */
1620 #define LARGE_STRING_BYTES 1024
1622 /* Structure describing string memory sub-allocated from an sblock.
1623 This is where the contents of Lisp strings are stored. */
1627 /* Back-pointer to the string this sdata belongs to. If null, this
1628 structure is free, and the NBYTES member of the union below
1629 contains the string's byte size (the same value that STRING_BYTES
1630 would return if STRING were non-null). If non-null, STRING_BYTES
1631 (STRING) is the size of the data, and DATA contains the string's
1633 struct Lisp_String
*string
;
1635 #ifdef GC_CHECK_STRING_BYTES
1638 unsigned char data
[1];
1640 #define SDATA_NBYTES(S) (S)->nbytes
1641 #define SDATA_DATA(S) (S)->data
1642 #define SDATA_SELECTOR(member) member
1644 #else /* not GC_CHECK_STRING_BYTES */
1648 /* When STRING is non-null. */
1649 unsigned char data
[1];
1651 /* When STRING is null. */
1655 #define SDATA_NBYTES(S) (S)->u.nbytes
1656 #define SDATA_DATA(S) (S)->u.data
1657 #define SDATA_SELECTOR(member) u.member
1659 #endif /* not GC_CHECK_STRING_BYTES */
1661 #define SDATA_DATA_OFFSET offsetof (struct sdata, SDATA_SELECTOR (data))
1665 /* Structure describing a block of memory which is sub-allocated to
1666 obtain string data memory for strings. Blocks for small strings
1667 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1668 as large as needed. */
1673 struct sblock
*next
;
1675 /* Pointer to the next free sdata block. This points past the end
1676 of the sblock if there isn't any space left in this block. */
1677 struct sdata
*next_free
;
1679 /* Start of data. */
1680 struct sdata first_data
;
1683 /* Number of Lisp strings in a string_block structure. The 1020 is
1684 1024 minus malloc overhead. */
1686 #define STRING_BLOCK_SIZE \
1687 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1689 /* Structure describing a block from which Lisp_String structures
1694 /* Place `strings' first, to preserve alignment. */
1695 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1696 struct string_block
*next
;
1699 /* Head and tail of the list of sblock structures holding Lisp string
1700 data. We always allocate from current_sblock. The NEXT pointers
1701 in the sblock structures go from oldest_sblock to current_sblock. */
1703 static struct sblock
*oldest_sblock
, *current_sblock
;
1705 /* List of sblocks for large strings. */
1707 static struct sblock
*large_sblocks
;
1709 /* List of string_block structures. */
1711 static struct string_block
*string_blocks
;
1713 /* Free-list of Lisp_Strings. */
1715 static struct Lisp_String
*string_free_list
;
1717 /* Number of live and free Lisp_Strings. */
1719 static EMACS_INT total_strings
, total_free_strings
;
1721 /* Number of bytes used by live strings. */
1723 static EMACS_INT total_string_size
;
1725 /* Given a pointer to a Lisp_String S which is on the free-list
1726 string_free_list, return a pointer to its successor in the
1729 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1731 /* Return a pointer to the sdata structure belonging to Lisp string S.
1732 S must be live, i.e. S->data must not be null. S->data is actually
1733 a pointer to the `u.data' member of its sdata structure; the
1734 structure starts at a constant offset in front of that. */
1736 #define SDATA_OF_STRING(S) ((struct sdata *) ((S)->data - SDATA_DATA_OFFSET))
1739 #ifdef GC_CHECK_STRING_OVERRUN
1741 /* We check for overrun in string data blocks by appending a small
1742 "cookie" after each allocated string data block, and check for the
1743 presence of this cookie during GC. */
1745 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1746 static char const string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1747 { '\xde', '\xad', '\xbe', '\xef' };
1750 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1753 /* Value is the size of an sdata structure large enough to hold NBYTES
1754 bytes of string data. The value returned includes a terminating
1755 NUL byte, the size of the sdata structure, and padding. */
1757 #ifdef GC_CHECK_STRING_BYTES
1759 #define SDATA_SIZE(NBYTES) \
1760 ((SDATA_DATA_OFFSET \
1762 + sizeof (EMACS_INT) - 1) \
1763 & ~(sizeof (EMACS_INT) - 1))
1765 #else /* not GC_CHECK_STRING_BYTES */
1767 /* The 'max' reserves space for the nbytes union member even when NBYTES + 1 is
1768 less than the size of that member. The 'max' is not needed when
1769 SDATA_DATA_OFFSET is a multiple of sizeof (EMACS_INT), because then the
1770 alignment code reserves enough space. */
1772 #define SDATA_SIZE(NBYTES) \
1773 ((SDATA_DATA_OFFSET \
1774 + (SDATA_DATA_OFFSET % sizeof (EMACS_INT) == 0 \
1776 : max (NBYTES, sizeof (EMACS_INT) - 1)) \
1778 + sizeof (EMACS_INT) - 1) \
1779 & ~(sizeof (EMACS_INT) - 1))
1781 #endif /* not GC_CHECK_STRING_BYTES */
1783 /* Extra bytes to allocate for each string. */
1785 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1787 /* Exact bound on the number of bytes in a string, not counting the
1788 terminating null. A string cannot contain more bytes than
1789 STRING_BYTES_BOUND, nor can it be so long that the size_t
1790 arithmetic in allocate_string_data would overflow while it is
1791 calculating a value to be passed to malloc. */
1792 #define STRING_BYTES_MAX \
1793 min (STRING_BYTES_BOUND, \
1794 ((SIZE_MAX - XMALLOC_OVERRUN_CHECK_OVERHEAD \
1796 - offsetof (struct sblock, first_data) \
1797 - SDATA_DATA_OFFSET) \
1798 & ~(sizeof (EMACS_INT) - 1)))
1800 /* Initialize string allocation. Called from init_alloc_once. */
1805 total_strings
= total_free_strings
= total_string_size
= 0;
1806 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1807 string_blocks
= NULL
;
1808 string_free_list
= NULL
;
1809 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1810 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1814 #ifdef GC_CHECK_STRING_BYTES
1816 static int check_string_bytes_count
;
1818 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1821 /* Like GC_STRING_BYTES, but with debugging check. */
1824 string_bytes (struct Lisp_String
*s
)
1827 (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1829 if (!PURE_POINTER_P (s
)
1831 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1836 /* Check validity of Lisp strings' string_bytes member in B. */
1839 check_sblock (struct sblock
*b
)
1841 struct sdata
*from
, *end
, *from_end
;
1845 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1847 /* Compute the next FROM here because copying below may
1848 overwrite data we need to compute it. */
1851 /* Check that the string size recorded in the string is the
1852 same as the one recorded in the sdata structure. */
1854 CHECK_STRING_BYTES (from
->string
);
1857 nbytes
= GC_STRING_BYTES (from
->string
);
1859 nbytes
= SDATA_NBYTES (from
);
1861 nbytes
= SDATA_SIZE (nbytes
);
1862 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1867 /* Check validity of Lisp strings' string_bytes member. ALL_P
1868 non-zero means check all strings, otherwise check only most
1869 recently allocated strings. Used for hunting a bug. */
1872 check_string_bytes (int all_p
)
1878 for (b
= large_sblocks
; b
; b
= b
->next
)
1880 struct Lisp_String
*s
= b
->first_data
.string
;
1882 CHECK_STRING_BYTES (s
);
1885 for (b
= oldest_sblock
; b
; b
= b
->next
)
1889 check_sblock (current_sblock
);
1892 #endif /* GC_CHECK_STRING_BYTES */
1894 #ifdef GC_CHECK_STRING_FREE_LIST
1896 /* Walk through the string free list looking for bogus next pointers.
1897 This may catch buffer overrun from a previous string. */
1900 check_string_free_list (void)
1902 struct Lisp_String
*s
;
1904 /* Pop a Lisp_String off the free-list. */
1905 s
= string_free_list
;
1908 if ((uintptr_t) s
< 1024)
1910 s
= NEXT_FREE_LISP_STRING (s
);
1914 #define check_string_free_list()
1917 /* Return a new Lisp_String. */
1919 static struct Lisp_String
*
1920 allocate_string (void)
1922 struct Lisp_String
*s
;
1924 /* eassert (!handling_signal); */
1928 /* If the free-list is empty, allocate a new string_block, and
1929 add all the Lisp_Strings in it to the free-list. */
1930 if (string_free_list
== NULL
)
1932 struct string_block
*b
;
1935 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1936 memset (b
, 0, sizeof *b
);
1937 b
->next
= string_blocks
;
1940 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1943 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1944 string_free_list
= s
;
1947 total_free_strings
+= STRING_BLOCK_SIZE
;
1950 check_string_free_list ();
1952 /* Pop a Lisp_String off the free-list. */
1953 s
= string_free_list
;
1954 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1956 MALLOC_UNBLOCK_INPUT
;
1958 /* Probably not strictly necessary, but play it safe. */
1959 memset (s
, 0, sizeof *s
);
1961 --total_free_strings
;
1964 consing_since_gc
+= sizeof *s
;
1966 #ifdef GC_CHECK_STRING_BYTES
1967 if (!noninteractive
)
1969 if (++check_string_bytes_count
== 200)
1971 check_string_bytes_count
= 0;
1972 check_string_bytes (1);
1975 check_string_bytes (0);
1977 #endif /* GC_CHECK_STRING_BYTES */
1983 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1984 plus a NUL byte at the end. Allocate an sdata structure for S, and
1985 set S->data to its `u.data' member. Store a NUL byte at the end of
1986 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1987 S->data if it was initially non-null. */
1990 allocate_string_data (struct Lisp_String
*s
,
1991 EMACS_INT nchars
, EMACS_INT nbytes
)
1993 struct sdata
*data
, *old_data
;
1995 EMACS_INT needed
, old_nbytes
;
1997 if (STRING_BYTES_MAX
< nbytes
)
2000 /* Determine the number of bytes needed to store NBYTES bytes
2002 needed
= SDATA_SIZE (nbytes
);
2003 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
2004 old_nbytes
= GC_STRING_BYTES (s
);
2008 if (nbytes
> LARGE_STRING_BYTES
)
2010 size_t size
= offsetof (struct sblock
, first_data
) + needed
;
2012 #ifdef DOUG_LEA_MALLOC
2013 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2014 because mapped region contents are not preserved in
2017 In case you think of allowing it in a dumped Emacs at the
2018 cost of not being able to re-dump, there's another reason:
2019 mmap'ed data typically have an address towards the top of the
2020 address space, which won't fit into an EMACS_INT (at least on
2021 32-bit systems with the current tagging scheme). --fx */
2022 mallopt (M_MMAP_MAX
, 0);
2025 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
2027 #ifdef DOUG_LEA_MALLOC
2028 /* Back to a reasonable maximum of mmap'ed areas. */
2029 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2032 b
->next_free
= &b
->first_data
;
2033 b
->first_data
.string
= NULL
;
2034 b
->next
= large_sblocks
;
2037 else if (current_sblock
== NULL
2038 || (((char *) current_sblock
+ SBLOCK_SIZE
2039 - (char *) current_sblock
->next_free
)
2040 < (needed
+ GC_STRING_EXTRA
)))
2042 /* Not enough room in the current sblock. */
2043 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
2044 b
->next_free
= &b
->first_data
;
2045 b
->first_data
.string
= NULL
;
2049 current_sblock
->next
= b
;
2057 data
= b
->next_free
;
2058 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
2060 MALLOC_UNBLOCK_INPUT
;
2063 s
->data
= SDATA_DATA (data
);
2064 #ifdef GC_CHECK_STRING_BYTES
2065 SDATA_NBYTES (data
) = nbytes
;
2068 s
->size_byte
= nbytes
;
2069 s
->data
[nbytes
] = '\0';
2070 #ifdef GC_CHECK_STRING_OVERRUN
2071 memcpy ((char *) data
+ needed
, string_overrun_cookie
,
2072 GC_STRING_OVERRUN_COOKIE_SIZE
);
2075 /* If S had already data assigned, mark that as free by setting its
2076 string back-pointer to null, and recording the size of the data
2080 SDATA_NBYTES (old_data
) = old_nbytes
;
2081 old_data
->string
= NULL
;
2084 consing_since_gc
+= needed
;
2088 /* Sweep and compact strings. */
2091 sweep_strings (void)
2093 struct string_block
*b
, *next
;
2094 struct string_block
*live_blocks
= NULL
;
2096 string_free_list
= NULL
;
2097 total_strings
= total_free_strings
= 0;
2098 total_string_size
= 0;
2100 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2101 for (b
= string_blocks
; b
; b
= next
)
2104 struct Lisp_String
*free_list_before
= string_free_list
;
2108 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2110 struct Lisp_String
*s
= b
->strings
+ i
;
2114 /* String was not on free-list before. */
2115 if (STRING_MARKED_P (s
))
2117 /* String is live; unmark it and its intervals. */
2120 if (!NULL_INTERVAL_P (s
->intervals
))
2121 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2124 total_string_size
+= STRING_BYTES (s
);
2128 /* String is dead. Put it on the free-list. */
2129 struct sdata
*data
= SDATA_OF_STRING (s
);
2131 /* Save the size of S in its sdata so that we know
2132 how large that is. Reset the sdata's string
2133 back-pointer so that we know it's free. */
2134 #ifdef GC_CHECK_STRING_BYTES
2135 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2138 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2140 data
->string
= NULL
;
2142 /* Reset the strings's `data' member so that we
2146 /* Put the string on the free-list. */
2147 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2148 string_free_list
= s
;
2154 /* S was on the free-list before. Put it there again. */
2155 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2156 string_free_list
= s
;
2161 /* Free blocks that contain free Lisp_Strings only, except
2162 the first two of them. */
2163 if (nfree
== STRING_BLOCK_SIZE
2164 && total_free_strings
> STRING_BLOCK_SIZE
)
2167 string_free_list
= free_list_before
;
2171 total_free_strings
+= nfree
;
2172 b
->next
= live_blocks
;
2177 check_string_free_list ();
2179 string_blocks
= live_blocks
;
2180 free_large_strings ();
2181 compact_small_strings ();
2183 check_string_free_list ();
2187 /* Free dead large strings. */
2190 free_large_strings (void)
2192 struct sblock
*b
, *next
;
2193 struct sblock
*live_blocks
= NULL
;
2195 for (b
= large_sblocks
; b
; b
= next
)
2199 if (b
->first_data
.string
== NULL
)
2203 b
->next
= live_blocks
;
2208 large_sblocks
= live_blocks
;
2212 /* Compact data of small strings. Free sblocks that don't contain
2213 data of live strings after compaction. */
2216 compact_small_strings (void)
2218 struct sblock
*b
, *tb
, *next
;
2219 struct sdata
*from
, *to
, *end
, *tb_end
;
2220 struct sdata
*to_end
, *from_end
;
2222 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2223 to, and TB_END is the end of TB. */
2225 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2226 to
= &tb
->first_data
;
2228 /* Step through the blocks from the oldest to the youngest. We
2229 expect that old blocks will stabilize over time, so that less
2230 copying will happen this way. */
2231 for (b
= oldest_sblock
; b
; b
= b
->next
)
2234 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2236 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2238 /* Compute the next FROM here because copying below may
2239 overwrite data we need to compute it. */
2242 #ifdef GC_CHECK_STRING_BYTES
2243 /* Check that the string size recorded in the string is the
2244 same as the one recorded in the sdata structure. */
2246 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2248 #endif /* GC_CHECK_STRING_BYTES */
2251 nbytes
= GC_STRING_BYTES (from
->string
);
2253 nbytes
= SDATA_NBYTES (from
);
2255 if (nbytes
> LARGE_STRING_BYTES
)
2258 nbytes
= SDATA_SIZE (nbytes
);
2259 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2261 #ifdef GC_CHECK_STRING_OVERRUN
2262 if (memcmp (string_overrun_cookie
,
2263 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
2264 GC_STRING_OVERRUN_COOKIE_SIZE
))
2268 /* FROM->string non-null means it's alive. Copy its data. */
2271 /* If TB is full, proceed with the next sblock. */
2272 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2273 if (to_end
> tb_end
)
2277 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2278 to
= &tb
->first_data
;
2279 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2282 /* Copy, and update the string's `data' pointer. */
2285 xassert (tb
!= b
|| to
< from
);
2286 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
2287 to
->string
->data
= SDATA_DATA (to
);
2290 /* Advance past the sdata we copied to. */
2296 /* The rest of the sblocks following TB don't contain live data, so
2297 we can free them. */
2298 for (b
= tb
->next
; b
; b
= next
)
2306 current_sblock
= tb
;
2310 string_overflow (void)
2312 error ("Maximum string size exceeded");
2315 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2316 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2317 LENGTH must be an integer.
2318 INIT must be an integer that represents a character. */)
2319 (Lisp_Object length
, Lisp_Object init
)
2321 register Lisp_Object val
;
2322 register unsigned char *p
, *end
;
2326 CHECK_NATNUM (length
);
2327 CHECK_CHARACTER (init
);
2329 c
= XFASTINT (init
);
2330 if (ASCII_CHAR_P (c
))
2332 nbytes
= XINT (length
);
2333 val
= make_uninit_string (nbytes
);
2335 end
= p
+ SCHARS (val
);
2341 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2342 int len
= CHAR_STRING (c
, str
);
2343 EMACS_INT string_len
= XINT (length
);
2345 if (string_len
> STRING_BYTES_MAX
/ len
)
2347 nbytes
= len
* string_len
;
2348 val
= make_uninit_multibyte_string (string_len
, nbytes
);
2353 memcpy (p
, str
, len
);
2363 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2364 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2365 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2366 (Lisp_Object length
, Lisp_Object init
)
2368 register Lisp_Object val
;
2369 struct Lisp_Bool_Vector
*p
;
2370 EMACS_INT length_in_chars
, length_in_elts
;
2373 CHECK_NATNUM (length
);
2375 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2377 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2378 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2379 / BOOL_VECTOR_BITS_PER_CHAR
);
2381 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2382 slot `size' of the struct Lisp_Bool_Vector. */
2383 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2385 /* No Lisp_Object to trace in there. */
2386 XSETPVECTYPESIZE (XVECTOR (val
), PVEC_BOOL_VECTOR
, 0);
2388 p
= XBOOL_VECTOR (val
);
2389 p
->size
= XFASTINT (length
);
2391 if (length_in_chars
)
2393 memset (p
->data
, ! NILP (init
) ? -1 : 0, length_in_chars
);
2395 /* Clear any extraneous bits in the last byte. */
2396 p
->data
[length_in_chars
- 1]
2397 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2404 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2405 of characters from the contents. This string may be unibyte or
2406 multibyte, depending on the contents. */
2409 make_string (const char *contents
, EMACS_INT nbytes
)
2411 register Lisp_Object val
;
2412 EMACS_INT nchars
, multibyte_nbytes
;
2414 parse_str_as_multibyte ((const unsigned char *) contents
, nbytes
,
2415 &nchars
, &multibyte_nbytes
);
2416 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2417 /* CONTENTS contains no multibyte sequences or contains an invalid
2418 multibyte sequence. We must make unibyte string. */
2419 val
= make_unibyte_string (contents
, nbytes
);
2421 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2426 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2429 make_unibyte_string (const char *contents
, EMACS_INT length
)
2431 register Lisp_Object val
;
2432 val
= make_uninit_string (length
);
2433 memcpy (SDATA (val
), contents
, length
);
2438 /* Make a multibyte string from NCHARS characters occupying NBYTES
2439 bytes at CONTENTS. */
2442 make_multibyte_string (const char *contents
,
2443 EMACS_INT nchars
, EMACS_INT nbytes
)
2445 register Lisp_Object val
;
2446 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2447 memcpy (SDATA (val
), contents
, nbytes
);
2452 /* Make a string from NCHARS characters occupying NBYTES bytes at
2453 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2456 make_string_from_bytes (const char *contents
,
2457 EMACS_INT nchars
, EMACS_INT nbytes
)
2459 register Lisp_Object val
;
2460 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2461 memcpy (SDATA (val
), contents
, nbytes
);
2462 if (SBYTES (val
) == SCHARS (val
))
2463 STRING_SET_UNIBYTE (val
);
2468 /* Make a string from NCHARS characters occupying NBYTES bytes at
2469 CONTENTS. The argument MULTIBYTE controls whether to label the
2470 string as multibyte. If NCHARS is negative, it counts the number of
2471 characters by itself. */
2474 make_specified_string (const char *contents
,
2475 EMACS_INT nchars
, EMACS_INT nbytes
, int multibyte
)
2477 register Lisp_Object val
;
2482 nchars
= multibyte_chars_in_text ((const unsigned char *) contents
,
2487 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2488 memcpy (SDATA (val
), contents
, nbytes
);
2490 STRING_SET_UNIBYTE (val
);
2495 /* Make a string from the data at STR, treating it as multibyte if the
2499 build_string (const char *str
)
2501 return make_string (str
, strlen (str
));
2505 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2506 occupying LENGTH bytes. */
2509 make_uninit_string (EMACS_INT length
)
2514 return empty_unibyte_string
;
2515 val
= make_uninit_multibyte_string (length
, length
);
2516 STRING_SET_UNIBYTE (val
);
2521 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2522 which occupy NBYTES bytes. */
2525 make_uninit_multibyte_string (EMACS_INT nchars
, EMACS_INT nbytes
)
2528 struct Lisp_String
*s
;
2533 return empty_multibyte_string
;
2535 s
= allocate_string ();
2536 allocate_string_data (s
, nchars
, nbytes
);
2537 XSETSTRING (string
, s
);
2538 string_chars_consed
+= nbytes
;
2544 /***********************************************************************
2546 ***********************************************************************/
2548 /* We store float cells inside of float_blocks, allocating a new
2549 float_block with malloc whenever necessary. Float cells reclaimed
2550 by GC are put on a free list to be reallocated before allocating
2551 any new float cells from the latest float_block. */
2553 #define FLOAT_BLOCK_SIZE \
2554 (((BLOCK_BYTES - sizeof (struct float_block *) \
2555 /* The compiler might add padding at the end. */ \
2556 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2557 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2559 #define GETMARKBIT(block,n) \
2560 (((block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2561 >> ((n) % (sizeof (int) * CHAR_BIT))) \
2564 #define SETMARKBIT(block,n) \
2565 (block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2566 |= 1 << ((n) % (sizeof (int) * CHAR_BIT))
2568 #define UNSETMARKBIT(block,n) \
2569 (block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2570 &= ~(1 << ((n) % (sizeof (int) * CHAR_BIT)))
2572 #define FLOAT_BLOCK(fptr) \
2573 ((struct float_block *) (((uintptr_t) (fptr)) & ~(BLOCK_ALIGN - 1)))
2575 #define FLOAT_INDEX(fptr) \
2576 ((((uintptr_t) (fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2580 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2581 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2582 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof (int) * CHAR_BIT
)];
2583 struct float_block
*next
;
2586 #define FLOAT_MARKED_P(fptr) \
2587 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2589 #define FLOAT_MARK(fptr) \
2590 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2592 #define FLOAT_UNMARK(fptr) \
2593 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2595 /* Current float_block. */
2597 static struct float_block
*float_block
;
2599 /* Index of first unused Lisp_Float in the current float_block. */
2601 static int float_block_index
;
2603 /* Free-list of Lisp_Floats. */
2605 static struct Lisp_Float
*float_free_list
;
2608 /* Initialize float allocation. */
2614 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2615 float_free_list
= 0;
2619 /* Return a new float object with value FLOAT_VALUE. */
2622 make_float (double float_value
)
2624 register Lisp_Object val
;
2626 /* eassert (!handling_signal); */
2630 if (float_free_list
)
2632 /* We use the data field for chaining the free list
2633 so that we won't use the same field that has the mark bit. */
2634 XSETFLOAT (val
, float_free_list
);
2635 float_free_list
= float_free_list
->u
.chain
;
2639 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2641 register struct float_block
*new;
2643 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2645 new->next
= float_block
;
2646 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2648 float_block_index
= 0;
2650 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2651 float_block_index
++;
2654 MALLOC_UNBLOCK_INPUT
;
2656 XFLOAT_INIT (val
, float_value
);
2657 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2658 consing_since_gc
+= sizeof (struct Lisp_Float
);
2665 /***********************************************************************
2667 ***********************************************************************/
2669 /* We store cons cells inside of cons_blocks, allocating a new
2670 cons_block with malloc whenever necessary. Cons cells reclaimed by
2671 GC are put on a free list to be reallocated before allocating
2672 any new cons cells from the latest cons_block. */
2674 #define CONS_BLOCK_SIZE \
2675 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2676 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2678 #define CONS_BLOCK(fptr) \
2679 ((struct cons_block *) ((uintptr_t) (fptr) & ~(BLOCK_ALIGN - 1)))
2681 #define CONS_INDEX(fptr) \
2682 (((uintptr_t) (fptr) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2686 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2687 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2688 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof (int) * CHAR_BIT
)];
2689 struct cons_block
*next
;
2692 #define CONS_MARKED_P(fptr) \
2693 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2695 #define CONS_MARK(fptr) \
2696 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2698 #define CONS_UNMARK(fptr) \
2699 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2701 /* Current cons_block. */
2703 static struct cons_block
*cons_block
;
2705 /* Index of first unused Lisp_Cons in the current block. */
2707 static int cons_block_index
;
2709 /* Free-list of Lisp_Cons structures. */
2711 static struct Lisp_Cons
*cons_free_list
;
2714 /* Initialize cons allocation. */
2720 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2725 /* Explicitly free a cons cell by putting it on the free-list. */
2728 free_cons (struct Lisp_Cons
*ptr
)
2730 ptr
->u
.chain
= cons_free_list
;
2734 cons_free_list
= ptr
;
2737 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2738 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2739 (Lisp_Object car
, Lisp_Object cdr
)
2741 register Lisp_Object val
;
2743 /* eassert (!handling_signal); */
2749 /* We use the cdr for chaining the free list
2750 so that we won't use the same field that has the mark bit. */
2751 XSETCONS (val
, cons_free_list
);
2752 cons_free_list
= cons_free_list
->u
.chain
;
2756 if (cons_block_index
== CONS_BLOCK_SIZE
)
2758 register struct cons_block
*new;
2759 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2761 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2762 new->next
= cons_block
;
2764 cons_block_index
= 0;
2766 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2770 MALLOC_UNBLOCK_INPUT
;
2774 eassert (!CONS_MARKED_P (XCONS (val
)));
2775 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2776 cons_cells_consed
++;
2780 #ifdef GC_CHECK_CONS_LIST
2781 /* Get an error now if there's any junk in the cons free list. */
2783 check_cons_list (void)
2785 struct Lisp_Cons
*tail
= cons_free_list
;
2788 tail
= tail
->u
.chain
;
2792 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2795 list1 (Lisp_Object arg1
)
2797 return Fcons (arg1
, Qnil
);
2801 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2803 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2808 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2810 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2815 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2817 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2822 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2824 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2825 Fcons (arg5
, Qnil
)))));
2829 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2830 doc
: /* Return a newly created list with specified arguments as elements.
2831 Any number of arguments, even zero arguments, are allowed.
2832 usage: (list &rest OBJECTS) */)
2833 (ptrdiff_t nargs
, Lisp_Object
*args
)
2835 register Lisp_Object val
;
2841 val
= Fcons (args
[nargs
], val
);
2847 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2848 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2849 (register Lisp_Object length
, Lisp_Object init
)
2851 register Lisp_Object val
;
2852 register EMACS_INT size
;
2854 CHECK_NATNUM (length
);
2855 size
= XFASTINT (length
);
2860 val
= Fcons (init
, val
);
2865 val
= Fcons (init
, val
);
2870 val
= Fcons (init
, val
);
2875 val
= Fcons (init
, val
);
2880 val
= Fcons (init
, val
);
2895 /***********************************************************************
2897 ***********************************************************************/
2899 /* Singly-linked list of all vectors. */
2901 static struct Lisp_Vector
*all_vectors
;
2903 /* Handy constants for vectorlike objects. */
2906 header_size
= offsetof (struct Lisp_Vector
, contents
),
2907 word_size
= sizeof (Lisp_Object
)
2910 /* Value is a pointer to a newly allocated Lisp_Vector structure
2911 with room for LEN Lisp_Objects. */
2913 static struct Lisp_Vector
*
2914 allocate_vectorlike (EMACS_INT len
)
2916 struct Lisp_Vector
*p
;
2921 #ifdef DOUG_LEA_MALLOC
2922 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2923 because mapped region contents are not preserved in
2925 mallopt (M_MMAP_MAX
, 0);
2928 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2929 /* eassert (!handling_signal); */
2931 nbytes
= header_size
+ len
* word_size
;
2932 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
2934 #ifdef DOUG_LEA_MALLOC
2935 /* Back to a reasonable maximum of mmap'ed areas. */
2936 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2939 consing_since_gc
+= nbytes
;
2940 vector_cells_consed
+= len
;
2942 p
->header
.next
.vector
= all_vectors
;
2945 MALLOC_UNBLOCK_INPUT
;
2951 /* Allocate a vector with LEN slots. */
2953 struct Lisp_Vector
*
2954 allocate_vector (EMACS_INT len
)
2956 struct Lisp_Vector
*v
;
2957 ptrdiff_t nbytes_max
= min (PTRDIFF_MAX
, SIZE_MAX
);
2959 if (min ((nbytes_max
- header_size
) / word_size
, MOST_POSITIVE_FIXNUM
) < len
)
2960 memory_full (SIZE_MAX
);
2961 v
= allocate_vectorlike (len
);
2962 v
->header
.size
= len
;
2967 /* Allocate other vector-like structures. */
2969 struct Lisp_Vector
*
2970 allocate_pseudovector (int memlen
, int lisplen
, EMACS_INT tag
)
2972 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2975 /* Only the first lisplen slots will be traced normally by the GC. */
2976 for (i
= 0; i
< lisplen
; ++i
)
2977 v
->contents
[i
] = Qnil
;
2979 XSETPVECTYPESIZE (v
, tag
, lisplen
);
2983 struct Lisp_Hash_Table
*
2984 allocate_hash_table (void)
2986 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
2991 allocate_window (void)
2993 return ALLOCATE_PSEUDOVECTOR (struct window
, current_matrix
, PVEC_WINDOW
);
2998 allocate_terminal (void)
3000 struct terminal
*t
= ALLOCATE_PSEUDOVECTOR (struct terminal
,
3001 next_terminal
, PVEC_TERMINAL
);
3002 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
3003 memset (&t
->next_terminal
, 0,
3004 (char*) (t
+ 1) - (char*) &t
->next_terminal
);
3010 allocate_frame (void)
3012 struct frame
*f
= ALLOCATE_PSEUDOVECTOR (struct frame
,
3013 face_cache
, PVEC_FRAME
);
3014 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
3015 memset (&f
->face_cache
, 0,
3016 (char *) (f
+ 1) - (char *) &f
->face_cache
);
3021 struct Lisp_Process
*
3022 allocate_process (void)
3024 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
3028 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3029 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3030 See also the function `vector'. */)
3031 (register Lisp_Object length
, Lisp_Object init
)
3034 register EMACS_INT sizei
;
3035 register EMACS_INT i
;
3036 register struct Lisp_Vector
*p
;
3038 CHECK_NATNUM (length
);
3039 sizei
= XFASTINT (length
);
3041 p
= allocate_vector (sizei
);
3042 for (i
= 0; i
< sizei
; i
++)
3043 p
->contents
[i
] = init
;
3045 XSETVECTOR (vector
, p
);
3050 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3051 doc
: /* Return a newly created vector with specified arguments as elements.
3052 Any number of arguments, even zero arguments, are allowed.
3053 usage: (vector &rest OBJECTS) */)
3054 (ptrdiff_t nargs
, Lisp_Object
*args
)
3056 register Lisp_Object len
, val
;
3058 register struct Lisp_Vector
*p
;
3060 XSETFASTINT (len
, nargs
);
3061 val
= Fmake_vector (len
, Qnil
);
3063 for (i
= 0; i
< nargs
; i
++)
3064 p
->contents
[i
] = args
[i
];
3069 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3070 doc
: /* Create a byte-code object with specified arguments as elements.
3071 The arguments should be the ARGLIST, bytecode-string BYTE-CODE, constant
3072 vector CONSTANTS, maximum stack size DEPTH, (optional) DOCSTRING,
3073 and (optional) INTERACTIVE-SPEC.
3074 The first four arguments are required; at most six have any
3076 The ARGLIST can be either like the one of `lambda', in which case the arguments
3077 will be dynamically bound before executing the byte code, or it can be an
3078 integer of the form NNNNNNNRMMMMMMM where the 7bit MMMMMMM specifies the
3079 minimum number of arguments, the 7-bit NNNNNNN specifies the maximum number
3080 of arguments (ignoring &rest) and the R bit specifies whether there is a &rest
3081 argument to catch the left-over arguments. If such an integer is used, the
3082 arguments will not be dynamically bound but will be instead pushed on the
3083 stack before executing the byte-code.
3084 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3085 (ptrdiff_t nargs
, Lisp_Object
*args
)
3087 register Lisp_Object len
, val
;
3089 register struct Lisp_Vector
*p
;
3091 XSETFASTINT (len
, nargs
);
3092 if (!NILP (Vpurify_flag
))
3093 val
= make_pure_vector (nargs
);
3095 val
= Fmake_vector (len
, Qnil
);
3097 if (nargs
> 1 && STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
3098 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3099 earlier because they produced a raw 8-bit string for byte-code
3100 and now such a byte-code string is loaded as multibyte while
3101 raw 8-bit characters converted to multibyte form. Thus, now we
3102 must convert them back to the original unibyte form. */
3103 args
[1] = Fstring_as_unibyte (args
[1]);
3106 for (i
= 0; i
< nargs
; i
++)
3108 if (!NILP (Vpurify_flag
))
3109 args
[i
] = Fpurecopy (args
[i
]);
3110 p
->contents
[i
] = args
[i
];
3112 XSETPVECTYPE (p
, PVEC_COMPILED
);
3113 XSETCOMPILED (val
, p
);
3119 /***********************************************************************
3121 ***********************************************************************/
3123 /* Each symbol_block is just under 1020 bytes long, since malloc
3124 really allocates in units of powers of two and uses 4 bytes for its
3127 #define SYMBOL_BLOCK_SIZE \
3128 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3132 /* Place `symbols' first, to preserve alignment. */
3133 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3134 struct symbol_block
*next
;
3137 /* Current symbol block and index of first unused Lisp_Symbol
3140 static struct symbol_block
*symbol_block
;
3141 static int symbol_block_index
;
3143 /* List of free symbols. */
3145 static struct Lisp_Symbol
*symbol_free_list
;
3148 /* Initialize symbol allocation. */
3153 symbol_block
= NULL
;
3154 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3155 symbol_free_list
= 0;
3159 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3160 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3161 Its value and function definition are void, and its property list is nil. */)
3164 register Lisp_Object val
;
3165 register struct Lisp_Symbol
*p
;
3167 CHECK_STRING (name
);
3169 /* eassert (!handling_signal); */
3173 if (symbol_free_list
)
3175 XSETSYMBOL (val
, symbol_free_list
);
3176 symbol_free_list
= symbol_free_list
->next
;
3180 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3182 struct symbol_block
*new;
3183 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3185 new->next
= symbol_block
;
3187 symbol_block_index
= 0;
3189 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3190 symbol_block_index
++;
3193 MALLOC_UNBLOCK_INPUT
;
3198 p
->redirect
= SYMBOL_PLAINVAL
;
3199 SET_SYMBOL_VAL (p
, Qunbound
);
3200 p
->function
= Qunbound
;
3203 p
->interned
= SYMBOL_UNINTERNED
;
3205 p
->declared_special
= 0;
3206 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3213 /***********************************************************************
3214 Marker (Misc) Allocation
3215 ***********************************************************************/
3217 /* Allocation of markers and other objects that share that structure.
3218 Works like allocation of conses. */
3220 #define MARKER_BLOCK_SIZE \
3221 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3225 /* Place `markers' first, to preserve alignment. */
3226 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3227 struct marker_block
*next
;
3230 static struct marker_block
*marker_block
;
3231 static int marker_block_index
;
3233 static union Lisp_Misc
*marker_free_list
;
3238 marker_block
= NULL
;
3239 marker_block_index
= MARKER_BLOCK_SIZE
;
3240 marker_free_list
= 0;
3243 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3246 allocate_misc (void)
3250 /* eassert (!handling_signal); */
3254 if (marker_free_list
)
3256 XSETMISC (val
, marker_free_list
);
3257 marker_free_list
= marker_free_list
->u_free
.chain
;
3261 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3263 struct marker_block
*new;
3264 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3266 new->next
= marker_block
;
3268 marker_block_index
= 0;
3269 total_free_markers
+= MARKER_BLOCK_SIZE
;
3271 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3272 marker_block_index
++;
3275 MALLOC_UNBLOCK_INPUT
;
3277 --total_free_markers
;
3278 consing_since_gc
+= sizeof (union Lisp_Misc
);
3279 misc_objects_consed
++;
3280 XMISCANY (val
)->gcmarkbit
= 0;
3284 /* Free a Lisp_Misc object */
3287 free_misc (Lisp_Object misc
)
3289 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3290 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3291 marker_free_list
= XMISC (misc
);
3293 total_free_markers
++;
3296 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3297 INTEGER. This is used to package C values to call record_unwind_protect.
3298 The unwind function can get the C values back using XSAVE_VALUE. */
3301 make_save_value (void *pointer
, ptrdiff_t integer
)
3303 register Lisp_Object val
;
3304 register struct Lisp_Save_Value
*p
;
3306 val
= allocate_misc ();
3307 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3308 p
= XSAVE_VALUE (val
);
3309 p
->pointer
= pointer
;
3310 p
->integer
= integer
;
3315 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3316 doc
: /* Return a newly allocated marker which does not point at any place. */)
3319 register Lisp_Object val
;
3320 register struct Lisp_Marker
*p
;
3322 val
= allocate_misc ();
3323 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3329 p
->insertion_type
= 0;
3333 /* Put MARKER back on the free list after using it temporarily. */
3336 free_marker (Lisp_Object marker
)
3338 unchain_marker (XMARKER (marker
));
3343 /* Return a newly created vector or string with specified arguments as
3344 elements. If all the arguments are characters that can fit
3345 in a string of events, make a string; otherwise, make a vector.
3347 Any number of arguments, even zero arguments, are allowed. */
3350 make_event_array (register int nargs
, Lisp_Object
*args
)
3354 for (i
= 0; i
< nargs
; i
++)
3355 /* The things that fit in a string
3356 are characters that are in 0...127,
3357 after discarding the meta bit and all the bits above it. */
3358 if (!INTEGERP (args
[i
])
3359 || (XINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3360 return Fvector (nargs
, args
);
3362 /* Since the loop exited, we know that all the things in it are
3363 characters, so we can make a string. */
3367 result
= Fmake_string (make_number (nargs
), make_number (0));
3368 for (i
= 0; i
< nargs
; i
++)
3370 SSET (result
, i
, XINT (args
[i
]));
3371 /* Move the meta bit to the right place for a string char. */
3372 if (XINT (args
[i
]) & CHAR_META
)
3373 SSET (result
, i
, SREF (result
, i
) | 0x80);
3382 /************************************************************************
3383 Memory Full Handling
3384 ************************************************************************/
3387 /* Called if malloc (NBYTES) returns zero. If NBYTES == SIZE_MAX,
3388 there may have been size_t overflow so that malloc was never
3389 called, or perhaps malloc was invoked successfully but the
3390 resulting pointer had problems fitting into a tagged EMACS_INT. In
3391 either case this counts as memory being full even though malloc did
3395 memory_full (size_t nbytes
)
3397 /* Do not go into hysterics merely because a large request failed. */
3398 int enough_free_memory
= 0;
3399 if (SPARE_MEMORY
< nbytes
)
3404 p
= malloc (SPARE_MEMORY
);
3408 enough_free_memory
= 1;
3410 MALLOC_UNBLOCK_INPUT
;
3413 if (! enough_free_memory
)
3419 memory_full_cons_threshold
= sizeof (struct cons_block
);
3421 /* The first time we get here, free the spare memory. */
3422 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3423 if (spare_memory
[i
])
3426 free (spare_memory
[i
]);
3427 else if (i
>= 1 && i
<= 4)
3428 lisp_align_free (spare_memory
[i
]);
3430 lisp_free (spare_memory
[i
]);
3431 spare_memory
[i
] = 0;
3434 /* Record the space now used. When it decreases substantially,
3435 we can refill the memory reserve. */
3436 #if !defined SYSTEM_MALLOC && !defined SYNC_INPUT
3437 bytes_used_when_full
= BYTES_USED
;
3441 /* This used to call error, but if we've run out of memory, we could
3442 get infinite recursion trying to build the string. */
3443 xsignal (Qnil
, Vmemory_signal_data
);
3446 /* If we released our reserve (due to running out of memory),
3447 and we have a fair amount free once again,
3448 try to set aside another reserve in case we run out once more.
3450 This is called when a relocatable block is freed in ralloc.c,
3451 and also directly from this file, in case we're not using ralloc.c. */
3454 refill_memory_reserve (void)
3456 #ifndef SYSTEM_MALLOC
3457 if (spare_memory
[0] == 0)
3458 spare_memory
[0] = (char *) malloc (SPARE_MEMORY
);
3459 if (spare_memory
[1] == 0)
3460 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3462 if (spare_memory
[2] == 0)
3463 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3465 if (spare_memory
[3] == 0)
3466 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3468 if (spare_memory
[4] == 0)
3469 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3471 if (spare_memory
[5] == 0)
3472 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3474 if (spare_memory
[6] == 0)
3475 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3477 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3478 Vmemory_full
= Qnil
;
3482 /************************************************************************
3484 ************************************************************************/
3486 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3488 /* Conservative C stack marking requires a method to identify possibly
3489 live Lisp objects given a pointer value. We do this by keeping
3490 track of blocks of Lisp data that are allocated in a red-black tree
3491 (see also the comment of mem_node which is the type of nodes in
3492 that tree). Function lisp_malloc adds information for an allocated
3493 block to the red-black tree with calls to mem_insert, and function
3494 lisp_free removes it with mem_delete. Functions live_string_p etc
3495 call mem_find to lookup information about a given pointer in the
3496 tree, and use that to determine if the pointer points to a Lisp
3499 /* Initialize this part of alloc.c. */
3504 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3505 mem_z
.parent
= NULL
;
3506 mem_z
.color
= MEM_BLACK
;
3507 mem_z
.start
= mem_z
.end
= NULL
;
3512 /* Value is a pointer to the mem_node containing START. Value is
3513 MEM_NIL if there is no node in the tree containing START. */
3515 static inline struct mem_node
*
3516 mem_find (void *start
)
3520 if (start
< min_heap_address
|| start
> max_heap_address
)
3523 /* Make the search always successful to speed up the loop below. */
3524 mem_z
.start
= start
;
3525 mem_z
.end
= (char *) start
+ 1;
3528 while (start
< p
->start
|| start
>= p
->end
)
3529 p
= start
< p
->start
? p
->left
: p
->right
;
3534 /* Insert a new node into the tree for a block of memory with start
3535 address START, end address END, and type TYPE. Value is a
3536 pointer to the node that was inserted. */
3538 static struct mem_node
*
3539 mem_insert (void *start
, void *end
, enum mem_type type
)
3541 struct mem_node
*c
, *parent
, *x
;
3543 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3544 min_heap_address
= start
;
3545 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3546 max_heap_address
= end
;
3548 /* See where in the tree a node for START belongs. In this
3549 particular application, it shouldn't happen that a node is already
3550 present. For debugging purposes, let's check that. */
3554 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3556 while (c
!= MEM_NIL
)
3558 if (start
>= c
->start
&& start
< c
->end
)
3561 c
= start
< c
->start
? c
->left
: c
->right
;
3564 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3566 while (c
!= MEM_NIL
)
3569 c
= start
< c
->start
? c
->left
: c
->right
;
3572 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3574 /* Create a new node. */
3575 #ifdef GC_MALLOC_CHECK
3576 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3580 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3586 x
->left
= x
->right
= MEM_NIL
;
3589 /* Insert it as child of PARENT or install it as root. */
3592 if (start
< parent
->start
)
3600 /* Re-establish red-black tree properties. */
3601 mem_insert_fixup (x
);
3607 /* Re-establish the red-black properties of the tree, and thereby
3608 balance the tree, after node X has been inserted; X is always red. */
3611 mem_insert_fixup (struct mem_node
*x
)
3613 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3615 /* X is red and its parent is red. This is a violation of
3616 red-black tree property #3. */
3618 if (x
->parent
== x
->parent
->parent
->left
)
3620 /* We're on the left side of our grandparent, and Y is our
3622 struct mem_node
*y
= x
->parent
->parent
->right
;
3624 if (y
->color
== MEM_RED
)
3626 /* Uncle and parent are red but should be black because
3627 X is red. Change the colors accordingly and proceed
3628 with the grandparent. */
3629 x
->parent
->color
= MEM_BLACK
;
3630 y
->color
= MEM_BLACK
;
3631 x
->parent
->parent
->color
= MEM_RED
;
3632 x
= x
->parent
->parent
;
3636 /* Parent and uncle have different colors; parent is
3637 red, uncle is black. */
3638 if (x
== x
->parent
->right
)
3641 mem_rotate_left (x
);
3644 x
->parent
->color
= MEM_BLACK
;
3645 x
->parent
->parent
->color
= MEM_RED
;
3646 mem_rotate_right (x
->parent
->parent
);
3651 /* This is the symmetrical case of above. */
3652 struct mem_node
*y
= x
->parent
->parent
->left
;
3654 if (y
->color
== MEM_RED
)
3656 x
->parent
->color
= MEM_BLACK
;
3657 y
->color
= MEM_BLACK
;
3658 x
->parent
->parent
->color
= MEM_RED
;
3659 x
= x
->parent
->parent
;
3663 if (x
== x
->parent
->left
)
3666 mem_rotate_right (x
);
3669 x
->parent
->color
= MEM_BLACK
;
3670 x
->parent
->parent
->color
= MEM_RED
;
3671 mem_rotate_left (x
->parent
->parent
);
3676 /* The root may have been changed to red due to the algorithm. Set
3677 it to black so that property #5 is satisfied. */
3678 mem_root
->color
= MEM_BLACK
;
3689 mem_rotate_left (struct mem_node
*x
)
3693 /* Turn y's left sub-tree into x's right sub-tree. */
3696 if (y
->left
!= MEM_NIL
)
3697 y
->left
->parent
= x
;
3699 /* Y's parent was x's parent. */
3701 y
->parent
= x
->parent
;
3703 /* Get the parent to point to y instead of x. */
3706 if (x
== x
->parent
->left
)
3707 x
->parent
->left
= y
;
3709 x
->parent
->right
= y
;
3714 /* Put x on y's left. */
3728 mem_rotate_right (struct mem_node
*x
)
3730 struct mem_node
*y
= x
->left
;
3733 if (y
->right
!= MEM_NIL
)
3734 y
->right
->parent
= x
;
3737 y
->parent
= x
->parent
;
3740 if (x
== x
->parent
->right
)
3741 x
->parent
->right
= y
;
3743 x
->parent
->left
= y
;
3754 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3757 mem_delete (struct mem_node
*z
)
3759 struct mem_node
*x
, *y
;
3761 if (!z
|| z
== MEM_NIL
)
3764 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3769 while (y
->left
!= MEM_NIL
)
3773 if (y
->left
!= MEM_NIL
)
3778 x
->parent
= y
->parent
;
3781 if (y
== y
->parent
->left
)
3782 y
->parent
->left
= x
;
3784 y
->parent
->right
= x
;
3791 z
->start
= y
->start
;
3796 if (y
->color
== MEM_BLACK
)
3797 mem_delete_fixup (x
);
3799 #ifdef GC_MALLOC_CHECK
3807 /* Re-establish the red-black properties of the tree, after a
3811 mem_delete_fixup (struct mem_node
*x
)
3813 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3815 if (x
== x
->parent
->left
)
3817 struct mem_node
*w
= x
->parent
->right
;
3819 if (w
->color
== MEM_RED
)
3821 w
->color
= MEM_BLACK
;
3822 x
->parent
->color
= MEM_RED
;
3823 mem_rotate_left (x
->parent
);
3824 w
= x
->parent
->right
;
3827 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3834 if (w
->right
->color
== MEM_BLACK
)
3836 w
->left
->color
= MEM_BLACK
;
3838 mem_rotate_right (w
);
3839 w
= x
->parent
->right
;
3841 w
->color
= x
->parent
->color
;
3842 x
->parent
->color
= MEM_BLACK
;
3843 w
->right
->color
= MEM_BLACK
;
3844 mem_rotate_left (x
->parent
);
3850 struct mem_node
*w
= x
->parent
->left
;
3852 if (w
->color
== MEM_RED
)
3854 w
->color
= MEM_BLACK
;
3855 x
->parent
->color
= MEM_RED
;
3856 mem_rotate_right (x
->parent
);
3857 w
= x
->parent
->left
;
3860 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3867 if (w
->left
->color
== MEM_BLACK
)
3869 w
->right
->color
= MEM_BLACK
;
3871 mem_rotate_left (w
);
3872 w
= x
->parent
->left
;
3875 w
->color
= x
->parent
->color
;
3876 x
->parent
->color
= MEM_BLACK
;
3877 w
->left
->color
= MEM_BLACK
;
3878 mem_rotate_right (x
->parent
);
3884 x
->color
= MEM_BLACK
;
3888 /* Value is non-zero if P is a pointer to a live Lisp string on
3889 the heap. M is a pointer to the mem_block for P. */
3892 live_string_p (struct mem_node
*m
, void *p
)
3894 if (m
->type
== MEM_TYPE_STRING
)
3896 struct string_block
*b
= (struct string_block
*) m
->start
;
3897 ptrdiff_t offset
= (char *) p
- (char *) &b
->strings
[0];
3899 /* P must point to the start of a Lisp_String structure, and it
3900 must not be on the free-list. */
3902 && offset
% sizeof b
->strings
[0] == 0
3903 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3904 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3911 /* Value is non-zero if P is a pointer to a live Lisp cons on
3912 the heap. M is a pointer to the mem_block for P. */
3915 live_cons_p (struct mem_node
*m
, void *p
)
3917 if (m
->type
== MEM_TYPE_CONS
)
3919 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3920 ptrdiff_t offset
= (char *) p
- (char *) &b
->conses
[0];
3922 /* P must point to the start of a Lisp_Cons, not be
3923 one of the unused cells in the current cons block,
3924 and not be on the free-list. */
3926 && offset
% sizeof b
->conses
[0] == 0
3927 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3929 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3930 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3937 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3938 the heap. M is a pointer to the mem_block for P. */
3941 live_symbol_p (struct mem_node
*m
, void *p
)
3943 if (m
->type
== MEM_TYPE_SYMBOL
)
3945 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3946 ptrdiff_t offset
= (char *) p
- (char *) &b
->symbols
[0];
3948 /* P must point to the start of a Lisp_Symbol, not be
3949 one of the unused cells in the current symbol block,
3950 and not be on the free-list. */
3952 && offset
% sizeof b
->symbols
[0] == 0
3953 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3954 && (b
!= symbol_block
3955 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3956 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3963 /* Value is non-zero if P is a pointer to a live Lisp float on
3964 the heap. M is a pointer to the mem_block for P. */
3967 live_float_p (struct mem_node
*m
, void *p
)
3969 if (m
->type
== MEM_TYPE_FLOAT
)
3971 struct float_block
*b
= (struct float_block
*) m
->start
;
3972 ptrdiff_t offset
= (char *) p
- (char *) &b
->floats
[0];
3974 /* P must point to the start of a Lisp_Float and not be
3975 one of the unused cells in the current float block. */
3977 && offset
% sizeof b
->floats
[0] == 0
3978 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3979 && (b
!= float_block
3980 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3987 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3988 the heap. M is a pointer to the mem_block for P. */
3991 live_misc_p (struct mem_node
*m
, void *p
)
3993 if (m
->type
== MEM_TYPE_MISC
)
3995 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3996 ptrdiff_t offset
= (char *) p
- (char *) &b
->markers
[0];
3998 /* P must point to the start of a Lisp_Misc, not be
3999 one of the unused cells in the current misc block,
4000 and not be on the free-list. */
4002 && offset
% sizeof b
->markers
[0] == 0
4003 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4004 && (b
!= marker_block
4005 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4006 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
4013 /* Value is non-zero if P is a pointer to a live vector-like object.
4014 M is a pointer to the mem_block for P. */
4017 live_vector_p (struct mem_node
*m
, void *p
)
4019 return (p
== m
->start
&& m
->type
== MEM_TYPE_VECTORLIKE
);
4023 /* Value is non-zero if P is a pointer to a live buffer. M is a
4024 pointer to the mem_block for P. */
4027 live_buffer_p (struct mem_node
*m
, void *p
)
4029 /* P must point to the start of the block, and the buffer
4030 must not have been killed. */
4031 return (m
->type
== MEM_TYPE_BUFFER
4033 && !NILP (((struct buffer
*) p
)->BUFFER_INTERNAL_FIELD (name
)));
4036 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4040 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4042 /* Array of objects that are kept alive because the C stack contains
4043 a pattern that looks like a reference to them . */
4045 #define MAX_ZOMBIES 10
4046 static Lisp_Object zombies
[MAX_ZOMBIES
];
4048 /* Number of zombie objects. */
4050 static EMACS_INT nzombies
;
4052 /* Number of garbage collections. */
4054 static EMACS_INT ngcs
;
4056 /* Average percentage of zombies per collection. */
4058 static double avg_zombies
;
4060 /* Max. number of live and zombie objects. */
4062 static EMACS_INT max_live
, max_zombies
;
4064 /* Average number of live objects per GC. */
4066 static double avg_live
;
4068 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4069 doc
: /* Show information about live and zombie objects. */)
4072 Lisp_Object args
[8], zombie_list
= Qnil
;
4074 for (i
= 0; i
< nzombies
; i
++)
4075 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4076 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4077 args
[1] = make_number (ngcs
);
4078 args
[2] = make_float (avg_live
);
4079 args
[3] = make_float (avg_zombies
);
4080 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4081 args
[5] = make_number (max_live
);
4082 args
[6] = make_number (max_zombies
);
4083 args
[7] = zombie_list
;
4084 return Fmessage (8, args
);
4087 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4090 /* Mark OBJ if we can prove it's a Lisp_Object. */
4093 mark_maybe_object (Lisp_Object obj
)
4101 po
= (void *) XPNTR (obj
);
4108 switch (XTYPE (obj
))
4111 mark_p
= (live_string_p (m
, po
)
4112 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4116 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4120 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4124 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4127 case Lisp_Vectorlike
:
4128 /* Note: can't check BUFFERP before we know it's a
4129 buffer because checking that dereferences the pointer
4130 PO which might point anywhere. */
4131 if (live_vector_p (m
, po
))
4132 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4133 else if (live_buffer_p (m
, po
))
4134 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4138 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4147 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4148 if (nzombies
< MAX_ZOMBIES
)
4149 zombies
[nzombies
] = obj
;
4158 /* If P points to Lisp data, mark that as live if it isn't already
4162 mark_maybe_pointer (void *p
)
4166 /* Quickly rule out some values which can't point to Lisp data. */
4169 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */
4171 2 /* We assume that Lisp data is aligned on even addresses. */
4179 Lisp_Object obj
= Qnil
;
4183 case MEM_TYPE_NON_LISP
:
4184 /* Nothing to do; not a pointer to Lisp memory. */
4187 case MEM_TYPE_BUFFER
:
4188 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P ((struct buffer
*)p
))
4189 XSETVECTOR (obj
, p
);
4193 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4197 case MEM_TYPE_STRING
:
4198 if (live_string_p (m
, p
)
4199 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4200 XSETSTRING (obj
, p
);
4204 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4208 case MEM_TYPE_SYMBOL
:
4209 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4210 XSETSYMBOL (obj
, p
);
4213 case MEM_TYPE_FLOAT
:
4214 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4218 case MEM_TYPE_VECTORLIKE
:
4219 if (live_vector_p (m
, p
))
4222 XSETVECTOR (tem
, p
);
4223 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4238 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4239 or END+OFFSET..START. */
4242 mark_memory (void *start
, void *end
, int offset
)
4247 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4251 /* Make START the pointer to the start of the memory region,
4252 if it isn't already. */
4260 /* Mark Lisp_Objects. */
4261 for (p
= (Lisp_Object
*) ((char *) start
+ offset
); (void *) p
< end
; ++p
)
4262 mark_maybe_object (*p
);
4264 /* Mark Lisp data pointed to. This is necessary because, in some
4265 situations, the C compiler optimizes Lisp objects away, so that
4266 only a pointer to them remains. Example:
4268 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4271 Lisp_Object obj = build_string ("test");
4272 struct Lisp_String *s = XSTRING (obj);
4273 Fgarbage_collect ();
4274 fprintf (stderr, "test `%s'\n", s->data);
4278 Here, `obj' isn't really used, and the compiler optimizes it
4279 away. The only reference to the life string is through the
4282 for (pp
= (void **) ((char *) start
+ offset
); (void *) pp
< end
; ++pp
)
4283 mark_maybe_pointer (*pp
);
4286 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4287 the GCC system configuration. In gcc 3.2, the only systems for
4288 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4289 by others?) and ns32k-pc532-min. */
4291 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4293 static int setjmp_tested_p
, longjmps_done
;
4295 #define SETJMP_WILL_LIKELY_WORK "\
4297 Emacs garbage collector has been changed to use conservative stack\n\
4298 marking. Emacs has determined that the method it uses to do the\n\
4299 marking will likely work on your system, but this isn't sure.\n\
4301 If you are a system-programmer, or can get the help of a local wizard\n\
4302 who is, please take a look at the function mark_stack in alloc.c, and\n\
4303 verify that the methods used are appropriate for your system.\n\
4305 Please mail the result to <emacs-devel@gnu.org>.\n\
4308 #define SETJMP_WILL_NOT_WORK "\
4310 Emacs garbage collector has been changed to use conservative stack\n\
4311 marking. Emacs has determined that the default method it uses to do the\n\
4312 marking will not work on your system. We will need a system-dependent\n\
4313 solution for your system.\n\
4315 Please take a look at the function mark_stack in alloc.c, and\n\
4316 try to find a way to make it work on your system.\n\
4318 Note that you may get false negatives, depending on the compiler.\n\
4319 In particular, you need to use -O with GCC for this test.\n\
4321 Please mail the result to <emacs-devel@gnu.org>.\n\
4325 /* Perform a quick check if it looks like setjmp saves registers in a
4326 jmp_buf. Print a message to stderr saying so. When this test
4327 succeeds, this is _not_ a proof that setjmp is sufficient for
4328 conservative stack marking. Only the sources or a disassembly
4339 /* Arrange for X to be put in a register. */
4345 if (longjmps_done
== 1)
4347 /* Came here after the longjmp at the end of the function.
4349 If x == 1, the longjmp has restored the register to its
4350 value before the setjmp, and we can hope that setjmp
4351 saves all such registers in the jmp_buf, although that
4354 For other values of X, either something really strange is
4355 taking place, or the setjmp just didn't save the register. */
4358 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4361 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4368 if (longjmps_done
== 1)
4372 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4375 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4377 /* Abort if anything GCPRO'd doesn't survive the GC. */
4385 for (p
= gcprolist
; p
; p
= p
->next
)
4386 for (i
= 0; i
< p
->nvars
; ++i
)
4387 if (!survives_gc_p (p
->var
[i
]))
4388 /* FIXME: It's not necessarily a bug. It might just be that the
4389 GCPRO is unnecessary or should release the object sooner. */
4393 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4400 fprintf (stderr
, "\nZombies kept alive = %"pI
":\n", nzombies
);
4401 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4403 fprintf (stderr
, " %d = ", i
);
4404 debug_print (zombies
[i
]);
4408 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4411 /* Mark live Lisp objects on the C stack.
4413 There are several system-dependent problems to consider when
4414 porting this to new architectures:
4418 We have to mark Lisp objects in CPU registers that can hold local
4419 variables or are used to pass parameters.
4421 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4422 something that either saves relevant registers on the stack, or
4423 calls mark_maybe_object passing it each register's contents.
4425 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4426 implementation assumes that calling setjmp saves registers we need
4427 to see in a jmp_buf which itself lies on the stack. This doesn't
4428 have to be true! It must be verified for each system, possibly
4429 by taking a look at the source code of setjmp.
4431 If __builtin_unwind_init is available (defined by GCC >= 2.8) we
4432 can use it as a machine independent method to store all registers
4433 to the stack. In this case the macros described in the previous
4434 two paragraphs are not used.
4438 Architectures differ in the way their processor stack is organized.
4439 For example, the stack might look like this
4442 | Lisp_Object | size = 4
4444 | something else | size = 2
4446 | Lisp_Object | size = 4
4450 In such a case, not every Lisp_Object will be aligned equally. To
4451 find all Lisp_Object on the stack it won't be sufficient to walk
4452 the stack in steps of 4 bytes. Instead, two passes will be
4453 necessary, one starting at the start of the stack, and a second
4454 pass starting at the start of the stack + 2. Likewise, if the
4455 minimal alignment of Lisp_Objects on the stack is 1, four passes
4456 would be necessary, each one starting with one byte more offset
4457 from the stack start.
4459 The current code assumes by default that Lisp_Objects are aligned
4460 equally on the stack. */
4468 #ifdef HAVE___BUILTIN_UNWIND_INIT
4469 /* Force callee-saved registers and register windows onto the stack.
4470 This is the preferred method if available, obviating the need for
4471 machine dependent methods. */
4472 __builtin_unwind_init ();
4474 #else /* not HAVE___BUILTIN_UNWIND_INIT */
4475 #ifndef GC_SAVE_REGISTERS_ON_STACK
4476 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4477 union aligned_jmpbuf
{
4481 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4483 /* This trick flushes the register windows so that all the state of
4484 the process is contained in the stack. */
4485 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4486 needed on ia64 too. See mach_dep.c, where it also says inline
4487 assembler doesn't work with relevant proprietary compilers. */
4489 #if defined (__sparc64__) && defined (__FreeBSD__)
4490 /* FreeBSD does not have a ta 3 handler. */
4497 /* Save registers that we need to see on the stack. We need to see
4498 registers used to hold register variables and registers used to
4500 #ifdef GC_SAVE_REGISTERS_ON_STACK
4501 GC_SAVE_REGISTERS_ON_STACK (end
);
4502 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4504 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4505 setjmp will definitely work, test it
4506 and print a message with the result
4508 if (!setjmp_tested_p
)
4510 setjmp_tested_p
= 1;
4513 #endif /* GC_SETJMP_WORKS */
4516 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4517 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4518 #endif /* not HAVE___BUILTIN_UNWIND_INIT */
4520 /* This assumes that the stack is a contiguous region in memory. If
4521 that's not the case, something has to be done here to iterate
4522 over the stack segments. */
4523 #ifndef GC_LISP_OBJECT_ALIGNMENT
4525 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4527 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4530 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4531 mark_memory (stack_base
, end
, i
);
4532 /* Allow for marking a secondary stack, like the register stack on the
4534 #ifdef GC_MARK_SECONDARY_STACK
4535 GC_MARK_SECONDARY_STACK ();
4538 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4543 #endif /* GC_MARK_STACK != 0 */
4546 /* Determine whether it is safe to access memory at address P. */
4548 valid_pointer_p (void *p
)
4551 return w32_valid_pointer_p (p
, 16);
4555 /* Obviously, we cannot just access it (we would SEGV trying), so we
4556 trick the o/s to tell us whether p is a valid pointer.
4557 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4558 not validate p in that case. */
4562 int valid
= (emacs_write (fd
[1], (char *) p
, 16) == 16);
4563 emacs_close (fd
[1]);
4564 emacs_close (fd
[0]);
4572 /* Return 1 if OBJ is a valid lisp object.
4573 Return 0 if OBJ is NOT a valid lisp object.
4574 Return -1 if we cannot validate OBJ.
4575 This function can be quite slow,
4576 so it should only be used in code for manual debugging. */
4579 valid_lisp_object_p (Lisp_Object obj
)
4589 p
= (void *) XPNTR (obj
);
4590 if (PURE_POINTER_P (p
))
4594 return valid_pointer_p (p
);
4601 int valid
= valid_pointer_p (p
);
4613 case MEM_TYPE_NON_LISP
:
4616 case MEM_TYPE_BUFFER
:
4617 return live_buffer_p (m
, p
);
4620 return live_cons_p (m
, p
);
4622 case MEM_TYPE_STRING
:
4623 return live_string_p (m
, p
);
4626 return live_misc_p (m
, p
);
4628 case MEM_TYPE_SYMBOL
:
4629 return live_symbol_p (m
, p
);
4631 case MEM_TYPE_FLOAT
:
4632 return live_float_p (m
, p
);
4634 case MEM_TYPE_VECTORLIKE
:
4635 return live_vector_p (m
, p
);
4648 /***********************************************************************
4649 Pure Storage Management
4650 ***********************************************************************/
4652 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4653 pointer to it. TYPE is the Lisp type for which the memory is
4654 allocated. TYPE < 0 means it's not used for a Lisp object. */
4656 static POINTER_TYPE
*
4657 pure_alloc (size_t size
, int type
)
4659 POINTER_TYPE
*result
;
4661 size_t alignment
= (1 << GCTYPEBITS
);
4663 size_t alignment
= sizeof (EMACS_INT
);
4665 /* Give Lisp_Floats an extra alignment. */
4666 if (type
== Lisp_Float
)
4668 #if defined __GNUC__ && __GNUC__ >= 2
4669 alignment
= __alignof (struct Lisp_Float
);
4671 alignment
= sizeof (struct Lisp_Float
);
4679 /* Allocate space for a Lisp object from the beginning of the free
4680 space with taking account of alignment. */
4681 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4682 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4686 /* Allocate space for a non-Lisp object from the end of the free
4688 pure_bytes_used_non_lisp
+= size
;
4689 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4691 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4693 if (pure_bytes_used
<= pure_size
)
4696 /* Don't allocate a large amount here,
4697 because it might get mmap'd and then its address
4698 might not be usable. */
4699 purebeg
= (char *) xmalloc (10000);
4701 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4702 pure_bytes_used
= 0;
4703 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4708 /* Print a warning if PURESIZE is too small. */
4711 check_pure_size (void)
4713 if (pure_bytes_used_before_overflow
)
4714 message (("emacs:0:Pure Lisp storage overflow (approx. %"pI
"d"
4716 pure_bytes_used
+ pure_bytes_used_before_overflow
);
4720 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4721 the non-Lisp data pool of the pure storage, and return its start
4722 address. Return NULL if not found. */
4725 find_string_data_in_pure (const char *data
, EMACS_INT nbytes
)
4728 EMACS_INT skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4729 const unsigned char *p
;
4732 if (pure_bytes_used_non_lisp
< nbytes
+ 1)
4735 /* Set up the Boyer-Moore table. */
4737 for (i
= 0; i
< 256; i
++)
4740 p
= (const unsigned char *) data
;
4742 bm_skip
[*p
++] = skip
;
4744 last_char_skip
= bm_skip
['\0'];
4746 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4747 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4749 /* See the comments in the function `boyer_moore' (search.c) for the
4750 use of `infinity'. */
4751 infinity
= pure_bytes_used_non_lisp
+ 1;
4752 bm_skip
['\0'] = infinity
;
4754 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
4758 /* Check the last character (== '\0'). */
4761 start
+= bm_skip
[*(p
+ start
)];
4763 while (start
<= start_max
);
4765 if (start
< infinity
)
4766 /* Couldn't find the last character. */
4769 /* No less than `infinity' means we could find the last
4770 character at `p[start - infinity]'. */
4773 /* Check the remaining characters. */
4774 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4776 return non_lisp_beg
+ start
;
4778 start
+= last_char_skip
;
4780 while (start
<= start_max
);
4786 /* Return a string allocated in pure space. DATA is a buffer holding
4787 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4788 non-zero means make the result string multibyte.
4790 Must get an error if pure storage is full, since if it cannot hold
4791 a large string it may be able to hold conses that point to that
4792 string; then the string is not protected from gc. */
4795 make_pure_string (const char *data
,
4796 EMACS_INT nchars
, EMACS_INT nbytes
, int multibyte
)
4799 struct Lisp_String
*s
;
4801 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4802 s
->data
= (unsigned char *) find_string_data_in_pure (data
, nbytes
);
4803 if (s
->data
== NULL
)
4805 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4806 memcpy (s
->data
, data
, nbytes
);
4807 s
->data
[nbytes
] = '\0';
4810 s
->size_byte
= multibyte
? nbytes
: -1;
4811 s
->intervals
= NULL_INTERVAL
;
4812 XSETSTRING (string
, s
);
4816 /* Return a string a string allocated in pure space. Do not allocate
4817 the string data, just point to DATA. */
4820 make_pure_c_string (const char *data
)
4823 struct Lisp_String
*s
;
4824 EMACS_INT nchars
= strlen (data
);
4826 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4829 s
->data
= (unsigned char *) data
;
4830 s
->intervals
= NULL_INTERVAL
;
4831 XSETSTRING (string
, s
);
4835 /* Return a cons allocated from pure space. Give it pure copies
4836 of CAR as car and CDR as cdr. */
4839 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
4841 register Lisp_Object
new;
4842 struct Lisp_Cons
*p
;
4844 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4846 XSETCAR (new, Fpurecopy (car
));
4847 XSETCDR (new, Fpurecopy (cdr
));
4852 /* Value is a float object with value NUM allocated from pure space. */
4855 make_pure_float (double num
)
4857 register Lisp_Object
new;
4858 struct Lisp_Float
*p
;
4860 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4862 XFLOAT_INIT (new, num
);
4867 /* Return a vector with room for LEN Lisp_Objects allocated from
4871 make_pure_vector (EMACS_INT len
)
4874 struct Lisp_Vector
*p
;
4875 size_t size
= (offsetof (struct Lisp_Vector
, contents
)
4876 + len
* sizeof (Lisp_Object
));
4878 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4879 XSETVECTOR (new, p
);
4880 XVECTOR (new)->header
.size
= len
;
4885 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4886 doc
: /* Make a copy of object OBJ in pure storage.
4887 Recursively copies contents of vectors and cons cells.
4888 Does not copy symbols. Copies strings without text properties. */)
4889 (register Lisp_Object obj
)
4891 if (NILP (Vpurify_flag
))
4894 if (PURE_POINTER_P (XPNTR (obj
)))
4897 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4899 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
4905 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
4906 else if (FLOATP (obj
))
4907 obj
= make_pure_float (XFLOAT_DATA (obj
));
4908 else if (STRINGP (obj
))
4909 obj
= make_pure_string (SSDATA (obj
), SCHARS (obj
),
4911 STRING_MULTIBYTE (obj
));
4912 else if (COMPILEDP (obj
) || VECTORP (obj
))
4914 register struct Lisp_Vector
*vec
;
4915 register EMACS_INT i
;
4919 if (size
& PSEUDOVECTOR_FLAG
)
4920 size
&= PSEUDOVECTOR_SIZE_MASK
;
4921 vec
= XVECTOR (make_pure_vector (size
));
4922 for (i
= 0; i
< size
; i
++)
4923 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4924 if (COMPILEDP (obj
))
4926 XSETPVECTYPE (vec
, PVEC_COMPILED
);
4927 XSETCOMPILED (obj
, vec
);
4930 XSETVECTOR (obj
, vec
);
4932 else if (MARKERP (obj
))
4933 error ("Attempt to copy a marker to pure storage");
4935 /* Not purified, don't hash-cons. */
4938 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4939 Fputhash (obj
, obj
, Vpurify_flag
);
4946 /***********************************************************************
4948 ***********************************************************************/
4950 /* Put an entry in staticvec, pointing at the variable with address
4954 staticpro (Lisp_Object
*varaddress
)
4956 staticvec
[staticidx
++] = varaddress
;
4957 if (staticidx
>= NSTATICS
)
4962 /***********************************************************************
4964 ***********************************************************************/
4966 /* Temporarily prevent garbage collection. */
4969 inhibit_garbage_collection (void)
4971 int count
= SPECPDL_INDEX ();
4973 specbind (Qgc_cons_threshold
, make_number (MOST_POSITIVE_FIXNUM
));
4978 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4979 doc
: /* Reclaim storage for Lisp objects no longer needed.
4980 Garbage collection happens automatically if you cons more than
4981 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4982 `garbage-collect' normally returns a list with info on amount of space in use:
4983 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4984 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4985 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4986 (USED-STRINGS . FREE-STRINGS))
4987 However, if there was overflow in pure space, `garbage-collect'
4988 returns nil, because real GC can't be done. */)
4991 register struct specbinding
*bind
;
4992 char stack_top_variable
;
4995 Lisp_Object total
[8];
4996 int count
= SPECPDL_INDEX ();
4997 EMACS_TIME t1
, t2
, t3
;
5002 /* Can't GC if pure storage overflowed because we can't determine
5003 if something is a pure object or not. */
5004 if (pure_bytes_used_before_overflow
)
5009 /* Don't keep undo information around forever.
5010 Do this early on, so it is no problem if the user quits. */
5012 register struct buffer
*nextb
= all_buffers
;
5016 /* If a buffer's undo list is Qt, that means that undo is
5017 turned off in that buffer. Calling truncate_undo_list on
5018 Qt tends to return NULL, which effectively turns undo back on.
5019 So don't call truncate_undo_list if undo_list is Qt. */
5020 if (! NILP (nextb
->BUFFER_INTERNAL_FIELD (name
)) && ! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
5021 truncate_undo_list (nextb
);
5023 /* Shrink buffer gaps, but skip indirect and dead buffers. */
5024 if (nextb
->base_buffer
== 0 && !NILP (nextb
->BUFFER_INTERNAL_FIELD (name
))
5025 && ! nextb
->text
->inhibit_shrinking
)
5027 /* If a buffer's gap size is more than 10% of the buffer
5028 size, or larger than 2000 bytes, then shrink it
5029 accordingly. Keep a minimum size of 20 bytes. */
5030 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
5032 if (nextb
->text
->gap_size
> size
)
5034 struct buffer
*save_current
= current_buffer
;
5035 current_buffer
= nextb
;
5036 make_gap (-(nextb
->text
->gap_size
- size
));
5037 current_buffer
= save_current
;
5041 nextb
= nextb
->header
.next
.buffer
;
5045 EMACS_GET_TIME (t1
);
5047 /* In case user calls debug_print during GC,
5048 don't let that cause a recursive GC. */
5049 consing_since_gc
= 0;
5051 /* Save what's currently displayed in the echo area. */
5052 message_p
= push_message ();
5053 record_unwind_protect (pop_message_unwind
, Qnil
);
5055 /* Save a copy of the contents of the stack, for debugging. */
5056 #if MAX_SAVE_STACK > 0
5057 if (NILP (Vpurify_flag
))
5060 ptrdiff_t stack_size
;
5061 if (&stack_top_variable
< stack_bottom
)
5063 stack
= &stack_top_variable
;
5064 stack_size
= stack_bottom
- &stack_top_variable
;
5068 stack
= stack_bottom
;
5069 stack_size
= &stack_top_variable
- stack_bottom
;
5071 if (stack_size
<= MAX_SAVE_STACK
)
5073 if (stack_copy_size
< stack_size
)
5075 stack_copy
= (char *) xrealloc (stack_copy
, stack_size
);
5076 stack_copy_size
= stack_size
;
5078 memcpy (stack_copy
, stack
, stack_size
);
5081 #endif /* MAX_SAVE_STACK > 0 */
5083 if (garbage_collection_messages
)
5084 message1_nolog ("Garbage collecting...");
5088 shrink_regexp_cache ();
5092 /* clear_marks (); */
5094 /* Mark all the special slots that serve as the roots of accessibility. */
5096 for (i
= 0; i
< staticidx
; i
++)
5097 mark_object (*staticvec
[i
]);
5099 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
5101 mark_object (bind
->symbol
);
5102 mark_object (bind
->old_value
);
5110 extern void xg_mark_data (void);
5115 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5116 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5120 register struct gcpro
*tail
;
5121 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5122 for (i
= 0; i
< tail
->nvars
; i
++)
5123 mark_object (tail
->var
[i
]);
5127 struct catchtag
*catch;
5128 struct handler
*handler
;
5130 for (catch = catchlist
; catch; catch = catch->next
)
5132 mark_object (catch->tag
);
5133 mark_object (catch->val
);
5135 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5137 mark_object (handler
->handler
);
5138 mark_object (handler
->var
);
5144 #ifdef HAVE_WINDOW_SYSTEM
5145 mark_fringe_data ();
5148 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5152 /* Everything is now marked, except for the things that require special
5153 finalization, i.e. the undo_list.
5154 Look thru every buffer's undo list
5155 for elements that update markers that were not marked,
5158 register struct buffer
*nextb
= all_buffers
;
5162 /* If a buffer's undo list is Qt, that means that undo is
5163 turned off in that buffer. Calling truncate_undo_list on
5164 Qt tends to return NULL, which effectively turns undo back on.
5165 So don't call truncate_undo_list if undo_list is Qt. */
5166 if (! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
5168 Lisp_Object tail
, prev
;
5169 tail
= nextb
->BUFFER_INTERNAL_FIELD (undo_list
);
5171 while (CONSP (tail
))
5173 if (CONSP (XCAR (tail
))
5174 && MARKERP (XCAR (XCAR (tail
)))
5175 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5178 nextb
->BUFFER_INTERNAL_FIELD (undo_list
) = tail
= XCDR (tail
);
5182 XSETCDR (prev
, tail
);
5192 /* Now that we have stripped the elements that need not be in the
5193 undo_list any more, we can finally mark the list. */
5194 mark_object (nextb
->BUFFER_INTERNAL_FIELD (undo_list
));
5196 nextb
= nextb
->header
.next
.buffer
;
5202 /* Clear the mark bits that we set in certain root slots. */
5204 unmark_byte_stack ();
5205 VECTOR_UNMARK (&buffer_defaults
);
5206 VECTOR_UNMARK (&buffer_local_symbols
);
5208 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5216 /* clear_marks (); */
5219 consing_since_gc
= 0;
5220 if (gc_cons_threshold
< 10000)
5221 gc_cons_threshold
= 10000;
5223 gc_relative_threshold
= 0;
5224 if (FLOATP (Vgc_cons_percentage
))
5225 { /* Set gc_cons_combined_threshold. */
5228 tot
+= total_conses
* sizeof (struct Lisp_Cons
);
5229 tot
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5230 tot
+= total_markers
* sizeof (union Lisp_Misc
);
5231 tot
+= total_string_size
;
5232 tot
+= total_vector_size
* sizeof (Lisp_Object
);
5233 tot
+= total_floats
* sizeof (struct Lisp_Float
);
5234 tot
+= total_intervals
* sizeof (struct interval
);
5235 tot
+= total_strings
* sizeof (struct Lisp_String
);
5237 tot
*= XFLOAT_DATA (Vgc_cons_percentage
);
5240 if (tot
< TYPE_MAXIMUM (EMACS_INT
))
5241 gc_relative_threshold
= tot
;
5243 gc_relative_threshold
= TYPE_MAXIMUM (EMACS_INT
);
5247 if (garbage_collection_messages
)
5249 if (message_p
|| minibuf_level
> 0)
5252 message1_nolog ("Garbage collecting...done");
5255 unbind_to (count
, Qnil
);
5257 total
[0] = Fcons (make_number (total_conses
),
5258 make_number (total_free_conses
));
5259 total
[1] = Fcons (make_number (total_symbols
),
5260 make_number (total_free_symbols
));
5261 total
[2] = Fcons (make_number (total_markers
),
5262 make_number (total_free_markers
));
5263 total
[3] = make_number (total_string_size
);
5264 total
[4] = make_number (total_vector_size
);
5265 total
[5] = Fcons (make_number (total_floats
),
5266 make_number (total_free_floats
));
5267 total
[6] = Fcons (make_number (total_intervals
),
5268 make_number (total_free_intervals
));
5269 total
[7] = Fcons (make_number (total_strings
),
5270 make_number (total_free_strings
));
5272 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5274 /* Compute average percentage of zombies. */
5277 for (i
= 0; i
< 7; ++i
)
5278 if (CONSP (total
[i
]))
5279 nlive
+= XFASTINT (XCAR (total
[i
]));
5281 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5282 max_live
= max (nlive
, max_live
);
5283 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5284 max_zombies
= max (nzombies
, max_zombies
);
5289 if (!NILP (Vpost_gc_hook
))
5291 int gc_count
= inhibit_garbage_collection ();
5292 safe_run_hooks (Qpost_gc_hook
);
5293 unbind_to (gc_count
, Qnil
);
5296 /* Accumulate statistics. */
5297 EMACS_GET_TIME (t2
);
5298 EMACS_SUB_TIME (t3
, t2
, t1
);
5299 if (FLOATP (Vgc_elapsed
))
5300 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5302 EMACS_USECS (t3
) * 1.0e-6);
5305 return Flist (sizeof total
/ sizeof *total
, total
);
5309 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5310 only interesting objects referenced from glyphs are strings. */
5313 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5315 struct glyph_row
*row
= matrix
->rows
;
5316 struct glyph_row
*end
= row
+ matrix
->nrows
;
5318 for (; row
< end
; ++row
)
5322 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5324 struct glyph
*glyph
= row
->glyphs
[area
];
5325 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5327 for (; glyph
< end_glyph
; ++glyph
)
5328 if (STRINGP (glyph
->object
)
5329 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5330 mark_object (glyph
->object
);
5336 /* Mark Lisp faces in the face cache C. */
5339 mark_face_cache (struct face_cache
*c
)
5344 for (i
= 0; i
< c
->used
; ++i
)
5346 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5350 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5351 mark_object (face
->lface
[j
]);
5359 /* Mark reference to a Lisp_Object.
5360 If the object referred to has not been seen yet, recursively mark
5361 all the references contained in it. */
5363 #define LAST_MARKED_SIZE 500
5364 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5365 static int last_marked_index
;
5367 /* For debugging--call abort when we cdr down this many
5368 links of a list, in mark_object. In debugging,
5369 the call to abort will hit a breakpoint.
5370 Normally this is zero and the check never goes off. */
5371 ptrdiff_t mark_object_loop_halt EXTERNALLY_VISIBLE
;
5374 mark_vectorlike (struct Lisp_Vector
*ptr
)
5376 EMACS_INT size
= ptr
->header
.size
;
5379 eassert (!VECTOR_MARKED_P (ptr
));
5380 VECTOR_MARK (ptr
); /* Else mark it */
5381 if (size
& PSEUDOVECTOR_FLAG
)
5382 size
&= PSEUDOVECTOR_SIZE_MASK
;
5384 /* Note that this size is not the memory-footprint size, but only
5385 the number of Lisp_Object fields that we should trace.
5386 The distinction is used e.g. by Lisp_Process which places extra
5387 non-Lisp_Object fields at the end of the structure. */
5388 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5389 mark_object (ptr
->contents
[i
]);
5392 /* Like mark_vectorlike but optimized for char-tables (and
5393 sub-char-tables) assuming that the contents are mostly integers or
5397 mark_char_table (struct Lisp_Vector
*ptr
)
5399 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5402 eassert (!VECTOR_MARKED_P (ptr
));
5404 for (i
= 0; i
< size
; i
++)
5406 Lisp_Object val
= ptr
->contents
[i
];
5408 if (INTEGERP (val
) || (SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
))
5410 if (SUB_CHAR_TABLE_P (val
))
5412 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5413 mark_char_table (XVECTOR (val
));
5421 mark_object (Lisp_Object arg
)
5423 register Lisp_Object obj
= arg
;
5424 #ifdef GC_CHECK_MARKED_OBJECTS
5428 ptrdiff_t cdr_count
= 0;
5432 if (PURE_POINTER_P (XPNTR (obj
)))
5435 last_marked
[last_marked_index
++] = obj
;
5436 if (last_marked_index
== LAST_MARKED_SIZE
)
5437 last_marked_index
= 0;
5439 /* Perform some sanity checks on the objects marked here. Abort if
5440 we encounter an object we know is bogus. This increases GC time
5441 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5442 #ifdef GC_CHECK_MARKED_OBJECTS
5444 po
= (void *) XPNTR (obj
);
5446 /* Check that the object pointed to by PO is known to be a Lisp
5447 structure allocated from the heap. */
5448 #define CHECK_ALLOCATED() \
5450 m = mem_find (po); \
5455 /* Check that the object pointed to by PO is live, using predicate
5457 #define CHECK_LIVE(LIVEP) \
5459 if (!LIVEP (m, po)) \
5463 /* Check both of the above conditions. */
5464 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5466 CHECK_ALLOCATED (); \
5467 CHECK_LIVE (LIVEP); \
5470 #else /* not GC_CHECK_MARKED_OBJECTS */
5472 #define CHECK_LIVE(LIVEP) (void) 0
5473 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5475 #endif /* not GC_CHECK_MARKED_OBJECTS */
5477 switch (SWITCH_ENUM_CAST (XTYPE (obj
)))
5481 register struct Lisp_String
*ptr
= XSTRING (obj
);
5482 if (STRING_MARKED_P (ptr
))
5484 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5485 MARK_INTERVAL_TREE (ptr
->intervals
);
5487 #ifdef GC_CHECK_STRING_BYTES
5488 /* Check that the string size recorded in the string is the
5489 same as the one recorded in the sdata structure. */
5490 CHECK_STRING_BYTES (ptr
);
5491 #endif /* GC_CHECK_STRING_BYTES */
5495 case Lisp_Vectorlike
:
5496 if (VECTOR_MARKED_P (XVECTOR (obj
)))
5498 #ifdef GC_CHECK_MARKED_OBJECTS
5500 if (m
== MEM_NIL
&& !SUBRP (obj
)
5501 && po
!= &buffer_defaults
5502 && po
!= &buffer_local_symbols
)
5504 #endif /* GC_CHECK_MARKED_OBJECTS */
5508 #ifdef GC_CHECK_MARKED_OBJECTS
5509 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5512 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->header
.next
.buffer
)
5517 #endif /* GC_CHECK_MARKED_OBJECTS */
5520 else if (SUBRP (obj
))
5522 else if (COMPILEDP (obj
))
5523 /* We could treat this just like a vector, but it is better to
5524 save the COMPILED_CONSTANTS element for last and avoid
5527 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5528 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5531 CHECK_LIVE (live_vector_p
);
5532 VECTOR_MARK (ptr
); /* Else mark it */
5533 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5535 if (i
!= COMPILED_CONSTANTS
)
5536 mark_object (ptr
->contents
[i
]);
5538 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5541 else if (FRAMEP (obj
))
5543 register struct frame
*ptr
= XFRAME (obj
);
5544 mark_vectorlike (XVECTOR (obj
));
5545 mark_face_cache (ptr
->face_cache
);
5547 else if (WINDOWP (obj
))
5549 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5550 struct window
*w
= XWINDOW (obj
);
5551 mark_vectorlike (ptr
);
5552 /* Mark glyphs for leaf windows. Marking window matrices is
5553 sufficient because frame matrices use the same glyph
5555 if (NILP (w
->hchild
)
5557 && w
->current_matrix
)
5559 mark_glyph_matrix (w
->current_matrix
);
5560 mark_glyph_matrix (w
->desired_matrix
);
5563 else if (HASH_TABLE_P (obj
))
5565 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5566 mark_vectorlike ((struct Lisp_Vector
*)h
);
5567 /* If hash table is not weak, mark all keys and values.
5568 For weak tables, mark only the vector. */
5570 mark_object (h
->key_and_value
);
5572 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5574 else if (CHAR_TABLE_P (obj
))
5575 mark_char_table (XVECTOR (obj
));
5577 mark_vectorlike (XVECTOR (obj
));
5582 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5583 struct Lisp_Symbol
*ptrx
;
5587 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5589 mark_object (ptr
->function
);
5590 mark_object (ptr
->plist
);
5591 switch (ptr
->redirect
)
5593 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
5594 case SYMBOL_VARALIAS
:
5597 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
5601 case SYMBOL_LOCALIZED
:
5603 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
5604 /* If the value is forwarded to a buffer or keyboard field,
5605 these are marked when we see the corresponding object.
5606 And if it's forwarded to a C variable, either it's not
5607 a Lisp_Object var, or it's staticpro'd already. */
5608 mark_object (blv
->where
);
5609 mark_object (blv
->valcell
);
5610 mark_object (blv
->defcell
);
5613 case SYMBOL_FORWARDED
:
5614 /* If the value is forwarded to a buffer or keyboard field,
5615 these are marked when we see the corresponding object.
5616 And if it's forwarded to a C variable, either it's not
5617 a Lisp_Object var, or it's staticpro'd already. */
5621 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5622 MARK_STRING (XSTRING (ptr
->xname
));
5623 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5628 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5629 XSETSYMBOL (obj
, ptrx
);
5636 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5637 if (XMISCANY (obj
)->gcmarkbit
)
5639 XMISCANY (obj
)->gcmarkbit
= 1;
5641 switch (XMISCTYPE (obj
))
5644 case Lisp_Misc_Marker
:
5645 /* DO NOT mark thru the marker's chain.
5646 The buffer's markers chain does not preserve markers from gc;
5647 instead, markers are removed from the chain when freed by gc. */
5650 case Lisp_Misc_Save_Value
:
5653 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5654 /* If DOGC is set, POINTER is the address of a memory
5655 area containing INTEGER potential Lisp_Objects. */
5658 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5660 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5661 mark_maybe_object (*p
);
5667 case Lisp_Misc_Overlay
:
5669 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5670 mark_object (ptr
->start
);
5671 mark_object (ptr
->end
);
5672 mark_object (ptr
->plist
);
5675 XSETMISC (obj
, ptr
->next
);
5688 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5689 if (CONS_MARKED_P (ptr
))
5691 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5693 /* If the cdr is nil, avoid recursion for the car. */
5694 if (EQ (ptr
->u
.cdr
, Qnil
))
5700 mark_object (ptr
->car
);
5703 if (cdr_count
== mark_object_loop_halt
)
5709 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5710 FLOAT_MARK (XFLOAT (obj
));
5721 #undef CHECK_ALLOCATED
5722 #undef CHECK_ALLOCATED_AND_LIVE
5725 /* Mark the pointers in a buffer structure. */
5728 mark_buffer (Lisp_Object buf
)
5730 register struct buffer
*buffer
= XBUFFER (buf
);
5731 register Lisp_Object
*ptr
, tmp
;
5732 Lisp_Object base_buffer
;
5734 eassert (!VECTOR_MARKED_P (buffer
));
5735 VECTOR_MARK (buffer
);
5737 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5739 /* For now, we just don't mark the undo_list. It's done later in
5740 a special way just before the sweep phase, and after stripping
5741 some of its elements that are not needed any more. */
5743 if (buffer
->overlays_before
)
5745 XSETMISC (tmp
, buffer
->overlays_before
);
5748 if (buffer
->overlays_after
)
5750 XSETMISC (tmp
, buffer
->overlays_after
);
5754 /* buffer-local Lisp variables start at `undo_list',
5755 tho only the ones from `name' on are GC'd normally. */
5756 for (ptr
= &buffer
->BUFFER_INTERNAL_FIELD (name
);
5757 ptr
<= &PER_BUFFER_VALUE (buffer
,
5758 PER_BUFFER_VAR_OFFSET (LAST_FIELD_PER_BUFFER
));
5762 /* If this is an indirect buffer, mark its base buffer. */
5763 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5765 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5766 mark_buffer (base_buffer
);
5770 /* Mark the Lisp pointers in the terminal objects.
5771 Called by the Fgarbage_collector. */
5774 mark_terminals (void)
5777 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5779 eassert (t
->name
!= NULL
);
5780 #ifdef HAVE_WINDOW_SYSTEM
5781 /* If a terminal object is reachable from a stacpro'ed object,
5782 it might have been marked already. Make sure the image cache
5784 mark_image_cache (t
->image_cache
);
5785 #endif /* HAVE_WINDOW_SYSTEM */
5786 if (!VECTOR_MARKED_P (t
))
5787 mark_vectorlike ((struct Lisp_Vector
*)t
);
5793 /* Value is non-zero if OBJ will survive the current GC because it's
5794 either marked or does not need to be marked to survive. */
5797 survives_gc_p (Lisp_Object obj
)
5801 switch (XTYPE (obj
))
5808 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5812 survives_p
= XMISCANY (obj
)->gcmarkbit
;
5816 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5819 case Lisp_Vectorlike
:
5820 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5824 survives_p
= CONS_MARKED_P (XCONS (obj
));
5828 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5835 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5840 /* Sweep: find all structures not marked, and free them. */
5845 /* Remove or mark entries in weak hash tables.
5846 This must be done before any object is unmarked. */
5847 sweep_weak_hash_tables ();
5850 #ifdef GC_CHECK_STRING_BYTES
5851 if (!noninteractive
)
5852 check_string_bytes (1);
5855 /* Put all unmarked conses on free list */
5857 register struct cons_block
*cblk
;
5858 struct cons_block
**cprev
= &cons_block
;
5859 register int lim
= cons_block_index
;
5860 EMACS_INT num_free
= 0, num_used
= 0;
5864 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5868 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
5870 /* Scan the mark bits an int at a time. */
5871 for (i
= 0; i
< ilim
; i
++)
5873 if (cblk
->gcmarkbits
[i
] == -1)
5875 /* Fast path - all cons cells for this int are marked. */
5876 cblk
->gcmarkbits
[i
] = 0;
5877 num_used
+= BITS_PER_INT
;
5881 /* Some cons cells for this int are not marked.
5882 Find which ones, and free them. */
5883 int start
, pos
, stop
;
5885 start
= i
* BITS_PER_INT
;
5887 if (stop
> BITS_PER_INT
)
5888 stop
= BITS_PER_INT
;
5891 for (pos
= start
; pos
< stop
; pos
++)
5893 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
5896 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
5897 cons_free_list
= &cblk
->conses
[pos
];
5899 cons_free_list
->car
= Vdead
;
5905 CONS_UNMARK (&cblk
->conses
[pos
]);
5911 lim
= CONS_BLOCK_SIZE
;
5912 /* If this block contains only free conses and we have already
5913 seen more than two blocks worth of free conses then deallocate
5915 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5917 *cprev
= cblk
->next
;
5918 /* Unhook from the free list. */
5919 cons_free_list
= cblk
->conses
[0].u
.chain
;
5920 lisp_align_free (cblk
);
5924 num_free
+= this_free
;
5925 cprev
= &cblk
->next
;
5928 total_conses
= num_used
;
5929 total_free_conses
= num_free
;
5932 /* Put all unmarked floats on free list */
5934 register struct float_block
*fblk
;
5935 struct float_block
**fprev
= &float_block
;
5936 register int lim
= float_block_index
;
5937 EMACS_INT num_free
= 0, num_used
= 0;
5939 float_free_list
= 0;
5941 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5945 for (i
= 0; i
< lim
; i
++)
5946 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5949 fblk
->floats
[i
].u
.chain
= float_free_list
;
5950 float_free_list
= &fblk
->floats
[i
];
5955 FLOAT_UNMARK (&fblk
->floats
[i
]);
5957 lim
= FLOAT_BLOCK_SIZE
;
5958 /* If this block contains only free floats and we have already
5959 seen more than two blocks worth of free floats then deallocate
5961 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5963 *fprev
= fblk
->next
;
5964 /* Unhook from the free list. */
5965 float_free_list
= fblk
->floats
[0].u
.chain
;
5966 lisp_align_free (fblk
);
5970 num_free
+= this_free
;
5971 fprev
= &fblk
->next
;
5974 total_floats
= num_used
;
5975 total_free_floats
= num_free
;
5978 /* Put all unmarked intervals on free list */
5980 register struct interval_block
*iblk
;
5981 struct interval_block
**iprev
= &interval_block
;
5982 register int lim
= interval_block_index
;
5983 EMACS_INT num_free
= 0, num_used
= 0;
5985 interval_free_list
= 0;
5987 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5992 for (i
= 0; i
< lim
; i
++)
5994 if (!iblk
->intervals
[i
].gcmarkbit
)
5996 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5997 interval_free_list
= &iblk
->intervals
[i
];
6003 iblk
->intervals
[i
].gcmarkbit
= 0;
6006 lim
= INTERVAL_BLOCK_SIZE
;
6007 /* If this block contains only free intervals and we have already
6008 seen more than two blocks worth of free intervals then
6009 deallocate this block. */
6010 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
6012 *iprev
= iblk
->next
;
6013 /* Unhook from the free list. */
6014 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
6019 num_free
+= this_free
;
6020 iprev
= &iblk
->next
;
6023 total_intervals
= num_used
;
6024 total_free_intervals
= num_free
;
6027 /* Put all unmarked symbols on free list */
6029 register struct symbol_block
*sblk
;
6030 struct symbol_block
**sprev
= &symbol_block
;
6031 register int lim
= symbol_block_index
;
6032 EMACS_INT num_free
= 0, num_used
= 0;
6034 symbol_free_list
= NULL
;
6036 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
6039 struct Lisp_Symbol
*sym
= sblk
->symbols
;
6040 struct Lisp_Symbol
*end
= sym
+ lim
;
6042 for (; sym
< end
; ++sym
)
6044 /* Check if the symbol was created during loadup. In such a case
6045 it might be pointed to by pure bytecode which we don't trace,
6046 so we conservatively assume that it is live. */
6047 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
6049 if (!sym
->gcmarkbit
&& !pure_p
)
6051 if (sym
->redirect
== SYMBOL_LOCALIZED
)
6052 xfree (SYMBOL_BLV (sym
));
6053 sym
->next
= symbol_free_list
;
6054 symbol_free_list
= sym
;
6056 symbol_free_list
->function
= Vdead
;
6064 UNMARK_STRING (XSTRING (sym
->xname
));
6069 lim
= SYMBOL_BLOCK_SIZE
;
6070 /* If this block contains only free symbols and we have already
6071 seen more than two blocks worth of free symbols then deallocate
6073 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6075 *sprev
= sblk
->next
;
6076 /* Unhook from the free list. */
6077 symbol_free_list
= sblk
->symbols
[0].next
;
6082 num_free
+= this_free
;
6083 sprev
= &sblk
->next
;
6086 total_symbols
= num_used
;
6087 total_free_symbols
= num_free
;
6090 /* Put all unmarked misc's on free list.
6091 For a marker, first unchain it from the buffer it points into. */
6093 register struct marker_block
*mblk
;
6094 struct marker_block
**mprev
= &marker_block
;
6095 register int lim
= marker_block_index
;
6096 EMACS_INT num_free
= 0, num_used
= 0;
6098 marker_free_list
= 0;
6100 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6105 for (i
= 0; i
< lim
; i
++)
6107 if (!mblk
->markers
[i
].u_any
.gcmarkbit
)
6109 if (mblk
->markers
[i
].u_any
.type
== Lisp_Misc_Marker
)
6110 unchain_marker (&mblk
->markers
[i
].u_marker
);
6111 /* Set the type of the freed object to Lisp_Misc_Free.
6112 We could leave the type alone, since nobody checks it,
6113 but this might catch bugs faster. */
6114 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
6115 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
6116 marker_free_list
= &mblk
->markers
[i
];
6122 mblk
->markers
[i
].u_any
.gcmarkbit
= 0;
6125 lim
= MARKER_BLOCK_SIZE
;
6126 /* If this block contains only free markers and we have already
6127 seen more than two blocks worth of free markers then deallocate
6129 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6131 *mprev
= mblk
->next
;
6132 /* Unhook from the free list. */
6133 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
6138 num_free
+= this_free
;
6139 mprev
= &mblk
->next
;
6143 total_markers
= num_used
;
6144 total_free_markers
= num_free
;
6147 /* Free all unmarked buffers */
6149 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6152 if (!VECTOR_MARKED_P (buffer
))
6155 prev
->header
.next
= buffer
->header
.next
;
6157 all_buffers
= buffer
->header
.next
.buffer
;
6158 next
= buffer
->header
.next
.buffer
;
6164 VECTOR_UNMARK (buffer
);
6165 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6166 prev
= buffer
, buffer
= buffer
->header
.next
.buffer
;
6170 /* Free all unmarked vectors */
6172 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6173 total_vector_size
= 0;
6176 if (!VECTOR_MARKED_P (vector
))
6179 prev
->header
.next
= vector
->header
.next
;
6181 all_vectors
= vector
->header
.next
.vector
;
6182 next
= vector
->header
.next
.vector
;
6189 VECTOR_UNMARK (vector
);
6190 if (vector
->header
.size
& PSEUDOVECTOR_FLAG
)
6191 total_vector_size
+= PSEUDOVECTOR_SIZE_MASK
& vector
->header
.size
;
6193 total_vector_size
+= vector
->header
.size
;
6194 prev
= vector
, vector
= vector
->header
.next
.vector
;
6198 #ifdef GC_CHECK_STRING_BYTES
6199 if (!noninteractive
)
6200 check_string_bytes (1);
6207 /* Debugging aids. */
6209 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6210 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6211 This may be helpful in debugging Emacs's memory usage.
6212 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6217 XSETINT (end
, (intptr_t) (char *) sbrk (0) / 1024);
6222 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6223 doc
: /* Return a list of counters that measure how much consing there has been.
6224 Each of these counters increments for a certain kind of object.
6225 The counters wrap around from the largest positive integer to zero.
6226 Garbage collection does not decrease them.
6227 The elements of the value are as follows:
6228 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6229 All are in units of 1 = one object consed
6230 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6232 MISCS include overlays, markers, and some internal types.
6233 Frames, windows, buffers, and subprocesses count as vectors
6234 (but the contents of a buffer's text do not count here). */)
6237 Lisp_Object consed
[8];
6239 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6240 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6241 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6242 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6243 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6244 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6245 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6246 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6248 return Flist (8, consed
);
6251 #ifdef ENABLE_CHECKING
6252 int suppress_checking
;
6255 die (const char *msg
, const char *file
, int line
)
6257 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6263 /* Initialization */
6266 init_alloc_once (void)
6268 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6270 pure_size
= PURESIZE
;
6271 pure_bytes_used
= 0;
6272 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6273 pure_bytes_used_before_overflow
= 0;
6275 /* Initialize the list of free aligned blocks. */
6278 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6280 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6284 ignore_warnings
= 1;
6285 #ifdef DOUG_LEA_MALLOC
6286 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6287 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6288 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6296 init_weak_hash_tables ();
6299 malloc_hysteresis
= 32;
6301 malloc_hysteresis
= 0;
6304 refill_memory_reserve ();
6306 ignore_warnings
= 0;
6308 byte_stack_list
= 0;
6310 consing_since_gc
= 0;
6311 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6312 gc_relative_threshold
= 0;
6319 byte_stack_list
= 0;
6321 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6322 setjmp_tested_p
= longjmps_done
= 0;
6325 Vgc_elapsed
= make_float (0.0);
6330 syms_of_alloc (void)
6332 DEFVAR_INT ("gc-cons-threshold", gc_cons_threshold
,
6333 doc
: /* *Number of bytes of consing between garbage collections.
6334 Garbage collection can happen automatically once this many bytes have been
6335 allocated since the last garbage collection. All data types count.
6337 Garbage collection happens automatically only when `eval' is called.
6339 By binding this temporarily to a large number, you can effectively
6340 prevent garbage collection during a part of the program.
6341 See also `gc-cons-percentage'. */);
6343 DEFVAR_LISP ("gc-cons-percentage", Vgc_cons_percentage
,
6344 doc
: /* *Portion of the heap used for allocation.
6345 Garbage collection can happen automatically once this portion of the heap
6346 has been allocated since the last garbage collection.
6347 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6348 Vgc_cons_percentage
= make_float (0.1);
6350 DEFVAR_INT ("pure-bytes-used", pure_bytes_used
,
6351 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6353 DEFVAR_INT ("cons-cells-consed", cons_cells_consed
,
6354 doc
: /* Number of cons cells that have been consed so far. */);
6356 DEFVAR_INT ("floats-consed", floats_consed
,
6357 doc
: /* Number of floats that have been consed so far. */);
6359 DEFVAR_INT ("vector-cells-consed", vector_cells_consed
,
6360 doc
: /* Number of vector cells that have been consed so far. */);
6362 DEFVAR_INT ("symbols-consed", symbols_consed
,
6363 doc
: /* Number of symbols that have been consed so far. */);
6365 DEFVAR_INT ("string-chars-consed", string_chars_consed
,
6366 doc
: /* Number of string characters that have been consed so far. */);
6368 DEFVAR_INT ("misc-objects-consed", misc_objects_consed
,
6369 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6371 DEFVAR_INT ("intervals-consed", intervals_consed
,
6372 doc
: /* Number of intervals that have been consed so far. */);
6374 DEFVAR_INT ("strings-consed", strings_consed
,
6375 doc
: /* Number of strings that have been consed so far. */);
6377 DEFVAR_LISP ("purify-flag", Vpurify_flag
,
6378 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6379 This means that certain objects should be allocated in shared (pure) space.
6380 It can also be set to a hash-table, in which case this table is used to
6381 do hash-consing of the objects allocated to pure space. */);
6383 DEFVAR_BOOL ("garbage-collection-messages", garbage_collection_messages
,
6384 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6385 garbage_collection_messages
= 0;
6387 DEFVAR_LISP ("post-gc-hook", Vpost_gc_hook
,
6388 doc
: /* Hook run after garbage collection has finished. */);
6389 Vpost_gc_hook
= Qnil
;
6390 DEFSYM (Qpost_gc_hook
, "post-gc-hook");
6392 DEFVAR_LISP ("memory-signal-data", Vmemory_signal_data
,
6393 doc
: /* Precomputed `signal' argument for memory-full error. */);
6394 /* We build this in advance because if we wait until we need it, we might
6395 not be able to allocate the memory to hold it. */
6397 = pure_cons (Qerror
,
6398 pure_cons (make_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"), Qnil
));
6400 DEFVAR_LISP ("memory-full", Vmemory_full
,
6401 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6402 Vmemory_full
= Qnil
;
6404 DEFSYM (Qgc_cons_threshold
, "gc-cons-threshold");
6405 DEFSYM (Qchar_table_extra_slots
, "char-table-extra-slots");
6407 DEFVAR_LISP ("gc-elapsed", Vgc_elapsed
,
6408 doc
: /* Accumulated time elapsed in garbage collections.
6409 The time is in seconds as a floating point value. */);
6410 DEFVAR_INT ("gcs-done", gcs_done
,
6411 doc
: /* Accumulated number of garbage collections done. */);
6416 defsubr (&Smake_byte_code
);
6417 defsubr (&Smake_list
);
6418 defsubr (&Smake_vector
);
6419 defsubr (&Smake_string
);
6420 defsubr (&Smake_bool_vector
);
6421 defsubr (&Smake_symbol
);
6422 defsubr (&Smake_marker
);
6423 defsubr (&Spurecopy
);
6424 defsubr (&Sgarbage_collect
);
6425 defsubr (&Smemory_limit
);
6426 defsubr (&Smemory_use_counts
);
6428 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6429 defsubr (&Sgc_status
);