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, 2006 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_kboards
P_ ((void));
328 extern void mark_backtrace
P_ ((void));
329 static void gc_sweep
P_ ((void));
330 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
331 static void mark_face_cache
P_ ((struct face_cache
*));
333 #ifdef HAVE_WINDOW_SYSTEM
334 extern void mark_fringe_data
P_ ((void));
335 static void mark_image
P_ ((struct image
*));
336 static void mark_image_cache
P_ ((struct frame
*));
337 #endif /* HAVE_WINDOW_SYSTEM */
339 static struct Lisp_String
*allocate_string
P_ ((void));
340 static void compact_small_strings
P_ ((void));
341 static void free_large_strings
P_ ((void));
342 static void sweep_strings
P_ ((void));
344 extern int message_enable_multibyte
;
346 /* When scanning the C stack for live Lisp objects, Emacs keeps track
347 of what memory allocated via lisp_malloc is intended for what
348 purpose. This enumeration specifies the type of memory. */
359 /* Keep the following vector-like types together, with
360 MEM_TYPE_WINDOW being the last, and MEM_TYPE_VECTOR the
361 first. Or change the code of live_vector_p, for instance. */
369 static POINTER_TYPE
*lisp_align_malloc
P_ ((size_t, enum mem_type
));
370 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
371 void refill_memory_reserve ();
374 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
376 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
377 #include <stdio.h> /* For fprintf. */
380 /* A unique object in pure space used to make some Lisp objects
381 on free lists recognizable in O(1). */
385 #ifdef GC_MALLOC_CHECK
387 enum mem_type allocated_mem_type
;
388 int dont_register_blocks
;
390 #endif /* GC_MALLOC_CHECK */
392 /* A node in the red-black tree describing allocated memory containing
393 Lisp data. Each such block is recorded with its start and end
394 address when it is allocated, and removed from the tree when it
397 A red-black tree is a balanced binary tree with the following
400 1. Every node is either red or black.
401 2. Every leaf is black.
402 3. If a node is red, then both of its children are black.
403 4. Every simple path from a node to a descendant leaf contains
404 the same number of black nodes.
405 5. The root is always black.
407 When nodes are inserted into the tree, or deleted from the tree,
408 the tree is "fixed" so that these properties are always true.
410 A red-black tree with N internal nodes has height at most 2
411 log(N+1). Searches, insertions and deletions are done in O(log N).
412 Please see a text book about data structures for a detailed
413 description of red-black trees. Any book worth its salt should
418 /* Children of this node. These pointers are never NULL. When there
419 is no child, the value is MEM_NIL, which points to a dummy node. */
420 struct mem_node
*left
, *right
;
422 /* The parent of this node. In the root node, this is NULL. */
423 struct mem_node
*parent
;
425 /* Start and end of allocated region. */
429 enum {MEM_BLACK
, MEM_RED
} color
;
435 /* Base address of stack. Set in main. */
437 Lisp_Object
*stack_base
;
439 /* Root of the tree describing allocated Lisp memory. */
441 static struct mem_node
*mem_root
;
443 /* Lowest and highest known address in the heap. */
445 static void *min_heap_address
, *max_heap_address
;
447 /* Sentinel node of the tree. */
449 static struct mem_node mem_z
;
450 #define MEM_NIL &mem_z
452 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
453 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
, enum mem_type
));
454 static void lisp_free
P_ ((POINTER_TYPE
*));
455 static void mark_stack
P_ ((void));
456 static int live_vector_p
P_ ((struct mem_node
*, void *));
457 static int live_buffer_p
P_ ((struct mem_node
*, void *));
458 static int live_string_p
P_ ((struct mem_node
*, void *));
459 static int live_cons_p
P_ ((struct mem_node
*, void *));
460 static int live_symbol_p
P_ ((struct mem_node
*, void *));
461 static int live_float_p
P_ ((struct mem_node
*, void *));
462 static int live_misc_p
P_ ((struct mem_node
*, void *));
463 static void mark_maybe_object
P_ ((Lisp_Object
));
464 static void mark_memory
P_ ((void *, void *));
465 static void mem_init
P_ ((void));
466 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
467 static void mem_insert_fixup
P_ ((struct mem_node
*));
468 static void mem_rotate_left
P_ ((struct mem_node
*));
469 static void mem_rotate_right
P_ ((struct mem_node
*));
470 static void mem_delete
P_ ((struct mem_node
*));
471 static void mem_delete_fixup
P_ ((struct mem_node
*));
472 static INLINE
struct mem_node
*mem_find
P_ ((void *));
475 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
476 static void check_gcpros
P_ ((void));
479 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
481 /* Recording what needs to be marked for gc. */
483 struct gcpro
*gcprolist
;
485 /* Addresses of staticpro'd variables. Initialize it to a nonzero
486 value; otherwise some compilers put it into BSS. */
488 #define NSTATICS 1280
489 Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
491 /* Index of next unused slot in staticvec. */
495 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
498 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
499 ALIGNMENT must be a power of 2. */
501 #define ALIGN(ptr, ALIGNMENT) \
502 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
503 & ~((ALIGNMENT) - 1)))
507 /************************************************************************
509 ************************************************************************/
511 /* Function malloc calls this if it finds we are near exhausting storage. */
517 pending_malloc_warning
= str
;
521 /* Display an already-pending malloc warning. */
524 display_malloc_warning ()
526 call3 (intern ("display-warning"),
528 build_string (pending_malloc_warning
),
529 intern ("emergency"));
530 pending_malloc_warning
= 0;
534 #ifdef DOUG_LEA_MALLOC
535 # define BYTES_USED (mallinfo ().uordblks)
537 # define BYTES_USED _bytes_used
540 /* Called if we can't allocate relocatable space for a buffer. */
543 buffer_memory_full ()
545 /* If buffers use the relocating allocator, no need to free
546 spare_memory, because we may have plenty of malloc space left
547 that we could get, and if we don't, the malloc that fails will
548 itself cause spare_memory to be freed. If buffers don't use the
549 relocating allocator, treat this like any other failing
556 /* This used to call error, but if we've run out of memory, we could
557 get infinite recursion trying to build the string. */
559 Fsignal (Qnil
, Vmemory_signal_data
);
563 #ifdef XMALLOC_OVERRUN_CHECK
565 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
566 and a 16 byte trailer around each block.
568 The header consists of 12 fixed bytes + a 4 byte integer contaning the
569 original block size, while the trailer consists of 16 fixed bytes.
571 The header is used to detect whether this block has been allocated
572 through these functions -- as it seems that some low-level libc
573 functions may bypass the malloc hooks.
577 #define XMALLOC_OVERRUN_CHECK_SIZE 16
579 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
580 { 0x9a, 0x9b, 0xae, 0xaf,
581 0xbf, 0xbe, 0xce, 0xcf,
582 0xea, 0xeb, 0xec, 0xed };
584 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
585 { 0xaa, 0xab, 0xac, 0xad,
586 0xba, 0xbb, 0xbc, 0xbd,
587 0xca, 0xcb, 0xcc, 0xcd,
588 0xda, 0xdb, 0xdc, 0xdd };
590 /* Macros to insert and extract the block size in the header. */
592 #define XMALLOC_PUT_SIZE(ptr, size) \
593 (ptr[-1] = (size & 0xff), \
594 ptr[-2] = ((size >> 8) & 0xff), \
595 ptr[-3] = ((size >> 16) & 0xff), \
596 ptr[-4] = ((size >> 24) & 0xff))
598 #define XMALLOC_GET_SIZE(ptr) \
599 (size_t)((unsigned)(ptr[-1]) | \
600 ((unsigned)(ptr[-2]) << 8) | \
601 ((unsigned)(ptr[-3]) << 16) | \
602 ((unsigned)(ptr[-4]) << 24))
605 /* The call depth in overrun_check functions. For example, this might happen:
607 overrun_check_malloc()
608 -> malloc -> (via hook)_-> emacs_blocked_malloc
609 -> overrun_check_malloc
610 call malloc (hooks are NULL, so real malloc is called).
611 malloc returns 10000.
612 add overhead, return 10016.
613 <- (back in overrun_check_malloc)
614 add overhead again, return 10032
615 xmalloc returns 10032.
620 overrun_check_free(10032)
622 free(10016) <- crash, because 10000 is the original pointer. */
624 static int check_depth
;
626 /* Like malloc, but wraps allocated block with header and trailer. */
629 overrun_check_malloc (size
)
632 register unsigned char *val
;
633 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
635 val
= (unsigned char *) malloc (size
+ overhead
);
636 if (val
&& check_depth
== 1)
638 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
639 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
640 XMALLOC_PUT_SIZE(val
, size
);
641 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
644 return (POINTER_TYPE
*)val
;
648 /* Like realloc, but checks old block for overrun, and wraps new block
649 with header and trailer. */
652 overrun_check_realloc (block
, size
)
656 register unsigned char *val
= (unsigned char *)block
;
657 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
661 && bcmp (xmalloc_overrun_check_header
,
662 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
663 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
665 size_t osize
= XMALLOC_GET_SIZE (val
);
666 if (bcmp (xmalloc_overrun_check_trailer
,
668 XMALLOC_OVERRUN_CHECK_SIZE
))
670 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
671 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
672 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
675 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
677 if (val
&& check_depth
== 1)
679 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
680 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
681 XMALLOC_PUT_SIZE(val
, size
);
682 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
685 return (POINTER_TYPE
*)val
;
688 /* Like free, but checks block for overrun. */
691 overrun_check_free (block
)
694 unsigned char *val
= (unsigned char *)block
;
699 && bcmp (xmalloc_overrun_check_header
,
700 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
701 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
703 size_t osize
= XMALLOC_GET_SIZE (val
);
704 if (bcmp (xmalloc_overrun_check_trailer
,
706 XMALLOC_OVERRUN_CHECK_SIZE
))
708 #ifdef XMALLOC_CLEAR_FREE_MEMORY
709 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
710 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
712 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
713 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
714 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
725 #define malloc overrun_check_malloc
726 #define realloc overrun_check_realloc
727 #define free overrun_check_free
731 /* Like malloc but check for no memory and block interrupt input.. */
737 register POINTER_TYPE
*val
;
740 val
= (POINTER_TYPE
*) malloc (size
);
749 /* Like realloc but check for no memory and block interrupt input.. */
752 xrealloc (block
, size
)
756 register POINTER_TYPE
*val
;
759 /* We must call malloc explicitly when BLOCK is 0, since some
760 reallocs don't do this. */
762 val
= (POINTER_TYPE
*) malloc (size
);
764 val
= (POINTER_TYPE
*) realloc (block
, size
);
767 if (!val
&& size
) memory_full ();
772 /* Like free but block interrupt input. */
781 /* We don't call refill_memory_reserve here
782 because that duplicates doing so in emacs_blocked_free
783 and the criterion should go there. */
787 /* Like strdup, but uses xmalloc. */
793 size_t len
= strlen (s
) + 1;
794 char *p
= (char *) xmalloc (len
);
800 /* Unwind for SAFE_ALLOCA */
803 safe_alloca_unwind (arg
)
806 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
816 /* Like malloc but used for allocating Lisp data. NBYTES is the
817 number of bytes to allocate, TYPE describes the intended use of the
818 allcated memory block (for strings, for conses, ...). */
821 static void *lisp_malloc_loser
;
824 static POINTER_TYPE
*
825 lisp_malloc (nbytes
, type
)
833 #ifdef GC_MALLOC_CHECK
834 allocated_mem_type
= type
;
837 val
= (void *) malloc (nbytes
);
840 /* If the memory just allocated cannot be addressed thru a Lisp
841 object's pointer, and it needs to be,
842 that's equivalent to running out of memory. */
843 if (val
&& type
!= MEM_TYPE_NON_LISP
)
846 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
847 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
849 lisp_malloc_loser
= val
;
856 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
857 if (val
&& type
!= MEM_TYPE_NON_LISP
)
858 mem_insert (val
, (char *) val
+ nbytes
, type
);
867 /* Free BLOCK. This must be called to free memory allocated with a
868 call to lisp_malloc. */
876 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
877 mem_delete (mem_find (block
));
882 /* Allocation of aligned blocks of memory to store Lisp data. */
883 /* The entry point is lisp_align_malloc which returns blocks of at most */
884 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
886 /* Use posix_memalloc if the system has it and we're using the system's
887 malloc (because our gmalloc.c routines don't have posix_memalign although
888 its memalloc could be used). */
889 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
890 #define USE_POSIX_MEMALIGN 1
893 /* BLOCK_ALIGN has to be a power of 2. */
894 #define BLOCK_ALIGN (1 << 10)
896 /* Padding to leave at the end of a malloc'd block. This is to give
897 malloc a chance to minimize the amount of memory wasted to alignment.
898 It should be tuned to the particular malloc library used.
899 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
900 posix_memalign on the other hand would ideally prefer a value of 4
901 because otherwise, there's 1020 bytes wasted between each ablocks.
902 In Emacs, testing shows that those 1020 can most of the time be
903 efficiently used by malloc to place other objects, so a value of 0 can
904 still preferable unless you have a lot of aligned blocks and virtually
906 #define BLOCK_PADDING 0
907 #define BLOCK_BYTES \
908 (BLOCK_ALIGN - sizeof (struct ablock *) - BLOCK_PADDING)
910 /* Internal data structures and constants. */
912 #define ABLOCKS_SIZE 16
914 /* An aligned block of memory. */
919 char payload
[BLOCK_BYTES
];
920 struct ablock
*next_free
;
922 /* `abase' is the aligned base of the ablocks. */
923 /* It is overloaded to hold the virtual `busy' field that counts
924 the number of used ablock in the parent ablocks.
925 The first ablock has the `busy' field, the others have the `abase'
926 field. To tell the difference, we assume that pointers will have
927 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
928 is used to tell whether the real base of the parent ablocks is `abase'
929 (if not, the word before the first ablock holds a pointer to the
931 struct ablocks
*abase
;
932 /* The padding of all but the last ablock is unused. The padding of
933 the last ablock in an ablocks is not allocated. */
935 char padding
[BLOCK_PADDING
];
939 /* A bunch of consecutive aligned blocks. */
942 struct ablock blocks
[ABLOCKS_SIZE
];
945 /* Size of the block requested from malloc or memalign. */
946 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
948 #define ABLOCK_ABASE(block) \
949 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
950 ? (struct ablocks *)(block) \
953 /* Virtual `busy' field. */
954 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
956 /* Pointer to the (not necessarily aligned) malloc block. */
957 #ifdef USE_POSIX_MEMALIGN
958 #define ABLOCKS_BASE(abase) (abase)
960 #define ABLOCKS_BASE(abase) \
961 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
964 /* The list of free ablock. */
965 static struct ablock
*free_ablock
;
967 /* Allocate an aligned block of nbytes.
968 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
969 smaller or equal to BLOCK_BYTES. */
970 static POINTER_TYPE
*
971 lisp_align_malloc (nbytes
, type
)
976 struct ablocks
*abase
;
978 eassert (nbytes
<= BLOCK_BYTES
);
982 #ifdef GC_MALLOC_CHECK
983 allocated_mem_type
= type
;
989 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
991 #ifdef DOUG_LEA_MALLOC
992 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
993 because mapped region contents are not preserved in
995 mallopt (M_MMAP_MAX
, 0);
998 #ifdef USE_POSIX_MEMALIGN
1000 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1006 base
= malloc (ABLOCKS_BYTES
);
1007 abase
= ALIGN (base
, BLOCK_ALIGN
);
1016 aligned
= (base
== abase
);
1018 ((void**)abase
)[-1] = base
;
1020 #ifdef DOUG_LEA_MALLOC
1021 /* Back to a reasonable maximum of mmap'ed areas. */
1022 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1026 /* If the memory just allocated cannot be addressed thru a Lisp
1027 object's pointer, and it needs to be, that's equivalent to
1028 running out of memory. */
1029 if (type
!= MEM_TYPE_NON_LISP
)
1032 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1033 XSETCONS (tem
, end
);
1034 if ((char *) XCONS (tem
) != end
)
1036 lisp_malloc_loser
= base
;
1044 /* Initialize the blocks and put them on the free list.
1045 Is `base' was not properly aligned, we can't use the last block. */
1046 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1048 abase
->blocks
[i
].abase
= abase
;
1049 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1050 free_ablock
= &abase
->blocks
[i
];
1052 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
1054 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
1055 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1056 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1057 eassert (ABLOCKS_BASE (abase
) == base
);
1058 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
1061 abase
= ABLOCK_ABASE (free_ablock
);
1062 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
1064 free_ablock
= free_ablock
->x
.next_free
;
1066 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1067 if (val
&& type
!= MEM_TYPE_NON_LISP
)
1068 mem_insert (val
, (char *) val
+ nbytes
, type
);
1075 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
1080 lisp_align_free (block
)
1081 POINTER_TYPE
*block
;
1083 struct ablock
*ablock
= block
;
1084 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1087 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1088 mem_delete (mem_find (block
));
1090 /* Put on free list. */
1091 ablock
->x
.next_free
= free_ablock
;
1092 free_ablock
= ablock
;
1093 /* Update busy count. */
1094 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
1096 if (2 > (long) ABLOCKS_BUSY (abase
))
1097 { /* All the blocks are free. */
1098 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
1099 struct ablock
**tem
= &free_ablock
;
1100 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1104 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1107 *tem
= (*tem
)->x
.next_free
;
1110 tem
= &(*tem
)->x
.next_free
;
1112 eassert ((aligned
& 1) == aligned
);
1113 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1114 #ifdef USE_POSIX_MEMALIGN
1115 eassert ((unsigned long)ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1117 free (ABLOCKS_BASE (abase
));
1122 /* Return a new buffer structure allocated from the heap with
1123 a call to lisp_malloc. */
1129 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1135 #ifndef SYSTEM_MALLOC
1137 /* Arranging to disable input signals while we're in malloc.
1139 This only works with GNU malloc. To help out systems which can't
1140 use GNU malloc, all the calls to malloc, realloc, and free
1141 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1142 pair; unfortunately, we have no idea what C library functions
1143 might call malloc, so we can't really protect them unless you're
1144 using GNU malloc. Fortunately, most of the major operating systems
1145 can use GNU malloc. */
1149 #ifndef DOUG_LEA_MALLOC
1150 extern void * (*__malloc_hook
) P_ ((size_t, const void *));
1151 extern void * (*__realloc_hook
) P_ ((void *, size_t, const void *));
1152 extern void (*__free_hook
) P_ ((void *, const void *));
1153 /* Else declared in malloc.h, perhaps with an extra arg. */
1154 #endif /* DOUG_LEA_MALLOC */
1155 static void * (*old_malloc_hook
) P_ ((size_t, const void *));
1156 static void * (*old_realloc_hook
) P_ ((void *, size_t, const void*));
1157 static void (*old_free_hook
) P_ ((void*, const void*));
1159 /* This function is used as the hook for free to call. */
1162 emacs_blocked_free (ptr
, ptr2
)
1166 EMACS_INT bytes_used_now
;
1170 #ifdef GC_MALLOC_CHECK
1176 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1179 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1184 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1188 #endif /* GC_MALLOC_CHECK */
1190 __free_hook
= old_free_hook
;
1193 /* If we released our reserve (due to running out of memory),
1194 and we have a fair amount free once again,
1195 try to set aside another reserve in case we run out once more. */
1196 if (! NILP (Vmemory_full
)
1197 /* Verify there is enough space that even with the malloc
1198 hysteresis this call won't run out again.
1199 The code here is correct as long as SPARE_MEMORY
1200 is substantially larger than the block size malloc uses. */
1201 && (bytes_used_when_full
1202 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1203 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1204 refill_memory_reserve ();
1206 __free_hook
= emacs_blocked_free
;
1207 UNBLOCK_INPUT_ALLOC
;
1211 /* This function is the malloc hook that Emacs uses. */
1214 emacs_blocked_malloc (size
, ptr
)
1221 __malloc_hook
= old_malloc_hook
;
1222 #ifdef DOUG_LEA_MALLOC
1223 mallopt (M_TOP_PAD
, malloc_hysteresis
* 4096);
1225 __malloc_extra_blocks
= malloc_hysteresis
;
1228 value
= (void *) malloc (size
);
1230 #ifdef GC_MALLOC_CHECK
1232 struct mem_node
*m
= mem_find (value
);
1235 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1237 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1238 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1243 if (!dont_register_blocks
)
1245 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1246 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1249 #endif /* GC_MALLOC_CHECK */
1251 __malloc_hook
= emacs_blocked_malloc
;
1252 UNBLOCK_INPUT_ALLOC
;
1254 /* fprintf (stderr, "%p malloc\n", value); */
1259 /* This function is the realloc hook that Emacs uses. */
1262 emacs_blocked_realloc (ptr
, size
, ptr2
)
1270 __realloc_hook
= old_realloc_hook
;
1272 #ifdef GC_MALLOC_CHECK
1275 struct mem_node
*m
= mem_find (ptr
);
1276 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1279 "Realloc of %p which wasn't allocated with malloc\n",
1287 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1289 /* Prevent malloc from registering blocks. */
1290 dont_register_blocks
= 1;
1291 #endif /* GC_MALLOC_CHECK */
1293 value
= (void *) realloc (ptr
, size
);
1295 #ifdef GC_MALLOC_CHECK
1296 dont_register_blocks
= 0;
1299 struct mem_node
*m
= mem_find (value
);
1302 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1306 /* Can't handle zero size regions in the red-black tree. */
1307 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1310 /* fprintf (stderr, "%p <- realloc\n", value); */
1311 #endif /* GC_MALLOC_CHECK */
1313 __realloc_hook
= emacs_blocked_realloc
;
1314 UNBLOCK_INPUT_ALLOC
;
1320 #ifdef HAVE_GTK_AND_PTHREAD
1321 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1322 normal malloc. Some thread implementations need this as they call
1323 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1324 calls malloc because it is the first call, and we have an endless loop. */
1327 reset_malloc_hooks ()
1333 #endif /* HAVE_GTK_AND_PTHREAD */
1336 /* Called from main to set up malloc to use our hooks. */
1339 uninterrupt_malloc ()
1341 #ifdef HAVE_GTK_AND_PTHREAD
1342 pthread_mutexattr_t attr
;
1344 /* GLIBC has a faster way to do this, but lets keep it portable.
1345 This is according to the Single UNIX Specification. */
1346 pthread_mutexattr_init (&attr
);
1347 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1348 pthread_mutex_init (&alloc_mutex
, &attr
);
1349 #endif /* HAVE_GTK_AND_PTHREAD */
1351 if (__free_hook
!= emacs_blocked_free
)
1352 old_free_hook
= __free_hook
;
1353 __free_hook
= emacs_blocked_free
;
1355 if (__malloc_hook
!= emacs_blocked_malloc
)
1356 old_malloc_hook
= __malloc_hook
;
1357 __malloc_hook
= emacs_blocked_malloc
;
1359 if (__realloc_hook
!= emacs_blocked_realloc
)
1360 old_realloc_hook
= __realloc_hook
;
1361 __realloc_hook
= emacs_blocked_realloc
;
1364 #endif /* not SYNC_INPUT */
1365 #endif /* not SYSTEM_MALLOC */
1369 /***********************************************************************
1371 ***********************************************************************/
1373 /* Number of intervals allocated in an interval_block structure.
1374 The 1020 is 1024 minus malloc overhead. */
1376 #define INTERVAL_BLOCK_SIZE \
1377 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1379 /* Intervals are allocated in chunks in form of an interval_block
1382 struct interval_block
1384 /* Place `intervals' first, to preserve alignment. */
1385 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1386 struct interval_block
*next
;
1389 /* Current interval block. Its `next' pointer points to older
1392 struct interval_block
*interval_block
;
1394 /* Index in interval_block above of the next unused interval
1397 static int interval_block_index
;
1399 /* Number of free and live intervals. */
1401 static int total_free_intervals
, total_intervals
;
1403 /* List of free intervals. */
1405 INTERVAL interval_free_list
;
1407 /* Total number of interval blocks now in use. */
1409 int n_interval_blocks
;
1412 /* Initialize interval allocation. */
1417 interval_block
= NULL
;
1418 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1419 interval_free_list
= 0;
1420 n_interval_blocks
= 0;
1424 /* Return a new interval. */
1431 /* eassert (!handling_signal); */
1437 if (interval_free_list
)
1439 val
= interval_free_list
;
1440 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1444 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1446 register struct interval_block
*newi
;
1448 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1451 newi
->next
= interval_block
;
1452 interval_block
= newi
;
1453 interval_block_index
= 0;
1454 n_interval_blocks
++;
1456 val
= &interval_block
->intervals
[interval_block_index
++];
1463 consing_since_gc
+= sizeof (struct interval
);
1465 RESET_INTERVAL (val
);
1471 /* Mark Lisp objects in interval I. */
1474 mark_interval (i
, dummy
)
1475 register INTERVAL i
;
1478 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1480 mark_object (i
->plist
);
1484 /* Mark the interval tree rooted in TREE. Don't call this directly;
1485 use the macro MARK_INTERVAL_TREE instead. */
1488 mark_interval_tree (tree
)
1489 register INTERVAL tree
;
1491 /* No need to test if this tree has been marked already; this
1492 function is always called through the MARK_INTERVAL_TREE macro,
1493 which takes care of that. */
1495 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1499 /* Mark the interval tree rooted in I. */
1501 #define MARK_INTERVAL_TREE(i) \
1503 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1504 mark_interval_tree (i); \
1508 #define UNMARK_BALANCE_INTERVALS(i) \
1510 if (! NULL_INTERVAL_P (i)) \
1511 (i) = balance_intervals (i); \
1515 /* Number support. If NO_UNION_TYPE isn't in effect, we
1516 can't create number objects in macros. */
1524 obj
.s
.type
= Lisp_Int
;
1529 /***********************************************************************
1531 ***********************************************************************/
1533 /* Lisp_Strings are allocated in string_block structures. When a new
1534 string_block is allocated, all the Lisp_Strings it contains are
1535 added to a free-list string_free_list. When a new Lisp_String is
1536 needed, it is taken from that list. During the sweep phase of GC,
1537 string_blocks that are entirely free are freed, except two which
1540 String data is allocated from sblock structures. Strings larger
1541 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1542 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1544 Sblocks consist internally of sdata structures, one for each
1545 Lisp_String. The sdata structure points to the Lisp_String it
1546 belongs to. The Lisp_String points back to the `u.data' member of
1547 its sdata structure.
1549 When a Lisp_String is freed during GC, it is put back on
1550 string_free_list, and its `data' member and its sdata's `string'
1551 pointer is set to null. The size of the string is recorded in the
1552 `u.nbytes' member of the sdata. So, sdata structures that are no
1553 longer used, can be easily recognized, and it's easy to compact the
1554 sblocks of small strings which we do in compact_small_strings. */
1556 /* Size in bytes of an sblock structure used for small strings. This
1557 is 8192 minus malloc overhead. */
1559 #define SBLOCK_SIZE 8188
1561 /* Strings larger than this are considered large strings. String data
1562 for large strings is allocated from individual sblocks. */
1564 #define LARGE_STRING_BYTES 1024
1566 /* Structure describing string memory sub-allocated from an sblock.
1567 This is where the contents of Lisp strings are stored. */
1571 /* Back-pointer to the string this sdata belongs to. If null, this
1572 structure is free, and the NBYTES member of the union below
1573 contains the string's byte size (the same value that STRING_BYTES
1574 would return if STRING were non-null). If non-null, STRING_BYTES
1575 (STRING) is the size of the data, and DATA contains the string's
1577 struct Lisp_String
*string
;
1579 #ifdef GC_CHECK_STRING_BYTES
1582 unsigned char data
[1];
1584 #define SDATA_NBYTES(S) (S)->nbytes
1585 #define SDATA_DATA(S) (S)->data
1587 #else /* not GC_CHECK_STRING_BYTES */
1591 /* When STRING in non-null. */
1592 unsigned char data
[1];
1594 /* When STRING is null. */
1599 #define SDATA_NBYTES(S) (S)->u.nbytes
1600 #define SDATA_DATA(S) (S)->u.data
1602 #endif /* not GC_CHECK_STRING_BYTES */
1606 /* Structure describing a block of memory which is sub-allocated to
1607 obtain string data memory for strings. Blocks for small strings
1608 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1609 as large as needed. */
1614 struct sblock
*next
;
1616 /* Pointer to the next free sdata block. This points past the end
1617 of the sblock if there isn't any space left in this block. */
1618 struct sdata
*next_free
;
1620 /* Start of data. */
1621 struct sdata first_data
;
1624 /* Number of Lisp strings in a string_block structure. The 1020 is
1625 1024 minus malloc overhead. */
1627 #define STRING_BLOCK_SIZE \
1628 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1630 /* Structure describing a block from which Lisp_String structures
1635 /* Place `strings' first, to preserve alignment. */
1636 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1637 struct string_block
*next
;
1640 /* Head and tail of the list of sblock structures holding Lisp string
1641 data. We always allocate from current_sblock. The NEXT pointers
1642 in the sblock structures go from oldest_sblock to current_sblock. */
1644 static struct sblock
*oldest_sblock
, *current_sblock
;
1646 /* List of sblocks for large strings. */
1648 static struct sblock
*large_sblocks
;
1650 /* List of string_block structures, and how many there are. */
1652 static struct string_block
*string_blocks
;
1653 static int n_string_blocks
;
1655 /* Free-list of Lisp_Strings. */
1657 static struct Lisp_String
*string_free_list
;
1659 /* Number of live and free Lisp_Strings. */
1661 static int total_strings
, total_free_strings
;
1663 /* Number of bytes used by live strings. */
1665 static int total_string_size
;
1667 /* Given a pointer to a Lisp_String S which is on the free-list
1668 string_free_list, return a pointer to its successor in the
1671 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1673 /* Return a pointer to the sdata structure belonging to Lisp string S.
1674 S must be live, i.e. S->data must not be null. S->data is actually
1675 a pointer to the `u.data' member of its sdata structure; the
1676 structure starts at a constant offset in front of that. */
1678 #ifdef GC_CHECK_STRING_BYTES
1680 #define SDATA_OF_STRING(S) \
1681 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1682 - sizeof (EMACS_INT)))
1684 #else /* not GC_CHECK_STRING_BYTES */
1686 #define SDATA_OF_STRING(S) \
1687 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1689 #endif /* not GC_CHECK_STRING_BYTES */
1692 #ifdef GC_CHECK_STRING_OVERRUN
1694 /* We check for overrun in string data blocks by appending a small
1695 "cookie" after each allocated string data block, and check for the
1696 presence of this cookie during GC. */
1698 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1699 static char string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1700 { 0xde, 0xad, 0xbe, 0xef };
1703 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1706 /* Value is the size of an sdata structure large enough to hold NBYTES
1707 bytes of string data. The value returned includes a terminating
1708 NUL byte, the size of the sdata structure, and padding. */
1710 #ifdef GC_CHECK_STRING_BYTES
1712 #define SDATA_SIZE(NBYTES) \
1713 ((sizeof (struct Lisp_String *) \
1715 + sizeof (EMACS_INT) \
1716 + sizeof (EMACS_INT) - 1) \
1717 & ~(sizeof (EMACS_INT) - 1))
1719 #else /* not GC_CHECK_STRING_BYTES */
1721 #define SDATA_SIZE(NBYTES) \
1722 ((sizeof (struct Lisp_String *) \
1724 + sizeof (EMACS_INT) - 1) \
1725 & ~(sizeof (EMACS_INT) - 1))
1727 #endif /* not GC_CHECK_STRING_BYTES */
1729 /* Extra bytes to allocate for each string. */
1731 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1733 /* Initialize string allocation. Called from init_alloc_once. */
1738 total_strings
= total_free_strings
= total_string_size
= 0;
1739 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1740 string_blocks
= NULL
;
1741 n_string_blocks
= 0;
1742 string_free_list
= NULL
;
1746 #ifdef GC_CHECK_STRING_BYTES
1748 static int check_string_bytes_count
;
1750 void check_string_bytes
P_ ((int));
1751 void check_sblock
P_ ((struct sblock
*));
1753 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1756 /* Like GC_STRING_BYTES, but with debugging check. */
1760 struct Lisp_String
*s
;
1762 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1763 if (!PURE_POINTER_P (s
)
1765 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1770 /* Check validity of Lisp strings' string_bytes member in B. */
1776 struct sdata
*from
, *end
, *from_end
;
1780 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1782 /* Compute the next FROM here because copying below may
1783 overwrite data we need to compute it. */
1786 /* Check that the string size recorded in the string is the
1787 same as the one recorded in the sdata structure. */
1789 CHECK_STRING_BYTES (from
->string
);
1792 nbytes
= GC_STRING_BYTES (from
->string
);
1794 nbytes
= SDATA_NBYTES (from
);
1796 nbytes
= SDATA_SIZE (nbytes
);
1797 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1802 /* Check validity of Lisp strings' string_bytes member. ALL_P
1803 non-zero means check all strings, otherwise check only most
1804 recently allocated strings. Used for hunting a bug. */
1807 check_string_bytes (all_p
)
1814 for (b
= large_sblocks
; b
; b
= b
->next
)
1816 struct Lisp_String
*s
= b
->first_data
.string
;
1818 CHECK_STRING_BYTES (s
);
1821 for (b
= oldest_sblock
; b
; b
= b
->next
)
1825 check_sblock (current_sblock
);
1828 #endif /* GC_CHECK_STRING_BYTES */
1830 #ifdef GC_CHECK_STRING_FREE_LIST
1832 /* Walk through the string free list looking for bogus next pointers.
1833 This may catch buffer overrun from a previous string. */
1836 check_string_free_list ()
1838 struct Lisp_String
*s
;
1840 /* Pop a Lisp_String off the free-list. */
1841 s
= string_free_list
;
1844 if ((unsigned)s
< 1024)
1846 s
= NEXT_FREE_LISP_STRING (s
);
1850 #define check_string_free_list()
1853 /* Return a new Lisp_String. */
1855 static struct Lisp_String
*
1858 struct Lisp_String
*s
;
1860 /* eassert (!handling_signal); */
1866 /* If the free-list is empty, allocate a new string_block, and
1867 add all the Lisp_Strings in it to the free-list. */
1868 if (string_free_list
== NULL
)
1870 struct string_block
*b
;
1873 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1874 bzero (b
, sizeof *b
);
1875 b
->next
= string_blocks
;
1879 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1882 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1883 string_free_list
= s
;
1886 total_free_strings
+= STRING_BLOCK_SIZE
;
1889 check_string_free_list ();
1891 /* Pop a Lisp_String off the free-list. */
1892 s
= string_free_list
;
1893 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1899 /* Probably not strictly necessary, but play it safe. */
1900 bzero (s
, sizeof *s
);
1902 --total_free_strings
;
1905 consing_since_gc
+= sizeof *s
;
1907 #ifdef GC_CHECK_STRING_BYTES
1914 if (++check_string_bytes_count
== 200)
1916 check_string_bytes_count
= 0;
1917 check_string_bytes (1);
1920 check_string_bytes (0);
1922 #endif /* GC_CHECK_STRING_BYTES */
1928 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1929 plus a NUL byte at the end. Allocate an sdata structure for S, and
1930 set S->data to its `u.data' member. Store a NUL byte at the end of
1931 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1932 S->data if it was initially non-null. */
1935 allocate_string_data (s
, nchars
, nbytes
)
1936 struct Lisp_String
*s
;
1939 struct sdata
*data
, *old_data
;
1941 int needed
, old_nbytes
;
1943 /* Determine the number of bytes needed to store NBYTES bytes
1945 needed
= SDATA_SIZE (nbytes
);
1946 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1947 old_nbytes
= GC_STRING_BYTES (s
);
1953 if (nbytes
> LARGE_STRING_BYTES
)
1955 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1957 #ifdef DOUG_LEA_MALLOC
1958 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1959 because mapped region contents are not preserved in
1962 In case you think of allowing it in a dumped Emacs at the
1963 cost of not being able to re-dump, there's another reason:
1964 mmap'ed data typically have an address towards the top of the
1965 address space, which won't fit into an EMACS_INT (at least on
1966 32-bit systems with the current tagging scheme). --fx */
1968 mallopt (M_MMAP_MAX
, 0);
1972 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1974 #ifdef DOUG_LEA_MALLOC
1975 /* Back to a reasonable maximum of mmap'ed areas. */
1977 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1981 b
->next_free
= &b
->first_data
;
1982 b
->first_data
.string
= NULL
;
1983 b
->next
= large_sblocks
;
1986 else if (current_sblock
== NULL
1987 || (((char *) current_sblock
+ SBLOCK_SIZE
1988 - (char *) current_sblock
->next_free
)
1989 < (needed
+ GC_STRING_EXTRA
)))
1991 /* Not enough room in the current sblock. */
1992 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1993 b
->next_free
= &b
->first_data
;
1994 b
->first_data
.string
= NULL
;
1998 current_sblock
->next
= b
;
2006 data
= b
->next_free
;
2007 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
2014 s
->data
= SDATA_DATA (data
);
2015 #ifdef GC_CHECK_STRING_BYTES
2016 SDATA_NBYTES (data
) = nbytes
;
2019 s
->size_byte
= nbytes
;
2020 s
->data
[nbytes
] = '\0';
2021 #ifdef GC_CHECK_STRING_OVERRUN
2022 bcopy (string_overrun_cookie
, (char *) data
+ needed
,
2023 GC_STRING_OVERRUN_COOKIE_SIZE
);
2026 /* If S had already data assigned, mark that as free by setting its
2027 string back-pointer to null, and recording the size of the data
2031 SDATA_NBYTES (old_data
) = old_nbytes
;
2032 old_data
->string
= NULL
;
2035 consing_since_gc
+= needed
;
2039 /* Sweep and compact strings. */
2044 struct string_block
*b
, *next
;
2045 struct string_block
*live_blocks
= NULL
;
2047 string_free_list
= NULL
;
2048 total_strings
= total_free_strings
= 0;
2049 total_string_size
= 0;
2051 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2052 for (b
= string_blocks
; b
; b
= next
)
2055 struct Lisp_String
*free_list_before
= string_free_list
;
2059 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2061 struct Lisp_String
*s
= b
->strings
+ i
;
2065 /* String was not on free-list before. */
2066 if (STRING_MARKED_P (s
))
2068 /* String is live; unmark it and its intervals. */
2071 if (!NULL_INTERVAL_P (s
->intervals
))
2072 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2075 total_string_size
+= STRING_BYTES (s
);
2079 /* String is dead. Put it on the free-list. */
2080 struct sdata
*data
= SDATA_OF_STRING (s
);
2082 /* Save the size of S in its sdata so that we know
2083 how large that is. Reset the sdata's string
2084 back-pointer so that we know it's free. */
2085 #ifdef GC_CHECK_STRING_BYTES
2086 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2089 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2091 data
->string
= NULL
;
2093 /* Reset the strings's `data' member so that we
2097 /* Put the string on the free-list. */
2098 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2099 string_free_list
= s
;
2105 /* S was on the free-list before. Put it there again. */
2106 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2107 string_free_list
= s
;
2112 /* Free blocks that contain free Lisp_Strings only, except
2113 the first two of them. */
2114 if (nfree
== STRING_BLOCK_SIZE
2115 && total_free_strings
> STRING_BLOCK_SIZE
)
2119 string_free_list
= free_list_before
;
2123 total_free_strings
+= nfree
;
2124 b
->next
= live_blocks
;
2129 check_string_free_list ();
2131 string_blocks
= live_blocks
;
2132 free_large_strings ();
2133 compact_small_strings ();
2135 check_string_free_list ();
2139 /* Free dead large strings. */
2142 free_large_strings ()
2144 struct sblock
*b
, *next
;
2145 struct sblock
*live_blocks
= NULL
;
2147 for (b
= large_sblocks
; b
; b
= next
)
2151 if (b
->first_data
.string
== NULL
)
2155 b
->next
= live_blocks
;
2160 large_sblocks
= live_blocks
;
2164 /* Compact data of small strings. Free sblocks that don't contain
2165 data of live strings after compaction. */
2168 compact_small_strings ()
2170 struct sblock
*b
, *tb
, *next
;
2171 struct sdata
*from
, *to
, *end
, *tb_end
;
2172 struct sdata
*to_end
, *from_end
;
2174 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2175 to, and TB_END is the end of TB. */
2177 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2178 to
= &tb
->first_data
;
2180 /* Step through the blocks from the oldest to the youngest. We
2181 expect that old blocks will stabilize over time, so that less
2182 copying will happen this way. */
2183 for (b
= oldest_sblock
; b
; b
= b
->next
)
2186 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2188 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2190 /* Compute the next FROM here because copying below may
2191 overwrite data we need to compute it. */
2194 #ifdef GC_CHECK_STRING_BYTES
2195 /* Check that the string size recorded in the string is the
2196 same as the one recorded in the sdata structure. */
2198 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2200 #endif /* GC_CHECK_STRING_BYTES */
2203 nbytes
= GC_STRING_BYTES (from
->string
);
2205 nbytes
= SDATA_NBYTES (from
);
2207 if (nbytes
> LARGE_STRING_BYTES
)
2210 nbytes
= SDATA_SIZE (nbytes
);
2211 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2213 #ifdef GC_CHECK_STRING_OVERRUN
2214 if (bcmp (string_overrun_cookie
,
2215 ((char *) from_end
) - GC_STRING_OVERRUN_COOKIE_SIZE
,
2216 GC_STRING_OVERRUN_COOKIE_SIZE
))
2220 /* FROM->string non-null means it's alive. Copy its data. */
2223 /* If TB is full, proceed with the next sblock. */
2224 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2225 if (to_end
> tb_end
)
2229 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2230 to
= &tb
->first_data
;
2231 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2234 /* Copy, and update the string's `data' pointer. */
2237 xassert (tb
!= b
|| to
<= from
);
2238 safe_bcopy ((char *) from
, (char *) to
, nbytes
+ GC_STRING_EXTRA
);
2239 to
->string
->data
= SDATA_DATA (to
);
2242 /* Advance past the sdata we copied to. */
2248 /* The rest of the sblocks following TB don't contain live data, so
2249 we can free them. */
2250 for (b
= tb
->next
; b
; b
= next
)
2258 current_sblock
= tb
;
2262 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2263 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2264 LENGTH must be an integer.
2265 INIT must be an integer that represents a character. */)
2267 Lisp_Object length
, init
;
2269 register Lisp_Object val
;
2270 register unsigned char *p
, *end
;
2273 CHECK_NATNUM (length
);
2274 CHECK_NUMBER (init
);
2277 if (SINGLE_BYTE_CHAR_P (c
))
2279 nbytes
= XINT (length
);
2280 val
= make_uninit_string (nbytes
);
2282 end
= p
+ SCHARS (val
);
2288 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2289 int len
= CHAR_STRING (c
, str
);
2291 nbytes
= len
* XINT (length
);
2292 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
2297 bcopy (str
, p
, len
);
2307 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2308 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2309 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2311 Lisp_Object length
, init
;
2313 register Lisp_Object val
;
2314 struct Lisp_Bool_Vector
*p
;
2316 int length_in_chars
, length_in_elts
, bits_per_value
;
2318 CHECK_NATNUM (length
);
2320 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2322 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2323 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2324 / BOOL_VECTOR_BITS_PER_CHAR
);
2326 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2327 slot `size' of the struct Lisp_Bool_Vector. */
2328 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2329 p
= XBOOL_VECTOR (val
);
2331 /* Get rid of any bits that would cause confusion. */
2333 XSETBOOL_VECTOR (val
, p
);
2334 p
->size
= XFASTINT (length
);
2336 real_init
= (NILP (init
) ? 0 : -1);
2337 for (i
= 0; i
< length_in_chars
; i
++)
2338 p
->data
[i
] = real_init
;
2340 /* Clear the extraneous bits in the last byte. */
2341 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2342 XBOOL_VECTOR (val
)->data
[length_in_chars
- 1]
2343 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2349 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2350 of characters from the contents. This string may be unibyte or
2351 multibyte, depending on the contents. */
2354 make_string (contents
, nbytes
)
2355 const char *contents
;
2358 register Lisp_Object val
;
2359 int nchars
, multibyte_nbytes
;
2361 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
2362 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2363 /* CONTENTS contains no multibyte sequences or contains an invalid
2364 multibyte sequence. We must make unibyte string. */
2365 val
= make_unibyte_string (contents
, nbytes
);
2367 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2372 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2375 make_unibyte_string (contents
, length
)
2376 const char *contents
;
2379 register Lisp_Object val
;
2380 val
= make_uninit_string (length
);
2381 bcopy (contents
, SDATA (val
), length
);
2382 STRING_SET_UNIBYTE (val
);
2387 /* Make a multibyte string from NCHARS characters occupying NBYTES
2388 bytes at CONTENTS. */
2391 make_multibyte_string (contents
, nchars
, nbytes
)
2392 const char *contents
;
2395 register Lisp_Object val
;
2396 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2397 bcopy (contents
, SDATA (val
), nbytes
);
2402 /* Make a string from NCHARS characters occupying NBYTES bytes at
2403 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2406 make_string_from_bytes (contents
, nchars
, nbytes
)
2407 const char *contents
;
2410 register Lisp_Object val
;
2411 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2412 bcopy (contents
, SDATA (val
), nbytes
);
2413 if (SBYTES (val
) == SCHARS (val
))
2414 STRING_SET_UNIBYTE (val
);
2419 /* Make a string from NCHARS characters occupying NBYTES bytes at
2420 CONTENTS. The argument MULTIBYTE controls whether to label the
2421 string as multibyte. If NCHARS is negative, it counts the number of
2422 characters by itself. */
2425 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2426 const char *contents
;
2430 register Lisp_Object val
;
2435 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2439 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2440 bcopy (contents
, SDATA (val
), nbytes
);
2442 STRING_SET_UNIBYTE (val
);
2447 /* Make a string from the data at STR, treating it as multibyte if the
2454 return make_string (str
, strlen (str
));
2458 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2459 occupying LENGTH bytes. */
2462 make_uninit_string (length
)
2466 val
= make_uninit_multibyte_string (length
, length
);
2467 STRING_SET_UNIBYTE (val
);
2472 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2473 which occupy NBYTES bytes. */
2476 make_uninit_multibyte_string (nchars
, nbytes
)
2480 struct Lisp_String
*s
;
2485 s
= allocate_string ();
2486 allocate_string_data (s
, nchars
, nbytes
);
2487 XSETSTRING (string
, s
);
2488 string_chars_consed
+= nbytes
;
2494 /***********************************************************************
2496 ***********************************************************************/
2498 /* We store float cells inside of float_blocks, allocating a new
2499 float_block with malloc whenever necessary. Float cells reclaimed
2500 by GC are put on a free list to be reallocated before allocating
2501 any new float cells from the latest float_block. */
2503 #define FLOAT_BLOCK_SIZE \
2504 (((BLOCK_BYTES - sizeof (struct float_block *) \
2505 /* The compiler might add padding at the end. */ \
2506 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2507 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2509 #define GETMARKBIT(block,n) \
2510 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2511 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2514 #define SETMARKBIT(block,n) \
2515 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2516 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2518 #define UNSETMARKBIT(block,n) \
2519 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2520 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2522 #define FLOAT_BLOCK(fptr) \
2523 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2525 #define FLOAT_INDEX(fptr) \
2526 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2530 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2531 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2532 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2533 struct float_block
*next
;
2536 #define FLOAT_MARKED_P(fptr) \
2537 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2539 #define FLOAT_MARK(fptr) \
2540 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2542 #define FLOAT_UNMARK(fptr) \
2543 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2545 /* Current float_block. */
2547 struct float_block
*float_block
;
2549 /* Index of first unused Lisp_Float in the current float_block. */
2551 int float_block_index
;
2553 /* Total number of float blocks now in use. */
2557 /* Free-list of Lisp_Floats. */
2559 struct Lisp_Float
*float_free_list
;
2562 /* Initialize float allocation. */
2568 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2569 float_free_list
= 0;
2574 /* Explicitly free a float cell by putting it on the free-list. */
2578 struct Lisp_Float
*ptr
;
2580 ptr
->u
.chain
= float_free_list
;
2581 float_free_list
= ptr
;
2585 /* Return a new float object with value FLOAT_VALUE. */
2588 make_float (float_value
)
2591 register Lisp_Object val
;
2593 /* eassert (!handling_signal); */
2599 if (float_free_list
)
2601 /* We use the data field for chaining the free list
2602 so that we won't use the same field that has the mark bit. */
2603 XSETFLOAT (val
, float_free_list
);
2604 float_free_list
= float_free_list
->u
.chain
;
2608 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2610 register struct float_block
*new;
2612 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2614 new->next
= float_block
;
2615 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2617 float_block_index
= 0;
2620 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2621 float_block_index
++;
2628 XFLOAT_DATA (val
) = float_value
;
2629 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2630 consing_since_gc
+= sizeof (struct Lisp_Float
);
2637 /***********************************************************************
2639 ***********************************************************************/
2641 /* We store cons cells inside of cons_blocks, allocating a new
2642 cons_block with malloc whenever necessary. Cons cells reclaimed by
2643 GC are put on a free list to be reallocated before allocating
2644 any new cons cells from the latest cons_block. */
2646 #define CONS_BLOCK_SIZE \
2647 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2648 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2650 #define CONS_BLOCK(fptr) \
2651 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2653 #define CONS_INDEX(fptr) \
2654 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2658 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2659 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2660 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2661 struct cons_block
*next
;
2664 #define CONS_MARKED_P(fptr) \
2665 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2667 #define CONS_MARK(fptr) \
2668 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2670 #define CONS_UNMARK(fptr) \
2671 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2673 /* Current cons_block. */
2675 struct cons_block
*cons_block
;
2677 /* Index of first unused Lisp_Cons in the current block. */
2679 int cons_block_index
;
2681 /* Free-list of Lisp_Cons structures. */
2683 struct Lisp_Cons
*cons_free_list
;
2685 /* Total number of cons blocks now in use. */
2690 /* Initialize cons allocation. */
2696 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2702 /* Explicitly free a cons cell by putting it on the free-list. */
2706 struct Lisp_Cons
*ptr
;
2708 ptr
->u
.chain
= cons_free_list
;
2712 cons_free_list
= ptr
;
2715 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2716 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2718 Lisp_Object car
, cdr
;
2720 register Lisp_Object val
;
2722 /* eassert (!handling_signal); */
2730 /* We use the cdr for chaining the free list
2731 so that we won't use the same field that has the mark bit. */
2732 XSETCONS (val
, cons_free_list
);
2733 cons_free_list
= cons_free_list
->u
.chain
;
2737 if (cons_block_index
== CONS_BLOCK_SIZE
)
2739 register struct cons_block
*new;
2740 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2742 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2743 new->next
= cons_block
;
2745 cons_block_index
= 0;
2748 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2758 eassert (!CONS_MARKED_P (XCONS (val
)));
2759 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2760 cons_cells_consed
++;
2764 /* Get an error now if there's any junk in the cons free list. */
2768 #ifdef GC_CHECK_CONS_LIST
2769 struct Lisp_Cons
*tail
= cons_free_list
;
2772 tail
= tail
->u
.chain
;
2776 /* Make a list of 2, 3, 4 or 5 specified objects. */
2780 Lisp_Object arg1
, arg2
;
2782 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2787 list3 (arg1
, arg2
, arg3
)
2788 Lisp_Object arg1
, arg2
, arg3
;
2790 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2795 list4 (arg1
, arg2
, arg3
, arg4
)
2796 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2798 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2803 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2804 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2806 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2807 Fcons (arg5
, Qnil
)))));
2811 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2812 doc
: /* Return a newly created list with specified arguments as elements.
2813 Any number of arguments, even zero arguments, are allowed.
2814 usage: (list &rest OBJECTS) */)
2817 register Lisp_Object
*args
;
2819 register Lisp_Object val
;
2825 val
= Fcons (args
[nargs
], val
);
2831 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2832 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2834 register Lisp_Object length
, init
;
2836 register Lisp_Object val
;
2839 CHECK_NATNUM (length
);
2840 size
= XFASTINT (length
);
2845 val
= Fcons (init
, val
);
2850 val
= Fcons (init
, val
);
2855 val
= Fcons (init
, val
);
2860 val
= Fcons (init
, val
);
2865 val
= Fcons (init
, val
);
2880 /***********************************************************************
2882 ***********************************************************************/
2884 /* Singly-linked list of all vectors. */
2886 struct Lisp_Vector
*all_vectors
;
2888 /* Total number of vector-like objects now in use. */
2893 /* Value is a pointer to a newly allocated Lisp_Vector structure
2894 with room for LEN Lisp_Objects. */
2896 static struct Lisp_Vector
*
2897 allocate_vectorlike (len
, type
)
2901 struct Lisp_Vector
*p
;
2904 #ifdef DOUG_LEA_MALLOC
2905 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2906 because mapped region contents are not preserved in
2909 mallopt (M_MMAP_MAX
, 0);
2913 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2914 /* eassert (!handling_signal); */
2916 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2917 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, type
);
2919 #ifdef DOUG_LEA_MALLOC
2920 /* Back to a reasonable maximum of mmap'ed areas. */
2922 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2926 consing_since_gc
+= nbytes
;
2927 vector_cells_consed
+= len
;
2933 p
->next
= all_vectors
;
2945 /* Allocate a vector with NSLOTS slots. */
2947 struct Lisp_Vector
*
2948 allocate_vector (nslots
)
2951 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
, MEM_TYPE_VECTOR
);
2957 /* Allocate other vector-like structures. */
2959 struct Lisp_Hash_Table
*
2960 allocate_hash_table ()
2962 EMACS_INT len
= VECSIZE (struct Lisp_Hash_Table
);
2963 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_HASH_TABLE
);
2967 for (i
= 0; i
< len
; ++i
)
2968 v
->contents
[i
] = Qnil
;
2970 return (struct Lisp_Hash_Table
*) v
;
2977 EMACS_INT len
= VECSIZE (struct window
);
2978 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_WINDOW
);
2981 for (i
= 0; i
< len
; ++i
)
2982 v
->contents
[i
] = Qnil
;
2985 return (struct window
*) v
;
2992 EMACS_INT len
= VECSIZE (struct frame
);
2993 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_FRAME
);
2996 for (i
= 0; i
< len
; ++i
)
2997 v
->contents
[i
] = make_number (0);
2999 return (struct frame
*) v
;
3003 struct Lisp_Process
*
3006 EMACS_INT len
= VECSIZE (struct Lisp_Process
);
3007 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_PROCESS
);
3010 for (i
= 0; i
< len
; ++i
)
3011 v
->contents
[i
] = Qnil
;
3014 return (struct Lisp_Process
*) v
;
3018 struct Lisp_Vector
*
3019 allocate_other_vector (len
)
3022 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_VECTOR
);
3025 for (i
= 0; i
< len
; ++i
)
3026 v
->contents
[i
] = Qnil
;
3033 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3034 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3035 See also the function `vector'. */)
3037 register Lisp_Object length
, init
;
3040 register EMACS_INT sizei
;
3042 register struct Lisp_Vector
*p
;
3044 CHECK_NATNUM (length
);
3045 sizei
= XFASTINT (length
);
3047 p
= allocate_vector (sizei
);
3048 for (index
= 0; index
< sizei
; index
++)
3049 p
->contents
[index
] = init
;
3051 XSETVECTOR (vector
, p
);
3056 DEFUN ("make-char-table", Fmake_char_table
, Smake_char_table
, 1, 2, 0,
3057 doc
: /* Return a newly created char-table, with purpose PURPOSE.
3058 Each element is initialized to INIT, which defaults to nil.
3059 PURPOSE should be a symbol which has a `char-table-extra-slots' property.
3060 The property's value should be an integer between 0 and 10. */)
3062 register Lisp_Object purpose
, init
;
3066 CHECK_SYMBOL (purpose
);
3067 n
= Fget (purpose
, Qchar_table_extra_slots
);
3069 if (XINT (n
) < 0 || XINT (n
) > 10)
3070 args_out_of_range (n
, Qnil
);
3071 /* Add 2 to the size for the defalt and parent slots. */
3072 vector
= Fmake_vector (make_number (CHAR_TABLE_STANDARD_SLOTS
+ XINT (n
)),
3074 XCHAR_TABLE (vector
)->top
= Qt
;
3075 XCHAR_TABLE (vector
)->parent
= Qnil
;
3076 XCHAR_TABLE (vector
)->purpose
= purpose
;
3077 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
3082 /* Return a newly created sub char table with slots initialized by INIT.
3083 Since a sub char table does not appear as a top level Emacs Lisp
3084 object, we don't need a Lisp interface to make it. */
3087 make_sub_char_table (init
)
3091 = Fmake_vector (make_number (SUB_CHAR_TABLE_STANDARD_SLOTS
), init
);
3092 XCHAR_TABLE (vector
)->top
= Qnil
;
3093 XCHAR_TABLE (vector
)->defalt
= Qnil
;
3094 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
3099 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3100 doc
: /* Return a newly created vector with specified arguments as elements.
3101 Any number of arguments, even zero arguments, are allowed.
3102 usage: (vector &rest OBJECTS) */)
3107 register Lisp_Object len
, val
;
3109 register struct Lisp_Vector
*p
;
3111 XSETFASTINT (len
, nargs
);
3112 val
= Fmake_vector (len
, Qnil
);
3114 for (index
= 0; index
< nargs
; index
++)
3115 p
->contents
[index
] = args
[index
];
3120 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3121 doc
: /* Create a byte-code object with specified arguments as elements.
3122 The arguments should be the arglist, bytecode-string, constant vector,
3123 stack size, (optional) doc string, and (optional) interactive spec.
3124 The first four arguments are required; at most six have any
3126 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3131 register Lisp_Object len
, val
;
3133 register struct Lisp_Vector
*p
;
3135 XSETFASTINT (len
, nargs
);
3136 if (!NILP (Vpurify_flag
))
3137 val
= make_pure_vector ((EMACS_INT
) nargs
);
3139 val
= Fmake_vector (len
, Qnil
);
3141 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
3142 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3143 earlier because they produced a raw 8-bit string for byte-code
3144 and now such a byte-code string is loaded as multibyte while
3145 raw 8-bit characters converted to multibyte form. Thus, now we
3146 must convert them back to the original unibyte form. */
3147 args
[1] = Fstring_as_unibyte (args
[1]);
3150 for (index
= 0; index
< nargs
; index
++)
3152 if (!NILP (Vpurify_flag
))
3153 args
[index
] = Fpurecopy (args
[index
]);
3154 p
->contents
[index
] = args
[index
];
3156 XSETCOMPILED (val
, p
);
3162 /***********************************************************************
3164 ***********************************************************************/
3166 /* Each symbol_block is just under 1020 bytes long, since malloc
3167 really allocates in units of powers of two and uses 4 bytes for its
3170 #define SYMBOL_BLOCK_SIZE \
3171 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3175 /* Place `symbols' first, to preserve alignment. */
3176 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3177 struct symbol_block
*next
;
3180 /* Current symbol block and index of first unused Lisp_Symbol
3183 struct symbol_block
*symbol_block
;
3184 int symbol_block_index
;
3186 /* List of free symbols. */
3188 struct Lisp_Symbol
*symbol_free_list
;
3190 /* Total number of symbol blocks now in use. */
3192 int n_symbol_blocks
;
3195 /* Initialize symbol allocation. */
3200 symbol_block
= NULL
;
3201 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3202 symbol_free_list
= 0;
3203 n_symbol_blocks
= 0;
3207 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3208 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3209 Its value and function definition are void, and its property list is nil. */)
3213 register Lisp_Object val
;
3214 register struct Lisp_Symbol
*p
;
3216 CHECK_STRING (name
);
3218 /* eassert (!handling_signal); */
3224 if (symbol_free_list
)
3226 XSETSYMBOL (val
, symbol_free_list
);
3227 symbol_free_list
= symbol_free_list
->next
;
3231 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3233 struct symbol_block
*new;
3234 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3236 new->next
= symbol_block
;
3238 symbol_block_index
= 0;
3241 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3242 symbol_block_index
++;
3252 p
->value
= Qunbound
;
3253 p
->function
= Qunbound
;
3256 p
->interned
= SYMBOL_UNINTERNED
;
3258 p
->indirect_variable
= 0;
3259 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3266 /***********************************************************************
3267 Marker (Misc) Allocation
3268 ***********************************************************************/
3270 /* Allocation of markers and other objects that share that structure.
3271 Works like allocation of conses. */
3273 #define MARKER_BLOCK_SIZE \
3274 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3278 /* Place `markers' first, to preserve alignment. */
3279 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3280 struct marker_block
*next
;
3283 struct marker_block
*marker_block
;
3284 int marker_block_index
;
3286 union Lisp_Misc
*marker_free_list
;
3288 /* Total number of marker blocks now in use. */
3290 int n_marker_blocks
;
3295 marker_block
= NULL
;
3296 marker_block_index
= MARKER_BLOCK_SIZE
;
3297 marker_free_list
= 0;
3298 n_marker_blocks
= 0;
3301 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3308 /* eassert (!handling_signal); */
3314 if (marker_free_list
)
3316 XSETMISC (val
, marker_free_list
);
3317 marker_free_list
= marker_free_list
->u_free
.chain
;
3321 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3323 struct marker_block
*new;
3324 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3326 new->next
= marker_block
;
3328 marker_block_index
= 0;
3330 total_free_markers
+= MARKER_BLOCK_SIZE
;
3332 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3333 marker_block_index
++;
3340 --total_free_markers
;
3341 consing_since_gc
+= sizeof (union Lisp_Misc
);
3342 misc_objects_consed
++;
3343 XMARKER (val
)->gcmarkbit
= 0;
3347 /* Free a Lisp_Misc object */
3353 XMISC (misc
)->u_marker
.type
= Lisp_Misc_Free
;
3354 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3355 marker_free_list
= XMISC (misc
);
3357 total_free_markers
++;
3360 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3361 INTEGER. This is used to package C values to call record_unwind_protect.
3362 The unwind function can get the C values back using XSAVE_VALUE. */
3365 make_save_value (pointer
, integer
)
3369 register Lisp_Object val
;
3370 register struct Lisp_Save_Value
*p
;
3372 val
= allocate_misc ();
3373 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3374 p
= XSAVE_VALUE (val
);
3375 p
->pointer
= pointer
;
3376 p
->integer
= integer
;
3381 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3382 doc
: /* Return a newly allocated marker which does not point at any place. */)
3385 register Lisp_Object val
;
3386 register struct Lisp_Marker
*p
;
3388 val
= allocate_misc ();
3389 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3395 p
->insertion_type
= 0;
3399 /* Put MARKER back on the free list after using it temporarily. */
3402 free_marker (marker
)
3405 unchain_marker (XMARKER (marker
));
3410 /* Return a newly created vector or string with specified arguments as
3411 elements. If all the arguments are characters that can fit
3412 in a string of events, make a string; otherwise, make a vector.
3414 Any number of arguments, even zero arguments, are allowed. */
3417 make_event_array (nargs
, args
)
3423 for (i
= 0; i
< nargs
; i
++)
3424 /* The things that fit in a string
3425 are characters that are in 0...127,
3426 after discarding the meta bit and all the bits above it. */
3427 if (!INTEGERP (args
[i
])
3428 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3429 return Fvector (nargs
, args
);
3431 /* Since the loop exited, we know that all the things in it are
3432 characters, so we can make a string. */
3436 result
= Fmake_string (make_number (nargs
), make_number (0));
3437 for (i
= 0; i
< nargs
; i
++)
3439 SSET (result
, i
, XINT (args
[i
]));
3440 /* Move the meta bit to the right place for a string char. */
3441 if (XINT (args
[i
]) & CHAR_META
)
3442 SSET (result
, i
, SREF (result
, i
) | 0x80);
3451 /************************************************************************
3452 Memory Full Handling
3453 ************************************************************************/
3456 /* Called if malloc returns zero. */
3465 memory_full_cons_threshold
= sizeof (struct cons_block
);
3467 /* The first time we get here, free the spare memory. */
3468 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3469 if (spare_memory
[i
])
3472 free (spare_memory
[i
]);
3473 else if (i
>= 1 && i
<= 4)
3474 lisp_align_free (spare_memory
[i
]);
3476 lisp_free (spare_memory
[i
]);
3477 spare_memory
[i
] = 0;
3480 /* Record the space now used. When it decreases substantially,
3481 we can refill the memory reserve. */
3482 #ifndef SYSTEM_MALLOC
3483 bytes_used_when_full
= BYTES_USED
;
3486 /* This used to call error, but if we've run out of memory, we could
3487 get infinite recursion trying to build the string. */
3489 Fsignal (Qnil
, Vmemory_signal_data
);
3492 /* If we released our reserve (due to running out of memory),
3493 and we have a fair amount free once again,
3494 try to set aside another reserve in case we run out once more.
3496 This is called when a relocatable block is freed in ralloc.c,
3497 and also directly from this file, in case we're not using ralloc.c. */
3500 refill_memory_reserve ()
3502 #ifndef SYSTEM_MALLOC
3503 if (spare_memory
[0] == 0)
3504 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3505 if (spare_memory
[1] == 0)
3506 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3508 if (spare_memory
[2] == 0)
3509 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3511 if (spare_memory
[3] == 0)
3512 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3514 if (spare_memory
[4] == 0)
3515 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3517 if (spare_memory
[5] == 0)
3518 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3520 if (spare_memory
[6] == 0)
3521 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3523 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3524 Vmemory_full
= Qnil
;
3528 /************************************************************************
3530 ************************************************************************/
3532 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3534 /* Conservative C stack marking requires a method to identify possibly
3535 live Lisp objects given a pointer value. We do this by keeping
3536 track of blocks of Lisp data that are allocated in a red-black tree
3537 (see also the comment of mem_node which is the type of nodes in
3538 that tree). Function lisp_malloc adds information for an allocated
3539 block to the red-black tree with calls to mem_insert, and function
3540 lisp_free removes it with mem_delete. Functions live_string_p etc
3541 call mem_find to lookup information about a given pointer in the
3542 tree, and use that to determine if the pointer points to a Lisp
3545 /* Initialize this part of alloc.c. */
3550 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3551 mem_z
.parent
= NULL
;
3552 mem_z
.color
= MEM_BLACK
;
3553 mem_z
.start
= mem_z
.end
= NULL
;
3558 /* Value is a pointer to the mem_node containing START. Value is
3559 MEM_NIL if there is no node in the tree containing START. */
3561 static INLINE
struct mem_node
*
3567 if (start
< min_heap_address
|| start
> max_heap_address
)
3570 /* Make the search always successful to speed up the loop below. */
3571 mem_z
.start
= start
;
3572 mem_z
.end
= (char *) start
+ 1;
3575 while (start
< p
->start
|| start
>= p
->end
)
3576 p
= start
< p
->start
? p
->left
: p
->right
;
3581 /* Insert a new node into the tree for a block of memory with start
3582 address START, end address END, and type TYPE. Value is a
3583 pointer to the node that was inserted. */
3585 static struct mem_node
*
3586 mem_insert (start
, end
, type
)
3590 struct mem_node
*c
, *parent
, *x
;
3592 if (start
< min_heap_address
)
3593 min_heap_address
= start
;
3594 if (end
> max_heap_address
)
3595 max_heap_address
= end
;
3597 /* See where in the tree a node for START belongs. In this
3598 particular application, it shouldn't happen that a node is already
3599 present. For debugging purposes, let's check that. */
3603 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3605 while (c
!= MEM_NIL
)
3607 if (start
>= c
->start
&& start
< c
->end
)
3610 c
= start
< c
->start
? c
->left
: c
->right
;
3613 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3615 while (c
!= MEM_NIL
)
3618 c
= start
< c
->start
? c
->left
: c
->right
;
3621 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3623 /* Create a new node. */
3624 #ifdef GC_MALLOC_CHECK
3625 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3629 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3635 x
->left
= x
->right
= MEM_NIL
;
3638 /* Insert it as child of PARENT or install it as root. */
3641 if (start
< parent
->start
)
3649 /* Re-establish red-black tree properties. */
3650 mem_insert_fixup (x
);
3656 /* Re-establish the red-black properties of the tree, and thereby
3657 balance the tree, after node X has been inserted; X is always red. */
3660 mem_insert_fixup (x
)
3663 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3665 /* X is red and its parent is red. This is a violation of
3666 red-black tree property #3. */
3668 if (x
->parent
== x
->parent
->parent
->left
)
3670 /* We're on the left side of our grandparent, and Y is our
3672 struct mem_node
*y
= x
->parent
->parent
->right
;
3674 if (y
->color
== MEM_RED
)
3676 /* Uncle and parent are red but should be black because
3677 X is red. Change the colors accordingly and proceed
3678 with the grandparent. */
3679 x
->parent
->color
= MEM_BLACK
;
3680 y
->color
= MEM_BLACK
;
3681 x
->parent
->parent
->color
= MEM_RED
;
3682 x
= x
->parent
->parent
;
3686 /* Parent and uncle have different colors; parent is
3687 red, uncle is black. */
3688 if (x
== x
->parent
->right
)
3691 mem_rotate_left (x
);
3694 x
->parent
->color
= MEM_BLACK
;
3695 x
->parent
->parent
->color
= MEM_RED
;
3696 mem_rotate_right (x
->parent
->parent
);
3701 /* This is the symmetrical case of above. */
3702 struct mem_node
*y
= x
->parent
->parent
->left
;
3704 if (y
->color
== MEM_RED
)
3706 x
->parent
->color
= MEM_BLACK
;
3707 y
->color
= MEM_BLACK
;
3708 x
->parent
->parent
->color
= MEM_RED
;
3709 x
= x
->parent
->parent
;
3713 if (x
== x
->parent
->left
)
3716 mem_rotate_right (x
);
3719 x
->parent
->color
= MEM_BLACK
;
3720 x
->parent
->parent
->color
= MEM_RED
;
3721 mem_rotate_left (x
->parent
->parent
);
3726 /* The root may have been changed to red due to the algorithm. Set
3727 it to black so that property #5 is satisfied. */
3728 mem_root
->color
= MEM_BLACK
;
3744 /* Turn y's left sub-tree into x's right sub-tree. */
3747 if (y
->left
!= MEM_NIL
)
3748 y
->left
->parent
= x
;
3750 /* Y's parent was x's parent. */
3752 y
->parent
= x
->parent
;
3754 /* Get the parent to point to y instead of x. */
3757 if (x
== x
->parent
->left
)
3758 x
->parent
->left
= y
;
3760 x
->parent
->right
= y
;
3765 /* Put x on y's left. */
3779 mem_rotate_right (x
)
3782 struct mem_node
*y
= x
->left
;
3785 if (y
->right
!= MEM_NIL
)
3786 y
->right
->parent
= x
;
3789 y
->parent
= x
->parent
;
3792 if (x
== x
->parent
->right
)
3793 x
->parent
->right
= y
;
3795 x
->parent
->left
= y
;
3806 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3812 struct mem_node
*x
, *y
;
3814 if (!z
|| z
== MEM_NIL
)
3817 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3822 while (y
->left
!= MEM_NIL
)
3826 if (y
->left
!= MEM_NIL
)
3831 x
->parent
= y
->parent
;
3834 if (y
== y
->parent
->left
)
3835 y
->parent
->left
= x
;
3837 y
->parent
->right
= x
;
3844 z
->start
= y
->start
;
3849 if (y
->color
== MEM_BLACK
)
3850 mem_delete_fixup (x
);
3852 #ifdef GC_MALLOC_CHECK
3860 /* Re-establish the red-black properties of the tree, after a
3864 mem_delete_fixup (x
)
3867 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3869 if (x
== x
->parent
->left
)
3871 struct mem_node
*w
= x
->parent
->right
;
3873 if (w
->color
== MEM_RED
)
3875 w
->color
= MEM_BLACK
;
3876 x
->parent
->color
= MEM_RED
;
3877 mem_rotate_left (x
->parent
);
3878 w
= x
->parent
->right
;
3881 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3888 if (w
->right
->color
== MEM_BLACK
)
3890 w
->left
->color
= MEM_BLACK
;
3892 mem_rotate_right (w
);
3893 w
= x
->parent
->right
;
3895 w
->color
= x
->parent
->color
;
3896 x
->parent
->color
= MEM_BLACK
;
3897 w
->right
->color
= MEM_BLACK
;
3898 mem_rotate_left (x
->parent
);
3904 struct mem_node
*w
= x
->parent
->left
;
3906 if (w
->color
== MEM_RED
)
3908 w
->color
= MEM_BLACK
;
3909 x
->parent
->color
= MEM_RED
;
3910 mem_rotate_right (x
->parent
);
3911 w
= x
->parent
->left
;
3914 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3921 if (w
->left
->color
== MEM_BLACK
)
3923 w
->right
->color
= MEM_BLACK
;
3925 mem_rotate_left (w
);
3926 w
= x
->parent
->left
;
3929 w
->color
= x
->parent
->color
;
3930 x
->parent
->color
= MEM_BLACK
;
3931 w
->left
->color
= MEM_BLACK
;
3932 mem_rotate_right (x
->parent
);
3938 x
->color
= MEM_BLACK
;
3942 /* Value is non-zero if P is a pointer to a live Lisp string on
3943 the heap. M is a pointer to the mem_block for P. */
3946 live_string_p (m
, p
)
3950 if (m
->type
== MEM_TYPE_STRING
)
3952 struct string_block
*b
= (struct string_block
*) m
->start
;
3953 int offset
= (char *) p
- (char *) &b
->strings
[0];
3955 /* P must point to the start of a Lisp_String structure, and it
3956 must not be on the free-list. */
3958 && offset
% sizeof b
->strings
[0] == 0
3959 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3960 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3967 /* Value is non-zero if P is a pointer to a live Lisp cons on
3968 the heap. M is a pointer to the mem_block for P. */
3975 if (m
->type
== MEM_TYPE_CONS
)
3977 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3978 int offset
= (char *) p
- (char *) &b
->conses
[0];
3980 /* P must point to the start of a Lisp_Cons, not be
3981 one of the unused cells in the current cons block,
3982 and not be on the free-list. */
3984 && offset
% sizeof b
->conses
[0] == 0
3985 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3987 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3988 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3995 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3996 the heap. M is a pointer to the mem_block for P. */
3999 live_symbol_p (m
, p
)
4003 if (m
->type
== MEM_TYPE_SYMBOL
)
4005 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
4006 int offset
= (char *) p
- (char *) &b
->symbols
[0];
4008 /* P must point to the start of a Lisp_Symbol, not be
4009 one of the unused cells in the current symbol block,
4010 and not be on the free-list. */
4012 && offset
% sizeof b
->symbols
[0] == 0
4013 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
4014 && (b
!= symbol_block
4015 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
4016 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
4023 /* Value is non-zero if P is a pointer to a live Lisp float on
4024 the heap. M is a pointer to the mem_block for P. */
4031 if (m
->type
== MEM_TYPE_FLOAT
)
4033 struct float_block
*b
= (struct float_block
*) m
->start
;
4034 int offset
= (char *) p
- (char *) &b
->floats
[0];
4036 /* P must point to the start of a Lisp_Float and not be
4037 one of the unused cells in the current float block. */
4039 && offset
% sizeof b
->floats
[0] == 0
4040 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
4041 && (b
!= float_block
4042 || offset
/ sizeof b
->floats
[0] < float_block_index
));
4049 /* Value is non-zero if P is a pointer to a live Lisp Misc on
4050 the heap. M is a pointer to the mem_block for P. */
4057 if (m
->type
== MEM_TYPE_MISC
)
4059 struct marker_block
*b
= (struct marker_block
*) m
->start
;
4060 int offset
= (char *) p
- (char *) &b
->markers
[0];
4062 /* P must point to the start of a Lisp_Misc, not be
4063 one of the unused cells in the current misc block,
4064 and not be on the free-list. */
4066 && offset
% sizeof b
->markers
[0] == 0
4067 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4068 && (b
!= marker_block
4069 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4070 && ((union Lisp_Misc
*) p
)->u_marker
.type
!= Lisp_Misc_Free
);
4077 /* Value is non-zero if P is a pointer to a live vector-like object.
4078 M is a pointer to the mem_block for P. */
4081 live_vector_p (m
, p
)
4085 return (p
== m
->start
4086 && m
->type
>= MEM_TYPE_VECTOR
4087 && m
->type
<= MEM_TYPE_WINDOW
);
4091 /* Value is non-zero if P is a pointer to a live buffer. M is a
4092 pointer to the mem_block for P. */
4095 live_buffer_p (m
, p
)
4099 /* P must point to the start of the block, and the buffer
4100 must not have been killed. */
4101 return (m
->type
== MEM_TYPE_BUFFER
4103 && !NILP (((struct buffer
*) p
)->name
));
4106 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4110 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4112 /* Array of objects that are kept alive because the C stack contains
4113 a pattern that looks like a reference to them . */
4115 #define MAX_ZOMBIES 10
4116 static Lisp_Object zombies
[MAX_ZOMBIES
];
4118 /* Number of zombie objects. */
4120 static int nzombies
;
4122 /* Number of garbage collections. */
4126 /* Average percentage of zombies per collection. */
4128 static double avg_zombies
;
4130 /* Max. number of live and zombie objects. */
4132 static int max_live
, max_zombies
;
4134 /* Average number of live objects per GC. */
4136 static double avg_live
;
4138 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4139 doc
: /* Show information about live and zombie objects. */)
4142 Lisp_Object args
[8], zombie_list
= Qnil
;
4144 for (i
= 0; i
< nzombies
; i
++)
4145 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4146 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4147 args
[1] = make_number (ngcs
);
4148 args
[2] = make_float (avg_live
);
4149 args
[3] = make_float (avg_zombies
);
4150 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4151 args
[5] = make_number (max_live
);
4152 args
[6] = make_number (max_zombies
);
4153 args
[7] = zombie_list
;
4154 return Fmessage (8, args
);
4157 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4160 /* Mark OBJ if we can prove it's a Lisp_Object. */
4163 mark_maybe_object (obj
)
4166 void *po
= (void *) XPNTR (obj
);
4167 struct mem_node
*m
= mem_find (po
);
4173 switch (XGCTYPE (obj
))
4176 mark_p
= (live_string_p (m
, po
)
4177 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4181 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4185 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4189 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4192 case Lisp_Vectorlike
:
4193 /* Note: can't check GC_BUFFERP before we know it's a
4194 buffer because checking that dereferences the pointer
4195 PO which might point anywhere. */
4196 if (live_vector_p (m
, po
))
4197 mark_p
= !GC_SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4198 else if (live_buffer_p (m
, po
))
4199 mark_p
= GC_BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4203 mark_p
= (live_misc_p (m
, po
) && !XMARKER (obj
)->gcmarkbit
);
4207 case Lisp_Type_Limit
:
4213 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4214 if (nzombies
< MAX_ZOMBIES
)
4215 zombies
[nzombies
] = obj
;
4224 /* If P points to Lisp data, mark that as live if it isn't already
4228 mark_maybe_pointer (p
)
4233 /* Quickly rule out some values which can't point to Lisp data. We
4234 assume that Lisp data is aligned on even addresses. */
4235 if ((EMACS_INT
) p
& 1)
4241 Lisp_Object obj
= Qnil
;
4245 case MEM_TYPE_NON_LISP
:
4246 /* Nothing to do; not a pointer to Lisp memory. */
4249 case MEM_TYPE_BUFFER
:
4250 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4251 XSETVECTOR (obj
, p
);
4255 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4259 case MEM_TYPE_STRING
:
4260 if (live_string_p (m
, p
)
4261 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4262 XSETSTRING (obj
, p
);
4266 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4270 case MEM_TYPE_SYMBOL
:
4271 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4272 XSETSYMBOL (obj
, p
);
4275 case MEM_TYPE_FLOAT
:
4276 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4280 case MEM_TYPE_VECTOR
:
4281 case MEM_TYPE_PROCESS
:
4282 case MEM_TYPE_HASH_TABLE
:
4283 case MEM_TYPE_FRAME
:
4284 case MEM_TYPE_WINDOW
:
4285 if (live_vector_p (m
, p
))
4288 XSETVECTOR (tem
, p
);
4289 if (!GC_SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4304 /* Mark Lisp objects referenced from the address range START..END. */
4307 mark_memory (start
, end
)
4313 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4317 /* Make START the pointer to the start of the memory region,
4318 if it isn't already. */
4326 /* Mark Lisp_Objects. */
4327 for (p
= (Lisp_Object
*) start
; (void *) p
< end
; ++p
)
4328 mark_maybe_object (*p
);
4330 /* Mark Lisp data pointed to. This is necessary because, in some
4331 situations, the C compiler optimizes Lisp objects away, so that
4332 only a pointer to them remains. Example:
4334 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4337 Lisp_Object obj = build_string ("test");
4338 struct Lisp_String *s = XSTRING (obj);
4339 Fgarbage_collect ();
4340 fprintf (stderr, "test `%s'\n", s->data);
4344 Here, `obj' isn't really used, and the compiler optimizes it
4345 away. The only reference to the life string is through the
4348 for (pp
= (void **) start
; (void *) pp
< end
; ++pp
)
4349 mark_maybe_pointer (*pp
);
4352 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4353 the GCC system configuration. In gcc 3.2, the only systems for
4354 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4355 by others?) and ns32k-pc532-min. */
4357 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4359 static int setjmp_tested_p
, longjmps_done
;
4361 #define SETJMP_WILL_LIKELY_WORK "\
4363 Emacs garbage collector has been changed to use conservative stack\n\
4364 marking. Emacs has determined that the method it uses to do the\n\
4365 marking will likely work on your system, but this isn't sure.\n\
4367 If you are a system-programmer, or can get the help of a local wizard\n\
4368 who is, please take a look at the function mark_stack in alloc.c, and\n\
4369 verify that the methods used are appropriate for your system.\n\
4371 Please mail the result to <emacs-devel@gnu.org>.\n\
4374 #define SETJMP_WILL_NOT_WORK "\
4376 Emacs garbage collector has been changed to use conservative stack\n\
4377 marking. Emacs has determined that the default method it uses to do the\n\
4378 marking will not work on your system. We will need a system-dependent\n\
4379 solution for your system.\n\
4381 Please take a look at the function mark_stack in alloc.c, and\n\
4382 try to find a way to make it work on your system.\n\
4384 Note that you may get false negatives, depending on the compiler.\n\
4385 In particular, you need to use -O with GCC for this test.\n\
4387 Please mail the result to <emacs-devel@gnu.org>.\n\
4391 /* Perform a quick check if it looks like setjmp saves registers in a
4392 jmp_buf. Print a message to stderr saying so. When this test
4393 succeeds, this is _not_ a proof that setjmp is sufficient for
4394 conservative stack marking. Only the sources or a disassembly
4405 /* Arrange for X to be put in a register. */
4411 if (longjmps_done
== 1)
4413 /* Came here after the longjmp at the end of the function.
4415 If x == 1, the longjmp has restored the register to its
4416 value before the setjmp, and we can hope that setjmp
4417 saves all such registers in the jmp_buf, although that
4420 For other values of X, either something really strange is
4421 taking place, or the setjmp just didn't save the register. */
4424 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4427 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4434 if (longjmps_done
== 1)
4438 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4441 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4443 /* Abort if anything GCPRO'd doesn't survive the GC. */
4451 for (p
= gcprolist
; p
; p
= p
->next
)
4452 for (i
= 0; i
< p
->nvars
; ++i
)
4453 if (!survives_gc_p (p
->var
[i
]))
4454 /* FIXME: It's not necessarily a bug. It might just be that the
4455 GCPRO is unnecessary or should release the object sooner. */
4459 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4466 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4467 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4469 fprintf (stderr
, " %d = ", i
);
4470 debug_print (zombies
[i
]);
4474 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4477 /* Mark live Lisp objects on the C stack.
4479 There are several system-dependent problems to consider when
4480 porting this to new architectures:
4484 We have to mark Lisp objects in CPU registers that can hold local
4485 variables or are used to pass parameters.
4487 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4488 something that either saves relevant registers on the stack, or
4489 calls mark_maybe_object passing it each register's contents.
4491 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4492 implementation assumes that calling setjmp saves registers we need
4493 to see in a jmp_buf which itself lies on the stack. This doesn't
4494 have to be true! It must be verified for each system, possibly
4495 by taking a look at the source code of setjmp.
4499 Architectures differ in the way their processor stack is organized.
4500 For example, the stack might look like this
4503 | Lisp_Object | size = 4
4505 | something else | size = 2
4507 | Lisp_Object | size = 4
4511 In such a case, not every Lisp_Object will be aligned equally. To
4512 find all Lisp_Object on the stack it won't be sufficient to walk
4513 the stack in steps of 4 bytes. Instead, two passes will be
4514 necessary, one starting at the start of the stack, and a second
4515 pass starting at the start of the stack + 2. Likewise, if the
4516 minimal alignment of Lisp_Objects on the stack is 1, four passes
4517 would be necessary, each one starting with one byte more offset
4518 from the stack start.
4520 The current code assumes by default that Lisp_Objects are aligned
4521 equally on the stack. */
4528 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4531 /* This trick flushes the register windows so that all the state of
4532 the process is contained in the stack. */
4533 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4534 needed on ia64 too. See mach_dep.c, where it also says inline
4535 assembler doesn't work with relevant proprietary compilers. */
4540 /* Save registers that we need to see on the stack. We need to see
4541 registers used to hold register variables and registers used to
4543 #ifdef GC_SAVE_REGISTERS_ON_STACK
4544 GC_SAVE_REGISTERS_ON_STACK (end
);
4545 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4547 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4548 setjmp will definitely work, test it
4549 and print a message with the result
4551 if (!setjmp_tested_p
)
4553 setjmp_tested_p
= 1;
4556 #endif /* GC_SETJMP_WORKS */
4559 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4560 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4562 /* This assumes that the stack is a contiguous region in memory. If
4563 that's not the case, something has to be done here to iterate
4564 over the stack segments. */
4565 #ifndef GC_LISP_OBJECT_ALIGNMENT
4567 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4569 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4572 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4573 mark_memory ((char *) stack_base
+ i
, end
);
4574 /* Allow for marking a secondary stack, like the register stack on the
4576 #ifdef GC_MARK_SECONDARY_STACK
4577 GC_MARK_SECONDARY_STACK ();
4580 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4585 #endif /* GC_MARK_STACK != 0 */
4589 /* Return 1 if OBJ is a valid lisp object.
4590 Return 0 if OBJ is NOT a valid lisp object.
4591 Return -1 if we cannot validate OBJ.
4592 This function can be quite slow,
4593 so it should only be used in code for manual debugging. */
4596 valid_lisp_object_p (obj
)
4609 p
= (void *) XPNTR (obj
);
4610 if (PURE_POINTER_P (p
))
4614 /* We need to determine whether it is safe to access memory at
4615 address P. Obviously, we cannot just access it (we would SEGV
4616 trying), so we trick the o/s to tell us whether p is a valid
4617 pointer. Unfortunately, we cannot use NULL_DEVICE here, as
4618 emacs_write may not validate p in that case. */
4619 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4621 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4623 unlink ("__Valid__Lisp__Object__");
4637 case MEM_TYPE_NON_LISP
:
4640 case MEM_TYPE_BUFFER
:
4641 return live_buffer_p (m
, p
);
4644 return live_cons_p (m
, p
);
4646 case MEM_TYPE_STRING
:
4647 return live_string_p (m
, p
);
4650 return live_misc_p (m
, p
);
4652 case MEM_TYPE_SYMBOL
:
4653 return live_symbol_p (m
, p
);
4655 case MEM_TYPE_FLOAT
:
4656 return live_float_p (m
, p
);
4658 case MEM_TYPE_VECTOR
:
4659 case MEM_TYPE_PROCESS
:
4660 case MEM_TYPE_HASH_TABLE
:
4661 case MEM_TYPE_FRAME
:
4662 case MEM_TYPE_WINDOW
:
4663 return live_vector_p (m
, p
);
4676 /***********************************************************************
4677 Pure Storage Management
4678 ***********************************************************************/
4680 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4681 pointer to it. TYPE is the Lisp type for which the memory is
4682 allocated. TYPE < 0 means it's not used for a Lisp object.
4684 If store_pure_type_info is set and TYPE is >= 0, the type of
4685 the allocated object is recorded in pure_types. */
4687 static POINTER_TYPE
*
4688 pure_alloc (size
, type
)
4692 POINTER_TYPE
*result
;
4694 size_t alignment
= (1 << GCTYPEBITS
);
4696 size_t alignment
= sizeof (EMACS_INT
);
4698 /* Give Lisp_Floats an extra alignment. */
4699 if (type
== Lisp_Float
)
4701 #if defined __GNUC__ && __GNUC__ >= 2
4702 alignment
= __alignof (struct Lisp_Float
);
4704 alignment
= sizeof (struct Lisp_Float
);
4710 result
= ALIGN (purebeg
+ pure_bytes_used
, alignment
);
4711 pure_bytes_used
= ((char *)result
- (char *)purebeg
) + size
;
4713 if (pure_bytes_used
<= pure_size
)
4716 /* Don't allocate a large amount here,
4717 because it might get mmap'd and then its address
4718 might not be usable. */
4719 purebeg
= (char *) xmalloc (10000);
4721 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4722 pure_bytes_used
= 0;
4727 /* Print a warning if PURESIZE is too small. */
4732 if (pure_bytes_used_before_overflow
)
4733 message ("emacs:0:Pure Lisp storage overflow (approx. %d bytes needed)",
4734 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4738 /* Return a string allocated in pure space. DATA is a buffer holding
4739 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4740 non-zero means make the result string multibyte.
4742 Must get an error if pure storage is full, since if it cannot hold
4743 a large string it may be able to hold conses that point to that
4744 string; then the string is not protected from gc. */
4747 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4753 struct Lisp_String
*s
;
4755 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4756 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4758 s
->size_byte
= multibyte
? nbytes
: -1;
4759 bcopy (data
, s
->data
, nbytes
);
4760 s
->data
[nbytes
] = '\0';
4761 s
->intervals
= NULL_INTERVAL
;
4762 XSETSTRING (string
, s
);
4767 /* Return a cons allocated from pure space. Give it pure copies
4768 of CAR as car and CDR as cdr. */
4771 pure_cons (car
, cdr
)
4772 Lisp_Object car
, cdr
;
4774 register Lisp_Object
new;
4775 struct Lisp_Cons
*p
;
4777 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4779 XSETCAR (new, Fpurecopy (car
));
4780 XSETCDR (new, Fpurecopy (cdr
));
4785 /* Value is a float object with value NUM allocated from pure space. */
4788 make_pure_float (num
)
4791 register Lisp_Object
new;
4792 struct Lisp_Float
*p
;
4794 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4796 XFLOAT_DATA (new) = num
;
4801 /* Return a vector with room for LEN Lisp_Objects allocated from
4805 make_pure_vector (len
)
4809 struct Lisp_Vector
*p
;
4810 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4812 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4813 XSETVECTOR (new, p
);
4814 XVECTOR (new)->size
= len
;
4819 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4820 doc
: /* Make a copy of object OBJ in pure storage.
4821 Recursively copies contents of vectors and cons cells.
4822 Does not copy symbols. Copies strings without text properties. */)
4824 register Lisp_Object obj
;
4826 if (NILP (Vpurify_flag
))
4829 if (PURE_POINTER_P (XPNTR (obj
)))
4833 return pure_cons (XCAR (obj
), XCDR (obj
));
4834 else if (FLOATP (obj
))
4835 return make_pure_float (XFLOAT_DATA (obj
));
4836 else if (STRINGP (obj
))
4837 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4839 STRING_MULTIBYTE (obj
));
4840 else if (COMPILEDP (obj
) || VECTORP (obj
))
4842 register struct Lisp_Vector
*vec
;
4846 size
= XVECTOR (obj
)->size
;
4847 if (size
& PSEUDOVECTOR_FLAG
)
4848 size
&= PSEUDOVECTOR_SIZE_MASK
;
4849 vec
= XVECTOR (make_pure_vector (size
));
4850 for (i
= 0; i
< size
; i
++)
4851 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4852 if (COMPILEDP (obj
))
4853 XSETCOMPILED (obj
, vec
);
4855 XSETVECTOR (obj
, vec
);
4858 else if (MARKERP (obj
))
4859 error ("Attempt to copy a marker to pure storage");
4866 /***********************************************************************
4868 ***********************************************************************/
4870 /* Put an entry in staticvec, pointing at the variable with address
4874 staticpro (varaddress
)
4875 Lisp_Object
*varaddress
;
4877 staticvec
[staticidx
++] = varaddress
;
4878 if (staticidx
>= NSTATICS
)
4886 struct catchtag
*next
;
4890 /***********************************************************************
4892 ***********************************************************************/
4894 /* Temporarily prevent garbage collection. */
4897 inhibit_garbage_collection ()
4899 int count
= SPECPDL_INDEX ();
4900 int nbits
= min (VALBITS
, BITS_PER_INT
);
4902 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4907 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4908 doc
: /* Reclaim storage for Lisp objects no longer needed.
4909 Garbage collection happens automatically if you cons more than
4910 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4911 `garbage-collect' normally returns a list with info on amount of space in use:
4912 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4913 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4914 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4915 (USED-STRINGS . FREE-STRINGS))
4916 However, if there was overflow in pure space, `garbage-collect'
4917 returns nil, because real GC can't be done. */)
4920 register struct specbinding
*bind
;
4921 struct catchtag
*catch;
4922 struct handler
*handler
;
4923 char stack_top_variable
;
4926 Lisp_Object total
[8];
4927 int count
= SPECPDL_INDEX ();
4928 EMACS_TIME t1
, t2
, t3
;
4933 /* Can't GC if pure storage overflowed because we can't determine
4934 if something is a pure object or not. */
4935 if (pure_bytes_used_before_overflow
)
4940 /* Don't keep undo information around forever.
4941 Do this early on, so it is no problem if the user quits. */
4943 register struct buffer
*nextb
= all_buffers
;
4947 /* If a buffer's undo list is Qt, that means that undo is
4948 turned off in that buffer. Calling truncate_undo_list on
4949 Qt tends to return NULL, which effectively turns undo back on.
4950 So don't call truncate_undo_list if undo_list is Qt. */
4951 if (! NILP (nextb
->name
) && ! EQ (nextb
->undo_list
, Qt
))
4952 truncate_undo_list (nextb
);
4954 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4955 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
))
4957 /* If a buffer's gap size is more than 10% of the buffer
4958 size, or larger than 2000 bytes, then shrink it
4959 accordingly. Keep a minimum size of 20 bytes. */
4960 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4962 if (nextb
->text
->gap_size
> size
)
4964 struct buffer
*save_current
= current_buffer
;
4965 current_buffer
= nextb
;
4966 make_gap (-(nextb
->text
->gap_size
- size
));
4967 current_buffer
= save_current
;
4971 nextb
= nextb
->next
;
4975 EMACS_GET_TIME (t1
);
4977 /* In case user calls debug_print during GC,
4978 don't let that cause a recursive GC. */
4979 consing_since_gc
= 0;
4981 /* Save what's currently displayed in the echo area. */
4982 message_p
= push_message ();
4983 record_unwind_protect (pop_message_unwind
, Qnil
);
4985 /* Save a copy of the contents of the stack, for debugging. */
4986 #if MAX_SAVE_STACK > 0
4987 if (NILP (Vpurify_flag
))
4989 i
= &stack_top_variable
- stack_bottom
;
4991 if (i
< MAX_SAVE_STACK
)
4993 if (stack_copy
== 0)
4994 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
4995 else if (stack_copy_size
< i
)
4996 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
4999 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
5000 bcopy (stack_bottom
, stack_copy
, i
);
5002 bcopy (&stack_top_variable
, stack_copy
, i
);
5006 #endif /* MAX_SAVE_STACK > 0 */
5008 if (garbage_collection_messages
)
5009 message1_nolog ("Garbage collecting...");
5013 shrink_regexp_cache ();
5017 /* clear_marks (); */
5019 /* Mark all the special slots that serve as the roots of accessibility. */
5021 for (i
= 0; i
< staticidx
; i
++)
5022 mark_object (*staticvec
[i
]);
5024 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
5026 mark_object (bind
->symbol
);
5027 mark_object (bind
->old_value
);
5033 extern void xg_mark_data ();
5038 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5039 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5043 register struct gcpro
*tail
;
5044 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5045 for (i
= 0; i
< tail
->nvars
; i
++)
5046 mark_object (tail
->var
[i
]);
5051 for (catch = catchlist
; catch; catch = catch->next
)
5053 mark_object (catch->tag
);
5054 mark_object (catch->val
);
5056 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5058 mark_object (handler
->handler
);
5059 mark_object (handler
->var
);
5063 #ifdef HAVE_WINDOW_SYSTEM
5064 mark_fringe_data ();
5067 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5071 /* Everything is now marked, except for the things that require special
5072 finalization, i.e. the undo_list.
5073 Look thru every buffer's undo list
5074 for elements that update markers that were not marked,
5077 register struct buffer
*nextb
= all_buffers
;
5081 /* If a buffer's undo list is Qt, that means that undo is
5082 turned off in that buffer. Calling truncate_undo_list on
5083 Qt tends to return NULL, which effectively turns undo back on.
5084 So don't call truncate_undo_list if undo_list is Qt. */
5085 if (! EQ (nextb
->undo_list
, Qt
))
5087 Lisp_Object tail
, prev
;
5088 tail
= nextb
->undo_list
;
5090 while (CONSP (tail
))
5092 if (GC_CONSP (XCAR (tail
))
5093 && GC_MARKERP (XCAR (XCAR (tail
)))
5094 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5097 nextb
->undo_list
= tail
= XCDR (tail
);
5101 XSETCDR (prev
, tail
);
5111 /* Now that we have stripped the elements that need not be in the
5112 undo_list any more, we can finally mark the list. */
5113 mark_object (nextb
->undo_list
);
5115 nextb
= nextb
->next
;
5121 /* Clear the mark bits that we set in certain root slots. */
5123 unmark_byte_stack ();
5124 VECTOR_UNMARK (&buffer_defaults
);
5125 VECTOR_UNMARK (&buffer_local_symbols
);
5127 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5135 /* clear_marks (); */
5138 consing_since_gc
= 0;
5139 if (gc_cons_threshold
< 10000)
5140 gc_cons_threshold
= 10000;
5142 if (FLOATP (Vgc_cons_percentage
))
5143 { /* Set gc_cons_combined_threshold. */
5144 EMACS_INT total
= 0;
5146 total
+= total_conses
* sizeof (struct Lisp_Cons
);
5147 total
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5148 total
+= total_markers
* sizeof (union Lisp_Misc
);
5149 total
+= total_string_size
;
5150 total
+= total_vector_size
* sizeof (Lisp_Object
);
5151 total
+= total_floats
* sizeof (struct Lisp_Float
);
5152 total
+= total_intervals
* sizeof (struct interval
);
5153 total
+= total_strings
* sizeof (struct Lisp_String
);
5155 gc_relative_threshold
= total
* XFLOAT_DATA (Vgc_cons_percentage
);
5158 gc_relative_threshold
= 0;
5160 if (garbage_collection_messages
)
5162 if (message_p
|| minibuf_level
> 0)
5165 message1_nolog ("Garbage collecting...done");
5168 unbind_to (count
, Qnil
);
5170 total
[0] = Fcons (make_number (total_conses
),
5171 make_number (total_free_conses
));
5172 total
[1] = Fcons (make_number (total_symbols
),
5173 make_number (total_free_symbols
));
5174 total
[2] = Fcons (make_number (total_markers
),
5175 make_number (total_free_markers
));
5176 total
[3] = make_number (total_string_size
);
5177 total
[4] = make_number (total_vector_size
);
5178 total
[5] = Fcons (make_number (total_floats
),
5179 make_number (total_free_floats
));
5180 total
[6] = Fcons (make_number (total_intervals
),
5181 make_number (total_free_intervals
));
5182 total
[7] = Fcons (make_number (total_strings
),
5183 make_number (total_free_strings
));
5185 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5187 /* Compute average percentage of zombies. */
5190 for (i
= 0; i
< 7; ++i
)
5191 if (CONSP (total
[i
]))
5192 nlive
+= XFASTINT (XCAR (total
[i
]));
5194 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5195 max_live
= max (nlive
, max_live
);
5196 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5197 max_zombies
= max (nzombies
, max_zombies
);
5202 if (!NILP (Vpost_gc_hook
))
5204 int count
= inhibit_garbage_collection ();
5205 safe_run_hooks (Qpost_gc_hook
);
5206 unbind_to (count
, Qnil
);
5209 /* Accumulate statistics. */
5210 EMACS_GET_TIME (t2
);
5211 EMACS_SUB_TIME (t3
, t2
, t1
);
5212 if (FLOATP (Vgc_elapsed
))
5213 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5215 EMACS_USECS (t3
) * 1.0e-6);
5218 return Flist (sizeof total
/ sizeof *total
, total
);
5222 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5223 only interesting objects referenced from glyphs are strings. */
5226 mark_glyph_matrix (matrix
)
5227 struct glyph_matrix
*matrix
;
5229 struct glyph_row
*row
= matrix
->rows
;
5230 struct glyph_row
*end
= row
+ matrix
->nrows
;
5232 for (; row
< end
; ++row
)
5236 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5238 struct glyph
*glyph
= row
->glyphs
[area
];
5239 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5241 for (; glyph
< end_glyph
; ++glyph
)
5242 if (GC_STRINGP (glyph
->object
)
5243 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5244 mark_object (glyph
->object
);
5250 /* Mark Lisp faces in the face cache C. */
5254 struct face_cache
*c
;
5259 for (i
= 0; i
< c
->used
; ++i
)
5261 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5265 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5266 mark_object (face
->lface
[j
]);
5273 #ifdef HAVE_WINDOW_SYSTEM
5275 /* Mark Lisp objects in image IMG. */
5281 mark_object (img
->spec
);
5283 if (!NILP (img
->data
.lisp_val
))
5284 mark_object (img
->data
.lisp_val
);
5288 /* Mark Lisp objects in image cache of frame F. It's done this way so
5289 that we don't have to include xterm.h here. */
5292 mark_image_cache (f
)
5295 forall_images_in_image_cache (f
, mark_image
);
5298 #endif /* HAVE_X_WINDOWS */
5302 /* Mark reference to a Lisp_Object.
5303 If the object referred to has not been seen yet, recursively mark
5304 all the references contained in it. */
5306 #define LAST_MARKED_SIZE 500
5307 Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5308 int last_marked_index
;
5310 /* For debugging--call abort when we cdr down this many
5311 links of a list, in mark_object. In debugging,
5312 the call to abort will hit a breakpoint.
5313 Normally this is zero and the check never goes off. */
5314 int mark_object_loop_halt
;
5320 register Lisp_Object obj
= arg
;
5321 #ifdef GC_CHECK_MARKED_OBJECTS
5329 if (PURE_POINTER_P (XPNTR (obj
)))
5332 last_marked
[last_marked_index
++] = obj
;
5333 if (last_marked_index
== LAST_MARKED_SIZE
)
5334 last_marked_index
= 0;
5336 /* Perform some sanity checks on the objects marked here. Abort if
5337 we encounter an object we know is bogus. This increases GC time
5338 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5339 #ifdef GC_CHECK_MARKED_OBJECTS
5341 po
= (void *) XPNTR (obj
);
5343 /* Check that the object pointed to by PO is known to be a Lisp
5344 structure allocated from the heap. */
5345 #define CHECK_ALLOCATED() \
5347 m = mem_find (po); \
5352 /* Check that the object pointed to by PO is live, using predicate
5354 #define CHECK_LIVE(LIVEP) \
5356 if (!LIVEP (m, po)) \
5360 /* Check both of the above conditions. */
5361 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5363 CHECK_ALLOCATED (); \
5364 CHECK_LIVE (LIVEP); \
5367 #else /* not GC_CHECK_MARKED_OBJECTS */
5369 #define CHECK_ALLOCATED() (void) 0
5370 #define CHECK_LIVE(LIVEP) (void) 0
5371 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5373 #endif /* not GC_CHECK_MARKED_OBJECTS */
5375 switch (SWITCH_ENUM_CAST (XGCTYPE (obj
)))
5379 register struct Lisp_String
*ptr
= XSTRING (obj
);
5380 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5381 MARK_INTERVAL_TREE (ptr
->intervals
);
5383 #ifdef GC_CHECK_STRING_BYTES
5384 /* Check that the string size recorded in the string is the
5385 same as the one recorded in the sdata structure. */
5386 CHECK_STRING_BYTES (ptr
);
5387 #endif /* GC_CHECK_STRING_BYTES */
5391 case Lisp_Vectorlike
:
5392 #ifdef GC_CHECK_MARKED_OBJECTS
5394 if (m
== MEM_NIL
&& !GC_SUBRP (obj
)
5395 && po
!= &buffer_defaults
5396 && po
!= &buffer_local_symbols
)
5398 #endif /* GC_CHECK_MARKED_OBJECTS */
5400 if (GC_BUFFERP (obj
))
5402 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
5404 #ifdef GC_CHECK_MARKED_OBJECTS
5405 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5408 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
5413 #endif /* GC_CHECK_MARKED_OBJECTS */
5417 else if (GC_SUBRP (obj
))
5419 else if (GC_COMPILEDP (obj
))
5420 /* We could treat this just like a vector, but it is better to
5421 save the COMPILED_CONSTANTS element for last and avoid
5424 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5425 register EMACS_INT size
= ptr
->size
;
5428 if (VECTOR_MARKED_P (ptr
))
5429 break; /* Already marked */
5431 CHECK_LIVE (live_vector_p
);
5432 VECTOR_MARK (ptr
); /* Else mark it */
5433 size
&= PSEUDOVECTOR_SIZE_MASK
;
5434 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5436 if (i
!= COMPILED_CONSTANTS
)
5437 mark_object (ptr
->contents
[i
]);
5439 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5442 else if (GC_FRAMEP (obj
))
5444 register struct frame
*ptr
= XFRAME (obj
);
5446 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
5447 VECTOR_MARK (ptr
); /* Else mark it */
5449 CHECK_LIVE (live_vector_p
);
5450 mark_object (ptr
->name
);
5451 mark_object (ptr
->icon_name
);
5452 mark_object (ptr
->title
);
5453 mark_object (ptr
->focus_frame
);
5454 mark_object (ptr
->selected_window
);
5455 mark_object (ptr
->minibuffer_window
);
5456 mark_object (ptr
->param_alist
);
5457 mark_object (ptr
->scroll_bars
);
5458 mark_object (ptr
->condemned_scroll_bars
);
5459 mark_object (ptr
->menu_bar_items
);
5460 mark_object (ptr
->face_alist
);
5461 mark_object (ptr
->menu_bar_vector
);
5462 mark_object (ptr
->buffer_predicate
);
5463 mark_object (ptr
->buffer_list
);
5464 mark_object (ptr
->menu_bar_window
);
5465 mark_object (ptr
->tool_bar_window
);
5466 mark_face_cache (ptr
->face_cache
);
5467 #ifdef HAVE_WINDOW_SYSTEM
5468 mark_image_cache (ptr
);
5469 mark_object (ptr
->tool_bar_items
);
5470 mark_object (ptr
->desired_tool_bar_string
);
5471 mark_object (ptr
->current_tool_bar_string
);
5472 #endif /* HAVE_WINDOW_SYSTEM */
5474 else if (GC_BOOL_VECTOR_P (obj
))
5476 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5478 if (VECTOR_MARKED_P (ptr
))
5479 break; /* Already marked */
5480 CHECK_LIVE (live_vector_p
);
5481 VECTOR_MARK (ptr
); /* Else mark it */
5483 else if (GC_WINDOWP (obj
))
5485 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5486 struct window
*w
= XWINDOW (obj
);
5489 /* Stop if already marked. */
5490 if (VECTOR_MARKED_P (ptr
))
5494 CHECK_LIVE (live_vector_p
);
5497 /* There is no Lisp data above The member CURRENT_MATRIX in
5498 struct WINDOW. Stop marking when that slot is reached. */
5500 (char *) &ptr
->contents
[i
] < (char *) &w
->current_matrix
;
5502 mark_object (ptr
->contents
[i
]);
5504 /* Mark glyphs for leaf windows. Marking window matrices is
5505 sufficient because frame matrices use the same glyph
5507 if (NILP (w
->hchild
)
5509 && w
->current_matrix
)
5511 mark_glyph_matrix (w
->current_matrix
);
5512 mark_glyph_matrix (w
->desired_matrix
);
5515 else if (GC_HASH_TABLE_P (obj
))
5517 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5519 /* Stop if already marked. */
5520 if (VECTOR_MARKED_P (h
))
5524 CHECK_LIVE (live_vector_p
);
5527 /* Mark contents. */
5528 /* Do not mark next_free or next_weak.
5529 Being in the next_weak chain
5530 should not keep the hash table alive.
5531 No need to mark `count' since it is an integer. */
5532 mark_object (h
->test
);
5533 mark_object (h
->weak
);
5534 mark_object (h
->rehash_size
);
5535 mark_object (h
->rehash_threshold
);
5536 mark_object (h
->hash
);
5537 mark_object (h
->next
);
5538 mark_object (h
->index
);
5539 mark_object (h
->user_hash_function
);
5540 mark_object (h
->user_cmp_function
);
5542 /* If hash table is not weak, mark all keys and values.
5543 For weak tables, mark only the vector. */
5544 if (GC_NILP (h
->weak
))
5545 mark_object (h
->key_and_value
);
5547 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5551 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5552 register EMACS_INT size
= ptr
->size
;
5555 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
5556 CHECK_LIVE (live_vector_p
);
5557 VECTOR_MARK (ptr
); /* Else mark it */
5558 if (size
& PSEUDOVECTOR_FLAG
)
5559 size
&= PSEUDOVECTOR_SIZE_MASK
;
5561 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5562 mark_object (ptr
->contents
[i
]);
5568 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5569 struct Lisp_Symbol
*ptrx
;
5571 if (ptr
->gcmarkbit
) break;
5572 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5574 mark_object (ptr
->value
);
5575 mark_object (ptr
->function
);
5576 mark_object (ptr
->plist
);
5578 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5579 MARK_STRING (XSTRING (ptr
->xname
));
5580 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5582 /* Note that we do not mark the obarray of the symbol.
5583 It is safe not to do so because nothing accesses that
5584 slot except to check whether it is nil. */
5588 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5589 XSETSYMBOL (obj
, ptrx
);
5596 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5597 if (XMARKER (obj
)->gcmarkbit
)
5599 XMARKER (obj
)->gcmarkbit
= 1;
5601 switch (XMISCTYPE (obj
))
5603 case Lisp_Misc_Buffer_Local_Value
:
5604 case Lisp_Misc_Some_Buffer_Local_Value
:
5606 register struct Lisp_Buffer_Local_Value
*ptr
5607 = XBUFFER_LOCAL_VALUE (obj
);
5608 /* If the cdr is nil, avoid recursion for the car. */
5609 if (EQ (ptr
->cdr
, Qnil
))
5611 obj
= ptr
->realvalue
;
5614 mark_object (ptr
->realvalue
);
5615 mark_object (ptr
->buffer
);
5616 mark_object (ptr
->frame
);
5621 case Lisp_Misc_Marker
:
5622 /* DO NOT mark thru the marker's chain.
5623 The buffer's markers chain does not preserve markers from gc;
5624 instead, markers are removed from the chain when freed by gc. */
5627 case Lisp_Misc_Intfwd
:
5628 case Lisp_Misc_Boolfwd
:
5629 case Lisp_Misc_Objfwd
:
5630 case Lisp_Misc_Buffer_Objfwd
:
5631 case Lisp_Misc_Kboard_Objfwd
:
5632 /* Don't bother with Lisp_Buffer_Objfwd,
5633 since all markable slots in current buffer marked anyway. */
5634 /* Don't need to do Lisp_Objfwd, since the places they point
5635 are protected with staticpro. */
5638 case Lisp_Misc_Save_Value
:
5641 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5642 /* If DOGC is set, POINTER is the address of a memory
5643 area containing INTEGER potential Lisp_Objects. */
5646 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5648 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5649 mark_maybe_object (*p
);
5655 case Lisp_Misc_Overlay
:
5657 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5658 mark_object (ptr
->start
);
5659 mark_object (ptr
->end
);
5660 mark_object (ptr
->plist
);
5663 XSETMISC (obj
, ptr
->next
);
5676 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5677 if (CONS_MARKED_P (ptr
)) break;
5678 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5680 /* If the cdr is nil, avoid recursion for the car. */
5681 if (EQ (ptr
->u
.cdr
, Qnil
))
5687 mark_object (ptr
->car
);
5690 if (cdr_count
== mark_object_loop_halt
)
5696 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5697 FLOAT_MARK (XFLOAT (obj
));
5708 #undef CHECK_ALLOCATED
5709 #undef CHECK_ALLOCATED_AND_LIVE
5712 /* Mark the pointers in a buffer structure. */
5718 register struct buffer
*buffer
= XBUFFER (buf
);
5719 register Lisp_Object
*ptr
, tmp
;
5720 Lisp_Object base_buffer
;
5722 VECTOR_MARK (buffer
);
5724 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5726 /* For now, we just don't mark the undo_list. It's done later in
5727 a special way just before the sweep phase, and after stripping
5728 some of its elements that are not needed any more. */
5730 if (buffer
->overlays_before
)
5732 XSETMISC (tmp
, buffer
->overlays_before
);
5735 if (buffer
->overlays_after
)
5737 XSETMISC (tmp
, buffer
->overlays_after
);
5741 for (ptr
= &buffer
->name
;
5742 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5746 /* If this is an indirect buffer, mark its base buffer. */
5747 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5749 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5750 mark_buffer (base_buffer
);
5755 /* Value is non-zero if OBJ will survive the current GC because it's
5756 either marked or does not need to be marked to survive. */
5764 switch (XGCTYPE (obj
))
5771 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5775 survives_p
= XMARKER (obj
)->gcmarkbit
;
5779 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5782 case Lisp_Vectorlike
:
5783 survives_p
= GC_SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5787 survives_p
= CONS_MARKED_P (XCONS (obj
));
5791 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5798 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5803 /* Sweep: find all structures not marked, and free them. */
5808 /* Remove or mark entries in weak hash tables.
5809 This must be done before any object is unmarked. */
5810 sweep_weak_hash_tables ();
5813 #ifdef GC_CHECK_STRING_BYTES
5814 if (!noninteractive
)
5815 check_string_bytes (1);
5818 /* Put all unmarked conses on free list */
5820 register struct cons_block
*cblk
;
5821 struct cons_block
**cprev
= &cons_block
;
5822 register int lim
= cons_block_index
;
5823 register int num_free
= 0, num_used
= 0;
5827 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5831 for (i
= 0; i
< lim
; i
++)
5832 if (!CONS_MARKED_P (&cblk
->conses
[i
]))
5835 cblk
->conses
[i
].u
.chain
= cons_free_list
;
5836 cons_free_list
= &cblk
->conses
[i
];
5838 cons_free_list
->car
= Vdead
;
5844 CONS_UNMARK (&cblk
->conses
[i
]);
5846 lim
= CONS_BLOCK_SIZE
;
5847 /* If this block contains only free conses and we have already
5848 seen more than two blocks worth of free conses then deallocate
5850 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5852 *cprev
= cblk
->next
;
5853 /* Unhook from the free list. */
5854 cons_free_list
= cblk
->conses
[0].u
.chain
;
5855 lisp_align_free (cblk
);
5860 num_free
+= this_free
;
5861 cprev
= &cblk
->next
;
5864 total_conses
= num_used
;
5865 total_free_conses
= num_free
;
5868 /* Put all unmarked floats on free list */
5870 register struct float_block
*fblk
;
5871 struct float_block
**fprev
= &float_block
;
5872 register int lim
= float_block_index
;
5873 register int num_free
= 0, num_used
= 0;
5875 float_free_list
= 0;
5877 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5881 for (i
= 0; i
< lim
; i
++)
5882 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5885 fblk
->floats
[i
].u
.chain
= float_free_list
;
5886 float_free_list
= &fblk
->floats
[i
];
5891 FLOAT_UNMARK (&fblk
->floats
[i
]);
5893 lim
= FLOAT_BLOCK_SIZE
;
5894 /* If this block contains only free floats and we have already
5895 seen more than two blocks worth of free floats then deallocate
5897 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5899 *fprev
= fblk
->next
;
5900 /* Unhook from the free list. */
5901 float_free_list
= fblk
->floats
[0].u
.chain
;
5902 lisp_align_free (fblk
);
5907 num_free
+= this_free
;
5908 fprev
= &fblk
->next
;
5911 total_floats
= num_used
;
5912 total_free_floats
= num_free
;
5915 /* Put all unmarked intervals on free list */
5917 register struct interval_block
*iblk
;
5918 struct interval_block
**iprev
= &interval_block
;
5919 register int lim
= interval_block_index
;
5920 register int num_free
= 0, num_used
= 0;
5922 interval_free_list
= 0;
5924 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5929 for (i
= 0; i
< lim
; i
++)
5931 if (!iblk
->intervals
[i
].gcmarkbit
)
5933 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5934 interval_free_list
= &iblk
->intervals
[i
];
5940 iblk
->intervals
[i
].gcmarkbit
= 0;
5943 lim
= INTERVAL_BLOCK_SIZE
;
5944 /* If this block contains only free intervals and we have already
5945 seen more than two blocks worth of free intervals then
5946 deallocate this block. */
5947 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5949 *iprev
= iblk
->next
;
5950 /* Unhook from the free list. */
5951 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5953 n_interval_blocks
--;
5957 num_free
+= this_free
;
5958 iprev
= &iblk
->next
;
5961 total_intervals
= num_used
;
5962 total_free_intervals
= num_free
;
5965 /* Put all unmarked symbols on free list */
5967 register struct symbol_block
*sblk
;
5968 struct symbol_block
**sprev
= &symbol_block
;
5969 register int lim
= symbol_block_index
;
5970 register int num_free
= 0, num_used
= 0;
5972 symbol_free_list
= NULL
;
5974 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5977 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5978 struct Lisp_Symbol
*end
= sym
+ lim
;
5980 for (; sym
< end
; ++sym
)
5982 /* Check if the symbol was created during loadup. In such a case
5983 it might be pointed to by pure bytecode which we don't trace,
5984 so we conservatively assume that it is live. */
5985 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5987 if (!sym
->gcmarkbit
&& !pure_p
)
5989 sym
->next
= symbol_free_list
;
5990 symbol_free_list
= sym
;
5992 symbol_free_list
->function
= Vdead
;
6000 UNMARK_STRING (XSTRING (sym
->xname
));
6005 lim
= SYMBOL_BLOCK_SIZE
;
6006 /* If this block contains only free symbols and we have already
6007 seen more than two blocks worth of free symbols then deallocate
6009 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6011 *sprev
= sblk
->next
;
6012 /* Unhook from the free list. */
6013 symbol_free_list
= sblk
->symbols
[0].next
;
6019 num_free
+= this_free
;
6020 sprev
= &sblk
->next
;
6023 total_symbols
= num_used
;
6024 total_free_symbols
= num_free
;
6027 /* Put all unmarked misc's on free list.
6028 For a marker, first unchain it from the buffer it points into. */
6030 register struct marker_block
*mblk
;
6031 struct marker_block
**mprev
= &marker_block
;
6032 register int lim
= marker_block_index
;
6033 register int num_free
= 0, num_used
= 0;
6035 marker_free_list
= 0;
6037 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6042 for (i
= 0; i
< lim
; i
++)
6044 if (!mblk
->markers
[i
].u_marker
.gcmarkbit
)
6046 if (mblk
->markers
[i
].u_marker
.type
== Lisp_Misc_Marker
)
6047 unchain_marker (&mblk
->markers
[i
].u_marker
);
6048 /* Set the type of the freed object to Lisp_Misc_Free.
6049 We could leave the type alone, since nobody checks it,
6050 but this might catch bugs faster. */
6051 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
6052 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
6053 marker_free_list
= &mblk
->markers
[i
];
6059 mblk
->markers
[i
].u_marker
.gcmarkbit
= 0;
6062 lim
= MARKER_BLOCK_SIZE
;
6063 /* If this block contains only free markers and we have already
6064 seen more than two blocks worth of free markers then deallocate
6066 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6068 *mprev
= mblk
->next
;
6069 /* Unhook from the free list. */
6070 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
6076 num_free
+= this_free
;
6077 mprev
= &mblk
->next
;
6081 total_markers
= num_used
;
6082 total_free_markers
= num_free
;
6085 /* Free all unmarked buffers */
6087 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6090 if (!VECTOR_MARKED_P (buffer
))
6093 prev
->next
= buffer
->next
;
6095 all_buffers
= buffer
->next
;
6096 next
= buffer
->next
;
6102 VECTOR_UNMARK (buffer
);
6103 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6104 prev
= buffer
, buffer
= buffer
->next
;
6108 /* Free all unmarked vectors */
6110 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6111 total_vector_size
= 0;
6114 if (!VECTOR_MARKED_P (vector
))
6117 prev
->next
= vector
->next
;
6119 all_vectors
= vector
->next
;
6120 next
= vector
->next
;
6128 VECTOR_UNMARK (vector
);
6129 if (vector
->size
& PSEUDOVECTOR_FLAG
)
6130 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
6132 total_vector_size
+= vector
->size
;
6133 prev
= vector
, vector
= vector
->next
;
6137 #ifdef GC_CHECK_STRING_BYTES
6138 if (!noninteractive
)
6139 check_string_bytes (1);
6146 /* Debugging aids. */
6148 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6149 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6150 This may be helpful in debugging Emacs's memory usage.
6151 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6156 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
6161 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6162 doc
: /* Return a list of counters that measure how much consing there has been.
6163 Each of these counters increments for a certain kind of object.
6164 The counters wrap around from the largest positive integer to zero.
6165 Garbage collection does not decrease them.
6166 The elements of the value are as follows:
6167 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6168 All are in units of 1 = one object consed
6169 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6171 MISCS include overlays, markers, and some internal types.
6172 Frames, windows, buffers, and subprocesses count as vectors
6173 (but the contents of a buffer's text do not count here). */)
6176 Lisp_Object consed
[8];
6178 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6179 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6180 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6181 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6182 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6183 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6184 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6185 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6187 return Flist (8, consed
);
6190 int suppress_checking
;
6192 die (msg
, file
, line
)
6197 fprintf (stderr
, "\r\nEmacs fatal error: %s:%d: %s\r\n",
6202 /* Initialization */
6207 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6209 pure_size
= PURESIZE
;
6210 pure_bytes_used
= 0;
6211 pure_bytes_used_before_overflow
= 0;
6213 /* Initialize the list of free aligned blocks. */
6216 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6218 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6222 ignore_warnings
= 1;
6223 #ifdef DOUG_LEA_MALLOC
6224 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6225 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6226 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6236 malloc_hysteresis
= 32;
6238 malloc_hysteresis
= 0;
6241 refill_memory_reserve ();
6243 ignore_warnings
= 0;
6245 byte_stack_list
= 0;
6247 consing_since_gc
= 0;
6248 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6249 gc_relative_threshold
= 0;
6251 #ifdef VIRT_ADDR_VARIES
6252 malloc_sbrk_unused
= 1<<22; /* A large number */
6253 malloc_sbrk_used
= 100000; /* as reasonable as any number */
6254 #endif /* VIRT_ADDR_VARIES */
6261 byte_stack_list
= 0;
6263 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6264 setjmp_tested_p
= longjmps_done
= 0;
6267 Vgc_elapsed
= make_float (0.0);
6274 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
6275 doc
: /* *Number of bytes of consing between garbage collections.
6276 Garbage collection can happen automatically once this many bytes have been
6277 allocated since the last garbage collection. All data types count.
6279 Garbage collection happens automatically only when `eval' is called.
6281 By binding this temporarily to a large number, you can effectively
6282 prevent garbage collection during a part of the program.
6283 See also `gc-cons-percentage'. */);
6285 DEFVAR_LISP ("gc-cons-percentage", &Vgc_cons_percentage
,
6286 doc
: /* *Portion of the heap used for allocation.
6287 Garbage collection can happen automatically once this portion of the heap
6288 has been allocated since the last garbage collection.
6289 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6290 Vgc_cons_percentage
= make_float (0.1);
6292 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
6293 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6295 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
6296 doc
: /* Number of cons cells that have been consed so far. */);
6298 DEFVAR_INT ("floats-consed", &floats_consed
,
6299 doc
: /* Number of floats that have been consed so far. */);
6301 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
6302 doc
: /* Number of vector cells that have been consed so far. */);
6304 DEFVAR_INT ("symbols-consed", &symbols_consed
,
6305 doc
: /* Number of symbols that have been consed so far. */);
6307 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
6308 doc
: /* Number of string characters that have been consed so far. */);
6310 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
6311 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6313 DEFVAR_INT ("intervals-consed", &intervals_consed
,
6314 doc
: /* Number of intervals that have been consed so far. */);
6316 DEFVAR_INT ("strings-consed", &strings_consed
,
6317 doc
: /* Number of strings that have been consed so far. */);
6319 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
6320 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6321 This means that certain objects should be allocated in shared (pure) space. */);
6323 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
6324 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6325 garbage_collection_messages
= 0;
6327 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
6328 doc
: /* Hook run after garbage collection has finished. */);
6329 Vpost_gc_hook
= Qnil
;
6330 Qpost_gc_hook
= intern ("post-gc-hook");
6331 staticpro (&Qpost_gc_hook
);
6333 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
6334 doc
: /* Precomputed `signal' argument for memory-full error. */);
6335 /* We build this in advance because if we wait until we need it, we might
6336 not be able to allocate the memory to hold it. */
6339 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
6341 DEFVAR_LISP ("memory-full", &Vmemory_full
,
6342 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6343 Vmemory_full
= Qnil
;
6345 staticpro (&Qgc_cons_threshold
);
6346 Qgc_cons_threshold
= intern ("gc-cons-threshold");
6348 staticpro (&Qchar_table_extra_slots
);
6349 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
6351 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
6352 doc
: /* Accumulated time elapsed in garbage collections.
6353 The time is in seconds as a floating point value. */);
6354 DEFVAR_INT ("gcs-done", &gcs_done
,
6355 doc
: /* Accumulated number of garbage collections done. */);
6360 defsubr (&Smake_byte_code
);
6361 defsubr (&Smake_list
);
6362 defsubr (&Smake_vector
);
6363 defsubr (&Smake_char_table
);
6364 defsubr (&Smake_string
);
6365 defsubr (&Smake_bool_vector
);
6366 defsubr (&Smake_symbol
);
6367 defsubr (&Smake_marker
);
6368 defsubr (&Spurecopy
);
6369 defsubr (&Sgarbage_collect
);
6370 defsubr (&Smemory_limit
);
6371 defsubr (&Smemory_use_counts
);
6373 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6374 defsubr (&Sgc_status
);
6378 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
6379 (do not change this comment) */