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. */
27 #include <stddef.h> /* For offsetof, used by PSEUDOVECSIZE. */
34 /* Note that this declares bzero on OSF/1. How dumb. */
38 #ifdef HAVE_GTK_AND_PTHREAD
42 /* This file is part of the core Lisp implementation, and thus must
43 deal with the real data structures. If the Lisp implementation is
44 replaced, this file likely will not be used. */
46 #undef HIDE_LISP_IMPLEMENTATION
49 #include "intervals.h"
55 #include "blockinput.h"
57 #include "syssignal.h"
60 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
61 memory. Can do this only if using gmalloc.c. */
63 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
64 #undef GC_MALLOC_CHECK
70 extern POINTER_TYPE
*sbrk ();
74 #define INCLUDED_FCNTL
81 #ifdef DOUG_LEA_MALLOC
84 /* malloc.h #defines this as size_t, at least in glibc2. */
85 #ifndef __malloc_size_t
86 #define __malloc_size_t int
89 /* Specify maximum number of areas to mmap. It would be nice to use a
90 value that explicitly means "no limit". */
92 #define MMAP_MAX_AREAS 100000000
94 #else /* not DOUG_LEA_MALLOC */
96 /* The following come from gmalloc.c. */
98 #define __malloc_size_t size_t
99 extern __malloc_size_t _bytes_used
;
100 extern __malloc_size_t __malloc_extra_blocks
;
102 #endif /* not DOUG_LEA_MALLOC */
104 #if ! defined (SYSTEM_MALLOC) && defined (HAVE_GTK_AND_PTHREAD)
106 /* When GTK uses the file chooser dialog, different backends can be loaded
107 dynamically. One such a backend is the Gnome VFS backend that gets loaded
108 if you run Gnome. That backend creates several threads and also allocates
111 If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_*
112 functions below are called from malloc, there is a chance that one
113 of these threads preempts the Emacs main thread and the hook variables
114 end up in an inconsistent state. So we have a mutex to prevent that (note
115 that the backend handles concurrent access to malloc within its own threads
116 but Emacs code running in the main thread is not included in that control).
118 When UNBLOCK_INPUT is called, reinvoke_input_signal may be called. If this
119 happens in one of the backend threads we will have two threads that tries
120 to run Emacs code at once, and the code is not prepared for that.
121 To prevent that, we only call BLOCK/UNBLOCK from the main thread. */
123 static pthread_mutex_t alloc_mutex
;
125 #define BLOCK_INPUT_ALLOC \
128 pthread_mutex_lock (&alloc_mutex); \
129 if (pthread_self () == main_thread) \
133 #define UNBLOCK_INPUT_ALLOC \
136 if (pthread_self () == main_thread) \
138 pthread_mutex_unlock (&alloc_mutex); \
142 #else /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
144 #define BLOCK_INPUT_ALLOC BLOCK_INPUT
145 #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT
147 #endif /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
149 /* Value of _bytes_used, when spare_memory was freed. */
151 static __malloc_size_t bytes_used_when_full
;
153 static __malloc_size_t bytes_used_when_reconsidered
;
155 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
156 to a struct Lisp_String. */
158 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
159 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
160 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
162 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
163 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
164 #define VECTOR_MARKED_P(V) (((V)->size & ARRAY_MARK_FLAG) != 0)
166 /* Value is the number of bytes/chars of S, a pointer to a struct
167 Lisp_String. This must be used instead of STRING_BYTES (S) or
168 S->size during GC, because S->size contains the mark bit for
171 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
172 #define GC_STRING_CHARS(S) ((S)->size & ~ARRAY_MARK_FLAG)
174 /* Number of bytes of consing done since the last gc. */
176 int consing_since_gc
;
178 /* Count the amount of consing of various sorts of space. */
180 EMACS_INT cons_cells_consed
;
181 EMACS_INT floats_consed
;
182 EMACS_INT vector_cells_consed
;
183 EMACS_INT symbols_consed
;
184 EMACS_INT string_chars_consed
;
185 EMACS_INT misc_objects_consed
;
186 EMACS_INT intervals_consed
;
187 EMACS_INT strings_consed
;
189 /* Minimum number of bytes of consing since GC before next GC. */
191 EMACS_INT gc_cons_threshold
;
193 /* Similar minimum, computed from Vgc_cons_percentage. */
195 EMACS_INT gc_relative_threshold
;
197 static Lisp_Object Vgc_cons_percentage
;
199 /* Minimum number of bytes of consing since GC before next GC,
200 when memory is full. */
202 EMACS_INT memory_full_cons_threshold
;
204 /* Nonzero during GC. */
208 /* Nonzero means abort if try to GC.
209 This is for code which is written on the assumption that
210 no GC will happen, so as to verify that assumption. */
214 /* Nonzero means display messages at beginning and end of GC. */
216 int garbage_collection_messages
;
218 #ifndef VIRT_ADDR_VARIES
220 #endif /* VIRT_ADDR_VARIES */
221 int malloc_sbrk_used
;
223 #ifndef VIRT_ADDR_VARIES
225 #endif /* VIRT_ADDR_VARIES */
226 int malloc_sbrk_unused
;
228 /* Number of live and free conses etc. */
230 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
231 static int total_free_conses
, total_free_markers
, total_free_symbols
;
232 static int total_free_floats
, total_floats
;
234 /* Points to memory space allocated as "spare", to be freed if we run
235 out of memory. We keep one large block, four cons-blocks, and
236 two string blocks. */
238 char *spare_memory
[7];
240 /* Amount of spare memory to keep in large reserve block. */
242 #define SPARE_MEMORY (1 << 14)
244 /* Number of extra blocks malloc should get when it needs more core. */
246 static int malloc_hysteresis
;
248 /* Non-nil means defun should do purecopy on the function definition. */
250 Lisp_Object Vpurify_flag
;
252 /* Non-nil means we are handling a memory-full error. */
254 Lisp_Object Vmemory_full
;
258 /* Initialize it to a nonzero value to force it into data space
259 (rather than bss space). That way unexec will remap it into text
260 space (pure), on some systems. We have not implemented the
261 remapping on more recent systems because this is less important
262 nowadays than in the days of small memories and timesharing. */
264 EMACS_INT pure
[PURESIZE
/ sizeof (EMACS_INT
)] = {1,};
265 #define PUREBEG (char *) pure
269 #define pure PURE_SEG_BITS /* Use shared memory segment */
270 #define PUREBEG (char *)PURE_SEG_BITS
272 #endif /* HAVE_SHM */
274 /* Pointer to the pure area, and its size. */
276 static char *purebeg
;
277 static size_t pure_size
;
279 /* Number of bytes of pure storage used before pure storage overflowed.
280 If this is non-zero, this implies that an overflow occurred. */
282 static size_t pure_bytes_used_before_overflow
;
284 /* Value is non-zero if P points into pure space. */
286 #define PURE_POINTER_P(P) \
287 (((PNTR_COMPARISON_TYPE) (P) \
288 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
289 && ((PNTR_COMPARISON_TYPE) (P) \
290 >= (PNTR_COMPARISON_TYPE) purebeg))
292 /* Total number of bytes allocated in pure storage. */
294 EMACS_INT pure_bytes_used
;
296 /* Index in pure at which next pure Lisp object will be allocated.. */
298 static EMACS_INT pure_bytes_used_lisp
;
300 /* Number of bytes allocated for non-Lisp objects in pure storage. */
302 static EMACS_INT pure_bytes_used_non_lisp
;
304 /* If nonzero, this is a warning delivered by malloc and not yet
307 char *pending_malloc_warning
;
309 /* Pre-computed signal argument for use when memory is exhausted. */
311 Lisp_Object Vmemory_signal_data
;
313 /* Maximum amount of C stack to save when a GC happens. */
315 #ifndef MAX_SAVE_STACK
316 #define MAX_SAVE_STACK 16000
319 /* Buffer in which we save a copy of the C stack at each GC. */
324 /* Non-zero means ignore malloc warnings. Set during initialization.
325 Currently not used. */
329 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
331 /* Hook run after GC has finished. */
333 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
335 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
336 EMACS_INT gcs_done
; /* accumulated GCs */
338 static void mark_buffer
P_ ((Lisp_Object
));
339 extern void mark_kboards
P_ ((void));
340 extern void mark_backtrace
P_ ((void));
341 static void gc_sweep
P_ ((void));
342 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
343 static void mark_face_cache
P_ ((struct face_cache
*));
345 #ifdef HAVE_WINDOW_SYSTEM
346 extern void mark_fringe_data
P_ ((void));
347 static void mark_image
P_ ((struct image
*));
348 static void mark_image_cache
P_ ((struct frame
*));
349 #endif /* HAVE_WINDOW_SYSTEM */
351 static struct Lisp_String
*allocate_string
P_ ((void));
352 static void compact_small_strings
P_ ((void));
353 static void free_large_strings
P_ ((void));
354 static void sweep_strings
P_ ((void));
356 extern int message_enable_multibyte
;
358 /* When scanning the C stack for live Lisp objects, Emacs keeps track
359 of what memory allocated via lisp_malloc is intended for what
360 purpose. This enumeration specifies the type of memory. */
371 /* Keep the following vector-like types together, with
372 MEM_TYPE_WINDOW being the last, and MEM_TYPE_VECTOR the
373 first. Or change the code of live_vector_p, for instance. */
381 static POINTER_TYPE
*lisp_align_malloc
P_ ((size_t, enum mem_type
));
382 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
383 void refill_memory_reserve ();
386 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
388 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
389 #include <stdio.h> /* For fprintf. */
392 /* A unique object in pure space used to make some Lisp objects
393 on free lists recognizable in O(1). */
397 #ifdef GC_MALLOC_CHECK
399 enum mem_type allocated_mem_type
;
400 int dont_register_blocks
;
402 #endif /* GC_MALLOC_CHECK */
404 /* A node in the red-black tree describing allocated memory containing
405 Lisp data. Each such block is recorded with its start and end
406 address when it is allocated, and removed from the tree when it
409 A red-black tree is a balanced binary tree with the following
412 1. Every node is either red or black.
413 2. Every leaf is black.
414 3. If a node is red, then both of its children are black.
415 4. Every simple path from a node to a descendant leaf contains
416 the same number of black nodes.
417 5. The root is always black.
419 When nodes are inserted into the tree, or deleted from the tree,
420 the tree is "fixed" so that these properties are always true.
422 A red-black tree with N internal nodes has height at most 2
423 log(N+1). Searches, insertions and deletions are done in O(log N).
424 Please see a text book about data structures for a detailed
425 description of red-black trees. Any book worth its salt should
430 /* Children of this node. These pointers are never NULL. When there
431 is no child, the value is MEM_NIL, which points to a dummy node. */
432 struct mem_node
*left
, *right
;
434 /* The parent of this node. In the root node, this is NULL. */
435 struct mem_node
*parent
;
437 /* Start and end of allocated region. */
441 enum {MEM_BLACK
, MEM_RED
} color
;
447 /* Base address of stack. Set in main. */
449 Lisp_Object
*stack_base
;
451 /* Root of the tree describing allocated Lisp memory. */
453 static struct mem_node
*mem_root
;
455 /* Lowest and highest known address in the heap. */
457 static void *min_heap_address
, *max_heap_address
;
459 /* Sentinel node of the tree. */
461 static struct mem_node mem_z
;
462 #define MEM_NIL &mem_z
464 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
465 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
, enum mem_type
));
466 static void lisp_free
P_ ((POINTER_TYPE
*));
467 static void mark_stack
P_ ((void));
468 static int live_vector_p
P_ ((struct mem_node
*, void *));
469 static int live_buffer_p
P_ ((struct mem_node
*, void *));
470 static int live_string_p
P_ ((struct mem_node
*, void *));
471 static int live_cons_p
P_ ((struct mem_node
*, void *));
472 static int live_symbol_p
P_ ((struct mem_node
*, void *));
473 static int live_float_p
P_ ((struct mem_node
*, void *));
474 static int live_misc_p
P_ ((struct mem_node
*, void *));
475 static void mark_maybe_object
P_ ((Lisp_Object
));
476 static void mark_memory
P_ ((void *, void *));
477 static void mem_init
P_ ((void));
478 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
479 static void mem_insert_fixup
P_ ((struct mem_node
*));
480 static void mem_rotate_left
P_ ((struct mem_node
*));
481 static void mem_rotate_right
P_ ((struct mem_node
*));
482 static void mem_delete
P_ ((struct mem_node
*));
483 static void mem_delete_fixup
P_ ((struct mem_node
*));
484 static INLINE
struct mem_node
*mem_find
P_ ((void *));
487 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
488 static void check_gcpros
P_ ((void));
491 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
493 /* Recording what needs to be marked for gc. */
495 struct gcpro
*gcprolist
;
497 /* Addresses of staticpro'd variables. Initialize it to a nonzero
498 value; otherwise some compilers put it into BSS. */
500 #define NSTATICS 1280
501 Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
503 /* Index of next unused slot in staticvec. */
507 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
510 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
511 ALIGNMENT must be a power of 2. */
513 #define ALIGN(ptr, ALIGNMENT) \
514 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
515 & ~((ALIGNMENT) - 1)))
519 /************************************************************************
521 ************************************************************************/
523 /* Function malloc calls this if it finds we are near exhausting storage. */
529 pending_malloc_warning
= str
;
533 /* Display an already-pending malloc warning. */
536 display_malloc_warning ()
538 call3 (intern ("display-warning"),
540 build_string (pending_malloc_warning
),
541 intern ("emergency"));
542 pending_malloc_warning
= 0;
546 #ifdef DOUG_LEA_MALLOC
547 # define BYTES_USED (mallinfo ().uordblks)
549 # define BYTES_USED _bytes_used
552 /* Called if we can't allocate relocatable space for a buffer. */
555 buffer_memory_full ()
557 /* If buffers use the relocating allocator, no need to free
558 spare_memory, because we may have plenty of malloc space left
559 that we could get, and if we don't, the malloc that fails will
560 itself cause spare_memory to be freed. If buffers don't use the
561 relocating allocator, treat this like any other failing
568 /* This used to call error, but if we've run out of memory, we could
569 get infinite recursion trying to build the string. */
570 xsignal (Qnil
, Vmemory_signal_data
);
574 #ifdef XMALLOC_OVERRUN_CHECK
576 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
577 and a 16 byte trailer around each block.
579 The header consists of 12 fixed bytes + a 4 byte integer contaning the
580 original block size, while the trailer consists of 16 fixed bytes.
582 The header is used to detect whether this block has been allocated
583 through these functions -- as it seems that some low-level libc
584 functions may bypass the malloc hooks.
588 #define XMALLOC_OVERRUN_CHECK_SIZE 16
590 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
591 { 0x9a, 0x9b, 0xae, 0xaf,
592 0xbf, 0xbe, 0xce, 0xcf,
593 0xea, 0xeb, 0xec, 0xed };
595 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
596 { 0xaa, 0xab, 0xac, 0xad,
597 0xba, 0xbb, 0xbc, 0xbd,
598 0xca, 0xcb, 0xcc, 0xcd,
599 0xda, 0xdb, 0xdc, 0xdd };
601 /* Macros to insert and extract the block size in the header. */
603 #define XMALLOC_PUT_SIZE(ptr, size) \
604 (ptr[-1] = (size & 0xff), \
605 ptr[-2] = ((size >> 8) & 0xff), \
606 ptr[-3] = ((size >> 16) & 0xff), \
607 ptr[-4] = ((size >> 24) & 0xff))
609 #define XMALLOC_GET_SIZE(ptr) \
610 (size_t)((unsigned)(ptr[-1]) | \
611 ((unsigned)(ptr[-2]) << 8) | \
612 ((unsigned)(ptr[-3]) << 16) | \
613 ((unsigned)(ptr[-4]) << 24))
616 /* The call depth in overrun_check functions. For example, this might happen:
618 overrun_check_malloc()
619 -> malloc -> (via hook)_-> emacs_blocked_malloc
620 -> overrun_check_malloc
621 call malloc (hooks are NULL, so real malloc is called).
622 malloc returns 10000.
623 add overhead, return 10016.
624 <- (back in overrun_check_malloc)
625 add overhead again, return 10032
626 xmalloc returns 10032.
631 overrun_check_free(10032)
633 free(10016) <- crash, because 10000 is the original pointer. */
635 static int check_depth
;
637 /* Like malloc, but wraps allocated block with header and trailer. */
640 overrun_check_malloc (size
)
643 register unsigned char *val
;
644 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
646 val
= (unsigned char *) malloc (size
+ overhead
);
647 if (val
&& check_depth
== 1)
649 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
650 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
651 XMALLOC_PUT_SIZE(val
, size
);
652 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
655 return (POINTER_TYPE
*)val
;
659 /* Like realloc, but checks old block for overrun, and wraps new block
660 with header and trailer. */
663 overrun_check_realloc (block
, size
)
667 register unsigned char *val
= (unsigned char *)block
;
668 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
672 && bcmp (xmalloc_overrun_check_header
,
673 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
674 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
676 size_t osize
= XMALLOC_GET_SIZE (val
);
677 if (bcmp (xmalloc_overrun_check_trailer
,
679 XMALLOC_OVERRUN_CHECK_SIZE
))
681 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
682 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
683 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
686 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
688 if (val
&& check_depth
== 1)
690 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
691 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
692 XMALLOC_PUT_SIZE(val
, size
);
693 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
696 return (POINTER_TYPE
*)val
;
699 /* Like free, but checks block for overrun. */
702 overrun_check_free (block
)
705 unsigned char *val
= (unsigned char *)block
;
710 && bcmp (xmalloc_overrun_check_header
,
711 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
712 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
714 size_t osize
= XMALLOC_GET_SIZE (val
);
715 if (bcmp (xmalloc_overrun_check_trailer
,
717 XMALLOC_OVERRUN_CHECK_SIZE
))
719 #ifdef XMALLOC_CLEAR_FREE_MEMORY
720 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
721 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
723 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
724 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
725 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
736 #define malloc overrun_check_malloc
737 #define realloc overrun_check_realloc
738 #define free overrun_check_free
742 /* Like malloc but check for no memory and block interrupt input.. */
748 register POINTER_TYPE
*val
;
751 val
= (POINTER_TYPE
*) malloc (size
);
760 /* Like realloc but check for no memory and block interrupt input.. */
763 xrealloc (block
, size
)
767 register POINTER_TYPE
*val
;
770 /* We must call malloc explicitly when BLOCK is 0, since some
771 reallocs don't do this. */
773 val
= (POINTER_TYPE
*) malloc (size
);
775 val
= (POINTER_TYPE
*) realloc (block
, size
);
778 if (!val
&& size
) memory_full ();
783 /* Like free but block interrupt input. */
792 /* We don't call refill_memory_reserve here
793 because that duplicates doing so in emacs_blocked_free
794 and the criterion should go there. */
798 /* Like strdup, but uses xmalloc. */
804 size_t len
= strlen (s
) + 1;
805 char *p
= (char *) xmalloc (len
);
811 /* Unwind for SAFE_ALLOCA */
814 safe_alloca_unwind (arg
)
817 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
827 /* Like malloc but used for allocating Lisp data. NBYTES is the
828 number of bytes to allocate, TYPE describes the intended use of the
829 allcated memory block (for strings, for conses, ...). */
832 static void *lisp_malloc_loser
;
835 static POINTER_TYPE
*
836 lisp_malloc (nbytes
, type
)
844 #ifdef GC_MALLOC_CHECK
845 allocated_mem_type
= type
;
848 val
= (void *) malloc (nbytes
);
851 /* If the memory just allocated cannot be addressed thru a Lisp
852 object's pointer, and it needs to be,
853 that's equivalent to running out of memory. */
854 if (val
&& type
!= MEM_TYPE_NON_LISP
)
857 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
858 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
860 lisp_malloc_loser
= val
;
867 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
868 if (val
&& type
!= MEM_TYPE_NON_LISP
)
869 mem_insert (val
, (char *) val
+ nbytes
, type
);
878 /* Free BLOCK. This must be called to free memory allocated with a
879 call to lisp_malloc. */
887 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
888 mem_delete (mem_find (block
));
893 /* Allocation of aligned blocks of memory to store Lisp data. */
894 /* The entry point is lisp_align_malloc which returns blocks of at most */
895 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
897 /* Use posix_memalloc if the system has it and we're using the system's
898 malloc (because our gmalloc.c routines don't have posix_memalign although
899 its memalloc could be used). */
900 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
901 #define USE_POSIX_MEMALIGN 1
904 /* BLOCK_ALIGN has to be a power of 2. */
905 #define BLOCK_ALIGN (1 << 10)
907 /* Padding to leave at the end of a malloc'd block. This is to give
908 malloc a chance to minimize the amount of memory wasted to alignment.
909 It should be tuned to the particular malloc library used.
910 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
911 posix_memalign on the other hand would ideally prefer a value of 4
912 because otherwise, there's 1020 bytes wasted between each ablocks.
913 In Emacs, testing shows that those 1020 can most of the time be
914 efficiently used by malloc to place other objects, so a value of 0 can
915 still preferable unless you have a lot of aligned blocks and virtually
917 #define BLOCK_PADDING 0
918 #define BLOCK_BYTES \
919 (BLOCK_ALIGN - sizeof (struct ablock *) - BLOCK_PADDING)
921 /* Internal data structures and constants. */
923 #define ABLOCKS_SIZE 16
925 /* An aligned block of memory. */
930 char payload
[BLOCK_BYTES
];
931 struct ablock
*next_free
;
933 /* `abase' is the aligned base of the ablocks. */
934 /* It is overloaded to hold the virtual `busy' field that counts
935 the number of used ablock in the parent ablocks.
936 The first ablock has the `busy' field, the others have the `abase'
937 field. To tell the difference, we assume that pointers will have
938 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
939 is used to tell whether the real base of the parent ablocks is `abase'
940 (if not, the word before the first ablock holds a pointer to the
942 struct ablocks
*abase
;
943 /* The padding of all but the last ablock is unused. The padding of
944 the last ablock in an ablocks is not allocated. */
946 char padding
[BLOCK_PADDING
];
950 /* A bunch of consecutive aligned blocks. */
953 struct ablock blocks
[ABLOCKS_SIZE
];
956 /* Size of the block requested from malloc or memalign. */
957 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
959 #define ABLOCK_ABASE(block) \
960 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
961 ? (struct ablocks *)(block) \
964 /* Virtual `busy' field. */
965 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
967 /* Pointer to the (not necessarily aligned) malloc block. */
968 #ifdef USE_POSIX_MEMALIGN
969 #define ABLOCKS_BASE(abase) (abase)
971 #define ABLOCKS_BASE(abase) \
972 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
975 /* The list of free ablock. */
976 static struct ablock
*free_ablock
;
978 /* Allocate an aligned block of nbytes.
979 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
980 smaller or equal to BLOCK_BYTES. */
981 static POINTER_TYPE
*
982 lisp_align_malloc (nbytes
, type
)
987 struct ablocks
*abase
;
989 eassert (nbytes
<= BLOCK_BYTES
);
993 #ifdef GC_MALLOC_CHECK
994 allocated_mem_type
= type
;
1000 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
1002 #ifdef DOUG_LEA_MALLOC
1003 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1004 because mapped region contents are not preserved in
1006 mallopt (M_MMAP_MAX
, 0);
1009 #ifdef USE_POSIX_MEMALIGN
1011 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1017 base
= malloc (ABLOCKS_BYTES
);
1018 abase
= ALIGN (base
, BLOCK_ALIGN
);
1027 aligned
= (base
== abase
);
1029 ((void**)abase
)[-1] = base
;
1031 #ifdef DOUG_LEA_MALLOC
1032 /* Back to a reasonable maximum of mmap'ed areas. */
1033 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1037 /* If the memory just allocated cannot be addressed thru a Lisp
1038 object's pointer, and it needs to be, that's equivalent to
1039 running out of memory. */
1040 if (type
!= MEM_TYPE_NON_LISP
)
1043 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1044 XSETCONS (tem
, end
);
1045 if ((char *) XCONS (tem
) != end
)
1047 lisp_malloc_loser
= base
;
1055 /* Initialize the blocks and put them on the free list.
1056 Is `base' was not properly aligned, we can't use the last block. */
1057 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1059 abase
->blocks
[i
].abase
= abase
;
1060 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1061 free_ablock
= &abase
->blocks
[i
];
1063 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
1065 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
1066 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1067 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1068 eassert (ABLOCKS_BASE (abase
) == base
);
1069 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
1072 abase
= ABLOCK_ABASE (free_ablock
);
1073 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
1075 free_ablock
= free_ablock
->x
.next_free
;
1077 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1078 if (val
&& type
!= MEM_TYPE_NON_LISP
)
1079 mem_insert (val
, (char *) val
+ nbytes
, type
);
1086 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
1091 lisp_align_free (block
)
1092 POINTER_TYPE
*block
;
1094 struct ablock
*ablock
= block
;
1095 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1098 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1099 mem_delete (mem_find (block
));
1101 /* Put on free list. */
1102 ablock
->x
.next_free
= free_ablock
;
1103 free_ablock
= ablock
;
1104 /* Update busy count. */
1105 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
1107 if (2 > (long) ABLOCKS_BUSY (abase
))
1108 { /* All the blocks are free. */
1109 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
1110 struct ablock
**tem
= &free_ablock
;
1111 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1115 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1118 *tem
= (*tem
)->x
.next_free
;
1121 tem
= &(*tem
)->x
.next_free
;
1123 eassert ((aligned
& 1) == aligned
);
1124 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1125 #ifdef USE_POSIX_MEMALIGN
1126 eassert ((unsigned long)ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1128 free (ABLOCKS_BASE (abase
));
1133 /* Return a new buffer structure allocated from the heap with
1134 a call to lisp_malloc. */
1140 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1146 #ifndef SYSTEM_MALLOC
1148 /* Arranging to disable input signals while we're in malloc.
1150 This only works with GNU malloc. To help out systems which can't
1151 use GNU malloc, all the calls to malloc, realloc, and free
1152 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1153 pair; unfortunately, we have no idea what C library functions
1154 might call malloc, so we can't really protect them unless you're
1155 using GNU malloc. Fortunately, most of the major operating systems
1156 can use GNU malloc. */
1160 #ifndef DOUG_LEA_MALLOC
1161 extern void * (*__malloc_hook
) P_ ((size_t, const void *));
1162 extern void * (*__realloc_hook
) P_ ((void *, size_t, const void *));
1163 extern void (*__free_hook
) P_ ((void *, const void *));
1164 /* Else declared in malloc.h, perhaps with an extra arg. */
1165 #endif /* DOUG_LEA_MALLOC */
1166 static void * (*old_malloc_hook
) P_ ((size_t, const void *));
1167 static void * (*old_realloc_hook
) P_ ((void *, size_t, const void*));
1168 static void (*old_free_hook
) P_ ((void*, const void*));
1170 /* This function is used as the hook for free to call. */
1173 emacs_blocked_free (ptr
, ptr2
)
1177 EMACS_INT bytes_used_now
;
1181 #ifdef GC_MALLOC_CHECK
1187 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1190 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1195 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1199 #endif /* GC_MALLOC_CHECK */
1201 __free_hook
= old_free_hook
;
1204 /* If we released our reserve (due to running out of memory),
1205 and we have a fair amount free once again,
1206 try to set aside another reserve in case we run out once more. */
1207 if (! NILP (Vmemory_full
)
1208 /* Verify there is enough space that even with the malloc
1209 hysteresis this call won't run out again.
1210 The code here is correct as long as SPARE_MEMORY
1211 is substantially larger than the block size malloc uses. */
1212 && (bytes_used_when_full
1213 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1214 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1215 refill_memory_reserve ();
1217 __free_hook
= emacs_blocked_free
;
1218 UNBLOCK_INPUT_ALLOC
;
1222 /* This function is the malloc hook that Emacs uses. */
1225 emacs_blocked_malloc (size
, ptr
)
1232 __malloc_hook
= old_malloc_hook
;
1233 #ifdef DOUG_LEA_MALLOC
1234 mallopt (M_TOP_PAD
, malloc_hysteresis
* 4096);
1236 __malloc_extra_blocks
= malloc_hysteresis
;
1239 value
= (void *) malloc (size
);
1241 #ifdef GC_MALLOC_CHECK
1243 struct mem_node
*m
= mem_find (value
);
1246 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1248 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1249 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1254 if (!dont_register_blocks
)
1256 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1257 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1260 #endif /* GC_MALLOC_CHECK */
1262 __malloc_hook
= emacs_blocked_malloc
;
1263 UNBLOCK_INPUT_ALLOC
;
1265 /* fprintf (stderr, "%p malloc\n", value); */
1270 /* This function is the realloc hook that Emacs uses. */
1273 emacs_blocked_realloc (ptr
, size
, ptr2
)
1281 __realloc_hook
= old_realloc_hook
;
1283 #ifdef GC_MALLOC_CHECK
1286 struct mem_node
*m
= mem_find (ptr
);
1287 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1290 "Realloc of %p which wasn't allocated with malloc\n",
1298 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1300 /* Prevent malloc from registering blocks. */
1301 dont_register_blocks
= 1;
1302 #endif /* GC_MALLOC_CHECK */
1304 value
= (void *) realloc (ptr
, size
);
1306 #ifdef GC_MALLOC_CHECK
1307 dont_register_blocks
= 0;
1310 struct mem_node
*m
= mem_find (value
);
1313 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1317 /* Can't handle zero size regions in the red-black tree. */
1318 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1321 /* fprintf (stderr, "%p <- realloc\n", value); */
1322 #endif /* GC_MALLOC_CHECK */
1324 __realloc_hook
= emacs_blocked_realloc
;
1325 UNBLOCK_INPUT_ALLOC
;
1331 #ifdef HAVE_GTK_AND_PTHREAD
1332 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1333 normal malloc. Some thread implementations need this as they call
1334 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1335 calls malloc because it is the first call, and we have an endless loop. */
1338 reset_malloc_hooks ()
1344 #endif /* HAVE_GTK_AND_PTHREAD */
1347 /* Called from main to set up malloc to use our hooks. */
1350 uninterrupt_malloc ()
1352 #ifdef HAVE_GTK_AND_PTHREAD
1353 pthread_mutexattr_t attr
;
1355 /* GLIBC has a faster way to do this, but lets keep it portable.
1356 This is according to the Single UNIX Specification. */
1357 pthread_mutexattr_init (&attr
);
1358 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1359 pthread_mutex_init (&alloc_mutex
, &attr
);
1360 #endif /* HAVE_GTK_AND_PTHREAD */
1362 if (__free_hook
!= emacs_blocked_free
)
1363 old_free_hook
= __free_hook
;
1364 __free_hook
= emacs_blocked_free
;
1366 if (__malloc_hook
!= emacs_blocked_malloc
)
1367 old_malloc_hook
= __malloc_hook
;
1368 __malloc_hook
= emacs_blocked_malloc
;
1370 if (__realloc_hook
!= emacs_blocked_realloc
)
1371 old_realloc_hook
= __realloc_hook
;
1372 __realloc_hook
= emacs_blocked_realloc
;
1375 #endif /* not SYNC_INPUT */
1376 #endif /* not SYSTEM_MALLOC */
1380 /***********************************************************************
1382 ***********************************************************************/
1384 /* Number of intervals allocated in an interval_block structure.
1385 The 1020 is 1024 minus malloc overhead. */
1387 #define INTERVAL_BLOCK_SIZE \
1388 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1390 /* Intervals are allocated in chunks in form of an interval_block
1393 struct interval_block
1395 /* Place `intervals' first, to preserve alignment. */
1396 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1397 struct interval_block
*next
;
1400 /* Current interval block. Its `next' pointer points to older
1403 struct interval_block
*interval_block
;
1405 /* Index in interval_block above of the next unused interval
1408 static int interval_block_index
;
1410 /* Number of free and live intervals. */
1412 static int total_free_intervals
, total_intervals
;
1414 /* List of free intervals. */
1416 INTERVAL interval_free_list
;
1418 /* Total number of interval blocks now in use. */
1420 int n_interval_blocks
;
1423 /* Initialize interval allocation. */
1428 interval_block
= NULL
;
1429 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1430 interval_free_list
= 0;
1431 n_interval_blocks
= 0;
1435 /* Return a new interval. */
1442 /* eassert (!handling_signal); */
1448 if (interval_free_list
)
1450 val
= interval_free_list
;
1451 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1455 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1457 register struct interval_block
*newi
;
1459 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1462 newi
->next
= interval_block
;
1463 interval_block
= newi
;
1464 interval_block_index
= 0;
1465 n_interval_blocks
++;
1467 val
= &interval_block
->intervals
[interval_block_index
++];
1474 consing_since_gc
+= sizeof (struct interval
);
1476 RESET_INTERVAL (val
);
1482 /* Mark Lisp objects in interval I. */
1485 mark_interval (i
, dummy
)
1486 register INTERVAL i
;
1489 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1491 mark_object (i
->plist
);
1495 /* Mark the interval tree rooted in TREE. Don't call this directly;
1496 use the macro MARK_INTERVAL_TREE instead. */
1499 mark_interval_tree (tree
)
1500 register INTERVAL tree
;
1502 /* No need to test if this tree has been marked already; this
1503 function is always called through the MARK_INTERVAL_TREE macro,
1504 which takes care of that. */
1506 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1510 /* Mark the interval tree rooted in I. */
1512 #define MARK_INTERVAL_TREE(i) \
1514 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1515 mark_interval_tree (i); \
1519 #define UNMARK_BALANCE_INTERVALS(i) \
1521 if (! NULL_INTERVAL_P (i)) \
1522 (i) = balance_intervals (i); \
1526 /* Number support. If NO_UNION_TYPE isn't in effect, we
1527 can't create number objects in macros. */
1535 obj
.s
.type
= Lisp_Int
;
1540 /***********************************************************************
1542 ***********************************************************************/
1544 /* Lisp_Strings are allocated in string_block structures. When a new
1545 string_block is allocated, all the Lisp_Strings it contains are
1546 added to a free-list string_free_list. When a new Lisp_String is
1547 needed, it is taken from that list. During the sweep phase of GC,
1548 string_blocks that are entirely free are freed, except two which
1551 String data is allocated from sblock structures. Strings larger
1552 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1553 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1555 Sblocks consist internally of sdata structures, one for each
1556 Lisp_String. The sdata structure points to the Lisp_String it
1557 belongs to. The Lisp_String points back to the `u.data' member of
1558 its sdata structure.
1560 When a Lisp_String is freed during GC, it is put back on
1561 string_free_list, and its `data' member and its sdata's `string'
1562 pointer is set to null. The size of the string is recorded in the
1563 `u.nbytes' member of the sdata. So, sdata structures that are no
1564 longer used, can be easily recognized, and it's easy to compact the
1565 sblocks of small strings which we do in compact_small_strings. */
1567 /* Size in bytes of an sblock structure used for small strings. This
1568 is 8192 minus malloc overhead. */
1570 #define SBLOCK_SIZE 8188
1572 /* Strings larger than this are considered large strings. String data
1573 for large strings is allocated from individual sblocks. */
1575 #define LARGE_STRING_BYTES 1024
1577 /* Structure describing string memory sub-allocated from an sblock.
1578 This is where the contents of Lisp strings are stored. */
1582 /* Back-pointer to the string this sdata belongs to. If null, this
1583 structure is free, and the NBYTES member of the union below
1584 contains the string's byte size (the same value that STRING_BYTES
1585 would return if STRING were non-null). If non-null, STRING_BYTES
1586 (STRING) is the size of the data, and DATA contains the string's
1588 struct Lisp_String
*string
;
1590 #ifdef GC_CHECK_STRING_BYTES
1593 unsigned char data
[1];
1595 #define SDATA_NBYTES(S) (S)->nbytes
1596 #define SDATA_DATA(S) (S)->data
1598 #else /* not GC_CHECK_STRING_BYTES */
1602 /* When STRING in non-null. */
1603 unsigned char data
[1];
1605 /* When STRING is null. */
1610 #define SDATA_NBYTES(S) (S)->u.nbytes
1611 #define SDATA_DATA(S) (S)->u.data
1613 #endif /* not GC_CHECK_STRING_BYTES */
1617 /* Structure describing a block of memory which is sub-allocated to
1618 obtain string data memory for strings. Blocks for small strings
1619 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1620 as large as needed. */
1625 struct sblock
*next
;
1627 /* Pointer to the next free sdata block. This points past the end
1628 of the sblock if there isn't any space left in this block. */
1629 struct sdata
*next_free
;
1631 /* Start of data. */
1632 struct sdata first_data
;
1635 /* Number of Lisp strings in a string_block structure. The 1020 is
1636 1024 minus malloc overhead. */
1638 #define STRING_BLOCK_SIZE \
1639 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1641 /* Structure describing a block from which Lisp_String structures
1646 /* Place `strings' first, to preserve alignment. */
1647 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1648 struct string_block
*next
;
1651 /* Head and tail of the list of sblock structures holding Lisp string
1652 data. We always allocate from current_sblock. The NEXT pointers
1653 in the sblock structures go from oldest_sblock to current_sblock. */
1655 static struct sblock
*oldest_sblock
, *current_sblock
;
1657 /* List of sblocks for large strings. */
1659 static struct sblock
*large_sblocks
;
1661 /* List of string_block structures, and how many there are. */
1663 static struct string_block
*string_blocks
;
1664 static int n_string_blocks
;
1666 /* Free-list of Lisp_Strings. */
1668 static struct Lisp_String
*string_free_list
;
1670 /* Number of live and free Lisp_Strings. */
1672 static int total_strings
, total_free_strings
;
1674 /* Number of bytes used by live strings. */
1676 static int total_string_size
;
1678 /* Given a pointer to a Lisp_String S which is on the free-list
1679 string_free_list, return a pointer to its successor in the
1682 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1684 /* Return a pointer to the sdata structure belonging to Lisp string S.
1685 S must be live, i.e. S->data must not be null. S->data is actually
1686 a pointer to the `u.data' member of its sdata structure; the
1687 structure starts at a constant offset in front of that. */
1689 #ifdef GC_CHECK_STRING_BYTES
1691 #define SDATA_OF_STRING(S) \
1692 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1693 - sizeof (EMACS_INT)))
1695 #else /* not GC_CHECK_STRING_BYTES */
1697 #define SDATA_OF_STRING(S) \
1698 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1700 #endif /* not GC_CHECK_STRING_BYTES */
1703 #ifdef GC_CHECK_STRING_OVERRUN
1705 /* We check for overrun in string data blocks by appending a small
1706 "cookie" after each allocated string data block, and check for the
1707 presence of this cookie during GC. */
1709 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1710 static char string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1711 { 0xde, 0xad, 0xbe, 0xef };
1714 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1717 /* Value is the size of an sdata structure large enough to hold NBYTES
1718 bytes of string data. The value returned includes a terminating
1719 NUL byte, the size of the sdata structure, and padding. */
1721 #ifdef GC_CHECK_STRING_BYTES
1723 #define SDATA_SIZE(NBYTES) \
1724 ((sizeof (struct Lisp_String *) \
1726 + sizeof (EMACS_INT) \
1727 + sizeof (EMACS_INT) - 1) \
1728 & ~(sizeof (EMACS_INT) - 1))
1730 #else /* not GC_CHECK_STRING_BYTES */
1732 #define SDATA_SIZE(NBYTES) \
1733 ((sizeof (struct Lisp_String *) \
1735 + sizeof (EMACS_INT) - 1) \
1736 & ~(sizeof (EMACS_INT) - 1))
1738 #endif /* not GC_CHECK_STRING_BYTES */
1740 /* Extra bytes to allocate for each string. */
1742 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1744 /* Initialize string allocation. Called from init_alloc_once. */
1749 total_strings
= total_free_strings
= total_string_size
= 0;
1750 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1751 string_blocks
= NULL
;
1752 n_string_blocks
= 0;
1753 string_free_list
= NULL
;
1757 #ifdef GC_CHECK_STRING_BYTES
1759 static int check_string_bytes_count
;
1761 void check_string_bytes
P_ ((int));
1762 void check_sblock
P_ ((struct sblock
*));
1764 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1767 /* Like GC_STRING_BYTES, but with debugging check. */
1771 struct Lisp_String
*s
;
1773 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1774 if (!PURE_POINTER_P (s
)
1776 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1781 /* Check validity of Lisp strings' string_bytes member in B. */
1787 struct sdata
*from
, *end
, *from_end
;
1791 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1793 /* Compute the next FROM here because copying below may
1794 overwrite data we need to compute it. */
1797 /* Check that the string size recorded in the string is the
1798 same as the one recorded in the sdata structure. */
1800 CHECK_STRING_BYTES (from
->string
);
1803 nbytes
= GC_STRING_BYTES (from
->string
);
1805 nbytes
= SDATA_NBYTES (from
);
1807 nbytes
= SDATA_SIZE (nbytes
);
1808 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1813 /* Check validity of Lisp strings' string_bytes member. ALL_P
1814 non-zero means check all strings, otherwise check only most
1815 recently allocated strings. Used for hunting a bug. */
1818 check_string_bytes (all_p
)
1825 for (b
= large_sblocks
; b
; b
= b
->next
)
1827 struct Lisp_String
*s
= b
->first_data
.string
;
1829 CHECK_STRING_BYTES (s
);
1832 for (b
= oldest_sblock
; b
; b
= b
->next
)
1836 check_sblock (current_sblock
);
1839 #endif /* GC_CHECK_STRING_BYTES */
1841 #ifdef GC_CHECK_STRING_FREE_LIST
1843 /* Walk through the string free list looking for bogus next pointers.
1844 This may catch buffer overrun from a previous string. */
1847 check_string_free_list ()
1849 struct Lisp_String
*s
;
1851 /* Pop a Lisp_String off the free-list. */
1852 s
= string_free_list
;
1855 if ((unsigned)s
< 1024)
1857 s
= NEXT_FREE_LISP_STRING (s
);
1861 #define check_string_free_list()
1864 /* Return a new Lisp_String. */
1866 static struct Lisp_String
*
1869 struct Lisp_String
*s
;
1871 /* eassert (!handling_signal); */
1877 /* If the free-list is empty, allocate a new string_block, and
1878 add all the Lisp_Strings in it to the free-list. */
1879 if (string_free_list
== NULL
)
1881 struct string_block
*b
;
1884 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1885 bzero (b
, sizeof *b
);
1886 b
->next
= string_blocks
;
1890 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1893 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1894 string_free_list
= s
;
1897 total_free_strings
+= STRING_BLOCK_SIZE
;
1900 check_string_free_list ();
1902 /* Pop a Lisp_String off the free-list. */
1903 s
= string_free_list
;
1904 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1910 /* Probably not strictly necessary, but play it safe. */
1911 bzero (s
, sizeof *s
);
1913 --total_free_strings
;
1916 consing_since_gc
+= sizeof *s
;
1918 #ifdef GC_CHECK_STRING_BYTES
1925 if (++check_string_bytes_count
== 200)
1927 check_string_bytes_count
= 0;
1928 check_string_bytes (1);
1931 check_string_bytes (0);
1933 #endif /* GC_CHECK_STRING_BYTES */
1939 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1940 plus a NUL byte at the end. Allocate an sdata structure for S, and
1941 set S->data to its `u.data' member. Store a NUL byte at the end of
1942 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1943 S->data if it was initially non-null. */
1946 allocate_string_data (s
, nchars
, nbytes
)
1947 struct Lisp_String
*s
;
1950 struct sdata
*data
, *old_data
;
1952 int needed
, old_nbytes
;
1954 /* Determine the number of bytes needed to store NBYTES bytes
1956 needed
= SDATA_SIZE (nbytes
);
1957 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1958 old_nbytes
= GC_STRING_BYTES (s
);
1964 if (nbytes
> LARGE_STRING_BYTES
)
1966 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1968 #ifdef DOUG_LEA_MALLOC
1969 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1970 because mapped region contents are not preserved in
1973 In case you think of allowing it in a dumped Emacs at the
1974 cost of not being able to re-dump, there's another reason:
1975 mmap'ed data typically have an address towards the top of the
1976 address space, which won't fit into an EMACS_INT (at least on
1977 32-bit systems with the current tagging scheme). --fx */
1979 mallopt (M_MMAP_MAX
, 0);
1983 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1985 #ifdef DOUG_LEA_MALLOC
1986 /* Back to a reasonable maximum of mmap'ed areas. */
1988 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1992 b
->next_free
= &b
->first_data
;
1993 b
->first_data
.string
= NULL
;
1994 b
->next
= large_sblocks
;
1997 else if (current_sblock
== NULL
1998 || (((char *) current_sblock
+ SBLOCK_SIZE
1999 - (char *) current_sblock
->next_free
)
2000 < (needed
+ GC_STRING_EXTRA
)))
2002 /* Not enough room in the current sblock. */
2003 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
2004 b
->next_free
= &b
->first_data
;
2005 b
->first_data
.string
= NULL
;
2009 current_sblock
->next
= b
;
2017 data
= b
->next_free
;
2018 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
2025 s
->data
= SDATA_DATA (data
);
2026 #ifdef GC_CHECK_STRING_BYTES
2027 SDATA_NBYTES (data
) = nbytes
;
2030 s
->size_byte
= nbytes
;
2031 s
->data
[nbytes
] = '\0';
2032 #ifdef GC_CHECK_STRING_OVERRUN
2033 bcopy (string_overrun_cookie
, (char *) data
+ needed
,
2034 GC_STRING_OVERRUN_COOKIE_SIZE
);
2037 /* If S had already data assigned, mark that as free by setting its
2038 string back-pointer to null, and recording the size of the data
2042 SDATA_NBYTES (old_data
) = old_nbytes
;
2043 old_data
->string
= NULL
;
2046 consing_since_gc
+= needed
;
2050 /* Sweep and compact strings. */
2055 struct string_block
*b
, *next
;
2056 struct string_block
*live_blocks
= NULL
;
2058 string_free_list
= NULL
;
2059 total_strings
= total_free_strings
= 0;
2060 total_string_size
= 0;
2062 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2063 for (b
= string_blocks
; b
; b
= next
)
2066 struct Lisp_String
*free_list_before
= string_free_list
;
2070 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2072 struct Lisp_String
*s
= b
->strings
+ i
;
2076 /* String was not on free-list before. */
2077 if (STRING_MARKED_P (s
))
2079 /* String is live; unmark it and its intervals. */
2082 if (!NULL_INTERVAL_P (s
->intervals
))
2083 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2086 total_string_size
+= STRING_BYTES (s
);
2090 /* String is dead. Put it on the free-list. */
2091 struct sdata
*data
= SDATA_OF_STRING (s
);
2093 /* Save the size of S in its sdata so that we know
2094 how large that is. Reset the sdata's string
2095 back-pointer so that we know it's free. */
2096 #ifdef GC_CHECK_STRING_BYTES
2097 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2100 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2102 data
->string
= NULL
;
2104 /* Reset the strings's `data' member so that we
2108 /* Put the string on the free-list. */
2109 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2110 string_free_list
= s
;
2116 /* S was on the free-list before. Put it there again. */
2117 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2118 string_free_list
= s
;
2123 /* Free blocks that contain free Lisp_Strings only, except
2124 the first two of them. */
2125 if (nfree
== STRING_BLOCK_SIZE
2126 && total_free_strings
> STRING_BLOCK_SIZE
)
2130 string_free_list
= free_list_before
;
2134 total_free_strings
+= nfree
;
2135 b
->next
= live_blocks
;
2140 check_string_free_list ();
2142 string_blocks
= live_blocks
;
2143 free_large_strings ();
2144 compact_small_strings ();
2146 check_string_free_list ();
2150 /* Free dead large strings. */
2153 free_large_strings ()
2155 struct sblock
*b
, *next
;
2156 struct sblock
*live_blocks
= NULL
;
2158 for (b
= large_sblocks
; b
; b
= next
)
2162 if (b
->first_data
.string
== NULL
)
2166 b
->next
= live_blocks
;
2171 large_sblocks
= live_blocks
;
2175 /* Compact data of small strings. Free sblocks that don't contain
2176 data of live strings after compaction. */
2179 compact_small_strings ()
2181 struct sblock
*b
, *tb
, *next
;
2182 struct sdata
*from
, *to
, *end
, *tb_end
;
2183 struct sdata
*to_end
, *from_end
;
2185 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2186 to, and TB_END is the end of TB. */
2188 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2189 to
= &tb
->first_data
;
2191 /* Step through the blocks from the oldest to the youngest. We
2192 expect that old blocks will stabilize over time, so that less
2193 copying will happen this way. */
2194 for (b
= oldest_sblock
; b
; b
= b
->next
)
2197 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2199 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2201 /* Compute the next FROM here because copying below may
2202 overwrite data we need to compute it. */
2205 #ifdef GC_CHECK_STRING_BYTES
2206 /* Check that the string size recorded in the string is the
2207 same as the one recorded in the sdata structure. */
2209 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2211 #endif /* GC_CHECK_STRING_BYTES */
2214 nbytes
= GC_STRING_BYTES (from
->string
);
2216 nbytes
= SDATA_NBYTES (from
);
2218 if (nbytes
> LARGE_STRING_BYTES
)
2221 nbytes
= SDATA_SIZE (nbytes
);
2222 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2224 #ifdef GC_CHECK_STRING_OVERRUN
2225 if (bcmp (string_overrun_cookie
,
2226 ((char *) from_end
) - GC_STRING_OVERRUN_COOKIE_SIZE
,
2227 GC_STRING_OVERRUN_COOKIE_SIZE
))
2231 /* FROM->string non-null means it's alive. Copy its data. */
2234 /* If TB is full, proceed with the next sblock. */
2235 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2236 if (to_end
> tb_end
)
2240 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2241 to
= &tb
->first_data
;
2242 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2245 /* Copy, and update the string's `data' pointer. */
2248 xassert (tb
!= b
|| to
<= from
);
2249 safe_bcopy ((char *) from
, (char *) to
, nbytes
+ GC_STRING_EXTRA
);
2250 to
->string
->data
= SDATA_DATA (to
);
2253 /* Advance past the sdata we copied to. */
2259 /* The rest of the sblocks following TB don't contain live data, so
2260 we can free them. */
2261 for (b
= tb
->next
; b
; b
= next
)
2269 current_sblock
= tb
;
2273 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2274 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2275 LENGTH must be an integer.
2276 INIT must be an integer that represents a character. */)
2278 Lisp_Object length
, init
;
2280 register Lisp_Object val
;
2281 register unsigned char *p
, *end
;
2284 CHECK_NATNUM (length
);
2285 CHECK_NUMBER (init
);
2288 if (SINGLE_BYTE_CHAR_P (c
))
2290 nbytes
= XINT (length
);
2291 val
= make_uninit_string (nbytes
);
2293 end
= p
+ SCHARS (val
);
2299 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2300 int len
= CHAR_STRING (c
, str
);
2302 nbytes
= len
* XINT (length
);
2303 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
2308 bcopy (str
, p
, len
);
2318 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2319 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2320 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2322 Lisp_Object length
, init
;
2324 register Lisp_Object val
;
2325 struct Lisp_Bool_Vector
*p
;
2327 int length_in_chars
, length_in_elts
, bits_per_value
;
2329 CHECK_NATNUM (length
);
2331 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2333 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2334 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2335 / BOOL_VECTOR_BITS_PER_CHAR
);
2337 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2338 slot `size' of the struct Lisp_Bool_Vector. */
2339 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2340 p
= XBOOL_VECTOR (val
);
2342 /* Get rid of any bits that would cause confusion. */
2344 XSETBOOL_VECTOR (val
, p
);
2345 p
->size
= XFASTINT (length
);
2347 real_init
= (NILP (init
) ? 0 : -1);
2348 for (i
= 0; i
< length_in_chars
; i
++)
2349 p
->data
[i
] = real_init
;
2351 /* Clear the extraneous bits in the last byte. */
2352 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2353 XBOOL_VECTOR (val
)->data
[length_in_chars
- 1]
2354 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2360 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2361 of characters from the contents. This string may be unibyte or
2362 multibyte, depending on the contents. */
2365 make_string (contents
, nbytes
)
2366 const char *contents
;
2369 register Lisp_Object val
;
2370 int nchars
, multibyte_nbytes
;
2372 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
2373 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2374 /* CONTENTS contains no multibyte sequences or contains an invalid
2375 multibyte sequence. We must make unibyte string. */
2376 val
= make_unibyte_string (contents
, nbytes
);
2378 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2383 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2386 make_unibyte_string (contents
, length
)
2387 const char *contents
;
2390 register Lisp_Object val
;
2391 val
= make_uninit_string (length
);
2392 bcopy (contents
, SDATA (val
), length
);
2393 STRING_SET_UNIBYTE (val
);
2398 /* Make a multibyte string from NCHARS characters occupying NBYTES
2399 bytes at CONTENTS. */
2402 make_multibyte_string (contents
, nchars
, nbytes
)
2403 const char *contents
;
2406 register Lisp_Object val
;
2407 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2408 bcopy (contents
, SDATA (val
), nbytes
);
2413 /* Make a string from NCHARS characters occupying NBYTES bytes at
2414 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2417 make_string_from_bytes (contents
, nchars
, nbytes
)
2418 const char *contents
;
2421 register Lisp_Object val
;
2422 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2423 bcopy (contents
, SDATA (val
), nbytes
);
2424 if (SBYTES (val
) == SCHARS (val
))
2425 STRING_SET_UNIBYTE (val
);
2430 /* Make a string from NCHARS characters occupying NBYTES bytes at
2431 CONTENTS. The argument MULTIBYTE controls whether to label the
2432 string as multibyte. If NCHARS is negative, it counts the number of
2433 characters by itself. */
2436 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2437 const char *contents
;
2441 register Lisp_Object val
;
2446 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2450 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2451 bcopy (contents
, SDATA (val
), nbytes
);
2453 STRING_SET_UNIBYTE (val
);
2458 /* Make a string from the data at STR, treating it as multibyte if the
2465 return make_string (str
, strlen (str
));
2469 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2470 occupying LENGTH bytes. */
2473 make_uninit_string (length
)
2477 val
= make_uninit_multibyte_string (length
, length
);
2478 STRING_SET_UNIBYTE (val
);
2483 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2484 which occupy NBYTES bytes. */
2487 make_uninit_multibyte_string (nchars
, nbytes
)
2491 struct Lisp_String
*s
;
2496 s
= allocate_string ();
2497 allocate_string_data (s
, nchars
, nbytes
);
2498 XSETSTRING (string
, s
);
2499 string_chars_consed
+= nbytes
;
2505 /***********************************************************************
2507 ***********************************************************************/
2509 /* We store float cells inside of float_blocks, allocating a new
2510 float_block with malloc whenever necessary. Float cells reclaimed
2511 by GC are put on a free list to be reallocated before allocating
2512 any new float cells from the latest float_block. */
2514 #define FLOAT_BLOCK_SIZE \
2515 (((BLOCK_BYTES - sizeof (struct float_block *) \
2516 /* The compiler might add padding at the end. */ \
2517 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2518 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2520 #define GETMARKBIT(block,n) \
2521 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2522 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2525 #define SETMARKBIT(block,n) \
2526 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2527 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2529 #define UNSETMARKBIT(block,n) \
2530 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2531 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2533 #define FLOAT_BLOCK(fptr) \
2534 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2536 #define FLOAT_INDEX(fptr) \
2537 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2541 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2542 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2543 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2544 struct float_block
*next
;
2547 #define FLOAT_MARKED_P(fptr) \
2548 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2550 #define FLOAT_MARK(fptr) \
2551 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2553 #define FLOAT_UNMARK(fptr) \
2554 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2556 /* Current float_block. */
2558 struct float_block
*float_block
;
2560 /* Index of first unused Lisp_Float in the current float_block. */
2562 int float_block_index
;
2564 /* Total number of float blocks now in use. */
2568 /* Free-list of Lisp_Floats. */
2570 struct Lisp_Float
*float_free_list
;
2573 /* Initialize float allocation. */
2579 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2580 float_free_list
= 0;
2585 /* Explicitly free a float cell by putting it on the free-list. */
2589 struct Lisp_Float
*ptr
;
2591 ptr
->u
.chain
= float_free_list
;
2592 float_free_list
= ptr
;
2596 /* Return a new float object with value FLOAT_VALUE. */
2599 make_float (float_value
)
2602 register Lisp_Object val
;
2604 /* eassert (!handling_signal); */
2610 if (float_free_list
)
2612 /* We use the data field for chaining the free list
2613 so that we won't use the same field that has the mark bit. */
2614 XSETFLOAT (val
, float_free_list
);
2615 float_free_list
= float_free_list
->u
.chain
;
2619 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2621 register struct float_block
*new;
2623 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2625 new->next
= float_block
;
2626 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2628 float_block_index
= 0;
2631 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2632 float_block_index
++;
2639 XFLOAT_DATA (val
) = float_value
;
2640 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2641 consing_since_gc
+= sizeof (struct Lisp_Float
);
2648 /***********************************************************************
2650 ***********************************************************************/
2652 /* We store cons cells inside of cons_blocks, allocating a new
2653 cons_block with malloc whenever necessary. Cons cells reclaimed by
2654 GC are put on a free list to be reallocated before allocating
2655 any new cons cells from the latest cons_block. */
2657 #define CONS_BLOCK_SIZE \
2658 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2659 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2661 #define CONS_BLOCK(fptr) \
2662 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2664 #define CONS_INDEX(fptr) \
2665 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2669 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2670 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2671 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2672 struct cons_block
*next
;
2675 #define CONS_MARKED_P(fptr) \
2676 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2678 #define CONS_MARK(fptr) \
2679 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2681 #define CONS_UNMARK(fptr) \
2682 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2684 /* Current cons_block. */
2686 struct cons_block
*cons_block
;
2688 /* Index of first unused Lisp_Cons in the current block. */
2690 int cons_block_index
;
2692 /* Free-list of Lisp_Cons structures. */
2694 struct Lisp_Cons
*cons_free_list
;
2696 /* Total number of cons blocks now in use. */
2701 /* Initialize cons allocation. */
2707 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2713 /* Explicitly free a cons cell by putting it on the free-list. */
2717 struct Lisp_Cons
*ptr
;
2719 ptr
->u
.chain
= cons_free_list
;
2723 cons_free_list
= ptr
;
2726 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2727 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2729 Lisp_Object car
, cdr
;
2731 register Lisp_Object val
;
2733 /* eassert (!handling_signal); */
2741 /* We use the cdr for chaining the free list
2742 so that we won't use the same field that has the mark bit. */
2743 XSETCONS (val
, cons_free_list
);
2744 cons_free_list
= cons_free_list
->u
.chain
;
2748 if (cons_block_index
== CONS_BLOCK_SIZE
)
2750 register struct cons_block
*new;
2751 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2753 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2754 new->next
= cons_block
;
2756 cons_block_index
= 0;
2759 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2769 eassert (!CONS_MARKED_P (XCONS (val
)));
2770 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2771 cons_cells_consed
++;
2775 /* Get an error now if there's any junk in the cons free list. */
2779 #ifdef GC_CHECK_CONS_LIST
2780 struct Lisp_Cons
*tail
= cons_free_list
;
2783 tail
= tail
->u
.chain
;
2787 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2793 return Fcons (arg1
, Qnil
);
2798 Lisp_Object arg1
, arg2
;
2800 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2805 list3 (arg1
, arg2
, arg3
)
2806 Lisp_Object arg1
, arg2
, arg3
;
2808 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2813 list4 (arg1
, arg2
, arg3
, arg4
)
2814 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2816 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2821 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2822 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2824 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2825 Fcons (arg5
, Qnil
)))));
2829 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2830 doc
: /* Return a newly created list with specified arguments as elements.
2831 Any number of arguments, even zero arguments, are allowed.
2832 usage: (list &rest OBJECTS) */)
2835 register Lisp_Object
*args
;
2837 register Lisp_Object val
;
2843 val
= Fcons (args
[nargs
], val
);
2849 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2850 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2852 register Lisp_Object length
, init
;
2854 register Lisp_Object val
;
2857 CHECK_NATNUM (length
);
2858 size
= XFASTINT (length
);
2863 val
= Fcons (init
, val
);
2868 val
= Fcons (init
, val
);
2873 val
= Fcons (init
, val
);
2878 val
= Fcons (init
, val
);
2883 val
= Fcons (init
, val
);
2898 /***********************************************************************
2900 ***********************************************************************/
2902 /* Singly-linked list of all vectors. */
2904 struct Lisp_Vector
*all_vectors
;
2906 /* Total number of vector-like objects now in use. */
2911 /* Value is a pointer to a newly allocated Lisp_Vector structure
2912 with room for LEN Lisp_Objects. */
2914 static struct Lisp_Vector
*
2915 allocate_vectorlike (len
, type
)
2919 struct Lisp_Vector
*p
;
2922 #ifdef DOUG_LEA_MALLOC
2923 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2924 because mapped region contents are not preserved in
2927 mallopt (M_MMAP_MAX
, 0);
2931 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2932 /* eassert (!handling_signal); */
2934 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2935 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, type
);
2937 #ifdef DOUG_LEA_MALLOC
2938 /* Back to a reasonable maximum of mmap'ed areas. */
2940 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2944 consing_since_gc
+= nbytes
;
2945 vector_cells_consed
+= len
;
2951 p
->next
= all_vectors
;
2963 /* Allocate a vector with NSLOTS slots. */
2965 struct Lisp_Vector
*
2966 allocate_vector (nslots
)
2969 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
, MEM_TYPE_VECTOR
);
2975 /* Allocate other vector-like structures. */
2977 struct Lisp_Hash_Table
*
2978 allocate_hash_table ()
2980 EMACS_INT len
= VECSIZE (struct Lisp_Hash_Table
);
2981 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_HASH_TABLE
);
2985 for (i
= 0; i
< len
; ++i
)
2986 v
->contents
[i
] = Qnil
;
2988 return (struct Lisp_Hash_Table
*) v
;
2995 EMACS_INT len
= VECSIZE (struct window
);
2996 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_WINDOW
);
2999 for (i
= 0; i
< len
; ++i
)
3000 v
->contents
[i
] = Qnil
;
3003 return (struct window
*) v
;
3010 EMACS_INT len
= VECSIZE (struct frame
);
3011 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_FRAME
);
3014 for (i
= 0; i
< len
; ++i
)
3015 v
->contents
[i
] = make_number (0);
3017 return (struct frame
*) v
;
3021 struct Lisp_Process
*
3024 /* Memory-footprint of the object in nb of Lisp_Object fields. */
3025 EMACS_INT memlen
= VECSIZE (struct Lisp_Process
);
3026 /* Size if we only count the actual Lisp_Object fields (which need to be
3027 traced by the GC). */
3028 EMACS_INT lisplen
= PSEUDOVECSIZE (struct Lisp_Process
, pid
);
3029 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
, MEM_TYPE_PROCESS
);
3032 for (i
= 0; i
< lisplen
; ++i
)
3033 v
->contents
[i
] = Qnil
;
3036 return (struct Lisp_Process
*) v
;
3040 struct Lisp_Vector
*
3041 allocate_other_vector (len
)
3044 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_VECTOR
);
3047 for (i
= 0; i
< len
; ++i
)
3048 v
->contents
[i
] = Qnil
;
3055 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3056 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3057 See also the function `vector'. */)
3059 register Lisp_Object length
, init
;
3062 register EMACS_INT sizei
;
3064 register struct Lisp_Vector
*p
;
3066 CHECK_NATNUM (length
);
3067 sizei
= XFASTINT (length
);
3069 p
= allocate_vector (sizei
);
3070 for (index
= 0; index
< sizei
; index
++)
3071 p
->contents
[index
] = init
;
3073 XSETVECTOR (vector
, p
);
3078 DEFUN ("make-char-table", Fmake_char_table
, Smake_char_table
, 1, 2, 0,
3079 doc
: /* Return a newly created char-table, with purpose PURPOSE.
3080 Each element is initialized to INIT, which defaults to nil.
3081 PURPOSE should be a symbol which has a `char-table-extra-slots' property.
3082 The property's value should be an integer between 0 and 10. */)
3084 register Lisp_Object purpose
, init
;
3088 CHECK_SYMBOL (purpose
);
3089 n
= Fget (purpose
, Qchar_table_extra_slots
);
3091 if (XINT (n
) < 0 || XINT (n
) > 10)
3092 args_out_of_range (n
, Qnil
);
3093 /* Add 2 to the size for the defalt and parent slots. */
3094 vector
= Fmake_vector (make_number (CHAR_TABLE_STANDARD_SLOTS
+ XINT (n
)),
3096 XCHAR_TABLE (vector
)->top
= Qt
;
3097 XCHAR_TABLE (vector
)->parent
= Qnil
;
3098 XCHAR_TABLE (vector
)->purpose
= purpose
;
3099 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
3104 /* Return a newly created sub char table with slots initialized by INIT.
3105 Since a sub char table does not appear as a top level Emacs Lisp
3106 object, we don't need a Lisp interface to make it. */
3109 make_sub_char_table (init
)
3113 = Fmake_vector (make_number (SUB_CHAR_TABLE_STANDARD_SLOTS
), init
);
3114 XCHAR_TABLE (vector
)->top
= Qnil
;
3115 XCHAR_TABLE (vector
)->defalt
= Qnil
;
3116 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
3121 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3122 doc
: /* Return a newly created vector with specified arguments as elements.
3123 Any number of arguments, even zero arguments, are allowed.
3124 usage: (vector &rest OBJECTS) */)
3129 register Lisp_Object len
, val
;
3131 register struct Lisp_Vector
*p
;
3133 XSETFASTINT (len
, nargs
);
3134 val
= Fmake_vector (len
, Qnil
);
3136 for (index
= 0; index
< nargs
; index
++)
3137 p
->contents
[index
] = args
[index
];
3142 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3143 doc
: /* Create a byte-code object with specified arguments as elements.
3144 The arguments should be the arglist, bytecode-string, constant vector,
3145 stack size, (optional) doc string, and (optional) interactive spec.
3146 The first four arguments are required; at most six have any
3148 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3153 register Lisp_Object len
, val
;
3155 register struct Lisp_Vector
*p
;
3157 XSETFASTINT (len
, nargs
);
3158 if (!NILP (Vpurify_flag
))
3159 val
= make_pure_vector ((EMACS_INT
) nargs
);
3161 val
= Fmake_vector (len
, Qnil
);
3163 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
3164 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3165 earlier because they produced a raw 8-bit string for byte-code
3166 and now such a byte-code string is loaded as multibyte while
3167 raw 8-bit characters converted to multibyte form. Thus, now we
3168 must convert them back to the original unibyte form. */
3169 args
[1] = Fstring_as_unibyte (args
[1]);
3172 for (index
= 0; index
< nargs
; index
++)
3174 if (!NILP (Vpurify_flag
))
3175 args
[index
] = Fpurecopy (args
[index
]);
3176 p
->contents
[index
] = args
[index
];
3178 XSETCOMPILED (val
, p
);
3184 /***********************************************************************
3186 ***********************************************************************/
3188 /* Each symbol_block is just under 1020 bytes long, since malloc
3189 really allocates in units of powers of two and uses 4 bytes for its
3192 #define SYMBOL_BLOCK_SIZE \
3193 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3197 /* Place `symbols' first, to preserve alignment. */
3198 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3199 struct symbol_block
*next
;
3202 /* Current symbol block and index of first unused Lisp_Symbol
3205 struct symbol_block
*symbol_block
;
3206 int symbol_block_index
;
3208 /* List of free symbols. */
3210 struct Lisp_Symbol
*symbol_free_list
;
3212 /* Total number of symbol blocks now in use. */
3214 int n_symbol_blocks
;
3217 /* Initialize symbol allocation. */
3222 symbol_block
= NULL
;
3223 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3224 symbol_free_list
= 0;
3225 n_symbol_blocks
= 0;
3229 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3230 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3231 Its value and function definition are void, and its property list is nil. */)
3235 register Lisp_Object val
;
3236 register struct Lisp_Symbol
*p
;
3238 CHECK_STRING (name
);
3240 /* eassert (!handling_signal); */
3246 if (symbol_free_list
)
3248 XSETSYMBOL (val
, symbol_free_list
);
3249 symbol_free_list
= symbol_free_list
->next
;
3253 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3255 struct symbol_block
*new;
3256 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3258 new->next
= symbol_block
;
3260 symbol_block_index
= 0;
3263 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3264 symbol_block_index
++;
3274 p
->value
= Qunbound
;
3275 p
->function
= Qunbound
;
3278 p
->interned
= SYMBOL_UNINTERNED
;
3280 p
->indirect_variable
= 0;
3281 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3288 /***********************************************************************
3289 Marker (Misc) Allocation
3290 ***********************************************************************/
3292 /* Allocation of markers and other objects that share that structure.
3293 Works like allocation of conses. */
3295 #define MARKER_BLOCK_SIZE \
3296 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3300 /* Place `markers' first, to preserve alignment. */
3301 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3302 struct marker_block
*next
;
3305 struct marker_block
*marker_block
;
3306 int marker_block_index
;
3308 union Lisp_Misc
*marker_free_list
;
3310 /* Total number of marker blocks now in use. */
3312 int n_marker_blocks
;
3317 marker_block
= NULL
;
3318 marker_block_index
= MARKER_BLOCK_SIZE
;
3319 marker_free_list
= 0;
3320 n_marker_blocks
= 0;
3323 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3330 /* eassert (!handling_signal); */
3336 if (marker_free_list
)
3338 XSETMISC (val
, marker_free_list
);
3339 marker_free_list
= marker_free_list
->u_free
.chain
;
3343 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3345 struct marker_block
*new;
3346 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3348 new->next
= marker_block
;
3350 marker_block_index
= 0;
3352 total_free_markers
+= MARKER_BLOCK_SIZE
;
3354 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3355 marker_block_index
++;
3362 --total_free_markers
;
3363 consing_since_gc
+= sizeof (union Lisp_Misc
);
3364 misc_objects_consed
++;
3365 XMARKER (val
)->gcmarkbit
= 0;
3369 /* Free a Lisp_Misc object */
3375 XMISC (misc
)->u_marker
.type
= Lisp_Misc_Free
;
3376 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3377 marker_free_list
= XMISC (misc
);
3379 total_free_markers
++;
3382 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3383 INTEGER. This is used to package C values to call record_unwind_protect.
3384 The unwind function can get the C values back using XSAVE_VALUE. */
3387 make_save_value (pointer
, integer
)
3391 register Lisp_Object val
;
3392 register struct Lisp_Save_Value
*p
;
3394 val
= allocate_misc ();
3395 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3396 p
= XSAVE_VALUE (val
);
3397 p
->pointer
= pointer
;
3398 p
->integer
= integer
;
3403 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3404 doc
: /* Return a newly allocated marker which does not point at any place. */)
3407 register Lisp_Object val
;
3408 register struct Lisp_Marker
*p
;
3410 val
= allocate_misc ();
3411 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3417 p
->insertion_type
= 0;
3421 /* Put MARKER back on the free list after using it temporarily. */
3424 free_marker (marker
)
3427 unchain_marker (XMARKER (marker
));
3432 /* Return a newly created vector or string with specified arguments as
3433 elements. If all the arguments are characters that can fit
3434 in a string of events, make a string; otherwise, make a vector.
3436 Any number of arguments, even zero arguments, are allowed. */
3439 make_event_array (nargs
, args
)
3445 for (i
= 0; i
< nargs
; i
++)
3446 /* The things that fit in a string
3447 are characters that are in 0...127,
3448 after discarding the meta bit and all the bits above it. */
3449 if (!INTEGERP (args
[i
])
3450 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3451 return Fvector (nargs
, args
);
3453 /* Since the loop exited, we know that all the things in it are
3454 characters, so we can make a string. */
3458 result
= Fmake_string (make_number (nargs
), make_number (0));
3459 for (i
= 0; i
< nargs
; i
++)
3461 SSET (result
, i
, XINT (args
[i
]));
3462 /* Move the meta bit to the right place for a string char. */
3463 if (XINT (args
[i
]) & CHAR_META
)
3464 SSET (result
, i
, SREF (result
, i
) | 0x80);
3473 /************************************************************************
3474 Memory Full Handling
3475 ************************************************************************/
3478 /* Called if malloc returns zero. */
3487 memory_full_cons_threshold
= sizeof (struct cons_block
);
3489 /* The first time we get here, free the spare memory. */
3490 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3491 if (spare_memory
[i
])
3494 free (spare_memory
[i
]);
3495 else if (i
>= 1 && i
<= 4)
3496 lisp_align_free (spare_memory
[i
]);
3498 lisp_free (spare_memory
[i
]);
3499 spare_memory
[i
] = 0;
3502 /* Record the space now used. When it decreases substantially,
3503 we can refill the memory reserve. */
3504 #ifndef SYSTEM_MALLOC
3505 bytes_used_when_full
= BYTES_USED
;
3508 /* This used to call error, but if we've run out of memory, we could
3509 get infinite recursion trying to build the string. */
3510 xsignal (Qnil
, Vmemory_signal_data
);
3513 /* If we released our reserve (due to running out of memory),
3514 and we have a fair amount free once again,
3515 try to set aside another reserve in case we run out once more.
3517 This is called when a relocatable block is freed in ralloc.c,
3518 and also directly from this file, in case we're not using ralloc.c. */
3521 refill_memory_reserve ()
3523 #ifndef SYSTEM_MALLOC
3524 if (spare_memory
[0] == 0)
3525 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3526 if (spare_memory
[1] == 0)
3527 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3529 if (spare_memory
[2] == 0)
3530 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3532 if (spare_memory
[3] == 0)
3533 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3535 if (spare_memory
[4] == 0)
3536 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3538 if (spare_memory
[5] == 0)
3539 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3541 if (spare_memory
[6] == 0)
3542 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3544 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3545 Vmemory_full
= Qnil
;
3549 /************************************************************************
3551 ************************************************************************/
3553 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3555 /* Conservative C stack marking requires a method to identify possibly
3556 live Lisp objects given a pointer value. We do this by keeping
3557 track of blocks of Lisp data that are allocated in a red-black tree
3558 (see also the comment of mem_node which is the type of nodes in
3559 that tree). Function lisp_malloc adds information for an allocated
3560 block to the red-black tree with calls to mem_insert, and function
3561 lisp_free removes it with mem_delete. Functions live_string_p etc
3562 call mem_find to lookup information about a given pointer in the
3563 tree, and use that to determine if the pointer points to a Lisp
3566 /* Initialize this part of alloc.c. */
3571 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3572 mem_z
.parent
= NULL
;
3573 mem_z
.color
= MEM_BLACK
;
3574 mem_z
.start
= mem_z
.end
= NULL
;
3579 /* Value is a pointer to the mem_node containing START. Value is
3580 MEM_NIL if there is no node in the tree containing START. */
3582 static INLINE
struct mem_node
*
3588 if (start
< min_heap_address
|| start
> max_heap_address
)
3591 /* Make the search always successful to speed up the loop below. */
3592 mem_z
.start
= start
;
3593 mem_z
.end
= (char *) start
+ 1;
3596 while (start
< p
->start
|| start
>= p
->end
)
3597 p
= start
< p
->start
? p
->left
: p
->right
;
3602 /* Insert a new node into the tree for a block of memory with start
3603 address START, end address END, and type TYPE. Value is a
3604 pointer to the node that was inserted. */
3606 static struct mem_node
*
3607 mem_insert (start
, end
, type
)
3611 struct mem_node
*c
, *parent
, *x
;
3613 if (start
< min_heap_address
)
3614 min_heap_address
= start
;
3615 if (end
> max_heap_address
)
3616 max_heap_address
= end
;
3618 /* See where in the tree a node for START belongs. In this
3619 particular application, it shouldn't happen that a node is already
3620 present. For debugging purposes, let's check that. */
3624 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3626 while (c
!= MEM_NIL
)
3628 if (start
>= c
->start
&& start
< c
->end
)
3631 c
= start
< c
->start
? c
->left
: c
->right
;
3634 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3636 while (c
!= MEM_NIL
)
3639 c
= start
< c
->start
? c
->left
: c
->right
;
3642 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3644 /* Create a new node. */
3645 #ifdef GC_MALLOC_CHECK
3646 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3650 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3656 x
->left
= x
->right
= MEM_NIL
;
3659 /* Insert it as child of PARENT or install it as root. */
3662 if (start
< parent
->start
)
3670 /* Re-establish red-black tree properties. */
3671 mem_insert_fixup (x
);
3677 /* Re-establish the red-black properties of the tree, and thereby
3678 balance the tree, after node X has been inserted; X is always red. */
3681 mem_insert_fixup (x
)
3684 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3686 /* X is red and its parent is red. This is a violation of
3687 red-black tree property #3. */
3689 if (x
->parent
== x
->parent
->parent
->left
)
3691 /* We're on the left side of our grandparent, and Y is our
3693 struct mem_node
*y
= x
->parent
->parent
->right
;
3695 if (y
->color
== MEM_RED
)
3697 /* Uncle and parent are red but should be black because
3698 X is red. Change the colors accordingly and proceed
3699 with the grandparent. */
3700 x
->parent
->color
= MEM_BLACK
;
3701 y
->color
= MEM_BLACK
;
3702 x
->parent
->parent
->color
= MEM_RED
;
3703 x
= x
->parent
->parent
;
3707 /* Parent and uncle have different colors; parent is
3708 red, uncle is black. */
3709 if (x
== x
->parent
->right
)
3712 mem_rotate_left (x
);
3715 x
->parent
->color
= MEM_BLACK
;
3716 x
->parent
->parent
->color
= MEM_RED
;
3717 mem_rotate_right (x
->parent
->parent
);
3722 /* This is the symmetrical case of above. */
3723 struct mem_node
*y
= x
->parent
->parent
->left
;
3725 if (y
->color
== MEM_RED
)
3727 x
->parent
->color
= MEM_BLACK
;
3728 y
->color
= MEM_BLACK
;
3729 x
->parent
->parent
->color
= MEM_RED
;
3730 x
= x
->parent
->parent
;
3734 if (x
== x
->parent
->left
)
3737 mem_rotate_right (x
);
3740 x
->parent
->color
= MEM_BLACK
;
3741 x
->parent
->parent
->color
= MEM_RED
;
3742 mem_rotate_left (x
->parent
->parent
);
3747 /* The root may have been changed to red due to the algorithm. Set
3748 it to black so that property #5 is satisfied. */
3749 mem_root
->color
= MEM_BLACK
;
3765 /* Turn y's left sub-tree into x's right sub-tree. */
3768 if (y
->left
!= MEM_NIL
)
3769 y
->left
->parent
= x
;
3771 /* Y's parent was x's parent. */
3773 y
->parent
= x
->parent
;
3775 /* Get the parent to point to y instead of x. */
3778 if (x
== x
->parent
->left
)
3779 x
->parent
->left
= y
;
3781 x
->parent
->right
= y
;
3786 /* Put x on y's left. */
3800 mem_rotate_right (x
)
3803 struct mem_node
*y
= x
->left
;
3806 if (y
->right
!= MEM_NIL
)
3807 y
->right
->parent
= x
;
3810 y
->parent
= x
->parent
;
3813 if (x
== x
->parent
->right
)
3814 x
->parent
->right
= y
;
3816 x
->parent
->left
= y
;
3827 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3833 struct mem_node
*x
, *y
;
3835 if (!z
|| z
== MEM_NIL
)
3838 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3843 while (y
->left
!= MEM_NIL
)
3847 if (y
->left
!= MEM_NIL
)
3852 x
->parent
= y
->parent
;
3855 if (y
== y
->parent
->left
)
3856 y
->parent
->left
= x
;
3858 y
->parent
->right
= x
;
3865 z
->start
= y
->start
;
3870 if (y
->color
== MEM_BLACK
)
3871 mem_delete_fixup (x
);
3873 #ifdef GC_MALLOC_CHECK
3881 /* Re-establish the red-black properties of the tree, after a
3885 mem_delete_fixup (x
)
3888 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3890 if (x
== x
->parent
->left
)
3892 struct mem_node
*w
= x
->parent
->right
;
3894 if (w
->color
== MEM_RED
)
3896 w
->color
= MEM_BLACK
;
3897 x
->parent
->color
= MEM_RED
;
3898 mem_rotate_left (x
->parent
);
3899 w
= x
->parent
->right
;
3902 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3909 if (w
->right
->color
== MEM_BLACK
)
3911 w
->left
->color
= MEM_BLACK
;
3913 mem_rotate_right (w
);
3914 w
= x
->parent
->right
;
3916 w
->color
= x
->parent
->color
;
3917 x
->parent
->color
= MEM_BLACK
;
3918 w
->right
->color
= MEM_BLACK
;
3919 mem_rotate_left (x
->parent
);
3925 struct mem_node
*w
= x
->parent
->left
;
3927 if (w
->color
== MEM_RED
)
3929 w
->color
= MEM_BLACK
;
3930 x
->parent
->color
= MEM_RED
;
3931 mem_rotate_right (x
->parent
);
3932 w
= x
->parent
->left
;
3935 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3942 if (w
->left
->color
== MEM_BLACK
)
3944 w
->right
->color
= MEM_BLACK
;
3946 mem_rotate_left (w
);
3947 w
= x
->parent
->left
;
3950 w
->color
= x
->parent
->color
;
3951 x
->parent
->color
= MEM_BLACK
;
3952 w
->left
->color
= MEM_BLACK
;
3953 mem_rotate_right (x
->parent
);
3959 x
->color
= MEM_BLACK
;
3963 /* Value is non-zero if P is a pointer to a live Lisp string on
3964 the heap. M is a pointer to the mem_block for P. */
3967 live_string_p (m
, p
)
3971 if (m
->type
== MEM_TYPE_STRING
)
3973 struct string_block
*b
= (struct string_block
*) m
->start
;
3974 int offset
= (char *) p
- (char *) &b
->strings
[0];
3976 /* P must point to the start of a Lisp_String structure, and it
3977 must not be on the free-list. */
3979 && offset
% sizeof b
->strings
[0] == 0
3980 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3981 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3988 /* Value is non-zero if P is a pointer to a live Lisp cons on
3989 the heap. M is a pointer to the mem_block for P. */
3996 if (m
->type
== MEM_TYPE_CONS
)
3998 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3999 int offset
= (char *) p
- (char *) &b
->conses
[0];
4001 /* P must point to the start of a Lisp_Cons, not be
4002 one of the unused cells in the current cons block,
4003 and not be on the free-list. */
4005 && offset
% sizeof b
->conses
[0] == 0
4006 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
4008 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
4009 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
4016 /* Value is non-zero if P is a pointer to a live Lisp symbol on
4017 the heap. M is a pointer to the mem_block for P. */
4020 live_symbol_p (m
, p
)
4024 if (m
->type
== MEM_TYPE_SYMBOL
)
4026 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
4027 int offset
= (char *) p
- (char *) &b
->symbols
[0];
4029 /* P must point to the start of a Lisp_Symbol, not be
4030 one of the unused cells in the current symbol block,
4031 and not be on the free-list. */
4033 && offset
% sizeof b
->symbols
[0] == 0
4034 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
4035 && (b
!= symbol_block
4036 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
4037 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
4044 /* Value is non-zero if P is a pointer to a live Lisp float on
4045 the heap. M is a pointer to the mem_block for P. */
4052 if (m
->type
== MEM_TYPE_FLOAT
)
4054 struct float_block
*b
= (struct float_block
*) m
->start
;
4055 int offset
= (char *) p
- (char *) &b
->floats
[0];
4057 /* P must point to the start of a Lisp_Float and not be
4058 one of the unused cells in the current float block. */
4060 && offset
% sizeof b
->floats
[0] == 0
4061 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
4062 && (b
!= float_block
4063 || offset
/ sizeof b
->floats
[0] < float_block_index
));
4070 /* Value is non-zero if P is a pointer to a live Lisp Misc on
4071 the heap. M is a pointer to the mem_block for P. */
4078 if (m
->type
== MEM_TYPE_MISC
)
4080 struct marker_block
*b
= (struct marker_block
*) m
->start
;
4081 int offset
= (char *) p
- (char *) &b
->markers
[0];
4083 /* P must point to the start of a Lisp_Misc, not be
4084 one of the unused cells in the current misc block,
4085 and not be on the free-list. */
4087 && offset
% sizeof b
->markers
[0] == 0
4088 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4089 && (b
!= marker_block
4090 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4091 && ((union Lisp_Misc
*) p
)->u_marker
.type
!= Lisp_Misc_Free
);
4098 /* Value is non-zero if P is a pointer to a live vector-like object.
4099 M is a pointer to the mem_block for P. */
4102 live_vector_p (m
, p
)
4106 return (p
== m
->start
4107 && m
->type
>= MEM_TYPE_VECTOR
4108 && m
->type
<= MEM_TYPE_WINDOW
);
4112 /* Value is non-zero if P is a pointer to a live buffer. M is a
4113 pointer to the mem_block for P. */
4116 live_buffer_p (m
, p
)
4120 /* P must point to the start of the block, and the buffer
4121 must not have been killed. */
4122 return (m
->type
== MEM_TYPE_BUFFER
4124 && !NILP (((struct buffer
*) p
)->name
));
4127 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4131 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4133 /* Array of objects that are kept alive because the C stack contains
4134 a pattern that looks like a reference to them . */
4136 #define MAX_ZOMBIES 10
4137 static Lisp_Object zombies
[MAX_ZOMBIES
];
4139 /* Number of zombie objects. */
4141 static int nzombies
;
4143 /* Number of garbage collections. */
4147 /* Average percentage of zombies per collection. */
4149 static double avg_zombies
;
4151 /* Max. number of live and zombie objects. */
4153 static int max_live
, max_zombies
;
4155 /* Average number of live objects per GC. */
4157 static double avg_live
;
4159 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4160 doc
: /* Show information about live and zombie objects. */)
4163 Lisp_Object args
[8], zombie_list
= Qnil
;
4165 for (i
= 0; i
< nzombies
; i
++)
4166 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4167 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4168 args
[1] = make_number (ngcs
);
4169 args
[2] = make_float (avg_live
);
4170 args
[3] = make_float (avg_zombies
);
4171 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4172 args
[5] = make_number (max_live
);
4173 args
[6] = make_number (max_zombies
);
4174 args
[7] = zombie_list
;
4175 return Fmessage (8, args
);
4178 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4181 /* Mark OBJ if we can prove it's a Lisp_Object. */
4184 mark_maybe_object (obj
)
4187 void *po
= (void *) XPNTR (obj
);
4188 struct mem_node
*m
= mem_find (po
);
4194 switch (XGCTYPE (obj
))
4197 mark_p
= (live_string_p (m
, po
)
4198 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4202 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4206 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4210 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4213 case Lisp_Vectorlike
:
4214 /* Note: can't check GC_BUFFERP before we know it's a
4215 buffer because checking that dereferences the pointer
4216 PO which might point anywhere. */
4217 if (live_vector_p (m
, po
))
4218 mark_p
= !GC_SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4219 else if (live_buffer_p (m
, po
))
4220 mark_p
= GC_BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4224 mark_p
= (live_misc_p (m
, po
) && !XMARKER (obj
)->gcmarkbit
);
4228 case Lisp_Type_Limit
:
4234 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4235 if (nzombies
< MAX_ZOMBIES
)
4236 zombies
[nzombies
] = obj
;
4245 /* If P points to Lisp data, mark that as live if it isn't already
4249 mark_maybe_pointer (p
)
4254 /* Quickly rule out some values which can't point to Lisp data. We
4255 assume that Lisp data is aligned on even addresses. */
4256 if ((EMACS_INT
) p
& 1)
4262 Lisp_Object obj
= Qnil
;
4266 case MEM_TYPE_NON_LISP
:
4267 /* Nothing to do; not a pointer to Lisp memory. */
4270 case MEM_TYPE_BUFFER
:
4271 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4272 XSETVECTOR (obj
, p
);
4276 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4280 case MEM_TYPE_STRING
:
4281 if (live_string_p (m
, p
)
4282 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4283 XSETSTRING (obj
, p
);
4287 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4291 case MEM_TYPE_SYMBOL
:
4292 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4293 XSETSYMBOL (obj
, p
);
4296 case MEM_TYPE_FLOAT
:
4297 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4301 case MEM_TYPE_VECTOR
:
4302 case MEM_TYPE_PROCESS
:
4303 case MEM_TYPE_HASH_TABLE
:
4304 case MEM_TYPE_FRAME
:
4305 case MEM_TYPE_WINDOW
:
4306 if (live_vector_p (m
, p
))
4309 XSETVECTOR (tem
, p
);
4310 if (!GC_SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4325 /* Mark Lisp objects referenced from the address range START..END. */
4328 mark_memory (start
, end
)
4334 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4338 /* Make START the pointer to the start of the memory region,
4339 if it isn't already. */
4347 /* Mark Lisp_Objects. */
4348 for (p
= (Lisp_Object
*) start
; (void *) p
< end
; ++p
)
4349 mark_maybe_object (*p
);
4351 /* Mark Lisp data pointed to. This is necessary because, in some
4352 situations, the C compiler optimizes Lisp objects away, so that
4353 only a pointer to them remains. Example:
4355 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4358 Lisp_Object obj = build_string ("test");
4359 struct Lisp_String *s = XSTRING (obj);
4360 Fgarbage_collect ();
4361 fprintf (stderr, "test `%s'\n", s->data);
4365 Here, `obj' isn't really used, and the compiler optimizes it
4366 away. The only reference to the life string is through the
4369 for (pp
= (void **) start
; (void *) pp
< end
; ++pp
)
4370 mark_maybe_pointer (*pp
);
4373 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4374 the GCC system configuration. In gcc 3.2, the only systems for
4375 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4376 by others?) and ns32k-pc532-min. */
4378 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4380 static int setjmp_tested_p
, longjmps_done
;
4382 #define SETJMP_WILL_LIKELY_WORK "\
4384 Emacs garbage collector has been changed to use conservative stack\n\
4385 marking. Emacs has determined that the method it uses to do the\n\
4386 marking will likely work on your system, but this isn't sure.\n\
4388 If you are a system-programmer, or can get the help of a local wizard\n\
4389 who is, please take a look at the function mark_stack in alloc.c, and\n\
4390 verify that the methods used are appropriate for your system.\n\
4392 Please mail the result to <emacs-devel@gnu.org>.\n\
4395 #define SETJMP_WILL_NOT_WORK "\
4397 Emacs garbage collector has been changed to use conservative stack\n\
4398 marking. Emacs has determined that the default method it uses to do the\n\
4399 marking will not work on your system. We will need a system-dependent\n\
4400 solution for your system.\n\
4402 Please take a look at the function mark_stack in alloc.c, and\n\
4403 try to find a way to make it work on your system.\n\
4405 Note that you may get false negatives, depending on the compiler.\n\
4406 In particular, you need to use -O with GCC for this test.\n\
4408 Please mail the result to <emacs-devel@gnu.org>.\n\
4412 /* Perform a quick check if it looks like setjmp saves registers in a
4413 jmp_buf. Print a message to stderr saying so. When this test
4414 succeeds, this is _not_ a proof that setjmp is sufficient for
4415 conservative stack marking. Only the sources or a disassembly
4426 /* Arrange for X to be put in a register. */
4432 if (longjmps_done
== 1)
4434 /* Came here after the longjmp at the end of the function.
4436 If x == 1, the longjmp has restored the register to its
4437 value before the setjmp, and we can hope that setjmp
4438 saves all such registers in the jmp_buf, although that
4441 For other values of X, either something really strange is
4442 taking place, or the setjmp just didn't save the register. */
4445 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4448 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4455 if (longjmps_done
== 1)
4459 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4462 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4464 /* Abort if anything GCPRO'd doesn't survive the GC. */
4472 for (p
= gcprolist
; p
; p
= p
->next
)
4473 for (i
= 0; i
< p
->nvars
; ++i
)
4474 if (!survives_gc_p (p
->var
[i
]))
4475 /* FIXME: It's not necessarily a bug. It might just be that the
4476 GCPRO is unnecessary or should release the object sooner. */
4480 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4487 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4488 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4490 fprintf (stderr
, " %d = ", i
);
4491 debug_print (zombies
[i
]);
4495 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4498 /* Mark live Lisp objects on the C stack.
4500 There are several system-dependent problems to consider when
4501 porting this to new architectures:
4505 We have to mark Lisp objects in CPU registers that can hold local
4506 variables or are used to pass parameters.
4508 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4509 something that either saves relevant registers on the stack, or
4510 calls mark_maybe_object passing it each register's contents.
4512 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4513 implementation assumes that calling setjmp saves registers we need
4514 to see in a jmp_buf which itself lies on the stack. This doesn't
4515 have to be true! It must be verified for each system, possibly
4516 by taking a look at the source code of setjmp.
4520 Architectures differ in the way their processor stack is organized.
4521 For example, the stack might look like this
4524 | Lisp_Object | size = 4
4526 | something else | size = 2
4528 | Lisp_Object | size = 4
4532 In such a case, not every Lisp_Object will be aligned equally. To
4533 find all Lisp_Object on the stack it won't be sufficient to walk
4534 the stack in steps of 4 bytes. Instead, two passes will be
4535 necessary, one starting at the start of the stack, and a second
4536 pass starting at the start of the stack + 2. Likewise, if the
4537 minimal alignment of Lisp_Objects on the stack is 1, four passes
4538 would be necessary, each one starting with one byte more offset
4539 from the stack start.
4541 The current code assumes by default that Lisp_Objects are aligned
4542 equally on the stack. */
4549 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4552 /* This trick flushes the register windows so that all the state of
4553 the process is contained in the stack. */
4554 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4555 needed on ia64 too. See mach_dep.c, where it also says inline
4556 assembler doesn't work with relevant proprietary compilers. */
4561 /* Save registers that we need to see on the stack. We need to see
4562 registers used to hold register variables and registers used to
4564 #ifdef GC_SAVE_REGISTERS_ON_STACK
4565 GC_SAVE_REGISTERS_ON_STACK (end
);
4566 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4568 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4569 setjmp will definitely work, test it
4570 and print a message with the result
4572 if (!setjmp_tested_p
)
4574 setjmp_tested_p
= 1;
4577 #endif /* GC_SETJMP_WORKS */
4580 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4581 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4583 /* This assumes that the stack is a contiguous region in memory. If
4584 that's not the case, something has to be done here to iterate
4585 over the stack segments. */
4586 #ifndef GC_LISP_OBJECT_ALIGNMENT
4588 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4590 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4593 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4594 mark_memory ((char *) stack_base
+ i
, end
);
4595 /* Allow for marking a secondary stack, like the register stack on the
4597 #ifdef GC_MARK_SECONDARY_STACK
4598 GC_MARK_SECONDARY_STACK ();
4601 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4606 #endif /* GC_MARK_STACK != 0 */
4610 /* Return 1 if OBJ is a valid lisp object.
4611 Return 0 if OBJ is NOT a valid lisp object.
4612 Return -1 if we cannot validate OBJ.
4613 This function can be quite slow,
4614 so it should only be used in code for manual debugging. */
4617 valid_lisp_object_p (obj
)
4630 p
= (void *) XPNTR (obj
);
4631 if (PURE_POINTER_P (p
))
4635 /* We need to determine whether it is safe to access memory at
4636 address P. Obviously, we cannot just access it (we would SEGV
4637 trying), so we trick the o/s to tell us whether p is a valid
4638 pointer. Unfortunately, we cannot use NULL_DEVICE here, as
4639 emacs_write may not validate p in that case. */
4640 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4642 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4644 unlink ("__Valid__Lisp__Object__");
4658 case MEM_TYPE_NON_LISP
:
4661 case MEM_TYPE_BUFFER
:
4662 return live_buffer_p (m
, p
);
4665 return live_cons_p (m
, p
);
4667 case MEM_TYPE_STRING
:
4668 return live_string_p (m
, p
);
4671 return live_misc_p (m
, p
);
4673 case MEM_TYPE_SYMBOL
:
4674 return live_symbol_p (m
, p
);
4676 case MEM_TYPE_FLOAT
:
4677 return live_float_p (m
, p
);
4679 case MEM_TYPE_VECTOR
:
4680 case MEM_TYPE_PROCESS
:
4681 case MEM_TYPE_HASH_TABLE
:
4682 case MEM_TYPE_FRAME
:
4683 case MEM_TYPE_WINDOW
:
4684 return live_vector_p (m
, p
);
4697 /***********************************************************************
4698 Pure Storage Management
4699 ***********************************************************************/
4701 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4702 pointer to it. TYPE is the Lisp type for which the memory is
4703 allocated. TYPE < 0 means it's not used for a Lisp object. */
4705 static POINTER_TYPE
*
4706 pure_alloc (size
, type
)
4710 POINTER_TYPE
*result
;
4712 size_t alignment
= (1 << GCTYPEBITS
);
4714 size_t alignment
= sizeof (EMACS_INT
);
4716 /* Give Lisp_Floats an extra alignment. */
4717 if (type
== Lisp_Float
)
4719 #if defined __GNUC__ && __GNUC__ >= 2
4720 alignment
= __alignof (struct Lisp_Float
);
4722 alignment
= sizeof (struct Lisp_Float
);
4730 /* Allocate space for a Lisp object from the beginning of the free
4731 space with taking account of alignment. */
4732 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4733 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4737 /* Allocate space for a non-Lisp object from the end of the free
4739 pure_bytes_used_non_lisp
+= size
;
4740 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4742 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4744 if (pure_bytes_used
<= pure_size
)
4747 /* Don't allocate a large amount here,
4748 because it might get mmap'd and then its address
4749 might not be usable. */
4750 purebeg
= (char *) xmalloc (10000);
4752 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4753 pure_bytes_used
= 0;
4754 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4759 /* Print a warning if PURESIZE is too small. */
4764 if (pure_bytes_used_before_overflow
)
4765 message ("emacs:0:Pure Lisp storage overflow (approx. %d bytes needed)",
4766 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4770 /* Return a string allocated in pure space. DATA is a buffer holding
4771 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4772 non-zero means make the result string multibyte.
4774 Must get an error if pure storage is full, since if it cannot hold
4775 a large string it may be able to hold conses that point to that
4776 string; then the string is not protected from gc. */
4779 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4785 struct Lisp_String
*s
;
4787 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4788 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4790 s
->size_byte
= multibyte
? nbytes
: -1;
4791 bcopy (data
, s
->data
, nbytes
);
4792 s
->data
[nbytes
] = '\0';
4793 s
->intervals
= NULL_INTERVAL
;
4794 XSETSTRING (string
, s
);
4799 /* Return a cons allocated from pure space. Give it pure copies
4800 of CAR as car and CDR as cdr. */
4803 pure_cons (car
, cdr
)
4804 Lisp_Object car
, cdr
;
4806 register Lisp_Object
new;
4807 struct Lisp_Cons
*p
;
4809 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4811 XSETCAR (new, Fpurecopy (car
));
4812 XSETCDR (new, Fpurecopy (cdr
));
4817 /* Value is a float object with value NUM allocated from pure space. */
4820 make_pure_float (num
)
4823 register Lisp_Object
new;
4824 struct Lisp_Float
*p
;
4826 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4828 XFLOAT_DATA (new) = num
;
4833 /* Return a vector with room for LEN Lisp_Objects allocated from
4837 make_pure_vector (len
)
4841 struct Lisp_Vector
*p
;
4842 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4844 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4845 XSETVECTOR (new, p
);
4846 XVECTOR (new)->size
= len
;
4851 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4852 doc
: /* Make a copy of object OBJ in pure storage.
4853 Recursively copies contents of vectors and cons cells.
4854 Does not copy symbols. Copies strings without text properties. */)
4856 register Lisp_Object obj
;
4858 if (NILP (Vpurify_flag
))
4861 if (PURE_POINTER_P (XPNTR (obj
)))
4865 return pure_cons (XCAR (obj
), XCDR (obj
));
4866 else if (FLOATP (obj
))
4867 return make_pure_float (XFLOAT_DATA (obj
));
4868 else if (STRINGP (obj
))
4869 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4871 STRING_MULTIBYTE (obj
));
4872 else if (COMPILEDP (obj
) || VECTORP (obj
))
4874 register struct Lisp_Vector
*vec
;
4878 size
= XVECTOR (obj
)->size
;
4879 if (size
& PSEUDOVECTOR_FLAG
)
4880 size
&= PSEUDOVECTOR_SIZE_MASK
;
4881 vec
= XVECTOR (make_pure_vector (size
));
4882 for (i
= 0; i
< size
; i
++)
4883 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4884 if (COMPILEDP (obj
))
4885 XSETCOMPILED (obj
, vec
);
4887 XSETVECTOR (obj
, vec
);
4890 else if (MARKERP (obj
))
4891 error ("Attempt to copy a marker to pure storage");
4898 /***********************************************************************
4900 ***********************************************************************/
4902 /* Put an entry in staticvec, pointing at the variable with address
4906 staticpro (varaddress
)
4907 Lisp_Object
*varaddress
;
4909 staticvec
[staticidx
++] = varaddress
;
4910 if (staticidx
>= NSTATICS
)
4918 struct catchtag
*next
;
4922 /***********************************************************************
4924 ***********************************************************************/
4926 /* Temporarily prevent garbage collection. */
4929 inhibit_garbage_collection ()
4931 int count
= SPECPDL_INDEX ();
4932 int nbits
= min (VALBITS
, BITS_PER_INT
);
4934 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4939 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4940 doc
: /* Reclaim storage for Lisp objects no longer needed.
4941 Garbage collection happens automatically if you cons more than
4942 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4943 `garbage-collect' normally returns a list with info on amount of space in use:
4944 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4945 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4946 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4947 (USED-STRINGS . FREE-STRINGS))
4948 However, if there was overflow in pure space, `garbage-collect'
4949 returns nil, because real GC can't be done. */)
4952 register struct specbinding
*bind
;
4953 struct catchtag
*catch;
4954 struct handler
*handler
;
4955 char stack_top_variable
;
4958 Lisp_Object total
[8];
4959 int count
= SPECPDL_INDEX ();
4960 EMACS_TIME t1
, t2
, t3
;
4965 /* Can't GC if pure storage overflowed because we can't determine
4966 if something is a pure object or not. */
4967 if (pure_bytes_used_before_overflow
)
4972 /* Don't keep undo information around forever.
4973 Do this early on, so it is no problem if the user quits. */
4975 register struct buffer
*nextb
= all_buffers
;
4979 /* If a buffer's undo list is Qt, that means that undo is
4980 turned off in that buffer. Calling truncate_undo_list on
4981 Qt tends to return NULL, which effectively turns undo back on.
4982 So don't call truncate_undo_list if undo_list is Qt. */
4983 if (! NILP (nextb
->name
) && ! EQ (nextb
->undo_list
, Qt
))
4984 truncate_undo_list (nextb
);
4986 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4987 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
))
4989 /* If a buffer's gap size is more than 10% of the buffer
4990 size, or larger than 2000 bytes, then shrink it
4991 accordingly. Keep a minimum size of 20 bytes. */
4992 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4994 if (nextb
->text
->gap_size
> size
)
4996 struct buffer
*save_current
= current_buffer
;
4997 current_buffer
= nextb
;
4998 make_gap (-(nextb
->text
->gap_size
- size
));
4999 current_buffer
= save_current
;
5003 nextb
= nextb
->next
;
5007 EMACS_GET_TIME (t1
);
5009 /* In case user calls debug_print during GC,
5010 don't let that cause a recursive GC. */
5011 consing_since_gc
= 0;
5013 /* Save what's currently displayed in the echo area. */
5014 message_p
= push_message ();
5015 record_unwind_protect (pop_message_unwind
, Qnil
);
5017 /* Save a copy of the contents of the stack, for debugging. */
5018 #if MAX_SAVE_STACK > 0
5019 if (NILP (Vpurify_flag
))
5021 i
= &stack_top_variable
- stack_bottom
;
5023 if (i
< MAX_SAVE_STACK
)
5025 if (stack_copy
== 0)
5026 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
5027 else if (stack_copy_size
< i
)
5028 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
5031 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
5032 bcopy (stack_bottom
, stack_copy
, i
);
5034 bcopy (&stack_top_variable
, stack_copy
, i
);
5038 #endif /* MAX_SAVE_STACK > 0 */
5040 if (garbage_collection_messages
)
5041 message1_nolog ("Garbage collecting...");
5045 shrink_regexp_cache ();
5049 /* clear_marks (); */
5051 /* Mark all the special slots that serve as the roots of accessibility. */
5053 for (i
= 0; i
< staticidx
; i
++)
5054 mark_object (*staticvec
[i
]);
5056 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
5058 mark_object (bind
->symbol
);
5059 mark_object (bind
->old_value
);
5065 extern void xg_mark_data ();
5070 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5071 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5075 register struct gcpro
*tail
;
5076 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5077 for (i
= 0; i
< tail
->nvars
; i
++)
5078 mark_object (tail
->var
[i
]);
5083 for (catch = catchlist
; catch; catch = catch->next
)
5085 mark_object (catch->tag
);
5086 mark_object (catch->val
);
5088 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5090 mark_object (handler
->handler
);
5091 mark_object (handler
->var
);
5095 #ifdef HAVE_WINDOW_SYSTEM
5096 mark_fringe_data ();
5099 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5103 /* Everything is now marked, except for the things that require special
5104 finalization, i.e. the undo_list.
5105 Look thru every buffer's undo list
5106 for elements that update markers that were not marked,
5109 register struct buffer
*nextb
= all_buffers
;
5113 /* If a buffer's undo list is Qt, that means that undo is
5114 turned off in that buffer. Calling truncate_undo_list on
5115 Qt tends to return NULL, which effectively turns undo back on.
5116 So don't call truncate_undo_list if undo_list is Qt. */
5117 if (! EQ (nextb
->undo_list
, Qt
))
5119 Lisp_Object tail
, prev
;
5120 tail
= nextb
->undo_list
;
5122 while (CONSP (tail
))
5124 if (GC_CONSP (XCAR (tail
))
5125 && GC_MARKERP (XCAR (XCAR (tail
)))
5126 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5129 nextb
->undo_list
= tail
= XCDR (tail
);
5133 XSETCDR (prev
, tail
);
5143 /* Now that we have stripped the elements that need not be in the
5144 undo_list any more, we can finally mark the list. */
5145 mark_object (nextb
->undo_list
);
5147 nextb
= nextb
->next
;
5153 /* Clear the mark bits that we set in certain root slots. */
5155 unmark_byte_stack ();
5156 VECTOR_UNMARK (&buffer_defaults
);
5157 VECTOR_UNMARK (&buffer_local_symbols
);
5159 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5167 /* clear_marks (); */
5170 consing_since_gc
= 0;
5171 if (gc_cons_threshold
< 10000)
5172 gc_cons_threshold
= 10000;
5174 if (FLOATP (Vgc_cons_percentage
))
5175 { /* Set gc_cons_combined_threshold. */
5176 EMACS_INT total
= 0;
5178 total
+= total_conses
* sizeof (struct Lisp_Cons
);
5179 total
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5180 total
+= total_markers
* sizeof (union Lisp_Misc
);
5181 total
+= total_string_size
;
5182 total
+= total_vector_size
* sizeof (Lisp_Object
);
5183 total
+= total_floats
* sizeof (struct Lisp_Float
);
5184 total
+= total_intervals
* sizeof (struct interval
);
5185 total
+= total_strings
* sizeof (struct Lisp_String
);
5187 gc_relative_threshold
= total
* XFLOAT_DATA (Vgc_cons_percentage
);
5190 gc_relative_threshold
= 0;
5192 if (garbage_collection_messages
)
5194 if (message_p
|| minibuf_level
> 0)
5197 message1_nolog ("Garbage collecting...done");
5200 unbind_to (count
, Qnil
);
5202 total
[0] = Fcons (make_number (total_conses
),
5203 make_number (total_free_conses
));
5204 total
[1] = Fcons (make_number (total_symbols
),
5205 make_number (total_free_symbols
));
5206 total
[2] = Fcons (make_number (total_markers
),
5207 make_number (total_free_markers
));
5208 total
[3] = make_number (total_string_size
);
5209 total
[4] = make_number (total_vector_size
);
5210 total
[5] = Fcons (make_number (total_floats
),
5211 make_number (total_free_floats
));
5212 total
[6] = Fcons (make_number (total_intervals
),
5213 make_number (total_free_intervals
));
5214 total
[7] = Fcons (make_number (total_strings
),
5215 make_number (total_free_strings
));
5217 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5219 /* Compute average percentage of zombies. */
5222 for (i
= 0; i
< 7; ++i
)
5223 if (CONSP (total
[i
]))
5224 nlive
+= XFASTINT (XCAR (total
[i
]));
5226 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5227 max_live
= max (nlive
, max_live
);
5228 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5229 max_zombies
= max (nzombies
, max_zombies
);
5234 if (!NILP (Vpost_gc_hook
))
5236 int count
= inhibit_garbage_collection ();
5237 safe_run_hooks (Qpost_gc_hook
);
5238 unbind_to (count
, Qnil
);
5241 /* Accumulate statistics. */
5242 EMACS_GET_TIME (t2
);
5243 EMACS_SUB_TIME (t3
, t2
, t1
);
5244 if (FLOATP (Vgc_elapsed
))
5245 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5247 EMACS_USECS (t3
) * 1.0e-6);
5250 return Flist (sizeof total
/ sizeof *total
, total
);
5254 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5255 only interesting objects referenced from glyphs are strings. */
5258 mark_glyph_matrix (matrix
)
5259 struct glyph_matrix
*matrix
;
5261 struct glyph_row
*row
= matrix
->rows
;
5262 struct glyph_row
*end
= row
+ matrix
->nrows
;
5264 for (; row
< end
; ++row
)
5268 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5270 struct glyph
*glyph
= row
->glyphs
[area
];
5271 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5273 for (; glyph
< end_glyph
; ++glyph
)
5274 if (GC_STRINGP (glyph
->object
)
5275 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5276 mark_object (glyph
->object
);
5282 /* Mark Lisp faces in the face cache C. */
5286 struct face_cache
*c
;
5291 for (i
= 0; i
< c
->used
; ++i
)
5293 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5297 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5298 mark_object (face
->lface
[j
]);
5305 #ifdef HAVE_WINDOW_SYSTEM
5307 /* Mark Lisp objects in image IMG. */
5313 mark_object (img
->spec
);
5315 if (!NILP (img
->data
.lisp_val
))
5316 mark_object (img
->data
.lisp_val
);
5320 /* Mark Lisp objects in image cache of frame F. It's done this way so
5321 that we don't have to include xterm.h here. */
5324 mark_image_cache (f
)
5327 forall_images_in_image_cache (f
, mark_image
);
5330 #endif /* HAVE_X_WINDOWS */
5334 /* Mark reference to a Lisp_Object.
5335 If the object referred to has not been seen yet, recursively mark
5336 all the references contained in it. */
5338 #define LAST_MARKED_SIZE 500
5339 Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5340 int last_marked_index
;
5342 /* For debugging--call abort when we cdr down this many
5343 links of a list, in mark_object. In debugging,
5344 the call to abort will hit a breakpoint.
5345 Normally this is zero and the check never goes off. */
5346 int mark_object_loop_halt
;
5352 register Lisp_Object obj
= arg
;
5353 #ifdef GC_CHECK_MARKED_OBJECTS
5361 if (PURE_POINTER_P (XPNTR (obj
)))
5364 last_marked
[last_marked_index
++] = obj
;
5365 if (last_marked_index
== LAST_MARKED_SIZE
)
5366 last_marked_index
= 0;
5368 /* Perform some sanity checks on the objects marked here. Abort if
5369 we encounter an object we know is bogus. This increases GC time
5370 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5371 #ifdef GC_CHECK_MARKED_OBJECTS
5373 po
= (void *) XPNTR (obj
);
5375 /* Check that the object pointed to by PO is known to be a Lisp
5376 structure allocated from the heap. */
5377 #define CHECK_ALLOCATED() \
5379 m = mem_find (po); \
5384 /* Check that the object pointed to by PO is live, using predicate
5386 #define CHECK_LIVE(LIVEP) \
5388 if (!LIVEP (m, po)) \
5392 /* Check both of the above conditions. */
5393 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5395 CHECK_ALLOCATED (); \
5396 CHECK_LIVE (LIVEP); \
5399 #else /* not GC_CHECK_MARKED_OBJECTS */
5401 #define CHECK_ALLOCATED() (void) 0
5402 #define CHECK_LIVE(LIVEP) (void) 0
5403 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5405 #endif /* not GC_CHECK_MARKED_OBJECTS */
5407 switch (SWITCH_ENUM_CAST (XGCTYPE (obj
)))
5411 register struct Lisp_String
*ptr
= XSTRING (obj
);
5412 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5413 MARK_INTERVAL_TREE (ptr
->intervals
);
5415 #ifdef GC_CHECK_STRING_BYTES
5416 /* Check that the string size recorded in the string is the
5417 same as the one recorded in the sdata structure. */
5418 CHECK_STRING_BYTES (ptr
);
5419 #endif /* GC_CHECK_STRING_BYTES */
5423 case Lisp_Vectorlike
:
5424 #ifdef GC_CHECK_MARKED_OBJECTS
5426 if (m
== MEM_NIL
&& !GC_SUBRP (obj
)
5427 && po
!= &buffer_defaults
5428 && po
!= &buffer_local_symbols
)
5430 #endif /* GC_CHECK_MARKED_OBJECTS */
5432 if (GC_BUFFERP (obj
))
5434 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
5436 #ifdef GC_CHECK_MARKED_OBJECTS
5437 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5440 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
5445 #endif /* GC_CHECK_MARKED_OBJECTS */
5449 else if (GC_SUBRP (obj
))
5451 else if (GC_COMPILEDP (obj
))
5452 /* We could treat this just like a vector, but it is better to
5453 save the COMPILED_CONSTANTS element for last and avoid
5456 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5457 register EMACS_INT size
= ptr
->size
;
5460 if (VECTOR_MARKED_P (ptr
))
5461 break; /* Already marked */
5463 CHECK_LIVE (live_vector_p
);
5464 VECTOR_MARK (ptr
); /* Else mark it */
5465 size
&= PSEUDOVECTOR_SIZE_MASK
;
5466 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5468 if (i
!= COMPILED_CONSTANTS
)
5469 mark_object (ptr
->contents
[i
]);
5471 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5474 else if (GC_FRAMEP (obj
))
5476 register struct frame
*ptr
= XFRAME (obj
);
5478 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
5479 VECTOR_MARK (ptr
); /* Else mark it */
5481 CHECK_LIVE (live_vector_p
);
5482 mark_object (ptr
->name
);
5483 mark_object (ptr
->icon_name
);
5484 mark_object (ptr
->title
);
5485 mark_object (ptr
->focus_frame
);
5486 mark_object (ptr
->selected_window
);
5487 mark_object (ptr
->minibuffer_window
);
5488 mark_object (ptr
->param_alist
);
5489 mark_object (ptr
->scroll_bars
);
5490 mark_object (ptr
->condemned_scroll_bars
);
5491 mark_object (ptr
->menu_bar_items
);
5492 mark_object (ptr
->face_alist
);
5493 mark_object (ptr
->menu_bar_vector
);
5494 mark_object (ptr
->buffer_predicate
);
5495 mark_object (ptr
->buffer_list
);
5496 mark_object (ptr
->menu_bar_window
);
5497 mark_object (ptr
->tool_bar_window
);
5498 mark_face_cache (ptr
->face_cache
);
5499 #ifdef HAVE_WINDOW_SYSTEM
5500 mark_image_cache (ptr
);
5501 mark_object (ptr
->tool_bar_items
);
5502 mark_object (ptr
->desired_tool_bar_string
);
5503 mark_object (ptr
->current_tool_bar_string
);
5504 #endif /* HAVE_WINDOW_SYSTEM */
5506 else if (GC_BOOL_VECTOR_P (obj
))
5508 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5510 if (VECTOR_MARKED_P (ptr
))
5511 break; /* Already marked */
5512 CHECK_LIVE (live_vector_p
);
5513 VECTOR_MARK (ptr
); /* Else mark it */
5515 else if (GC_WINDOWP (obj
))
5517 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5518 struct window
*w
= XWINDOW (obj
);
5521 /* Stop if already marked. */
5522 if (VECTOR_MARKED_P (ptr
))
5526 CHECK_LIVE (live_vector_p
);
5529 /* There is no Lisp data above The member CURRENT_MATRIX in
5530 struct WINDOW. Stop marking when that slot is reached. */
5532 (char *) &ptr
->contents
[i
] < (char *) &w
->current_matrix
;
5534 mark_object (ptr
->contents
[i
]);
5536 /* Mark glyphs for leaf windows. Marking window matrices is
5537 sufficient because frame matrices use the same glyph
5539 if (NILP (w
->hchild
)
5541 && w
->current_matrix
)
5543 mark_glyph_matrix (w
->current_matrix
);
5544 mark_glyph_matrix (w
->desired_matrix
);
5547 else if (GC_HASH_TABLE_P (obj
))
5549 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5551 /* Stop if already marked. */
5552 if (VECTOR_MARKED_P (h
))
5556 CHECK_LIVE (live_vector_p
);
5559 /* Mark contents. */
5560 /* Do not mark next_free or next_weak.
5561 Being in the next_weak chain
5562 should not keep the hash table alive.
5563 No need to mark `count' since it is an integer. */
5564 mark_object (h
->test
);
5565 mark_object (h
->weak
);
5566 mark_object (h
->rehash_size
);
5567 mark_object (h
->rehash_threshold
);
5568 mark_object (h
->hash
);
5569 mark_object (h
->next
);
5570 mark_object (h
->index
);
5571 mark_object (h
->user_hash_function
);
5572 mark_object (h
->user_cmp_function
);
5574 /* If hash table is not weak, mark all keys and values.
5575 For weak tables, mark only the vector. */
5576 if (GC_NILP (h
->weak
))
5577 mark_object (h
->key_and_value
);
5579 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5583 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5584 register EMACS_INT size
= ptr
->size
;
5587 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
5588 CHECK_LIVE (live_vector_p
);
5589 VECTOR_MARK (ptr
); /* Else mark it */
5590 if (size
& PSEUDOVECTOR_FLAG
)
5591 size
&= PSEUDOVECTOR_SIZE_MASK
;
5593 /* Note that this size is not the memory-footprint size, but only
5594 the number of Lisp_Object fields that we should trace.
5595 The distinction is used e.g. by Lisp_Process which places extra
5596 non-Lisp_Object fields at the end of the structure. */
5597 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5598 mark_object (ptr
->contents
[i
]);
5604 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5605 struct Lisp_Symbol
*ptrx
;
5607 if (ptr
->gcmarkbit
) break;
5608 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5610 mark_object (ptr
->value
);
5611 mark_object (ptr
->function
);
5612 mark_object (ptr
->plist
);
5614 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5615 MARK_STRING (XSTRING (ptr
->xname
));
5616 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5618 /* Note that we do not mark the obarray of the symbol.
5619 It is safe not to do so because nothing accesses that
5620 slot except to check whether it is nil. */
5624 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5625 XSETSYMBOL (obj
, ptrx
);
5632 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5633 if (XMARKER (obj
)->gcmarkbit
)
5635 XMARKER (obj
)->gcmarkbit
= 1;
5637 switch (XMISCTYPE (obj
))
5639 case Lisp_Misc_Buffer_Local_Value
:
5640 case Lisp_Misc_Some_Buffer_Local_Value
:
5642 register struct Lisp_Buffer_Local_Value
*ptr
5643 = XBUFFER_LOCAL_VALUE (obj
);
5644 /* If the cdr is nil, avoid recursion for the car. */
5645 if (EQ (ptr
->cdr
, Qnil
))
5647 obj
= ptr
->realvalue
;
5650 mark_object (ptr
->realvalue
);
5651 mark_object (ptr
->buffer
);
5652 mark_object (ptr
->frame
);
5657 case Lisp_Misc_Marker
:
5658 /* DO NOT mark thru the marker's chain.
5659 The buffer's markers chain does not preserve markers from gc;
5660 instead, markers are removed from the chain when freed by gc. */
5663 case Lisp_Misc_Intfwd
:
5664 case Lisp_Misc_Boolfwd
:
5665 case Lisp_Misc_Objfwd
:
5666 case Lisp_Misc_Buffer_Objfwd
:
5667 case Lisp_Misc_Kboard_Objfwd
:
5668 /* Don't bother with Lisp_Buffer_Objfwd,
5669 since all markable slots in current buffer marked anyway. */
5670 /* Don't need to do Lisp_Objfwd, since the places they point
5671 are protected with staticpro. */
5674 case Lisp_Misc_Save_Value
:
5677 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5678 /* If DOGC is set, POINTER is the address of a memory
5679 area containing INTEGER potential Lisp_Objects. */
5682 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5684 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5685 mark_maybe_object (*p
);
5691 case Lisp_Misc_Overlay
:
5693 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5694 mark_object (ptr
->start
);
5695 mark_object (ptr
->end
);
5696 mark_object (ptr
->plist
);
5699 XSETMISC (obj
, ptr
->next
);
5712 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5713 if (CONS_MARKED_P (ptr
)) break;
5714 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5716 /* If the cdr is nil, avoid recursion for the car. */
5717 if (EQ (ptr
->u
.cdr
, Qnil
))
5723 mark_object (ptr
->car
);
5726 if (cdr_count
== mark_object_loop_halt
)
5732 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5733 FLOAT_MARK (XFLOAT (obj
));
5744 #undef CHECK_ALLOCATED
5745 #undef CHECK_ALLOCATED_AND_LIVE
5748 /* Mark the pointers in a buffer structure. */
5754 register struct buffer
*buffer
= XBUFFER (buf
);
5755 register Lisp_Object
*ptr
, tmp
;
5756 Lisp_Object base_buffer
;
5758 VECTOR_MARK (buffer
);
5760 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5762 /* For now, we just don't mark the undo_list. It's done later in
5763 a special way just before the sweep phase, and after stripping
5764 some of its elements that are not needed any more. */
5766 if (buffer
->overlays_before
)
5768 XSETMISC (tmp
, buffer
->overlays_before
);
5771 if (buffer
->overlays_after
)
5773 XSETMISC (tmp
, buffer
->overlays_after
);
5777 for (ptr
= &buffer
->name
;
5778 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5782 /* If this is an indirect buffer, mark its base buffer. */
5783 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5785 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5786 mark_buffer (base_buffer
);
5791 /* Value is non-zero if OBJ will survive the current GC because it's
5792 either marked or does not need to be marked to survive. */
5800 switch (XGCTYPE (obj
))
5807 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5811 survives_p
= XMARKER (obj
)->gcmarkbit
;
5815 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5818 case Lisp_Vectorlike
:
5819 survives_p
= GC_SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5823 survives_p
= CONS_MARKED_P (XCONS (obj
));
5827 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5834 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5839 /* Sweep: find all structures not marked, and free them. */
5844 /* Remove or mark entries in weak hash tables.
5845 This must be done before any object is unmarked. */
5846 sweep_weak_hash_tables ();
5849 #ifdef GC_CHECK_STRING_BYTES
5850 if (!noninteractive
)
5851 check_string_bytes (1);
5854 /* Put all unmarked conses on free list */
5856 register struct cons_block
*cblk
;
5857 struct cons_block
**cprev
= &cons_block
;
5858 register int lim
= cons_block_index
;
5859 register int num_free
= 0, num_used
= 0;
5863 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5867 for (i
= 0; i
< lim
; i
++)
5868 if (!CONS_MARKED_P (&cblk
->conses
[i
]))
5871 cblk
->conses
[i
].u
.chain
= cons_free_list
;
5872 cons_free_list
= &cblk
->conses
[i
];
5874 cons_free_list
->car
= Vdead
;
5880 CONS_UNMARK (&cblk
->conses
[i
]);
5882 lim
= CONS_BLOCK_SIZE
;
5883 /* If this block contains only free conses and we have already
5884 seen more than two blocks worth of free conses then deallocate
5886 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5888 *cprev
= cblk
->next
;
5889 /* Unhook from the free list. */
5890 cons_free_list
= cblk
->conses
[0].u
.chain
;
5891 lisp_align_free (cblk
);
5896 num_free
+= this_free
;
5897 cprev
= &cblk
->next
;
5900 total_conses
= num_used
;
5901 total_free_conses
= num_free
;
5904 /* Put all unmarked floats on free list */
5906 register struct float_block
*fblk
;
5907 struct float_block
**fprev
= &float_block
;
5908 register int lim
= float_block_index
;
5909 register int num_free
= 0, num_used
= 0;
5911 float_free_list
= 0;
5913 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5917 for (i
= 0; i
< lim
; i
++)
5918 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5921 fblk
->floats
[i
].u
.chain
= float_free_list
;
5922 float_free_list
= &fblk
->floats
[i
];
5927 FLOAT_UNMARK (&fblk
->floats
[i
]);
5929 lim
= FLOAT_BLOCK_SIZE
;
5930 /* If this block contains only free floats and we have already
5931 seen more than two blocks worth of free floats then deallocate
5933 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5935 *fprev
= fblk
->next
;
5936 /* Unhook from the free list. */
5937 float_free_list
= fblk
->floats
[0].u
.chain
;
5938 lisp_align_free (fblk
);
5943 num_free
+= this_free
;
5944 fprev
= &fblk
->next
;
5947 total_floats
= num_used
;
5948 total_free_floats
= num_free
;
5951 /* Put all unmarked intervals on free list */
5953 register struct interval_block
*iblk
;
5954 struct interval_block
**iprev
= &interval_block
;
5955 register int lim
= interval_block_index
;
5956 register int num_free
= 0, num_used
= 0;
5958 interval_free_list
= 0;
5960 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5965 for (i
= 0; i
< lim
; i
++)
5967 if (!iblk
->intervals
[i
].gcmarkbit
)
5969 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5970 interval_free_list
= &iblk
->intervals
[i
];
5976 iblk
->intervals
[i
].gcmarkbit
= 0;
5979 lim
= INTERVAL_BLOCK_SIZE
;
5980 /* If this block contains only free intervals and we have already
5981 seen more than two blocks worth of free intervals then
5982 deallocate this block. */
5983 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5985 *iprev
= iblk
->next
;
5986 /* Unhook from the free list. */
5987 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5989 n_interval_blocks
--;
5993 num_free
+= this_free
;
5994 iprev
= &iblk
->next
;
5997 total_intervals
= num_used
;
5998 total_free_intervals
= num_free
;
6001 /* Put all unmarked symbols on free list */
6003 register struct symbol_block
*sblk
;
6004 struct symbol_block
**sprev
= &symbol_block
;
6005 register int lim
= symbol_block_index
;
6006 register int num_free
= 0, num_used
= 0;
6008 symbol_free_list
= NULL
;
6010 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
6013 struct Lisp_Symbol
*sym
= sblk
->symbols
;
6014 struct Lisp_Symbol
*end
= sym
+ lim
;
6016 for (; sym
< end
; ++sym
)
6018 /* Check if the symbol was created during loadup. In such a case
6019 it might be pointed to by pure bytecode which we don't trace,
6020 so we conservatively assume that it is live. */
6021 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
6023 if (!sym
->gcmarkbit
&& !pure_p
)
6025 sym
->next
= symbol_free_list
;
6026 symbol_free_list
= sym
;
6028 symbol_free_list
->function
= Vdead
;
6036 UNMARK_STRING (XSTRING (sym
->xname
));
6041 lim
= SYMBOL_BLOCK_SIZE
;
6042 /* If this block contains only free symbols and we have already
6043 seen more than two blocks worth of free symbols then deallocate
6045 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6047 *sprev
= sblk
->next
;
6048 /* Unhook from the free list. */
6049 symbol_free_list
= sblk
->symbols
[0].next
;
6055 num_free
+= this_free
;
6056 sprev
= &sblk
->next
;
6059 total_symbols
= num_used
;
6060 total_free_symbols
= num_free
;
6063 /* Put all unmarked misc's on free list.
6064 For a marker, first unchain it from the buffer it points into. */
6066 register struct marker_block
*mblk
;
6067 struct marker_block
**mprev
= &marker_block
;
6068 register int lim
= marker_block_index
;
6069 register int num_free
= 0, num_used
= 0;
6071 marker_free_list
= 0;
6073 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6078 for (i
= 0; i
< lim
; i
++)
6080 if (!mblk
->markers
[i
].u_marker
.gcmarkbit
)
6082 if (mblk
->markers
[i
].u_marker
.type
== Lisp_Misc_Marker
)
6083 unchain_marker (&mblk
->markers
[i
].u_marker
);
6084 /* Set the type of the freed object to Lisp_Misc_Free.
6085 We could leave the type alone, since nobody checks it,
6086 but this might catch bugs faster. */
6087 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
6088 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
6089 marker_free_list
= &mblk
->markers
[i
];
6095 mblk
->markers
[i
].u_marker
.gcmarkbit
= 0;
6098 lim
= MARKER_BLOCK_SIZE
;
6099 /* If this block contains only free markers and we have already
6100 seen more than two blocks worth of free markers then deallocate
6102 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6104 *mprev
= mblk
->next
;
6105 /* Unhook from the free list. */
6106 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
6112 num_free
+= this_free
;
6113 mprev
= &mblk
->next
;
6117 total_markers
= num_used
;
6118 total_free_markers
= num_free
;
6121 /* Free all unmarked buffers */
6123 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6126 if (!VECTOR_MARKED_P (buffer
))
6129 prev
->next
= buffer
->next
;
6131 all_buffers
= buffer
->next
;
6132 next
= buffer
->next
;
6138 VECTOR_UNMARK (buffer
);
6139 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6140 prev
= buffer
, buffer
= buffer
->next
;
6144 /* Free all unmarked vectors */
6146 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6147 total_vector_size
= 0;
6150 if (!VECTOR_MARKED_P (vector
))
6153 prev
->next
= vector
->next
;
6155 all_vectors
= vector
->next
;
6156 next
= vector
->next
;
6164 VECTOR_UNMARK (vector
);
6165 if (vector
->size
& PSEUDOVECTOR_FLAG
)
6166 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
6168 total_vector_size
+= vector
->size
;
6169 prev
= vector
, vector
= vector
->next
;
6173 #ifdef GC_CHECK_STRING_BYTES
6174 if (!noninteractive
)
6175 check_string_bytes (1);
6182 /* Debugging aids. */
6184 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6185 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6186 This may be helpful in debugging Emacs's memory usage.
6187 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6192 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
6197 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6198 doc
: /* Return a list of counters that measure how much consing there has been.
6199 Each of these counters increments for a certain kind of object.
6200 The counters wrap around from the largest positive integer to zero.
6201 Garbage collection does not decrease them.
6202 The elements of the value are as follows:
6203 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6204 All are in units of 1 = one object consed
6205 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6207 MISCS include overlays, markers, and some internal types.
6208 Frames, windows, buffers, and subprocesses count as vectors
6209 (but the contents of a buffer's text do not count here). */)
6212 Lisp_Object consed
[8];
6214 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6215 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6216 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6217 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6218 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6219 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6220 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6221 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6223 return Flist (8, consed
);
6226 int suppress_checking
;
6228 die (msg
, file
, line
)
6233 fprintf (stderr
, "\r\nEmacs fatal error: %s:%d: %s\r\n",
6238 /* Initialization */
6243 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6245 pure_size
= PURESIZE
;
6246 pure_bytes_used
= 0;
6247 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6248 pure_bytes_used_before_overflow
= 0;
6250 /* Initialize the list of free aligned blocks. */
6253 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6255 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6259 ignore_warnings
= 1;
6260 #ifdef DOUG_LEA_MALLOC
6261 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6262 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6263 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6273 malloc_hysteresis
= 32;
6275 malloc_hysteresis
= 0;
6278 refill_memory_reserve ();
6280 ignore_warnings
= 0;
6282 byte_stack_list
= 0;
6284 consing_since_gc
= 0;
6285 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6286 gc_relative_threshold
= 0;
6288 #ifdef VIRT_ADDR_VARIES
6289 malloc_sbrk_unused
= 1<<22; /* A large number */
6290 malloc_sbrk_used
= 100000; /* as reasonable as any number */
6291 #endif /* VIRT_ADDR_VARIES */
6298 byte_stack_list
= 0;
6300 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6301 setjmp_tested_p
= longjmps_done
= 0;
6304 Vgc_elapsed
= make_float (0.0);
6311 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
6312 doc
: /* *Number of bytes of consing between garbage collections.
6313 Garbage collection can happen automatically once this many bytes have been
6314 allocated since the last garbage collection. All data types count.
6316 Garbage collection happens automatically only when `eval' is called.
6318 By binding this temporarily to a large number, you can effectively
6319 prevent garbage collection during a part of the program.
6320 See also `gc-cons-percentage'. */);
6322 DEFVAR_LISP ("gc-cons-percentage", &Vgc_cons_percentage
,
6323 doc
: /* *Portion of the heap used for allocation.
6324 Garbage collection can happen automatically once this portion of the heap
6325 has been allocated since the last garbage collection.
6326 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6327 Vgc_cons_percentage
= make_float (0.1);
6329 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
6330 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6332 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
6333 doc
: /* Number of cons cells that have been consed so far. */);
6335 DEFVAR_INT ("floats-consed", &floats_consed
,
6336 doc
: /* Number of floats that have been consed so far. */);
6338 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
6339 doc
: /* Number of vector cells that have been consed so far. */);
6341 DEFVAR_INT ("symbols-consed", &symbols_consed
,
6342 doc
: /* Number of symbols that have been consed so far. */);
6344 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
6345 doc
: /* Number of string characters that have been consed so far. */);
6347 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
6348 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6350 DEFVAR_INT ("intervals-consed", &intervals_consed
,
6351 doc
: /* Number of intervals that have been consed so far. */);
6353 DEFVAR_INT ("strings-consed", &strings_consed
,
6354 doc
: /* Number of strings that have been consed so far. */);
6356 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
6357 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6358 This means that certain objects should be allocated in shared (pure) space. */);
6360 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
6361 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6362 garbage_collection_messages
= 0;
6364 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
6365 doc
: /* Hook run after garbage collection has finished. */);
6366 Vpost_gc_hook
= Qnil
;
6367 Qpost_gc_hook
= intern ("post-gc-hook");
6368 staticpro (&Qpost_gc_hook
);
6370 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
6371 doc
: /* Precomputed `signal' argument for memory-full error. */);
6372 /* We build this in advance because if we wait until we need it, we might
6373 not be able to allocate the memory to hold it. */
6376 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
6378 DEFVAR_LISP ("memory-full", &Vmemory_full
,
6379 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6380 Vmemory_full
= Qnil
;
6382 staticpro (&Qgc_cons_threshold
);
6383 Qgc_cons_threshold
= intern ("gc-cons-threshold");
6385 staticpro (&Qchar_table_extra_slots
);
6386 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
6388 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
6389 doc
: /* Accumulated time elapsed in garbage collections.
6390 The time is in seconds as a floating point value. */);
6391 DEFVAR_INT ("gcs-done", &gcs_done
,
6392 doc
: /* Accumulated number of garbage collections done. */);
6397 defsubr (&Smake_byte_code
);
6398 defsubr (&Smake_list
);
6399 defsubr (&Smake_vector
);
6400 defsubr (&Smake_char_table
);
6401 defsubr (&Smake_string
);
6402 defsubr (&Smake_bool_vector
);
6403 defsubr (&Smake_symbol
);
6404 defsubr (&Smake_marker
);
6405 defsubr (&Spurecopy
);
6406 defsubr (&Sgarbage_collect
);
6407 defsubr (&Smemory_limit
);
6408 defsubr (&Smemory_use_counts
);
6410 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6411 defsubr (&Sgc_status
);
6415 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
6416 (do not change this comment) */