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. */
27 #ifdef HAVE_GTK_AND_PTHREAD
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
88 #ifdef HAVE_GTK_AND_PTHREAD
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 If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_*
96 functions below are called from malloc, there is a chance that one
97 of these threads preempts the Emacs main thread and the hook variables
98 end up in an inconsistent state. So we have a mutex to prevent that (note
99 that the backend handles concurrent access to malloc within its own threads
100 but Emacs code running in the main thread is not included in that control).
102 When UNBLOCK_INPUT is called, reinvoke_input_signal may be called. If this
103 happens in one of the backend threads we will have two threads that tries
104 to run Emacs code at once, and the code is not prepared for that.
105 To prevent that, we only call BLOCK/UNBLOCK from the main thread. */
107 static pthread_mutex_t alloc_mutex
;
109 #define BLOCK_INPUT_ALLOC \
112 if (pthread_equal (pthread_self (), main_thread)) \
114 pthread_mutex_lock (&alloc_mutex); \
117 #define UNBLOCK_INPUT_ALLOC \
120 pthread_mutex_unlock (&alloc_mutex); \
121 if (pthread_equal (pthread_self (), main_thread)) \
126 #else /* ! defined HAVE_GTK_AND_PTHREAD */
128 #define BLOCK_INPUT_ALLOC BLOCK_INPUT
129 #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT
131 #endif /* ! defined HAVE_GTK_AND_PTHREAD */
132 #endif /* ! defined SYSTEM_MALLOC && ! defined SYNC_INPUT */
134 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
135 to a struct Lisp_String. */
137 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
138 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
139 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
141 #define VECTOR_MARK(V) ((V)->header.size |= ARRAY_MARK_FLAG)
142 #define VECTOR_UNMARK(V) ((V)->header.size &= ~ARRAY_MARK_FLAG)
143 #define VECTOR_MARKED_P(V) (((V)->header.size & ARRAY_MARK_FLAG) != 0)
145 /* Value is the number of bytes of S, a pointer to a struct Lisp_String.
146 Be careful during GC, because S->size contains the mark bit for
149 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
151 /* Global variables. */
152 struct emacs_globals globals
;
154 /* Number of bytes of consing done since the last gc. */
156 EMACS_INT consing_since_gc
;
158 /* Similar minimum, computed from Vgc_cons_percentage. */
160 EMACS_INT gc_relative_threshold
;
162 /* Minimum number of bytes of consing since GC before next GC,
163 when memory is full. */
165 EMACS_INT memory_full_cons_threshold
;
167 /* Nonzero during GC. */
171 /* Nonzero means abort if try to GC.
172 This is for code which is written on the assumption that
173 no GC will happen, so as to verify that assumption. */
177 /* Number of live and free conses etc. */
179 static EMACS_INT total_conses
, total_markers
, total_symbols
, total_vector_size
;
180 static EMACS_INT total_free_conses
, total_free_markers
, total_free_symbols
;
181 static EMACS_INT total_free_floats
, total_floats
;
183 /* Points to memory space allocated as "spare", to be freed if we run
184 out of memory. We keep one large block, four cons-blocks, and
185 two string blocks. */
187 static char *spare_memory
[7];
189 /* Amount of spare memory to keep in large reserve block, or to see
190 whether this much is available when malloc fails on a larger request. */
192 #define SPARE_MEMORY (1 << 14)
194 /* Number of extra blocks malloc should get when it needs more core. */
196 static int malloc_hysteresis
;
198 /* Initialize it to a nonzero value to force it into data space
199 (rather than bss space). That way unexec will remap it into text
200 space (pure), on some systems. We have not implemented the
201 remapping on more recent systems because this is less important
202 nowadays than in the days of small memories and timesharing. */
204 #ifndef VIRT_ADDR_VARIES
207 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
208 #define PUREBEG (char *) pure
210 /* Pointer to the pure area, and its size. */
212 static char *purebeg
;
213 static ptrdiff_t pure_size
;
215 /* Number of bytes of pure storage used before pure storage overflowed.
216 If this is non-zero, this implies that an overflow occurred. */
218 static ptrdiff_t pure_bytes_used_before_overflow
;
220 /* Value is non-zero if P points into pure space. */
222 #define PURE_POINTER_P(P) \
223 (((PNTR_COMPARISON_TYPE) (P) \
224 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
225 && ((PNTR_COMPARISON_TYPE) (P) \
226 >= (PNTR_COMPARISON_TYPE) purebeg))
228 /* Index in pure at which next pure Lisp object will be allocated.. */
230 static EMACS_INT pure_bytes_used_lisp
;
232 /* Number of bytes allocated for non-Lisp objects in pure storage. */
234 static EMACS_INT pure_bytes_used_non_lisp
;
236 /* If nonzero, this is a warning delivered by malloc and not yet
239 const char *pending_malloc_warning
;
241 /* Maximum amount of C stack to save when a GC happens. */
243 #ifndef MAX_SAVE_STACK
244 #define MAX_SAVE_STACK 16000
247 /* Buffer in which we save a copy of the C stack at each GC. */
249 #if MAX_SAVE_STACK > 0
250 static char *stack_copy
;
251 static ptrdiff_t stack_copy_size
;
254 /* Non-zero means ignore malloc warnings. Set during initialization.
255 Currently not used. */
257 static int ignore_warnings
;
259 static Lisp_Object Qgc_cons_threshold
;
260 Lisp_Object Qchar_table_extra_slots
;
262 /* Hook run after GC has finished. */
264 static Lisp_Object Qpost_gc_hook
;
266 static void mark_buffer (Lisp_Object
);
267 static void mark_terminals (void);
268 static void gc_sweep (void);
269 static void mark_glyph_matrix (struct glyph_matrix
*);
270 static void mark_face_cache (struct face_cache
*);
272 #if !defined REL_ALLOC || defined SYSTEM_MALLOC
273 static void refill_memory_reserve (void);
275 static struct Lisp_String
*allocate_string (void);
276 static void compact_small_strings (void);
277 static void free_large_strings (void);
278 static void sweep_strings (void);
279 static void free_misc (Lisp_Object
);
281 /* When scanning the C stack for live Lisp objects, Emacs keeps track
282 of what memory allocated via lisp_malloc is intended for what
283 purpose. This enumeration specifies the type of memory. */
294 /* We used to keep separate mem_types for subtypes of vectors such as
295 process, hash_table, frame, terminal, and window, but we never made
296 use of the distinction, so it only caused source-code complexity
297 and runtime slowdown. Minor but pointless. */
301 static POINTER_TYPE
*lisp_align_malloc (size_t, enum mem_type
);
302 static POINTER_TYPE
*lisp_malloc (size_t, enum mem_type
);
305 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
307 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
308 #include <stdio.h> /* For fprintf. */
311 /* A unique object in pure space used to make some Lisp objects
312 on free lists recognizable in O(1). */
314 static Lisp_Object Vdead
;
316 #ifdef GC_MALLOC_CHECK
318 enum mem_type allocated_mem_type
;
319 static int dont_register_blocks
;
321 #endif /* GC_MALLOC_CHECK */
323 /* A node in the red-black tree describing allocated memory containing
324 Lisp data. Each such block is recorded with its start and end
325 address when it is allocated, and removed from the tree when it
328 A red-black tree is a balanced binary tree with the following
331 1. Every node is either red or black.
332 2. Every leaf is black.
333 3. If a node is red, then both of its children are black.
334 4. Every simple path from a node to a descendant leaf contains
335 the same number of black nodes.
336 5. The root is always black.
338 When nodes are inserted into the tree, or deleted from the tree,
339 the tree is "fixed" so that these properties are always true.
341 A red-black tree with N internal nodes has height at most 2
342 log(N+1). Searches, insertions and deletions are done in O(log N).
343 Please see a text book about data structures for a detailed
344 description of red-black trees. Any book worth its salt should
349 /* Children of this node. These pointers are never NULL. When there
350 is no child, the value is MEM_NIL, which points to a dummy node. */
351 struct mem_node
*left
, *right
;
353 /* The parent of this node. In the root node, this is NULL. */
354 struct mem_node
*parent
;
356 /* Start and end of allocated region. */
360 enum {MEM_BLACK
, MEM_RED
} color
;
366 /* Base address of stack. Set in main. */
368 Lisp_Object
*stack_base
;
370 /* Root of the tree describing allocated Lisp memory. */
372 static struct mem_node
*mem_root
;
374 /* Lowest and highest known address in the heap. */
376 static void *min_heap_address
, *max_heap_address
;
378 /* Sentinel node of the tree. */
380 static struct mem_node mem_z
;
381 #define MEM_NIL &mem_z
383 static struct Lisp_Vector
*allocate_vectorlike (EMACS_INT
);
384 static void lisp_free (POINTER_TYPE
*);
385 static void mark_stack (void);
386 static int live_vector_p (struct mem_node
*, void *);
387 static int live_buffer_p (struct mem_node
*, void *);
388 static int live_string_p (struct mem_node
*, void *);
389 static int live_cons_p (struct mem_node
*, void *);
390 static int live_symbol_p (struct mem_node
*, void *);
391 static int live_float_p (struct mem_node
*, void *);
392 static int live_misc_p (struct mem_node
*, void *);
393 static void mark_maybe_object (Lisp_Object
);
394 static void mark_memory (void *, void *, int);
395 static void mem_init (void);
396 static struct mem_node
*mem_insert (void *, void *, enum mem_type
);
397 static void mem_insert_fixup (struct mem_node
*);
398 static void mem_rotate_left (struct mem_node
*);
399 static void mem_rotate_right (struct mem_node
*);
400 static void mem_delete (struct mem_node
*);
401 static void mem_delete_fixup (struct mem_node
*);
402 static inline struct mem_node
*mem_find (void *);
405 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
406 static void check_gcpros (void);
409 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
411 /* Recording what needs to be marked for gc. */
413 struct gcpro
*gcprolist
;
415 /* Addresses of staticpro'd variables. Initialize it to a nonzero
416 value; otherwise some compilers put it into BSS. */
418 #define NSTATICS 0x640
419 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
421 /* Index of next unused slot in staticvec. */
423 static int staticidx
= 0;
425 static POINTER_TYPE
*pure_alloc (size_t, int);
428 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
429 ALIGNMENT must be a power of 2. */
431 #define ALIGN(ptr, ALIGNMENT) \
432 ((POINTER_TYPE *) ((((uintptr_t) (ptr)) + (ALIGNMENT) - 1) \
433 & ~((ALIGNMENT) - 1)))
437 /************************************************************************
439 ************************************************************************/
441 /* Function malloc calls this if it finds we are near exhausting storage. */
444 malloc_warning (const char *str
)
446 pending_malloc_warning
= str
;
450 /* Display an already-pending malloc warning. */
453 display_malloc_warning (void)
455 call3 (intern ("display-warning"),
457 build_string (pending_malloc_warning
),
458 intern ("emergency"));
459 pending_malloc_warning
= 0;
462 /* Called if we can't allocate relocatable space for a buffer. */
465 buffer_memory_full (EMACS_INT nbytes
)
467 /* If buffers use the relocating allocator, no need to free
468 spare_memory, because we may have plenty of malloc space left
469 that we could get, and if we don't, the malloc that fails will
470 itself cause spare_memory to be freed. If buffers don't use the
471 relocating allocator, treat this like any other failing
475 memory_full (nbytes
);
478 /* This used to call error, but if we've run out of memory, we could
479 get infinite recursion trying to build the string. */
480 xsignal (Qnil
, Vmemory_signal_data
);
484 #ifndef XMALLOC_OVERRUN_CHECK
485 #define XMALLOC_OVERRUN_CHECK_OVERHEAD 0
488 /* Check for overrun in malloc'ed buffers by wrapping a header and trailer
491 The header consists of 16 fixed bytes followed by sizeof (size_t) bytes
492 containing the original block size in little-endian order,
493 while the trailer consists of 16 fixed bytes.
495 The header is used to detect whether this block has been allocated
496 through these functions -- as it seems that some low-level libc
497 functions may bypass the malloc hooks.
501 #define XMALLOC_OVERRUN_CHECK_SIZE 16
502 #define XMALLOC_OVERRUN_CHECK_OVERHEAD \
503 (2 * XMALLOC_OVERRUN_CHECK_SIZE + sizeof (size_t))
505 static char const xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
] =
506 { '\x9a', '\x9b', '\xae', '\xaf',
507 '\xbf', '\xbe', '\xce', '\xcf',
508 '\xea', '\xeb', '\xec', '\xed',
509 '\xdf', '\xde', '\x9c', '\x9d' };
511 static char const xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
512 { '\xaa', '\xab', '\xac', '\xad',
513 '\xba', '\xbb', '\xbc', '\xbd',
514 '\xca', '\xcb', '\xcc', '\xcd',
515 '\xda', '\xdb', '\xdc', '\xdd' };
517 /* Insert and extract the block size in the header. */
520 xmalloc_put_size (unsigned char *ptr
, size_t size
)
523 for (i
= 0; i
< sizeof (size_t); i
++)
525 *--ptr
= size
& (1 << CHAR_BIT
) - 1;
531 xmalloc_get_size (unsigned char *ptr
)
535 ptr
-= sizeof (size_t);
536 for (i
= 0; i
< sizeof (size_t); i
++)
545 /* The call depth in overrun_check functions. For example, this might happen:
547 overrun_check_malloc()
548 -> malloc -> (via hook)_-> emacs_blocked_malloc
549 -> overrun_check_malloc
550 call malloc (hooks are NULL, so real malloc is called).
551 malloc returns 10000.
552 add overhead, return 10016.
553 <- (back in overrun_check_malloc)
554 add overhead again, return 10032
555 xmalloc returns 10032.
560 overrun_check_free(10032)
562 free(10016) <- crash, because 10000 is the original pointer. */
564 static ptrdiff_t check_depth
;
566 /* Like malloc, but wraps allocated block with header and trailer. */
568 static POINTER_TYPE
*
569 overrun_check_malloc (size_t size
)
571 register unsigned char *val
;
572 int overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_OVERHEAD
: 0;
573 if (SIZE_MAX
- overhead
< size
)
576 val
= (unsigned char *) malloc (size
+ overhead
);
577 if (val
&& check_depth
== 1)
579 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
580 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ sizeof (size_t);
581 xmalloc_put_size (val
, size
);
582 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
583 XMALLOC_OVERRUN_CHECK_SIZE
);
586 return (POINTER_TYPE
*)val
;
590 /* Like realloc, but checks old block for overrun, and wraps new block
591 with header and trailer. */
593 static POINTER_TYPE
*
594 overrun_check_realloc (POINTER_TYPE
*block
, size_t size
)
596 register unsigned char *val
= (unsigned char *) block
;
597 int overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_OVERHEAD
: 0;
598 if (SIZE_MAX
- overhead
< size
)
603 && memcmp (xmalloc_overrun_check_header
,
604 val
- XMALLOC_OVERRUN_CHECK_SIZE
- sizeof (size_t),
605 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
607 size_t osize
= xmalloc_get_size (val
);
608 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
609 XMALLOC_OVERRUN_CHECK_SIZE
))
611 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
612 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ sizeof (size_t);
613 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ sizeof (size_t));
616 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
618 if (val
&& check_depth
== 1)
620 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
621 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ sizeof (size_t);
622 xmalloc_put_size (val
, size
);
623 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
624 XMALLOC_OVERRUN_CHECK_SIZE
);
627 return (POINTER_TYPE
*)val
;
630 /* Like free, but checks block for overrun. */
633 overrun_check_free (POINTER_TYPE
*block
)
635 unsigned char *val
= (unsigned char *) block
;
640 && memcmp (xmalloc_overrun_check_header
,
641 val
- XMALLOC_OVERRUN_CHECK_SIZE
- sizeof (size_t),
642 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
644 size_t osize
= xmalloc_get_size (val
);
645 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
646 XMALLOC_OVERRUN_CHECK_SIZE
))
648 #ifdef XMALLOC_CLEAR_FREE_MEMORY
649 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ sizeof (size_t);
650 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
652 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
653 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ sizeof (size_t);
654 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ sizeof (size_t));
665 #define malloc overrun_check_malloc
666 #define realloc overrun_check_realloc
667 #define free overrun_check_free
671 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
672 there's no need to block input around malloc. */
673 #define MALLOC_BLOCK_INPUT ((void)0)
674 #define MALLOC_UNBLOCK_INPUT ((void)0)
676 #define MALLOC_BLOCK_INPUT BLOCK_INPUT
677 #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT
680 /* Like malloc but check for no memory and block interrupt input.. */
683 xmalloc (size_t size
)
685 register POINTER_TYPE
*val
;
688 val
= (POINTER_TYPE
*) malloc (size
);
689 MALLOC_UNBLOCK_INPUT
;
697 /* Like realloc but check for no memory and block interrupt input.. */
700 xrealloc (POINTER_TYPE
*block
, size_t size
)
702 register POINTER_TYPE
*val
;
705 /* We must call malloc explicitly when BLOCK is 0, since some
706 reallocs don't do this. */
708 val
= (POINTER_TYPE
*) malloc (size
);
710 val
= (POINTER_TYPE
*) realloc (block
, size
);
711 MALLOC_UNBLOCK_INPUT
;
719 /* Like free but block interrupt input. */
722 xfree (POINTER_TYPE
*block
)
728 MALLOC_UNBLOCK_INPUT
;
729 /* We don't call refill_memory_reserve here
730 because that duplicates doing so in emacs_blocked_free
731 and the criterion should go there. */
735 /* Other parts of Emacs pass large int values to allocator functions
736 expecting ptrdiff_t. This is portable in practice, but check it to
738 verify (INT_MAX
<= PTRDIFF_MAX
);
741 /* Allocate an array of NITEMS items, each of size ITEM_SIZE.
742 Signal an error on memory exhaustion, and block interrupt input. */
745 xnmalloc (ptrdiff_t nitems
, ptrdiff_t item_size
)
747 xassert (0 <= nitems
&& 0 < item_size
);
748 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
749 memory_full (SIZE_MAX
);
750 return xmalloc (nitems
* item_size
);
754 /* Reallocate an array PA to make it of NITEMS items, each of size ITEM_SIZE.
755 Signal an error on memory exhaustion, and block interrupt input. */
758 xnrealloc (void *pa
, ptrdiff_t nitems
, ptrdiff_t item_size
)
760 xassert (0 <= nitems
&& 0 < item_size
);
761 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
762 memory_full (SIZE_MAX
);
763 return xrealloc (pa
, nitems
* item_size
);
767 /* Grow PA, which points to an array of *NITEMS items, and return the
768 location of the reallocated array, updating *NITEMS to reflect its
769 new size. The new array will contain at least NITEMS_INCR_MIN more
770 items, but will not contain more than NITEMS_MAX items total.
771 ITEM_SIZE is the size of each item, in bytes.
773 ITEM_SIZE and NITEMS_INCR_MIN must be positive. *NITEMS must be
774 nonnegative. If NITEMS_MAX is -1, it is treated as if it were
777 If PA is null, then allocate a new array instead of reallocating
778 the old one. Thus, to grow an array A without saving its old
779 contents, invoke xfree (A) immediately followed by xgrowalloc (0,
782 Block interrupt input as needed. If memory exhaustion occurs, set
783 *NITEMS to zero if PA is null, and signal an error (i.e., do not
787 xpalloc (void *pa
, ptrdiff_t *nitems
, ptrdiff_t nitems_incr_min
,
788 ptrdiff_t nitems_max
, ptrdiff_t item_size
)
790 /* The approximate size to use for initial small allocation
791 requests. This is the largest "small" request for the GNU C
793 enum { DEFAULT_MXFAST
= 64 * sizeof (size_t) / 4 };
795 /* If the array is tiny, grow it to about (but no greater than)
796 DEFAULT_MXFAST bytes. Otherwise, grow it by about 50%. */
797 ptrdiff_t n
= *nitems
;
798 ptrdiff_t tiny_max
= DEFAULT_MXFAST
/ item_size
- n
;
799 ptrdiff_t half_again
= n
>> 1;
800 ptrdiff_t incr_estimate
= max (tiny_max
, half_again
);
802 /* Adjust the increment according to three constraints: NITEMS_INCR_MIN,
803 NITEMS_MAX, and what the C language can represent safely. */
804 ptrdiff_t C_language_max
= min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
;
805 ptrdiff_t n_max
= (0 <= nitems_max
&& nitems_max
< C_language_max
806 ? nitems_max
: C_language_max
);
807 ptrdiff_t nitems_incr_max
= n_max
- n
;
808 ptrdiff_t incr
= max (nitems_incr_min
, min (incr_estimate
, nitems_incr_max
));
810 xassert (0 < item_size
&& 0 < nitems_incr_min
&& 0 <= n
&& -1 <= nitems_max
);
813 if (nitems_incr_max
< incr
)
814 memory_full (SIZE_MAX
);
816 pa
= xrealloc (pa
, n
* item_size
);
822 /* Like strdup, but uses xmalloc. */
825 xstrdup (const char *s
)
827 size_t len
= strlen (s
) + 1;
828 char *p
= (char *) xmalloc (len
);
834 /* Unwind for SAFE_ALLOCA */
837 safe_alloca_unwind (Lisp_Object arg
)
839 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
849 /* Like malloc but used for allocating Lisp data. NBYTES is the
850 number of bytes to allocate, TYPE describes the intended use of the
851 allcated memory block (for strings, for conses, ...). */
854 static void *lisp_malloc_loser
;
857 static POINTER_TYPE
*
858 lisp_malloc (size_t nbytes
, enum mem_type type
)
864 #ifdef GC_MALLOC_CHECK
865 allocated_mem_type
= type
;
868 val
= (void *) malloc (nbytes
);
871 /* If the memory just allocated cannot be addressed thru a Lisp
872 object's pointer, and it needs to be,
873 that's equivalent to running out of memory. */
874 if (val
&& type
!= MEM_TYPE_NON_LISP
)
877 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
878 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
880 lisp_malloc_loser
= val
;
887 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
888 if (val
&& type
!= MEM_TYPE_NON_LISP
)
889 mem_insert (val
, (char *) val
+ nbytes
, type
);
892 MALLOC_UNBLOCK_INPUT
;
894 memory_full (nbytes
);
898 /* Free BLOCK. This must be called to free memory allocated with a
899 call to lisp_malloc. */
902 lisp_free (POINTER_TYPE
*block
)
906 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
907 mem_delete (mem_find (block
));
909 MALLOC_UNBLOCK_INPUT
;
912 /* Allocation of aligned blocks of memory to store Lisp data. */
913 /* The entry point is lisp_align_malloc which returns blocks of at most */
914 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
916 /* Use posix_memalloc if the system has it and we're using the system's
917 malloc (because our gmalloc.c routines don't have posix_memalign although
918 its memalloc could be used). */
919 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
920 #define USE_POSIX_MEMALIGN 1
923 /* BLOCK_ALIGN has to be a power of 2. */
924 #define BLOCK_ALIGN (1 << 10)
926 /* Padding to leave at the end of a malloc'd block. This is to give
927 malloc a chance to minimize the amount of memory wasted to alignment.
928 It should be tuned to the particular malloc library used.
929 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
930 posix_memalign on the other hand would ideally prefer a value of 4
931 because otherwise, there's 1020 bytes wasted between each ablocks.
932 In Emacs, testing shows that those 1020 can most of the time be
933 efficiently used by malloc to place other objects, so a value of 0 can
934 still preferable unless you have a lot of aligned blocks and virtually
936 #define BLOCK_PADDING 0
937 #define BLOCK_BYTES \
938 (BLOCK_ALIGN - sizeof (struct ablocks *) - BLOCK_PADDING)
940 /* Internal data structures and constants. */
942 #define ABLOCKS_SIZE 16
944 /* An aligned block of memory. */
949 char payload
[BLOCK_BYTES
];
950 struct ablock
*next_free
;
952 /* `abase' is the aligned base of the ablocks. */
953 /* It is overloaded to hold the virtual `busy' field that counts
954 the number of used ablock in the parent ablocks.
955 The first ablock has the `busy' field, the others have the `abase'
956 field. To tell the difference, we assume that pointers will have
957 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
958 is used to tell whether the real base of the parent ablocks is `abase'
959 (if not, the word before the first ablock holds a pointer to the
961 struct ablocks
*abase
;
962 /* The padding of all but the last ablock is unused. The padding of
963 the last ablock in an ablocks is not allocated. */
965 char padding
[BLOCK_PADDING
];
969 /* A bunch of consecutive aligned blocks. */
972 struct ablock blocks
[ABLOCKS_SIZE
];
975 /* Size of the block requested from malloc or memalign. */
976 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
978 #define ABLOCK_ABASE(block) \
979 (((uintptr_t) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
980 ? (struct ablocks *)(block) \
983 /* Virtual `busy' field. */
984 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
986 /* Pointer to the (not necessarily aligned) malloc block. */
987 #ifdef USE_POSIX_MEMALIGN
988 #define ABLOCKS_BASE(abase) (abase)
990 #define ABLOCKS_BASE(abase) \
991 (1 & (intptr_t) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
994 /* The list of free ablock. */
995 static struct ablock
*free_ablock
;
997 /* Allocate an aligned block of nbytes.
998 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
999 smaller or equal to BLOCK_BYTES. */
1000 static POINTER_TYPE
*
1001 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
1004 struct ablocks
*abase
;
1006 eassert (nbytes
<= BLOCK_BYTES
);
1010 #ifdef GC_MALLOC_CHECK
1011 allocated_mem_type
= type
;
1017 intptr_t aligned
; /* int gets warning casting to 64-bit pointer. */
1019 #ifdef DOUG_LEA_MALLOC
1020 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1021 because mapped region contents are not preserved in
1023 mallopt (M_MMAP_MAX
, 0);
1026 #ifdef USE_POSIX_MEMALIGN
1028 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1034 base
= malloc (ABLOCKS_BYTES
);
1035 abase
= ALIGN (base
, BLOCK_ALIGN
);
1040 MALLOC_UNBLOCK_INPUT
;
1041 memory_full (ABLOCKS_BYTES
);
1044 aligned
= (base
== abase
);
1046 ((void**)abase
)[-1] = base
;
1048 #ifdef DOUG_LEA_MALLOC
1049 /* Back to a reasonable maximum of mmap'ed areas. */
1050 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1054 /* If the memory just allocated cannot be addressed thru a Lisp
1055 object's pointer, and it needs to be, that's equivalent to
1056 running out of memory. */
1057 if (type
!= MEM_TYPE_NON_LISP
)
1060 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1061 XSETCONS (tem
, end
);
1062 if ((char *) XCONS (tem
) != end
)
1064 lisp_malloc_loser
= base
;
1066 MALLOC_UNBLOCK_INPUT
;
1067 memory_full (SIZE_MAX
);
1072 /* Initialize the blocks and put them on the free list.
1073 Is `base' was not properly aligned, we can't use the last block. */
1074 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1076 abase
->blocks
[i
].abase
= abase
;
1077 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1078 free_ablock
= &abase
->blocks
[i
];
1080 ABLOCKS_BUSY (abase
) = (struct ablocks
*) aligned
;
1082 eassert (0 == ((uintptr_t) abase
) % BLOCK_ALIGN
);
1083 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1084 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1085 eassert (ABLOCKS_BASE (abase
) == base
);
1086 eassert (aligned
== (intptr_t) ABLOCKS_BUSY (abase
));
1089 abase
= ABLOCK_ABASE (free_ablock
);
1090 ABLOCKS_BUSY (abase
) =
1091 (struct ablocks
*) (2 + (intptr_t) ABLOCKS_BUSY (abase
));
1093 free_ablock
= free_ablock
->x
.next_free
;
1095 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1096 if (type
!= MEM_TYPE_NON_LISP
)
1097 mem_insert (val
, (char *) val
+ nbytes
, type
);
1100 MALLOC_UNBLOCK_INPUT
;
1102 eassert (0 == ((uintptr_t) val
) % BLOCK_ALIGN
);
1107 lisp_align_free (POINTER_TYPE
*block
)
1109 struct ablock
*ablock
= block
;
1110 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1113 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1114 mem_delete (mem_find (block
));
1116 /* Put on free list. */
1117 ablock
->x
.next_free
= free_ablock
;
1118 free_ablock
= ablock
;
1119 /* Update busy count. */
1120 ABLOCKS_BUSY (abase
) =
1121 (struct ablocks
*) (-2 + (intptr_t) ABLOCKS_BUSY (abase
));
1123 if (2 > (intptr_t) ABLOCKS_BUSY (abase
))
1124 { /* All the blocks are free. */
1125 int i
= 0, aligned
= (intptr_t) ABLOCKS_BUSY (abase
);
1126 struct ablock
**tem
= &free_ablock
;
1127 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1131 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1134 *tem
= (*tem
)->x
.next_free
;
1137 tem
= &(*tem
)->x
.next_free
;
1139 eassert ((aligned
& 1) == aligned
);
1140 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1141 #ifdef USE_POSIX_MEMALIGN
1142 eassert ((uintptr_t) ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1144 free (ABLOCKS_BASE (abase
));
1146 MALLOC_UNBLOCK_INPUT
;
1149 /* Return a new buffer structure allocated from the heap with
1150 a call to lisp_malloc. */
1153 allocate_buffer (void)
1156 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1158 XSETPVECTYPESIZE (b
, PVEC_BUFFER
,
1159 ((sizeof (struct buffer
) + sizeof (EMACS_INT
) - 1)
1160 / sizeof (EMACS_INT
)));
1165 #ifndef SYSTEM_MALLOC
1167 /* Arranging to disable input signals while we're in malloc.
1169 This only works with GNU malloc. To help out systems which can't
1170 use GNU malloc, all the calls to malloc, realloc, and free
1171 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1172 pair; unfortunately, we have no idea what C library functions
1173 might call malloc, so we can't really protect them unless you're
1174 using GNU malloc. Fortunately, most of the major operating systems
1175 can use GNU malloc. */
1178 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
1179 there's no need to block input around malloc. */
1181 #ifndef DOUG_LEA_MALLOC
1182 extern void * (*__malloc_hook
) (size_t, const void *);
1183 extern void * (*__realloc_hook
) (void *, size_t, const void *);
1184 extern void (*__free_hook
) (void *, const void *);
1185 /* Else declared in malloc.h, perhaps with an extra arg. */
1186 #endif /* DOUG_LEA_MALLOC */
1187 static void * (*old_malloc_hook
) (size_t, const void *);
1188 static void * (*old_realloc_hook
) (void *, size_t, const void*);
1189 static void (*old_free_hook
) (void*, const void*);
1191 #ifdef DOUG_LEA_MALLOC
1192 # define BYTES_USED (mallinfo ().uordblks)
1194 # define BYTES_USED _bytes_used
1197 static size_t bytes_used_when_reconsidered
;
1199 /* Value of _bytes_used, when spare_memory was freed. */
1201 static size_t bytes_used_when_full
;
1203 /* This function is used as the hook for free to call. */
1206 emacs_blocked_free (void *ptr
, const void *ptr2
)
1210 #ifdef GC_MALLOC_CHECK
1216 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1219 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1224 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1228 #endif /* GC_MALLOC_CHECK */
1230 __free_hook
= old_free_hook
;
1233 /* If we released our reserve (due to running out of memory),
1234 and we have a fair amount free once again,
1235 try to set aside another reserve in case we run out once more. */
1236 if (! NILP (Vmemory_full
)
1237 /* Verify there is enough space that even with the malloc
1238 hysteresis this call won't run out again.
1239 The code here is correct as long as SPARE_MEMORY
1240 is substantially larger than the block size malloc uses. */
1241 && (bytes_used_when_full
1242 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1243 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1244 refill_memory_reserve ();
1246 __free_hook
= emacs_blocked_free
;
1247 UNBLOCK_INPUT_ALLOC
;
1251 /* This function is the malloc hook that Emacs uses. */
1254 emacs_blocked_malloc (size_t size
, const void *ptr
)
1259 __malloc_hook
= old_malloc_hook
;
1260 #ifdef DOUG_LEA_MALLOC
1261 /* Segfaults on my system. --lorentey */
1262 /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */
1264 __malloc_extra_blocks
= malloc_hysteresis
;
1267 value
= (void *) malloc (size
);
1269 #ifdef GC_MALLOC_CHECK
1271 struct mem_node
*m
= mem_find (value
);
1274 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1276 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1277 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1282 if (!dont_register_blocks
)
1284 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1285 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1288 #endif /* GC_MALLOC_CHECK */
1290 __malloc_hook
= emacs_blocked_malloc
;
1291 UNBLOCK_INPUT_ALLOC
;
1293 /* fprintf (stderr, "%p malloc\n", value); */
1298 /* This function is the realloc hook that Emacs uses. */
1301 emacs_blocked_realloc (void *ptr
, size_t size
, const void *ptr2
)
1306 __realloc_hook
= old_realloc_hook
;
1308 #ifdef GC_MALLOC_CHECK
1311 struct mem_node
*m
= mem_find (ptr
);
1312 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1315 "Realloc of %p which wasn't allocated with malloc\n",
1323 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1325 /* Prevent malloc from registering blocks. */
1326 dont_register_blocks
= 1;
1327 #endif /* GC_MALLOC_CHECK */
1329 value
= (void *) realloc (ptr
, size
);
1331 #ifdef GC_MALLOC_CHECK
1332 dont_register_blocks
= 0;
1335 struct mem_node
*m
= mem_find (value
);
1338 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1342 /* Can't handle zero size regions in the red-black tree. */
1343 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1346 /* fprintf (stderr, "%p <- realloc\n", value); */
1347 #endif /* GC_MALLOC_CHECK */
1349 __realloc_hook
= emacs_blocked_realloc
;
1350 UNBLOCK_INPUT_ALLOC
;
1356 #ifdef HAVE_GTK_AND_PTHREAD
1357 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1358 normal malloc. Some thread implementations need this as they call
1359 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1360 calls malloc because it is the first call, and we have an endless loop. */
1363 reset_malloc_hooks (void)
1365 __free_hook
= old_free_hook
;
1366 __malloc_hook
= old_malloc_hook
;
1367 __realloc_hook
= old_realloc_hook
;
1369 #endif /* HAVE_GTK_AND_PTHREAD */
1372 /* Called from main to set up malloc to use our hooks. */
1375 uninterrupt_malloc (void)
1377 #ifdef HAVE_GTK_AND_PTHREAD
1378 #ifdef DOUG_LEA_MALLOC
1379 pthread_mutexattr_t attr
;
1381 /* GLIBC has a faster way to do this, but lets keep it portable.
1382 This is according to the Single UNIX Specification. */
1383 pthread_mutexattr_init (&attr
);
1384 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1385 pthread_mutex_init (&alloc_mutex
, &attr
);
1386 #else /* !DOUG_LEA_MALLOC */
1387 /* Some systems such as Solaris 2.6 don't have a recursive mutex,
1388 and the bundled gmalloc.c doesn't require it. */
1389 pthread_mutex_init (&alloc_mutex
, NULL
);
1390 #endif /* !DOUG_LEA_MALLOC */
1391 #endif /* HAVE_GTK_AND_PTHREAD */
1393 if (__free_hook
!= emacs_blocked_free
)
1394 old_free_hook
= __free_hook
;
1395 __free_hook
= emacs_blocked_free
;
1397 if (__malloc_hook
!= emacs_blocked_malloc
)
1398 old_malloc_hook
= __malloc_hook
;
1399 __malloc_hook
= emacs_blocked_malloc
;
1401 if (__realloc_hook
!= emacs_blocked_realloc
)
1402 old_realloc_hook
= __realloc_hook
;
1403 __realloc_hook
= emacs_blocked_realloc
;
1406 #endif /* not SYNC_INPUT */
1407 #endif /* not SYSTEM_MALLOC */
1411 /***********************************************************************
1413 ***********************************************************************/
1415 /* Number of intervals allocated in an interval_block structure.
1416 The 1020 is 1024 minus malloc overhead. */
1418 #define INTERVAL_BLOCK_SIZE \
1419 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1421 /* Intervals are allocated in chunks in form of an interval_block
1424 struct interval_block
1426 /* Place `intervals' first, to preserve alignment. */
1427 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1428 struct interval_block
*next
;
1431 /* Current interval block. Its `next' pointer points to older
1434 static struct interval_block
*interval_block
;
1436 /* Index in interval_block above of the next unused interval
1439 static int interval_block_index
;
1441 /* Number of free and live intervals. */
1443 static EMACS_INT total_free_intervals
, total_intervals
;
1445 /* List of free intervals. */
1447 static INTERVAL interval_free_list
;
1450 /* Initialize interval allocation. */
1453 init_intervals (void)
1455 interval_block
= NULL
;
1456 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1457 interval_free_list
= 0;
1461 /* Return a new interval. */
1464 make_interval (void)
1468 /* eassert (!handling_signal); */
1472 if (interval_free_list
)
1474 val
= interval_free_list
;
1475 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1479 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1481 register struct interval_block
*newi
;
1483 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1486 newi
->next
= interval_block
;
1487 interval_block
= newi
;
1488 interval_block_index
= 0;
1490 val
= &interval_block
->intervals
[interval_block_index
++];
1493 MALLOC_UNBLOCK_INPUT
;
1495 consing_since_gc
+= sizeof (struct interval
);
1497 RESET_INTERVAL (val
);
1503 /* Mark Lisp objects in interval I. */
1506 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1508 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1510 mark_object (i
->plist
);
1514 /* Mark the interval tree rooted in TREE. Don't call this directly;
1515 use the macro MARK_INTERVAL_TREE instead. */
1518 mark_interval_tree (register INTERVAL tree
)
1520 /* No need to test if this tree has been marked already; this
1521 function is always called through the MARK_INTERVAL_TREE macro,
1522 which takes care of that. */
1524 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1528 /* Mark the interval tree rooted in I. */
1530 #define MARK_INTERVAL_TREE(i) \
1532 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1533 mark_interval_tree (i); \
1537 #define UNMARK_BALANCE_INTERVALS(i) \
1539 if (! NULL_INTERVAL_P (i)) \
1540 (i) = balance_intervals (i); \
1544 /* Number support. If USE_LISP_UNION_TYPE is in effect, we
1545 can't create number objects in macros. */
1548 make_number (EMACS_INT n
)
1552 obj
.s
.type
= Lisp_Int
;
1557 /***********************************************************************
1559 ***********************************************************************/
1561 /* Lisp_Strings are allocated in string_block structures. When a new
1562 string_block is allocated, all the Lisp_Strings it contains are
1563 added to a free-list string_free_list. When a new Lisp_String is
1564 needed, it is taken from that list. During the sweep phase of GC,
1565 string_blocks that are entirely free are freed, except two which
1568 String data is allocated from sblock structures. Strings larger
1569 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1570 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1572 Sblocks consist internally of sdata structures, one for each
1573 Lisp_String. The sdata structure points to the Lisp_String it
1574 belongs to. The Lisp_String points back to the `u.data' member of
1575 its sdata structure.
1577 When a Lisp_String is freed during GC, it is put back on
1578 string_free_list, and its `data' member and its sdata's `string'
1579 pointer is set to null. The size of the string is recorded in the
1580 `u.nbytes' member of the sdata. So, sdata structures that are no
1581 longer used, can be easily recognized, and it's easy to compact the
1582 sblocks of small strings which we do in compact_small_strings. */
1584 /* Size in bytes of an sblock structure used for small strings. This
1585 is 8192 minus malloc overhead. */
1587 #define SBLOCK_SIZE 8188
1589 /* Strings larger than this are considered large strings. String data
1590 for large strings is allocated from individual sblocks. */
1592 #define LARGE_STRING_BYTES 1024
1594 /* Structure describing string memory sub-allocated from an sblock.
1595 This is where the contents of Lisp strings are stored. */
1599 /* Back-pointer to the string this sdata belongs to. If null, this
1600 structure is free, and the NBYTES member of the union below
1601 contains the string's byte size (the same value that STRING_BYTES
1602 would return if STRING were non-null). If non-null, STRING_BYTES
1603 (STRING) is the size of the data, and DATA contains the string's
1605 struct Lisp_String
*string
;
1607 #ifdef GC_CHECK_STRING_BYTES
1610 unsigned char data
[1];
1612 #define SDATA_NBYTES(S) (S)->nbytes
1613 #define SDATA_DATA(S) (S)->data
1614 #define SDATA_SELECTOR(member) member
1616 #else /* not GC_CHECK_STRING_BYTES */
1620 /* When STRING is non-null. */
1621 unsigned char data
[1];
1623 /* When STRING is null. */
1627 #define SDATA_NBYTES(S) (S)->u.nbytes
1628 #define SDATA_DATA(S) (S)->u.data
1629 #define SDATA_SELECTOR(member) u.member
1631 #endif /* not GC_CHECK_STRING_BYTES */
1633 #define SDATA_DATA_OFFSET offsetof (struct sdata, SDATA_SELECTOR (data))
1637 /* Structure describing a block of memory which is sub-allocated to
1638 obtain string data memory for strings. Blocks for small strings
1639 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1640 as large as needed. */
1645 struct sblock
*next
;
1647 /* Pointer to the next free sdata block. This points past the end
1648 of the sblock if there isn't any space left in this block. */
1649 struct sdata
*next_free
;
1651 /* Start of data. */
1652 struct sdata first_data
;
1655 /* Number of Lisp strings in a string_block structure. The 1020 is
1656 1024 minus malloc overhead. */
1658 #define STRING_BLOCK_SIZE \
1659 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1661 /* Structure describing a block from which Lisp_String structures
1666 /* Place `strings' first, to preserve alignment. */
1667 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1668 struct string_block
*next
;
1671 /* Head and tail of the list of sblock structures holding Lisp string
1672 data. We always allocate from current_sblock. The NEXT pointers
1673 in the sblock structures go from oldest_sblock to current_sblock. */
1675 static struct sblock
*oldest_sblock
, *current_sblock
;
1677 /* List of sblocks for large strings. */
1679 static struct sblock
*large_sblocks
;
1681 /* List of string_block structures. */
1683 static struct string_block
*string_blocks
;
1685 /* Free-list of Lisp_Strings. */
1687 static struct Lisp_String
*string_free_list
;
1689 /* Number of live and free Lisp_Strings. */
1691 static EMACS_INT total_strings
, total_free_strings
;
1693 /* Number of bytes used by live strings. */
1695 static EMACS_INT total_string_size
;
1697 /* Given a pointer to a Lisp_String S which is on the free-list
1698 string_free_list, return a pointer to its successor in the
1701 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1703 /* Return a pointer to the sdata structure belonging to Lisp string S.
1704 S must be live, i.e. S->data must not be null. S->data is actually
1705 a pointer to the `u.data' member of its sdata structure; the
1706 structure starts at a constant offset in front of that. */
1708 #define SDATA_OF_STRING(S) ((struct sdata *) ((S)->data - SDATA_DATA_OFFSET))
1711 #ifdef GC_CHECK_STRING_OVERRUN
1713 /* We check for overrun in string data blocks by appending a small
1714 "cookie" after each allocated string data block, and check for the
1715 presence of this cookie during GC. */
1717 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1718 static char const string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1719 { '\xde', '\xad', '\xbe', '\xef' };
1722 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1725 /* Value is the size of an sdata structure large enough to hold NBYTES
1726 bytes of string data. The value returned includes a terminating
1727 NUL byte, the size of the sdata structure, and padding. */
1729 #ifdef GC_CHECK_STRING_BYTES
1731 #define SDATA_SIZE(NBYTES) \
1732 ((SDATA_DATA_OFFSET \
1734 + sizeof (EMACS_INT) - 1) \
1735 & ~(sizeof (EMACS_INT) - 1))
1737 #else /* not GC_CHECK_STRING_BYTES */
1739 /* The 'max' reserves space for the nbytes union member even when NBYTES + 1 is
1740 less than the size of that member. The 'max' is not needed when
1741 SDATA_DATA_OFFSET is a multiple of sizeof (EMACS_INT), because then the
1742 alignment code reserves enough space. */
1744 #define SDATA_SIZE(NBYTES) \
1745 ((SDATA_DATA_OFFSET \
1746 + (SDATA_DATA_OFFSET % sizeof (EMACS_INT) == 0 \
1748 : max (NBYTES, sizeof (EMACS_INT) - 1)) \
1750 + sizeof (EMACS_INT) - 1) \
1751 & ~(sizeof (EMACS_INT) - 1))
1753 #endif /* not GC_CHECK_STRING_BYTES */
1755 /* Extra bytes to allocate for each string. */
1757 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1759 /* Exact bound on the number of bytes in a string, not counting the
1760 terminating null. A string cannot contain more bytes than
1761 STRING_BYTES_BOUND, nor can it be so long that the size_t
1762 arithmetic in allocate_string_data would overflow while it is
1763 calculating a value to be passed to malloc. */
1764 #define STRING_BYTES_MAX \
1765 min (STRING_BYTES_BOUND, \
1766 ((SIZE_MAX - XMALLOC_OVERRUN_CHECK_OVERHEAD \
1768 - offsetof (struct sblock, first_data) \
1769 - SDATA_DATA_OFFSET) \
1770 & ~(sizeof (EMACS_INT) - 1)))
1772 /* Initialize string allocation. Called from init_alloc_once. */
1777 total_strings
= total_free_strings
= total_string_size
= 0;
1778 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1779 string_blocks
= NULL
;
1780 string_free_list
= NULL
;
1781 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1782 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1786 #ifdef GC_CHECK_STRING_BYTES
1788 static int check_string_bytes_count
;
1790 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1793 /* Like GC_STRING_BYTES, but with debugging check. */
1796 string_bytes (struct Lisp_String
*s
)
1799 (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1801 if (!PURE_POINTER_P (s
)
1803 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1808 /* Check validity of Lisp strings' string_bytes member in B. */
1811 check_sblock (struct sblock
*b
)
1813 struct sdata
*from
, *end
, *from_end
;
1817 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1819 /* Compute the next FROM here because copying below may
1820 overwrite data we need to compute it. */
1823 /* Check that the string size recorded in the string is the
1824 same as the one recorded in the sdata structure. */
1826 CHECK_STRING_BYTES (from
->string
);
1829 nbytes
= GC_STRING_BYTES (from
->string
);
1831 nbytes
= SDATA_NBYTES (from
);
1833 nbytes
= SDATA_SIZE (nbytes
);
1834 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1839 /* Check validity of Lisp strings' string_bytes member. ALL_P
1840 non-zero means check all strings, otherwise check only most
1841 recently allocated strings. Used for hunting a bug. */
1844 check_string_bytes (int all_p
)
1850 for (b
= large_sblocks
; b
; b
= b
->next
)
1852 struct Lisp_String
*s
= b
->first_data
.string
;
1854 CHECK_STRING_BYTES (s
);
1857 for (b
= oldest_sblock
; b
; b
= b
->next
)
1861 check_sblock (current_sblock
);
1864 #endif /* GC_CHECK_STRING_BYTES */
1866 #ifdef GC_CHECK_STRING_FREE_LIST
1868 /* Walk through the string free list looking for bogus next pointers.
1869 This may catch buffer overrun from a previous string. */
1872 check_string_free_list (void)
1874 struct Lisp_String
*s
;
1876 /* Pop a Lisp_String off the free-list. */
1877 s
= string_free_list
;
1880 if ((uintptr_t) s
< 1024)
1882 s
= NEXT_FREE_LISP_STRING (s
);
1886 #define check_string_free_list()
1889 /* Return a new Lisp_String. */
1891 static struct Lisp_String
*
1892 allocate_string (void)
1894 struct Lisp_String
*s
;
1896 /* eassert (!handling_signal); */
1900 /* If the free-list is empty, allocate a new string_block, and
1901 add all the Lisp_Strings in it to the free-list. */
1902 if (string_free_list
== NULL
)
1904 struct string_block
*b
;
1907 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1908 memset (b
, 0, sizeof *b
);
1909 b
->next
= string_blocks
;
1912 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1915 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1916 string_free_list
= s
;
1919 total_free_strings
+= STRING_BLOCK_SIZE
;
1922 check_string_free_list ();
1924 /* Pop a Lisp_String off the free-list. */
1925 s
= string_free_list
;
1926 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1928 MALLOC_UNBLOCK_INPUT
;
1930 /* Probably not strictly necessary, but play it safe. */
1931 memset (s
, 0, sizeof *s
);
1933 --total_free_strings
;
1936 consing_since_gc
+= sizeof *s
;
1938 #ifdef GC_CHECK_STRING_BYTES
1939 if (!noninteractive
)
1941 if (++check_string_bytes_count
== 200)
1943 check_string_bytes_count
= 0;
1944 check_string_bytes (1);
1947 check_string_bytes (0);
1949 #endif /* GC_CHECK_STRING_BYTES */
1955 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1956 plus a NUL byte at the end. Allocate an sdata structure for S, and
1957 set S->data to its `u.data' member. Store a NUL byte at the end of
1958 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1959 S->data if it was initially non-null. */
1962 allocate_string_data (struct Lisp_String
*s
,
1963 EMACS_INT nchars
, EMACS_INT nbytes
)
1965 struct sdata
*data
, *old_data
;
1967 EMACS_INT needed
, old_nbytes
;
1969 if (STRING_BYTES_MAX
< nbytes
)
1972 /* Determine the number of bytes needed to store NBYTES bytes
1974 needed
= SDATA_SIZE (nbytes
);
1975 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1976 old_nbytes
= GC_STRING_BYTES (s
);
1980 if (nbytes
> LARGE_STRING_BYTES
)
1982 size_t size
= offsetof (struct sblock
, first_data
) + needed
;
1984 #ifdef DOUG_LEA_MALLOC
1985 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1986 because mapped region contents are not preserved in
1989 In case you think of allowing it in a dumped Emacs at the
1990 cost of not being able to re-dump, there's another reason:
1991 mmap'ed data typically have an address towards the top of the
1992 address space, which won't fit into an EMACS_INT (at least on
1993 32-bit systems with the current tagging scheme). --fx */
1994 mallopt (M_MMAP_MAX
, 0);
1997 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1999 #ifdef DOUG_LEA_MALLOC
2000 /* Back to a reasonable maximum of mmap'ed areas. */
2001 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2004 b
->next_free
= &b
->first_data
;
2005 b
->first_data
.string
= NULL
;
2006 b
->next
= large_sblocks
;
2009 else if (current_sblock
== NULL
2010 || (((char *) current_sblock
+ SBLOCK_SIZE
2011 - (char *) current_sblock
->next_free
)
2012 < (needed
+ GC_STRING_EXTRA
)))
2014 /* Not enough room in the current sblock. */
2015 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
2016 b
->next_free
= &b
->first_data
;
2017 b
->first_data
.string
= NULL
;
2021 current_sblock
->next
= b
;
2029 data
= b
->next_free
;
2030 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
2032 MALLOC_UNBLOCK_INPUT
;
2035 s
->data
= SDATA_DATA (data
);
2036 #ifdef GC_CHECK_STRING_BYTES
2037 SDATA_NBYTES (data
) = nbytes
;
2040 s
->size_byte
= nbytes
;
2041 s
->data
[nbytes
] = '\0';
2042 #ifdef GC_CHECK_STRING_OVERRUN
2043 memcpy ((char *) data
+ needed
, string_overrun_cookie
,
2044 GC_STRING_OVERRUN_COOKIE_SIZE
);
2047 /* If S had already data assigned, mark that as free by setting its
2048 string back-pointer to null, and recording the size of the data
2052 SDATA_NBYTES (old_data
) = old_nbytes
;
2053 old_data
->string
= NULL
;
2056 consing_since_gc
+= needed
;
2060 /* Sweep and compact strings. */
2063 sweep_strings (void)
2065 struct string_block
*b
, *next
;
2066 struct string_block
*live_blocks
= NULL
;
2068 string_free_list
= NULL
;
2069 total_strings
= total_free_strings
= 0;
2070 total_string_size
= 0;
2072 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2073 for (b
= string_blocks
; b
; b
= next
)
2076 struct Lisp_String
*free_list_before
= string_free_list
;
2080 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2082 struct Lisp_String
*s
= b
->strings
+ i
;
2086 /* String was not on free-list before. */
2087 if (STRING_MARKED_P (s
))
2089 /* String is live; unmark it and its intervals. */
2092 if (!NULL_INTERVAL_P (s
->intervals
))
2093 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2096 total_string_size
+= STRING_BYTES (s
);
2100 /* String is dead. Put it on the free-list. */
2101 struct sdata
*data
= SDATA_OF_STRING (s
);
2103 /* Save the size of S in its sdata so that we know
2104 how large that is. Reset the sdata's string
2105 back-pointer so that we know it's free. */
2106 #ifdef GC_CHECK_STRING_BYTES
2107 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2110 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2112 data
->string
= NULL
;
2114 /* Reset the strings's `data' member so that we
2118 /* Put the string on the free-list. */
2119 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2120 string_free_list
= s
;
2126 /* S was on the free-list before. Put it there again. */
2127 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2128 string_free_list
= s
;
2133 /* Free blocks that contain free Lisp_Strings only, except
2134 the first two of them. */
2135 if (nfree
== STRING_BLOCK_SIZE
2136 && total_free_strings
> STRING_BLOCK_SIZE
)
2139 string_free_list
= free_list_before
;
2143 total_free_strings
+= nfree
;
2144 b
->next
= live_blocks
;
2149 check_string_free_list ();
2151 string_blocks
= live_blocks
;
2152 free_large_strings ();
2153 compact_small_strings ();
2155 check_string_free_list ();
2159 /* Free dead large strings. */
2162 free_large_strings (void)
2164 struct sblock
*b
, *next
;
2165 struct sblock
*live_blocks
= NULL
;
2167 for (b
= large_sblocks
; b
; b
= next
)
2171 if (b
->first_data
.string
== NULL
)
2175 b
->next
= live_blocks
;
2180 large_sblocks
= live_blocks
;
2184 /* Compact data of small strings. Free sblocks that don't contain
2185 data of live strings after compaction. */
2188 compact_small_strings (void)
2190 struct sblock
*b
, *tb
, *next
;
2191 struct sdata
*from
, *to
, *end
, *tb_end
;
2192 struct sdata
*to_end
, *from_end
;
2194 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2195 to, and TB_END is the end of TB. */
2197 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2198 to
= &tb
->first_data
;
2200 /* Step through the blocks from the oldest to the youngest. We
2201 expect that old blocks will stabilize over time, so that less
2202 copying will happen this way. */
2203 for (b
= oldest_sblock
; b
; b
= b
->next
)
2206 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2208 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2210 /* Compute the next FROM here because copying below may
2211 overwrite data we need to compute it. */
2214 #ifdef GC_CHECK_STRING_BYTES
2215 /* Check that the string size recorded in the string is the
2216 same as the one recorded in the sdata structure. */
2218 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2220 #endif /* GC_CHECK_STRING_BYTES */
2223 nbytes
= GC_STRING_BYTES (from
->string
);
2225 nbytes
= SDATA_NBYTES (from
);
2227 if (nbytes
> LARGE_STRING_BYTES
)
2230 nbytes
= SDATA_SIZE (nbytes
);
2231 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2233 #ifdef GC_CHECK_STRING_OVERRUN
2234 if (memcmp (string_overrun_cookie
,
2235 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
2236 GC_STRING_OVERRUN_COOKIE_SIZE
))
2240 /* FROM->string non-null means it's alive. Copy its data. */
2243 /* If TB is full, proceed with the next sblock. */
2244 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2245 if (to_end
> tb_end
)
2249 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2250 to
= &tb
->first_data
;
2251 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2254 /* Copy, and update the string's `data' pointer. */
2257 xassert (tb
!= b
|| to
< from
);
2258 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
2259 to
->string
->data
= SDATA_DATA (to
);
2262 /* Advance past the sdata we copied to. */
2268 /* The rest of the sblocks following TB don't contain live data, so
2269 we can free them. */
2270 for (b
= tb
->next
; b
; b
= next
)
2278 current_sblock
= tb
;
2282 string_overflow (void)
2284 error ("Maximum string size exceeded");
2287 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2288 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2289 LENGTH must be an integer.
2290 INIT must be an integer that represents a character. */)
2291 (Lisp_Object length
, Lisp_Object init
)
2293 register Lisp_Object val
;
2294 register unsigned char *p
, *end
;
2298 CHECK_NATNUM (length
);
2299 CHECK_CHARACTER (init
);
2301 c
= XFASTINT (init
);
2302 if (ASCII_CHAR_P (c
))
2304 nbytes
= XINT (length
);
2305 val
= make_uninit_string (nbytes
);
2307 end
= p
+ SCHARS (val
);
2313 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2314 int len
= CHAR_STRING (c
, str
);
2315 EMACS_INT string_len
= XINT (length
);
2317 if (string_len
> STRING_BYTES_MAX
/ len
)
2319 nbytes
= len
* string_len
;
2320 val
= make_uninit_multibyte_string (string_len
, nbytes
);
2325 memcpy (p
, str
, len
);
2335 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2336 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2337 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2338 (Lisp_Object length
, Lisp_Object init
)
2340 register Lisp_Object val
;
2341 struct Lisp_Bool_Vector
*p
;
2342 EMACS_INT length_in_chars
, length_in_elts
;
2345 CHECK_NATNUM (length
);
2347 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2349 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2350 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2351 / BOOL_VECTOR_BITS_PER_CHAR
);
2353 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2354 slot `size' of the struct Lisp_Bool_Vector. */
2355 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2357 /* No Lisp_Object to trace in there. */
2358 XSETPVECTYPESIZE (XVECTOR (val
), PVEC_BOOL_VECTOR
, 0);
2360 p
= XBOOL_VECTOR (val
);
2361 p
->size
= XFASTINT (length
);
2363 if (length_in_chars
)
2365 memset (p
->data
, ! NILP (init
) ? -1 : 0, length_in_chars
);
2367 /* Clear any extraneous bits in the last byte. */
2368 p
->data
[length_in_chars
- 1]
2369 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2376 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2377 of characters from the contents. This string may be unibyte or
2378 multibyte, depending on the contents. */
2381 make_string (const char *contents
, EMACS_INT nbytes
)
2383 register Lisp_Object val
;
2384 EMACS_INT nchars
, multibyte_nbytes
;
2386 parse_str_as_multibyte ((const unsigned char *) contents
, nbytes
,
2387 &nchars
, &multibyte_nbytes
);
2388 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2389 /* CONTENTS contains no multibyte sequences or contains an invalid
2390 multibyte sequence. We must make unibyte string. */
2391 val
= make_unibyte_string (contents
, nbytes
);
2393 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2398 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2401 make_unibyte_string (const char *contents
, EMACS_INT length
)
2403 register Lisp_Object val
;
2404 val
= make_uninit_string (length
);
2405 memcpy (SDATA (val
), contents
, length
);
2410 /* Make a multibyte string from NCHARS characters occupying NBYTES
2411 bytes at CONTENTS. */
2414 make_multibyte_string (const char *contents
,
2415 EMACS_INT nchars
, EMACS_INT nbytes
)
2417 register Lisp_Object val
;
2418 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2419 memcpy (SDATA (val
), contents
, nbytes
);
2424 /* Make a string from NCHARS characters occupying NBYTES bytes at
2425 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2428 make_string_from_bytes (const char *contents
,
2429 EMACS_INT nchars
, EMACS_INT nbytes
)
2431 register Lisp_Object val
;
2432 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2433 memcpy (SDATA (val
), contents
, nbytes
);
2434 if (SBYTES (val
) == SCHARS (val
))
2435 STRING_SET_UNIBYTE (val
);
2440 /* Make a string from NCHARS characters occupying NBYTES bytes at
2441 CONTENTS. The argument MULTIBYTE controls whether to label the
2442 string as multibyte. If NCHARS is negative, it counts the number of
2443 characters by itself. */
2446 make_specified_string (const char *contents
,
2447 EMACS_INT nchars
, EMACS_INT nbytes
, int multibyte
)
2449 register Lisp_Object val
;
2454 nchars
= multibyte_chars_in_text ((const unsigned char *) contents
,
2459 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2460 memcpy (SDATA (val
), contents
, nbytes
);
2462 STRING_SET_UNIBYTE (val
);
2467 /* Make a string from the data at STR, treating it as multibyte if the
2471 build_string (const char *str
)
2473 return make_string (str
, strlen (str
));
2477 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2478 occupying LENGTH bytes. */
2481 make_uninit_string (EMACS_INT length
)
2486 return empty_unibyte_string
;
2487 val
= make_uninit_multibyte_string (length
, length
);
2488 STRING_SET_UNIBYTE (val
);
2493 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2494 which occupy NBYTES bytes. */
2497 make_uninit_multibyte_string (EMACS_INT nchars
, EMACS_INT nbytes
)
2500 struct Lisp_String
*s
;
2505 return empty_multibyte_string
;
2507 s
= allocate_string ();
2508 allocate_string_data (s
, nchars
, nbytes
);
2509 XSETSTRING (string
, s
);
2510 string_chars_consed
+= nbytes
;
2516 /***********************************************************************
2518 ***********************************************************************/
2520 /* We store float cells inside of float_blocks, allocating a new
2521 float_block with malloc whenever necessary. Float cells reclaimed
2522 by GC are put on a free list to be reallocated before allocating
2523 any new float cells from the latest float_block. */
2525 #define FLOAT_BLOCK_SIZE \
2526 (((BLOCK_BYTES - sizeof (struct float_block *) \
2527 /* The compiler might add padding at the end. */ \
2528 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2529 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2531 #define GETMARKBIT(block,n) \
2532 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2533 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2536 #define SETMARKBIT(block,n) \
2537 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2538 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2540 #define UNSETMARKBIT(block,n) \
2541 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2542 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2544 #define FLOAT_BLOCK(fptr) \
2545 ((struct float_block *) (((uintptr_t) (fptr)) & ~(BLOCK_ALIGN - 1)))
2547 #define FLOAT_INDEX(fptr) \
2548 ((((uintptr_t) (fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2552 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2553 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2554 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2555 struct float_block
*next
;
2558 #define FLOAT_MARKED_P(fptr) \
2559 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2561 #define FLOAT_MARK(fptr) \
2562 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2564 #define FLOAT_UNMARK(fptr) \
2565 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2567 /* Current float_block. */
2569 static struct float_block
*float_block
;
2571 /* Index of first unused Lisp_Float in the current float_block. */
2573 static int float_block_index
;
2575 /* Free-list of Lisp_Floats. */
2577 static struct Lisp_Float
*float_free_list
;
2580 /* Initialize float allocation. */
2586 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2587 float_free_list
= 0;
2591 /* Return a new float object with value FLOAT_VALUE. */
2594 make_float (double float_value
)
2596 register Lisp_Object val
;
2598 /* eassert (!handling_signal); */
2602 if (float_free_list
)
2604 /* We use the data field for chaining the free list
2605 so that we won't use the same field that has the mark bit. */
2606 XSETFLOAT (val
, float_free_list
);
2607 float_free_list
= float_free_list
->u
.chain
;
2611 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2613 register struct float_block
*new;
2615 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2617 new->next
= float_block
;
2618 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2620 float_block_index
= 0;
2622 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2623 float_block_index
++;
2626 MALLOC_UNBLOCK_INPUT
;
2628 XFLOAT_INIT (val
, float_value
);
2629 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2630 consing_since_gc
+= sizeof (struct Lisp_Float
);
2637 /***********************************************************************
2639 ***********************************************************************/
2641 /* We store cons cells inside of cons_blocks, allocating a new
2642 cons_block with malloc whenever necessary. Cons cells reclaimed by
2643 GC are put on a free list to be reallocated before allocating
2644 any new cons cells from the latest cons_block. */
2646 #define CONS_BLOCK_SIZE \
2647 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2648 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2650 #define CONS_BLOCK(fptr) \
2651 ((struct cons_block *) ((uintptr_t) (fptr) & ~(BLOCK_ALIGN - 1)))
2653 #define CONS_INDEX(fptr) \
2654 (((uintptr_t) (fptr) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2658 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2659 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2660 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2661 struct cons_block
*next
;
2664 #define CONS_MARKED_P(fptr) \
2665 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2667 #define CONS_MARK(fptr) \
2668 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2670 #define CONS_UNMARK(fptr) \
2671 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2673 /* Current cons_block. */
2675 static struct cons_block
*cons_block
;
2677 /* Index of first unused Lisp_Cons in the current block. */
2679 static int cons_block_index
;
2681 /* Free-list of Lisp_Cons structures. */
2683 static struct Lisp_Cons
*cons_free_list
;
2686 /* Initialize cons allocation. */
2692 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2697 /* Explicitly free a cons cell by putting it on the free-list. */
2700 free_cons (struct Lisp_Cons
*ptr
)
2702 ptr
->u
.chain
= cons_free_list
;
2706 cons_free_list
= ptr
;
2709 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2710 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2711 (Lisp_Object car
, Lisp_Object cdr
)
2713 register Lisp_Object val
;
2715 /* eassert (!handling_signal); */
2721 /* We use the cdr for chaining the free list
2722 so that we won't use the same field that has the mark bit. */
2723 XSETCONS (val
, cons_free_list
);
2724 cons_free_list
= cons_free_list
->u
.chain
;
2728 if (cons_block_index
== CONS_BLOCK_SIZE
)
2730 register struct cons_block
*new;
2731 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2733 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2734 new->next
= cons_block
;
2736 cons_block_index
= 0;
2738 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2742 MALLOC_UNBLOCK_INPUT
;
2746 eassert (!CONS_MARKED_P (XCONS (val
)));
2747 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2748 cons_cells_consed
++;
2752 #ifdef GC_CHECK_CONS_LIST
2753 /* Get an error now if there's any junk in the cons free list. */
2755 check_cons_list (void)
2757 struct Lisp_Cons
*tail
= cons_free_list
;
2760 tail
= tail
->u
.chain
;
2764 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2767 list1 (Lisp_Object arg1
)
2769 return Fcons (arg1
, Qnil
);
2773 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2775 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2780 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2782 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2787 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2789 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2794 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2796 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2797 Fcons (arg5
, Qnil
)))));
2801 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2802 doc
: /* Return a newly created list with specified arguments as elements.
2803 Any number of arguments, even zero arguments, are allowed.
2804 usage: (list &rest OBJECTS) */)
2805 (ptrdiff_t nargs
, Lisp_Object
*args
)
2807 register Lisp_Object val
;
2813 val
= Fcons (args
[nargs
], val
);
2819 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2820 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2821 (register Lisp_Object length
, Lisp_Object init
)
2823 register Lisp_Object val
;
2824 register EMACS_INT size
;
2826 CHECK_NATNUM (length
);
2827 size
= XFASTINT (length
);
2832 val
= Fcons (init
, val
);
2837 val
= Fcons (init
, val
);
2842 val
= Fcons (init
, val
);
2847 val
= Fcons (init
, val
);
2852 val
= Fcons (init
, val
);
2867 /***********************************************************************
2869 ***********************************************************************/
2871 /* Singly-linked list of all vectors. */
2873 static struct Lisp_Vector
*all_vectors
;
2875 /* Handy constants for vectorlike objects. */
2878 header_size
= offsetof (struct Lisp_Vector
, contents
),
2879 word_size
= sizeof (Lisp_Object
)
2882 /* Value is a pointer to a newly allocated Lisp_Vector structure
2883 with room for LEN Lisp_Objects. */
2885 static struct Lisp_Vector
*
2886 allocate_vectorlike (EMACS_INT len
)
2888 struct Lisp_Vector
*p
;
2893 #ifdef DOUG_LEA_MALLOC
2894 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2895 because mapped region contents are not preserved in
2897 mallopt (M_MMAP_MAX
, 0);
2900 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2901 /* eassert (!handling_signal); */
2903 nbytes
= header_size
+ len
* word_size
;
2904 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
2906 #ifdef DOUG_LEA_MALLOC
2907 /* Back to a reasonable maximum of mmap'ed areas. */
2908 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2911 consing_since_gc
+= nbytes
;
2912 vector_cells_consed
+= len
;
2914 p
->header
.next
.vector
= all_vectors
;
2917 MALLOC_UNBLOCK_INPUT
;
2923 /* Allocate a vector with LEN slots. */
2925 struct Lisp_Vector
*
2926 allocate_vector (EMACS_INT len
)
2928 struct Lisp_Vector
*v
;
2929 ptrdiff_t nbytes_max
= min (PTRDIFF_MAX
, SIZE_MAX
);
2931 if (min ((nbytes_max
- header_size
) / word_size
, MOST_POSITIVE_FIXNUM
) < len
)
2932 memory_full (SIZE_MAX
);
2933 v
= allocate_vectorlike (len
);
2934 v
->header
.size
= len
;
2939 /* Allocate other vector-like structures. */
2941 struct Lisp_Vector
*
2942 allocate_pseudovector (int memlen
, int lisplen
, EMACS_INT tag
)
2944 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2947 /* Only the first lisplen slots will be traced normally by the GC. */
2948 for (i
= 0; i
< lisplen
; ++i
)
2949 v
->contents
[i
] = Qnil
;
2951 XSETPVECTYPESIZE (v
, tag
, lisplen
);
2955 struct Lisp_Hash_Table
*
2956 allocate_hash_table (void)
2958 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
2963 allocate_window (void)
2965 return ALLOCATE_PSEUDOVECTOR(struct window
, current_matrix
, PVEC_WINDOW
);
2970 allocate_terminal (void)
2972 struct terminal
*t
= ALLOCATE_PSEUDOVECTOR (struct terminal
,
2973 next_terminal
, PVEC_TERMINAL
);
2974 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2975 memset (&t
->next_terminal
, 0,
2976 (char*) (t
+ 1) - (char*) &t
->next_terminal
);
2982 allocate_frame (void)
2984 struct frame
*f
= ALLOCATE_PSEUDOVECTOR (struct frame
,
2985 face_cache
, PVEC_FRAME
);
2986 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2987 memset (&f
->face_cache
, 0,
2988 (char *) (f
+ 1) - (char *) &f
->face_cache
);
2993 struct Lisp_Process
*
2994 allocate_process (void)
2996 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
3000 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3001 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3002 See also the function `vector'. */)
3003 (register Lisp_Object length
, Lisp_Object init
)
3006 register EMACS_INT sizei
;
3007 register EMACS_INT i
;
3008 register struct Lisp_Vector
*p
;
3010 CHECK_NATNUM (length
);
3011 sizei
= XFASTINT (length
);
3013 p
= allocate_vector (sizei
);
3014 for (i
= 0; i
< sizei
; i
++)
3015 p
->contents
[i
] = init
;
3017 XSETVECTOR (vector
, p
);
3022 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3023 doc
: /* Return a newly created vector with specified arguments as elements.
3024 Any number of arguments, even zero arguments, are allowed.
3025 usage: (vector &rest OBJECTS) */)
3026 (ptrdiff_t nargs
, Lisp_Object
*args
)
3028 register Lisp_Object len
, val
;
3030 register struct Lisp_Vector
*p
;
3032 XSETFASTINT (len
, nargs
);
3033 val
= Fmake_vector (len
, Qnil
);
3035 for (i
= 0; i
< nargs
; i
++)
3036 p
->contents
[i
] = args
[i
];
3041 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3042 doc
: /* Create a byte-code object with specified arguments as elements.
3043 The arguments should be the ARGLIST, bytecode-string BYTE-CODE, constant
3044 vector CONSTANTS, maximum stack size DEPTH, (optional) DOCSTRING,
3045 and (optional) INTERACTIVE-SPEC.
3046 The first four arguments are required; at most six have any
3048 The ARGLIST can be either like the one of `lambda', in which case the arguments
3049 will be dynamically bound before executing the byte code, or it can be an
3050 integer of the form NNNNNNNRMMMMMMM where the 7bit MMMMMMM specifies the
3051 minimum number of arguments, the 7-bit NNNNNNN specifies the maximum number
3052 of arguments (ignoring &rest) and the R bit specifies whether there is a &rest
3053 argument to catch the left-over arguments. If such an integer is used, the
3054 arguments will not be dynamically bound but will be instead pushed on the
3055 stack before executing the byte-code.
3056 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3057 (ptrdiff_t nargs
, Lisp_Object
*args
)
3059 register Lisp_Object len
, val
;
3061 register struct Lisp_Vector
*p
;
3063 XSETFASTINT (len
, nargs
);
3064 if (!NILP (Vpurify_flag
))
3065 val
= make_pure_vector (nargs
);
3067 val
= Fmake_vector (len
, Qnil
);
3069 if (nargs
> 1 && STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
3070 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3071 earlier because they produced a raw 8-bit string for byte-code
3072 and now such a byte-code string is loaded as multibyte while
3073 raw 8-bit characters converted to multibyte form. Thus, now we
3074 must convert them back to the original unibyte form. */
3075 args
[1] = Fstring_as_unibyte (args
[1]);
3078 for (i
= 0; i
< nargs
; i
++)
3080 if (!NILP (Vpurify_flag
))
3081 args
[i
] = Fpurecopy (args
[i
]);
3082 p
->contents
[i
] = args
[i
];
3084 XSETPVECTYPE (p
, PVEC_COMPILED
);
3085 XSETCOMPILED (val
, p
);
3091 /***********************************************************************
3093 ***********************************************************************/
3095 /* Each symbol_block is just under 1020 bytes long, since malloc
3096 really allocates in units of powers of two and uses 4 bytes for its
3099 #define SYMBOL_BLOCK_SIZE \
3100 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3104 /* Place `symbols' first, to preserve alignment. */
3105 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3106 struct symbol_block
*next
;
3109 /* Current symbol block and index of first unused Lisp_Symbol
3112 static struct symbol_block
*symbol_block
;
3113 static int symbol_block_index
;
3115 /* List of free symbols. */
3117 static struct Lisp_Symbol
*symbol_free_list
;
3120 /* Initialize symbol allocation. */
3125 symbol_block
= NULL
;
3126 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3127 symbol_free_list
= 0;
3131 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3132 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3133 Its value and function definition are void, and its property list is nil. */)
3136 register Lisp_Object val
;
3137 register struct Lisp_Symbol
*p
;
3139 CHECK_STRING (name
);
3141 /* eassert (!handling_signal); */
3145 if (symbol_free_list
)
3147 XSETSYMBOL (val
, symbol_free_list
);
3148 symbol_free_list
= symbol_free_list
->next
;
3152 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3154 struct symbol_block
*new;
3155 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3157 new->next
= symbol_block
;
3159 symbol_block_index
= 0;
3161 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3162 symbol_block_index
++;
3165 MALLOC_UNBLOCK_INPUT
;
3170 p
->redirect
= SYMBOL_PLAINVAL
;
3171 SET_SYMBOL_VAL (p
, Qunbound
);
3172 p
->function
= Qunbound
;
3175 p
->interned
= SYMBOL_UNINTERNED
;
3177 p
->declared_special
= 0;
3178 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3185 /***********************************************************************
3186 Marker (Misc) Allocation
3187 ***********************************************************************/
3189 /* Allocation of markers and other objects that share that structure.
3190 Works like allocation of conses. */
3192 #define MARKER_BLOCK_SIZE \
3193 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3197 /* Place `markers' first, to preserve alignment. */
3198 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3199 struct marker_block
*next
;
3202 static struct marker_block
*marker_block
;
3203 static int marker_block_index
;
3205 static union Lisp_Misc
*marker_free_list
;
3210 marker_block
= NULL
;
3211 marker_block_index
= MARKER_BLOCK_SIZE
;
3212 marker_free_list
= 0;
3215 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3218 allocate_misc (void)
3222 /* eassert (!handling_signal); */
3226 if (marker_free_list
)
3228 XSETMISC (val
, marker_free_list
);
3229 marker_free_list
= marker_free_list
->u_free
.chain
;
3233 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3235 struct marker_block
*new;
3236 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3238 new->next
= marker_block
;
3240 marker_block_index
= 0;
3241 total_free_markers
+= MARKER_BLOCK_SIZE
;
3243 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3244 marker_block_index
++;
3247 MALLOC_UNBLOCK_INPUT
;
3249 --total_free_markers
;
3250 consing_since_gc
+= sizeof (union Lisp_Misc
);
3251 misc_objects_consed
++;
3252 XMISCANY (val
)->gcmarkbit
= 0;
3256 /* Free a Lisp_Misc object */
3259 free_misc (Lisp_Object misc
)
3261 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3262 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3263 marker_free_list
= XMISC (misc
);
3265 total_free_markers
++;
3268 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3269 INTEGER. This is used to package C values to call record_unwind_protect.
3270 The unwind function can get the C values back using XSAVE_VALUE. */
3273 make_save_value (void *pointer
, ptrdiff_t integer
)
3275 register Lisp_Object val
;
3276 register struct Lisp_Save_Value
*p
;
3278 val
= allocate_misc ();
3279 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3280 p
= XSAVE_VALUE (val
);
3281 p
->pointer
= pointer
;
3282 p
->integer
= integer
;
3287 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3288 doc
: /* Return a newly allocated marker which does not point at any place. */)
3291 register Lisp_Object val
;
3292 register struct Lisp_Marker
*p
;
3294 val
= allocate_misc ();
3295 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3301 p
->insertion_type
= 0;
3305 /* Put MARKER back on the free list after using it temporarily. */
3308 free_marker (Lisp_Object marker
)
3310 unchain_marker (XMARKER (marker
));
3315 /* Return a newly created vector or string with specified arguments as
3316 elements. If all the arguments are characters that can fit
3317 in a string of events, make a string; otherwise, make a vector.
3319 Any number of arguments, even zero arguments, are allowed. */
3322 make_event_array (register int nargs
, Lisp_Object
*args
)
3326 for (i
= 0; i
< nargs
; i
++)
3327 /* The things that fit in a string
3328 are characters that are in 0...127,
3329 after discarding the meta bit and all the bits above it. */
3330 if (!INTEGERP (args
[i
])
3331 || (XINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3332 return Fvector (nargs
, args
);
3334 /* Since the loop exited, we know that all the things in it are
3335 characters, so we can make a string. */
3339 result
= Fmake_string (make_number (nargs
), make_number (0));
3340 for (i
= 0; i
< nargs
; i
++)
3342 SSET (result
, i
, XINT (args
[i
]));
3343 /* Move the meta bit to the right place for a string char. */
3344 if (XINT (args
[i
]) & CHAR_META
)
3345 SSET (result
, i
, SREF (result
, i
) | 0x80);
3354 /************************************************************************
3355 Memory Full Handling
3356 ************************************************************************/
3359 /* Called if malloc (NBYTES) returns zero. If NBYTES == SIZE_MAX,
3360 there may have been size_t overflow so that malloc was never
3361 called, or perhaps malloc was invoked successfully but the
3362 resulting pointer had problems fitting into a tagged EMACS_INT. In
3363 either case this counts as memory being full even though malloc did
3367 memory_full (size_t nbytes
)
3369 /* Do not go into hysterics merely because a large request failed. */
3370 int enough_free_memory
= 0;
3371 if (SPARE_MEMORY
< nbytes
)
3376 p
= malloc (SPARE_MEMORY
);
3380 enough_free_memory
= 1;
3382 MALLOC_UNBLOCK_INPUT
;
3385 if (! enough_free_memory
)
3391 memory_full_cons_threshold
= sizeof (struct cons_block
);
3393 /* The first time we get here, free the spare memory. */
3394 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3395 if (spare_memory
[i
])
3398 free (spare_memory
[i
]);
3399 else if (i
>= 1 && i
<= 4)
3400 lisp_align_free (spare_memory
[i
]);
3402 lisp_free (spare_memory
[i
]);
3403 spare_memory
[i
] = 0;
3406 /* Record the space now used. When it decreases substantially,
3407 we can refill the memory reserve. */
3408 #if !defined SYSTEM_MALLOC && !defined SYNC_INPUT
3409 bytes_used_when_full
= BYTES_USED
;
3413 /* This used to call error, but if we've run out of memory, we could
3414 get infinite recursion trying to build the string. */
3415 xsignal (Qnil
, Vmemory_signal_data
);
3418 /* If we released our reserve (due to running out of memory),
3419 and we have a fair amount free once again,
3420 try to set aside another reserve in case we run out once more.
3422 This is called when a relocatable block is freed in ralloc.c,
3423 and also directly from this file, in case we're not using ralloc.c. */
3426 refill_memory_reserve (void)
3428 #ifndef SYSTEM_MALLOC
3429 if (spare_memory
[0] == 0)
3430 spare_memory
[0] = (char *) malloc (SPARE_MEMORY
);
3431 if (spare_memory
[1] == 0)
3432 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3434 if (spare_memory
[2] == 0)
3435 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3437 if (spare_memory
[3] == 0)
3438 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3440 if (spare_memory
[4] == 0)
3441 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3443 if (spare_memory
[5] == 0)
3444 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3446 if (spare_memory
[6] == 0)
3447 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3449 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3450 Vmemory_full
= Qnil
;
3454 /************************************************************************
3456 ************************************************************************/
3458 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3460 /* Conservative C stack marking requires a method to identify possibly
3461 live Lisp objects given a pointer value. We do this by keeping
3462 track of blocks of Lisp data that are allocated in a red-black tree
3463 (see also the comment of mem_node which is the type of nodes in
3464 that tree). Function lisp_malloc adds information for an allocated
3465 block to the red-black tree with calls to mem_insert, and function
3466 lisp_free removes it with mem_delete. Functions live_string_p etc
3467 call mem_find to lookup information about a given pointer in the
3468 tree, and use that to determine if the pointer points to a Lisp
3471 /* Initialize this part of alloc.c. */
3476 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3477 mem_z
.parent
= NULL
;
3478 mem_z
.color
= MEM_BLACK
;
3479 mem_z
.start
= mem_z
.end
= NULL
;
3484 /* Value is a pointer to the mem_node containing START. Value is
3485 MEM_NIL if there is no node in the tree containing START. */
3487 static inline struct mem_node
*
3488 mem_find (void *start
)
3492 if (start
< min_heap_address
|| start
> max_heap_address
)
3495 /* Make the search always successful to speed up the loop below. */
3496 mem_z
.start
= start
;
3497 mem_z
.end
= (char *) start
+ 1;
3500 while (start
< p
->start
|| start
>= p
->end
)
3501 p
= start
< p
->start
? p
->left
: p
->right
;
3506 /* Insert a new node into the tree for a block of memory with start
3507 address START, end address END, and type TYPE. Value is a
3508 pointer to the node that was inserted. */
3510 static struct mem_node
*
3511 mem_insert (void *start
, void *end
, enum mem_type type
)
3513 struct mem_node
*c
, *parent
, *x
;
3515 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3516 min_heap_address
= start
;
3517 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3518 max_heap_address
= end
;
3520 /* See where in the tree a node for START belongs. In this
3521 particular application, it shouldn't happen that a node is already
3522 present. For debugging purposes, let's check that. */
3526 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3528 while (c
!= MEM_NIL
)
3530 if (start
>= c
->start
&& start
< c
->end
)
3533 c
= start
< c
->start
? c
->left
: c
->right
;
3536 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3538 while (c
!= MEM_NIL
)
3541 c
= start
< c
->start
? c
->left
: c
->right
;
3544 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3546 /* Create a new node. */
3547 #ifdef GC_MALLOC_CHECK
3548 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3552 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3558 x
->left
= x
->right
= MEM_NIL
;
3561 /* Insert it as child of PARENT or install it as root. */
3564 if (start
< parent
->start
)
3572 /* Re-establish red-black tree properties. */
3573 mem_insert_fixup (x
);
3579 /* Re-establish the red-black properties of the tree, and thereby
3580 balance the tree, after node X has been inserted; X is always red. */
3583 mem_insert_fixup (struct mem_node
*x
)
3585 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3587 /* X is red and its parent is red. This is a violation of
3588 red-black tree property #3. */
3590 if (x
->parent
== x
->parent
->parent
->left
)
3592 /* We're on the left side of our grandparent, and Y is our
3594 struct mem_node
*y
= x
->parent
->parent
->right
;
3596 if (y
->color
== MEM_RED
)
3598 /* Uncle and parent are red but should be black because
3599 X is red. Change the colors accordingly and proceed
3600 with the grandparent. */
3601 x
->parent
->color
= MEM_BLACK
;
3602 y
->color
= MEM_BLACK
;
3603 x
->parent
->parent
->color
= MEM_RED
;
3604 x
= x
->parent
->parent
;
3608 /* Parent and uncle have different colors; parent is
3609 red, uncle is black. */
3610 if (x
== x
->parent
->right
)
3613 mem_rotate_left (x
);
3616 x
->parent
->color
= MEM_BLACK
;
3617 x
->parent
->parent
->color
= MEM_RED
;
3618 mem_rotate_right (x
->parent
->parent
);
3623 /* This is the symmetrical case of above. */
3624 struct mem_node
*y
= x
->parent
->parent
->left
;
3626 if (y
->color
== MEM_RED
)
3628 x
->parent
->color
= MEM_BLACK
;
3629 y
->color
= MEM_BLACK
;
3630 x
->parent
->parent
->color
= MEM_RED
;
3631 x
= x
->parent
->parent
;
3635 if (x
== x
->parent
->left
)
3638 mem_rotate_right (x
);
3641 x
->parent
->color
= MEM_BLACK
;
3642 x
->parent
->parent
->color
= MEM_RED
;
3643 mem_rotate_left (x
->parent
->parent
);
3648 /* The root may have been changed to red due to the algorithm. Set
3649 it to black so that property #5 is satisfied. */
3650 mem_root
->color
= MEM_BLACK
;
3661 mem_rotate_left (struct mem_node
*x
)
3665 /* Turn y's left sub-tree into x's right sub-tree. */
3668 if (y
->left
!= MEM_NIL
)
3669 y
->left
->parent
= x
;
3671 /* Y's parent was x's parent. */
3673 y
->parent
= x
->parent
;
3675 /* Get the parent to point to y instead of x. */
3678 if (x
== x
->parent
->left
)
3679 x
->parent
->left
= y
;
3681 x
->parent
->right
= y
;
3686 /* Put x on y's left. */
3700 mem_rotate_right (struct mem_node
*x
)
3702 struct mem_node
*y
= x
->left
;
3705 if (y
->right
!= MEM_NIL
)
3706 y
->right
->parent
= x
;
3709 y
->parent
= x
->parent
;
3712 if (x
== x
->parent
->right
)
3713 x
->parent
->right
= y
;
3715 x
->parent
->left
= y
;
3726 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3729 mem_delete (struct mem_node
*z
)
3731 struct mem_node
*x
, *y
;
3733 if (!z
|| z
== MEM_NIL
)
3736 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3741 while (y
->left
!= MEM_NIL
)
3745 if (y
->left
!= MEM_NIL
)
3750 x
->parent
= y
->parent
;
3753 if (y
== y
->parent
->left
)
3754 y
->parent
->left
= x
;
3756 y
->parent
->right
= x
;
3763 z
->start
= y
->start
;
3768 if (y
->color
== MEM_BLACK
)
3769 mem_delete_fixup (x
);
3771 #ifdef GC_MALLOC_CHECK
3779 /* Re-establish the red-black properties of the tree, after a
3783 mem_delete_fixup (struct mem_node
*x
)
3785 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3787 if (x
== x
->parent
->left
)
3789 struct mem_node
*w
= x
->parent
->right
;
3791 if (w
->color
== MEM_RED
)
3793 w
->color
= MEM_BLACK
;
3794 x
->parent
->color
= MEM_RED
;
3795 mem_rotate_left (x
->parent
);
3796 w
= x
->parent
->right
;
3799 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3806 if (w
->right
->color
== MEM_BLACK
)
3808 w
->left
->color
= MEM_BLACK
;
3810 mem_rotate_right (w
);
3811 w
= x
->parent
->right
;
3813 w
->color
= x
->parent
->color
;
3814 x
->parent
->color
= MEM_BLACK
;
3815 w
->right
->color
= MEM_BLACK
;
3816 mem_rotate_left (x
->parent
);
3822 struct mem_node
*w
= x
->parent
->left
;
3824 if (w
->color
== MEM_RED
)
3826 w
->color
= MEM_BLACK
;
3827 x
->parent
->color
= MEM_RED
;
3828 mem_rotate_right (x
->parent
);
3829 w
= x
->parent
->left
;
3832 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3839 if (w
->left
->color
== MEM_BLACK
)
3841 w
->right
->color
= MEM_BLACK
;
3843 mem_rotate_left (w
);
3844 w
= x
->parent
->left
;
3847 w
->color
= x
->parent
->color
;
3848 x
->parent
->color
= MEM_BLACK
;
3849 w
->left
->color
= MEM_BLACK
;
3850 mem_rotate_right (x
->parent
);
3856 x
->color
= MEM_BLACK
;
3860 /* Value is non-zero if P is a pointer to a live Lisp string on
3861 the heap. M is a pointer to the mem_block for P. */
3864 live_string_p (struct mem_node
*m
, void *p
)
3866 if (m
->type
== MEM_TYPE_STRING
)
3868 struct string_block
*b
= (struct string_block
*) m
->start
;
3869 ptrdiff_t offset
= (char *) p
- (char *) &b
->strings
[0];
3871 /* P must point to the start of a Lisp_String structure, and it
3872 must not be on the free-list. */
3874 && offset
% sizeof b
->strings
[0] == 0
3875 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3876 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3883 /* Value is non-zero if P is a pointer to a live Lisp cons on
3884 the heap. M is a pointer to the mem_block for P. */
3887 live_cons_p (struct mem_node
*m
, void *p
)
3889 if (m
->type
== MEM_TYPE_CONS
)
3891 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3892 ptrdiff_t offset
= (char *) p
- (char *) &b
->conses
[0];
3894 /* P must point to the start of a Lisp_Cons, not be
3895 one of the unused cells in the current cons block,
3896 and not be on the free-list. */
3898 && offset
% sizeof b
->conses
[0] == 0
3899 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3901 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3902 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3909 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3910 the heap. M is a pointer to the mem_block for P. */
3913 live_symbol_p (struct mem_node
*m
, void *p
)
3915 if (m
->type
== MEM_TYPE_SYMBOL
)
3917 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3918 ptrdiff_t offset
= (char *) p
- (char *) &b
->symbols
[0];
3920 /* P must point to the start of a Lisp_Symbol, not be
3921 one of the unused cells in the current symbol block,
3922 and not be on the free-list. */
3924 && offset
% sizeof b
->symbols
[0] == 0
3925 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3926 && (b
!= symbol_block
3927 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3928 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3935 /* Value is non-zero if P is a pointer to a live Lisp float on
3936 the heap. M is a pointer to the mem_block for P. */
3939 live_float_p (struct mem_node
*m
, void *p
)
3941 if (m
->type
== MEM_TYPE_FLOAT
)
3943 struct float_block
*b
= (struct float_block
*) m
->start
;
3944 ptrdiff_t offset
= (char *) p
- (char *) &b
->floats
[0];
3946 /* P must point to the start of a Lisp_Float and not be
3947 one of the unused cells in the current float block. */
3949 && offset
% sizeof b
->floats
[0] == 0
3950 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3951 && (b
!= float_block
3952 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3959 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3960 the heap. M is a pointer to the mem_block for P. */
3963 live_misc_p (struct mem_node
*m
, void *p
)
3965 if (m
->type
== MEM_TYPE_MISC
)
3967 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3968 ptrdiff_t offset
= (char *) p
- (char *) &b
->markers
[0];
3970 /* P must point to the start of a Lisp_Misc, not be
3971 one of the unused cells in the current misc block,
3972 and not be on the free-list. */
3974 && offset
% sizeof b
->markers
[0] == 0
3975 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3976 && (b
!= marker_block
3977 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3978 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
3985 /* Value is non-zero if P is a pointer to a live vector-like object.
3986 M is a pointer to the mem_block for P. */
3989 live_vector_p (struct mem_node
*m
, void *p
)
3991 return (p
== m
->start
&& m
->type
== MEM_TYPE_VECTORLIKE
);
3995 /* Value is non-zero if P is a pointer to a live buffer. M is a
3996 pointer to the mem_block for P. */
3999 live_buffer_p (struct mem_node
*m
, void *p
)
4001 /* P must point to the start of the block, and the buffer
4002 must not have been killed. */
4003 return (m
->type
== MEM_TYPE_BUFFER
4005 && !NILP (((struct buffer
*) p
)->BUFFER_INTERNAL_FIELD (name
)));
4008 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4012 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4014 /* Array of objects that are kept alive because the C stack contains
4015 a pattern that looks like a reference to them . */
4017 #define MAX_ZOMBIES 10
4018 static Lisp_Object zombies
[MAX_ZOMBIES
];
4020 /* Number of zombie objects. */
4022 static EMACS_INT nzombies
;
4024 /* Number of garbage collections. */
4026 static EMACS_INT ngcs
;
4028 /* Average percentage of zombies per collection. */
4030 static double avg_zombies
;
4032 /* Max. number of live and zombie objects. */
4034 static EMACS_INT max_live
, max_zombies
;
4036 /* Average number of live objects per GC. */
4038 static double avg_live
;
4040 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4041 doc
: /* Show information about live and zombie objects. */)
4044 Lisp_Object args
[8], zombie_list
= Qnil
;
4046 for (i
= 0; i
< nzombies
; i
++)
4047 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4048 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4049 args
[1] = make_number (ngcs
);
4050 args
[2] = make_float (avg_live
);
4051 args
[3] = make_float (avg_zombies
);
4052 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4053 args
[5] = make_number (max_live
);
4054 args
[6] = make_number (max_zombies
);
4055 args
[7] = zombie_list
;
4056 return Fmessage (8, args
);
4059 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4062 /* Mark OBJ if we can prove it's a Lisp_Object. */
4065 mark_maybe_object (Lisp_Object obj
)
4073 po
= (void *) XPNTR (obj
);
4080 switch (XTYPE (obj
))
4083 mark_p
= (live_string_p (m
, po
)
4084 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4088 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4092 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4096 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4099 case Lisp_Vectorlike
:
4100 /* Note: can't check BUFFERP before we know it's a
4101 buffer because checking that dereferences the pointer
4102 PO which might point anywhere. */
4103 if (live_vector_p (m
, po
))
4104 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4105 else if (live_buffer_p (m
, po
))
4106 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4110 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4119 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4120 if (nzombies
< MAX_ZOMBIES
)
4121 zombies
[nzombies
] = obj
;
4130 /* If P points to Lisp data, mark that as live if it isn't already
4134 mark_maybe_pointer (void *p
)
4138 /* Quickly rule out some values which can't point to Lisp data. */
4141 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */
4143 2 /* We assume that Lisp data is aligned on even addresses. */
4151 Lisp_Object obj
= Qnil
;
4155 case MEM_TYPE_NON_LISP
:
4156 /* Nothing to do; not a pointer to Lisp memory. */
4159 case MEM_TYPE_BUFFER
:
4160 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4161 XSETVECTOR (obj
, p
);
4165 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4169 case MEM_TYPE_STRING
:
4170 if (live_string_p (m
, p
)
4171 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4172 XSETSTRING (obj
, p
);
4176 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4180 case MEM_TYPE_SYMBOL
:
4181 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4182 XSETSYMBOL (obj
, p
);
4185 case MEM_TYPE_FLOAT
:
4186 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4190 case MEM_TYPE_VECTORLIKE
:
4191 if (live_vector_p (m
, p
))
4194 XSETVECTOR (tem
, p
);
4195 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4210 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4211 or END+OFFSET..START. */
4214 mark_memory (void *start
, void *end
, int offset
)
4219 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4223 /* Make START the pointer to the start of the memory region,
4224 if it isn't already. */
4232 /* Mark Lisp_Objects. */
4233 for (p
= (Lisp_Object
*) ((char *) start
+ offset
); (void *) p
< end
; ++p
)
4234 mark_maybe_object (*p
);
4236 /* Mark Lisp data pointed to. This is necessary because, in some
4237 situations, the C compiler optimizes Lisp objects away, so that
4238 only a pointer to them remains. Example:
4240 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4243 Lisp_Object obj = build_string ("test");
4244 struct Lisp_String *s = XSTRING (obj);
4245 Fgarbage_collect ();
4246 fprintf (stderr, "test `%s'\n", s->data);
4250 Here, `obj' isn't really used, and the compiler optimizes it
4251 away. The only reference to the life string is through the
4254 for (pp
= (void **) ((char *) start
+ offset
); (void *) pp
< end
; ++pp
)
4255 mark_maybe_pointer (*pp
);
4258 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4259 the GCC system configuration. In gcc 3.2, the only systems for
4260 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4261 by others?) and ns32k-pc532-min. */
4263 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4265 static int setjmp_tested_p
, longjmps_done
;
4267 #define SETJMP_WILL_LIKELY_WORK "\
4269 Emacs garbage collector has been changed to use conservative stack\n\
4270 marking. Emacs has determined that the method it uses to do the\n\
4271 marking will likely work on your system, but this isn't sure.\n\
4273 If you are a system-programmer, or can get the help of a local wizard\n\
4274 who is, please take a look at the function mark_stack in alloc.c, and\n\
4275 verify that the methods used are appropriate for your system.\n\
4277 Please mail the result to <emacs-devel@gnu.org>.\n\
4280 #define SETJMP_WILL_NOT_WORK "\
4282 Emacs garbage collector has been changed to use conservative stack\n\
4283 marking. Emacs has determined that the default method it uses to do the\n\
4284 marking will not work on your system. We will need a system-dependent\n\
4285 solution for your system.\n\
4287 Please take a look at the function mark_stack in alloc.c, and\n\
4288 try to find a way to make it work on your system.\n\
4290 Note that you may get false negatives, depending on the compiler.\n\
4291 In particular, you need to use -O with GCC for this test.\n\
4293 Please mail the result to <emacs-devel@gnu.org>.\n\
4297 /* Perform a quick check if it looks like setjmp saves registers in a
4298 jmp_buf. Print a message to stderr saying so. When this test
4299 succeeds, this is _not_ a proof that setjmp is sufficient for
4300 conservative stack marking. Only the sources or a disassembly
4311 /* Arrange for X to be put in a register. */
4317 if (longjmps_done
== 1)
4319 /* Came here after the longjmp at the end of the function.
4321 If x == 1, the longjmp has restored the register to its
4322 value before the setjmp, and we can hope that setjmp
4323 saves all such registers in the jmp_buf, although that
4326 For other values of X, either something really strange is
4327 taking place, or the setjmp just didn't save the register. */
4330 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4333 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4340 if (longjmps_done
== 1)
4344 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4347 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4349 /* Abort if anything GCPRO'd doesn't survive the GC. */
4357 for (p
= gcprolist
; p
; p
= p
->next
)
4358 for (i
= 0; i
< p
->nvars
; ++i
)
4359 if (!survives_gc_p (p
->var
[i
]))
4360 /* FIXME: It's not necessarily a bug. It might just be that the
4361 GCPRO is unnecessary or should release the object sooner. */
4365 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4372 fprintf (stderr
, "\nZombies kept alive = %"pI
":\n", nzombies
);
4373 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4375 fprintf (stderr
, " %d = ", i
);
4376 debug_print (zombies
[i
]);
4380 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4383 /* Mark live Lisp objects on the C stack.
4385 There are several system-dependent problems to consider when
4386 porting this to new architectures:
4390 We have to mark Lisp objects in CPU registers that can hold local
4391 variables or are used to pass parameters.
4393 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4394 something that either saves relevant registers on the stack, or
4395 calls mark_maybe_object passing it each register's contents.
4397 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4398 implementation assumes that calling setjmp saves registers we need
4399 to see in a jmp_buf which itself lies on the stack. This doesn't
4400 have to be true! It must be verified for each system, possibly
4401 by taking a look at the source code of setjmp.
4403 If __builtin_unwind_init is available (defined by GCC >= 2.8) we
4404 can use it as a machine independent method to store all registers
4405 to the stack. In this case the macros described in the previous
4406 two paragraphs are not used.
4410 Architectures differ in the way their processor stack is organized.
4411 For example, the stack might look like this
4414 | Lisp_Object | size = 4
4416 | something else | size = 2
4418 | Lisp_Object | size = 4
4422 In such a case, not every Lisp_Object will be aligned equally. To
4423 find all Lisp_Object on the stack it won't be sufficient to walk
4424 the stack in steps of 4 bytes. Instead, two passes will be
4425 necessary, one starting at the start of the stack, and a second
4426 pass starting at the start of the stack + 2. Likewise, if the
4427 minimal alignment of Lisp_Objects on the stack is 1, four passes
4428 would be necessary, each one starting with one byte more offset
4429 from the stack start.
4431 The current code assumes by default that Lisp_Objects are aligned
4432 equally on the stack. */
4440 #ifdef HAVE___BUILTIN_UNWIND_INIT
4441 /* Force callee-saved registers and register windows onto the stack.
4442 This is the preferred method if available, obviating the need for
4443 machine dependent methods. */
4444 __builtin_unwind_init ();
4446 #else /* not HAVE___BUILTIN_UNWIND_INIT */
4447 #ifndef GC_SAVE_REGISTERS_ON_STACK
4448 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4449 union aligned_jmpbuf
{
4453 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4455 /* This trick flushes the register windows so that all the state of
4456 the process is contained in the stack. */
4457 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4458 needed on ia64 too. See mach_dep.c, where it also says inline
4459 assembler doesn't work with relevant proprietary compilers. */
4461 #if defined (__sparc64__) && defined (__FreeBSD__)
4462 /* FreeBSD does not have a ta 3 handler. */
4469 /* Save registers that we need to see on the stack. We need to see
4470 registers used to hold register variables and registers used to
4472 #ifdef GC_SAVE_REGISTERS_ON_STACK
4473 GC_SAVE_REGISTERS_ON_STACK (end
);
4474 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4476 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4477 setjmp will definitely work, test it
4478 and print a message with the result
4480 if (!setjmp_tested_p
)
4482 setjmp_tested_p
= 1;
4485 #endif /* GC_SETJMP_WORKS */
4488 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4489 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4490 #endif /* not HAVE___BUILTIN_UNWIND_INIT */
4492 /* This assumes that the stack is a contiguous region in memory. If
4493 that's not the case, something has to be done here to iterate
4494 over the stack segments. */
4495 #ifndef GC_LISP_OBJECT_ALIGNMENT
4497 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4499 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4502 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4503 mark_memory (stack_base
, end
, i
);
4504 /* Allow for marking a secondary stack, like the register stack on the
4506 #ifdef GC_MARK_SECONDARY_STACK
4507 GC_MARK_SECONDARY_STACK ();
4510 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4515 #endif /* GC_MARK_STACK != 0 */
4518 /* Determine whether it is safe to access memory at address P. */
4520 valid_pointer_p (void *p
)
4523 return w32_valid_pointer_p (p
, 16);
4527 /* Obviously, we cannot just access it (we would SEGV trying), so we
4528 trick the o/s to tell us whether p is a valid pointer.
4529 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4530 not validate p in that case. */
4534 int valid
= (emacs_write (fd
[1], (char *) p
, 16) == 16);
4535 emacs_close (fd
[1]);
4536 emacs_close (fd
[0]);
4544 /* Return 1 if OBJ is a valid lisp object.
4545 Return 0 if OBJ is NOT a valid lisp object.
4546 Return -1 if we cannot validate OBJ.
4547 This function can be quite slow,
4548 so it should only be used in code for manual debugging. */
4551 valid_lisp_object_p (Lisp_Object obj
)
4561 p
= (void *) XPNTR (obj
);
4562 if (PURE_POINTER_P (p
))
4566 return valid_pointer_p (p
);
4573 int valid
= valid_pointer_p (p
);
4585 case MEM_TYPE_NON_LISP
:
4588 case MEM_TYPE_BUFFER
:
4589 return live_buffer_p (m
, p
);
4592 return live_cons_p (m
, p
);
4594 case MEM_TYPE_STRING
:
4595 return live_string_p (m
, p
);
4598 return live_misc_p (m
, p
);
4600 case MEM_TYPE_SYMBOL
:
4601 return live_symbol_p (m
, p
);
4603 case MEM_TYPE_FLOAT
:
4604 return live_float_p (m
, p
);
4606 case MEM_TYPE_VECTORLIKE
:
4607 return live_vector_p (m
, p
);
4620 /***********************************************************************
4621 Pure Storage Management
4622 ***********************************************************************/
4624 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4625 pointer to it. TYPE is the Lisp type for which the memory is
4626 allocated. TYPE < 0 means it's not used for a Lisp object. */
4628 static POINTER_TYPE
*
4629 pure_alloc (size_t size
, int type
)
4631 POINTER_TYPE
*result
;
4633 size_t alignment
= (1 << GCTYPEBITS
);
4635 size_t alignment
= sizeof (EMACS_INT
);
4637 /* Give Lisp_Floats an extra alignment. */
4638 if (type
== Lisp_Float
)
4640 #if defined __GNUC__ && __GNUC__ >= 2
4641 alignment
= __alignof (struct Lisp_Float
);
4643 alignment
= sizeof (struct Lisp_Float
);
4651 /* Allocate space for a Lisp object from the beginning of the free
4652 space with taking account of alignment. */
4653 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4654 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4658 /* Allocate space for a non-Lisp object from the end of the free
4660 pure_bytes_used_non_lisp
+= size
;
4661 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4663 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4665 if (pure_bytes_used
<= pure_size
)
4668 /* Don't allocate a large amount here,
4669 because it might get mmap'd and then its address
4670 might not be usable. */
4671 purebeg
= (char *) xmalloc (10000);
4673 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4674 pure_bytes_used
= 0;
4675 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4680 /* Print a warning if PURESIZE is too small. */
4683 check_pure_size (void)
4685 if (pure_bytes_used_before_overflow
)
4686 message (("emacs:0:Pure Lisp storage overflow (approx. %"pI
"d"
4688 pure_bytes_used
+ pure_bytes_used_before_overflow
);
4692 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4693 the non-Lisp data pool of the pure storage, and return its start
4694 address. Return NULL if not found. */
4697 find_string_data_in_pure (const char *data
, EMACS_INT nbytes
)
4700 EMACS_INT skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4701 const unsigned char *p
;
4704 if (pure_bytes_used_non_lisp
< nbytes
+ 1)
4707 /* Set up the Boyer-Moore table. */
4709 for (i
= 0; i
< 256; i
++)
4712 p
= (const unsigned char *) data
;
4714 bm_skip
[*p
++] = skip
;
4716 last_char_skip
= bm_skip
['\0'];
4718 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4719 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4721 /* See the comments in the function `boyer_moore' (search.c) for the
4722 use of `infinity'. */
4723 infinity
= pure_bytes_used_non_lisp
+ 1;
4724 bm_skip
['\0'] = infinity
;
4726 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
4730 /* Check the last character (== '\0'). */
4733 start
+= bm_skip
[*(p
+ start
)];
4735 while (start
<= start_max
);
4737 if (start
< infinity
)
4738 /* Couldn't find the last character. */
4741 /* No less than `infinity' means we could find the last
4742 character at `p[start - infinity]'. */
4745 /* Check the remaining characters. */
4746 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4748 return non_lisp_beg
+ start
;
4750 start
+= last_char_skip
;
4752 while (start
<= start_max
);
4758 /* Return a string allocated in pure space. DATA is a buffer holding
4759 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4760 non-zero means make the result string multibyte.
4762 Must get an error if pure storage is full, since if it cannot hold
4763 a large string it may be able to hold conses that point to that
4764 string; then the string is not protected from gc. */
4767 make_pure_string (const char *data
,
4768 EMACS_INT nchars
, EMACS_INT nbytes
, int multibyte
)
4771 struct Lisp_String
*s
;
4773 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4774 s
->data
= (unsigned char *) find_string_data_in_pure (data
, nbytes
);
4775 if (s
->data
== NULL
)
4777 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4778 memcpy (s
->data
, data
, nbytes
);
4779 s
->data
[nbytes
] = '\0';
4782 s
->size_byte
= multibyte
? nbytes
: -1;
4783 s
->intervals
= NULL_INTERVAL
;
4784 XSETSTRING (string
, s
);
4788 /* Return a string a string allocated in pure space. Do not allocate
4789 the string data, just point to DATA. */
4792 make_pure_c_string (const char *data
)
4795 struct Lisp_String
*s
;
4796 EMACS_INT nchars
= strlen (data
);
4798 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4801 s
->data
= (unsigned char *) data
;
4802 s
->intervals
= NULL_INTERVAL
;
4803 XSETSTRING (string
, s
);
4807 /* Return a cons allocated from pure space. Give it pure copies
4808 of CAR as car and CDR as cdr. */
4811 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
4813 register Lisp_Object
new;
4814 struct Lisp_Cons
*p
;
4816 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4818 XSETCAR (new, Fpurecopy (car
));
4819 XSETCDR (new, Fpurecopy (cdr
));
4824 /* Value is a float object with value NUM allocated from pure space. */
4827 make_pure_float (double num
)
4829 register Lisp_Object
new;
4830 struct Lisp_Float
*p
;
4832 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4834 XFLOAT_INIT (new, num
);
4839 /* Return a vector with room for LEN Lisp_Objects allocated from
4843 make_pure_vector (EMACS_INT len
)
4846 struct Lisp_Vector
*p
;
4847 size_t size
= (offsetof (struct Lisp_Vector
, contents
)
4848 + len
* sizeof (Lisp_Object
));
4850 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4851 XSETVECTOR (new, p
);
4852 XVECTOR (new)->header
.size
= len
;
4857 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4858 doc
: /* Make a copy of object OBJ in pure storage.
4859 Recursively copies contents of vectors and cons cells.
4860 Does not copy symbols. Copies strings without text properties. */)
4861 (register Lisp_Object obj
)
4863 if (NILP (Vpurify_flag
))
4866 if (PURE_POINTER_P (XPNTR (obj
)))
4869 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4871 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
4877 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
4878 else if (FLOATP (obj
))
4879 obj
= make_pure_float (XFLOAT_DATA (obj
));
4880 else if (STRINGP (obj
))
4881 obj
= make_pure_string (SSDATA (obj
), SCHARS (obj
),
4883 STRING_MULTIBYTE (obj
));
4884 else if (COMPILEDP (obj
) || VECTORP (obj
))
4886 register struct Lisp_Vector
*vec
;
4887 register EMACS_INT i
;
4891 if (size
& PSEUDOVECTOR_FLAG
)
4892 size
&= PSEUDOVECTOR_SIZE_MASK
;
4893 vec
= XVECTOR (make_pure_vector (size
));
4894 for (i
= 0; i
< size
; i
++)
4895 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4896 if (COMPILEDP (obj
))
4898 XSETPVECTYPE (vec
, PVEC_COMPILED
);
4899 XSETCOMPILED (obj
, vec
);
4902 XSETVECTOR (obj
, vec
);
4904 else if (MARKERP (obj
))
4905 error ("Attempt to copy a marker to pure storage");
4907 /* Not purified, don't hash-cons. */
4910 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4911 Fputhash (obj
, obj
, Vpurify_flag
);
4918 /***********************************************************************
4920 ***********************************************************************/
4922 /* Put an entry in staticvec, pointing at the variable with address
4926 staticpro (Lisp_Object
*varaddress
)
4928 staticvec
[staticidx
++] = varaddress
;
4929 if (staticidx
>= NSTATICS
)
4934 /***********************************************************************
4936 ***********************************************************************/
4938 /* Temporarily prevent garbage collection. */
4941 inhibit_garbage_collection (void)
4943 int count
= SPECPDL_INDEX ();
4945 specbind (Qgc_cons_threshold
, make_number (MOST_POSITIVE_FIXNUM
));
4950 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4951 doc
: /* Reclaim storage for Lisp objects no longer needed.
4952 Garbage collection happens automatically if you cons more than
4953 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4954 `garbage-collect' normally returns a list with info on amount of space in use:
4955 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4956 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4957 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4958 (USED-STRINGS . FREE-STRINGS))
4959 However, if there was overflow in pure space, `garbage-collect'
4960 returns nil, because real GC can't be done. */)
4963 register struct specbinding
*bind
;
4964 char stack_top_variable
;
4967 Lisp_Object total
[8];
4968 int count
= SPECPDL_INDEX ();
4969 EMACS_TIME t1
, t2
, t3
;
4974 /* Can't GC if pure storage overflowed because we can't determine
4975 if something is a pure object or not. */
4976 if (pure_bytes_used_before_overflow
)
4981 /* Don't keep undo information around forever.
4982 Do this early on, so it is no problem if the user quits. */
4984 register struct buffer
*nextb
= all_buffers
;
4988 /* If a buffer's undo list is Qt, that means that undo is
4989 turned off in that buffer. Calling truncate_undo_list on
4990 Qt tends to return NULL, which effectively turns undo back on.
4991 So don't call truncate_undo_list if undo_list is Qt. */
4992 if (! NILP (nextb
->BUFFER_INTERNAL_FIELD (name
)) && ! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
4993 truncate_undo_list (nextb
);
4995 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4996 if (nextb
->base_buffer
== 0 && !NILP (nextb
->BUFFER_INTERNAL_FIELD (name
))
4997 && ! nextb
->text
->inhibit_shrinking
)
4999 /* If a buffer's gap size is more than 10% of the buffer
5000 size, or larger than 2000 bytes, then shrink it
5001 accordingly. Keep a minimum size of 20 bytes. */
5002 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
5004 if (nextb
->text
->gap_size
> size
)
5006 struct buffer
*save_current
= current_buffer
;
5007 current_buffer
= nextb
;
5008 make_gap (-(nextb
->text
->gap_size
- size
));
5009 current_buffer
= save_current
;
5013 nextb
= nextb
->header
.next
.buffer
;
5017 EMACS_GET_TIME (t1
);
5019 /* In case user calls debug_print during GC,
5020 don't let that cause a recursive GC. */
5021 consing_since_gc
= 0;
5023 /* Save what's currently displayed in the echo area. */
5024 message_p
= push_message ();
5025 record_unwind_protect (pop_message_unwind
, Qnil
);
5027 /* Save a copy of the contents of the stack, for debugging. */
5028 #if MAX_SAVE_STACK > 0
5029 if (NILP (Vpurify_flag
))
5032 ptrdiff_t stack_size
;
5033 if (&stack_top_variable
< stack_bottom
)
5035 stack
= &stack_top_variable
;
5036 stack_size
= stack_bottom
- &stack_top_variable
;
5040 stack
= stack_bottom
;
5041 stack_size
= &stack_top_variable
- stack_bottom
;
5043 if (stack_size
<= MAX_SAVE_STACK
)
5045 if (stack_copy_size
< stack_size
)
5047 stack_copy
= (char *) xrealloc (stack_copy
, stack_size
);
5048 stack_copy_size
= stack_size
;
5050 memcpy (stack_copy
, stack
, stack_size
);
5053 #endif /* MAX_SAVE_STACK > 0 */
5055 if (garbage_collection_messages
)
5056 message1_nolog ("Garbage collecting...");
5060 shrink_regexp_cache ();
5064 /* clear_marks (); */
5066 /* Mark all the special slots that serve as the roots of accessibility. */
5068 for (i
= 0; i
< staticidx
; i
++)
5069 mark_object (*staticvec
[i
]);
5071 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
5073 mark_object (bind
->symbol
);
5074 mark_object (bind
->old_value
);
5082 extern void xg_mark_data (void);
5087 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5088 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5092 register struct gcpro
*tail
;
5093 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5094 for (i
= 0; i
< tail
->nvars
; i
++)
5095 mark_object (tail
->var
[i
]);
5099 struct catchtag
*catch;
5100 struct handler
*handler
;
5102 for (catch = catchlist
; catch; catch = catch->next
)
5104 mark_object (catch->tag
);
5105 mark_object (catch->val
);
5107 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5109 mark_object (handler
->handler
);
5110 mark_object (handler
->var
);
5116 #ifdef HAVE_WINDOW_SYSTEM
5117 mark_fringe_data ();
5120 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5124 /* Everything is now marked, except for the things that require special
5125 finalization, i.e. the undo_list.
5126 Look thru every buffer's undo list
5127 for elements that update markers that were not marked,
5130 register struct buffer
*nextb
= all_buffers
;
5134 /* If a buffer's undo list is Qt, that means that undo is
5135 turned off in that buffer. Calling truncate_undo_list on
5136 Qt tends to return NULL, which effectively turns undo back on.
5137 So don't call truncate_undo_list if undo_list is Qt. */
5138 if (! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
5140 Lisp_Object tail
, prev
;
5141 tail
= nextb
->BUFFER_INTERNAL_FIELD (undo_list
);
5143 while (CONSP (tail
))
5145 if (CONSP (XCAR (tail
))
5146 && MARKERP (XCAR (XCAR (tail
)))
5147 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5150 nextb
->BUFFER_INTERNAL_FIELD (undo_list
) = tail
= XCDR (tail
);
5154 XSETCDR (prev
, tail
);
5164 /* Now that we have stripped the elements that need not be in the
5165 undo_list any more, we can finally mark the list. */
5166 mark_object (nextb
->BUFFER_INTERNAL_FIELD (undo_list
));
5168 nextb
= nextb
->header
.next
.buffer
;
5174 /* Clear the mark bits that we set in certain root slots. */
5176 unmark_byte_stack ();
5177 VECTOR_UNMARK (&buffer_defaults
);
5178 VECTOR_UNMARK (&buffer_local_symbols
);
5180 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5188 /* clear_marks (); */
5191 consing_since_gc
= 0;
5192 if (gc_cons_threshold
< 10000)
5193 gc_cons_threshold
= 10000;
5195 gc_relative_threshold
= 0;
5196 if (FLOATP (Vgc_cons_percentage
))
5197 { /* Set gc_cons_combined_threshold. */
5200 tot
+= total_conses
* sizeof (struct Lisp_Cons
);
5201 tot
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5202 tot
+= total_markers
* sizeof (union Lisp_Misc
);
5203 tot
+= total_string_size
;
5204 tot
+= total_vector_size
* sizeof (Lisp_Object
);
5205 tot
+= total_floats
* sizeof (struct Lisp_Float
);
5206 tot
+= total_intervals
* sizeof (struct interval
);
5207 tot
+= total_strings
* sizeof (struct Lisp_String
);
5209 tot
*= XFLOAT_DATA (Vgc_cons_percentage
);
5212 if (tot
< TYPE_MAXIMUM (EMACS_INT
))
5213 gc_relative_threshold
= tot
;
5215 gc_relative_threshold
= TYPE_MAXIMUM (EMACS_INT
);
5219 if (garbage_collection_messages
)
5221 if (message_p
|| minibuf_level
> 0)
5224 message1_nolog ("Garbage collecting...done");
5227 unbind_to (count
, Qnil
);
5229 total
[0] = Fcons (make_number (total_conses
),
5230 make_number (total_free_conses
));
5231 total
[1] = Fcons (make_number (total_symbols
),
5232 make_number (total_free_symbols
));
5233 total
[2] = Fcons (make_number (total_markers
),
5234 make_number (total_free_markers
));
5235 total
[3] = make_number (total_string_size
);
5236 total
[4] = make_number (total_vector_size
);
5237 total
[5] = Fcons (make_number (total_floats
),
5238 make_number (total_free_floats
));
5239 total
[6] = Fcons (make_number (total_intervals
),
5240 make_number (total_free_intervals
));
5241 total
[7] = Fcons (make_number (total_strings
),
5242 make_number (total_free_strings
));
5244 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5246 /* Compute average percentage of zombies. */
5249 for (i
= 0; i
< 7; ++i
)
5250 if (CONSP (total
[i
]))
5251 nlive
+= XFASTINT (XCAR (total
[i
]));
5253 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5254 max_live
= max (nlive
, max_live
);
5255 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5256 max_zombies
= max (nzombies
, max_zombies
);
5261 if (!NILP (Vpost_gc_hook
))
5263 int gc_count
= inhibit_garbage_collection ();
5264 safe_run_hooks (Qpost_gc_hook
);
5265 unbind_to (gc_count
, Qnil
);
5268 /* Accumulate statistics. */
5269 EMACS_GET_TIME (t2
);
5270 EMACS_SUB_TIME (t3
, t2
, t1
);
5271 if (FLOATP (Vgc_elapsed
))
5272 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5274 EMACS_USECS (t3
) * 1.0e-6);
5277 return Flist (sizeof total
/ sizeof *total
, total
);
5281 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5282 only interesting objects referenced from glyphs are strings. */
5285 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5287 struct glyph_row
*row
= matrix
->rows
;
5288 struct glyph_row
*end
= row
+ matrix
->nrows
;
5290 for (; row
< end
; ++row
)
5294 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5296 struct glyph
*glyph
= row
->glyphs
[area
];
5297 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5299 for (; glyph
< end_glyph
; ++glyph
)
5300 if (STRINGP (glyph
->object
)
5301 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5302 mark_object (glyph
->object
);
5308 /* Mark Lisp faces in the face cache C. */
5311 mark_face_cache (struct face_cache
*c
)
5316 for (i
= 0; i
< c
->used
; ++i
)
5318 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5322 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5323 mark_object (face
->lface
[j
]);
5331 /* Mark reference to a Lisp_Object.
5332 If the object referred to has not been seen yet, recursively mark
5333 all the references contained in it. */
5335 #define LAST_MARKED_SIZE 500
5336 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5337 static int last_marked_index
;
5339 /* For debugging--call abort when we cdr down this many
5340 links of a list, in mark_object. In debugging,
5341 the call to abort will hit a breakpoint.
5342 Normally this is zero and the check never goes off. */
5343 ptrdiff_t mark_object_loop_halt EXTERNALLY_VISIBLE
;
5346 mark_vectorlike (struct Lisp_Vector
*ptr
)
5348 EMACS_INT size
= ptr
->header
.size
;
5351 eassert (!VECTOR_MARKED_P (ptr
));
5352 VECTOR_MARK (ptr
); /* Else mark it */
5353 if (size
& PSEUDOVECTOR_FLAG
)
5354 size
&= PSEUDOVECTOR_SIZE_MASK
;
5356 /* Note that this size is not the memory-footprint size, but only
5357 the number of Lisp_Object fields that we should trace.
5358 The distinction is used e.g. by Lisp_Process which places extra
5359 non-Lisp_Object fields at the end of the structure. */
5360 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5361 mark_object (ptr
->contents
[i
]);
5364 /* Like mark_vectorlike but optimized for char-tables (and
5365 sub-char-tables) assuming that the contents are mostly integers or
5369 mark_char_table (struct Lisp_Vector
*ptr
)
5371 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5374 eassert (!VECTOR_MARKED_P (ptr
));
5376 for (i
= 0; i
< size
; i
++)
5378 Lisp_Object val
= ptr
->contents
[i
];
5380 if (INTEGERP (val
) || (SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
))
5382 if (SUB_CHAR_TABLE_P (val
))
5384 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5385 mark_char_table (XVECTOR (val
));
5393 mark_object (Lisp_Object arg
)
5395 register Lisp_Object obj
= arg
;
5396 #ifdef GC_CHECK_MARKED_OBJECTS
5400 ptrdiff_t cdr_count
= 0;
5404 if (PURE_POINTER_P (XPNTR (obj
)))
5407 last_marked
[last_marked_index
++] = obj
;
5408 if (last_marked_index
== LAST_MARKED_SIZE
)
5409 last_marked_index
= 0;
5411 /* Perform some sanity checks on the objects marked here. Abort if
5412 we encounter an object we know is bogus. This increases GC time
5413 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5414 #ifdef GC_CHECK_MARKED_OBJECTS
5416 po
= (void *) XPNTR (obj
);
5418 /* Check that the object pointed to by PO is known to be a Lisp
5419 structure allocated from the heap. */
5420 #define CHECK_ALLOCATED() \
5422 m = mem_find (po); \
5427 /* Check that the object pointed to by PO is live, using predicate
5429 #define CHECK_LIVE(LIVEP) \
5431 if (!LIVEP (m, po)) \
5435 /* Check both of the above conditions. */
5436 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5438 CHECK_ALLOCATED (); \
5439 CHECK_LIVE (LIVEP); \
5442 #else /* not GC_CHECK_MARKED_OBJECTS */
5444 #define CHECK_LIVE(LIVEP) (void) 0
5445 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5447 #endif /* not GC_CHECK_MARKED_OBJECTS */
5449 switch (SWITCH_ENUM_CAST (XTYPE (obj
)))
5453 register struct Lisp_String
*ptr
= XSTRING (obj
);
5454 if (STRING_MARKED_P (ptr
))
5456 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5457 MARK_INTERVAL_TREE (ptr
->intervals
);
5459 #ifdef GC_CHECK_STRING_BYTES
5460 /* Check that the string size recorded in the string is the
5461 same as the one recorded in the sdata structure. */
5462 CHECK_STRING_BYTES (ptr
);
5463 #endif /* GC_CHECK_STRING_BYTES */
5467 case Lisp_Vectorlike
:
5468 if (VECTOR_MARKED_P (XVECTOR (obj
)))
5470 #ifdef GC_CHECK_MARKED_OBJECTS
5472 if (m
== MEM_NIL
&& !SUBRP (obj
)
5473 && po
!= &buffer_defaults
5474 && po
!= &buffer_local_symbols
)
5476 #endif /* GC_CHECK_MARKED_OBJECTS */
5480 #ifdef GC_CHECK_MARKED_OBJECTS
5481 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5484 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->header
.next
.buffer
)
5489 #endif /* GC_CHECK_MARKED_OBJECTS */
5492 else if (SUBRP (obj
))
5494 else if (COMPILEDP (obj
))
5495 /* We could treat this just like a vector, but it is better to
5496 save the COMPILED_CONSTANTS element for last and avoid
5499 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5500 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5503 CHECK_LIVE (live_vector_p
);
5504 VECTOR_MARK (ptr
); /* Else mark it */
5505 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5507 if (i
!= COMPILED_CONSTANTS
)
5508 mark_object (ptr
->contents
[i
]);
5510 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5513 else if (FRAMEP (obj
))
5515 register struct frame
*ptr
= XFRAME (obj
);
5516 mark_vectorlike (XVECTOR (obj
));
5517 mark_face_cache (ptr
->face_cache
);
5519 else if (WINDOWP (obj
))
5521 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5522 struct window
*w
= XWINDOW (obj
);
5523 mark_vectorlike (ptr
);
5524 /* Mark glyphs for leaf windows. Marking window matrices is
5525 sufficient because frame matrices use the same glyph
5527 if (NILP (w
->hchild
)
5529 && w
->current_matrix
)
5531 mark_glyph_matrix (w
->current_matrix
);
5532 mark_glyph_matrix (w
->desired_matrix
);
5535 else if (HASH_TABLE_P (obj
))
5537 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5538 mark_vectorlike ((struct Lisp_Vector
*)h
);
5539 /* If hash table is not weak, mark all keys and values.
5540 For weak tables, mark only the vector. */
5542 mark_object (h
->key_and_value
);
5544 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5546 else if (CHAR_TABLE_P (obj
))
5547 mark_char_table (XVECTOR (obj
));
5549 mark_vectorlike (XVECTOR (obj
));
5554 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5555 struct Lisp_Symbol
*ptrx
;
5559 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5561 mark_object (ptr
->function
);
5562 mark_object (ptr
->plist
);
5563 switch (ptr
->redirect
)
5565 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
5566 case SYMBOL_VARALIAS
:
5569 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
5573 case SYMBOL_LOCALIZED
:
5575 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
5576 /* If the value is forwarded to a buffer or keyboard field,
5577 these are marked when we see the corresponding object.
5578 And if it's forwarded to a C variable, either it's not
5579 a Lisp_Object var, or it's staticpro'd already. */
5580 mark_object (blv
->where
);
5581 mark_object (blv
->valcell
);
5582 mark_object (blv
->defcell
);
5585 case SYMBOL_FORWARDED
:
5586 /* If the value is forwarded to a buffer or keyboard field,
5587 these are marked when we see the corresponding object.
5588 And if it's forwarded to a C variable, either it's not
5589 a Lisp_Object var, or it's staticpro'd already. */
5593 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5594 MARK_STRING (XSTRING (ptr
->xname
));
5595 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5600 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5601 XSETSYMBOL (obj
, ptrx
);
5608 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5609 if (XMISCANY (obj
)->gcmarkbit
)
5611 XMISCANY (obj
)->gcmarkbit
= 1;
5613 switch (XMISCTYPE (obj
))
5616 case Lisp_Misc_Marker
:
5617 /* DO NOT mark thru the marker's chain.
5618 The buffer's markers chain does not preserve markers from gc;
5619 instead, markers are removed from the chain when freed by gc. */
5622 case Lisp_Misc_Save_Value
:
5625 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5626 /* If DOGC is set, POINTER is the address of a memory
5627 area containing INTEGER potential Lisp_Objects. */
5630 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5632 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5633 mark_maybe_object (*p
);
5639 case Lisp_Misc_Overlay
:
5641 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5642 mark_object (ptr
->start
);
5643 mark_object (ptr
->end
);
5644 mark_object (ptr
->plist
);
5647 XSETMISC (obj
, ptr
->next
);
5660 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5661 if (CONS_MARKED_P (ptr
))
5663 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5665 /* If the cdr is nil, avoid recursion for the car. */
5666 if (EQ (ptr
->u
.cdr
, Qnil
))
5672 mark_object (ptr
->car
);
5675 if (cdr_count
== mark_object_loop_halt
)
5681 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5682 FLOAT_MARK (XFLOAT (obj
));
5693 #undef CHECK_ALLOCATED
5694 #undef CHECK_ALLOCATED_AND_LIVE
5697 /* Mark the pointers in a buffer structure. */
5700 mark_buffer (Lisp_Object buf
)
5702 register struct buffer
*buffer
= XBUFFER (buf
);
5703 register Lisp_Object
*ptr
, tmp
;
5704 Lisp_Object base_buffer
;
5706 eassert (!VECTOR_MARKED_P (buffer
));
5707 VECTOR_MARK (buffer
);
5709 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5711 /* For now, we just don't mark the undo_list. It's done later in
5712 a special way just before the sweep phase, and after stripping
5713 some of its elements that are not needed any more. */
5715 if (buffer
->overlays_before
)
5717 XSETMISC (tmp
, buffer
->overlays_before
);
5720 if (buffer
->overlays_after
)
5722 XSETMISC (tmp
, buffer
->overlays_after
);
5726 /* buffer-local Lisp variables start at `undo_list',
5727 tho only the ones from `name' on are GC'd normally. */
5728 for (ptr
= &buffer
->BUFFER_INTERNAL_FIELD (name
);
5729 ptr
<= &PER_BUFFER_VALUE (buffer
,
5730 PER_BUFFER_VAR_OFFSET (LAST_FIELD_PER_BUFFER
));
5734 /* If this is an indirect buffer, mark its base buffer. */
5735 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5737 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5738 mark_buffer (base_buffer
);
5742 /* Mark the Lisp pointers in the terminal objects.
5743 Called by the Fgarbage_collector. */
5746 mark_terminals (void)
5749 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5751 eassert (t
->name
!= NULL
);
5752 #ifdef HAVE_WINDOW_SYSTEM
5753 /* If a terminal object is reachable from a stacpro'ed object,
5754 it might have been marked already. Make sure the image cache
5756 mark_image_cache (t
->image_cache
);
5757 #endif /* HAVE_WINDOW_SYSTEM */
5758 if (!VECTOR_MARKED_P (t
))
5759 mark_vectorlike ((struct Lisp_Vector
*)t
);
5765 /* Value is non-zero if OBJ will survive the current GC because it's
5766 either marked or does not need to be marked to survive. */
5769 survives_gc_p (Lisp_Object obj
)
5773 switch (XTYPE (obj
))
5780 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5784 survives_p
= XMISCANY (obj
)->gcmarkbit
;
5788 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5791 case Lisp_Vectorlike
:
5792 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5796 survives_p
= CONS_MARKED_P (XCONS (obj
));
5800 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5807 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5812 /* Sweep: find all structures not marked, and free them. */
5817 /* Remove or mark entries in weak hash tables.
5818 This must be done before any object is unmarked. */
5819 sweep_weak_hash_tables ();
5822 #ifdef GC_CHECK_STRING_BYTES
5823 if (!noninteractive
)
5824 check_string_bytes (1);
5827 /* Put all unmarked conses on free list */
5829 register struct cons_block
*cblk
;
5830 struct cons_block
**cprev
= &cons_block
;
5831 register int lim
= cons_block_index
;
5832 EMACS_INT num_free
= 0, num_used
= 0;
5836 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5840 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
5842 /* Scan the mark bits an int at a time. */
5843 for (i
= 0; i
< ilim
; i
++)
5845 if (cblk
->gcmarkbits
[i
] == -1)
5847 /* Fast path - all cons cells for this int are marked. */
5848 cblk
->gcmarkbits
[i
] = 0;
5849 num_used
+= BITS_PER_INT
;
5853 /* Some cons cells for this int are not marked.
5854 Find which ones, and free them. */
5855 int start
, pos
, stop
;
5857 start
= i
* BITS_PER_INT
;
5859 if (stop
> BITS_PER_INT
)
5860 stop
= BITS_PER_INT
;
5863 for (pos
= start
; pos
< stop
; pos
++)
5865 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
5868 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
5869 cons_free_list
= &cblk
->conses
[pos
];
5871 cons_free_list
->car
= Vdead
;
5877 CONS_UNMARK (&cblk
->conses
[pos
]);
5883 lim
= CONS_BLOCK_SIZE
;
5884 /* If this block contains only free conses and we have already
5885 seen more than two blocks worth of free conses then deallocate
5887 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5889 *cprev
= cblk
->next
;
5890 /* Unhook from the free list. */
5891 cons_free_list
= cblk
->conses
[0].u
.chain
;
5892 lisp_align_free (cblk
);
5896 num_free
+= this_free
;
5897 cprev
= &cblk
->next
;
5900 total_conses
= num_used
;
5901 total_free_conses
= num_free
;
5904 /* Put all unmarked floats on free list */
5906 register struct float_block
*fblk
;
5907 struct float_block
**fprev
= &float_block
;
5908 register int lim
= float_block_index
;
5909 EMACS_INT num_free
= 0, num_used
= 0;
5911 float_free_list
= 0;
5913 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5917 for (i
= 0; i
< lim
; i
++)
5918 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5921 fblk
->floats
[i
].u
.chain
= float_free_list
;
5922 float_free_list
= &fblk
->floats
[i
];
5927 FLOAT_UNMARK (&fblk
->floats
[i
]);
5929 lim
= FLOAT_BLOCK_SIZE
;
5930 /* If this block contains only free floats and we have already
5931 seen more than two blocks worth of free floats then deallocate
5933 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5935 *fprev
= fblk
->next
;
5936 /* Unhook from the free list. */
5937 float_free_list
= fblk
->floats
[0].u
.chain
;
5938 lisp_align_free (fblk
);
5942 num_free
+= this_free
;
5943 fprev
= &fblk
->next
;
5946 total_floats
= num_used
;
5947 total_free_floats
= num_free
;
5950 /* Put all unmarked intervals on free list */
5952 register struct interval_block
*iblk
;
5953 struct interval_block
**iprev
= &interval_block
;
5954 register int lim
= interval_block_index
;
5955 EMACS_INT num_free
= 0, num_used
= 0;
5957 interval_free_list
= 0;
5959 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5964 for (i
= 0; i
< lim
; i
++)
5966 if (!iblk
->intervals
[i
].gcmarkbit
)
5968 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5969 interval_free_list
= &iblk
->intervals
[i
];
5975 iblk
->intervals
[i
].gcmarkbit
= 0;
5978 lim
= INTERVAL_BLOCK_SIZE
;
5979 /* If this block contains only free intervals and we have already
5980 seen more than two blocks worth of free intervals then
5981 deallocate this block. */
5982 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5984 *iprev
= iblk
->next
;
5985 /* Unhook from the free list. */
5986 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5991 num_free
+= this_free
;
5992 iprev
= &iblk
->next
;
5995 total_intervals
= num_used
;
5996 total_free_intervals
= num_free
;
5999 /* Put all unmarked symbols on free list */
6001 register struct symbol_block
*sblk
;
6002 struct symbol_block
**sprev
= &symbol_block
;
6003 register int lim
= symbol_block_index
;
6004 EMACS_INT num_free
= 0, num_used
= 0;
6006 symbol_free_list
= NULL
;
6008 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
6011 struct Lisp_Symbol
*sym
= sblk
->symbols
;
6012 struct Lisp_Symbol
*end
= sym
+ lim
;
6014 for (; sym
< end
; ++sym
)
6016 /* Check if the symbol was created during loadup. In such a case
6017 it might be pointed to by pure bytecode which we don't trace,
6018 so we conservatively assume that it is live. */
6019 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
6021 if (!sym
->gcmarkbit
&& !pure_p
)
6023 if (sym
->redirect
== SYMBOL_LOCALIZED
)
6024 xfree (SYMBOL_BLV (sym
));
6025 sym
->next
= symbol_free_list
;
6026 symbol_free_list
= sym
;
6028 symbol_free_list
->function
= Vdead
;
6036 UNMARK_STRING (XSTRING (sym
->xname
));
6041 lim
= SYMBOL_BLOCK_SIZE
;
6042 /* If this block contains only free symbols and we have already
6043 seen more than two blocks worth of free symbols then deallocate
6045 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6047 *sprev
= sblk
->next
;
6048 /* Unhook from the free list. */
6049 symbol_free_list
= sblk
->symbols
[0].next
;
6054 num_free
+= this_free
;
6055 sprev
= &sblk
->next
;
6058 total_symbols
= num_used
;
6059 total_free_symbols
= num_free
;
6062 /* Put all unmarked misc's on free list.
6063 For a marker, first unchain it from the buffer it points into. */
6065 register struct marker_block
*mblk
;
6066 struct marker_block
**mprev
= &marker_block
;
6067 register int lim
= marker_block_index
;
6068 EMACS_INT num_free
= 0, num_used
= 0;
6070 marker_free_list
= 0;
6072 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6077 for (i
= 0; i
< lim
; i
++)
6079 if (!mblk
->markers
[i
].u_any
.gcmarkbit
)
6081 if (mblk
->markers
[i
].u_any
.type
== Lisp_Misc_Marker
)
6082 unchain_marker (&mblk
->markers
[i
].u_marker
);
6083 /* Set the type of the freed object to Lisp_Misc_Free.
6084 We could leave the type alone, since nobody checks it,
6085 but this might catch bugs faster. */
6086 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
6087 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
6088 marker_free_list
= &mblk
->markers
[i
];
6094 mblk
->markers
[i
].u_any
.gcmarkbit
= 0;
6097 lim
= MARKER_BLOCK_SIZE
;
6098 /* If this block contains only free markers and we have already
6099 seen more than two blocks worth of free markers then deallocate
6101 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6103 *mprev
= mblk
->next
;
6104 /* Unhook from the free list. */
6105 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
6110 num_free
+= this_free
;
6111 mprev
= &mblk
->next
;
6115 total_markers
= num_used
;
6116 total_free_markers
= num_free
;
6119 /* Free all unmarked buffers */
6121 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6124 if (!VECTOR_MARKED_P (buffer
))
6127 prev
->header
.next
= buffer
->header
.next
;
6129 all_buffers
= buffer
->header
.next
.buffer
;
6130 next
= buffer
->header
.next
.buffer
;
6136 VECTOR_UNMARK (buffer
);
6137 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6138 prev
= buffer
, buffer
= buffer
->header
.next
.buffer
;
6142 /* Free all unmarked vectors */
6144 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6145 total_vector_size
= 0;
6148 if (!VECTOR_MARKED_P (vector
))
6151 prev
->header
.next
= vector
->header
.next
;
6153 all_vectors
= vector
->header
.next
.vector
;
6154 next
= vector
->header
.next
.vector
;
6161 VECTOR_UNMARK (vector
);
6162 if (vector
->header
.size
& PSEUDOVECTOR_FLAG
)
6163 total_vector_size
+= PSEUDOVECTOR_SIZE_MASK
& vector
->header
.size
;
6165 total_vector_size
+= vector
->header
.size
;
6166 prev
= vector
, vector
= vector
->header
.next
.vector
;
6170 #ifdef GC_CHECK_STRING_BYTES
6171 if (!noninteractive
)
6172 check_string_bytes (1);
6179 /* Debugging aids. */
6181 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6182 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6183 This may be helpful in debugging Emacs's memory usage.
6184 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6189 XSETINT (end
, (intptr_t) (char *) sbrk (0) / 1024);
6194 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6195 doc
: /* Return a list of counters that measure how much consing there has been.
6196 Each of these counters increments for a certain kind of object.
6197 The counters wrap around from the largest positive integer to zero.
6198 Garbage collection does not decrease them.
6199 The elements of the value are as follows:
6200 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6201 All are in units of 1 = one object consed
6202 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6204 MISCS include overlays, markers, and some internal types.
6205 Frames, windows, buffers, and subprocesses count as vectors
6206 (but the contents of a buffer's text do not count here). */)
6209 Lisp_Object consed
[8];
6211 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6212 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6213 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6214 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6215 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6216 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6217 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6218 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6220 return Flist (8, consed
);
6223 #ifdef ENABLE_CHECKING
6224 int suppress_checking
;
6227 die (const char *msg
, const char *file
, int line
)
6229 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6235 /* Initialization */
6238 init_alloc_once (void)
6240 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6242 pure_size
= PURESIZE
;
6243 pure_bytes_used
= 0;
6244 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6245 pure_bytes_used_before_overflow
= 0;
6247 /* Initialize the list of free aligned blocks. */
6250 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6252 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6256 ignore_warnings
= 1;
6257 #ifdef DOUG_LEA_MALLOC
6258 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6259 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6260 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6268 init_weak_hash_tables ();
6271 malloc_hysteresis
= 32;
6273 malloc_hysteresis
= 0;
6276 refill_memory_reserve ();
6278 ignore_warnings
= 0;
6280 byte_stack_list
= 0;
6282 consing_since_gc
= 0;
6283 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6284 gc_relative_threshold
= 0;
6291 byte_stack_list
= 0;
6293 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6294 setjmp_tested_p
= longjmps_done
= 0;
6297 Vgc_elapsed
= make_float (0.0);
6302 syms_of_alloc (void)
6304 DEFVAR_INT ("gc-cons-threshold", gc_cons_threshold
,
6305 doc
: /* *Number of bytes of consing between garbage collections.
6306 Garbage collection can happen automatically once this many bytes have been
6307 allocated since the last garbage collection. All data types count.
6309 Garbage collection happens automatically only when `eval' is called.
6311 By binding this temporarily to a large number, you can effectively
6312 prevent garbage collection during a part of the program.
6313 See also `gc-cons-percentage'. */);
6315 DEFVAR_LISP ("gc-cons-percentage", Vgc_cons_percentage
,
6316 doc
: /* *Portion of the heap used for allocation.
6317 Garbage collection can happen automatically once this portion of the heap
6318 has been allocated since the last garbage collection.
6319 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6320 Vgc_cons_percentage
= make_float (0.1);
6322 DEFVAR_INT ("pure-bytes-used", pure_bytes_used
,
6323 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6325 DEFVAR_INT ("cons-cells-consed", cons_cells_consed
,
6326 doc
: /* Number of cons cells that have been consed so far. */);
6328 DEFVAR_INT ("floats-consed", floats_consed
,
6329 doc
: /* Number of floats that have been consed so far. */);
6331 DEFVAR_INT ("vector-cells-consed", vector_cells_consed
,
6332 doc
: /* Number of vector cells that have been consed so far. */);
6334 DEFVAR_INT ("symbols-consed", symbols_consed
,
6335 doc
: /* Number of symbols that have been consed so far. */);
6337 DEFVAR_INT ("string-chars-consed", string_chars_consed
,
6338 doc
: /* Number of string characters that have been consed so far. */);
6340 DEFVAR_INT ("misc-objects-consed", misc_objects_consed
,
6341 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6343 DEFVAR_INT ("intervals-consed", intervals_consed
,
6344 doc
: /* Number of intervals that have been consed so far. */);
6346 DEFVAR_INT ("strings-consed", strings_consed
,
6347 doc
: /* Number of strings that have been consed so far. */);
6349 DEFVAR_LISP ("purify-flag", Vpurify_flag
,
6350 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6351 This means that certain objects should be allocated in shared (pure) space.
6352 It can also be set to a hash-table, in which case this table is used to
6353 do hash-consing of the objects allocated to pure space. */);
6355 DEFVAR_BOOL ("garbage-collection-messages", garbage_collection_messages
,
6356 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6357 garbage_collection_messages
= 0;
6359 DEFVAR_LISP ("post-gc-hook", Vpost_gc_hook
,
6360 doc
: /* Hook run after garbage collection has finished. */);
6361 Vpost_gc_hook
= Qnil
;
6362 DEFSYM (Qpost_gc_hook
, "post-gc-hook");
6364 DEFVAR_LISP ("memory-signal-data", Vmemory_signal_data
,
6365 doc
: /* Precomputed `signal' argument for memory-full error. */);
6366 /* We build this in advance because if we wait until we need it, we might
6367 not be able to allocate the memory to hold it. */
6369 = pure_cons (Qerror
,
6370 pure_cons (make_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"), Qnil
));
6372 DEFVAR_LISP ("memory-full", Vmemory_full
,
6373 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6374 Vmemory_full
= Qnil
;
6376 DEFSYM (Qgc_cons_threshold
, "gc-cons-threshold");
6377 DEFSYM (Qchar_table_extra_slots
, "char-table-extra-slots");
6379 DEFVAR_LISP ("gc-elapsed", Vgc_elapsed
,
6380 doc
: /* Accumulated time elapsed in garbage collections.
6381 The time is in seconds as a floating point value. */);
6382 DEFVAR_INT ("gcs-done", gcs_done
,
6383 doc
: /* Accumulated number of garbage collections done. */);
6388 defsubr (&Smake_byte_code
);
6389 defsubr (&Smake_list
);
6390 defsubr (&Smake_vector
);
6391 defsubr (&Smake_string
);
6392 defsubr (&Smake_bool_vector
);
6393 defsubr (&Smake_symbol
);
6394 defsubr (&Smake_marker
);
6395 defsubr (&Spurecopy
);
6396 defsubr (&Sgarbage_collect
);
6397 defsubr (&Smemory_limit
);
6398 defsubr (&Smemory_use_counts
);
6400 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6401 defsubr (&Sgc_status
);