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, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
6 This file is part of GNU Emacs.
8 GNU Emacs is free software: you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation, either version 3 of the License, or
11 (at your option) any later version.
13 GNU Emacs is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>. */
23 #include <limits.h> /* For CHAR_BIT. */
32 #ifdef HAVE_GTK_AND_PTHREAD
36 /* This file is part of the core Lisp implementation, and thus must
37 deal with the real data structures. If the Lisp implementation is
38 replaced, this file likely will not be used. */
40 #undef HIDE_LISP_IMPLEMENTATION
43 #include "intervals.h"
49 #include "blockinput.h"
50 #include "character.h"
51 #include "syssignal.h"
52 #include "termhooks.h" /* For struct terminal. */
55 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
56 memory. Can do this only if using gmalloc.c. */
58 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
59 #undef GC_MALLOC_CHECK
65 extern POINTER_TYPE
*sbrk ();
80 #ifdef DOUG_LEA_MALLOC
83 /* malloc.h #defines this as size_t, at least in glibc2. */
84 #ifndef __malloc_size_t
85 #define __malloc_size_t int
88 /* Specify maximum number of areas to mmap. It would be nice to use a
89 value that explicitly means "no limit". */
91 #define MMAP_MAX_AREAS 100000000
93 #else /* not DOUG_LEA_MALLOC */
95 /* The following come from gmalloc.c. */
97 #define __malloc_size_t size_t
98 extern __malloc_size_t _bytes_used
;
99 extern __malloc_size_t __malloc_extra_blocks
;
101 #endif /* not DOUG_LEA_MALLOC */
103 #if ! defined (SYSTEM_MALLOC) && defined (HAVE_GTK_AND_PTHREAD)
105 /* When GTK uses the file chooser dialog, different backends can be loaded
106 dynamically. One such a backend is the Gnome VFS backend that gets loaded
107 if you run Gnome. That backend creates several threads and also allocates
110 If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_*
111 functions below are called from malloc, there is a chance that one
112 of these threads preempts the Emacs main thread and the hook variables
113 end up in an inconsistent state. So we have a mutex to prevent that (note
114 that the backend handles concurrent access to malloc within its own threads
115 but Emacs code running in the main thread is not included in that control).
117 When UNBLOCK_INPUT is called, reinvoke_input_signal may be called. If this
118 happens in one of the backend threads we will have two threads that tries
119 to run Emacs code at once, and the code is not prepared for that.
120 To prevent that, we only call BLOCK/UNBLOCK from the main thread. */
122 static pthread_mutex_t alloc_mutex
;
124 #define BLOCK_INPUT_ALLOC \
127 if (pthread_equal (pthread_self (), main_thread)) \
129 pthread_mutex_lock (&alloc_mutex); \
132 #define UNBLOCK_INPUT_ALLOC \
135 pthread_mutex_unlock (&alloc_mutex); \
136 if (pthread_equal (pthread_self (), main_thread)) \
141 #else /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
143 #define BLOCK_INPUT_ALLOC BLOCK_INPUT
144 #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT
146 #endif /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
148 /* Value of _bytes_used, when spare_memory was freed. */
150 static __malloc_size_t bytes_used_when_full
;
152 static __malloc_size_t bytes_used_when_reconsidered
;
154 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
155 to a struct Lisp_String. */
157 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
158 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
159 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
161 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
162 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
163 #define VECTOR_MARKED_P(V) (((V)->size & ARRAY_MARK_FLAG) != 0)
165 /* Value is the number of bytes/chars of S, a pointer to a struct
166 Lisp_String. This must be used instead of STRING_BYTES (S) or
167 S->size during GC, because S->size contains the mark bit for
170 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
171 #define GC_STRING_CHARS(S) ((S)->size & ~ARRAY_MARK_FLAG)
173 /* Number of bytes of consing done since the last gc. */
175 int consing_since_gc
;
177 /* Count the amount of consing of various sorts of space. */
179 EMACS_INT cons_cells_consed
;
180 EMACS_INT floats_consed
;
181 EMACS_INT vector_cells_consed
;
182 EMACS_INT symbols_consed
;
183 EMACS_INT string_chars_consed
;
184 EMACS_INT misc_objects_consed
;
185 EMACS_INT intervals_consed
;
186 EMACS_INT strings_consed
;
188 /* Minimum number of bytes of consing since GC before next GC. */
190 EMACS_INT gc_cons_threshold
;
192 /* Similar minimum, computed from Vgc_cons_percentage. */
194 EMACS_INT gc_relative_threshold
;
196 static Lisp_Object Vgc_cons_percentage
;
198 /* Minimum number of bytes of consing since GC before next GC,
199 when memory is full. */
201 EMACS_INT memory_full_cons_threshold
;
203 /* Nonzero during GC. */
207 /* Nonzero means abort if try to GC.
208 This is for code which is written on the assumption that
209 no GC will happen, so as to verify that assumption. */
213 /* Nonzero means display messages at beginning and end of GC. */
215 int garbage_collection_messages
;
217 #ifndef VIRT_ADDR_VARIES
219 #endif /* VIRT_ADDR_VARIES */
220 int malloc_sbrk_used
;
222 #ifndef VIRT_ADDR_VARIES
224 #endif /* VIRT_ADDR_VARIES */
225 int malloc_sbrk_unused
;
227 /* Number of live and free conses etc. */
229 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
230 static int total_free_conses
, total_free_markers
, total_free_symbols
;
231 static int total_free_floats
, total_floats
;
233 /* Points to memory space allocated as "spare", to be freed if we run
234 out of memory. We keep one large block, four cons-blocks, and
235 two string blocks. */
237 static char *spare_memory
[7];
239 /* Amount of spare memory to keep in large reserve block. */
241 #define SPARE_MEMORY (1 << 14)
243 /* Number of extra blocks malloc should get when it needs more core. */
245 static int malloc_hysteresis
;
247 /* Non-nil means defun should do purecopy on the function definition. */
249 Lisp_Object Vpurify_flag
;
251 /* Non-nil means we are handling a memory-full error. */
253 Lisp_Object Vmemory_full
;
255 /* Initialize it to a nonzero value to force it into data space
256 (rather than bss space). That way unexec will remap it into text
257 space (pure), on some systems. We have not implemented the
258 remapping on more recent systems because this is less important
259 nowadays than in the days of small memories and timesharing. */
261 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
262 #define PUREBEG (char *) pure
264 /* Pointer to the pure area, and its size. */
266 static char *purebeg
;
267 static size_t pure_size
;
269 /* Number of bytes of pure storage used before pure storage overflowed.
270 If this is non-zero, this implies that an overflow occurred. */
272 static size_t pure_bytes_used_before_overflow
;
274 /* Value is non-zero if P points into pure space. */
276 #define PURE_POINTER_P(P) \
277 (((PNTR_COMPARISON_TYPE) (P) \
278 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
279 && ((PNTR_COMPARISON_TYPE) (P) \
280 >= (PNTR_COMPARISON_TYPE) purebeg))
282 /* Total number of bytes allocated in pure storage. */
284 EMACS_INT pure_bytes_used
;
286 /* Index in pure at which next pure Lisp object will be allocated.. */
288 static EMACS_INT pure_bytes_used_lisp
;
290 /* Number of bytes allocated for non-Lisp objects in pure storage. */
292 static EMACS_INT pure_bytes_used_non_lisp
;
294 /* If nonzero, this is a warning delivered by malloc and not yet
297 const char *pending_malloc_warning
;
299 /* Pre-computed signal argument for use when memory is exhausted. */
301 Lisp_Object Vmemory_signal_data
;
303 /* Maximum amount of C stack to save when a GC happens. */
305 #ifndef MAX_SAVE_STACK
306 #define MAX_SAVE_STACK 16000
309 /* Buffer in which we save a copy of the C stack at each GC. */
311 static char *stack_copy
;
312 static int stack_copy_size
;
314 /* Non-zero means ignore malloc warnings. Set during initialization.
315 Currently not used. */
317 static int ignore_warnings
;
319 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
321 /* Hook run after GC has finished. */
323 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
325 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
326 EMACS_INT gcs_done
; /* accumulated GCs */
328 static void mark_buffer (Lisp_Object
);
329 static void mark_terminals (void);
330 extern void mark_kboards (void);
331 extern void mark_ttys (void);
332 extern void mark_backtrace (void);
333 static void gc_sweep (void);
334 static void mark_glyph_matrix (struct glyph_matrix
*);
335 static void mark_face_cache (struct face_cache
*);
337 #ifdef HAVE_WINDOW_SYSTEM
338 extern void mark_fringe_data (void);
339 #endif /* HAVE_WINDOW_SYSTEM */
341 static struct Lisp_String
*allocate_string (void);
342 static void compact_small_strings (void);
343 static void free_large_strings (void);
344 static void sweep_strings (void);
346 extern int message_enable_multibyte
;
348 /* When scanning the C stack for live Lisp objects, Emacs keeps track
349 of what memory allocated via lisp_malloc is intended for what
350 purpose. This enumeration specifies the type of memory. */
361 /* We used to keep separate mem_types for subtypes of vectors such as
362 process, hash_table, frame, terminal, and window, but we never made
363 use of the distinction, so it only caused source-code complexity
364 and runtime slowdown. Minor but pointless. */
368 static POINTER_TYPE
*lisp_align_malloc (size_t, enum mem_type
);
369 static POINTER_TYPE
*lisp_malloc (size_t, enum mem_type
);
370 void refill_memory_reserve (void);
373 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
375 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
376 #include <stdio.h> /* For fprintf. */
379 /* A unique object in pure space used to make some Lisp objects
380 on free lists recognizable in O(1). */
382 static Lisp_Object Vdead
;
384 #ifdef GC_MALLOC_CHECK
386 enum mem_type allocated_mem_type
;
387 static int dont_register_blocks
;
389 #endif /* GC_MALLOC_CHECK */
391 /* A node in the red-black tree describing allocated memory containing
392 Lisp data. Each such block is recorded with its start and end
393 address when it is allocated, and removed from the tree when it
396 A red-black tree is a balanced binary tree with the following
399 1. Every node is either red or black.
400 2. Every leaf is black.
401 3. If a node is red, then both of its children are black.
402 4. Every simple path from a node to a descendant leaf contains
403 the same number of black nodes.
404 5. The root is always black.
406 When nodes are inserted into the tree, or deleted from the tree,
407 the tree is "fixed" so that these properties are always true.
409 A red-black tree with N internal nodes has height at most 2
410 log(N+1). Searches, insertions and deletions are done in O(log N).
411 Please see a text book about data structures for a detailed
412 description of red-black trees. Any book worth its salt should
417 /* Children of this node. These pointers are never NULL. When there
418 is no child, the value is MEM_NIL, which points to a dummy node. */
419 struct mem_node
*left
, *right
;
421 /* The parent of this node. In the root node, this is NULL. */
422 struct mem_node
*parent
;
424 /* Start and end of allocated region. */
428 enum {MEM_BLACK
, MEM_RED
} color
;
434 /* Base address of stack. Set in main. */
436 Lisp_Object
*stack_base
;
438 /* Root of the tree describing allocated Lisp memory. */
440 static struct mem_node
*mem_root
;
442 /* Lowest and highest known address in the heap. */
444 static void *min_heap_address
, *max_heap_address
;
446 /* Sentinel node of the tree. */
448 static struct mem_node mem_z
;
449 #define MEM_NIL &mem_z
451 static POINTER_TYPE
*lisp_malloc (size_t, enum mem_type
);
452 static struct Lisp_Vector
*allocate_vectorlike (EMACS_INT
);
453 static void lisp_free (POINTER_TYPE
*);
454 static void mark_stack (void);
455 static int live_vector_p (struct mem_node
*, void *);
456 static int live_buffer_p (struct mem_node
*, void *);
457 static int live_string_p (struct mem_node
*, void *);
458 static int live_cons_p (struct mem_node
*, void *);
459 static int live_symbol_p (struct mem_node
*, void *);
460 static int live_float_p (struct mem_node
*, void *);
461 static int live_misc_p (struct mem_node
*, void *);
462 static void mark_maybe_object (Lisp_Object
);
463 static void mark_memory (void *, void *, int);
464 static void mem_init (void);
465 static struct mem_node
*mem_insert (void *, void *, enum mem_type
);
466 static void mem_insert_fixup (struct mem_node
*);
467 static void mem_rotate_left (struct mem_node
*);
468 static void mem_rotate_right (struct mem_node
*);
469 static void mem_delete (struct mem_node
*);
470 static void mem_delete_fixup (struct mem_node
*);
471 static INLINE
struct mem_node
*mem_find (void *);
474 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
475 static void check_gcpros (void);
478 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
480 /* Recording what needs to be marked for gc. */
482 struct gcpro
*gcprolist
;
484 /* Addresses of staticpro'd variables. Initialize it to a nonzero
485 value; otherwise some compilers put it into BSS. */
487 #define NSTATICS 0x640
488 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
490 /* Index of next unused slot in staticvec. */
492 static int staticidx
= 0;
494 static POINTER_TYPE
*pure_alloc (size_t, int);
497 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
498 ALIGNMENT must be a power of 2. */
500 #define ALIGN(ptr, ALIGNMENT) \
501 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
502 & ~((ALIGNMENT) - 1)))
506 /************************************************************************
508 ************************************************************************/
510 /* Function malloc calls this if it finds we are near exhausting storage. */
513 malloc_warning (const char *str
)
515 pending_malloc_warning
= str
;
519 /* Display an already-pending malloc warning. */
522 display_malloc_warning (void)
524 call3 (intern ("display-warning"),
526 build_string (pending_malloc_warning
),
527 intern ("emergency"));
528 pending_malloc_warning
= 0;
532 #ifdef DOUG_LEA_MALLOC
533 # define BYTES_USED (mallinfo ().uordblks)
535 # define BYTES_USED _bytes_used
538 /* Called if we can't allocate relocatable space for a buffer. */
541 buffer_memory_full (void)
543 /* If buffers use the relocating allocator, no need to free
544 spare_memory, because we may have plenty of malloc space left
545 that we could get, and if we don't, the malloc that fails will
546 itself cause spare_memory to be freed. If buffers don't use the
547 relocating allocator, treat this like any other failing
554 /* This used to call error, but if we've run out of memory, we could
555 get infinite recursion trying to build the string. */
556 xsignal (Qnil
, Vmemory_signal_data
);
560 #ifdef XMALLOC_OVERRUN_CHECK
562 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
563 and a 16 byte trailer around each block.
565 The header consists of 12 fixed bytes + a 4 byte integer contaning the
566 original block size, while the trailer consists of 16 fixed bytes.
568 The header is used to detect whether this block has been allocated
569 through these functions -- as it seems that some low-level libc
570 functions may bypass the malloc hooks.
574 #define XMALLOC_OVERRUN_CHECK_SIZE 16
576 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
577 { 0x9a, 0x9b, 0xae, 0xaf,
578 0xbf, 0xbe, 0xce, 0xcf,
579 0xea, 0xeb, 0xec, 0xed };
581 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
582 { 0xaa, 0xab, 0xac, 0xad,
583 0xba, 0xbb, 0xbc, 0xbd,
584 0xca, 0xcb, 0xcc, 0xcd,
585 0xda, 0xdb, 0xdc, 0xdd };
587 /* Macros to insert and extract the block size in the header. */
589 #define XMALLOC_PUT_SIZE(ptr, size) \
590 (ptr[-1] = (size & 0xff), \
591 ptr[-2] = ((size >> 8) & 0xff), \
592 ptr[-3] = ((size >> 16) & 0xff), \
593 ptr[-4] = ((size >> 24) & 0xff))
595 #define XMALLOC_GET_SIZE(ptr) \
596 (size_t)((unsigned)(ptr[-1]) | \
597 ((unsigned)(ptr[-2]) << 8) | \
598 ((unsigned)(ptr[-3]) << 16) | \
599 ((unsigned)(ptr[-4]) << 24))
602 /* The call depth in overrun_check functions. For example, this might happen:
604 overrun_check_malloc()
605 -> malloc -> (via hook)_-> emacs_blocked_malloc
606 -> overrun_check_malloc
607 call malloc (hooks are NULL, so real malloc is called).
608 malloc returns 10000.
609 add overhead, return 10016.
610 <- (back in overrun_check_malloc)
611 add overhead again, return 10032
612 xmalloc returns 10032.
617 overrun_check_free(10032)
619 free(10016) <- crash, because 10000 is the original pointer. */
621 static int check_depth
;
623 /* Like malloc, but wraps allocated block with header and trailer. */
626 overrun_check_malloc (size
)
629 register unsigned char *val
;
630 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
632 val
= (unsigned char *) malloc (size
+ overhead
);
633 if (val
&& check_depth
== 1)
635 memcpy (val
, xmalloc_overrun_check_header
,
636 XMALLOC_OVERRUN_CHECK_SIZE
- 4);
637 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
638 XMALLOC_PUT_SIZE(val
, size
);
639 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
640 XMALLOC_OVERRUN_CHECK_SIZE
);
643 return (POINTER_TYPE
*)val
;
647 /* Like realloc, but checks old block for overrun, and wraps new block
648 with header and trailer. */
651 overrun_check_realloc (block
, size
)
655 register unsigned char *val
= (unsigned char *)block
;
656 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
660 && memcmp (xmalloc_overrun_check_header
,
661 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
662 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
664 size_t osize
= XMALLOC_GET_SIZE (val
);
665 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
666 XMALLOC_OVERRUN_CHECK_SIZE
))
668 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
669 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
670 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
673 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
675 if (val
&& check_depth
== 1)
677 memcpy (val
, xmalloc_overrun_check_header
,
678 XMALLOC_OVERRUN_CHECK_SIZE
- 4);
679 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
680 XMALLOC_PUT_SIZE(val
, size
);
681 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
682 XMALLOC_OVERRUN_CHECK_SIZE
);
685 return (POINTER_TYPE
*)val
;
688 /* Like free, but checks block for overrun. */
691 overrun_check_free (block
)
694 unsigned char *val
= (unsigned char *)block
;
699 && memcmp (xmalloc_overrun_check_header
,
700 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
701 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
703 size_t osize
= XMALLOC_GET_SIZE (val
);
704 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
705 XMALLOC_OVERRUN_CHECK_SIZE
))
707 #ifdef XMALLOC_CLEAR_FREE_MEMORY
708 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
709 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
711 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
712 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
713 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
724 #define malloc overrun_check_malloc
725 #define realloc overrun_check_realloc
726 #define free overrun_check_free
730 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
731 there's no need to block input around malloc. */
732 #define MALLOC_BLOCK_INPUT ((void)0)
733 #define MALLOC_UNBLOCK_INPUT ((void)0)
735 #define MALLOC_BLOCK_INPUT BLOCK_INPUT
736 #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT
739 /* Like malloc but check for no memory and block interrupt input.. */
742 xmalloc (size_t size
)
744 register POINTER_TYPE
*val
;
747 val
= (POINTER_TYPE
*) malloc (size
);
748 MALLOC_UNBLOCK_INPUT
;
756 /* Like realloc but check for no memory and block interrupt input.. */
759 xrealloc (POINTER_TYPE
*block
, size_t size
)
761 register POINTER_TYPE
*val
;
764 /* We must call malloc explicitly when BLOCK is 0, since some
765 reallocs don't do this. */
767 val
= (POINTER_TYPE
*) malloc (size
);
769 val
= (POINTER_TYPE
*) realloc (block
, size
);
770 MALLOC_UNBLOCK_INPUT
;
772 if (!val
&& size
) memory_full ();
777 /* Like free but block interrupt input. */
780 xfree (POINTER_TYPE
*block
)
786 MALLOC_UNBLOCK_INPUT
;
787 /* We don't call refill_memory_reserve here
788 because that duplicates doing so in emacs_blocked_free
789 and the criterion should go there. */
793 /* Like strdup, but uses xmalloc. */
796 xstrdup (const char *s
)
798 size_t len
= strlen (s
) + 1;
799 char *p
= (char *) xmalloc (len
);
805 /* Unwind for SAFE_ALLOCA */
808 safe_alloca_unwind (Lisp_Object arg
)
810 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
820 /* Like malloc but used for allocating Lisp data. NBYTES is the
821 number of bytes to allocate, TYPE describes the intended use of the
822 allcated memory block (for strings, for conses, ...). */
825 static void *lisp_malloc_loser
;
828 static POINTER_TYPE
*
829 lisp_malloc (size_t nbytes
, enum mem_type type
)
835 #ifdef GC_MALLOC_CHECK
836 allocated_mem_type
= type
;
839 val
= (void *) malloc (nbytes
);
842 /* If the memory just allocated cannot be addressed thru a Lisp
843 object's pointer, and it needs to be,
844 that's equivalent to running out of memory. */
845 if (val
&& type
!= MEM_TYPE_NON_LISP
)
848 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
849 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
851 lisp_malloc_loser
= val
;
858 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
859 if (val
&& type
!= MEM_TYPE_NON_LISP
)
860 mem_insert (val
, (char *) val
+ nbytes
, type
);
863 MALLOC_UNBLOCK_INPUT
;
869 /* Free BLOCK. This must be called to free memory allocated with a
870 call to lisp_malloc. */
873 lisp_free (POINTER_TYPE
*block
)
877 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
878 mem_delete (mem_find (block
));
880 MALLOC_UNBLOCK_INPUT
;
883 /* Allocation of aligned blocks of memory to store Lisp data. */
884 /* The entry point is lisp_align_malloc which returns blocks of at most */
885 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
887 /* Use posix_memalloc if the system has it and we're using the system's
888 malloc (because our gmalloc.c routines don't have posix_memalign although
889 its memalloc could be used). */
890 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
891 #define USE_POSIX_MEMALIGN 1
894 /* BLOCK_ALIGN has to be a power of 2. */
895 #define BLOCK_ALIGN (1 << 10)
897 /* Padding to leave at the end of a malloc'd block. This is to give
898 malloc a chance to minimize the amount of memory wasted to alignment.
899 It should be tuned to the particular malloc library used.
900 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
901 posix_memalign on the other hand would ideally prefer a value of 4
902 because otherwise, there's 1020 bytes wasted between each ablocks.
903 In Emacs, testing shows that those 1020 can most of the time be
904 efficiently used by malloc to place other objects, so a value of 0 can
905 still preferable unless you have a lot of aligned blocks and virtually
907 #define BLOCK_PADDING 0
908 #define BLOCK_BYTES \
909 (BLOCK_ALIGN - sizeof (struct ablock *) - BLOCK_PADDING)
911 /* Internal data structures and constants. */
913 #define ABLOCKS_SIZE 16
915 /* An aligned block of memory. */
920 char payload
[BLOCK_BYTES
];
921 struct ablock
*next_free
;
923 /* `abase' is the aligned base of the ablocks. */
924 /* It is overloaded to hold the virtual `busy' field that counts
925 the number of used ablock in the parent ablocks.
926 The first ablock has the `busy' field, the others have the `abase'
927 field. To tell the difference, we assume that pointers will have
928 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
929 is used to tell whether the real base of the parent ablocks is `abase'
930 (if not, the word before the first ablock holds a pointer to the
932 struct ablocks
*abase
;
933 /* The padding of all but the last ablock is unused. The padding of
934 the last ablock in an ablocks is not allocated. */
936 char padding
[BLOCK_PADDING
];
940 /* A bunch of consecutive aligned blocks. */
943 struct ablock blocks
[ABLOCKS_SIZE
];
946 /* Size of the block requested from malloc or memalign. */
947 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
949 #define ABLOCK_ABASE(block) \
950 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
951 ? (struct ablocks *)(block) \
954 /* Virtual `busy' field. */
955 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
957 /* Pointer to the (not necessarily aligned) malloc block. */
958 #ifdef USE_POSIX_MEMALIGN
959 #define ABLOCKS_BASE(abase) (abase)
961 #define ABLOCKS_BASE(abase) \
962 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
965 /* The list of free ablock. */
966 static struct ablock
*free_ablock
;
968 /* Allocate an aligned block of nbytes.
969 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
970 smaller or equal to BLOCK_BYTES. */
971 static POINTER_TYPE
*
972 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
975 struct ablocks
*abase
;
977 eassert (nbytes
<= BLOCK_BYTES
);
981 #ifdef GC_MALLOC_CHECK
982 allocated_mem_type
= type
;
988 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
990 #ifdef DOUG_LEA_MALLOC
991 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
992 because mapped region contents are not preserved in
994 mallopt (M_MMAP_MAX
, 0);
997 #ifdef USE_POSIX_MEMALIGN
999 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1005 base
= malloc (ABLOCKS_BYTES
);
1006 abase
= ALIGN (base
, BLOCK_ALIGN
);
1011 MALLOC_UNBLOCK_INPUT
;
1015 aligned
= (base
== abase
);
1017 ((void**)abase
)[-1] = base
;
1019 #ifdef DOUG_LEA_MALLOC
1020 /* Back to a reasonable maximum of mmap'ed areas. */
1021 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1025 /* If the memory just allocated cannot be addressed thru a Lisp
1026 object's pointer, and it needs to be, that's equivalent to
1027 running out of memory. */
1028 if (type
!= MEM_TYPE_NON_LISP
)
1031 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1032 XSETCONS (tem
, end
);
1033 if ((char *) XCONS (tem
) != end
)
1035 lisp_malloc_loser
= base
;
1037 MALLOC_UNBLOCK_INPUT
;
1043 /* Initialize the blocks and put them on the free list.
1044 Is `base' was not properly aligned, we can't use the last block. */
1045 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1047 abase
->blocks
[i
].abase
= abase
;
1048 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1049 free_ablock
= &abase
->blocks
[i
];
1051 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
1053 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
1054 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1055 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1056 eassert (ABLOCKS_BASE (abase
) == base
);
1057 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
1060 abase
= ABLOCK_ABASE (free_ablock
);
1061 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
1063 free_ablock
= free_ablock
->x
.next_free
;
1065 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1066 if (val
&& type
!= MEM_TYPE_NON_LISP
)
1067 mem_insert (val
, (char *) val
+ nbytes
, type
);
1070 MALLOC_UNBLOCK_INPUT
;
1074 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
1079 lisp_align_free (POINTER_TYPE
*block
)
1081 struct ablock
*ablock
= block
;
1082 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1085 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1086 mem_delete (mem_find (block
));
1088 /* Put on free list. */
1089 ablock
->x
.next_free
= free_ablock
;
1090 free_ablock
= ablock
;
1091 /* Update busy count. */
1092 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
1094 if (2 > (long) ABLOCKS_BUSY (abase
))
1095 { /* All the blocks are free. */
1096 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
1097 struct ablock
**tem
= &free_ablock
;
1098 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1102 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1105 *tem
= (*tem
)->x
.next_free
;
1108 tem
= &(*tem
)->x
.next_free
;
1110 eassert ((aligned
& 1) == aligned
);
1111 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1112 #ifdef USE_POSIX_MEMALIGN
1113 eassert ((unsigned long)ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1115 free (ABLOCKS_BASE (abase
));
1117 MALLOC_UNBLOCK_INPUT
;
1120 /* Return a new buffer structure allocated from the heap with
1121 a call to lisp_malloc. */
1124 allocate_buffer (void)
1127 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1129 b
->size
= sizeof (struct buffer
) / sizeof (EMACS_INT
);
1130 XSETPVECTYPE (b
, PVEC_BUFFER
);
1135 #ifndef SYSTEM_MALLOC
1137 /* Arranging to disable input signals while we're in malloc.
1139 This only works with GNU malloc. To help out systems which can't
1140 use GNU malloc, all the calls to malloc, realloc, and free
1141 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1142 pair; unfortunately, we have no idea what C library functions
1143 might call malloc, so we can't really protect them unless you're
1144 using GNU malloc. Fortunately, most of the major operating systems
1145 can use GNU malloc. */
1148 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
1149 there's no need to block input around malloc. */
1151 #ifndef DOUG_LEA_MALLOC
1152 extern void * (*__malloc_hook
) (size_t, const void *);
1153 extern void * (*__realloc_hook
) (void *, size_t, const void *);
1154 extern void (*__free_hook
) (void *, const void *);
1155 /* Else declared in malloc.h, perhaps with an extra arg. */
1156 #endif /* DOUG_LEA_MALLOC */
1157 static void * (*old_malloc_hook
) (size_t, const void *);
1158 static void * (*old_realloc_hook
) (void *, size_t, const void*);
1159 static void (*old_free_hook
) (void*, const void*);
1161 /* This function is used as the hook for free to call. */
1164 emacs_blocked_free (ptr
, ptr2
)
1170 #ifdef GC_MALLOC_CHECK
1176 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1179 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1184 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1188 #endif /* GC_MALLOC_CHECK */
1190 __free_hook
= old_free_hook
;
1193 /* If we released our reserve (due to running out of memory),
1194 and we have a fair amount free once again,
1195 try to set aside another reserve in case we run out once more. */
1196 if (! NILP (Vmemory_full
)
1197 /* Verify there is enough space that even with the malloc
1198 hysteresis this call won't run out again.
1199 The code here is correct as long as SPARE_MEMORY
1200 is substantially larger than the block size malloc uses. */
1201 && (bytes_used_when_full
1202 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1203 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1204 refill_memory_reserve ();
1206 __free_hook
= emacs_blocked_free
;
1207 UNBLOCK_INPUT_ALLOC
;
1211 /* This function is the malloc hook that Emacs uses. */
1214 emacs_blocked_malloc (size
, ptr
)
1221 __malloc_hook
= old_malloc_hook
;
1222 #ifdef DOUG_LEA_MALLOC
1223 /* Segfaults on my system. --lorentey */
1224 /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */
1226 __malloc_extra_blocks
= malloc_hysteresis
;
1229 value
= (void *) malloc (size
);
1231 #ifdef GC_MALLOC_CHECK
1233 struct mem_node
*m
= mem_find (value
);
1236 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1238 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1239 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1244 if (!dont_register_blocks
)
1246 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1247 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1250 #endif /* GC_MALLOC_CHECK */
1252 __malloc_hook
= emacs_blocked_malloc
;
1253 UNBLOCK_INPUT_ALLOC
;
1255 /* fprintf (stderr, "%p malloc\n", value); */
1260 /* This function is the realloc hook that Emacs uses. */
1263 emacs_blocked_realloc (ptr
, size
, ptr2
)
1271 __realloc_hook
= old_realloc_hook
;
1273 #ifdef GC_MALLOC_CHECK
1276 struct mem_node
*m
= mem_find (ptr
);
1277 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1280 "Realloc of %p which wasn't allocated with malloc\n",
1288 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1290 /* Prevent malloc from registering blocks. */
1291 dont_register_blocks
= 1;
1292 #endif /* GC_MALLOC_CHECK */
1294 value
= (void *) realloc (ptr
, size
);
1296 #ifdef GC_MALLOC_CHECK
1297 dont_register_blocks
= 0;
1300 struct mem_node
*m
= mem_find (value
);
1303 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1307 /* Can't handle zero size regions in the red-black tree. */
1308 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1311 /* fprintf (stderr, "%p <- realloc\n", value); */
1312 #endif /* GC_MALLOC_CHECK */
1314 __realloc_hook
= emacs_blocked_realloc
;
1315 UNBLOCK_INPUT_ALLOC
;
1321 #ifdef HAVE_GTK_AND_PTHREAD
1322 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1323 normal malloc. Some thread implementations need this as they call
1324 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1325 calls malloc because it is the first call, and we have an endless loop. */
1328 reset_malloc_hooks ()
1330 __free_hook
= old_free_hook
;
1331 __malloc_hook
= old_malloc_hook
;
1332 __realloc_hook
= old_realloc_hook
;
1334 #endif /* HAVE_GTK_AND_PTHREAD */
1337 /* Called from main to set up malloc to use our hooks. */
1340 uninterrupt_malloc ()
1342 #ifdef HAVE_GTK_AND_PTHREAD
1343 #ifdef DOUG_LEA_MALLOC
1344 pthread_mutexattr_t attr
;
1346 /* GLIBC has a faster way to do this, but lets keep it portable.
1347 This is according to the Single UNIX Specification. */
1348 pthread_mutexattr_init (&attr
);
1349 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1350 pthread_mutex_init (&alloc_mutex
, &attr
);
1351 #else /* !DOUG_LEA_MALLOC */
1352 /* Some systems such as Solaris 2.6 don't have a recursive mutex,
1353 and the bundled gmalloc.c doesn't require it. */
1354 pthread_mutex_init (&alloc_mutex
, NULL
);
1355 #endif /* !DOUG_LEA_MALLOC */
1356 #endif /* HAVE_GTK_AND_PTHREAD */
1358 if (__free_hook
!= emacs_blocked_free
)
1359 old_free_hook
= __free_hook
;
1360 __free_hook
= emacs_blocked_free
;
1362 if (__malloc_hook
!= emacs_blocked_malloc
)
1363 old_malloc_hook
= __malloc_hook
;
1364 __malloc_hook
= emacs_blocked_malloc
;
1366 if (__realloc_hook
!= emacs_blocked_realloc
)
1367 old_realloc_hook
= __realloc_hook
;
1368 __realloc_hook
= emacs_blocked_realloc
;
1371 #endif /* not SYNC_INPUT */
1372 #endif /* not SYSTEM_MALLOC */
1376 /***********************************************************************
1378 ***********************************************************************/
1380 /* Number of intervals allocated in an interval_block structure.
1381 The 1020 is 1024 minus malloc overhead. */
1383 #define INTERVAL_BLOCK_SIZE \
1384 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1386 /* Intervals are allocated in chunks in form of an interval_block
1389 struct interval_block
1391 /* Place `intervals' first, to preserve alignment. */
1392 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1393 struct interval_block
*next
;
1396 /* Current interval block. Its `next' pointer points to older
1399 static struct interval_block
*interval_block
;
1401 /* Index in interval_block above of the next unused interval
1404 static int interval_block_index
;
1406 /* Number of free and live intervals. */
1408 static int total_free_intervals
, total_intervals
;
1410 /* List of free intervals. */
1412 INTERVAL interval_free_list
;
1414 /* Total number of interval blocks now in use. */
1416 static int n_interval_blocks
;
1419 /* Initialize interval allocation. */
1422 init_intervals (void)
1424 interval_block
= NULL
;
1425 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1426 interval_free_list
= 0;
1427 n_interval_blocks
= 0;
1431 /* Return a new interval. */
1434 make_interval (void)
1438 /* eassert (!handling_signal); */
1442 if (interval_free_list
)
1444 val
= interval_free_list
;
1445 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1449 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1451 register struct interval_block
*newi
;
1453 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1456 newi
->next
= interval_block
;
1457 interval_block
= newi
;
1458 interval_block_index
= 0;
1459 n_interval_blocks
++;
1461 val
= &interval_block
->intervals
[interval_block_index
++];
1464 MALLOC_UNBLOCK_INPUT
;
1466 consing_since_gc
+= sizeof (struct interval
);
1468 RESET_INTERVAL (val
);
1474 /* Mark Lisp objects in interval I. */
1477 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1479 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1481 mark_object (i
->plist
);
1485 /* Mark the interval tree rooted in TREE. Don't call this directly;
1486 use the macro MARK_INTERVAL_TREE instead. */
1489 mark_interval_tree (register INTERVAL tree
)
1491 /* No need to test if this tree has been marked already; this
1492 function is always called through the MARK_INTERVAL_TREE macro,
1493 which takes care of that. */
1495 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1499 /* Mark the interval tree rooted in I. */
1501 #define MARK_INTERVAL_TREE(i) \
1503 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1504 mark_interval_tree (i); \
1508 #define UNMARK_BALANCE_INTERVALS(i) \
1510 if (! NULL_INTERVAL_P (i)) \
1511 (i) = balance_intervals (i); \
1515 /* Number support. If USE_LISP_UNION_TYPE is in effect, we
1516 can't create number objects in macros. */
1524 obj
.s
.type
= Lisp_Int
;
1529 /***********************************************************************
1531 ***********************************************************************/
1533 /* Lisp_Strings are allocated in string_block structures. When a new
1534 string_block is allocated, all the Lisp_Strings it contains are
1535 added to a free-list string_free_list. When a new Lisp_String is
1536 needed, it is taken from that list. During the sweep phase of GC,
1537 string_blocks that are entirely free are freed, except two which
1540 String data is allocated from sblock structures. Strings larger
1541 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1542 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1544 Sblocks consist internally of sdata structures, one for each
1545 Lisp_String. The sdata structure points to the Lisp_String it
1546 belongs to. The Lisp_String points back to the `u.data' member of
1547 its sdata structure.
1549 When a Lisp_String is freed during GC, it is put back on
1550 string_free_list, and its `data' member and its sdata's `string'
1551 pointer is set to null. The size of the string is recorded in the
1552 `u.nbytes' member of the sdata. So, sdata structures that are no
1553 longer used, can be easily recognized, and it's easy to compact the
1554 sblocks of small strings which we do in compact_small_strings. */
1556 /* Size in bytes of an sblock structure used for small strings. This
1557 is 8192 minus malloc overhead. */
1559 #define SBLOCK_SIZE 8188
1561 /* Strings larger than this are considered large strings. String data
1562 for large strings is allocated from individual sblocks. */
1564 #define LARGE_STRING_BYTES 1024
1566 /* Structure describing string memory sub-allocated from an sblock.
1567 This is where the contents of Lisp strings are stored. */
1571 /* Back-pointer to the string this sdata belongs to. If null, this
1572 structure is free, and the NBYTES member of the union below
1573 contains the string's byte size (the same value that STRING_BYTES
1574 would return if STRING were non-null). If non-null, STRING_BYTES
1575 (STRING) is the size of the data, and DATA contains the string's
1577 struct Lisp_String
*string
;
1579 #ifdef GC_CHECK_STRING_BYTES
1582 unsigned char data
[1];
1584 #define SDATA_NBYTES(S) (S)->nbytes
1585 #define SDATA_DATA(S) (S)->data
1587 #else /* not GC_CHECK_STRING_BYTES */
1591 /* When STRING in non-null. */
1592 unsigned char data
[1];
1594 /* When STRING is null. */
1599 #define SDATA_NBYTES(S) (S)->u.nbytes
1600 #define SDATA_DATA(S) (S)->u.data
1602 #endif /* not GC_CHECK_STRING_BYTES */
1606 /* Structure describing a block of memory which is sub-allocated to
1607 obtain string data memory for strings. Blocks for small strings
1608 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1609 as large as needed. */
1614 struct sblock
*next
;
1616 /* Pointer to the next free sdata block. This points past the end
1617 of the sblock if there isn't any space left in this block. */
1618 struct sdata
*next_free
;
1620 /* Start of data. */
1621 struct sdata first_data
;
1624 /* Number of Lisp strings in a string_block structure. The 1020 is
1625 1024 minus malloc overhead. */
1627 #define STRING_BLOCK_SIZE \
1628 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1630 /* Structure describing a block from which Lisp_String structures
1635 /* Place `strings' first, to preserve alignment. */
1636 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1637 struct string_block
*next
;
1640 /* Head and tail of the list of sblock structures holding Lisp string
1641 data. We always allocate from current_sblock. The NEXT pointers
1642 in the sblock structures go from oldest_sblock to current_sblock. */
1644 static struct sblock
*oldest_sblock
, *current_sblock
;
1646 /* List of sblocks for large strings. */
1648 static struct sblock
*large_sblocks
;
1650 /* List of string_block structures, and how many there are. */
1652 static struct string_block
*string_blocks
;
1653 static int n_string_blocks
;
1655 /* Free-list of Lisp_Strings. */
1657 static struct Lisp_String
*string_free_list
;
1659 /* Number of live and free Lisp_Strings. */
1661 static int total_strings
, total_free_strings
;
1663 /* Number of bytes used by live strings. */
1665 static int total_string_size
;
1667 /* Given a pointer to a Lisp_String S which is on the free-list
1668 string_free_list, return a pointer to its successor in the
1671 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1673 /* Return a pointer to the sdata structure belonging to Lisp string S.
1674 S must be live, i.e. S->data must not be null. S->data is actually
1675 a pointer to the `u.data' member of its sdata structure; the
1676 structure starts at a constant offset in front of that. */
1678 #ifdef GC_CHECK_STRING_BYTES
1680 #define SDATA_OF_STRING(S) \
1681 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1682 - sizeof (EMACS_INT)))
1684 #else /* not GC_CHECK_STRING_BYTES */
1686 #define SDATA_OF_STRING(S) \
1687 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1689 #endif /* not GC_CHECK_STRING_BYTES */
1692 #ifdef GC_CHECK_STRING_OVERRUN
1694 /* We check for overrun in string data blocks by appending a small
1695 "cookie" after each allocated string data block, and check for the
1696 presence of this cookie during GC. */
1698 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1699 static char string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1700 { 0xde, 0xad, 0xbe, 0xef };
1703 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1706 /* Value is the size of an sdata structure large enough to hold NBYTES
1707 bytes of string data. The value returned includes a terminating
1708 NUL byte, the size of the sdata structure, and padding. */
1710 #ifdef GC_CHECK_STRING_BYTES
1712 #define SDATA_SIZE(NBYTES) \
1713 ((sizeof (struct Lisp_String *) \
1715 + sizeof (EMACS_INT) \
1716 + sizeof (EMACS_INT) - 1) \
1717 & ~(sizeof (EMACS_INT) - 1))
1719 #else /* not GC_CHECK_STRING_BYTES */
1721 #define SDATA_SIZE(NBYTES) \
1722 ((sizeof (struct Lisp_String *) \
1724 + sizeof (EMACS_INT) - 1) \
1725 & ~(sizeof (EMACS_INT) - 1))
1727 #endif /* not GC_CHECK_STRING_BYTES */
1729 /* Extra bytes to allocate for each string. */
1731 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1733 /* Initialize string allocation. Called from init_alloc_once. */
1738 total_strings
= total_free_strings
= total_string_size
= 0;
1739 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1740 string_blocks
= NULL
;
1741 n_string_blocks
= 0;
1742 string_free_list
= NULL
;
1743 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1744 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1748 #ifdef GC_CHECK_STRING_BYTES
1750 static int check_string_bytes_count
;
1752 static void check_string_bytes (int);
1753 static void check_sblock (struct sblock
*);
1755 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1758 /* Like GC_STRING_BYTES, but with debugging check. */
1762 struct Lisp_String
*s
;
1764 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1765 if (!PURE_POINTER_P (s
)
1767 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1772 /* Check validity of Lisp strings' string_bytes member in B. */
1778 struct sdata
*from
, *end
, *from_end
;
1782 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1784 /* Compute the next FROM here because copying below may
1785 overwrite data we need to compute it. */
1788 /* Check that the string size recorded in the string is the
1789 same as the one recorded in the sdata structure. */
1791 CHECK_STRING_BYTES (from
->string
);
1794 nbytes
= GC_STRING_BYTES (from
->string
);
1796 nbytes
= SDATA_NBYTES (from
);
1798 nbytes
= SDATA_SIZE (nbytes
);
1799 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1804 /* Check validity of Lisp strings' string_bytes member. ALL_P
1805 non-zero means check all strings, otherwise check only most
1806 recently allocated strings. Used for hunting a bug. */
1809 check_string_bytes (all_p
)
1816 for (b
= large_sblocks
; b
; b
= b
->next
)
1818 struct Lisp_String
*s
= b
->first_data
.string
;
1820 CHECK_STRING_BYTES (s
);
1823 for (b
= oldest_sblock
; b
; b
= b
->next
)
1827 check_sblock (current_sblock
);
1830 #endif /* GC_CHECK_STRING_BYTES */
1832 #ifdef GC_CHECK_STRING_FREE_LIST
1834 /* Walk through the string free list looking for bogus next pointers.
1835 This may catch buffer overrun from a previous string. */
1838 check_string_free_list ()
1840 struct Lisp_String
*s
;
1842 /* Pop a Lisp_String off the free-list. */
1843 s
= string_free_list
;
1846 if ((unsigned)s
< 1024)
1848 s
= NEXT_FREE_LISP_STRING (s
);
1852 #define check_string_free_list()
1855 /* Return a new Lisp_String. */
1857 static struct Lisp_String
*
1858 allocate_string (void)
1860 struct Lisp_String
*s
;
1862 /* eassert (!handling_signal); */
1866 /* If the free-list is empty, allocate a new string_block, and
1867 add all the Lisp_Strings in it to the free-list. */
1868 if (string_free_list
== NULL
)
1870 struct string_block
*b
;
1873 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1874 memset (b
, 0, sizeof *b
);
1875 b
->next
= string_blocks
;
1879 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1882 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1883 string_free_list
= s
;
1886 total_free_strings
+= STRING_BLOCK_SIZE
;
1889 check_string_free_list ();
1891 /* Pop a Lisp_String off the free-list. */
1892 s
= string_free_list
;
1893 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1895 MALLOC_UNBLOCK_INPUT
;
1897 /* Probably not strictly necessary, but play it safe. */
1898 memset (s
, 0, sizeof *s
);
1900 --total_free_strings
;
1903 consing_since_gc
+= sizeof *s
;
1905 #ifdef GC_CHECK_STRING_BYTES
1906 if (!noninteractive
)
1908 if (++check_string_bytes_count
== 200)
1910 check_string_bytes_count
= 0;
1911 check_string_bytes (1);
1914 check_string_bytes (0);
1916 #endif /* GC_CHECK_STRING_BYTES */
1922 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1923 plus a NUL byte at the end. Allocate an sdata structure for S, and
1924 set S->data to its `u.data' member. Store a NUL byte at the end of
1925 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1926 S->data if it was initially non-null. */
1929 allocate_string_data (struct Lisp_String
*s
, int nchars
, int nbytes
)
1931 struct sdata
*data
, *old_data
;
1933 int needed
, old_nbytes
;
1935 /* Determine the number of bytes needed to store NBYTES bytes
1937 needed
= SDATA_SIZE (nbytes
);
1938 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1939 old_nbytes
= GC_STRING_BYTES (s
);
1943 if (nbytes
> LARGE_STRING_BYTES
)
1945 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1947 #ifdef DOUG_LEA_MALLOC
1948 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1949 because mapped region contents are not preserved in
1952 In case you think of allowing it in a dumped Emacs at the
1953 cost of not being able to re-dump, there's another reason:
1954 mmap'ed data typically have an address towards the top of the
1955 address space, which won't fit into an EMACS_INT (at least on
1956 32-bit systems with the current tagging scheme). --fx */
1957 mallopt (M_MMAP_MAX
, 0);
1960 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1962 #ifdef DOUG_LEA_MALLOC
1963 /* Back to a reasonable maximum of mmap'ed areas. */
1964 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1967 b
->next_free
= &b
->first_data
;
1968 b
->first_data
.string
= NULL
;
1969 b
->next
= large_sblocks
;
1972 else if (current_sblock
== NULL
1973 || (((char *) current_sblock
+ SBLOCK_SIZE
1974 - (char *) current_sblock
->next_free
)
1975 < (needed
+ GC_STRING_EXTRA
)))
1977 /* Not enough room in the current sblock. */
1978 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1979 b
->next_free
= &b
->first_data
;
1980 b
->first_data
.string
= NULL
;
1984 current_sblock
->next
= b
;
1992 data
= b
->next_free
;
1993 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
1995 MALLOC_UNBLOCK_INPUT
;
1998 s
->data
= SDATA_DATA (data
);
1999 #ifdef GC_CHECK_STRING_BYTES
2000 SDATA_NBYTES (data
) = nbytes
;
2003 s
->size_byte
= nbytes
;
2004 s
->data
[nbytes
] = '\0';
2005 #ifdef GC_CHECK_STRING_OVERRUN
2006 memcpy (data
+ needed
, string_overrun_cookie
, GC_STRING_OVERRUN_COOKIE_SIZE
);
2009 /* If S had already data assigned, mark that as free by setting its
2010 string back-pointer to null, and recording the size of the data
2014 SDATA_NBYTES (old_data
) = old_nbytes
;
2015 old_data
->string
= NULL
;
2018 consing_since_gc
+= needed
;
2022 /* Sweep and compact strings. */
2025 sweep_strings (void)
2027 struct string_block
*b
, *next
;
2028 struct string_block
*live_blocks
= NULL
;
2030 string_free_list
= NULL
;
2031 total_strings
= total_free_strings
= 0;
2032 total_string_size
= 0;
2034 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2035 for (b
= string_blocks
; b
; b
= next
)
2038 struct Lisp_String
*free_list_before
= string_free_list
;
2042 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2044 struct Lisp_String
*s
= b
->strings
+ i
;
2048 /* String was not on free-list before. */
2049 if (STRING_MARKED_P (s
))
2051 /* String is live; unmark it and its intervals. */
2054 if (!NULL_INTERVAL_P (s
->intervals
))
2055 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2058 total_string_size
+= STRING_BYTES (s
);
2062 /* String is dead. Put it on the free-list. */
2063 struct sdata
*data
= SDATA_OF_STRING (s
);
2065 /* Save the size of S in its sdata so that we know
2066 how large that is. Reset the sdata's string
2067 back-pointer so that we know it's free. */
2068 #ifdef GC_CHECK_STRING_BYTES
2069 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2072 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2074 data
->string
= NULL
;
2076 /* Reset the strings's `data' member so that we
2080 /* Put the string on the free-list. */
2081 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2082 string_free_list
= s
;
2088 /* S was on the free-list before. Put it there again. */
2089 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2090 string_free_list
= s
;
2095 /* Free blocks that contain free Lisp_Strings only, except
2096 the first two of them. */
2097 if (nfree
== STRING_BLOCK_SIZE
2098 && total_free_strings
> STRING_BLOCK_SIZE
)
2102 string_free_list
= free_list_before
;
2106 total_free_strings
+= nfree
;
2107 b
->next
= live_blocks
;
2112 check_string_free_list ();
2114 string_blocks
= live_blocks
;
2115 free_large_strings ();
2116 compact_small_strings ();
2118 check_string_free_list ();
2122 /* Free dead large strings. */
2125 free_large_strings (void)
2127 struct sblock
*b
, *next
;
2128 struct sblock
*live_blocks
= NULL
;
2130 for (b
= large_sblocks
; b
; b
= next
)
2134 if (b
->first_data
.string
== NULL
)
2138 b
->next
= live_blocks
;
2143 large_sblocks
= live_blocks
;
2147 /* Compact data of small strings. Free sblocks that don't contain
2148 data of live strings after compaction. */
2151 compact_small_strings (void)
2153 struct sblock
*b
, *tb
, *next
;
2154 struct sdata
*from
, *to
, *end
, *tb_end
;
2155 struct sdata
*to_end
, *from_end
;
2157 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2158 to, and TB_END is the end of TB. */
2160 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2161 to
= &tb
->first_data
;
2163 /* Step through the blocks from the oldest to the youngest. We
2164 expect that old blocks will stabilize over time, so that less
2165 copying will happen this way. */
2166 for (b
= oldest_sblock
; b
; b
= b
->next
)
2169 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2171 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2173 /* Compute the next FROM here because copying below may
2174 overwrite data we need to compute it. */
2177 #ifdef GC_CHECK_STRING_BYTES
2178 /* Check that the string size recorded in the string is the
2179 same as the one recorded in the sdata structure. */
2181 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2183 #endif /* GC_CHECK_STRING_BYTES */
2186 nbytes
= GC_STRING_BYTES (from
->string
);
2188 nbytes
= SDATA_NBYTES (from
);
2190 if (nbytes
> LARGE_STRING_BYTES
)
2193 nbytes
= SDATA_SIZE (nbytes
);
2194 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2196 #ifdef GC_CHECK_STRING_OVERRUN
2197 if (memcmp (string_overrun_cookie
,
2198 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
2199 GC_STRING_OVERRUN_COOKIE_SIZE
))
2203 /* FROM->string non-null means it's alive. Copy its data. */
2206 /* If TB is full, proceed with the next sblock. */
2207 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2208 if (to_end
> tb_end
)
2212 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2213 to
= &tb
->first_data
;
2214 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2217 /* Copy, and update the string's `data' pointer. */
2220 xassert (tb
!= b
|| to
<= from
);
2221 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
2222 to
->string
->data
= SDATA_DATA (to
);
2225 /* Advance past the sdata we copied to. */
2231 /* The rest of the sblocks following TB don't contain live data, so
2232 we can free them. */
2233 for (b
= tb
->next
; b
; b
= next
)
2241 current_sblock
= tb
;
2245 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2246 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2247 LENGTH must be an integer.
2248 INIT must be an integer that represents a character. */)
2249 (Lisp_Object length
, Lisp_Object init
)
2251 register Lisp_Object val
;
2252 register unsigned char *p
, *end
;
2255 CHECK_NATNUM (length
);
2256 CHECK_NUMBER (init
);
2259 if (ASCII_CHAR_P (c
))
2261 nbytes
= XINT (length
);
2262 val
= make_uninit_string (nbytes
);
2264 end
= p
+ SCHARS (val
);
2270 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2271 int len
= CHAR_STRING (c
, str
);
2273 nbytes
= len
* XINT (length
);
2274 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
2279 memcpy (p
, str
, len
);
2289 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2290 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2291 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2292 (Lisp_Object length
, Lisp_Object init
)
2294 register Lisp_Object val
;
2295 struct Lisp_Bool_Vector
*p
;
2297 int length_in_chars
, length_in_elts
, bits_per_value
;
2299 CHECK_NATNUM (length
);
2301 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2303 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2304 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2305 / BOOL_VECTOR_BITS_PER_CHAR
);
2307 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2308 slot `size' of the struct Lisp_Bool_Vector. */
2309 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2311 /* Get rid of any bits that would cause confusion. */
2312 XVECTOR (val
)->size
= 0; /* No Lisp_Object to trace in there. */
2313 /* Use XVECTOR (val) rather than `p' because p->size is not TRT. */
2314 XSETPVECTYPE (XVECTOR (val
), PVEC_BOOL_VECTOR
);
2316 p
= XBOOL_VECTOR (val
);
2317 p
->size
= XFASTINT (length
);
2319 real_init
= (NILP (init
) ? 0 : -1);
2320 for (i
= 0; i
< length_in_chars
; i
++)
2321 p
->data
[i
] = real_init
;
2323 /* Clear the extraneous bits in the last byte. */
2324 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2325 p
->data
[length_in_chars
- 1]
2326 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2332 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2333 of characters from the contents. This string may be unibyte or
2334 multibyte, depending on the contents. */
2337 make_string (const char *contents
, int nbytes
)
2339 register Lisp_Object val
;
2340 int nchars
, multibyte_nbytes
;
2342 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
2343 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2344 /* CONTENTS contains no multibyte sequences or contains an invalid
2345 multibyte sequence. We must make unibyte string. */
2346 val
= make_unibyte_string (contents
, nbytes
);
2348 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2353 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2356 make_unibyte_string (const char *contents
, int length
)
2358 register Lisp_Object val
;
2359 val
= make_uninit_string (length
);
2360 memcpy (SDATA (val
), contents
, length
);
2361 STRING_SET_UNIBYTE (val
);
2366 /* Make a multibyte string from NCHARS characters occupying NBYTES
2367 bytes at CONTENTS. */
2370 make_multibyte_string (const char *contents
, int nchars
, int nbytes
)
2372 register Lisp_Object val
;
2373 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2374 memcpy (SDATA (val
), contents
, nbytes
);
2379 /* Make a string from NCHARS characters occupying NBYTES bytes at
2380 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2383 make_string_from_bytes (const char *contents
, int nchars
, int nbytes
)
2385 register Lisp_Object val
;
2386 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2387 memcpy (SDATA (val
), contents
, nbytes
);
2388 if (SBYTES (val
) == SCHARS (val
))
2389 STRING_SET_UNIBYTE (val
);
2394 /* Make a string from NCHARS characters occupying NBYTES bytes at
2395 CONTENTS. The argument MULTIBYTE controls whether to label the
2396 string as multibyte. If NCHARS is negative, it counts the number of
2397 characters by itself. */
2400 make_specified_string (const char *contents
, int nchars
, int nbytes
, int multibyte
)
2402 register Lisp_Object val
;
2407 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2411 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2412 memcpy (SDATA (val
), contents
, nbytes
);
2414 STRING_SET_UNIBYTE (val
);
2419 /* Make a string from the data at STR, treating it as multibyte if the
2423 build_string (const char *str
)
2425 return make_string (str
, strlen (str
));
2429 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2430 occupying LENGTH bytes. */
2433 make_uninit_string (int length
)
2438 return empty_unibyte_string
;
2439 val
= make_uninit_multibyte_string (length
, length
);
2440 STRING_SET_UNIBYTE (val
);
2445 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2446 which occupy NBYTES bytes. */
2449 make_uninit_multibyte_string (int nchars
, int nbytes
)
2452 struct Lisp_String
*s
;
2457 return empty_multibyte_string
;
2459 s
= allocate_string ();
2460 allocate_string_data (s
, nchars
, nbytes
);
2461 XSETSTRING (string
, s
);
2462 string_chars_consed
+= nbytes
;
2468 /***********************************************************************
2470 ***********************************************************************/
2472 /* We store float cells inside of float_blocks, allocating a new
2473 float_block with malloc whenever necessary. Float cells reclaimed
2474 by GC are put on a free list to be reallocated before allocating
2475 any new float cells from the latest float_block. */
2477 #define FLOAT_BLOCK_SIZE \
2478 (((BLOCK_BYTES - sizeof (struct float_block *) \
2479 /* The compiler might add padding at the end. */ \
2480 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2481 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2483 #define GETMARKBIT(block,n) \
2484 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2485 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2488 #define SETMARKBIT(block,n) \
2489 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2490 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2492 #define UNSETMARKBIT(block,n) \
2493 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2494 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2496 #define FLOAT_BLOCK(fptr) \
2497 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2499 #define FLOAT_INDEX(fptr) \
2500 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2504 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2505 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2506 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2507 struct float_block
*next
;
2510 #define FLOAT_MARKED_P(fptr) \
2511 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2513 #define FLOAT_MARK(fptr) \
2514 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2516 #define FLOAT_UNMARK(fptr) \
2517 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2519 /* Current float_block. */
2521 struct float_block
*float_block
;
2523 /* Index of first unused Lisp_Float in the current float_block. */
2525 int float_block_index
;
2527 /* Total number of float blocks now in use. */
2531 /* Free-list of Lisp_Floats. */
2533 struct Lisp_Float
*float_free_list
;
2536 /* Initialize float allocation. */
2542 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2543 float_free_list
= 0;
2548 /* Explicitly free a float cell by putting it on the free-list. */
2551 free_float (struct Lisp_Float
*ptr
)
2553 ptr
->u
.chain
= float_free_list
;
2554 float_free_list
= ptr
;
2558 /* Return a new float object with value FLOAT_VALUE. */
2561 make_float (double float_value
)
2563 register Lisp_Object val
;
2565 /* eassert (!handling_signal); */
2569 if (float_free_list
)
2571 /* We use the data field for chaining the free list
2572 so that we won't use the same field that has the mark bit. */
2573 XSETFLOAT (val
, float_free_list
);
2574 float_free_list
= float_free_list
->u
.chain
;
2578 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2580 register struct float_block
*new;
2582 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2584 new->next
= float_block
;
2585 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2587 float_block_index
= 0;
2590 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2591 float_block_index
++;
2594 MALLOC_UNBLOCK_INPUT
;
2596 XFLOAT_INIT (val
, float_value
);
2597 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2598 consing_since_gc
+= sizeof (struct Lisp_Float
);
2605 /***********************************************************************
2607 ***********************************************************************/
2609 /* We store cons cells inside of cons_blocks, allocating a new
2610 cons_block with malloc whenever necessary. Cons cells reclaimed by
2611 GC are put on a free list to be reallocated before allocating
2612 any new cons cells from the latest cons_block. */
2614 #define CONS_BLOCK_SIZE \
2615 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2616 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2618 #define CONS_BLOCK(fptr) \
2619 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2621 #define CONS_INDEX(fptr) \
2622 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2626 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2627 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2628 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2629 struct cons_block
*next
;
2632 #define CONS_MARKED_P(fptr) \
2633 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2635 #define CONS_MARK(fptr) \
2636 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2638 #define CONS_UNMARK(fptr) \
2639 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2641 /* Current cons_block. */
2643 struct cons_block
*cons_block
;
2645 /* Index of first unused Lisp_Cons in the current block. */
2647 int cons_block_index
;
2649 /* Free-list of Lisp_Cons structures. */
2651 struct Lisp_Cons
*cons_free_list
;
2653 /* Total number of cons blocks now in use. */
2655 static int n_cons_blocks
;
2658 /* Initialize cons allocation. */
2664 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2670 /* Explicitly free a cons cell by putting it on the free-list. */
2673 free_cons (struct Lisp_Cons
*ptr
)
2675 ptr
->u
.chain
= cons_free_list
;
2679 cons_free_list
= ptr
;
2682 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2683 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2684 (Lisp_Object car
, Lisp_Object cdr
)
2686 register Lisp_Object val
;
2688 /* eassert (!handling_signal); */
2694 /* We use the cdr for chaining the free list
2695 so that we won't use the same field that has the mark bit. */
2696 XSETCONS (val
, cons_free_list
);
2697 cons_free_list
= cons_free_list
->u
.chain
;
2701 if (cons_block_index
== CONS_BLOCK_SIZE
)
2703 register struct cons_block
*new;
2704 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2706 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2707 new->next
= cons_block
;
2709 cons_block_index
= 0;
2712 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2716 MALLOC_UNBLOCK_INPUT
;
2720 eassert (!CONS_MARKED_P (XCONS (val
)));
2721 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2722 cons_cells_consed
++;
2726 /* Get an error now if there's any junk in the cons free list. */
2728 check_cons_list (void)
2730 #ifdef GC_CHECK_CONS_LIST
2731 struct Lisp_Cons
*tail
= cons_free_list
;
2734 tail
= tail
->u
.chain
;
2738 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2741 list1 (Lisp_Object arg1
)
2743 return Fcons (arg1
, Qnil
);
2747 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2749 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2754 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2756 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2761 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2763 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2768 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2770 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2771 Fcons (arg5
, Qnil
)))));
2775 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2776 doc
: /* Return a newly created list with specified arguments as elements.
2777 Any number of arguments, even zero arguments, are allowed.
2778 usage: (list &rest OBJECTS) */)
2779 (int nargs
, register Lisp_Object
*args
)
2781 register Lisp_Object val
;
2787 val
= Fcons (args
[nargs
], val
);
2793 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2794 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2795 (register Lisp_Object length
, Lisp_Object init
)
2797 register Lisp_Object val
;
2800 CHECK_NATNUM (length
);
2801 size
= XFASTINT (length
);
2806 val
= Fcons (init
, val
);
2811 val
= Fcons (init
, val
);
2816 val
= Fcons (init
, val
);
2821 val
= Fcons (init
, val
);
2826 val
= Fcons (init
, val
);
2841 /***********************************************************************
2843 ***********************************************************************/
2845 /* Singly-linked list of all vectors. */
2847 static struct Lisp_Vector
*all_vectors
;
2849 /* Total number of vector-like objects now in use. */
2851 static int n_vectors
;
2854 /* Value is a pointer to a newly allocated Lisp_Vector structure
2855 with room for LEN Lisp_Objects. */
2857 static struct Lisp_Vector
*
2858 allocate_vectorlike (EMACS_INT len
)
2860 struct Lisp_Vector
*p
;
2865 #ifdef DOUG_LEA_MALLOC
2866 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2867 because mapped region contents are not preserved in
2869 mallopt (M_MMAP_MAX
, 0);
2872 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2873 /* eassert (!handling_signal); */
2875 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2876 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
2878 #ifdef DOUG_LEA_MALLOC
2879 /* Back to a reasonable maximum of mmap'ed areas. */
2880 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2883 consing_since_gc
+= nbytes
;
2884 vector_cells_consed
+= len
;
2886 p
->next
= all_vectors
;
2889 MALLOC_UNBLOCK_INPUT
;
2896 /* Allocate a vector with NSLOTS slots. */
2898 struct Lisp_Vector
*
2899 allocate_vector (EMACS_INT nslots
)
2901 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
);
2907 /* Allocate other vector-like structures. */
2909 struct Lisp_Vector
*
2910 allocate_pseudovector (int memlen
, int lisplen
, EMACS_INT tag
)
2912 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2915 /* Only the first lisplen slots will be traced normally by the GC. */
2917 for (i
= 0; i
< lisplen
; ++i
)
2918 v
->contents
[i
] = Qnil
;
2920 XSETPVECTYPE (v
, tag
); /* Add the appropriate tag. */
2924 struct Lisp_Hash_Table
*
2925 allocate_hash_table (void)
2927 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
2932 allocate_window (void)
2934 return ALLOCATE_PSEUDOVECTOR(struct window
, current_matrix
, PVEC_WINDOW
);
2939 allocate_terminal (void)
2941 struct terminal
*t
= ALLOCATE_PSEUDOVECTOR (struct terminal
,
2942 next_terminal
, PVEC_TERMINAL
);
2943 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2944 memset (&t
->next_terminal
, 0,
2945 (char*) (t
+ 1) - (char*) &t
->next_terminal
);
2951 allocate_frame (void)
2953 struct frame
*f
= ALLOCATE_PSEUDOVECTOR (struct frame
,
2954 face_cache
, PVEC_FRAME
);
2955 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2956 memset (&f
->face_cache
, 0,
2957 (char *) (f
+ 1) - (char *) &f
->face_cache
);
2962 struct Lisp_Process
*
2963 allocate_process (void)
2965 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
2969 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2970 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2971 See also the function `vector'. */)
2972 (register Lisp_Object length
, Lisp_Object init
)
2975 register EMACS_INT sizei
;
2977 register struct Lisp_Vector
*p
;
2979 CHECK_NATNUM (length
);
2980 sizei
= XFASTINT (length
);
2982 p
= allocate_vector (sizei
);
2983 for (index
= 0; index
< sizei
; index
++)
2984 p
->contents
[index
] = init
;
2986 XSETVECTOR (vector
, p
);
2991 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
2992 doc
: /* Return a newly created vector with specified arguments as elements.
2993 Any number of arguments, even zero arguments, are allowed.
2994 usage: (vector &rest OBJECTS) */)
2995 (register int nargs
, Lisp_Object
*args
)
2997 register Lisp_Object len
, val
;
2999 register struct Lisp_Vector
*p
;
3001 XSETFASTINT (len
, nargs
);
3002 val
= Fmake_vector (len
, Qnil
);
3004 for (index
= 0; index
< nargs
; index
++)
3005 p
->contents
[index
] = args
[index
];
3010 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3011 doc
: /* Create a byte-code object with specified arguments as elements.
3012 The arguments should be the arglist, bytecode-string, constant vector,
3013 stack size, (optional) doc string, and (optional) interactive spec.
3014 The first four arguments are required; at most six have any
3016 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3017 (register int nargs
, Lisp_Object
*args
)
3019 register Lisp_Object len
, val
;
3021 register struct Lisp_Vector
*p
;
3023 XSETFASTINT (len
, nargs
);
3024 if (!NILP (Vpurify_flag
))
3025 val
= make_pure_vector ((EMACS_INT
) nargs
);
3027 val
= Fmake_vector (len
, Qnil
);
3029 if (nargs
> 1 && STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
3030 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3031 earlier because they produced a raw 8-bit string for byte-code
3032 and now such a byte-code string is loaded as multibyte while
3033 raw 8-bit characters converted to multibyte form. Thus, now we
3034 must convert them back to the original unibyte form. */
3035 args
[1] = Fstring_as_unibyte (args
[1]);
3038 for (index
= 0; index
< nargs
; index
++)
3040 if (!NILP (Vpurify_flag
))
3041 args
[index
] = Fpurecopy (args
[index
]);
3042 p
->contents
[index
] = args
[index
];
3044 XSETPVECTYPE (p
, PVEC_COMPILED
);
3045 XSETCOMPILED (val
, p
);
3051 /***********************************************************************
3053 ***********************************************************************/
3055 /* Each symbol_block is just under 1020 bytes long, since malloc
3056 really allocates in units of powers of two and uses 4 bytes for its
3059 #define SYMBOL_BLOCK_SIZE \
3060 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3064 /* Place `symbols' first, to preserve alignment. */
3065 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3066 struct symbol_block
*next
;
3069 /* Current symbol block and index of first unused Lisp_Symbol
3072 static struct symbol_block
*symbol_block
;
3073 static int symbol_block_index
;
3075 /* List of free symbols. */
3077 static struct Lisp_Symbol
*symbol_free_list
;
3079 /* Total number of symbol blocks now in use. */
3081 static int n_symbol_blocks
;
3084 /* Initialize symbol allocation. */
3089 symbol_block
= NULL
;
3090 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3091 symbol_free_list
= 0;
3092 n_symbol_blocks
= 0;
3096 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3097 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3098 Its value and function definition are void, and its property list is nil. */)
3101 register Lisp_Object val
;
3102 register struct Lisp_Symbol
*p
;
3104 CHECK_STRING (name
);
3106 /* eassert (!handling_signal); */
3110 if (symbol_free_list
)
3112 XSETSYMBOL (val
, symbol_free_list
);
3113 symbol_free_list
= symbol_free_list
->next
;
3117 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3119 struct symbol_block
*new;
3120 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3122 new->next
= symbol_block
;
3124 symbol_block_index
= 0;
3127 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3128 symbol_block_index
++;
3131 MALLOC_UNBLOCK_INPUT
;
3136 p
->redirect
= SYMBOL_PLAINVAL
;
3137 SET_SYMBOL_VAL (p
, Qunbound
);
3138 p
->function
= Qunbound
;
3141 p
->interned
= SYMBOL_UNINTERNED
;
3143 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3150 /***********************************************************************
3151 Marker (Misc) Allocation
3152 ***********************************************************************/
3154 /* Allocation of markers and other objects that share that structure.
3155 Works like allocation of conses. */
3157 #define MARKER_BLOCK_SIZE \
3158 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3162 /* Place `markers' first, to preserve alignment. */
3163 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3164 struct marker_block
*next
;
3167 static struct marker_block
*marker_block
;
3168 static int marker_block_index
;
3170 static union Lisp_Misc
*marker_free_list
;
3172 /* Total number of marker blocks now in use. */
3174 static int n_marker_blocks
;
3179 marker_block
= NULL
;
3180 marker_block_index
= MARKER_BLOCK_SIZE
;
3181 marker_free_list
= 0;
3182 n_marker_blocks
= 0;
3185 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3188 allocate_misc (void)
3192 /* eassert (!handling_signal); */
3196 if (marker_free_list
)
3198 XSETMISC (val
, marker_free_list
);
3199 marker_free_list
= marker_free_list
->u_free
.chain
;
3203 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3205 struct marker_block
*new;
3206 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3208 new->next
= marker_block
;
3210 marker_block_index
= 0;
3212 total_free_markers
+= MARKER_BLOCK_SIZE
;
3214 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3215 marker_block_index
++;
3218 MALLOC_UNBLOCK_INPUT
;
3220 --total_free_markers
;
3221 consing_since_gc
+= sizeof (union Lisp_Misc
);
3222 misc_objects_consed
++;
3223 XMISCANY (val
)->gcmarkbit
= 0;
3227 /* Free a Lisp_Misc object */
3230 free_misc (Lisp_Object misc
)
3232 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3233 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3234 marker_free_list
= XMISC (misc
);
3236 total_free_markers
++;
3239 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3240 INTEGER. This is used to package C values to call record_unwind_protect.
3241 The unwind function can get the C values back using XSAVE_VALUE. */
3244 make_save_value (void *pointer
, int integer
)
3246 register Lisp_Object val
;
3247 register struct Lisp_Save_Value
*p
;
3249 val
= allocate_misc ();
3250 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3251 p
= XSAVE_VALUE (val
);
3252 p
->pointer
= pointer
;
3253 p
->integer
= integer
;
3258 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3259 doc
: /* Return a newly allocated marker which does not point at any place. */)
3262 register Lisp_Object val
;
3263 register struct Lisp_Marker
*p
;
3265 val
= allocate_misc ();
3266 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3272 p
->insertion_type
= 0;
3276 /* Put MARKER back on the free list after using it temporarily. */
3279 free_marker (Lisp_Object marker
)
3281 unchain_marker (XMARKER (marker
));
3286 /* Return a newly created vector or string with specified arguments as
3287 elements. If all the arguments are characters that can fit
3288 in a string of events, make a string; otherwise, make a vector.
3290 Any number of arguments, even zero arguments, are allowed. */
3293 make_event_array (register int nargs
, Lisp_Object
*args
)
3297 for (i
= 0; i
< nargs
; i
++)
3298 /* The things that fit in a string
3299 are characters that are in 0...127,
3300 after discarding the meta bit and all the bits above it. */
3301 if (!INTEGERP (args
[i
])
3302 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3303 return Fvector (nargs
, args
);
3305 /* Since the loop exited, we know that all the things in it are
3306 characters, so we can make a string. */
3310 result
= Fmake_string (make_number (nargs
), make_number (0));
3311 for (i
= 0; i
< nargs
; i
++)
3313 SSET (result
, i
, XINT (args
[i
]));
3314 /* Move the meta bit to the right place for a string char. */
3315 if (XINT (args
[i
]) & CHAR_META
)
3316 SSET (result
, i
, SREF (result
, i
) | 0x80);
3325 /************************************************************************
3326 Memory Full Handling
3327 ************************************************************************/
3330 /* Called if malloc returns zero. */
3339 memory_full_cons_threshold
= sizeof (struct cons_block
);
3341 /* The first time we get here, free the spare memory. */
3342 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3343 if (spare_memory
[i
])
3346 free (spare_memory
[i
]);
3347 else if (i
>= 1 && i
<= 4)
3348 lisp_align_free (spare_memory
[i
]);
3350 lisp_free (spare_memory
[i
]);
3351 spare_memory
[i
] = 0;
3354 /* Record the space now used. When it decreases substantially,
3355 we can refill the memory reserve. */
3356 #ifndef SYSTEM_MALLOC
3357 bytes_used_when_full
= BYTES_USED
;
3360 /* This used to call error, but if we've run out of memory, we could
3361 get infinite recursion trying to build the string. */
3362 xsignal (Qnil
, Vmemory_signal_data
);
3365 /* If we released our reserve (due to running out of memory),
3366 and we have a fair amount free once again,
3367 try to set aside another reserve in case we run out once more.
3369 This is called when a relocatable block is freed in ralloc.c,
3370 and also directly from this file, in case we're not using ralloc.c. */
3373 refill_memory_reserve (void)
3375 #ifndef SYSTEM_MALLOC
3376 if (spare_memory
[0] == 0)
3377 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3378 if (spare_memory
[1] == 0)
3379 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3381 if (spare_memory
[2] == 0)
3382 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3384 if (spare_memory
[3] == 0)
3385 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3387 if (spare_memory
[4] == 0)
3388 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3390 if (spare_memory
[5] == 0)
3391 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3393 if (spare_memory
[6] == 0)
3394 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3396 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3397 Vmemory_full
= Qnil
;
3401 /************************************************************************
3403 ************************************************************************/
3405 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3407 /* Conservative C stack marking requires a method to identify possibly
3408 live Lisp objects given a pointer value. We do this by keeping
3409 track of blocks of Lisp data that are allocated in a red-black tree
3410 (see also the comment of mem_node which is the type of nodes in
3411 that tree). Function lisp_malloc adds information for an allocated
3412 block to the red-black tree with calls to mem_insert, and function
3413 lisp_free removes it with mem_delete. Functions live_string_p etc
3414 call mem_find to lookup information about a given pointer in the
3415 tree, and use that to determine if the pointer points to a Lisp
3418 /* Initialize this part of alloc.c. */
3423 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3424 mem_z
.parent
= NULL
;
3425 mem_z
.color
= MEM_BLACK
;
3426 mem_z
.start
= mem_z
.end
= NULL
;
3431 /* Value is a pointer to the mem_node containing START. Value is
3432 MEM_NIL if there is no node in the tree containing START. */
3434 static INLINE
struct mem_node
*
3435 mem_find (void *start
)
3439 if (start
< min_heap_address
|| start
> max_heap_address
)
3442 /* Make the search always successful to speed up the loop below. */
3443 mem_z
.start
= start
;
3444 mem_z
.end
= (char *) start
+ 1;
3447 while (start
< p
->start
|| start
>= p
->end
)
3448 p
= start
< p
->start
? p
->left
: p
->right
;
3453 /* Insert a new node into the tree for a block of memory with start
3454 address START, end address END, and type TYPE. Value is a
3455 pointer to the node that was inserted. */
3457 static struct mem_node
*
3458 mem_insert (void *start
, void *end
, enum mem_type type
)
3460 struct mem_node
*c
, *parent
, *x
;
3462 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3463 min_heap_address
= start
;
3464 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3465 max_heap_address
= end
;
3467 /* See where in the tree a node for START belongs. In this
3468 particular application, it shouldn't happen that a node is already
3469 present. For debugging purposes, let's check that. */
3473 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3475 while (c
!= MEM_NIL
)
3477 if (start
>= c
->start
&& start
< c
->end
)
3480 c
= start
< c
->start
? c
->left
: c
->right
;
3483 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3485 while (c
!= MEM_NIL
)
3488 c
= start
< c
->start
? c
->left
: c
->right
;
3491 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3493 /* Create a new node. */
3494 #ifdef GC_MALLOC_CHECK
3495 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3499 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3505 x
->left
= x
->right
= MEM_NIL
;
3508 /* Insert it as child of PARENT or install it as root. */
3511 if (start
< parent
->start
)
3519 /* Re-establish red-black tree properties. */
3520 mem_insert_fixup (x
);
3526 /* Re-establish the red-black properties of the tree, and thereby
3527 balance the tree, after node X has been inserted; X is always red. */
3530 mem_insert_fixup (struct mem_node
*x
)
3532 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3534 /* X is red and its parent is red. This is a violation of
3535 red-black tree property #3. */
3537 if (x
->parent
== x
->parent
->parent
->left
)
3539 /* We're on the left side of our grandparent, and Y is our
3541 struct mem_node
*y
= x
->parent
->parent
->right
;
3543 if (y
->color
== MEM_RED
)
3545 /* Uncle and parent are red but should be black because
3546 X is red. Change the colors accordingly and proceed
3547 with the grandparent. */
3548 x
->parent
->color
= MEM_BLACK
;
3549 y
->color
= MEM_BLACK
;
3550 x
->parent
->parent
->color
= MEM_RED
;
3551 x
= x
->parent
->parent
;
3555 /* Parent and uncle have different colors; parent is
3556 red, uncle is black. */
3557 if (x
== x
->parent
->right
)
3560 mem_rotate_left (x
);
3563 x
->parent
->color
= MEM_BLACK
;
3564 x
->parent
->parent
->color
= MEM_RED
;
3565 mem_rotate_right (x
->parent
->parent
);
3570 /* This is the symmetrical case of above. */
3571 struct mem_node
*y
= x
->parent
->parent
->left
;
3573 if (y
->color
== MEM_RED
)
3575 x
->parent
->color
= MEM_BLACK
;
3576 y
->color
= MEM_BLACK
;
3577 x
->parent
->parent
->color
= MEM_RED
;
3578 x
= x
->parent
->parent
;
3582 if (x
== x
->parent
->left
)
3585 mem_rotate_right (x
);
3588 x
->parent
->color
= MEM_BLACK
;
3589 x
->parent
->parent
->color
= MEM_RED
;
3590 mem_rotate_left (x
->parent
->parent
);
3595 /* The root may have been changed to red due to the algorithm. Set
3596 it to black so that property #5 is satisfied. */
3597 mem_root
->color
= MEM_BLACK
;
3608 mem_rotate_left (struct mem_node
*x
)
3612 /* Turn y's left sub-tree into x's right sub-tree. */
3615 if (y
->left
!= MEM_NIL
)
3616 y
->left
->parent
= x
;
3618 /* Y's parent was x's parent. */
3620 y
->parent
= x
->parent
;
3622 /* Get the parent to point to y instead of x. */
3625 if (x
== x
->parent
->left
)
3626 x
->parent
->left
= y
;
3628 x
->parent
->right
= y
;
3633 /* Put x on y's left. */
3647 mem_rotate_right (struct mem_node
*x
)
3649 struct mem_node
*y
= x
->left
;
3652 if (y
->right
!= MEM_NIL
)
3653 y
->right
->parent
= x
;
3656 y
->parent
= x
->parent
;
3659 if (x
== x
->parent
->right
)
3660 x
->parent
->right
= y
;
3662 x
->parent
->left
= y
;
3673 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3676 mem_delete (struct mem_node
*z
)
3678 struct mem_node
*x
, *y
;
3680 if (!z
|| z
== MEM_NIL
)
3683 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3688 while (y
->left
!= MEM_NIL
)
3692 if (y
->left
!= MEM_NIL
)
3697 x
->parent
= y
->parent
;
3700 if (y
== y
->parent
->left
)
3701 y
->parent
->left
= x
;
3703 y
->parent
->right
= x
;
3710 z
->start
= y
->start
;
3715 if (y
->color
== MEM_BLACK
)
3716 mem_delete_fixup (x
);
3718 #ifdef GC_MALLOC_CHECK
3726 /* Re-establish the red-black properties of the tree, after a
3730 mem_delete_fixup (struct mem_node
*x
)
3732 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3734 if (x
== x
->parent
->left
)
3736 struct mem_node
*w
= x
->parent
->right
;
3738 if (w
->color
== MEM_RED
)
3740 w
->color
= MEM_BLACK
;
3741 x
->parent
->color
= MEM_RED
;
3742 mem_rotate_left (x
->parent
);
3743 w
= x
->parent
->right
;
3746 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3753 if (w
->right
->color
== MEM_BLACK
)
3755 w
->left
->color
= MEM_BLACK
;
3757 mem_rotate_right (w
);
3758 w
= x
->parent
->right
;
3760 w
->color
= x
->parent
->color
;
3761 x
->parent
->color
= MEM_BLACK
;
3762 w
->right
->color
= MEM_BLACK
;
3763 mem_rotate_left (x
->parent
);
3769 struct mem_node
*w
= x
->parent
->left
;
3771 if (w
->color
== MEM_RED
)
3773 w
->color
= MEM_BLACK
;
3774 x
->parent
->color
= MEM_RED
;
3775 mem_rotate_right (x
->parent
);
3776 w
= x
->parent
->left
;
3779 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3786 if (w
->left
->color
== MEM_BLACK
)
3788 w
->right
->color
= MEM_BLACK
;
3790 mem_rotate_left (w
);
3791 w
= x
->parent
->left
;
3794 w
->color
= x
->parent
->color
;
3795 x
->parent
->color
= MEM_BLACK
;
3796 w
->left
->color
= MEM_BLACK
;
3797 mem_rotate_right (x
->parent
);
3803 x
->color
= MEM_BLACK
;
3807 /* Value is non-zero if P is a pointer to a live Lisp string on
3808 the heap. M is a pointer to the mem_block for P. */
3811 live_string_p (struct mem_node
*m
, void *p
)
3813 if (m
->type
== MEM_TYPE_STRING
)
3815 struct string_block
*b
= (struct string_block
*) m
->start
;
3816 int offset
= (char *) p
- (char *) &b
->strings
[0];
3818 /* P must point to the start of a Lisp_String structure, and it
3819 must not be on the free-list. */
3821 && offset
% sizeof b
->strings
[0] == 0
3822 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3823 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3830 /* Value is non-zero if P is a pointer to a live Lisp cons on
3831 the heap. M is a pointer to the mem_block for P. */
3834 live_cons_p (struct mem_node
*m
, void *p
)
3836 if (m
->type
== MEM_TYPE_CONS
)
3838 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3839 int offset
= (char *) p
- (char *) &b
->conses
[0];
3841 /* P must point to the start of a Lisp_Cons, not be
3842 one of the unused cells in the current cons block,
3843 and not be on the free-list. */
3845 && offset
% sizeof b
->conses
[0] == 0
3846 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3848 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3849 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3856 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3857 the heap. M is a pointer to the mem_block for P. */
3860 live_symbol_p (struct mem_node
*m
, void *p
)
3862 if (m
->type
== MEM_TYPE_SYMBOL
)
3864 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3865 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3867 /* P must point to the start of a Lisp_Symbol, not be
3868 one of the unused cells in the current symbol block,
3869 and not be on the free-list. */
3871 && offset
% sizeof b
->symbols
[0] == 0
3872 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3873 && (b
!= symbol_block
3874 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3875 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3882 /* Value is non-zero if P is a pointer to a live Lisp float on
3883 the heap. M is a pointer to the mem_block for P. */
3886 live_float_p (struct mem_node
*m
, void *p
)
3888 if (m
->type
== MEM_TYPE_FLOAT
)
3890 struct float_block
*b
= (struct float_block
*) m
->start
;
3891 int offset
= (char *) p
- (char *) &b
->floats
[0];
3893 /* P must point to the start of a Lisp_Float and not be
3894 one of the unused cells in the current float block. */
3896 && offset
% sizeof b
->floats
[0] == 0
3897 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3898 && (b
!= float_block
3899 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3906 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3907 the heap. M is a pointer to the mem_block for P. */
3910 live_misc_p (struct mem_node
*m
, void *p
)
3912 if (m
->type
== MEM_TYPE_MISC
)
3914 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3915 int offset
= (char *) p
- (char *) &b
->markers
[0];
3917 /* P must point to the start of a Lisp_Misc, not be
3918 one of the unused cells in the current misc block,
3919 and not be on the free-list. */
3921 && offset
% sizeof b
->markers
[0] == 0
3922 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3923 && (b
!= marker_block
3924 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3925 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
3932 /* Value is non-zero if P is a pointer to a live vector-like object.
3933 M is a pointer to the mem_block for P. */
3936 live_vector_p (struct mem_node
*m
, void *p
)
3938 return (p
== m
->start
&& m
->type
== MEM_TYPE_VECTORLIKE
);
3942 /* Value is non-zero if P is a pointer to a live buffer. M is a
3943 pointer to the mem_block for P. */
3946 live_buffer_p (struct mem_node
*m
, void *p
)
3948 /* P must point to the start of the block, and the buffer
3949 must not have been killed. */
3950 return (m
->type
== MEM_TYPE_BUFFER
3952 && !NILP (((struct buffer
*) p
)->name
));
3955 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3959 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3961 /* Array of objects that are kept alive because the C stack contains
3962 a pattern that looks like a reference to them . */
3964 #define MAX_ZOMBIES 10
3965 static Lisp_Object zombies
[MAX_ZOMBIES
];
3967 /* Number of zombie objects. */
3969 static int nzombies
;
3971 /* Number of garbage collections. */
3975 /* Average percentage of zombies per collection. */
3977 static double avg_zombies
;
3979 /* Max. number of live and zombie objects. */
3981 static int max_live
, max_zombies
;
3983 /* Average number of live objects per GC. */
3985 static double avg_live
;
3987 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3988 doc
: /* Show information about live and zombie objects. */)
3991 Lisp_Object args
[8], zombie_list
= Qnil
;
3993 for (i
= 0; i
< nzombies
; i
++)
3994 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3995 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3996 args
[1] = make_number (ngcs
);
3997 args
[2] = make_float (avg_live
);
3998 args
[3] = make_float (avg_zombies
);
3999 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4000 args
[5] = make_number (max_live
);
4001 args
[6] = make_number (max_zombies
);
4002 args
[7] = zombie_list
;
4003 return Fmessage (8, args
);
4006 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4009 /* Mark OBJ if we can prove it's a Lisp_Object. */
4012 mark_maybe_object (Lisp_Object obj
)
4014 void *po
= (void *) XPNTR (obj
);
4015 struct mem_node
*m
= mem_find (po
);
4021 switch (XTYPE (obj
))
4024 mark_p
= (live_string_p (m
, po
)
4025 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4029 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4033 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4037 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4040 case Lisp_Vectorlike
:
4041 /* Note: can't check BUFFERP before we know it's a
4042 buffer because checking that dereferences the pointer
4043 PO which might point anywhere. */
4044 if (live_vector_p (m
, po
))
4045 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4046 else if (live_buffer_p (m
, po
))
4047 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4051 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4060 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4061 if (nzombies
< MAX_ZOMBIES
)
4062 zombies
[nzombies
] = obj
;
4071 /* If P points to Lisp data, mark that as live if it isn't already
4075 mark_maybe_pointer (void *p
)
4079 /* Quickly rule out some values which can't point to Lisp data. */
4082 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */
4084 2 /* We assume that Lisp data is aligned on even addresses. */
4092 Lisp_Object obj
= Qnil
;
4096 case MEM_TYPE_NON_LISP
:
4097 /* Nothing to do; not a pointer to Lisp memory. */
4100 case MEM_TYPE_BUFFER
:
4101 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4102 XSETVECTOR (obj
, p
);
4106 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4110 case MEM_TYPE_STRING
:
4111 if (live_string_p (m
, p
)
4112 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4113 XSETSTRING (obj
, p
);
4117 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4121 case MEM_TYPE_SYMBOL
:
4122 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4123 XSETSYMBOL (obj
, p
);
4126 case MEM_TYPE_FLOAT
:
4127 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4131 case MEM_TYPE_VECTORLIKE
:
4132 if (live_vector_p (m
, p
))
4135 XSETVECTOR (tem
, p
);
4136 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4151 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4152 or END+OFFSET..START. */
4155 mark_memory (void *start
, void *end
, int offset
)
4160 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4164 /* Make START the pointer to the start of the memory region,
4165 if it isn't already. */
4173 /* Mark Lisp_Objects. */
4174 for (p
= (Lisp_Object
*) ((char *) start
+ offset
); (void *) p
< end
; ++p
)
4175 mark_maybe_object (*p
);
4177 /* Mark Lisp data pointed to. This is necessary because, in some
4178 situations, the C compiler optimizes Lisp objects away, so that
4179 only a pointer to them remains. Example:
4181 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4184 Lisp_Object obj = build_string ("test");
4185 struct Lisp_String *s = XSTRING (obj);
4186 Fgarbage_collect ();
4187 fprintf (stderr, "test `%s'\n", s->data);
4191 Here, `obj' isn't really used, and the compiler optimizes it
4192 away. The only reference to the life string is through the
4195 for (pp
= (void **) ((char *) start
+ offset
); (void *) pp
< end
; ++pp
)
4196 mark_maybe_pointer (*pp
);
4199 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4200 the GCC system configuration. In gcc 3.2, the only systems for
4201 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4202 by others?) and ns32k-pc532-min. */
4204 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4206 static int setjmp_tested_p
, longjmps_done
;
4208 #define SETJMP_WILL_LIKELY_WORK "\
4210 Emacs garbage collector has been changed to use conservative stack\n\
4211 marking. Emacs has determined that the method it uses to do the\n\
4212 marking will likely work on your system, but this isn't sure.\n\
4214 If you are a system-programmer, or can get the help of a local wizard\n\
4215 who is, please take a look at the function mark_stack in alloc.c, and\n\
4216 verify that the methods used are appropriate for your system.\n\
4218 Please mail the result to <emacs-devel@gnu.org>.\n\
4221 #define SETJMP_WILL_NOT_WORK "\
4223 Emacs garbage collector has been changed to use conservative stack\n\
4224 marking. Emacs has determined that the default method it uses to do the\n\
4225 marking will not work on your system. We will need a system-dependent\n\
4226 solution for your system.\n\
4228 Please take a look at the function mark_stack in alloc.c, and\n\
4229 try to find a way to make it work on your system.\n\
4231 Note that you may get false negatives, depending on the compiler.\n\
4232 In particular, you need to use -O with GCC for this test.\n\
4234 Please mail the result to <emacs-devel@gnu.org>.\n\
4238 /* Perform a quick check if it looks like setjmp saves registers in a
4239 jmp_buf. Print a message to stderr saying so. When this test
4240 succeeds, this is _not_ a proof that setjmp is sufficient for
4241 conservative stack marking. Only the sources or a disassembly
4252 /* Arrange for X to be put in a register. */
4258 if (longjmps_done
== 1)
4260 /* Came here after the longjmp at the end of the function.
4262 If x == 1, the longjmp has restored the register to its
4263 value before the setjmp, and we can hope that setjmp
4264 saves all such registers in the jmp_buf, although that
4267 For other values of X, either something really strange is
4268 taking place, or the setjmp just didn't save the register. */
4271 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4274 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4281 if (longjmps_done
== 1)
4285 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4288 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4290 /* Abort if anything GCPRO'd doesn't survive the GC. */
4298 for (p
= gcprolist
; p
; p
= p
->next
)
4299 for (i
= 0; i
< p
->nvars
; ++i
)
4300 if (!survives_gc_p (p
->var
[i
]))
4301 /* FIXME: It's not necessarily a bug. It might just be that the
4302 GCPRO is unnecessary or should release the object sooner. */
4306 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4313 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4314 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4316 fprintf (stderr
, " %d = ", i
);
4317 debug_print (zombies
[i
]);
4321 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4324 /* Mark live Lisp objects on the C stack.
4326 There are several system-dependent problems to consider when
4327 porting this to new architectures:
4331 We have to mark Lisp objects in CPU registers that can hold local
4332 variables or are used to pass parameters.
4334 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4335 something that either saves relevant registers on the stack, or
4336 calls mark_maybe_object passing it each register's contents.
4338 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4339 implementation assumes that calling setjmp saves registers we need
4340 to see in a jmp_buf which itself lies on the stack. This doesn't
4341 have to be true! It must be verified for each system, possibly
4342 by taking a look at the source code of setjmp.
4346 Architectures differ in the way their processor stack is organized.
4347 For example, the stack might look like this
4350 | Lisp_Object | size = 4
4352 | something else | size = 2
4354 | Lisp_Object | size = 4
4358 In such a case, not every Lisp_Object will be aligned equally. To
4359 find all Lisp_Object on the stack it won't be sufficient to walk
4360 the stack in steps of 4 bytes. Instead, two passes will be
4361 necessary, one starting at the start of the stack, and a second
4362 pass starting at the start of the stack + 2. Likewise, if the
4363 minimal alignment of Lisp_Objects on the stack is 1, four passes
4364 would be necessary, each one starting with one byte more offset
4365 from the stack start.
4367 The current code assumes by default that Lisp_Objects are aligned
4368 equally on the stack. */
4374 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4375 union aligned_jmpbuf
{
4379 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4382 /* This trick flushes the register windows so that all the state of
4383 the process is contained in the stack. */
4384 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4385 needed on ia64 too. See mach_dep.c, where it also says inline
4386 assembler doesn't work with relevant proprietary compilers. */
4388 #if defined (__sparc64__) && defined (__FreeBSD__)
4389 /* FreeBSD does not have a ta 3 handler. */
4396 /* Save registers that we need to see on the stack. We need to see
4397 registers used to hold register variables and registers used to
4399 #ifdef GC_SAVE_REGISTERS_ON_STACK
4400 GC_SAVE_REGISTERS_ON_STACK (end
);
4401 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4403 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4404 setjmp will definitely work, test it
4405 and print a message with the result
4407 if (!setjmp_tested_p
)
4409 setjmp_tested_p
= 1;
4412 #endif /* GC_SETJMP_WORKS */
4415 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4416 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4418 /* This assumes that the stack is a contiguous region in memory. If
4419 that's not the case, something has to be done here to iterate
4420 over the stack segments. */
4421 #ifndef GC_LISP_OBJECT_ALIGNMENT
4423 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4425 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4428 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4429 mark_memory (stack_base
, end
, i
);
4430 /* Allow for marking a secondary stack, like the register stack on the
4432 #ifdef GC_MARK_SECONDARY_STACK
4433 GC_MARK_SECONDARY_STACK ();
4436 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4441 #endif /* GC_MARK_STACK != 0 */
4444 /* Determine whether it is safe to access memory at address P. */
4446 valid_pointer_p (void *p
)
4449 return w32_valid_pointer_p (p
, 16);
4453 /* Obviously, we cannot just access it (we would SEGV trying), so we
4454 trick the o/s to tell us whether p is a valid pointer.
4455 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4456 not validate p in that case. */
4458 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4460 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4462 unlink ("__Valid__Lisp__Object__");
4470 /* Return 1 if OBJ is a valid lisp object.
4471 Return 0 if OBJ is NOT a valid lisp object.
4472 Return -1 if we cannot validate OBJ.
4473 This function can be quite slow,
4474 so it should only be used in code for manual debugging. */
4477 valid_lisp_object_p (Lisp_Object obj
)
4487 p
= (void *) XPNTR (obj
);
4488 if (PURE_POINTER_P (p
))
4492 return valid_pointer_p (p
);
4499 int valid
= valid_pointer_p (p
);
4511 case MEM_TYPE_NON_LISP
:
4514 case MEM_TYPE_BUFFER
:
4515 return live_buffer_p (m
, p
);
4518 return live_cons_p (m
, p
);
4520 case MEM_TYPE_STRING
:
4521 return live_string_p (m
, p
);
4524 return live_misc_p (m
, p
);
4526 case MEM_TYPE_SYMBOL
:
4527 return live_symbol_p (m
, p
);
4529 case MEM_TYPE_FLOAT
:
4530 return live_float_p (m
, p
);
4532 case MEM_TYPE_VECTORLIKE
:
4533 return live_vector_p (m
, p
);
4546 /***********************************************************************
4547 Pure Storage Management
4548 ***********************************************************************/
4550 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4551 pointer to it. TYPE is the Lisp type for which the memory is
4552 allocated. TYPE < 0 means it's not used for a Lisp object. */
4554 static POINTER_TYPE
*
4555 pure_alloc (size_t size
, int type
)
4557 POINTER_TYPE
*result
;
4559 size_t alignment
= (1 << GCTYPEBITS
);
4561 size_t alignment
= sizeof (EMACS_INT
);
4563 /* Give Lisp_Floats an extra alignment. */
4564 if (type
== Lisp_Float
)
4566 #if defined __GNUC__ && __GNUC__ >= 2
4567 alignment
= __alignof (struct Lisp_Float
);
4569 alignment
= sizeof (struct Lisp_Float
);
4577 /* Allocate space for a Lisp object from the beginning of the free
4578 space with taking account of alignment. */
4579 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4580 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4584 /* Allocate space for a non-Lisp object from the end of the free
4586 pure_bytes_used_non_lisp
+= size
;
4587 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4589 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4591 if (pure_bytes_used
<= pure_size
)
4594 /* Don't allocate a large amount here,
4595 because it might get mmap'd and then its address
4596 might not be usable. */
4597 purebeg
= (char *) xmalloc (10000);
4599 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4600 pure_bytes_used
= 0;
4601 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4606 /* Print a warning if PURESIZE is too small. */
4609 check_pure_size (void)
4611 if (pure_bytes_used_before_overflow
)
4612 message ("emacs:0:Pure Lisp storage overflow (approx. %d bytes needed)",
4613 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4617 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4618 the non-Lisp data pool of the pure storage, and return its start
4619 address. Return NULL if not found. */
4622 find_string_data_in_pure (const char *data
, int nbytes
)
4624 int i
, skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4625 const unsigned char *p
;
4628 if (pure_bytes_used_non_lisp
< nbytes
+ 1)
4631 /* Set up the Boyer-Moore table. */
4633 for (i
= 0; i
< 256; i
++)
4636 p
= (const unsigned char *) data
;
4638 bm_skip
[*p
++] = skip
;
4640 last_char_skip
= bm_skip
['\0'];
4642 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4643 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4645 /* See the comments in the function `boyer_moore' (search.c) for the
4646 use of `infinity'. */
4647 infinity
= pure_bytes_used_non_lisp
+ 1;
4648 bm_skip
['\0'] = infinity
;
4650 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
4654 /* Check the last character (== '\0'). */
4657 start
+= bm_skip
[*(p
+ start
)];
4659 while (start
<= start_max
);
4661 if (start
< infinity
)
4662 /* Couldn't find the last character. */
4665 /* No less than `infinity' means we could find the last
4666 character at `p[start - infinity]'. */
4669 /* Check the remaining characters. */
4670 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4672 return non_lisp_beg
+ start
;
4674 start
+= last_char_skip
;
4676 while (start
<= start_max
);
4682 /* Return a string allocated in pure space. DATA is a buffer holding
4683 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4684 non-zero means make the result string multibyte.
4686 Must get an error if pure storage is full, since if it cannot hold
4687 a large string it may be able to hold conses that point to that
4688 string; then the string is not protected from gc. */
4691 make_pure_string (const char *data
, int nchars
, int nbytes
, int multibyte
)
4694 struct Lisp_String
*s
;
4696 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4697 s
->data
= find_string_data_in_pure (data
, nbytes
);
4698 if (s
->data
== NULL
)
4700 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4701 memcpy (s
->data
, data
, nbytes
);
4702 s
->data
[nbytes
] = '\0';
4705 s
->size_byte
= multibyte
? nbytes
: -1;
4706 s
->intervals
= NULL_INTERVAL
;
4707 XSETSTRING (string
, s
);
4711 /* Return a string a string allocated in pure space. Do not allocate
4712 the string data, just point to DATA. */
4715 make_pure_c_string (const char *data
)
4718 struct Lisp_String
*s
;
4719 int nchars
= strlen (data
);
4721 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4724 s
->data
= (unsigned char *) data
;
4725 s
->intervals
= NULL_INTERVAL
;
4726 XSETSTRING (string
, s
);
4730 /* Return a cons allocated from pure space. Give it pure copies
4731 of CAR as car and CDR as cdr. */
4734 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
4736 register Lisp_Object
new;
4737 struct Lisp_Cons
*p
;
4739 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4741 XSETCAR (new, Fpurecopy (car
));
4742 XSETCDR (new, Fpurecopy (cdr
));
4747 /* Value is a float object with value NUM allocated from pure space. */
4750 make_pure_float (double num
)
4752 register Lisp_Object
new;
4753 struct Lisp_Float
*p
;
4755 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4757 XFLOAT_INIT (new, num
);
4762 /* Return a vector with room for LEN Lisp_Objects allocated from
4766 make_pure_vector (EMACS_INT len
)
4769 struct Lisp_Vector
*p
;
4770 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4772 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4773 XSETVECTOR (new, p
);
4774 XVECTOR (new)->size
= len
;
4779 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4780 doc
: /* Make a copy of object OBJ in pure storage.
4781 Recursively copies contents of vectors and cons cells.
4782 Does not copy symbols. Copies strings without text properties. */)
4783 (register Lisp_Object obj
)
4785 if (NILP (Vpurify_flag
))
4788 if (PURE_POINTER_P (XPNTR (obj
)))
4791 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4793 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
4799 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
4800 else if (FLOATP (obj
))
4801 obj
= make_pure_float (XFLOAT_DATA (obj
));
4802 else if (STRINGP (obj
))
4803 obj
= make_pure_string (SDATA (obj
), SCHARS (obj
),
4805 STRING_MULTIBYTE (obj
));
4806 else if (COMPILEDP (obj
) || VECTORP (obj
))
4808 register struct Lisp_Vector
*vec
;
4812 size
= XVECTOR (obj
)->size
;
4813 if (size
& PSEUDOVECTOR_FLAG
)
4814 size
&= PSEUDOVECTOR_SIZE_MASK
;
4815 vec
= XVECTOR (make_pure_vector (size
));
4816 for (i
= 0; i
< size
; i
++)
4817 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4818 if (COMPILEDP (obj
))
4820 XSETPVECTYPE (vec
, PVEC_COMPILED
);
4821 XSETCOMPILED (obj
, vec
);
4824 XSETVECTOR (obj
, vec
);
4826 else if (MARKERP (obj
))
4827 error ("Attempt to copy a marker to pure storage");
4829 /* Not purified, don't hash-cons. */
4832 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4833 Fputhash (obj
, obj
, Vpurify_flag
);
4840 /***********************************************************************
4842 ***********************************************************************/
4844 /* Put an entry in staticvec, pointing at the variable with address
4848 staticpro (Lisp_Object
*varaddress
)
4850 staticvec
[staticidx
++] = varaddress
;
4851 if (staticidx
>= NSTATICS
)
4856 /***********************************************************************
4858 ***********************************************************************/
4860 /* Temporarily prevent garbage collection. */
4863 inhibit_garbage_collection (void)
4865 int count
= SPECPDL_INDEX ();
4866 int nbits
= min (VALBITS
, BITS_PER_INT
);
4868 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4873 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4874 doc
: /* Reclaim storage for Lisp objects no longer needed.
4875 Garbage collection happens automatically if you cons more than
4876 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4877 `garbage-collect' normally returns a list with info on amount of space in use:
4878 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4879 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4880 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4881 (USED-STRINGS . FREE-STRINGS))
4882 However, if there was overflow in pure space, `garbage-collect'
4883 returns nil, because real GC can't be done. */)
4886 register struct specbinding
*bind
;
4887 struct catchtag
*catch;
4888 struct handler
*handler
;
4889 char stack_top_variable
;
4892 Lisp_Object total
[8];
4893 int count
= SPECPDL_INDEX ();
4894 EMACS_TIME t1
, t2
, t3
;
4899 /* Can't GC if pure storage overflowed because we can't determine
4900 if something is a pure object or not. */
4901 if (pure_bytes_used_before_overflow
)
4906 /* Don't keep undo information around forever.
4907 Do this early on, so it is no problem if the user quits. */
4909 register struct buffer
*nextb
= all_buffers
;
4913 /* If a buffer's undo list is Qt, that means that undo is
4914 turned off in that buffer. Calling truncate_undo_list on
4915 Qt tends to return NULL, which effectively turns undo back on.
4916 So don't call truncate_undo_list if undo_list is Qt. */
4917 if (! NILP (nextb
->name
) && ! EQ (nextb
->undo_list
, Qt
))
4918 truncate_undo_list (nextb
);
4920 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4921 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
)
4922 && ! nextb
->text
->inhibit_shrinking
)
4924 /* If a buffer's gap size is more than 10% of the buffer
4925 size, or larger than 2000 bytes, then shrink it
4926 accordingly. Keep a minimum size of 20 bytes. */
4927 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4929 if (nextb
->text
->gap_size
> size
)
4931 struct buffer
*save_current
= current_buffer
;
4932 current_buffer
= nextb
;
4933 make_gap (-(nextb
->text
->gap_size
- size
));
4934 current_buffer
= save_current
;
4938 nextb
= nextb
->next
;
4942 EMACS_GET_TIME (t1
);
4944 /* In case user calls debug_print during GC,
4945 don't let that cause a recursive GC. */
4946 consing_since_gc
= 0;
4948 /* Save what's currently displayed in the echo area. */
4949 message_p
= push_message ();
4950 record_unwind_protect (pop_message_unwind
, Qnil
);
4952 /* Save a copy of the contents of the stack, for debugging. */
4953 #if MAX_SAVE_STACK > 0
4954 if (NILP (Vpurify_flag
))
4956 i
= &stack_top_variable
- stack_bottom
;
4958 if (i
< MAX_SAVE_STACK
)
4960 if (stack_copy
== 0)
4961 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
4962 else if (stack_copy_size
< i
)
4963 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
4966 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
4967 memcpy (stack_copy
, stack_bottom
, i
);
4969 memcpy (stack_copy
, &stack_top_variable
, i
);
4973 #endif /* MAX_SAVE_STACK > 0 */
4975 if (garbage_collection_messages
)
4976 message1_nolog ("Garbage collecting...");
4980 shrink_regexp_cache ();
4984 /* clear_marks (); */
4986 /* Mark all the special slots that serve as the roots of accessibility. */
4988 for (i
= 0; i
< staticidx
; i
++)
4989 mark_object (*staticvec
[i
]);
4991 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4993 mark_object (bind
->symbol
);
4994 mark_object (bind
->old_value
);
5002 extern void xg_mark_data (void);
5007 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5008 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5012 register struct gcpro
*tail
;
5013 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5014 for (i
= 0; i
< tail
->nvars
; i
++)
5015 mark_object (tail
->var
[i
]);
5020 for (catch = catchlist
; catch; catch = catch->next
)
5022 mark_object (catch->tag
);
5023 mark_object (catch->val
);
5025 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5027 mark_object (handler
->handler
);
5028 mark_object (handler
->var
);
5032 #ifdef HAVE_WINDOW_SYSTEM
5033 mark_fringe_data ();
5036 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5040 /* Everything is now marked, except for the things that require special
5041 finalization, i.e. the undo_list.
5042 Look thru every buffer's undo list
5043 for elements that update markers that were not marked,
5046 register struct buffer
*nextb
= all_buffers
;
5050 /* If a buffer's undo list is Qt, that means that undo is
5051 turned off in that buffer. Calling truncate_undo_list on
5052 Qt tends to return NULL, which effectively turns undo back on.
5053 So don't call truncate_undo_list if undo_list is Qt. */
5054 if (! EQ (nextb
->undo_list
, Qt
))
5056 Lisp_Object tail
, prev
;
5057 tail
= nextb
->undo_list
;
5059 while (CONSP (tail
))
5061 if (CONSP (XCAR (tail
))
5062 && MARKERP (XCAR (XCAR (tail
)))
5063 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5066 nextb
->undo_list
= tail
= XCDR (tail
);
5070 XSETCDR (prev
, tail
);
5080 /* Now that we have stripped the elements that need not be in the
5081 undo_list any more, we can finally mark the list. */
5082 mark_object (nextb
->undo_list
);
5084 nextb
= nextb
->next
;
5090 /* Clear the mark bits that we set in certain root slots. */
5092 unmark_byte_stack ();
5093 VECTOR_UNMARK (&buffer_defaults
);
5094 VECTOR_UNMARK (&buffer_local_symbols
);
5096 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5104 /* clear_marks (); */
5107 consing_since_gc
= 0;
5108 if (gc_cons_threshold
< 10000)
5109 gc_cons_threshold
= 10000;
5111 if (FLOATP (Vgc_cons_percentage
))
5112 { /* Set gc_cons_combined_threshold. */
5113 EMACS_INT total
= 0;
5115 total
+= total_conses
* sizeof (struct Lisp_Cons
);
5116 total
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5117 total
+= total_markers
* sizeof (union Lisp_Misc
);
5118 total
+= total_string_size
;
5119 total
+= total_vector_size
* sizeof (Lisp_Object
);
5120 total
+= total_floats
* sizeof (struct Lisp_Float
);
5121 total
+= total_intervals
* sizeof (struct interval
);
5122 total
+= total_strings
* sizeof (struct Lisp_String
);
5124 gc_relative_threshold
= total
* XFLOAT_DATA (Vgc_cons_percentage
);
5127 gc_relative_threshold
= 0;
5129 if (garbage_collection_messages
)
5131 if (message_p
|| minibuf_level
> 0)
5134 message1_nolog ("Garbage collecting...done");
5137 unbind_to (count
, Qnil
);
5139 total
[0] = Fcons (make_number (total_conses
),
5140 make_number (total_free_conses
));
5141 total
[1] = Fcons (make_number (total_symbols
),
5142 make_number (total_free_symbols
));
5143 total
[2] = Fcons (make_number (total_markers
),
5144 make_number (total_free_markers
));
5145 total
[3] = make_number (total_string_size
);
5146 total
[4] = make_number (total_vector_size
);
5147 total
[5] = Fcons (make_number (total_floats
),
5148 make_number (total_free_floats
));
5149 total
[6] = Fcons (make_number (total_intervals
),
5150 make_number (total_free_intervals
));
5151 total
[7] = Fcons (make_number (total_strings
),
5152 make_number (total_free_strings
));
5154 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5156 /* Compute average percentage of zombies. */
5159 for (i
= 0; i
< 7; ++i
)
5160 if (CONSP (total
[i
]))
5161 nlive
+= XFASTINT (XCAR (total
[i
]));
5163 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5164 max_live
= max (nlive
, max_live
);
5165 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5166 max_zombies
= max (nzombies
, max_zombies
);
5171 if (!NILP (Vpost_gc_hook
))
5173 int count
= inhibit_garbage_collection ();
5174 safe_run_hooks (Qpost_gc_hook
);
5175 unbind_to (count
, Qnil
);
5178 /* Accumulate statistics. */
5179 EMACS_GET_TIME (t2
);
5180 EMACS_SUB_TIME (t3
, t2
, t1
);
5181 if (FLOATP (Vgc_elapsed
))
5182 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5184 EMACS_USECS (t3
) * 1.0e-6);
5187 return Flist (sizeof total
/ sizeof *total
, total
);
5191 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5192 only interesting objects referenced from glyphs are strings. */
5195 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5197 struct glyph_row
*row
= matrix
->rows
;
5198 struct glyph_row
*end
= row
+ matrix
->nrows
;
5200 for (; row
< end
; ++row
)
5204 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5206 struct glyph
*glyph
= row
->glyphs
[area
];
5207 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5209 for (; glyph
< end_glyph
; ++glyph
)
5210 if (STRINGP (glyph
->object
)
5211 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5212 mark_object (glyph
->object
);
5218 /* Mark Lisp faces in the face cache C. */
5221 mark_face_cache (struct face_cache
*c
)
5226 for (i
= 0; i
< c
->used
; ++i
)
5228 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5232 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5233 mark_object (face
->lface
[j
]);
5241 /* Mark reference to a Lisp_Object.
5242 If the object referred to has not been seen yet, recursively mark
5243 all the references contained in it. */
5245 #define LAST_MARKED_SIZE 500
5246 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5247 int last_marked_index
;
5249 /* For debugging--call abort when we cdr down this many
5250 links of a list, in mark_object. In debugging,
5251 the call to abort will hit a breakpoint.
5252 Normally this is zero and the check never goes off. */
5253 static int mark_object_loop_halt
;
5256 mark_vectorlike (struct Lisp_Vector
*ptr
)
5258 register EMACS_INT size
= ptr
->size
;
5261 eassert (!VECTOR_MARKED_P (ptr
));
5262 VECTOR_MARK (ptr
); /* Else mark it */
5263 if (size
& PSEUDOVECTOR_FLAG
)
5264 size
&= PSEUDOVECTOR_SIZE_MASK
;
5266 /* Note that this size is not the memory-footprint size, but only
5267 the number of Lisp_Object fields that we should trace.
5268 The distinction is used e.g. by Lisp_Process which places extra
5269 non-Lisp_Object fields at the end of the structure. */
5270 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5271 mark_object (ptr
->contents
[i
]);
5274 /* Like mark_vectorlike but optimized for char-tables (and
5275 sub-char-tables) assuming that the contents are mostly integers or
5279 mark_char_table (struct Lisp_Vector
*ptr
)
5281 register EMACS_INT size
= ptr
->size
& PSEUDOVECTOR_SIZE_MASK
;
5284 eassert (!VECTOR_MARKED_P (ptr
));
5286 for (i
= 0; i
< size
; i
++)
5288 Lisp_Object val
= ptr
->contents
[i
];
5290 if (INTEGERP (val
) || SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
)
5292 if (SUB_CHAR_TABLE_P (val
))
5294 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5295 mark_char_table (XVECTOR (val
));
5303 mark_object (Lisp_Object arg
)
5305 register Lisp_Object obj
= arg
;
5306 #ifdef GC_CHECK_MARKED_OBJECTS
5314 if (PURE_POINTER_P (XPNTR (obj
)))
5317 last_marked
[last_marked_index
++] = obj
;
5318 if (last_marked_index
== LAST_MARKED_SIZE
)
5319 last_marked_index
= 0;
5321 /* Perform some sanity checks on the objects marked here. Abort if
5322 we encounter an object we know is bogus. This increases GC time
5323 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5324 #ifdef GC_CHECK_MARKED_OBJECTS
5326 po
= (void *) XPNTR (obj
);
5328 /* Check that the object pointed to by PO is known to be a Lisp
5329 structure allocated from the heap. */
5330 #define CHECK_ALLOCATED() \
5332 m = mem_find (po); \
5337 /* Check that the object pointed to by PO is live, using predicate
5339 #define CHECK_LIVE(LIVEP) \
5341 if (!LIVEP (m, po)) \
5345 /* Check both of the above conditions. */
5346 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5348 CHECK_ALLOCATED (); \
5349 CHECK_LIVE (LIVEP); \
5352 #else /* not GC_CHECK_MARKED_OBJECTS */
5354 #define CHECK_ALLOCATED() (void) 0
5355 #define CHECK_LIVE(LIVEP) (void) 0
5356 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5358 #endif /* not GC_CHECK_MARKED_OBJECTS */
5360 switch (SWITCH_ENUM_CAST (XTYPE (obj
)))
5364 register struct Lisp_String
*ptr
= XSTRING (obj
);
5365 if (STRING_MARKED_P (ptr
))
5367 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5368 MARK_INTERVAL_TREE (ptr
->intervals
);
5370 #ifdef GC_CHECK_STRING_BYTES
5371 /* Check that the string size recorded in the string is the
5372 same as the one recorded in the sdata structure. */
5373 CHECK_STRING_BYTES (ptr
);
5374 #endif /* GC_CHECK_STRING_BYTES */
5378 case Lisp_Vectorlike
:
5379 if (VECTOR_MARKED_P (XVECTOR (obj
)))
5381 #ifdef GC_CHECK_MARKED_OBJECTS
5383 if (m
== MEM_NIL
&& !SUBRP (obj
)
5384 && po
!= &buffer_defaults
5385 && po
!= &buffer_local_symbols
)
5387 #endif /* GC_CHECK_MARKED_OBJECTS */
5391 #ifdef GC_CHECK_MARKED_OBJECTS
5392 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5395 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
5400 #endif /* GC_CHECK_MARKED_OBJECTS */
5403 else if (SUBRP (obj
))
5405 else if (COMPILEDP (obj
))
5406 /* We could treat this just like a vector, but it is better to
5407 save the COMPILED_CONSTANTS element for last and avoid
5410 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5411 register EMACS_INT size
= ptr
->size
;
5414 CHECK_LIVE (live_vector_p
);
5415 VECTOR_MARK (ptr
); /* Else mark it */
5416 size
&= PSEUDOVECTOR_SIZE_MASK
;
5417 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5419 if (i
!= COMPILED_CONSTANTS
)
5420 mark_object (ptr
->contents
[i
]);
5422 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5425 else if (FRAMEP (obj
))
5427 register struct frame
*ptr
= XFRAME (obj
);
5428 mark_vectorlike (XVECTOR (obj
));
5429 mark_face_cache (ptr
->face_cache
);
5431 else if (WINDOWP (obj
))
5433 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5434 struct window
*w
= XWINDOW (obj
);
5435 mark_vectorlike (ptr
);
5436 /* Mark glyphs for leaf windows. Marking window matrices is
5437 sufficient because frame matrices use the same glyph
5439 if (NILP (w
->hchild
)
5441 && w
->current_matrix
)
5443 mark_glyph_matrix (w
->current_matrix
);
5444 mark_glyph_matrix (w
->desired_matrix
);
5447 else if (HASH_TABLE_P (obj
))
5449 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5450 mark_vectorlike ((struct Lisp_Vector
*)h
);
5451 /* If hash table is not weak, mark all keys and values.
5452 For weak tables, mark only the vector. */
5454 mark_object (h
->key_and_value
);
5456 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5458 else if (CHAR_TABLE_P (obj
))
5459 mark_char_table (XVECTOR (obj
));
5461 mark_vectorlike (XVECTOR (obj
));
5466 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5467 struct Lisp_Symbol
*ptrx
;
5471 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5473 mark_object (ptr
->function
);
5474 mark_object (ptr
->plist
);
5475 switch (ptr
->redirect
)
5477 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
5478 case SYMBOL_VARALIAS
:
5481 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
5485 case SYMBOL_LOCALIZED
:
5487 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
5488 /* If the value is forwarded to a buffer or keyboard field,
5489 these are marked when we see the corresponding object.
5490 And if it's forwarded to a C variable, either it's not
5491 a Lisp_Object var, or it's staticpro'd already. */
5492 mark_object (blv
->where
);
5493 mark_object (blv
->valcell
);
5494 mark_object (blv
->defcell
);
5497 case SYMBOL_FORWARDED
:
5498 /* If the value is forwarded to a buffer or keyboard field,
5499 these are marked when we see the corresponding object.
5500 And if it's forwarded to a C variable, either it's not
5501 a Lisp_Object var, or it's staticpro'd already. */
5505 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5506 MARK_STRING (XSTRING (ptr
->xname
));
5507 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5512 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5513 XSETSYMBOL (obj
, ptrx
);
5520 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5521 if (XMISCANY (obj
)->gcmarkbit
)
5523 XMISCANY (obj
)->gcmarkbit
= 1;
5525 switch (XMISCTYPE (obj
))
5528 case Lisp_Misc_Marker
:
5529 /* DO NOT mark thru the marker's chain.
5530 The buffer's markers chain does not preserve markers from gc;
5531 instead, markers are removed from the chain when freed by gc. */
5534 case Lisp_Misc_Save_Value
:
5537 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5538 /* If DOGC is set, POINTER is the address of a memory
5539 area containing INTEGER potential Lisp_Objects. */
5542 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5544 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5545 mark_maybe_object (*p
);
5551 case Lisp_Misc_Overlay
:
5553 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5554 mark_object (ptr
->start
);
5555 mark_object (ptr
->end
);
5556 mark_object (ptr
->plist
);
5559 XSETMISC (obj
, ptr
->next
);
5572 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5573 if (CONS_MARKED_P (ptr
))
5575 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5577 /* If the cdr is nil, avoid recursion for the car. */
5578 if (EQ (ptr
->u
.cdr
, Qnil
))
5584 mark_object (ptr
->car
);
5587 if (cdr_count
== mark_object_loop_halt
)
5593 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5594 FLOAT_MARK (XFLOAT (obj
));
5605 #undef CHECK_ALLOCATED
5606 #undef CHECK_ALLOCATED_AND_LIVE
5609 /* Mark the pointers in a buffer structure. */
5612 mark_buffer (Lisp_Object buf
)
5614 register struct buffer
*buffer
= XBUFFER (buf
);
5615 register Lisp_Object
*ptr
, tmp
;
5616 Lisp_Object base_buffer
;
5618 eassert (!VECTOR_MARKED_P (buffer
));
5619 VECTOR_MARK (buffer
);
5621 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5623 /* For now, we just don't mark the undo_list. It's done later in
5624 a special way just before the sweep phase, and after stripping
5625 some of its elements that are not needed any more. */
5627 if (buffer
->overlays_before
)
5629 XSETMISC (tmp
, buffer
->overlays_before
);
5632 if (buffer
->overlays_after
)
5634 XSETMISC (tmp
, buffer
->overlays_after
);
5638 /* buffer-local Lisp variables start at `undo_list',
5639 tho only the ones from `name' on are GC'd normally. */
5640 for (ptr
= &buffer
->name
;
5641 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5645 /* If this is an indirect buffer, mark its base buffer. */
5646 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5648 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5649 mark_buffer (base_buffer
);
5653 /* Mark the Lisp pointers in the terminal objects.
5654 Called by the Fgarbage_collector. */
5657 mark_terminals (void)
5660 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5662 eassert (t
->name
!= NULL
);
5663 if (!VECTOR_MARKED_P (t
))
5665 #ifdef HAVE_WINDOW_SYSTEM
5666 mark_image_cache (t
->image_cache
);
5667 #endif /* HAVE_WINDOW_SYSTEM */
5668 mark_vectorlike ((struct Lisp_Vector
*)t
);
5675 /* Value is non-zero if OBJ will survive the current GC because it's
5676 either marked or does not need to be marked to survive. */
5679 survives_gc_p (Lisp_Object obj
)
5683 switch (XTYPE (obj
))
5690 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5694 survives_p
= XMISCANY (obj
)->gcmarkbit
;
5698 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5701 case Lisp_Vectorlike
:
5702 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5706 survives_p
= CONS_MARKED_P (XCONS (obj
));
5710 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5717 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5722 /* Sweep: find all structures not marked, and free them. */
5727 /* Remove or mark entries in weak hash tables.
5728 This must be done before any object is unmarked. */
5729 sweep_weak_hash_tables ();
5732 #ifdef GC_CHECK_STRING_BYTES
5733 if (!noninteractive
)
5734 check_string_bytes (1);
5737 /* Put all unmarked conses on free list */
5739 register struct cons_block
*cblk
;
5740 struct cons_block
**cprev
= &cons_block
;
5741 register int lim
= cons_block_index
;
5742 register int num_free
= 0, num_used
= 0;
5746 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5750 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
5752 /* Scan the mark bits an int at a time. */
5753 for (i
= 0; i
<= ilim
; i
++)
5755 if (cblk
->gcmarkbits
[i
] == -1)
5757 /* Fast path - all cons cells for this int are marked. */
5758 cblk
->gcmarkbits
[i
] = 0;
5759 num_used
+= BITS_PER_INT
;
5763 /* Some cons cells for this int are not marked.
5764 Find which ones, and free them. */
5765 int start
, pos
, stop
;
5767 start
= i
* BITS_PER_INT
;
5769 if (stop
> BITS_PER_INT
)
5770 stop
= BITS_PER_INT
;
5773 for (pos
= start
; pos
< stop
; pos
++)
5775 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
5778 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
5779 cons_free_list
= &cblk
->conses
[pos
];
5781 cons_free_list
->car
= Vdead
;
5787 CONS_UNMARK (&cblk
->conses
[pos
]);
5793 lim
= CONS_BLOCK_SIZE
;
5794 /* If this block contains only free conses and we have already
5795 seen more than two blocks worth of free conses then deallocate
5797 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5799 *cprev
= cblk
->next
;
5800 /* Unhook from the free list. */
5801 cons_free_list
= cblk
->conses
[0].u
.chain
;
5802 lisp_align_free (cblk
);
5807 num_free
+= this_free
;
5808 cprev
= &cblk
->next
;
5811 total_conses
= num_used
;
5812 total_free_conses
= num_free
;
5815 /* Put all unmarked floats on free list */
5817 register struct float_block
*fblk
;
5818 struct float_block
**fprev
= &float_block
;
5819 register int lim
= float_block_index
;
5820 register int num_free
= 0, num_used
= 0;
5822 float_free_list
= 0;
5824 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5828 for (i
= 0; i
< lim
; i
++)
5829 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5832 fblk
->floats
[i
].u
.chain
= float_free_list
;
5833 float_free_list
= &fblk
->floats
[i
];
5838 FLOAT_UNMARK (&fblk
->floats
[i
]);
5840 lim
= FLOAT_BLOCK_SIZE
;
5841 /* If this block contains only free floats and we have already
5842 seen more than two blocks worth of free floats then deallocate
5844 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5846 *fprev
= fblk
->next
;
5847 /* Unhook from the free list. */
5848 float_free_list
= fblk
->floats
[0].u
.chain
;
5849 lisp_align_free (fblk
);
5854 num_free
+= this_free
;
5855 fprev
= &fblk
->next
;
5858 total_floats
= num_used
;
5859 total_free_floats
= num_free
;
5862 /* Put all unmarked intervals on free list */
5864 register struct interval_block
*iblk
;
5865 struct interval_block
**iprev
= &interval_block
;
5866 register int lim
= interval_block_index
;
5867 register int num_free
= 0, num_used
= 0;
5869 interval_free_list
= 0;
5871 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5876 for (i
= 0; i
< lim
; i
++)
5878 if (!iblk
->intervals
[i
].gcmarkbit
)
5880 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5881 interval_free_list
= &iblk
->intervals
[i
];
5887 iblk
->intervals
[i
].gcmarkbit
= 0;
5890 lim
= INTERVAL_BLOCK_SIZE
;
5891 /* If this block contains only free intervals and we have already
5892 seen more than two blocks worth of free intervals then
5893 deallocate this block. */
5894 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5896 *iprev
= iblk
->next
;
5897 /* Unhook from the free list. */
5898 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5900 n_interval_blocks
--;
5904 num_free
+= this_free
;
5905 iprev
= &iblk
->next
;
5908 total_intervals
= num_used
;
5909 total_free_intervals
= num_free
;
5912 /* Put all unmarked symbols on free list */
5914 register struct symbol_block
*sblk
;
5915 struct symbol_block
**sprev
= &symbol_block
;
5916 register int lim
= symbol_block_index
;
5917 register int num_free
= 0, num_used
= 0;
5919 symbol_free_list
= NULL
;
5921 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5924 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5925 struct Lisp_Symbol
*end
= sym
+ lim
;
5927 for (; sym
< end
; ++sym
)
5929 /* Check if the symbol was created during loadup. In such a case
5930 it might be pointed to by pure bytecode which we don't trace,
5931 so we conservatively assume that it is live. */
5932 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5934 if (!sym
->gcmarkbit
&& !pure_p
)
5936 if (sym
->redirect
== SYMBOL_LOCALIZED
)
5937 xfree (SYMBOL_BLV (sym
));
5938 sym
->next
= symbol_free_list
;
5939 symbol_free_list
= sym
;
5941 symbol_free_list
->function
= Vdead
;
5949 UNMARK_STRING (XSTRING (sym
->xname
));
5954 lim
= SYMBOL_BLOCK_SIZE
;
5955 /* If this block contains only free symbols and we have already
5956 seen more than two blocks worth of free symbols then deallocate
5958 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5960 *sprev
= sblk
->next
;
5961 /* Unhook from the free list. */
5962 symbol_free_list
= sblk
->symbols
[0].next
;
5968 num_free
+= this_free
;
5969 sprev
= &sblk
->next
;
5972 total_symbols
= num_used
;
5973 total_free_symbols
= num_free
;
5976 /* Put all unmarked misc's on free list.
5977 For a marker, first unchain it from the buffer it points into. */
5979 register struct marker_block
*mblk
;
5980 struct marker_block
**mprev
= &marker_block
;
5981 register int lim
= marker_block_index
;
5982 register int num_free
= 0, num_used
= 0;
5984 marker_free_list
= 0;
5986 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5991 for (i
= 0; i
< lim
; i
++)
5993 if (!mblk
->markers
[i
].u_any
.gcmarkbit
)
5995 if (mblk
->markers
[i
].u_any
.type
== Lisp_Misc_Marker
)
5996 unchain_marker (&mblk
->markers
[i
].u_marker
);
5997 /* Set the type of the freed object to Lisp_Misc_Free.
5998 We could leave the type alone, since nobody checks it,
5999 but this might catch bugs faster. */
6000 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
6001 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
6002 marker_free_list
= &mblk
->markers
[i
];
6008 mblk
->markers
[i
].u_any
.gcmarkbit
= 0;
6011 lim
= MARKER_BLOCK_SIZE
;
6012 /* If this block contains only free markers and we have already
6013 seen more than two blocks worth of free markers then deallocate
6015 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6017 *mprev
= mblk
->next
;
6018 /* Unhook from the free list. */
6019 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
6025 num_free
+= this_free
;
6026 mprev
= &mblk
->next
;
6030 total_markers
= num_used
;
6031 total_free_markers
= num_free
;
6034 /* Free all unmarked buffers */
6036 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6039 if (!VECTOR_MARKED_P (buffer
))
6042 prev
->next
= buffer
->next
;
6044 all_buffers
= buffer
->next
;
6045 next
= buffer
->next
;
6051 VECTOR_UNMARK (buffer
);
6052 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6053 prev
= buffer
, buffer
= buffer
->next
;
6057 /* Free all unmarked vectors */
6059 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6060 total_vector_size
= 0;
6063 if (!VECTOR_MARKED_P (vector
))
6066 prev
->next
= vector
->next
;
6068 all_vectors
= vector
->next
;
6069 next
= vector
->next
;
6077 VECTOR_UNMARK (vector
);
6078 if (vector
->size
& PSEUDOVECTOR_FLAG
)
6079 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
6081 total_vector_size
+= vector
->size
;
6082 prev
= vector
, vector
= vector
->next
;
6086 #ifdef GC_CHECK_STRING_BYTES
6087 if (!noninteractive
)
6088 check_string_bytes (1);
6095 /* Debugging aids. */
6097 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6098 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6099 This may be helpful in debugging Emacs's memory usage.
6100 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6105 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
6110 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6111 doc
: /* Return a list of counters that measure how much consing there has been.
6112 Each of these counters increments for a certain kind of object.
6113 The counters wrap around from the largest positive integer to zero.
6114 Garbage collection does not decrease them.
6115 The elements of the value are as follows:
6116 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6117 All are in units of 1 = one object consed
6118 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6120 MISCS include overlays, markers, and some internal types.
6121 Frames, windows, buffers, and subprocesses count as vectors
6122 (but the contents of a buffer's text do not count here). */)
6125 Lisp_Object consed
[8];
6127 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6128 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6129 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6130 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6131 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6132 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6133 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6134 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6136 return Flist (8, consed
);
6139 int suppress_checking
;
6142 die (const char *msg
, const char *file
, int line
)
6144 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6149 /* Initialization */
6152 init_alloc_once (void)
6154 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6156 pure_size
= PURESIZE
;
6157 pure_bytes_used
= 0;
6158 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6159 pure_bytes_used_before_overflow
= 0;
6161 /* Initialize the list of free aligned blocks. */
6164 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6166 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6170 ignore_warnings
= 1;
6171 #ifdef DOUG_LEA_MALLOC
6172 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6173 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6174 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6182 init_weak_hash_tables ();
6185 malloc_hysteresis
= 32;
6187 malloc_hysteresis
= 0;
6190 refill_memory_reserve ();
6192 ignore_warnings
= 0;
6194 byte_stack_list
= 0;
6196 consing_since_gc
= 0;
6197 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6198 gc_relative_threshold
= 0;
6200 #ifdef VIRT_ADDR_VARIES
6201 malloc_sbrk_unused
= 1<<22; /* A large number */
6202 malloc_sbrk_used
= 100000; /* as reasonable as any number */
6203 #endif /* VIRT_ADDR_VARIES */
6210 byte_stack_list
= 0;
6212 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6213 setjmp_tested_p
= longjmps_done
= 0;
6216 Vgc_elapsed
= make_float (0.0);
6221 syms_of_alloc (void)
6223 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
6224 doc
: /* *Number of bytes of consing between garbage collections.
6225 Garbage collection can happen automatically once this many bytes have been
6226 allocated since the last garbage collection. All data types count.
6228 Garbage collection happens automatically only when `eval' is called.
6230 By binding this temporarily to a large number, you can effectively
6231 prevent garbage collection during a part of the program.
6232 See also `gc-cons-percentage'. */);
6234 DEFVAR_LISP ("gc-cons-percentage", &Vgc_cons_percentage
,
6235 doc
: /* *Portion of the heap used for allocation.
6236 Garbage collection can happen automatically once this portion of the heap
6237 has been allocated since the last garbage collection.
6238 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6239 Vgc_cons_percentage
= make_float (0.1);
6241 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
6242 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6244 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
6245 doc
: /* Number of cons cells that have been consed so far. */);
6247 DEFVAR_INT ("floats-consed", &floats_consed
,
6248 doc
: /* Number of floats that have been consed so far. */);
6250 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
6251 doc
: /* Number of vector cells that have been consed so far. */);
6253 DEFVAR_INT ("symbols-consed", &symbols_consed
,
6254 doc
: /* Number of symbols that have been consed so far. */);
6256 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
6257 doc
: /* Number of string characters that have been consed so far. */);
6259 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
6260 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6262 DEFVAR_INT ("intervals-consed", &intervals_consed
,
6263 doc
: /* Number of intervals that have been consed so far. */);
6265 DEFVAR_INT ("strings-consed", &strings_consed
,
6266 doc
: /* Number of strings that have been consed so far. */);
6268 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
6269 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6270 This means that certain objects should be allocated in shared (pure) space.
6271 It can also be set to a hash-table, in which case this table is used to
6272 do hash-consing of the objects allocated to pure space. */);
6274 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
6275 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6276 garbage_collection_messages
= 0;
6278 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
6279 doc
: /* Hook run after garbage collection has finished. */);
6280 Vpost_gc_hook
= Qnil
;
6281 Qpost_gc_hook
= intern_c_string ("post-gc-hook");
6282 staticpro (&Qpost_gc_hook
);
6284 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
6285 doc
: /* Precomputed `signal' argument for memory-full error. */);
6286 /* We build this in advance because if we wait until we need it, we might
6287 not be able to allocate the memory to hold it. */
6289 = pure_cons (Qerror
,
6290 pure_cons (make_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"), Qnil
));
6292 DEFVAR_LISP ("memory-full", &Vmemory_full
,
6293 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6294 Vmemory_full
= Qnil
;
6296 staticpro (&Qgc_cons_threshold
);
6297 Qgc_cons_threshold
= intern_c_string ("gc-cons-threshold");
6299 staticpro (&Qchar_table_extra_slots
);
6300 Qchar_table_extra_slots
= intern_c_string ("char-table-extra-slots");
6302 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
6303 doc
: /* Accumulated time elapsed in garbage collections.
6304 The time is in seconds as a floating point value. */);
6305 DEFVAR_INT ("gcs-done", &gcs_done
,
6306 doc
: /* Accumulated number of garbage collections done. */);
6311 defsubr (&Smake_byte_code
);
6312 defsubr (&Smake_list
);
6313 defsubr (&Smake_vector
);
6314 defsubr (&Smake_string
);
6315 defsubr (&Smake_bool_vector
);
6316 defsubr (&Smake_symbol
);
6317 defsubr (&Smake_marker
);
6318 defsubr (&Spurecopy
);
6319 defsubr (&Sgarbage_collect
);
6320 defsubr (&Smemory_limit
);
6321 defsubr (&Smemory_use_counts
);
6323 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6324 defsubr (&Sgc_status
);
6328 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
6329 (do not change this comment) */