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"
52 #include "character.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 ();
70 #define INCLUDED_FCNTL
77 #ifdef DOUG_LEA_MALLOC
80 /* malloc.h #defines this as size_t, at least in glibc2. */
81 #ifndef __malloc_size_t
82 #define __malloc_size_t int
85 /* Specify maximum number of areas to mmap. It would be nice to use a
86 value that explicitly means "no limit". */
88 #define MMAP_MAX_AREAS 100000000
90 #else /* not DOUG_LEA_MALLOC */
92 /* The following come from gmalloc.c. */
94 #define __malloc_size_t size_t
95 extern __malloc_size_t _bytes_used
;
96 extern __malloc_size_t __malloc_extra_blocks
;
98 #endif /* not DOUG_LEA_MALLOC */
100 #if ! defined (SYSTEM_MALLOC) && defined (HAVE_GTK_AND_PTHREAD)
102 /* When GTK uses the file chooser dialog, different backends can be loaded
103 dynamically. One such a backend is the Gnome VFS backend that gets loaded
104 if you run Gnome. That backend creates several threads and also allocates
107 If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_*
108 functions below are called from malloc, there is a chance that one
109 of these threads preempts the Emacs main thread and the hook variables
110 end up in an inconsistent state. So we have a mutex to prevent that (note
111 that the backend handles concurrent access to malloc within its own threads
112 but Emacs code running in the main thread is not included in that control).
114 When UNBLOCK_INPUT is called, reinvoke_input_signal may be called. If this
115 happens in one of the backend threads we will have two threads that tries
116 to run Emacs code at once, and the code is not prepared for that.
117 To prevent that, we only call BLOCK/UNBLOCK from the main thread. */
119 static pthread_mutex_t alloc_mutex
;
121 #define BLOCK_INPUT_ALLOC \
124 pthread_mutex_lock (&alloc_mutex); \
125 if (pthread_self () == main_thread) \
129 #define UNBLOCK_INPUT_ALLOC \
132 if (pthread_self () == main_thread) \
134 pthread_mutex_unlock (&alloc_mutex); \
138 #else /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
140 #define BLOCK_INPUT_ALLOC BLOCK_INPUT
141 #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT
143 #endif /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
145 /* Value of _bytes_used, when spare_memory was freed. */
147 static __malloc_size_t bytes_used_when_full
;
149 static __malloc_size_t bytes_used_when_reconsidered
;
151 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
152 to a struct Lisp_String. */
154 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
155 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
156 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
158 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
159 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
160 #define VECTOR_MARKED_P(V) (((V)->size & ARRAY_MARK_FLAG) != 0)
162 /* Value is the number of bytes/chars of S, a pointer to a struct
163 Lisp_String. This must be used instead of STRING_BYTES (S) or
164 S->size during GC, because S->size contains the mark bit for
167 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
168 #define GC_STRING_CHARS(S) ((S)->size & ~ARRAY_MARK_FLAG)
170 /* Number of bytes of consing done since the last gc. */
172 int consing_since_gc
;
174 /* Count the amount of consing of various sorts of space. */
176 EMACS_INT cons_cells_consed
;
177 EMACS_INT floats_consed
;
178 EMACS_INT vector_cells_consed
;
179 EMACS_INT symbols_consed
;
180 EMACS_INT string_chars_consed
;
181 EMACS_INT misc_objects_consed
;
182 EMACS_INT intervals_consed
;
183 EMACS_INT strings_consed
;
185 /* Minimum number of bytes of consing since GC before next GC. */
187 EMACS_INT gc_cons_threshold
;
189 /* Similar minimum, computed from Vgc_cons_percentage. */
191 EMACS_INT gc_relative_threshold
;
193 static Lisp_Object Vgc_cons_percentage
;
195 /* Minimum number of bytes of consing since GC before next GC,
196 when memory is full. */
198 EMACS_INT memory_full_cons_threshold
;
200 /* Nonzero during GC. */
204 /* Nonzero means abort if try to GC.
205 This is for code which is written on the assumption that
206 no GC will happen, so as to verify that assumption. */
210 /* Nonzero means display messages at beginning and end of GC. */
212 int garbage_collection_messages
;
214 #ifndef VIRT_ADDR_VARIES
216 #endif /* VIRT_ADDR_VARIES */
217 int malloc_sbrk_used
;
219 #ifndef VIRT_ADDR_VARIES
221 #endif /* VIRT_ADDR_VARIES */
222 int malloc_sbrk_unused
;
224 /* Number of live and free conses etc. */
226 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
227 static int total_free_conses
, total_free_markers
, total_free_symbols
;
228 static int total_free_floats
, total_floats
;
230 /* Points to memory space allocated as "spare", to be freed if we run
231 out of memory. We keep one large block, four cons-blocks, and
232 two string blocks. */
234 char *spare_memory
[7];
236 /* Amount of spare memory to keep in large reserve block. */
238 #define SPARE_MEMORY (1 << 14)
240 /* Number of extra blocks malloc should get when it needs more core. */
242 static int malloc_hysteresis
;
244 /* Non-nil means defun should do purecopy on the function definition. */
246 Lisp_Object Vpurify_flag
;
248 /* Non-nil means we are handling a memory-full error. */
250 Lisp_Object Vmemory_full
;
254 /* Initialize it to a nonzero value to force it into data space
255 (rather than bss space). That way unexec will remap it into text
256 space (pure), on some systems. We have not implemented the
257 remapping on more recent systems because this is less important
258 nowadays than in the days of small memories and timesharing. */
260 EMACS_INT pure
[PURESIZE
/ sizeof (EMACS_INT
)] = {1,};
261 #define PUREBEG (char *) pure
265 #define pure PURE_SEG_BITS /* Use shared memory segment */
266 #define PUREBEG (char *)PURE_SEG_BITS
268 #endif /* HAVE_SHM */
270 /* Pointer to the pure area, and its size. */
272 static char *purebeg
;
273 static size_t pure_size
;
275 /* Number of bytes of pure storage used before pure storage overflowed.
276 If this is non-zero, this implies that an overflow occurred. */
278 static size_t pure_bytes_used_before_overflow
;
280 /* Value is non-zero if P points into pure space. */
282 #define PURE_POINTER_P(P) \
283 (((PNTR_COMPARISON_TYPE) (P) \
284 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
285 && ((PNTR_COMPARISON_TYPE) (P) \
286 >= (PNTR_COMPARISON_TYPE) purebeg))
288 /* Index in pure at which next pure object will be allocated.. */
290 EMACS_INT pure_bytes_used
;
292 /* If nonzero, this is a warning delivered by malloc and not yet
295 char *pending_malloc_warning
;
297 /* Pre-computed signal argument for use when memory is exhausted. */
299 Lisp_Object Vmemory_signal_data
;
301 /* Maximum amount of C stack to save when a GC happens. */
303 #ifndef MAX_SAVE_STACK
304 #define MAX_SAVE_STACK 16000
307 /* Buffer in which we save a copy of the C stack at each GC. */
312 /* Non-zero means ignore malloc warnings. Set during initialization.
313 Currently not used. */
317 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
319 /* Hook run after GC has finished. */
321 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
323 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
324 EMACS_INT gcs_done
; /* accumulated GCs */
326 static void mark_buffer
P_ ((Lisp_Object
));
327 extern void mark_kboards
P_ ((void));
328 extern void mark_backtrace
P_ ((void));
329 static void gc_sweep
P_ ((void));
330 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
331 static void mark_face_cache
P_ ((struct face_cache
*));
333 #ifdef HAVE_WINDOW_SYSTEM
334 extern void mark_fringe_data
P_ ((void));
335 static void mark_image
P_ ((struct image
*));
336 static void mark_image_cache
P_ ((struct frame
*));
337 #endif /* HAVE_WINDOW_SYSTEM */
339 static struct Lisp_String
*allocate_string
P_ ((void));
340 static void compact_small_strings
P_ ((void));
341 static void free_large_strings
P_ ((void));
342 static void sweep_strings
P_ ((void));
344 extern int message_enable_multibyte
;
346 /* When scanning the C stack for live Lisp objects, Emacs keeps track
347 of what memory allocated via lisp_malloc is intended for what
348 purpose. This enumeration specifies the type of memory. */
359 /* Keep the following vector-like types together, with
360 MEM_TYPE_WINDOW being the last, and MEM_TYPE_VECTOR the
361 first. Or change the code of live_vector_p, for instance. */
369 static POINTER_TYPE
*lisp_align_malloc
P_ ((size_t, enum mem_type
));
370 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
371 void refill_memory_reserve ();
374 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
376 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
377 #include <stdio.h> /* For fprintf. */
380 /* A unique object in pure space used to make some Lisp objects
381 on free lists recognizable in O(1). */
385 #ifdef GC_MALLOC_CHECK
387 enum mem_type allocated_mem_type
;
388 int dont_register_blocks
;
390 #endif /* GC_MALLOC_CHECK */
392 /* A node in the red-black tree describing allocated memory containing
393 Lisp data. Each such block is recorded with its start and end
394 address when it is allocated, and removed from the tree when it
397 A red-black tree is a balanced binary tree with the following
400 1. Every node is either red or black.
401 2. Every leaf is black.
402 3. If a node is red, then both of its children are black.
403 4. Every simple path from a node to a descendant leaf contains
404 the same number of black nodes.
405 5. The root is always black.
407 When nodes are inserted into the tree, or deleted from the tree,
408 the tree is "fixed" so that these properties are always true.
410 A red-black tree with N internal nodes has height at most 2
411 log(N+1). Searches, insertions and deletions are done in O(log N).
412 Please see a text book about data structures for a detailed
413 description of red-black trees. Any book worth its salt should
418 /* Children of this node. These pointers are never NULL. When there
419 is no child, the value is MEM_NIL, which points to a dummy node. */
420 struct mem_node
*left
, *right
;
422 /* The parent of this node. In the root node, this is NULL. */
423 struct mem_node
*parent
;
425 /* Start and end of allocated region. */
429 enum {MEM_BLACK
, MEM_RED
} color
;
435 /* Base address of stack. Set in main. */
437 Lisp_Object
*stack_base
;
439 /* Root of the tree describing allocated Lisp memory. */
441 static struct mem_node
*mem_root
;
443 /* Lowest and highest known address in the heap. */
445 static void *min_heap_address
, *max_heap_address
;
447 /* Sentinel node of the tree. */
449 static struct mem_node mem_z
;
450 #define MEM_NIL &mem_z
452 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
453 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
, enum mem_type
));
454 static void lisp_free
P_ ((POINTER_TYPE
*));
455 static void mark_stack
P_ ((void));
456 static int live_vector_p
P_ ((struct mem_node
*, void *));
457 static int live_buffer_p
P_ ((struct mem_node
*, void *));
458 static int live_string_p
P_ ((struct mem_node
*, void *));
459 static int live_cons_p
P_ ((struct mem_node
*, void *));
460 static int live_symbol_p
P_ ((struct mem_node
*, void *));
461 static int live_float_p
P_ ((struct mem_node
*, void *));
462 static int live_misc_p
P_ ((struct mem_node
*, void *));
463 static void mark_maybe_object
P_ ((Lisp_Object
));
464 static void mark_memory
P_ ((void *, void *));
465 static void mem_init
P_ ((void));
466 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
467 static void mem_insert_fixup
P_ ((struct mem_node
*));
468 static void mem_rotate_left
P_ ((struct mem_node
*));
469 static void mem_rotate_right
P_ ((struct mem_node
*));
470 static void mem_delete
P_ ((struct mem_node
*));
471 static void mem_delete_fixup
P_ ((struct mem_node
*));
472 static INLINE
struct mem_node
*mem_find
P_ ((void *));
475 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
476 static void check_gcpros
P_ ((void));
479 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
481 /* Recording what needs to be marked for gc. */
483 struct gcpro
*gcprolist
;
485 /* Addresses of staticpro'd variables. Initialize it to a nonzero
486 value; otherwise some compilers put it into BSS. */
488 #define NSTATICS 1280
489 Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
491 /* Index of next unused slot in staticvec. */
495 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
498 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
499 ALIGNMENT must be a power of 2. */
501 #define ALIGN(ptr, ALIGNMENT) \
502 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
503 & ~((ALIGNMENT) - 1)))
507 /************************************************************************
509 ************************************************************************/
511 /* Function malloc calls this if it finds we are near exhausting storage. */
517 pending_malloc_warning
= str
;
521 /* Display an already-pending malloc warning. */
524 display_malloc_warning ()
526 call3 (intern ("display-warning"),
528 build_string (pending_malloc_warning
),
529 intern ("emergency"));
530 pending_malloc_warning
= 0;
534 #ifdef DOUG_LEA_MALLOC
535 # define BYTES_USED (mallinfo ().uordblks)
537 # define BYTES_USED _bytes_used
540 /* Called if we can't allocate relocatable space for a buffer. */
543 buffer_memory_full ()
545 /* If buffers use the relocating allocator, no need to free
546 spare_memory, because we may have plenty of malloc space left
547 that we could get, and if we don't, the malloc that fails will
548 itself cause spare_memory to be freed. If buffers don't use the
549 relocating allocator, treat this like any other failing
556 /* This used to call error, but if we've run out of memory, we could
557 get infinite recursion trying to build the string. */
559 Fsignal (Qnil
, Vmemory_signal_data
);
563 #ifdef XMALLOC_OVERRUN_CHECK
565 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
566 and a 16 byte trailer around each block.
568 The header consists of 12 fixed bytes + a 4 byte integer contaning the
569 original block size, while the trailer consists of 16 fixed bytes.
571 The header is used to detect whether this block has been allocated
572 through these functions -- as it seems that some low-level libc
573 functions may bypass the malloc hooks.
577 #define XMALLOC_OVERRUN_CHECK_SIZE 16
579 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
580 { 0x9a, 0x9b, 0xae, 0xaf,
581 0xbf, 0xbe, 0xce, 0xcf,
582 0xea, 0xeb, 0xec, 0xed };
584 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
585 { 0xaa, 0xab, 0xac, 0xad,
586 0xba, 0xbb, 0xbc, 0xbd,
587 0xca, 0xcb, 0xcc, 0xcd,
588 0xda, 0xdb, 0xdc, 0xdd };
590 /* Macros to insert and extract the block size in the header. */
592 #define XMALLOC_PUT_SIZE(ptr, size) \
593 (ptr[-1] = (size & 0xff), \
594 ptr[-2] = ((size >> 8) & 0xff), \
595 ptr[-3] = ((size >> 16) & 0xff), \
596 ptr[-4] = ((size >> 24) & 0xff))
598 #define XMALLOC_GET_SIZE(ptr) \
599 (size_t)((unsigned)(ptr[-1]) | \
600 ((unsigned)(ptr[-2]) << 8) | \
601 ((unsigned)(ptr[-3]) << 16) | \
602 ((unsigned)(ptr[-4]) << 24))
605 /* The call depth in overrun_check functions. For example, this might happen:
607 overrun_check_malloc()
608 -> malloc -> (via hook)_-> emacs_blocked_malloc
609 -> overrun_check_malloc
610 call malloc (hooks are NULL, so real malloc is called).
611 malloc returns 10000.
612 add overhead, return 10016.
613 <- (back in overrun_check_malloc)
614 add overhead again, return 10032
615 xmalloc returns 10032.
620 overrun_check_free(10032)
622 free(10016) <- crash, because 10000 is the original pointer. */
624 static int check_depth
;
626 /* Like malloc, but wraps allocated block with header and trailer. */
629 overrun_check_malloc (size
)
632 register unsigned char *val
;
633 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
635 val
= (unsigned char *) malloc (size
+ overhead
);
636 if (val
&& check_depth
== 1)
638 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
639 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
640 XMALLOC_PUT_SIZE(val
, size
);
641 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
644 return (POINTER_TYPE
*)val
;
648 /* Like realloc, but checks old block for overrun, and wraps new block
649 with header and trailer. */
652 overrun_check_realloc (block
, size
)
656 register unsigned char *val
= (unsigned char *)block
;
657 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
661 && bcmp (xmalloc_overrun_check_header
,
662 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
663 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
665 size_t osize
= XMALLOC_GET_SIZE (val
);
666 if (bcmp (xmalloc_overrun_check_trailer
,
668 XMALLOC_OVERRUN_CHECK_SIZE
))
670 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
671 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
672 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
675 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
677 if (val
&& check_depth
== 1)
679 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
680 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
681 XMALLOC_PUT_SIZE(val
, size
);
682 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
685 return (POINTER_TYPE
*)val
;
688 /* Like free, but checks block for overrun. */
691 overrun_check_free (block
)
694 unsigned char *val
= (unsigned char *)block
;
699 && bcmp (xmalloc_overrun_check_header
,
700 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
701 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
703 size_t osize
= XMALLOC_GET_SIZE (val
);
704 if (bcmp (xmalloc_overrun_check_trailer
,
706 XMALLOC_OVERRUN_CHECK_SIZE
))
708 #ifdef XMALLOC_CLEAR_FREE_MEMORY
709 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
710 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
712 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
713 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
714 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
725 #define malloc overrun_check_malloc
726 #define realloc overrun_check_realloc
727 #define free overrun_check_free
731 /* Like malloc but check for no memory and block interrupt input.. */
737 register POINTER_TYPE
*val
;
740 val
= (POINTER_TYPE
*) malloc (size
);
749 /* Like realloc but check for no memory and block interrupt input.. */
752 xrealloc (block
, size
)
756 register POINTER_TYPE
*val
;
759 /* We must call malloc explicitly when BLOCK is 0, since some
760 reallocs don't do this. */
762 val
= (POINTER_TYPE
*) malloc (size
);
764 val
= (POINTER_TYPE
*) realloc (block
, size
);
767 if (!val
&& size
) memory_full ();
772 /* Like free but block interrupt input. */
781 /* We don't call refill_memory_reserve here
782 because that duplicates doing so in emacs_blocked_free
783 and the criterion should go there. */
787 /* Like strdup, but uses xmalloc. */
793 size_t len
= strlen (s
) + 1;
794 char *p
= (char *) xmalloc (len
);
800 /* Unwind for SAFE_ALLOCA */
803 safe_alloca_unwind (arg
)
806 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
816 /* Like malloc but used for allocating Lisp data. NBYTES is the
817 number of bytes to allocate, TYPE describes the intended use of the
818 allcated memory block (for strings, for conses, ...). */
821 static void *lisp_malloc_loser
;
824 static POINTER_TYPE
*
825 lisp_malloc (nbytes
, type
)
833 #ifdef GC_MALLOC_CHECK
834 allocated_mem_type
= type
;
837 val
= (void *) malloc (nbytes
);
840 /* If the memory just allocated cannot be addressed thru a Lisp
841 object's pointer, and it needs to be,
842 that's equivalent to running out of memory. */
843 if (val
&& type
!= MEM_TYPE_NON_LISP
)
846 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
847 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
849 lisp_malloc_loser
= val
;
856 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
857 if (val
&& type
!= MEM_TYPE_NON_LISP
)
858 mem_insert (val
, (char *) val
+ nbytes
, type
);
867 /* Free BLOCK. This must be called to free memory allocated with a
868 call to lisp_malloc. */
876 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
877 mem_delete (mem_find (block
));
882 /* Allocation of aligned blocks of memory to store Lisp data. */
883 /* The entry point is lisp_align_malloc which returns blocks of at most */
884 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
887 /* BLOCK_ALIGN has to be a power of 2. */
888 #define BLOCK_ALIGN (1 << 10)
890 /* Padding to leave at the end of a malloc'd block. This is to give
891 malloc a chance to minimize the amount of memory wasted to alignment.
892 It should be tuned to the particular malloc library used.
893 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
894 posix_memalign on the other hand would ideally prefer a value of 4
895 because otherwise, there's 1020 bytes wasted between each ablocks.
896 In Emacs, testing shows that those 1020 can most of the time be
897 efficiently used by malloc to place other objects, so a value of 0 can
898 still preferable unless you have a lot of aligned blocks and virtually
900 #define BLOCK_PADDING 0
901 #define BLOCK_BYTES \
902 (BLOCK_ALIGN - sizeof (struct ablock *) - BLOCK_PADDING)
904 /* Internal data structures and constants. */
906 #define ABLOCKS_SIZE 16
908 /* An aligned block of memory. */
913 char payload
[BLOCK_BYTES
];
914 struct ablock
*next_free
;
916 /* `abase' is the aligned base of the ablocks. */
917 /* It is overloaded to hold the virtual `busy' field that counts
918 the number of used ablock in the parent ablocks.
919 The first ablock has the `busy' field, the others have the `abase'
920 field. To tell the difference, we assume that pointers will have
921 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
922 is used to tell whether the real base of the parent ablocks is `abase'
923 (if not, the word before the first ablock holds a pointer to the
925 struct ablocks
*abase
;
926 /* The padding of all but the last ablock is unused. The padding of
927 the last ablock in an ablocks is not allocated. */
929 char padding
[BLOCK_PADDING
];
933 /* A bunch of consecutive aligned blocks. */
936 struct ablock blocks
[ABLOCKS_SIZE
];
939 /* Size of the block requested from malloc or memalign. */
940 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
942 #define ABLOCK_ABASE(block) \
943 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
944 ? (struct ablocks *)(block) \
947 /* Virtual `busy' field. */
948 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
950 /* Pointer to the (not necessarily aligned) malloc block. */
951 #ifdef HAVE_POSIX_MEMALIGN
952 #define ABLOCKS_BASE(abase) (abase)
954 #define ABLOCKS_BASE(abase) \
955 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
958 /* The list of free ablock. */
959 static struct ablock
*free_ablock
;
961 /* Allocate an aligned block of nbytes.
962 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
963 smaller or equal to BLOCK_BYTES. */
964 static POINTER_TYPE
*
965 lisp_align_malloc (nbytes
, type
)
970 struct ablocks
*abase
;
972 eassert (nbytes
<= BLOCK_BYTES
);
976 #ifdef GC_MALLOC_CHECK
977 allocated_mem_type
= type
;
983 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
985 #ifdef DOUG_LEA_MALLOC
986 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
987 because mapped region contents are not preserved in
989 mallopt (M_MMAP_MAX
, 0);
992 #ifdef HAVE_POSIX_MEMALIGN
994 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1000 base
= malloc (ABLOCKS_BYTES
);
1001 abase
= ALIGN (base
, BLOCK_ALIGN
);
1010 aligned
= (base
== abase
);
1012 ((void**)abase
)[-1] = base
;
1014 #ifdef DOUG_LEA_MALLOC
1015 /* Back to a reasonable maximum of mmap'ed areas. */
1016 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1020 /* If the memory just allocated cannot be addressed thru a Lisp
1021 object's pointer, and it needs to be, that's equivalent to
1022 running out of memory. */
1023 if (type
!= MEM_TYPE_NON_LISP
)
1026 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1027 XSETCONS (tem
, end
);
1028 if ((char *) XCONS (tem
) != end
)
1030 lisp_malloc_loser
= base
;
1038 /* Initialize the blocks and put them on the free list.
1039 Is `base' was not properly aligned, we can't use the last block. */
1040 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1042 abase
->blocks
[i
].abase
= abase
;
1043 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1044 free_ablock
= &abase
->blocks
[i
];
1046 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
1048 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
1049 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1050 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1051 eassert (ABLOCKS_BASE (abase
) == base
);
1052 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
1055 abase
= ABLOCK_ABASE (free_ablock
);
1056 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
1058 free_ablock
= free_ablock
->x
.next_free
;
1060 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1061 if (val
&& type
!= MEM_TYPE_NON_LISP
)
1062 mem_insert (val
, (char *) val
+ nbytes
, type
);
1069 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
1074 lisp_align_free (block
)
1075 POINTER_TYPE
*block
;
1077 struct ablock
*ablock
= block
;
1078 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1081 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1082 mem_delete (mem_find (block
));
1084 /* Put on free list. */
1085 ablock
->x
.next_free
= free_ablock
;
1086 free_ablock
= ablock
;
1087 /* Update busy count. */
1088 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
1090 if (2 > (long) ABLOCKS_BUSY (abase
))
1091 { /* All the blocks are free. */
1092 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
1093 struct ablock
**tem
= &free_ablock
;
1094 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1098 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1101 *tem
= (*tem
)->x
.next_free
;
1104 tem
= &(*tem
)->x
.next_free
;
1106 eassert ((aligned
& 1) == aligned
);
1107 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1108 free (ABLOCKS_BASE (abase
));
1113 /* Return a new buffer structure allocated from the heap with
1114 a call to lisp_malloc. */
1120 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1126 #ifndef SYSTEM_MALLOC
1128 /* Arranging to disable input signals while we're in malloc.
1130 This only works with GNU malloc. To help out systems which can't
1131 use GNU malloc, all the calls to malloc, realloc, and free
1132 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1133 pair; unfortunately, we have no idea what C library functions
1134 might call malloc, so we can't really protect them unless you're
1135 using GNU malloc. Fortunately, most of the major operating systems
1136 can use GNU malloc. */
1140 #ifndef DOUG_LEA_MALLOC
1141 extern void * (*__malloc_hook
) P_ ((size_t, const void *));
1142 extern void * (*__realloc_hook
) P_ ((void *, size_t, const void *));
1143 extern void (*__free_hook
) P_ ((void *, const void *));
1144 /* Else declared in malloc.h, perhaps with an extra arg. */
1145 #endif /* DOUG_LEA_MALLOC */
1146 static void * (*old_malloc_hook
) P_ ((size_t, const void *));
1147 static void * (*old_realloc_hook
) P_ ((void *, size_t, const void*));
1148 static void (*old_free_hook
) P_ ((void*, const void*));
1150 /* This function is used as the hook for free to call. */
1153 emacs_blocked_free (ptr
, ptr2
)
1157 EMACS_INT bytes_used_now
;
1161 #ifdef GC_MALLOC_CHECK
1167 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1170 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1175 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1179 #endif /* GC_MALLOC_CHECK */
1181 __free_hook
= old_free_hook
;
1184 /* If we released our reserve (due to running out of memory),
1185 and we have a fair amount free once again,
1186 try to set aside another reserve in case we run out once more. */
1187 if (! NILP (Vmemory_full
)
1188 /* Verify there is enough space that even with the malloc
1189 hysteresis this call won't run out again.
1190 The code here is correct as long as SPARE_MEMORY
1191 is substantially larger than the block size malloc uses. */
1192 && (bytes_used_when_full
1193 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1194 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1195 refill_memory_reserve ();
1197 __free_hook
= emacs_blocked_free
;
1198 UNBLOCK_INPUT_ALLOC
;
1202 /* This function is the malloc hook that Emacs uses. */
1205 emacs_blocked_malloc (size
, ptr
)
1212 __malloc_hook
= old_malloc_hook
;
1213 #ifdef DOUG_LEA_MALLOC
1214 mallopt (M_TOP_PAD
, malloc_hysteresis
* 4096);
1216 __malloc_extra_blocks
= malloc_hysteresis
;
1219 value
= (void *) malloc (size
);
1221 #ifdef GC_MALLOC_CHECK
1223 struct mem_node
*m
= mem_find (value
);
1226 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1228 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1229 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1234 if (!dont_register_blocks
)
1236 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1237 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1240 #endif /* GC_MALLOC_CHECK */
1242 __malloc_hook
= emacs_blocked_malloc
;
1243 UNBLOCK_INPUT_ALLOC
;
1245 /* fprintf (stderr, "%p malloc\n", value); */
1250 /* This function is the realloc hook that Emacs uses. */
1253 emacs_blocked_realloc (ptr
, size
, ptr2
)
1261 __realloc_hook
= old_realloc_hook
;
1263 #ifdef GC_MALLOC_CHECK
1266 struct mem_node
*m
= mem_find (ptr
);
1267 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1270 "Realloc of %p which wasn't allocated with malloc\n",
1278 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1280 /* Prevent malloc from registering blocks. */
1281 dont_register_blocks
= 1;
1282 #endif /* GC_MALLOC_CHECK */
1284 value
= (void *) realloc (ptr
, size
);
1286 #ifdef GC_MALLOC_CHECK
1287 dont_register_blocks
= 0;
1290 struct mem_node
*m
= mem_find (value
);
1293 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1297 /* Can't handle zero size regions in the red-black tree. */
1298 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1301 /* fprintf (stderr, "%p <- realloc\n", value); */
1302 #endif /* GC_MALLOC_CHECK */
1304 __realloc_hook
= emacs_blocked_realloc
;
1305 UNBLOCK_INPUT_ALLOC
;
1311 #ifdef HAVE_GTK_AND_PTHREAD
1312 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1313 normal malloc. Some thread implementations need this as they call
1314 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1315 calls malloc because it is the first call, and we have an endless loop. */
1318 reset_malloc_hooks ()
1324 #endif /* HAVE_GTK_AND_PTHREAD */
1327 /* Called from main to set up malloc to use our hooks. */
1330 uninterrupt_malloc ()
1332 #ifdef HAVE_GTK_AND_PTHREAD
1333 pthread_mutexattr_t attr
;
1335 /* GLIBC has a faster way to do this, but lets keep it portable.
1336 This is according to the Single UNIX Specification. */
1337 pthread_mutexattr_init (&attr
);
1338 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1339 pthread_mutex_init (&alloc_mutex
, &attr
);
1340 #endif /* HAVE_GTK_AND_PTHREAD */
1342 if (__free_hook
!= emacs_blocked_free
)
1343 old_free_hook
= __free_hook
;
1344 __free_hook
= emacs_blocked_free
;
1346 if (__malloc_hook
!= emacs_blocked_malloc
)
1347 old_malloc_hook
= __malloc_hook
;
1348 __malloc_hook
= emacs_blocked_malloc
;
1350 if (__realloc_hook
!= emacs_blocked_realloc
)
1351 old_realloc_hook
= __realloc_hook
;
1352 __realloc_hook
= emacs_blocked_realloc
;
1355 #endif /* not SYNC_INPUT */
1356 #endif /* not SYSTEM_MALLOC */
1360 /***********************************************************************
1362 ***********************************************************************/
1364 /* Number of intervals allocated in an interval_block structure.
1365 The 1020 is 1024 minus malloc overhead. */
1367 #define INTERVAL_BLOCK_SIZE \
1368 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1370 /* Intervals are allocated in chunks in form of an interval_block
1373 struct interval_block
1375 /* Place `intervals' first, to preserve alignment. */
1376 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1377 struct interval_block
*next
;
1380 /* Current interval block. Its `next' pointer points to older
1383 struct interval_block
*interval_block
;
1385 /* Index in interval_block above of the next unused interval
1388 static int interval_block_index
;
1390 /* Number of free and live intervals. */
1392 static int total_free_intervals
, total_intervals
;
1394 /* List of free intervals. */
1396 INTERVAL interval_free_list
;
1398 /* Total number of interval blocks now in use. */
1400 int n_interval_blocks
;
1403 /* Initialize interval allocation. */
1408 interval_block
= NULL
;
1409 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1410 interval_free_list
= 0;
1411 n_interval_blocks
= 0;
1415 /* Return a new interval. */
1422 if (interval_free_list
)
1424 val
= interval_free_list
;
1425 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1429 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1431 register struct interval_block
*newi
;
1433 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1436 newi
->next
= interval_block
;
1437 interval_block
= newi
;
1438 interval_block_index
= 0;
1439 n_interval_blocks
++;
1441 val
= &interval_block
->intervals
[interval_block_index
++];
1443 consing_since_gc
+= sizeof (struct interval
);
1445 RESET_INTERVAL (val
);
1451 /* Mark Lisp objects in interval I. */
1454 mark_interval (i
, dummy
)
1455 register INTERVAL i
;
1458 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1460 mark_object (i
->plist
);
1464 /* Mark the interval tree rooted in TREE. Don't call this directly;
1465 use the macro MARK_INTERVAL_TREE instead. */
1468 mark_interval_tree (tree
)
1469 register INTERVAL tree
;
1471 /* No need to test if this tree has been marked already; this
1472 function is always called through the MARK_INTERVAL_TREE macro,
1473 which takes care of that. */
1475 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1479 /* Mark the interval tree rooted in I. */
1481 #define MARK_INTERVAL_TREE(i) \
1483 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1484 mark_interval_tree (i); \
1488 #define UNMARK_BALANCE_INTERVALS(i) \
1490 if (! NULL_INTERVAL_P (i)) \
1491 (i) = balance_intervals (i); \
1495 /* Number support. If NO_UNION_TYPE isn't in effect, we
1496 can't create number objects in macros. */
1504 obj
.s
.type
= Lisp_Int
;
1509 /***********************************************************************
1511 ***********************************************************************/
1513 /* Lisp_Strings are allocated in string_block structures. When a new
1514 string_block is allocated, all the Lisp_Strings it contains are
1515 added to a free-list string_free_list. When a new Lisp_String is
1516 needed, it is taken from that list. During the sweep phase of GC,
1517 string_blocks that are entirely free are freed, except two which
1520 String data is allocated from sblock structures. Strings larger
1521 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1522 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1524 Sblocks consist internally of sdata structures, one for each
1525 Lisp_String. The sdata structure points to the Lisp_String it
1526 belongs to. The Lisp_String points back to the `u.data' member of
1527 its sdata structure.
1529 When a Lisp_String is freed during GC, it is put back on
1530 string_free_list, and its `data' member and its sdata's `string'
1531 pointer is set to null. The size of the string is recorded in the
1532 `u.nbytes' member of the sdata. So, sdata structures that are no
1533 longer used, can be easily recognized, and it's easy to compact the
1534 sblocks of small strings which we do in compact_small_strings. */
1536 /* Size in bytes of an sblock structure used for small strings. This
1537 is 8192 minus malloc overhead. */
1539 #define SBLOCK_SIZE 8188
1541 /* Strings larger than this are considered large strings. String data
1542 for large strings is allocated from individual sblocks. */
1544 #define LARGE_STRING_BYTES 1024
1546 /* Structure describing string memory sub-allocated from an sblock.
1547 This is where the contents of Lisp strings are stored. */
1551 /* Back-pointer to the string this sdata belongs to. If null, this
1552 structure is free, and the NBYTES member of the union below
1553 contains the string's byte size (the same value that STRING_BYTES
1554 would return if STRING were non-null). If non-null, STRING_BYTES
1555 (STRING) is the size of the data, and DATA contains the string's
1557 struct Lisp_String
*string
;
1559 #ifdef GC_CHECK_STRING_BYTES
1562 unsigned char data
[1];
1564 #define SDATA_NBYTES(S) (S)->nbytes
1565 #define SDATA_DATA(S) (S)->data
1567 #else /* not GC_CHECK_STRING_BYTES */
1571 /* When STRING in non-null. */
1572 unsigned char data
[1];
1574 /* When STRING is null. */
1579 #define SDATA_NBYTES(S) (S)->u.nbytes
1580 #define SDATA_DATA(S) (S)->u.data
1582 #endif /* not GC_CHECK_STRING_BYTES */
1586 /* Structure describing a block of memory which is sub-allocated to
1587 obtain string data memory for strings. Blocks for small strings
1588 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1589 as large as needed. */
1594 struct sblock
*next
;
1596 /* Pointer to the next free sdata block. This points past the end
1597 of the sblock if there isn't any space left in this block. */
1598 struct sdata
*next_free
;
1600 /* Start of data. */
1601 struct sdata first_data
;
1604 /* Number of Lisp strings in a string_block structure. The 1020 is
1605 1024 minus malloc overhead. */
1607 #define STRING_BLOCK_SIZE \
1608 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1610 /* Structure describing a block from which Lisp_String structures
1615 /* Place `strings' first, to preserve alignment. */
1616 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1617 struct string_block
*next
;
1620 /* Head and tail of the list of sblock structures holding Lisp string
1621 data. We always allocate from current_sblock. The NEXT pointers
1622 in the sblock structures go from oldest_sblock to current_sblock. */
1624 static struct sblock
*oldest_sblock
, *current_sblock
;
1626 /* List of sblocks for large strings. */
1628 static struct sblock
*large_sblocks
;
1630 /* List of string_block structures, and how many there are. */
1632 static struct string_block
*string_blocks
;
1633 static int n_string_blocks
;
1635 /* Free-list of Lisp_Strings. */
1637 static struct Lisp_String
*string_free_list
;
1639 /* Number of live and free Lisp_Strings. */
1641 static int total_strings
, total_free_strings
;
1643 /* Number of bytes used by live strings. */
1645 static int total_string_size
;
1647 /* Given a pointer to a Lisp_String S which is on the free-list
1648 string_free_list, return a pointer to its successor in the
1651 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1653 /* Return a pointer to the sdata structure belonging to Lisp string S.
1654 S must be live, i.e. S->data must not be null. S->data is actually
1655 a pointer to the `u.data' member of its sdata structure; the
1656 structure starts at a constant offset in front of that. */
1658 #ifdef GC_CHECK_STRING_BYTES
1660 #define SDATA_OF_STRING(S) \
1661 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1662 - sizeof (EMACS_INT)))
1664 #else /* not GC_CHECK_STRING_BYTES */
1666 #define SDATA_OF_STRING(S) \
1667 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1669 #endif /* not GC_CHECK_STRING_BYTES */
1672 #ifdef GC_CHECK_STRING_OVERRUN
1674 /* We check for overrun in string data blocks by appending a small
1675 "cookie" after each allocated string data block, and check for the
1676 presence of this cookie during GC. */
1678 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1679 static char string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1680 { 0xde, 0xad, 0xbe, 0xef };
1683 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1686 /* Value is the size of an sdata structure large enough to hold NBYTES
1687 bytes of string data. The value returned includes a terminating
1688 NUL byte, the size of the sdata structure, and padding. */
1690 #ifdef GC_CHECK_STRING_BYTES
1692 #define SDATA_SIZE(NBYTES) \
1693 ((sizeof (struct Lisp_String *) \
1695 + sizeof (EMACS_INT) \
1696 + sizeof (EMACS_INT) - 1) \
1697 & ~(sizeof (EMACS_INT) - 1))
1699 #else /* not GC_CHECK_STRING_BYTES */
1701 #define SDATA_SIZE(NBYTES) \
1702 ((sizeof (struct Lisp_String *) \
1704 + sizeof (EMACS_INT) - 1) \
1705 & ~(sizeof (EMACS_INT) - 1))
1707 #endif /* not GC_CHECK_STRING_BYTES */
1709 /* Extra bytes to allocate for each string. */
1711 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1713 /* Initialize string allocation. Called from init_alloc_once. */
1718 total_strings
= total_free_strings
= total_string_size
= 0;
1719 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1720 string_blocks
= NULL
;
1721 n_string_blocks
= 0;
1722 string_free_list
= NULL
;
1726 #ifdef GC_CHECK_STRING_BYTES
1728 static int check_string_bytes_count
;
1730 void check_string_bytes
P_ ((int));
1731 void check_sblock
P_ ((struct sblock
*));
1733 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1736 /* Like GC_STRING_BYTES, but with debugging check. */
1740 struct Lisp_String
*s
;
1742 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1743 if (!PURE_POINTER_P (s
)
1745 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1750 /* Check validity of Lisp strings' string_bytes member in B. */
1756 struct sdata
*from
, *end
, *from_end
;
1760 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1762 /* Compute the next FROM here because copying below may
1763 overwrite data we need to compute it. */
1766 /* Check that the string size recorded in the string is the
1767 same as the one recorded in the sdata structure. */
1769 CHECK_STRING_BYTES (from
->string
);
1772 nbytes
= GC_STRING_BYTES (from
->string
);
1774 nbytes
= SDATA_NBYTES (from
);
1776 nbytes
= SDATA_SIZE (nbytes
);
1777 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1782 /* Check validity of Lisp strings' string_bytes member. ALL_P
1783 non-zero means check all strings, otherwise check only most
1784 recently allocated strings. Used for hunting a bug. */
1787 check_string_bytes (all_p
)
1794 for (b
= large_sblocks
; b
; b
= b
->next
)
1796 struct Lisp_String
*s
= b
->first_data
.string
;
1798 CHECK_STRING_BYTES (s
);
1801 for (b
= oldest_sblock
; b
; b
= b
->next
)
1805 check_sblock (current_sblock
);
1808 #endif /* GC_CHECK_STRING_BYTES */
1810 #ifdef GC_CHECK_STRING_FREE_LIST
1812 /* Walk through the string free list looking for bogus next pointers.
1813 This may catch buffer overrun from a previous string. */
1816 check_string_free_list ()
1818 struct Lisp_String
*s
;
1820 /* Pop a Lisp_String off the free-list. */
1821 s
= string_free_list
;
1824 if ((unsigned)s
< 1024)
1826 s
= NEXT_FREE_LISP_STRING (s
);
1830 #define check_string_free_list()
1833 /* Return a new Lisp_String. */
1835 static struct Lisp_String
*
1838 struct Lisp_String
*s
;
1840 /* If the free-list is empty, allocate a new string_block, and
1841 add all the Lisp_Strings in it to the free-list. */
1842 if (string_free_list
== NULL
)
1844 struct string_block
*b
;
1847 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1848 bzero (b
, sizeof *b
);
1849 b
->next
= string_blocks
;
1853 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1856 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1857 string_free_list
= s
;
1860 total_free_strings
+= STRING_BLOCK_SIZE
;
1863 check_string_free_list ();
1865 /* Pop a Lisp_String off the free-list. */
1866 s
= string_free_list
;
1867 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1869 /* Probably not strictly necessary, but play it safe. */
1870 bzero (s
, sizeof *s
);
1872 --total_free_strings
;
1875 consing_since_gc
+= sizeof *s
;
1877 #ifdef GC_CHECK_STRING_BYTES
1884 if (++check_string_bytes_count
== 200)
1886 check_string_bytes_count
= 0;
1887 check_string_bytes (1);
1890 check_string_bytes (0);
1892 #endif /* GC_CHECK_STRING_BYTES */
1898 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1899 plus a NUL byte at the end. Allocate an sdata structure for S, and
1900 set S->data to its `u.data' member. Store a NUL byte at the end of
1901 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1902 S->data if it was initially non-null. */
1905 allocate_string_data (s
, nchars
, nbytes
)
1906 struct Lisp_String
*s
;
1909 struct sdata
*data
, *old_data
;
1911 int needed
, old_nbytes
;
1913 /* Determine the number of bytes needed to store NBYTES bytes
1915 needed
= SDATA_SIZE (nbytes
);
1917 if (nbytes
> LARGE_STRING_BYTES
)
1919 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1921 #ifdef DOUG_LEA_MALLOC
1922 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1923 because mapped region contents are not preserved in
1926 In case you think of allowing it in a dumped Emacs at the
1927 cost of not being able to re-dump, there's another reason:
1928 mmap'ed data typically have an address towards the top of the
1929 address space, which won't fit into an EMACS_INT (at least on
1930 32-bit systems with the current tagging scheme). --fx */
1932 mallopt (M_MMAP_MAX
, 0);
1936 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1938 #ifdef DOUG_LEA_MALLOC
1939 /* Back to a reasonable maximum of mmap'ed areas. */
1941 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1945 b
->next_free
= &b
->first_data
;
1946 b
->first_data
.string
= NULL
;
1947 b
->next
= large_sblocks
;
1950 else if (current_sblock
== NULL
1951 || (((char *) current_sblock
+ SBLOCK_SIZE
1952 - (char *) current_sblock
->next_free
)
1953 < (needed
+ GC_STRING_EXTRA
)))
1955 /* Not enough room in the current sblock. */
1956 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1957 b
->next_free
= &b
->first_data
;
1958 b
->first_data
.string
= NULL
;
1962 current_sblock
->next
= b
;
1970 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1971 old_nbytes
= GC_STRING_BYTES (s
);
1973 data
= b
->next_free
;
1975 s
->data
= SDATA_DATA (data
);
1976 #ifdef GC_CHECK_STRING_BYTES
1977 SDATA_NBYTES (data
) = nbytes
;
1980 s
->size_byte
= nbytes
;
1981 s
->data
[nbytes
] = '\0';
1982 #ifdef GC_CHECK_STRING_OVERRUN
1983 bcopy (string_overrun_cookie
, (char *) data
+ needed
,
1984 GC_STRING_OVERRUN_COOKIE_SIZE
);
1986 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
1988 /* If S had already data assigned, mark that as free by setting its
1989 string back-pointer to null, and recording the size of the data
1993 SDATA_NBYTES (old_data
) = old_nbytes
;
1994 old_data
->string
= NULL
;
1997 consing_since_gc
+= needed
;
2001 /* Sweep and compact strings. */
2006 struct string_block
*b
, *next
;
2007 struct string_block
*live_blocks
= NULL
;
2009 string_free_list
= NULL
;
2010 total_strings
= total_free_strings
= 0;
2011 total_string_size
= 0;
2013 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2014 for (b
= string_blocks
; b
; b
= next
)
2017 struct Lisp_String
*free_list_before
= string_free_list
;
2021 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2023 struct Lisp_String
*s
= b
->strings
+ i
;
2027 /* String was not on free-list before. */
2028 if (STRING_MARKED_P (s
))
2030 /* String is live; unmark it and its intervals. */
2033 if (!NULL_INTERVAL_P (s
->intervals
))
2034 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2037 total_string_size
+= STRING_BYTES (s
);
2041 /* String is dead. Put it on the free-list. */
2042 struct sdata
*data
= SDATA_OF_STRING (s
);
2044 /* Save the size of S in its sdata so that we know
2045 how large that is. Reset the sdata's string
2046 back-pointer so that we know it's free. */
2047 #ifdef GC_CHECK_STRING_BYTES
2048 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2051 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2053 data
->string
= NULL
;
2055 /* Reset the strings's `data' member so that we
2059 /* Put the string on the free-list. */
2060 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2061 string_free_list
= s
;
2067 /* S was on the free-list before. Put it there again. */
2068 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2069 string_free_list
= s
;
2074 /* Free blocks that contain free Lisp_Strings only, except
2075 the first two of them. */
2076 if (nfree
== STRING_BLOCK_SIZE
2077 && total_free_strings
> STRING_BLOCK_SIZE
)
2081 string_free_list
= free_list_before
;
2085 total_free_strings
+= nfree
;
2086 b
->next
= live_blocks
;
2091 check_string_free_list ();
2093 string_blocks
= live_blocks
;
2094 free_large_strings ();
2095 compact_small_strings ();
2097 check_string_free_list ();
2101 /* Free dead large strings. */
2104 free_large_strings ()
2106 struct sblock
*b
, *next
;
2107 struct sblock
*live_blocks
= NULL
;
2109 for (b
= large_sblocks
; b
; b
= next
)
2113 if (b
->first_data
.string
== NULL
)
2117 b
->next
= live_blocks
;
2122 large_sblocks
= live_blocks
;
2126 /* Compact data of small strings. Free sblocks that don't contain
2127 data of live strings after compaction. */
2130 compact_small_strings ()
2132 struct sblock
*b
, *tb
, *next
;
2133 struct sdata
*from
, *to
, *end
, *tb_end
;
2134 struct sdata
*to_end
, *from_end
;
2136 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2137 to, and TB_END is the end of TB. */
2139 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2140 to
= &tb
->first_data
;
2142 /* Step through the blocks from the oldest to the youngest. We
2143 expect that old blocks will stabilize over time, so that less
2144 copying will happen this way. */
2145 for (b
= oldest_sblock
; b
; b
= b
->next
)
2148 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2150 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2152 /* Compute the next FROM here because copying below may
2153 overwrite data we need to compute it. */
2156 #ifdef GC_CHECK_STRING_BYTES
2157 /* Check that the string size recorded in the string is the
2158 same as the one recorded in the sdata structure. */
2160 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2162 #endif /* GC_CHECK_STRING_BYTES */
2165 nbytes
= GC_STRING_BYTES (from
->string
);
2167 nbytes
= SDATA_NBYTES (from
);
2169 if (nbytes
> LARGE_STRING_BYTES
)
2172 nbytes
= SDATA_SIZE (nbytes
);
2173 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2175 #ifdef GC_CHECK_STRING_OVERRUN
2176 if (bcmp (string_overrun_cookie
,
2177 ((char *) from_end
) - GC_STRING_OVERRUN_COOKIE_SIZE
,
2178 GC_STRING_OVERRUN_COOKIE_SIZE
))
2182 /* FROM->string non-null means it's alive. Copy its data. */
2185 /* If TB is full, proceed with the next sblock. */
2186 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2187 if (to_end
> tb_end
)
2191 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2192 to
= &tb
->first_data
;
2193 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2196 /* Copy, and update the string's `data' pointer. */
2199 xassert (tb
!= b
|| to
<= from
);
2200 safe_bcopy ((char *) from
, (char *) to
, nbytes
+ GC_STRING_EXTRA
);
2201 to
->string
->data
= SDATA_DATA (to
);
2204 /* Advance past the sdata we copied to. */
2210 /* The rest of the sblocks following TB don't contain live data, so
2211 we can free them. */
2212 for (b
= tb
->next
; b
; b
= next
)
2220 current_sblock
= tb
;
2224 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2225 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2226 LENGTH must be an integer.
2227 INIT must be an integer that represents a character. */)
2229 Lisp_Object length
, init
;
2231 register Lisp_Object val
;
2232 register unsigned char *p
, *end
;
2235 CHECK_NATNUM (length
);
2236 CHECK_NUMBER (init
);
2239 if (ASCII_CHAR_P (c
))
2241 nbytes
= XINT (length
);
2242 val
= make_uninit_string (nbytes
);
2244 end
= p
+ SCHARS (val
);
2250 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2251 int len
= CHAR_STRING (c
, str
);
2253 nbytes
= len
* XINT (length
);
2254 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
2259 bcopy (str
, p
, len
);
2269 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2270 doc
: /* Return a new bool-vector of length LENGTH, using INIT for as each element.
2271 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2273 Lisp_Object length
, init
;
2275 register Lisp_Object val
;
2276 struct Lisp_Bool_Vector
*p
;
2278 int length_in_chars
, length_in_elts
, bits_per_value
;
2280 CHECK_NATNUM (length
);
2282 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2284 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2285 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2286 / BOOL_VECTOR_BITS_PER_CHAR
);
2288 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2289 slot `size' of the struct Lisp_Bool_Vector. */
2290 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2291 p
= XBOOL_VECTOR (val
);
2293 /* Get rid of any bits that would cause confusion. */
2295 XSETBOOL_VECTOR (val
, p
);
2296 p
->size
= XFASTINT (length
);
2298 real_init
= (NILP (init
) ? 0 : -1);
2299 for (i
= 0; i
< length_in_chars
; i
++)
2300 p
->data
[i
] = real_init
;
2302 /* Clear the extraneous bits in the last byte. */
2303 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2304 XBOOL_VECTOR (val
)->data
[length_in_chars
- 1]
2305 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2311 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2312 of characters from the contents. This string may be unibyte or
2313 multibyte, depending on the contents. */
2316 make_string (contents
, nbytes
)
2317 const char *contents
;
2320 register Lisp_Object val
;
2321 int nchars
, multibyte_nbytes
;
2323 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
2324 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2325 /* CONTENTS contains no multibyte sequences or contains an invalid
2326 multibyte sequence. We must make unibyte string. */
2327 val
= make_unibyte_string (contents
, nbytes
);
2329 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2334 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2337 make_unibyte_string (contents
, length
)
2338 const char *contents
;
2341 register Lisp_Object val
;
2342 val
= make_uninit_string (length
);
2343 bcopy (contents
, SDATA (val
), length
);
2344 STRING_SET_UNIBYTE (val
);
2349 /* Make a multibyte string from NCHARS characters occupying NBYTES
2350 bytes at CONTENTS. */
2353 make_multibyte_string (contents
, nchars
, nbytes
)
2354 const char *contents
;
2357 register Lisp_Object val
;
2358 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2359 bcopy (contents
, SDATA (val
), nbytes
);
2364 /* Make a string from NCHARS characters occupying NBYTES bytes at
2365 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2368 make_string_from_bytes (contents
, nchars
, nbytes
)
2369 const char *contents
;
2372 register Lisp_Object val
;
2373 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2374 bcopy (contents
, SDATA (val
), nbytes
);
2375 if (SBYTES (val
) == SCHARS (val
))
2376 STRING_SET_UNIBYTE (val
);
2381 /* Make a string from NCHARS characters occupying NBYTES bytes at
2382 CONTENTS. The argument MULTIBYTE controls whether to label the
2383 string as multibyte. If NCHARS is negative, it counts the number of
2384 characters by itself. */
2387 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2388 const char *contents
;
2392 register Lisp_Object val
;
2397 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2401 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2402 bcopy (contents
, SDATA (val
), nbytes
);
2404 STRING_SET_UNIBYTE (val
);
2409 /* Make a string from the data at STR, treating it as multibyte if the
2416 return make_string (str
, strlen (str
));
2420 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2421 occupying LENGTH bytes. */
2424 make_uninit_string (length
)
2428 val
= make_uninit_multibyte_string (length
, length
);
2429 STRING_SET_UNIBYTE (val
);
2434 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2435 which occupy NBYTES bytes. */
2438 make_uninit_multibyte_string (nchars
, nbytes
)
2442 struct Lisp_String
*s
;
2447 s
= allocate_string ();
2448 allocate_string_data (s
, nchars
, nbytes
);
2449 XSETSTRING (string
, s
);
2450 string_chars_consed
+= nbytes
;
2456 /***********************************************************************
2458 ***********************************************************************/
2460 /* We store float cells inside of float_blocks, allocating a new
2461 float_block with malloc whenever necessary. Float cells reclaimed
2462 by GC are put on a free list to be reallocated before allocating
2463 any new float cells from the latest float_block. */
2465 #define FLOAT_BLOCK_SIZE \
2466 (((BLOCK_BYTES - sizeof (struct float_block *) \
2467 /* The compiler might add padding at the end. */ \
2468 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2469 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2471 #define GETMARKBIT(block,n) \
2472 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2473 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2476 #define SETMARKBIT(block,n) \
2477 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2478 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2480 #define UNSETMARKBIT(block,n) \
2481 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2482 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2484 #define FLOAT_BLOCK(fptr) \
2485 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2487 #define FLOAT_INDEX(fptr) \
2488 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2492 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2493 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2494 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2495 struct float_block
*next
;
2498 #define FLOAT_MARKED_P(fptr) \
2499 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2501 #define FLOAT_MARK(fptr) \
2502 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2504 #define FLOAT_UNMARK(fptr) \
2505 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2507 /* Current float_block. */
2509 struct float_block
*float_block
;
2511 /* Index of first unused Lisp_Float in the current float_block. */
2513 int float_block_index
;
2515 /* Total number of float blocks now in use. */
2519 /* Free-list of Lisp_Floats. */
2521 struct Lisp_Float
*float_free_list
;
2524 /* Initialize float allocation. */
2530 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2531 float_free_list
= 0;
2536 /* Explicitly free a float cell by putting it on the free-list. */
2540 struct Lisp_Float
*ptr
;
2542 ptr
->u
.chain
= float_free_list
;
2543 float_free_list
= ptr
;
2547 /* Return a new float object with value FLOAT_VALUE. */
2550 make_float (float_value
)
2553 register Lisp_Object val
;
2555 if (float_free_list
)
2557 /* We use the data field for chaining the free list
2558 so that we won't use the same field that has the mark bit. */
2559 XSETFLOAT (val
, float_free_list
);
2560 float_free_list
= float_free_list
->u
.chain
;
2564 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2566 register struct float_block
*new;
2568 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2570 new->next
= float_block
;
2571 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2573 float_block_index
= 0;
2576 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2577 float_block_index
++;
2580 XFLOAT_DATA (val
) = float_value
;
2581 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2582 consing_since_gc
+= sizeof (struct Lisp_Float
);
2589 /***********************************************************************
2591 ***********************************************************************/
2593 /* We store cons cells inside of cons_blocks, allocating a new
2594 cons_block with malloc whenever necessary. Cons cells reclaimed by
2595 GC are put on a free list to be reallocated before allocating
2596 any new cons cells from the latest cons_block. */
2598 #define CONS_BLOCK_SIZE \
2599 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2600 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2602 #define CONS_BLOCK(fptr) \
2603 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2605 #define CONS_INDEX(fptr) \
2606 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2610 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2611 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2612 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2613 struct cons_block
*next
;
2616 #define CONS_MARKED_P(fptr) \
2617 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2619 #define CONS_MARK(fptr) \
2620 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2622 #define CONS_UNMARK(fptr) \
2623 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2625 /* Current cons_block. */
2627 struct cons_block
*cons_block
;
2629 /* Index of first unused Lisp_Cons in the current block. */
2631 int cons_block_index
;
2633 /* Free-list of Lisp_Cons structures. */
2635 struct Lisp_Cons
*cons_free_list
;
2637 /* Total number of cons blocks now in use. */
2642 /* Initialize cons allocation. */
2648 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2654 /* Explicitly free a cons cell by putting it on the free-list. */
2658 struct Lisp_Cons
*ptr
;
2660 ptr
->u
.chain
= cons_free_list
;
2664 cons_free_list
= ptr
;
2667 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2668 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2670 Lisp_Object car
, cdr
;
2672 register Lisp_Object val
;
2676 /* We use the cdr for chaining the free list
2677 so that we won't use the same field that has the mark bit. */
2678 XSETCONS (val
, cons_free_list
);
2679 cons_free_list
= cons_free_list
->u
.chain
;
2683 if (cons_block_index
== CONS_BLOCK_SIZE
)
2685 register struct cons_block
*new;
2686 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2688 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2689 new->next
= cons_block
;
2691 cons_block_index
= 0;
2694 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2700 eassert (!CONS_MARKED_P (XCONS (val
)));
2701 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2702 cons_cells_consed
++;
2706 /* Get an error now if there's any junk in the cons free list. */
2710 #ifdef GC_CHECK_CONS_LIST
2711 struct Lisp_Cons
*tail
= cons_free_list
;
2714 tail
= tail
->u
.chain
;
2718 /* Make a list of 2, 3, 4 or 5 specified objects. */
2722 Lisp_Object arg1
, arg2
;
2724 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2729 list3 (arg1
, arg2
, arg3
)
2730 Lisp_Object arg1
, arg2
, arg3
;
2732 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2737 list4 (arg1
, arg2
, arg3
, arg4
)
2738 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2740 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2745 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2746 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2748 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2749 Fcons (arg5
, Qnil
)))));
2753 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2754 doc
: /* Return a newly created list with specified arguments as elements.
2755 Any number of arguments, even zero arguments, are allowed.
2756 usage: (list &rest OBJECTS) */)
2759 register Lisp_Object
*args
;
2761 register Lisp_Object val
;
2767 val
= Fcons (args
[nargs
], val
);
2773 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2774 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2776 register Lisp_Object length
, init
;
2778 register Lisp_Object val
;
2781 CHECK_NATNUM (length
);
2782 size
= XFASTINT (length
);
2787 val
= Fcons (init
, val
);
2792 val
= Fcons (init
, val
);
2797 val
= Fcons (init
, val
);
2802 val
= Fcons (init
, val
);
2807 val
= Fcons (init
, val
);
2822 /***********************************************************************
2824 ***********************************************************************/
2826 /* Singly-linked list of all vectors. */
2828 struct Lisp_Vector
*all_vectors
;
2830 /* Total number of vector-like objects now in use. */
2835 /* Value is a pointer to a newly allocated Lisp_Vector structure
2836 with room for LEN Lisp_Objects. */
2838 static struct Lisp_Vector
*
2839 allocate_vectorlike (len
, type
)
2843 struct Lisp_Vector
*p
;
2846 #ifdef DOUG_LEA_MALLOC
2847 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2848 because mapped region contents are not preserved in
2851 mallopt (M_MMAP_MAX
, 0);
2855 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2856 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, type
);
2858 #ifdef DOUG_LEA_MALLOC
2859 /* Back to a reasonable maximum of mmap'ed areas. */
2861 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2865 consing_since_gc
+= nbytes
;
2866 vector_cells_consed
+= len
;
2868 p
->next
= all_vectors
;
2875 /* Allocate a vector with NSLOTS slots. */
2877 struct Lisp_Vector
*
2878 allocate_vector (nslots
)
2881 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
, MEM_TYPE_VECTOR
);
2887 /* Allocate other vector-like structures. */
2889 struct Lisp_Hash_Table
*
2890 allocate_hash_table ()
2892 EMACS_INT len
= VECSIZE (struct Lisp_Hash_Table
);
2893 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_HASH_TABLE
);
2897 for (i
= 0; i
< len
; ++i
)
2898 v
->contents
[i
] = Qnil
;
2900 return (struct Lisp_Hash_Table
*) v
;
2907 EMACS_INT len
= VECSIZE (struct window
);
2908 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_WINDOW
);
2911 for (i
= 0; i
< len
; ++i
)
2912 v
->contents
[i
] = Qnil
;
2915 return (struct window
*) v
;
2922 EMACS_INT len
= VECSIZE (struct frame
);
2923 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_FRAME
);
2926 for (i
= 0; i
< len
; ++i
)
2927 v
->contents
[i
] = make_number (0);
2929 return (struct frame
*) v
;
2933 struct Lisp_Process
*
2936 EMACS_INT len
= VECSIZE (struct Lisp_Process
);
2937 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_PROCESS
);
2940 for (i
= 0; i
< len
; ++i
)
2941 v
->contents
[i
] = Qnil
;
2944 return (struct Lisp_Process
*) v
;
2948 struct Lisp_Vector
*
2949 allocate_other_vector (len
)
2952 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_VECTOR
);
2955 for (i
= 0; i
< len
; ++i
)
2956 v
->contents
[i
] = Qnil
;
2963 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2964 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2965 See also the function `vector'. */)
2967 register Lisp_Object length
, init
;
2970 register EMACS_INT sizei
;
2972 register struct Lisp_Vector
*p
;
2974 CHECK_NATNUM (length
);
2975 sizei
= XFASTINT (length
);
2977 p
= allocate_vector (sizei
);
2978 for (index
= 0; index
< sizei
; index
++)
2979 p
->contents
[index
] = init
;
2981 XSETVECTOR (vector
, p
);
2986 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
2987 doc
: /* Return a newly created vector with specified arguments as elements.
2988 Any number of arguments, even zero arguments, are allowed.
2989 usage: (vector &rest OBJECTS) */)
2994 register Lisp_Object len
, val
;
2996 register struct Lisp_Vector
*p
;
2998 XSETFASTINT (len
, nargs
);
2999 val
= Fmake_vector (len
, Qnil
);
3001 for (index
= 0; index
< nargs
; index
++)
3002 p
->contents
[index
] = args
[index
];
3007 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3008 doc
: /* Create a byte-code object with specified arguments as elements.
3009 The arguments should be the arglist, bytecode-string, constant vector,
3010 stack size, (optional) doc string, and (optional) interactive spec.
3011 The first four arguments are required; at most six have any
3013 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3018 register Lisp_Object len
, val
;
3020 register struct Lisp_Vector
*p
;
3022 XSETFASTINT (len
, nargs
);
3023 if (!NILP (Vpurify_flag
))
3024 val
= make_pure_vector ((EMACS_INT
) nargs
);
3026 val
= Fmake_vector (len
, Qnil
);
3028 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
3029 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3030 earlier because they produced a raw 8-bit string for byte-code
3031 and now such a byte-code string is loaded as multibyte while
3032 raw 8-bit characters converted to multibyte form. Thus, now we
3033 must convert them back to the original unibyte form. */
3034 args
[1] = Fstring_as_unibyte (args
[1]);
3037 for (index
= 0; index
< nargs
; index
++)
3039 if (!NILP (Vpurify_flag
))
3040 args
[index
] = Fpurecopy (args
[index
]);
3041 p
->contents
[index
] = args
[index
];
3043 XSETCOMPILED (val
, p
);
3049 /***********************************************************************
3051 ***********************************************************************/
3053 /* Each symbol_block is just under 1020 bytes long, since malloc
3054 really allocates in units of powers of two and uses 4 bytes for its
3057 #define SYMBOL_BLOCK_SIZE \
3058 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3062 /* Place `symbols' first, to preserve alignment. */
3063 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3064 struct symbol_block
*next
;
3067 /* Current symbol block and index of first unused Lisp_Symbol
3070 struct symbol_block
*symbol_block
;
3071 int symbol_block_index
;
3073 /* List of free symbols. */
3075 struct Lisp_Symbol
*symbol_free_list
;
3077 /* Total number of symbol blocks now in use. */
3079 int n_symbol_blocks
;
3082 /* Initialize symbol allocation. */
3087 symbol_block
= NULL
;
3088 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3089 symbol_free_list
= 0;
3090 n_symbol_blocks
= 0;
3094 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3095 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3096 Its value and function definition are void, and its property list is nil. */)
3100 register Lisp_Object val
;
3101 register struct Lisp_Symbol
*p
;
3103 CHECK_STRING (name
);
3105 if (symbol_free_list
)
3107 XSETSYMBOL (val
, symbol_free_list
);
3108 symbol_free_list
= symbol_free_list
->next
;
3112 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3114 struct symbol_block
*new;
3115 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3117 new->next
= symbol_block
;
3119 symbol_block_index
= 0;
3122 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3123 symbol_block_index
++;
3129 p
->value
= Qunbound
;
3130 p
->function
= Qunbound
;
3133 p
->interned
= SYMBOL_UNINTERNED
;
3135 p
->indirect_variable
= 0;
3136 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3143 /***********************************************************************
3144 Marker (Misc) Allocation
3145 ***********************************************************************/
3147 /* Allocation of markers and other objects that share that structure.
3148 Works like allocation of conses. */
3150 #define MARKER_BLOCK_SIZE \
3151 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3155 /* Place `markers' first, to preserve alignment. */
3156 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3157 struct marker_block
*next
;
3160 struct marker_block
*marker_block
;
3161 int marker_block_index
;
3163 union Lisp_Misc
*marker_free_list
;
3165 /* Total number of marker blocks now in use. */
3167 int n_marker_blocks
;
3172 marker_block
= NULL
;
3173 marker_block_index
= MARKER_BLOCK_SIZE
;
3174 marker_free_list
= 0;
3175 n_marker_blocks
= 0;
3178 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3185 if (marker_free_list
)
3187 XSETMISC (val
, marker_free_list
);
3188 marker_free_list
= marker_free_list
->u_free
.chain
;
3192 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3194 struct marker_block
*new;
3195 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3197 new->next
= marker_block
;
3199 marker_block_index
= 0;
3201 total_free_markers
+= MARKER_BLOCK_SIZE
;
3203 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3204 marker_block_index
++;
3207 --total_free_markers
;
3208 consing_since_gc
+= sizeof (union Lisp_Misc
);
3209 misc_objects_consed
++;
3210 XMARKER (val
)->gcmarkbit
= 0;
3214 /* Free a Lisp_Misc object */
3220 XMISC (misc
)->u_marker
.type
= Lisp_Misc_Free
;
3221 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3222 marker_free_list
= XMISC (misc
);
3224 total_free_markers
++;
3227 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3228 INTEGER. This is used to package C values to call record_unwind_protect.
3229 The unwind function can get the C values back using XSAVE_VALUE. */
3232 make_save_value (pointer
, integer
)
3236 register Lisp_Object val
;
3237 register struct Lisp_Save_Value
*p
;
3239 val
= allocate_misc ();
3240 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3241 p
= XSAVE_VALUE (val
);
3242 p
->pointer
= pointer
;
3243 p
->integer
= integer
;
3248 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3249 doc
: /* Return a newly allocated marker which does not point at any place. */)
3252 register Lisp_Object val
;
3253 register struct Lisp_Marker
*p
;
3255 val
= allocate_misc ();
3256 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3262 p
->insertion_type
= 0;
3266 /* Put MARKER back on the free list after using it temporarily. */
3269 free_marker (marker
)
3272 unchain_marker (XMARKER (marker
));
3277 /* Return a newly created vector or string with specified arguments as
3278 elements. If all the arguments are characters that can fit
3279 in a string of events, make a string; otherwise, make a vector.
3281 Any number of arguments, even zero arguments, are allowed. */
3284 make_event_array (nargs
, args
)
3290 for (i
= 0; i
< nargs
; i
++)
3291 /* The things that fit in a string
3292 are characters that are in 0...127,
3293 after discarding the meta bit and all the bits above it. */
3294 if (!INTEGERP (args
[i
])
3295 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3296 return Fvector (nargs
, args
);
3298 /* Since the loop exited, we know that all the things in it are
3299 characters, so we can make a string. */
3303 result
= Fmake_string (make_number (nargs
), make_number (0));
3304 for (i
= 0; i
< nargs
; i
++)
3306 SSET (result
, i
, XINT (args
[i
]));
3307 /* Move the meta bit to the right place for a string char. */
3308 if (XINT (args
[i
]) & CHAR_META
)
3309 SSET (result
, i
, SREF (result
, i
) | 0x80);
3318 /************************************************************************
3319 Memory Full Handling
3320 ************************************************************************/
3323 /* Called if malloc returns zero. */
3332 memory_full_cons_threshold
= sizeof (struct cons_block
);
3334 /* The first time we get here, free the spare memory. */
3335 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3336 if (spare_memory
[i
])
3339 free (spare_memory
[i
]);
3340 else if (i
>= 1 && i
<= 4)
3341 lisp_align_free (spare_memory
[i
]);
3343 lisp_free (spare_memory
[i
]);
3344 spare_memory
[i
] = 0;
3347 /* Record the space now used. When it decreases substantially,
3348 we can refill the memory reserve. */
3349 #ifndef SYSTEM_MALLOC
3350 bytes_used_when_full
= BYTES_USED
;
3353 /* This used to call error, but if we've run out of memory, we could
3354 get infinite recursion trying to build the string. */
3356 Fsignal (Qnil
, Vmemory_signal_data
);
3359 /* If we released our reserve (due to running out of memory),
3360 and we have a fair amount free once again,
3361 try to set aside another reserve in case we run out once more.
3363 This is called when a relocatable block is freed in ralloc.c,
3364 and also directly from this file, in case we're not using ralloc.c. */
3367 refill_memory_reserve ()
3369 #ifndef SYSTEM_MALLOC
3370 if (spare_memory
[0] == 0)
3371 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3372 if (spare_memory
[1] == 0)
3373 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3375 if (spare_memory
[2] == 0)
3376 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3378 if (spare_memory
[3] == 0)
3379 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3381 if (spare_memory
[4] == 0)
3382 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3384 if (spare_memory
[5] == 0)
3385 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3387 if (spare_memory
[6] == 0)
3388 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3390 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3391 Vmemory_full
= Qnil
;
3395 /************************************************************************
3397 ************************************************************************/
3399 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3401 /* Conservative C stack marking requires a method to identify possibly
3402 live Lisp objects given a pointer value. We do this by keeping
3403 track of blocks of Lisp data that are allocated in a red-black tree
3404 (see also the comment of mem_node which is the type of nodes in
3405 that tree). Function lisp_malloc adds information for an allocated
3406 block to the red-black tree with calls to mem_insert, and function
3407 lisp_free removes it with mem_delete. Functions live_string_p etc
3408 call mem_find to lookup information about a given pointer in the
3409 tree, and use that to determine if the pointer points to a Lisp
3412 /* Initialize this part of alloc.c. */
3417 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3418 mem_z
.parent
= NULL
;
3419 mem_z
.color
= MEM_BLACK
;
3420 mem_z
.start
= mem_z
.end
= NULL
;
3425 /* Value is a pointer to the mem_node containing START. Value is
3426 MEM_NIL if there is no node in the tree containing START. */
3428 static INLINE
struct mem_node
*
3434 if (start
< min_heap_address
|| start
> max_heap_address
)
3437 /* Make the search always successful to speed up the loop below. */
3438 mem_z
.start
= start
;
3439 mem_z
.end
= (char *) start
+ 1;
3442 while (start
< p
->start
|| start
>= p
->end
)
3443 p
= start
< p
->start
? p
->left
: p
->right
;
3448 /* Insert a new node into the tree for a block of memory with start
3449 address START, end address END, and type TYPE. Value is a
3450 pointer to the node that was inserted. */
3452 static struct mem_node
*
3453 mem_insert (start
, end
, type
)
3457 struct mem_node
*c
, *parent
, *x
;
3459 if (start
< min_heap_address
)
3460 min_heap_address
= start
;
3461 if (end
> max_heap_address
)
3462 max_heap_address
= end
;
3464 /* See where in the tree a node for START belongs. In this
3465 particular application, it shouldn't happen that a node is already
3466 present. For debugging purposes, let's check that. */
3470 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3472 while (c
!= MEM_NIL
)
3474 if (start
>= c
->start
&& start
< c
->end
)
3477 c
= start
< c
->start
? c
->left
: c
->right
;
3480 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3482 while (c
!= MEM_NIL
)
3485 c
= start
< c
->start
? c
->left
: c
->right
;
3488 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3490 /* Create a new node. */
3491 #ifdef GC_MALLOC_CHECK
3492 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3496 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3502 x
->left
= x
->right
= MEM_NIL
;
3505 /* Insert it as child of PARENT or install it as root. */
3508 if (start
< parent
->start
)
3516 /* Re-establish red-black tree properties. */
3517 mem_insert_fixup (x
);
3523 /* Re-establish the red-black properties of the tree, and thereby
3524 balance the tree, after node X has been inserted; X is always red. */
3527 mem_insert_fixup (x
)
3530 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3532 /* X is red and its parent is red. This is a violation of
3533 red-black tree property #3. */
3535 if (x
->parent
== x
->parent
->parent
->left
)
3537 /* We're on the left side of our grandparent, and Y is our
3539 struct mem_node
*y
= x
->parent
->parent
->right
;
3541 if (y
->color
== MEM_RED
)
3543 /* Uncle and parent are red but should be black because
3544 X is red. Change the colors accordingly and proceed
3545 with the grandparent. */
3546 x
->parent
->color
= MEM_BLACK
;
3547 y
->color
= MEM_BLACK
;
3548 x
->parent
->parent
->color
= MEM_RED
;
3549 x
= x
->parent
->parent
;
3553 /* Parent and uncle have different colors; parent is
3554 red, uncle is black. */
3555 if (x
== x
->parent
->right
)
3558 mem_rotate_left (x
);
3561 x
->parent
->color
= MEM_BLACK
;
3562 x
->parent
->parent
->color
= MEM_RED
;
3563 mem_rotate_right (x
->parent
->parent
);
3568 /* This is the symmetrical case of above. */
3569 struct mem_node
*y
= x
->parent
->parent
->left
;
3571 if (y
->color
== MEM_RED
)
3573 x
->parent
->color
= MEM_BLACK
;
3574 y
->color
= MEM_BLACK
;
3575 x
->parent
->parent
->color
= MEM_RED
;
3576 x
= x
->parent
->parent
;
3580 if (x
== x
->parent
->left
)
3583 mem_rotate_right (x
);
3586 x
->parent
->color
= MEM_BLACK
;
3587 x
->parent
->parent
->color
= MEM_RED
;
3588 mem_rotate_left (x
->parent
->parent
);
3593 /* The root may have been changed to red due to the algorithm. Set
3594 it to black so that property #5 is satisfied. */
3595 mem_root
->color
= MEM_BLACK
;
3611 /* Turn y's left sub-tree into x's right sub-tree. */
3614 if (y
->left
!= MEM_NIL
)
3615 y
->left
->parent
= x
;
3617 /* Y's parent was x's parent. */
3619 y
->parent
= x
->parent
;
3621 /* Get the parent to point to y instead of x. */
3624 if (x
== x
->parent
->left
)
3625 x
->parent
->left
= y
;
3627 x
->parent
->right
= y
;
3632 /* Put x on y's left. */
3646 mem_rotate_right (x
)
3649 struct mem_node
*y
= x
->left
;
3652 if (y
->right
!= MEM_NIL
)
3653 y
->right
->parent
= x
;
3656 y
->parent
= x
->parent
;
3659 if (x
== x
->parent
->right
)
3660 x
->parent
->right
= y
;
3662 x
->parent
->left
= y
;
3673 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3679 struct mem_node
*x
, *y
;
3681 if (!z
|| z
== MEM_NIL
)
3684 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3689 while (y
->left
!= MEM_NIL
)
3693 if (y
->left
!= MEM_NIL
)
3698 x
->parent
= y
->parent
;
3701 if (y
== y
->parent
->left
)
3702 y
->parent
->left
= x
;
3704 y
->parent
->right
= x
;
3711 z
->start
= y
->start
;
3716 if (y
->color
== MEM_BLACK
)
3717 mem_delete_fixup (x
);
3719 #ifdef GC_MALLOC_CHECK
3727 /* Re-establish the red-black properties of the tree, after a
3731 mem_delete_fixup (x
)
3734 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3736 if (x
== x
->parent
->left
)
3738 struct mem_node
*w
= x
->parent
->right
;
3740 if (w
->color
== MEM_RED
)
3742 w
->color
= MEM_BLACK
;
3743 x
->parent
->color
= MEM_RED
;
3744 mem_rotate_left (x
->parent
);
3745 w
= x
->parent
->right
;
3748 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3755 if (w
->right
->color
== MEM_BLACK
)
3757 w
->left
->color
= MEM_BLACK
;
3759 mem_rotate_right (w
);
3760 w
= x
->parent
->right
;
3762 w
->color
= x
->parent
->color
;
3763 x
->parent
->color
= MEM_BLACK
;
3764 w
->right
->color
= MEM_BLACK
;
3765 mem_rotate_left (x
->parent
);
3771 struct mem_node
*w
= x
->parent
->left
;
3773 if (w
->color
== MEM_RED
)
3775 w
->color
= MEM_BLACK
;
3776 x
->parent
->color
= MEM_RED
;
3777 mem_rotate_right (x
->parent
);
3778 w
= x
->parent
->left
;
3781 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3788 if (w
->left
->color
== MEM_BLACK
)
3790 w
->right
->color
= MEM_BLACK
;
3792 mem_rotate_left (w
);
3793 w
= x
->parent
->left
;
3796 w
->color
= x
->parent
->color
;
3797 x
->parent
->color
= MEM_BLACK
;
3798 w
->left
->color
= MEM_BLACK
;
3799 mem_rotate_right (x
->parent
);
3805 x
->color
= MEM_BLACK
;
3809 /* Value is non-zero if P is a pointer to a live Lisp string on
3810 the heap. M is a pointer to the mem_block for P. */
3813 live_string_p (m
, p
)
3817 if (m
->type
== MEM_TYPE_STRING
)
3819 struct string_block
*b
= (struct string_block
*) m
->start
;
3820 int offset
= (char *) p
- (char *) &b
->strings
[0];
3822 /* P must point to the start of a Lisp_String structure, and it
3823 must not be on the free-list. */
3825 && offset
% sizeof b
->strings
[0] == 0
3826 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3827 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3834 /* Value is non-zero if P is a pointer to a live Lisp cons on
3835 the heap. M is a pointer to the mem_block for P. */
3842 if (m
->type
== MEM_TYPE_CONS
)
3844 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3845 int offset
= (char *) p
- (char *) &b
->conses
[0];
3847 /* P must point to the start of a Lisp_Cons, not be
3848 one of the unused cells in the current cons block,
3849 and not be on the free-list. */
3851 && offset
% sizeof b
->conses
[0] == 0
3852 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3854 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3855 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3862 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3863 the heap. M is a pointer to the mem_block for P. */
3866 live_symbol_p (m
, p
)
3870 if (m
->type
== MEM_TYPE_SYMBOL
)
3872 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3873 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3875 /* P must point to the start of a Lisp_Symbol, not be
3876 one of the unused cells in the current symbol block,
3877 and not be on the free-list. */
3879 && offset
% sizeof b
->symbols
[0] == 0
3880 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3881 && (b
!= symbol_block
3882 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3883 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3890 /* Value is non-zero if P is a pointer to a live Lisp float on
3891 the heap. M is a pointer to the mem_block for P. */
3898 if (m
->type
== MEM_TYPE_FLOAT
)
3900 struct float_block
*b
= (struct float_block
*) m
->start
;
3901 int offset
= (char *) p
- (char *) &b
->floats
[0];
3903 /* P must point to the start of a Lisp_Float and not be
3904 one of the unused cells in the current float block. */
3906 && offset
% sizeof b
->floats
[0] == 0
3907 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3908 && (b
!= float_block
3909 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3916 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3917 the heap. M is a pointer to the mem_block for P. */
3924 if (m
->type
== MEM_TYPE_MISC
)
3926 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3927 int offset
= (char *) p
- (char *) &b
->markers
[0];
3929 /* P must point to the start of a Lisp_Misc, not be
3930 one of the unused cells in the current misc block,
3931 and not be on the free-list. */
3933 && offset
% sizeof b
->markers
[0] == 0
3934 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3935 && (b
!= marker_block
3936 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3937 && ((union Lisp_Misc
*) p
)->u_marker
.type
!= Lisp_Misc_Free
);
3944 /* Value is non-zero if P is a pointer to a live vector-like object.
3945 M is a pointer to the mem_block for P. */
3948 live_vector_p (m
, p
)
3952 return (p
== m
->start
3953 && m
->type
>= MEM_TYPE_VECTOR
3954 && m
->type
<= MEM_TYPE_WINDOW
);
3958 /* Value is non-zero if P is a pointer to a live buffer. M is a
3959 pointer to the mem_block for P. */
3962 live_buffer_p (m
, p
)
3966 /* P must point to the start of the block, and the buffer
3967 must not have been killed. */
3968 return (m
->type
== MEM_TYPE_BUFFER
3970 && !NILP (((struct buffer
*) p
)->name
));
3973 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3977 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3979 /* Array of objects that are kept alive because the C stack contains
3980 a pattern that looks like a reference to them . */
3982 #define MAX_ZOMBIES 10
3983 static Lisp_Object zombies
[MAX_ZOMBIES
];
3985 /* Number of zombie objects. */
3987 static int nzombies
;
3989 /* Number of garbage collections. */
3993 /* Average percentage of zombies per collection. */
3995 static double avg_zombies
;
3997 /* Max. number of live and zombie objects. */
3999 static int max_live
, max_zombies
;
4001 /* Average number of live objects per GC. */
4003 static double avg_live
;
4005 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4006 doc
: /* Show information about live and zombie objects. */)
4009 Lisp_Object args
[8], zombie_list
= Qnil
;
4011 for (i
= 0; i
< nzombies
; i
++)
4012 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4013 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4014 args
[1] = make_number (ngcs
);
4015 args
[2] = make_float (avg_live
);
4016 args
[3] = make_float (avg_zombies
);
4017 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4018 args
[5] = make_number (max_live
);
4019 args
[6] = make_number (max_zombies
);
4020 args
[7] = zombie_list
;
4021 return Fmessage (8, args
);
4024 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4027 /* Mark OBJ if we can prove it's a Lisp_Object. */
4030 mark_maybe_object (obj
)
4033 void *po
= (void *) XPNTR (obj
);
4034 struct mem_node
*m
= mem_find (po
);
4040 switch (XGCTYPE (obj
))
4043 mark_p
= (live_string_p (m
, po
)
4044 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4048 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4052 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4056 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4059 case Lisp_Vectorlike
:
4060 /* Note: can't check GC_BUFFERP before we know it's a
4061 buffer because checking that dereferences the pointer
4062 PO which might point anywhere. */
4063 if (live_vector_p (m
, po
))
4064 mark_p
= !GC_SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4065 else if (live_buffer_p (m
, po
))
4066 mark_p
= GC_BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4070 mark_p
= (live_misc_p (m
, po
) && !XMARKER (obj
)->gcmarkbit
);
4074 case Lisp_Type_Limit
:
4080 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4081 if (nzombies
< MAX_ZOMBIES
)
4082 zombies
[nzombies
] = obj
;
4091 /* If P points to Lisp data, mark that as live if it isn't already
4095 mark_maybe_pointer (p
)
4100 /* Quickly rule out some values which can't point to Lisp data. We
4101 assume that Lisp data is aligned on even addresses. */
4102 if ((EMACS_INT
) p
& 1)
4108 Lisp_Object obj
= Qnil
;
4112 case MEM_TYPE_NON_LISP
:
4113 /* Nothing to do; not a pointer to Lisp memory. */
4116 case MEM_TYPE_BUFFER
:
4117 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4118 XSETVECTOR (obj
, p
);
4122 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4126 case MEM_TYPE_STRING
:
4127 if (live_string_p (m
, p
)
4128 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4129 XSETSTRING (obj
, p
);
4133 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4137 case MEM_TYPE_SYMBOL
:
4138 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4139 XSETSYMBOL (obj
, p
);
4142 case MEM_TYPE_FLOAT
:
4143 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4147 case MEM_TYPE_VECTOR
:
4148 case MEM_TYPE_PROCESS
:
4149 case MEM_TYPE_HASH_TABLE
:
4150 case MEM_TYPE_FRAME
:
4151 case MEM_TYPE_WINDOW
:
4152 if (live_vector_p (m
, p
))
4155 XSETVECTOR (tem
, p
);
4156 if (!GC_SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4171 /* Mark Lisp objects referenced from the address range START..END. */
4174 mark_memory (start
, end
)
4180 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4184 /* Make START the pointer to the start of the memory region,
4185 if it isn't already. */
4193 /* Mark Lisp_Objects. */
4194 for (p
= (Lisp_Object
*) start
; (void *) p
< end
; ++p
)
4195 mark_maybe_object (*p
);
4197 /* Mark Lisp data pointed to. This is necessary because, in some
4198 situations, the C compiler optimizes Lisp objects away, so that
4199 only a pointer to them remains. Example:
4201 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4204 Lisp_Object obj = build_string ("test");
4205 struct Lisp_String *s = XSTRING (obj);
4206 Fgarbage_collect ();
4207 fprintf (stderr, "test `%s'\n", s->data);
4211 Here, `obj' isn't really used, and the compiler optimizes it
4212 away. The only reference to the life string is through the
4215 for (pp
= (void **) start
; (void *) pp
< end
; ++pp
)
4216 mark_maybe_pointer (*pp
);
4219 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4220 the GCC system configuration. In gcc 3.2, the only systems for
4221 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4222 by others?) and ns32k-pc532-min. */
4224 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4226 static int setjmp_tested_p
, longjmps_done
;
4228 #define SETJMP_WILL_LIKELY_WORK "\
4230 Emacs garbage collector has been changed to use conservative stack\n\
4231 marking. Emacs has determined that the method it uses to do the\n\
4232 marking will likely work on your system, but this isn't sure.\n\
4234 If you are a system-programmer, or can get the help of a local wizard\n\
4235 who is, please take a look at the function mark_stack in alloc.c, and\n\
4236 verify that the methods used are appropriate for your system.\n\
4238 Please mail the result to <emacs-devel@gnu.org>.\n\
4241 #define SETJMP_WILL_NOT_WORK "\
4243 Emacs garbage collector has been changed to use conservative stack\n\
4244 marking. Emacs has determined that the default method it uses to do the\n\
4245 marking will not work on your system. We will need a system-dependent\n\
4246 solution for your system.\n\
4248 Please take a look at the function mark_stack in alloc.c, and\n\
4249 try to find a way to make it work on your system.\n\
4251 Note that you may get false negatives, depending on the compiler.\n\
4252 In particular, you need to use -O with GCC for this test.\n\
4254 Please mail the result to <emacs-devel@gnu.org>.\n\
4258 /* Perform a quick check if it looks like setjmp saves registers in a
4259 jmp_buf. Print a message to stderr saying so. When this test
4260 succeeds, this is _not_ a proof that setjmp is sufficient for
4261 conservative stack marking. Only the sources or a disassembly
4272 /* Arrange for X to be put in a register. */
4278 if (longjmps_done
== 1)
4280 /* Came here after the longjmp at the end of the function.
4282 If x == 1, the longjmp has restored the register to its
4283 value before the setjmp, and we can hope that setjmp
4284 saves all such registers in the jmp_buf, although that
4287 For other values of X, either something really strange is
4288 taking place, or the setjmp just didn't save the register. */
4291 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4294 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4301 if (longjmps_done
== 1)
4305 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4308 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4310 /* Abort if anything GCPRO'd doesn't survive the GC. */
4318 for (p
= gcprolist
; p
; p
= p
->next
)
4319 for (i
= 0; i
< p
->nvars
; ++i
)
4320 if (!survives_gc_p (p
->var
[i
]))
4321 /* FIXME: It's not necessarily a bug. It might just be that the
4322 GCPRO is unnecessary or should release the object sooner. */
4326 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4333 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4334 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4336 fprintf (stderr
, " %d = ", i
);
4337 debug_print (zombies
[i
]);
4341 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4344 /* Mark live Lisp objects on the C stack.
4346 There are several system-dependent problems to consider when
4347 porting this to new architectures:
4351 We have to mark Lisp objects in CPU registers that can hold local
4352 variables or are used to pass parameters.
4354 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4355 something that either saves relevant registers on the stack, or
4356 calls mark_maybe_object passing it each register's contents.
4358 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4359 implementation assumes that calling setjmp saves registers we need
4360 to see in a jmp_buf which itself lies on the stack. This doesn't
4361 have to be true! It must be verified for each system, possibly
4362 by taking a look at the source code of setjmp.
4366 Architectures differ in the way their processor stack is organized.
4367 For example, the stack might look like this
4370 | Lisp_Object | size = 4
4372 | something else | size = 2
4374 | Lisp_Object | size = 4
4378 In such a case, not every Lisp_Object will be aligned equally. To
4379 find all Lisp_Object on the stack it won't be sufficient to walk
4380 the stack in steps of 4 bytes. Instead, two passes will be
4381 necessary, one starting at the start of the stack, and a second
4382 pass starting at the start of the stack + 2. Likewise, if the
4383 minimal alignment of Lisp_Objects on the stack is 1, four passes
4384 would be necessary, each one starting with one byte more offset
4385 from the stack start.
4387 The current code assumes by default that Lisp_Objects are aligned
4388 equally on the stack. */
4395 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4398 /* This trick flushes the register windows so that all the state of
4399 the process is contained in the stack. */
4400 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4401 needed on ia64 too. See mach_dep.c, where it also says inline
4402 assembler doesn't work with relevant proprietary compilers. */
4407 /* Save registers that we need to see on the stack. We need to see
4408 registers used to hold register variables and registers used to
4410 #ifdef GC_SAVE_REGISTERS_ON_STACK
4411 GC_SAVE_REGISTERS_ON_STACK (end
);
4412 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4414 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4415 setjmp will definitely work, test it
4416 and print a message with the result
4418 if (!setjmp_tested_p
)
4420 setjmp_tested_p
= 1;
4423 #endif /* GC_SETJMP_WORKS */
4426 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4427 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4429 /* This assumes that the stack is a contiguous region in memory. If
4430 that's not the case, something has to be done here to iterate
4431 over the stack segments. */
4432 #ifndef GC_LISP_OBJECT_ALIGNMENT
4434 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4436 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4439 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4440 mark_memory ((char *) stack_base
+ i
, end
);
4441 /* Allow for marking a secondary stack, like the register stack on the
4443 #ifdef GC_MARK_SECONDARY_STACK
4444 GC_MARK_SECONDARY_STACK ();
4447 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4452 #endif /* GC_MARK_STACK != 0 */
4456 /* Return 1 if OBJ is a valid lisp object.
4457 Return 0 if OBJ is NOT a valid lisp object.
4458 Return -1 if we cannot validate OBJ.
4459 This function can be quite slow,
4460 so it should only be used in code for manual debugging. */
4463 valid_lisp_object_p (obj
)
4476 p
= (void *) XPNTR (obj
);
4477 if (PURE_POINTER_P (p
))
4481 /* We need to determine whether it is safe to access memory at
4482 address P. Obviously, we cannot just access it (we would SEGV
4483 trying), so we trick the o/s to tell us whether p is a valid
4484 pointer. Unfortunately, we cannot use NULL_DEVICE here, as
4485 emacs_write may not validate p in that case. */
4486 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4488 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4490 unlink ("__Valid__Lisp__Object__");
4504 case MEM_TYPE_NON_LISP
:
4507 case MEM_TYPE_BUFFER
:
4508 return live_buffer_p (m
, p
);
4511 return live_cons_p (m
, p
);
4513 case MEM_TYPE_STRING
:
4514 return live_string_p (m
, p
);
4517 return live_misc_p (m
, p
);
4519 case MEM_TYPE_SYMBOL
:
4520 return live_symbol_p (m
, p
);
4522 case MEM_TYPE_FLOAT
:
4523 return live_float_p (m
, p
);
4525 case MEM_TYPE_VECTOR
:
4526 case MEM_TYPE_PROCESS
:
4527 case MEM_TYPE_HASH_TABLE
:
4528 case MEM_TYPE_FRAME
:
4529 case MEM_TYPE_WINDOW
:
4530 return live_vector_p (m
, p
);
4543 /***********************************************************************
4544 Pure Storage Management
4545 ***********************************************************************/
4547 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4548 pointer to it. TYPE is the Lisp type for which the memory is
4549 allocated. TYPE < 0 means it's not used for a Lisp object.
4551 If store_pure_type_info is set and TYPE is >= 0, the type of
4552 the allocated object is recorded in pure_types. */
4554 static POINTER_TYPE
*
4555 pure_alloc (size
, type
)
4559 POINTER_TYPE
*result
;
4561 size_t alignment
= (1 << GCTYPEBITS
);
4563 size_t alignment
= sizeof (EMACS_INT
);
4565 /* Give Lisp_Floats an extra alignment. */
4566 if (type
== Lisp_Float
)
4568 #if defined __GNUC__ && __GNUC__ >= 2
4569 alignment
= __alignof (struct Lisp_Float
);
4571 alignment
= sizeof (struct Lisp_Float
);
4577 result
= ALIGN (purebeg
+ pure_bytes_used
, alignment
);
4578 pure_bytes_used
= ((char *)result
- (char *)purebeg
) + size
;
4580 if (pure_bytes_used
<= pure_size
)
4583 /* Don't allocate a large amount here,
4584 because it might get mmap'd and then its address
4585 might not be usable. */
4586 purebeg
= (char *) xmalloc (10000);
4588 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4589 pure_bytes_used
= 0;
4594 /* Print a warning if PURESIZE is too small. */
4599 if (pure_bytes_used_before_overflow
)
4600 message ("Pure Lisp storage overflow (approx. %d bytes needed)",
4601 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4605 /* Return a string allocated in pure space. DATA is a buffer holding
4606 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4607 non-zero means make the result string multibyte.
4609 Must get an error if pure storage is full, since if it cannot hold
4610 a large string it may be able to hold conses that point to that
4611 string; then the string is not protected from gc. */
4614 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4620 struct Lisp_String
*s
;
4622 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4623 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4625 s
->size_byte
= multibyte
? nbytes
: -1;
4626 bcopy (data
, s
->data
, nbytes
);
4627 s
->data
[nbytes
] = '\0';
4628 s
->intervals
= NULL_INTERVAL
;
4629 XSETSTRING (string
, s
);
4634 /* Return a cons allocated from pure space. Give it pure copies
4635 of CAR as car and CDR as cdr. */
4638 pure_cons (car
, cdr
)
4639 Lisp_Object car
, cdr
;
4641 register Lisp_Object
new;
4642 struct Lisp_Cons
*p
;
4644 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4646 XSETCAR (new, Fpurecopy (car
));
4647 XSETCDR (new, Fpurecopy (cdr
));
4652 /* Value is a float object with value NUM allocated from pure space. */
4655 make_pure_float (num
)
4658 register Lisp_Object
new;
4659 struct Lisp_Float
*p
;
4661 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4663 XFLOAT_DATA (new) = num
;
4668 /* Return a vector with room for LEN Lisp_Objects allocated from
4672 make_pure_vector (len
)
4676 struct Lisp_Vector
*p
;
4677 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4679 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4680 XSETVECTOR (new, p
);
4681 XVECTOR (new)->size
= len
;
4686 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4687 doc
: /* Make a copy of OBJECT in pure storage.
4688 Recursively copies contents of vectors and cons cells.
4689 Does not copy symbols. Copies strings without text properties. */)
4691 register Lisp_Object obj
;
4693 if (NILP (Vpurify_flag
))
4696 if (PURE_POINTER_P (XPNTR (obj
)))
4700 return pure_cons (XCAR (obj
), XCDR (obj
));
4701 else if (FLOATP (obj
))
4702 return make_pure_float (XFLOAT_DATA (obj
));
4703 else if (STRINGP (obj
))
4704 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4706 STRING_MULTIBYTE (obj
));
4707 else if (COMPILEDP (obj
) || VECTORP (obj
))
4709 register struct Lisp_Vector
*vec
;
4713 size
= XVECTOR (obj
)->size
;
4714 if (size
& PSEUDOVECTOR_FLAG
)
4715 size
&= PSEUDOVECTOR_SIZE_MASK
;
4716 vec
= XVECTOR (make_pure_vector (size
));
4717 for (i
= 0; i
< size
; i
++)
4718 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4719 if (COMPILEDP (obj
))
4720 XSETCOMPILED (obj
, vec
);
4722 XSETVECTOR (obj
, vec
);
4725 else if (MARKERP (obj
))
4726 error ("Attempt to copy a marker to pure storage");
4733 /***********************************************************************
4735 ***********************************************************************/
4737 /* Put an entry in staticvec, pointing at the variable with address
4741 staticpro (varaddress
)
4742 Lisp_Object
*varaddress
;
4744 staticvec
[staticidx
++] = varaddress
;
4745 if (staticidx
>= NSTATICS
)
4753 struct catchtag
*next
;
4757 /***********************************************************************
4759 ***********************************************************************/
4761 /* Temporarily prevent garbage collection. */
4764 inhibit_garbage_collection ()
4766 int count
= SPECPDL_INDEX ();
4767 int nbits
= min (VALBITS
, BITS_PER_INT
);
4769 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4774 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4775 doc
: /* Reclaim storage for Lisp objects no longer needed.
4776 Garbage collection happens automatically if you cons more than
4777 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4778 `garbage-collect' normally returns a list with info on amount of space in use:
4779 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4780 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4781 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4782 (USED-STRINGS . FREE-STRINGS))
4783 However, if there was overflow in pure space, `garbage-collect'
4784 returns nil, because real GC can't be done. */)
4787 register struct specbinding
*bind
;
4788 struct catchtag
*catch;
4789 struct handler
*handler
;
4790 char stack_top_variable
;
4793 Lisp_Object total
[8];
4794 int count
= SPECPDL_INDEX ();
4795 EMACS_TIME t1
, t2
, t3
;
4800 /* Can't GC if pure storage overflowed because we can't determine
4801 if something is a pure object or not. */
4802 if (pure_bytes_used_before_overflow
)
4807 /* Don't keep undo information around forever.
4808 Do this early on, so it is no problem if the user quits. */
4810 register struct buffer
*nextb
= all_buffers
;
4814 /* If a buffer's undo list is Qt, that means that undo is
4815 turned off in that buffer. Calling truncate_undo_list on
4816 Qt tends to return NULL, which effectively turns undo back on.
4817 So don't call truncate_undo_list if undo_list is Qt. */
4818 if (! NILP (nextb
->name
) && ! EQ (nextb
->undo_list
, Qt
))
4819 truncate_undo_list (nextb
);
4821 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4822 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
))
4824 /* If a buffer's gap size is more than 10% of the buffer
4825 size, or larger than 2000 bytes, then shrink it
4826 accordingly. Keep a minimum size of 20 bytes. */
4827 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4829 if (nextb
->text
->gap_size
> size
)
4831 struct buffer
*save_current
= current_buffer
;
4832 current_buffer
= nextb
;
4833 make_gap (-(nextb
->text
->gap_size
- size
));
4834 current_buffer
= save_current
;
4838 nextb
= nextb
->next
;
4842 EMACS_GET_TIME (t1
);
4844 /* In case user calls debug_print during GC,
4845 don't let that cause a recursive GC. */
4846 consing_since_gc
= 0;
4848 /* Save what's currently displayed in the echo area. */
4849 message_p
= push_message ();
4850 record_unwind_protect (pop_message_unwind
, Qnil
);
4852 /* Save a copy of the contents of the stack, for debugging. */
4853 #if MAX_SAVE_STACK > 0
4854 if (NILP (Vpurify_flag
))
4856 i
= &stack_top_variable
- stack_bottom
;
4858 if (i
< MAX_SAVE_STACK
)
4860 if (stack_copy
== 0)
4861 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
4862 else if (stack_copy_size
< i
)
4863 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
4866 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
4867 bcopy (stack_bottom
, stack_copy
, i
);
4869 bcopy (&stack_top_variable
, stack_copy
, i
);
4873 #endif /* MAX_SAVE_STACK > 0 */
4875 if (garbage_collection_messages
)
4876 message1_nolog ("Garbage collecting...");
4880 shrink_regexp_cache ();
4884 /* clear_marks (); */
4886 /* Mark all the special slots that serve as the roots of accessibility. */
4888 for (i
= 0; i
< staticidx
; i
++)
4889 mark_object (*staticvec
[i
]);
4891 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4893 mark_object (bind
->symbol
);
4894 mark_object (bind
->old_value
);
4900 extern void xg_mark_data ();
4905 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
4906 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
4910 register struct gcpro
*tail
;
4911 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4912 for (i
= 0; i
< tail
->nvars
; i
++)
4913 mark_object (tail
->var
[i
]);
4918 for (catch = catchlist
; catch; catch = catch->next
)
4920 mark_object (catch->tag
);
4921 mark_object (catch->val
);
4923 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
4925 mark_object (handler
->handler
);
4926 mark_object (handler
->var
);
4930 #ifdef HAVE_WINDOW_SYSTEM
4931 mark_fringe_data ();
4934 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4938 /* Everything is now marked, except for the things that require special
4939 finalization, i.e. the undo_list.
4940 Look thru every buffer's undo list
4941 for elements that update markers that were not marked,
4944 register struct buffer
*nextb
= all_buffers
;
4948 /* If a buffer's undo list is Qt, that means that undo is
4949 turned off in that buffer. Calling truncate_undo_list on
4950 Qt tends to return NULL, which effectively turns undo back on.
4951 So don't call truncate_undo_list if undo_list is Qt. */
4952 if (! EQ (nextb
->undo_list
, Qt
))
4954 Lisp_Object tail
, prev
;
4955 tail
= nextb
->undo_list
;
4957 while (CONSP (tail
))
4959 if (GC_CONSP (XCAR (tail
))
4960 && GC_MARKERP (XCAR (XCAR (tail
)))
4961 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
4964 nextb
->undo_list
= tail
= XCDR (tail
);
4968 XSETCDR (prev
, tail
);
4978 /* Now that we have stripped the elements that need not be in the
4979 undo_list any more, we can finally mark the list. */
4980 mark_object (nextb
->undo_list
);
4982 nextb
= nextb
->next
;
4988 /* Clear the mark bits that we set in certain root slots. */
4990 unmark_byte_stack ();
4991 VECTOR_UNMARK (&buffer_defaults
);
4992 VECTOR_UNMARK (&buffer_local_symbols
);
4994 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5002 /* clear_marks (); */
5005 consing_since_gc
= 0;
5006 if (gc_cons_threshold
< 10000)
5007 gc_cons_threshold
= 10000;
5009 if (FLOATP (Vgc_cons_percentage
))
5010 { /* Set gc_cons_combined_threshold. */
5011 EMACS_INT total
= 0;
5013 total
+= total_conses
* sizeof (struct Lisp_Cons
);
5014 total
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5015 total
+= total_markers
* sizeof (union Lisp_Misc
);
5016 total
+= total_string_size
;
5017 total
+= total_vector_size
* sizeof (Lisp_Object
);
5018 total
+= total_floats
* sizeof (struct Lisp_Float
);
5019 total
+= total_intervals
* sizeof (struct interval
);
5020 total
+= total_strings
* sizeof (struct Lisp_String
);
5022 gc_relative_threshold
= total
* XFLOAT_DATA (Vgc_cons_percentage
);
5025 gc_relative_threshold
= 0;
5027 if (garbage_collection_messages
)
5029 if (message_p
|| minibuf_level
> 0)
5032 message1_nolog ("Garbage collecting...done");
5035 unbind_to (count
, Qnil
);
5037 total
[0] = Fcons (make_number (total_conses
),
5038 make_number (total_free_conses
));
5039 total
[1] = Fcons (make_number (total_symbols
),
5040 make_number (total_free_symbols
));
5041 total
[2] = Fcons (make_number (total_markers
),
5042 make_number (total_free_markers
));
5043 total
[3] = make_number (total_string_size
);
5044 total
[4] = make_number (total_vector_size
);
5045 total
[5] = Fcons (make_number (total_floats
),
5046 make_number (total_free_floats
));
5047 total
[6] = Fcons (make_number (total_intervals
),
5048 make_number (total_free_intervals
));
5049 total
[7] = Fcons (make_number (total_strings
),
5050 make_number (total_free_strings
));
5052 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5054 /* Compute average percentage of zombies. */
5057 for (i
= 0; i
< 7; ++i
)
5058 if (CONSP (total
[i
]))
5059 nlive
+= XFASTINT (XCAR (total
[i
]));
5061 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5062 max_live
= max (nlive
, max_live
);
5063 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5064 max_zombies
= max (nzombies
, max_zombies
);
5069 if (!NILP (Vpost_gc_hook
))
5071 int count
= inhibit_garbage_collection ();
5072 safe_run_hooks (Qpost_gc_hook
);
5073 unbind_to (count
, Qnil
);
5076 /* Accumulate statistics. */
5077 EMACS_GET_TIME (t2
);
5078 EMACS_SUB_TIME (t3
, t2
, t1
);
5079 if (FLOATP (Vgc_elapsed
))
5080 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5082 EMACS_USECS (t3
) * 1.0e-6);
5085 return Flist (sizeof total
/ sizeof *total
, total
);
5089 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5090 only interesting objects referenced from glyphs are strings. */
5093 mark_glyph_matrix (matrix
)
5094 struct glyph_matrix
*matrix
;
5096 struct glyph_row
*row
= matrix
->rows
;
5097 struct glyph_row
*end
= row
+ matrix
->nrows
;
5099 for (; row
< end
; ++row
)
5103 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5105 struct glyph
*glyph
= row
->glyphs
[area
];
5106 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5108 for (; glyph
< end_glyph
; ++glyph
)
5109 if (GC_STRINGP (glyph
->object
)
5110 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5111 mark_object (glyph
->object
);
5117 /* Mark Lisp faces in the face cache C. */
5121 struct face_cache
*c
;
5126 for (i
= 0; i
< c
->used
; ++i
)
5128 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5132 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5133 mark_object (face
->lface
[j
]);
5140 #ifdef HAVE_WINDOW_SYSTEM
5142 /* Mark Lisp objects in image IMG. */
5148 mark_object (img
->spec
);
5150 if (!NILP (img
->data
.lisp_val
))
5151 mark_object (img
->data
.lisp_val
);
5155 /* Mark Lisp objects in image cache of frame F. It's done this way so
5156 that we don't have to include xterm.h here. */
5159 mark_image_cache (f
)
5162 forall_images_in_image_cache (f
, mark_image
);
5165 #endif /* HAVE_X_WINDOWS */
5169 /* Mark reference to a Lisp_Object.
5170 If the object referred to has not been seen yet, recursively mark
5171 all the references contained in it. */
5173 #define LAST_MARKED_SIZE 500
5174 Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5175 int last_marked_index
;
5177 /* For debugging--call abort when we cdr down this many
5178 links of a list, in mark_object. In debugging,
5179 the call to abort will hit a breakpoint.
5180 Normally this is zero and the check never goes off. */
5181 int mark_object_loop_halt
;
5187 register Lisp_Object obj
= arg
;
5188 #ifdef GC_CHECK_MARKED_OBJECTS
5196 if (PURE_POINTER_P (XPNTR (obj
)))
5199 last_marked
[last_marked_index
++] = obj
;
5200 if (last_marked_index
== LAST_MARKED_SIZE
)
5201 last_marked_index
= 0;
5203 /* Perform some sanity checks on the objects marked here. Abort if
5204 we encounter an object we know is bogus. This increases GC time
5205 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5206 #ifdef GC_CHECK_MARKED_OBJECTS
5208 po
= (void *) XPNTR (obj
);
5210 /* Check that the object pointed to by PO is known to be a Lisp
5211 structure allocated from the heap. */
5212 #define CHECK_ALLOCATED() \
5214 m = mem_find (po); \
5219 /* Check that the object pointed to by PO is live, using predicate
5221 #define CHECK_LIVE(LIVEP) \
5223 if (!LIVEP (m, po)) \
5227 /* Check both of the above conditions. */
5228 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5230 CHECK_ALLOCATED (); \
5231 CHECK_LIVE (LIVEP); \
5234 #else /* not GC_CHECK_MARKED_OBJECTS */
5236 #define CHECK_ALLOCATED() (void) 0
5237 #define CHECK_LIVE(LIVEP) (void) 0
5238 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5240 #endif /* not GC_CHECK_MARKED_OBJECTS */
5242 switch (SWITCH_ENUM_CAST (XGCTYPE (obj
)))
5246 register struct Lisp_String
*ptr
= XSTRING (obj
);
5247 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5248 MARK_INTERVAL_TREE (ptr
->intervals
);
5250 #ifdef GC_CHECK_STRING_BYTES
5251 /* Check that the string size recorded in the string is the
5252 same as the one recorded in the sdata structure. */
5253 CHECK_STRING_BYTES (ptr
);
5254 #endif /* GC_CHECK_STRING_BYTES */
5258 case Lisp_Vectorlike
:
5259 #ifdef GC_CHECK_MARKED_OBJECTS
5261 if (m
== MEM_NIL
&& !GC_SUBRP (obj
)
5262 && po
!= &buffer_defaults
5263 && po
!= &buffer_local_symbols
)
5265 #endif /* GC_CHECK_MARKED_OBJECTS */
5267 if (GC_BUFFERP (obj
))
5269 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
5271 #ifdef GC_CHECK_MARKED_OBJECTS
5272 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5275 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
5280 #endif /* GC_CHECK_MARKED_OBJECTS */
5284 else if (GC_SUBRP (obj
))
5286 else if (GC_COMPILEDP (obj
))
5287 /* We could treat this just like a vector, but it is better to
5288 save the COMPILED_CONSTANTS element for last and avoid
5291 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5292 register EMACS_INT size
= ptr
->size
;
5295 if (VECTOR_MARKED_P (ptr
))
5296 break; /* Already marked */
5298 CHECK_LIVE (live_vector_p
);
5299 VECTOR_MARK (ptr
); /* Else mark it */
5300 size
&= PSEUDOVECTOR_SIZE_MASK
;
5301 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5303 if (i
!= COMPILED_CONSTANTS
)
5304 mark_object (ptr
->contents
[i
]);
5306 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5309 else if (GC_FRAMEP (obj
))
5311 register struct frame
*ptr
= XFRAME (obj
);
5313 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
5314 VECTOR_MARK (ptr
); /* Else mark it */
5316 CHECK_LIVE (live_vector_p
);
5317 mark_object (ptr
->name
);
5318 mark_object (ptr
->icon_name
);
5319 mark_object (ptr
->title
);
5320 mark_object (ptr
->focus_frame
);
5321 mark_object (ptr
->selected_window
);
5322 mark_object (ptr
->minibuffer_window
);
5323 mark_object (ptr
->param_alist
);
5324 mark_object (ptr
->scroll_bars
);
5325 mark_object (ptr
->condemned_scroll_bars
);
5326 mark_object (ptr
->menu_bar_items
);
5327 mark_object (ptr
->face_alist
);
5328 mark_object (ptr
->menu_bar_vector
);
5329 mark_object (ptr
->buffer_predicate
);
5330 mark_object (ptr
->buffer_list
);
5331 mark_object (ptr
->menu_bar_window
);
5332 mark_object (ptr
->tool_bar_window
);
5333 mark_face_cache (ptr
->face_cache
);
5334 #ifdef HAVE_WINDOW_SYSTEM
5335 mark_image_cache (ptr
);
5336 mark_object (ptr
->tool_bar_items
);
5337 mark_object (ptr
->desired_tool_bar_string
);
5338 mark_object (ptr
->current_tool_bar_string
);
5339 #endif /* HAVE_WINDOW_SYSTEM */
5341 else if (GC_BOOL_VECTOR_P (obj
))
5343 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5345 if (VECTOR_MARKED_P (ptr
))
5346 break; /* Already marked */
5347 CHECK_LIVE (live_vector_p
);
5348 VECTOR_MARK (ptr
); /* Else mark it */
5350 else if (GC_WINDOWP (obj
))
5352 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5353 struct window
*w
= XWINDOW (obj
);
5356 /* Stop if already marked. */
5357 if (VECTOR_MARKED_P (ptr
))
5361 CHECK_LIVE (live_vector_p
);
5364 /* There is no Lisp data above The member CURRENT_MATRIX in
5365 struct WINDOW. Stop marking when that slot is reached. */
5367 (char *) &ptr
->contents
[i
] < (char *) &w
->current_matrix
;
5369 mark_object (ptr
->contents
[i
]);
5371 /* Mark glyphs for leaf windows. Marking window matrices is
5372 sufficient because frame matrices use the same glyph
5374 if (NILP (w
->hchild
)
5376 && w
->current_matrix
)
5378 mark_glyph_matrix (w
->current_matrix
);
5379 mark_glyph_matrix (w
->desired_matrix
);
5382 else if (GC_HASH_TABLE_P (obj
))
5384 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5386 /* Stop if already marked. */
5387 if (VECTOR_MARKED_P (h
))
5391 CHECK_LIVE (live_vector_p
);
5394 /* Mark contents. */
5395 /* Do not mark next_free or next_weak.
5396 Being in the next_weak chain
5397 should not keep the hash table alive.
5398 No need to mark `count' since it is an integer. */
5399 mark_object (h
->test
);
5400 mark_object (h
->weak
);
5401 mark_object (h
->rehash_size
);
5402 mark_object (h
->rehash_threshold
);
5403 mark_object (h
->hash
);
5404 mark_object (h
->next
);
5405 mark_object (h
->index
);
5406 mark_object (h
->user_hash_function
);
5407 mark_object (h
->user_cmp_function
);
5409 /* If hash table is not weak, mark all keys and values.
5410 For weak tables, mark only the vector. */
5411 if (GC_NILP (h
->weak
))
5412 mark_object (h
->key_and_value
);
5414 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5418 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5419 register EMACS_INT size
= ptr
->size
;
5422 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
5423 CHECK_LIVE (live_vector_p
);
5424 VECTOR_MARK (ptr
); /* Else mark it */
5425 if (size
& PSEUDOVECTOR_FLAG
)
5426 size
&= PSEUDOVECTOR_SIZE_MASK
;
5428 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5429 mark_object (ptr
->contents
[i
]);
5435 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5436 struct Lisp_Symbol
*ptrx
;
5438 if (ptr
->gcmarkbit
) break;
5439 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5441 mark_object (ptr
->value
);
5442 mark_object (ptr
->function
);
5443 mark_object (ptr
->plist
);
5445 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5446 MARK_STRING (XSTRING (ptr
->xname
));
5447 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5449 /* Note that we do not mark the obarray of the symbol.
5450 It is safe not to do so because nothing accesses that
5451 slot except to check whether it is nil. */
5455 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5456 XSETSYMBOL (obj
, ptrx
);
5463 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5464 if (XMARKER (obj
)->gcmarkbit
)
5466 XMARKER (obj
)->gcmarkbit
= 1;
5468 switch (XMISCTYPE (obj
))
5470 case Lisp_Misc_Buffer_Local_Value
:
5471 case Lisp_Misc_Some_Buffer_Local_Value
:
5473 register struct Lisp_Buffer_Local_Value
*ptr
5474 = XBUFFER_LOCAL_VALUE (obj
);
5475 /* If the cdr is nil, avoid recursion for the car. */
5476 if (EQ (ptr
->cdr
, Qnil
))
5478 obj
= ptr
->realvalue
;
5481 mark_object (ptr
->realvalue
);
5482 mark_object (ptr
->buffer
);
5483 mark_object (ptr
->frame
);
5488 case Lisp_Misc_Marker
:
5489 /* DO NOT mark thru the marker's chain.
5490 The buffer's markers chain does not preserve markers from gc;
5491 instead, markers are removed from the chain when freed by gc. */
5494 case Lisp_Misc_Intfwd
:
5495 case Lisp_Misc_Boolfwd
:
5496 case Lisp_Misc_Objfwd
:
5497 case Lisp_Misc_Buffer_Objfwd
:
5498 case Lisp_Misc_Kboard_Objfwd
:
5499 /* Don't bother with Lisp_Buffer_Objfwd,
5500 since all markable slots in current buffer marked anyway. */
5501 /* Don't need to do Lisp_Objfwd, since the places they point
5502 are protected with staticpro. */
5505 case Lisp_Misc_Save_Value
:
5508 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5509 /* If DOGC is set, POINTER is the address of a memory
5510 area containing INTEGER potential Lisp_Objects. */
5513 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5515 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5516 mark_maybe_object (*p
);
5522 case Lisp_Misc_Overlay
:
5524 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5525 mark_object (ptr
->start
);
5526 mark_object (ptr
->end
);
5527 mark_object (ptr
->plist
);
5530 XSETMISC (obj
, ptr
->next
);
5543 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5544 if (CONS_MARKED_P (ptr
)) break;
5545 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5547 /* If the cdr is nil, avoid recursion for the car. */
5548 if (EQ (ptr
->u
.cdr
, Qnil
))
5554 mark_object (ptr
->car
);
5557 if (cdr_count
== mark_object_loop_halt
)
5563 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5564 FLOAT_MARK (XFLOAT (obj
));
5575 #undef CHECK_ALLOCATED
5576 #undef CHECK_ALLOCATED_AND_LIVE
5579 /* Mark the pointers in a buffer structure. */
5585 register struct buffer
*buffer
= XBUFFER (buf
);
5586 register Lisp_Object
*ptr
, tmp
;
5587 Lisp_Object base_buffer
;
5589 VECTOR_MARK (buffer
);
5591 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5593 /* For now, we just don't mark the undo_list. It's done later in
5594 a special way just before the sweep phase, and after stripping
5595 some of its elements that are not needed any more. */
5597 if (buffer
->overlays_before
)
5599 XSETMISC (tmp
, buffer
->overlays_before
);
5602 if (buffer
->overlays_after
)
5604 XSETMISC (tmp
, buffer
->overlays_after
);
5608 for (ptr
= &buffer
->name
;
5609 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5613 /* If this is an indirect buffer, mark its base buffer. */
5614 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5616 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5617 mark_buffer (base_buffer
);
5622 /* Value is non-zero if OBJ will survive the current GC because it's
5623 either marked or does not need to be marked to survive. */
5631 switch (XGCTYPE (obj
))
5638 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5642 survives_p
= XMARKER (obj
)->gcmarkbit
;
5646 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5649 case Lisp_Vectorlike
:
5650 survives_p
= GC_SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5654 survives_p
= CONS_MARKED_P (XCONS (obj
));
5658 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5665 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5670 /* Sweep: find all structures not marked, and free them. */
5675 /* Remove or mark entries in weak hash tables.
5676 This must be done before any object is unmarked. */
5677 sweep_weak_hash_tables ();
5680 #ifdef GC_CHECK_STRING_BYTES
5681 if (!noninteractive
)
5682 check_string_bytes (1);
5685 /* Put all unmarked conses on free list */
5687 register struct cons_block
*cblk
;
5688 struct cons_block
**cprev
= &cons_block
;
5689 register int lim
= cons_block_index
;
5690 register int num_free
= 0, num_used
= 0;
5694 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5698 for (i
= 0; i
< lim
; i
++)
5699 if (!CONS_MARKED_P (&cblk
->conses
[i
]))
5702 cblk
->conses
[i
].u
.chain
= cons_free_list
;
5703 cons_free_list
= &cblk
->conses
[i
];
5705 cons_free_list
->car
= Vdead
;
5711 CONS_UNMARK (&cblk
->conses
[i
]);
5713 lim
= CONS_BLOCK_SIZE
;
5714 /* If this block contains only free conses and we have already
5715 seen more than two blocks worth of free conses then deallocate
5717 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5719 *cprev
= cblk
->next
;
5720 /* Unhook from the free list. */
5721 cons_free_list
= cblk
->conses
[0].u
.chain
;
5722 lisp_align_free (cblk
);
5727 num_free
+= this_free
;
5728 cprev
= &cblk
->next
;
5731 total_conses
= num_used
;
5732 total_free_conses
= num_free
;
5735 /* Put all unmarked floats on free list */
5737 register struct float_block
*fblk
;
5738 struct float_block
**fprev
= &float_block
;
5739 register int lim
= float_block_index
;
5740 register int num_free
= 0, num_used
= 0;
5742 float_free_list
= 0;
5744 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5748 for (i
= 0; i
< lim
; i
++)
5749 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5752 fblk
->floats
[i
].u
.chain
= float_free_list
;
5753 float_free_list
= &fblk
->floats
[i
];
5758 FLOAT_UNMARK (&fblk
->floats
[i
]);
5760 lim
= FLOAT_BLOCK_SIZE
;
5761 /* If this block contains only free floats and we have already
5762 seen more than two blocks worth of free floats then deallocate
5764 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5766 *fprev
= fblk
->next
;
5767 /* Unhook from the free list. */
5768 float_free_list
= fblk
->floats
[0].u
.chain
;
5769 lisp_align_free (fblk
);
5774 num_free
+= this_free
;
5775 fprev
= &fblk
->next
;
5778 total_floats
= num_used
;
5779 total_free_floats
= num_free
;
5782 /* Put all unmarked intervals on free list */
5784 register struct interval_block
*iblk
;
5785 struct interval_block
**iprev
= &interval_block
;
5786 register int lim
= interval_block_index
;
5787 register int num_free
= 0, num_used
= 0;
5789 interval_free_list
= 0;
5791 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5796 for (i
= 0; i
< lim
; i
++)
5798 if (!iblk
->intervals
[i
].gcmarkbit
)
5800 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5801 interval_free_list
= &iblk
->intervals
[i
];
5807 iblk
->intervals
[i
].gcmarkbit
= 0;
5810 lim
= INTERVAL_BLOCK_SIZE
;
5811 /* If this block contains only free intervals and we have already
5812 seen more than two blocks worth of free intervals then
5813 deallocate this block. */
5814 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5816 *iprev
= iblk
->next
;
5817 /* Unhook from the free list. */
5818 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5820 n_interval_blocks
--;
5824 num_free
+= this_free
;
5825 iprev
= &iblk
->next
;
5828 total_intervals
= num_used
;
5829 total_free_intervals
= num_free
;
5832 /* Put all unmarked symbols on free list */
5834 register struct symbol_block
*sblk
;
5835 struct symbol_block
**sprev
= &symbol_block
;
5836 register int lim
= symbol_block_index
;
5837 register int num_free
= 0, num_used
= 0;
5839 symbol_free_list
= NULL
;
5841 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5844 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5845 struct Lisp_Symbol
*end
= sym
+ lim
;
5847 for (; sym
< end
; ++sym
)
5849 /* Check if the symbol was created during loadup. In such a case
5850 it might be pointed to by pure bytecode which we don't trace,
5851 so we conservatively assume that it is live. */
5852 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5854 if (!sym
->gcmarkbit
&& !pure_p
)
5856 sym
->next
= symbol_free_list
;
5857 symbol_free_list
= sym
;
5859 symbol_free_list
->function
= Vdead
;
5867 UNMARK_STRING (XSTRING (sym
->xname
));
5872 lim
= SYMBOL_BLOCK_SIZE
;
5873 /* If this block contains only free symbols and we have already
5874 seen more than two blocks worth of free symbols then deallocate
5876 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5878 *sprev
= sblk
->next
;
5879 /* Unhook from the free list. */
5880 symbol_free_list
= sblk
->symbols
[0].next
;
5886 num_free
+= this_free
;
5887 sprev
= &sblk
->next
;
5890 total_symbols
= num_used
;
5891 total_free_symbols
= num_free
;
5894 /* Put all unmarked misc's on free list.
5895 For a marker, first unchain it from the buffer it points into. */
5897 register struct marker_block
*mblk
;
5898 struct marker_block
**mprev
= &marker_block
;
5899 register int lim
= marker_block_index
;
5900 register int num_free
= 0, num_used
= 0;
5902 marker_free_list
= 0;
5904 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5909 for (i
= 0; i
< lim
; i
++)
5911 if (!mblk
->markers
[i
].u_marker
.gcmarkbit
)
5913 if (mblk
->markers
[i
].u_marker
.type
== Lisp_Misc_Marker
)
5914 unchain_marker (&mblk
->markers
[i
].u_marker
);
5915 /* Set the type of the freed object to Lisp_Misc_Free.
5916 We could leave the type alone, since nobody checks it,
5917 but this might catch bugs faster. */
5918 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
5919 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
5920 marker_free_list
= &mblk
->markers
[i
];
5926 mblk
->markers
[i
].u_marker
.gcmarkbit
= 0;
5929 lim
= MARKER_BLOCK_SIZE
;
5930 /* If this block contains only free markers and we have already
5931 seen more than two blocks worth of free markers then deallocate
5933 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
5935 *mprev
= mblk
->next
;
5936 /* Unhook from the free list. */
5937 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
5943 num_free
+= this_free
;
5944 mprev
= &mblk
->next
;
5948 total_markers
= num_used
;
5949 total_free_markers
= num_free
;
5952 /* Free all unmarked buffers */
5954 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
5957 if (!VECTOR_MARKED_P (buffer
))
5960 prev
->next
= buffer
->next
;
5962 all_buffers
= buffer
->next
;
5963 next
= buffer
->next
;
5969 VECTOR_UNMARK (buffer
);
5970 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
5971 prev
= buffer
, buffer
= buffer
->next
;
5975 /* Free all unmarked vectors */
5977 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
5978 total_vector_size
= 0;
5981 if (!VECTOR_MARKED_P (vector
))
5984 prev
->next
= vector
->next
;
5986 all_vectors
= vector
->next
;
5987 next
= vector
->next
;
5995 VECTOR_UNMARK (vector
);
5996 if (vector
->size
& PSEUDOVECTOR_FLAG
)
5997 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
5999 total_vector_size
+= vector
->size
;
6000 prev
= vector
, vector
= vector
->next
;
6004 #ifdef GC_CHECK_STRING_BYTES
6005 if (!noninteractive
)
6006 check_string_bytes (1);
6013 /* Debugging aids. */
6015 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6016 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6017 This may be helpful in debugging Emacs's memory usage.
6018 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6023 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
6028 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6029 doc
: /* Return a list of counters that measure how much consing there has been.
6030 Each of these counters increments for a certain kind of object.
6031 The counters wrap around from the largest positive integer to zero.
6032 Garbage collection does not decrease them.
6033 The elements of the value are as follows:
6034 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6035 All are in units of 1 = one object consed
6036 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6038 MISCS include overlays, markers, and some internal types.
6039 Frames, windows, buffers, and subprocesses count as vectors
6040 (but the contents of a buffer's text do not count here). */)
6043 Lisp_Object consed
[8];
6045 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6046 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6047 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6048 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6049 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6050 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6051 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6052 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6054 return Flist (8, consed
);
6057 int suppress_checking
;
6059 die (msg
, file
, line
)
6064 fprintf (stderr
, "\r\nEmacs fatal error: %s:%d: %s\r\n",
6069 /* Initialization */
6074 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6076 pure_size
= PURESIZE
;
6077 pure_bytes_used
= 0;
6078 pure_bytes_used_before_overflow
= 0;
6080 /* Initialize the list of free aligned blocks. */
6083 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6085 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6089 ignore_warnings
= 1;
6090 #ifdef DOUG_LEA_MALLOC
6091 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6092 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6093 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6103 malloc_hysteresis
= 32;
6105 malloc_hysteresis
= 0;
6108 refill_memory_reserve ();
6110 ignore_warnings
= 0;
6112 byte_stack_list
= 0;
6114 consing_since_gc
= 0;
6115 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6116 gc_relative_threshold
= 0;
6118 #ifdef VIRT_ADDR_VARIES
6119 malloc_sbrk_unused
= 1<<22; /* A large number */
6120 malloc_sbrk_used
= 100000; /* as reasonable as any number */
6121 #endif /* VIRT_ADDR_VARIES */
6128 byte_stack_list
= 0;
6130 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6131 setjmp_tested_p
= longjmps_done
= 0;
6134 Vgc_elapsed
= make_float (0.0);
6141 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
6142 doc
: /* *Number of bytes of consing between garbage collections.
6143 Garbage collection can happen automatically once this many bytes have been
6144 allocated since the last garbage collection. All data types count.
6146 Garbage collection happens automatically only when `eval' is called.
6148 By binding this temporarily to a large number, you can effectively
6149 prevent garbage collection during a part of the program.
6150 See also `gc-cons-percentage'. */);
6152 DEFVAR_LISP ("gc-cons-percentage", &Vgc_cons_percentage
,
6153 doc
: /* *Portion of the heap used for allocation.
6154 Garbage collection can happen automatically once this portion of the heap
6155 has been allocated since the last garbage collection.
6156 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6157 Vgc_cons_percentage
= make_float (0.1);
6159 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
6160 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6162 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
6163 doc
: /* Number of cons cells that have been consed so far. */);
6165 DEFVAR_INT ("floats-consed", &floats_consed
,
6166 doc
: /* Number of floats that have been consed so far. */);
6168 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
6169 doc
: /* Number of vector cells that have been consed so far. */);
6171 DEFVAR_INT ("symbols-consed", &symbols_consed
,
6172 doc
: /* Number of symbols that have been consed so far. */);
6174 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
6175 doc
: /* Number of string characters that have been consed so far. */);
6177 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
6178 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6180 DEFVAR_INT ("intervals-consed", &intervals_consed
,
6181 doc
: /* Number of intervals that have been consed so far. */);
6183 DEFVAR_INT ("strings-consed", &strings_consed
,
6184 doc
: /* Number of strings that have been consed so far. */);
6186 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
6187 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6188 This means that certain objects should be allocated in shared (pure) space. */);
6190 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
6191 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6192 garbage_collection_messages
= 0;
6194 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
6195 doc
: /* Hook run after garbage collection has finished. */);
6196 Vpost_gc_hook
= Qnil
;
6197 Qpost_gc_hook
= intern ("post-gc-hook");
6198 staticpro (&Qpost_gc_hook
);
6200 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
6201 doc
: /* Precomputed `signal' argument for memory-full error. */);
6202 /* We build this in advance because if we wait until we need it, we might
6203 not be able to allocate the memory to hold it. */
6206 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
6208 DEFVAR_LISP ("memory-full", &Vmemory_full
,
6209 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6210 Vmemory_full
= Qnil
;
6212 staticpro (&Qgc_cons_threshold
);
6213 Qgc_cons_threshold
= intern ("gc-cons-threshold");
6215 staticpro (&Qchar_table_extra_slots
);
6216 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
6218 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
6219 doc
: /* Accumulated time elapsed in garbage collections.
6220 The time is in seconds as a floating point value. */);
6221 DEFVAR_INT ("gcs-done", &gcs_done
,
6222 doc
: /* Accumulated number of garbage collections done. */);
6227 defsubr (&Smake_byte_code
);
6228 defsubr (&Smake_list
);
6229 defsubr (&Smake_vector
);
6230 defsubr (&Smake_string
);
6231 defsubr (&Smake_bool_vector
);
6232 defsubr (&Smake_symbol
);
6233 defsubr (&Smake_marker
);
6234 defsubr (&Spurecopy
);
6235 defsubr (&Sgarbage_collect
);
6236 defsubr (&Smemory_limit
);
6237 defsubr (&Smemory_use_counts
);
6239 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6240 defsubr (&Sgc_status
);
6244 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
6245 (do not change this comment) */