1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
2 Copyright (C) 1985-1986, 1988, 1993-1995, 1997-2011
3 Free Software Foundation, Inc.
5 This file is part of GNU Emacs.
7 GNU Emacs is free software: you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation, either version 3 of the License, or
10 (at your option) any later version.
12 GNU Emacs is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>. */
22 #include <limits.h> /* For CHAR_BIT. */
31 #ifdef HAVE_GTK_AND_PTHREAD
35 /* This file is part of the core Lisp implementation, and thus must
36 deal with the real data structures. If the Lisp implementation is
37 replaced, this file likely will not be used. */
39 #undef HIDE_LISP_IMPLEMENTATION
42 #include "intervals.h"
48 #include "blockinput.h"
49 #include "character.h"
50 #include "syssignal.h"
51 #include "termhooks.h" /* For struct terminal. */
54 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
55 memory. Can do this only if using gmalloc.c. */
57 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
58 #undef GC_MALLOC_CHECK
63 extern POINTER_TYPE
*sbrk ();
72 #ifdef DOUG_LEA_MALLOC
75 /* malloc.h #defines this as size_t, at least in glibc2. */
76 #ifndef __malloc_size_t
77 #define __malloc_size_t int
80 /* Specify maximum number of areas to mmap. It would be nice to use a
81 value that explicitly means "no limit". */
83 #define MMAP_MAX_AREAS 100000000
85 #else /* not DOUG_LEA_MALLOC */
87 /* The following come from gmalloc.c. */
89 #define __malloc_size_t size_t
90 extern __malloc_size_t _bytes_used
;
91 extern __malloc_size_t __malloc_extra_blocks
;
93 #endif /* not DOUG_LEA_MALLOC */
95 #if ! defined SYSTEM_MALLOC && ! defined SYNC_INPUT
96 #ifdef HAVE_GTK_AND_PTHREAD
98 /* When GTK uses the file chooser dialog, different backends can be loaded
99 dynamically. One such a backend is the Gnome VFS backend that gets loaded
100 if you run Gnome. That backend creates several threads and also allocates
103 If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_*
104 functions below are called from malloc, there is a chance that one
105 of these threads preempts the Emacs main thread and the hook variables
106 end up in an inconsistent state. So we have a mutex to prevent that (note
107 that the backend handles concurrent access to malloc within its own threads
108 but Emacs code running in the main thread is not included in that control).
110 When UNBLOCK_INPUT is called, reinvoke_input_signal may be called. If this
111 happens in one of the backend threads we will have two threads that tries
112 to run Emacs code at once, and the code is not prepared for that.
113 To prevent that, we only call BLOCK/UNBLOCK from the main thread. */
115 static pthread_mutex_t alloc_mutex
;
117 #define BLOCK_INPUT_ALLOC \
120 if (pthread_equal (pthread_self (), main_thread)) \
122 pthread_mutex_lock (&alloc_mutex); \
125 #define UNBLOCK_INPUT_ALLOC \
128 pthread_mutex_unlock (&alloc_mutex); \
129 if (pthread_equal (pthread_self (), main_thread)) \
134 #else /* ! defined HAVE_GTK_AND_PTHREAD */
136 #define BLOCK_INPUT_ALLOC BLOCK_INPUT
137 #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT
139 #endif /* ! defined HAVE_GTK_AND_PTHREAD */
140 #endif /* ! defined SYSTEM_MALLOC && ! defined SYNC_INPUT */
142 /* Value of _bytes_used, when spare_memory was freed. */
144 static __malloc_size_t bytes_used_when_full
;
146 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
147 to a struct Lisp_String. */
149 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
150 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
151 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
153 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
154 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
155 #define VECTOR_MARKED_P(V) (((V)->size & ARRAY_MARK_FLAG) != 0)
157 /* Value is the number of bytes of S, a pointer to a struct Lisp_String.
158 Be careful during GC, because S->size contains the mark bit for
161 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
163 /* Global variables. */
164 struct emacs_globals globals
;
166 /* Number of bytes of consing done since the last gc. */
168 int consing_since_gc
;
170 /* Similar minimum, computed from Vgc_cons_percentage. */
172 EMACS_INT gc_relative_threshold
;
174 /* Minimum number of bytes of consing since GC before next GC,
175 when memory is full. */
177 EMACS_INT memory_full_cons_threshold
;
179 /* Nonzero during GC. */
183 /* Nonzero means abort if try to GC.
184 This is for code which is written on the assumption that
185 no GC will happen, so as to verify that assumption. */
189 /* Number of live and free conses etc. */
191 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
192 static int total_free_conses
, total_free_markers
, total_free_symbols
;
193 static int total_free_floats
, total_floats
;
195 /* Points to memory space allocated as "spare", to be freed if we run
196 out of memory. We keep one large block, four cons-blocks, and
197 two string blocks. */
199 static char *spare_memory
[7];
201 /* Amount of spare memory to keep in large reserve block. */
203 #define SPARE_MEMORY (1 << 14)
205 /* Number of extra blocks malloc should get when it needs more core. */
207 static int malloc_hysteresis
;
209 /* Initialize it to a nonzero value to force it into data space
210 (rather than bss space). That way unexec will remap it into text
211 space (pure), on some systems. We have not implemented the
212 remapping on more recent systems because this is less important
213 nowadays than in the days of small memories and timesharing. */
215 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
216 #define PUREBEG (char *) pure
218 /* Pointer to the pure area, and its size. */
220 static char *purebeg
;
221 static size_t pure_size
;
223 /* Number of bytes of pure storage used before pure storage overflowed.
224 If this is non-zero, this implies that an overflow occurred. */
226 static size_t pure_bytes_used_before_overflow
;
228 /* Value is non-zero if P points into pure space. */
230 #define PURE_POINTER_P(P) \
231 (((PNTR_COMPARISON_TYPE) (P) \
232 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
233 && ((PNTR_COMPARISON_TYPE) (P) \
234 >= (PNTR_COMPARISON_TYPE) purebeg))
236 /* Index in pure at which next pure Lisp object will be allocated.. */
238 static EMACS_INT pure_bytes_used_lisp
;
240 /* Number of bytes allocated for non-Lisp objects in pure storage. */
242 static EMACS_INT pure_bytes_used_non_lisp
;
244 /* If nonzero, this is a warning delivered by malloc and not yet
247 const char *pending_malloc_warning
;
249 /* Maximum amount of C stack to save when a GC happens. */
251 #ifndef MAX_SAVE_STACK
252 #define MAX_SAVE_STACK 16000
255 /* Buffer in which we save a copy of the C stack at each GC. */
257 #if MAX_SAVE_STACK > 0
258 static char *stack_copy
;
259 static size_t stack_copy_size
;
262 /* Non-zero means ignore malloc warnings. Set during initialization.
263 Currently not used. */
265 static int ignore_warnings
;
267 static Lisp_Object Qgc_cons_threshold
;
268 Lisp_Object Qchar_table_extra_slots
;
270 /* Hook run after GC has finished. */
272 static Lisp_Object Qpost_gc_hook
;
274 static void mark_buffer (Lisp_Object
);
275 static void mark_terminals (void);
276 static void gc_sweep (void);
277 static void mark_glyph_matrix (struct glyph_matrix
*);
278 static void mark_face_cache (struct face_cache
*);
280 static struct Lisp_String
*allocate_string (void);
281 static void compact_small_strings (void);
282 static void free_large_strings (void);
283 static void sweep_strings (void);
285 extern int message_enable_multibyte
;
287 /* When scanning the C stack for live Lisp objects, Emacs keeps track
288 of what memory allocated via lisp_malloc is intended for what
289 purpose. This enumeration specifies the type of memory. */
300 /* We used to keep separate mem_types for subtypes of vectors such as
301 process, hash_table, frame, terminal, and window, but we never made
302 use of the distinction, so it only caused source-code complexity
303 and runtime slowdown. Minor but pointless. */
307 static POINTER_TYPE
*lisp_align_malloc (size_t, enum mem_type
);
308 static POINTER_TYPE
*lisp_malloc (size_t, enum mem_type
);
311 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
313 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
314 #include <stdio.h> /* For fprintf. */
317 /* A unique object in pure space used to make some Lisp objects
318 on free lists recognizable in O(1). */
320 static Lisp_Object Vdead
;
322 #ifdef GC_MALLOC_CHECK
324 enum mem_type allocated_mem_type
;
325 static int dont_register_blocks
;
327 #endif /* GC_MALLOC_CHECK */
329 /* A node in the red-black tree describing allocated memory containing
330 Lisp data. Each such block is recorded with its start and end
331 address when it is allocated, and removed from the tree when it
334 A red-black tree is a balanced binary tree with the following
337 1. Every node is either red or black.
338 2. Every leaf is black.
339 3. If a node is red, then both of its children are black.
340 4. Every simple path from a node to a descendant leaf contains
341 the same number of black nodes.
342 5. The root is always black.
344 When nodes are inserted into the tree, or deleted from the tree,
345 the tree is "fixed" so that these properties are always true.
347 A red-black tree with N internal nodes has height at most 2
348 log(N+1). Searches, insertions and deletions are done in O(log N).
349 Please see a text book about data structures for a detailed
350 description of red-black trees. Any book worth its salt should
355 /* Children of this node. These pointers are never NULL. When there
356 is no child, the value is MEM_NIL, which points to a dummy node. */
357 struct mem_node
*left
, *right
;
359 /* The parent of this node. In the root node, this is NULL. */
360 struct mem_node
*parent
;
362 /* Start and end of allocated region. */
366 enum {MEM_BLACK
, MEM_RED
} color
;
372 /* Base address of stack. Set in main. */
374 Lisp_Object
*stack_base
;
376 /* Root of the tree describing allocated Lisp memory. */
378 static struct mem_node
*mem_root
;
380 /* Lowest and highest known address in the heap. */
382 static void *min_heap_address
, *max_heap_address
;
384 /* Sentinel node of the tree. */
386 static struct mem_node mem_z
;
387 #define MEM_NIL &mem_z
389 static struct Lisp_Vector
*allocate_vectorlike (EMACS_INT
);
390 static void lisp_free (POINTER_TYPE
*);
391 static void mark_stack (void);
392 static int live_vector_p (struct mem_node
*, void *);
393 static int live_buffer_p (struct mem_node
*, void *);
394 static int live_string_p (struct mem_node
*, void *);
395 static int live_cons_p (struct mem_node
*, void *);
396 static int live_symbol_p (struct mem_node
*, void *);
397 static int live_float_p (struct mem_node
*, void *);
398 static int live_misc_p (struct mem_node
*, void *);
399 static void mark_maybe_object (Lisp_Object
);
400 static void mark_memory (void *, void *, int);
401 static void mem_init (void);
402 static struct mem_node
*mem_insert (void *, void *, enum mem_type
);
403 static void mem_insert_fixup (struct mem_node
*);
404 static void mem_rotate_left (struct mem_node
*);
405 static void mem_rotate_right (struct mem_node
*);
406 static void mem_delete (struct mem_node
*);
407 static void mem_delete_fixup (struct mem_node
*);
408 static INLINE
struct mem_node
*mem_find (void *);
411 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
412 static void check_gcpros (void);
415 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
417 /* Recording what needs to be marked for gc. */
419 struct gcpro
*gcprolist
;
421 /* Addresses of staticpro'd variables. Initialize it to a nonzero
422 value; otherwise some compilers put it into BSS. */
424 #define NSTATICS 0x640
425 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
427 /* Index of next unused slot in staticvec. */
429 static int staticidx
= 0;
431 static POINTER_TYPE
*pure_alloc (size_t, int);
434 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
435 ALIGNMENT must be a power of 2. */
437 #define ALIGN(ptr, ALIGNMENT) \
438 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
439 & ~((ALIGNMENT) - 1)))
443 /************************************************************************
445 ************************************************************************/
447 /* Function malloc calls this if it finds we are near exhausting storage. */
450 malloc_warning (const char *str
)
452 pending_malloc_warning
= str
;
456 /* Display an already-pending malloc warning. */
459 display_malloc_warning (void)
461 call3 (intern ("display-warning"),
463 build_string (pending_malloc_warning
),
464 intern ("emergency"));
465 pending_malloc_warning
= 0;
469 #ifdef DOUG_LEA_MALLOC
470 # define BYTES_USED (mallinfo ().uordblks)
472 # define BYTES_USED _bytes_used
475 /* Called if we can't allocate relocatable space for a buffer. */
478 buffer_memory_full (void)
480 /* If buffers use the relocating allocator, no need to free
481 spare_memory, because we may have plenty of malloc space left
482 that we could get, and if we don't, the malloc that fails will
483 itself cause spare_memory to be freed. If buffers don't use the
484 relocating allocator, treat this like any other failing
491 /* This used to call error, but if we've run out of memory, we could
492 get infinite recursion trying to build the string. */
493 xsignal (Qnil
, Vmemory_signal_data
);
497 #ifdef XMALLOC_OVERRUN_CHECK
499 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
500 and a 16 byte trailer around each block.
502 The header consists of 12 fixed bytes + a 4 byte integer contaning the
503 original block size, while the trailer consists of 16 fixed bytes.
505 The header is used to detect whether this block has been allocated
506 through these functions -- as it seems that some low-level libc
507 functions may bypass the malloc hooks.
511 #define XMALLOC_OVERRUN_CHECK_SIZE 16
513 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
514 { 0x9a, 0x9b, 0xae, 0xaf,
515 0xbf, 0xbe, 0xce, 0xcf,
516 0xea, 0xeb, 0xec, 0xed };
518 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
519 { 0xaa, 0xab, 0xac, 0xad,
520 0xba, 0xbb, 0xbc, 0xbd,
521 0xca, 0xcb, 0xcc, 0xcd,
522 0xda, 0xdb, 0xdc, 0xdd };
524 /* Macros to insert and extract the block size in the header. */
526 #define XMALLOC_PUT_SIZE(ptr, size) \
527 (ptr[-1] = (size & 0xff), \
528 ptr[-2] = ((size >> 8) & 0xff), \
529 ptr[-3] = ((size >> 16) & 0xff), \
530 ptr[-4] = ((size >> 24) & 0xff))
532 #define XMALLOC_GET_SIZE(ptr) \
533 (size_t)((unsigned)(ptr[-1]) | \
534 ((unsigned)(ptr[-2]) << 8) | \
535 ((unsigned)(ptr[-3]) << 16) | \
536 ((unsigned)(ptr[-4]) << 24))
539 /* The call depth in overrun_check functions. For example, this might happen:
541 overrun_check_malloc()
542 -> malloc -> (via hook)_-> emacs_blocked_malloc
543 -> overrun_check_malloc
544 call malloc (hooks are NULL, so real malloc is called).
545 malloc returns 10000.
546 add overhead, return 10016.
547 <- (back in overrun_check_malloc)
548 add overhead again, return 10032
549 xmalloc returns 10032.
554 overrun_check_free(10032)
556 free(10016) <- crash, because 10000 is the original pointer. */
558 static int check_depth
;
560 /* Like malloc, but wraps allocated block with header and trailer. */
563 overrun_check_malloc (size
)
566 register unsigned char *val
;
567 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
569 val
= (unsigned char *) malloc (size
+ overhead
);
570 if (val
&& check_depth
== 1)
572 memcpy (val
, xmalloc_overrun_check_header
,
573 XMALLOC_OVERRUN_CHECK_SIZE
- 4);
574 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
575 XMALLOC_PUT_SIZE(val
, size
);
576 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
577 XMALLOC_OVERRUN_CHECK_SIZE
);
580 return (POINTER_TYPE
*)val
;
584 /* Like realloc, but checks old block for overrun, and wraps new block
585 with header and trailer. */
588 overrun_check_realloc (block
, size
)
592 register unsigned char *val
= (unsigned char *)block
;
593 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
597 && memcmp (xmalloc_overrun_check_header
,
598 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
599 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
601 size_t osize
= XMALLOC_GET_SIZE (val
);
602 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
603 XMALLOC_OVERRUN_CHECK_SIZE
))
605 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
606 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
607 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
610 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
612 if (val
&& check_depth
== 1)
614 memcpy (val
, xmalloc_overrun_check_header
,
615 XMALLOC_OVERRUN_CHECK_SIZE
- 4);
616 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
617 XMALLOC_PUT_SIZE(val
, size
);
618 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
619 XMALLOC_OVERRUN_CHECK_SIZE
);
622 return (POINTER_TYPE
*)val
;
625 /* Like free, but checks block for overrun. */
628 overrun_check_free (block
)
631 unsigned char *val
= (unsigned char *)block
;
636 && memcmp (xmalloc_overrun_check_header
,
637 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
638 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
640 size_t osize
= XMALLOC_GET_SIZE (val
);
641 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
642 XMALLOC_OVERRUN_CHECK_SIZE
))
644 #ifdef XMALLOC_CLEAR_FREE_MEMORY
645 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
646 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
648 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
649 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
650 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
661 #define malloc overrun_check_malloc
662 #define realloc overrun_check_realloc
663 #define free overrun_check_free
667 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
668 there's no need to block input around malloc. */
669 #define MALLOC_BLOCK_INPUT ((void)0)
670 #define MALLOC_UNBLOCK_INPUT ((void)0)
672 #define MALLOC_BLOCK_INPUT BLOCK_INPUT
673 #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT
676 /* Like malloc but check for no memory and block interrupt input.. */
679 xmalloc (size_t size
)
681 register POINTER_TYPE
*val
;
684 val
= (POINTER_TYPE
*) malloc (size
);
685 MALLOC_UNBLOCK_INPUT
;
693 /* Like realloc but check for no memory and block interrupt input.. */
696 xrealloc (POINTER_TYPE
*block
, size_t size
)
698 register POINTER_TYPE
*val
;
701 /* We must call malloc explicitly when BLOCK is 0, since some
702 reallocs don't do this. */
704 val
= (POINTER_TYPE
*) malloc (size
);
706 val
= (POINTER_TYPE
*) realloc (block
, size
);
707 MALLOC_UNBLOCK_INPUT
;
709 if (!val
&& size
) memory_full ();
714 /* Like free but block interrupt input. */
717 xfree (POINTER_TYPE
*block
)
723 MALLOC_UNBLOCK_INPUT
;
724 /* We don't call refill_memory_reserve here
725 because that duplicates doing so in emacs_blocked_free
726 and the criterion should go there. */
730 /* Like strdup, but uses xmalloc. */
733 xstrdup (const char *s
)
735 size_t len
= strlen (s
) + 1;
736 char *p
= (char *) xmalloc (len
);
742 /* Unwind for SAFE_ALLOCA */
745 safe_alloca_unwind (Lisp_Object arg
)
747 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
757 /* Like malloc but used for allocating Lisp data. NBYTES is the
758 number of bytes to allocate, TYPE describes the intended use of the
759 allcated memory block (for strings, for conses, ...). */
762 static void *lisp_malloc_loser
;
765 static POINTER_TYPE
*
766 lisp_malloc (size_t nbytes
, enum mem_type type
)
772 #ifdef GC_MALLOC_CHECK
773 allocated_mem_type
= type
;
776 val
= (void *) malloc (nbytes
);
779 /* If the memory just allocated cannot be addressed thru a Lisp
780 object's pointer, and it needs to be,
781 that's equivalent to running out of memory. */
782 if (val
&& type
!= MEM_TYPE_NON_LISP
)
785 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
786 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
788 lisp_malloc_loser
= val
;
795 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
796 if (val
&& type
!= MEM_TYPE_NON_LISP
)
797 mem_insert (val
, (char *) val
+ nbytes
, type
);
800 MALLOC_UNBLOCK_INPUT
;
806 /* Free BLOCK. This must be called to free memory allocated with a
807 call to lisp_malloc. */
810 lisp_free (POINTER_TYPE
*block
)
814 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
815 mem_delete (mem_find (block
));
817 MALLOC_UNBLOCK_INPUT
;
820 /* Allocation of aligned blocks of memory to store Lisp data. */
821 /* The entry point is lisp_align_malloc which returns blocks of at most */
822 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
824 /* Use posix_memalloc if the system has it and we're using the system's
825 malloc (because our gmalloc.c routines don't have posix_memalign although
826 its memalloc could be used). */
827 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
828 #define USE_POSIX_MEMALIGN 1
831 /* BLOCK_ALIGN has to be a power of 2. */
832 #define BLOCK_ALIGN (1 << 10)
834 /* Padding to leave at the end of a malloc'd block. This is to give
835 malloc a chance to minimize the amount of memory wasted to alignment.
836 It should be tuned to the particular malloc library used.
837 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
838 posix_memalign on the other hand would ideally prefer a value of 4
839 because otherwise, there's 1020 bytes wasted between each ablocks.
840 In Emacs, testing shows that those 1020 can most of the time be
841 efficiently used by malloc to place other objects, so a value of 0 can
842 still preferable unless you have a lot of aligned blocks and virtually
844 #define BLOCK_PADDING 0
845 #define BLOCK_BYTES \
846 (BLOCK_ALIGN - sizeof (struct ablock *) - BLOCK_PADDING)
848 /* Internal data structures and constants. */
850 #define ABLOCKS_SIZE 16
852 /* An aligned block of memory. */
857 char payload
[BLOCK_BYTES
];
858 struct ablock
*next_free
;
860 /* `abase' is the aligned base of the ablocks. */
861 /* It is overloaded to hold the virtual `busy' field that counts
862 the number of used ablock in the parent ablocks.
863 The first ablock has the `busy' field, the others have the `abase'
864 field. To tell the difference, we assume that pointers will have
865 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
866 is used to tell whether the real base of the parent ablocks is `abase'
867 (if not, the word before the first ablock holds a pointer to the
869 struct ablocks
*abase
;
870 /* The padding of all but the last ablock is unused. The padding of
871 the last ablock in an ablocks is not allocated. */
873 char padding
[BLOCK_PADDING
];
877 /* A bunch of consecutive aligned blocks. */
880 struct ablock blocks
[ABLOCKS_SIZE
];
883 /* Size of the block requested from malloc or memalign. */
884 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
886 #define ABLOCK_ABASE(block) \
887 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
888 ? (struct ablocks *)(block) \
891 /* Virtual `busy' field. */
892 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
894 /* Pointer to the (not necessarily aligned) malloc block. */
895 #ifdef USE_POSIX_MEMALIGN
896 #define ABLOCKS_BASE(abase) (abase)
898 #define ABLOCKS_BASE(abase) \
899 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
902 /* The list of free ablock. */
903 static struct ablock
*free_ablock
;
905 /* Allocate an aligned block of nbytes.
906 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
907 smaller or equal to BLOCK_BYTES. */
908 static POINTER_TYPE
*
909 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
912 struct ablocks
*abase
;
914 eassert (nbytes
<= BLOCK_BYTES
);
918 #ifdef GC_MALLOC_CHECK
919 allocated_mem_type
= type
;
925 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
927 #ifdef DOUG_LEA_MALLOC
928 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
929 because mapped region contents are not preserved in
931 mallopt (M_MMAP_MAX
, 0);
934 #ifdef USE_POSIX_MEMALIGN
936 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
942 base
= malloc (ABLOCKS_BYTES
);
943 abase
= ALIGN (base
, BLOCK_ALIGN
);
948 MALLOC_UNBLOCK_INPUT
;
952 aligned
= (base
== abase
);
954 ((void**)abase
)[-1] = base
;
956 #ifdef DOUG_LEA_MALLOC
957 /* Back to a reasonable maximum of mmap'ed areas. */
958 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
962 /* If the memory just allocated cannot be addressed thru a Lisp
963 object's pointer, and it needs to be, that's equivalent to
964 running out of memory. */
965 if (type
!= MEM_TYPE_NON_LISP
)
968 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
970 if ((char *) XCONS (tem
) != end
)
972 lisp_malloc_loser
= base
;
974 MALLOC_UNBLOCK_INPUT
;
980 /* Initialize the blocks and put them on the free list.
981 Is `base' was not properly aligned, we can't use the last block. */
982 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
984 abase
->blocks
[i
].abase
= abase
;
985 abase
->blocks
[i
].x
.next_free
= free_ablock
;
986 free_ablock
= &abase
->blocks
[i
];
988 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
990 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
991 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
992 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
993 eassert (ABLOCKS_BASE (abase
) == base
);
994 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
997 abase
= ABLOCK_ABASE (free_ablock
);
998 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
1000 free_ablock
= free_ablock
->x
.next_free
;
1002 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1003 if (val
&& type
!= MEM_TYPE_NON_LISP
)
1004 mem_insert (val
, (char *) val
+ nbytes
, type
);
1007 MALLOC_UNBLOCK_INPUT
;
1011 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
1016 lisp_align_free (POINTER_TYPE
*block
)
1018 struct ablock
*ablock
= block
;
1019 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1022 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1023 mem_delete (mem_find (block
));
1025 /* Put on free list. */
1026 ablock
->x
.next_free
= free_ablock
;
1027 free_ablock
= ablock
;
1028 /* Update busy count. */
1029 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
1031 if (2 > (long) ABLOCKS_BUSY (abase
))
1032 { /* All the blocks are free. */
1033 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
1034 struct ablock
**tem
= &free_ablock
;
1035 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1039 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1042 *tem
= (*tem
)->x
.next_free
;
1045 tem
= &(*tem
)->x
.next_free
;
1047 eassert ((aligned
& 1) == aligned
);
1048 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1049 #ifdef USE_POSIX_MEMALIGN
1050 eassert ((unsigned long)ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1052 free (ABLOCKS_BASE (abase
));
1054 MALLOC_UNBLOCK_INPUT
;
1057 /* Return a new buffer structure allocated from the heap with
1058 a call to lisp_malloc. */
1061 allocate_buffer (void)
1064 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1066 b
->size
= sizeof (struct buffer
) / sizeof (EMACS_INT
);
1067 XSETPVECTYPE (b
, PVEC_BUFFER
);
1072 #ifndef SYSTEM_MALLOC
1074 /* Arranging to disable input signals while we're in malloc.
1076 This only works with GNU malloc. To help out systems which can't
1077 use GNU malloc, all the calls to malloc, realloc, and free
1078 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1079 pair; unfortunately, we have no idea what C library functions
1080 might call malloc, so we can't really protect them unless you're
1081 using GNU malloc. Fortunately, most of the major operating systems
1082 can use GNU malloc. */
1085 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
1086 there's no need to block input around malloc. */
1088 #ifndef DOUG_LEA_MALLOC
1089 extern void * (*__malloc_hook
) (size_t, const void *);
1090 extern void * (*__realloc_hook
) (void *, size_t, const void *);
1091 extern void (*__free_hook
) (void *, const void *);
1092 /* Else declared in malloc.h, perhaps with an extra arg. */
1093 #endif /* DOUG_LEA_MALLOC */
1094 static void * (*old_malloc_hook
) (size_t, const void *);
1095 static void * (*old_realloc_hook
) (void *, size_t, const void*);
1096 static void (*old_free_hook
) (void*, const void*);
1098 static __malloc_size_t bytes_used_when_reconsidered
;
1100 /* This function is used as the hook for free to call. */
1103 emacs_blocked_free (void *ptr
, const void *ptr2
)
1107 #ifdef GC_MALLOC_CHECK
1113 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1116 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1121 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1125 #endif /* GC_MALLOC_CHECK */
1127 __free_hook
= old_free_hook
;
1130 /* If we released our reserve (due to running out of memory),
1131 and we have a fair amount free once again,
1132 try to set aside another reserve in case we run out once more. */
1133 if (! NILP (Vmemory_full
)
1134 /* Verify there is enough space that even with the malloc
1135 hysteresis this call won't run out again.
1136 The code here is correct as long as SPARE_MEMORY
1137 is substantially larger than the block size malloc uses. */
1138 && (bytes_used_when_full
1139 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1140 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1141 refill_memory_reserve ();
1143 __free_hook
= emacs_blocked_free
;
1144 UNBLOCK_INPUT_ALLOC
;
1148 /* This function is the malloc hook that Emacs uses. */
1151 emacs_blocked_malloc (size_t size
, const void *ptr
)
1156 __malloc_hook
= old_malloc_hook
;
1157 #ifdef DOUG_LEA_MALLOC
1158 /* Segfaults on my system. --lorentey */
1159 /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */
1161 __malloc_extra_blocks
= malloc_hysteresis
;
1164 value
= (void *) malloc (size
);
1166 #ifdef GC_MALLOC_CHECK
1168 struct mem_node
*m
= mem_find (value
);
1171 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1173 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1174 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1179 if (!dont_register_blocks
)
1181 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1182 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1185 #endif /* GC_MALLOC_CHECK */
1187 __malloc_hook
= emacs_blocked_malloc
;
1188 UNBLOCK_INPUT_ALLOC
;
1190 /* fprintf (stderr, "%p malloc\n", value); */
1195 /* This function is the realloc hook that Emacs uses. */
1198 emacs_blocked_realloc (void *ptr
, size_t size
, const void *ptr2
)
1203 __realloc_hook
= old_realloc_hook
;
1205 #ifdef GC_MALLOC_CHECK
1208 struct mem_node
*m
= mem_find (ptr
);
1209 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1212 "Realloc of %p which wasn't allocated with malloc\n",
1220 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1222 /* Prevent malloc from registering blocks. */
1223 dont_register_blocks
= 1;
1224 #endif /* GC_MALLOC_CHECK */
1226 value
= (void *) realloc (ptr
, size
);
1228 #ifdef GC_MALLOC_CHECK
1229 dont_register_blocks
= 0;
1232 struct mem_node
*m
= mem_find (value
);
1235 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1239 /* Can't handle zero size regions in the red-black tree. */
1240 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1243 /* fprintf (stderr, "%p <- realloc\n", value); */
1244 #endif /* GC_MALLOC_CHECK */
1246 __realloc_hook
= emacs_blocked_realloc
;
1247 UNBLOCK_INPUT_ALLOC
;
1253 #ifdef HAVE_GTK_AND_PTHREAD
1254 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1255 normal malloc. Some thread implementations need this as they call
1256 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1257 calls malloc because it is the first call, and we have an endless loop. */
1260 reset_malloc_hooks ()
1262 __free_hook
= old_free_hook
;
1263 __malloc_hook
= old_malloc_hook
;
1264 __realloc_hook
= old_realloc_hook
;
1266 #endif /* HAVE_GTK_AND_PTHREAD */
1269 /* Called from main to set up malloc to use our hooks. */
1272 uninterrupt_malloc (void)
1274 #ifdef HAVE_GTK_AND_PTHREAD
1275 #ifdef DOUG_LEA_MALLOC
1276 pthread_mutexattr_t attr
;
1278 /* GLIBC has a faster way to do this, but lets keep it portable.
1279 This is according to the Single UNIX Specification. */
1280 pthread_mutexattr_init (&attr
);
1281 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1282 pthread_mutex_init (&alloc_mutex
, &attr
);
1283 #else /* !DOUG_LEA_MALLOC */
1284 /* Some systems such as Solaris 2.6 don't have a recursive mutex,
1285 and the bundled gmalloc.c doesn't require it. */
1286 pthread_mutex_init (&alloc_mutex
, NULL
);
1287 #endif /* !DOUG_LEA_MALLOC */
1288 #endif /* HAVE_GTK_AND_PTHREAD */
1290 if (__free_hook
!= emacs_blocked_free
)
1291 old_free_hook
= __free_hook
;
1292 __free_hook
= emacs_blocked_free
;
1294 if (__malloc_hook
!= emacs_blocked_malloc
)
1295 old_malloc_hook
= __malloc_hook
;
1296 __malloc_hook
= emacs_blocked_malloc
;
1298 if (__realloc_hook
!= emacs_blocked_realloc
)
1299 old_realloc_hook
= __realloc_hook
;
1300 __realloc_hook
= emacs_blocked_realloc
;
1303 #endif /* not SYNC_INPUT */
1304 #endif /* not SYSTEM_MALLOC */
1308 /***********************************************************************
1310 ***********************************************************************/
1312 /* Number of intervals allocated in an interval_block structure.
1313 The 1020 is 1024 minus malloc overhead. */
1315 #define INTERVAL_BLOCK_SIZE \
1316 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1318 /* Intervals are allocated in chunks in form of an interval_block
1321 struct interval_block
1323 /* Place `intervals' first, to preserve alignment. */
1324 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1325 struct interval_block
*next
;
1328 /* Current interval block. Its `next' pointer points to older
1331 static struct interval_block
*interval_block
;
1333 /* Index in interval_block above of the next unused interval
1336 static int interval_block_index
;
1338 /* Number of free and live intervals. */
1340 static int total_free_intervals
, total_intervals
;
1342 /* List of free intervals. */
1344 INTERVAL interval_free_list
;
1346 /* Total number of interval blocks now in use. */
1348 static int n_interval_blocks
;
1351 /* Initialize interval allocation. */
1354 init_intervals (void)
1356 interval_block
= NULL
;
1357 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1358 interval_free_list
= 0;
1359 n_interval_blocks
= 0;
1363 /* Return a new interval. */
1366 make_interval (void)
1370 /* eassert (!handling_signal); */
1374 if (interval_free_list
)
1376 val
= interval_free_list
;
1377 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1381 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1383 register struct interval_block
*newi
;
1385 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1388 newi
->next
= interval_block
;
1389 interval_block
= newi
;
1390 interval_block_index
= 0;
1391 n_interval_blocks
++;
1393 val
= &interval_block
->intervals
[interval_block_index
++];
1396 MALLOC_UNBLOCK_INPUT
;
1398 consing_since_gc
+= sizeof (struct interval
);
1400 RESET_INTERVAL (val
);
1406 /* Mark Lisp objects in interval I. */
1409 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1411 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1413 mark_object (i
->plist
);
1417 /* Mark the interval tree rooted in TREE. Don't call this directly;
1418 use the macro MARK_INTERVAL_TREE instead. */
1421 mark_interval_tree (register INTERVAL tree
)
1423 /* No need to test if this tree has been marked already; this
1424 function is always called through the MARK_INTERVAL_TREE macro,
1425 which takes care of that. */
1427 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1431 /* Mark the interval tree rooted in I. */
1433 #define MARK_INTERVAL_TREE(i) \
1435 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1436 mark_interval_tree (i); \
1440 #define UNMARK_BALANCE_INTERVALS(i) \
1442 if (! NULL_INTERVAL_P (i)) \
1443 (i) = balance_intervals (i); \
1447 /* Number support. If USE_LISP_UNION_TYPE is in effect, we
1448 can't create number objects in macros. */
1451 make_number (EMACS_INT n
)
1455 obj
.s
.type
= Lisp_Int
;
1460 /***********************************************************************
1462 ***********************************************************************/
1464 /* Lisp_Strings are allocated in string_block structures. When a new
1465 string_block is allocated, all the Lisp_Strings it contains are
1466 added to a free-list string_free_list. When a new Lisp_String is
1467 needed, it is taken from that list. During the sweep phase of GC,
1468 string_blocks that are entirely free are freed, except two which
1471 String data is allocated from sblock structures. Strings larger
1472 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1473 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1475 Sblocks consist internally of sdata structures, one for each
1476 Lisp_String. The sdata structure points to the Lisp_String it
1477 belongs to. The Lisp_String points back to the `u.data' member of
1478 its sdata structure.
1480 When a Lisp_String is freed during GC, it is put back on
1481 string_free_list, and its `data' member and its sdata's `string'
1482 pointer is set to null. The size of the string is recorded in the
1483 `u.nbytes' member of the sdata. So, sdata structures that are no
1484 longer used, can be easily recognized, and it's easy to compact the
1485 sblocks of small strings which we do in compact_small_strings. */
1487 /* Size in bytes of an sblock structure used for small strings. This
1488 is 8192 minus malloc overhead. */
1490 #define SBLOCK_SIZE 8188
1492 /* Strings larger than this are considered large strings. String data
1493 for large strings is allocated from individual sblocks. */
1495 #define LARGE_STRING_BYTES 1024
1497 /* Structure describing string memory sub-allocated from an sblock.
1498 This is where the contents of Lisp strings are stored. */
1502 /* Back-pointer to the string this sdata belongs to. If null, this
1503 structure is free, and the NBYTES member of the union below
1504 contains the string's byte size (the same value that STRING_BYTES
1505 would return if STRING were non-null). If non-null, STRING_BYTES
1506 (STRING) is the size of the data, and DATA contains the string's
1508 struct Lisp_String
*string
;
1510 #ifdef GC_CHECK_STRING_BYTES
1513 unsigned char data
[1];
1515 #define SDATA_NBYTES(S) (S)->nbytes
1516 #define SDATA_DATA(S) (S)->data
1518 #else /* not GC_CHECK_STRING_BYTES */
1522 /* When STRING in non-null. */
1523 unsigned char data
[1];
1525 /* When STRING is null. */
1530 #define SDATA_NBYTES(S) (S)->u.nbytes
1531 #define SDATA_DATA(S) (S)->u.data
1533 #endif /* not GC_CHECK_STRING_BYTES */
1537 /* Structure describing a block of memory which is sub-allocated to
1538 obtain string data memory for strings. Blocks for small strings
1539 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1540 as large as needed. */
1545 struct sblock
*next
;
1547 /* Pointer to the next free sdata block. This points past the end
1548 of the sblock if there isn't any space left in this block. */
1549 struct sdata
*next_free
;
1551 /* Start of data. */
1552 struct sdata first_data
;
1555 /* Number of Lisp strings in a string_block structure. The 1020 is
1556 1024 minus malloc overhead. */
1558 #define STRING_BLOCK_SIZE \
1559 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1561 /* Structure describing a block from which Lisp_String structures
1566 /* Place `strings' first, to preserve alignment. */
1567 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1568 struct string_block
*next
;
1571 /* Head and tail of the list of sblock structures holding Lisp string
1572 data. We always allocate from current_sblock. The NEXT pointers
1573 in the sblock structures go from oldest_sblock to current_sblock. */
1575 static struct sblock
*oldest_sblock
, *current_sblock
;
1577 /* List of sblocks for large strings. */
1579 static struct sblock
*large_sblocks
;
1581 /* List of string_block structures, and how many there are. */
1583 static struct string_block
*string_blocks
;
1584 static int n_string_blocks
;
1586 /* Free-list of Lisp_Strings. */
1588 static struct Lisp_String
*string_free_list
;
1590 /* Number of live and free Lisp_Strings. */
1592 static int total_strings
, total_free_strings
;
1594 /* Number of bytes used by live strings. */
1596 static EMACS_INT total_string_size
;
1598 /* Given a pointer to a Lisp_String S which is on the free-list
1599 string_free_list, return a pointer to its successor in the
1602 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1604 /* Return a pointer to the sdata structure belonging to Lisp string S.
1605 S must be live, i.e. S->data must not be null. S->data is actually
1606 a pointer to the `u.data' member of its sdata structure; the
1607 structure starts at a constant offset in front of that. */
1609 #ifdef GC_CHECK_STRING_BYTES
1611 #define SDATA_OF_STRING(S) \
1612 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1613 - sizeof (EMACS_INT)))
1615 #else /* not GC_CHECK_STRING_BYTES */
1617 #define SDATA_OF_STRING(S) \
1618 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1620 #endif /* not GC_CHECK_STRING_BYTES */
1623 #ifdef GC_CHECK_STRING_OVERRUN
1625 /* We check for overrun in string data blocks by appending a small
1626 "cookie" after each allocated string data block, and check for the
1627 presence of this cookie during GC. */
1629 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1630 static char string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1631 { 0xde, 0xad, 0xbe, 0xef };
1634 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1637 /* Value is the size of an sdata structure large enough to hold NBYTES
1638 bytes of string data. The value returned includes a terminating
1639 NUL byte, the size of the sdata structure, and padding. */
1641 #ifdef GC_CHECK_STRING_BYTES
1643 #define SDATA_SIZE(NBYTES) \
1644 ((sizeof (struct Lisp_String *) \
1646 + sizeof (EMACS_INT) \
1647 + sizeof (EMACS_INT) - 1) \
1648 & ~(sizeof (EMACS_INT) - 1))
1650 #else /* not GC_CHECK_STRING_BYTES */
1652 #define SDATA_SIZE(NBYTES) \
1653 ((sizeof (struct Lisp_String *) \
1655 + sizeof (EMACS_INT) - 1) \
1656 & ~(sizeof (EMACS_INT) - 1))
1658 #endif /* not GC_CHECK_STRING_BYTES */
1660 /* Extra bytes to allocate for each string. */
1662 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1664 /* Initialize string allocation. Called from init_alloc_once. */
1669 total_strings
= total_free_strings
= total_string_size
= 0;
1670 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1671 string_blocks
= NULL
;
1672 n_string_blocks
= 0;
1673 string_free_list
= NULL
;
1674 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1675 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1679 #ifdef GC_CHECK_STRING_BYTES
1681 static int check_string_bytes_count
;
1683 static void check_string_bytes (int);
1684 static void check_sblock (struct sblock
*);
1686 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1689 /* Like GC_STRING_BYTES, but with debugging check. */
1692 string_bytes (struct Lisp_String
*s
)
1695 (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1697 if (!PURE_POINTER_P (s
)
1699 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1704 /* Check validity of Lisp strings' string_bytes member in B. */
1710 struct sdata
*from
, *end
, *from_end
;
1714 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1716 /* Compute the next FROM here because copying below may
1717 overwrite data we need to compute it. */
1720 /* Check that the string size recorded in the string is the
1721 same as the one recorded in the sdata structure. */
1723 CHECK_STRING_BYTES (from
->string
);
1726 nbytes
= GC_STRING_BYTES (from
->string
);
1728 nbytes
= SDATA_NBYTES (from
);
1730 nbytes
= SDATA_SIZE (nbytes
);
1731 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1736 /* Check validity of Lisp strings' string_bytes member. ALL_P
1737 non-zero means check all strings, otherwise check only most
1738 recently allocated strings. Used for hunting a bug. */
1741 check_string_bytes (all_p
)
1748 for (b
= large_sblocks
; b
; b
= b
->next
)
1750 struct Lisp_String
*s
= b
->first_data
.string
;
1752 CHECK_STRING_BYTES (s
);
1755 for (b
= oldest_sblock
; b
; b
= b
->next
)
1759 check_sblock (current_sblock
);
1762 #endif /* GC_CHECK_STRING_BYTES */
1764 #ifdef GC_CHECK_STRING_FREE_LIST
1766 /* Walk through the string free list looking for bogus next pointers.
1767 This may catch buffer overrun from a previous string. */
1770 check_string_free_list ()
1772 struct Lisp_String
*s
;
1774 /* Pop a Lisp_String off the free-list. */
1775 s
= string_free_list
;
1778 if ((unsigned long)s
< 1024)
1780 s
= NEXT_FREE_LISP_STRING (s
);
1784 #define check_string_free_list()
1787 /* Return a new Lisp_String. */
1789 static struct Lisp_String
*
1790 allocate_string (void)
1792 struct Lisp_String
*s
;
1794 /* eassert (!handling_signal); */
1798 /* If the free-list is empty, allocate a new string_block, and
1799 add all the Lisp_Strings in it to the free-list. */
1800 if (string_free_list
== NULL
)
1802 struct string_block
*b
;
1805 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1806 memset (b
, 0, sizeof *b
);
1807 b
->next
= string_blocks
;
1811 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1814 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1815 string_free_list
= s
;
1818 total_free_strings
+= STRING_BLOCK_SIZE
;
1821 check_string_free_list ();
1823 /* Pop a Lisp_String off the free-list. */
1824 s
= string_free_list
;
1825 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1827 MALLOC_UNBLOCK_INPUT
;
1829 /* Probably not strictly necessary, but play it safe. */
1830 memset (s
, 0, sizeof *s
);
1832 --total_free_strings
;
1835 consing_since_gc
+= sizeof *s
;
1837 #ifdef GC_CHECK_STRING_BYTES
1838 if (!noninteractive
)
1840 if (++check_string_bytes_count
== 200)
1842 check_string_bytes_count
= 0;
1843 check_string_bytes (1);
1846 check_string_bytes (0);
1848 #endif /* GC_CHECK_STRING_BYTES */
1854 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1855 plus a NUL byte at the end. Allocate an sdata structure for S, and
1856 set S->data to its `u.data' member. Store a NUL byte at the end of
1857 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1858 S->data if it was initially non-null. */
1861 allocate_string_data (struct Lisp_String
*s
,
1862 EMACS_INT nchars
, EMACS_INT nbytes
)
1864 struct sdata
*data
, *old_data
;
1866 EMACS_INT needed
, old_nbytes
;
1868 /* Determine the number of bytes needed to store NBYTES bytes
1870 needed
= SDATA_SIZE (nbytes
);
1871 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1872 old_nbytes
= GC_STRING_BYTES (s
);
1876 if (nbytes
> LARGE_STRING_BYTES
)
1878 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1880 #ifdef DOUG_LEA_MALLOC
1881 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1882 because mapped region contents are not preserved in
1885 In case you think of allowing it in a dumped Emacs at the
1886 cost of not being able to re-dump, there's another reason:
1887 mmap'ed data typically have an address towards the top of the
1888 address space, which won't fit into an EMACS_INT (at least on
1889 32-bit systems with the current tagging scheme). --fx */
1890 mallopt (M_MMAP_MAX
, 0);
1893 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1895 #ifdef DOUG_LEA_MALLOC
1896 /* Back to a reasonable maximum of mmap'ed areas. */
1897 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1900 b
->next_free
= &b
->first_data
;
1901 b
->first_data
.string
= NULL
;
1902 b
->next
= large_sblocks
;
1905 else if (current_sblock
== NULL
1906 || (((char *) current_sblock
+ SBLOCK_SIZE
1907 - (char *) current_sblock
->next_free
)
1908 < (needed
+ GC_STRING_EXTRA
)))
1910 /* Not enough room in the current sblock. */
1911 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1912 b
->next_free
= &b
->first_data
;
1913 b
->first_data
.string
= NULL
;
1917 current_sblock
->next
= b
;
1925 data
= b
->next_free
;
1926 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
1928 MALLOC_UNBLOCK_INPUT
;
1931 s
->data
= SDATA_DATA (data
);
1932 #ifdef GC_CHECK_STRING_BYTES
1933 SDATA_NBYTES (data
) = nbytes
;
1936 s
->size_byte
= nbytes
;
1937 s
->data
[nbytes
] = '\0';
1938 #ifdef GC_CHECK_STRING_OVERRUN
1939 memcpy (data
+ needed
, string_overrun_cookie
, GC_STRING_OVERRUN_COOKIE_SIZE
);
1942 /* If S had already data assigned, mark that as free by setting its
1943 string back-pointer to null, and recording the size of the data
1947 SDATA_NBYTES (old_data
) = old_nbytes
;
1948 old_data
->string
= NULL
;
1951 consing_since_gc
+= needed
;
1955 /* Sweep and compact strings. */
1958 sweep_strings (void)
1960 struct string_block
*b
, *next
;
1961 struct string_block
*live_blocks
= NULL
;
1963 string_free_list
= NULL
;
1964 total_strings
= total_free_strings
= 0;
1965 total_string_size
= 0;
1967 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1968 for (b
= string_blocks
; b
; b
= next
)
1971 struct Lisp_String
*free_list_before
= string_free_list
;
1975 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1977 struct Lisp_String
*s
= b
->strings
+ i
;
1981 /* String was not on free-list before. */
1982 if (STRING_MARKED_P (s
))
1984 /* String is live; unmark it and its intervals. */
1987 if (!NULL_INTERVAL_P (s
->intervals
))
1988 UNMARK_BALANCE_INTERVALS (s
->intervals
);
1991 total_string_size
+= STRING_BYTES (s
);
1995 /* String is dead. Put it on the free-list. */
1996 struct sdata
*data
= SDATA_OF_STRING (s
);
1998 /* Save the size of S in its sdata so that we know
1999 how large that is. Reset the sdata's string
2000 back-pointer so that we know it's free. */
2001 #ifdef GC_CHECK_STRING_BYTES
2002 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2005 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2007 data
->string
= NULL
;
2009 /* Reset the strings's `data' member so that we
2013 /* Put the string on the free-list. */
2014 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2015 string_free_list
= s
;
2021 /* S was on the free-list before. Put it there again. */
2022 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2023 string_free_list
= s
;
2028 /* Free blocks that contain free Lisp_Strings only, except
2029 the first two of them. */
2030 if (nfree
== STRING_BLOCK_SIZE
2031 && total_free_strings
> STRING_BLOCK_SIZE
)
2035 string_free_list
= free_list_before
;
2039 total_free_strings
+= nfree
;
2040 b
->next
= live_blocks
;
2045 check_string_free_list ();
2047 string_blocks
= live_blocks
;
2048 free_large_strings ();
2049 compact_small_strings ();
2051 check_string_free_list ();
2055 /* Free dead large strings. */
2058 free_large_strings (void)
2060 struct sblock
*b
, *next
;
2061 struct sblock
*live_blocks
= NULL
;
2063 for (b
= large_sblocks
; b
; b
= next
)
2067 if (b
->first_data
.string
== NULL
)
2071 b
->next
= live_blocks
;
2076 large_sblocks
= live_blocks
;
2080 /* Compact data of small strings. Free sblocks that don't contain
2081 data of live strings after compaction. */
2084 compact_small_strings (void)
2086 struct sblock
*b
, *tb
, *next
;
2087 struct sdata
*from
, *to
, *end
, *tb_end
;
2088 struct sdata
*to_end
, *from_end
;
2090 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2091 to, and TB_END is the end of TB. */
2093 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2094 to
= &tb
->first_data
;
2096 /* Step through the blocks from the oldest to the youngest. We
2097 expect that old blocks will stabilize over time, so that less
2098 copying will happen this way. */
2099 for (b
= oldest_sblock
; b
; b
= b
->next
)
2102 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2104 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2106 /* Compute the next FROM here because copying below may
2107 overwrite data we need to compute it. */
2110 #ifdef GC_CHECK_STRING_BYTES
2111 /* Check that the string size recorded in the string is the
2112 same as the one recorded in the sdata structure. */
2114 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2116 #endif /* GC_CHECK_STRING_BYTES */
2119 nbytes
= GC_STRING_BYTES (from
->string
);
2121 nbytes
= SDATA_NBYTES (from
);
2123 if (nbytes
> LARGE_STRING_BYTES
)
2126 nbytes
= SDATA_SIZE (nbytes
);
2127 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2129 #ifdef GC_CHECK_STRING_OVERRUN
2130 if (memcmp (string_overrun_cookie
,
2131 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
2132 GC_STRING_OVERRUN_COOKIE_SIZE
))
2136 /* FROM->string non-null means it's alive. Copy its data. */
2139 /* If TB is full, proceed with the next sblock. */
2140 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2141 if (to_end
> tb_end
)
2145 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2146 to
= &tb
->first_data
;
2147 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2150 /* Copy, and update the string's `data' pointer. */
2153 xassert (tb
!= b
|| to
<= from
);
2154 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
2155 to
->string
->data
= SDATA_DATA (to
);
2158 /* Advance past the sdata we copied to. */
2164 /* The rest of the sblocks following TB don't contain live data, so
2165 we can free them. */
2166 for (b
= tb
->next
; b
; b
= next
)
2174 current_sblock
= tb
;
2178 DEFUE ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2179 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2180 LENGTH must be an integer.
2181 INIT must be an integer that represents a character. */)
2182 (Lisp_Object length
, Lisp_Object init
)
2184 register Lisp_Object val
;
2185 register unsigned char *p
, *end
;
2189 CHECK_NATNUM (length
);
2190 CHECK_NUMBER (init
);
2193 if (ASCII_CHAR_P (c
))
2195 nbytes
= XINT (length
);
2196 val
= make_uninit_string (nbytes
);
2198 end
= p
+ SCHARS (val
);
2204 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2205 int len
= CHAR_STRING (c
, str
);
2206 EMACS_INT string_len
= XINT (length
);
2208 if (string_len
> MOST_POSITIVE_FIXNUM
/ len
)
2209 error ("Maximum string size exceeded");
2210 nbytes
= len
* string_len
;
2211 val
= make_uninit_multibyte_string (string_len
, nbytes
);
2216 memcpy (p
, str
, len
);
2226 DEFUE ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2227 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2228 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2229 (Lisp_Object length
, Lisp_Object init
)
2231 register Lisp_Object val
;
2232 struct Lisp_Bool_Vector
*p
;
2234 EMACS_INT length_in_chars
, length_in_elts
;
2237 CHECK_NATNUM (length
);
2239 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2241 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2242 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2243 / BOOL_VECTOR_BITS_PER_CHAR
);
2245 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2246 slot `size' of the struct Lisp_Bool_Vector. */
2247 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2249 /* Get rid of any bits that would cause confusion. */
2250 XVECTOR (val
)->size
= 0; /* No Lisp_Object to trace in there. */
2251 /* Use XVECTOR (val) rather than `p' because p->size is not TRT. */
2252 XSETPVECTYPE (XVECTOR (val
), PVEC_BOOL_VECTOR
);
2254 p
= XBOOL_VECTOR (val
);
2255 p
->size
= XFASTINT (length
);
2257 real_init
= (NILP (init
) ? 0 : -1);
2258 for (i
= 0; i
< length_in_chars
; i
++)
2259 p
->data
[i
] = real_init
;
2261 /* Clear the extraneous bits in the last byte. */
2262 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2263 p
->data
[length_in_chars
- 1]
2264 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2270 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2271 of characters from the contents. This string may be unibyte or
2272 multibyte, depending on the contents. */
2275 make_string (const char *contents
, EMACS_INT nbytes
)
2277 register Lisp_Object val
;
2278 EMACS_INT nchars
, multibyte_nbytes
;
2280 parse_str_as_multibyte ((const unsigned char *) contents
, nbytes
,
2281 &nchars
, &multibyte_nbytes
);
2282 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2283 /* CONTENTS contains no multibyte sequences or contains an invalid
2284 multibyte sequence. We must make unibyte string. */
2285 val
= make_unibyte_string (contents
, nbytes
);
2287 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2292 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2295 make_unibyte_string (const char *contents
, EMACS_INT length
)
2297 register Lisp_Object val
;
2298 val
= make_uninit_string (length
);
2299 memcpy (SDATA (val
), contents
, length
);
2304 /* Make a multibyte string from NCHARS characters occupying NBYTES
2305 bytes at CONTENTS. */
2308 make_multibyte_string (const char *contents
,
2309 EMACS_INT nchars
, EMACS_INT nbytes
)
2311 register Lisp_Object val
;
2312 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2313 memcpy (SDATA (val
), contents
, nbytes
);
2318 /* Make a string from NCHARS characters occupying NBYTES bytes at
2319 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2322 make_string_from_bytes (const char *contents
,
2323 EMACS_INT nchars
, EMACS_INT nbytes
)
2325 register Lisp_Object val
;
2326 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2327 memcpy (SDATA (val
), contents
, nbytes
);
2328 if (SBYTES (val
) == SCHARS (val
))
2329 STRING_SET_UNIBYTE (val
);
2334 /* Make a string from NCHARS characters occupying NBYTES bytes at
2335 CONTENTS. The argument MULTIBYTE controls whether to label the
2336 string as multibyte. If NCHARS is negative, it counts the number of
2337 characters by itself. */
2340 make_specified_string (const char *contents
,
2341 EMACS_INT nchars
, EMACS_INT nbytes
, int multibyte
)
2343 register Lisp_Object val
;
2348 nchars
= multibyte_chars_in_text ((const unsigned char *) contents
,
2353 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2354 memcpy (SDATA (val
), contents
, nbytes
);
2356 STRING_SET_UNIBYTE (val
);
2361 /* Make a string from the data at STR, treating it as multibyte if the
2365 build_string (const char *str
)
2367 return make_string (str
, strlen (str
));
2371 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2372 occupying LENGTH bytes. */
2375 make_uninit_string (EMACS_INT length
)
2380 return empty_unibyte_string
;
2381 val
= make_uninit_multibyte_string (length
, length
);
2382 STRING_SET_UNIBYTE (val
);
2387 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2388 which occupy NBYTES bytes. */
2391 make_uninit_multibyte_string (EMACS_INT nchars
, EMACS_INT nbytes
)
2394 struct Lisp_String
*s
;
2399 return empty_multibyte_string
;
2401 s
= allocate_string ();
2402 allocate_string_data (s
, nchars
, nbytes
);
2403 XSETSTRING (string
, s
);
2404 string_chars_consed
+= nbytes
;
2410 /***********************************************************************
2412 ***********************************************************************/
2414 /* We store float cells inside of float_blocks, allocating a new
2415 float_block with malloc whenever necessary. Float cells reclaimed
2416 by GC are put on a free list to be reallocated before allocating
2417 any new float cells from the latest float_block. */
2419 #define FLOAT_BLOCK_SIZE \
2420 (((BLOCK_BYTES - sizeof (struct float_block *) \
2421 /* The compiler might add padding at the end. */ \
2422 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2423 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2425 #define GETMARKBIT(block,n) \
2426 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2427 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2430 #define SETMARKBIT(block,n) \
2431 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2432 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2434 #define UNSETMARKBIT(block,n) \
2435 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2436 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2438 #define FLOAT_BLOCK(fptr) \
2439 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2441 #define FLOAT_INDEX(fptr) \
2442 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2446 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2447 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2448 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2449 struct float_block
*next
;
2452 #define FLOAT_MARKED_P(fptr) \
2453 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2455 #define FLOAT_MARK(fptr) \
2456 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2458 #define FLOAT_UNMARK(fptr) \
2459 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2461 /* Current float_block. */
2463 struct float_block
*float_block
;
2465 /* Index of first unused Lisp_Float in the current float_block. */
2467 int float_block_index
;
2469 /* Total number of float blocks now in use. */
2473 /* Free-list of Lisp_Floats. */
2475 struct Lisp_Float
*float_free_list
;
2478 /* Initialize float allocation. */
2484 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2485 float_free_list
= 0;
2490 /* Return a new float object with value FLOAT_VALUE. */
2493 make_float (double float_value
)
2495 register Lisp_Object val
;
2497 /* eassert (!handling_signal); */
2501 if (float_free_list
)
2503 /* We use the data field for chaining the free list
2504 so that we won't use the same field that has the mark bit. */
2505 XSETFLOAT (val
, float_free_list
);
2506 float_free_list
= float_free_list
->u
.chain
;
2510 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2512 register struct float_block
*new;
2514 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2516 new->next
= float_block
;
2517 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2519 float_block_index
= 0;
2522 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2523 float_block_index
++;
2526 MALLOC_UNBLOCK_INPUT
;
2528 XFLOAT_INIT (val
, float_value
);
2529 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2530 consing_since_gc
+= sizeof (struct Lisp_Float
);
2537 /***********************************************************************
2539 ***********************************************************************/
2541 /* We store cons cells inside of cons_blocks, allocating a new
2542 cons_block with malloc whenever necessary. Cons cells reclaimed by
2543 GC are put on a free list to be reallocated before allocating
2544 any new cons cells from the latest cons_block. */
2546 #define CONS_BLOCK_SIZE \
2547 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2548 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2550 #define CONS_BLOCK(fptr) \
2551 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2553 #define CONS_INDEX(fptr) \
2554 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2558 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2559 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2560 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2561 struct cons_block
*next
;
2564 #define CONS_MARKED_P(fptr) \
2565 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2567 #define CONS_MARK(fptr) \
2568 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2570 #define CONS_UNMARK(fptr) \
2571 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2573 /* Current cons_block. */
2575 struct cons_block
*cons_block
;
2577 /* Index of first unused Lisp_Cons in the current block. */
2579 int cons_block_index
;
2581 /* Free-list of Lisp_Cons structures. */
2583 struct Lisp_Cons
*cons_free_list
;
2585 /* Total number of cons blocks now in use. */
2587 static int n_cons_blocks
;
2590 /* Initialize cons allocation. */
2596 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2602 /* Explicitly free a cons cell by putting it on the free-list. */
2605 free_cons (struct Lisp_Cons
*ptr
)
2607 ptr
->u
.chain
= cons_free_list
;
2611 cons_free_list
= ptr
;
2614 DEFUE ("cons", Fcons
, Scons
, 2, 2, 0,
2615 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2616 (Lisp_Object car
, Lisp_Object cdr
)
2618 register Lisp_Object val
;
2620 /* eassert (!handling_signal); */
2626 /* We use the cdr for chaining the free list
2627 so that we won't use the same field that has the mark bit. */
2628 XSETCONS (val
, cons_free_list
);
2629 cons_free_list
= cons_free_list
->u
.chain
;
2633 if (cons_block_index
== CONS_BLOCK_SIZE
)
2635 register struct cons_block
*new;
2636 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2638 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2639 new->next
= cons_block
;
2641 cons_block_index
= 0;
2644 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2648 MALLOC_UNBLOCK_INPUT
;
2652 eassert (!CONS_MARKED_P (XCONS (val
)));
2653 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2654 cons_cells_consed
++;
2658 #ifdef GC_CHECK_CONS_LIST
2659 /* Get an error now if there's any junk in the cons free list. */
2661 check_cons_list (void)
2663 struct Lisp_Cons
*tail
= cons_free_list
;
2666 tail
= tail
->u
.chain
;
2670 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2673 list1 (Lisp_Object arg1
)
2675 return Fcons (arg1
, Qnil
);
2679 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2681 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2686 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2688 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2693 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2695 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2700 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2702 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2703 Fcons (arg5
, Qnil
)))));
2707 DEFUE ("list", Flist
, Slist
, 0, MANY
, 0,
2708 doc
: /* Return a newly created list with specified arguments as elements.
2709 Any number of arguments, even zero arguments, are allowed.
2710 usage: (list &rest OBJECTS) */)
2711 (size_t nargs
, register Lisp_Object
*args
)
2713 register Lisp_Object val
;
2719 val
= Fcons (args
[nargs
], val
);
2725 DEFUE ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2726 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2727 (register Lisp_Object length
, Lisp_Object init
)
2729 register Lisp_Object val
;
2730 register EMACS_INT size
;
2732 CHECK_NATNUM (length
);
2733 size
= XFASTINT (length
);
2738 val
= Fcons (init
, val
);
2743 val
= Fcons (init
, val
);
2748 val
= Fcons (init
, val
);
2753 val
= Fcons (init
, val
);
2758 val
= Fcons (init
, val
);
2773 /***********************************************************************
2775 ***********************************************************************/
2777 /* Singly-linked list of all vectors. */
2779 static struct Lisp_Vector
*all_vectors
;
2781 /* Total number of vector-like objects now in use. */
2783 static int n_vectors
;
2786 /* Value is a pointer to a newly allocated Lisp_Vector structure
2787 with room for LEN Lisp_Objects. */
2789 static struct Lisp_Vector
*
2790 allocate_vectorlike (EMACS_INT len
)
2792 struct Lisp_Vector
*p
;
2797 #ifdef DOUG_LEA_MALLOC
2798 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2799 because mapped region contents are not preserved in
2801 mallopt (M_MMAP_MAX
, 0);
2804 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2805 /* eassert (!handling_signal); */
2807 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2808 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
2810 #ifdef DOUG_LEA_MALLOC
2811 /* Back to a reasonable maximum of mmap'ed areas. */
2812 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2815 consing_since_gc
+= nbytes
;
2816 vector_cells_consed
+= len
;
2818 p
->next
= all_vectors
;
2821 MALLOC_UNBLOCK_INPUT
;
2828 /* Allocate a vector with NSLOTS slots. */
2830 struct Lisp_Vector
*
2831 allocate_vector (EMACS_INT nslots
)
2833 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
);
2839 /* Allocate other vector-like structures. */
2841 struct Lisp_Vector
*
2842 allocate_pseudovector (int memlen
, int lisplen
, EMACS_INT tag
)
2844 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2847 /* Only the first lisplen slots will be traced normally by the GC. */
2849 for (i
= 0; i
< lisplen
; ++i
)
2850 v
->contents
[i
] = Qnil
;
2852 XSETPVECTYPE (v
, tag
); /* Add the appropriate tag. */
2856 struct Lisp_Hash_Table
*
2857 allocate_hash_table (void)
2859 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
2864 allocate_window (void)
2866 return ALLOCATE_PSEUDOVECTOR(struct window
, current_matrix
, PVEC_WINDOW
);
2871 allocate_terminal (void)
2873 struct terminal
*t
= ALLOCATE_PSEUDOVECTOR (struct terminal
,
2874 next_terminal
, PVEC_TERMINAL
);
2875 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2876 memset (&t
->next_terminal
, 0,
2877 (char*) (t
+ 1) - (char*) &t
->next_terminal
);
2883 allocate_frame (void)
2885 struct frame
*f
= ALLOCATE_PSEUDOVECTOR (struct frame
,
2886 face_cache
, PVEC_FRAME
);
2887 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2888 memset (&f
->face_cache
, 0,
2889 (char *) (f
+ 1) - (char *) &f
->face_cache
);
2894 struct Lisp_Process
*
2895 allocate_process (void)
2897 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
2901 DEFUE ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2902 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2903 See also the function `vector'. */)
2904 (register Lisp_Object length
, Lisp_Object init
)
2907 register EMACS_INT sizei
;
2908 register EMACS_INT i
;
2909 register struct Lisp_Vector
*p
;
2911 CHECK_NATNUM (length
);
2912 sizei
= XFASTINT (length
);
2914 p
= allocate_vector (sizei
);
2915 for (i
= 0; i
< sizei
; i
++)
2916 p
->contents
[i
] = init
;
2918 XSETVECTOR (vector
, p
);
2923 DEFUE ("vector", Fvector
, Svector
, 0, MANY
, 0,
2924 doc
: /* Return a newly created vector with specified arguments as elements.
2925 Any number of arguments, even zero arguments, are allowed.
2926 usage: (vector &rest OBJECTS) */)
2927 (register size_t nargs
, Lisp_Object
*args
)
2929 register Lisp_Object len
, val
;
2931 register struct Lisp_Vector
*p
;
2933 XSETFASTINT (len
, nargs
);
2934 val
= Fmake_vector (len
, Qnil
);
2936 for (i
= 0; i
< nargs
; i
++)
2937 p
->contents
[i
] = args
[i
];
2942 DEFUE ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
2943 doc
: /* Create a byte-code object with specified arguments as elements.
2944 The arguments should be the ARGLIST, bytecode-string BYTE-CODE, constant
2945 vector CONSTANTS, maximum stack size DEPTH, (optional) DOCSTRING,
2946 and (optional) INTERACTIVE-SPEC.
2947 The first four arguments are required; at most six have any
2949 The ARGLIST can be either like the one of `lambda', in which case the arguments
2950 will be dynamically bound before executing the byte code, or it can be an
2951 integer of the form NNNNNNNRMMMMMMM where the 7bit MMMMMMM specifies the
2952 minimum number of arguments, the 7-bit NNNNNNN specifies the maximum number
2953 of arguments (ignoring &rest) and the R bit specifies whether there is a &rest
2954 argument to catch the left-over arguments. If such an integer is used, the
2955 arguments will not be dynamically bound but will be instead pushed on the
2956 stack before executing the byte-code.
2957 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
2958 (register size_t nargs
, Lisp_Object
*args
)
2960 register Lisp_Object len
, val
;
2962 register struct Lisp_Vector
*p
;
2964 XSETFASTINT (len
, nargs
);
2965 if (!NILP (Vpurify_flag
))
2966 val
= make_pure_vector ((EMACS_INT
) nargs
);
2968 val
= Fmake_vector (len
, Qnil
);
2970 if (nargs
> 1 && STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
2971 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
2972 earlier because they produced a raw 8-bit string for byte-code
2973 and now such a byte-code string is loaded as multibyte while
2974 raw 8-bit characters converted to multibyte form. Thus, now we
2975 must convert them back to the original unibyte form. */
2976 args
[1] = Fstring_as_unibyte (args
[1]);
2979 for (i
= 0; i
< nargs
; i
++)
2981 if (!NILP (Vpurify_flag
))
2982 args
[i
] = Fpurecopy (args
[i
]);
2983 p
->contents
[i
] = args
[i
];
2985 XSETPVECTYPE (p
, PVEC_COMPILED
);
2986 XSETCOMPILED (val
, p
);
2992 /***********************************************************************
2994 ***********************************************************************/
2996 /* Each symbol_block is just under 1020 bytes long, since malloc
2997 really allocates in units of powers of two and uses 4 bytes for its
3000 #define SYMBOL_BLOCK_SIZE \
3001 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3005 /* Place `symbols' first, to preserve alignment. */
3006 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3007 struct symbol_block
*next
;
3010 /* Current symbol block and index of first unused Lisp_Symbol
3013 static struct symbol_block
*symbol_block
;
3014 static int symbol_block_index
;
3016 /* List of free symbols. */
3018 static struct Lisp_Symbol
*symbol_free_list
;
3020 /* Total number of symbol blocks now in use. */
3022 static int n_symbol_blocks
;
3025 /* Initialize symbol allocation. */
3030 symbol_block
= NULL
;
3031 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3032 symbol_free_list
= 0;
3033 n_symbol_blocks
= 0;
3037 DEFUE ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3038 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3039 Its value and function definition are void, and its property list is nil. */)
3042 register Lisp_Object val
;
3043 register struct Lisp_Symbol
*p
;
3045 CHECK_STRING (name
);
3047 /* eassert (!handling_signal); */
3051 if (symbol_free_list
)
3053 XSETSYMBOL (val
, symbol_free_list
);
3054 symbol_free_list
= symbol_free_list
->next
;
3058 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3060 struct symbol_block
*new;
3061 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3063 new->next
= symbol_block
;
3065 symbol_block_index
= 0;
3068 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3069 symbol_block_index
++;
3072 MALLOC_UNBLOCK_INPUT
;
3077 p
->redirect
= SYMBOL_PLAINVAL
;
3078 SET_SYMBOL_VAL (p
, Qunbound
);
3079 p
->function
= Qunbound
;
3082 p
->interned
= SYMBOL_UNINTERNED
;
3084 p
->declared_special
= 0;
3085 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3092 /***********************************************************************
3093 Marker (Misc) Allocation
3094 ***********************************************************************/
3096 /* Allocation of markers and other objects that share that structure.
3097 Works like allocation of conses. */
3099 #define MARKER_BLOCK_SIZE \
3100 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3104 /* Place `markers' first, to preserve alignment. */
3105 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3106 struct marker_block
*next
;
3109 static struct marker_block
*marker_block
;
3110 static int marker_block_index
;
3112 static union Lisp_Misc
*marker_free_list
;
3114 /* Total number of marker blocks now in use. */
3116 static int n_marker_blocks
;
3121 marker_block
= NULL
;
3122 marker_block_index
= MARKER_BLOCK_SIZE
;
3123 marker_free_list
= 0;
3124 n_marker_blocks
= 0;
3127 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3130 allocate_misc (void)
3134 /* eassert (!handling_signal); */
3138 if (marker_free_list
)
3140 XSETMISC (val
, marker_free_list
);
3141 marker_free_list
= marker_free_list
->u_free
.chain
;
3145 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3147 struct marker_block
*new;
3148 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3150 new->next
= marker_block
;
3152 marker_block_index
= 0;
3154 total_free_markers
+= MARKER_BLOCK_SIZE
;
3156 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3157 marker_block_index
++;
3160 MALLOC_UNBLOCK_INPUT
;
3162 --total_free_markers
;
3163 consing_since_gc
+= sizeof (union Lisp_Misc
);
3164 misc_objects_consed
++;
3165 XMISCANY (val
)->gcmarkbit
= 0;
3169 /* Free a Lisp_Misc object */
3172 free_misc (Lisp_Object misc
)
3174 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3175 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3176 marker_free_list
= XMISC (misc
);
3178 total_free_markers
++;
3181 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3182 INTEGER. This is used to package C values to call record_unwind_protect.
3183 The unwind function can get the C values back using XSAVE_VALUE. */
3186 make_save_value (void *pointer
, int integer
)
3188 register Lisp_Object val
;
3189 register struct Lisp_Save_Value
*p
;
3191 val
= allocate_misc ();
3192 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3193 p
= XSAVE_VALUE (val
);
3194 p
->pointer
= pointer
;
3195 p
->integer
= integer
;
3200 DEFUE ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3201 doc
: /* Return a newly allocated marker which does not point at any place. */)
3204 register Lisp_Object val
;
3205 register struct Lisp_Marker
*p
;
3207 val
= allocate_misc ();
3208 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3214 p
->insertion_type
= 0;
3218 /* Put MARKER back on the free list after using it temporarily. */
3221 free_marker (Lisp_Object marker
)
3223 unchain_marker (XMARKER (marker
));
3228 /* Return a newly created vector or string with specified arguments as
3229 elements. If all the arguments are characters that can fit
3230 in a string of events, make a string; otherwise, make a vector.
3232 Any number of arguments, even zero arguments, are allowed. */
3235 make_event_array (register int nargs
, Lisp_Object
*args
)
3239 for (i
= 0; i
< nargs
; i
++)
3240 /* The things that fit in a string
3241 are characters that are in 0...127,
3242 after discarding the meta bit and all the bits above it. */
3243 if (!INTEGERP (args
[i
])
3244 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3245 return Fvector (nargs
, args
);
3247 /* Since the loop exited, we know that all the things in it are
3248 characters, so we can make a string. */
3252 result
= Fmake_string (make_number (nargs
), make_number (0));
3253 for (i
= 0; i
< nargs
; i
++)
3255 SSET (result
, i
, XINT (args
[i
]));
3256 /* Move the meta bit to the right place for a string char. */
3257 if (XINT (args
[i
]) & CHAR_META
)
3258 SSET (result
, i
, SREF (result
, i
) | 0x80);
3267 /************************************************************************
3268 Memory Full Handling
3269 ************************************************************************/
3272 /* Called if malloc returns zero. */
3281 memory_full_cons_threshold
= sizeof (struct cons_block
);
3283 /* The first time we get here, free the spare memory. */
3284 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3285 if (spare_memory
[i
])
3288 free (spare_memory
[i
]);
3289 else if (i
>= 1 && i
<= 4)
3290 lisp_align_free (spare_memory
[i
]);
3292 lisp_free (spare_memory
[i
]);
3293 spare_memory
[i
] = 0;
3296 /* Record the space now used. When it decreases substantially,
3297 we can refill the memory reserve. */
3298 #ifndef SYSTEM_MALLOC
3299 bytes_used_when_full
= BYTES_USED
;
3302 /* This used to call error, but if we've run out of memory, we could
3303 get infinite recursion trying to build the string. */
3304 xsignal (Qnil
, Vmemory_signal_data
);
3307 /* If we released our reserve (due to running out of memory),
3308 and we have a fair amount free once again,
3309 try to set aside another reserve in case we run out once more.
3311 This is called when a relocatable block is freed in ralloc.c,
3312 and also directly from this file, in case we're not using ralloc.c. */
3315 refill_memory_reserve (void)
3317 #ifndef SYSTEM_MALLOC
3318 if (spare_memory
[0] == 0)
3319 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3320 if (spare_memory
[1] == 0)
3321 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3323 if (spare_memory
[2] == 0)
3324 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3326 if (spare_memory
[3] == 0)
3327 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3329 if (spare_memory
[4] == 0)
3330 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3332 if (spare_memory
[5] == 0)
3333 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3335 if (spare_memory
[6] == 0)
3336 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3338 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3339 Vmemory_full
= Qnil
;
3343 /************************************************************************
3345 ************************************************************************/
3347 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3349 /* Conservative C stack marking requires a method to identify possibly
3350 live Lisp objects given a pointer value. We do this by keeping
3351 track of blocks of Lisp data that are allocated in a red-black tree
3352 (see also the comment of mem_node which is the type of nodes in
3353 that tree). Function lisp_malloc adds information for an allocated
3354 block to the red-black tree with calls to mem_insert, and function
3355 lisp_free removes it with mem_delete. Functions live_string_p etc
3356 call mem_find to lookup information about a given pointer in the
3357 tree, and use that to determine if the pointer points to a Lisp
3360 /* Initialize this part of alloc.c. */
3365 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3366 mem_z
.parent
= NULL
;
3367 mem_z
.color
= MEM_BLACK
;
3368 mem_z
.start
= mem_z
.end
= NULL
;
3373 /* Value is a pointer to the mem_node containing START. Value is
3374 MEM_NIL if there is no node in the tree containing START. */
3376 static INLINE
struct mem_node
*
3377 mem_find (void *start
)
3381 if (start
< min_heap_address
|| start
> max_heap_address
)
3384 /* Make the search always successful to speed up the loop below. */
3385 mem_z
.start
= start
;
3386 mem_z
.end
= (char *) start
+ 1;
3389 while (start
< p
->start
|| start
>= p
->end
)
3390 p
= start
< p
->start
? p
->left
: p
->right
;
3395 /* Insert a new node into the tree for a block of memory with start
3396 address START, end address END, and type TYPE. Value is a
3397 pointer to the node that was inserted. */
3399 static struct mem_node
*
3400 mem_insert (void *start
, void *end
, enum mem_type type
)
3402 struct mem_node
*c
, *parent
, *x
;
3404 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3405 min_heap_address
= start
;
3406 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3407 max_heap_address
= end
;
3409 /* See where in the tree a node for START belongs. In this
3410 particular application, it shouldn't happen that a node is already
3411 present. For debugging purposes, let's check that. */
3415 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3417 while (c
!= MEM_NIL
)
3419 if (start
>= c
->start
&& start
< c
->end
)
3422 c
= start
< c
->start
? c
->left
: c
->right
;
3425 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3427 while (c
!= MEM_NIL
)
3430 c
= start
< c
->start
? c
->left
: c
->right
;
3433 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3435 /* Create a new node. */
3436 #ifdef GC_MALLOC_CHECK
3437 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3441 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3447 x
->left
= x
->right
= MEM_NIL
;
3450 /* Insert it as child of PARENT or install it as root. */
3453 if (start
< parent
->start
)
3461 /* Re-establish red-black tree properties. */
3462 mem_insert_fixup (x
);
3468 /* Re-establish the red-black properties of the tree, and thereby
3469 balance the tree, after node X has been inserted; X is always red. */
3472 mem_insert_fixup (struct mem_node
*x
)
3474 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3476 /* X is red and its parent is red. This is a violation of
3477 red-black tree property #3. */
3479 if (x
->parent
== x
->parent
->parent
->left
)
3481 /* We're on the left side of our grandparent, and Y is our
3483 struct mem_node
*y
= x
->parent
->parent
->right
;
3485 if (y
->color
== MEM_RED
)
3487 /* Uncle and parent are red but should be black because
3488 X is red. Change the colors accordingly and proceed
3489 with the grandparent. */
3490 x
->parent
->color
= MEM_BLACK
;
3491 y
->color
= MEM_BLACK
;
3492 x
->parent
->parent
->color
= MEM_RED
;
3493 x
= x
->parent
->parent
;
3497 /* Parent and uncle have different colors; parent is
3498 red, uncle is black. */
3499 if (x
== x
->parent
->right
)
3502 mem_rotate_left (x
);
3505 x
->parent
->color
= MEM_BLACK
;
3506 x
->parent
->parent
->color
= MEM_RED
;
3507 mem_rotate_right (x
->parent
->parent
);
3512 /* This is the symmetrical case of above. */
3513 struct mem_node
*y
= x
->parent
->parent
->left
;
3515 if (y
->color
== MEM_RED
)
3517 x
->parent
->color
= MEM_BLACK
;
3518 y
->color
= MEM_BLACK
;
3519 x
->parent
->parent
->color
= MEM_RED
;
3520 x
= x
->parent
->parent
;
3524 if (x
== x
->parent
->left
)
3527 mem_rotate_right (x
);
3530 x
->parent
->color
= MEM_BLACK
;
3531 x
->parent
->parent
->color
= MEM_RED
;
3532 mem_rotate_left (x
->parent
->parent
);
3537 /* The root may have been changed to red due to the algorithm. Set
3538 it to black so that property #5 is satisfied. */
3539 mem_root
->color
= MEM_BLACK
;
3550 mem_rotate_left (struct mem_node
*x
)
3554 /* Turn y's left sub-tree into x's right sub-tree. */
3557 if (y
->left
!= MEM_NIL
)
3558 y
->left
->parent
= x
;
3560 /* Y's parent was x's parent. */
3562 y
->parent
= x
->parent
;
3564 /* Get the parent to point to y instead of x. */
3567 if (x
== x
->parent
->left
)
3568 x
->parent
->left
= y
;
3570 x
->parent
->right
= y
;
3575 /* Put x on y's left. */
3589 mem_rotate_right (struct mem_node
*x
)
3591 struct mem_node
*y
= x
->left
;
3594 if (y
->right
!= MEM_NIL
)
3595 y
->right
->parent
= x
;
3598 y
->parent
= x
->parent
;
3601 if (x
== x
->parent
->right
)
3602 x
->parent
->right
= y
;
3604 x
->parent
->left
= y
;
3615 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3618 mem_delete (struct mem_node
*z
)
3620 struct mem_node
*x
, *y
;
3622 if (!z
|| z
== MEM_NIL
)
3625 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3630 while (y
->left
!= MEM_NIL
)
3634 if (y
->left
!= MEM_NIL
)
3639 x
->parent
= y
->parent
;
3642 if (y
== y
->parent
->left
)
3643 y
->parent
->left
= x
;
3645 y
->parent
->right
= x
;
3652 z
->start
= y
->start
;
3657 if (y
->color
== MEM_BLACK
)
3658 mem_delete_fixup (x
);
3660 #ifdef GC_MALLOC_CHECK
3668 /* Re-establish the red-black properties of the tree, after a
3672 mem_delete_fixup (struct mem_node
*x
)
3674 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3676 if (x
== x
->parent
->left
)
3678 struct mem_node
*w
= x
->parent
->right
;
3680 if (w
->color
== MEM_RED
)
3682 w
->color
= MEM_BLACK
;
3683 x
->parent
->color
= MEM_RED
;
3684 mem_rotate_left (x
->parent
);
3685 w
= x
->parent
->right
;
3688 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3695 if (w
->right
->color
== MEM_BLACK
)
3697 w
->left
->color
= MEM_BLACK
;
3699 mem_rotate_right (w
);
3700 w
= x
->parent
->right
;
3702 w
->color
= x
->parent
->color
;
3703 x
->parent
->color
= MEM_BLACK
;
3704 w
->right
->color
= MEM_BLACK
;
3705 mem_rotate_left (x
->parent
);
3711 struct mem_node
*w
= x
->parent
->left
;
3713 if (w
->color
== MEM_RED
)
3715 w
->color
= MEM_BLACK
;
3716 x
->parent
->color
= MEM_RED
;
3717 mem_rotate_right (x
->parent
);
3718 w
= x
->parent
->left
;
3721 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3728 if (w
->left
->color
== MEM_BLACK
)
3730 w
->right
->color
= MEM_BLACK
;
3732 mem_rotate_left (w
);
3733 w
= x
->parent
->left
;
3736 w
->color
= x
->parent
->color
;
3737 x
->parent
->color
= MEM_BLACK
;
3738 w
->left
->color
= MEM_BLACK
;
3739 mem_rotate_right (x
->parent
);
3745 x
->color
= MEM_BLACK
;
3749 /* Value is non-zero if P is a pointer to a live Lisp string on
3750 the heap. M is a pointer to the mem_block for P. */
3753 live_string_p (struct mem_node
*m
, void *p
)
3755 if (m
->type
== MEM_TYPE_STRING
)
3757 struct string_block
*b
= (struct string_block
*) m
->start
;
3758 ptrdiff_t offset
= (char *) p
- (char *) &b
->strings
[0];
3760 /* P must point to the start of a Lisp_String structure, and it
3761 must not be on the free-list. */
3763 && offset
% sizeof b
->strings
[0] == 0
3764 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3765 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3772 /* Value is non-zero if P is a pointer to a live Lisp cons on
3773 the heap. M is a pointer to the mem_block for P. */
3776 live_cons_p (struct mem_node
*m
, void *p
)
3778 if (m
->type
== MEM_TYPE_CONS
)
3780 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3781 ptrdiff_t offset
= (char *) p
- (char *) &b
->conses
[0];
3783 /* P must point to the start of a Lisp_Cons, not be
3784 one of the unused cells in the current cons block,
3785 and not be on the free-list. */
3787 && offset
% sizeof b
->conses
[0] == 0
3788 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3790 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3791 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3798 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3799 the heap. M is a pointer to the mem_block for P. */
3802 live_symbol_p (struct mem_node
*m
, void *p
)
3804 if (m
->type
== MEM_TYPE_SYMBOL
)
3806 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3807 ptrdiff_t offset
= (char *) p
- (char *) &b
->symbols
[0];
3809 /* P must point to the start of a Lisp_Symbol, not be
3810 one of the unused cells in the current symbol block,
3811 and not be on the free-list. */
3813 && offset
% sizeof b
->symbols
[0] == 0
3814 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3815 && (b
!= symbol_block
3816 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3817 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3824 /* Value is non-zero if P is a pointer to a live Lisp float on
3825 the heap. M is a pointer to the mem_block for P. */
3828 live_float_p (struct mem_node
*m
, void *p
)
3830 if (m
->type
== MEM_TYPE_FLOAT
)
3832 struct float_block
*b
= (struct float_block
*) m
->start
;
3833 ptrdiff_t offset
= (char *) p
- (char *) &b
->floats
[0];
3835 /* P must point to the start of a Lisp_Float and not be
3836 one of the unused cells in the current float block. */
3838 && offset
% sizeof b
->floats
[0] == 0
3839 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3840 && (b
!= float_block
3841 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3848 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3849 the heap. M is a pointer to the mem_block for P. */
3852 live_misc_p (struct mem_node
*m
, void *p
)
3854 if (m
->type
== MEM_TYPE_MISC
)
3856 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3857 ptrdiff_t offset
= (char *) p
- (char *) &b
->markers
[0];
3859 /* P must point to the start of a Lisp_Misc, not be
3860 one of the unused cells in the current misc block,
3861 and not be on the free-list. */
3863 && offset
% sizeof b
->markers
[0] == 0
3864 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3865 && (b
!= marker_block
3866 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3867 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
3874 /* Value is non-zero if P is a pointer to a live vector-like object.
3875 M is a pointer to the mem_block for P. */
3878 live_vector_p (struct mem_node
*m
, void *p
)
3880 return (p
== m
->start
&& m
->type
== MEM_TYPE_VECTORLIKE
);
3884 /* Value is non-zero if P is a pointer to a live buffer. M is a
3885 pointer to the mem_block for P. */
3888 live_buffer_p (struct mem_node
*m
, void *p
)
3890 /* P must point to the start of the block, and the buffer
3891 must not have been killed. */
3892 return (m
->type
== MEM_TYPE_BUFFER
3894 && !NILP (((struct buffer
*) p
)->BUFFER_INTERNAL_FIELD (name
)));
3897 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3901 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3903 /* Array of objects that are kept alive because the C stack contains
3904 a pattern that looks like a reference to them . */
3906 #define MAX_ZOMBIES 10
3907 static Lisp_Object zombies
[MAX_ZOMBIES
];
3909 /* Number of zombie objects. */
3911 static int nzombies
;
3913 /* Number of garbage collections. */
3917 /* Average percentage of zombies per collection. */
3919 static double avg_zombies
;
3921 /* Max. number of live and zombie objects. */
3923 static int max_live
, max_zombies
;
3925 /* Average number of live objects per GC. */
3927 static double avg_live
;
3929 DEFUE ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3930 doc
: /* Show information about live and zombie objects. */)
3933 Lisp_Object args
[8], zombie_list
= Qnil
;
3935 for (i
= 0; i
< nzombies
; i
++)
3936 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3937 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3938 args
[1] = make_number (ngcs
);
3939 args
[2] = make_float (avg_live
);
3940 args
[3] = make_float (avg_zombies
);
3941 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
3942 args
[5] = make_number (max_live
);
3943 args
[6] = make_number (max_zombies
);
3944 args
[7] = zombie_list
;
3945 return Fmessage (8, args
);
3948 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3951 /* Mark OBJ if we can prove it's a Lisp_Object. */
3954 mark_maybe_object (Lisp_Object obj
)
3962 po
= (void *) XPNTR (obj
);
3969 switch (XTYPE (obj
))
3972 mark_p
= (live_string_p (m
, po
)
3973 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
3977 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
3981 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
3985 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
3988 case Lisp_Vectorlike
:
3989 /* Note: can't check BUFFERP before we know it's a
3990 buffer because checking that dereferences the pointer
3991 PO which might point anywhere. */
3992 if (live_vector_p (m
, po
))
3993 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
3994 else if (live_buffer_p (m
, po
))
3995 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
3999 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4008 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4009 if (nzombies
< MAX_ZOMBIES
)
4010 zombies
[nzombies
] = obj
;
4019 /* If P points to Lisp data, mark that as live if it isn't already
4023 mark_maybe_pointer (void *p
)
4027 /* Quickly rule out some values which can't point to Lisp data. */
4030 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */
4032 2 /* We assume that Lisp data is aligned on even addresses. */
4040 Lisp_Object obj
= Qnil
;
4044 case MEM_TYPE_NON_LISP
:
4045 /* Nothing to do; not a pointer to Lisp memory. */
4048 case MEM_TYPE_BUFFER
:
4049 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4050 XSETVECTOR (obj
, p
);
4054 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4058 case MEM_TYPE_STRING
:
4059 if (live_string_p (m
, p
)
4060 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4061 XSETSTRING (obj
, p
);
4065 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4069 case MEM_TYPE_SYMBOL
:
4070 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4071 XSETSYMBOL (obj
, p
);
4074 case MEM_TYPE_FLOAT
:
4075 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4079 case MEM_TYPE_VECTORLIKE
:
4080 if (live_vector_p (m
, p
))
4083 XSETVECTOR (tem
, p
);
4084 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4099 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4100 or END+OFFSET..START. */
4103 mark_memory (void *start
, void *end
, int offset
)
4108 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4112 /* Make START the pointer to the start of the memory region,
4113 if it isn't already. */
4121 /* Mark Lisp_Objects. */
4122 for (p
= (Lisp_Object
*) ((char *) start
+ offset
); (void *) p
< end
; ++p
)
4123 mark_maybe_object (*p
);
4125 /* Mark Lisp data pointed to. This is necessary because, in some
4126 situations, the C compiler optimizes Lisp objects away, so that
4127 only a pointer to them remains. Example:
4129 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4132 Lisp_Object obj = build_string ("test");
4133 struct Lisp_String *s = XSTRING (obj);
4134 Fgarbage_collect ();
4135 fprintf (stderr, "test `%s'\n", s->data);
4139 Here, `obj' isn't really used, and the compiler optimizes it
4140 away. The only reference to the life string is through the
4143 for (pp
= (void **) ((char *) start
+ offset
); (void *) pp
< end
; ++pp
)
4144 mark_maybe_pointer (*pp
);
4147 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4148 the GCC system configuration. In gcc 3.2, the only systems for
4149 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4150 by others?) and ns32k-pc532-min. */
4152 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4154 static int setjmp_tested_p
, longjmps_done
;
4156 #define SETJMP_WILL_LIKELY_WORK "\
4158 Emacs garbage collector has been changed to use conservative stack\n\
4159 marking. Emacs has determined that the method it uses to do the\n\
4160 marking will likely work on your system, but this isn't sure.\n\
4162 If you are a system-programmer, or can get the help of a local wizard\n\
4163 who is, please take a look at the function mark_stack in alloc.c, and\n\
4164 verify that the methods used are appropriate for your system.\n\
4166 Please mail the result to <emacs-devel@gnu.org>.\n\
4169 #define SETJMP_WILL_NOT_WORK "\
4171 Emacs garbage collector has been changed to use conservative stack\n\
4172 marking. Emacs has determined that the default method it uses to do the\n\
4173 marking will not work on your system. We will need a system-dependent\n\
4174 solution for your system.\n\
4176 Please take a look at the function mark_stack in alloc.c, and\n\
4177 try to find a way to make it work on your system.\n\
4179 Note that you may get false negatives, depending on the compiler.\n\
4180 In particular, you need to use -O with GCC for this test.\n\
4182 Please mail the result to <emacs-devel@gnu.org>.\n\
4186 /* Perform a quick check if it looks like setjmp saves registers in a
4187 jmp_buf. Print a message to stderr saying so. When this test
4188 succeeds, this is _not_ a proof that setjmp is sufficient for
4189 conservative stack marking. Only the sources or a disassembly
4200 /* Arrange for X to be put in a register. */
4206 if (longjmps_done
== 1)
4208 /* Came here after the longjmp at the end of the function.
4210 If x == 1, the longjmp has restored the register to its
4211 value before the setjmp, and we can hope that setjmp
4212 saves all such registers in the jmp_buf, although that
4215 For other values of X, either something really strange is
4216 taking place, or the setjmp just didn't save the register. */
4219 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4222 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4229 if (longjmps_done
== 1)
4233 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4236 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4238 /* Abort if anything GCPRO'd doesn't survive the GC. */
4246 for (p
= gcprolist
; p
; p
= p
->next
)
4247 for (i
= 0; i
< p
->nvars
; ++i
)
4248 if (!survives_gc_p (p
->var
[i
]))
4249 /* FIXME: It's not necessarily a bug. It might just be that the
4250 GCPRO is unnecessary or should release the object sooner. */
4254 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4261 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4262 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4264 fprintf (stderr
, " %d = ", i
);
4265 debug_print (zombies
[i
]);
4269 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4272 /* Mark live Lisp objects on the C stack.
4274 There are several system-dependent problems to consider when
4275 porting this to new architectures:
4279 We have to mark Lisp objects in CPU registers that can hold local
4280 variables or are used to pass parameters.
4282 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4283 something that either saves relevant registers on the stack, or
4284 calls mark_maybe_object passing it each register's contents.
4286 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4287 implementation assumes that calling setjmp saves registers we need
4288 to see in a jmp_buf which itself lies on the stack. This doesn't
4289 have to be true! It must be verified for each system, possibly
4290 by taking a look at the source code of setjmp.
4292 If __builtin_unwind_init is available (defined by GCC >= 2.8) we
4293 can use it as a machine independent method to store all registers
4294 to the stack. In this case the macros described in the previous
4295 two paragraphs are not used.
4299 Architectures differ in the way their processor stack is organized.
4300 For example, the stack might look like this
4303 | Lisp_Object | size = 4
4305 | something else | size = 2
4307 | Lisp_Object | size = 4
4311 In such a case, not every Lisp_Object will be aligned equally. To
4312 find all Lisp_Object on the stack it won't be sufficient to walk
4313 the stack in steps of 4 bytes. Instead, two passes will be
4314 necessary, one starting at the start of the stack, and a second
4315 pass starting at the start of the stack + 2. Likewise, if the
4316 minimal alignment of Lisp_Objects on the stack is 1, four passes
4317 would be necessary, each one starting with one byte more offset
4318 from the stack start.
4320 The current code assumes by default that Lisp_Objects are aligned
4321 equally on the stack. */
4329 #ifdef HAVE___BUILTIN_UNWIND_INIT
4330 /* Force callee-saved registers and register windows onto the stack.
4331 This is the preferred method if available, obviating the need for
4332 machine dependent methods. */
4333 __builtin_unwind_init ();
4335 #else /* not HAVE___BUILTIN_UNWIND_INIT */
4336 #ifndef GC_SAVE_REGISTERS_ON_STACK
4337 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4338 union aligned_jmpbuf
{
4342 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4344 /* This trick flushes the register windows so that all the state of
4345 the process is contained in the stack. */
4346 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4347 needed on ia64 too. See mach_dep.c, where it also says inline
4348 assembler doesn't work with relevant proprietary compilers. */
4350 #if defined (__sparc64__) && defined (__FreeBSD__)
4351 /* FreeBSD does not have a ta 3 handler. */
4358 /* Save registers that we need to see on the stack. We need to see
4359 registers used to hold register variables and registers used to
4361 #ifdef GC_SAVE_REGISTERS_ON_STACK
4362 GC_SAVE_REGISTERS_ON_STACK (end
);
4363 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4365 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4366 setjmp will definitely work, test it
4367 and print a message with the result
4369 if (!setjmp_tested_p
)
4371 setjmp_tested_p
= 1;
4374 #endif /* GC_SETJMP_WORKS */
4377 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4378 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4379 #endif /* not HAVE___BUILTIN_UNWIND_INIT */
4381 /* This assumes that the stack is a contiguous region in memory. If
4382 that's not the case, something has to be done here to iterate
4383 over the stack segments. */
4384 #ifndef GC_LISP_OBJECT_ALIGNMENT
4386 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4388 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4391 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4392 mark_memory (stack_base
, end
, i
);
4393 /* Allow for marking a secondary stack, like the register stack on the
4395 #ifdef GC_MARK_SECONDARY_STACK
4396 GC_MARK_SECONDARY_STACK ();
4399 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4404 #endif /* GC_MARK_STACK != 0 */
4407 /* Determine whether it is safe to access memory at address P. */
4409 valid_pointer_p (void *p
)
4412 return w32_valid_pointer_p (p
, 16);
4416 /* Obviously, we cannot just access it (we would SEGV trying), so we
4417 trick the o/s to tell us whether p is a valid pointer.
4418 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4419 not validate p in that case. */
4421 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4423 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4425 unlink ("__Valid__Lisp__Object__");
4433 /* Return 1 if OBJ is a valid lisp object.
4434 Return 0 if OBJ is NOT a valid lisp object.
4435 Return -1 if we cannot validate OBJ.
4436 This function can be quite slow,
4437 so it should only be used in code for manual debugging. */
4440 valid_lisp_object_p (Lisp_Object obj
)
4450 p
= (void *) XPNTR (obj
);
4451 if (PURE_POINTER_P (p
))
4455 return valid_pointer_p (p
);
4462 int valid
= valid_pointer_p (p
);
4474 case MEM_TYPE_NON_LISP
:
4477 case MEM_TYPE_BUFFER
:
4478 return live_buffer_p (m
, p
);
4481 return live_cons_p (m
, p
);
4483 case MEM_TYPE_STRING
:
4484 return live_string_p (m
, p
);
4487 return live_misc_p (m
, p
);
4489 case MEM_TYPE_SYMBOL
:
4490 return live_symbol_p (m
, p
);
4492 case MEM_TYPE_FLOAT
:
4493 return live_float_p (m
, p
);
4495 case MEM_TYPE_VECTORLIKE
:
4496 return live_vector_p (m
, p
);
4509 /***********************************************************************
4510 Pure Storage Management
4511 ***********************************************************************/
4513 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4514 pointer to it. TYPE is the Lisp type for which the memory is
4515 allocated. TYPE < 0 means it's not used for a Lisp object. */
4517 static POINTER_TYPE
*
4518 pure_alloc (size_t size
, int type
)
4520 POINTER_TYPE
*result
;
4522 size_t alignment
= (1 << GCTYPEBITS
);
4524 size_t alignment
= sizeof (EMACS_INT
);
4526 /* Give Lisp_Floats an extra alignment. */
4527 if (type
== Lisp_Float
)
4529 #if defined __GNUC__ && __GNUC__ >= 2
4530 alignment
= __alignof (struct Lisp_Float
);
4532 alignment
= sizeof (struct Lisp_Float
);
4540 /* Allocate space for a Lisp object from the beginning of the free
4541 space with taking account of alignment. */
4542 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4543 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4547 /* Allocate space for a non-Lisp object from the end of the free
4549 pure_bytes_used_non_lisp
+= size
;
4550 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4552 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4554 if (pure_bytes_used
<= pure_size
)
4557 /* Don't allocate a large amount here,
4558 because it might get mmap'd and then its address
4559 might not be usable. */
4560 purebeg
= (char *) xmalloc (10000);
4562 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4563 pure_bytes_used
= 0;
4564 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4569 /* Print a warning if PURESIZE is too small. */
4572 check_pure_size (void)
4574 if (pure_bytes_used_before_overflow
)
4575 message ("emacs:0:Pure Lisp storage overflow (approx. %d bytes needed)",
4576 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4580 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4581 the non-Lisp data pool of the pure storage, and return its start
4582 address. Return NULL if not found. */
4585 find_string_data_in_pure (const char *data
, EMACS_INT nbytes
)
4588 EMACS_INT skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4589 const unsigned char *p
;
4592 if (pure_bytes_used_non_lisp
< nbytes
+ 1)
4595 /* Set up the Boyer-Moore table. */
4597 for (i
= 0; i
< 256; i
++)
4600 p
= (const unsigned char *) data
;
4602 bm_skip
[*p
++] = skip
;
4604 last_char_skip
= bm_skip
['\0'];
4606 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4607 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4609 /* See the comments in the function `boyer_moore' (search.c) for the
4610 use of `infinity'. */
4611 infinity
= pure_bytes_used_non_lisp
+ 1;
4612 bm_skip
['\0'] = infinity
;
4614 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
4618 /* Check the last character (== '\0'). */
4621 start
+= bm_skip
[*(p
+ start
)];
4623 while (start
<= start_max
);
4625 if (start
< infinity
)
4626 /* Couldn't find the last character. */
4629 /* No less than `infinity' means we could find the last
4630 character at `p[start - infinity]'. */
4633 /* Check the remaining characters. */
4634 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4636 return non_lisp_beg
+ start
;
4638 start
+= last_char_skip
;
4640 while (start
<= start_max
);
4646 /* Return a string allocated in pure space. DATA is a buffer holding
4647 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4648 non-zero means make the result string multibyte.
4650 Must get an error if pure storage is full, since if it cannot hold
4651 a large string it may be able to hold conses that point to that
4652 string; then the string is not protected from gc. */
4655 make_pure_string (const char *data
,
4656 EMACS_INT nchars
, EMACS_INT nbytes
, int multibyte
)
4659 struct Lisp_String
*s
;
4661 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4662 s
->data
= (unsigned char *) find_string_data_in_pure (data
, nbytes
);
4663 if (s
->data
== NULL
)
4665 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4666 memcpy (s
->data
, data
, nbytes
);
4667 s
->data
[nbytes
] = '\0';
4670 s
->size_byte
= multibyte
? nbytes
: -1;
4671 s
->intervals
= NULL_INTERVAL
;
4672 XSETSTRING (string
, s
);
4676 /* Return a string a string allocated in pure space. Do not allocate
4677 the string data, just point to DATA. */
4680 make_pure_c_string (const char *data
)
4683 struct Lisp_String
*s
;
4684 EMACS_INT nchars
= strlen (data
);
4686 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4689 s
->data
= (unsigned char *) data
;
4690 s
->intervals
= NULL_INTERVAL
;
4691 XSETSTRING (string
, s
);
4695 /* Return a cons allocated from pure space. Give it pure copies
4696 of CAR as car and CDR as cdr. */
4699 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
4701 register Lisp_Object
new;
4702 struct Lisp_Cons
*p
;
4704 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4706 XSETCAR (new, Fpurecopy (car
));
4707 XSETCDR (new, Fpurecopy (cdr
));
4712 /* Value is a float object with value NUM allocated from pure space. */
4715 make_pure_float (double num
)
4717 register Lisp_Object
new;
4718 struct Lisp_Float
*p
;
4720 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4722 XFLOAT_INIT (new, num
);
4727 /* Return a vector with room for LEN Lisp_Objects allocated from
4731 make_pure_vector (EMACS_INT len
)
4734 struct Lisp_Vector
*p
;
4735 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4737 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4738 XSETVECTOR (new, p
);
4739 XVECTOR (new)->size
= len
;
4744 DEFUE ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4745 doc
: /* Make a copy of object OBJ in pure storage.
4746 Recursively copies contents of vectors and cons cells.
4747 Does not copy symbols. Copies strings without text properties. */)
4748 (register Lisp_Object obj
)
4750 if (NILP (Vpurify_flag
))
4753 if (PURE_POINTER_P (XPNTR (obj
)))
4756 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4758 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
4764 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
4765 else if (FLOATP (obj
))
4766 obj
= make_pure_float (XFLOAT_DATA (obj
));
4767 else if (STRINGP (obj
))
4768 obj
= make_pure_string (SSDATA (obj
), SCHARS (obj
),
4770 STRING_MULTIBYTE (obj
));
4771 else if (COMPILEDP (obj
) || VECTORP (obj
))
4773 register struct Lisp_Vector
*vec
;
4774 register EMACS_INT i
;
4777 size
= XVECTOR (obj
)->size
;
4778 if (size
& PSEUDOVECTOR_FLAG
)
4779 size
&= PSEUDOVECTOR_SIZE_MASK
;
4780 vec
= XVECTOR (make_pure_vector (size
));
4781 for (i
= 0; i
< size
; i
++)
4782 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4783 if (COMPILEDP (obj
))
4785 XSETPVECTYPE (vec
, PVEC_COMPILED
);
4786 XSETCOMPILED (obj
, vec
);
4789 XSETVECTOR (obj
, vec
);
4791 else if (MARKERP (obj
))
4792 error ("Attempt to copy a marker to pure storage");
4794 /* Not purified, don't hash-cons. */
4797 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4798 Fputhash (obj
, obj
, Vpurify_flag
);
4805 /***********************************************************************
4807 ***********************************************************************/
4809 /* Put an entry in staticvec, pointing at the variable with address
4813 staticpro (Lisp_Object
*varaddress
)
4815 staticvec
[staticidx
++] = varaddress
;
4816 if (staticidx
>= NSTATICS
)
4821 /***********************************************************************
4823 ***********************************************************************/
4825 /* Temporarily prevent garbage collection. */
4828 inhibit_garbage_collection (void)
4830 int count
= SPECPDL_INDEX ();
4831 int nbits
= min (VALBITS
, BITS_PER_INT
);
4833 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4838 DEFUE ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4839 doc
: /* Reclaim storage for Lisp objects no longer needed.
4840 Garbage collection happens automatically if you cons more than
4841 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4842 `garbage-collect' normally returns a list with info on amount of space in use:
4843 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4844 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4845 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4846 (USED-STRINGS . FREE-STRINGS))
4847 However, if there was overflow in pure space, `garbage-collect'
4848 returns nil, because real GC can't be done. */)
4851 register struct specbinding
*bind
;
4852 char stack_top_variable
;
4855 Lisp_Object total
[8];
4856 int count
= SPECPDL_INDEX ();
4857 EMACS_TIME t1
, t2
, t3
;
4862 /* Can't GC if pure storage overflowed because we can't determine
4863 if something is a pure object or not. */
4864 if (pure_bytes_used_before_overflow
)
4869 /* Don't keep undo information around forever.
4870 Do this early on, so it is no problem if the user quits. */
4872 register struct buffer
*nextb
= all_buffers
;
4876 /* If a buffer's undo list is Qt, that means that undo is
4877 turned off in that buffer. Calling truncate_undo_list on
4878 Qt tends to return NULL, which effectively turns undo back on.
4879 So don't call truncate_undo_list if undo_list is Qt. */
4880 if (! NILP (nextb
->BUFFER_INTERNAL_FIELD (name
)) && ! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
4881 truncate_undo_list (nextb
);
4883 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4884 if (nextb
->base_buffer
== 0 && !NILP (nextb
->BUFFER_INTERNAL_FIELD (name
))
4885 && ! nextb
->text
->inhibit_shrinking
)
4887 /* If a buffer's gap size is more than 10% of the buffer
4888 size, or larger than 2000 bytes, then shrink it
4889 accordingly. Keep a minimum size of 20 bytes. */
4890 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4892 if (nextb
->text
->gap_size
> size
)
4894 struct buffer
*save_current
= current_buffer
;
4895 current_buffer
= nextb
;
4896 make_gap (-(nextb
->text
->gap_size
- size
));
4897 current_buffer
= save_current
;
4901 nextb
= nextb
->next
;
4905 EMACS_GET_TIME (t1
);
4907 /* In case user calls debug_print during GC,
4908 don't let that cause a recursive GC. */
4909 consing_since_gc
= 0;
4911 /* Save what's currently displayed in the echo area. */
4912 message_p
= push_message ();
4913 record_unwind_protect (pop_message_unwind
, Qnil
);
4915 /* Save a copy of the contents of the stack, for debugging. */
4916 #if MAX_SAVE_STACK > 0
4917 if (NILP (Vpurify_flag
))
4921 if (&stack_top_variable
< stack_bottom
)
4923 stack
= &stack_top_variable
;
4924 stack_size
= stack_bottom
- &stack_top_variable
;
4928 stack
= stack_bottom
;
4929 stack_size
= &stack_top_variable
- stack_bottom
;
4931 if (stack_size
<= MAX_SAVE_STACK
)
4933 if (stack_copy_size
< stack_size
)
4935 stack_copy
= (char *) xrealloc (stack_copy
, stack_size
);
4936 stack_copy_size
= stack_size
;
4938 memcpy (stack_copy
, stack
, stack_size
);
4941 #endif /* MAX_SAVE_STACK > 0 */
4943 if (garbage_collection_messages
)
4944 message1_nolog ("Garbage collecting...");
4948 shrink_regexp_cache ();
4952 /* clear_marks (); */
4954 /* Mark all the special slots that serve as the roots of accessibility. */
4956 for (i
= 0; i
< staticidx
; i
++)
4957 mark_object (*staticvec
[i
]);
4959 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4961 mark_object (bind
->symbol
);
4962 mark_object (bind
->old_value
);
4970 extern void xg_mark_data (void);
4975 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
4976 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
4980 register struct gcpro
*tail
;
4981 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4982 for (i
= 0; i
< tail
->nvars
; i
++)
4983 mark_object (tail
->var
[i
]);
4987 struct catchtag
*catch;
4988 struct handler
*handler
;
4990 for (catch = catchlist
; catch; catch = catch->next
)
4992 mark_object (catch->tag
);
4993 mark_object (catch->val
);
4995 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
4997 mark_object (handler
->handler
);
4998 mark_object (handler
->var
);
5004 #ifdef HAVE_WINDOW_SYSTEM
5005 mark_fringe_data ();
5008 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5012 /* Everything is now marked, except for the things that require special
5013 finalization, i.e. the undo_list.
5014 Look thru every buffer's undo list
5015 for elements that update markers that were not marked,
5018 register struct buffer
*nextb
= all_buffers
;
5022 /* If a buffer's undo list is Qt, that means that undo is
5023 turned off in that buffer. Calling truncate_undo_list on
5024 Qt tends to return NULL, which effectively turns undo back on.
5025 So don't call truncate_undo_list if undo_list is Qt. */
5026 if (! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
5028 Lisp_Object tail
, prev
;
5029 tail
= nextb
->BUFFER_INTERNAL_FIELD (undo_list
);
5031 while (CONSP (tail
))
5033 if (CONSP (XCAR (tail
))
5034 && MARKERP (XCAR (XCAR (tail
)))
5035 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5038 nextb
->BUFFER_INTERNAL_FIELD (undo_list
) = tail
= XCDR (tail
);
5042 XSETCDR (prev
, tail
);
5052 /* Now that we have stripped the elements that need not be in the
5053 undo_list any more, we can finally mark the list. */
5054 mark_object (nextb
->BUFFER_INTERNAL_FIELD (undo_list
));
5056 nextb
= nextb
->next
;
5062 /* Clear the mark bits that we set in certain root slots. */
5064 unmark_byte_stack ();
5065 VECTOR_UNMARK (&buffer_defaults
);
5066 VECTOR_UNMARK (&buffer_local_symbols
);
5068 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5076 /* clear_marks (); */
5079 consing_since_gc
= 0;
5080 if (gc_cons_threshold
< 10000)
5081 gc_cons_threshold
= 10000;
5083 if (FLOATP (Vgc_cons_percentage
))
5084 { /* Set gc_cons_combined_threshold. */
5087 tot
+= total_conses
* sizeof (struct Lisp_Cons
);
5088 tot
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5089 tot
+= total_markers
* sizeof (union Lisp_Misc
);
5090 tot
+= total_string_size
;
5091 tot
+= total_vector_size
* sizeof (Lisp_Object
);
5092 tot
+= total_floats
* sizeof (struct Lisp_Float
);
5093 tot
+= total_intervals
* sizeof (struct interval
);
5094 tot
+= total_strings
* sizeof (struct Lisp_String
);
5096 gc_relative_threshold
= tot
* XFLOAT_DATA (Vgc_cons_percentage
);
5099 gc_relative_threshold
= 0;
5101 if (garbage_collection_messages
)
5103 if (message_p
|| minibuf_level
> 0)
5106 message1_nolog ("Garbage collecting...done");
5109 unbind_to (count
, Qnil
);
5111 total
[0] = Fcons (make_number (total_conses
),
5112 make_number (total_free_conses
));
5113 total
[1] = Fcons (make_number (total_symbols
),
5114 make_number (total_free_symbols
));
5115 total
[2] = Fcons (make_number (total_markers
),
5116 make_number (total_free_markers
));
5117 total
[3] = make_number (total_string_size
);
5118 total
[4] = make_number (total_vector_size
);
5119 total
[5] = Fcons (make_number (total_floats
),
5120 make_number (total_free_floats
));
5121 total
[6] = Fcons (make_number (total_intervals
),
5122 make_number (total_free_intervals
));
5123 total
[7] = Fcons (make_number (total_strings
),
5124 make_number (total_free_strings
));
5126 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5128 /* Compute average percentage of zombies. */
5131 for (i
= 0; i
< 7; ++i
)
5132 if (CONSP (total
[i
]))
5133 nlive
+= XFASTINT (XCAR (total
[i
]));
5135 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5136 max_live
= max (nlive
, max_live
);
5137 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5138 max_zombies
= max (nzombies
, max_zombies
);
5143 if (!NILP (Vpost_gc_hook
))
5145 int gc_count
= inhibit_garbage_collection ();
5146 safe_run_hooks (Qpost_gc_hook
);
5147 unbind_to (gc_count
, Qnil
);
5150 /* Accumulate statistics. */
5151 EMACS_GET_TIME (t2
);
5152 EMACS_SUB_TIME (t3
, t2
, t1
);
5153 if (FLOATP (Vgc_elapsed
))
5154 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5156 EMACS_USECS (t3
) * 1.0e-6);
5159 return Flist (sizeof total
/ sizeof *total
, total
);
5163 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5164 only interesting objects referenced from glyphs are strings. */
5167 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5169 struct glyph_row
*row
= matrix
->rows
;
5170 struct glyph_row
*end
= row
+ matrix
->nrows
;
5172 for (; row
< end
; ++row
)
5176 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5178 struct glyph
*glyph
= row
->glyphs
[area
];
5179 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5181 for (; glyph
< end_glyph
; ++glyph
)
5182 if (STRINGP (glyph
->object
)
5183 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5184 mark_object (glyph
->object
);
5190 /* Mark Lisp faces in the face cache C. */
5193 mark_face_cache (struct face_cache
*c
)
5198 for (i
= 0; i
< c
->used
; ++i
)
5200 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5204 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5205 mark_object (face
->lface
[j
]);
5213 /* Mark reference to a Lisp_Object.
5214 If the object referred to has not been seen yet, recursively mark
5215 all the references contained in it. */
5217 #define LAST_MARKED_SIZE 500
5218 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5219 int last_marked_index
;
5221 /* For debugging--call abort when we cdr down this many
5222 links of a list, in mark_object. In debugging,
5223 the call to abort will hit a breakpoint.
5224 Normally this is zero and the check never goes off. */
5225 static size_t mark_object_loop_halt
;
5228 mark_vectorlike (struct Lisp_Vector
*ptr
)
5230 register EMACS_UINT size
= ptr
->size
;
5231 register EMACS_UINT i
;
5233 eassert (!VECTOR_MARKED_P (ptr
));
5234 VECTOR_MARK (ptr
); /* Else mark it */
5235 if (size
& PSEUDOVECTOR_FLAG
)
5236 size
&= PSEUDOVECTOR_SIZE_MASK
;
5238 /* Note that this size is not the memory-footprint size, but only
5239 the number of Lisp_Object fields that we should trace.
5240 The distinction is used e.g. by Lisp_Process which places extra
5241 non-Lisp_Object fields at the end of the structure. */
5242 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5243 mark_object (ptr
->contents
[i
]);
5246 /* Like mark_vectorlike but optimized for char-tables (and
5247 sub-char-tables) assuming that the contents are mostly integers or
5251 mark_char_table (struct Lisp_Vector
*ptr
)
5253 register EMACS_UINT size
= ptr
->size
& PSEUDOVECTOR_SIZE_MASK
;
5254 register EMACS_UINT i
;
5256 eassert (!VECTOR_MARKED_P (ptr
));
5258 for (i
= 0; i
< size
; i
++)
5260 Lisp_Object val
= ptr
->contents
[i
];
5262 if (INTEGERP (val
) || (SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
))
5264 if (SUB_CHAR_TABLE_P (val
))
5266 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5267 mark_char_table (XVECTOR (val
));
5275 mark_object (Lisp_Object arg
)
5277 register Lisp_Object obj
= arg
;
5278 #ifdef GC_CHECK_MARKED_OBJECTS
5282 size_t cdr_count
= 0;
5286 if (PURE_POINTER_P (XPNTR (obj
)))
5289 last_marked
[last_marked_index
++] = obj
;
5290 if (last_marked_index
== LAST_MARKED_SIZE
)
5291 last_marked_index
= 0;
5293 /* Perform some sanity checks on the objects marked here. Abort if
5294 we encounter an object we know is bogus. This increases GC time
5295 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5296 #ifdef GC_CHECK_MARKED_OBJECTS
5298 po
= (void *) XPNTR (obj
);
5300 /* Check that the object pointed to by PO is known to be a Lisp
5301 structure allocated from the heap. */
5302 #define CHECK_ALLOCATED() \
5304 m = mem_find (po); \
5309 /* Check that the object pointed to by PO is live, using predicate
5311 #define CHECK_LIVE(LIVEP) \
5313 if (!LIVEP (m, po)) \
5317 /* Check both of the above conditions. */
5318 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5320 CHECK_ALLOCATED (); \
5321 CHECK_LIVE (LIVEP); \
5324 #else /* not GC_CHECK_MARKED_OBJECTS */
5326 #define CHECK_LIVE(LIVEP) (void) 0
5327 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5329 #endif /* not GC_CHECK_MARKED_OBJECTS */
5331 switch (SWITCH_ENUM_CAST (XTYPE (obj
)))
5335 register struct Lisp_String
*ptr
= XSTRING (obj
);
5336 if (STRING_MARKED_P (ptr
))
5338 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5339 MARK_INTERVAL_TREE (ptr
->intervals
);
5341 #ifdef GC_CHECK_STRING_BYTES
5342 /* Check that the string size recorded in the string is the
5343 same as the one recorded in the sdata structure. */
5344 CHECK_STRING_BYTES (ptr
);
5345 #endif /* GC_CHECK_STRING_BYTES */
5349 case Lisp_Vectorlike
:
5350 if (VECTOR_MARKED_P (XVECTOR (obj
)))
5352 #ifdef GC_CHECK_MARKED_OBJECTS
5354 if (m
== MEM_NIL
&& !SUBRP (obj
)
5355 && po
!= &buffer_defaults
5356 && po
!= &buffer_local_symbols
)
5358 #endif /* GC_CHECK_MARKED_OBJECTS */
5362 #ifdef GC_CHECK_MARKED_OBJECTS
5363 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5366 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
5371 #endif /* GC_CHECK_MARKED_OBJECTS */
5374 else if (SUBRP (obj
))
5376 else if (COMPILEDP (obj
))
5377 /* We could treat this just like a vector, but it is better to
5378 save the COMPILED_CONSTANTS element for last and avoid
5381 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5382 register EMACS_UINT size
= ptr
->size
;
5383 register EMACS_UINT i
;
5385 CHECK_LIVE (live_vector_p
);
5386 VECTOR_MARK (ptr
); /* Else mark it */
5387 size
&= PSEUDOVECTOR_SIZE_MASK
;
5388 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5390 if (i
!= COMPILED_CONSTANTS
)
5391 mark_object (ptr
->contents
[i
]);
5393 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5396 else if (FRAMEP (obj
))
5398 register struct frame
*ptr
= XFRAME (obj
);
5399 mark_vectorlike (XVECTOR (obj
));
5400 mark_face_cache (ptr
->face_cache
);
5402 else if (WINDOWP (obj
))
5404 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5405 struct window
*w
= XWINDOW (obj
);
5406 mark_vectorlike (ptr
);
5407 /* Mark glyphs for leaf windows. Marking window matrices is
5408 sufficient because frame matrices use the same glyph
5410 if (NILP (w
->hchild
)
5412 && w
->current_matrix
)
5414 mark_glyph_matrix (w
->current_matrix
);
5415 mark_glyph_matrix (w
->desired_matrix
);
5418 else if (HASH_TABLE_P (obj
))
5420 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5421 mark_vectorlike ((struct Lisp_Vector
*)h
);
5422 /* If hash table is not weak, mark all keys and values.
5423 For weak tables, mark only the vector. */
5425 mark_object (h
->key_and_value
);
5427 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5429 else if (CHAR_TABLE_P (obj
))
5430 mark_char_table (XVECTOR (obj
));
5432 mark_vectorlike (XVECTOR (obj
));
5437 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5438 struct Lisp_Symbol
*ptrx
;
5442 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5444 mark_object (ptr
->function
);
5445 mark_object (ptr
->plist
);
5446 switch (ptr
->redirect
)
5448 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
5449 case SYMBOL_VARALIAS
:
5452 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
5456 case SYMBOL_LOCALIZED
:
5458 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
5459 /* If the value is forwarded to a buffer or keyboard field,
5460 these are marked when we see the corresponding object.
5461 And if it's forwarded to a C variable, either it's not
5462 a Lisp_Object var, or it's staticpro'd already. */
5463 mark_object (blv
->where
);
5464 mark_object (blv
->valcell
);
5465 mark_object (blv
->defcell
);
5468 case SYMBOL_FORWARDED
:
5469 /* If the value is forwarded to a buffer or keyboard field,
5470 these are marked when we see the corresponding object.
5471 And if it's forwarded to a C variable, either it's not
5472 a Lisp_Object var, or it's staticpro'd already. */
5476 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5477 MARK_STRING (XSTRING (ptr
->xname
));
5478 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5483 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5484 XSETSYMBOL (obj
, ptrx
);
5491 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5492 if (XMISCANY (obj
)->gcmarkbit
)
5494 XMISCANY (obj
)->gcmarkbit
= 1;
5496 switch (XMISCTYPE (obj
))
5499 case Lisp_Misc_Marker
:
5500 /* DO NOT mark thru the marker's chain.
5501 The buffer's markers chain does not preserve markers from gc;
5502 instead, markers are removed from the chain when freed by gc. */
5505 case Lisp_Misc_Save_Value
:
5508 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5509 /* If DOGC is set, POINTER is the address of a memory
5510 area containing INTEGER potential Lisp_Objects. */
5513 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5515 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5516 mark_maybe_object (*p
);
5522 case Lisp_Misc_Overlay
:
5524 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5525 mark_object (ptr
->start
);
5526 mark_object (ptr
->end
);
5527 mark_object (ptr
->plist
);
5530 XSETMISC (obj
, ptr
->next
);
5543 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5544 if (CONS_MARKED_P (ptr
))
5546 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5548 /* If the cdr is nil, avoid recursion for the car. */
5549 if (EQ (ptr
->u
.cdr
, Qnil
))
5555 mark_object (ptr
->car
);
5558 if (cdr_count
== mark_object_loop_halt
)
5564 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5565 FLOAT_MARK (XFLOAT (obj
));
5576 #undef CHECK_ALLOCATED
5577 #undef CHECK_ALLOCATED_AND_LIVE
5580 /* Mark the pointers in a buffer structure. */
5583 mark_buffer (Lisp_Object buf
)
5585 register struct buffer
*buffer
= XBUFFER (buf
);
5586 register Lisp_Object
*ptr
, tmp
;
5587 Lisp_Object base_buffer
;
5589 eassert (!VECTOR_MARKED_P (buffer
));
5590 VECTOR_MARK (buffer
);
5592 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5594 /* For now, we just don't mark the undo_list. It's done later in
5595 a special way just before the sweep phase, and after stripping
5596 some of its elements that are not needed any more. */
5598 if (buffer
->overlays_before
)
5600 XSETMISC (tmp
, buffer
->overlays_before
);
5603 if (buffer
->overlays_after
)
5605 XSETMISC (tmp
, buffer
->overlays_after
);
5609 /* buffer-local Lisp variables start at `undo_list',
5610 tho only the ones from `name' on are GC'd normally. */
5611 for (ptr
= &buffer
->BUFFER_INTERNAL_FIELD (name
);
5612 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5616 /* If this is an indirect buffer, mark its base buffer. */
5617 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5619 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5620 mark_buffer (base_buffer
);
5624 /* Mark the Lisp pointers in the terminal objects.
5625 Called by the Fgarbage_collector. */
5628 mark_terminals (void)
5631 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5633 eassert (t
->name
!= NULL
);
5634 #ifdef HAVE_WINDOW_SYSTEM
5635 /* If a terminal object is reachable from a stacpro'ed object,
5636 it might have been marked already. Make sure the image cache
5638 mark_image_cache (t
->image_cache
);
5639 #endif /* HAVE_WINDOW_SYSTEM */
5640 if (!VECTOR_MARKED_P (t
))
5641 mark_vectorlike ((struct Lisp_Vector
*)t
);
5647 /* Value is non-zero if OBJ will survive the current GC because it's
5648 either marked or does not need to be marked to survive. */
5651 survives_gc_p (Lisp_Object obj
)
5655 switch (XTYPE (obj
))
5662 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5666 survives_p
= XMISCANY (obj
)->gcmarkbit
;
5670 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5673 case Lisp_Vectorlike
:
5674 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5678 survives_p
= CONS_MARKED_P (XCONS (obj
));
5682 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5689 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5694 /* Sweep: find all structures not marked, and free them. */
5699 /* Remove or mark entries in weak hash tables.
5700 This must be done before any object is unmarked. */
5701 sweep_weak_hash_tables ();
5704 #ifdef GC_CHECK_STRING_BYTES
5705 if (!noninteractive
)
5706 check_string_bytes (1);
5709 /* Put all unmarked conses on free list */
5711 register struct cons_block
*cblk
;
5712 struct cons_block
**cprev
= &cons_block
;
5713 register int lim
= cons_block_index
;
5714 register int num_free
= 0, num_used
= 0;
5718 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5722 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
5724 /* Scan the mark bits an int at a time. */
5725 for (i
= 0; i
<= ilim
; i
++)
5727 if (cblk
->gcmarkbits
[i
] == -1)
5729 /* Fast path - all cons cells for this int are marked. */
5730 cblk
->gcmarkbits
[i
] = 0;
5731 num_used
+= BITS_PER_INT
;
5735 /* Some cons cells for this int are not marked.
5736 Find which ones, and free them. */
5737 int start
, pos
, stop
;
5739 start
= i
* BITS_PER_INT
;
5741 if (stop
> BITS_PER_INT
)
5742 stop
= BITS_PER_INT
;
5745 for (pos
= start
; pos
< stop
; pos
++)
5747 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
5750 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
5751 cons_free_list
= &cblk
->conses
[pos
];
5753 cons_free_list
->car
= Vdead
;
5759 CONS_UNMARK (&cblk
->conses
[pos
]);
5765 lim
= CONS_BLOCK_SIZE
;
5766 /* If this block contains only free conses and we have already
5767 seen more than two blocks worth of free conses then deallocate
5769 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5771 *cprev
= cblk
->next
;
5772 /* Unhook from the free list. */
5773 cons_free_list
= cblk
->conses
[0].u
.chain
;
5774 lisp_align_free (cblk
);
5779 num_free
+= this_free
;
5780 cprev
= &cblk
->next
;
5783 total_conses
= num_used
;
5784 total_free_conses
= num_free
;
5787 /* Put all unmarked floats on free list */
5789 register struct float_block
*fblk
;
5790 struct float_block
**fprev
= &float_block
;
5791 register int lim
= float_block_index
;
5792 register int num_free
= 0, num_used
= 0;
5794 float_free_list
= 0;
5796 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5800 for (i
= 0; i
< lim
; i
++)
5801 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5804 fblk
->floats
[i
].u
.chain
= float_free_list
;
5805 float_free_list
= &fblk
->floats
[i
];
5810 FLOAT_UNMARK (&fblk
->floats
[i
]);
5812 lim
= FLOAT_BLOCK_SIZE
;
5813 /* If this block contains only free floats and we have already
5814 seen more than two blocks worth of free floats then deallocate
5816 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5818 *fprev
= fblk
->next
;
5819 /* Unhook from the free list. */
5820 float_free_list
= fblk
->floats
[0].u
.chain
;
5821 lisp_align_free (fblk
);
5826 num_free
+= this_free
;
5827 fprev
= &fblk
->next
;
5830 total_floats
= num_used
;
5831 total_free_floats
= num_free
;
5834 /* Put all unmarked intervals on free list */
5836 register struct interval_block
*iblk
;
5837 struct interval_block
**iprev
= &interval_block
;
5838 register int lim
= interval_block_index
;
5839 register int num_free
= 0, num_used
= 0;
5841 interval_free_list
= 0;
5843 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5848 for (i
= 0; i
< lim
; i
++)
5850 if (!iblk
->intervals
[i
].gcmarkbit
)
5852 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5853 interval_free_list
= &iblk
->intervals
[i
];
5859 iblk
->intervals
[i
].gcmarkbit
= 0;
5862 lim
= INTERVAL_BLOCK_SIZE
;
5863 /* If this block contains only free intervals and we have already
5864 seen more than two blocks worth of free intervals then
5865 deallocate this block. */
5866 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5868 *iprev
= iblk
->next
;
5869 /* Unhook from the free list. */
5870 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5872 n_interval_blocks
--;
5876 num_free
+= this_free
;
5877 iprev
= &iblk
->next
;
5880 total_intervals
= num_used
;
5881 total_free_intervals
= num_free
;
5884 /* Put all unmarked symbols on free list */
5886 register struct symbol_block
*sblk
;
5887 struct symbol_block
**sprev
= &symbol_block
;
5888 register int lim
= symbol_block_index
;
5889 register int num_free
= 0, num_used
= 0;
5891 symbol_free_list
= NULL
;
5893 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5896 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5897 struct Lisp_Symbol
*end
= sym
+ lim
;
5899 for (; sym
< end
; ++sym
)
5901 /* Check if the symbol was created during loadup. In such a case
5902 it might be pointed to by pure bytecode which we don't trace,
5903 so we conservatively assume that it is live. */
5904 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5906 if (!sym
->gcmarkbit
&& !pure_p
)
5908 if (sym
->redirect
== SYMBOL_LOCALIZED
)
5909 xfree (SYMBOL_BLV (sym
));
5910 sym
->next
= symbol_free_list
;
5911 symbol_free_list
= sym
;
5913 symbol_free_list
->function
= Vdead
;
5921 UNMARK_STRING (XSTRING (sym
->xname
));
5926 lim
= SYMBOL_BLOCK_SIZE
;
5927 /* If this block contains only free symbols and we have already
5928 seen more than two blocks worth of free symbols then deallocate
5930 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5932 *sprev
= sblk
->next
;
5933 /* Unhook from the free list. */
5934 symbol_free_list
= sblk
->symbols
[0].next
;
5940 num_free
+= this_free
;
5941 sprev
= &sblk
->next
;
5944 total_symbols
= num_used
;
5945 total_free_symbols
= num_free
;
5948 /* Put all unmarked misc's on free list.
5949 For a marker, first unchain it from the buffer it points into. */
5951 register struct marker_block
*mblk
;
5952 struct marker_block
**mprev
= &marker_block
;
5953 register int lim
= marker_block_index
;
5954 register int num_free
= 0, num_used
= 0;
5956 marker_free_list
= 0;
5958 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5963 for (i
= 0; i
< lim
; i
++)
5965 if (!mblk
->markers
[i
].u_any
.gcmarkbit
)
5967 if (mblk
->markers
[i
].u_any
.type
== Lisp_Misc_Marker
)
5968 unchain_marker (&mblk
->markers
[i
].u_marker
);
5969 /* Set the type of the freed object to Lisp_Misc_Free.
5970 We could leave the type alone, since nobody checks it,
5971 but this might catch bugs faster. */
5972 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
5973 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
5974 marker_free_list
= &mblk
->markers
[i
];
5980 mblk
->markers
[i
].u_any
.gcmarkbit
= 0;
5983 lim
= MARKER_BLOCK_SIZE
;
5984 /* If this block contains only free markers and we have already
5985 seen more than two blocks worth of free markers then deallocate
5987 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
5989 *mprev
= mblk
->next
;
5990 /* Unhook from the free list. */
5991 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
5997 num_free
+= this_free
;
5998 mprev
= &mblk
->next
;
6002 total_markers
= num_used
;
6003 total_free_markers
= num_free
;
6006 /* Free all unmarked buffers */
6008 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6011 if (!VECTOR_MARKED_P (buffer
))
6014 prev
->next
= buffer
->next
;
6016 all_buffers
= buffer
->next
;
6017 next
= buffer
->next
;
6023 VECTOR_UNMARK (buffer
);
6024 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6025 prev
= buffer
, buffer
= buffer
->next
;
6029 /* Free all unmarked vectors */
6031 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6032 total_vector_size
= 0;
6035 if (!VECTOR_MARKED_P (vector
))
6038 prev
->next
= vector
->next
;
6040 all_vectors
= vector
->next
;
6041 next
= vector
->next
;
6049 VECTOR_UNMARK (vector
);
6050 if (vector
->size
& PSEUDOVECTOR_FLAG
)
6051 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
6053 total_vector_size
+= vector
->size
;
6054 prev
= vector
, vector
= vector
->next
;
6058 #ifdef GC_CHECK_STRING_BYTES
6059 if (!noninteractive
)
6060 check_string_bytes (1);
6067 /* Debugging aids. */
6069 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6070 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6071 This may be helpful in debugging Emacs's memory usage.
6072 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6077 XSETINT (end
, (EMACS_INT
) (char *) sbrk (0) / 1024);
6082 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6083 doc
: /* Return a list of counters that measure how much consing there has been.
6084 Each of these counters increments for a certain kind of object.
6085 The counters wrap around from the largest positive integer to zero.
6086 Garbage collection does not decrease them.
6087 The elements of the value are as follows:
6088 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6089 All are in units of 1 = one object consed
6090 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6092 MISCS include overlays, markers, and some internal types.
6093 Frames, windows, buffers, and subprocesses count as vectors
6094 (but the contents of a buffer's text do not count here). */)
6097 Lisp_Object consed
[8];
6099 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6100 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6101 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6102 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6103 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6104 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6105 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6106 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6108 return Flist (8, consed
);
6111 int suppress_checking
;
6114 die (const char *msg
, const char *file
, int line
)
6116 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6121 /* Initialization */
6124 init_alloc_once (void)
6126 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6128 pure_size
= PURESIZE
;
6129 pure_bytes_used
= 0;
6130 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6131 pure_bytes_used_before_overflow
= 0;
6133 /* Initialize the list of free aligned blocks. */
6136 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6138 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6142 ignore_warnings
= 1;
6143 #ifdef DOUG_LEA_MALLOC
6144 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6145 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6146 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6154 init_weak_hash_tables ();
6157 malloc_hysteresis
= 32;
6159 malloc_hysteresis
= 0;
6162 refill_memory_reserve ();
6164 ignore_warnings
= 0;
6166 byte_stack_list
= 0;
6168 consing_since_gc
= 0;
6169 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6170 gc_relative_threshold
= 0;
6177 byte_stack_list
= 0;
6179 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6180 setjmp_tested_p
= longjmps_done
= 0;
6183 Vgc_elapsed
= make_float (0.0);
6188 syms_of_alloc (void)
6190 DEFVAR_INT ("gc-cons-threshold", gc_cons_threshold
,
6191 doc
: /* *Number of bytes of consing between garbage collections.
6192 Garbage collection can happen automatically once this many bytes have been
6193 allocated since the last garbage collection. All data types count.
6195 Garbage collection happens automatically only when `eval' is called.
6197 By binding this temporarily to a large number, you can effectively
6198 prevent garbage collection during a part of the program.
6199 See also `gc-cons-percentage'. */);
6201 DEFVAR_LISP ("gc-cons-percentage", Vgc_cons_percentage
,
6202 doc
: /* *Portion of the heap used for allocation.
6203 Garbage collection can happen automatically once this portion of the heap
6204 has been allocated since the last garbage collection.
6205 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6206 Vgc_cons_percentage
= make_float (0.1);
6208 DEFVAR_INT ("pure-bytes-used", pure_bytes_used
,
6209 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6211 DEFVAR_INT ("cons-cells-consed", cons_cells_consed
,
6212 doc
: /* Number of cons cells that have been consed so far. */);
6214 DEFVAR_INT ("floats-consed", floats_consed
,
6215 doc
: /* Number of floats that have been consed so far. */);
6217 DEFVAR_INT ("vector-cells-consed", vector_cells_consed
,
6218 doc
: /* Number of vector cells that have been consed so far. */);
6220 DEFVAR_INT ("symbols-consed", symbols_consed
,
6221 doc
: /* Number of symbols that have been consed so far. */);
6223 DEFVAR_INT ("string-chars-consed", string_chars_consed
,
6224 doc
: /* Number of string characters that have been consed so far. */);
6226 DEFVAR_INT ("misc-objects-consed", misc_objects_consed
,
6227 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6229 DEFVAR_INT ("intervals-consed", intervals_consed
,
6230 doc
: /* Number of intervals that have been consed so far. */);
6232 DEFVAR_INT ("strings-consed", strings_consed
,
6233 doc
: /* Number of strings that have been consed so far. */);
6235 DEFVAR_LISP ("purify-flag", Vpurify_flag
,
6236 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6237 This means that certain objects should be allocated in shared (pure) space.
6238 It can also be set to a hash-table, in which case this table is used to
6239 do hash-consing of the objects allocated to pure space. */);
6241 DEFVAR_BOOL ("garbage-collection-messages", garbage_collection_messages
,
6242 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6243 garbage_collection_messages
= 0;
6245 DEFVAR_LISP ("post-gc-hook", Vpost_gc_hook
,
6246 doc
: /* Hook run after garbage collection has finished. */);
6247 Vpost_gc_hook
= Qnil
;
6248 Qpost_gc_hook
= intern_c_string ("post-gc-hook");
6249 staticpro (&Qpost_gc_hook
);
6251 DEFVAR_LISP ("memory-signal-data", Vmemory_signal_data
,
6252 doc
: /* Precomputed `signal' argument for memory-full error. */);
6253 /* We build this in advance because if we wait until we need it, we might
6254 not be able to allocate the memory to hold it. */
6256 = pure_cons (Qerror
,
6257 pure_cons (make_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"), Qnil
));
6259 DEFVAR_LISP ("memory-full", Vmemory_full
,
6260 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6261 Vmemory_full
= Qnil
;
6263 staticpro (&Qgc_cons_threshold
);
6264 Qgc_cons_threshold
= intern_c_string ("gc-cons-threshold");
6266 staticpro (&Qchar_table_extra_slots
);
6267 Qchar_table_extra_slots
= intern_c_string ("char-table-extra-slots");
6269 DEFVAR_LISP ("gc-elapsed", Vgc_elapsed
,
6270 doc
: /* Accumulated time elapsed in garbage collections.
6271 The time is in seconds as a floating point value. */);
6272 DEFVAR_INT ("gcs-done", gcs_done
,
6273 doc
: /* Accumulated number of garbage collections done. */);
6278 defsubr (&Smake_byte_code
);
6279 defsubr (&Smake_list
);
6280 defsubr (&Smake_vector
);
6281 defsubr (&Smake_string
);
6282 defsubr (&Smake_bool_vector
);
6283 defsubr (&Smake_symbol
);
6284 defsubr (&Smake_marker
);
6285 defsubr (&Spurecopy
);
6286 defsubr (&Sgarbage_collect
);
6287 defsubr (&Smemory_limit
);
6288 defsubr (&Smemory_use_counts
);
6290 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6291 defsubr (&Sgc_status
);