1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
2 Copyright (C) 1985, 1986, 1988, 1993, 1994, 1995, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
5 This file is part of GNU Emacs.
7 GNU Emacs is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU Emacs is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU Emacs; see the file COPYING. If not, write to
19 the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
20 Boston, MA 02110-1301, USA. */
24 #include <limits.h> /* For CHAR_BIT. */
30 /* Note that this declares bzero on OSF/1. How dumb. */
34 #ifdef HAVE_GTK_AND_PTHREAD
38 /* This file is part of the core Lisp implementation, and thus must
39 deal with the real data structures. If the Lisp implementation is
40 replaced, this file likely will not be used. */
42 #undef HIDE_LISP_IMPLEMENTATION
45 #include "intervals.h"
51 #include "blockinput.h"
53 #include "syssignal.h"
56 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
57 memory. Can do this only if using gmalloc.c. */
59 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
60 #undef GC_MALLOC_CHECK
66 extern POINTER_TYPE
*sbrk ();
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_terminals
P_ ((void));
328 extern void mark_kboards
P_ ((void));
329 extern void mark_ttys
P_ ((void));
330 extern void mark_backtrace
P_ ((void));
331 static void gc_sweep
P_ ((void));
332 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
333 static void mark_face_cache
P_ ((struct face_cache
*));
335 #ifdef HAVE_WINDOW_SYSTEM
336 extern void mark_fringe_data
P_ ((void));
337 static void mark_image
P_ ((struct image
*));
338 static void mark_image_cache
P_ ((struct frame
*));
339 #endif /* HAVE_WINDOW_SYSTEM */
341 static struct Lisp_String
*allocate_string
P_ ((void));
342 static void compact_small_strings
P_ ((void));
343 static void free_large_strings
P_ ((void));
344 static void sweep_strings
P_ ((void));
346 extern int message_enable_multibyte
;
348 /* When scanning the C stack for live Lisp objects, Emacs keeps track
349 of what memory allocated via lisp_malloc is intended for what
350 purpose. This enumeration specifies the type of memory. */
361 /* Keep the following vector-like types together, with
362 MEM_TYPE_WINDOW being the last, and MEM_TYPE_VECTOR the
363 first. Or change the code of live_vector_p, for instance. */
371 static POINTER_TYPE
*lisp_align_malloc
P_ ((size_t, enum mem_type
));
372 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
373 void refill_memory_reserve ();
376 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
378 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
379 #include <stdio.h> /* For fprintf. */
382 /* A unique object in pure space used to make some Lisp objects
383 on free lists recognizable in O(1). */
387 #ifdef GC_MALLOC_CHECK
389 enum mem_type allocated_mem_type
;
390 int dont_register_blocks
;
392 #endif /* GC_MALLOC_CHECK */
394 /* A node in the red-black tree describing allocated memory containing
395 Lisp data. Each such block is recorded with its start and end
396 address when it is allocated, and removed from the tree when it
399 A red-black tree is a balanced binary tree with the following
402 1. Every node is either red or black.
403 2. Every leaf is black.
404 3. If a node is red, then both of its children are black.
405 4. Every simple path from a node to a descendant leaf contains
406 the same number of black nodes.
407 5. The root is always black.
409 When nodes are inserted into the tree, or deleted from the tree,
410 the tree is "fixed" so that these properties are always true.
412 A red-black tree with N internal nodes has height at most 2
413 log(N+1). Searches, insertions and deletions are done in O(log N).
414 Please see a text book about data structures for a detailed
415 description of red-black trees. Any book worth its salt should
420 /* Children of this node. These pointers are never NULL. When there
421 is no child, the value is MEM_NIL, which points to a dummy node. */
422 struct mem_node
*left
, *right
;
424 /* The parent of this node. In the root node, this is NULL. */
425 struct mem_node
*parent
;
427 /* Start and end of allocated region. */
431 enum {MEM_BLACK
, MEM_RED
} color
;
437 /* Base address of stack. Set in main. */
439 Lisp_Object
*stack_base
;
441 /* Root of the tree describing allocated Lisp memory. */
443 static struct mem_node
*mem_root
;
445 /* Lowest and highest known address in the heap. */
447 static void *min_heap_address
, *max_heap_address
;
449 /* Sentinel node of the tree. */
451 static struct mem_node mem_z
;
452 #define MEM_NIL &mem_z
454 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
455 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
, enum mem_type
));
456 static void lisp_free
P_ ((POINTER_TYPE
*));
457 static void mark_stack
P_ ((void));
458 static int live_vector_p
P_ ((struct mem_node
*, void *));
459 static int live_buffer_p
P_ ((struct mem_node
*, void *));
460 static int live_string_p
P_ ((struct mem_node
*, void *));
461 static int live_cons_p
P_ ((struct mem_node
*, void *));
462 static int live_symbol_p
P_ ((struct mem_node
*, void *));
463 static int live_float_p
P_ ((struct mem_node
*, void *));
464 static int live_misc_p
P_ ((struct mem_node
*, void *));
465 static void mark_maybe_object
P_ ((Lisp_Object
));
466 static void mark_memory
P_ ((void *, void *));
467 static void mem_init
P_ ((void));
468 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
469 static void mem_insert_fixup
P_ ((struct mem_node
*));
470 static void mem_rotate_left
P_ ((struct mem_node
*));
471 static void mem_rotate_right
P_ ((struct mem_node
*));
472 static void mem_delete
P_ ((struct mem_node
*));
473 static void mem_delete_fixup
P_ ((struct mem_node
*));
474 static INLINE
struct mem_node
*mem_find
P_ ((void *));
477 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
478 static void check_gcpros
P_ ((void));
481 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
483 /* Recording what needs to be marked for gc. */
485 struct gcpro
*gcprolist
;
487 /* Addresses of staticpro'd variables. Initialize it to a nonzero
488 value; otherwise some compilers put it into BSS. */
490 #define NSTATICS 1280
491 Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
493 /* Index of next unused slot in staticvec. */
497 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
500 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
501 ALIGNMENT must be a power of 2. */
503 #define ALIGN(ptr, ALIGNMENT) \
504 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
505 & ~((ALIGNMENT) - 1)))
509 /************************************************************************
511 ************************************************************************/
513 /* Function malloc calls this if it finds we are near exhausting storage. */
519 pending_malloc_warning
= str
;
523 /* Display an already-pending malloc warning. */
526 display_malloc_warning ()
528 call3 (intern ("display-warning"),
530 build_string (pending_malloc_warning
),
531 intern ("emergency"));
532 pending_malloc_warning
= 0;
536 #ifdef DOUG_LEA_MALLOC
537 # define BYTES_USED (mallinfo ().uordblks)
539 # define BYTES_USED _bytes_used
542 /* Called if we can't allocate relocatable space for a buffer. */
545 buffer_memory_full ()
547 /* If buffers use the relocating allocator, no need to free
548 spare_memory, because we may have plenty of malloc space left
549 that we could get, and if we don't, the malloc that fails will
550 itself cause spare_memory to be freed. If buffers don't use the
551 relocating allocator, treat this like any other failing
558 /* This used to call error, but if we've run out of memory, we could
559 get infinite recursion trying to build the string. */
561 Fsignal (Qnil
, Vmemory_signal_data
);
565 #ifdef XMALLOC_OVERRUN_CHECK
567 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
568 and a 16 byte trailer around each block.
570 The header consists of 12 fixed bytes + a 4 byte integer contaning the
571 original block size, while the trailer consists of 16 fixed bytes.
573 The header is used to detect whether this block has been allocated
574 through these functions -- as it seems that some low-level libc
575 functions may bypass the malloc hooks.
579 #define XMALLOC_OVERRUN_CHECK_SIZE 16
581 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
582 { 0x9a, 0x9b, 0xae, 0xaf,
583 0xbf, 0xbe, 0xce, 0xcf,
584 0xea, 0xeb, 0xec, 0xed };
586 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
587 { 0xaa, 0xab, 0xac, 0xad,
588 0xba, 0xbb, 0xbc, 0xbd,
589 0xca, 0xcb, 0xcc, 0xcd,
590 0xda, 0xdb, 0xdc, 0xdd };
592 /* Macros to insert and extract the block size in the header. */
594 #define XMALLOC_PUT_SIZE(ptr, size) \
595 (ptr[-1] = (size & 0xff), \
596 ptr[-2] = ((size >> 8) & 0xff), \
597 ptr[-3] = ((size >> 16) & 0xff), \
598 ptr[-4] = ((size >> 24) & 0xff))
600 #define XMALLOC_GET_SIZE(ptr) \
601 (size_t)((unsigned)(ptr[-1]) | \
602 ((unsigned)(ptr[-2]) << 8) | \
603 ((unsigned)(ptr[-3]) << 16) | \
604 ((unsigned)(ptr[-4]) << 24))
607 /* The call depth in overrun_check functions. For example, this might happen:
609 overrun_check_malloc()
610 -> malloc -> (via hook)_-> emacs_blocked_malloc
611 -> overrun_check_malloc
612 call malloc (hooks are NULL, so real malloc is called).
613 malloc returns 10000.
614 add overhead, return 10016.
615 <- (back in overrun_check_malloc)
616 add overhead again, return 10032
617 xmalloc returns 10032.
622 overrun_check_free(10032)
624 free(10016) <- crash, because 10000 is the original pointer. */
626 static int check_depth
;
628 /* Like malloc, but wraps allocated block with header and trailer. */
631 overrun_check_malloc (size
)
634 register unsigned char *val
;
635 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
637 val
= (unsigned char *) malloc (size
+ overhead
);
638 if (val
&& check_depth
== 1)
640 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
641 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
642 XMALLOC_PUT_SIZE(val
, size
);
643 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
646 return (POINTER_TYPE
*)val
;
650 /* Like realloc, but checks old block for overrun, and wraps new block
651 with header and trailer. */
654 overrun_check_realloc (block
, size
)
658 register unsigned char *val
= (unsigned char *)block
;
659 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
663 && bcmp (xmalloc_overrun_check_header
,
664 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
665 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
667 size_t osize
= XMALLOC_GET_SIZE (val
);
668 if (bcmp (xmalloc_overrun_check_trailer
,
670 XMALLOC_OVERRUN_CHECK_SIZE
))
672 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
673 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
674 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
677 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
679 if (val
&& check_depth
== 1)
681 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
682 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
683 XMALLOC_PUT_SIZE(val
, size
);
684 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
687 return (POINTER_TYPE
*)val
;
690 /* Like free, but checks block for overrun. */
693 overrun_check_free (block
)
696 unsigned char *val
= (unsigned char *)block
;
701 && bcmp (xmalloc_overrun_check_header
,
702 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
703 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
705 size_t osize
= XMALLOC_GET_SIZE (val
);
706 if (bcmp (xmalloc_overrun_check_trailer
,
708 XMALLOC_OVERRUN_CHECK_SIZE
))
710 #ifdef XMALLOC_CLEAR_FREE_MEMORY
711 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
712 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
714 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
715 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
716 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
727 #define malloc overrun_check_malloc
728 #define realloc overrun_check_realloc
729 #define free overrun_check_free
733 /* Like malloc but check for no memory and block interrupt input.. */
739 register POINTER_TYPE
*val
;
742 val
= (POINTER_TYPE
*) malloc (size
);
751 /* Like realloc but check for no memory and block interrupt input.. */
754 xrealloc (block
, size
)
758 register POINTER_TYPE
*val
;
761 /* We must call malloc explicitly when BLOCK is 0, since some
762 reallocs don't do this. */
764 val
= (POINTER_TYPE
*) malloc (size
);
766 val
= (POINTER_TYPE
*) realloc (block
, size
);
769 if (!val
&& size
) memory_full ();
774 /* Like free but block interrupt input. */
783 /* We don't call refill_memory_reserve here
784 because that duplicates doing so in emacs_blocked_free
785 and the criterion should go there. */
789 /* Like strdup, but uses xmalloc. */
795 size_t len
= strlen (s
) + 1;
796 char *p
= (char *) xmalloc (len
);
802 /* Unwind for SAFE_ALLOCA */
805 safe_alloca_unwind (arg
)
808 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
818 /* Like malloc but used for allocating Lisp data. NBYTES is the
819 number of bytes to allocate, TYPE describes the intended use of the
820 allcated memory block (for strings, for conses, ...). */
823 static void *lisp_malloc_loser
;
826 static POINTER_TYPE
*
827 lisp_malloc (nbytes
, type
)
835 #ifdef GC_MALLOC_CHECK
836 allocated_mem_type
= type
;
839 val
= (void *) malloc (nbytes
);
842 /* If the memory just allocated cannot be addressed thru a Lisp
843 object's pointer, and it needs to be,
844 that's equivalent to running out of memory. */
845 if (val
&& type
!= MEM_TYPE_NON_LISP
)
848 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
849 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
851 lisp_malloc_loser
= val
;
858 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
859 if (val
&& type
!= MEM_TYPE_NON_LISP
)
860 mem_insert (val
, (char *) val
+ nbytes
, type
);
869 /* Free BLOCK. This must be called to free memory allocated with a
870 call to lisp_malloc. */
878 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
879 mem_delete (mem_find (block
));
884 /* Allocation of aligned blocks of memory to store Lisp data. */
885 /* The entry point is lisp_align_malloc which returns blocks of at most */
886 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
889 /* BLOCK_ALIGN has to be a power of 2. */
890 #define BLOCK_ALIGN (1 << 10)
892 /* Padding to leave at the end of a malloc'd block. This is to give
893 malloc a chance to minimize the amount of memory wasted to alignment.
894 It should be tuned to the particular malloc library used.
895 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
896 posix_memalign on the other hand would ideally prefer a value of 4
897 because otherwise, there's 1020 bytes wasted between each ablocks.
898 In Emacs, testing shows that those 1020 can most of the time be
899 efficiently used by malloc to place other objects, so a value of 0 can
900 still preferable unless you have a lot of aligned blocks and virtually
902 #define BLOCK_PADDING 0
903 #define BLOCK_BYTES \
904 (BLOCK_ALIGN - sizeof (struct ablock *) - BLOCK_PADDING)
906 /* Internal data structures and constants. */
908 #define ABLOCKS_SIZE 16
910 /* An aligned block of memory. */
915 char payload
[BLOCK_BYTES
];
916 struct ablock
*next_free
;
918 /* `abase' is the aligned base of the ablocks. */
919 /* It is overloaded to hold the virtual `busy' field that counts
920 the number of used ablock in the parent ablocks.
921 The first ablock has the `busy' field, the others have the `abase'
922 field. To tell the difference, we assume that pointers will have
923 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
924 is used to tell whether the real base of the parent ablocks is `abase'
925 (if not, the word before the first ablock holds a pointer to the
927 struct ablocks
*abase
;
928 /* The padding of all but the last ablock is unused. The padding of
929 the last ablock in an ablocks is not allocated. */
931 char padding
[BLOCK_PADDING
];
935 /* A bunch of consecutive aligned blocks. */
938 struct ablock blocks
[ABLOCKS_SIZE
];
941 /* Size of the block requested from malloc or memalign. */
942 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
944 #define ABLOCK_ABASE(block) \
945 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
946 ? (struct ablocks *)(block) \
949 /* Virtual `busy' field. */
950 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
952 /* Pointer to the (not necessarily aligned) malloc block. */
953 #ifdef HAVE_POSIX_MEMALIGN
954 #define ABLOCKS_BASE(abase) (abase)
956 #define ABLOCKS_BASE(abase) \
957 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
960 /* The list of free ablock. */
961 static struct ablock
*free_ablock
;
963 /* Allocate an aligned block of nbytes.
964 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
965 smaller or equal to BLOCK_BYTES. */
966 static POINTER_TYPE
*
967 lisp_align_malloc (nbytes
, type
)
972 struct ablocks
*abase
;
974 eassert (nbytes
<= BLOCK_BYTES
);
978 #ifdef GC_MALLOC_CHECK
979 allocated_mem_type
= type
;
985 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
987 #ifdef DOUG_LEA_MALLOC
988 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
989 because mapped region contents are not preserved in
991 mallopt (M_MMAP_MAX
, 0);
994 #ifdef HAVE_POSIX_MEMALIGN
996 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1002 base
= malloc (ABLOCKS_BYTES
);
1003 abase
= ALIGN (base
, BLOCK_ALIGN
);
1012 aligned
= (base
== abase
);
1014 ((void**)abase
)[-1] = base
;
1016 #ifdef DOUG_LEA_MALLOC
1017 /* Back to a reasonable maximum of mmap'ed areas. */
1018 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1022 /* If the memory just allocated cannot be addressed thru a Lisp
1023 object's pointer, and it needs to be, that's equivalent to
1024 running out of memory. */
1025 if (type
!= MEM_TYPE_NON_LISP
)
1028 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1029 XSETCONS (tem
, end
);
1030 if ((char *) XCONS (tem
) != end
)
1032 lisp_malloc_loser
= base
;
1040 /* Initialize the blocks and put them on the free list.
1041 Is `base' was not properly aligned, we can't use the last block. */
1042 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1044 abase
->blocks
[i
].abase
= abase
;
1045 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1046 free_ablock
= &abase
->blocks
[i
];
1048 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
1050 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
1051 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1052 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1053 eassert (ABLOCKS_BASE (abase
) == base
);
1054 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
1057 abase
= ABLOCK_ABASE (free_ablock
);
1058 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
1060 free_ablock
= free_ablock
->x
.next_free
;
1062 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1063 if (val
&& type
!= MEM_TYPE_NON_LISP
)
1064 mem_insert (val
, (char *) val
+ nbytes
, type
);
1071 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
1076 lisp_align_free (block
)
1077 POINTER_TYPE
*block
;
1079 struct ablock
*ablock
= block
;
1080 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1083 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1084 mem_delete (mem_find (block
));
1086 /* Put on free list. */
1087 ablock
->x
.next_free
= free_ablock
;
1088 free_ablock
= ablock
;
1089 /* Update busy count. */
1090 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
1092 if (2 > (long) ABLOCKS_BUSY (abase
))
1093 { /* All the blocks are free. */
1094 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
1095 struct ablock
**tem
= &free_ablock
;
1096 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1100 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1103 *tem
= (*tem
)->x
.next_free
;
1106 tem
= &(*tem
)->x
.next_free
;
1108 eassert ((aligned
& 1) == aligned
);
1109 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1110 free (ABLOCKS_BASE (abase
));
1115 /* Return a new buffer structure allocated from the heap with
1116 a call to lisp_malloc. */
1122 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1128 #ifndef SYSTEM_MALLOC
1130 /* Arranging to disable input signals while we're in malloc.
1132 This only works with GNU malloc. To help out systems which can't
1133 use GNU malloc, all the calls to malloc, realloc, and free
1134 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1135 pair; unfortunately, we have no idea what C library functions
1136 might call malloc, so we can't really protect them unless you're
1137 using GNU malloc. Fortunately, most of the major operating systems
1138 can use GNU malloc. */
1142 #ifndef DOUG_LEA_MALLOC
1143 extern void * (*__malloc_hook
) P_ ((size_t, const void *));
1144 extern void * (*__realloc_hook
) P_ ((void *, size_t, const void *));
1145 extern void (*__free_hook
) P_ ((void *, const void *));
1146 /* Else declared in malloc.h, perhaps with an extra arg. */
1147 #endif /* DOUG_LEA_MALLOC */
1148 static void * (*old_malloc_hook
) P_ ((size_t, const void *));
1149 static void * (*old_realloc_hook
) P_ ((void *, size_t, const void*));
1150 static void (*old_free_hook
) P_ ((void*, const void*));
1152 /* This function is used as the hook for free to call. */
1155 emacs_blocked_free (ptr
, ptr2
)
1159 EMACS_INT bytes_used_now
;
1163 #ifdef GC_MALLOC_CHECK
1169 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1172 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1177 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1181 #endif /* GC_MALLOC_CHECK */
1183 __free_hook
= old_free_hook
;
1186 /* If we released our reserve (due to running out of memory),
1187 and we have a fair amount free once again,
1188 try to set aside another reserve in case we run out once more. */
1189 if (! NILP (Vmemory_full
)
1190 /* Verify there is enough space that even with the malloc
1191 hysteresis this call won't run out again.
1192 The code here is correct as long as SPARE_MEMORY
1193 is substantially larger than the block size malloc uses. */
1194 && (bytes_used_when_full
1195 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1196 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1197 refill_memory_reserve ();
1199 __free_hook
= emacs_blocked_free
;
1200 UNBLOCK_INPUT_ALLOC
;
1204 /* This function is the malloc hook that Emacs uses. */
1207 emacs_blocked_malloc (size
, ptr
)
1214 __malloc_hook
= old_malloc_hook
;
1215 #ifdef DOUG_LEA_MALLOC
1216 mallopt (M_TOP_PAD
, malloc_hysteresis
* 4096);
1218 __malloc_extra_blocks
= malloc_hysteresis
;
1221 value
= (void *) malloc (size
);
1223 #ifdef GC_MALLOC_CHECK
1225 struct mem_node
*m
= mem_find (value
);
1228 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1230 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1231 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1236 if (!dont_register_blocks
)
1238 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1239 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1242 #endif /* GC_MALLOC_CHECK */
1244 __malloc_hook
= emacs_blocked_malloc
;
1245 UNBLOCK_INPUT_ALLOC
;
1247 /* fprintf (stderr, "%p malloc\n", value); */
1252 /* This function is the realloc hook that Emacs uses. */
1255 emacs_blocked_realloc (ptr
, size
, ptr2
)
1263 __realloc_hook
= old_realloc_hook
;
1265 #ifdef GC_MALLOC_CHECK
1268 struct mem_node
*m
= mem_find (ptr
);
1269 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1272 "Realloc of %p which wasn't allocated with malloc\n",
1280 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1282 /* Prevent malloc from registering blocks. */
1283 dont_register_blocks
= 1;
1284 #endif /* GC_MALLOC_CHECK */
1286 value
= (void *) realloc (ptr
, size
);
1288 #ifdef GC_MALLOC_CHECK
1289 dont_register_blocks
= 0;
1292 struct mem_node
*m
= mem_find (value
);
1295 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1299 /* Can't handle zero size regions in the red-black tree. */
1300 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1303 /* fprintf (stderr, "%p <- realloc\n", value); */
1304 #endif /* GC_MALLOC_CHECK */
1306 __realloc_hook
= emacs_blocked_realloc
;
1307 UNBLOCK_INPUT_ALLOC
;
1313 #ifdef HAVE_GTK_AND_PTHREAD
1314 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1315 normal malloc. Some thread implementations need this as they call
1316 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1317 calls malloc because it is the first call, and we have an endless loop. */
1320 reset_malloc_hooks ()
1326 #endif /* HAVE_GTK_AND_PTHREAD */
1329 /* Called from main to set up malloc to use our hooks. */
1332 uninterrupt_malloc ()
1334 #ifdef HAVE_GTK_AND_PTHREAD
1335 pthread_mutexattr_t attr
;
1337 /* GLIBC has a faster way to do this, but lets keep it portable.
1338 This is according to the Single UNIX Specification. */
1339 pthread_mutexattr_init (&attr
);
1340 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1341 pthread_mutex_init (&alloc_mutex
, &attr
);
1342 #endif /* HAVE_GTK_AND_PTHREAD */
1344 if (__free_hook
!= emacs_blocked_free
)
1345 old_free_hook
= __free_hook
;
1346 __free_hook
= emacs_blocked_free
;
1348 if (__malloc_hook
!= emacs_blocked_malloc
)
1349 old_malloc_hook
= __malloc_hook
;
1350 __malloc_hook
= emacs_blocked_malloc
;
1352 if (__realloc_hook
!= emacs_blocked_realloc
)
1353 old_realloc_hook
= __realloc_hook
;
1354 __realloc_hook
= emacs_blocked_realloc
;
1357 #endif /* not SYNC_INPUT */
1358 #endif /* not SYSTEM_MALLOC */
1362 /***********************************************************************
1364 ***********************************************************************/
1366 /* Number of intervals allocated in an interval_block structure.
1367 The 1020 is 1024 minus malloc overhead. */
1369 #define INTERVAL_BLOCK_SIZE \
1370 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1372 /* Intervals are allocated in chunks in form of an interval_block
1375 struct interval_block
1377 /* Place `intervals' first, to preserve alignment. */
1378 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1379 struct interval_block
*next
;
1382 /* Current interval block. Its `next' pointer points to older
1385 struct interval_block
*interval_block
;
1387 /* Index in interval_block above of the next unused interval
1390 static int interval_block_index
;
1392 /* Number of free and live intervals. */
1394 static int total_free_intervals
, total_intervals
;
1396 /* List of free intervals. */
1398 INTERVAL interval_free_list
;
1400 /* Total number of interval blocks now in use. */
1402 int n_interval_blocks
;
1405 /* Initialize interval allocation. */
1410 interval_block
= NULL
;
1411 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1412 interval_free_list
= 0;
1413 n_interval_blocks
= 0;
1417 /* Return a new interval. */
1424 if (interval_free_list
)
1426 val
= interval_free_list
;
1427 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1431 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1433 register struct interval_block
*newi
;
1435 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1438 newi
->next
= interval_block
;
1439 interval_block
= newi
;
1440 interval_block_index
= 0;
1441 n_interval_blocks
++;
1443 val
= &interval_block
->intervals
[interval_block_index
++];
1445 consing_since_gc
+= sizeof (struct interval
);
1447 RESET_INTERVAL (val
);
1453 /* Mark Lisp objects in interval I. */
1456 mark_interval (i
, dummy
)
1457 register INTERVAL i
;
1460 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1462 mark_object (i
->plist
);
1466 /* Mark the interval tree rooted in TREE. Don't call this directly;
1467 use the macro MARK_INTERVAL_TREE instead. */
1470 mark_interval_tree (tree
)
1471 register INTERVAL tree
;
1473 /* No need to test if this tree has been marked already; this
1474 function is always called through the MARK_INTERVAL_TREE macro,
1475 which takes care of that. */
1477 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1481 /* Mark the interval tree rooted in I. */
1483 #define MARK_INTERVAL_TREE(i) \
1485 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1486 mark_interval_tree (i); \
1490 #define UNMARK_BALANCE_INTERVALS(i) \
1492 if (! NULL_INTERVAL_P (i)) \
1493 (i) = balance_intervals (i); \
1497 /* Number support. If NO_UNION_TYPE isn't in effect, we
1498 can't create number objects in macros. */
1506 obj
.s
.type
= Lisp_Int
;
1511 /***********************************************************************
1513 ***********************************************************************/
1515 /* Lisp_Strings are allocated in string_block structures. When a new
1516 string_block is allocated, all the Lisp_Strings it contains are
1517 added to a free-list string_free_list. When a new Lisp_String is
1518 needed, it is taken from that list. During the sweep phase of GC,
1519 string_blocks that are entirely free are freed, except two which
1522 String data is allocated from sblock structures. Strings larger
1523 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1524 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1526 Sblocks consist internally of sdata structures, one for each
1527 Lisp_String. The sdata structure points to the Lisp_String it
1528 belongs to. The Lisp_String points back to the `u.data' member of
1529 its sdata structure.
1531 When a Lisp_String is freed during GC, it is put back on
1532 string_free_list, and its `data' member and its sdata's `string'
1533 pointer is set to null. The size of the string is recorded in the
1534 `u.nbytes' member of the sdata. So, sdata structures that are no
1535 longer used, can be easily recognized, and it's easy to compact the
1536 sblocks of small strings which we do in compact_small_strings. */
1538 /* Size in bytes of an sblock structure used for small strings. This
1539 is 8192 minus malloc overhead. */
1541 #define SBLOCK_SIZE 8188
1543 /* Strings larger than this are considered large strings. String data
1544 for large strings is allocated from individual sblocks. */
1546 #define LARGE_STRING_BYTES 1024
1548 /* Structure describing string memory sub-allocated from an sblock.
1549 This is where the contents of Lisp strings are stored. */
1553 /* Back-pointer to the string this sdata belongs to. If null, this
1554 structure is free, and the NBYTES member of the union below
1555 contains the string's byte size (the same value that STRING_BYTES
1556 would return if STRING were non-null). If non-null, STRING_BYTES
1557 (STRING) is the size of the data, and DATA contains the string's
1559 struct Lisp_String
*string
;
1561 #ifdef GC_CHECK_STRING_BYTES
1564 unsigned char data
[1];
1566 #define SDATA_NBYTES(S) (S)->nbytes
1567 #define SDATA_DATA(S) (S)->data
1569 #else /* not GC_CHECK_STRING_BYTES */
1573 /* When STRING in non-null. */
1574 unsigned char data
[1];
1576 /* When STRING is null. */
1581 #define SDATA_NBYTES(S) (S)->u.nbytes
1582 #define SDATA_DATA(S) (S)->u.data
1584 #endif /* not GC_CHECK_STRING_BYTES */
1588 /* Structure describing a block of memory which is sub-allocated to
1589 obtain string data memory for strings. Blocks for small strings
1590 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1591 as large as needed. */
1596 struct sblock
*next
;
1598 /* Pointer to the next free sdata block. This points past the end
1599 of the sblock if there isn't any space left in this block. */
1600 struct sdata
*next_free
;
1602 /* Start of data. */
1603 struct sdata first_data
;
1606 /* Number of Lisp strings in a string_block structure. The 1020 is
1607 1024 minus malloc overhead. */
1609 #define STRING_BLOCK_SIZE \
1610 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1612 /* Structure describing a block from which Lisp_String structures
1617 /* Place `strings' first, to preserve alignment. */
1618 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1619 struct string_block
*next
;
1622 /* Head and tail of the list of sblock structures holding Lisp string
1623 data. We always allocate from current_sblock. The NEXT pointers
1624 in the sblock structures go from oldest_sblock to current_sblock. */
1626 static struct sblock
*oldest_sblock
, *current_sblock
;
1628 /* List of sblocks for large strings. */
1630 static struct sblock
*large_sblocks
;
1632 /* List of string_block structures, and how many there are. */
1634 static struct string_block
*string_blocks
;
1635 static int n_string_blocks
;
1637 /* Free-list of Lisp_Strings. */
1639 static struct Lisp_String
*string_free_list
;
1641 /* Number of live and free Lisp_Strings. */
1643 static int total_strings
, total_free_strings
;
1645 /* Number of bytes used by live strings. */
1647 static int total_string_size
;
1649 /* Given a pointer to a Lisp_String S which is on the free-list
1650 string_free_list, return a pointer to its successor in the
1653 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1655 /* Return a pointer to the sdata structure belonging to Lisp string S.
1656 S must be live, i.e. S->data must not be null. S->data is actually
1657 a pointer to the `u.data' member of its sdata structure; the
1658 structure starts at a constant offset in front of that. */
1660 #ifdef GC_CHECK_STRING_BYTES
1662 #define SDATA_OF_STRING(S) \
1663 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1664 - sizeof (EMACS_INT)))
1666 #else /* not GC_CHECK_STRING_BYTES */
1668 #define SDATA_OF_STRING(S) \
1669 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1671 #endif /* not GC_CHECK_STRING_BYTES */
1674 #ifdef GC_CHECK_STRING_OVERRUN
1676 /* We check for overrun in string data blocks by appending a small
1677 "cookie" after each allocated string data block, and check for the
1678 presence of this cookie during GC. */
1680 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1681 static char string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1682 { 0xde, 0xad, 0xbe, 0xef };
1685 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1688 /* Value is the size of an sdata structure large enough to hold NBYTES
1689 bytes of string data. The value returned includes a terminating
1690 NUL byte, the size of the sdata structure, and padding. */
1692 #ifdef GC_CHECK_STRING_BYTES
1694 #define SDATA_SIZE(NBYTES) \
1695 ((sizeof (struct Lisp_String *) \
1697 + sizeof (EMACS_INT) \
1698 + sizeof (EMACS_INT) - 1) \
1699 & ~(sizeof (EMACS_INT) - 1))
1701 #else /* not GC_CHECK_STRING_BYTES */
1703 #define SDATA_SIZE(NBYTES) \
1704 ((sizeof (struct Lisp_String *) \
1706 + sizeof (EMACS_INT) - 1) \
1707 & ~(sizeof (EMACS_INT) - 1))
1709 #endif /* not GC_CHECK_STRING_BYTES */
1711 /* Extra bytes to allocate for each string. */
1713 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1715 /* Initialize string allocation. Called from init_alloc_once. */
1720 total_strings
= total_free_strings
= total_string_size
= 0;
1721 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1722 string_blocks
= NULL
;
1723 n_string_blocks
= 0;
1724 string_free_list
= NULL
;
1728 #ifdef GC_CHECK_STRING_BYTES
1730 static int check_string_bytes_count
;
1732 void check_string_bytes
P_ ((int));
1733 void check_sblock
P_ ((struct sblock
*));
1735 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1738 /* Like GC_STRING_BYTES, but with debugging check. */
1742 struct Lisp_String
*s
;
1744 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1745 if (!PURE_POINTER_P (s
)
1747 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1752 /* Check validity of Lisp strings' string_bytes member in B. */
1758 struct sdata
*from
, *end
, *from_end
;
1762 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1764 /* Compute the next FROM here because copying below may
1765 overwrite data we need to compute it. */
1768 /* Check that the string size recorded in the string is the
1769 same as the one recorded in the sdata structure. */
1771 CHECK_STRING_BYTES (from
->string
);
1774 nbytes
= GC_STRING_BYTES (from
->string
);
1776 nbytes
= SDATA_NBYTES (from
);
1778 nbytes
= SDATA_SIZE (nbytes
);
1779 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1784 /* Check validity of Lisp strings' string_bytes member. ALL_P
1785 non-zero means check all strings, otherwise check only most
1786 recently allocated strings. Used for hunting a bug. */
1789 check_string_bytes (all_p
)
1796 for (b
= large_sblocks
; b
; b
= b
->next
)
1798 struct Lisp_String
*s
= b
->first_data
.string
;
1800 CHECK_STRING_BYTES (s
);
1803 for (b
= oldest_sblock
; b
; b
= b
->next
)
1807 check_sblock (current_sblock
);
1810 #endif /* GC_CHECK_STRING_BYTES */
1812 #ifdef GC_CHECK_STRING_FREE_LIST
1814 /* Walk through the string free list looking for bogus next pointers.
1815 This may catch buffer overrun from a previous string. */
1818 check_string_free_list ()
1820 struct Lisp_String
*s
;
1822 /* Pop a Lisp_String off the free-list. */
1823 s
= string_free_list
;
1826 if ((unsigned)s
< 1024)
1828 s
= NEXT_FREE_LISP_STRING (s
);
1832 #define check_string_free_list()
1835 /* Return a new Lisp_String. */
1837 static struct Lisp_String
*
1840 struct Lisp_String
*s
;
1842 /* If the free-list is empty, allocate a new string_block, and
1843 add all the Lisp_Strings in it to the free-list. */
1844 if (string_free_list
== NULL
)
1846 struct string_block
*b
;
1849 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1850 bzero (b
, sizeof *b
);
1851 b
->next
= string_blocks
;
1855 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1858 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1859 string_free_list
= s
;
1862 total_free_strings
+= STRING_BLOCK_SIZE
;
1865 check_string_free_list ();
1867 /* Pop a Lisp_String off the free-list. */
1868 s
= string_free_list
;
1869 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1871 /* Probably not strictly necessary, but play it safe. */
1872 bzero (s
, sizeof *s
);
1874 --total_free_strings
;
1877 consing_since_gc
+= sizeof *s
;
1879 #ifdef GC_CHECK_STRING_BYTES
1886 if (++check_string_bytes_count
== 200)
1888 check_string_bytes_count
= 0;
1889 check_string_bytes (1);
1892 check_string_bytes (0);
1894 #endif /* GC_CHECK_STRING_BYTES */
1900 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1901 plus a NUL byte at the end. Allocate an sdata structure for S, and
1902 set S->data to its `u.data' member. Store a NUL byte at the end of
1903 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1904 S->data if it was initially non-null. */
1907 allocate_string_data (s
, nchars
, nbytes
)
1908 struct Lisp_String
*s
;
1911 struct sdata
*data
, *old_data
;
1913 int needed
, old_nbytes
;
1915 /* Determine the number of bytes needed to store NBYTES bytes
1917 needed
= SDATA_SIZE (nbytes
);
1919 if (nbytes
> LARGE_STRING_BYTES
)
1921 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1923 #ifdef DOUG_LEA_MALLOC
1924 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1925 because mapped region contents are not preserved in
1928 In case you think of allowing it in a dumped Emacs at the
1929 cost of not being able to re-dump, there's another reason:
1930 mmap'ed data typically have an address towards the top of the
1931 address space, which won't fit into an EMACS_INT (at least on
1932 32-bit systems with the current tagging scheme). --fx */
1934 mallopt (M_MMAP_MAX
, 0);
1938 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1940 #ifdef DOUG_LEA_MALLOC
1941 /* Back to a reasonable maximum of mmap'ed areas. */
1943 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1947 b
->next_free
= &b
->first_data
;
1948 b
->first_data
.string
= NULL
;
1949 b
->next
= large_sblocks
;
1952 else if (current_sblock
== NULL
1953 || (((char *) current_sblock
+ SBLOCK_SIZE
1954 - (char *) current_sblock
->next_free
)
1955 < (needed
+ GC_STRING_EXTRA
)))
1957 /* Not enough room in the current sblock. */
1958 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1959 b
->next_free
= &b
->first_data
;
1960 b
->first_data
.string
= NULL
;
1964 current_sblock
->next
= b
;
1972 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1973 old_nbytes
= GC_STRING_BYTES (s
);
1975 data
= b
->next_free
;
1977 s
->data
= SDATA_DATA (data
);
1978 #ifdef GC_CHECK_STRING_BYTES
1979 SDATA_NBYTES (data
) = nbytes
;
1982 s
->size_byte
= nbytes
;
1983 s
->data
[nbytes
] = '\0';
1984 #ifdef GC_CHECK_STRING_OVERRUN
1985 bcopy (string_overrun_cookie
, (char *) data
+ needed
,
1986 GC_STRING_OVERRUN_COOKIE_SIZE
);
1988 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
1990 /* If S had already data assigned, mark that as free by setting its
1991 string back-pointer to null, and recording the size of the data
1995 SDATA_NBYTES (old_data
) = old_nbytes
;
1996 old_data
->string
= NULL
;
1999 consing_since_gc
+= needed
;
2003 /* Sweep and compact strings. */
2008 struct string_block
*b
, *next
;
2009 struct string_block
*live_blocks
= NULL
;
2011 string_free_list
= NULL
;
2012 total_strings
= total_free_strings
= 0;
2013 total_string_size
= 0;
2015 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2016 for (b
= string_blocks
; b
; b
= next
)
2019 struct Lisp_String
*free_list_before
= string_free_list
;
2023 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2025 struct Lisp_String
*s
= b
->strings
+ i
;
2029 /* String was not on free-list before. */
2030 if (STRING_MARKED_P (s
))
2032 /* String is live; unmark it and its intervals. */
2035 if (!NULL_INTERVAL_P (s
->intervals
))
2036 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2039 total_string_size
+= STRING_BYTES (s
);
2043 /* String is dead. Put it on the free-list. */
2044 struct sdata
*data
= SDATA_OF_STRING (s
);
2046 /* Save the size of S in its sdata so that we know
2047 how large that is. Reset the sdata's string
2048 back-pointer so that we know it's free. */
2049 #ifdef GC_CHECK_STRING_BYTES
2050 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2053 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2055 data
->string
= NULL
;
2057 /* Reset the strings's `data' member so that we
2061 /* Put the string on the free-list. */
2062 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2063 string_free_list
= s
;
2069 /* S was on the free-list before. Put it there again. */
2070 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2071 string_free_list
= s
;
2076 /* Free blocks that contain free Lisp_Strings only, except
2077 the first two of them. */
2078 if (nfree
== STRING_BLOCK_SIZE
2079 && total_free_strings
> STRING_BLOCK_SIZE
)
2083 string_free_list
= free_list_before
;
2087 total_free_strings
+= nfree
;
2088 b
->next
= live_blocks
;
2093 check_string_free_list ();
2095 string_blocks
= live_blocks
;
2096 free_large_strings ();
2097 compact_small_strings ();
2099 check_string_free_list ();
2103 /* Free dead large strings. */
2106 free_large_strings ()
2108 struct sblock
*b
, *next
;
2109 struct sblock
*live_blocks
= NULL
;
2111 for (b
= large_sblocks
; b
; b
= next
)
2115 if (b
->first_data
.string
== NULL
)
2119 b
->next
= live_blocks
;
2124 large_sblocks
= live_blocks
;
2128 /* Compact data of small strings. Free sblocks that don't contain
2129 data of live strings after compaction. */
2132 compact_small_strings ()
2134 struct sblock
*b
, *tb
, *next
;
2135 struct sdata
*from
, *to
, *end
, *tb_end
;
2136 struct sdata
*to_end
, *from_end
;
2138 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2139 to, and TB_END is the end of TB. */
2141 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2142 to
= &tb
->first_data
;
2144 /* Step through the blocks from the oldest to the youngest. We
2145 expect that old blocks will stabilize over time, so that less
2146 copying will happen this way. */
2147 for (b
= oldest_sblock
; b
; b
= b
->next
)
2150 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2152 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2154 /* Compute the next FROM here because copying below may
2155 overwrite data we need to compute it. */
2158 #ifdef GC_CHECK_STRING_BYTES
2159 /* Check that the string size recorded in the string is the
2160 same as the one recorded in the sdata structure. */
2162 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2164 #endif /* GC_CHECK_STRING_BYTES */
2167 nbytes
= GC_STRING_BYTES (from
->string
);
2169 nbytes
= SDATA_NBYTES (from
);
2171 if (nbytes
> LARGE_STRING_BYTES
)
2174 nbytes
= SDATA_SIZE (nbytes
);
2175 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2177 #ifdef GC_CHECK_STRING_OVERRUN
2178 if (bcmp (string_overrun_cookie
,
2179 ((char *) from_end
) - GC_STRING_OVERRUN_COOKIE_SIZE
,
2180 GC_STRING_OVERRUN_COOKIE_SIZE
))
2184 /* FROM->string non-null means it's alive. Copy its data. */
2187 /* If TB is full, proceed with the next sblock. */
2188 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2189 if (to_end
> tb_end
)
2193 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2194 to
= &tb
->first_data
;
2195 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2198 /* Copy, and update the string's `data' pointer. */
2201 xassert (tb
!= b
|| to
<= from
);
2202 safe_bcopy ((char *) from
, (char *) to
, nbytes
+ GC_STRING_EXTRA
);
2203 to
->string
->data
= SDATA_DATA (to
);
2206 /* Advance past the sdata we copied to. */
2212 /* The rest of the sblocks following TB don't contain live data, so
2213 we can free them. */
2214 for (b
= tb
->next
; b
; b
= next
)
2222 current_sblock
= tb
;
2226 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2227 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2228 LENGTH must be an integer.
2229 INIT must be an integer that represents a character. */)
2231 Lisp_Object length
, init
;
2233 register Lisp_Object val
;
2234 register unsigned char *p
, *end
;
2237 CHECK_NATNUM (length
);
2238 CHECK_NUMBER (init
);
2241 if (SINGLE_BYTE_CHAR_P (c
))
2243 nbytes
= XINT (length
);
2244 val
= make_uninit_string (nbytes
);
2246 end
= p
+ SCHARS (val
);
2252 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2253 int len
= CHAR_STRING (c
, str
);
2255 nbytes
= len
* XINT (length
);
2256 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
2261 bcopy (str
, p
, len
);
2271 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2272 doc
: /* Return a new bool-vector of length LENGTH, using INIT for as each element.
2273 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2275 Lisp_Object length
, init
;
2277 register Lisp_Object val
;
2278 struct Lisp_Bool_Vector
*p
;
2280 int length_in_chars
, length_in_elts
, bits_per_value
;
2282 CHECK_NATNUM (length
);
2284 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2286 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2287 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2288 / BOOL_VECTOR_BITS_PER_CHAR
);
2290 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2291 slot `size' of the struct Lisp_Bool_Vector. */
2292 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2293 p
= XBOOL_VECTOR (val
);
2295 /* Get rid of any bits that would cause confusion. */
2297 XSETBOOL_VECTOR (val
, p
);
2298 p
->size
= XFASTINT (length
);
2300 real_init
= (NILP (init
) ? 0 : -1);
2301 for (i
= 0; i
< length_in_chars
; i
++)
2302 p
->data
[i
] = real_init
;
2304 /* Clear the extraneous bits in the last byte. */
2305 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2306 XBOOL_VECTOR (val
)->data
[length_in_chars
- 1]
2307 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2313 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2314 of characters from the contents. This string may be unibyte or
2315 multibyte, depending on the contents. */
2318 make_string (contents
, nbytes
)
2319 const char *contents
;
2322 register Lisp_Object val
;
2323 int nchars
, multibyte_nbytes
;
2325 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
2326 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2327 /* CONTENTS contains no multibyte sequences or contains an invalid
2328 multibyte sequence. We must make unibyte string. */
2329 val
= make_unibyte_string (contents
, nbytes
);
2331 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2336 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2339 make_unibyte_string (contents
, length
)
2340 const char *contents
;
2343 register Lisp_Object val
;
2344 val
= make_uninit_string (length
);
2345 bcopy (contents
, SDATA (val
), length
);
2346 STRING_SET_UNIBYTE (val
);
2351 /* Make a multibyte string from NCHARS characters occupying NBYTES
2352 bytes at CONTENTS. */
2355 make_multibyte_string (contents
, nchars
, nbytes
)
2356 const char *contents
;
2359 register Lisp_Object val
;
2360 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2361 bcopy (contents
, SDATA (val
), nbytes
);
2366 /* Make a string from NCHARS characters occupying NBYTES bytes at
2367 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2370 make_string_from_bytes (contents
, nchars
, nbytes
)
2371 const char *contents
;
2374 register Lisp_Object val
;
2375 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2376 bcopy (contents
, SDATA (val
), nbytes
);
2377 if (SBYTES (val
) == SCHARS (val
))
2378 STRING_SET_UNIBYTE (val
);
2383 /* Make a string from NCHARS characters occupying NBYTES bytes at
2384 CONTENTS. The argument MULTIBYTE controls whether to label the
2385 string as multibyte. If NCHARS is negative, it counts the number of
2386 characters by itself. */
2389 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2390 const char *contents
;
2394 register Lisp_Object val
;
2399 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2403 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2404 bcopy (contents
, SDATA (val
), nbytes
);
2406 STRING_SET_UNIBYTE (val
);
2411 /* Make a string from the data at STR, treating it as multibyte if the
2418 return make_string (str
, strlen (str
));
2422 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2423 occupying LENGTH bytes. */
2426 make_uninit_string (length
)
2430 val
= make_uninit_multibyte_string (length
, length
);
2431 STRING_SET_UNIBYTE (val
);
2436 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2437 which occupy NBYTES bytes. */
2440 make_uninit_multibyte_string (nchars
, nbytes
)
2444 struct Lisp_String
*s
;
2449 s
= allocate_string ();
2450 allocate_string_data (s
, nchars
, nbytes
);
2451 XSETSTRING (string
, s
);
2452 string_chars_consed
+= nbytes
;
2458 /***********************************************************************
2460 ***********************************************************************/
2462 /* We store float cells inside of float_blocks, allocating a new
2463 float_block with malloc whenever necessary. Float cells reclaimed
2464 by GC are put on a free list to be reallocated before allocating
2465 any new float cells from the latest float_block. */
2467 #define FLOAT_BLOCK_SIZE \
2468 (((BLOCK_BYTES - sizeof (struct float_block *) \
2469 /* The compiler might add padding at the end. */ \
2470 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2471 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2473 #define GETMARKBIT(block,n) \
2474 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2475 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2478 #define SETMARKBIT(block,n) \
2479 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2480 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2482 #define UNSETMARKBIT(block,n) \
2483 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2484 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2486 #define FLOAT_BLOCK(fptr) \
2487 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2489 #define FLOAT_INDEX(fptr) \
2490 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2494 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2495 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2496 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2497 struct float_block
*next
;
2500 #define FLOAT_MARKED_P(fptr) \
2501 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2503 #define FLOAT_MARK(fptr) \
2504 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2506 #define FLOAT_UNMARK(fptr) \
2507 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2509 /* Current float_block. */
2511 struct float_block
*float_block
;
2513 /* Index of first unused Lisp_Float in the current float_block. */
2515 int float_block_index
;
2517 /* Total number of float blocks now in use. */
2521 /* Free-list of Lisp_Floats. */
2523 struct Lisp_Float
*float_free_list
;
2526 /* Initialize float allocation. */
2532 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2533 float_free_list
= 0;
2538 /* Explicitly free a float cell by putting it on the free-list. */
2542 struct Lisp_Float
*ptr
;
2544 ptr
->u
.chain
= float_free_list
;
2545 float_free_list
= ptr
;
2549 /* Return a new float object with value FLOAT_VALUE. */
2552 make_float (float_value
)
2555 register Lisp_Object val
;
2557 if (float_free_list
)
2559 /* We use the data field for chaining the free list
2560 so that we won't use the same field that has the mark bit. */
2561 XSETFLOAT (val
, float_free_list
);
2562 float_free_list
= float_free_list
->u
.chain
;
2566 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2568 register struct float_block
*new;
2570 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2572 new->next
= float_block
;
2573 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2575 float_block_index
= 0;
2578 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2579 float_block_index
++;
2582 XFLOAT_DATA (val
) = float_value
;
2583 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2584 consing_since_gc
+= sizeof (struct Lisp_Float
);
2591 /***********************************************************************
2593 ***********************************************************************/
2595 /* We store cons cells inside of cons_blocks, allocating a new
2596 cons_block with malloc whenever necessary. Cons cells reclaimed by
2597 GC are put on a free list to be reallocated before allocating
2598 any new cons cells from the latest cons_block. */
2600 #define CONS_BLOCK_SIZE \
2601 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2602 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2604 #define CONS_BLOCK(fptr) \
2605 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2607 #define CONS_INDEX(fptr) \
2608 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2612 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2613 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2614 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2615 struct cons_block
*next
;
2618 #define CONS_MARKED_P(fptr) \
2619 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2621 #define CONS_MARK(fptr) \
2622 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2624 #define CONS_UNMARK(fptr) \
2625 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2627 /* Current cons_block. */
2629 struct cons_block
*cons_block
;
2631 /* Index of first unused Lisp_Cons in the current block. */
2633 int cons_block_index
;
2635 /* Free-list of Lisp_Cons structures. */
2637 struct Lisp_Cons
*cons_free_list
;
2639 /* Total number of cons blocks now in use. */
2644 /* Initialize cons allocation. */
2650 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2656 /* Explicitly free a cons cell by putting it on the free-list. */
2660 struct Lisp_Cons
*ptr
;
2662 ptr
->u
.chain
= cons_free_list
;
2666 cons_free_list
= ptr
;
2669 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2670 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2672 Lisp_Object car
, cdr
;
2674 register Lisp_Object val
;
2678 /* We use the cdr for chaining the free list
2679 so that we won't use the same field that has the mark bit. */
2680 XSETCONS (val
, cons_free_list
);
2681 cons_free_list
= cons_free_list
->u
.chain
;
2685 if (cons_block_index
== CONS_BLOCK_SIZE
)
2687 register struct cons_block
*new;
2688 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2690 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2691 new->next
= cons_block
;
2693 cons_block_index
= 0;
2696 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2702 eassert (!CONS_MARKED_P (XCONS (val
)));
2703 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2704 cons_cells_consed
++;
2708 /* Get an error now if there's any junk in the cons free list. */
2712 #ifdef GC_CHECK_CONS_LIST
2713 struct Lisp_Cons
*tail
= cons_free_list
;
2716 tail
= tail
->u
.chain
;
2720 /* Make a list of 2, 3, 4 or 5 specified objects. */
2724 Lisp_Object arg1
, arg2
;
2726 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2731 list3 (arg1
, arg2
, arg3
)
2732 Lisp_Object arg1
, arg2
, arg3
;
2734 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2739 list4 (arg1
, arg2
, arg3
, arg4
)
2740 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2742 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2747 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2748 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2750 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2751 Fcons (arg5
, Qnil
)))));
2755 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2756 doc
: /* Return a newly created list with specified arguments as elements.
2757 Any number of arguments, even zero arguments, are allowed.
2758 usage: (list &rest OBJECTS) */)
2761 register Lisp_Object
*args
;
2763 register Lisp_Object val
;
2769 val
= Fcons (args
[nargs
], val
);
2775 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2776 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2778 register Lisp_Object length
, init
;
2780 register Lisp_Object val
;
2783 CHECK_NATNUM (length
);
2784 size
= XFASTINT (length
);
2789 val
= Fcons (init
, val
);
2794 val
= Fcons (init
, val
);
2799 val
= Fcons (init
, val
);
2804 val
= Fcons (init
, val
);
2809 val
= Fcons (init
, val
);
2824 /***********************************************************************
2826 ***********************************************************************/
2828 /* Singly-linked list of all vectors. */
2830 struct Lisp_Vector
*all_vectors
;
2832 /* Total number of vector-like objects now in use. */
2837 /* Value is a pointer to a newly allocated Lisp_Vector structure
2838 with room for LEN Lisp_Objects. */
2840 static struct Lisp_Vector
*
2841 allocate_vectorlike (len
, type
)
2845 struct Lisp_Vector
*p
;
2848 #ifdef DOUG_LEA_MALLOC
2849 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2850 because mapped region contents are not preserved in
2853 mallopt (M_MMAP_MAX
, 0);
2857 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2858 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, type
);
2860 #ifdef DOUG_LEA_MALLOC
2861 /* Back to a reasonable maximum of mmap'ed areas. */
2863 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2867 consing_since_gc
+= nbytes
;
2868 vector_cells_consed
+= len
;
2870 p
->next
= all_vectors
;
2877 /* Allocate a vector with NSLOTS slots. */
2879 struct Lisp_Vector
*
2880 allocate_vector (nslots
)
2883 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
, MEM_TYPE_VECTOR
);
2889 /* Allocate other vector-like structures. */
2891 struct Lisp_Hash_Table
*
2892 allocate_hash_table ()
2894 EMACS_INT len
= VECSIZE (struct Lisp_Hash_Table
);
2895 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_HASH_TABLE
);
2899 for (i
= 0; i
< len
; ++i
)
2900 v
->contents
[i
] = Qnil
;
2902 return (struct Lisp_Hash_Table
*) v
;
2909 EMACS_INT len
= VECSIZE (struct window
);
2910 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_WINDOW
);
2913 for (i
= 0; i
< len
; ++i
)
2914 v
->contents
[i
] = Qnil
;
2917 return (struct window
*) v
;
2924 EMACS_INT len
= VECSIZE (struct frame
);
2925 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_FRAME
);
2928 for (i
= 0; i
< len
; ++i
)
2929 v
->contents
[i
] = make_number (0);
2931 return (struct frame
*) v
;
2935 struct Lisp_Process
*
2938 EMACS_INT len
= VECSIZE (struct Lisp_Process
);
2939 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_PROCESS
);
2942 for (i
= 0; i
< len
; ++i
)
2943 v
->contents
[i
] = Qnil
;
2946 return (struct Lisp_Process
*) v
;
2950 struct Lisp_Vector
*
2951 allocate_other_vector (len
)
2954 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_VECTOR
);
2957 for (i
= 0; i
< len
; ++i
)
2958 v
->contents
[i
] = Qnil
;
2965 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2966 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2967 See also the function `vector'. */)
2969 register Lisp_Object length
, init
;
2972 register EMACS_INT sizei
;
2974 register struct Lisp_Vector
*p
;
2976 CHECK_NATNUM (length
);
2977 sizei
= XFASTINT (length
);
2979 p
= allocate_vector (sizei
);
2980 for (index
= 0; index
< sizei
; index
++)
2981 p
->contents
[index
] = init
;
2983 XSETVECTOR (vector
, p
);
2988 DEFUN ("make-char-table", Fmake_char_table
, Smake_char_table
, 1, 2, 0,
2989 doc
: /* Return a newly created char-table, with purpose PURPOSE.
2990 Each element is initialized to INIT, which defaults to nil.
2991 PURPOSE should be a symbol which has a `char-table-extra-slots' property.
2992 The property's value should be an integer between 0 and 10. */)
2994 register Lisp_Object purpose
, init
;
2998 CHECK_SYMBOL (purpose
);
2999 n
= Fget (purpose
, Qchar_table_extra_slots
);
3001 if (XINT (n
) < 0 || XINT (n
) > 10)
3002 args_out_of_range (n
, Qnil
);
3003 /* Add 2 to the size for the defalt and parent slots. */
3004 vector
= Fmake_vector (make_number (CHAR_TABLE_STANDARD_SLOTS
+ XINT (n
)),
3006 XCHAR_TABLE (vector
)->top
= Qt
;
3007 XCHAR_TABLE (vector
)->parent
= Qnil
;
3008 XCHAR_TABLE (vector
)->purpose
= purpose
;
3009 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
3014 /* Return a newly created sub char table with slots initialized by INIT.
3015 Since a sub char table does not appear as a top level Emacs Lisp
3016 object, we don't need a Lisp interface to make it. */
3019 make_sub_char_table (init
)
3023 = Fmake_vector (make_number (SUB_CHAR_TABLE_STANDARD_SLOTS
), init
);
3024 XCHAR_TABLE (vector
)->top
= Qnil
;
3025 XCHAR_TABLE (vector
)->defalt
= Qnil
;
3026 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
3031 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3032 doc
: /* Return a newly created vector with specified arguments as elements.
3033 Any number of arguments, even zero arguments, are allowed.
3034 usage: (vector &rest OBJECTS) */)
3039 register Lisp_Object len
, val
;
3041 register struct Lisp_Vector
*p
;
3043 XSETFASTINT (len
, nargs
);
3044 val
= Fmake_vector (len
, Qnil
);
3046 for (index
= 0; index
< nargs
; index
++)
3047 p
->contents
[index
] = args
[index
];
3052 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3053 doc
: /* Create a byte-code object with specified arguments as elements.
3054 The arguments should be the arglist, bytecode-string, constant vector,
3055 stack size, (optional) doc string, and (optional) interactive spec.
3056 The first four arguments are required; at most six have any
3058 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3063 register Lisp_Object len
, val
;
3065 register struct Lisp_Vector
*p
;
3067 XSETFASTINT (len
, nargs
);
3068 if (!NILP (Vpurify_flag
))
3069 val
= make_pure_vector ((EMACS_INT
) nargs
);
3071 val
= Fmake_vector (len
, Qnil
);
3073 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
3074 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3075 earlier because they produced a raw 8-bit string for byte-code
3076 and now such a byte-code string is loaded as multibyte while
3077 raw 8-bit characters converted to multibyte form. Thus, now we
3078 must convert them back to the original unibyte form. */
3079 args
[1] = Fstring_as_unibyte (args
[1]);
3082 for (index
= 0; index
< nargs
; index
++)
3084 if (!NILP (Vpurify_flag
))
3085 args
[index
] = Fpurecopy (args
[index
]);
3086 p
->contents
[index
] = args
[index
];
3088 XSETCOMPILED (val
, p
);
3094 /***********************************************************************
3096 ***********************************************************************/
3098 /* Each symbol_block is just under 1020 bytes long, since malloc
3099 really allocates in units of powers of two and uses 4 bytes for its
3102 #define SYMBOL_BLOCK_SIZE \
3103 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3107 /* Place `symbols' first, to preserve alignment. */
3108 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3109 struct symbol_block
*next
;
3112 /* Current symbol block and index of first unused Lisp_Symbol
3115 struct symbol_block
*symbol_block
;
3116 int symbol_block_index
;
3118 /* List of free symbols. */
3120 struct Lisp_Symbol
*symbol_free_list
;
3122 /* Total number of symbol blocks now in use. */
3124 int n_symbol_blocks
;
3127 /* Initialize symbol allocation. */
3132 symbol_block
= NULL
;
3133 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3134 symbol_free_list
= 0;
3135 n_symbol_blocks
= 0;
3139 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3140 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3141 Its value and function definition are void, and its property list is nil. */)
3145 register Lisp_Object val
;
3146 register struct Lisp_Symbol
*p
;
3148 CHECK_STRING (name
);
3150 if (symbol_free_list
)
3152 XSETSYMBOL (val
, symbol_free_list
);
3153 symbol_free_list
= symbol_free_list
->next
;
3157 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3159 struct symbol_block
*new;
3160 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3162 new->next
= symbol_block
;
3164 symbol_block_index
= 0;
3167 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3168 symbol_block_index
++;
3174 p
->value
= Qunbound
;
3175 p
->function
= Qunbound
;
3178 p
->interned
= SYMBOL_UNINTERNED
;
3180 p
->indirect_variable
= 0;
3181 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3188 /***********************************************************************
3189 Marker (Misc) Allocation
3190 ***********************************************************************/
3192 /* Allocation of markers and other objects that share that structure.
3193 Works like allocation of conses. */
3195 #define MARKER_BLOCK_SIZE \
3196 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3200 /* Place `markers' first, to preserve alignment. */
3201 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3202 struct marker_block
*next
;
3205 struct marker_block
*marker_block
;
3206 int marker_block_index
;
3208 union Lisp_Misc
*marker_free_list
;
3210 /* Total number of marker blocks now in use. */
3212 int n_marker_blocks
;
3217 marker_block
= NULL
;
3218 marker_block_index
= MARKER_BLOCK_SIZE
;
3219 marker_free_list
= 0;
3220 n_marker_blocks
= 0;
3223 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3230 if (marker_free_list
)
3232 XSETMISC (val
, marker_free_list
);
3233 marker_free_list
= marker_free_list
->u_free
.chain
;
3237 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3239 struct marker_block
*new;
3240 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3242 new->next
= marker_block
;
3244 marker_block_index
= 0;
3246 total_free_markers
+= MARKER_BLOCK_SIZE
;
3248 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3249 marker_block_index
++;
3252 --total_free_markers
;
3253 consing_since_gc
+= sizeof (union Lisp_Misc
);
3254 misc_objects_consed
++;
3255 XMARKER (val
)->gcmarkbit
= 0;
3259 /* Free a Lisp_Misc object */
3265 XMISC (misc
)->u_marker
.type
= Lisp_Misc_Free
;
3266 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3267 marker_free_list
= XMISC (misc
);
3269 total_free_markers
++;
3272 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3273 INTEGER. This is used to package C values to call record_unwind_protect.
3274 The unwind function can get the C values back using XSAVE_VALUE. */
3277 make_save_value (pointer
, integer
)
3281 register Lisp_Object val
;
3282 register struct Lisp_Save_Value
*p
;
3284 val
= allocate_misc ();
3285 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3286 p
= XSAVE_VALUE (val
);
3287 p
->pointer
= pointer
;
3288 p
->integer
= integer
;
3293 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3294 doc
: /* Return a newly allocated marker which does not point at any place. */)
3297 register Lisp_Object val
;
3298 register struct Lisp_Marker
*p
;
3300 val
= allocate_misc ();
3301 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3307 p
->insertion_type
= 0;
3311 /* Put MARKER back on the free list after using it temporarily. */
3314 free_marker (marker
)
3317 unchain_marker (XMARKER (marker
));
3322 /* Return a newly created vector or string with specified arguments as
3323 elements. If all the arguments are characters that can fit
3324 in a string of events, make a string; otherwise, make a vector.
3326 Any number of arguments, even zero arguments, are allowed. */
3329 make_event_array (nargs
, args
)
3335 for (i
= 0; i
< nargs
; i
++)
3336 /* The things that fit in a string
3337 are characters that are in 0...127,
3338 after discarding the meta bit and all the bits above it. */
3339 if (!INTEGERP (args
[i
])
3340 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3341 return Fvector (nargs
, args
);
3343 /* Since the loop exited, we know that all the things in it are
3344 characters, so we can make a string. */
3348 result
= Fmake_string (make_number (nargs
), make_number (0));
3349 for (i
= 0; i
< nargs
; i
++)
3351 SSET (result
, i
, XINT (args
[i
]));
3352 /* Move the meta bit to the right place for a string char. */
3353 if (XINT (args
[i
]) & CHAR_META
)
3354 SSET (result
, i
, SREF (result
, i
) | 0x80);
3363 /************************************************************************
3364 Memory Full Handling
3365 ************************************************************************/
3368 /* Called if malloc returns zero. */
3377 memory_full_cons_threshold
= sizeof (struct cons_block
);
3379 /* The first time we get here, free the spare memory. */
3380 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3381 if (spare_memory
[i
])
3384 free (spare_memory
[i
]);
3385 else if (i
>= 1 && i
<= 4)
3386 lisp_align_free (spare_memory
[i
]);
3388 lisp_free (spare_memory
[i
]);
3389 spare_memory
[i
] = 0;
3392 /* Record the space now used. When it decreases substantially,
3393 we can refill the memory reserve. */
3394 #ifndef SYSTEM_MALLOC
3395 bytes_used_when_full
= BYTES_USED
;
3398 /* This used to call error, but if we've run out of memory, we could
3399 get infinite recursion trying to build the string. */
3401 Fsignal (Qnil
, Vmemory_signal_data
);
3404 /* If we released our reserve (due to running out of memory),
3405 and we have a fair amount free once again,
3406 try to set aside another reserve in case we run out once more.
3408 This is called when a relocatable block is freed in ralloc.c,
3409 and also directly from this file, in case we're not using ralloc.c. */
3412 refill_memory_reserve ()
3414 #ifndef SYSTEM_MALLOC
3415 if (spare_memory
[0] == 0)
3416 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3417 if (spare_memory
[1] == 0)
3418 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3420 if (spare_memory
[2] == 0)
3421 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3423 if (spare_memory
[3] == 0)
3424 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3426 if (spare_memory
[4] == 0)
3427 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3429 if (spare_memory
[5] == 0)
3430 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3432 if (spare_memory
[6] == 0)
3433 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3435 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3436 Vmemory_full
= Qnil
;
3440 /************************************************************************
3442 ************************************************************************/
3444 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3446 /* Conservative C stack marking requires a method to identify possibly
3447 live Lisp objects given a pointer value. We do this by keeping
3448 track of blocks of Lisp data that are allocated in a red-black tree
3449 (see also the comment of mem_node which is the type of nodes in
3450 that tree). Function lisp_malloc adds information for an allocated
3451 block to the red-black tree with calls to mem_insert, and function
3452 lisp_free removes it with mem_delete. Functions live_string_p etc
3453 call mem_find to lookup information about a given pointer in the
3454 tree, and use that to determine if the pointer points to a Lisp
3457 /* Initialize this part of alloc.c. */
3462 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3463 mem_z
.parent
= NULL
;
3464 mem_z
.color
= MEM_BLACK
;
3465 mem_z
.start
= mem_z
.end
= NULL
;
3470 /* Value is a pointer to the mem_node containing START. Value is
3471 MEM_NIL if there is no node in the tree containing START. */
3473 static INLINE
struct mem_node
*
3479 if (start
< min_heap_address
|| start
> max_heap_address
)
3482 /* Make the search always successful to speed up the loop below. */
3483 mem_z
.start
= start
;
3484 mem_z
.end
= (char *) start
+ 1;
3487 while (start
< p
->start
|| start
>= p
->end
)
3488 p
= start
< p
->start
? p
->left
: p
->right
;
3493 /* Insert a new node into the tree for a block of memory with start
3494 address START, end address END, and type TYPE. Value is a
3495 pointer to the node that was inserted. */
3497 static struct mem_node
*
3498 mem_insert (start
, end
, type
)
3502 struct mem_node
*c
, *parent
, *x
;
3504 if (start
< min_heap_address
)
3505 min_heap_address
= start
;
3506 if (end
> max_heap_address
)
3507 max_heap_address
= end
;
3509 /* See where in the tree a node for START belongs. In this
3510 particular application, it shouldn't happen that a node is already
3511 present. For debugging purposes, let's check that. */
3515 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3517 while (c
!= MEM_NIL
)
3519 if (start
>= c
->start
&& start
< c
->end
)
3522 c
= start
< c
->start
? c
->left
: c
->right
;
3525 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3527 while (c
!= MEM_NIL
)
3530 c
= start
< c
->start
? c
->left
: c
->right
;
3533 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3535 /* Create a new node. */
3536 #ifdef GC_MALLOC_CHECK
3537 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3541 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3547 x
->left
= x
->right
= MEM_NIL
;
3550 /* Insert it as child of PARENT or install it as root. */
3553 if (start
< parent
->start
)
3561 /* Re-establish red-black tree properties. */
3562 mem_insert_fixup (x
);
3568 /* Re-establish the red-black properties of the tree, and thereby
3569 balance the tree, after node X has been inserted; X is always red. */
3572 mem_insert_fixup (x
)
3575 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3577 /* X is red and its parent is red. This is a violation of
3578 red-black tree property #3. */
3580 if (x
->parent
== x
->parent
->parent
->left
)
3582 /* We're on the left side of our grandparent, and Y is our
3584 struct mem_node
*y
= x
->parent
->parent
->right
;
3586 if (y
->color
== MEM_RED
)
3588 /* Uncle and parent are red but should be black because
3589 X is red. Change the colors accordingly and proceed
3590 with the grandparent. */
3591 x
->parent
->color
= MEM_BLACK
;
3592 y
->color
= MEM_BLACK
;
3593 x
->parent
->parent
->color
= MEM_RED
;
3594 x
= x
->parent
->parent
;
3598 /* Parent and uncle have different colors; parent is
3599 red, uncle is black. */
3600 if (x
== x
->parent
->right
)
3603 mem_rotate_left (x
);
3606 x
->parent
->color
= MEM_BLACK
;
3607 x
->parent
->parent
->color
= MEM_RED
;
3608 mem_rotate_right (x
->parent
->parent
);
3613 /* This is the symmetrical case of above. */
3614 struct mem_node
*y
= x
->parent
->parent
->left
;
3616 if (y
->color
== MEM_RED
)
3618 x
->parent
->color
= MEM_BLACK
;
3619 y
->color
= MEM_BLACK
;
3620 x
->parent
->parent
->color
= MEM_RED
;
3621 x
= x
->parent
->parent
;
3625 if (x
== x
->parent
->left
)
3628 mem_rotate_right (x
);
3631 x
->parent
->color
= MEM_BLACK
;
3632 x
->parent
->parent
->color
= MEM_RED
;
3633 mem_rotate_left (x
->parent
->parent
);
3638 /* The root may have been changed to red due to the algorithm. Set
3639 it to black so that property #5 is satisfied. */
3640 mem_root
->color
= MEM_BLACK
;
3656 /* Turn y's left sub-tree into x's right sub-tree. */
3659 if (y
->left
!= MEM_NIL
)
3660 y
->left
->parent
= x
;
3662 /* Y's parent was x's parent. */
3664 y
->parent
= x
->parent
;
3666 /* Get the parent to point to y instead of x. */
3669 if (x
== x
->parent
->left
)
3670 x
->parent
->left
= y
;
3672 x
->parent
->right
= y
;
3677 /* Put x on y's left. */
3691 mem_rotate_right (x
)
3694 struct mem_node
*y
= x
->left
;
3697 if (y
->right
!= MEM_NIL
)
3698 y
->right
->parent
= x
;
3701 y
->parent
= x
->parent
;
3704 if (x
== x
->parent
->right
)
3705 x
->parent
->right
= y
;
3707 x
->parent
->left
= y
;
3718 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3724 struct mem_node
*x
, *y
;
3726 if (!z
|| z
== MEM_NIL
)
3729 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3734 while (y
->left
!= MEM_NIL
)
3738 if (y
->left
!= MEM_NIL
)
3743 x
->parent
= y
->parent
;
3746 if (y
== y
->parent
->left
)
3747 y
->parent
->left
= x
;
3749 y
->parent
->right
= x
;
3756 z
->start
= y
->start
;
3761 if (y
->color
== MEM_BLACK
)
3762 mem_delete_fixup (x
);
3764 #ifdef GC_MALLOC_CHECK
3772 /* Re-establish the red-black properties of the tree, after a
3776 mem_delete_fixup (x
)
3779 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3781 if (x
== x
->parent
->left
)
3783 struct mem_node
*w
= x
->parent
->right
;
3785 if (w
->color
== MEM_RED
)
3787 w
->color
= MEM_BLACK
;
3788 x
->parent
->color
= MEM_RED
;
3789 mem_rotate_left (x
->parent
);
3790 w
= x
->parent
->right
;
3793 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3800 if (w
->right
->color
== MEM_BLACK
)
3802 w
->left
->color
= MEM_BLACK
;
3804 mem_rotate_right (w
);
3805 w
= x
->parent
->right
;
3807 w
->color
= x
->parent
->color
;
3808 x
->parent
->color
= MEM_BLACK
;
3809 w
->right
->color
= MEM_BLACK
;
3810 mem_rotate_left (x
->parent
);
3816 struct mem_node
*w
= x
->parent
->left
;
3818 if (w
->color
== MEM_RED
)
3820 w
->color
= MEM_BLACK
;
3821 x
->parent
->color
= MEM_RED
;
3822 mem_rotate_right (x
->parent
);
3823 w
= x
->parent
->left
;
3826 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3833 if (w
->left
->color
== MEM_BLACK
)
3835 w
->right
->color
= MEM_BLACK
;
3837 mem_rotate_left (w
);
3838 w
= x
->parent
->left
;
3841 w
->color
= x
->parent
->color
;
3842 x
->parent
->color
= MEM_BLACK
;
3843 w
->left
->color
= MEM_BLACK
;
3844 mem_rotate_right (x
->parent
);
3850 x
->color
= MEM_BLACK
;
3854 /* Value is non-zero if P is a pointer to a live Lisp string on
3855 the heap. M is a pointer to the mem_block for P. */
3858 live_string_p (m
, p
)
3862 if (m
->type
== MEM_TYPE_STRING
)
3864 struct string_block
*b
= (struct string_block
*) m
->start
;
3865 int offset
= (char *) p
- (char *) &b
->strings
[0];
3867 /* P must point to the start of a Lisp_String structure, and it
3868 must not be on the free-list. */
3870 && offset
% sizeof b
->strings
[0] == 0
3871 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3872 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3879 /* Value is non-zero if P is a pointer to a live Lisp cons on
3880 the heap. M is a pointer to the mem_block for P. */
3887 if (m
->type
== MEM_TYPE_CONS
)
3889 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3890 int offset
= (char *) p
- (char *) &b
->conses
[0];
3892 /* P must point to the start of a Lisp_Cons, not be
3893 one of the unused cells in the current cons block,
3894 and not be on the free-list. */
3896 && offset
% sizeof b
->conses
[0] == 0
3897 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3899 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3900 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3907 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3908 the heap. M is a pointer to the mem_block for P. */
3911 live_symbol_p (m
, p
)
3915 if (m
->type
== MEM_TYPE_SYMBOL
)
3917 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3918 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3920 /* P must point to the start of a Lisp_Symbol, not be
3921 one of the unused cells in the current symbol block,
3922 and not be on the free-list. */
3924 && offset
% sizeof b
->symbols
[0] == 0
3925 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3926 && (b
!= symbol_block
3927 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3928 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3935 /* Value is non-zero if P is a pointer to a live Lisp float on
3936 the heap. M is a pointer to the mem_block for P. */
3943 if (m
->type
== MEM_TYPE_FLOAT
)
3945 struct float_block
*b
= (struct float_block
*) m
->start
;
3946 int offset
= (char *) p
- (char *) &b
->floats
[0];
3948 /* P must point to the start of a Lisp_Float and not be
3949 one of the unused cells in the current float block. */
3951 && offset
% sizeof b
->floats
[0] == 0
3952 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3953 && (b
!= float_block
3954 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3961 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3962 the heap. M is a pointer to the mem_block for P. */
3969 if (m
->type
== MEM_TYPE_MISC
)
3971 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3972 int offset
= (char *) p
- (char *) &b
->markers
[0];
3974 /* P must point to the start of a Lisp_Misc, not be
3975 one of the unused cells in the current misc block,
3976 and not be on the free-list. */
3978 && offset
% sizeof b
->markers
[0] == 0
3979 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3980 && (b
!= marker_block
3981 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3982 && ((union Lisp_Misc
*) p
)->u_marker
.type
!= Lisp_Misc_Free
);
3989 /* Value is non-zero if P is a pointer to a live vector-like object.
3990 M is a pointer to the mem_block for P. */
3993 live_vector_p (m
, p
)
3997 return (p
== m
->start
3998 && m
->type
>= MEM_TYPE_VECTOR
3999 && m
->type
<= MEM_TYPE_WINDOW
);
4003 /* Value is non-zero if P is a pointer to a live buffer. M is a
4004 pointer to the mem_block for P. */
4007 live_buffer_p (m
, p
)
4011 /* P must point to the start of the block, and the buffer
4012 must not have been killed. */
4013 return (m
->type
== MEM_TYPE_BUFFER
4015 && !NILP (((struct buffer
*) p
)->name
));
4018 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4022 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4024 /* Array of objects that are kept alive because the C stack contains
4025 a pattern that looks like a reference to them . */
4027 #define MAX_ZOMBIES 10
4028 static Lisp_Object zombies
[MAX_ZOMBIES
];
4030 /* Number of zombie objects. */
4032 static int nzombies
;
4034 /* Number of garbage collections. */
4038 /* Average percentage of zombies per collection. */
4040 static double avg_zombies
;
4042 /* Max. number of live and zombie objects. */
4044 static int max_live
, max_zombies
;
4046 /* Average number of live objects per GC. */
4048 static double avg_live
;
4050 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4051 doc
: /* Show information about live and zombie objects. */)
4054 Lisp_Object args
[8], zombie_list
= Qnil
;
4056 for (i
= 0; i
< nzombies
; i
++)
4057 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4058 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4059 args
[1] = make_number (ngcs
);
4060 args
[2] = make_float (avg_live
);
4061 args
[3] = make_float (avg_zombies
);
4062 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4063 args
[5] = make_number (max_live
);
4064 args
[6] = make_number (max_zombies
);
4065 args
[7] = zombie_list
;
4066 return Fmessage (8, args
);
4069 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4072 /* Mark OBJ if we can prove it's a Lisp_Object. */
4075 mark_maybe_object (obj
)
4078 void *po
= (void *) XPNTR (obj
);
4079 struct mem_node
*m
= mem_find (po
);
4085 switch (XGCTYPE (obj
))
4088 mark_p
= (live_string_p (m
, po
)
4089 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4093 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4097 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4101 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4104 case Lisp_Vectorlike
:
4105 /* Note: can't check GC_BUFFERP before we know it's a
4106 buffer because checking that dereferences the pointer
4107 PO which might point anywhere. */
4108 if (live_vector_p (m
, po
))
4109 mark_p
= !GC_SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4110 else if (live_buffer_p (m
, po
))
4111 mark_p
= GC_BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4115 mark_p
= (live_misc_p (m
, po
) && !XMARKER (obj
)->gcmarkbit
);
4119 case Lisp_Type_Limit
:
4125 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4126 if (nzombies
< MAX_ZOMBIES
)
4127 zombies
[nzombies
] = obj
;
4136 /* If P points to Lisp data, mark that as live if it isn't already
4140 mark_maybe_pointer (p
)
4145 /* Quickly rule out some values which can't point to Lisp data. We
4146 assume that Lisp data is aligned on even addresses. */
4147 if ((EMACS_INT
) p
& 1)
4153 Lisp_Object obj
= Qnil
;
4157 case MEM_TYPE_NON_LISP
:
4158 /* Nothing to do; not a pointer to Lisp memory. */
4161 case MEM_TYPE_BUFFER
:
4162 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4163 XSETVECTOR (obj
, p
);
4167 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4171 case MEM_TYPE_STRING
:
4172 if (live_string_p (m
, p
)
4173 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4174 XSETSTRING (obj
, p
);
4178 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4182 case MEM_TYPE_SYMBOL
:
4183 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4184 XSETSYMBOL (obj
, p
);
4187 case MEM_TYPE_FLOAT
:
4188 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4192 case MEM_TYPE_VECTOR
:
4193 case MEM_TYPE_PROCESS
:
4194 case MEM_TYPE_HASH_TABLE
:
4195 case MEM_TYPE_FRAME
:
4196 case MEM_TYPE_WINDOW
:
4197 if (live_vector_p (m
, p
))
4200 XSETVECTOR (tem
, p
);
4201 if (!GC_SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4216 /* Mark Lisp objects referenced from the address range START..END. */
4219 mark_memory (start
, end
)
4225 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4229 /* Make START the pointer to the start of the memory region,
4230 if it isn't already. */
4238 /* Mark Lisp_Objects. */
4239 for (p
= (Lisp_Object
*) start
; (void *) p
< end
; ++p
)
4240 mark_maybe_object (*p
);
4242 /* Mark Lisp data pointed to. This is necessary because, in some
4243 situations, the C compiler optimizes Lisp objects away, so that
4244 only a pointer to them remains. Example:
4246 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4249 Lisp_Object obj = build_string ("test");
4250 struct Lisp_String *s = XSTRING (obj);
4251 Fgarbage_collect ();
4252 fprintf (stderr, "test `%s'\n", s->data);
4256 Here, `obj' isn't really used, and the compiler optimizes it
4257 away. The only reference to the life string is through the
4260 for (pp
= (void **) start
; (void *) pp
< end
; ++pp
)
4261 mark_maybe_pointer (*pp
);
4264 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4265 the GCC system configuration. In gcc 3.2, the only systems for
4266 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4267 by others?) and ns32k-pc532-min. */
4269 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4271 static int setjmp_tested_p
, longjmps_done
;
4273 #define SETJMP_WILL_LIKELY_WORK "\
4275 Emacs garbage collector has been changed to use conservative stack\n\
4276 marking. Emacs has determined that the method it uses to do the\n\
4277 marking will likely work on your system, but this isn't sure.\n\
4279 If you are a system-programmer, or can get the help of a local wizard\n\
4280 who is, please take a look at the function mark_stack in alloc.c, and\n\
4281 verify that the methods used are appropriate for your system.\n\
4283 Please mail the result to <emacs-devel@gnu.org>.\n\
4286 #define SETJMP_WILL_NOT_WORK "\
4288 Emacs garbage collector has been changed to use conservative stack\n\
4289 marking. Emacs has determined that the default method it uses to do the\n\
4290 marking will not work on your system. We will need a system-dependent\n\
4291 solution for your system.\n\
4293 Please take a look at the function mark_stack in alloc.c, and\n\
4294 try to find a way to make it work on your system.\n\
4296 Note that you may get false negatives, depending on the compiler.\n\
4297 In particular, you need to use -O with GCC for this test.\n\
4299 Please mail the result to <emacs-devel@gnu.org>.\n\
4303 /* Perform a quick check if it looks like setjmp saves registers in a
4304 jmp_buf. Print a message to stderr saying so. When this test
4305 succeeds, this is _not_ a proof that setjmp is sufficient for
4306 conservative stack marking. Only the sources or a disassembly
4317 /* Arrange for X to be put in a register. */
4323 if (longjmps_done
== 1)
4325 /* Came here after the longjmp at the end of the function.
4327 If x == 1, the longjmp has restored the register to its
4328 value before the setjmp, and we can hope that setjmp
4329 saves all such registers in the jmp_buf, although that
4332 For other values of X, either something really strange is
4333 taking place, or the setjmp just didn't save the register. */
4336 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4339 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4346 if (longjmps_done
== 1)
4350 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4353 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4355 /* Abort if anything GCPRO'd doesn't survive the GC. */
4363 for (p
= gcprolist
; p
; p
= p
->next
)
4364 for (i
= 0; i
< p
->nvars
; ++i
)
4365 if (!survives_gc_p (p
->var
[i
]))
4366 /* FIXME: It's not necessarily a bug. It might just be that the
4367 GCPRO is unnecessary or should release the object sooner. */
4371 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4378 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4379 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4381 fprintf (stderr
, " %d = ", i
);
4382 debug_print (zombies
[i
]);
4386 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4389 /* Mark live Lisp objects on the C stack.
4391 There are several system-dependent problems to consider when
4392 porting this to new architectures:
4396 We have to mark Lisp objects in CPU registers that can hold local
4397 variables or are used to pass parameters.
4399 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4400 something that either saves relevant registers on the stack, or
4401 calls mark_maybe_object passing it each register's contents.
4403 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4404 implementation assumes that calling setjmp saves registers we need
4405 to see in a jmp_buf which itself lies on the stack. This doesn't
4406 have to be true! It must be verified for each system, possibly
4407 by taking a look at the source code of setjmp.
4411 Architectures differ in the way their processor stack is organized.
4412 For example, the stack might look like this
4415 | Lisp_Object | size = 4
4417 | something else | size = 2
4419 | Lisp_Object | size = 4
4423 In such a case, not every Lisp_Object will be aligned equally. To
4424 find all Lisp_Object on the stack it won't be sufficient to walk
4425 the stack in steps of 4 bytes. Instead, two passes will be
4426 necessary, one starting at the start of the stack, and a second
4427 pass starting at the start of the stack + 2. Likewise, if the
4428 minimal alignment of Lisp_Objects on the stack is 1, four passes
4429 would be necessary, each one starting with one byte more offset
4430 from the stack start.
4432 The current code assumes by default that Lisp_Objects are aligned
4433 equally on the stack. */
4440 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4443 /* This trick flushes the register windows so that all the state of
4444 the process is contained in the stack. */
4445 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4446 needed on ia64 too. See mach_dep.c, where it also says inline
4447 assembler doesn't work with relevant proprietary compilers. */
4452 /* Save registers that we need to see on the stack. We need to see
4453 registers used to hold register variables and registers used to
4455 #ifdef GC_SAVE_REGISTERS_ON_STACK
4456 GC_SAVE_REGISTERS_ON_STACK (end
);
4457 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4459 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4460 setjmp will definitely work, test it
4461 and print a message with the result
4463 if (!setjmp_tested_p
)
4465 setjmp_tested_p
= 1;
4468 #endif /* GC_SETJMP_WORKS */
4471 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4472 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4474 /* This assumes that the stack is a contiguous region in memory. If
4475 that's not the case, something has to be done here to iterate
4476 over the stack segments. */
4477 #ifndef GC_LISP_OBJECT_ALIGNMENT
4479 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4481 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4484 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4485 mark_memory ((char *) stack_base
+ i
, end
);
4486 /* Allow for marking a secondary stack, like the register stack on the
4488 #ifdef GC_MARK_SECONDARY_STACK
4489 GC_MARK_SECONDARY_STACK ();
4492 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4497 #endif /* GC_MARK_STACK != 0 */
4501 /* Return 1 if OBJ is a valid lisp object.
4502 Return 0 if OBJ is NOT a valid lisp object.
4503 Return -1 if we cannot validate OBJ.
4504 This function can be quite slow,
4505 so it should only be used in code for manual debugging. */
4508 valid_lisp_object_p (obj
)
4521 p
= (void *) XPNTR (obj
);
4522 if (PURE_POINTER_P (p
))
4526 /* We need to determine whether it is safe to access memory at
4527 address P. Obviously, we cannot just access it (we would SEGV
4528 trying), so we trick the o/s to tell us whether p is a valid
4529 pointer. Unfortunately, we cannot use NULL_DEVICE here, as
4530 emacs_write may not validate p in that case. */
4531 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4533 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4535 unlink ("__Valid__Lisp__Object__");
4549 case MEM_TYPE_NON_LISP
:
4552 case MEM_TYPE_BUFFER
:
4553 return live_buffer_p (m
, p
);
4556 return live_cons_p (m
, p
);
4558 case MEM_TYPE_STRING
:
4559 return live_string_p (m
, p
);
4562 return live_misc_p (m
, p
);
4564 case MEM_TYPE_SYMBOL
:
4565 return live_symbol_p (m
, p
);
4567 case MEM_TYPE_FLOAT
:
4568 return live_float_p (m
, p
);
4570 case MEM_TYPE_VECTOR
:
4571 case MEM_TYPE_PROCESS
:
4572 case MEM_TYPE_HASH_TABLE
:
4573 case MEM_TYPE_FRAME
:
4574 case MEM_TYPE_WINDOW
:
4575 return live_vector_p (m
, p
);
4588 /***********************************************************************
4589 Pure Storage Management
4590 ***********************************************************************/
4592 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4593 pointer to it. TYPE is the Lisp type for which the memory is
4594 allocated. TYPE < 0 means it's not used for a Lisp object.
4596 If store_pure_type_info is set and TYPE is >= 0, the type of
4597 the allocated object is recorded in pure_types. */
4599 static POINTER_TYPE
*
4600 pure_alloc (size
, type
)
4604 POINTER_TYPE
*result
;
4606 size_t alignment
= (1 << GCTYPEBITS
);
4608 size_t alignment
= sizeof (EMACS_INT
);
4610 /* Give Lisp_Floats an extra alignment. */
4611 if (type
== Lisp_Float
)
4613 #if defined __GNUC__ && __GNUC__ >= 2
4614 alignment
= __alignof (struct Lisp_Float
);
4616 alignment
= sizeof (struct Lisp_Float
);
4622 result
= ALIGN (purebeg
+ pure_bytes_used
, alignment
);
4623 pure_bytes_used
= ((char *)result
- (char *)purebeg
) + size
;
4625 if (pure_bytes_used
<= pure_size
)
4628 /* Don't allocate a large amount here,
4629 because it might get mmap'd and then its address
4630 might not be usable. */
4631 purebeg
= (char *) xmalloc (10000);
4633 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4634 pure_bytes_used
= 0;
4639 /* Print a warning if PURESIZE is too small. */
4644 if (pure_bytes_used_before_overflow
)
4645 message ("Pure Lisp storage overflow (approx. %d bytes needed)",
4646 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4650 /* Return a string allocated in pure space. DATA is a buffer holding
4651 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4652 non-zero means make the result string multibyte.
4654 Must get an error if pure storage is full, since if it cannot hold
4655 a large string it may be able to hold conses that point to that
4656 string; then the string is not protected from gc. */
4659 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4665 struct Lisp_String
*s
;
4667 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4668 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4670 s
->size_byte
= multibyte
? nbytes
: -1;
4671 bcopy (data
, s
->data
, nbytes
);
4672 s
->data
[nbytes
] = '\0';
4673 s
->intervals
= NULL_INTERVAL
;
4674 XSETSTRING (string
, s
);
4679 /* Return a cons allocated from pure space. Give it pure copies
4680 of CAR as car and CDR as cdr. */
4683 pure_cons (car
, cdr
)
4684 Lisp_Object car
, cdr
;
4686 register Lisp_Object
new;
4687 struct Lisp_Cons
*p
;
4689 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4691 XSETCAR (new, Fpurecopy (car
));
4692 XSETCDR (new, Fpurecopy (cdr
));
4697 /* Value is a float object with value NUM allocated from pure space. */
4700 make_pure_float (num
)
4703 register Lisp_Object
new;
4704 struct Lisp_Float
*p
;
4706 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4708 XFLOAT_DATA (new) = num
;
4713 /* Return a vector with room for LEN Lisp_Objects allocated from
4717 make_pure_vector (len
)
4721 struct Lisp_Vector
*p
;
4722 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4724 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4725 XSETVECTOR (new, p
);
4726 XVECTOR (new)->size
= len
;
4731 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4732 doc
: /* Make a copy of OBJECT in pure storage.
4733 Recursively copies contents of vectors and cons cells.
4734 Does not copy symbols. Copies strings without text properties. */)
4736 register Lisp_Object obj
;
4738 if (NILP (Vpurify_flag
))
4741 if (PURE_POINTER_P (XPNTR (obj
)))
4745 return pure_cons (XCAR (obj
), XCDR (obj
));
4746 else if (FLOATP (obj
))
4747 return make_pure_float (XFLOAT_DATA (obj
));
4748 else if (STRINGP (obj
))
4749 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4751 STRING_MULTIBYTE (obj
));
4752 else if (COMPILEDP (obj
) || VECTORP (obj
))
4754 register struct Lisp_Vector
*vec
;
4758 size
= XVECTOR (obj
)->size
;
4759 if (size
& PSEUDOVECTOR_FLAG
)
4760 size
&= PSEUDOVECTOR_SIZE_MASK
;
4761 vec
= XVECTOR (make_pure_vector (size
));
4762 for (i
= 0; i
< size
; i
++)
4763 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4764 if (COMPILEDP (obj
))
4765 XSETCOMPILED (obj
, vec
);
4767 XSETVECTOR (obj
, vec
);
4770 else if (MARKERP (obj
))
4771 error ("Attempt to copy a marker to pure storage");
4778 /***********************************************************************
4780 ***********************************************************************/
4782 /* Put an entry in staticvec, pointing at the variable with address
4786 staticpro (varaddress
)
4787 Lisp_Object
*varaddress
;
4789 staticvec
[staticidx
++] = varaddress
;
4790 if (staticidx
>= NSTATICS
)
4798 struct catchtag
*next
;
4802 /***********************************************************************
4804 ***********************************************************************/
4806 /* Temporarily prevent garbage collection. */
4809 inhibit_garbage_collection ()
4811 int count
= SPECPDL_INDEX ();
4812 int nbits
= min (VALBITS
, BITS_PER_INT
);
4814 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4819 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4820 doc
: /* Reclaim storage for Lisp objects no longer needed.
4821 Garbage collection happens automatically if you cons more than
4822 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4823 `garbage-collect' normally returns a list with info on amount of space in use:
4824 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4825 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4826 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4827 (USED-STRINGS . FREE-STRINGS))
4828 However, if there was overflow in pure space, `garbage-collect'
4829 returns nil, because real GC can't be done. */)
4832 register struct specbinding
*bind
;
4833 struct catchtag
*catch;
4834 struct handler
*handler
;
4835 char stack_top_variable
;
4838 Lisp_Object total
[8];
4839 int count
= SPECPDL_INDEX ();
4840 EMACS_TIME t1
, t2
, t3
;
4845 /* Can't GC if pure storage overflowed because we can't determine
4846 if something is a pure object or not. */
4847 if (pure_bytes_used_before_overflow
)
4852 /* Don't keep undo information around forever.
4853 Do this early on, so it is no problem if the user quits. */
4855 register struct buffer
*nextb
= all_buffers
;
4859 /* If a buffer's undo list is Qt, that means that undo is
4860 turned off in that buffer. Calling truncate_undo_list on
4861 Qt tends to return NULL, which effectively turns undo back on.
4862 So don't call truncate_undo_list if undo_list is Qt. */
4863 if (! NILP (nextb
->name
) && ! EQ (nextb
->undo_list
, Qt
))
4864 truncate_undo_list (nextb
);
4866 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4867 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
))
4869 /* If a buffer's gap size is more than 10% of the buffer
4870 size, or larger than 2000 bytes, then shrink it
4871 accordingly. Keep a minimum size of 20 bytes. */
4872 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4874 if (nextb
->text
->gap_size
> size
)
4876 struct buffer
*save_current
= current_buffer
;
4877 current_buffer
= nextb
;
4878 make_gap (-(nextb
->text
->gap_size
- size
));
4879 current_buffer
= save_current
;
4883 nextb
= nextb
->next
;
4887 EMACS_GET_TIME (t1
);
4889 /* In case user calls debug_print during GC,
4890 don't let that cause a recursive GC. */
4891 consing_since_gc
= 0;
4893 /* Save what's currently displayed in the echo area. */
4894 message_p
= push_message ();
4895 record_unwind_protect (pop_message_unwind
, Qnil
);
4897 /* Save a copy of the contents of the stack, for debugging. */
4898 #if MAX_SAVE_STACK > 0
4899 if (NILP (Vpurify_flag
))
4901 i
= &stack_top_variable
- stack_bottom
;
4903 if (i
< MAX_SAVE_STACK
)
4905 if (stack_copy
== 0)
4906 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
4907 else if (stack_copy_size
< i
)
4908 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
4911 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
4912 bcopy (stack_bottom
, stack_copy
, i
);
4914 bcopy (&stack_top_variable
, stack_copy
, i
);
4918 #endif /* MAX_SAVE_STACK > 0 */
4920 if (garbage_collection_messages
)
4921 message1_nolog ("Garbage collecting...");
4925 shrink_regexp_cache ();
4929 /* clear_marks (); */
4931 /* Mark all the special slots that serve as the roots of accessibility. */
4933 for (i
= 0; i
< staticidx
; i
++)
4934 mark_object (*staticvec
[i
]);
4936 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4938 mark_object (bind
->symbol
);
4939 mark_object (bind
->old_value
);
4947 extern void xg_mark_data ();
4952 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
4953 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
4957 register struct gcpro
*tail
;
4958 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4959 for (i
= 0; i
< tail
->nvars
; i
++)
4960 mark_object (tail
->var
[i
]);
4965 for (catch = catchlist
; catch; catch = catch->next
)
4967 mark_object (catch->tag
);
4968 mark_object (catch->val
);
4970 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
4972 mark_object (handler
->handler
);
4973 mark_object (handler
->var
);
4977 #ifdef HAVE_WINDOW_SYSTEM
4978 mark_fringe_data ();
4981 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4985 /* Everything is now marked, except for the things that require special
4986 finalization, i.e. the undo_list.
4987 Look thru every buffer's undo list
4988 for elements that update markers that were not marked,
4991 register struct buffer
*nextb
= all_buffers
;
4995 /* If a buffer's undo list is Qt, that means that undo is
4996 turned off in that buffer. Calling truncate_undo_list on
4997 Qt tends to return NULL, which effectively turns undo back on.
4998 So don't call truncate_undo_list if undo_list is Qt. */
4999 if (! EQ (nextb
->undo_list
, Qt
))
5001 Lisp_Object tail
, prev
;
5002 tail
= nextb
->undo_list
;
5004 while (CONSP (tail
))
5006 if (GC_CONSP (XCAR (tail
))
5007 && GC_MARKERP (XCAR (XCAR (tail
)))
5008 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5011 nextb
->undo_list
= tail
= XCDR (tail
);
5015 XSETCDR (prev
, tail
);
5025 /* Now that we have stripped the elements that need not be in the
5026 undo_list any more, we can finally mark the list. */
5027 mark_object (nextb
->undo_list
);
5029 nextb
= nextb
->next
;
5035 /* Clear the mark bits that we set in certain root slots. */
5037 unmark_byte_stack ();
5038 VECTOR_UNMARK (&buffer_defaults
);
5039 VECTOR_UNMARK (&buffer_local_symbols
);
5041 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5049 /* clear_marks (); */
5052 consing_since_gc
= 0;
5053 if (gc_cons_threshold
< 10000)
5054 gc_cons_threshold
= 10000;
5056 if (FLOATP (Vgc_cons_percentage
))
5057 { /* Set gc_cons_combined_threshold. */
5058 EMACS_INT total
= 0;
5060 total
+= total_conses
* sizeof (struct Lisp_Cons
);
5061 total
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5062 total
+= total_markers
* sizeof (union Lisp_Misc
);
5063 total
+= total_string_size
;
5064 total
+= total_vector_size
* sizeof (Lisp_Object
);
5065 total
+= total_floats
* sizeof (struct Lisp_Float
);
5066 total
+= total_intervals
* sizeof (struct interval
);
5067 total
+= total_strings
* sizeof (struct Lisp_String
);
5069 gc_relative_threshold
= total
* XFLOAT_DATA (Vgc_cons_percentage
);
5072 gc_relative_threshold
= 0;
5074 if (garbage_collection_messages
)
5076 if (message_p
|| minibuf_level
> 0)
5079 message1_nolog ("Garbage collecting...done");
5082 unbind_to (count
, Qnil
);
5084 total
[0] = Fcons (make_number (total_conses
),
5085 make_number (total_free_conses
));
5086 total
[1] = Fcons (make_number (total_symbols
),
5087 make_number (total_free_symbols
));
5088 total
[2] = Fcons (make_number (total_markers
),
5089 make_number (total_free_markers
));
5090 total
[3] = make_number (total_string_size
);
5091 total
[4] = make_number (total_vector_size
);
5092 total
[5] = Fcons (make_number (total_floats
),
5093 make_number (total_free_floats
));
5094 total
[6] = Fcons (make_number (total_intervals
),
5095 make_number (total_free_intervals
));
5096 total
[7] = Fcons (make_number (total_strings
),
5097 make_number (total_free_strings
));
5099 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5101 /* Compute average percentage of zombies. */
5104 for (i
= 0; i
< 7; ++i
)
5105 if (CONSP (total
[i
]))
5106 nlive
+= XFASTINT (XCAR (total
[i
]));
5108 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5109 max_live
= max (nlive
, max_live
);
5110 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5111 max_zombies
= max (nzombies
, max_zombies
);
5116 if (!NILP (Vpost_gc_hook
))
5118 int count
= inhibit_garbage_collection ();
5119 safe_run_hooks (Qpost_gc_hook
);
5120 unbind_to (count
, Qnil
);
5123 /* Accumulate statistics. */
5124 EMACS_GET_TIME (t2
);
5125 EMACS_SUB_TIME (t3
, t2
, t1
);
5126 if (FLOATP (Vgc_elapsed
))
5127 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5129 EMACS_USECS (t3
) * 1.0e-6);
5132 return Flist (sizeof total
/ sizeof *total
, total
);
5136 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5137 only interesting objects referenced from glyphs are strings. */
5140 mark_glyph_matrix (matrix
)
5141 struct glyph_matrix
*matrix
;
5143 struct glyph_row
*row
= matrix
->rows
;
5144 struct glyph_row
*end
= row
+ matrix
->nrows
;
5146 for (; row
< end
; ++row
)
5150 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5152 struct glyph
*glyph
= row
->glyphs
[area
];
5153 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5155 for (; glyph
< end_glyph
; ++glyph
)
5156 if (GC_STRINGP (glyph
->object
)
5157 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5158 mark_object (glyph
->object
);
5164 /* Mark Lisp faces in the face cache C. */
5168 struct face_cache
*c
;
5173 for (i
= 0; i
< c
->used
; ++i
)
5175 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5179 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5180 mark_object (face
->lface
[j
]);
5187 #ifdef HAVE_WINDOW_SYSTEM
5189 /* Mark Lisp objects in image IMG. */
5195 mark_object (img
->spec
);
5197 if (!NILP (img
->data
.lisp_val
))
5198 mark_object (img
->data
.lisp_val
);
5202 /* Mark Lisp objects in image cache of frame F. It's done this way so
5203 that we don't have to include xterm.h here. */
5206 mark_image_cache (f
)
5209 forall_images_in_image_cache (f
, mark_image
);
5212 #endif /* HAVE_X_WINDOWS */
5216 /* Mark reference to a Lisp_Object.
5217 If the object referred to has not been seen yet, recursively mark
5218 all the references contained in it. */
5220 #define LAST_MARKED_SIZE 500
5221 Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5222 int last_marked_index
;
5224 /* For debugging--call abort when we cdr down this many
5225 links of a list, in mark_object. In debugging,
5226 the call to abort will hit a breakpoint.
5227 Normally this is zero and the check never goes off. */
5228 int mark_object_loop_halt
;
5234 register Lisp_Object obj
= arg
;
5235 #ifdef GC_CHECK_MARKED_OBJECTS
5243 if (PURE_POINTER_P (XPNTR (obj
)))
5246 last_marked
[last_marked_index
++] = obj
;
5247 if (last_marked_index
== LAST_MARKED_SIZE
)
5248 last_marked_index
= 0;
5250 /* Perform some sanity checks on the objects marked here. Abort if
5251 we encounter an object we know is bogus. This increases GC time
5252 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5253 #ifdef GC_CHECK_MARKED_OBJECTS
5255 po
= (void *) XPNTR (obj
);
5257 /* Check that the object pointed to by PO is known to be a Lisp
5258 structure allocated from the heap. */
5259 #define CHECK_ALLOCATED() \
5261 m = mem_find (po); \
5266 /* Check that the object pointed to by PO is live, using predicate
5268 #define CHECK_LIVE(LIVEP) \
5270 if (!LIVEP (m, po)) \
5274 /* Check both of the above conditions. */
5275 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5277 CHECK_ALLOCATED (); \
5278 CHECK_LIVE (LIVEP); \
5281 #else /* not GC_CHECK_MARKED_OBJECTS */
5283 #define CHECK_ALLOCATED() (void) 0
5284 #define CHECK_LIVE(LIVEP) (void) 0
5285 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5287 #endif /* not GC_CHECK_MARKED_OBJECTS */
5289 switch (SWITCH_ENUM_CAST (XGCTYPE (obj
)))
5293 register struct Lisp_String
*ptr
= XSTRING (obj
);
5294 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5295 MARK_INTERVAL_TREE (ptr
->intervals
);
5297 #ifdef GC_CHECK_STRING_BYTES
5298 /* Check that the string size recorded in the string is the
5299 same as the one recorded in the sdata structure. */
5300 CHECK_STRING_BYTES (ptr
);
5301 #endif /* GC_CHECK_STRING_BYTES */
5305 case Lisp_Vectorlike
:
5306 #ifdef GC_CHECK_MARKED_OBJECTS
5308 if (m
== MEM_NIL
&& !GC_SUBRP (obj
)
5309 && po
!= &buffer_defaults
5310 && po
!= &buffer_local_symbols
)
5312 #endif /* GC_CHECK_MARKED_OBJECTS */
5314 if (GC_BUFFERP (obj
))
5316 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
5318 #ifdef GC_CHECK_MARKED_OBJECTS
5319 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5322 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
5327 #endif /* GC_CHECK_MARKED_OBJECTS */
5331 else if (GC_SUBRP (obj
))
5333 else if (GC_COMPILEDP (obj
))
5334 /* We could treat this just like a vector, but it is better to
5335 save the COMPILED_CONSTANTS element for last and avoid
5338 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5339 register EMACS_INT size
= ptr
->size
;
5342 if (VECTOR_MARKED_P (ptr
))
5343 break; /* Already marked */
5345 CHECK_LIVE (live_vector_p
);
5346 VECTOR_MARK (ptr
); /* Else mark it */
5347 size
&= PSEUDOVECTOR_SIZE_MASK
;
5348 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5350 if (i
!= COMPILED_CONSTANTS
)
5351 mark_object (ptr
->contents
[i
]);
5353 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5356 else if (GC_FRAMEP (obj
))
5358 register struct frame
*ptr
= XFRAME (obj
);
5360 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
5361 VECTOR_MARK (ptr
); /* Else mark it */
5363 CHECK_LIVE (live_vector_p
);
5364 mark_object (ptr
->name
);
5365 mark_object (ptr
->icon_name
);
5366 mark_object (ptr
->title
);
5367 mark_object (ptr
->focus_frame
);
5368 mark_object (ptr
->selected_window
);
5369 mark_object (ptr
->minibuffer_window
);
5370 mark_object (ptr
->param_alist
);
5371 mark_object (ptr
->scroll_bars
);
5372 mark_object (ptr
->condemned_scroll_bars
);
5373 mark_object (ptr
->menu_bar_items
);
5374 mark_object (ptr
->face_alist
);
5375 mark_object (ptr
->menu_bar_vector
);
5376 mark_object (ptr
->buffer_predicate
);
5377 mark_object (ptr
->buffer_list
);
5378 mark_object (ptr
->buried_buffer_list
);
5379 mark_object (ptr
->menu_bar_window
);
5380 mark_object (ptr
->tool_bar_window
);
5381 mark_face_cache (ptr
->face_cache
);
5382 #ifdef HAVE_WINDOW_SYSTEM
5383 mark_image_cache (ptr
);
5384 mark_object (ptr
->tool_bar_items
);
5385 mark_object (ptr
->desired_tool_bar_string
);
5386 mark_object (ptr
->current_tool_bar_string
);
5387 #endif /* HAVE_WINDOW_SYSTEM */
5389 else if (GC_BOOL_VECTOR_P (obj
))
5391 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5393 if (VECTOR_MARKED_P (ptr
))
5394 break; /* Already marked */
5395 CHECK_LIVE (live_vector_p
);
5396 VECTOR_MARK (ptr
); /* Else mark it */
5398 else if (GC_WINDOWP (obj
))
5400 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5401 struct window
*w
= XWINDOW (obj
);
5404 /* Stop if already marked. */
5405 if (VECTOR_MARKED_P (ptr
))
5409 CHECK_LIVE (live_vector_p
);
5412 /* There is no Lisp data above The member CURRENT_MATRIX in
5413 struct WINDOW. Stop marking when that slot is reached. */
5415 (char *) &ptr
->contents
[i
] < (char *) &w
->current_matrix
;
5417 mark_object (ptr
->contents
[i
]);
5419 /* Mark glyphs for leaf windows. Marking window matrices is
5420 sufficient because frame matrices use the same glyph
5422 if (NILP (w
->hchild
)
5424 && w
->current_matrix
)
5426 mark_glyph_matrix (w
->current_matrix
);
5427 mark_glyph_matrix (w
->desired_matrix
);
5430 else if (GC_HASH_TABLE_P (obj
))
5432 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5434 /* Stop if already marked. */
5435 if (VECTOR_MARKED_P (h
))
5439 CHECK_LIVE (live_vector_p
);
5442 /* Mark contents. */
5443 /* Do not mark next_free or next_weak.
5444 Being in the next_weak chain
5445 should not keep the hash table alive.
5446 No need to mark `count' since it is an integer. */
5447 mark_object (h
->test
);
5448 mark_object (h
->weak
);
5449 mark_object (h
->rehash_size
);
5450 mark_object (h
->rehash_threshold
);
5451 mark_object (h
->hash
);
5452 mark_object (h
->next
);
5453 mark_object (h
->index
);
5454 mark_object (h
->user_hash_function
);
5455 mark_object (h
->user_cmp_function
);
5457 /* If hash table is not weak, mark all keys and values.
5458 For weak tables, mark only the vector. */
5459 if (GC_NILP (h
->weak
))
5460 mark_object (h
->key_and_value
);
5462 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5466 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5467 register EMACS_INT size
= ptr
->size
;
5470 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
5471 CHECK_LIVE (live_vector_p
);
5472 VECTOR_MARK (ptr
); /* Else mark it */
5473 if (size
& PSEUDOVECTOR_FLAG
)
5474 size
&= PSEUDOVECTOR_SIZE_MASK
;
5476 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5477 mark_object (ptr
->contents
[i
]);
5483 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5484 struct Lisp_Symbol
*ptrx
;
5486 if (ptr
->gcmarkbit
) break;
5487 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5489 mark_object (ptr
->value
);
5490 mark_object (ptr
->function
);
5491 mark_object (ptr
->plist
);
5493 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5494 MARK_STRING (XSTRING (ptr
->xname
));
5495 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5497 /* Note that we do not mark the obarray of the symbol.
5498 It is safe not to do so because nothing accesses that
5499 slot except to check whether it is nil. */
5503 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5504 XSETSYMBOL (obj
, ptrx
);
5511 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5512 if (XMARKER (obj
)->gcmarkbit
)
5514 XMARKER (obj
)->gcmarkbit
= 1;
5516 switch (XMISCTYPE (obj
))
5518 case Lisp_Misc_Buffer_Local_Value
:
5519 case Lisp_Misc_Some_Buffer_Local_Value
:
5521 register struct Lisp_Buffer_Local_Value
*ptr
5522 = XBUFFER_LOCAL_VALUE (obj
);
5523 /* If the cdr is nil, avoid recursion for the car. */
5524 if (EQ (ptr
->cdr
, Qnil
))
5526 obj
= ptr
->realvalue
;
5529 mark_object (ptr
->realvalue
);
5530 mark_object (ptr
->buffer
);
5531 mark_object (ptr
->frame
);
5536 case Lisp_Misc_Marker
:
5537 /* DO NOT mark thru the marker's chain.
5538 The buffer's markers chain does not preserve markers from gc;
5539 instead, markers are removed from the chain when freed by gc. */
5542 case Lisp_Misc_Intfwd
:
5543 case Lisp_Misc_Boolfwd
:
5544 case Lisp_Misc_Objfwd
:
5545 case Lisp_Misc_Buffer_Objfwd
:
5546 case Lisp_Misc_Kboard_Objfwd
:
5547 /* Don't bother with Lisp_Buffer_Objfwd,
5548 since all markable slots in current buffer marked anyway. */
5549 /* Don't need to do Lisp_Objfwd, since the places they point
5550 are protected with staticpro. */
5553 case Lisp_Misc_Save_Value
:
5556 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5557 /* If DOGC is set, POINTER is the address of a memory
5558 area containing INTEGER potential Lisp_Objects. */
5561 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5563 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5564 mark_maybe_object (*p
);
5570 case Lisp_Misc_Overlay
:
5572 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5573 mark_object (ptr
->start
);
5574 mark_object (ptr
->end
);
5575 mark_object (ptr
->plist
);
5578 XSETMISC (obj
, ptr
->next
);
5591 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5592 if (CONS_MARKED_P (ptr
)) break;
5593 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5595 /* If the cdr is nil, avoid recursion for the car. */
5596 if (EQ (ptr
->u
.cdr
, Qnil
))
5602 mark_object (ptr
->car
);
5605 if (cdr_count
== mark_object_loop_halt
)
5611 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5612 FLOAT_MARK (XFLOAT (obj
));
5623 #undef CHECK_ALLOCATED
5624 #undef CHECK_ALLOCATED_AND_LIVE
5627 /* Mark the pointers in a buffer structure. */
5633 register struct buffer
*buffer
= XBUFFER (buf
);
5634 register Lisp_Object
*ptr
, tmp
;
5635 Lisp_Object base_buffer
;
5637 VECTOR_MARK (buffer
);
5639 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5641 /* For now, we just don't mark the undo_list. It's done later in
5642 a special way just before the sweep phase, and after stripping
5643 some of its elements that are not needed any more. */
5645 if (buffer
->overlays_before
)
5647 XSETMISC (tmp
, buffer
->overlays_before
);
5650 if (buffer
->overlays_after
)
5652 XSETMISC (tmp
, buffer
->overlays_after
);
5656 for (ptr
= &buffer
->name
;
5657 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5661 /* If this is an indirect buffer, mark its base buffer. */
5662 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5664 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5665 mark_buffer (base_buffer
);
5670 /* Value is non-zero if OBJ will survive the current GC because it's
5671 either marked or does not need to be marked to survive. */
5679 switch (XGCTYPE (obj
))
5686 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5690 survives_p
= XMARKER (obj
)->gcmarkbit
;
5694 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5697 case Lisp_Vectorlike
:
5698 survives_p
= GC_SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5702 survives_p
= CONS_MARKED_P (XCONS (obj
));
5706 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5713 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5718 /* Sweep: find all structures not marked, and free them. */
5723 /* Remove or mark entries in weak hash tables.
5724 This must be done before any object is unmarked. */
5725 sweep_weak_hash_tables ();
5728 #ifdef GC_CHECK_STRING_BYTES
5729 if (!noninteractive
)
5730 check_string_bytes (1);
5733 /* Put all unmarked conses on free list */
5735 register struct cons_block
*cblk
;
5736 struct cons_block
**cprev
= &cons_block
;
5737 register int lim
= cons_block_index
;
5738 register int num_free
= 0, num_used
= 0;
5742 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5746 for (i
= 0; i
< lim
; i
++)
5747 if (!CONS_MARKED_P (&cblk
->conses
[i
]))
5750 cblk
->conses
[i
].u
.chain
= cons_free_list
;
5751 cons_free_list
= &cblk
->conses
[i
];
5753 cons_free_list
->car
= Vdead
;
5759 CONS_UNMARK (&cblk
->conses
[i
]);
5761 lim
= CONS_BLOCK_SIZE
;
5762 /* If this block contains only free conses and we have already
5763 seen more than two blocks worth of free conses then deallocate
5765 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5767 *cprev
= cblk
->next
;
5768 /* Unhook from the free list. */
5769 cons_free_list
= cblk
->conses
[0].u
.chain
;
5770 lisp_align_free (cblk
);
5775 num_free
+= this_free
;
5776 cprev
= &cblk
->next
;
5779 total_conses
= num_used
;
5780 total_free_conses
= num_free
;
5783 /* Put all unmarked floats on free list */
5785 register struct float_block
*fblk
;
5786 struct float_block
**fprev
= &float_block
;
5787 register int lim
= float_block_index
;
5788 register int num_free
= 0, num_used
= 0;
5790 float_free_list
= 0;
5792 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5796 for (i
= 0; i
< lim
; i
++)
5797 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5800 fblk
->floats
[i
].u
.chain
= float_free_list
;
5801 float_free_list
= &fblk
->floats
[i
];
5806 FLOAT_UNMARK (&fblk
->floats
[i
]);
5808 lim
= FLOAT_BLOCK_SIZE
;
5809 /* If this block contains only free floats and we have already
5810 seen more than two blocks worth of free floats then deallocate
5812 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5814 *fprev
= fblk
->next
;
5815 /* Unhook from the free list. */
5816 float_free_list
= fblk
->floats
[0].u
.chain
;
5817 lisp_align_free (fblk
);
5822 num_free
+= this_free
;
5823 fprev
= &fblk
->next
;
5826 total_floats
= num_used
;
5827 total_free_floats
= num_free
;
5830 /* Put all unmarked intervals on free list */
5832 register struct interval_block
*iblk
;
5833 struct interval_block
**iprev
= &interval_block
;
5834 register int lim
= interval_block_index
;
5835 register int num_free
= 0, num_used
= 0;
5837 interval_free_list
= 0;
5839 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5844 for (i
= 0; i
< lim
; i
++)
5846 if (!iblk
->intervals
[i
].gcmarkbit
)
5848 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5849 interval_free_list
= &iblk
->intervals
[i
];
5855 iblk
->intervals
[i
].gcmarkbit
= 0;
5858 lim
= INTERVAL_BLOCK_SIZE
;
5859 /* If this block contains only free intervals and we have already
5860 seen more than two blocks worth of free intervals then
5861 deallocate this block. */
5862 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5864 *iprev
= iblk
->next
;
5865 /* Unhook from the free list. */
5866 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5868 n_interval_blocks
--;
5872 num_free
+= this_free
;
5873 iprev
= &iblk
->next
;
5876 total_intervals
= num_used
;
5877 total_free_intervals
= num_free
;
5880 /* Put all unmarked symbols on free list */
5882 register struct symbol_block
*sblk
;
5883 struct symbol_block
**sprev
= &symbol_block
;
5884 register int lim
= symbol_block_index
;
5885 register int num_free
= 0, num_used
= 0;
5887 symbol_free_list
= NULL
;
5889 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5892 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5893 struct Lisp_Symbol
*end
= sym
+ lim
;
5895 for (; sym
< end
; ++sym
)
5897 /* Check if the symbol was created during loadup. In such a case
5898 it might be pointed to by pure bytecode which we don't trace,
5899 so we conservatively assume that it is live. */
5900 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5902 if (!sym
->gcmarkbit
&& !pure_p
)
5904 sym
->next
= symbol_free_list
;
5905 symbol_free_list
= sym
;
5907 symbol_free_list
->function
= Vdead
;
5915 UNMARK_STRING (XSTRING (sym
->xname
));
5920 lim
= SYMBOL_BLOCK_SIZE
;
5921 /* If this block contains only free symbols and we have already
5922 seen more than two blocks worth of free symbols then deallocate
5924 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5926 *sprev
= sblk
->next
;
5927 /* Unhook from the free list. */
5928 symbol_free_list
= sblk
->symbols
[0].next
;
5934 num_free
+= this_free
;
5935 sprev
= &sblk
->next
;
5938 total_symbols
= num_used
;
5939 total_free_symbols
= num_free
;
5942 /* Put all unmarked misc's on free list.
5943 For a marker, first unchain it from the buffer it points into. */
5945 register struct marker_block
*mblk
;
5946 struct marker_block
**mprev
= &marker_block
;
5947 register int lim
= marker_block_index
;
5948 register int num_free
= 0, num_used
= 0;
5950 marker_free_list
= 0;
5952 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5957 for (i
= 0; i
< lim
; i
++)
5959 if (!mblk
->markers
[i
].u_marker
.gcmarkbit
)
5961 if (mblk
->markers
[i
].u_marker
.type
== Lisp_Misc_Marker
)
5962 unchain_marker (&mblk
->markers
[i
].u_marker
);
5963 /* Set the type of the freed object to Lisp_Misc_Free.
5964 We could leave the type alone, since nobody checks it,
5965 but this might catch bugs faster. */
5966 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
5967 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
5968 marker_free_list
= &mblk
->markers
[i
];
5974 mblk
->markers
[i
].u_marker
.gcmarkbit
= 0;
5977 lim
= MARKER_BLOCK_SIZE
;
5978 /* If this block contains only free markers and we have already
5979 seen more than two blocks worth of free markers then deallocate
5981 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
5983 *mprev
= mblk
->next
;
5984 /* Unhook from the free list. */
5985 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
5991 num_free
+= this_free
;
5992 mprev
= &mblk
->next
;
5996 total_markers
= num_used
;
5997 total_free_markers
= num_free
;
6000 /* Free all unmarked buffers */
6002 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6005 if (!VECTOR_MARKED_P (buffer
))
6008 prev
->next
= buffer
->next
;
6010 all_buffers
= buffer
->next
;
6011 next
= buffer
->next
;
6017 VECTOR_UNMARK (buffer
);
6018 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6019 prev
= buffer
, buffer
= buffer
->next
;
6023 /* Free all unmarked vectors */
6025 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6026 total_vector_size
= 0;
6029 if (!VECTOR_MARKED_P (vector
))
6032 prev
->next
= vector
->next
;
6034 all_vectors
= vector
->next
;
6035 next
= vector
->next
;
6043 VECTOR_UNMARK (vector
);
6044 if (vector
->size
& PSEUDOVECTOR_FLAG
)
6045 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
6047 total_vector_size
+= vector
->size
;
6048 prev
= vector
, vector
= vector
->next
;
6052 #ifdef GC_CHECK_STRING_BYTES
6053 if (!noninteractive
)
6054 check_string_bytes (1);
6061 /* Debugging aids. */
6063 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6064 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6065 This may be helpful in debugging Emacs's memory usage.
6066 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6071 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
6076 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6077 doc
: /* Return a list of counters that measure how much consing there has been.
6078 Each of these counters increments for a certain kind of object.
6079 The counters wrap around from the largest positive integer to zero.
6080 Garbage collection does not decrease them.
6081 The elements of the value are as follows:
6082 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6083 All are in units of 1 = one object consed
6084 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6086 MISCS include overlays, markers, and some internal types.
6087 Frames, windows, buffers, and subprocesses count as vectors
6088 (but the contents of a buffer's text do not count here). */)
6091 Lisp_Object consed
[8];
6093 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6094 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6095 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6096 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6097 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6098 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6099 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6100 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6102 return Flist (8, consed
);
6105 int suppress_checking
;
6107 die (msg
, file
, line
)
6112 fprintf (stderr
, "\r\nEmacs fatal error: %s:%d: %s\r\n",
6117 /* Initialization */
6122 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6124 pure_size
= PURESIZE
;
6125 pure_bytes_used
= 0;
6126 pure_bytes_used_before_overflow
= 0;
6128 /* Initialize the list of free aligned blocks. */
6131 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6133 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6137 ignore_warnings
= 1;
6138 #ifdef DOUG_LEA_MALLOC
6139 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6140 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6141 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6151 malloc_hysteresis
= 32;
6153 malloc_hysteresis
= 0;
6156 refill_memory_reserve ();
6158 ignore_warnings
= 0;
6160 byte_stack_list
= 0;
6162 consing_since_gc
= 0;
6163 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6164 gc_relative_threshold
= 0;
6166 #ifdef VIRT_ADDR_VARIES
6167 malloc_sbrk_unused
= 1<<22; /* A large number */
6168 malloc_sbrk_used
= 100000; /* as reasonable as any number */
6169 #endif /* VIRT_ADDR_VARIES */
6176 byte_stack_list
= 0;
6178 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6179 setjmp_tested_p
= longjmps_done
= 0;
6182 Vgc_elapsed
= make_float (0.0);
6189 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
6190 doc
: /* *Number of bytes of consing between garbage collections.
6191 Garbage collection can happen automatically once this many bytes have been
6192 allocated since the last garbage collection. All data types count.
6194 Garbage collection happens automatically only when `eval' is called.
6196 By binding this temporarily to a large number, you can effectively
6197 prevent garbage collection during a part of the program.
6198 See also `gc-cons-percentage'. */);
6200 DEFVAR_LISP ("gc-cons-percentage", &Vgc_cons_percentage
,
6201 doc
: /* *Portion of the heap used for allocation.
6202 Garbage collection can happen automatically once this portion of the heap
6203 has been allocated since the last garbage collection.
6204 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6205 Vgc_cons_percentage
= make_float (0.1);
6207 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
6208 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6210 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
6211 doc
: /* Number of cons cells that have been consed so far. */);
6213 DEFVAR_INT ("floats-consed", &floats_consed
,
6214 doc
: /* Number of floats that have been consed so far. */);
6216 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
6217 doc
: /* Number of vector cells that have been consed so far. */);
6219 DEFVAR_INT ("symbols-consed", &symbols_consed
,
6220 doc
: /* Number of symbols that have been consed so far. */);
6222 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
6223 doc
: /* Number of string characters that have been consed so far. */);
6225 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
6226 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6228 DEFVAR_INT ("intervals-consed", &intervals_consed
,
6229 doc
: /* Number of intervals that have been consed so far. */);
6231 DEFVAR_INT ("strings-consed", &strings_consed
,
6232 doc
: /* Number of strings that have been consed so far. */);
6234 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
6235 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6236 This means that certain objects should be allocated in shared (pure) space. */);
6238 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
6239 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6240 garbage_collection_messages
= 0;
6242 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
6243 doc
: /* Hook run after garbage collection has finished. */);
6244 Vpost_gc_hook
= Qnil
;
6245 Qpost_gc_hook
= intern ("post-gc-hook");
6246 staticpro (&Qpost_gc_hook
);
6248 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
6249 doc
: /* Precomputed `signal' argument for memory-full error. */);
6250 /* We build this in advance because if we wait until we need it, we might
6251 not be able to allocate the memory to hold it. */
6254 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
6256 DEFVAR_LISP ("memory-full", &Vmemory_full
,
6257 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6258 Vmemory_full
= Qnil
;
6260 staticpro (&Qgc_cons_threshold
);
6261 Qgc_cons_threshold
= intern ("gc-cons-threshold");
6263 staticpro (&Qchar_table_extra_slots
);
6264 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
6266 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
6267 doc
: /* Accumulated time elapsed in garbage collections.
6268 The time is in seconds as a floating point value. */);
6269 DEFVAR_INT ("gcs-done", &gcs_done
,
6270 doc
: /* Accumulated number of garbage collections done. */);
6275 defsubr (&Smake_byte_code
);
6276 defsubr (&Smake_list
);
6277 defsubr (&Smake_vector
);
6278 defsubr (&Smake_char_table
);
6279 defsubr (&Smake_string
);
6280 defsubr (&Smake_bool_vector
);
6281 defsubr (&Smake_symbol
);
6282 defsubr (&Smake_marker
);
6283 defsubr (&Spurecopy
);
6284 defsubr (&Sgarbage_collect
);
6285 defsubr (&Smemory_limit
);
6286 defsubr (&Smemory_use_counts
);
6288 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6289 defsubr (&Sgc_status
);
6293 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
6294 (do not change this comment) */