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 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
143 to a struct Lisp_String. */
145 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
146 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
147 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
149 #define VECTOR_MARK(V) ((V)->header.size |= ARRAY_MARK_FLAG)
150 #define VECTOR_UNMARK(V) ((V)->header.size &= ~ARRAY_MARK_FLAG)
151 #define VECTOR_MARKED_P(V) (((V)->header.size & ARRAY_MARK_FLAG) != 0)
153 /* Value is the number of bytes of S, a pointer to a struct Lisp_String.
154 Be careful during GC, because S->size contains the mark bit for
157 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
159 /* Global variables. */
160 struct emacs_globals globals
;
162 /* Number of bytes of consing done since the last gc. */
164 int consing_since_gc
;
166 /* Similar minimum, computed from Vgc_cons_percentage. */
168 EMACS_INT gc_relative_threshold
;
170 /* Minimum number of bytes of consing since GC before next GC,
171 when memory is full. */
173 EMACS_INT memory_full_cons_threshold
;
175 /* Nonzero during GC. */
179 /* Nonzero means abort if try to GC.
180 This is for code which is written on the assumption that
181 no GC will happen, so as to verify that assumption. */
185 /* Number of live and free conses etc. */
187 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
188 static int total_free_conses
, total_free_markers
, total_free_symbols
;
189 static int total_free_floats
, total_floats
;
191 /* Points to memory space allocated as "spare", to be freed if we run
192 out of memory. We keep one large block, four cons-blocks, and
193 two string blocks. */
195 static char *spare_memory
[7];
197 #ifndef SYSTEM_MALLOC
198 /* Amount of spare memory to keep in large reserve block. */
200 #define SPARE_MEMORY (1 << 14)
203 /* Number of extra blocks malloc should get when it needs more core. */
205 static int malloc_hysteresis
;
207 /* Initialize it to a nonzero value to force it into data space
208 (rather than bss space). That way unexec will remap it into text
209 space (pure), on some systems. We have not implemented the
210 remapping on more recent systems because this is less important
211 nowadays than in the days of small memories and timesharing. */
213 #ifndef VIRT_ADDR_VARIES
216 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
217 #define PUREBEG (char *) pure
219 /* Pointer to the pure area, and its size. */
221 static char *purebeg
;
222 static size_t pure_size
;
224 /* Number of bytes of pure storage used before pure storage overflowed.
225 If this is non-zero, this implies that an overflow occurred. */
227 static size_t pure_bytes_used_before_overflow
;
229 /* Value is non-zero if P points into pure space. */
231 #define PURE_POINTER_P(P) \
232 (((PNTR_COMPARISON_TYPE) (P) \
233 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
234 && ((PNTR_COMPARISON_TYPE) (P) \
235 >= (PNTR_COMPARISON_TYPE) purebeg))
237 /* Index in pure at which next pure Lisp object will be allocated.. */
239 static EMACS_INT pure_bytes_used_lisp
;
241 /* Number of bytes allocated for non-Lisp objects in pure storage. */
243 static EMACS_INT pure_bytes_used_non_lisp
;
245 /* If nonzero, this is a warning delivered by malloc and not yet
248 const char *pending_malloc_warning
;
250 /* Maximum amount of C stack to save when a GC happens. */
252 #ifndef MAX_SAVE_STACK
253 #define MAX_SAVE_STACK 16000
256 /* Buffer in which we save a copy of the C stack at each GC. */
258 #if MAX_SAVE_STACK > 0
259 static char *stack_copy
;
260 static size_t stack_copy_size
;
263 /* Non-zero means ignore malloc warnings. Set during initialization.
264 Currently not used. */
266 static int ignore_warnings
;
268 static Lisp_Object Qgc_cons_threshold
;
269 Lisp_Object Qchar_table_extra_slots
;
271 /* Hook run after GC has finished. */
273 static Lisp_Object Qpost_gc_hook
;
275 static void mark_buffer (Lisp_Object
);
276 static void mark_terminals (void);
277 static void gc_sweep (void);
278 static void mark_glyph_matrix (struct glyph_matrix
*);
279 static void mark_face_cache (struct face_cache
*);
281 #if !defined REL_ALLOC || defined SYSTEM_MALLOC
282 static void refill_memory_reserve (void);
284 static struct Lisp_String
*allocate_string (void);
285 static void compact_small_strings (void);
286 static void free_large_strings (void);
287 static void sweep_strings (void);
288 static void free_misc (Lisp_Object
);
290 /* When scanning the C stack for live Lisp objects, Emacs keeps track
291 of what memory allocated via lisp_malloc is intended for what
292 purpose. This enumeration specifies the type of memory. */
303 /* We used to keep separate mem_types for subtypes of vectors such as
304 process, hash_table, frame, terminal, and window, but we never made
305 use of the distinction, so it only caused source-code complexity
306 and runtime slowdown. Minor but pointless. */
310 static POINTER_TYPE
*lisp_align_malloc (size_t, enum mem_type
);
311 static POINTER_TYPE
*lisp_malloc (size_t, enum mem_type
);
314 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
316 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
317 #include <stdio.h> /* For fprintf. */
320 /* A unique object in pure space used to make some Lisp objects
321 on free lists recognizable in O(1). */
323 static Lisp_Object Vdead
;
325 #ifdef GC_MALLOC_CHECK
327 enum mem_type allocated_mem_type
;
328 static int dont_register_blocks
;
330 #endif /* GC_MALLOC_CHECK */
332 /* A node in the red-black tree describing allocated memory containing
333 Lisp data. Each such block is recorded with its start and end
334 address when it is allocated, and removed from the tree when it
337 A red-black tree is a balanced binary tree with the following
340 1. Every node is either red or black.
341 2. Every leaf is black.
342 3. If a node is red, then both of its children are black.
343 4. Every simple path from a node to a descendant leaf contains
344 the same number of black nodes.
345 5. The root is always black.
347 When nodes are inserted into the tree, or deleted from the tree,
348 the tree is "fixed" so that these properties are always true.
350 A red-black tree with N internal nodes has height at most 2
351 log(N+1). Searches, insertions and deletions are done in O(log N).
352 Please see a text book about data structures for a detailed
353 description of red-black trees. Any book worth its salt should
358 /* Children of this node. These pointers are never NULL. When there
359 is no child, the value is MEM_NIL, which points to a dummy node. */
360 struct mem_node
*left
, *right
;
362 /* The parent of this node. In the root node, this is NULL. */
363 struct mem_node
*parent
;
365 /* Start and end of allocated region. */
369 enum {MEM_BLACK
, MEM_RED
} color
;
375 /* Base address of stack. Set in main. */
377 Lisp_Object
*stack_base
;
379 /* Root of the tree describing allocated Lisp memory. */
381 static struct mem_node
*mem_root
;
383 /* Lowest and highest known address in the heap. */
385 static void *min_heap_address
, *max_heap_address
;
387 /* Sentinel node of the tree. */
389 static struct mem_node mem_z
;
390 #define MEM_NIL &mem_z
392 static struct Lisp_Vector
*allocate_vectorlike (EMACS_INT
);
393 static void lisp_free (POINTER_TYPE
*);
394 static void mark_stack (void);
395 static int live_vector_p (struct mem_node
*, void *);
396 static int live_buffer_p (struct mem_node
*, void *);
397 static int live_string_p (struct mem_node
*, void *);
398 static int live_cons_p (struct mem_node
*, void *);
399 static int live_symbol_p (struct mem_node
*, void *);
400 static int live_float_p (struct mem_node
*, void *);
401 static int live_misc_p (struct mem_node
*, void *);
402 static void mark_maybe_object (Lisp_Object
);
403 static void mark_memory (void *, void *, int);
404 static void mem_init (void);
405 static struct mem_node
*mem_insert (void *, void *, enum mem_type
);
406 static void mem_insert_fixup (struct mem_node
*);
407 static void mem_rotate_left (struct mem_node
*);
408 static void mem_rotate_right (struct mem_node
*);
409 static void mem_delete (struct mem_node
*);
410 static void mem_delete_fixup (struct mem_node
*);
411 static INLINE
struct mem_node
*mem_find (void *);
414 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
415 static void check_gcpros (void);
418 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
420 /* Recording what needs to be marked for gc. */
422 struct gcpro
*gcprolist
;
424 /* Addresses of staticpro'd variables. Initialize it to a nonzero
425 value; otherwise some compilers put it into BSS. */
427 #define NSTATICS 0x640
428 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
430 /* Index of next unused slot in staticvec. */
432 static int staticidx
= 0;
434 static POINTER_TYPE
*pure_alloc (size_t, int);
437 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
438 ALIGNMENT must be a power of 2. */
440 #define ALIGN(ptr, ALIGNMENT) \
441 ((POINTER_TYPE *) ((((uintptr_t) (ptr)) + (ALIGNMENT) - 1) \
442 & ~((ALIGNMENT) - 1)))
446 /************************************************************************
448 ************************************************************************/
450 /* Function malloc calls this if it finds we are near exhausting storage. */
453 malloc_warning (const char *str
)
455 pending_malloc_warning
= str
;
459 /* Display an already-pending malloc warning. */
462 display_malloc_warning (void)
464 call3 (intern ("display-warning"),
466 build_string (pending_malloc_warning
),
467 intern ("emergency"));
468 pending_malloc_warning
= 0;
471 /* Called if we can't allocate relocatable space for a buffer. */
474 buffer_memory_full (void)
476 /* If buffers use the relocating allocator, no need to free
477 spare_memory, because we may have plenty of malloc space left
478 that we could get, and if we don't, the malloc that fails will
479 itself cause spare_memory to be freed. If buffers don't use the
480 relocating allocator, treat this like any other failing
487 /* This used to call error, but if we've run out of memory, we could
488 get infinite recursion trying to build the string. */
489 xsignal (Qnil
, Vmemory_signal_data
);
493 #ifdef XMALLOC_OVERRUN_CHECK
495 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
496 and a 16 byte trailer around each block.
498 The header consists of 12 fixed bytes + a 4 byte integer contaning the
499 original block size, while the trailer consists of 16 fixed bytes.
501 The header is used to detect whether this block has been allocated
502 through these functions -- as it seems that some low-level libc
503 functions may bypass the malloc hooks.
507 #define XMALLOC_OVERRUN_CHECK_SIZE 16
509 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
510 { 0x9a, 0x9b, 0xae, 0xaf,
511 0xbf, 0xbe, 0xce, 0xcf,
512 0xea, 0xeb, 0xec, 0xed };
514 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
515 { 0xaa, 0xab, 0xac, 0xad,
516 0xba, 0xbb, 0xbc, 0xbd,
517 0xca, 0xcb, 0xcc, 0xcd,
518 0xda, 0xdb, 0xdc, 0xdd };
520 /* Macros to insert and extract the block size in the header. */
522 #define XMALLOC_PUT_SIZE(ptr, size) \
523 (ptr[-1] = (size & 0xff), \
524 ptr[-2] = ((size >> 8) & 0xff), \
525 ptr[-3] = ((size >> 16) & 0xff), \
526 ptr[-4] = ((size >> 24) & 0xff))
528 #define XMALLOC_GET_SIZE(ptr) \
529 (size_t)((unsigned)(ptr[-1]) | \
530 ((unsigned)(ptr[-2]) << 8) | \
531 ((unsigned)(ptr[-3]) << 16) | \
532 ((unsigned)(ptr[-4]) << 24))
535 /* The call depth in overrun_check functions. For example, this might happen:
537 overrun_check_malloc()
538 -> malloc -> (via hook)_-> emacs_blocked_malloc
539 -> overrun_check_malloc
540 call malloc (hooks are NULL, so real malloc is called).
541 malloc returns 10000.
542 add overhead, return 10016.
543 <- (back in overrun_check_malloc)
544 add overhead again, return 10032
545 xmalloc returns 10032.
550 overrun_check_free(10032)
552 free(10016) <- crash, because 10000 is the original pointer. */
554 static int check_depth
;
556 /* Like malloc, but wraps allocated block with header and trailer. */
558 static POINTER_TYPE
*
559 overrun_check_malloc (size_t size
)
561 register unsigned char *val
;
562 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
564 val
= (unsigned char *) malloc (size
+ overhead
);
565 if (val
&& check_depth
== 1)
567 memcpy (val
, xmalloc_overrun_check_header
,
568 XMALLOC_OVERRUN_CHECK_SIZE
- 4);
569 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
570 XMALLOC_PUT_SIZE(val
, size
);
571 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
572 XMALLOC_OVERRUN_CHECK_SIZE
);
575 return (POINTER_TYPE
*)val
;
579 /* Like realloc, but checks old block for overrun, and wraps new block
580 with header and trailer. */
582 static POINTER_TYPE
*
583 overrun_check_realloc (POINTER_TYPE
*block
, size_t size
)
585 register unsigned char *val
= (unsigned char *) block
;
586 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
590 && memcmp (xmalloc_overrun_check_header
,
591 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
592 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
594 size_t osize
= XMALLOC_GET_SIZE (val
);
595 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
596 XMALLOC_OVERRUN_CHECK_SIZE
))
598 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
599 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
600 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
603 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
605 if (val
&& check_depth
== 1)
607 memcpy (val
, xmalloc_overrun_check_header
,
608 XMALLOC_OVERRUN_CHECK_SIZE
- 4);
609 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
610 XMALLOC_PUT_SIZE(val
, size
);
611 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
612 XMALLOC_OVERRUN_CHECK_SIZE
);
615 return (POINTER_TYPE
*)val
;
618 /* Like free, but checks block for overrun. */
621 overrun_check_free (POINTER_TYPE
*block
)
623 unsigned char *val
= (unsigned char *) block
;
628 && memcmp (xmalloc_overrun_check_header
,
629 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
630 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
632 size_t osize
= XMALLOC_GET_SIZE (val
);
633 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
634 XMALLOC_OVERRUN_CHECK_SIZE
))
636 #ifdef XMALLOC_CLEAR_FREE_MEMORY
637 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
638 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
640 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
641 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
642 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
653 #define malloc overrun_check_malloc
654 #define realloc overrun_check_realloc
655 #define free overrun_check_free
659 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
660 there's no need to block input around malloc. */
661 #define MALLOC_BLOCK_INPUT ((void)0)
662 #define MALLOC_UNBLOCK_INPUT ((void)0)
664 #define MALLOC_BLOCK_INPUT BLOCK_INPUT
665 #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT
668 /* Like malloc but check for no memory and block interrupt input.. */
671 xmalloc (size_t size
)
673 register POINTER_TYPE
*val
;
676 val
= (POINTER_TYPE
*) malloc (size
);
677 MALLOC_UNBLOCK_INPUT
;
685 /* Like realloc but check for no memory and block interrupt input.. */
688 xrealloc (POINTER_TYPE
*block
, size_t size
)
690 register POINTER_TYPE
*val
;
693 /* We must call malloc explicitly when BLOCK is 0, since some
694 reallocs don't do this. */
696 val
= (POINTER_TYPE
*) malloc (size
);
698 val
= (POINTER_TYPE
*) realloc (block
, size
);
699 MALLOC_UNBLOCK_INPUT
;
701 if (!val
&& size
) memory_full ();
706 /* Like free but block interrupt input. */
709 xfree (POINTER_TYPE
*block
)
715 MALLOC_UNBLOCK_INPUT
;
716 /* We don't call refill_memory_reserve here
717 because that duplicates doing so in emacs_blocked_free
718 and the criterion should go there. */
722 /* Like strdup, but uses xmalloc. */
725 xstrdup (const char *s
)
727 size_t len
= strlen (s
) + 1;
728 char *p
= (char *) xmalloc (len
);
734 /* Unwind for SAFE_ALLOCA */
737 safe_alloca_unwind (Lisp_Object arg
)
739 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
749 /* Like malloc but used for allocating Lisp data. NBYTES is the
750 number of bytes to allocate, TYPE describes the intended use of the
751 allcated memory block (for strings, for conses, ...). */
754 static void *lisp_malloc_loser
;
757 static POINTER_TYPE
*
758 lisp_malloc (size_t nbytes
, enum mem_type type
)
764 #ifdef GC_MALLOC_CHECK
765 allocated_mem_type
= type
;
768 val
= (void *) malloc (nbytes
);
771 /* If the memory just allocated cannot be addressed thru a Lisp
772 object's pointer, and it needs to be,
773 that's equivalent to running out of memory. */
774 if (val
&& type
!= MEM_TYPE_NON_LISP
)
777 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
778 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
780 lisp_malloc_loser
= val
;
787 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
788 if (val
&& type
!= MEM_TYPE_NON_LISP
)
789 mem_insert (val
, (char *) val
+ nbytes
, type
);
792 MALLOC_UNBLOCK_INPUT
;
798 /* Free BLOCK. This must be called to free memory allocated with a
799 call to lisp_malloc. */
802 lisp_free (POINTER_TYPE
*block
)
806 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
807 mem_delete (mem_find (block
));
809 MALLOC_UNBLOCK_INPUT
;
812 /* Allocation of aligned blocks of memory to store Lisp data. */
813 /* The entry point is lisp_align_malloc which returns blocks of at most */
814 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
816 /* Use posix_memalloc if the system has it and we're using the system's
817 malloc (because our gmalloc.c routines don't have posix_memalign although
818 its memalloc could be used). */
819 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
820 #define USE_POSIX_MEMALIGN 1
823 /* BLOCK_ALIGN has to be a power of 2. */
824 #define BLOCK_ALIGN (1 << 10)
826 /* Padding to leave at the end of a malloc'd block. This is to give
827 malloc a chance to minimize the amount of memory wasted to alignment.
828 It should be tuned to the particular malloc library used.
829 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
830 posix_memalign on the other hand would ideally prefer a value of 4
831 because otherwise, there's 1020 bytes wasted between each ablocks.
832 In Emacs, testing shows that those 1020 can most of the time be
833 efficiently used by malloc to place other objects, so a value of 0 can
834 still preferable unless you have a lot of aligned blocks and virtually
836 #define BLOCK_PADDING 0
837 #define BLOCK_BYTES \
838 (BLOCK_ALIGN - sizeof (struct ablocks *) - BLOCK_PADDING)
840 /* Internal data structures and constants. */
842 #define ABLOCKS_SIZE 16
844 /* An aligned block of memory. */
849 char payload
[BLOCK_BYTES
];
850 struct ablock
*next_free
;
852 /* `abase' is the aligned base of the ablocks. */
853 /* It is overloaded to hold the virtual `busy' field that counts
854 the number of used ablock in the parent ablocks.
855 The first ablock has the `busy' field, the others have the `abase'
856 field. To tell the difference, we assume that pointers will have
857 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
858 is used to tell whether the real base of the parent ablocks is `abase'
859 (if not, the word before the first ablock holds a pointer to the
861 struct ablocks
*abase
;
862 /* The padding of all but the last ablock is unused. The padding of
863 the last ablock in an ablocks is not allocated. */
865 char padding
[BLOCK_PADDING
];
869 /* A bunch of consecutive aligned blocks. */
872 struct ablock blocks
[ABLOCKS_SIZE
];
875 /* Size of the block requested from malloc or memalign. */
876 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
878 #define ABLOCK_ABASE(block) \
879 (((uintptr_t) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
880 ? (struct ablocks *)(block) \
883 /* Virtual `busy' field. */
884 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
886 /* Pointer to the (not necessarily aligned) malloc block. */
887 #ifdef USE_POSIX_MEMALIGN
888 #define ABLOCKS_BASE(abase) (abase)
890 #define ABLOCKS_BASE(abase) \
891 (1 & (intptr_t) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
894 /* The list of free ablock. */
895 static struct ablock
*free_ablock
;
897 /* Allocate an aligned block of nbytes.
898 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
899 smaller or equal to BLOCK_BYTES. */
900 static POINTER_TYPE
*
901 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
904 struct ablocks
*abase
;
906 eassert (nbytes
<= BLOCK_BYTES
);
910 #ifdef GC_MALLOC_CHECK
911 allocated_mem_type
= type
;
917 intptr_t aligned
; /* int gets warning casting to 64-bit pointer. */
919 #ifdef DOUG_LEA_MALLOC
920 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
921 because mapped region contents are not preserved in
923 mallopt (M_MMAP_MAX
, 0);
926 #ifdef USE_POSIX_MEMALIGN
928 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
934 base
= malloc (ABLOCKS_BYTES
);
935 abase
= ALIGN (base
, BLOCK_ALIGN
);
940 MALLOC_UNBLOCK_INPUT
;
944 aligned
= (base
== abase
);
946 ((void**)abase
)[-1] = base
;
948 #ifdef DOUG_LEA_MALLOC
949 /* Back to a reasonable maximum of mmap'ed areas. */
950 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
954 /* If the memory just allocated cannot be addressed thru a Lisp
955 object's pointer, and it needs to be, that's equivalent to
956 running out of memory. */
957 if (type
!= MEM_TYPE_NON_LISP
)
960 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
962 if ((char *) XCONS (tem
) != end
)
964 lisp_malloc_loser
= base
;
966 MALLOC_UNBLOCK_INPUT
;
972 /* Initialize the blocks and put them on the free list.
973 Is `base' was not properly aligned, we can't use the last block. */
974 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
976 abase
->blocks
[i
].abase
= abase
;
977 abase
->blocks
[i
].x
.next_free
= free_ablock
;
978 free_ablock
= &abase
->blocks
[i
];
980 ABLOCKS_BUSY (abase
) = (struct ablocks
*) aligned
;
982 eassert (0 == ((uintptr_t) abase
) % BLOCK_ALIGN
);
983 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
984 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
985 eassert (ABLOCKS_BASE (abase
) == base
);
986 eassert (aligned
== (intptr_t) ABLOCKS_BUSY (abase
));
989 abase
= ABLOCK_ABASE (free_ablock
);
990 ABLOCKS_BUSY (abase
) =
991 (struct ablocks
*) (2 + (intptr_t) ABLOCKS_BUSY (abase
));
993 free_ablock
= free_ablock
->x
.next_free
;
995 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
996 if (type
!= MEM_TYPE_NON_LISP
)
997 mem_insert (val
, (char *) val
+ nbytes
, type
);
1000 MALLOC_UNBLOCK_INPUT
;
1002 eassert (0 == ((uintptr_t) val
) % BLOCK_ALIGN
);
1007 lisp_align_free (POINTER_TYPE
*block
)
1009 struct ablock
*ablock
= block
;
1010 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1013 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1014 mem_delete (mem_find (block
));
1016 /* Put on free list. */
1017 ablock
->x
.next_free
= free_ablock
;
1018 free_ablock
= ablock
;
1019 /* Update busy count. */
1020 ABLOCKS_BUSY (abase
) =
1021 (struct ablocks
*) (-2 + (intptr_t) ABLOCKS_BUSY (abase
));
1023 if (2 > (intptr_t) ABLOCKS_BUSY (abase
))
1024 { /* All the blocks are free. */
1025 int i
= 0, aligned
= (intptr_t) ABLOCKS_BUSY (abase
);
1026 struct ablock
**tem
= &free_ablock
;
1027 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1031 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1034 *tem
= (*tem
)->x
.next_free
;
1037 tem
= &(*tem
)->x
.next_free
;
1039 eassert ((aligned
& 1) == aligned
);
1040 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1041 #ifdef USE_POSIX_MEMALIGN
1042 eassert ((uintptr_t) ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1044 free (ABLOCKS_BASE (abase
));
1046 MALLOC_UNBLOCK_INPUT
;
1049 /* Return a new buffer structure allocated from the heap with
1050 a call to lisp_malloc. */
1053 allocate_buffer (void)
1056 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1058 XSETPVECTYPESIZE (b
, PVEC_BUFFER
,
1059 ((sizeof (struct buffer
) + sizeof (EMACS_INT
) - 1)
1060 / sizeof (EMACS_INT
)));
1065 #ifndef SYSTEM_MALLOC
1067 /* Arranging to disable input signals while we're in malloc.
1069 This only works with GNU malloc. To help out systems which can't
1070 use GNU malloc, all the calls to malloc, realloc, and free
1071 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1072 pair; unfortunately, we have no idea what C library functions
1073 might call malloc, so we can't really protect them unless you're
1074 using GNU malloc. Fortunately, most of the major operating systems
1075 can use GNU malloc. */
1078 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
1079 there's no need to block input around malloc. */
1081 #ifndef DOUG_LEA_MALLOC
1082 extern void * (*__malloc_hook
) (size_t, const void *);
1083 extern void * (*__realloc_hook
) (void *, size_t, const void *);
1084 extern void (*__free_hook
) (void *, const void *);
1085 /* Else declared in malloc.h, perhaps with an extra arg. */
1086 #endif /* DOUG_LEA_MALLOC */
1087 static void * (*old_malloc_hook
) (size_t, const void *);
1088 static void * (*old_realloc_hook
) (void *, size_t, const void*);
1089 static void (*old_free_hook
) (void*, const void*);
1091 #ifdef DOUG_LEA_MALLOC
1092 # define BYTES_USED (mallinfo ().uordblks)
1094 # define BYTES_USED _bytes_used
1097 static __malloc_size_t bytes_used_when_reconsidered
;
1099 /* Value of _bytes_used, when spare_memory was freed. */
1101 static __malloc_size_t bytes_used_when_full
;
1103 /* This function is used as the hook for free to call. */
1106 emacs_blocked_free (void *ptr
, const void *ptr2
)
1110 #ifdef GC_MALLOC_CHECK
1116 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1119 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1124 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1128 #endif /* GC_MALLOC_CHECK */
1130 __free_hook
= old_free_hook
;
1133 /* If we released our reserve (due to running out of memory),
1134 and we have a fair amount free once again,
1135 try to set aside another reserve in case we run out once more. */
1136 if (! NILP (Vmemory_full
)
1137 /* Verify there is enough space that even with the malloc
1138 hysteresis this call won't run out again.
1139 The code here is correct as long as SPARE_MEMORY
1140 is substantially larger than the block size malloc uses. */
1141 && (bytes_used_when_full
1142 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1143 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1144 refill_memory_reserve ();
1146 __free_hook
= emacs_blocked_free
;
1147 UNBLOCK_INPUT_ALLOC
;
1151 /* This function is the malloc hook that Emacs uses. */
1154 emacs_blocked_malloc (size_t size
, const void *ptr
)
1159 __malloc_hook
= old_malloc_hook
;
1160 #ifdef DOUG_LEA_MALLOC
1161 /* Segfaults on my system. --lorentey */
1162 /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */
1164 __malloc_extra_blocks
= malloc_hysteresis
;
1167 value
= (void *) malloc (size
);
1169 #ifdef GC_MALLOC_CHECK
1171 struct mem_node
*m
= mem_find (value
);
1174 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1176 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1177 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1182 if (!dont_register_blocks
)
1184 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1185 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1188 #endif /* GC_MALLOC_CHECK */
1190 __malloc_hook
= emacs_blocked_malloc
;
1191 UNBLOCK_INPUT_ALLOC
;
1193 /* fprintf (stderr, "%p malloc\n", value); */
1198 /* This function is the realloc hook that Emacs uses. */
1201 emacs_blocked_realloc (void *ptr
, size_t size
, const void *ptr2
)
1206 __realloc_hook
= old_realloc_hook
;
1208 #ifdef GC_MALLOC_CHECK
1211 struct mem_node
*m
= mem_find (ptr
);
1212 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1215 "Realloc of %p which wasn't allocated with malloc\n",
1223 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1225 /* Prevent malloc from registering blocks. */
1226 dont_register_blocks
= 1;
1227 #endif /* GC_MALLOC_CHECK */
1229 value
= (void *) realloc (ptr
, size
);
1231 #ifdef GC_MALLOC_CHECK
1232 dont_register_blocks
= 0;
1235 struct mem_node
*m
= mem_find (value
);
1238 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1242 /* Can't handle zero size regions in the red-black tree. */
1243 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1246 /* fprintf (stderr, "%p <- realloc\n", value); */
1247 #endif /* GC_MALLOC_CHECK */
1249 __realloc_hook
= emacs_blocked_realloc
;
1250 UNBLOCK_INPUT_ALLOC
;
1256 #ifdef HAVE_GTK_AND_PTHREAD
1257 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1258 normal malloc. Some thread implementations need this as they call
1259 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1260 calls malloc because it is the first call, and we have an endless loop. */
1263 reset_malloc_hooks ()
1265 __free_hook
= old_free_hook
;
1266 __malloc_hook
= old_malloc_hook
;
1267 __realloc_hook
= old_realloc_hook
;
1269 #endif /* HAVE_GTK_AND_PTHREAD */
1272 /* Called from main to set up malloc to use our hooks. */
1275 uninterrupt_malloc (void)
1277 #ifdef HAVE_GTK_AND_PTHREAD
1278 #ifdef DOUG_LEA_MALLOC
1279 pthread_mutexattr_t attr
;
1281 /* GLIBC has a faster way to do this, but lets keep it portable.
1282 This is according to the Single UNIX Specification. */
1283 pthread_mutexattr_init (&attr
);
1284 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1285 pthread_mutex_init (&alloc_mutex
, &attr
);
1286 #else /* !DOUG_LEA_MALLOC */
1287 /* Some systems such as Solaris 2.6 don't have a recursive mutex,
1288 and the bundled gmalloc.c doesn't require it. */
1289 pthread_mutex_init (&alloc_mutex
, NULL
);
1290 #endif /* !DOUG_LEA_MALLOC */
1291 #endif /* HAVE_GTK_AND_PTHREAD */
1293 if (__free_hook
!= emacs_blocked_free
)
1294 old_free_hook
= __free_hook
;
1295 __free_hook
= emacs_blocked_free
;
1297 if (__malloc_hook
!= emacs_blocked_malloc
)
1298 old_malloc_hook
= __malloc_hook
;
1299 __malloc_hook
= emacs_blocked_malloc
;
1301 if (__realloc_hook
!= emacs_blocked_realloc
)
1302 old_realloc_hook
= __realloc_hook
;
1303 __realloc_hook
= emacs_blocked_realloc
;
1306 #endif /* not SYNC_INPUT */
1307 #endif /* not SYSTEM_MALLOC */
1311 /***********************************************************************
1313 ***********************************************************************/
1315 /* Number of intervals allocated in an interval_block structure.
1316 The 1020 is 1024 minus malloc overhead. */
1318 #define INTERVAL_BLOCK_SIZE \
1319 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1321 /* Intervals are allocated in chunks in form of an interval_block
1324 struct interval_block
1326 /* Place `intervals' first, to preserve alignment. */
1327 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1328 struct interval_block
*next
;
1331 /* Current interval block. Its `next' pointer points to older
1334 static struct interval_block
*interval_block
;
1336 /* Index in interval_block above of the next unused interval
1339 static int interval_block_index
;
1341 /* Number of free and live intervals. */
1343 static int total_free_intervals
, total_intervals
;
1345 /* List of free intervals. */
1347 static INTERVAL interval_free_list
;
1349 /* Total number of interval blocks now in use. */
1351 static int n_interval_blocks
;
1354 /* Initialize interval allocation. */
1357 init_intervals (void)
1359 interval_block
= NULL
;
1360 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1361 interval_free_list
= 0;
1362 n_interval_blocks
= 0;
1366 /* Return a new interval. */
1369 make_interval (void)
1373 /* eassert (!handling_signal); */
1377 if (interval_free_list
)
1379 val
= interval_free_list
;
1380 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1384 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1386 register struct interval_block
*newi
;
1388 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1391 newi
->next
= interval_block
;
1392 interval_block
= newi
;
1393 interval_block_index
= 0;
1394 n_interval_blocks
++;
1396 val
= &interval_block
->intervals
[interval_block_index
++];
1399 MALLOC_UNBLOCK_INPUT
;
1401 consing_since_gc
+= sizeof (struct interval
);
1403 RESET_INTERVAL (val
);
1409 /* Mark Lisp objects in interval I. */
1412 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1414 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1416 mark_object (i
->plist
);
1420 /* Mark the interval tree rooted in TREE. Don't call this directly;
1421 use the macro MARK_INTERVAL_TREE instead. */
1424 mark_interval_tree (register INTERVAL tree
)
1426 /* No need to test if this tree has been marked already; this
1427 function is always called through the MARK_INTERVAL_TREE macro,
1428 which takes care of that. */
1430 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1434 /* Mark the interval tree rooted in I. */
1436 #define MARK_INTERVAL_TREE(i) \
1438 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1439 mark_interval_tree (i); \
1443 #define UNMARK_BALANCE_INTERVALS(i) \
1445 if (! NULL_INTERVAL_P (i)) \
1446 (i) = balance_intervals (i); \
1450 /* Number support. If USE_LISP_UNION_TYPE is in effect, we
1451 can't create number objects in macros. */
1454 make_number (EMACS_INT n
)
1458 obj
.s
.type
= Lisp_Int
;
1463 /***********************************************************************
1465 ***********************************************************************/
1467 /* Lisp_Strings are allocated in string_block structures. When a new
1468 string_block is allocated, all the Lisp_Strings it contains are
1469 added to a free-list string_free_list. When a new Lisp_String is
1470 needed, it is taken from that list. During the sweep phase of GC,
1471 string_blocks that are entirely free are freed, except two which
1474 String data is allocated from sblock structures. Strings larger
1475 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1476 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1478 Sblocks consist internally of sdata structures, one for each
1479 Lisp_String. The sdata structure points to the Lisp_String it
1480 belongs to. The Lisp_String points back to the `u.data' member of
1481 its sdata structure.
1483 When a Lisp_String is freed during GC, it is put back on
1484 string_free_list, and its `data' member and its sdata's `string'
1485 pointer is set to null. The size of the string is recorded in the
1486 `u.nbytes' member of the sdata. So, sdata structures that are no
1487 longer used, can be easily recognized, and it's easy to compact the
1488 sblocks of small strings which we do in compact_small_strings. */
1490 /* Size in bytes of an sblock structure used for small strings. This
1491 is 8192 minus malloc overhead. */
1493 #define SBLOCK_SIZE 8188
1495 /* Strings larger than this are considered large strings. String data
1496 for large strings is allocated from individual sblocks. */
1498 #define LARGE_STRING_BYTES 1024
1500 /* Structure describing string memory sub-allocated from an sblock.
1501 This is where the contents of Lisp strings are stored. */
1505 /* Back-pointer to the string this sdata belongs to. If null, this
1506 structure is free, and the NBYTES member of the union below
1507 contains the string's byte size (the same value that STRING_BYTES
1508 would return if STRING were non-null). If non-null, STRING_BYTES
1509 (STRING) is the size of the data, and DATA contains the string's
1511 struct Lisp_String
*string
;
1513 #ifdef GC_CHECK_STRING_BYTES
1516 unsigned char data
[1];
1518 #define SDATA_NBYTES(S) (S)->nbytes
1519 #define SDATA_DATA(S) (S)->data
1520 #define SDATA_SELECTOR(member) member
1522 #else /* not GC_CHECK_STRING_BYTES */
1526 /* When STRING is non-null. */
1527 unsigned char data
[1];
1529 /* When STRING is null. */
1533 #define SDATA_NBYTES(S) (S)->u.nbytes
1534 #define SDATA_DATA(S) (S)->u.data
1535 #define SDATA_SELECTOR(member) u.member
1537 #endif /* not GC_CHECK_STRING_BYTES */
1539 #define SDATA_DATA_OFFSET offsetof (struct sdata, SDATA_SELECTOR (data))
1543 /* Structure describing a block of memory which is sub-allocated to
1544 obtain string data memory for strings. Blocks for small strings
1545 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1546 as large as needed. */
1551 struct sblock
*next
;
1553 /* Pointer to the next free sdata block. This points past the end
1554 of the sblock if there isn't any space left in this block. */
1555 struct sdata
*next_free
;
1557 /* Start of data. */
1558 struct sdata first_data
;
1561 /* Number of Lisp strings in a string_block structure. The 1020 is
1562 1024 minus malloc overhead. */
1564 #define STRING_BLOCK_SIZE \
1565 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1567 /* Structure describing a block from which Lisp_String structures
1572 /* Place `strings' first, to preserve alignment. */
1573 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1574 struct string_block
*next
;
1577 /* Head and tail of the list of sblock structures holding Lisp string
1578 data. We always allocate from current_sblock. The NEXT pointers
1579 in the sblock structures go from oldest_sblock to current_sblock. */
1581 static struct sblock
*oldest_sblock
, *current_sblock
;
1583 /* List of sblocks for large strings. */
1585 static struct sblock
*large_sblocks
;
1587 /* List of string_block structures, and how many there are. */
1589 static struct string_block
*string_blocks
;
1590 static int n_string_blocks
;
1592 /* Free-list of Lisp_Strings. */
1594 static struct Lisp_String
*string_free_list
;
1596 /* Number of live and free Lisp_Strings. */
1598 static int total_strings
, total_free_strings
;
1600 /* Number of bytes used by live strings. */
1602 static EMACS_INT total_string_size
;
1604 /* Given a pointer to a Lisp_String S which is on the free-list
1605 string_free_list, return a pointer to its successor in the
1608 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1610 /* Return a pointer to the sdata structure belonging to Lisp string S.
1611 S must be live, i.e. S->data must not be null. S->data is actually
1612 a pointer to the `u.data' member of its sdata structure; the
1613 structure starts at a constant offset in front of that. */
1615 #define SDATA_OF_STRING(S) ((struct sdata *) ((S)->data - SDATA_DATA_OFFSET))
1618 #ifdef GC_CHECK_STRING_OVERRUN
1620 /* We check for overrun in string data blocks by appending a small
1621 "cookie" after each allocated string data block, and check for the
1622 presence of this cookie during GC. */
1624 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1625 static char const string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1626 { '\xde', '\xad', '\xbe', '\xef' };
1629 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1632 /* Value is the size of an sdata structure large enough to hold NBYTES
1633 bytes of string data. The value returned includes a terminating
1634 NUL byte, the size of the sdata structure, and padding. */
1636 #ifdef GC_CHECK_STRING_BYTES
1638 #define SDATA_SIZE(NBYTES) \
1639 ((SDATA_DATA_OFFSET \
1641 + sizeof (EMACS_INT) - 1) \
1642 & ~(sizeof (EMACS_INT) - 1))
1644 #else /* not GC_CHECK_STRING_BYTES */
1646 /* The 'max' reserves space for the nbytes union member even when NBYTES + 1 is
1647 less than the size of that member. The 'max' is not needed when
1648 SDATA_DATA_OFFSET is a multiple of sizeof (EMACS_INT), because then the
1649 alignment code reserves enough space. */
1651 #define SDATA_SIZE(NBYTES) \
1652 ((SDATA_DATA_OFFSET \
1653 + (SDATA_DATA_OFFSET % sizeof (EMACS_INT) == 0 \
1655 : max (NBYTES, sizeof (EMACS_INT) - 1)) \
1657 + sizeof (EMACS_INT) - 1) \
1658 & ~(sizeof (EMACS_INT) - 1))
1660 #endif /* not GC_CHECK_STRING_BYTES */
1662 /* Extra bytes to allocate for each string. */
1664 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1666 /* Initialize string allocation. Called from init_alloc_once. */
1671 total_strings
= total_free_strings
= total_string_size
= 0;
1672 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1673 string_blocks
= NULL
;
1674 n_string_blocks
= 0;
1675 string_free_list
= NULL
;
1676 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1677 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1681 #ifdef GC_CHECK_STRING_BYTES
1683 static int check_string_bytes_count
;
1685 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1688 /* Like GC_STRING_BYTES, but with debugging check. */
1691 string_bytes (struct Lisp_String
*s
)
1694 (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1696 if (!PURE_POINTER_P (s
)
1698 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1703 /* Check validity of Lisp strings' string_bytes member in B. */
1706 check_sblock (struct sblock
*b
)
1708 struct sdata
*from
, *end
, *from_end
;
1712 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1714 /* Compute the next FROM here because copying below may
1715 overwrite data we need to compute it. */
1718 /* Check that the string size recorded in the string is the
1719 same as the one recorded in the sdata structure. */
1721 CHECK_STRING_BYTES (from
->string
);
1724 nbytes
= GC_STRING_BYTES (from
->string
);
1726 nbytes
= SDATA_NBYTES (from
);
1728 nbytes
= SDATA_SIZE (nbytes
);
1729 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1734 /* Check validity of Lisp strings' string_bytes member. ALL_P
1735 non-zero means check all strings, otherwise check only most
1736 recently allocated strings. Used for hunting a bug. */
1739 check_string_bytes (int all_p
)
1745 for (b
= large_sblocks
; b
; b
= b
->next
)
1747 struct Lisp_String
*s
= b
->first_data
.string
;
1749 CHECK_STRING_BYTES (s
);
1752 for (b
= oldest_sblock
; b
; b
= b
->next
)
1756 check_sblock (current_sblock
);
1759 #endif /* GC_CHECK_STRING_BYTES */
1761 #ifdef GC_CHECK_STRING_FREE_LIST
1763 /* Walk through the string free list looking for bogus next pointers.
1764 This may catch buffer overrun from a previous string. */
1767 check_string_free_list (void)
1769 struct Lisp_String
*s
;
1771 /* Pop a Lisp_String off the free-list. */
1772 s
= string_free_list
;
1775 if ((uintptr_t) s
< 1024)
1777 s
= NEXT_FREE_LISP_STRING (s
);
1781 #define check_string_free_list()
1784 /* Return a new Lisp_String. */
1786 static struct Lisp_String
*
1787 allocate_string (void)
1789 struct Lisp_String
*s
;
1791 /* eassert (!handling_signal); */
1795 /* If the free-list is empty, allocate a new string_block, and
1796 add all the Lisp_Strings in it to the free-list. */
1797 if (string_free_list
== NULL
)
1799 struct string_block
*b
;
1802 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1803 memset (b
, 0, sizeof *b
);
1804 b
->next
= string_blocks
;
1808 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1811 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1812 string_free_list
= s
;
1815 total_free_strings
+= STRING_BLOCK_SIZE
;
1818 check_string_free_list ();
1820 /* Pop a Lisp_String off the free-list. */
1821 s
= string_free_list
;
1822 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1824 MALLOC_UNBLOCK_INPUT
;
1826 /* Probably not strictly necessary, but play it safe. */
1827 memset (s
, 0, sizeof *s
);
1829 --total_free_strings
;
1832 consing_since_gc
+= sizeof *s
;
1834 #ifdef GC_CHECK_STRING_BYTES
1835 if (!noninteractive
)
1837 if (++check_string_bytes_count
== 200)
1839 check_string_bytes_count
= 0;
1840 check_string_bytes (1);
1843 check_string_bytes (0);
1845 #endif /* GC_CHECK_STRING_BYTES */
1851 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1852 plus a NUL byte at the end. Allocate an sdata structure for S, and
1853 set S->data to its `u.data' member. Store a NUL byte at the end of
1854 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1855 S->data if it was initially non-null. */
1858 allocate_string_data (struct Lisp_String
*s
,
1859 EMACS_INT nchars
, EMACS_INT nbytes
)
1861 struct sdata
*data
, *old_data
;
1863 EMACS_INT needed
, old_nbytes
;
1865 /* Determine the number of bytes needed to store NBYTES bytes
1867 needed
= SDATA_SIZE (nbytes
);
1868 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1869 old_nbytes
= GC_STRING_BYTES (s
);
1873 if (nbytes
> LARGE_STRING_BYTES
)
1875 size_t size
= offsetof (struct sblock
, first_data
) + needed
;
1877 #ifdef DOUG_LEA_MALLOC
1878 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1879 because mapped region contents are not preserved in
1882 In case you think of allowing it in a dumped Emacs at the
1883 cost of not being able to re-dump, there's another reason:
1884 mmap'ed data typically have an address towards the top of the
1885 address space, which won't fit into an EMACS_INT (at least on
1886 32-bit systems with the current tagging scheme). --fx */
1887 mallopt (M_MMAP_MAX
, 0);
1890 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1892 #ifdef DOUG_LEA_MALLOC
1893 /* Back to a reasonable maximum of mmap'ed areas. */
1894 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1897 b
->next_free
= &b
->first_data
;
1898 b
->first_data
.string
= NULL
;
1899 b
->next
= large_sblocks
;
1902 else if (current_sblock
== NULL
1903 || (((char *) current_sblock
+ SBLOCK_SIZE
1904 - (char *) current_sblock
->next_free
)
1905 < (needed
+ GC_STRING_EXTRA
)))
1907 /* Not enough room in the current sblock. */
1908 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1909 b
->next_free
= &b
->first_data
;
1910 b
->first_data
.string
= NULL
;
1914 current_sblock
->next
= b
;
1922 data
= b
->next_free
;
1923 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
1925 MALLOC_UNBLOCK_INPUT
;
1928 s
->data
= SDATA_DATA (data
);
1929 #ifdef GC_CHECK_STRING_BYTES
1930 SDATA_NBYTES (data
) = nbytes
;
1933 s
->size_byte
= nbytes
;
1934 s
->data
[nbytes
] = '\0';
1935 #ifdef GC_CHECK_STRING_OVERRUN
1936 memcpy ((char *) data
+ needed
, string_overrun_cookie
,
1937 GC_STRING_OVERRUN_COOKIE_SIZE
);
1940 /* If S had already data assigned, mark that as free by setting its
1941 string back-pointer to null, and recording the size of the data
1945 SDATA_NBYTES (old_data
) = old_nbytes
;
1946 old_data
->string
= NULL
;
1949 consing_since_gc
+= needed
;
1953 /* Sweep and compact strings. */
1956 sweep_strings (void)
1958 struct string_block
*b
, *next
;
1959 struct string_block
*live_blocks
= NULL
;
1961 string_free_list
= NULL
;
1962 total_strings
= total_free_strings
= 0;
1963 total_string_size
= 0;
1965 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1966 for (b
= string_blocks
; b
; b
= next
)
1969 struct Lisp_String
*free_list_before
= string_free_list
;
1973 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1975 struct Lisp_String
*s
= b
->strings
+ i
;
1979 /* String was not on free-list before. */
1980 if (STRING_MARKED_P (s
))
1982 /* String is live; unmark it and its intervals. */
1985 if (!NULL_INTERVAL_P (s
->intervals
))
1986 UNMARK_BALANCE_INTERVALS (s
->intervals
);
1989 total_string_size
+= STRING_BYTES (s
);
1993 /* String is dead. Put it on the free-list. */
1994 struct sdata
*data
= SDATA_OF_STRING (s
);
1996 /* Save the size of S in its sdata so that we know
1997 how large that is. Reset the sdata's string
1998 back-pointer so that we know it's free. */
1999 #ifdef GC_CHECK_STRING_BYTES
2000 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2003 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2005 data
->string
= NULL
;
2007 /* Reset the strings's `data' member so that we
2011 /* Put the string on the free-list. */
2012 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2013 string_free_list
= s
;
2019 /* S was on the free-list before. Put it there again. */
2020 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2021 string_free_list
= s
;
2026 /* Free blocks that contain free Lisp_Strings only, except
2027 the first two of them. */
2028 if (nfree
== STRING_BLOCK_SIZE
2029 && total_free_strings
> STRING_BLOCK_SIZE
)
2033 string_free_list
= free_list_before
;
2037 total_free_strings
+= nfree
;
2038 b
->next
= live_blocks
;
2043 check_string_free_list ();
2045 string_blocks
= live_blocks
;
2046 free_large_strings ();
2047 compact_small_strings ();
2049 check_string_free_list ();
2053 /* Free dead large strings. */
2056 free_large_strings (void)
2058 struct sblock
*b
, *next
;
2059 struct sblock
*live_blocks
= NULL
;
2061 for (b
= large_sblocks
; b
; b
= next
)
2065 if (b
->first_data
.string
== NULL
)
2069 b
->next
= live_blocks
;
2074 large_sblocks
= live_blocks
;
2078 /* Compact data of small strings. Free sblocks that don't contain
2079 data of live strings after compaction. */
2082 compact_small_strings (void)
2084 struct sblock
*b
, *tb
, *next
;
2085 struct sdata
*from
, *to
, *end
, *tb_end
;
2086 struct sdata
*to_end
, *from_end
;
2088 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2089 to, and TB_END is the end of TB. */
2091 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2092 to
= &tb
->first_data
;
2094 /* Step through the blocks from the oldest to the youngest. We
2095 expect that old blocks will stabilize over time, so that less
2096 copying will happen this way. */
2097 for (b
= oldest_sblock
; b
; b
= b
->next
)
2100 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2102 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2104 /* Compute the next FROM here because copying below may
2105 overwrite data we need to compute it. */
2108 #ifdef GC_CHECK_STRING_BYTES
2109 /* Check that the string size recorded in the string is the
2110 same as the one recorded in the sdata structure. */
2112 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2114 #endif /* GC_CHECK_STRING_BYTES */
2117 nbytes
= GC_STRING_BYTES (from
->string
);
2119 nbytes
= SDATA_NBYTES (from
);
2121 if (nbytes
> LARGE_STRING_BYTES
)
2124 nbytes
= SDATA_SIZE (nbytes
);
2125 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2127 #ifdef GC_CHECK_STRING_OVERRUN
2128 if (memcmp (string_overrun_cookie
,
2129 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
2130 GC_STRING_OVERRUN_COOKIE_SIZE
))
2134 /* FROM->string non-null means it's alive. Copy its data. */
2137 /* If TB is full, proceed with the next sblock. */
2138 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2139 if (to_end
> tb_end
)
2143 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2144 to
= &tb
->first_data
;
2145 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2148 /* Copy, and update the string's `data' pointer. */
2151 xassert (tb
!= b
|| to
< from
);
2152 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
2153 to
->string
->data
= SDATA_DATA (to
);
2156 /* Advance past the sdata we copied to. */
2162 /* The rest of the sblocks following TB don't contain live data, so
2163 we can free them. */
2164 for (b
= tb
->next
; b
; b
= next
)
2172 current_sblock
= tb
;
2176 string_overflow (void)
2178 error ("Maximum string size exceeded");
2181 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2182 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2183 LENGTH must be an integer.
2184 INIT must be an integer that represents a character. */)
2185 (Lisp_Object length
, Lisp_Object init
)
2187 register Lisp_Object val
;
2188 register unsigned char *p
, *end
;
2192 CHECK_NATNUM (length
);
2193 CHECK_NUMBER (init
);
2196 if (ASCII_CHAR_P (c
))
2198 nbytes
= XINT (length
);
2199 val
= make_uninit_string (nbytes
);
2201 end
= p
+ SCHARS (val
);
2207 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2208 int len
= CHAR_STRING (c
, str
);
2209 EMACS_INT string_len
= XINT (length
);
2211 if (string_len
> MOST_POSITIVE_FIXNUM
/ len
)
2213 nbytes
= len
* string_len
;
2214 val
= make_uninit_multibyte_string (string_len
, nbytes
);
2219 memcpy (p
, str
, len
);
2229 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2230 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2231 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2232 (Lisp_Object length
, Lisp_Object init
)
2234 register Lisp_Object val
;
2235 struct Lisp_Bool_Vector
*p
;
2237 EMACS_INT length_in_chars
, length_in_elts
;
2240 CHECK_NATNUM (length
);
2242 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2244 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2245 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2246 / BOOL_VECTOR_BITS_PER_CHAR
);
2248 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2249 slot `size' of the struct Lisp_Bool_Vector. */
2250 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2252 /* No Lisp_Object to trace in there. */
2253 XSETPVECTYPESIZE (XVECTOR (val
), PVEC_BOOL_VECTOR
, 0);
2255 p
= XBOOL_VECTOR (val
);
2256 p
->size
= XFASTINT (length
);
2258 real_init
= (NILP (init
) ? 0 : -1);
2259 for (i
= 0; i
< length_in_chars
; i
++)
2260 p
->data
[i
] = real_init
;
2262 /* Clear the extraneous bits in the last byte. */
2263 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2264 p
->data
[length_in_chars
- 1]
2265 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2271 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2272 of characters from the contents. This string may be unibyte or
2273 multibyte, depending on the contents. */
2276 make_string (const char *contents
, EMACS_INT nbytes
)
2278 register Lisp_Object val
;
2279 EMACS_INT nchars
, multibyte_nbytes
;
2281 parse_str_as_multibyte ((const unsigned char *) contents
, nbytes
,
2282 &nchars
, &multibyte_nbytes
);
2283 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2284 /* CONTENTS contains no multibyte sequences or contains an invalid
2285 multibyte sequence. We must make unibyte string. */
2286 val
= make_unibyte_string (contents
, nbytes
);
2288 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2293 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2296 make_unibyte_string (const char *contents
, EMACS_INT length
)
2298 register Lisp_Object val
;
2299 val
= make_uninit_string (length
);
2300 memcpy (SDATA (val
), contents
, length
);
2305 /* Make a multibyte string from NCHARS characters occupying NBYTES
2306 bytes at CONTENTS. */
2309 make_multibyte_string (const char *contents
,
2310 EMACS_INT nchars
, EMACS_INT nbytes
)
2312 register Lisp_Object val
;
2313 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2314 memcpy (SDATA (val
), contents
, nbytes
);
2319 /* Make a string from NCHARS characters occupying NBYTES bytes at
2320 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2323 make_string_from_bytes (const char *contents
,
2324 EMACS_INT nchars
, EMACS_INT nbytes
)
2326 register Lisp_Object val
;
2327 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2328 memcpy (SDATA (val
), contents
, nbytes
);
2329 if (SBYTES (val
) == SCHARS (val
))
2330 STRING_SET_UNIBYTE (val
);
2335 /* Make a string from NCHARS characters occupying NBYTES bytes at
2336 CONTENTS. The argument MULTIBYTE controls whether to label the
2337 string as multibyte. If NCHARS is negative, it counts the number of
2338 characters by itself. */
2341 make_specified_string (const char *contents
,
2342 EMACS_INT nchars
, EMACS_INT nbytes
, int multibyte
)
2344 register Lisp_Object val
;
2349 nchars
= multibyte_chars_in_text ((const unsigned char *) contents
,
2354 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2355 memcpy (SDATA (val
), contents
, nbytes
);
2357 STRING_SET_UNIBYTE (val
);
2362 /* Make a string from the data at STR, treating it as multibyte if the
2366 build_string (const char *str
)
2368 return make_string (str
, strlen (str
));
2372 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2373 occupying LENGTH bytes. */
2376 make_uninit_string (EMACS_INT length
)
2381 return empty_unibyte_string
;
2382 val
= make_uninit_multibyte_string (length
, length
);
2383 STRING_SET_UNIBYTE (val
);
2388 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2389 which occupy NBYTES bytes. */
2392 make_uninit_multibyte_string (EMACS_INT nchars
, EMACS_INT nbytes
)
2395 struct Lisp_String
*s
;
2400 return empty_multibyte_string
;
2402 s
= allocate_string ();
2403 allocate_string_data (s
, nchars
, nbytes
);
2404 XSETSTRING (string
, s
);
2405 string_chars_consed
+= nbytes
;
2411 /***********************************************************************
2413 ***********************************************************************/
2415 /* We store float cells inside of float_blocks, allocating a new
2416 float_block with malloc whenever necessary. Float cells reclaimed
2417 by GC are put on a free list to be reallocated before allocating
2418 any new float cells from the latest float_block. */
2420 #define FLOAT_BLOCK_SIZE \
2421 (((BLOCK_BYTES - sizeof (struct float_block *) \
2422 /* The compiler might add padding at the end. */ \
2423 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2424 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2426 #define GETMARKBIT(block,n) \
2427 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2428 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2431 #define SETMARKBIT(block,n) \
2432 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2433 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2435 #define UNSETMARKBIT(block,n) \
2436 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2437 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2439 #define FLOAT_BLOCK(fptr) \
2440 ((struct float_block *) (((uintptr_t) (fptr)) & ~(BLOCK_ALIGN - 1)))
2442 #define FLOAT_INDEX(fptr) \
2443 ((((uintptr_t) (fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2447 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2448 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2449 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2450 struct float_block
*next
;
2453 #define FLOAT_MARKED_P(fptr) \
2454 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2456 #define FLOAT_MARK(fptr) \
2457 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2459 #define FLOAT_UNMARK(fptr) \
2460 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2462 /* Current float_block. */
2464 static struct float_block
*float_block
;
2466 /* Index of first unused Lisp_Float in the current float_block. */
2468 static int float_block_index
;
2470 /* Total number of float blocks now in use. */
2472 static int n_float_blocks
;
2474 /* Free-list of Lisp_Floats. */
2476 static struct Lisp_Float
*float_free_list
;
2479 /* Initialize float allocation. */
2485 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2486 float_free_list
= 0;
2491 /* Return a new float object with value FLOAT_VALUE. */
2494 make_float (double float_value
)
2496 register Lisp_Object val
;
2498 /* eassert (!handling_signal); */
2502 if (float_free_list
)
2504 /* We use the data field for chaining the free list
2505 so that we won't use the same field that has the mark bit. */
2506 XSETFLOAT (val
, float_free_list
);
2507 float_free_list
= float_free_list
->u
.chain
;
2511 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2513 register struct float_block
*new;
2515 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2517 new->next
= float_block
;
2518 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2520 float_block_index
= 0;
2523 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2524 float_block_index
++;
2527 MALLOC_UNBLOCK_INPUT
;
2529 XFLOAT_INIT (val
, float_value
);
2530 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2531 consing_since_gc
+= sizeof (struct Lisp_Float
);
2538 /***********************************************************************
2540 ***********************************************************************/
2542 /* We store cons cells inside of cons_blocks, allocating a new
2543 cons_block with malloc whenever necessary. Cons cells reclaimed by
2544 GC are put on a free list to be reallocated before allocating
2545 any new cons cells from the latest cons_block. */
2547 #define CONS_BLOCK_SIZE \
2548 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2549 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2551 #define CONS_BLOCK(fptr) \
2552 ((struct cons_block *) ((uintptr_t) (fptr) & ~(BLOCK_ALIGN - 1)))
2554 #define CONS_INDEX(fptr) \
2555 (((uintptr_t) (fptr) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2559 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2560 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2561 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2562 struct cons_block
*next
;
2565 #define CONS_MARKED_P(fptr) \
2566 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2568 #define CONS_MARK(fptr) \
2569 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2571 #define CONS_UNMARK(fptr) \
2572 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2574 /* Current cons_block. */
2576 static struct cons_block
*cons_block
;
2578 /* Index of first unused Lisp_Cons in the current block. */
2580 static int cons_block_index
;
2582 /* Free-list of Lisp_Cons structures. */
2584 static struct Lisp_Cons
*cons_free_list
;
2586 /* Total number of cons blocks now in use. */
2588 static int n_cons_blocks
;
2591 /* Initialize cons allocation. */
2597 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2603 /* Explicitly free a cons cell by putting it on the free-list. */
2606 free_cons (struct Lisp_Cons
*ptr
)
2608 ptr
->u
.chain
= cons_free_list
;
2612 cons_free_list
= ptr
;
2615 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2616 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2617 (Lisp_Object car
, Lisp_Object cdr
)
2619 register Lisp_Object val
;
2621 /* eassert (!handling_signal); */
2627 /* We use the cdr for chaining the free list
2628 so that we won't use the same field that has the mark bit. */
2629 XSETCONS (val
, cons_free_list
);
2630 cons_free_list
= cons_free_list
->u
.chain
;
2634 if (cons_block_index
== CONS_BLOCK_SIZE
)
2636 register struct cons_block
*new;
2637 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2639 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2640 new->next
= cons_block
;
2642 cons_block_index
= 0;
2645 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2649 MALLOC_UNBLOCK_INPUT
;
2653 eassert (!CONS_MARKED_P (XCONS (val
)));
2654 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2655 cons_cells_consed
++;
2659 #ifdef GC_CHECK_CONS_LIST
2660 /* Get an error now if there's any junk in the cons free list. */
2662 check_cons_list (void)
2664 struct Lisp_Cons
*tail
= cons_free_list
;
2667 tail
= tail
->u
.chain
;
2671 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2674 list1 (Lisp_Object arg1
)
2676 return Fcons (arg1
, Qnil
);
2680 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2682 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2687 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2689 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2694 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2696 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2701 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2703 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2704 Fcons (arg5
, Qnil
)))));
2708 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2709 doc
: /* Return a newly created list with specified arguments as elements.
2710 Any number of arguments, even zero arguments, are allowed.
2711 usage: (list &rest OBJECTS) */)
2712 (size_t nargs
, register Lisp_Object
*args
)
2714 register Lisp_Object val
;
2720 val
= Fcons (args
[nargs
], val
);
2726 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2727 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2728 (register Lisp_Object length
, Lisp_Object init
)
2730 register Lisp_Object val
;
2731 register EMACS_INT size
;
2733 CHECK_NATNUM (length
);
2734 size
= XFASTINT (length
);
2739 val
= Fcons (init
, val
);
2744 val
= Fcons (init
, val
);
2749 val
= Fcons (init
, val
);
2754 val
= Fcons (init
, val
);
2759 val
= Fcons (init
, val
);
2774 /***********************************************************************
2776 ***********************************************************************/
2778 /* Singly-linked list of all vectors. */
2780 static struct Lisp_Vector
*all_vectors
;
2782 /* Total number of vector-like objects now in use. */
2784 static int n_vectors
;
2787 /* Value is a pointer to a newly allocated Lisp_Vector structure
2788 with room for LEN Lisp_Objects. */
2790 static struct Lisp_Vector
*
2791 allocate_vectorlike (EMACS_INT len
)
2793 struct Lisp_Vector
*p
;
2798 #ifdef DOUG_LEA_MALLOC
2799 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2800 because mapped region contents are not preserved in
2802 mallopt (M_MMAP_MAX
, 0);
2805 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2806 /* eassert (!handling_signal); */
2808 nbytes
= (offsetof (struct Lisp_Vector
, contents
)
2809 + len
* sizeof p
->contents
[0]);
2810 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
2812 #ifdef DOUG_LEA_MALLOC
2813 /* Back to a reasonable maximum of mmap'ed areas. */
2814 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2817 consing_since_gc
+= nbytes
;
2818 vector_cells_consed
+= len
;
2820 p
->header
.next
.vector
= all_vectors
;
2823 MALLOC_UNBLOCK_INPUT
;
2830 /* Allocate a vector with NSLOTS slots. */
2832 struct Lisp_Vector
*
2833 allocate_vector (EMACS_INT nslots
)
2835 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
);
2836 v
->header
.size
= nslots
;
2841 /* Allocate other vector-like structures. */
2843 struct Lisp_Vector
*
2844 allocate_pseudovector (int memlen
, int lisplen
, EMACS_INT tag
)
2846 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2849 /* Only the first lisplen slots will be traced normally by the GC. */
2850 for (i
= 0; i
< lisplen
; ++i
)
2851 v
->contents
[i
] = Qnil
;
2853 XSETPVECTYPESIZE (v
, tag
, lisplen
);
2857 struct Lisp_Hash_Table
*
2858 allocate_hash_table (void)
2860 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
2865 allocate_window (void)
2867 return ALLOCATE_PSEUDOVECTOR(struct window
, current_matrix
, PVEC_WINDOW
);
2872 allocate_terminal (void)
2874 struct terminal
*t
= ALLOCATE_PSEUDOVECTOR (struct terminal
,
2875 next_terminal
, PVEC_TERMINAL
);
2876 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2877 memset (&t
->next_terminal
, 0,
2878 (char*) (t
+ 1) - (char*) &t
->next_terminal
);
2884 allocate_frame (void)
2886 struct frame
*f
= ALLOCATE_PSEUDOVECTOR (struct frame
,
2887 face_cache
, PVEC_FRAME
);
2888 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2889 memset (&f
->face_cache
, 0,
2890 (char *) (f
+ 1) - (char *) &f
->face_cache
);
2895 struct Lisp_Process
*
2896 allocate_process (void)
2898 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
2902 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2903 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2904 See also the function `vector'. */)
2905 (register Lisp_Object length
, Lisp_Object init
)
2908 register EMACS_INT sizei
;
2909 register EMACS_INT i
;
2910 register struct Lisp_Vector
*p
;
2912 CHECK_NATNUM (length
);
2913 sizei
= XFASTINT (length
);
2915 p
= allocate_vector (sizei
);
2916 for (i
= 0; i
< sizei
; i
++)
2917 p
->contents
[i
] = init
;
2919 XSETVECTOR (vector
, p
);
2924 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
2925 doc
: /* Return a newly created vector with specified arguments as elements.
2926 Any number of arguments, even zero arguments, are allowed.
2927 usage: (vector &rest OBJECTS) */)
2928 (register size_t nargs
, Lisp_Object
*args
)
2930 register Lisp_Object len
, val
;
2932 register struct Lisp_Vector
*p
;
2934 XSETFASTINT (len
, nargs
);
2935 val
= Fmake_vector (len
, Qnil
);
2937 for (i
= 0; i
< nargs
; i
++)
2938 p
->contents
[i
] = args
[i
];
2943 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
2944 doc
: /* Create a byte-code object with specified arguments as elements.
2945 The arguments should be the ARGLIST, bytecode-string BYTE-CODE, constant
2946 vector CONSTANTS, maximum stack size DEPTH, (optional) DOCSTRING,
2947 and (optional) INTERACTIVE-SPEC.
2948 The first four arguments are required; at most six have any
2950 The ARGLIST can be either like the one of `lambda', in which case the arguments
2951 will be dynamically bound before executing the byte code, or it can be an
2952 integer of the form NNNNNNNRMMMMMMM where the 7bit MMMMMMM specifies the
2953 minimum number of arguments, the 7-bit NNNNNNN specifies the maximum number
2954 of arguments (ignoring &rest) and the R bit specifies whether there is a &rest
2955 argument to catch the left-over arguments. If such an integer is used, the
2956 arguments will not be dynamically bound but will be instead pushed on the
2957 stack before executing the byte-code.
2958 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
2959 (register size_t nargs
, Lisp_Object
*args
)
2961 register Lisp_Object len
, val
;
2963 register struct Lisp_Vector
*p
;
2965 XSETFASTINT (len
, nargs
);
2966 if (!NILP (Vpurify_flag
))
2967 val
= make_pure_vector ((EMACS_INT
) nargs
);
2969 val
= Fmake_vector (len
, Qnil
);
2971 if (nargs
> 1 && STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
2972 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
2973 earlier because they produced a raw 8-bit string for byte-code
2974 and now such a byte-code string is loaded as multibyte while
2975 raw 8-bit characters converted to multibyte form. Thus, now we
2976 must convert them back to the original unibyte form. */
2977 args
[1] = Fstring_as_unibyte (args
[1]);
2980 for (i
= 0; i
< nargs
; i
++)
2982 if (!NILP (Vpurify_flag
))
2983 args
[i
] = Fpurecopy (args
[i
]);
2984 p
->contents
[i
] = args
[i
];
2986 XSETPVECTYPE (p
, PVEC_COMPILED
);
2987 XSETCOMPILED (val
, p
);
2993 /***********************************************************************
2995 ***********************************************************************/
2997 /* Each symbol_block is just under 1020 bytes long, since malloc
2998 really allocates in units of powers of two and uses 4 bytes for its
3001 #define SYMBOL_BLOCK_SIZE \
3002 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3006 /* Place `symbols' first, to preserve alignment. */
3007 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3008 struct symbol_block
*next
;
3011 /* Current symbol block and index of first unused Lisp_Symbol
3014 static struct symbol_block
*symbol_block
;
3015 static int symbol_block_index
;
3017 /* List of free symbols. */
3019 static struct Lisp_Symbol
*symbol_free_list
;
3021 /* Total number of symbol blocks now in use. */
3023 static int n_symbol_blocks
;
3026 /* Initialize symbol allocation. */
3031 symbol_block
= NULL
;
3032 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3033 symbol_free_list
= 0;
3034 n_symbol_blocks
= 0;
3038 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3039 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3040 Its value and function definition are void, and its property list is nil. */)
3043 register Lisp_Object val
;
3044 register struct Lisp_Symbol
*p
;
3046 CHECK_STRING (name
);
3048 /* eassert (!handling_signal); */
3052 if (symbol_free_list
)
3054 XSETSYMBOL (val
, symbol_free_list
);
3055 symbol_free_list
= symbol_free_list
->next
;
3059 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3061 struct symbol_block
*new;
3062 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3064 new->next
= symbol_block
;
3066 symbol_block_index
= 0;
3069 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3070 symbol_block_index
++;
3073 MALLOC_UNBLOCK_INPUT
;
3078 p
->redirect
= SYMBOL_PLAINVAL
;
3079 SET_SYMBOL_VAL (p
, Qunbound
);
3080 p
->function
= Qunbound
;
3083 p
->interned
= SYMBOL_UNINTERNED
;
3085 p
->declared_special
= 0;
3086 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3093 /***********************************************************************
3094 Marker (Misc) Allocation
3095 ***********************************************************************/
3097 /* Allocation of markers and other objects that share that structure.
3098 Works like allocation of conses. */
3100 #define MARKER_BLOCK_SIZE \
3101 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3105 /* Place `markers' first, to preserve alignment. */
3106 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3107 struct marker_block
*next
;
3110 static struct marker_block
*marker_block
;
3111 static int marker_block_index
;
3113 static union Lisp_Misc
*marker_free_list
;
3115 /* Total number of marker blocks now in use. */
3117 static int n_marker_blocks
;
3122 marker_block
= NULL
;
3123 marker_block_index
= MARKER_BLOCK_SIZE
;
3124 marker_free_list
= 0;
3125 n_marker_blocks
= 0;
3128 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3131 allocate_misc (void)
3135 /* eassert (!handling_signal); */
3139 if (marker_free_list
)
3141 XSETMISC (val
, marker_free_list
);
3142 marker_free_list
= marker_free_list
->u_free
.chain
;
3146 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3148 struct marker_block
*new;
3149 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3151 new->next
= marker_block
;
3153 marker_block_index
= 0;
3155 total_free_markers
+= MARKER_BLOCK_SIZE
;
3157 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3158 marker_block_index
++;
3161 MALLOC_UNBLOCK_INPUT
;
3163 --total_free_markers
;
3164 consing_since_gc
+= sizeof (union Lisp_Misc
);
3165 misc_objects_consed
++;
3166 XMISCANY (val
)->gcmarkbit
= 0;
3170 /* Free a Lisp_Misc object */
3173 free_misc (Lisp_Object misc
)
3175 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3176 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3177 marker_free_list
= XMISC (misc
);
3179 total_free_markers
++;
3182 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3183 INTEGER. This is used to package C values to call record_unwind_protect.
3184 The unwind function can get the C values back using XSAVE_VALUE. */
3187 make_save_value (void *pointer
, int integer
)
3189 register Lisp_Object val
;
3190 register struct Lisp_Save_Value
*p
;
3192 val
= allocate_misc ();
3193 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3194 p
= XSAVE_VALUE (val
);
3195 p
->pointer
= pointer
;
3196 p
->integer
= integer
;
3201 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3202 doc
: /* Return a newly allocated marker which does not point at any place. */)
3205 register Lisp_Object val
;
3206 register struct Lisp_Marker
*p
;
3208 val
= allocate_misc ();
3209 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3215 p
->insertion_type
= 0;
3219 /* Put MARKER back on the free list after using it temporarily. */
3222 free_marker (Lisp_Object marker
)
3224 unchain_marker (XMARKER (marker
));
3229 /* Return a newly created vector or string with specified arguments as
3230 elements. If all the arguments are characters that can fit
3231 in a string of events, make a string; otherwise, make a vector.
3233 Any number of arguments, even zero arguments, are allowed. */
3236 make_event_array (register int nargs
, Lisp_Object
*args
)
3240 for (i
= 0; i
< nargs
; i
++)
3241 /* The things that fit in a string
3242 are characters that are in 0...127,
3243 after discarding the meta bit and all the bits above it. */
3244 if (!INTEGERP (args
[i
])
3245 || (XINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3246 return Fvector (nargs
, args
);
3248 /* Since the loop exited, we know that all the things in it are
3249 characters, so we can make a string. */
3253 result
= Fmake_string (make_number (nargs
), make_number (0));
3254 for (i
= 0; i
< nargs
; i
++)
3256 SSET (result
, i
, XINT (args
[i
]));
3257 /* Move the meta bit to the right place for a string char. */
3258 if (XINT (args
[i
]) & CHAR_META
)
3259 SSET (result
, i
, SREF (result
, i
) | 0x80);
3268 /************************************************************************
3269 Memory Full Handling
3270 ************************************************************************/
3273 /* Called if malloc returns zero. */
3282 memory_full_cons_threshold
= sizeof (struct cons_block
);
3284 /* The first time we get here, free the spare memory. */
3285 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3286 if (spare_memory
[i
])
3289 free (spare_memory
[i
]);
3290 else if (i
>= 1 && i
<= 4)
3291 lisp_align_free (spare_memory
[i
]);
3293 lisp_free (spare_memory
[i
]);
3294 spare_memory
[i
] = 0;
3297 /* Record the space now used. When it decreases substantially,
3298 we can refill the memory reserve. */
3299 #if !defined SYSTEM_MALLOC && !defined SYNC_INPUT
3300 bytes_used_when_full
= BYTES_USED
;
3303 /* This used to call error, but if we've run out of memory, we could
3304 get infinite recursion trying to build the string. */
3305 xsignal (Qnil
, Vmemory_signal_data
);
3308 /* If we released our reserve (due to running out of memory),
3309 and we have a fair amount free once again,
3310 try to set aside another reserve in case we run out once more.
3312 This is called when a relocatable block is freed in ralloc.c,
3313 and also directly from this file, in case we're not using ralloc.c. */
3316 refill_memory_reserve (void)
3318 #ifndef SYSTEM_MALLOC
3319 if (spare_memory
[0] == 0)
3320 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3321 if (spare_memory
[1] == 0)
3322 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3324 if (spare_memory
[2] == 0)
3325 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3327 if (spare_memory
[3] == 0)
3328 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3330 if (spare_memory
[4] == 0)
3331 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3333 if (spare_memory
[5] == 0)
3334 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3336 if (spare_memory
[6] == 0)
3337 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3339 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3340 Vmemory_full
= Qnil
;
3344 /************************************************************************
3346 ************************************************************************/
3348 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3350 /* Conservative C stack marking requires a method to identify possibly
3351 live Lisp objects given a pointer value. We do this by keeping
3352 track of blocks of Lisp data that are allocated in a red-black tree
3353 (see also the comment of mem_node which is the type of nodes in
3354 that tree). Function lisp_malloc adds information for an allocated
3355 block to the red-black tree with calls to mem_insert, and function
3356 lisp_free removes it with mem_delete. Functions live_string_p etc
3357 call mem_find to lookup information about a given pointer in the
3358 tree, and use that to determine if the pointer points to a Lisp
3361 /* Initialize this part of alloc.c. */
3366 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3367 mem_z
.parent
= NULL
;
3368 mem_z
.color
= MEM_BLACK
;
3369 mem_z
.start
= mem_z
.end
= NULL
;
3374 /* Value is a pointer to the mem_node containing START. Value is
3375 MEM_NIL if there is no node in the tree containing START. */
3377 static INLINE
struct mem_node
*
3378 mem_find (void *start
)
3382 if (start
< min_heap_address
|| start
> max_heap_address
)
3385 /* Make the search always successful to speed up the loop below. */
3386 mem_z
.start
= start
;
3387 mem_z
.end
= (char *) start
+ 1;
3390 while (start
< p
->start
|| start
>= p
->end
)
3391 p
= start
< p
->start
? p
->left
: p
->right
;
3396 /* Insert a new node into the tree for a block of memory with start
3397 address START, end address END, and type TYPE. Value is a
3398 pointer to the node that was inserted. */
3400 static struct mem_node
*
3401 mem_insert (void *start
, void *end
, enum mem_type type
)
3403 struct mem_node
*c
, *parent
, *x
;
3405 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3406 min_heap_address
= start
;
3407 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3408 max_heap_address
= end
;
3410 /* See where in the tree a node for START belongs. In this
3411 particular application, it shouldn't happen that a node is already
3412 present. For debugging purposes, let's check that. */
3416 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3418 while (c
!= MEM_NIL
)
3420 if (start
>= c
->start
&& start
< c
->end
)
3423 c
= start
< c
->start
? c
->left
: c
->right
;
3426 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3428 while (c
!= MEM_NIL
)
3431 c
= start
< c
->start
? c
->left
: c
->right
;
3434 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3436 /* Create a new node. */
3437 #ifdef GC_MALLOC_CHECK
3438 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3442 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3448 x
->left
= x
->right
= MEM_NIL
;
3451 /* Insert it as child of PARENT or install it as root. */
3454 if (start
< parent
->start
)
3462 /* Re-establish red-black tree properties. */
3463 mem_insert_fixup (x
);
3469 /* Re-establish the red-black properties of the tree, and thereby
3470 balance the tree, after node X has been inserted; X is always red. */
3473 mem_insert_fixup (struct mem_node
*x
)
3475 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3477 /* X is red and its parent is red. This is a violation of
3478 red-black tree property #3. */
3480 if (x
->parent
== x
->parent
->parent
->left
)
3482 /* We're on the left side of our grandparent, and Y is our
3484 struct mem_node
*y
= x
->parent
->parent
->right
;
3486 if (y
->color
== MEM_RED
)
3488 /* Uncle and parent are red but should be black because
3489 X is red. Change the colors accordingly and proceed
3490 with the grandparent. */
3491 x
->parent
->color
= MEM_BLACK
;
3492 y
->color
= MEM_BLACK
;
3493 x
->parent
->parent
->color
= MEM_RED
;
3494 x
= x
->parent
->parent
;
3498 /* Parent and uncle have different colors; parent is
3499 red, uncle is black. */
3500 if (x
== x
->parent
->right
)
3503 mem_rotate_left (x
);
3506 x
->parent
->color
= MEM_BLACK
;
3507 x
->parent
->parent
->color
= MEM_RED
;
3508 mem_rotate_right (x
->parent
->parent
);
3513 /* This is the symmetrical case of above. */
3514 struct mem_node
*y
= x
->parent
->parent
->left
;
3516 if (y
->color
== MEM_RED
)
3518 x
->parent
->color
= MEM_BLACK
;
3519 y
->color
= MEM_BLACK
;
3520 x
->parent
->parent
->color
= MEM_RED
;
3521 x
= x
->parent
->parent
;
3525 if (x
== x
->parent
->left
)
3528 mem_rotate_right (x
);
3531 x
->parent
->color
= MEM_BLACK
;
3532 x
->parent
->parent
->color
= MEM_RED
;
3533 mem_rotate_left (x
->parent
->parent
);
3538 /* The root may have been changed to red due to the algorithm. Set
3539 it to black so that property #5 is satisfied. */
3540 mem_root
->color
= MEM_BLACK
;
3551 mem_rotate_left (struct mem_node
*x
)
3555 /* Turn y's left sub-tree into x's right sub-tree. */
3558 if (y
->left
!= MEM_NIL
)
3559 y
->left
->parent
= x
;
3561 /* Y's parent was x's parent. */
3563 y
->parent
= x
->parent
;
3565 /* Get the parent to point to y instead of x. */
3568 if (x
== x
->parent
->left
)
3569 x
->parent
->left
= y
;
3571 x
->parent
->right
= y
;
3576 /* Put x on y's left. */
3590 mem_rotate_right (struct mem_node
*x
)
3592 struct mem_node
*y
= x
->left
;
3595 if (y
->right
!= MEM_NIL
)
3596 y
->right
->parent
= x
;
3599 y
->parent
= x
->parent
;
3602 if (x
== x
->parent
->right
)
3603 x
->parent
->right
= y
;
3605 x
->parent
->left
= y
;
3616 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3619 mem_delete (struct mem_node
*z
)
3621 struct mem_node
*x
, *y
;
3623 if (!z
|| z
== MEM_NIL
)
3626 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3631 while (y
->left
!= MEM_NIL
)
3635 if (y
->left
!= MEM_NIL
)
3640 x
->parent
= y
->parent
;
3643 if (y
== y
->parent
->left
)
3644 y
->parent
->left
= x
;
3646 y
->parent
->right
= x
;
3653 z
->start
= y
->start
;
3658 if (y
->color
== MEM_BLACK
)
3659 mem_delete_fixup (x
);
3661 #ifdef GC_MALLOC_CHECK
3669 /* Re-establish the red-black properties of the tree, after a
3673 mem_delete_fixup (struct mem_node
*x
)
3675 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3677 if (x
== x
->parent
->left
)
3679 struct mem_node
*w
= x
->parent
->right
;
3681 if (w
->color
== MEM_RED
)
3683 w
->color
= MEM_BLACK
;
3684 x
->parent
->color
= MEM_RED
;
3685 mem_rotate_left (x
->parent
);
3686 w
= x
->parent
->right
;
3689 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3696 if (w
->right
->color
== MEM_BLACK
)
3698 w
->left
->color
= MEM_BLACK
;
3700 mem_rotate_right (w
);
3701 w
= x
->parent
->right
;
3703 w
->color
= x
->parent
->color
;
3704 x
->parent
->color
= MEM_BLACK
;
3705 w
->right
->color
= MEM_BLACK
;
3706 mem_rotate_left (x
->parent
);
3712 struct mem_node
*w
= x
->parent
->left
;
3714 if (w
->color
== MEM_RED
)
3716 w
->color
= MEM_BLACK
;
3717 x
->parent
->color
= MEM_RED
;
3718 mem_rotate_right (x
->parent
);
3719 w
= x
->parent
->left
;
3722 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3729 if (w
->left
->color
== MEM_BLACK
)
3731 w
->right
->color
= MEM_BLACK
;
3733 mem_rotate_left (w
);
3734 w
= x
->parent
->left
;
3737 w
->color
= x
->parent
->color
;
3738 x
->parent
->color
= MEM_BLACK
;
3739 w
->left
->color
= MEM_BLACK
;
3740 mem_rotate_right (x
->parent
);
3746 x
->color
= MEM_BLACK
;
3750 /* Value is non-zero if P is a pointer to a live Lisp string on
3751 the heap. M is a pointer to the mem_block for P. */
3754 live_string_p (struct mem_node
*m
, void *p
)
3756 if (m
->type
== MEM_TYPE_STRING
)
3758 struct string_block
*b
= (struct string_block
*) m
->start
;
3759 ptrdiff_t offset
= (char *) p
- (char *) &b
->strings
[0];
3761 /* P must point to the start of a Lisp_String structure, and it
3762 must not be on the free-list. */
3764 && offset
% sizeof b
->strings
[0] == 0
3765 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3766 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3773 /* Value is non-zero if P is a pointer to a live Lisp cons on
3774 the heap. M is a pointer to the mem_block for P. */
3777 live_cons_p (struct mem_node
*m
, void *p
)
3779 if (m
->type
== MEM_TYPE_CONS
)
3781 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3782 ptrdiff_t offset
= (char *) p
- (char *) &b
->conses
[0];
3784 /* P must point to the start of a Lisp_Cons, not be
3785 one of the unused cells in the current cons block,
3786 and not be on the free-list. */
3788 && offset
% sizeof b
->conses
[0] == 0
3789 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3791 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3792 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3799 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3800 the heap. M is a pointer to the mem_block for P. */
3803 live_symbol_p (struct mem_node
*m
, void *p
)
3805 if (m
->type
== MEM_TYPE_SYMBOL
)
3807 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3808 ptrdiff_t offset
= (char *) p
- (char *) &b
->symbols
[0];
3810 /* P must point to the start of a Lisp_Symbol, not be
3811 one of the unused cells in the current symbol block,
3812 and not be on the free-list. */
3814 && offset
% sizeof b
->symbols
[0] == 0
3815 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3816 && (b
!= symbol_block
3817 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3818 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3825 /* Value is non-zero if P is a pointer to a live Lisp float on
3826 the heap. M is a pointer to the mem_block for P. */
3829 live_float_p (struct mem_node
*m
, void *p
)
3831 if (m
->type
== MEM_TYPE_FLOAT
)
3833 struct float_block
*b
= (struct float_block
*) m
->start
;
3834 ptrdiff_t offset
= (char *) p
- (char *) &b
->floats
[0];
3836 /* P must point to the start of a Lisp_Float and not be
3837 one of the unused cells in the current float block. */
3839 && offset
% sizeof b
->floats
[0] == 0
3840 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3841 && (b
!= float_block
3842 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3849 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3850 the heap. M is a pointer to the mem_block for P. */
3853 live_misc_p (struct mem_node
*m
, void *p
)
3855 if (m
->type
== MEM_TYPE_MISC
)
3857 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3858 ptrdiff_t offset
= (char *) p
- (char *) &b
->markers
[0];
3860 /* P must point to the start of a Lisp_Misc, not be
3861 one of the unused cells in the current misc block,
3862 and not be on the free-list. */
3864 && offset
% sizeof b
->markers
[0] == 0
3865 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3866 && (b
!= marker_block
3867 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3868 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
3875 /* Value is non-zero if P is a pointer to a live vector-like object.
3876 M is a pointer to the mem_block for P. */
3879 live_vector_p (struct mem_node
*m
, void *p
)
3881 return (p
== m
->start
&& m
->type
== MEM_TYPE_VECTORLIKE
);
3885 /* Value is non-zero if P is a pointer to a live buffer. M is a
3886 pointer to the mem_block for P. */
3889 live_buffer_p (struct mem_node
*m
, void *p
)
3891 /* P must point to the start of the block, and the buffer
3892 must not have been killed. */
3893 return (m
->type
== MEM_TYPE_BUFFER
3895 && !NILP (((struct buffer
*) p
)->BUFFER_INTERNAL_FIELD (name
)));
3898 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3902 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3904 /* Array of objects that are kept alive because the C stack contains
3905 a pattern that looks like a reference to them . */
3907 #define MAX_ZOMBIES 10
3908 static Lisp_Object zombies
[MAX_ZOMBIES
];
3910 /* Number of zombie objects. */
3912 static int nzombies
;
3914 /* Number of garbage collections. */
3918 /* Average percentage of zombies per collection. */
3920 static double avg_zombies
;
3922 /* Max. number of live and zombie objects. */
3924 static int max_live
, max_zombies
;
3926 /* Average number of live objects per GC. */
3928 static double avg_live
;
3930 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3931 doc
: /* Show information about live and zombie objects. */)
3934 Lisp_Object args
[8], zombie_list
= Qnil
;
3936 for (i
= 0; i
< nzombies
; i
++)
3937 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3938 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3939 args
[1] = make_number (ngcs
);
3940 args
[2] = make_float (avg_live
);
3941 args
[3] = make_float (avg_zombies
);
3942 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
3943 args
[5] = make_number (max_live
);
3944 args
[6] = make_number (max_zombies
);
3945 args
[7] = zombie_list
;
3946 return Fmessage (8, args
);
3949 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3952 /* Mark OBJ if we can prove it's a Lisp_Object. */
3955 mark_maybe_object (Lisp_Object obj
)
3963 po
= (void *) XPNTR (obj
);
3970 switch (XTYPE (obj
))
3973 mark_p
= (live_string_p (m
, po
)
3974 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
3978 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
3982 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
3986 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
3989 case Lisp_Vectorlike
:
3990 /* Note: can't check BUFFERP before we know it's a
3991 buffer because checking that dereferences the pointer
3992 PO which might point anywhere. */
3993 if (live_vector_p (m
, po
))
3994 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
3995 else if (live_buffer_p (m
, po
))
3996 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4000 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4009 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4010 if (nzombies
< MAX_ZOMBIES
)
4011 zombies
[nzombies
] = obj
;
4020 /* If P points to Lisp data, mark that as live if it isn't already
4024 mark_maybe_pointer (void *p
)
4028 /* Quickly rule out some values which can't point to Lisp data. */
4031 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */
4033 2 /* We assume that Lisp data is aligned on even addresses. */
4041 Lisp_Object obj
= Qnil
;
4045 case MEM_TYPE_NON_LISP
:
4046 /* Nothing to do; not a pointer to Lisp memory. */
4049 case MEM_TYPE_BUFFER
:
4050 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4051 XSETVECTOR (obj
, p
);
4055 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4059 case MEM_TYPE_STRING
:
4060 if (live_string_p (m
, p
)
4061 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4062 XSETSTRING (obj
, p
);
4066 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4070 case MEM_TYPE_SYMBOL
:
4071 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4072 XSETSYMBOL (obj
, p
);
4075 case MEM_TYPE_FLOAT
:
4076 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4080 case MEM_TYPE_VECTORLIKE
:
4081 if (live_vector_p (m
, p
))
4084 XSETVECTOR (tem
, p
);
4085 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4100 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4101 or END+OFFSET..START. */
4104 mark_memory (void *start
, void *end
, int offset
)
4109 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4113 /* Make START the pointer to the start of the memory region,
4114 if it isn't already. */
4122 /* Mark Lisp_Objects. */
4123 for (p
= (Lisp_Object
*) ((char *) start
+ offset
); (void *) p
< end
; ++p
)
4124 mark_maybe_object (*p
);
4126 /* Mark Lisp data pointed to. This is necessary because, in some
4127 situations, the C compiler optimizes Lisp objects away, so that
4128 only a pointer to them remains. Example:
4130 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4133 Lisp_Object obj = build_string ("test");
4134 struct Lisp_String *s = XSTRING (obj);
4135 Fgarbage_collect ();
4136 fprintf (stderr, "test `%s'\n", s->data);
4140 Here, `obj' isn't really used, and the compiler optimizes it
4141 away. The only reference to the life string is through the
4144 for (pp
= (void **) ((char *) start
+ offset
); (void *) pp
< end
; ++pp
)
4145 mark_maybe_pointer (*pp
);
4148 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4149 the GCC system configuration. In gcc 3.2, the only systems for
4150 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4151 by others?) and ns32k-pc532-min. */
4153 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4155 static int setjmp_tested_p
, longjmps_done
;
4157 #define SETJMP_WILL_LIKELY_WORK "\
4159 Emacs garbage collector has been changed to use conservative stack\n\
4160 marking. Emacs has determined that the method it uses to do the\n\
4161 marking will likely work on your system, but this isn't sure.\n\
4163 If you are a system-programmer, or can get the help of a local wizard\n\
4164 who is, please take a look at the function mark_stack in alloc.c, and\n\
4165 verify that the methods used are appropriate for your system.\n\
4167 Please mail the result to <emacs-devel@gnu.org>.\n\
4170 #define SETJMP_WILL_NOT_WORK "\
4172 Emacs garbage collector has been changed to use conservative stack\n\
4173 marking. Emacs has determined that the default method it uses to do the\n\
4174 marking will not work on your system. We will need a system-dependent\n\
4175 solution for your system.\n\
4177 Please take a look at the function mark_stack in alloc.c, and\n\
4178 try to find a way to make it work on your system.\n\
4180 Note that you may get false negatives, depending on the compiler.\n\
4181 In particular, you need to use -O with GCC for this test.\n\
4183 Please mail the result to <emacs-devel@gnu.org>.\n\
4187 /* Perform a quick check if it looks like setjmp saves registers in a
4188 jmp_buf. Print a message to stderr saying so. When this test
4189 succeeds, this is _not_ a proof that setjmp is sufficient for
4190 conservative stack marking. Only the sources or a disassembly
4201 /* Arrange for X to be put in a register. */
4207 if (longjmps_done
== 1)
4209 /* Came here after the longjmp at the end of the function.
4211 If x == 1, the longjmp has restored the register to its
4212 value before the setjmp, and we can hope that setjmp
4213 saves all such registers in the jmp_buf, although that
4216 For other values of X, either something really strange is
4217 taking place, or the setjmp just didn't save the register. */
4220 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4223 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4230 if (longjmps_done
== 1)
4234 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4237 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4239 /* Abort if anything GCPRO'd doesn't survive the GC. */
4247 for (p
= gcprolist
; p
; p
= p
->next
)
4248 for (i
= 0; i
< p
->nvars
; ++i
)
4249 if (!survives_gc_p (p
->var
[i
]))
4250 /* FIXME: It's not necessarily a bug. It might just be that the
4251 GCPRO is unnecessary or should release the object sooner. */
4255 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4262 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4263 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4265 fprintf (stderr
, " %d = ", i
);
4266 debug_print (zombies
[i
]);
4270 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4273 /* Mark live Lisp objects on the C stack.
4275 There are several system-dependent problems to consider when
4276 porting this to new architectures:
4280 We have to mark Lisp objects in CPU registers that can hold local
4281 variables or are used to pass parameters.
4283 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4284 something that either saves relevant registers on the stack, or
4285 calls mark_maybe_object passing it each register's contents.
4287 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4288 implementation assumes that calling setjmp saves registers we need
4289 to see in a jmp_buf which itself lies on the stack. This doesn't
4290 have to be true! It must be verified for each system, possibly
4291 by taking a look at the source code of setjmp.
4293 If __builtin_unwind_init is available (defined by GCC >= 2.8) we
4294 can use it as a machine independent method to store all registers
4295 to the stack. In this case the macros described in the previous
4296 two paragraphs are not used.
4300 Architectures differ in the way their processor stack is organized.
4301 For example, the stack might look like this
4304 | Lisp_Object | size = 4
4306 | something else | size = 2
4308 | Lisp_Object | size = 4
4312 In such a case, not every Lisp_Object will be aligned equally. To
4313 find all Lisp_Object on the stack it won't be sufficient to walk
4314 the stack in steps of 4 bytes. Instead, two passes will be
4315 necessary, one starting at the start of the stack, and a second
4316 pass starting at the start of the stack + 2. Likewise, if the
4317 minimal alignment of Lisp_Objects on the stack is 1, four passes
4318 would be necessary, each one starting with one byte more offset
4319 from the stack start.
4321 The current code assumes by default that Lisp_Objects are aligned
4322 equally on the stack. */
4330 #ifdef HAVE___BUILTIN_UNWIND_INIT
4331 /* Force callee-saved registers and register windows onto the stack.
4332 This is the preferred method if available, obviating the need for
4333 machine dependent methods. */
4334 __builtin_unwind_init ();
4336 #else /* not HAVE___BUILTIN_UNWIND_INIT */
4337 #ifndef GC_SAVE_REGISTERS_ON_STACK
4338 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4339 union aligned_jmpbuf
{
4343 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4345 /* This trick flushes the register windows so that all the state of
4346 the process is contained in the stack. */
4347 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4348 needed on ia64 too. See mach_dep.c, where it also says inline
4349 assembler doesn't work with relevant proprietary compilers. */
4351 #if defined (__sparc64__) && defined (__FreeBSD__)
4352 /* FreeBSD does not have a ta 3 handler. */
4359 /* Save registers that we need to see on the stack. We need to see
4360 registers used to hold register variables and registers used to
4362 #ifdef GC_SAVE_REGISTERS_ON_STACK
4363 GC_SAVE_REGISTERS_ON_STACK (end
);
4364 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4366 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4367 setjmp will definitely work, test it
4368 and print a message with the result
4370 if (!setjmp_tested_p
)
4372 setjmp_tested_p
= 1;
4375 #endif /* GC_SETJMP_WORKS */
4378 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4379 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4380 #endif /* not HAVE___BUILTIN_UNWIND_INIT */
4382 /* This assumes that the stack is a contiguous region in memory. If
4383 that's not the case, something has to be done here to iterate
4384 over the stack segments. */
4385 #ifndef GC_LISP_OBJECT_ALIGNMENT
4387 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4389 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4392 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4393 mark_memory (stack_base
, end
, i
);
4394 /* Allow for marking a secondary stack, like the register stack on the
4396 #ifdef GC_MARK_SECONDARY_STACK
4397 GC_MARK_SECONDARY_STACK ();
4400 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4405 #endif /* GC_MARK_STACK != 0 */
4408 /* Determine whether it is safe to access memory at address P. */
4410 valid_pointer_p (void *p
)
4413 return w32_valid_pointer_p (p
, 16);
4417 /* Obviously, we cannot just access it (we would SEGV trying), so we
4418 trick the o/s to tell us whether p is a valid pointer.
4419 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4420 not validate p in that case. */
4422 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4424 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4426 unlink ("__Valid__Lisp__Object__");
4434 /* Return 1 if OBJ is a valid lisp object.
4435 Return 0 if OBJ is NOT a valid lisp object.
4436 Return -1 if we cannot validate OBJ.
4437 This function can be quite slow,
4438 so it should only be used in code for manual debugging. */
4441 valid_lisp_object_p (Lisp_Object obj
)
4451 p
= (void *) XPNTR (obj
);
4452 if (PURE_POINTER_P (p
))
4456 return valid_pointer_p (p
);
4463 int valid
= valid_pointer_p (p
);
4475 case MEM_TYPE_NON_LISP
:
4478 case MEM_TYPE_BUFFER
:
4479 return live_buffer_p (m
, p
);
4482 return live_cons_p (m
, p
);
4484 case MEM_TYPE_STRING
:
4485 return live_string_p (m
, p
);
4488 return live_misc_p (m
, p
);
4490 case MEM_TYPE_SYMBOL
:
4491 return live_symbol_p (m
, p
);
4493 case MEM_TYPE_FLOAT
:
4494 return live_float_p (m
, p
);
4496 case MEM_TYPE_VECTORLIKE
:
4497 return live_vector_p (m
, p
);
4510 /***********************************************************************
4511 Pure Storage Management
4512 ***********************************************************************/
4514 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4515 pointer to it. TYPE is the Lisp type for which the memory is
4516 allocated. TYPE < 0 means it's not used for a Lisp object. */
4518 static POINTER_TYPE
*
4519 pure_alloc (size_t size
, int type
)
4521 POINTER_TYPE
*result
;
4523 size_t alignment
= (1 << GCTYPEBITS
);
4525 size_t alignment
= sizeof (EMACS_INT
);
4527 /* Give Lisp_Floats an extra alignment. */
4528 if (type
== Lisp_Float
)
4530 #if defined __GNUC__ && __GNUC__ >= 2
4531 alignment
= __alignof (struct Lisp_Float
);
4533 alignment
= sizeof (struct Lisp_Float
);
4541 /* Allocate space for a Lisp object from the beginning of the free
4542 space with taking account of alignment. */
4543 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4544 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4548 /* Allocate space for a non-Lisp object from the end of the free
4550 pure_bytes_used_non_lisp
+= size
;
4551 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4553 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4555 if (pure_bytes_used
<= pure_size
)
4558 /* Don't allocate a large amount here,
4559 because it might get mmap'd and then its address
4560 might not be usable. */
4561 purebeg
= (char *) xmalloc (10000);
4563 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4564 pure_bytes_used
= 0;
4565 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4570 /* Print a warning if PURESIZE is too small. */
4573 check_pure_size (void)
4575 if (pure_bytes_used_before_overflow
)
4576 message (("emacs:0:Pure Lisp storage overflow (approx. %"pI
"d"
4578 pure_bytes_used
+ pure_bytes_used_before_overflow
);
4582 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4583 the non-Lisp data pool of the pure storage, and return its start
4584 address. Return NULL if not found. */
4587 find_string_data_in_pure (const char *data
, EMACS_INT nbytes
)
4590 EMACS_INT skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4591 const unsigned char *p
;
4594 if (pure_bytes_used_non_lisp
< nbytes
+ 1)
4597 /* Set up the Boyer-Moore table. */
4599 for (i
= 0; i
< 256; i
++)
4602 p
= (const unsigned char *) data
;
4604 bm_skip
[*p
++] = skip
;
4606 last_char_skip
= bm_skip
['\0'];
4608 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4609 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4611 /* See the comments in the function `boyer_moore' (search.c) for the
4612 use of `infinity'. */
4613 infinity
= pure_bytes_used_non_lisp
+ 1;
4614 bm_skip
['\0'] = infinity
;
4616 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
4620 /* Check the last character (== '\0'). */
4623 start
+= bm_skip
[*(p
+ start
)];
4625 while (start
<= start_max
);
4627 if (start
< infinity
)
4628 /* Couldn't find the last character. */
4631 /* No less than `infinity' means we could find the last
4632 character at `p[start - infinity]'. */
4635 /* Check the remaining characters. */
4636 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4638 return non_lisp_beg
+ start
;
4640 start
+= last_char_skip
;
4642 while (start
<= start_max
);
4648 /* Return a string allocated in pure space. DATA is a buffer holding
4649 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4650 non-zero means make the result string multibyte.
4652 Must get an error if pure storage is full, since if it cannot hold
4653 a large string it may be able to hold conses that point to that
4654 string; then the string is not protected from gc. */
4657 make_pure_string (const char *data
,
4658 EMACS_INT nchars
, EMACS_INT nbytes
, int multibyte
)
4661 struct Lisp_String
*s
;
4663 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4664 s
->data
= (unsigned char *) find_string_data_in_pure (data
, nbytes
);
4665 if (s
->data
== NULL
)
4667 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4668 memcpy (s
->data
, data
, nbytes
);
4669 s
->data
[nbytes
] = '\0';
4672 s
->size_byte
= multibyte
? nbytes
: -1;
4673 s
->intervals
= NULL_INTERVAL
;
4674 XSETSTRING (string
, s
);
4678 /* Return a string a string allocated in pure space. Do not allocate
4679 the string data, just point to DATA. */
4682 make_pure_c_string (const char *data
)
4685 struct Lisp_String
*s
;
4686 EMACS_INT nchars
= strlen (data
);
4688 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4691 s
->data
= (unsigned char *) data
;
4692 s
->intervals
= NULL_INTERVAL
;
4693 XSETSTRING (string
, s
);
4697 /* Return a cons allocated from pure space. Give it pure copies
4698 of CAR as car and CDR as cdr. */
4701 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
4703 register Lisp_Object
new;
4704 struct Lisp_Cons
*p
;
4706 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4708 XSETCAR (new, Fpurecopy (car
));
4709 XSETCDR (new, Fpurecopy (cdr
));
4714 /* Value is a float object with value NUM allocated from pure space. */
4717 make_pure_float (double num
)
4719 register Lisp_Object
new;
4720 struct Lisp_Float
*p
;
4722 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4724 XFLOAT_INIT (new, num
);
4729 /* Return a vector with room for LEN Lisp_Objects allocated from
4733 make_pure_vector (EMACS_INT len
)
4736 struct Lisp_Vector
*p
;
4737 size_t size
= (offsetof (struct Lisp_Vector
, contents
)
4738 + len
* sizeof (Lisp_Object
));
4740 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4741 XSETVECTOR (new, p
);
4742 XVECTOR (new)->header
.size
= len
;
4747 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4748 doc
: /* Make a copy of object OBJ in pure storage.
4749 Recursively copies contents of vectors and cons cells.
4750 Does not copy symbols. Copies strings without text properties. */)
4751 (register Lisp_Object obj
)
4753 if (NILP (Vpurify_flag
))
4756 if (PURE_POINTER_P (XPNTR (obj
)))
4759 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4761 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
4767 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
4768 else if (FLOATP (obj
))
4769 obj
= make_pure_float (XFLOAT_DATA (obj
));
4770 else if (STRINGP (obj
))
4771 obj
= make_pure_string (SSDATA (obj
), SCHARS (obj
),
4773 STRING_MULTIBYTE (obj
));
4774 else if (COMPILEDP (obj
) || VECTORP (obj
))
4776 register struct Lisp_Vector
*vec
;
4777 register EMACS_INT i
;
4781 if (size
& PSEUDOVECTOR_FLAG
)
4782 size
&= PSEUDOVECTOR_SIZE_MASK
;
4783 vec
= XVECTOR (make_pure_vector (size
));
4784 for (i
= 0; i
< size
; i
++)
4785 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4786 if (COMPILEDP (obj
))
4788 XSETPVECTYPE (vec
, PVEC_COMPILED
);
4789 XSETCOMPILED (obj
, vec
);
4792 XSETVECTOR (obj
, vec
);
4794 else if (MARKERP (obj
))
4795 error ("Attempt to copy a marker to pure storage");
4797 /* Not purified, don't hash-cons. */
4800 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4801 Fputhash (obj
, obj
, Vpurify_flag
);
4808 /***********************************************************************
4810 ***********************************************************************/
4812 /* Put an entry in staticvec, pointing at the variable with address
4816 staticpro (Lisp_Object
*varaddress
)
4818 staticvec
[staticidx
++] = varaddress
;
4819 if (staticidx
>= NSTATICS
)
4824 /***********************************************************************
4826 ***********************************************************************/
4828 /* Temporarily prevent garbage collection. */
4831 inhibit_garbage_collection (void)
4833 int count
= SPECPDL_INDEX ();
4834 int nbits
= min (VALBITS
, BITS_PER_INT
);
4836 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4841 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4842 doc
: /* Reclaim storage for Lisp objects no longer needed.
4843 Garbage collection happens automatically if you cons more than
4844 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4845 `garbage-collect' normally returns a list with info on amount of space in use:
4846 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4847 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4848 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4849 (USED-STRINGS . FREE-STRINGS))
4850 However, if there was overflow in pure space, `garbage-collect'
4851 returns nil, because real GC can't be done. */)
4854 register struct specbinding
*bind
;
4855 char stack_top_variable
;
4858 Lisp_Object total
[8];
4859 int count
= SPECPDL_INDEX ();
4860 EMACS_TIME t1
, t2
, t3
;
4865 /* Can't GC if pure storage overflowed because we can't determine
4866 if something is a pure object or not. */
4867 if (pure_bytes_used_before_overflow
)
4872 /* Don't keep undo information around forever.
4873 Do this early on, so it is no problem if the user quits. */
4875 register struct buffer
*nextb
= all_buffers
;
4879 /* If a buffer's undo list is Qt, that means that undo is
4880 turned off in that buffer. Calling truncate_undo_list on
4881 Qt tends to return NULL, which effectively turns undo back on.
4882 So don't call truncate_undo_list if undo_list is Qt. */
4883 if (! NILP (nextb
->BUFFER_INTERNAL_FIELD (name
)) && ! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
4884 truncate_undo_list (nextb
);
4886 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4887 if (nextb
->base_buffer
== 0 && !NILP (nextb
->BUFFER_INTERNAL_FIELD (name
))
4888 && ! nextb
->text
->inhibit_shrinking
)
4890 /* If a buffer's gap size is more than 10% of the buffer
4891 size, or larger than 2000 bytes, then shrink it
4892 accordingly. Keep a minimum size of 20 bytes. */
4893 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4895 if (nextb
->text
->gap_size
> size
)
4897 struct buffer
*save_current
= current_buffer
;
4898 current_buffer
= nextb
;
4899 make_gap (-(nextb
->text
->gap_size
- size
));
4900 current_buffer
= save_current
;
4904 nextb
= nextb
->header
.next
.buffer
;
4908 EMACS_GET_TIME (t1
);
4910 /* In case user calls debug_print during GC,
4911 don't let that cause a recursive GC. */
4912 consing_since_gc
= 0;
4914 /* Save what's currently displayed in the echo area. */
4915 message_p
= push_message ();
4916 record_unwind_protect (pop_message_unwind
, Qnil
);
4918 /* Save a copy of the contents of the stack, for debugging. */
4919 #if MAX_SAVE_STACK > 0
4920 if (NILP (Vpurify_flag
))
4924 if (&stack_top_variable
< stack_bottom
)
4926 stack
= &stack_top_variable
;
4927 stack_size
= stack_bottom
- &stack_top_variable
;
4931 stack
= stack_bottom
;
4932 stack_size
= &stack_top_variable
- stack_bottom
;
4934 if (stack_size
<= MAX_SAVE_STACK
)
4936 if (stack_copy_size
< stack_size
)
4938 stack_copy
= (char *) xrealloc (stack_copy
, stack_size
);
4939 stack_copy_size
= stack_size
;
4941 memcpy (stack_copy
, stack
, stack_size
);
4944 #endif /* MAX_SAVE_STACK > 0 */
4946 if (garbage_collection_messages
)
4947 message1_nolog ("Garbage collecting...");
4951 shrink_regexp_cache ();
4955 /* clear_marks (); */
4957 /* Mark all the special slots that serve as the roots of accessibility. */
4959 for (i
= 0; i
< staticidx
; i
++)
4960 mark_object (*staticvec
[i
]);
4962 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4964 mark_object (bind
->symbol
);
4965 mark_object (bind
->old_value
);
4973 extern void xg_mark_data (void);
4978 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
4979 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
4983 register struct gcpro
*tail
;
4984 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4985 for (i
= 0; i
< tail
->nvars
; i
++)
4986 mark_object (tail
->var
[i
]);
4990 struct catchtag
*catch;
4991 struct handler
*handler
;
4993 for (catch = catchlist
; catch; catch = catch->next
)
4995 mark_object (catch->tag
);
4996 mark_object (catch->val
);
4998 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5000 mark_object (handler
->handler
);
5001 mark_object (handler
->var
);
5007 #ifdef HAVE_WINDOW_SYSTEM
5008 mark_fringe_data ();
5011 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5015 /* Everything is now marked, except for the things that require special
5016 finalization, i.e. the undo_list.
5017 Look thru every buffer's undo list
5018 for elements that update markers that were not marked,
5021 register struct buffer
*nextb
= all_buffers
;
5025 /* If a buffer's undo list is Qt, that means that undo is
5026 turned off in that buffer. Calling truncate_undo_list on
5027 Qt tends to return NULL, which effectively turns undo back on.
5028 So don't call truncate_undo_list if undo_list is Qt. */
5029 if (! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
5031 Lisp_Object tail
, prev
;
5032 tail
= nextb
->BUFFER_INTERNAL_FIELD (undo_list
);
5034 while (CONSP (tail
))
5036 if (CONSP (XCAR (tail
))
5037 && MARKERP (XCAR (XCAR (tail
)))
5038 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5041 nextb
->BUFFER_INTERNAL_FIELD (undo_list
) = tail
= XCDR (tail
);
5045 XSETCDR (prev
, tail
);
5055 /* Now that we have stripped the elements that need not be in the
5056 undo_list any more, we can finally mark the list. */
5057 mark_object (nextb
->BUFFER_INTERNAL_FIELD (undo_list
));
5059 nextb
= nextb
->header
.next
.buffer
;
5065 /* Clear the mark bits that we set in certain root slots. */
5067 unmark_byte_stack ();
5068 VECTOR_UNMARK (&buffer_defaults
);
5069 VECTOR_UNMARK (&buffer_local_symbols
);
5071 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5079 /* clear_marks (); */
5082 consing_since_gc
= 0;
5083 if (gc_cons_threshold
< 10000)
5084 gc_cons_threshold
= 10000;
5086 if (FLOATP (Vgc_cons_percentage
))
5087 { /* Set gc_cons_combined_threshold. */
5090 tot
+= total_conses
* sizeof (struct Lisp_Cons
);
5091 tot
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5092 tot
+= total_markers
* sizeof (union Lisp_Misc
);
5093 tot
+= total_string_size
;
5094 tot
+= total_vector_size
* sizeof (Lisp_Object
);
5095 tot
+= total_floats
* sizeof (struct Lisp_Float
);
5096 tot
+= total_intervals
* sizeof (struct interval
);
5097 tot
+= total_strings
* sizeof (struct Lisp_String
);
5099 gc_relative_threshold
= tot
* XFLOAT_DATA (Vgc_cons_percentage
);
5102 gc_relative_threshold
= 0;
5104 if (garbage_collection_messages
)
5106 if (message_p
|| minibuf_level
> 0)
5109 message1_nolog ("Garbage collecting...done");
5112 unbind_to (count
, Qnil
);
5114 total
[0] = Fcons (make_number (total_conses
),
5115 make_number (total_free_conses
));
5116 total
[1] = Fcons (make_number (total_symbols
),
5117 make_number (total_free_symbols
));
5118 total
[2] = Fcons (make_number (total_markers
),
5119 make_number (total_free_markers
));
5120 total
[3] = make_number (total_string_size
);
5121 total
[4] = make_number (total_vector_size
);
5122 total
[5] = Fcons (make_number (total_floats
),
5123 make_number (total_free_floats
));
5124 total
[6] = Fcons (make_number (total_intervals
),
5125 make_number (total_free_intervals
));
5126 total
[7] = Fcons (make_number (total_strings
),
5127 make_number (total_free_strings
));
5129 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5131 /* Compute average percentage of zombies. */
5134 for (i
= 0; i
< 7; ++i
)
5135 if (CONSP (total
[i
]))
5136 nlive
+= XFASTINT (XCAR (total
[i
]));
5138 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5139 max_live
= max (nlive
, max_live
);
5140 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5141 max_zombies
= max (nzombies
, max_zombies
);
5146 if (!NILP (Vpost_gc_hook
))
5148 int gc_count
= inhibit_garbage_collection ();
5149 safe_run_hooks (Qpost_gc_hook
);
5150 unbind_to (gc_count
, Qnil
);
5153 /* Accumulate statistics. */
5154 EMACS_GET_TIME (t2
);
5155 EMACS_SUB_TIME (t3
, t2
, t1
);
5156 if (FLOATP (Vgc_elapsed
))
5157 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5159 EMACS_USECS (t3
) * 1.0e-6);
5162 return Flist (sizeof total
/ sizeof *total
, total
);
5166 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5167 only interesting objects referenced from glyphs are strings. */
5170 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5172 struct glyph_row
*row
= matrix
->rows
;
5173 struct glyph_row
*end
= row
+ matrix
->nrows
;
5175 for (; row
< end
; ++row
)
5179 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5181 struct glyph
*glyph
= row
->glyphs
[area
];
5182 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5184 for (; glyph
< end_glyph
; ++glyph
)
5185 if (STRINGP (glyph
->object
)
5186 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5187 mark_object (glyph
->object
);
5193 /* Mark Lisp faces in the face cache C. */
5196 mark_face_cache (struct face_cache
*c
)
5201 for (i
= 0; i
< c
->used
; ++i
)
5203 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5207 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5208 mark_object (face
->lface
[j
]);
5216 /* Mark reference to a Lisp_Object.
5217 If the object referred to has not been seen yet, recursively mark
5218 all the references contained in it. */
5220 #define LAST_MARKED_SIZE 500
5221 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5222 static int last_marked_index
;
5224 /* For debugging--call abort when we cdr down this many
5225 links of a list, in mark_object. In debugging,
5226 the call to abort will hit a breakpoint.
5227 Normally this is zero and the check never goes off. */
5228 static size_t mark_object_loop_halt
;
5231 mark_vectorlike (struct Lisp_Vector
*ptr
)
5233 register EMACS_UINT size
= ptr
->header
.size
;
5234 register EMACS_UINT i
;
5236 eassert (!VECTOR_MARKED_P (ptr
));
5237 VECTOR_MARK (ptr
); /* Else mark it */
5238 if (size
& PSEUDOVECTOR_FLAG
)
5239 size
&= PSEUDOVECTOR_SIZE_MASK
;
5241 /* Note that this size is not the memory-footprint size, but only
5242 the number of Lisp_Object fields that we should trace.
5243 The distinction is used e.g. by Lisp_Process which places extra
5244 non-Lisp_Object fields at the end of the structure. */
5245 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5246 mark_object (ptr
->contents
[i
]);
5249 /* Like mark_vectorlike but optimized for char-tables (and
5250 sub-char-tables) assuming that the contents are mostly integers or
5254 mark_char_table (struct Lisp_Vector
*ptr
)
5256 register EMACS_UINT size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5257 register EMACS_UINT i
;
5259 eassert (!VECTOR_MARKED_P (ptr
));
5261 for (i
= 0; i
< size
; i
++)
5263 Lisp_Object val
= ptr
->contents
[i
];
5265 if (INTEGERP (val
) || (SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
))
5267 if (SUB_CHAR_TABLE_P (val
))
5269 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5270 mark_char_table (XVECTOR (val
));
5278 mark_object (Lisp_Object arg
)
5280 register Lisp_Object obj
= arg
;
5281 #ifdef GC_CHECK_MARKED_OBJECTS
5285 size_t cdr_count
= 0;
5289 if (PURE_POINTER_P (XPNTR (obj
)))
5292 last_marked
[last_marked_index
++] = obj
;
5293 if (last_marked_index
== LAST_MARKED_SIZE
)
5294 last_marked_index
= 0;
5296 /* Perform some sanity checks on the objects marked here. Abort if
5297 we encounter an object we know is bogus. This increases GC time
5298 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5299 #ifdef GC_CHECK_MARKED_OBJECTS
5301 po
= (void *) XPNTR (obj
);
5303 /* Check that the object pointed to by PO is known to be a Lisp
5304 structure allocated from the heap. */
5305 #define CHECK_ALLOCATED() \
5307 m = mem_find (po); \
5312 /* Check that the object pointed to by PO is live, using predicate
5314 #define CHECK_LIVE(LIVEP) \
5316 if (!LIVEP (m, po)) \
5320 /* Check both of the above conditions. */
5321 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5323 CHECK_ALLOCATED (); \
5324 CHECK_LIVE (LIVEP); \
5327 #else /* not GC_CHECK_MARKED_OBJECTS */
5329 #define CHECK_LIVE(LIVEP) (void) 0
5330 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5332 #endif /* not GC_CHECK_MARKED_OBJECTS */
5334 switch (SWITCH_ENUM_CAST (XTYPE (obj
)))
5338 register struct Lisp_String
*ptr
= XSTRING (obj
);
5339 if (STRING_MARKED_P (ptr
))
5341 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5342 MARK_INTERVAL_TREE (ptr
->intervals
);
5344 #ifdef GC_CHECK_STRING_BYTES
5345 /* Check that the string size recorded in the string is the
5346 same as the one recorded in the sdata structure. */
5347 CHECK_STRING_BYTES (ptr
);
5348 #endif /* GC_CHECK_STRING_BYTES */
5352 case Lisp_Vectorlike
:
5353 if (VECTOR_MARKED_P (XVECTOR (obj
)))
5355 #ifdef GC_CHECK_MARKED_OBJECTS
5357 if (m
== MEM_NIL
&& !SUBRP (obj
)
5358 && po
!= &buffer_defaults
5359 && po
!= &buffer_local_symbols
)
5361 #endif /* GC_CHECK_MARKED_OBJECTS */
5365 #ifdef GC_CHECK_MARKED_OBJECTS
5366 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5369 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->header
.next
.buffer
)
5374 #endif /* GC_CHECK_MARKED_OBJECTS */
5377 else if (SUBRP (obj
))
5379 else if (COMPILEDP (obj
))
5380 /* We could treat this just like a vector, but it is better to
5381 save the COMPILED_CONSTANTS element for last and avoid
5384 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5385 register EMACS_UINT size
= ptr
->header
.size
;
5386 register EMACS_UINT i
;
5388 CHECK_LIVE (live_vector_p
);
5389 VECTOR_MARK (ptr
); /* Else mark it */
5390 size
&= PSEUDOVECTOR_SIZE_MASK
;
5391 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5393 if (i
!= COMPILED_CONSTANTS
)
5394 mark_object (ptr
->contents
[i
]);
5396 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5399 else if (FRAMEP (obj
))
5401 register struct frame
*ptr
= XFRAME (obj
);
5402 mark_vectorlike (XVECTOR (obj
));
5403 mark_face_cache (ptr
->face_cache
);
5405 else if (WINDOWP (obj
))
5407 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5408 struct window
*w
= XWINDOW (obj
);
5409 mark_vectorlike (ptr
);
5410 /* Mark glyphs for leaf windows. Marking window matrices is
5411 sufficient because frame matrices use the same glyph
5413 if (NILP (w
->hchild
)
5415 && w
->current_matrix
)
5417 mark_glyph_matrix (w
->current_matrix
);
5418 mark_glyph_matrix (w
->desired_matrix
);
5421 else if (HASH_TABLE_P (obj
))
5423 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5424 mark_vectorlike ((struct Lisp_Vector
*)h
);
5425 /* If hash table is not weak, mark all keys and values.
5426 For weak tables, mark only the vector. */
5428 mark_object (h
->key_and_value
);
5430 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5432 else if (CHAR_TABLE_P (obj
))
5433 mark_char_table (XVECTOR (obj
));
5435 mark_vectorlike (XVECTOR (obj
));
5440 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5441 struct Lisp_Symbol
*ptrx
;
5445 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5447 mark_object (ptr
->function
);
5448 mark_object (ptr
->plist
);
5449 switch (ptr
->redirect
)
5451 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
5452 case SYMBOL_VARALIAS
:
5455 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
5459 case SYMBOL_LOCALIZED
:
5461 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
5462 /* If the value is forwarded to a buffer or keyboard field,
5463 these are marked when we see the corresponding object.
5464 And if it's forwarded to a C variable, either it's not
5465 a Lisp_Object var, or it's staticpro'd already. */
5466 mark_object (blv
->where
);
5467 mark_object (blv
->valcell
);
5468 mark_object (blv
->defcell
);
5471 case SYMBOL_FORWARDED
:
5472 /* If the value is forwarded to a buffer or keyboard field,
5473 these are marked when we see the corresponding object.
5474 And if it's forwarded to a C variable, either it's not
5475 a Lisp_Object var, or it's staticpro'd already. */
5479 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5480 MARK_STRING (XSTRING (ptr
->xname
));
5481 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5486 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5487 XSETSYMBOL (obj
, ptrx
);
5494 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5495 if (XMISCANY (obj
)->gcmarkbit
)
5497 XMISCANY (obj
)->gcmarkbit
= 1;
5499 switch (XMISCTYPE (obj
))
5502 case Lisp_Misc_Marker
:
5503 /* DO NOT mark thru the marker's chain.
5504 The buffer's markers chain does not preserve markers from gc;
5505 instead, markers are removed from the chain when freed by gc. */
5508 case Lisp_Misc_Save_Value
:
5511 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5512 /* If DOGC is set, POINTER is the address of a memory
5513 area containing INTEGER potential Lisp_Objects. */
5516 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5518 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5519 mark_maybe_object (*p
);
5525 case Lisp_Misc_Overlay
:
5527 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5528 mark_object (ptr
->start
);
5529 mark_object (ptr
->end
);
5530 mark_object (ptr
->plist
);
5533 XSETMISC (obj
, ptr
->next
);
5546 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5547 if (CONS_MARKED_P (ptr
))
5549 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5551 /* If the cdr is nil, avoid recursion for the car. */
5552 if (EQ (ptr
->u
.cdr
, Qnil
))
5558 mark_object (ptr
->car
);
5561 if (cdr_count
== mark_object_loop_halt
)
5567 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5568 FLOAT_MARK (XFLOAT (obj
));
5579 #undef CHECK_ALLOCATED
5580 #undef CHECK_ALLOCATED_AND_LIVE
5583 /* Mark the pointers in a buffer structure. */
5586 mark_buffer (Lisp_Object buf
)
5588 register struct buffer
*buffer
= XBUFFER (buf
);
5589 register Lisp_Object
*ptr
, tmp
;
5590 Lisp_Object base_buffer
;
5592 eassert (!VECTOR_MARKED_P (buffer
));
5593 VECTOR_MARK (buffer
);
5595 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5597 /* For now, we just don't mark the undo_list. It's done later in
5598 a special way just before the sweep phase, and after stripping
5599 some of its elements that are not needed any more. */
5601 if (buffer
->overlays_before
)
5603 XSETMISC (tmp
, buffer
->overlays_before
);
5606 if (buffer
->overlays_after
)
5608 XSETMISC (tmp
, buffer
->overlays_after
);
5612 /* buffer-local Lisp variables start at `undo_list',
5613 tho only the ones from `name' on are GC'd normally. */
5614 for (ptr
= &buffer
->BUFFER_INTERNAL_FIELD (name
);
5615 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5619 /* If this is an indirect buffer, mark its base buffer. */
5620 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5622 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5623 mark_buffer (base_buffer
);
5627 /* Mark the Lisp pointers in the terminal objects.
5628 Called by the Fgarbage_collector. */
5631 mark_terminals (void)
5634 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5636 eassert (t
->name
!= NULL
);
5637 #ifdef HAVE_WINDOW_SYSTEM
5638 /* If a terminal object is reachable from a stacpro'ed object,
5639 it might have been marked already. Make sure the image cache
5641 mark_image_cache (t
->image_cache
);
5642 #endif /* HAVE_WINDOW_SYSTEM */
5643 if (!VECTOR_MARKED_P (t
))
5644 mark_vectorlike ((struct Lisp_Vector
*)t
);
5650 /* Value is non-zero if OBJ will survive the current GC because it's
5651 either marked or does not need to be marked to survive. */
5654 survives_gc_p (Lisp_Object obj
)
5658 switch (XTYPE (obj
))
5665 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5669 survives_p
= XMISCANY (obj
)->gcmarkbit
;
5673 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5676 case Lisp_Vectorlike
:
5677 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5681 survives_p
= CONS_MARKED_P (XCONS (obj
));
5685 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5692 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5697 /* Sweep: find all structures not marked, and free them. */
5702 /* Remove or mark entries in weak hash tables.
5703 This must be done before any object is unmarked. */
5704 sweep_weak_hash_tables ();
5707 #ifdef GC_CHECK_STRING_BYTES
5708 if (!noninteractive
)
5709 check_string_bytes (1);
5712 /* Put all unmarked conses on free list */
5714 register struct cons_block
*cblk
;
5715 struct cons_block
**cprev
= &cons_block
;
5716 register int lim
= cons_block_index
;
5717 register int num_free
= 0, num_used
= 0;
5721 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5725 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
5727 /* Scan the mark bits an int at a time. */
5728 for (i
= 0; i
<= ilim
; i
++)
5730 if (cblk
->gcmarkbits
[i
] == -1)
5732 /* Fast path - all cons cells for this int are marked. */
5733 cblk
->gcmarkbits
[i
] = 0;
5734 num_used
+= BITS_PER_INT
;
5738 /* Some cons cells for this int are not marked.
5739 Find which ones, and free them. */
5740 int start
, pos
, stop
;
5742 start
= i
* BITS_PER_INT
;
5744 if (stop
> BITS_PER_INT
)
5745 stop
= BITS_PER_INT
;
5748 for (pos
= start
; pos
< stop
; pos
++)
5750 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
5753 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
5754 cons_free_list
= &cblk
->conses
[pos
];
5756 cons_free_list
->car
= Vdead
;
5762 CONS_UNMARK (&cblk
->conses
[pos
]);
5768 lim
= CONS_BLOCK_SIZE
;
5769 /* If this block contains only free conses and we have already
5770 seen more than two blocks worth of free conses then deallocate
5772 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5774 *cprev
= cblk
->next
;
5775 /* Unhook from the free list. */
5776 cons_free_list
= cblk
->conses
[0].u
.chain
;
5777 lisp_align_free (cblk
);
5782 num_free
+= this_free
;
5783 cprev
= &cblk
->next
;
5786 total_conses
= num_used
;
5787 total_free_conses
= num_free
;
5790 /* Put all unmarked floats on free list */
5792 register struct float_block
*fblk
;
5793 struct float_block
**fprev
= &float_block
;
5794 register int lim
= float_block_index
;
5795 register int num_free
= 0, num_used
= 0;
5797 float_free_list
= 0;
5799 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5803 for (i
= 0; i
< lim
; i
++)
5804 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5807 fblk
->floats
[i
].u
.chain
= float_free_list
;
5808 float_free_list
= &fblk
->floats
[i
];
5813 FLOAT_UNMARK (&fblk
->floats
[i
]);
5815 lim
= FLOAT_BLOCK_SIZE
;
5816 /* If this block contains only free floats and we have already
5817 seen more than two blocks worth of free floats then deallocate
5819 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5821 *fprev
= fblk
->next
;
5822 /* Unhook from the free list. */
5823 float_free_list
= fblk
->floats
[0].u
.chain
;
5824 lisp_align_free (fblk
);
5829 num_free
+= this_free
;
5830 fprev
= &fblk
->next
;
5833 total_floats
= num_used
;
5834 total_free_floats
= num_free
;
5837 /* Put all unmarked intervals on free list */
5839 register struct interval_block
*iblk
;
5840 struct interval_block
**iprev
= &interval_block
;
5841 register int lim
= interval_block_index
;
5842 register int num_free
= 0, num_used
= 0;
5844 interval_free_list
= 0;
5846 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5851 for (i
= 0; i
< lim
; i
++)
5853 if (!iblk
->intervals
[i
].gcmarkbit
)
5855 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5856 interval_free_list
= &iblk
->intervals
[i
];
5862 iblk
->intervals
[i
].gcmarkbit
= 0;
5865 lim
= INTERVAL_BLOCK_SIZE
;
5866 /* If this block contains only free intervals and we have already
5867 seen more than two blocks worth of free intervals then
5868 deallocate this block. */
5869 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5871 *iprev
= iblk
->next
;
5872 /* Unhook from the free list. */
5873 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5875 n_interval_blocks
--;
5879 num_free
+= this_free
;
5880 iprev
= &iblk
->next
;
5883 total_intervals
= num_used
;
5884 total_free_intervals
= num_free
;
5887 /* Put all unmarked symbols on free list */
5889 register struct symbol_block
*sblk
;
5890 struct symbol_block
**sprev
= &symbol_block
;
5891 register int lim
= symbol_block_index
;
5892 register int num_free
= 0, num_used
= 0;
5894 symbol_free_list
= NULL
;
5896 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5899 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5900 struct Lisp_Symbol
*end
= sym
+ lim
;
5902 for (; sym
< end
; ++sym
)
5904 /* Check if the symbol was created during loadup. In such a case
5905 it might be pointed to by pure bytecode which we don't trace,
5906 so we conservatively assume that it is live. */
5907 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5909 if (!sym
->gcmarkbit
&& !pure_p
)
5911 if (sym
->redirect
== SYMBOL_LOCALIZED
)
5912 xfree (SYMBOL_BLV (sym
));
5913 sym
->next
= symbol_free_list
;
5914 symbol_free_list
= sym
;
5916 symbol_free_list
->function
= Vdead
;
5924 UNMARK_STRING (XSTRING (sym
->xname
));
5929 lim
= SYMBOL_BLOCK_SIZE
;
5930 /* If this block contains only free symbols and we have already
5931 seen more than two blocks worth of free symbols then deallocate
5933 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5935 *sprev
= sblk
->next
;
5936 /* Unhook from the free list. */
5937 symbol_free_list
= sblk
->symbols
[0].next
;
5943 num_free
+= this_free
;
5944 sprev
= &sblk
->next
;
5947 total_symbols
= num_used
;
5948 total_free_symbols
= num_free
;
5951 /* Put all unmarked misc's on free list.
5952 For a marker, first unchain it from the buffer it points into. */
5954 register struct marker_block
*mblk
;
5955 struct marker_block
**mprev
= &marker_block
;
5956 register int lim
= marker_block_index
;
5957 register int num_free
= 0, num_used
= 0;
5959 marker_free_list
= 0;
5961 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5966 for (i
= 0; i
< lim
; i
++)
5968 if (!mblk
->markers
[i
].u_any
.gcmarkbit
)
5970 if (mblk
->markers
[i
].u_any
.type
== Lisp_Misc_Marker
)
5971 unchain_marker (&mblk
->markers
[i
].u_marker
);
5972 /* Set the type of the freed object to Lisp_Misc_Free.
5973 We could leave the type alone, since nobody checks it,
5974 but this might catch bugs faster. */
5975 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
5976 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
5977 marker_free_list
= &mblk
->markers
[i
];
5983 mblk
->markers
[i
].u_any
.gcmarkbit
= 0;
5986 lim
= MARKER_BLOCK_SIZE
;
5987 /* If this block contains only free markers and we have already
5988 seen more than two blocks worth of free markers then deallocate
5990 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
5992 *mprev
= mblk
->next
;
5993 /* Unhook from the free list. */
5994 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
6000 num_free
+= this_free
;
6001 mprev
= &mblk
->next
;
6005 total_markers
= num_used
;
6006 total_free_markers
= num_free
;
6009 /* Free all unmarked buffers */
6011 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6014 if (!VECTOR_MARKED_P (buffer
))
6017 prev
->header
.next
= buffer
->header
.next
;
6019 all_buffers
= buffer
->header
.next
.buffer
;
6020 next
= buffer
->header
.next
.buffer
;
6026 VECTOR_UNMARK (buffer
);
6027 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6028 prev
= buffer
, buffer
= buffer
->header
.next
.buffer
;
6032 /* Free all unmarked vectors */
6034 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6035 total_vector_size
= 0;
6038 if (!VECTOR_MARKED_P (vector
))
6041 prev
->header
.next
= vector
->header
.next
;
6043 all_vectors
= vector
->header
.next
.vector
;
6044 next
= vector
->header
.next
.vector
;
6052 VECTOR_UNMARK (vector
);
6053 if (vector
->header
.size
& PSEUDOVECTOR_FLAG
)
6054 total_vector_size
+= PSEUDOVECTOR_SIZE_MASK
& vector
->header
.size
;
6056 total_vector_size
+= vector
->header
.size
;
6057 prev
= vector
, vector
= vector
->header
.next
.vector
;
6061 #ifdef GC_CHECK_STRING_BYTES
6062 if (!noninteractive
)
6063 check_string_bytes (1);
6070 /* Debugging aids. */
6072 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6073 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6074 This may be helpful in debugging Emacs's memory usage.
6075 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6080 XSETINT (end
, (intptr_t) (char *) sbrk (0) / 1024);
6085 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6086 doc
: /* Return a list of counters that measure how much consing there has been.
6087 Each of these counters increments for a certain kind of object.
6088 The counters wrap around from the largest positive integer to zero.
6089 Garbage collection does not decrease them.
6090 The elements of the value are as follows:
6091 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6092 All are in units of 1 = one object consed
6093 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6095 MISCS include overlays, markers, and some internal types.
6096 Frames, windows, buffers, and subprocesses count as vectors
6097 (but the contents of a buffer's text do not count here). */)
6100 Lisp_Object consed
[8];
6102 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6103 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6104 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6105 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6106 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6107 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6108 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6109 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6111 return Flist (8, consed
);
6114 #ifdef ENABLE_CHECKING
6115 int suppress_checking
;
6118 die (const char *msg
, const char *file
, int line
)
6120 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6126 /* Initialization */
6129 init_alloc_once (void)
6131 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6133 pure_size
= PURESIZE
;
6134 pure_bytes_used
= 0;
6135 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6136 pure_bytes_used_before_overflow
= 0;
6138 /* Initialize the list of free aligned blocks. */
6141 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6143 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6147 ignore_warnings
= 1;
6148 #ifdef DOUG_LEA_MALLOC
6149 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6150 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6151 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6159 init_weak_hash_tables ();
6162 malloc_hysteresis
= 32;
6164 malloc_hysteresis
= 0;
6167 refill_memory_reserve ();
6169 ignore_warnings
= 0;
6171 byte_stack_list
= 0;
6173 consing_since_gc
= 0;
6174 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6175 gc_relative_threshold
= 0;
6182 byte_stack_list
= 0;
6184 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6185 setjmp_tested_p
= longjmps_done
= 0;
6188 Vgc_elapsed
= make_float (0.0);
6193 syms_of_alloc (void)
6195 DEFVAR_INT ("gc-cons-threshold", gc_cons_threshold
,
6196 doc
: /* *Number of bytes of consing between garbage collections.
6197 Garbage collection can happen automatically once this many bytes have been
6198 allocated since the last garbage collection. All data types count.
6200 Garbage collection happens automatically only when `eval' is called.
6202 By binding this temporarily to a large number, you can effectively
6203 prevent garbage collection during a part of the program.
6204 See also `gc-cons-percentage'. */);
6206 DEFVAR_LISP ("gc-cons-percentage", Vgc_cons_percentage
,
6207 doc
: /* *Portion of the heap used for allocation.
6208 Garbage collection can happen automatically once this portion of the heap
6209 has been allocated since the last garbage collection.
6210 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6211 Vgc_cons_percentage
= make_float (0.1);
6213 DEFVAR_INT ("pure-bytes-used", pure_bytes_used
,
6214 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6216 DEFVAR_INT ("cons-cells-consed", cons_cells_consed
,
6217 doc
: /* Number of cons cells that have been consed so far. */);
6219 DEFVAR_INT ("floats-consed", floats_consed
,
6220 doc
: /* Number of floats that have been consed so far. */);
6222 DEFVAR_INT ("vector-cells-consed", vector_cells_consed
,
6223 doc
: /* Number of vector cells that have been consed so far. */);
6225 DEFVAR_INT ("symbols-consed", symbols_consed
,
6226 doc
: /* Number of symbols that have been consed so far. */);
6228 DEFVAR_INT ("string-chars-consed", string_chars_consed
,
6229 doc
: /* Number of string characters that have been consed so far. */);
6231 DEFVAR_INT ("misc-objects-consed", misc_objects_consed
,
6232 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6234 DEFVAR_INT ("intervals-consed", intervals_consed
,
6235 doc
: /* Number of intervals that have been consed so far. */);
6237 DEFVAR_INT ("strings-consed", strings_consed
,
6238 doc
: /* Number of strings that have been consed so far. */);
6240 DEFVAR_LISP ("purify-flag", Vpurify_flag
,
6241 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6242 This means that certain objects should be allocated in shared (pure) space.
6243 It can also be set to a hash-table, in which case this table is used to
6244 do hash-consing of the objects allocated to pure space. */);
6246 DEFVAR_BOOL ("garbage-collection-messages", garbage_collection_messages
,
6247 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6248 garbage_collection_messages
= 0;
6250 DEFVAR_LISP ("post-gc-hook", Vpost_gc_hook
,
6251 doc
: /* Hook run after garbage collection has finished. */);
6252 Vpost_gc_hook
= Qnil
;
6253 Qpost_gc_hook
= intern_c_string ("post-gc-hook");
6254 staticpro (&Qpost_gc_hook
);
6256 DEFVAR_LISP ("memory-signal-data", Vmemory_signal_data
,
6257 doc
: /* Precomputed `signal' argument for memory-full error. */);
6258 /* We build this in advance because if we wait until we need it, we might
6259 not be able to allocate the memory to hold it. */
6261 = pure_cons (Qerror
,
6262 pure_cons (make_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"), Qnil
));
6264 DEFVAR_LISP ("memory-full", Vmemory_full
,
6265 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6266 Vmemory_full
= Qnil
;
6268 staticpro (&Qgc_cons_threshold
);
6269 Qgc_cons_threshold
= intern_c_string ("gc-cons-threshold");
6271 staticpro (&Qchar_table_extra_slots
);
6272 Qchar_table_extra_slots
= intern_c_string ("char-table-extra-slots");
6274 DEFVAR_LISP ("gc-elapsed", Vgc_elapsed
,
6275 doc
: /* Accumulated time elapsed in garbage collections.
6276 The time is in seconds as a floating point value. */);
6277 DEFVAR_INT ("gcs-done", gcs_done
,
6278 doc
: /* Accumulated number of garbage collections done. */);
6283 defsubr (&Smake_byte_code
);
6284 defsubr (&Smake_list
);
6285 defsubr (&Smake_vector
);
6286 defsubr (&Smake_string
);
6287 defsubr (&Smake_bool_vector
);
6288 defsubr (&Smake_symbol
);
6289 defsubr (&Smake_marker
);
6290 defsubr (&Spurecopy
);
6291 defsubr (&Sgarbage_collect
);
6292 defsubr (&Smemory_limit
);
6293 defsubr (&Smemory_use_counts
);
6295 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6296 defsubr (&Sgc_status
);