1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
2 Copyright (C) 1985, 1986, 1988, 1993, 1994, 1995, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003, 2004, 2005 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 2, or (at your option)
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; see the file COPYING. If not, write to
19 the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
20 Boston, MA 02110-1301, USA. */
24 #include <limits.h> /* For CHAR_BIT. */
30 /* Note that this declares bzero on OSF/1. How dumb. */
34 #ifdef HAVE_GTK_AND_PTHREAD
38 /* This file is part of the core Lisp implementation, and thus must
39 deal with the real data structures. If the Lisp implementation is
40 replaced, this file likely will not be used. */
42 #undef HIDE_LISP_IMPLEMENTATION
45 #include "intervals.h"
51 #include "blockinput.h"
53 #include "syssignal.h"
56 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
57 memory. Can do this only if using gmalloc.c. */
59 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
60 #undef GC_MALLOC_CHECK
66 extern POINTER_TYPE
*sbrk ();
69 #ifdef DOUG_LEA_MALLOC
72 /* malloc.h #defines this as size_t, at least in glibc2. */
73 #ifndef __malloc_size_t
74 #define __malloc_size_t int
77 /* Specify maximum number of areas to mmap. It would be nice to use a
78 value that explicitly means "no limit". */
80 #define MMAP_MAX_AREAS 100000000
82 #else /* not DOUG_LEA_MALLOC */
84 /* The following come from gmalloc.c. */
86 #define __malloc_size_t size_t
87 extern __malloc_size_t _bytes_used
;
88 extern __malloc_size_t __malloc_extra_blocks
;
90 #endif /* not DOUG_LEA_MALLOC */
92 #if ! defined (SYSTEM_MALLOC) && defined (HAVE_GTK_AND_PTHREAD)
94 /* When GTK uses the file chooser dialog, different backends can be loaded
95 dynamically. One such a backend is the Gnome VFS backend that gets loaded
96 if you run Gnome. That backend creates several threads and also allocates
99 If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_*
100 functions below are called from malloc, there is a chance that one
101 of these threads preempts the Emacs main thread and the hook variables
102 end up in an inconsistent state. So we have a mutex to prevent that (note
103 that the backend handles concurrent access to malloc within its own threads
104 but Emacs code running in the main thread is not included in that control).
106 When UNBLOCK_INPUT is called, reinvoke_input_signal may be called. If this
107 happens in one of the backend threads we will have two threads that tries
108 to run Emacs code at once, and the code is not prepared for that.
109 To prevent that, we only call BLOCK/UNBLOCK from the main thread. */
111 static pthread_mutex_t alloc_mutex
;
113 #define BLOCK_INPUT_ALLOC \
116 pthread_mutex_lock (&alloc_mutex); \
117 if (pthread_self () == main_thread) \
121 #define UNBLOCK_INPUT_ALLOC \
124 if (pthread_self () == main_thread) \
126 pthread_mutex_unlock (&alloc_mutex); \
130 #else /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
132 #define BLOCK_INPUT_ALLOC BLOCK_INPUT
133 #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT
135 #endif /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
137 /* Value of _bytes_used, when spare_memory was freed. */
139 static __malloc_size_t bytes_used_when_full
;
141 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
142 to a struct Lisp_String. */
144 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
145 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
146 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
148 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
149 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
150 #define VECTOR_MARKED_P(V) (((V)->size & ARRAY_MARK_FLAG) != 0)
152 /* Value is the number of bytes/chars of S, a pointer to a struct
153 Lisp_String. This must be used instead of STRING_BYTES (S) or
154 S->size during GC, because S->size contains the mark bit for
157 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
158 #define GC_STRING_CHARS(S) ((S)->size & ~ARRAY_MARK_FLAG)
160 /* Number of bytes of consing done since the last gc. */
162 int consing_since_gc
;
164 /* Count the amount of consing of various sorts of space. */
166 EMACS_INT cons_cells_consed
;
167 EMACS_INT floats_consed
;
168 EMACS_INT vector_cells_consed
;
169 EMACS_INT symbols_consed
;
170 EMACS_INT string_chars_consed
;
171 EMACS_INT misc_objects_consed
;
172 EMACS_INT intervals_consed
;
173 EMACS_INT strings_consed
;
175 /* Number of bytes of consing since GC before another GC should be done. */
177 static EMACS_INT gc_cons_threshold
;
178 EMACS_INT gc_cons_combined_threshold
;
179 static Lisp_Object Vgc_cons_percentage
;
181 /* Nonzero during GC. */
185 /* Nonzero means abort if try to GC.
186 This is for code which is written on the assumption that
187 no GC will happen, so as to verify that assumption. */
191 /* Nonzero means display messages at beginning and end of GC. */
193 int garbage_collection_messages
;
195 #ifndef VIRT_ADDR_VARIES
197 #endif /* VIRT_ADDR_VARIES */
198 int malloc_sbrk_used
;
200 #ifndef VIRT_ADDR_VARIES
202 #endif /* VIRT_ADDR_VARIES */
203 int malloc_sbrk_unused
;
205 /* Number of live and free conses etc. */
207 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
208 static int total_free_conses
, total_free_markers
, total_free_symbols
;
209 static int total_free_floats
, total_floats
;
211 /* Points to memory space allocated as "spare", to be freed if we run
214 static char *spare_memory
;
216 /* Amount of spare memory to keep in reserve. */
218 #define SPARE_MEMORY (1 << 14)
220 /* Number of extra blocks malloc should get when it needs more core. */
222 static int malloc_hysteresis
;
224 /* Non-nil means defun should do purecopy on the function definition. */
226 Lisp_Object Vpurify_flag
;
228 /* Non-nil means we are handling a memory-full error. */
230 Lisp_Object Vmemory_full
;
234 /* Initialize it to a nonzero value to force it into data space
235 (rather than bss space). That way unexec will remap it into text
236 space (pure), on some systems. We have not implemented the
237 remapping on more recent systems because this is less important
238 nowadays than in the days of small memories and timesharing. */
240 EMACS_INT pure
[PURESIZE
/ sizeof (EMACS_INT
)] = {1,};
241 #define PUREBEG (char *) pure
245 #define pure PURE_SEG_BITS /* Use shared memory segment */
246 #define PUREBEG (char *)PURE_SEG_BITS
248 #endif /* HAVE_SHM */
250 /* Pointer to the pure area, and its size. */
252 static char *purebeg
;
253 static size_t pure_size
;
255 /* Number of bytes of pure storage used before pure storage overflowed.
256 If this is non-zero, this implies that an overflow occurred. */
258 static size_t pure_bytes_used_before_overflow
;
260 /* Value is non-zero if P points into pure space. */
262 #define PURE_POINTER_P(P) \
263 (((PNTR_COMPARISON_TYPE) (P) \
264 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
265 && ((PNTR_COMPARISON_TYPE) (P) \
266 >= (PNTR_COMPARISON_TYPE) purebeg))
268 /* Index in pure at which next pure object will be allocated.. */
270 EMACS_INT pure_bytes_used
;
272 /* If nonzero, this is a warning delivered by malloc and not yet
275 char *pending_malloc_warning
;
277 /* Pre-computed signal argument for use when memory is exhausted. */
279 Lisp_Object Vmemory_signal_data
;
281 /* Maximum amount of C stack to save when a GC happens. */
283 #ifndef MAX_SAVE_STACK
284 #define MAX_SAVE_STACK 16000
287 /* Buffer in which we save a copy of the C stack at each GC. */
292 /* Non-zero means ignore malloc warnings. Set during initialization.
293 Currently not used. */
297 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
299 /* Hook run after GC has finished. */
301 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
303 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
304 EMACS_INT gcs_done
; /* accumulated GCs */
306 static void mark_buffer
P_ ((Lisp_Object
));
307 extern void mark_kboards
P_ ((void));
308 extern void mark_backtrace
P_ ((void));
309 static void gc_sweep
P_ ((void));
310 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
311 static void mark_face_cache
P_ ((struct face_cache
*));
313 #ifdef HAVE_WINDOW_SYSTEM
314 extern void mark_fringe_data
P_ ((void));
315 static void mark_image
P_ ((struct image
*));
316 static void mark_image_cache
P_ ((struct frame
*));
317 #endif /* HAVE_WINDOW_SYSTEM */
319 static struct Lisp_String
*allocate_string
P_ ((void));
320 static void compact_small_strings
P_ ((void));
321 static void free_large_strings
P_ ((void));
322 static void sweep_strings
P_ ((void));
324 extern int message_enable_multibyte
;
326 /* When scanning the C stack for live Lisp objects, Emacs keeps track
327 of what memory allocated via lisp_malloc is intended for what
328 purpose. This enumeration specifies the type of memory. */
339 /* Keep the following vector-like types together, with
340 MEM_TYPE_WINDOW being the last, and MEM_TYPE_VECTOR the
341 first. Or change the code of live_vector_p, for instance. */
349 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
351 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
352 #include <stdio.h> /* For fprintf. */
355 /* A unique object in pure space used to make some Lisp objects
356 on free lists recognizable in O(1). */
360 #ifdef GC_MALLOC_CHECK
362 enum mem_type allocated_mem_type
;
363 int dont_register_blocks
;
365 #endif /* GC_MALLOC_CHECK */
367 /* A node in the red-black tree describing allocated memory containing
368 Lisp data. Each such block is recorded with its start and end
369 address when it is allocated, and removed from the tree when it
372 A red-black tree is a balanced binary tree with the following
375 1. Every node is either red or black.
376 2. Every leaf is black.
377 3. If a node is red, then both of its children are black.
378 4. Every simple path from a node to a descendant leaf contains
379 the same number of black nodes.
380 5. The root is always black.
382 When nodes are inserted into the tree, or deleted from the tree,
383 the tree is "fixed" so that these properties are always true.
385 A red-black tree with N internal nodes has height at most 2
386 log(N+1). Searches, insertions and deletions are done in O(log N).
387 Please see a text book about data structures for a detailed
388 description of red-black trees. Any book worth its salt should
393 /* Children of this node. These pointers are never NULL. When there
394 is no child, the value is MEM_NIL, which points to a dummy node. */
395 struct mem_node
*left
, *right
;
397 /* The parent of this node. In the root node, this is NULL. */
398 struct mem_node
*parent
;
400 /* Start and end of allocated region. */
404 enum {MEM_BLACK
, MEM_RED
} color
;
410 /* Base address of stack. Set in main. */
412 Lisp_Object
*stack_base
;
414 /* Root of the tree describing allocated Lisp memory. */
416 static struct mem_node
*mem_root
;
418 /* Lowest and highest known address in the heap. */
420 static void *min_heap_address
, *max_heap_address
;
422 /* Sentinel node of the tree. */
424 static struct mem_node mem_z
;
425 #define MEM_NIL &mem_z
427 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
428 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
, enum mem_type
));
429 static void lisp_free
P_ ((POINTER_TYPE
*));
430 static void mark_stack
P_ ((void));
431 static int live_vector_p
P_ ((struct mem_node
*, void *));
432 static int live_buffer_p
P_ ((struct mem_node
*, void *));
433 static int live_string_p
P_ ((struct mem_node
*, void *));
434 static int live_cons_p
P_ ((struct mem_node
*, void *));
435 static int live_symbol_p
P_ ((struct mem_node
*, void *));
436 static int live_float_p
P_ ((struct mem_node
*, void *));
437 static int live_misc_p
P_ ((struct mem_node
*, void *));
438 static void mark_maybe_object
P_ ((Lisp_Object
));
439 static void mark_memory
P_ ((void *, void *));
440 static void mem_init
P_ ((void));
441 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
442 static void mem_insert_fixup
P_ ((struct mem_node
*));
443 static void mem_rotate_left
P_ ((struct mem_node
*));
444 static void mem_rotate_right
P_ ((struct mem_node
*));
445 static void mem_delete
P_ ((struct mem_node
*));
446 static void mem_delete_fixup
P_ ((struct mem_node
*));
447 static INLINE
struct mem_node
*mem_find
P_ ((void *));
449 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
450 static void check_gcpros
P_ ((void));
453 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
455 /* Recording what needs to be marked for gc. */
457 struct gcpro
*gcprolist
;
459 /* Addresses of staticpro'd variables. Initialize it to a nonzero
460 value; otherwise some compilers put it into BSS. */
462 #define NSTATICS 1280
463 Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
465 /* Index of next unused slot in staticvec. */
469 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
472 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
473 ALIGNMENT must be a power of 2. */
475 #define ALIGN(ptr, ALIGNMENT) \
476 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
477 & ~((ALIGNMENT) - 1)))
481 /************************************************************************
483 ************************************************************************/
485 /* Function malloc calls this if it finds we are near exhausting storage. */
491 pending_malloc_warning
= str
;
495 /* Display an already-pending malloc warning. */
498 display_malloc_warning ()
500 call3 (intern ("display-warning"),
502 build_string (pending_malloc_warning
),
503 intern ("emergency"));
504 pending_malloc_warning
= 0;
508 #ifdef DOUG_LEA_MALLOC
509 # define BYTES_USED (mallinfo ().arena)
511 # define BYTES_USED _bytes_used
515 /* Called if malloc returns zero. */
522 #ifndef SYSTEM_MALLOC
523 bytes_used_when_full
= BYTES_USED
;
526 /* The first time we get here, free the spare memory. */
533 /* This used to call error, but if we've run out of memory, we could
534 get infinite recursion trying to build the string. */
536 Fsignal (Qnil
, Vmemory_signal_data
);
539 DEFUN ("memory-full-p", Fmemory_full_p
, Smemory_full_p
, 0, 0, 0,
540 doc
: /* t if memory is nearly full, nil otherwise. */)
543 return (spare_memory
? Qnil
: Qt
);
546 /* Called if we can't allocate relocatable space for a buffer. */
549 buffer_memory_full ()
551 /* If buffers use the relocating allocator, no need to free
552 spare_memory, because we may have plenty of malloc space left
553 that we could get, and if we don't, the malloc that fails will
554 itself cause spare_memory to be freed. If buffers don't use the
555 relocating allocator, treat this like any other failing
564 /* This used to call error, but if we've run out of memory, we could
565 get infinite recursion trying to build the string. */
567 Fsignal (Qnil
, Vmemory_signal_data
);
571 #ifdef XMALLOC_OVERRUN_CHECK
573 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
574 and a 16 byte trailer around each block.
576 The header consists of 12 fixed bytes + a 4 byte integer contaning the
577 original block size, while the trailer consists of 16 fixed bytes.
579 The header is used to detect whether this block has been allocated
580 through these functions -- as it seems that some low-level libc
581 functions may bypass the malloc hooks.
585 #define XMALLOC_OVERRUN_CHECK_SIZE 16
587 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
588 { 0x9a, 0x9b, 0xae, 0xaf,
589 0xbf, 0xbe, 0xce, 0xcf,
590 0xea, 0xeb, 0xec, 0xed };
592 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
593 { 0xaa, 0xab, 0xac, 0xad,
594 0xba, 0xbb, 0xbc, 0xbd,
595 0xca, 0xcb, 0xcc, 0xcd,
596 0xda, 0xdb, 0xdc, 0xdd };
598 /* Macros to insert and extract the block size in the header. */
600 #define XMALLOC_PUT_SIZE(ptr, size) \
601 (ptr[-1] = (size & 0xff), \
602 ptr[-2] = ((size >> 8) & 0xff), \
603 ptr[-3] = ((size >> 16) & 0xff), \
604 ptr[-4] = ((size >> 24) & 0xff))
606 #define XMALLOC_GET_SIZE(ptr) \
607 (size_t)((unsigned)(ptr[-1]) | \
608 ((unsigned)(ptr[-2]) << 8) | \
609 ((unsigned)(ptr[-3]) << 16) | \
610 ((unsigned)(ptr[-4]) << 24))
613 /* The call depth in overrun_check functions. For example, this might happen:
615 overrun_check_malloc()
616 -> malloc -> (via hook)_-> emacs_blocked_malloc
617 -> overrun_check_malloc
618 call malloc (hooks are NULL, so real malloc is called).
619 malloc returns 10000.
620 add overhead, return 10016.
621 <- (back in overrun_check_malloc)
622 add overhead again, return 10032
623 xmalloc returns 10032.
628 overrun_check_free(10032)
630 free(10016) <- crash, because 10000 is the original pointer. */
632 static int check_depth
;
634 /* Like malloc, but wraps allocated block with header and trailer. */
637 overrun_check_malloc (size
)
640 register unsigned char *val
;
641 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
643 val
= (unsigned char *) malloc (size
+ overhead
);
644 if (val
&& check_depth
== 1)
646 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
647 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
648 XMALLOC_PUT_SIZE(val
, size
);
649 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
652 return (POINTER_TYPE
*)val
;
656 /* Like realloc, but checks old block for overrun, and wraps new block
657 with header and trailer. */
660 overrun_check_realloc (block
, size
)
664 register unsigned char *val
= (unsigned char *)block
;
665 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
669 && bcmp (xmalloc_overrun_check_header
,
670 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
671 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
673 size_t osize
= XMALLOC_GET_SIZE (val
);
674 if (bcmp (xmalloc_overrun_check_trailer
,
676 XMALLOC_OVERRUN_CHECK_SIZE
))
678 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
679 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
680 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
683 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
685 if (val
&& check_depth
== 1)
687 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
688 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
689 XMALLOC_PUT_SIZE(val
, size
);
690 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
693 return (POINTER_TYPE
*)val
;
696 /* Like free, but checks block for overrun. */
699 overrun_check_free (block
)
702 unsigned char *val
= (unsigned char *)block
;
707 && bcmp (xmalloc_overrun_check_header
,
708 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
709 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
711 size_t osize
= XMALLOC_GET_SIZE (val
);
712 if (bcmp (xmalloc_overrun_check_trailer
,
714 XMALLOC_OVERRUN_CHECK_SIZE
))
716 #ifdef XMALLOC_CLEAR_FREE_MEMORY
717 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
718 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
720 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
721 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
722 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
733 #define malloc overrun_check_malloc
734 #define realloc overrun_check_realloc
735 #define free overrun_check_free
739 /* Like malloc but check for no memory and block interrupt input.. */
745 register POINTER_TYPE
*val
;
748 val
= (POINTER_TYPE
*) malloc (size
);
757 /* Like realloc but check for no memory and block interrupt input.. */
760 xrealloc (block
, size
)
764 register POINTER_TYPE
*val
;
767 /* We must call malloc explicitly when BLOCK is 0, since some
768 reallocs don't do this. */
770 val
= (POINTER_TYPE
*) malloc (size
);
772 val
= (POINTER_TYPE
*) realloc (block
, size
);
775 if (!val
&& size
) memory_full ();
780 /* Like free but block interrupt input. */
792 /* Like strdup, but uses xmalloc. */
798 size_t len
= strlen (s
) + 1;
799 char *p
= (char *) xmalloc (len
);
805 /* Unwind for SAFE_ALLOCA */
808 safe_alloca_unwind (arg
)
811 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
821 /* Like malloc but used for allocating Lisp data. NBYTES is the
822 number of bytes to allocate, TYPE describes the intended use of the
823 allcated memory block (for strings, for conses, ...). */
826 static void *lisp_malloc_loser
;
829 static POINTER_TYPE
*
830 lisp_malloc (nbytes
, type
)
838 #ifdef GC_MALLOC_CHECK
839 allocated_mem_type
= type
;
842 val
= (void *) malloc (nbytes
);
845 /* If the memory just allocated cannot be addressed thru a Lisp
846 object's pointer, and it needs to be,
847 that's equivalent to running out of memory. */
848 if (val
&& type
!= MEM_TYPE_NON_LISP
)
851 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
852 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
854 lisp_malloc_loser
= val
;
861 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
862 if (val
&& type
!= MEM_TYPE_NON_LISP
)
863 mem_insert (val
, (char *) val
+ nbytes
, type
);
872 /* Free BLOCK. This must be called to free memory allocated with a
873 call to lisp_malloc. */
881 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
882 mem_delete (mem_find (block
));
887 /* Allocation of aligned blocks of memory to store Lisp data. */
888 /* The entry point is lisp_align_malloc which returns blocks of at most */
889 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
892 /* BLOCK_ALIGN has to be a power of 2. */
893 #define BLOCK_ALIGN (1 << 10)
895 /* Padding to leave at the end of a malloc'd block. This is to give
896 malloc a chance to minimize the amount of memory wasted to alignment.
897 It should be tuned to the particular malloc library used.
898 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
899 posix_memalign on the other hand would ideally prefer a value of 4
900 because otherwise, there's 1020 bytes wasted between each ablocks.
901 In Emacs, testing shows that those 1020 can most of the time be
902 efficiently used by malloc to place other objects, so a value of 0 can
903 still preferable unless you have a lot of aligned blocks and virtually
905 #define BLOCK_PADDING 0
906 #define BLOCK_BYTES \
907 (BLOCK_ALIGN - sizeof (struct ablock *) - BLOCK_PADDING)
909 /* Internal data structures and constants. */
911 #define ABLOCKS_SIZE 16
913 /* An aligned block of memory. */
918 char payload
[BLOCK_BYTES
];
919 struct ablock
*next_free
;
921 /* `abase' is the aligned base of the ablocks. */
922 /* It is overloaded to hold the virtual `busy' field that counts
923 the number of used ablock in the parent ablocks.
924 The first ablock has the `busy' field, the others have the `abase'
925 field. To tell the difference, we assume that pointers will have
926 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
927 is used to tell whether the real base of the parent ablocks is `abase'
928 (if not, the word before the first ablock holds a pointer to the
930 struct ablocks
*abase
;
931 /* The padding of all but the last ablock is unused. The padding of
932 the last ablock in an ablocks is not allocated. */
934 char padding
[BLOCK_PADDING
];
938 /* A bunch of consecutive aligned blocks. */
941 struct ablock blocks
[ABLOCKS_SIZE
];
944 /* Size of the block requested from malloc or memalign. */
945 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
947 #define ABLOCK_ABASE(block) \
948 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
949 ? (struct ablocks *)(block) \
952 /* Virtual `busy' field. */
953 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
955 /* Pointer to the (not necessarily aligned) malloc block. */
956 #ifdef HAVE_POSIX_MEMALIGN
957 #define ABLOCKS_BASE(abase) (abase)
959 #define ABLOCKS_BASE(abase) \
960 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
963 /* The list of free ablock. */
964 static struct ablock
*free_ablock
;
966 /* Allocate an aligned block of nbytes.
967 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
968 smaller or equal to BLOCK_BYTES. */
969 static POINTER_TYPE
*
970 lisp_align_malloc (nbytes
, type
)
975 struct ablocks
*abase
;
977 eassert (nbytes
<= BLOCK_BYTES
);
981 #ifdef GC_MALLOC_CHECK
982 allocated_mem_type
= type
;
988 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
990 #ifdef DOUG_LEA_MALLOC
991 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
992 because mapped region contents are not preserved in
994 mallopt (M_MMAP_MAX
, 0);
997 #ifdef HAVE_POSIX_MEMALIGN
999 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1005 base
= malloc (ABLOCKS_BYTES
);
1006 abase
= ALIGN (base
, BLOCK_ALIGN
);
1015 aligned
= (base
== abase
);
1017 ((void**)abase
)[-1] = base
;
1019 #ifdef DOUG_LEA_MALLOC
1020 /* Back to a reasonable maximum of mmap'ed areas. */
1021 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1025 /* If the memory just allocated cannot be addressed thru a Lisp
1026 object's pointer, and it needs to be, that's equivalent to
1027 running out of memory. */
1028 if (type
!= MEM_TYPE_NON_LISP
)
1031 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1032 XSETCONS (tem
, end
);
1033 if ((char *) XCONS (tem
) != end
)
1035 lisp_malloc_loser
= base
;
1043 /* Initialize the blocks and put them on the free list.
1044 Is `base' was not properly aligned, we can't use the last block. */
1045 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1047 abase
->blocks
[i
].abase
= abase
;
1048 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1049 free_ablock
= &abase
->blocks
[i
];
1051 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
1053 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
1054 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1055 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1056 eassert (ABLOCKS_BASE (abase
) == base
);
1057 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
1060 abase
= ABLOCK_ABASE (free_ablock
);
1061 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
1063 free_ablock
= free_ablock
->x
.next_free
;
1065 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1066 if (val
&& type
!= MEM_TYPE_NON_LISP
)
1067 mem_insert (val
, (char *) val
+ nbytes
, type
);
1074 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
1079 lisp_align_free (block
)
1080 POINTER_TYPE
*block
;
1082 struct ablock
*ablock
= block
;
1083 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1086 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1087 mem_delete (mem_find (block
));
1089 /* Put on free list. */
1090 ablock
->x
.next_free
= free_ablock
;
1091 free_ablock
= ablock
;
1092 /* Update busy count. */
1093 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
1095 if (2 > (long) ABLOCKS_BUSY (abase
))
1096 { /* All the blocks are free. */
1097 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
1098 struct ablock
**tem
= &free_ablock
;
1099 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1103 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1106 *tem
= (*tem
)->x
.next_free
;
1109 tem
= &(*tem
)->x
.next_free
;
1111 eassert ((aligned
& 1) == aligned
);
1112 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1113 free (ABLOCKS_BASE (abase
));
1118 /* Return a new buffer structure allocated from the heap with
1119 a call to lisp_malloc. */
1125 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1131 #ifndef SYSTEM_MALLOC
1133 /* If we released our reserve (due to running out of memory),
1134 and we have a fair amount free once again,
1135 try to set aside another reserve in case we run out once more.
1137 This is called when a relocatable block is freed in ralloc.c. */
1140 refill_memory_reserve ()
1142 if (spare_memory
== 0)
1143 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
1147 /* Arranging to disable input signals while we're in malloc.
1149 This only works with GNU malloc. To help out systems which can't
1150 use GNU malloc, all the calls to malloc, realloc, and free
1151 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1152 pair; unfortunately, we have no idea what C library functions
1153 might call malloc, so we can't really protect them unless you're
1154 using GNU malloc. Fortunately, most of the major operating systems
1155 can use GNU malloc. */
1159 #ifndef DOUG_LEA_MALLOC
1160 extern void * (*__malloc_hook
) P_ ((size_t));
1161 extern void * (*__realloc_hook
) P_ ((void *, size_t));
1162 extern void (*__free_hook
) P_ ((void *));
1163 /* Else declared in malloc.h, perhaps with an extra arg. */
1164 #endif /* DOUG_LEA_MALLOC */
1165 static void * (*old_malloc_hook
) ();
1166 static void * (*old_realloc_hook
) ();
1167 static void (*old_free_hook
) ();
1169 /* This function is used as the hook for free to call. */
1172 emacs_blocked_free (ptr
)
1177 #ifdef GC_MALLOC_CHECK
1183 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1186 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1191 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1195 #endif /* GC_MALLOC_CHECK */
1197 __free_hook
= old_free_hook
;
1200 /* If we released our reserve (due to running out of memory),
1201 and we have a fair amount free once again,
1202 try to set aside another reserve in case we run out once more. */
1203 if (spare_memory
== 0
1204 /* Verify there is enough space that even with the malloc
1205 hysteresis this call won't run out again.
1206 The code here is correct as long as SPARE_MEMORY
1207 is substantially larger than the block size malloc uses. */
1208 && (bytes_used_when_full
1209 > BYTES_USED
+ max (malloc_hysteresis
, 4) * SPARE_MEMORY
))
1210 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
1212 __free_hook
= emacs_blocked_free
;
1213 UNBLOCK_INPUT_ALLOC
;
1217 /* This function is the malloc hook that Emacs uses. */
1220 emacs_blocked_malloc (size
)
1226 __malloc_hook
= old_malloc_hook
;
1227 #ifdef DOUG_LEA_MALLOC
1228 mallopt (M_TOP_PAD
, malloc_hysteresis
* 4096);
1230 __malloc_extra_blocks
= malloc_hysteresis
;
1233 value
= (void *) malloc (size
);
1235 #ifdef GC_MALLOC_CHECK
1237 struct mem_node
*m
= mem_find (value
);
1240 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1242 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1243 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1248 if (!dont_register_blocks
)
1250 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1251 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1254 #endif /* GC_MALLOC_CHECK */
1256 __malloc_hook
= emacs_blocked_malloc
;
1257 UNBLOCK_INPUT_ALLOC
;
1259 /* fprintf (stderr, "%p malloc\n", value); */
1264 /* This function is the realloc hook that Emacs uses. */
1267 emacs_blocked_realloc (ptr
, size
)
1274 __realloc_hook
= old_realloc_hook
;
1276 #ifdef GC_MALLOC_CHECK
1279 struct mem_node
*m
= mem_find (ptr
);
1280 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1283 "Realloc of %p which wasn't allocated with malloc\n",
1291 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1293 /* Prevent malloc from registering blocks. */
1294 dont_register_blocks
= 1;
1295 #endif /* GC_MALLOC_CHECK */
1297 value
= (void *) realloc (ptr
, size
);
1299 #ifdef GC_MALLOC_CHECK
1300 dont_register_blocks
= 0;
1303 struct mem_node
*m
= mem_find (value
);
1306 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1310 /* Can't handle zero size regions in the red-black tree. */
1311 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1314 /* fprintf (stderr, "%p <- realloc\n", value); */
1315 #endif /* GC_MALLOC_CHECK */
1317 __realloc_hook
= emacs_blocked_realloc
;
1318 UNBLOCK_INPUT_ALLOC
;
1324 #ifdef HAVE_GTK_AND_PTHREAD
1325 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1326 normal malloc. Some thread implementations need this as they call
1327 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1328 calls malloc because it is the first call, and we have an endless loop. */
1331 reset_malloc_hooks ()
1337 #endif /* HAVE_GTK_AND_PTHREAD */
1340 /* Called from main to set up malloc to use our hooks. */
1343 uninterrupt_malloc ()
1345 #ifdef HAVE_GTK_AND_PTHREAD
1346 pthread_mutexattr_t attr
;
1348 /* GLIBC has a faster way to do this, but lets keep it portable.
1349 This is according to the Single UNIX Specification. */
1350 pthread_mutexattr_init (&attr
);
1351 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1352 pthread_mutex_init (&alloc_mutex
, &attr
);
1353 #endif /* HAVE_GTK_AND_PTHREAD */
1355 if (__free_hook
!= emacs_blocked_free
)
1356 old_free_hook
= __free_hook
;
1357 __free_hook
= emacs_blocked_free
;
1359 if (__malloc_hook
!= emacs_blocked_malloc
)
1360 old_malloc_hook
= __malloc_hook
;
1361 __malloc_hook
= emacs_blocked_malloc
;
1363 if (__realloc_hook
!= emacs_blocked_realloc
)
1364 old_realloc_hook
= __realloc_hook
;
1365 __realloc_hook
= emacs_blocked_realloc
;
1368 #endif /* not SYNC_INPUT */
1369 #endif /* not SYSTEM_MALLOC */
1373 /***********************************************************************
1375 ***********************************************************************/
1377 /* Number of intervals allocated in an interval_block structure.
1378 The 1020 is 1024 minus malloc overhead. */
1380 #define INTERVAL_BLOCK_SIZE \
1381 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1383 /* Intervals are allocated in chunks in form of an interval_block
1386 struct interval_block
1388 /* Place `intervals' first, to preserve alignment. */
1389 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1390 struct interval_block
*next
;
1393 /* Current interval block. Its `next' pointer points to older
1396 struct interval_block
*interval_block
;
1398 /* Index in interval_block above of the next unused interval
1401 static int interval_block_index
;
1403 /* Number of free and live intervals. */
1405 static int total_free_intervals
, total_intervals
;
1407 /* List of free intervals. */
1409 INTERVAL interval_free_list
;
1411 /* Total number of interval blocks now in use. */
1413 int n_interval_blocks
;
1416 /* Initialize interval allocation. */
1421 interval_block
= NULL
;
1422 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1423 interval_free_list
= 0;
1424 n_interval_blocks
= 0;
1428 /* Return a new interval. */
1435 if (interval_free_list
)
1437 val
= interval_free_list
;
1438 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1442 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1444 register struct interval_block
*newi
;
1446 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1449 newi
->next
= interval_block
;
1450 interval_block
= newi
;
1451 interval_block_index
= 0;
1452 n_interval_blocks
++;
1454 val
= &interval_block
->intervals
[interval_block_index
++];
1456 consing_since_gc
+= sizeof (struct interval
);
1458 RESET_INTERVAL (val
);
1464 /* Mark Lisp objects in interval I. */
1467 mark_interval (i
, dummy
)
1468 register INTERVAL i
;
1471 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1473 mark_object (i
->plist
);
1477 /* Mark the interval tree rooted in TREE. Don't call this directly;
1478 use the macro MARK_INTERVAL_TREE instead. */
1481 mark_interval_tree (tree
)
1482 register INTERVAL tree
;
1484 /* No need to test if this tree has been marked already; this
1485 function is always called through the MARK_INTERVAL_TREE macro,
1486 which takes care of that. */
1488 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1492 /* Mark the interval tree rooted in I. */
1494 #define MARK_INTERVAL_TREE(i) \
1496 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1497 mark_interval_tree (i); \
1501 #define UNMARK_BALANCE_INTERVALS(i) \
1503 if (! NULL_INTERVAL_P (i)) \
1504 (i) = balance_intervals (i); \
1508 /* Number support. If NO_UNION_TYPE isn't in effect, we
1509 can't create number objects in macros. */
1517 obj
.s
.type
= Lisp_Int
;
1522 /***********************************************************************
1524 ***********************************************************************/
1526 /* Lisp_Strings are allocated in string_block structures. When a new
1527 string_block is allocated, all the Lisp_Strings it contains are
1528 added to a free-list string_free_list. When a new Lisp_String is
1529 needed, it is taken from that list. During the sweep phase of GC,
1530 string_blocks that are entirely free are freed, except two which
1533 String data is allocated from sblock structures. Strings larger
1534 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1535 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1537 Sblocks consist internally of sdata structures, one for each
1538 Lisp_String. The sdata structure points to the Lisp_String it
1539 belongs to. The Lisp_String points back to the `u.data' member of
1540 its sdata structure.
1542 When a Lisp_String is freed during GC, it is put back on
1543 string_free_list, and its `data' member and its sdata's `string'
1544 pointer is set to null. The size of the string is recorded in the
1545 `u.nbytes' member of the sdata. So, sdata structures that are no
1546 longer used, can be easily recognized, and it's easy to compact the
1547 sblocks of small strings which we do in compact_small_strings. */
1549 /* Size in bytes of an sblock structure used for small strings. This
1550 is 8192 minus malloc overhead. */
1552 #define SBLOCK_SIZE 8188
1554 /* Strings larger than this are considered large strings. String data
1555 for large strings is allocated from individual sblocks. */
1557 #define LARGE_STRING_BYTES 1024
1559 /* Structure describing string memory sub-allocated from an sblock.
1560 This is where the contents of Lisp strings are stored. */
1564 /* Back-pointer to the string this sdata belongs to. If null, this
1565 structure is free, and the NBYTES member of the union below
1566 contains the string's byte size (the same value that STRING_BYTES
1567 would return if STRING were non-null). If non-null, STRING_BYTES
1568 (STRING) is the size of the data, and DATA contains the string's
1570 struct Lisp_String
*string
;
1572 #ifdef GC_CHECK_STRING_BYTES
1575 unsigned char data
[1];
1577 #define SDATA_NBYTES(S) (S)->nbytes
1578 #define SDATA_DATA(S) (S)->data
1580 #else /* not GC_CHECK_STRING_BYTES */
1584 /* When STRING in non-null. */
1585 unsigned char data
[1];
1587 /* When STRING is null. */
1592 #define SDATA_NBYTES(S) (S)->u.nbytes
1593 #define SDATA_DATA(S) (S)->u.data
1595 #endif /* not GC_CHECK_STRING_BYTES */
1599 /* Structure describing a block of memory which is sub-allocated to
1600 obtain string data memory for strings. Blocks for small strings
1601 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1602 as large as needed. */
1607 struct sblock
*next
;
1609 /* Pointer to the next free sdata block. This points past the end
1610 of the sblock if there isn't any space left in this block. */
1611 struct sdata
*next_free
;
1613 /* Start of data. */
1614 struct sdata first_data
;
1617 /* Number of Lisp strings in a string_block structure. The 1020 is
1618 1024 minus malloc overhead. */
1620 #define STRING_BLOCK_SIZE \
1621 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1623 /* Structure describing a block from which Lisp_String structures
1628 /* Place `strings' first, to preserve alignment. */
1629 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1630 struct string_block
*next
;
1633 /* Head and tail of the list of sblock structures holding Lisp string
1634 data. We always allocate from current_sblock. The NEXT pointers
1635 in the sblock structures go from oldest_sblock to current_sblock. */
1637 static struct sblock
*oldest_sblock
, *current_sblock
;
1639 /* List of sblocks for large strings. */
1641 static struct sblock
*large_sblocks
;
1643 /* List of string_block structures, and how many there are. */
1645 static struct string_block
*string_blocks
;
1646 static int n_string_blocks
;
1648 /* Free-list of Lisp_Strings. */
1650 static struct Lisp_String
*string_free_list
;
1652 /* Number of live and free Lisp_Strings. */
1654 static int total_strings
, total_free_strings
;
1656 /* Number of bytes used by live strings. */
1658 static int total_string_size
;
1660 /* Given a pointer to a Lisp_String S which is on the free-list
1661 string_free_list, return a pointer to its successor in the
1664 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1666 /* Return a pointer to the sdata structure belonging to Lisp string S.
1667 S must be live, i.e. S->data must not be null. S->data is actually
1668 a pointer to the `u.data' member of its sdata structure; the
1669 structure starts at a constant offset in front of that. */
1671 #ifdef GC_CHECK_STRING_BYTES
1673 #define SDATA_OF_STRING(S) \
1674 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1675 - sizeof (EMACS_INT)))
1677 #else /* not GC_CHECK_STRING_BYTES */
1679 #define SDATA_OF_STRING(S) \
1680 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1682 #endif /* not GC_CHECK_STRING_BYTES */
1685 #ifdef GC_CHECK_STRING_OVERRUN
1687 /* We check for overrun in string data blocks by appending a small
1688 "cookie" after each allocated string data block, and check for the
1689 presence of this cookie during GC. */
1691 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1692 static char string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1693 { 0xde, 0xad, 0xbe, 0xef };
1696 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1699 /* Value is the size of an sdata structure large enough to hold NBYTES
1700 bytes of string data. The value returned includes a terminating
1701 NUL byte, the size of the sdata structure, and padding. */
1703 #ifdef GC_CHECK_STRING_BYTES
1705 #define SDATA_SIZE(NBYTES) \
1706 ((sizeof (struct Lisp_String *) \
1708 + sizeof (EMACS_INT) \
1709 + sizeof (EMACS_INT) - 1) \
1710 & ~(sizeof (EMACS_INT) - 1))
1712 #else /* not GC_CHECK_STRING_BYTES */
1714 #define SDATA_SIZE(NBYTES) \
1715 ((sizeof (struct Lisp_String *) \
1717 + sizeof (EMACS_INT) - 1) \
1718 & ~(sizeof (EMACS_INT) - 1))
1720 #endif /* not GC_CHECK_STRING_BYTES */
1722 /* Extra bytes to allocate for each string. */
1724 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1726 /* Initialize string allocation. Called from init_alloc_once. */
1731 total_strings
= total_free_strings
= total_string_size
= 0;
1732 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1733 string_blocks
= NULL
;
1734 n_string_blocks
= 0;
1735 string_free_list
= NULL
;
1739 #ifdef GC_CHECK_STRING_BYTES
1741 static int check_string_bytes_count
;
1743 void check_string_bytes
P_ ((int));
1744 void check_sblock
P_ ((struct sblock
*));
1746 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1749 /* Like GC_STRING_BYTES, but with debugging check. */
1753 struct Lisp_String
*s
;
1755 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1756 if (!PURE_POINTER_P (s
)
1758 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1763 /* Check validity of Lisp strings' string_bytes member in B. */
1769 struct sdata
*from
, *end
, *from_end
;
1773 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1775 /* Compute the next FROM here because copying below may
1776 overwrite data we need to compute it. */
1779 /* Check that the string size recorded in the string is the
1780 same as the one recorded in the sdata structure. */
1782 CHECK_STRING_BYTES (from
->string
);
1785 nbytes
= GC_STRING_BYTES (from
->string
);
1787 nbytes
= SDATA_NBYTES (from
);
1789 nbytes
= SDATA_SIZE (nbytes
);
1790 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1795 /* Check validity of Lisp strings' string_bytes member. ALL_P
1796 non-zero means check all strings, otherwise check only most
1797 recently allocated strings. Used for hunting a bug. */
1800 check_string_bytes (all_p
)
1807 for (b
= large_sblocks
; b
; b
= b
->next
)
1809 struct Lisp_String
*s
= b
->first_data
.string
;
1811 CHECK_STRING_BYTES (s
);
1814 for (b
= oldest_sblock
; b
; b
= b
->next
)
1818 check_sblock (current_sblock
);
1821 #endif /* GC_CHECK_STRING_BYTES */
1823 #ifdef GC_CHECK_STRING_FREE_LIST
1825 /* Walk through the string free list looking for bogus next pointers.
1826 This may catch buffer overrun from a previous string. */
1829 check_string_free_list ()
1831 struct Lisp_String
*s
;
1833 /* Pop a Lisp_String off the free-list. */
1834 s
= string_free_list
;
1837 if ((unsigned)s
< 1024)
1839 s
= NEXT_FREE_LISP_STRING (s
);
1843 #define check_string_free_list()
1846 /* Return a new Lisp_String. */
1848 static struct Lisp_String
*
1851 struct Lisp_String
*s
;
1853 /* If the free-list is empty, allocate a new string_block, and
1854 add all the Lisp_Strings in it to the free-list. */
1855 if (string_free_list
== NULL
)
1857 struct string_block
*b
;
1860 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1861 bzero (b
, sizeof *b
);
1862 b
->next
= string_blocks
;
1866 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1869 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1870 string_free_list
= s
;
1873 total_free_strings
+= STRING_BLOCK_SIZE
;
1876 check_string_free_list ();
1878 /* Pop a Lisp_String off the free-list. */
1879 s
= string_free_list
;
1880 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1882 /* Probably not strictly necessary, but play it safe. */
1883 bzero (s
, sizeof *s
);
1885 --total_free_strings
;
1888 consing_since_gc
+= sizeof *s
;
1890 #ifdef GC_CHECK_STRING_BYTES
1897 if (++check_string_bytes_count
== 200)
1899 check_string_bytes_count
= 0;
1900 check_string_bytes (1);
1903 check_string_bytes (0);
1905 #endif /* GC_CHECK_STRING_BYTES */
1911 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1912 plus a NUL byte at the end. Allocate an sdata structure for S, and
1913 set S->data to its `u.data' member. Store a NUL byte at the end of
1914 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1915 S->data if it was initially non-null. */
1918 allocate_string_data (s
, nchars
, nbytes
)
1919 struct Lisp_String
*s
;
1922 struct sdata
*data
, *old_data
;
1924 int needed
, old_nbytes
;
1926 /* Determine the number of bytes needed to store NBYTES bytes
1928 needed
= SDATA_SIZE (nbytes
);
1930 if (nbytes
> LARGE_STRING_BYTES
)
1932 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1934 #ifdef DOUG_LEA_MALLOC
1935 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1936 because mapped region contents are not preserved in
1939 In case you think of allowing it in a dumped Emacs at the
1940 cost of not being able to re-dump, there's another reason:
1941 mmap'ed data typically have an address towards the top of the
1942 address space, which won't fit into an EMACS_INT (at least on
1943 32-bit systems with the current tagging scheme). --fx */
1945 mallopt (M_MMAP_MAX
, 0);
1949 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1951 #ifdef DOUG_LEA_MALLOC
1952 /* Back to a reasonable maximum of mmap'ed areas. */
1954 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1958 b
->next_free
= &b
->first_data
;
1959 b
->first_data
.string
= NULL
;
1960 b
->next
= large_sblocks
;
1963 else if (current_sblock
== NULL
1964 || (((char *) current_sblock
+ SBLOCK_SIZE
1965 - (char *) current_sblock
->next_free
)
1966 < (needed
+ GC_STRING_EXTRA
)))
1968 /* Not enough room in the current sblock. */
1969 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1970 b
->next_free
= &b
->first_data
;
1971 b
->first_data
.string
= NULL
;
1975 current_sblock
->next
= b
;
1983 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1984 old_nbytes
= GC_STRING_BYTES (s
);
1986 data
= b
->next_free
;
1988 s
->data
= SDATA_DATA (data
);
1989 #ifdef GC_CHECK_STRING_BYTES
1990 SDATA_NBYTES (data
) = nbytes
;
1993 s
->size_byte
= nbytes
;
1994 s
->data
[nbytes
] = '\0';
1995 #ifdef GC_CHECK_STRING_OVERRUN
1996 bcopy (string_overrun_cookie
, (char *) data
+ needed
,
1997 GC_STRING_OVERRUN_COOKIE_SIZE
);
1999 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
2001 /* If S had already data assigned, mark that as free by setting its
2002 string back-pointer to null, and recording the size of the data
2006 SDATA_NBYTES (old_data
) = old_nbytes
;
2007 old_data
->string
= NULL
;
2010 consing_since_gc
+= needed
;
2014 /* Sweep and compact strings. */
2019 struct string_block
*b
, *next
;
2020 struct string_block
*live_blocks
= NULL
;
2022 string_free_list
= NULL
;
2023 total_strings
= total_free_strings
= 0;
2024 total_string_size
= 0;
2026 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2027 for (b
= string_blocks
; b
; b
= next
)
2030 struct Lisp_String
*free_list_before
= string_free_list
;
2034 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2036 struct Lisp_String
*s
= b
->strings
+ i
;
2040 /* String was not on free-list before. */
2041 if (STRING_MARKED_P (s
))
2043 /* String is live; unmark it and its intervals. */
2046 if (!NULL_INTERVAL_P (s
->intervals
))
2047 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2050 total_string_size
+= STRING_BYTES (s
);
2054 /* String is dead. Put it on the free-list. */
2055 struct sdata
*data
= SDATA_OF_STRING (s
);
2057 /* Save the size of S in its sdata so that we know
2058 how large that is. Reset the sdata's string
2059 back-pointer so that we know it's free. */
2060 #ifdef GC_CHECK_STRING_BYTES
2061 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2064 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2066 data
->string
= NULL
;
2068 /* Reset the strings's `data' member so that we
2072 /* Put the string on the free-list. */
2073 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2074 string_free_list
= s
;
2080 /* S was on the free-list before. Put it there again. */
2081 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2082 string_free_list
= s
;
2087 /* Free blocks that contain free Lisp_Strings only, except
2088 the first two of them. */
2089 if (nfree
== STRING_BLOCK_SIZE
2090 && total_free_strings
> STRING_BLOCK_SIZE
)
2094 string_free_list
= free_list_before
;
2098 total_free_strings
+= nfree
;
2099 b
->next
= live_blocks
;
2104 check_string_free_list ();
2106 string_blocks
= live_blocks
;
2107 free_large_strings ();
2108 compact_small_strings ();
2110 check_string_free_list ();
2114 /* Free dead large strings. */
2117 free_large_strings ()
2119 struct sblock
*b
, *next
;
2120 struct sblock
*live_blocks
= NULL
;
2122 for (b
= large_sblocks
; b
; b
= next
)
2126 if (b
->first_data
.string
== NULL
)
2130 b
->next
= live_blocks
;
2135 large_sblocks
= live_blocks
;
2139 /* Compact data of small strings. Free sblocks that don't contain
2140 data of live strings after compaction. */
2143 compact_small_strings ()
2145 struct sblock
*b
, *tb
, *next
;
2146 struct sdata
*from
, *to
, *end
, *tb_end
;
2147 struct sdata
*to_end
, *from_end
;
2149 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2150 to, and TB_END is the end of TB. */
2152 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2153 to
= &tb
->first_data
;
2155 /* Step through the blocks from the oldest to the youngest. We
2156 expect that old blocks will stabilize over time, so that less
2157 copying will happen this way. */
2158 for (b
= oldest_sblock
; b
; b
= b
->next
)
2161 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2163 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2165 /* Compute the next FROM here because copying below may
2166 overwrite data we need to compute it. */
2169 #ifdef GC_CHECK_STRING_BYTES
2170 /* Check that the string size recorded in the string is the
2171 same as the one recorded in the sdata structure. */
2173 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2175 #endif /* GC_CHECK_STRING_BYTES */
2178 nbytes
= GC_STRING_BYTES (from
->string
);
2180 nbytes
= SDATA_NBYTES (from
);
2182 if (nbytes
> LARGE_STRING_BYTES
)
2185 nbytes
= SDATA_SIZE (nbytes
);
2186 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2188 #ifdef GC_CHECK_STRING_OVERRUN
2189 if (bcmp (string_overrun_cookie
,
2190 ((char *) from_end
) - GC_STRING_OVERRUN_COOKIE_SIZE
,
2191 GC_STRING_OVERRUN_COOKIE_SIZE
))
2195 /* FROM->string non-null means it's alive. Copy its data. */
2198 /* If TB is full, proceed with the next sblock. */
2199 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2200 if (to_end
> tb_end
)
2204 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2205 to
= &tb
->first_data
;
2206 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2209 /* Copy, and update the string's `data' pointer. */
2212 xassert (tb
!= b
|| to
<= from
);
2213 safe_bcopy ((char *) from
, (char *) to
, nbytes
+ GC_STRING_EXTRA
);
2214 to
->string
->data
= SDATA_DATA (to
);
2217 /* Advance past the sdata we copied to. */
2223 /* The rest of the sblocks following TB don't contain live data, so
2224 we can free them. */
2225 for (b
= tb
->next
; b
; b
= next
)
2233 current_sblock
= tb
;
2237 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2238 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2239 LENGTH must be an integer.
2240 INIT must be an integer that represents a character. */)
2242 Lisp_Object length
, init
;
2244 register Lisp_Object val
;
2245 register unsigned char *p
, *end
;
2248 CHECK_NATNUM (length
);
2249 CHECK_NUMBER (init
);
2252 if (SINGLE_BYTE_CHAR_P (c
))
2254 nbytes
= XINT (length
);
2255 val
= make_uninit_string (nbytes
);
2257 end
= p
+ SCHARS (val
);
2263 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2264 int len
= CHAR_STRING (c
, str
);
2266 nbytes
= len
* XINT (length
);
2267 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
2272 bcopy (str
, p
, len
);
2282 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2283 doc
: /* Return a new bool-vector of length LENGTH, using INIT for as each element.
2284 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2286 Lisp_Object length
, init
;
2288 register Lisp_Object val
;
2289 struct Lisp_Bool_Vector
*p
;
2291 int length_in_chars
, length_in_elts
, bits_per_value
;
2293 CHECK_NATNUM (length
);
2295 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2297 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2298 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2299 / BOOL_VECTOR_BITS_PER_CHAR
);
2301 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2302 slot `size' of the struct Lisp_Bool_Vector. */
2303 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2304 p
= XBOOL_VECTOR (val
);
2306 /* Get rid of any bits that would cause confusion. */
2308 XSETBOOL_VECTOR (val
, p
);
2309 p
->size
= XFASTINT (length
);
2311 real_init
= (NILP (init
) ? 0 : -1);
2312 for (i
= 0; i
< length_in_chars
; i
++)
2313 p
->data
[i
] = real_init
;
2315 /* Clear the extraneous bits in the last byte. */
2316 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2317 XBOOL_VECTOR (val
)->data
[length_in_chars
- 1]
2318 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2324 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2325 of characters from the contents. This string may be unibyte or
2326 multibyte, depending on the contents. */
2329 make_string (contents
, nbytes
)
2330 const char *contents
;
2333 register Lisp_Object val
;
2334 int nchars
, multibyte_nbytes
;
2336 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
2337 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2338 /* CONTENTS contains no multibyte sequences or contains an invalid
2339 multibyte sequence. We must make unibyte string. */
2340 val
= make_unibyte_string (contents
, nbytes
);
2342 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2347 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2350 make_unibyte_string (contents
, length
)
2351 const char *contents
;
2354 register Lisp_Object val
;
2355 val
= make_uninit_string (length
);
2356 bcopy (contents
, SDATA (val
), length
);
2357 STRING_SET_UNIBYTE (val
);
2362 /* Make a multibyte string from NCHARS characters occupying NBYTES
2363 bytes at CONTENTS. */
2366 make_multibyte_string (contents
, nchars
, nbytes
)
2367 const char *contents
;
2370 register Lisp_Object val
;
2371 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2372 bcopy (contents
, SDATA (val
), nbytes
);
2377 /* Make a string from NCHARS characters occupying NBYTES bytes at
2378 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2381 make_string_from_bytes (contents
, nchars
, nbytes
)
2382 const char *contents
;
2385 register Lisp_Object val
;
2386 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2387 bcopy (contents
, SDATA (val
), nbytes
);
2388 if (SBYTES (val
) == SCHARS (val
))
2389 STRING_SET_UNIBYTE (val
);
2394 /* Make a string from NCHARS characters occupying NBYTES bytes at
2395 CONTENTS. The argument MULTIBYTE controls whether to label the
2396 string as multibyte. If NCHARS is negative, it counts the number of
2397 characters by itself. */
2400 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2401 const char *contents
;
2405 register Lisp_Object val
;
2410 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2414 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2415 bcopy (contents
, SDATA (val
), nbytes
);
2417 STRING_SET_UNIBYTE (val
);
2422 /* Make a string from the data at STR, treating it as multibyte if the
2429 return make_string (str
, strlen (str
));
2433 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2434 occupying LENGTH bytes. */
2437 make_uninit_string (length
)
2441 val
= make_uninit_multibyte_string (length
, length
);
2442 STRING_SET_UNIBYTE (val
);
2447 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2448 which occupy NBYTES bytes. */
2451 make_uninit_multibyte_string (nchars
, nbytes
)
2455 struct Lisp_String
*s
;
2460 s
= allocate_string ();
2461 allocate_string_data (s
, nchars
, nbytes
);
2462 XSETSTRING (string
, s
);
2463 string_chars_consed
+= nbytes
;
2469 /***********************************************************************
2471 ***********************************************************************/
2473 /* We store float cells inside of float_blocks, allocating a new
2474 float_block with malloc whenever necessary. Float cells reclaimed
2475 by GC are put on a free list to be reallocated before allocating
2476 any new float cells from the latest float_block. */
2478 #define FLOAT_BLOCK_SIZE \
2479 (((BLOCK_BYTES - sizeof (struct float_block *) \
2480 /* The compiler might add padding at the end. */ \
2481 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2482 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2484 #define GETMARKBIT(block,n) \
2485 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2486 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2489 #define SETMARKBIT(block,n) \
2490 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2491 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2493 #define UNSETMARKBIT(block,n) \
2494 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2495 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2497 #define FLOAT_BLOCK(fptr) \
2498 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2500 #define FLOAT_INDEX(fptr) \
2501 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2505 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2506 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2507 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2508 struct float_block
*next
;
2511 #define FLOAT_MARKED_P(fptr) \
2512 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2514 #define FLOAT_MARK(fptr) \
2515 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2517 #define FLOAT_UNMARK(fptr) \
2518 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2520 /* Current float_block. */
2522 struct float_block
*float_block
;
2524 /* Index of first unused Lisp_Float in the current float_block. */
2526 int float_block_index
;
2528 /* Total number of float blocks now in use. */
2532 /* Free-list of Lisp_Floats. */
2534 struct Lisp_Float
*float_free_list
;
2537 /* Initialize float allocation. */
2543 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2544 float_free_list
= 0;
2549 /* Explicitly free a float cell by putting it on the free-list. */
2553 struct Lisp_Float
*ptr
;
2555 *(struct Lisp_Float
**)&ptr
->data
= float_free_list
;
2556 float_free_list
= ptr
;
2560 /* Return a new float object with value FLOAT_VALUE. */
2563 make_float (float_value
)
2566 register Lisp_Object val
;
2568 if (float_free_list
)
2570 /* We use the data field for chaining the free list
2571 so that we won't use the same field that has the mark bit. */
2572 XSETFLOAT (val
, float_free_list
);
2573 float_free_list
= *(struct Lisp_Float
**)&float_free_list
->data
;
2577 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2579 register struct float_block
*new;
2581 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2583 new->next
= float_block
;
2584 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2586 float_block_index
= 0;
2589 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2590 float_block_index
++;
2593 XFLOAT_DATA (val
) = float_value
;
2594 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2595 consing_since_gc
+= sizeof (struct Lisp_Float
);
2602 /***********************************************************************
2604 ***********************************************************************/
2606 /* We store cons cells inside of cons_blocks, allocating a new
2607 cons_block with malloc whenever necessary. Cons cells reclaimed by
2608 GC are put on a free list to be reallocated before allocating
2609 any new cons cells from the latest cons_block. */
2611 #define CONS_BLOCK_SIZE \
2612 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2613 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2615 #define CONS_BLOCK(fptr) \
2616 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2618 #define CONS_INDEX(fptr) \
2619 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2623 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2624 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2625 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2626 struct cons_block
*next
;
2629 #define CONS_MARKED_P(fptr) \
2630 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2632 #define CONS_MARK(fptr) \
2633 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2635 #define CONS_UNMARK(fptr) \
2636 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2638 /* Current cons_block. */
2640 struct cons_block
*cons_block
;
2642 /* Index of first unused Lisp_Cons in the current block. */
2644 int cons_block_index
;
2646 /* Free-list of Lisp_Cons structures. */
2648 struct Lisp_Cons
*cons_free_list
;
2650 /* Total number of cons blocks now in use. */
2655 /* Initialize cons allocation. */
2661 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2667 /* Explicitly free a cons cell by putting it on the free-list. */
2671 struct Lisp_Cons
*ptr
;
2673 *(struct Lisp_Cons
**)&ptr
->cdr
= cons_free_list
;
2677 cons_free_list
= ptr
;
2680 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2681 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2683 Lisp_Object car
, cdr
;
2685 register Lisp_Object val
;
2689 /* We use the cdr for chaining the free list
2690 so that we won't use the same field that has the mark bit. */
2691 XSETCONS (val
, cons_free_list
);
2692 cons_free_list
= *(struct Lisp_Cons
**)&cons_free_list
->cdr
;
2696 if (cons_block_index
== CONS_BLOCK_SIZE
)
2698 register struct cons_block
*new;
2699 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2701 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2702 new->next
= cons_block
;
2704 cons_block_index
= 0;
2707 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2713 eassert (!CONS_MARKED_P (XCONS (val
)));
2714 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2715 cons_cells_consed
++;
2719 /* Get an error now if there's any junk in the cons free list. */
2723 #ifdef GC_CHECK_CONS_LIST
2724 struct Lisp_Cons
*tail
= cons_free_list
;
2727 tail
= *(struct Lisp_Cons
**)&tail
->cdr
;
2731 /* Make a list of 2, 3, 4 or 5 specified objects. */
2735 Lisp_Object arg1
, arg2
;
2737 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2742 list3 (arg1
, arg2
, arg3
)
2743 Lisp_Object arg1
, arg2
, arg3
;
2745 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2750 list4 (arg1
, arg2
, arg3
, arg4
)
2751 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2753 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2758 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2759 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2761 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2762 Fcons (arg5
, Qnil
)))));
2766 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2767 doc
: /* Return a newly created list with specified arguments as elements.
2768 Any number of arguments, even zero arguments, are allowed.
2769 usage: (list &rest OBJECTS) */)
2772 register Lisp_Object
*args
;
2774 register Lisp_Object val
;
2780 val
= Fcons (args
[nargs
], val
);
2786 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2787 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2789 register Lisp_Object length
, init
;
2791 register Lisp_Object val
;
2794 CHECK_NATNUM (length
);
2795 size
= XFASTINT (length
);
2800 val
= Fcons (init
, val
);
2805 val
= Fcons (init
, val
);
2810 val
= Fcons (init
, val
);
2815 val
= Fcons (init
, val
);
2820 val
= Fcons (init
, val
);
2835 /***********************************************************************
2837 ***********************************************************************/
2839 /* Singly-linked list of all vectors. */
2841 struct Lisp_Vector
*all_vectors
;
2843 /* Total number of vector-like objects now in use. */
2848 /* Value is a pointer to a newly allocated Lisp_Vector structure
2849 with room for LEN Lisp_Objects. */
2851 static struct Lisp_Vector
*
2852 allocate_vectorlike (len
, type
)
2856 struct Lisp_Vector
*p
;
2859 #ifdef DOUG_LEA_MALLOC
2860 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2861 because mapped region contents are not preserved in
2864 mallopt (M_MMAP_MAX
, 0);
2868 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2869 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, type
);
2871 #ifdef DOUG_LEA_MALLOC
2872 /* Back to a reasonable maximum of mmap'ed areas. */
2874 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2878 consing_since_gc
+= nbytes
;
2879 vector_cells_consed
+= len
;
2881 p
->next
= all_vectors
;
2888 /* Allocate a vector with NSLOTS slots. */
2890 struct Lisp_Vector
*
2891 allocate_vector (nslots
)
2894 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
, MEM_TYPE_VECTOR
);
2900 /* Allocate other vector-like structures. */
2902 struct Lisp_Hash_Table
*
2903 allocate_hash_table ()
2905 EMACS_INT len
= VECSIZE (struct Lisp_Hash_Table
);
2906 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_HASH_TABLE
);
2910 for (i
= 0; i
< len
; ++i
)
2911 v
->contents
[i
] = Qnil
;
2913 return (struct Lisp_Hash_Table
*) v
;
2920 EMACS_INT len
= VECSIZE (struct window
);
2921 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_WINDOW
);
2924 for (i
= 0; i
< len
; ++i
)
2925 v
->contents
[i
] = Qnil
;
2928 return (struct window
*) v
;
2935 EMACS_INT len
= VECSIZE (struct frame
);
2936 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_FRAME
);
2939 for (i
= 0; i
< len
; ++i
)
2940 v
->contents
[i
] = make_number (0);
2942 return (struct frame
*) v
;
2946 struct Lisp_Process
*
2949 EMACS_INT len
= VECSIZE (struct Lisp_Process
);
2950 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_PROCESS
);
2953 for (i
= 0; i
< len
; ++i
)
2954 v
->contents
[i
] = Qnil
;
2957 return (struct Lisp_Process
*) v
;
2961 struct Lisp_Vector
*
2962 allocate_other_vector (len
)
2965 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_VECTOR
);
2968 for (i
= 0; i
< len
; ++i
)
2969 v
->contents
[i
] = Qnil
;
2976 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2977 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2978 See also the function `vector'. */)
2980 register Lisp_Object length
, init
;
2983 register EMACS_INT sizei
;
2985 register struct Lisp_Vector
*p
;
2987 CHECK_NATNUM (length
);
2988 sizei
= XFASTINT (length
);
2990 p
= allocate_vector (sizei
);
2991 for (index
= 0; index
< sizei
; index
++)
2992 p
->contents
[index
] = init
;
2994 XSETVECTOR (vector
, p
);
2999 DEFUN ("make-char-table", Fmake_char_table
, Smake_char_table
, 1, 2, 0,
3000 doc
: /* Return a newly created char-table, with purpose PURPOSE.
3001 Each element is initialized to INIT, which defaults to nil.
3002 PURPOSE should be a symbol which has a `char-table-extra-slots' property.
3003 The property's value should be an integer between 0 and 10. */)
3005 register Lisp_Object purpose
, init
;
3009 CHECK_SYMBOL (purpose
);
3010 n
= Fget (purpose
, Qchar_table_extra_slots
);
3012 if (XINT (n
) < 0 || XINT (n
) > 10)
3013 args_out_of_range (n
, Qnil
);
3014 /* Add 2 to the size for the defalt and parent slots. */
3015 vector
= Fmake_vector (make_number (CHAR_TABLE_STANDARD_SLOTS
+ XINT (n
)),
3017 XCHAR_TABLE (vector
)->top
= Qt
;
3018 XCHAR_TABLE (vector
)->parent
= Qnil
;
3019 XCHAR_TABLE (vector
)->purpose
= purpose
;
3020 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
3025 /* Return a newly created sub char table with slots initialized by INIT.
3026 Since a sub char table does not appear as a top level Emacs Lisp
3027 object, we don't need a Lisp interface to make it. */
3030 make_sub_char_table (init
)
3034 = Fmake_vector (make_number (SUB_CHAR_TABLE_STANDARD_SLOTS
), init
);
3035 XCHAR_TABLE (vector
)->top
= Qnil
;
3036 XCHAR_TABLE (vector
)->defalt
= Qnil
;
3037 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
3042 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3043 doc
: /* Return a newly created vector with specified arguments as elements.
3044 Any number of arguments, even zero arguments, are allowed.
3045 usage: (vector &rest OBJECTS) */)
3050 register Lisp_Object len
, val
;
3052 register struct Lisp_Vector
*p
;
3054 XSETFASTINT (len
, nargs
);
3055 val
= Fmake_vector (len
, Qnil
);
3057 for (index
= 0; index
< nargs
; index
++)
3058 p
->contents
[index
] = args
[index
];
3063 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3064 doc
: /* Create a byte-code object with specified arguments as elements.
3065 The arguments should be the arglist, bytecode-string, constant vector,
3066 stack size, (optional) doc string, and (optional) interactive spec.
3067 The first four arguments are required; at most six have any
3069 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3074 register Lisp_Object len
, val
;
3076 register struct Lisp_Vector
*p
;
3078 XSETFASTINT (len
, nargs
);
3079 if (!NILP (Vpurify_flag
))
3080 val
= make_pure_vector ((EMACS_INT
) nargs
);
3082 val
= Fmake_vector (len
, Qnil
);
3084 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
3085 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3086 earlier because they produced a raw 8-bit string for byte-code
3087 and now such a byte-code string is loaded as multibyte while
3088 raw 8-bit characters converted to multibyte form. Thus, now we
3089 must convert them back to the original unibyte form. */
3090 args
[1] = Fstring_as_unibyte (args
[1]);
3093 for (index
= 0; index
< nargs
; index
++)
3095 if (!NILP (Vpurify_flag
))
3096 args
[index
] = Fpurecopy (args
[index
]);
3097 p
->contents
[index
] = args
[index
];
3099 XSETCOMPILED (val
, p
);
3105 /***********************************************************************
3107 ***********************************************************************/
3109 /* Each symbol_block is just under 1020 bytes long, since malloc
3110 really allocates in units of powers of two and uses 4 bytes for its
3113 #define SYMBOL_BLOCK_SIZE \
3114 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3118 /* Place `symbols' first, to preserve alignment. */
3119 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3120 struct symbol_block
*next
;
3123 /* Current symbol block and index of first unused Lisp_Symbol
3126 struct symbol_block
*symbol_block
;
3127 int symbol_block_index
;
3129 /* List of free symbols. */
3131 struct Lisp_Symbol
*symbol_free_list
;
3133 /* Total number of symbol blocks now in use. */
3135 int n_symbol_blocks
;
3138 /* Initialize symbol allocation. */
3143 symbol_block
= NULL
;
3144 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3145 symbol_free_list
= 0;
3146 n_symbol_blocks
= 0;
3150 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3151 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3152 Its value and function definition are void, and its property list is nil. */)
3156 register Lisp_Object val
;
3157 register struct Lisp_Symbol
*p
;
3159 CHECK_STRING (name
);
3161 if (symbol_free_list
)
3163 XSETSYMBOL (val
, symbol_free_list
);
3164 symbol_free_list
= *(struct Lisp_Symbol
**)&symbol_free_list
->value
;
3168 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3170 struct symbol_block
*new;
3171 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3173 new->next
= symbol_block
;
3175 symbol_block_index
= 0;
3178 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3179 symbol_block_index
++;
3185 p
->value
= Qunbound
;
3186 p
->function
= Qunbound
;
3189 p
->interned
= SYMBOL_UNINTERNED
;
3191 p
->indirect_variable
= 0;
3192 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3199 /***********************************************************************
3200 Marker (Misc) Allocation
3201 ***********************************************************************/
3203 /* Allocation of markers and other objects that share that structure.
3204 Works like allocation of conses. */
3206 #define MARKER_BLOCK_SIZE \
3207 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3211 /* Place `markers' first, to preserve alignment. */
3212 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3213 struct marker_block
*next
;
3216 struct marker_block
*marker_block
;
3217 int marker_block_index
;
3219 union Lisp_Misc
*marker_free_list
;
3221 /* Total number of marker blocks now in use. */
3223 int n_marker_blocks
;
3228 marker_block
= NULL
;
3229 marker_block_index
= MARKER_BLOCK_SIZE
;
3230 marker_free_list
= 0;
3231 n_marker_blocks
= 0;
3234 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3241 if (marker_free_list
)
3243 XSETMISC (val
, marker_free_list
);
3244 marker_free_list
= marker_free_list
->u_free
.chain
;
3248 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3250 struct marker_block
*new;
3251 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3253 new->next
= marker_block
;
3255 marker_block_index
= 0;
3257 total_free_markers
+= MARKER_BLOCK_SIZE
;
3259 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3260 marker_block_index
++;
3263 --total_free_markers
;
3264 consing_since_gc
+= sizeof (union Lisp_Misc
);
3265 misc_objects_consed
++;
3266 XMARKER (val
)->gcmarkbit
= 0;
3270 /* Free a Lisp_Misc object */
3276 XMISC (misc
)->u_marker
.type
= Lisp_Misc_Free
;
3277 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3278 marker_free_list
= XMISC (misc
);
3280 total_free_markers
++;
3283 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3284 INTEGER. This is used to package C values to call record_unwind_protect.
3285 The unwind function can get the C values back using XSAVE_VALUE. */
3288 make_save_value (pointer
, integer
)
3292 register Lisp_Object val
;
3293 register struct Lisp_Save_Value
*p
;
3295 val
= allocate_misc ();
3296 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3297 p
= XSAVE_VALUE (val
);
3298 p
->pointer
= pointer
;
3299 p
->integer
= integer
;
3304 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3305 doc
: /* Return a newly allocated marker which does not point at any place. */)
3308 register Lisp_Object val
;
3309 register struct Lisp_Marker
*p
;
3311 val
= allocate_misc ();
3312 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3318 p
->insertion_type
= 0;
3322 /* Put MARKER back on the free list after using it temporarily. */
3325 free_marker (marker
)
3328 unchain_marker (XMARKER (marker
));
3333 /* Return a newly created vector or string with specified arguments as
3334 elements. If all the arguments are characters that can fit
3335 in a string of events, make a string; otherwise, make a vector.
3337 Any number of arguments, even zero arguments, are allowed. */
3340 make_event_array (nargs
, args
)
3346 for (i
= 0; i
< nargs
; i
++)
3347 /* The things that fit in a string
3348 are characters that are in 0...127,
3349 after discarding the meta bit and all the bits above it. */
3350 if (!INTEGERP (args
[i
])
3351 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3352 return Fvector (nargs
, args
);
3354 /* Since the loop exited, we know that all the things in it are
3355 characters, so we can make a string. */
3359 result
= Fmake_string (make_number (nargs
), make_number (0));
3360 for (i
= 0; i
< nargs
; i
++)
3362 SSET (result
, i
, XINT (args
[i
]));
3363 /* Move the meta bit to the right place for a string char. */
3364 if (XINT (args
[i
]) & CHAR_META
)
3365 SSET (result
, i
, SREF (result
, i
) | 0x80);
3374 /************************************************************************
3376 ************************************************************************/
3378 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3380 /* Conservative C stack marking requires a method to identify possibly
3381 live Lisp objects given a pointer value. We do this by keeping
3382 track of blocks of Lisp data that are allocated in a red-black tree
3383 (see also the comment of mem_node which is the type of nodes in
3384 that tree). Function lisp_malloc adds information for an allocated
3385 block to the red-black tree with calls to mem_insert, and function
3386 lisp_free removes it with mem_delete. Functions live_string_p etc
3387 call mem_find to lookup information about a given pointer in the
3388 tree, and use that to determine if the pointer points to a Lisp
3391 /* Initialize this part of alloc.c. */
3396 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3397 mem_z
.parent
= NULL
;
3398 mem_z
.color
= MEM_BLACK
;
3399 mem_z
.start
= mem_z
.end
= NULL
;
3404 /* Value is a pointer to the mem_node containing START. Value is
3405 MEM_NIL if there is no node in the tree containing START. */
3407 static INLINE
struct mem_node
*
3413 if (start
< min_heap_address
|| start
> max_heap_address
)
3416 /* Make the search always successful to speed up the loop below. */
3417 mem_z
.start
= start
;
3418 mem_z
.end
= (char *) start
+ 1;
3421 while (start
< p
->start
|| start
>= p
->end
)
3422 p
= start
< p
->start
? p
->left
: p
->right
;
3427 /* Insert a new node into the tree for a block of memory with start
3428 address START, end address END, and type TYPE. Value is a
3429 pointer to the node that was inserted. */
3431 static struct mem_node
*
3432 mem_insert (start
, end
, type
)
3436 struct mem_node
*c
, *parent
, *x
;
3438 if (start
< min_heap_address
)
3439 min_heap_address
= start
;
3440 if (end
> max_heap_address
)
3441 max_heap_address
= end
;
3443 /* See where in the tree a node for START belongs. In this
3444 particular application, it shouldn't happen that a node is already
3445 present. For debugging purposes, let's check that. */
3449 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3451 while (c
!= MEM_NIL
)
3453 if (start
>= c
->start
&& start
< c
->end
)
3456 c
= start
< c
->start
? c
->left
: c
->right
;
3459 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3461 while (c
!= MEM_NIL
)
3464 c
= start
< c
->start
? c
->left
: c
->right
;
3467 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3469 /* Create a new node. */
3470 #ifdef GC_MALLOC_CHECK
3471 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3475 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3481 x
->left
= x
->right
= MEM_NIL
;
3484 /* Insert it as child of PARENT or install it as root. */
3487 if (start
< parent
->start
)
3495 /* Re-establish red-black tree properties. */
3496 mem_insert_fixup (x
);
3502 /* Re-establish the red-black properties of the tree, and thereby
3503 balance the tree, after node X has been inserted; X is always red. */
3506 mem_insert_fixup (x
)
3509 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3511 /* X is red and its parent is red. This is a violation of
3512 red-black tree property #3. */
3514 if (x
->parent
== x
->parent
->parent
->left
)
3516 /* We're on the left side of our grandparent, and Y is our
3518 struct mem_node
*y
= x
->parent
->parent
->right
;
3520 if (y
->color
== MEM_RED
)
3522 /* Uncle and parent are red but should be black because
3523 X is red. Change the colors accordingly and proceed
3524 with the grandparent. */
3525 x
->parent
->color
= MEM_BLACK
;
3526 y
->color
= MEM_BLACK
;
3527 x
->parent
->parent
->color
= MEM_RED
;
3528 x
= x
->parent
->parent
;
3532 /* Parent and uncle have different colors; parent is
3533 red, uncle is black. */
3534 if (x
== x
->parent
->right
)
3537 mem_rotate_left (x
);
3540 x
->parent
->color
= MEM_BLACK
;
3541 x
->parent
->parent
->color
= MEM_RED
;
3542 mem_rotate_right (x
->parent
->parent
);
3547 /* This is the symmetrical case of above. */
3548 struct mem_node
*y
= x
->parent
->parent
->left
;
3550 if (y
->color
== MEM_RED
)
3552 x
->parent
->color
= MEM_BLACK
;
3553 y
->color
= MEM_BLACK
;
3554 x
->parent
->parent
->color
= MEM_RED
;
3555 x
= x
->parent
->parent
;
3559 if (x
== x
->parent
->left
)
3562 mem_rotate_right (x
);
3565 x
->parent
->color
= MEM_BLACK
;
3566 x
->parent
->parent
->color
= MEM_RED
;
3567 mem_rotate_left (x
->parent
->parent
);
3572 /* The root may have been changed to red due to the algorithm. Set
3573 it to black so that property #5 is satisfied. */
3574 mem_root
->color
= MEM_BLACK
;
3590 /* Turn y's left sub-tree into x's right sub-tree. */
3593 if (y
->left
!= MEM_NIL
)
3594 y
->left
->parent
= x
;
3596 /* Y's parent was x's parent. */
3598 y
->parent
= x
->parent
;
3600 /* Get the parent to point to y instead of x. */
3603 if (x
== x
->parent
->left
)
3604 x
->parent
->left
= y
;
3606 x
->parent
->right
= y
;
3611 /* Put x on y's left. */
3625 mem_rotate_right (x
)
3628 struct mem_node
*y
= x
->left
;
3631 if (y
->right
!= MEM_NIL
)
3632 y
->right
->parent
= x
;
3635 y
->parent
= x
->parent
;
3638 if (x
== x
->parent
->right
)
3639 x
->parent
->right
= y
;
3641 x
->parent
->left
= y
;
3652 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3658 struct mem_node
*x
, *y
;
3660 if (!z
|| z
== MEM_NIL
)
3663 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3668 while (y
->left
!= MEM_NIL
)
3672 if (y
->left
!= MEM_NIL
)
3677 x
->parent
= y
->parent
;
3680 if (y
== y
->parent
->left
)
3681 y
->parent
->left
= x
;
3683 y
->parent
->right
= x
;
3690 z
->start
= y
->start
;
3695 if (y
->color
== MEM_BLACK
)
3696 mem_delete_fixup (x
);
3698 #ifdef GC_MALLOC_CHECK
3706 /* Re-establish the red-black properties of the tree, after a
3710 mem_delete_fixup (x
)
3713 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3715 if (x
== x
->parent
->left
)
3717 struct mem_node
*w
= x
->parent
->right
;
3719 if (w
->color
== MEM_RED
)
3721 w
->color
= MEM_BLACK
;
3722 x
->parent
->color
= MEM_RED
;
3723 mem_rotate_left (x
->parent
);
3724 w
= x
->parent
->right
;
3727 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3734 if (w
->right
->color
== MEM_BLACK
)
3736 w
->left
->color
= MEM_BLACK
;
3738 mem_rotate_right (w
);
3739 w
= x
->parent
->right
;
3741 w
->color
= x
->parent
->color
;
3742 x
->parent
->color
= MEM_BLACK
;
3743 w
->right
->color
= MEM_BLACK
;
3744 mem_rotate_left (x
->parent
);
3750 struct mem_node
*w
= x
->parent
->left
;
3752 if (w
->color
== MEM_RED
)
3754 w
->color
= MEM_BLACK
;
3755 x
->parent
->color
= MEM_RED
;
3756 mem_rotate_right (x
->parent
);
3757 w
= x
->parent
->left
;
3760 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3767 if (w
->left
->color
== MEM_BLACK
)
3769 w
->right
->color
= MEM_BLACK
;
3771 mem_rotate_left (w
);
3772 w
= x
->parent
->left
;
3775 w
->color
= x
->parent
->color
;
3776 x
->parent
->color
= MEM_BLACK
;
3777 w
->left
->color
= MEM_BLACK
;
3778 mem_rotate_right (x
->parent
);
3784 x
->color
= MEM_BLACK
;
3788 /* Value is non-zero if P is a pointer to a live Lisp string on
3789 the heap. M is a pointer to the mem_block for P. */
3792 live_string_p (m
, p
)
3796 if (m
->type
== MEM_TYPE_STRING
)
3798 struct string_block
*b
= (struct string_block
*) m
->start
;
3799 int offset
= (char *) p
- (char *) &b
->strings
[0];
3801 /* P must point to the start of a Lisp_String structure, and it
3802 must not be on the free-list. */
3804 && offset
% sizeof b
->strings
[0] == 0
3805 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3806 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3813 /* Value is non-zero if P is a pointer to a live Lisp cons on
3814 the heap. M is a pointer to the mem_block for P. */
3821 if (m
->type
== MEM_TYPE_CONS
)
3823 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3824 int offset
= (char *) p
- (char *) &b
->conses
[0];
3826 /* P must point to the start of a Lisp_Cons, not be
3827 one of the unused cells in the current cons block,
3828 and not be on the free-list. */
3830 && offset
% sizeof b
->conses
[0] == 0
3831 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3833 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3834 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3841 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3842 the heap. M is a pointer to the mem_block for P. */
3845 live_symbol_p (m
, p
)
3849 if (m
->type
== MEM_TYPE_SYMBOL
)
3851 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3852 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3854 /* P must point to the start of a Lisp_Symbol, not be
3855 one of the unused cells in the current symbol block,
3856 and not be on the free-list. */
3858 && offset
% sizeof b
->symbols
[0] == 0
3859 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3860 && (b
!= symbol_block
3861 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3862 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3869 /* Value is non-zero if P is a pointer to a live Lisp float on
3870 the heap. M is a pointer to the mem_block for P. */
3877 if (m
->type
== MEM_TYPE_FLOAT
)
3879 struct float_block
*b
= (struct float_block
*) m
->start
;
3880 int offset
= (char *) p
- (char *) &b
->floats
[0];
3882 /* P must point to the start of a Lisp_Float and not be
3883 one of the unused cells in the current float block. */
3885 && offset
% sizeof b
->floats
[0] == 0
3886 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3887 && (b
!= float_block
3888 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3895 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3896 the heap. M is a pointer to the mem_block for P. */
3903 if (m
->type
== MEM_TYPE_MISC
)
3905 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3906 int offset
= (char *) p
- (char *) &b
->markers
[0];
3908 /* P must point to the start of a Lisp_Misc, not be
3909 one of the unused cells in the current misc block,
3910 and not be on the free-list. */
3912 && offset
% sizeof b
->markers
[0] == 0
3913 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3914 && (b
!= marker_block
3915 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3916 && ((union Lisp_Misc
*) p
)->u_marker
.type
!= Lisp_Misc_Free
);
3923 /* Value is non-zero if P is a pointer to a live vector-like object.
3924 M is a pointer to the mem_block for P. */
3927 live_vector_p (m
, p
)
3931 return (p
== m
->start
3932 && m
->type
>= MEM_TYPE_VECTOR
3933 && m
->type
<= MEM_TYPE_WINDOW
);
3937 /* Value is non-zero if P is a pointer to a live buffer. M is a
3938 pointer to the mem_block for P. */
3941 live_buffer_p (m
, p
)
3945 /* P must point to the start of the block, and the buffer
3946 must not have been killed. */
3947 return (m
->type
== MEM_TYPE_BUFFER
3949 && !NILP (((struct buffer
*) p
)->name
));
3952 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3956 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3958 /* Array of objects that are kept alive because the C stack contains
3959 a pattern that looks like a reference to them . */
3961 #define MAX_ZOMBIES 10
3962 static Lisp_Object zombies
[MAX_ZOMBIES
];
3964 /* Number of zombie objects. */
3966 static int nzombies
;
3968 /* Number of garbage collections. */
3972 /* Average percentage of zombies per collection. */
3974 static double avg_zombies
;
3976 /* Max. number of live and zombie objects. */
3978 static int max_live
, max_zombies
;
3980 /* Average number of live objects per GC. */
3982 static double avg_live
;
3984 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3985 doc
: /* Show information about live and zombie objects. */)
3988 Lisp_Object args
[8], zombie_list
= Qnil
;
3990 for (i
= 0; i
< nzombies
; i
++)
3991 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3992 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3993 args
[1] = make_number (ngcs
);
3994 args
[2] = make_float (avg_live
);
3995 args
[3] = make_float (avg_zombies
);
3996 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
3997 args
[5] = make_number (max_live
);
3998 args
[6] = make_number (max_zombies
);
3999 args
[7] = zombie_list
;
4000 return Fmessage (8, args
);
4003 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4006 /* Mark OBJ if we can prove it's a Lisp_Object. */
4009 mark_maybe_object (obj
)
4012 void *po
= (void *) XPNTR (obj
);
4013 struct mem_node
*m
= mem_find (po
);
4019 switch (XGCTYPE (obj
))
4022 mark_p
= (live_string_p (m
, po
)
4023 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4027 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4031 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4035 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4038 case Lisp_Vectorlike
:
4039 /* Note: can't check GC_BUFFERP before we know it's a
4040 buffer because checking that dereferences the pointer
4041 PO which might point anywhere. */
4042 if (live_vector_p (m
, po
))
4043 mark_p
= !GC_SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4044 else if (live_buffer_p (m
, po
))
4045 mark_p
= GC_BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4049 mark_p
= (live_misc_p (m
, po
) && !XMARKER (obj
)->gcmarkbit
);
4053 case Lisp_Type_Limit
:
4059 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4060 if (nzombies
< MAX_ZOMBIES
)
4061 zombies
[nzombies
] = obj
;
4070 /* If P points to Lisp data, mark that as live if it isn't already
4074 mark_maybe_pointer (p
)
4079 /* Quickly rule out some values which can't point to Lisp data. We
4080 assume that Lisp data is aligned on even addresses. */
4081 if ((EMACS_INT
) p
& 1)
4087 Lisp_Object obj
= Qnil
;
4091 case MEM_TYPE_NON_LISP
:
4092 /* Nothing to do; not a pointer to Lisp memory. */
4095 case MEM_TYPE_BUFFER
:
4096 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4097 XSETVECTOR (obj
, p
);
4101 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4105 case MEM_TYPE_STRING
:
4106 if (live_string_p (m
, p
)
4107 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4108 XSETSTRING (obj
, p
);
4112 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4116 case MEM_TYPE_SYMBOL
:
4117 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4118 XSETSYMBOL (obj
, p
);
4121 case MEM_TYPE_FLOAT
:
4122 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4126 case MEM_TYPE_VECTOR
:
4127 case MEM_TYPE_PROCESS
:
4128 case MEM_TYPE_HASH_TABLE
:
4129 case MEM_TYPE_FRAME
:
4130 case MEM_TYPE_WINDOW
:
4131 if (live_vector_p (m
, p
))
4134 XSETVECTOR (tem
, p
);
4135 if (!GC_SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4150 /* Mark Lisp objects referenced from the address range START..END. */
4153 mark_memory (start
, end
)
4159 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4163 /* Make START the pointer to the start of the memory region,
4164 if it isn't already. */
4172 /* Mark Lisp_Objects. */
4173 for (p
= (Lisp_Object
*) start
; (void *) p
< end
; ++p
)
4174 mark_maybe_object (*p
);
4176 /* Mark Lisp data pointed to. This is necessary because, in some
4177 situations, the C compiler optimizes Lisp objects away, so that
4178 only a pointer to them remains. Example:
4180 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4183 Lisp_Object obj = build_string ("test");
4184 struct Lisp_String *s = XSTRING (obj);
4185 Fgarbage_collect ();
4186 fprintf (stderr, "test `%s'\n", s->data);
4190 Here, `obj' isn't really used, and the compiler optimizes it
4191 away. The only reference to the life string is through the
4194 for (pp
= (void **) start
; (void *) pp
< end
; ++pp
)
4195 mark_maybe_pointer (*pp
);
4198 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4199 the GCC system configuration. In gcc 3.2, the only systems for
4200 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4201 by others?) and ns32k-pc532-min. */
4203 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4205 static int setjmp_tested_p
, longjmps_done
;
4207 #define SETJMP_WILL_LIKELY_WORK "\
4209 Emacs garbage collector has been changed to use conservative stack\n\
4210 marking. Emacs has determined that the method it uses to do the\n\
4211 marking will likely work on your system, but this isn't sure.\n\
4213 If you are a system-programmer, or can get the help of a local wizard\n\
4214 who is, please take a look at the function mark_stack in alloc.c, and\n\
4215 verify that the methods used are appropriate for your system.\n\
4217 Please mail the result to <emacs-devel@gnu.org>.\n\
4220 #define SETJMP_WILL_NOT_WORK "\
4222 Emacs garbage collector has been changed to use conservative stack\n\
4223 marking. Emacs has determined that the default method it uses to do the\n\
4224 marking will not work on your system. We will need a system-dependent\n\
4225 solution for your system.\n\
4227 Please take a look at the function mark_stack in alloc.c, and\n\
4228 try to find a way to make it work on your system.\n\
4230 Note that you may get false negatives, depending on the compiler.\n\
4231 In particular, you need to use -O with GCC for this test.\n\
4233 Please mail the result to <emacs-devel@gnu.org>.\n\
4237 /* Perform a quick check if it looks like setjmp saves registers in a
4238 jmp_buf. Print a message to stderr saying so. When this test
4239 succeeds, this is _not_ a proof that setjmp is sufficient for
4240 conservative stack marking. Only the sources or a disassembly
4251 /* Arrange for X to be put in a register. */
4257 if (longjmps_done
== 1)
4259 /* Came here after the longjmp at the end of the function.
4261 If x == 1, the longjmp has restored the register to its
4262 value before the setjmp, and we can hope that setjmp
4263 saves all such registers in the jmp_buf, although that
4266 For other values of X, either something really strange is
4267 taking place, or the setjmp just didn't save the register. */
4270 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4273 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4280 if (longjmps_done
== 1)
4284 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4287 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4289 /* Abort if anything GCPRO'd doesn't survive the GC. */
4297 for (p
= gcprolist
; p
; p
= p
->next
)
4298 for (i
= 0; i
< p
->nvars
; ++i
)
4299 if (!survives_gc_p (p
->var
[i
]))
4300 /* FIXME: It's not necessarily a bug. It might just be that the
4301 GCPRO is unnecessary or should release the object sooner. */
4305 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4312 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4313 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4315 fprintf (stderr
, " %d = ", i
);
4316 debug_print (zombies
[i
]);
4320 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4323 /* Mark live Lisp objects on the C stack.
4325 There are several system-dependent problems to consider when
4326 porting this to new architectures:
4330 We have to mark Lisp objects in CPU registers that can hold local
4331 variables or are used to pass parameters.
4333 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4334 something that either saves relevant registers on the stack, or
4335 calls mark_maybe_object passing it each register's contents.
4337 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4338 implementation assumes that calling setjmp saves registers we need
4339 to see in a jmp_buf which itself lies on the stack. This doesn't
4340 have to be true! It must be verified for each system, possibly
4341 by taking a look at the source code of setjmp.
4345 Architectures differ in the way their processor stack is organized.
4346 For example, the stack might look like this
4349 | Lisp_Object | size = 4
4351 | something else | size = 2
4353 | Lisp_Object | size = 4
4357 In such a case, not every Lisp_Object will be aligned equally. To
4358 find all Lisp_Object on the stack it won't be sufficient to walk
4359 the stack in steps of 4 bytes. Instead, two passes will be
4360 necessary, one starting at the start of the stack, and a second
4361 pass starting at the start of the stack + 2. Likewise, if the
4362 minimal alignment of Lisp_Objects on the stack is 1, four passes
4363 would be necessary, each one starting with one byte more offset
4364 from the stack start.
4366 The current code assumes by default that Lisp_Objects are aligned
4367 equally on the stack. */
4374 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4377 /* This trick flushes the register windows so that all the state of
4378 the process is contained in the stack. */
4379 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4380 needed on ia64 too. See mach_dep.c, where it also says inline
4381 assembler doesn't work with relevant proprietary compilers. */
4386 /* Save registers that we need to see on the stack. We need to see
4387 registers used to hold register variables and registers used to
4389 #ifdef GC_SAVE_REGISTERS_ON_STACK
4390 GC_SAVE_REGISTERS_ON_STACK (end
);
4391 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4393 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4394 setjmp will definitely work, test it
4395 and print a message with the result
4397 if (!setjmp_tested_p
)
4399 setjmp_tested_p
= 1;
4402 #endif /* GC_SETJMP_WORKS */
4405 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4406 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4408 /* This assumes that the stack is a contiguous region in memory. If
4409 that's not the case, something has to be done here to iterate
4410 over the stack segments. */
4411 #ifndef GC_LISP_OBJECT_ALIGNMENT
4413 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4415 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4418 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4419 mark_memory ((char *) stack_base
+ i
, end
);
4420 /* Allow for marking a secondary stack, like the register stack on the
4422 #ifdef GC_MARK_SECONDARY_STACK
4423 GC_MARK_SECONDARY_STACK ();
4426 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4432 #endif /* GC_MARK_STACK != 0 */
4436 /***********************************************************************
4437 Pure Storage Management
4438 ***********************************************************************/
4440 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4441 pointer to it. TYPE is the Lisp type for which the memory is
4442 allocated. TYPE < 0 means it's not used for a Lisp object.
4444 If store_pure_type_info is set and TYPE is >= 0, the type of
4445 the allocated object is recorded in pure_types. */
4447 static POINTER_TYPE
*
4448 pure_alloc (size
, type
)
4452 POINTER_TYPE
*result
;
4454 size_t alignment
= (1 << GCTYPEBITS
);
4456 size_t alignment
= sizeof (EMACS_INT
);
4458 /* Give Lisp_Floats an extra alignment. */
4459 if (type
== Lisp_Float
)
4461 #if defined __GNUC__ && __GNUC__ >= 2
4462 alignment
= __alignof (struct Lisp_Float
);
4464 alignment
= sizeof (struct Lisp_Float
);
4470 result
= ALIGN (purebeg
+ pure_bytes_used
, alignment
);
4471 pure_bytes_used
= ((char *)result
- (char *)purebeg
) + size
;
4473 if (pure_bytes_used
<= pure_size
)
4476 /* Don't allocate a large amount here,
4477 because it might get mmap'd and then its address
4478 might not be usable. */
4479 purebeg
= (char *) xmalloc (10000);
4481 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4482 pure_bytes_used
= 0;
4487 /* Print a warning if PURESIZE is too small. */
4492 if (pure_bytes_used_before_overflow
)
4493 message ("Pure Lisp storage overflow (approx. %d bytes needed)",
4494 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4498 /* Return a string allocated in pure space. DATA is a buffer holding
4499 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4500 non-zero means make the result string multibyte.
4502 Must get an error if pure storage is full, since if it cannot hold
4503 a large string it may be able to hold conses that point to that
4504 string; then the string is not protected from gc. */
4507 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4513 struct Lisp_String
*s
;
4515 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4516 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4518 s
->size_byte
= multibyte
? nbytes
: -1;
4519 bcopy (data
, s
->data
, nbytes
);
4520 s
->data
[nbytes
] = '\0';
4521 s
->intervals
= NULL_INTERVAL
;
4522 XSETSTRING (string
, s
);
4527 /* Return a cons allocated from pure space. Give it pure copies
4528 of CAR as car and CDR as cdr. */
4531 pure_cons (car
, cdr
)
4532 Lisp_Object car
, cdr
;
4534 register Lisp_Object
new;
4535 struct Lisp_Cons
*p
;
4537 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4539 XSETCAR (new, Fpurecopy (car
));
4540 XSETCDR (new, Fpurecopy (cdr
));
4545 /* Value is a float object with value NUM allocated from pure space. */
4548 make_pure_float (num
)
4551 register Lisp_Object
new;
4552 struct Lisp_Float
*p
;
4554 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4556 XFLOAT_DATA (new) = num
;
4561 /* Return a vector with room for LEN Lisp_Objects allocated from
4565 make_pure_vector (len
)
4569 struct Lisp_Vector
*p
;
4570 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4572 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4573 XSETVECTOR (new, p
);
4574 XVECTOR (new)->size
= len
;
4579 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4580 doc
: /* Make a copy of OBJECT in pure storage.
4581 Recursively copies contents of vectors and cons cells.
4582 Does not copy symbols. Copies strings without text properties. */)
4584 register Lisp_Object obj
;
4586 if (NILP (Vpurify_flag
))
4589 if (PURE_POINTER_P (XPNTR (obj
)))
4593 return pure_cons (XCAR (obj
), XCDR (obj
));
4594 else if (FLOATP (obj
))
4595 return make_pure_float (XFLOAT_DATA (obj
));
4596 else if (STRINGP (obj
))
4597 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4599 STRING_MULTIBYTE (obj
));
4600 else if (COMPILEDP (obj
) || VECTORP (obj
))
4602 register struct Lisp_Vector
*vec
;
4606 size
= XVECTOR (obj
)->size
;
4607 if (size
& PSEUDOVECTOR_FLAG
)
4608 size
&= PSEUDOVECTOR_SIZE_MASK
;
4609 vec
= XVECTOR (make_pure_vector (size
));
4610 for (i
= 0; i
< size
; i
++)
4611 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4612 if (COMPILEDP (obj
))
4613 XSETCOMPILED (obj
, vec
);
4615 XSETVECTOR (obj
, vec
);
4618 else if (MARKERP (obj
))
4619 error ("Attempt to copy a marker to pure storage");
4626 /***********************************************************************
4628 ***********************************************************************/
4630 /* Put an entry in staticvec, pointing at the variable with address
4634 staticpro (varaddress
)
4635 Lisp_Object
*varaddress
;
4637 staticvec
[staticidx
++] = varaddress
;
4638 if (staticidx
>= NSTATICS
)
4646 struct catchtag
*next
;
4650 /***********************************************************************
4652 ***********************************************************************/
4654 /* Temporarily prevent garbage collection. */
4657 inhibit_garbage_collection ()
4659 int count
= SPECPDL_INDEX ();
4660 int nbits
= min (VALBITS
, BITS_PER_INT
);
4662 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4667 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4668 doc
: /* Reclaim storage for Lisp objects no longer needed.
4669 Garbage collection happens automatically if you cons more than
4670 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4671 `garbage-collect' normally returns a list with info on amount of space in use:
4672 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4673 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4674 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4675 (USED-STRINGS . FREE-STRINGS))
4676 However, if there was overflow in pure space, `garbage-collect'
4677 returns nil, because real GC can't be done. */)
4680 register struct specbinding
*bind
;
4681 struct catchtag
*catch;
4682 struct handler
*handler
;
4683 char stack_top_variable
;
4686 Lisp_Object total
[8];
4687 int count
= SPECPDL_INDEX ();
4688 EMACS_TIME t1
, t2
, t3
;
4693 /* Can't GC if pure storage overflowed because we can't determine
4694 if something is a pure object or not. */
4695 if (pure_bytes_used_before_overflow
)
4700 /* Don't keep undo information around forever.
4701 Do this early on, so it is no problem if the user quits. */
4703 register struct buffer
*nextb
= all_buffers
;
4707 /* If a buffer's undo list is Qt, that means that undo is
4708 turned off in that buffer. Calling truncate_undo_list on
4709 Qt tends to return NULL, which effectively turns undo back on.
4710 So don't call truncate_undo_list if undo_list is Qt. */
4711 if (! NILP (nextb
->name
) && ! EQ (nextb
->undo_list
, Qt
))
4712 truncate_undo_list (nextb
);
4714 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4715 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
))
4717 /* If a buffer's gap size is more than 10% of the buffer
4718 size, or larger than 2000 bytes, then shrink it
4719 accordingly. Keep a minimum size of 20 bytes. */
4720 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4722 if (nextb
->text
->gap_size
> size
)
4724 struct buffer
*save_current
= current_buffer
;
4725 current_buffer
= nextb
;
4726 make_gap (-(nextb
->text
->gap_size
- size
));
4727 current_buffer
= save_current
;
4731 nextb
= nextb
->next
;
4735 EMACS_GET_TIME (t1
);
4737 /* In case user calls debug_print during GC,
4738 don't let that cause a recursive GC. */
4739 consing_since_gc
= 0;
4741 /* Save what's currently displayed in the echo area. */
4742 message_p
= push_message ();
4743 record_unwind_protect (pop_message_unwind
, Qnil
);
4745 /* Save a copy of the contents of the stack, for debugging. */
4746 #if MAX_SAVE_STACK > 0
4747 if (NILP (Vpurify_flag
))
4749 i
= &stack_top_variable
- stack_bottom
;
4751 if (i
< MAX_SAVE_STACK
)
4753 if (stack_copy
== 0)
4754 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
4755 else if (stack_copy_size
< i
)
4756 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
4759 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
4760 bcopy (stack_bottom
, stack_copy
, i
);
4762 bcopy (&stack_top_variable
, stack_copy
, i
);
4766 #endif /* MAX_SAVE_STACK > 0 */
4768 if (garbage_collection_messages
)
4769 message1_nolog ("Garbage collecting...");
4773 shrink_regexp_cache ();
4777 /* clear_marks (); */
4779 /* Mark all the special slots that serve as the roots of accessibility. */
4781 for (i
= 0; i
< staticidx
; i
++)
4782 mark_object (*staticvec
[i
]);
4784 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4786 mark_object (bind
->symbol
);
4787 mark_object (bind
->old_value
);
4793 extern void xg_mark_data ();
4798 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
4799 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
4803 register struct gcpro
*tail
;
4804 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4805 for (i
= 0; i
< tail
->nvars
; i
++)
4806 mark_object (tail
->var
[i
]);
4811 for (catch = catchlist
; catch; catch = catch->next
)
4813 mark_object (catch->tag
);
4814 mark_object (catch->val
);
4816 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
4818 mark_object (handler
->handler
);
4819 mark_object (handler
->var
);
4823 #ifdef HAVE_WINDOW_SYSTEM
4824 mark_fringe_data ();
4827 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4831 /* Everything is now marked, except for the things that require special
4832 finalization, i.e. the undo_list.
4833 Look thru every buffer's undo list
4834 for elements that update markers that were not marked,
4837 register struct buffer
*nextb
= all_buffers
;
4841 /* If a buffer's undo list is Qt, that means that undo is
4842 turned off in that buffer. Calling truncate_undo_list on
4843 Qt tends to return NULL, which effectively turns undo back on.
4844 So don't call truncate_undo_list if undo_list is Qt. */
4845 if (! EQ (nextb
->undo_list
, Qt
))
4847 Lisp_Object tail
, prev
;
4848 tail
= nextb
->undo_list
;
4850 while (CONSP (tail
))
4852 if (GC_CONSP (XCAR (tail
))
4853 && GC_MARKERP (XCAR (XCAR (tail
)))
4854 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
4857 nextb
->undo_list
= tail
= XCDR (tail
);
4861 XSETCDR (prev
, tail
);
4871 /* Now that we have stripped the elements that need not be in the
4872 undo_list any more, we can finally mark the list. */
4873 mark_object (nextb
->undo_list
);
4875 nextb
= nextb
->next
;
4881 /* Clear the mark bits that we set in certain root slots. */
4883 unmark_byte_stack ();
4884 VECTOR_UNMARK (&buffer_defaults
);
4885 VECTOR_UNMARK (&buffer_local_symbols
);
4887 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
4895 /* clear_marks (); */
4898 consing_since_gc
= 0;
4899 if (gc_cons_threshold
< 10000)
4900 gc_cons_threshold
= 10000;
4902 gc_cons_combined_threshold
= gc_cons_threshold
;
4904 if (FLOATP (Vgc_cons_percentage
))
4905 { /* Set gc_cons_combined_threshold. */
4906 EMACS_INT total
= 0;
4907 EMACS_INT threshold
;
4908 total
+= total_conses
* sizeof (struct Lisp_Cons
);
4909 total
+= total_symbols
* sizeof (struct Lisp_Symbol
);
4910 total
+= total_markers
* sizeof (union Lisp_Misc
);
4911 total
+= total_string_size
;
4912 total
+= total_vector_size
* sizeof (Lisp_Object
);
4913 total
+= total_floats
* sizeof (struct Lisp_Float
);
4914 total
+= total_intervals
* sizeof (struct interval
);
4915 total
+= total_strings
* sizeof (struct Lisp_String
);
4917 threshold
= total
* XFLOAT_DATA (Vgc_cons_percentage
);
4918 if (threshold
> gc_cons_combined_threshold
)
4919 gc_cons_combined_threshold
= threshold
;
4922 if (garbage_collection_messages
)
4924 if (message_p
|| minibuf_level
> 0)
4927 message1_nolog ("Garbage collecting...done");
4930 unbind_to (count
, Qnil
);
4932 total
[0] = Fcons (make_number (total_conses
),
4933 make_number (total_free_conses
));
4934 total
[1] = Fcons (make_number (total_symbols
),
4935 make_number (total_free_symbols
));
4936 total
[2] = Fcons (make_number (total_markers
),
4937 make_number (total_free_markers
));
4938 total
[3] = make_number (total_string_size
);
4939 total
[4] = make_number (total_vector_size
);
4940 total
[5] = Fcons (make_number (total_floats
),
4941 make_number (total_free_floats
));
4942 total
[6] = Fcons (make_number (total_intervals
),
4943 make_number (total_free_intervals
));
4944 total
[7] = Fcons (make_number (total_strings
),
4945 make_number (total_free_strings
));
4947 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4949 /* Compute average percentage of zombies. */
4952 for (i
= 0; i
< 7; ++i
)
4953 if (CONSP (total
[i
]))
4954 nlive
+= XFASTINT (XCAR (total
[i
]));
4956 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
4957 max_live
= max (nlive
, max_live
);
4958 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
4959 max_zombies
= max (nzombies
, max_zombies
);
4964 if (!NILP (Vpost_gc_hook
))
4966 int count
= inhibit_garbage_collection ();
4967 safe_run_hooks (Qpost_gc_hook
);
4968 unbind_to (count
, Qnil
);
4971 /* Accumulate statistics. */
4972 EMACS_GET_TIME (t2
);
4973 EMACS_SUB_TIME (t3
, t2
, t1
);
4974 if (FLOATP (Vgc_elapsed
))
4975 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
4977 EMACS_USECS (t3
) * 1.0e-6);
4980 return Flist (sizeof total
/ sizeof *total
, total
);
4984 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
4985 only interesting objects referenced from glyphs are strings. */
4988 mark_glyph_matrix (matrix
)
4989 struct glyph_matrix
*matrix
;
4991 struct glyph_row
*row
= matrix
->rows
;
4992 struct glyph_row
*end
= row
+ matrix
->nrows
;
4994 for (; row
< end
; ++row
)
4998 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5000 struct glyph
*glyph
= row
->glyphs
[area
];
5001 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5003 for (; glyph
< end_glyph
; ++glyph
)
5004 if (GC_STRINGP (glyph
->object
)
5005 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5006 mark_object (glyph
->object
);
5012 /* Mark Lisp faces in the face cache C. */
5016 struct face_cache
*c
;
5021 for (i
= 0; i
< c
->used
; ++i
)
5023 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5027 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5028 mark_object (face
->lface
[j
]);
5035 #ifdef HAVE_WINDOW_SYSTEM
5037 /* Mark Lisp objects in image IMG. */
5043 mark_object (img
->spec
);
5045 if (!NILP (img
->data
.lisp_val
))
5046 mark_object (img
->data
.lisp_val
);
5050 /* Mark Lisp objects in image cache of frame F. It's done this way so
5051 that we don't have to include xterm.h here. */
5054 mark_image_cache (f
)
5057 forall_images_in_image_cache (f
, mark_image
);
5060 #endif /* HAVE_X_WINDOWS */
5064 /* Mark reference to a Lisp_Object.
5065 If the object referred to has not been seen yet, recursively mark
5066 all the references contained in it. */
5068 #define LAST_MARKED_SIZE 500
5069 Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5070 int last_marked_index
;
5072 /* For debugging--call abort when we cdr down this many
5073 links of a list, in mark_object. In debugging,
5074 the call to abort will hit a breakpoint.
5075 Normally this is zero and the check never goes off. */
5076 int mark_object_loop_halt
;
5082 register Lisp_Object obj
= arg
;
5083 #ifdef GC_CHECK_MARKED_OBJECTS
5091 if (PURE_POINTER_P (XPNTR (obj
)))
5094 last_marked
[last_marked_index
++] = obj
;
5095 if (last_marked_index
== LAST_MARKED_SIZE
)
5096 last_marked_index
= 0;
5098 /* Perform some sanity checks on the objects marked here. Abort if
5099 we encounter an object we know is bogus. This increases GC time
5100 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5101 #ifdef GC_CHECK_MARKED_OBJECTS
5103 po
= (void *) XPNTR (obj
);
5105 /* Check that the object pointed to by PO is known to be a Lisp
5106 structure allocated from the heap. */
5107 #define CHECK_ALLOCATED() \
5109 m = mem_find (po); \
5114 /* Check that the object pointed to by PO is live, using predicate
5116 #define CHECK_LIVE(LIVEP) \
5118 if (!LIVEP (m, po)) \
5122 /* Check both of the above conditions. */
5123 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5125 CHECK_ALLOCATED (); \
5126 CHECK_LIVE (LIVEP); \
5129 #else /* not GC_CHECK_MARKED_OBJECTS */
5131 #define CHECK_ALLOCATED() (void) 0
5132 #define CHECK_LIVE(LIVEP) (void) 0
5133 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5135 #endif /* not GC_CHECK_MARKED_OBJECTS */
5137 switch (SWITCH_ENUM_CAST (XGCTYPE (obj
)))
5141 register struct Lisp_String
*ptr
= XSTRING (obj
);
5142 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5143 MARK_INTERVAL_TREE (ptr
->intervals
);
5145 #ifdef GC_CHECK_STRING_BYTES
5146 /* Check that the string size recorded in the string is the
5147 same as the one recorded in the sdata structure. */
5148 CHECK_STRING_BYTES (ptr
);
5149 #endif /* GC_CHECK_STRING_BYTES */
5153 case Lisp_Vectorlike
:
5154 #ifdef GC_CHECK_MARKED_OBJECTS
5156 if (m
== MEM_NIL
&& !GC_SUBRP (obj
)
5157 && po
!= &buffer_defaults
5158 && po
!= &buffer_local_symbols
)
5160 #endif /* GC_CHECK_MARKED_OBJECTS */
5162 if (GC_BUFFERP (obj
))
5164 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
5166 #ifdef GC_CHECK_MARKED_OBJECTS
5167 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5170 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
5175 #endif /* GC_CHECK_MARKED_OBJECTS */
5179 else if (GC_SUBRP (obj
))
5181 else if (GC_COMPILEDP (obj
))
5182 /* We could treat this just like a vector, but it is better to
5183 save the COMPILED_CONSTANTS element for last and avoid
5186 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5187 register EMACS_INT size
= ptr
->size
;
5190 if (VECTOR_MARKED_P (ptr
))
5191 break; /* Already marked */
5193 CHECK_LIVE (live_vector_p
);
5194 VECTOR_MARK (ptr
); /* Else mark it */
5195 size
&= PSEUDOVECTOR_SIZE_MASK
;
5196 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5198 if (i
!= COMPILED_CONSTANTS
)
5199 mark_object (ptr
->contents
[i
]);
5201 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5204 else if (GC_FRAMEP (obj
))
5206 register struct frame
*ptr
= XFRAME (obj
);
5208 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
5209 VECTOR_MARK (ptr
); /* Else mark it */
5211 CHECK_LIVE (live_vector_p
);
5212 mark_object (ptr
->name
);
5213 mark_object (ptr
->icon_name
);
5214 mark_object (ptr
->title
);
5215 mark_object (ptr
->focus_frame
);
5216 mark_object (ptr
->selected_window
);
5217 mark_object (ptr
->minibuffer_window
);
5218 mark_object (ptr
->param_alist
);
5219 mark_object (ptr
->scroll_bars
);
5220 mark_object (ptr
->condemned_scroll_bars
);
5221 mark_object (ptr
->menu_bar_items
);
5222 mark_object (ptr
->face_alist
);
5223 mark_object (ptr
->menu_bar_vector
);
5224 mark_object (ptr
->buffer_predicate
);
5225 mark_object (ptr
->buffer_list
);
5226 mark_object (ptr
->menu_bar_window
);
5227 mark_object (ptr
->tool_bar_window
);
5228 mark_face_cache (ptr
->face_cache
);
5229 #ifdef HAVE_WINDOW_SYSTEM
5230 mark_image_cache (ptr
);
5231 mark_object (ptr
->tool_bar_items
);
5232 mark_object (ptr
->desired_tool_bar_string
);
5233 mark_object (ptr
->current_tool_bar_string
);
5234 #endif /* HAVE_WINDOW_SYSTEM */
5236 else if (GC_BOOL_VECTOR_P (obj
))
5238 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5240 if (VECTOR_MARKED_P (ptr
))
5241 break; /* Already marked */
5242 CHECK_LIVE (live_vector_p
);
5243 VECTOR_MARK (ptr
); /* Else mark it */
5245 else if (GC_WINDOWP (obj
))
5247 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5248 struct window
*w
= XWINDOW (obj
);
5251 /* Stop if already marked. */
5252 if (VECTOR_MARKED_P (ptr
))
5256 CHECK_LIVE (live_vector_p
);
5259 /* There is no Lisp data above The member CURRENT_MATRIX in
5260 struct WINDOW. Stop marking when that slot is reached. */
5262 (char *) &ptr
->contents
[i
] < (char *) &w
->current_matrix
;
5264 mark_object (ptr
->contents
[i
]);
5266 /* Mark glyphs for leaf windows. Marking window matrices is
5267 sufficient because frame matrices use the same glyph
5269 if (NILP (w
->hchild
)
5271 && w
->current_matrix
)
5273 mark_glyph_matrix (w
->current_matrix
);
5274 mark_glyph_matrix (w
->desired_matrix
);
5277 else if (GC_HASH_TABLE_P (obj
))
5279 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5281 /* Stop if already marked. */
5282 if (VECTOR_MARKED_P (h
))
5286 CHECK_LIVE (live_vector_p
);
5289 /* Mark contents. */
5290 /* Do not mark next_free or next_weak.
5291 Being in the next_weak chain
5292 should not keep the hash table alive.
5293 No need to mark `count' since it is an integer. */
5294 mark_object (h
->test
);
5295 mark_object (h
->weak
);
5296 mark_object (h
->rehash_size
);
5297 mark_object (h
->rehash_threshold
);
5298 mark_object (h
->hash
);
5299 mark_object (h
->next
);
5300 mark_object (h
->index
);
5301 mark_object (h
->user_hash_function
);
5302 mark_object (h
->user_cmp_function
);
5304 /* If hash table is not weak, mark all keys and values.
5305 For weak tables, mark only the vector. */
5306 if (GC_NILP (h
->weak
))
5307 mark_object (h
->key_and_value
);
5309 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5313 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5314 register EMACS_INT size
= ptr
->size
;
5317 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
5318 CHECK_LIVE (live_vector_p
);
5319 VECTOR_MARK (ptr
); /* Else mark it */
5320 if (size
& PSEUDOVECTOR_FLAG
)
5321 size
&= PSEUDOVECTOR_SIZE_MASK
;
5323 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5324 mark_object (ptr
->contents
[i
]);
5330 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5331 struct Lisp_Symbol
*ptrx
;
5333 if (ptr
->gcmarkbit
) break;
5334 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5336 mark_object (ptr
->value
);
5337 mark_object (ptr
->function
);
5338 mark_object (ptr
->plist
);
5340 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5341 MARK_STRING (XSTRING (ptr
->xname
));
5342 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5344 /* Note that we do not mark the obarray of the symbol.
5345 It is safe not to do so because nothing accesses that
5346 slot except to check whether it is nil. */
5350 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5351 XSETSYMBOL (obj
, ptrx
);
5358 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5359 if (XMARKER (obj
)->gcmarkbit
)
5361 XMARKER (obj
)->gcmarkbit
= 1;
5363 switch (XMISCTYPE (obj
))
5365 case Lisp_Misc_Buffer_Local_Value
:
5366 case Lisp_Misc_Some_Buffer_Local_Value
:
5368 register struct Lisp_Buffer_Local_Value
*ptr
5369 = XBUFFER_LOCAL_VALUE (obj
);
5370 /* If the cdr is nil, avoid recursion for the car. */
5371 if (EQ (ptr
->cdr
, Qnil
))
5373 obj
= ptr
->realvalue
;
5376 mark_object (ptr
->realvalue
);
5377 mark_object (ptr
->buffer
);
5378 mark_object (ptr
->frame
);
5383 case Lisp_Misc_Marker
:
5384 /* DO NOT mark thru the marker's chain.
5385 The buffer's markers chain does not preserve markers from gc;
5386 instead, markers are removed from the chain when freed by gc. */
5389 case Lisp_Misc_Intfwd
:
5390 case Lisp_Misc_Boolfwd
:
5391 case Lisp_Misc_Objfwd
:
5392 case Lisp_Misc_Buffer_Objfwd
:
5393 case Lisp_Misc_Kboard_Objfwd
:
5394 /* Don't bother with Lisp_Buffer_Objfwd,
5395 since all markable slots in current buffer marked anyway. */
5396 /* Don't need to do Lisp_Objfwd, since the places they point
5397 are protected with staticpro. */
5400 case Lisp_Misc_Save_Value
:
5403 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5404 /* If DOGC is set, POINTER is the address of a memory
5405 area containing INTEGER potential Lisp_Objects. */
5408 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5410 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5411 mark_maybe_object (*p
);
5417 case Lisp_Misc_Overlay
:
5419 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5420 mark_object (ptr
->start
);
5421 mark_object (ptr
->end
);
5422 mark_object (ptr
->plist
);
5425 XSETMISC (obj
, ptr
->next
);
5438 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5439 if (CONS_MARKED_P (ptr
)) break;
5440 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5442 /* If the cdr is nil, avoid recursion for the car. */
5443 if (EQ (ptr
->cdr
, Qnil
))
5449 mark_object (ptr
->car
);
5452 if (cdr_count
== mark_object_loop_halt
)
5458 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5459 FLOAT_MARK (XFLOAT (obj
));
5470 #undef CHECK_ALLOCATED
5471 #undef CHECK_ALLOCATED_AND_LIVE
5474 /* Mark the pointers in a buffer structure. */
5480 register struct buffer
*buffer
= XBUFFER (buf
);
5481 register Lisp_Object
*ptr
, tmp
;
5482 Lisp_Object base_buffer
;
5484 VECTOR_MARK (buffer
);
5486 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5488 /* For now, we just don't mark the undo_list. It's done later in
5489 a special way just before the sweep phase, and after stripping
5490 some of its elements that are not needed any more. */
5492 if (buffer
->overlays_before
)
5494 XSETMISC (tmp
, buffer
->overlays_before
);
5497 if (buffer
->overlays_after
)
5499 XSETMISC (tmp
, buffer
->overlays_after
);
5503 for (ptr
= &buffer
->name
;
5504 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5508 /* If this is an indirect buffer, mark its base buffer. */
5509 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5511 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5512 mark_buffer (base_buffer
);
5517 /* Value is non-zero if OBJ will survive the current GC because it's
5518 either marked or does not need to be marked to survive. */
5526 switch (XGCTYPE (obj
))
5533 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5537 survives_p
= XMARKER (obj
)->gcmarkbit
;
5541 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5544 case Lisp_Vectorlike
:
5545 survives_p
= GC_SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5549 survives_p
= CONS_MARKED_P (XCONS (obj
));
5553 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5560 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5565 /* Sweep: find all structures not marked, and free them. */
5570 /* Remove or mark entries in weak hash tables.
5571 This must be done before any object is unmarked. */
5572 sweep_weak_hash_tables ();
5575 #ifdef GC_CHECK_STRING_BYTES
5576 if (!noninteractive
)
5577 check_string_bytes (1);
5580 /* Put all unmarked conses on free list */
5582 register struct cons_block
*cblk
;
5583 struct cons_block
**cprev
= &cons_block
;
5584 register int lim
= cons_block_index
;
5585 register int num_free
= 0, num_used
= 0;
5589 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5593 for (i
= 0; i
< lim
; i
++)
5594 if (!CONS_MARKED_P (&cblk
->conses
[i
]))
5597 *(struct Lisp_Cons
**)&cblk
->conses
[i
].cdr
= cons_free_list
;
5598 cons_free_list
= &cblk
->conses
[i
];
5600 cons_free_list
->car
= Vdead
;
5606 CONS_UNMARK (&cblk
->conses
[i
]);
5608 lim
= CONS_BLOCK_SIZE
;
5609 /* If this block contains only free conses and we have already
5610 seen more than two blocks worth of free conses then deallocate
5612 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5614 *cprev
= cblk
->next
;
5615 /* Unhook from the free list. */
5616 cons_free_list
= *(struct Lisp_Cons
**) &cblk
->conses
[0].cdr
;
5617 lisp_align_free (cblk
);
5622 num_free
+= this_free
;
5623 cprev
= &cblk
->next
;
5626 total_conses
= num_used
;
5627 total_free_conses
= num_free
;
5630 /* Put all unmarked floats on free list */
5632 register struct float_block
*fblk
;
5633 struct float_block
**fprev
= &float_block
;
5634 register int lim
= float_block_index
;
5635 register int num_free
= 0, num_used
= 0;
5637 float_free_list
= 0;
5639 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5643 for (i
= 0; i
< lim
; i
++)
5644 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5647 *(struct Lisp_Float
**)&fblk
->floats
[i
].data
= float_free_list
;
5648 float_free_list
= &fblk
->floats
[i
];
5653 FLOAT_UNMARK (&fblk
->floats
[i
]);
5655 lim
= FLOAT_BLOCK_SIZE
;
5656 /* If this block contains only free floats and we have already
5657 seen more than two blocks worth of free floats then deallocate
5659 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5661 *fprev
= fblk
->next
;
5662 /* Unhook from the free list. */
5663 float_free_list
= *(struct Lisp_Float
**) &fblk
->floats
[0].data
;
5664 lisp_align_free (fblk
);
5669 num_free
+= this_free
;
5670 fprev
= &fblk
->next
;
5673 total_floats
= num_used
;
5674 total_free_floats
= num_free
;
5677 /* Put all unmarked intervals on free list */
5679 register struct interval_block
*iblk
;
5680 struct interval_block
**iprev
= &interval_block
;
5681 register int lim
= interval_block_index
;
5682 register int num_free
= 0, num_used
= 0;
5684 interval_free_list
= 0;
5686 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5691 for (i
= 0; i
< lim
; i
++)
5693 if (!iblk
->intervals
[i
].gcmarkbit
)
5695 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5696 interval_free_list
= &iblk
->intervals
[i
];
5702 iblk
->intervals
[i
].gcmarkbit
= 0;
5705 lim
= INTERVAL_BLOCK_SIZE
;
5706 /* If this block contains only free intervals and we have already
5707 seen more than two blocks worth of free intervals then
5708 deallocate this block. */
5709 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5711 *iprev
= iblk
->next
;
5712 /* Unhook from the free list. */
5713 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5715 n_interval_blocks
--;
5719 num_free
+= this_free
;
5720 iprev
= &iblk
->next
;
5723 total_intervals
= num_used
;
5724 total_free_intervals
= num_free
;
5727 /* Put all unmarked symbols on free list */
5729 register struct symbol_block
*sblk
;
5730 struct symbol_block
**sprev
= &symbol_block
;
5731 register int lim
= symbol_block_index
;
5732 register int num_free
= 0, num_used
= 0;
5734 symbol_free_list
= NULL
;
5736 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5739 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5740 struct Lisp_Symbol
*end
= sym
+ lim
;
5742 for (; sym
< end
; ++sym
)
5744 /* Check if the symbol was created during loadup. In such a case
5745 it might be pointed to by pure bytecode which we don't trace,
5746 so we conservatively assume that it is live. */
5747 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5749 if (!sym
->gcmarkbit
&& !pure_p
)
5751 *(struct Lisp_Symbol
**) &sym
->value
= symbol_free_list
;
5752 symbol_free_list
= sym
;
5754 symbol_free_list
->function
= Vdead
;
5762 UNMARK_STRING (XSTRING (sym
->xname
));
5767 lim
= SYMBOL_BLOCK_SIZE
;
5768 /* If this block contains only free symbols and we have already
5769 seen more than two blocks worth of free symbols then deallocate
5771 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5773 *sprev
= sblk
->next
;
5774 /* Unhook from the free list. */
5775 symbol_free_list
= *(struct Lisp_Symbol
**)&sblk
->symbols
[0].value
;
5781 num_free
+= this_free
;
5782 sprev
= &sblk
->next
;
5785 total_symbols
= num_used
;
5786 total_free_symbols
= num_free
;
5789 /* Put all unmarked misc's on free list.
5790 For a marker, first unchain it from the buffer it points into. */
5792 register struct marker_block
*mblk
;
5793 struct marker_block
**mprev
= &marker_block
;
5794 register int lim
= marker_block_index
;
5795 register int num_free
= 0, num_used
= 0;
5797 marker_free_list
= 0;
5799 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5804 for (i
= 0; i
< lim
; i
++)
5806 if (!mblk
->markers
[i
].u_marker
.gcmarkbit
)
5808 if (mblk
->markers
[i
].u_marker
.type
== Lisp_Misc_Marker
)
5809 unchain_marker (&mblk
->markers
[i
].u_marker
);
5810 /* Set the type of the freed object to Lisp_Misc_Free.
5811 We could leave the type alone, since nobody checks it,
5812 but this might catch bugs faster. */
5813 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
5814 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
5815 marker_free_list
= &mblk
->markers
[i
];
5821 mblk
->markers
[i
].u_marker
.gcmarkbit
= 0;
5824 lim
= MARKER_BLOCK_SIZE
;
5825 /* If this block contains only free markers and we have already
5826 seen more than two blocks worth of free markers then deallocate
5828 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
5830 *mprev
= mblk
->next
;
5831 /* Unhook from the free list. */
5832 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
5838 num_free
+= this_free
;
5839 mprev
= &mblk
->next
;
5843 total_markers
= num_used
;
5844 total_free_markers
= num_free
;
5847 /* Free all unmarked buffers */
5849 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
5852 if (!VECTOR_MARKED_P (buffer
))
5855 prev
->next
= buffer
->next
;
5857 all_buffers
= buffer
->next
;
5858 next
= buffer
->next
;
5864 VECTOR_UNMARK (buffer
);
5865 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
5866 prev
= buffer
, buffer
= buffer
->next
;
5870 /* Free all unmarked vectors */
5872 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
5873 total_vector_size
= 0;
5876 if (!VECTOR_MARKED_P (vector
))
5879 prev
->next
= vector
->next
;
5881 all_vectors
= vector
->next
;
5882 next
= vector
->next
;
5890 VECTOR_UNMARK (vector
);
5891 if (vector
->size
& PSEUDOVECTOR_FLAG
)
5892 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
5894 total_vector_size
+= vector
->size
;
5895 prev
= vector
, vector
= vector
->next
;
5899 #ifdef GC_CHECK_STRING_BYTES
5900 if (!noninteractive
)
5901 check_string_bytes (1);
5908 /* Debugging aids. */
5910 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
5911 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
5912 This may be helpful in debugging Emacs's memory usage.
5913 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
5918 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
5923 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
5924 doc
: /* Return a list of counters that measure how much consing there has been.
5925 Each of these counters increments for a certain kind of object.
5926 The counters wrap around from the largest positive integer to zero.
5927 Garbage collection does not decrease them.
5928 The elements of the value are as follows:
5929 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
5930 All are in units of 1 = one object consed
5931 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
5933 MISCS include overlays, markers, and some internal types.
5934 Frames, windows, buffers, and subprocesses count as vectors
5935 (but the contents of a buffer's text do not count here). */)
5938 Lisp_Object consed
[8];
5940 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
5941 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
5942 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
5943 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
5944 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
5945 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
5946 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
5947 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
5949 return Flist (8, consed
);
5952 int suppress_checking
;
5954 die (msg
, file
, line
)
5959 fprintf (stderr
, "\r\nEmacs fatal error: %s:%d: %s\r\n",
5964 /* Initialization */
5969 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
5971 pure_size
= PURESIZE
;
5972 pure_bytes_used
= 0;
5973 pure_bytes_used_before_overflow
= 0;
5975 /* Initialize the list of free aligned blocks. */
5978 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
5980 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
5984 ignore_warnings
= 1;
5985 #ifdef DOUG_LEA_MALLOC
5986 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
5987 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
5988 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
5998 malloc_hysteresis
= 32;
6000 malloc_hysteresis
= 0;
6003 spare_memory
= (char *) malloc (SPARE_MEMORY
);
6005 ignore_warnings
= 0;
6007 byte_stack_list
= 0;
6009 consing_since_gc
= 0;
6010 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6011 gc_cons_combined_threshold
= gc_cons_threshold
;
6012 #ifdef VIRT_ADDR_VARIES
6013 malloc_sbrk_unused
= 1<<22; /* A large number */
6014 malloc_sbrk_used
= 100000; /* as reasonable as any number */
6015 #endif /* VIRT_ADDR_VARIES */
6022 byte_stack_list
= 0;
6024 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6025 setjmp_tested_p
= longjmps_done
= 0;
6028 Vgc_elapsed
= make_float (0.0);
6035 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
6036 doc
: /* *Number of bytes of consing between garbage collections.
6037 Garbage collection can happen automatically once this many bytes have been
6038 allocated since the last garbage collection. All data types count.
6040 Garbage collection happens automatically only when `eval' is called.
6042 By binding this temporarily to a large number, you can effectively
6043 prevent garbage collection during a part of the program.
6044 See also `gc-cons-percentage'. */);
6046 DEFVAR_LISP ("gc-cons-percentage", &Vgc_cons_percentage
,
6047 doc
: /* *Portion of the heap used for allocation.
6048 Garbage collection can happen automatically once this portion of the heap
6049 has been allocated since the last garbage collection.
6050 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6051 Vgc_cons_percentage
= make_float (0.1);
6053 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
6054 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6056 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
6057 doc
: /* Number of cons cells that have been consed so far. */);
6059 DEFVAR_INT ("floats-consed", &floats_consed
,
6060 doc
: /* Number of floats that have been consed so far. */);
6062 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
6063 doc
: /* Number of vector cells that have been consed so far. */);
6065 DEFVAR_INT ("symbols-consed", &symbols_consed
,
6066 doc
: /* Number of symbols that have been consed so far. */);
6068 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
6069 doc
: /* Number of string characters that have been consed so far. */);
6071 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
6072 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6074 DEFVAR_INT ("intervals-consed", &intervals_consed
,
6075 doc
: /* Number of intervals that have been consed so far. */);
6077 DEFVAR_INT ("strings-consed", &strings_consed
,
6078 doc
: /* Number of strings that have been consed so far. */);
6080 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
6081 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6082 This means that certain objects should be allocated in shared (pure) space. */);
6084 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
6085 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6086 garbage_collection_messages
= 0;
6088 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
6089 doc
: /* Hook run after garbage collection has finished. */);
6090 Vpost_gc_hook
= Qnil
;
6091 Qpost_gc_hook
= intern ("post-gc-hook");
6092 staticpro (&Qpost_gc_hook
);
6094 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
6095 doc
: /* Precomputed `signal' argument for memory-full error. */);
6096 /* We build this in advance because if we wait until we need it, we might
6097 not be able to allocate the memory to hold it. */
6100 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
6102 DEFVAR_LISP ("memory-full", &Vmemory_full
,
6103 doc
: /* Non-nil means we are handling a memory-full error. */);
6104 Vmemory_full
= Qnil
;
6106 staticpro (&Qgc_cons_threshold
);
6107 Qgc_cons_threshold
= intern ("gc-cons-threshold");
6109 staticpro (&Qchar_table_extra_slots
);
6110 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
6112 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
6113 doc
: /* Accumulated time elapsed in garbage collections.
6114 The time is in seconds as a floating point value. */);
6115 DEFVAR_INT ("gcs-done", &gcs_done
,
6116 doc
: /* Accumulated number of garbage collections done. */);
6118 defsubr (&Smemory_full_p
);
6122 defsubr (&Smake_byte_code
);
6123 defsubr (&Smake_list
);
6124 defsubr (&Smake_vector
);
6125 defsubr (&Smake_char_table
);
6126 defsubr (&Smake_string
);
6127 defsubr (&Smake_bool_vector
);
6128 defsubr (&Smake_symbol
);
6129 defsubr (&Smake_marker
);
6130 defsubr (&Spurecopy
);
6131 defsubr (&Sgarbage_collect
);
6132 defsubr (&Smemory_limit
);
6133 defsubr (&Smemory_use_counts
);
6135 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6136 defsubr (&Sgc_status
);
6140 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
6141 (do not change this comment) */