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. */
27 #include <stddef.h> /* For offsetof, used by PSEUDOVECSIZE. */
36 #ifdef HAVE_GTK_AND_PTHREAD
40 /* This file is part of the core Lisp implementation, and thus must
41 deal with the real data structures. If the Lisp implementation is
42 replaced, this file likely will not be used. */
44 #undef HIDE_LISP_IMPLEMENTATION
47 #include "intervals.h"
53 #include "blockinput.h"
54 #include "character.h"
55 #include "syssignal.h"
56 #include "termhooks.h" /* For struct terminal. */
59 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
60 memory. Can do this only if using gmalloc.c. */
62 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
63 #undef GC_MALLOC_CHECK
69 extern POINTER_TYPE
*sbrk ();
84 #ifdef DOUG_LEA_MALLOC
87 /* malloc.h #defines this as size_t, at least in glibc2. */
88 #ifndef __malloc_size_t
89 #define __malloc_size_t int
92 /* Specify maximum number of areas to mmap. It would be nice to use a
93 value that explicitly means "no limit". */
95 #define MMAP_MAX_AREAS 100000000
97 #else /* not DOUG_LEA_MALLOC */
99 /* The following come from gmalloc.c. */
101 #define __malloc_size_t size_t
102 extern __malloc_size_t _bytes_used
;
103 extern __malloc_size_t __malloc_extra_blocks
;
105 #endif /* not DOUG_LEA_MALLOC */
107 #if ! defined (SYSTEM_MALLOC) && defined (HAVE_GTK_AND_PTHREAD)
109 /* When GTK uses the file chooser dialog, different backends can be loaded
110 dynamically. One such a backend is the Gnome VFS backend that gets loaded
111 if you run Gnome. That backend creates several threads and also allocates
114 If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_*
115 functions below are called from malloc, there is a chance that one
116 of these threads preempts the Emacs main thread and the hook variables
117 end up in an inconsistent state. So we have a mutex to prevent that (note
118 that the backend handles concurrent access to malloc within its own threads
119 but Emacs code running in the main thread is not included in that control).
121 When UNBLOCK_INPUT is called, reinvoke_input_signal may be called. If this
122 happens in one of the backend threads we will have two threads that tries
123 to run Emacs code at once, and the code is not prepared for that.
124 To prevent that, we only call BLOCK/UNBLOCK from the main thread. */
126 static pthread_mutex_t alloc_mutex
;
128 #define BLOCK_INPUT_ALLOC \
131 if (pthread_equal (pthread_self (), main_thread)) \
133 pthread_mutex_lock (&alloc_mutex); \
136 #define UNBLOCK_INPUT_ALLOC \
139 pthread_mutex_unlock (&alloc_mutex); \
140 if (pthread_equal (pthread_self (), main_thread)) \
145 #else /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
147 #define BLOCK_INPUT_ALLOC BLOCK_INPUT
148 #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT
150 #endif /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
152 /* Value of _bytes_used, when spare_memory was freed. */
154 static __malloc_size_t bytes_used_when_full
;
156 static __malloc_size_t bytes_used_when_reconsidered
;
158 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
159 to a struct Lisp_String. */
161 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
162 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
163 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
165 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
166 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
167 #define VECTOR_MARKED_P(V) (((V)->size & ARRAY_MARK_FLAG) != 0)
169 /* Value is the number of bytes/chars of S, a pointer to a struct
170 Lisp_String. This must be used instead of STRING_BYTES (S) or
171 S->size during GC, because S->size contains the mark bit for
174 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
175 #define GC_STRING_CHARS(S) ((S)->size & ~ARRAY_MARK_FLAG)
177 /* Number of bytes of consing done since the last gc. */
179 int consing_since_gc
;
181 /* Count the amount of consing of various sorts of space. */
183 EMACS_INT cons_cells_consed
;
184 EMACS_INT floats_consed
;
185 EMACS_INT vector_cells_consed
;
186 EMACS_INT symbols_consed
;
187 EMACS_INT string_chars_consed
;
188 EMACS_INT misc_objects_consed
;
189 EMACS_INT intervals_consed
;
190 EMACS_INT strings_consed
;
192 /* Minimum number of bytes of consing since GC before next GC. */
194 EMACS_INT gc_cons_threshold
;
196 /* Similar minimum, computed from Vgc_cons_percentage. */
198 EMACS_INT gc_relative_threshold
;
200 static Lisp_Object Vgc_cons_percentage
;
202 /* Minimum number of bytes of consing since GC before next GC,
203 when memory is full. */
205 EMACS_INT memory_full_cons_threshold
;
207 /* Nonzero during GC. */
211 /* Nonzero means abort if try to GC.
212 This is for code which is written on the assumption that
213 no GC will happen, so as to verify that assumption. */
217 /* Nonzero means display messages at beginning and end of GC. */
219 int garbage_collection_messages
;
221 #ifndef VIRT_ADDR_VARIES
223 #endif /* VIRT_ADDR_VARIES */
224 int malloc_sbrk_used
;
226 #ifndef VIRT_ADDR_VARIES
228 #endif /* VIRT_ADDR_VARIES */
229 int malloc_sbrk_unused
;
231 /* Number of live and free conses etc. */
233 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
234 static int total_free_conses
, total_free_markers
, total_free_symbols
;
235 static int total_free_floats
, total_floats
;
237 /* Points to memory space allocated as "spare", to be freed if we run
238 out of memory. We keep one large block, four cons-blocks, and
239 two string blocks. */
241 static char *spare_memory
[7];
243 /* Amount of spare memory to keep in large reserve block. */
245 #define SPARE_MEMORY (1 << 14)
247 /* Number of extra blocks malloc should get when it needs more core. */
249 static int malloc_hysteresis
;
251 /* Non-nil means defun should do purecopy on the function definition. */
253 Lisp_Object Vpurify_flag
;
255 /* Non-nil means we are handling a memory-full error. */
257 Lisp_Object Vmemory_full
;
259 /* Initialize it to a nonzero value to force it into data space
260 (rather than bss space). That way unexec will remap it into text
261 space (pure), on some systems. We have not implemented the
262 remapping on more recent systems because this is less important
263 nowadays than in the days of small memories and timesharing. */
265 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
266 #define PUREBEG (char *) pure
268 /* Pointer to the pure area, and its size. */
270 static char *purebeg
;
271 static size_t pure_size
;
273 /* Number of bytes of pure storage used before pure storage overflowed.
274 If this is non-zero, this implies that an overflow occurred. */
276 static size_t pure_bytes_used_before_overflow
;
278 /* Value is non-zero if P points into pure space. */
280 #define PURE_POINTER_P(P) \
281 (((PNTR_COMPARISON_TYPE) (P) \
282 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
283 && ((PNTR_COMPARISON_TYPE) (P) \
284 >= (PNTR_COMPARISON_TYPE) purebeg))
286 /* Total number of bytes allocated in pure storage. */
288 EMACS_INT pure_bytes_used
;
290 /* Index in pure at which next pure Lisp object will be allocated.. */
292 static EMACS_INT pure_bytes_used_lisp
;
294 /* Number of bytes allocated for non-Lisp objects in pure storage. */
296 static EMACS_INT pure_bytes_used_non_lisp
;
298 /* If nonzero, this is a warning delivered by malloc and not yet
301 char *pending_malloc_warning
;
303 /* Pre-computed signal argument for use when memory is exhausted. */
305 Lisp_Object Vmemory_signal_data
;
307 /* Maximum amount of C stack to save when a GC happens. */
309 #ifndef MAX_SAVE_STACK
310 #define MAX_SAVE_STACK 16000
313 /* Buffer in which we save a copy of the C stack at each GC. */
315 static char *stack_copy
;
316 static int stack_copy_size
;
318 /* Non-zero means ignore malloc warnings. Set during initialization.
319 Currently not used. */
321 static int ignore_warnings
;
323 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
325 /* Hook run after GC has finished. */
327 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
329 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
330 EMACS_INT gcs_done
; /* accumulated GCs */
332 static void mark_buffer (Lisp_Object
);
333 static void mark_terminals (void);
334 extern void mark_kboards (void);
335 extern void mark_ttys (void);
336 extern void mark_backtrace (void);
337 static void gc_sweep (void);
338 static void mark_glyph_matrix (struct glyph_matrix
*);
339 static void mark_face_cache (struct face_cache
*);
341 #ifdef HAVE_WINDOW_SYSTEM
342 extern void mark_fringe_data (void);
343 #endif /* HAVE_WINDOW_SYSTEM */
345 static struct Lisp_String
*allocate_string (void);
346 static void compact_small_strings (void);
347 static void free_large_strings (void);
348 static void sweep_strings (void);
350 extern int message_enable_multibyte
;
352 /* When scanning the C stack for live Lisp objects, Emacs keeps track
353 of what memory allocated via lisp_malloc is intended for what
354 purpose. This enumeration specifies the type of memory. */
365 /* We used to keep separate mem_types for subtypes of vectors such as
366 process, hash_table, frame, terminal, and window, but we never made
367 use of the distinction, so it only caused source-code complexity
368 and runtime slowdown. Minor but pointless. */
372 static POINTER_TYPE
*lisp_align_malloc (size_t, enum mem_type
);
373 static POINTER_TYPE
*lisp_malloc (size_t, enum mem_type
);
374 void refill_memory_reserve (void);
377 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
379 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
380 #include <stdio.h> /* For fprintf. */
383 /* A unique object in pure space used to make some Lisp objects
384 on free lists recognizable in O(1). */
386 static Lisp_Object Vdead
;
388 #ifdef GC_MALLOC_CHECK
390 enum mem_type allocated_mem_type
;
391 static int dont_register_blocks
;
393 #endif /* GC_MALLOC_CHECK */
395 /* A node in the red-black tree describing allocated memory containing
396 Lisp data. Each such block is recorded with its start and end
397 address when it is allocated, and removed from the tree when it
400 A red-black tree is a balanced binary tree with the following
403 1. Every node is either red or black.
404 2. Every leaf is black.
405 3. If a node is red, then both of its children are black.
406 4. Every simple path from a node to a descendant leaf contains
407 the same number of black nodes.
408 5. The root is always black.
410 When nodes are inserted into the tree, or deleted from the tree,
411 the tree is "fixed" so that these properties are always true.
413 A red-black tree with N internal nodes has height at most 2
414 log(N+1). Searches, insertions and deletions are done in O(log N).
415 Please see a text book about data structures for a detailed
416 description of red-black trees. Any book worth its salt should
421 /* Children of this node. These pointers are never NULL. When there
422 is no child, the value is MEM_NIL, which points to a dummy node. */
423 struct mem_node
*left
, *right
;
425 /* The parent of this node. In the root node, this is NULL. */
426 struct mem_node
*parent
;
428 /* Start and end of allocated region. */
432 enum {MEM_BLACK
, MEM_RED
} color
;
438 /* Base address of stack. Set in main. */
440 Lisp_Object
*stack_base
;
442 /* Root of the tree describing allocated Lisp memory. */
444 static struct mem_node
*mem_root
;
446 /* Lowest and highest known address in the heap. */
448 static void *min_heap_address
, *max_heap_address
;
450 /* Sentinel node of the tree. */
452 static struct mem_node mem_z
;
453 #define MEM_NIL &mem_z
455 static POINTER_TYPE
*lisp_malloc (size_t, enum mem_type
);
456 static struct Lisp_Vector
*allocate_vectorlike (EMACS_INT
);
457 static void lisp_free (POINTER_TYPE
*);
458 static void mark_stack (void);
459 static int live_vector_p (struct mem_node
*, void *);
460 static int live_buffer_p (struct mem_node
*, void *);
461 static int live_string_p (struct mem_node
*, void *);
462 static int live_cons_p (struct mem_node
*, void *);
463 static int live_symbol_p (struct mem_node
*, void *);
464 static int live_float_p (struct mem_node
*, void *);
465 static int live_misc_p (struct mem_node
*, void *);
466 static void mark_maybe_object (Lisp_Object
);
467 static void mark_memory (void *, void *, int);
468 static void mem_init (void);
469 static struct mem_node
*mem_insert (void *, void *, enum mem_type
);
470 static void mem_insert_fixup (struct mem_node
*);
471 static void mem_rotate_left (struct mem_node
*);
472 static void mem_rotate_right (struct mem_node
*);
473 static void mem_delete (struct mem_node
*);
474 static void mem_delete_fixup (struct mem_node
*);
475 static INLINE
struct mem_node
*mem_find (void *);
478 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
479 static void check_gcpros (void);
482 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
484 /* Recording what needs to be marked for gc. */
486 struct gcpro
*gcprolist
;
488 /* Addresses of staticpro'd variables. Initialize it to a nonzero
489 value; otherwise some compilers put it into BSS. */
491 #define NSTATICS 0x640
492 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
494 /* Index of next unused slot in staticvec. */
496 static int staticidx
= 0;
498 static POINTER_TYPE
*pure_alloc (size_t, int);
501 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
502 ALIGNMENT must be a power of 2. */
504 #define ALIGN(ptr, ALIGNMENT) \
505 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
506 & ~((ALIGNMENT) - 1)))
510 /************************************************************************
512 ************************************************************************/
514 /* Function malloc calls this if it finds we are near exhausting storage. */
517 malloc_warning (char *str
)
519 pending_malloc_warning
= str
;
523 /* Display an already-pending malloc warning. */
526 display_malloc_warning (void)
528 call3 (intern ("display-warning"),
530 build_string (pending_malloc_warning
),
531 intern ("emergency"));
532 pending_malloc_warning
= 0;
536 #ifdef DOUG_LEA_MALLOC
537 # define BYTES_USED (mallinfo ().uordblks)
539 # define BYTES_USED _bytes_used
542 /* Called if we can't allocate relocatable space for a buffer. */
545 buffer_memory_full (void)
547 /* If buffers use the relocating allocator, no need to free
548 spare_memory, because we may have plenty of malloc space left
549 that we could get, and if we don't, the malloc that fails will
550 itself cause spare_memory to be freed. If buffers don't use the
551 relocating allocator, treat this like any other failing
558 /* This used to call error, but if we've run out of memory, we could
559 get infinite recursion trying to build the string. */
560 xsignal (Qnil
, Vmemory_signal_data
);
564 #ifdef XMALLOC_OVERRUN_CHECK
566 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
567 and a 16 byte trailer around each block.
569 The header consists of 12 fixed bytes + a 4 byte integer contaning the
570 original block size, while the trailer consists of 16 fixed bytes.
572 The header is used to detect whether this block has been allocated
573 through these functions -- as it seems that some low-level libc
574 functions may bypass the malloc hooks.
578 #define XMALLOC_OVERRUN_CHECK_SIZE 16
580 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
581 { 0x9a, 0x9b, 0xae, 0xaf,
582 0xbf, 0xbe, 0xce, 0xcf,
583 0xea, 0xeb, 0xec, 0xed };
585 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
586 { 0xaa, 0xab, 0xac, 0xad,
587 0xba, 0xbb, 0xbc, 0xbd,
588 0xca, 0xcb, 0xcc, 0xcd,
589 0xda, 0xdb, 0xdc, 0xdd };
591 /* Macros to insert and extract the block size in the header. */
593 #define XMALLOC_PUT_SIZE(ptr, size) \
594 (ptr[-1] = (size & 0xff), \
595 ptr[-2] = ((size >> 8) & 0xff), \
596 ptr[-3] = ((size >> 16) & 0xff), \
597 ptr[-4] = ((size >> 24) & 0xff))
599 #define XMALLOC_GET_SIZE(ptr) \
600 (size_t)((unsigned)(ptr[-1]) | \
601 ((unsigned)(ptr[-2]) << 8) | \
602 ((unsigned)(ptr[-3]) << 16) | \
603 ((unsigned)(ptr[-4]) << 24))
606 /* The call depth in overrun_check functions. For example, this might happen:
608 overrun_check_malloc()
609 -> malloc -> (via hook)_-> emacs_blocked_malloc
610 -> overrun_check_malloc
611 call malloc (hooks are NULL, so real malloc is called).
612 malloc returns 10000.
613 add overhead, return 10016.
614 <- (back in overrun_check_malloc)
615 add overhead again, return 10032
616 xmalloc returns 10032.
621 overrun_check_free(10032)
623 free(10016) <- crash, because 10000 is the original pointer. */
625 static int check_depth
;
627 /* Like malloc, but wraps allocated block with header and trailer. */
630 overrun_check_malloc (size
)
633 register unsigned char *val
;
634 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
636 val
= (unsigned char *) malloc (size
+ overhead
);
637 if (val
&& check_depth
== 1)
639 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
640 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
641 XMALLOC_PUT_SIZE(val
, size
);
642 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
645 return (POINTER_TYPE
*)val
;
649 /* Like realloc, but checks old block for overrun, and wraps new block
650 with header and trailer. */
653 overrun_check_realloc (block
, size
)
657 register unsigned char *val
= (unsigned char *)block
;
658 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
662 && bcmp (xmalloc_overrun_check_header
,
663 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
664 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
666 size_t osize
= XMALLOC_GET_SIZE (val
);
667 if (bcmp (xmalloc_overrun_check_trailer
,
669 XMALLOC_OVERRUN_CHECK_SIZE
))
671 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
672 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
673 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
676 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
678 if (val
&& check_depth
== 1)
680 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
681 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
682 XMALLOC_PUT_SIZE(val
, size
);
683 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
686 return (POINTER_TYPE
*)val
;
689 /* Like free, but checks block for overrun. */
692 overrun_check_free (block
)
695 unsigned char *val
= (unsigned char *)block
;
700 && bcmp (xmalloc_overrun_check_header
,
701 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
702 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
704 size_t osize
= XMALLOC_GET_SIZE (val
);
705 if (bcmp (xmalloc_overrun_check_trailer
,
707 XMALLOC_OVERRUN_CHECK_SIZE
))
709 #ifdef XMALLOC_CLEAR_FREE_MEMORY
710 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
711 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
713 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
714 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
715 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
726 #define malloc overrun_check_malloc
727 #define realloc overrun_check_realloc
728 #define free overrun_check_free
732 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
733 there's no need to block input around malloc. */
734 #define MALLOC_BLOCK_INPUT ((void)0)
735 #define MALLOC_UNBLOCK_INPUT ((void)0)
737 #define MALLOC_BLOCK_INPUT BLOCK_INPUT
738 #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT
741 /* Like malloc but check for no memory and block interrupt input.. */
744 xmalloc (size_t size
)
746 register POINTER_TYPE
*val
;
749 val
= (POINTER_TYPE
*) malloc (size
);
750 MALLOC_UNBLOCK_INPUT
;
758 /* Like realloc but check for no memory and block interrupt input.. */
761 xrealloc (POINTER_TYPE
*block
, size_t size
)
763 register POINTER_TYPE
*val
;
766 /* We must call malloc explicitly when BLOCK is 0, since some
767 reallocs don't do this. */
769 val
= (POINTER_TYPE
*) malloc (size
);
771 val
= (POINTER_TYPE
*) realloc (block
, size
);
772 MALLOC_UNBLOCK_INPUT
;
774 if (!val
&& size
) memory_full ();
779 /* Like free but block interrupt input. */
782 xfree (POINTER_TYPE
*block
)
788 MALLOC_UNBLOCK_INPUT
;
789 /* We don't call refill_memory_reserve here
790 because that duplicates doing so in emacs_blocked_free
791 and the criterion should go there. */
795 /* Like strdup, but uses xmalloc. */
798 xstrdup (const char *s
)
800 size_t len
= strlen (s
) + 1;
801 char *p
= (char *) xmalloc (len
);
807 /* Unwind for SAFE_ALLOCA */
810 safe_alloca_unwind (Lisp_Object arg
)
812 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
822 /* Like malloc but used for allocating Lisp data. NBYTES is the
823 number of bytes to allocate, TYPE describes the intended use of the
824 allcated memory block (for strings, for conses, ...). */
827 static void *lisp_malloc_loser
;
830 static POINTER_TYPE
*
831 lisp_malloc (size_t nbytes
, enum mem_type type
)
837 #ifdef GC_MALLOC_CHECK
838 allocated_mem_type
= type
;
841 val
= (void *) malloc (nbytes
);
844 /* If the memory just allocated cannot be addressed thru a Lisp
845 object's pointer, and it needs to be,
846 that's equivalent to running out of memory. */
847 if (val
&& type
!= MEM_TYPE_NON_LISP
)
850 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
851 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
853 lisp_malloc_loser
= val
;
860 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
861 if (val
&& type
!= MEM_TYPE_NON_LISP
)
862 mem_insert (val
, (char *) val
+ nbytes
, type
);
865 MALLOC_UNBLOCK_INPUT
;
871 /* Free BLOCK. This must be called to free memory allocated with a
872 call to lisp_malloc. */
875 lisp_free (POINTER_TYPE
*block
)
879 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
880 mem_delete (mem_find (block
));
882 MALLOC_UNBLOCK_INPUT
;
885 /* Allocation of aligned blocks of memory to store Lisp data. */
886 /* The entry point is lisp_align_malloc which returns blocks of at most */
887 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
889 /* Use posix_memalloc if the system has it and we're using the system's
890 malloc (because our gmalloc.c routines don't have posix_memalign although
891 its memalloc could be used). */
892 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
893 #define USE_POSIX_MEMALIGN 1
896 /* BLOCK_ALIGN has to be a power of 2. */
897 #define BLOCK_ALIGN (1 << 10)
899 /* Padding to leave at the end of a malloc'd block. This is to give
900 malloc a chance to minimize the amount of memory wasted to alignment.
901 It should be tuned to the particular malloc library used.
902 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
903 posix_memalign on the other hand would ideally prefer a value of 4
904 because otherwise, there's 1020 bytes wasted between each ablocks.
905 In Emacs, testing shows that those 1020 can most of the time be
906 efficiently used by malloc to place other objects, so a value of 0 can
907 still preferable unless you have a lot of aligned blocks and virtually
909 #define BLOCK_PADDING 0
910 #define BLOCK_BYTES \
911 (BLOCK_ALIGN - sizeof (struct ablock *) - BLOCK_PADDING)
913 /* Internal data structures and constants. */
915 #define ABLOCKS_SIZE 16
917 /* An aligned block of memory. */
922 char payload
[BLOCK_BYTES
];
923 struct ablock
*next_free
;
925 /* `abase' is the aligned base of the ablocks. */
926 /* It is overloaded to hold the virtual `busy' field that counts
927 the number of used ablock in the parent ablocks.
928 The first ablock has the `busy' field, the others have the `abase'
929 field. To tell the difference, we assume that pointers will have
930 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
931 is used to tell whether the real base of the parent ablocks is `abase'
932 (if not, the word before the first ablock holds a pointer to the
934 struct ablocks
*abase
;
935 /* The padding of all but the last ablock is unused. The padding of
936 the last ablock in an ablocks is not allocated. */
938 char padding
[BLOCK_PADDING
];
942 /* A bunch of consecutive aligned blocks. */
945 struct ablock blocks
[ABLOCKS_SIZE
];
948 /* Size of the block requested from malloc or memalign. */
949 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
951 #define ABLOCK_ABASE(block) \
952 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
953 ? (struct ablocks *)(block) \
956 /* Virtual `busy' field. */
957 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
959 /* Pointer to the (not necessarily aligned) malloc block. */
960 #ifdef USE_POSIX_MEMALIGN
961 #define ABLOCKS_BASE(abase) (abase)
963 #define ABLOCKS_BASE(abase) \
964 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
967 /* The list of free ablock. */
968 static struct ablock
*free_ablock
;
970 /* Allocate an aligned block of nbytes.
971 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
972 smaller or equal to BLOCK_BYTES. */
973 static POINTER_TYPE
*
974 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
977 struct ablocks
*abase
;
979 eassert (nbytes
<= BLOCK_BYTES
);
983 #ifdef GC_MALLOC_CHECK
984 allocated_mem_type
= type
;
990 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
992 #ifdef DOUG_LEA_MALLOC
993 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
994 because mapped region contents are not preserved in
996 mallopt (M_MMAP_MAX
, 0);
999 #ifdef USE_POSIX_MEMALIGN
1001 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1007 base
= malloc (ABLOCKS_BYTES
);
1008 abase
= ALIGN (base
, BLOCK_ALIGN
);
1013 MALLOC_UNBLOCK_INPUT
;
1017 aligned
= (base
== abase
);
1019 ((void**)abase
)[-1] = base
;
1021 #ifdef DOUG_LEA_MALLOC
1022 /* Back to a reasonable maximum of mmap'ed areas. */
1023 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1027 /* If the memory just allocated cannot be addressed thru a Lisp
1028 object's pointer, and it needs to be, that's equivalent to
1029 running out of memory. */
1030 if (type
!= MEM_TYPE_NON_LISP
)
1033 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1034 XSETCONS (tem
, end
);
1035 if ((char *) XCONS (tem
) != end
)
1037 lisp_malloc_loser
= base
;
1039 MALLOC_UNBLOCK_INPUT
;
1045 /* Initialize the blocks and put them on the free list.
1046 Is `base' was not properly aligned, we can't use the last block. */
1047 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1049 abase
->blocks
[i
].abase
= abase
;
1050 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1051 free_ablock
= &abase
->blocks
[i
];
1053 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
1055 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
1056 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1057 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1058 eassert (ABLOCKS_BASE (abase
) == base
);
1059 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
1062 abase
= ABLOCK_ABASE (free_ablock
);
1063 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
1065 free_ablock
= free_ablock
->x
.next_free
;
1067 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1068 if (val
&& type
!= MEM_TYPE_NON_LISP
)
1069 mem_insert (val
, (char *) val
+ nbytes
, type
);
1072 MALLOC_UNBLOCK_INPUT
;
1076 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
1081 lisp_align_free (POINTER_TYPE
*block
)
1083 struct ablock
*ablock
= block
;
1084 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1087 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1088 mem_delete (mem_find (block
));
1090 /* Put on free list. */
1091 ablock
->x
.next_free
= free_ablock
;
1092 free_ablock
= ablock
;
1093 /* Update busy count. */
1094 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
1096 if (2 > (long) ABLOCKS_BUSY (abase
))
1097 { /* All the blocks are free. */
1098 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
1099 struct ablock
**tem
= &free_ablock
;
1100 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1104 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1107 *tem
= (*tem
)->x
.next_free
;
1110 tem
= &(*tem
)->x
.next_free
;
1112 eassert ((aligned
& 1) == aligned
);
1113 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1114 #ifdef USE_POSIX_MEMALIGN
1115 eassert ((unsigned long)ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1117 free (ABLOCKS_BASE (abase
));
1119 MALLOC_UNBLOCK_INPUT
;
1122 /* Return a new buffer structure allocated from the heap with
1123 a call to lisp_malloc. */
1126 allocate_buffer (void)
1129 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1131 b
->size
= sizeof (struct buffer
) / sizeof (EMACS_INT
);
1132 XSETPVECTYPE (b
, PVEC_BUFFER
);
1137 #ifndef SYSTEM_MALLOC
1139 /* Arranging to disable input signals while we're in malloc.
1141 This only works with GNU malloc. To help out systems which can't
1142 use GNU malloc, all the calls to malloc, realloc, and free
1143 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1144 pair; unfortunately, we have no idea what C library functions
1145 might call malloc, so we can't really protect them unless you're
1146 using GNU malloc. Fortunately, most of the major operating systems
1147 can use GNU malloc. */
1150 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
1151 there's no need to block input around malloc. */
1153 #ifndef DOUG_LEA_MALLOC
1154 extern void * (*__malloc_hook
) (size_t, const void *);
1155 extern void * (*__realloc_hook
) (void *, size_t, const void *);
1156 extern void (*__free_hook
) (void *, const void *);
1157 /* Else declared in malloc.h, perhaps with an extra arg. */
1158 #endif /* DOUG_LEA_MALLOC */
1159 static void * (*old_malloc_hook
) (size_t, const void *);
1160 static void * (*old_realloc_hook
) (void *, size_t, const void*);
1161 static void (*old_free_hook
) (void*, const void*);
1163 /* This function is used as the hook for free to call. */
1166 emacs_blocked_free (ptr
, ptr2
)
1172 #ifdef GC_MALLOC_CHECK
1178 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1181 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1186 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1190 #endif /* GC_MALLOC_CHECK */
1192 __free_hook
= old_free_hook
;
1195 /* If we released our reserve (due to running out of memory),
1196 and we have a fair amount free once again,
1197 try to set aside another reserve in case we run out once more. */
1198 if (! NILP (Vmemory_full
)
1199 /* Verify there is enough space that even with the malloc
1200 hysteresis this call won't run out again.
1201 The code here is correct as long as SPARE_MEMORY
1202 is substantially larger than the block size malloc uses. */
1203 && (bytes_used_when_full
1204 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1205 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1206 refill_memory_reserve ();
1208 __free_hook
= emacs_blocked_free
;
1209 UNBLOCK_INPUT_ALLOC
;
1213 /* This function is the malloc hook that Emacs uses. */
1216 emacs_blocked_malloc (size
, ptr
)
1223 __malloc_hook
= old_malloc_hook
;
1224 #ifdef DOUG_LEA_MALLOC
1225 /* Segfaults on my system. --lorentey */
1226 /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */
1228 __malloc_extra_blocks
= malloc_hysteresis
;
1231 value
= (void *) malloc (size
);
1233 #ifdef GC_MALLOC_CHECK
1235 struct mem_node
*m
= mem_find (value
);
1238 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1240 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1241 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1246 if (!dont_register_blocks
)
1248 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1249 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1252 #endif /* GC_MALLOC_CHECK */
1254 __malloc_hook
= emacs_blocked_malloc
;
1255 UNBLOCK_INPUT_ALLOC
;
1257 /* fprintf (stderr, "%p malloc\n", value); */
1262 /* This function is the realloc hook that Emacs uses. */
1265 emacs_blocked_realloc (ptr
, size
, ptr2
)
1273 __realloc_hook
= old_realloc_hook
;
1275 #ifdef GC_MALLOC_CHECK
1278 struct mem_node
*m
= mem_find (ptr
);
1279 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1282 "Realloc of %p which wasn't allocated with malloc\n",
1290 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1292 /* Prevent malloc from registering blocks. */
1293 dont_register_blocks
= 1;
1294 #endif /* GC_MALLOC_CHECK */
1296 value
= (void *) realloc (ptr
, size
);
1298 #ifdef GC_MALLOC_CHECK
1299 dont_register_blocks
= 0;
1302 struct mem_node
*m
= mem_find (value
);
1305 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1309 /* Can't handle zero size regions in the red-black tree. */
1310 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1313 /* fprintf (stderr, "%p <- realloc\n", value); */
1314 #endif /* GC_MALLOC_CHECK */
1316 __realloc_hook
= emacs_blocked_realloc
;
1317 UNBLOCK_INPUT_ALLOC
;
1323 #ifdef HAVE_GTK_AND_PTHREAD
1324 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1325 normal malloc. Some thread implementations need this as they call
1326 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1327 calls malloc because it is the first call, and we have an endless loop. */
1330 reset_malloc_hooks ()
1332 __free_hook
= old_free_hook
;
1333 __malloc_hook
= old_malloc_hook
;
1334 __realloc_hook
= old_realloc_hook
;
1336 #endif /* HAVE_GTK_AND_PTHREAD */
1339 /* Called from main to set up malloc to use our hooks. */
1342 uninterrupt_malloc ()
1344 #ifdef HAVE_GTK_AND_PTHREAD
1345 #ifdef DOUG_LEA_MALLOC
1346 pthread_mutexattr_t attr
;
1348 /* GLIBC has a faster way to do this, but lets keep it portable.
1349 This is according to the Single UNIX Specification. */
1350 pthread_mutexattr_init (&attr
);
1351 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1352 pthread_mutex_init (&alloc_mutex
, &attr
);
1353 #else /* !DOUG_LEA_MALLOC */
1354 /* Some systems such as Solaris 2.6 don't have a recursive mutex,
1355 and the bundled gmalloc.c doesn't require it. */
1356 pthread_mutex_init (&alloc_mutex
, NULL
);
1357 #endif /* !DOUG_LEA_MALLOC */
1358 #endif /* HAVE_GTK_AND_PTHREAD */
1360 if (__free_hook
!= emacs_blocked_free
)
1361 old_free_hook
= __free_hook
;
1362 __free_hook
= emacs_blocked_free
;
1364 if (__malloc_hook
!= emacs_blocked_malloc
)
1365 old_malloc_hook
= __malloc_hook
;
1366 __malloc_hook
= emacs_blocked_malloc
;
1368 if (__realloc_hook
!= emacs_blocked_realloc
)
1369 old_realloc_hook
= __realloc_hook
;
1370 __realloc_hook
= emacs_blocked_realloc
;
1373 #endif /* not SYNC_INPUT */
1374 #endif /* not SYSTEM_MALLOC */
1378 /***********************************************************************
1380 ***********************************************************************/
1382 /* Number of intervals allocated in an interval_block structure.
1383 The 1020 is 1024 minus malloc overhead. */
1385 #define INTERVAL_BLOCK_SIZE \
1386 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1388 /* Intervals are allocated in chunks in form of an interval_block
1391 struct interval_block
1393 /* Place `intervals' first, to preserve alignment. */
1394 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1395 struct interval_block
*next
;
1398 /* Current interval block. Its `next' pointer points to older
1401 static struct interval_block
*interval_block
;
1403 /* Index in interval_block above of the next unused interval
1406 static int interval_block_index
;
1408 /* Number of free and live intervals. */
1410 static int total_free_intervals
, total_intervals
;
1412 /* List of free intervals. */
1414 INTERVAL interval_free_list
;
1416 /* Total number of interval blocks now in use. */
1418 static int n_interval_blocks
;
1421 /* Initialize interval allocation. */
1424 init_intervals (void)
1426 interval_block
= NULL
;
1427 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1428 interval_free_list
= 0;
1429 n_interval_blocks
= 0;
1433 /* Return a new interval. */
1436 make_interval (void)
1440 /* eassert (!handling_signal); */
1444 if (interval_free_list
)
1446 val
= interval_free_list
;
1447 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1451 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1453 register struct interval_block
*newi
;
1455 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1458 newi
->next
= interval_block
;
1459 interval_block
= newi
;
1460 interval_block_index
= 0;
1461 n_interval_blocks
++;
1463 val
= &interval_block
->intervals
[interval_block_index
++];
1466 MALLOC_UNBLOCK_INPUT
;
1468 consing_since_gc
+= sizeof (struct interval
);
1470 RESET_INTERVAL (val
);
1476 /* Mark Lisp objects in interval I. */
1479 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1481 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1483 mark_object (i
->plist
);
1487 /* Mark the interval tree rooted in TREE. Don't call this directly;
1488 use the macro MARK_INTERVAL_TREE instead. */
1491 mark_interval_tree (register INTERVAL tree
)
1493 /* No need to test if this tree has been marked already; this
1494 function is always called through the MARK_INTERVAL_TREE macro,
1495 which takes care of that. */
1497 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1501 /* Mark the interval tree rooted in I. */
1503 #define MARK_INTERVAL_TREE(i) \
1505 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1506 mark_interval_tree (i); \
1510 #define UNMARK_BALANCE_INTERVALS(i) \
1512 if (! NULL_INTERVAL_P (i)) \
1513 (i) = balance_intervals (i); \
1517 /* Number support. If USE_LISP_UNION_TYPE is in effect, we
1518 can't create number objects in macros. */
1526 obj
.s
.type
= Lisp_Int
;
1531 /***********************************************************************
1533 ***********************************************************************/
1535 /* Lisp_Strings are allocated in string_block structures. When a new
1536 string_block is allocated, all the Lisp_Strings it contains are
1537 added to a free-list string_free_list. When a new Lisp_String is
1538 needed, it is taken from that list. During the sweep phase of GC,
1539 string_blocks that are entirely free are freed, except two which
1542 String data is allocated from sblock structures. Strings larger
1543 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1544 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1546 Sblocks consist internally of sdata structures, one for each
1547 Lisp_String. The sdata structure points to the Lisp_String it
1548 belongs to. The Lisp_String points back to the `u.data' member of
1549 its sdata structure.
1551 When a Lisp_String is freed during GC, it is put back on
1552 string_free_list, and its `data' member and its sdata's `string'
1553 pointer is set to null. The size of the string is recorded in the
1554 `u.nbytes' member of the sdata. So, sdata structures that are no
1555 longer used, can be easily recognized, and it's easy to compact the
1556 sblocks of small strings which we do in compact_small_strings. */
1558 /* Size in bytes of an sblock structure used for small strings. This
1559 is 8192 minus malloc overhead. */
1561 #define SBLOCK_SIZE 8188
1563 /* Strings larger than this are considered large strings. String data
1564 for large strings is allocated from individual sblocks. */
1566 #define LARGE_STRING_BYTES 1024
1568 /* Structure describing string memory sub-allocated from an sblock.
1569 This is where the contents of Lisp strings are stored. */
1573 /* Back-pointer to the string this sdata belongs to. If null, this
1574 structure is free, and the NBYTES member of the union below
1575 contains the string's byte size (the same value that STRING_BYTES
1576 would return if STRING were non-null). If non-null, STRING_BYTES
1577 (STRING) is the size of the data, and DATA contains the string's
1579 struct Lisp_String
*string
;
1581 #ifdef GC_CHECK_STRING_BYTES
1584 unsigned char data
[1];
1586 #define SDATA_NBYTES(S) (S)->nbytes
1587 #define SDATA_DATA(S) (S)->data
1589 #else /* not GC_CHECK_STRING_BYTES */
1593 /* When STRING in non-null. */
1594 unsigned char data
[1];
1596 /* When STRING is null. */
1601 #define SDATA_NBYTES(S) (S)->u.nbytes
1602 #define SDATA_DATA(S) (S)->u.data
1604 #endif /* not GC_CHECK_STRING_BYTES */
1608 /* Structure describing a block of memory which is sub-allocated to
1609 obtain string data memory for strings. Blocks for small strings
1610 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1611 as large as needed. */
1616 struct sblock
*next
;
1618 /* Pointer to the next free sdata block. This points past the end
1619 of the sblock if there isn't any space left in this block. */
1620 struct sdata
*next_free
;
1622 /* Start of data. */
1623 struct sdata first_data
;
1626 /* Number of Lisp strings in a string_block structure. The 1020 is
1627 1024 minus malloc overhead. */
1629 #define STRING_BLOCK_SIZE \
1630 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1632 /* Structure describing a block from which Lisp_String structures
1637 /* Place `strings' first, to preserve alignment. */
1638 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1639 struct string_block
*next
;
1642 /* Head and tail of the list of sblock structures holding Lisp string
1643 data. We always allocate from current_sblock. The NEXT pointers
1644 in the sblock structures go from oldest_sblock to current_sblock. */
1646 static struct sblock
*oldest_sblock
, *current_sblock
;
1648 /* List of sblocks for large strings. */
1650 static struct sblock
*large_sblocks
;
1652 /* List of string_block structures, and how many there are. */
1654 static struct string_block
*string_blocks
;
1655 static int n_string_blocks
;
1657 /* Free-list of Lisp_Strings. */
1659 static struct Lisp_String
*string_free_list
;
1661 /* Number of live and free Lisp_Strings. */
1663 static int total_strings
, total_free_strings
;
1665 /* Number of bytes used by live strings. */
1667 static int total_string_size
;
1669 /* Given a pointer to a Lisp_String S which is on the free-list
1670 string_free_list, return a pointer to its successor in the
1673 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1675 /* Return a pointer to the sdata structure belonging to Lisp string S.
1676 S must be live, i.e. S->data must not be null. S->data is actually
1677 a pointer to the `u.data' member of its sdata structure; the
1678 structure starts at a constant offset in front of that. */
1680 #ifdef GC_CHECK_STRING_BYTES
1682 #define SDATA_OF_STRING(S) \
1683 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1684 - sizeof (EMACS_INT)))
1686 #else /* not GC_CHECK_STRING_BYTES */
1688 #define SDATA_OF_STRING(S) \
1689 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1691 #endif /* not GC_CHECK_STRING_BYTES */
1694 #ifdef GC_CHECK_STRING_OVERRUN
1696 /* We check for overrun in string data blocks by appending a small
1697 "cookie" after each allocated string data block, and check for the
1698 presence of this cookie during GC. */
1700 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1701 static char string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1702 { 0xde, 0xad, 0xbe, 0xef };
1705 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1708 /* Value is the size of an sdata structure large enough to hold NBYTES
1709 bytes of string data. The value returned includes a terminating
1710 NUL byte, the size of the sdata structure, and padding. */
1712 #ifdef GC_CHECK_STRING_BYTES
1714 #define SDATA_SIZE(NBYTES) \
1715 ((sizeof (struct Lisp_String *) \
1717 + sizeof (EMACS_INT) \
1718 + sizeof (EMACS_INT) - 1) \
1719 & ~(sizeof (EMACS_INT) - 1))
1721 #else /* not GC_CHECK_STRING_BYTES */
1723 #define SDATA_SIZE(NBYTES) \
1724 ((sizeof (struct Lisp_String *) \
1726 + sizeof (EMACS_INT) - 1) \
1727 & ~(sizeof (EMACS_INT) - 1))
1729 #endif /* not GC_CHECK_STRING_BYTES */
1731 /* Extra bytes to allocate for each string. */
1733 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1735 /* Initialize string allocation. Called from init_alloc_once. */
1740 total_strings
= total_free_strings
= total_string_size
= 0;
1741 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1742 string_blocks
= NULL
;
1743 n_string_blocks
= 0;
1744 string_free_list
= NULL
;
1745 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1746 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1750 #ifdef GC_CHECK_STRING_BYTES
1752 static int check_string_bytes_count
;
1754 static void check_string_bytes (int);
1755 static void check_sblock (struct sblock
*);
1757 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1760 /* Like GC_STRING_BYTES, but with debugging check. */
1764 struct Lisp_String
*s
;
1766 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1767 if (!PURE_POINTER_P (s
)
1769 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1774 /* Check validity of Lisp strings' string_bytes member in B. */
1780 struct sdata
*from
, *end
, *from_end
;
1784 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1786 /* Compute the next FROM here because copying below may
1787 overwrite data we need to compute it. */
1790 /* Check that the string size recorded in the string is the
1791 same as the one recorded in the sdata structure. */
1793 CHECK_STRING_BYTES (from
->string
);
1796 nbytes
= GC_STRING_BYTES (from
->string
);
1798 nbytes
= SDATA_NBYTES (from
);
1800 nbytes
= SDATA_SIZE (nbytes
);
1801 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1806 /* Check validity of Lisp strings' string_bytes member. ALL_P
1807 non-zero means check all strings, otherwise check only most
1808 recently allocated strings. Used for hunting a bug. */
1811 check_string_bytes (all_p
)
1818 for (b
= large_sblocks
; b
; b
= b
->next
)
1820 struct Lisp_String
*s
= b
->first_data
.string
;
1822 CHECK_STRING_BYTES (s
);
1825 for (b
= oldest_sblock
; b
; b
= b
->next
)
1829 check_sblock (current_sblock
);
1832 #endif /* GC_CHECK_STRING_BYTES */
1834 #ifdef GC_CHECK_STRING_FREE_LIST
1836 /* Walk through the string free list looking for bogus next pointers.
1837 This may catch buffer overrun from a previous string. */
1840 check_string_free_list ()
1842 struct Lisp_String
*s
;
1844 /* Pop a Lisp_String off the free-list. */
1845 s
= string_free_list
;
1848 if ((unsigned)s
< 1024)
1850 s
= NEXT_FREE_LISP_STRING (s
);
1854 #define check_string_free_list()
1857 /* Return a new Lisp_String. */
1859 static struct Lisp_String
*
1860 allocate_string (void)
1862 struct Lisp_String
*s
;
1864 /* eassert (!handling_signal); */
1868 /* If the free-list is empty, allocate a new string_block, and
1869 add all the Lisp_Strings in it to the free-list. */
1870 if (string_free_list
== NULL
)
1872 struct string_block
*b
;
1875 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1876 bzero (b
, sizeof *b
);
1877 b
->next
= string_blocks
;
1881 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1884 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1885 string_free_list
= s
;
1888 total_free_strings
+= STRING_BLOCK_SIZE
;
1891 check_string_free_list ();
1893 /* Pop a Lisp_String off the free-list. */
1894 s
= string_free_list
;
1895 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1897 MALLOC_UNBLOCK_INPUT
;
1899 /* Probably not strictly necessary, but play it safe. */
1900 bzero (s
, sizeof *s
);
1902 --total_free_strings
;
1905 consing_since_gc
+= sizeof *s
;
1907 #ifdef GC_CHECK_STRING_BYTES
1908 if (!noninteractive
)
1910 if (++check_string_bytes_count
== 200)
1912 check_string_bytes_count
= 0;
1913 check_string_bytes (1);
1916 check_string_bytes (0);
1918 #endif /* GC_CHECK_STRING_BYTES */
1924 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1925 plus a NUL byte at the end. Allocate an sdata structure for S, and
1926 set S->data to its `u.data' member. Store a NUL byte at the end of
1927 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1928 S->data if it was initially non-null. */
1931 allocate_string_data (struct Lisp_String
*s
, int nchars
, int nbytes
)
1933 struct sdata
*data
, *old_data
;
1935 int needed
, old_nbytes
;
1937 /* Determine the number of bytes needed to store NBYTES bytes
1939 needed
= SDATA_SIZE (nbytes
);
1940 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1941 old_nbytes
= GC_STRING_BYTES (s
);
1945 if (nbytes
> LARGE_STRING_BYTES
)
1947 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1949 #ifdef DOUG_LEA_MALLOC
1950 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1951 because mapped region contents are not preserved in
1954 In case you think of allowing it in a dumped Emacs at the
1955 cost of not being able to re-dump, there's another reason:
1956 mmap'ed data typically have an address towards the top of the
1957 address space, which won't fit into an EMACS_INT (at least on
1958 32-bit systems with the current tagging scheme). --fx */
1959 mallopt (M_MMAP_MAX
, 0);
1962 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1964 #ifdef DOUG_LEA_MALLOC
1965 /* Back to a reasonable maximum of mmap'ed areas. */
1966 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1969 b
->next_free
= &b
->first_data
;
1970 b
->first_data
.string
= NULL
;
1971 b
->next
= large_sblocks
;
1974 else if (current_sblock
== NULL
1975 || (((char *) current_sblock
+ SBLOCK_SIZE
1976 - (char *) current_sblock
->next_free
)
1977 < (needed
+ GC_STRING_EXTRA
)))
1979 /* Not enough room in the current sblock. */
1980 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1981 b
->next_free
= &b
->first_data
;
1982 b
->first_data
.string
= NULL
;
1986 current_sblock
->next
= b
;
1994 data
= b
->next_free
;
1995 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
1997 MALLOC_UNBLOCK_INPUT
;
2000 s
->data
= SDATA_DATA (data
);
2001 #ifdef GC_CHECK_STRING_BYTES
2002 SDATA_NBYTES (data
) = nbytes
;
2005 s
->size_byte
= nbytes
;
2006 s
->data
[nbytes
] = '\0';
2007 #ifdef GC_CHECK_STRING_OVERRUN
2008 bcopy (string_overrun_cookie
, (char *) data
+ needed
,
2009 GC_STRING_OVERRUN_COOKIE_SIZE
);
2012 /* If S had already data assigned, mark that as free by setting its
2013 string back-pointer to null, and recording the size of the data
2017 SDATA_NBYTES (old_data
) = old_nbytes
;
2018 old_data
->string
= NULL
;
2021 consing_since_gc
+= needed
;
2025 /* Sweep and compact strings. */
2028 sweep_strings (void)
2030 struct string_block
*b
, *next
;
2031 struct string_block
*live_blocks
= NULL
;
2033 string_free_list
= NULL
;
2034 total_strings
= total_free_strings
= 0;
2035 total_string_size
= 0;
2037 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2038 for (b
= string_blocks
; b
; b
= next
)
2041 struct Lisp_String
*free_list_before
= string_free_list
;
2045 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2047 struct Lisp_String
*s
= b
->strings
+ i
;
2051 /* String was not on free-list before. */
2052 if (STRING_MARKED_P (s
))
2054 /* String is live; unmark it and its intervals. */
2057 if (!NULL_INTERVAL_P (s
->intervals
))
2058 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2061 total_string_size
+= STRING_BYTES (s
);
2065 /* String is dead. Put it on the free-list. */
2066 struct sdata
*data
= SDATA_OF_STRING (s
);
2068 /* Save the size of S in its sdata so that we know
2069 how large that is. Reset the sdata's string
2070 back-pointer so that we know it's free. */
2071 #ifdef GC_CHECK_STRING_BYTES
2072 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2075 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2077 data
->string
= NULL
;
2079 /* Reset the strings's `data' member so that we
2083 /* Put the string on the free-list. */
2084 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2085 string_free_list
= s
;
2091 /* S was on the free-list before. Put it there again. */
2092 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2093 string_free_list
= s
;
2098 /* Free blocks that contain free Lisp_Strings only, except
2099 the first two of them. */
2100 if (nfree
== STRING_BLOCK_SIZE
2101 && total_free_strings
> STRING_BLOCK_SIZE
)
2105 string_free_list
= free_list_before
;
2109 total_free_strings
+= nfree
;
2110 b
->next
= live_blocks
;
2115 check_string_free_list ();
2117 string_blocks
= live_blocks
;
2118 free_large_strings ();
2119 compact_small_strings ();
2121 check_string_free_list ();
2125 /* Free dead large strings. */
2128 free_large_strings (void)
2130 struct sblock
*b
, *next
;
2131 struct sblock
*live_blocks
= NULL
;
2133 for (b
= large_sblocks
; b
; b
= next
)
2137 if (b
->first_data
.string
== NULL
)
2141 b
->next
= live_blocks
;
2146 large_sblocks
= live_blocks
;
2150 /* Compact data of small strings. Free sblocks that don't contain
2151 data of live strings after compaction. */
2154 compact_small_strings (void)
2156 struct sblock
*b
, *tb
, *next
;
2157 struct sdata
*from
, *to
, *end
, *tb_end
;
2158 struct sdata
*to_end
, *from_end
;
2160 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2161 to, and TB_END is the end of TB. */
2163 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2164 to
= &tb
->first_data
;
2166 /* Step through the blocks from the oldest to the youngest. We
2167 expect that old blocks will stabilize over time, so that less
2168 copying will happen this way. */
2169 for (b
= oldest_sblock
; b
; b
= b
->next
)
2172 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2174 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2176 /* Compute the next FROM here because copying below may
2177 overwrite data we need to compute it. */
2180 #ifdef GC_CHECK_STRING_BYTES
2181 /* Check that the string size recorded in the string is the
2182 same as the one recorded in the sdata structure. */
2184 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2186 #endif /* GC_CHECK_STRING_BYTES */
2189 nbytes
= GC_STRING_BYTES (from
->string
);
2191 nbytes
= SDATA_NBYTES (from
);
2193 if (nbytes
> LARGE_STRING_BYTES
)
2196 nbytes
= SDATA_SIZE (nbytes
);
2197 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2199 #ifdef GC_CHECK_STRING_OVERRUN
2200 if (bcmp (string_overrun_cookie
,
2201 ((char *) from_end
) - GC_STRING_OVERRUN_COOKIE_SIZE
,
2202 GC_STRING_OVERRUN_COOKIE_SIZE
))
2206 /* FROM->string non-null means it's alive. Copy its data. */
2209 /* If TB is full, proceed with the next sblock. */
2210 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2211 if (to_end
> tb_end
)
2215 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2216 to
= &tb
->first_data
;
2217 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2220 /* Copy, and update the string's `data' pointer. */
2223 xassert (tb
!= b
|| to
<= from
);
2224 safe_bcopy ((char *) from
, (char *) to
, nbytes
+ GC_STRING_EXTRA
);
2225 to
->string
->data
= SDATA_DATA (to
);
2228 /* Advance past the sdata we copied to. */
2234 /* The rest of the sblocks following TB don't contain live data, so
2235 we can free them. */
2236 for (b
= tb
->next
; b
; b
= next
)
2244 current_sblock
= tb
;
2248 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2249 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2250 LENGTH must be an integer.
2251 INIT must be an integer that represents a character. */)
2253 Lisp_Object length
, init
;
2255 register Lisp_Object val
;
2256 register unsigned char *p
, *end
;
2259 CHECK_NATNUM (length
);
2260 CHECK_NUMBER (init
);
2263 if (ASCII_CHAR_P (c
))
2265 nbytes
= XINT (length
);
2266 val
= make_uninit_string (nbytes
);
2268 end
= p
+ SCHARS (val
);
2274 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2275 int len
= CHAR_STRING (c
, str
);
2277 nbytes
= len
* XINT (length
);
2278 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
2283 bcopy (str
, p
, len
);
2293 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2294 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2295 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2297 Lisp_Object length
, init
;
2299 register Lisp_Object val
;
2300 struct Lisp_Bool_Vector
*p
;
2302 int length_in_chars
, length_in_elts
, bits_per_value
;
2304 CHECK_NATNUM (length
);
2306 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2308 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2309 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2310 / BOOL_VECTOR_BITS_PER_CHAR
);
2312 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2313 slot `size' of the struct Lisp_Bool_Vector. */
2314 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2316 /* Get rid of any bits that would cause confusion. */
2317 XVECTOR (val
)->size
= 0; /* No Lisp_Object to trace in there. */
2318 /* Use XVECTOR (val) rather than `p' because p->size is not TRT. */
2319 XSETPVECTYPE (XVECTOR (val
), PVEC_BOOL_VECTOR
);
2321 p
= XBOOL_VECTOR (val
);
2322 p
->size
= XFASTINT (length
);
2324 real_init
= (NILP (init
) ? 0 : -1);
2325 for (i
= 0; i
< length_in_chars
; i
++)
2326 p
->data
[i
] = real_init
;
2328 /* Clear the extraneous bits in the last byte. */
2329 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2330 p
->data
[length_in_chars
- 1]
2331 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2337 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2338 of characters from the contents. This string may be unibyte or
2339 multibyte, depending on the contents. */
2342 make_string (const char *contents
, int nbytes
)
2344 register Lisp_Object val
;
2345 int nchars
, multibyte_nbytes
;
2347 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
2348 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2349 /* CONTENTS contains no multibyte sequences or contains an invalid
2350 multibyte sequence. We must make unibyte string. */
2351 val
= make_unibyte_string (contents
, nbytes
);
2353 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2358 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2361 make_unibyte_string (const char *contents
, int length
)
2363 register Lisp_Object val
;
2364 val
= make_uninit_string (length
);
2365 bcopy (contents
, SDATA (val
), length
);
2366 STRING_SET_UNIBYTE (val
);
2371 /* Make a multibyte string from NCHARS characters occupying NBYTES
2372 bytes at CONTENTS. */
2375 make_multibyte_string (const char *contents
, int nchars
, int nbytes
)
2377 register Lisp_Object val
;
2378 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2379 bcopy (contents
, SDATA (val
), nbytes
);
2384 /* Make a string from NCHARS characters occupying NBYTES bytes at
2385 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2388 make_string_from_bytes (const char *contents
, int nchars
, int nbytes
)
2390 register Lisp_Object val
;
2391 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2392 bcopy (contents
, SDATA (val
), nbytes
);
2393 if (SBYTES (val
) == SCHARS (val
))
2394 STRING_SET_UNIBYTE (val
);
2399 /* Make a string from NCHARS characters occupying NBYTES bytes at
2400 CONTENTS. The argument MULTIBYTE controls whether to label the
2401 string as multibyte. If NCHARS is negative, it counts the number of
2402 characters by itself. */
2405 make_specified_string (const char *contents
, int nchars
, int nbytes
, int multibyte
)
2407 register Lisp_Object val
;
2412 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2416 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2417 bcopy (contents
, SDATA (val
), nbytes
);
2419 STRING_SET_UNIBYTE (val
);
2424 /* Make a string from the data at STR, treating it as multibyte if the
2428 build_string (const char *str
)
2430 return make_string (str
, strlen (str
));
2434 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2435 occupying LENGTH bytes. */
2438 make_uninit_string (int length
)
2443 return empty_unibyte_string
;
2444 val
= make_uninit_multibyte_string (length
, length
);
2445 STRING_SET_UNIBYTE (val
);
2450 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2451 which occupy NBYTES bytes. */
2454 make_uninit_multibyte_string (int nchars
, int nbytes
)
2457 struct Lisp_String
*s
;
2462 return empty_multibyte_string
;
2464 s
= allocate_string ();
2465 allocate_string_data (s
, nchars
, nbytes
);
2466 XSETSTRING (string
, s
);
2467 string_chars_consed
+= nbytes
;
2473 /***********************************************************************
2475 ***********************************************************************/
2477 /* We store float cells inside of float_blocks, allocating a new
2478 float_block with malloc whenever necessary. Float cells reclaimed
2479 by GC are put on a free list to be reallocated before allocating
2480 any new float cells from the latest float_block. */
2482 #define FLOAT_BLOCK_SIZE \
2483 (((BLOCK_BYTES - sizeof (struct float_block *) \
2484 /* The compiler might add padding at the end. */ \
2485 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2486 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2488 #define GETMARKBIT(block,n) \
2489 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2490 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2493 #define SETMARKBIT(block,n) \
2494 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2495 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2497 #define UNSETMARKBIT(block,n) \
2498 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2499 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2501 #define FLOAT_BLOCK(fptr) \
2502 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2504 #define FLOAT_INDEX(fptr) \
2505 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2509 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2510 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2511 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2512 struct float_block
*next
;
2515 #define FLOAT_MARKED_P(fptr) \
2516 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2518 #define FLOAT_MARK(fptr) \
2519 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2521 #define FLOAT_UNMARK(fptr) \
2522 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2524 /* Current float_block. */
2526 struct float_block
*float_block
;
2528 /* Index of first unused Lisp_Float in the current float_block. */
2530 int float_block_index
;
2532 /* Total number of float blocks now in use. */
2536 /* Free-list of Lisp_Floats. */
2538 struct Lisp_Float
*float_free_list
;
2541 /* Initialize float allocation. */
2547 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2548 float_free_list
= 0;
2553 /* Explicitly free a float cell by putting it on the free-list. */
2556 free_float (struct Lisp_Float
*ptr
)
2558 ptr
->u
.chain
= float_free_list
;
2559 float_free_list
= ptr
;
2563 /* Return a new float object with value FLOAT_VALUE. */
2566 make_float (double float_value
)
2568 register Lisp_Object val
;
2570 /* eassert (!handling_signal); */
2574 if (float_free_list
)
2576 /* We use the data field for chaining the free list
2577 so that we won't use the same field that has the mark bit. */
2578 XSETFLOAT (val
, float_free_list
);
2579 float_free_list
= float_free_list
->u
.chain
;
2583 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2585 register struct float_block
*new;
2587 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2589 new->next
= float_block
;
2590 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2592 float_block_index
= 0;
2595 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2596 float_block_index
++;
2599 MALLOC_UNBLOCK_INPUT
;
2601 XFLOAT_INIT (val
, float_value
);
2602 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2603 consing_since_gc
+= sizeof (struct Lisp_Float
);
2610 /***********************************************************************
2612 ***********************************************************************/
2614 /* We store cons cells inside of cons_blocks, allocating a new
2615 cons_block with malloc whenever necessary. Cons cells reclaimed by
2616 GC are put on a free list to be reallocated before allocating
2617 any new cons cells from the latest cons_block. */
2619 #define CONS_BLOCK_SIZE \
2620 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2621 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2623 #define CONS_BLOCK(fptr) \
2624 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2626 #define CONS_INDEX(fptr) \
2627 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2631 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2632 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2633 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2634 struct cons_block
*next
;
2637 #define CONS_MARKED_P(fptr) \
2638 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2640 #define CONS_MARK(fptr) \
2641 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2643 #define CONS_UNMARK(fptr) \
2644 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2646 /* Current cons_block. */
2648 struct cons_block
*cons_block
;
2650 /* Index of first unused Lisp_Cons in the current block. */
2652 int cons_block_index
;
2654 /* Free-list of Lisp_Cons structures. */
2656 struct Lisp_Cons
*cons_free_list
;
2658 /* Total number of cons blocks now in use. */
2660 static int n_cons_blocks
;
2663 /* Initialize cons allocation. */
2669 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2675 /* Explicitly free a cons cell by putting it on the free-list. */
2678 free_cons (struct Lisp_Cons
*ptr
)
2680 ptr
->u
.chain
= cons_free_list
;
2684 cons_free_list
= ptr
;
2687 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2688 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2690 Lisp_Object car
, cdr
;
2692 register Lisp_Object val
;
2694 /* eassert (!handling_signal); */
2700 /* We use the cdr for chaining the free list
2701 so that we won't use the same field that has the mark bit. */
2702 XSETCONS (val
, cons_free_list
);
2703 cons_free_list
= cons_free_list
->u
.chain
;
2707 if (cons_block_index
== CONS_BLOCK_SIZE
)
2709 register struct cons_block
*new;
2710 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2712 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2713 new->next
= cons_block
;
2715 cons_block_index
= 0;
2718 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2722 MALLOC_UNBLOCK_INPUT
;
2726 eassert (!CONS_MARKED_P (XCONS (val
)));
2727 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2728 cons_cells_consed
++;
2732 /* Get an error now if there's any junk in the cons free list. */
2734 check_cons_list (void)
2736 #ifdef GC_CHECK_CONS_LIST
2737 struct Lisp_Cons
*tail
= cons_free_list
;
2740 tail
= tail
->u
.chain
;
2744 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2747 list1 (Lisp_Object arg1
)
2749 return Fcons (arg1
, Qnil
);
2753 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2755 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2760 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2762 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2767 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2769 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2774 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2776 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2777 Fcons (arg5
, Qnil
)))));
2781 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2782 doc
: /* Return a newly created list with specified arguments as elements.
2783 Any number of arguments, even zero arguments, are allowed.
2784 usage: (list &rest OBJECTS) */)
2787 register Lisp_Object
*args
;
2789 register Lisp_Object val
;
2795 val
= Fcons (args
[nargs
], val
);
2801 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2802 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2804 register Lisp_Object length
, init
;
2806 register Lisp_Object val
;
2809 CHECK_NATNUM (length
);
2810 size
= XFASTINT (length
);
2815 val
= Fcons (init
, val
);
2820 val
= Fcons (init
, val
);
2825 val
= Fcons (init
, val
);
2830 val
= Fcons (init
, val
);
2835 val
= Fcons (init
, val
);
2850 /***********************************************************************
2852 ***********************************************************************/
2854 /* Singly-linked list of all vectors. */
2856 static struct Lisp_Vector
*all_vectors
;
2858 /* Total number of vector-like objects now in use. */
2860 static int n_vectors
;
2863 /* Value is a pointer to a newly allocated Lisp_Vector structure
2864 with room for LEN Lisp_Objects. */
2866 static struct Lisp_Vector
*
2867 allocate_vectorlike (EMACS_INT len
)
2869 struct Lisp_Vector
*p
;
2874 #ifdef DOUG_LEA_MALLOC
2875 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2876 because mapped region contents are not preserved in
2878 mallopt (M_MMAP_MAX
, 0);
2881 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2882 /* eassert (!handling_signal); */
2884 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2885 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
2887 #ifdef DOUG_LEA_MALLOC
2888 /* Back to a reasonable maximum of mmap'ed areas. */
2889 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2892 consing_since_gc
+= nbytes
;
2893 vector_cells_consed
+= len
;
2895 p
->next
= all_vectors
;
2898 MALLOC_UNBLOCK_INPUT
;
2905 /* Allocate a vector with NSLOTS slots. */
2907 struct Lisp_Vector
*
2908 allocate_vector (EMACS_INT nslots
)
2910 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
);
2916 /* Allocate other vector-like structures. */
2918 struct Lisp_Vector
*
2919 allocate_pseudovector (int memlen
, int lisplen
, EMACS_INT tag
)
2921 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2924 /* Only the first lisplen slots will be traced normally by the GC. */
2926 for (i
= 0; i
< lisplen
; ++i
)
2927 v
->contents
[i
] = Qnil
;
2929 XSETPVECTYPE (v
, tag
); /* Add the appropriate tag. */
2933 struct Lisp_Hash_Table
*
2934 allocate_hash_table (void)
2936 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
2941 allocate_window (void)
2943 return ALLOCATE_PSEUDOVECTOR(struct window
, current_matrix
, PVEC_WINDOW
);
2948 allocate_terminal (void)
2950 struct terminal
*t
= ALLOCATE_PSEUDOVECTOR (struct terminal
,
2951 next_terminal
, PVEC_TERMINAL
);
2952 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2953 bzero (&(t
->next_terminal
),
2954 ((char*)(t
+1)) - ((char*)&(t
->next_terminal
)));
2960 allocate_frame (void)
2962 struct frame
*f
= ALLOCATE_PSEUDOVECTOR (struct frame
,
2963 face_cache
, PVEC_FRAME
);
2964 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2965 bzero (&(f
->face_cache
),
2966 ((char*)(f
+1)) - ((char*)&(f
->face_cache
)));
2971 struct Lisp_Process
*
2972 allocate_process (void)
2974 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
2978 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2979 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2980 See also the function `vector'. */)
2982 register Lisp_Object length
, init
;
2985 register EMACS_INT sizei
;
2987 register struct Lisp_Vector
*p
;
2989 CHECK_NATNUM (length
);
2990 sizei
= XFASTINT (length
);
2992 p
= allocate_vector (sizei
);
2993 for (index
= 0; index
< sizei
; index
++)
2994 p
->contents
[index
] = init
;
2996 XSETVECTOR (vector
, p
);
3001 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3002 doc
: /* Return a newly created vector with specified arguments as elements.
3003 Any number of arguments, even zero arguments, are allowed.
3004 usage: (vector &rest OBJECTS) */)
3009 register Lisp_Object len
, val
;
3011 register struct Lisp_Vector
*p
;
3013 XSETFASTINT (len
, nargs
);
3014 val
= Fmake_vector (len
, Qnil
);
3016 for (index
= 0; index
< nargs
; index
++)
3017 p
->contents
[index
] = args
[index
];
3022 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3023 doc
: /* Create a byte-code object with specified arguments as elements.
3024 The arguments should be the arglist, bytecode-string, constant vector,
3025 stack size, (optional) doc string, and (optional) interactive spec.
3026 The first four arguments are required; at most six have any
3028 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3033 register Lisp_Object len
, val
;
3035 register struct Lisp_Vector
*p
;
3037 XSETFASTINT (len
, nargs
);
3038 if (!NILP (Vpurify_flag
))
3039 val
= make_pure_vector ((EMACS_INT
) nargs
);
3041 val
= Fmake_vector (len
, Qnil
);
3043 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
3044 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3045 earlier because they produced a raw 8-bit string for byte-code
3046 and now such a byte-code string is loaded as multibyte while
3047 raw 8-bit characters converted to multibyte form. Thus, now we
3048 must convert them back to the original unibyte form. */
3049 args
[1] = Fstring_as_unibyte (args
[1]);
3052 for (index
= 0; index
< nargs
; index
++)
3054 if (!NILP (Vpurify_flag
))
3055 args
[index
] = Fpurecopy (args
[index
]);
3056 p
->contents
[index
] = args
[index
];
3058 XSETPVECTYPE (p
, PVEC_COMPILED
);
3059 XSETCOMPILED (val
, p
);
3065 /***********************************************************************
3067 ***********************************************************************/
3069 /* Each symbol_block is just under 1020 bytes long, since malloc
3070 really allocates in units of powers of two and uses 4 bytes for its
3073 #define SYMBOL_BLOCK_SIZE \
3074 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3078 /* Place `symbols' first, to preserve alignment. */
3079 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3080 struct symbol_block
*next
;
3083 /* Current symbol block and index of first unused Lisp_Symbol
3086 static struct symbol_block
*symbol_block
;
3087 static int symbol_block_index
;
3089 /* List of free symbols. */
3091 static struct Lisp_Symbol
*symbol_free_list
;
3093 /* Total number of symbol blocks now in use. */
3095 static int n_symbol_blocks
;
3098 /* Initialize symbol allocation. */
3103 symbol_block
= NULL
;
3104 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3105 symbol_free_list
= 0;
3106 n_symbol_blocks
= 0;
3110 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3111 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3112 Its value and function definition are void, and its property list is nil. */)
3116 register Lisp_Object val
;
3117 register struct Lisp_Symbol
*p
;
3119 CHECK_STRING (name
);
3121 /* eassert (!handling_signal); */
3125 if (symbol_free_list
)
3127 XSETSYMBOL (val
, symbol_free_list
);
3128 symbol_free_list
= symbol_free_list
->next
;
3132 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3134 struct symbol_block
*new;
3135 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3137 new->next
= symbol_block
;
3139 symbol_block_index
= 0;
3142 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3143 symbol_block_index
++;
3146 MALLOC_UNBLOCK_INPUT
;
3151 p
->redirect
= SYMBOL_PLAINVAL
;
3152 SET_SYMBOL_VAL (p
, Qunbound
);
3153 p
->function
= Qunbound
;
3156 p
->interned
= SYMBOL_UNINTERNED
;
3158 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3165 /***********************************************************************
3166 Marker (Misc) Allocation
3167 ***********************************************************************/
3169 /* Allocation of markers and other objects that share that structure.
3170 Works like allocation of conses. */
3172 #define MARKER_BLOCK_SIZE \
3173 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3177 /* Place `markers' first, to preserve alignment. */
3178 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3179 struct marker_block
*next
;
3182 static struct marker_block
*marker_block
;
3183 static int marker_block_index
;
3185 static union Lisp_Misc
*marker_free_list
;
3187 /* Total number of marker blocks now in use. */
3189 static int n_marker_blocks
;
3194 marker_block
= NULL
;
3195 marker_block_index
= MARKER_BLOCK_SIZE
;
3196 marker_free_list
= 0;
3197 n_marker_blocks
= 0;
3200 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3203 allocate_misc (void)
3207 /* eassert (!handling_signal); */
3211 if (marker_free_list
)
3213 XSETMISC (val
, marker_free_list
);
3214 marker_free_list
= marker_free_list
->u_free
.chain
;
3218 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3220 struct marker_block
*new;
3221 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3223 new->next
= marker_block
;
3225 marker_block_index
= 0;
3227 total_free_markers
+= MARKER_BLOCK_SIZE
;
3229 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3230 marker_block_index
++;
3233 MALLOC_UNBLOCK_INPUT
;
3235 --total_free_markers
;
3236 consing_since_gc
+= sizeof (union Lisp_Misc
);
3237 misc_objects_consed
++;
3238 XMISCANY (val
)->gcmarkbit
= 0;
3242 /* Free a Lisp_Misc object */
3245 free_misc (Lisp_Object misc
)
3247 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3248 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3249 marker_free_list
= XMISC (misc
);
3251 total_free_markers
++;
3254 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3255 INTEGER. This is used to package C values to call record_unwind_protect.
3256 The unwind function can get the C values back using XSAVE_VALUE. */
3259 make_save_value (void *pointer
, int integer
)
3261 register Lisp_Object val
;
3262 register struct Lisp_Save_Value
*p
;
3264 val
= allocate_misc ();
3265 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3266 p
= XSAVE_VALUE (val
);
3267 p
->pointer
= pointer
;
3268 p
->integer
= integer
;
3273 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3274 doc
: /* Return a newly allocated marker which does not point at any place. */)
3277 register Lisp_Object val
;
3278 register struct Lisp_Marker
*p
;
3280 val
= allocate_misc ();
3281 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3287 p
->insertion_type
= 0;
3291 /* Put MARKER back on the free list after using it temporarily. */
3294 free_marker (Lisp_Object marker
)
3296 unchain_marker (XMARKER (marker
));
3301 /* Return a newly created vector or string with specified arguments as
3302 elements. If all the arguments are characters that can fit
3303 in a string of events, make a string; otherwise, make a vector.
3305 Any number of arguments, even zero arguments, are allowed. */
3308 make_event_array (register int nargs
, Lisp_Object
*args
)
3312 for (i
= 0; i
< nargs
; i
++)
3313 /* The things that fit in a string
3314 are characters that are in 0...127,
3315 after discarding the meta bit and all the bits above it. */
3316 if (!INTEGERP (args
[i
])
3317 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3318 return Fvector (nargs
, args
);
3320 /* Since the loop exited, we know that all the things in it are
3321 characters, so we can make a string. */
3325 result
= Fmake_string (make_number (nargs
), make_number (0));
3326 for (i
= 0; i
< nargs
; i
++)
3328 SSET (result
, i
, XINT (args
[i
]));
3329 /* Move the meta bit to the right place for a string char. */
3330 if (XINT (args
[i
]) & CHAR_META
)
3331 SSET (result
, i
, SREF (result
, i
) | 0x80);
3340 /************************************************************************
3341 Memory Full Handling
3342 ************************************************************************/
3345 /* Called if malloc returns zero. */
3354 memory_full_cons_threshold
= sizeof (struct cons_block
);
3356 /* The first time we get here, free the spare memory. */
3357 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3358 if (spare_memory
[i
])
3361 free (spare_memory
[i
]);
3362 else if (i
>= 1 && i
<= 4)
3363 lisp_align_free (spare_memory
[i
]);
3365 lisp_free (spare_memory
[i
]);
3366 spare_memory
[i
] = 0;
3369 /* Record the space now used. When it decreases substantially,
3370 we can refill the memory reserve. */
3371 #ifndef SYSTEM_MALLOC
3372 bytes_used_when_full
= BYTES_USED
;
3375 /* This used to call error, but if we've run out of memory, we could
3376 get infinite recursion trying to build the string. */
3377 xsignal (Qnil
, Vmemory_signal_data
);
3380 /* If we released our reserve (due to running out of memory),
3381 and we have a fair amount free once again,
3382 try to set aside another reserve in case we run out once more.
3384 This is called when a relocatable block is freed in ralloc.c,
3385 and also directly from this file, in case we're not using ralloc.c. */
3388 refill_memory_reserve (void)
3390 #ifndef SYSTEM_MALLOC
3391 if (spare_memory
[0] == 0)
3392 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3393 if (spare_memory
[1] == 0)
3394 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3396 if (spare_memory
[2] == 0)
3397 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3399 if (spare_memory
[3] == 0)
3400 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3402 if (spare_memory
[4] == 0)
3403 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3405 if (spare_memory
[5] == 0)
3406 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3408 if (spare_memory
[6] == 0)
3409 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3411 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3412 Vmemory_full
= Qnil
;
3416 /************************************************************************
3418 ************************************************************************/
3420 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3422 /* Conservative C stack marking requires a method to identify possibly
3423 live Lisp objects given a pointer value. We do this by keeping
3424 track of blocks of Lisp data that are allocated in a red-black tree
3425 (see also the comment of mem_node which is the type of nodes in
3426 that tree). Function lisp_malloc adds information for an allocated
3427 block to the red-black tree with calls to mem_insert, and function
3428 lisp_free removes it with mem_delete. Functions live_string_p etc
3429 call mem_find to lookup information about a given pointer in the
3430 tree, and use that to determine if the pointer points to a Lisp
3433 /* Initialize this part of alloc.c. */
3438 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3439 mem_z
.parent
= NULL
;
3440 mem_z
.color
= MEM_BLACK
;
3441 mem_z
.start
= mem_z
.end
= NULL
;
3446 /* Value is a pointer to the mem_node containing START. Value is
3447 MEM_NIL if there is no node in the tree containing START. */
3449 static INLINE
struct mem_node
*
3450 mem_find (void *start
)
3454 if (start
< min_heap_address
|| start
> max_heap_address
)
3457 /* Make the search always successful to speed up the loop below. */
3458 mem_z
.start
= start
;
3459 mem_z
.end
= (char *) start
+ 1;
3462 while (start
< p
->start
|| start
>= p
->end
)
3463 p
= start
< p
->start
? p
->left
: p
->right
;
3468 /* Insert a new node into the tree for a block of memory with start
3469 address START, end address END, and type TYPE. Value is a
3470 pointer to the node that was inserted. */
3472 static struct mem_node
*
3473 mem_insert (void *start
, void *end
, enum mem_type type
)
3475 struct mem_node
*c
, *parent
, *x
;
3477 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3478 min_heap_address
= start
;
3479 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3480 max_heap_address
= end
;
3482 /* See where in the tree a node for START belongs. In this
3483 particular application, it shouldn't happen that a node is already
3484 present. For debugging purposes, let's check that. */
3488 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3490 while (c
!= MEM_NIL
)
3492 if (start
>= c
->start
&& start
< c
->end
)
3495 c
= start
< c
->start
? c
->left
: c
->right
;
3498 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3500 while (c
!= MEM_NIL
)
3503 c
= start
< c
->start
? c
->left
: c
->right
;
3506 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3508 /* Create a new node. */
3509 #ifdef GC_MALLOC_CHECK
3510 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3514 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3520 x
->left
= x
->right
= MEM_NIL
;
3523 /* Insert it as child of PARENT or install it as root. */
3526 if (start
< parent
->start
)
3534 /* Re-establish red-black tree properties. */
3535 mem_insert_fixup (x
);
3541 /* Re-establish the red-black properties of the tree, and thereby
3542 balance the tree, after node X has been inserted; X is always red. */
3545 mem_insert_fixup (struct mem_node
*x
)
3547 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3549 /* X is red and its parent is red. This is a violation of
3550 red-black tree property #3. */
3552 if (x
->parent
== x
->parent
->parent
->left
)
3554 /* We're on the left side of our grandparent, and Y is our
3556 struct mem_node
*y
= x
->parent
->parent
->right
;
3558 if (y
->color
== MEM_RED
)
3560 /* Uncle and parent are red but should be black because
3561 X is red. Change the colors accordingly and proceed
3562 with the grandparent. */
3563 x
->parent
->color
= MEM_BLACK
;
3564 y
->color
= MEM_BLACK
;
3565 x
->parent
->parent
->color
= MEM_RED
;
3566 x
= x
->parent
->parent
;
3570 /* Parent and uncle have different colors; parent is
3571 red, uncle is black. */
3572 if (x
== x
->parent
->right
)
3575 mem_rotate_left (x
);
3578 x
->parent
->color
= MEM_BLACK
;
3579 x
->parent
->parent
->color
= MEM_RED
;
3580 mem_rotate_right (x
->parent
->parent
);
3585 /* This is the symmetrical case of above. */
3586 struct mem_node
*y
= x
->parent
->parent
->left
;
3588 if (y
->color
== MEM_RED
)
3590 x
->parent
->color
= MEM_BLACK
;
3591 y
->color
= MEM_BLACK
;
3592 x
->parent
->parent
->color
= MEM_RED
;
3593 x
= x
->parent
->parent
;
3597 if (x
== x
->parent
->left
)
3600 mem_rotate_right (x
);
3603 x
->parent
->color
= MEM_BLACK
;
3604 x
->parent
->parent
->color
= MEM_RED
;
3605 mem_rotate_left (x
->parent
->parent
);
3610 /* The root may have been changed to red due to the algorithm. Set
3611 it to black so that property #5 is satisfied. */
3612 mem_root
->color
= MEM_BLACK
;
3623 mem_rotate_left (struct mem_node
*x
)
3627 /* Turn y's left sub-tree into x's right sub-tree. */
3630 if (y
->left
!= MEM_NIL
)
3631 y
->left
->parent
= x
;
3633 /* Y's parent was x's parent. */
3635 y
->parent
= x
->parent
;
3637 /* Get the parent to point to y instead of x. */
3640 if (x
== x
->parent
->left
)
3641 x
->parent
->left
= y
;
3643 x
->parent
->right
= y
;
3648 /* Put x on y's left. */
3662 mem_rotate_right (struct mem_node
*x
)
3664 struct mem_node
*y
= x
->left
;
3667 if (y
->right
!= MEM_NIL
)
3668 y
->right
->parent
= x
;
3671 y
->parent
= x
->parent
;
3674 if (x
== x
->parent
->right
)
3675 x
->parent
->right
= y
;
3677 x
->parent
->left
= y
;
3688 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3691 mem_delete (struct mem_node
*z
)
3693 struct mem_node
*x
, *y
;
3695 if (!z
|| z
== MEM_NIL
)
3698 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3703 while (y
->left
!= MEM_NIL
)
3707 if (y
->left
!= MEM_NIL
)
3712 x
->parent
= y
->parent
;
3715 if (y
== y
->parent
->left
)
3716 y
->parent
->left
= x
;
3718 y
->parent
->right
= x
;
3725 z
->start
= y
->start
;
3730 if (y
->color
== MEM_BLACK
)
3731 mem_delete_fixup (x
);
3733 #ifdef GC_MALLOC_CHECK
3741 /* Re-establish the red-black properties of the tree, after a
3745 mem_delete_fixup (struct mem_node
*x
)
3747 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3749 if (x
== x
->parent
->left
)
3751 struct mem_node
*w
= x
->parent
->right
;
3753 if (w
->color
== MEM_RED
)
3755 w
->color
= MEM_BLACK
;
3756 x
->parent
->color
= MEM_RED
;
3757 mem_rotate_left (x
->parent
);
3758 w
= x
->parent
->right
;
3761 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3768 if (w
->right
->color
== MEM_BLACK
)
3770 w
->left
->color
= MEM_BLACK
;
3772 mem_rotate_right (w
);
3773 w
= x
->parent
->right
;
3775 w
->color
= x
->parent
->color
;
3776 x
->parent
->color
= MEM_BLACK
;
3777 w
->right
->color
= MEM_BLACK
;
3778 mem_rotate_left (x
->parent
);
3784 struct mem_node
*w
= x
->parent
->left
;
3786 if (w
->color
== MEM_RED
)
3788 w
->color
= MEM_BLACK
;
3789 x
->parent
->color
= MEM_RED
;
3790 mem_rotate_right (x
->parent
);
3791 w
= x
->parent
->left
;
3794 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3801 if (w
->left
->color
== MEM_BLACK
)
3803 w
->right
->color
= MEM_BLACK
;
3805 mem_rotate_left (w
);
3806 w
= x
->parent
->left
;
3809 w
->color
= x
->parent
->color
;
3810 x
->parent
->color
= MEM_BLACK
;
3811 w
->left
->color
= MEM_BLACK
;
3812 mem_rotate_right (x
->parent
);
3818 x
->color
= MEM_BLACK
;
3822 /* Value is non-zero if P is a pointer to a live Lisp string on
3823 the heap. M is a pointer to the mem_block for P. */
3826 live_string_p (struct mem_node
*m
, void *p
)
3828 if (m
->type
== MEM_TYPE_STRING
)
3830 struct string_block
*b
= (struct string_block
*) m
->start
;
3831 int offset
= (char *) p
- (char *) &b
->strings
[0];
3833 /* P must point to the start of a Lisp_String structure, and it
3834 must not be on the free-list. */
3836 && offset
% sizeof b
->strings
[0] == 0
3837 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3838 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3845 /* Value is non-zero if P is a pointer to a live Lisp cons on
3846 the heap. M is a pointer to the mem_block for P. */
3849 live_cons_p (struct mem_node
*m
, void *p
)
3851 if (m
->type
== MEM_TYPE_CONS
)
3853 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3854 int offset
= (char *) p
- (char *) &b
->conses
[0];
3856 /* P must point to the start of a Lisp_Cons, not be
3857 one of the unused cells in the current cons block,
3858 and not be on the free-list. */
3860 && offset
% sizeof b
->conses
[0] == 0
3861 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3863 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3864 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3871 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3872 the heap. M is a pointer to the mem_block for P. */
3875 live_symbol_p (struct mem_node
*m
, void *p
)
3877 if (m
->type
== MEM_TYPE_SYMBOL
)
3879 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3880 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3882 /* P must point to the start of a Lisp_Symbol, not be
3883 one of the unused cells in the current symbol block,
3884 and not be on the free-list. */
3886 && offset
% sizeof b
->symbols
[0] == 0
3887 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3888 && (b
!= symbol_block
3889 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3890 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3897 /* Value is non-zero if P is a pointer to a live Lisp float on
3898 the heap. M is a pointer to the mem_block for P. */
3901 live_float_p (struct mem_node
*m
, void *p
)
3903 if (m
->type
== MEM_TYPE_FLOAT
)
3905 struct float_block
*b
= (struct float_block
*) m
->start
;
3906 int offset
= (char *) p
- (char *) &b
->floats
[0];
3908 /* P must point to the start of a Lisp_Float and not be
3909 one of the unused cells in the current float block. */
3911 && offset
% sizeof b
->floats
[0] == 0
3912 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3913 && (b
!= float_block
3914 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3921 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3922 the heap. M is a pointer to the mem_block for P. */
3925 live_misc_p (struct mem_node
*m
, void *p
)
3927 if (m
->type
== MEM_TYPE_MISC
)
3929 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3930 int offset
= (char *) p
- (char *) &b
->markers
[0];
3932 /* P must point to the start of a Lisp_Misc, not be
3933 one of the unused cells in the current misc block,
3934 and not be on the free-list. */
3936 && offset
% sizeof b
->markers
[0] == 0
3937 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3938 && (b
!= marker_block
3939 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3940 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
3947 /* Value is non-zero if P is a pointer to a live vector-like object.
3948 M is a pointer to the mem_block for P. */
3951 live_vector_p (struct mem_node
*m
, void *p
)
3953 return (p
== m
->start
&& m
->type
== MEM_TYPE_VECTORLIKE
);
3957 /* Value is non-zero if P is a pointer to a live buffer. M is a
3958 pointer to the mem_block for P. */
3961 live_buffer_p (struct mem_node
*m
, void *p
)
3963 /* P must point to the start of the block, and the buffer
3964 must not have been killed. */
3965 return (m
->type
== MEM_TYPE_BUFFER
3967 && !NILP (((struct buffer
*) p
)->name
));
3970 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3974 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3976 /* Array of objects that are kept alive because the C stack contains
3977 a pattern that looks like a reference to them . */
3979 #define MAX_ZOMBIES 10
3980 static Lisp_Object zombies
[MAX_ZOMBIES
];
3982 /* Number of zombie objects. */
3984 static int nzombies
;
3986 /* Number of garbage collections. */
3990 /* Average percentage of zombies per collection. */
3992 static double avg_zombies
;
3994 /* Max. number of live and zombie objects. */
3996 static int max_live
, max_zombies
;
3998 /* Average number of live objects per GC. */
4000 static double avg_live
;
4002 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4003 doc
: /* Show information about live and zombie objects. */)
4006 Lisp_Object args
[8], zombie_list
= Qnil
;
4008 for (i
= 0; i
< nzombies
; i
++)
4009 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4010 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4011 args
[1] = make_number (ngcs
);
4012 args
[2] = make_float (avg_live
);
4013 args
[3] = make_float (avg_zombies
);
4014 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4015 args
[5] = make_number (max_live
);
4016 args
[6] = make_number (max_zombies
);
4017 args
[7] = zombie_list
;
4018 return Fmessage (8, args
);
4021 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4024 /* Mark OBJ if we can prove it's a Lisp_Object. */
4027 mark_maybe_object (Lisp_Object obj
)
4029 void *po
= (void *) XPNTR (obj
);
4030 struct mem_node
*m
= mem_find (po
);
4036 switch (XTYPE (obj
))
4039 mark_p
= (live_string_p (m
, po
)
4040 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4044 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4048 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4052 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4055 case Lisp_Vectorlike
:
4056 /* Note: can't check BUFFERP before we know it's a
4057 buffer because checking that dereferences the pointer
4058 PO which might point anywhere. */
4059 if (live_vector_p (m
, po
))
4060 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4061 else if (live_buffer_p (m
, po
))
4062 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4066 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4075 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4076 if (nzombies
< MAX_ZOMBIES
)
4077 zombies
[nzombies
] = obj
;
4086 /* If P points to Lisp data, mark that as live if it isn't already
4090 mark_maybe_pointer (void *p
)
4094 /* Quickly rule out some values which can't point to Lisp data. */
4097 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */
4099 2 /* We assume that Lisp data is aligned on even addresses. */
4107 Lisp_Object obj
= Qnil
;
4111 case MEM_TYPE_NON_LISP
:
4112 /* Nothing to do; not a pointer to Lisp memory. */
4115 case MEM_TYPE_BUFFER
:
4116 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4117 XSETVECTOR (obj
, p
);
4121 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4125 case MEM_TYPE_STRING
:
4126 if (live_string_p (m
, p
)
4127 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4128 XSETSTRING (obj
, p
);
4132 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4136 case MEM_TYPE_SYMBOL
:
4137 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4138 XSETSYMBOL (obj
, p
);
4141 case MEM_TYPE_FLOAT
:
4142 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4146 case MEM_TYPE_VECTORLIKE
:
4147 if (live_vector_p (m
, p
))
4150 XSETVECTOR (tem
, p
);
4151 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4166 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4167 or END+OFFSET..START. */
4170 mark_memory (void *start
, void *end
, int offset
)
4175 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4179 /* Make START the pointer to the start of the memory region,
4180 if it isn't already. */
4188 /* Mark Lisp_Objects. */
4189 for (p
= (Lisp_Object
*) ((char *) start
+ offset
); (void *) p
< end
; ++p
)
4190 mark_maybe_object (*p
);
4192 /* Mark Lisp data pointed to. This is necessary because, in some
4193 situations, the C compiler optimizes Lisp objects away, so that
4194 only a pointer to them remains. Example:
4196 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4199 Lisp_Object obj = build_string ("test");
4200 struct Lisp_String *s = XSTRING (obj);
4201 Fgarbage_collect ();
4202 fprintf (stderr, "test `%s'\n", s->data);
4206 Here, `obj' isn't really used, and the compiler optimizes it
4207 away. The only reference to the life string is through the
4210 for (pp
= (void **) ((char *) start
+ offset
); (void *) pp
< end
; ++pp
)
4211 mark_maybe_pointer (*pp
);
4214 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4215 the GCC system configuration. In gcc 3.2, the only systems for
4216 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4217 by others?) and ns32k-pc532-min. */
4219 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4221 static int setjmp_tested_p
, longjmps_done
;
4223 #define SETJMP_WILL_LIKELY_WORK "\
4225 Emacs garbage collector has been changed to use conservative stack\n\
4226 marking. Emacs has determined that the method it uses to do the\n\
4227 marking will likely work on your system, but this isn't sure.\n\
4229 If you are a system-programmer, or can get the help of a local wizard\n\
4230 who is, please take a look at the function mark_stack in alloc.c, and\n\
4231 verify that the methods used are appropriate for your system.\n\
4233 Please mail the result to <emacs-devel@gnu.org>.\n\
4236 #define SETJMP_WILL_NOT_WORK "\
4238 Emacs garbage collector has been changed to use conservative stack\n\
4239 marking. Emacs has determined that the default method it uses to do the\n\
4240 marking will not work on your system. We will need a system-dependent\n\
4241 solution for your system.\n\
4243 Please take a look at the function mark_stack in alloc.c, and\n\
4244 try to find a way to make it work on your system.\n\
4246 Note that you may get false negatives, depending on the compiler.\n\
4247 In particular, you need to use -O with GCC for this test.\n\
4249 Please mail the result to <emacs-devel@gnu.org>.\n\
4253 /* Perform a quick check if it looks like setjmp saves registers in a
4254 jmp_buf. Print a message to stderr saying so. When this test
4255 succeeds, this is _not_ a proof that setjmp is sufficient for
4256 conservative stack marking. Only the sources or a disassembly
4267 /* Arrange for X to be put in a register. */
4273 if (longjmps_done
== 1)
4275 /* Came here after the longjmp at the end of the function.
4277 If x == 1, the longjmp has restored the register to its
4278 value before the setjmp, and we can hope that setjmp
4279 saves all such registers in the jmp_buf, although that
4282 For other values of X, either something really strange is
4283 taking place, or the setjmp just didn't save the register. */
4286 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4289 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4296 if (longjmps_done
== 1)
4300 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4303 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4305 /* Abort if anything GCPRO'd doesn't survive the GC. */
4313 for (p
= gcprolist
; p
; p
= p
->next
)
4314 for (i
= 0; i
< p
->nvars
; ++i
)
4315 if (!survives_gc_p (p
->var
[i
]))
4316 /* FIXME: It's not necessarily a bug. It might just be that the
4317 GCPRO is unnecessary or should release the object sooner. */
4321 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4328 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4329 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4331 fprintf (stderr
, " %d = ", i
);
4332 debug_print (zombies
[i
]);
4336 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4339 /* Mark live Lisp objects on the C stack.
4341 There are several system-dependent problems to consider when
4342 porting this to new architectures:
4346 We have to mark Lisp objects in CPU registers that can hold local
4347 variables or are used to pass parameters.
4349 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4350 something that either saves relevant registers on the stack, or
4351 calls mark_maybe_object passing it each register's contents.
4353 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4354 implementation assumes that calling setjmp saves registers we need
4355 to see in a jmp_buf which itself lies on the stack. This doesn't
4356 have to be true! It must be verified for each system, possibly
4357 by taking a look at the source code of setjmp.
4361 Architectures differ in the way their processor stack is organized.
4362 For example, the stack might look like this
4365 | Lisp_Object | size = 4
4367 | something else | size = 2
4369 | Lisp_Object | size = 4
4373 In such a case, not every Lisp_Object will be aligned equally. To
4374 find all Lisp_Object on the stack it won't be sufficient to walk
4375 the stack in steps of 4 bytes. Instead, two passes will be
4376 necessary, one starting at the start of the stack, and a second
4377 pass starting at the start of the stack + 2. Likewise, if the
4378 minimal alignment of Lisp_Objects on the stack is 1, four passes
4379 would be necessary, each one starting with one byte more offset
4380 from the stack start.
4382 The current code assumes by default that Lisp_Objects are aligned
4383 equally on the stack. */
4389 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4390 union aligned_jmpbuf
{
4394 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4397 /* This trick flushes the register windows so that all the state of
4398 the process is contained in the stack. */
4399 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4400 needed on ia64 too. See mach_dep.c, where it also says inline
4401 assembler doesn't work with relevant proprietary compilers. */
4403 #if defined (__sparc64__) && defined (__FreeBSD__)
4404 /* FreeBSD does not have a ta 3 handler. */
4411 /* Save registers that we need to see on the stack. We need to see
4412 registers used to hold register variables and registers used to
4414 #ifdef GC_SAVE_REGISTERS_ON_STACK
4415 GC_SAVE_REGISTERS_ON_STACK (end
);
4416 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4418 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4419 setjmp will definitely work, test it
4420 and print a message with the result
4422 if (!setjmp_tested_p
)
4424 setjmp_tested_p
= 1;
4427 #endif /* GC_SETJMP_WORKS */
4430 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4431 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4433 /* This assumes that the stack is a contiguous region in memory. If
4434 that's not the case, something has to be done here to iterate
4435 over the stack segments. */
4436 #ifndef GC_LISP_OBJECT_ALIGNMENT
4438 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4440 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4443 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4444 mark_memory (stack_base
, end
, i
);
4445 /* Allow for marking a secondary stack, like the register stack on the
4447 #ifdef GC_MARK_SECONDARY_STACK
4448 GC_MARK_SECONDARY_STACK ();
4451 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4456 #endif /* GC_MARK_STACK != 0 */
4459 /* Determine whether it is safe to access memory at address P. */
4461 valid_pointer_p (void *p
)
4464 return w32_valid_pointer_p (p
, 16);
4468 /* Obviously, we cannot just access it (we would SEGV trying), so we
4469 trick the o/s to tell us whether p is a valid pointer.
4470 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4471 not validate p in that case. */
4473 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4475 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4477 unlink ("__Valid__Lisp__Object__");
4485 /* Return 1 if OBJ is a valid lisp object.
4486 Return 0 if OBJ is NOT a valid lisp object.
4487 Return -1 if we cannot validate OBJ.
4488 This function can be quite slow,
4489 so it should only be used in code for manual debugging. */
4492 valid_lisp_object_p (Lisp_Object obj
)
4502 p
= (void *) XPNTR (obj
);
4503 if (PURE_POINTER_P (p
))
4507 return valid_pointer_p (p
);
4514 int valid
= valid_pointer_p (p
);
4526 case MEM_TYPE_NON_LISP
:
4529 case MEM_TYPE_BUFFER
:
4530 return live_buffer_p (m
, p
);
4533 return live_cons_p (m
, p
);
4535 case MEM_TYPE_STRING
:
4536 return live_string_p (m
, p
);
4539 return live_misc_p (m
, p
);
4541 case MEM_TYPE_SYMBOL
:
4542 return live_symbol_p (m
, p
);
4544 case MEM_TYPE_FLOAT
:
4545 return live_float_p (m
, p
);
4547 case MEM_TYPE_VECTORLIKE
:
4548 return live_vector_p (m
, p
);
4561 /***********************************************************************
4562 Pure Storage Management
4563 ***********************************************************************/
4565 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4566 pointer to it. TYPE is the Lisp type for which the memory is
4567 allocated. TYPE < 0 means it's not used for a Lisp object. */
4569 static POINTER_TYPE
*
4570 pure_alloc (size_t size
, int type
)
4572 POINTER_TYPE
*result
;
4574 size_t alignment
= (1 << GCTYPEBITS
);
4576 size_t alignment
= sizeof (EMACS_INT
);
4578 /* Give Lisp_Floats an extra alignment. */
4579 if (type
== Lisp_Float
)
4581 #if defined __GNUC__ && __GNUC__ >= 2
4582 alignment
= __alignof (struct Lisp_Float
);
4584 alignment
= sizeof (struct Lisp_Float
);
4592 /* Allocate space for a Lisp object from the beginning of the free
4593 space with taking account of alignment. */
4594 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4595 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4599 /* Allocate space for a non-Lisp object from the end of the free
4601 pure_bytes_used_non_lisp
+= size
;
4602 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4604 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4606 if (pure_bytes_used
<= pure_size
)
4609 /* Don't allocate a large amount here,
4610 because it might get mmap'd and then its address
4611 might not be usable. */
4612 purebeg
= (char *) xmalloc (10000);
4614 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4615 pure_bytes_used
= 0;
4616 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4621 /* Print a warning if PURESIZE is too small. */
4624 check_pure_size (void)
4626 if (pure_bytes_used_before_overflow
)
4627 message ("emacs:0:Pure Lisp storage overflow (approx. %d bytes needed)",
4628 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4632 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4633 the non-Lisp data pool of the pure storage, and return its start
4634 address. Return NULL if not found. */
4637 find_string_data_in_pure (const char *data
, int nbytes
)
4639 int i
, skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4640 const unsigned char *p
;
4643 if (pure_bytes_used_non_lisp
< nbytes
+ 1)
4646 /* Set up the Boyer-Moore table. */
4648 for (i
= 0; i
< 256; i
++)
4651 p
= (const unsigned char *) data
;
4653 bm_skip
[*p
++] = skip
;
4655 last_char_skip
= bm_skip
['\0'];
4657 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4658 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4660 /* See the comments in the function `boyer_moore' (search.c) for the
4661 use of `infinity'. */
4662 infinity
= pure_bytes_used_non_lisp
+ 1;
4663 bm_skip
['\0'] = infinity
;
4665 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
4669 /* Check the last character (== '\0'). */
4672 start
+= bm_skip
[*(p
+ start
)];
4674 while (start
<= start_max
);
4676 if (start
< infinity
)
4677 /* Couldn't find the last character. */
4680 /* No less than `infinity' means we could find the last
4681 character at `p[start - infinity]'. */
4684 /* Check the remaining characters. */
4685 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4687 return non_lisp_beg
+ start
;
4689 start
+= last_char_skip
;
4691 while (start
<= start_max
);
4697 /* Return a string allocated in pure space. DATA is a buffer holding
4698 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4699 non-zero means make the result string multibyte.
4701 Must get an error if pure storage is full, since if it cannot hold
4702 a large string it may be able to hold conses that point to that
4703 string; then the string is not protected from gc. */
4706 make_pure_string (const char *data
, int nchars
, int nbytes
, int multibyte
)
4709 struct Lisp_String
*s
;
4711 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4712 s
->data
= find_string_data_in_pure (data
, nbytes
);
4713 if (s
->data
== NULL
)
4715 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4716 bcopy (data
, s
->data
, nbytes
);
4717 s
->data
[nbytes
] = '\0';
4720 s
->size_byte
= multibyte
? nbytes
: -1;
4721 s
->intervals
= NULL_INTERVAL
;
4722 XSETSTRING (string
, s
);
4726 /* Return a string a string allocated in pure space. Do not allocate
4727 the string data, just point to DATA. */
4730 make_pure_c_string (const char *data
)
4733 struct Lisp_String
*s
;
4734 int nchars
= strlen (data
);
4736 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4739 s
->data
= (unsigned char *) data
;
4740 s
->intervals
= NULL_INTERVAL
;
4741 XSETSTRING (string
, s
);
4745 /* Return a cons allocated from pure space. Give it pure copies
4746 of CAR as car and CDR as cdr. */
4749 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
4751 register Lisp_Object
new;
4752 struct Lisp_Cons
*p
;
4754 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4756 XSETCAR (new, Fpurecopy (car
));
4757 XSETCDR (new, Fpurecopy (cdr
));
4762 /* Value is a float object with value NUM allocated from pure space. */
4765 make_pure_float (double num
)
4767 register Lisp_Object
new;
4768 struct Lisp_Float
*p
;
4770 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4772 XFLOAT_INIT (new, num
);
4777 /* Return a vector with room for LEN Lisp_Objects allocated from
4781 make_pure_vector (EMACS_INT len
)
4784 struct Lisp_Vector
*p
;
4785 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4787 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4788 XSETVECTOR (new, p
);
4789 XVECTOR (new)->size
= len
;
4794 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4795 doc
: /* Make a copy of object OBJ in pure storage.
4796 Recursively copies contents of vectors and cons cells.
4797 Does not copy symbols. Copies strings without text properties. */)
4799 register Lisp_Object obj
;
4801 if (NILP (Vpurify_flag
))
4804 if (PURE_POINTER_P (XPNTR (obj
)))
4807 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4809 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
4815 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
4816 else if (FLOATP (obj
))
4817 obj
= make_pure_float (XFLOAT_DATA (obj
));
4818 else if (STRINGP (obj
))
4819 obj
= make_pure_string (SDATA (obj
), SCHARS (obj
),
4821 STRING_MULTIBYTE (obj
));
4822 else if (COMPILEDP (obj
) || VECTORP (obj
))
4824 register struct Lisp_Vector
*vec
;
4828 size
= XVECTOR (obj
)->size
;
4829 if (size
& PSEUDOVECTOR_FLAG
)
4830 size
&= PSEUDOVECTOR_SIZE_MASK
;
4831 vec
= XVECTOR (make_pure_vector (size
));
4832 for (i
= 0; i
< size
; i
++)
4833 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4834 if (COMPILEDP (obj
))
4836 XSETPVECTYPE (vec
, PVEC_COMPILED
);
4837 XSETCOMPILED (obj
, vec
);
4840 XSETVECTOR (obj
, vec
);
4842 else if (MARKERP (obj
))
4843 error ("Attempt to copy a marker to pure storage");
4845 /* Not purified, don't hash-cons. */
4848 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4849 Fputhash (obj
, obj
, Vpurify_flag
);
4856 /***********************************************************************
4858 ***********************************************************************/
4860 /* Put an entry in staticvec, pointing at the variable with address
4864 staticpro (Lisp_Object
*varaddress
)
4866 staticvec
[staticidx
++] = varaddress
;
4867 if (staticidx
>= NSTATICS
)
4872 /***********************************************************************
4874 ***********************************************************************/
4876 /* Temporarily prevent garbage collection. */
4879 inhibit_garbage_collection (void)
4881 int count
= SPECPDL_INDEX ();
4882 int nbits
= min (VALBITS
, BITS_PER_INT
);
4884 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4889 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4890 doc
: /* Reclaim storage for Lisp objects no longer needed.
4891 Garbage collection happens automatically if you cons more than
4892 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4893 `garbage-collect' normally returns a list with info on amount of space in use:
4894 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4895 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4896 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4897 (USED-STRINGS . FREE-STRINGS))
4898 However, if there was overflow in pure space, `garbage-collect'
4899 returns nil, because real GC can't be done. */)
4902 register struct specbinding
*bind
;
4903 struct catchtag
*catch;
4904 struct handler
*handler
;
4905 char stack_top_variable
;
4908 Lisp_Object total
[8];
4909 int count
= SPECPDL_INDEX ();
4910 EMACS_TIME t1
, t2
, t3
;
4915 /* Can't GC if pure storage overflowed because we can't determine
4916 if something is a pure object or not. */
4917 if (pure_bytes_used_before_overflow
)
4922 /* Don't keep undo information around forever.
4923 Do this early on, so it is no problem if the user quits. */
4925 register struct buffer
*nextb
= all_buffers
;
4929 /* If a buffer's undo list is Qt, that means that undo is
4930 turned off in that buffer. Calling truncate_undo_list on
4931 Qt tends to return NULL, which effectively turns undo back on.
4932 So don't call truncate_undo_list if undo_list is Qt. */
4933 if (! NILP (nextb
->name
) && ! EQ (nextb
->undo_list
, Qt
))
4934 truncate_undo_list (nextb
);
4936 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4937 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
)
4938 && ! nextb
->text
->inhibit_shrinking
)
4940 /* If a buffer's gap size is more than 10% of the buffer
4941 size, or larger than 2000 bytes, then shrink it
4942 accordingly. Keep a minimum size of 20 bytes. */
4943 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4945 if (nextb
->text
->gap_size
> size
)
4947 struct buffer
*save_current
= current_buffer
;
4948 current_buffer
= nextb
;
4949 make_gap (-(nextb
->text
->gap_size
- size
));
4950 current_buffer
= save_current
;
4954 nextb
= nextb
->next
;
4958 EMACS_GET_TIME (t1
);
4960 /* In case user calls debug_print during GC,
4961 don't let that cause a recursive GC. */
4962 consing_since_gc
= 0;
4964 /* Save what's currently displayed in the echo area. */
4965 message_p
= push_message ();
4966 record_unwind_protect (pop_message_unwind
, Qnil
);
4968 /* Save a copy of the contents of the stack, for debugging. */
4969 #if MAX_SAVE_STACK > 0
4970 if (NILP (Vpurify_flag
))
4972 i
= &stack_top_variable
- stack_bottom
;
4974 if (i
< MAX_SAVE_STACK
)
4976 if (stack_copy
== 0)
4977 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
4978 else if (stack_copy_size
< i
)
4979 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
4982 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
4983 bcopy (stack_bottom
, stack_copy
, i
);
4985 bcopy (&stack_top_variable
, stack_copy
, i
);
4989 #endif /* MAX_SAVE_STACK > 0 */
4991 if (garbage_collection_messages
)
4992 message1_nolog ("Garbage collecting...");
4996 shrink_regexp_cache ();
5000 /* clear_marks (); */
5002 /* Mark all the special slots that serve as the roots of accessibility. */
5004 for (i
= 0; i
< staticidx
; i
++)
5005 mark_object (*staticvec
[i
]);
5007 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
5009 mark_object (bind
->symbol
);
5010 mark_object (bind
->old_value
);
5018 extern void xg_mark_data (void);
5023 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5024 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5028 register struct gcpro
*tail
;
5029 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5030 for (i
= 0; i
< tail
->nvars
; i
++)
5031 mark_object (tail
->var
[i
]);
5036 for (catch = catchlist
; catch; catch = catch->next
)
5038 mark_object (catch->tag
);
5039 mark_object (catch->val
);
5041 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5043 mark_object (handler
->handler
);
5044 mark_object (handler
->var
);
5048 #ifdef HAVE_WINDOW_SYSTEM
5049 mark_fringe_data ();
5052 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5056 /* Everything is now marked, except for the things that require special
5057 finalization, i.e. the undo_list.
5058 Look thru every buffer's undo list
5059 for elements that update markers that were not marked,
5062 register struct buffer
*nextb
= all_buffers
;
5066 /* If a buffer's undo list is Qt, that means that undo is
5067 turned off in that buffer. Calling truncate_undo_list on
5068 Qt tends to return NULL, which effectively turns undo back on.
5069 So don't call truncate_undo_list if undo_list is Qt. */
5070 if (! EQ (nextb
->undo_list
, Qt
))
5072 Lisp_Object tail
, prev
;
5073 tail
= nextb
->undo_list
;
5075 while (CONSP (tail
))
5077 if (CONSP (XCAR (tail
))
5078 && MARKERP (XCAR (XCAR (tail
)))
5079 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5082 nextb
->undo_list
= tail
= XCDR (tail
);
5086 XSETCDR (prev
, tail
);
5096 /* Now that we have stripped the elements that need not be in the
5097 undo_list any more, we can finally mark the list. */
5098 mark_object (nextb
->undo_list
);
5100 nextb
= nextb
->next
;
5106 /* Clear the mark bits that we set in certain root slots. */
5108 unmark_byte_stack ();
5109 VECTOR_UNMARK (&buffer_defaults
);
5110 VECTOR_UNMARK (&buffer_local_symbols
);
5112 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5120 /* clear_marks (); */
5123 consing_since_gc
= 0;
5124 if (gc_cons_threshold
< 10000)
5125 gc_cons_threshold
= 10000;
5127 if (FLOATP (Vgc_cons_percentage
))
5128 { /* Set gc_cons_combined_threshold. */
5129 EMACS_INT total
= 0;
5131 total
+= total_conses
* sizeof (struct Lisp_Cons
);
5132 total
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5133 total
+= total_markers
* sizeof (union Lisp_Misc
);
5134 total
+= total_string_size
;
5135 total
+= total_vector_size
* sizeof (Lisp_Object
);
5136 total
+= total_floats
* sizeof (struct Lisp_Float
);
5137 total
+= total_intervals
* sizeof (struct interval
);
5138 total
+= total_strings
* sizeof (struct Lisp_String
);
5140 gc_relative_threshold
= total
* XFLOAT_DATA (Vgc_cons_percentage
);
5143 gc_relative_threshold
= 0;
5145 if (garbage_collection_messages
)
5147 if (message_p
|| minibuf_level
> 0)
5150 message1_nolog ("Garbage collecting...done");
5153 unbind_to (count
, Qnil
);
5155 total
[0] = Fcons (make_number (total_conses
),
5156 make_number (total_free_conses
));
5157 total
[1] = Fcons (make_number (total_symbols
),
5158 make_number (total_free_symbols
));
5159 total
[2] = Fcons (make_number (total_markers
),
5160 make_number (total_free_markers
));
5161 total
[3] = make_number (total_string_size
);
5162 total
[4] = make_number (total_vector_size
);
5163 total
[5] = Fcons (make_number (total_floats
),
5164 make_number (total_free_floats
));
5165 total
[6] = Fcons (make_number (total_intervals
),
5166 make_number (total_free_intervals
));
5167 total
[7] = Fcons (make_number (total_strings
),
5168 make_number (total_free_strings
));
5170 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5172 /* Compute average percentage of zombies. */
5175 for (i
= 0; i
< 7; ++i
)
5176 if (CONSP (total
[i
]))
5177 nlive
+= XFASTINT (XCAR (total
[i
]));
5179 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5180 max_live
= max (nlive
, max_live
);
5181 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5182 max_zombies
= max (nzombies
, max_zombies
);
5187 if (!NILP (Vpost_gc_hook
))
5189 int count
= inhibit_garbage_collection ();
5190 safe_run_hooks (Qpost_gc_hook
);
5191 unbind_to (count
, Qnil
);
5194 /* Accumulate statistics. */
5195 EMACS_GET_TIME (t2
);
5196 EMACS_SUB_TIME (t3
, t2
, t1
);
5197 if (FLOATP (Vgc_elapsed
))
5198 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5200 EMACS_USECS (t3
) * 1.0e-6);
5203 return Flist (sizeof total
/ sizeof *total
, total
);
5207 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5208 only interesting objects referenced from glyphs are strings. */
5211 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5213 struct glyph_row
*row
= matrix
->rows
;
5214 struct glyph_row
*end
= row
+ matrix
->nrows
;
5216 for (; row
< end
; ++row
)
5220 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5222 struct glyph
*glyph
= row
->glyphs
[area
];
5223 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5225 for (; glyph
< end_glyph
; ++glyph
)
5226 if (STRINGP (glyph
->object
)
5227 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5228 mark_object (glyph
->object
);
5234 /* Mark Lisp faces in the face cache C. */
5237 mark_face_cache (struct face_cache
*c
)
5242 for (i
= 0; i
< c
->used
; ++i
)
5244 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5248 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5249 mark_object (face
->lface
[j
]);
5257 /* Mark reference to a Lisp_Object.
5258 If the object referred to has not been seen yet, recursively mark
5259 all the references contained in it. */
5261 #define LAST_MARKED_SIZE 500
5262 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5263 int last_marked_index
;
5265 /* For debugging--call abort when we cdr down this many
5266 links of a list, in mark_object. In debugging,
5267 the call to abort will hit a breakpoint.
5268 Normally this is zero and the check never goes off. */
5269 static int mark_object_loop_halt
;
5272 mark_vectorlike (struct Lisp_Vector
*ptr
)
5274 register EMACS_INT size
= ptr
->size
;
5277 eassert (!VECTOR_MARKED_P (ptr
));
5278 VECTOR_MARK (ptr
); /* Else mark it */
5279 if (size
& PSEUDOVECTOR_FLAG
)
5280 size
&= PSEUDOVECTOR_SIZE_MASK
;
5282 /* Note that this size is not the memory-footprint size, but only
5283 the number of Lisp_Object fields that we should trace.
5284 The distinction is used e.g. by Lisp_Process which places extra
5285 non-Lisp_Object fields at the end of the structure. */
5286 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5287 mark_object (ptr
->contents
[i
]);
5290 /* Like mark_vectorlike but optimized for char-tables (and
5291 sub-char-tables) assuming that the contents are mostly integers or
5295 mark_char_table (struct Lisp_Vector
*ptr
)
5297 register EMACS_INT size
= ptr
->size
& PSEUDOVECTOR_SIZE_MASK
;
5300 eassert (!VECTOR_MARKED_P (ptr
));
5302 for (i
= 0; i
< size
; i
++)
5304 Lisp_Object val
= ptr
->contents
[i
];
5306 if (INTEGERP (val
) || SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
)
5308 if (SUB_CHAR_TABLE_P (val
))
5310 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5311 mark_char_table (XVECTOR (val
));
5319 mark_object (Lisp_Object arg
)
5321 register Lisp_Object obj
= arg
;
5322 #ifdef GC_CHECK_MARKED_OBJECTS
5330 if (PURE_POINTER_P (XPNTR (obj
)))
5333 last_marked
[last_marked_index
++] = obj
;
5334 if (last_marked_index
== LAST_MARKED_SIZE
)
5335 last_marked_index
= 0;
5337 /* Perform some sanity checks on the objects marked here. Abort if
5338 we encounter an object we know is bogus. This increases GC time
5339 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5340 #ifdef GC_CHECK_MARKED_OBJECTS
5342 po
= (void *) XPNTR (obj
);
5344 /* Check that the object pointed to by PO is known to be a Lisp
5345 structure allocated from the heap. */
5346 #define CHECK_ALLOCATED() \
5348 m = mem_find (po); \
5353 /* Check that the object pointed to by PO is live, using predicate
5355 #define CHECK_LIVE(LIVEP) \
5357 if (!LIVEP (m, po)) \
5361 /* Check both of the above conditions. */
5362 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5364 CHECK_ALLOCATED (); \
5365 CHECK_LIVE (LIVEP); \
5368 #else /* not GC_CHECK_MARKED_OBJECTS */
5370 #define CHECK_ALLOCATED() (void) 0
5371 #define CHECK_LIVE(LIVEP) (void) 0
5372 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5374 #endif /* not GC_CHECK_MARKED_OBJECTS */
5376 switch (SWITCH_ENUM_CAST (XTYPE (obj
)))
5380 register struct Lisp_String
*ptr
= XSTRING (obj
);
5381 if (STRING_MARKED_P (ptr
))
5383 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5384 MARK_INTERVAL_TREE (ptr
->intervals
);
5386 #ifdef GC_CHECK_STRING_BYTES
5387 /* Check that the string size recorded in the string is the
5388 same as the one recorded in the sdata structure. */
5389 CHECK_STRING_BYTES (ptr
);
5390 #endif /* GC_CHECK_STRING_BYTES */
5394 case Lisp_Vectorlike
:
5395 if (VECTOR_MARKED_P (XVECTOR (obj
)))
5397 #ifdef GC_CHECK_MARKED_OBJECTS
5399 if (m
== MEM_NIL
&& !SUBRP (obj
)
5400 && po
!= &buffer_defaults
5401 && po
!= &buffer_local_symbols
)
5403 #endif /* GC_CHECK_MARKED_OBJECTS */
5407 #ifdef GC_CHECK_MARKED_OBJECTS
5408 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5411 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
5416 #endif /* GC_CHECK_MARKED_OBJECTS */
5419 else if (SUBRP (obj
))
5421 else if (COMPILEDP (obj
))
5422 /* We could treat this just like a vector, but it is better to
5423 save the COMPILED_CONSTANTS element for last and avoid
5426 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5427 register EMACS_INT size
= ptr
->size
;
5430 CHECK_LIVE (live_vector_p
);
5431 VECTOR_MARK (ptr
); /* Else mark it */
5432 size
&= PSEUDOVECTOR_SIZE_MASK
;
5433 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5435 if (i
!= COMPILED_CONSTANTS
)
5436 mark_object (ptr
->contents
[i
]);
5438 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5441 else if (FRAMEP (obj
))
5443 register struct frame
*ptr
= XFRAME (obj
);
5444 mark_vectorlike (XVECTOR (obj
));
5445 mark_face_cache (ptr
->face_cache
);
5447 else if (WINDOWP (obj
))
5449 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5450 struct window
*w
= XWINDOW (obj
);
5451 mark_vectorlike (ptr
);
5452 /* Mark glyphs for leaf windows. Marking window matrices is
5453 sufficient because frame matrices use the same glyph
5455 if (NILP (w
->hchild
)
5457 && w
->current_matrix
)
5459 mark_glyph_matrix (w
->current_matrix
);
5460 mark_glyph_matrix (w
->desired_matrix
);
5463 else if (HASH_TABLE_P (obj
))
5465 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5466 mark_vectorlike ((struct Lisp_Vector
*)h
);
5467 /* If hash table is not weak, mark all keys and values.
5468 For weak tables, mark only the vector. */
5470 mark_object (h
->key_and_value
);
5472 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5474 else if (CHAR_TABLE_P (obj
))
5475 mark_char_table (XVECTOR (obj
));
5477 mark_vectorlike (XVECTOR (obj
));
5482 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5483 struct Lisp_Symbol
*ptrx
;
5487 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5489 mark_object (ptr
->function
);
5490 mark_object (ptr
->plist
);
5491 switch (ptr
->redirect
)
5493 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
5494 case SYMBOL_VARALIAS
:
5497 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
5501 case SYMBOL_LOCALIZED
:
5503 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
5504 /* If the value is forwarded to a buffer or keyboard field,
5505 these are marked when we see the corresponding object.
5506 And if it's forwarded to a C variable, either it's not
5507 a Lisp_Object var, or it's staticpro'd already. */
5508 mark_object (blv
->where
);
5509 mark_object (blv
->valcell
);
5510 mark_object (blv
->defcell
);
5513 case SYMBOL_FORWARDED
:
5514 /* If the value is forwarded to a buffer or keyboard field,
5515 these are marked when we see the corresponding object.
5516 And if it's forwarded to a C variable, either it's not
5517 a Lisp_Object var, or it's staticpro'd already. */
5521 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5522 MARK_STRING (XSTRING (ptr
->xname
));
5523 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5528 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5529 XSETSYMBOL (obj
, ptrx
);
5536 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5537 if (XMISCANY (obj
)->gcmarkbit
)
5539 XMISCANY (obj
)->gcmarkbit
= 1;
5541 switch (XMISCTYPE (obj
))
5544 case Lisp_Misc_Marker
:
5545 /* DO NOT mark thru the marker's chain.
5546 The buffer's markers chain does not preserve markers from gc;
5547 instead, markers are removed from the chain when freed by gc. */
5550 case Lisp_Misc_Save_Value
:
5553 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5554 /* If DOGC is set, POINTER is the address of a memory
5555 area containing INTEGER potential Lisp_Objects. */
5558 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5560 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5561 mark_maybe_object (*p
);
5567 case Lisp_Misc_Overlay
:
5569 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5570 mark_object (ptr
->start
);
5571 mark_object (ptr
->end
);
5572 mark_object (ptr
->plist
);
5575 XSETMISC (obj
, ptr
->next
);
5588 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5589 if (CONS_MARKED_P (ptr
))
5591 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5593 /* If the cdr is nil, avoid recursion for the car. */
5594 if (EQ (ptr
->u
.cdr
, Qnil
))
5600 mark_object (ptr
->car
);
5603 if (cdr_count
== mark_object_loop_halt
)
5609 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5610 FLOAT_MARK (XFLOAT (obj
));
5621 #undef CHECK_ALLOCATED
5622 #undef CHECK_ALLOCATED_AND_LIVE
5625 /* Mark the pointers in a buffer structure. */
5628 mark_buffer (Lisp_Object buf
)
5630 register struct buffer
*buffer
= XBUFFER (buf
);
5631 register Lisp_Object
*ptr
, tmp
;
5632 Lisp_Object base_buffer
;
5634 eassert (!VECTOR_MARKED_P (buffer
));
5635 VECTOR_MARK (buffer
);
5637 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5639 /* For now, we just don't mark the undo_list. It's done later in
5640 a special way just before the sweep phase, and after stripping
5641 some of its elements that are not needed any more. */
5643 if (buffer
->overlays_before
)
5645 XSETMISC (tmp
, buffer
->overlays_before
);
5648 if (buffer
->overlays_after
)
5650 XSETMISC (tmp
, buffer
->overlays_after
);
5654 /* buffer-local Lisp variables start at `undo_list',
5655 tho only the ones from `name' on are GC'd normally. */
5656 for (ptr
= &buffer
->name
;
5657 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5661 /* If this is an indirect buffer, mark its base buffer. */
5662 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5664 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5665 mark_buffer (base_buffer
);
5669 /* Mark the Lisp pointers in the terminal objects.
5670 Called by the Fgarbage_collector. */
5673 mark_terminals (void)
5676 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5678 eassert (t
->name
!= NULL
);
5679 if (!VECTOR_MARKED_P (t
))
5681 #ifdef HAVE_WINDOW_SYSTEM
5682 mark_image_cache (t
->image_cache
);
5683 #endif /* HAVE_WINDOW_SYSTEM */
5684 mark_vectorlike ((struct Lisp_Vector
*)t
);
5691 /* Value is non-zero if OBJ will survive the current GC because it's
5692 either marked or does not need to be marked to survive. */
5695 survives_gc_p (Lisp_Object obj
)
5699 switch (XTYPE (obj
))
5706 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5710 survives_p
= XMISCANY (obj
)->gcmarkbit
;
5714 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5717 case Lisp_Vectorlike
:
5718 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5722 survives_p
= CONS_MARKED_P (XCONS (obj
));
5726 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5733 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5738 /* Sweep: find all structures not marked, and free them. */
5743 /* Remove or mark entries in weak hash tables.
5744 This must be done before any object is unmarked. */
5745 sweep_weak_hash_tables ();
5748 #ifdef GC_CHECK_STRING_BYTES
5749 if (!noninteractive
)
5750 check_string_bytes (1);
5753 /* Put all unmarked conses on free list */
5755 register struct cons_block
*cblk
;
5756 struct cons_block
**cprev
= &cons_block
;
5757 register int lim
= cons_block_index
;
5758 register int num_free
= 0, num_used
= 0;
5762 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5766 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
5768 /* Scan the mark bits an int at a time. */
5769 for (i
= 0; i
<= ilim
; i
++)
5771 if (cblk
->gcmarkbits
[i
] == -1)
5773 /* Fast path - all cons cells for this int are marked. */
5774 cblk
->gcmarkbits
[i
] = 0;
5775 num_used
+= BITS_PER_INT
;
5779 /* Some cons cells for this int are not marked.
5780 Find which ones, and free them. */
5781 int start
, pos
, stop
;
5783 start
= i
* BITS_PER_INT
;
5785 if (stop
> BITS_PER_INT
)
5786 stop
= BITS_PER_INT
;
5789 for (pos
= start
; pos
< stop
; pos
++)
5791 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
5794 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
5795 cons_free_list
= &cblk
->conses
[pos
];
5797 cons_free_list
->car
= Vdead
;
5803 CONS_UNMARK (&cblk
->conses
[pos
]);
5809 lim
= CONS_BLOCK_SIZE
;
5810 /* If this block contains only free conses and we have already
5811 seen more than two blocks worth of free conses then deallocate
5813 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5815 *cprev
= cblk
->next
;
5816 /* Unhook from the free list. */
5817 cons_free_list
= cblk
->conses
[0].u
.chain
;
5818 lisp_align_free (cblk
);
5823 num_free
+= this_free
;
5824 cprev
= &cblk
->next
;
5827 total_conses
= num_used
;
5828 total_free_conses
= num_free
;
5831 /* Put all unmarked floats on free list */
5833 register struct float_block
*fblk
;
5834 struct float_block
**fprev
= &float_block
;
5835 register int lim
= float_block_index
;
5836 register int num_free
= 0, num_used
= 0;
5838 float_free_list
= 0;
5840 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5844 for (i
= 0; i
< lim
; i
++)
5845 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5848 fblk
->floats
[i
].u
.chain
= float_free_list
;
5849 float_free_list
= &fblk
->floats
[i
];
5854 FLOAT_UNMARK (&fblk
->floats
[i
]);
5856 lim
= FLOAT_BLOCK_SIZE
;
5857 /* If this block contains only free floats and we have already
5858 seen more than two blocks worth of free floats then deallocate
5860 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5862 *fprev
= fblk
->next
;
5863 /* Unhook from the free list. */
5864 float_free_list
= fblk
->floats
[0].u
.chain
;
5865 lisp_align_free (fblk
);
5870 num_free
+= this_free
;
5871 fprev
= &fblk
->next
;
5874 total_floats
= num_used
;
5875 total_free_floats
= num_free
;
5878 /* Put all unmarked intervals on free list */
5880 register struct interval_block
*iblk
;
5881 struct interval_block
**iprev
= &interval_block
;
5882 register int lim
= interval_block_index
;
5883 register int num_free
= 0, num_used
= 0;
5885 interval_free_list
= 0;
5887 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5892 for (i
= 0; i
< lim
; i
++)
5894 if (!iblk
->intervals
[i
].gcmarkbit
)
5896 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5897 interval_free_list
= &iblk
->intervals
[i
];
5903 iblk
->intervals
[i
].gcmarkbit
= 0;
5906 lim
= INTERVAL_BLOCK_SIZE
;
5907 /* If this block contains only free intervals and we have already
5908 seen more than two blocks worth of free intervals then
5909 deallocate this block. */
5910 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5912 *iprev
= iblk
->next
;
5913 /* Unhook from the free list. */
5914 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5916 n_interval_blocks
--;
5920 num_free
+= this_free
;
5921 iprev
= &iblk
->next
;
5924 total_intervals
= num_used
;
5925 total_free_intervals
= num_free
;
5928 /* Put all unmarked symbols on free list */
5930 register struct symbol_block
*sblk
;
5931 struct symbol_block
**sprev
= &symbol_block
;
5932 register int lim
= symbol_block_index
;
5933 register int num_free
= 0, num_used
= 0;
5935 symbol_free_list
= NULL
;
5937 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5940 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5941 struct Lisp_Symbol
*end
= sym
+ lim
;
5943 for (; sym
< end
; ++sym
)
5945 /* Check if the symbol was created during loadup. In such a case
5946 it might be pointed to by pure bytecode which we don't trace,
5947 so we conservatively assume that it is live. */
5948 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5950 if (!sym
->gcmarkbit
&& !pure_p
)
5952 if (sym
->redirect
== SYMBOL_LOCALIZED
)
5953 xfree (SYMBOL_BLV (sym
));
5954 sym
->next
= symbol_free_list
;
5955 symbol_free_list
= sym
;
5957 symbol_free_list
->function
= Vdead
;
5965 UNMARK_STRING (XSTRING (sym
->xname
));
5970 lim
= SYMBOL_BLOCK_SIZE
;
5971 /* If this block contains only free symbols and we have already
5972 seen more than two blocks worth of free symbols then deallocate
5974 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5976 *sprev
= sblk
->next
;
5977 /* Unhook from the free list. */
5978 symbol_free_list
= sblk
->symbols
[0].next
;
5984 num_free
+= this_free
;
5985 sprev
= &sblk
->next
;
5988 total_symbols
= num_used
;
5989 total_free_symbols
= num_free
;
5992 /* Put all unmarked misc's on free list.
5993 For a marker, first unchain it from the buffer it points into. */
5995 register struct marker_block
*mblk
;
5996 struct marker_block
**mprev
= &marker_block
;
5997 register int lim
= marker_block_index
;
5998 register int num_free
= 0, num_used
= 0;
6000 marker_free_list
= 0;
6002 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6007 for (i
= 0; i
< lim
; i
++)
6009 if (!mblk
->markers
[i
].u_any
.gcmarkbit
)
6011 if (mblk
->markers
[i
].u_any
.type
== Lisp_Misc_Marker
)
6012 unchain_marker (&mblk
->markers
[i
].u_marker
);
6013 /* Set the type of the freed object to Lisp_Misc_Free.
6014 We could leave the type alone, since nobody checks it,
6015 but this might catch bugs faster. */
6016 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
6017 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
6018 marker_free_list
= &mblk
->markers
[i
];
6024 mblk
->markers
[i
].u_any
.gcmarkbit
= 0;
6027 lim
= MARKER_BLOCK_SIZE
;
6028 /* If this block contains only free markers and we have already
6029 seen more than two blocks worth of free markers then deallocate
6031 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6033 *mprev
= mblk
->next
;
6034 /* Unhook from the free list. */
6035 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
6041 num_free
+= this_free
;
6042 mprev
= &mblk
->next
;
6046 total_markers
= num_used
;
6047 total_free_markers
= num_free
;
6050 /* Free all unmarked buffers */
6052 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6055 if (!VECTOR_MARKED_P (buffer
))
6058 prev
->next
= buffer
->next
;
6060 all_buffers
= buffer
->next
;
6061 next
= buffer
->next
;
6067 VECTOR_UNMARK (buffer
);
6068 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6069 prev
= buffer
, buffer
= buffer
->next
;
6073 /* Free all unmarked vectors */
6075 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6076 total_vector_size
= 0;
6079 if (!VECTOR_MARKED_P (vector
))
6082 prev
->next
= vector
->next
;
6084 all_vectors
= vector
->next
;
6085 next
= vector
->next
;
6093 VECTOR_UNMARK (vector
);
6094 if (vector
->size
& PSEUDOVECTOR_FLAG
)
6095 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
6097 total_vector_size
+= vector
->size
;
6098 prev
= vector
, vector
= vector
->next
;
6102 #ifdef GC_CHECK_STRING_BYTES
6103 if (!noninteractive
)
6104 check_string_bytes (1);
6111 /* Debugging aids. */
6113 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6114 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6115 This may be helpful in debugging Emacs's memory usage.
6116 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6121 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
6126 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6127 doc
: /* Return a list of counters that measure how much consing there has been.
6128 Each of these counters increments for a certain kind of object.
6129 The counters wrap around from the largest positive integer to zero.
6130 Garbage collection does not decrease them.
6131 The elements of the value are as follows:
6132 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6133 All are in units of 1 = one object consed
6134 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6136 MISCS include overlays, markers, and some internal types.
6137 Frames, windows, buffers, and subprocesses count as vectors
6138 (but the contents of a buffer's text do not count here). */)
6141 Lisp_Object consed
[8];
6143 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6144 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6145 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6146 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6147 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6148 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6149 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6150 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6152 return Flist (8, consed
);
6155 int suppress_checking
;
6158 die (const char *msg
, const char *file
, int line
)
6160 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6165 /* Initialization */
6168 init_alloc_once (void)
6170 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6172 pure_size
= PURESIZE
;
6173 pure_bytes_used
= 0;
6174 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6175 pure_bytes_used_before_overflow
= 0;
6177 /* Initialize the list of free aligned blocks. */
6180 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6182 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6186 ignore_warnings
= 1;
6187 #ifdef DOUG_LEA_MALLOC
6188 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6189 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6190 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6198 init_weak_hash_tables ();
6201 malloc_hysteresis
= 32;
6203 malloc_hysteresis
= 0;
6206 refill_memory_reserve ();
6208 ignore_warnings
= 0;
6210 byte_stack_list
= 0;
6212 consing_since_gc
= 0;
6213 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6214 gc_relative_threshold
= 0;
6216 #ifdef VIRT_ADDR_VARIES
6217 malloc_sbrk_unused
= 1<<22; /* A large number */
6218 malloc_sbrk_used
= 100000; /* as reasonable as any number */
6219 #endif /* VIRT_ADDR_VARIES */
6226 byte_stack_list
= 0;
6228 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6229 setjmp_tested_p
= longjmps_done
= 0;
6232 Vgc_elapsed
= make_float (0.0);
6237 syms_of_alloc (void)
6239 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
6240 doc
: /* *Number of bytes of consing between garbage collections.
6241 Garbage collection can happen automatically once this many bytes have been
6242 allocated since the last garbage collection. All data types count.
6244 Garbage collection happens automatically only when `eval' is called.
6246 By binding this temporarily to a large number, you can effectively
6247 prevent garbage collection during a part of the program.
6248 See also `gc-cons-percentage'. */);
6250 DEFVAR_LISP ("gc-cons-percentage", &Vgc_cons_percentage
,
6251 doc
: /* *Portion of the heap used for allocation.
6252 Garbage collection can happen automatically once this portion of the heap
6253 has been allocated since the last garbage collection.
6254 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6255 Vgc_cons_percentage
= make_float (0.1);
6257 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
6258 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6260 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
6261 doc
: /* Number of cons cells that have been consed so far. */);
6263 DEFVAR_INT ("floats-consed", &floats_consed
,
6264 doc
: /* Number of floats that have been consed so far. */);
6266 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
6267 doc
: /* Number of vector cells that have been consed so far. */);
6269 DEFVAR_INT ("symbols-consed", &symbols_consed
,
6270 doc
: /* Number of symbols that have been consed so far. */);
6272 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
6273 doc
: /* Number of string characters that have been consed so far. */);
6275 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
6276 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6278 DEFVAR_INT ("intervals-consed", &intervals_consed
,
6279 doc
: /* Number of intervals that have been consed so far. */);
6281 DEFVAR_INT ("strings-consed", &strings_consed
,
6282 doc
: /* Number of strings that have been consed so far. */);
6284 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
6285 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6286 This means that certain objects should be allocated in shared (pure) space.
6287 It can also be set to a hash-table, in which case this table is used to
6288 do hash-consing of the objects allocated to pure space. */);
6290 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
6291 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6292 garbage_collection_messages
= 0;
6294 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
6295 doc
: /* Hook run after garbage collection has finished. */);
6296 Vpost_gc_hook
= Qnil
;
6297 Qpost_gc_hook
= intern_c_string ("post-gc-hook");
6298 staticpro (&Qpost_gc_hook
);
6300 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
6301 doc
: /* Precomputed `signal' argument for memory-full error. */);
6302 /* We build this in advance because if we wait until we need it, we might
6303 not be able to allocate the memory to hold it. */
6305 = pure_cons (Qerror
,
6306 pure_cons (make_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"), Qnil
));
6308 DEFVAR_LISP ("memory-full", &Vmemory_full
,
6309 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6310 Vmemory_full
= Qnil
;
6312 staticpro (&Qgc_cons_threshold
);
6313 Qgc_cons_threshold
= intern_c_string ("gc-cons-threshold");
6315 staticpro (&Qchar_table_extra_slots
);
6316 Qchar_table_extra_slots
= intern_c_string ("char-table-extra-slots");
6318 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
6319 doc
: /* Accumulated time elapsed in garbage collections.
6320 The time is in seconds as a floating point value. */);
6321 DEFVAR_INT ("gcs-done", &gcs_done
,
6322 doc
: /* Accumulated number of garbage collections done. */);
6327 defsubr (&Smake_byte_code
);
6328 defsubr (&Smake_list
);
6329 defsubr (&Smake_vector
);
6330 defsubr (&Smake_string
);
6331 defsubr (&Smake_bool_vector
);
6332 defsubr (&Smake_symbol
);
6333 defsubr (&Smake_marker
);
6334 defsubr (&Spurecopy
);
6335 defsubr (&Sgarbage_collect
);
6336 defsubr (&Smemory_limit
);
6337 defsubr (&Smemory_use_counts
);
6339 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6340 defsubr (&Sgc_status
);
6344 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
6345 (do not change this comment) */